From bf26703b2d384fe103e33a702381fd364a0c0e01 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?R=C3=A2u=20Cao?= Date: Fri, 18 Oct 2024 18:29:10 +0200 Subject: [PATCH] Remove client-side nostr discovery --- .../settings/nostr_pubkey_controller.js | 180 +- config/importmap.rb | 1 - vendor/gems/nostr | 1 - vendor/javascript/nostrify.js | 11690 ---------------- vendor/javascript/nostrify.js.map | 1 - 5 files changed, 1 insertion(+), 11872 deletions(-) delete mode 160000 vendor/gems/nostr delete mode 100644 vendor/javascript/nostrify.js delete mode 100644 vendor/javascript/nostrify.js.map diff --git a/app/javascript/controllers/settings/nostr_pubkey_controller.js b/app/javascript/controllers/settings/nostr_pubkey_controller.js index 9bf07da..4de30e5 100644 --- a/app/javascript/controllers/settings/nostr_pubkey_controller.js +++ b/app/javascript/controllers/settings/nostr_pubkey_controller.js @@ -1,14 +1,8 @@ import { Controller } from "@hotwired/stimulus" -import { Nostrify } from "nostrify" // Connects to data-controller="settings--nostr-pubkey" export default class extends Controller { - static targets = [ - "noExtension", - "setPubkey", "pubkeyBech32Input", - "relayList", "relayListStatus", - "profileStatusNip05", "profileStatusLud16" - ] + static targets = [ "noExtension", "setPubkey", "pubkeyBech32Input" ] static values = { userAddress: String, pubkeyHex: String, @@ -21,14 +15,6 @@ export default class extends Controller { if (this.hasSetPubkeyTarget) { this.setPubkeyTarget.disabled = false } - - if (this.pubkeyHexValue) { - // this.discoverUserOnNostr().then(() => { - // this.renderRelayStatus() - // this.renderProfileNip05Status() - // this.renderProfileLud16Status() - // }) - } } else { this.noExtensionTarget.classList.remove("hidden") } @@ -63,172 +49,8 @@ export default class extends Controller { } } - async discoverUserOnNostr () { - this.nip65Relays = await this.findUserRelays() - this.profile = await this.findUserProfile() - } - - async findUserRelays () { - const controller = new AbortController(); - const signal = controller.signal; - const filters = [{ kinds: [10002], authors: [this.pubkeyHexValue], limit: 1 }] - const messages = [] - - for await (const msg of this.discoveryPool.req(filters, { signal })) { - if (msg[0] === 'EVENT') { - if (!messages.find(m => m.id === msg[2].id)) { - messages.push(msg[2]) - } - } - if (msg[0] === 'EOSE') { break } - } - - // Close the relay subscription - controller.abort() - if (messages.length === 0) { return messages } - - const sortedMessages = messages.sort((a, b) => a.createdAt - b.createdAt) - const newestMessage = messages[messages.length - 1] - - return newestMessage.tags.filter(t => t[0] === 'r') - .map(t => { return { url: t[1], marker: t[2] } }) - } - - async findUserProfile () { - const controller = new AbortController(); - const signal = controller.signal; - const filters = [{ kinds: [0], authors: [this.pubkeyHexValue], limit: 1 }] - const messages = [] - - for await (const msg of this.discoveryPool.req(filters, { signal })) { - if (msg[0] === 'EVENT') { - if (!messages.find(m => m.id === msg[2].id)) { - messages.push(msg[2]) - } - } - if (msg[0] === 'EOSE') { break } - } - - // Close the relay subscription - controller.abort() - if (messages.length === 0) { return null } - - const sortedMessages = messages.sort((a, b) => a.createdAt - b.createdAt) - const newestMessage = messages[messages.length - 1] - - return JSON.parse(newestMessage.content) - } - - renderRelayStatus () { - let showStatus - - if (this.nip65Relays.length > 0) { - if (this.relaysContainAccountsRelay) { - showStatus = 'green' - } else { - showStatus = 'orange' - } - } else { - showStatus = 'red' - } - // showStatus = 'red' - - this.relayListStatusTarget - .querySelector(`.status-${showStatus}`) - .classList.remove("hidden") - } - - renderProfileNip05Status () { - let showStatus - - if (this.profile?.nip05) { - if (this.profile.nip05 === this.userAddressValue) { - showStatus = 'green' - } else { - showStatus = 'red' - } - } else { - showStatus = 'orange' - } - - this.profileStatusNip05Target - .querySelector(`.status-${showStatus}`) - .classList.remove("hidden") - } - - renderProfileLud16Status () { - let showStatus - - if (this.profile?.lud16) { - if (this.profile.lud16 === this.userAddressValue) { - showStatus = 'green' - } else { - showStatus = 'red' - } - } else { - showStatus = 'orange' - } - - this.profileStatusLud16Target - .querySelector(`.status-${showStatus}`) - .classList.remove("hidden") - } - - // renderRelayList (relays) { - // const html = relays.map(relay => ` - //
  • - // ${relay.url} - // - //
    • - // `).join("") - // - // this.relayListTarget.innerHTML = html - // } - get csrfToken () { const element = document.head.querySelector('meta[name="csrf-token"]') return element.getAttribute("content") } - - // Used to find a user's profile and relays - get discoveryRelays () { - return [ - 'ws://localhost:4777', - 'wss://nostr.kosmos.org', - 'wss://purplepag.es', - // 'wss://relay.nostr.band', - // 'wss://njump.me', - // 'wss://relay.damus.io', - // 'wss://nos.lol', - // 'wss://eden.nostr.land', - // 'wss://relay.snort.social', - // 'wss://nostr.wine', - // 'wss://relay.primal.net', - // 'wss://nostr.bitcoiner.social', - ] - } - - get discoveryPool () { - if (!this._discoveryPool) { - this._discoveryPool = new Nostrify.NPool({ - open: (url) => new Nostrify.NRelay1(url), - reqRouter: async (filters) => new Map( - this.discoveryRelays.map(relayUrl => [ relayUrl, filters ]) - ), - eventRouter: async (event) => [], - }) - } - - return this._discoveryPool - } - - get relaysContainAccountsRelay () { - // TODO use URL from view/settings - return !!this.nip65Relays.find(r => r.url.match('wss://nostr.kosmos.org')) - } } diff --git a/config/importmap.rb b/config/importmap.rb index d6d00ff..cb396cc 100644 --- a/config/importmap.rb +++ b/config/importmap.rb @@ -6,4 +6,3 @@ pin "@hotwired/stimulus", to: "stimulus.min.js", preload: true pin "@hotwired/stimulus-loading", to: "stimulus-loading.js", preload: true pin_all_from "app/javascript/controllers", under: "controllers" pin "tailwindcss-stimulus-components" # @4.0.3 -pin "nostrify" diff --git a/vendor/gems/nostr b/vendor/gems/nostr deleted file mode 160000 index 44e7454..0000000 --- a/vendor/gems/nostr +++ /dev/null @@ -1 +0,0 @@ -Subproject commit 44e7454990cffc66167254db9703fda642799588 diff --git a/vendor/javascript/nostrify.js b/vendor/javascript/nostrify.js deleted file mode 100644 index 15574c0..0000000 --- a/vendor/javascript/nostrify.js +++ /dev/null @@ -1,11690 +0,0 @@ -var dl = Object.defineProperty; -var yo = (n) => { - throw TypeError(n); -}; -var hl = (n, e, t) => e in n ? dl(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t; -var B = (n, e, t) => hl(n, typeof e != "symbol" ? e + "" : e, t), Bs = (n, e, t) => e.has(n) || yo("Cannot " + t); -var h = (n, e, t) => (Bs(n, e, "read from private field"), t ? t.call(n) : e.get(n)), X = (n, e, t) => e.has(n) ? yo("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(n) : e.set(n, t), q = (n, e, t, r) => (Bs(n, e, "write to private field"), r ? r.call(n, t) : e.set(n, t), t), M = (n, e, t) => (Bs(n, e, "access private method"), t); -var Ur = (n, e, t, r) => ({ - set _(s) { - q(n, e, s, t); - }, - get _() { - return h(n, e, r); - } -}); -const _n = typeof performance == "object" && performance && typeof performance.now == "function" ? performance : Date, sa = /* @__PURE__ */ new Set(), Fs = typeof process == "object" && process ? process : {}, ia = (n, e, t, r) => { - typeof Fs.emitWarning == "function" ? Fs.emitWarning(n, e, t, r) : console.error(`[${t}] ${e}: ${n}`); -}; -let Gr = globalThis.AbortController, mo = globalThis.AbortSignal; -var Jo; -if (typeof Gr > "u") { - mo = class { - constructor() { - B(this, "onabort"); - B(this, "_onabort", []); - B(this, "reason"); - B(this, "aborted", !1); - } - addEventListener(r, s) { - this._onabort.push(s); - } - }, Gr = class { - constructor() { - B(this, "signal", new mo()); - e(); - } - abort(r) { - var s, i; - if (!this.signal.aborted) { - this.signal.reason = r, this.signal.aborted = !0; - for (const o of this.signal._onabort) - o(r); - (i = (s = this.signal).onabort) == null || i.call(s, r); - } - } - }; - let n = ((Jo = Fs.env) == null ? void 0 : Jo.LRU_CACHE_IGNORE_AC_WARNING) !== "1"; - const e = () => { - n && (n = !1, ia("AbortController is not defined. If using lru-cache in node 14, load an AbortController polyfill from the `node-abort-controller` package. A minimal polyfill is provided for use by LRUCache.fetch(), but it should not be relied upon in other contexts (eg, passing it to other APIs that use AbortController/AbortSignal might have undesirable effects). You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.", "NO_ABORT_CONTROLLER", "ENOTSUP", e)); - }; -} -const fl = (n) => !sa.has(n), Kt = (n) => n && n === Math.floor(n) && n > 0 && isFinite(n), oa = (n) => Kt(n) ? n <= Math.pow(2, 8) ? Uint8Array : n <= Math.pow(2, 16) ? Uint16Array : n <= Math.pow(2, 32) ? Uint32Array : n <= Number.MAX_SAFE_INTEGER ? qr : null : null; -class qr extends Array { - constructor(e) { - super(e), this.fill(0); - } -} -var Cn; -const dn = class dn { - constructor(e, t) { - B(this, "heap"); - B(this, "length"); - if (!h(dn, Cn)) - throw new TypeError("instantiate Stack using Stack.create(n)"); - this.heap = new t(e), this.length = 0; - } - static create(e) { - const t = oa(e); - if (!t) - return []; - q(dn, Cn, !0); - const r = new dn(e, t); - return q(dn, Cn, !1), r; - } - push(e) { - this.heap[this.length++] = e; - } - pop() { - return this.heap[--this.length]; - } -}; -Cn = new WeakMap(), // private constructor -X(dn, Cn, !1); -let Gs = dn; -var Xo, Qo, Fe, Ue, Ge, Ye, $n, Rn, pe, Je, fe, ae, G, Oe, He, ke, me, Xe, we, Qe, et, Me, tt, Jt, Ie, R, Js, fn, Tt, Ar, je, aa, pn, Nn, Tr, Wt, Ft, Xs, Vr, Kr, oe, Qs, tr, Gt, ei; -const po = class po { - constructor(e) { - X(this, R); - // options that cannot be changed without disaster - X(this, Fe); - X(this, Ue); - X(this, Ge); - X(this, Ye); - X(this, $n); - X(this, Rn); - /** - * {@link LRUCache.OptionsBase.ttl} - */ - B(this, "ttl"); - /** - * {@link LRUCache.OptionsBase.ttlResolution} - */ - B(this, "ttlResolution"); - /** - * {@link LRUCache.OptionsBase.ttlAutopurge} - */ - B(this, "ttlAutopurge"); - /** - * {@link LRUCache.OptionsBase.updateAgeOnGet} - */ - B(this, "updateAgeOnGet"); - /** - * {@link LRUCache.OptionsBase.updateAgeOnHas} - */ - B(this, "updateAgeOnHas"); - /** - * {@link LRUCache.OptionsBase.allowStale} - */ - B(this, "allowStale"); - /** - * {@link LRUCache.OptionsBase.noDisposeOnSet} - */ - B(this, "noDisposeOnSet"); - /** - * {@link LRUCache.OptionsBase.noUpdateTTL} - */ - B(this, "noUpdateTTL"); - /** - * {@link LRUCache.OptionsBase.maxEntrySize} - */ - B(this, "maxEntrySize"); - /** - * {@link LRUCache.OptionsBase.sizeCalculation} - */ - B(this, "sizeCalculation"); - /** - * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection} - */ - B(this, "noDeleteOnFetchRejection"); - /** - * {@link LRUCache.OptionsBase.noDeleteOnStaleGet} - */ - B(this, "noDeleteOnStaleGet"); - /** - * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort} - */ - B(this, "allowStaleOnFetchAbort"); - /** - * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection} - */ - B(this, "allowStaleOnFetchRejection"); - /** - * {@link LRUCache.OptionsBase.ignoreFetchAbort} - */ - B(this, "ignoreFetchAbort"); - // computed properties - X(this, pe); - X(this, Je); - X(this, fe); - X(this, ae); - X(this, G); - X(this, Oe); - X(this, He); - X(this, ke); - X(this, me); - X(this, Xe); - X(this, we); - X(this, Qe); - X(this, et); - X(this, Me); - X(this, tt); - X(this, Jt); - X(this, Ie); - // conditionally set private methods related to TTL - X(this, fn, () => { - }); - X(this, Tt, () => { - }); - X(this, Ar, () => { - }); - /* c8 ignore stop */ - X(this, je, () => !1); - X(this, pn, (e) => { - }); - X(this, Nn, (e, t, r) => { - }); - X(this, Tr, (e, t, r, s) => { - if (r || s) - throw new TypeError("cannot set size without setting maxSize or maxEntrySize on cache"); - return 0; - }); - /** - * A String value that is used in the creation of the default string - * description of an object. Called by the built-in method - * `Object.prototype.toString`. - */ - B(this, Xo, "LRUCache"); - const { max: t = 0, ttl: r, ttlResolution: s = 1, ttlAutopurge: i, updateAgeOnGet: o, updateAgeOnHas: a, allowStale: c, dispose: l, disposeAfter: d, noDisposeOnSet: u, noUpdateTTL: f, maxSize: m = 0, maxEntrySize: b = 0, sizeCalculation: g, fetchMethod: p, memoMethod: y, noDeleteOnFetchRejection: w, noDeleteOnStaleGet: x, allowStaleOnFetchRejection: A, allowStaleOnFetchAbort: T, ignoreFetchAbort: _ } = e; - if (t !== 0 && !Kt(t)) - throw new TypeError("max option must be a nonnegative integer"); - const S = t ? oa(t) : Array; - if (!S) - throw new Error("invalid max value: " + t); - if (q(this, Fe, t), q(this, Ue, m), this.maxEntrySize = b || h(this, Ue), this.sizeCalculation = g, this.sizeCalculation) { - if (!h(this, Ue) && !this.maxEntrySize) - throw new TypeError("cannot set sizeCalculation without setting maxSize or maxEntrySize"); - if (typeof this.sizeCalculation != "function") - throw new TypeError("sizeCalculation set to non-function"); - } - if (y !== void 0 && typeof y != "function") - throw new TypeError("memoMethod must be a function if defined"); - if (q(this, Rn, y), p !== void 0 && typeof p != "function") - throw new TypeError("fetchMethod must be a function if specified"); - if (q(this, $n, p), q(this, Jt, !!p), q(this, fe, /* @__PURE__ */ new Map()), q(this, ae, new Array(t).fill(void 0)), q(this, G, new Array(t).fill(void 0)), q(this, Oe, new S(t)), q(this, He, new S(t)), q(this, ke, 0), q(this, me, 0), q(this, Xe, Gs.create(t)), q(this, pe, 0), q(this, Je, 0), typeof l == "function" && q(this, Ge, l), typeof d == "function" ? (q(this, Ye, d), q(this, we, [])) : (q(this, Ye, void 0), q(this, we, void 0)), q(this, tt, !!h(this, Ge)), q(this, Ie, !!h(this, Ye)), this.noDisposeOnSet = !!u, this.noUpdateTTL = !!f, this.noDeleteOnFetchRejection = !!w, this.allowStaleOnFetchRejection = !!A, this.allowStaleOnFetchAbort = !!T, this.ignoreFetchAbort = !!_, this.maxEntrySize !== 0) { - if (h(this, Ue) !== 0 && !Kt(h(this, Ue))) - throw new TypeError("maxSize must be a positive integer if specified"); - if (!Kt(this.maxEntrySize)) - throw new TypeError("maxEntrySize must be a positive integer if specified"); - M(this, R, aa).call(this); - } - if (this.allowStale = !!c, this.noDeleteOnStaleGet = !!x, this.updateAgeOnGet = !!o, this.updateAgeOnHas = !!a, this.ttlResolution = Kt(s) || s === 0 ? s : 1, this.ttlAutopurge = !!i, this.ttl = r || 0, this.ttl) { - if (!Kt(this.ttl)) - throw new TypeError("ttl must be a positive integer if specified"); - M(this, R, Js).call(this); - } - if (h(this, Fe) === 0 && this.ttl === 0 && h(this, Ue) === 0) - throw new TypeError("At least one of max, maxSize, or ttl is required"); - if (!this.ttlAutopurge && !h(this, Fe) && !h(this, Ue)) { - const k = "LRU_CACHE_UNBOUNDED"; - fl(k) && (sa.add(k), ia("TTL caching without ttlAutopurge, max, or maxSize can result in unbounded memory consumption.", "UnboundedCacheWarning", k, po)); - } - } - /** - * Do not call this method unless you need to inspect the - * inner workings of the cache. If anything returned by this - * object is modified in any way, strange breakage may occur. - * - * These fields are private for a reason! - * - * @internal - */ - static unsafeExposeInternals(e) { - return { - // properties - starts: h(e, et), - ttls: h(e, Me), - sizes: h(e, Qe), - keyMap: h(e, fe), - keyList: h(e, ae), - valList: h(e, G), - next: h(e, Oe), - prev: h(e, He), - get head() { - return h(e, ke); - }, - get tail() { - return h(e, me); - }, - free: h(e, Xe), - // methods - isBackgroundFetch: (t) => { - var r; - return M(r = e, R, oe).call(r, t); - }, - backgroundFetch: (t, r, s, i) => { - var o; - return M(o = e, R, Kr).call(o, t, r, s, i); - }, - moveToTail: (t) => { - var r; - return M(r = e, R, tr).call(r, t); - }, - indexes: (t) => { - var r; - return M(r = e, R, Wt).call(r, t); - }, - rindexes: (t) => { - var r; - return M(r = e, R, Ft).call(r, t); - }, - isStale: (t) => { - var r; - return h(r = e, je).call(r, t); - } - }; - } - // Protected read-only members - /** - * {@link LRUCache.OptionsBase.max} (read-only) - */ - get max() { - return h(this, Fe); - } - /** - * {@link LRUCache.OptionsBase.maxSize} (read-only) - */ - get maxSize() { - return h(this, Ue); - } - /** - * The total computed size of items in the cache (read-only) - */ - get calculatedSize() { - return h(this, Je); - } - /** - * The number of items stored in the cache (read-only) - */ - get size() { - return h(this, pe); - } - /** - * {@link LRUCache.OptionsBase.fetchMethod} (read-only) - */ - get fetchMethod() { - return h(this, $n); - } - get memoMethod() { - return h(this, Rn); - } - /** - * {@link LRUCache.OptionsBase.dispose} (read-only) - */ - get dispose() { - return h(this, Ge); - } - /** - * {@link LRUCache.OptionsBase.disposeAfter} (read-only) - */ - get disposeAfter() { - return h(this, Ye); - } - /** - * Return the number of ms left in the item's TTL. If item is not in cache, - * returns `0`. Returns `Infinity` if item is in cache without a defined TTL. - */ - getRemainingTTL(e) { - return h(this, fe).has(e) ? 1 / 0 : 0; - } - /** - * Return a generator yielding `[key, value]` pairs, - * in order from most recently used to least recently used. - */ - *entries() { - for (const e of M(this, R, Wt).call(this)) - h(this, G)[e] !== void 0 && h(this, ae)[e] !== void 0 && !M(this, R, oe).call(this, h(this, G)[e]) && (yield [h(this, ae)[e], h(this, G)[e]]); - } - /** - * Inverse order version of {@link LRUCache.entries} - * - * Return a generator yielding `[key, value]` pairs, - * in order from least recently used to most recently used. - */ - *rentries() { - for (const e of M(this, R, Ft).call(this)) - h(this, G)[e] !== void 0 && h(this, ae)[e] !== void 0 && !M(this, R, oe).call(this, h(this, G)[e]) && (yield [h(this, ae)[e], h(this, G)[e]]); - } - /** - * Return a generator yielding the keys in the cache, - * in order from most recently used to least recently used. - */ - *keys() { - for (const e of M(this, R, Wt).call(this)) { - const t = h(this, ae)[e]; - t !== void 0 && !M(this, R, oe).call(this, h(this, G)[e]) && (yield t); - } - } - /** - * Inverse order version of {@link LRUCache.keys} - * - * Return a generator yielding the keys in the cache, - * in order from least recently used to most recently used. - */ - *rkeys() { - for (const e of M(this, R, Ft).call(this)) { - const t = h(this, ae)[e]; - t !== void 0 && !M(this, R, oe).call(this, h(this, G)[e]) && (yield t); - } - } - /** - * Return a generator yielding the values in the cache, - * in order from most recently used to least recently used. - */ - *values() { - for (const e of M(this, R, Wt).call(this)) - h(this, G)[e] !== void 0 && !M(this, R, oe).call(this, h(this, G)[e]) && (yield h(this, G)[e]); - } - /** - * Inverse order version of {@link LRUCache.values} - * - * Return a generator yielding the values in the cache, - * in order from least recently used to most recently used. - */ - *rvalues() { - for (const e of M(this, R, Ft).call(this)) - h(this, G)[e] !== void 0 && !M(this, R, oe).call(this, h(this, G)[e]) && (yield h(this, G)[e]); - } - /** - * Iterating over the cache itself yields the same results as - * {@link LRUCache.entries} - */ - [(Qo = Symbol.iterator, Xo = Symbol.toStringTag, Qo)]() { - return this.entries(); - } - /** - * Find a value for which the supplied fn method returns a truthy value, - * similar to `Array.find()`. fn is called as `fn(value, key, cache)`. - */ - find(e, t = {}) { - for (const r of M(this, R, Wt).call(this)) { - const s = h(this, G)[r], i = M(this, R, oe).call(this, s) ? s.__staleWhileFetching : s; - if (i !== void 0 && e(i, h(this, ae)[r], this)) - return this.get(h(this, ae)[r], t); - } - } - /** - * Call the supplied function on each item in the cache, in order from most - * recently used to least recently used. - * - * `fn` is called as `fn(value, key, cache)`. - * - * If `thisp` is provided, function will be called in the `this`-context of - * the provided object, or the cache if no `thisp` object is provided. - * - * Does not update age or recenty of use, or iterate over stale values. - */ - forEach(e, t = this) { - for (const r of M(this, R, Wt).call(this)) { - const s = h(this, G)[r], i = M(this, R, oe).call(this, s) ? s.__staleWhileFetching : s; - i !== void 0 && e.call(t, i, h(this, ae)[r], this); - } - } - /** - * The same as {@link LRUCache.forEach} but items are iterated over in - * reverse order. (ie, less recently used items are iterated over first.) - */ - rforEach(e, t = this) { - for (const r of M(this, R, Ft).call(this)) { - const s = h(this, G)[r], i = M(this, R, oe).call(this, s) ? s.__staleWhileFetching : s; - i !== void 0 && e.call(t, i, h(this, ae)[r], this); - } - } - /** - * Delete any stale entries. Returns true if anything was removed, - * false otherwise. - */ - purgeStale() { - let e = !1; - for (const t of M(this, R, Ft).call(this, { allowStale: !0 })) - h(this, je).call(this, t) && (M(this, R, Gt).call(this, h(this, ae)[t], "expire"), e = !0); - return e; - } - /** - * Get the extended info about a given entry, to get its value, size, and - * TTL info simultaneously. Returns `undefined` if the key is not present. - * - * Unlike {@link LRUCache#dump}, which is designed to be portable and survive - * serialization, the `start` value is always the current timestamp, and the - * `ttl` is a calculated remaining time to live (negative if expired). - * - * Always returns stale values, if their info is found in the cache, so be - * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl}) - * if relevant. - */ - info(e) { - const t = h(this, fe).get(e); - if (t === void 0) - return; - const r = h(this, G)[t], s = M(this, R, oe).call(this, r) ? r.__staleWhileFetching : r; - if (s === void 0) - return; - const i = { value: s }; - if (h(this, Me) && h(this, et)) { - const o = h(this, Me)[t], a = h(this, et)[t]; - if (o && a) { - const c = o - (_n.now() - a); - i.ttl = c, i.start = Date.now(); - } - } - return h(this, Qe) && (i.size = h(this, Qe)[t]), i; - } - /** - * Return an array of [key, {@link LRUCache.Entry}] tuples which can be - * passed to {@link LRLUCache#load}. - * - * The `start` fields are calculated relative to a portable `Date.now()` - * timestamp, even if `performance.now()` is available. - * - * Stale entries are always included in the `dump`, even if - * {@link LRUCache.OptionsBase.allowStale} is false. - * - * Note: this returns an actual array, not a generator, so it can be more - * easily passed around. - */ - dump() { - const e = []; - for (const t of M(this, R, Wt).call(this, { allowStale: !0 })) { - const r = h(this, ae)[t], s = h(this, G)[t], i = M(this, R, oe).call(this, s) ? s.__staleWhileFetching : s; - if (i === void 0 || r === void 0) - continue; - const o = { value: i }; - if (h(this, Me) && h(this, et)) { - o.ttl = h(this, Me)[t]; - const a = _n.now() - h(this, et)[t]; - o.start = Math.floor(Date.now() - a); - } - h(this, Qe) && (o.size = h(this, Qe)[t]), e.unshift([r, o]); - } - return e; - } - /** - * Reset the cache and load in the items in entries in the order listed. - * - * The shape of the resulting cache may be different if the same options are - * not used in both caches. - * - * The `start` fields are assumed to be calculated relative to a portable - * `Date.now()` timestamp, even if `performance.now()` is available. - */ - load(e) { - this.clear(); - for (const [t, r] of e) { - if (r.start) { - const s = Date.now() - r.start; - r.start = _n.now() - s; - } - this.set(t, r.value, r); - } - } - /** - * Add a value to the cache. - * - * Note: if `undefined` is specified as a value, this is an alias for - * {@link LRUCache#delete} - * - * Fields on the {@link LRUCache.SetOptions} options param will override - * their corresponding values in the constructor options for the scope - * of this single `set()` operation. - * - * If `start` is provided, then that will set the effective start - * time for the TTL calculation. Note that this must be a previous - * value of `performance.now()` if supported, or a previous value of - * `Date.now()` if not. - * - * Options object may also include `size`, which will prevent - * calling the `sizeCalculation` function and just use the specified - * number if it is a positive integer, and `noDisposeOnSet` which - * will prevent calling a `dispose` function in the case of - * overwrites. - * - * If the `size` (or return value of `sizeCalculation`) for a given - * entry is greater than `maxEntrySize`, then the item will not be - * added to the cache. - * - * Will update the recency of the entry. - * - * If the value is `undefined`, then this is an alias for - * `cache.delete(key)`. `undefined` is never stored in the cache. - */ - set(e, t, r = {}) { - var f, m, b, g, p; - if (t === void 0) - return this.delete(e), this; - const { ttl: s = this.ttl, start: i, noDisposeOnSet: o = this.noDisposeOnSet, sizeCalculation: a = this.sizeCalculation, status: c } = r; - let { noUpdateTTL: l = this.noUpdateTTL } = r; - const d = h(this, Tr).call(this, e, t, r.size || 0, a); - if (this.maxEntrySize && d > this.maxEntrySize) - return c && (c.set = "miss", c.maxEntrySizeExceeded = !0), M(this, R, Gt).call(this, e, "set"), this; - let u = h(this, pe) === 0 ? void 0 : h(this, fe).get(e); - if (u === void 0) - u = h(this, pe) === 0 ? h(this, me) : h(this, Xe).length !== 0 ? h(this, Xe).pop() : h(this, pe) === h(this, Fe) ? M(this, R, Vr).call(this, !1) : h(this, pe), h(this, ae)[u] = e, h(this, G)[u] = t, h(this, fe).set(e, u), h(this, Oe)[h(this, me)] = u, h(this, He)[u] = h(this, me), q(this, me, u), Ur(this, pe)._++, h(this, Nn).call(this, u, d, c), c && (c.set = "add"), l = !1; - else { - M(this, R, tr).call(this, u); - const y = h(this, G)[u]; - if (t !== y) { - if (h(this, Jt) && M(this, R, oe).call(this, y)) { - y.__abortController.abort(new Error("replaced")); - const { __staleWhileFetching: w } = y; - w !== void 0 && !o && (h(this, tt) && ((f = h(this, Ge)) == null || f.call(this, w, e, "set")), h(this, Ie) && ((m = h(this, we)) == null || m.push([w, e, "set"]))); - } else o || (h(this, tt) && ((b = h(this, Ge)) == null || b.call(this, y, e, "set")), h(this, Ie) && ((g = h(this, we)) == null || g.push([y, e, "set"]))); - if (h(this, pn).call(this, u), h(this, Nn).call(this, u, d, c), h(this, G)[u] = t, c) { - c.set = "replace"; - const w = y && M(this, R, oe).call(this, y) ? y.__staleWhileFetching : y; - w !== void 0 && (c.oldValue = w); - } - } else c && (c.set = "update"); - } - if (s !== 0 && !h(this, Me) && M(this, R, Js).call(this), h(this, Me) && (l || h(this, Ar).call(this, u, s, i), c && h(this, Tt).call(this, c, u)), !o && h(this, Ie) && h(this, we)) { - const y = h(this, we); - let w; - for (; w = y == null ? void 0 : y.shift(); ) - (p = h(this, Ye)) == null || p.call(this, ...w); - } - return this; - } - /** - * Evict the least recently used item, returning its value or - * `undefined` if cache is empty. - */ - pop() { - var e; - try { - for (; h(this, pe); ) { - const t = h(this, G)[h(this, ke)]; - if (M(this, R, Vr).call(this, !0), M(this, R, oe).call(this, t)) { - if (t.__staleWhileFetching) - return t.__staleWhileFetching; - } else if (t !== void 0) - return t; - } - } finally { - if (h(this, Ie) && h(this, we)) { - const t = h(this, we); - let r; - for (; r = t == null ? void 0 : t.shift(); ) - (e = h(this, Ye)) == null || e.call(this, ...r); - } - } - } - /** - * Check if a key is in the cache, without updating the recency of use. - * Will return false if the item is stale, even though it is technically - * in the cache. - * - * Check if a key is in the cache, without updating the recency of - * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set - * to `true` in either the options or the constructor. - * - * Will return `false` if the item is stale, even though it is technically in - * the cache. The difference can be determined (if it matters) by using a - * `status` argument, and inspecting the `has` field. - * - * Will not update item age unless - * {@link LRUCache.OptionsBase.updateAgeOnHas} is set. - */ - has(e, t = {}) { - const { updateAgeOnHas: r = this.updateAgeOnHas, status: s } = t, i = h(this, fe).get(e); - if (i !== void 0) { - const o = h(this, G)[i]; - if (M(this, R, oe).call(this, o) && o.__staleWhileFetching === void 0) - return !1; - if (h(this, je).call(this, i)) - s && (s.has = "stale", h(this, Tt).call(this, s, i)); - else return r && h(this, fn).call(this, i), s && (s.has = "hit", h(this, Tt).call(this, s, i)), !0; - } else s && (s.has = "miss"); - return !1; - } - /** - * Like {@link LRUCache#get} but doesn't update recency or delete stale - * items. - * - * Returns `undefined` if the item is stale, unless - * {@link LRUCache.OptionsBase.allowStale} is set. - */ - peek(e, t = {}) { - const { allowStale: r = this.allowStale } = t, s = h(this, fe).get(e); - if (s === void 0 || !r && h(this, je).call(this, s)) - return; - const i = h(this, G)[s]; - return M(this, R, oe).call(this, i) ? i.__staleWhileFetching : i; - } - async fetch(e, t = {}) { - const { - // get options - allowStale: r = this.allowStale, - updateAgeOnGet: s = this.updateAgeOnGet, - noDeleteOnStaleGet: i = this.noDeleteOnStaleGet, - // set options - ttl: o = this.ttl, - noDisposeOnSet: a = this.noDisposeOnSet, - size: c = 0, - sizeCalculation: l = this.sizeCalculation, - noUpdateTTL: d = this.noUpdateTTL, - // fetch exclusive options - noDeleteOnFetchRejection: u = this.noDeleteOnFetchRejection, - allowStaleOnFetchRejection: f = this.allowStaleOnFetchRejection, - ignoreFetchAbort: m = this.ignoreFetchAbort, - allowStaleOnFetchAbort: b = this.allowStaleOnFetchAbort, - context: g, - forceRefresh: p = !1, - status: y, - signal: w - } = t; - if (!h(this, Jt)) - return y && (y.fetch = "get"), this.get(e, { - allowStale: r, - updateAgeOnGet: s, - noDeleteOnStaleGet: i, - status: y - }); - const x = { - allowStale: r, - updateAgeOnGet: s, - noDeleteOnStaleGet: i, - ttl: o, - noDisposeOnSet: a, - size: c, - sizeCalculation: l, - noUpdateTTL: d, - noDeleteOnFetchRejection: u, - allowStaleOnFetchRejection: f, - allowStaleOnFetchAbort: b, - ignoreFetchAbort: m, - status: y, - signal: w - }; - let A = h(this, fe).get(e); - if (A === void 0) { - y && (y.fetch = "miss"); - const T = M(this, R, Kr).call(this, e, A, x, g); - return T.__returned = T; - } else { - const T = h(this, G)[A]; - if (M(this, R, oe).call(this, T)) { - const z = r && T.__staleWhileFetching !== void 0; - return y && (y.fetch = "inflight", z && (y.returnedStale = !0)), z ? T.__staleWhileFetching : T.__returned = T; - } - const _ = h(this, je).call(this, A); - if (!p && !_) - return y && (y.fetch = "hit"), M(this, R, tr).call(this, A), s && h(this, fn).call(this, A), y && h(this, Tt).call(this, y, A), T; - const S = M(this, R, Kr).call(this, e, A, x, g), N = S.__staleWhileFetching !== void 0 && r; - return y && (y.fetch = _ ? "stale" : "refresh", N && _ && (y.returnedStale = !0)), N ? S.__staleWhileFetching : S.__returned = S; - } - } - async forceFetch(e, t = {}) { - const r = await this.fetch(e, t); - if (r === void 0) - throw new Error("fetch() returned undefined"); - return r; - } - memo(e, t = {}) { - const r = h(this, Rn); - if (!r) - throw new Error("no memoMethod provided to constructor"); - const { context: s, forceRefresh: i, ...o } = t, a = this.get(e, o); - if (!i && a !== void 0) - return a; - const c = r(e, a, { - options: o, - context: s - }); - return this.set(e, c, o), c; - } - /** - * Return a value from the cache. Will update the recency of the cache - * entry found. - * - * If the key is not found, get() will return `undefined`. - */ - get(e, t = {}) { - const { allowStale: r = this.allowStale, updateAgeOnGet: s = this.updateAgeOnGet, noDeleteOnStaleGet: i = this.noDeleteOnStaleGet, status: o } = t, a = h(this, fe).get(e); - if (a !== void 0) { - const c = h(this, G)[a], l = M(this, R, oe).call(this, c); - return o && h(this, Tt).call(this, o, a), h(this, je).call(this, a) ? (o && (o.get = "stale"), l ? (o && r && c.__staleWhileFetching !== void 0 && (o.returnedStale = !0), r ? c.__staleWhileFetching : void 0) : (i || M(this, R, Gt).call(this, e, "expire"), o && r && (o.returnedStale = !0), r ? c : void 0)) : (o && (o.get = "hit"), l ? c.__staleWhileFetching : (M(this, R, tr).call(this, a), s && h(this, fn).call(this, a), c)); - } else o && (o.get = "miss"); - } - /** - * Deletes a key out of the cache. - * - * Returns true if the key was deleted, false otherwise. - */ - delete(e) { - return M(this, R, Gt).call(this, e, "delete"); - } - /** - * Clear the cache entirely, throwing away all values. - */ - clear() { - return M(this, R, ei).call(this, "delete"); - } -}; -Fe = new WeakMap(), Ue = new WeakMap(), Ge = new WeakMap(), Ye = new WeakMap(), $n = new WeakMap(), Rn = new WeakMap(), pe = new WeakMap(), Je = new WeakMap(), fe = new WeakMap(), ae = new WeakMap(), G = new WeakMap(), Oe = new WeakMap(), He = new WeakMap(), ke = new WeakMap(), me = new WeakMap(), Xe = new WeakMap(), we = new WeakMap(), Qe = new WeakMap(), et = new WeakMap(), Me = new WeakMap(), tt = new WeakMap(), Jt = new WeakMap(), Ie = new WeakMap(), R = new WeakSet(), Js = function() { - const e = new qr(h(this, Fe)), t = new qr(h(this, Fe)); - q(this, Me, e), q(this, et, t), q(this, Ar, (i, o, a = _n.now()) => { - if (t[i] = o !== 0 ? a : 0, e[i] = o, o !== 0 && this.ttlAutopurge) { - const c = setTimeout(() => { - h(this, je).call(this, i) && M(this, R, Gt).call(this, h(this, ae)[i], "expire"); - }, o + 1); - c.unref && c.unref(); - } - }), q(this, fn, (i) => { - t[i] = e[i] !== 0 ? _n.now() : 0; - }), q(this, Tt, (i, o) => { - if (e[o]) { - const a = e[o], c = t[o]; - if (!a || !c) - return; - i.ttl = a, i.start = c, i.now = r || s(); - const l = i.now - c; - i.remainingTTL = a - l; - } - }); - let r = 0; - const s = () => { - const i = _n.now(); - if (this.ttlResolution > 0) { - r = i; - const o = setTimeout(() => r = 0, this.ttlResolution); - o.unref && o.unref(); - } - return i; - }; - this.getRemainingTTL = (i) => { - const o = h(this, fe).get(i); - if (o === void 0) - return 0; - const a = e[o], c = t[o]; - if (!a || !c) - return 1 / 0; - const l = (r || s()) - c; - return a - l; - }, q(this, je, (i) => { - const o = t[i], a = e[i]; - return !!a && !!o && (r || s()) - o > a; - }); -}, fn = new WeakMap(), Tt = new WeakMap(), Ar = new WeakMap(), je = new WeakMap(), aa = function() { - const e = new qr(h(this, Fe)); - q(this, Je, 0), q(this, Qe, e), q(this, pn, (t) => { - q(this, Je, h(this, Je) - e[t]), e[t] = 0; - }), q(this, Tr, (t, r, s, i) => { - if (M(this, R, oe).call(this, r)) - return 0; - if (!Kt(s)) - if (i) { - if (typeof i != "function") - throw new TypeError("sizeCalculation must be a function"); - if (s = i(r, t), !Kt(s)) - throw new TypeError("sizeCalculation return invalid (expect positive integer)"); - } else - throw new TypeError("invalid size value (must be positive integer). When maxSize or maxEntrySize is used, sizeCalculation or size must be set."); - return s; - }), q(this, Nn, (t, r, s) => { - if (e[t] = r, h(this, Ue)) { - const i = h(this, Ue) - e[t]; - for (; h(this, Je) > i; ) - M(this, R, Vr).call(this, !0); - } - q(this, Je, h(this, Je) + e[t]), s && (s.entrySize = r, s.totalCalculatedSize = h(this, Je)); - }); -}, pn = new WeakMap(), Nn = new WeakMap(), Tr = new WeakMap(), Wt = function* ({ allowStale: e = this.allowStale } = {}) { - if (h(this, pe)) - for (let t = h(this, me); !(!M(this, R, Xs).call(this, t) || ((e || !h(this, je).call(this, t)) && (yield t), t === h(this, ke))); ) - t = h(this, He)[t]; -}, Ft = function* ({ allowStale: e = this.allowStale } = {}) { - if (h(this, pe)) - for (let t = h(this, ke); !(!M(this, R, Xs).call(this, t) || ((e || !h(this, je).call(this, t)) && (yield t), t === h(this, me))); ) - t = h(this, Oe)[t]; -}, Xs = function(e) { - return e !== void 0 && h(this, fe).get(h(this, ae)[e]) === e; -}, Vr = function(e) { - var i, o; - const t = h(this, ke), r = h(this, ae)[t], s = h(this, G)[t]; - return h(this, Jt) && M(this, R, oe).call(this, s) ? s.__abortController.abort(new Error("evicted")) : (h(this, tt) || h(this, Ie)) && (h(this, tt) && ((i = h(this, Ge)) == null || i.call(this, s, r, "evict")), h(this, Ie) && ((o = h(this, we)) == null || o.push([s, r, "evict"]))), h(this, pn).call(this, t), e && (h(this, ae)[t] = void 0, h(this, G)[t] = void 0, h(this, Xe).push(t)), h(this, pe) === 1 ? (q(this, ke, q(this, me, 0)), h(this, Xe).length = 0) : q(this, ke, h(this, Oe)[t]), h(this, fe).delete(r), Ur(this, pe)._--, t; -}, Kr = function(e, t, r, s) { - const i = t === void 0 ? void 0 : h(this, G)[t]; - if (M(this, R, oe).call(this, i)) - return i; - const o = new Gr(), { signal: a } = r; - a == null || a.addEventListener("abort", () => o.abort(a.reason), { - signal: o.signal - }); - const c = { - signal: o.signal, - options: r, - context: s - }, l = (g, p = !1) => { - const { aborted: y } = o.signal, w = r.ignoreFetchAbort && g !== void 0; - if (r.status && (y && !p ? (r.status.fetchAborted = !0, r.status.fetchError = o.signal.reason, w && (r.status.fetchAbortIgnored = !0)) : r.status.fetchResolved = !0), y && !w && !p) - return u(o.signal.reason); - const x = m; - return h(this, G)[t] === m && (g === void 0 ? x.__staleWhileFetching ? h(this, G)[t] = x.__staleWhileFetching : M(this, R, Gt).call(this, e, "fetch") : (r.status && (r.status.fetchUpdated = !0), this.set(e, g, c.options))), g; - }, d = (g) => (r.status && (r.status.fetchRejected = !0, r.status.fetchError = g), u(g)), u = (g) => { - const { aborted: p } = o.signal, y = p && r.allowStaleOnFetchAbort, w = y || r.allowStaleOnFetchRejection, x = w || r.noDeleteOnFetchRejection, A = m; - if (h(this, G)[t] === m && (!x || A.__staleWhileFetching === void 0 ? M(this, R, Gt).call(this, e, "fetch") : y || (h(this, G)[t] = A.__staleWhileFetching)), w) - return r.status && A.__staleWhileFetching !== void 0 && (r.status.returnedStale = !0), A.__staleWhileFetching; - if (A.__returned === A) - throw g; - }, f = (g, p) => { - var w; - const y = (w = h(this, $n)) == null ? void 0 : w.call(this, e, i, c); - y && y instanceof Promise && y.then((x) => g(x === void 0 ? void 0 : x), p), o.signal.addEventListener("abort", () => { - (!r.ignoreFetchAbort || r.allowStaleOnFetchAbort) && (g(void 0), r.allowStaleOnFetchAbort && (g = (x) => l(x, !0))); - }); - }; - r.status && (r.status.fetchDispatched = !0); - const m = new Promise(f).then(l, d), b = Object.assign(m, { - __abortController: o, - __staleWhileFetching: i, - __returned: void 0 - }); - return t === void 0 ? (this.set(e, b, { ...c.options, status: void 0 }), t = h(this, fe).get(e)) : h(this, G)[t] = b, b; -}, oe = function(e) { - if (!h(this, Jt)) - return !1; - const t = e; - return !!t && t instanceof Promise && t.hasOwnProperty("__staleWhileFetching") && t.__abortController instanceof Gr; -}, Qs = function(e, t) { - h(this, He)[t] = e, h(this, Oe)[e] = t; -}, tr = function(e) { - e !== h(this, me) && (e === h(this, ke) ? q(this, ke, h(this, Oe)[e]) : M(this, R, Qs).call(this, h(this, He)[e], h(this, Oe)[e]), M(this, R, Qs).call(this, h(this, me), e), q(this, me, e)); -}, Gt = function(e, t) { - var s, i, o, a; - let r = !1; - if (h(this, pe) !== 0) { - const c = h(this, fe).get(e); - if (c !== void 0) - if (r = !0, h(this, pe) === 1) - M(this, R, ei).call(this, t); - else { - h(this, pn).call(this, c); - const l = h(this, G)[c]; - if (M(this, R, oe).call(this, l) ? l.__abortController.abort(new Error("deleted")) : (h(this, tt) || h(this, Ie)) && (h(this, tt) && ((s = h(this, Ge)) == null || s.call(this, l, e, t)), h(this, Ie) && ((i = h(this, we)) == null || i.push([l, e, t]))), h(this, fe).delete(e), h(this, ae)[c] = void 0, h(this, G)[c] = void 0, c === h(this, me)) - q(this, me, h(this, He)[c]); - else if (c === h(this, ke)) - q(this, ke, h(this, Oe)[c]); - else { - const d = h(this, He)[c]; - h(this, Oe)[d] = h(this, Oe)[c]; - const u = h(this, Oe)[c]; - h(this, He)[u] = h(this, He)[c]; - } - Ur(this, pe)._--, h(this, Xe).push(c); - } - } - if (h(this, Ie) && ((o = h(this, we)) != null && o.length)) { - const c = h(this, we); - let l; - for (; l = c == null ? void 0 : c.shift(); ) - (a = h(this, Ye)) == null || a.call(this, ...l); - } - return r; -}, ei = function(e) { - var t, r, s; - for (const i of M(this, R, Ft).call(this, { allowStale: !0 })) { - const o = h(this, G)[i]; - if (M(this, R, oe).call(this, o)) - o.__abortController.abort(new Error("deleted")); - else { - const a = h(this, ae)[i]; - h(this, tt) && ((t = h(this, Ge)) == null || t.call(this, o, a, e)), h(this, Ie) && ((r = h(this, we)) == null || r.push([o, a, e])); - } - } - if (h(this, fe).clear(), h(this, G).fill(void 0), h(this, ae).fill(void 0), h(this, Me) && h(this, et) && (h(this, Me).fill(0), h(this, et).fill(0)), h(this, Qe) && h(this, Qe).fill(0), q(this, ke, 0), q(this, me, 0), h(this, Xe).length = 0, q(this, Je, 0), q(this, pe, 0), h(this, Ie) && h(this, we)) { - const i = h(this, we); - let o; - for (; o = i == null ? void 0 : i.shift(); ) - (s = h(this, Ye)) == null || s.call(this, ...o); - } -}; -let Ys = po; -function wo(n) { - if (!Number.isSafeInteger(n) || n < 0) - throw new Error(`Wrong positive integer: ${n}`); -} -function ca(n, ...e) { - if (!(n instanceof Uint8Array)) - throw new Error("Expected Uint8Array"); - if (e.length > 0 && !e.includes(n.length)) - throw new Error(`Expected Uint8Array of length ${e}, not of length=${n.length}`); -} -function pl(n) { - if (typeof n != "function" || typeof n.create != "function") - throw new Error("Hash should be wrapped by utils.wrapConstructor"); - wo(n.outputLen), wo(n.blockLen); -} -function Yr(n, e = !0) { - if (n.destroyed) - throw new Error("Hash instance has been destroyed"); - if (e && n.finished) - throw new Error("Hash#digest() has already been called"); -} -function gl(n, e) { - ca(n); - const t = e.outputLen; - if (n.length < t) - throw new Error(`digestInto() expects output buffer of length at least ${t}`); -} -const Os = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0; -/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const la = (n) => n instanceof Uint8Array, Is = (n) => new DataView(n.buffer, n.byteOffset, n.byteLength), ot = (n, e) => n << 32 - e | n >>> e, yl = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68; -if (!yl) - throw new Error("Non little-endian hardware is not supported"); -function ml(n) { - if (typeof n != "string") - throw new Error(`utf8ToBytes expected string, got ${typeof n}`); - return new Uint8Array(new TextEncoder().encode(n)); -} -function Oi(n) { - if (typeof n == "string" && (n = ml(n)), !la(n)) - throw new Error(`expected Uint8Array, got ${typeof n}`); - return n; -} -function wl(...n) { - const e = new Uint8Array(n.reduce((r, s) => r + s.length, 0)); - let t = 0; - return n.forEach((r) => { - if (!la(r)) - throw new Error("Uint8Array expected"); - e.set(r, t), t += r.length; - }), e; -} -let ua = class { - // Safe version that clones internal state - clone() { - return this._cloneInto(); - } -}; -function bl(n) { - const e = (r) => n().update(Oi(r)).digest(), t = n(); - return e.outputLen = t.outputLen, e.blockLen = t.blockLen, e.create = () => n(), e; -} -function da(n = 32) { - if (Os && typeof Os.getRandomValues == "function") - return Os.getRandomValues(new Uint8Array(n)); - throw new Error("crypto.getRandomValues must be defined"); -} -function vl(n, e, t, r) { - if (typeof n.setBigUint64 == "function") - return n.setBigUint64(e, t, r); - const s = BigInt(32), i = BigInt(4294967295), o = Number(t >> s & i), a = Number(t & i), c = r ? 4 : 0, l = r ? 0 : 4; - n.setUint32(e + c, o, r), n.setUint32(e + l, a, r); -} -let xl = class extends ua { - constructor(e, t, r, s) { - super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = s, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = Is(this.buffer); - } - update(e) { - Yr(this); - const { view: t, buffer: r, blockLen: s } = this; - e = Oi(e); - const i = e.length; - for (let o = 0; o < i; ) { - const a = Math.min(s - this.pos, i - o); - if (a === s) { - const c = Is(e); - for (; s <= i - o; o += s) - this.process(c, o); - continue; - } - r.set(e.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === s && (this.process(t, 0), this.pos = 0); - } - return this.length += e.length, this.roundClean(), this; - } - digestInto(e) { - Yr(this), gl(e, this), this.finished = !0; - const { buffer: t, view: r, blockLen: s, isLE: i } = this; - let { pos: o } = this; - t[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > s - o && (this.process(r, 0), o = 0); - for (let u = o; u < s; u++) - t[u] = 0; - vl(r, s - 8, BigInt(this.length * 8), i), this.process(r, 0); - const a = Is(e), c = this.outputLen; - if (c % 4) - throw new Error("_sha2: outputLen should be aligned to 32bit"); - const l = c / 4, d = this.get(); - if (l > d.length) - throw new Error("_sha2: outputLen bigger than state"); - for (let u = 0; u < l; u++) - a.setUint32(4 * u, d[u], i); - } - digest() { - const { buffer: e, outputLen: t } = this; - this.digestInto(e); - const r = e.slice(0, t); - return this.destroy(), r; - } - _cloneInto(e) { - e || (e = new this.constructor()), e.set(...this.get()); - const { blockLen: t, buffer: r, length: s, finished: i, destroyed: o, pos: a } = this; - return e.length = s, e.pos = a, e.finished = i, e.destroyed = o, s % t && e.buffer.set(r), e; - } -}; -const El = (n, e, t) => n & e ^ ~n & t, _l = (n, e, t) => n & e ^ n & t ^ e & t, Sl = /* @__PURE__ */ new Uint32Array([ - 1116352408, - 1899447441, - 3049323471, - 3921009573, - 961987163, - 1508970993, - 2453635748, - 2870763221, - 3624381080, - 310598401, - 607225278, - 1426881987, - 1925078388, - 2162078206, - 2614888103, - 3248222580, - 3835390401, - 4022224774, - 264347078, - 604807628, - 770255983, - 1249150122, - 1555081692, - 1996064986, - 2554220882, - 2821834349, - 2952996808, - 3210313671, - 3336571891, - 3584528711, - 113926993, - 338241895, - 666307205, - 773529912, - 1294757372, - 1396182291, - 1695183700, - 1986661051, - 2177026350, - 2456956037, - 2730485921, - 2820302411, - 3259730800, - 3345764771, - 3516065817, - 3600352804, - 4094571909, - 275423344, - 430227734, - 506948616, - 659060556, - 883997877, - 958139571, - 1322822218, - 1537002063, - 1747873779, - 1955562222, - 2024104815, - 2227730452, - 2361852424, - 2428436474, - 2756734187, - 3204031479, - 3329325298 -]), Mt = /* @__PURE__ */ new Uint32Array([ - 1779033703, - 3144134277, - 1013904242, - 2773480762, - 1359893119, - 2600822924, - 528734635, - 1541459225 -]), jt = /* @__PURE__ */ new Uint32Array(64); -let kl = class extends xl { - constructor() { - super(64, 32, 8, !1), this.A = Mt[0] | 0, this.B = Mt[1] | 0, this.C = Mt[2] | 0, this.D = Mt[3] | 0, this.E = Mt[4] | 0, this.F = Mt[5] | 0, this.G = Mt[6] | 0, this.H = Mt[7] | 0; - } - get() { - const { A: e, B: t, C: r, D: s, E: i, F: o, G: a, H: c } = this; - return [e, t, r, s, i, o, a, c]; - } - // prettier-ignore - set(e, t, r, s, i, o, a, c) { - this.A = e | 0, this.B = t | 0, this.C = r | 0, this.D = s | 0, this.E = i | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0; - } - process(e, t) { - for (let u = 0; u < 16; u++, t += 4) - jt[u] = e.getUint32(t, !1); - for (let u = 16; u < 64; u++) { - const f = jt[u - 15], m = jt[u - 2], b = ot(f, 7) ^ ot(f, 18) ^ f >>> 3, g = ot(m, 17) ^ ot(m, 19) ^ m >>> 10; - jt[u] = g + jt[u - 7] + b + jt[u - 16] | 0; - } - let { A: r, B: s, C: i, D: o, E: a, F: c, G: l, H: d } = this; - for (let u = 0; u < 64; u++) { - const f = ot(a, 6) ^ ot(a, 11) ^ ot(a, 25), m = d + f + El(a, c, l) + Sl[u] + jt[u] | 0, g = (ot(r, 2) ^ ot(r, 13) ^ ot(r, 22)) + _l(r, s, i) | 0; - d = l, l = c, c = a, a = o + m | 0, o = i, i = s, s = r, r = m + g | 0; - } - r = r + this.A | 0, s = s + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, d = d + this.H | 0, this.set(r, s, i, o, a, c, l, d); - } - roundClean() { - jt.fill(0); - } - destroy() { - this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0); - } -}; -const ti = /* @__PURE__ */ bl(() => new kl()); -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const ha = BigInt(0), ds = BigInt(1), Al = BigInt(2), hs = (n) => n instanceof Uint8Array, Tl = /* @__PURE__ */ Array.from({ length: 256 }, (n, e) => e.toString(16).padStart(2, "0")); -function Hn(n) { - if (!hs(n)) - throw new Error("Uint8Array expected"); - let e = ""; - for (let t = 0; t < n.length; t++) - e += Tl[n[t]]; - return e; -} -function fa(n) { - const e = n.toString(16); - return e.length & 1 ? `0${e}` : e; -} -function Ii(n) { - if (typeof n != "string") - throw new Error("hex string expected, got " + typeof n); - return BigInt(n === "" ? "0" : `0x${n}`); -} -function Mn(n) { - if (typeof n != "string") - throw new Error("hex string expected, got " + typeof n); - const e = n.length; - if (e % 2) - throw new Error("padded hex string expected, got unpadded hex of length " + e); - const t = new Uint8Array(e / 2); - for (let r = 0; r < t.length; r++) { - const s = r * 2, i = n.slice(s, s + 2), o = Number.parseInt(i, 16); - if (Number.isNaN(o) || o < 0) - throw new Error("Invalid byte sequence"); - t[r] = o; - } - return t; -} -function Le(n) { - return Ii(Hn(n)); -} -function Ci(n) { - if (!hs(n)) - throw new Error("Uint8Array expected"); - return Ii(Hn(Uint8Array.from(n).reverse())); -} -function en(n, e) { - return Mn(n.toString(16).padStart(e * 2, "0")); -} -function $i(n, e) { - return en(n, e).reverse(); -} -function Bl(n) { - return Mn(fa(n)); -} -function Ae(n, e, t) { - let r; - if (typeof e == "string") - try { - r = Mn(e); - } catch (i) { - throw new Error(`${n} must be valid hex string, got "${e}". Cause: ${i}`); - } - else if (hs(e)) - r = Uint8Array.from(e); - else - throw new Error(`${n} must be hex string or Uint8Array`); - const s = r.length; - if (typeof t == "number" && s !== t) - throw new Error(`${n} expected ${t} bytes, got ${s}`); - return r; -} -function bn(...n) { - const e = new Uint8Array(n.reduce((r, s) => r + s.length, 0)); - let t = 0; - return n.forEach((r) => { - if (!hs(r)) - throw new Error("Uint8Array expected"); - e.set(r, t), t += r.length; - }), e; -} -function Ol(n, e) { - if (n.length !== e.length) - return !1; - for (let t = 0; t < n.length; t++) - if (n[t] !== e[t]) - return !1; - return !0; -} -function Il(n) { - if (typeof n != "string") - throw new Error(`utf8ToBytes expected string, got ${typeof n}`); - return new Uint8Array(new TextEncoder().encode(n)); -} -function Cl(n) { - let e; - for (e = 0; n > ha; n >>= ds, e += 1) - ; - return e; -} -function $l(n, e) { - return n >> BigInt(e) & ds; -} -const Rl = (n, e, t) => n | (t ? ds : ha) << BigInt(e), Ri = (n) => (Al << BigInt(n - 1)) - ds, Cs = (n) => new Uint8Array(n), bo = (n) => Uint8Array.from(n); -function pa(n, e, t) { - if (typeof n != "number" || n < 2) - throw new Error("hashLen must be a number"); - if (typeof e != "number" || e < 2) - throw new Error("qByteLen must be a number"); - if (typeof t != "function") - throw new Error("hmacFn must be a function"); - let r = Cs(n), s = Cs(n), i = 0; - const o = () => { - r.fill(1), s.fill(0), i = 0; - }, a = (...u) => t(s, r, ...u), c = (u = Cs()) => { - s = a(bo([0]), u), r = a(), u.length !== 0 && (s = a(bo([1]), u), r = a()); - }, l = () => { - if (i++ >= 1e3) - throw new Error("drbg: tried 1000 values"); - let u = 0; - const f = []; - for (; u < e; ) { - r = a(); - const m = r.slice(); - f.push(m), u += r.length; - } - return bn(...f); - }; - return (u, f) => { - o(), c(u); - let m; - for (; !(m = f(l())); ) - c(); - return o(), m; - }; -} -const Nl = { - bigint: (n) => typeof n == "bigint", - function: (n) => typeof n == "function", - boolean: (n) => typeof n == "boolean", - string: (n) => typeof n == "string", - stringOrUint8Array: (n) => typeof n == "string" || n instanceof Uint8Array, - isSafeInteger: (n) => Number.isSafeInteger(n), - array: (n) => Array.isArray(n), - field: (n, e) => e.Fp.isValid(n), - hash: (n) => typeof n == "function" && Number.isSafeInteger(n.outputLen) -}; -function Cr(n, e, t = {}) { - const r = (s, i, o) => { - const a = Nl[i]; - if (typeof a != "function") - throw new Error(`Invalid validator "${i}", expected function`); - const c = n[s]; - if (!(o && c === void 0) && !a(c, n)) - throw new Error(`Invalid param ${String(s)}=${c} (${typeof c}), expected ${i}`); - }; - for (const [s, i] of Object.entries(e)) - r(s, i, !1); - for (const [s, i] of Object.entries(t)) - r(s, i, !0); - return n; -} -const Ll = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({ - __proto__: null, - bitGet: $l, - bitLen: Cl, - bitMask: Ri, - bitSet: Rl, - bytesToHex: Hn, - bytesToNumberBE: Le, - bytesToNumberLE: Ci, - concatBytes: bn, - createHmacDrbg: pa, - ensureBytes: Ae, - equalBytes: Ol, - hexToBytes: Mn, - hexToNumber: Ii, - numberToBytesBE: en, - numberToBytesLE: $i, - numberToHexUnpadded: fa, - numberToVarBytesBE: Bl, - utf8ToBytes: Il, - validateObject: Cr -}, Symbol.toStringTag, { value: "Module" })); -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const xe = BigInt(0), ue = BigInt(1), cn = BigInt(2), Ul = BigInt(3), ni = BigInt(4), vo = BigInt(5), xo = BigInt(8); -BigInt(9); -BigInt(16); -function Se(n, e) { - const t = n % e; - return t >= xe ? t : e + t; -} -function Hl(n, e, t) { - if (t <= xe || e < xe) - throw new Error("Expected power/modulo > 0"); - if (t === ue) - return xe; - let r = ue; - for (; e > xe; ) - e & ue && (r = r * n % t), n = n * n % t, e >>= ue; - return r; -} -function De(n, e, t) { - let r = n; - for (; e-- > xe; ) - r *= r, r %= t; - return r; -} -function ri(n, e) { - if (n === xe || e <= xe) - throw new Error(`invert: expected positive integers, got n=${n} mod=${e}`); - let t = Se(n, e), r = e, s = xe, i = ue; - for (; t !== xe; ) { - const a = r / t, c = r % t, l = s - i * a; - r = t, t = c, s = i, i = l; - } - if (r !== ue) - throw new Error("invert: does not exist"); - return Se(s, e); -} -function Ml(n) { - const e = (n - ue) / cn; - let t, r, s; - for (t = n - ue, r = 0; t % cn === xe; t /= cn, r++) - ; - for (s = cn; s < n && Hl(s, e, n) !== n - ue; s++) - ; - if (r === 1) { - const o = (n + ue) / ni; - return function(c, l) { - const d = c.pow(l, o); - if (!c.eql(c.sqr(d), l)) - throw new Error("Cannot find square root"); - return d; - }; - } - const i = (t + ue) / cn; - return function(a, c) { - if (a.pow(c, e) === a.neg(a.ONE)) - throw new Error("Cannot find square root"); - let l = r, d = a.pow(a.mul(a.ONE, s), t), u = a.pow(c, i), f = a.pow(c, t); - for (; !a.eql(f, a.ONE); ) { - if (a.eql(f, a.ZERO)) - return a.ZERO; - let m = 1; - for (let g = a.sqr(f); m < l && !a.eql(g, a.ONE); m++) - g = a.sqr(g); - const b = a.pow(d, ue << BigInt(l - m - 1)); - d = a.sqr(b), u = a.mul(u, b), f = a.mul(f, d), l = m; - } - return u; - }; -} -function jl(n) { - if (n % ni === Ul) { - const e = (n + ue) / ni; - return function(r, s) { - const i = r.pow(s, e); - if (!r.eql(r.sqr(i), s)) - throw new Error("Cannot find square root"); - return i; - }; - } - if (n % xo === vo) { - const e = (n - vo) / xo; - return function(r, s) { - const i = r.mul(s, cn), o = r.pow(i, e), a = r.mul(s, o), c = r.mul(r.mul(a, cn), o), l = r.mul(a, r.sub(c, r.ONE)); - if (!r.eql(r.sqr(l), s)) - throw new Error("Cannot find square root"); - return l; - }; - } - return Ml(n); -} -const Pl = [ - "create", - "isValid", - "is0", - "neg", - "inv", - "sqrt", - "sqr", - "eql", - "add", - "sub", - "mul", - "pow", - "div", - "addN", - "subN", - "mulN", - "sqrN" -]; -function Zl(n) { - const e = { - ORDER: "bigint", - MASK: "bigint", - BYTES: "isSafeInteger", - BITS: "isSafeInteger" - }, t = Pl.reduce((r, s) => (r[s] = "function", r), e); - return Cr(n, t); -} -function zl(n, e, t) { - if (t < xe) - throw new Error("Expected power > 0"); - if (t === xe) - return n.ONE; - if (t === ue) - return e; - let r = n.ONE, s = e; - for (; t > xe; ) - t & ue && (r = n.mul(r, s)), s = n.sqr(s), t >>= ue; - return r; -} -function Dl(n, e) { - const t = new Array(e.length), r = e.reduce((i, o, a) => n.is0(o) ? i : (t[a] = i, n.mul(i, o)), n.ONE), s = n.inv(r); - return e.reduceRight((i, o, a) => n.is0(o) ? i : (t[a] = n.mul(i, t[a]), n.mul(i, o)), s), t; -} -function ga(n, e) { - const t = e !== void 0 ? e : n.toString(2).length, r = Math.ceil(t / 8); - return { nBitLength: t, nByteLength: r }; -} -function ql(n, e, t = !1, r = {}) { - if (n <= xe) - throw new Error(`Expected Field ORDER > 0, got ${n}`); - const { nBitLength: s, nByteLength: i } = ga(n, e); - if (i > 2048) - throw new Error("Field lengths over 2048 bytes are not supported"); - const o = jl(n), a = Object.freeze({ - ORDER: n, - BITS: s, - BYTES: i, - MASK: Ri(s), - ZERO: xe, - ONE: ue, - create: (c) => Se(c, n), - isValid: (c) => { - if (typeof c != "bigint") - throw new Error(`Invalid field element: expected bigint, got ${typeof c}`); - return xe <= c && c < n; - }, - is0: (c) => c === xe, - isOdd: (c) => (c & ue) === ue, - neg: (c) => Se(-c, n), - eql: (c, l) => c === l, - sqr: (c) => Se(c * c, n), - add: (c, l) => Se(c + l, n), - sub: (c, l) => Se(c - l, n), - mul: (c, l) => Se(c * l, n), - pow: (c, l) => zl(a, c, l), - div: (c, l) => Se(c * ri(l, n), n), - // Same as above, but doesn't normalize - sqrN: (c) => c * c, - addN: (c, l) => c + l, - subN: (c, l) => c - l, - mulN: (c, l) => c * l, - inv: (c) => ri(c, n), - sqrt: r.sqrt || ((c) => o(a, c)), - invertBatch: (c) => Dl(a, c), - // TODO: do we really need constant cmov? - // We don't have const-time bigints anyway, so probably will be not very useful - cmov: (c, l, d) => d ? l : c, - toBytes: (c) => t ? $i(c, i) : en(c, i), - fromBytes: (c) => { - if (c.length !== i) - throw new Error(`Fp.fromBytes: expected ${i}, got ${c.length}`); - return t ? Ci(c) : Le(c); - } - }); - return Object.freeze(a); -} -function ya(n) { - if (typeof n != "bigint") - throw new Error("field order must be bigint"); - const e = n.toString(2).length; - return Math.ceil(e / 8); -} -function ma(n) { - const e = ya(n); - return e + Math.ceil(e / 2); -} -function Vl(n, e, t = !1) { - const r = n.length, s = ya(e), i = ma(e); - if (r < 16 || r < i || r > 1024) - throw new Error(`expected ${i}-1024 bytes of input, got ${r}`); - const o = t ? Le(n) : Ci(n), a = Se(o, e - ue) + ue; - return t ? $i(a, s) : en(a, s); -} -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const Kl = BigInt(0), $s = BigInt(1); -function Wl(n, e) { - const t = (s, i) => { - const o = i.negate(); - return s ? o : i; - }, r = (s) => { - const i = Math.ceil(e / s) + 1, o = 2 ** (s - 1); - return { windows: i, windowSize: o }; - }; - return { - constTimeNegate: t, - // non-const time multiplication ladder - unsafeLadder(s, i) { - let o = n.ZERO, a = s; - for (; i > Kl; ) - i & $s && (o = o.add(a)), a = a.double(), i >>= $s; - return o; - }, - /** - * Creates a wNAF precomputation window. Used for caching. - * Default window size is set by `utils.precompute()` and is equal to 8. - * Number of precomputed points depends on the curve size: - * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where: - * - 𝑊 is the window size - * - 𝑛 is the bitlength of the curve order. - * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224. - * @returns precomputed point tables flattened to a single array - */ - precomputeWindow(s, i) { - const { windows: o, windowSize: a } = r(i), c = []; - let l = s, d = l; - for (let u = 0; u < o; u++) { - d = l, c.push(d); - for (let f = 1; f < a; f++) - d = d.add(l), c.push(d); - l = d.double(); - } - return c; - }, - /** - * Implements ec multiplication using precomputed tables and w-ary non-adjacent form. - * @param W window size - * @param precomputes precomputed tables - * @param n scalar (we don't check here, but should be less than curve order) - * @returns real and fake (for const-time) points - */ - wNAF(s, i, o) { - const { windows: a, windowSize: c } = r(s); - let l = n.ZERO, d = n.BASE; - const u = BigInt(2 ** s - 1), f = 2 ** s, m = BigInt(s); - for (let b = 0; b < a; b++) { - const g = b * c; - let p = Number(o & u); - o >>= m, p > c && (p -= f, o += $s); - const y = g, w = g + Math.abs(p) - 1, x = b % 2 !== 0, A = p < 0; - p === 0 ? d = d.add(t(x, i[y])) : l = l.add(t(A, i[w])); - } - return { p: l, f: d }; - }, - wNAFCached(s, i, o, a) { - const c = s._WINDOW_SIZE || 1; - let l = i.get(s); - return l || (l = this.precomputeWindow(s, c), c !== 1 && i.set(s, a(l))), this.wNAF(c, l, o); - } - }; -} -function wa(n) { - return Zl(n.Fp), Cr(n, { - n: "bigint", - h: "bigint", - Gx: "field", - Gy: "field" - }, { - nBitLength: "isSafeInteger", - nByteLength: "isSafeInteger" - }), Object.freeze({ - ...ga(n.n, n.nBitLength), - ...n, - p: n.Fp.ORDER - }); -} -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -function Fl(n) { - const e = wa(n); - Cr(e, { - a: "field", - b: "field" - }, { - allowedPrivateKeyLengths: "array", - wrapPrivateKey: "boolean", - isTorsionFree: "function", - clearCofactor: "function", - allowInfinityPoint: "boolean", - fromBytes: "function", - toBytes: "function" - }); - const { endo: t, Fp: r, a: s } = e; - if (t) { - if (!r.eql(s, r.ZERO)) - throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0"); - if (typeof t != "object" || typeof t.beta != "bigint" || typeof t.splitScalar != "function") - throw new Error("Expected endomorphism with beta: bigint and splitScalar: function"); - } - return Object.freeze({ ...e }); -} -const { bytesToNumberBE: Gl, hexToBytes: Yl } = Ll, hn = { - // asn.1 DER encoding utils - Err: class extends Error { - constructor(e = "") { - super(e); - } - }, - _parseInt(n) { - const { Err: e } = hn; - if (n.length < 2 || n[0] !== 2) - throw new e("Invalid signature integer tag"); - const t = n[1], r = n.subarray(2, t + 2); - if (!t || r.length !== t) - throw new e("Invalid signature integer: wrong length"); - if (r[0] & 128) - throw new e("Invalid signature integer: negative"); - if (r[0] === 0 && !(r[1] & 128)) - throw new e("Invalid signature integer: unnecessary leading zero"); - return { d: Gl(r), l: n.subarray(t + 2) }; - }, - toSig(n) { - const { Err: e } = hn, t = typeof n == "string" ? Yl(n) : n; - if (!(t instanceof Uint8Array)) - throw new Error("ui8a expected"); - let r = t.length; - if (r < 2 || t[0] != 48) - throw new e("Invalid signature tag"); - if (t[1] !== r - 2) - throw new e("Invalid signature: incorrect length"); - const { d: s, l: i } = hn._parseInt(t.subarray(2)), { d: o, l: a } = hn._parseInt(i); - if (a.length) - throw new e("Invalid signature: left bytes after parsing"); - return { r: s, s: o }; - }, - hexFromSig(n) { - const e = (l) => Number.parseInt(l[0], 16) & 8 ? "00" + l : l, t = (l) => { - const d = l.toString(16); - return d.length & 1 ? `0${d}` : d; - }, r = e(t(n.s)), s = e(t(n.r)), i = r.length / 2, o = s.length / 2, a = t(i), c = t(o); - return `30${t(o + i + 4)}02${c}${s}02${a}${r}`; - } -}, Ot = BigInt(0), Ve = BigInt(1); -BigInt(2); -const Eo = BigInt(3); -BigInt(4); -function Jl(n) { - const e = Fl(n), { Fp: t } = e, r = e.toBytes || ((b, g, p) => { - const y = g.toAffine(); - return bn(Uint8Array.from([4]), t.toBytes(y.x), t.toBytes(y.y)); - }), s = e.fromBytes || ((b) => { - const g = b.subarray(1), p = t.fromBytes(g.subarray(0, t.BYTES)), y = t.fromBytes(g.subarray(t.BYTES, 2 * t.BYTES)); - return { x: p, y }; - }); - function i(b) { - const { a: g, b: p } = e, y = t.sqr(b), w = t.mul(y, b); - return t.add(t.add(w, t.mul(b, g)), p); - } - if (!t.eql(t.sqr(e.Gy), i(e.Gx))) - throw new Error("bad generator point: equation left != right"); - function o(b) { - return typeof b == "bigint" && Ot < b && b < e.n; - } - function a(b) { - if (!o(b)) - throw new Error("Expected valid bigint: 0 < bigint < curve.n"); - } - function c(b) { - const { allowedPrivateKeyLengths: g, nByteLength: p, wrapPrivateKey: y, n: w } = e; - if (g && typeof b != "bigint") { - if (b instanceof Uint8Array && (b = Hn(b)), typeof b != "string" || !g.includes(b.length)) - throw new Error("Invalid key"); - b = b.padStart(p * 2, "0"); - } - let x; - try { - x = typeof b == "bigint" ? b : Le(Ae("private key", b, p)); - } catch { - throw new Error(`private key must be ${p} bytes, hex or bigint, not ${typeof b}`); - } - return y && (x = Se(x, w)), a(x), x; - } - const l = /* @__PURE__ */ new Map(); - function d(b) { - if (!(b instanceof u)) - throw new Error("ProjectivePoint expected"); - } - class u { - constructor(g, p, y) { - if (this.px = g, this.py = p, this.pz = y, g == null || !t.isValid(g)) - throw new Error("x required"); - if (p == null || !t.isValid(p)) - throw new Error("y required"); - if (y == null || !t.isValid(y)) - throw new Error("z required"); - } - // Does not validate if the point is on-curve. - // Use fromHex instead, or call assertValidity() later. - static fromAffine(g) { - const { x: p, y } = g || {}; - if (!g || !t.isValid(p) || !t.isValid(y)) - throw new Error("invalid affine point"); - if (g instanceof u) - throw new Error("projective point not allowed"); - const w = (x) => t.eql(x, t.ZERO); - return w(p) && w(y) ? u.ZERO : new u(p, y, t.ONE); - } - get x() { - return this.toAffine().x; - } - get y() { - return this.toAffine().y; - } - /** - * Takes a bunch of Projective Points but executes only one - * inversion on all of them. Inversion is very slow operation, - * so this improves performance massively. - * Optimization: converts a list of projective points to a list of identical points with Z=1. - */ - static normalizeZ(g) { - const p = t.invertBatch(g.map((y) => y.pz)); - return g.map((y, w) => y.toAffine(p[w])).map(u.fromAffine); - } - /** - * Converts hash string or Uint8Array to Point. - * @param hex short/long ECDSA hex - */ - static fromHex(g) { - const p = u.fromAffine(s(Ae("pointHex", g))); - return p.assertValidity(), p; - } - // Multiplies generator point by privateKey. - static fromPrivateKey(g) { - return u.BASE.multiply(c(g)); - } - // "Private method", don't use it directly - _setWindowSize(g) { - this._WINDOW_SIZE = g, l.delete(this); - } - // A point on curve is valid if it conforms to equation. - assertValidity() { - if (this.is0()) { - if (e.allowInfinityPoint && !t.is0(this.py)) - return; - throw new Error("bad point: ZERO"); - } - const { x: g, y: p } = this.toAffine(); - if (!t.isValid(g) || !t.isValid(p)) - throw new Error("bad point: x or y not FE"); - const y = t.sqr(p), w = i(g); - if (!t.eql(y, w)) - throw new Error("bad point: equation left != right"); - if (!this.isTorsionFree()) - throw new Error("bad point: not in prime-order subgroup"); - } - hasEvenY() { - const { y: g } = this.toAffine(); - if (t.isOdd) - return !t.isOdd(g); - throw new Error("Field doesn't support isOdd"); - } - /** - * Compare one point to another. - */ - equals(g) { - d(g); - const { px: p, py: y, pz: w } = this, { px: x, py: A, pz: T } = g, _ = t.eql(t.mul(p, T), t.mul(x, w)), S = t.eql(t.mul(y, T), t.mul(A, w)); - return _ && S; - } - /** - * Flips point to one corresponding to (x, -y) in Affine coordinates. - */ - negate() { - return new u(this.px, t.neg(this.py), this.pz); - } - // Renes-Costello-Batina exception-free doubling formula. - // There is 30% faster Jacobian formula, but it is not complete. - // https://eprint.iacr.org/2015/1060, algorithm 3 - // Cost: 8M + 3S + 3*a + 2*b3 + 15add. - double() { - const { a: g, b: p } = e, y = t.mul(p, Eo), { px: w, py: x, pz: A } = this; - let T = t.ZERO, _ = t.ZERO, S = t.ZERO, k = t.mul(w, w), N = t.mul(x, x), z = t.mul(A, A), L = t.mul(w, x); - return L = t.add(L, L), S = t.mul(w, A), S = t.add(S, S), T = t.mul(g, S), _ = t.mul(y, z), _ = t.add(T, _), T = t.sub(N, _), _ = t.add(N, _), _ = t.mul(T, _), T = t.mul(L, T), S = t.mul(y, S), z = t.mul(g, z), L = t.sub(k, z), L = t.mul(g, L), L = t.add(L, S), S = t.add(k, k), k = t.add(S, k), k = t.add(k, z), k = t.mul(k, L), _ = t.add(_, k), z = t.mul(x, A), z = t.add(z, z), k = t.mul(z, L), T = t.sub(T, k), S = t.mul(z, N), S = t.add(S, S), S = t.add(S, S), new u(T, _, S); - } - // Renes-Costello-Batina exception-free addition formula. - // There is 30% faster Jacobian formula, but it is not complete. - // https://eprint.iacr.org/2015/1060, algorithm 1 - // Cost: 12M + 0S + 3*a + 3*b3 + 23add. - add(g) { - d(g); - const { px: p, py: y, pz: w } = this, { px: x, py: A, pz: T } = g; - let _ = t.ZERO, S = t.ZERO, k = t.ZERO; - const N = e.a, z = t.mul(e.b, Eo); - let L = t.mul(p, x), P = t.mul(y, A), F = t.mul(w, T), I = t.add(p, y), v = t.add(x, A); - I = t.mul(I, v), v = t.add(L, P), I = t.sub(I, v), v = t.add(p, w); - let E = t.add(x, T); - return v = t.mul(v, E), E = t.add(L, F), v = t.sub(v, E), E = t.add(y, w), _ = t.add(A, T), E = t.mul(E, _), _ = t.add(P, F), E = t.sub(E, _), k = t.mul(N, v), _ = t.mul(z, F), k = t.add(_, k), _ = t.sub(P, k), k = t.add(P, k), S = t.mul(_, k), P = t.add(L, L), P = t.add(P, L), F = t.mul(N, F), v = t.mul(z, v), P = t.add(P, F), F = t.sub(L, F), F = t.mul(N, F), v = t.add(v, F), L = t.mul(P, v), S = t.add(S, L), L = t.mul(E, v), _ = t.mul(I, _), _ = t.sub(_, L), L = t.mul(I, P), k = t.mul(E, k), k = t.add(k, L), new u(_, S, k); - } - subtract(g) { - return this.add(g.negate()); - } - is0() { - return this.equals(u.ZERO); - } - wNAF(g) { - return m.wNAFCached(this, l, g, (p) => { - const y = t.invertBatch(p.map((w) => w.pz)); - return p.map((w, x) => w.toAffine(y[x])).map(u.fromAffine); - }); - } - /** - * Non-constant-time multiplication. Uses double-and-add algorithm. - * It's faster, but should only be used when you don't care about - * an exposed private key e.g. sig verification, which works over *public* keys. - */ - multiplyUnsafe(g) { - const p = u.ZERO; - if (g === Ot) - return p; - if (a(g), g === Ve) - return this; - const { endo: y } = e; - if (!y) - return m.unsafeLadder(this, g); - let { k1neg: w, k1: x, k2neg: A, k2: T } = y.splitScalar(g), _ = p, S = p, k = this; - for (; x > Ot || T > Ot; ) - x & Ve && (_ = _.add(k)), T & Ve && (S = S.add(k)), k = k.double(), x >>= Ve, T >>= Ve; - return w && (_ = _.negate()), A && (S = S.negate()), S = new u(t.mul(S.px, y.beta), S.py, S.pz), _.add(S); - } - /** - * Constant time multiplication. - * Uses wNAF method. Windowed method may be 10% faster, - * but takes 2x longer to generate and consumes 2x memory. - * Uses precomputes when available. - * Uses endomorphism for Koblitz curves. - * @param scalar by which the point would be multiplied - * @returns New point - */ - multiply(g) { - a(g); - let p = g, y, w; - const { endo: x } = e; - if (x) { - const { k1neg: A, k1: T, k2neg: _, k2: S } = x.splitScalar(p); - let { p: k, f: N } = this.wNAF(T), { p: z, f: L } = this.wNAF(S); - k = m.constTimeNegate(A, k), z = m.constTimeNegate(_, z), z = new u(t.mul(z.px, x.beta), z.py, z.pz), y = k.add(z), w = N.add(L); - } else { - const { p: A, f: T } = this.wNAF(p); - y = A, w = T; - } - return u.normalizeZ([y, w])[0]; - } - /** - * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly. - * Not using Strauss-Shamir trick: precomputation tables are faster. - * The trick could be useful if both P and Q are not G (not in our case). - * @returns non-zero affine point - */ - multiplyAndAddUnsafe(g, p, y) { - const w = u.BASE, x = (T, _) => _ === Ot || _ === Ve || !T.equals(w) ? T.multiplyUnsafe(_) : T.multiply(_), A = x(this, p).add(x(g, y)); - return A.is0() ? void 0 : A; - } - // Converts Projective point to affine (x, y) coordinates. - // Can accept precomputed Z^-1 - for example, from invertBatch. - // (x, y, z) ∋ (x=x/z, y=y/z) - toAffine(g) { - const { px: p, py: y, pz: w } = this, x = this.is0(); - g == null && (g = x ? t.ONE : t.inv(w)); - const A = t.mul(p, g), T = t.mul(y, g), _ = t.mul(w, g); - if (x) - return { x: t.ZERO, y: t.ZERO }; - if (!t.eql(_, t.ONE)) - throw new Error("invZ was invalid"); - return { x: A, y: T }; - } - isTorsionFree() { - const { h: g, isTorsionFree: p } = e; - if (g === Ve) - return !0; - if (p) - return p(u, this); - throw new Error("isTorsionFree() has not been declared for the elliptic curve"); - } - clearCofactor() { - const { h: g, clearCofactor: p } = e; - return g === Ve ? this : p ? p(u, this) : this.multiplyUnsafe(e.h); - } - toRawBytes(g = !0) { - return this.assertValidity(), r(u, this, g); - } - toHex(g = !0) { - return Hn(this.toRawBytes(g)); - } - } - u.BASE = new u(e.Gx, e.Gy, t.ONE), u.ZERO = new u(t.ZERO, t.ONE, t.ZERO); - const f = e.nBitLength, m = Wl(u, e.endo ? Math.ceil(f / 2) : f); - return { - CURVE: e, - ProjectivePoint: u, - normPrivateKeyToScalar: c, - weierstrassEquation: i, - isWithinCurveOrder: o - }; -} -function Xl(n) { - const e = wa(n); - return Cr(e, { - hash: "hash", - hmac: "function", - randomBytes: "function" - }, { - bits2int: "function", - bits2int_modN: "function", - lowS: "boolean" - }), Object.freeze({ lowS: !0, ...e }); -} -function Ql(n) { - const e = Xl(n), { Fp: t, n: r } = e, s = t.BYTES + 1, i = 2 * t.BYTES + 1; - function o(v) { - return Ot < v && v < t.ORDER; - } - function a(v) { - return Se(v, r); - } - function c(v) { - return ri(v, r); - } - const { ProjectivePoint: l, normPrivateKeyToScalar: d, weierstrassEquation: u, isWithinCurveOrder: f } = Jl({ - ...e, - toBytes(v, E, C) { - const j = E.toAffine(), Z = t.toBytes(j.x), W = bn; - return C ? W(Uint8Array.from([E.hasEvenY() ? 2 : 3]), Z) : W(Uint8Array.from([4]), Z, t.toBytes(j.y)); - }, - fromBytes(v) { - const E = v.length, C = v[0], j = v.subarray(1); - if (E === s && (C === 2 || C === 3)) { - const Z = Le(j); - if (!o(Z)) - throw new Error("Point is not on curve"); - const W = u(Z); - let Y = t.sqrt(W); - const te = (Y & Ve) === Ve; - return (C & 1) === 1 !== te && (Y = t.neg(Y)), { x: Z, y: Y }; - } else if (E === i && C === 4) { - const Z = t.fromBytes(j.subarray(0, t.BYTES)), W = t.fromBytes(j.subarray(t.BYTES, 2 * t.BYTES)); - return { x: Z, y: W }; - } else - throw new Error(`Point of length ${E} was invalid. Expected ${s} compressed bytes or ${i} uncompressed bytes`); - } - }), m = (v) => Hn(en(v, e.nByteLength)); - function b(v) { - const E = r >> Ve; - return v > E; - } - function g(v) { - return b(v) ? a(-v) : v; - } - const p = (v, E, C) => Le(v.slice(E, C)); - class y { - constructor(E, C, j) { - this.r = E, this.s = C, this.recovery = j, this.assertValidity(); - } - // pair (bytes of r, bytes of s) - static fromCompact(E) { - const C = e.nByteLength; - return E = Ae("compactSignature", E, C * 2), new y(p(E, 0, C), p(E, C, 2 * C)); - } - // DER encoded ECDSA signature - // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script - static fromDER(E) { - const { r: C, s: j } = hn.toSig(Ae("DER", E)); - return new y(C, j); - } - assertValidity() { - if (!f(this.r)) - throw new Error("r must be 0 < r < CURVE.n"); - if (!f(this.s)) - throw new Error("s must be 0 < s < CURVE.n"); - } - addRecoveryBit(E) { - return new y(this.r, this.s, E); - } - recoverPublicKey(E) { - const { r: C, s: j, recovery: Z } = this, W = S(Ae("msgHash", E)); - if (Z == null || ![0, 1, 2, 3].includes(Z)) - throw new Error("recovery id invalid"); - const Y = Z === 2 || Z === 3 ? C + e.n : C; - if (Y >= t.ORDER) - throw new Error("recovery id 2 or 3 invalid"); - const te = Z & 1 ? "03" : "02", ce = l.fromHex(te + m(Y)), _e = c(Y), Ze = a(-W * _e), Re = a(j * _e), ze = l.BASE.multiplyAndAddUnsafe(ce, Ze, Re); - if (!ze) - throw new Error("point at infinify"); - return ze.assertValidity(), ze; - } - // Signatures should be low-s, to prevent malleability. - hasHighS() { - return b(this.s); - } - normalizeS() { - return this.hasHighS() ? new y(this.r, a(-this.s), this.recovery) : this; - } - // DER-encoded - toDERRawBytes() { - return Mn(this.toDERHex()); - } - toDERHex() { - return hn.hexFromSig({ r: this.r, s: this.s }); - } - // padded bytes of r, then padded bytes of s - toCompactRawBytes() { - return Mn(this.toCompactHex()); - } - toCompactHex() { - return m(this.r) + m(this.s); - } - } - const w = { - isValidPrivateKey(v) { - try { - return d(v), !0; - } catch { - return !1; - } - }, - normPrivateKeyToScalar: d, - /** - * Produces cryptographically secure private key from random of size - * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible. - */ - randomPrivateKey: () => { - const v = ma(e.n); - return Vl(e.randomBytes(v), e.n); - }, - /** - * Creates precompute table for an arbitrary EC point. Makes point "cached". - * Allows to massively speed-up `point.multiply(scalar)`. - * @returns cached point - * @example - * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey)); - * fast.multiply(privKey); // much faster ECDH now - */ - precompute(v = 8, E = l.BASE) { - return E._setWindowSize(v), E.multiply(BigInt(3)), E; - } - }; - function x(v, E = !0) { - return l.fromPrivateKey(v).toRawBytes(E); - } - function A(v) { - const E = v instanceof Uint8Array, C = typeof v == "string", j = (E || C) && v.length; - return E ? j === s || j === i : C ? j === 2 * s || j === 2 * i : v instanceof l; - } - function T(v, E, C = !0) { - if (A(v)) - throw new Error("first arg must be private key"); - if (!A(E)) - throw new Error("second arg must be public key"); - return l.fromHex(E).multiply(d(v)).toRawBytes(C); - } - const _ = e.bits2int || function(v) { - const E = Le(v), C = v.length * 8 - e.nBitLength; - return C > 0 ? E >> BigInt(C) : E; - }, S = e.bits2int_modN || function(v) { - return a(_(v)); - }, k = Ri(e.nBitLength); - function N(v) { - if (typeof v != "bigint") - throw new Error("bigint expected"); - if (!(Ot <= v && v < k)) - throw new Error(`bigint expected < 2^${e.nBitLength}`); - return en(v, e.nByteLength); - } - function z(v, E, C = L) { - if (["recovered", "canonical"].some((Ne) => Ne in C)) - throw new Error("sign() legacy options not supported"); - const { hash: j, randomBytes: Z } = e; - let { lowS: W, prehash: Y, extraEntropy: te } = C; - W == null && (W = !0), v = Ae("msgHash", v), Y && (v = Ae("prehashed msgHash", j(v))); - const ce = S(v), _e = d(E), Ze = [N(_e), N(ce)]; - if (te != null) { - const Ne = te === !0 ? Z(t.BYTES) : te; - Ze.push(Ae("extraEntropy", Ne)); - } - const Re = bn(...Ze), ze = ce; - function Ke(Ne) { - const bt = _(Ne); - if (!f(bt)) - return; - const vt = c(bt), ge = l.BASE.multiply(bt).toAffine(), ye = a(ge.x); - if (ye === Ot) - return; - const xt = a(vt * a(ze + ye * _e)); - if (xt === Ot) - return; - let Qn = (ge.x === ye ? 0 : 2) | Number(ge.y & Ve), go = xt; - return W && b(xt) && (go = g(xt), Qn ^= 1), new y(ye, go, Qn); - } - return { seed: Re, k2sig: Ke }; - } - const L = { lowS: e.lowS, prehash: !1 }, P = { lowS: e.lowS, prehash: !1 }; - function F(v, E, C = L) { - const { seed: j, k2sig: Z } = z(v, E, C), W = e; - return pa(W.hash.outputLen, W.nByteLength, W.hmac)(j, Z); - } - l.BASE._setWindowSize(8); - function I(v, E, C, j = P) { - var ge; - const Z = v; - if (E = Ae("msgHash", E), C = Ae("publicKey", C), "strict" in j) - throw new Error("options.strict was renamed to lowS"); - const { lowS: W, prehash: Y } = j; - let te, ce; - try { - if (typeof Z == "string" || Z instanceof Uint8Array) - try { - te = y.fromDER(Z); - } catch (ye) { - if (!(ye instanceof hn.Err)) - throw ye; - te = y.fromCompact(Z); - } - else if (typeof Z == "object" && typeof Z.r == "bigint" && typeof Z.s == "bigint") { - const { r: ye, s: xt } = Z; - te = new y(ye, xt); - } else - throw new Error("PARSE"); - ce = l.fromHex(C); - } catch (ye) { - if (ye.message === "PARSE") - throw new Error("signature must be Signature instance, Uint8Array or hex string"); - return !1; - } - if (W && te.hasHighS()) - return !1; - Y && (E = e.hash(E)); - const { r: _e, s: Ze } = te, Re = S(E), ze = c(Ze), Ke = a(Re * ze), Ne = a(_e * ze), bt = (ge = l.BASE.multiplyAndAddUnsafe(ce, Ke, Ne)) == null ? void 0 : ge.toAffine(); - return bt ? a(bt.x) === _e : !1; - } - return { - CURVE: e, - getPublicKey: x, - getSharedSecret: T, - sign: F, - verify: I, - ProjectivePoint: l, - Signature: y, - utils: w - }; -} -let ba = class extends ua { - constructor(e, t) { - super(), this.finished = !1, this.destroyed = !1, pl(e); - const r = Oi(t); - if (this.iHash = e.create(), typeof this.iHash.update != "function") - throw new Error("Expected instance of class which extends utils.Hash"); - this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen; - const s = this.blockLen, i = new Uint8Array(s); - i.set(r.length > s ? e.create().update(r).digest() : r); - for (let o = 0; o < i.length; o++) - i[o] ^= 54; - this.iHash.update(i), this.oHash = e.create(); - for (let o = 0; o < i.length; o++) - i[o] ^= 106; - this.oHash.update(i), i.fill(0); - } - update(e) { - return Yr(this), this.iHash.update(e), this; - } - digestInto(e) { - Yr(this), ca(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy(); - } - digest() { - const e = new Uint8Array(this.oHash.outputLen); - return this.digestInto(e), e; - } - _cloneInto(e) { - e || (e = Object.create(Object.getPrototypeOf(this), {})); - const { oHash: t, iHash: r, finished: s, destroyed: i, blockLen: o, outputLen: a } = this; - return e = e, e.finished = s, e.destroyed = i, e.blockLen = o, e.outputLen = a, e.oHash = t._cloneInto(e.oHash), e.iHash = r._cloneInto(e.iHash), e; - } - destroy() { - this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy(); - } -}; -const va = (n, e, t) => new ba(n, e).update(t).digest(); -va.create = (n, e) => new ba(n, e); -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -function eu(n) { - return { - hash: n, - hmac: (e, ...t) => va(n, e, wl(...t)), - randomBytes: da - }; -} -function tu(n, e) { - const t = (r) => Ql({ ...n, ...eu(r) }); - return Object.freeze({ ...t(e), create: t }); -} -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const fs = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Jr = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), xa = BigInt(1), Xr = BigInt(2), _o = (n, e) => (n + e / Xr) / e; -function Ea(n) { - const e = fs, t = BigInt(3), r = BigInt(6), s = BigInt(11), i = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = n * n * n % e, d = l * l * n % e, u = De(d, t, e) * d % e, f = De(u, t, e) * d % e, m = De(f, Xr, e) * l % e, b = De(m, s, e) * m % e, g = De(b, i, e) * b % e, p = De(g, a, e) * g % e, y = De(p, c, e) * p % e, w = De(y, a, e) * g % e, x = De(w, t, e) * d % e, A = De(x, o, e) * b % e, T = De(A, r, e) * l % e, _ = De(T, Xr, e); - if (!si.eql(si.sqr(_), n)) - throw new Error("Cannot find square root"); - return _; -} -const si = ql(fs, void 0, void 0, { sqrt: Ea }), Gn = tu({ - a: BigInt(0), - b: BigInt(7), - Fp: si, - n: Jr, - // Base point (x, y) aka generator point - Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"), - Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"), - h: BigInt(1), - lowS: !0, - /** - * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism. - * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%. - * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit. - * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066 - */ - endo: { - beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"), - splitScalar: (n) => { - const e = Jr, t = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -xa * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), s = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), i = t, o = BigInt("0x100000000000000000000000000000000"), a = _o(i * n, e), c = _o(-r * n, e); - let l = Se(n - a * t - c * s, e), d = Se(-a * r - c * i, e); - const u = l > o, f = d > o; - if (u && (l = e - l), f && (d = e - d), l > o || d > o) - throw new Error("splitScalar: Endomorphism failed, k=" + n); - return { k1neg: u, k1: l, k2neg: f, k2: d }; - } - } -}, ti), ps = BigInt(0), _a = (n) => typeof n == "bigint" && ps < n && n < fs, nu = (n) => typeof n == "bigint" && ps < n && n < Jr, So = {}; -function Qr(n, ...e) { - let t = So[n]; - if (t === void 0) { - const r = ti(Uint8Array.from(n, (s) => s.charCodeAt(0))); - t = bn(r, r), So[n] = t; - } - return ti(bn(t, ...e)); -} -const Ni = (n) => n.toRawBytes(!0).slice(1), ii = (n) => en(n, 32), Rs = (n) => Se(n, fs), ar = (n) => Se(n, Jr), Li = Gn.ProjectivePoint, ru = (n, e, t) => Li.BASE.multiplyAndAddUnsafe(n, e, t); -function oi(n) { - let e = Gn.utils.normPrivateKeyToScalar(n), t = Li.fromPrivateKey(e); - return { scalar: t.hasEvenY() ? e : ar(-e), bytes: Ni(t) }; -} -function Sa(n) { - if (!_a(n)) - throw new Error("bad x: need 0 < x < p"); - const e = Rs(n * n), t = Rs(e * n + BigInt(7)); - let r = Ea(t); - r % Xr !== ps && (r = Rs(-r)); - const s = new Li(n, r, xa); - return s.assertValidity(), s; -} -function ka(...n) { - return ar(Le(Qr("BIP0340/challenge", ...n))); -} -function su(n) { - return oi(n).bytes; -} -function iu(n, e, t = da(32)) { - const r = Ae("message", n), { bytes: s, scalar: i } = oi(e), o = Ae("auxRand", t, 32), a = ii(i ^ Le(Qr("BIP0340/aux", o))), c = Qr("BIP0340/nonce", a, s, r), l = ar(Le(c)); - if (l === ps) - throw new Error("sign failed: k is zero"); - const { bytes: d, scalar: u } = oi(l), f = ka(d, s, r), m = new Uint8Array(64); - if (m.set(d, 0), m.set(ii(ar(u + f * i)), 32), !Aa(m, r, s)) - throw new Error("sign: Invalid signature produced"); - return m; -} -function Aa(n, e, t) { - const r = Ae("signature", n, 64), s = Ae("message", e), i = Ae("publicKey", t, 32); - try { - const o = Sa(Le(i)), a = Le(r.subarray(0, 32)); - if (!_a(a)) - return !1; - const c = Le(r.subarray(32, 64)); - if (!nu(c)) - return !1; - const l = ka(ii(a), Ni(o), s), d = ru(o, c, ar(-l)); - return !(!d || !d.hasEvenY() || d.toAffine().x !== a); - } catch { - return !1; - } -} -const dt = { - getPublicKey: su, - sign: iu, - verify: Aa, - utils: { - randomPrivateKey: Gn.utils.randomPrivateKey, - lift_x: Sa, - pointToBytes: Ni, - numberToBytesBE: en, - bytesToNumberBE: Le, - taggedHash: Qr, - mod: Se - } -}, Ns = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0; -/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const Ui = (n) => n instanceof Uint8Array, Ls = (n) => new DataView(n.buffer, n.byteOffset, n.byteLength), at = (n, e) => n << 32 - e | n >>> e, ou = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68; -if (!ou) - throw new Error("Non little-endian hardware is not supported"); -const au = Array.from({ length: 256 }, (n, e) => e.toString(16).padStart(2, "0")); -function ve(n) { - if (!Ui(n)) - throw new Error("Uint8Array expected"); - let e = ""; - for (let t = 0; t < n.length; t++) - e += au[n[t]]; - return e; -} -function jn(n) { - if (typeof n != "string") - throw new Error("hex string expected, got " + typeof n); - const e = n.length; - if (e % 2) - throw new Error("padded hex string expected, got unpadded hex of length " + e); - const t = new Uint8Array(e / 2); - for (let r = 0; r < t.length; r++) { - const s = r * 2, i = n.slice(s, s + 2), o = Number.parseInt(i, 16); - if (Number.isNaN(o) || o < 0) - throw new Error("Invalid byte sequence"); - t[r] = o; - } - return t; -} -function cu(n) { - if (typeof n != "string") - throw new Error(`utf8ToBytes expected string, got ${typeof n}`); - return new Uint8Array(new TextEncoder().encode(n)); -} -function cr(n) { - if (typeof n == "string" && (n = cu(n)), !Ui(n)) - throw new Error(`expected Uint8Array, got ${typeof n}`); - return n; -} -function gs(...n) { - const e = new Uint8Array(n.reduce((r, s) => r + s.length, 0)); - let t = 0; - return n.forEach((r) => { - if (!Ui(r)) - throw new Error("Uint8Array expected"); - e.set(r, t), t += r.length; - }), e; -} -let Ta = class { - // Safe version that clones internal state - clone() { - return this._cloneInto(); - } -}; -function Ba(n) { - const e = (r) => n().update(cr(r)).digest(), t = n(); - return e.outputLen = t.outputLen, e.blockLen = t.blockLen, e.create = () => n(), e; -} -function Oa(n = 32) { - if (Ns && typeof Ns.getRandomValues == "function") - return Ns.getRandomValues(new Uint8Array(n)); - throw new Error("crypto.getRandomValues must be defined"); -} -function ai(n) { - if (!Number.isSafeInteger(n) || n < 0) - throw new Error(`Wrong positive integer: ${n}`); -} -function lu(n) { - if (typeof n != "boolean") - throw new Error(`Expected boolean, not ${n}`); -} -function Ia(n, ...e) { - if (!(n instanceof Uint8Array)) - throw new Error("Expected Uint8Array"); - if (e.length > 0 && !e.includes(n.length)) - throw new Error(`Expected Uint8Array of length ${e}, not of length=${n.length}`); -} -function uu(n) { - if (typeof n != "function" || typeof n.create != "function") - throw new Error("Hash should be wrapped by utils.wrapConstructor"); - ai(n.outputLen), ai(n.blockLen); -} -function du(n, e = !0) { - if (n.destroyed) - throw new Error("Hash instance has been destroyed"); - if (e && n.finished) - throw new Error("Hash#digest() has already been called"); -} -function hu(n, e) { - Ia(n); - const t = e.outputLen; - if (n.length < t) - throw new Error(`digestInto() expects output buffer of length at least ${t}`); -} -const pt = { - number: ai, - bool: lu, - bytes: Ia, - hash: uu, - exists: du, - output: hu -}; -function fu(n, e, t, r) { - if (typeof n.setBigUint64 == "function") - return n.setBigUint64(e, t, r); - const s = BigInt(32), i = BigInt(4294967295), o = Number(t >> s & i), a = Number(t & i), c = r ? 4 : 0, l = r ? 0 : 4; - n.setUint32(e + c, o, r), n.setUint32(e + l, a, r); -} -class pu extends Ta { - constructor(e, t, r, s) { - super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = s, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = Ls(this.buffer); - } - update(e) { - pt.exists(this); - const { view: t, buffer: r, blockLen: s } = this; - e = cr(e); - const i = e.length; - for (let o = 0; o < i; ) { - const a = Math.min(s - this.pos, i - o); - if (a === s) { - const c = Ls(e); - for (; s <= i - o; o += s) - this.process(c, o); - continue; - } - r.set(e.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === s && (this.process(t, 0), this.pos = 0); - } - return this.length += e.length, this.roundClean(), this; - } - digestInto(e) { - pt.exists(this), pt.output(e, this), this.finished = !0; - const { buffer: t, view: r, blockLen: s, isLE: i } = this; - let { pos: o } = this; - t[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > s - o && (this.process(r, 0), o = 0); - for (let u = o; u < s; u++) - t[u] = 0; - fu(r, s - 8, BigInt(this.length * 8), i), this.process(r, 0); - const a = Ls(e), c = this.outputLen; - if (c % 4) - throw new Error("_sha2: outputLen should be aligned to 32bit"); - const l = c / 4, d = this.get(); - if (l > d.length) - throw new Error("_sha2: outputLen bigger than state"); - for (let u = 0; u < l; u++) - a.setUint32(4 * u, d[u], i); - } - digest() { - const { buffer: e, outputLen: t } = this; - this.digestInto(e); - const r = e.slice(0, t); - return this.destroy(), r; - } - _cloneInto(e) { - e || (e = new this.constructor()), e.set(...this.get()); - const { blockLen: t, buffer: r, length: s, finished: i, destroyed: o, pos: a } = this; - return e.length = s, e.pos = a, e.finished = i, e.destroyed = o, s % t && e.buffer.set(r), e; - } -} -const gu = (n, e, t) => n & e ^ ~n & t, yu = (n, e, t) => n & e ^ n & t ^ e & t, mu = new Uint32Array([ - 1116352408, - 1899447441, - 3049323471, - 3921009573, - 961987163, - 1508970993, - 2453635748, - 2870763221, - 3624381080, - 310598401, - 607225278, - 1426881987, - 1925078388, - 2162078206, - 2614888103, - 3248222580, - 3835390401, - 4022224774, - 264347078, - 604807628, - 770255983, - 1249150122, - 1555081692, - 1996064986, - 2554220882, - 2821834349, - 2952996808, - 3210313671, - 3336571891, - 3584528711, - 113926993, - 338241895, - 666307205, - 773529912, - 1294757372, - 1396182291, - 1695183700, - 1986661051, - 2177026350, - 2456956037, - 2730485921, - 2820302411, - 3259730800, - 3345764771, - 3516065817, - 3600352804, - 4094571909, - 275423344, - 430227734, - 506948616, - 659060556, - 883997877, - 958139571, - 1322822218, - 1537002063, - 1747873779, - 1955562222, - 2024104815, - 2227730452, - 2361852424, - 2428436474, - 2756734187, - 3204031479, - 3329325298 -]), Pt = new Uint32Array([ - 1779033703, - 3144134277, - 1013904242, - 2773480762, - 1359893119, - 2600822924, - 528734635, - 1541459225 -]), Zt = new Uint32Array(64); -let Ca = class extends pu { - constructor() { - super(64, 32, 8, !1), this.A = Pt[0] | 0, this.B = Pt[1] | 0, this.C = Pt[2] | 0, this.D = Pt[3] | 0, this.E = Pt[4] | 0, this.F = Pt[5] | 0, this.G = Pt[6] | 0, this.H = Pt[7] | 0; - } - get() { - const { A: e, B: t, C: r, D: s, E: i, F: o, G: a, H: c } = this; - return [e, t, r, s, i, o, a, c]; - } - // prettier-ignore - set(e, t, r, s, i, o, a, c) { - this.A = e | 0, this.B = t | 0, this.C = r | 0, this.D = s | 0, this.E = i | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0; - } - process(e, t) { - for (let u = 0; u < 16; u++, t += 4) - Zt[u] = e.getUint32(t, !1); - for (let u = 16; u < 64; u++) { - const f = Zt[u - 15], m = Zt[u - 2], b = at(f, 7) ^ at(f, 18) ^ f >>> 3, g = at(m, 17) ^ at(m, 19) ^ m >>> 10; - Zt[u] = g + Zt[u - 7] + b + Zt[u - 16] | 0; - } - let { A: r, B: s, C: i, D: o, E: a, F: c, G: l, H: d } = this; - for (let u = 0; u < 64; u++) { - const f = at(a, 6) ^ at(a, 11) ^ at(a, 25), m = d + f + gu(a, c, l) + mu[u] + Zt[u] | 0, g = (at(r, 2) ^ at(r, 13) ^ at(r, 22)) + yu(r, s, i) | 0; - d = l, l = c, c = a, a = o + m | 0, o = i, i = s, s = r, r = m + g | 0; - } - r = r + this.A | 0, s = s + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, d = d + this.H | 0, this.set(r, s, i, o, a, c, l, d); - } - roundClean() { - Zt.fill(0); - } - destroy() { - this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0); - } -}; -class wu extends Ca { - constructor() { - super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28; - } -} -const Yn = Ba(() => new Ca()); -Ba(() => new wu()); -/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -function Jn(n) { - if (!Number.isSafeInteger(n)) - throw new Error(`Wrong integer: ${n}`); -} -function Nt(...n) { - const e = (s, i) => (o) => s(i(o)), t = Array.from(n).reverse().reduce((s, i) => s ? e(s, i.encode) : i.encode, void 0), r = n.reduce((s, i) => s ? e(s, i.decode) : i.decode, void 0); - return { encode: t, decode: r }; -} -function Lt(n) { - return { - encode: (e) => { - if (!Array.isArray(e) || e.length && typeof e[0] != "number") - throw new Error("alphabet.encode input should be an array of numbers"); - return e.map((t) => { - if (Jn(t), t < 0 || t >= n.length) - throw new Error(`Digit index outside alphabet: ${t} (alphabet: ${n.length})`); - return n[t]; - }); - }, - decode: (e) => { - if (!Array.isArray(e) || e.length && typeof e[0] != "string") - throw new Error("alphabet.decode input should be array of strings"); - return e.map((t) => { - if (typeof t != "string") - throw new Error(`alphabet.decode: not string element=${t}`); - const r = n.indexOf(t); - if (r === -1) - throw new Error(`Unknown letter: "${t}". Allowed: ${n}`); - return r; - }); - } - }; -} -function Ut(n = "") { - if (typeof n != "string") - throw new Error("join separator should be string"); - return { - encode: (e) => { - if (!Array.isArray(e) || e.length && typeof e[0] != "string") - throw new Error("join.encode input should be array of strings"); - for (let t of e) - if (typeof t != "string") - throw new Error(`join.encode: non-string input=${t}`); - return e.join(n); - }, - decode: (e) => { - if (typeof e != "string") - throw new Error("join.decode input should be string"); - return e.split(n); - } - }; -} -function ys(n, e = "=") { - if (Jn(n), typeof e != "string") - throw new Error("padding chr should be string"); - return { - encode(t) { - if (!Array.isArray(t) || t.length && typeof t[0] != "string") - throw new Error("padding.encode input should be array of strings"); - for (let r of t) - if (typeof r != "string") - throw new Error(`padding.encode: non-string input=${r}`); - for (; t.length * n % 8; ) - t.push(e); - return t; - }, - decode(t) { - if (!Array.isArray(t) || t.length && typeof t[0] != "string") - throw new Error("padding.encode input should be array of strings"); - for (let s of t) - if (typeof s != "string") - throw new Error(`padding.decode: non-string input=${s}`); - let r = t.length; - if (r * n % 8) - throw new Error("Invalid padding: string should have whole number of bytes"); - for (; r > 0 && t[r - 1] === e; r--) - if (!((r - 1) * n % 8)) - throw new Error("Invalid padding: string has too much padding"); - return t.slice(0, r); - } - }; -} -function $a(n) { - if (typeof n != "function") - throw new Error("normalize fn should be function"); - return { encode: (e) => e, decode: (e) => n(e) }; -} -function ko(n, e, t) { - if (e < 2) - throw new Error(`convertRadix: wrong from=${e}, base cannot be less than 2`); - if (t < 2) - throw new Error(`convertRadix: wrong to=${t}, base cannot be less than 2`); - if (!Array.isArray(n)) - throw new Error("convertRadix: data should be array"); - if (!n.length) - return []; - let r = 0; - const s = [], i = Array.from(n); - for (i.forEach((o) => { - if (Jn(o), o < 0 || o >= e) - throw new Error(`Wrong integer: ${o}`); - }); ; ) { - let o = 0, a = !0; - for (let c = r; c < i.length; c++) { - const l = i[c], d = e * o + l; - if (!Number.isSafeInteger(d) || e * o / e !== o || d - l !== e * o) - throw new Error("convertRadix: carry overflow"); - if (o = d % t, i[c] = Math.floor(d / t), !Number.isSafeInteger(i[c]) || i[c] * t + o !== d) - throw new Error("convertRadix: carry overflow"); - if (a) - i[c] ? a = !1 : r = c; - else continue; - } - if (s.push(o), a) - break; - } - for (let o = 0; o < n.length - 1 && n[o] === 0; o++) - s.push(0); - return s.reverse(); -} -const Ra = (n, e) => e ? Ra(e, n % e) : n, es = (n, e) => n + (e - Ra(n, e)); -function ci(n, e, t, r) { - if (!Array.isArray(n)) - throw new Error("convertRadix2: data should be array"); - if (e <= 0 || e > 32) - throw new Error(`convertRadix2: wrong from=${e}`); - if (t <= 0 || t > 32) - throw new Error(`convertRadix2: wrong to=${t}`); - if (es(e, t) > 32) - throw new Error(`convertRadix2: carry overflow from=${e} to=${t} carryBits=${es(e, t)}`); - let s = 0, i = 0; - const o = 2 ** t - 1, a = []; - for (const c of n) { - if (Jn(c), c >= 2 ** e) - throw new Error(`convertRadix2: invalid data word=${c} from=${e}`); - if (s = s << e | c, i + e > 32) - throw new Error(`convertRadix2: carry overflow pos=${i} from=${e}`); - for (i += e; i >= t; i -= t) - a.push((s >> i - t & o) >>> 0); - s &= 2 ** i - 1; - } - if (s = s << t - i & o, !r && i >= e) - throw new Error("Excess padding"); - if (!r && s) - throw new Error(`Non-zero padding: ${s}`); - return r && i > 0 && a.push(s >>> 0), a; -} -function bu(n) { - return Jn(n), { - encode: (e) => { - if (!(e instanceof Uint8Array)) - throw new Error("radix.encode input should be Uint8Array"); - return ko(Array.from(e), 2 ** 8, n); - }, - decode: (e) => { - if (!Array.isArray(e) || e.length && typeof e[0] != "number") - throw new Error("radix.decode input should be array of strings"); - return Uint8Array.from(ko(e, n, 2 ** 8)); - } - }; -} -function on(n, e = !1) { - if (Jn(n), n <= 0 || n > 32) - throw new Error("radix2: bits should be in (0..32]"); - if (es(8, n) > 32 || es(n, 8) > 32) - throw new Error("radix2: carry overflow"); - return { - encode: (t) => { - if (!(t instanceof Uint8Array)) - throw new Error("radix2.encode input should be Uint8Array"); - return ci(Array.from(t), 8, n, !e); - }, - decode: (t) => { - if (!Array.isArray(t) || t.length && typeof t[0] != "number") - throw new Error("radix2.decode input should be array of strings"); - return Uint8Array.from(ci(t, n, 8, e)); - } - }; -} -function Ao(n) { - if (typeof n != "function") - throw new Error("unsafeWrapper fn should be function"); - return function(...e) { - try { - return n.apply(null, e); - } catch { - } - }; -} -const vu = Nt(on(4), Lt("0123456789ABCDEF"), Ut("")), xu = Nt(on(5), Lt("ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"), ys(5), Ut("")); -Nt(on(5), Lt("0123456789ABCDEFGHIJKLMNOPQRSTUV"), ys(5), Ut("")); -Nt(on(5), Lt("0123456789ABCDEFGHJKMNPQRSTVWXYZ"), Ut(""), $a((n) => n.toUpperCase().replace(/O/g, "0").replace(/[IL]/g, "1"))); -const $t = Nt(on(6), Lt("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"), ys(6), Ut("")), Eu = Nt(on(6), Lt("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"), ys(6), Ut("")), Hi = (n) => Nt(bu(58), Lt(n), Ut("")), li = Hi("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"); -Hi("123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ"); -Hi("rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz"); -const To = [0, 2, 3, 5, 6, 7, 9, 10, 11], _u = { - encode(n) { - let e = ""; - for (let t = 0; t < n.length; t += 8) { - const r = n.subarray(t, t + 8); - e += li.encode(r).padStart(To[r.length], "1"); - } - return e; - }, - decode(n) { - let e = []; - for (let t = 0; t < n.length; t += 11) { - const r = n.slice(t, t + 11), s = To.indexOf(r.length), i = li.decode(r); - for (let o = 0; o < i.length - s; o++) - if (i[o] !== 0) - throw new Error("base58xmr: wrong padding"); - e = e.concat(Array.from(i.slice(i.length - s))); - } - return Uint8Array.from(e); - } -}, ui = Nt(Lt("qpzry9x8gf2tvdw0s3jn54khce6mua7l"), Ut("")), Bo = [996825010, 642813549, 513874426, 1027748829, 705979059]; -function er(n) { - const e = n >> 25; - let t = (n & 33554431) << 5; - for (let r = 0; r < Bo.length; r++) - (e >> r & 1) === 1 && (t ^= Bo[r]); - return t; -} -function Oo(n, e, t = 1) { - const r = n.length; - let s = 1; - for (let i = 0; i < r; i++) { - const o = n.charCodeAt(i); - if (o < 33 || o > 126) - throw new Error(`Invalid prefix (${n})`); - s = er(s) ^ o >> 5; - } - s = er(s); - for (let i = 0; i < r; i++) - s = er(s) ^ n.charCodeAt(i) & 31; - for (let i of e) - s = er(s) ^ i; - for (let i = 0; i < 6; i++) - s = er(s); - return s ^= t, ui.encode(ci([s % 2 ** 30], 30, 5, !1)); -} -function Na(n) { - const e = n === "bech32" ? 1 : 734539939, t = on(5), r = t.decode, s = t.encode, i = Ao(r); - function o(d, u, f = 90) { - if (typeof d != "string") - throw new Error(`bech32.encode prefix should be string, not ${typeof d}`); - if (!Array.isArray(u) || u.length && typeof u[0] != "number") - throw new Error(`bech32.encode words should be array of numbers, not ${typeof u}`); - const m = d.length + 7 + u.length; - if (f !== !1 && m > f) - throw new TypeError(`Length ${m} exceeds limit ${f}`); - return d = d.toLowerCase(), `${d}1${ui.encode(u)}${Oo(d, u, e)}`; - } - function a(d, u = 90) { - if (typeof d != "string") - throw new Error(`bech32.decode input should be string, not ${typeof d}`); - if (d.length < 8 || u !== !1 && d.length > u) - throw new TypeError(`Wrong string length: ${d.length} (${d}). Expected (8..${u})`); - const f = d.toLowerCase(); - if (d !== f && d !== d.toUpperCase()) - throw new Error("String must be lowercase or uppercase"); - d = f; - const m = d.lastIndexOf("1"); - if (m === 0 || m === -1) - throw new Error('Letter "1" must be present between prefix and data only'); - const b = d.slice(0, m), g = d.slice(m + 1); - if (g.length < 6) - throw new Error("Data must be at least 6 characters long"); - const p = ui.decode(g).slice(0, -6), y = Oo(b, p, e); - if (!g.endsWith(y)) - throw new Error(`Invalid checksum in ${d}: expected "${y}"`); - return { prefix: b, words: p }; - } - const c = Ao(a); - function l(d) { - const { prefix: u, words: f } = a(d, !1); - return { prefix: u, words: f, bytes: r(f) }; - } - return { encode: o, decode: a, decodeToBytes: l, decodeUnsafe: c, fromWords: r, fromWordsUnsafe: i, toWords: s }; -} -const Pn = Na("bech32"); -Na("bech32m"); -const Su = { - encode: (n) => new TextDecoder().decode(n), - decode: (n) => new TextEncoder().encode(n) -}, ku = Nt(on(4), Lt("0123456789abcdef"), Ut(""), $a((n) => { - if (typeof n != "string" || n.length % 2) - throw new TypeError(`hex.decode: expected string, got ${typeof n} with length ${n.length}`); - return n.toLowerCase(); -})), Au = { - utf8: Su, - hex: ku, - base16: vu, - base32: xu, - base64: $t, - base64url: Eu, - base58: li, - base58xmr: _u -}; -`${Object.keys(Au).join(", ")}`; -function Us(n) { - if (!Number.isSafeInteger(n) || n < 0) - throw new Error(`positive integer expected, not ${n}`); -} -function Io(n) { - if (typeof n != "boolean") - throw new Error(`boolean expected, not ${n}`); -} -function Tu(n) { - return n instanceof Uint8Array || n != null && typeof n == "object" && n.constructor.name === "Uint8Array"; -} -function Ct(n, ...e) { - if (!Tu(n)) - throw new Error("Uint8Array expected"); - if (e.length > 0 && !e.includes(n.length)) - throw new Error(`Uint8Array expected of length ${e}, not of length=${n.length}`); -} -/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */ -const Te = (n) => new Uint32Array(n.buffer, n.byteOffset, Math.floor(n.byteLength / 4)), Bu = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68; -if (!Bu) - throw new Error("Non little-endian hardware is not supported"); -function Ou(n, e) { - if (e == null || typeof e != "object") - throw new Error("options must be defined"); - return Object.assign(n, e); -} -function Iu(n, e) { - if (n.length !== e.length) - return !1; - let t = 0; - for (let r = 0; r < n.length; r++) - t |= n[r] ^ e[r]; - return t === 0; -} -const Cu = /* @__NO_SIDE_EFFECTS__ */ (n, e) => (Object.assign(e, n), e), Qt = 16, $u = 283; -function Mi(n) { - return n << 1 ^ $u & -(n >> 7); -} -function Tn(n, e) { - let t = 0; - for (; e > 0; e >>= 1) - t ^= n & -(e & 1), n = Mi(n); - return t; -} -const di = /* @__PURE__ */ (() => { - let n = new Uint8Array(256); - for (let t = 0, r = 1; t < 256; t++, r ^= Mi(r)) - n[t] = r; - const e = new Uint8Array(256); - e[0] = 99; - for (let t = 0; t < 255; t++) { - let r = n[255 - t]; - r |= r << 8, e[n[t]] = (r ^ r >> 4 ^ r >> 5 ^ r >> 6 ^ r >> 7 ^ 99) & 255; - } - return e; -})(), Ru = /* @__PURE__ */ di.map((n, e) => di.indexOf(e)), Nu = (n) => n << 24 | n >>> 8, Hs = (n) => n << 8 | n >>> 24; -function La(n, e) { - if (n.length !== 256) - throw new Error("Wrong sbox length"); - const t = new Uint32Array(256).map((l, d) => e(n[d])), r = t.map(Hs), s = r.map(Hs), i = s.map(Hs), o = new Uint32Array(256 * 256), a = new Uint32Array(256 * 256), c = new Uint16Array(256 * 256); - for (let l = 0; l < 256; l++) - for (let d = 0; d < 256; d++) { - const u = l * 256 + d; - o[u] = t[l] ^ r[d], a[u] = s[l] ^ i[d], c[u] = n[l] << 8 | n[d]; - } - return { sbox: n, sbox2: c, T0: t, T1: r, T2: s, T3: i, T01: o, T23: a }; -} -const ji = /* @__PURE__ */ La(di, (n) => Tn(n, 3) << 24 | n << 16 | n << 8 | Tn(n, 2)), Ua = /* @__PURE__ */ La(Ru, (n) => Tn(n, 11) << 24 | Tn(n, 13) << 16 | Tn(n, 9) << 8 | Tn(n, 14)), Lu = /* @__PURE__ */ (() => { - const n = new Uint8Array(16); - for (let e = 0, t = 1; e < 16; e++, t = Mi(t)) - n[e] = t; - return n; -})(); -function Ha(n) { - Ct(n); - const e = n.length; - if (![16, 24, 32].includes(e)) - throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${e}`); - const { sbox2: t } = ji, r = Te(n), s = r.length, i = (a) => gt(t, a, a, a, a), o = new Uint32Array(e + 28); - o.set(r); - for (let a = s; a < o.length; a++) { - let c = o[a - 1]; - a % s === 0 ? c = i(Nu(c)) ^ Lu[a / s - 1] : s > 6 && a % s === 4 && (c = i(c)), o[a] = o[a - s] ^ c; - } - return o; -} -function Uu(n) { - const e = Ha(n), t = e.slice(), r = e.length, { sbox2: s } = ji, { T0: i, T1: o, T2: a, T3: c } = Ua; - for (let l = 0; l < r; l += 4) - for (let d = 0; d < 4; d++) - t[l + d] = e[r - l - 4 + d]; - e.fill(0); - for (let l = 4; l < r - 4; l++) { - const d = t[l], u = gt(s, d, d, d, d); - t[l] = i[u & 255] ^ o[u >>> 8 & 255] ^ a[u >>> 16 & 255] ^ c[u >>> 24]; - } - return t; -} -function Xt(n, e, t, r, s, i) { - return n[t << 8 & 65280 | r >>> 8 & 255] ^ e[s >>> 8 & 65280 | i >>> 24 & 255]; -} -function gt(n, e, t, r, s) { - return n[e & 255 | t & 65280] | n[r >>> 16 & 255 | s >>> 16 & 65280] << 16; -} -function Co(n, e, t, r, s) { - const { sbox2: i, T01: o, T23: a } = ji; - let c = 0; - e ^= n[c++], t ^= n[c++], r ^= n[c++], s ^= n[c++]; - const l = n.length / 4 - 2; - for (let b = 0; b < l; b++) { - const g = n[c++] ^ Xt(o, a, e, t, r, s), p = n[c++] ^ Xt(o, a, t, r, s, e), y = n[c++] ^ Xt(o, a, r, s, e, t), w = n[c++] ^ Xt(o, a, s, e, t, r); - e = g, t = p, r = y, s = w; - } - const d = n[c++] ^ gt(i, e, t, r, s), u = n[c++] ^ gt(i, t, r, s, e), f = n[c++] ^ gt(i, r, s, e, t), m = n[c++] ^ gt(i, s, e, t, r); - return { s0: d, s1: u, s2: f, s3: m }; -} -function Hu(n, e, t, r, s) { - const { sbox2: i, T01: o, T23: a } = Ua; - let c = 0; - e ^= n[c++], t ^= n[c++], r ^= n[c++], s ^= n[c++]; - const l = n.length / 4 - 2; - for (let b = 0; b < l; b++) { - const g = n[c++] ^ Xt(o, a, e, s, r, t), p = n[c++] ^ Xt(o, a, t, e, s, r), y = n[c++] ^ Xt(o, a, r, t, e, s), w = n[c++] ^ Xt(o, a, s, r, t, e); - e = g, t = p, r = y, s = w; - } - const d = n[c++] ^ gt(i, e, s, r, t), u = n[c++] ^ gt(i, t, e, s, r), f = n[c++] ^ gt(i, r, t, e, s), m = n[c++] ^ gt(i, s, r, t, e); - return { s0: d, s1: u, s2: f, s3: m }; -} -function Ma(n, e) { - if (!e) - return new Uint8Array(n); - if (Ct(e), e.length < n) - throw new Error(`aes: wrong destination length, expected at least ${n}, got: ${e.length}`); - return e; -} -function Mu(n) { - if (Ct(n), n.length % Qt !== 0) - throw new Error(`aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${Qt}`); -} -function ju(n, e, t) { - let r = n.length; - const s = r % Qt; - if (!e && s !== 0) - throw new Error("aec/(cbc-ecb): unpadded plaintext with disabled padding"); - const i = Te(n); - if (e) { - let c = Qt - s; - c || (c = Qt), r = r + c; - } - const o = Ma(r, t), a = Te(o); - return { b: i, o: a, out: o }; -} -function Pu(n, e) { - if (!e) - return n; - const t = n.length; - if (!t) - throw new Error("aes/pcks5: empty ciphertext not allowed"); - const r = n[t - 1]; - if (r <= 0 || r > 16) - throw new Error(`aes/pcks5: wrong padding byte: ${r}`); - const s = n.subarray(0, -r); - for (let i = 0; i < r; i++) - if (n[t - i - 1] !== r) - throw new Error("aes/pcks5: wrong padding"); - return s; -} -function Zu(n) { - const e = new Uint8Array(16), t = Te(e); - e.set(n); - const r = Qt - n.length; - for (let s = Qt - r; s < Qt; s++) - e[s] = r; - return t; -} -const ja = /* @__PURE__ */ Cu({ blockSize: 16, nonceLength: 16 }, function(e, t, r = {}) { - Ct(e), Ct(t, 16); - const s = !r.disablePadding; - return { - encrypt: (i, o) => { - const a = Ha(e), { b: c, o: l, out: d } = ju(i, s, o), u = Te(t); - let f = u[0], m = u[1], b = u[2], g = u[3], p = 0; - for (; p + 4 <= c.length; ) - f ^= c[p + 0], m ^= c[p + 1], b ^= c[p + 2], g ^= c[p + 3], { s0: f, s1: m, s2: b, s3: g } = Co(a, f, m, b, g), l[p++] = f, l[p++] = m, l[p++] = b, l[p++] = g; - if (s) { - const y = Zu(i.subarray(p * 4)); - f ^= y[0], m ^= y[1], b ^= y[2], g ^= y[3], { s0: f, s1: m, s2: b, s3: g } = Co(a, f, m, b, g), l[p++] = f, l[p++] = m, l[p++] = b, l[p++] = g; - } - return a.fill(0), d; - }, - decrypt: (i, o) => { - Mu(i); - const a = Uu(e), c = Te(t), l = Ma(i.length, o), d = Te(i), u = Te(l); - let f = c[0], m = c[1], b = c[2], g = c[3]; - for (let p = 0; p + 4 <= d.length; ) { - const y = f, w = m, x = b, A = g; - f = d[p + 0], m = d[p + 1], b = d[p + 2], g = d[p + 3]; - const { s0: T, s1: _, s2: S, s3: k } = Hu(a, f, m, b, g); - u[p++] = T ^ y, u[p++] = _ ^ w, u[p++] = S ^ x, u[p++] = k ^ A; - } - return a.fill(0), Pu(l, s); - } - }; -}), Pa = (n) => Uint8Array.from(n.split("").map((e) => e.charCodeAt(0))), zu = Pa("expand 16-byte k"), Du = Pa("expand 32-byte k"), qu = Te(zu), Za = Te(Du); -Za.slice(); -function se(n, e) { - return n << e | n >>> 32 - e; -} -function hi(n) { - return n.byteOffset % 4 === 0; -} -const Hr = 64, Vu = 16, za = 2 ** 32 - 1, $o = new Uint32Array(); -function Ku(n, e, t, r, s, i, o, a) { - const c = s.length, l = new Uint8Array(Hr), d = Te(l), u = hi(s) && hi(i), f = u ? Te(s) : $o, m = u ? Te(i) : $o; - for (let b = 0; b < c; o++) { - if (n(e, t, r, d, o, a), o >= za) - throw new Error("arx: counter overflow"); - const g = Math.min(Hr, c - b); - if (u && g === Hr) { - const p = b / 4; - if (b % 4 !== 0) - throw new Error("arx: invalid block position"); - for (let y = 0, w; y < Vu; y++) - w = p + y, m[w] = f[w] ^ d[y]; - b += Hr; - continue; - } - for (let p = 0, y; p < g; p++) - y = b + p, i[y] = s[y] ^ l[p]; - b += g; - } -} -function Wu(n, e) { - const { allowShortKeys: t, extendNonceFn: r, counterLength: s, counterRight: i, rounds: o } = Ou({ allowShortKeys: !1, counterLength: 8, counterRight: !1, rounds: 20 }, e); - if (typeof n != "function") - throw new Error("core must be a function"); - return Us(s), Us(o), Io(i), Io(t), (a, c, l, d, u = 0) => { - Ct(a), Ct(c), Ct(l); - const f = l.length; - if (d || (d = new Uint8Array(f)), Ct(d), Us(u), u < 0 || u >= za) - throw new Error("arx: counter overflow"); - if (d.length < f) - throw new Error(`arx: output (${d.length}) is shorter than data (${f})`); - const m = []; - let b = a.length, g, p; - if (b === 32) - g = a.slice(), m.push(g), p = Za; - else if (b === 16 && t) - g = new Uint8Array(32), g.set(a), g.set(a, 16), p = qu, m.push(g); - else - throw new Error(`arx: invalid 32-byte key, got length=${b}`); - hi(c) || (c = c.slice(), m.push(c)); - const y = Te(g); - if (r) { - if (c.length !== 24) - throw new Error("arx: extended nonce must be 24 bytes"); - r(p, y, Te(c.subarray(0, 16)), y), c = c.subarray(16); - } - const w = 16 - s; - if (w !== c.length) - throw new Error(`arx: nonce must be ${w} or 16 bytes`); - if (w !== 12) { - const A = new Uint8Array(12); - A.set(c, i ? 0 : 12 - c.length), c = A, m.push(c); - } - const x = Te(c); - for (Ku(n, p, y, x, l, d, u, o); m.length > 0; ) - m.pop().fill(0); - return d; - }; -} -function Fu(n, e, t, r, s, i = 20) { - let o = n[0], a = n[1], c = n[2], l = n[3], d = e[0], u = e[1], f = e[2], m = e[3], b = e[4], g = e[5], p = e[6], y = e[7], w = s, x = t[0], A = t[1], T = t[2], _ = o, S = a, k = c, N = l, z = d, L = u, P = f, F = m, I = b, v = g, E = p, C = y, j = w, Z = x, W = A, Y = T; - for (let ce = 0; ce < i; ce += 2) - _ = _ + z | 0, j = se(j ^ _, 16), I = I + j | 0, z = se(z ^ I, 12), _ = _ + z | 0, j = se(j ^ _, 8), I = I + j | 0, z = se(z ^ I, 7), S = S + L | 0, Z = se(Z ^ S, 16), v = v + Z | 0, L = se(L ^ v, 12), S = S + L | 0, Z = se(Z ^ S, 8), v = v + Z | 0, L = se(L ^ v, 7), k = k + P | 0, W = se(W ^ k, 16), E = E + W | 0, P = se(P ^ E, 12), k = k + P | 0, W = se(W ^ k, 8), E = E + W | 0, P = se(P ^ E, 7), N = N + F | 0, Y = se(Y ^ N, 16), C = C + Y | 0, F = se(F ^ C, 12), N = N + F | 0, Y = se(Y ^ N, 8), C = C + Y | 0, F = se(F ^ C, 7), _ = _ + L | 0, Y = se(Y ^ _, 16), E = E + Y | 0, L = se(L ^ E, 12), _ = _ + L | 0, Y = se(Y ^ _, 8), E = E + Y | 0, L = se(L ^ E, 7), S = S + P | 0, j = se(j ^ S, 16), C = C + j | 0, P = se(P ^ C, 12), S = S + P | 0, j = se(j ^ S, 8), C = C + j | 0, P = se(P ^ C, 7), k = k + F | 0, Z = se(Z ^ k, 16), I = I + Z | 0, F = se(F ^ I, 12), k = k + F | 0, Z = se(Z ^ k, 8), I = I + Z | 0, F = se(F ^ I, 7), N = N + z | 0, W = se(W ^ N, 16), v = v + W | 0, z = se(z ^ v, 12), N = N + z | 0, W = se(W ^ N, 8), v = v + W | 0, z = se(z ^ v, 7); - let te = 0; - r[te++] = o + _ | 0, r[te++] = a + S | 0, r[te++] = c + k | 0, r[te++] = l + N | 0, r[te++] = d + z | 0, r[te++] = u + L | 0, r[te++] = f + P | 0, r[te++] = m + F | 0, r[te++] = b + I | 0, r[te++] = g + v | 0, r[te++] = p + E | 0, r[te++] = y + C | 0, r[te++] = w + j | 0, r[te++] = x + Z | 0, r[te++] = A + W | 0, r[te++] = T + Y | 0; -} -const Da = /* @__PURE__ */ Wu(Fu, { - counterRight: !1, - counterLength: 4, - allowShortKeys: !1 -}); -let qa = class extends Ta { - constructor(e, t) { - super(), this.finished = !1, this.destroyed = !1, pt.hash(e); - const r = cr(t); - if (this.iHash = e.create(), typeof this.iHash.update != "function") - throw new Error("Expected instance of class which extends utils.Hash"); - this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen; - const s = this.blockLen, i = new Uint8Array(s); - i.set(r.length > s ? e.create().update(r).digest() : r); - for (let o = 0; o < i.length; o++) - i[o] ^= 54; - this.iHash.update(i), this.oHash = e.create(); - for (let o = 0; o < i.length; o++) - i[o] ^= 106; - this.oHash.update(i), i.fill(0); - } - update(e) { - return pt.exists(this), this.iHash.update(e), this; - } - digestInto(e) { - pt.exists(this), pt.bytes(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy(); - } - digest() { - const e = new Uint8Array(this.oHash.outputLen); - return this.digestInto(e), e; - } - _cloneInto(e) { - e || (e = Object.create(Object.getPrototypeOf(this), {})); - const { oHash: t, iHash: r, finished: s, destroyed: i, blockLen: o, outputLen: a } = this; - return e = e, e.finished = s, e.destroyed = i, e.blockLen = o, e.outputLen = a, e.oHash = t._cloneInto(e.oHash), e.iHash = r._cloneInto(e.iHash), e; - } - destroy() { - this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy(); - } -}; -const ms = (n, e, t) => new qa(n, e).update(t).digest(); -ms.create = (n, e) => new qa(n, e); -function Gu(n, e, t) { - return pt.hash(n), ms(n, cr(t), cr(e)); -} -const Ms = new Uint8Array([0]), Ro = new Uint8Array(); -function Yu(n, e, t, r = 32) { - if (pt.hash(n), pt.number(r), r > 255 * n.outputLen) - throw new Error("Length should be <= 255*HashLen"); - const s = Math.ceil(r / n.outputLen); - t === void 0 && (t = Ro); - const i = new Uint8Array(s * n.outputLen), o = ms.create(n, e), a = o._cloneInto(), c = new Uint8Array(o.outputLen); - for (let l = 0; l < s; l++) - Ms[0] = l + 1, a.update(l === 0 ? Ro : c).update(t).update(Ms).digestInto(c), i.set(c, n.outputLen * l), o._cloneInto(a); - return o.destroy(), a.destroy(), c.fill(0), Ms.fill(0), i.slice(0, r); -} -var Ju = Object.defineProperty, he = (n, e) => { - for (var t in e) - Ju(n, t, { get: e[t], enumerable: !0 }); -}, Sn = Symbol("verified"), Xu = (n) => n instanceof Object; -function Va(n) { - if (!Xu(n) || typeof n.kind != "number" || typeof n.content != "string" || typeof n.created_at != "number" || typeof n.pubkey != "string" || !n.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(n.tags)) - return !1; - for (let e = 0; e < n.tags.length; e++) { - let t = n.tags[e]; - if (!Array.isArray(t)) - return !1; - for (let r = 0; r < t.length; r++) - if (typeof t[r] == "object") - return !1; - } - return !0; -} -var Qu = {}; -he(Qu, { - Queue: () => rd, - QueueNode: () => Ka, - binarySearch: () => Pi, - insertEventIntoAscendingList: () => nd, - insertEventIntoDescendingList: () => td, - normalizeURL: () => ed, - utf8Decoder: () => ht, - utf8Encoder: () => st -}); -var ht = new TextDecoder("utf-8"), st = new TextEncoder(); -function ed(n) { - n.indexOf("://") === -1 && (n = "wss://" + n); - let e = new URL(n); - return e.pathname = e.pathname.replace(/\/+/g, "/"), e.pathname.endsWith("/") && (e.pathname = e.pathname.slice(0, -1)), (e.port === "80" && e.protocol === "ws:" || e.port === "443" && e.protocol === "wss:") && (e.port = ""), e.searchParams.sort(), e.hash = "", e.toString(); -} -function td(n, e) { - const [t, r] = Pi(n, (s) => e.id === s.id ? 0 : e.created_at === s.created_at ? -1 : s.created_at - e.created_at); - return r || n.splice(t, 0, e), n; -} -function nd(n, e) { - const [t, r] = Pi(n, (s) => e.id === s.id ? 0 : e.created_at === s.created_at ? -1 : e.created_at - s.created_at); - return r || n.splice(t, 0, e), n; -} -function Pi(n, e) { - let t = 0, r = n.length - 1; - for (; t <= r; ) { - const s = Math.floor((t + r) / 2), i = e(n[s]); - if (i === 0) - return [s, !0]; - i < 0 ? r = s - 1 : t = s + 1; - } - return [t, !1]; -} -var Ka = class { - constructor(e) { - B(this, "value"); - B(this, "next", null); - B(this, "prev", null); - this.value = e; - } -}, rd = class { - constructor() { - B(this, "first"); - B(this, "last"); - this.first = null, this.last = null; - } - enqueue(e) { - const t = new Ka(e); - return this.last ? this.last === this.first ? (this.last = t, this.last.prev = this.first, this.first.next = t) : (t.prev = this.last, this.last.next = t, this.last = t) : (this.first = t, this.last = t), !0; - } - dequeue() { - if (!this.first) - return null; - if (this.first === this.last) { - const t = this.first; - return this.first = null, this.last = null, t.value; - } - const e = this.first; - return this.first = e.next, e.value; - } -}, sd = class { - generateSecretKey() { - return dt.utils.randomPrivateKey(); - } - getPublicKey(e) { - return ve(dt.getPublicKey(e)); - } - finalizeEvent(e, t) { - const r = e; - return r.pubkey = ve(dt.getPublicKey(t)), r.id = Wr(r), r.sig = ve(dt.sign(Wr(r), t)), r[Sn] = !0, r; - } - verifyEvent(e) { - if (typeof e[Sn] == "boolean") - return e[Sn]; - const t = Wr(e); - if (t !== e.id) - return e[Sn] = !1, !1; - try { - const r = dt.verify(e.sig, t, e.pubkey); - return e[Sn] = r, r; - } catch { - return e[Sn] = !1, !1; - } - } -}; -function id(n) { - if (!Va(n)) - throw new Error("can't serialize event with wrong or missing properties"); - return JSON.stringify([0, n.pubkey, n.created_at, n.kind, n.tags, n.content]); -} -function Wr(n) { - let e = Yn(st.encode(id(n))); - return ve(e); -} -var ws = new sd(); -ws.generateSecretKey; -var od = ws.getPublicKey, Ht = ws.finalizeEvent, Xn = ws.verifyEvent, ad = {}; -he(ad, { - Application: () => ah, - BadgeAward: () => yd, - BadgeDefinition: () => eh, - BlockedRelaysList: () => jd, - BookmarkList: () => Ud, - Bookmarksets: () => Jd, - Calendar: () => ph, - CalendarEventRSVP: () => gh, - ChannelCreation: () => Ga, - ChannelHideMessage: () => Xa, - ChannelMessage: () => Ja, - ChannelMetadata: () => Ya, - ChannelMuteUser: () => Qa, - ClassifiedListing: () => uh, - ClientAuth: () => ec, - CommunitiesList: () => Hd, - CommunityDefinition: () => wh, - CommunityPostApproval: () => kd, - Contacts: () => hd, - CreateOrUpdateProduct: () => rh, - CreateOrUpdateStall: () => nh, - Curationsets: () => Xd, - Date: () => hh, - DraftClassifiedListing: () => dh, - DraftLong: () => ih, - Emojisets: () => oh, - EncryptedDirectMessage: () => fd, - EncryptedDirectMessages: () => pd, - EventDeletion: () => gd, - FileMetadata: () => bd, - FileServerPreference: () => Dd, - Followsets: () => Fd, - GenericRepost: () => md, - Genericlists: () => Gd, - HTTPAuth: () => Vi, - Handlerinformation: () => mh, - Handlerrecommendation: () => yh, - Highlights: () => $d, - InterestsList: () => Zd, - Interestsets: () => th, - JobFeedback: () => Bd, - JobRequest: () => Ad, - JobResult: () => Td, - Label: () => Sd, - LightningPubRPC: () => Vd, - LiveChatMessage: () => vd, - LiveEvent: () => ch, - LongFormArticle: () => sh, - Metadata: () => ld, - Mutelist: () => Rd, - NWCWalletInfo: () => qd, - NWCWalletRequest: () => tc, - NWCWalletResponse: () => Kd, - NostrConnect: () => Wd, - OpenTimestamps: () => wd, - Pinlist: () => Nd, - ProblemTracker: () => xd, - ProfileBadges: () => Qd, - PublicChatsList: () => Md, - Reaction: () => qi, - RecommendRelay: () => dd, - RelayList: () => Ld, - Relaysets: () => Yd, - Report: () => Ed, - Reporting: () => _d, - Repost: () => Di, - SearchRelaysList: () => Pd, - ShortTextNote: () => ud, - Time: () => fh, - UserEmojiList: () => zd, - UserStatuses: () => lh, - Zap: () => Cd, - ZapGoal: () => Od, - ZapRequest: () => Id, - classifyKind: () => cd, - isEphemeralKind: () => Fa, - isParameterizedReplaceableKind: () => zi, - isRegularKind: () => Wa, - isReplaceableKind: () => Zi -}); -function Wa(n) { - return 1e3 <= n && n < 1e4 || [1, 2, 4, 5, 6, 7, 8, 16, 40, 41, 42, 43, 44].includes(n); -} -function Zi(n) { - return [0, 3].includes(n) || 1e4 <= n && n < 2e4; -} -function Fa(n) { - return 2e4 <= n && n < 3e4; -} -function zi(n) { - return 3e4 <= n && n < 4e4; -} -function cd(n) { - return Wa(n) ? "regular" : Zi(n) ? "replaceable" : Fa(n) ? "ephemeral" : zi(n) ? "parameterized" : "unknown"; -} -var ld = 0, ud = 1, dd = 2, hd = 3, fd = 4, pd = 4, gd = 5, Di = 6, qi = 7, yd = 8, md = 16, Ga = 40, Ya = 41, Ja = 42, Xa = 43, Qa = 44, wd = 1040, bd = 1063, vd = 1311, xd = 1971, Ed = 1984, _d = 1984, Sd = 1985, kd = 4550, Ad = 5999, Td = 6999, Bd = 7e3, Od = 9041, Id = 9734, Cd = 9735, $d = 9802, Rd = 1e4, Nd = 10001, Ld = 10002, Ud = 10003, Hd = 10004, Md = 10005, jd = 10006, Pd = 10007, Zd = 10015, zd = 10030, Dd = 10096, qd = 13194, Vd = 21e3, ec = 22242, tc = 23194, Kd = 23195, Wd = 24133, Vi = 27235, Fd = 3e4, Gd = 30001, Yd = 30002, Jd = 30003, Xd = 30004, Qd = 30008, eh = 30009, th = 30015, nh = 30017, rh = 30018, sh = 30023, ih = 30024, oh = 30030, ah = 30078, ch = 30311, lh = 30315, uh = 30402, dh = 30403, hh = 31922, fh = 31923, ph = 31924, gh = 31925, yh = 31989, mh = 31990, wh = 34550; -function bh(n, e) { - if (n.ids && n.ids.indexOf(e.id) === -1 || n.kinds && n.kinds.indexOf(e.kind) === -1 || n.authors && n.authors.indexOf(e.pubkey) === -1) - return !1; - for (let t in n) - if (t[0] === "#") { - let r = t.slice(1), s = n[`#${r}`]; - if (s && !e.tags.find(([i, o]) => i === t.slice(1) && s.indexOf(o) !== -1)) - return !1; - } - return !(n.since && e.created_at < n.since || n.until && e.created_at > n.until); -} -function fi(n, e) { - for (let t = 0; t < n.length; t++) - if (bh(n[t], e)) - return !0; - return !1; -} -function nc(n) { - var e, t, r, s, i, o; - if (n.ids && !n.ids.length || n.kinds && !n.kinds.length || n.authors && !n.authors.length) - return 0; - for (const [a, c] of Object.entries(n)) - if (a[0] === "#" && Array.isArray(c) && !c.length) - return 0; - return Math.min( - Math.max(0, n.limit ?? 1 / 0), - ((e = n.ids) == null ? void 0 : e.length) ?? 1 / 0, - (t = n.authors) != null && t.length && ((r = n.kinds) != null && r.every((a) => Zi(a))) ? n.authors.length * n.kinds.length : 1 / 0, - (s = n.authors) != null && s.length && ((i = n.kinds) != null && i.every((a) => zi(a))) && ((o = n["#d"]) != null && o.length) ? n.authors.length * n.kinds.length * n["#d"].length : 1 / 0 - ); -} -var vh = {}; -he(vh, { - getHex64: () => Ki, - getInt: () => rc, - getSubscriptionId: () => xh, - matchEventId: () => Eh, - matchEventKind: () => Sh, - matchEventPubkey: () => _h -}); -function Ki(n, e) { - let t = e.length + 3, r = n.indexOf(`"${e}":`) + t, s = n.slice(r).indexOf('"') + r + 1; - return n.slice(s, s + 64); -} -function rc(n, e) { - let t = e.length, r = n.indexOf(`"${e}":`) + t + 3, s = n.slice(r), i = Math.min(s.indexOf(","), s.indexOf("}")); - return parseInt(s.slice(0, i), 10); -} -function xh(n) { - let e = n.slice(0, 22).indexOf('"EVENT"'); - if (e === -1) - return null; - let t = n.slice(e + 7 + 1).indexOf('"'); - if (t === -1) - return null; - let r = e + 7 + 1 + t, s = n.slice(r + 1, 80).indexOf('"'); - if (s === -1) - return null; - let i = r + 1 + s; - return n.slice(r + 1, i); -} -function Eh(n, e) { - return e === Ki(n, "id"); -} -function _h(n, e) { - return e === Ki(n, "pubkey"); -} -function Sh(n, e) { - return e === rc(n, "kind"); -} -var kh = {}; -he(kh, { - makeAuthEvent: () => Ah -}); -function Ah(n, e) { - return { - kind: ec, - created_at: Math.floor(Date.now() / 1e3), - tags: [ - ["relay", n], - ["challenge", e] - ], - content: "" - }; -} -var Th; -try { - Th = WebSocket; -} catch { -} -var Bh; -try { - Bh = WebSocket; -} catch { -} -var Oh = {}; -he(Oh, { - BECH32_REGEX: () => sc, - Bech32MaxSize: () => Wi, - decode: () => bs, - encodeBytes: () => vs, - naddrEncode: () => Uh, - neventEncode: () => Lh, - noteEncode: () => Rh, - nprofileEncode: () => Nh, - npubEncode: () => $h, - nrelayEncode: () => Hh, - nsecEncode: () => Ch -}); -var Wi = 5e3, sc = /[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/; -function Ih(n) { - const e = new Uint8Array(4); - return e[0] = n >> 24 & 255, e[1] = n >> 16 & 255, e[2] = n >> 8 & 255, e[3] = n & 255, e; -} -function bs(n) { - var s, i, o, a, c, l, d, u; - let { prefix: e, words: t } = Pn.decode(n, Wi), r = new Uint8Array(Pn.fromWords(t)); - switch (e) { - case "nprofile": { - let f = Mr(r); - if (!((s = f[0]) != null && s[0])) - throw new Error("missing TLV 0 for nprofile"); - if (f[0][0].length !== 32) - throw new Error("TLV 0 should be 32 bytes"); - return { - type: "nprofile", - data: { - pubkey: ve(f[0][0]), - relays: f[1] ? f[1].map((m) => ht.decode(m)) : [] - } - }; - } - case "nevent": { - let f = Mr(r); - if (!((i = f[0]) != null && i[0])) - throw new Error("missing TLV 0 for nevent"); - if (f[0][0].length !== 32) - throw new Error("TLV 0 should be 32 bytes"); - if (f[2] && f[2][0].length !== 32) - throw new Error("TLV 2 should be 32 bytes"); - if (f[3] && f[3][0].length !== 4) - throw new Error("TLV 3 should be 4 bytes"); - return { - type: "nevent", - data: { - id: ve(f[0][0]), - relays: f[1] ? f[1].map((m) => ht.decode(m)) : [], - author: (o = f[2]) != null && o[0] ? ve(f[2][0]) : void 0, - kind: (a = f[3]) != null && a[0] ? parseInt(ve(f[3][0]), 16) : void 0 - } - }; - } - case "naddr": { - let f = Mr(r); - if (!((c = f[0]) != null && c[0])) - throw new Error("missing TLV 0 for naddr"); - if (!((l = f[2]) != null && l[0])) - throw new Error("missing TLV 2 for naddr"); - if (f[2][0].length !== 32) - throw new Error("TLV 2 should be 32 bytes"); - if (!((d = f[3]) != null && d[0])) - throw new Error("missing TLV 3 for naddr"); - if (f[3][0].length !== 4) - throw new Error("TLV 3 should be 4 bytes"); - return { - type: "naddr", - data: { - identifier: ht.decode(f[0][0]), - pubkey: ve(f[2][0]), - kind: parseInt(ve(f[3][0]), 16), - relays: f[1] ? f[1].map((m) => ht.decode(m)) : [] - } - }; - } - case "nrelay": { - let f = Mr(r); - if (!((u = f[0]) != null && u[0])) - throw new Error("missing TLV 0 for nrelay"); - return { - type: "nrelay", - data: ht.decode(f[0][0]) - }; - } - case "nsec": - return { type: e, data: r }; - case "npub": - case "note": - return { type: e, data: ve(r) }; - default: - throw new Error(`unknown prefix ${e}`); - } -} -function Mr(n) { - let e = {}, t = n; - for (; t.length > 0; ) { - let r = t[0], s = t[1], i = t.slice(2, 2 + s); - if (t = t.slice(2 + s), i.length < s) - throw new Error(`not enough data to read on TLV ${r}`); - e[r] = e[r] || [], e[r].push(i); - } - return e; -} -function Ch(n) { - return vs("nsec", n); -} -function $h(n) { - return vs("npub", jn(n)); -} -function Rh(n) { - return vs("note", jn(n)); -} -function $r(n, e) { - let t = Pn.toWords(e); - return Pn.encode(n, t, Wi); -} -function vs(n, e) { - return $r(n, e); -} -function Nh(n) { - let e = xs({ - 0: [jn(n.pubkey)], - 1: (n.relays || []).map((t) => st.encode(t)) - }); - return $r("nprofile", e); -} -function Lh(n) { - let e; - n.kind !== void 0 && (e = Ih(n.kind)); - let t = xs({ - 0: [jn(n.id)], - 1: (n.relays || []).map((r) => st.encode(r)), - 2: n.author ? [jn(n.author)] : [], - 3: e ? [new Uint8Array(e)] : [] - }); - return $r("nevent", t); -} -function Uh(n) { - let e = new ArrayBuffer(4); - new DataView(e).setUint32(0, n.kind, !1); - let t = xs({ - 0: [st.encode(n.identifier)], - 1: (n.relays || []).map((r) => st.encode(r)), - 2: [jn(n.pubkey)], - 3: [new Uint8Array(e)] - }); - return $r("naddr", t); -} -function Hh(n) { - let e = xs({ - 0: [st.encode(n)] - }); - return $r("nrelay", e); -} -function xs(n) { - let e = []; - return Object.entries(n).reverse().forEach(([t, r]) => { - r.forEach((s) => { - let i = new Uint8Array(s.length + 2); - i.set([parseInt(t)], 0), i.set([s.length], 1), i.set(s, 2), e.push(i); - }); - }), gs(...e); -} -var pi = {}; -he(pi, { - decrypt: () => Mh, - encrypt: () => ic -}); -async function ic(n, e, t) { - const r = n instanceof Uint8Array ? ve(n) : n, s = Gn.getSharedSecret(r, "02" + e), i = oc(s); - let o = Uint8Array.from(Oa(16)), a = st.encode(t), c = ja(i, o).encrypt(a), l = $t.encode(new Uint8Array(c)), d = $t.encode(new Uint8Array(o.buffer)); - return `${l}?iv=${d}`; -} -async function Mh(n, e, t) { - const r = n instanceof Uint8Array ? ve(n) : n; - let [s, i] = t.split("?iv="), o = Gn.getSharedSecret(r, "02" + e), a = oc(o), c = $t.decode(i), l = $t.decode(s), d = ja(a, c).decrypt(l); - return ht.decode(d); -} -function oc(n) { - return n.slice(1, 33); -} -var jh = {}; -he(jh, { - NIP05_REGEX: () => ac, - isValid: () => zh, - queryProfile: () => cc, - searchDomain: () => Zh, - useFetchImplementation: () => Ph -}); -var ac = /^(?:([\w.+-]+)@)?([\w_-]+(\.[\w_-]+)+)$/, Es; -try { - Es = fetch; -} catch { -} -function Ph(n) { - Es = n; -} -async function Zh(n, e = "") { - try { - const t = `https://${n}/.well-known/nostr.json?name=${e}`; - return (await (await Es(t, { redirect: "error" })).json()).names; - } catch { - return {}; - } -} -async function cc(n) { - var i; - const e = n.match(ac); - if (!e) - return null; - const [t, r = "_", s] = e; - try { - const o = `https://${s}/.well-known/nostr.json?name=${r}`, a = await (await Es(o, { redirect: "error" })).json(); - let c = a.names[r]; - return c ? { pubkey: c, relays: (i = a.relays) == null ? void 0 : i[c] } : null; - } catch { - return null; - } -} -async function zh(n, e) { - let t = await cc(e); - return t ? t.pubkey === n : !1; -} -var Dh = {}; -he(Dh, { - parse: () => qh -}); -function qh(n) { - const e = { - reply: void 0, - root: void 0, - mentions: [], - profiles: [] - }, t = []; - for (const r of n.tags) - r[0] === "e" && r[1] && t.push(r), r[0] === "p" && r[1] && e.profiles.push({ - pubkey: r[1], - relays: r[2] ? [r[2]] : [] - }); - for (let r = 0; r < t.length; r++) { - const s = t[r], [i, o, a, c] = s, l = { - id: o, - relays: a ? [a] : [] - }, d = r === 0, u = r === t.length - 1; - if (c === "root") { - e.root = l; - continue; - } - if (c === "reply") { - e.reply = l; - continue; - } - if (c === "mention") { - e.mentions.push(l); - continue; - } - if (d) { - e.root = l; - continue; - } - if (u) { - e.reply = l; - continue; - } - e.mentions.push(l); - } - return e; -} -var Vh = {}; -he(Vh, { - fetchRelayInformation: () => Wh, - useFetchImplementation: () => Kh -}); -var lc; -try { - lc = fetch; -} catch { -} -function Kh(n) { - lc = n; -} -async function Wh(n) { - return await (await fetch(n.replace("ws://", "http://").replace("wss://", "https://"), { - headers: { Accept: "application/nostr+json" } - })).json(); -} -var Fh = {}; -he(Fh, { - getPow: () => uc, - minePow: () => Gh -}); -function uc(n) { - let e = 0; - for (let t = 0; t < n.length; t++) { - const r = parseInt(n[t], 16); - if (r === 0) - e += 4; - else { - e += Math.clz32(r) - 28; - break; - } - } - return e; -} -function Gh(n, e) { - let t = 0; - const r = n, s = ["nonce", t.toString(), e.toString()]; - for (r.tags.push(s); ; ) { - const i = Math.floor((/* @__PURE__ */ new Date()).getTime() / 1e3); - if (i !== r.created_at && (t = 0, r.created_at = i), s[1] = (++t).toString(), r.id = Wr(r), uc(r.id) >= e) - break; - } - return r; -} -var Yh = {}; -he(Yh, { - finishRepostEvent: () => Jh, - getRepostedEvent: () => Xh, - getRepostedEventPointer: () => dc -}); -function Jh(n, e, t, r) { - return Ht( - { - kind: Di, - tags: [...n.tags ?? [], ["e", e.id, t], ["p", e.pubkey]], - content: n.content === "" ? "" : JSON.stringify(e), - created_at: n.created_at - }, - r - ); -} -function dc(n) { - if (n.kind !== Di) - return; - let e, t; - for (let r = n.tags.length - 1; r >= 0 && (e === void 0 || t === void 0); r--) { - const s = n.tags[r]; - s.length >= 2 && (s[0] === "e" && e === void 0 ? e = s : s[0] === "p" && t === void 0 && (t = s)); - } - if (e !== void 0) - return { - id: e[1], - relays: [e[2], t == null ? void 0 : t[2]].filter((r) => typeof r == "string"), - author: t == null ? void 0 : t[1] - }; -} -function Xh(n, { skipVerification: e } = {}) { - const t = dc(n); - if (t === void 0 || n.content === "") - return; - let r; - try { - r = JSON.parse(n.content); - } catch { - return; - } - if (r.id === t.id && !(!e && !Xn(r))) - return r; -} -var Qh = {}; -he(Qh, { - NOSTR_URI_REGEX: () => _s, - parse: () => tf, - test: () => ef -}); -var _s = new RegExp(`nostr:(${sc.source})`); -function ef(n) { - return typeof n == "string" && new RegExp(`^${_s.source}$`).test(n); -} -function tf(n) { - const e = n.match(new RegExp(`^${_s.source}$`)); - if (!e) - throw new Error(`Invalid Nostr URI: ${n}`); - return { - uri: e[0], - value: e[1], - decoded: bs(e[1]) - }; -} -var nf = {}; -he(nf, { - finishReactionEvent: () => rf, - getReactedEventPointer: () => sf -}); -function rf(n, e, t) { - const r = e.tags.filter((s) => s.length >= 2 && (s[0] === "e" || s[0] === "p")); - return Ht( - { - ...n, - kind: qi, - tags: [...n.tags ?? [], ...r, ["e", e.id], ["p", e.pubkey]], - content: n.content ?? "+" - }, - t - ); -} -function sf(n) { - if (n.kind !== qi) - return; - let e, t; - for (let r = n.tags.length - 1; r >= 0 && (e === void 0 || t === void 0); r--) { - const s = n.tags[r]; - s.length >= 2 && (s[0] === "e" && e === void 0 ? e = s : s[0] === "p" && t === void 0 && (t = s)); - } - if (!(e === void 0 || t === void 0)) - return { - id: e[1], - relays: [e[2], t[2]].filter((r) => r !== void 0), - author: t[1] - }; -} -var of = {}; -he(of, { - matchAll: () => af, - regex: () => Fi, - replaceAll: () => cf -}); -var Fi = () => new RegExp(`\\b${_s.source}\\b`, "g"); -function* af(n) { - const e = n.matchAll(Fi()); - for (const t of e) - try { - const [r, s] = t; - yield { - uri: r, - value: s, - decoded: bs(s), - start: t.index, - end: t.index + r.length - }; - } catch { - } -} -function cf(n, e) { - return n.replaceAll(Fi(), (t, r) => e({ - uri: t, - value: r, - decoded: bs(r) - })); -} -var lf = {}; -he(lf, { - channelCreateEvent: () => uf, - channelHideMessageEvent: () => ff, - channelMessageEvent: () => hf, - channelMetadataEvent: () => df, - channelMuteUserEvent: () => pf -}); -var uf = (n, e) => { - let t; - if (typeof n.content == "object") - t = JSON.stringify(n.content); - else if (typeof n.content == "string") - t = n.content; - else - return; - return Ht( - { - kind: Ga, - tags: [...n.tags ?? []], - content: t, - created_at: n.created_at - }, - e - ); -}, df = (n, e) => { - let t; - if (typeof n.content == "object") - t = JSON.stringify(n.content); - else if (typeof n.content == "string") - t = n.content; - else - return; - return Ht( - { - kind: Ya, - tags: [["e", n.channel_create_event_id], ...n.tags ?? []], - content: t, - created_at: n.created_at - }, - e - ); -}, hf = (n, e) => { - const t = [["e", n.channel_create_event_id, n.relay_url, "root"]]; - return n.reply_to_channel_message_event_id && t.push(["e", n.reply_to_channel_message_event_id, n.relay_url, "reply"]), Ht( - { - kind: Ja, - tags: [...t, ...n.tags ?? []], - content: n.content, - created_at: n.created_at - }, - e - ); -}, ff = (n, e) => { - let t; - if (typeof n.content == "object") - t = JSON.stringify(n.content); - else if (typeof n.content == "string") - t = n.content; - else - return; - return Ht( - { - kind: Xa, - tags: [["e", n.channel_message_event_id], ...n.tags ?? []], - content: t, - created_at: n.created_at - }, - e - ); -}, pf = (n, e) => { - let t; - if (typeof n.content == "object") - t = JSON.stringify(n.content); - else if (typeof n.content == "string") - t = n.content; - else - return; - return Ht( - { - kind: Qa, - tags: [["p", n.pubkey_to_mute], ...n.tags ?? []], - content: t, - created_at: n.created_at - }, - e - ); -}, gf = {}; -he(gf, { - EMOJI_SHORTCODE_REGEX: () => hc, - matchAll: () => yf, - regex: () => Gi, - replaceAll: () => mf -}); -var hc = /:(\w+):/, Gi = () => new RegExp(`\\B${hc.source}\\B`, "g"); -function* yf(n) { - const e = n.matchAll(Gi()); - for (const t of e) - try { - const [r, s] = t; - yield { - shortcode: r, - name: s, - start: t.index, - end: t.index + r.length - }; - } catch { - } -} -function mf(n, e) { - return n.replaceAll(Gi(), (t, r) => e({ - shortcode: t, - name: r - })); -} -var wf = {}; -he(wf, { - useFetchImplementation: () => bf, - validateGithub: () => vf -}); -var Yi; -try { - Yi = fetch; -} catch { -} -function bf(n) { - Yi = n; -} -async function vf(n, e, t) { - try { - return await (await Yi(`https://gist.github.com/${e}/${t}/raw`)).text() === `Verifying that I control the following Nostr public key: ${n}`; - } catch { - return !1; - } -} -var Fr = {}; -he(Fr, { - decrypt: () => bc, - encrypt: () => wc, - getConversationKey: () => gc, - v2: () => kf -}); -var fc = 1, pc = 65535; -function gc(n, e) { - const t = Gn.getSharedSecret(n, "02" + e).subarray(1, 33); - return Gu(Yn, t, "nip44-v2"); -} -function yc(n, e) { - const t = Yu(Yn, n, e, 76); - return { - chacha_key: t.subarray(0, 32), - chacha_nonce: t.subarray(32, 44), - hmac_key: t.subarray(44, 76) - }; -} -function Ji(n) { - if (!Number.isSafeInteger(n) || n < 1) - throw new Error("expected positive integer"); - if (n <= 32) - return 32; - const e = 1 << Math.floor(Math.log2(n - 1)) + 1, t = e <= 256 ? 32 : e / 8; - return t * (Math.floor((n - 1) / t) + 1); -} -function xf(n) { - if (!Number.isSafeInteger(n) || n < fc || n > pc) - throw new Error("invalid plaintext size: must be between 1 and 65535 bytes"); - const e = new Uint8Array(2); - return new DataView(e.buffer).setUint16(0, n, !1), e; -} -function Ef(n) { - const e = st.encode(n), t = e.length, r = xf(t), s = new Uint8Array(Ji(t) - t); - return gs(r, e, s); -} -function _f(n) { - const e = new DataView(n.buffer).getUint16(0), t = n.subarray(2, 2 + e); - if (e < fc || e > pc || t.length !== e || n.length !== 2 + Ji(e)) - throw new Error("invalid padding"); - return ht.decode(t); -} -function mc(n, e, t) { - if (t.length !== 32) - throw new Error("AAD associated data must be 32 bytes"); - const r = gs(t, e); - return ms(Yn, n, r); -} -function Sf(n) { - if (typeof n != "string") - throw new Error("payload must be a valid string"); - const e = n.length; - if (e < 132 || e > 87472) - throw new Error("invalid payload length: " + e); - if (n[0] === "#") - throw new Error("unknown encryption version"); - let t; - try { - t = $t.decode(n); - } catch (i) { - throw new Error("invalid base64: " + i.message); - } - const r = t.length; - if (r < 99 || r > 65603) - throw new Error("invalid data length: " + r); - const s = t[0]; - if (s !== 2) - throw new Error("unknown encryption version " + s); - return { - nonce: t.subarray(1, 33), - ciphertext: t.subarray(33, -32), - mac: t.subarray(-32) - }; -} -function wc(n, e, t = Oa(32)) { - const { chacha_key: r, chacha_nonce: s, hmac_key: i } = yc(e, t), o = Ef(n), a = Da(r, s, o), c = mc(i, a, t); - return $t.encode(gs(new Uint8Array([2]), t, a, c)); -} -function bc(n, e) { - const { nonce: t, ciphertext: r, mac: s } = Sf(n), { chacha_key: i, chacha_nonce: o, hmac_key: a } = yc(e, t), c = mc(a, r, t); - if (!Iu(c, s)) - throw new Error("invalid MAC"); - const l = Da(i, o, r); - return _f(l); -} -var kf = { - utils: { - getConversationKey: gc, - calcPaddedLen: Ji - }, - encrypt: wc, - decrypt: bc -}, Af = {}; -he(Af, { - makeNwcRequestEvent: () => Bf, - parseConnectionString: () => Tf -}); -function Tf(n) { - const { pathname: e, searchParams: t } = new URL(n), r = e, s = t.get("relay"), i = t.get("secret"); - if (!r || !s || !i) - throw new Error("invalid connection string"); - return { pubkey: r, relay: s, secret: i }; -} -async function Bf(n, e, t) { - const s = await ic(e, n, JSON.stringify({ - method: "pay_invoice", - params: { - invoice: t - } - })), i = { - kind: tc, - created_at: Math.round(Date.now() / 1e3), - content: s, - tags: [["p", n]] - }; - return Ht(i, e); -} -var Of = {}; -he(Of, { - getZapEndpoint: () => Cf, - makeZapReceipt: () => Nf, - makeZapRequest: () => $f, - useFetchImplementation: () => If, - validateZapRequest: () => Rf -}); -var Xi; -try { - Xi = fetch; -} catch { -} -function If(n) { - Xi = n; -} -async function Cf(n) { - try { - let e = "", { lud06: t, lud16: r } = JSON.parse(n.content); - if (t) { - let { words: o } = Pn.decode(t, 1e3), a = Pn.fromWords(o); - e = ht.decode(a); - } else if (r) { - let [o, a] = r.split("@"); - e = new URL(`/.well-known/lnurlp/${o}`, `https://${a}`).toString(); - } else - return null; - let i = await (await Xi(e)).json(); - if (i.allowsNostr && i.nostrPubkey) - return i.callback; - } catch { - } - return null; -} -function $f({ - profile: n, - event: e, - amount: t, - relays: r, - comment: s = "" -}) { - if (!t) - throw new Error("amount not given"); - if (!n) - throw new Error("profile not given"); - let i = { - kind: 9734, - created_at: Math.round(Date.now() / 1e3), - content: s, - tags: [ - ["p", n], - ["amount", t.toString()], - ["relays", ...r] - ] - }; - return e && i.tags.push(["e", e]), i; -} -function Rf(n) { - let e; - try { - e = JSON.parse(n); - } catch { - return "Invalid zap request JSON."; - } - if (!Va(e)) - return "Zap request is not a valid Nostr event."; - if (!Xn(e)) - return "Invalid signature on zap request."; - let t = e.tags.find(([i, o]) => i === "p" && o); - if (!t) - return "Zap request doesn't have a 'p' tag."; - if (!t[1].match(/^[a-f0-9]{64}$/)) - return "Zap request 'p' tag is not valid hex."; - let r = e.tags.find(([i, o]) => i === "e" && o); - return r && !r[1].match(/^[a-f0-9]{64}$/) ? "Zap request 'e' tag is not valid hex." : e.tags.find(([i, o]) => i === "relays" && o) ? null : "Zap request doesn't have a 'relays' tag."; -} -function Nf({ - zapRequest: n, - preimage: e, - bolt11: t, - paidAt: r -}) { - let s = JSON.parse(n), i = s.tags.filter(([a]) => a === "e" || a === "p" || a === "a"), o = { - kind: 9735, - created_at: Math.round(r.getTime() / 1e3), - content: "", - tags: [...i, ["P", s.pubkey], ["bolt11", t], ["description", n]] - }; - return e && o.tags.push(["preimage", e]), o; -} -var Lf = {}; -he(Lf, { - getToken: () => Uf, - hashPayload: () => Qi, - unpackEventFromToken: () => xc, - validateEvent: () => Tc, - validateEventKind: () => _c, - validateEventMethodTag: () => kc, - validateEventPayloadTag: () => Ac, - validateEventTimestamp: () => Ec, - validateEventUrlTag: () => Sc, - validateToken: () => Hf -}); -var vc = "Nostr "; -async function Uf(n, e, t, r = !1, s) { - const i = { - kind: Vi, - tags: [ - ["u", n], - ["method", e] - ], - created_at: Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3), - content: "" - }; - s && i.tags.push(["payload", Qi(s)]); - const o = await t(i); - return (r ? vc : "") + $t.encode(st.encode(JSON.stringify(o))); -} -async function Hf(n, e, t) { - const r = await xc(n).catch((i) => { - throw i; - }); - return await Tc(r, e, t).catch((i) => { - throw i; - }); -} -async function xc(n) { - if (!n) - throw new Error("Missing token"); - n = n.replace(vc, ""); - const e = ht.decode($t.decode(n)); - if (!e || e.length === 0 || !e.startsWith("{")) - throw new Error("Invalid token"); - return JSON.parse(e); -} -function Ec(n) { - return n.created_at ? Math.round((/* @__PURE__ */ new Date()).getTime() / 1e3) - n.created_at < 60 : !1; -} -function _c(n) { - return n.kind === Vi; -} -function Sc(n, e) { - const t = n.tags.find((r) => r[0] === "u"); - return t ? t.length > 0 && t[1] === e : !1; -} -function kc(n, e) { - const t = n.tags.find((r) => r[0] === "method"); - return t ? t.length > 0 && t[1].toLowerCase() === e.toLowerCase() : !1; -} -function Qi(n) { - const e = Yn(st.encode(JSON.stringify(n))); - return ve(e); -} -function Ac(n, e) { - const t = n.tags.find((s) => s[0] === "payload"); - if (!t) - return !1; - const r = Qi(e); - return t.length > 0 && t[1] === r; -} -async function Tc(n, e, t, r) { - if (!Xn(n)) - throw new Error("Invalid nostr event, signature invalid"); - if (!_c(n)) - throw new Error("Invalid nostr event, kind invalid"); - if (!Ec(n)) - throw new Error("Invalid nostr event, created_at timestamp invalid"); - if (!Sc(n, e)) - throw new Error("Invalid nostr event, url tag invalid"); - if (!kc(n, t)) - throw new Error("Invalid nostr event, method tag invalid"); - if (r && typeof r == "object" && Object.keys(r).length > 0 && !Ac(n, r)) - throw new Error("Invalid nostr event, payload tag does not match request body hash"); - return !0; -} -var Bc, Oc; -Bc = Symbol.iterator, Oc = Symbol.toStringTag; -var ea, ta, us, Ic; -const ut = class ut { - constructor(e) { - X(this, us); - B(this, "cache"); - B(this, ea, "NSet"); - this.cache = e ?? /* @__PURE__ */ new Map(); - } - get size() { - return this.cache.size; - } - add(e) { - M(this, us, Ic).call(this, e); - for (const t of this) { - if (ut.deletes(t, e) || ut.replaces(t, e)) - return this; - ut.replaces(e, t) && this.delete(t); - } - return this.cache.set(e.id, e), this; - } - clear() { - this.cache.clear(); - } - delete(e) { - return this.cache.delete(e.id); - } - forEach(e, t) { - return this.cache.forEach((r, s) => e(r, r, this), t); - } - has(e) { - return this.cache.has(e.id); - } - *entries() { - for (const e of this.values()) - yield [ - e, - e - ]; - } - keys() { - return this.values(); - } - *values() { - for (const e of ut.sortEvents([ - ...this.cache.values() - ])) - yield e; - } - [(ta = Bc, ea = Oc, ta)]() { - return this.values(); - } - /** Event kind is **replaceable**, which means that, for each combination of `pubkey` and `kind`, only the latest event is expected to (SHOULD) be stored by relays, older versions are expected to be discarded. */ - static isReplaceable(e) { - return [ - 0, - 3 - ].includes(e) || 1e4 <= e && e < 2e4; - } - /** Event kind is **parameterized replaceable**, which means that, for each combination of `pubkey`, `kind` and the `d` tag, only the latest event is expected to be stored by relays, older versions are expected to be discarded. */ - static isParameterizedReplaceable(e) { - return 3e4 <= e && e < 4e4; - } - /** - * Returns true if `event` replaces `target`. - * - * Both events must be replaceable, belong to the same kind and pubkey (and `d` tag, for parameterized events), and the `event` must be newer than the `target`. - */ - static replaces(e, t) { - var i, o; - const { kind: r, pubkey: s } = e; - if (ut.isReplaceable(r)) - return r === t.kind && s === t.pubkey && ut.sortEvents([ - e, - t - ])[0] === e; - if (ut.isParameterizedReplaceable(r)) { - const a = ((i = e.tags.find(([l]) => l === "d")) == null ? void 0 : i[1]) || "", c = ((o = t.tags.find(([l]) => l === "d")) == null ? void 0 : o[1]) || ""; - return r === t.kind && s === t.pubkey && ut.sortEvents([ - e, - t - ])[0] === e && a === c; - } - return !1; - } - /** - * Returns true if the `event` deletes`target`. - * - * `event` must be a kind `5` event, and both events must share the same `pubkey`. - */ - static deletes(e, t) { - const { kind: r, pubkey: s, tags: i } = e; - if (r === 5 && s === t.pubkey) { - for (const [o, a] of i) - if (o === "e" && a === t.id) - return !0; - } - return !1; - } - /** - * Sort events in reverse-chronological order by the `created_at` timestamp, - * and then by the event `id` (lexicographically) in case of ties. - * This mutates the array. - */ - static sortEvents(e) { - return e.sort((t, r) => t.created_at !== r.created_at ? r.created_at - t.created_at : t.id.localeCompare(r.id)); - } - union(e) { - throw new Error("Method not implemented."); - } - intersection(e) { - throw new Error("Method not implemented."); - } - difference(e) { - throw new Error("Method not implemented."); - } - symmetricDifference(e) { - throw new Error("Method not implemented."); - } - isSubsetOf(e) { - throw new Error("Method not implemented."); - } - isSupersetOf(e) { - throw new Error("Method not implemented."); - } - isDisjointFrom(e) { - throw new Error("Method not implemented."); - } -}; -us = new WeakSet(), Ic = function(e) { - if (e.kind === 5) { - for (const t of e.tags) - if (t[0] === "e") { - const r = this.cache.get(t[1]); - r && r.pubkey === e.pubkey && this.delete(r); - } - } -}; -let Zn = ut; -var Cc; -Cc = Symbol.toStringTag; -var na, ra; -class Mf extends (ra = Zn, na = Cc, ra) { - constructor(...t) { - super(new Ys(...t)); - B(this, na, "NCache"); - } - async event(t) { - this.add(t); - } - async query(t) { - const r = []; - for (const s of this) - fi(t, s) && (this.cache.get(s.id), r.push(s)); - return r; - } - async remove(t) { - for (const r of this) - fi(t, r) && this.delete(r); - } - async count(t) { - return { - count: (await this.query(t)).length, - approximate: !1 - }; - } -} -var re; -(function(n) { - n.assertEqual = (s) => s; - function e(s) { - } - n.assertIs = e; - function t(s) { - throw new Error(); - } - n.assertNever = t, n.arrayToEnum = (s) => { - const i = {}; - for (const o of s) - i[o] = o; - return i; - }, n.getValidEnumValues = (s) => { - const i = n.objectKeys(s).filter((a) => typeof s[s[a]] != "number"), o = {}; - for (const a of i) - o[a] = s[a]; - return n.objectValues(o); - }, n.objectValues = (s) => n.objectKeys(s).map(function(i) { - return s[i]; - }), n.objectKeys = typeof Object.keys == "function" ? (s) => Object.keys(s) : (s) => { - const i = []; - for (const o in s) - Object.prototype.hasOwnProperty.call(s, o) && i.push(o); - return i; - }, n.find = (s, i) => { - for (const o of s) - if (i(o)) - return o; - }, n.isInteger = typeof Number.isInteger == "function" ? (s) => Number.isInteger(s) : (s) => typeof s == "number" && isFinite(s) && Math.floor(s) === s; - function r(s, i = " | ") { - return s.map((o) => typeof o == "string" ? `'${o}'` : o).join(i); - } - n.joinValues = r, n.jsonStringifyReplacer = (s, i) => typeof i == "bigint" ? i.toString() : i; -})(re || (re = {})); -var gi; -(function(n) { - n.mergeShapes = (e, t) => ({ - ...e, - ...t - // second overwrites first - }); -})(gi || (gi = {})); -const H = re.arrayToEnum([ - "string", - "nan", - "number", - "integer", - "float", - "boolean", - "date", - "bigint", - "symbol", - "function", - "undefined", - "null", - "array", - "object", - "unknown", - "promise", - "void", - "never", - "map", - "set" -]), Yt = (n) => { - switch (typeof n) { - case "undefined": - return H.undefined; - case "string": - return H.string; - case "number": - return isNaN(n) ? H.nan : H.number; - case "boolean": - return H.boolean; - case "function": - return H.function; - case "bigint": - return H.bigint; - case "symbol": - return H.symbol; - case "object": - return Array.isArray(n) ? H.array : n === null ? H.null : n.then && typeof n.then == "function" && n.catch && typeof n.catch == "function" ? H.promise : typeof Map < "u" && n instanceof Map ? H.map : typeof Set < "u" && n instanceof Set ? H.set : typeof Date < "u" && n instanceof Date ? H.date : H.object; - default: - return H.unknown; - } -}, O = re.arrayToEnum([ - "invalid_type", - "invalid_literal", - "custom", - "invalid_union", - "invalid_union_discriminator", - "invalid_enum_value", - "unrecognized_keys", - "invalid_arguments", - "invalid_return_type", - "invalid_date", - "invalid_string", - "too_small", - "too_big", - "invalid_intersection_types", - "not_multiple_of", - "not_finite" -]), jf = (n) => JSON.stringify(n, null, 2).replace(/"([^"]+)":/g, "$1:"); -class Pe extends Error { - constructor(e) { - super(), this.issues = [], this.addIssue = (r) => { - this.issues = [...this.issues, r]; - }, this.addIssues = (r = []) => { - this.issues = [...this.issues, ...r]; - }; - const t = new.target.prototype; - Object.setPrototypeOf ? Object.setPrototypeOf(this, t) : this.__proto__ = t, this.name = "ZodError", this.issues = e; - } - get errors() { - return this.issues; - } - format(e) { - const t = e || function(i) { - return i.message; - }, r = { _errors: [] }, s = (i) => { - for (const o of i.issues) - if (o.code === "invalid_union") - o.unionErrors.map(s); - else if (o.code === "invalid_return_type") - s(o.returnTypeError); - else if (o.code === "invalid_arguments") - s(o.argumentsError); - else if (o.path.length === 0) - r._errors.push(t(o)); - else { - let a = r, c = 0; - for (; c < o.path.length; ) { - const l = o.path[c]; - c === o.path.length - 1 ? (a[l] = a[l] || { _errors: [] }, a[l]._errors.push(t(o))) : a[l] = a[l] || { _errors: [] }, a = a[l], c++; - } - } - }; - return s(this), r; - } - static assert(e) { - if (!(e instanceof Pe)) - throw new Error(`Not a ZodError: ${e}`); - } - toString() { - return this.message; - } - get message() { - return JSON.stringify(this.issues, re.jsonStringifyReplacer, 2); - } - get isEmpty() { - return this.issues.length === 0; - } - flatten(e = (t) => t.message) { - const t = {}, r = []; - for (const s of this.issues) - s.path.length > 0 ? (t[s.path[0]] = t[s.path[0]] || [], t[s.path[0]].push(e(s))) : r.push(e(s)); - return { formErrors: r, fieldErrors: t }; - } - get formErrors() { - return this.flatten(); - } -} -Pe.create = (n) => new Pe(n); -const zn = (n, e) => { - let t; - switch (n.code) { - case O.invalid_type: - n.received === H.undefined ? t = "Required" : t = `Expected ${n.expected}, received ${n.received}`; - break; - case O.invalid_literal: - t = `Invalid literal value, expected ${JSON.stringify(n.expected, re.jsonStringifyReplacer)}`; - break; - case O.unrecognized_keys: - t = `Unrecognized key(s) in object: ${re.joinValues(n.keys, ", ")}`; - break; - case O.invalid_union: - t = "Invalid input"; - break; - case O.invalid_union_discriminator: - t = `Invalid discriminator value. Expected ${re.joinValues(n.options)}`; - break; - case O.invalid_enum_value: - t = `Invalid enum value. Expected ${re.joinValues(n.options)}, received '${n.received}'`; - break; - case O.invalid_arguments: - t = "Invalid function arguments"; - break; - case O.invalid_return_type: - t = "Invalid function return type"; - break; - case O.invalid_date: - t = "Invalid date"; - break; - case O.invalid_string: - typeof n.validation == "object" ? "includes" in n.validation ? (t = `Invalid input: must include "${n.validation.includes}"`, typeof n.validation.position == "number" && (t = `${t} at one or more positions greater than or equal to ${n.validation.position}`)) : "startsWith" in n.validation ? t = `Invalid input: must start with "${n.validation.startsWith}"` : "endsWith" in n.validation ? t = `Invalid input: must end with "${n.validation.endsWith}"` : re.assertNever(n.validation) : n.validation !== "regex" ? t = `Invalid ${n.validation}` : t = "Invalid"; - break; - case O.too_small: - n.type === "array" ? t = `Array must contain ${n.exact ? "exactly" : n.inclusive ? "at least" : "more than"} ${n.minimum} element(s)` : n.type === "string" ? t = `String must contain ${n.exact ? "exactly" : n.inclusive ? "at least" : "over"} ${n.minimum} character(s)` : n.type === "number" ? t = `Number must be ${n.exact ? "exactly equal to " : n.inclusive ? "greater than or equal to " : "greater than "}${n.minimum}` : n.type === "date" ? t = `Date must be ${n.exact ? "exactly equal to " : n.inclusive ? "greater than or equal to " : "greater than "}${new Date(Number(n.minimum))}` : t = "Invalid input"; - break; - case O.too_big: - n.type === "array" ? t = `Array must contain ${n.exact ? "exactly" : n.inclusive ? "at most" : "less than"} ${n.maximum} element(s)` : n.type === "string" ? t = `String must contain ${n.exact ? "exactly" : n.inclusive ? "at most" : "under"} ${n.maximum} character(s)` : n.type === "number" ? t = `Number must be ${n.exact ? "exactly" : n.inclusive ? "less than or equal to" : "less than"} ${n.maximum}` : n.type === "bigint" ? t = `BigInt must be ${n.exact ? "exactly" : n.inclusive ? "less than or equal to" : "less than"} ${n.maximum}` : n.type === "date" ? t = `Date must be ${n.exact ? "exactly" : n.inclusive ? "smaller than or equal to" : "smaller than"} ${new Date(Number(n.maximum))}` : t = "Invalid input"; - break; - case O.custom: - t = "Invalid input"; - break; - case O.invalid_intersection_types: - t = "Intersection results could not be merged"; - break; - case O.not_multiple_of: - t = `Number must be a multiple of ${n.multipleOf}`; - break; - case O.not_finite: - t = "Number must be finite"; - break; - default: - t = e.defaultError, re.assertNever(n); - } - return { message: t }; -}; -let $c = zn; -function Pf(n) { - $c = n; -} -function ts() { - return $c; -} -const ns = (n) => { - const { data: e, path: t, errorMaps: r, issueData: s } = n, i = [...t, ...s.path || []], o = { - ...s, - path: i - }; - if (s.message !== void 0) - return { - ...s, - path: i, - message: s.message - }; - let a = ""; - const c = r.filter((l) => !!l).slice().reverse(); - for (const l of c) - a = l(o, { data: e, defaultError: a }).message; - return { - ...s, - path: i, - message: a - }; -}, Zf = []; -function U(n, e) { - const t = ts(), r = ns({ - issueData: e, - data: n.data, - path: n.path, - errorMaps: [ - n.common.contextualErrorMap, - n.schemaErrorMap, - t, - t === zn ? void 0 : zn - // then global default map - ].filter((s) => !!s) - }); - n.common.issues.push(r); -} -class Be { - constructor() { - this.value = "valid"; - } - dirty() { - this.value === "valid" && (this.value = "dirty"); - } - abort() { - this.value !== "aborted" && (this.value = "aborted"); - } - static mergeArray(e, t) { - const r = []; - for (const s of t) { - if (s.status === "aborted") - return K; - s.status === "dirty" && e.dirty(), r.push(s.value); - } - return { status: e.value, value: r }; - } - static async mergeObjectAsync(e, t) { - const r = []; - for (const s of t) { - const i = await s.key, o = await s.value; - r.push({ - key: i, - value: o - }); - } - return Be.mergeObjectSync(e, r); - } - static mergeObjectSync(e, t) { - const r = {}; - for (const s of t) { - const { key: i, value: o } = s; - if (i.status === "aborted" || o.status === "aborted") - return K; - i.status === "dirty" && e.dirty(), o.status === "dirty" && e.dirty(), i.value !== "__proto__" && (typeof o.value < "u" || s.alwaysSet) && (r[i.value] = o.value); - } - return { status: e.value, value: r }; - } -} -const K = Object.freeze({ - status: "aborted" -}), Bn = (n) => ({ status: "dirty", value: n }), $e = (n) => ({ status: "valid", value: n }), yi = (n) => n.status === "aborted", mi = (n) => n.status === "dirty", lr = (n) => n.status === "valid", ur = (n) => typeof Promise < "u" && n instanceof Promise; -function rs(n, e, t, r) { - if (typeof e == "function" ? n !== e || !r : !e.has(n)) throw new TypeError("Cannot read private member from an object whose class did not declare it"); - return e.get(n); -} -function Rc(n, e, t, r, s) { - if (typeof e == "function" ? n !== e || !s : !e.has(n)) throw new TypeError("Cannot write private member to an object whose class did not declare it"); - return e.set(n, t), t; -} -var D; -(function(n) { - n.errToObj = (e) => typeof e == "string" ? { message: e } : e || {}, n.toString = (e) => typeof e == "string" ? e : e == null ? void 0 : e.message; -})(D || (D = {})); -var nr, rr; -class mt { - constructor(e, t, r, s) { - this._cachedPath = [], this.parent = e, this.data = t, this._path = r, this._key = s; - } - get path() { - return this._cachedPath.length || (this._key instanceof Array ? this._cachedPath.push(...this._path, ...this._key) : this._cachedPath.push(...this._path, this._key)), this._cachedPath; - } -} -const No = (n, e) => { - if (lr(e)) - return { success: !0, data: e.value }; - if (!n.common.issues.length) - throw new Error("Validation failed but no issues detected."); - return { - success: !1, - get error() { - if (this._error) - return this._error; - const t = new Pe(n.common.issues); - return this._error = t, this._error; - } - }; -}; -function J(n) { - if (!n) - return {}; - const { errorMap: e, invalid_type_error: t, required_error: r, description: s } = n; - if (e && (t || r)) - throw new Error(`Can't use "invalid_type_error" or "required_error" in conjunction with custom error map.`); - return e ? { errorMap: e, description: s } : { errorMap: (o, a) => { - var c, l; - const { message: d } = n; - return o.code === "invalid_enum_value" ? { message: d ?? a.defaultError } : typeof a.data > "u" ? { message: (c = d ?? r) !== null && c !== void 0 ? c : a.defaultError } : o.code !== "invalid_type" ? { message: a.defaultError } : { message: (l = d ?? t) !== null && l !== void 0 ? l : a.defaultError }; - }, description: s }; -} -class ee { - constructor(e) { - this.spa = this.safeParseAsync, this._def = e, this.parse = this.parse.bind(this), this.safeParse = this.safeParse.bind(this), this.parseAsync = this.parseAsync.bind(this), this.safeParseAsync = this.safeParseAsync.bind(this), this.spa = this.spa.bind(this), this.refine = this.refine.bind(this), this.refinement = this.refinement.bind(this), this.superRefine = this.superRefine.bind(this), this.optional = this.optional.bind(this), this.nullable = this.nullable.bind(this), this.nullish = this.nullish.bind(this), this.array = this.array.bind(this), this.promise = this.promise.bind(this), this.or = this.or.bind(this), this.and = this.and.bind(this), this.transform = this.transform.bind(this), this.brand = this.brand.bind(this), this.default = this.default.bind(this), this.catch = this.catch.bind(this), this.describe = this.describe.bind(this), this.pipe = this.pipe.bind(this), this.readonly = this.readonly.bind(this), this.isNullable = this.isNullable.bind(this), this.isOptional = this.isOptional.bind(this); - } - get description() { - return this._def.description; - } - _getType(e) { - return Yt(e.data); - } - _getOrReturnCtx(e, t) { - return t || { - common: e.parent.common, - data: e.data, - parsedType: Yt(e.data), - schemaErrorMap: this._def.errorMap, - path: e.path, - parent: e.parent - }; - } - _processInputParams(e) { - return { - status: new Be(), - ctx: { - common: e.parent.common, - data: e.data, - parsedType: Yt(e.data), - schemaErrorMap: this._def.errorMap, - path: e.path, - parent: e.parent - } - }; - } - _parseSync(e) { - const t = this._parse(e); - if (ur(t)) - throw new Error("Synchronous parse encountered promise."); - return t; - } - _parseAsync(e) { - const t = this._parse(e); - return Promise.resolve(t); - } - parse(e, t) { - const r = this.safeParse(e, t); - if (r.success) - return r.data; - throw r.error; - } - safeParse(e, t) { - var r; - const s = { - common: { - issues: [], - async: (r = t == null ? void 0 : t.async) !== null && r !== void 0 ? r : !1, - contextualErrorMap: t == null ? void 0 : t.errorMap - }, - path: (t == null ? void 0 : t.path) || [], - schemaErrorMap: this._def.errorMap, - parent: null, - data: e, - parsedType: Yt(e) - }, i = this._parseSync({ data: e, path: s.path, parent: s }); - return No(s, i); - } - async parseAsync(e, t) { - const r = await this.safeParseAsync(e, t); - if (r.success) - return r.data; - throw r.error; - } - async safeParseAsync(e, t) { - const r = { - common: { - issues: [], - contextualErrorMap: t == null ? void 0 : t.errorMap, - async: !0 - }, - path: (t == null ? void 0 : t.path) || [], - schemaErrorMap: this._def.errorMap, - parent: null, - data: e, - parsedType: Yt(e) - }, s = this._parse({ data: e, path: r.path, parent: r }), i = await (ur(s) ? s : Promise.resolve(s)); - return No(r, i); - } - refine(e, t) { - const r = (s) => typeof t == "string" || typeof t > "u" ? { message: t } : typeof t == "function" ? t(s) : t; - return this._refinement((s, i) => { - const o = e(s), a = () => i.addIssue({ - code: O.custom, - ...r(s) - }); - return typeof Promise < "u" && o instanceof Promise ? o.then((c) => c ? !0 : (a(), !1)) : o ? !0 : (a(), !1); - }); - } - refinement(e, t) { - return this._refinement((r, s) => e(r) ? !0 : (s.addIssue(typeof t == "function" ? t(r, s) : t), !1)); - } - _refinement(e) { - return new it({ - schema: this, - typeName: V.ZodEffects, - effect: { type: "refinement", refinement: e } - }); - } - superRefine(e) { - return this._refinement(e); - } - optional() { - return yt.create(this, this._def); - } - nullable() { - return sn.create(this, this._def); - } - nullish() { - return this.nullable().optional(); - } - array() { - return rt.create(this, this._def); - } - promise() { - return qn.create(this, this._def); - } - or(e) { - return pr.create([this, e], this._def); - } - and(e) { - return gr.create(this, e, this._def); - } - transform(e) { - return new it({ - ...J(this._def), - schema: this, - typeName: V.ZodEffects, - effect: { type: "transform", transform: e } - }); - } - default(e) { - const t = typeof e == "function" ? e : () => e; - return new vr({ - ...J(this._def), - innerType: this, - defaultValue: t, - typeName: V.ZodDefault - }); - } - brand() { - return new eo({ - typeName: V.ZodBranded, - type: this, - ...J(this._def) - }); - } - catch(e) { - const t = typeof e == "function" ? e : () => e; - return new xr({ - ...J(this._def), - innerType: this, - catchValue: t, - typeName: V.ZodCatch - }); - } - describe(e) { - const t = this.constructor; - return new t({ - ...this._def, - description: e - }); - } - pipe(e) { - return Rr.create(this, e); - } - readonly() { - return Er.create(this); - } - isOptional() { - return this.safeParse(void 0).success; - } - isNullable() { - return this.safeParse(null).success; - } -} -const zf = /^c[^\s-]{8,}$/i, Df = /^[0-9a-z]+$/, qf = /^[0-9A-HJKMNP-TV-Z]{26}$/, Vf = /^[0-9a-fA-F]{8}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{12}$/i, Kf = /^[a-z0-9_-]{21}$/i, Wf = /^[-+]?P(?!$)(?:(?:[-+]?\d+Y)|(?:[-+]?\d+[.,]\d+Y$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:(?:[-+]?\d+W)|(?:[-+]?\d+[.,]\d+W$))?(?:(?:[-+]?\d+D)|(?:[-+]?\d+[.,]\d+D$))?(?:T(?=[\d+-])(?:(?:[-+]?\d+H)|(?:[-+]?\d+[.,]\d+H$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:[-+]?\d+(?:[.,]\d+)?S)?)??$/, Ff = /^(?!\.)(?!.*\.\.)([A-Z0-9_'+\-\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i, Gf = "^(\\p{Extended_Pictographic}|\\p{Emoji_Component})+$"; -let js; -const Yf = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])$/, Jf = /^(([a-f0-9]{1,4}:){7}|::([a-f0-9]{1,4}:){0,6}|([a-f0-9]{1,4}:){1}:([a-f0-9]{1,4}:){0,5}|([a-f0-9]{1,4}:){2}:([a-f0-9]{1,4}:){0,4}|([a-f0-9]{1,4}:){3}:([a-f0-9]{1,4}:){0,3}|([a-f0-9]{1,4}:){4}:([a-f0-9]{1,4}:){0,2}|([a-f0-9]{1,4}:){5}:([a-f0-9]{1,4}:){0,1})([a-f0-9]{1,4}|(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2})))$/, Xf = /^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$/, Nc = "((\\d\\d[2468][048]|\\d\\d[13579][26]|\\d\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\d{4}-((0[13578]|1[02])-(0[1-9]|[12]\\d|3[01])|(0[469]|11)-(0[1-9]|[12]\\d|30)|(02)-(0[1-9]|1\\d|2[0-8])))", Qf = new RegExp(`^${Nc}$`); -function Lc(n) { - let e = "([01]\\d|2[0-3]):[0-5]\\d:[0-5]\\d"; - return n.precision ? e = `${e}\\.\\d{${n.precision}}` : n.precision == null && (e = `${e}(\\.\\d+)?`), e; -} -function ep(n) { - return new RegExp(`^${Lc(n)}$`); -} -function Uc(n) { - let e = `${Nc}T${Lc(n)}`; - const t = []; - return t.push(n.local ? "Z?" : "Z"), n.offset && t.push("([+-]\\d{2}:?\\d{2})"), e = `${e}(${t.join("|")})`, new RegExp(`^${e}$`); -} -function tp(n, e) { - return !!((e === "v4" || !e) && Yf.test(n) || (e === "v6" || !e) && Jf.test(n)); -} -class nt extends ee { - _parse(e) { - if (this._def.coerce && (e.data = String(e.data)), this._getType(e) !== H.string) { - const i = this._getOrReturnCtx(e); - return U(i, { - code: O.invalid_type, - expected: H.string, - received: i.parsedType - }), K; - } - const r = new Be(); - let s; - for (const i of this._def.checks) - if (i.kind === "min") - e.data.length < i.value && (s = this._getOrReturnCtx(e, s), U(s, { - code: O.too_small, - minimum: i.value, - type: "string", - inclusive: !0, - exact: !1, - message: i.message - }), r.dirty()); - else if (i.kind === "max") - e.data.length > i.value && (s = this._getOrReturnCtx(e, s), U(s, { - code: O.too_big, - maximum: i.value, - type: "string", - inclusive: !0, - exact: !1, - message: i.message - }), r.dirty()); - else if (i.kind === "length") { - const o = e.data.length > i.value, a = e.data.length < i.value; - (o || a) && (s = this._getOrReturnCtx(e, s), o ? U(s, { - code: O.too_big, - maximum: i.value, - type: "string", - inclusive: !0, - exact: !0, - message: i.message - }) : a && U(s, { - code: O.too_small, - minimum: i.value, - type: "string", - inclusive: !0, - exact: !0, - message: i.message - }), r.dirty()); - } else if (i.kind === "email") - Ff.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "email", - code: O.invalid_string, - message: i.message - }), r.dirty()); - else if (i.kind === "emoji") - js || (js = new RegExp(Gf, "u")), js.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "emoji", - code: O.invalid_string, - message: i.message - }), r.dirty()); - else if (i.kind === "uuid") - Vf.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "uuid", - code: O.invalid_string, - message: i.message - }), r.dirty()); - else if (i.kind === "nanoid") - Kf.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "nanoid", - code: O.invalid_string, - message: i.message - }), r.dirty()); - else if (i.kind === "cuid") - zf.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "cuid", - code: O.invalid_string, - message: i.message - }), r.dirty()); - else if (i.kind === "cuid2") - Df.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "cuid2", - code: O.invalid_string, - message: i.message - }), r.dirty()); - else if (i.kind === "ulid") - qf.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "ulid", - code: O.invalid_string, - message: i.message - }), r.dirty()); - else if (i.kind === "url") - try { - new URL(e.data); - } catch { - s = this._getOrReturnCtx(e, s), U(s, { - validation: "url", - code: O.invalid_string, - message: i.message - }), r.dirty(); - } - else i.kind === "regex" ? (i.regex.lastIndex = 0, i.regex.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "regex", - code: O.invalid_string, - message: i.message - }), r.dirty())) : i.kind === "trim" ? e.data = e.data.trim() : i.kind === "includes" ? e.data.includes(i.value, i.position) || (s = this._getOrReturnCtx(e, s), U(s, { - code: O.invalid_string, - validation: { includes: i.value, position: i.position }, - message: i.message - }), r.dirty()) : i.kind === "toLowerCase" ? e.data = e.data.toLowerCase() : i.kind === "toUpperCase" ? e.data = e.data.toUpperCase() : i.kind === "startsWith" ? e.data.startsWith(i.value) || (s = this._getOrReturnCtx(e, s), U(s, { - code: O.invalid_string, - validation: { startsWith: i.value }, - message: i.message - }), r.dirty()) : i.kind === "endsWith" ? e.data.endsWith(i.value) || (s = this._getOrReturnCtx(e, s), U(s, { - code: O.invalid_string, - validation: { endsWith: i.value }, - message: i.message - }), r.dirty()) : i.kind === "datetime" ? Uc(i).test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - code: O.invalid_string, - validation: "datetime", - message: i.message - }), r.dirty()) : i.kind === "date" ? Qf.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - code: O.invalid_string, - validation: "date", - message: i.message - }), r.dirty()) : i.kind === "time" ? ep(i).test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - code: O.invalid_string, - validation: "time", - message: i.message - }), r.dirty()) : i.kind === "duration" ? Wf.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "duration", - code: O.invalid_string, - message: i.message - }), r.dirty()) : i.kind === "ip" ? tp(e.data, i.version) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "ip", - code: O.invalid_string, - message: i.message - }), r.dirty()) : i.kind === "base64" ? Xf.test(e.data) || (s = this._getOrReturnCtx(e, s), U(s, { - validation: "base64", - code: O.invalid_string, - message: i.message - }), r.dirty()) : re.assertNever(i); - return { status: r.value, value: e.data }; - } - _regex(e, t, r) { - return this.refinement((s) => e.test(s), { - validation: t, - code: O.invalid_string, - ...D.errToObj(r) - }); - } - _addCheck(e) { - return new nt({ - ...this._def, - checks: [...this._def.checks, e] - }); - } - email(e) { - return this._addCheck({ kind: "email", ...D.errToObj(e) }); - } - url(e) { - return this._addCheck({ kind: "url", ...D.errToObj(e) }); - } - emoji(e) { - return this._addCheck({ kind: "emoji", ...D.errToObj(e) }); - } - uuid(e) { - return this._addCheck({ kind: "uuid", ...D.errToObj(e) }); - } - nanoid(e) { - return this._addCheck({ kind: "nanoid", ...D.errToObj(e) }); - } - cuid(e) { - return this._addCheck({ kind: "cuid", ...D.errToObj(e) }); - } - cuid2(e) { - return this._addCheck({ kind: "cuid2", ...D.errToObj(e) }); - } - ulid(e) { - return this._addCheck({ kind: "ulid", ...D.errToObj(e) }); - } - base64(e) { - return this._addCheck({ kind: "base64", ...D.errToObj(e) }); - } - ip(e) { - return this._addCheck({ kind: "ip", ...D.errToObj(e) }); - } - datetime(e) { - var t, r; - return typeof e == "string" ? this._addCheck({ - kind: "datetime", - precision: null, - offset: !1, - local: !1, - message: e - }) : this._addCheck({ - kind: "datetime", - precision: typeof (e == null ? void 0 : e.precision) > "u" ? null : e == null ? void 0 : e.precision, - offset: (t = e == null ? void 0 : e.offset) !== null && t !== void 0 ? t : !1, - local: (r = e == null ? void 0 : e.local) !== null && r !== void 0 ? r : !1, - ...D.errToObj(e == null ? void 0 : e.message) - }); - } - date(e) { - return this._addCheck({ kind: "date", message: e }); - } - time(e) { - return typeof e == "string" ? this._addCheck({ - kind: "time", - precision: null, - message: e - }) : this._addCheck({ - kind: "time", - precision: typeof (e == null ? void 0 : e.precision) > "u" ? null : e == null ? void 0 : e.precision, - ...D.errToObj(e == null ? void 0 : e.message) - }); - } - duration(e) { - return this._addCheck({ kind: "duration", ...D.errToObj(e) }); - } - regex(e, t) { - return this._addCheck({ - kind: "regex", - regex: e, - ...D.errToObj(t) - }); - } - includes(e, t) { - return this._addCheck({ - kind: "includes", - value: e, - position: t == null ? void 0 : t.position, - ...D.errToObj(t == null ? void 0 : t.message) - }); - } - startsWith(e, t) { - return this._addCheck({ - kind: "startsWith", - value: e, - ...D.errToObj(t) - }); - } - endsWith(e, t) { - return this._addCheck({ - kind: "endsWith", - value: e, - ...D.errToObj(t) - }); - } - min(e, t) { - return this._addCheck({ - kind: "min", - value: e, - ...D.errToObj(t) - }); - } - max(e, t) { - return this._addCheck({ - kind: "max", - value: e, - ...D.errToObj(t) - }); - } - length(e, t) { - return this._addCheck({ - kind: "length", - value: e, - ...D.errToObj(t) - }); - } - /** - * @deprecated Use z.string().min(1) instead. - * @see {@link ZodString.min} - */ - nonempty(e) { - return this.min(1, D.errToObj(e)); - } - trim() { - return new nt({ - ...this._def, - checks: [...this._def.checks, { kind: "trim" }] - }); - } - toLowerCase() { - return new nt({ - ...this._def, - checks: [...this._def.checks, { kind: "toLowerCase" }] - }); - } - toUpperCase() { - return new nt({ - ...this._def, - checks: [...this._def.checks, { kind: "toUpperCase" }] - }); - } - get isDatetime() { - return !!this._def.checks.find((e) => e.kind === "datetime"); - } - get isDate() { - return !!this._def.checks.find((e) => e.kind === "date"); - } - get isTime() { - return !!this._def.checks.find((e) => e.kind === "time"); - } - get isDuration() { - return !!this._def.checks.find((e) => e.kind === "duration"); - } - get isEmail() { - return !!this._def.checks.find((e) => e.kind === "email"); - } - get isURL() { - return !!this._def.checks.find((e) => e.kind === "url"); - } - get isEmoji() { - return !!this._def.checks.find((e) => e.kind === "emoji"); - } - get isUUID() { - return !!this._def.checks.find((e) => e.kind === "uuid"); - } - get isNANOID() { - return !!this._def.checks.find((e) => e.kind === "nanoid"); - } - get isCUID() { - return !!this._def.checks.find((e) => e.kind === "cuid"); - } - get isCUID2() { - return !!this._def.checks.find((e) => e.kind === "cuid2"); - } - get isULID() { - return !!this._def.checks.find((e) => e.kind === "ulid"); - } - get isIP() { - return !!this._def.checks.find((e) => e.kind === "ip"); - } - get isBase64() { - return !!this._def.checks.find((e) => e.kind === "base64"); - } - get minLength() { - let e = null; - for (const t of this._def.checks) - t.kind === "min" && (e === null || t.value > e) && (e = t.value); - return e; - } - get maxLength() { - let e = null; - for (const t of this._def.checks) - t.kind === "max" && (e === null || t.value < e) && (e = t.value); - return e; - } -} -nt.create = (n) => { - var e; - return new nt({ - checks: [], - typeName: V.ZodString, - coerce: (e = n == null ? void 0 : n.coerce) !== null && e !== void 0 ? e : !1, - ...J(n) - }); -}; -function np(n, e) { - const t = (n.toString().split(".")[1] || "").length, r = (e.toString().split(".")[1] || "").length, s = t > r ? t : r, i = parseInt(n.toFixed(s).replace(".", "")), o = parseInt(e.toFixed(s).replace(".", "")); - return i % o / Math.pow(10, s); -} -class tn extends ee { - constructor() { - super(...arguments), this.min = this.gte, this.max = this.lte, this.step = this.multipleOf; - } - _parse(e) { - if (this._def.coerce && (e.data = Number(e.data)), this._getType(e) !== H.number) { - const i = this._getOrReturnCtx(e); - return U(i, { - code: O.invalid_type, - expected: H.number, - received: i.parsedType - }), K; - } - let r; - const s = new Be(); - for (const i of this._def.checks) - i.kind === "int" ? re.isInteger(e.data) || (r = this._getOrReturnCtx(e, r), U(r, { - code: O.invalid_type, - expected: "integer", - received: "float", - message: i.message - }), s.dirty()) : i.kind === "min" ? (i.inclusive ? e.data < i.value : e.data <= i.value) && (r = this._getOrReturnCtx(e, r), U(r, { - code: O.too_small, - minimum: i.value, - type: "number", - inclusive: i.inclusive, - exact: !1, - message: i.message - }), s.dirty()) : i.kind === "max" ? (i.inclusive ? e.data > i.value : e.data >= i.value) && (r = this._getOrReturnCtx(e, r), U(r, { - code: O.too_big, - maximum: i.value, - type: "number", - inclusive: i.inclusive, - exact: !1, - message: i.message - }), s.dirty()) : i.kind === "multipleOf" ? np(e.data, i.value) !== 0 && (r = this._getOrReturnCtx(e, r), U(r, { - code: O.not_multiple_of, - multipleOf: i.value, - message: i.message - }), s.dirty()) : i.kind === "finite" ? Number.isFinite(e.data) || (r = this._getOrReturnCtx(e, r), U(r, { - code: O.not_finite, - message: i.message - }), s.dirty()) : re.assertNever(i); - return { status: s.value, value: e.data }; - } - gte(e, t) { - return this.setLimit("min", e, !0, D.toString(t)); - } - gt(e, t) { - return this.setLimit("min", e, !1, D.toString(t)); - } - lte(e, t) { - return this.setLimit("max", e, !0, D.toString(t)); - } - lt(e, t) { - return this.setLimit("max", e, !1, D.toString(t)); - } - setLimit(e, t, r, s) { - return new tn({ - ...this._def, - checks: [ - ...this._def.checks, - { - kind: e, - value: t, - inclusive: r, - message: D.toString(s) - } - ] - }); - } - _addCheck(e) { - return new tn({ - ...this._def, - checks: [...this._def.checks, e] - }); - } - int(e) { - return this._addCheck({ - kind: "int", - message: D.toString(e) - }); - } - positive(e) { - return this._addCheck({ - kind: "min", - value: 0, - inclusive: !1, - message: D.toString(e) - }); - } - negative(e) { - return this._addCheck({ - kind: "max", - value: 0, - inclusive: !1, - message: D.toString(e) - }); - } - nonpositive(e) { - return this._addCheck({ - kind: "max", - value: 0, - inclusive: !0, - message: D.toString(e) - }); - } - nonnegative(e) { - return this._addCheck({ - kind: "min", - value: 0, - inclusive: !0, - message: D.toString(e) - }); - } - multipleOf(e, t) { - return this._addCheck({ - kind: "multipleOf", - value: e, - message: D.toString(t) - }); - } - finite(e) { - return this._addCheck({ - kind: "finite", - message: D.toString(e) - }); - } - safe(e) { - return this._addCheck({ - kind: "min", - inclusive: !0, - value: Number.MIN_SAFE_INTEGER, - message: D.toString(e) - })._addCheck({ - kind: "max", - inclusive: !0, - value: Number.MAX_SAFE_INTEGER, - message: D.toString(e) - }); - } - get minValue() { - let e = null; - for (const t of this._def.checks) - t.kind === "min" && (e === null || t.value > e) && (e = t.value); - return e; - } - get maxValue() { - let e = null; - for (const t of this._def.checks) - t.kind === "max" && (e === null || t.value < e) && (e = t.value); - return e; - } - get isInt() { - return !!this._def.checks.find((e) => e.kind === "int" || e.kind === "multipleOf" && re.isInteger(e.value)); - } - get isFinite() { - let e = null, t = null; - for (const r of this._def.checks) { - if (r.kind === "finite" || r.kind === "int" || r.kind === "multipleOf") - return !0; - r.kind === "min" ? (t === null || r.value > t) && (t = r.value) : r.kind === "max" && (e === null || r.value < e) && (e = r.value); - } - return Number.isFinite(t) && Number.isFinite(e); - } -} -tn.create = (n) => new tn({ - checks: [], - typeName: V.ZodNumber, - coerce: (n == null ? void 0 : n.coerce) || !1, - ...J(n) -}); -class nn extends ee { - constructor() { - super(...arguments), this.min = this.gte, this.max = this.lte; - } - _parse(e) { - if (this._def.coerce && (e.data = BigInt(e.data)), this._getType(e) !== H.bigint) { - const i = this._getOrReturnCtx(e); - return U(i, { - code: O.invalid_type, - expected: H.bigint, - received: i.parsedType - }), K; - } - let r; - const s = new Be(); - for (const i of this._def.checks) - i.kind === "min" ? (i.inclusive ? e.data < i.value : e.data <= i.value) && (r = this._getOrReturnCtx(e, r), U(r, { - code: O.too_small, - type: "bigint", - minimum: i.value, - inclusive: i.inclusive, - message: i.message - }), s.dirty()) : i.kind === "max" ? (i.inclusive ? e.data > i.value : e.data >= i.value) && (r = this._getOrReturnCtx(e, r), U(r, { - code: O.too_big, - type: "bigint", - maximum: i.value, - inclusive: i.inclusive, - message: i.message - }), s.dirty()) : i.kind === "multipleOf" ? e.data % i.value !== BigInt(0) && (r = this._getOrReturnCtx(e, r), U(r, { - code: O.not_multiple_of, - multipleOf: i.value, - message: i.message - }), s.dirty()) : re.assertNever(i); - return { status: s.value, value: e.data }; - } - gte(e, t) { - return this.setLimit("min", e, !0, D.toString(t)); - } - gt(e, t) { - return this.setLimit("min", e, !1, D.toString(t)); - } - lte(e, t) { - return this.setLimit("max", e, !0, D.toString(t)); - } - lt(e, t) { - return this.setLimit("max", e, !1, D.toString(t)); - } - setLimit(e, t, r, s) { - return new nn({ - ...this._def, - checks: [ - ...this._def.checks, - { - kind: e, - value: t, - inclusive: r, - message: D.toString(s) - } - ] - }); - } - _addCheck(e) { - return new nn({ - ...this._def, - checks: [...this._def.checks, e] - }); - } - positive(e) { - return this._addCheck({ - kind: "min", - value: BigInt(0), - inclusive: !1, - message: D.toString(e) - }); - } - negative(e) { - return this._addCheck({ - kind: "max", - value: BigInt(0), - inclusive: !1, - message: D.toString(e) - }); - } - nonpositive(e) { - return this._addCheck({ - kind: "max", - value: BigInt(0), - inclusive: !0, - message: D.toString(e) - }); - } - nonnegative(e) { - return this._addCheck({ - kind: "min", - value: BigInt(0), - inclusive: !0, - message: D.toString(e) - }); - } - multipleOf(e, t) { - return this._addCheck({ - kind: "multipleOf", - value: e, - message: D.toString(t) - }); - } - get minValue() { - let e = null; - for (const t of this._def.checks) - t.kind === "min" && (e === null || t.value > e) && (e = t.value); - return e; - } - get maxValue() { - let e = null; - for (const t of this._def.checks) - t.kind === "max" && (e === null || t.value < e) && (e = t.value); - return e; - } -} -nn.create = (n) => { - var e; - return new nn({ - checks: [], - typeName: V.ZodBigInt, - coerce: (e = n == null ? void 0 : n.coerce) !== null && e !== void 0 ? e : !1, - ...J(n) - }); -}; -class dr extends ee { - _parse(e) { - if (this._def.coerce && (e.data = !!e.data), this._getType(e) !== H.boolean) { - const r = this._getOrReturnCtx(e); - return U(r, { - code: O.invalid_type, - expected: H.boolean, - received: r.parsedType - }), K; - } - return $e(e.data); - } -} -dr.create = (n) => new dr({ - typeName: V.ZodBoolean, - coerce: (n == null ? void 0 : n.coerce) || !1, - ...J(n) -}); -class vn extends ee { - _parse(e) { - if (this._def.coerce && (e.data = new Date(e.data)), this._getType(e) !== H.date) { - const i = this._getOrReturnCtx(e); - return U(i, { - code: O.invalid_type, - expected: H.date, - received: i.parsedType - }), K; - } - if (isNaN(e.data.getTime())) { - const i = this._getOrReturnCtx(e); - return U(i, { - code: O.invalid_date - }), K; - } - const r = new Be(); - let s; - for (const i of this._def.checks) - i.kind === "min" ? e.data.getTime() < i.value && (s = this._getOrReturnCtx(e, s), U(s, { - code: O.too_small, - message: i.message, - inclusive: !0, - exact: !1, - minimum: i.value, - type: "date" - }), r.dirty()) : i.kind === "max" ? e.data.getTime() > i.value && (s = this._getOrReturnCtx(e, s), U(s, { - code: O.too_big, - message: i.message, - inclusive: !0, - exact: !1, - maximum: i.value, - type: "date" - }), r.dirty()) : re.assertNever(i); - return { - status: r.value, - value: new Date(e.data.getTime()) - }; - } - _addCheck(e) { - return new vn({ - ...this._def, - checks: [...this._def.checks, e] - }); - } - min(e, t) { - return this._addCheck({ - kind: "min", - value: e.getTime(), - message: D.toString(t) - }); - } - max(e, t) { - return this._addCheck({ - kind: "max", - value: e.getTime(), - message: D.toString(t) - }); - } - get minDate() { - let e = null; - for (const t of this._def.checks) - t.kind === "min" && (e === null || t.value > e) && (e = t.value); - return e != null ? new Date(e) : null; - } - get maxDate() { - let e = null; - for (const t of this._def.checks) - t.kind === "max" && (e === null || t.value < e) && (e = t.value); - return e != null ? new Date(e) : null; - } -} -vn.create = (n) => new vn({ - checks: [], - coerce: (n == null ? void 0 : n.coerce) || !1, - typeName: V.ZodDate, - ...J(n) -}); -class ss extends ee { - _parse(e) { - if (this._getType(e) !== H.symbol) { - const r = this._getOrReturnCtx(e); - return U(r, { - code: O.invalid_type, - expected: H.symbol, - received: r.parsedType - }), K; - } - return $e(e.data); - } -} -ss.create = (n) => new ss({ - typeName: V.ZodSymbol, - ...J(n) -}); -class hr extends ee { - _parse(e) { - if (this._getType(e) !== H.undefined) { - const r = this._getOrReturnCtx(e); - return U(r, { - code: O.invalid_type, - expected: H.undefined, - received: r.parsedType - }), K; - } - return $e(e.data); - } -} -hr.create = (n) => new hr({ - typeName: V.ZodUndefined, - ...J(n) -}); -class fr extends ee { - _parse(e) { - if (this._getType(e) !== H.null) { - const r = this._getOrReturnCtx(e); - return U(r, { - code: O.invalid_type, - expected: H.null, - received: r.parsedType - }), K; - } - return $e(e.data); - } -} -fr.create = (n) => new fr({ - typeName: V.ZodNull, - ...J(n) -}); -class Dn extends ee { - constructor() { - super(...arguments), this._any = !0; - } - _parse(e) { - return $e(e.data); - } -} -Dn.create = (n) => new Dn({ - typeName: V.ZodAny, - ...J(n) -}); -class gn extends ee { - constructor() { - super(...arguments), this._unknown = !0; - } - _parse(e) { - return $e(e.data); - } -} -gn.create = (n) => new gn({ - typeName: V.ZodUnknown, - ...J(n) -}); -class Rt extends ee { - _parse(e) { - const t = this._getOrReturnCtx(e); - return U(t, { - code: O.invalid_type, - expected: H.never, - received: t.parsedType - }), K; - } -} -Rt.create = (n) => new Rt({ - typeName: V.ZodNever, - ...J(n) -}); -class is extends ee { - _parse(e) { - if (this._getType(e) !== H.undefined) { - const r = this._getOrReturnCtx(e); - return U(r, { - code: O.invalid_type, - expected: H.void, - received: r.parsedType - }), K; - } - return $e(e.data); - } -} -is.create = (n) => new is({ - typeName: V.ZodVoid, - ...J(n) -}); -class rt extends ee { - _parse(e) { - const { ctx: t, status: r } = this._processInputParams(e), s = this._def; - if (t.parsedType !== H.array) - return U(t, { - code: O.invalid_type, - expected: H.array, - received: t.parsedType - }), K; - if (s.exactLength !== null) { - const o = t.data.length > s.exactLength.value, a = t.data.length < s.exactLength.value; - (o || a) && (U(t, { - code: o ? O.too_big : O.too_small, - minimum: a ? s.exactLength.value : void 0, - maximum: o ? s.exactLength.value : void 0, - type: "array", - inclusive: !0, - exact: !0, - message: s.exactLength.message - }), r.dirty()); - } - if (s.minLength !== null && t.data.length < s.minLength.value && (U(t, { - code: O.too_small, - minimum: s.minLength.value, - type: "array", - inclusive: !0, - exact: !1, - message: s.minLength.message - }), r.dirty()), s.maxLength !== null && t.data.length > s.maxLength.value && (U(t, { - code: O.too_big, - maximum: s.maxLength.value, - type: "array", - inclusive: !0, - exact: !1, - message: s.maxLength.message - }), r.dirty()), t.common.async) - return Promise.all([...t.data].map((o, a) => s.type._parseAsync(new mt(t, o, t.path, a)))).then((o) => Be.mergeArray(r, o)); - const i = [...t.data].map((o, a) => s.type._parseSync(new mt(t, o, t.path, a))); - return Be.mergeArray(r, i); - } - get element() { - return this._def.type; - } - min(e, t) { - return new rt({ - ...this._def, - minLength: { value: e, message: D.toString(t) } - }); - } - max(e, t) { - return new rt({ - ...this._def, - maxLength: { value: e, message: D.toString(t) } - }); - } - length(e, t) { - return new rt({ - ...this._def, - exactLength: { value: e, message: D.toString(t) } - }); - } - nonempty(e) { - return this.min(1, e); - } -} -rt.create = (n, e) => new rt({ - type: n, - minLength: null, - maxLength: null, - exactLength: null, - typeName: V.ZodArray, - ...J(e) -}); -function An(n) { - if (n instanceof le) { - const e = {}; - for (const t in n.shape) { - const r = n.shape[t]; - e[t] = yt.create(An(r)); - } - return new le({ - ...n._def, - shape: () => e - }); - } else return n instanceof rt ? new rt({ - ...n._def, - type: An(n.element) - }) : n instanceof yt ? yt.create(An(n.unwrap())) : n instanceof sn ? sn.create(An(n.unwrap())) : n instanceof wt ? wt.create(n.items.map((e) => An(e))) : n; -} -class le extends ee { - constructor() { - super(...arguments), this._cached = null, this.nonstrict = this.passthrough, this.augment = this.extend; - } - _getCached() { - if (this._cached !== null) - return this._cached; - const e = this._def.shape(), t = re.objectKeys(e); - return this._cached = { shape: e, keys: t }; - } - _parse(e) { - if (this._getType(e) !== H.object) { - const l = this._getOrReturnCtx(e); - return U(l, { - code: O.invalid_type, - expected: H.object, - received: l.parsedType - }), K; - } - const { status: r, ctx: s } = this._processInputParams(e), { shape: i, keys: o } = this._getCached(), a = []; - if (!(this._def.catchall instanceof Rt && this._def.unknownKeys === "strip")) - for (const l in s.data) - o.includes(l) || a.push(l); - const c = []; - for (const l of o) { - const d = i[l], u = s.data[l]; - c.push({ - key: { status: "valid", value: l }, - value: d._parse(new mt(s, u, s.path, l)), - alwaysSet: l in s.data - }); - } - if (this._def.catchall instanceof Rt) { - const l = this._def.unknownKeys; - if (l === "passthrough") - for (const d of a) - c.push({ - key: { status: "valid", value: d }, - value: { status: "valid", value: s.data[d] } - }); - else if (l === "strict") - a.length > 0 && (U(s, { - code: O.unrecognized_keys, - keys: a - }), r.dirty()); - else if (l !== "strip") throw new Error("Internal ZodObject error: invalid unknownKeys value."); - } else { - const l = this._def.catchall; - for (const d of a) { - const u = s.data[d]; - c.push({ - key: { status: "valid", value: d }, - value: l._parse( - new mt(s, u, s.path, d) - //, ctx.child(key), value, getParsedType(value) - ), - alwaysSet: d in s.data - }); - } - } - return s.common.async ? Promise.resolve().then(async () => { - const l = []; - for (const d of c) { - const u = await d.key, f = await d.value; - l.push({ - key: u, - value: f, - alwaysSet: d.alwaysSet - }); - } - return l; - }).then((l) => Be.mergeObjectSync(r, l)) : Be.mergeObjectSync(r, c); - } - get shape() { - return this._def.shape(); - } - strict(e) { - return D.errToObj, new le({ - ...this._def, - unknownKeys: "strict", - ...e !== void 0 ? { - errorMap: (t, r) => { - var s, i, o, a; - const c = (o = (i = (s = this._def).errorMap) === null || i === void 0 ? void 0 : i.call(s, t, r).message) !== null && o !== void 0 ? o : r.defaultError; - return t.code === "unrecognized_keys" ? { - message: (a = D.errToObj(e).message) !== null && a !== void 0 ? a : c - } : { - message: c - }; - } - } : {} - }); - } - strip() { - return new le({ - ...this._def, - unknownKeys: "strip" - }); - } - passthrough() { - return new le({ - ...this._def, - unknownKeys: "passthrough" - }); - } - // const AugmentFactory = - // (def: Def) => - // ( - // augmentation: Augmentation - // ): ZodObject< - // extendShape, Augmentation>, - // Def["unknownKeys"], - // Def["catchall"] - // > => { - // return new ZodObject({ - // ...def, - // shape: () => ({ - // ...def.shape(), - // ...augmentation, - // }), - // }) as any; - // }; - extend(e) { - return new le({ - ...this._def, - shape: () => ({ - ...this._def.shape(), - ...e - }) - }); - } - /** - * Prior to zod@1.0.12 there was a bug in the - * inferred type of merged objects. Please - * upgrade if you are experiencing issues. - */ - merge(e) { - return new le({ - unknownKeys: e._def.unknownKeys, - catchall: e._def.catchall, - shape: () => ({ - ...this._def.shape(), - ...e._def.shape() - }), - typeName: V.ZodObject - }); - } - // merge< - // Incoming extends AnyZodObject, - // Augmentation extends Incoming["shape"], - // NewOutput extends { - // [k in keyof Augmentation | keyof Output]: k extends keyof Augmentation - // ? Augmentation[k]["_output"] - // : k extends keyof Output - // ? Output[k] - // : never; - // }, - // NewInput extends { - // [k in keyof Augmentation | keyof Input]: k extends keyof Augmentation - // ? Augmentation[k]["_input"] - // : k extends keyof Input - // ? Input[k] - // : never; - // } - // >( - // merging: Incoming - // ): ZodObject< - // extendShape>, - // Incoming["_def"]["unknownKeys"], - // Incoming["_def"]["catchall"], - // NewOutput, - // NewInput - // > { - // const merged: any = new ZodObject({ - // unknownKeys: merging._def.unknownKeys, - // catchall: merging._def.catchall, - // shape: () => - // objectUtil.mergeShapes(this._def.shape(), merging._def.shape()), - // typeName: ZodFirstPartyTypeKind.ZodObject, - // }) as any; - // return merged; - // } - setKey(e, t) { - return this.augment({ [e]: t }); - } - // merge( - // merging: Incoming - // ): //ZodObject = (merging) => { - // ZodObject< - // extendShape>, - // Incoming["_def"]["unknownKeys"], - // Incoming["_def"]["catchall"] - // > { - // // const mergedShape = objectUtil.mergeShapes( - // // this._def.shape(), - // // merging._def.shape() - // // ); - // const merged: any = new ZodObject({ - // unknownKeys: merging._def.unknownKeys, - // catchall: merging._def.catchall, - // shape: () => - // objectUtil.mergeShapes(this._def.shape(), merging._def.shape()), - // typeName: ZodFirstPartyTypeKind.ZodObject, - // }) as any; - // return merged; - // } - catchall(e) { - return new le({ - ...this._def, - catchall: e - }); - } - pick(e) { - const t = {}; - return re.objectKeys(e).forEach((r) => { - e[r] && this.shape[r] && (t[r] = this.shape[r]); - }), new le({ - ...this._def, - shape: () => t - }); - } - omit(e) { - const t = {}; - return re.objectKeys(this.shape).forEach((r) => { - e[r] || (t[r] = this.shape[r]); - }), new le({ - ...this._def, - shape: () => t - }); - } - /** - * @deprecated - */ - deepPartial() { - return An(this); - } - partial(e) { - const t = {}; - return re.objectKeys(this.shape).forEach((r) => { - const s = this.shape[r]; - e && !e[r] ? t[r] = s : t[r] = s.optional(); - }), new le({ - ...this._def, - shape: () => t - }); - } - required(e) { - const t = {}; - return re.objectKeys(this.shape).forEach((r) => { - if (e && !e[r]) - t[r] = this.shape[r]; - else { - let i = this.shape[r]; - for (; i instanceof yt; ) - i = i._def.innerType; - t[r] = i; - } - }), new le({ - ...this._def, - shape: () => t - }); - } - keyof() { - return Hc(re.objectKeys(this.shape)); - } -} -le.create = (n, e) => new le({ - shape: () => n, - unknownKeys: "strip", - catchall: Rt.create(), - typeName: V.ZodObject, - ...J(e) -}); -le.strictCreate = (n, e) => new le({ - shape: () => n, - unknownKeys: "strict", - catchall: Rt.create(), - typeName: V.ZodObject, - ...J(e) -}); -le.lazycreate = (n, e) => new le({ - shape: n, - unknownKeys: "strip", - catchall: Rt.create(), - typeName: V.ZodObject, - ...J(e) -}); -class pr extends ee { - _parse(e) { - const { ctx: t } = this._processInputParams(e), r = this._def.options; - function s(i) { - for (const a of i) - if (a.result.status === "valid") - return a.result; - for (const a of i) - if (a.result.status === "dirty") - return t.common.issues.push(...a.ctx.common.issues), a.result; - const o = i.map((a) => new Pe(a.ctx.common.issues)); - return U(t, { - code: O.invalid_union, - unionErrors: o - }), K; - } - if (t.common.async) - return Promise.all(r.map(async (i) => { - const o = { - ...t, - common: { - ...t.common, - issues: [] - }, - parent: null - }; - return { - result: await i._parseAsync({ - data: t.data, - path: t.path, - parent: o - }), - ctx: o - }; - })).then(s); - { - let i; - const o = []; - for (const c of r) { - const l = { - ...t, - common: { - ...t.common, - issues: [] - }, - parent: null - }, d = c._parseSync({ - data: t.data, - path: t.path, - parent: l - }); - if (d.status === "valid") - return d; - d.status === "dirty" && !i && (i = { result: d, ctx: l }), l.common.issues.length && o.push(l.common.issues); - } - if (i) - return t.common.issues.push(...i.ctx.common.issues), i.result; - const a = o.map((c) => new Pe(c)); - return U(t, { - code: O.invalid_union, - unionErrors: a - }), K; - } - } - get options() { - return this._def.options; - } -} -pr.create = (n, e) => new pr({ - options: n, - typeName: V.ZodUnion, - ...J(e) -}); -const kt = (n) => n instanceof mr ? kt(n.schema) : n instanceof it ? kt(n.innerType()) : n instanceof wr ? [n.value] : n instanceof rn ? n.options : n instanceof br ? re.objectValues(n.enum) : n instanceof vr ? kt(n._def.innerType) : n instanceof hr ? [void 0] : n instanceof fr ? [null] : n instanceof yt ? [void 0, ...kt(n.unwrap())] : n instanceof sn ? [null, ...kt(n.unwrap())] : n instanceof eo || n instanceof Er ? kt(n.unwrap()) : n instanceof xr ? kt(n._def.innerType) : []; -class Ss extends ee { - _parse(e) { - const { ctx: t } = this._processInputParams(e); - if (t.parsedType !== H.object) - return U(t, { - code: O.invalid_type, - expected: H.object, - received: t.parsedType - }), K; - const r = this.discriminator, s = t.data[r], i = this.optionsMap.get(s); - return i ? t.common.async ? i._parseAsync({ - data: t.data, - path: t.path, - parent: t - }) : i._parseSync({ - data: t.data, - path: t.path, - parent: t - }) : (U(t, { - code: O.invalid_union_discriminator, - options: Array.from(this.optionsMap.keys()), - path: [r] - }), K); - } - get discriminator() { - return this._def.discriminator; - } - get options() { - return this._def.options; - } - get optionsMap() { - return this._def.optionsMap; - } - /** - * The constructor of the discriminated union schema. Its behaviour is very similar to that of the normal z.union() constructor. - * However, it only allows a union of objects, all of which need to share a discriminator property. This property must - * have a different value for each object in the union. - * @param discriminator the name of the discriminator property - * @param types an array of object schemas - * @param params - */ - static create(e, t, r) { - const s = /* @__PURE__ */ new Map(); - for (const i of t) { - const o = kt(i.shape[e]); - if (!o.length) - throw new Error(`A discriminator value for key \`${e}\` could not be extracted from all schema options`); - for (const a of o) { - if (s.has(a)) - throw new Error(`Discriminator property ${String(e)} has duplicate value ${String(a)}`); - s.set(a, i); - } - } - return new Ss({ - typeName: V.ZodDiscriminatedUnion, - discriminator: e, - options: t, - optionsMap: s, - ...J(r) - }); - } -} -function wi(n, e) { - const t = Yt(n), r = Yt(e); - if (n === e) - return { valid: !0, data: n }; - if (t === H.object && r === H.object) { - const s = re.objectKeys(e), i = re.objectKeys(n).filter((a) => s.indexOf(a) !== -1), o = { ...n, ...e }; - for (const a of i) { - const c = wi(n[a], e[a]); - if (!c.valid) - return { valid: !1 }; - o[a] = c.data; - } - return { valid: !0, data: o }; - } else if (t === H.array && r === H.array) { - if (n.length !== e.length) - return { valid: !1 }; - const s = []; - for (let i = 0; i < n.length; i++) { - const o = n[i], a = e[i], c = wi(o, a); - if (!c.valid) - return { valid: !1 }; - s.push(c.data); - } - return { valid: !0, data: s }; - } else return t === H.date && r === H.date && +n == +e ? { valid: !0, data: n } : { valid: !1 }; -} -class gr extends ee { - _parse(e) { - const { status: t, ctx: r } = this._processInputParams(e), s = (i, o) => { - if (yi(i) || yi(o)) - return K; - const a = wi(i.value, o.value); - return a.valid ? ((mi(i) || mi(o)) && t.dirty(), { status: t.value, value: a.data }) : (U(r, { - code: O.invalid_intersection_types - }), K); - }; - return r.common.async ? Promise.all([ - this._def.left._parseAsync({ - data: r.data, - path: r.path, - parent: r - }), - this._def.right._parseAsync({ - data: r.data, - path: r.path, - parent: r - }) - ]).then(([i, o]) => s(i, o)) : s(this._def.left._parseSync({ - data: r.data, - path: r.path, - parent: r - }), this._def.right._parseSync({ - data: r.data, - path: r.path, - parent: r - })); - } -} -gr.create = (n, e, t) => new gr({ - left: n, - right: e, - typeName: V.ZodIntersection, - ...J(t) -}); -class wt extends ee { - _parse(e) { - const { status: t, ctx: r } = this._processInputParams(e); - if (r.parsedType !== H.array) - return U(r, { - code: O.invalid_type, - expected: H.array, - received: r.parsedType - }), K; - if (r.data.length < this._def.items.length) - return U(r, { - code: O.too_small, - minimum: this._def.items.length, - inclusive: !0, - exact: !1, - type: "array" - }), K; - !this._def.rest && r.data.length > this._def.items.length && (U(r, { - code: O.too_big, - maximum: this._def.items.length, - inclusive: !0, - exact: !1, - type: "array" - }), t.dirty()); - const i = [...r.data].map((o, a) => { - const c = this._def.items[a] || this._def.rest; - return c ? c._parse(new mt(r, o, r.path, a)) : null; - }).filter((o) => !!o); - return r.common.async ? Promise.all(i).then((o) => Be.mergeArray(t, o)) : Be.mergeArray(t, i); - } - get items() { - return this._def.items; - } - rest(e) { - return new wt({ - ...this._def, - rest: e - }); - } -} -wt.create = (n, e) => { - if (!Array.isArray(n)) - throw new Error("You must pass an array of schemas to z.tuple([ ... ])"); - return new wt({ - items: n, - typeName: V.ZodTuple, - rest: null, - ...J(e) - }); -}; -class yr extends ee { - get keySchema() { - return this._def.keyType; - } - get valueSchema() { - return this._def.valueType; - } - _parse(e) { - const { status: t, ctx: r } = this._processInputParams(e); - if (r.parsedType !== H.object) - return U(r, { - code: O.invalid_type, - expected: H.object, - received: r.parsedType - }), K; - const s = [], i = this._def.keyType, o = this._def.valueType; - for (const a in r.data) - s.push({ - key: i._parse(new mt(r, a, r.path, a)), - value: o._parse(new mt(r, r.data[a], r.path, a)), - alwaysSet: a in r.data - }); - return r.common.async ? Be.mergeObjectAsync(t, s) : Be.mergeObjectSync(t, s); - } - get element() { - return this._def.valueType; - } - static create(e, t, r) { - return t instanceof ee ? new yr({ - keyType: e, - valueType: t, - typeName: V.ZodRecord, - ...J(r) - }) : new yr({ - keyType: nt.create(), - valueType: e, - typeName: V.ZodRecord, - ...J(t) - }); - } -} -class os extends ee { - get keySchema() { - return this._def.keyType; - } - get valueSchema() { - return this._def.valueType; - } - _parse(e) { - const { status: t, ctx: r } = this._processInputParams(e); - if (r.parsedType !== H.map) - return U(r, { - code: O.invalid_type, - expected: H.map, - received: r.parsedType - }), K; - const s = this._def.keyType, i = this._def.valueType, o = [...r.data.entries()].map(([a, c], l) => ({ - key: s._parse(new mt(r, a, r.path, [l, "key"])), - value: i._parse(new mt(r, c, r.path, [l, "value"])) - })); - if (r.common.async) { - const a = /* @__PURE__ */ new Map(); - return Promise.resolve().then(async () => { - for (const c of o) { - const l = await c.key, d = await c.value; - if (l.status === "aborted" || d.status === "aborted") - return K; - (l.status === "dirty" || d.status === "dirty") && t.dirty(), a.set(l.value, d.value); - } - return { status: t.value, value: a }; - }); - } else { - const a = /* @__PURE__ */ new Map(); - for (const c of o) { - const l = c.key, d = c.value; - if (l.status === "aborted" || d.status === "aborted") - return K; - (l.status === "dirty" || d.status === "dirty") && t.dirty(), a.set(l.value, d.value); - } - return { status: t.value, value: a }; - } - } -} -os.create = (n, e, t) => new os({ - valueType: e, - keyType: n, - typeName: V.ZodMap, - ...J(t) -}); -class xn extends ee { - _parse(e) { - const { status: t, ctx: r } = this._processInputParams(e); - if (r.parsedType !== H.set) - return U(r, { - code: O.invalid_type, - expected: H.set, - received: r.parsedType - }), K; - const s = this._def; - s.minSize !== null && r.data.size < s.minSize.value && (U(r, { - code: O.too_small, - minimum: s.minSize.value, - type: "set", - inclusive: !0, - exact: !1, - message: s.minSize.message - }), t.dirty()), s.maxSize !== null && r.data.size > s.maxSize.value && (U(r, { - code: O.too_big, - maximum: s.maxSize.value, - type: "set", - inclusive: !0, - exact: !1, - message: s.maxSize.message - }), t.dirty()); - const i = this._def.valueType; - function o(c) { - const l = /* @__PURE__ */ new Set(); - for (const d of c) { - if (d.status === "aborted") - return K; - d.status === "dirty" && t.dirty(), l.add(d.value); - } - return { status: t.value, value: l }; - } - const a = [...r.data.values()].map((c, l) => i._parse(new mt(r, c, r.path, l))); - return r.common.async ? Promise.all(a).then((c) => o(c)) : o(a); - } - min(e, t) { - return new xn({ - ...this._def, - minSize: { value: e, message: D.toString(t) } - }); - } - max(e, t) { - return new xn({ - ...this._def, - maxSize: { value: e, message: D.toString(t) } - }); - } - size(e, t) { - return this.min(e, t).max(e, t); - } - nonempty(e) { - return this.min(1, e); - } -} -xn.create = (n, e) => new xn({ - valueType: n, - minSize: null, - maxSize: null, - typeName: V.ZodSet, - ...J(e) -}); -class In extends ee { - constructor() { - super(...arguments), this.validate = this.implement; - } - _parse(e) { - const { ctx: t } = this._processInputParams(e); - if (t.parsedType !== H.function) - return U(t, { - code: O.invalid_type, - expected: H.function, - received: t.parsedType - }), K; - function r(a, c) { - return ns({ - data: a, - path: t.path, - errorMaps: [ - t.common.contextualErrorMap, - t.schemaErrorMap, - ts(), - zn - ].filter((l) => !!l), - issueData: { - code: O.invalid_arguments, - argumentsError: c - } - }); - } - function s(a, c) { - return ns({ - data: a, - path: t.path, - errorMaps: [ - t.common.contextualErrorMap, - t.schemaErrorMap, - ts(), - zn - ].filter((l) => !!l), - issueData: { - code: O.invalid_return_type, - returnTypeError: c - } - }); - } - const i = { errorMap: t.common.contextualErrorMap }, o = t.data; - if (this._def.returns instanceof qn) { - const a = this; - return $e(async function(...c) { - const l = new Pe([]), d = await a._def.args.parseAsync(c, i).catch((m) => { - throw l.addIssue(r(c, m)), l; - }), u = await Reflect.apply(o, this, d); - return await a._def.returns._def.type.parseAsync(u, i).catch((m) => { - throw l.addIssue(s(u, m)), l; - }); - }); - } else { - const a = this; - return $e(function(...c) { - const l = a._def.args.safeParse(c, i); - if (!l.success) - throw new Pe([r(c, l.error)]); - const d = Reflect.apply(o, this, l.data), u = a._def.returns.safeParse(d, i); - if (!u.success) - throw new Pe([s(d, u.error)]); - return u.data; - }); - } - } - parameters() { - return this._def.args; - } - returnType() { - return this._def.returns; - } - args(...e) { - return new In({ - ...this._def, - args: wt.create(e).rest(gn.create()) - }); - } - returns(e) { - return new In({ - ...this._def, - returns: e - }); - } - implement(e) { - return this.parse(e); - } - strictImplement(e) { - return this.parse(e); - } - static create(e, t, r) { - return new In({ - args: e || wt.create([]).rest(gn.create()), - returns: t || gn.create(), - typeName: V.ZodFunction, - ...J(r) - }); - } -} -class mr extends ee { - get schema() { - return this._def.getter(); - } - _parse(e) { - const { ctx: t } = this._processInputParams(e); - return this._def.getter()._parse({ data: t.data, path: t.path, parent: t }); - } -} -mr.create = (n, e) => new mr({ - getter: n, - typeName: V.ZodLazy, - ...J(e) -}); -class wr extends ee { - _parse(e) { - if (e.data !== this._def.value) { - const t = this._getOrReturnCtx(e); - return U(t, { - received: t.data, - code: O.invalid_literal, - expected: this._def.value - }), K; - } - return { status: "valid", value: e.data }; - } - get value() { - return this._def.value; - } -} -wr.create = (n, e) => new wr({ - value: n, - typeName: V.ZodLiteral, - ...J(e) -}); -function Hc(n, e) { - return new rn({ - values: n, - typeName: V.ZodEnum, - ...J(e) - }); -} -class rn extends ee { - constructor() { - super(...arguments), nr.set(this, void 0); - } - _parse(e) { - if (typeof e.data != "string") { - const t = this._getOrReturnCtx(e), r = this._def.values; - return U(t, { - expected: re.joinValues(r), - received: t.parsedType, - code: O.invalid_type - }), K; - } - if (rs(this, nr) || Rc(this, nr, new Set(this._def.values)), !rs(this, nr).has(e.data)) { - const t = this._getOrReturnCtx(e), r = this._def.values; - return U(t, { - received: t.data, - code: O.invalid_enum_value, - options: r - }), K; - } - return $e(e.data); - } - get options() { - return this._def.values; - } - get enum() { - const e = {}; - for (const t of this._def.values) - e[t] = t; - return e; - } - get Values() { - const e = {}; - for (const t of this._def.values) - e[t] = t; - return e; - } - get Enum() { - const e = {}; - for (const t of this._def.values) - e[t] = t; - return e; - } - extract(e, t = this._def) { - return rn.create(e, { - ...this._def, - ...t - }); - } - exclude(e, t = this._def) { - return rn.create(this.options.filter((r) => !e.includes(r)), { - ...this._def, - ...t - }); - } -} -nr = /* @__PURE__ */ new WeakMap(); -rn.create = Hc; -class br extends ee { - constructor() { - super(...arguments), rr.set(this, void 0); - } - _parse(e) { - const t = re.getValidEnumValues(this._def.values), r = this._getOrReturnCtx(e); - if (r.parsedType !== H.string && r.parsedType !== H.number) { - const s = re.objectValues(t); - return U(r, { - expected: re.joinValues(s), - received: r.parsedType, - code: O.invalid_type - }), K; - } - if (rs(this, rr) || Rc(this, rr, new Set(re.getValidEnumValues(this._def.values))), !rs(this, rr).has(e.data)) { - const s = re.objectValues(t); - return U(r, { - received: r.data, - code: O.invalid_enum_value, - options: s - }), K; - } - return $e(e.data); - } - get enum() { - return this._def.values; - } -} -rr = /* @__PURE__ */ new WeakMap(); -br.create = (n, e) => new br({ - values: n, - typeName: V.ZodNativeEnum, - ...J(e) -}); -class qn extends ee { - unwrap() { - return this._def.type; - } - _parse(e) { - const { ctx: t } = this._processInputParams(e); - if (t.parsedType !== H.promise && t.common.async === !1) - return U(t, { - code: O.invalid_type, - expected: H.promise, - received: t.parsedType - }), K; - const r = t.parsedType === H.promise ? t.data : Promise.resolve(t.data); - return $e(r.then((s) => this._def.type.parseAsync(s, { - path: t.path, - errorMap: t.common.contextualErrorMap - }))); - } -} -qn.create = (n, e) => new qn({ - type: n, - typeName: V.ZodPromise, - ...J(e) -}); -class it extends ee { - innerType() { - return this._def.schema; - } - sourceType() { - return this._def.schema._def.typeName === V.ZodEffects ? this._def.schema.sourceType() : this._def.schema; - } - _parse(e) { - const { status: t, ctx: r } = this._processInputParams(e), s = this._def.effect || null, i = { - addIssue: (o) => { - U(r, o), o.fatal ? t.abort() : t.dirty(); - }, - get path() { - return r.path; - } - }; - if (i.addIssue = i.addIssue.bind(i), s.type === "preprocess") { - const o = s.transform(r.data, i); - if (r.common.async) - return Promise.resolve(o).then(async (a) => { - if (t.value === "aborted") - return K; - const c = await this._def.schema._parseAsync({ - data: a, - path: r.path, - parent: r - }); - return c.status === "aborted" ? K : c.status === "dirty" || t.value === "dirty" ? Bn(c.value) : c; - }); - { - if (t.value === "aborted") - return K; - const a = this._def.schema._parseSync({ - data: o, - path: r.path, - parent: r - }); - return a.status === "aborted" ? K : a.status === "dirty" || t.value === "dirty" ? Bn(a.value) : a; - } - } - if (s.type === "refinement") { - const o = (a) => { - const c = s.refinement(a, i); - if (r.common.async) - return Promise.resolve(c); - if (c instanceof Promise) - throw new Error("Async refinement encountered during synchronous parse operation. Use .parseAsync instead."); - return a; - }; - if (r.common.async === !1) { - const a = this._def.schema._parseSync({ - data: r.data, - path: r.path, - parent: r - }); - return a.status === "aborted" ? K : (a.status === "dirty" && t.dirty(), o(a.value), { status: t.value, value: a.value }); - } else - return this._def.schema._parseAsync({ data: r.data, path: r.path, parent: r }).then((a) => a.status === "aborted" ? K : (a.status === "dirty" && t.dirty(), o(a.value).then(() => ({ status: t.value, value: a.value })))); - } - if (s.type === "transform") - if (r.common.async === !1) { - const o = this._def.schema._parseSync({ - data: r.data, - path: r.path, - parent: r - }); - if (!lr(o)) - return o; - const a = s.transform(o.value, i); - if (a instanceof Promise) - throw new Error("Asynchronous transform encountered during synchronous parse operation. Use .parseAsync instead."); - return { status: t.value, value: a }; - } else - return this._def.schema._parseAsync({ data: r.data, path: r.path, parent: r }).then((o) => lr(o) ? Promise.resolve(s.transform(o.value, i)).then((a) => ({ status: t.value, value: a })) : o); - re.assertNever(s); - } -} -it.create = (n, e, t) => new it({ - schema: n, - typeName: V.ZodEffects, - effect: e, - ...J(t) -}); -it.createWithPreprocess = (n, e, t) => new it({ - schema: e, - effect: { type: "preprocess", transform: n }, - typeName: V.ZodEffects, - ...J(t) -}); -class yt extends ee { - _parse(e) { - return this._getType(e) === H.undefined ? $e(void 0) : this._def.innerType._parse(e); - } - unwrap() { - return this._def.innerType; - } -} -yt.create = (n, e) => new yt({ - innerType: n, - typeName: V.ZodOptional, - ...J(e) -}); -class sn extends ee { - _parse(e) { - return this._getType(e) === H.null ? $e(null) : this._def.innerType._parse(e); - } - unwrap() { - return this._def.innerType; - } -} -sn.create = (n, e) => new sn({ - innerType: n, - typeName: V.ZodNullable, - ...J(e) -}); -class vr extends ee { - _parse(e) { - const { ctx: t } = this._processInputParams(e); - let r = t.data; - return t.parsedType === H.undefined && (r = this._def.defaultValue()), this._def.innerType._parse({ - data: r, - path: t.path, - parent: t - }); - } - removeDefault() { - return this._def.innerType; - } -} -vr.create = (n, e) => new vr({ - innerType: n, - typeName: V.ZodDefault, - defaultValue: typeof e.default == "function" ? e.default : () => e.default, - ...J(e) -}); -class xr extends ee { - _parse(e) { - const { ctx: t } = this._processInputParams(e), r = { - ...t, - common: { - ...t.common, - issues: [] - } - }, s = this._def.innerType._parse({ - data: r.data, - path: r.path, - parent: { - ...r - } - }); - return ur(s) ? s.then((i) => ({ - status: "valid", - value: i.status === "valid" ? i.value : this._def.catchValue({ - get error() { - return new Pe(r.common.issues); - }, - input: r.data - }) - })) : { - status: "valid", - value: s.status === "valid" ? s.value : this._def.catchValue({ - get error() { - return new Pe(r.common.issues); - }, - input: r.data - }) - }; - } - removeCatch() { - return this._def.innerType; - } -} -xr.create = (n, e) => new xr({ - innerType: n, - typeName: V.ZodCatch, - catchValue: typeof e.catch == "function" ? e.catch : () => e.catch, - ...J(e) -}); -class as extends ee { - _parse(e) { - if (this._getType(e) !== H.nan) { - const r = this._getOrReturnCtx(e); - return U(r, { - code: O.invalid_type, - expected: H.nan, - received: r.parsedType - }), K; - } - return { status: "valid", value: e.data }; - } -} -as.create = (n) => new as({ - typeName: V.ZodNaN, - ...J(n) -}); -const rp = Symbol("zod_brand"); -class eo extends ee { - _parse(e) { - const { ctx: t } = this._processInputParams(e), r = t.data; - return this._def.type._parse({ - data: r, - path: t.path, - parent: t - }); - } - unwrap() { - return this._def.type; - } -} -class Rr extends ee { - _parse(e) { - const { status: t, ctx: r } = this._processInputParams(e); - if (r.common.async) - return (async () => { - const i = await this._def.in._parseAsync({ - data: r.data, - path: r.path, - parent: r - }); - return i.status === "aborted" ? K : i.status === "dirty" ? (t.dirty(), Bn(i.value)) : this._def.out._parseAsync({ - data: i.value, - path: r.path, - parent: r - }); - })(); - { - const s = this._def.in._parseSync({ - data: r.data, - path: r.path, - parent: r - }); - return s.status === "aborted" ? K : s.status === "dirty" ? (t.dirty(), { - status: "dirty", - value: s.value - }) : this._def.out._parseSync({ - data: s.value, - path: r.path, - parent: r - }); - } - } - static create(e, t) { - return new Rr({ - in: e, - out: t, - typeName: V.ZodPipeline - }); - } -} -class Er extends ee { - _parse(e) { - const t = this._def.innerType._parse(e), r = (s) => (lr(s) && (s.value = Object.freeze(s.value)), s); - return ur(t) ? t.then((s) => r(s)) : r(t); - } - unwrap() { - return this._def.innerType; - } -} -Er.create = (n, e) => new Er({ - innerType: n, - typeName: V.ZodReadonly, - ...J(e) -}); -function Mc(n, e = {}, t) { - return n ? Dn.create().superRefine((r, s) => { - var i, o; - if (!n(r)) { - const a = typeof e == "function" ? e(r) : typeof e == "string" ? { message: e } : e, c = (o = (i = a.fatal) !== null && i !== void 0 ? i : t) !== null && o !== void 0 ? o : !0, l = typeof a == "string" ? { message: a } : a; - s.addIssue({ code: "custom", ...l, fatal: c }); - } - }) : Dn.create(); -} -const sp = { - object: le.lazycreate -}; -var V; -(function(n) { - n.ZodString = "ZodString", n.ZodNumber = "ZodNumber", n.ZodNaN = "ZodNaN", n.ZodBigInt = "ZodBigInt", n.ZodBoolean = "ZodBoolean", n.ZodDate = "ZodDate", n.ZodSymbol = "ZodSymbol", n.ZodUndefined = "ZodUndefined", n.ZodNull = "ZodNull", n.ZodAny = "ZodAny", n.ZodUnknown = "ZodUnknown", n.ZodNever = "ZodNever", n.ZodVoid = "ZodVoid", n.ZodArray = "ZodArray", n.ZodObject = "ZodObject", n.ZodUnion = "ZodUnion", n.ZodDiscriminatedUnion = "ZodDiscriminatedUnion", n.ZodIntersection = "ZodIntersection", n.ZodTuple = "ZodTuple", n.ZodRecord = "ZodRecord", n.ZodMap = "ZodMap", n.ZodSet = "ZodSet", n.ZodFunction = "ZodFunction", n.ZodLazy = "ZodLazy", n.ZodLiteral = "ZodLiteral", n.ZodEnum = "ZodEnum", n.ZodEffects = "ZodEffects", n.ZodNativeEnum = "ZodNativeEnum", n.ZodOptional = "ZodOptional", n.ZodNullable = "ZodNullable", n.ZodDefault = "ZodDefault", n.ZodCatch = "ZodCatch", n.ZodPromise = "ZodPromise", n.ZodBranded = "ZodBranded", n.ZodPipeline = "ZodPipeline", n.ZodReadonly = "ZodReadonly"; -})(V || (V = {})); -const ip = (n, e = { - message: `Input not instance of ${n.name}` -}) => Mc((t) => t instanceof n, e), jc = nt.create, Pc = tn.create, op = as.create, ap = nn.create, Zc = dr.create, cp = vn.create, lp = ss.create, up = hr.create, dp = fr.create, hp = Dn.create, fp = gn.create, pp = Rt.create, gp = is.create, yp = rt.create, mp = le.create, wp = le.strictCreate, bp = pr.create, vp = Ss.create, xp = gr.create, Ep = wt.create, _p = yr.create, Sp = os.create, kp = xn.create, Ap = In.create, Tp = mr.create, Bp = wr.create, Op = rn.create, Ip = br.create, Cp = qn.create, Lo = it.create, $p = yt.create, Rp = sn.create, Np = it.createWithPreprocess, Lp = Rr.create, Up = () => jc().optional(), Hp = () => Pc().optional(), Mp = () => Zc().optional(), jp = { - string: (n) => nt.create({ ...n, coerce: !0 }), - number: (n) => tn.create({ ...n, coerce: !0 }), - boolean: (n) => dr.create({ - ...n, - coerce: !0 - }), - bigint: (n) => nn.create({ ...n, coerce: !0 }), - date: (n) => vn.create({ ...n, coerce: !0 }) -}, Pp = K; -var $ = /* @__PURE__ */ Object.freeze({ - __proto__: null, - defaultErrorMap: zn, - setErrorMap: Pf, - getErrorMap: ts, - makeIssue: ns, - EMPTY_PATH: Zf, - addIssueToContext: U, - ParseStatus: Be, - INVALID: K, - DIRTY: Bn, - OK: $e, - isAborted: yi, - isDirty: mi, - isValid: lr, - isAsync: ur, - get util() { - return re; - }, - get objectUtil() { - return gi; - }, - ZodParsedType: H, - getParsedType: Yt, - ZodType: ee, - datetimeRegex: Uc, - ZodString: nt, - ZodNumber: tn, - ZodBigInt: nn, - ZodBoolean: dr, - ZodDate: vn, - ZodSymbol: ss, - ZodUndefined: hr, - ZodNull: fr, - ZodAny: Dn, - ZodUnknown: gn, - ZodNever: Rt, - ZodVoid: is, - ZodArray: rt, - ZodObject: le, - ZodUnion: pr, - ZodDiscriminatedUnion: Ss, - ZodIntersection: gr, - ZodTuple: wt, - ZodRecord: yr, - ZodMap: os, - ZodSet: xn, - ZodFunction: In, - ZodLazy: mr, - ZodLiteral: wr, - ZodEnum: rn, - ZodNativeEnum: br, - ZodPromise: qn, - ZodEffects: it, - ZodTransformer: it, - ZodOptional: yt, - ZodNullable: sn, - ZodDefault: vr, - ZodCatch: xr, - ZodNaN: as, - BRAND: rp, - ZodBranded: eo, - ZodPipeline: Rr, - ZodReadonly: Er, - custom: Mc, - Schema: ee, - ZodSchema: ee, - late: sp, - get ZodFirstPartyTypeKind() { - return V; - }, - coerce: jp, - any: hp, - array: yp, - bigint: ap, - boolean: Zc, - date: cp, - discriminatedUnion: vp, - effect: Lo, - enum: Op, - function: Ap, - instanceof: ip, - intersection: xp, - lazy: Tp, - literal: Bp, - map: Sp, - nan: op, - nativeEnum: Ip, - never: pp, - null: dp, - nullable: Rp, - number: Pc, - object: mp, - oboolean: Mp, - onumber: Hp, - optional: $p, - ostring: Up, - pipeline: Lp, - preprocess: Np, - promise: Cp, - record: _p, - set: kp, - strictObject: wp, - string: jc, - symbol: lp, - transformer: Lo, - tuple: Ep, - undefined: up, - union: bp, - unknown: fp, - void: gp, - NEVER: Pp, - ZodIssueCode: O, - quotelessJson: jf, - ZodError: Pe -}); -class ne { - /** Schema to validate Nostr hex IDs such as event IDs and pubkeys. */ - static id() { - return $.string().regex(/^[0-9a-f]{64}$/); - } - /** Nostr event schema. */ - static event() { - return $.object({ - id: ne.id(), - kind: $.number().int().nonnegative(), - pubkey: ne.id(), - tags: $.string().array().array(), - content: $.string(), - created_at: $.number().int().nonnegative(), - sig: $.string() - }); - } - /** Nostr filter schema. */ - static filter() { - return $.object({ - kinds: $.number().int().nonnegative().array().optional(), - ids: ne.id().array().optional(), - authors: ne.id().array().optional(), - since: $.number().int().nonnegative().optional(), - until: $.number().int().nonnegative().optional(), - limit: $.number().int().nonnegative().optional(), - search: $.string().optional() - }).passthrough().transform((e) => { - const t = [ - "kinds", - "ids", - "authors", - "since", - "until", - "limit", - "search" - ]; - return Object.entries(e).reduce((r, [s, i]) => ((t.includes(s) || s.startsWith("#")) && (r[s] = i), r), {}); - }); - } - /** - * Bech32 string. - * @see https://github.com/bitcoin/bips/blob/master/bip-0173.mediawiki#bech32 - */ - static bech32(e) { - return $.string().regex(/^[\x21-\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}$/).refine((t) => e ? t.startsWith(`${e}1`) : !0); - } - /** NIP-01 `EVENT` message from client to relay. */ - static clientEVENT() { - return $.tuple([ - $.literal("EVENT"), - ne.event() - ]); - } - /** NIP-01 `REQ` message from client to relay. */ - static clientREQ() { - return $.tuple([ - $.literal("REQ"), - $.string() - ]).rest(ne.filter()); - } - /** NIP-45 `COUNT` message from client to relay. */ - static clientCOUNT() { - return $.tuple([ - $.literal("COUNT"), - $.string() - ]).rest(ne.filter()); - } - /** NIP-01 `CLOSE` message from client to relay. */ - static clientCLOSE() { - return $.tuple([ - $.literal("CLOSE"), - $.string() - ]); - } - /** NIP-42 `AUTH` message from client to relay. */ - static clientAUTH() { - return $.tuple([ - $.literal("AUTH"), - ne.event() - ]); - } - /** NIP-01 message from client to relay. */ - static clientMsg() { - return $.union([ - ne.clientEVENT(), - ne.clientREQ(), - ne.clientCOUNT(), - ne.clientCLOSE(), - ne.clientAUTH() - ]); - } - /** NIP-01 `EVENT` message from relay to client. */ - static relayEVENT() { - return $.tuple([ - $.literal("EVENT"), - $.string(), - ne.event() - ]); - } - /** NIP-01 `OK` message from relay to client. */ - static relayOK() { - return $.tuple([ - $.literal("OK"), - ne.id(), - $.boolean(), - $.string() - ]); - } - /** NIP-01 `EOSE` message from relay to client. */ - static relayEOSE() { - return $.tuple([ - $.literal("EOSE"), - $.string() - ]); - } - /** NIP-01 `NOTICE` message from relay to client. */ - static relayNOTICE() { - return $.tuple([ - $.literal("NOTICE"), - $.string() - ]); - } - /** NIP-01 `CLOSED` message from relay to client. */ - static relayCLOSED() { - return $.tuple([ - $.literal("CLOSED"), - $.string(), - $.string() - ]); - } - /** NIP-42 `AUTH` message from relay to client. */ - static relayAUTH() { - return $.tuple([ - $.literal("AUTH"), - $.string() - ]); - } - /** NIP-45 `COUNT` message from relay to client. */ - static relayCOUNT() { - return $.tuple([ - $.literal("COUNT"), - $.string(), - $.object({ - count: $.number().int().nonnegative(), - approximate: $.boolean().optional() - }) - ]); - } - /** NIP-01 message from relay to client. */ - static relayMsg() { - return $.union([ - ne.relayEVENT(), - ne.relayOK(), - ne.relayEOSE(), - ne.relayNOTICE(), - ne.relayCLOSED(), - ne.relayAUTH(), - ne.relayCOUNT() - ]); - } - /** Kind 0 content schema. */ - static metadata() { - return $.object({ - about: $.string().optional().catch(void 0), - banner: $.string().url().optional().catch(void 0), - bot: $.boolean().optional().catch(void 0), - display_name: $.string().optional().catch(void 0), - lud06: ne.bech32("lnurl").optional().catch(void 0), - lud16: $.string().email().optional().catch(void 0), - name: $.string().optional().catch(void 0), - nip05: $.string().email().optional().catch(void 0), - picture: $.string().url().optional().catch(void 0), - website: $.string().url().optional().catch(void 0) - }).passthrough(); - } - /** NIP-46 request content schema. */ - static connectRequest() { - return $.object({ - id: $.string(), - method: $.string(), - params: $.string().array() - }); - } - /** NIP-46 response content schema. */ - static connectResponse() { - return $.object({ - id: $.string(), - result: $.string(), - error: $.string().optional() - }); - } - /** - * Helper schema to parse a JSON string. It should then be piped into another schema. For example: - * - * ```ts - * const event = NSchema.json().pipe(NSchema.event()).parse(data); - * ``` - */ - static json() { - return $.string().transform((e, t) => { - try { - return JSON.parse(e); - } catch { - return t.addIssue({ - code: $.ZodIssueCode.custom, - message: "Invalid JSON" - }), $.NEVER; - } - }); - } -} -class Zp { - constructor({ relay: e, pubkey: t, signer: r, timeout: s, encryption: i = "nip04" }) { - B(this, "relay"); - B(this, "pubkey"); - B(this, "signer"); - B(this, "timeout"); - B(this, "encryption"); - B(this, "nip04", { - encrypt: async (e, t) => this.cmd("nip04_encrypt", [ - e, - t - ]), - decrypt: async (e, t) => this.cmd("nip04_decrypt", [ - e, - t - ]) - }); - B(this, "nip44", { - encrypt: async (e, t) => this.cmd("nip44_encrypt", [ - e, - t - ]), - decrypt: async (e, t) => this.cmd("nip44_decrypt", [ - e, - t - ]) - }); - this.relay = e, this.pubkey = t, this.signer = r, this.timeout = s, this.encryption = i; - } - async getPublicKey() { - return this.cmd("get_public_key", []); - } - async signEvent(e) { - const t = await this.cmd("sign_event", [ - JSON.stringify(e) - ]); - return ne.json().pipe(ne.event()).parse(t); - } - async getRelays() { - const e = await this.cmd("get_relays", []); - return ne.json().pipe($.record($.string(), $.object({ - read: $.boolean(), - write: $.boolean() - }))).parse(e); - } - /** Send a `connect` command to the relay. It should respond with `ack`. */ - async connect(e) { - const t = [ - this.pubkey - ]; - return e && t.push(e), this.cmd("connect", t); - } - /** Send a `ping` command to the signer. It should respond with `pong`. */ - async ping() { - return this.cmd("ping", []); - } - /** High-level RPC method. Returns the string result, or throws on error. */ - async cmd(e, t) { - const r = typeof this.timeout == "number" ? AbortSignal.timeout(this.timeout) : void 0, { result: s, error: i } = await this.send({ - id: crypto.randomUUID(), - method: e, - params: t - }, { - signal: r - }); - if (i) - throw new Error(i); - return s; - } - /** Low-level send method. Deals directly with connect request/response. */ - async send(e, t = {}) { - const { signal: r } = t, s = await this.signer.signEvent({ - kind: 24133, - content: await this.encrypt(this.pubkey, JSON.stringify(e)), - created_at: Math.floor(Date.now() / 1e3), - tags: [ - [ - "p", - this.pubkey - ] - ] - }), i = await this.signer.getPublicKey(), o = this.relay.req([ - { - kinds: [ - 24133 - ], - authors: [ - this.pubkey - ], - "#p": [ - i - ] - } - ], { - signal: r - }); - await this.relay.event(s, { - signal: r - }); - for await (const a of o) { - if (a[0] === "CLOSED") throw new Error("Subscription closed"); - if (a[0] === "EVENT") { - const c = a[2], l = await this.decrypt(this.pubkey, c.content), d = ne.json().pipe(ne.connectResponse()).parse(l); - if (d.id === e.id) - return d; - } - } - throw new Error("Unreachable"); - } - /** Local encrypt depending on settings. */ - async encrypt(e, t) { - switch (this.encryption) { - case "nip04": - return this.signer.nip04.encrypt(e, t); - case "nip44": - return this.signer.nip44.encrypt(e, t); - } - } - /** Local decrypt depending on settings. */ - async decrypt(e, t) { - switch (this.encryption) { - case "nip04": - return this.signer.nip04.decrypt(e, t); - case "nip44": - return this.signer.nip44.decrypt(e, t); - } - } -} -function or(n) { - if (!Number.isSafeInteger(n) || n < 0) - throw new Error(`positive integer expected, not ${n}`); -} -function zp(n) { - return n instanceof Uint8Array || n != null && typeof n == "object" && n.constructor.name === "Uint8Array"; -} -function ft(n, ...e) { - if (!zp(n)) - throw new Error("Uint8Array expected"); - if (e.length > 0 && !e.includes(n.length)) - throw new Error(`Uint8Array expected of length ${e}, not of length=${n.length}`); -} -function zc(n) { - if (typeof n != "function" || typeof n.create != "function") - throw new Error("Hash should be wrapped by utils.wrapConstructor"); - or(n.outputLen), or(n.blockLen); -} -function cs(n, e = !0) { - if (n.destroyed) - throw new Error("Hash instance has been destroyed"); - if (e && n.finished) - throw new Error("Hash#digest() has already been called"); -} -function Dp(n, e) { - ft(n); - const t = e.outputLen; - if (n.length < t) - throw new Error(`digestInto() expects output buffer of length at least ${t}`); -} -const kn = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0; -/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const yn = (n) => new DataView(n.buffer, n.byteOffset, n.byteLength), ct = (n, e) => n << 32 - e | n >>> e, jr = (n, e) => n << e | n >>> 32 - e >>> 0; -new Uint8Array(new Uint32Array([287454020]).buffer)[0]; -const qp = /* @__PURE__ */ Array.from({ length: 256 }, (n, e) => e.toString(16).padStart(2, "0")); -function Vp(n) { - ft(n); - let e = ""; - for (let t = 0; t < n.length; t++) - e += qp[n[t]]; - return e; -} -const Et = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 }; -function Uo(n) { - if (n >= Et._0 && n <= Et._9) - return n - Et._0; - if (n >= Et._A && n <= Et._F) - return n - (Et._A - 10); - if (n >= Et._a && n <= Et._f) - return n - (Et._a - 10); -} -function Kp(n) { - if (typeof n != "string") - throw new Error("hex string expected, got " + typeof n); - const e = n.length, t = e / 2; - if (e % 2) - throw new Error("padded hex string expected, got unpadded hex of length " + e); - const r = new Uint8Array(t); - for (let s = 0, i = 0; s < t; s++, i += 2) { - const o = Uo(n.charCodeAt(i)), a = Uo(n.charCodeAt(i + 1)); - if (o === void 0 || a === void 0) { - const c = n[i] + n[i + 1]; - throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i); - } - r[s] = o * 16 + a; - } - return r; -} -function Dc(n) { - if (typeof n != "string") - throw new Error(`utf8ToBytes expected string, got ${typeof n}`); - return new Uint8Array(new TextEncoder().encode(n)); -} -function _r(n) { - return typeof n == "string" && (n = Dc(n)), ft(n), n; -} -function sr(...n) { - let e = 0; - for (let r = 0; r < n.length; r++) { - const s = n[r]; - ft(s), e += s.length; - } - const t = new Uint8Array(e); - for (let r = 0, s = 0; r < n.length; r++) { - const i = n[r]; - t.set(i, s), s += i.length; - } - return t; -} -class qc { - // Safe version that clones internal state - clone() { - return this._cloneInto(); - } -} -const Wp = {}.toString; -function Fp(n, e) { - if (e !== void 0 && Wp.call(e) !== "[object Object]") - throw new Error("Options should be object or undefined"); - return Object.assign(n, e); -} -function to(n) { - const e = (r) => n().update(_r(r)).digest(), t = n(); - return e.outputLen = t.outputLen, e.blockLen = t.blockLen, e.create = () => n(), e; -} -function Gp(n = 32) { - if (kn && typeof kn.getRandomValues == "function") - return kn.getRandomValues(new Uint8Array(n)); - if (kn && typeof kn.randomBytes == "function") - return kn.randomBytes(n); - throw new Error("crypto.getRandomValues must be defined"); -} -class Vc extends qc { - constructor(e, t) { - super(), this.finished = !1, this.destroyed = !1, zc(e); - const r = _r(t); - if (this.iHash = e.create(), typeof this.iHash.update != "function") - throw new Error("Expected instance of class which extends utils.Hash"); - this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen; - const s = this.blockLen, i = new Uint8Array(s); - i.set(r.length > s ? e.create().update(r).digest() : r); - for (let o = 0; o < i.length; o++) - i[o] ^= 54; - this.iHash.update(i), this.oHash = e.create(); - for (let o = 0; o < i.length; o++) - i[o] ^= 106; - this.oHash.update(i), i.fill(0); - } - update(e) { - return cs(this), this.iHash.update(e), this; - } - digestInto(e) { - cs(this), ft(e, this.outputLen), this.finished = !0, this.iHash.digestInto(e), this.oHash.update(e), this.oHash.digestInto(e), this.destroy(); - } - digest() { - const e = new Uint8Array(this.oHash.outputLen); - return this.digestInto(e), e; - } - _cloneInto(e) { - e || (e = Object.create(Object.getPrototypeOf(this), {})); - const { oHash: t, iHash: r, finished: s, destroyed: i, blockLen: o, outputLen: a } = this; - return e = e, e.finished = s, e.destroyed = i, e.blockLen = o, e.outputLen = a, e.oHash = t._cloneInto(e.oHash), e.iHash = r._cloneInto(e.iHash), e; - } - destroy() { - this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy(); - } -} -const Sr = (n, e, t) => new Vc(n, e).update(t).digest(); -Sr.create = (n, e) => new Vc(n, e); -function Yp(n, e, t, r) { - if (typeof n.setBigUint64 == "function") - return n.setBigUint64(e, t, r); - const s = BigInt(32), i = BigInt(4294967295), o = Number(t >> s & i), a = Number(t & i), c = r ? 4 : 0, l = r ? 0 : 4; - n.setUint32(e + c, o, r), n.setUint32(e + l, a, r); -} -const Jp = (n, e, t) => n & e ^ ~n & t, Xp = (n, e, t) => n & e ^ n & t ^ e & t; -class no extends qc { - constructor(e, t, r, s) { - super(), this.blockLen = e, this.outputLen = t, this.padOffset = r, this.isLE = s, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = yn(this.buffer); - } - update(e) { - cs(this); - const { view: t, buffer: r, blockLen: s } = this; - e = _r(e); - const i = e.length; - for (let o = 0; o < i; ) { - const a = Math.min(s - this.pos, i - o); - if (a === s) { - const c = yn(e); - for (; s <= i - o; o += s) - this.process(c, o); - continue; - } - r.set(e.subarray(o, o + a), this.pos), this.pos += a, o += a, this.pos === s && (this.process(t, 0), this.pos = 0); - } - return this.length += e.length, this.roundClean(), this; - } - digestInto(e) { - cs(this), Dp(e, this), this.finished = !0; - const { buffer: t, view: r, blockLen: s, isLE: i } = this; - let { pos: o } = this; - t[o++] = 128, this.buffer.subarray(o).fill(0), this.padOffset > s - o && (this.process(r, 0), o = 0); - for (let u = o; u < s; u++) - t[u] = 0; - Yp(r, s - 8, BigInt(this.length * 8), i), this.process(r, 0); - const a = yn(e), c = this.outputLen; - if (c % 4) - throw new Error("_sha2: outputLen should be aligned to 32bit"); - const l = c / 4, d = this.get(); - if (l > d.length) - throw new Error("_sha2: outputLen bigger than state"); - for (let u = 0; u < l; u++) - a.setUint32(4 * u, d[u], i); - } - digest() { - const { buffer: e, outputLen: t } = this; - this.digestInto(e); - const r = e.slice(0, t); - return this.destroy(), r; - } - _cloneInto(e) { - e || (e = new this.constructor()), e.set(...this.get()); - const { blockLen: t, buffer: r, length: s, finished: i, destroyed: o, pos: a } = this; - return e.length = s, e.pos = a, e.finished = i, e.destroyed = o, s % t && e.buffer.set(r), e; - } -} -const Qp = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]), Kc = /* @__PURE__ */ new Uint8Array(new Array(16).fill(0).map((n, e) => e)), e0 = /* @__PURE__ */ Kc.map((n) => (9 * n + 5) % 16); -let ro = [Kc], so = [e0]; -for (let n = 0; n < 4; n++) - for (let e of [ro, so]) - e.push(e[n].map((t) => Qp[t])); -const Wc = /* @__PURE__ */ [ - [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8], - [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7], - [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9], - [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6], - [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5] -].map((n) => new Uint8Array(n)), t0 = /* @__PURE__ */ ro.map((n, e) => n.map((t) => Wc[e][t])), n0 = /* @__PURE__ */ so.map((n, e) => n.map((t) => Wc[e][t])), r0 = /* @__PURE__ */ new Uint32Array([ - 0, - 1518500249, - 1859775393, - 2400959708, - 2840853838 -]), s0 = /* @__PURE__ */ new Uint32Array([ - 1352829926, - 1548603684, - 1836072691, - 2053994217, - 0 -]); -function Ho(n, e, t, r) { - return n === 0 ? e ^ t ^ r : n === 1 ? e & t | ~e & r : n === 2 ? (e | ~t) ^ r : n === 3 ? e & r | t & ~r : e ^ (t | ~r); -} -const Pr = /* @__PURE__ */ new Uint32Array(16); -class i0 extends no { - constructor() { - super(64, 20, 8, !0), this.h0 = 1732584193, this.h1 = -271733879, this.h2 = -1732584194, this.h3 = 271733878, this.h4 = -1009589776; - } - get() { - const { h0: e, h1: t, h2: r, h3: s, h4: i } = this; - return [e, t, r, s, i]; - } - set(e, t, r, s, i) { - this.h0 = e | 0, this.h1 = t | 0, this.h2 = r | 0, this.h3 = s | 0, this.h4 = i | 0; - } - process(e, t) { - for (let m = 0; m < 16; m++, t += 4) - Pr[m] = e.getUint32(t, !0); - let r = this.h0 | 0, s = r, i = this.h1 | 0, o = i, a = this.h2 | 0, c = a, l = this.h3 | 0, d = l, u = this.h4 | 0, f = u; - for (let m = 0; m < 5; m++) { - const b = 4 - m, g = r0[m], p = s0[m], y = ro[m], w = so[m], x = t0[m], A = n0[m]; - for (let T = 0; T < 16; T++) { - const _ = jr(r + Ho(m, i, a, l) + Pr[y[T]] + g, x[T]) + u | 0; - r = u, u = l, l = jr(a, 10) | 0, a = i, i = _; - } - for (let T = 0; T < 16; T++) { - const _ = jr(s + Ho(b, o, c, d) + Pr[w[T]] + p, A[T]) + f | 0; - s = f, f = d, d = jr(c, 10) | 0, c = o, o = _; - } - } - this.set(this.h1 + a + d | 0, this.h2 + l + f | 0, this.h3 + u + s | 0, this.h4 + r + o | 0, this.h0 + i + c | 0); - } - roundClean() { - Pr.fill(0); - } - destroy() { - this.destroyed = !0, this.buffer.fill(0), this.set(0, 0, 0, 0, 0); - } -} -const o0 = /* @__PURE__ */ to(() => new i0()), a0 = /* @__PURE__ */ new Uint32Array([ - 1116352408, - 1899447441, - 3049323471, - 3921009573, - 961987163, - 1508970993, - 2453635748, - 2870763221, - 3624381080, - 310598401, - 607225278, - 1426881987, - 1925078388, - 2162078206, - 2614888103, - 3248222580, - 3835390401, - 4022224774, - 264347078, - 604807628, - 770255983, - 1249150122, - 1555081692, - 1996064986, - 2554220882, - 2821834349, - 2952996808, - 3210313671, - 3336571891, - 3584528711, - 113926993, - 338241895, - 666307205, - 773529912, - 1294757372, - 1396182291, - 1695183700, - 1986661051, - 2177026350, - 2456956037, - 2730485921, - 2820302411, - 3259730800, - 3345764771, - 3516065817, - 3600352804, - 4094571909, - 275423344, - 430227734, - 506948616, - 659060556, - 883997877, - 958139571, - 1322822218, - 1537002063, - 1747873779, - 1955562222, - 2024104815, - 2227730452, - 2361852424, - 2428436474, - 2756734187, - 3204031479, - 3329325298 -]), zt = /* @__PURE__ */ new Uint32Array([ - 1779033703, - 3144134277, - 1013904242, - 2773480762, - 1359893119, - 2600822924, - 528734635, - 1541459225 -]), Dt = /* @__PURE__ */ new Uint32Array(64); -class c0 extends no { - constructor() { - super(64, 32, 8, !1), this.A = zt[0] | 0, this.B = zt[1] | 0, this.C = zt[2] | 0, this.D = zt[3] | 0, this.E = zt[4] | 0, this.F = zt[5] | 0, this.G = zt[6] | 0, this.H = zt[7] | 0; - } - get() { - const { A: e, B: t, C: r, D: s, E: i, F: o, G: a, H: c } = this; - return [e, t, r, s, i, o, a, c]; - } - // prettier-ignore - set(e, t, r, s, i, o, a, c) { - this.A = e | 0, this.B = t | 0, this.C = r | 0, this.D = s | 0, this.E = i | 0, this.F = o | 0, this.G = a | 0, this.H = c | 0; - } - process(e, t) { - for (let u = 0; u < 16; u++, t += 4) - Dt[u] = e.getUint32(t, !1); - for (let u = 16; u < 64; u++) { - const f = Dt[u - 15], m = Dt[u - 2], b = ct(f, 7) ^ ct(f, 18) ^ f >>> 3, g = ct(m, 17) ^ ct(m, 19) ^ m >>> 10; - Dt[u] = g + Dt[u - 7] + b + Dt[u - 16] | 0; - } - let { A: r, B: s, C: i, D: o, E: a, F: c, G: l, H: d } = this; - for (let u = 0; u < 64; u++) { - const f = ct(a, 6) ^ ct(a, 11) ^ ct(a, 25), m = d + f + Jp(a, c, l) + a0[u] + Dt[u] | 0, g = (ct(r, 2) ^ ct(r, 13) ^ ct(r, 22)) + Xp(r, s, i) | 0; - d = l, l = c, c = a, a = o + m | 0, o = i, i = s, s = r, r = m + g | 0; - } - r = r + this.A | 0, s = s + this.B | 0, i = i + this.C | 0, o = o + this.D | 0, a = a + this.E | 0, c = c + this.F | 0, l = l + this.G | 0, d = d + this.H | 0, this.set(r, s, i, o, a, c, l, d); - } - roundClean() { - Dt.fill(0); - } - destroy() { - this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0); - } -} -const io = /* @__PURE__ */ to(() => new c0()), Zr = /* @__PURE__ */ BigInt(2 ** 32 - 1), bi = /* @__PURE__ */ BigInt(32); -function Fc(n, e = !1) { - return e ? { h: Number(n & Zr), l: Number(n >> bi & Zr) } : { h: Number(n >> bi & Zr) | 0, l: Number(n & Zr) | 0 }; -} -function l0(n, e = !1) { - let t = new Uint32Array(n.length), r = new Uint32Array(n.length); - for (let s = 0; s < n.length; s++) { - const { h: i, l: o } = Fc(n[s], e); - [t[s], r[s]] = [i, o]; - } - return [t, r]; -} -const u0 = (n, e) => BigInt(n >>> 0) << bi | BigInt(e >>> 0), d0 = (n, e, t) => n >>> t, h0 = (n, e, t) => n << 32 - t | e >>> t, f0 = (n, e, t) => n >>> t | e << 32 - t, p0 = (n, e, t) => n << 32 - t | e >>> t, g0 = (n, e, t) => n << 64 - t | e >>> t - 32, y0 = (n, e, t) => n >>> t - 32 | e << 64 - t, m0 = (n, e) => e, w0 = (n, e) => n, b0 = (n, e, t) => n << t | e >>> 32 - t, v0 = (n, e, t) => e << t | n >>> 32 - t, x0 = (n, e, t) => e << t - 32 | n >>> 64 - t, E0 = (n, e, t) => n << t - 32 | e >>> 64 - t; -function _0(n, e, t, r) { - const s = (e >>> 0) + (r >>> 0); - return { h: n + t + (s / 2 ** 32 | 0) | 0, l: s | 0 }; -} -const S0 = (n, e, t) => (n >>> 0) + (e >>> 0) + (t >>> 0), k0 = (n, e, t, r) => e + t + r + (n / 2 ** 32 | 0) | 0, A0 = (n, e, t, r) => (n >>> 0) + (e >>> 0) + (t >>> 0) + (r >>> 0), T0 = (n, e, t, r, s) => e + t + r + s + (n / 2 ** 32 | 0) | 0, B0 = (n, e, t, r, s) => (n >>> 0) + (e >>> 0) + (t >>> 0) + (r >>> 0) + (s >>> 0), O0 = (n, e, t, r, s, i) => e + t + r + s + i + (n / 2 ** 32 | 0) | 0, Q = { - fromBig: Fc, - split: l0, - toBig: u0, - shrSH: d0, - shrSL: h0, - rotrSH: f0, - rotrSL: p0, - rotrBH: g0, - rotrBL: y0, - rotr32H: m0, - rotr32L: w0, - rotlSH: b0, - rotlSL: v0, - rotlBH: x0, - rotlBL: E0, - add: _0, - add3L: S0, - add3H: k0, - add4L: A0, - add4H: T0, - add5H: O0, - add5L: B0 -}, [I0, C0] = Q.split([ - "0x428a2f98d728ae22", - "0x7137449123ef65cd", - "0xb5c0fbcfec4d3b2f", - "0xe9b5dba58189dbbc", - "0x3956c25bf348b538", - "0x59f111f1b605d019", - "0x923f82a4af194f9b", - "0xab1c5ed5da6d8118", - "0xd807aa98a3030242", - "0x12835b0145706fbe", - "0x243185be4ee4b28c", - "0x550c7dc3d5ffb4e2", - "0x72be5d74f27b896f", - "0x80deb1fe3b1696b1", - "0x9bdc06a725c71235", - "0xc19bf174cf692694", - "0xe49b69c19ef14ad2", - "0xefbe4786384f25e3", - "0x0fc19dc68b8cd5b5", - "0x240ca1cc77ac9c65", - "0x2de92c6f592b0275", - "0x4a7484aa6ea6e483", - "0x5cb0a9dcbd41fbd4", - "0x76f988da831153b5", - "0x983e5152ee66dfab", - "0xa831c66d2db43210", - "0xb00327c898fb213f", - "0xbf597fc7beef0ee4", - "0xc6e00bf33da88fc2", - "0xd5a79147930aa725", - "0x06ca6351e003826f", - "0x142929670a0e6e70", - "0x27b70a8546d22ffc", - "0x2e1b21385c26c926", - "0x4d2c6dfc5ac42aed", - "0x53380d139d95b3df", - "0x650a73548baf63de", - "0x766a0abb3c77b2a8", - "0x81c2c92e47edaee6", - "0x92722c851482353b", - "0xa2bfe8a14cf10364", - "0xa81a664bbc423001", - "0xc24b8b70d0f89791", - "0xc76c51a30654be30", - "0xd192e819d6ef5218", - "0xd69906245565a910", - "0xf40e35855771202a", - "0x106aa07032bbd1b8", - "0x19a4c116b8d2d0c8", - "0x1e376c085141ab53", - "0x2748774cdf8eeb99", - "0x34b0bcb5e19b48a8", - "0x391c0cb3c5c95a63", - "0x4ed8aa4ae3418acb", - "0x5b9cca4f7763e373", - "0x682e6ff3d6b2b8a3", - "0x748f82ee5defb2fc", - "0x78a5636f43172f60", - "0x84c87814a1f0ab72", - "0x8cc702081a6439ec", - "0x90befffa23631e28", - "0xa4506cebde82bde9", - "0xbef9a3f7b2c67915", - "0xc67178f2e372532b", - "0xca273eceea26619c", - "0xd186b8c721c0c207", - "0xeada7dd6cde0eb1e", - "0xf57d4f7fee6ed178", - "0x06f067aa72176fba", - "0x0a637dc5a2c898a6", - "0x113f9804bef90dae", - "0x1b710b35131c471b", - "0x28db77f523047d84", - "0x32caab7b40c72493", - "0x3c9ebe0a15c9bebc", - "0x431d67c49c100d4c", - "0x4cc5d4becb3e42b6", - "0x597f299cfc657e2a", - "0x5fcb6fab3ad6faec", - "0x6c44198c4a475817" -].map((n) => BigInt(n))), qt = /* @__PURE__ */ new Uint32Array(80), Vt = /* @__PURE__ */ new Uint32Array(80); -class $0 extends no { - constructor() { - super(128, 64, 16, !1), this.Ah = 1779033703, this.Al = -205731576, this.Bh = -1150833019, this.Bl = -2067093701, this.Ch = 1013904242, this.Cl = -23791573, this.Dh = -1521486534, this.Dl = 1595750129, this.Eh = 1359893119, this.El = -1377402159, this.Fh = -1694144372, this.Fl = 725511199, this.Gh = 528734635, this.Gl = -79577749, this.Hh = 1541459225, this.Hl = 327033209; - } - // prettier-ignore - get() { - const { Ah: e, Al: t, Bh: r, Bl: s, Ch: i, Cl: o, Dh: a, Dl: c, Eh: l, El: d, Fh: u, Fl: f, Gh: m, Gl: b, Hh: g, Hl: p } = this; - return [e, t, r, s, i, o, a, c, l, d, u, f, m, b, g, p]; - } - // prettier-ignore - set(e, t, r, s, i, o, a, c, l, d, u, f, m, b, g, p) { - this.Ah = e | 0, this.Al = t | 0, this.Bh = r | 0, this.Bl = s | 0, this.Ch = i | 0, this.Cl = o | 0, this.Dh = a | 0, this.Dl = c | 0, this.Eh = l | 0, this.El = d | 0, this.Fh = u | 0, this.Fl = f | 0, this.Gh = m | 0, this.Gl = b | 0, this.Hh = g | 0, this.Hl = p | 0; - } - process(e, t) { - for (let x = 0; x < 16; x++, t += 4) - qt[x] = e.getUint32(t), Vt[x] = e.getUint32(t += 4); - for (let x = 16; x < 80; x++) { - const A = qt[x - 15] | 0, T = Vt[x - 15] | 0, _ = Q.rotrSH(A, T, 1) ^ Q.rotrSH(A, T, 8) ^ Q.shrSH(A, T, 7), S = Q.rotrSL(A, T, 1) ^ Q.rotrSL(A, T, 8) ^ Q.shrSL(A, T, 7), k = qt[x - 2] | 0, N = Vt[x - 2] | 0, z = Q.rotrSH(k, N, 19) ^ Q.rotrBH(k, N, 61) ^ Q.shrSH(k, N, 6), L = Q.rotrSL(k, N, 19) ^ Q.rotrBL(k, N, 61) ^ Q.shrSL(k, N, 6), P = Q.add4L(S, L, Vt[x - 7], Vt[x - 16]), F = Q.add4H(P, _, z, qt[x - 7], qt[x - 16]); - qt[x] = F | 0, Vt[x] = P | 0; - } - let { Ah: r, Al: s, Bh: i, Bl: o, Ch: a, Cl: c, Dh: l, Dl: d, Eh: u, El: f, Fh: m, Fl: b, Gh: g, Gl: p, Hh: y, Hl: w } = this; - for (let x = 0; x < 80; x++) { - const A = Q.rotrSH(u, f, 14) ^ Q.rotrSH(u, f, 18) ^ Q.rotrBH(u, f, 41), T = Q.rotrSL(u, f, 14) ^ Q.rotrSL(u, f, 18) ^ Q.rotrBL(u, f, 41), _ = u & m ^ ~u & g, S = f & b ^ ~f & p, k = Q.add5L(w, T, S, C0[x], Vt[x]), N = Q.add5H(k, y, A, _, I0[x], qt[x]), z = k | 0, L = Q.rotrSH(r, s, 28) ^ Q.rotrBH(r, s, 34) ^ Q.rotrBH(r, s, 39), P = Q.rotrSL(r, s, 28) ^ Q.rotrBL(r, s, 34) ^ Q.rotrBL(r, s, 39), F = r & i ^ r & a ^ i & a, I = s & o ^ s & c ^ o & c; - y = g | 0, w = p | 0, g = m | 0, p = b | 0, m = u | 0, b = f | 0, { h: u, l: f } = Q.add(l | 0, d | 0, N | 0, z | 0), l = a | 0, d = c | 0, a = i | 0, c = o | 0, i = r | 0, o = s | 0; - const v = Q.add3L(z, P, I); - r = Q.add3H(v, N, L, F), s = v | 0; - } - ({ h: r, l: s } = Q.add(this.Ah | 0, this.Al | 0, r | 0, s | 0)), { h: i, l: o } = Q.add(this.Bh | 0, this.Bl | 0, i | 0, o | 0), { h: a, l: c } = Q.add(this.Ch | 0, this.Cl | 0, a | 0, c | 0), { h: l, l: d } = Q.add(this.Dh | 0, this.Dl | 0, l | 0, d | 0), { h: u, l: f } = Q.add(this.Eh | 0, this.El | 0, u | 0, f | 0), { h: m, l: b } = Q.add(this.Fh | 0, this.Fl | 0, m | 0, b | 0), { h: g, l: p } = Q.add(this.Gh | 0, this.Gl | 0, g | 0, p | 0), { h: y, l: w } = Q.add(this.Hh | 0, this.Hl | 0, y | 0, w | 0), this.set(r, s, i, o, a, c, l, d, u, f, m, b, g, p, y, w); - } - roundClean() { - qt.fill(0), Vt.fill(0); - } - destroy() { - this.buffer.fill(0), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); - } -} -const vi = /* @__PURE__ */ to(() => new $0()); -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const oo = /* @__PURE__ */ BigInt(0), ks = /* @__PURE__ */ BigInt(1), R0 = /* @__PURE__ */ BigInt(2); -function En(n) { - return n instanceof Uint8Array || n != null && typeof n == "object" && n.constructor.name === "Uint8Array"; -} -function Nr(n) { - if (!En(n)) - throw new Error("Uint8Array expected"); -} -function Vn(n, e) { - if (typeof e != "boolean") - throw new Error(`${n} must be valid boolean, got "${e}".`); -} -const N0 = /* @__PURE__ */ Array.from({ length: 256 }, (n, e) => e.toString(16).padStart(2, "0")); -function Kn(n) { - Nr(n); - let e = ""; - for (let t = 0; t < n.length; t++) - e += N0[n[t]]; - return e; -} -function On(n) { - const e = n.toString(16); - return e.length & 1 ? `0${e}` : e; -} -function ao(n) { - if (typeof n != "string") - throw new Error("hex string expected, got " + typeof n); - return BigInt(n === "" ? "0" : `0x${n}`); -} -const _t = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 }; -function Mo(n) { - if (n >= _t._0 && n <= _t._9) - return n - _t._0; - if (n >= _t._A && n <= _t._F) - return n - (_t._A - 10); - if (n >= _t._a && n <= _t._f) - return n - (_t._a - 10); -} -function Wn(n) { - if (typeof n != "string") - throw new Error("hex string expected, got " + typeof n); - const e = n.length, t = e / 2; - if (e % 2) - throw new Error("padded hex string expected, got unpadded hex of length " + e); - const r = new Uint8Array(t); - for (let s = 0, i = 0; s < t; s++, i += 2) { - const o = Mo(n.charCodeAt(i)), a = Mo(n.charCodeAt(i + 1)); - if (o === void 0 || a === void 0) { - const c = n[i] + n[i + 1]; - throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i); - } - r[s] = o * 16 + a; - } - return r; -} -function mn(n) { - return ao(Kn(n)); -} -function co(n) { - return Nr(n), ao(Kn(Uint8Array.from(n).reverse())); -} -function Fn(n, e) { - return Wn(n.toString(16).padStart(e * 2, "0")); -} -function lo(n, e) { - return Fn(n, e).reverse(); -} -function L0(n) { - return Wn(On(n)); -} -function We(n, e, t) { - let r; - if (typeof e == "string") - try { - r = Wn(e); - } catch (i) { - throw new Error(`${n} must be valid hex string, got "${e}". Cause: ${i}`); - } - else if (En(e)) - r = Uint8Array.from(e); - else - throw new Error(`${n} must be hex string or Uint8Array`); - const s = r.length; - if (typeof t == "number" && s !== t) - throw new Error(`${n} expected ${t} bytes, got ${s}`); - return r; -} -function kr(...n) { - let e = 0; - for (let r = 0; r < n.length; r++) { - const s = n[r]; - Nr(s), e += s.length; - } - const t = new Uint8Array(e); - for (let r = 0, s = 0; r < n.length; r++) { - const i = n[r]; - t.set(i, s), s += i.length; - } - return t; -} -function U0(n, e) { - if (n.length !== e.length) - return !1; - let t = 0; - for (let r = 0; r < n.length; r++) - t |= n[r] ^ e[r]; - return t === 0; -} -function H0(n) { - if (typeof n != "string") - throw new Error(`utf8ToBytes expected string, got ${typeof n}`); - return new Uint8Array(new TextEncoder().encode(n)); -} -const Ps = (n) => typeof n == "bigint" && oo <= n; -function As(n, e, t) { - return Ps(n) && Ps(e) && Ps(t) && e <= n && n < t; -} -function wn(n, e, t, r) { - if (!As(e, t, r)) - throw new Error(`expected valid ${n}: ${t} <= n < ${r}, got ${typeof e} ${e}`); -} -function Gc(n) { - let e; - for (e = 0; n > oo; n >>= ks, e += 1) - ; - return e; -} -function M0(n, e) { - return n >> BigInt(e) & ks; -} -function j0(n, e, t) { - return n | (t ? ks : oo) << BigInt(e); -} -const uo = (n) => (R0 << BigInt(n - 1)) - ks, Zs = (n) => new Uint8Array(n), jo = (n) => Uint8Array.from(n); -function Yc(n, e, t) { - if (typeof n != "number" || n < 2) - throw new Error("hashLen must be a number"); - if (typeof e != "number" || e < 2) - throw new Error("qByteLen must be a number"); - if (typeof t != "function") - throw new Error("hmacFn must be a function"); - let r = Zs(n), s = Zs(n), i = 0; - const o = () => { - r.fill(1), s.fill(0), i = 0; - }, a = (...u) => t(s, r, ...u), c = (u = Zs()) => { - s = a(jo([0]), u), r = a(), u.length !== 0 && (s = a(jo([1]), u), r = a()); - }, l = () => { - if (i++ >= 1e3) - throw new Error("drbg: tried 1000 values"); - let u = 0; - const f = []; - for (; u < e; ) { - r = a(); - const m = r.slice(); - f.push(m), u += r.length; - } - return kr(...f); - }; - return (u, f) => { - o(), c(u); - let m; - for (; !(m = f(l())); ) - c(); - return o(), m; - }; -} -const P0 = { - bigint: (n) => typeof n == "bigint", - function: (n) => typeof n == "function", - boolean: (n) => typeof n == "boolean", - string: (n) => typeof n == "string", - stringOrUint8Array: (n) => typeof n == "string" || En(n), - isSafeInteger: (n) => Number.isSafeInteger(n), - array: (n) => Array.isArray(n), - field: (n, e) => e.Fp.isValid(n), - hash: (n) => typeof n == "function" && Number.isSafeInteger(n.outputLen) -}; -function Lr(n, e, t = {}) { - const r = (s, i, o) => { - const a = P0[i]; - if (typeof a != "function") - throw new Error(`Invalid validator "${i}", expected function`); - const c = n[s]; - if (!(o && c === void 0) && !a(c, n)) - throw new Error(`Invalid param ${String(s)}=${c} (${typeof c}), expected ${i}`); - }; - for (const [s, i] of Object.entries(e)) - r(s, i, !1); - for (const [s, i] of Object.entries(t)) - r(s, i, !0); - return n; -} -const Z0 = () => { - throw new Error("not implemented"); -}; -function xi(n) { - const e = /* @__PURE__ */ new WeakMap(); - return (t, ...r) => { - const s = e.get(t); - if (s !== void 0) - return s; - const i = n(t, ...r); - return e.set(t, i), i; - }; -} -const z0 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({ - __proto__: null, - aInRange: wn, - abool: Vn, - abytes: Nr, - bitGet: M0, - bitLen: Gc, - bitMask: uo, - bitSet: j0, - bytesToHex: Kn, - bytesToNumberBE: mn, - bytesToNumberLE: co, - concatBytes: kr, - createHmacDrbg: Yc, - ensureBytes: We, - equalBytes: U0, - hexToBytes: Wn, - hexToNumber: ao, - inRange: As, - isBytes: En, - memoized: xi, - notImplemented: Z0, - numberToBytesBE: Fn, - numberToBytesLE: lo, - numberToHexUnpadded: On, - numberToVarBytesBE: L0, - utf8ToBytes: H0, - validateObject: Lr -}, Symbol.toStringTag, { value: "Module" })); -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const Ee = BigInt(0), de = BigInt(1), ln = BigInt(2), D0 = BigInt(3), Ei = BigInt(4), Po = BigInt(5), Zo = BigInt(8); -BigInt(9); -BigInt(16); -function Ce(n, e) { - const t = n % e; - return t >= Ee ? t : e + t; -} -function q0(n, e, t) { - if (t <= Ee || e < Ee) - throw new Error("Expected power/modulo > 0"); - if (t === de) - return Ee; - let r = de; - for (; e > Ee; ) - e & de && (r = r * n % t), n = n * n % t, e >>= de; - return r; -} -function qe(n, e, t) { - let r = n; - for (; e-- > Ee; ) - r *= r, r %= t; - return r; -} -function _i(n, e) { - if (n === Ee || e <= Ee) - throw new Error(`invert: expected positive integers, got n=${n} mod=${e}`); - let t = Ce(n, e), r = e, s = Ee, i = de; - for (; t !== Ee; ) { - const a = r / t, c = r % t, l = s - i * a; - r = t, t = c, s = i, i = l; - } - if (r !== de) - throw new Error("invert: does not exist"); - return Ce(s, e); -} -function V0(n) { - const e = (n - de) / ln; - let t, r, s; - for (t = n - de, r = 0; t % ln === Ee; t /= ln, r++) - ; - for (s = ln; s < n && q0(s, e, n) !== n - de; s++) - ; - if (r === 1) { - const o = (n + de) / Ei; - return function(c, l) { - const d = c.pow(l, o); - if (!c.eql(c.sqr(d), l)) - throw new Error("Cannot find square root"); - return d; - }; - } - const i = (t + de) / ln; - return function(a, c) { - if (a.pow(c, e) === a.neg(a.ONE)) - throw new Error("Cannot find square root"); - let l = r, d = a.pow(a.mul(a.ONE, s), t), u = a.pow(c, i), f = a.pow(c, t); - for (; !a.eql(f, a.ONE); ) { - if (a.eql(f, a.ZERO)) - return a.ZERO; - let m = 1; - for (let g = a.sqr(f); m < l && !a.eql(g, a.ONE); m++) - g = a.sqr(g); - const b = a.pow(d, de << BigInt(l - m - 1)); - d = a.sqr(b), u = a.mul(u, b), f = a.mul(f, d), l = m; - } - return u; - }; -} -function K0(n) { - if (n % Ei === D0) { - const e = (n + de) / Ei; - return function(r, s) { - const i = r.pow(s, e); - if (!r.eql(r.sqr(i), s)) - throw new Error("Cannot find square root"); - return i; - }; - } - if (n % Zo === Po) { - const e = (n - Po) / Zo; - return function(r, s) { - const i = r.mul(s, ln), o = r.pow(i, e), a = r.mul(s, o), c = r.mul(r.mul(a, ln), o), l = r.mul(a, r.sub(c, r.ONE)); - if (!r.eql(r.sqr(l), s)) - throw new Error("Cannot find square root"); - return l; - }; - } - return V0(n); -} -const W0 = [ - "create", - "isValid", - "is0", - "neg", - "inv", - "sqrt", - "sqr", - "eql", - "add", - "sub", - "mul", - "pow", - "div", - "addN", - "subN", - "mulN", - "sqrN" -]; -function F0(n) { - const e = { - ORDER: "bigint", - MASK: "bigint", - BYTES: "isSafeInteger", - BITS: "isSafeInteger" - }, t = W0.reduce((r, s) => (r[s] = "function", r), e); - return Lr(n, t); -} -function G0(n, e, t) { - if (t < Ee) - throw new Error("Expected power > 0"); - if (t === Ee) - return n.ONE; - if (t === de) - return e; - let r = n.ONE, s = e; - for (; t > Ee; ) - t & de && (r = n.mul(r, s)), s = n.sqr(s), t >>= de; - return r; -} -function Y0(n, e) { - const t = new Array(e.length), r = e.reduce((i, o, a) => n.is0(o) ? i : (t[a] = i, n.mul(i, o)), n.ONE), s = n.inv(r); - return e.reduceRight((i, o, a) => n.is0(o) ? i : (t[a] = n.mul(i, t[a]), n.mul(i, o)), s), t; -} -function Jc(n, e) { - const t = e !== void 0 ? e : n.toString(2).length, r = Math.ceil(t / 8); - return { nBitLength: t, nByteLength: r }; -} -function Xc(n, e, t = !1, r = {}) { - if (n <= Ee) - throw new Error(`Expected Field ORDER > 0, got ${n}`); - const { nBitLength: s, nByteLength: i } = Jc(n, e); - if (i > 2048) - throw new Error("Field lengths over 2048 bytes are not supported"); - const o = K0(n), a = Object.freeze({ - ORDER: n, - BITS: s, - BYTES: i, - MASK: uo(s), - ZERO: Ee, - ONE: de, - create: (c) => Ce(c, n), - isValid: (c) => { - if (typeof c != "bigint") - throw new Error(`Invalid field element: expected bigint, got ${typeof c}`); - return Ee <= c && c < n; - }, - is0: (c) => c === Ee, - isOdd: (c) => (c & de) === de, - neg: (c) => Ce(-c, n), - eql: (c, l) => c === l, - sqr: (c) => Ce(c * c, n), - add: (c, l) => Ce(c + l, n), - sub: (c, l) => Ce(c - l, n), - mul: (c, l) => Ce(c * l, n), - pow: (c, l) => G0(a, c, l), - div: (c, l) => Ce(c * _i(l, n), n), - // Same as above, but doesn't normalize - sqrN: (c) => c * c, - addN: (c, l) => c + l, - subN: (c, l) => c - l, - mulN: (c, l) => c * l, - inv: (c) => _i(c, n), - sqrt: r.sqrt || ((c) => o(a, c)), - invertBatch: (c) => Y0(a, c), - // TODO: do we really need constant cmov? - // We don't have const-time bigints anyway, so probably will be not very useful - cmov: (c, l, d) => d ? l : c, - toBytes: (c) => t ? lo(c, i) : Fn(c, i), - fromBytes: (c) => { - if (c.length !== i) - throw new Error(`Fp.fromBytes: expected ${i}, got ${c.length}`); - return t ? co(c) : mn(c); - } - }); - return Object.freeze(a); -} -function Qc(n) { - if (typeof n != "bigint") - throw new Error("field order must be bigint"); - const e = n.toString(2).length; - return Math.ceil(e / 8); -} -function el(n) { - const e = Qc(n); - return e + Math.ceil(e / 2); -} -function J0(n, e, t = !1) { - const r = n.length, s = Qc(e), i = el(e); - if (r < 16 || r < i || r > 1024) - throw new Error(`expected ${i}-1024 bytes of input, got ${r}`); - const o = t ? mn(n) : co(n), a = Ce(o, e - de) + de; - return t ? lo(a, s) : Fn(a, s); -} -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const X0 = BigInt(0), zs = BigInt(1), Ds = /* @__PURE__ */ new WeakMap(), zo = /* @__PURE__ */ new WeakMap(); -function Q0(n, e) { - const t = (i, o) => { - const a = o.negate(); - return i ? a : o; - }, r = (i) => { - if (!Number.isSafeInteger(i) || i <= 0 || i > e) - throw new Error(`Wrong window size=${i}, should be [1..${e}]`); - }, s = (i) => { - r(i); - const o = Math.ceil(e / i) + 1, a = 2 ** (i - 1); - return { windows: o, windowSize: a }; - }; - return { - constTimeNegate: t, - // non-const time multiplication ladder - unsafeLadder(i, o) { - let a = n.ZERO, c = i; - for (; o > X0; ) - o & zs && (a = a.add(c)), c = c.double(), o >>= zs; - return a; - }, - /** - * Creates a wNAF precomputation window. Used for caching. - * Default window size is set by `utils.precompute()` and is equal to 8. - * Number of precomputed points depends on the curve size: - * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where: - * - 𝑊 is the window size - * - 𝑛 is the bitlength of the curve order. - * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224. - * @returns precomputed point tables flattened to a single array - */ - precomputeWindow(i, o) { - const { windows: a, windowSize: c } = s(o), l = []; - let d = i, u = d; - for (let f = 0; f < a; f++) { - u = d, l.push(u); - for (let m = 1; m < c; m++) - u = u.add(d), l.push(u); - d = u.double(); - } - return l; - }, - /** - * Implements ec multiplication using precomputed tables and w-ary non-adjacent form. - * @param W window size - * @param precomputes precomputed tables - * @param n scalar (we don't check here, but should be less than curve order) - * @returns real and fake (for const-time) points - */ - wNAF(i, o, a) { - const { windows: c, windowSize: l } = s(i); - let d = n.ZERO, u = n.BASE; - const f = BigInt(2 ** i - 1), m = 2 ** i, b = BigInt(i); - for (let g = 0; g < c; g++) { - const p = g * l; - let y = Number(a & f); - a >>= b, y > l && (y -= m, a += zs); - const w = p, x = p + Math.abs(y) - 1, A = g % 2 !== 0, T = y < 0; - y === 0 ? u = u.add(t(A, o[w])) : d = d.add(t(T, o[x])); - } - return { p: d, f: u }; - }, - wNAFCached(i, o, a) { - const c = zo.get(i) || 1; - let l = Ds.get(i); - return l || (l = this.precomputeWindow(i, c), c !== 1 && Ds.set(i, a(l))), this.wNAF(c, l, o); - }, - // We calculate precomputes for elliptic curve point multiplication - // using windowed method. This specifies window size and - // stores precomputed values. Usually only base point would be precomputed. - setWindowSize(i, o) { - r(o), zo.set(i, o), Ds.delete(i); - } - }; -} -function eg(n, e, t, r) { - if (!Array.isArray(t) || !Array.isArray(r) || r.length !== t.length) - throw new Error("arrays of points and scalars must have equal length"); - r.forEach((d, u) => { - if (!e.isValid(d)) - throw new Error(`wrong scalar at index ${u}`); - }), t.forEach((d, u) => { - if (!(d instanceof n)) - throw new Error(`wrong point at index ${u}`); - }); - const s = Gc(BigInt(t.length)), i = s > 12 ? s - 3 : s > 4 ? s - 2 : s ? 2 : 1, o = (1 << i) - 1, a = new Array(o + 1).fill(n.ZERO), c = Math.floor((e.BITS - 1) / i) * i; - let l = n.ZERO; - for (let d = c; d >= 0; d -= i) { - a.fill(n.ZERO); - for (let f = 0; f < r.length; f++) { - const m = r[f], b = Number(m >> BigInt(d) & BigInt(o)); - a[b] = a[b].add(t[f]); - } - let u = n.ZERO; - for (let f = a.length - 1, m = n.ZERO; f > 0; f--) - m = m.add(a[f]), u = u.add(m); - if (l = l.add(u), d !== 0) - for (let f = 0; f < i; f++) - l = l.double(); - } - return l; -} -function tl(n) { - return F0(n.Fp), Lr(n, { - n: "bigint", - h: "bigint", - Gx: "field", - Gy: "field" - }, { - nBitLength: "isSafeInteger", - nByteLength: "isSafeInteger" - }), Object.freeze({ - ...Jc(n.n, n.nBitLength), - ...n, - p: n.Fp.ORDER - }); -} -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -function Do(n) { - n.lowS !== void 0 && Vn("lowS", n.lowS), n.prehash !== void 0 && Vn("prehash", n.prehash); -} -function tg(n) { - const e = tl(n); - Lr(e, { - a: "field", - b: "field" - }, { - allowedPrivateKeyLengths: "array", - wrapPrivateKey: "boolean", - isTorsionFree: "function", - clearCofactor: "function", - allowInfinityPoint: "boolean", - fromBytes: "function", - toBytes: "function" - }); - const { endo: t, Fp: r, a: s } = e; - if (t) { - if (!r.eql(s, r.ZERO)) - throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0"); - if (typeof t != "object" || typeof t.beta != "bigint" || typeof t.splitScalar != "function") - throw new Error("Expected endomorphism with beta: bigint and splitScalar: function"); - } - return Object.freeze({ ...e }); -} -const { bytesToNumberBE: ng, hexToBytes: rg } = z0, At = { - // asn.1 DER encoding utils - Err: class extends Error { - constructor(e = "") { - super(e); - } - }, - // Basic building block is TLV (Tag-Length-Value) - _tlv: { - encode: (n, e) => { - const { Err: t } = At; - if (n < 0 || n > 256) - throw new t("tlv.encode: wrong tag"); - if (e.length & 1) - throw new t("tlv.encode: unpadded data"); - const r = e.length / 2, s = On(r); - if (s.length / 2 & 128) - throw new t("tlv.encode: long form length too big"); - const i = r > 127 ? On(s.length / 2 | 128) : ""; - return `${On(n)}${i}${s}${e}`; - }, - // v - value, l - left bytes (unparsed) - decode(n, e) { - const { Err: t } = At; - let r = 0; - if (n < 0 || n > 256) - throw new t("tlv.encode: wrong tag"); - if (e.length < 2 || e[r++] !== n) - throw new t("tlv.decode: wrong tlv"); - const s = e[r++], i = !!(s & 128); - let o = 0; - if (!i) - o = s; - else { - const c = s & 127; - if (!c) - throw new t("tlv.decode(long): indefinite length not supported"); - if (c > 4) - throw new t("tlv.decode(long): byte length is too big"); - const l = e.subarray(r, r + c); - if (l.length !== c) - throw new t("tlv.decode: length bytes not complete"); - if (l[0] === 0) - throw new t("tlv.decode(long): zero leftmost byte"); - for (const d of l) - o = o << 8 | d; - if (r += c, o < 128) - throw new t("tlv.decode(long): not minimal encoding"); - } - const a = e.subarray(r, r + o); - if (a.length !== o) - throw new t("tlv.decode: wrong value length"); - return { v: a, l: e.subarray(r + o) }; - } - }, - // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag, - // since we always use positive integers here. It must always be empty: - // - add zero byte if exists - // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding) - _int: { - encode(n) { - const { Err: e } = At; - if (n < It) - throw new e("integer: negative integers are not allowed"); - let t = On(n); - if (Number.parseInt(t[0], 16) & 8 && (t = "00" + t), t.length & 1) - throw new e("unexpected assertion"); - return t; - }, - decode(n) { - const { Err: e } = At; - if (n[0] & 128) - throw new e("Invalid signature integer: negative"); - if (n[0] === 0 && !(n[1] & 128)) - throw new e("Invalid signature integer: unnecessary leading zero"); - return ng(n); - } - }, - toSig(n) { - const { Err: e, _int: t, _tlv: r } = At, s = typeof n == "string" ? rg(n) : n; - Nr(s); - const { v: i, l: o } = r.decode(48, s); - if (o.length) - throw new e("Invalid signature: left bytes after parsing"); - const { v: a, l: c } = r.decode(2, i), { v: l, l: d } = r.decode(2, c); - if (d.length) - throw new e("Invalid signature: left bytes after parsing"); - return { r: t.decode(a), s: t.decode(l) }; - }, - hexFromSig(n) { - const { _tlv: e, _int: t } = At, r = `${e.encode(2, t.encode(n.r))}${e.encode(2, t.encode(n.s))}`; - return e.encode(48, r); - } -}, It = BigInt(0), be = BigInt(1); -BigInt(2); -const qo = BigInt(3); -BigInt(4); -function sg(n) { - const e = tg(n), { Fp: t } = e, r = Xc(e.n, e.nBitLength), s = e.toBytes || ((g, p, y) => { - const w = p.toAffine(); - return kr(Uint8Array.from([4]), t.toBytes(w.x), t.toBytes(w.y)); - }), i = e.fromBytes || ((g) => { - const p = g.subarray(1), y = t.fromBytes(p.subarray(0, t.BYTES)), w = t.fromBytes(p.subarray(t.BYTES, 2 * t.BYTES)); - return { x: y, y: w }; - }); - function o(g) { - const { a: p, b: y } = e, w = t.sqr(g), x = t.mul(w, g); - return t.add(t.add(x, t.mul(g, p)), y); - } - if (!t.eql(t.sqr(e.Gy), o(e.Gx))) - throw new Error("bad generator point: equation left != right"); - function a(g) { - return As(g, be, e.n); - } - function c(g) { - const { allowedPrivateKeyLengths: p, nByteLength: y, wrapPrivateKey: w, n: x } = e; - if (p && typeof g != "bigint") { - if (En(g) && (g = Kn(g)), typeof g != "string" || !p.includes(g.length)) - throw new Error("Invalid key"); - g = g.padStart(y * 2, "0"); - } - let A; - try { - A = typeof g == "bigint" ? g : mn(We("private key", g, y)); - } catch { - throw new Error(`private key must be ${y} bytes, hex or bigint, not ${typeof g}`); - } - return w && (A = Ce(A, x)), wn("private key", A, be, x), A; - } - function l(g) { - if (!(g instanceof f)) - throw new Error("ProjectivePoint expected"); - } - const d = xi((g, p) => { - const { px: y, py: w, pz: x } = g; - if (t.eql(x, t.ONE)) - return { x: y, y: w }; - const A = g.is0(); - p == null && (p = A ? t.ONE : t.inv(x)); - const T = t.mul(y, p), _ = t.mul(w, p), S = t.mul(x, p); - if (A) - return { x: t.ZERO, y: t.ZERO }; - if (!t.eql(S, t.ONE)) - throw new Error("invZ was invalid"); - return { x: T, y: _ }; - }), u = xi((g) => { - if (g.is0()) { - if (e.allowInfinityPoint && !t.is0(g.py)) - return; - throw new Error("bad point: ZERO"); - } - const { x: p, y } = g.toAffine(); - if (!t.isValid(p) || !t.isValid(y)) - throw new Error("bad point: x or y not FE"); - const w = t.sqr(y), x = o(p); - if (!t.eql(w, x)) - throw new Error("bad point: equation left != right"); - if (!g.isTorsionFree()) - throw new Error("bad point: not in prime-order subgroup"); - return !0; - }); - class f { - constructor(p, y, w) { - if (this.px = p, this.py = y, this.pz = w, p == null || !t.isValid(p)) - throw new Error("x required"); - if (y == null || !t.isValid(y)) - throw new Error("y required"); - if (w == null || !t.isValid(w)) - throw new Error("z required"); - Object.freeze(this); - } - // Does not validate if the point is on-curve. - // Use fromHex instead, or call assertValidity() later. - static fromAffine(p) { - const { x: y, y: w } = p || {}; - if (!p || !t.isValid(y) || !t.isValid(w)) - throw new Error("invalid affine point"); - if (p instanceof f) - throw new Error("projective point not allowed"); - const x = (A) => t.eql(A, t.ZERO); - return x(y) && x(w) ? f.ZERO : new f(y, w, t.ONE); - } - get x() { - return this.toAffine().x; - } - get y() { - return this.toAffine().y; - } - /** - * Takes a bunch of Projective Points but executes only one - * inversion on all of them. Inversion is very slow operation, - * so this improves performance massively. - * Optimization: converts a list of projective points to a list of identical points with Z=1. - */ - static normalizeZ(p) { - const y = t.invertBatch(p.map((w) => w.pz)); - return p.map((w, x) => w.toAffine(y[x])).map(f.fromAffine); - } - /** - * Converts hash string or Uint8Array to Point. - * @param hex short/long ECDSA hex - */ - static fromHex(p) { - const y = f.fromAffine(i(We("pointHex", p))); - return y.assertValidity(), y; - } - // Multiplies generator point by privateKey. - static fromPrivateKey(p) { - return f.BASE.multiply(c(p)); - } - // Multiscalar Multiplication - static msm(p, y) { - return eg(f, r, p, y); - } - // "Private method", don't use it directly - _setWindowSize(p) { - b.setWindowSize(this, p); - } - // A point on curve is valid if it conforms to equation. - assertValidity() { - u(this); - } - hasEvenY() { - const { y: p } = this.toAffine(); - if (t.isOdd) - return !t.isOdd(p); - throw new Error("Field doesn't support isOdd"); - } - /** - * Compare one point to another. - */ - equals(p) { - l(p); - const { px: y, py: w, pz: x } = this, { px: A, py: T, pz: _ } = p, S = t.eql(t.mul(y, _), t.mul(A, x)), k = t.eql(t.mul(w, _), t.mul(T, x)); - return S && k; - } - /** - * Flips point to one corresponding to (x, -y) in Affine coordinates. - */ - negate() { - return new f(this.px, t.neg(this.py), this.pz); - } - // Renes-Costello-Batina exception-free doubling formula. - // There is 30% faster Jacobian formula, but it is not complete. - // https://eprint.iacr.org/2015/1060, algorithm 3 - // Cost: 8M + 3S + 3*a + 2*b3 + 15add. - double() { - const { a: p, b: y } = e, w = t.mul(y, qo), { px: x, py: A, pz: T } = this; - let _ = t.ZERO, S = t.ZERO, k = t.ZERO, N = t.mul(x, x), z = t.mul(A, A), L = t.mul(T, T), P = t.mul(x, A); - return P = t.add(P, P), k = t.mul(x, T), k = t.add(k, k), _ = t.mul(p, k), S = t.mul(w, L), S = t.add(_, S), _ = t.sub(z, S), S = t.add(z, S), S = t.mul(_, S), _ = t.mul(P, _), k = t.mul(w, k), L = t.mul(p, L), P = t.sub(N, L), P = t.mul(p, P), P = t.add(P, k), k = t.add(N, N), N = t.add(k, N), N = t.add(N, L), N = t.mul(N, P), S = t.add(S, N), L = t.mul(A, T), L = t.add(L, L), N = t.mul(L, P), _ = t.sub(_, N), k = t.mul(L, z), k = t.add(k, k), k = t.add(k, k), new f(_, S, k); - } - // Renes-Costello-Batina exception-free addition formula. - // There is 30% faster Jacobian formula, but it is not complete. - // https://eprint.iacr.org/2015/1060, algorithm 1 - // Cost: 12M + 0S + 3*a + 3*b3 + 23add. - add(p) { - l(p); - const { px: y, py: w, pz: x } = this, { px: A, py: T, pz: _ } = p; - let S = t.ZERO, k = t.ZERO, N = t.ZERO; - const z = e.a, L = t.mul(e.b, qo); - let P = t.mul(y, A), F = t.mul(w, T), I = t.mul(x, _), v = t.add(y, w), E = t.add(A, T); - v = t.mul(v, E), E = t.add(P, F), v = t.sub(v, E), E = t.add(y, x); - let C = t.add(A, _); - return E = t.mul(E, C), C = t.add(P, I), E = t.sub(E, C), C = t.add(w, x), S = t.add(T, _), C = t.mul(C, S), S = t.add(F, I), C = t.sub(C, S), N = t.mul(z, E), S = t.mul(L, I), N = t.add(S, N), S = t.sub(F, N), N = t.add(F, N), k = t.mul(S, N), F = t.add(P, P), F = t.add(F, P), I = t.mul(z, I), E = t.mul(L, E), F = t.add(F, I), I = t.sub(P, I), I = t.mul(z, I), E = t.add(E, I), P = t.mul(F, E), k = t.add(k, P), P = t.mul(C, E), S = t.mul(v, S), S = t.sub(S, P), P = t.mul(v, F), N = t.mul(C, N), N = t.add(N, P), new f(S, k, N); - } - subtract(p) { - return this.add(p.negate()); - } - is0() { - return this.equals(f.ZERO); - } - wNAF(p) { - return b.wNAFCached(this, p, f.normalizeZ); - } - /** - * Non-constant-time multiplication. Uses double-and-add algorithm. - * It's faster, but should only be used when you don't care about - * an exposed private key e.g. sig verification, which works over *public* keys. - */ - multiplyUnsafe(p) { - wn("scalar", p, It, e.n); - const y = f.ZERO; - if (p === It) - return y; - if (p === be) - return this; - const { endo: w } = e; - if (!w) - return b.unsafeLadder(this, p); - let { k1neg: x, k1: A, k2neg: T, k2: _ } = w.splitScalar(p), S = y, k = y, N = this; - for (; A > It || _ > It; ) - A & be && (S = S.add(N)), _ & be && (k = k.add(N)), N = N.double(), A >>= be, _ >>= be; - return x && (S = S.negate()), T && (k = k.negate()), k = new f(t.mul(k.px, w.beta), k.py, k.pz), S.add(k); - } - /** - * Constant time multiplication. - * Uses wNAF method. Windowed method may be 10% faster, - * but takes 2x longer to generate and consumes 2x memory. - * Uses precomputes when available. - * Uses endomorphism for Koblitz curves. - * @param scalar by which the point would be multiplied - * @returns New point - */ - multiply(p) { - const { endo: y, n: w } = e; - wn("scalar", p, be, w); - let x, A; - if (y) { - const { k1neg: T, k1: _, k2neg: S, k2: k } = y.splitScalar(p); - let { p: N, f: z } = this.wNAF(_), { p: L, f: P } = this.wNAF(k); - N = b.constTimeNegate(T, N), L = b.constTimeNegate(S, L), L = new f(t.mul(L.px, y.beta), L.py, L.pz), x = N.add(L), A = z.add(P); - } else { - const { p: T, f: _ } = this.wNAF(p); - x = T, A = _; - } - return f.normalizeZ([x, A])[0]; - } - /** - * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly. - * Not using Strauss-Shamir trick: precomputation tables are faster. - * The trick could be useful if both P and Q are not G (not in our case). - * @returns non-zero affine point - */ - multiplyAndAddUnsafe(p, y, w) { - const x = f.BASE, A = (_, S) => S === It || S === be || !_.equals(x) ? _.multiplyUnsafe(S) : _.multiply(S), T = A(this, y).add(A(p, w)); - return T.is0() ? void 0 : T; - } - // Converts Projective point to affine (x, y) coordinates. - // Can accept precomputed Z^-1 - for example, from invertBatch. - // (x, y, z) ∋ (x=x/z, y=y/z) - toAffine(p) { - return d(this, p); - } - isTorsionFree() { - const { h: p, isTorsionFree: y } = e; - if (p === be) - return !0; - if (y) - return y(f, this); - throw new Error("isTorsionFree() has not been declared for the elliptic curve"); - } - clearCofactor() { - const { h: p, clearCofactor: y } = e; - return p === be ? this : y ? y(f, this) : this.multiplyUnsafe(e.h); - } - toRawBytes(p = !0) { - return Vn("isCompressed", p), this.assertValidity(), s(f, this, p); - } - toHex(p = !0) { - return Vn("isCompressed", p), Kn(this.toRawBytes(p)); - } - } - f.BASE = new f(e.Gx, e.Gy, t.ONE), f.ZERO = new f(t.ZERO, t.ONE, t.ZERO); - const m = e.nBitLength, b = Q0(f, e.endo ? Math.ceil(m / 2) : m); - return { - CURVE: e, - ProjectivePoint: f, - normPrivateKeyToScalar: c, - weierstrassEquation: o, - isWithinCurveOrder: a - }; -} -function ig(n) { - const e = tl(n); - return Lr(e, { - hash: "hash", - hmac: "function", - randomBytes: "function" - }, { - bits2int: "function", - bits2int_modN: "function", - lowS: "boolean" - }), Object.freeze({ lowS: !0, ...e }); -} -function og(n) { - const e = ig(n), { Fp: t, n: r } = e, s = t.BYTES + 1, i = 2 * t.BYTES + 1; - function o(I) { - return Ce(I, r); - } - function a(I) { - return _i(I, r); - } - const { ProjectivePoint: c, normPrivateKeyToScalar: l, weierstrassEquation: d, isWithinCurveOrder: u } = sg({ - ...e, - toBytes(I, v, E) { - const C = v.toAffine(), j = t.toBytes(C.x), Z = kr; - return Vn("isCompressed", E), E ? Z(Uint8Array.from([v.hasEvenY() ? 2 : 3]), j) : Z(Uint8Array.from([4]), j, t.toBytes(C.y)); - }, - fromBytes(I) { - const v = I.length, E = I[0], C = I.subarray(1); - if (v === s && (E === 2 || E === 3)) { - const j = mn(C); - if (!As(j, be, t.ORDER)) - throw new Error("Point is not on curve"); - const Z = d(j); - let W; - try { - W = t.sqrt(Z); - } catch (ce) { - const _e = ce instanceof Error ? ": " + ce.message : ""; - throw new Error("Point is not on curve" + _e); - } - const Y = (W & be) === be; - return (E & 1) === 1 !== Y && (W = t.neg(W)), { x: j, y: W }; - } else if (v === i && E === 4) { - const j = t.fromBytes(C.subarray(0, t.BYTES)), Z = t.fromBytes(C.subarray(t.BYTES, 2 * t.BYTES)); - return { x: j, y: Z }; - } else - throw new Error(`Point of length ${v} was invalid. Expected ${s} compressed bytes or ${i} uncompressed bytes`); - } - }), f = (I) => Kn(Fn(I, e.nByteLength)); - function m(I) { - const v = r >> be; - return I > v; - } - function b(I) { - return m(I) ? o(-I) : I; - } - const g = (I, v, E) => mn(I.slice(v, E)); - class p { - constructor(v, E, C) { - this.r = v, this.s = E, this.recovery = C, this.assertValidity(); - } - // pair (bytes of r, bytes of s) - static fromCompact(v) { - const E = e.nByteLength; - return v = We("compactSignature", v, E * 2), new p(g(v, 0, E), g(v, E, 2 * E)); - } - // DER encoded ECDSA signature - // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script - static fromDER(v) { - const { r: E, s: C } = At.toSig(We("DER", v)); - return new p(E, C); - } - assertValidity() { - wn("r", this.r, be, r), wn("s", this.s, be, r); - } - addRecoveryBit(v) { - return new p(this.r, this.s, v); - } - recoverPublicKey(v) { - const { r: E, s: C, recovery: j } = this, Z = _(We("msgHash", v)); - if (j == null || ![0, 1, 2, 3].includes(j)) - throw new Error("recovery id invalid"); - const W = j === 2 || j === 3 ? E + e.n : E; - if (W >= t.ORDER) - throw new Error("recovery id 2 or 3 invalid"); - const Y = j & 1 ? "03" : "02", te = c.fromHex(Y + f(W)), ce = a(W), _e = o(-Z * ce), Ze = o(C * ce), Re = c.BASE.multiplyAndAddUnsafe(te, _e, Ze); - if (!Re) - throw new Error("point at infinify"); - return Re.assertValidity(), Re; - } - // Signatures should be low-s, to prevent malleability. - hasHighS() { - return m(this.s); - } - normalizeS() { - return this.hasHighS() ? new p(this.r, o(-this.s), this.recovery) : this; - } - // DER-encoded - toDERRawBytes() { - return Wn(this.toDERHex()); - } - toDERHex() { - return At.hexFromSig({ r: this.r, s: this.s }); - } - // padded bytes of r, then padded bytes of s - toCompactRawBytes() { - return Wn(this.toCompactHex()); - } - toCompactHex() { - return f(this.r) + f(this.s); - } - } - const y = { - isValidPrivateKey(I) { - try { - return l(I), !0; - } catch { - return !1; - } - }, - normPrivateKeyToScalar: l, - /** - * Produces cryptographically secure private key from random of size - * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible. - */ - randomPrivateKey: () => { - const I = el(e.n); - return J0(e.randomBytes(I), e.n); - }, - /** - * Creates precompute table for an arbitrary EC point. Makes point "cached". - * Allows to massively speed-up `point.multiply(scalar)`. - * @returns cached point - * @example - * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey)); - * fast.multiply(privKey); // much faster ECDH now - */ - precompute(I = 8, v = c.BASE) { - return v._setWindowSize(I), v.multiply(BigInt(3)), v; - } - }; - function w(I, v = !0) { - return c.fromPrivateKey(I).toRawBytes(v); - } - function x(I) { - const v = En(I), E = typeof I == "string", C = (v || E) && I.length; - return v ? C === s || C === i : E ? C === 2 * s || C === 2 * i : I instanceof c; - } - function A(I, v, E = !0) { - if (x(I)) - throw new Error("first arg must be private key"); - if (!x(v)) - throw new Error("second arg must be public key"); - return c.fromHex(v).multiply(l(I)).toRawBytes(E); - } - const T = e.bits2int || function(I) { - const v = mn(I), E = I.length * 8 - e.nBitLength; - return E > 0 ? v >> BigInt(E) : v; - }, _ = e.bits2int_modN || function(I) { - return o(T(I)); - }, S = uo(e.nBitLength); - function k(I) { - return wn(`num < 2^${e.nBitLength}`, I, It, S), Fn(I, e.nByteLength); - } - function N(I, v, E = z) { - if (["recovered", "canonical"].some((Ke) => Ke in E)) - throw new Error("sign() legacy options not supported"); - const { hash: C, randomBytes: j } = e; - let { lowS: Z, prehash: W, extraEntropy: Y } = E; - Z == null && (Z = !0), I = We("msgHash", I), Do(E), W && (I = We("prehashed msgHash", C(I))); - const te = _(I), ce = l(v), _e = [k(ce), k(te)]; - if (Y != null && Y !== !1) { - const Ke = Y === !0 ? j(t.BYTES) : Y; - _e.push(We("extraEntropy", Ke)); - } - const Ze = kr(..._e), Re = te; - function ze(Ke) { - const Ne = T(Ke); - if (!u(Ne)) - return; - const bt = a(Ne), vt = c.BASE.multiply(Ne).toAffine(), ge = o(vt.x); - if (ge === It) - return; - const ye = o(bt * o(Re + ge * ce)); - if (ye === It) - return; - let xt = (vt.x === ge ? 0 : 2) | Number(vt.y & be), Qn = ye; - return Z && m(ye) && (Qn = b(ye), xt ^= 1), new p(ge, Qn, xt); - } - return { seed: Ze, k2sig: ze }; - } - const z = { lowS: e.lowS, prehash: !1 }, L = { lowS: e.lowS, prehash: !1 }; - function P(I, v, E = z) { - const { seed: C, k2sig: j } = N(I, v, E), Z = e; - return Yc(Z.hash.outputLen, Z.nByteLength, Z.hmac)(C, j); - } - c.BASE._setWindowSize(8); - function F(I, v, E, C = L) { - var vt; - const j = I; - if (v = We("msgHash", v), E = We("publicKey", E), "strict" in C) - throw new Error("options.strict was renamed to lowS"); - Do(C); - const { lowS: Z, prehash: W } = C; - let Y, te; - try { - if (typeof j == "string" || En(j)) - try { - Y = p.fromDER(j); - } catch (ge) { - if (!(ge instanceof At.Err)) - throw ge; - Y = p.fromCompact(j); - } - else if (typeof j == "object" && typeof j.r == "bigint" && typeof j.s == "bigint") { - const { r: ge, s: ye } = j; - Y = new p(ge, ye); - } else - throw new Error("PARSE"); - te = c.fromHex(E); - } catch (ge) { - if (ge.message === "PARSE") - throw new Error("signature must be Signature instance, Uint8Array or hex string"); - return !1; - } - if (Z && Y.hasHighS()) - return !1; - W && (v = e.hash(v)); - const { r: ce, s: _e } = Y, Ze = _(v), Re = a(_e), ze = o(Ze * Re), Ke = o(ce * Re), Ne = (vt = c.BASE.multiplyAndAddUnsafe(te, ze, Ke)) == null ? void 0 : vt.toAffine(); - return Ne ? o(Ne.x) === ce : !1; - } - return { - CURVE: e, - getPublicKey: w, - getSharedSecret: A, - sign: P, - verify: F, - ProjectivePoint: c, - Signature: p, - utils: y - }; -} -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -function ag(n) { - return { - hash: n, - hmac: (e, ...t) => Sr(n, e, sr(...t)), - randomBytes: Gp - }; -} -function cg(n, e) { - const t = (r) => og({ ...n, ...ag(r) }); - return Object.freeze({ ...t(e), create: t }); -} -/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -const nl = BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"), Vo = BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"), lg = BigInt(1), Si = BigInt(2), Ko = (n, e) => (n + e / Si) / e; -function ug(n) { - const e = nl, t = BigInt(3), r = BigInt(6), s = BigInt(11), i = BigInt(22), o = BigInt(23), a = BigInt(44), c = BigInt(88), l = n * n * n % e, d = l * l * n % e, u = qe(d, t, e) * d % e, f = qe(u, t, e) * d % e, m = qe(f, Si, e) * l % e, b = qe(m, s, e) * m % e, g = qe(b, i, e) * b % e, p = qe(g, a, e) * g % e, y = qe(p, c, e) * p % e, w = qe(y, a, e) * g % e, x = qe(w, t, e) * d % e, A = qe(x, o, e) * b % e, T = qe(A, r, e) * l % e, _ = qe(T, Si, e); - if (!ki.eql(ki.sqr(_), n)) - throw new Error("Cannot find square root"); - return _; -} -const ki = Xc(nl, void 0, void 0, { sqrt: ug }), lt = cg({ - a: BigInt(0), - // equation params: a, b - b: BigInt(7), - // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975 - Fp: ki, - // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n - n: Vo, - // Curve order, total count of valid points in the field - // Base point (x, y) aka generator point - Gx: BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"), - Gy: BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"), - h: BigInt(1), - // Cofactor - lowS: !0, - // Allow only low-S signatures by default in sign() and verify() - /** - * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism. - * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%. - * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit. - * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066 - */ - endo: { - beta: BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"), - splitScalar: (n) => { - const e = Vo, t = BigInt("0x3086d221a7d46bcde86c90e49284eb15"), r = -lg * BigInt("0xe4437ed6010e88286f547fa90abfe4c3"), s = BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"), i = t, o = BigInt("0x100000000000000000000000000000000"), a = Ko(i * n, e), c = Ko(-r * n, e); - let l = Ce(n - a * t - c * s, e), d = Ce(-a * r - c * i, e); - const u = l > o, f = d > o; - if (u && (l = e - l), f && (d = e - d), l > o || d > o) - throw new Error("splitScalar: Endomorphism failed, k=" + n); - return { k1neg: u, k1: l, k2neg: f, k2: d }; - } - } -}, io); -BigInt(0); -lt.ProjectivePoint; -/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */ -function Ai(n) { - return n instanceof Uint8Array || n != null && typeof n == "object" && n.constructor.name === "Uint8Array"; -} -// @__NO_SIDE_EFFECTS__ -function rl(...n) { - const e = (i) => i, t = (i, o) => (a) => i(o(a)), r = n.map((i) => i.encode).reduceRight(t, e), s = n.map((i) => i.decode).reduce(t, e); - return { encode: r, decode: s }; -} -// @__NO_SIDE_EFFECTS__ -function dg(n) { - return { - encode: (e) => { - if (!Array.isArray(e) || e.length && typeof e[0] != "number") - throw new Error("alphabet.encode input should be an array of numbers"); - return e.map((t) => { - if (t < 0 || t >= n.length) - throw new Error(`Digit index outside alphabet: ${t} (alphabet: ${n.length})`); - return n[t]; - }); - }, - decode: (e) => { - if (!Array.isArray(e) || e.length && typeof e[0] != "string") - throw new Error("alphabet.decode input should be array of strings"); - return e.map((t) => { - if (typeof t != "string") - throw new Error(`alphabet.decode: not string element=${t}`); - const r = n.indexOf(t); - if (r === -1) - throw new Error(`Unknown letter: "${t}". Allowed: ${n}`); - return r; - }); - } - }; -} -// @__NO_SIDE_EFFECTS__ -function hg(n = "") { - if (typeof n != "string") - throw new Error("join separator should be string"); - return { - encode: (e) => { - if (!Array.isArray(e) || e.length && typeof e[0] != "string") - throw new Error("join.encode input should be array of strings"); - for (let t of e) - if (typeof t != "string") - throw new Error(`join.encode: non-string input=${t}`); - return e.join(n); - }, - decode: (e) => { - if (typeof e != "string") - throw new Error("join.decode input should be string"); - return e.split(n); - } - }; -} -// @__NO_SIDE_EFFECTS__ -function Wo(n, e, t) { - if (e < 2) - throw new Error(`convertRadix: wrong from=${e}, base cannot be less than 2`); - if (t < 2) - throw new Error(`convertRadix: wrong to=${t}, base cannot be less than 2`); - if (!Array.isArray(n)) - throw new Error("convertRadix: data should be array"); - if (!n.length) - return []; - let r = 0; - const s = [], i = Array.from(n); - for (i.forEach((o) => { - if (o < 0 || o >= e) - throw new Error(`Wrong integer: ${o}`); - }); ; ) { - let o = 0, a = !0; - for (let c = r; c < i.length; c++) { - const l = i[c], d = e * o + l; - if (!Number.isSafeInteger(d) || e * o / e !== o || d - l !== e * o) - throw new Error("convertRadix: carry overflow"); - o = d % t; - const u = Math.floor(d / t); - if (i[c] = u, !Number.isSafeInteger(u) || u * t + o !== d) - throw new Error("convertRadix: carry overflow"); - if (a) - u ? a = !1 : r = c; - else continue; - } - if (s.push(o), a) - break; - } - for (let o = 0; o < n.length - 1 && n[o] === 0; o++) - s.push(0); - return s.reverse(); -} -// @__NO_SIDE_EFFECTS__ -function fg(n) { - return { - encode: (e) => { - if (!Ai(e)) - throw new Error("radix.encode input should be Uint8Array"); - return /* @__PURE__ */ Wo(Array.from(e), 2 ** 8, n); - }, - decode: (e) => { - if (!Array.isArray(e) || e.length && typeof e[0] != "number") - throw new Error("radix.decode input should be array of numbers"); - return Uint8Array.from(/* @__PURE__ */ Wo(e, n, 2 ** 8)); - } - }; -} -// @__NO_SIDE_EFFECTS__ -function pg(n, e) { - if (typeof e != "function") - throw new Error("checksum fn should be function"); - return { - encode(t) { - if (!Ai(t)) - throw new Error("checksum.encode: input should be Uint8Array"); - const r = e(t).slice(0, n), s = new Uint8Array(t.length + n); - return s.set(t), s.set(r, t.length), s; - }, - decode(t) { - if (!Ai(t)) - throw new Error("checksum.decode: input should be Uint8Array"); - const r = t.slice(0, -n), s = e(r).slice(0, n), i = t.slice(-n); - for (let o = 0; o < n; o++) - if (s[o] !== i[o]) - throw new Error("Invalid checksum"); - return r; - } - }; -} -const gg = (n) => /* @__PURE__ */ rl(/* @__PURE__ */ fg(58), /* @__PURE__ */ dg(n), /* @__PURE__ */ hg("")), yg = /* @__PURE__ */ gg("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"), mg = (n) => /* @__PURE__ */ rl(/* @__PURE__ */ pg(4, (e) => n(n(e))), yg); -/*! scure-bip32 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */ -const zr = lt.ProjectivePoint, qs = mg(io); -function Fo(n) { - return BigInt(`0x${Vp(n)}`); -} -function wg(n) { - return Kp(n.toString(16).padStart(64, "0")); -} -const bg = Dc("Bitcoin seed"), Vs = { private: 76066276, public: 76067358 }, Ks = 2147483648, vg = (n) => o0(io(n)), xg = (n) => yn(n).getUint32(0, !1), Dr = (n) => { - if (!Number.isSafeInteger(n) || n < 0 || n > 2 ** 32 - 1) - throw new Error(`Invalid number=${n}. Should be from 0 to 2 ** 32 - 1`); - const e = new Uint8Array(4); - return yn(e).setUint32(0, n, !1), e; -}; -class un { - get fingerprint() { - if (!this.pubHash) - throw new Error("No publicKey set!"); - return xg(this.pubHash); - } - get identifier() { - return this.pubHash; - } - get pubKeyHash() { - return this.pubHash; - } - get privateKey() { - return this.privKeyBytes || null; - } - get publicKey() { - return this.pubKey || null; - } - get privateExtendedKey() { - const e = this.privateKey; - if (!e) - throw new Error("No private key"); - return qs.encode(this.serialize(this.versions.private, sr(new Uint8Array([0]), e))); - } - get publicExtendedKey() { - if (!this.pubKey) - throw new Error("No public key"); - return qs.encode(this.serialize(this.versions.public, this.pubKey)); - } - static fromMasterSeed(e, t = Vs) { - if (ft(e), 8 * e.length < 128 || 8 * e.length > 512) - throw new Error(`HDKey: wrong seed length=${e.length}. Should be between 128 and 512 bits; 256 bits is advised)`); - const r = Sr(vi, bg, e); - return new un({ - versions: t, - chainCode: r.slice(32), - privateKey: r.slice(0, 32) - }); - } - static fromExtendedKey(e, t = Vs) { - const r = qs.decode(e), s = yn(r), i = s.getUint32(0, !1), o = { - versions: t, - depth: r[4], - parentFingerprint: s.getUint32(5, !1), - index: s.getUint32(9, !1), - chainCode: r.slice(13, 45) - }, a = r.slice(45), c = a[0] === 0; - if (i !== t[c ? "private" : "public"]) - throw new Error("Version mismatch"); - return c ? new un({ ...o, privateKey: a.slice(1) }) : new un({ ...o, publicKey: a }); - } - static fromJSON(e) { - return un.fromExtendedKey(e.xpriv); - } - constructor(e) { - if (this.depth = 0, this.index = 0, this.chainCode = null, this.parentFingerprint = 0, !e || typeof e != "object") - throw new Error("HDKey.constructor must not be called directly"); - if (this.versions = e.versions || Vs, this.depth = e.depth || 0, this.chainCode = e.chainCode || null, this.index = e.index || 0, this.parentFingerprint = e.parentFingerprint || 0, !this.depth && (this.parentFingerprint || this.index)) - throw new Error("HDKey: zero depth with non-zero index/parent fingerprint"); - if (e.publicKey && e.privateKey) - throw new Error("HDKey: publicKey and privateKey at same time."); - if (e.privateKey) { - if (!lt.utils.isValidPrivateKey(e.privateKey)) - throw new Error("Invalid private key"); - this.privKey = typeof e.privateKey == "bigint" ? e.privateKey : Fo(e.privateKey), this.privKeyBytes = wg(this.privKey), this.pubKey = lt.getPublicKey(e.privateKey, !0); - } else if (e.publicKey) - this.pubKey = zr.fromHex(e.publicKey).toRawBytes(!0); - else - throw new Error("HDKey: no public or private key provided"); - this.pubHash = vg(this.pubKey); - } - derive(e) { - if (!/^[mM]'?/.test(e)) - throw new Error('Path must start with "m" or "M"'); - if (/^[mM]'?$/.test(e)) - return this; - const t = e.replace(/^[mM]'?\//, "").split("/"); - let r = this; - for (const s of t) { - const i = /^(\d+)('?)$/.exec(s), o = i && i[1]; - if (!i || i.length !== 3 || typeof o != "string") - throw new Error(`Invalid child index: ${s}`); - let a = +o; - if (!Number.isSafeInteger(a) || a >= Ks) - throw new Error("Invalid index"); - i[2] === "'" && (a += Ks), r = r.deriveChild(a); - } - return r; - } - deriveChild(e) { - if (!this.pubKey || !this.chainCode) - throw new Error("No publicKey or chainCode set"); - let t = Dr(e); - if (e >= Ks) { - const a = this.privateKey; - if (!a) - throw new Error("Could not derive hardened child key"); - t = sr(new Uint8Array([0]), a, t); - } else - t = sr(this.pubKey, t); - const r = Sr(vi, this.chainCode, t), s = Fo(r.slice(0, 32)), i = r.slice(32); - if (!lt.utils.isValidPrivateKey(s)) - throw new Error("Tweak bigger than curve order"); - const o = { - versions: this.versions, - chainCode: i, - depth: this.depth + 1, - parentFingerprint: this.fingerprint, - index: e - }; - try { - if (this.privateKey) { - const a = Ce(this.privKey + s, lt.CURVE.n); - if (!lt.utils.isValidPrivateKey(a)) - throw new Error("The tweak was out of range or the resulted private key is invalid"); - o.privateKey = a; - } else { - const a = zr.fromHex(this.pubKey).add(zr.fromPrivateKey(s)); - if (a.equals(zr.ZERO)) - throw new Error("The tweak was equal to negative P, which made the result key invalid"); - o.publicKey = a.toRawBytes(!0); - } - return new un(o); - } catch { - return this.deriveChild(e + 1); - } - } - sign(e) { - if (!this.privateKey) - throw new Error("No privateKey set!"); - return ft(e, 32), lt.sign(e, this.privKey).toCompactRawBytes(); - } - verify(e, t) { - if (ft(e, 32), ft(t, 64), !this.publicKey) - throw new Error("No publicKey set!"); - let r; - try { - r = lt.Signature.fromCompact(t); - } catch { - return !1; - } - return lt.verify(r, e, this.publicKey); - } - wipePrivateData() { - return this.privKey = void 0, this.privKeyBytes && (this.privKeyBytes.fill(0), this.privKeyBytes = void 0), this; - } - toJSON() { - return { - xpriv: this.privateExtendedKey, - xpub: this.publicExtendedKey - }; - } - serialize(e, t) { - if (!this.chainCode) - throw new Error("No chainCode set"); - return ft(t, 33), sr(Dr(e), new Uint8Array([this.depth]), Dr(this.parentFingerprint), Dr(this.index), this.chainCode, t); - } -} -var Bt, Br, Ti; -class sl { - constructor(e) { - X(this, Br); - X(this, Bt); - B(this, "nip04", { - encrypt: async (e, t) => pi.encrypt(h(this, Bt), e, t), - decrypt: async (e, t) => pi.decrypt(h(this, Bt), e, t) - }); - B(this, "nip44", { - encrypt: async (e, t) => { - const r = M(this, Br, Ti).call(this, e); - return Fr.v2.encrypt(t, r); - }, - decrypt: async (e, t) => { - const r = M(this, Br, Ti).call(this, e); - return Fr.v2.decrypt(t, r); - } - }); - q(this, Bt, e); - } - async getPublicKey() { - return od(h(this, Bt)); - } - async signEvent(e) { - return Ht(e, h(this, Bt)); - } -} -Bt = new WeakMap(), Br = new WeakSet(), Ti = function(e) { - return Fr.v2.utils.getConversationKey(h(this, Bt), e); -}; -class ho extends sl { - constructor(e, t = 0) { - const r = `m/44'/1237'/${t}'/0/0`, { privateKey: s } = un.fromMasterSeed(e).derive(r); - if (!s) - throw new Error("Could not derive private key"); - super(s); - } -} -var Or; -class Eg { - constructor(e) { - X(this, Or); - q(this, Or, e); - } - /** Get a signer for the given user. */ - async get(e, t = 0) { - const r = await crypto.subtle.importKey("raw", h(this, Or), { - name: "HMAC", - hash: { - name: "SHA-256" - } - }, !1, [ - "sign" - ]), s = new TextEncoder().encode(e), i = await crypto.subtle.sign("HMAC", r, s), o = new Uint8Array(i); - return new ho(o, t); - } -} -Or = new WeakMap(); -class ls { - /** NIP-05 value regex. */ - static regex() { - return /^(?:([\w.+-]+)@)?([\w.-]+)$/; - } - /** `nostr.json` response schema. */ - static nostrJsonSchema() { - return $.object({ - names: $.record($.string().regex(/^[\w.+-]+$/), ne.id()), - relays: $.record(ne.id(), $.array($.string().url())).optional() - }); - } - /** Resolve NIP-05 name to a profile pointer. */ - static async lookup(e, t) { - const { fetch: r = globalThis.fetch, signal: s } = t ?? {}, i = e.match(ls.regex()); - if (!i) throw new Error(`NIP-05: invalid name ${e}`); - const [o, a = "_", c] = i, l = new URL(`/.well-known/nostr.json?name=${encodeURIComponent(a)}`, `https://${c}/`), d = await r(l, { - signal: s - }), { names: u, relays: f } = ls.nostrJsonSchema().parse(await d.json()), m = u[a]; - if (!m) throw new Error(`NIP-05: no match for ${e}`); - return { - pubkey: m, - relays: (f == null ? void 0 : f[m]) ?? [] - }; - } -} -class _g { - static parseInput(e) { - const t = /(\b\w+:[^\s"]+)|(".*?")|(\S+)/g, r = []; - let s; - for (; (s = t.exec(e)) !== null; ) - if (s[1]) { - const [i, ...o] = s[1].split(":"); - r.push({ - key: i, - value: o.join(":") - }); - } else s[2] ? r.push(s[2].replace(/"/g, "")) : s[3] && r.push(s[3]); - return r; - } -} -const Sg = new TextEncoder(); -function kg(n) { - var t; - const e = typeof n; - return e !== "object" ? e : n === null ? "null" : ((t = n == null ? void 0 : n.constructor) == null ? void 0 : t.name) ?? "object"; -} -function il(n) { - if (typeof n == "string") - return Sg.encode(n); - if (n instanceof Uint8Array) - return n; - if (n instanceof ArrayBuffer) - return new Uint8Array(n); - throw new TypeError(`The input must be a Uint8Array, a string, or an ArrayBuffer. Received a value of the type ${kg(n)}.`); -} -const Go = new TextEncoder().encode("0123456789abcdef"); -new TextEncoder(); -const Ag = new TextDecoder(); -function Yo(n) { - const e = il(n), t = new Uint8Array(e.length * 2); - for (let r = 0; r < t.length; r++) { - const s = e[r]; - t[r * 2] = Go[s >> 4], t[r * 2 + 1] = Go[s & 15]; - } - return Ag.decode(t); -} -const St = [ - "A", - "B", - "C", - "D", - "E", - "F", - "G", - "H", - "I", - "J", - "K", - "L", - "M", - "N", - "O", - "P", - "Q", - "R", - "S", - "T", - "U", - "V", - "W", - "X", - "Y", - "Z", - "a", - "b", - "c", - "d", - "e", - "f", - "g", - "h", - "i", - "j", - "k", - "l", - "m", - "n", - "o", - "p", - "q", - "r", - "s", - "t", - "u", - "v", - "w", - "x", - "y", - "z", - "0", - "1", - "2", - "3", - "4", - "5", - "6", - "7", - "8", - "9", - "+", - "/" -]; -function Tg(n) { - const e = il(n); - let t = "", r; - const s = e.length; - for (r = 2; r < s; r += 3) - t += St[e[r - 2] >> 2], t += St[(e[r - 2] & 3) << 4 | e[r - 1] >> 4], t += St[(e[r - 1] & 15) << 2 | e[r] >> 6], t += St[e[r] & 63]; - return r === s + 1 && (t += St[e[r - 2] >> 2], t += St[(e[r - 2] & 3) << 4], t += "=="), r === s && (t += St[e[r - 2] >> 2], t += St[(e[r - 2] & 3) << 4 | e[r - 1] >> 4], t += St[(e[r - 1] & 15) << 2], t += "="), t; -} -function Bg(n) { - const e = atob(n), t = e.length, r = new Uint8Array(t); - for (let s = 0; s < t; s++) - r[s] = e.charCodeAt(s); - return r; -} -class Og { - /** Encode an event as a base64 string. */ - static encodeEvent(e) { - return Tg(JSON.stringify(e)); - } - /** Decode an event from a base64 string. Validates the event's structure but does not verify its signature. */ - static decodeEvent(e) { - const t = Bg(e), r = new TextDecoder().decode(t); - return ne.json().pipe(ne.event()).parse(r); - } -} -class Ig { - /** Generate an auth event template from a Request. */ - static async template(e, t) { - const { validatePayload: r = [ - "POST", - "PUT", - "PATCH" - ].includes(e.method) } = t ?? {}, { method: s, url: i } = e, o = [ - [ - "method", - s - ], - [ - "u", - i - ] - ]; - if (r) { - const a = await e.clone().arrayBuffer(), c = await crypto.subtle.digest("SHA-256", a); - o.push([ - "payload", - Yo(c) - ]); - } - return { - kind: 27235, - content: "", - tags: o, - created_at: Math.floor(Date.now() / 1e3) - }; - } - /** Compare the auth event with the request, throwing a human-readable error if validation fails. */ - static async verify(e, t) { - var m, b, g, p; - const { maxAge: r = 6e4, validatePayload: s = [ - "POST", - "PUT", - "PATCH" - ].includes(e.method), verifyEvent: i = Xn } = t ?? {}, o = e.headers.get("authorization"); - if (!o) - throw new Error("Missing Nostr authorization header"); - const a = (m = o.match(/^Nostr (.+)$/)) == null ? void 0 : m[1]; - if (!a) - throw new Error("Missing Nostr authorization token"); - const c = Og.decodeEvent(a); - if (!i(c)) - throw new Error("Event signature is invalid"); - const l = Date.now() - c.created_at * 1e3, d = (b = c.tags.find(([y]) => y === "u")) == null ? void 0 : b[1], u = (g = c.tags.find(([y]) => y === "method")) == null ? void 0 : g[1], f = (p = c.tags.find(([y]) => y === "payload")) == null ? void 0 : p[1]; - if (c.kind !== 27235) - throw new Error("Event must be kind 27235"); - if (d !== e.url) - throw new Error("Event URL does not match request URL"); - if (u !== e.method) - throw new Error("Event method does not match HTTP request method"); - if (l >= r) - throw new Error("Event expired"); - if (s && f !== void 0) { - const y = await e.clone().arrayBuffer(), w = await crypto.subtle.digest("SHA-256", y); - if (Yo(w) !== f) - throw new Error("Event payload does not match request body"); - } - return c; - } -} -class Bi { - /** Events are **regular**, which means they're all expected to be stored by relays. */ - static regular(e) { - return 1e3 <= e && e < 1e4 || [ - 1, - 2, - 4, - 5, - 6, - 7, - 8, - 16, - 40, - 41, - 42, - 43, - 44 - ].includes(e); - } - /** Events are **replaceable**, which means that, for each combination of `pubkey` and `kind`, only the latest event is expected to (SHOULD) be stored by relays, older versions are expected to be discarded. */ - static replaceable(e) { - return 1e4 <= e && e < 2e4 || [ - 0, - 3 - ].includes(e); - } - /** Events are **ephemeral**, which means they are not expected to be stored by relays. */ - static ephemeral(e) { - return 2e4 <= e && e < 3e4; - } - /** Events are **parameterized replaceable**, which means that, for each combination of `pubkey`, `kind` and the `d` tag, only the latest event is expected to be stored by relays, older versions are expected to be discarded. */ - static parameterizedReplaceable(e) { - return 3e4 <= e && e < 4e4; - } -} -function Cg(n, e, t, r) { - zc(n); - const s = Fp({ dkLen: 32, asyncTick: 10 }, r), { c: i, dkLen: o, asyncTick: a } = s; - if (or(i), or(o), or(a), i < 1) - throw new Error("PBKDF2: iterations (c) should be >= 1"); - const c = _r(e), l = _r(t), d = new Uint8Array(o), u = Sr.create(n, c), f = u._cloneInto().update(l); - return { c: i, dkLen: o, asyncTick: a, DK: d, PRF: u, PRFSalt: f }; -} -function $g(n, e, t, r, s) { - return n.destroy(), e.destroy(), r && r.destroy(), s.fill(0), t; -} -function Rg(n, e, t, r) { - const { c: s, dkLen: i, DK: o, PRF: a, PRFSalt: c } = Cg(n, e, t, r); - let l; - const d = new Uint8Array(4), u = yn(d), f = new Uint8Array(a.outputLen); - for (let m = 1, b = 0; b < i; m++, b += a.outputLen) { - const g = o.subarray(b, b + a.outputLen); - u.setInt32(0, m, !1), (l = c._cloneInto(l)).update(d).digestInto(f), g.set(f.subarray(0, g.length)); - for (let p = 1; p < s; p++) { - a._cloneInto(l).update(f).digestInto(f); - for (let y = 0; y < g.length; y++) - g[y] ^= f[y]; - } - } - return $g(a, c, o, l, f); -} -/*! scure-bip39 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */ -function ol(n) { - if (typeof n != "string") - throw new TypeError(`Invalid mnemonic type: ${typeof n}`); - return n.normalize("NFKD"); -} -function Ng(n) { - const e = ol(n), t = e.split(" "); - if (![12, 15, 18, 21, 24].includes(t.length)) - throw new Error("Invalid mnemonic"); - return { nfkd: e, words: t }; -} -const Lg = (n) => ol(`mnemonic${n}`); -function Ug(n, e = "") { - return Rg(vi, Ng(n).nfkd, Lg(e), { c: 2048, dkLen: 64 }); -} -class Hg extends ho { - constructor(e, t = {}) { - const { account: r, passphrase: s } = t, i = Ug(e, s); - super(i, r); - } -} -var al; -al = Symbol.asyncIterator; -var Ln, Un, Ir; -class fo { - constructor(e) { - X(this, Ln, []); - X(this, Un); - X(this, Ir, !1); - e != null && e.aborted ? this.abort() : e == null || e.addEventListener("abort", () => this.abort(), { - once: !0 - }); - } - /** Get messages as an AsyncIterable. */ - async *[al]() { - for (; !h(this, Ir); ) { - if (h(this, Ln).length) { - yield h(this, Ln).shift(); - continue; - } - await new Promise((e) => { - q(this, Un, e); - }); - } - throw new DOMException("The signal has been aborted", "AbortError"); - } - /** Push a message into the Machina instance, making it available to the consumer of `stream()`. */ - push(e) { - var t; - h(this, Ln).push(e), (t = h(this, Un)) == null || t.call(this); - } - /** Stops streaming and throws an error to the consumer. */ - abort() { - var e; - q(this, Ir, !0), (e = h(this, Un)) == null || e.call(this); - } -} -Ln = new WeakMap(), Un = new WeakMap(), Ir = new WeakMap(); -var cl; -cl = Symbol.asyncDispose; -class Mg { - constructor(e) { - B(this, "opts"); - B(this, "_relays"); - this.opts = e, this._relays = /* @__PURE__ */ new Map(); - } - /** Get or create a relay instance for the given URL. */ - relay(e) { - const t = this._relays.get(e); - if (t) - return t; - { - const r = this.opts.open(e); - return this._relays.set(e, r), r; - } - } - get relays() { - return this._relays; - } - async *req(e, t) { - const r = new AbortController(), s = t != null && t.signal ? AbortSignal.any([ - t.signal, - r.signal - ]) : r.signal, i = await this.opts.reqRouter(e); - if (i.size < 1) - return; - const o = new fo(s), a = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Set(); - for (const [l, d] of i.entries()) { - const u = this.relay(l); - (async () => { - for await (const f of u.req(d, { - signal: s - })) - f[0] === "EOSE" && (a.add(l), a.size === i.size && o.push(f)), f[0] === "CLOSED" && (c.add(l), c.size === i.size && o.push(f)), f[0] === "EVENT" && o.push(f); - })().catch(() => { - }); - } - try { - for await (const l of o) - yield l; - } finally { - r.abort(); - } - } - async event(e, t) { - const r = await this.opts.eventRouter(e); - r.length < 1 || await Promise.any(r.map((s) => this.relay(s).event(e, t))); - } - async query(e, t) { - const r = new Zn(), s = e.reduce((o, a) => o + nc(a), 0); - if (s === 0) return []; - const i = e.reduce((o, a) => { - var c; - return o || !!((c = a.kinds) != null && c.some((l) => Bi.replaceable(l) || Bi.parameterizedReplaceable(l))); - }, !1); - try { - for await (const o of this.req(e, t)) { - if (o[0] === "EOSE") break; - if (o[0] === "EVENT" && r.add(o[2]), o[0] === "CLOSED") throw new Error("Subscription closed"); - if (!i && r.size >= s) - break; - } - } catch { - } - return [ - ...r - ]; - } - /** Close all the relays in the pool. */ - async close() { - await Promise.all([ - ...this._relays.values() - ].map((e) => e.close())); - } - async [cl]() { - await this.close(); - } -} -class jg { - /** - * Creates a new ExponentialBackoff. - * @param base the base of the exponentiation - * @param expMax the maximum exponent, no bound if undefined - */ - constructor(e, t) { - if (this._retries = 0, !Number.isInteger(e) || e < 0) - throw new Error("Base must be a positive integer or zero"); - if (t !== void 0 && (!Number.isInteger(t) || t < 0)) - throw new Error("ExpMax must be a undefined, a positive integer or zero"); - this.base = e, this.expMax = t, this.i = 0; - } - get retries() { - return this._retries; - } - get current() { - return this.base * Math.pow(2, this.i); - } - next() { - return this._retries++, this.i = this.expMax === void 0 ? this.i + 1 : Math.min(this.i + 1, this.expMax), this.current; - } - reset() { - this._retries = 0, this.i = 0; - } -} -class Pg { - constructor() { - this.elements = []; - } - add(e) { - this.elements.push(e); - } - clear() { - this.elements.length = 0; - } - forEach(e) { - this.elements.forEach(e); - } - length() { - return this.elements.length; - } - isEmpty() { - return this.elements.length === 0; - } - peek() { - return this.elements[0]; - } - read() { - return this.elements.shift(); - } -} -var ie; -(function(n) { - n.open = "open", n.close = "close", n.error = "error", n.message = "message", n.retry = "retry", n.reconnect = "reconnect"; -})(ie || (ie = {})); -class Zg { - /** - * Creates a new websocket. - * - * @param url to connect to. - * @param protocols optional protocols to use. - * @param options optional options to use. - */ - constructor(e, t, r) { - var s, i, o, a, c, l, d, u, f, m, b, g, p, y, w; - this._closedByUser = !1, this.handleOpenEvent = (x) => this.handleEvent(ie.open, x), this.handleErrorEvent = (x) => this.handleEvent(ie.error, x), this.handleCloseEvent = (x) => this.handleEvent(ie.close, x), this.handleMessageEvent = (x) => this.handleEvent(ie.message, x), this._url = e, this._protocols = t, this._options = { - buffer: r == null ? void 0 : r.buffer, - retry: { - maxRetries: (s = r == null ? void 0 : r.retry) === null || s === void 0 ? void 0 : s.maxRetries, - instantReconnect: (i = r == null ? void 0 : r.retry) === null || i === void 0 ? void 0 : i.instantReconnect, - backoff: (o = r == null ? void 0 : r.retry) === null || o === void 0 ? void 0 : o.backoff - }, - listeners: { - open: [...(c = (a = r == null ? void 0 : r.listeners) === null || a === void 0 ? void 0 : a.open) !== null && c !== void 0 ? c : []], - close: [...(d = (l = r == null ? void 0 : r.listeners) === null || l === void 0 ? void 0 : l.close) !== null && d !== void 0 ? d : []], - error: [...(f = (u = r == null ? void 0 : r.listeners) === null || u === void 0 ? void 0 : u.error) !== null && f !== void 0 ? f : []], - message: [...(b = (m = r == null ? void 0 : r.listeners) === null || m === void 0 ? void 0 : m.message) !== null && b !== void 0 ? b : []], - retry: [...(p = (g = r == null ? void 0 : r.listeners) === null || g === void 0 ? void 0 : g.retry) !== null && p !== void 0 ? p : []], - reconnect: [...(w = (y = r == null ? void 0 : r.listeners) === null || y === void 0 ? void 0 : y.reconnect) !== null && w !== void 0 ? w : []] - } - }, this._underlyingWebsocket = this.tryConnect(); - } - /** - * Getter for the url. - * - * @return the url. - */ - get url() { - return this._url; - } - /** - * Getter for the protocols. - * - * @return the protocols, or undefined if none were provided. - */ - get protocols() { - return this._protocols; - } - /** - * Getter for the buffer. - * - * @return the buffer, or undefined if none was provided. - */ - get buffer() { - return this._options.buffer; - } - /** - * Getter for the maxRetries. - * - * @return the maxRetries, or undefined if none was provided (no limit). - */ - get maxRetries() { - return this._options.retry.maxRetries; - } - /** - * Getter for the instantReconnect. - * - * @return the instantReconnect, or undefined if none was provided. - */ - get instantReconnect() { - return this._options.retry.instantReconnect; - } - /** - * Getter for the backoff. - * - * @return the backoff, or undefined if none was provided. - */ - get backoff() { - return this._options.retry.backoff; - } - /** - * Whether the websocket was closed by the user. A websocket is closed by the user if the close(). - * - * @return true if the websocket was closed by the user, false otherwise. - */ - get closedByUser() { - return this._closedByUser; - } - /** - * Getter for the last 'open' event, e.g. the last time the websocket was connected. - * - * @return the last 'open' event, or undefined if the websocket was never connected. - */ - get lastConnection() { - return this._lastConnection; - } - /** - * Getter for the underlying websocket. This can be used to access the browser's native websocket directly. - * - * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket - * @return the underlying websocket. - */ - get underlyingWebsocket() { - return this._underlyingWebsocket; - } - /** - * Getter for the readyState of the underlying websocket. - * - * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/readyState - * @return the readyState of the underlying websocket. - */ - get readyState() { - return this._underlyingWebsocket.readyState; - } - /** - * Getter for the bufferedAmount of the underlying websocket. - * - * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/bufferedAmount - * @return the bufferedAmount of the underlying websocket. - */ - get bufferedAmount() { - return this._underlyingWebsocket.bufferedAmount; - } - /** - * Getter for the extensions of the underlying websocket. - * - * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/extensions - * @return the extensions of the underlying websocket. - */ - get extensions() { - return this._underlyingWebsocket.extensions; - } - /** - * Getter for the binaryType of the underlying websocket. - * - * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/binaryType - * @return the binaryType of the underlying websocket. - */ - get binaryType() { - return this._underlyingWebsocket.binaryType; - } - /** - * Setter for the binaryType of the underlying websocket. - * - * @param value to set, 'blob' or 'arraybuffer'. - */ - set binaryType(e) { - this._underlyingWebsocket.binaryType = e; - } - /** - * Sends data over the websocket. - * - * If the websocket is not connected and a buffer was provided on creation, the data will be added to the buffer. - * If no buffer was provided or the websocket was closed by the user, the data will be dropped. - * - * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/send - * @param data to send. - */ - send(e) { - this.closedByUser || (this._underlyingWebsocket.readyState === this._underlyingWebsocket.OPEN ? this._underlyingWebsocket.send(e) : this.buffer !== void 0 && this.buffer.add(e)); - } - /** - * Close the websocket. No connection-retry will be attempted after this. - * - * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/close - * @param code optional close code. - * @param reason optional close reason. - */ - close(e, t) { - this.cancelScheduledConnectionRetry(), this._closedByUser = !0, this._underlyingWebsocket.close(e, t); - } - /** - * Adds an event listener for the given event-type. - * - * @see https://developer.mozilla.org/en-US/docs/Web/API/EventTarget/addEventListener - * @param type of the event to add the listener for. - * @param listener to add. - * @param options to use when adding the listener. - */ - addEventListener(e, t, r) { - this._options.listeners[e].push({ listener: t, options: r }); - } - /** - * Removes one or more event listener for the given event-type that match the given listener and options. - * - * @param type of the event to remove the listener for. - * @param listener to remove. - * @param options that were used when the listener was added. - */ - removeEventListener(e, t, r) { - const s = (i) => i.listener !== t || i.options !== r; - this._options.listeners[e] = this._options.listeners[e].filter(s); - } - /** - * Creates a new browser-native websocket and connects it to the given URL with the given protocols - * and adds all event listeners to the browser-native websocket. - * - * @return the created browser-native websocket which is also stored in the '_underlyingWebsocket' property. - */ - tryConnect() { - return this._underlyingWebsocket = new WebSocket(this.url, this.protocols), this._underlyingWebsocket.addEventListener(ie.open, this.handleOpenEvent), this._underlyingWebsocket.addEventListener(ie.close, this.handleCloseEvent), this._underlyingWebsocket.addEventListener(ie.error, this.handleErrorEvent), this._underlyingWebsocket.addEventListener(ie.message, this.handleMessageEvent), this._underlyingWebsocket; - } - /** - * Removes all event listeners from the browser-native websocket and closes it. - */ - clearWebsocket() { - this._underlyingWebsocket.removeEventListener(ie.open, this.handleOpenEvent), this._underlyingWebsocket.removeEventListener(ie.close, this.handleCloseEvent), this._underlyingWebsocket.removeEventListener(ie.error, this.handleErrorEvent), this._underlyingWebsocket.removeEventListener(ie.message, this.handleMessageEvent), this._underlyingWebsocket.close(); - } - /** - * Dispatch an event to all listeners of the given event-type. - * - * @param type of the event to dispatch. - * @param event to dispatch. - */ - dispatchEvent(e, t) { - const r = this._options.listeners[e], s = []; - r.forEach(({ listener: i, options: o }) => { - i(this, t), (o === void 0 || o.once === void 0 || !o.once) && s.push({ listener: i, options: o }); - }), this._options.listeners[e] = s; - } - /** - * Handles the given event by dispatching it to all listeners of the given event-type. - * - * @param type of the event to handle. - * @param event to handle. - */ - handleEvent(e, t) { - switch (e) { - case ie.close: - this.dispatchEvent(e, t), this.scheduleConnectionRetryIfNeeded(); - break; - case ie.open: - if (this.backoff !== void 0 && this._lastConnection !== void 0) { - const r = { - retries: this.backoff.retries, - lastConnection: new Date(this._lastConnection) - }, s = new CustomEvent(ie.reconnect, { - detail: r - }); - this.dispatchEvent(ie.reconnect, s), this.backoff.reset(); - } - this._lastConnection = /* @__PURE__ */ new Date(), this.dispatchEvent(e, t), this.sendBufferedData(); - break; - case ie.retry: - this.dispatchEvent(e, t), this.clearWebsocket(), this.tryConnect(); - break; - default: - this.dispatchEvent(e, t); - break; - } - } - /** - * Sends buffered data if there is a buffer defined. - */ - sendBufferedData() { - if (this.buffer !== void 0) - for (let e = this.buffer.read(); e !== void 0; e = this.buffer.read()) - this.send(e); - } - /** - * Schedules a connection-retry if there is a backoff defined and the websocket was not closed by the user. - */ - scheduleConnectionRetryIfNeeded() { - if (this.closedByUser || this.backoff === void 0) - return; - const e = (r) => { - const s = new CustomEvent(ie.retry, { detail: r }); - this.handleEvent(ie.retry, s); - }, t = { - backoff: this._options.retry.instantReconnect === !0 ? 0 : this.backoff.next(), - retries: this._options.retry.instantReconnect === !0 ? 0 : this.backoff.retries, - lastConnection: this._lastConnection - }; - (this._options.retry.maxRetries === void 0 || t.retries <= this._options.retry.maxRetries) && (this.retryTimeout = globalThis.setTimeout(() => e(t), t.backoff)); - } - /** - * Cancels the scheduled connection-retry, if there is one. - */ - cancelScheduledConnectionRetry() { - globalThis.clearTimeout(this.retryTimeout); - } -} -class zg { - /** - * Creates a new WebsocketBuilder. - * - * @param url the url to connect to - */ - constructor(e) { - this._url = e; - } - /** - * Getter for the url. - * - * @returns the url - */ - get url() { - return this._url; - } - /** - * Adds protocols to the websocket. Subsequent calls to this method will override the previously set protocols. - * - * @param protocols the protocols to add - */ - withProtocols(e) { - return this._protocols = e, this; - } - /** - * Getter for the protocols. - * - * @returns the protocols, undefined if no protocols have been set - */ - get protocols() { - return this._protocols; - } - /** - * Sets the maximum number of retries before giving up. No limit if undefined. - * - * @param maxRetries the maximum number of retries before giving up - */ - withMaxRetries(e) { - var t; - return this._options = Object.assign(Object.assign({}, this._options), { retry: Object.assign(Object.assign({}, (t = this._options) === null || t === void 0 ? void 0 : t.retry), { maxRetries: e }) }), this; - } - /** - * Getter for the maximum number of retries before giving up. - * - * @returns the maximum number of retries before giving up, undefined if no maximum has been set - */ - get maxRetries() { - var e, t; - return (t = (e = this._options) === null || e === void 0 ? void 0 : e.retry) === null || t === void 0 ? void 0 : t.maxRetries; - } - /** - * Sets wether to reconnect immediately after a connection has been lost, ignoring the backoff strategy for the first retry. - * - * @param instantReconnect wether to reconnect immediately after a connection has been lost - */ - withInstantReconnect(e) { - var t; - return this._options = Object.assign(Object.assign({}, this._options), { retry: Object.assign(Object.assign({}, (t = this._options) === null || t === void 0 ? void 0 : t.retry), { instantReconnect: e }) }), this; - } - /** - * Getter for wether to reconnect immediately after a connection has been lost, ignoring the backoff strategy for the first retry. - * - * @returns wether to reconnect immediately after a connection has been lost, undefined if no value has been set - */ - get instantReconnect() { - var e, t; - return (t = (e = this._options) === null || e === void 0 ? void 0 : e.retry) === null || t === void 0 ? void 0 : t.instantReconnect; - } - /** - * Adds a backoff to the websocket. Subsequent calls to this method will override the previously set backoff. - * - * @param backoff the backoff to add - */ - withBackoff(e) { - var t; - return this._options = Object.assign(Object.assign({}, this._options), { retry: Object.assign(Object.assign({}, (t = this._options) === null || t === void 0 ? void 0 : t.retry), { backoff: e }) }), this; - } - /** - * Getter for the backoff. - * - * @returns the backoff, undefined if no backoff has been set - */ - get backoff() { - var e, t; - return (t = (e = this._options) === null || e === void 0 ? void 0 : e.retry) === null || t === void 0 ? void 0 : t.backoff; - } - /** - * Adds a buffer to the websocket. Subsequent calls to this method will override the previously set buffer. - * - * @param buffer the buffer to add - */ - withBuffer(e) { - return this._options = Object.assign(Object.assign({}, this._options), { buffer: e }), this; - } - /** - * Getter for the buffer. - * - * @returns the buffer, undefined if no buffer has been set - */ - get buffer() { - var e; - return (e = this._options) === null || e === void 0 ? void 0 : e.buffer; - } - /** - * Adds an 'open' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be - * called in the order they were added. - * - * @param listener the listener to add - * @param options the listener options - */ - onOpen(e, t) { - return this.addListener(ie.open, e, t), this; - } - /** - * Adds an 'close' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be - * called in the order they were added. - * - * @param listener the listener to add - * @param options the listener options - */ - onClose(e, t) { - return this.addListener(ie.close, e, t), this; - } - /** - * Adds an 'error' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be - * called in the order they were added. - * - * @param listener the listener to add - * @param options the listener options - */ - onError(e, t) { - return this.addListener(ie.error, e, t), this; - } - /** - * Adds an 'message' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be - * called in the order they were added. - * - * @param listener the listener to add - * @param options the listener options - */ - onMessage(e, t) { - return this.addListener(ie.message, e, t), this; - } - /** - * Adds an 'retry' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be - * called in the order they were added. - * - * @param listener the listener to add - * @param options the listener options - */ - onRetry(e, t) { - return this.addListener(ie.retry, e, t), this; - } - /** - * Adds an 'reconnect' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be - * called in the order they were added. - * - * @param listener the listener to add - * @param options the listener options - */ - onReconnect(e, t) { - return this.addListener(ie.reconnect, e, t), this; - } - /** - * Builds the websocket. - * - * @return a new websocket, with the set options - */ - build() { - return new Zg(this._url, this._protocols, this._options); - } - /** - * Adds an event listener to the options. - * - * @param event the event to add the listener to - * @param listener the listener to add - * @param options the listener options - */ - addListener(e, t, r) { - var s, i, o, a, c, l, d, u, f, m, b, g, p, y, w, x, A, T, _, S, k; - return this._options = Object.assign(Object.assign({}, this._options), { listeners: { - open: (o = (i = (s = this._options) === null || s === void 0 ? void 0 : s.listeners) === null || i === void 0 ? void 0 : i.open) !== null && o !== void 0 ? o : [], - close: (l = (c = (a = this._options) === null || a === void 0 ? void 0 : a.listeners) === null || c === void 0 ? void 0 : c.close) !== null && l !== void 0 ? l : [], - error: (f = (u = (d = this._options) === null || d === void 0 ? void 0 : d.listeners) === null || u === void 0 ? void 0 : u.error) !== null && f !== void 0 ? f : [], - message: (g = (b = (m = this._options) === null || m === void 0 ? void 0 : m.listeners) === null || b === void 0 ? void 0 : b.message) !== null && g !== void 0 ? g : [], - retry: (w = (y = (p = this._options) === null || p === void 0 ? void 0 : p.listeners) === null || y === void 0 ? void 0 : y.retry) !== null && w !== void 0 ? w : [], - reconnect: (T = (A = (x = this._options) === null || x === void 0 ? void 0 : x.listeners) === null || A === void 0 ? void 0 : A.reconnect) !== null && T !== void 0 ? T : [], - [e]: [ - ...(k = (S = (_ = this._options) === null || _ === void 0 ? void 0 : _.listeners) === null || S === void 0 ? void 0 : S[e]) !== null && k !== void 0 ? k : [], - { listener: t, options: r } - ] - } }), this; - } -} -var ll; -ll = Symbol.asyncDispose; -class Dg { - constructor(e, t = {}) { - B(this, "url"); - B(this, "opts"); - B(this, "socket"); - B(this, "subs"); - B(this, "closedByUser"); - B(this, "idleTimer"); - B(this, "ee"); - this.url = e, this.opts = t, this.subs = /* @__PURE__ */ new Map(), this.closedByUser = !1, this.ee = new EventTarget(), this.socket = this.createSocket(), this.maybeStartIdleTimer(); - } - get subscriptions() { - return [ - ...this.subs.values() - ]; - } - /** Create (and open) a WebSocket connection with automatic reconnect. */ - createSocket() { - const { backoff: e = new jg(1e3) } = this.opts; - return new zg(this.url).withBuffer(new Pg()).withBackoff(e === !1 ? void 0 : e).onOpen(() => { - for (const t of this.subs.values()) - this.send(t); - }).onClose(() => { - this.subs.size || this.socket.close(); - }).onMessage((t, r) => { - const s = ne.json().pipe(ne.relayMsg()).safeParse(r.data); - s.success && this.receive(s.data); - }).build(); - } - /** Handle a NIP-01 relay message. */ - receive(e) { - const { auth: t, verifyEvent: r = Xn } = this.opts; - switch (e[0]) { - case "EVENT": - if (!r(e[2])) break; - this.ee.dispatchEvent(new CustomEvent(`sub:${e[1]}`, { - detail: e - })); - break; - case "EOSE": - this.ee.dispatchEvent(new CustomEvent(`sub:${e[1]}`, { - detail: e - })); - break; - case "CLOSED": - this.subs.delete(e[1]), this.maybeStartIdleTimer(), this.ee.dispatchEvent(new CustomEvent(`sub:${e[1]}`, { - detail: e - })); - break; - case "OK": - this.ee.dispatchEvent(new CustomEvent(`ok:${e[1]}`, { - detail: e - })); - break; - case "NOTICE": - this.ee.dispatchEvent(new CustomEvent("notice", { - detail: e - })); - break; - case "COUNT": - this.ee.dispatchEvent(new CustomEvent(`count:${e[1]}`, { - detail: e - })); - break; - case "AUTH": - t == null || t(e[1]).then((s) => this.send([ - "AUTH", - s - ])).catch(() => { - }); - } - } - /** Send a NIP-01 client message to the relay. */ - send(e) { - switch (this.wake(), e[0]) { - case "REQ": - this.subs.set(e[1], e); - break; - case "CLOSE": - this.subs.delete(e[1]), this.maybeStartIdleTimer(); - break; - case "EVENT": - case "COUNT": - return this.socket.send(JSON.stringify(e)); - } - this.socket.readyState === WebSocket.OPEN && this.socket.send(JSON.stringify(e)); - } - async *req(e, t = {}) { - const { signal: r } = t, s = crypto.randomUUID(), i = this.on(`sub:${s}`, r), o = [ - "REQ", - s, - ...e - ]; - this.send(o); - try { - for await (const a of i) { - if (a[0] === "EOSE" && (yield a), a[0] === "CLOSED") break; - if (a[0] === "EVENT") - if (fi(e, a[2])) - yield a; - else - continue; - } - } finally { - this.send([ - "CLOSE", - s - ]); - } - } - async query(e, t) { - const r = new Zn(), s = e.reduce((i, o) => i + nc(o), 0); - if (s === 0) return []; - for await (const i of this.req(e, t)) { - if (i[0] === "EOSE") break; - if (i[0] === "EVENT" && r.add(i[2]), i[0] === "CLOSED") throw new Error("Subscription closed"); - if (r.size >= s) - break; - } - return [ - ...r - ]; - } - async event(e, t) { - const r = this.once(`ok:${e.id}`, t == null ? void 0 : t.signal); - this.send([ - "EVENT", - e - ]); - const [, , s, i] = await r; - if (!s) - throw new Error(i); - } - async count(e, t) { - const r = crypto.randomUUID(), s = this.once(`count:${r}`, t == null ? void 0 : t.signal); - this.send([ - "COUNT", - r, - ...e - ]); - const [, , i] = await s; - return i; - } - /** Get a stream of EE events. */ - async *on(e, t) { - if (t != null && t.aborted) throw this.abortError(); - const r = new fo(t), s = (i) => r.push(i.detail); - this.ee.addEventListener(e, s); - try { - for await (const i of r) - yield i; - } finally { - this.ee.removeEventListener(e, s); - } - } - /** Wait for a single EE event. */ - async once(e, t) { - for await (const r of this.on(e, t)) - return r; - throw new Error("Unreachable"); - } - abortError() { - return new DOMException("The signal has been aborted", "AbortError"); - } - /** Start the idle time if applicable. */ - maybeStartIdleTimer() { - const { idleTimeout: e = 3e4 } = this.opts; - e !== !1 && (this.idleTimer || this.subs.size || this.closedByUser || (this.idleTimer = setTimeout(() => this.socket.close(), e))); - } - /** Stop the idle timer. */ - stopIdleTimer() { - clearTimeout(this.idleTimer), this.idleTimer = void 0; - } - /** Make a new WebSocket, but only if it was closed by an idle timeout. */ - wake() { - this.stopIdleTimer(), !this.closedByUser && this.socket.closedByUser && (this.socket = this.createSocket()); - } - /** - * Close the relay connection and prevent it from reconnecting. - * After this you should dispose of the `NRelay1` instance and create a new one to connect again. - */ - async close() { - this.closedByUser = !0, this.socket.close(), this.stopIdleTimer(), this.socket.readyState !== WebSocket.CLOSED && await new Promise((e) => { - this.socket.addEventListener(ie.close, e, { - once: !0 - }); - }); - } - async [ll]() { - await this.close(); - } -} -var an = Symbol("verified"), qg = (n) => n instanceof Object; -function Vg(n) { - if (!qg(n) || typeof n.kind != "number" || typeof n.content != "string" || typeof n.created_at != "number" || typeof n.pubkey != "string" || !n.pubkey.match(/^[a-f0-9]{64}$/) || !Array.isArray(n.tags)) - return !1; - for (let e = 0; e < n.tags.length; e++) { - let t = n.tags[e]; - if (!Array.isArray(t)) - return !1; - for (let r = 0; r < t.length; r++) - if (typeof t[r] == "object") - return !1; - } - return !0; -} -new TextDecoder("utf-8"); -var Kg = new TextEncoder(); -function ir(n) { - n.indexOf("://") === -1 && (n = "wss://" + n); - let e = new URL(n); - return e.pathname = e.pathname.replace(/\/+/g, "/"), e.pathname.endsWith("/") && (e.pathname = e.pathname.slice(0, -1)), (e.port === "80" && e.protocol === "ws:" || e.port === "443" && e.protocol === "wss:") && (e.port = ""), e.searchParams.sort(), e.hash = "", e.toString(); -} -var Wg = class { - constructor(n) { - B(this, "value"); - B(this, "next", null); - B(this, "prev", null); - this.value = n; - } -}, Fg = class { - constructor() { - B(this, "first"); - B(this, "last"); - this.first = null, this.last = null; - } - enqueue(n) { - const e = new Wg(n); - return this.last ? this.last === this.first ? (this.last = e, this.last.prev = this.first, this.first.next = e) : (e.prev = this.last, this.last.next = e, this.last = e) : (this.first = e, this.last = e), !0; - } - dequeue() { - if (!this.first) - return null; - if (this.first === this.last) { - const e = this.first; - return this.first = null, this.last = null, e.value; - } - const n = this.first; - return this.first = n.next, n.value; - } -}, Gg = class { - generateSecretKey() { - return dt.utils.randomPrivateKey(); - } - getPublicKey(n) { - return ve(dt.getPublicKey(n)); - } - finalizeEvent(n, e) { - const t = n; - return t.pubkey = ve(dt.getPublicKey(e)), t.id = Ws(t), t.sig = ve(dt.sign(Ws(t), e)), t[an] = !0, t; - } - verifyEvent(n) { - if (typeof n[an] == "boolean") - return n[an]; - const e = Ws(n); - if (e !== n.id) - return n[an] = !1, !1; - try { - const t = dt.verify(n.sig, e, n.pubkey); - return n[an] = t, t; - } catch { - return n[an] = !1, !1; - } - } -}; -function Yg(n) { - if (!Vg(n)) - throw new Error("can't serialize event with wrong or missing properties"); - return JSON.stringify([0, n.pubkey, n.created_at, n.kind, n.tags, n.content]); -} -function Ws(n) { - let e = Yn(Kg.encode(Yg(n))); - return ve(e); -} -var Ts = new Gg(); -Ts.generateSecretKey; -Ts.getPublicKey; -Ts.finalizeEvent; -Ts.verifyEvent; -var Jg = 22242; -function Xg(n, e) { - if (n.ids && n.ids.indexOf(e.id) === -1 || n.kinds && n.kinds.indexOf(e.kind) === -1 || n.authors && n.authors.indexOf(e.pubkey) === -1) - return !1; - for (let t in n) - if (t[0] === "#") { - let r = t.slice(1), s = n[`#${r}`]; - if (s && !e.tags.find(([i, o]) => i === t.slice(1) && s.indexOf(o) !== -1)) - return !1; - } - return !(n.since && e.created_at < n.since || n.until && e.created_at > n.until); -} -function Qg(n, e) { - for (let t = 0; t < n.length; t++) - if (Xg(n[t], e)) - return !0; - return !1; -} -function ey(n, e) { - let t = e.length + 3, r = n.indexOf(`"${e}":`) + t, s = n.slice(r).indexOf('"') + r + 1; - return n.slice(s, s + 64); -} -function ty(n) { - let e = n.slice(0, 22).indexOf('"EVENT"'); - if (e === -1) - return null; - let t = n.slice(e + 7 + 1).indexOf('"'); - if (t === -1) - return null; - let r = e + 7 + 1 + t, s = n.slice(r + 1, 80).indexOf('"'); - if (s === -1) - return null; - let i = r + 1 + s; - return n.slice(r + 1, i); -} -function ny(n, e) { - return { - kind: Jg, - created_at: Math.floor(Date.now() / 1e3), - tags: [ - ["relay", n], - ["challenge", e] - ], - content: "" - }; -} -async function ry() { - return new Promise((n) => { - const e = new MessageChannel(), t = () => { - e.port1.removeEventListener("message", t), n(); - }; - e.port1.addEventListener("message", t), e.port2.postMessage(0), e.port1.start(); - }); -} -var sy = (n) => (n[an] = !0, !0), ul = class { - constructor(n, e) { - B(this, "url"); - B(this, "_connected", !1); - B(this, "onclose", null); - B(this, "onnotice", (n) => console.debug(`NOTICE from ${this.url}: ${n}`)); - B(this, "_onauth", null); - B(this, "baseEoseTimeout", 4400); - B(this, "connectionTimeout", 4400); - B(this, "openSubs", /* @__PURE__ */ new Map()); - B(this, "connectionTimeoutHandle"); - B(this, "connectionPromise"); - B(this, "openCountRequests", /* @__PURE__ */ new Map()); - B(this, "openEventPublishes", /* @__PURE__ */ new Map()); - B(this, "ws"); - B(this, "incomingMessageQueue", new Fg()); - B(this, "queueRunning", !1); - B(this, "challenge"); - B(this, "serial", 0); - B(this, "verifyEvent"); - B(this, "_WebSocket"); - this.url = ir(n), this.verifyEvent = e.verifyEvent, this._WebSocket = e.websocketImplementation || WebSocket; - } - static async connect(n, e) { - const t = new ul(n, e); - return await t.connect(), t; - } - closeAllSubscriptions(n) { - for (let [e, t] of this.openSubs) - t.close(n); - this.openSubs.clear(); - for (let [e, t] of this.openEventPublishes) - t.reject(new Error(n)); - this.openEventPublishes.clear(); - for (let [e, t] of this.openCountRequests) - t.reject(new Error(n)); - this.openCountRequests.clear(); - } - get connected() { - return this._connected; - } - async connect() { - return this.connectionPromise ? this.connectionPromise : (this.challenge = void 0, this.connectionPromise = new Promise((n, e) => { - this.connectionTimeoutHandle = setTimeout(() => { - var t; - e("connection timed out"), this.connectionPromise = void 0, (t = this.onclose) == null || t.call(this), this.closeAllSubscriptions("relay connection timed out"); - }, this.connectionTimeout); - try { - this.ws = new this._WebSocket(this.url); - } catch (t) { - e(t); - return; - } - this.ws.onopen = () => { - clearTimeout(this.connectionTimeoutHandle), this._connected = !0, n(); - }, this.ws.onerror = (t) => { - var r; - e(t.message || "websocket error"), this._connected && (this._connected = !1, this.connectionPromise = void 0, (r = this.onclose) == null || r.call(this), this.closeAllSubscriptions("relay connection errored")); - }, this.ws.onclose = async () => { - var t; - this._connected && (this._connected = !1, this.connectionPromise = void 0, (t = this.onclose) == null || t.call(this), this.closeAllSubscriptions("relay connection closed")); - }, this.ws.onmessage = this._onmessage.bind(this); - }), this.connectionPromise); - } - async runQueue() { - for (this.queueRunning = !0; this.handleNext() !== !1; ) - await ry(); - this.queueRunning = !1; - } - handleNext() { - var t, r, s; - const n = this.incomingMessageQueue.dequeue(); - if (!n) - return !1; - const e = ty(n); - if (e) { - const i = this.openSubs.get(e); - if (!i) - return; - const o = ey(n, "id"), a = (t = i.alreadyHaveEvent) == null ? void 0 : t.call(i, o); - if ((r = i.receivedEvent) == null || r.call(i, this, o), a) - return; - } - try { - let i = JSON.parse(n); - switch (i[0]) { - case "EVENT": { - const o = this.openSubs.get(i[1]), a = i[2]; - this.verifyEvent(a) && Qg(o.filters, a) && o.onevent(a); - return; - } - case "COUNT": { - const o = i[1], a = i[2], c = this.openCountRequests.get(o); - c && (c.resolve(a.count), this.openCountRequests.delete(o)); - return; - } - case "EOSE": { - const o = this.openSubs.get(i[1]); - if (!o) - return; - o.receivedEose(); - return; - } - case "OK": { - const o = i[1], a = i[2], c = i[3], l = this.openEventPublishes.get(o); - a ? l.resolve(c) : l.reject(new Error(c)), this.openEventPublishes.delete(o); - return; - } - case "CLOSED": { - const o = i[1], a = this.openSubs.get(o); - if (!a) - return; - a.closed = !0, a.close(i[2]); - return; - } - case "NOTICE": - this.onnotice(i[1]); - return; - case "AUTH": { - this.challenge = i[1], (s = this._onauth) == null || s.call(this, i[1]); - return; - } - } - } catch { - return; - } - } - async send(n) { - if (!this.connectionPromise) - throw new Error("sending on closed connection"); - this.connectionPromise.then(() => { - var e; - (e = this.ws) == null || e.send(n); - }); - } - async auth(n) { - if (!this.challenge) - throw new Error("can't perform auth, no challenge was received"); - const e = await n(ny(this.url, this.challenge)), t = new Promise((r, s) => { - this.openEventPublishes.set(e.id, { resolve: r, reject: s }); - }); - return this.send('["AUTH",' + JSON.stringify(e) + "]"), t; - } - async publish(n) { - const e = new Promise((t, r) => { - this.openEventPublishes.set(n.id, { resolve: t, reject: r }); - }); - return this.send('["EVENT",' + JSON.stringify(n) + "]"), e; - } - async count(n, e) { - this.serial++; - const t = (e == null ? void 0 : e.id) || "count:" + this.serial, r = new Promise((s, i) => { - this.openCountRequests.set(t, { resolve: s, reject: i }); - }); - return this.send('["COUNT","' + t + '",' + JSON.stringify(n).substring(1)), r; - } - subscribe(n, e) { - const t = this.prepareSubscription(n, e); - return t.fire(), t; - } - prepareSubscription(n, e) { - this.serial++; - const t = e.id || "sub:" + this.serial, r = new iy(this, t, n, e); - return this.openSubs.set(t, r), r; - } - close() { - var n; - this.closeAllSubscriptions("relay connection closed by us"), this._connected = !1, (n = this.ws) == null || n.close(); - } - _onmessage(n) { - this.incomingMessageQueue.enqueue(n.data), this.queueRunning || this.runQueue(); - } -}, iy = class { - constructor(n, e, t, r) { - B(this, "relay"); - B(this, "id"); - B(this, "closed", !1); - B(this, "eosed", !1); - B(this, "filters"); - B(this, "alreadyHaveEvent"); - B(this, "receivedEvent"); - B(this, "onevent"); - B(this, "oneose"); - B(this, "onclose"); - B(this, "eoseTimeout"); - B(this, "eoseTimeoutHandle"); - this.relay = n, this.filters = t, this.id = e, this.alreadyHaveEvent = r.alreadyHaveEvent, this.receivedEvent = r.receivedEvent, this.eoseTimeout = r.eoseTimeout || n.baseEoseTimeout, this.oneose = r.oneose, this.onclose = r.onclose, this.onevent = r.onevent || ((s) => { - console.warn( - `onevent() callback not defined for subscription '${this.id}' in relay ${this.relay.url}. event received:`, - s - ); - }); - } - fire() { - this.relay.send('["REQ","' + this.id + '",' + JSON.stringify(this.filters).substring(1)), this.eoseTimeoutHandle = setTimeout(this.receivedEose.bind(this), this.eoseTimeout); - } - receivedEose() { - var n; - this.eosed || (clearTimeout(this.eoseTimeoutHandle), this.eosed = !0, (n = this.oneose) == null || n.call(this)); - } - close(n = "closed by caller") { - var e; - !this.closed && this.relay.connected && (this.relay.send('["CLOSE",' + JSON.stringify(this.id) + "]"), this.closed = !0), this.relay.openSubs.delete(this.id), (e = this.onclose) == null || e.call(this, n); - } -}, oy = class { - constructor(n) { - B(this, "relays", /* @__PURE__ */ new Map()); - B(this, "seenOn", /* @__PURE__ */ new Map()); - B(this, "trackRelays", !1); - B(this, "verifyEvent"); - B(this, "trustedRelayURLs", /* @__PURE__ */ new Set()); - B(this, "_WebSocket"); - this.verifyEvent = n.verifyEvent, this._WebSocket = n.websocketImplementation; - } - async ensureRelay(n, e) { - n = ir(n); - let t = this.relays.get(n); - return t || (t = new ul(n, { - verifyEvent: this.trustedRelayURLs.has(n) ? sy : this.verifyEvent, - websocketImplementation: this._WebSocket - }), e != null && e.connectionTimeout && (t.connectionTimeout = e.connectionTimeout), this.relays.set(n, t)), await t.connect(), t; - } - close(n) { - n.map(ir).forEach((e) => { - var t; - (t = this.relays.get(e)) == null || t.close(); - }); - } - subscribeMany(n, e, t) { - return this.subscribeManyMap(Object.fromEntries(n.map((r) => [r, e])), t); - } - subscribeManyMap(n, e) { - this.trackRelays && (e.receivedEvent = (u, f) => { - let m = this.seenOn.get(f); - m || (m = /* @__PURE__ */ new Set(), this.seenOn.set(f, m)), m.add(u); - }); - const t = /* @__PURE__ */ new Set(), r = [], s = Object.keys(n).length, i = []; - let o = (u) => { - var f; - i[u] = !0, i.filter((m) => m).length === s && ((f = e.oneose) == null || f.call(e), o = () => { - }); - }; - const a = []; - let c = (u, f) => { - var m; - o(u), a[u] = f, a.filter((b) => b).length === s && ((m = e.onclose) == null || m.call(e, a), c = () => { - }); - }; - const l = (u) => { - var m; - if ((m = e.alreadyHaveEvent) != null && m.call(e, u)) - return !0; - const f = t.has(u); - return t.add(u), f; - }, d = Promise.all( - Object.entries(n).map(async (u, f, m) => { - if (m.indexOf(u) !== f) { - c(f, "duplicate url"); - return; - } - let [b, g] = u; - b = ir(b); - let p; - try { - p = await this.ensureRelay(b, { - connectionTimeout: e.maxWait ? Math.max(e.maxWait * 0.8, e.maxWait - 1e3) : void 0 - }); - } catch (w) { - c(f, (w == null ? void 0 : w.message) || String(w)); - return; - } - let y = p.subscribe(g, { - ...e, - oneose: () => o(f), - onclose: (w) => c(f, w), - alreadyHaveEvent: l, - eoseTimeout: e.maxWait - }); - r.push(y); - }) - ); - return { - async close() { - await d, r.forEach((u) => { - u.close(); - }); - } - }; - } - subscribeManyEose(n, e, t) { - const r = this.subscribeMany(n, e, { - ...t, - oneose() { - r.close(); - } - }); - return r; - } - async querySync(n, e, t) { - return new Promise(async (r) => { - const s = []; - this.subscribeManyEose(n, [e], { - ...t, - onevent(i) { - s.push(i); - }, - onclose(i) { - r(s); - } - }); - }); - } - async get(n, e, t) { - e.limit = 1; - const r = await this.querySync(n, e, t); - return r.sort((s, i) => i.created_at - s.created_at), r[0] || null; - } - publish(n, e) { - return n.map(ir).map(async (t, r, s) => s.indexOf(t) !== r ? Promise.reject("duplicate url") : (await this.ensureRelay(t)).publish(e)); - } - listConnectionStatus() { - const n = /* @__PURE__ */ new Map(); - return this.relays.forEach((e, t) => n.set(t, e.connected)), n; - } - destroy() { - this.relays.forEach((n) => n.close()), this.relays = /* @__PURE__ */ new Map(); - } -}, ay; -try { - ay = WebSocket; -} catch { -} -class cy { - constructor(e) { - B(this, "pool"); - this.pool = new oy({ - verifyEvent: (e == null ? void 0 : e.verifyEvent) ?? Xn - }), this.pool.trackRelays = (e == null ? void 0 : e.trackRelays) ?? !1, this.pool.trustedRelayURLs = (e == null ? void 0 : e.trustedRelayURLs) ?? /* @__PURE__ */ new Set(); - } - get seenOn() { - const e = /* @__PURE__ */ new Map(); - for (const [t, r] of this.pool.seenOn) - e.set(t, new Set([ - ...r - ].map((s) => s.url))); - return e; - } - async *req(e, t = {}) { - var c, l; - if ((c = t.signal) != null && c.aborted) throw new DOMException("The signal has been aborted", "AbortError"); - const r = crypto.randomUUID(), s = new fo(t.signal), i = this.pool.subscribeMany(t.relays ?? [], e, { - id: r, - onevent(d) { - s.push([ - "EVENT", - r, - d - ]); - }, - oneose() { - s.push([ - "EOSE", - r - ]); - }, - onclose(d) { - s.push([ - "CLOSED", - r, - d.join(", ") - ]); - } - }), o = () => { - i.close(), a(); - }, a = () => { - var d; - (d = t.signal) == null || d.removeEventListener("abort", o); - }; - (l = t.signal) == null || l.addEventListener("abort", o); - try { - for await (const d of s) - yield d; - } finally { - o(); - } - } - // deno-lint-ignore require-await - async event(e, t = {}) { - var r; - if ((r = t.signal) != null && r.aborted) - throw new DOMException("The signal has been aborted", "AbortError"); - this.pool.publish(t.relays ?? [], e); - } - async query(e, t = {}) { - const r = []; - for await (const s of this.req(e, t)) { - if (s[0] === "EOSE") break; - if (s[0] === "EVENT" && r.push(s[2]), s[0] === "CLOSED") throw new Error("Subscription closed"); - } - return r; - } - /** Disconnect from the given relay URLs. */ - disconnect(e) { - this.pool.close(e); - } - // deno-lint-ignore require-await - async close() { - this.pool.destroy(); - } -} -const Sy = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({ - __proto__: null, - NCache: Mf, - NConnectSigner: Zp, - NCustodial: Eg, - NIP05: ls, - NIP50: _g, - NIP98: Ig, - NKinds: Bi, - NPhraseSigner: Hg, - NPool: Mg, - NRelay1: Dg, - NSchema: ne, - NSecSigner: sl, - NSeedSigner: ho, - NSet: Zn, - NSimplePool: cy -}, Symbol.toStringTag, { value: "Module" })); -export { - Sy as Nostrify -}; -//# sourceMappingURL=nostrify.js.map diff --git a/vendor/javascript/nostrify.js.map b/vendor/javascript/nostrify.js.map deleted file mode 100644 index ae4b9ca..0000000 --- a/vendor/javascript/nostrify.js.map +++ /dev/null @@ -1 +0,0 @@ -{"version":3,"file":"nostrify.js","sources":["../node_modules/lru-cache/dist/esm/index.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/@nostrify/nostrify/NSet.js","../node_modules/@nostrify/nostrify/NCache.js","../node_modules/zod/lib/index.mjs","../node_modules/@nostrify/nostrify/NSchema.js","../node_modules/@nostrify/nostrify/NConnectSigner.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/hmac.js","../node_modules/@noble/hashes/esm/_md.js","../node_modules/@noble/hashes/esm/ripemd160.js","../node_modules/@noble/hashes/esm/sha256.js","../node_modules/@noble/hashes/esm/_u64.js","../node_modules/@noble/hashes/esm/sha512.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/@scure/base/lib/esm/index.js","../node_modules/@scure/bip32/lib/esm/index.js","../node_modules/@nostrify/nostrify/NSecSigner.js","../node_modules/@nostrify/nostrify/NSeedSigner.js","../node_modules/@nostrify/nostrify/NCustodial.js","../node_modules/@nostrify/nostrify/NIP05.js","../node_modules/@nostrify/nostrify/NIP50.js","../node_modules/@jsr/std__encoding/_validate_binary_like.js","../node_modules/@jsr/std__encoding/hex.js","../node_modules/@jsr/std__encoding/base64.js","../node_modules/@nostrify/nostrify/utils/N64.js","../node_modules/@nostrify/nostrify/NIP98.js","../node_modules/@nostrify/nostrify/NKinds.js","../node_modules/@noble/hashes/esm/pbkdf2.js","../node_modules/@scure/bip39/esm/index.js","../node_modules/@nostrify/nostrify/NPhraseSigner.js","../node_modules/@nostrify/nostrify/utils/Machina.js","../node_modules/@nostrify/nostrify/NPool.js","../node_modules/websocket-ts/dist/esm/src/backoff/exponentialbackoff.js","../node_modules/websocket-ts/dist/esm/src/queue/array_queue.js","../node_modules/websocket-ts/dist/esm/src/websocket_event.js","../node_modules/websocket-ts/dist/esm/src/websocket.js","../node_modules/websocket-ts/dist/esm/src/websocket_builder.js","../node_modules/@nostrify/nostrify/NRelay1.js","../node_modules/nostr-tools/lib/esm/pool.js","../node_modules/@nostrify/nostrify/NSimplePool.js"],"sourcesContent":["/**\n * @module LRUCache\n */\nconst perf = typeof performance === 'object' &&\n performance &&\n typeof performance.now === 'function'\n ? performance\n : Date;\nconst warned = new Set();\n/* c8 ignore start */\nconst PROCESS = (typeof process === 'object' && !!process ? process : {});\n/* c8 ignore start */\nconst emitWarning = (msg, type, code, fn) => {\n typeof PROCESS.emitWarning === 'function'\n ? PROCESS.emitWarning(msg, type, code, fn)\n : console.error(`[${code}] ${type}: ${msg}`);\n};\nlet AC = globalThis.AbortController;\nlet AS = globalThis.AbortSignal;\n/* c8 ignore start */\nif (typeof AC === 'undefined') {\n //@ts-ignore\n AS = class AbortSignal {\n onabort;\n _onabort = [];\n reason;\n aborted = false;\n addEventListener(_, fn) {\n this._onabort.push(fn);\n }\n };\n //@ts-ignore\n AC = class AbortController {\n constructor() {\n warnACPolyfill();\n }\n signal = new AS();\n abort(reason) {\n if (this.signal.aborted)\n return;\n //@ts-ignore\n this.signal.reason = reason;\n //@ts-ignore\n this.signal.aborted = true;\n //@ts-ignore\n for (const fn of this.signal._onabort) {\n fn(reason);\n }\n this.signal.onabort?.(reason);\n }\n };\n let printACPolyfillWarning = PROCESS.env?.LRU_CACHE_IGNORE_AC_WARNING !== '1';\n const warnACPolyfill = () => {\n if (!printACPolyfillWarning)\n return;\n printACPolyfillWarning = false;\n emitWarning('AbortController is not defined. If using lru-cache in ' +\n 'node 14, load an AbortController polyfill from the ' +\n '`node-abort-controller` package. A minimal polyfill is ' +\n 'provided for use by LRUCache.fetch(), but it should not be ' +\n 'relied upon in other contexts (eg, passing it to other APIs that ' +\n 'use AbortController/AbortSignal might have undesirable effects). ' +\n 'You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.', 'NO_ABORT_CONTROLLER', 'ENOTSUP', warnACPolyfill);\n };\n}\n/* c8 ignore stop */\nconst shouldWarn = (code) => !warned.has(code);\nconst TYPE = Symbol('type');\nconst isPosInt = (n) => n && n === Math.floor(n) && n > 0 && isFinite(n);\n/* c8 ignore start */\n// This is a little bit ridiculous, tbh.\n// The maximum array length is 2^32-1 or thereabouts on most JS impls.\n// And well before that point, you're caching the entire world, I mean,\n// that's ~32GB of just integers for the next/prev links, plus whatever\n// else to hold that many keys and values. Just filling the memory with\n// zeroes at init time is brutal when you get that big.\n// But why not be complete?\n// Maybe in the future, these limits will have expanded.\nconst getUintArray = (max) => !isPosInt(max)\n ? null\n : max <= Math.pow(2, 8)\n ? Uint8Array\n : max <= Math.pow(2, 16)\n ? Uint16Array\n : max <= Math.pow(2, 32)\n ? Uint32Array\n : max <= Number.MAX_SAFE_INTEGER\n ? ZeroArray\n : null;\n/* c8 ignore stop */\nclass ZeroArray extends Array {\n constructor(size) {\n super(size);\n this.fill(0);\n }\n}\nclass Stack {\n heap;\n length;\n // private constructor\n static #constructing = false;\n static create(max) {\n const HeapCls = getUintArray(max);\n if (!HeapCls)\n return [];\n Stack.#constructing = true;\n const s = new Stack(max, HeapCls);\n Stack.#constructing = false;\n return s;\n }\n constructor(max, HeapCls) {\n /* c8 ignore start */\n if (!Stack.#constructing) {\n throw new TypeError('instantiate Stack using Stack.create(n)');\n }\n /* c8 ignore stop */\n this.heap = new HeapCls(max);\n this.length = 0;\n }\n push(n) {\n this.heap[this.length++] = n;\n }\n pop() {\n return this.heap[--this.length];\n }\n}\n/**\n * Default export, the thing you're using this module to get.\n *\n * The `K` and `V` types define the key and value types, respectively. The\n * optional `FC` type defines the type of the `context` object passed to\n * `cache.fetch()` and `cache.memo()`.\n *\n * Keys and values **must not** be `null` or `undefined`.\n *\n * All properties from the options object (with the exception of `max`,\n * `maxSize`, `fetchMethod`, `memoMethod`, `dispose` and `disposeAfter`) are\n * added as normal public members. (The listed options are read-only getters.)\n *\n * Changing any of these will alter the defaults for subsequent method calls.\n */\nexport class LRUCache {\n // options that cannot be changed without disaster\n #max;\n #maxSize;\n #dispose;\n #disposeAfter;\n #fetchMethod;\n #memoMethod;\n /**\n * {@link LRUCache.OptionsBase.ttl}\n */\n ttl;\n /**\n * {@link LRUCache.OptionsBase.ttlResolution}\n */\n ttlResolution;\n /**\n * {@link LRUCache.OptionsBase.ttlAutopurge}\n */\n ttlAutopurge;\n /**\n * {@link LRUCache.OptionsBase.updateAgeOnGet}\n */\n updateAgeOnGet;\n /**\n * {@link LRUCache.OptionsBase.updateAgeOnHas}\n */\n updateAgeOnHas;\n /**\n * {@link LRUCache.OptionsBase.allowStale}\n */\n allowStale;\n /**\n * {@link LRUCache.OptionsBase.noDisposeOnSet}\n */\n noDisposeOnSet;\n /**\n * {@link LRUCache.OptionsBase.noUpdateTTL}\n */\n noUpdateTTL;\n /**\n * {@link LRUCache.OptionsBase.maxEntrySize}\n */\n maxEntrySize;\n /**\n * {@link LRUCache.OptionsBase.sizeCalculation}\n */\n sizeCalculation;\n /**\n * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}\n */\n noDeleteOnFetchRejection;\n /**\n * {@link LRUCache.OptionsBase.noDeleteOnStaleGet}\n */\n noDeleteOnStaleGet;\n /**\n * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}\n */\n allowStaleOnFetchAbort;\n /**\n * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}\n */\n allowStaleOnFetchRejection;\n /**\n * {@link LRUCache.OptionsBase.ignoreFetchAbort}\n */\n ignoreFetchAbort;\n // computed properties\n #size;\n #calculatedSize;\n #keyMap;\n #keyList;\n #valList;\n #next;\n #prev;\n #head;\n #tail;\n #free;\n #disposed;\n #sizes;\n #starts;\n #ttls;\n #hasDispose;\n #hasFetchMethod;\n #hasDisposeAfter;\n /**\n * Do not call this method unless you need to inspect the\n * inner workings of the cache. If anything returned by this\n * object is modified in any way, strange breakage may occur.\n *\n * These fields are private for a reason!\n *\n * @internal\n */\n static unsafeExposeInternals(c) {\n return {\n // properties\n starts: c.#starts,\n ttls: c.#ttls,\n sizes: c.#sizes,\n keyMap: c.#keyMap,\n keyList: c.#keyList,\n valList: c.#valList,\n next: c.#next,\n prev: c.#prev,\n get head() {\n return c.#head;\n },\n get tail() {\n return c.#tail;\n },\n free: c.#free,\n // methods\n isBackgroundFetch: (p) => c.#isBackgroundFetch(p),\n backgroundFetch: (k, index, options, context) => c.#backgroundFetch(k, index, options, context),\n moveToTail: (index) => c.#moveToTail(index),\n indexes: (options) => c.#indexes(options),\n rindexes: (options) => c.#rindexes(options),\n isStale: (index) => c.#isStale(index),\n };\n }\n // Protected read-only members\n /**\n * {@link LRUCache.OptionsBase.max} (read-only)\n */\n get max() {\n return this.#max;\n }\n /**\n * {@link LRUCache.OptionsBase.maxSize} (read-only)\n */\n get maxSize() {\n return this.#maxSize;\n }\n /**\n * The total computed size of items in the cache (read-only)\n */\n get calculatedSize() {\n return this.#calculatedSize;\n }\n /**\n * The number of items stored in the cache (read-only)\n */\n get size() {\n return this.#size;\n }\n /**\n * {@link LRUCache.OptionsBase.fetchMethod} (read-only)\n */\n get fetchMethod() {\n return this.#fetchMethod;\n }\n get memoMethod() {\n return this.#memoMethod;\n }\n /**\n * {@link LRUCache.OptionsBase.dispose} (read-only)\n */\n get dispose() {\n return this.#dispose;\n }\n /**\n * {@link LRUCache.OptionsBase.disposeAfter} (read-only)\n */\n get disposeAfter() {\n return this.#disposeAfter;\n }\n constructor(options) {\n const { max = 0, ttl, ttlResolution = 1, ttlAutopurge, updateAgeOnGet, updateAgeOnHas, allowStale, dispose, disposeAfter, noDisposeOnSet, noUpdateTTL, maxSize = 0, maxEntrySize = 0, sizeCalculation, fetchMethod, memoMethod, noDeleteOnFetchRejection, noDeleteOnStaleGet, allowStaleOnFetchRejection, allowStaleOnFetchAbort, ignoreFetchAbort, } = options;\n if (max !== 0 && !isPosInt(max)) {\n throw new TypeError('max option must be a nonnegative integer');\n }\n const UintArray = max ? getUintArray(max) : Array;\n if (!UintArray) {\n throw new Error('invalid max value: ' + max);\n }\n this.#max = max;\n this.#maxSize = maxSize;\n this.maxEntrySize = maxEntrySize || this.#maxSize;\n this.sizeCalculation = sizeCalculation;\n if (this.sizeCalculation) {\n if (!this.#maxSize && !this.maxEntrySize) {\n throw new TypeError('cannot set sizeCalculation without setting maxSize or maxEntrySize');\n }\n if (typeof this.sizeCalculation !== 'function') {\n throw new TypeError('sizeCalculation set to non-function');\n }\n }\n if (memoMethod !== undefined &&\n typeof memoMethod !== 'function') {\n throw new TypeError('memoMethod must be a function if defined');\n }\n this.#memoMethod = memoMethod;\n if (fetchMethod !== undefined &&\n typeof fetchMethod !== 'function') {\n throw new TypeError('fetchMethod must be a function if specified');\n }\n this.#fetchMethod = fetchMethod;\n this.#hasFetchMethod = !!fetchMethod;\n this.#keyMap = new Map();\n this.#keyList = new Array(max).fill(undefined);\n this.#valList = new Array(max).fill(undefined);\n this.#next = new UintArray(max);\n this.#prev = new UintArray(max);\n this.#head = 0;\n this.#tail = 0;\n this.#free = Stack.create(max);\n this.#size = 0;\n this.#calculatedSize = 0;\n if (typeof dispose === 'function') {\n this.#dispose = dispose;\n }\n if (typeof disposeAfter === 'function') {\n this.#disposeAfter = disposeAfter;\n this.#disposed = [];\n }\n else {\n this.#disposeAfter = undefined;\n this.#disposed = undefined;\n }\n this.#hasDispose = !!this.#dispose;\n this.#hasDisposeAfter = !!this.#disposeAfter;\n this.noDisposeOnSet = !!noDisposeOnSet;\n this.noUpdateTTL = !!noUpdateTTL;\n this.noDeleteOnFetchRejection = !!noDeleteOnFetchRejection;\n this.allowStaleOnFetchRejection = !!allowStaleOnFetchRejection;\n this.allowStaleOnFetchAbort = !!allowStaleOnFetchAbort;\n this.ignoreFetchAbort = !!ignoreFetchAbort;\n // NB: maxEntrySize is set to maxSize if it's set\n if (this.maxEntrySize !== 0) {\n if (this.#maxSize !== 0) {\n if (!isPosInt(this.#maxSize)) {\n throw new TypeError('maxSize must be a positive integer if specified');\n }\n }\n if (!isPosInt(this.maxEntrySize)) {\n throw new TypeError('maxEntrySize must be a positive integer if specified');\n }\n this.#initializeSizeTracking();\n }\n this.allowStale = !!allowStale;\n this.noDeleteOnStaleGet = !!noDeleteOnStaleGet;\n this.updateAgeOnGet = !!updateAgeOnGet;\n this.updateAgeOnHas = !!updateAgeOnHas;\n this.ttlResolution =\n isPosInt(ttlResolution) || ttlResolution === 0\n ? ttlResolution\n : 1;\n this.ttlAutopurge = !!ttlAutopurge;\n this.ttl = ttl || 0;\n if (this.ttl) {\n if (!isPosInt(this.ttl)) {\n throw new TypeError('ttl must be a positive integer if specified');\n }\n this.#initializeTTLTracking();\n }\n // do not allow completely unbounded caches\n if (this.#max === 0 && this.ttl === 0 && this.#maxSize === 0) {\n throw new TypeError('At least one of max, maxSize, or ttl is required');\n }\n if (!this.ttlAutopurge && !this.#max && !this.#maxSize) {\n const code = 'LRU_CACHE_UNBOUNDED';\n if (shouldWarn(code)) {\n warned.add(code);\n const msg = 'TTL caching without ttlAutopurge, max, or maxSize can ' +\n 'result in unbounded memory consumption.';\n emitWarning(msg, 'UnboundedCacheWarning', code, LRUCache);\n }\n }\n }\n /**\n * Return the number of ms left in the item's TTL. If item is not in cache,\n * returns `0`. Returns `Infinity` if item is in cache without a defined TTL.\n */\n getRemainingTTL(key) {\n return this.#keyMap.has(key) ? Infinity : 0;\n }\n #initializeTTLTracking() {\n const ttls = new ZeroArray(this.#max);\n const starts = new ZeroArray(this.#max);\n this.#ttls = ttls;\n this.#starts = starts;\n this.#setItemTTL = (index, ttl, start = perf.now()) => {\n starts[index] = ttl !== 0 ? start : 0;\n ttls[index] = ttl;\n if (ttl !== 0 && this.ttlAutopurge) {\n const t = setTimeout(() => {\n if (this.#isStale(index)) {\n this.#delete(this.#keyList[index], 'expire');\n }\n }, ttl + 1);\n // unref() not supported on all platforms\n /* c8 ignore start */\n if (t.unref) {\n t.unref();\n }\n /* c8 ignore stop */\n }\n };\n this.#updateItemAge = index => {\n starts[index] = ttls[index] !== 0 ? perf.now() : 0;\n };\n this.#statusTTL = (status, index) => {\n if (ttls[index]) {\n const ttl = ttls[index];\n const start = starts[index];\n /* c8 ignore next */\n if (!ttl || !start)\n return;\n status.ttl = ttl;\n status.start = start;\n status.now = cachedNow || getNow();\n const age = status.now - start;\n status.remainingTTL = ttl - age;\n }\n };\n // debounce calls to perf.now() to 1s so we're not hitting\n // that costly call repeatedly.\n let cachedNow = 0;\n const getNow = () => {\n const n = perf.now();\n if (this.ttlResolution > 0) {\n cachedNow = n;\n const t = setTimeout(() => (cachedNow = 0), this.ttlResolution);\n // not available on all platforms\n /* c8 ignore start */\n if (t.unref) {\n t.unref();\n }\n /* c8 ignore stop */\n }\n return n;\n };\n this.getRemainingTTL = key => {\n const index = this.#keyMap.get(key);\n if (index === undefined) {\n return 0;\n }\n const ttl = ttls[index];\n const start = starts[index];\n if (!ttl || !start) {\n return Infinity;\n }\n const age = (cachedNow || getNow()) - start;\n return ttl - age;\n };\n this.#isStale = index => {\n const s = starts[index];\n const t = ttls[index];\n return !!t && !!s && (cachedNow || getNow()) - s > t;\n };\n }\n // conditionally set private methods related to TTL\n #updateItemAge = () => { };\n #statusTTL = () => { };\n #setItemTTL = () => { };\n /* c8 ignore stop */\n #isStale = () => false;\n #initializeSizeTracking() {\n const sizes = new ZeroArray(this.#max);\n this.#calculatedSize = 0;\n this.#sizes = sizes;\n this.#removeItemSize = index => {\n this.#calculatedSize -= sizes[index];\n sizes[index] = 0;\n };\n this.#requireSize = (k, v, size, sizeCalculation) => {\n // provisionally accept background fetches.\n // actual value size will be checked when they return.\n if (this.#isBackgroundFetch(v)) {\n return 0;\n }\n if (!isPosInt(size)) {\n if (sizeCalculation) {\n if (typeof sizeCalculation !== 'function') {\n throw new TypeError('sizeCalculation must be a function');\n }\n size = sizeCalculation(v, k);\n if (!isPosInt(size)) {\n throw new TypeError('sizeCalculation return invalid (expect positive integer)');\n }\n }\n else {\n throw new TypeError('invalid size value (must be positive integer). ' +\n 'When maxSize or maxEntrySize is used, sizeCalculation ' +\n 'or size must be set.');\n }\n }\n return size;\n };\n this.#addItemSize = (index, size, status) => {\n sizes[index] = size;\n if (this.#maxSize) {\n const maxSize = this.#maxSize - sizes[index];\n while (this.#calculatedSize > maxSize) {\n this.#evict(true);\n }\n }\n this.#calculatedSize += sizes[index];\n if (status) {\n status.entrySize = size;\n status.totalCalculatedSize = this.#calculatedSize;\n }\n };\n }\n #removeItemSize = _i => { };\n #addItemSize = (_i, _s, _st) => { };\n #requireSize = (_k, _v, size, sizeCalculation) => {\n if (size || sizeCalculation) {\n throw new TypeError('cannot set size without setting maxSize or maxEntrySize on cache');\n }\n return 0;\n };\n *#indexes({ allowStale = this.allowStale } = {}) {\n if (this.#size) {\n for (let i = this.#tail; true;) {\n if (!this.#isValidIndex(i)) {\n break;\n }\n if (allowStale || !this.#isStale(i)) {\n yield i;\n }\n if (i === this.#head) {\n break;\n }\n else {\n i = this.#prev[i];\n }\n }\n }\n }\n *#rindexes({ allowStale = this.allowStale } = {}) {\n if (this.#size) {\n for (let i = this.#head; true;) {\n if (!this.#isValidIndex(i)) {\n break;\n }\n if (allowStale || !this.#isStale(i)) {\n yield i;\n }\n if (i === this.#tail) {\n break;\n }\n else {\n i = this.#next[i];\n }\n }\n }\n }\n #isValidIndex(index) {\n return (index !== undefined &&\n this.#keyMap.get(this.#keyList[index]) === index);\n }\n /**\n * Return a generator yielding `[key, value]` pairs,\n * in order from most recently used to least recently used.\n */\n *entries() {\n for (const i of this.#indexes()) {\n if (this.#valList[i] !== undefined &&\n this.#keyList[i] !== undefined &&\n !this.#isBackgroundFetch(this.#valList[i])) {\n yield [this.#keyList[i], this.#valList[i]];\n }\n }\n }\n /**\n * Inverse order version of {@link LRUCache.entries}\n *\n * Return a generator yielding `[key, value]` pairs,\n * in order from least recently used to most recently used.\n */\n *rentries() {\n for (const i of this.#rindexes()) {\n if (this.#valList[i] !== undefined &&\n this.#keyList[i] !== undefined &&\n !this.#isBackgroundFetch(this.#valList[i])) {\n yield [this.#keyList[i], this.#valList[i]];\n }\n }\n }\n /**\n * Return a generator yielding the keys in the cache,\n * in order from most recently used to least recently used.\n */\n *keys() {\n for (const i of this.#indexes()) {\n const k = this.#keyList[i];\n if (k !== undefined &&\n !this.#isBackgroundFetch(this.#valList[i])) {\n yield k;\n }\n }\n }\n /**\n * Inverse order version of {@link LRUCache.keys}\n *\n * Return a generator yielding the keys in the cache,\n * in order from least recently used to most recently used.\n */\n *rkeys() {\n for (const i of this.#rindexes()) {\n const k = this.#keyList[i];\n if (k !== undefined &&\n !this.#isBackgroundFetch(this.#valList[i])) {\n yield k;\n }\n }\n }\n /**\n * Return a generator yielding the values in the cache,\n * in order from most recently used to least recently used.\n */\n *values() {\n for (const i of this.#indexes()) {\n const v = this.#valList[i];\n if (v !== undefined &&\n !this.#isBackgroundFetch(this.#valList[i])) {\n yield this.#valList[i];\n }\n }\n }\n /**\n * Inverse order version of {@link LRUCache.values}\n *\n * Return a generator yielding the values in the cache,\n * in order from least recently used to most recently used.\n */\n *rvalues() {\n for (const i of this.#rindexes()) {\n const v = this.#valList[i];\n if (v !== undefined &&\n !this.#isBackgroundFetch(this.#valList[i])) {\n yield this.#valList[i];\n }\n }\n }\n /**\n * Iterating over the cache itself yields the same results as\n * {@link LRUCache.entries}\n */\n [Symbol.iterator]() {\n return this.entries();\n }\n /**\n * A String value that is used in the creation of the default string\n * description of an object. Called by the built-in method\n * `Object.prototype.toString`.\n */\n [Symbol.toStringTag] = 'LRUCache';\n /**\n * Find a value for which the supplied fn method returns a truthy value,\n * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.\n */\n find(fn, getOptions = {}) {\n for (const i of this.#indexes()) {\n const v = this.#valList[i];\n const value = this.#isBackgroundFetch(v)\n ? v.__staleWhileFetching\n : v;\n if (value === undefined)\n continue;\n if (fn(value, this.#keyList[i], this)) {\n return this.get(this.#keyList[i], getOptions);\n }\n }\n }\n /**\n * Call the supplied function on each item in the cache, in order from most\n * recently used to least recently used.\n *\n * `fn` is called as `fn(value, key, cache)`.\n *\n * If `thisp` is provided, function will be called in the `this`-context of\n * the provided object, or the cache if no `thisp` object is provided.\n *\n * Does not update age or recenty of use, or iterate over stale values.\n */\n forEach(fn, thisp = this) {\n for (const i of this.#indexes()) {\n const v = this.#valList[i];\n const value = this.#isBackgroundFetch(v)\n ? v.__staleWhileFetching\n : v;\n if (value === undefined)\n continue;\n fn.call(thisp, value, this.#keyList[i], this);\n }\n }\n /**\n * The same as {@link LRUCache.forEach} but items are iterated over in\n * reverse order. (ie, less recently used items are iterated over first.)\n */\n rforEach(fn, thisp = this) {\n for (const i of this.#rindexes()) {\n const v = this.#valList[i];\n const value = this.#isBackgroundFetch(v)\n ? v.__staleWhileFetching\n : v;\n if (value === undefined)\n continue;\n fn.call(thisp, value, this.#keyList[i], this);\n }\n }\n /**\n * Delete any stale entries. Returns true if anything was removed,\n * false otherwise.\n */\n purgeStale() {\n let deleted = false;\n for (const i of this.#rindexes({ allowStale: true })) {\n if (this.#isStale(i)) {\n this.#delete(this.#keyList[i], 'expire');\n deleted = true;\n }\n }\n return deleted;\n }\n /**\n * Get the extended info about a given entry, to get its value, size, and\n * TTL info simultaneously. Returns `undefined` if the key is not present.\n *\n * Unlike {@link LRUCache#dump}, which is designed to be portable and survive\n * serialization, the `start` value is always the current timestamp, and the\n * `ttl` is a calculated remaining time to live (negative if expired).\n *\n * Always returns stale values, if their info is found in the cache, so be\n * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})\n * if relevant.\n */\n info(key) {\n const i = this.#keyMap.get(key);\n if (i === undefined)\n return undefined;\n const v = this.#valList[i];\n const value = this.#isBackgroundFetch(v)\n ? v.__staleWhileFetching\n : v;\n if (value === undefined)\n return undefined;\n const entry = { value };\n if (this.#ttls && this.#starts) {\n const ttl = this.#ttls[i];\n const start = this.#starts[i];\n if (ttl && start) {\n const remain = ttl - (perf.now() - start);\n entry.ttl = remain;\n entry.start = Date.now();\n }\n }\n if (this.#sizes) {\n entry.size = this.#sizes[i];\n }\n return entry;\n }\n /**\n * Return an array of [key, {@link LRUCache.Entry}] tuples which can be\n * passed to {@link LRLUCache#load}.\n *\n * The `start` fields are calculated relative to a portable `Date.now()`\n * timestamp, even if `performance.now()` is available.\n *\n * Stale entries are always included in the `dump`, even if\n * {@link LRUCache.OptionsBase.allowStale} is false.\n *\n * Note: this returns an actual array, not a generator, so it can be more\n * easily passed around.\n */\n dump() {\n const arr = [];\n for (const i of this.#indexes({ allowStale: true })) {\n const key = this.#keyList[i];\n const v = this.#valList[i];\n const value = this.#isBackgroundFetch(v)\n ? v.__staleWhileFetching\n : v;\n if (value === undefined || key === undefined)\n continue;\n const entry = { value };\n if (this.#ttls && this.#starts) {\n entry.ttl = this.#ttls[i];\n // always dump the start relative to a portable timestamp\n // it's ok for this to be a bit slow, it's a rare operation.\n const age = perf.now() - this.#starts[i];\n entry.start = Math.floor(Date.now() - age);\n }\n if (this.#sizes) {\n entry.size = this.#sizes[i];\n }\n arr.unshift([key, entry]);\n }\n return arr;\n }\n /**\n * Reset the cache and load in the items in entries in the order listed.\n *\n * The shape of the resulting cache may be different if the same options are\n * not used in both caches.\n *\n * The `start` fields are assumed to be calculated relative to a portable\n * `Date.now()` timestamp, even if `performance.now()` is available.\n */\n load(arr) {\n this.clear();\n for (const [key, entry] of arr) {\n if (entry.start) {\n // entry.start is a portable timestamp, but we may be using\n // node's performance.now(), so calculate the offset, so that\n // we get the intended remaining TTL, no matter how long it's\n // been on ice.\n //\n // it's ok for this to be a bit slow, it's a rare operation.\n const age = Date.now() - entry.start;\n entry.start = perf.now() - age;\n }\n this.set(key, entry.value, entry);\n }\n }\n /**\n * Add a value to the cache.\n *\n * Note: if `undefined` is specified as a value, this is an alias for\n * {@link LRUCache#delete}\n *\n * Fields on the {@link LRUCache.SetOptions} options param will override\n * their corresponding values in the constructor options for the scope\n * of this single `set()` operation.\n *\n * If `start` is provided, then that will set the effective start\n * time for the TTL calculation. Note that this must be a previous\n * value of `performance.now()` if supported, or a previous value of\n * `Date.now()` if not.\n *\n * Options object may also include `size`, which will prevent\n * calling the `sizeCalculation` function and just use the specified\n * number if it is a positive integer, and `noDisposeOnSet` which\n * will prevent calling a `dispose` function in the case of\n * overwrites.\n *\n * If the `size` (or return value of `sizeCalculation`) for a given\n * entry is greater than `maxEntrySize`, then the item will not be\n * added to the cache.\n *\n * Will update the recency of the entry.\n *\n * If the value is `undefined`, then this is an alias for\n * `cache.delete(key)`. `undefined` is never stored in the cache.\n */\n set(k, v, setOptions = {}) {\n if (v === undefined) {\n this.delete(k);\n return this;\n }\n const { ttl = this.ttl, start, noDisposeOnSet = this.noDisposeOnSet, sizeCalculation = this.sizeCalculation, status, } = setOptions;\n let { noUpdateTTL = this.noUpdateTTL } = setOptions;\n const size = this.#requireSize(k, v, setOptions.size || 0, sizeCalculation);\n // if the item doesn't fit, don't do anything\n // NB: maxEntrySize set to maxSize by default\n if (this.maxEntrySize && size > this.maxEntrySize) {\n if (status) {\n status.set = 'miss';\n status.maxEntrySizeExceeded = true;\n }\n // have to delete, in case something is there already.\n this.#delete(k, 'set');\n return this;\n }\n let index = this.#size === 0 ? undefined : this.#keyMap.get(k);\n if (index === undefined) {\n // addition\n index = (this.#size === 0\n ? this.#tail\n : this.#free.length !== 0\n ? this.#free.pop()\n : this.#size === this.#max\n ? this.#evict(false)\n : this.#size);\n this.#keyList[index] = k;\n this.#valList[index] = v;\n this.#keyMap.set(k, index);\n this.#next[this.#tail] = index;\n this.#prev[index] = this.#tail;\n this.#tail = index;\n this.#size++;\n this.#addItemSize(index, size, status);\n if (status)\n status.set = 'add';\n noUpdateTTL = false;\n }\n else {\n // update\n this.#moveToTail(index);\n const oldVal = this.#valList[index];\n if (v !== oldVal) {\n if (this.#hasFetchMethod && this.#isBackgroundFetch(oldVal)) {\n oldVal.__abortController.abort(new Error('replaced'));\n const { __staleWhileFetching: s } = oldVal;\n if (s !== undefined && !noDisposeOnSet) {\n if (this.#hasDispose) {\n this.#dispose?.(s, k, 'set');\n }\n if (this.#hasDisposeAfter) {\n this.#disposed?.push([s, k, 'set']);\n }\n }\n }\n else if (!noDisposeOnSet) {\n if (this.#hasDispose) {\n this.#dispose?.(oldVal, k, 'set');\n }\n if (this.#hasDisposeAfter) {\n this.#disposed?.push([oldVal, k, 'set']);\n }\n }\n this.#removeItemSize(index);\n this.#addItemSize(index, size, status);\n this.#valList[index] = v;\n if (status) {\n status.set = 'replace';\n const oldValue = oldVal && this.#isBackgroundFetch(oldVal)\n ? oldVal.__staleWhileFetching\n : oldVal;\n if (oldValue !== undefined)\n status.oldValue = oldValue;\n }\n }\n else if (status) {\n status.set = 'update';\n }\n }\n if (ttl !== 0 && !this.#ttls) {\n this.#initializeTTLTracking();\n }\n if (this.#ttls) {\n if (!noUpdateTTL) {\n this.#setItemTTL(index, ttl, start);\n }\n if (status)\n this.#statusTTL(status, index);\n }\n if (!noDisposeOnSet && this.#hasDisposeAfter && this.#disposed) {\n const dt = this.#disposed;\n let task;\n while ((task = dt?.shift())) {\n this.#disposeAfter?.(...task);\n }\n }\n return this;\n }\n /**\n * Evict the least recently used item, returning its value or\n * `undefined` if cache is empty.\n */\n pop() {\n try {\n while (this.#size) {\n const val = this.#valList[this.#head];\n this.#evict(true);\n if (this.#isBackgroundFetch(val)) {\n if (val.__staleWhileFetching) {\n return val.__staleWhileFetching;\n }\n }\n else if (val !== undefined) {\n return val;\n }\n }\n }\n finally {\n if (this.#hasDisposeAfter && this.#disposed) {\n const dt = this.#disposed;\n let task;\n while ((task = dt?.shift())) {\n this.#disposeAfter?.(...task);\n }\n }\n }\n }\n #evict(free) {\n const head = this.#head;\n const k = this.#keyList[head];\n const v = this.#valList[head];\n if (this.#hasFetchMethod && this.#isBackgroundFetch(v)) {\n v.__abortController.abort(new Error('evicted'));\n }\n else if (this.#hasDispose || this.#hasDisposeAfter) {\n if (this.#hasDispose) {\n this.#dispose?.(v, k, 'evict');\n }\n if (this.#hasDisposeAfter) {\n this.#disposed?.push([v, k, 'evict']);\n }\n }\n this.#removeItemSize(head);\n // if we aren't about to use the index, then null these out\n if (free) {\n this.#keyList[head] = undefined;\n this.#valList[head] = undefined;\n this.#free.push(head);\n }\n if (this.#size === 1) {\n this.#head = this.#tail = 0;\n this.#free.length = 0;\n }\n else {\n this.#head = this.#next[head];\n }\n this.#keyMap.delete(k);\n this.#size--;\n return head;\n }\n /**\n * Check if a key is in the cache, without updating the recency of use.\n * Will return false if the item is stale, even though it is technically\n * in the cache.\n *\n * Check if a key is in the cache, without updating the recency of\n * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set\n * to `true` in either the options or the constructor.\n *\n * Will return `false` if the item is stale, even though it is technically in\n * the cache. The difference can be determined (if it matters) by using a\n * `status` argument, and inspecting the `has` field.\n *\n * Will not update item age unless\n * {@link LRUCache.OptionsBase.updateAgeOnHas} is set.\n */\n has(k, hasOptions = {}) {\n const { updateAgeOnHas = this.updateAgeOnHas, status } = hasOptions;\n const index = this.#keyMap.get(k);\n if (index !== undefined) {\n const v = this.#valList[index];\n if (this.#isBackgroundFetch(v) &&\n v.__staleWhileFetching === undefined) {\n return false;\n }\n if (!this.#isStale(index)) {\n if (updateAgeOnHas) {\n this.#updateItemAge(index);\n }\n if (status) {\n status.has = 'hit';\n this.#statusTTL(status, index);\n }\n return true;\n }\n else if (status) {\n status.has = 'stale';\n this.#statusTTL(status, index);\n }\n }\n else if (status) {\n status.has = 'miss';\n }\n return false;\n }\n /**\n * Like {@link LRUCache#get} but doesn't update recency or delete stale\n * items.\n *\n * Returns `undefined` if the item is stale, unless\n * {@link LRUCache.OptionsBase.allowStale} is set.\n */\n peek(k, peekOptions = {}) {\n const { allowStale = this.allowStale } = peekOptions;\n const index = this.#keyMap.get(k);\n if (index === undefined ||\n (!allowStale && this.#isStale(index))) {\n return;\n }\n const v = this.#valList[index];\n // either stale and allowed, or forcing a refresh of non-stale value\n return this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;\n }\n #backgroundFetch(k, index, options, context) {\n const v = index === undefined ? undefined : this.#valList[index];\n if (this.#isBackgroundFetch(v)) {\n return v;\n }\n const ac = new AC();\n const { signal } = options;\n // when/if our AC signals, then stop listening to theirs.\n signal?.addEventListener('abort', () => ac.abort(signal.reason), {\n signal: ac.signal,\n });\n const fetchOpts = {\n signal: ac.signal,\n options,\n context,\n };\n const cb = (v, updateCache = false) => {\n const { aborted } = ac.signal;\n const ignoreAbort = options.ignoreFetchAbort && v !== undefined;\n if (options.status) {\n if (aborted && !updateCache) {\n options.status.fetchAborted = true;\n options.status.fetchError = ac.signal.reason;\n if (ignoreAbort)\n options.status.fetchAbortIgnored = true;\n }\n else {\n options.status.fetchResolved = true;\n }\n }\n if (aborted && !ignoreAbort && !updateCache) {\n return fetchFail(ac.signal.reason);\n }\n // either we didn't abort, and are still here, or we did, and ignored\n const bf = p;\n if (this.#valList[index] === p) {\n if (v === undefined) {\n if (bf.__staleWhileFetching) {\n this.#valList[index] = bf.__staleWhileFetching;\n }\n else {\n this.#delete(k, 'fetch');\n }\n }\n else {\n if (options.status)\n options.status.fetchUpdated = true;\n this.set(k, v, fetchOpts.options);\n }\n }\n return v;\n };\n const eb = (er) => {\n if (options.status) {\n options.status.fetchRejected = true;\n options.status.fetchError = er;\n }\n return fetchFail(er);\n };\n const fetchFail = (er) => {\n const { aborted } = ac.signal;\n const allowStaleAborted = aborted && options.allowStaleOnFetchAbort;\n const allowStale = allowStaleAborted || options.allowStaleOnFetchRejection;\n const noDelete = allowStale || options.noDeleteOnFetchRejection;\n const bf = p;\n if (this.#valList[index] === p) {\n // if we allow stale on fetch rejections, then we need to ensure that\n // the stale value is not removed from the cache when the fetch fails.\n const del = !noDelete || bf.__staleWhileFetching === undefined;\n if (del) {\n this.#delete(k, 'fetch');\n }\n else if (!allowStaleAborted) {\n // still replace the *promise* with the stale value,\n // since we are done with the promise at this point.\n // leave it untouched if we're still waiting for an\n // aborted background fetch that hasn't yet returned.\n this.#valList[index] = bf.__staleWhileFetching;\n }\n }\n if (allowStale) {\n if (options.status && bf.__staleWhileFetching !== undefined) {\n options.status.returnedStale = true;\n }\n return bf.__staleWhileFetching;\n }\n else if (bf.__returned === bf) {\n throw er;\n }\n };\n const pcall = (res, rej) => {\n const fmp = this.#fetchMethod?.(k, v, fetchOpts);\n if (fmp && fmp instanceof Promise) {\n fmp.then(v => res(v === undefined ? undefined : v), rej);\n }\n // ignored, we go until we finish, regardless.\n // defer check until we are actually aborting,\n // so fetchMethod can override.\n ac.signal.addEventListener('abort', () => {\n if (!options.ignoreFetchAbort ||\n options.allowStaleOnFetchAbort) {\n res(undefined);\n // when it eventually resolves, update the cache.\n if (options.allowStaleOnFetchAbort) {\n res = v => cb(v, true);\n }\n }\n });\n };\n if (options.status)\n options.status.fetchDispatched = true;\n const p = new Promise(pcall).then(cb, eb);\n const bf = Object.assign(p, {\n __abortController: ac,\n __staleWhileFetching: v,\n __returned: undefined,\n });\n if (index === undefined) {\n // internal, don't expose status.\n this.set(k, bf, { ...fetchOpts.options, status: undefined });\n index = this.#keyMap.get(k);\n }\n else {\n this.#valList[index] = bf;\n }\n return bf;\n }\n #isBackgroundFetch(p) {\n if (!this.#hasFetchMethod)\n return false;\n const b = p;\n return (!!b &&\n b instanceof Promise &&\n b.hasOwnProperty('__staleWhileFetching') &&\n b.__abortController instanceof AC);\n }\n async fetch(k, fetchOptions = {}) {\n const { \n // get options\n allowStale = this.allowStale, updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet = this.noDeleteOnStaleGet, \n // set options\n ttl = this.ttl, noDisposeOnSet = this.noDisposeOnSet, size = 0, sizeCalculation = this.sizeCalculation, noUpdateTTL = this.noUpdateTTL, \n // fetch exclusive options\n noDeleteOnFetchRejection = this.noDeleteOnFetchRejection, allowStaleOnFetchRejection = this.allowStaleOnFetchRejection, ignoreFetchAbort = this.ignoreFetchAbort, allowStaleOnFetchAbort = this.allowStaleOnFetchAbort, context, forceRefresh = false, status, signal, } = fetchOptions;\n if (!this.#hasFetchMethod) {\n if (status)\n status.fetch = 'get';\n return this.get(k, {\n allowStale,\n updateAgeOnGet,\n noDeleteOnStaleGet,\n status,\n });\n }\n const options = {\n allowStale,\n updateAgeOnGet,\n noDeleteOnStaleGet,\n ttl,\n noDisposeOnSet,\n size,\n sizeCalculation,\n noUpdateTTL,\n noDeleteOnFetchRejection,\n allowStaleOnFetchRejection,\n allowStaleOnFetchAbort,\n ignoreFetchAbort,\n status,\n signal,\n };\n let index = this.#keyMap.get(k);\n if (index === undefined) {\n if (status)\n status.fetch = 'miss';\n const p = this.#backgroundFetch(k, index, options, context);\n return (p.__returned = p);\n }\n else {\n // in cache, maybe already fetching\n const v = this.#valList[index];\n if (this.#isBackgroundFetch(v)) {\n const stale = allowStale && v.__staleWhileFetching !== undefined;\n if (status) {\n status.fetch = 'inflight';\n if (stale)\n status.returnedStale = true;\n }\n return stale ? v.__staleWhileFetching : (v.__returned = v);\n }\n // if we force a refresh, that means do NOT serve the cached value,\n // unless we are already in the process of refreshing the cache.\n const isStale = this.#isStale(index);\n if (!forceRefresh && !isStale) {\n if (status)\n status.fetch = 'hit';\n this.#moveToTail(index);\n if (updateAgeOnGet) {\n this.#updateItemAge(index);\n }\n if (status)\n this.#statusTTL(status, index);\n return v;\n }\n // ok, it is stale or a forced refresh, and not already fetching.\n // refresh the cache.\n const p = this.#backgroundFetch(k, index, options, context);\n const hasStale = p.__staleWhileFetching !== undefined;\n const staleVal = hasStale && allowStale;\n if (status) {\n status.fetch = isStale ? 'stale' : 'refresh';\n if (staleVal && isStale)\n status.returnedStale = true;\n }\n return staleVal ? p.__staleWhileFetching : (p.__returned = p);\n }\n }\n async forceFetch(k, fetchOptions = {}) {\n const v = await this.fetch(k, fetchOptions);\n if (v === undefined)\n throw new Error('fetch() returned undefined');\n return v;\n }\n memo(k, memoOptions = {}) {\n const memoMethod = this.#memoMethod;\n if (!memoMethod) {\n throw new Error('no memoMethod provided to constructor');\n }\n const { context, forceRefresh, ...options } = memoOptions;\n const v = this.get(k, options);\n if (!forceRefresh && v !== undefined)\n return v;\n const vv = memoMethod(k, v, {\n options,\n context,\n });\n this.set(k, vv, options);\n return vv;\n }\n /**\n * Return a value from the cache. Will update the recency of the cache\n * entry found.\n *\n * If the key is not found, get() will return `undefined`.\n */\n get(k, getOptions = {}) {\n const { allowStale = this.allowStale, updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet = this.noDeleteOnStaleGet, status, } = getOptions;\n const index = this.#keyMap.get(k);\n if (index !== undefined) {\n const value = this.#valList[index];\n const fetching = this.#isBackgroundFetch(value);\n if (status)\n this.#statusTTL(status, index);\n if (this.#isStale(index)) {\n if (status)\n status.get = 'stale';\n // delete only if not an in-flight background fetch\n if (!fetching) {\n if (!noDeleteOnStaleGet) {\n this.#delete(k, 'expire');\n }\n if (status && allowStale)\n status.returnedStale = true;\n return allowStale ? value : undefined;\n }\n else {\n if (status &&\n allowStale &&\n value.__staleWhileFetching !== undefined) {\n status.returnedStale = true;\n }\n return allowStale ? value.__staleWhileFetching : undefined;\n }\n }\n else {\n if (status)\n status.get = 'hit';\n // if we're currently fetching it, we don't actually have it yet\n // it's not stale, which means this isn't a staleWhileRefetching.\n // If it's not stale, and fetching, AND has a __staleWhileFetching\n // value, then that means the user fetched with {forceRefresh:true},\n // so it's safe to return that value.\n if (fetching) {\n return value.__staleWhileFetching;\n }\n this.#moveToTail(index);\n if (updateAgeOnGet) {\n this.#updateItemAge(index);\n }\n return value;\n }\n }\n else if (status) {\n status.get = 'miss';\n }\n }\n #connect(p, n) {\n this.#prev[n] = p;\n this.#next[p] = n;\n }\n #moveToTail(index) {\n // if tail already, nothing to do\n // if head, move head to next[index]\n // else\n // move next[prev[index]] to next[index] (head has no prev)\n // move prev[next[index]] to prev[index]\n // prev[index] = tail\n // next[tail] = index\n // tail = index\n if (index !== this.#tail) {\n if (index === this.#head) {\n this.#head = this.#next[index];\n }\n else {\n this.#connect(this.#prev[index], this.#next[index]);\n }\n this.#connect(this.#tail, index);\n this.#tail = index;\n }\n }\n /**\n * Deletes a key out of the cache.\n *\n * Returns true if the key was deleted, false otherwise.\n */\n delete(k) {\n return this.#delete(k, 'delete');\n }\n #delete(k, reason) {\n let deleted = false;\n if (this.#size !== 0) {\n const index = this.#keyMap.get(k);\n if (index !== undefined) {\n deleted = true;\n if (this.#size === 1) {\n this.#clear(reason);\n }\n else {\n this.#removeItemSize(index);\n const v = this.#valList[index];\n if (this.#isBackgroundFetch(v)) {\n v.__abortController.abort(new Error('deleted'));\n }\n else if (this.#hasDispose || this.#hasDisposeAfter) {\n if (this.#hasDispose) {\n this.#dispose?.(v, k, reason);\n }\n if (this.#hasDisposeAfter) {\n this.#disposed?.push([v, k, reason]);\n }\n }\n this.#keyMap.delete(k);\n this.#keyList[index] = undefined;\n this.#valList[index] = undefined;\n if (index === this.#tail) {\n this.#tail = this.#prev[index];\n }\n else if (index === this.#head) {\n this.#head = this.#next[index];\n }\n else {\n const pi = this.#prev[index];\n this.#next[pi] = this.#next[index];\n const ni = this.#next[index];\n this.#prev[ni] = this.#prev[index];\n }\n this.#size--;\n this.#free.push(index);\n }\n }\n }\n if (this.#hasDisposeAfter && this.#disposed?.length) {\n const dt = this.#disposed;\n let task;\n while ((task = dt?.shift())) {\n this.#disposeAfter?.(...task);\n }\n }\n return deleted;\n }\n /**\n * Clear the cache entirely, throwing away all values.\n */\n clear() {\n return this.#clear('delete');\n }\n #clear(reason) {\n for (const index of this.#rindexes({ allowStale: true })) {\n const v = this.#valList[index];\n if (this.#isBackgroundFetch(v)) {\n v.__abortController.abort(new Error('deleted'));\n }\n else {\n const k = this.#keyList[index];\n if (this.#hasDispose) {\n this.#dispose?.(v, k, reason);\n }\n if (this.#hasDisposeAfter) {\n this.#disposed?.push([v, k, reason]);\n }\n }\n }\n this.#keyMap.clear();\n this.#valList.fill(undefined);\n this.#keyList.fill(undefined);\n if (this.#ttls && this.#starts) {\n this.#ttls.fill(0);\n this.#starts.fill(0);\n }\n if (this.#sizes) {\n this.#sizes.fill(0);\n }\n this.#head = 0;\n this.#tail = 0;\n this.#free.length = 0;\n this.#calculatedSize = 0;\n this.#size = 0;\n if (this.#hasDisposeAfter && this.#disposed) {\n const dt = this.#disposed;\n let task;\n while ((task = dt?.shift())) {\n this.#disposeAfter?.(...task);\n }\n }\n }\n}\n//# sourceMappingURL=index.js.map","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(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 = { [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 DraftClassifiedListing: () => DraftClassifiedListing,\n DraftLong: () => DraftLong,\n Emojisets: () => Emojisets,\n EncryptedDirectMessage: () => EncryptedDirectMessage,\n EncryptedDirectMessages: () => EncryptedDirectMessages,\n EventDeletion: () => EventDeletion,\n FileMetadata: () => FileMetadata,\n FileServerPreference: () => FileServerPreference,\n Followsets: () => Followsets,\n GenericRepost: () => GenericRepost,\n Genericlists: () => Genericlists,\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 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 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 isEphemeralKind: () => isEphemeralKind,\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 isParameterizedReplaceableKind(kind) {\n return 3e4 <= kind && kind < 4e4;\n}\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 (isParameterizedReplaceableKind(kind))\n return \"parameterized\";\n return \"unknown\";\n}\nvar Metadata = 0;\nvar ShortTextNote = 1;\nvar RecommendRelay = 2;\nvar Contacts = 3;\nvar EncryptedDirectMessage = 4;\nvar EncryptedDirectMessages = 4;\nvar EventDeletion = 5;\nvar Repost = 6;\nvar Reaction = 7;\nvar BadgeAward = 8;\nvar GenericRepost = 16;\nvar ChannelCreation = 40;\nvar ChannelMetadata = 41;\nvar ChannelMessage = 42;\nvar ChannelHideMessage = 43;\nvar ChannelMuteUser = 44;\nvar OpenTimestamps = 1040;\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 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) => isParameterizedReplaceableKind(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 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 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.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 (ok)\n ep.resolve(reason);\n else\n ep.reject(new Error(reason));\n this.openEventPublishes.delete(id);\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._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 const evt = await signAuthEvent(makeAuthEvent(this.url, this.challenge));\n const ret = new Promise((resolve, reject) => {\n this.openEventPublishes.set(evt.id, { resolve, reject });\n });\n this.send('[\"AUTH\",' + JSON.stringify(evt) + \"]\");\n return ret;\n }\n async publish(event) {\n const ret = new Promise((resolve, reject) => {\n this.openEventPublishes.set(event.id, { resolve, reject });\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 || \"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 subscribeMany(relays, filters, params) {\n return this.subscribeManyMap(Object.fromEntries(relays.map((url) => [url, filters])), params);\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 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 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) => handleClose(i2, reason),\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 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.subscribeManyEose(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);\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 decode: () => decode,\n encodeBytes: () => encodeBytes,\n naddrEncode: () => naddrEncode,\n neventEncode: () => neventEncode,\n noteEncode: () => noteEncode,\n nprofileEncode: () => nprofileEncode,\n npubEncode: () => npubEncode,\n nrelayEncode: () => nrelayEncode,\n nsecEncode: () => nsecEncode\n});\nimport { bytesToHex as bytesToHex2, concatBytes, hexToBytes } from \"@noble/hashes/utils\";\nimport { bech32 } from \"@scure/base\";\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 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 \"nrelay\": {\n let tlv = parseTLV(data);\n if (!tlv[0]?.[0])\n throw new Error(\"missing TLV 0 for nrelay\");\n return {\n type: \"nrelay\",\n data: utf8Decoder.decode(tlv[0][0])\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 nrelayEncode(url) {\n let data = encodeTLV({\n 0: [utf8Encoder.encode(url)]\n });\n return encodeBech32(\"nrelay\", 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\";\nasync function 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}\nasync function 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 isValid: () => isValid,\n queryProfile: () => queryProfile,\n searchDomain: () => searchDomain,\n useFetchImplementation: () => useFetchImplementation\n});\nvar NIP05_REGEX = /^(?:([\\w.+-]+)@)?([\\w_-]+(\\.[\\w_-]+)+)$/;\nvar _fetch;\ntry {\n _fetch = fetch;\n} catch {\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: \"error\" });\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 (await _fetch(url, { redirect: \"error\" })).json();\n let pubkey = res.names[name];\n return pubkey ? { pubkey, relays: res.relays?.[pubkey] } : null;\n } catch (_e) {\n return null;\n }\n}\nasync function isValid(pubkey, nip05) {\n let 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 };\n const eTags = [];\n for (const tag of event.tags) {\n if (tag[0] === \"e\" && tag[1]) {\n eTags.push(tag);\n }\n if (tag[0] === \"p\" && tag[1]) {\n result.profiles.push({\n pubkey: tag[1],\n relays: tag[2] ? [tag[2]] : []\n });\n }\n }\n for (let eTagIndex = 0; eTagIndex < eTags.length; eTagIndex++) {\n const eTag = eTags[eTagIndex];\n const [_, eTagEventId, eTagRelayUrl, eTagMarker] = eTag;\n const eventPointer = {\n id: eTagEventId,\n relays: eTagRelayUrl ? [eTagRelayUrl] : []\n };\n const isFirstETag = eTagIndex === 0;\n const isLastETag = eTagIndex === eTags.length - 1;\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 (isFirstETag) {\n result.root = eventPointer;\n continue;\n }\n if (isLastETag) {\n result.reply = eventPointer;\n continue;\n }\n result.mentions.push(eventPointer);\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 getPow: () => getPow,\n minePow: () => minePow\n});\nfunction getPow(hex) {\n let count = 0;\n for (let i2 = 0; i2 < hex.length; i2++) {\n const nibble = parseInt(hex[i2], 16);\n if (nibble === 0) {\n count += 4;\n } else {\n count += Math.clz32(nibble) - 28;\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 now = Math.floor(new Date().getTime() / 1e3);\n if (now !== event.created_at) {\n count = 0;\n event.created_at = now;\n }\n tag[1] = (++count).toString();\n event.id = getEventHash(event);\n if (getPow(event.id) >= difficulty) {\n break;\n }\n }\n return event;\n}\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 return finalizeEvent(\n {\n kind: Repost,\n tags: [...t.tags ?? [], [\"e\", reposted.id, relayUrl], [\"p\", reposted.pubkey]],\n content: t.content === \"\" ? \"\" : JSON.stringify(reposted),\n created_at: t.created_at\n },\n privateKey\n );\n}\nfunction getRepostedEventPointer(event) {\n if (event.kind !== Repost) {\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 matchAll: () => matchAll,\n regex: () => regex,\n replaceAll: () => replaceAll\n});\nvar regex = () => new RegExp(`\\\\b${NOSTR_URI_REGEX.source}\\\\b`, \"g\");\nfunction* matchAll(content) {\n const matches = content.matchAll(regex());\n for (const match of matches) {\n try {\n const [uri, value] = match;\n yield {\n uri,\n value,\n decoded: decode(value),\n start: match.index,\n end: match.index + uri.length\n };\n } catch (_e) {\n }\n }\n}\nfunction replaceAll(content, replacer) {\n return content.replaceAll(regex(), (uri, value) => {\n return replacer({\n uri,\n value,\n decoded: decode(value)\n });\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: () => matchAll2,\n regex: () => regex2,\n replaceAll: () => replaceAll2\n});\nvar EMOJI_SHORTCODE_REGEX = /:(\\w+):/;\nvar regex2 = () => new RegExp(`\\\\B${EMOJI_SHORTCODE_REGEX.source}\\\\B`, \"g\");\nfunction* matchAll2(content) {\n const matches = content.matchAll(regex2());\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 replaceAll2(content, replacer) {\n return content.replaceAll(regex2(), (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// 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 sha2562 } 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(sha2562, sharedX, \"nip44-v2\");\n}\nfunction getMessageKeys(conversationKey, nonce) {\n const keys = hkdf_expand(sha2562, 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(sha2562, 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// 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// 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) {\n zr.tags.push([\"e\", event]);\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 sha2563 } from \"@noble/hashes/sha256\";\nimport { bytesToHex as bytesToHex4 } 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 = sha2563(utf8Encoder.encode(JSON.stringify(payload)));\n return bytesToHex4(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 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 nip57_exports as nip57,\n nip98_exports as nip98,\n parseReferences,\n serializeEvent,\n sortEvents,\n utils_exports as utils,\n validateEvent,\n verifiedSymbol,\n verifyEvent\n};\n","var _computedKey, _computedKey1;\n_computedKey = Symbol.iterator, _computedKey1 = Symbol.toStringTag;\n/**\n * Nostr event implementation of the `Set` interface.\n *\n * NSet is an implementation of the theory that a Nostr Storage is actually just a Set.\n * Events are Nostr's only data type, and they are immutable, making the Set interface ideal.\n *\n * ```ts\n * const events = new NSet();\n *\n * // Events can be added like a regular `Set`:\n * events.add(event1);\n * events.add(event2);\n *\n * // Can be iterated:\n * for (const event of events) {\n * if (matchFilters(filters, event)) {\n * console.log(event);\n * }\n * }\n * ```\n *\n * `NSet` will handle kind `5` deletions, removing events from the set.\n * Replaceable (and parameterized) events will keep only the newest version.\n * However, verification of `id` and `sig` is NOT performed.\n *\n * Any `Map` instance can be passed into `new NSet()`, making it compatible with\n * [lru-cache](https://www.npmjs.com/package/lru-cache), among others.\n */ class NSet {\n cache;\n constructor(map){\n this.cache = map ?? new Map();\n }\n get size() {\n return this.cache.size;\n }\n add(event) {\n this.#processDeletions(event);\n for (const e of this){\n if (NSet.deletes(e, event) || NSet.replaces(e, event)) {\n return this;\n } else if (NSet.replaces(event, e)) {\n this.delete(e);\n }\n }\n this.cache.set(event.id, event);\n return this;\n }\n #processDeletions(event) {\n if (event.kind === 5) {\n for (const tag of event.tags){\n if (tag[0] === 'e') {\n const e = this.cache.get(tag[1]);\n if (e && e.pubkey === event.pubkey) {\n this.delete(e);\n }\n }\n }\n }\n }\n clear() {\n this.cache.clear();\n }\n delete(event) {\n return this.cache.delete(event.id);\n }\n forEach(callbackfn, thisArg) {\n return this.cache.forEach((event, _id)=>callbackfn(event, event, this), thisArg);\n }\n has(event) {\n return this.cache.has(event.id);\n }\n *entries() {\n for (const event of this.values()){\n yield [\n event,\n event\n ];\n }\n }\n keys() {\n return this.values();\n }\n *values() {\n for (const event of NSet.sortEvents([\n ...this.cache.values()\n ])){\n yield event;\n }\n }\n [_computedKey]() {\n return this.values();\n }\n [_computedKey1] = 'NSet';\n /** Event kind is **replaceable**, which means that, for each combination of `pubkey` and `kind`, only the latest event is expected to (SHOULD) be stored by relays, older versions are expected to be discarded. */ static isReplaceable(kind) {\n return [\n 0,\n 3\n ].includes(kind) || 10000 <= kind && kind < 20000;\n }\n /** Event kind is **parameterized replaceable**, which means that, for each combination of `pubkey`, `kind` and the `d` tag, only the latest event is expected to be stored by relays, older versions are expected to be discarded. */ static isParameterizedReplaceable(kind) {\n return 30000 <= kind && kind < 40000;\n }\n /**\n * Returns true if `event` replaces `target`.\n *\n * Both events must be replaceable, belong to the same kind and pubkey (and `d` tag, for parameterized events), and the `event` must be newer than the `target`.\n */ static replaces(event, target) {\n const { kind, pubkey } = event;\n if (NSet.isReplaceable(kind)) {\n return kind === target.kind && pubkey === target.pubkey && NSet.sortEvents([\n event,\n target\n ])[0] === event;\n }\n if (NSet.isParameterizedReplaceable(kind)) {\n const d1 = event.tags.find(([name])=>name === 'd')?.[1] || '';\n const d2 = target.tags.find(([name])=>name === 'd')?.[1] || '';\n return kind === target.kind && pubkey === target.pubkey && NSet.sortEvents([\n event,\n target\n ])[0] === event && d1 === d2;\n }\n return false;\n }\n /**\n * Returns true if the `event` deletes`target`.\n *\n * `event` must be a kind `5` event, and both events must share the same `pubkey`.\n */ static deletes(event, target) {\n const { kind, pubkey, tags } = event;\n if (kind === 5 && pubkey === target.pubkey) {\n for (const [name, value] of tags){\n if (name === 'e' && value === target.id) {\n return true;\n }\n }\n }\n return false;\n }\n /**\n * Sort events in reverse-chronological order by the `created_at` timestamp,\n * and then by the event `id` (lexicographically) in case of ties.\n * This mutates the array.\n */ static 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 union(_other) {\n throw new Error('Method not implemented.');\n }\n intersection(_other) {\n throw new Error('Method not implemented.');\n }\n difference(_other) {\n throw new Error('Method not implemented.');\n }\n symmetricDifference(_other) {\n throw new Error('Method not implemented.');\n }\n isSubsetOf(_other) {\n throw new Error('Method not implemented.');\n }\n isSupersetOf(_other) {\n throw new Error('Method not implemented.');\n }\n isDisjointFrom(_other) {\n throw new Error('Method not implemented.');\n }\n}\nexport { NSet };\n//# sourceMappingURL=NSet.js.map","// deno-lint-ignore-file require-await\nvar _computedKey;\nimport { LRUCache } from \"lru-cache\";\nimport { matchFilters } from \"nostr-tools\";\nimport { NSet } from \"./NSet.js\";\n_computedKey = Symbol.toStringTag;\n/**\n * Nostr LRU cache based on [`npm:lru-cache`](https://www.npmjs.com/package/lru-cache).\n * It implements both `NStore` and `NSet` interfaces.\n *\n * ```ts\n * // Accepts the options of `npm:lru-cache`:\n * const cache = new NCache({ max: 1000 });\n *\n * // Events can be added like a regular `Set`:\n * cache.add(event1);\n * cache.add(event2);\n *\n * // Can be queried like `NStore`:\n * const events = await cache.query([{ kinds: [1] }]);\n *\n * // Can be iterated like `NSet`:\n * for (const event of cache) {\n * console.log(event);\n * }\n * ```\n */ class NCache extends NSet {\n constructor(...args){\n super(new LRUCache(...args));\n }\n async event(event) {\n this.add(event);\n }\n async query(filters) {\n const events = [];\n for (const event of this){\n if (matchFilters(filters, event)) {\n this.cache.get(event.id);\n events.push(event);\n }\n }\n return events;\n }\n async remove(filters) {\n for (const event of this){\n if (matchFilters(filters, event)) {\n this.delete(event);\n }\n }\n }\n async count(filters) {\n const events = await this.query(filters);\n return {\n count: events.length,\n approximate: false\n };\n }\n [_computedKey] = 'NCache';\n}\nexport { NCache };\n//# sourceMappingURL=NCache.js.map","var util;\n(function (util) {\n util.assertEqual = (val) => val;\n function assertIs(_arg) { }\n util.assertIs = assertIs;\n function assertNever(_x) {\n throw new Error();\n }\n util.assertNever = assertNever;\n util.arrayToEnum = (items) => {\n const obj = {};\n for (const item of items) {\n obj[item] = item;\n }\n return obj;\n };\n util.getValidEnumValues = (obj) => {\n const validKeys = util.objectKeys(obj).filter((k) => typeof obj[obj[k]] !== \"number\");\n const filtered = {};\n for (const k of validKeys) {\n filtered[k] = obj[k];\n }\n return util.objectValues(filtered);\n };\n util.objectValues = (obj) => {\n return util.objectKeys(obj).map(function (e) {\n return obj[e];\n });\n };\n util.objectKeys = typeof Object.keys === \"function\" // eslint-disable-line ban/ban\n ? (obj) => Object.keys(obj) // eslint-disable-line ban/ban\n : (object) => {\n const keys = [];\n for (const key in object) {\n if (Object.prototype.hasOwnProperty.call(object, key)) {\n keys.push(key);\n }\n }\n return keys;\n };\n util.find = (arr, checker) => {\n for (const item of arr) {\n if (checker(item))\n return item;\n }\n return undefined;\n };\n util.isInteger = typeof Number.isInteger === \"function\"\n ? (val) => Number.isInteger(val) // eslint-disable-line ban/ban\n : (val) => typeof val === \"number\" && isFinite(val) && Math.floor(val) === val;\n function joinValues(array, separator = \" | \") {\n return array\n .map((val) => (typeof val === \"string\" ? `'${val}'` : val))\n .join(separator);\n }\n util.joinValues = joinValues;\n util.jsonStringifyReplacer = (_, value) => {\n if (typeof value === \"bigint\") {\n return value.toString();\n }\n return value;\n };\n})(util || (util = {}));\nvar objectUtil;\n(function (objectUtil) {\n objectUtil.mergeShapes = (first, second) => {\n return {\n ...first,\n ...second, // second overwrites first\n };\n };\n})(objectUtil || (objectUtil = {}));\nconst ZodParsedType = util.arrayToEnum([\n \"string\",\n \"nan\",\n \"number\",\n \"integer\",\n \"float\",\n \"boolean\",\n \"date\",\n \"bigint\",\n \"symbol\",\n \"function\",\n \"undefined\",\n \"null\",\n \"array\",\n \"object\",\n \"unknown\",\n \"promise\",\n \"void\",\n \"never\",\n \"map\",\n \"set\",\n]);\nconst getParsedType = (data) => {\n const t = typeof data;\n switch (t) {\n case \"undefined\":\n return ZodParsedType.undefined;\n case \"string\":\n return ZodParsedType.string;\n case \"number\":\n return isNaN(data) ? ZodParsedType.nan : ZodParsedType.number;\n case \"boolean\":\n return ZodParsedType.boolean;\n case \"function\":\n return ZodParsedType.function;\n case \"bigint\":\n return ZodParsedType.bigint;\n case \"symbol\":\n return ZodParsedType.symbol;\n case \"object\":\n if (Array.isArray(data)) {\n return ZodParsedType.array;\n }\n if (data === null) {\n return ZodParsedType.null;\n }\n if (data.then &&\n typeof data.then === \"function\" &&\n data.catch &&\n typeof data.catch === \"function\") {\n return ZodParsedType.promise;\n }\n if (typeof Map !== \"undefined\" && data instanceof Map) {\n return ZodParsedType.map;\n }\n if (typeof Set !== \"undefined\" && data instanceof Set) {\n return ZodParsedType.set;\n }\n if (typeof Date !== \"undefined\" && data instanceof Date) {\n return ZodParsedType.date;\n }\n return ZodParsedType.object;\n default:\n return ZodParsedType.unknown;\n }\n};\n\nconst ZodIssueCode = util.arrayToEnum([\n \"invalid_type\",\n \"invalid_literal\",\n \"custom\",\n \"invalid_union\",\n \"invalid_union_discriminator\",\n \"invalid_enum_value\",\n \"unrecognized_keys\",\n \"invalid_arguments\",\n \"invalid_return_type\",\n \"invalid_date\",\n \"invalid_string\",\n \"too_small\",\n \"too_big\",\n \"invalid_intersection_types\",\n \"not_multiple_of\",\n \"not_finite\",\n]);\nconst quotelessJson = (obj) => {\n const json = JSON.stringify(obj, null, 2);\n return json.replace(/\"([^\"]+)\":/g, \"$1:\");\n};\nclass ZodError extends Error {\n constructor(issues) {\n super();\n this.issues = [];\n this.addIssue = (sub) => {\n this.issues = [...this.issues, sub];\n };\n this.addIssues = (subs = []) => {\n this.issues = [...this.issues, ...subs];\n };\n const actualProto = new.target.prototype;\n if (Object.setPrototypeOf) {\n // eslint-disable-next-line ban/ban\n Object.setPrototypeOf(this, actualProto);\n }\n else {\n this.__proto__ = actualProto;\n }\n this.name = \"ZodError\";\n this.issues = issues;\n }\n get errors() {\n return this.issues;\n }\n format(_mapper) {\n const mapper = _mapper ||\n function (issue) {\n return issue.message;\n };\n const fieldErrors = { _errors: [] };\n const processError = (error) => {\n for (const issue of error.issues) {\n if (issue.code === \"invalid_union\") {\n issue.unionErrors.map(processError);\n }\n else if (issue.code === \"invalid_return_type\") {\n processError(issue.returnTypeError);\n }\n else if (issue.code === \"invalid_arguments\") {\n processError(issue.argumentsError);\n }\n else if (issue.path.length === 0) {\n fieldErrors._errors.push(mapper(issue));\n }\n else {\n let curr = fieldErrors;\n let i = 0;\n while (i < issue.path.length) {\n const el = issue.path[i];\n const terminal = i === issue.path.length - 1;\n if (!terminal) {\n curr[el] = curr[el] || { _errors: [] };\n // if (typeof el === \"string\") {\n // curr[el] = curr[el] || { _errors: [] };\n // } else if (typeof el === \"number\") {\n // const errorArray: any = [];\n // errorArray._errors = [];\n // curr[el] = curr[el] || errorArray;\n // }\n }\n else {\n curr[el] = curr[el] || { _errors: [] };\n curr[el]._errors.push(mapper(issue));\n }\n curr = curr[el];\n i++;\n }\n }\n }\n };\n processError(this);\n return fieldErrors;\n }\n static assert(value) {\n if (!(value instanceof ZodError)) {\n throw new Error(`Not a ZodError: ${value}`);\n }\n }\n toString() {\n return this.message;\n }\n get message() {\n return JSON.stringify(this.issues, util.jsonStringifyReplacer, 2);\n }\n get isEmpty() {\n return this.issues.length === 0;\n }\n flatten(mapper = (issue) => issue.message) {\n const fieldErrors = {};\n const formErrors = [];\n for (const sub of this.issues) {\n if (sub.path.length > 0) {\n fieldErrors[sub.path[0]] = fieldErrors[sub.path[0]] || [];\n fieldErrors[sub.path[0]].push(mapper(sub));\n }\n else {\n formErrors.push(mapper(sub));\n }\n }\n return { formErrors, fieldErrors };\n }\n get formErrors() {\n return this.flatten();\n }\n}\nZodError.create = (issues) => {\n const error = new ZodError(issues);\n return error;\n};\n\nconst errorMap = (issue, _ctx) => {\n let message;\n switch (issue.code) {\n case ZodIssueCode.invalid_type:\n if (issue.received === ZodParsedType.undefined) {\n message = \"Required\";\n }\n else {\n message = `Expected ${issue.expected}, received ${issue.received}`;\n }\n break;\n case ZodIssueCode.invalid_literal:\n message = `Invalid literal value, expected ${JSON.stringify(issue.expected, util.jsonStringifyReplacer)}`;\n break;\n case ZodIssueCode.unrecognized_keys:\n message = `Unrecognized key(s) in object: ${util.joinValues(issue.keys, \", \")}`;\n break;\n case ZodIssueCode.invalid_union:\n message = `Invalid input`;\n break;\n case ZodIssueCode.invalid_union_discriminator:\n message = `Invalid discriminator value. Expected ${util.joinValues(issue.options)}`;\n break;\n case ZodIssueCode.invalid_enum_value:\n message = `Invalid enum value. Expected ${util.joinValues(issue.options)}, received '${issue.received}'`;\n break;\n case ZodIssueCode.invalid_arguments:\n message = `Invalid function arguments`;\n break;\n case ZodIssueCode.invalid_return_type:\n message = `Invalid function return type`;\n break;\n case ZodIssueCode.invalid_date:\n message = `Invalid date`;\n break;\n case ZodIssueCode.invalid_string:\n if (typeof issue.validation === \"object\") {\n if (\"includes\" in issue.validation) {\n message = `Invalid input: must include \"${issue.validation.includes}\"`;\n if (typeof issue.validation.position === \"number\") {\n message = `${message} at one or more positions greater than or equal to ${issue.validation.position}`;\n }\n }\n else if (\"startsWith\" in issue.validation) {\n message = `Invalid input: must start with \"${issue.validation.startsWith}\"`;\n }\n else if (\"endsWith\" in issue.validation) {\n message = `Invalid input: must end with \"${issue.validation.endsWith}\"`;\n }\n else {\n util.assertNever(issue.validation);\n }\n }\n else if (issue.validation !== \"regex\") {\n message = `Invalid ${issue.validation}`;\n }\n else {\n message = \"Invalid\";\n }\n break;\n case ZodIssueCode.too_small:\n if (issue.type === \"array\")\n message = `Array must contain ${issue.exact ? \"exactly\" : issue.inclusive ? `at least` : `more than`} ${issue.minimum} element(s)`;\n else if (issue.type === \"string\")\n message = `String must contain ${issue.exact ? \"exactly\" : issue.inclusive ? `at least` : `over`} ${issue.minimum} character(s)`;\n else if (issue.type === \"number\")\n message = `Number must be ${issue.exact\n ? `exactly equal to `\n : issue.inclusive\n ? `greater than or equal to `\n : `greater than `}${issue.minimum}`;\n else if (issue.type === \"date\")\n message = `Date must be ${issue.exact\n ? `exactly equal to `\n : issue.inclusive\n ? `greater than or equal to `\n : `greater than `}${new Date(Number(issue.minimum))}`;\n else\n message = \"Invalid input\";\n break;\n case ZodIssueCode.too_big:\n if (issue.type === \"array\")\n message = `Array must contain ${issue.exact ? `exactly` : issue.inclusive ? `at most` : `less than`} ${issue.maximum} element(s)`;\n else if (issue.type === \"string\")\n message = `String must contain ${issue.exact ? `exactly` : issue.inclusive ? `at most` : `under`} ${issue.maximum} character(s)`;\n else if (issue.type === \"number\")\n message = `Number must be ${issue.exact\n ? `exactly`\n : issue.inclusive\n ? `less than or equal to`\n : `less than`} ${issue.maximum}`;\n else if (issue.type === \"bigint\")\n message = `BigInt must be ${issue.exact\n ? `exactly`\n : issue.inclusive\n ? `less than or equal to`\n : `less than`} ${issue.maximum}`;\n else if (issue.type === \"date\")\n message = `Date must be ${issue.exact\n ? `exactly`\n : issue.inclusive\n ? `smaller than or equal to`\n : `smaller than`} ${new Date(Number(issue.maximum))}`;\n else\n message = \"Invalid input\";\n break;\n case ZodIssueCode.custom:\n message = `Invalid input`;\n break;\n case ZodIssueCode.invalid_intersection_types:\n message = `Intersection results could not be merged`;\n break;\n case ZodIssueCode.not_multiple_of:\n message = `Number must be a multiple of ${issue.multipleOf}`;\n break;\n case ZodIssueCode.not_finite:\n message = \"Number must be finite\";\n break;\n default:\n message = _ctx.defaultError;\n util.assertNever(issue);\n }\n return { message };\n};\n\nlet overrideErrorMap = errorMap;\nfunction setErrorMap(map) {\n overrideErrorMap = map;\n}\nfunction getErrorMap() {\n return overrideErrorMap;\n}\n\nconst makeIssue = (params) => {\n const { data, path, errorMaps, issueData } = params;\n const fullPath = [...path, ...(issueData.path || [])];\n const fullIssue = {\n ...issueData,\n path: fullPath,\n };\n if (issueData.message !== undefined) {\n return {\n ...issueData,\n path: fullPath,\n message: issueData.message,\n };\n }\n let errorMessage = \"\";\n const maps = errorMaps\n .filter((m) => !!m)\n .slice()\n .reverse();\n for (const map of maps) {\n errorMessage = map(fullIssue, { data, defaultError: errorMessage }).message;\n }\n return {\n ...issueData,\n path: fullPath,\n message: errorMessage,\n };\n};\nconst EMPTY_PATH = [];\nfunction addIssueToContext(ctx, issueData) {\n const overrideMap = getErrorMap();\n const issue = makeIssue({\n issueData: issueData,\n data: ctx.data,\n path: ctx.path,\n errorMaps: [\n ctx.common.contextualErrorMap,\n ctx.schemaErrorMap,\n overrideMap,\n overrideMap === errorMap ? undefined : errorMap, // then global default map\n ].filter((x) => !!x),\n });\n ctx.common.issues.push(issue);\n}\nclass ParseStatus {\n constructor() {\n this.value = \"valid\";\n }\n dirty() {\n if (this.value === \"valid\")\n this.value = \"dirty\";\n }\n abort() {\n if (this.value !== \"aborted\")\n this.value = \"aborted\";\n }\n static mergeArray(status, results) {\n const arrayValue = [];\n for (const s of results) {\n if (s.status === \"aborted\")\n return INVALID;\n if (s.status === \"dirty\")\n status.dirty();\n arrayValue.push(s.value);\n }\n return { status: status.value, value: arrayValue };\n }\n static async mergeObjectAsync(status, pairs) {\n const syncPairs = [];\n for (const pair of pairs) {\n const key = await pair.key;\n const value = await pair.value;\n syncPairs.push({\n key,\n value,\n });\n }\n return ParseStatus.mergeObjectSync(status, syncPairs);\n }\n static mergeObjectSync(status, pairs) {\n const finalObject = {};\n for (const pair of pairs) {\n const { key, value } = pair;\n if (key.status === \"aborted\")\n return INVALID;\n if (value.status === \"aborted\")\n return INVALID;\n if (key.status === \"dirty\")\n status.dirty();\n if (value.status === \"dirty\")\n status.dirty();\n if (key.value !== \"__proto__\" &&\n (typeof value.value !== \"undefined\" || pair.alwaysSet)) {\n finalObject[key.value] = value.value;\n }\n }\n return { status: status.value, value: finalObject };\n }\n}\nconst INVALID = Object.freeze({\n status: \"aborted\",\n});\nconst DIRTY = (value) => ({ status: \"dirty\", value });\nconst OK = (value) => ({ status: \"valid\", value });\nconst isAborted = (x) => x.status === \"aborted\";\nconst isDirty = (x) => x.status === \"dirty\";\nconst isValid = (x) => x.status === \"valid\";\nconst isAsync = (x) => typeof Promise !== \"undefined\" && x instanceof Promise;\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nfunction __classPrivateFieldGet(receiver, state, kind, f) {\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nfunction __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\ntypeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\r\n var e = new Error(message);\r\n return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\r\n};\n\nvar errorUtil;\n(function (errorUtil) {\n errorUtil.errToObj = (message) => typeof message === \"string\" ? { message } : message || {};\n errorUtil.toString = (message) => typeof message === \"string\" ? message : message === null || message === void 0 ? void 0 : message.message;\n})(errorUtil || (errorUtil = {}));\n\nvar _ZodEnum_cache, _ZodNativeEnum_cache;\nclass ParseInputLazyPath {\n constructor(parent, value, path, key) {\n this._cachedPath = [];\n this.parent = parent;\n this.data = value;\n this._path = path;\n this._key = key;\n }\n get path() {\n if (!this._cachedPath.length) {\n if (this._key instanceof Array) {\n this._cachedPath.push(...this._path, ...this._key);\n }\n else {\n this._cachedPath.push(...this._path, this._key);\n }\n }\n return this._cachedPath;\n }\n}\nconst handleResult = (ctx, result) => {\n if (isValid(result)) {\n return { success: true, data: result.value };\n }\n else {\n if (!ctx.common.issues.length) {\n throw new Error(\"Validation failed but no issues detected.\");\n }\n return {\n success: false,\n get error() {\n if (this._error)\n return this._error;\n const error = new ZodError(ctx.common.issues);\n this._error = error;\n return this._error;\n },\n };\n }\n};\nfunction processCreateParams(params) {\n if (!params)\n return {};\n const { errorMap, invalid_type_error, required_error, description } = params;\n if (errorMap && (invalid_type_error || required_error)) {\n throw new Error(`Can't use \"invalid_type_error\" or \"required_error\" in conjunction with custom error map.`);\n }\n if (errorMap)\n return { errorMap: errorMap, description };\n const customMap = (iss, ctx) => {\n var _a, _b;\n const { message } = params;\n if (iss.code === \"invalid_enum_value\") {\n return { message: message !== null && message !== void 0 ? message : ctx.defaultError };\n }\n if (typeof ctx.data === \"undefined\") {\n return { message: (_a = message !== null && message !== void 0 ? message : required_error) !== null && _a !== void 0 ? _a : ctx.defaultError };\n }\n if (iss.code !== \"invalid_type\")\n return { message: ctx.defaultError };\n return { message: (_b = message !== null && message !== void 0 ? message : invalid_type_error) !== null && _b !== void 0 ? _b : ctx.defaultError };\n };\n return { errorMap: customMap, description };\n}\nclass ZodType {\n constructor(def) {\n /** Alias of safeParseAsync */\n this.spa = this.safeParseAsync;\n this._def = def;\n this.parse = this.parse.bind(this);\n this.safeParse = this.safeParse.bind(this);\n this.parseAsync = this.parseAsync.bind(this);\n this.safeParseAsync = this.safeParseAsync.bind(this);\n this.spa = this.spa.bind(this);\n this.refine = this.refine.bind(this);\n this.refinement = this.refinement.bind(this);\n this.superRefine = this.superRefine.bind(this);\n this.optional = this.optional.bind(this);\n this.nullable = this.nullable.bind(this);\n this.nullish = this.nullish.bind(this);\n this.array = this.array.bind(this);\n this.promise = this.promise.bind(this);\n this.or = this.or.bind(this);\n this.and = this.and.bind(this);\n this.transform = this.transform.bind(this);\n this.brand = this.brand.bind(this);\n this.default = this.default.bind(this);\n this.catch = this.catch.bind(this);\n this.describe = this.describe.bind(this);\n this.pipe = this.pipe.bind(this);\n this.readonly = this.readonly.bind(this);\n this.isNullable = this.isNullable.bind(this);\n this.isOptional = this.isOptional.bind(this);\n }\n get description() {\n return this._def.description;\n }\n _getType(input) {\n return getParsedType(input.data);\n }\n _getOrReturnCtx(input, ctx) {\n return (ctx || {\n common: input.parent.common,\n data: input.data,\n parsedType: getParsedType(input.data),\n schemaErrorMap: this._def.errorMap,\n path: input.path,\n parent: input.parent,\n });\n }\n _processInputParams(input) {\n return {\n status: new ParseStatus(),\n ctx: {\n common: input.parent.common,\n data: input.data,\n parsedType: getParsedType(input.data),\n schemaErrorMap: this._def.errorMap,\n path: input.path,\n parent: input.parent,\n },\n };\n }\n _parseSync(input) {\n const result = this._parse(input);\n if (isAsync(result)) {\n throw new Error(\"Synchronous parse encountered promise.\");\n }\n return result;\n }\n _parseAsync(input) {\n const result = this._parse(input);\n return Promise.resolve(result);\n }\n parse(data, params) {\n const result = this.safeParse(data, params);\n if (result.success)\n return result.data;\n throw result.error;\n }\n safeParse(data, params) {\n var _a;\n const ctx = {\n common: {\n issues: [],\n async: (_a = params === null || params === void 0 ? void 0 : params.async) !== null && _a !== void 0 ? _a : false,\n contextualErrorMap: params === null || params === void 0 ? void 0 : params.errorMap,\n },\n path: (params === null || params === void 0 ? void 0 : params.path) || [],\n schemaErrorMap: this._def.errorMap,\n parent: null,\n data,\n parsedType: getParsedType(data),\n };\n const result = this._parseSync({ data, path: ctx.path, parent: ctx });\n return handleResult(ctx, result);\n }\n async parseAsync(data, params) {\n const result = await this.safeParseAsync(data, params);\n if (result.success)\n return result.data;\n throw result.error;\n }\n async safeParseAsync(data, params) {\n const ctx = {\n common: {\n issues: [],\n contextualErrorMap: params === null || params === void 0 ? void 0 : params.errorMap,\n async: true,\n },\n path: (params === null || params === void 0 ? void 0 : params.path) || [],\n schemaErrorMap: this._def.errorMap,\n parent: null,\n data,\n parsedType: getParsedType(data),\n };\n const maybeAsyncResult = this._parse({ data, path: ctx.path, parent: ctx });\n const result = await (isAsync(maybeAsyncResult)\n ? maybeAsyncResult\n : Promise.resolve(maybeAsyncResult));\n return handleResult(ctx, result);\n }\n refine(check, message) {\n const getIssueProperties = (val) => {\n if (typeof message === \"string\" || typeof message === \"undefined\") {\n return { message };\n }\n else if (typeof message === \"function\") {\n return message(val);\n }\n else {\n return message;\n }\n };\n return this._refinement((val, ctx) => {\n const result = check(val);\n const setError = () => ctx.addIssue({\n code: ZodIssueCode.custom,\n ...getIssueProperties(val),\n });\n if (typeof Promise !== \"undefined\" && result instanceof Promise) {\n return result.then((data) => {\n if (!data) {\n setError();\n return false;\n }\n else {\n return true;\n }\n });\n }\n if (!result) {\n setError();\n return false;\n }\n else {\n return true;\n }\n });\n }\n refinement(check, refinementData) {\n return this._refinement((val, ctx) => {\n if (!check(val)) {\n ctx.addIssue(typeof refinementData === \"function\"\n ? refinementData(val, ctx)\n : refinementData);\n return false;\n }\n else {\n return true;\n }\n });\n }\n _refinement(refinement) {\n return new ZodEffects({\n schema: this,\n typeName: ZodFirstPartyTypeKind.ZodEffects,\n effect: { type: \"refinement\", refinement },\n });\n }\n superRefine(refinement) {\n return this._refinement(refinement);\n }\n optional() {\n return ZodOptional.create(this, this._def);\n }\n nullable() {\n return ZodNullable.create(this, this._def);\n }\n nullish() {\n return this.nullable().optional();\n }\n array() {\n return ZodArray.create(this, this._def);\n }\n promise() {\n return ZodPromise.create(this, this._def);\n }\n or(option) {\n return ZodUnion.create([this, option], this._def);\n }\n and(incoming) {\n return ZodIntersection.create(this, incoming, this._def);\n }\n transform(transform) {\n return new ZodEffects({\n ...processCreateParams(this._def),\n schema: this,\n typeName: ZodFirstPartyTypeKind.ZodEffects,\n effect: { type: \"transform\", transform },\n });\n }\n default(def) {\n const defaultValueFunc = typeof def === \"function\" ? def : () => def;\n return new ZodDefault({\n ...processCreateParams(this._def),\n innerType: this,\n defaultValue: defaultValueFunc,\n typeName: ZodFirstPartyTypeKind.ZodDefault,\n });\n }\n brand() {\n return new ZodBranded({\n typeName: ZodFirstPartyTypeKind.ZodBranded,\n type: this,\n ...processCreateParams(this._def),\n });\n }\n catch(def) {\n const catchValueFunc = typeof def === \"function\" ? def : () => def;\n return new ZodCatch({\n ...processCreateParams(this._def),\n innerType: this,\n catchValue: catchValueFunc,\n typeName: ZodFirstPartyTypeKind.ZodCatch,\n });\n }\n describe(description) {\n const This = this.constructor;\n return new This({\n ...this._def,\n description,\n });\n }\n pipe(target) {\n return ZodPipeline.create(this, target);\n }\n readonly() {\n return ZodReadonly.create(this);\n }\n isOptional() {\n return this.safeParse(undefined).success;\n }\n isNullable() {\n return this.safeParse(null).success;\n }\n}\nconst cuidRegex = /^c[^\\s-]{8,}$/i;\nconst cuid2Regex = /^[0-9a-z]+$/;\nconst ulidRegex = /^[0-9A-HJKMNP-TV-Z]{26}$/;\n// const uuidRegex =\n// /^([a-f0-9]{8}-[a-f0-9]{4}-[1-5][a-f0-9]{3}-[a-f0-9]{4}-[a-f0-9]{12}|00000000-0000-0000-0000-000000000000)$/i;\nconst uuidRegex = /^[0-9a-fA-F]{8}\\b-[0-9a-fA-F]{4}\\b-[0-9a-fA-F]{4}\\b-[0-9a-fA-F]{4}\\b-[0-9a-fA-F]{12}$/i;\nconst nanoidRegex = /^[a-z0-9_-]{21}$/i;\nconst durationRegex = /^[-+]?P(?!$)(?:(?:[-+]?\\d+Y)|(?:[-+]?\\d+[.,]\\d+Y$))?(?:(?:[-+]?\\d+M)|(?:[-+]?\\d+[.,]\\d+M$))?(?:(?:[-+]?\\d+W)|(?:[-+]?\\d+[.,]\\d+W$))?(?:(?:[-+]?\\d+D)|(?:[-+]?\\d+[.,]\\d+D$))?(?:T(?=[\\d+-])(?:(?:[-+]?\\d+H)|(?:[-+]?\\d+[.,]\\d+H$))?(?:(?:[-+]?\\d+M)|(?:[-+]?\\d+[.,]\\d+M$))?(?:[-+]?\\d+(?:[.,]\\d+)?S)?)??$/;\n// from https://stackoverflow.com/a/46181/1550155\n// old version: too slow, didn't support unicode\n// const emailRegex = /^((([a-z]|\\d|[!#\\$%&'\\*\\+\\-\\/=\\?\\^_`{\\|}~]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])+(\\.([a-z]|\\d|[!#\\$%&'\\*\\+\\-\\/=\\?\\^_`{\\|}~]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])+)*)|((\\x22)((((\\x20|\\x09)*(\\x0d\\x0a))?(\\x20|\\x09)+)?(([\\x01-\\x08\\x0b\\x0c\\x0e-\\x1f\\x7f]|\\x21|[\\x23-\\x5b]|[\\x5d-\\x7e]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])|(\\\\([\\x01-\\x09\\x0b\\x0c\\x0d-\\x7f]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]))))*(((\\x20|\\x09)*(\\x0d\\x0a))?(\\x20|\\x09)+)?(\\x22)))@((([a-z]|\\d|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])|(([a-z]|\\d|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]|\\d|-|\\.|_|~|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])*([a-z]|\\d|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])))\\.)+(([a-z]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])|(([a-z]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])([a-z]|\\d|-|\\.|_|~|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])*([a-z]|[\\u00A0-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF])))$/i;\n//old email regex\n// const emailRegex = /^(([^<>()[\\].,;:\\s@\"]+(\\.[^<>()[\\].,;:\\s@\"]+)*)|(\".+\"))@((?!-)([^<>()[\\].,;:\\s@\"]+\\.)+[^<>()[\\].,;:\\s@\"]{1,})[^-<>()[\\].,;:\\s@\"]$/i;\n// eslint-disable-next-line\n// const emailRegex =\n// /^(([^<>()[\\]\\\\.,;:\\s@\\\"]+(\\.[^<>()[\\]\\\\.,;:\\s@\\\"]+)*)|(\\\".+\\\"))@((\\[(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\\])|(\\[IPv6:(([a-f0-9]{1,4}:){7}|::([a-f0-9]{1,4}:){0,6}|([a-f0-9]{1,4}:){1}:([a-f0-9]{1,4}:){0,5}|([a-f0-9]{1,4}:){2}:([a-f0-9]{1,4}:){0,4}|([a-f0-9]{1,4}:){3}:([a-f0-9]{1,4}:){0,3}|([a-f0-9]{1,4}:){4}:([a-f0-9]{1,4}:){0,2}|([a-f0-9]{1,4}:){5}:([a-f0-9]{1,4}:){0,1})([a-f0-9]{1,4}|(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2})))\\])|([A-Za-z0-9]([A-Za-z0-9-]*[A-Za-z0-9])*(\\.[A-Za-z]{2,})+))$/;\n// const emailRegex =\n// /^[a-zA-Z0-9\\.\\!\\#\\$\\%\\&\\'\\*\\+\\/\\=\\?\\^\\_\\`\\{\\|\\}\\~\\-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$/;\n// const emailRegex =\n// /^(?:[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\\.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*|\"(?:[\\x01-\\x08\\x0b\\x0c\\x0e-\\x1f\\x21\\x23-\\x5b\\x5d-\\x7f]|\\\\[\\x01-\\x09\\x0b\\x0c\\x0e-\\x7f])*\")@(?:(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\\.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?|\\[(?:(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\.){3}(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?|[a-z0-9-]*[a-z0-9]:(?:[\\x01-\\x08\\x0b\\x0c\\x0e-\\x1f\\x21-\\x5a\\x53-\\x7f]|\\\\[\\x01-\\x09\\x0b\\x0c\\x0e-\\x7f])+)\\])$/i;\nconst emailRegex = /^(?!\\.)(?!.*\\.\\.)([A-Z0-9_'+\\-\\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\\-]*\\.)+[A-Z]{2,}$/i;\n// const emailRegex =\n// /^[a-z0-9.!#$%&’*+/=?^_`{|}~-]+@[a-z0-9-]+(?:\\.[a-z0-9\\-]+)*$/i;\n// from https://thekevinscott.com/emojis-in-javascript/#writing-a-regular-expression\nconst _emojiRegex = `^(\\\\p{Extended_Pictographic}|\\\\p{Emoji_Component})+$`;\nlet emojiRegex;\n// faster, simpler, safer\nconst ipv4Regex = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])$/;\nconst ipv6Regex = /^(([a-f0-9]{1,4}:){7}|::([a-f0-9]{1,4}:){0,6}|([a-f0-9]{1,4}:){1}:([a-f0-9]{1,4}:){0,5}|([a-f0-9]{1,4}:){2}:([a-f0-9]{1,4}:){0,4}|([a-f0-9]{1,4}:){3}:([a-f0-9]{1,4}:){0,3}|([a-f0-9]{1,4}:){4}:([a-f0-9]{1,4}:){0,2}|([a-f0-9]{1,4}:){5}:([a-f0-9]{1,4}:){0,1})([a-f0-9]{1,4}|(((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2}))\\.){3}((25[0-5])|(2[0-4][0-9])|(1[0-9]{2})|([0-9]{1,2})))$/;\n// https://stackoverflow.com/questions/7860392/determine-if-string-is-in-base64-using-javascript\nconst base64Regex = /^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$/;\n// simple\n// const dateRegexSource = `\\\\d{4}-\\\\d{2}-\\\\d{2}`;\n// no leap year validation\n// const dateRegexSource = `\\\\d{4}-((0[13578]|10|12)-31|(0[13-9]|1[0-2])-30|(0[1-9]|1[0-2])-(0[1-9]|1\\\\d|2\\\\d))`;\n// with leap year validation\nconst dateRegexSource = `((\\\\d\\\\d[2468][048]|\\\\d\\\\d[13579][26]|\\\\d\\\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\\\d{4}-((0[13578]|1[02])-(0[1-9]|[12]\\\\d|3[01])|(0[469]|11)-(0[1-9]|[12]\\\\d|30)|(02)-(0[1-9]|1\\\\d|2[0-8])))`;\nconst dateRegex = new RegExp(`^${dateRegexSource}$`);\nfunction timeRegexSource(args) {\n // let regex = `\\\\d{2}:\\\\d{2}:\\\\d{2}`;\n let regex = `([01]\\\\d|2[0-3]):[0-5]\\\\d:[0-5]\\\\d`;\n if (args.precision) {\n regex = `${regex}\\\\.\\\\d{${args.precision}}`;\n }\n else if (args.precision == null) {\n regex = `${regex}(\\\\.\\\\d+)?`;\n }\n return regex;\n}\nfunction timeRegex(args) {\n return new RegExp(`^${timeRegexSource(args)}$`);\n}\n// Adapted from https://stackoverflow.com/a/3143231\nfunction datetimeRegex(args) {\n let regex = `${dateRegexSource}T${timeRegexSource(args)}`;\n const opts = [];\n opts.push(args.local ? `Z?` : `Z`);\n if (args.offset)\n opts.push(`([+-]\\\\d{2}:?\\\\d{2})`);\n regex = `${regex}(${opts.join(\"|\")})`;\n return new RegExp(`^${regex}$`);\n}\nfunction isValidIP(ip, version) {\n if ((version === \"v4\" || !version) && ipv4Regex.test(ip)) {\n return true;\n }\n if ((version === \"v6\" || !version) && ipv6Regex.test(ip)) {\n return true;\n }\n return false;\n}\nclass ZodString extends ZodType {\n _parse(input) {\n if (this._def.coerce) {\n input.data = String(input.data);\n }\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.string) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.string,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n const status = new ParseStatus();\n let ctx = undefined;\n for (const check of this._def.checks) {\n if (check.kind === \"min\") {\n if (input.data.length < check.value) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_small,\n minimum: check.value,\n type: \"string\",\n inclusive: true,\n exact: false,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"max\") {\n if (input.data.length > check.value) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_big,\n maximum: check.value,\n type: \"string\",\n inclusive: true,\n exact: false,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"length\") {\n const tooBig = input.data.length > check.value;\n const tooSmall = input.data.length < check.value;\n if (tooBig || tooSmall) {\n ctx = this._getOrReturnCtx(input, ctx);\n if (tooBig) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_big,\n maximum: check.value,\n type: \"string\",\n inclusive: true,\n exact: true,\n message: check.message,\n });\n }\n else if (tooSmall) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_small,\n minimum: check.value,\n type: \"string\",\n inclusive: true,\n exact: true,\n message: check.message,\n });\n }\n status.dirty();\n }\n }\n else if (check.kind === \"email\") {\n if (!emailRegex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"email\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"emoji\") {\n if (!emojiRegex) {\n emojiRegex = new RegExp(_emojiRegex, \"u\");\n }\n if (!emojiRegex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"emoji\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"uuid\") {\n if (!uuidRegex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"uuid\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"nanoid\") {\n if (!nanoidRegex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"nanoid\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"cuid\") {\n if (!cuidRegex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"cuid\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"cuid2\") {\n if (!cuid2Regex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"cuid2\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"ulid\") {\n if (!ulidRegex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"ulid\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"url\") {\n try {\n new URL(input.data);\n }\n catch (_a) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"url\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"regex\") {\n check.regex.lastIndex = 0;\n const testResult = check.regex.test(input.data);\n if (!testResult) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"regex\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"trim\") {\n input.data = input.data.trim();\n }\n else if (check.kind === \"includes\") {\n if (!input.data.includes(check.value, check.position)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_string,\n validation: { includes: check.value, position: check.position },\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"toLowerCase\") {\n input.data = input.data.toLowerCase();\n }\n else if (check.kind === \"toUpperCase\") {\n input.data = input.data.toUpperCase();\n }\n else if (check.kind === \"startsWith\") {\n if (!input.data.startsWith(check.value)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_string,\n validation: { startsWith: check.value },\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"endsWith\") {\n if (!input.data.endsWith(check.value)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_string,\n validation: { endsWith: check.value },\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"datetime\") {\n const regex = datetimeRegex(check);\n if (!regex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_string,\n validation: \"datetime\",\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"date\") {\n const regex = dateRegex;\n if (!regex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_string,\n validation: \"date\",\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"time\") {\n const regex = timeRegex(check);\n if (!regex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_string,\n validation: \"time\",\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"duration\") {\n if (!durationRegex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"duration\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"ip\") {\n if (!isValidIP(input.data, check.version)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"ip\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"base64\") {\n if (!base64Regex.test(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n validation: \"base64\",\n code: ZodIssueCode.invalid_string,\n message: check.message,\n });\n status.dirty();\n }\n }\n else {\n util.assertNever(check);\n }\n }\n return { status: status.value, value: input.data };\n }\n _regex(regex, validation, message) {\n return this.refinement((data) => regex.test(data), {\n validation,\n code: ZodIssueCode.invalid_string,\n ...errorUtil.errToObj(message),\n });\n }\n _addCheck(check) {\n return new ZodString({\n ...this._def,\n checks: [...this._def.checks, check],\n });\n }\n email(message) {\n return this._addCheck({ kind: \"email\", ...errorUtil.errToObj(message) });\n }\n url(message) {\n return this._addCheck({ kind: \"url\", ...errorUtil.errToObj(message) });\n }\n emoji(message) {\n return this._addCheck({ kind: \"emoji\", ...errorUtil.errToObj(message) });\n }\n uuid(message) {\n return this._addCheck({ kind: \"uuid\", ...errorUtil.errToObj(message) });\n }\n nanoid(message) {\n return this._addCheck({ kind: \"nanoid\", ...errorUtil.errToObj(message) });\n }\n cuid(message) {\n return this._addCheck({ kind: \"cuid\", ...errorUtil.errToObj(message) });\n }\n cuid2(message) {\n return this._addCheck({ kind: \"cuid2\", ...errorUtil.errToObj(message) });\n }\n ulid(message) {\n return this._addCheck({ kind: \"ulid\", ...errorUtil.errToObj(message) });\n }\n base64(message) {\n return this._addCheck({ kind: \"base64\", ...errorUtil.errToObj(message) });\n }\n ip(options) {\n return this._addCheck({ kind: \"ip\", ...errorUtil.errToObj(options) });\n }\n datetime(options) {\n var _a, _b;\n if (typeof options === \"string\") {\n return this._addCheck({\n kind: \"datetime\",\n precision: null,\n offset: false,\n local: false,\n message: options,\n });\n }\n return this._addCheck({\n kind: \"datetime\",\n precision: typeof (options === null || options === void 0 ? void 0 : options.precision) === \"undefined\" ? null : options === null || options === void 0 ? void 0 : options.precision,\n offset: (_a = options === null || options === void 0 ? void 0 : options.offset) !== null && _a !== void 0 ? _a : false,\n local: (_b = options === null || options === void 0 ? void 0 : options.local) !== null && _b !== void 0 ? _b : false,\n ...errorUtil.errToObj(options === null || options === void 0 ? void 0 : options.message),\n });\n }\n date(message) {\n return this._addCheck({ kind: \"date\", message });\n }\n time(options) {\n if (typeof options === \"string\") {\n return this._addCheck({\n kind: \"time\",\n precision: null,\n message: options,\n });\n }\n return this._addCheck({\n kind: \"time\",\n precision: typeof (options === null || options === void 0 ? void 0 : options.precision) === \"undefined\" ? null : options === null || options === void 0 ? void 0 : options.precision,\n ...errorUtil.errToObj(options === null || options === void 0 ? void 0 : options.message),\n });\n }\n duration(message) {\n return this._addCheck({ kind: \"duration\", ...errorUtil.errToObj(message) });\n }\n regex(regex, message) {\n return this._addCheck({\n kind: \"regex\",\n regex: regex,\n ...errorUtil.errToObj(message),\n });\n }\n includes(value, options) {\n return this._addCheck({\n kind: \"includes\",\n value: value,\n position: options === null || options === void 0 ? void 0 : options.position,\n ...errorUtil.errToObj(options === null || options === void 0 ? void 0 : options.message),\n });\n }\n startsWith(value, message) {\n return this._addCheck({\n kind: \"startsWith\",\n value: value,\n ...errorUtil.errToObj(message),\n });\n }\n endsWith(value, message) {\n return this._addCheck({\n kind: \"endsWith\",\n value: value,\n ...errorUtil.errToObj(message),\n });\n }\n min(minLength, message) {\n return this._addCheck({\n kind: \"min\",\n value: minLength,\n ...errorUtil.errToObj(message),\n });\n }\n max(maxLength, message) {\n return this._addCheck({\n kind: \"max\",\n value: maxLength,\n ...errorUtil.errToObj(message),\n });\n }\n length(len, message) {\n return this._addCheck({\n kind: \"length\",\n value: len,\n ...errorUtil.errToObj(message),\n });\n }\n /**\n * @deprecated Use z.string().min(1) instead.\n * @see {@link ZodString.min}\n */\n nonempty(message) {\n return this.min(1, errorUtil.errToObj(message));\n }\n trim() {\n return new ZodString({\n ...this._def,\n checks: [...this._def.checks, { kind: \"trim\" }],\n });\n }\n toLowerCase() {\n return new ZodString({\n ...this._def,\n checks: [...this._def.checks, { kind: \"toLowerCase\" }],\n });\n }\n toUpperCase() {\n return new ZodString({\n ...this._def,\n checks: [...this._def.checks, { kind: \"toUpperCase\" }],\n });\n }\n get isDatetime() {\n return !!this._def.checks.find((ch) => ch.kind === \"datetime\");\n }\n get isDate() {\n return !!this._def.checks.find((ch) => ch.kind === \"date\");\n }\n get isTime() {\n return !!this._def.checks.find((ch) => ch.kind === \"time\");\n }\n get isDuration() {\n return !!this._def.checks.find((ch) => ch.kind === \"duration\");\n }\n get isEmail() {\n return !!this._def.checks.find((ch) => ch.kind === \"email\");\n }\n get isURL() {\n return !!this._def.checks.find((ch) => ch.kind === \"url\");\n }\n get isEmoji() {\n return !!this._def.checks.find((ch) => ch.kind === \"emoji\");\n }\n get isUUID() {\n return !!this._def.checks.find((ch) => ch.kind === \"uuid\");\n }\n get isNANOID() {\n return !!this._def.checks.find((ch) => ch.kind === \"nanoid\");\n }\n get isCUID() {\n return !!this._def.checks.find((ch) => ch.kind === \"cuid\");\n }\n get isCUID2() {\n return !!this._def.checks.find((ch) => ch.kind === \"cuid2\");\n }\n get isULID() {\n return !!this._def.checks.find((ch) => ch.kind === \"ulid\");\n }\n get isIP() {\n return !!this._def.checks.find((ch) => ch.kind === \"ip\");\n }\n get isBase64() {\n return !!this._def.checks.find((ch) => ch.kind === \"base64\");\n }\n get minLength() {\n let min = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"min\") {\n if (min === null || ch.value > min)\n min = ch.value;\n }\n }\n return min;\n }\n get maxLength() {\n let max = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"max\") {\n if (max === null || ch.value < max)\n max = ch.value;\n }\n }\n return max;\n }\n}\nZodString.create = (params) => {\n var _a;\n return new ZodString({\n checks: [],\n typeName: ZodFirstPartyTypeKind.ZodString,\n coerce: (_a = params === null || params === void 0 ? void 0 : params.coerce) !== null && _a !== void 0 ? _a : false,\n ...processCreateParams(params),\n });\n};\n// https://stackoverflow.com/questions/3966484/why-does-modulus-operator-return-fractional-number-in-javascript/31711034#31711034\nfunction floatSafeRemainder(val, step) {\n const valDecCount = (val.toString().split(\".\")[1] || \"\").length;\n const stepDecCount = (step.toString().split(\".\")[1] || \"\").length;\n const decCount = valDecCount > stepDecCount ? valDecCount : stepDecCount;\n const valInt = parseInt(val.toFixed(decCount).replace(\".\", \"\"));\n const stepInt = parseInt(step.toFixed(decCount).replace(\".\", \"\"));\n return (valInt % stepInt) / Math.pow(10, decCount);\n}\nclass ZodNumber extends ZodType {\n constructor() {\n super(...arguments);\n this.min = this.gte;\n this.max = this.lte;\n this.step = this.multipleOf;\n }\n _parse(input) {\n if (this._def.coerce) {\n input.data = Number(input.data);\n }\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.number) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.number,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n let ctx = undefined;\n const status = new ParseStatus();\n for (const check of this._def.checks) {\n if (check.kind === \"int\") {\n if (!util.isInteger(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: \"integer\",\n received: \"float\",\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"min\") {\n const tooSmall = check.inclusive\n ? input.data < check.value\n : input.data <= check.value;\n if (tooSmall) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_small,\n minimum: check.value,\n type: \"number\",\n inclusive: check.inclusive,\n exact: false,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"max\") {\n const tooBig = check.inclusive\n ? input.data > check.value\n : input.data >= check.value;\n if (tooBig) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_big,\n maximum: check.value,\n type: \"number\",\n inclusive: check.inclusive,\n exact: false,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"multipleOf\") {\n if (floatSafeRemainder(input.data, check.value) !== 0) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.not_multiple_of,\n multipleOf: check.value,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"finite\") {\n if (!Number.isFinite(input.data)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.not_finite,\n message: check.message,\n });\n status.dirty();\n }\n }\n else {\n util.assertNever(check);\n }\n }\n return { status: status.value, value: input.data };\n }\n gte(value, message) {\n return this.setLimit(\"min\", value, true, errorUtil.toString(message));\n }\n gt(value, message) {\n return this.setLimit(\"min\", value, false, errorUtil.toString(message));\n }\n lte(value, message) {\n return this.setLimit(\"max\", value, true, errorUtil.toString(message));\n }\n lt(value, message) {\n return this.setLimit(\"max\", value, false, errorUtil.toString(message));\n }\n setLimit(kind, value, inclusive, message) {\n return new ZodNumber({\n ...this._def,\n checks: [\n ...this._def.checks,\n {\n kind,\n value,\n inclusive,\n message: errorUtil.toString(message),\n },\n ],\n });\n }\n _addCheck(check) {\n return new ZodNumber({\n ...this._def,\n checks: [...this._def.checks, check],\n });\n }\n int(message) {\n return this._addCheck({\n kind: \"int\",\n message: errorUtil.toString(message),\n });\n }\n positive(message) {\n return this._addCheck({\n kind: \"min\",\n value: 0,\n inclusive: false,\n message: errorUtil.toString(message),\n });\n }\n negative(message) {\n return this._addCheck({\n kind: \"max\",\n value: 0,\n inclusive: false,\n message: errorUtil.toString(message),\n });\n }\n nonpositive(message) {\n return this._addCheck({\n kind: \"max\",\n value: 0,\n inclusive: true,\n message: errorUtil.toString(message),\n });\n }\n nonnegative(message) {\n return this._addCheck({\n kind: \"min\",\n value: 0,\n inclusive: true,\n message: errorUtil.toString(message),\n });\n }\n multipleOf(value, message) {\n return this._addCheck({\n kind: \"multipleOf\",\n value: value,\n message: errorUtil.toString(message),\n });\n }\n finite(message) {\n return this._addCheck({\n kind: \"finite\",\n message: errorUtil.toString(message),\n });\n }\n safe(message) {\n return this._addCheck({\n kind: \"min\",\n inclusive: true,\n value: Number.MIN_SAFE_INTEGER,\n message: errorUtil.toString(message),\n })._addCheck({\n kind: \"max\",\n inclusive: true,\n value: Number.MAX_SAFE_INTEGER,\n message: errorUtil.toString(message),\n });\n }\n get minValue() {\n let min = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"min\") {\n if (min === null || ch.value > min)\n min = ch.value;\n }\n }\n return min;\n }\n get maxValue() {\n let max = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"max\") {\n if (max === null || ch.value < max)\n max = ch.value;\n }\n }\n return max;\n }\n get isInt() {\n return !!this._def.checks.find((ch) => ch.kind === \"int\" ||\n (ch.kind === \"multipleOf\" && util.isInteger(ch.value)));\n }\n get isFinite() {\n let max = null, min = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"finite\" ||\n ch.kind === \"int\" ||\n ch.kind === \"multipleOf\") {\n return true;\n }\n else if (ch.kind === \"min\") {\n if (min === null || ch.value > min)\n min = ch.value;\n }\n else if (ch.kind === \"max\") {\n if (max === null || ch.value < max)\n max = ch.value;\n }\n }\n return Number.isFinite(min) && Number.isFinite(max);\n }\n}\nZodNumber.create = (params) => {\n return new ZodNumber({\n checks: [],\n typeName: ZodFirstPartyTypeKind.ZodNumber,\n coerce: (params === null || params === void 0 ? void 0 : params.coerce) || false,\n ...processCreateParams(params),\n });\n};\nclass ZodBigInt extends ZodType {\n constructor() {\n super(...arguments);\n this.min = this.gte;\n this.max = this.lte;\n }\n _parse(input) {\n if (this._def.coerce) {\n input.data = BigInt(input.data);\n }\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.bigint) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.bigint,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n let ctx = undefined;\n const status = new ParseStatus();\n for (const check of this._def.checks) {\n if (check.kind === \"min\") {\n const tooSmall = check.inclusive\n ? input.data < check.value\n : input.data <= check.value;\n if (tooSmall) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_small,\n type: \"bigint\",\n minimum: check.value,\n inclusive: check.inclusive,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"max\") {\n const tooBig = check.inclusive\n ? input.data > check.value\n : input.data >= check.value;\n if (tooBig) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_big,\n type: \"bigint\",\n maximum: check.value,\n inclusive: check.inclusive,\n message: check.message,\n });\n status.dirty();\n }\n }\n else if (check.kind === \"multipleOf\") {\n if (input.data % check.value !== BigInt(0)) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.not_multiple_of,\n multipleOf: check.value,\n message: check.message,\n });\n status.dirty();\n }\n }\n else {\n util.assertNever(check);\n }\n }\n return { status: status.value, value: input.data };\n }\n gte(value, message) {\n return this.setLimit(\"min\", value, true, errorUtil.toString(message));\n }\n gt(value, message) {\n return this.setLimit(\"min\", value, false, errorUtil.toString(message));\n }\n lte(value, message) {\n return this.setLimit(\"max\", value, true, errorUtil.toString(message));\n }\n lt(value, message) {\n return this.setLimit(\"max\", value, false, errorUtil.toString(message));\n }\n setLimit(kind, value, inclusive, message) {\n return new ZodBigInt({\n ...this._def,\n checks: [\n ...this._def.checks,\n {\n kind,\n value,\n inclusive,\n message: errorUtil.toString(message),\n },\n ],\n });\n }\n _addCheck(check) {\n return new ZodBigInt({\n ...this._def,\n checks: [...this._def.checks, check],\n });\n }\n positive(message) {\n return this._addCheck({\n kind: \"min\",\n value: BigInt(0),\n inclusive: false,\n message: errorUtil.toString(message),\n });\n }\n negative(message) {\n return this._addCheck({\n kind: \"max\",\n value: BigInt(0),\n inclusive: false,\n message: errorUtil.toString(message),\n });\n }\n nonpositive(message) {\n return this._addCheck({\n kind: \"max\",\n value: BigInt(0),\n inclusive: true,\n message: errorUtil.toString(message),\n });\n }\n nonnegative(message) {\n return this._addCheck({\n kind: \"min\",\n value: BigInt(0),\n inclusive: true,\n message: errorUtil.toString(message),\n });\n }\n multipleOf(value, message) {\n return this._addCheck({\n kind: \"multipleOf\",\n value,\n message: errorUtil.toString(message),\n });\n }\n get minValue() {\n let min = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"min\") {\n if (min === null || ch.value > min)\n min = ch.value;\n }\n }\n return min;\n }\n get maxValue() {\n let max = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"max\") {\n if (max === null || ch.value < max)\n max = ch.value;\n }\n }\n return max;\n }\n}\nZodBigInt.create = (params) => {\n var _a;\n return new ZodBigInt({\n checks: [],\n typeName: ZodFirstPartyTypeKind.ZodBigInt,\n coerce: (_a = params === null || params === void 0 ? void 0 : params.coerce) !== null && _a !== void 0 ? _a : false,\n ...processCreateParams(params),\n });\n};\nclass ZodBoolean extends ZodType {\n _parse(input) {\n if (this._def.coerce) {\n input.data = Boolean(input.data);\n }\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.boolean) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.boolean,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n return OK(input.data);\n }\n}\nZodBoolean.create = (params) => {\n return new ZodBoolean({\n typeName: ZodFirstPartyTypeKind.ZodBoolean,\n coerce: (params === null || params === void 0 ? void 0 : params.coerce) || false,\n ...processCreateParams(params),\n });\n};\nclass ZodDate extends ZodType {\n _parse(input) {\n if (this._def.coerce) {\n input.data = new Date(input.data);\n }\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.date) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.date,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n if (isNaN(input.data.getTime())) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_date,\n });\n return INVALID;\n }\n const status = new ParseStatus();\n let ctx = undefined;\n for (const check of this._def.checks) {\n if (check.kind === \"min\") {\n if (input.data.getTime() < check.value) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_small,\n message: check.message,\n inclusive: true,\n exact: false,\n minimum: check.value,\n type: \"date\",\n });\n status.dirty();\n }\n }\n else if (check.kind === \"max\") {\n if (input.data.getTime() > check.value) {\n ctx = this._getOrReturnCtx(input, ctx);\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_big,\n message: check.message,\n inclusive: true,\n exact: false,\n maximum: check.value,\n type: \"date\",\n });\n status.dirty();\n }\n }\n else {\n util.assertNever(check);\n }\n }\n return {\n status: status.value,\n value: new Date(input.data.getTime()),\n };\n }\n _addCheck(check) {\n return new ZodDate({\n ...this._def,\n checks: [...this._def.checks, check],\n });\n }\n min(minDate, message) {\n return this._addCheck({\n kind: \"min\",\n value: minDate.getTime(),\n message: errorUtil.toString(message),\n });\n }\n max(maxDate, message) {\n return this._addCheck({\n kind: \"max\",\n value: maxDate.getTime(),\n message: errorUtil.toString(message),\n });\n }\n get minDate() {\n let min = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"min\") {\n if (min === null || ch.value > min)\n min = ch.value;\n }\n }\n return min != null ? new Date(min) : null;\n }\n get maxDate() {\n let max = null;\n for (const ch of this._def.checks) {\n if (ch.kind === \"max\") {\n if (max === null || ch.value < max)\n max = ch.value;\n }\n }\n return max != null ? new Date(max) : null;\n }\n}\nZodDate.create = (params) => {\n return new ZodDate({\n checks: [],\n coerce: (params === null || params === void 0 ? void 0 : params.coerce) || false,\n typeName: ZodFirstPartyTypeKind.ZodDate,\n ...processCreateParams(params),\n });\n};\nclass ZodSymbol extends ZodType {\n _parse(input) {\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.symbol) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.symbol,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n return OK(input.data);\n }\n}\nZodSymbol.create = (params) => {\n return new ZodSymbol({\n typeName: ZodFirstPartyTypeKind.ZodSymbol,\n ...processCreateParams(params),\n });\n};\nclass ZodUndefined extends ZodType {\n _parse(input) {\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.undefined) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.undefined,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n return OK(input.data);\n }\n}\nZodUndefined.create = (params) => {\n return new ZodUndefined({\n typeName: ZodFirstPartyTypeKind.ZodUndefined,\n ...processCreateParams(params),\n });\n};\nclass ZodNull extends ZodType {\n _parse(input) {\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.null) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.null,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n return OK(input.data);\n }\n}\nZodNull.create = (params) => {\n return new ZodNull({\n typeName: ZodFirstPartyTypeKind.ZodNull,\n ...processCreateParams(params),\n });\n};\nclass ZodAny extends ZodType {\n constructor() {\n super(...arguments);\n // to prevent instances of other classes from extending ZodAny. this causes issues with catchall in ZodObject.\n this._any = true;\n }\n _parse(input) {\n return OK(input.data);\n }\n}\nZodAny.create = (params) => {\n return new ZodAny({\n typeName: ZodFirstPartyTypeKind.ZodAny,\n ...processCreateParams(params),\n });\n};\nclass ZodUnknown extends ZodType {\n constructor() {\n super(...arguments);\n // required\n this._unknown = true;\n }\n _parse(input) {\n return OK(input.data);\n }\n}\nZodUnknown.create = (params) => {\n return new ZodUnknown({\n typeName: ZodFirstPartyTypeKind.ZodUnknown,\n ...processCreateParams(params),\n });\n};\nclass ZodNever extends ZodType {\n _parse(input) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.never,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n}\nZodNever.create = (params) => {\n return new ZodNever({\n typeName: ZodFirstPartyTypeKind.ZodNever,\n ...processCreateParams(params),\n });\n};\nclass ZodVoid extends ZodType {\n _parse(input) {\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.undefined) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.void,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n return OK(input.data);\n }\n}\nZodVoid.create = (params) => {\n return new ZodVoid({\n typeName: ZodFirstPartyTypeKind.ZodVoid,\n ...processCreateParams(params),\n });\n};\nclass ZodArray extends ZodType {\n _parse(input) {\n const { ctx, status } = this._processInputParams(input);\n const def = this._def;\n if (ctx.parsedType !== ZodParsedType.array) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.array,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n if (def.exactLength !== null) {\n const tooBig = ctx.data.length > def.exactLength.value;\n const tooSmall = ctx.data.length < def.exactLength.value;\n if (tooBig || tooSmall) {\n addIssueToContext(ctx, {\n code: tooBig ? ZodIssueCode.too_big : ZodIssueCode.too_small,\n minimum: (tooSmall ? def.exactLength.value : undefined),\n maximum: (tooBig ? def.exactLength.value : undefined),\n type: \"array\",\n inclusive: true,\n exact: true,\n message: def.exactLength.message,\n });\n status.dirty();\n }\n }\n if (def.minLength !== null) {\n if (ctx.data.length < def.minLength.value) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_small,\n minimum: def.minLength.value,\n type: \"array\",\n inclusive: true,\n exact: false,\n message: def.minLength.message,\n });\n status.dirty();\n }\n }\n if (def.maxLength !== null) {\n if (ctx.data.length > def.maxLength.value) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_big,\n maximum: def.maxLength.value,\n type: \"array\",\n inclusive: true,\n exact: false,\n message: def.maxLength.message,\n });\n status.dirty();\n }\n }\n if (ctx.common.async) {\n return Promise.all([...ctx.data].map((item, i) => {\n return def.type._parseAsync(new ParseInputLazyPath(ctx, item, ctx.path, i));\n })).then((result) => {\n return ParseStatus.mergeArray(status, result);\n });\n }\n const result = [...ctx.data].map((item, i) => {\n return def.type._parseSync(new ParseInputLazyPath(ctx, item, ctx.path, i));\n });\n return ParseStatus.mergeArray(status, result);\n }\n get element() {\n return this._def.type;\n }\n min(minLength, message) {\n return new ZodArray({\n ...this._def,\n minLength: { value: minLength, message: errorUtil.toString(message) },\n });\n }\n max(maxLength, message) {\n return new ZodArray({\n ...this._def,\n maxLength: { value: maxLength, message: errorUtil.toString(message) },\n });\n }\n length(len, message) {\n return new ZodArray({\n ...this._def,\n exactLength: { value: len, message: errorUtil.toString(message) },\n });\n }\n nonempty(message) {\n return this.min(1, message);\n }\n}\nZodArray.create = (schema, params) => {\n return new ZodArray({\n type: schema,\n minLength: null,\n maxLength: null,\n exactLength: null,\n typeName: ZodFirstPartyTypeKind.ZodArray,\n ...processCreateParams(params),\n });\n};\nfunction deepPartialify(schema) {\n if (schema instanceof ZodObject) {\n const newShape = {};\n for (const key in schema.shape) {\n const fieldSchema = schema.shape[key];\n newShape[key] = ZodOptional.create(deepPartialify(fieldSchema));\n }\n return new ZodObject({\n ...schema._def,\n shape: () => newShape,\n });\n }\n else if (schema instanceof ZodArray) {\n return new ZodArray({\n ...schema._def,\n type: deepPartialify(schema.element),\n });\n }\n else if (schema instanceof ZodOptional) {\n return ZodOptional.create(deepPartialify(schema.unwrap()));\n }\n else if (schema instanceof ZodNullable) {\n return ZodNullable.create(deepPartialify(schema.unwrap()));\n }\n else if (schema instanceof ZodTuple) {\n return ZodTuple.create(schema.items.map((item) => deepPartialify(item)));\n }\n else {\n return schema;\n }\n}\nclass ZodObject extends ZodType {\n constructor() {\n super(...arguments);\n this._cached = null;\n /**\n * @deprecated In most cases, this is no longer needed - unknown properties are now silently stripped.\n * If you want to pass through unknown properties, use `.passthrough()` instead.\n */\n this.nonstrict = this.passthrough;\n // extend<\n // Augmentation extends ZodRawShape,\n // NewOutput extends util.flatten<{\n // [k in keyof Augmentation | keyof Output]: k extends keyof Augmentation\n // ? Augmentation[k][\"_output\"]\n // : k extends keyof Output\n // ? Output[k]\n // : never;\n // }>,\n // NewInput extends util.flatten<{\n // [k in keyof Augmentation | keyof Input]: k extends keyof Augmentation\n // ? Augmentation[k][\"_input\"]\n // : k extends keyof Input\n // ? Input[k]\n // : never;\n // }>\n // >(\n // augmentation: Augmentation\n // ): ZodObject<\n // extendShape,\n // UnknownKeys,\n // Catchall,\n // NewOutput,\n // NewInput\n // > {\n // return new ZodObject({\n // ...this._def,\n // shape: () => ({\n // ...this._def.shape(),\n // ...augmentation,\n // }),\n // }) as any;\n // }\n /**\n * @deprecated Use `.extend` instead\n * */\n this.augment = this.extend;\n }\n _getCached() {\n if (this._cached !== null)\n return this._cached;\n const shape = this._def.shape();\n const keys = util.objectKeys(shape);\n return (this._cached = { shape, keys });\n }\n _parse(input) {\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.object) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.object,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n const { status, ctx } = this._processInputParams(input);\n const { shape, keys: shapeKeys } = this._getCached();\n const extraKeys = [];\n if (!(this._def.catchall instanceof ZodNever &&\n this._def.unknownKeys === \"strip\")) {\n for (const key in ctx.data) {\n if (!shapeKeys.includes(key)) {\n extraKeys.push(key);\n }\n }\n }\n const pairs = [];\n for (const key of shapeKeys) {\n const keyValidator = shape[key];\n const value = ctx.data[key];\n pairs.push({\n key: { status: \"valid\", value: key },\n value: keyValidator._parse(new ParseInputLazyPath(ctx, value, ctx.path, key)),\n alwaysSet: key in ctx.data,\n });\n }\n if (this._def.catchall instanceof ZodNever) {\n const unknownKeys = this._def.unknownKeys;\n if (unknownKeys === \"passthrough\") {\n for (const key of extraKeys) {\n pairs.push({\n key: { status: \"valid\", value: key },\n value: { status: \"valid\", value: ctx.data[key] },\n });\n }\n }\n else if (unknownKeys === \"strict\") {\n if (extraKeys.length > 0) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.unrecognized_keys,\n keys: extraKeys,\n });\n status.dirty();\n }\n }\n else if (unknownKeys === \"strip\") ;\n else {\n throw new Error(`Internal ZodObject error: invalid unknownKeys value.`);\n }\n }\n else {\n // run catchall validation\n const catchall = this._def.catchall;\n for (const key of extraKeys) {\n const value = ctx.data[key];\n pairs.push({\n key: { status: \"valid\", value: key },\n value: catchall._parse(new ParseInputLazyPath(ctx, value, ctx.path, key) //, ctx.child(key), value, getParsedType(value)\n ),\n alwaysSet: key in ctx.data,\n });\n }\n }\n if (ctx.common.async) {\n return Promise.resolve()\n .then(async () => {\n const syncPairs = [];\n for (const pair of pairs) {\n const key = await pair.key;\n const value = await pair.value;\n syncPairs.push({\n key,\n value,\n alwaysSet: pair.alwaysSet,\n });\n }\n return syncPairs;\n })\n .then((syncPairs) => {\n return ParseStatus.mergeObjectSync(status, syncPairs);\n });\n }\n else {\n return ParseStatus.mergeObjectSync(status, pairs);\n }\n }\n get shape() {\n return this._def.shape();\n }\n strict(message) {\n errorUtil.errToObj;\n return new ZodObject({\n ...this._def,\n unknownKeys: \"strict\",\n ...(message !== undefined\n ? {\n errorMap: (issue, ctx) => {\n var _a, _b, _c, _d;\n const defaultError = (_c = (_b = (_a = this._def).errorMap) === null || _b === void 0 ? void 0 : _b.call(_a, issue, ctx).message) !== null && _c !== void 0 ? _c : ctx.defaultError;\n if (issue.code === \"unrecognized_keys\")\n return {\n message: (_d = errorUtil.errToObj(message).message) !== null && _d !== void 0 ? _d : defaultError,\n };\n return {\n message: defaultError,\n };\n },\n }\n : {}),\n });\n }\n strip() {\n return new ZodObject({\n ...this._def,\n unknownKeys: \"strip\",\n });\n }\n passthrough() {\n return new ZodObject({\n ...this._def,\n unknownKeys: \"passthrough\",\n });\n }\n // const AugmentFactory =\n // (def: Def) =>\n // (\n // augmentation: Augmentation\n // ): ZodObject<\n // extendShape, Augmentation>,\n // Def[\"unknownKeys\"],\n // Def[\"catchall\"]\n // > => {\n // return new ZodObject({\n // ...def,\n // shape: () => ({\n // ...def.shape(),\n // ...augmentation,\n // }),\n // }) as any;\n // };\n extend(augmentation) {\n return new ZodObject({\n ...this._def,\n shape: () => ({\n ...this._def.shape(),\n ...augmentation,\n }),\n });\n }\n /**\n * Prior to zod@1.0.12 there was a bug in the\n * inferred type of merged objects. Please\n * upgrade if you are experiencing issues.\n */\n merge(merging) {\n const merged = new ZodObject({\n unknownKeys: merging._def.unknownKeys,\n catchall: merging._def.catchall,\n shape: () => ({\n ...this._def.shape(),\n ...merging._def.shape(),\n }),\n typeName: ZodFirstPartyTypeKind.ZodObject,\n });\n return merged;\n }\n // merge<\n // Incoming extends AnyZodObject,\n // Augmentation extends Incoming[\"shape\"],\n // NewOutput extends {\n // [k in keyof Augmentation | keyof Output]: k extends keyof Augmentation\n // ? Augmentation[k][\"_output\"]\n // : k extends keyof Output\n // ? Output[k]\n // : never;\n // },\n // NewInput extends {\n // [k in keyof Augmentation | keyof Input]: k extends keyof Augmentation\n // ? Augmentation[k][\"_input\"]\n // : k extends keyof Input\n // ? Input[k]\n // : never;\n // }\n // >(\n // merging: Incoming\n // ): ZodObject<\n // extendShape>,\n // Incoming[\"_def\"][\"unknownKeys\"],\n // Incoming[\"_def\"][\"catchall\"],\n // NewOutput,\n // NewInput\n // > {\n // const merged: any = new ZodObject({\n // unknownKeys: merging._def.unknownKeys,\n // catchall: merging._def.catchall,\n // shape: () =>\n // objectUtil.mergeShapes(this._def.shape(), merging._def.shape()),\n // typeName: ZodFirstPartyTypeKind.ZodObject,\n // }) as any;\n // return merged;\n // }\n setKey(key, schema) {\n return this.augment({ [key]: schema });\n }\n // merge(\n // merging: Incoming\n // ): //ZodObject = (merging) => {\n // ZodObject<\n // extendShape>,\n // Incoming[\"_def\"][\"unknownKeys\"],\n // Incoming[\"_def\"][\"catchall\"]\n // > {\n // // const mergedShape = objectUtil.mergeShapes(\n // // this._def.shape(),\n // // merging._def.shape()\n // // );\n // const merged: any = new ZodObject({\n // unknownKeys: merging._def.unknownKeys,\n // catchall: merging._def.catchall,\n // shape: () =>\n // objectUtil.mergeShapes(this._def.shape(), merging._def.shape()),\n // typeName: ZodFirstPartyTypeKind.ZodObject,\n // }) as any;\n // return merged;\n // }\n catchall(index) {\n return new ZodObject({\n ...this._def,\n catchall: index,\n });\n }\n pick(mask) {\n const shape = {};\n util.objectKeys(mask).forEach((key) => {\n if (mask[key] && this.shape[key]) {\n shape[key] = this.shape[key];\n }\n });\n return new ZodObject({\n ...this._def,\n shape: () => shape,\n });\n }\n omit(mask) {\n const shape = {};\n util.objectKeys(this.shape).forEach((key) => {\n if (!mask[key]) {\n shape[key] = this.shape[key];\n }\n });\n return new ZodObject({\n ...this._def,\n shape: () => shape,\n });\n }\n /**\n * @deprecated\n */\n deepPartial() {\n return deepPartialify(this);\n }\n partial(mask) {\n const newShape = {};\n util.objectKeys(this.shape).forEach((key) => {\n const fieldSchema = this.shape[key];\n if (mask && !mask[key]) {\n newShape[key] = fieldSchema;\n }\n else {\n newShape[key] = fieldSchema.optional();\n }\n });\n return new ZodObject({\n ...this._def,\n shape: () => newShape,\n });\n }\n required(mask) {\n const newShape = {};\n util.objectKeys(this.shape).forEach((key) => {\n if (mask && !mask[key]) {\n newShape[key] = this.shape[key];\n }\n else {\n const fieldSchema = this.shape[key];\n let newField = fieldSchema;\n while (newField instanceof ZodOptional) {\n newField = newField._def.innerType;\n }\n newShape[key] = newField;\n }\n });\n return new ZodObject({\n ...this._def,\n shape: () => newShape,\n });\n }\n keyof() {\n return createZodEnum(util.objectKeys(this.shape));\n }\n}\nZodObject.create = (shape, params) => {\n return new ZodObject({\n shape: () => shape,\n unknownKeys: \"strip\",\n catchall: ZodNever.create(),\n typeName: ZodFirstPartyTypeKind.ZodObject,\n ...processCreateParams(params),\n });\n};\nZodObject.strictCreate = (shape, params) => {\n return new ZodObject({\n shape: () => shape,\n unknownKeys: \"strict\",\n catchall: ZodNever.create(),\n typeName: ZodFirstPartyTypeKind.ZodObject,\n ...processCreateParams(params),\n });\n};\nZodObject.lazycreate = (shape, params) => {\n return new ZodObject({\n shape,\n unknownKeys: \"strip\",\n catchall: ZodNever.create(),\n typeName: ZodFirstPartyTypeKind.ZodObject,\n ...processCreateParams(params),\n });\n};\nclass ZodUnion extends ZodType {\n _parse(input) {\n const { ctx } = this._processInputParams(input);\n const options = this._def.options;\n function handleResults(results) {\n // return first issue-free validation if it exists\n for (const result of results) {\n if (result.result.status === \"valid\") {\n return result.result;\n }\n }\n for (const result of results) {\n if (result.result.status === \"dirty\") {\n // add issues from dirty option\n ctx.common.issues.push(...result.ctx.common.issues);\n return result.result;\n }\n }\n // return invalid\n const unionErrors = results.map((result) => new ZodError(result.ctx.common.issues));\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_union,\n unionErrors,\n });\n return INVALID;\n }\n if (ctx.common.async) {\n return Promise.all(options.map(async (option) => {\n const childCtx = {\n ...ctx,\n common: {\n ...ctx.common,\n issues: [],\n },\n parent: null,\n };\n return {\n result: await option._parseAsync({\n data: ctx.data,\n path: ctx.path,\n parent: childCtx,\n }),\n ctx: childCtx,\n };\n })).then(handleResults);\n }\n else {\n let dirty = undefined;\n const issues = [];\n for (const option of options) {\n const childCtx = {\n ...ctx,\n common: {\n ...ctx.common,\n issues: [],\n },\n parent: null,\n };\n const result = option._parseSync({\n data: ctx.data,\n path: ctx.path,\n parent: childCtx,\n });\n if (result.status === \"valid\") {\n return result;\n }\n else if (result.status === \"dirty\" && !dirty) {\n dirty = { result, ctx: childCtx };\n }\n if (childCtx.common.issues.length) {\n issues.push(childCtx.common.issues);\n }\n }\n if (dirty) {\n ctx.common.issues.push(...dirty.ctx.common.issues);\n return dirty.result;\n }\n const unionErrors = issues.map((issues) => new ZodError(issues));\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_union,\n unionErrors,\n });\n return INVALID;\n }\n }\n get options() {\n return this._def.options;\n }\n}\nZodUnion.create = (types, params) => {\n return new ZodUnion({\n options: types,\n typeName: ZodFirstPartyTypeKind.ZodUnion,\n ...processCreateParams(params),\n });\n};\n/////////////////////////////////////////////////////\n/////////////////////////////////////////////////////\n////////// //////////\n////////// ZodDiscriminatedUnion //////////\n////////// //////////\n/////////////////////////////////////////////////////\n/////////////////////////////////////////////////////\nconst getDiscriminator = (type) => {\n if (type instanceof ZodLazy) {\n return getDiscriminator(type.schema);\n }\n else if (type instanceof ZodEffects) {\n return getDiscriminator(type.innerType());\n }\n else if (type instanceof ZodLiteral) {\n return [type.value];\n }\n else if (type instanceof ZodEnum) {\n return type.options;\n }\n else if (type instanceof ZodNativeEnum) {\n // eslint-disable-next-line ban/ban\n return util.objectValues(type.enum);\n }\n else if (type instanceof ZodDefault) {\n return getDiscriminator(type._def.innerType);\n }\n else if (type instanceof ZodUndefined) {\n return [undefined];\n }\n else if (type instanceof ZodNull) {\n return [null];\n }\n else if (type instanceof ZodOptional) {\n return [undefined, ...getDiscriminator(type.unwrap())];\n }\n else if (type instanceof ZodNullable) {\n return [null, ...getDiscriminator(type.unwrap())];\n }\n else if (type instanceof ZodBranded) {\n return getDiscriminator(type.unwrap());\n }\n else if (type instanceof ZodReadonly) {\n return getDiscriminator(type.unwrap());\n }\n else if (type instanceof ZodCatch) {\n return getDiscriminator(type._def.innerType);\n }\n else {\n return [];\n }\n};\nclass ZodDiscriminatedUnion extends ZodType {\n _parse(input) {\n const { ctx } = this._processInputParams(input);\n if (ctx.parsedType !== ZodParsedType.object) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.object,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n const discriminator = this.discriminator;\n const discriminatorValue = ctx.data[discriminator];\n const option = this.optionsMap.get(discriminatorValue);\n if (!option) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_union_discriminator,\n options: Array.from(this.optionsMap.keys()),\n path: [discriminator],\n });\n return INVALID;\n }\n if (ctx.common.async) {\n return option._parseAsync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n });\n }\n else {\n return option._parseSync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n });\n }\n }\n get discriminator() {\n return this._def.discriminator;\n }\n get options() {\n return this._def.options;\n }\n get optionsMap() {\n return this._def.optionsMap;\n }\n /**\n * The constructor of the discriminated union schema. Its behaviour is very similar to that of the normal z.union() constructor.\n * However, it only allows a union of objects, all of which need to share a discriminator property. This property must\n * have a different value for each object in the union.\n * @param discriminator the name of the discriminator property\n * @param types an array of object schemas\n * @param params\n */\n static create(discriminator, options, params) {\n // Get all the valid discriminator values\n const optionsMap = new Map();\n // try {\n for (const type of options) {\n const discriminatorValues = getDiscriminator(type.shape[discriminator]);\n if (!discriminatorValues.length) {\n throw new Error(`A discriminator value for key \\`${discriminator}\\` could not be extracted from all schema options`);\n }\n for (const value of discriminatorValues) {\n if (optionsMap.has(value)) {\n throw new Error(`Discriminator property ${String(discriminator)} has duplicate value ${String(value)}`);\n }\n optionsMap.set(value, type);\n }\n }\n return new ZodDiscriminatedUnion({\n typeName: ZodFirstPartyTypeKind.ZodDiscriminatedUnion,\n discriminator,\n options,\n optionsMap,\n ...processCreateParams(params),\n });\n }\n}\nfunction mergeValues(a, b) {\n const aType = getParsedType(a);\n const bType = getParsedType(b);\n if (a === b) {\n return { valid: true, data: a };\n }\n else if (aType === ZodParsedType.object && bType === ZodParsedType.object) {\n const bKeys = util.objectKeys(b);\n const sharedKeys = util\n .objectKeys(a)\n .filter((key) => bKeys.indexOf(key) !== -1);\n const newObj = { ...a, ...b };\n for (const key of sharedKeys) {\n const sharedValue = mergeValues(a[key], b[key]);\n if (!sharedValue.valid) {\n return { valid: false };\n }\n newObj[key] = sharedValue.data;\n }\n return { valid: true, data: newObj };\n }\n else if (aType === ZodParsedType.array && bType === ZodParsedType.array) {\n if (a.length !== b.length) {\n return { valid: false };\n }\n const newArray = [];\n for (let index = 0; index < a.length; index++) {\n const itemA = a[index];\n const itemB = b[index];\n const sharedValue = mergeValues(itemA, itemB);\n if (!sharedValue.valid) {\n return { valid: false };\n }\n newArray.push(sharedValue.data);\n }\n return { valid: true, data: newArray };\n }\n else if (aType === ZodParsedType.date &&\n bType === ZodParsedType.date &&\n +a === +b) {\n return { valid: true, data: a };\n }\n else {\n return { valid: false };\n }\n}\nclass ZodIntersection extends ZodType {\n _parse(input) {\n const { status, ctx } = this._processInputParams(input);\n const handleParsed = (parsedLeft, parsedRight) => {\n if (isAborted(parsedLeft) || isAborted(parsedRight)) {\n return INVALID;\n }\n const merged = mergeValues(parsedLeft.value, parsedRight.value);\n if (!merged.valid) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_intersection_types,\n });\n return INVALID;\n }\n if (isDirty(parsedLeft) || isDirty(parsedRight)) {\n status.dirty();\n }\n return { status: status.value, value: merged.data };\n };\n if (ctx.common.async) {\n return Promise.all([\n this._def.left._parseAsync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n }),\n this._def.right._parseAsync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n }),\n ]).then(([left, right]) => handleParsed(left, right));\n }\n else {\n return handleParsed(this._def.left._parseSync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n }), this._def.right._parseSync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n }));\n }\n }\n}\nZodIntersection.create = (left, right, params) => {\n return new ZodIntersection({\n left: left,\n right: right,\n typeName: ZodFirstPartyTypeKind.ZodIntersection,\n ...processCreateParams(params),\n });\n};\nclass ZodTuple extends ZodType {\n _parse(input) {\n const { status, ctx } = this._processInputParams(input);\n if (ctx.parsedType !== ZodParsedType.array) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.array,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n if (ctx.data.length < this._def.items.length) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_small,\n minimum: this._def.items.length,\n inclusive: true,\n exact: false,\n type: \"array\",\n });\n return INVALID;\n }\n const rest = this._def.rest;\n if (!rest && ctx.data.length > this._def.items.length) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_big,\n maximum: this._def.items.length,\n inclusive: true,\n exact: false,\n type: \"array\",\n });\n status.dirty();\n }\n const items = [...ctx.data]\n .map((item, itemIndex) => {\n const schema = this._def.items[itemIndex] || this._def.rest;\n if (!schema)\n return null;\n return schema._parse(new ParseInputLazyPath(ctx, item, ctx.path, itemIndex));\n })\n .filter((x) => !!x); // filter nulls\n if (ctx.common.async) {\n return Promise.all(items).then((results) => {\n return ParseStatus.mergeArray(status, results);\n });\n }\n else {\n return ParseStatus.mergeArray(status, items);\n }\n }\n get items() {\n return this._def.items;\n }\n rest(rest) {\n return new ZodTuple({\n ...this._def,\n rest,\n });\n }\n}\nZodTuple.create = (schemas, params) => {\n if (!Array.isArray(schemas)) {\n throw new Error(\"You must pass an array of schemas to z.tuple([ ... ])\");\n }\n return new ZodTuple({\n items: schemas,\n typeName: ZodFirstPartyTypeKind.ZodTuple,\n rest: null,\n ...processCreateParams(params),\n });\n};\nclass ZodRecord extends ZodType {\n get keySchema() {\n return this._def.keyType;\n }\n get valueSchema() {\n return this._def.valueType;\n }\n _parse(input) {\n const { status, ctx } = this._processInputParams(input);\n if (ctx.parsedType !== ZodParsedType.object) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.object,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n const pairs = [];\n const keyType = this._def.keyType;\n const valueType = this._def.valueType;\n for (const key in ctx.data) {\n pairs.push({\n key: keyType._parse(new ParseInputLazyPath(ctx, key, ctx.path, key)),\n value: valueType._parse(new ParseInputLazyPath(ctx, ctx.data[key], ctx.path, key)),\n alwaysSet: key in ctx.data,\n });\n }\n if (ctx.common.async) {\n return ParseStatus.mergeObjectAsync(status, pairs);\n }\n else {\n return ParseStatus.mergeObjectSync(status, pairs);\n }\n }\n get element() {\n return this._def.valueType;\n }\n static create(first, second, third) {\n if (second instanceof ZodType) {\n return new ZodRecord({\n keyType: first,\n valueType: second,\n typeName: ZodFirstPartyTypeKind.ZodRecord,\n ...processCreateParams(third),\n });\n }\n return new ZodRecord({\n keyType: ZodString.create(),\n valueType: first,\n typeName: ZodFirstPartyTypeKind.ZodRecord,\n ...processCreateParams(second),\n });\n }\n}\nclass ZodMap extends ZodType {\n get keySchema() {\n return this._def.keyType;\n }\n get valueSchema() {\n return this._def.valueType;\n }\n _parse(input) {\n const { status, ctx } = this._processInputParams(input);\n if (ctx.parsedType !== ZodParsedType.map) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.map,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n const keyType = this._def.keyType;\n const valueType = this._def.valueType;\n const pairs = [...ctx.data.entries()].map(([key, value], index) => {\n return {\n key: keyType._parse(new ParseInputLazyPath(ctx, key, ctx.path, [index, \"key\"])),\n value: valueType._parse(new ParseInputLazyPath(ctx, value, ctx.path, [index, \"value\"])),\n };\n });\n if (ctx.common.async) {\n const finalMap = new Map();\n return Promise.resolve().then(async () => {\n for (const pair of pairs) {\n const key = await pair.key;\n const value = await pair.value;\n if (key.status === \"aborted\" || value.status === \"aborted\") {\n return INVALID;\n }\n if (key.status === \"dirty\" || value.status === \"dirty\") {\n status.dirty();\n }\n finalMap.set(key.value, value.value);\n }\n return { status: status.value, value: finalMap };\n });\n }\n else {\n const finalMap = new Map();\n for (const pair of pairs) {\n const key = pair.key;\n const value = pair.value;\n if (key.status === \"aborted\" || value.status === \"aborted\") {\n return INVALID;\n }\n if (key.status === \"dirty\" || value.status === \"dirty\") {\n status.dirty();\n }\n finalMap.set(key.value, value.value);\n }\n return { status: status.value, value: finalMap };\n }\n }\n}\nZodMap.create = (keyType, valueType, params) => {\n return new ZodMap({\n valueType,\n keyType,\n typeName: ZodFirstPartyTypeKind.ZodMap,\n ...processCreateParams(params),\n });\n};\nclass ZodSet extends ZodType {\n _parse(input) {\n const { status, ctx } = this._processInputParams(input);\n if (ctx.parsedType !== ZodParsedType.set) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.set,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n const def = this._def;\n if (def.minSize !== null) {\n if (ctx.data.size < def.minSize.value) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_small,\n minimum: def.minSize.value,\n type: \"set\",\n inclusive: true,\n exact: false,\n message: def.minSize.message,\n });\n status.dirty();\n }\n }\n if (def.maxSize !== null) {\n if (ctx.data.size > def.maxSize.value) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.too_big,\n maximum: def.maxSize.value,\n type: \"set\",\n inclusive: true,\n exact: false,\n message: def.maxSize.message,\n });\n status.dirty();\n }\n }\n const valueType = this._def.valueType;\n function finalizeSet(elements) {\n const parsedSet = new Set();\n for (const element of elements) {\n if (element.status === \"aborted\")\n return INVALID;\n if (element.status === \"dirty\")\n status.dirty();\n parsedSet.add(element.value);\n }\n return { status: status.value, value: parsedSet };\n }\n const elements = [...ctx.data.values()].map((item, i) => valueType._parse(new ParseInputLazyPath(ctx, item, ctx.path, i)));\n if (ctx.common.async) {\n return Promise.all(elements).then((elements) => finalizeSet(elements));\n }\n else {\n return finalizeSet(elements);\n }\n }\n min(minSize, message) {\n return new ZodSet({\n ...this._def,\n minSize: { value: minSize, message: errorUtil.toString(message) },\n });\n }\n max(maxSize, message) {\n return new ZodSet({\n ...this._def,\n maxSize: { value: maxSize, message: errorUtil.toString(message) },\n });\n }\n size(size, message) {\n return this.min(size, message).max(size, message);\n }\n nonempty(message) {\n return this.min(1, message);\n }\n}\nZodSet.create = (valueType, params) => {\n return new ZodSet({\n valueType,\n minSize: null,\n maxSize: null,\n typeName: ZodFirstPartyTypeKind.ZodSet,\n ...processCreateParams(params),\n });\n};\nclass ZodFunction extends ZodType {\n constructor() {\n super(...arguments);\n this.validate = this.implement;\n }\n _parse(input) {\n const { ctx } = this._processInputParams(input);\n if (ctx.parsedType !== ZodParsedType.function) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.function,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n function makeArgsIssue(args, error) {\n return makeIssue({\n data: args,\n path: ctx.path,\n errorMaps: [\n ctx.common.contextualErrorMap,\n ctx.schemaErrorMap,\n getErrorMap(),\n errorMap,\n ].filter((x) => !!x),\n issueData: {\n code: ZodIssueCode.invalid_arguments,\n argumentsError: error,\n },\n });\n }\n function makeReturnsIssue(returns, error) {\n return makeIssue({\n data: returns,\n path: ctx.path,\n errorMaps: [\n ctx.common.contextualErrorMap,\n ctx.schemaErrorMap,\n getErrorMap(),\n errorMap,\n ].filter((x) => !!x),\n issueData: {\n code: ZodIssueCode.invalid_return_type,\n returnTypeError: error,\n },\n });\n }\n const params = { errorMap: ctx.common.contextualErrorMap };\n const fn = ctx.data;\n if (this._def.returns instanceof ZodPromise) {\n // Would love a way to avoid disabling this rule, but we need\n // an alias (using an arrow function was what caused 2651).\n // eslint-disable-next-line @typescript-eslint/no-this-alias\n const me = this;\n return OK(async function (...args) {\n const error = new ZodError([]);\n const parsedArgs = await me._def.args\n .parseAsync(args, params)\n .catch((e) => {\n error.addIssue(makeArgsIssue(args, e));\n throw error;\n });\n const result = await Reflect.apply(fn, this, parsedArgs);\n const parsedReturns = await me._def.returns._def.type\n .parseAsync(result, params)\n .catch((e) => {\n error.addIssue(makeReturnsIssue(result, e));\n throw error;\n });\n return parsedReturns;\n });\n }\n else {\n // Would love a way to avoid disabling this rule, but we need\n // an alias (using an arrow function was what caused 2651).\n // eslint-disable-next-line @typescript-eslint/no-this-alias\n const me = this;\n return OK(function (...args) {\n const parsedArgs = me._def.args.safeParse(args, params);\n if (!parsedArgs.success) {\n throw new ZodError([makeArgsIssue(args, parsedArgs.error)]);\n }\n const result = Reflect.apply(fn, this, parsedArgs.data);\n const parsedReturns = me._def.returns.safeParse(result, params);\n if (!parsedReturns.success) {\n throw new ZodError([makeReturnsIssue(result, parsedReturns.error)]);\n }\n return parsedReturns.data;\n });\n }\n }\n parameters() {\n return this._def.args;\n }\n returnType() {\n return this._def.returns;\n }\n args(...items) {\n return new ZodFunction({\n ...this._def,\n args: ZodTuple.create(items).rest(ZodUnknown.create()),\n });\n }\n returns(returnType) {\n return new ZodFunction({\n ...this._def,\n returns: returnType,\n });\n }\n implement(func) {\n const validatedFunc = this.parse(func);\n return validatedFunc;\n }\n strictImplement(func) {\n const validatedFunc = this.parse(func);\n return validatedFunc;\n }\n static create(args, returns, params) {\n return new ZodFunction({\n args: (args\n ? args\n : ZodTuple.create([]).rest(ZodUnknown.create())),\n returns: returns || ZodUnknown.create(),\n typeName: ZodFirstPartyTypeKind.ZodFunction,\n ...processCreateParams(params),\n });\n }\n}\nclass ZodLazy extends ZodType {\n get schema() {\n return this._def.getter();\n }\n _parse(input) {\n const { ctx } = this._processInputParams(input);\n const lazySchema = this._def.getter();\n return lazySchema._parse({ data: ctx.data, path: ctx.path, parent: ctx });\n }\n}\nZodLazy.create = (getter, params) => {\n return new ZodLazy({\n getter: getter,\n typeName: ZodFirstPartyTypeKind.ZodLazy,\n ...processCreateParams(params),\n });\n};\nclass ZodLiteral extends ZodType {\n _parse(input) {\n if (input.data !== this._def.value) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n received: ctx.data,\n code: ZodIssueCode.invalid_literal,\n expected: this._def.value,\n });\n return INVALID;\n }\n return { status: \"valid\", value: input.data };\n }\n get value() {\n return this._def.value;\n }\n}\nZodLiteral.create = (value, params) => {\n return new ZodLiteral({\n value: value,\n typeName: ZodFirstPartyTypeKind.ZodLiteral,\n ...processCreateParams(params),\n });\n};\nfunction createZodEnum(values, params) {\n return new ZodEnum({\n values,\n typeName: ZodFirstPartyTypeKind.ZodEnum,\n ...processCreateParams(params),\n });\n}\nclass ZodEnum extends ZodType {\n constructor() {\n super(...arguments);\n _ZodEnum_cache.set(this, void 0);\n }\n _parse(input) {\n if (typeof input.data !== \"string\") {\n const ctx = this._getOrReturnCtx(input);\n const expectedValues = this._def.values;\n addIssueToContext(ctx, {\n expected: util.joinValues(expectedValues),\n received: ctx.parsedType,\n code: ZodIssueCode.invalid_type,\n });\n return INVALID;\n }\n if (!__classPrivateFieldGet(this, _ZodEnum_cache, \"f\")) {\n __classPrivateFieldSet(this, _ZodEnum_cache, new Set(this._def.values), \"f\");\n }\n if (!__classPrivateFieldGet(this, _ZodEnum_cache, \"f\").has(input.data)) {\n const ctx = this._getOrReturnCtx(input);\n const expectedValues = this._def.values;\n addIssueToContext(ctx, {\n received: ctx.data,\n code: ZodIssueCode.invalid_enum_value,\n options: expectedValues,\n });\n return INVALID;\n }\n return OK(input.data);\n }\n get options() {\n return this._def.values;\n }\n get enum() {\n const enumValues = {};\n for (const val of this._def.values) {\n enumValues[val] = val;\n }\n return enumValues;\n }\n get Values() {\n const enumValues = {};\n for (const val of this._def.values) {\n enumValues[val] = val;\n }\n return enumValues;\n }\n get Enum() {\n const enumValues = {};\n for (const val of this._def.values) {\n enumValues[val] = val;\n }\n return enumValues;\n }\n extract(values, newDef = this._def) {\n return ZodEnum.create(values, {\n ...this._def,\n ...newDef,\n });\n }\n exclude(values, newDef = this._def) {\n return ZodEnum.create(this.options.filter((opt) => !values.includes(opt)), {\n ...this._def,\n ...newDef,\n });\n }\n}\n_ZodEnum_cache = new WeakMap();\nZodEnum.create = createZodEnum;\nclass ZodNativeEnum extends ZodType {\n constructor() {\n super(...arguments);\n _ZodNativeEnum_cache.set(this, void 0);\n }\n _parse(input) {\n const nativeEnumValues = util.getValidEnumValues(this._def.values);\n const ctx = this._getOrReturnCtx(input);\n if (ctx.parsedType !== ZodParsedType.string &&\n ctx.parsedType !== ZodParsedType.number) {\n const expectedValues = util.objectValues(nativeEnumValues);\n addIssueToContext(ctx, {\n expected: util.joinValues(expectedValues),\n received: ctx.parsedType,\n code: ZodIssueCode.invalid_type,\n });\n return INVALID;\n }\n if (!__classPrivateFieldGet(this, _ZodNativeEnum_cache, \"f\")) {\n __classPrivateFieldSet(this, _ZodNativeEnum_cache, new Set(util.getValidEnumValues(this._def.values)), \"f\");\n }\n if (!__classPrivateFieldGet(this, _ZodNativeEnum_cache, \"f\").has(input.data)) {\n const expectedValues = util.objectValues(nativeEnumValues);\n addIssueToContext(ctx, {\n received: ctx.data,\n code: ZodIssueCode.invalid_enum_value,\n options: expectedValues,\n });\n return INVALID;\n }\n return OK(input.data);\n }\n get enum() {\n return this._def.values;\n }\n}\n_ZodNativeEnum_cache = new WeakMap();\nZodNativeEnum.create = (values, params) => {\n return new ZodNativeEnum({\n values: values,\n typeName: ZodFirstPartyTypeKind.ZodNativeEnum,\n ...processCreateParams(params),\n });\n};\nclass ZodPromise extends ZodType {\n unwrap() {\n return this._def.type;\n }\n _parse(input) {\n const { ctx } = this._processInputParams(input);\n if (ctx.parsedType !== ZodParsedType.promise &&\n ctx.common.async === false) {\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.promise,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n const promisified = ctx.parsedType === ZodParsedType.promise\n ? ctx.data\n : Promise.resolve(ctx.data);\n return OK(promisified.then((data) => {\n return this._def.type.parseAsync(data, {\n path: ctx.path,\n errorMap: ctx.common.contextualErrorMap,\n });\n }));\n }\n}\nZodPromise.create = (schema, params) => {\n return new ZodPromise({\n type: schema,\n typeName: ZodFirstPartyTypeKind.ZodPromise,\n ...processCreateParams(params),\n });\n};\nclass ZodEffects extends ZodType {\n innerType() {\n return this._def.schema;\n }\n sourceType() {\n return this._def.schema._def.typeName === ZodFirstPartyTypeKind.ZodEffects\n ? this._def.schema.sourceType()\n : this._def.schema;\n }\n _parse(input) {\n const { status, ctx } = this._processInputParams(input);\n const effect = this._def.effect || null;\n const checkCtx = {\n addIssue: (arg) => {\n addIssueToContext(ctx, arg);\n if (arg.fatal) {\n status.abort();\n }\n else {\n status.dirty();\n }\n },\n get path() {\n return ctx.path;\n },\n };\n checkCtx.addIssue = checkCtx.addIssue.bind(checkCtx);\n if (effect.type === \"preprocess\") {\n const processed = effect.transform(ctx.data, checkCtx);\n if (ctx.common.async) {\n return Promise.resolve(processed).then(async (processed) => {\n if (status.value === \"aborted\")\n return INVALID;\n const result = await this._def.schema._parseAsync({\n data: processed,\n path: ctx.path,\n parent: ctx,\n });\n if (result.status === \"aborted\")\n return INVALID;\n if (result.status === \"dirty\")\n return DIRTY(result.value);\n if (status.value === \"dirty\")\n return DIRTY(result.value);\n return result;\n });\n }\n else {\n if (status.value === \"aborted\")\n return INVALID;\n const result = this._def.schema._parseSync({\n data: processed,\n path: ctx.path,\n parent: ctx,\n });\n if (result.status === \"aborted\")\n return INVALID;\n if (result.status === \"dirty\")\n return DIRTY(result.value);\n if (status.value === \"dirty\")\n return DIRTY(result.value);\n return result;\n }\n }\n if (effect.type === \"refinement\") {\n const executeRefinement = (acc) => {\n const result = effect.refinement(acc, checkCtx);\n if (ctx.common.async) {\n return Promise.resolve(result);\n }\n if (result instanceof Promise) {\n throw new Error(\"Async refinement encountered during synchronous parse operation. Use .parseAsync instead.\");\n }\n return acc;\n };\n if (ctx.common.async === false) {\n const inner = this._def.schema._parseSync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n });\n if (inner.status === \"aborted\")\n return INVALID;\n if (inner.status === \"dirty\")\n status.dirty();\n // return value is ignored\n executeRefinement(inner.value);\n return { status: status.value, value: inner.value };\n }\n else {\n return this._def.schema\n ._parseAsync({ data: ctx.data, path: ctx.path, parent: ctx })\n .then((inner) => {\n if (inner.status === \"aborted\")\n return INVALID;\n if (inner.status === \"dirty\")\n status.dirty();\n return executeRefinement(inner.value).then(() => {\n return { status: status.value, value: inner.value };\n });\n });\n }\n }\n if (effect.type === \"transform\") {\n if (ctx.common.async === false) {\n const base = this._def.schema._parseSync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n });\n if (!isValid(base))\n return base;\n const result = effect.transform(base.value, checkCtx);\n if (result instanceof Promise) {\n throw new Error(`Asynchronous transform encountered during synchronous parse operation. Use .parseAsync instead.`);\n }\n return { status: status.value, value: result };\n }\n else {\n return this._def.schema\n ._parseAsync({ data: ctx.data, path: ctx.path, parent: ctx })\n .then((base) => {\n if (!isValid(base))\n return base;\n return Promise.resolve(effect.transform(base.value, checkCtx)).then((result) => ({ status: status.value, value: result }));\n });\n }\n }\n util.assertNever(effect);\n }\n}\nZodEffects.create = (schema, effect, params) => {\n return new ZodEffects({\n schema,\n typeName: ZodFirstPartyTypeKind.ZodEffects,\n effect,\n ...processCreateParams(params),\n });\n};\nZodEffects.createWithPreprocess = (preprocess, schema, params) => {\n return new ZodEffects({\n schema,\n effect: { type: \"preprocess\", transform: preprocess },\n typeName: ZodFirstPartyTypeKind.ZodEffects,\n ...processCreateParams(params),\n });\n};\nclass ZodOptional extends ZodType {\n _parse(input) {\n const parsedType = this._getType(input);\n if (parsedType === ZodParsedType.undefined) {\n return OK(undefined);\n }\n return this._def.innerType._parse(input);\n }\n unwrap() {\n return this._def.innerType;\n }\n}\nZodOptional.create = (type, params) => {\n return new ZodOptional({\n innerType: type,\n typeName: ZodFirstPartyTypeKind.ZodOptional,\n ...processCreateParams(params),\n });\n};\nclass ZodNullable extends ZodType {\n _parse(input) {\n const parsedType = this._getType(input);\n if (parsedType === ZodParsedType.null) {\n return OK(null);\n }\n return this._def.innerType._parse(input);\n }\n unwrap() {\n return this._def.innerType;\n }\n}\nZodNullable.create = (type, params) => {\n return new ZodNullable({\n innerType: type,\n typeName: ZodFirstPartyTypeKind.ZodNullable,\n ...processCreateParams(params),\n });\n};\nclass ZodDefault extends ZodType {\n _parse(input) {\n const { ctx } = this._processInputParams(input);\n let data = ctx.data;\n if (ctx.parsedType === ZodParsedType.undefined) {\n data = this._def.defaultValue();\n }\n return this._def.innerType._parse({\n data,\n path: ctx.path,\n parent: ctx,\n });\n }\n removeDefault() {\n return this._def.innerType;\n }\n}\nZodDefault.create = (type, params) => {\n return new ZodDefault({\n innerType: type,\n typeName: ZodFirstPartyTypeKind.ZodDefault,\n defaultValue: typeof params.default === \"function\"\n ? params.default\n : () => params.default,\n ...processCreateParams(params),\n });\n};\nclass ZodCatch extends ZodType {\n _parse(input) {\n const { ctx } = this._processInputParams(input);\n // newCtx is used to not collect issues from inner types in ctx\n const newCtx = {\n ...ctx,\n common: {\n ...ctx.common,\n issues: [],\n },\n };\n const result = this._def.innerType._parse({\n data: newCtx.data,\n path: newCtx.path,\n parent: {\n ...newCtx,\n },\n });\n if (isAsync(result)) {\n return result.then((result) => {\n return {\n status: \"valid\",\n value: result.status === \"valid\"\n ? result.value\n : this._def.catchValue({\n get error() {\n return new ZodError(newCtx.common.issues);\n },\n input: newCtx.data,\n }),\n };\n });\n }\n else {\n return {\n status: \"valid\",\n value: result.status === \"valid\"\n ? result.value\n : this._def.catchValue({\n get error() {\n return new ZodError(newCtx.common.issues);\n },\n input: newCtx.data,\n }),\n };\n }\n }\n removeCatch() {\n return this._def.innerType;\n }\n}\nZodCatch.create = (type, params) => {\n return new ZodCatch({\n innerType: type,\n typeName: ZodFirstPartyTypeKind.ZodCatch,\n catchValue: typeof params.catch === \"function\" ? params.catch : () => params.catch,\n ...processCreateParams(params),\n });\n};\nclass ZodNaN extends ZodType {\n _parse(input) {\n const parsedType = this._getType(input);\n if (parsedType !== ZodParsedType.nan) {\n const ctx = this._getOrReturnCtx(input);\n addIssueToContext(ctx, {\n code: ZodIssueCode.invalid_type,\n expected: ZodParsedType.nan,\n received: ctx.parsedType,\n });\n return INVALID;\n }\n return { status: \"valid\", value: input.data };\n }\n}\nZodNaN.create = (params) => {\n return new ZodNaN({\n typeName: ZodFirstPartyTypeKind.ZodNaN,\n ...processCreateParams(params),\n });\n};\nconst BRAND = Symbol(\"zod_brand\");\nclass ZodBranded extends ZodType {\n _parse(input) {\n const { ctx } = this._processInputParams(input);\n const data = ctx.data;\n return this._def.type._parse({\n data,\n path: ctx.path,\n parent: ctx,\n });\n }\n unwrap() {\n return this._def.type;\n }\n}\nclass ZodPipeline extends ZodType {\n _parse(input) {\n const { status, ctx } = this._processInputParams(input);\n if (ctx.common.async) {\n const handleAsync = async () => {\n const inResult = await this._def.in._parseAsync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n });\n if (inResult.status === \"aborted\")\n return INVALID;\n if (inResult.status === \"dirty\") {\n status.dirty();\n return DIRTY(inResult.value);\n }\n else {\n return this._def.out._parseAsync({\n data: inResult.value,\n path: ctx.path,\n parent: ctx,\n });\n }\n };\n return handleAsync();\n }\n else {\n const inResult = this._def.in._parseSync({\n data: ctx.data,\n path: ctx.path,\n parent: ctx,\n });\n if (inResult.status === \"aborted\")\n return INVALID;\n if (inResult.status === \"dirty\") {\n status.dirty();\n return {\n status: \"dirty\",\n value: inResult.value,\n };\n }\n else {\n return this._def.out._parseSync({\n data: inResult.value,\n path: ctx.path,\n parent: ctx,\n });\n }\n }\n }\n static create(a, b) {\n return new ZodPipeline({\n in: a,\n out: b,\n typeName: ZodFirstPartyTypeKind.ZodPipeline,\n });\n }\n}\nclass ZodReadonly extends ZodType {\n _parse(input) {\n const result = this._def.innerType._parse(input);\n const freeze = (data) => {\n if (isValid(data)) {\n data.value = Object.freeze(data.value);\n }\n return data;\n };\n return isAsync(result)\n ? result.then((data) => freeze(data))\n : freeze(result);\n }\n unwrap() {\n return this._def.innerType;\n }\n}\nZodReadonly.create = (type, params) => {\n return new ZodReadonly({\n innerType: type,\n typeName: ZodFirstPartyTypeKind.ZodReadonly,\n ...processCreateParams(params),\n });\n};\nfunction custom(check, params = {}, \n/**\n * @deprecated\n *\n * Pass `fatal` into the params object instead:\n *\n * ```ts\n * z.string().custom((val) => val.length > 5, { fatal: false })\n * ```\n *\n */\nfatal) {\n if (check)\n return ZodAny.create().superRefine((data, ctx) => {\n var _a, _b;\n if (!check(data)) {\n const p = typeof params === \"function\"\n ? params(data)\n : typeof params === \"string\"\n ? { message: params }\n : params;\n const _fatal = (_b = (_a = p.fatal) !== null && _a !== void 0 ? _a : fatal) !== null && _b !== void 0 ? _b : true;\n const p2 = typeof p === \"string\" ? { message: p } : p;\n ctx.addIssue({ code: \"custom\", ...p2, fatal: _fatal });\n }\n });\n return ZodAny.create();\n}\nconst late = {\n object: ZodObject.lazycreate,\n};\nvar ZodFirstPartyTypeKind;\n(function (ZodFirstPartyTypeKind) {\n ZodFirstPartyTypeKind[\"ZodString\"] = \"ZodString\";\n ZodFirstPartyTypeKind[\"ZodNumber\"] = \"ZodNumber\";\n ZodFirstPartyTypeKind[\"ZodNaN\"] = \"ZodNaN\";\n ZodFirstPartyTypeKind[\"ZodBigInt\"] = \"ZodBigInt\";\n ZodFirstPartyTypeKind[\"ZodBoolean\"] = \"ZodBoolean\";\n ZodFirstPartyTypeKind[\"ZodDate\"] = \"ZodDate\";\n ZodFirstPartyTypeKind[\"ZodSymbol\"] = \"ZodSymbol\";\n ZodFirstPartyTypeKind[\"ZodUndefined\"] = \"ZodUndefined\";\n ZodFirstPartyTypeKind[\"ZodNull\"] = \"ZodNull\";\n ZodFirstPartyTypeKind[\"ZodAny\"] = \"ZodAny\";\n ZodFirstPartyTypeKind[\"ZodUnknown\"] = \"ZodUnknown\";\n ZodFirstPartyTypeKind[\"ZodNever\"] = \"ZodNever\";\n ZodFirstPartyTypeKind[\"ZodVoid\"] = \"ZodVoid\";\n ZodFirstPartyTypeKind[\"ZodArray\"] = \"ZodArray\";\n ZodFirstPartyTypeKind[\"ZodObject\"] = \"ZodObject\";\n ZodFirstPartyTypeKind[\"ZodUnion\"] = \"ZodUnion\";\n ZodFirstPartyTypeKind[\"ZodDiscriminatedUnion\"] = \"ZodDiscriminatedUnion\";\n ZodFirstPartyTypeKind[\"ZodIntersection\"] = \"ZodIntersection\";\n ZodFirstPartyTypeKind[\"ZodTuple\"] = \"ZodTuple\";\n ZodFirstPartyTypeKind[\"ZodRecord\"] = \"ZodRecord\";\n ZodFirstPartyTypeKind[\"ZodMap\"] = \"ZodMap\";\n ZodFirstPartyTypeKind[\"ZodSet\"] = \"ZodSet\";\n ZodFirstPartyTypeKind[\"ZodFunction\"] = \"ZodFunction\";\n ZodFirstPartyTypeKind[\"ZodLazy\"] = \"ZodLazy\";\n ZodFirstPartyTypeKind[\"ZodLiteral\"] = \"ZodLiteral\";\n ZodFirstPartyTypeKind[\"ZodEnum\"] = \"ZodEnum\";\n ZodFirstPartyTypeKind[\"ZodEffects\"] = \"ZodEffects\";\n ZodFirstPartyTypeKind[\"ZodNativeEnum\"] = \"ZodNativeEnum\";\n ZodFirstPartyTypeKind[\"ZodOptional\"] = \"ZodOptional\";\n ZodFirstPartyTypeKind[\"ZodNullable\"] = \"ZodNullable\";\n ZodFirstPartyTypeKind[\"ZodDefault\"] = \"ZodDefault\";\n ZodFirstPartyTypeKind[\"ZodCatch\"] = \"ZodCatch\";\n ZodFirstPartyTypeKind[\"ZodPromise\"] = \"ZodPromise\";\n ZodFirstPartyTypeKind[\"ZodBranded\"] = \"ZodBranded\";\n ZodFirstPartyTypeKind[\"ZodPipeline\"] = \"ZodPipeline\";\n ZodFirstPartyTypeKind[\"ZodReadonly\"] = \"ZodReadonly\";\n})(ZodFirstPartyTypeKind || (ZodFirstPartyTypeKind = {}));\nconst instanceOfType = (\n// const instanceOfType = any>(\ncls, params = {\n message: `Input not instance of ${cls.name}`,\n}) => custom((data) => data instanceof cls, params);\nconst stringType = ZodString.create;\nconst numberType = ZodNumber.create;\nconst nanType = ZodNaN.create;\nconst bigIntType = ZodBigInt.create;\nconst booleanType = ZodBoolean.create;\nconst dateType = ZodDate.create;\nconst symbolType = ZodSymbol.create;\nconst undefinedType = ZodUndefined.create;\nconst nullType = ZodNull.create;\nconst anyType = ZodAny.create;\nconst unknownType = ZodUnknown.create;\nconst neverType = ZodNever.create;\nconst voidType = ZodVoid.create;\nconst arrayType = ZodArray.create;\nconst objectType = ZodObject.create;\nconst strictObjectType = ZodObject.strictCreate;\nconst unionType = ZodUnion.create;\nconst discriminatedUnionType = ZodDiscriminatedUnion.create;\nconst intersectionType = ZodIntersection.create;\nconst tupleType = ZodTuple.create;\nconst recordType = ZodRecord.create;\nconst mapType = ZodMap.create;\nconst setType = ZodSet.create;\nconst functionType = ZodFunction.create;\nconst lazyType = ZodLazy.create;\nconst literalType = ZodLiteral.create;\nconst enumType = ZodEnum.create;\nconst nativeEnumType = ZodNativeEnum.create;\nconst promiseType = ZodPromise.create;\nconst effectsType = ZodEffects.create;\nconst optionalType = ZodOptional.create;\nconst nullableType = ZodNullable.create;\nconst preprocessType = ZodEffects.createWithPreprocess;\nconst pipelineType = ZodPipeline.create;\nconst ostring = () => stringType().optional();\nconst onumber = () => numberType().optional();\nconst oboolean = () => booleanType().optional();\nconst coerce = {\n string: ((arg) => ZodString.create({ ...arg, coerce: true })),\n number: ((arg) => ZodNumber.create({ ...arg, coerce: true })),\n boolean: ((arg) => ZodBoolean.create({\n ...arg,\n coerce: true,\n })),\n bigint: ((arg) => ZodBigInt.create({ ...arg, coerce: true })),\n date: ((arg) => ZodDate.create({ ...arg, coerce: true })),\n};\nconst NEVER = INVALID;\n\nvar z = /*#__PURE__*/Object.freeze({\n __proto__: null,\n defaultErrorMap: errorMap,\n setErrorMap: setErrorMap,\n getErrorMap: getErrorMap,\n makeIssue: makeIssue,\n EMPTY_PATH: EMPTY_PATH,\n addIssueToContext: addIssueToContext,\n ParseStatus: ParseStatus,\n INVALID: INVALID,\n DIRTY: DIRTY,\n OK: OK,\n isAborted: isAborted,\n isDirty: isDirty,\n isValid: isValid,\n isAsync: isAsync,\n get util () { return util; },\n get objectUtil () { return objectUtil; },\n ZodParsedType: ZodParsedType,\n getParsedType: getParsedType,\n ZodType: ZodType,\n datetimeRegex: datetimeRegex,\n ZodString: ZodString,\n ZodNumber: ZodNumber,\n ZodBigInt: ZodBigInt,\n ZodBoolean: ZodBoolean,\n ZodDate: ZodDate,\n ZodSymbol: ZodSymbol,\n ZodUndefined: ZodUndefined,\n ZodNull: ZodNull,\n ZodAny: ZodAny,\n ZodUnknown: ZodUnknown,\n ZodNever: ZodNever,\n ZodVoid: ZodVoid,\n ZodArray: ZodArray,\n ZodObject: ZodObject,\n ZodUnion: ZodUnion,\n ZodDiscriminatedUnion: ZodDiscriminatedUnion,\n ZodIntersection: ZodIntersection,\n ZodTuple: ZodTuple,\n ZodRecord: ZodRecord,\n ZodMap: ZodMap,\n ZodSet: ZodSet,\n ZodFunction: ZodFunction,\n ZodLazy: ZodLazy,\n ZodLiteral: ZodLiteral,\n ZodEnum: ZodEnum,\n ZodNativeEnum: ZodNativeEnum,\n ZodPromise: ZodPromise,\n ZodEffects: ZodEffects,\n ZodTransformer: ZodEffects,\n ZodOptional: ZodOptional,\n ZodNullable: ZodNullable,\n ZodDefault: ZodDefault,\n ZodCatch: ZodCatch,\n ZodNaN: ZodNaN,\n BRAND: BRAND,\n ZodBranded: ZodBranded,\n ZodPipeline: ZodPipeline,\n ZodReadonly: ZodReadonly,\n custom: custom,\n Schema: ZodType,\n ZodSchema: ZodType,\n late: late,\n get ZodFirstPartyTypeKind () { return ZodFirstPartyTypeKind; },\n coerce: coerce,\n any: anyType,\n array: arrayType,\n bigint: bigIntType,\n boolean: booleanType,\n date: dateType,\n discriminatedUnion: discriminatedUnionType,\n effect: effectsType,\n 'enum': enumType,\n 'function': functionType,\n 'instanceof': instanceOfType,\n intersection: intersectionType,\n lazy: lazyType,\n literal: literalType,\n map: mapType,\n nan: nanType,\n nativeEnum: nativeEnumType,\n never: neverType,\n 'null': nullType,\n nullable: nullableType,\n number: numberType,\n object: objectType,\n oboolean: oboolean,\n onumber: onumber,\n optional: optionalType,\n ostring: ostring,\n pipeline: pipelineType,\n preprocess: preprocessType,\n promise: promiseType,\n record: recordType,\n set: setType,\n strictObject: strictObjectType,\n string: stringType,\n symbol: symbolType,\n transformer: effectsType,\n tuple: tupleType,\n 'undefined': undefinedType,\n union: unionType,\n unknown: unknownType,\n 'void': voidType,\n NEVER: NEVER,\n ZodIssueCode: ZodIssueCode,\n quotelessJson: quotelessJson,\n ZodError: ZodError\n});\n\nexport { BRAND, DIRTY, EMPTY_PATH, INVALID, NEVER, OK, ParseStatus, ZodType as Schema, ZodAny, ZodArray, ZodBigInt, ZodBoolean, ZodBranded, ZodCatch, ZodDate, ZodDefault, ZodDiscriminatedUnion, ZodEffects, ZodEnum, ZodError, ZodFirstPartyTypeKind, ZodFunction, ZodIntersection, ZodIssueCode, ZodLazy, ZodLiteral, ZodMap, ZodNaN, ZodNativeEnum, ZodNever, ZodNull, ZodNullable, ZodNumber, ZodObject, ZodOptional, ZodParsedType, ZodPipeline, ZodPromise, ZodReadonly, ZodRecord, ZodType as ZodSchema, ZodSet, ZodString, ZodSymbol, ZodEffects as ZodTransformer, ZodTuple, ZodType, ZodUndefined, ZodUnion, ZodUnknown, ZodVoid, addIssueToContext, anyType as any, arrayType as array, bigIntType as bigint, booleanType as boolean, coerce, custom, dateType as date, datetimeRegex, z as default, errorMap as defaultErrorMap, discriminatedUnionType as discriminatedUnion, effectsType as effect, enumType as enum, functionType as function, getErrorMap, getParsedType, instanceOfType as instanceof, intersectionType as intersection, isAborted, isAsync, isDirty, isValid, late, lazyType as lazy, literalType as literal, makeIssue, mapType as map, nanType as nan, nativeEnumType as nativeEnum, neverType as never, nullType as null, nullableType as nullable, numberType as number, objectType as object, objectUtil, oboolean, onumber, optionalType as optional, ostring, pipelineType as pipeline, preprocessType as preprocess, promiseType as promise, quotelessJson, recordType as record, setType as set, setErrorMap, strictObjectType as strictObject, stringType as string, symbolType as symbol, effectsType as transformer, tupleType as tuple, undefinedType as undefined, unionType as union, unknownType as unknown, util, voidType as void, z };\n","import { z } from \"zod\";\n/**\n * A suite of [zod](https://github.com/colinhacks/zod) schemas for Nostr.\n *\n * ```ts\n * import { NSchema as n } from '@nostrify/nostrify';\n *\n * const event: NostrEvent = n.event().parse(eventData);\n * const metadata: NostrMetadata = n.json().pipe(n.metadata()).parse(event.content);\n * const msg: NostrRelayMsg = n.relayMsg().parse(e.data);\n * const nsec: `nsec1${string}` = n.bech32('nsec').parse(token);\n * ```\n */ class NSchema {\n /** Schema to validate Nostr hex IDs such as event IDs and pubkeys. */ static id() {\n return z.string().regex(/^[0-9a-f]{64}$/);\n }\n /** Nostr event schema. */ static event() {\n return z.object({\n id: NSchema.id(),\n kind: z.number().int().nonnegative(),\n pubkey: NSchema.id(),\n tags: z.string().array().array(),\n content: z.string(),\n created_at: z.number().int().nonnegative(),\n sig: z.string()\n });\n }\n /** Nostr filter schema. */ static filter() {\n return z.object({\n kinds: z.number().int().nonnegative().array().optional(),\n ids: NSchema.id().array().optional(),\n authors: NSchema.id().array().optional(),\n since: z.number().int().nonnegative().optional(),\n until: z.number().int().nonnegative().optional(),\n limit: z.number().int().nonnegative().optional(),\n search: z.string().optional()\n }).passthrough().transform((value)=>{\n const keys = [\n 'kinds',\n 'ids',\n 'authors',\n 'since',\n 'until',\n 'limit',\n 'search'\n ];\n return Object.entries(value).reduce((acc, [key, val])=>{\n if (keys.includes(key) || key.startsWith('#')) {\n acc[key] = val;\n }\n return acc;\n }, {});\n });\n }\n /**\n * Bech32 string.\n * @see https://github.com/bitcoin/bips/blob/master/bip-0173.mediawiki#bech32\n */ static bech32(prefix) {\n return z.string().regex(/^[\\x21-\\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}$/).refine((value)=>prefix ? value.startsWith(`${prefix}1`) : true);\n }\n /** NIP-01 `EVENT` message from client to relay. */ static clientEVENT() {\n return z.tuple([\n z.literal('EVENT'),\n NSchema.event()\n ]);\n }\n /** NIP-01 `REQ` message from client to relay. */ static clientREQ() {\n return z.tuple([\n z.literal('REQ'),\n z.string()\n ]).rest(NSchema.filter());\n }\n /** NIP-45 `COUNT` message from client to relay. */ static clientCOUNT() {\n return z.tuple([\n z.literal('COUNT'),\n z.string()\n ]).rest(NSchema.filter());\n }\n /** NIP-01 `CLOSE` message from client to relay. */ static clientCLOSE() {\n return z.tuple([\n z.literal('CLOSE'),\n z.string()\n ]);\n }\n /** NIP-42 `AUTH` message from client to relay. */ static clientAUTH() {\n return z.tuple([\n z.literal('AUTH'),\n NSchema.event()\n ]);\n }\n /** NIP-01 message from client to relay. */ static clientMsg() {\n return z.union([\n NSchema.clientEVENT(),\n NSchema.clientREQ(),\n NSchema.clientCOUNT(),\n NSchema.clientCLOSE(),\n NSchema.clientAUTH()\n ]);\n }\n /** NIP-01 `EVENT` message from relay to client. */ static relayEVENT() {\n return z.tuple([\n z.literal('EVENT'),\n z.string(),\n NSchema.event()\n ]);\n }\n /** NIP-01 `OK` message from relay to client. */ static relayOK() {\n return z.tuple([\n z.literal('OK'),\n NSchema.id(),\n z.boolean(),\n z.string()\n ]);\n }\n /** NIP-01 `EOSE` message from relay to client. */ static relayEOSE() {\n return z.tuple([\n z.literal('EOSE'),\n z.string()\n ]);\n }\n /** NIP-01 `NOTICE` message from relay to client. */ static relayNOTICE() {\n return z.tuple([\n z.literal('NOTICE'),\n z.string()\n ]);\n }\n /** NIP-01 `CLOSED` message from relay to client. */ static relayCLOSED() {\n return z.tuple([\n z.literal('CLOSED'),\n z.string(),\n z.string()\n ]);\n }\n /** NIP-42 `AUTH` message from relay to client. */ static relayAUTH() {\n return z.tuple([\n z.literal('AUTH'),\n z.string()\n ]);\n }\n /** NIP-45 `COUNT` message from relay to client. */ static relayCOUNT() {\n return z.tuple([\n z.literal('COUNT'),\n z.string(),\n z.object({\n count: z.number().int().nonnegative(),\n approximate: z.boolean().optional()\n })\n ]);\n }\n /** NIP-01 message from relay to client. */ static relayMsg() {\n return z.union([\n NSchema.relayEVENT(),\n NSchema.relayOK(),\n NSchema.relayEOSE(),\n NSchema.relayNOTICE(),\n NSchema.relayCLOSED(),\n NSchema.relayAUTH(),\n NSchema.relayCOUNT()\n ]);\n }\n /** Kind 0 content schema. */ static metadata() {\n return z.object({\n about: z.string().optional().catch(undefined),\n banner: z.string().url().optional().catch(undefined),\n bot: z.boolean().optional().catch(undefined),\n display_name: z.string().optional().catch(undefined),\n lud06: NSchema.bech32('lnurl').optional().catch(undefined),\n lud16: z.string().email().optional().catch(undefined),\n name: z.string().optional().catch(undefined),\n nip05: z.string().email().optional().catch(undefined),\n picture: z.string().url().optional().catch(undefined),\n website: z.string().url().optional().catch(undefined)\n }).passthrough();\n }\n /** NIP-46 request content schema. */ static connectRequest() {\n return z.object({\n id: z.string(),\n method: z.string(),\n params: z.string().array()\n });\n }\n /** NIP-46 response content schema. */ static connectResponse() {\n return z.object({\n id: z.string(),\n result: z.string(),\n error: z.string().optional()\n });\n }\n /**\n * Helper schema to parse a JSON string. It should then be piped into another schema. For example:\n *\n * ```ts\n * const event = NSchema.json().pipe(NSchema.event()).parse(data);\n * ```\n */ static json() {\n return z.string().transform((value, ctx)=>{\n try {\n return JSON.parse(value);\n } catch (_e) {\n ctx.addIssue({\n code: z.ZodIssueCode.custom,\n message: 'Invalid JSON'\n });\n return z.NEVER;\n }\n });\n }\n}\nexport { NSchema, z };\n//# sourceMappingURL=NSchema.js.map","// deno-lint-ignore-file require-await\nimport { z } from \"zod\";\nimport { NSchema as n } from \"./NSchema.js\";\n/** [NIP-46](https://github.com/nostr-protocol/nips/blob/master/46.md) remote signer through a relay. */ export class NConnectSigner {\n relay;\n pubkey;\n signer;\n timeout;\n encryption;\n constructor({ relay, pubkey, signer, timeout, encryption = 'nip04' }){\n this.relay = relay;\n this.pubkey = pubkey;\n this.signer = signer;\n this.timeout = timeout;\n this.encryption = encryption;\n }\n async getPublicKey() {\n return this.cmd('get_public_key', []);\n }\n async signEvent(event) {\n const result = await this.cmd('sign_event', [\n JSON.stringify(event)\n ]);\n return n.json().pipe(n.event()).parse(result);\n }\n async getRelays() {\n const result = await this.cmd('get_relays', []);\n return n.json().pipe(z.record(z.string(), z.object({\n read: z.boolean(),\n write: z.boolean()\n }))).parse(result);\n }\n nip04 = {\n encrypt: async (pubkey, plaintext)=>{\n return this.cmd('nip04_encrypt', [\n pubkey,\n plaintext\n ]);\n },\n decrypt: async (pubkey, ciphertext)=>{\n return this.cmd('nip04_decrypt', [\n pubkey,\n ciphertext\n ]);\n }\n };\n nip44 = {\n encrypt: async (pubkey, plaintext)=>{\n return this.cmd('nip44_encrypt', [\n pubkey,\n plaintext\n ]);\n },\n decrypt: async (pubkey, ciphertext)=>{\n return this.cmd('nip44_decrypt', [\n pubkey,\n ciphertext\n ]);\n }\n };\n /** Send a `connect` command to the relay. It should respond with `ack`. */ async connect(secret) {\n const params = [\n this.pubkey\n ];\n if (secret) {\n params.push(secret);\n }\n return this.cmd('connect', params);\n }\n /** Send a `ping` command to the signer. It should respond with `pong`. */ async ping() {\n return this.cmd('ping', []);\n }\n /** High-level RPC method. Returns the string result, or throws on error. */ async cmd(method, params) {\n const signal = typeof this.timeout === 'number' ? AbortSignal.timeout(this.timeout) : undefined;\n const { result, error } = await this.send({\n id: crypto.randomUUID(),\n method,\n params\n }, {\n signal\n });\n if (error) {\n throw new Error(error);\n }\n return result;\n }\n /** Low-level send method. Deals directly with connect request/response. */ async send(request, opts = {}) {\n const { signal } = opts;\n const event = await this.signer.signEvent({\n kind: 24133,\n content: await this.encrypt(this.pubkey, JSON.stringify(request)),\n created_at: Math.floor(Date.now() / 1000),\n tags: [\n [\n 'p',\n this.pubkey\n ]\n ]\n });\n const local = await this.signer.getPublicKey();\n const req = this.relay.req([\n {\n kinds: [\n 24133\n ],\n authors: [\n this.pubkey\n ],\n '#p': [\n local\n ]\n }\n ], {\n signal\n });\n await this.relay.event(event, {\n signal\n });\n for await (const msg of req){\n if (msg[0] === 'CLOSED') throw new Error('Subscription closed');\n if (msg[0] === 'EVENT') {\n const event = msg[2];\n const decrypted = await this.decrypt(this.pubkey, event.content);\n const response = n.json().pipe(n.connectResponse()).parse(decrypted);\n if (response.id === request.id) {\n return response;\n }\n }\n }\n throw new Error('Unreachable');\n }\n /** Local encrypt depending on settings. */ async encrypt(pubkey, plaintext) {\n switch(this.encryption){\n case 'nip04':\n return this.signer.nip04.encrypt(pubkey, plaintext);\n case 'nip44':\n return this.signer.nip44.encrypt(pubkey, plaintext);\n }\n }\n /** Local decrypt depending on settings. */ async decrypt(pubkey, ciphertext) {\n switch(this.encryption){\n case 'nip04':\n return this.signer.nip04.decrypt(pubkey, ciphertext);\n case 'nip44':\n return this.signer.nip44.decrypt(pubkey, ciphertext);\n }\n }\n}\n//# sourceMappingURL=NConnectSigner.js.map","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}\n// copied from utils\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(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(h.outputLen);\n number(h.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 (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as 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 ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\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// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word) => ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (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 * @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}\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 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}\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 // 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","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 * @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","import { exists, output } from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n/**\n * Polyfill for Safari 14\n */\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/**\n * Choice: a ? b : c\n */\nexport const Chi = (a, b, c) => (a & b) ^ (~a & c);\n/**\n * Majority function, true if any two inputs is true\n */\nexport const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\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 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\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","import { HashMD } from './_md.js';\nimport { rotl, wrapConstructor } from './utils.js';\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = /* @__PURE__ */ new Uint8Array(new Array(16).fill(0).map((_, i) => i));\nconst Pi = /* @__PURE__ */ Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n for (let j of [idxL, idxR])\n j.push(j[i].map((k) => Rho[k]));\nconst shifts = /* @__PURE__ */ [\n [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = /* @__PURE__ */ new Uint32Array([\n 0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr = /* @__PURE__ */ new Uint32Array([\n 0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n if (group === 0)\n return x ^ y ^ z;\n else if (group === 1)\n return (x & y) | (~x & z);\n else if (group === 2)\n return (x | ~y) ^ z;\n else if (group === 3)\n return (x & z) | (y & ~z);\n else\n return x ^ (y | ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst R_BUF = /* @__PURE__ */ new Uint32Array(16);\nexport class RIPEMD160 extends HashMD {\n constructor() {\n super(64, 20, 8, true);\n this.h0 = 0x67452301 | 0;\n this.h1 = 0xefcdab89 | 0;\n this.h2 = 0x98badcfe | 0;\n this.h3 = 0x10325476 | 0;\n this.h4 = 0xc3d2e1f0 | 0;\n }\n get() {\n const { h0, h1, h2, h3, h4 } = this;\n return [h0, h1, h2, h3, h4];\n }\n set(h0, h1, h2, h3, h4) {\n this.h0 = h0 | 0;\n this.h1 = h1 | 0;\n this.h2 = h2 | 0;\n this.h3 = h3 | 0;\n this.h4 = h4 | 0;\n }\n process(view, offset) {\n for (let i = 0; i < 16; i++, offset += 4)\n R_BUF[i] = view.getUint32(offset, true);\n // prettier-ignore\n let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n // Instead of iterating 0 to 80, we split it into 5 groups\n // And use the groups in constants, functions, etc. Much simpler\n for (let group = 0; group < 5; group++) {\n const rGroup = 4 - group;\n const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n for (let i = 0; i < 16; i++) {\n const tl = (rotl(al + f(group, bl, cl, dl) + R_BUF[rl[i]] + hbl, sl[i]) + el) | 0;\n al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n }\n // 2 loops are 10% faster\n for (let i = 0; i < 16; i++) {\n const tr = (rotl(ar + f(rGroup, br, cr, dr) + R_BUF[rr[i]] + hbr, sr[i]) + er) | 0;\n ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n }\n }\n // Add the compressed chunk to the current hash value\n this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n }\n roundClean() {\n R_BUF.fill(0);\n }\n destroy() {\n this.destroyed = true;\n this.buffer.fill(0);\n this.set(0, 0, 0, 0, 0);\n }\n}\n/**\n * RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n */\nexport const ripemd160 = /* @__PURE__ */ wrapConstructor(() => new RIPEMD160());\n//# sourceMappingURL=ripemd160.js.map","import { HashMD, Chi, Maj } from './_md.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// 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:\n// first 32 bits of the 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// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\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// 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());\n/**\n * SHA2-224 hash function\n */\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map","const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n let Ah = new Uint32Array(lst.length);\n let Al = new Uint32Array(lst.length);\n for (let i = 0; i < lst.length; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { fromBig, split, toBig, shrSH, shrSL, rotrSH, rotrSL, rotrBH, rotrBL, rotr32H, rotr32L, rotlSH, rotlSL, rotlBH, rotlBL, add, add3L, add3H, add4L, add4H, add5H, add5L, };\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","import { HashMD } from './_md.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends HashMD {\n constructor() {\n super(128, 64, 16, false);\n // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n // Also looks cleaner and easier to verify with spec.\n // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x6a09e667 | 0;\n this.Al = 0xf3bcc908 | 0;\n this.Bh = 0xbb67ae85 | 0;\n this.Bl = 0x84caa73b | 0;\n this.Ch = 0x3c6ef372 | 0;\n this.Cl = 0xfe94f82b | 0;\n this.Dh = 0xa54ff53a | 0;\n this.Dl = 0x5f1d36f1 | 0;\n this.Eh = 0x510e527f | 0;\n this.El = 0xade682d1 | 0;\n this.Fh = 0x9b05688c | 0;\n this.Fl = 0x2b3e6c1f | 0;\n this.Gh = 0x1f83d9ab | 0;\n this.Gl = 0xfb41bd6b | 0;\n this.Hh = 0x5be0cd19 | 0;\n this.Hl = 0x137e2179 | 0;\n }\n // prettier-ignore\n get() {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n this.Ah = Ah | 0;\n this.Al = Al | 0;\n this.Bh = Bh | 0;\n this.Bl = Bl | 0;\n this.Ch = Ch | 0;\n this.Cl = Cl | 0;\n this.Dh = Dh | 0;\n this.Dl = Dl | 0;\n this.Eh = Eh | 0;\n this.El = El | 0;\n this.Fh = Fh | 0;\n this.Fl = Fl | 0;\n this.Gh = Gh | 0;\n this.Gl = Gl | 0;\n this.Hh = Hh | 0;\n this.Hl = Hl | 0;\n }\n process(view, offset) {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] | 0;\n const W15l = SHA512_W_L[i - 15] | 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] | 0;\n const W2l = SHA512_W_L[i - 2] | 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh | 0;\n SHA512_W_L[i] = SUMl | 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll | 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh | 0;\n Hl = Gl | 0;\n Gh = Fh | 0;\n Gl = Fl | 0;\n Fh = Eh | 0;\n Fl = El | 0;\n ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n Dh = Ch | 0;\n Dl = Cl | 0;\n Ch = Bh | 0;\n Cl = Bl | 0;\n Bh = Ah | 0;\n Bl = Al | 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All | 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n roundClean() {\n SHA512_W_H.fill(0);\n SHA512_W_L.fill(0);\n }\n destroy() {\n this.buffer.fill(0);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\nexport class SHA512_224 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x8c3d37c8 | 0;\n this.Al = 0x19544da2 | 0;\n this.Bh = 0x73e19966 | 0;\n this.Bl = 0x89dcd4d6 | 0;\n this.Ch = 0x1dfab7ae | 0;\n this.Cl = 0x32ff9c82 | 0;\n this.Dh = 0x679dd514 | 0;\n this.Dl = 0x582f9fcf | 0;\n this.Eh = 0x0f6d2b69 | 0;\n this.El = 0x7bd44da8 | 0;\n this.Fh = 0x77e36f73 | 0;\n this.Fl = 0x04c48942 | 0;\n this.Gh = 0x3f9d85a8 | 0;\n this.Gl = 0x6a1d36c8 | 0;\n this.Hh = 0x1112e6ad | 0;\n this.Hl = 0x91d692a1 | 0;\n this.outputLen = 28;\n }\n}\nexport class SHA512_256 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0x22312194 | 0;\n this.Al = 0xfc2bf72c | 0;\n this.Bh = 0x9f555fa3 | 0;\n this.Bl = 0xc84c64c2 | 0;\n this.Ch = 0x2393b86b | 0;\n this.Cl = 0x6f53b151 | 0;\n this.Dh = 0x96387719 | 0;\n this.Dl = 0x5940eabd | 0;\n this.Eh = 0x96283ee2 | 0;\n this.El = 0xa88effe3 | 0;\n this.Fh = 0xbe5e1e25 | 0;\n this.Fl = 0x53863992 | 0;\n this.Gh = 0x2b0199fc | 0;\n this.Gl = 0x2c85b8aa | 0;\n this.Hh = 0x0eb72ddc | 0;\n this.Hl = 0x81c52ca2 | 0;\n this.outputLen = 32;\n }\n}\nexport class SHA384 extends SHA512 {\n constructor() {\n super();\n // h -- high 32 bits, l -- low 32 bits\n this.Ah = 0xcbbb9d5d | 0;\n this.Al = 0xc1059ed8 | 0;\n this.Bh = 0x629a292a | 0;\n this.Bl = 0x367cd507 | 0;\n this.Ch = 0x9159015a | 0;\n this.Cl = 0x3070dd17 | 0;\n this.Dh = 0x152fecd8 | 0;\n this.Dl = 0xf70e5939 | 0;\n this.Eh = 0x67332667 | 0;\n this.El = 0xffc00b31 | 0;\n this.Fh = 0x8eb44a87 | 0;\n this.Fl = 0x68581511 | 0;\n this.Gh = 0xdb0c2e0d | 0;\n this.Gl = 0x64f98fa7 | 0;\n this.Hh = 0x47b5481d | 0;\n this.Hl = 0xbefa4fa4 | 0;\n this.outputLen = 48;\n }\n}\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.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 = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nexport function isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && 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} must be valid boolean, 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 // Big Endian\n return BigInt(hex === '' ? '0' : `0x${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}\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 valid hex string, got \"${hex}\". 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} expected ${expectedLength} bytes, 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(`utf8ToBytes expected string, got ${typeof str}`);\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 ${typeof n} ${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(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 = { [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/**\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","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, bytesToNumberBE, bytesToNumberLE, ensureBytes, numberToBytesBE, numberToBytesLE, 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}\nexport function FpLegendre(order) {\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 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. **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 * 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 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(`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, bitLen } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\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)\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 validateW = (W) => {\n if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n throw new Error(`Wrong window size=${W}, should be [1..${bits}]`);\n };\n const opts = (W) => {\n validateW(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, n, transform) {\n const W = pointWindowSizes.get(P) || 1;\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 this.wNAF(W, comp, n);\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);\n pointWindowSizes.set(P, W);\n pointPrecomputes.delete(P);\n },\n };\n}\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM).\n * MSM is basically (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 field 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, field, 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 if (!Array.isArray(points) || !Array.isArray(scalars) || scalars.length !== points.length)\n throw new Error('arrays of points and scalars must have equal length');\n scalars.forEach((s, i) => {\n if (!field.isValid(s))\n throw new Error(`wrong scalar at index ${i}`);\n });\n points.forEach((p, i) => {\n if (!(p instanceof c))\n throw new Error(`wrong point at index ${i}`);\n });\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(c.ZERO); // +1 for zero array\n const lastBits = Math.floor((field.BITS - 1) / windowSize) * windowSize;\n let sum = c.ZERO;\n for (let i = lastBits; i >= 0; i -= windowSize) {\n buckets.fill(c.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 = c.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 = c.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}\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 { validateBasic, wNAF, pippenger, } from './curve.js';\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes, memoized, abool } 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('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}\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\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: class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n },\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 return `${ut.numberToHexUnpadded(tag)}${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 assertion');\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 seq = `${tlv.encode(0x02, int.encode(sig.r))}${tlv.encode(0x02, int.encode(sig.s))}`;\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 = mod.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 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 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 wrong representation of ZERO and is always invalid.\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 ut.aInRange('scalar', sc, _0n, CURVE.n);\n const I = Point.ZERO;\n if (sc === _0n)\n return I;\n if (sc === _1n)\n return this;\n const { endo } = CURVE;\n if (!endo)\n return wnaf.unsafeLadder(this, sc);\n // Apply 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.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 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 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 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 = 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 = 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 // 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, 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 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 if ('strict' in opts)\n throw new Error('options.strict was renamed to lowS');\n validateSigVerOpts(opts);\n const { lowS, prehash } = opts;\n let _sig = undefined;\n let P;\n try {\n if (typeof sg === 'string' || ut.isBytes(sg)) {\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","/*! 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 { createCurve } from './_shortw_utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { inRange, aInRange, bytesToNumberBE, concatBytes, ensureBytes, 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 (!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 });\n/**\n * secp256k1 short weierstrass curve and ECDSA signatures over it.\n */\nexport const secp256k1 = createCurve({\n a: BigInt(0), // equation params: a, b\n b: BigInt(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975\n Fp, // 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 /**\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);\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 */\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","/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport function assertNumber(n) {\n if (!Number.isSafeInteger(n))\n throw new Error(`Wrong integer: ${n}`);\n}\nfunction isBytes(a) {\n return (a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction chain(...args) {\n const id = (a) => a;\n // Wrap call in closure so JIT can inline calls\n const wrap = (a, b) => (c) => a(b(c));\n // Construct chain of args[-1].encode(args[-2].encode([...]))\n const encode = args.map((x) => x.encode).reduceRight(wrap, id);\n // Construct chain of args[0].decode(args[1].decode(...))\n const decode = args.map((x) => x.decode).reduce(wrap, id);\n return { encode, decode };\n}\n/**\n * Encodes integer radix representation to array of strings using alphabet and back\n * @__NO_SIDE_EFFECTS__\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}\n/**\n * @__NO_SIDE_EFFECTS__\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}\n/**\n * Pad strings array so it has integer number of bits\n * @__NO_SIDE_EFFECTS__\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}\n/**\n * @__NO_SIDE_EFFECTS__\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}\n/**\n * Slow: O(n^2) time complexity\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix(data, from, to) {\n // base 1 is impossible\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 const rounded = Math.floor(digitBase / to);\n digits[i] = rounded;\n if (!Number.isSafeInteger(rounded) || rounded * to + carry !== digitBase)\n throw new Error('convertRadix: carry overflow');\n if (!done)\n continue;\n else if (!rounded)\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 = /* @__NO_SIDE_EFFECTS__ */ (a, b) => (!b ? a : gcd(b, a % b));\nconst radix2carry = /*@__NO_SIDE_EFFECTS__ */ (from, to) => from + (to - gcd(from, to));\n/**\n * Implemented with numbers, because BigInt is 5x slower\n * @__NO_SIDE_EFFECTS__\n */\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; // bitwise position in current element\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; // clean carry, otherwise it will cause overflow\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}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix(num) {\n assertNumber(num);\n return {\n encode: (bytes) => {\n if (!isBytes(bytes))\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 numbers');\n return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\n },\n };\n}\n/**\n * If both bases are power of same number (like `2**8 <-> 2**64`),\n * there is a linear algorithm. For now we have implementation for power-of-two bases only.\n * @__NO_SIDE_EFFECTS__\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 (!isBytes(bytes))\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 numbers');\n return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n },\n };\n}\n/**\n * @__NO_SIDE_EFFECTS__\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}\n/**\n * @__NO_SIDE_EFFECTS__\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 (!isBytes(data))\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 (!isBytes(data))\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}\n// prettier-ignore\nexport const utils = {\n alphabet, chain, checksum, convertRadix, convertRadix2, radix, radix2, join, padding,\n};\n// RFC 4648 aka RFC 3548\n// ---------------------\nexport const base16 = /* @__PURE__ */ chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexport const base32 = /* @__PURE__ */ chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexport const base32nopad = /* @__PURE__ */ chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), join(''));\nexport const base32hex = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexport const base32hexnopad = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), join(''));\nexport const base32crockford = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexport const base64 = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexport const base64nopad = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), join(''));\nexport const base64url = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nexport const base64urlnopad = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), join(''));\n// base58 code\n// -----------\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexport const base58 = /* @__PURE__ */ genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexport const base58flickr = /* @__PURE__ */ genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexport const base58xrp = /* @__PURE__ */ genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\n// xmr ver is done in 8-byte blocks (which equals 11 chars in decoding). Last (non-full) block padded with '1' to size in XMR_BLOCK_LEN.\n// Block encoding significantly reduces quadratic complexity of base58.\n// Data len (index) -> encoded block len\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 createBase58check = (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\n// legacy export, bad name\nexport const base58check = createBase58check;\nconst BECH_ALPHABET = /* @__PURE__ */ chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\n/**\n * @__NO_SIDE_EFFECTS__\n */\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}\n/**\n * @__NO_SIDE_EFFECTS__\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}\n/**\n * @__NO_SIDE_EFFECTS__\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 (words instanceof Uint8Array)\n words = Array.from(words);\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 if (prefix.length === 0)\n throw new TypeError(`Invalid prefix length ${prefix.length}`);\n const actualLength = prefix.length + 7 + words.length;\n if (limit !== false && actualLength > limit)\n throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n const lowered = prefix.toLowerCase();\n const sum = bechChecksum(lowered, words, ENCODING_CONST);\n return `${lowered}1${BECH_ALPHABET.encode(words)}${sum}`;\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 // don't allow mixed case\n const lowered = str.toLowerCase();\n if (str !== lowered && str !== str.toUpperCase())\n throw new Error(`String must be lowercase or uppercase`);\n const sepIndex = lowered.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 = lowered.slice(0, sepIndex);\n const data = lowered.slice(sepIndex + 1);\n if (data.length < 6)\n throw new Error('Data must be at least 6 characters long');\n const words = BECH_ALPHABET.decode(data).slice(0, -6);\n const sum = bechChecksum(prefix, words, ENCODING_CONST);\n if (!data.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 function encodeFromBytes(prefix, bytes) {\n return encode(prefix, toWords(bytes));\n }\n return {\n encode,\n decode,\n encodeFromBytes,\n decodeToBytes,\n decodeUnsafe,\n fromWords,\n fromWordsUnsafe,\n toWords,\n };\n}\nexport const bech32 = /* @__PURE__ */ genBech32('bech32');\nexport const bech32m = /* @__PURE__ */ genBech32('bech32m');\nexport const utf8 = {\n encode: (data) => new TextDecoder().decode(data),\n decode: (str) => new TextEncoder().encode(str),\n};\nexport const hex = /* @__PURE__ */ 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}));\n// prettier-ignore\nconst CODERS = {\n utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\nconst coderTypeError = 'Invalid encoding type. Available types: utf8, hex, base16, base32, base64, base64url, base58, base58xmr';\nexport const bytesToString = (type, bytes) => {\n if (typeof type !== 'string' || !CODERS.hasOwnProperty(type))\n throw new TypeError(coderTypeError);\n if (!isBytes(bytes))\n throw new TypeError('bytesToString() expects Uint8Array');\n return CODERS[type].encode(bytes);\n};\nexport const str = bytesToString; // as in python, but for bytes only\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//# sourceMappingURL=index.js.map","/*! scure-bip32 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { ripemd160 } from '@noble/hashes/ripemd160';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { sha512 } from '@noble/hashes/sha512';\nimport { bytes as assertBytes } from '@noble/hashes/_assert';\nimport { bytesToHex, concatBytes, createView, hexToBytes, utf8ToBytes } from '@noble/hashes/utils';\nimport { secp256k1 as secp } from '@noble/curves/secp256k1';\nimport { mod } from '@noble/curves/abstract/modular';\nimport { createBase58check } from '@scure/base';\nconst Point = secp.ProjectivePoint;\nconst base58check = createBase58check(sha256);\nfunction bytesToNumber(bytes) {\n return BigInt(`0x${bytesToHex(bytes)}`);\n}\nfunction numberToBytes(num) {\n return hexToBytes(num.toString(16).padStart(64, '0'));\n}\nconst MASTER_SECRET = utf8ToBytes('Bitcoin seed');\n// Bitcoin hardcoded by default\nconst BITCOIN_VERSIONS = { private: 0x0488ade4, public: 0x0488b21e };\nexport const HARDENED_OFFSET = 0x80000000;\nconst hash160 = (data) => ripemd160(sha256(data));\nconst fromU32 = (data) => createView(data).getUint32(0, false);\nconst toU32 = (n) => {\n if (!Number.isSafeInteger(n) || n < 0 || n > 2 ** 32 - 1) {\n throw new Error(`Invalid number=${n}. Should be from 0 to 2 ** 32 - 1`);\n }\n const buf = new Uint8Array(4);\n createView(buf).setUint32(0, n, false);\n return buf;\n};\nexport class HDKey {\n get fingerprint() {\n if (!this.pubHash) {\n throw new Error('No publicKey set!');\n }\n return fromU32(this.pubHash);\n }\n get identifier() {\n return this.pubHash;\n }\n get pubKeyHash() {\n return this.pubHash;\n }\n get privateKey() {\n return this.privKeyBytes || null;\n }\n get publicKey() {\n return this.pubKey || null;\n }\n get privateExtendedKey() {\n const priv = this.privateKey;\n if (!priv) {\n throw new Error('No private key');\n }\n return base58check.encode(this.serialize(this.versions.private, concatBytes(new Uint8Array([0]), priv)));\n }\n get publicExtendedKey() {\n if (!this.pubKey) {\n throw new Error('No public key');\n }\n return base58check.encode(this.serialize(this.versions.public, this.pubKey));\n }\n static fromMasterSeed(seed, versions = BITCOIN_VERSIONS) {\n assertBytes(seed);\n if (8 * seed.length < 128 || 8 * seed.length > 512) {\n throw new Error(`HDKey: wrong seed length=${seed.length}. Should be between 128 and 512 bits; 256 bits is advised)`);\n }\n const I = hmac(sha512, MASTER_SECRET, seed);\n return new HDKey({\n versions,\n chainCode: I.slice(32),\n privateKey: I.slice(0, 32),\n });\n }\n static fromExtendedKey(base58key, versions = BITCOIN_VERSIONS) {\n // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n const keyBuffer = base58check.decode(base58key);\n const keyView = createView(keyBuffer);\n const version = keyView.getUint32(0, false);\n const opt = {\n versions,\n depth: keyBuffer[4],\n parentFingerprint: keyView.getUint32(5, false),\n index: keyView.getUint32(9, false),\n chainCode: keyBuffer.slice(13, 45),\n };\n const key = keyBuffer.slice(45);\n const isPriv = key[0] === 0;\n if (version !== versions[isPriv ? 'private' : 'public']) {\n throw new Error('Version mismatch');\n }\n if (isPriv) {\n return new HDKey({ ...opt, privateKey: key.slice(1) });\n }\n else {\n return new HDKey({ ...opt, publicKey: key });\n }\n }\n static fromJSON(json) {\n return HDKey.fromExtendedKey(json.xpriv);\n }\n constructor(opt) {\n this.depth = 0;\n this.index = 0;\n this.chainCode = null;\n this.parentFingerprint = 0;\n if (!opt || typeof opt !== 'object') {\n throw new Error('HDKey.constructor must not be called directly');\n }\n this.versions = opt.versions || BITCOIN_VERSIONS;\n this.depth = opt.depth || 0;\n this.chainCode = opt.chainCode || null;\n this.index = opt.index || 0;\n this.parentFingerprint = opt.parentFingerprint || 0;\n if (!this.depth) {\n if (this.parentFingerprint || this.index) {\n throw new Error('HDKey: zero depth with non-zero index/parent fingerprint');\n }\n }\n if (opt.publicKey && opt.privateKey) {\n throw new Error('HDKey: publicKey and privateKey at same time.');\n }\n if (opt.privateKey) {\n if (!secp.utils.isValidPrivateKey(opt.privateKey)) {\n throw new Error('Invalid private key');\n }\n this.privKey =\n typeof opt.privateKey === 'bigint' ? opt.privateKey : bytesToNumber(opt.privateKey);\n this.privKeyBytes = numberToBytes(this.privKey);\n this.pubKey = secp.getPublicKey(opt.privateKey, true);\n }\n else if (opt.publicKey) {\n this.pubKey = Point.fromHex(opt.publicKey).toRawBytes(true); // force compressed point\n }\n else {\n throw new Error('HDKey: no public or private key provided');\n }\n this.pubHash = hash160(this.pubKey);\n }\n derive(path) {\n if (!/^[mM]'?/.test(path)) {\n throw new Error('Path must start with \"m\" or \"M\"');\n }\n if (/^[mM]'?$/.test(path)) {\n return this;\n }\n const parts = path.replace(/^[mM]'?\\//, '').split('/');\n // tslint:disable-next-line\n let child = this;\n for (const c of parts) {\n const m = /^(\\d+)('?)$/.exec(c);\n const m1 = m && m[1];\n if (!m || m.length !== 3 || typeof m1 !== 'string') {\n throw new Error(`Invalid child index: ${c}`);\n }\n let idx = +m1;\n if (!Number.isSafeInteger(idx) || idx >= HARDENED_OFFSET) {\n throw new Error('Invalid index');\n }\n // hardened key\n if (m[2] === \"'\") {\n idx += HARDENED_OFFSET;\n }\n child = child.deriveChild(idx);\n }\n return child;\n }\n deriveChild(index) {\n if (!this.pubKey || !this.chainCode) {\n throw new Error('No publicKey or chainCode set');\n }\n let data = toU32(index);\n if (index >= HARDENED_OFFSET) {\n // Hardened\n const priv = this.privateKey;\n if (!priv) {\n throw new Error('Could not derive hardened child key');\n }\n // Hardened child: 0x00 || ser256(kpar) || ser32(index)\n data = concatBytes(new Uint8Array([0]), priv, data);\n }\n else {\n // Normal child: serP(point(kpar)) || ser32(index)\n data = concatBytes(this.pubKey, data);\n }\n const I = hmac(sha512, this.chainCode, data);\n const childTweak = bytesToNumber(I.slice(0, 32));\n const chainCode = I.slice(32);\n if (!secp.utils.isValidPrivateKey(childTweak)) {\n throw new Error('Tweak bigger than curve order');\n }\n const opt = {\n versions: this.versions,\n chainCode,\n depth: this.depth + 1,\n parentFingerprint: this.fingerprint,\n index,\n };\n try {\n // Private parent key -> private child key\n if (this.privateKey) {\n const added = mod(this.privKey + childTweak, secp.CURVE.n);\n if (!secp.utils.isValidPrivateKey(added)) {\n throw new Error('The tweak was out of range or the resulted private key is invalid');\n }\n opt.privateKey = added;\n }\n else {\n const added = Point.fromHex(this.pubKey).add(Point.fromPrivateKey(childTweak));\n // Cryptographically impossible: hmac-sha512 preimage would need to be found\n if (added.equals(Point.ZERO)) {\n throw new Error('The tweak was equal to negative P, which made the result key invalid');\n }\n opt.publicKey = added.toRawBytes(true);\n }\n return new HDKey(opt);\n }\n catch (err) {\n return this.deriveChild(index + 1);\n }\n }\n sign(hash) {\n if (!this.privateKey) {\n throw new Error('No privateKey set!');\n }\n assertBytes(hash, 32);\n return secp.sign(hash, this.privKey).toCompactRawBytes();\n }\n verify(hash, signature) {\n assertBytes(hash, 32);\n assertBytes(signature, 64);\n if (!this.publicKey) {\n throw new Error('No publicKey set!');\n }\n let sig;\n try {\n sig = secp.Signature.fromCompact(signature);\n }\n catch (error) {\n return false;\n }\n return secp.verify(sig, hash, this.publicKey);\n }\n wipePrivateData() {\n this.privKey = undefined;\n if (this.privKeyBytes) {\n this.privKeyBytes.fill(0);\n this.privKeyBytes = undefined;\n }\n return this;\n }\n toJSON() {\n return {\n xpriv: this.privateExtendedKey,\n xpub: this.publicExtendedKey,\n };\n }\n serialize(version, key) {\n if (!this.chainCode) {\n throw new Error('No chainCode set');\n }\n assertBytes(key, 33);\n // version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n return concatBytes(toU32(version), new Uint8Array([this.depth]), toU32(this.parentFingerprint), toU32(this.index), this.chainCode, key);\n }\n}\n//# sourceMappingURL=index.js.map","// deno-lint-ignore-file require-await\nimport { finalizeEvent, getPublicKey, nip04, nip44 } from \"nostr-tools\";\n/**\n * NIP-07-compatible signer with secret key. It is a drop-in replacement for `window.nostr`.\n *\n * Usage:\n *\n * ```ts\n * const signer = new NSecSigner(secretKey);\n * const pubkey = await signer.getPublicKey();\n * const event = await signer.signEvent({ kind: 1, content: 'Hello, world!', tags: [], created_at: 0 });\n * ```\n */ export class NSecSigner {\n #secretKey;\n constructor(secretKey){\n this.#secretKey = secretKey;\n }\n async getPublicKey() {\n return getPublicKey(this.#secretKey);\n }\n async signEvent(event) {\n return finalizeEvent(event, this.#secretKey);\n }\n nip04 = {\n encrypt: async (pubkey, plaintext)=>{\n return nip04.encrypt(this.#secretKey, pubkey, plaintext);\n },\n decrypt: async (pubkey, ciphertext)=>{\n return nip04.decrypt(this.#secretKey, pubkey, ciphertext);\n }\n };\n #getConversationKey(pubkey) {\n return nip44.v2.utils.getConversationKey(this.#secretKey, pubkey);\n }\n nip44 = {\n encrypt: async (pubkey, plaintext)=>{\n const conversationKey = this.#getConversationKey(pubkey);\n return nip44.v2.encrypt(plaintext, conversationKey);\n },\n decrypt: async (pubkey, ciphertext)=>{\n const conversationKey = this.#getConversationKey(pubkey);\n return nip44.v2.decrypt(ciphertext, conversationKey);\n }\n };\n}\n//# sourceMappingURL=NSecSigner.js.map","import { HDKey } from \"@scure/bip32\";\nimport { NSecSigner } from \"./NSecSigner.js\";\n/**\n * Accepts an HD seed which it uses to derive the secret key according to [NIP-06](https://github.com/nostr-protocol/nips/blob/master/06.md).\n * This method is useful for supporting multiple accounts for the same user, or for sharing a Nostr account with a Bitcoin wallet.\n *\n * ```ts\n * const signer = new NSeedSigner(seed, 0);\n *\n * signer.getPublicKey();\n * signer.signEvent(t);\n```\n */ export class NSeedSigner extends NSecSigner {\n constructor(seed, account = 0){\n const path = `m/44'/1237'/${account}'/0/0`;\n const { privateKey } = HDKey.fromMasterSeed(seed).derive(path);\n if (!privateKey) {\n throw new Error('Could not derive private key');\n }\n super(privateKey);\n }\n}\n//# sourceMappingURL=NSeedSigner.js.map","import { NSeedSigner } from \"./NSeedSigner.js\";\n/**\n * Signer manager for multiple users.\n * Pass a shared secret into it, then it will generate keys for your users determinstically.\n * Useful for custodial auth where you only want to manage one secret for the entire application.\n *\n * ```ts\n * const SECRET_KEY = Deno.env.get('SECRET_KEY'); // generate with `openssl rand -base64 48`\n * const seed = new TextEncoder().encode(SECRET_KEY);\n *\n * const signers = new NCustodial(seed);\n *\n * const alex = await signers.get('alex');\n * const fiatjaf = await signers.get('fiatjaf');\n *\n * alex.getPublicKey();\n * fiatjaf.signEvent(t);\n * ```\n */ export class NCustodial {\n #seed;\n constructor(seed){\n this.#seed = seed;\n }\n /** Get a signer for the given user. */ async get(user, account = 0) {\n const cryptoKey = await crypto.subtle.importKey('raw', this.#seed, {\n name: 'HMAC',\n hash: {\n name: 'SHA-256'\n }\n }, false, [\n 'sign'\n ]);\n const data = new TextEncoder().encode(user);\n const hash = await crypto.subtle.sign('HMAC', cryptoKey, data);\n const seed = new Uint8Array(hash);\n return new NSeedSigner(seed, account);\n }\n}\n//# sourceMappingURL=NCustodial.js.map","import { NSchema as n, z } from \"./NSchema.js\";\nexport class NIP05 {\n /** NIP-05 value regex. */ static regex() {\n return /^(?:([\\w.+-]+)@)?([\\w.-]+)$/;\n }\n /** `nostr.json` response schema. */ static nostrJsonSchema() {\n return z.object({\n names: z.record(z.string().regex(/^[\\w.+-]+$/), n.id()),\n relays: z.record(n.id(), z.array(z.string().url())).optional()\n });\n }\n /** Resolve NIP-05 name to a profile pointer. */ static async lookup(nip05, opts) {\n const { fetch = globalThis.fetch, signal } = opts ?? {};\n const match = nip05.match(NIP05.regex());\n if (!match) throw new Error(`NIP-05: invalid name ${nip05}`);\n const [_, name = '_', domain] = match;\n const url = new URL(`/.well-known/nostr.json?name=${encodeURIComponent(name)}`, `https://${domain}/`);\n const res = await fetch(url, {\n signal\n });\n const { names, relays } = NIP05.nostrJsonSchema().parse(await res.json());\n const pubkey = names[name];\n if (!pubkey) throw new Error(`NIP-05: no match for ${nip05}`);\n return {\n pubkey,\n relays: relays?.[pubkey] ?? []\n };\n }\n}\n//# sourceMappingURL=NIP05.js.map","/** [NIP-50](https://github.com/nostr-protocol/nips/blob/master/50.md) search functionality. */ export class NIP50 {\n static parseInput(input) {\n const regex = /(\\b\\w+:[^\\s\"]+)|(\".*?\")|(\\S+)/g;\n const tokens = [];\n let match;\n while((match = regex.exec(input)) !== null){\n if (match[1]) {\n const [key, ...values] = match[1].split(':');\n tokens.push({\n key,\n value: values.join(':')\n });\n } else if (match[2]) {\n tokens.push(match[2].replace(/\"/g, ''));\n } else if (match[3]) {\n tokens.push(match[3]);\n }\n }\n return tokens;\n }\n}\n//# sourceMappingURL=NIP50.js.map","// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.\nconst encoder = new TextEncoder();\nfunction getTypeName(value) {\n const type = typeof value;\n if (type !== \"object\") {\n return type;\n } else if (value === null) {\n return \"null\";\n } else {\n return value?.constructor?.name ?? \"object\";\n }\n}\nexport function validateBinaryLike(source) {\n if (typeof source === \"string\") {\n return encoder.encode(source);\n } else if (source instanceof Uint8Array) {\n return source;\n } else if (source instanceof ArrayBuffer) {\n return new Uint8Array(source);\n }\n throw new TypeError(`The input must be a Uint8Array, a string, or an ArrayBuffer. Received a value of the type ${getTypeName(source)}.`);\n}\n//# sourceMappingURL=_validate_binary_like.js.map","// Copyright 2009 The Go Authors. All rights reserved.\n// https://github.com/golang/go/blob/master/LICENSE\n// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.\n// This module is browser compatible.\n/**\n * Port of the Go\n * {@link https://github.com/golang/go/blob/go1.12.5/src/encoding/hex/hex.go | encoding/hex}\n * library.\n *\n * This module is browser compatible.\n *\n * ```ts\n * import {\n * decodeHex,\n * encodeHex,\n * } from \"@std/encoding/hex\";\n * import { assertEquals } from \"@std/assert/assert-equals\";\n *\n * assertEquals(encodeHex(\"abc\"), \"616263\");\n *\n * assertEquals(\n * decodeHex(\"616263\"),\n * new TextEncoder().encode(\"abc\"),\n * );\n * ```\n *\n * @module\n */ import { validateBinaryLike } from \"./_validate_binary_like.js\";\nconst hexTable = new TextEncoder().encode(\"0123456789abcdef\");\nconst textEncoder = new TextEncoder();\nconst textDecoder = new TextDecoder();\nfunction errInvalidByte(byte) {\n return new TypeError(`Invalid byte '${String.fromCharCode(byte)}'`);\n}\nfunction errLength() {\n return new RangeError(\"Odd length hex string\");\n}\n/** Converts a hex character into its value. */ function fromHexChar(byte) {\n // '0' <= byte && byte <= '9'\n if (48 <= byte && byte <= 57) return byte - 48;\n // 'a' <= byte && byte <= 'f'\n if (97 <= byte && byte <= 102) return byte - 97 + 10;\n // 'A' <= byte && byte <= 'F'\n if (65 <= byte && byte <= 70) return byte - 65 + 10;\n throw errInvalidByte(byte);\n}\n/**\n * Converts data into a hex-encoded string.\n *\n * @param src The data to encode.\n *\n * @returns The hex-encoded string.\n *\n * @example Usage\n * ```ts\n * import { encodeHex } from \"@std/encoding/hex\";\n * import { assertEquals } from \"@std/assert/assert-equals\";\n *\n * assertEquals(encodeHex(\"abc\"), \"616263\");\n * ```\n */ export function encodeHex(src) {\n const u8 = validateBinaryLike(src);\n const dst = new Uint8Array(u8.length * 2);\n for(let i = 0; i < dst.length; i++){\n const v = u8[i];\n dst[i * 2] = hexTable[v >> 4];\n dst[i * 2 + 1] = hexTable[v & 0x0f];\n }\n return textDecoder.decode(dst);\n}\n/**\n * Decodes the given hex-encoded string. If the input is malformed, an error is\n * thrown.\n *\n * @param src The hex-encoded string to decode.\n *\n * @returns The decoded data.\n *\n * @example Usage\n * ```ts\n * import { decodeHex } from \"@std/encoding/hex\";\n * import { assertEquals } from \"@std/assert/assert-equals\";\n *\n * assertEquals(\n * decodeHex(\"616263\"),\n * new TextEncoder().encode(\"abc\"),\n * );\n * ```\n */ export function decodeHex(src) {\n const u8 = textEncoder.encode(src);\n const dst = new Uint8Array(u8.length / 2);\n for(let i = 0; i < dst.length; i++){\n const a = fromHexChar(u8[i * 2]);\n const b = fromHexChar(u8[i * 2 + 1]);\n dst[i] = a << 4 | b;\n }\n if (u8.length % 2 === 1) {\n // Check for invalid char before reporting bad length,\n // since the invalid char (if present) is an earlier problem.\n fromHexChar(u8[dst.length * 2]);\n throw errLength();\n }\n return dst;\n}\n//# sourceMappingURL=hex.js.map","// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.\n// This module is browser compatible.\n/**\n * Utilities for\n * {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-4 | base64}\n * encoding and decoding.\n *\n * This module is browser compatible.\n *\n * ```ts\n * import {\n * encodeBase64,\n * decodeBase64,\n * } from \"@std/encoding/base64\";\n * import { assertEquals } from \"@std/assert/assert-equals\";\n *\n * const foobar = new TextEncoder().encode(\"foobar\");\n *\n * assertEquals(encodeBase64(foobar), \"Zm9vYmFy\");\n * assertEquals(decodeBase64(\"Zm9vYmFy\"), foobar);\n * ```\n *\n * @module\n */ import { validateBinaryLike } from \"./_validate_binary_like.js\";\nconst base64abc = [\n \"A\",\n \"B\",\n \"C\",\n \"D\",\n \"E\",\n \"F\",\n \"G\",\n \"H\",\n \"I\",\n \"J\",\n \"K\",\n \"L\",\n \"M\",\n \"N\",\n \"O\",\n \"P\",\n \"Q\",\n \"R\",\n \"S\",\n \"T\",\n \"U\",\n \"V\",\n \"W\",\n \"X\",\n \"Y\",\n \"Z\",\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n \"0\",\n \"1\",\n \"2\",\n \"3\",\n \"4\",\n \"5\",\n \"6\",\n \"7\",\n \"8\",\n \"9\",\n \"+\",\n \"/\"\n];\n/**\n * Converts data into a base64-encoded string.\n *\n * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-4}\n *\n * @param data The data to encode.\n * @returns The base64-encoded string.\n *\n * @example Usage\n * ```ts\n * import { encodeBase64 } from \"@std/encoding/base64\";\n * import { assertEquals } from \"@std/assert/assert-equals\";\n *\n * assertEquals(encodeBase64(\"foobar\"), \"Zm9vYmFy\");\n * ```\n */ export function encodeBase64(data) {\n // CREDIT: https://gist.github.com/enepomnyaschih/72c423f727d395eeaa09697058238727\n const uint8 = validateBinaryLike(data);\n let result = \"\";\n let i;\n const l = uint8.length;\n for(i = 2; i < l; i += 3){\n result += base64abc[uint8[i - 2] >> 2];\n result += base64abc[(uint8[i - 2] & 0x03) << 4 | uint8[i - 1] >> 4];\n result += base64abc[(uint8[i - 1] & 0x0f) << 2 | uint8[i] >> 6];\n result += base64abc[uint8[i] & 0x3f];\n }\n if (i === l + 1) {\n // 1 octet yet to write\n result += base64abc[uint8[i - 2] >> 2];\n result += base64abc[(uint8[i - 2] & 0x03) << 4];\n result += \"==\";\n }\n if (i === l) {\n // 2 octets yet to write\n result += base64abc[uint8[i - 2] >> 2];\n result += base64abc[(uint8[i - 2] & 0x03) << 4 | uint8[i - 1] >> 4];\n result += base64abc[(uint8[i - 1] & 0x0f) << 2];\n result += \"=\";\n }\n return result;\n}\n/**\n * Decodes a base64-encoded string.\n *\n * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-4}\n *\n * @param b64 The base64-encoded string to decode.\n * @returns The decoded data.\n *\n * @example Usage\n * ```ts\n * import { decodeBase64 } from \"@std/encoding/base64\";\n * import { assertEquals } from \"@std/assert/assert-equals\";\n *\n * assertEquals(\n * decodeBase64(\"Zm9vYmFy\"),\n * new TextEncoder().encode(\"foobar\")\n * );\n * ```\n */ export function decodeBase64(b64) {\n const binString = atob(b64);\n const size = binString.length;\n const bytes = new Uint8Array(size);\n for(let i = 0; i < size; i++){\n bytes[i] = binString.charCodeAt(i);\n }\n return bytes;\n}\n//# sourceMappingURL=base64.js.map","import { decodeBase64, encodeBase64 } from \"@jsr/std__encoding/base64\";\nimport { NSchema as n } from \"../NSchema.js\";\n/** Nostr base64 helper utilities. */ export class N64 {\n /** Encode an event as a base64 string. */ static encodeEvent(event) {\n return encodeBase64(JSON.stringify(event));\n }\n /** Decode an event from a base64 string. Validates the event's structure but does not verify its signature. */ static decodeEvent(base64) {\n const bytes = decodeBase64(base64);\n const text = new TextDecoder().decode(bytes);\n return n.json().pipe(n.event()).parse(text);\n }\n}\n//# sourceMappingURL=N64.js.map","import { encodeHex } from \"@jsr/std__encoding/hex\";\nimport { verifyEvent as _verifyEvent } from \"nostr-tools\";\nimport { N64 } from \"./utils/N64.js\";\n/** [NIP-98](https://github.com/nostr-protocol/nips/blob/master/98.md) HTTP auth. */ export class NIP98 {\n /** Generate an auth event template from a Request. */ static async template(request, opts) {\n const { validatePayload = [\n 'POST',\n 'PUT',\n 'PATCH'\n ].includes(request.method) } = opts ?? {};\n const { method, url } = request;\n const tags = [\n [\n 'method',\n method\n ],\n [\n 'u',\n url\n ]\n ];\n if (validatePayload) {\n const buffer = await request.clone().arrayBuffer();\n const digest = await crypto.subtle.digest('SHA-256', buffer);\n tags.push([\n 'payload',\n encodeHex(digest)\n ]);\n }\n return {\n kind: 27235,\n content: '',\n tags,\n created_at: Math.floor(Date.now() / 1000)\n };\n }\n /** Compare the auth event with the request, throwing a human-readable error if validation fails. */ static async verify(request, opts) {\n const { maxAge = 60_000, validatePayload = [\n 'POST',\n 'PUT',\n 'PATCH'\n ].includes(request.method), verifyEvent = _verifyEvent } = opts ?? {};\n const header = request.headers.get('authorization');\n if (!header) {\n throw new Error('Missing Nostr authorization header');\n }\n const token = header.match(/^Nostr (.+)$/)?.[1];\n if (!token) {\n throw new Error('Missing Nostr authorization token');\n }\n const event = N64.decodeEvent(token);\n if (!verifyEvent(event)) {\n throw new Error('Event signature is invalid');\n }\n const age = Date.now() - event.created_at * 1_000;\n const u = event.tags.find(([name])=>name === 'u')?.[1];\n const method = event.tags.find(([name])=>name === 'method')?.[1];\n const payload = event.tags.find(([name])=>name === 'payload')?.[1];\n if (event.kind !== 27235) {\n throw new Error('Event must be kind 27235');\n }\n if (u !== request.url) {\n throw new Error('Event URL does not match request URL');\n }\n if (method !== request.method) {\n throw new Error('Event method does not match HTTP request method');\n }\n if (age >= maxAge) {\n throw new Error('Event expired');\n }\n if (validatePayload && payload !== undefined) {\n const buffer = await request.clone().arrayBuffer();\n const digest = await crypto.subtle.digest('SHA-256', buffer);\n if (encodeHex(digest) !== payload) {\n throw new Error('Event payload does not match request body');\n }\n }\n return event;\n }\n}\n//# sourceMappingURL=NIP98.js.map","export class NKinds {\n /** Events are **regular**, which means they're all expected to be stored by relays. */ static regular(kind) {\n return 1000 <= kind && kind < 10000 || [\n 1,\n 2,\n 4,\n 5,\n 6,\n 7,\n 8,\n 16,\n 40,\n 41,\n 42,\n 43,\n 44\n ].includes(kind);\n }\n /** Events are **replaceable**, which means that, for each combination of `pubkey` and `kind`, only the latest event is expected to (SHOULD) be stored by relays, older versions are expected to be discarded. */ static replaceable(kind) {\n return 10000 <= kind && kind < 20000 || [\n 0,\n 3\n ].includes(kind);\n }\n /** Events are **ephemeral**, which means they are not expected to be stored by relays. */ static ephemeral(kind) {\n return 20000 <= kind && kind < 30000;\n }\n /** Events are **parameterized replaceable**, which means that, for each combination of `pubkey`, `kind` and the `d` tag, only the latest event is expected to be stored by relays, older versions are expected to be discarded. */ static parameterizedReplaceable(kind) {\n return 30000 <= kind && kind < 40000;\n }\n}\n//# sourceMappingURL=NKinds.js.map","import { hash as assertHash, number as assertNumber } from './_assert.js';\nimport { hmac } from './hmac.js';\nimport { createView, toBytes, checkOpts, asyncLoop } from './utils.js';\n// Common prologue and epilogue for sync/async functions\nfunction pbkdf2Init(hash, _password, _salt, _opts) {\n assertHash(hash);\n const opts = checkOpts({ dkLen: 32, asyncTick: 10 }, _opts);\n const { c, dkLen, asyncTick } = opts;\n assertNumber(c);\n assertNumber(dkLen);\n assertNumber(asyncTick);\n if (c < 1)\n throw new Error('PBKDF2: iterations (c) should be >= 1');\n const password = toBytes(_password);\n const salt = toBytes(_salt);\n // DK = PBKDF2(PRF, Password, Salt, c, dkLen);\n const DK = new Uint8Array(dkLen);\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n const PRF = hmac.create(hash, password);\n const PRFSalt = PRF._cloneInto().update(salt);\n return { c, dkLen, asyncTick, DK, PRF, PRFSalt };\n}\nfunction pbkdf2Output(PRF, PRFSalt, DK, prfW, u) {\n PRF.destroy();\n PRFSalt.destroy();\n if (prfW)\n prfW.destroy();\n u.fill(0);\n return DK;\n}\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function\n * @param hash - hash function that would be used e.g. sha256\n * @param password - password from which a derived key is generated\n * @param salt - cryptographic salt\n * @param opts - {c, dkLen} where c is work factor and dkLen is output message size\n */\nexport function pbkdf2(hash, password, salt, opts) {\n const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + ⋯ + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n for (let ui = 1; ui < c; ui++) {\n // Uc = PRF(Password, Uc−1)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++)\n Ti[i] ^= u[i];\n }\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\nexport async function pbkdf2Async(hash, password, salt, opts) {\n const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + ⋯ + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n await asyncLoop(c - 1, asyncTick, () => {\n // Uc = PRF(Password, Uc−1)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++)\n Ti[i] ^= u[i];\n });\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n//# sourceMappingURL=pbkdf2.js.map","/*! scure-bip39 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */\nimport { bytes as assertBytes, number as assertNumber } from '@noble/hashes/_assert';\nimport { pbkdf2, pbkdf2Async } from '@noble/hashes/pbkdf2';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { sha512 } from '@noble/hashes/sha512';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { utils as baseUtils } from '@scure/base';\n// Japanese wordlist\nconst isJapanese = (wordlist) => wordlist[0] === '\\u3042\\u3044\\u3053\\u304f\\u3057\\u3093';\n// Normalization replaces equivalent sequences of characters\n// so that any two texts that are equivalent will be reduced\n// to the same sequence of code points, called the normal form of the original text.\n// https://tonsky.me/blog/unicode/#why-is-a----\nfunction nfkd(str) {\n if (typeof str !== 'string')\n throw new TypeError(`Invalid mnemonic type: ${typeof str}`);\n return str.normalize('NFKD');\n}\nfunction normalize(str) {\n const norm = nfkd(str);\n const words = norm.split(' ');\n if (![12, 15, 18, 21, 24].includes(words.length))\n throw new Error('Invalid mnemonic');\n return { nfkd: norm, words };\n}\nfunction assertEntropy(entropy) {\n assertBytes(entropy, 16, 20, 24, 28, 32);\n}\n/**\n * Generate x random words. Uses Cryptographically-Secure Random Number Generator.\n * @param wordlist imported wordlist for specific language\n * @param strength mnemonic strength 128-256 bits\n * @example\n * generateMnemonic(wordlist, 128)\n * // 'legal winner thank year wave sausage worth useful legal winner thank yellow'\n */\nexport function generateMnemonic(wordlist, strength = 128) {\n assertNumber(strength);\n if (strength % 32 !== 0 || strength > 256)\n throw new TypeError('Invalid entropy');\n return entropyToMnemonic(randomBytes(strength / 8), wordlist);\n}\nconst calcChecksum = (entropy) => {\n // Checksum is ent.length/4 bits long\n const bitsLeft = 8 - entropy.length / 4;\n // Zero rightmost \"bitsLeft\" bits in byte\n // For example: bitsLeft=4 val=10111101 -> 10110000\n return new Uint8Array([(sha256(entropy)[0] >> bitsLeft) << bitsLeft]);\n};\nfunction getCoder(wordlist) {\n if (!Array.isArray(wordlist) || wordlist.length !== 2048 || typeof wordlist[0] !== 'string')\n throw new Error('Wordlist: expected array of 2048 strings');\n wordlist.forEach((i) => {\n if (typeof i !== 'string')\n throw new Error(`Wordlist: non-string element: ${i}`);\n });\n return baseUtils.chain(baseUtils.checksum(1, calcChecksum), baseUtils.radix2(11, true), baseUtils.alphabet(wordlist));\n}\n/**\n * Reversible: Converts mnemonic string to raw entropy in form of byte array.\n * @param mnemonic 12-24 words\n * @param wordlist imported wordlist for specific language\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * mnemonicToEntropy(mnem, wordlist)\n * // Produces\n * new Uint8Array([\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f,\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f\n * ])\n */\nexport function mnemonicToEntropy(mnemonic, wordlist) {\n const { words } = normalize(mnemonic);\n const entropy = getCoder(wordlist).decode(words);\n assertEntropy(entropy);\n return entropy;\n}\n/**\n * Reversible: Converts raw entropy in form of byte array to mnemonic string.\n * @param entropy byte array\n * @param wordlist imported wordlist for specific language\n * @returns 12-24 words\n * @example\n * const ent = new Uint8Array([\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f,\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f\n * ]);\n * entropyToMnemonic(ent, wordlist);\n * // 'legal winner thank year wave sausage worth useful legal winner thank yellow'\n */\nexport function entropyToMnemonic(entropy, wordlist) {\n assertEntropy(entropy);\n const words = getCoder(wordlist).encode(entropy);\n return words.join(isJapanese(wordlist) ? '\\u3000' : ' ');\n}\n/**\n * Validates mnemonic for being 12-24 words contained in `wordlist`.\n */\nexport function validateMnemonic(mnemonic, wordlist) {\n try {\n mnemonicToEntropy(mnemonic, wordlist);\n }\n catch (e) {\n return false;\n }\n return true;\n}\nconst salt = (passphrase) => nfkd(`mnemonic${passphrase}`);\n/**\n * Irreversible: Uses KDF to derive 64 bytes of key data from mnemonic + optional password.\n * @param mnemonic 12-24 words\n * @param passphrase string that will additionally protect the key\n * @returns 64 bytes of key data\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * await mnemonicToSeed(mnem, 'password');\n * // new Uint8Array([...64 bytes])\n */\nexport function mnemonicToSeed(mnemonic, passphrase = '') {\n return pbkdf2Async(sha512, normalize(mnemonic).nfkd, salt(passphrase), { c: 2048, dkLen: 64 });\n}\n/**\n * Irreversible: Uses KDF to derive 64 bytes of key data from mnemonic + optional password.\n * @param mnemonic 12-24 words\n * @param passphrase string that will additionally protect the key\n * @returns 64 bytes of key data\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * mnemonicToSeedSync(mnem, 'password');\n * // new Uint8Array([...64 bytes])\n */\nexport function mnemonicToSeedSync(mnemonic, passphrase = '') {\n return pbkdf2(sha512, normalize(mnemonic).nfkd, salt(passphrase), { c: 2048, dkLen: 64 });\n}\n","import { mnemonicToSeedSync } from \"@scure/bip39\";\nimport { NSeedSigner } from \"./NSeedSigner.js\";\n/**\n * Similar to `NSecSigner`, but it accepts a BIP-39 mnemonic seed phrase which it uses to derive the secret key according to [NIP-06](https://github.com/nostr-protocol/nips/blob/master/06.md).\n *\n * ```ts\n * const signer = new NPhraseSigner('abandon baby cabbage dad ...', {\n * account: 0, // Optional account number. Default is 0.\n * passphrase: 'very special mother', // Optional passphrase. Default is no passphrase.\n * });\n *\n * const pubkey = await signer.getPublicKey();\n * const event = await signer.signEvent({ content: 'Hello, world!', kind: 1, ... });\n```\n */ export class NPhraseSigner extends NSeedSigner {\n constructor(mnemonic, opts = {}){\n const { account, passphrase } = opts;\n const seed = mnemonicToSeedSync(mnemonic, passphrase);\n super(seed, account);\n }\n}\n//# sourceMappingURL=NPhraseSigner.js.map","/**\n * Infinite async generator. Iterates messages pushed to it until closed.\n * Only one consumer is expected to use a Machina instance at a time.\n *\n * @example\n * ```ts\n * // Create the Machina instance\n * const machina = new Machina();\n *\n * // Async generator loop\n * async function getMessages() {\n * for await (const msg of machina.stream()) {\n * console.log(msg);\n * }\n * }\n *\n * // Start the generator\n * getMessages();\n *\n * // Push messages to it\n * machina.push('hello!');\n * machina.push('whats up?');\n * machina.push('greetings');\n * ```\n */ var _computedKey;\n_computedKey = Symbol.asyncIterator;\nexport class Machina {\n #queue = [];\n #resolve;\n #aborted = false;\n constructor(signal){\n if (signal?.aborted) {\n this.abort();\n } else {\n signal?.addEventListener('abort', ()=>this.abort(), {\n once: true\n });\n }\n }\n /** Get messages as an AsyncIterable. */ async *[_computedKey]() {\n while(!this.#aborted){\n if (this.#queue.length) {\n yield this.#queue.shift();\n continue;\n }\n await new Promise((_resolve)=>{\n this.#resolve = _resolve;\n });\n }\n throw new DOMException('The signal has been aborted', 'AbortError');\n }\n /** Push a message into the Machina instance, making it available to the consumer of `stream()`. */ push(data) {\n this.#queue.push(data);\n this.#resolve?.();\n }\n /** Stops streaming and throws an error to the consumer. */ abort() {\n this.#aborted = true;\n this.#resolve?.();\n }\n}\n//# sourceMappingURL=Machina.js.map","var _computedKey;\nimport { getFilterLimit } from \"nostr-tools\";\nimport { Machina } from \"./utils/Machina.js\";\nimport { NKinds } from \"./NKinds.js\";\nimport { NSet } from \"./NSet.js\";\n_computedKey = Symbol.asyncDispose;\n/**\n * The `NPool` class is a `NRelay` implementation for connecting to multiple relays.\n *\n * ```ts\n * const pool = new NPool({\n * open: (url) => new NRelay1(url),\n * reqRouter: async (filters) => new Map([\n * ['wss://relay1.mostr.pub', filters],\n * ['wss://relay2.mostr.pub', filters],\n * ]),\n * eventRouter: async (event) => ['wss://relay1.mostr.pub', 'wss://relay2.mostr.pub'],\n * });\n *\n * // Now you can use the pool like a regular relay.\n * for await (const msg of pool.req([{ kinds: [1] }])) {\n * if (msg[0] === 'EVENT') console.log(msg[2]);\n * if (msg[0] === 'EOSE') break;\n * }\n * ```\n *\n * This class is designed with the Outbox model in mind.\n * Instead of passing relay URLs into each method, you pass functions into the contructor that statically-analyze filters and events to determine which relays to use for requesting and publishing events.\n * If a relay wasn't already connected, it will be opened automatically.\n * Defining `open` will also let you use any relay implementation, such as `NRelay1`.\n *\n * Note that `pool.req` may stream duplicate events, while `pool.query` will correctly process replaceable events and deletions within the event set before returning them.\n *\n * `pool.req` will only emit an `EOSE` when all relays in its set have emitted an `EOSE`, and likewise for `CLOSED`.\n */ export class NPool {\n opts;\n _relays;\n constructor(opts){\n this.opts = opts;\n this._relays = new Map();\n }\n /** Get or create a relay instance for the given URL. */ relay(url) {\n const relay = this._relays.get(url);\n if (relay) {\n return relay;\n } else {\n const relay = this.opts.open(url);\n this._relays.set(url, relay);\n return relay;\n }\n }\n get relays() {\n return this._relays;\n }\n async *req(filters, opts) {\n const controller = new AbortController();\n const signal = opts?.signal ? AbortSignal.any([\n opts.signal,\n controller.signal\n ]) : controller.signal;\n const routes = await this.opts.reqRouter(filters);\n if (routes.size < 1) {\n return;\n }\n const machina = new Machina(signal);\n const eoses = new Set();\n const closes = new Set();\n for (const [url, filters] of routes.entries()){\n const relay = this.relay(url);\n (async ()=>{\n for await (const msg of relay.req(filters, {\n signal\n })){\n if (msg[0] === 'EOSE') {\n eoses.add(url);\n if (eoses.size === routes.size) {\n machina.push(msg);\n }\n }\n if (msg[0] === 'CLOSED') {\n closes.add(url);\n if (closes.size === routes.size) {\n machina.push(msg);\n }\n }\n if (msg[0] === 'EVENT') {\n machina.push(msg);\n }\n }\n })().catch(()=>{});\n }\n try {\n for await (const msg of machina){\n yield msg;\n }\n } finally{\n controller.abort();\n }\n }\n async event(event, opts) {\n const relayUrls = await this.opts.eventRouter(event);\n if (relayUrls.length < 1) {\n return;\n }\n await Promise.any(relayUrls.map((url)=>this.relay(url).event(event, opts)));\n }\n async query(filters, opts) {\n const events = new NSet();\n const limit = filters.reduce((result, filter)=>result + getFilterLimit(filter), 0);\n if (limit === 0) return [];\n const replaceable = filters.reduce((result, filter)=>{\n return result || !!filter.kinds?.some((k)=>NKinds.replaceable(k) || NKinds.parameterizedReplaceable(k));\n }, false);\n try {\n for await (const msg of this.req(filters, opts)){\n if (msg[0] === 'EOSE') break;\n if (msg[0] === 'EVENT') events.add(msg[2]);\n if (msg[0] === 'CLOSED') throw new Error('Subscription closed');\n if (!replaceable && events.size >= limit) {\n break;\n }\n }\n } catch (_) {\n // Skip errors, return partial results.\n }\n return [\n ...events\n ];\n }\n /** Close all the relays in the pool. */ async close() {\n await Promise.all([\n ...this._relays.values()\n ].map((relay)=>relay.close()));\n }\n async [_computedKey]() {\n await this.close();\n }\n}\n//# sourceMappingURL=NPool.js.map","/**\n * ExponentialBackoff increases the backoff-time exponentially.\n * An optional maximum can be provided as an upper bound to the\n * exponent and thus to the returned backoff.\n *\n * The series can be described as ('i' is the current step/retry):\n * backoff = base * 2^i | without bound\n * backoff = base * 2^min(i, expMax) | with bound\n *\n * Example:\n *\n * 1) Without bound:\n * base = 1000, expMax = undefined\n * backoff = 1000 * 2^0 = 1000 // first retry\n * backoff = 1000 * 2^1 = 2000 // second retry\n * backoff = 1000 * 2^2 = 4000 // ...doubles with every retry\n * backoff = 1000 * 2^3 = 8000\n * backoff = 1000 * 2^4 = 16000\n * ... // and so on\n *\n * 2) With bound:\n * base = 1000, expMax = 3\n * backoff = 1000 * 2^0 = 1000 // first retry\n * backoff = 1000 * 2^1 = 2000 // second retry\n * backoff = 1000 * 2^2 = 4000 // third retry\n * backoff = 1000 * 2^3 = 8000 // maximum reached, don't increase further\n * backoff = 1000 * 2^3 = 8000\n * backoff = 1000 * 2^3 = 8000\n * ... // and so on\n */\nexport class ExponentialBackoff {\n /**\n * Creates a new ExponentialBackoff.\n * @param base the base of the exponentiation\n * @param expMax the maximum exponent, no bound if undefined\n */\n constructor(base, expMax) {\n this._retries = 0;\n if (!Number.isInteger(base) || base < 0) {\n throw new Error(\"Base must be a positive integer or zero\");\n }\n if (expMax !== undefined && (!Number.isInteger(expMax) || expMax < 0)) {\n throw new Error(\"ExpMax must be a undefined, a positive integer or zero\");\n }\n this.base = base;\n this.expMax = expMax;\n this.i = 0;\n }\n get retries() {\n return this._retries;\n }\n get current() {\n return this.base * Math.pow(2, this.i);\n }\n next() {\n this._retries++;\n this.i =\n this.expMax === undefined\n ? this.i + 1\n : Math.min(this.i + 1, this.expMax);\n return this.current;\n }\n reset() {\n this._retries = 0;\n this.i = 0;\n }\n}\n//# sourceMappingURL=exponentialbackoff.js.map","/**\n * An array queue is a queue that has an unbounded capacity. Reading from an array queue\n * will return the oldest element and effectively remove it from the queue.\n */\nexport class ArrayQueue {\n constructor() {\n this.elements = [];\n }\n add(element) {\n this.elements.push(element);\n }\n clear() {\n this.elements.length = 0;\n }\n forEach(fn) {\n this.elements.forEach(fn);\n }\n length() {\n return this.elements.length;\n }\n isEmpty() {\n return this.elements.length === 0;\n }\n peek() {\n return this.elements[0];\n }\n read() {\n return this.elements.shift();\n }\n}\n//# sourceMappingURL=array_queue.js.map","/**\n * Events that can be fired by the websocket.\n */\nexport var WebsocketEvent;\n(function (WebsocketEvent) {\n /** Fired when the connection is opened. */\n WebsocketEvent[\"open\"] = \"open\";\n /** Fired when the connection is closed. */\n WebsocketEvent[\"close\"] = \"close\";\n /** Fired when the connection has been closed because of an error, such as when some data couldn't be sent. */\n WebsocketEvent[\"error\"] = \"error\";\n /** Fired when a message is received. */\n WebsocketEvent[\"message\"] = \"message\";\n /** Fired when the websocket tries to reconnect after a connection loss. */\n WebsocketEvent[\"retry\"] = \"retry\";\n /** Fired when the websocket successfully reconnects after a connection loss. */\n WebsocketEvent[\"reconnect\"] = \"reconnect\";\n})(WebsocketEvent || (WebsocketEvent = {}));\n//# sourceMappingURL=websocket_event.js.map","import { WebsocketEvent, } from \"./websocket_event\";\n/**\n * A websocket wrapper that can be configured to reconnect automatically and buffer messages when the websocket is not connected.\n */\nexport class Websocket {\n /**\n * Creates a new websocket.\n *\n * @param url to connect to.\n * @param protocols optional protocols to use.\n * @param options optional options to use.\n */\n constructor(url, protocols, options) {\n var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k, _l, _m, _o, _p, _q;\n this._closedByUser = false; // whether the websocket was closed by the user\n /**\n * Handles the 'open' event of the browser-native websocket.\n * @param event to handle.\n */\n this.handleOpenEvent = (event) => this.handleEvent(WebsocketEvent.open, event);\n /**\n * Handles the 'error' event of the browser-native websocket.\n * @param event to handle.\n */\n this.handleErrorEvent = (event) => this.handleEvent(WebsocketEvent.error, event);\n /**\n * Handles the 'close' event of the browser-native websocket.\n * @param event to handle.\n */\n this.handleCloseEvent = (event) => this.handleEvent(WebsocketEvent.close, event);\n /**\n * Handles the 'message' event of the browser-native websocket.\n * @param event to handle.\n */\n this.handleMessageEvent = (event) => this.handleEvent(WebsocketEvent.message, event);\n this._url = url;\n this._protocols = protocols;\n // make a copy of the options to prevent the user from changing them\n this._options = {\n buffer: options === null || options === void 0 ? void 0 : options.buffer,\n retry: {\n maxRetries: (_a = options === null || options === void 0 ? void 0 : options.retry) === null || _a === void 0 ? void 0 : _a.maxRetries,\n instantReconnect: (_b = options === null || options === void 0 ? void 0 : options.retry) === null || _b === void 0 ? void 0 : _b.instantReconnect,\n backoff: (_c = options === null || options === void 0 ? void 0 : options.retry) === null || _c === void 0 ? void 0 : _c.backoff,\n },\n listeners: {\n open: [...((_e = (_d = options === null || options === void 0 ? void 0 : options.listeners) === null || _d === void 0 ? void 0 : _d.open) !== null && _e !== void 0 ? _e : [])],\n close: [...((_g = (_f = options === null || options === void 0 ? void 0 : options.listeners) === null || _f === void 0 ? void 0 : _f.close) !== null && _g !== void 0 ? _g : [])],\n error: [...((_j = (_h = options === null || options === void 0 ? void 0 : options.listeners) === null || _h === void 0 ? void 0 : _h.error) !== null && _j !== void 0 ? _j : [])],\n message: [...((_l = (_k = options === null || options === void 0 ? void 0 : options.listeners) === null || _k === void 0 ? void 0 : _k.message) !== null && _l !== void 0 ? _l : [])],\n retry: [...((_o = (_m = options === null || options === void 0 ? void 0 : options.listeners) === null || _m === void 0 ? void 0 : _m.retry) !== null && _o !== void 0 ? _o : [])],\n reconnect: [...((_q = (_p = options === null || options === void 0 ? void 0 : options.listeners) === null || _p === void 0 ? void 0 : _p.reconnect) !== null && _q !== void 0 ? _q : [])],\n },\n };\n this._underlyingWebsocket = this.tryConnect();\n }\n /**\n * Getter for the url.\n *\n * @return the url.\n */\n get url() {\n return this._url;\n }\n /**\n * Getter for the protocols.\n *\n * @return the protocols, or undefined if none were provided.\n */\n get protocols() {\n return this._protocols;\n }\n /**\n * Getter for the buffer.\n *\n * @return the buffer, or undefined if none was provided.\n */\n get buffer() {\n return this._options.buffer;\n }\n /**\n * Getter for the maxRetries.\n *\n * @return the maxRetries, or undefined if none was provided (no limit).\n */\n get maxRetries() {\n return this._options.retry.maxRetries;\n }\n /**\n * Getter for the instantReconnect.\n *\n * @return the instantReconnect, or undefined if none was provided.\n */\n get instantReconnect() {\n return this._options.retry.instantReconnect;\n }\n /**\n * Getter for the backoff.\n *\n * @return the backoff, or undefined if none was provided.\n */\n get backoff() {\n return this._options.retry.backoff;\n }\n /**\n * Whether the websocket was closed by the user. A websocket is closed by the user if the close().\n *\n * @return true if the websocket was closed by the user, false otherwise.\n */\n get closedByUser() {\n return this._closedByUser;\n }\n /**\n * Getter for the last 'open' event, e.g. the last time the websocket was connected.\n *\n * @return the last 'open' event, or undefined if the websocket was never connected.\n */\n get lastConnection() {\n return this._lastConnection;\n }\n /**\n * Getter for the underlying websocket. This can be used to access the browser's native websocket directly.\n *\n * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket\n * @return the underlying websocket.\n */\n get underlyingWebsocket() {\n return this._underlyingWebsocket;\n }\n /**\n * Getter for the readyState of the underlying websocket.\n *\n * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/readyState\n * @return the readyState of the underlying websocket.\n */\n get readyState() {\n return this._underlyingWebsocket.readyState;\n }\n /**\n * Getter for the bufferedAmount of the underlying websocket.\n *\n * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/bufferedAmount\n * @return the bufferedAmount of the underlying websocket.\n */\n get bufferedAmount() {\n return this._underlyingWebsocket.bufferedAmount;\n }\n /**\n * Getter for the extensions of the underlying websocket.\n *\n * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/extensions\n * @return the extensions of the underlying websocket.\n */\n get extensions() {\n return this._underlyingWebsocket.extensions;\n }\n /**\n * Getter for the binaryType of the underlying websocket.\n *\n * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/binaryType\n * @return the binaryType of the underlying websocket.\n */\n get binaryType() {\n return this._underlyingWebsocket.binaryType;\n }\n /**\n * Setter for the binaryType of the underlying websocket.\n *\n * @param value to set, 'blob' or 'arraybuffer'.\n */\n set binaryType(value) {\n this._underlyingWebsocket.binaryType = value;\n }\n /**\n * Sends data over the websocket.\n *\n * If the websocket is not connected and a buffer was provided on creation, the data will be added to the buffer.\n * If no buffer was provided or the websocket was closed by the user, the data will be dropped.\n *\n * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/send\n * @param data to send.\n */\n send(data) {\n if (this.closedByUser)\n return; // no-op if closed by user\n if (this._underlyingWebsocket.readyState === this._underlyingWebsocket.OPEN) {\n this._underlyingWebsocket.send(data); // websocket is connected, send data\n }\n else if (this.buffer !== undefined) {\n this.buffer.add(data); // websocket is not connected, add data to buffer\n }\n }\n /**\n * Close the websocket. No connection-retry will be attempted after this.\n *\n * @see https://developer.mozilla.org/en-US/docs/Web/API/WebSocket/close\n * @param code optional close code.\n * @param reason optional close reason.\n */\n close(code, reason) {\n this.cancelScheduledConnectionRetry(); // cancel any scheduled retries\n this._closedByUser = true; // mark websocket as closed by user\n this._underlyingWebsocket.close(code, reason); // close underlying websocket with provided code and reason\n }\n /**\n * Adds an event listener for the given event-type.\n *\n * @see https://developer.mozilla.org/en-US/docs/Web/API/EventTarget/addEventListener\n * @param type of the event to add the listener for.\n * @param listener to add.\n * @param options to use when adding the listener.\n */\n addEventListener(type, listener, options) {\n this._options.listeners[type].push({ listener, options }); // add listener to list of listeners\n }\n /**\n * Removes one or more event listener for the given event-type that match the given listener and options.\n *\n * @param type of the event to remove the listener for.\n * @param listener to remove.\n * @param options that were used when the listener was added.\n */\n removeEventListener(type, listener, options) {\n const isListenerNotToBeRemoved = (l) => l.listener !== listener || l.options !== options;\n this._options.listeners[type] =\n this._options.listeners[type].filter(isListenerNotToBeRemoved); // only keep listeners that are not to be removed\n }\n /**\n * Creates a new browser-native websocket and connects it to the given URL with the given protocols\n * and adds all event listeners to the browser-native websocket.\n *\n * @return the created browser-native websocket which is also stored in the '_underlyingWebsocket' property.\n */\n tryConnect() {\n this._underlyingWebsocket = new WebSocket(this.url, this.protocols); // create new browser-native websocket and add all event listeners\n this._underlyingWebsocket.addEventListener(WebsocketEvent.open, this.handleOpenEvent);\n this._underlyingWebsocket.addEventListener(WebsocketEvent.close, this.handleCloseEvent);\n this._underlyingWebsocket.addEventListener(WebsocketEvent.error, this.handleErrorEvent);\n this._underlyingWebsocket.addEventListener(WebsocketEvent.message, this.handleMessageEvent);\n return this._underlyingWebsocket;\n }\n /**\n * Removes all event listeners from the browser-native websocket and closes it.\n */\n clearWebsocket() {\n this._underlyingWebsocket.removeEventListener(WebsocketEvent.open, this.handleOpenEvent);\n this._underlyingWebsocket.removeEventListener(WebsocketEvent.close, this.handleCloseEvent);\n this._underlyingWebsocket.removeEventListener(WebsocketEvent.error, this.handleErrorEvent);\n this._underlyingWebsocket.removeEventListener(WebsocketEvent.message, this.handleMessageEvent);\n this._underlyingWebsocket.close();\n }\n /**\n * Dispatch an event to all listeners of the given event-type.\n *\n * @param type of the event to dispatch.\n * @param event to dispatch.\n */\n dispatchEvent(type, event) {\n const eventListeners = this._options.listeners[type];\n const newEventListeners = [];\n eventListeners.forEach(({ listener, options }) => {\n listener(this, event); // invoke listener with event\n if (options === undefined ||\n options.once === undefined ||\n !options.once) {\n newEventListeners.push({ listener, options }); // only keep listener if it isn't a once-listener\n }\n });\n this._options.listeners[type] = newEventListeners; // replace old listeners with new listeners that don't include once-listeners\n }\n /**\n * Handles the given event by dispatching it to all listeners of the given event-type.\n *\n * @param type of the event to handle.\n * @param event to handle.\n */\n handleEvent(type, event) {\n switch (type) {\n case WebsocketEvent.close:\n this.dispatchEvent(type, event);\n this.scheduleConnectionRetryIfNeeded(); // schedule a new connection retry if the websocket was closed by the server\n break;\n case WebsocketEvent.open:\n if (this.backoff !== undefined && this._lastConnection !== undefined) {\n // websocket was reconnected, dispatch reconnect event and reset backoff\n const detail = {\n retries: this.backoff.retries,\n lastConnection: new Date(this._lastConnection),\n };\n const event = new CustomEvent(WebsocketEvent.reconnect, {\n detail,\n });\n this.dispatchEvent(WebsocketEvent.reconnect, event);\n this.backoff.reset();\n }\n this._lastConnection = new Date();\n this.dispatchEvent(type, event); // dispatch open event and send buffered data\n this.sendBufferedData();\n break;\n case WebsocketEvent.retry:\n this.dispatchEvent(type, event); // dispatch retry event and try to connect\n this.clearWebsocket(); // clear the old websocket\n this.tryConnect();\n break;\n default:\n this.dispatchEvent(type, event); // dispatch event to all listeners of the given event-type\n break;\n }\n }\n /**\n * Sends buffered data if there is a buffer defined.\n */\n sendBufferedData() {\n if (this.buffer === undefined) {\n return; // no buffer defined, nothing to send\n }\n for (let ele = this.buffer.read(); ele !== undefined; ele = this.buffer.read()) {\n this.send(ele); // send buffered data\n }\n }\n /**\n * Schedules a connection-retry if there is a backoff defined and the websocket was not closed by the user.\n */\n scheduleConnectionRetryIfNeeded() {\n if (this.closedByUser) {\n return; // user closed the websocket, no retry\n }\n if (this.backoff === undefined) {\n return; // no backoff defined, no retry\n }\n // handler dispatches the retry event to all listeners of the retry event-type\n const handleRetryEvent = (detail) => {\n const event = new CustomEvent(WebsocketEvent.retry, { detail });\n this.handleEvent(WebsocketEvent.retry, event);\n };\n // create retry event detail, depending on the 'instantReconnect' option\n const retryEventDetail = {\n backoff: this._options.retry.instantReconnect === true ? 0 : this.backoff.next(),\n retries: this._options.retry.instantReconnect === true\n ? 0\n : this.backoff.retries,\n lastConnection: this._lastConnection,\n };\n // schedule a new connection-retry if the maximum number of retries is not reached yet\n if (this._options.retry.maxRetries === undefined ||\n retryEventDetail.retries <= this._options.retry.maxRetries) {\n this.retryTimeout = globalThis.setTimeout(() => handleRetryEvent(retryEventDetail), retryEventDetail.backoff);\n }\n }\n /**\n * Cancels the scheduled connection-retry, if there is one.\n */\n cancelScheduledConnectionRetry() {\n globalThis.clearTimeout(this.retryTimeout);\n }\n}\n//# sourceMappingURL=websocket.js.map","import { WebsocketEvent, } from \"./websocket_event\";\nimport { Websocket } from \"./websocket\";\n/**\n * Builder for websockets.\n */\nexport class WebsocketBuilder {\n /**\n * Creates a new WebsocketBuilder.\n *\n * @param url the url to connect to\n */\n constructor(url) {\n this._url = url;\n }\n /**\n * Getter for the url.\n *\n * @returns the url\n */\n get url() {\n return this._url;\n }\n /**\n * Adds protocols to the websocket. Subsequent calls to this method will override the previously set protocols.\n *\n * @param protocols the protocols to add\n */\n withProtocols(protocols) {\n this._protocols = protocols;\n return this;\n }\n /**\n * Getter for the protocols.\n *\n * @returns the protocols, undefined if no protocols have been set\n */\n get protocols() {\n return this._protocols;\n }\n /**\n * Sets the maximum number of retries before giving up. No limit if undefined.\n *\n * @param maxRetries the maximum number of retries before giving up\n */\n withMaxRetries(maxRetries) {\n var _a;\n this._options = Object.assign(Object.assign({}, this._options), { retry: Object.assign(Object.assign({}, (_a = this._options) === null || _a === void 0 ? void 0 : _a.retry), { maxRetries }) });\n return this;\n }\n /**\n * Getter for the maximum number of retries before giving up.\n *\n * @returns the maximum number of retries before giving up, undefined if no maximum has been set\n */\n get maxRetries() {\n var _a, _b;\n return (_b = (_a = this._options) === null || _a === void 0 ? void 0 : _a.retry) === null || _b === void 0 ? void 0 : _b.maxRetries;\n }\n /**\n * Sets wether to reconnect immediately after a connection has been lost, ignoring the backoff strategy for the first retry.\n *\n * @param instantReconnect wether to reconnect immediately after a connection has been lost\n */\n withInstantReconnect(instantReconnect) {\n var _a;\n this._options = Object.assign(Object.assign({}, this._options), { retry: Object.assign(Object.assign({}, (_a = this._options) === null || _a === void 0 ? void 0 : _a.retry), { instantReconnect }) });\n return this;\n }\n /**\n * Getter for wether to reconnect immediately after a connection has been lost, ignoring the backoff strategy for the first retry.\n *\n * @returns wether to reconnect immediately after a connection has been lost, undefined if no value has been set\n */\n get instantReconnect() {\n var _a, _b;\n return (_b = (_a = this._options) === null || _a === void 0 ? void 0 : _a.retry) === null || _b === void 0 ? void 0 : _b.instantReconnect;\n }\n /**\n * Adds a backoff to the websocket. Subsequent calls to this method will override the previously set backoff.\n *\n * @param backoff the backoff to add\n */\n withBackoff(backoff) {\n var _a;\n this._options = Object.assign(Object.assign({}, this._options), { retry: Object.assign(Object.assign({}, (_a = this._options) === null || _a === void 0 ? void 0 : _a.retry), { backoff }) });\n return this;\n }\n /**\n * Getter for the backoff.\n *\n * @returns the backoff, undefined if no backoff has been set\n */\n get backoff() {\n var _a, _b;\n return (_b = (_a = this._options) === null || _a === void 0 ? void 0 : _a.retry) === null || _b === void 0 ? void 0 : _b.backoff;\n }\n /**\n * Adds a buffer to the websocket. Subsequent calls to this method will override the previously set buffer.\n *\n * @param buffer the buffer to add\n */\n withBuffer(buffer) {\n this._options = Object.assign(Object.assign({}, this._options), { buffer });\n return this;\n }\n /**\n * Getter for the buffer.\n *\n * @returns the buffer, undefined if no buffer has been set\n */\n get buffer() {\n var _a;\n return (_a = this._options) === null || _a === void 0 ? void 0 : _a.buffer;\n }\n /**\n * Adds an 'open' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be\n * called in the order they were added.\n *\n * @param listener the listener to add\n * @param options the listener options\n */\n onOpen(listener, options) {\n this.addListener(WebsocketEvent.open, listener, options);\n return this;\n }\n /**\n * Adds an 'close' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be\n * called in the order they were added.\n *\n * @param listener the listener to add\n * @param options the listener options\n */\n onClose(listener, options) {\n this.addListener(WebsocketEvent.close, listener, options);\n return this;\n }\n /**\n * Adds an 'error' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be\n * called in the order they were added.\n *\n * @param listener the listener to add\n * @param options the listener options\n */\n onError(listener, options) {\n this.addListener(WebsocketEvent.error, listener, options);\n return this;\n }\n /**\n * Adds an 'message' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be\n * called in the order they were added.\n *\n * @param listener the listener to add\n * @param options the listener options\n */\n onMessage(listener, options) {\n this.addListener(WebsocketEvent.message, listener, options);\n return this;\n }\n /**\n * Adds an 'retry' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be\n * called in the order they were added.\n *\n * @param listener the listener to add\n * @param options the listener options\n */\n onRetry(listener, options) {\n this.addListener(WebsocketEvent.retry, listener, options);\n return this;\n }\n /**\n * Adds an 'reconnect' event listener to the websocket. Subsequent calls to this method will add additional listeners that will be\n * called in the order they were added.\n *\n * @param listener the listener to add\n * @param options the listener options\n */\n onReconnect(listener, options) {\n this.addListener(WebsocketEvent.reconnect, listener, options);\n return this;\n }\n /**\n * Builds the websocket.\n *\n * @return a new websocket, with the set options\n */\n build() {\n return new Websocket(this._url, this._protocols, this._options); // instantiate the websocket with the set options\n }\n /**\n * Adds an event listener to the options.\n *\n * @param event the event to add the listener to\n * @param listener the listener to add\n * @param options the listener options\n */\n addListener(event, listener, options) {\n var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k, _l, _m, _o, _p, _q, _r, _s, _t, _u, _v, _w;\n this._options = Object.assign(Object.assign({}, this._options), { listeners: {\n open: (_c = (_b = (_a = this._options) === null || _a === void 0 ? void 0 : _a.listeners) === null || _b === void 0 ? void 0 : _b.open) !== null && _c !== void 0 ? _c : [],\n close: (_f = (_e = (_d = this._options) === null || _d === void 0 ? void 0 : _d.listeners) === null || _e === void 0 ? void 0 : _e.close) !== null && _f !== void 0 ? _f : [],\n error: (_j = (_h = (_g = this._options) === null || _g === void 0 ? void 0 : _g.listeners) === null || _h === void 0 ? void 0 : _h.error) !== null && _j !== void 0 ? _j : [],\n message: (_m = (_l = (_k = this._options) === null || _k === void 0 ? void 0 : _k.listeners) === null || _l === void 0 ? void 0 : _l.message) !== null && _m !== void 0 ? _m : [],\n retry: (_q = (_p = (_o = this._options) === null || _o === void 0 ? void 0 : _o.listeners) === null || _p === void 0 ? void 0 : _p.retry) !== null && _q !== void 0 ? _q : [],\n reconnect: (_t = (_s = (_r = this._options) === null || _r === void 0 ? void 0 : _r.listeners) === null || _s === void 0 ? void 0 : _s.reconnect) !== null && _t !== void 0 ? _t : [],\n [event]: [\n ...((_w = (_v = (_u = this._options) === null || _u === void 0 ? void 0 : _u.listeners) === null || _v === void 0 ? void 0 : _v[event]) !== null && _w !== void 0 ? _w : []),\n { listener, options },\n ],\n } });\n return this;\n }\n}\n//# sourceMappingURL=websocket_builder.js.map","var _computedKey;\nimport { getFilterLimit, matchFilters, verifyEvent as _verifyEvent } from \"nostr-tools\";\nimport { ArrayQueue, ExponentialBackoff, WebsocketBuilder, WebsocketEvent } from \"websocket-ts\";\nimport { Machina } from \"./utils/Machina.js\";\nimport { NSchema as n } from \"./NSchema.js\";\nimport { NSet } from \"./NSet.js\";\n_computedKey = Symbol.asyncDispose;\n/** Single relay connection over WebSocket. */ export class NRelay1 {\n url;\n opts;\n socket;\n subs;\n closedByUser;\n idleTimer;\n ee;\n get subscriptions() {\n return [\n ...this.subs.values()\n ];\n }\n constructor(url, opts = {}){\n this.url = url;\n this.opts = opts;\n this.subs = new Map();\n this.closedByUser = false;\n this.ee = new EventTarget();\n this.socket = this.createSocket();\n this.maybeStartIdleTimer();\n }\n /** Create (and open) a WebSocket connection with automatic reconnect. */ createSocket() {\n const { backoff = new ExponentialBackoff(1000) } = this.opts;\n return new WebsocketBuilder(this.url).withBuffer(new ArrayQueue()).withBackoff(backoff === false ? undefined : backoff).onOpen(()=>{\n for (const req of this.subs.values()){\n this.send(req);\n }\n }).onClose(()=>{\n // If the connection closes on its own and there are no active subscriptions, let it stay closed.\n if (!this.subs.size) {\n this.socket.close();\n }\n }).onMessage((_ws, ev)=>{\n const result = n.json().pipe(n.relayMsg()).safeParse(ev.data);\n if (result.success) {\n this.receive(result.data);\n }\n }).build();\n }\n /** Handle a NIP-01 relay message. */ receive(msg) {\n const { auth, verifyEvent = _verifyEvent } = this.opts;\n switch(msg[0]){\n case 'EVENT':\n if (!verifyEvent(msg[2])) break;\n this.ee.dispatchEvent(new CustomEvent(`sub:${msg[1]}`, {\n detail: msg\n }));\n break;\n case 'EOSE':\n this.ee.dispatchEvent(new CustomEvent(`sub:${msg[1]}`, {\n detail: msg\n }));\n break;\n case 'CLOSED':\n this.subs.delete(msg[1]);\n this.maybeStartIdleTimer();\n this.ee.dispatchEvent(new CustomEvent(`sub:${msg[1]}`, {\n detail: msg\n }));\n break;\n case 'OK':\n this.ee.dispatchEvent(new CustomEvent(`ok:${msg[1]}`, {\n detail: msg\n }));\n break;\n case 'NOTICE':\n this.ee.dispatchEvent(new CustomEvent('notice', {\n detail: msg\n }));\n break;\n case 'COUNT':\n this.ee.dispatchEvent(new CustomEvent(`count:${msg[1]}`, {\n detail: msg\n }));\n break;\n case 'AUTH':\n auth?.(msg[1]).then((event)=>this.send([\n 'AUTH',\n event\n ])).catch(()=>{});\n }\n }\n /** Send a NIP-01 client message to the relay. */ send(msg) {\n this.wake();\n switch(msg[0]){\n case 'REQ':\n this.subs.set(msg[1], msg);\n break;\n case 'CLOSE':\n this.subs.delete(msg[1]);\n this.maybeStartIdleTimer();\n break;\n case 'EVENT':\n case 'COUNT':\n return this.socket.send(JSON.stringify(msg));\n }\n if (this.socket.readyState === WebSocket.OPEN) {\n this.socket.send(JSON.stringify(msg));\n }\n }\n async *req(filters, opts = {}) {\n const { signal } = opts;\n const subscriptionId = crypto.randomUUID();\n const msgs = this.on(`sub:${subscriptionId}`, signal);\n const req = [\n 'REQ',\n subscriptionId,\n ...filters\n ];\n this.send(req);\n try {\n for await (const msg of msgs){\n if (msg[0] === 'EOSE') yield msg;\n if (msg[0] === 'CLOSED') break;\n if (msg[0] === 'EVENT') {\n if (matchFilters(filters, msg[2])) {\n yield msg;\n } else {\n continue;\n }\n }\n }\n } finally{\n this.send([\n 'CLOSE',\n subscriptionId\n ]);\n }\n }\n async query(filters, opts) {\n const events = new NSet();\n const limit = filters.reduce((result, filter)=>result + getFilterLimit(filter), 0);\n if (limit === 0) return [];\n for await (const msg of this.req(filters, opts)){\n if (msg[0] === 'EOSE') break;\n if (msg[0] === 'EVENT') events.add(msg[2]);\n if (msg[0] === 'CLOSED') throw new Error('Subscription closed');\n if (events.size >= limit) {\n break;\n }\n }\n return [\n ...events\n ];\n }\n async event(event, opts) {\n const result = this.once(`ok:${event.id}`, opts?.signal);\n this.send([\n 'EVENT',\n event\n ]);\n const [, , ok, reason] = await result;\n if (!ok) {\n throw new Error(reason);\n }\n }\n async count(filters, opts) {\n const subscriptionId = crypto.randomUUID();\n const result = this.once(`count:${subscriptionId}`, opts?.signal);\n this.send([\n 'COUNT',\n subscriptionId,\n ...filters\n ]);\n const [, , count] = await result;\n return count;\n }\n /** Get a stream of EE events. */ async *on(key, signal) {\n if (signal?.aborted) throw this.abortError();\n const machina = new Machina(signal);\n const onMsg = (e)=>machina.push(e.detail);\n this.ee.addEventListener(key, onMsg);\n try {\n for await (const msg of machina){\n yield msg;\n }\n } finally{\n this.ee.removeEventListener(key, onMsg);\n }\n }\n /** Wait for a single EE event. */ async once(key, signal) {\n for await (const msg of this.on(key, signal)){\n return msg;\n }\n throw new Error('Unreachable');\n }\n abortError() {\n return new DOMException('The signal has been aborted', 'AbortError');\n }\n /** Start the idle time if applicable. */ maybeStartIdleTimer() {\n const { idleTimeout = 30_000 } = this.opts;\n // If the idle timeout is disabled, do nothing.\n if (idleTimeout === false) return;\n // If a timer is already running, let it continue without disruption.\n if (this.idleTimer) return;\n // If there are still subscriptions, the connection is not \"idle\".\n if (this.subs.size) return;\n // If the connection was manually closed, there's no need to start a timer.\n if (this.closedByUser) return;\n this.idleTimer = setTimeout(()=>this.socket.close(), idleTimeout);\n }\n /** Stop the idle timer. */ stopIdleTimer() {\n clearTimeout(this.idleTimer);\n this.idleTimer = undefined;\n }\n /** Make a new WebSocket, but only if it was closed by an idle timeout. */ wake() {\n this.stopIdleTimer();\n if (!this.closedByUser && this.socket.closedByUser) {\n this.socket = this.createSocket();\n }\n }\n /**\n * Close the relay connection and prevent it from reconnecting.\n * After this you should dispose of the `NRelay1` instance and create a new one to connect again.\n */ async close() {\n this.closedByUser = true;\n this.socket.close();\n this.stopIdleTimer();\n if (this.socket.readyState !== WebSocket.CLOSED) {\n await new Promise((resolve)=>{\n this.socket.addEventListener(WebsocketEvent.close, resolve, {\n once: true\n });\n });\n }\n }\n async [_computedKey]() {\n await this.close();\n }\n}\n//# sourceMappingURL=NRelay1.js.map","// 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}\n\n// pure.ts\nimport { sha256 } from \"@noble/hashes/sha256\";\n\n// utils.ts\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}\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 ClientAuth = 22242;\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}\n\n// fakejson.ts\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 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}\n\n// nip42.ts\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 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 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.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 (ok)\n ep.resolve(reason);\n else\n ep.reject(new Error(reason));\n this.openEventPublishes.delete(id);\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._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 const evt = await signAuthEvent(makeAuthEvent(this.url, this.challenge));\n const ret = new Promise((resolve, reject) => {\n this.openEventPublishes.set(evt.id, { resolve, reject });\n });\n this.send('[\"AUTH\",' + JSON.stringify(evt) + \"]\");\n return ret;\n }\n async publish(event) {\n const ret = new Promise((resolve, reject) => {\n this.openEventPublishes.set(event.id, { resolve, reject });\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 || \"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// 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 subscribeMany(relays, filters, params) {\n return this.subscribeManyMap(Object.fromEntries(relays.map((url) => [url, filters])), params);\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 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 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) => handleClose(i2, reason),\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 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.subscribeManyEose(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);\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 _WebSocket;\ntry {\n _WebSocket = WebSocket;\n} catch {\n}\nfunction useWebSocketImplementation(websocketImplementation) {\n _WebSocket = websocketImplementation;\n}\nvar SimplePool = class extends AbstractSimplePool {\n constructor() {\n super({ verifyEvent, websocketImplementation: _WebSocket });\n }\n};\nexport {\n AbstractSimplePool,\n SimplePool,\n useWebSocketImplementation\n};\n","import { verifyEvent } from \"nostr-tools\";\nimport { AbstractSimplePool } from \"nostr-tools/pool\";\nimport { Machina } from \"./utils/Machina.js\";\n/**\n * NRelay implementation built on top of SimplePool from nostr-tools.\n */ export class NSimplePool {\n pool;\n constructor(opts){\n this.pool = new AbstractSimplePool({\n verifyEvent: opts?.verifyEvent ?? verifyEvent\n });\n this.pool.trackRelays = opts?.trackRelays ?? false;\n this.pool.trustedRelayURLs = opts?.trustedRelayURLs ?? new Set();\n }\n get seenOn() {\n const seenOn = new Map();\n for (const [id, relays] of this.pool.seenOn){\n seenOn.set(id, new Set([\n ...relays\n ].map((relay)=>relay.url)));\n }\n return seenOn;\n }\n async *req(filters, opts = {}) {\n if (opts.signal?.aborted) throw new DOMException('The signal has been aborted', 'AbortError');\n const subId = crypto.randomUUID();\n const machina = new Machina(opts.signal);\n const sub = this.pool.subscribeMany(opts.relays ?? [], filters, {\n id: subId,\n onevent (event) {\n machina.push([\n 'EVENT',\n subId,\n event\n ]);\n },\n oneose () {\n machina.push([\n 'EOSE',\n subId\n ]);\n },\n onclose (reasons) {\n machina.push([\n 'CLOSED',\n subId,\n reasons.join(', ')\n ]);\n }\n });\n const abort = ()=>{\n sub.close();\n cleanup();\n };\n const cleanup = ()=>{\n opts.signal?.removeEventListener('abort', abort);\n };\n opts.signal?.addEventListener('abort', abort);\n try {\n for await (const msg of machina){\n yield msg;\n }\n } finally{\n abort();\n }\n }\n // deno-lint-ignore require-await\n async event(event, opts = {}) {\n if (opts.signal?.aborted) {\n throw new DOMException('The signal has been aborted', 'AbortError');\n }\n this.pool.publish(opts.relays ?? [], event);\n }\n async query(filters, opts = {}) {\n const events = [];\n for await (const msg of this.req(filters, opts)){\n if (msg[0] === 'EOSE') break;\n if (msg[0] === 'EVENT') events.push(msg[2]);\n if (msg[0] === 'CLOSED') throw new Error('Subscription closed');\n }\n return events;\n }\n /** Disconnect from the given relay URLs. */ disconnect(relays) {\n this.pool.close(relays);\n }\n // deno-lint-ignore require-await\n async close() {\n this.pool.destroy();\n }\n}\n//# sourceMappingURL=NSimplePool.js.map"],"names":["perf","warned","PROCESS","emitWarning","msg","type","code","fn","AC","AS","_a","__publicField","_","warnACPolyfill","reason","_b","printACPolyfillWarning","shouldWarn","isPosInt","getUintArray","max","ZeroArray","size","_constructing","_Stack","HeapCls","__privateGet","__privateSet","s","n","__privateAdd","Stack","_max","_maxSize","_dispose","_disposeAfter","_fetchMethod","_memoMethod","_size","_calculatedSize","_keyMap","_keyList","_valList","_next","_prev","_head","_tail","_free","_disposed","_sizes","_starts","_ttls","_hasDispose","_hasFetchMethod","_hasDisposeAfter","_LRUCache_instances","initializeTTLTracking_fn","_updateItemAge","_statusTTL","_setItemTTL","_isStale","initializeSizeTracking_fn","_removeItemSize","_addItemSize","_requireSize","indexes_fn","rindexes_fn","isValidIndex_fn","evict_fn","backgroundFetch_fn","isBackgroundFetch_fn","connect_fn","moveToTail_fn","delete_fn","clear_fn","_LRUCache","options","_i","_s","_st","_k","_v","sizeCalculation","ttl","ttlResolution","ttlAutopurge","updateAgeOnGet","updateAgeOnHas","allowStale","dispose","disposeAfter","noDisposeOnSet","noUpdateTTL","maxSize","maxEntrySize","fetchMethod","memoMethod","noDeleteOnFetchRejection","noDeleteOnStaleGet","allowStaleOnFetchRejection","allowStaleOnFetchAbort","ignoreFetchAbort","UintArray","__privateMethod","c","p","k","index","context","key","i","getOptions","v","value","thisp","deleted","entry","start","remain","arr","age","setOptions","_c","_d","_e","status","__privateWrapper","oldVal","oldValue","dt","task","val","hasOptions","peekOptions","fetchOptions","forceRefresh","signal","stale","isStale","staleVal","memoOptions","vv","fetching","ttls","starts","t","cachedNow","getNow","sizes","free","head","ac","fetchOpts","cb","updateCache","aborted","ignoreAbort","fetchFail","bf","eb","er","allowStaleAborted","noDelete","pcall","res","rej","fmp","b","pi","ni","LRUCache","number","bytes","lengths","hash","exists","instance","checkFinished","output","out","min","crypto","u8a","a","createView","rotr","word","shift","isLE","utf8ToBytes","str","toBytes","data","concatBytes","arrays","r","sum","pad","Hash$2","wrapConstructor","hashCons","hashC","tmp","randomBytes","bytesLength","setBigUint64","view","byteOffset","_32n","_u32_max","wh","wl","h","Hash","blockLen","outputLen","padOffset","buffer","len","pos","take","dataView","oview","outLen","state","to","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","e","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","x","invert","u","q","m","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","d","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","l","sBytes","rBytesLeft","sig","slice","shl","rhl","rl","weierstrassPoints","CURVE","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","y","left","right","X1","Y1","Z1","X2","Y2","Z2","U1","U2","b3","X3","Y3","Z3","t0","t1","t3","t4","t5","wnaf","I","k1neg","k1","k2neg","k2","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","y2","isYOdd","numToNByteStr","ut.numberToBytesBE","isBiggerThanHalfOrder","HALF","normalizeS","slcNum","from","Signature","recovery","msgHash","rec","bits2int_modN","radj","prefix","R","ir","u1","u2","ut.hexToBytes","utils","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","error","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","fe","TAGGED_HASH_PREFIXES","taggedHash","tag","messages","tagP","tagH","pointToBytes","numTo32b","modP","GmulAdd","schnorrGetExtPubKey","priv","d_","lift_x","xx","challenge","args","schnorrGetPublicKey","schnorrSign","auxRand","rand","k_","rx","schnorrVerify","pub","schnorr","Hash$1","bool","assert","SHA224","assertNumber","chain","wrap","encode","decode","alphabet","digits","input","letter","join","separator","padding","chr","end","normalize","convertRadix","carry","done","digit","digitBase","gcd","radix2carry","convertRadix2","radix","radix2","revPadding","unsafeWrapper","base16","base32","base64","base64url","genBase58","abc","base58","XMR_BLOCK_LEN","base58xmr","block","BECH_ALPHABET","POLYMOD_GENERATORS","bech32Polymod","pre","chk","bechChecksum","words","encodingConst","genBech32","encoding","ENCODING_CONST","_words","fromWords","toWords","fromWordsUnsafe","limit","actualLength","lowered","sepIndex","decodeUnsafe","decodeToBytes","bech32","utf8","CODERS","isBytes","u32","checkOpts","defaults","diff","wrapCipher","params","BLOCK_SIZE","POLY","mul2","sbox","box","invSbox","rotr32_8","rotl32_8","genTtable","T0","T3","T01","T23","sbox2","idx","tableEncoding","tableDecoding","xPowers","expandKeyLE","abytes","k32","Nk","subByte","applySbox","xk","expandKeyDecLE","encKey","w","apply0123","s2","s3","encrypt","rounds","decrypt","getDst","dst","validateBlockDecrypt","validateBlockEncrypt","plaintext","pcks5","remaining","o","validatePCKS","lastByte","padPCKS","tmp32","paddingByte","cbc","iv","_out","n32","ciphertext","ps0","ps1","ps2","ps3","o0","o1","o2","o3","_utf8ToBytes","sigma16","sigma32","sigma16_32","sigma32_32","rotl","isAligned32","BLOCK_LEN","BLOCK_LEN32","MAX_COUNTER","U32_EMPTY","runCipher","core","sigma","nonce","counter","b32","isAligned","d32","o32","pos32","posj","createCipher","allowShortKeys","extendNonceFn","counterLength","counterRight","anumber","abool","toClean","nonceNcLen","nc","chachaCore","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","chacha20","extract","ikm","salt","HKDF_COUNTER","EMPTY_BUFFER","expand","prk","info","blocks","okm","HMACTmp","T","__defProp","__export","target","all","name","verifiedSymbol","isRecord","obj","validateEvent","event","i2","utils_exports","Queue","QueueNode","binarySearch","insertEventIntoAscendingList","insertEventIntoDescendingList","normalizeURL","utf8Decoder","utf8Encoder","url","sortedArray","found","compare","mid","cmp","newNode","target2","JS","secretKey","getEventHash","valid","serializeEvent","evt","eventHash","finalizeEvent","verifyEvent","kinds_exports","Application","BadgeAward","BadgeDefinition","BlockedRelaysList","BookmarkList","Bookmarksets","Calendar","CalendarEventRSVP","ChannelCreation","ChannelHideMessage","ChannelMessage","ChannelMetadata","ChannelMuteUser","ClassifiedListing","ClientAuth","CommunitiesList","CommunityDefinition","CommunityPostApproval","Contacts","CreateOrUpdateProduct","CreateOrUpdateStall","Curationsets","Date2","DraftClassifiedListing","DraftLong","Emojisets","EncryptedDirectMessage","EncryptedDirectMessages","EventDeletion","FileMetadata","FileServerPreference","Followsets","GenericRepost","Genericlists","HTTPAuth","Handlerinformation","Handlerrecommendation","Highlights","InterestsList","Interestsets","JobFeedback","JobRequest","JobResult","Label","LightningPubRPC","LiveChatMessage","LiveEvent","LongFormArticle","Metadata","Mutelist","NWCWalletInfo","NWCWalletRequest","NWCWalletResponse","NostrConnect","OpenTimestamps","Pinlist","ProblemTracker","ProfileBadges","PublicChatsList","Reaction","RecommendRelay","RelayList","Relaysets","Report","Reporting","Repost","SearchRelaysList","ShortTextNote","Time","UserEmojiList","UserStatuses","Zap","ZapGoal","ZapRequest","classifyKind","isEphemeralKind","isParameterizedReplaceableKind","isRegularKind","isReplaceableKind","kind","matchFilter","filter","tagName","values","matchFilters","filters","getFilterLimit","_f","fakejson_exports","getHex64","getInt","getSubscriptionId","matchEventId","matchEventKind","matchEventPubkey","json","sliced","pstart","pend","id","pubkey","nip42_exports","makeAuthEvent","relayURL","_WebSocket","_WebSocket2","nip19_exports","BECH32_REGEX","Bech32MaxSize","encodeBytes","naddrEncode","neventEncode","noteEncode","nprofileEncode","npubEncode","nrelayEncode","nsecEncode","integerToUint8Array","uint8Array","nip19","_g","_h","tlv","parseTLV","bytesToHex2","rest","encodeBech32","profile","encodeTLV","kindArray","addr","entries","vs","nip04_exports","text","privkey","bytesToHex3","normalizedKey","getNormalizedX","ctb64","ivb64","nip05_exports","NIP05_REGEX","isValid","queryProfile","searchDomain","useFetchImplementation","_fetch","fetchImplementation","domain","query","fullname","match","nip05","nip10_exports","parse","eTags","eTagIndex","eTag","eTagEventId","eTagRelayUrl","eTagMarker","eventPointer","isFirstETag","isLastETag","nip11_exports","fetchRelayInformation","useFetchImplementation2","_fetch2","nip13_exports","getPow","minePow","count","nibble","unsigned","difficulty","now","nip18_exports","finishRepostEvent","getRepostedEvent","getRepostedEventPointer","reposted","relayUrl","lastETag","lastPTag","skipVerification","pointer","repostedEvent","nip21_exports","NOSTR_URI_REGEX","parse2","test","uri","nip25_exports","finishReactionEvent","getReactedEventPointer","reacted","inheritedTags","nip27_exports","matchAll","regex","replaceAll","content","matches","replacer","nip28_exports","channelCreateEvent","channelHideMessageEvent","channelMessageEvent","channelMetadataEvent","channelMuteUserEvent","tags","nip30_exports","EMOJI_SHORTCODE_REGEX","matchAll2","regex2","replaceAll2","shortcode","nip39_exports","useFetchImplementation3","validateGithub","_fetch3","username","proof","nip44_exports","decrypt2","encrypt2","getConversationKey","v2","minPlaintextSize","maxPlaintextSize","privkeyA","pubkeyB","sharedX","secp256k12","hkdf_extract","sha2562","getMessageKeys","conversationKey","keys","hkdf_expand","calcPaddedLen","nextPower","chunk","writeU16BE","unpadded","unpaddedLen","suffix","concatBytes2","unpad","padded","hmacAad","aad","combined","decodePayload","payload","plen","base642","dlen","vers","randomBytes2","chacha_key","chacha_nonce","hmac_key","mac","calculatedMac","nip47_exports","makeNwcRequestEvent","parseConnectionString","connectionString","pathname","searchParams","relay","secret","invoice","encryptedContent","eventTemplate","nip57_exports","getZapEndpoint","makeZapReceipt","makeZapRequest","useFetchImplementation4","validateZapRequest","_fetch4","metadata","lnurl","lud06","lud16","bech322","body","amount","relays","comment","zr","zapRequestString","zapRequest","preimage","bolt11","paidAt","tagsFromZapRequest","zap","nip98_exports","getToken","hashPayload","unpackEventFromToken","validateEvent2","validateEventKind","validateEventMethodTag","validateEventPayloadTag","validateEventTimestamp","validateEventUrlTag","validateToken","_authorizationScheme","loginUrl","httpMethod","includeAuthorizationScheme","signedEvent","base643","token","method","eventB64","urlTag","methodTag","sha2563","bytesToHex4","payloadTag","payloadHash","_computedKey","_computedKey1","_NSet_instances","processDeletions_fn","_NSet","callbackfn","thisArg","_id","d1","d2","events","_other","NSet","NCache","util","assertIs","_arg","assertNever","_x","items","validKeys","filtered","checker","joinValues","objectUtil","first","second","ZodParsedType","getParsedType","ZodIssueCode","quotelessJson","ZodError","issues","sub","subs","actualProto","_mapper","mapper","issue","fieldErrors","processError","curr","el","formErrors","errorMap","_ctx","overrideErrorMap","setErrorMap","getErrorMap","makeIssue","path","errorMaps","issueData","fullPath","fullIssue","errorMessage","maps","EMPTY_PATH","addIssueToContext","ctx","overrideMap","ParseStatus","results","arrayValue","INVALID","pairs","syncPairs","pair","finalObject","DIRTY","OK","isAborted","isDirty","isAsync","__classPrivateFieldGet","receiver","__classPrivateFieldSet","errorUtil","_ZodEnum_cache","_ZodNativeEnum_cache","ParseInputLazyPath","parent","handleResult","processCreateParams","invalid_type_error","required_error","description","iss","ZodType","def","maybeAsyncResult","check","getIssueProperties","setError","refinementData","refinement","ZodEffects","ZodFirstPartyTypeKind","ZodOptional","ZodNullable","ZodArray","ZodPromise","option","ZodUnion","incoming","ZodIntersection","defaultValueFunc","ZodDefault","ZodBranded","catchValueFunc","ZodCatch","This","ZodPipeline","ZodReadonly","cuidRegex","cuid2Regex","ulidRegex","uuidRegex","nanoidRegex","durationRegex","emailRegex","_emojiRegex","emojiRegex","ipv4Regex","ipv6Regex","base64Regex","dateRegexSource","dateRegex","timeRegexSource","timeRegex","datetimeRegex","isValidIP","ip","version","ZodString","tooBig","tooSmall","validation","minLength","maxLength","ch","floatSafeRemainder","step","valDecCount","stepDecCount","decCount","valInt","stepInt","ZodNumber","inclusive","ZodBigInt","ZodBoolean","ZodDate","minDate","maxDate","ZodSymbol","ZodUndefined","ZodNull","ZodAny","ZodUnknown","ZodNever","ZodVoid","schema","deepPartialify","ZodObject","newShape","fieldSchema","ZodTuple","shape","shapeKeys","extraKeys","keyValidator","unknownKeys","catchall","defaultError","augmentation","merging","newField","createZodEnum","handleResults","unionErrors","childCtx","dirty","types","getDiscriminator","ZodLazy","ZodLiteral","ZodEnum","ZodNativeEnum","ZodDiscriminatedUnion","discriminator","discriminatorValue","optionsMap","discriminatorValues","mergeValues","aType","bType","bKeys","sharedKeys","newObj","sharedValue","newArray","itemA","itemB","handleParsed","parsedLeft","parsedRight","merged","itemIndex","schemas","ZodRecord","keyType","valueType","third","ZodMap","finalMap","ZodSet","finalizeSet","elements","parsedSet","element","minSize","ZodFunction","makeArgsIssue","makeReturnsIssue","returns","me","parsedArgs","parsedReturns","returnType","func","getter","expectedValues","enumValues","newDef","opt","nativeEnumValues","promisified","effect","checkCtx","arg","processed","executeRefinement","inner","preprocess","newCtx","ZodNaN","BRAND","inResult","freeze","custom","fatal","_fatal","p2","late","instanceOfType","cls","stringType","numberType","nanType","bigIntType","booleanType","dateType","symbolType","undefinedType","nullType","anyType","unknownType","neverType","voidType","arrayType","objectType","strictObjectType","unionType","discriminatedUnionType","intersectionType","tupleType","recordType","mapType","setType","functionType","lazyType","literalType","enumType","nativeEnumType","promiseType","effectsType","optionalType","nullableType","preprocessType","pipelineType","ostring","onumber","oboolean","coerce","NEVER","NSchema","NConnectSigner","signer","timeout","encryption","request","local","req","decrypted","response","asciis","asciiToBase16","char","hl","al","ai","hi","n1","toStr","HashMD","Rho","Id","Pi","idxL","idxR","shifts","shiftsL","shiftsR","Kl","Kr","group","R_BUF","RIPEMD160","h0","h1","h2","h3","h4","ar","bl","br","cl","cr","dl","dr","rGroup","hbl","hbr","rr","sr","tl","tr","ripemd160","SHA256_IV","U32_MASK64","fromBig","le","split","Ah","Al","toBig","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","rotr32H","rotr32L","rotlSH","rotlSL","rotlBH","rotlBL","add","Bh","Bl","add3L","Cl","add3H","low","Ch","add4L","Dl","add4H","Dh","add5L","El","add5H","Eh","u64","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","CHIl","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","sha512","isPosBig","inRange","aInRange","notImplemented","memoized","computed","pointWindowSizes","validateW","pippenger","scalars","MASK","buckets","lastBits","resI","sumI","validateSigVerOpts","dataLen","ut.numberToHexUnpadded","lenLen","isLong","lengthBytes","int","ut.abytes","seqBytes","seqLeftBytes","rBytes","rLeftBytes","sLeftBytes","seq","Fn","mod.Field","ut.inRange","N","ut.isBytes","ut.aInRange","toAffineMemo","assertValidMemo","sc","sqrtError","rounded","checksum","newChecksum","oldChecksum","createBase58check","secp","base58check","bytesToNumber","numberToBytes","MASTER_SECRET","BITCOIN_VERSIONS","HARDENED_OFFSET","hash160","fromU32","toU32","HDKey","versions","base58key","keyBuffer","keyView","isPriv","parts","child","m1","childTweak","chainCode","added","_secretKey","_NSecSigner_instances","getConversationKey_fn","NSecSigner","nip04","nip44","NSeedSigner","account","_seed","NCustodial","user","cryptoKey","NIP05","fetch","names","NIP50","tokens","encoder","getTypeName","validateBinaryLike","source","hexTable","textDecoder","encodeHex","src","u8","base64abc","encodeBase64","uint8","decodeBase64","b64","binString","N64","NIP98","validatePayload","digest","maxAge","_verifyEvent","header","NKinds","pbkdf2Init","_password","_salt","_opts","dkLen","asyncTick","password","DK","PRF","PRFSalt","pbkdf2Output","prfW","pbkdf2","ti","Ti","ui","nfkd","norm","passphrase","mnemonicToSeedSync","mnemonic","NPhraseSigner","_queue","_resolve","_aborted","Machina","NPool","controller","routes","machina","eoses","closes","relayUrls","replaceable","ExponentialBackoff","expMax","ArrayQueue","WebsocketEvent","Websocket","protocols","_j","_m","_o","_p","_q","listener","isListenerNotToBeRemoved","eventListeners","newEventListeners","detail","ele","handleRetryEvent","retryEventDetail","WebsocketBuilder","maxRetries","instantReconnect","backoff","_r","_t","_u","_w","NRelay1","_ws","ev","auth","subscriptionId","ok","onMsg","idleTimeout","resolve","yieldThread","handler","alwaysTrue","AbstractRelay","ep","reject","err","subid","so","alreadyHave","signAuthEvent","ret","subscription","Subscription","AbstractSimplePool","requests","set","_knownIds","relaysLength","eosesReceived","handleEose","closesReceived","handleClose","localAlreadyHaveEventHandler","have","allOpened","subcloser","conn","NSimplePool","seenOn","subId","reasons","abort","cleanup"],"mappings":";;;;;;;;;;;;;;;AAGA,MAAMA,KAAO,OAAO,eAAgB,YAChC,eACA,OAAO,YAAY,OAAQ,aACzB,cACA,MACAC,KAAS,oBAAI,OAEbC,KAAW,OAAO,WAAY,YAAc,UAAU,UAAU,CAAA,GAEhEC,KAAc,CAACC,GAAKC,GAAMC,GAAMC,MAAO;AACzC,SAAOL,GAAQ,eAAgB,aACzBA,GAAQ,YAAYE,GAAKC,GAAMC,GAAMC,CAAE,IACvC,QAAQ,MAAM,IAAID,CAAI,KAAKD,CAAI,KAAKD,CAAG,EAAE;AACnD;AACA,IAAII,KAAK,WAAW,iBAChBC,KAAK,WAAW;AAlBpB,IAAAC;AAoBA,IAAI,OAAOF,KAAO,KAAa;AAE3B,EAAAC,KAAK,MAAkB;AAAA,IAAlB;AACD,MAAAE,EAAA;AACA,MAAAA,EAAA,kBAAW,CAAA;AACX,MAAAA,EAAA;AACA,MAAAA,EAAA,iBAAU;AAAA;AAAA,IACV,iBAAiBC,GAAGL,GAAI;AACpB,WAAK,SAAS,KAAKA,CAAE;AAAA,IACxB;AAAA,EACT,GAEIC,KAAK,MAAsB;AAAA,IACvB,cAAc;AAGd,MAAAG,EAAA,gBAAS,IAAIF;AAFT,MAAAI;IACH;AAAA,IAED,MAAMC,GAAQ;AArCtB,UAAAJ,GAAAK;AAsCY,UAAI,MAAK,OAAO,SAGhB;AAAA,aAAK,OAAO,SAASD,GAErB,KAAK,OAAO,UAAU;AAEtB,mBAAWP,KAAM,KAAK,OAAO;AACzB,UAAAA,EAAGO,CAAM;AAEb,SAAAC,KAAAL,IAAA,KAAK,QAAO,YAAZ,QAAAK,EAAA,KAAAL,GAAsBI;AAAA;AAAA,IACzB;AAAA,EACT;AACI,MAAIE,MAAyBN,KAAAR,GAAQ,QAAR,gBAAAQ,GAAa,iCAAgC;AAC1E,QAAMG,IAAiB,MAAM;AACzB,IAAKG,MAELA,IAAyB,IACzBb,GAAY,oaAM+D,uBAAuB,WAAWU,CAAc;AAAA,EACnI;AACA;AAEA,MAAMI,KAAa,CAACX,MAAS,CAACL,GAAO,IAAIK,CAAI,GAEvCY,KAAW,CAAC,MAAM,KAAK,MAAM,KAAK,MAAM,CAAC,KAAK,IAAI,KAAK,SAAS,CAAC,GAUjEC,KAAe,CAACC,MAASF,GAASE,CAAG,IAErCA,KAAO,KAAK,IAAI,GAAG,CAAC,IAChB,aACAA,KAAO,KAAK,IAAI,GAAG,EAAE,IACjB,cACAA,KAAO,KAAK,IAAI,GAAG,EAAE,IACjB,cACAA,KAAO,OAAO,mBACVC,KACA,OAThB;AAWN,MAAMA,WAAkB,MAAM;AAAA,EAC1B,YAAYC,GAAM;AACd,UAAMA,CAAI,GACV,KAAK,KAAK,CAAC;AAAA,EACd;AACL;AA/FA,IAAAC;AAgGA,MAAMC,KAAN,MAAMA,GAAM;AAAA,EAcR,YAAYJ,GAAKK,GAAS;AAb1B,IAAAd,EAAA;AACA,IAAAA,EAAA;AAcI,QAAI,CAACe,EAAAF,IAAMD;AACP,YAAM,IAAI,UAAU,yCAAyC;AAGjE,SAAK,OAAO,IAAIE,EAAQL,CAAG,GAC3B,KAAK,SAAS;AAAA,EACjB;AAAA,EAjBD,OAAO,OAAOA,GAAK;AACf,UAAMK,IAAUN,GAAaC,CAAG;AAChC,QAAI,CAACK;AACD,aAAO;AACX,IAAAE,EAAAH,IAAMD,IAAgB;AACtB,UAAMK,IAAI,IAAIJ,GAAMJ,GAAKK,CAAO;AAChC,WAAAE,EAAAH,IAAMD,IAAgB,KACfK;AAAA,EACV;AAAA,EAUD,KAAKC,GAAG;AACJ,SAAK,KAAK,KAAK,QAAQ,IAAIA;AAAA,EAC9B;AAAA,EACD,MAAM;AACF,WAAO,KAAK,KAAK,EAAE,KAAK,MAAM;AAAA,EACjC;AACL;AAzBWN,KAAA;AAAPO,EAJEN,IAIKD,IAAgB;AAJ3B,IAAMQ,KAANP;AAhGA,IAAAd,IAAAK,IAAAiB,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,GAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,GAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC,IAAAC;AA6IO,MAAMC,KAAN,MAAMA,GAAS;AAAA,EAwKlB,YAAYC,GAAS;AAxKlB,IAAA9C,EAAA,MAAAyB;AAEH;AAAA,IAAAzB,EAAA,MAAAE;AACA,IAAAF,EAAA,MAAAG;AACA,IAAAH,EAAA,MAAAI;AACA,IAAAJ,EAAA,MAAAK;AACA,IAAAL,EAAA,MAAAM;AACA,IAAAN,EAAA,MAAAO;AAIA;AAAA;AAAA;AAAA,IAAA1B,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAIA;AAAA;AAAA;AAAA,IAAAA,EAAA;AAEA;AAAA,IAAAmB,EAAA,MAAAQ;AACA,IAAAR,EAAA,MAAAS;AACA,IAAAT,EAAA,MAAAU;AACA,IAAAV,EAAA,MAAAW;AACA,IAAAX,EAAA,MAAAY;AACA,IAAAZ,EAAA,MAAAa;AACA,IAAAb,EAAA,MAAAc;AACA,IAAAd,EAAA,MAAAe;AACA,IAAAf,EAAA,MAAAgB;AACA,IAAAhB,EAAA,MAAAiB;AACA,IAAAjB,EAAA,MAAAkB;AACA,IAAAlB,EAAA,MAAAmB;AACA,IAAAnB,EAAA,MAAAoB;AACA,IAAApB,EAAA,MAAAqB;AACA,IAAArB,EAAA,MAAAsB;AACA,IAAAtB,EAAA,MAAAuB;AACA,IAAAvB,EAAA,MAAAwB;AA6QA;AAAA,IAAAxB,EAAA,MAAA2B,IAAiB,MAAM;AAAA,IAAA;AACvB,IAAA3B,EAAA,MAAA4B,IAAa,MAAM;AAAA,IAAA;AACnB,IAAA5B,EAAA,MAAA6B,IAAc,MAAM;AAAA,IAAA;AAEpB;AAAA,IAAA7B,EAAA,MAAA8B,IAAW,MAAM;AAgDjB,IAAA9B,EAAA,MAAAgC,IAAkB,CAAAe,MAAM;AAAA;AACxB,IAAA/C,EAAA,MAAAiC,IAAe,CAACc,GAAIC,GAAIC,MAAQ;AAAA,IAAA;AAChC,IAAAjD,EAAA,MAAAkC,IAAe,CAACgB,GAAIC,GAAI3D,GAAM4D,MAAoB;AAC9C,UAAI5D,KAAQ4D;AACR,cAAM,IAAI,UAAU,kEAAkE;AAE1F,aAAO;AAAA,IACf;AAyII;AAAA;AAAA;AAAA;AAAA;AAAA,IAAAvE,EAAA,MAACD,IAAsB;AA7XnB,UAAM,EAAE,KAAAU,IAAM,GAAG,KAAA+D,GAAK,eAAAC,IAAgB,GAAG,cAAAC,GAAc,gBAAAC,GAAgB,gBAAAC,GAAgB,YAAAC,GAAY,SAAAC,GAAS,cAAAC,GAAc,gBAAAC,GAAgB,aAAAC,GAAa,SAAAC,IAAU,GAAG,cAAAC,IAAe,GAAG,iBAAAZ,GAAiB,aAAAa,GAAa,YAAAC,GAAY,0BAAAC,GAA0B,oBAAAC,GAAoB,4BAAAC,GAA4B,wBAAAC,GAAwB,kBAAAC,EAAgB,IAAMzB;AACxV,QAAIxD,MAAQ,KAAK,CAACF,GAASE,CAAG;AAC1B,YAAM,IAAI,UAAU,0CAA0C;AAElE,UAAMkF,IAAYlF,IAAMD,GAAaC,CAAG,IAAI;AAC5C,QAAI,CAACkF;AACD,YAAM,IAAI,MAAM,wBAAwBlF,CAAG;AAM/C,QAJAO,EAAA,MAAKK,IAAOZ,IACZO,EAAA,MAAKM,IAAW4D,IAChB,KAAK,eAAeC,KAAgBpE,EAAA,MAAKO,KACzC,KAAK,kBAAkBiD,GACnB,KAAK,iBAAiB;AACtB,UAAI,CAACxD,EAAA,MAAKO,OAAY,CAAC,KAAK;AACxB,cAAM,IAAI,UAAU,oEAAoE;AAE5F,UAAI,OAAO,KAAK,mBAAoB;AAChC,cAAM,IAAI,UAAU,qCAAqC;AAAA,IAEhE;AACD,QAAI+D,MAAe,UACf,OAAOA,KAAe;AACtB,YAAM,IAAI,UAAU,0CAA0C;AAGlE,QADArE,EAAA,MAAKU,IAAc2D,IACfD,MAAgB,UAChB,OAAOA,KAAgB;AACvB,YAAM,IAAI,UAAU,6CAA6C;AAkCrE,QAhCApE,EAAA,MAAKS,IAAe2D,IACpBpE,EAAA,MAAK0B,IAAkB,CAAC,CAAC0C,IACzBpE,EAAA,MAAKa,IAAU,oBAAI,QACnBb,EAAA,MAAKc,IAAW,IAAI,MAAMrB,CAAG,EAAE,KAAK,MAAS,IAC7CO,EAAA,MAAKe,GAAW,IAAI,MAAMtB,CAAG,EAAE,KAAK,MAAS,IAC7CO,EAAA,MAAKgB,IAAQ,IAAI2D,EAAUlF,CAAG,IAC9BO,EAAA,MAAKiB,IAAQ,IAAI0D,EAAUlF,CAAG,IAC9BO,EAAA,MAAKkB,IAAQ,IACblB,EAAA,MAAKmB,IAAQ,IACbnB,EAAA,MAAKoB,IAAQhB,GAAM,OAAOX,CAAG,IAC7BO,EAAA,MAAKW,IAAQ,IACbX,EAAA,MAAKY,IAAkB,IACnB,OAAOkD,KAAY,cACnB9D,EAAA,MAAKO,IAAWuD,IAEhB,OAAOC,KAAiB,cACxB/D,EAAA,MAAKQ,IAAgBuD,IACrB/D,EAAA,MAAKqB,IAAY,QAGjBrB,EAAA,MAAKQ,IAAgB,SACrBR,EAAA,MAAKqB,IAAY,UAErBrB,EAAA,MAAKyB,IAAc,CAAC,CAAC1B,EAAA,MAAKQ,MAC1BP,EAAA,MAAK2B,IAAmB,CAAC,CAAC5B,EAAA,MAAKS,MAC/B,KAAK,iBAAiB,CAAC,CAACwD,GACxB,KAAK,cAAc,CAAC,CAACC,GACrB,KAAK,2BAA2B,CAAC,CAACK,GAClC,KAAK,6BAA6B,CAAC,CAACE,GACpC,KAAK,yBAAyB,CAAC,CAACC,GAChC,KAAK,mBAAmB,CAAC,CAACC,GAEtB,KAAK,iBAAiB,GAAG;AACzB,UAAI3E,EAAA,MAAKO,QAAa,KACd,CAACf,GAASQ,EAAA,MAAKO,GAAQ;AACvB,cAAM,IAAI,UAAU,iDAAiD;AAG7E,UAAI,CAACf,GAAS,KAAK,YAAY;AAC3B,cAAM,IAAI,UAAU,sDAAsD;AAE9E,MAAAqF,EAAA,MAAKhD,GAAAM,IAAL;AAAA,IACH;AAWD,QAVA,KAAK,aAAa,CAAC,CAAC2B,GACpB,KAAK,qBAAqB,CAAC,CAACU,GAC5B,KAAK,iBAAiB,CAAC,CAACZ,GACxB,KAAK,iBAAiB,CAAC,CAACC,GACxB,KAAK,gBACDrE,GAASkE,CAAa,KAAKA,MAAkB,IACvCA,IACA,GACV,KAAK,eAAe,CAAC,CAACC,GACtB,KAAK,MAAMF,KAAO,GACd,KAAK,KAAK;AACV,UAAI,CAACjE,GAAS,KAAK,GAAG;AAClB,cAAM,IAAI,UAAU,6CAA6C;AAErE,MAAAqF,EAAA,MAAKhD,GAAAC,IAAL;AAAA,IACH;AAED,QAAI9B,EAAA,MAAKM,QAAS,KAAK,KAAK,QAAQ,KAAKN,EAAA,MAAKO,QAAa;AACvD,YAAM,IAAI,UAAU,kDAAkD;AAE1E,QAAI,CAAC,KAAK,gBAAgB,CAACP,EAAA,MAAKM,OAAQ,CAACN,EAAA,MAAKO,KAAU;AACpD,YAAM3B,IAAO;AACb,MAAIW,GAAWX,CAAI,MACfL,GAAO,IAAIK,CAAI,GAGfH,GAFY,iGAEK,yBAAyBG,GAAMqE,EAAQ;AAAA,IAE/D;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA/KD,OAAO,sBAAsB6B,GAAG;AAC5B,WAAO;AAAA;AAAA,MAEH,QAAQ9E,EAAA8E,GAAEtD;AAAA,MACV,MAAMxB,EAAA8E,GAAErD;AAAA,MACR,OAAOzB,EAAA8E,GAAEvD;AAAA,MACT,QAAQvB,EAAA8E,GAAEhE;AAAA,MACV,SAASd,EAAA8E,GAAE/D;AAAA,MACX,SAASf,EAAA8E,GAAE9D;AAAA,MACX,MAAMhB,EAAA8E,GAAE7D;AAAA,MACR,MAAMjB,EAAA8E,GAAE5D;AAAA,MACR,IAAI,OAAO;AACP,eAAOlB,EAAA8E,GAAE3D;AAAA,MACZ;AAAA,MACD,IAAI,OAAO;AACP,eAAOnB,EAAA8E,GAAE1D;AAAA,MACZ;AAAA,MACD,MAAMpB,EAAA8E,GAAEzD;AAAA;AAAA,MAER,mBAAmB,CAAC0D,MAAC;AA/PjC,YAAA/F;AA+PsC,eAAA6F,EAAA7F,IAAA8F,GAAEjD,GAAAe,IAAF,KAAA5D,GAAqB+F;AAAA;AAAA,MAC/C,iBAAiB,CAACC,GAAGC,GAAO/B,GAASgC,MAAO;AAhQxD,YAAAlG;AAgQ6D,eAAA6F,EAAA7F,IAAA8F,GAAEjD,GAAAc,IAAF,KAAA3D,GAAmBgG,GAAGC,GAAO/B,GAASgC;AAAA;AAAA,MACvF,YAAY,CAACD,MAAK;AAjQ9B,YAAAjG;AAiQmC,eAAA6F,EAAA7F,IAAA8F,GAAEjD,GAAAiB,IAAF,KAAA9D,GAAciG;AAAA;AAAA,MACrC,SAAS,CAAC/B,MAAO;AAlQ7B,YAAAlE;AAkQkC,eAAA6F,EAAA7F,IAAA8F,GAAEjD,GAAAU,IAAF,KAAAvD,GAAWkE;AAAA;AAAA,MACjC,UAAU,CAACA,MAAO;AAnQ9B,YAAAlE;AAmQmC,eAAA6F,EAAA7F,IAAA8F,GAAEjD,GAAAW,IAAF,KAAAxD,GAAYkE;AAAA;AAAA,MACnC,SAAS,CAAC+B,MAAK;AApQ3B,YAAAjG;AAoQgC,eAAAgB,EAAAhB,IAAA8F,GAAE5C,IAAF,KAAAlD,GAAWiG;AAAA;AAAA,IAC3C;AAAA,EACK;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,IAAI,MAAM;AACN,WAAOjF,EAAA,MAAKM;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAID,IAAI,UAAU;AACV,WAAON,EAAA,MAAKO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAID,IAAI,iBAAiB;AACjB,WAAOP,EAAA,MAAKa;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAID,IAAI,OAAO;AACP,WAAOb,EAAA,MAAKY;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAID,IAAI,cAAc;AACd,WAAOZ,EAAA,MAAKU;AAAA,EACf;AAAA,EACD,IAAI,aAAa;AACb,WAAOV,EAAA,MAAKW;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAID,IAAI,UAAU;AACV,WAAOX,EAAA,MAAKQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAID,IAAI,eAAe;AACf,WAAOR,EAAA,MAAKS;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EA4GD,gBAAgB0E,GAAK;AACjB,WAAOnF,EAAA,MAAKc,IAAQ,IAAIqE,CAAG,IAAI,QAAW;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA,EAqLD,CAAC,UAAU;AACP,eAAWC,KAAKP,EAAA,MAAKhD,GAAAU,IAAL;AACZ,MAAIvC,EAAA,MAAKgB,GAASoE,CAAC,MAAM,UACrBpF,EAAA,MAAKe,IAASqE,CAAC,MAAM,UACrB,CAACP,EAAA,MAAKhD,GAAAe,IAAL,WAAwB5C,EAAA,MAAKgB,GAASoE,CAAC,OACxC,MAAM,CAACpF,EAAA,MAAKe,IAASqE,CAAC,GAAGpF,EAAA,MAAKgB,GAASoE,CAAC,CAAC;AAAA,EAGpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,CAAC,WAAW;AACR,eAAWA,KAAKP,EAAA,MAAKhD,GAAAW,IAAL;AACZ,MAAIxC,EAAA,MAAKgB,GAASoE,CAAC,MAAM,UACrBpF,EAAA,MAAKe,IAASqE,CAAC,MAAM,UACrB,CAACP,EAAA,MAAKhD,GAAAe,IAAL,WAAwB5C,EAAA,MAAKgB,GAASoE,CAAC,OACxC,MAAM,CAACpF,EAAA,MAAKe,IAASqE,CAAC,GAAGpF,EAAA,MAAKgB,GAASoE,CAAC,CAAC;AAAA,EAGpD;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,CAAC,OAAO;AACJ,eAAWA,KAAKP,EAAA,MAAKhD,GAAAU,IAAL,YAAiB;AAC7B,YAAMyC,IAAIhF,EAAA,MAAKe,IAASqE,CAAC;AACzB,MAAIJ,MAAM,UACN,CAACH,EAAA,MAAKhD,GAAAe,IAAL,WAAwB5C,EAAA,MAAKgB,GAASoE,CAAC,OACxC,MAAMJ;AAAA,IAEb;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,CAAC,QAAQ;AACL,eAAWI,KAAKP,EAAA,MAAKhD,GAAAW,IAAL,YAAkB;AAC9B,YAAMwC,IAAIhF,EAAA,MAAKe,IAASqE,CAAC;AACzB,MAAIJ,MAAM,UACN,CAACH,EAAA,MAAKhD,GAAAe,IAAL,WAAwB5C,EAAA,MAAKgB,GAASoE,CAAC,OACxC,MAAMJ;AAAA,IAEb;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,CAAC,SAAS;AACN,eAAWI,KAAKP,EAAA,MAAKhD,GAAAU,IAAL;AAEZ,MADUvC,EAAA,MAAKgB,GAASoE,CAAC,MACf,UACN,CAACP,EAAA,MAAKhD,GAAAe,IAAL,WAAwB5C,EAAA,MAAKgB,GAASoE,CAAC,OACxC,MAAMpF,EAAA,MAAKgB,GAASoE,CAAC;AAAA,EAGhC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,CAAC,UAAU;AACP,eAAWA,KAAKP,EAAA,MAAKhD,GAAAW,IAAL;AAEZ,MADUxC,EAAA,MAAKgB,GAASoE,CAAC,MACf,UACN,CAACP,EAAA,MAAKhD,GAAAe,IAAL,WAAwB5C,EAAA,MAAKgB,GAASoE,CAAC,OACxC,MAAMpF,EAAA,MAAKgB,GAASoE,CAAC;AAAA,EAGhC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,EAAC/F,KAAA,OAAO,UAQPL,KAAA,OAAO,aARPK,GAAe,IAAI;AAChB,WAAO,KAAK;EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAWD,KAAKR,GAAIwG,IAAa,IAAI;AACtB,eAAWD,KAAKP,EAAA,MAAKhD,GAAAU,IAAL,YAAiB;AAC7B,YAAM+C,IAAItF,EAAA,MAAKgB,GAASoE,CAAC,GACnBG,IAAQV,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,KAChCA,EAAE,uBACFA;AACN,UAAIC,MAAU,UAEV1G,EAAG0G,GAAOvF,EAAA,MAAKe,IAASqE,CAAC,GAAG,IAAI;AAChC,eAAO,KAAK,IAAIpF,EAAA,MAAKe,IAASqE,CAAC,GAAGC,CAAU;AAAA,IAEnD;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYD,QAAQxG,GAAI2G,IAAQ,MAAM;AACtB,eAAWJ,KAAKP,EAAA,MAAKhD,GAAAU,IAAL,YAAiB;AAC7B,YAAM+C,IAAItF,EAAA,MAAKgB,GAASoE,CAAC,GACnBG,IAAQV,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,KAChCA,EAAE,uBACFA;AACN,MAAIC,MAAU,UAEd1G,EAAG,KAAK2G,GAAOD,GAAOvF,EAAA,MAAKe,IAASqE,CAAC,GAAG,IAAI;AAAA,IAC/C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,SAASvG,GAAI2G,IAAQ,MAAM;AACvB,eAAWJ,KAAKP,EAAA,MAAKhD,GAAAW,IAAL,YAAkB;AAC9B,YAAM8C,IAAItF,EAAA,MAAKgB,GAASoE,CAAC,GACnBG,IAAQV,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,KAChCA,EAAE,uBACFA;AACN,MAAIC,MAAU,UAEd1G,EAAG,KAAK2G,GAAOD,GAAOvF,EAAA,MAAKe,IAASqE,CAAC,GAAG,IAAI;AAAA,IAC/C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,aAAa;AACT,QAAIK,IAAU;AACd,eAAWL,KAAKP,EAAA,MAAKhD,GAAAW,IAAL,WAAe,EAAE,YAAY,GAAI;AAC7C,MAAIxC,EAAA,MAAKkC,IAAL,WAAckD,OACdP,EAAA,MAAKhD,GAAAkB,IAAL,WAAa/C,EAAA,MAAKe,IAASqE,CAAC,GAAG,WAC/BK,IAAU;AAGlB,WAAOA;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaD,KAAKN,GAAK;AACN,UAAMC,IAAIpF,EAAA,MAAKc,IAAQ,IAAIqE,CAAG;AAC9B,QAAIC,MAAM;AACN;AACJ,UAAME,IAAItF,EAAA,MAAKgB,GAASoE,CAAC,GACnBG,IAAQV,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,KAChCA,EAAE,uBACFA;AACN,QAAIC,MAAU;AACV;AACJ,UAAMG,IAAQ,EAAE,OAAAH;AAChB,QAAIvF,EAAA,MAAKyB,OAASzB,EAAA,MAAKwB,KAAS;AAC5B,YAAMiC,IAAMzD,EAAA,MAAKyB,IAAM2D,CAAC,GAClBO,IAAQ3F,EAAA,MAAKwB,IAAQ4D,CAAC;AAC5B,UAAI3B,KAAOkC,GAAO;AACd,cAAMC,IAASnC,KAAOnF,GAAK,IAAK,IAAGqH;AACnC,QAAAD,EAAM,MAAME,GACZF,EAAM,QAAQ,KAAK;MACtB;AAAA,IACJ;AACD,WAAI1F,EAAA,MAAKuB,QACLmE,EAAM,OAAO1F,EAAA,MAAKuB,IAAO6D,CAAC,IAEvBM;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcD,OAAO;AACH,UAAMG,IAAM,CAAA;AACZ,eAAWT,KAAKP,EAAA,MAAKhD,GAAAU,IAAL,WAAc,EAAE,YAAY,GAAI,IAAK;AACjD,YAAM4C,IAAMnF,EAAA,MAAKe,IAASqE,CAAC,GACrBE,IAAItF,EAAA,MAAKgB,GAASoE,CAAC,GACnBG,IAAQV,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,KAChCA,EAAE,uBACFA;AACN,UAAIC,MAAU,UAAaJ,MAAQ;AAC/B;AACJ,YAAMO,IAAQ,EAAE,OAAAH;AAChB,UAAIvF,EAAA,MAAKyB,OAASzB,EAAA,MAAKwB,KAAS;AAC5B,QAAAkE,EAAM,MAAM1F,EAAA,MAAKyB,IAAM2D,CAAC;AAGxB,cAAMU,IAAMxH,GAAK,IAAG,IAAK0B,EAAA,MAAKwB,IAAQ4D,CAAC;AACvC,QAAAM,EAAM,QAAQ,KAAK,MAAM,KAAK,IAAG,IAAKI,CAAG;AAAA,MAC5C;AACD,MAAI9F,EAAA,MAAKuB,QACLmE,EAAM,OAAO1F,EAAA,MAAKuB,IAAO6D,CAAC,IAE9BS,EAAI,QAAQ,CAACV,GAAKO,CAAK,CAAC;AAAA,IAC3B;AACD,WAAOG;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUD,KAAKA,GAAK;AACN,SAAK,MAAK;AACV,eAAW,CAACV,GAAKO,CAAK,KAAKG,GAAK;AAC5B,UAAIH,EAAM,OAAO;AAOb,cAAMI,IAAM,KAAK,IAAG,IAAKJ,EAAM;AAC/B,QAAAA,EAAM,QAAQpH,GAAK,IAAG,IAAKwH;AAAA,MAC9B;AACD,WAAK,IAAIX,GAAKO,EAAM,OAAOA,CAAK;AAAA,IACnC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA+BD,IAAIV,GAAGM,GAAGS,IAAa,CAAA,GAAI;AA13B/B,QAAA/G,GAAAK,GAAA2G,GAAAC,GAAAC;AA23BQ,QAAIZ,MAAM;AACN,kBAAK,OAAON,CAAC,GACN;AAEX,UAAM,EAAE,KAAAvB,IAAM,KAAK,KAAK,OAAAkC,GAAO,gBAAA1B,IAAiB,KAAK,gBAAgB,iBAAAT,IAAkB,KAAK,iBAAiB,QAAA2C,EAAM,IAAMJ;AACzH,QAAI,EAAE,aAAA7B,IAAc,KAAK,YAAW,IAAK6B;AACzC,UAAMnG,IAAOI,EAAA,MAAKsC,IAAL,WAAkB0C,GAAGM,GAAGS,EAAW,QAAQ,GAAGvC;AAG3D,QAAI,KAAK,gBAAgB5D,IAAO,KAAK;AACjC,aAAIuG,MACAA,EAAO,MAAM,QACbA,EAAO,uBAAuB,KAGlCtB,EAAA,MAAKhD,GAAAkB,IAAL,WAAaiC,GAAG,QACT;AAEX,QAAIC,IAAQjF,EAAA,MAAKY,QAAU,IAAI,SAAYZ,EAAA,MAAKc,IAAQ,IAAIkE,CAAC;AAC7D,QAAIC,MAAU;AAEV,MAAAA,IAASjF,EAAA,MAAKY,QAAU,IAClBZ,EAAA,MAAKoB,MACLpB,EAAA,MAAKqB,IAAM,WAAW,IAClBrB,EAAA,MAAKqB,IAAM,IAAK,IAChBrB,EAAA,MAAKY,QAAUZ,EAAA,MAAKM,MAChBuE,EAAA,MAAKhD,GAAAa,IAAL,WAAY,MACZ1C,EAAA,MAAKY,KACnBZ,EAAA,MAAKe,IAASkE,CAAK,IAAID,GACvBhF,EAAA,MAAKgB,GAASiE,CAAK,IAAIK,GACvBtF,EAAA,MAAKc,IAAQ,IAAIkE,GAAGC,CAAK,GACzBjF,EAAA,MAAKiB,IAAMjB,EAAA,MAAKoB,GAAK,IAAI6D,GACzBjF,EAAA,MAAKkB,IAAM+D,CAAK,IAAIjF,EAAA,MAAKoB,KACzBnB,EAAA,MAAKmB,IAAQ6D,IACbmB,GAAA,MAAKxF,IAAL,KACAZ,EAAA,MAAKqC,IAAL,WAAkB4C,GAAOrF,GAAMuG,IAC3BA,MACAA,EAAO,MAAM,QACjBjC,IAAc;AAAA,SAEb;AAED,MAAAW,EAAA,MAAKhD,GAAAiB,IAAL,WAAiBmC;AACjB,YAAMoB,IAASrG,EAAA,MAAKgB,GAASiE,CAAK;AAClC,UAAIK,MAAMe,GAAQ;AACd,YAAIrG,EAAA,MAAK2B,OAAmBkD,EAAA,MAAKhD,GAAAe,IAAL,WAAwByD,IAAS;AACzD,UAAAA,EAAO,kBAAkB,MAAM,IAAI,MAAM,UAAU,CAAC;AACpD,gBAAM,EAAE,sBAAsBnG,EAAG,IAAGmG;AACpC,UAAInG,MAAM,UAAa,CAAC+D,MAChBjE,EAAA,MAAK0B,SACL1C,IAAAgB,EAAA,MAAKQ,QAAL,QAAAxB,EAAA,WAAgBkB,GAAG8E,GAAG,SAEtBhF,EAAA,MAAK4B,SACLvC,IAAAW,EAAA,MAAKsB,QAAL,QAAAjC,EAAgB,KAAK,CAACa,GAAG8E,GAAG,KAAK;AAAA,QAG5C,MACI,CAAKf,MACFjE,EAAA,MAAK0B,SACLsE,IAAAhG,EAAA,MAAKQ,QAAL,QAAAwF,EAAA,WAAgBK,GAAQrB,GAAG,SAE3BhF,EAAA,MAAK4B,SACLqE,IAAAjG,EAAA,MAAKsB,QAAL,QAAA2E,EAAgB,KAAK,CAACI,GAAQrB,GAAG,KAAK;AAM9C,YAHAhF,EAAA,MAAKoC,IAAL,WAAqB6C,IACrBjF,EAAA,MAAKqC,IAAL,WAAkB4C,GAAOrF,GAAMuG,IAC/BnG,EAAA,MAAKgB,GAASiE,CAAK,IAAIK,GACnBa,GAAQ;AACR,UAAAA,EAAO,MAAM;AACb,gBAAMG,IAAWD,KAAUxB,EAAA,MAAKhD,GAAAe,IAAL,WAAwByD,KAC7CA,EAAO,uBACPA;AACN,UAAIC,MAAa,WACbH,EAAO,WAAWG;AAAA,QACzB;AAAA,MACJ,MACI,CAAIH,MACLA,EAAO,MAAM;AAAA,IAEpB;AAWD,QAVI1C,MAAQ,KAAK,CAACzD,EAAA,MAAKyB,OACnBoD,EAAA,MAAKhD,GAAAC,IAAL,YAEA9B,EAAA,MAAKyB,QACAyC,KACDlE,EAAA,MAAKiC,IAAL,WAAiBgD,GAAOxB,GAAKkC,IAE7BQ,KACAnG,EAAA,MAAKgC,IAAL,WAAgBmE,GAAQlB,KAE5B,CAAChB,KAAkBjE,EAAA,MAAK4B,OAAoB5B,EAAA,MAAKsB,KAAW;AAC5D,YAAMiF,IAAKvG,EAAA,MAAKsB;AAChB,UAAIkF;AACJ,aAAQA,IAAOD,KAAA,gBAAAA,EAAI;AACf,SAAAL,IAAAlG,EAAA,MAAKS,QAAL,QAAAyF,EAAA,WAAqB,GAAGM;AAAA,IAE/B;AACD,WAAO;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,MAAM;AAn+BV,QAAAxH;AAo+BQ,QAAI;AACA,aAAOgB,EAAA,MAAKY,OAAO;AACf,cAAM6F,IAAMzG,EAAA,MAAKgB,GAAShB,EAAA,MAAKmB,GAAK;AAEpC,YADA0D,EAAA,MAAKhD,GAAAa,IAAL,WAAY,KACRmC,EAAA,MAAKhD,GAAAe,IAAL,WAAwB6D;AACxB,cAAIA,EAAI;AACJ,mBAAOA,EAAI;AAAA,mBAGVA,MAAQ;AACb,iBAAOA;AAAA,MAEd;AAAA,IACJ,UACO;AACJ,UAAIzG,EAAA,MAAK4B,OAAoB5B,EAAA,MAAKsB,KAAW;AACzC,cAAMiF,IAAKvG,EAAA,MAAKsB;AAChB,YAAIkF;AACJ,eAAQA,IAAOD,KAAA,gBAAAA,EAAI;AACf,WAAAvH,IAAAgB,EAAA,MAAKS,QAAL,QAAAzB,EAAA,WAAqB,GAAGwH;AAAA,MAE/B;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkDD,IAAIxB,GAAG0B,IAAa,IAAI;AACpB,UAAM,EAAE,gBAAA7C,IAAiB,KAAK,gBAAgB,QAAAsC,EAAM,IAAKO,GACnDzB,IAAQjF,EAAA,MAAKc,IAAQ,IAAIkE,CAAC;AAChC,QAAIC,MAAU,QAAW;AACrB,YAAMK,IAAItF,EAAA,MAAKgB,GAASiE,CAAK;AAC7B,UAAIJ,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,MACxBA,EAAE,yBAAyB;AAC3B,eAAO;AAEX,UAAKtF,EAAA,MAAKkC,IAAL,WAAc+C;AAUd,QAAIkB,MACLA,EAAO,MAAM,SACbnG,EAAA,MAAKgC,IAAL,WAAgBmE,GAAQlB;AAAA,UAXxB,QAAIpB,KACA7D,EAAA,MAAK+B,IAAL,WAAoBkD,IAEpBkB,MACAA,EAAO,MAAM,OACbnG,EAAA,MAAKgC,IAAL,WAAgBmE,GAAQlB,KAErB;AAAA,IAMd,MACI,CAAIkB,MACLA,EAAO,MAAM;AAEjB,WAAO;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,KAAKnB,GAAG2B,IAAc,IAAI;AACtB,UAAM,EAAE,YAAA7C,IAAa,KAAK,WAAU,IAAK6C,GACnC1B,IAAQjF,EAAA,MAAKc,IAAQ,IAAIkE,CAAC;AAChC,QAAIC,MAAU,UACT,CAACnB,KAAc9D,EAAA,MAAKkC,IAAL,WAAc+C;AAC9B;AAEJ,UAAMK,IAAItF,EAAA,MAAKgB,GAASiE,CAAK;AAE7B,WAAOJ,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,KAAKA,EAAE,uBAAuBA;AAAA,EAChE;AAAA,EAyID,MAAM,MAAMN,GAAG4B,IAAe,IAAI;AAC9B,UAAM;AAAA;AAAA,MAEN,YAAA9C,IAAa,KAAK;AAAA,MAAY,gBAAAF,IAAiB,KAAK;AAAA,MAAgB,oBAAAY,IAAqB,KAAK;AAAA;AAAA,MAE9F,KAAAf,IAAM,KAAK;AAAA,MAAK,gBAAAQ,IAAiB,KAAK;AAAA,MAAgB,MAAArE,IAAO;AAAA,MAAG,iBAAA4D,IAAkB,KAAK;AAAA,MAAiB,aAAAU,IAAc,KAAK;AAAA;AAAA,MAE3H,0BAAAK,IAA2B,KAAK;AAAA,MAA0B,4BAAAE,IAA6B,KAAK;AAAA,MAA4B,kBAAAE,IAAmB,KAAK;AAAA,MAAkB,wBAAAD,IAAyB,KAAK;AAAA,MAAwB,SAAAQ;AAAA,MAAS,cAAA2B,IAAe;AAAA,MAAO,QAAAV;AAAA,MAAQ,QAAAW;AAAA,IAAS,IAAGF;AAC3Q,QAAI,CAAC5G,EAAA,MAAK2B;AACN,aAAIwE,MACAA,EAAO,QAAQ,QACZ,KAAK,IAAInB,GAAG;AAAA,QACf,YAAAlB;AAAA,QACA,gBAAAF;AAAA,QACA,oBAAAY;AAAA,QACA,QAAA2B;AAAA,MAChB,CAAa;AAEL,UAAMjD,IAAU;AAAA,MACZ,YAAAY;AAAA,MACA,gBAAAF;AAAA,MACA,oBAAAY;AAAA,MACA,KAAAf;AAAA,MACA,gBAAAQ;AAAA,MACA,MAAArE;AAAA,MACA,iBAAA4D;AAAA,MACA,aAAAU;AAAA,MACA,0BAAAK;AAAA,MACA,4BAAAE;AAAA,MACA,wBAAAC;AAAA,MACA,kBAAAC;AAAA,MACA,QAAAwB;AAAA,MACA,QAAAW;AAAA,IACZ;AACQ,QAAI7B,IAAQjF,EAAA,MAAKc,IAAQ,IAAIkE,CAAC;AAC9B,QAAIC,MAAU,QAAW;AACrB,MAAIkB,MACAA,EAAO,QAAQ;AACnB,YAAMpB,IAAIF,EAAA,MAAKhD,GAAAc,IAAL,WAAsBqC,GAAGC,GAAO/B,GAASgC;AACnD,aAAQH,EAAE,aAAaA;AAAA,IAC1B,OACI;AAED,YAAMO,IAAItF,EAAA,MAAKgB,GAASiE,CAAK;AAC7B,UAAIJ,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,IAAI;AAC5B,cAAMyB,IAAQjD,KAAcwB,EAAE,yBAAyB;AACvD,eAAIa,MACAA,EAAO,QAAQ,YACXY,MACAZ,EAAO,gBAAgB,MAExBY,IAAQzB,EAAE,uBAAwBA,EAAE,aAAaA;AAAA,MAC3D;AAGD,YAAM0B,IAAUhH,EAAA,MAAKkC,IAAL,WAAc+C;AAC9B,UAAI,CAAC4B,KAAgB,CAACG;AAClB,eAAIb,MACAA,EAAO,QAAQ,QACnBtB,EAAA,MAAKhD,GAAAiB,IAAL,WAAiBmC,IACbrB,KACA5D,EAAA,MAAK+B,IAAL,WAAoBkD,IAEpBkB,KACAnG,EAAA,MAAKgC,IAAL,WAAgBmE,GAAQlB,IACrBK;AAIX,YAAMP,IAAIF,EAAA,MAAKhD,GAAAc,IAAL,WAAsBqC,GAAGC,GAAO/B,GAASgC,IAE7C+B,IADWlC,EAAE,yBAAyB,UACfjB;AAC7B,aAAIqC,MACAA,EAAO,QAAQa,IAAU,UAAU,WAC/BC,KAAYD,MACZb,EAAO,gBAAgB,MAExBc,IAAWlC,EAAE,uBAAwBA,EAAE,aAAaA;AAAA,IAC9D;AAAA,EACJ;AAAA,EACD,MAAM,WAAWC,GAAG4B,IAAe,IAAI;AACnC,UAAMtB,IAAI,MAAM,KAAK,MAAMN,GAAG4B,CAAY;AAC1C,QAAItB,MAAM;AACN,YAAM,IAAI,MAAM,4BAA4B;AAChD,WAAOA;AAAA,EACV;AAAA,EACD,KAAKN,GAAGkC,IAAc,IAAI;AACtB,UAAM5C,IAAatE,EAAA,MAAKW;AACxB,QAAI,CAAC2D;AACD,YAAM,IAAI,MAAM,uCAAuC;AAE3D,UAAM,EAAE,SAAAY,GAAS,cAAA2B,GAAc,GAAG3D,EAAO,IAAKgE,GACxC5B,IAAI,KAAK,IAAIN,GAAG9B,CAAO;AAC7B,QAAI,CAAC2D,KAAgBvB,MAAM;AACvB,aAAOA;AACX,UAAM6B,IAAK7C,EAAWU,GAAGM,GAAG;AAAA,MACxB,SAAApC;AAAA,MACA,SAAAgC;AAAA,IACZ,CAAS;AACD,gBAAK,IAAIF,GAAGmC,GAAIjE,CAAO,GAChBiE;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,IAAInC,GAAGK,IAAa,IAAI;AACpB,UAAM,EAAE,YAAAvB,IAAa,KAAK,YAAY,gBAAAF,IAAiB,KAAK,gBAAgB,oBAAAY,IAAqB,KAAK,oBAAoB,QAAA2B,EAAM,IAAMd,GAChIJ,IAAQjF,EAAA,MAAKc,IAAQ,IAAIkE,CAAC;AAChC,QAAIC,MAAU,QAAW;AACrB,YAAMM,IAAQvF,EAAA,MAAKgB,GAASiE,CAAK,GAC3BmC,IAAWvC,EAAA,MAAKhD,GAAAe,IAAL,WAAwB2C;AAGzC,aAFIY,KACAnG,EAAA,MAAKgC,IAAL,WAAgBmE,GAAQlB,IACxBjF,EAAA,MAAKkC,IAAL,WAAc+C,MACVkB,MACAA,EAAO,MAAM,UAEZiB,KASGjB,KACArC,KACAyB,EAAM,yBAAyB,WAC/BY,EAAO,gBAAgB,KAEpBrC,IAAayB,EAAM,uBAAuB,WAb5Cf,KACDK,EAAA,MAAKhD,GAAAkB,IAAL,WAAaiC,GAAG,WAEhBmB,KAAUrC,MACVqC,EAAO,gBAAgB,KACpBrC,IAAayB,IAAQ,YAY5BY,MACAA,EAAO,MAAM,QAMbiB,IACO7B,EAAM,wBAEjBV,EAAA,MAAKhD,GAAAiB,IAAL,WAAiBmC,IACbrB,KACA5D,EAAA,MAAK+B,IAAL,WAAoBkD,IAEjBM;AAAA,IAEd,MACI,CAAIY,MACLA,EAAO,MAAM;AAAA,EAEpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8BD,OAAOnB,GAAG;AACN,WAAOH,EAAA,MAAKhD,GAAAkB,IAAL,WAAaiC,GAAG;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAwDD,QAAQ;AACJ,WAAOH,EAAA,MAAKhD,GAAAmB,IAAL,WAAY;AAAA,EACtB;AAwCL;AAr3CI1C,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eA8DAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,IAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eACAC,KAAA,eArFGC,IAAA,eAsRHC,KAAsB,WAAG;AACrB,QAAMuF,IAAO,IAAI1H,GAAUK,EAAA,MAAKM,GAAI,GAC9BgH,IAAS,IAAI3H,GAAUK,EAAA,MAAKM,GAAI;AACtC,EAAAL,EAAA,MAAKwB,IAAQ4F,IACbpH,EAAA,MAAKuB,IAAU8F,IACfrH,EAAA,MAAKgC,IAAc,CAACgD,GAAOxB,GAAKkC,IAAQrH,GAAK,UAAU;AAGnD,QAFAgJ,EAAOrC,CAAK,IAAIxB,MAAQ,IAAIkC,IAAQ,GACpC0B,EAAKpC,CAAK,IAAIxB,GACVA,MAAQ,KAAK,KAAK,cAAc;AAChC,YAAM8D,IAAI,WAAW,MAAM;AACvB,QAAIvH,EAAA,MAAKkC,IAAL,WAAc+C,MACdJ,EAAA,MAAKhD,GAAAkB,IAAL,WAAa/C,EAAA,MAAKe,IAASkE,CAAK,GAAG;AAAA,MAE3D,GAAmBxB,IAAM,CAAC;AAGV,MAAI8D,EAAE,SACFA,EAAE,MAAK;AAAA,IAGd;AAAA,EACb,IACQtH,EAAA,MAAK8B,IAAiB,CAAAkD,MAAS;AAC3B,IAAAqC,EAAOrC,CAAK,IAAIoC,EAAKpC,CAAK,MAAM,IAAI3G,GAAK,IAAK,IAAG;AAAA,EAC7D,IACQ2B,EAAA,MAAK+B,IAAa,CAACmE,GAAQlB,MAAU;AACjC,QAAIoC,EAAKpC,CAAK,GAAG;AACb,YAAMxB,IAAM4D,EAAKpC,CAAK,GAChBU,IAAQ2B,EAAOrC,CAAK;AAE1B,UAAI,CAACxB,KAAO,CAACkC;AACT;AACJ,MAAAQ,EAAO,MAAM1C,GACb0C,EAAO,QAAQR,GACfQ,EAAO,MAAMqB,KAAaC;AAC1B,YAAM3B,IAAMK,EAAO,MAAMR;AACzB,MAAAQ,EAAO,eAAe1C,IAAMqC;AAAA,IAC/B;AAAA,EACb;AAGQ,MAAI0B,IAAY;AAChB,QAAMC,IAAS,MAAM;AACjB,UAAMtH,IAAI7B,GAAK;AACf,QAAI,KAAK,gBAAgB,GAAG;AACxB,MAAAkJ,IAAYrH;AACZ,YAAMoH,IAAI,WAAW,MAAOC,IAAY,GAAI,KAAK,aAAa;AAG9D,MAAID,EAAE,SACFA,EAAE,MAAK;AAAA,IAGd;AACD,WAAOpH;AAAA,EACnB;AACQ,OAAK,kBAAkB,CAAAgF,MAAO;AAC1B,UAAMF,IAAQjF,EAAA,MAAKc,IAAQ,IAAIqE,CAAG;AAClC,QAAIF,MAAU;AACV,aAAO;AAEX,UAAMxB,IAAM4D,EAAKpC,CAAK,GAChBU,IAAQ2B,EAAOrC,CAAK;AAC1B,QAAI,CAACxB,KAAO,CAACkC;AACT,aAAO;AAEX,UAAMG,KAAO0B,KAAaC,EAAM,KAAM9B;AACtC,WAAOlC,IAAMqC;AAAA,EACzB,GACQ7F,EAAA,MAAKiC,IAAW,CAAA+C,MAAS;AACrB,UAAM/E,IAAIoH,EAAOrC,CAAK,GAChBsC,IAAIF,EAAKpC,CAAK;AACpB,WAAO,CAAC,CAACsC,KAAK,CAAC,CAACrH,MAAMsH,KAAaC,EAAM,KAAMvH,IAAIqH;AAAA,EAC/D;AACK,GAEDxF,KAAA,eACAC,KAAA,eACAC,KAAA,eAEAC,KAAA,eACAC,KAAuB,WAAG;AACtB,QAAMuF,IAAQ,IAAI/H,GAAUK,EAAA,MAAKM,GAAI;AACrC,EAAAL,EAAA,MAAKY,IAAkB,IACvBZ,EAAA,MAAKsB,IAASmG,IACdzH,EAAA,MAAKmC,IAAkB,CAAA6C,MAAS;AAC5B,IAAAhF,EAAA,MAAKY,IAALb,EAAA,MAAKa,MAAmB6G,EAAMzC,CAAK,IACnCyC,EAAMzC,CAAK,IAAI;AAAA,EAC3B,IACQhF,EAAA,MAAKqC,IAAe,CAAC0C,GAAGM,GAAG1F,GAAM4D,MAAoB;AAGjD,QAAIqB,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C;AACxB,aAAO;AAEX,QAAI,CAAC9F,GAASI,CAAI;AACd,UAAI4D,GAAiB;AACjB,YAAI,OAAOA,KAAoB;AAC3B,gBAAM,IAAI,UAAU,oCAAoC;AAG5D,YADA5D,IAAO4D,EAAgB8B,GAAGN,CAAC,GACvB,CAACxF,GAASI,CAAI;AACd,gBAAM,IAAI,UAAU,0DAA0D;AAAA,MAErF;AAEG,cAAM,IAAI,UAAU,2HAEM;AAGlC,WAAOA;AAAA,EACnB,IACQK,EAAA,MAAKoC,IAAe,CAAC4C,GAAOrF,GAAMuG,MAAW;AAEzC,QADAuB,EAAMzC,CAAK,IAAIrF,GACXI,EAAA,MAAKO,KAAU;AACf,YAAM4D,IAAUnE,EAAA,MAAKO,MAAWmH,EAAMzC,CAAK;AAC3C,aAAOjF,EAAA,MAAKa,MAAkBsD;AAC1B,QAAAU,EAAA,MAAKhD,GAAAa,IAAL,WAAY;AAAA,IAEnB;AACD,IAAAzC,EAAA,MAAKY,IAALb,EAAA,MAAKa,MAAmB6G,EAAMzC,CAAK,IAC/BkB,MACAA,EAAO,YAAYvG,GACnBuG,EAAO,sBAAsBnG,EAAA,MAAKa;AAAA,EAElD;AACK,GACDuB,KAAA,eACAC,KAAA,eACAC,KAAA,eAMCC,KAAQ,WAAC,EAAE,YAAAuB,IAAa,KAAK,WAAU,IAAK,CAAA,GAAI;AAC7C,MAAI9D,EAAA,MAAKY;AACL,aAASwE,IAAIpF,EAAA,MAAKoB,KACV,GAACyD,EAAA,MAAKhD,GAAAY,IAAL,WAAmB2C,QAGpBtB,KAAc,CAAC9D,EAAA,MAAKkC,IAAL,WAAckD,QAC7B,MAAMA,IAENA,MAAMpF,EAAA,MAAKmB;AAIX,MAAAiE,IAAIpF,EAAA,MAAKkB,IAAMkE,CAAC;AAI/B,GACA5C,KAAS,WAAC,EAAE,YAAAsB,IAAa,KAAK,WAAU,IAAK,CAAA,GAAI;AAC9C,MAAI9D,EAAA,MAAKY;AACL,aAASwE,IAAIpF,EAAA,MAAKmB,KACV,GAAC0D,EAAA,MAAKhD,GAAAY,IAAL,WAAmB2C,QAGpBtB,KAAc,CAAC9D,EAAA,MAAKkC,IAAL,WAAckD,QAC7B,MAAMA,IAENA,MAAMpF,EAAA,MAAKoB;AAIX,MAAAgE,IAAIpF,EAAA,MAAKiB,IAAMmE,CAAC;AAI/B,GACD3C,KAAa,SAACwC,GAAO;AACjB,SAAQA,MAAU,UACdjF,EAAA,MAAKc,IAAQ,IAAId,EAAA,MAAKe,IAASkE,CAAK,CAAC,MAAMA;AAClD,GA0aDvC,KAAM,SAACiF,GAAM;AA5/BjB,MAAA3I,GAAAK;AA6/BQ,QAAMuI,IAAO5H,EAAA,MAAKmB,KACZ6D,IAAIhF,EAAA,MAAKe,IAAS6G,CAAI,GACtBtC,IAAItF,EAAA,MAAKgB,GAAS4G,CAAI;AAC5B,SAAI5H,EAAA,MAAK2B,OAAmBkD,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,KAChDA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,KAEzCtF,EAAA,MAAK0B,OAAe1B,EAAA,MAAK4B,SAC1B5B,EAAA,MAAK0B,SACL1C,IAAAgB,EAAA,MAAKQ,QAAL,QAAAxB,EAAA,WAAgBsG,GAAGN,GAAG,WAEtBhF,EAAA,MAAK4B,SACLvC,IAAAW,EAAA,MAAKsB,QAAL,QAAAjC,EAAgB,KAAK,CAACiG,GAAGN,GAAG,OAAO,MAG3ChF,EAAA,MAAKoC,IAAL,WAAqBwF,IAEjBD,MACA3H,EAAA,MAAKe,IAAS6G,CAAI,IAAI,QACtB5H,EAAA,MAAKgB,GAAS4G,CAAI,IAAI,QACtB5H,EAAA,MAAKqB,IAAM,KAAKuG,CAAI,IAEpB5H,EAAA,MAAKY,QAAU,KACfX,EAAA,MAAKkB,IAAQlB,EAAA,MAAKmB,IAAQ,KAC1BpB,EAAA,MAAKqB,IAAM,SAAS,KAGpBpB,EAAA,MAAKkB,IAAQnB,EAAA,MAAKiB,IAAM2G,CAAI,IAEhC5H,EAAA,MAAKc,IAAQ,OAAOkE,CAAC,GACrBoB,GAAA,MAAKxF,IAAL,KACOgH;AACV,GAgEDjF,KAAgB,SAACqC,GAAGC,GAAO/B,GAASgC,GAAS;AACzC,QAAMI,IAAIL,MAAU,SAAY,SAAYjF,EAAA,MAAKgB,GAASiE,CAAK;AAC/D,MAAIJ,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C;AACxB,WAAOA;AAEX,QAAMuC,IAAK,IAAI/I,MACT,EAAE,QAAAgI,EAAQ,IAAG5D;AAEnB,EAAA4D,KAAA,QAAAA,EAAQ,iBAAiB,SAAS,MAAMe,EAAG,MAAMf,EAAO,MAAM,GAAG;AAAA,IAC7D,QAAQe,EAAG;AAAA,EACvB;AACQ,QAAMC,IAAY;AAAA,IACd,QAAQD,EAAG;AAAA,IACX,SAAA3E;AAAA,IACA,SAAAgC;AAAA,EACZ,GACc6C,IAAK,CAACzC,GAAG0C,IAAc,OAAU;AACnC,UAAM,EAAE,SAAAC,EAAO,IAAKJ,EAAG,QACjBK,IAAchF,EAAQ,oBAAoBoC,MAAM;AAYtD,QAXIpC,EAAQ,WACJ+E,KAAW,CAACD,KACZ9E,EAAQ,OAAO,eAAe,IAC9BA,EAAQ,OAAO,aAAa2E,EAAG,OAAO,QAClCK,MACAhF,EAAQ,OAAO,oBAAoB,OAGvCA,EAAQ,OAAO,gBAAgB,KAGnC+E,KAAW,CAACC,KAAe,CAACF;AAC5B,aAAOG,EAAUN,EAAG,OAAO,MAAM;AAGrC,UAAMO,IAAKrD;AACX,WAAI/E,EAAA,MAAKgB,GAASiE,CAAK,MAAMF,MACrBO,MAAM,SACF8C,EAAG,uBACHpI,EAAA,MAAKgB,GAASiE,CAAK,IAAImD,EAAG,uBAG1BvD,EAAA,MAAKhD,GAAAkB,IAAL,WAAaiC,GAAG,YAIhB9B,EAAQ,WACRA,EAAQ,OAAO,eAAe,KAClC,KAAK,IAAI8B,GAAGM,GAAGwC,EAAU,OAAO,KAGjCxC;AAAA,EACnB,GACc+C,IAAK,CAACC,OACJpF,EAAQ,WACRA,EAAQ,OAAO,gBAAgB,IAC/BA,EAAQ,OAAO,aAAaoF,IAEzBH,EAAUG,CAAE,IAEjBH,IAAY,CAACG,MAAO;AACtB,UAAM,EAAE,SAAAL,EAAO,IAAKJ,EAAG,QACjBU,IAAoBN,KAAW/E,EAAQ,wBACvCY,IAAayE,KAAqBrF,EAAQ,4BAC1CsF,IAAW1E,KAAcZ,EAAQ,0BACjCkF,IAAKrD;AAgBX,QAfI/E,EAAA,MAAKgB,GAASiE,CAAK,MAAMF,MAGb,CAACyD,KAAYJ,EAAG,yBAAyB,SAEjDvD,EAAA,MAAKhD,GAAAkB,IAAL,WAAaiC,GAAG,WAEVuD,MAKNvI,EAAA,MAAKgB,GAASiE,CAAK,IAAImD,EAAG,wBAG9BtE;AACA,aAAIZ,EAAQ,UAAUkF,EAAG,yBAAyB,WAC9ClF,EAAQ,OAAO,gBAAgB,KAE5BkF,EAAG;AAET,QAAIA,EAAG,eAAeA;AACvB,YAAME;AAAA,EAEtB,GACcG,IAAQ,CAACC,GAAKC,MAAQ;AAtrCpC,QAAA3J;AAurCY,UAAM4J,KAAM5J,IAAAgB,EAAA,MAAKU,QAAL,gBAAA1B,EAAA,WAAoBgG,GAAGM,GAAGwC;AACtC,IAAIc,KAAOA,aAAe,WACtBA,EAAI,KAAK,CAAAtD,MAAKoD,EAAIpD,MAAM,SAAY,SAAYA,CAAC,GAAGqD,CAAG,GAK3Dd,EAAG,OAAO,iBAAiB,SAAS,MAAM;AACtC,OAAI,CAAC3E,EAAQ,oBACTA,EAAQ,4BACRwF,EAAI,MAAS,GAETxF,EAAQ,2BACRwF,IAAM,CAAApD,MAAKyC,EAAGzC,GAAG,EAAI;AAAA,IAG7C,CAAa;AAAA,EACb;AACQ,EAAIpC,EAAQ,WACRA,EAAQ,OAAO,kBAAkB;AACrC,QAAM6B,IAAI,IAAI,QAAQ0D,CAAK,EAAE,KAAKV,GAAIM,CAAE,GAClCD,IAAK,OAAO,OAAOrD,GAAG;AAAA,IACxB,mBAAmB8C;AAAA,IACnB,sBAAsBvC;AAAA,IACtB,YAAY;AAAA,EACxB,CAAS;AACD,SAAIL,MAAU,UAEV,KAAK,IAAID,GAAGoD,GAAI,EAAE,GAAGN,EAAU,SAAS,QAAQ,OAAS,CAAE,GAC3D7C,IAAQjF,EAAA,MAAKc,IAAQ,IAAIkE,CAAC,KAG1BhF,EAAA,MAAKgB,GAASiE,CAAK,IAAImD,GAEpBA;AACV,GACDxF,KAAkB,SAACmC,GAAG;AAClB,MAAI,CAAC/E,EAAA,MAAK2B;AACN,WAAO;AACX,QAAMkH,IAAI9D;AACV,SAAQ,CAAC,CAAC8D,KACNA,aAAa,WACbA,EAAE,eAAe,sBAAsB,KACvCA,EAAE,6BAA6B/J;AACtC,GAgKD+D,KAAQ,SAACkC,GAAG5E,GAAG;AACX,EAAAH,EAAA,MAAKkB,IAAMf,CAAC,IAAI4E,GAChB/E,EAAA,MAAKiB,IAAM8D,CAAC,IAAI5E;AACnB,GACD2C,KAAW,SAACmC,GAAO;AASf,EAAIA,MAAUjF,EAAA,MAAKoB,QACX6D,MAAUjF,EAAA,MAAKmB,MACflB,EAAA,MAAKkB,IAAQnB,EAAA,MAAKiB,IAAMgE,CAAK,KAG7BJ,EAAA,MAAKhD,GAAAgB,IAAL,WAAc7C,EAAA,MAAKkB,IAAM+D,CAAK,GAAGjF,EAAA,MAAKiB,IAAMgE,CAAK,IAErDJ,EAAA,MAAKhD,GAAAgB,IAAL,WAAc7C,EAAA,MAAKoB,KAAO6D,IAC1BhF,EAAA,MAAKmB,IAAQ6D;AAEpB,GASDlC,KAAO,SAACiC,GAAG5F,GAAQ;AAn6CvB,MAAAJ,GAAAK,GAAA2G,GAAAC;AAo6CQ,MAAIR,IAAU;AACd,MAAIzF,EAAA,MAAKY,QAAU,GAAG;AAClB,UAAMqE,IAAQjF,EAAA,MAAKc,IAAQ,IAAIkE,CAAC;AAChC,QAAIC,MAAU;AAEV,UADAQ,IAAU,IACNzF,EAAA,MAAKY,QAAU;AACf,QAAAiE,EAAA,MAAKhD,GAAAmB,IAAL,WAAY5D;AAAA,WAEX;AACD,QAAAY,EAAA,MAAKoC,IAAL,WAAqB6C;AACrB,cAAMK,IAAItF,EAAA,MAAKgB,GAASiE,CAAK;AAe7B,YAdIJ,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C,KACxBA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,KAEzCtF,EAAA,MAAK0B,OAAe1B,EAAA,MAAK4B,SAC1B5B,EAAA,MAAK0B,SACL1C,IAAAgB,EAAA,MAAKQ,QAAL,QAAAxB,EAAA,WAAgBsG,GAAGN,GAAG5F,KAEtBY,EAAA,MAAK4B,SACLvC,IAAAW,EAAA,MAAKsB,QAAL,QAAAjC,EAAgB,KAAK,CAACiG,GAAGN,GAAG5F,CAAM,MAG1CY,EAAA,MAAKc,IAAQ,OAAOkE,CAAC,GACrBhF,EAAA,MAAKe,IAASkE,CAAK,IAAI,QACvBjF,EAAA,MAAKgB,GAASiE,CAAK,IAAI,QACnBA,MAAUjF,EAAA,MAAKoB;AACf,UAAAnB,EAAA,MAAKmB,IAAQpB,EAAA,MAAKkB,IAAM+D,CAAK;AAAA,iBAExBA,MAAUjF,EAAA,MAAKmB;AACpB,UAAAlB,EAAA,MAAKkB,IAAQnB,EAAA,MAAKiB,IAAMgE,CAAK;AAAA,aAE5B;AACD,gBAAM6D,IAAK9I,EAAA,MAAKkB,IAAM+D,CAAK;AAC3B,UAAAjF,EAAA,MAAKiB,IAAM6H,CAAE,IAAI9I,EAAA,MAAKiB,IAAMgE,CAAK;AACjC,gBAAM8D,IAAK/I,EAAA,MAAKiB,IAAMgE,CAAK;AAC3B,UAAAjF,EAAA,MAAKkB,IAAM6H,CAAE,IAAI/I,EAAA,MAAKkB,IAAM+D,CAAK;AAAA,QACpC;AACD,QAAAmB,GAAA,MAAKxF,IAAL,KACAZ,EAAA,MAAKqB,IAAM,KAAK4D,CAAK;AAAA,MACxB;AAAA,EAER;AACD,MAAIjF,EAAA,MAAK4B,SAAoBoE,IAAAhG,EAAA,MAAKsB,QAAL,QAAA0E,EAAgB,SAAQ;AACjD,UAAMO,IAAKvG,EAAA,MAAKsB;AAChB,QAAIkF;AACJ,WAAQA,IAAOD,KAAA,gBAAAA,EAAI;AACf,OAAAN,IAAAjG,EAAA,MAAKS,QAAL,QAAAwF,EAAA,WAAqB,GAAGO;AAAA,EAE/B;AACD,SAAOf;AACV,GAODzC,KAAM,SAAC5D,GAAQ;AA79CnB,MAAAJ,GAAAK,GAAA2G;AA89CQ,aAAWf,KAASJ,EAAA,MAAKhD,GAAAW,IAAL,WAAe,EAAE,YAAY,GAAI,IAAK;AACtD,UAAM8C,IAAItF,EAAA,MAAKgB,GAASiE,CAAK;AAC7B,QAAIJ,EAAA,MAAKhD,GAAAe,IAAL,WAAwB0C;AACxB,MAAAA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC;AAAA,SAE7C;AACD,YAAMN,IAAIhF,EAAA,MAAKe,IAASkE,CAAK;AAC7B,MAAIjF,EAAA,MAAK0B,SACL1C,IAAAgB,EAAA,MAAKQ,QAAL,QAAAxB,EAAA,WAAgBsG,GAAGN,GAAG5F,KAEtBY,EAAA,MAAK4B,SACLvC,IAAAW,EAAA,MAAKsB,QAAL,QAAAjC,EAAgB,KAAK,CAACiG,GAAGN,GAAG5F,CAAM;AAAA,IAEzC;AAAA,EACJ;AAgBD,MAfAY,EAAA,MAAKc,IAAQ,SACbd,EAAA,MAAKgB,GAAS,KAAK,MAAS,GAC5BhB,EAAA,MAAKe,IAAS,KAAK,MAAS,GACxBf,EAAA,MAAKyB,OAASzB,EAAA,MAAKwB,QACnBxB,EAAA,MAAKyB,IAAM,KAAK,CAAC,GACjBzB,EAAA,MAAKwB,IAAQ,KAAK,CAAC,IAEnBxB,EAAA,MAAKuB,OACLvB,EAAA,MAAKuB,IAAO,KAAK,CAAC,GAEtBtB,EAAA,MAAKkB,IAAQ,IACblB,EAAA,MAAKmB,IAAQ,IACbpB,EAAA,MAAKqB,IAAM,SAAS,GACpBpB,EAAA,MAAKY,IAAkB,IACvBZ,EAAA,MAAKW,IAAQ,IACTZ,EAAA,MAAK4B,OAAoB5B,EAAA,MAAKsB,KAAW;AACzC,UAAMiF,IAAKvG,EAAA,MAAKsB;AAChB,QAAIkF;AACJ,WAAQA,IAAOD,KAAA,gBAAAA,EAAI;AACf,OAAAP,IAAAhG,EAAA,MAAKS,QAAL,QAAAuF,EAAA,WAAqB,GAAGQ;AAAA,EAE/B;AACJ;AAt3CE,IAAMwC,KAAN/F;AC7IP,SAASgG,GAAO,GAAG;AACf,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAChC,UAAM,IAAI,MAAM,2BAA2B,CAAC,EAAE;AACtD;AAKA,SAASC,GAAML,MAAMM,GAAS;AAC1B,MAAI,EAAEN,aAAa;AACf,UAAM,IAAI,MAAM,qBAAqB;AACzC,MAAIM,EAAQ,SAAS,KAAK,CAACA,EAAQ,SAASN,EAAE,MAAM;AAChD,UAAM,IAAI,MAAM,iCAAiCM,CAAO,mBAAmBN,EAAE,MAAM,EAAE;AAC7F;AACA,SAASO,GAAKA,GAAM;AAChB,MAAI,OAAOA,KAAS,cAAc,OAAOA,EAAK,UAAW;AACrD,UAAM,IAAI,MAAM,iDAAiD;AACrEH,EAAAA,GAAOG,EAAK,SAAS,GACrBH,GAAOG,EAAK,QAAQ;AACxB;AACA,SAASC,GAAOC,GAAUC,IAAgB,IAAM;AAC5C,MAAID,EAAS;AACT,UAAM,IAAI,MAAM,kCAAkC;AACtD,MAAIC,KAAiBD,EAAS;AAC1B,UAAM,IAAI,MAAM,uCAAuC;AAC/D;AACA,SAASE,GAAOC,GAAKH,GAAU;AAC3BJ,EAAAA,GAAMO,CAAG;AACT,QAAMC,IAAMJ,EAAS;AACrB,MAAIG,EAAI,SAASC;AACb,UAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE;AAEtF;AChCO,MAAMC,KAAS,OAAO,cAAe,YAAY,YAAY,aAAa,WAAW,SAAS;ACArG;AAQA,MAAMC,KAAM,CAACC,MAAMA,aAAa,YAKnBC,KAAa,CAACjE,MAAQ,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU,GAE7EkE,KAAO,CAACC,GAAMC,MAAWD,KAAS,KAAKC,IAAWD,MAASC,GAG3DC,KAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAChF,IAAI,CAACA;AACD,QAAM,IAAI,MAAM,6CAA6C;AAuD1D,SAASC,GAAYC,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AACpE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACvD;AAMO,SAASC,GAAQC,GAAM;AAG1B,MAFI,OAAOA,KAAS,aAChBA,IAAOH,GAAYG,CAAI,IACvB,CAACV,GAAIU,CAAI;AACT,UAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE;AAC7D,SAAOA;AACX;AAIO,SAASC,MAAeC,GAAQ;AACnC,QAAMC,IAAI,IAAI,WAAWD,EAAO,OAAO,CAACE,GAAKb,MAAMa,IAAMb,EAAE,QAAQ,CAAC,CAAC;AACrE,MAAIc,IAAM;AACV,SAAAH,EAAO,QAAQ,CAACX,MAAM;AAClB,QAAI,CAACD,GAAIC,CAAC;AACN,YAAM,IAAI,MAAM,qBAAqB;AACzC,IAAAY,EAAE,IAAIZ,GAAGc,CAAG,GACZA,KAAOd,EAAE;AAAA,EACjB,CAAK,GACMY;AACX;AAEO,IAAAG,KAAA,MAAW;AAAA;AAAA,EAEd,QAAQ;AACJ,WAAO,KAAK;EACf;AACL;AAQO,SAASC,GAAgBC,GAAU;AACtC,QAAMC,IAAQ,CAACrM,MAAQoM,EAAU,EAAC,OAAOT,GAAQ3L,CAAG,CAAC,EAAE,UACjDsM,IAAMF;AACZ,SAAAC,EAAM,YAAYC,EAAI,WACtBD,EAAM,WAAWC,EAAI,UACrBD,EAAM,SAAS,MAAMD,KACdC;AACX;AAoBO,SAASE,GAAYC,IAAc,IAAI;AAC1C,MAAIvB,MAAU,OAAOA,GAAO,mBAAoB;AAC5C,WAAOA,GAAO,gBAAgB,IAAI,WAAWuB,CAAW,CAAC;AAE7D,QAAM,IAAI,MAAM,wCAAwC;AAC5D;ACrJA,SAASC,GAAaC,GAAMC,GAAY9F,GAAO2E,GAAM;AACjD,MAAI,OAAOkB,EAAK,gBAAiB;AAC7B,WAAOA,EAAK,aAAaC,GAAY9F,GAAO2E,CAAI;AACpD,QAAMoB,IAAO,OAAO,EAAE,GAChBC,IAAW,OAAO,UAAU,GAC5BC,IAAK,OAAQjG,KAAS+F,IAAQC,CAAQ,GACtCE,IAAK,OAAOlG,IAAQgG,CAAQ,GAC5BG,IAAIxB,IAAO,IAAI,GACf,IAAIA,IAAO,IAAI;AACrB,EAAAkB,EAAK,UAAUC,IAAaK,GAAGF,GAAItB,CAAI,GACvCkB,EAAK,UAAUC,IAAa,GAAGI,GAAIvB,CAAI;AAC3C;SAEO,cAAmByB,GAAK;AAAA,EAC3B,YAAYC,GAAUC,GAAWC,GAAW5B,GAAM;AAC9C,aACA,KAAK,WAAW0B,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAO5B,GACZ,KAAK,WAAW,IAChB,KAAK,SAAS,GACd,KAAK,MAAM,GACX,KAAK,YAAY,IACjB,KAAK,SAAS,IAAI,WAAW0B,CAAQ,GACrC,KAAK,OAAO9B,GAAW,KAAK,MAAM;AAAA,EACrC;AAAA,EACD,OAAOQ,GAAM;AACTjB,IAAAA,GAAO,IAAI;AACX,UAAM,EAAE,MAAA+B,GAAM,QAAAW,GAAQ,UAAAH,EAAQ,IAAK;AACnC,IAAAtB,IAAOD,GAAQC,CAAI;AACnB,UAAM0B,IAAM1B,EAAK;AACjB,aAAS2B,IAAM,GAAGA,IAAMD,KAAM;AAC1B,YAAME,IAAO,KAAK,IAAIN,IAAW,KAAK,KAAKI,IAAMC,CAAG;AAEpD,UAAIC,MAASN,GAAU;AACnB,cAAMO,IAAWrC,GAAWQ,CAAI;AAChC,eAAOsB,KAAYI,IAAMC,GAAKA,KAAOL;AACjC,eAAK,QAAQO,GAAUF,CAAG;AAC9B;AAAA,MACH;AACD,MAAAF,EAAO,IAAIzB,EAAK,SAAS2B,GAAKA,IAAMC,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZD,KAAOC,GACH,KAAK,QAAQN,MACb,KAAK,QAAQR,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAElB;AACD,gBAAK,UAAUd,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACV;AAAA,EACD,WAAWb,GAAK;AACZJ,IAAAA,GAAO,IAAI,GACXG,GAAOC,GAAK,IAAI,GAChB,KAAK,WAAW;AAIhB,UAAM,EAAE,QAAAsC,GAAQ,MAAAX,GAAM,UAAAQ,GAAU,MAAA1B,EAAI,IAAK;AACzC,QAAI,EAAE,KAAA+B,EAAK,IAAG;AAEd,IAAAF,EAAOE,GAAK,IAAI,KAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,GAE5B,KAAK,YAAYL,IAAWK,MAC5B,KAAK,QAAQb,GAAM,CAAC,GACpBa,IAAM;AAGV,aAAS7G,IAAI6G,GAAK7G,IAAIwG,GAAUxG;AAC5B,MAAA2G,EAAO3G,CAAC,IAAI;AAIhB+F,IAAAA,GAAaC,GAAMQ,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAG1B,CAAI,GAC9D,KAAK,QAAQkB,GAAM,CAAC;AACpB,UAAMgB,IAAQtC,GAAWL,CAAG,GACtBuC,IAAM,KAAK;AAEjB,QAAIA,IAAM;AACN,YAAM,IAAI,MAAM,6CAA6C;AACjE,UAAMK,IAASL,IAAM,GACfM,IAAQ,KAAK;AACnB,QAAID,IAASC,EAAM;AACf,YAAM,IAAI,MAAM,oCAAoC;AACxD,aAASlH,IAAI,GAAGA,IAAIiH,GAAQjH;AACxB,MAAAgH,EAAM,UAAU,IAAIhH,GAAGkH,EAAMlH,CAAC,GAAG8E,CAAI;AAAA,EAC5C;AAAA,EACD,SAAS;AACL,UAAM,EAAE,QAAA6B,GAAQ,WAAAF,EAAW,IAAG;AAC9B,SAAK,WAAWE,CAAM;AACtB,UAAMrD,IAAMqD,EAAO,MAAM,GAAGF,CAAS;AACrC,gBAAK,QAAO,GACLnD;AAAA,EACV;AAAA,EACD,WAAW6D,GAAI;AACX,IAAAA,MAAOA,IAAK,IAAI,KAAK,YAAa,IAClCA,EAAG,IAAI,GAAG,KAAK,IAAK,CAAA;AACpB,UAAM,EAAE,UAAAX,GAAU,QAAAG,GAAQ,QAAAS,GAAQ,UAAAC,GAAU,WAAAC,GAAW,KAAAT,EAAK,IAAG;AAC/D,WAAAM,EAAG,SAASC,GACZD,EAAG,MAAMN,GACTM,EAAG,WAAWE,GACdF,EAAG,YAAYG,GACXF,IAASZ,KACTW,EAAG,OAAO,IAAIR,CAAM,GACjBQ;AAAA,EACV;AACL;AC3GA,MAAMI,KAAM,CAAC9C,GAAGhB,GAAG/D,MAAO+E,IAAIhB,IAAM,CAACgB,IAAI/E,GAEnC8H,KAAM,CAAC/C,GAAGhB,GAAG/D,MAAO+E,IAAIhB,IAAMgB,IAAI/E,IAAM+D,IAAI/D,GAI5C+H,KAA2B,oBAAI,YAAY;AAAA,EAC7C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAGKC,KAAqB,oBAAI,YAAY;AAAA,EACvC;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAGKC,KAA2B,oBAAI,YAAY,EAAE;SACnD,cAAqBC,GAAK;AAAA,EACtB,cAAc;AACV,UAAM,IAAI,IAAI,GAAG,EAAK,GAGtB,KAAK,IAAIF,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI;AAAA,EACpB;AAAA,EACD,MAAM;AACF,UAAM,EAAE,GAAAG,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAG,IAAG;AACnC,WAAO,CAACP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EACjC;AAAA;AAAA,EAED,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAG;AACxB,SAAK,IAAIP,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI;AAAA,EAChB;AAAA,EACD,QAAQpC,GAAMqC,GAAQ;AAElB,aAASrI,IAAI,GAAGA,IAAI,IAAIA,KAAKqI,KAAU;AACnCV,MAAAA,GAAS3H,CAAC,IAAIgG,EAAK,UAAUqC,GAAQ,EAAK;AAC9C,aAASrI,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAC1B,YAAMsI,IAAMX,GAAS3H,IAAI,EAAE,GACrBuI,IAAKZ,GAAS3H,IAAI,CAAC,GACnBwI,IAAK7D,GAAK2D,GAAK,CAAC,IAAI3D,GAAK2D,GAAK,EAAE,IAAKA,MAAQ,GAC7CG,IAAK9D,GAAK4D,GAAI,EAAE,IAAI5D,GAAK4D,GAAI,EAAE,IAAKA,MAAO;AACjDZ,MAAAA,GAAS3H,CAAC,IAAKyI,IAAKd,GAAS3H,IAAI,CAAC,IAAIwI,IAAKb,GAAS3H,IAAI,EAAE,IAAK;AAAA,IAClE;AAED,QAAI,EAAE,GAAA6H,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAG,IAAG;AACjC,aAASpI,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,YAAM0I,IAAS/D,GAAKsD,GAAG,CAAC,IAAItD,GAAKsD,GAAG,EAAE,IAAItD,GAAKsD,GAAG,EAAE,GAC9CU,IAAMP,IAAIM,IAASnB,GAAIU,GAAGC,GAAGC,CAAC,IAAIV,GAASzH,CAAC,IAAI2H,GAAS3H,CAAC,IAAK,GAE/D4I,KADSjE,GAAKkD,GAAG,CAAC,IAAIlD,GAAKkD,GAAG,EAAE,IAAIlD,GAAKkD,GAAG,EAAE,KAC/BL,GAAIK,GAAGC,GAAGC,CAAC,IAAK;AACrC,MAAAK,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKD,IAAIW,IAAM,GACfX,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKc,IAAKC,IAAM;AAAA,IACnB;AAED,IAAAf,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnB,KAAK,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EAClC;AAAA,EACD,aAAa;AACTT,IAAAA,GAAS,KAAK,CAAC;AAAA,EAClB;AAAA,EACD,UAAU;AACN,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/B,KAAK,OAAO,KAAK,CAAC;AAAA,EACrB;AACL;AAoBO,MAAMkB,KAAyBpD,gBAAAA,GAAgB,MAAM,IAAIqD,IAAQ;AC3HxE;AAKA,MAAMC,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GACdzE,KAAM,CAACC,MAAMA,aAAa,YAC1ByE,KAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAK,GAAE,CAACpP,GAAGkG,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAI5F,SAASmJ,GAAWrF,GAAO;AAC9B,MAAI,CAACU,GAAIV,CAAK;AACV,UAAM,IAAI,MAAM,qBAAqB;AAEzC,MAAIsF,IAAM;AACV,WAASpJ,IAAI,GAAGA,IAAI8D,EAAM,QAAQ9D;AAC9B,IAAAoJ,KAAOF,GAAMpF,EAAM9D,CAAC,CAAC;AAEzB,SAAOoJ;AACX;AACO,SAASC,GAAoBC,GAAK;AACrC,QAAMF,IAAME,EAAI,SAAS,EAAE;AAC3B,SAAOF,EAAI,SAAS,IAAI,IAAIA,CAAG,KAAKA;AACxC;AACO,SAASG,GAAYH,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAE5D,SAAO,OAAOA,MAAQ,KAAK,MAAM,KAAKA,CAAG,EAAE;AAC/C;AAIO,SAASI,GAAWJ,GAAK;AAC5B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAC5D,QAAMxC,IAAMwC,EAAI;AAChB,MAAIxC,IAAM;AACN,UAAM,IAAI,MAAM,4DAA4DA,CAAG;AACnF,QAAM6C,IAAQ,IAAI,WAAW7C,IAAM,CAAC;AACpC,WAAS5G,IAAI,GAAGA,IAAIyJ,EAAM,QAAQzJ,KAAK;AACnC,UAAM0J,IAAI1J,IAAI,GACR2J,IAAUP,EAAI,MAAMM,GAAGA,IAAI,CAAC,GAC5BE,IAAO,OAAO,SAASD,GAAS,EAAE;AACxC,QAAI,OAAO,MAAMC,CAAI,KAAKA,IAAO;AAC7B,YAAM,IAAI,MAAM,uBAAuB;AAC3C,IAAAH,EAAMzJ,CAAC,IAAI4J;AAAA,EACd;AACD,SAAOH;AACX;AAEO,SAASI,GAAgB/F,GAAO;AACnC,SAAOyF,GAAYJ,GAAWrF,CAAK,CAAC;AACxC;AACO,SAASgG,GAAgBhG,GAAO;AACnC,MAAI,CAACU,GAAIV,CAAK;AACV,UAAM,IAAI,MAAM,qBAAqB;AACzC,SAAOyF,GAAYJ,GAAW,WAAW,KAAKrF,CAAK,EAAE,QAAS,CAAA,CAAC;AACnE;AACO,SAASiG,GAAgB,GAAGnD,GAAK;AACpC,SAAO4C,GAAW,EAAE,SAAS,EAAE,EAAE,SAAS5C,IAAM,GAAG,GAAG,CAAC;AAC3D;AACO,SAASoD,GAAgB,GAAGpD,GAAK;AACpC,SAAOmD,GAAgB,GAAGnD,CAAG,EAAE,QAAO;AAC1C;AAEO,SAASqD,GAAmB,GAAG;AAClC,SAAOT,GAAWH,GAAoB,CAAC,CAAC;AAC5C;AAUO,SAASa,GAAYC,GAAOf,GAAKgB,GAAgB;AACpD,MAAI9G;AACJ,MAAI,OAAO8F,KAAQ;AACf,QAAI;AACA,MAAA9F,IAAMkG,GAAWJ,CAAG;AAAA,IACvB,SACMiB,GAAG;AACN,YAAM,IAAI,MAAM,GAAGF,CAAK,mCAAmCf,CAAG,aAAaiB,CAAC,EAAE;AAAA,IACjF;AAAA,WAEI7F,GAAI4E,CAAG;AAGZ,IAAA9F,IAAM,WAAW,KAAK8F,CAAG;AAAA;AAGzB,UAAM,IAAI,MAAM,GAAGe,CAAK,mCAAmC;AAE/D,QAAMvD,IAAMtD,EAAI;AAChB,MAAI,OAAO8G,KAAmB,YAAYxD,MAAQwD;AAC9C,UAAM,IAAI,MAAM,GAAGD,CAAK,aAAaC,CAAc,eAAexD,CAAG,EAAE;AAC3E,SAAOtD;AACX;AAIO,SAAS6B,MAAeC,GAAQ;AACnC,QAAMC,IAAI,IAAI,WAAWD,EAAO,OAAO,CAACE,GAAKb,MAAMa,IAAMb,EAAE,QAAQ,CAAC,CAAC;AACrE,MAAIc,IAAM;AACV,SAAAH,EAAO,QAAQ,CAACX,MAAM;AAClB,QAAI,CAACD,GAAIC,CAAC;AACN,YAAM,IAAI,MAAM,qBAAqB;AACzC,IAAAY,EAAE,IAAIZ,GAAGc,CAAG,GACZA,KAAOd,EAAE;AAAA,EACjB,CAAK,GACMY;AACX;AACO,SAASiF,GAAWC,GAAIC,GAAI;AAE/B,MAAID,EAAG,WAAWC,EAAG;AACjB,WAAO;AACX,WAASxK,IAAI,GAAGA,IAAIuK,EAAG,QAAQvK;AAC3B,QAAIuK,EAAGvK,CAAC,MAAMwK,EAAGxK,CAAC;AACd,aAAO;AACf,SAAO;AACX;AAIO,SAAS+E,GAAYC,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AACpE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACvD;AAMO,SAASyF,GAAO,GAAG;AACtB,MAAI7D;AACJ,OAAKA,IAAM,GAAG,IAAImC,IAAK,MAAMC,IAAKpC,KAAO;AACrC;AACJ,SAAOA;AACX;AAMO,SAAS8D,GAAO,GAAG7D,GAAK;AAC3B,SAAQ,KAAK,OAAOA,CAAG,IAAKmC;AAChC;AAIO,MAAM2B,KAAS,CAAC,GAAG9D,GAAK1G,MACpB,KAAMA,IAAQ6I,KAAMD,OAAQ,OAAOlC,CAAG,GAMpC+D,KAAU,CAAC,OAAO3B,MAAO,OAAO,IAAI,CAAC,KAAKD,IAEjD6B,KAAM,CAAC3F,MAAS,IAAI,WAAWA,CAAI,GACnC4F,KAAO,CAACrK,MAAQ,WAAW,KAAKA,CAAG;AAQlC,SAASsK,GAAeC,GAASC,GAAUC,GAAQ;AACtD,MAAI,OAAOF,KAAY,YAAYA,IAAU;AACzC,UAAM,IAAI,MAAM,0BAA0B;AAC9C,MAAI,OAAOC,KAAa,YAAYA,IAAW;AAC3C,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAI,OAAOC,KAAW;AAClB,UAAM,IAAI,MAAM,2BAA2B;AAE/C,MAAIhL,IAAI2K,GAAIG,CAAO,GACfpL,IAAIiL,GAAIG,CAAO,GACf,IAAI;AACR,QAAMG,IAAQ,MAAM;AAChB,IAAAjL,EAAE,KAAK,CAAC,GACRN,EAAE,KAAK,CAAC,GACR,IAAI;AAAA,EACZ,GACU0G,IAAI,IAAI7C,MAAMyH,EAAOtL,GAAGM,GAAG,GAAGuD,CAAC,GAC/B2H,IAAS,CAACC,IAAOR,SAAU;AAI7B,IAFAjL,IAAI0G,EAAEwE,GAAK,CAAC,CAAI,CAAC,GAAGO,CAAI,GACxBnL,IAAIoG,EAAC,GACD+E,EAAK,WAAW,MAEpBzL,IAAI0G,EAAEwE,GAAK,CAAC,CAAI,CAAC,GAAGO,CAAI,GACxBnL,IAAIoG,EAAC;AAAA,EACb,GACUgF,IAAM,MAAM;AAEd,QAAI,OAAO;AACP,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAI1E,IAAM;AACV,UAAMvC,IAAM,CAAA;AACZ,WAAOuC,IAAMqE,KAAU;AACnB,MAAA/K,IAAIoG,EAAC;AACL,YAAMiF,IAAKrL,EAAE;AACb,MAAAmE,EAAI,KAAKkH,CAAE,GACX3E,KAAO1G,EAAE;AAAA,IACZ;AACD,WAAOiF,GAAY,GAAGd,CAAG;AAAA,EACjC;AAUI,SATiB,CAACgH,GAAMG,MAAS;AAC7B,IAAAL,KACAC,EAAOC,CAAI;AACX,QAAI/H;AACJ,WAAO,EAAEA,IAAMkI,EAAKF,EAAK,CAAA;AACrB,MAAAF;AACJ,WAAAD,KACO7H;AAAA,EACf;AAEA;AAEA,MAAMmI,KAAe;AAAA,EACjB,QAAQ,CAACpK,MAAQ,OAAOA,KAAQ;AAAA,EAChC,UAAU,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EAClC,SAAS,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EACjC,QAAQ,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EAChC,oBAAoB,CAACA,MAAQ,OAAOA,KAAQ,YAAYA,aAAe;AAAA,EACvE,eAAe,CAACA,MAAQ,OAAO,cAAcA,CAAG;AAAA,EAChD,OAAO,CAACA,MAAQ,MAAM,QAAQA,CAAG;AAAA,EACjC,OAAO,CAACA,GAAKqK,MAAWA,EAAO,GAAG,QAAQrK,CAAG;AAAA,EAC7C,MAAM,CAACA,MAAQ,OAAOA,KAAQ,cAAc,OAAO,cAAcA,EAAI,SAAS;AAClF;AAEO,SAASsK,GAAeD,GAAQE,GAAYC,IAAgB,CAAA,GAAI;AACnE,QAAMC,IAAa,CAACC,GAAWxS,GAAMyS,MAAe;AAChD,UAAMC,IAAWR,GAAalS,CAAI;AAClC,QAAI,OAAO0S,KAAa;AACpB,YAAM,IAAI,MAAM,sBAAsB1S,CAAI,sBAAsB;AACpE,UAAM8H,IAAMqK,EAAOK,CAAS;AAC5B,QAAI,EAAAC,KAAc3K,MAAQ,WAEtB,CAAC4K,EAAS5K,GAAKqK,CAAM;AACrB,YAAM,IAAI,MAAM,iBAAiB,OAAOK,CAAS,CAAC,IAAI1K,CAAG,KAAK,OAAOA,CAAG,eAAe9H,CAAI,EAAE;AAAA,EAEzG;AACI,aAAW,CAACwS,GAAWxS,CAAI,KAAK,OAAO,QAAQqS,CAAU;AACrD,IAAAE,EAAWC,GAAWxS,GAAM,EAAK;AACrC,aAAW,CAACwS,GAAWxS,CAAI,KAAK,OAAO,QAAQsS,CAAa;AACxD,IAAAC,EAAWC,GAAWxS,GAAM,EAAI;AACpC,SAAOmS;AACX;;;;;;;;;;;;;;;;;;;;;;;AChQA;AAIA,MAAM3C,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGiD,KAAM,OAAO,CAAC,GAEjEC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC;AAE1C,OAAO,CAAC;AAAU,OAAO,EAAE;AAEhC,SAASC,GAAI7H,GAAGhB,GAAG;AACtB,QAAM8I,IAAS9H,IAAIhB;AACnB,SAAO8I,KAAUxD,KAAMwD,IAAS9I,IAAI8I;AACxC;AAQO,SAASC,GAAIlD,GAAKmD,GAAOC,GAAQ;AACpC,MAAIA,KAAU3D,MAAO0D,IAAQ1D;AACzB,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAI2D,MAAW1D;AACX,WAAOD;AACX,MAAIzF,IAAM0F;AACV,SAAOyD,IAAQ1D;AACX,IAAI0D,IAAQzD,OACR1F,IAAOA,IAAMgG,IAAOoD,IACxBpD,IAAOA,IAAMA,IAAOoD,GACpBD,MAAUzD;AAEd,SAAO1F;AACX;AAEO,SAASqJ,GAAKC,GAAGH,GAAOC,GAAQ;AACnC,MAAIpJ,IAAMsJ;AACV,SAAOH,MAAU1D;AACb,IAAAzF,KAAOA,GACPA,KAAOoJ;AAEX,SAAOpJ;AACX;AAEO,SAASuJ,GAAOhJ,GAAQ6I,GAAQ;AACnC,MAAI7I,MAAWkF,MAAO2D,KAAU3D;AAC5B,UAAM,IAAI,MAAM,6CAA6ClF,CAAM,QAAQ6I,CAAM,EAAE;AAIvF,MAAIjI,IAAI6H,GAAIzI,GAAQ6I,CAAM,GACtBjJ,IAAIiJ,GAEJE,IAAI7D,IAAc+D,IAAI9D;AAC1B,SAAOvE,MAAMsE,MAAK;AAEd,UAAMgE,IAAItJ,IAAIgB,GACRY,IAAI5B,IAAIgB,GACRuI,IAAIJ,IAAIE,IAAIC;AAGlB,IAAAtJ,IAAIgB,GAAGA,IAAIY,GAAGuH,IAAIE,GAAUA,IAAIE;AAAA,EACnC;AAED,MADYvJ,MACAuF;AACR,UAAM,IAAI,MAAM,wBAAwB;AAC5C,SAAOsD,GAAIM,GAAGF,CAAM;AACxB;AASO,SAASO,GAAcC,GAAG;AAM7B,QAAMC,KAAaD,IAAIlE,MAAOC;AAC9B,MAAImE,GAAGC,GAAGC;AAGV,OAAKF,IAAIF,IAAIlE,IAAKqE,IAAI,GAAGD,IAAInE,OAAQF,IAAKqE,KAAKnE,IAAKoE;AAChD;AAEJ,OAAKC,IAAIrE,IAAKqE,IAAIJ,KAAKV,GAAIc,GAAGH,GAAWD,CAAC,MAAMA,IAAIlE,IAAKsE;AACrD;AAEJ,MAAID,MAAM,GAAG;AACT,UAAME,KAAUL,IAAIlE,MAAOmD;AAC3B,WAAO,SAAqBqB,GAAIzS,GAAG;AAC/B,YAAM0S,IAAOD,EAAG,IAAIzS,GAAGwS,CAAM;AAC7B,UAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAG1S,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAO0S;AAAA,IACnB;AAAA,EACK;AAED,QAAMC,KAAUN,IAAIpE,MAAOC;AAC3B,SAAO,SAAqBuE,GAAIzS,GAAG;AAE/B,QAAIyS,EAAG,IAAIzS,GAAGoS,CAAS,MAAMK,EAAG,IAAIA,EAAG,GAAG;AACtC,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAInI,IAAIgI,GAEJM,IAAIH,EAAG,IAAIA,EAAG,IAAIA,EAAG,KAAKF,CAAC,GAAGF,CAAC,GAC/BR,IAAIY,EAAG,IAAIzS,GAAG2S,CAAM,GACpBjK,IAAI+J,EAAG,IAAIzS,GAAGqS,CAAC;AACnB,WAAO,CAACI,EAAG,IAAI/J,GAAG+J,EAAG,GAAG,KAAG;AACvB,UAAIA,EAAG,IAAI/J,GAAG+J,EAAG,IAAI;AACjB,eAAOA,EAAG;AAEd,UAAI,IAAI;AACR,eAASI,IAAKJ,EAAG,IAAI/J,CAAC,GAAG,IAAI4B,KACrB,CAAAmI,EAAG,IAAII,GAAIJ,EAAG,GAAG,GADO;AAG5B,QAAAI,IAAKJ,EAAG,IAAII,CAAE;AAGlB,YAAMC,IAAKL,EAAG,IAAIG,GAAG3E,MAAO,OAAO3D,IAAI,IAAI,CAAC,CAAC;AAC7C,MAAAsI,IAAIH,EAAG,IAAIK,CAAE,GACbjB,IAAIY,EAAG,IAAIZ,GAAGiB,CAAE,GAChBpK,IAAI+J,EAAG,IAAI/J,GAAGkK,CAAC,GACftI,IAAI;AAAA,IACP;AACD,WAAOuH;AAAA,EACf;AACA;AACO,SAASkB,GAAOZ,GAAG;AAKtB,MAAIA,IAAIf,OAAQD,IAAK;AAKjB,UAAMqB,KAAUL,IAAIlE,MAAOmD;AAC3B,WAAO,SAAmBqB,GAAIzS,GAAG;AAC7B,YAAM0S,IAAOD,EAAG,IAAIzS,GAAGwS,CAAM;AAE7B,UAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAG1S,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAO0S;AAAA,IACnB;AAAA,EACK;AAED,MAAIP,IAAIb,OAAQD,IAAK;AACjB,UAAM2B,KAAMb,IAAId,MAAOC;AACvB,WAAO,SAAmBmB,GAAIzS,GAAG;AAC7B,YAAMiT,IAAKR,EAAG,IAAIzS,GAAGkO,EAAG,GAClB/I,IAAIsN,EAAG,IAAIQ,GAAID,CAAE,GACjBE,IAAKT,EAAG,IAAIzS,GAAGmF,CAAC,GAChBF,IAAIwN,EAAG,IAAIA,EAAG,IAAIS,GAAIhF,EAAG,GAAG/I,CAAC,GAC7BuN,IAAOD,EAAG,IAAIS,GAAIT,EAAG,IAAIxN,GAAGwN,EAAG,GAAG,CAAC;AACzC,UAAI,CAACA,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAG1S,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAO0S;AAAA,IACnB;AAAA,EACK;AAwBD,SAAOR,GAAcC,CAAC;AAC1B;AAIA,MAAMgB,KAAe;AAAA,EACjB;AAAA,EAAU;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAClD;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACnC;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAC5B;AACO,SAASC,GAAcC,GAAO;AACjC,QAAMC,IAAU;AAAA,IACZ,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,EACd,GACUC,IAAOJ,GAAa,OAAO,CAACK,GAAKlN,OACnCkN,EAAIlN,CAAG,IAAI,YACJkN,IACRF,CAAO;AACV,SAAO1C,GAAeyC,GAAOE,CAAI;AACrC;AAMO,SAASE,GAAMC,GAAGnF,GAAKmD,GAAO;AAGjC,MAAIA,IAAQ1D;AACR,UAAM,IAAI,MAAM,oBAAoB;AACxC,MAAI0D,MAAU1D;AACV,WAAO0F,EAAE;AACb,MAAIhC,MAAUzD;AACV,WAAOM;AACX,MAAI3J,IAAI8O,EAAE,KACNC,IAAIpF;AACR,SAAOmD,IAAQ1D;AACX,IAAI0D,IAAQzD,OACRrJ,IAAI8O,EAAE,IAAI9O,GAAG+O,CAAC,IAClBA,IAAID,EAAE,IAAIC,CAAC,GACXjC,MAAUzD;AAEd,SAAOrJ;AACX;AAKO,SAASgP,GAAcF,GAAGG,GAAM;AACnC,QAAMhJ,IAAM,IAAI,MAAMgJ,EAAK,MAAM,GAE3BC,IAAiBD,EAAK,OAAO,CAACE,GAAKxF,GAAKtJ,MACtCyO,EAAE,IAAInF,CAAG,IACFwF,KACXlJ,EAAI5F,CAAC,IAAI8O,GACFL,EAAE,IAAIK,GAAKxF,CAAG,IACtBmF,EAAE,GAAG,GAEFM,IAAWN,EAAE,IAAII,CAAc;AAErC,SAAAD,EAAK,YAAY,CAACE,GAAKxF,GAAKtJ,MACpByO,EAAE,IAAInF,CAAG,IACFwF,KACXlJ,EAAI5F,CAAC,IAAIyO,EAAE,IAAIK,GAAKlJ,EAAI5F,CAAC,CAAC,GACnByO,EAAE,IAAIK,GAAKxF,CAAG,IACtByF,CAAQ,GACJnJ;AACX;AAaO,SAASoJ,GAAQ,GAAGC,GAAY;AAEnC,QAAMC,IAAcD,MAAe,SAAYA,IAAa,EAAE,SAAS,CAAC,EAAE,QACpEE,IAAc,KAAK,KAAKD,IAAc,CAAC;AAC7C,SAAO,EAAE,YAAYA,GAAa,aAAAC;AACtC;AAaO,SAASC,GAAMC,GAAO5E,GAAQ3F,IAAO,IAAOwK,IAAQ,IAAI;AAC3D,MAAID,KAAStG;AACT,UAAM,IAAI,MAAM,iCAAiCsG,CAAK,EAAE;AAC5D,QAAM,EAAE,YAAYE,GAAM,aAAaC,EAAK,IAAKR,GAAQK,GAAO5E,CAAM;AACtE,MAAI+E,IAAQ;AACR,UAAM,IAAI,MAAM,iDAAiD;AACrE,QAAMC,IAAQ3B,GAAOuB,CAAK,GACpBZ,IAAI,OAAO,OAAO;AAAA,IACpB,OAAAY;AAAA,IACA,MAAAE;AAAA,IACA,OAAAC;AAAA,IACA,MAAM5E,GAAQ2E,CAAI;AAAA,IAClB,MAAMxG;AAAAA,IACN,KAAKC;AAAAA,IACL,QAAQ,CAACM,MAAQgD,GAAIhD,GAAK+F,CAAK;AAAA,IAC/B,SAAS,CAAC/F,MAAQ;AACd,UAAI,OAAOA,KAAQ;AACf,cAAM,IAAI,MAAM,+CAA+C,OAAOA,CAAG,EAAE;AAC/E,aAAOP,MAAOO,KAAOA,IAAM+F;AAAA,IAC9B;AAAA,IACD,KAAK,CAAC/F,MAAQA,MAAQP;AAAAA,IACtB,OAAO,CAACO,OAASA,IAAMN,QAASA;AAAAA,IAChC,KAAK,CAACM,MAAQgD,GAAI,CAAChD,GAAK+F,CAAK;AAAA,IAC7B,KAAK,CAACK,GAAKC,MAAQD,MAAQC;AAAA,IAC3B,KAAK,CAACrG,MAAQgD,GAAIhD,IAAMA,GAAK+F,CAAK;AAAA,IAClC,KAAK,CAACK,GAAKC,MAAQrD,GAAIoD,IAAMC,GAAKN,CAAK;AAAA,IACvC,KAAK,CAACK,GAAKC,MAAQrD,GAAIoD,IAAMC,GAAKN,CAAK;AAAA,IACvC,KAAK,CAACK,GAAKC,MAAQrD,GAAIoD,IAAMC,GAAKN,CAAK;AAAA,IACvC,KAAK,CAAC/F,GAAKmD,MAAU+B,GAAMC,GAAGnF,GAAKmD,CAAK;AAAA,IACxC,KAAK,CAACiD,GAAKC,MAAQrD,GAAIoD,IAAM7C,GAAO8C,GAAKN,CAAK,GAAGA,CAAK;AAAA;AAAA,IAEtD,MAAM,CAAC/F,MAAQA,IAAMA;AAAA,IACrB,MAAM,CAACoG,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,KAAK,CAACrG,MAAQuD,GAAOvD,GAAK+F,CAAK;AAAA,IAC/B,MAAMC,EAAM,SAAS,CAACvU,MAAM0U,EAAMhB,GAAG1T,CAAC;AAAA,IACtC,aAAa,CAAC6U,MAAQjB,GAAcF,GAAGmB,CAAG;AAAA;AAAA;AAAA,IAG1C,MAAM,CAACnL,GAAGhB,GAAG/D,MAAOA,IAAI+D,IAAIgB;AAAA,IAC5B,SAAS,CAAC6E,MAASxE,IAAOkF,GAAgBV,GAAKkG,CAAK,IAAIzF,GAAgBT,GAAKkG,CAAK;AAAA,IAClF,WAAW,CAAC1L,MAAU;AAClB,UAAIA,EAAM,WAAW0L;AACjB,cAAM,IAAI,MAAM,0BAA0BA,CAAK,SAAS1L,EAAM,MAAM,EAAE;AAC1E,aAAOgB,IAAOgF,GAAgBhG,CAAK,IAAI+F,GAAgB/F,CAAK;AAAA,IAC/D;AAAA,EACT,CAAK;AACD,SAAO,OAAO,OAAO2K,CAAC;AAC1B;AAkCO,SAASoB,GAAoBC,GAAY;AAC5C,MAAI,OAAOA,KAAe;AACtB,UAAM,IAAI,MAAM,4BAA4B;AAChD,QAAMC,IAAYD,EAAW,SAAS,CAAC,EAAE;AACzC,SAAO,KAAK,KAAKC,IAAY,CAAC;AAClC;AAQO,SAASC,GAAiBF,GAAY;AACzC,QAAM1I,IAASyI,GAAoBC,CAAU;AAC7C,SAAO1I,IAAS,KAAK,KAAKA,IAAS,CAAC;AACxC;AAcO,SAAS6I,GAAelQ,GAAK+P,GAAYhL,IAAO,IAAO;AAC1D,QAAM8B,IAAM7G,EAAI,QACVmQ,IAAWL,GAAoBC,CAAU,GACzCK,IAASH,GAAiBF,CAAU;AAE1C,MAAIlJ,IAAM,MAAMA,IAAMuJ,KAAUvJ,IAAM;AAClC,UAAM,IAAI,MAAM,YAAYuJ,CAAM,6BAA6BvJ,CAAG,EAAE;AACxE,QAAM0C,IAAMxE,IAAO+E,GAAgB9J,CAAG,IAAI+J,GAAgB/J,CAAG,GAEvDqQ,IAAU9D,GAAIhD,GAAKwG,IAAa9G,EAAG,IAAIA;AAC7C,SAAOlE,IAAOkF,GAAgBoG,GAASF,CAAQ,IAAInG,GAAgBqG,GAASF,CAAQ;AACxF;AC9ZA;AAIA,MAAMnH,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC;AAYb,SAASqH,GAAK3Q,GAAG4Q,GAAM;AAC1B,QAAMC,IAAkB,CAACC,GAAWC,MAAS;AACzC,UAAMC,IAAMD,EAAK;AACjB,WAAOD,IAAYE,IAAMD;AAAA,EACjC,GACUnC,IAAO,CAACqC,MAAM;AAChB,UAAMC,IAAU,KAAK,KAAKN,IAAOK,CAAC,IAAI,GAChCE,IAAa,MAAMF,IAAI;AAC7B,WAAO,EAAE,SAAAC,GAAS,YAAAC;EAC1B;AACI,SAAO;AAAA,IACH,iBAAAN;AAAA;AAAA,IAEA,aAAaO,GAAK/V,GAAG;AACjB,UAAI4E,IAAID,EAAE,MACNgP,IAAIoC;AACR,aAAO/V,IAAIgO;AACP,QAAIhO,IAAIiO,OACJrJ,IAAIA,EAAE,IAAI+O,CAAC,IACfA,IAAIA,EAAE,UACN3T,MAAMiO;AAEV,aAAOrJ;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAWD,iBAAiBmR,GAAKH,GAAG;AACrB,YAAM,EAAE,SAAAC,GAAS,YAAAC,EAAY,IAAGvC,EAAKqC,CAAC,GAChCI,IAAS,CAAA;AACf,UAAIpR,IAAImR,GACJE,IAAOrR;AACX,eAASsR,IAAS,GAAGA,IAASL,GAASK,KAAU;AAC7C,QAAAD,IAAOrR,GACPoR,EAAO,KAAKC,CAAI;AAEhB,iBAAShR,IAAI,GAAGA,IAAI6Q,GAAY7Q;AAC5B,UAAAgR,IAAOA,EAAK,IAAIrR,CAAC,GACjBoR,EAAO,KAAKC,CAAI;AAEpB,QAAArR,IAAIqR,EAAK;MACZ;AACD,aAAOD;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,KAAKJ,GAAGO,GAAanW,GAAG;AAGpB,YAAM,EAAE,SAAA6V,GAAS,YAAAC,EAAY,IAAGvC,EAAKqC,CAAC;AACtC,UAAIhR,IAAID,EAAE,MACN+O,IAAI/O,EAAE;AACV,YAAMyR,IAAO,OAAO,KAAKR,IAAI,CAAC,GACxBS,IAAY,KAAKT,GACjBU,IAAU,OAAOV,CAAC;AACxB,eAASM,IAAS,GAAGA,IAASL,GAASK,KAAU;AAC7C,cAAM5I,IAAS4I,IAASJ;AAExB,YAAIS,IAAQ,OAAOvW,IAAIoW,CAAI;AAE3B,QAAApW,MAAMsW,GAGFC,IAAQT,MACRS,KAASF,GACTrW,KAAKiO;AAST,cAAMuI,IAAUlJ,GACVmJ,IAAUnJ,IAAS,KAAK,IAAIiJ,CAAK,IAAI,GACrCG,IAAQR,IAAS,MAAM,GACvBS,IAAQJ,IAAQ;AACtB,QAAIA,MAAU,IAEV7C,IAAIA,EAAE,IAAI8B,EAAgBkB,GAAOP,EAAYK,CAAO,CAAC,CAAC,IAGtD5R,IAAIA,EAAE,IAAI4Q,EAAgBmB,GAAOR,EAAYM,CAAO,CAAC,CAAC;AAAA,MAE7D;AAMD,aAAO,EAAE,GAAA7R,GAAG,GAAA8O;IACf;AAAA,IACD,WAAWvB,GAAGyE,GAAgB5W,GAAG6W,GAAW;AAExC,YAAMjB,IAAIzD,EAAE,gBAAgB;AAE5B,UAAI2E,IAAOF,EAAe,IAAIzE,CAAC;AAC/B,aAAK2E,MACDA,IAAO,KAAK,iBAAiB3E,GAAGyD,CAAC,GAC7BA,MAAM,KACNgB,EAAe,IAAIzE,GAAG0E,EAAUC,CAAI,CAAC,IAGtC,KAAK,KAAKlB,GAAGkB,GAAM9W,CAAC;AAAA,IAC9B;AAAA,EACT;AACA;AACO,SAAS+W,GAAcC,GAAO;AACjC5D,SAAAA,GAAc4D,EAAM,EAAE,GACtBpG,GAAeoG,GAAO;AAAA,IAClB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,IAAI;AAAA,EACZ,GAAO;AAAA,IACC,YAAY;AAAA,IACZ,aAAa;AAAA,EACrB,CAAK,GAEM,OAAO,OAAO;AAAA,IACjB,GAAG/C,GAAQ+C,EAAM,GAAGA,EAAM,UAAU;AAAA,IACpC,GAAGA;AAAA,IACE,GAAGA,EAAM,GAAG;AAAA,EACzB,CAAK;AACL;AC1JA;AAMA,SAASC,GAAkBD,GAAO;AAC9B,QAAMzD,IAAOwD,GAAcC,CAAK;AAChCE,EAAAA,GAAkB3D,GAAM;AAAA,IACpB,GAAG;AAAA,IACH,GAAG;AAAA,EACX,GAAO;AAAA,IACC,0BAA0B;AAAA,IAC1B,gBAAgB;AAAA,IAChB,eAAe;AAAA,IACf,eAAe;AAAA,IACf,oBAAoB;AAAA,IACpB,WAAW;AAAA,IACX,SAAS;AAAA,EACjB,CAAK;AACD,QAAM,EAAE,MAAA4D,GAAM,IAAA1E,GAAI,GAAA/I,EAAC,IAAK6J;AACxB,MAAI4D,GAAM;AACN,QAAI,CAAC1E,EAAG,IAAI/I,GAAG+I,EAAG,IAAI;AAClB,YAAM,IAAI,MAAM,mEAAmE;AAEvF,QAAI,OAAO0E,KAAS,YAChB,OAAOA,EAAK,QAAS,YACrB,OAAOA,EAAK,eAAgB;AAC5B,YAAM,IAAI,MAAM,mEAAmE;AAAA,EAE1F;AACD,SAAO,OAAO,OAAO,EAAE,GAAG5D,EAAM,CAAA;AACpC;AAEA,MAAM,EAAE,iBAAiB6D,IAAK,YAAYC,GAAG,IAAKC,IACrCC,KAAM;AAAA;AAAA,EAEf,KAAK,cAAqB,MAAM;AAAA,IAC5B,YAAYtF,IAAI,IAAI;AAChB,YAAMA,CAAC;AAAA,IACV;AAAA,EACJ;AAAA,EACD,UAAU9H,GAAM;AACZ,UAAM,EAAE,KAAK+C,EAAG,IAAGqK;AACnB,QAAIpN,EAAK,SAAS,KAAKA,EAAK,CAAC,MAAM;AAC/B,YAAM,IAAI+C,EAAE,+BAA+B;AAC/C,UAAMrB,IAAM1B,EAAK,CAAC,GACZ5B,IAAM4B,EAAK,SAAS,GAAG0B,IAAM,CAAC;AACpC,QAAI,CAACA,KAAOtD,EAAI,WAAWsD;AACvB,YAAM,IAAIqB,EAAE,yCAAyC;AAKzD,QAAI3E,EAAI,CAAC,IAAI;AACT,YAAM,IAAI2E,EAAE,qCAAqC;AACrD,QAAI3E,EAAI,CAAC,MAAM,KAAQ,EAAEA,EAAI,CAAC,IAAI;AAC9B,YAAM,IAAI2E,EAAE,qDAAqD;AACrE,WAAO,EAAE,GAAGkK,GAAI7O,CAAG,GAAG,GAAG4B,EAAK,SAAS0B,IAAM,CAAC;EACjD;AAAA,EACD,MAAMwC,GAAK;AAEP,UAAM,EAAE,KAAKnB,EAAG,IAAGqK,IACbpN,IAAO,OAAOkE,KAAQ,WAAWgJ,GAAIhJ,CAAG,IAAIA;AAClD,QAAI,EAAElE,aAAgB;AAClB,YAAM,IAAI,MAAM,eAAe;AACnC,QAAIqN,IAAIrN,EAAK;AACb,QAAIqN,IAAI,KAAKrN,EAAK,CAAC,KAAK;AACpB,YAAM,IAAI+C,EAAE,uBAAuB;AACvC,QAAI/C,EAAK,CAAC,MAAMqN,IAAI;AAChB,YAAM,IAAItK,EAAE,qCAAqC;AACrD,UAAM,EAAE,GAAG5C,GAAG,GAAGmN,EAAQ,IAAGF,GAAI,UAAUpN,EAAK,SAAS,CAAC,CAAC,GACpD,EAAE,GAAGpK,GAAG,GAAG2X,EAAU,IAAKH,GAAI,UAAUE,CAAM;AACpD,QAAIC,EAAW;AACX,YAAM,IAAIxK,EAAE,6CAA6C;AAC7D,WAAO,EAAE,GAAA5C,GAAG,GAAAvK;EACf;AAAA,EACD,WAAW4X,GAAK;AAEZ,UAAMC,IAAQ,CAAC7X,MAAO,OAAO,SAASA,EAAE,CAAC,GAAG,EAAE,IAAI,IAAS,OAAOA,IAAIA,GAChEwL,IAAI,CAACgD,MAAQ;AACf,YAAMF,IAAME,EAAI,SAAS,EAAE;AAC3B,aAAOF,EAAI,SAAS,IAAI,IAAIA,CAAG,KAAKA;AAAA,IAChD,GACctO,IAAI6X,EAAMrM,EAAEoM,EAAI,CAAC,CAAC,GAClBrN,IAAIsN,EAAMrM,EAAEoM,EAAI,CAAC,CAAC,GAClBE,IAAM9X,EAAE,SAAS,GACjB+X,IAAMxN,EAAE,SAAS,GACjBkG,IAAKjF,EAAEsM,CAAG,GACVE,IAAKxM,EAAEuM,CAAG;AAChB,WAAO,KAAKvM,EAAEuM,IAAMD,IAAM,CAAC,CAAC,KAAKE,CAAE,GAAGzN,CAAC,KAAKkG,CAAE,GAAGzQ,CAAC;AAAA,EACrD;AACL,GAGMiO,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC;AAAS,OAAO,CAAC;AAAE,MAACkD,KAAM,OAAO,CAAC;AAAS,OAAO,CAAC;AACjF,SAAS6G,GAAkBzE,GAAM;AACpC,QAAM0E,IAAQhB,GAAkB1D,CAAI,GAC9B,EAAE,IAAAd,EAAI,IAAGwF,GACT/N,IAAU+N,EAAM,YACjB,CAACpS,GAAIqS,GAAOC,MAAkB;AAC3B,UAAMzO,IAAIwO,EAAM;AAChB,WAAOE,GAAe,WAAW,KAAK,CAAC,CAAI,CAAC,GAAG3F,EAAG,QAAQ/I,EAAE,CAAC,GAAG+I,EAAG,QAAQ/I,EAAE,CAAC,CAAC;AAAA,EAC3F,IACU2O,IAAYJ,EAAM,cACnB,CAAClP,MAAU;AAER,UAAMuP,IAAOvP,EAAM,SAAS,CAAC,GAEvB8I,IAAIY,EAAG,UAAU6F,EAAK,SAAS,GAAG7F,EAAG,KAAK,CAAC,GAC3C,IAAIA,EAAG,UAAU6F,EAAK,SAAS7F,EAAG,OAAO,IAAIA,EAAG,KAAK,CAAC;AAC5D,WAAO,EAAE,GAAAZ,GAAG;EACxB;AAKI,WAAS0G,EAAoB1G,GAAG;AAC5B,UAAM,EAAE,GAAAnI,GAAG,GAAAhB,EAAG,IAAGuP,GACXO,IAAK/F,EAAG,IAAIZ,CAAC,GACb4G,IAAKhG,EAAG,IAAI+F,GAAI3G,CAAC;AACvB,WAAOY,EAAG,IAAIA,EAAG,IAAIgG,GAAIhG,EAAG,IAAIZ,GAAGnI,CAAC,CAAC,GAAGhB,CAAC;AAAA,EAC5C;AAKD,MAAI,CAAC+J,EAAG,IAAIA,EAAG,IAAIwF,EAAM,EAAE,GAAGM,EAAoBN,EAAM,EAAE,CAAC;AACvD,UAAM,IAAI,MAAM,6CAA6C;AAEjE,WAASS,EAAmBnK,GAAK;AAC7B,WAAO,OAAOA,KAAQ,YAAYP,KAAMO,KAAOA,IAAM0J,EAAM;AAAA,EAC9D;AACD,WAASU,EAASpK,GAAK;AACnB,QAAI,CAACmK,EAAmBnK,CAAG;AACvB,YAAM,IAAI,MAAM,6CAA6C;AAAA,EACpE;AAGD,WAASqK,EAAuB5T,GAAK;AACjC,UAAM,EAAE,0BAA0BgE,GAAS,aAAAoL,GAAa,gBAAAyE,GAAgB,GAAA7Y,EAAG,IAAGiY;AAC9E,QAAIjP,KAAW,OAAOhE,KAAQ,UAAU;AAIpC,UAHIA,aAAe,eACfA,IAAM8T,GAAc9T,CAAG,IAEvB,OAAOA,KAAQ,YAAY,CAACgE,EAAQ,SAAShE,EAAI,MAAM;AACvD,cAAM,IAAI,MAAM,aAAa;AACjC,MAAAA,IAAMA,EAAI,SAASoP,IAAc,GAAG,GAAG;AAAA,IAC1C;AACD,QAAI7F;AACJ,QAAI;AACA,MAAAA,IACI,OAAOvJ,KAAQ,WACTA,IACA+T,GAAmB5J,GAAY,eAAenK,GAAKoP,CAAW,CAAC;AAAA,IAC5E,QACa;AACV,YAAM,IAAI,MAAM,uBAAuBA,CAAW,8BAA8B,OAAOpP,CAAG,EAAE;AAAA,IAC/F;AACD,WAAI6T,MACAtK,IAAMyK,GAAQzK,GAAKvO,CAAC,IACxB2Y,EAASpK,CAAG,GACLA;AAAA,EACV;AACD,QAAM0K,IAAmB,oBAAI;AAC7B,WAASC,EAAeC,GAAO;AAC3B,QAAI,EAAEA,aAAiBC;AACnB,YAAM,IAAI,MAAM,0BAA0B;AAAA,EACjD;AAAA,EAMD,MAAMA,EAAM;AAAA,IACR,YAAYC,GAAIC,GAAIC,GAAI;AAIpB,UAHA,KAAK,KAAKF,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACNF,KAAM,QAAQ,CAAC5G,EAAG,QAAQ4G,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,UAAIC,KAAM,QAAQ,CAAC7G,EAAG,QAAQ6G,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,UAAIC,KAAM,QAAQ,CAAC9G,EAAG,QAAQ8G,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAAA,IACnC;AAAA;AAAA;AAAA,IAGD,OAAO,WAAW3U,GAAG;AACjB,YAAM,EAAE,GAAAiN,GAAG,MAAMjN,KAAK,CAAA;AACtB,UAAI,CAACA,KAAK,CAAC6N,EAAG,QAAQZ,CAAC,KAAK,CAACY,EAAG,QAAQ,CAAC;AACrC,cAAM,IAAI,MAAM,sBAAsB;AAC1C,UAAI7N,aAAawU;AACb,cAAM,IAAI,MAAM,8BAA8B;AAClD,YAAMI,IAAM,CAACvU,MAAMwN,EAAG,IAAIxN,GAAGwN,EAAG,IAAI;AAEpC,aAAI+G,EAAI3H,CAAC,KAAK2H,EAAI,CAAC,IACRJ,EAAM,OACV,IAAIA,EAAMvH,GAAG,GAAGY,EAAG,GAAG;AAAA,IAChC;AAAA,IACD,IAAI,IAAI;AACJ,aAAO,KAAK,SAAU,EAAC;AAAA,IAC1B;AAAA,IACD,IAAI,IAAI;AACJ,aAAO,KAAK,SAAU,EAAC;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,WAAWuD,GAAQ;AACtB,YAAMyD,IAAQhH,EAAG,YAAYuD,EAAO,IAAI,CAACpR,MAAMA,EAAE,EAAE,CAAC;AACpD,aAAOoR,EAAO,IAAI,CAACpR,GAAGK,MAAML,EAAE,SAAS6U,EAAMxU,CAAC,CAAC,CAAC,EAAE,IAAImU,EAAM,UAAU;AAAA,IACzE;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,QAAQ/K,GAAK;AAChB,YAAM8D,IAAIiH,EAAM,WAAWf,EAAUlJ,GAAY,YAAYd,CAAG,CAAC,CAAC;AAClE,aAAA8D,EAAE,eAAc,GACTA;AAAA,IACV;AAAA;AAAA,IAED,OAAO,eAAeuH,GAAY;AAC9B,aAAON,EAAM,KAAK,SAASR,EAAuBc,CAAU,CAAC;AAAA,IAChE;AAAA;AAAA,IAED,eAAe5D,GAAY;AACvB,WAAK,eAAeA,GACpBmD,EAAiB,OAAO,IAAI;AAAA,IAC/B;AAAA;AAAA,IAED,iBAAiB;AACb,UAAI,KAAK,OAAO;AAIZ,YAAIhB,EAAM,sBAAsB,CAACxF,EAAG,IAAI,KAAK,EAAE;AAC3C;AACJ,cAAM,IAAI,MAAM,iBAAiB;AAAA,MACpC;AAED,YAAM,EAAE,GAAAZ,GAAG,GAAA8H,EAAG,IAAG,KAAK,SAAQ;AAE9B,UAAI,CAAClH,EAAG,QAAQZ,CAAC,KAAK,CAACY,EAAG,QAAQkH,CAAC;AAC/B,cAAM,IAAI,MAAM,0BAA0B;AAC9C,YAAMC,IAAOnH,EAAG,IAAIkH,CAAC,GACfE,IAAQtB,EAAoB1G,CAAC;AACnC,UAAI,CAACY,EAAG,IAAImH,GAAMC,CAAK;AACnB,cAAM,IAAI,MAAM,mCAAmC;AACvD,UAAI,CAAC,KAAK,cAAe;AACrB,cAAM,IAAI,MAAM,wCAAwC;AAAA,IAC/D;AAAA,IACD,WAAW;AACP,YAAM,EAAE,GAAAF,EAAC,IAAK,KAAK,SAAQ;AAC3B,UAAIlH,EAAG;AACH,eAAO,CAACA,EAAG,MAAMkH,CAAC;AACtB,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAChD;AAAA;AAAA;AAAA;AAAA,IAID,OAAOR,GAAO;AACV,MAAAD,EAAeC,CAAK;AACpB,YAAM,EAAE,IAAIW,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG,MAC7B,EAAE,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAGhB,GAC7BiB,IAAK3H,EAAG,IAAIA,EAAG,IAAIqH,GAAIK,CAAE,GAAG1H,EAAG,IAAIwH,GAAID,CAAE,CAAC,GAC1CK,IAAK5H,EAAG,IAAIA,EAAG,IAAIsH,GAAII,CAAE,GAAG1H,EAAG,IAAIyH,GAAIF,CAAE,CAAC;AAChD,aAAOI,KAAMC;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA,IAID,SAAS;AACL,aAAO,IAAIjB,EAAM,KAAK,IAAI3G,EAAG,IAAI,KAAK,EAAE,GAAG,KAAK,EAAE;AAAA,IACrD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,SAAS;AACL,YAAM,EAAE,GAAA/I,GAAG,GAAAhB,EAAG,IAAGuP,GACXqC,IAAK7H,EAAG,IAAI/J,GAAGyI,EAAG,GAClB,EAAE,IAAI2I,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG;AACnC,UAAIO,IAAK9H,EAAG,MAAM+H,IAAK/H,EAAG,MAAMgI,IAAKhI,EAAG,MACpCiI,IAAKjI,EAAG,IAAIqH,GAAIA,CAAE,GAClBa,IAAKlI,EAAG,IAAIsH,GAAIA,CAAE,GAClBlH,IAAKJ,EAAG,IAAIuH,GAAIA,CAAE,GAClBY,IAAKnI,EAAG,IAAIqH,GAAIC,CAAE;AACtB,aAAAa,IAAKnI,EAAG,IAAImI,GAAIA,CAAE,GAClBH,IAAKhI,EAAG,IAAIqH,GAAIE,CAAE,GAClBS,IAAKhI,EAAG,IAAIgI,GAAIA,CAAE,GAClBF,IAAK9H,EAAG,IAAI/I,GAAG+Q,CAAE,GACjBD,IAAK/H,EAAG,IAAI6H,GAAIzH,CAAE,GAClB2H,IAAK/H,EAAG,IAAI8H,GAAIC,CAAE,GAClBD,IAAK9H,EAAG,IAAIkI,GAAIH,CAAE,GAClBA,IAAK/H,EAAG,IAAIkI,GAAIH,CAAE,GAClBA,IAAK/H,EAAG,IAAI8H,GAAIC,CAAE,GAClBD,IAAK9H,EAAG,IAAImI,GAAIL,CAAE,GAClBE,IAAKhI,EAAG,IAAI6H,GAAIG,CAAE,GAClB5H,IAAKJ,EAAG,IAAI/I,GAAGmJ,CAAE,GACjB+H,IAAKnI,EAAG,IAAIiI,GAAI7H,CAAE,GAClB+H,IAAKnI,EAAG,IAAI/I,GAAGkR,CAAE,GACjBA,IAAKnI,EAAG,IAAImI,GAAIH,CAAE,GAClBA,IAAKhI,EAAG,IAAIiI,GAAIA,CAAE,GAClBA,IAAKjI,EAAG,IAAIgI,GAAIC,CAAE,GAClBA,IAAKjI,EAAG,IAAIiI,GAAI7H,CAAE,GAClB6H,IAAKjI,EAAG,IAAIiI,GAAIE,CAAE,GAClBJ,IAAK/H,EAAG,IAAI+H,GAAIE,CAAE,GAClB7H,IAAKJ,EAAG,IAAIsH,GAAIC,CAAE,GAClBnH,IAAKJ,EAAG,IAAII,GAAIA,CAAE,GAClB6H,IAAKjI,EAAG,IAAII,GAAI+H,CAAE,GAClBL,IAAK9H,EAAG,IAAI8H,GAAIG,CAAE,GAClBD,IAAKhI,EAAG,IAAII,GAAI8H,CAAE,GAClBF,IAAKhI,EAAG,IAAIgI,GAAIA,CAAE,GAClBA,IAAKhI,EAAG,IAAIgI,GAAIA,CAAE,GACX,IAAIrB,EAAMmB,GAAIC,GAAIC,CAAE;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAItB,GAAO;AACP,MAAAD,EAAeC,CAAK;AACpB,YAAM,EAAE,IAAIW,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG,MAC7B,EAAE,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAGhB;AACnC,UAAIoB,IAAK9H,EAAG,MAAM+H,IAAK/H,EAAG,MAAMgI,IAAKhI,EAAG;AACxC,YAAM/I,IAAIuO,EAAM,GACVqC,IAAK7H,EAAG,IAAIwF,EAAM,GAAG9G,EAAG;AAC9B,UAAIuJ,IAAKjI,EAAG,IAAIqH,GAAIG,CAAE,GAClBU,IAAKlI,EAAG,IAAIsH,GAAIG,CAAE,GAClBrH,IAAKJ,EAAG,IAAIuH,GAAIG,CAAE,GAClBS,IAAKnI,EAAG,IAAIqH,GAAIC,CAAE,GAClBc,IAAKpI,EAAG,IAAIwH,GAAIC,CAAE;AACtB,MAAAU,IAAKnI,EAAG,IAAImI,GAAIC,CAAE,GAClBA,IAAKpI,EAAG,IAAIiI,GAAIC,CAAE,GAClBC,IAAKnI,EAAG,IAAImI,GAAIC,CAAE,GAClBA,IAAKpI,EAAG,IAAIqH,GAAIE,CAAE;AAClB,UAAIc,IAAKrI,EAAG,IAAIwH,GAAIE,CAAE;AACtB,aAAAU,IAAKpI,EAAG,IAAIoI,GAAIC,CAAE,GAClBA,IAAKrI,EAAG,IAAIiI,GAAI7H,CAAE,GAClBgI,IAAKpI,EAAG,IAAIoI,GAAIC,CAAE,GAClBA,IAAKrI,EAAG,IAAIsH,GAAIC,CAAE,GAClBO,IAAK9H,EAAG,IAAIyH,GAAIC,CAAE,GAClBW,IAAKrI,EAAG,IAAIqI,GAAIP,CAAE,GAClBA,IAAK9H,EAAG,IAAIkI,GAAI9H,CAAE,GAClBiI,IAAKrI,EAAG,IAAIqI,GAAIP,CAAE,GAClBE,IAAKhI,EAAG,IAAI/I,GAAGmR,CAAE,GACjBN,IAAK9H,EAAG,IAAI6H,GAAIzH,CAAE,GAClB4H,IAAKhI,EAAG,IAAI8H,GAAIE,CAAE,GAClBF,IAAK9H,EAAG,IAAIkI,GAAIF,CAAE,GAClBA,IAAKhI,EAAG,IAAIkI,GAAIF,CAAE,GAClBD,IAAK/H,EAAG,IAAI8H,GAAIE,CAAE,GAClBE,IAAKlI,EAAG,IAAIiI,GAAIA,CAAE,GAClBC,IAAKlI,EAAG,IAAIkI,GAAID,CAAE,GAClB7H,IAAKJ,EAAG,IAAI/I,GAAGmJ,CAAE,GACjBgI,IAAKpI,EAAG,IAAI6H,GAAIO,CAAE,GAClBF,IAAKlI,EAAG,IAAIkI,GAAI9H,CAAE,GAClBA,IAAKJ,EAAG,IAAIiI,GAAI7H,CAAE,GAClBA,IAAKJ,EAAG,IAAI/I,GAAGmJ,CAAE,GACjBgI,IAAKpI,EAAG,IAAIoI,GAAIhI,CAAE,GAClB6H,IAAKjI,EAAG,IAAIkI,GAAIE,CAAE,GAClBL,IAAK/H,EAAG,IAAI+H,GAAIE,CAAE,GAClBA,IAAKjI,EAAG,IAAIqI,GAAID,CAAE,GAClBN,IAAK9H,EAAG,IAAImI,GAAIL,CAAE,GAClBA,IAAK9H,EAAG,IAAI8H,GAAIG,CAAE,GAClBA,IAAKjI,EAAG,IAAImI,GAAID,CAAE,GAClBF,IAAKhI,EAAG,IAAIqI,GAAIL,CAAE,GAClBA,IAAKhI,EAAG,IAAIgI,GAAIC,CAAE,GACX,IAAItB,EAAMmB,GAAIC,GAAIC,CAAE;AAAA,IAC9B;AAAA,IACD,SAAStB,GAAO;AACZ,aAAO,KAAK,IAAIA,EAAM,OAAQ,CAAA;AAAA,IACjC;AAAA,IACD,MAAM;AACF,aAAO,KAAK,OAAOC,EAAM,IAAI;AAAA,IAChC;AAAA,IACD,KAAKpZ,GAAG;AACJ,aAAO+a,EAAK,WAAW,MAAM9B,GAAkBjZ,GAAG,CAAC8W,MAAS;AACxD,cAAM2C,IAAQhH,EAAG,YAAYqE,EAAK,IAAI,CAAClS,MAAMA,EAAE,EAAE,CAAC;AAClD,eAAOkS,EAAK,IAAI,CAAClS,GAAGK,MAAML,EAAE,SAAS6U,EAAMxU,CAAC,CAAC,CAAC,EAAE,IAAImU,EAAM,UAAU;AAAA,MACpF,CAAa;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,eAAepZ,GAAG;AACd,YAAMgb,IAAI5B,EAAM;AAChB,UAAIpZ,MAAMgO;AACN,eAAOgN;AAEX,UADArC,EAAS3Y,CAAC,GACNA,MAAMiO;AACN,eAAO;AACX,YAAM,EAAE,MAAAkJ,EAAM,IAAGc;AACjB,UAAI,CAACd;AACD,eAAO4D,EAAK,aAAa,MAAM/a,CAAC;AAEpC,UAAI,EAAE,OAAAib,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE,IAAKjE,EAAK,YAAYnX,CAAC,GAC7Cqb,IAAML,GACNM,IAAMN,GACNrH,IAAI;AACR,aAAOuH,IAAKlN,MAAOoN,IAAKpN;AACpB,QAAIkN,IAAKjN,OACLoN,IAAMA,EAAI,IAAI1H,CAAC,IACfyH,IAAKnN,OACLqN,IAAMA,EAAI,IAAI3H,CAAC,IACnBA,IAAIA,EAAE,UACNuH,MAAOjN,IACPmN,MAAOnN;AAEX,aAAIgN,MACAI,IAAMA,EAAI,WACVF,MACAG,IAAMA,EAAI,WACdA,IAAM,IAAIlC,EAAM3G,EAAG,IAAI6I,EAAI,IAAInE,EAAK,IAAI,GAAGmE,EAAI,IAAIA,EAAI,EAAE,GAClDD,EAAI,IAAIC,CAAG;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,SAASC,GAAQ;AACb,MAAA5C,EAAS4C,CAAM;AACf,UAAIvb,IAAIub,GACJrD,GAAOsD;AACX,YAAM,EAAE,MAAArE,EAAM,IAAGc;AACjB,UAAId,GAAM;AACN,cAAM,EAAE,OAAA8D,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE,IAAKjE,EAAK,YAAYnX,CAAC;AACnD,YAAI,EAAE,GAAGqb,GAAK,GAAGI,EAAG,IAAK,KAAK,KAAKP,CAAE,GACjC,EAAE,GAAGI,GAAK,GAAGI,EAAG,IAAK,KAAK,KAAKN,CAAE;AACrC,QAAAC,IAAMN,EAAK,gBAAgBE,GAAOI,CAAG,GACrCC,IAAMP,EAAK,gBAAgBI,GAAOG,CAAG,GACrCA,IAAM,IAAIlC,EAAM3G,EAAG,IAAI6I,EAAI,IAAInE,EAAK,IAAI,GAAGmE,EAAI,IAAIA,EAAI,EAAE,GACzDpD,IAAQmD,EAAI,IAAIC,CAAG,GACnBE,IAAOC,EAAI,IAAIC,CAAG;AAAA,MACrB,OACI;AACD,cAAM,EAAE,GAAA9W,GAAG,GAAA8O,EAAC,IAAK,KAAK,KAAK1T,CAAC;AAC5B,QAAAkY,IAAQtT,GACR4W,IAAO9H;AAAA,MACV;AAED,aAAO0F,EAAM,WAAW,CAAClB,GAAOsD,CAAI,CAAC,EAAE,CAAC;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,qBAAqBnJ,GAAG3I,GAAGhB,GAAG;AAC1B,YAAM0E,IAAIgM,EAAM,MACVuC,IAAM,CAACxJ,GAAGzI,MACVA,MAAMsE,MAAOtE,MAAMuE,MAAO,CAACkE,EAAE,OAAO/E,CAAC,IAAI+E,EAAE,eAAezI,CAAC,IAAIyI,EAAE,SAASzI,CAAC,GAC3Ea,IAAMoR,EAAI,MAAMjS,CAAC,EAAE,IAAIiS,EAAItJ,GAAG3J,CAAC,CAAC;AACtC,aAAO6B,EAAI,QAAQ,SAAYA;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAID,SAASqR,GAAI;AACT,YAAM,EAAE,IAAI/J,GAAG,IAAI,GAAG,IAAIgK,EAAG,IAAG,MAC1BrC,IAAM,KAAK;AAGjB,MAAIoC,KAAM,SACNA,IAAKpC,IAAM/G,EAAG,MAAMA,EAAG,IAAIoJ,CAAC;AAChC,YAAMC,IAAKrJ,EAAG,IAAIZ,GAAG+J,CAAE,GACjBG,IAAKtJ,EAAG,IAAI,GAAGmJ,CAAE,GACjBI,IAAKvJ,EAAG,IAAIoJ,GAAGD,CAAE;AACvB,UAAIpC;AACA,eAAO,EAAE,GAAG/G,EAAG,MAAM,GAAGA,EAAG;AAC/B,UAAI,CAACA,EAAG,IAAIuJ,GAAIvJ,EAAG,GAAG;AAClB,cAAM,IAAI,MAAM,kBAAkB;AACtC,aAAO,EAAE,GAAGqJ,GAAI,GAAGC,EAAE;AAAA,IACxB;AAAA,IACD,gBAAgB;AACZ,YAAM,EAAE,GAAGE,GAAU,eAAAC,EAAa,IAAKjE;AACvC,UAAIgE,MAAahO;AACb,eAAO;AACX,UAAIiO;AACA,eAAOA,EAAc9C,GAAO,IAAI;AACpC,YAAM,IAAI,MAAM,8DAA8D;AAAA,IACjF;AAAA,IACD,gBAAgB;AACZ,YAAM,EAAE,GAAG6C,GAAU,eAAAE,EAAa,IAAKlE;AACvC,aAAIgE,MAAahO,KACN,OACPkO,IACOA,EAAc/C,GAAO,IAAI,IAC7B,KAAK,eAAenB,EAAM,CAAC;AAAA,IACrC;AAAA,IACD,WAAWmE,IAAe,IAAM;AAC5B,kBAAK,eAAc,GACZlS,EAAQkP,GAAO,MAAMgD,CAAY;AAAA,IAC3C;AAAA,IACD,MAAMA,IAAe,IAAM;AACvB,aAAOtD,GAAc,KAAK,WAAWsD,CAAY,CAAC;AAAA,IACrD;AAAA,EACJ;AACD,EAAAhD,EAAM,OAAO,IAAIA,EAAMnB,EAAM,IAAIA,EAAM,IAAIxF,EAAG,GAAG,GACjD2G,EAAM,OAAO,IAAIA,EAAM3G,EAAG,MAAMA,EAAG,KAAKA,EAAG,IAAI;AAC/C,QAAM4J,IAAQpE,EAAM,YACd8C,IAAOzF,GAAK8D,GAAOnB,EAAM,OAAO,KAAK,KAAKoE,IAAQ,CAAC,IAAIA,CAAK;AAElE,SAAO;AAAA,IACH,OAAApE;AAAA,IACA,iBAAiBmB;AAAA,IACjB,wBAAAR;AAAA,IACA,qBAAAL;AAAA,IACA,oBAAAG;AAAA,EACR;AACA;AACA,SAAS4D,GAAatF,GAAO;AACzB,QAAMzD,IAAOwD,GAAcC,CAAK;AAChCE,SAAAA,GAAkB3D,GAAM;AAAA,IACpB,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,EACrB,GAAO;AAAA,IACC,UAAU;AAAA,IACV,eAAe;AAAA,IACf,MAAM;AAAA,EACd,CAAK,GACM,OAAO,OAAO,EAAE,MAAM,IAAM,GAAGA,EAAI,CAAE;AAChD;AACO,SAASgJ,GAAYC,GAAU;AAClC,QAAMvE,IAAQqE,GAAaE,CAAQ,GAC7B,EAAE,IAAA/J,GAAI,GAAGgK,EAAW,IAAKxE,GACzByE,IAAgBjK,EAAG,QAAQ,GAC3BkK,IAAkB,IAAIlK,EAAG,QAAQ;AACvC,WAASmK,EAAoBrO,GAAK;AAC9B,WAAOP,KAAMO,KAAOA,IAAMkE,EAAG;AAAA,EAChC;AACD,WAASoK,EAAKnT,GAAG;AACb,WAAOsP,GAAQtP,GAAG+S,CAAW;AAAA,EAChC;AACD,WAASK,EAAKpT,GAAG;AACb,WAAOqT,GAAWrT,GAAG+S,CAAW;AAAA,EACnC;AACD,QAAM,EAAE,iBAAiBrD,GAAO,wBAAAR,GAAwB,qBAAAL,GAAqB,oBAAAG,EAAqB,IAAGV,GAAkB;AAAA,IACnH,GAAGC;AAAA,IACH,QAAQpS,GAAIqS,GAAOkE,GAAc;AAC7B,YAAM1S,IAAIwO,EAAM,YACVrG,IAAIY,EAAG,QAAQ/I,EAAE,CAAC,GAClBsT,IAAM5E;AACZ,aAAIgE,IACOY,EAAI,WAAW,KAAK,CAAC9E,EAAM,SAAU,IAAG,IAAO,CAAI,CAAC,GAAGrG,CAAC,IAGxDmL,EAAI,WAAW,KAAK,CAAC,CAAI,CAAC,GAAGnL,GAAGY,EAAG,QAAQ/I,EAAE,CAAC,CAAC;AAAA,IAE7D;AAAA,IACD,UAAUX,GAAO;AACb,YAAM8C,IAAM9C,EAAM,QACZtB,IAAOsB,EAAM,CAAC,GACduP,IAAOvP,EAAM,SAAS,CAAC;AAE7B,UAAI8C,MAAQ6Q,MAAkBjV,MAAS,KAAQA,MAAS,IAAO;AAC3D,cAAMoK,IAAIkH,GAAmBT,CAAI;AACjC,YAAI,CAACsE,EAAoB/K,CAAC;AACtB,gBAAM,IAAI,MAAM,uBAAuB;AAC3C,cAAMoL,IAAK1E,EAAoB1G,CAAC;AAChC,YAAI8H,IAAIlH,EAAG,KAAKwK,CAAE;AAClB,cAAMC,MAAUvD,IAAI1L,QAASA;AAG7B,gBADmBxG,IAAO,OAAO,MACfyV,OACdvD,IAAIlH,EAAG,IAAIkH,CAAC,IACT,EAAE,GAAA9H,GAAG,GAAA8H;MACf,WACQ9N,MAAQ8Q,KAAmBlV,MAAS,GAAM;AAC/C,cAAMoK,IAAIY,EAAG,UAAU6F,EAAK,SAAS,GAAG7F,EAAG,KAAK,CAAC,GAC3CkH,IAAIlH,EAAG,UAAU6F,EAAK,SAAS7F,EAAG,OAAO,IAAIA,EAAG,KAAK,CAAC;AAC5D,eAAO,EAAE,GAAAZ,GAAG,GAAA8H;MACf;AAEG,cAAM,IAAI,MAAM,mBAAmB9N,CAAG,0BAA0B6Q,CAAa,wBAAwBC,CAAe,qBAAqB;AAAA,IAEhJ;AAAA,EACT,CAAK,GACKQ,IAAgB,CAAC5O,MAAQuK,GAAcsE,GAAmB7O,GAAK0J,EAAM,WAAW,CAAC;AACvF,WAASoF,EAAsBvU,GAAQ;AACnC,UAAMwU,IAAOb,KAAexO;AAC5B,WAAOnF,IAASwU;AAAA,EACnB;AACD,WAASC,EAAWxd,GAAG;AACnB,WAAOsd,EAAsBtd,CAAC,IAAI8c,EAAK,CAAC9c,CAAC,IAAIA;AAAA,EAChD;AAED,QAAMyd,IAAS,CAAC9U,GAAG+U,GAAMrR,MAAO2M,GAAmBrQ,EAAE,MAAM+U,GAAMrR,CAAE,CAAC;AAAA,EAIpE,MAAMsR,EAAU;AAAA,IACZ,YAAYpT,GAAGvK,GAAG4d,GAAU;AACxB,WAAK,IAAIrT,GACT,KAAK,IAAIvK,GACT,KAAK,WAAW4d,GAChB,KAAK,eAAc;AAAA,IACtB;AAAA;AAAA,IAED,OAAO,YAAYtP,GAAK;AACpB,YAAMmJ,IAAIS,EAAM;AAChB,aAAA5J,IAAMc,GAAY,oBAAoBd,GAAKmJ,IAAI,CAAC,GACzC,IAAIkG,EAAUF,EAAOnP,GAAK,GAAGmJ,CAAC,GAAGgG,EAAOnP,GAAKmJ,GAAG,IAAIA,CAAC,CAAC;AAAA,IAChE;AAAA;AAAA;AAAA,IAGD,OAAO,QAAQnJ,GAAK;AAChB,YAAM,EAAE,GAAA/D,GAAG,GAAAvK,EAAC,IAAKwX,GAAI,MAAMpI,GAAY,OAAOd,CAAG,CAAC;AAClD,aAAO,IAAIqP,EAAUpT,GAAGvK,CAAC;AAAA,IAC5B;AAAA,IACD,iBAAiB;AAEb,UAAI,CAAC2Y,EAAmB,KAAK,CAAC;AAC1B,cAAM,IAAI,MAAM,2BAA2B;AAC/C,UAAI,CAACA,EAAmB,KAAK,CAAC;AAC1B,cAAM,IAAI,MAAM,2BAA2B;AAAA,IAClD;AAAA,IACD,eAAeiF,GAAU;AACrB,aAAO,IAAID,EAAU,KAAK,GAAG,KAAK,GAAGC,CAAQ;AAAA,IAChD;AAAA,IACD,iBAAiBC,GAAS;AACtB,YAAM,EAAE,GAAAtT,GAAG,GAAAvK,GAAG,UAAU8d,EAAG,IAAK,MAC1BtS,IAAIuS,EAAc3O,GAAY,WAAWyO,CAAO,CAAC;AACvD,UAAIC,KAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAASA,CAAG;AACzC,cAAM,IAAI,MAAM,qBAAqB;AACzC,YAAME,IAAOF,MAAQ,KAAKA,MAAQ,IAAIvT,IAAI2N,EAAM,IAAI3N;AACpD,UAAIyT,KAAQtL,EAAG;AACX,cAAM,IAAI,MAAM,4BAA4B;AAChD,YAAMuL,KAAUH,IAAM,IAAkB,OAAP,MAC3BI,KAAI7E,EAAM,QAAQ4E,KAASb,EAAcY,CAAI,CAAC,GAC9CG,KAAKpB,EAAKiB,CAAI,GACdI,KAAKtB,EAAK,CAACtR,IAAI2S,EAAE,GACjBE,KAAKvB,EAAK9c,IAAIme,EAAE,GAChB7L,KAAI+G,EAAM,KAAK,qBAAqB6E,IAAGE,IAAIC,EAAE;AACnD,UAAI,CAAC/L;AACD,cAAM,IAAI,MAAM,mBAAmB;AACvC,aAAAA,GAAE,eAAc,GACTA;AAAA,IACV;AAAA;AAAA,IAED,WAAW;AACP,aAAOgL,EAAsB,KAAK,CAAC;AAAA,IACtC;AAAA,IACD,aAAa;AACT,aAAO,KAAK,SAAQ,IAAK,IAAIK,EAAU,KAAK,GAAGb,EAAK,CAAC,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI;AAAA,IAClF;AAAA;AAAA,IAED,gBAAgB;AACZ,aAAOwB,GAAc,KAAK,SAAQ,CAAE;AAAA,IACvC;AAAA,IACD,WAAW;AACP,aAAO9G,GAAI,WAAW,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAC,CAAE;AAAA,IACjD;AAAA;AAAA,IAED,oBAAoB;AAChB,aAAO8G,GAAc,KAAK,aAAY,CAAE;AAAA,IAC3C;AAAA,IACD,eAAe;AACX,aAAOlB,EAAc,KAAK,CAAC,IAAIA,EAAc,KAAK,CAAC;AAAA,IACtD;AAAA,EACJ;AACD,QAAMmB,IAAQ;AAAA,IACV,kBAAkB5E,GAAY;AAC1B,UAAI;AACA,eAAAd,EAAuBc,CAAU,GAC1B;AAAA,MACV,QACa;AACV,eAAO;AAAA,MACV;AAAA,IACJ;AAAA,IACD,wBAAwBd;AAAA;AAAA;AAAA;AAAA;AAAA,IAKxB,kBAAkB,MAAM;AACpB,YAAMvM,IAASkS,GAAqBtG,EAAM,CAAC;AAC3C,aAAOuG,GAAmBvG,EAAM,YAAY5L,CAAM,GAAG4L,EAAM,CAAC;AAAA,IAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,WAAWnC,IAAa,GAAGoC,IAAQkB,EAAM,MAAM;AAC3C,aAAAlB,EAAM,eAAepC,CAAU,GAC/BoC,EAAM,SAAS,OAAO,CAAC,CAAC,GACjBA;AAAA,IACV;AAAA,EACT;AAOI,WAASuG,EAAa/E,GAAY0C,IAAe,IAAM;AACnD,WAAOhD,EAAM,eAAeM,CAAU,EAAE,WAAW0C,CAAY;AAAA,EAClE;AAID,WAASsC,EAAUhJ,GAAM;AACrB,UAAMhQ,IAAMgQ,aAAgB,YACtBzL,IAAM,OAAOyL,KAAS,UACtB7J,KAAOnG,KAAOuE,MAAQyL,EAAK;AACjC,WAAIhQ,IACOmG,MAAQ6Q,KAAiB7Q,MAAQ8Q,IACxC1S,IACO4B,MAAQ,IAAI6Q,KAAiB7Q,MAAQ,IAAI8Q,IAChDjH,aAAgB0D;AAAA,EAGvB;AAWD,WAASuF,EAAgBC,GAAUC,GAASzC,IAAe,IAAM;AAC7D,QAAIsC,EAAUE,CAAQ;AAClB,YAAM,IAAI,MAAM,+BAA+B;AACnD,QAAI,CAACF,EAAUG,CAAO;AAClB,YAAM,IAAI,MAAM,+BAA+B;AAEnD,WADUzF,EAAM,QAAQyF,CAAO,EACtB,SAASjG,EAAuBgG,CAAQ,CAAC,EAAE,WAAWxC,CAAY;AAAA,EAC9E;AAKD,QAAM0C,IAAW7G,EAAM,YACnB,SAAUlP,GAAO;AAGb,UAAMwF,IAAMwK,GAAmBhQ,CAAK,GAC9BgW,IAAQhW,EAAM,SAAS,IAAIkP,EAAM;AACvC,WAAO8G,IAAQ,IAAIxQ,KAAO,OAAOwQ,CAAK,IAAIxQ;AAAA,EACtD,GACUuP,IAAgB7F,EAAM,iBACxB,SAAUlP,GAAO;AACb,WAAO8T,EAAKiC,EAAS/V,CAAK,CAAC;AAAA,EACvC,GAEUiW,IAAaC,GAAWhH,EAAM,UAAU;AAI9C,WAASiH,EAAW3Q,GAAK;AACrB,QAAI,OAAOA,KAAQ;AACf,YAAM,IAAI,MAAM,iBAAiB;AACrC,QAAI,EAAEP,MAAOO,KAAOA,IAAMyQ;AACtB,YAAM,IAAI,MAAM,uBAAuB/G,EAAM,UAAU,EAAE;AAE7D,WAAOmF,GAAmB7O,GAAK0J,EAAM,WAAW;AAAA,EACnD;AAMD,WAASkH,EAAQvB,GAASlE,GAAYnG,IAAO6L,GAAgB;AACzD,QAAI,CAAC,aAAa,WAAW,EAAE,KAAK,CAACva,OAAMA,MAAK0O,CAAI;AAChD,YAAM,IAAI,MAAM,qCAAqC;AACzD,UAAM,EAAE,MAAAtK,GAAM,aAAA6B,EAAa,IAAGmN;AAC9B,QAAI,EAAE,MAAAoH,GAAM,SAAAC,GAAS,cAAcC,GAAG,IAAKhM;AAC3C,IAAI8L,KAAQ,SACRA,IAAO,KACXzB,IAAUzO,GAAY,WAAWyO,CAAO,GACpC0B,MACA1B,IAAUzO,GAAY,qBAAqBlG,EAAK2U,CAAO,CAAC;AAI5D,UAAM4B,KAAQ1B,EAAcF,CAAO,GAC7BjK,KAAIiF,EAAuBc,CAAU,GACrC+F,KAAW,CAACP,EAAWvL,EAAC,GAAGuL,EAAWM,EAAK,CAAC;AAElD,QAAID,MAAO,MAAM;AAEb,YAAMjQ,KAAIiQ,OAAQ,KAAOzU,EAAY2H,EAAG,KAAK,IAAI8M;AACjD,MAAAE,GAAS,KAAKtQ,GAAY,gBAAgBG,EAAC,CAAC;AAAA,IAC/C;AACD,UAAMgB,KAAO8H,GAAe,GAAGqH,EAAQ,GACjCxN,KAAIuN;AAEV,aAASE,GAAMC,IAAQ;AAEnB,YAAM9a,KAAIia,EAASa,EAAM;AACzB,UAAI,CAACjH,EAAmB7T,EAAC;AACrB;AACJ,YAAM+a,KAAK9C,EAAKjY,EAAC,GACXmN,KAAIoH,EAAM,KAAK,SAASvU,EAAC,EAAE,YAC3ByF,KAAIuS,EAAK7K,GAAE,CAAC;AAClB,UAAI1H,OAAM0D;AACN;AAIJ,YAAMjO,KAAI8c,EAAK+C,KAAK/C,EAAK5K,KAAI3H,KAAIqJ,EAAC,CAAC;AACnC,UAAI5T,OAAMiO;AACN;AACJ,UAAI2P,MAAY3L,GAAE,MAAM1H,KAAI,IAAI,KAAK,OAAO0H,GAAE,IAAI/D,EAAG,GACjD4R,KAAQ9f;AACZ,aAAIsf,KAAQhC,EAAsBtd,EAAC,MAC/B8f,KAAQtC,EAAWxd,EAAC,GACpB4d,MAAY,IAET,IAAID,EAAUpT,IAAGuV,IAAOlC,EAAQ;AAAA,IAC1C;AACD,WAAO,EAAE,MAAArN,IAAM,OAAAoP;EAClB;AACD,QAAMN,IAAiB,EAAE,MAAMnH,EAAM,MAAM,SAAS,MAC9C6H,IAAiB,EAAE,MAAM7H,EAAM,MAAM,SAAS;AAcpD,WAAS8H,EAAKnC,GAASoC,GAASzM,IAAO6L,GAAgB;AACnD,UAAM,EAAE,MAAA9O,GAAM,OAAAoP,EAAO,IAAGP,EAAQvB,GAASoC,GAASzM,CAAI,GAChDvG,IAAIiL;AAEV,WADagI,GAAkBjT,EAAE,KAAK,WAAWA,EAAE,aAAaA,EAAE,IAAI,EAC1DsD,GAAMoP,CAAK;AAAA,EAC1B;AAED,EAAAtG,EAAM,KAAK,eAAe,CAAC;AAe3B,WAAS8G,EAAOC,GAAWvC,GAASwC,GAAW7M,IAAOuM,GAAgB;ATv2B1E,QAAAjhB;ASw2BQ,UAAMwhB,IAAKF;AAGX,QAFAvC,IAAUzO,GAAY,WAAWyO,CAAO,GACxCwC,IAAYjR,GAAY,aAAaiR,CAAS,GAC1C,YAAY7M;AACZ,YAAM,IAAI,MAAM,oCAAoC;AACxD,UAAM,EAAE,MAAA8L,GAAM,SAAAC,EAAS,IAAG/L;AAC1B,QAAI+M,IACAnO;AACJ,QAAI;AACA,UAAI,OAAOkO,KAAO,YAAYA,aAAc;AAGxC,YAAI;AACA,UAAAC,KAAO5C,EAAU,QAAQ2C,CAAE;AAAA,QAC9B,SACME,IAAU;AACb,cAAI,EAAEA,cAAoBhJ,GAAI;AAC1B,kBAAMgJ;AACV,UAAAD,KAAO5C,EAAU,YAAY2C,CAAE;AAAA,QAClC;AAAA,eAEI,OAAOA,KAAO,YAAY,OAAOA,EAAG,KAAM,YAAY,OAAOA,EAAG,KAAM,UAAU;AACrF,cAAM,EAAE,GAAA/V,IAAG,GAAAvK,GAAG,IAAGsgB;AACjB,QAAAC,KAAO,IAAI5C,EAAUpT,IAAGvK,EAAC;AAAA,MAC5B;AAEG,cAAM,IAAI,MAAM,OAAO;AAE3B,MAAAoS,KAAIiH,EAAM,QAAQgH,CAAS;AAAA,IAC9B,SACMI,IAAO;AACV,UAAIA,GAAM,YAAY;AAClB,cAAM,IAAI,MAAM,gEAAgE;AACpF,aAAO;AAAA,IACV;AACD,QAAInB,KAAQiB,GAAK,SAAU;AACvB,aAAO;AACX,IAAIhB,MACA1B,IAAU3F,EAAM,KAAK2F,CAAO;AAChC,UAAM,EAAE,GAAAtT,IAAG,GAAAvK,GAAG,IAAGugB,IACX/U,KAAIuS,EAAcF,CAAO,GACzB6C,KAAK3D,EAAK/c,EAAC,GACXoe,KAAKtB,EAAKtR,KAAIkV,EAAE,GAChBrC,KAAKvB,EAAKvS,KAAImW,EAAE,GAChBxC,MAAIpf,KAAAua,EAAM,KAAK,qBAAqBjH,IAAGgM,IAAIC,EAAE,MAAzC,gBAAAvf,GAA4C;AACtD,WAAKof,KAEKpB,EAAKoB,GAAE,CAAC,MACL3T,KAFF;AAAA,EAGd;AACD,SAAO;AAAA,IACH,OAAA2N;AAAA,IACA,cAAAwG;AAAA,IACA,iBAAAE;AAAA,IACA,MAAAoB;AAAA,IACA,QAAAG;AAAA,IACA,iBAAiB9G;AAAA,IACjB,WAAAsE;AAAA,IACA,OAAAY;AAAA,EACR;AACA;SCj6BO,cAAmB9S,GAAK;AAAA,EAC3B,YAAYvC,GAAMyX,GAAM;AACpB,aACA,KAAK,WAAW,IAChB,KAAK,YAAY,IACjBC,GAAW1X,CAAI;AACf,UAAMjE,IAAMkF,GAAQwW,CAAI;AAExB,QADA,KAAK,QAAQzX,EAAK,UACd,OAAO,KAAK,MAAM,UAAW;AAC7B,YAAM,IAAI,MAAM,qDAAqD;AACzE,SAAK,WAAW,KAAK,MAAM,UAC3B,KAAK,YAAY,KAAK,MAAM;AAC5B,UAAMwC,IAAW,KAAK,UAChBjB,IAAM,IAAI,WAAWiB,CAAQ;AAEnC,IAAAjB,EAAI,IAAIxF,EAAI,SAASyG,IAAWxC,EAAK,OAAQ,EAAC,OAAOjE,CAAG,EAAE,OAAQ,IAAGA,CAAG;AACxE,aAASC,IAAI,GAAGA,IAAIuF,EAAI,QAAQvF;AAC5B,MAAAuF,EAAIvF,CAAC,KAAK;AACd,SAAK,MAAM,OAAOuF,CAAG,GAErB,KAAK,QAAQvB,EAAK;AAElB,aAAShE,IAAI,GAAGA,IAAIuF,EAAI,QAAQvF;AAC5B,MAAAuF,EAAIvF,CAAC,KAAK;AACd,SAAK,MAAM,OAAOuF,CAAG,GACrBA,EAAI,KAAK,CAAC;AAAA,EACb;AAAA,EACD,OAAOoW,GAAK;AACRC,WAAAA,GAAa,IAAI,GACjB,KAAK,MAAM,OAAOD,CAAG,GACd;AAAA,EACV;AAAA,EACD,WAAWtX,GAAK;AACZuX,IAAAA,GAAa,IAAI,GACjBC,GAAYxX,GAAK,KAAK,SAAS,GAC/B,KAAK,WAAW,IAChB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,MAAM,OAAOA,CAAG,GACrB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,QAAO;AAAA,EACf;AAAA,EACD,SAAS;AACL,UAAMA,IAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,gBAAK,WAAWA,CAAG,GACZA;AAAA,EACV;AAAA,EACD,WAAW8C,GAAI;AAEX,IAAAA,MAAOA,IAAK,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAE,CAAA;AACzD,UAAM,EAAE,OAAA2U,GAAO,OAAAC,GAAO,UAAA1U,GAAU,WAAAC,GAAW,UAAAd,GAAU,WAAAC,EAAW,IAAG;AACnE,WAAAU,IAAKA,GACLA,EAAG,WAAWE,GACdF,EAAG,YAAYG,GACfH,EAAG,WAAWX,GACdW,EAAG,YAAYV,GACfU,EAAG,QAAQ2U,EAAM,WAAW3U,EAAG,KAAK,GACpCA,EAAG,QAAQ4U,EAAM,WAAW5U,EAAG,KAAK,GAC7BA;AAAA,EACV;AAAA,EACD,UAAU;AACN,SAAK,YAAY,IACjB,KAAK,MAAM,WACX,KAAK,MAAM;EACd;AACL;AAOO,MAAM6U,KAAO,CAAChY,GAAMjE,GAAKkc,MAAY,IAAIC,GAAKlY,GAAMjE,CAAG,EAAE,OAAOkc,CAAO,EAAE,OAAM;AACtFD,GAAK,SAAS,CAAChY,GAAMjE,MAAQ,IAAImc,GAAKlY,GAAMjE,CAAG;AC3E/C;AAKO,SAASoc,GAAQnY,GAAM;AAC1B,SAAO;AAAA,IACH,MAAAA;AAAA,IACA,MAAM,CAACjE,MAAQqc,MAASJ,GAAKhY,GAAMjE,GAAKoF,GAAY,GAAGiX,CAAI,CAAC;AAAA,IACpE,aAAQvW;AAAAA,EACR;AACA;AACO,SAASwW,GAAY9E,GAAU+E,GAAS;AAC3C,QAAMC,IAAS,CAACvY,MAASsT,GAAY,EAAE,GAAGC,GAAU,GAAG4E,GAAQnY,CAAI,EAAC,CAAE;AACtE,SAAO,OAAO,OAAO,EAAE,GAAGuY,EAAOD,CAAO,GAAG,QAAAC,EAAM,CAAE;AACvD;ACfA;AAQA,MAAMC,KAAa,OAAO,oEAAoE,GACxFC,KAAa,OAAO,oEAAoE,GACxFzT,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GACdyT,KAAa,CAACjY,GAAGhB,OAAOgB,IAAIhB,IAAIwF,MAAOxF;AAK7C,SAASkZ,GAAQjI,GAAG;AAChB,QAAMxH,IAAIsP,IAEJtQ,IAAM,OAAO,CAAC,GAAG0Q,IAAM,OAAO,CAAC,GAAGC,IAAO,OAAO,EAAE,GAAGC,IAAO,OAAO,EAAE,GAErEC,IAAO,OAAO,EAAE,GAAGC,IAAO,OAAO,EAAE,GAAGC,IAAO,OAAO,EAAE,GACtDzS,IAAMkK,IAAIA,IAAIA,IAAKxH,GACnBmI,IAAM7K,IAAKA,IAAKkK,IAAKxH,GACrBgQ,IAAMvQ,GAAK0I,GAAInJ,GAAKgB,CAAC,IAAImI,IAAMnI,GAC/BiQ,IAAMxQ,GAAKuQ,GAAIhR,GAAKgB,CAAC,IAAImI,IAAMnI,GAC/BkQ,IAAOzQ,GAAKwQ,GAAIlU,IAAKiE,CAAC,IAAI1C,IAAM0C,GAChCmQ,IAAO1Q,GAAKyQ,GAAKP,GAAM3P,CAAC,IAAIkQ,IAAOlQ,GACnCoQ,IAAO3Q,GAAK0Q,GAAKP,GAAM5P,CAAC,IAAImQ,IAAOnQ,GACnCqQ,IAAO5Q,GAAK2Q,GAAKN,GAAM9P,CAAC,IAAIoQ,IAAOpQ,GACnCsQ,IAAQ7Q,GAAK4Q,GAAKN,GAAM/P,CAAC,IAAIqQ,IAAOrQ,GACpCuQ,IAAQ9Q,GAAK6Q,GAAMR,GAAM9P,CAAC,IAAIoQ,IAAOpQ,GACrCwQ,IAAQ/Q,GAAK8Q,GAAMvR,GAAKgB,CAAC,IAAImI,IAAMnI,GACnCwI,IAAM/I,GAAK+Q,GAAMX,GAAM7P,CAAC,IAAImQ,IAAOnQ,GACnCU,IAAMjB,GAAK+I,GAAIkH,GAAK1P,CAAC,IAAI1C,IAAM0C,GAC/BO,IAAOd,GAAKiB,GAAI3E,IAAKiE,CAAC;AAC5B,MAAI,CAACM,GAAG,IAAIA,GAAG,IAAIC,CAAI,GAAGiH,CAAC;AACvB,UAAM,IAAI,MAAM,yBAAyB;AAC7C,SAAOjH;AACX;AACA,MAAMD,KAAK4B,GAAMoN,IAAY,QAAW,QAAW,EAAE,MAAMG,GAAO,CAAE,GACvDgB,KAAYtB,GAAY;AAAA,EACjC,GAAG,OAAO,CAAC;AAAA,EACX,GAAG,OAAO,CAAC;AAAA,EACf,IAAI7O;AAAAA,EACA,GAAGiP;AAAAA;AAAAA,EAEH,IAAI,OAAO,+EAA+E;AAAA,EAC1F,IAAI,OAAO,+EAA+E;AAAA,EAC1F,GAAG,OAAO,CAAC;AAAA,EACX,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAON,MAAM;AAAA,IACF,MAAM,OAAO,oEAAoE;AAAA,IACjF,aAAa,CAAC7c,MAAM;AAChB,YAAM7E,IAAI0hB,IACJmB,IAAK,OAAO,oCAAoC,GAChDrT,IAAK,CAACvB,KAAM,OAAO,oCAAoC,GACvD6U,IAAK,OAAO,qCAAqC,GACjDrT,IAAKoT,GACLE,IAAY,OAAO,qCAAqC,GACxD/P,IAAK2O,GAAWlS,IAAK5K,GAAG7E,CAAC,GACzBgjB,IAAKrB,GAAW,CAACnS,IAAK3K,GAAG7E,CAAC;AAChC,UAAIkb,IAAK3J,GAAI1M,IAAImO,IAAK6P,IAAKG,IAAKF,GAAI9iB,CAAC,GACjCob,IAAK7J,GAAI,CAACyB,IAAKxD,IAAKwT,IAAKvT,GAAIzP,CAAC;AAClC,YAAMib,IAAQC,IAAK6H,GACb5H,IAAQC,IAAK2H;AAKnB,UAJI9H,MACAC,IAAKlb,IAAIkb,IACTC,MACAC,IAAKpb,IAAIob,IACTF,IAAK6H,KAAa3H,IAAK2H;AACvB,cAAM,IAAI,MAAM,yCAAyCle,CAAC;AAE9D,aAAO,EAAE,OAAAoW,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE;AAAA,IAChC;AAAA,EACJ;AACL,GAAGtN,EAAM,GAGHE,KAAM,OAAO,CAAC,GACdiV,KAAK,CAACpR,MAAM,OAAOA,KAAM,YAAY7D,KAAM6D,KAAKA,IAAI4P,IACpD3O,KAAK,CAACjB,MAAM,OAAOA,KAAM,YAAY7D,KAAM6D,KAAKA,IAAI6P,IAEpDwB,KAAuB,CAAA;AAC7B,SAASC,GAAWC,MAAQC,GAAU;AAClC,MAAIC,IAAOJ,GAAqBE,CAAG;AACnC,MAAIE,MAAS,QAAW;AACpB,UAAMC,IAAOzV,GAAO,WAAW,KAAKsV,GAAK,CAACze,MAAMA,EAAE,WAAW,CAAC,CAAC,CAAC;AAChE,IAAA2e,IAAOlZ,GAAYmZ,GAAMA,CAAI,GAC7BL,GAAqBE,CAAG,IAAIE;AAAA,EAC/B;AACD,SAAOxV,GAAO1D,GAAYkZ,GAAM,GAAGD,CAAQ,CAAC;AAChD;AAEA,MAAMG,KAAe,CAACtL,MAAUA,EAAM,WAAW,EAAI,EAAE,MAAM,CAAC,GACxDuL,KAAW,CAAC,MAAMzU,GAAgB,GAAG,EAAE,GACvC0U,KAAO,CAAC7R,MAAMN,GAAIM,GAAG4P,EAAU,GAC/B5E,KAAO,CAAChL,MAAMN,GAAIM,GAAG6P,EAAU,GAC/BtI,KAAQwJ,GAAU,iBAClBe,KAAU,CAACtR,GAAG3I,GAAGhB,MAAM0Q,GAAM,KAAK,qBAAqB/G,GAAG3I,GAAGhB,CAAC;AAEpE,SAASkb,GAAoBC,GAAM;AAC/B,MAAIC,IAAKlB,GAAU,MAAM,uBAAuBiB,CAAI,GAChDjf,IAAIwU,GAAM,eAAe0K,CAAE;AAE/B,SAAO,EAAE,QADMlf,EAAE,SAAQ,IAAKkf,IAAKjH,GAAK,CAACiH,CAAE,GAClB,OAAON,GAAa5e,CAAC;AAClD;AAKA,SAASmf,GAAOlS,GAAG;AACf,MAAI,CAACoR,GAAGpR,CAAC;AACL,UAAM,IAAI,MAAM,uBAAuB;AAC3C,QAAMmS,IAAKN,GAAK7R,IAAIA,CAAC,GACflN,IAAI+e,GAAKM,IAAKnS,IAAI,OAAO,CAAC,CAAC;AACjC,MAAI8H,IAAIiI,GAAQjd,CAAC;AACjB,EAAIgV,IAAIzL,OAAQF,OACZ2L,IAAI+J,GAAK,CAAC/J,CAAC;AACf,QAAM/U,IAAI,IAAIwU,GAAMvH,GAAG8H,GAAG1L,EAAG;AAC7B,SAAArJ,EAAE,eAAc,GACTA;AACX;AAIA,SAASqf,MAAaC,GAAM;AACxB,SAAOrH,GAAK/N,GAAgBqU,GAAW,qBAAqB,GAAGe,CAAI,CAAC,CAAC;AACzE;AAIA,SAASC,GAAoBzK,GAAY;AACrC,SAAOkK,GAAoBlK,CAAU,EAAE;AAC3C;AAKA,SAAS0K,GAAYlD,GAASxH,GAAY2K,IAAUvZ,GAAY,EAAE,GAAG;AACjE,QAAMmH,IAAI9C,GAAY,WAAW+R,CAAO,GAClC,EAAE,OAAO7H,GAAI,QAAQ1F,MAAMiQ,GAAoBlK,CAAU,GACzDhQ,IAAIyF,GAAY,WAAWkV,GAAS,EAAE,GACtCjd,IAAIqc,GAAS9P,IAAI7E,GAAgBqU,GAAW,eAAezZ,CAAC,CAAC,CAAC,GAC9D4a,IAAOnB,GAAW,iBAAiB/b,GAAGiS,GAAIpH,CAAC,GAC3CsS,IAAK1H,GAAK/N,GAAgBwV,CAAI,CAAC;AACrC,MAAIC,MAAOvW;AACP,UAAM,IAAI,MAAM,wBAAwB;AAC5C,QAAM,EAAE,OAAOwW,GAAI,QAAQ3f,MAAM+e,GAAoBW,CAAE,GACjDjV,IAAI2U,GAAUO,GAAInL,GAAIpH,CAAC,GACvB0F,IAAM,IAAI,WAAW,EAAE;AAI7B,MAHAA,EAAI,IAAI6M,GAAI,CAAC,GACb7M,EAAI,IAAI8L,GAAS5G,GAAKhY,IAAIyK,IAAIqE,CAAC,CAAC,GAAG,EAAE,GAEjC,CAAC8Q,GAAc9M,GAAK1F,GAAGoH,CAAE;AACzB,UAAM,IAAI,MAAM,kCAAkC;AACtD,SAAO1B;AACX;AAKA,SAAS8M,GAActE,GAAWe,GAASd,GAAW;AAClD,QAAMzI,IAAMxI,GAAY,aAAagR,GAAW,EAAE,GAC5ClO,IAAI9C,GAAY,WAAW+R,CAAO,GAClCwD,IAAMvV,GAAY,aAAaiR,GAAW,EAAE;AAClD,MAAI;AACA,UAAMjO,IAAI4R,GAAOjV,GAAgB4V,CAAG,CAAC,GAC/Bpa,IAAIwE,GAAgB6I,EAAI,SAAS,GAAG,EAAE,CAAC;AAC7C,QAAI,CAACsL,GAAG3Y,CAAC;AACL,aAAO;AACX,UAAMvK,IAAI+O,GAAgB6I,EAAI,SAAS,IAAI,EAAE,CAAC;AAC9C,QAAI,CAAC7E,GAAG/S,CAAC;AACL,aAAO;AACX,UAAMuP,IAAI2U,GAAUR,GAASnZ,CAAC,GAAGkZ,GAAarR,CAAC,GAAGF,CAAC,GAC7CgM,IAAI0F,GAAQxR,GAAGpS,GAAG8c,GAAK,CAACvN,CAAC,CAAC;AAChC,WAAI,GAAC2O,KAAK,CAACA,EAAE,SAAU,KAAIA,EAAE,WAAW,MAAM3T;AAAA,EAGjD,QACa;AACV,WAAO;AAAA,EACV;AACL;AACO,MAAMqa,KAAkC;AAAA,EAC3C,cAAcR;AAAA,EACd,MAAMC;AAAA,EACN,QAAQK;AAAA,EACR,OAAO;AAAA,IACH,kBAAkB7B,GAAU,MAAM;AAAA,IAClC,QAAAmB;AAAA,IACA,cAAAP;AAAA,IACR,iBAAQxU;AAAAA,IACR,iBAAQF;AAAAA,IACA,YAAAqU;AAAA,IACR,KAAQ5R;AAAAA,EACH;AACL,GC5Ma/H,KAAS,OAAO,cAAe,YAAY,YAAY,aAAa,WAAW,SAAS;ACArG;AAQA,MAAMC,KAAM,CAACC,MAAMA,aAAa,YAKnBC,KAAa,CAACjE,MAAQ,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU,GAE7EkE,KAAO,CAACC,GAAMC,MAAWD,KAAS,KAAKC,IAAWD,MAASC,GAG3DC,KAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAChF,IAAI,CAACA;AACD,QAAM,IAAI,MAAM,6CAA6C;AACjE,MAAMoE,KAAQ,MAAM,KAAK,EAAE,QAAQ,IAAK,GAAE,CAAChJ,GAAGF,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAI5E,SAASmJ,GAAWrF,GAAO;AAC9B,MAAI,CAACU,GAAIV,CAAK;AACV,UAAM,IAAI,MAAM,qBAAqB;AAEzC,MAAIsF,IAAM;AACV,WAASpJ,IAAI,GAAGA,IAAI8D,EAAM,QAAQ9D;AAC9B,IAAAoJ,KAAOF,GAAMpF,EAAM9D,CAAC,CAAC;AAEzB,SAAOoJ;AACX;AAIO,SAASI,GAAWJ,GAAK;AAC5B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAC5D,QAAMxC,IAAMwC,EAAI;AAChB,MAAIxC,IAAM;AACN,UAAM,IAAI,MAAM,4DAA4DA,CAAG;AACnF,QAAM6C,IAAQ,IAAI,WAAW7C,IAAM,CAAC;AACpC,WAAS5G,IAAI,GAAGA,IAAIyJ,EAAM,QAAQzJ,KAAK;AACnC,UAAM0J,IAAI1J,IAAI,GACR2J,IAAUP,EAAI,MAAMM,GAAGA,IAAI,CAAC,GAC5BE,IAAO,OAAO,SAASD,GAAS,EAAE;AACxC,QAAI,OAAO,MAAMC,CAAI,KAAKA,IAAO;AAC7B,YAAM,IAAI,MAAM,uBAAuB;AAC3C,IAAAH,EAAMzJ,CAAC,IAAI4J;AAAA,EACd;AACD,SAAOH;AACX;AAqBO,SAAS1E,GAAYC,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AACpE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACvD;AAMO,SAASC,GAAQC,GAAM;AAG1B,MAFI,OAAOA,KAAS,aAChBA,IAAOH,GAAYG,CAAI,IACvB,CAACV,GAAIU,CAAI;AACT,UAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE;AAC7D,SAAOA;AACX;AAIO,SAASC,MAAeC,GAAQ;AACnC,QAAMC,IAAI,IAAI,WAAWD,EAAO,OAAO,CAACE,GAAKb,MAAMa,IAAMb,EAAE,QAAQ,CAAC,CAAC;AACrE,MAAIc,IAAM;AACV,SAAAH,EAAO,QAAQ,CAACX,MAAM;AAClB,QAAI,CAACD,GAAIC,CAAC;AACN,YAAM,IAAI,MAAM,qBAAqB;AACzC,IAAAY,EAAE,IAAIZ,GAAGc,CAAG,GACZA,KAAOd,EAAE;AAAA,EACjB,CAAK,GACMY;AACX;AAEO,IAAAsa,KAAA,MAAW;AAAA;AAAA,EAEd,QAAQ;AACJ,WAAO,KAAK;EACf;AACL;AASO,SAASla,GAAgBC,GAAU;AACtC,QAAMC,IAAQ,CAACrM,MAAQoM,EAAU,EAAC,OAAOT,GAAQ3L,CAAG,CAAC,EAAE,UACjDsM,IAAMF;AACZ,SAAAC,EAAM,YAAYC,EAAI,WACtBD,EAAM,WAAWC,EAAI,UACrBD,EAAM,SAAS,MAAMD,KACdC;AACX;AAoBO,SAASE,GAAYC,IAAc,IAAI;AAC1C,MAAIvB,MAAU,OAAOA,GAAO,mBAAoB;AAC5C,WAAOA,GAAO,gBAAgB,IAAI,WAAWuB,CAAW,CAAC;AAE7D,QAAM,IAAI,MAAM,wCAAwC;AAC5D;ACzJO,SAASjC,GAAO,GAAG;AACtB,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAChC,UAAM,IAAI,MAAM,2BAA2B,CAAC,EAAE;AACtD;AACO,SAAS+b,GAAKnc,GAAG;AACpB,MAAI,OAAOA,KAAM;AACb,UAAM,IAAI,MAAM,yBAAyBA,CAAC,EAAE;AACpD;AACO,SAASK,GAAML,MAAMM,GAAS;AACjC,MAAI,EAAEN,aAAa;AACf,UAAM,IAAI,MAAM,qBAAqB;AACzC,MAAIM,EAAQ,SAAS,KAAK,CAACA,EAAQ,SAASN,EAAE,MAAM;AAChD,UAAM,IAAI,MAAM,iCAAiCM,CAAO,mBAAmBN,EAAE,MAAM,EAAE;AAC7F;AACO,SAASO,GAAKA,GAAM;AACvB,MAAI,OAAOA,KAAS,cAAc,OAAOA,EAAK,UAAW;AACrD,UAAM,IAAI,MAAM,iDAAiD;AACrEH,EAAAA,GAAOG,EAAK,SAAS,GACrBH,GAAOG,EAAK,QAAQ;AACxB;AACO,SAASC,GAAOC,GAAUC,IAAgB,IAAM;AACnD,MAAID,EAAS;AACT,UAAM,IAAI,MAAM,kCAAkC;AACtD,MAAIC,KAAiBD,EAAS;AAC1B,UAAM,IAAI,MAAM,uCAAuC;AAC/D;AACO,SAASE,GAAOC,GAAKH,GAAU;AAClCJ,EAAAA,GAAMO,CAAG;AACT,QAAMC,IAAMJ,EAAS;AACrB,MAAIG,EAAI,SAASC;AACb,UAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE;AAEtF;AACA,MAAMub,KAAS;AAAA,EACf,QAAIhc;AAAAA,EACJ,MAAI+b;AAAAA,EACJ,OAAI9b;AAAAA,EACJ,MAAIE;AAAAA,EACJ,QAAIC;AAAAA,EACJ,QAAIG;AACJ;ACrCA,SAAS2B,GAAaC,GAAMC,GAAY9F,GAAO2E,GAAM;AACjD,MAAI,OAAOkB,EAAK,gBAAiB;AAC7B,WAAOA,EAAK,aAAaC,GAAY9F,GAAO2E,CAAI;AACpD,QAAMoB,IAAO,OAAO,EAAE,GAChBC,IAAW,OAAO,UAAU,GAC5BC,IAAK,OAAQjG,KAAS+F,IAAQC,CAAQ,GACtCE,IAAK,OAAOlG,IAAQgG,CAAQ,GAC5BG,IAAIxB,IAAO,IAAI,GACf,IAAIA,IAAO,IAAI;AACrB,EAAAkB,EAAK,UAAUC,IAAaK,GAAGF,GAAItB,CAAI,GACvCkB,EAAK,UAAUC,IAAa,GAAGI,GAAIvB,CAAI;AAC3C;AAEO,MAAM8C,WAAarB,GAAK;AAAA,EAC3B,YAAYC,GAAUC,GAAWC,GAAW5B,GAAM;AAC9C,aACA,KAAK,WAAW0B,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAO5B,GACZ,KAAK,WAAW,IAChB,KAAK,SAAS,GACd,KAAK,MAAM,GACX,KAAK,YAAY,IACjB,KAAK,SAAS,IAAI,WAAW0B,CAAQ,GACrC,KAAK,OAAO9B,GAAW,KAAK,MAAM;AAAA,EACrC;AAAA,EACD,OAAOQ,GAAM;AACT,IAAA2a,GAAO,OAAO,IAAI;AAClB,UAAM,EAAE,MAAA7Z,GAAM,QAAAW,GAAQ,UAAAH,EAAQ,IAAK;AACnC,IAAAtB,IAAOD,GAAQC,CAAI;AACnB,UAAM0B,IAAM1B,EAAK;AACjB,aAAS2B,IAAM,GAAGA,IAAMD,KAAM;AAC1B,YAAME,IAAO,KAAK,IAAIN,IAAW,KAAK,KAAKI,IAAMC,CAAG;AAEpD,UAAIC,MAASN,GAAU;AACnB,cAAMO,IAAWrC,GAAWQ,CAAI;AAChC,eAAOsB,KAAYI,IAAMC,GAAKA,KAAOL;AACjC,eAAK,QAAQO,GAAUF,CAAG;AAC9B;AAAA,MACH;AACD,MAAAF,EAAO,IAAIzB,EAAK,SAAS2B,GAAKA,IAAMC,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZD,KAAOC,GACH,KAAK,QAAQN,MACb,KAAK,QAAQR,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAElB;AACD,gBAAK,UAAUd,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACV;AAAA,EACD,WAAWb,GAAK;AACZ,IAAAwb,GAAO,OAAO,IAAI,GAClBA,GAAO,OAAOxb,GAAK,IAAI,GACvB,KAAK,WAAW;AAIhB,UAAM,EAAE,QAAAsC,GAAQ,MAAAX,GAAM,UAAAQ,GAAU,MAAA1B,EAAI,IAAK;AACzC,QAAI,EAAE,KAAA+B,EAAK,IAAG;AAEd,IAAAF,EAAOE,GAAK,IAAI,KAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,GAE5B,KAAK,YAAYL,IAAWK,MAC5B,KAAK,QAAQb,GAAM,CAAC,GACpBa,IAAM;AAGV,aAAS7G,IAAI6G,GAAK7G,IAAIwG,GAAUxG;AAC5B,MAAA2G,EAAO3G,CAAC,IAAI;AAIhB+F,IAAAA,GAAaC,GAAMQ,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAG1B,CAAI,GAC9D,KAAK,QAAQkB,GAAM,CAAC;AACpB,UAAMgB,IAAQtC,GAAWL,CAAG,GACtBuC,IAAM,KAAK;AAEjB,QAAIA,IAAM;AACN,YAAM,IAAI,MAAM,6CAA6C;AACjE,UAAMK,IAASL,IAAM,GACfM,IAAQ,KAAK;AACnB,QAAID,IAASC,EAAM;AACf,YAAM,IAAI,MAAM,oCAAoC;AACxD,aAASlH,IAAI,GAAGA,IAAIiH,GAAQjH;AACxB,MAAAgH,EAAM,UAAU,IAAIhH,GAAGkH,EAAMlH,CAAC,GAAG8E,CAAI;AAAA,EAC5C;AAAA,EACD,SAAS;AACL,UAAM,EAAE,QAAA6B,GAAQ,WAAAF,EAAW,IAAG;AAC9B,SAAK,WAAWE,CAAM;AACtB,UAAMrD,IAAMqD,EAAO,MAAM,GAAGF,CAAS;AACrC,gBAAK,QAAO,GACLnD;AAAA,EACV;AAAA,EACD,WAAW6D,GAAI;AACX,IAAAA,MAAOA,IAAK,IAAI,KAAK,YAAa,IAClCA,EAAG,IAAI,GAAG,KAAK,IAAK,CAAA;AACpB,UAAM,EAAE,UAAAX,GAAU,QAAAG,GAAQ,QAAAS,GAAQ,UAAAC,GAAU,WAAAC,GAAW,KAAAT,EAAK,IAAG;AAC/D,WAAAM,EAAG,SAASC,GACZD,EAAG,MAAMN,GACTM,EAAG,WAAWE,GACdF,EAAG,YAAYG,GACXF,IAASZ,KACTW,EAAG,OAAO,IAAIR,CAAM,GACjBQ;AAAA,EACV;AACL;AC7GA,MAAMI,KAAM,CAAC9C,GAAGhB,GAAG/D,MAAO+E,IAAIhB,IAAM,CAACgB,IAAI/E,GAEnC8H,KAAM,CAAC/C,GAAGhB,GAAG/D,MAAO+E,IAAIhB,IAAMgB,IAAI/E,IAAM+D,IAAI/D,GAI5C+H,KAAW,IAAI,YAAY;AAAA,EAC7B;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAGKC,KAAK,IAAI,YAAY;AAAA,EACvB;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAGKC,KAAW,IAAI,YAAY,EAAE;SACnC,cAAqBC,GAAK;AAAA,EACtB,cAAc;AACV,UAAM,IAAI,IAAI,GAAG,EAAK,GAGtB,KAAK,IAAIF,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI,GACjB,KAAK,IAAIA,GAAG,CAAC,IAAI;AAAA,EACpB;AAAA,EACD,MAAM;AACF,UAAM,EAAE,GAAAG,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAG,IAAG;AACnC,WAAO,CAACP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EACjC;AAAA;AAAA,EAED,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAG;AACxB,SAAK,IAAIP,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI;AAAA,EAChB;AAAA,EACD,QAAQpC,GAAMqC,GAAQ;AAElB,aAASrI,IAAI,GAAGA,IAAI,IAAIA,KAAKqI,KAAU;AACnCV,MAAAA,GAAS3H,CAAC,IAAIgG,EAAK,UAAUqC,GAAQ,EAAK;AAC9C,aAASrI,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAC1B,YAAMsI,IAAMX,GAAS3H,IAAI,EAAE,GACrBuI,IAAKZ,GAAS3H,IAAI,CAAC,GACnBwI,IAAK7D,GAAK2D,GAAK,CAAC,IAAI3D,GAAK2D,GAAK,EAAE,IAAKA,MAAQ,GAC7CG,IAAK9D,GAAK4D,GAAI,EAAE,IAAI5D,GAAK4D,GAAI,EAAE,IAAKA,MAAO;AACjDZ,MAAAA,GAAS3H,CAAC,IAAKyI,IAAKd,GAAS3H,IAAI,CAAC,IAAIwI,IAAKb,GAAS3H,IAAI,EAAE,IAAK;AAAA,IAClE;AAED,QAAI,EAAE,GAAA6H,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAG,IAAG;AACjC,aAASpI,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,YAAM0I,IAAS/D,GAAKsD,GAAG,CAAC,IAAItD,GAAKsD,GAAG,EAAE,IAAItD,GAAKsD,GAAG,EAAE,GAC9CU,IAAMP,IAAIM,IAASnB,GAAIU,GAAGC,GAAGC,CAAC,IAAIV,GAASzH,CAAC,IAAI2H,GAAS3H,CAAC,IAAK,GAE/D4I,KADSjE,GAAKkD,GAAG,CAAC,IAAIlD,GAAKkD,GAAG,EAAE,IAAIlD,GAAKkD,GAAG,EAAE,KAC/BL,GAAIK,GAAGC,GAAGC,CAAC,IAAK;AACrC,MAAAK,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKD,IAAIW,IAAM,GACfX,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKc,IAAKC,IAAM;AAAA,IACnB;AAED,IAAAf,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnB,KAAK,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EAClC;AAAA,EACD,aAAa;AACTT,IAAAA,GAAS,KAAK,CAAC;AAAA,EAClB;AAAA,EACD,UAAU;AACN,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/B,KAAK,OAAO,KAAK,CAAC;AAAA,EACrB;AACL;AAEA,MAAMmY,WAAehX,GAAO;AAAA,EACxB,cAAc;AACV,aACA,KAAK,IAAI,aACT,KAAK,IAAI,WACT,KAAK,IAAI,WACT,KAAK,IAAI,YACT,KAAK,IAAI,UACT,KAAK,IAAI,YACT,KAAK,IAAI,YACT,KAAK,IAAI,aACT,KAAK,YAAY;AAAA,EACpB;AACL;AAKO,MAAMD,KAASpD,GAAgB,MAAM,IAAIqD,GAAQ,CAAA;AAClCrD,GAAgB,MAAM,IAAIqa,GAAQ,CAAA;AC1HxD;AACO,SAASC,GAAa,GAAG;AAC5B,MAAI,CAAC,OAAO,cAAc,CAAC;AACvB,UAAM,IAAI,MAAM,kBAAkB,CAAC,EAAE;AAC7C;AACA,SAASC,MAASf,GAAM;AACpB,QAAMgB,IAAO,CAACxb,GAAGhB,MAAM,CAAC/D,MAAM+E,EAAEhB,EAAE/D,CAAC,CAAC,GAC9BwgB,IAAS,MAAM,KAAKjB,CAAI,EACzB,QAAS,EACT,OAAO,CAACnQ,GAAK,MAAOA,IAAMmR,EAAKnR,GAAK,EAAE,MAAM,IAAI,EAAE,QAAS,MAAS,GACnEqR,IAASlB,EAAK,OAAO,CAACnQ,GAAK,MAAOA,IAAMmR,EAAKnR,GAAK,EAAE,MAAM,IAAI,EAAE,QAAS,MAAS;AACxF,SAAO,EAAE,QAAAoR,GAAQ,QAAAC;AACrB;AACA,SAASC,GAASA,GAAU;AACxB,SAAO;AAAA,IACH,QAAQ,CAACC,MAAW;AAChB,UAAI,CAAC,MAAM,QAAQA,CAAM,KAAMA,EAAO,UAAU,OAAOA,EAAO,CAAC,KAAM;AACjE,cAAM,IAAI,MAAM,qDAAqD;AACzE,aAAOA,EAAO,IAAI,CAACrgB,MAAM;AAErB,YADA+f,GAAa/f,CAAC,GACVA,IAAI,KAAKA,KAAKogB,EAAS;AACvB,gBAAM,IAAI,MAAM,iCAAiCpgB,CAAC,eAAeogB,EAAS,MAAM,GAAG;AACvF,eAAOA,EAASpgB,CAAC;AAAA,MACjC,CAAa;AAAA,IACJ;AAAA,IACD,QAAQ,CAACsgB,MAAU;AACf,UAAI,CAAC,MAAM,QAAQA,CAAK,KAAMA,EAAM,UAAU,OAAOA,EAAM,CAAC,KAAM;AAC9D,cAAM,IAAI,MAAM,kDAAkD;AACtE,aAAOA,EAAM,IAAI,CAACC,MAAW;AACzB,YAAI,OAAOA,KAAW;AAClB,gBAAM,IAAI,MAAM,uCAAuCA,CAAM,EAAE;AACnE,cAAM1gB,IAAQugB,EAAS,QAAQG,CAAM;AACrC,YAAI1gB,MAAU;AACV,gBAAM,IAAI,MAAM,oBAAoB0gB,CAAM,eAAeH,CAAQ,EAAE;AACvE,eAAOvgB;AAAA,MACvB,CAAa;AAAA,IACJ;AAAA,EACT;AACA;AACA,SAAS2gB,GAAKC,IAAY,IAAI;AAC1B,MAAI,OAAOA,KAAc;AACrB,UAAM,IAAI,MAAM,iCAAiC;AACrD,SAAO;AAAA,IACH,QAAQ,CAACjI,MAAS;AACd,UAAI,CAAC,MAAM,QAAQA,CAAI,KAAMA,EAAK,UAAU,OAAOA,EAAK,CAAC,KAAM;AAC3D,cAAM,IAAI,MAAM,8CAA8C;AAClE,eAASxY,KAAKwY;AACV,YAAI,OAAOxY,KAAM;AACb,gBAAM,IAAI,MAAM,iCAAiCA,CAAC,EAAE;AAC5D,aAAOwY,EAAK,KAAKiI,CAAS;AAAA,IAC7B;AAAA,IACD,QAAQ,CAACtZ,MAAO;AACZ,UAAI,OAAOA,KAAO;AACd,cAAM,IAAI,MAAM,oCAAoC;AACxD,aAAOA,EAAG,MAAMsZ,CAAS;AAAA,IAC5B;AAAA,EACT;AACA;AACA,SAASC,GAAQpQ,GAAMqQ,IAAM,KAAK;AAE9B,MADAZ,GAAazP,CAAI,GACb,OAAOqQ,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B;AAClD,SAAO;AAAA,IACH,OAAOzb,GAAM;AACT,UAAI,CAAC,MAAM,QAAQA,CAAI,KAAMA,EAAK,UAAU,OAAOA,EAAK,CAAC,KAAM;AAC3D,cAAM,IAAI,MAAM,iDAAiD;AACrE,eAASlF,KAAKkF;AACV,YAAI,OAAOlF,KAAM;AACb,gBAAM,IAAI,MAAM,oCAAoCA,CAAC,EAAE;AAC/D,aAAQkF,EAAK,SAASoL,IAAQ;AAC1B,QAAApL,EAAK,KAAKyb,CAAG;AACjB,aAAOzb;AAAA,IACV;AAAA,IACD,OAAOob,GAAO;AACV,UAAI,CAAC,MAAM,QAAQA,CAAK,KAAMA,EAAM,UAAU,OAAOA,EAAM,CAAC,KAAM;AAC9D,cAAM,IAAI,MAAM,iDAAiD;AACrE,eAAStgB,KAAKsgB;AACV,YAAI,OAAOtgB,KAAM;AACb,gBAAM,IAAI,MAAM,oCAAoCA,CAAC,EAAE;AAC/D,UAAI4gB,IAAMN,EAAM;AAChB,UAAKM,IAAMtQ,IAAQ;AACf,cAAM,IAAI,MAAM,2DAA2D;AAC/E,aAAOsQ,IAAM,KAAKN,EAAMM,IAAM,CAAC,MAAMD,GAAKC;AACtC,YAAI,GAAIA,IAAM,KAAKtQ,IAAQ;AACvB,gBAAM,IAAI,MAAM,8CAA8C;AAEtE,aAAOgQ,EAAM,MAAM,GAAGM,CAAG;AAAA,IAC5B;AAAA,EACT;AACA;AACA,SAASC,GAAUpnB,GAAI;AACnB,MAAI,OAAOA,KAAO;AACd,UAAM,IAAI,MAAM,iCAAiC;AACrD,SAAO,EAAE,QAAQ,CAAC+e,MAASA,GAAM,QAAQ,CAACrR,MAAO1N,EAAG0N,CAAE;AAC1D;AACA,SAAS2Z,GAAa5b,GAAMsT,GAAMrR,GAAI;AAClC,MAAIqR,IAAO;AACP,UAAM,IAAI,MAAM,4BAA4BA,CAAI,8BAA8B;AAClF,MAAIrR,IAAK;AACL,UAAM,IAAI,MAAM,0BAA0BA,CAAE,8BAA8B;AAC9E,MAAI,CAAC,MAAM,QAAQjC,CAAI;AACnB,UAAM,IAAI,MAAM,oCAAoC;AACxD,MAAI,CAACA,EAAK;AACN,WAAO;AACX,MAAI2B,IAAM;AACV,QAAMvD,IAAM,CAAA,GACN+c,IAAS,MAAM,KAAKnb,CAAI;AAM9B,OALAmb,EAAO,QAAQ,CAAC3R,MAAM;AAElB,QADAqR,GAAarR,CAAC,GACVA,IAAI,KAAKA,KAAK8J;AACd,YAAM,IAAI,MAAM,kBAAkB9J,CAAC,EAAE;AAAA,EACjD,CAAK,OACY;AACT,QAAIqS,IAAQ,GACRC,IAAO;AACX,aAAShhB,IAAI6G,GAAK7G,IAAIqgB,EAAO,QAAQrgB,KAAK;AACtC,YAAMihB,IAAQZ,EAAOrgB,CAAC,GAChBkhB,IAAY1I,IAAOuI,IAAQE;AACjC,UAAI,CAAC,OAAO,cAAcC,CAAS,KAC9B1I,IAAOuI,IAASvI,MAASuI,KAC1BG,IAAYD,MAAUzI,IAAOuI;AAC7B,cAAM,IAAI,MAAM,8BAA8B;AAIlD,UAFAA,IAAQG,IAAY/Z,GACpBkZ,EAAOrgB,CAAC,IAAI,KAAK,MAAMkhB,IAAY/Z,CAAE,GACjC,CAAC,OAAO,cAAckZ,EAAOrgB,CAAC,CAAC,KAAKqgB,EAAOrgB,CAAC,IAAImH,IAAK4Z,MAAUG;AAC/D,cAAM,IAAI,MAAM,8BAA8B;AAClD,UAAKF;AAEA,QAAKX,EAAOrgB,CAAC,IAGdghB,IAAO,KAFPna,IAAM7G;AAAA,UAFN;AAAA,IAKP;AAED,QADAsD,EAAI,KAAKyd,CAAK,GACVC;AACA;AAAA,EACP;AACD,WAAShhB,IAAI,GAAGA,IAAIkF,EAAK,SAAS,KAAKA,EAAKlF,CAAC,MAAM,GAAGA;AAClD,IAAAsD,EAAI,KAAK,CAAC;AACd,SAAOA,EAAI;AACf;AACA,MAAM6d,KAAM,CAAC1c,GAAGhB,MAAQA,IAAQ0d,GAAI1d,GAAGgB,IAAIhB,CAAC,IAAhBgB,GACtB2c,KAAc,CAAC5I,GAAMrR,MAAOqR,KAAQrR,IAAKga,GAAI3I,GAAMrR,CAAE;AAC3D,SAASka,GAAcnc,GAAMsT,GAAMrR,GAAIuZ,GAAS;AAC5C,MAAI,CAAC,MAAM,QAAQxb,CAAI;AACnB,UAAM,IAAI,MAAM,qCAAqC;AACzD,MAAIsT,KAAQ,KAAKA,IAAO;AACpB,UAAM,IAAI,MAAM,6BAA6BA,CAAI,EAAE;AACvD,MAAIrR,KAAM,KAAKA,IAAK;AAChB,UAAM,IAAI,MAAM,2BAA2BA,CAAE,EAAE;AACnD,MAAIia,GAAY5I,GAAMrR,CAAE,IAAI;AACxB,UAAM,IAAI,MAAM,sCAAsCqR,CAAI,OAAOrR,CAAE,cAAcia,GAAY5I,GAAMrR,CAAE,CAAC,EAAE;AAE5G,MAAI4Z,IAAQ,GACRla,IAAM;AACV,QAAMsK,IAAO,KAAKhK,IAAK,GACjB7D,IAAM,CAAA;AACZ,aAAWvI,KAAKmK,GAAM;AAElB,QADA6a,GAAahlB,CAAC,GACVA,KAAK,KAAKyd;AACV,YAAM,IAAI,MAAM,oCAAoCzd,CAAC,SAASyd,CAAI,EAAE;AAExE,QADAuI,IAASA,KAASvI,IAAQzd,GACtB8L,IAAM2R,IAAO;AACb,YAAM,IAAI,MAAM,qCAAqC3R,CAAG,SAAS2R,CAAI,EAAE;AAE3E,SADA3R,KAAO2R,GACA3R,KAAOM,GAAIN,KAAOM;AACrB,MAAA7D,EAAI,MAAOyd,KAAUla,IAAMM,IAAOgK,OAAU,CAAC;AACjD,IAAA4P,KAAS,KAAKla,IAAM;AAAA,EACvB;AAED,MADAka,IAASA,KAAU5Z,IAAKN,IAAQsK,GAC5B,CAACuP,KAAW7Z,KAAO2R;AACnB,UAAM,IAAI,MAAM,gBAAgB;AACpC,MAAI,CAACkI,KAAWK;AACZ,UAAM,IAAI,MAAM,qBAAqBA,CAAK,EAAE;AAChD,SAAIL,KAAW7Z,IAAM,KACjBvD,EAAI,KAAKyd,MAAU,CAAC,GACjBzd;AACX;AACA,SAASge,GAAMhY,GAAK;AAChB,SAAAyW,GAAazW,CAAG,GACT;AAAA,IACH,QAAQ,CAACxF,MAAU;AACf,UAAI,EAAEA,aAAiB;AACnB,cAAM,IAAI,MAAM,yCAAyC;AAC7D,aAAOgd,GAAa,MAAM,KAAKhd,CAAK,GAAG,KAAK,GAAGwF,CAAG;AAAA,IACrD;AAAA,IACD,QAAQ,CAAC+W,MAAW;AAChB,UAAI,CAAC,MAAM,QAAQA,CAAM,KAAMA,EAAO,UAAU,OAAOA,EAAO,CAAC,KAAM;AACjE,cAAM,IAAI,MAAM,+CAA+C;AACnE,aAAO,WAAW,KAAKS,GAAaT,GAAQ/W,GAAK,KAAK,CAAC,CAAC;AAAA,IAC3D;AAAA,EACT;AACA;AACA,SAASiY,GAAOjR,GAAMkR,IAAa,IAAO;AAEtC,MADAzB,GAAazP,CAAI,GACbA,KAAQ,KAAKA,IAAO;AACpB,UAAM,IAAI,MAAM,mCAAmC;AACvD,MAAI8Q,GAAY,GAAG9Q,CAAI,IAAI,MAAM8Q,GAAY9Q,GAAM,CAAC,IAAI;AACpD,UAAM,IAAI,MAAM,wBAAwB;AAC5C,SAAO;AAAA,IACH,QAAQ,CAACxM,MAAU;AACf,UAAI,EAAEA,aAAiB;AACnB,cAAM,IAAI,MAAM,0CAA0C;AAC9D,aAAOud,GAAc,MAAM,KAAKvd,CAAK,GAAG,GAAGwM,GAAM,CAACkR,CAAU;AAAA,IAC/D;AAAA,IACD,QAAQ,CAACnB,MAAW;AAChB,UAAI,CAAC,MAAM,QAAQA,CAAM,KAAMA,EAAO,UAAU,OAAOA,EAAO,CAAC,KAAM;AACjE,cAAM,IAAI,MAAM,gDAAgD;AACpE,aAAO,WAAW,KAAKgB,GAAchB,GAAQ/P,GAAM,GAAGkR,CAAU,CAAC;AAAA,IACpE;AAAA,EACT;AACA;AACA,SAASC,GAAchoB,GAAI;AACvB,MAAI,OAAOA,KAAO;AACd,UAAM,IAAI,MAAM,qCAAqC;AACzD,SAAO,YAAawlB,GAAM;AACtB,QAAI;AACA,aAAOxlB,EAAG,MAAM,MAAMwlB,CAAI;AAAA,IAC7B,QACS;AAAA,IAAG;AAAA,EACrB;AACA;AA6BO,MAAMyC,KAAS1B,GAAMuB,GAAO,CAAC,GAAGnB,GAAS,kBAAkB,GAAGI,GAAK,EAAE,CAAC,GAChEmB,KAAS3B,GAAMuB,GAAO,CAAC,GAAGnB,GAAS,kCAAkC,GAAGM,GAAQ,CAAC,GAAGF,GAAK,EAAE,CAAC;AAChFR,GAAMuB,GAAO,CAAC,GAAGnB,GAAS,kCAAkC,GAAGM,GAAQ,CAAC,GAAGF,GAAK,EAAE,CAAC;AAC7ER,GAAMuB,GAAO,CAAC,GAAGnB,GAAS,kCAAkC,GAAGI,GAAK,EAAE,GAAGK,GAAU,CAAC/lB,MAAMA,EAAE,YAAW,EAAG,QAAQ,MAAM,GAAG,EAAE,QAAQ,SAAS,GAAG,CAAC,CAAC;AAC3K,MAAM8mB,KAAS5B,GAAMuB,GAAO,CAAC,GAAGnB,GAAS,kEAAkE,GAAGM,GAAQ,CAAC,GAAGF,GAAK,EAAE,CAAC,GAC5HqB,KAAY7B,GAAMuB,GAAO,CAAC,GAAGnB,GAAS,kEAAkE,GAAGM,GAAQ,CAAC,GAAGF,GAAK,EAAE,CAAC,GACtIsB,KAAY,CAACC,MAAQ/B,GAAMsB,GAAM,EAAE,GAAGlB,GAAS2B,CAAG,GAAGvB,GAAK,EAAE,CAAC,GACtDwB,KAASF,GAAU,4DAA4D;AAChEA,GAAU,4DAA4D;AACzEA,GAAU,4DAA4D;AAC/F,MAAMG,KAAgB,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,GACrCC,KAAY;AAAA,EACrB,OAAOhd,GAAM;AACT,QAAI5B,IAAM;AACV,aAAStD,IAAI,GAAGA,IAAIkF,EAAK,QAAQlF,KAAK,GAAG;AACrC,YAAMmiB,IAAQjd,EAAK,SAASlF,GAAGA,IAAI,CAAC;AACpC,MAAAsD,KAAO0e,GAAO,OAAOG,CAAK,EAAE,SAASF,GAAcE,EAAM,MAAM,GAAG,GAAG;AAAA,IACxE;AACD,WAAO7e;AAAA,EACV;AAAA,EACD,OAAO0B,GAAK;AACR,QAAI1B,IAAM,CAAA;AACV,aAAStD,IAAI,GAAGA,IAAIgF,EAAI,QAAQhF,KAAK,IAAI;AACrC,YAAM2S,IAAQ3N,EAAI,MAAMhF,GAAGA,IAAI,EAAE,GAC3BwG,IAAWyb,GAAc,QAAQtP,EAAM,MAAM,GAC7CwP,IAAQH,GAAO,OAAOrP,CAAK;AACjC,eAASjJ,IAAI,GAAGA,IAAIyY,EAAM,SAAS3b,GAAUkD;AACzC,YAAIyY,EAAMzY,CAAC,MAAM;AACb,gBAAM,IAAI,MAAM,0BAA0B;AAElD,MAAApG,IAAMA,EAAI,OAAO,MAAM,KAAK6e,EAAM,MAAMA,EAAM,SAAS3b,CAAQ,CAAC,CAAC;AAAA,IACpE;AACD,WAAO,WAAW,KAAKlD,CAAG;AAAA,EAC7B;AACL,GAEM8e,KAAgBpC,GAAMI,GAAS,kCAAkC,GAAGI,GAAK,EAAE,CAAC,GAC5E6B,KAAqB,CAAC,WAAY,WAAY,WAAY,YAAY,SAAU;AACtF,SAASC,GAAcC,GAAK;AACxB,QAAM9e,IAAI8e,KAAO;AACjB,MAAIC,KAAOD,IAAM,aAAc;AAC/B,WAASviB,IAAI,GAAGA,IAAIqiB,GAAmB,QAAQriB;AAC3C,KAAMyD,KAAKzD,IAAK,OAAO,MACnBwiB,KAAOH,GAAmBriB,CAAC;AAEnC,SAAOwiB;AACX;AACA,SAASC,GAAa1J,GAAQ2J,GAAOC,IAAgB,GAAG;AACpD,QAAM/b,IAAMmS,EAAO;AACnB,MAAIyJ,IAAM;AACV,WAAS,IAAI,GAAG,IAAI5b,GAAK,KAAK;AAC1B,UAAMlH,IAAIqZ,EAAO,WAAW,CAAC;AAC7B,QAAIrZ,IAAI,MAAMA,IAAI;AACd,YAAM,IAAI,MAAM,mBAAmBqZ,CAAM,GAAG;AAChD,IAAAyJ,IAAMF,GAAcE,CAAG,IAAK9iB,KAAK;AAAA,EACpC;AACD,EAAA8iB,IAAMF,GAAcE,CAAG;AACvB,WAAS,IAAI,GAAG,IAAI5b,GAAK;AACrB,IAAA4b,IAAMF,GAAcE,CAAG,IAAKzJ,EAAO,WAAW,CAAC,IAAI;AACvD,WAAS7Y,KAAKwiB;AACV,IAAAF,IAAMF,GAAcE,CAAG,IAAItiB;AAC/B,WAAS,IAAI,GAAG,IAAI,GAAG;AACnB,IAAAsiB,IAAMF,GAAcE,CAAG;AAC3B,SAAAA,KAAOG,GACAP,GAAc,OAAOf,GAAc,CAACmB,IAAM,KAAK,EAAE,GAAG,IAAI,GAAG,EAAK,CAAC;AAC5E;AACA,SAASI,GAAUC,GAAU;AACzB,QAAMC,IAAiBD,MAAa,WAAW,IAAI,WAC7CE,IAASxB,GAAO,CAAC,GACjByB,IAAYD,EAAO,QACnBE,IAAUF,EAAO,QACjBG,IAAkBzB,GAAcuB,CAAS;AAC/C,WAAS9C,EAAOnH,GAAQ2J,GAAOS,IAAQ,IAAI;AACvC,QAAI,OAAOpK,KAAW;AAClB,YAAM,IAAI,MAAM,8CAA8C,OAAOA,CAAM,EAAE;AACjF,QAAI,CAAC,MAAM,QAAQ2J,CAAK,KAAMA,EAAM,UAAU,OAAOA,EAAM,CAAC,KAAM;AAC9D,YAAM,IAAI,MAAM,uDAAuD,OAAOA,CAAK,EAAE;AACzF,UAAMU,IAAerK,EAAO,SAAS,IAAI2J,EAAM;AAC/C,QAAIS,MAAU,MAASC,IAAeD;AAClC,YAAM,IAAI,UAAU,UAAUC,CAAY,kBAAkBD,CAAK,EAAE;AACvE,WAAApK,IAASA,EAAO,eACT,GAAGA,CAAM,IAAIqJ,GAAc,OAAOM,CAAK,CAAC,GAAGD,GAAa1J,GAAQ2J,GAAOI,CAAc,CAAC;AAAA,EAChG;AACD,WAAS3C,EAAOnb,GAAKme,IAAQ,IAAI;AAC7B,QAAI,OAAOne,KAAQ;AACf,YAAM,IAAI,MAAM,6CAA6C,OAAOA,CAAG,EAAE;AAC7E,QAAIA,EAAI,SAAS,KAAMme,MAAU,MAASne,EAAI,SAASme;AACnD,YAAM,IAAI,UAAU,wBAAwBne,EAAI,MAAM,KAAKA,CAAG,mBAAmBme,CAAK,GAAG;AAC7F,UAAME,IAAUre,EAAI;AACpB,QAAIA,MAAQqe,KAAWre,MAAQA,EAAI,YAAa;AAC5C,YAAM,IAAI,MAAM,uCAAuC;AAC3D,IAAAA,IAAMqe;AACN,UAAMC,IAAWte,EAAI,YAAY,GAAG;AACpC,QAAIse,MAAa,KAAKA,MAAa;AAC/B,YAAM,IAAI,MAAM,yDAAyD;AAC7E,UAAMvK,IAAS/T,EAAI,MAAM,GAAGse,CAAQ,GAC9BP,IAAS/d,EAAI,MAAMse,IAAW,CAAC;AACrC,QAAIP,EAAO,SAAS;AAChB,YAAM,IAAI,MAAM,yCAAyC;AAC7D,UAAML,IAAQN,GAAc,OAAOW,CAAM,EAAE,MAAM,GAAG,EAAE,GAChDzd,IAAMmd,GAAa1J,GAAQ2J,GAAOI,CAAc;AACtD,QAAI,CAACC,EAAO,SAASzd,CAAG;AACpB,YAAM,IAAI,MAAM,uBAAuBN,CAAG,eAAeM,CAAG,GAAG;AACnE,WAAO,EAAE,QAAAyT,GAAQ,OAAA2J;EACpB;AACD,QAAMa,IAAe9B,GAActB,CAAM;AACzC,WAASqD,EAAcxe,GAAK;AACxB,UAAM,EAAE,QAAA+T,GAAQ,OAAA2J,EAAK,IAAKvC,EAAOnb,GAAK,EAAK;AAC3C,WAAO,EAAE,QAAA+T,GAAQ,OAAA2J,GAAO,OAAOM,EAAUN,CAAK;EACjD;AACD,SAAO,EAAE,QAAAxC,GAAQ,QAAAC,GAAQ,eAAAqD,GAAe,cAAAD,GAAc,WAAAP,GAAW,iBAAAE,GAAiB,SAAAD;AACtF;AACO,MAAMQ,KAASb,GAAU,QAAQ;AACjBA,GAAU,SAAS;AACnC,MAAMc,KAAO;AAAA,EAChB,QAAQ,CAACxe,MAAS,IAAI,YAAW,EAAG,OAAOA,CAAI;AAAA,EAC/C,QAAQ,CAACF,MAAQ,IAAI,YAAW,EAAG,OAAOA,CAAG;AACjD,GACaoE,KAAM4W,GAAMuB,GAAO,CAAC,GAAGnB,GAAS,kBAAkB,GAAGI,GAAK,EAAE,GAAGK,GAAU,CAAC/lB,MAAM;AACzF,MAAI,OAAOA,KAAM,YAAYA,EAAE,SAAS;AACpC,UAAM,IAAI,UAAU,oCAAoC,OAAOA,CAAC,gBAAgBA,EAAE,MAAM,EAAE;AAC9F,SAAOA,EAAE;AACb,CAAC,CAAC,GACI6oB,KAAS;AAAA,EACX,MAAAD;AAAA,EAAM,KAAAta;AAAA,EAAK,QAAAsY;AAAA,EAAQ,QAAAC;AAAA,EAAQ,QAAAC;AAAA,EAAQ,WAAAC;AAAA,EAAWG,QAAAA;AAAAA,EAAQ,WAAAE;AAC1D;AACkE,UAAO,KAAKyB,EAAM,EAAE,KAAK,IAAI,ClBzX/F;AmBAA,SAAS9f,GAAO,GAAG;AACf,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAChC,UAAM,IAAI,MAAM,kCAAkC,CAAC,EAAE;AAC7D;AACA,SAAS+b,GAAKnc,GAAG;AACb,MAAI,OAAOA,KAAM;AACb,UAAM,IAAI,MAAM,yBAAyBA,CAAC,EAAE;AACpD;AACO,SAASmgB,GAAQnf,GAAG;AACvB,SAAQA,aAAa,cAChBA,KAAK,QAAQ,OAAOA,KAAM,YAAYA,EAAE,YAAY,SAAS;AACtE;AACA,SAASX,GAAML,MAAMM,GAAS;AAC1B,MAAI,CAAC6f,GAAQngB,CAAC;AACV,UAAM,IAAI,MAAM,qBAAqB;AACzC,MAAIM,EAAQ,SAAS,KAAK,CAACA,EAAQ,SAASN,EAAE,MAAM;AAChD,UAAM,IAAI,MAAM,iCAAiCM,CAAO,mBAAmBN,EAAE,MAAM,EAAE;AAC7F;ACjBA;AAKO,MAAMogB,KAAM,CAACpjB,MAAQ,IAAI,YAAYA,EAAI,QAAQA,EAAI,YAAY,KAAK,MAAMA,EAAI,aAAa,CAAC,CAAC,GAKzFqE,KAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAChF,IAAI,CAACA;AACD,QAAM,IAAI,MAAM,6CAA6C;AA4H1D,SAASgf,GAAUC,GAAUzV,GAAM;AACtC,MAAIA,KAAQ,QAAQ,OAAOA,KAAS;AAChC,UAAM,IAAI,MAAM,yBAAyB;AAE7C,SADe,OAAO,OAAOyV,GAAUzV,CAAI;AAE/C;AAEO,SAAShE,GAAW7F,GAAGhB,GAAG;AAC7B,MAAIgB,EAAE,WAAWhB,EAAE;AACf,WAAO;AACX,MAAIugB,IAAO;AACX,WAAShkB,IAAI,GAAGA,IAAIyE,EAAE,QAAQzE;AAC1B,IAAAgkB,KAAQvf,EAAEzE,CAAC,IAAIyD,EAAEzD,CAAC;AACtB,SAAOgkB,MAAS;AACpB;AAOO,MAAMC,gCAAa,CAACC,GAAQxkB,OAC/B,OAAO,OAAOA,GAAGwkB,CAAM,GAChBxkB,IC9ILykB,KAAa,IAGbC,KAAO;AAEb,SAASC,GAAK,GAAG;AACb,SAAQ,KAAK,IAAMD,KAAO,EAAE,KAAK;AACrC;AACA,SAAS1N,GAAIjS,GAAGhB,GAAG;AACf,MAAIH,IAAM;AACV,SAAOG,IAAI,GAAGA,MAAM;AAEhB,IAAAH,KAAOmB,IAAI,EAAEhB,IAAI,IACjBgB,IAAI4f,GAAK5f,CAAC;AAEd,SAAOnB;AACX;AAGA,MAAMghB,KAAwB,uBAAM;AAChC,MAAIniB,IAAI,IAAI,WAAW,GAAG;AAC1B,WAASnC,IAAI,GAAG4M,IAAI,GAAG5M,IAAI,KAAKA,KAAK4M,KAAKyX,GAAKzX,CAAC;AAC5C,IAAAzK,EAAEnC,CAAC,IAAI4M;AACX,QAAM2X,IAAM,IAAI,WAAW,GAAG;AAC9B,EAAAA,EAAI,CAAC,IAAI;AACT,WAASvkB,IAAI,GAAGA,IAAI,KAAKA,KAAK;AAC1B,QAAI4M,IAAIzK,EAAE,MAAMnC,CAAC;AACjB,IAAA4M,KAAKA,KAAK,GACV2X,EAAIpiB,EAAEnC,CAAC,CAAC,KAAK4M,IAAKA,KAAK,IAAMA,KAAK,IAAMA,KAAK,IAAMA,KAAK,IAAK,MAAQ;AAAA,EACxE;AACD,SAAO2X;AACX,MAEMC,KAA0B,gBAAAF,GAAK,IAAI,CAACxqB,GAAG4P,MAAM4a,GAAK,QAAQ5a,CAAC,CAAC,GAE5D+a,KAAW,CAAC,MAAO,KAAK,KAAO,MAAM,GACrCC,KAAW,CAAC,MAAO,KAAK,IAAM,MAAM;AAK1C,SAASC,GAAUL,GAAM7qB,GAAI;AACzB,MAAI6qB,EAAK,WAAW;AAChB,UAAM,IAAI,MAAM,mBAAmB;AACvC,QAAMM,IAAK,IAAI,YAAY,GAAG,EAAE,IAAI,CAAC9qB,GAAG4P,MAAMjQ,EAAG6qB,EAAK5a,CAAC,CAAC,CAAC,GACnDf,IAAKic,EAAG,IAAIF,EAAQ,GACpB9b,IAAKD,EAAG,IAAI+b,EAAQ,GACpBG,IAAKjc,EAAG,IAAI8b,EAAQ,GACpBI,IAAM,IAAI,YAAY,MAAM,GAAG,GAC/BC,IAAM,IAAI,YAAY,MAAM,GAAG,GAC/BC,IAAQ,IAAI,YAAY,MAAM,GAAG;AACvC,WAAShlB,IAAI,GAAGA,IAAI,KAAKA;AACrB,aAAS0J,IAAI,GAAGA,IAAI,KAAKA,KAAK;AAC1B,YAAMub,IAAMjlB,IAAI,MAAM0J;AACtB,MAAAob,EAAIG,CAAG,IAAIL,EAAG5kB,CAAC,IAAI2I,EAAGe,CAAC,GACvBqb,EAAIE,CAAG,IAAIrc,EAAG5I,CAAC,IAAI6kB,EAAGnb,CAAC,GACvBsb,EAAMC,CAAG,IAAKX,EAAKtkB,CAAC,KAAK,IAAKskB,EAAK5a,CAAC;AAAA,IACvC;AAEL,SAAO,EAAE,MAAA4a,GAAM,OAAAU,GAAO,IAAAJ,GAAI,IAAAjc,GAAI,IAAAC,GAAI,IAAAic,GAAI,KAAAC,GAAK,KAAAC;AAC/C;AACA,MAAMG,KAAgC,gBAAAP,GAAUL,IAAM,CAACxpB,MAAO4b,GAAI5b,GAAG,CAAC,KAAK,KAAOA,KAAK,KAAOA,KAAK,IAAK4b,GAAI5b,GAAG,CAAC,CAAC,GAC3GqqB,KAAgC,gBAAAR,GAAUH,IAAS,CAAC1pB,MAAO4b,GAAI5b,GAAG,EAAE,KAAK,KAAO4b,GAAI5b,GAAG,EAAE,KAAK,KAAO4b,GAAI5b,GAAG,CAAC,KAAK,IAAK4b,GAAI5b,GAAG,EAAE,CAAC,GACjIsqB,KAA2B,uBAAM;AACnC,QAAMzlB,IAAI,IAAI,WAAW,EAAE;AAC3B,WAASK,IAAI,GAAG4M,IAAI,GAAG5M,IAAI,IAAIA,KAAK4M,IAAIyX,GAAKzX,CAAC;AAC1C,IAAAjN,EAAEK,CAAC,IAAI4M;AACX,SAAOjN;AACX;AACO,SAAS0lB,GAAYtlB,GAAK;AAC7BulB,EAAAA,GAAOvlB,CAAG;AACV,QAAM6G,IAAM7G,EAAI;AAChB,MAAI,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,SAAS6G,CAAG;AAC1B,UAAM,IAAI,MAAM,qDAAqDA,CAAG,EAAE;AAC9E,QAAM,EAAE,OAAAoe,EAAO,IAAGE,IACZK,IAAM1B,GAAI9jB,CAAG,GACbylB,IAAKD,EAAI,QACTE,IAAU,CAAC1qB,MAAM2qB,GAAUV,GAAOjqB,GAAGA,GAAGA,GAAGA,CAAC,GAC5C4qB,IAAK,IAAI,YAAY/e,IAAM,EAAE;AACnC,EAAA+e,EAAG,IAAIJ,CAAG;AAEV,WAASvlB,IAAIwlB,GAAIxlB,IAAI2lB,EAAG,QAAQ3lB,KAAK;AACjC,QAAImC,IAAIwjB,EAAG3lB,IAAI,CAAC;AAChB,IAAIA,IAAIwlB,MAAO,IACXrjB,IAAIsjB,EAAQhB,GAAStiB,CAAC,CAAC,IAAIijB,GAAQplB,IAAIwlB,IAAK,CAAC,IACxCA,IAAK,KAAKxlB,IAAIwlB,MAAO,MAC1BrjB,IAAIsjB,EAAQtjB,CAAC,IACjBwjB,EAAG3lB,CAAC,IAAI2lB,EAAG3lB,IAAIwlB,CAAE,IAAIrjB;AAAA,EACxB;AACD,SAAOwjB;AACX;AACO,SAASC,GAAe7lB,GAAK;AAChC,QAAM8lB,IAASR,GAAYtlB,CAAG,GACxB4lB,IAAKE,EAAO,SACZL,IAAKK,EAAO,QACZ,EAAE,OAAAb,EAAO,IAAGE,IACZ,EAAE,IAAAN,GAAI,IAAAjc,GAAI,IAAAC,GAAI,IAAAic,EAAE,IAAKM;AAE3B,WAASnlB,IAAI,GAAGA,IAAIwlB,GAAIxlB,KAAK;AACzB,aAAS0J,IAAI,GAAGA,IAAI,GAAGA;AACnB,MAAAic,EAAG3lB,IAAI0J,CAAC,IAAImc,EAAOL,IAAKxlB,IAAI,IAAI0J,CAAC;AAEzC,EAAAmc,EAAO,KAAK,CAAC;AAEb,WAAS7lB,IAAI,GAAGA,IAAIwlB,IAAK,GAAGxlB,KAAK;AAC7B,UAAM4M,IAAI+Y,EAAG3lB,CAAC,GACR8lB,IAAIJ,GAAUV,GAAOpY,GAAGA,GAAGA,GAAGA,CAAC;AACrC,IAAA+Y,EAAG3lB,CAAC,IAAI4kB,EAAGkB,IAAI,GAAI,IAAInd,EAAImd,MAAM,IAAK,GAAI,IAAIld,EAAIkd,MAAM,KAAM,GAAI,IAAIjB,EAAGiB,MAAM,EAAE;AAAA,EACpF;AACD,SAAOH;AACX;AAEA,SAASI,GAAUjB,GAAKC,GAAKvc,GAAIC,GAAIud,GAAIC,GAAI;AACzC,SAAQnB,EAAMtc,KAAM,IAAK,QAAYC,MAAO,IAAK,GAAK,IAClDsc,EAAMiB,MAAO,IAAK,QAAYC,MAAO,KAAM,GAAK;AACxD;AACA,SAASP,GAAUV,GAAOxc,GAAIC,GAAIud,GAAIC,GAAI;AACtC,SAAQjB,EAAOxc,IAAK,MAASC,IAAK,KAAO,IACpCuc,EAAQgB,MAAO,KAAM,MAAUC,MAAO,KAAM,KAAO,KAAK;AACjE;AACA,SAASC,GAAQP,GAAInd,GAAIC,GAAIud,GAAIC,GAAI;AACjC,QAAM,EAAE,OAAAjB,GAAO,KAAAF,GAAK,KAAAC,EAAG,IAAKG;AAC5B,MAAItlB,IAAI;AACR,EAAC4I,KAAMmd,EAAG/lB,GAAG,GAAK6I,KAAMkd,EAAG/lB,GAAG,GAAKomB,KAAML,EAAG/lB,GAAG,GAAKqmB,KAAMN,EAAG/lB,GAAG;AAChE,QAAMumB,IAASR,EAAG,SAAS,IAAI;AAC/B,WAAS3lB,IAAI,GAAGA,IAAImmB,GAAQnmB,KAAK;AAC7B,UAAMyV,IAAKkQ,EAAG/lB,GAAG,IAAImmB,GAAUjB,GAAKC,GAAKvc,GAAIC,GAAIud,GAAIC,CAAE,GACjDvQ,IAAKiQ,EAAG/lB,GAAG,IAAImmB,GAAUjB,GAAKC,GAAKtc,GAAIud,GAAIC,GAAIzd,CAAE,GACjDoF,IAAK+X,EAAG/lB,GAAG,IAAImmB,GAAUjB,GAAKC,GAAKiB,GAAIC,GAAIzd,GAAIC,CAAE,GACjDkN,IAAKgQ,EAAG/lB,GAAG,IAAImmB,GAAUjB,GAAKC,GAAKkB,GAAIzd,GAAIC,GAAIud,CAAE;AACvD,IAACxd,IAAKiN,GAAMhN,IAAKiN,GAAMsQ,IAAKpY,GAAMqY,IAAKtQ;AAAA,EAC1C;AAED,QAAMF,IAAKkQ,EAAG/lB,GAAG,IAAI8lB,GAAUV,GAAOxc,GAAIC,GAAIud,GAAIC,CAAE,GAC9CvQ,IAAKiQ,EAAG/lB,GAAG,IAAI8lB,GAAUV,GAAOvc,GAAIud,GAAIC,GAAIzd,CAAE,GAC9CoF,IAAK+X,EAAG/lB,GAAG,IAAI8lB,GAAUV,GAAOgB,GAAIC,GAAIzd,GAAIC,CAAE,GAC9CkN,IAAKgQ,EAAG/lB,GAAG,IAAI8lB,GAAUV,GAAOiB,GAAIzd,GAAIC,GAAIud,CAAE;AACpD,SAAO,EAAE,IAAIvQ,GAAI,IAAIC,GAAI,IAAI9H,GAAI,IAAI+H;AACzC;AACA,SAASyQ,GAAQT,GAAInd,GAAIC,GAAIud,GAAIC,GAAI;AACjC,QAAM,EAAE,OAAAjB,GAAO,KAAAF,GAAK,KAAAC,EAAG,IAAKI;AAC5B,MAAIvlB,IAAI;AACR,EAAC4I,KAAMmd,EAAG/lB,GAAG,GAAK6I,KAAMkd,EAAG/lB,GAAG,GAAKomB,KAAML,EAAG/lB,GAAG,GAAKqmB,KAAMN,EAAG/lB,GAAG;AAChE,QAAMumB,IAASR,EAAG,SAAS,IAAI;AAC/B,WAAS3lB,IAAI,GAAGA,IAAImmB,GAAQnmB,KAAK;AAC7B,UAAMyV,IAAKkQ,EAAG/lB,GAAG,IAAImmB,GAAUjB,GAAKC,GAAKvc,GAAIyd,GAAID,GAAIvd,CAAE,GACjDiN,IAAKiQ,EAAG/lB,GAAG,IAAImmB,GAAUjB,GAAKC,GAAKtc,GAAID,GAAIyd,GAAID,CAAE,GACjDpY,IAAK+X,EAAG/lB,GAAG,IAAImmB,GAAUjB,GAAKC,GAAKiB,GAAIvd,GAAID,GAAIyd,CAAE,GACjDtQ,IAAKgQ,EAAG/lB,GAAG,IAAImmB,GAAUjB,GAAKC,GAAKkB,GAAID,GAAIvd,GAAID,CAAE;AACvD,IAACA,IAAKiN,GAAMhN,IAAKiN,GAAMsQ,IAAKpY,GAAMqY,IAAKtQ;AAAA,EAC1C;AAED,QAAMF,IAAKkQ,EAAG/lB,GAAG,IAAI8lB,GAAUV,GAAOxc,GAAIyd,GAAID,GAAIvd,CAAE,GAC9CiN,IAAKiQ,EAAG/lB,GAAG,IAAI8lB,GAAUV,GAAOvc,GAAID,GAAIyd,GAAID,CAAE,GAC9CpY,IAAK+X,EAAG/lB,GAAG,IAAI8lB,GAAUV,GAAOgB,GAAIvd,GAAID,GAAIyd,CAAE,GAC9CtQ,IAAKgQ,EAAG/lB,GAAG,IAAI8lB,GAAUV,GAAOiB,GAAID,GAAIvd,GAAID,CAAE;AACpD,SAAO,EAAE,IAAIiN,GAAI,IAAIC,GAAI,IAAI9H,GAAI,IAAI+H;AACzC;AACA,SAAS0Q,GAAOzf,GAAK0f,GAAK;AACtB,MAAI,CAACA;AACD,WAAO,IAAI,WAAW1f,CAAG;AAE7B,MADA0e,GAAOgB,CAAG,GACNA,EAAI,SAAS1f;AACb,UAAM,IAAI,MAAM,oDAAoDA,CAAG,UAAU0f,EAAI,MAAM,EAAE;AACjG,SAAOA;AACX;AAgGA,SAASC,GAAqBrhB,GAAM;AAEhC,MADAogB,GAAOpgB,CAAI,GACPA,EAAK,SAASif,OAAe;AAC7B,UAAM,IAAI,MAAM,uEAAuEA,EAAU,EAAE;AAE3G;AACA,SAASqC,GAAqBC,GAAWC,GAAOJ,GAAK;AACjD,MAAIrf,IAASwf,EAAU;AACvB,QAAME,IAAY1f,IAASkd;AAC3B,MAAI,CAACuC,KAASC,MAAc;AACxB,UAAM,IAAI,MAAM,yDAAyD;AAC7E,QAAMljB,IAAIogB,GAAI4C,CAAS;AACvB,MAAIC,GAAO;AACP,QAAI/R,IAAOwP,KAAawC;AACxB,IAAKhS,MACDA,IAAOwP,KACXld,IAASA,IAAS0N;AAAA,EACrB;AACD,QAAMtQ,IAAMgiB,GAAOpf,GAAQqf,CAAG,GACxBM,IAAI/C,GAAIxf,CAAG;AACjB,SAAO,EAAE,GAAAZ,GAAG,GAAAmjB,GAAG,KAAAviB;AACnB;AACA,SAASwiB,GAAa3hB,GAAMwhB,GAAO;AAC/B,MAAI,CAACA;AACD,WAAOxhB;AACX,QAAM0B,IAAM1B,EAAK;AACjB,MAAI,CAAC0B;AACD,UAAM,IAAI,MAAM,yCAAyC;AAC7D,QAAMkgB,IAAW5hB,EAAK0B,IAAM,CAAC;AAC7B,MAAIkgB,KAAY,KAAKA,IAAW;AAC5B,UAAM,IAAI,MAAM,kCAAkCA,CAAQ,EAAE;AAChE,QAAMziB,IAAMa,EAAK,SAAS,GAAG,CAAC4hB,CAAQ;AACtC,WAAS,IAAI,GAAG,IAAIA,GAAU;AAC1B,QAAI5hB,EAAK0B,IAAM,IAAI,CAAC,MAAMkgB;AACtB,YAAM,IAAI,MAAM,0BAA0B;AAClD,SAAOziB;AACX;AACA,SAAS0iB,GAAQpS,GAAM;AACnB,QAAM/O,IAAM,IAAI,WAAW,EAAE,GACvBohB,IAAQnD,GAAIje,CAAG;AACrB,EAAAA,EAAI,IAAI+O,CAAI;AACZ,QAAMsS,IAAc9C,KAAaxP,EAAK;AACtC,WAAS3U,IAAImkB,KAAa8C,GAAajnB,IAAImkB,IAAYnkB;AACnD,IAAA4F,EAAI5F,CAAC,IAAIinB;AACb,SAAOD;AACX;AA6CO,MAAME,KAAM,gBAAAjD,GAAW,EAAE,WAAW,IAAI,aAAa,MAAM,SAAalkB,GAAKonB,GAAI7Y,IAAO,CAAA,GAAI;AAC/FgX,EAAAA,GAAOvlB,CAAG,GACVulB,GAAO6B,GAAI,EAAE;AACb,QAAMT,IAAQ,CAACpY,EAAK;AACpB,SAAO;AAAA,IACH,SAAS,CAACmY,GAAWH,MAAQ;AACzB,YAAMX,IAAKN,GAAYtlB,CAAG,GACpB,EAAE,GAAA0D,GAAG,GAAAmjB,GAAG,KAAKQ,MAASZ,GAAqBC,GAAWC,GAAOJ,CAAG,GAChEe,IAAMxD,GAAIsD,CAAE;AAElB,UAAI3e,IAAK6e,EAAI,CAAC,GAAG5e,IAAK4e,EAAI,CAAC,GAAGrB,IAAKqB,EAAI,CAAC,GAAGpB,IAAKoB,EAAI,CAAC,GACjDrnB,IAAI;AACR,aAAOA,IAAI,KAAKyD,EAAE;AACd,QAAC+E,KAAM/E,EAAEzD,IAAI,CAAC,GAAKyI,KAAMhF,EAAEzD,IAAI,CAAC,GAAKgmB,KAAMviB,EAAEzD,IAAI,CAAC,GAAKimB,KAAMxiB,EAAEzD,IAAI,CAAC,GACnE,EAAE,IAAAwI,GAAI,IAAAC,GAAI,IAAAud,GAAI,IAAAC,EAAI,IAAGC,GAAQP,GAAInd,GAAIC,GAAIud,GAAIC,CAAE,GAC/CW,EAAE5mB,GAAG,IAAIwI,GAAMoe,EAAE5mB,GAAG,IAAIyI,GAAMme,EAAE5mB,GAAG,IAAIgmB,GAAMY,EAAE5mB,GAAG,IAAIimB;AAE3D,UAAIS,GAAO;AACP,cAAMM,IAAQD,GAAQN,EAAU,SAASzmB,IAAI,CAAC,CAAC;AAC/C,QAACwI,KAAMwe,EAAM,CAAC,GAAKve,KAAMue,EAAM,CAAC,GAAKhB,KAAMgB,EAAM,CAAC,GAAKf,KAAMe,EAAM,CAAC,GACnE,EAAE,IAAAxe,GAAI,IAAAC,GAAI,IAAAud,GAAI,IAAAC,EAAI,IAAGC,GAAQP,GAAInd,GAAIC,GAAIud,GAAIC,CAAE,GAC/CW,EAAE5mB,GAAG,IAAIwI,GAAMoe,EAAE5mB,GAAG,IAAIyI,GAAMme,EAAE5mB,GAAG,IAAIgmB,GAAMY,EAAE5mB,GAAG,IAAIimB;AAAA,MAC1D;AACD,aAAAN,EAAG,KAAK,CAAC,GACFyB;AAAA,IACV;AAAA,IACD,SAAS,CAACE,GAAYhB,MAAQ;AAC1B,MAAAC,GAAqBe,CAAU;AAC/B,YAAM3B,IAAKC,GAAe7lB,CAAG,GACvBsnB,IAAMxD,GAAIsD,CAAE,GACZ9iB,IAAMgiB,GAAOiB,EAAW,QAAQhB,CAAG,GACnC7iB,IAAIogB,GAAIyD,CAAU,GAClBV,IAAI/C,GAAIxf,CAAG;AAEjB,UAAImE,IAAK6e,EAAI,CAAC,GAAG5e,IAAK4e,EAAI,CAAC,GAAGrB,IAAKqB,EAAI,CAAC,GAAGpB,IAAKoB,EAAI,CAAC;AACrD,eAASrnB,IAAI,GAAGA,IAAI,KAAKyD,EAAE,UAAS;AAEhC,cAAM8jB,IAAM/e,GAAIgf,IAAM/e,GAAIgf,IAAMzB,GAAI0B,IAAMzB;AAC1C,QAACzd,IAAK/E,EAAEzD,IAAI,CAAC,GAAKyI,IAAKhF,EAAEzD,IAAI,CAAC,GAAKgmB,IAAKviB,EAAEzD,IAAI,CAAC,GAAKimB,IAAKxiB,EAAEzD,IAAI,CAAC;AAChE,cAAM,EAAE,IAAI2nB,GAAI,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG1B,GAAQT,GAAInd,GAAIC,GAAIud,GAAIC,CAAE;AACrE,QAACW,EAAE5mB,GAAG,IAAI2nB,IAAKJ,GAAOX,EAAE5mB,GAAG,IAAI4nB,IAAKJ,GAAOZ,EAAE5mB,GAAG,IAAI6nB,IAAKJ,GAAOb,EAAE5mB,GAAG,IAAI8nB,IAAKJ;AAAA,MACjF;AACD,aAAA/B,EAAG,KAAK,CAAC,GACFkB,GAAaxiB,GAAKqiB,CAAK;AAAA,IACjC;AAAA,EACT;AACA,CAAC,GCvXKqB,KAAe,CAAC/iB,MAAQ,WAAW,KAAKA,EAAI,MAAM,EAAE,EAAE,IAAI,CAACtF,MAAMA,EAAE,WAAW,CAAC,CAAC,CAAC,GACjFsoB,KAAUD,GAAa,kBAAkB,GACzCE,KAAUF,GAAa,kBAAkB,GACzCG,KAAarE,GAAImE,EAAO,GACxBG,KAAatE,GAAIoE,EAAO;AACTE,GAAW,MAAQ;AACjC,SAASC,GAAK3jB,GAAGhB,GAAG;AACvB,SAAQgB,KAAKhB,IAAMgB,MAAO,KAAKhB;AACnC;AAEA,SAAS4kB,GAAY5kB,GAAG;AACpB,SAAOA,EAAE,aAAa,MAAM;AAChC;AAEA,MAAM6kB,KAAY,IACZC,KAAc,IAGdC,KAAc,KAAK,KAAK,GACxBC,KAAY,IAAI;AACtB,SAASC,GAAUC,GAAMC,GAAO7oB,GAAK8oB,GAAO3jB,GAAMd,GAAQ0kB,GAAS3C,GAAQ;AACvE,QAAMvf,IAAM1B,EAAK,QACXid,IAAQ,IAAI,WAAWmG,EAAS,GAChCS,IAAMlF,GAAI1B,CAAK,GAEf6G,IAAYX,GAAYnjB,CAAI,KAAKmjB,GAAYjkB,CAAM,GACnD6kB,IAAMD,IAAYnF,GAAI3e,CAAI,IAAIujB,IAC9BS,IAAMF,IAAYnF,GAAIzf,CAAM,IAAIqkB;AACtC,WAAS5hB,IAAM,GAAGA,IAAMD,GAAKkiB,KAAW;AAEpC,QADAH,EAAKC,GAAO7oB,GAAK8oB,GAAOE,GAAKD,GAAS3C,CAAM,GACxC2C,KAAWN;AACX,YAAM,IAAI,MAAM,uBAAuB;AAC3C,UAAM1hB,IAAO,KAAK,IAAIwhB,IAAW1hB,IAAMC,CAAG;AAE1C,QAAImiB,KAAaliB,MAASwhB,IAAW;AACjC,YAAMa,IAAQtiB,IAAM;AACpB,UAAIA,IAAM,MAAM;AACZ,cAAM,IAAI,MAAM,6BAA6B;AACjD,eAAS6C,IAAI,GAAG0f,GAAM1f,IAAI6e,IAAa7e;AACnC,QAAA0f,IAAOD,IAAQzf,GACfwf,EAAIE,CAAI,IAAIH,EAAIG,CAAI,IAAIL,EAAIrf,CAAC;AAEjC,MAAA7C,KAAOyhB;AACP;AAAA,IACH;AACD,aAAS5e,IAAI,GAAG0f,GAAM1f,IAAI5C,GAAM4C;AAC5B,MAAA0f,IAAOviB,IAAM6C,GACbtF,EAAOglB,CAAI,IAAIlkB,EAAKkkB,CAAI,IAAIjH,EAAMzY,CAAC;AAEvC,IAAA7C,KAAOC;AAAA,EACV;AACL;AACO,SAASuiB,GAAaV,GAAMra,GAAM;AACrC,QAAM,EAAE,gBAAAgb,GAAgB,eAAAC,GAAe,eAAAC,GAAe,cAAAC,GAAc,QAAAtD,EAAM,IAAKrC,GAAU,EAAE,gBAAgB,IAAO,eAAe,GAAG,cAAc,IAAO,QAAQ,GAAE,GAAIxV,CAAI;AAC3K,MAAI,OAAOqa,KAAS;AAChB,UAAM,IAAI,MAAM,yBAAyB;AAC7Ce,SAAAA,GAAQF,CAAa,GACrBE,GAAQvD,CAAM,GACdwD,GAAMF,CAAY,GAClBE,GAAML,CAAc,GACb,CAACvpB,GAAK8oB,GAAO3jB,GAAMd,GAAQ0kB,IAAU,MAAM;AAC9CxD,IAAAA,GAAOvlB,CAAG,GACVulB,GAAOuD,CAAK,GACZvD,GAAOpgB,CAAI;AACX,UAAM0B,IAAM1B,EAAK;AAKjB,QAJKd,MACDA,IAAS,IAAI,WAAWwC,CAAG,IAC/B0e,GAAOlhB,CAAM,GACbslB,GAAQZ,CAAO,GACXA,IAAU,KAAKA,KAAWN;AAC1B,YAAM,IAAI,MAAM,uBAAuB;AAC3C,QAAIpkB,EAAO,SAASwC;AAChB,YAAM,IAAI,MAAM,gBAAgBxC,EAAO,MAAM,2BAA2BwC,CAAG,GAAG;AAClF,UAAMgjB,IAAU,CAAA;AAIhB,QAAIrX,IAAIxS,EAAI,QAAQH,GAAGgpB;AACvB,QAAIrW,MAAM;AACN,MAAA3S,IAAIG,EAAI,SACR6pB,EAAQ,KAAKhqB,CAAC,GACdgpB,IAAQT;AAAA,aAEH5V,MAAM,MAAM+W;AACjB,MAAA1pB,IAAI,IAAI,WAAW,EAAE,GACrBA,EAAE,IAAIG,CAAG,GACTH,EAAE,IAAIG,GAAK,EAAE,GACb6oB,IAAQV,IACR0B,EAAQ,KAAKhqB,CAAC;AAAA;AAGd,YAAM,IAAI,MAAM,wCAAwC2S,CAAC,EAAE;AAS/D,IAAK8V,GAAYQ,CAAK,MAClBA,IAAQA,EAAM,SACde,EAAQ,KAAKf,CAAK;AAEtB,UAAMtD,IAAM1B,GAAIjkB,CAAC;AAEjB,QAAI2pB,GAAe;AACf,UAAIV,EAAM,WAAW;AACjB,cAAM,IAAI,MAAM,sCAAsC;AAC1D,MAAAU,EAAcX,GAAOrD,GAAK1B,GAAIgF,EAAM,SAAS,GAAG,EAAE,CAAC,GAAGtD,CAAG,GACzDsD,IAAQA,EAAM,SAAS,EAAE;AAAA,IAC5B;AAED,UAAMgB,IAAa,KAAKL;AACxB,QAAIK,MAAehB,EAAM;AACrB,YAAM,IAAI,MAAM,sBAAsBgB,CAAU,cAAc;AAElE,QAAIA,MAAe,IAAI;AACnB,YAAMC,IAAK,IAAI,WAAW,EAAE;AAC5B,MAAAA,EAAG,IAAIjB,GAAOY,IAAe,IAAI,KAAKZ,EAAM,MAAM,GAClDA,IAAQiB,GACRF,EAAQ,KAAKf,CAAK;AAAA,IACrB;AACD,UAAMxB,IAAMxD,GAAIgF,CAAK;AAErB,SADAH,GAAUC,GAAMC,GAAOrD,GAAK8B,GAAKniB,GAAMd,GAAQ0kB,GAAS3C,CAAM,GACvDyD,EAAQ,SAAS;AACpB,MAAAA,EAAQ,IAAG,EAAG,KAAK,CAAC;AACxB,WAAOxlB;AAAA,EACf;AACA;AC5JA,SAAS2lB,GAAWjvB,GAAG8E,GAAG7E,GAAGsJ,GAAK2lB,GAAK7D,IAAS,IAAI;AAChD,MAAI8D,IAAMnvB,EAAE,CAAC,GAAGovB,IAAMpvB,EAAE,CAAC,GAAGqvB,IAAMrvB,EAAE,CAAC,GAAGsvB,IAAMtvB,EAAE,CAAC,GACjDuvB,IAAMzqB,EAAE,CAAC,GAAG0qB,IAAM1qB,EAAE,CAAC,GAAG2qB,IAAM3qB,EAAE,CAAC,GAAG4qB,IAAM5qB,EAAE,CAAC,GAC7C6qB,IAAM7qB,EAAE,CAAC,GAAG8qB,IAAM9qB,EAAE,CAAC,GAAG+qB,IAAM/qB,EAAE,CAAC,GAAGgrB,IAAMhrB,EAAE,CAAC,GAC7CirB,IAAMb,GAAKc,IAAM/vB,EAAE,CAAC,GAAGgwB,IAAMhwB,EAAE,CAAC,GAAGiwB,IAAMjwB,EAAE,CAAC,GAExCkwB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB,GAAKiB,IAAMhB;AAC/K,WAAS3lB,KAAI,GAAGA,KAAI8gB,GAAQ9gB,MAAK;AAC7B,IAAA4lB,IAAOA,IAAMI,IAAO,GACpBQ,IAAMzD,GAAKyD,IAAMZ,GAAK,EAAE,GACxBQ,IAAOA,IAAMI,IAAO,GACpBR,IAAMjD,GAAKiD,IAAMI,GAAK,EAAE,GACxBR,IAAOA,IAAMI,IAAO,GACpBQ,IAAMzD,GAAKyD,IAAMZ,GAAK,CAAC,GACvBQ,IAAOA,IAAMI,IAAO,GACpBR,IAAMjD,GAAKiD,IAAMI,GAAK,CAAC,GACvBP,IAAOA,IAAMI,IAAO,GACpBQ,IAAM1D,GAAK0D,IAAMZ,GAAK,EAAE,GACxBQ,IAAOA,IAAMI,IAAO,GACpBR,IAAMlD,GAAKkD,IAAMI,GAAK,EAAE,GACxBR,IAAOA,IAAMI,IAAO,GACpBQ,IAAM1D,GAAK0D,IAAMZ,GAAK,CAAC,GACvBQ,IAAOA,IAAMI,IAAO,GACpBR,IAAMlD,GAAKkD,IAAMI,GAAK,CAAC,GACvBP,IAAOA,IAAMI,IAAO,GACpBQ,IAAM3D,GAAK2D,IAAMZ,GAAK,EAAE,GACxBQ,IAAOA,IAAMI,IAAO,GACpBR,IAAMnD,GAAKmD,IAAMI,GAAK,EAAE,GACxBR,IAAOA,IAAMI,IAAO,GACpBQ,IAAM3D,GAAK2D,IAAMZ,GAAK,CAAC,GACvBQ,IAAOA,IAAMI,IAAO,GACpBR,IAAMnD,GAAKmD,IAAMI,GAAK,CAAC,GACvBP,IAAOA,IAAMI,IAAO,GACpBQ,IAAM5D,GAAK4D,IAAMZ,GAAK,EAAE,GACxBQ,IAAOA,IAAMI,IAAO,GACpBR,IAAMpD,GAAKoD,IAAMI,GAAK,EAAE,GACxBR,IAAOA,IAAMI,IAAO,GACpBQ,IAAM5D,GAAK4D,IAAMZ,GAAK,CAAC,GACvBQ,IAAOA,IAAMI,IAAO,GACpBR,IAAMpD,GAAKoD,IAAMI,GAAK,CAAC,GACvBX,IAAOA,IAAMK,IAAO,GACpBU,IAAM5D,GAAK4D,IAAMf,GAAK,EAAE,GACxBU,IAAOA,IAAMK,IAAO,GACpBV,IAAMlD,GAAKkD,IAAMK,GAAK,EAAE,GACxBV,IAAOA,IAAMK,IAAO,GACpBU,IAAM5D,GAAK4D,IAAMf,GAAK,CAAC,GACvBU,IAAOA,IAAMK,IAAO,GACpBV,IAAMlD,GAAKkD,IAAMK,GAAK,CAAC,GACvBT,IAAOA,IAAMK,IAAO,GACpBM,IAAMzD,GAAKyD,IAAMX,GAAK,EAAE,GACxBU,IAAOA,IAAMC,IAAO,GACpBN,IAAMnD,GAAKmD,IAAMK,GAAK,EAAE,GACxBV,IAAOA,IAAMK,IAAO,GACpBM,IAAMzD,GAAKyD,IAAMX,GAAK,CAAC,GACvBU,IAAOA,IAAMC,IAAO,GACpBN,IAAMnD,GAAKmD,IAAMK,GAAK,CAAC,GACvBT,IAAOA,IAAMK,IAAO,GACpBM,IAAM1D,GAAK0D,IAAMX,GAAK,EAAE,GACxBM,IAAOA,IAAMK,IAAO,GACpBN,IAAMpD,GAAKoD,IAAMC,GAAK,EAAE,GACxBN,IAAOA,IAAMK,IAAO,GACpBM,IAAM1D,GAAK0D,IAAMX,GAAK,CAAC,GACvBM,IAAOA,IAAMK,IAAO,GACpBN,IAAMpD,GAAKoD,IAAMC,GAAK,CAAC,GACvBL,IAAOA,IAAMC,IAAO,GACpBU,IAAM3D,GAAK2D,IAAMX,GAAK,EAAE,GACxBM,IAAOA,IAAMK,IAAO,GACpBV,IAAMjD,GAAKiD,IAAMK,GAAK,EAAE,GACxBN,IAAOA,IAAMC,IAAO,GACpBU,IAAM3D,GAAK2D,IAAMX,GAAK,CAAC,GACvBM,IAAOA,IAAMK,IAAO,GACpBV,IAAMjD,GAAKiD,IAAMK,GAAK,CAAC;AAG3B,MAAIO,KAAK;AACT,EAAA5nB,EAAI4nB,IAAI,IAAKhC,IAAMgB,IAAO,GAC1B5mB,EAAI4nB,IAAI,IAAK/B,IAAMgB,IAAO,GAC1B7mB,EAAI4nB,IAAI,IAAK9B,IAAMgB,IAAO,GAC1B9mB,EAAI4nB,IAAI,IAAK7B,IAAMgB,IAAO,GAC1B/mB,EAAI4nB,IAAI,IAAK5B,IAAMgB,IAAO,GAC1BhnB,EAAI4nB,IAAI,IAAK3B,IAAMgB,IAAO,GAC1BjnB,EAAI4nB,IAAI,IAAK1B,IAAMgB,IAAO,GAC1BlnB,EAAI4nB,IAAI,IAAKzB,IAAMgB,IAAO,GAC1BnnB,EAAI4nB,IAAI,IAAKxB,IAAMgB,IAAO,GAC1BpnB,EAAI4nB,IAAI,IAAKvB,IAAMgB,IAAO,GAC1BrnB,EAAI4nB,IAAI,IAAKtB,IAAMgB,IAAO,GAC1BtnB,EAAI4nB,IAAI,IAAKrB,IAAMgB,IAAO,GAC1BvnB,EAAI4nB,IAAI,IAAKpB,IAAMgB,IAAO,GAC1BxnB,EAAI4nB,IAAI,IAAKnB,IAAMgB,IAAO,GAC1BznB,EAAI4nB,IAAI,IAAKlB,IAAMgB,IAAO,GAC1B1nB,EAAI4nB,IAAI,IAAKjB,IAAMgB,IAAO;AAC9B;AAkGO,MAAME,KAA2B,gBAAA7C,GAAaU,IAAY;AAAA,EAC7D,cAAc;AAAA,EACd,eAAe;AAAA,EACf,gBAAgB;AACpB,CAAC;SC1MM,cAAmBxjB,GAAK;AAAA,EAC3B,YAAYvC,GAAMyX,GAAM;AACpB,aACA,KAAK,WAAW,IAChB,KAAK,YAAY,IACjBoE,GAAO,KAAK7b,CAAI;AAChB,UAAMjE,IAAMkF,GAAQwW,CAAI;AAExB,QADA,KAAK,QAAQzX,EAAK,UACd,OAAO,KAAK,MAAM,UAAW;AAC7B,YAAM,IAAI,MAAM,qDAAqD;AACzE,SAAK,WAAW,KAAK,MAAM,UAC3B,KAAK,YAAY,KAAK,MAAM;AAC5B,UAAMwC,IAAW,KAAK,UAChBjB,IAAM,IAAI,WAAWiB,CAAQ;AAEnC,IAAAjB,EAAI,IAAIxF,EAAI,SAASyG,IAAWxC,EAAK,OAAQ,EAAC,OAAOjE,CAAG,EAAE,OAAQ,IAAGA,CAAG;AACxE,aAASC,IAAI,GAAGA,IAAIuF,EAAI,QAAQvF;AAC5B,MAAAuF,EAAIvF,CAAC,KAAK;AACd,SAAK,MAAM,OAAOuF,CAAG,GAErB,KAAK,QAAQvB,EAAK;AAElB,aAAShE,IAAI,GAAGA,IAAIuF,EAAI,QAAQvF;AAC5B,MAAAuF,EAAIvF,CAAC,KAAK;AACd,SAAK,MAAM,OAAOuF,CAAG,GACrBA,EAAI,KAAK,CAAC;AAAA,EACb;AAAA,EACD,OAAOoW,GAAK;AACR,WAAAkE,GAAO,OAAO,IAAI,GAClB,KAAK,MAAM,OAAOlE,CAAG,GACd;AAAA,EACV;AAAA,EACD,WAAWtX,GAAK;AACZ,IAAAwb,GAAO,OAAO,IAAI,GAClBA,GAAO,MAAMxb,GAAK,KAAK,SAAS,GAChC,KAAK,WAAW,IAChB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,MAAM,OAAOA,CAAG,GACrB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,QAAO;AAAA,EACf;AAAA,EACD,SAAS;AACL,UAAMA,IAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,gBAAK,WAAWA,CAAG,GACZA;AAAA,EACV;AAAA,EACD,WAAW8C,GAAI;AAEX,IAAAA,MAAOA,IAAK,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAE,CAAA;AACzD,UAAM,EAAE,OAAA2U,GAAO,OAAAC,GAAO,UAAA1U,GAAU,WAAAC,GAAW,UAAAd,GAAU,WAAAC,EAAW,IAAG;AACnE,WAAAU,IAAKA,GACLA,EAAG,WAAWE,GACdF,EAAG,YAAYG,GACfH,EAAG,WAAWX,GACdW,EAAG,YAAYV,GACfU,EAAG,QAAQ2U,EAAM,WAAW3U,EAAG,KAAK,GACpCA,EAAG,QAAQ4U,EAAM,WAAW5U,EAAG,KAAK,GAC7BA;AAAA,EACV;AAAA,EACD,UAAU;AACN,SAAK,YAAY,IACjB,KAAK,MAAM,WACX,KAAK,MAAM;EACd;AACL;AAOO,MAAM6U,KAAO,CAAChY,GAAMjE,GAAKkc,MAAY,IAAIC,GAAKlY,GAAMjE,CAAG,EAAE,OAAOkc,CAAO,EAAE,OAAM;AACtFD,GAAK,SAAS,CAAChY,GAAMjE,MAAQ,IAAImc,GAAKlY,GAAMjE,CAAG;AC9DxC,SAASosB,GAAQnoB,GAAMooB,GAAKC,GAAM;AACrC,SAAAxM,GAAO,KAAK7b,CAAI,GAMTgY,GAAKhY,GAAMiB,GAAQonB,CAAI,GAAGpnB,GAAQmnB,CAAG,CAAC;AACjD;AAEA,MAAME,KAAe,IAAI,WAAW,CAAC,CAAC,CAAC,GACjCC,KAAe,IAAI;AAOlB,SAASC,GAAOxoB,GAAMyoB,GAAKC,GAAMtlB,IAAS,IAAI;AAGjD,MAFAyY,GAAO,KAAK7b,CAAI,GAChB6b,GAAO,OAAOzY,CAAM,GAChBA,IAAS,MAAMpD,EAAK;AACpB,UAAM,IAAI,MAAM,iCAAiC;AACrD,QAAM2oB,IAAS,KAAK,KAAKvlB,IAASpD,EAAK,SAAS;AAChD,EAAI0oB,MAAS,WACTA,IAAOH;AAEX,QAAMK,IAAM,IAAI,WAAWD,IAAS3oB,EAAK,SAAS,GAE5CkY,IAAOF,GAAK,OAAOhY,GAAMyoB,CAAG,GAC5BI,IAAU3Q,EAAK,cACf4Q,IAAI,IAAI,WAAW5Q,EAAK,SAAS;AACvC,WAAS4M,IAAU,GAAGA,IAAU6D,GAAQ7D;AACpC,IAAAwD,GAAa,CAAC,IAAIxD,IAAU,GAG5B+D,EAAQ,OAAO/D,MAAY,IAAIyD,KAAeO,CAAC,EAC1C,OAAOJ,CAAI,EACX,OAAOJ,EAAY,EACnB,WAAWQ,CAAC,GACjBF,EAAI,IAAIE,GAAG9oB,EAAK,YAAY8kB,CAAO,GACnC5M,EAAK,WAAW2Q,CAAO;AAE3B,SAAA3Q,EAAK,QAAO,GACZ2Q,EAAQ,QAAO,GACfC,EAAE,KAAK,CAAC,GACRR,GAAa,KAAK,CAAC,GACZM,EAAI,MAAM,GAAGxlB,CAAM;AAC9B;AC7DA,IAAI2lB,KAAY,OAAO,gBACnBC,KAAW,CAACC,GAAQC,MAAQ;AAC9B,WAASC,KAAQD;AACf,IAAAH,GAAUE,GAAQE,GAAM,EAAE,KAAKD,EAAIC,CAAI,GAAG,YAAY,GAAI,CAAE;AAChE,GAOIC,KAAiB,OAAO,UAAU,GAClCC,KAAW,CAACC,MAAQA,aAAe;AACvC,SAASC,GAAcC,GAAO;AAa5B,MAZI,CAACH,GAASG,CAAK,KAEf,OAAOA,EAAM,QAAS,YAEtB,OAAOA,EAAM,WAAY,YAEzB,OAAOA,EAAM,cAAe,YAE5B,OAAOA,EAAM,UAAW,YAExB,CAACA,EAAM,OAAO,MAAM,gBAAgB,KAEpC,CAAC,MAAM,QAAQA,EAAM,IAAI;AAC3B,WAAO;AACT,WAASC,IAAK,GAAGA,IAAKD,EAAM,KAAK,QAAQC,KAAM;AAC7C,QAAItP,IAAMqP,EAAM,KAAKC,CAAE;AACvB,QAAI,CAAC,MAAM,QAAQtP,CAAG;AACpB,aAAO;AACT,aAASzU,IAAI,GAAGA,IAAIyU,EAAI,QAAQzU;AAC9B,UAAI,OAAOyU,EAAIzU,CAAC,KAAM;AACpB,eAAO;AAAA,EAEZ;AACD,SAAO;AACT;AAcA,IAAIgkB,KAAgB,CAAA;AACpBV,GAASU,IAAe;AAAA,EACtB,OAAO,MAAMC;AAAAA,EACb,WAAW,MAAMC;AAAAA,EACjB,cAAc,MAAMC;AAAA,EACpB,8BAA8B,MAAMC;AAAA,EACpC,+BAA+B,MAAMC;AAAA,EACrC,cAAc,MAAMC;AAAAA,EACpB,aAAa,MAAMC;AAAA,EACnB,aAAa,MAAMC;AACrB,CAAC;AACD,IAAID,KAAc,IAAI,YAAY,OAAO,GACrCC,KAAc,IAAI;AACtB,SAASF,GAAaG,GAAK;AACzB,EAAIA,EAAI,QAAQ,KAAK,MAAM,OACzBA,IAAM,WAAWA;AACnB,MAAIxuB,IAAI,IAAI,IAAIwuB,CAAG;AACnB,SAAAxuB,EAAE,WAAWA,EAAE,SAAS,QAAQ,QAAQ,GAAG,GACvCA,EAAE,SAAS,SAAS,GAAG,MACzBA,EAAE,WAAWA,EAAE,SAAS,MAAM,GAAG,EAAE,KACjCA,EAAE,SAAS,QAAQA,EAAE,aAAa,SAASA,EAAE,SAAS,SAASA,EAAE,aAAa,YAChFA,EAAE,OAAO,KACXA,EAAE,aAAa,QACfA,EAAE,OAAO,IACFA,EAAE;AACX;AACA,SAASouB,GAA8BK,GAAaZ,GAAO;AACzD,QAAM,CAACvI,GAAKoJ,CAAK,IAAIR,GAAaO,GAAa,CAAC3qB,MAC1C+pB,EAAM,OAAO/pB,EAAE,KACV,IACL+pB,EAAM,eAAe/pB,EAAE,aAClB,KACFA,EAAE,aAAa+pB,EAAM,UAC7B;AACD,SAAKa,KACHD,EAAY,OAAOnJ,GAAK,GAAGuI,CAAK,GAE3BY;AACT;AACA,SAASN,GAA6BM,GAAaZ,GAAO;AACxD,QAAM,CAACvI,GAAKoJ,CAAK,IAAIR,GAAaO,GAAa,CAAC3qB,MAC1C+pB,EAAM,OAAO/pB,EAAE,KACV,IACL+pB,EAAM,eAAe/pB,EAAE,aAClB,KACF+pB,EAAM,aAAa/pB,EAAE,UAC7B;AACD,SAAK4qB,KACHD,EAAY,OAAOnJ,GAAK,GAAGuI,CAAK,GAE3BY;AACT;AACA,SAASP,GAAaptB,GAAK6tB,GAAS;AAClC,MAAI/tB,IAAQ,GACRqgB,IAAMngB,EAAI,SAAS;AACvB,SAAOF,KAASqgB,KAAK;AACnB,UAAM2N,IAAM,KAAK,OAAOhuB,IAAQqgB,KAAO,CAAC,GAClC4N,IAAMF,EAAQ7tB,EAAI8tB,CAAG,CAAC;AAC5B,QAAIC,MAAQ;AACV,aAAO,CAACD,GAAK,EAAI;AAEnB,IAAIC,IAAM,IACR5N,IAAM2N,IAAM,IAEZhuB,IAAQguB,IAAM;AAAA,EAEjB;AACD,SAAO,CAAChuB,GAAO,EAAK;AACtB;AACA,IAAIqtB,KAAY,MAAM;AAAA,EAIpB,YAAY3R,GAAS;AAHrB,IAAApiB,EAAA;AACA,IAAAA,EAAA,cAAO;AACP,IAAAA,EAAA,cAAO;AAEL,SAAK,QAAQoiB;AAAA,EACd;AACH,GACI0R,KAAQ,MAAM;AAAA,EAGhB,cAAc;AAFd,IAAA9zB,EAAA;AACA,IAAAA,EAAA;AAEE,SAAK,QAAQ,MACb,KAAK,OAAO;AAAA,EACb;AAAA,EACD,QAAQsG,GAAO;AACb,UAAMsuB,IAAU,IAAIb,GAAUztB,CAAK;AACnC,WAAK,KAAK,OAGC,KAAK,SAAS,KAAK,SAC5B,KAAK,OAAOsuB,GACZ,KAAK,KAAK,OAAO,KAAK,OACtB,KAAK,MAAM,OAAOA,MAElBA,EAAQ,OAAO,KAAK,MACpB,KAAK,KAAK,OAAOA,GACjB,KAAK,OAAOA,MATZ,KAAK,QAAQA,GACb,KAAK,OAAOA,IAUP;AAAA,EACR;AAAA,EACD,UAAU;AACR,QAAI,CAAC,KAAK;AACR,aAAO;AACT,QAAI,KAAK,UAAU,KAAK,MAAM;AAC5B,YAAMC,IAAU,KAAK;AACrB,kBAAK,QAAQ,MACb,KAAK,OAAO,MACLA,EAAQ;AAAA,IAChB;AACD,UAAMzB,IAAS,KAAK;AACpB,gBAAK,QAAQA,EAAO,MACbA,EAAO;AAAA,EACf;AACH,GAGI0B,KAAK,MAAM;AAAA,EACb,oBAAoB;AAClB,WAAOjP,GAAQ,MAAM;EACtB;AAAA,EACD,aAAakP,GAAW;AACtB,WAAOzlB,GAAWuW,GAAQ,aAAakP,CAAS,CAAC;AAAA,EAClD;AAAA,EACD,cAAczsB,GAAGysB,GAAW;AAC1B,UAAMpB,IAAQrrB;AACd,WAAAqrB,EAAM,SAASrkB,GAAWuW,GAAQ,aAAakP,CAAS,CAAC,GACzDpB,EAAM,KAAKqB,GAAarB,CAAK,GAC7BA,EAAM,MAAMrkB,GAAWuW,GAAQ,KAAKmP,GAAarB,CAAK,GAAGoB,CAAS,CAAC,GACnEpB,EAAMJ,EAAc,IAAI,IACjBI;AAAA,EACR;AAAA,EACD,YAAYA,GAAO;AACjB,QAAI,OAAOA,EAAMJ,EAAc,KAAM;AACnC,aAAOI,EAAMJ,EAAc;AAC7B,UAAMppB,IAAO6qB,GAAarB,CAAK;AAC/B,QAAIxpB,MAASwpB,EAAM;AACjB,aAAAA,EAAMJ,EAAc,IAAI,IACjB;AAET,QAAI;AACF,YAAM0B,IAAQpP,GAAQ,OAAO8N,EAAM,KAAKxpB,GAAMwpB,EAAM,MAAM;AAC1D,aAAAA,EAAMJ,EAAc,IAAI0B,GACjBA;AAAA,IACR,QAAa;AACZ,aAAAtB,EAAMJ,EAAc,IAAI,IACjB;AAAA,IACR;AAAA,EACF;AACH;AACA,SAAS2B,GAAeC,GAAK;AAC3B,MAAI,CAACzB,GAAcyB,CAAG;AACpB,UAAM,IAAI,MAAM,wDAAwD;AAC1E,SAAO,KAAK,UAAU,CAAC,GAAGA,EAAI,QAAQA,EAAI,YAAYA,EAAI,MAAMA,EAAI,MAAMA,EAAI,OAAO,CAAC;AACxF;AACA,SAASH,GAAarB,GAAO;AAC3B,MAAIyB,IAAYpmB,GAAOqlB,GAAY,OAAOa,GAAevB,CAAK,CAAC,CAAC;AAChE,SAAOrkB,GAAW8lB,CAAS;AAC7B;AACA,IAAIjvB,KAAI,IAAI2uB;AACY3uB,GAAE;AAC1B,IAAIwZ,KAAexZ,GAAE,cACjBkvB,KAAgBlvB,GAAE,eAClBmvB,KAAcnvB,GAAE,aAGhBovB,KAAgB,CAAA;AACpBpC,GAASoC,IAAe;AAAA,EACtB,aAAa,MAAMC;AAAA,EACnB,YAAY,MAAMC;AAAA,EAClB,iBAAiB,MAAMC;AAAA,EACvB,mBAAmB,MAAMC;AAAA,EACzB,cAAc,MAAMC;AAAA,EACpB,cAAc,MAAMC;AAAA,EACpB,UAAU,MAAMC;AAAA,EAChB,mBAAmB,MAAMC;AAAA,EACzB,iBAAiB,MAAMC;AAAA,EACvB,oBAAoB,MAAMC;AAAA,EAC1B,gBAAgB,MAAMC;AAAA,EACtB,iBAAiB,MAAMC;AAAA,EACvB,iBAAiB,MAAMC;AAAA,EACvB,mBAAmB,MAAMC;AAAA,EACzB,YAAY,MAAMC;AAAAA,EAClB,iBAAiB,MAAMC;AAAA,EACvB,qBAAqB,MAAMC;AAAA,EAC3B,uBAAuB,MAAMC;AAAA,EAC7B,UAAU,MAAMC;AAAA,EAChB,uBAAuB,MAAMC;AAAA,EAC7B,qBAAqB,MAAMC;AAAA,EAC3B,cAAc,MAAMC;AAAA,EACpB,MAAM,MAAMC;AAAA,EACZ,wBAAwB,MAAMC;AAAA,EAC9B,WAAW,MAAMC;AAAA,EACjB,WAAW,MAAMC;AAAA,EACjB,wBAAwB,MAAMC;AAAA,EAC9B,yBAAyB,MAAMC;AAAA,EAC/B,eAAe,MAAMC;AAAA,EACrB,cAAc,MAAMC;AAAA,EACpB,sBAAsB,MAAMC;AAAA,EAC5B,YAAY,MAAMC;AAAA,EAClB,eAAe,MAAMC;AAAA,EACrB,cAAc,MAAMC;AAAA,EACpB,UAAU,MAAMC;AAAA,EAChB,oBAAoB,MAAMC;AAAA,EAC1B,uBAAuB,MAAMC;AAAA,EAC7B,YAAY,MAAMC;AAAA,EAClB,eAAe,MAAMC;AAAA,EACrB,cAAc,MAAMC;AAAA,EACpB,aAAa,MAAMC;AAAA,EACnB,YAAY,MAAMC;AAAA,EAClB,WAAW,MAAMC;AAAA,EACjB,OAAO,MAAMC;AAAA,EACb,iBAAiB,MAAMC;AAAA,EACvB,iBAAiB,MAAMC;AAAA,EACvB,WAAW,MAAMC;AAAA,EACjB,iBAAiB,MAAMC;AAAA,EACvB,UAAU,MAAMC;AAAA,EAChB,UAAU,MAAMC;AAAA,EAChB,eAAe,MAAMC;AAAA,EACrB,kBAAkB,MAAMC;AAAA,EACxB,mBAAmB,MAAMC;AAAA,EACzB,cAAc,MAAMC;AAAA,EACpB,gBAAgB,MAAMC;AAAA,EACtB,SAAS,MAAMC;AAAA,EACf,gBAAgB,MAAMC;AAAA,EACtB,eAAe,MAAMC;AAAA,EACrB,iBAAiB,MAAMC;AAAA,EACvB,UAAU,MAAMC;AAAA,EAChB,gBAAgB,MAAMC;AAAA,EACtB,WAAW,MAAMC;AAAA,EACjB,WAAW,MAAMC;AAAA,EACjB,QAAQ,MAAMC;AAAA,EACd,WAAW,MAAMC;AAAA,EACjB,QAAQ,MAAMC;AAAA,EACd,kBAAkB,MAAMC;AAAA,EACxB,eAAe,MAAMC;AAAA,EACrB,MAAM,MAAMC;AAAA,EACZ,eAAe,MAAMC;AAAA,EACrB,cAAc,MAAMC;AAAA,EACpB,KAAK,MAAMC;AAAA,EACX,SAAS,MAAMC;AAAA,EACf,YAAY,MAAMC;AAAA,EAClB,cAAc,MAAMC;AAAA,EACpB,iBAAiB,MAAMC;AAAA,EACvB,gCAAgC,MAAMC;AAAA,EACtC,eAAe,MAAMC;AAAA,EACrB,mBAAmB,MAAMC;AAC3B,CAAC;AACD,SAASD,GAAcE,GAAM;AAC3B,SAAO,OAAOA,KAAQA,IAAO,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,SAASA,CAAI;AACjG;AACA,SAASD,GAAkBC,GAAM;AAC/B,SAAO,CAAC,GAAG,CAAC,EAAE,SAASA,CAAI,KAAK,OAAOA,KAAQA,IAAO;AACxD;AACA,SAASJ,GAAgBI,GAAM;AAC7B,SAAO,OAAOA,KAAQA,IAAO;AAC/B;AACA,SAASH,GAA+BG,GAAM;AAC5C,SAAO,OAAOA,KAAQA,IAAO;AAC/B;AACA,SAASL,GAAaK,GAAM;AAC1B,SAAIF,GAAcE,CAAI,IACb,YACLD,GAAkBC,CAAI,IACjB,gBACLJ,GAAgBI,CAAI,IACf,cACLH,GAA+BG,CAAI,IAC9B,kBACF;AACT;AACA,IAAI/B,KAAW,GACXmB,KAAgB,GAChBP,KAAiB,GACjB1C,KAAW,GACXQ,KAAyB,GACzBC,KAA0B,GAC1BC,KAAgB,GAChBqC,KAAS,GACTN,KAAW,GACX1D,KAAa,GACb+B,KAAgB,IAChBxB,KAAkB,IAClBG,KAAkB,IAClBD,KAAiB,IACjBD,KAAqB,IACrBG,KAAkB,IAClB0C,KAAiB,MACjBzB,KAAe,MACfgB,KAAkB,MAClBW,KAAiB,MACjBO,KAAS,MACTC,KAAY,MACZrB,KAAQ,MACR1B,KAAwB,MACxBwB,KAAa,MACbC,KAAY,MACZF,KAAc,KACdgC,KAAU,MACVC,KAAa,MACbF,KAAM,MACNlC,KAAa,MACbY,KAAW,KACXM,KAAU,OACVM,KAAY,OACZzD,KAAe,OACfW,KAAkB,OAClB2C,KAAkB,OAClBvD,KAAoB,OACpB+D,KAAmB,OACnB5B,KAAgB,OAChB+B,KAAgB,OAChBvC,KAAuB,OACvBoB,KAAgB,OAChBN,KAAkB,MAClB9B,KAAa,OACbqC,KAAmB,OACnBC,KAAoB,OACpBC,KAAe,OACfnB,KAAW,OACXH,KAAa,KACbE,KAAe,OACf6B,KAAY,OACZzD,KAAe,OACfgB,KAAe,OACfoC,KAAgB,OAChBvD,KAAkB,OAClBqC,KAAe,OACfnB,KAAsB,OACtBD,KAAwB,OACxB4B,KAAkB,OAClBvB,KAAY,OACZC,KAAY,OACZzB,KAAc,OACd8C,KAAY,OACZwB,KAAe,OACfzD,KAAoB,OACpBU,KAAyB,OACzBD,KAAQ,OACR8C,KAAO,OACP9D,KAAW,OACXC,KAAoB,OACpB6B,KAAwB,OACxBD,KAAqB,OACrBnB,KAAsB;AAG1B,SAASgE,GAAYC,GAAQ9G,GAAO;AAOlC,MANI8G,EAAO,OAAOA,EAAO,IAAI,QAAQ9G,EAAM,EAAE,MAAM,MAG/C8G,EAAO,SAASA,EAAO,MAAM,QAAQ9G,EAAM,IAAI,MAAM,MAGrD8G,EAAO,WAAWA,EAAO,QAAQ,QAAQ9G,EAAM,MAAM,MAAM;AAC7D,WAAO;AAET,WAAS/e,KAAK6lB;AACZ,QAAI7lB,EAAE,CAAC,MAAM,KAAK;AAChB,UAAI8lB,IAAU9lB,EAAE,MAAM,CAAC,GACnB+lB,IAASF,EAAO,IAAIC,CAAO,EAAE;AACjC,UAAIC,KAAU,CAAChH,EAAM,KAAK,KAAK,CAAC,CAACrrB,GAAGjC,CAAC,MAAMiC,MAAMsM,EAAE,MAAM,CAAC,KAAK+lB,EAAO,QAAQt0B,CAAC,MAAM,EAAE;AACrF,eAAO;AAAA,IACV;AAIH,SAFI,EAAAo0B,EAAO,SAAS9G,EAAM,aAAa8G,EAAO,SAE1CA,EAAO,SAAS9G,EAAM,aAAa8G,EAAO;AAGhD;AACA,SAASG,GAAaC,GAASlH,GAAO;AACpC,WAASC,IAAK,GAAGA,IAAKiH,EAAQ,QAAQjH;AACpC,QAAI4G,GAAYK,EAAQjH,CAAE,GAAGD,CAAK;AAChC,aAAO;AAGX,SAAO;AACT;AAwBA,SAASmH,GAAeL,GAAQ;A1BrchC,MAAA16B,GAAAK,GAAA2G,GAAAC,GAAAC,GAAA8zB;A0B0cE,MAJIN,EAAO,OAAO,CAACA,EAAO,IAAI,UAE1BA,EAAO,SAAS,CAACA,EAAO,MAAM,UAE9BA,EAAO,WAAW,CAACA,EAAO,QAAQ;AACpC,WAAO;AACT,aAAW,CAACv0B,GAAKI,CAAK,KAAK,OAAO,QAAQm0B,CAAM;AAC9C,QAAIv0B,EAAI,CAAC,MAAM,OAAO,MAAM,QAAQI,CAAK,KAAK,CAACA,EAAM;AACnD,aAAO;AAEX,SAAO,KAAK;AAAA,IACV,KAAK,IAAI,GAAGm0B,EAAO,SAAS,KAAQ;AAAA,MACpC16B,IAAA06B,EAAO,QAAP,gBAAA16B,EAAY,WAAU;AAAA,KACtBK,IAAAq6B,EAAO,YAAP,QAAAr6B,EAAgB,YAAU2G,IAAA0zB,EAAO,UAAP,QAAA1zB,EAAc,MAAM,CAACwzB,MAASD,GAAkBC,CAAI,MAAKE,EAAO,QAAQ,SAASA,EAAO,MAAM,SAAS;AAAA,KACjIzzB,IAAAyzB,EAAO,YAAP,QAAAzzB,EAAgB,YAAUC,IAAAwzB,EAAO,UAAP,QAAAxzB,EAAc,MAAM,CAACszB,MAASH,GAA+BG,CAAI,SAAMQ,IAAAN,EAAO,IAAI,MAAX,QAAAM,EAAc,UAASN,EAAO,QAAQ,SAASA,EAAO,MAAM,SAASA,EAAO,IAAI,EAAE,SAAS;AAAA,EAChM;AACA;AAGA,IAAIO,KAAmB,CAAA;AACvB7H,GAAS6H,IAAkB;AAAA,EACzB,UAAU,MAAMC;AAAAA,EAChB,QAAQ,MAAMC;AAAA,EACd,mBAAmB,MAAMC;AAAAA,EACzB,cAAc,MAAMC;AAAA,EACpB,gBAAgB,MAAMC;AAAA,EACtB,kBAAkB,MAAMC;AAC1B,CAAC;AACD,SAASL,GAASM,GAAMhnB,GAAO;AAC7B,MAAIxH,IAAMwH,EAAM,SAAS,GACrB6W,IAAMmQ,EAAK,QAAQ,IAAIhnB,CAAK,IAAI,IAAIxH,GACpC,IAAIwuB,EAAK,MAAMnQ,CAAG,EAAE,QAAQ,GAAG,IAAIA,IAAM;AAC7C,SAAOmQ,EAAK,MAAM,GAAG,IAAI,EAAE;AAC7B;AACA,SAASL,GAAOK,GAAMhnB,GAAO;AAC3B,MAAIxH,IAAMwH,EAAM,QACZ6W,IAAMmQ,EAAK,QAAQ,IAAIhnB,CAAK,IAAI,IAAIxH,IAAM,GAC1CyuB,IAASD,EAAK,MAAMnQ,CAAG,GACvBrE,IAAM,KAAK,IAAIyU,EAAO,QAAQ,GAAG,GAAGA,EAAO,QAAQ,GAAG,CAAC;AAC3D,SAAO,SAASA,EAAO,MAAM,GAAGzU,CAAG,GAAG,EAAE;AAC1C;AACA,SAASoU,GAAkBI,GAAM;AAC/B,MAAInQ,IAAMmQ,EAAK,MAAM,GAAG,EAAE,EAAE,QAAQ,SAAS;AAC7C,MAAInQ,MAAQ;AACV,WAAO;AACT,MAAIqQ,IAASF,EAAK,MAAMnQ,IAAM,IAAI,CAAC,EAAE,QAAQ,GAAG;AAChD,MAAIqQ,MAAW;AACb,WAAO;AACT,MAAI/0B,IAAQ0kB,IAAM,IAAI,IAAIqQ,GACtBC,IAAOH,EAAK,MAAM70B,IAAQ,GAAG,EAAE,EAAE,QAAQ,GAAG;AAChD,MAAIg1B,MAAS;AACX,WAAO;AACT,MAAI3U,IAAMrgB,IAAQ,IAAIg1B;AACtB,SAAOH,EAAK,MAAM70B,IAAQ,GAAGqgB,CAAG;AAClC;AACA,SAASqU,GAAaG,GAAMI,GAAI;AAC9B,SAAOA,MAAOV,GAASM,GAAM,IAAI;AACnC;AACA,SAASD,GAAiBC,GAAMK,GAAQ;AACtC,SAAOA,MAAWX,GAASM,GAAM,QAAQ;AAC3C;AACA,SAASF,GAAeE,GAAMhB,GAAM;AAClC,SAAOA,MAASW,GAAOK,GAAM,MAAM;AACrC;AAGA,IAAIM,KAAgB,CAAA;AACpB1I,GAAS0I,IAAe;AAAA,EACtB,eAAe,MAAMC;AACvB,CAAC;AACD,SAASA,GAAcC,GAAU5W,GAAW;AAC1C,SAAO;AAAA,IACL,MAAMmR;AAAAA,IACN,YAAY,KAAK,MAAM,KAAK,IAAG,IAAK,GAAG;AAAA,IACvC,MAAM;AAAA,MACJ,CAAC,SAASyF,CAAQ;AAAA,MAClB,CAAC,aAAa5W,CAAS;AAAA,IACxB;AAAA,IACD,SAAS;AAAA,EACb;AACA;AAqTA,IAAI6W;AACJ,IAAI;AACFA,EAAAA,KAAa;AACf,QAAQ;AACR;AA8KA,IAAIC;AACJ,IAAI;AACF,EAAAA,KAAc;AAChB,QAAQ;AACR;AAQA,IAAIC,KAAgB,CAAA;AACpB/I,GAAS+I,IAAe;AAAA,EACtB,cAAc,MAAMC;AAAA,EACpB,eAAe,MAAMC;AAAA,EACrB,QAAQ,MAAM9V;AAAA,EACd,aAAa,MAAM+V;AAAA,EACnB,aAAa,MAAMC;AAAA,EACnB,cAAc,MAAMC;AAAA,EACpB,YAAY,MAAMC;AAAA,EAClB,gBAAgB,MAAMC;AAAA,EACtB,YAAY,MAAMC;AAAA,EAClB,cAAc,MAAMC;AAAA,EACpB,YAAY,MAAMC;AACpB,CAAC;AAGD,IAAIR,KAAgB,KAChBD,KAAe;AACnB,SAASU,GAAoB7yB,GAAQ;AACnC,QAAM8yB,IAAa,IAAI,WAAW,CAAC;AACnC,SAAAA,EAAW,CAAC,IAAI9yB,KAAU,KAAK,KAC/B8yB,EAAW,CAAC,IAAI9yB,KAAU,KAAK,KAC/B8yB,EAAW,CAAC,IAAI9yB,KAAU,IAAI,KAC9B8yB,EAAW,CAAC,IAAI9yB,IAAS,KAClB8yB;AACT;AACA,SAASxW,GAAOyW,GAAO;A1BniCvB,MAAAh9B,GAAAK,GAAA2G,GAAAC,GAAAC,GAAA8zB,GAAAiC,GAAAC;A0BoiCE,MAAI,EAAE,QAAA/d,GAAQ,OAAA2J,EAAO,IAAGe,GAAO,OAAOmT,GAAOX,EAAa,GACtD/wB,IAAO,IAAI,WAAWue,GAAO,UAAUf,CAAK,CAAC;AACjD,UAAQ3J,GAAM;AAAA,IACZ,KAAK,YAAY;AACf,UAAIge,IAAMC,GAAS9xB,CAAI;AACvB,UAAI,GAACtL,IAAAm9B,EAAI,CAAC,MAAL,QAAAn9B,EAAS;AACZ,cAAM,IAAI,MAAM,4BAA4B;AAC9C,UAAIm9B,EAAI,CAAC,EAAE,CAAC,EAAE,WAAW;AACvB,cAAM,IAAI,MAAM,0BAA0B;AAC5C,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,UACJ,QAAQE,GAAYF,EAAI,CAAC,EAAE,CAAC,CAAC;AAAA,UAC7B,QAAQA,EAAI,CAAC,IAAIA,EAAI,CAAC,EAAE,IAAI,CAACroB,MAAMuf,GAAY,OAAOvf,CAAC,CAAC,IAAI,CAAE;AAAA,QAC/D;AAAA,MACT;AAAA,IACK;AAAA,IACD,KAAK,UAAU;AACb,UAAIqoB,IAAMC,GAAS9xB,CAAI;AACvB,UAAI,GAACjL,IAAA88B,EAAI,CAAC,MAAL,QAAA98B,EAAS;AACZ,cAAM,IAAI,MAAM,0BAA0B;AAC5C,UAAI88B,EAAI,CAAC,EAAE,CAAC,EAAE,WAAW;AACvB,cAAM,IAAI,MAAM,0BAA0B;AAC5C,UAAIA,EAAI,CAAC,KAAKA,EAAI,CAAC,EAAE,CAAC,EAAE,WAAW;AACjC,cAAM,IAAI,MAAM,0BAA0B;AAC5C,UAAIA,EAAI,CAAC,KAAKA,EAAI,CAAC,EAAE,CAAC,EAAE,WAAW;AACjC,cAAM,IAAI,MAAM,yBAAyB;AAC3C,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,UACJ,IAAIE,GAAYF,EAAI,CAAC,EAAE,CAAC,CAAC;AAAA,UACzB,QAAQA,EAAI,CAAC,IAAIA,EAAI,CAAC,EAAE,IAAI,CAACroB,MAAMuf,GAAY,OAAOvf,CAAC,CAAC,IAAI,CAAE;AAAA,UAC9D,SAAQ9N,IAAAm2B,EAAI,CAAC,MAAL,QAAAn2B,EAAS,KAAKq2B,GAAYF,EAAI,CAAC,EAAE,CAAC,CAAC,IAAI;AAAA,UAC/C,OAAMl2B,IAAAk2B,EAAI,CAAC,MAAL,QAAAl2B,EAAS,KAAK,SAASo2B,GAAYF,EAAI,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI;AAAA,QAC5D;AAAA,MACT;AAAA,IACK;AAAA,IACD,KAAK,SAAS;AACZ,UAAIA,IAAMC,GAAS9xB,CAAI;AACvB,UAAI,GAACpE,IAAAi2B,EAAI,CAAC,MAAL,QAAAj2B,EAAS;AACZ,cAAM,IAAI,MAAM,yBAAyB;AAC3C,UAAI,GAAC8zB,IAAAmC,EAAI,CAAC,MAAL,QAAAnC,EAAS;AACZ,cAAM,IAAI,MAAM,yBAAyB;AAC3C,UAAImC,EAAI,CAAC,EAAE,CAAC,EAAE,WAAW;AACvB,cAAM,IAAI,MAAM,0BAA0B;AAC5C,UAAI,GAACF,IAAAE,EAAI,CAAC,MAAL,QAAAF,EAAS;AACZ,cAAM,IAAI,MAAM,yBAAyB;AAC3C,UAAIE,EAAI,CAAC,EAAE,CAAC,EAAE,WAAW;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC3C,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,UACJ,YAAY9I,GAAY,OAAO8I,EAAI,CAAC,EAAE,CAAC,CAAC;AAAA,UACxC,QAAQE,GAAYF,EAAI,CAAC,EAAE,CAAC,CAAC;AAAA,UAC7B,MAAM,SAASE,GAAYF,EAAI,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE;AAAA,UACzC,QAAQA,EAAI,CAAC,IAAIA,EAAI,CAAC,EAAE,IAAI,CAACroB,MAAMuf,GAAY,OAAOvf,CAAC,CAAC,IAAI,CAAE;AAAA,QAC/D;AAAA,MACT;AAAA,IACK;AAAA,IACD,KAAK,UAAU;AACb,UAAIqoB,IAAMC,GAAS9xB,CAAI;AACvB,UAAI,GAAC4xB,IAAAC,EAAI,CAAC,MAAL,QAAAD,EAAS;AACZ,cAAM,IAAI,MAAM,0BAA0B;AAC5C,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM7I,GAAY,OAAO8I,EAAI,CAAC,EAAE,CAAC,CAAC;AAAA,MAC1C;AAAA,IACK;AAAA,IACD,KAAK;AACH,aAAO,EAAE,MAAMhe,GAAQ,MAAA7T;IACzB,KAAK;AAAA,IACL,KAAK;AACH,aAAO,EAAE,MAAM6T,GAAQ,MAAMke,GAAY/xB,CAAI;IAC/C;AACE,YAAM,IAAI,MAAM,kBAAkB6T,CAAM,EAAE;AAAA,EAC7C;AACH;AACA,SAASie,GAAS9xB,GAAM;AACtB,MAAIqH,IAAS,CAAA,GACT2qB,IAAOhyB;AACX,SAAOgyB,EAAK,SAAS,KAAG;AACtB,QAAI/0B,IAAI+0B,EAAK,CAAC,GACV3kB,IAAI2kB,EAAK,CAAC,GACVh3B,IAAIg3B,EAAK,MAAM,GAAG,IAAI3kB,CAAC;AAE3B,QADA2kB,IAAOA,EAAK,MAAM,IAAI3kB,CAAC,GACnBrS,EAAE,SAASqS;AACb,YAAM,IAAI,MAAM,kCAAkCpQ,CAAC,EAAE;AACvD,IAAAoK,EAAOpK,CAAC,IAAIoK,EAAOpK,CAAC,KAAK,CAAA,GACzBoK,EAAOpK,CAAC,EAAE,KAAKjC,CAAC;AAAA,EACjB;AACD,SAAOqM;AACT;AACA,SAASkqB,GAAW12B,GAAK;AACvB,SAAOm2B,GAAY,QAAQn2B,CAAG;AAChC;AACA,SAASw2B,GAAWntB,GAAK;AACvB,SAAO8sB,GAAY,QAAQ1sB,GAAWJ,CAAG,CAAC;AAC5C;AACA,SAASitB,GAAWjtB,GAAK;AACvB,SAAO8sB,GAAY,QAAQ1sB,GAAWJ,CAAG,CAAC;AAC5C;AACA,SAAS+tB,GAAape,GAAQ7T,GAAM;AAClC,MAAIwd,IAAQe,GAAO,QAAQve,CAAI;AAC/B,SAAOue,GAAO,OAAO1K,GAAQ2J,GAAOuT,EAAa;AACnD;AACA,SAASC,GAAYnd,GAAQjV,GAAO;AAClC,SAAOqzB,GAAape,GAAQjV,CAAK;AACnC;AACA,SAASwyB,GAAec,GAAS;AAC/B,MAAIlyB,IAAOmyB,GAAU;AAAA,IACnB,GAAG,CAAC7tB,GAAW4tB,EAAQ,MAAM,CAAC;AAAA,IAC9B,IAAIA,EAAQ,UAAU,IAAI,IAAI,CAACjJ,MAAQD,GAAY,OAAOC,CAAG,CAAC;AAAA,EAClE,CAAG;AACD,SAAOgJ,GAAa,YAAYjyB,CAAI;AACtC;AACA,SAASkxB,GAAa5I,GAAO;AAC3B,MAAI8J;AACJ,EAAI9J,EAAM,SAAS,WACjB8J,IAAYZ,GAAoBlJ,EAAM,IAAI;AAE5C,MAAItoB,IAAOmyB,GAAU;AAAA,IACnB,GAAG,CAAC7tB,GAAWgkB,EAAM,EAAE,CAAC;AAAA,IACxB,IAAIA,EAAM,UAAU,IAAI,IAAI,CAACW,MAAQD,GAAY,OAAOC,CAAG,CAAC;AAAA,IAC5D,GAAGX,EAAM,SAAS,CAAChkB,GAAWgkB,EAAM,MAAM,CAAC,IAAI,CAAE;AAAA,IACjD,GAAG8J,IAAY,CAAC,IAAI,WAAWA,CAAS,CAAC,IAAI,CAAE;AAAA,EACnD,CAAG;AACD,SAAOH,GAAa,UAAUjyB,CAAI;AACpC;AACA,SAASixB,GAAYoB,GAAM;AACzB,MAAInD,IAAO,IAAI,YAAY,CAAC;AAC5B,MAAI,SAASA,CAAI,EAAE,UAAU,GAAGmD,EAAK,MAAM,EAAK;AAChD,MAAIryB,IAAOmyB,GAAU;AAAA,IACnB,GAAG,CAACnJ,GAAY,OAAOqJ,EAAK,UAAU,CAAC;AAAA,IACvC,IAAIA,EAAK,UAAU,IAAI,IAAI,CAACpJ,MAAQD,GAAY,OAAOC,CAAG,CAAC;AAAA,IAC3D,GAAG,CAAC3kB,GAAW+tB,EAAK,MAAM,CAAC;AAAA,IAC3B,GAAG,CAAC,IAAI,WAAWnD,CAAI,CAAC;AAAA,EAC5B,CAAG;AACD,SAAO+C,GAAa,SAASjyB,CAAI;AACnC;AACA,SAASsxB,GAAarI,GAAK;AACzB,MAAIjpB,IAAOmyB,GAAU;AAAA,IACnB,GAAG,CAACnJ,GAAY,OAAOC,CAAG,CAAC;AAAA,EAC/B,CAAG;AACD,SAAOgJ,GAAa,UAAUjyB,CAAI;AACpC;AACA,SAASmyB,GAAUN,GAAK;AACtB,MAAIS,IAAU,CAAA;AACd,gBAAO,QAAQT,CAAG,EAAE,QAAO,EAAG,QAAQ,CAAC,CAAC,GAAGU,CAAE,MAAM;AACjD,IAAAA,EAAG,QAAQ,CAACv3B,MAAM;AAChB,UAAII,IAAQ,IAAI,WAAWJ,EAAE,SAAS,CAAC;AACvC,MAAAI,EAAM,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAC1BA,EAAM,IAAI,CAACJ,EAAE,MAAM,GAAG,CAAC,GACvBI,EAAM,IAAIJ,GAAG,CAAC,GACds3B,EAAQ,KAAKl3B,CAAK;AAAA,IACxB,CAAK;AAAA,EACL,CAAG,GACM6E,GAAY,GAAGqyB,CAAO;AAC/B;AA4FA,IAAIE,KAAgB,CAAA;AACpB1K,GAAS0K,IAAe;AAAA,EACtB,SAAS,MAAMtR;AAAA,EACf,SAAS,MAAMF;AACjB,CAAC;AAKD,eAAeA,GAAQ0I,GAAW6G,GAAQkC,GAAM;AAC9C,QAAMC,IAAUhJ,aAAqB,aAAaiJ,GAAYjJ,CAAS,IAAIA,GACrE7uB,IAAM4d,GAAU,gBAAgBia,GAAS,OAAOnC,CAAM,GACtDqC,IAAgBC,GAAeh4B,CAAG;AACxC,MAAIonB,IAAK,WAAW,KAAKthB,GAAY,EAAE,CAAC,GACpC4gB,IAAYyH,GAAY,OAAOyJ,CAAI,GACnCrQ,IAAaJ,GAAI4Q,GAAe3Q,CAAE,EAAE,QAAQV,CAAS,GACrDuR,IAAQpW,GAAO,OAAO,IAAI,WAAW0F,CAAU,CAAC,GAChD2Q,IAAQrW,GAAO,OAAO,IAAI,WAAWuF,EAAG,MAAM,CAAC;AACnD,SAAO,GAAG6Q,CAAK,OAAOC,CAAK;AAC7B;AACA,eAAe7R,GAAQwI,GAAW6G,GAAQvwB,GAAM;AAC9C,QAAM0yB,IAAUhJ,aAAqB,aAAaiJ,GAAYjJ,CAAS,IAAIA;AAC3E,MAAI,CAACoJ,GAAOC,CAAK,IAAI/yB,EAAK,MAAM,MAAM,GAClCnF,IAAM4d,GAAU,gBAAgBia,GAAS,OAAOnC,CAAM,GACtDqC,IAAgBC,GAAeh4B,CAAG,GAClConB,IAAKvF,GAAO,OAAOqW,CAAK,GACxB3Q,IAAa1F,GAAO,OAAOoW,CAAK,GAChCvR,IAAYS,GAAI4Q,GAAe3Q,CAAE,EAAE,QAAQG,CAAU;AACzD,SAAO2G,GAAY,OAAOxH,CAAS;AACrC;AACA,SAASsR,GAAeh4B,GAAK;AAC3B,SAAOA,EAAI,MAAM,GAAG,EAAE;AACxB;AAGA,IAAIm4B,KAAgB,CAAA;AACpBlL,GAASkL,IAAe;AAAA,EACtB,aAAa,MAAMC;AAAA,EACnB,SAAS,MAAMC;AAAAA,EACf,cAAc,MAAMC;AAAA,EACpB,cAAc,MAAMC;AAAA,EACpB,wBAAwB,MAAMC;AAChC,CAAC;AACD,IAAIJ,KAAc,2CACdK;AACJ,IAAI;AACF,EAAAA,KAAS;AACX,QAAQ;AACR;AACA,SAASD,GAAuBE,GAAqB;AACnD,EAAAD,KAASC;AACX;AACA,eAAeH,GAAaI,GAAQC,IAAQ,IAAI;AAC9C,MAAI;AACF,UAAMxK,IAAM,WAAWuK,CAAM,gCAAgCC,CAAK;AAGlE,YADa,OADD,MAAMH,GAAOrK,GAAK,EAAE,UAAU,QAAO,CAAE,GAC5B,QACX;AAAA,EACb,QAAW;AACV,WAAO;EACR;AACH;AACA,eAAekK,GAAaO,GAAU;A1B31CtC,MAAAh/B;A0B41CE,QAAMi/B,IAAQD,EAAS,MAAMT,EAAW;AACxC,MAAI,CAACU;AACH,WAAO;AACT,QAAM,CAAC/+B,GAAGqzB,IAAO,KAAKuL,CAAM,IAAIG;AAChC,MAAI;AACF,UAAM1K,IAAM,WAAWuK,CAAM,gCAAgCvL,CAAI,IAC3D7pB,IAAM,OAAO,MAAMk1B,GAAOrK,GAAK,EAAE,UAAU,QAAO,CAAE,GAAG;AAC7D,QAAIsH,IAASnyB,EAAI,MAAM6pB,CAAI;AAC3B,WAAOsI,IAAS,EAAE,QAAAA,GAAQ,SAAQ77B,IAAA0J,EAAI,WAAJ,gBAAA1J,EAAa67B,GAAS,IAAG;AAAA,EAC5D,QAAY;AACX,WAAO;AAAA,EACR;AACH;AACA,eAAe2C,GAAQ3C,GAAQqD,GAAO;AACpC,MAAIx1B,IAAM,MAAM+0B,GAAaS,CAAK;AAClC,SAAOx1B,IAAMA,EAAI,WAAWmyB,IAAS;AACvC;AAGA,IAAIsD,KAAgB,CAAA;AACpB/L,GAAS+L,IAAe;AAAA,EACtB,OAAO,MAAMC;AACf,CAAC;AACD,SAASA,GAAMxL,GAAO;AACpB,QAAMjhB,IAAS;AAAA,IACb,OAAO;AAAA,IACP,MAAM;AAAA,IACN,UAAU,CAAE;AAAA,IACZ,UAAU,CAAE;AAAA,EAChB,GACQ0sB,IAAQ,CAAA;AACd,aAAW9a,KAAOqP,EAAM;AACtB,IAAIrP,EAAI,CAAC,MAAM,OAAOA,EAAI,CAAC,KACzB8a,EAAM,KAAK9a,CAAG,GAEZA,EAAI,CAAC,MAAM,OAAOA,EAAI,CAAC,KACzB5R,EAAO,SAAS,KAAK;AAAA,MACnB,QAAQ4R,EAAI,CAAC;AAAA,MACb,QAAQA,EAAI,CAAC,IAAI,CAACA,EAAI,CAAC,CAAC,IAAI,CAAE;AAAA,IACtC,CAAO;AAGL,WAAS+a,IAAY,GAAGA,IAAYD,EAAM,QAAQC,KAAa;AAC7D,UAAMC,IAAOF,EAAMC,CAAS,GACtB,CAACp/B,GAAGs/B,GAAaC,GAAcC,CAAU,IAAIH,GAC7CI,IAAe;AAAA,MACnB,IAAIH;AAAA,MACJ,QAAQC,IAAe,CAACA,CAAY,IAAI,CAAE;AAAA,IAChD,GACUG,IAAcN,MAAc,GAC5BO,IAAaP,MAAcD,EAAM,SAAS;AAChD,QAAIK,MAAe,QAAQ;AACzB,MAAA/sB,EAAO,OAAOgtB;AACd;AAAA,IACD;AACD,QAAID,MAAe,SAAS;AAC1B,MAAA/sB,EAAO,QAAQgtB;AACf;AAAA,IACD;AACD,QAAID,MAAe,WAAW;AAC5B,MAAA/sB,EAAO,SAAS,KAAKgtB,CAAY;AACjC;AAAA,IACD;AACD,QAAIC,GAAa;AACf,MAAAjtB,EAAO,OAAOgtB;AACd;AAAA,IACD;AACD,QAAIE,GAAY;AACd,MAAAltB,EAAO,QAAQgtB;AACf;AAAA,IACD;AACD,IAAAhtB,EAAO,SAAS,KAAKgtB,CAAY;AAAA,EAClC;AACD,SAAOhtB;AACT;AAGA,IAAImtB,KAAgB,CAAA;AACpB1M,GAAS0M,IAAe;AAAA,EACtB,uBAAuB,MAAMC;AAAA,EAC7B,wBAAwB,MAAMC;AAChC,CAAC;AACD,IAAIC;AACJ,IAAI;AACF,EAAAA,KAAU;AACZ,QAAQ;AACR;AACA,SAASD,GAAwBnB,GAAqB;AACpD,EAAAoB,KAAUpB;AACZ;AACA,eAAekB,GAAsBxL,GAAK;AACxC,SAAO,OAAO,MAAM,MAAMA,EAAI,QAAQ,SAAS,SAAS,EAAE,QAAQ,UAAU,UAAU,GAAG;AAAA,IACvF,SAAS,EAAE,QAAQ,yBAA0B;AAAA,EACjD,CAAG,GAAG,KAAI;AACV;AAGA,IAAI2L,KAAgB,CAAA;AACpB9M,GAAS8M,IAAe;AAAA,EACtB,QAAQ,MAAMC;AAAA,EACd,SAAS,MAAMC;AACjB,CAAC;AACD,SAASD,GAAO3wB,GAAK;AACnB,MAAI6wB,IAAQ;AACZ,WAASxM,IAAK,GAAGA,IAAKrkB,EAAI,QAAQqkB,KAAM;AACtC,UAAMyM,IAAS,SAAS9wB,EAAIqkB,CAAE,GAAG,EAAE;AACnC,QAAIyM,MAAW;AACb,MAAAD,KAAS;AAAA,SACJ;AACL,MAAAA,KAAS,KAAK,MAAMC,CAAM,IAAI;AAC9B;AAAA,IACD;AAAA,EACF;AACD,SAAOD;AACT;AACA,SAASD,GAAQG,GAAUC,GAAY;AACrC,MAAIH,IAAQ;AACZ,QAAMzM,IAAQ2M,GACRhc,IAAM,CAAC,SAAS8b,EAAM,SAAQ,GAAIG,EAAW,SAAQ,CAAE;AAE7D,OADA5M,EAAM,KAAK,KAAKrP,CAAG,OACN;AACX,UAAMkc,IAAM,KAAK,OAAM,oBAAI,KAAI,GAAG,QAAO,IAAK,GAAG;AAOjD,QANIA,MAAQ7M,EAAM,eAChByM,IAAQ,GACRzM,EAAM,aAAa6M,IAErBlc,EAAI,CAAC,KAAK,EAAE8b,GAAO,SAAQ,GAC3BzM,EAAM,KAAKqB,GAAarB,CAAK,GACzBuM,GAAOvM,EAAM,EAAE,KAAK4M;AACtB;AAAA,EAEH;AACD,SAAO5M;AACT;AAGA,IAAI8M,KAAgB,CAAA;AACpBtN,GAASsN,IAAe;AAAA,EACtB,mBAAmB,MAAMC;AAAA,EACzB,kBAAkB,MAAMC;AAAA,EACxB,yBAAyB,MAAMC;AACjC,CAAC;AACD,SAASF,GAAkBp4B,GAAGu4B,GAAUC,GAAUlmB,GAAY;AAC5D,SAAOya;AAAA,IACL;AAAA,MACE,MAAMoE;AAAA,MACN,MAAM,CAAC,GAAGnxB,EAAE,QAAQ,CAAA,GAAI,CAAC,KAAKu4B,EAAS,IAAIC,CAAQ,GAAG,CAAC,KAAKD,EAAS,MAAM,CAAC;AAAA,MAC5E,SAASv4B,EAAE,YAAY,KAAK,KAAK,KAAK,UAAUu4B,CAAQ;AAAA,MACxD,YAAYv4B,EAAE;AAAA,IACf;AAAA,IACDsS;AAAA,EACJ;AACA;AACA,SAASgmB,GAAwBjN,GAAO;AACtC,MAAIA,EAAM,SAAS8F;AACjB;AAEF,MAAIsH,GACAC;AACJ,WAASpN,IAAKD,EAAM,KAAK,SAAS,GAAGC,KAAM,MAAMmN,MAAa,UAAUC,MAAa,SAASpN,KAAM;AAClG,UAAMtP,IAAMqP,EAAM,KAAKC,CAAE;AACzB,IAAItP,EAAI,UAAU,MACZA,EAAI,CAAC,MAAM,OAAOyc,MAAa,SACjCA,IAAWzc,IACFA,EAAI,CAAC,MAAM,OAAO0c,MAAa,WACxCA,IAAW1c;AAAA,EAGhB;AACD,MAAIyc,MAAa;AAGjB,WAAO;AAAA,MACL,IAAIA,EAAS,CAAC;AAAA,MACd,QAAQ,CAACA,EAAS,CAAC,GAAGC,KAAA,gBAAAA,EAAW,EAAE,EAAE,OAAO,CAACjuB,MAAM,OAAOA,KAAM,QAAQ;AAAA,MACxE,QAAQiuB,KAAA,gBAAAA,EAAW;AAAA,IACvB;AACA;AACA,SAASL,GAAiBhN,GAAO,EAAE,kBAAAsN,EAAgB,IAAK,CAAA,GAAI;AAC1D,QAAMC,IAAUN,GAAwBjN,CAAK;AAC7C,MAAIuN,MAAY,UAAUvN,EAAM,YAAY;AAC1C;AAEF,MAAIwN;AACJ,MAAI;AACF,IAAAA,IAAgB,KAAK,MAAMxN,EAAM,OAAO;AAAA,EACzC,QAAe;AACd;AAAA,EACD;AACD,MAAIwN,EAAc,OAAOD,EAAQ,MAG7B,GAACD,KAAoB,CAAC3L,GAAY6L,CAAa;AAGnD,WAAOA;AACT;AAGA,IAAIC,KAAgB,CAAA;AACpBjO,GAASiO,IAAe;AAAA,EACtB,iBAAiB,MAAMC;AAAA,EACvB,OAAO,MAAMC;AAAA,EACb,MAAM,MAAMC;AACd,CAAC;AACD,IAAIF,KAAkB,IAAI,OAAO,UAAUlF,GAAa,MAAM,GAAG;AACjE,SAASoF,GAAKj7B,GAAO;AACnB,SAAO,OAAOA,KAAU,YAAY,IAAI,OAAO,IAAI+6B,GAAgB,MAAM,GAAG,EAAE,KAAK/6B,CAAK;AAC1F;AACA,SAASg7B,GAAOE,GAAK;AACnB,QAAMxC,IAAQwC,EAAI,MAAM,IAAI,OAAO,IAAIH,GAAgB,MAAM,GAAG,CAAC;AACjE,MAAI,CAACrC;AACH,UAAM,IAAI,MAAM,sBAAsBwC,CAAG,EAAE;AAC7C,SAAO;AAAA,IACL,KAAKxC,EAAM,CAAC;AAAA,IACZ,OAAOA,EAAM,CAAC;AAAA,IACd,SAAS1Y,GAAO0Y,EAAM,CAAC,CAAC;AAAA,EAC5B;AACA;AAGA,IAAIyC,KAAgB,CAAA;AACpBtO,GAASsO,IAAe;AAAA,EACtB,qBAAqB,MAAMC;AAAA,EAC3B,wBAAwB,MAAMC;AAChC,CAAC;AACD,SAASD,GAAoBp5B,GAAGs5B,GAAShnB,GAAY;AACnD,QAAMinB,IAAgBD,EAAQ,KAAK,OAAO,CAACtd,MAAQA,EAAI,UAAU,MAAMA,EAAI,CAAC,MAAM,OAAOA,EAAI,CAAC,MAAM,IAAI;AACxG,SAAO+Q;AAAA,IACL;AAAA,MACE,GAAG/sB;AAAA,MACH,MAAM6wB;AAAA,MACN,MAAM,CAAC,GAAG7wB,EAAE,QAAQ,CAAE,GAAE,GAAGu5B,GAAe,CAAC,KAAKD,EAAQ,EAAE,GAAG,CAAC,KAAKA,EAAQ,MAAM,CAAC;AAAA,MAClF,SAASt5B,EAAE,WAAW;AAAA,IACvB;AAAA,IACDsS;AAAA,EACJ;AACA;AACA,SAAS+mB,GAAuBhO,GAAO;AACrC,MAAIA,EAAM,SAASwF;AACjB;AAEF,MAAI4H,GACAC;AACJ,WAASpN,IAAKD,EAAM,KAAK,SAAS,GAAGC,KAAM,MAAMmN,MAAa,UAAUC,MAAa,SAASpN,KAAM;AAClG,UAAMtP,IAAMqP,EAAM,KAAKC,CAAE;AACzB,IAAItP,EAAI,UAAU,MACZA,EAAI,CAAC,MAAM,OAAOyc,MAAa,SACjCA,IAAWzc,IACFA,EAAI,CAAC,MAAM,OAAO0c,MAAa,WACxCA,IAAW1c;AAAA,EAGhB;AACD,MAAI,EAAAyc,MAAa,UAAUC,MAAa;AAGxC,WAAO;AAAA,MACL,IAAID,EAAS,CAAC;AAAA,MACd,QAAQ,CAACA,EAAS,CAAC,GAAGC,EAAS,CAAC,CAAC,EAAE,OAAO,CAACjuB,MAAMA,MAAM,MAAM;AAAA,MAC7D,QAAQiuB,EAAS,CAAC;AAAA,IACtB;AACA;AAGA,IAAIc,KAAgB,CAAA;AACpB3O,GAAS2O,IAAe;AAAA,EACtB,UAAU,MAAMC;AAAA,EAChB,OAAO,MAAMC;AAAA,EACb,YAAY,MAAMC;AACpB,CAAC;AACD,IAAID,KAAQ,MAAM,IAAI,OAAO,MAAMX,GAAgB,MAAM,OAAO,GAAG;AACnE,UAAUU,GAASG,GAAS;AAC1B,QAAMC,IAAUD,EAAQ,SAASF,GAAO,CAAA;AACxC,aAAWhD,KAASmD;AAClB,QAAI;AACF,YAAM,CAACX,GAAKl7B,CAAK,IAAI04B;AACrB,YAAM;AAAA,QACJ,KAAAwC;AAAA,QACA,OAAAl7B;AAAA,QACA,SAASggB,GAAOhgB,CAAK;AAAA,QACrB,OAAO04B,EAAM;AAAA,QACb,KAAKA,EAAM,QAAQwC,EAAI;AAAA,MAC/B;AAAA,IACK,QAAY;AAAA,IACZ;AAEL;AACA,SAASS,GAAWC,GAASE,GAAU;AACrC,SAAOF,EAAQ,WAAWF,GAAO,GAAE,CAACR,GAAKl7B,MAChC87B,EAAS;AAAA,IACd,KAAAZ;AAAA,IACA,OAAAl7B;AAAA,IACA,SAASggB,GAAOhgB,CAAK;AAAA,EAC3B,CAAK,CACF;AACH;AAGA,IAAI+7B,KAAgB,CAAA;AACpBlP,GAASkP,IAAe;AAAA,EACtB,oBAAoB,MAAMC;AAAA,EAC1B,yBAAyB,MAAMC;AAAA,EAC/B,qBAAqB,MAAMC;AAAA,EAC3B,sBAAsB,MAAMC;AAAA,EAC5B,sBAAsB,MAAMC;AAC9B,CAAC;AACD,IAAIJ,KAAqB,CAACh6B,GAAGsS,MAAe;AAC1C,MAAIsnB;AACJ,MAAI,OAAO55B,EAAE,WAAY;AACvB,IAAA45B,IAAU,KAAK,UAAU55B,EAAE,OAAO;AAAA,WACzB,OAAOA,EAAE,WAAY;AAC9B,IAAA45B,IAAU55B,EAAE;AAAA;AAEZ;AAEF,SAAO+sB;AAAA,IACL;AAAA,MACE,MAAMW;AAAA,MACN,MAAM,CAAC,GAAG1tB,EAAE,QAAQ,CAAA,CAAE;AAAA,MACtB,SAAA45B;AAAA,MACA,YAAY55B,EAAE;AAAA,IACf;AAAA,IACDsS;AAAA,EACJ;AACA,GACI6nB,KAAuB,CAACn6B,GAAGsS,MAAe;AAC5C,MAAIsnB;AACJ,MAAI,OAAO55B,EAAE,WAAY;AACvB,IAAA45B,IAAU,KAAK,UAAU55B,EAAE,OAAO;AAAA,WACzB,OAAOA,EAAE,WAAY;AAC9B,IAAA45B,IAAU55B,EAAE;AAAA;AAEZ;AAEF,SAAO+sB;AAAA,IACL;AAAA,MACE,MAAMc;AAAA,MACN,MAAM,CAAC,CAAC,KAAK7tB,EAAE,uBAAuB,GAAG,GAAGA,EAAE,QAAQ,EAAE;AAAA,MACxD,SAAA45B;AAAA,MACA,YAAY55B,EAAE;AAAA,IACf;AAAA,IACDsS;AAAA,EACJ;AACA,GACI4nB,KAAsB,CAACl6B,GAAGsS,MAAe;AAC3C,QAAM+nB,IAAO,CAAC,CAAC,KAAKr6B,EAAE,yBAAyBA,EAAE,WAAW,MAAM,CAAC;AACnE,SAAIA,EAAE,qCACJq6B,EAAK,KAAK,CAAC,KAAKr6B,EAAE,mCAAmCA,EAAE,WAAW,OAAO,CAAC,GAErE+sB;AAAA,IACL;AAAA,MACE,MAAMa;AAAA,MACN,MAAM,CAAC,GAAGyM,GAAM,GAAGr6B,EAAE,QAAQ,CAAA,CAAE;AAAA,MAC/B,SAASA,EAAE;AAAA,MACX,YAAYA,EAAE;AAAA,IACf;AAAA,IACDsS;AAAA,EACJ;AACA,GACI2nB,KAA0B,CAACj6B,GAAGsS,MAAe;AAC/C,MAAIsnB;AACJ,MAAI,OAAO55B,EAAE,WAAY;AACvB,IAAA45B,IAAU,KAAK,UAAU55B,EAAE,OAAO;AAAA,WACzB,OAAOA,EAAE,WAAY;AAC9B,IAAA45B,IAAU55B,EAAE;AAAA;AAEZ;AAEF,SAAO+sB;AAAA,IACL;AAAA,MACE,MAAMY;AAAA,MACN,MAAM,CAAC,CAAC,KAAK3tB,EAAE,wBAAwB,GAAG,GAAGA,EAAE,QAAQ,EAAE;AAAA,MACzD,SAAA45B;AAAA,MACA,YAAY55B,EAAE;AAAA,IACf;AAAA,IACDsS;AAAA,EACJ;AACA,GACI8nB,KAAuB,CAACp6B,GAAGsS,MAAe;AAC5C,MAAIsnB;AACJ,MAAI,OAAO55B,EAAE,WAAY;AACvB,IAAA45B,IAAU,KAAK,UAAU55B,EAAE,OAAO;AAAA,WACzB,OAAOA,EAAE,WAAY;AAC9B,IAAA45B,IAAU55B,EAAE;AAAA;AAEZ;AAEF,SAAO+sB;AAAA,IACL;AAAA,MACE,MAAMe;AAAA,MACN,MAAM,CAAC,CAAC,KAAK9tB,EAAE,cAAc,GAAG,GAAGA,EAAE,QAAQ,EAAE;AAAA,MAC/C,SAAA45B;AAAA,MACA,YAAY55B,EAAE;AAAA,IACf;AAAA,IACDsS;AAAA,EACJ;AACA,GAGIgoB,KAAgB,CAAA;AACpBzP,GAASyP,IAAe;AAAA,EACtB,uBAAuB,MAAMC;AAAA,EAC7B,UAAU,MAAMC;AAAA,EAChB,OAAO,MAAMC;AAAA,EACb,YAAY,MAAMC;AACpB,CAAC;AACD,IAAIH,KAAwB,WACxBE,KAAS,MAAM,IAAI,OAAO,MAAMF,GAAsB,MAAM,OAAO,GAAG;AAC1E,UAAUC,GAAUZ,GAAS;AAC3B,QAAMC,IAAUD,EAAQ,SAASa,GAAQ,CAAA;AACzC,aAAW/D,KAASmD;AAClB,QAAI;AACF,YAAM,CAACc,GAAW3P,CAAI,IAAI0L;AAC1B,YAAM;AAAA,QACJ,WAAAiE;AAAA,QACA,MAAA3P;AAAA,QACA,OAAO0L,EAAM;AAAA,QACb,KAAKA,EAAM,QAAQiE,EAAU;AAAA,MACrC;AAAA,IACK,QAAY;AAAA,IACZ;AAEL;AACA,SAASD,GAAYd,GAASE,GAAU;AACtC,SAAOF,EAAQ,WAAWa,GAAQ,GAAE,CAACE,GAAW3P,MACvC8O,EAAS;AAAA,IACd,WAAAa;AAAA,IACA,MAAA3P;AAAA,EACN,CAAK,CACF;AACH;AAGA,IAAI4P,KAAgB,CAAA;AACpB/P,GAAS+P,IAAe;AAAA,EACtB,wBAAwB,MAAMC;AAAA,EAC9B,gBAAgB,MAAMC;AACxB,CAAC;AACD,IAAIC;AACJ,IAAI;AACF,EAAAA,KAAU;AACZ,QAAQ;AACR;AACA,SAASF,GAAwBvE,GAAqB;AACpD,EAAAyE,KAAUzE;AACZ;AACA,eAAewE,GAAexH,GAAQ0H,GAAUC,GAAO;AACrD,MAAI;AAEF,WADU,OAAO,MAAMF,GAAQ,2BAA2BC,CAAQ,IAAIC,CAAK,MAAM,GAAG,KAAI,MACzE,4DAA4D3H,CAAM;AAAA,EAClF,QAAW;AACV,WAAO;AAAA,EACR;AACH;AAGA,IAAI4H,KAAgB,CAAA;AACpBrQ,GAASqQ,IAAe;AAAA,EACtB,SAAS,MAAMC;AAAA,EACf,SAAS,MAAMC;AAAA,EACf,oBAAoB,MAAMC;AAAA,EAC1B,IAAI,MAAMC;AACZ,CAAC;AASD,IAAIC,KAAmB,GACnBC,KAAmB;AACvB,SAASH,GAAmBI,GAAUC,GAAS;AAC7C,QAAMC,IAAUC,GAAW,gBAAgBH,GAAU,OAAOC,CAAO,EAAE,SAAS,GAAG,EAAE;AACnF,SAAOG,GAAaC,IAASH,GAAS,UAAU;AAClD;AACA,SAASI,GAAeC,GAAiBtV,GAAO;AAC9C,QAAMuV,IAAOC,GAAYJ,IAASE,GAAiBtV,GAAO,EAAE;AAC5D,SAAO;AAAA,IACL,YAAYuV,EAAK,SAAS,GAAG,EAAE;AAAA,IAC/B,cAAcA,EAAK,SAAS,IAAI,EAAE;AAAA,IAClC,UAAUA,EAAK,SAAS,IAAI,EAAE;AAAA,EAClC;AACA;AACA,SAASE,GAAc13B,GAAK;AAC1B,MAAI,CAAC,OAAO,cAAcA,CAAG,KAAKA,IAAM;AACtC,UAAM,IAAI,MAAM,2BAA2B;AAC7C,MAAIA,KAAO;AACT,WAAO;AACT,QAAM23B,IAAY,KAAK,KAAK,MAAM,KAAK,KAAK33B,IAAM,CAAC,CAAC,IAAI,GAClD43B,IAAQD,KAAa,MAAM,KAAKA,IAAY;AAClD,SAAOC,KAAS,KAAK,OAAO53B,IAAM,KAAK43B,CAAK,IAAI;AAClD;AACA,SAASC,GAAWn1B,GAAK;AACvB,MAAI,CAAC,OAAO,cAAcA,CAAG,KAAKA,IAAMo0B,MAAoBp0B,IAAMq0B;AAChE,UAAM,IAAI,MAAM,2DAA2D;AAC7E,QAAMl9B,IAAM,IAAI,WAAW,CAAC;AAC5B,aAAI,SAASA,EAAI,MAAM,EAAE,UAAU,GAAG6I,GAAK,EAAK,GACzC7I;AACT;AACA,SAAS8E,GAAIkhB,GAAW;AACtB,QAAMiY,IAAWxQ,GAAY,OAAOzH,CAAS,GACvCkY,IAAcD,EAAS,QACvB3lB,IAAS0lB,GAAWE,CAAW,GAC/BC,IAAS,IAAI,WAAWN,GAAcK,CAAW,IAAIA,CAAW;AACtE,SAAOE,GAAa9lB,GAAQ2lB,GAAUE,CAAM;AAC9C;AACA,SAASE,GAAMC,GAAQ;AACrB,QAAMJ,IAAc,IAAI,SAASI,EAAO,MAAM,EAAE,UAAU,CAAC,GACrDL,IAAWK,EAAO,SAAS,GAAG,IAAIJ,CAAW;AACnD,MAAIA,IAAcjB,MAAoBiB,IAAchB,MAAoBe,EAAS,WAAWC,KAAeI,EAAO,WAAW,IAAIT,GAAcK,CAAW;AACxJ,UAAM,IAAI,MAAM,iBAAiB;AACnC,SAAO1Q,GAAY,OAAOyQ,CAAQ;AACpC;AACA,SAASM,GAAQj/B,GAAKkc,GAASgjB,GAAK;AAClC,MAAIA,EAAI,WAAW;AACjB,UAAM,IAAI,MAAM,sCAAsC;AACxD,QAAMC,IAAWL,GAAaI,GAAKhjB,CAAO;AAC1C,SAAOD,GAAKiiB,IAASl+B,GAAKm/B,CAAQ;AACpC;AACA,SAASC,GAAcC,GAAS;AAC9B,MAAI,OAAOA,KAAY;AACrB,UAAM,IAAI,MAAM,gCAAgC;AAClD,QAAMC,IAAOD,EAAQ;AACrB,MAAIC,IAAO,OAAOA,IAAO;AACvB,UAAM,IAAI,MAAM,6BAA6BA,CAAI;AACnD,MAAID,EAAQ,CAAC,MAAM;AACjB,UAAM,IAAI,MAAM,4BAA4B;AAC9C,MAAIl6B;AACJ,MAAI;AACF,IAAAA,IAAOo6B,GAAQ,OAAOF,CAAO;AAAA,EAC9B,SAAQ7jB,GAAO;AACd,UAAM,IAAI,MAAM,qBAAqBA,EAAM,OAAO;AAAA,EACnD;AACD,QAAMgkB,IAAOr6B,EAAK;AAClB,MAAIq6B,IAAO,MAAMA,IAAO;AACtB,UAAM,IAAI,MAAM,0BAA0BA,CAAI;AAChD,QAAMC,IAAOt6B,EAAK,CAAC;AACnB,MAAIs6B,MAAS;AACX,UAAM,IAAI,MAAM,gCAAgCA,CAAI;AACtD,SAAO;AAAA,IACL,OAAOt6B,EAAK,SAAS,GAAG,EAAE;AAAA,IAC1B,YAAYA,EAAK,SAAS,IAAI,GAAG;AAAA,IACjC,KAAKA,EAAK,SAAS,GAAG;AAAA,EAC1B;AACA;AACA,SAASq4B,GAAS9W,GAAW0X,GAAiBtV,IAAQ4W,GAAa,EAAE,GAAG;AACtE,QAAM,EAAE,YAAAC,GAAY,cAAAC,GAAc,UAAAC,EAAU,IAAG1B,GAAeC,GAAiBtV,CAAK,GAC9EkW,IAASx5B,GAAIkhB,CAAS,GACtBa,IAAa4E,GAASwT,GAAYC,GAAcZ,CAAM,GACtDc,IAAMb,GAAQY,GAAUtY,GAAYuB,CAAK;AAC/C,SAAOyW,GAAQ,OAAOT,GAAa,IAAI,WAAW,CAAC,CAAC,CAAC,GAAGhW,GAAOvB,GAAYuY,CAAG,CAAC;AACjF;AACA,SAASvC,GAAS8B,GAASjB,GAAiB;AAC1C,QAAM,EAAE,OAAAtV,GAAO,YAAAvB,GAAY,KAAAuY,EAAG,IAAKV,GAAcC,CAAO,GAClD,EAAE,YAAAM,GAAY,cAAAC,GAAc,UAAAC,EAAU,IAAG1B,GAAeC,GAAiBtV,CAAK,GAC9EiX,IAAgBd,GAAQY,GAAUtY,GAAYuB,CAAK;AACzD,MAAI,CAACve,GAAWw1B,GAAeD,CAAG;AAChC,UAAM,IAAI,MAAM,aAAa;AAC/B,QAAMd,IAAS7S,GAASwT,GAAYC,GAAcrY,CAAU;AAC5D,SAAOwX,GAAMC,CAAM;AACrB;AACA,IAAItB,KAAK;AAAA,EACP,OAAO;AAAA,IACL,oBAAAD;AAAA,IACA,eAAAc;AAAA,EACD;AAAA,EACD,SAASf;AAAA,EACT,SAASD;AACX,GAGIyC,KAAgB,CAAA;AACpB/S,GAAS+S,IAAe;AAAA,EACtB,qBAAqB,MAAMC;AAAA,EAC3B,uBAAuB,MAAMC;AAC/B,CAAC;AACD,SAASA,GAAsBC,GAAkB;AAC/C,QAAM,EAAE,UAAAC,GAAU,cAAAC,EAAY,IAAK,IAAI,IAAIF,CAAgB,GACrDzK,IAAS0K,GACTE,IAAQD,EAAa,IAAI,OAAO,GAChCE,IAASF,EAAa,IAAI,QAAQ;AACxC,MAAI,CAAC3K,KAAU,CAAC4K,KAAS,CAACC;AACxB,UAAM,IAAI,MAAM,2BAA2B;AAE7C,SAAO,EAAE,QAAA7K,GAAQ,OAAA4K,GAAO,QAAAC;AAC1B;AACA,eAAeN,GAAoBvK,GAAQ7G,GAAW2R,GAAS;AAO7D,QAAMC,IAAmB,MAAMta,GAAQ0I,GAAW6G,GAAQ,KAAK,UAN/C;AAAA,IACd,QAAQ;AAAA,IACR,QAAQ;AAAA,MACN,SAAA8K;AAAA,IACD;AAAA,EACL,CACkF,CAAC,GAC3EE,IAAgB;AAAA,IACpB,MAAMjO;AAAA,IACN,YAAY,KAAK,MAAM,KAAK,IAAG,IAAK,GAAG;AAAA,IACvC,SAASgO;AAAA,IACT,MAAM,CAAC,CAAC,KAAK/K,CAAM,CAAC;AAAA,EACxB;AACE,SAAOvG,GAAcuR,GAAe7R,CAAS;AAC/C;AAGA,IAAI8R,KAAgB,CAAA;AACpB1T,GAAS0T,IAAe;AAAA,EACtB,gBAAgB,MAAMC;AAAA,EACtB,gBAAgB,MAAMC;AAAA,EACtB,gBAAgB,MAAMC;AAAA,EACtB,wBAAwB,MAAMC;AAAA,EAC9B,oBAAoB,MAAMC;AAC5B,CAAC;AAED,IAAIC;AACJ,IAAI;AACF,EAAAA,KAAU;AACZ,QAAQ;AACR;AACA,SAASF,GAAwBrI,GAAqB;AACpD,EAAAuI,KAAUvI;AACZ;AACA,eAAekI,GAAeM,GAAU;AACtC,MAAI;AACF,QAAIC,IAAQ,IACR,EAAE,OAAAC,GAAO,OAAAC,EAAO,IAAG,KAAK,MAAMH,EAAS,OAAO;AAClD,QAAIE,GAAO;AACT,UAAI,EAAE,OAAAze,EAAK,IAAK2e,GAAQ,OAAOF,GAAO,GAAG,GACrCj8B,IAAOm8B,GAAQ,UAAU3e,CAAK;AAClC,MAAAwe,IAAQjT,GAAY,OAAO/oB,CAAI;AAAA,IAChC,WAAUk8B,GAAO;AAChB,UAAI,CAACjU,GAAMuL,CAAM,IAAI0I,EAAM,MAAM,GAAG;AACpC,MAAAF,IAAQ,IAAI,IAAI,uBAAuB/T,CAAI,IAAI,WAAWuL,CAAM,EAAE,EAAE,SAAQ;AAAA,IAClF;AACM,aAAO;AAGT,QAAI4I,IAAO,OADD,MAAMN,GAAQE,CAAK,GACR;AACrB,QAAII,EAAK,eAAeA,EAAK;AAC3B,aAAOA,EAAK;AAAA,EAEf,QAAa;AAAA,EACb;AACD,SAAO;AACT;AACA,SAAST,GAAe;AAAA,EACtB,SAAAzJ;AAAA,EACA,OAAA5J;AAAA,EACA,QAAA+T;AAAA,EACA,QAAAC;AAAA,EACA,SAAAC,IAAU;AACZ,GAAG;AACD,MAAI,CAACF;AACH,UAAM,IAAI,MAAM,kBAAkB;AACpC,MAAI,CAACnK;AACH,UAAM,IAAI,MAAM,mBAAmB;AACrC,MAAIsK,IAAK;AAAA,IACP,MAAM;AAAA,IACN,YAAY,KAAK,MAAM,KAAK,IAAG,IAAK,GAAG;AAAA,IACvC,SAASD;AAAA,IACT,MAAM;AAAA,MACJ,CAAC,KAAKrK,CAAO;AAAA,MACb,CAAC,UAAUmK,EAAO,UAAU;AAAA,MAC5B,CAAC,UAAU,GAAGC,CAAM;AAAA,IACrB;AAAA,EACL;AACE,SAAIhU,KACFkU,EAAG,KAAK,KAAK,CAAC,KAAKlU,CAAK,CAAC,GAEpBkU;AACT;AACA,SAASX,GAAmBY,GAAkB;AAC5C,MAAIC;AACJ,MAAI;AACF,IAAAA,IAAa,KAAK,MAAMD,CAAgB;AAAA,EACzC,QAAa;AACZ,WAAO;AAAA,EACR;AACD,MAAI,CAACpU,GAAcqU,CAAU;AAC3B,WAAO;AACT,MAAI,CAACzS,GAAYyS,CAAU;AACzB,WAAO;AACT,MAAIjiC,IAAIiiC,EAAW,KAAK,KAAK,CAAC,CAACz/B,GAAGjC,CAAC,MAAMiC,MAAM,OAAOjC,CAAC;AACvD,MAAI,CAACP;AACH,WAAO;AACT,MAAI,CAACA,EAAE,CAAC,EAAE,MAAM,gBAAgB;AAC9B,WAAO;AACT,MAAI0K,IAAIu3B,EAAW,KAAK,KAAK,CAAC,CAACz/B,GAAGjC,CAAC,MAAMiC,MAAM,OAAOjC,CAAC;AACvD,SAAImK,KAAK,CAACA,EAAE,CAAC,EAAE,MAAM,gBAAgB,IAC5B,0CACIu3B,EAAW,KAAK,KAAK,CAAC,CAACz/B,GAAGjC,CAAC,MAAMiC,MAAM,YAAYjC,CAAC,IAG1D,OADE;AAEX;AACA,SAAS0gC,GAAe;AAAA,EACtB,YAAAgB;AAAA,EACA,UAAAC;AAAA,EACA,QAAAC;AAAA,EACA,QAAAC;AACF,GAAG;AACD,MAAIL,IAAK,KAAK,MAAME,CAAU,GAC1BI,IAAqBN,EAAG,KAAK,OAAO,CAAC,CAACv/B,CAAC,MAAMA,MAAM,OAAOA,MAAM,OAAOA,MAAM,GAAG,GAChF8/B,IAAM;AAAA,IACR,MAAM;AAAA,IACN,YAAY,KAAK,MAAMF,EAAO,QAAO,IAAK,GAAG;AAAA,IAC7C,SAAS;AAAA,IACT,MAAM,CAAC,GAAGC,GAAoB,CAAC,KAAKN,EAAG,MAAM,GAAG,CAAC,UAAUI,CAAM,GAAG,CAAC,eAAeF,CAAU,CAAC;AAAA,EACnG;AACE,SAAIC,KACFI,EAAI,KAAK,KAAK,CAAC,YAAYJ,CAAQ,CAAC,GAE/BI;AACT;AAGA,IAAIC,KAAgB,CAAA;AACpBlV,GAASkV,IAAe;AAAA,EACtB,UAAU,MAAMC;AAAA,EAChB,aAAa,MAAMC;AAAA,EACnB,sBAAsB,MAAMC;AAAA,EAC5B,eAAe,MAAMC;AAAA,EACrB,mBAAmB,MAAMC;AAAA,EACzB,wBAAwB,MAAMC;AAAA,EAC9B,yBAAyB,MAAMC;AAAA,EAC/B,wBAAwB,MAAMC;AAAA,EAC9B,qBAAqB,MAAMC;AAAA,EAC3B,eAAe,MAAMC;AACvB,CAAC;AAID,IAAIC,KAAuB;AAC3B,eAAeV,GAASW,GAAUC,GAAYjoB,GAAMkoB,IAA6B,IAAO5D,GAAS;AAC/F,QAAM5R,IAAQ;AAAA,IACZ,MAAM+D;AAAA,IACN,MAAM;AAAA,MACJ,CAAC,KAAKuR,CAAQ;AAAA,MACd,CAAC,UAAUC,CAAU;AAAA,IACtB;AAAA,IACD,YAAY,KAAK,OAAM,oBAAI,KAAI,GAAG,QAAS,IAAG,GAAG;AAAA,IACjD,SAAS;AAAA,EACb;AACE,EAAI3D,KACF5R,EAAM,KAAK,KAAK,CAAC,WAAW4U,GAAYhD,CAAO,CAAC,CAAC;AAEnD,QAAM6D,IAAc,MAAMnoB,EAAK0S,CAAK;AAEpC,UAD4BwV,IAA6BH,KAAuB,MACnDK,GAAQ,OAAOhV,GAAY,OAAO,KAAK,UAAU+U,CAAW,CAAC,CAAC;AAC7F;AACA,eAAeL,GAAcO,GAAOhV,GAAKiV,GAAQ;AAC/C,QAAM5V,IAAQ,MAAM6U,GAAqBc,CAAK,EAAE,MAAM,CAAC5nB,MAAU;AAC/D,UAAMA;AAAA,EACV,CAAG;AAID,SAHc,MAAM+mB,GAAe9U,GAAOW,GAAKiV,CAAM,EAAE,MAAM,CAAC7nB,MAAU;AACtE,UAAMA;AAAA,EACV,CAAG;AAEH;AACA,eAAe8mB,GAAqBc,GAAO;AACzC,MAAI,CAACA;AACH,UAAM,IAAI,MAAM,eAAe;AAEjC,EAAAA,IAAQA,EAAM,QAAQN,IAAsB,EAAE;AAC9C,QAAMQ,IAAWpV,GAAY,OAAOiV,GAAQ,OAAOC,CAAK,CAAC;AACzD,MAAI,CAACE,KAAYA,EAAS,WAAW,KAAK,CAACA,EAAS,WAAW,GAAG;AAChE,UAAM,IAAI,MAAM,eAAe;AAGjC,SADc,KAAK,MAAMA,CAAQ;AAEnC;AACA,SAASX,GAAuBlV,GAAO;AACrC,SAAKA,EAAM,aAGJ,KAAK,OAAM,oBAAI,QAAO,YAAY,GAAG,IAAIA,EAAM,aAAa,KAF1D;AAGX;AACA,SAAS+U,GAAkB/U,GAAO;AAChC,SAAOA,EAAM,SAAS+D;AACxB;AACA,SAASoR,GAAoBnV,GAAOW,GAAK;AACvC,QAAMmV,IAAS9V,EAAM,KAAK,KAAK,CAACrrB,MAAMA,EAAE,CAAC,MAAM,GAAG;AAClD,SAAKmhC,IAGEA,EAAO,SAAS,KAAKA,EAAO,CAAC,MAAMnV,IAFjC;AAGX;AACA,SAASqU,GAAuBhV,GAAO4V,GAAQ;AAC7C,QAAMG,IAAY/V,EAAM,KAAK,KAAK,CAACrrB,MAAMA,EAAE,CAAC,MAAM,QAAQ;AAC1D,SAAKohC,IAGEA,EAAU,SAAS,KAAKA,EAAU,CAAC,EAAE,YAAa,MAAKH,EAAO,gBAF5D;AAGX;AACA,SAAShB,GAAYhD,GAAS;AAC5B,QAAMp7B,IAAOw/B,GAAQtV,GAAY,OAAO,KAAK,UAAUkR,CAAO,CAAC,CAAC;AAChE,SAAOqE,GAAYz/B,CAAI;AACzB;AACA,SAASy+B,GAAwBjV,GAAO4R,GAAS;AAC/C,QAAMsE,IAAalW,EAAM,KAAK,KAAK,CAACrrB,MAAMA,EAAE,CAAC,MAAM,SAAS;AAC5D,MAAI,CAACuhC;AACH,WAAO;AAET,QAAMC,IAAcvB,GAAYhD,CAAO;AACvC,SAAOsE,EAAW,SAAS,KAAKA,EAAW,CAAC,MAAMC;AACpD;AACA,eAAerB,GAAe9U,GAAOW,GAAKiV,GAAQ9B,GAAM;AACtD,MAAI,CAACnS,GAAY3B,CAAK;AACpB,UAAM,IAAI,MAAM,wCAAwC;AAE1D,MAAI,CAAC+U,GAAkB/U,CAAK;AAC1B,UAAM,IAAI,MAAM,mCAAmC;AAErD,MAAI,CAACkV,GAAuBlV,CAAK;AAC/B,UAAM,IAAI,MAAM,mDAAmD;AAErE,MAAI,CAACmV,GAAoBnV,GAAOW,CAAG;AACjC,UAAM,IAAI,MAAM,sCAAsC;AAExD,MAAI,CAACqU,GAAuBhV,GAAO4V,CAAM;AACvC,UAAM,IAAI,MAAM,yCAAyC;AAE3D,MAAY9B,KAAS,OAAOA,KAAS,YAAY,OAAO,KAAKA,CAAI,EAAE,SAAS,KACtE,CAACmB,GAAwBjV,GAAO8T,CAAI;AACtC,UAAM,IAAI,MAAM,mEAAmE;AAGvF,SAAO;AACT;AC1pEA,IAAIsC,IAAcC;AAClBD,KAAe,OAAO,UAAUC,KAAgB,OAAO;A3BDvD,IAAAjqC,IAAAK,IAAA6pC,IAAAC;A2B6BI,MAAMC,KAAN,MAAMA,GAAK;AAAA,EAEb,YAAYz1B,GAAI;AAFd,IAAAvT,EAAA,MAAA8oC;AACF,IAAAjqC,EAAA;AAgEA,IAAAA,EAAA,MAACD,IAAiB;AA9DhB,SAAK,QAAQ2U,KAAO,oBAAI,IAAG;AAAA,EAC5B;AAAA,EACD,IAAI,OAAO;AACT,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EACD,IAAIif,GAAO;AACT,IAAA/tB,EAAA,MAAKqkC,IAAAC,IAAL,WAAuBvW;AACvB,eAAWnjB,KAAK,MAAK;AACnB,UAAI25B,GAAK,QAAQ35B,GAAGmjB,CAAK,KAAKwW,GAAK,SAAS35B,GAAGmjB,CAAK;AAClD,eAAO;AACF,MAAIwW,GAAK,SAASxW,GAAOnjB,CAAC,KAC/B,KAAK,OAAOA,CAAC;AAAA,IAEhB;AACD,gBAAK,MAAM,IAAImjB,EAAM,IAAIA,CAAK,GACvB;AAAA,EACR;AAAA,EAaD,QAAQ;AACN,SAAK,MAAM;EACZ;AAAA,EACD,OAAOA,GAAO;AACZ,WAAO,KAAK,MAAM,OAAOA,EAAM,EAAE;AAAA,EAClC;AAAA,EACD,QAAQyW,GAAYC,GAAS;AAC3B,WAAO,KAAK,MAAM,QAAQ,CAAC1W,GAAO2W,MAAMF,EAAWzW,GAAOA,GAAO,IAAI,GAAG0W,CAAO;AAAA,EAChF;AAAA,EACD,IAAI1W,GAAO;AACT,WAAO,KAAK,MAAM,IAAIA,EAAM,EAAE;AAAA,EAC/B;AAAA,EACD,CAAC,UAAU;AACT,eAAWA,KAAS,KAAK;AACvB,YAAM;AAAA,QACJA;AAAA,QACAA;AAAA,MACR;AAAA,EAEG;AAAA,EACD,OAAO;AACL,WAAO,KAAK;EACb;AAAA,EACD,CAAC,SAAS;AACR,eAAWA,KAASwW,GAAK,WAAW;AAAA,MAClC,GAAG,KAAK,MAAM,OAAQ;AAAA,IAC5B,CAAK;AACC,YAAMxW;AAAA,EAET;AAAA,EACD,EAACoW,KAAAA,IAGAhqC,KAAAiqC,IAHAD,GAAY,IAAI;AACf,WAAO,KAAK;EACb;AAAA;AAAA,EAEoN,OAAO,cAAcxP,GAAM;AAC9O,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACN,EAAM,SAASA,CAAI,KAAK,OAASA,KAAQA,IAAO;AAAA,EAC7C;AAAA;AAAA,EACsO,OAAO,2BAA2BA,GAAM;AAC7Q,WAAO,OAASA,KAAQA,IAAO;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKG,OAAO,SAAS5G,GAAOP,GAAQ;A3B5GrC,QAAArzB,GAAAK;A2B6GI,UAAM,EAAE,MAAAm6B,GAAM,QAAAqB,EAAQ,IAAGjI;AACzB,QAAIwW,GAAK,cAAc5P,CAAI;AACzB,aAAOA,MAASnH,EAAO,QAAQwI,MAAWxI,EAAO,UAAU+W,GAAK,WAAW;AAAA,QACzExW;AAAA,QACAP;AAAA,MACR,CAAO,EAAE,CAAC,MAAMO;AAEZ,QAAIwW,GAAK,2BAA2B5P,CAAI,GAAG;AACzC,YAAMgQ,MAAKxqC,IAAA4zB,EAAM,KAAK,KAAK,CAAC,CAACL,CAAI,MAAIA,MAAS,GAAG,MAAtC,gBAAAvzB,EAA0C,OAAM,IACrDyqC,MAAKpqC,IAAAgzB,EAAO,KAAK,KAAK,CAAC,CAACE,CAAI,MAAIA,MAAS,GAAG,MAAvC,gBAAAlzB,EAA2C,OAAM;AAC5D,aAAOm6B,MAASnH,EAAO,QAAQwI,MAAWxI,EAAO,UAAU+W,GAAK,WAAW;AAAA,QACzExW;AAAA,QACAP;AAAA,MACD,CAAA,EAAE,CAAC,MAAMO,KAAS4W,MAAOC;AAAA,IAC3B;AACD,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKG,OAAO,QAAQ7W,GAAOP,GAAQ;AAChC,UAAM,EAAE,MAAAmH,GAAM,QAAAqB,GAAQ,MAAA+G,EAAI,IAAKhP;AAC/B,QAAI4G,MAAS,KAAKqB,MAAWxI,EAAO;AAClC,iBAAW,CAACE,GAAMhtB,CAAK,KAAKq8B;AAC1B,YAAIrP,MAAS,OAAOhtB,MAAU8sB,EAAO;AACnC,iBAAO;AAAA;AAIb,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKG,OAAO,WAAWqX,GAAQ;AAC5B,WAAOA,EAAO,KAAK,CAAC7/B,GAAGhB,MACjBgB,EAAE,eAAehB,EAAE,aACdA,EAAE,aAAagB,EAAE,aAEnBA,EAAE,GAAG,cAAchB,EAAE,EAAE,CAC/B;AAAA,EACF;AAAA,EACD,MAAM8gC,GAAQ;AACZ,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AAAA,EACD,aAAaA,GAAQ;AACnB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AAAA,EACD,WAAWA,GAAQ;AACjB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AAAA,EACD,oBAAoBA,GAAQ;AAC1B,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AAAA,EACD,WAAWA,GAAQ;AACjB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AAAA,EACD,aAAaA,GAAQ;AACnB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AAAA,EACD,eAAeA,GAAQ;AACrB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC1C;AACH;AAjJIT,KAAA,eAoBFC,KAAiB,SAACvW,GAAO;AACvB,MAAIA,EAAM,SAAS;AACjB,eAAWrP,KAAOqP,EAAM;AACtB,UAAIrP,EAAI,CAAC,MAAM,KAAK;AAClB,cAAM9T,IAAI,KAAK,MAAM,IAAI8T,EAAI,CAAC,CAAC;AAC/B,QAAI9T,KAAKA,EAAE,WAAWmjB,EAAM,UAC1B,KAAK,OAAOnjB,CAAC;AAAA,MAEhB;AAAA;AAGN;AA/BC,IAAMm6B,KAANR;AC5BJ,IAAIJ;AAIJA,KAAe,OAAO;A5BLtB,IAAAhqC,IAAAK;A4B0BI,MAAMwqC,YAAexqC,KAAAuqC,IA+BtBZ,KAAAA,IA/BsB3pC,IAAK;AAAA,EAC5B,eAAeglB,GAAK;AAClB,UAAM,IAAIrb,GAAS,GAAGqb,CAAI,CAAC;AA6B7B,IAAAplB,EAAA,MAAC+pC,IAAgB;AAAA,EA5BhB;AAAA,EACD,MAAM,MAAMpW,GAAO;AACjB,SAAK,IAAIA,CAAK;AAAA,EACf;AAAA,EACD,MAAM,MAAMkH,GAAS;AACnB,UAAM4P,IAAS,CAAA;AACf,eAAW9W,KAAS;AAClB,MAAIiH,GAAaC,GAASlH,CAAK,MAC7B,KAAK,MAAM,IAAIA,EAAM,EAAE,GACvB8W,EAAO,KAAK9W,CAAK;AAGrB,WAAO8W;AAAA,EACR;AAAA,EACD,MAAM,OAAO5P,GAAS;AACpB,eAAWlH,KAAS;AAClB,MAAIiH,GAAaC,GAASlH,CAAK,KAC7B,KAAK,OAAOA,CAAK;AAAA,EAGtB;AAAA,EACD,MAAM,MAAMkH,GAAS;AAEnB,WAAO;AAAA,MACL,QAFa,MAAM,KAAK,MAAMA,CAAO,GAEvB;AAAA,MACd,aAAa;AAAA,IACnB;AAAA,EACG;AAEH;AC1DA,IAAIgQ;AAAA,CACH,SAAUA,GAAM;AACb,EAAAA,EAAK,cAAc,CAACrjC,MAAQA;AAC5B,WAASsjC,EAASC,GAAM;AAAA,EAAG;AAC3B,EAAAF,EAAK,WAAWC;AAChB,WAASE,EAAYC,GAAI;AACrB,UAAM,IAAI,MAAK;AAAA,EAClB;AACD,EAAAJ,EAAK,cAAcG,GACnBH,EAAK,cAAc,CAACK,MAAU;AAC1B,UAAMzX,IAAM,CAAA;AACZ,eAAW7c,KAAQs0B;AACf,MAAAzX,EAAI7c,CAAI,IAAIA;AAEhB,WAAO6c;AAAA,EACf,GACIoX,EAAK,qBAAqB,CAACpX,MAAQ;AAC/B,UAAM0X,IAAYN,EAAK,WAAWpX,CAAG,EAAE,OAAO,CAAC1tB,MAAM,OAAO0tB,EAAIA,EAAI1tB,CAAC,CAAC,KAAM,QAAQ,GAC9EqlC,IAAW,CAAA;AACjB,eAAWrlC,KAAKolC;AACZ,MAAAC,EAASrlC,CAAC,IAAI0tB,EAAI1tB,CAAC;AAEvB,WAAO8kC,EAAK,aAAaO,CAAQ;AAAA,EACzC,GACIP,EAAK,eAAe,CAACpX,MACVoX,EAAK,WAAWpX,CAAG,EAAE,IAAI,SAAUjjB,GAAG;AACzC,WAAOijB,EAAIjjB,CAAC;AAAA,EACxB,CAAS,GAELq6B,EAAK,aAAa,OAAO,OAAO,QAAS,aACnC,CAACpX,MAAQ,OAAO,KAAKA,CAAG,IACxB,CAAC5hB,MAAW;AACV,UAAM0yB,IAAO,CAAA;AACb,eAAWr+B,KAAO2L;AACd,MAAI,OAAO,UAAU,eAAe,KAAKA,GAAQ3L,CAAG,KAChDq+B,EAAK,KAAKr+B,CAAG;AAGrB,WAAOq+B;AAAA,EACnB,GACIsG,EAAK,OAAO,CAACjkC,GAAKykC,MAAY;AAC1B,eAAWz0B,KAAQhQ;AACf,UAAIykC,EAAQz0B,CAAI;AACZ,eAAOA;AAAA,EAGvB,GACIi0B,EAAK,YAAY,OAAO,OAAO,aAAc,aACvC,CAACrjC,MAAQ,OAAO,UAAUA,CAAG,IAC7B,CAACA,MAAQ,OAAOA,KAAQ,YAAY,SAASA,CAAG,KAAK,KAAK,MAAMA,CAAG,MAAMA;AAC/E,WAAS8jC,EAAW17B,GAAOgX,IAAY,OAAO;AAC1C,WAAOhX,EACF,IAAI,CAACpI,MAAS,OAAOA,KAAQ,WAAW,IAAIA,CAAG,MAAMA,CAAI,EACzD,KAAKof,CAAS;AAAA,EACtB;AACD,EAAAikB,EAAK,aAAaS,GAClBT,EAAK,wBAAwB,CAAC5qC,GAAGqG,MACzB,OAAOA,KAAU,WACVA,EAAM,aAEVA;AAEf,GAAGukC,OAASA,KAAO,CAAE,EAAC;AACtB,IAAIU;AAAA,CACH,SAAUA,GAAY;AACnB,EAAAA,EAAW,cAAc,CAACC,GAAOC,OACtB;AAAA,IACH,GAAGD;AAAA,IACH,GAAGC;AAAA;AAAA,EACf;AAEA,GAAGF,OAAeA,KAAa,CAAE,EAAC;AAClC,MAAMG,IAAgBb,GAAK,YAAY;AAAA,EACnC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC,GACKc,KAAgB,CAACtgC,MAAS;AAE5B,UADU,OAAOA,GACR;AAAA,IACL,KAAK;AACD,aAAOqgC,EAAc;AAAA,IACzB,KAAK;AACD,aAAOA,EAAc;AAAA,IACzB,KAAK;AACD,aAAO,MAAMrgC,CAAI,IAAIqgC,EAAc,MAAMA,EAAc;AAAA,IAC3D,KAAK;AACD,aAAOA,EAAc;AAAA,IACzB,KAAK;AACD,aAAOA,EAAc;AAAA,IACzB,KAAK;AACD,aAAOA,EAAc;AAAA,IACzB,KAAK;AACD,aAAOA,EAAc;AAAA,IACzB,KAAK;AACD,aAAI,MAAM,QAAQrgC,CAAI,IACXqgC,EAAc,QAErBrgC,MAAS,OACFqgC,EAAc,OAErBrgC,EAAK,QACL,OAAOA,EAAK,QAAS,cACrBA,EAAK,SACL,OAAOA,EAAK,SAAU,aACfqgC,EAAc,UAErB,OAAO,MAAQ,OAAergC,aAAgB,MACvCqgC,EAAc,MAErB,OAAO,MAAQ,OAAergC,aAAgB,MACvCqgC,EAAc,MAErB,OAAO,OAAS,OAAergC,aAAgB,OACxCqgC,EAAc,OAElBA,EAAc;AAAA,IACzB;AACI,aAAOA,EAAc;AAAA,EAC5B;AACL,GAEME,IAAef,GAAK,YAAY;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC,GACKgB,KAAgB,CAACpY,MACN,KAAK,UAAUA,GAAK,MAAM,CAAC,EAC5B,QAAQ,eAAe,KAAK;AAE5C,MAAMqY,WAAiB,MAAM;AAAA,EACzB,YAAYC,GAAQ;AAChB,aACA,KAAK,SAAS,IACd,KAAK,WAAW,CAACC,MAAQ;AACrB,WAAK,SAAS,CAAC,GAAG,KAAK,QAAQA,CAAG;AAAA,IAC9C,GACQ,KAAK,YAAY,CAACC,IAAO,OAAO;AAC5B,WAAK,SAAS,CAAC,GAAG,KAAK,QAAQ,GAAGA,CAAI;AAAA,IAClD;AACQ,UAAMC,IAAc,WAAW;AAC/B,IAAI,OAAO,iBAEP,OAAO,eAAe,MAAMA,CAAW,IAGvC,KAAK,YAAYA,GAErB,KAAK,OAAO,YACZ,KAAK,SAASH;AAAA,EACjB;AAAA,EACD,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EACf;AAAA,EACD,OAAOI,GAAS;AACZ,UAAMC,IAASD,KACX,SAAUE,GAAO;AACb,aAAOA,EAAM;AAAA,IAC7B,GACcC,IAAc,EAAE,SAAS,CAAA,KACzBC,IAAe,CAAC7qB,MAAU;AAC5B,iBAAW2qB,KAAS3qB,EAAM;AACtB,YAAI2qB,EAAM,SAAS;AACf,UAAAA,EAAM,YAAY,IAAIE,CAAY;AAAA,iBAE7BF,EAAM,SAAS;AACpB,UAAAE,EAAaF,EAAM,eAAe;AAAA,iBAE7BA,EAAM,SAAS;AACpB,UAAAE,EAAaF,EAAM,cAAc;AAAA,iBAE5BA,EAAM,KAAK,WAAW;AAC3B,UAAAC,EAAY,QAAQ,KAAKF,EAAOC,CAAK,CAAC;AAAA,aAErC;AACD,cAAIG,IAAOF,GACPnmC,IAAI;AACR,iBAAOA,IAAIkmC,EAAM,KAAK,UAAQ;AAC1B,kBAAMI,IAAKJ,EAAM,KAAKlmC,CAAC;AAEvB,YADiBA,MAAMkmC,EAAM,KAAK,SAAS,KAYvCG,EAAKC,CAAE,IAAID,EAAKC,CAAE,KAAK,EAAE,SAAS,CAAA,KAClCD,EAAKC,CAAE,EAAE,QAAQ,KAAKL,EAAOC,CAAK,CAAC,KAXnCG,EAAKC,CAAE,IAAID,EAAKC,CAAE,KAAK,EAAE,SAAS,CAAA,KAatCD,IAAOA,EAAKC,CAAE,GACdtmC;AAAA,UACH;AAAA,QACJ;AAAA,IAEjB;AACQ,WAAAomC,EAAa,IAAI,GACVD;AAAA,EACV;AAAA,EACD,OAAO,OAAOhmC,GAAO;AACjB,QAAI,EAAEA,aAAiBwlC;AACnB,YAAM,IAAI,MAAM,mBAAmBxlC,CAAK,EAAE;AAAA,EAEjD;AAAA,EACD,WAAW;AACP,WAAO,KAAK;AAAA,EACf;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK,UAAU,KAAK,QAAQukC,GAAK,uBAAuB,CAAC;AAAA,EACnE;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK,OAAO,WAAW;AAAA,EACjC;AAAA,EACD,QAAQuB,IAAS,CAACC,MAAUA,EAAM,SAAS;AACvC,UAAMC,IAAc,CAAA,GACdI,IAAa,CAAA;AACnB,eAAWV,KAAO,KAAK;AACnB,MAAIA,EAAI,KAAK,SAAS,KAClBM,EAAYN,EAAI,KAAK,CAAC,CAAC,IAAIM,EAAYN,EAAI,KAAK,CAAC,CAAC,KAAK,CAAA,GACvDM,EAAYN,EAAI,KAAK,CAAC,CAAC,EAAE,KAAKI,EAAOJ,CAAG,CAAC,KAGzCU,EAAW,KAAKN,EAAOJ,CAAG,CAAC;AAGnC,WAAO,EAAE,YAAAU,GAAY,aAAAJ;EACxB;AAAA,EACD,IAAI,aAAa;AACb,WAAO,KAAK;EACf;AACL;AACAR,GAAS,SAAS,CAACC,MACD,IAAID,GAASC,CAAM;AAIrC,MAAMY,KAAW,CAACN,GAAOO,MAAS;AAC9B,MAAIxqB;AACJ,UAAQiqB,EAAM,MAAI;AAAA,IACd,KAAKT,EAAa;AACd,MAAIS,EAAM,aAAaX,EAAc,YACjCtpB,IAAU,aAGVA,IAAU,YAAYiqB,EAAM,QAAQ,cAAcA,EAAM,QAAQ;AAEpE;AAAA,IACJ,KAAKT,EAAa;AACd,MAAAxpB,IAAU,mCAAmC,KAAK,UAAUiqB,EAAM,UAAUxB,GAAK,qBAAqB,CAAC;AACvG;AAAA,IACJ,KAAKe,EAAa;AACd,MAAAxpB,IAAU,kCAAkCyoB,GAAK,WAAWwB,EAAM,MAAM,IAAI,CAAC;AAC7E;AAAA,IACJ,KAAKT,EAAa;AACd,MAAAxpB,IAAU;AACV;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAAxpB,IAAU,yCAAyCyoB,GAAK,WAAWwB,EAAM,OAAO,CAAC;AACjF;AAAA,IACJ,KAAKT,EAAa;AACd,MAAAxpB,IAAU,gCAAgCyoB,GAAK,WAAWwB,EAAM,OAAO,CAAC,eAAeA,EAAM,QAAQ;AACrG;AAAA,IACJ,KAAKT,EAAa;AACd,MAAAxpB,IAAU;AACV;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAAxpB,IAAU;AACV;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAAxpB,IAAU;AACV;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAI,OAAOS,EAAM,cAAe,WACxB,cAAcA,EAAM,cACpBjqB,IAAU,gCAAgCiqB,EAAM,WAAW,QAAQ,KAC/D,OAAOA,EAAM,WAAW,YAAa,aACrCjqB,IAAU,GAAGA,CAAO,sDAAsDiqB,EAAM,WAAW,QAAQ,OAGlG,gBAAgBA,EAAM,aAC3BjqB,IAAU,mCAAmCiqB,EAAM,WAAW,UAAU,MAEnE,cAAcA,EAAM,aACzBjqB,IAAU,iCAAiCiqB,EAAM,WAAW,QAAQ,MAGpExB,GAAK,YAAYwB,EAAM,UAAU,IAGhCA,EAAM,eAAe,UAC1BjqB,IAAU,WAAWiqB,EAAM,UAAU,KAGrCjqB,IAAU;AAEd;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAIS,EAAM,SAAS,UACfjqB,IAAU,sBAAsBiqB,EAAM,QAAQ,YAAYA,EAAM,YAAY,aAAa,WAAW,IAAIA,EAAM,OAAO,gBAChHA,EAAM,SAAS,WACpBjqB,IAAU,uBAAuBiqB,EAAM,QAAQ,YAAYA,EAAM,YAAY,aAAa,MAAM,IAAIA,EAAM,OAAO,kBAC5GA,EAAM,SAAS,WACpBjqB,IAAU,kBAAkBiqB,EAAM,QAC5B,sBACAA,EAAM,YACF,8BACA,eAAe,GAAGA,EAAM,OAAO,KACpCA,EAAM,SAAS,SACpBjqB,IAAU,gBAAgBiqB,EAAM,QAC1B,sBACAA,EAAM,YACF,8BACA,eAAe,GAAG,IAAI,KAAK,OAAOA,EAAM,OAAO,CAAC,CAAC,KAE3DjqB,IAAU;AACd;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAIS,EAAM,SAAS,UACfjqB,IAAU,sBAAsBiqB,EAAM,QAAQ,YAAYA,EAAM,YAAY,YAAY,WAAW,IAAIA,EAAM,OAAO,gBAC/GA,EAAM,SAAS,WACpBjqB,IAAU,uBAAuBiqB,EAAM,QAAQ,YAAYA,EAAM,YAAY,YAAY,OAAO,IAAIA,EAAM,OAAO,kBAC5GA,EAAM,SAAS,WACpBjqB,IAAU,kBAAkBiqB,EAAM,QAC5B,YACAA,EAAM,YACF,0BACA,WAAW,IAAIA,EAAM,OAAO,KACjCA,EAAM,SAAS,WACpBjqB,IAAU,kBAAkBiqB,EAAM,QAC5B,YACAA,EAAM,YACF,0BACA,WAAW,IAAIA,EAAM,OAAO,KACjCA,EAAM,SAAS,SACpBjqB,IAAU,gBAAgBiqB,EAAM,QAC1B,YACAA,EAAM,YACF,6BACA,cAAc,IAAI,IAAI,KAAK,OAAOA,EAAM,OAAO,CAAC,CAAC,KAE3DjqB,IAAU;AACd;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAAxpB,IAAU;AACV;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAAxpB,IAAU;AACV;AAAA,IACJ,KAAKwpB,EAAa;AACd,MAAAxpB,IAAU,gCAAgCiqB,EAAM,UAAU;AAC1D;AAAA,IACJ,KAAKT,EAAa;AACd,MAAAxpB,IAAU;AACV;AAAA,IACJ;AACI,MAAAA,IAAUwqB,EAAK,cACf/B,GAAK,YAAYwB,CAAK;AAAA,EAC7B;AACD,SAAO,EAAE,SAAAjqB,EAAO;AACpB;AAEA,IAAIyqB,KAAmBF;AACvB,SAASG,GAAYp4B,GAAK;AACtB,EAAAm4B,KAAmBn4B;AACvB;AACA,SAASq4B,KAAc;AACnB,SAAOF;AACX;AAEA,MAAMG,KAAY,CAAC3iB,MAAW;AAC1B,QAAM,EAAE,MAAAhf,GAAM,MAAA4hC,GAAM,WAAAC,GAAW,WAAAC,EAAS,IAAK9iB,GACvC+iB,IAAW,CAAC,GAAGH,GAAM,GAAIE,EAAU,QAAQ,CAAE,CAAC,GAC9CE,IAAY;AAAA,IACd,GAAGF;AAAA,IACH,MAAMC;AAAA,EACd;AACI,MAAID,EAAU,YAAY;AACtB,WAAO;AAAA,MACH,GAAGA;AAAA,MACH,MAAMC;AAAA,MACN,SAASD,EAAU;AAAA,IAC/B;AAEI,MAAIG,IAAe;AACnB,QAAMC,IAAOL,EACR,OAAO,CAAC/5B,MAAM,CAAC,CAACA,CAAC,EACjB,MAAO,EACP;AACL,aAAWuB,KAAO64B;AACd,IAAAD,IAAe54B,EAAI24B,GAAW,EAAE,MAAAhiC,GAAM,cAAciiC,EAAY,CAAE,EAAE;AAExE,SAAO;AAAA,IACH,GAAGH;AAAA,IACH,MAAMC;AAAA,IACN,SAASE;AAAA,EACjB;AACA,GACME,KAAa,CAAA;AACnB,SAASC,EAAkBC,GAAKP,GAAW;AACvC,QAAMQ,IAAcZ,MACdV,IAAQW,GAAU;AAAA,IACpB,WAAWG;AAAA,IACX,MAAMO,EAAI;AAAA,IACV,MAAMA,EAAI;AAAA,IACV,WAAW;AAAA,MACPA,EAAI,OAAO;AAAA,MACXA,EAAI;AAAA,MACJC;AAAA,MACAA,MAAgBhB,KAAW,SAAYA;AAAA;AAAA,IAC1C,EAAC,OAAO,CAAC55B,MAAM,CAAC,CAACA,CAAC;AAAA,EAC3B,CAAK;AACD,EAAA26B,EAAI,OAAO,OAAO,KAAKrB,CAAK;AAChC;AACA,MAAMuB,GAAY;AAAA,EACd,cAAc;AACV,SAAK,QAAQ;AAAA,EAChB;AAAA,EACD,QAAQ;AACJ,IAAI,KAAK,UAAU,YACf,KAAK,QAAQ;AAAA,EACpB;AAAA,EACD,QAAQ;AACJ,IAAI,KAAK,UAAU,cACf,KAAK,QAAQ;AAAA,EACpB;AAAA,EACD,OAAO,WAAW1mC,GAAQ2mC,GAAS;AAC/B,UAAMC,IAAa,CAAA;AACnB,eAAW,KAAKD,GAAS;AACrB,UAAI,EAAE,WAAW;AACb,eAAOE;AACX,MAAI,EAAE,WAAW,WACb7mC,EAAO,MAAK,GAChB4mC,EAAW,KAAK,EAAE,KAAK;AAAA,IAC1B;AACD,WAAO,EAAE,QAAQ5mC,EAAO,OAAO,OAAO4mC,EAAU;AAAA,EACnD;AAAA,EACD,aAAa,iBAAiB5mC,GAAQ8mC,GAAO;AACzC,UAAMC,IAAY,CAAA;AAClB,eAAWC,KAAQF,GAAO;AACtB,YAAM9nC,IAAM,MAAMgoC,EAAK,KACjB5nC,IAAQ,MAAM4nC,EAAK;AACzB,MAAAD,EAAU,KAAK;AAAA,QACX,KAAA/nC;AAAA,QACA,OAAAI;AAAA,MAChB,CAAa;AAAA,IACJ;AACD,WAAOsnC,GAAY,gBAAgB1mC,GAAQ+mC,CAAS;AAAA,EACvD;AAAA,EACD,OAAO,gBAAgB/mC,GAAQ8mC,GAAO;AAClC,UAAMG,IAAc,CAAA;AACpB,eAAWD,KAAQF,GAAO;AACtB,YAAM,EAAE,KAAA9nC,GAAK,OAAAI,EAAO,IAAG4nC;AAGvB,UAFIhoC,EAAI,WAAW,aAEfI,EAAM,WAAW;AACjB,eAAOynC;AACX,MAAI7nC,EAAI,WAAW,WACfgB,EAAO,MAAK,GACZZ,EAAM,WAAW,WACjBY,EAAO,MAAK,GACZhB,EAAI,UAAU,gBACb,OAAOI,EAAM,QAAU,OAAe4nC,EAAK,eAC5CC,EAAYjoC,EAAI,KAAK,IAAII,EAAM;AAAA,IAEtC;AACD,WAAO,EAAE,QAAQY,EAAO,OAAO,OAAOinC,EAAW;AAAA,EACpD;AACL;AACA,MAAMJ,IAAU,OAAO,OAAO;AAAA,EAC1B,QAAQ;AACZ,CAAC,GACKK,KAAQ,CAAC9nC,OAAW,EAAE,QAAQ,SAAS,OAAAA,EAAK,IAC5C+nC,KAAK,CAAC/nC,OAAW,EAAE,QAAQ,SAAS,OAAAA,EAAK,IACzCgoC,KAAY,CAACv7B,MAAMA,EAAE,WAAW,WAChCw7B,KAAU,CAACx7B,MAAMA,EAAE,WAAW,SAC9BwrB,KAAU,CAACxrB,MAAMA,EAAE,WAAW,SAC9By7B,KAAU,CAACz7B,MAAM,OAAO,UAAY,OAAeA,aAAa;AAiBtE,SAAS07B,GAAuBC,GAAUrhC,GAAOktB,GAAM3lB,GAAG;AAEtD,MAAI,OAAOvH,KAAU,aAAaqhC,MAAarhC,KAAS,CAACuH,IAAI,CAACvH,EAAM,IAAIqhC,CAAQ,EAAG,OAAM,IAAI,UAAU,0EAA0E;AACjL,SAA0ErhC,EAAM,IAAIqhC,CAAQ;AAChG;AAEA,SAASC,GAAuBD,GAAUrhC,GAAO/G,GAAOi0B,GAAM3lB,GAAG;AAG7D,MAAI,OAAOvH,KAAU,aAAaqhC,MAAarhC,KAAS,CAACuH,IAAI,CAACvH,EAAM,IAAIqhC,CAAQ,EAAG,OAAM,IAAI,UAAU,yEAAyE;AAChL,SAAuErhC,EAAM,IAAIqhC,GAAUpoC,CAAK,GAAIA;AACxG;AAOA,IAAIsoC;AAAA,CACH,SAAUA,GAAW;AAClB,EAAAA,EAAU,WAAW,CAACxsB,MAAY,OAAOA,KAAY,WAAW,EAAE,SAAAA,EAAO,IAAKA,KAAW,IACzFwsB,EAAU,WAAW,CAACxsB,MAAY,OAAOA,KAAY,WAAWA,IAAUA,KAAY,OAA6B,SAASA,EAAQ;AACxI,GAAGwsB,MAAcA,IAAY,CAAE,EAAC;AAEhC,IAAIC,IAAgBC;AACpB,MAAMC,GAAmB;AAAA,EACrB,YAAYC,GAAQ1oC,GAAO2mC,GAAM/mC,GAAK;AAClC,SAAK,cAAc,IACnB,KAAK,SAAS8oC,GACd,KAAK,OAAO1oC,GACZ,KAAK,QAAQ2mC,GACb,KAAK,OAAO/mC;AAAA,EACf;AAAA,EACD,IAAI,OAAO;AACP,WAAK,KAAK,YAAY,WACd,KAAK,gBAAgB,QACrB,KAAK,YAAY,KAAK,GAAG,KAAK,OAAO,GAAG,KAAK,IAAI,IAGjD,KAAK,YAAY,KAAK,GAAG,KAAK,OAAO,KAAK,IAAI,IAG/C,KAAK;AAAA,EACf;AACL;AACA,MAAM+oC,KAAe,CAACvB,GAAKh7B,MAAW;AAClC,MAAI6rB,GAAQ7rB,CAAM;AACd,WAAO,EAAE,SAAS,IAAM,MAAMA,EAAO,MAAK;AAG1C,MAAI,CAACg7B,EAAI,OAAO,OAAO;AACnB,UAAM,IAAI,MAAM,2CAA2C;AAE/D,SAAO;AAAA,IACH,SAAS;AAAA,IACT,IAAI,QAAQ;AACR,UAAI,KAAK;AACL,eAAO,KAAK;AAChB,YAAMhsB,IAAQ,IAAIoqB,GAAS4B,EAAI,OAAO,MAAM;AAC5C,kBAAK,SAAShsB,GACP,KAAK;AAAA,IACf;AAAA,EACb;AAEA;AACA,SAASwtB,EAAoB7kB,GAAQ;AACjC,MAAI,CAACA;AACD,WAAO;AACX,QAAM,EAAE,UAAAsiB,GAAU,oBAAAwC,GAAoB,gBAAAC,GAAgB,aAAAC,EAAW,IAAKhlB;AACtE,MAAIsiB,MAAawC,KAAsBC;AACnC,UAAM,IAAI,MAAM,0FAA0F;AAE9G,SAAIzC,IACO,EAAE,UAAUA,GAAU,aAAA0C,MAc1B,EAAE,UAbS,CAACC,GAAK5B,MAAQ;AAC5B,QAAI3tC,GAAIK;AACR,UAAM,EAAE,SAAAgiB,EAAS,IAAGiI;AACpB,WAAIilB,EAAI,SAAS,uBACN,EAAE,SAASltB,KAAmDsrB,EAAI,iBAEzE,OAAOA,EAAI,OAAS,MACb,EAAE,UAAU3tC,IAAKqiB,KAAmDgtB,OAAoB,QAAQrvC,MAAO,SAASA,IAAK2tC,EAAI,iBAEhI4B,EAAI,SAAS,iBACN,EAAE,SAAS5B,EAAI,iBACnB,EAAE,UAAUttC,IAAKgiB,KAAmD+sB,OAAwB,QAAQ/uC,MAAO,SAASA,IAAKstC,EAAI;EAC5I,GACkC,aAAA2B;AAClC;AACA,MAAME,GAAQ;AAAA,EACV,YAAYC,GAAK;AAEb,SAAK,MAAM,KAAK,gBAChB,KAAK,OAAOA,GACZ,KAAK,QAAQ,KAAK,MAAM,KAAK,IAAI,GACjC,KAAK,YAAY,KAAK,UAAU,KAAK,IAAI,GACzC,KAAK,aAAa,KAAK,WAAW,KAAK,IAAI,GAC3C,KAAK,iBAAiB,KAAK,eAAe,KAAK,IAAI,GACnD,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,GAC7B,KAAK,SAAS,KAAK,OAAO,KAAK,IAAI,GACnC,KAAK,aAAa,KAAK,WAAW,KAAK,IAAI,GAC3C,KAAK,cAAc,KAAK,YAAY,KAAK,IAAI,GAC7C,KAAK,WAAW,KAAK,SAAS,KAAK,IAAI,GACvC,KAAK,WAAW,KAAK,SAAS,KAAK,IAAI,GACvC,KAAK,UAAU,KAAK,QAAQ,KAAK,IAAI,GACrC,KAAK,QAAQ,KAAK,MAAM,KAAK,IAAI,GACjC,KAAK,UAAU,KAAK,QAAQ,KAAK,IAAI,GACrC,KAAK,KAAK,KAAK,GAAG,KAAK,IAAI,GAC3B,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,GAC7B,KAAK,YAAY,KAAK,UAAU,KAAK,IAAI,GACzC,KAAK,QAAQ,KAAK,MAAM,KAAK,IAAI,GACjC,KAAK,UAAU,KAAK,QAAQ,KAAK,IAAI,GACrC,KAAK,QAAQ,KAAK,MAAM,KAAK,IAAI,GACjC,KAAK,WAAW,KAAK,SAAS,KAAK,IAAI,GACvC,KAAK,OAAO,KAAK,KAAK,KAAK,IAAI,GAC/B,KAAK,WAAW,KAAK,SAAS,KAAK,IAAI,GACvC,KAAK,aAAa,KAAK,WAAW,KAAK,IAAI,GAC3C,KAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAAA,EAC9C;AAAA,EACD,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,SAAS/oB,GAAO;AACZ,WAAOklB,GAAcllB,EAAM,IAAI;AAAA,EAClC;AAAA,EACD,gBAAgBA,GAAOinB,GAAK;AACxB,WAAQA,KAAO;AAAA,MACX,QAAQjnB,EAAM,OAAO;AAAA,MACrB,MAAMA,EAAM;AAAA,MACZ,YAAYklB,GAAcllB,EAAM,IAAI;AAAA,MACpC,gBAAgB,KAAK,KAAK;AAAA,MAC1B,MAAMA,EAAM;AAAA,MACZ,QAAQA,EAAM;AAAA,IAC1B;AAAA,EACK;AAAA,EACD,oBAAoBA,GAAO;AACvB,WAAO;AAAA,MACH,QAAQ,IAAImnB,GAAa;AAAA,MACzB,KAAK;AAAA,QACD,QAAQnnB,EAAM,OAAO;AAAA,QACrB,MAAMA,EAAM;AAAA,QACZ,YAAYklB,GAAcllB,EAAM,IAAI;AAAA,QACpC,gBAAgB,KAAK,KAAK;AAAA,QAC1B,MAAMA,EAAM;AAAA,QACZ,QAAQA,EAAM;AAAA,MACjB;AAAA,IACb;AAAA,EACK;AAAA,EACD,WAAWA,GAAO;AACd,UAAM/T,IAAS,KAAK,OAAO+T,CAAK;AAChC,QAAI+nB,GAAQ97B,CAAM;AACd,YAAM,IAAI,MAAM,wCAAwC;AAE5D,WAAOA;AAAA,EACV;AAAA,EACD,YAAY+T,GAAO;AACf,UAAM/T,IAAS,KAAK,OAAO+T,CAAK;AAChC,WAAO,QAAQ,QAAQ/T,CAAM;AAAA,EAChC;AAAA,EACD,MAAMrH,GAAMgf,GAAQ;AAChB,UAAM3X,IAAS,KAAK,UAAUrH,GAAMgf,CAAM;AAC1C,QAAI3X,EAAO;AACP,aAAOA,EAAO;AAClB,UAAMA,EAAO;AAAA,EAChB;AAAA,EACD,UAAUrH,GAAMgf,GAAQ;AACpB,QAAItqB;AACJ,UAAM2tC,IAAM;AAAA,MACR,QAAQ;AAAA,QACJ,QAAQ,CAAE;AAAA,QACV,QAAQ3tC,IAAKsqB,KAAW,OAA4B,SAASA,EAAO,WAAW,QAAQtqB,MAAO,SAASA,IAAK;AAAA,QAC5G,oBAAoBsqB,KAAW,OAA4B,SAASA,EAAO;AAAA,MAC9E;AAAA,MACD,OAAOA,KAAW,OAA4B,SAASA,EAAO,SAAS,CAAE;AAAA,MACzE,gBAAgB,KAAK,KAAK;AAAA,MAC1B,QAAQ;AAAA,MACR,MAAAhf;AAAA,MACA,YAAYsgC,GAActgC,CAAI;AAAA,IAC1C,GACcqH,IAAS,KAAK,WAAW,EAAE,MAAArH,GAAM,MAAMqiC,EAAI,MAAM,QAAQA,EAAK,CAAA;AACpE,WAAOuB,GAAavB,GAAKh7B,CAAM;AAAA,EAClC;AAAA,EACD,MAAM,WAAWrH,GAAMgf,GAAQ;AAC3B,UAAM3X,IAAS,MAAM,KAAK,eAAerH,GAAMgf,CAAM;AACrD,QAAI3X,EAAO;AACP,aAAOA,EAAO;AAClB,UAAMA,EAAO;AAAA,EAChB;AAAA,EACD,MAAM,eAAerH,GAAMgf,GAAQ;AAC/B,UAAMqjB,IAAM;AAAA,MACR,QAAQ;AAAA,QACJ,QAAQ,CAAE;AAAA,QACV,oBAAoBrjB,KAAW,OAA4B,SAASA,EAAO;AAAA,QAC3E,OAAO;AAAA,MACV;AAAA,MACD,OAAOA,KAAW,OAA4B,SAASA,EAAO,SAAS,CAAE;AAAA,MACzE,gBAAgB,KAAK,KAAK;AAAA,MAC1B,QAAQ;AAAA,MACR,MAAAhf;AAAA,MACA,YAAYsgC,GAActgC,CAAI;AAAA,IAC1C,GACcokC,IAAmB,KAAK,OAAO,EAAE,MAAApkC,GAAM,MAAMqiC,EAAI,MAAM,QAAQA,EAAK,CAAA,GACpEh7B,IAAS,OAAO87B,GAAQiB,CAAgB,IACxCA,IACA,QAAQ,QAAQA,CAAgB;AACtC,WAAOR,GAAavB,GAAKh7B,CAAM;AAAA,EAClC;AAAA,EACD,OAAOg9B,GAAOttB,GAAS;AACnB,UAAMutB,IAAqB,CAACnoC,MACpB,OAAO4a,KAAY,YAAY,OAAOA,IAAY,MAC3C,EAAE,SAAAA,EAAO,IAEX,OAAOA,KAAY,aACjBA,EAAQ5a,CAAG,IAGX4a;AAGf,WAAO,KAAK,YAAY,CAAC5a,GAAKkmC,MAAQ;AAClC,YAAMh7B,IAASg9B,EAAMloC,CAAG,GAClBooC,IAAW,MAAMlC,EAAI,SAAS;AAAA,QAChC,MAAM9B,EAAa;AAAA,QACnB,GAAG+D,EAAmBnoC,CAAG;AAAA,MACzC,CAAa;AACD,aAAI,OAAO,UAAY,OAAekL,aAAkB,UAC7CA,EAAO,KAAK,CAACrH,MACXA,IAKM,MAJPukC,KACO,GAKd,IAEAl9B,IAKM,MAJPk9B,KACO;AAAA,IAKvB,CAAS;AAAA,EACJ;AAAA,EACD,WAAWF,GAAOG,GAAgB;AAC9B,WAAO,KAAK,YAAY,CAACroC,GAAKkmC,MACrBgC,EAAMloC,CAAG,IAOH,MANPkmC,EAAI,SAAS,OAAOmC,KAAmB,aACjCA,EAAeroC,GAAKkmC,CAAG,IACvBmC,CAAc,GACb,GAKd;AAAA,EACJ;AAAA,EACD,YAAYC,GAAY;AACpB,WAAO,IAAIC,GAAW;AAAA,MAClB,QAAQ;AAAA,MACR,UAAUC,EAAsB;AAAA,MAChC,QAAQ,EAAE,MAAM,cAAc,YAAAF,EAAY;AAAA,IACtD,CAAS;AAAA,EACJ;AAAA,EACD,YAAYA,GAAY;AACpB,WAAO,KAAK,YAAYA,CAAU;AAAA,EACrC;AAAA,EACD,WAAW;AACP,WAAOG,GAAY,OAAO,MAAM,KAAK,IAAI;AAAA,EAC5C;AAAA,EACD,WAAW;AACP,WAAOC,GAAY,OAAO,MAAM,KAAK,IAAI;AAAA,EAC5C;AAAA,EACD,UAAU;AACN,WAAO,KAAK,WAAW;EAC1B;AAAA,EACD,QAAQ;AACJ,WAAOC,GAAS,OAAO,MAAM,KAAK,IAAI;AAAA,EACzC;AAAA,EACD,UAAU;AACN,WAAOC,GAAW,OAAO,MAAM,KAAK,IAAI;AAAA,EAC3C;AAAA,EACD,GAAGC,GAAQ;AACP,WAAOC,GAAS,OAAO,CAAC,MAAMD,CAAM,GAAG,KAAK,IAAI;AAAA,EACnD;AAAA,EACD,IAAIE,GAAU;AACV,WAAOC,GAAgB,OAAO,MAAMD,GAAU,KAAK,IAAI;AAAA,EAC1D;AAAA,EACD,UAAUx4B,GAAW;AACjB,WAAO,IAAIg4B,GAAW;AAAA,MAClB,GAAGb,EAAoB,KAAK,IAAI;AAAA,MAChC,QAAQ;AAAA,MACR,UAAUc,EAAsB;AAAA,MAChC,QAAQ,EAAE,MAAM,aAAa,WAAAj4B,EAAW;AAAA,IACpD,CAAS;AAAA,EACJ;AAAA,EACD,QAAQy3B,GAAK;AACT,UAAMiB,IAAmB,OAAOjB,KAAQ,aAAaA,IAAM,MAAMA;AACjE,WAAO,IAAIkB,GAAW;AAAA,MAClB,GAAGxB,EAAoB,KAAK,IAAI;AAAA,MAChC,WAAW;AAAA,MACX,cAAcuB;AAAA,MACd,UAAUT,EAAsB;AAAA,IAC5C,CAAS;AAAA,EACJ;AAAA,EACD,QAAQ;AACJ,WAAO,IAAIW,GAAW;AAAA,MAClB,UAAUX,EAAsB;AAAA,MAChC,MAAM;AAAA,MACN,GAAGd,EAAoB,KAAK,IAAI;AAAA,IAC5C,CAAS;AAAA,EACJ;AAAA,EACD,MAAMM,GAAK;AACP,UAAMoB,IAAiB,OAAOpB,KAAQ,aAAaA,IAAM,MAAMA;AAC/D,WAAO,IAAIqB,GAAS;AAAA,MAChB,GAAG3B,EAAoB,KAAK,IAAI;AAAA,MAChC,WAAW;AAAA,MACX,YAAY0B;AAAA,MACZ,UAAUZ,EAAsB;AAAA,IAC5C,CAAS;AAAA,EACJ;AAAA,EACD,SAASX,GAAa;AAClB,UAAMyB,IAAO,KAAK;AAClB,WAAO,IAAIA,EAAK;AAAA,MACZ,GAAG,KAAK;AAAA,MACR,aAAAzB;AAAA,IACZ,CAAS;AAAA,EACJ;AAAA,EACD,KAAKjc,GAAQ;AACT,WAAO2d,GAAY,OAAO,MAAM3d,CAAM;AAAA,EACzC;AAAA,EACD,WAAW;AACP,WAAO4d,GAAY,OAAO,IAAI;AAAA,EACjC;AAAA,EACD,aAAa;AACT,WAAO,KAAK,UAAU,MAAS,EAAE;AAAA,EACpC;AAAA,EACD,aAAa;AACT,WAAO,KAAK,UAAU,IAAI,EAAE;AAAA,EAC/B;AACL;AACA,MAAMC,KAAY,kBACZC,KAAa,eACbC,KAAY,4BAGZC,KAAY,0FACZC,KAAc,qBACdC,KAAgB,4SAahBC,KAAa,sFAIbC,KAAc;AACpB,IAAIC;AAEJ,MAAMC,KAAY,uHACZC,KAAY,gYAEZC,KAAc,oEAMdC,KAAkB,qMAClBC,KAAY,IAAI,OAAO,IAAID,EAAe,GAAG;AACnD,SAASE,GAAgB3sB,GAAM;AAE3B,MAAI4c,IAAQ;AACZ,SAAI5c,EAAK,YACL4c,IAAQ,GAAGA,CAAK,UAAU5c,EAAK,SAAS,MAEnCA,EAAK,aAAa,SACvB4c,IAAQ,GAAGA,CAAK,eAEbA;AACX;AACA,SAASgQ,GAAU5sB,GAAM;AACrB,SAAO,IAAI,OAAO,IAAI2sB,GAAgB3sB,CAAI,CAAC,GAAG;AAClD;AAEA,SAAS6sB,GAAc7sB,GAAM;AACzB,MAAI4c,IAAQ,GAAG6P,EAAe,IAAIE,GAAgB3sB,CAAI,CAAC;AACvD,QAAM3Q,IAAO,CAAA;AACb,SAAAA,EAAK,KAAK2Q,EAAK,QAAQ,OAAO,GAAG,GAC7BA,EAAK,UACL3Q,EAAK,KAAK,sBAAsB,GACpCutB,IAAQ,GAAGA,CAAK,IAAIvtB,EAAK,KAAK,GAAG,CAAC,KAC3B,IAAI,OAAO,IAAIutB,CAAK,GAAG;AAClC;AACA,SAASkQ,GAAUC,GAAIC,GAAS;AAI5B,SAHK,IAAAA,MAAY,QAAQ,CAACA,MAAYV,GAAU,KAAKS,CAAE,MAGlDC,MAAY,QAAQ,CAACA,MAAYT,GAAU,KAAKQ,CAAE;AAI3D;AACA,MAAME,WAAkB9C,GAAQ;AAAA,EAC5B,OAAO9oB,GAAO;AAKV,QAJI,KAAK,KAAK,WACVA,EAAM,OAAO,OAAOA,EAAM,IAAI,IAEf,KAAK,SAASA,CAAK,MACnBilB,EAAc,QAAQ;AACrC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,UAAM7mC,IAAS,IAAI0mC;AACnB,QAAIF;AACJ,eAAWgC,KAAS,KAAK,KAAK;AAC1B,UAAIA,EAAM,SAAS;AACf,QAAIjpB,EAAM,KAAK,SAASipB,EAAM,UAC1BhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,UACf,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAASA,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS;AACpB,QAAIjpB,EAAM,KAAK,SAASipB,EAAM,UAC1BhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,UACf,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAASA,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS,UAAU;AAC9B,cAAM4C,IAAS7rB,EAAM,KAAK,SAASipB,EAAM,OACnC6C,IAAW9rB,EAAM,KAAK,SAASipB,EAAM;AAC3C,SAAI4C,KAAUC,OACV7E,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACjC4E,IACA7E,EAAkBC,GAAK;AAAA,UACnB,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,UACf,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAASA,EAAM;AAAA,QAC3C,CAAyB,IAEI6C,KACL9E,EAAkBC,GAAK;AAAA,UACnB,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,UACf,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAASA,EAAM;AAAA,QAC3C,CAAyB,GAELxoC,EAAO,MAAK;AAAA,MAEnB,WACQwoC,EAAM,SAAS;AACpB,QAAK6B,GAAW,KAAK9qB,EAAM,IAAI,MAC3BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,YAAY;AAAA,UACZ,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS;AACpB,QAAK+B,OACDA,KAAa,IAAI,OAAOD,IAAa,GAAG,IAEvCC,GAAW,KAAKhrB,EAAM,IAAI,MAC3BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,YAAY;AAAA,UACZ,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS;AACpB,QAAK0B,GAAU,KAAK3qB,EAAM,IAAI,MAC1BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,YAAY;AAAA,UACZ,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS;AACpB,QAAK2B,GAAY,KAAK5qB,EAAM,IAAI,MAC5BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,YAAY;AAAA,UACZ,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS;AACpB,QAAKuB,GAAU,KAAKxqB,EAAM,IAAI,MAC1BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,YAAY;AAAA,UACZ,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS;AACpB,QAAKwB,GAAW,KAAKzqB,EAAM,IAAI,MAC3BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,YAAY;AAAA,UACZ,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS;AACpB,QAAKyB,GAAU,KAAK1qB,EAAM,IAAI,MAC1BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,UACnB,YAAY;AAAA,UACZ,MAAM9B,EAAa;AAAA,UACnB,SAAS8D,EAAM;AAAA,QACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,eAGXwoC,EAAM,SAAS;AACpB,YAAI;AACA,cAAI,IAAIjpB,EAAM,IAAI;AAAA,QACrB,QACU;AACP,UAAAinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM9B,EAAa;AAAA,YACnB,SAAS8D,EAAM;AAAA,UACvC,CAAqB,GACDxoC,EAAO,MAAK;AAAA,QACf;AAAA,UAEA,CAAIwoC,EAAM,SAAS,WACpBA,EAAM,MAAM,YAAY,GACLA,EAAM,MAAM,KAAKjpB,EAAM,IAAI,MAE1CinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,YAAY;AAAA,QACZ,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,MAGXwoC,EAAM,SAAS,SACpBjpB,EAAM,OAAOA,EAAM,KAAK,KAAI,IAEvBipB,EAAM,SAAS,aACfjpB,EAAM,KAAK,SAASipB,EAAM,OAAOA,EAAM,QAAQ,MAChDhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,YAAY,EAAE,UAAU8D,EAAM,OAAO,UAAUA,EAAM,SAAU;AAAA,QAC/D,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,gBACpBjpB,EAAM,OAAOA,EAAM,KAAK,YAAW,IAE9BipB,EAAM,SAAS,gBACpBjpB,EAAM,OAAOA,EAAM,KAAK,YAAW,IAE9BipB,EAAM,SAAS,eACfjpB,EAAM,KAAK,WAAWipB,EAAM,KAAK,MAClChC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,YAAY,EAAE,YAAY8D,EAAM,MAAO;AAAA,QACvC,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,aACfjpB,EAAM,KAAK,SAASipB,EAAM,KAAK,MAChChC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,YAAY,EAAE,UAAU8D,EAAM,MAAO;AAAA,QACrC,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,aACNuC,GAAcvC,CAAK,EACtB,KAAKjpB,EAAM,IAAI,MACtBinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,YAAY;AAAA,QACZ,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,SACNoC,GACH,KAAKrrB,EAAM,IAAI,MACtBinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,YAAY;AAAA,QACZ,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,SACNsC,GAAUtC,CAAK,EAClB,KAAKjpB,EAAM,IAAI,MACtBinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,YAAY;AAAA,QACZ,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,aACf4B,GAAc,KAAK7qB,EAAM,IAAI,MAC9BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,YAAY;AAAA,QACZ,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,OACfwC,GAAUzrB,EAAM,MAAMipB,EAAM,OAAO,MACpChC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,YAAY;AAAA,QACZ,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,WACfkC,GAAY,KAAKnrB,EAAM,IAAI,MAC5BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,YAAY;AAAA,QACZ,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAIhB2jC,GAAK,YAAY6E,CAAK;AAG9B,WAAO,EAAE,QAAQxoC,EAAO,OAAO,OAAOuf,EAAM;EAC/C;AAAA,EACD,OAAOub,GAAOwQ,GAAYpwB,GAAS;AAC/B,WAAO,KAAK,WAAW,CAAC/W,MAAS22B,EAAM,KAAK32B,CAAI,GAAG;AAAA,MAC/C,YAAAmnC;AAAA,MACA,MAAM5G,EAAa;AAAA,MACnB,GAAGgD,EAAU,SAASxsB,CAAO;AAAA,IACzC,CAAS;AAAA,EACJ;AAAA,EACD,UAAUstB,GAAO;AACb,WAAO,IAAI2C,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ3C,CAAK;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,MAAMttB,GAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EAC1E;AAAA,EACD,IAAIA,GAAS;AACT,WAAO,KAAK,UAAU,EAAE,MAAM,OAAO,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EACxE;AAAA,EACD,MAAMA,GAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EAC1E;AAAA,EACD,KAAKA,GAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EACzE;AAAA,EACD,OAAOA,GAAS;AACZ,WAAO,KAAK,UAAU,EAAE,MAAM,UAAU,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EAC3E;AAAA,EACD,KAAKA,GAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EACzE;AAAA,EACD,MAAMA,GAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EAC1E;AAAA,EACD,KAAKA,GAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EACzE;AAAA,EACD,OAAOA,GAAS;AACZ,WAAO,KAAK,UAAU,EAAE,MAAM,UAAU,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EAC3E;AAAA,EACD,GAAGne,GAAS;AACR,WAAO,KAAK,UAAU,EAAE,MAAM,MAAM,GAAG2qC,EAAU,SAAS3qC,CAAO,EAAC,CAAE;AAAA,EACvE;AAAA,EACD,SAASA,GAAS;AACd,QAAIlE,GAAIK;AACR,WAAI,OAAO6D,KAAY,WACZ,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,WAAW;AAAA,MACX,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,SAASA;AAAA,IACzB,CAAa,IAEE,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,WAAW,QAAQA,KAAY,OAA6B,SAASA,EAAQ,aAAe,MAAc,OAAOA,KAAY,OAA6B,SAASA,EAAQ;AAAA,MAC3K,SAASlE,IAAKkE,KAAY,OAA6B,SAASA,EAAQ,YAAY,QAAQlE,MAAO,SAASA,IAAK;AAAA,MACjH,QAAQK,IAAK6D,KAAY,OAA6B,SAASA,EAAQ,WAAW,QAAQ7D,MAAO,SAASA,IAAK;AAAA,MAC/G,GAAGwuC,EAAU,SAAS3qC,KAAY,OAA6B,SAASA,EAAQ,OAAO;AAAA,IACnG,CAAS;AAAA,EACJ;AAAA,EACD,KAAKme,GAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,SAAAA,EAAO,CAAE;AAAA,EAClD;AAAA,EACD,KAAKne,GAAS;AACV,WAAI,OAAOA,KAAY,WACZ,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,WAAW;AAAA,MACX,SAASA;AAAA,IACzB,CAAa,IAEE,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,WAAW,QAAQA,KAAY,OAA6B,SAASA,EAAQ,aAAe,MAAc,OAAOA,KAAY,OAA6B,SAASA,EAAQ;AAAA,MAC3K,GAAG2qC,EAAU,SAAS3qC,KAAY,OAA6B,SAASA,EAAQ,OAAO;AAAA,IACnG,CAAS;AAAA,EACJ;AAAA,EACD,SAASme,GAAS;AACd,WAAO,KAAK,UAAU,EAAE,MAAM,YAAY,GAAGwsB,EAAU,SAASxsB,CAAO,EAAC,CAAE;AAAA,EAC7E;AAAA,EACD,MAAM4f,GAAO5f,GAAS;AAClB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO4f;AAAA,MACP,GAAG4M,EAAU,SAASxsB,CAAO;AAAA,IACzC,CAAS;AAAA,EACJ;AAAA,EACD,SAAS9b,GAAOrC,GAAS;AACrB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAOqC;AAAA,MACP,UAAUrC,KAAY,OAA6B,SAASA,EAAQ;AAAA,MACpE,GAAG2qC,EAAU,SAAS3qC,KAAY,OAA6B,SAASA,EAAQ,OAAO;AAAA,IACnG,CAAS;AAAA,EACJ;AAAA,EACD,WAAWqC,GAAO8b,GAAS;AACvB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO9b;AAAA,MACP,GAAGsoC,EAAU,SAASxsB,CAAO;AAAA,IACzC,CAAS;AAAA,EACJ;AAAA,EACD,SAAS9b,GAAO8b,GAAS;AACrB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO9b;AAAA,MACP,GAAGsoC,EAAU,SAASxsB,CAAO;AAAA,IACzC,CAAS;AAAA,EACJ;AAAA,EACD,IAAIqwB,GAAWrwB,GAAS;AACpB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAOqwB;AAAA,MACP,GAAG7D,EAAU,SAASxsB,CAAO;AAAA,IACzC,CAAS;AAAA,EACJ;AAAA,EACD,IAAIswB,GAAWtwB,GAAS;AACpB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAOswB;AAAA,MACP,GAAG9D,EAAU,SAASxsB,CAAO;AAAA,IACzC,CAAS;AAAA,EACJ;AAAA,EACD,OAAOrV,GAAKqV,GAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAOrV;AAAA,MACP,GAAG6hC,EAAU,SAASxsB,CAAO;AAAA,IACzC,CAAS;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,SAASA,GAAS;AACd,WAAO,KAAK,IAAI,GAAGwsB,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACjD;AAAA,EACD,OAAO;AACH,WAAO,IAAIiwB,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,QAAQ;AAAA,IAC1D,CAAS;AAAA,EACJ;AAAA,EACD,cAAc;AACV,WAAO,IAAIA,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,eAAe;AAAA,IACjE,CAAS;AAAA,EACJ;AAAA,EACD,cAAc;AACV,WAAO,IAAIA,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,eAAe;AAAA,IACjE,CAAS;AAAA,EACJ;AAAA,EACD,IAAI,aAAa;AACb,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACM,MAAOA,EAAG,SAAS,UAAU;AAAA,EAChE;AAAA,EACD,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,MAAM;AAAA,EAC5D;AAAA,EACD,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,MAAM;AAAA,EAC5D;AAAA,EACD,IAAI,aAAa;AACb,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,UAAU;AAAA,EAChE;AAAA,EACD,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,OAAO;AAAA,EAC7D;AAAA,EACD,IAAI,QAAQ;AACR,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,KAAK;AAAA,EAC3D;AAAA,EACD,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,OAAO;AAAA,EAC7D;AAAA,EACD,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,MAAM;AAAA,EAC5D;AAAA,EACD,IAAI,WAAW;AACX,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,QAAQ;AAAA,EAC9D;AAAA,EACD,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,MAAM;AAAA,EAC5D;AAAA,EACD,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,OAAO;AAAA,EAC7D;AAAA,EACD,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,MAAM;AAAA,EAC5D;AAAA,EACD,IAAI,OAAO;AACP,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,IAAI;AAAA,EAC1D;AAAA,EACD,IAAI,WAAW;AACX,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACA,MAAOA,EAAG,SAAS,QAAQ;AAAA,EAC9D;AAAA,EACD,IAAI,YAAY;AACZ,QAAIloC,IAAM;AACV,eAAWkoC,KAAM,KAAK,KAAK;AACvB,MAAIA,EAAG,SAAS,UACRloC,MAAQ,QAAQkoC,EAAG,QAAQloC,OAC3BA,IAAMkoC,EAAG;AAGrB,WAAOloC;AAAA,EACV;AAAA,EACD,IAAI,YAAY;AACZ,QAAIhK,IAAM;AACV,eAAWkyC,KAAM,KAAK,KAAK;AACvB,MAAIA,EAAG,SAAS,UACRlyC,MAAQ,QAAQkyC,EAAG,QAAQlyC,OAC3BA,IAAMkyC,EAAG;AAGrB,WAAOlyC;AAAA,EACV;AACL;AACA4xC,GAAU,SAAS,CAAChoB,MAAW;AAC3B,MAAItqB;AACJ,SAAO,IAAIsyC,GAAU;AAAA,IACjB,QAAQ,CAAE;AAAA,IACV,UAAUrC,EAAsB;AAAA,IAChC,SAASjwC,IAAKsqB,KAAW,OAA4B,SAASA,EAAO,YAAY,QAAQtqB,MAAO,SAASA,IAAK;AAAA,IAC9G,GAAGmvC,EAAoB7kB,CAAM;AAAA,EACrC,CAAK;AACL;AAEA,SAASuoB,GAAmBprC,GAAKqrC,GAAM;AACnC,QAAMC,KAAetrC,EAAI,WAAW,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI,QACnDurC,KAAgBF,EAAK,WAAW,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI,QACrDG,IAAWF,IAAcC,IAAeD,IAAcC,GACtDE,IAAS,SAASzrC,EAAI,QAAQwrC,CAAQ,EAAE,QAAQ,KAAK,EAAE,CAAC,GACxDE,IAAU,SAASL,EAAK,QAAQG,CAAQ,EAAE,QAAQ,KAAK,EAAE,CAAC;AAChE,SAAQC,IAASC,IAAW,KAAK,IAAI,IAAIF,CAAQ;AACrD;AACA,MAAMG,WAAkB5D,GAAQ;AAAA,EAC5B,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,MAAM,KAAK,KAChB,KAAK,MAAM,KAAK,KAChB,KAAK,OAAO,KAAK;AAAA,EACpB;AAAA,EACD,OAAO9oB,GAAO;AAKV,QAJI,KAAK,KAAK,WACVA,EAAM,OAAO,OAAOA,EAAM,IAAI,IAEf,KAAK,SAASA,CAAK,MACnBilB,EAAc,QAAQ;AACrC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,QAAIL;AACJ,UAAMxmC,IAAS,IAAI0mC;AACnB,eAAW8B,KAAS,KAAK,KAAK;AAC1B,MAAIA,EAAM,SAAS,QACV7E,GAAK,UAAUpkB,EAAM,IAAI,MAC1BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAU;AAAA,QACV,UAAU;AAAA,QACV,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,SACHA,EAAM,YACjBjpB,EAAM,OAAOipB,EAAM,QACnBjpB,EAAM,QAAQipB,EAAM,WAEtBhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,QACf,MAAM;AAAA,QACN,WAAWA,EAAM;AAAA,QACjB,OAAO;AAAA,QACP,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,SACLA,EAAM,YACfjpB,EAAM,OAAOipB,EAAM,QACnBjpB,EAAM,QAAQipB,EAAM,WAEtBhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,QACf,MAAM;AAAA,QACN,WAAWA,EAAM;AAAA,QACjB,OAAO;AAAA,QACP,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,eAChBkD,GAAmBnsB,EAAM,MAAMipB,EAAM,KAAK,MAAM,MAChDhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,YAAY8D,EAAM;AAAA,QAClB,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,WACf,OAAO,SAASjpB,EAAM,IAAI,MAC3BinB,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAIhB2jC,GAAK,YAAY6E,CAAK;AAG9B,WAAO,EAAE,QAAQxoC,EAAO,OAAO,OAAOuf,EAAM;EAC/C;AAAA,EACD,IAAIngB,GAAO8b,GAAS;AAChB,WAAO,KAAK,SAAS,OAAO9b,GAAO,IAAMsoC,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACvE;AAAA,EACD,GAAG9b,GAAO8b,GAAS;AACf,WAAO,KAAK,SAAS,OAAO9b,GAAO,IAAOsoC,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACxE;AAAA,EACD,IAAI9b,GAAO8b,GAAS;AAChB,WAAO,KAAK,SAAS,OAAO9b,GAAO,IAAMsoC,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACvE;AAAA,EACD,GAAG9b,GAAO8b,GAAS;AACf,WAAO,KAAK,SAAS,OAAO9b,GAAO,IAAOsoC,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACxE;AAAA,EACD,SAASmY,GAAMj0B,GAAO8sC,GAAWhxB,GAAS;AACtC,WAAO,IAAI+wB,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ;AAAA,QACJ,GAAG,KAAK,KAAK;AAAA,QACb;AAAA,UACI,MAAA5Y;AAAA,UACA,OAAAj0B;AAAA,UACA,WAAA8sC;AAAA,UACA,SAASxE,EAAU,SAASxsB,CAAO;AAAA,QACtC;AAAA,MACJ;AAAA,IACb,CAAS;AAAA,EACJ;AAAA,EACD,UAAUstB,GAAO;AACb,WAAO,IAAIyD,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQzD,CAAK;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,IAAIttB,GAAS;AACT,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,SAASA,GAAS;AACd,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,WAAW;AAAA,MACX,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,SAASA,GAAS;AACd,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,WAAW;AAAA,MACX,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,YAAYA,GAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,WAAW;AAAA,MACX,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,YAAYA,GAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,WAAW;AAAA,MACX,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,WAAW9b,GAAO8b,GAAS;AACvB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO9b;AAAA,MACP,SAASsoC,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,OAAOA,GAAS;AACZ,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,KAAKA,GAAS;AACV,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,WAAW;AAAA,MACX,OAAO,OAAO;AAAA,MACd,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IACtC,CAAA,EAAE,UAAU;AAAA,MACT,MAAM;AAAA,MACN,WAAW;AAAA,MACX,OAAO,OAAO;AAAA,MACd,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,IAAI,WAAW;AACX,QAAI3X,IAAM;AACV,eAAWkoC,KAAM,KAAK,KAAK;AACvB,MAAIA,EAAG,SAAS,UACRloC,MAAQ,QAAQkoC,EAAG,QAAQloC,OAC3BA,IAAMkoC,EAAG;AAGrB,WAAOloC;AAAA,EACV;AAAA,EACD,IAAI,WAAW;AACX,QAAIhK,IAAM;AACV,eAAWkyC,KAAM,KAAK,KAAK;AACvB,MAAIA,EAAG,SAAS,UACRlyC,MAAQ,QAAQkyC,EAAG,QAAQlyC,OAC3BA,IAAMkyC,EAAG;AAGrB,WAAOlyC;AAAA,EACV;AAAA,EACD,IAAI,QAAQ;AACR,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAACkyC,MAAOA,EAAG,SAAS,SAC9CA,EAAG,SAAS,gBAAgB9H,GAAK,UAAU8H,EAAG,KAAK,CAAE;AAAA,EAC7D;AAAA,EACD,IAAI,WAAW;AACX,QAAIlyC,IAAM,MAAMgK,IAAM;AACtB,eAAWkoC,KAAM,KAAK,KAAK,QAAQ;AAC/B,UAAIA,EAAG,SAAS,YACZA,EAAG,SAAS,SACZA,EAAG,SAAS;AACZ,eAAO;AAEN,MAAIA,EAAG,SAAS,SACbloC,MAAQ,QAAQkoC,EAAG,QAAQloC,OAC3BA,IAAMkoC,EAAG,SAERA,EAAG,SAAS,UACblyC,MAAQ,QAAQkyC,EAAG,QAAQlyC,OAC3BA,IAAMkyC,EAAG;AAAA,IAEpB;AACD,WAAO,OAAO,SAASloC,CAAG,KAAK,OAAO,SAAShK,CAAG;AAAA,EACrD;AACL;AACA0yC,GAAU,SAAS,CAAC9oB,MACT,IAAI8oB,GAAU;AAAA,EACjB,QAAQ,CAAE;AAAA,EACV,UAAUnD,EAAsB;AAAA,EAChC,SAAS3lB,KAAW,OAA4B,SAASA,EAAO,WAAW;AAAA,EAC3E,GAAG6kB,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMgpB,WAAkB9D,GAAQ;AAAA,EAC5B,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,MAAM,KAAK,KAChB,KAAK,MAAM,KAAK;AAAA,EACnB;AAAA,EACD,OAAO9oB,GAAO;AAKV,QAJI,KAAK,KAAK,WACVA,EAAM,OAAO,OAAOA,EAAM,IAAI,IAEf,KAAK,SAASA,CAAK,MACnBilB,EAAc,QAAQ;AACrC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,QAAIL;AACJ,UAAMxmC,IAAS,IAAI0mC;AACnB,eAAW8B,KAAS,KAAK,KAAK;AAC1B,MAAIA,EAAM,SAAS,SACEA,EAAM,YACjBjpB,EAAM,OAAOipB,EAAM,QACnBjpB,EAAM,QAAQipB,EAAM,WAEtBhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,MAAM;AAAA,QACN,SAAS8D,EAAM;AAAA,QACf,WAAWA,EAAM;AAAA,QACjB,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,SACLA,EAAM,YACfjpB,EAAM,OAAOipB,EAAM,QACnBjpB,EAAM,QAAQipB,EAAM,WAEtBhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,MAAM;AAAA,QACN,SAAS8D,EAAM;AAAA,QACf,WAAWA,EAAM;AAAA,QACjB,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,eAChBjpB,EAAM,OAAOipB,EAAM,UAAU,OAAO,CAAC,MACrChC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,YAAY8D,EAAM;AAAA,QAClB,SAASA,EAAM;AAAA,MACvC,CAAqB,GACDxoC,EAAO,MAAK,KAIhB2jC,GAAK,YAAY6E,CAAK;AAG9B,WAAO,EAAE,QAAQxoC,EAAO,OAAO,OAAOuf,EAAM;EAC/C;AAAA,EACD,IAAIngB,GAAO8b,GAAS;AAChB,WAAO,KAAK,SAAS,OAAO9b,GAAO,IAAMsoC,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACvE;AAAA,EACD,GAAG9b,GAAO8b,GAAS;AACf,WAAO,KAAK,SAAS,OAAO9b,GAAO,IAAOsoC,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACxE;AAAA,EACD,IAAI9b,GAAO8b,GAAS;AAChB,WAAO,KAAK,SAAS,OAAO9b,GAAO,IAAMsoC,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACvE;AAAA,EACD,GAAG9b,GAAO8b,GAAS;AACf,WAAO,KAAK,SAAS,OAAO9b,GAAO,IAAOsoC,EAAU,SAASxsB,CAAO,CAAC;AAAA,EACxE;AAAA,EACD,SAASmY,GAAMj0B,GAAO8sC,GAAWhxB,GAAS;AACtC,WAAO,IAAIixB,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ;AAAA,QACJ,GAAG,KAAK,KAAK;AAAA,QACb;AAAA,UACI,MAAA9Y;AAAA,UACA,OAAAj0B;AAAA,UACA,WAAA8sC;AAAA,UACA,SAASxE,EAAU,SAASxsB,CAAO;AAAA,QACtC;AAAA,MACJ;AAAA,IACb,CAAS;AAAA,EACJ;AAAA,EACD,UAAUstB,GAAO;AACb,WAAO,IAAI2D,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ3D,CAAK;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,SAASttB,GAAS;AACd,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,OAAO,CAAC;AAAA,MACf,WAAW;AAAA,MACX,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,SAASA,GAAS;AACd,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,OAAO,CAAC;AAAA,MACf,WAAW;AAAA,MACX,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,YAAYA,GAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,OAAO,CAAC;AAAA,MACf,WAAW;AAAA,MACX,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,YAAYA,GAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,OAAO,CAAC;AAAA,MACf,WAAW;AAAA,MACX,SAASwsB,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,WAAW9b,GAAO8b,GAAS;AACvB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAA9b;AAAA,MACA,SAASsoC,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,IAAI,WAAW;AACX,QAAI3X,IAAM;AACV,eAAWkoC,KAAM,KAAK,KAAK;AACvB,MAAIA,EAAG,SAAS,UACRloC,MAAQ,QAAQkoC,EAAG,QAAQloC,OAC3BA,IAAMkoC,EAAG;AAGrB,WAAOloC;AAAA,EACV;AAAA,EACD,IAAI,WAAW;AACX,QAAIhK,IAAM;AACV,eAAWkyC,KAAM,KAAK,KAAK;AACvB,MAAIA,EAAG,SAAS,UACRlyC,MAAQ,QAAQkyC,EAAG,QAAQlyC,OAC3BA,IAAMkyC,EAAG;AAGrB,WAAOlyC;AAAA,EACV;AACL;AACA4yC,GAAU,SAAS,CAAChpB,MAAW;AAC3B,MAAItqB;AACJ,SAAO,IAAIszC,GAAU;AAAA,IACjB,QAAQ,CAAE;AAAA,IACV,UAAUrD,EAAsB;AAAA,IAChC,SAASjwC,IAAKsqB,KAAW,OAA4B,SAASA,EAAO,YAAY,QAAQtqB,MAAO,SAASA,IAAK;AAAA,IAC9G,GAAGmvC,EAAoB7kB,CAAM;AAAA,EACrC,CAAK;AACL;AACA,MAAMipB,WAAmB/D,GAAQ;AAAA,EAC7B,OAAO9oB,GAAO;AAKV,QAJI,KAAK,KAAK,WACVA,EAAM,OAAO,EAAQA,EAAM,OAEZ,KAAK,SAASA,CAAK,MACnBilB,EAAc,SAAS;AACtC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,WAAOM,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AACL;AACA6sB,GAAW,SAAS,CAACjpB,MACV,IAAIipB,GAAW;AAAA,EAClB,UAAUtD,EAAsB;AAAA,EAChC,SAAS3lB,KAAW,OAA4B,SAASA,EAAO,WAAW;AAAA,EAC3E,GAAG6kB,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMkpB,WAAgBhE,GAAQ;AAAA,EAC1B,OAAO9oB,GAAO;AAKV,QAJI,KAAK,KAAK,WACVA,EAAM,OAAO,IAAI,KAAKA,EAAM,IAAI,IAEjB,KAAK,SAASA,CAAK,MACnBilB,EAAc,MAAM;AACnC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,QAAI,MAAMtnB,EAAM,KAAK,QAAS,CAAA,GAAG;AAC7B,YAAMinB,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,MACnC,CAAa,GACMmC;AAAA,IACV;AACD,UAAM7mC,IAAS,IAAI0mC;AACnB,QAAIF;AACJ,eAAWgC,KAAS,KAAK,KAAK;AAC1B,MAAIA,EAAM,SAAS,QACXjpB,EAAM,KAAK,QAAO,IAAKipB,EAAM,UAC7BhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,QACf,WAAW;AAAA,QACX,OAAO;AAAA,QACP,SAASA,EAAM;AAAA,QACf,MAAM;AAAA,MAC9B,CAAqB,GACDxoC,EAAO,MAAK,KAGXwoC,EAAM,SAAS,QAChBjpB,EAAM,KAAK,QAAO,IAAKipB,EAAM,UAC7BhC,IAAM,KAAK,gBAAgBjnB,GAAOinB,CAAG,GACrCD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,SAAS8D,EAAM;AAAA,QACf,WAAW;AAAA,QACX,OAAO;AAAA,QACP,SAASA,EAAM;AAAA,QACf,MAAM;AAAA,MAC9B,CAAqB,GACDxoC,EAAO,MAAK,KAIhB2jC,GAAK,YAAY6E,CAAK;AAG9B,WAAO;AAAA,MACH,QAAQxoC,EAAO;AAAA,MACf,OAAO,IAAI,KAAKuf,EAAM,KAAK,QAAO,CAAE;AAAA,IAChD;AAAA,EACK;AAAA,EACD,UAAUipB,GAAO;AACb,WAAO,IAAI6D,GAAQ;AAAA,MACf,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ7D,CAAK;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,IAAI8D,GAASpxB,GAAS;AAClB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAOoxB,EAAQ,QAAS;AAAA,MACxB,SAAS5E,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,IAAIqxB,GAASrxB,GAAS;AAClB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAOqxB,EAAQ,QAAS;AAAA,MACxB,SAAS7E,EAAU,SAASxsB,CAAO;AAAA,IAC/C,CAAS;AAAA,EACJ;AAAA,EACD,IAAI,UAAU;AACV,QAAI3X,IAAM;AACV,eAAWkoC,KAAM,KAAK,KAAK;AACvB,MAAIA,EAAG,SAAS,UACRloC,MAAQ,QAAQkoC,EAAG,QAAQloC,OAC3BA,IAAMkoC,EAAG;AAGrB,WAAOloC,KAAO,OAAO,IAAI,KAAKA,CAAG,IAAI;AAAA,EACxC;AAAA,EACD,IAAI,UAAU;AACV,QAAIhK,IAAM;AACV,eAAWkyC,KAAM,KAAK,KAAK;AACvB,MAAIA,EAAG,SAAS,UACRlyC,MAAQ,QAAQkyC,EAAG,QAAQlyC,OAC3BA,IAAMkyC,EAAG;AAGrB,WAAOlyC,KAAO,OAAO,IAAI,KAAKA,CAAG,IAAI;AAAA,EACxC;AACL;AACA8yC,GAAQ,SAAS,CAAClpB,MACP,IAAIkpB,GAAQ;AAAA,EACf,QAAQ,CAAE;AAAA,EACV,SAASlpB,KAAW,OAA4B,SAASA,EAAO,WAAW;AAAA,EAC3E,UAAU2lB,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMqpB,WAAkBnE,GAAQ;AAAA,EAC5B,OAAO9oB,GAAO;AAEV,QADmB,KAAK,SAASA,CAAK,MACnBilB,EAAc,QAAQ;AACrC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,WAAOM,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AACL;AACAitB,GAAU,SAAS,CAACrpB,MACT,IAAIqpB,GAAU;AAAA,EACjB,UAAU1D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMspB,WAAqBpE,GAAQ;AAAA,EAC/B,OAAO9oB,GAAO;AAEV,QADmB,KAAK,SAASA,CAAK,MACnBilB,EAAc,WAAW;AACxC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,WAAOM,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AACL;AACAktB,GAAa,SAAS,CAACtpB,MACZ,IAAIspB,GAAa;AAAA,EACpB,UAAU3D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMupB,WAAgBrE,GAAQ;AAAA,EAC1B,OAAO9oB,GAAO;AAEV,QADmB,KAAK,SAASA,CAAK,MACnBilB,EAAc,MAAM;AACnC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,WAAOM,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AACL;AACAmtB,GAAQ,SAAS,CAACvpB,MACP,IAAIupB,GAAQ;AAAA,EACf,UAAU5D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMwpB,WAAetE,GAAQ;AAAA,EACzB,cAAc;AACV,UAAM,GAAG,SAAS,GAElB,KAAK,OAAO;AAAA,EACf;AAAA,EACD,OAAO9oB,GAAO;AACV,WAAO4nB,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AACL;AACAotB,GAAO,SAAS,CAACxpB,MACN,IAAIwpB,GAAO;AAAA,EACd,UAAU7D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMypB,WAAmBvE,GAAQ;AAAA,EAC7B,cAAc;AACV,UAAM,GAAG,SAAS,GAElB,KAAK,WAAW;AAAA,EACnB;AAAA,EACD,OAAO9oB,GAAO;AACV,WAAO4nB,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AACL;AACAqtB,GAAW,SAAS,CAACzpB,MACV,IAAIypB,GAAW;AAAA,EAClB,UAAU9D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAM0pB,WAAiBxE,GAAQ;AAAA,EAC3B,OAAO9oB,GAAO;AACV,UAAMinB,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,WAAAgnB,EAAkBC,GAAK;AAAA,MACnB,MAAM9B,EAAa;AAAA,MACnB,UAAUF,EAAc;AAAA,MACxB,UAAUgC,EAAI;AAAA,IAC1B,CAAS,GACMK;AAAA,EACV;AACL;AACAgG,GAAS,SAAS,CAAC1pB,MACR,IAAI0pB,GAAS;AAAA,EAChB,UAAU/D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAM2pB,WAAgBzE,GAAQ;AAAA,EAC1B,OAAO9oB,GAAO;AAEV,QADmB,KAAK,SAASA,CAAK,MACnBilB,EAAc,WAAW;AACxC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,WAAOM,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AACL;AACAutB,GAAQ,SAAS,CAAC3pB,MACP,IAAI2pB,GAAQ;AAAA,EACf,UAAUhE,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAM8lB,WAAiBZ,GAAQ;AAAA,EAC3B,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,GAAK,QAAAxmC,EAAM,IAAK,KAAK,oBAAoBuf,CAAK,GAChD+oB,IAAM,KAAK;AACjB,QAAI9B,EAAI,eAAehC,EAAc;AACjC,aAAA+B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAEX,QAAIyB,EAAI,gBAAgB,MAAM;AAC1B,YAAM8C,IAAS5E,EAAI,KAAK,SAAS8B,EAAI,YAAY,OAC3C+C,IAAW7E,EAAI,KAAK,SAAS8B,EAAI,YAAY;AACnD,OAAI8C,KAAUC,OACV9E,EAAkBC,GAAK;AAAA,QACnB,MAAM4E,IAAS1G,EAAa,UAAUA,EAAa;AAAA,QACnD,SAAU2G,IAAW/C,EAAI,YAAY,QAAQ;AAAA,QAC7C,SAAU8C,IAAS9C,EAAI,YAAY,QAAQ;AAAA,QAC3C,MAAM;AAAA,QACN,WAAW;AAAA,QACX,OAAO;AAAA,QACP,SAASA,EAAI,YAAY;AAAA,MAC7C,CAAiB,GACDtoC,EAAO,MAAK;AAAA,IAEnB;AA2BD,QA1BIsoC,EAAI,cAAc,QACd9B,EAAI,KAAK,SAAS8B,EAAI,UAAU,UAChC/B,EAAkBC,GAAK;AAAA,MACnB,MAAM9B,EAAa;AAAA,MACnB,SAAS4D,EAAI,UAAU;AAAA,MACvB,MAAM;AAAA,MACN,WAAW;AAAA,MACX,OAAO;AAAA,MACP,SAASA,EAAI,UAAU;AAAA,IAC3C,CAAiB,GACDtoC,EAAO,MAAK,IAGhBsoC,EAAI,cAAc,QACd9B,EAAI,KAAK,SAAS8B,EAAI,UAAU,UAChC/B,EAAkBC,GAAK;AAAA,MACnB,MAAM9B,EAAa;AAAA,MACnB,SAAS4D,EAAI,UAAU;AAAA,MACvB,MAAM;AAAA,MACN,WAAW;AAAA,MACX,OAAO;AAAA,MACP,SAASA,EAAI,UAAU;AAAA,IAC3C,CAAiB,GACDtoC,EAAO,MAAK,IAGhBwmC,EAAI,OAAO;AACX,aAAO,QAAQ,IAAI,CAAC,GAAGA,EAAI,IAAI,EAAE,IAAI,CAAC92B,GAAMzQ,MACjCqpC,EAAI,KAAK,YAAY,IAAIT,GAAmBrB,GAAK92B,GAAM82B,EAAI,MAAMvnC,CAAC,CAAC,CAC7E,CAAC,EAAE,KAAK,CAACuM,MACCk7B,GAAY,WAAW1mC,GAAQwL,CAAM,CAC/C;AAEL,UAAMA,IAAS,CAAC,GAAGg7B,EAAI,IAAI,EAAE,IAAI,CAAC92B,GAAMzQ,MAC7BqpC,EAAI,KAAK,WAAW,IAAIT,GAAmBrB,GAAK92B,GAAM82B,EAAI,MAAMvnC,CAAC,CAAC,CAC5E;AACD,WAAOynC,GAAY,WAAW1mC,GAAQwL,CAAM;AAAA,EAC/C;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,IAAI+/B,GAAWrwB,GAAS;AACpB,WAAO,IAAI+tB,GAAS;AAAA,MAChB,GAAG,KAAK;AAAA,MACR,WAAW,EAAE,OAAOsC,GAAW,SAAS7D,EAAU,SAASxsB,CAAO,EAAG;AAAA,IACjF,CAAS;AAAA,EACJ;AAAA,EACD,IAAIswB,GAAWtwB,GAAS;AACpB,WAAO,IAAI+tB,GAAS;AAAA,MAChB,GAAG,KAAK;AAAA,MACR,WAAW,EAAE,OAAOuC,GAAW,SAAS9D,EAAU,SAASxsB,CAAO,EAAG;AAAA,IACjF,CAAS;AAAA,EACJ;AAAA,EACD,OAAOrV,GAAKqV,GAAS;AACjB,WAAO,IAAI+tB,GAAS;AAAA,MAChB,GAAG,KAAK;AAAA,MACR,aAAa,EAAE,OAAOpjC,GAAK,SAAS6hC,EAAU,SAASxsB,CAAO,EAAG;AAAA,IAC7E,CAAS;AAAA,EACJ;AAAA,EACD,SAASA,GAAS;AACd,WAAO,KAAK,IAAI,GAAGA,CAAO;AAAA,EAC7B;AACL;AACA+tB,GAAS,SAAS,CAAC8D,GAAQ5pB,MAChB,IAAI8lB,GAAS;AAAA,EAChB,MAAM8D;AAAA,EACN,WAAW;AAAA,EACX,WAAW;AAAA,EACX,aAAa;AAAA,EACb,UAAUjE,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,SAAS6pB,GAAeD,GAAQ;AAC5B,MAAIA,aAAkBE,IAAW;AAC7B,UAAMC,IAAW,CAAA;AACjB,eAAWluC,KAAO+tC,EAAO,OAAO;AAC5B,YAAMI,IAAcJ,EAAO,MAAM/tC,CAAG;AACpC,MAAAkuC,EAASluC,CAAG,IAAI+pC,GAAY,OAAOiE,GAAeG,CAAW,CAAC;AAAA,IACjE;AACD,WAAO,IAAIF,GAAU;AAAA,MACjB,GAAGF,EAAO;AAAA,MACV,OAAO,MAAMG;AAAA,IACzB,CAAS;AAAA,EACJ,MACI,QAAIH,aAAkB9D,KAChB,IAAIA,GAAS;AAAA,IAChB,GAAG8D,EAAO;AAAA,IACV,MAAMC,GAAeD,EAAO,OAAO;AAAA,EAC/C,CAAS,IAEIA,aAAkBhE,KAChBA,GAAY,OAAOiE,GAAeD,EAAO,OAAQ,CAAA,CAAC,IAEpDA,aAAkB/D,KAChBA,GAAY,OAAOgE,GAAeD,EAAO,OAAQ,CAAA,CAAC,IAEpDA,aAAkBK,KAChBA,GAAS,OAAOL,EAAO,MAAM,IAAI,CAACr9B,MAASs9B,GAAet9B,CAAI,CAAC,CAAC,IAGhEq9B;AAEf;AACA,MAAME,WAAkB5E,GAAQ;AAAA,EAC5B,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,UAAU,MAKf,KAAK,YAAY,KAAK,aAqCtB,KAAK,UAAU,KAAK;AAAA,EACvB;AAAA,EACD,aAAa;AACT,QAAI,KAAK,YAAY;AACjB,aAAO,KAAK;AAChB,UAAMgF,IAAQ,KAAK,KAAK,MAAK,GACvBhQ,IAAOsG,GAAK,WAAW0J,CAAK;AAClC,WAAQ,KAAK,UAAU,EAAE,OAAAA,GAAO,MAAAhQ,EAAI;AAAA,EACvC;AAAA,EACD,OAAO9d,GAAO;AAEV,QADmB,KAAK,SAASA,CAAK,MACnBilB,EAAc,QAAQ;AACrC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,UAAM,EAAE,QAAA7mC,GAAQ,KAAAwmC,EAAG,IAAK,KAAK,oBAAoBjnB,CAAK,GAChD,EAAE,OAAA8tB,GAAO,MAAMC,EAAS,IAAK,KAAK,cAClCC,IAAY,CAAA;AAClB,QAAI,EAAE,KAAK,KAAK,oBAAoBV,MAChC,KAAK,KAAK,gBAAgB;AAC1B,iBAAW7tC,KAAOwnC,EAAI;AAClB,QAAK8G,EAAU,SAAStuC,CAAG,KACvBuuC,EAAU,KAAKvuC,CAAG;AAI9B,UAAM8nC,IAAQ,CAAA;AACd,eAAW9nC,KAAOsuC,GAAW;AACzB,YAAME,IAAeH,EAAMruC,CAAG,GACxBI,IAAQonC,EAAI,KAAKxnC,CAAG;AAC1B,MAAA8nC,EAAM,KAAK;AAAA,QACP,KAAK,EAAE,QAAQ,SAAS,OAAO9nC,EAAK;AAAA,QACpC,OAAOwuC,EAAa,OAAO,IAAI3F,GAAmBrB,GAAKpnC,GAAOonC,EAAI,MAAMxnC,CAAG,CAAC;AAAA,QAC5E,WAAWA,KAAOwnC,EAAI;AAAA,MACtC,CAAa;AAAA,IACJ;AACD,QAAI,KAAK,KAAK,oBAAoBqG,IAAU;AACxC,YAAMY,IAAc,KAAK,KAAK;AAC9B,UAAIA,MAAgB;AAChB,mBAAWzuC,KAAOuuC;AACd,UAAAzG,EAAM,KAAK;AAAA,YACP,KAAK,EAAE,QAAQ,SAAS,OAAO9nC,EAAK;AAAA,YACpC,OAAO,EAAE,QAAQ,SAAS,OAAOwnC,EAAI,KAAKxnC,CAAG,EAAG;AAAA,UACxE,CAAqB;AAAA,eAGAyuC,MAAgB;AACrB,QAAIF,EAAU,SAAS,MACnBhH,EAAkBC,GAAK;AAAA,UACnB,MAAM9B,EAAa;AAAA,UACnB,MAAM6I;AAAA,QAC9B,CAAqB,GACDvtC,EAAO,MAAK;AAAA,eAGXytC,MAAgB,QAErB,OAAM,IAAI,MAAM,sDAAsD;AAAA,IAE7E,OACI;AAED,YAAMC,IAAW,KAAK,KAAK;AAC3B,iBAAW1uC,KAAOuuC,GAAW;AACzB,cAAMnuC,IAAQonC,EAAI,KAAKxnC,CAAG;AAC1B,QAAA8nC,EAAM,KAAK;AAAA,UACP,KAAK,EAAE,QAAQ,SAAS,OAAO9nC,EAAK;AAAA,UACpC,OAAO0uC,EAAS;AAAA,YAAO,IAAI7F,GAAmBrB,GAAKpnC,GAAOonC,EAAI,MAAMxnC,CAAG;AAAA;AAAA,UACtE;AAAA,UACD,WAAWA,KAAOwnC,EAAI;AAAA,QAC1C,CAAiB;AAAA,MACJ;AAAA,IACJ;AACD,WAAIA,EAAI,OAAO,QACJ,QAAQ,QAAS,EACnB,KAAK,YAAY;AAClB,YAAMO,IAAY,CAAA;AAClB,iBAAWC,KAAQF,GAAO;AACtB,cAAM9nC,IAAM,MAAMgoC,EAAK,KACjB5nC,IAAQ,MAAM4nC,EAAK;AACzB,QAAAD,EAAU,KAAK;AAAA,UACX,KAAA/nC;AAAA,UACA,OAAAI;AAAA,UACA,WAAW4nC,EAAK;AAAA,QACxC,CAAqB;AAAA,MACJ;AACD,aAAOD;AAAA,IACvB,CAAa,EACI,KAAK,CAACA,MACAL,GAAY,gBAAgB1mC,GAAQ+mC,CAAS,CACvD,IAGML,GAAY,gBAAgB1mC,GAAQ8mC,CAAK;AAAA,EAEvD;AAAA,EACD,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK;EACpB;AAAA,EACD,OAAO5rB,GAAS;AACZ,WAAAwsB,EAAU,UACH,IAAIuF,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,aAAa;AAAA,MACb,GAAI/xB,MAAY,SACV;AAAA,QACE,UAAU,CAACiqB,GAAOqB,MAAQ;AACtB,cAAI3tC,GAAIK,GAAI2G,GAAIC;AAChB,gBAAM6tC,KAAgB9tC,KAAM3G,KAAML,IAAK,KAAK,MAAM,cAAc,QAAQK,MAAO,SAAS,SAASA,EAAG,KAAKL,GAAIssC,GAAOqB,CAAG,EAAE,aAAa,QAAQ3mC,MAAO,SAASA,IAAK2mC,EAAI;AACvK,iBAAIrB,EAAM,SAAS,sBACR;AAAA,YACH,UAAUrlC,IAAK4nC,EAAU,SAASxsB,CAAO,EAAE,aAAa,QAAQpb,MAAO,SAASA,IAAK6tC;AAAA,UACrH,IAC+B;AAAA,YACH,SAASA;AAAA,UACrC;AAAA,QACqB;AAAA,MACJ,IACC;IAClB,CAAS;AAAA,EACJ;AAAA,EACD,QAAQ;AACJ,WAAO,IAAIV,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,aAAa;AAAA,IACzB,CAAS;AAAA,EACJ;AAAA,EACD,cAAc;AACV,WAAO,IAAIA,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,aAAa;AAAA,IACzB,CAAS;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBD,OAAOW,GAAc;AACjB,WAAO,IAAIX,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,OAAO;AAAA,QACV,GAAG,KAAK,KAAK,MAAO;AAAA,QACpB,GAAGW;AAAA,MACnB;AAAA,IACA,CAAS;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,MAAMC,GAAS;AAUX,WATe,IAAIZ,GAAU;AAAA,MACzB,aAAaY,EAAQ,KAAK;AAAA,MAC1B,UAAUA,EAAQ,KAAK;AAAA,MACvB,OAAO,OAAO;AAAA,QACV,GAAG,KAAK,KAAK,MAAO;AAAA,QACpB,GAAGA,EAAQ,KAAK,MAAO;AAAA,MACvC;AAAA,MACY,UAAU/E,EAAsB;AAAA,IAC5C,CAAS;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoCD,OAAO9pC,GAAK+tC,GAAQ;AAChB,WAAO,KAAK,QAAQ,EAAE,CAAC/tC,CAAG,GAAG+tC,EAAQ,CAAA;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBD,SAASjuC,GAAO;AACZ,WAAO,IAAImuC,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,UAAUnuC;AAAA,IACtB,CAAS;AAAA,EACJ;AAAA,EACD,KAAKsR,GAAM;AACP,UAAMi9B,IAAQ,CAAA;AACd,WAAA1J,GAAK,WAAWvzB,CAAI,EAAE,QAAQ,CAACpR,MAAQ;AACnC,MAAIoR,EAAKpR,CAAG,KAAK,KAAK,MAAMA,CAAG,MAC3BquC,EAAMruC,CAAG,IAAI,KAAK,MAAMA,CAAG;AAAA,IAE3C,CAAS,GACM,IAAIiuC,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,MAAMI;AAAA,IACzB,CAAS;AAAA,EACJ;AAAA,EACD,KAAKj9B,GAAM;AACP,UAAMi9B,IAAQ,CAAA;AACd,WAAA1J,GAAK,WAAW,KAAK,KAAK,EAAE,QAAQ,CAAC3kC,MAAQ;AACzC,MAAKoR,EAAKpR,CAAG,MACTquC,EAAMruC,CAAG,IAAI,KAAK,MAAMA,CAAG;AAAA,IAE3C,CAAS,GACM,IAAIiuC,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,MAAMI;AAAA,IACzB,CAAS;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAID,cAAc;AACV,WAAOL,GAAe,IAAI;AAAA,EAC7B;AAAA,EACD,QAAQ58B,GAAM;AACV,UAAM88B,IAAW,CAAA;AACjB,WAAAvJ,GAAK,WAAW,KAAK,KAAK,EAAE,QAAQ,CAAC3kC,MAAQ;AACzC,YAAMmuC,IAAc,KAAK,MAAMnuC,CAAG;AAClC,MAAIoR,KAAQ,CAACA,EAAKpR,CAAG,IACjBkuC,EAASluC,CAAG,IAAImuC,IAGhBD,EAASluC,CAAG,IAAImuC,EAAY,SAAQ;AAAA,IAEpD,CAAS,GACM,IAAIF,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,MAAMC;AAAA,IACzB,CAAS;AAAA,EACJ;AAAA,EACD,SAAS98B,GAAM;AACX,UAAM88B,IAAW,CAAA;AACjB,WAAAvJ,GAAK,WAAW,KAAK,KAAK,EAAE,QAAQ,CAAC3kC,MAAQ;AACzC,UAAIoR,KAAQ,CAACA,EAAKpR,CAAG;AACjB,QAAAkuC,EAASluC,CAAG,IAAI,KAAK,MAAMA,CAAG;AAAA,WAE7B;AAED,YAAI8uC,IADgB,KAAK,MAAM9uC,CAAG;AAElC,eAAO8uC,aAAoB/E;AACvB,UAAA+E,IAAWA,EAAS,KAAK;AAE7B,QAAAZ,EAASluC,CAAG,IAAI8uC;AAAA,MACnB;AAAA,IACb,CAAS,GACM,IAAIb,GAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,MAAMC;AAAA,IACzB,CAAS;AAAA,EACJ;AAAA,EACD,QAAQ;AACJ,WAAOa,GAAcpK,GAAK,WAAW,KAAK,KAAK,CAAC;AAAA,EACnD;AACL;AACAsJ,GAAU,SAAS,CAACI,GAAOlqB,MAChB,IAAI8pB,GAAU;AAAA,EACjB,OAAO,MAAMI;AAAA,EACb,aAAa;AAAA,EACb,UAAUR,GAAS,OAAQ;AAAA,EAC3B,UAAU/D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL8pB,GAAU,eAAe,CAACI,GAAOlqB,MACtB,IAAI8pB,GAAU;AAAA,EACjB,OAAO,MAAMI;AAAA,EACb,aAAa;AAAA,EACb,UAAUR,GAAS,OAAQ;AAAA,EAC3B,UAAU/D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL8pB,GAAU,aAAa,CAACI,GAAOlqB,MACpB,IAAI8pB,GAAU;AAAA,EACjB,OAAAI;AAAA,EACA,aAAa;AAAA,EACb,UAAUR,GAAS,OAAQ;AAAA,EAC3B,UAAU/D,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMimB,WAAiBf,GAAQ;AAAA,EAC3B,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,EAAK,IAAG,KAAK,oBAAoBjnB,CAAK,GACxCxiB,IAAU,KAAK,KAAK;AAC1B,aAASixC,EAAcrH,GAAS;AAE5B,iBAAWn7B,KAAUm7B;AACjB,YAAIn7B,EAAO,OAAO,WAAW;AACzB,iBAAOA,EAAO;AAGtB,iBAAWA,KAAUm7B;AACjB,YAAIn7B,EAAO,OAAO,WAAW;AAEzB,iBAAAg7B,EAAI,OAAO,OAAO,KAAK,GAAGh7B,EAAO,IAAI,OAAO,MAAM,GAC3CA,EAAO;AAItB,YAAMyiC,IAActH,EAAQ,IAAI,CAACn7B,MAAW,IAAIo5B,GAASp5B,EAAO,IAAI,OAAO,MAAM,CAAC;AAClF,aAAA+6B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,aAAAuJ;AAAA,MAChB,CAAa,GACMpH;AAAA,IACV;AACD,QAAIL,EAAI,OAAO;AACX,aAAO,QAAQ,IAAIzpC,EAAQ,IAAI,OAAOosC,MAAW;AAC7C,cAAM+E,IAAW;AAAA,UACb,GAAG1H;AAAA,UACH,QAAQ;AAAA,YACJ,GAAGA,EAAI;AAAA,YACP,QAAQ,CAAE;AAAA,UACb;AAAA,UACD,QAAQ;AAAA,QAC5B;AACgB,eAAO;AAAA,UACH,QAAQ,MAAM2C,EAAO,YAAY;AAAA,YAC7B,MAAM3C,EAAI;AAAA,YACV,MAAMA,EAAI;AAAA,YACV,QAAQ0H;AAAA,UAChC,CAAqB;AAAA,UACD,KAAKA;AAAA,QACzB;AAAA,MACA,CAAa,CAAC,EAAE,KAAKF,CAAa;AAErB;AACD,UAAIG;AACJ,YAAMtJ,IAAS,CAAA;AACf,iBAAWsE,KAAUpsC,GAAS;AAC1B,cAAMmxC,IAAW;AAAA,UACb,GAAG1H;AAAA,UACH,QAAQ;AAAA,YACJ,GAAGA,EAAI;AAAA,YACP,QAAQ,CAAE;AAAA,UACb;AAAA,UACD,QAAQ;AAAA,QAC5B,GACsBh7B,IAAS29B,EAAO,WAAW;AAAA,UAC7B,MAAM3C,EAAI;AAAA,UACV,MAAMA,EAAI;AAAA,UACV,QAAQ0H;AAAA,QAC5B,CAAiB;AACD,YAAI1iC,EAAO,WAAW;AAClB,iBAAOA;AAEN,QAAIA,EAAO,WAAW,WAAW,CAAC2iC,MACnCA,IAAQ,EAAE,QAAA3iC,GAAQ,KAAK0iC,EAAQ,IAE/BA,EAAS,OAAO,OAAO,UACvBrJ,EAAO,KAAKqJ,EAAS,OAAO,MAAM;AAAA,MAEzC;AACD,UAAIC;AACA,eAAA3H,EAAI,OAAO,OAAO,KAAK,GAAG2H,EAAM,IAAI,OAAO,MAAM,GAC1CA,EAAM;AAEjB,YAAMF,IAAcpJ,EAAO,IAAI,CAACA,MAAW,IAAID,GAASC,CAAM,CAAC;AAC/D,aAAA0B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,aAAAuJ;AAAA,MAChB,CAAa,GACMpH;AAAA,IACV;AAAA,EACJ;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACAuC,GAAS,SAAS,CAACgF,GAAOjrB,MACf,IAAIimB,GAAS;AAAA,EAChB,SAASgF;AAAA,EACT,UAAUtF,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AASL,MAAMkrB,KAAmB,CAAC71C,MAClBA,aAAgB81C,KACTD,GAAiB71C,EAAK,MAAM,IAE9BA,aAAgBqwC,KACdwF,GAAiB71C,EAAK,UAAS,CAAE,IAEnCA,aAAgB+1C,KACd,CAAC/1C,EAAK,KAAK,IAEbA,aAAgBg2C,KACdh2C,EAAK,UAEPA,aAAgBi2C,KAEd9K,GAAK,aAAanrC,EAAK,IAAI,IAE7BA,aAAgBgxC,KACd6E,GAAiB71C,EAAK,KAAK,SAAS,IAEtCA,aAAgBi0C,KACd,CAAC,MAAS,IAEZj0C,aAAgBk0C,KACd,CAAC,IAAI,IAEPl0C,aAAgBuwC,KACd,CAAC,QAAW,GAAGsF,GAAiB71C,EAAK,OAAQ,CAAA,CAAC,IAEhDA,aAAgBwwC,KACd,CAAC,MAAM,GAAGqF,GAAiB71C,EAAK,OAAQ,CAAA,CAAC,IAE3CA,aAAgBixC,MAGhBjxC,aAAgBsxC,KAFduE,GAAiB71C,EAAK,OAAM,CAAE,IAKhCA,aAAgBmxC,KACd0E,GAAiB71C,EAAK,KAAK,SAAS,IAGpC;AAGf,MAAMk2C,WAA8BrG,GAAQ;AAAA,EACxC,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,EAAK,IAAG,KAAK,oBAAoBjnB,CAAK;AAC9C,QAAIinB,EAAI,eAAehC,EAAc;AACjC,aAAA+B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAEX,UAAM8H,IAAgB,KAAK,eACrBC,IAAqBpI,EAAI,KAAKmI,CAAa,GAC3CxF,IAAS,KAAK,WAAW,IAAIyF,CAAkB;AACrD,WAAKzF,IAQD3C,EAAI,OAAO,QACJ2C,EAAO,YAAY;AAAA,MACtB,MAAM3C,EAAI;AAAA,MACV,MAAMA,EAAI;AAAA,MACV,QAAQA;AAAA,IACxB,CAAa,IAGM2C,EAAO,WAAW;AAAA,MACrB,MAAM3C,EAAI;AAAA,MACV,MAAMA,EAAI;AAAA,MACV,QAAQA;AAAA,IACxB,CAAa,KAnBDD,EAAkBC,GAAK;AAAA,MACnB,MAAM9B,EAAa;AAAA,MACnB,SAAS,MAAM,KAAK,KAAK,WAAW,KAAI,CAAE;AAAA,MAC1C,MAAM,CAACiK,CAAa;AAAA,IACpC,CAAa,GACM9H;AAAA,EAgBd;AAAA,EACD,IAAI,gBAAgB;AAChB,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,IAAI,aAAa;AACb,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASD,OAAO,OAAO8H,GAAe5xC,GAASomB,GAAQ;AAE1C,UAAM0rB,IAAa,oBAAI;AAEvB,eAAWr2C,KAAQuE,GAAS;AACxB,YAAM+xC,IAAsBT,GAAiB71C,EAAK,MAAMm2C,CAAa,CAAC;AACtE,UAAI,CAACG,EAAoB;AACrB,cAAM,IAAI,MAAM,mCAAmCH,CAAa,mDAAmD;AAEvH,iBAAWvvC,KAAS0vC,GAAqB;AACrC,YAAID,EAAW,IAAIzvC,CAAK;AACpB,gBAAM,IAAI,MAAM,0BAA0B,OAAOuvC,CAAa,CAAC,wBAAwB,OAAOvvC,CAAK,CAAC,EAAE;AAE1G,QAAAyvC,EAAW,IAAIzvC,GAAO5G,CAAI;AAAA,MAC7B;AAAA,IACJ;AACD,WAAO,IAAIk2C,GAAsB;AAAA,MAC7B,UAAU5F,EAAsB;AAAA,MAChC,eAAA6F;AAAA,MACA,SAAA5xC;AAAA,MACA,YAAA8xC;AAAA,MACA,GAAG7G,EAAoB7kB,CAAM;AAAA,IACzC,CAAS;AAAA,EACJ;AACL;AACA,SAAS4rB,GAAYrrC,GAAGhB,GAAG;AACvB,QAAMssC,IAAQvK,GAAc/gC,CAAC,GACvBurC,IAAQxK,GAAc/hC,CAAC;AAC7B,MAAIgB,MAAMhB;AACN,WAAO,EAAE,OAAO,IAAM,MAAMgB,EAAC;AAE5B,MAAIsrC,MAAUxK,EAAc,UAAUyK,MAAUzK,EAAc,QAAQ;AACvE,UAAM0K,IAAQvL,GAAK,WAAWjhC,CAAC,GACzBysC,IAAaxL,GACd,WAAWjgC,CAAC,EACZ,OAAO,CAAC1E,MAAQkwC,EAAM,QAAQlwC,CAAG,MAAM,EAAE,GACxCowC,IAAS,EAAE,GAAG1rC,GAAG,GAAGhB,EAAC;AAC3B,eAAW1D,KAAOmwC,GAAY;AAC1B,YAAME,IAAcN,GAAYrrC,EAAE1E,CAAG,GAAG0D,EAAE1D,CAAG,CAAC;AAC9C,UAAI,CAACqwC,EAAY;AACb,eAAO,EAAE,OAAO;AAEpB,MAAAD,EAAOpwC,CAAG,IAAIqwC,EAAY;AAAA,IAC7B;AACD,WAAO,EAAE,OAAO,IAAM,MAAMD,EAAM;AAAA,EACrC,WACQJ,MAAUxK,EAAc,SAASyK,MAAUzK,EAAc,OAAO;AACrE,QAAI9gC,EAAE,WAAWhB,EAAE;AACf,aAAO,EAAE,OAAO;AAEpB,UAAM4sC,IAAW,CAAA;AACjB,aAASxwC,IAAQ,GAAGA,IAAQ4E,EAAE,QAAQ5E,KAAS;AAC3C,YAAMywC,IAAQ7rC,EAAE5E,CAAK,GACf0wC,IAAQ9sC,EAAE5D,CAAK,GACfuwC,IAAcN,GAAYQ,GAAOC,CAAK;AAC5C,UAAI,CAACH,EAAY;AACb,eAAO,EAAE,OAAO;AAEpB,MAAAC,EAAS,KAAKD,EAAY,IAAI;AAAA,IACjC;AACD,WAAO,EAAE,OAAO,IAAM,MAAMC,EAAQ;AAAA,EACvC,MACI,QAAIN,MAAUxK,EAAc,QAC7ByK,MAAUzK,EAAc,QACxB,CAAC9gC,KAAM,CAAChB,IACD,EAAE,OAAO,IAAM,MAAMgB,EAAC,IAGtB,EAAE,OAAO;AAExB;AACA,MAAM4lC,WAAwBjB,GAAQ;AAAA,EAClC,OAAO9oB,GAAO;AACV,UAAM,EAAE,QAAAvf,GAAQ,KAAAwmC,EAAG,IAAK,KAAK,oBAAoBjnB,CAAK,GAChDkwB,IAAe,CAACC,GAAYC,MAAgB;AAC9C,UAAIvI,GAAUsI,CAAU,KAAKtI,GAAUuI,CAAW;AAC9C,eAAO9I;AAEX,YAAM+I,IAASb,GAAYW,EAAW,OAAOC,EAAY,KAAK;AAC9D,aAAKC,EAAO,UAMRvI,GAAQqI,CAAU,KAAKrI,GAAQsI,CAAW,MAC1C3vC,EAAO,MAAK,GAET,EAAE,QAAQA,EAAO,OAAO,OAAO4vC,EAAO,WARzCrJ,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,MACvC,CAAiB,GACMmC;AAAA,IAMvB;AACQ,WAAIL,EAAI,OAAO,QACJ,QAAQ,IAAI;AAAA,MACf,KAAK,KAAK,KAAK,YAAY;AAAA,QACvB,MAAMA,EAAI;AAAA,QACV,MAAMA,EAAI;AAAA,QACV,QAAQA;AAAA,MAC5B,CAAiB;AAAA,MACD,KAAK,KAAK,MAAM,YAAY;AAAA,QACxB,MAAMA,EAAI;AAAA,QACV,MAAMA,EAAI;AAAA,QACV,QAAQA;AAAA,MAC5B,CAAiB;AAAA,IACjB,CAAa,EAAE,KAAK,CAAC,CAAC5yB,GAAMC,CAAK,MAAM47B,EAAa77B,GAAMC,CAAK,CAAC,IAG7C47B,EAAa,KAAK,KAAK,KAAK,WAAW;AAAA,MAC1C,MAAMjJ,EAAI;AAAA,MACV,MAAMA,EAAI;AAAA,MACV,QAAQA;AAAA,IACX,CAAA,GAAG,KAAK,KAAK,MAAM,WAAW;AAAA,MAC3B,MAAMA,EAAI;AAAA,MACV,MAAMA,EAAI;AAAA,MACV,QAAQA;AAAA,IACX,CAAA,CAAC;AAAA,EAET;AACL;AACA8C,GAAgB,SAAS,CAAC11B,GAAMC,GAAOsP,MAC5B,IAAImmB,GAAgB;AAAA,EACvB,MAAM11B;AAAA,EACN,OAAOC;AAAA,EACP,UAAUi1B,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMiqB,WAAiB/E,GAAQ;AAAA,EAC3B,OAAO9oB,GAAO;AACV,UAAM,EAAE,QAAAvf,GAAQ,KAAAwmC,EAAG,IAAK,KAAK,oBAAoBjnB,CAAK;AACtD,QAAIinB,EAAI,eAAehC,EAAc;AACjC,aAAA+B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAEX,QAAIL,EAAI,KAAK,SAAS,KAAK,KAAK,MAAM;AAClC,aAAAD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,SAAS,KAAK,KAAK,MAAM;AAAA,QACzB,WAAW;AAAA,QACX,OAAO;AAAA,QACP,MAAM;AAAA,MACtB,CAAa,GACMmC;AAGX,IAAI,CADS,KAAK,KAAK,QACVL,EAAI,KAAK,SAAS,KAAK,KAAK,MAAM,WAC3CD,EAAkBC,GAAK;AAAA,MACnB,MAAM9B,EAAa;AAAA,MACnB,SAAS,KAAK,KAAK,MAAM;AAAA,MACzB,WAAW;AAAA,MACX,OAAO;AAAA,MACP,MAAM;AAAA,IACtB,CAAa,GACD1kC,EAAO,MAAK;AAEhB,UAAMgkC,IAAQ,CAAC,GAAGwC,EAAI,IAAI,EACrB,IAAI,CAAC92B,GAAMmgC,MAAc;AAC1B,YAAM9C,IAAS,KAAK,KAAK,MAAM8C,CAAS,KAAK,KAAK,KAAK;AACvD,aAAK9C,IAEEA,EAAO,OAAO,IAAIlF,GAAmBrB,GAAK92B,GAAM82B,EAAI,MAAMqJ,CAAS,CAAC,IADhE;AAAA,IAEvB,CAAS,EACI,OAAO,CAAChkC,MAAM,CAAC,CAACA,CAAC;AACtB,WAAI26B,EAAI,OAAO,QACJ,QAAQ,IAAIxC,CAAK,EAAE,KAAK,CAAC2C,MACrBD,GAAY,WAAW1mC,GAAQ2mC,CAAO,CAChD,IAGMD,GAAY,WAAW1mC,GAAQgkC,CAAK;AAAA,EAElD;AAAA,EACD,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,KAAK7N,GAAM;AACP,WAAO,IAAIiX,GAAS;AAAA,MAChB,GAAG,KAAK;AAAA,MACR,MAAAjX;AAAA,IACZ,CAAS;AAAA,EACJ;AACL;AACAiX,GAAS,SAAS,CAAC0C,GAAS3sB,MAAW;AACnC,MAAI,CAAC,MAAM,QAAQ2sB,CAAO;AACtB,UAAM,IAAI,MAAM,uDAAuD;AAE3E,SAAO,IAAI1C,GAAS;AAAA,IAChB,OAAO0C;AAAA,IACP,UAAUhH,EAAsB;AAAA,IAChC,MAAM;AAAA,IACN,GAAGd,EAAoB7kB,CAAM;AAAA,EACrC,CAAK;AACL;AACA,MAAM4sB,WAAkB1H,GAAQ;AAAA,EAC5B,IAAI,YAAY;AACZ,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,OAAO9oB,GAAO;AACV,UAAM,EAAE,QAAAvf,GAAQ,KAAAwmC,EAAG,IAAK,KAAK,oBAAoBjnB,CAAK;AACtD,QAAIinB,EAAI,eAAehC,EAAc;AACjC,aAAA+B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAEX,UAAMC,IAAQ,CAAA,GACRkJ,IAAU,KAAK,KAAK,SACpBC,IAAY,KAAK,KAAK;AAC5B,eAAWjxC,KAAOwnC,EAAI;AAClB,MAAAM,EAAM,KAAK;AAAA,QACP,KAAKkJ,EAAQ,OAAO,IAAInI,GAAmBrB,GAAKxnC,GAAKwnC,EAAI,MAAMxnC,CAAG,CAAC;AAAA,QACnE,OAAOixC,EAAU,OAAO,IAAIpI,GAAmBrB,GAAKA,EAAI,KAAKxnC,CAAG,GAAGwnC,EAAI,MAAMxnC,CAAG,CAAC;AAAA,QACjF,WAAWA,KAAOwnC,EAAI;AAAA,MACtC,CAAa;AAEL,WAAIA,EAAI,OAAO,QACJE,GAAY,iBAAiB1mC,GAAQ8mC,CAAK,IAG1CJ,GAAY,gBAAgB1mC,GAAQ8mC,CAAK;AAAA,EAEvD;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,OAAO,OAAOxC,GAAOC,GAAQ2L,GAAO;AAChC,WAAI3L,aAAkB8D,KACX,IAAI0H,GAAU;AAAA,MACjB,SAASzL;AAAA,MACT,WAAWC;AAAA,MACX,UAAUuE,EAAsB;AAAA,MAChC,GAAGd,EAAoBkI,CAAK;AAAA,IAC5C,CAAa,IAEE,IAAIH,GAAU;AAAA,MACjB,SAAS5E,GAAU,OAAQ;AAAA,MAC3B,WAAW7G;AAAA,MACX,UAAUwE,EAAsB;AAAA,MAChC,GAAGd,EAAoBzD,CAAM;AAAA,IACzC,CAAS;AAAA,EACJ;AACL;AACA,MAAM4L,WAAe9H,GAAQ;AAAA,EACzB,IAAI,YAAY;AACZ,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,OAAO9oB,GAAO;AACV,UAAM,EAAE,QAAAvf,GAAQ,KAAAwmC,EAAG,IAAK,KAAK,oBAAoBjnB,CAAK;AACtD,QAAIinB,EAAI,eAAehC,EAAc;AACjC,aAAA+B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAEX,UAAMmJ,IAAU,KAAK,KAAK,SACpBC,IAAY,KAAK,KAAK,WACtBnJ,IAAQ,CAAC,GAAGN,EAAI,KAAK,QAAO,CAAE,EAAE,IAAI,CAAC,CAACxnC,GAAKI,CAAK,GAAGN,OAC9C;AAAA,MACH,KAAKkxC,EAAQ,OAAO,IAAInI,GAAmBrB,GAAKxnC,GAAKwnC,EAAI,MAAM,CAAC1nC,GAAO,KAAK,CAAC,CAAC;AAAA,MAC9E,OAAOmxC,EAAU,OAAO,IAAIpI,GAAmBrB,GAAKpnC,GAAOonC,EAAI,MAAM,CAAC1nC,GAAO,OAAO,CAAC,CAAC;AAAA,IACtG,EACS;AACD,QAAI0nC,EAAI,OAAO,OAAO;AAClB,YAAM4J,IAAW,oBAAI;AACrB,aAAO,QAAQ,UAAU,KAAK,YAAY;AACtC,mBAAWpJ,KAAQF,GAAO;AACtB,gBAAM9nC,IAAM,MAAMgoC,EAAK,KACjB5nC,IAAQ,MAAM4nC,EAAK;AACzB,cAAIhoC,EAAI,WAAW,aAAaI,EAAM,WAAW;AAC7C,mBAAOynC;AAEX,WAAI7nC,EAAI,WAAW,WAAWI,EAAM,WAAW,YAC3CY,EAAO,MAAK,GAEhBowC,EAAS,IAAIpxC,EAAI,OAAOI,EAAM,KAAK;AAAA,QACtC;AACD,eAAO,EAAE,QAAQY,EAAO,OAAO,OAAOowC,EAAQ;AAAA,MAC9D,CAAa;AAAA,IACJ,OACI;AACD,YAAMA,IAAW,oBAAI;AACrB,iBAAWpJ,KAAQF,GAAO;AACtB,cAAM9nC,IAAMgoC,EAAK,KACX5nC,IAAQ4nC,EAAK;AACnB,YAAIhoC,EAAI,WAAW,aAAaI,EAAM,WAAW;AAC7C,iBAAOynC;AAEX,SAAI7nC,EAAI,WAAW,WAAWI,EAAM,WAAW,YAC3CY,EAAO,MAAK,GAEhBowC,EAAS,IAAIpxC,EAAI,OAAOI,EAAM,KAAK;AAAA,MACtC;AACD,aAAO,EAAE,QAAQY,EAAO,OAAO,OAAOowC,EAAQ;AAAA,IACjD;AAAA,EACJ;AACL;AACAD,GAAO,SAAS,CAACH,GAASC,GAAW9sB,MAC1B,IAAIgtB,GAAO;AAAA,EACd,WAAAF;AAAA,EACA,SAAAD;AAAA,EACA,UAAUlH,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMktB,WAAehI,GAAQ;AAAA,EACzB,OAAO9oB,GAAO;AACV,UAAM,EAAE,QAAAvf,GAAQ,KAAAwmC,EAAG,IAAK,KAAK,oBAAoBjnB,CAAK;AACtD,QAAIinB,EAAI,eAAehC,EAAc;AACjC,aAAA+B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAEX,UAAMyB,IAAM,KAAK;AACjB,IAAIA,EAAI,YAAY,QACZ9B,EAAI,KAAK,OAAO8B,EAAI,QAAQ,UAC5B/B,EAAkBC,GAAK;AAAA,MACnB,MAAM9B,EAAa;AAAA,MACnB,SAAS4D,EAAI,QAAQ;AAAA,MACrB,MAAM;AAAA,MACN,WAAW;AAAA,MACX,OAAO;AAAA,MACP,SAASA,EAAI,QAAQ;AAAA,IACzC,CAAiB,GACDtoC,EAAO,MAAK,IAGhBsoC,EAAI,YAAY,QACZ9B,EAAI,KAAK,OAAO8B,EAAI,QAAQ,UAC5B/B,EAAkBC,GAAK;AAAA,MACnB,MAAM9B,EAAa;AAAA,MACnB,SAAS4D,EAAI,QAAQ;AAAA,MACrB,MAAM;AAAA,MACN,WAAW;AAAA,MACX,OAAO;AAAA,MACP,SAASA,EAAI,QAAQ;AAAA,IACzC,CAAiB,GACDtoC,EAAO,MAAK;AAGpB,UAAMiwC,IAAY,KAAK,KAAK;AAC5B,aAASK,EAAYC,GAAU;AAC3B,YAAMC,IAAY,oBAAI;AACtB,iBAAWC,KAAWF,GAAU;AAC5B,YAAIE,EAAQ,WAAW;AACnB,iBAAO5J;AACX,QAAI4J,EAAQ,WAAW,WACnBzwC,EAAO,MAAK,GAChBwwC,EAAU,IAAIC,EAAQ,KAAK;AAAA,MAC9B;AACD,aAAO,EAAE,QAAQzwC,EAAO,OAAO,OAAOwwC,EAAS;AAAA,IAClD;AACD,UAAMD,IAAW,CAAC,GAAG/J,EAAI,KAAK,QAAQ,EAAE,IAAI,CAAC92B,GAAMzQ,MAAMgxC,EAAU,OAAO,IAAIpI,GAAmBrB,GAAK92B,GAAM82B,EAAI,MAAMvnC,CAAC,CAAC,CAAC;AACzH,WAAIunC,EAAI,OAAO,QACJ,QAAQ,IAAI+J,CAAQ,EAAE,KAAK,CAACA,MAAaD,EAAYC,CAAQ,CAAC,IAG9DD,EAAYC,CAAQ;AAAA,EAElC;AAAA,EACD,IAAIG,GAASx1B,GAAS;AAClB,WAAO,IAAIm1B,GAAO;AAAA,MACd,GAAG,KAAK;AAAA,MACR,SAAS,EAAE,OAAOK,GAAS,SAAShJ,EAAU,SAASxsB,CAAO,EAAG;AAAA,IAC7E,CAAS;AAAA,EACJ;AAAA,EACD,IAAIld,GAASkd,GAAS;AAClB,WAAO,IAAIm1B,GAAO;AAAA,MACd,GAAG,KAAK;AAAA,MACR,SAAS,EAAE,OAAOryC,GAAS,SAAS0pC,EAAU,SAASxsB,CAAO,EAAG;AAAA,IAC7E,CAAS;AAAA,EACJ;AAAA,EACD,KAAKzhB,GAAMyhB,GAAS;AAChB,WAAO,KAAK,IAAIzhB,GAAMyhB,CAAO,EAAE,IAAIzhB,GAAMyhB,CAAO;AAAA,EACnD;AAAA,EACD,SAASA,GAAS;AACd,WAAO,KAAK,IAAI,GAAGA,CAAO;AAAA,EAC7B;AACL;AACAm1B,GAAO,SAAS,CAACJ,GAAW9sB,MACjB,IAAIktB,GAAO;AAAA,EACd,WAAAJ;AAAA,EACA,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAUnH,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMwtB,WAAoBtI,GAAQ;AAAA,EAC9B,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,WAAW,KAAK;AAAA,EACxB;AAAA,EACD,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,EAAK,IAAG,KAAK,oBAAoBjnB,CAAK;AAC9C,QAAIinB,EAAI,eAAehC,EAAc;AACjC,aAAA+B,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAEX,aAAS+J,EAAc1yB,GAAM1D,GAAO;AAChC,aAAOsrB,GAAU;AAAA,QACb,MAAM5nB;AAAA,QACN,MAAMsoB,EAAI;AAAA,QACV,WAAW;AAAA,UACPA,EAAI,OAAO;AAAA,UACXA,EAAI;AAAA,UACJX,GAAa;AAAA,UACbJ;AAAA,QACH,EAAC,OAAO,CAAC55B,MAAM,CAAC,CAACA,CAAC;AAAA,QACnB,WAAW;AAAA,UACP,MAAM64B,EAAa;AAAA,UACnB,gBAAgBlqB;AAAA,QACnB;AAAA,MACjB,CAAa;AAAA,IACJ;AACD,aAASq2B,EAAiBC,GAASt2B,GAAO;AACtC,aAAOsrB,GAAU;AAAA,QACb,MAAMgL;AAAA,QACN,MAAMtK,EAAI;AAAA,QACV,WAAW;AAAA,UACPA,EAAI,OAAO;AAAA,UACXA,EAAI;AAAA,UACJX,GAAa;AAAA,UACbJ;AAAA,QACH,EAAC,OAAO,CAAC55B,MAAM,CAAC,CAACA,CAAC;AAAA,QACnB,WAAW;AAAA,UACP,MAAM64B,EAAa;AAAA,UACnB,iBAAiBlqB;AAAA,QACpB;AAAA,MACjB,CAAa;AAAA,IACJ;AACD,UAAM2I,IAAS,EAAE,UAAUqjB,EAAI,OAAO,mBAAkB,GAClD9tC,IAAK8tC,EAAI;AACf,QAAI,KAAK,KAAK,mBAAmB0C,IAAY;AAIzC,YAAM6H,IAAK;AACX,aAAO5J,GAAG,kBAAmBjpB,GAAM;AAC/B,cAAM1D,IAAQ,IAAIoqB,GAAS,CAAA,CAAE,GACvBoM,IAAa,MAAMD,EAAG,KAAK,KAC5B,WAAW7yB,GAAMiF,CAAM,EACvB,MAAM,CAAC7Z,MAAM;AACd,gBAAAkR,EAAM,SAASo2B,EAAc1yB,GAAM5U,CAAC,CAAC,GAC/BkR;AAAA,QAC1B,CAAiB,GACKhP,IAAS,MAAM,QAAQ,MAAM9S,GAAI,MAAMs4C,CAAU;AAOvD,eANsB,MAAMD,EAAG,KAAK,QAAQ,KAAK,KAC5C,WAAWvlC,GAAQ2X,CAAM,EACzB,MAAM,CAAC7Z,MAAM;AACd,gBAAAkR,EAAM,SAASq2B,EAAiBrlC,GAAQlC,CAAC,CAAC,GACpCkR;AAAA,QAC1B,CAAiB;AAAA,MAEjB,CAAa;AAAA,IACJ,OACI;AAID,YAAMu2B,IAAK;AACX,aAAO5J,GAAG,YAAajpB,GAAM;AACzB,cAAM8yB,IAAaD,EAAG,KAAK,KAAK,UAAU7yB,GAAMiF,CAAM;AACtD,YAAI,CAAC6tB,EAAW;AACZ,gBAAM,IAAIpM,GAAS,CAACgM,EAAc1yB,GAAM8yB,EAAW,KAAK,CAAC,CAAC;AAE9D,cAAMxlC,IAAS,QAAQ,MAAM9S,GAAI,MAAMs4C,EAAW,IAAI,GAChDC,IAAgBF,EAAG,KAAK,QAAQ,UAAUvlC,GAAQ2X,CAAM;AAC9D,YAAI,CAAC8tB,EAAc;AACf,gBAAM,IAAIrM,GAAS,CAACiM,EAAiBrlC,GAAQylC,EAAc,KAAK,CAAC,CAAC;AAEtE,eAAOA,EAAc;AAAA,MACrC,CAAa;AAAA,IACJ;AAAA,EACJ;AAAA,EACD,aAAa;AACT,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,aAAa;AACT,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,QAAQjN,GAAO;AACX,WAAO,IAAI2M,GAAY;AAAA,MACnB,GAAG,KAAK;AAAA,MACR,MAAMvD,GAAS,OAAOpJ,CAAK,EAAE,KAAK4I,GAAW,QAAQ;AAAA,IACjE,CAAS;AAAA,EACJ;AAAA,EACD,QAAQsE,GAAY;AAChB,WAAO,IAAIP,GAAY;AAAA,MACnB,GAAG,KAAK;AAAA,MACR,SAASO;AAAA,IACrB,CAAS;AAAA,EACJ;AAAA,EACD,UAAUC,GAAM;AAEZ,WADsB,KAAK,MAAMA,CAAI;AAAA,EAExC;AAAA,EACD,gBAAgBA,GAAM;AAElB,WADsB,KAAK,MAAMA,CAAI;AAAA,EAExC;AAAA,EACD,OAAO,OAAOjzB,GAAM4yB,GAAS3tB,GAAQ;AACjC,WAAO,IAAIwtB,GAAY;AAAA,MACnB,MAAOzyB,KAEDkvB,GAAS,OAAO,EAAE,EAAE,KAAKR,GAAW,OAAM,CAAE;AAAA,MAClD,SAASkE,KAAWlE,GAAW,OAAQ;AAAA,MACvC,UAAU9D,EAAsB;AAAA,MAChC,GAAGd,EAAoB7kB,CAAM;AAAA,IACzC,CAAS;AAAA,EACJ;AACL;AACA,MAAMmrB,WAAgBjG,GAAQ;AAAA,EAC1B,IAAI,SAAS;AACT,WAAO,KAAK,KAAK;EACpB;AAAA,EACD,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,EAAK,IAAG,KAAK,oBAAoBjnB,CAAK;AAE9C,WADmB,KAAK,KAAK,OAAM,EACjB,OAAO,EAAE,MAAMinB,EAAI,MAAM,MAAMA,EAAI,MAAM,QAAQA,EAAK,CAAA;AAAA,EAC3E;AACL;AACA8H,GAAQ,SAAS,CAAC8C,GAAQjuB,MACf,IAAImrB,GAAQ;AAAA,EACf,QAAQ8C;AAAA,EACR,UAAUtI,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMorB,WAAmBlG,GAAQ;AAAA,EAC7B,OAAO9oB,GAAO;AACV,QAAIA,EAAM,SAAS,KAAK,KAAK,OAAO;AAChC,YAAMinB,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,UAAUA,EAAI;AAAA,QACd,MAAM9B,EAAa;AAAA,QACnB,UAAU,KAAK,KAAK;AAAA,MACpC,CAAa,GACMmC;AAAA,IACV;AACD,WAAO,EAAE,QAAQ,SAAS,OAAOtnB,EAAM,KAAI;AAAA,EAC9C;AAAA,EACD,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACAgvB,GAAW,SAAS,CAACnvC,GAAO+jB,MACjB,IAAIorB,GAAW;AAAA,EAClB,OAAOnvC;AAAA,EACP,UAAU0pC,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,SAAS4qB,GAActa,GAAQtQ,GAAQ;AACnC,SAAO,IAAIqrB,GAAQ;AAAA,IACf,QAAA/a;AAAA,IACA,UAAUqV,EAAsB;AAAA,IAChC,GAAGd,EAAoB7kB,CAAM;AAAA,EACrC,CAAK;AACL;AACA,MAAMqrB,WAAgBnG,GAAQ;AAAA,EAC1B,cAAc;AACV,UAAM,GAAG,SAAS,GAClBV,GAAe,IAAI,MAAM,MAAM;AAAA,EAClC;AAAA,EACD,OAAOpoB,GAAO;AACV,QAAI,OAAOA,EAAM,QAAS,UAAU;AAChC,YAAMinB,IAAM,KAAK,gBAAgBjnB,CAAK,GAChC8xB,IAAiB,KAAK,KAAK;AACjC,aAAA9K,EAAkBC,GAAK;AAAA,QACnB,UAAU7C,GAAK,WAAW0N,CAAc;AAAA,QACxC,UAAU7K,EAAI;AAAA,QACd,MAAM9B,EAAa;AAAA,MACnC,CAAa,GACMmC;AAAA,IACV;AAID,QAHKU,GAAuB,MAAMI,EAAmB,KACjDF,GAAuB,MAAME,IAAgB,IAAI,IAAI,KAAK,KAAK,MAAM,CAAM,GAE3E,CAACJ,GAAuB,MAAMI,EAAmB,EAAE,IAAIpoB,EAAM,IAAI,GAAG;AACpE,YAAMinB,IAAM,KAAK,gBAAgBjnB,CAAK,GAChC8xB,IAAiB,KAAK,KAAK;AACjC,aAAA9K,EAAkBC,GAAK;AAAA,QACnB,UAAUA,EAAI;AAAA,QACd,MAAM9B,EAAa;AAAA,QACnB,SAAS2M;AAAA,MACzB,CAAa,GACMxK;AAAA,IACV;AACD,WAAOM,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,IAAI,OAAO;AACP,UAAM+xB,IAAa,CAAA;AACnB,eAAWhxC,KAAO,KAAK,KAAK;AACxB,MAAAgxC,EAAWhxC,CAAG,IAAIA;AAEtB,WAAOgxC;AAAA,EACV;AAAA,EACD,IAAI,SAAS;AACT,UAAMA,IAAa,CAAA;AACnB,eAAWhxC,KAAO,KAAK,KAAK;AACxB,MAAAgxC,EAAWhxC,CAAG,IAAIA;AAEtB,WAAOgxC;AAAA,EACV;AAAA,EACD,IAAI,OAAO;AACP,UAAMA,IAAa,CAAA;AACnB,eAAWhxC,KAAO,KAAK,KAAK;AACxB,MAAAgxC,EAAWhxC,CAAG,IAAIA;AAEtB,WAAOgxC;AAAA,EACV;AAAA,EACD,QAAQ7d,GAAQ8d,IAAS,KAAK,MAAM;AAChC,WAAO/C,GAAQ,OAAO/a,GAAQ;AAAA,MAC1B,GAAG,KAAK;AAAA,MACR,GAAG8d;AAAA,IACf,CAAS;AAAA,EACJ;AAAA,EACD,QAAQ9d,GAAQ8d,IAAS,KAAK,MAAM;AAChC,WAAO/C,GAAQ,OAAO,KAAK,QAAQ,OAAO,CAACgD,MAAQ,CAAC/d,EAAO,SAAS+d,CAAG,CAAC,GAAG;AAAA,MACvE,GAAG,KAAK;AAAA,MACR,GAAGD;AAAA,IACf,CAAS;AAAA,EACJ;AACL;AACA5J,KAAiB,oBAAI,QAAO;AAC5B6G,GAAQ,SAAST;AACjB,MAAMU,WAAsBpG,GAAQ;AAAA,EAChC,cAAc;AACV,UAAM,GAAG,SAAS,GAClBT,GAAqB,IAAI,MAAM,MAAM;AAAA,EACxC;AAAA,EACD,OAAOroB,GAAO;AACV,UAAMkyB,IAAmB9N,GAAK,mBAAmB,KAAK,KAAK,MAAM,GAC3D6C,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,QAAIinB,EAAI,eAAehC,EAAc,UACjCgC,EAAI,eAAehC,EAAc,QAAQ;AACzC,YAAM6M,IAAiB1N,GAAK,aAAa8N,CAAgB;AACzD,aAAAlL,EAAkBC,GAAK;AAAA,QACnB,UAAU7C,GAAK,WAAW0N,CAAc;AAAA,QACxC,UAAU7K,EAAI;AAAA,QACd,MAAM9B,EAAa;AAAA,MACnC,CAAa,GACMmC;AAAA,IACV;AAID,QAHKU,GAAuB,MAAMK,EAAyB,KACvDH,GAAuB,MAAMG,IAAsB,IAAI,IAAIjE,GAAK,mBAAmB,KAAK,KAAK,MAAM,CAAC,CAAM,GAE1G,CAAC4D,GAAuB,MAAMK,EAAyB,EAAE,IAAIroB,EAAM,IAAI,GAAG;AAC1E,YAAM8xB,IAAiB1N,GAAK,aAAa8N,CAAgB;AACzD,aAAAlL,EAAkBC,GAAK;AAAA,QACnB,UAAUA,EAAI;AAAA,QACd,MAAM9B,EAAa;AAAA,QACnB,SAAS2M;AAAA,MACzB,CAAa,GACMxK;AAAA,IACV;AACD,WAAOM,GAAG5nB,EAAM,IAAI;AAAA,EACvB;AAAA,EACD,IAAI,OAAO;AACP,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACAqoB,KAAuB,oBAAI,QAAO;AAClC6G,GAAc,SAAS,CAAChb,GAAQtQ,MACrB,IAAIsrB,GAAc;AAAA,EACrB,QAAQhb;AAAA,EACR,UAAUqV,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAM+lB,WAAmBb,GAAQ;AAAA,EAC7B,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,EAAK,IAAG,KAAK,oBAAoBjnB,CAAK;AAC9C,QAAIinB,EAAI,eAAehC,EAAc,WACjCgC,EAAI,OAAO,UAAU;AACrB,aAAAD,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAEX,UAAM6K,IAAclL,EAAI,eAAehC,EAAc,UAC/CgC,EAAI,OACJ,QAAQ,QAAQA,EAAI,IAAI;AAC9B,WAAOW,GAAGuK,EAAY,KAAK,CAACvtC,MACjB,KAAK,KAAK,KAAK,WAAWA,GAAM;AAAA,MACnC,MAAMqiC,EAAI;AAAA,MACV,UAAUA,EAAI,OAAO;AAAA,IACrC,CAAa,CACJ,CAAC;AAAA,EACL;AACL;AACA0C,GAAW,SAAS,CAAC6D,GAAQ5pB,MAClB,IAAI+lB,GAAW;AAAA,EAClB,MAAM6D;AAAA,EACN,UAAUjE,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAM0lB,WAAmBR,GAAQ;AAAA,EAC7B,YAAY;AACR,WAAO,KAAK,KAAK;AAAA,EACpB;AAAA,EACD,aAAa;AACT,WAAO,KAAK,KAAK,OAAO,KAAK,aAAaS,EAAsB,aAC1D,KAAK,KAAK,OAAO,WAAY,IAC7B,KAAK,KAAK;AAAA,EACnB;AAAA,EACD,OAAOvpB,GAAO;AACV,UAAM,EAAE,QAAAvf,GAAQ,KAAAwmC,EAAG,IAAK,KAAK,oBAAoBjnB,CAAK,GAChDoyB,IAAS,KAAK,KAAK,UAAU,MAC7BC,IAAW;AAAA,MACb,UAAU,CAACC,MAAQ;AACf,QAAAtL,EAAkBC,GAAKqL,CAAG,GACtBA,EAAI,QACJ7xC,EAAO,MAAK,IAGZA,EAAO,MAAK;AAAA,MAEnB;AAAA,MACD,IAAI,OAAO;AACP,eAAOwmC,EAAI;AAAA,MACd;AAAA,IACb;AAEQ,QADAoL,EAAS,WAAWA,EAAS,SAAS,KAAKA,CAAQ,GAC/CD,EAAO,SAAS,cAAc;AAC9B,YAAMG,IAAYH,EAAO,UAAUnL,EAAI,MAAMoL,CAAQ;AACrD,UAAIpL,EAAI,OAAO;AACX,eAAO,QAAQ,QAAQsL,CAAS,EAAE,KAAK,OAAOA,MAAc;AACxD,cAAI9xC,EAAO,UAAU;AACjB,mBAAO6mC;AACX,gBAAMr7B,IAAS,MAAM,KAAK,KAAK,OAAO,YAAY;AAAA,YAC9C,MAAMsmC;AAAA,YACN,MAAMtL,EAAI;AAAA,YACV,QAAQA;AAAA,UAChC,CAAqB;AACD,iBAAIh7B,EAAO,WAAW,YACXq7B,IACPr7B,EAAO,WAAW,WAElBxL,EAAO,UAAU,UACVknC,GAAM17B,EAAO,KAAK,IACtBA;AAAA,QAC3B,CAAiB;AAEA;AACD,YAAIxL,EAAO,UAAU;AACjB,iBAAO6mC;AACX,cAAMr7B,IAAS,KAAK,KAAK,OAAO,WAAW;AAAA,UACvC,MAAMsmC;AAAA,UACN,MAAMtL,EAAI;AAAA,UACV,QAAQA;AAAA,QAC5B,CAAiB;AACD,eAAIh7B,EAAO,WAAW,YACXq7B,IACPr7B,EAAO,WAAW,WAElBxL,EAAO,UAAU,UACVknC,GAAM17B,EAAO,KAAK,IACtBA;AAAA,MACV;AAAA,IACJ;AACD,QAAImmC,EAAO,SAAS,cAAc;AAC9B,YAAMI,IAAoB,CAAChkC,MAAQ;AAC/B,cAAMvC,IAASmmC,EAAO,WAAW5jC,GAAK6jC,CAAQ;AAC9C,YAAIpL,EAAI,OAAO;AACX,iBAAO,QAAQ,QAAQh7B,CAAM;AAEjC,YAAIA,aAAkB;AAClB,gBAAM,IAAI,MAAM,2FAA2F;AAE/G,eAAOuC;AAAA,MACvB;AACY,UAAIy4B,EAAI,OAAO,UAAU,IAAO;AAC5B,cAAMwL,IAAQ,KAAK,KAAK,OAAO,WAAW;AAAA,UACtC,MAAMxL,EAAI;AAAA,UACV,MAAMA,EAAI;AAAA,UACV,QAAQA;AAAA,QAC5B,CAAiB;AACD,eAAIwL,EAAM,WAAW,YACVnL,KACPmL,EAAM,WAAW,WACjBhyC,EAAO,MAAK,GAEhB+xC,EAAkBC,EAAM,KAAK,GACtB,EAAE,QAAQhyC,EAAO,OAAO,OAAOgyC,EAAM;MAC/C;AAEG,eAAO,KAAK,KAAK,OACZ,YAAY,EAAE,MAAMxL,EAAI,MAAM,MAAMA,EAAI,MAAM,QAAQA,GAAK,EAC3D,KAAK,CAACwL,MACHA,EAAM,WAAW,YACVnL,KACPmL,EAAM,WAAW,WACjBhyC,EAAO,MAAK,GACT+xC,EAAkBC,EAAM,KAAK,EAAE,KAAK,OAChC,EAAE,QAAQhyC,EAAO,OAAO,OAAOgyC,EAAM,QAC/C,EACJ;AAAA,IAER;AACD,QAAIL,EAAO,SAAS;AAChB,UAAInL,EAAI,OAAO,UAAU,IAAO;AAC5B,cAAMv2B,IAAO,KAAK,KAAK,OAAO,WAAW;AAAA,UACrC,MAAMu2B,EAAI;AAAA,UACV,MAAMA,EAAI;AAAA,UACV,QAAQA;AAAA,QAC5B,CAAiB;AACD,YAAI,CAACnP,GAAQpnB,CAAI;AACb,iBAAOA;AACX,cAAMzE,IAASmmC,EAAO,UAAU1hC,EAAK,OAAO2hC,CAAQ;AACpD,YAAIpmC,aAAkB;AAClB,gBAAM,IAAI,MAAM,iGAAiG;AAErH,eAAO,EAAE,QAAQxL,EAAO,OAAO,OAAOwL,EAAM;AAAA,MAC/C;AAEG,eAAO,KAAK,KAAK,OACZ,YAAY,EAAE,MAAMg7B,EAAI,MAAM,MAAMA,EAAI,MAAM,QAAQA,GAAK,EAC3D,KAAK,CAACv2B,MACFonB,GAAQpnB,CAAI,IAEV,QAAQ,QAAQ0hC,EAAO,UAAU1hC,EAAK,OAAO2hC,CAAQ,CAAC,EAAE,KAAK,CAACpmC,OAAY,EAAE,QAAQxL,EAAO,OAAO,OAAOwL,EAAQ,EAAC,IAD9GyE,CAEd;AAGT,IAAA0zB,GAAK,YAAYgO,CAAM;AAAA,EAC1B;AACL;AACA9I,GAAW,SAAS,CAACkE,GAAQ4E,GAAQxuB,MAC1B,IAAI0lB,GAAW;AAAA,EAClB,QAAAkE;AAAA,EACA,UAAUjE,EAAsB;AAAA,EAChC,QAAA6I;AAAA,EACA,GAAG3J,EAAoB7kB,CAAM;AACrC,CAAK;AAEL0lB,GAAW,uBAAuB,CAACoJ,GAAYlF,GAAQ5pB,MAC5C,IAAI0lB,GAAW;AAAA,EAClB,QAAAkE;AAAA,EACA,QAAQ,EAAE,MAAM,cAAc,WAAWkF,EAAY;AAAA,EACrD,UAAUnJ,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAM4lB,WAAoBV,GAAQ;AAAA,EAC9B,OAAO9oB,GAAO;AAEV,WADmB,KAAK,SAASA,CAAK,MACnBilB,EAAc,YACtB2C,GAAG,MAAS,IAEhB,KAAK,KAAK,UAAU,OAAO5nB,CAAK;AAAA,EAC1C;AAAA,EACD,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACAwpB,GAAY,SAAS,CAACvwC,GAAM2qB,MACjB,IAAI4lB,GAAY;AAAA,EACnB,WAAWvwC;AAAA,EACX,UAAUswC,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAM6lB,WAAoBX,GAAQ;AAAA,EAC9B,OAAO9oB,GAAO;AAEV,WADmB,KAAK,SAASA,CAAK,MACnBilB,EAAc,OACtB2C,GAAG,IAAI,IAEX,KAAK,KAAK,UAAU,OAAO5nB,CAAK;AAAA,EAC1C;AAAA,EACD,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACAypB,GAAY,SAAS,CAACxwC,GAAM2qB,MACjB,IAAI6lB,GAAY;AAAA,EACnB,WAAWxwC;AAAA,EACX,UAAUswC,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMqmB,WAAmBnB,GAAQ;AAAA,EAC7B,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,EAAK,IAAG,KAAK,oBAAoBjnB,CAAK;AAC9C,QAAIpb,IAAOqiC,EAAI;AACf,WAAIA,EAAI,eAAehC,EAAc,cACjCrgC,IAAO,KAAK,KAAK,iBAEd,KAAK,KAAK,UAAU,OAAO;AAAA,MAC9B,MAAAA;AAAA,MACA,MAAMqiC,EAAI;AAAA,MACV,QAAQA;AAAA,IACpB,CAAS;AAAA,EACJ;AAAA,EACD,gBAAgB;AACZ,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACAgD,GAAW,SAAS,CAAChxC,GAAM2qB,MAChB,IAAIqmB,GAAW;AAAA,EAClB,WAAWhxC;AAAA,EACX,UAAUswC,EAAsB;AAAA,EAChC,cAAc,OAAO3lB,EAAO,WAAY,aAClCA,EAAO,UACP,MAAMA,EAAO;AAAA,EACnB,GAAG6kB,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMwmB,WAAiBtB,GAAQ;AAAA,EAC3B,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,EAAK,IAAG,KAAK,oBAAoBjnB,CAAK,GAExC2yB,IAAS;AAAA,MACX,GAAG1L;AAAA,MACH,QAAQ;AAAA,QACJ,GAAGA,EAAI;AAAA,QACP,QAAQ,CAAE;AAAA,MACb;AAAA,IACb,GACch7B,IAAS,KAAK,KAAK,UAAU,OAAO;AAAA,MACtC,MAAM0mC,EAAO;AAAA,MACb,MAAMA,EAAO;AAAA,MACb,QAAQ;AAAA,QACJ,GAAGA;AAAA,MACN;AAAA,IACb,CAAS;AACD,WAAI5K,GAAQ97B,CAAM,IACPA,EAAO,KAAK,CAACA,OACT;AAAA,MACH,QAAQ;AAAA,MACR,OAAOA,EAAO,WAAW,UACnBA,EAAO,QACP,KAAK,KAAK,WAAW;AAAA,QACnB,IAAI,QAAQ;AACR,iBAAO,IAAIo5B,GAASsN,EAAO,OAAO,MAAM;AAAA,QAC3C;AAAA,QACD,OAAOA,EAAO;AAAA,MAC1C,CAAyB;AAAA,IACzB,EACa,IAGM;AAAA,MACH,QAAQ;AAAA,MACR,OAAO1mC,EAAO,WAAW,UACnBA,EAAO,QACP,KAAK,KAAK,WAAW;AAAA,QACnB,IAAI,QAAQ;AACR,iBAAO,IAAIo5B,GAASsN,EAAO,OAAO,MAAM;AAAA,QAC3C;AAAA,QACD,OAAOA,EAAO;AAAA,MACtC,CAAqB;AAAA,IACrB;AAAA,EAEK;AAAA,EACD,cAAc;AACV,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACAvI,GAAS,SAAS,CAACnxC,GAAM2qB,MACd,IAAIwmB,GAAS;AAAA,EAChB,WAAWnxC;AAAA,EACX,UAAUswC,EAAsB;AAAA,EAChC,YAAY,OAAO3lB,EAAO,SAAU,aAAaA,EAAO,QAAQ,MAAMA,EAAO;AAAA,EAC7E,GAAG6kB,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMgvB,WAAe9J,GAAQ;AAAA,EACzB,OAAO9oB,GAAO;AAEV,QADmB,KAAK,SAASA,CAAK,MACnBilB,EAAc,KAAK;AAClC,YAAMgC,IAAM,KAAK,gBAAgBjnB,CAAK;AACtC,aAAAgnB,EAAkBC,GAAK;AAAA,QACnB,MAAM9B,EAAa;AAAA,QACnB,UAAUF,EAAc;AAAA,QACxB,UAAUgC,EAAI;AAAA,MAC9B,CAAa,GACMK;AAAA,IACV;AACD,WAAO,EAAE,QAAQ,SAAS,OAAOtnB,EAAM,KAAI;AAAA,EAC9C;AACL;AACA4yB,GAAO,SAAS,CAAChvB,MACN,IAAIgvB,GAAO;AAAA,EACd,UAAUrJ,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,MAAMivB,KAAQ,OAAO,WAAW;AAChC,MAAM3I,WAAmBpB,GAAQ;AAAA,EAC7B,OAAO9oB,GAAO;AACV,UAAM,EAAE,KAAAinB,EAAK,IAAG,KAAK,oBAAoBjnB,CAAK,GACxCpb,IAAOqiC,EAAI;AACjB,WAAO,KAAK,KAAK,KAAK,OAAO;AAAA,MACzB,MAAAriC;AAAA,MACA,MAAMqiC,EAAI;AAAA,MACV,QAAQA;AAAA,IACpB,CAAS;AAAA,EACJ;AAAA,EACD,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACA,MAAMqD,WAAoBxB,GAAQ;AAAA,EAC9B,OAAO9oB,GAAO;AACV,UAAM,EAAE,QAAAvf,GAAQ,KAAAwmC,EAAG,IAAK,KAAK,oBAAoBjnB,CAAK;AACtD,QAAIinB,EAAI,OAAO;AAqBX,cApBoB,YAAY;AAC5B,cAAM6L,IAAW,MAAM,KAAK,KAAK,GAAG,YAAY;AAAA,UAC5C,MAAM7L,EAAI;AAAA,UACV,MAAMA,EAAI;AAAA,UACV,QAAQA;AAAA,QAC5B,CAAiB;AACD,eAAI6L,EAAS,WAAW,YACbxL,IACPwL,EAAS,WAAW,WACpBryC,EAAO,MAAK,GACLknC,GAAMmL,EAAS,KAAK,KAGpB,KAAK,KAAK,IAAI,YAAY;AAAA,UAC7B,MAAMA,EAAS;AAAA,UACf,MAAM7L,EAAI;AAAA,UACV,QAAQA;AAAA,QAChC,CAAqB;AAAA,MAErB,GAC8B;AAEjB;AACD,YAAM6L,IAAW,KAAK,KAAK,GAAG,WAAW;AAAA,QACrC,MAAM7L,EAAI;AAAA,QACV,MAAMA,EAAI;AAAA,QACV,QAAQA;AAAA,MACxB,CAAa;AACD,aAAI6L,EAAS,WAAW,YACbxL,IACPwL,EAAS,WAAW,WACpBryC,EAAO,MAAK,GACL;AAAA,QACH,QAAQ;AAAA,QACR,OAAOqyC,EAAS;AAAA,MACpC,KAGuB,KAAK,KAAK,IAAI,WAAW;AAAA,QAC5B,MAAMA,EAAS;AAAA,QACf,MAAM7L,EAAI;AAAA,QACV,QAAQA;AAAA,MAC5B,CAAiB;AAAA,IAER;AAAA,EACJ;AAAA,EACD,OAAO,OAAO9iC,GAAGhB,GAAG;AAChB,WAAO,IAAImnC,GAAY;AAAA,MACnB,IAAInmC;AAAA,MACJ,KAAKhB;AAAA,MACL,UAAUomC,EAAsB;AAAA,IAC5C,CAAS;AAAA,EACJ;AACL;AACA,MAAMgB,WAAoBzB,GAAQ;AAAA,EAC9B,OAAO9oB,GAAO;AACV,UAAM/T,IAAS,KAAK,KAAK,UAAU,OAAO+T,CAAK,GACzC+yB,IAAS,CAACnuC,OACRkzB,GAAQlzB,CAAI,MACZA,EAAK,QAAQ,OAAO,OAAOA,EAAK,KAAK,IAElCA;AAEX,WAAOmjC,GAAQ97B,CAAM,IACfA,EAAO,KAAK,CAACrH,MAASmuC,EAAOnuC,CAAI,CAAC,IAClCmuC,EAAO9mC,CAAM;AAAA,EACtB;AAAA,EACD,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACpB;AACL;AACAs+B,GAAY,SAAS,CAACtxC,GAAM2qB,MACjB,IAAI2mB,GAAY;AAAA,EACnB,WAAWtxC;AAAA,EACX,UAAUswC,EAAsB;AAAA,EAChC,GAAGd,EAAoB7kB,CAAM;AACrC,CAAK;AAEL,SAASovB,GAAO/J,GAAOrlB,IAAS,CAAE,GAWlCqvB,GAAO;AACH,SAAIhK,IACOmE,GAAO,OAAQ,EAAC,YAAY,CAACxoC,GAAMqiC,MAAQ;AAC9C,QAAI3tC,GAAIK;AACR,QAAI,CAACsvC,EAAMrkC,CAAI,GAAG;AACd,YAAMvF,IAAI,OAAOukB,KAAW,aACtBA,EAAOhf,CAAI,IACX,OAAOgf,KAAW,WACd,EAAE,SAASA,EAAQ,IACnBA,GACJsvB,KAAUv5C,KAAML,IAAK+F,EAAE,WAAW,QAAQ/F,MAAO,SAASA,IAAK25C,OAAW,QAAQt5C,MAAO,SAASA,IAAK,IACvGw5C,IAAK,OAAO9zC,KAAM,WAAW,EAAE,SAASA,EAAG,IAAGA;AACpD,MAAA4nC,EAAI,SAAS,EAAE,MAAM,UAAU,GAAGkM,GAAI,OAAOD,EAAM,CAAE;AAAA,IACxD;AAAA,EACb,CAAS,IACE9F,GAAO;AAClB;AACA,MAAMgG,KAAO;AAAA,EACT,QAAQ1F,GAAU;AACtB;AACA,IAAInE;AAAA,CACH,SAAUA,GAAuB;AAC9B,EAAAA,EAAsB,YAAe,aACrCA,EAAsB,YAAe,aACrCA,EAAsB,SAAY,UAClCA,EAAsB,YAAe,aACrCA,EAAsB,aAAgB,cACtCA,EAAsB,UAAa,WACnCA,EAAsB,YAAe,aACrCA,EAAsB,eAAkB,gBACxCA,EAAsB,UAAa,WACnCA,EAAsB,SAAY,UAClCA,EAAsB,aAAgB,cACtCA,EAAsB,WAAc,YACpCA,EAAsB,UAAa,WACnCA,EAAsB,WAAc,YACpCA,EAAsB,YAAe,aACrCA,EAAsB,WAAc,YACpCA,EAAsB,wBAA2B,yBACjDA,EAAsB,kBAAqB,mBAC3CA,EAAsB,WAAc,YACpCA,EAAsB,YAAe,aACrCA,EAAsB,SAAY,UAClCA,EAAsB,SAAY,UAClCA,EAAsB,cAAiB,eACvCA,EAAsB,UAAa,WACnCA,EAAsB,aAAgB,cACtCA,EAAsB,UAAa,WACnCA,EAAsB,aAAgB,cACtCA,EAAsB,gBAAmB,iBACzCA,EAAsB,cAAiB,eACvCA,EAAsB,cAAiB,eACvCA,EAAsB,aAAgB,cACtCA,EAAsB,WAAc,YACpCA,EAAsB,aAAgB,cACtCA,EAAsB,aAAgB,cACtCA,EAAsB,cAAiB,eACvCA,EAAsB,cAAiB;AAC3C,GAAGA,MAA0BA,IAAwB,CAAE,EAAC;AACxD,MAAM8J,KAAiB,CAEvBC,GAAK1vB,IAAS;AAAA,EACV,SAAS,yBAAyB0vB,EAAI,IAAI;AAC9C,MAAMN,GAAO,CAACpuC,MAASA,aAAgB0uC,GAAK1vB,CAAM,GAC5C2vB,KAAa3H,GAAU,QACvB4H,KAAa9G,GAAU,QACvB+G,KAAUb,GAAO,QACjBc,KAAa9G,GAAU,QACvB+G,KAAc9G,GAAW,QACzB+G,KAAW9G,GAAQ,QACnB+G,KAAa5G,GAAU,QACvB6G,KAAgB5G,GAAa,QAC7B6G,KAAW5G,GAAQ,QACnB6G,KAAU5G,GAAO,QACjB6G,KAAc5G,GAAW,QACzB6G,KAAY5G,GAAS,QACrB6G,KAAW5G,GAAQ,QACnB6G,KAAY1K,GAAS,QACrB2K,KAAa3G,GAAU,QACvB4G,KAAmB5G,GAAU,cAC7B6G,KAAY1K,GAAS,QACrB2K,KAAyBrF,GAAsB,QAC/CsF,KAAmB1K,GAAgB,QACnC2K,KAAY7G,GAAS,QACrB8G,KAAanE,GAAU,QACvBoE,KAAUhE,GAAO,QACjBiE,KAAU/D,GAAO,QACjBgE,KAAe1D,GAAY,QAC3B2D,KAAWhG,GAAQ,QACnBiG,KAAchG,GAAW,QACzBiG,KAAWhG,GAAQ,QACnBiG,KAAiBhG,GAAc,QAC/BiG,KAAcxL,GAAW,QACzByL,KAAc9L,GAAW,QACzB+L,KAAe7L,GAAY,QAC3B8L,KAAe7L,GAAY,QAC3B8L,KAAiBjM,GAAW,sBAC5BkM,KAAelL,GAAY,QAC3BmL,KAAU,MAAMlC,KAAa,YAC7BmC,KAAU,MAAMlC,KAAa,YAC7BmC,KAAW,MAAMhC,KAAc,YAC/BiC,KAAS;AAAA,EACX,QAAS,CAACtD,MAAQ1G,GAAU,OAAO,EAAE,GAAG0G,GAAK,QAAQ,GAAI,CAAE;AAAA,EAC3D,QAAS,CAACA,MAAQ5F,GAAU,OAAO,EAAE,GAAG4F,GAAK,QAAQ,GAAI,CAAE;AAAA,EAC3D,SAAU,CAACA,MAAQzF,GAAW,OAAO;AAAA,IACjC,GAAGyF;AAAA,IACH,QAAQ;AAAA,EAChB,CAAK;AAAA,EACD,QAAS,CAACA,MAAQ1F,GAAU,OAAO,EAAE,GAAG0F,GAAK,QAAQ,GAAI,CAAE;AAAA,EAC3D,MAAO,CAACA,MAAQxF,GAAQ,OAAO,EAAE,GAAGwF,GAAK,QAAQ,GAAI,CAAE;AAC3D,GACMuD,KAAQvO;AAEd,IAAIhxB,IAAiB,uBAAO,OAAO;AAAA,EAC/B,WAAW;AAAA,EACX,iBAAiB4vB;AAAA,EACjB,aAAaG;AAAA,EACb,aAAaC;AAAA,EACb,WAAWC;AAAA,EACX,YAAYQ;AAAA,EACZ,mBAAmBC;AAAA,EACnB,aAAaG;AAAA,EACb,SAASG;AAAA,EACT,OAAOK;AAAA,EACP,IAAIC;AAAA,EACJ,WAAWC;AAAA,EACX,SAASC;AAAA,EACT,SAAShQ;AAAA,EACT,SAASiQ;AAAA,EACT,IAAI,OAAQ;AAAE,WAAO3D;AAAA,EAAO;AAAA,EAC5B,IAAI,aAAc;AAAE,WAAOU;AAAA,EAAa;AAAA,EACxC,eAAeG;AAAA,EACf,eAAeC;AAAA,EACf,SAAS4D;AAAA,EACT,eAAe0C;AAAA,EACf,WAAWI;AAAA,EACX,WAAWc;AAAA,EACX,WAAWE;AAAA,EACX,YAAYC;AAAA,EACZ,SAASC;AAAA,EACT,WAAWG;AAAA,EACX,cAAcC;AAAA,EACd,SAASC;AAAA,EACT,QAAQC;AAAA,EACR,YAAYC;AAAA,EACZ,UAAUC;AAAA,EACV,SAASC;AAAA,EACT,UAAU7D;AAAA,EACV,WAAWgE;AAAA,EACX,UAAU7D;AAAA,EACV,uBAAuBsF;AAAA,EACvB,iBAAiBpF;AAAA,EACjB,UAAU8D;AAAA,EACV,WAAW2C;AAAA,EACX,QAAQI;AAAA,EACR,QAAQE;AAAA,EACR,aAAaM;AAAA,EACb,SAASrC;AAAA,EACT,YAAYC;AAAA,EACZ,SAASC;AAAA,EACT,eAAeC;AAAA,EACf,YAAYvF;AAAA,EACZ,YAAYL;AAAA,EACZ,gBAAgBA;AAAA,EAChB,aAAaE;AAAA,EACb,aAAaC;AAAA,EACb,YAAYQ;AAAA,EACZ,UAAUG;AAAA,EACV,QAAQwI;AAAA,EACR,OAAOC;AAAA,EACP,YAAY3I;AAAA,EACZ,aAAaI;AAAA,EACb,aAAaC;AAAA,EACb,QAAQyI;AAAA,EACR,QAAQlK;AAAA,EACR,WAAWA;AAAA,EACX,MAAMsK;AAAA,EACN,IAAI,wBAAyB;AAAE,WAAO7J;AAAA,EAAwB;AAAA,EAC9D,QAAQqM;AAAA,EACR,KAAK5B;AAAA,EACL,OAAOI;AAAA,EACP,QAAQV;AAAA,EACR,SAASC;AAAA,EACT,MAAMC;AAAA,EACN,oBAAoBY;AAAA,EACpB,QAAQY;AAAA,EACR,MAAQH;AAAA,EACR,UAAYH;AAAA,EACZ,YAAczB;AAAA,EACd,cAAcoB;AAAA,EACd,MAAMM;AAAA,EACN,SAASC;AAAA,EACT,KAAKJ;AAAA,EACL,KAAKnB;AAAA,EACL,YAAYyB;AAAA,EACZ,OAAOhB;AAAA,EACP,MAAQH;AAAA,EACR,UAAUuB;AAAA,EACV,QAAQ9B;AAAA,EACR,QAAQa;AAAA,EACR,UAAUsB;AAAA,EACV,SAASD;AAAA,EACT,UAAUL;AAAA,EACV,SAASI;AAAA,EACT,UAAUD;AAAA,EACV,YAAYD;AAAA,EACZ,SAASJ;AAAA,EACT,QAAQR;AAAA,EACR,KAAKE;AAAA,EACL,cAAcP;AAAA,EACd,QAAQf;AAAA,EACR,QAAQM;AAAA,EACR,aAAauB;AAAA,EACb,OAAOV;AAAA,EACP,WAAaZ;AAAA,EACb,OAAOS;AAAA,EACP,SAASN;AAAA,EACT,MAAQE;AAAA,EACR,OAAO0B;AAAA,EACP,cAAc1Q;AAAA,EACd,eAAeC;AAAA,EACf,UAAUC;AACd,CAAC;AC7nIG,MAAMyQ,GAAQ;AAAA;AAAA,EACuD,OAAO,KAAK;AACjF,WAAOx/B,EAAE,OAAM,EAAG,MAAM,gBAAgB;AAAA,EACzC;AAAA;AAAA,EAC0B,OAAO,QAAQ;AACxC,WAAOA,EAAE,OAAO;AAAA,MACd,IAAIw/B,GAAQ,GAAI;AAAA,MAChB,MAAMx/B,EAAE,OAAQ,EAAC,IAAG,EAAG,YAAa;AAAA,MACpC,QAAQw/B,GAAQ,GAAI;AAAA,MACpB,MAAMx/B,EAAE,OAAQ,EAAC,MAAK,EAAG,MAAO;AAAA,MAChC,SAASA,EAAE,OAAQ;AAAA,MACnB,YAAYA,EAAE,OAAQ,EAAC,IAAG,EAAG,YAAa;AAAA,MAC1C,KAAKA,EAAE,OAAQ;AAAA,IACrB,CAAK;AAAA,EACF;AAAA;AAAA,EAC2B,OAAO,SAAS;AAC1C,WAAOA,EAAE,OAAO;AAAA,MACd,OAAOA,EAAE,SAAS,IAAK,EAAC,YAAa,EAAC,MAAO,EAAC,SAAU;AAAA,MACxD,KAAKw/B,GAAQ,GAAI,EAAC,MAAK,EAAG,SAAU;AAAA,MACpC,SAASA,GAAQ,GAAI,EAAC,MAAK,EAAG,SAAU;AAAA,MACxC,OAAOx/B,EAAE,OAAQ,EAAC,IAAG,EAAG,YAAa,EAAC,SAAU;AAAA,MAChD,OAAOA,EAAE,OAAQ,EAAC,IAAG,EAAG,YAAa,EAAC,SAAU;AAAA,MAChD,OAAOA,EAAE,OAAQ,EAAC,IAAG,EAAG,YAAa,EAAC,SAAU;AAAA,MAChD,QAAQA,EAAE,OAAQ,EAAC,SAAU;AAAA,IAC9B,CAAA,EAAE,YAAW,EAAG,UAAU,CAACzW,MAAQ;AAClC,YAAMi+B,IAAO;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACR;AACM,aAAO,OAAO,QAAQj+B,CAAK,EAAE,OAAO,CAAC2O,GAAK,CAAC/O,GAAKsB,CAAG,QAC7C+8B,EAAK,SAASr+B,CAAG,KAAKA,EAAI,WAAW,GAAG,OAC1C+O,EAAI/O,CAAG,IAAIsB,IAENyN,IACN,CAAE,CAAA;AAAA,IACX,CAAK;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAIG,OAAO,OAAOiK,GAAQ;AACxB,WAAOnC,EAAE,SAAS,MAAM,4DAA4D,EAAE,OAAO,CAACzW,MAAQ4Y,IAAS5Y,EAAM,WAAW,GAAG4Y,CAAM,GAAG,IAAI,EAAI;AAAA,EACrJ;AAAA;AAAA,EACmD,OAAO,cAAc;AACvE,WAAOnC,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,OAAO;AAAA,MACjBw/B,GAAQ,MAAO;AAAA,IACrB,CAAK;AAAA,EACF;AAAA;AAAA,EACiD,OAAO,YAAY;AACnE,WAAOx/B,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,KAAK;AAAA,MACfA,EAAE,OAAQ;AAAA,IACX,CAAA,EAAE,KAAKw/B,GAAQ,OAAQ,CAAA;AAAA,EACzB;AAAA;AAAA,EACmD,OAAO,cAAc;AACvE,WAAOx/B,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,OAAO;AAAA,MACjBA,EAAE,OAAQ;AAAA,IACX,CAAA,EAAE,KAAKw/B,GAAQ,OAAQ,CAAA;AAAA,EACzB;AAAA;AAAA,EACmD,OAAO,cAAc;AACvE,WAAOx/B,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,OAAO;AAAA,MACjBA,EAAE,OAAQ;AAAA,IAChB,CAAK;AAAA,EACF;AAAA;AAAA,EACkD,OAAO,aAAa;AACrE,WAAOA,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,MAAM;AAAA,MAChBw/B,GAAQ,MAAO;AAAA,IACrB,CAAK;AAAA,EACF;AAAA;AAAA,EAC2C,OAAO,YAAY;AAC7D,WAAOx/B,EAAE,MAAM;AAAA,MACbw/B,GAAQ,YAAa;AAAA,MACrBA,GAAQ,UAAW;AAAA,MACnBA,GAAQ,YAAa;AAAA,MACrBA,GAAQ,YAAa;AAAA,MACrBA,GAAQ,WAAY;AAAA,IAC1B,CAAK;AAAA,EACF;AAAA;AAAA,EACmD,OAAO,aAAa;AACtE,WAAOx/B,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,OAAO;AAAA,MACjBA,EAAE,OAAQ;AAAA,MACVw/B,GAAQ,MAAO;AAAA,IACrB,CAAK;AAAA,EACF;AAAA;AAAA,EACgD,OAAO,UAAU;AAChE,WAAOx/B,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,IAAI;AAAA,MACdw/B,GAAQ,GAAI;AAAA,MACZx/B,EAAE,QAAS;AAAA,MACXA,EAAE,OAAQ;AAAA,IAChB,CAAK;AAAA,EACF;AAAA;AAAA,EACkD,OAAO,YAAY;AACpE,WAAOA,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,MAAM;AAAA,MAChBA,EAAE,OAAQ;AAAA,IAChB,CAAK;AAAA,EACF;AAAA;AAAA,EACoD,OAAO,cAAc;AACxE,WAAOA,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,QAAQ;AAAA,MAClBA,EAAE,OAAQ;AAAA,IAChB,CAAK;AAAA,EACF;AAAA;AAAA,EACoD,OAAO,cAAc;AACxE,WAAOA,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,QAAQ;AAAA,MAClBA,EAAE,OAAQ;AAAA,MACVA,EAAE,OAAQ;AAAA,IAChB,CAAK;AAAA,EACF;AAAA;AAAA,EACkD,OAAO,YAAY;AACpE,WAAOA,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,MAAM;AAAA,MAChBA,EAAE,OAAQ;AAAA,IAChB,CAAK;AAAA,EACF;AAAA;AAAA,EACmD,OAAO,aAAa;AACtE,WAAOA,EAAE,MAAM;AAAA,MACbA,EAAE,QAAQ,OAAO;AAAA,MACjBA,EAAE,OAAQ;AAAA,MACVA,EAAE,OAAO;AAAA,QACP,OAAOA,EAAE,OAAQ,EAAC,IAAG,EAAG,YAAa;AAAA,QACrC,aAAaA,EAAE,QAAS,EAAC,SAAU;AAAA,MAC3C,CAAO;AAAA,IACP,CAAK;AAAA,EACF;AAAA;AAAA,EAC2C,OAAO,WAAW;AAC5D,WAAOA,EAAE,MAAM;AAAA,MACbw/B,GAAQ,WAAY;AAAA,MACpBA,GAAQ,QAAS;AAAA,MACjBA,GAAQ,UAAW;AAAA,MACnBA,GAAQ,YAAa;AAAA,MACrBA,GAAQ,YAAa;AAAA,MACrBA,GAAQ,UAAW;AAAA,MACnBA,GAAQ,WAAY;AAAA,IAC1B,CAAK;AAAA,EACF;AAAA;AAAA,EAC6B,OAAO,WAAW;AAC9C,WAAOx/B,EAAE,OAAO;AAAA,MACd,OAAOA,EAAE,OAAM,EAAG,SAAU,EAAC,MAAM,MAAS;AAAA,MAC5C,QAAQA,EAAE,SAAS,IAAK,EAAC,SAAU,EAAC,MAAM,MAAS;AAAA,MACnD,KAAKA,EAAE,QAAO,EAAG,SAAU,EAAC,MAAM,MAAS;AAAA,MAC3C,cAAcA,EAAE,OAAM,EAAG,SAAU,EAAC,MAAM,MAAS;AAAA,MACnD,OAAOw/B,GAAQ,OAAO,OAAO,EAAE,SAAU,EAAC,MAAM,MAAS;AAAA,MACzD,OAAOx/B,EAAE,SAAS,MAAO,EAAC,SAAU,EAAC,MAAM,MAAS;AAAA,MACpD,MAAMA,EAAE,OAAM,EAAG,SAAU,EAAC,MAAM,MAAS;AAAA,MAC3C,OAAOA,EAAE,SAAS,MAAO,EAAC,SAAU,EAAC,MAAM,MAAS;AAAA,MACpD,SAASA,EAAE,SAAS,IAAK,EAAC,SAAU,EAAC,MAAM,MAAS;AAAA,MACpD,SAASA,EAAE,SAAS,IAAK,EAAC,SAAU,EAAC,MAAM,MAAS;AAAA,IAC1D,CAAK,EAAE,YAAW;AAAA,EACf;AAAA;AAAA,EACqC,OAAO,iBAAiB;AAC5D,WAAOA,EAAE,OAAO;AAAA,MACd,IAAIA,EAAE,OAAQ;AAAA,MACd,QAAQA,EAAE,OAAQ;AAAA,MAClB,QAAQA,EAAE,OAAQ,EAAC,MAAO;AAAA,IAChC,CAAK;AAAA,EACF;AAAA;AAAA,EACsC,OAAO,kBAAkB;AAC9D,WAAOA,EAAE,OAAO;AAAA,MACd,IAAIA,EAAE,OAAQ;AAAA,MACd,QAAQA,EAAE,OAAQ;AAAA,MAClB,OAAOA,EAAE,OAAQ,EAAC,SAAU;AAAA,IAClC,CAAK;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOG,OAAO,OAAO;AAChB,WAAOA,EAAE,OAAQ,EAAC,UAAU,CAACzW,GAAOonC,MAAM;AACxC,UAAI;AACF,eAAO,KAAK,MAAMpnC,CAAK;AAAA,MACxB,QAAY;AACX,eAAAonC,EAAI,SAAS;AAAA,UACX,MAAM3wB,EAAE,aAAa;AAAA,UACrB,SAAS;AAAA,QACnB,CAAS,GACMA,EAAE;AAAA,MACV;AAAA,IACP,CAAK;AAAA,EACF;AACH;AC5MgH,MAAMy/B,GAAe;AAAA,EAMnI,YAAY,EAAE,OAAAhW,GAAO,QAAA5K,GAAQ,QAAA6gB,GAAQ,SAAAC,GAAS,YAAAC,IAAa,WAAU;AALrE,IAAA38C,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AAwBA,IAAAA,EAAA,eAAQ;AAAA,MACN,SAAS,OAAO47B,GAAQhP,MACf,KAAK,IAAI,iBAAiB;AAAA,QAC/BgP;AAAA,QACAhP;AAAA,MACR,CAAO;AAAA,MAEH,SAAS,OAAOgP,GAAQnO,MACf,KAAK,IAAI,iBAAiB;AAAA,QAC/BmO;AAAA,QACAnO;AAAA,MACR,CAAO;AAAA,IAEP;AACE,IAAAztB,EAAA,eAAQ;AAAA,MACN,SAAS,OAAO47B,GAAQhP,MACf,KAAK,IAAI,iBAAiB;AAAA,QAC/BgP;AAAA,QACAhP;AAAA,MACR,CAAO;AAAA,MAEH,SAAS,OAAOgP,GAAQnO,MACf,KAAK,IAAI,iBAAiB;AAAA,QAC/BmO;AAAA,QACAnO;AAAA,MACR,CAAO;AAAA,IAEP;AAjDI,SAAK,QAAQ+Y,GACb,KAAK,SAAS5K,GACd,KAAK,SAAS6gB,GACd,KAAK,UAAUC,GACf,KAAK,aAAaC;AAAA,EACnB;AAAA,EACD,MAAM,eAAe;AACnB,WAAO,KAAK,IAAI,kBAAkB,CAAE,CAAA;AAAA,EACrC;AAAA,EACD,MAAM,UAAUhpB,GAAO;AACrB,UAAMjhB,IAAS,MAAM,KAAK,IAAI,cAAc;AAAA,MAC1C,KAAK,UAAUihB,CAAK;AAAA,IAC1B,CAAK;AACD,WAAOzyB,GAAE,KAAM,EAAC,KAAKA,GAAE,OAAO,EAAE,MAAMwR,CAAM;AAAA,EAC7C;AAAA,EACD,MAAM,YAAY;AAChB,UAAMA,IAAS,MAAM,KAAK,IAAI,cAAc,CAAE,CAAA;AAC9C,WAAOxR,GAAE,OAAO,KAAK6b,EAAE,OAAOA,EAAE,OAAM,GAAIA,EAAE,OAAO;AAAA,MACjD,MAAMA,EAAE,QAAS;AAAA,MACjB,OAAOA,EAAE,QAAS;AAAA,IACnB,CAAA,CAAC,CAAC,EAAE,MAAMrK,CAAM;AAAA,EAClB;AAAA;AAAA,EA6B2E,MAAM,QAAQ+zB,GAAQ;AAChG,UAAMpc,IAAS;AAAA,MACb,KAAK;AAAA,IACX;AACI,WAAIoc,KACFpc,EAAO,KAAKoc,CAAM,GAEb,KAAK,IAAI,WAAWpc,CAAM;AAAA,EAClC;AAAA;AAAA,EAC0E,MAAM,OAAO;AACtF,WAAO,KAAK,IAAI,QAAQ,CAAE,CAAA;AAAA,EAC3B;AAAA;AAAA,EAC4E,MAAM,IAAIkf,GAAQlf,GAAQ;AACrG,UAAMxiB,IAAS,OAAO,KAAK,WAAY,WAAW,YAAY,QAAQ,KAAK,OAAO,IAAI,QAChF,EAAE,QAAA6K,GAAQ,OAAAgP,EAAO,IAAG,MAAM,KAAK,KAAK;AAAA,MACxC,IAAI,OAAO,WAAY;AAAA,MACvB,QAAA6nB;AAAA,MACA,QAAAlf;AAAA,IACN,GAAO;AAAA,MACD,QAAAxiB;AAAA,IACN,CAAK;AACD,QAAI6Z;AACF,YAAM,IAAI,MAAMA,CAAK;AAEvB,WAAOhP;AAAA,EACR;AAAA;AAAA,EAC2E,MAAM,KAAKkqC,GAASnoC,IAAO,IAAI;AACzG,UAAM,EAAE,QAAA5M,EAAQ,IAAG4M,GACbkf,IAAQ,MAAM,KAAK,OAAO,UAAU;AAAA,MACxC,MAAM;AAAA,MACN,SAAS,MAAM,KAAK,QAAQ,KAAK,QAAQ,KAAK,UAAUipB,CAAO,CAAC;AAAA,MAChE,YAAY,KAAK,MAAM,KAAK,IAAG,IAAK,GAAI;AAAA,MACxC,MAAM;AAAA,QACJ;AAAA,UACE;AAAA,UACA,KAAK;AAAA,QACN;AAAA,MACF;AAAA,IACP,CAAK,GACKC,IAAQ,MAAM,KAAK,OAAO,aAAY,GACtCC,IAAM,KAAK,MAAM,IAAI;AAAA,MACzB;AAAA,QACE,OAAO;AAAA,UACL;AAAA,QACD;AAAA,QACD,SAAS;AAAA,UACP,KAAK;AAAA,QACN;AAAA,QACD,MAAM;AAAA,UACJD;AAAA,QACD;AAAA,MACF;AAAA,IACP,GAAO;AAAA,MACD,QAAAh1C;AAAA,IACN,CAAK;AACD,UAAM,KAAK,MAAM,MAAM8rB,GAAO;AAAA,MAC5B,QAAA9rB;AAAA,IACN,CAAK;AACD,qBAAiBpI,KAAOq9C,GAAI;AAC1B,UAAIr9C,EAAI,CAAC,MAAM,SAAU,OAAM,IAAI,MAAM,qBAAqB;AAC9D,UAAIA,EAAI,CAAC,MAAM,SAAS;AACtB,cAAMk0B,IAAQl0B,EAAI,CAAC,GACbs9C,IAAY,MAAM,KAAK,QAAQ,KAAK,QAAQppB,EAAM,OAAO,GACzDqpB,IAAW97C,GAAE,KAAI,EAAG,KAAKA,GAAE,iBAAiB,EAAE,MAAM67C,CAAS;AACnE,YAAIC,EAAS,OAAOJ,EAAQ;AAC1B,iBAAOI;AAAA,MAEV;AAAA,IACF;AACD,UAAM,IAAI,MAAM,aAAa;AAAA,EAC9B;AAAA;AAAA,EAC2C,MAAM,QAAQphB,GAAQhP,GAAW;AAC3E,YAAO,KAAK,YAAU;AAAA,MACpB,KAAK;AACH,eAAO,KAAK,OAAO,MAAM,QAAQgP,GAAQhP,CAAS;AAAA,MACpD,KAAK;AACH,eAAO,KAAK,OAAO,MAAM,QAAQgP,GAAQhP,CAAS;AAAA,IACrD;AAAA,EACF;AAAA;AAAA,EAC2C,MAAM,QAAQgP,GAAQnO,GAAY;AAC5E,YAAO,KAAK,YAAU;AAAA,MACpB,KAAK;AACH,eAAO,KAAK,OAAO,MAAM,QAAQmO,GAAQnO,CAAU;AAAA,MACrD,KAAK;AACH,eAAO,KAAK,OAAO,MAAM,QAAQmO,GAAQnO,CAAU;AAAA,IACtD;AAAA,EACF;AACH;ACnJA,SAASzjB,GAAO,GAAG;AACf,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAChC,UAAM,IAAI,MAAM,kCAAkC,CAAC,EAAE;AAC7D;AAMO,SAAS+f,GAAQnf,GAAG;AACvB,SAAQA,aAAa,cAChBA,KAAK,QAAQ,OAAOA,KAAM,YAAYA,EAAE,YAAY,SAAS;AACtE;AACA,SAASX,GAAML,MAAMM,GAAS;AAC1B,MAAI,CAAC6f,GAAQngB,CAAC;AACV,UAAM,IAAI,MAAM,qBAAqB;AACzC,MAAIM,EAAQ,SAAS,KAAK,CAACA,EAAQ,SAASN,EAAE,MAAM;AAChD,UAAM,IAAI,MAAM,iCAAiCM,CAAO,mBAAmBN,EAAE,MAAM,EAAE;AAC7F;AACA,SAASO,GAAKsC,GAAG;AACb,MAAI,OAAOA,KAAM,cAAc,OAAOA,EAAE,UAAW;AAC/C,UAAM,IAAI,MAAM,iDAAiD;AACrE,EAAAzC,GAAOyC,EAAE,SAAS,GAClBzC,GAAOyC,EAAE,QAAQ;AACrB;AACA,SAASrC,GAAOC,GAAUC,IAAgB,IAAM;AAC5C,MAAID,EAAS;AACT,UAAM,IAAI,MAAM,kCAAkC;AACtD,MAAIC,KAAiBD,EAAS;AAC1B,UAAM,IAAI,MAAM,uCAAuC;AAC/D;AACA,SAASE,GAAOC,GAAKH,GAAU;AAC3B,EAAAJ,GAAMO,CAAG;AACT,QAAMC,IAAMJ,EAAS;AACrB,MAAIG,EAAI,SAASC;AACb,UAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE;AAEtF;ACrCO,MAAMC,KAAS,OAAO,cAAe,YAAY,YAAY,aAAa,WAAW,SAAS;ACArG;AAmBO,MAAMG,KAAa,CAACjE,MAAQ,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU,GAE7EkE,KAAO,CAACC,GAAMC,MAAWD,KAAS,KAAKC,IAAWD,MAASC,GAE3DujB,KAAO,CAACxjB,GAAMC,MAAWD,KAAQC,IAAWD,MAAU,KAAKC,MAAY;AAChE,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC;AAe1E,MAAMqE,KAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAK,GAAE,CAACpP,GAAGkG,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAI5F,SAASmJ,GAAWrF,GAAO;AAC9BwhB,EAAAA,GAAOxhB,CAAK;AAEZ,MAAIsF,IAAM;AACV,WAASpJ,IAAI,GAAGA,IAAI8D,EAAM,QAAQ9D;AAC9B,IAAAoJ,KAAOF,GAAMpF,EAAM9D,CAAC,CAAC;AAEzB,SAAOoJ;AACX;AAEA,MAAM0tC,KAAS,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAG;AAChE,SAASC,GAAcC,GAAM;AACzB,MAAIA,KAAQF,GAAO,MAAME,KAAQF,GAAO;AACpC,WAAOE,IAAOF,GAAO;AACzB,MAAIE,KAAQF,GAAO,MAAME,KAAQF,GAAO;AACpC,WAAOE,KAAQF,GAAO,KAAK;AAC/B,MAAIE,KAAQF,GAAO,MAAME,KAAQF,GAAO;AACpC,WAAOE,KAAQF,GAAO,KAAK;AAEnC;AAIO,SAASttC,GAAWJ,GAAK;AAC5B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAC5D,QAAM6tC,IAAK7tC,EAAI,QACT8tC,IAAKD,IAAK;AAChB,MAAIA,IAAK;AACL,UAAM,IAAI,MAAM,4DAA4DA,CAAE;AAClF,QAAMxtC,IAAQ,IAAI,WAAWytC,CAAE;AAC/B,WAASC,IAAK,GAAGC,IAAK,GAAGD,IAAKD,GAAIC,KAAMC,KAAM,GAAG;AAC7C,UAAMC,IAAKN,GAAc3tC,EAAI,WAAWguC,CAAE,CAAC,GACrCppC,IAAK+oC,GAAc3tC,EAAI,WAAWguC,IAAK,CAAC,CAAC;AAC/C,QAAIC,MAAO,UAAarpC,MAAO,QAAW;AACtC,YAAMgpC,IAAO5tC,EAAIguC,CAAE,IAAIhuC,EAAIguC,IAAK,CAAC;AACjC,YAAM,IAAI,MAAM,iDAAiDJ,IAAO,gBAAgBI,CAAE;AAAA,IAC7F;AACD,IAAA3tC,EAAM0tC,CAAE,IAAIE,IAAK,KAAKrpC;AAAA,EACzB;AACD,SAAOvE;AACX;AAqBO,SAAS1E,GAAYC,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AACpE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACvD;AAMO,SAASC,GAAQC,GAAM;AAC1B,SAAI,OAAOA,KAAS,aAChBA,IAAOH,GAAYG,CAAI,IAC3BogB,GAAOpgB,CAAI,GACJA;AACX;AAIO,SAASC,MAAeC,GAAQ;AACnC,MAAIE,IAAM;AACV,WAAStF,IAAI,GAAGA,IAAIoF,EAAO,QAAQpF,KAAK;AACpC,UAAMyE,IAAIW,EAAOpF,CAAC;AAClBslB,IAAAA,GAAO7gB,CAAC,GACRa,KAAOb,EAAE;AAAA,EACZ;AACD,QAAMnB,IAAM,IAAI,WAAWgC,CAAG;AAC9B,WAAStF,IAAI,GAAGuF,IAAM,GAAGvF,IAAIoF,EAAO,QAAQpF,KAAK;AAC7C,UAAMyE,IAAIW,EAAOpF,CAAC;AAClB,IAAAsD,EAAI,IAAImB,GAAGc,CAAG,GACdA,KAAOd,EAAE;AAAA,EACZ;AACD,SAAOnB;AACX;AAEO,MAAMiD,GAAK;AAAA;AAAA,EAEd,QAAQ;AACJ,WAAO,KAAK;EACf;AACL;AACA,MAAM+wC,KAAQ,CAAE,EAAC;AACV,SAASxzB,GAAUC,GAAUzV,GAAM;AACtC,MAAIA,MAAS,UAAagpC,GAAM,KAAKhpC,CAAI,MAAM;AAC3C,UAAM,IAAI,MAAM,uCAAuC;AAE3D,SADe,OAAO,OAAOyV,GAAUzV,CAAI;AAE/C;AACO,SAAS7I,GAAgBC,GAAU;AACtC,QAAMC,IAAQ,CAACrM,MAAQoM,EAAU,EAAC,OAAOT,GAAQ3L,CAAG,CAAC,EAAE,UACjDsM,IAAMF;AACZ,SAAAC,EAAM,YAAYC,EAAI,WACtBD,EAAM,WAAWC,EAAI,UACrBD,EAAM,SAAS,MAAMD,KACdC;AACX;AAoBO,SAASE,GAAYC,IAAc,IAAI;AAC1C,MAAIvB,MAAU,OAAOA,GAAO,mBAAoB;AAC5C,WAAOA,GAAO,gBAAgB,IAAI,WAAWuB,CAAW,CAAC;AAG7D,MAAIvB,MAAU,OAAOA,GAAO,eAAgB;AACxC,WAAOA,GAAO,YAAYuB,CAAW;AAEzC,QAAM,IAAI,MAAM,wCAAwC;AAC5D;AC1LO,MAAMoW,WAAa3V,GAAK;AAAA,EAC3B,YAAYvC,GAAMyX,GAAM;AACpB,aACA,KAAK,WAAW,IAChB,KAAK,YAAY,IACjBC,GAAW1X,CAAI;AACf,UAAMjE,IAAMkF,GAAQwW,CAAI;AAExB,QADA,KAAK,QAAQzX,EAAK,UACd,OAAO,KAAK,MAAM,UAAW;AAC7B,YAAM,IAAI,MAAM,qDAAqD;AACzE,SAAK,WAAW,KAAK,MAAM,UAC3B,KAAK,YAAY,KAAK,MAAM;AAC5B,UAAMwC,IAAW,KAAK,UAChBjB,IAAM,IAAI,WAAWiB,CAAQ;AAEnC,IAAAjB,EAAI,IAAIxF,EAAI,SAASyG,IAAWxC,EAAK,OAAQ,EAAC,OAAOjE,CAAG,EAAE,OAAQ,IAAGA,CAAG;AACxE,aAASC,IAAI,GAAGA,IAAIuF,EAAI,QAAQvF;AAC5B,MAAAuF,EAAIvF,CAAC,KAAK;AACd,SAAK,MAAM,OAAOuF,CAAG,GAErB,KAAK,QAAQvB,EAAK;AAElB,aAAShE,IAAI,GAAGA,IAAIuF,EAAI,QAAQvF;AAC5B,MAAAuF,EAAIvF,CAAC,KAAK;AACd,SAAK,MAAM,OAAOuF,CAAG,GACrBA,EAAI,KAAK,CAAC;AAAA,EACb;AAAA,EACD,OAAOoW,GAAK;AACRC,WAAAA,GAAa,IAAI,GACjB,KAAK,MAAM,OAAOD,CAAG,GACd;AAAA,EACV;AAAA,EACD,WAAWtX,GAAK;AACZuX,IAAAA,GAAa,IAAI,GACjBC,GAAYxX,GAAK,KAAK,SAAS,GAC/B,KAAK,WAAW,IAChB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,MAAM,OAAOA,CAAG,GACrB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,QAAO;AAAA,EACf;AAAA,EACD,SAAS;AACL,UAAMA,IAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,gBAAK,WAAWA,CAAG,GACZA;AAAA,EACV;AAAA,EACD,WAAW8C,GAAI;AAEX,IAAAA,MAAOA,IAAK,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAE,CAAA;AACzD,UAAM,EAAE,OAAA2U,GAAO,OAAAC,GAAO,UAAA1U,GAAU,WAAAC,GAAW,UAAAd,GAAU,WAAAC,EAAW,IAAG;AACnE,WAAAU,IAAKA,GACLA,EAAG,WAAWE,GACdF,EAAG,YAAYG,GACfH,EAAG,WAAWX,GACdW,EAAG,YAAYV,GACfU,EAAG,QAAQ2U,EAAM,WAAW3U,EAAG,KAAK,GACpCA,EAAG,QAAQ4U,EAAM,WAAW5U,EAAG,KAAK,GAC7BA;AAAA,EACV;AAAA,EACD,UAAU;AACN,SAAK,YAAY,IACjB,KAAK,MAAM,WACX,KAAK,MAAM;EACd;AACL;AAWO,MAAM6U,KAAO,CAAChY,GAAMjE,GAAKkc,MAAY,IAAIC,GAAKlY,GAAMjE,CAAG,EAAE,OAAOkc,CAAO,EAAE,OAAM;AACtFD,GAAK,SAAS,CAAChY,GAAMjE,MAAQ,IAAImc,GAAKlY,GAAMjE,CAAG;AC1E/C,SAASgG,GAAaC,GAAMC,GAAY9F,GAAO2E,GAAM;AACjD,MAAI,OAAOkB,EAAK,gBAAiB;AAC7B,WAAOA,EAAK,aAAaC,GAAY9F,GAAO2E,CAAI;AACpD,QAAMoB,IAAO,OAAO,EAAE,GAChBC,IAAW,OAAO,UAAU,GAC5BC,IAAK,OAAQjG,KAAS+F,IAAQC,CAAQ,GACtCE,IAAK,OAAOlG,IAAQgG,CAAQ,GAC5BG,IAAIxB,IAAO,IAAI,GACf,IAAIA,IAAO,IAAI;AACrB,EAAAkB,EAAK,UAAUC,IAAaK,GAAGF,GAAItB,CAAI,GACvCkB,EAAK,UAAUC,IAAa,GAAGI,GAAIvB,CAAI;AAC3C;AAIO,MAAMyC,KAAM,CAAC9C,GAAGhB,GAAG/D,MAAO+E,IAAIhB,IAAM,CAACgB,IAAI/E,GAInC8H,KAAM,CAAC/C,GAAGhB,GAAG/D,MAAO+E,IAAIhB,IAAMgB,IAAI/E,IAAM+D,IAAI/D;AAKlD,MAAM63C,WAAehxC,GAAK;AAAA,EAC7B,YAAYC,GAAUC,GAAWC,GAAW5B,GAAM;AAC9C,aACA,KAAK,WAAW0B,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAO5B,GACZ,KAAK,WAAW,IAChB,KAAK,SAAS,GACd,KAAK,MAAM,GACX,KAAK,YAAY,IACjB,KAAK,SAAS,IAAI,WAAW0B,CAAQ,GACrC,KAAK,OAAO9B,GAAW,KAAK,MAAM;AAAA,EACrC;AAAA,EACD,OAAOQ,GAAM;AACT,IAAAjB,GAAO,IAAI;AACX,UAAM,EAAE,MAAA+B,GAAM,QAAAW,GAAQ,UAAAH,EAAQ,IAAK;AACnC,IAAAtB,IAAOD,GAAQC,CAAI;AACnB,UAAM0B,IAAM1B,EAAK;AACjB,aAAS2B,IAAM,GAAGA,IAAMD,KAAM;AAC1B,YAAME,IAAO,KAAK,IAAIN,IAAW,KAAK,KAAKI,IAAMC,CAAG;AAEpD,UAAIC,MAASN,GAAU;AACnB,cAAMO,IAAWrC,GAAWQ,CAAI;AAChC,eAAOsB,KAAYI,IAAMC,GAAKA,KAAOL;AACjC,eAAK,QAAQO,GAAUF,CAAG;AAC9B;AAAA,MACH;AACD,MAAAF,EAAO,IAAIzB,EAAK,SAAS2B,GAAKA,IAAMC,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZD,KAAOC,GACH,KAAK,QAAQN,MACb,KAAK,QAAQR,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAElB;AACD,gBAAK,UAAUd,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACV;AAAA,EACD,WAAWb,GAAK;AACZ,IAAAJ,GAAO,IAAI,GACXG,GAAOC,GAAK,IAAI,GAChB,KAAK,WAAW;AAIhB,UAAM,EAAE,QAAAsC,GAAQ,MAAAX,GAAM,UAAAQ,GAAU,MAAA1B,EAAI,IAAK;AACzC,QAAI,EAAE,KAAA+B,EAAK,IAAG;AAEd,IAAAF,EAAOE,GAAK,IAAI,KAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,GAG5B,KAAK,YAAYL,IAAWK,MAC5B,KAAK,QAAQb,GAAM,CAAC,GACpBa,IAAM;AAGV,aAAS7G,IAAI6G,GAAK7G,IAAIwG,GAAUxG;AAC5B,MAAA2G,EAAO3G,CAAC,IAAI;AAIhB,IAAA+F,GAAaC,GAAMQ,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAG1B,CAAI,GAC9D,KAAK,QAAQkB,GAAM,CAAC;AACpB,UAAMgB,IAAQtC,GAAWL,CAAG,GACtBuC,IAAM,KAAK;AAEjB,QAAIA,IAAM;AACN,YAAM,IAAI,MAAM,6CAA6C;AACjE,UAAMK,IAASL,IAAM,GACfM,IAAQ,KAAK;AACnB,QAAID,IAASC,EAAM;AACf,YAAM,IAAI,MAAM,oCAAoC;AACxD,aAASlH,IAAI,GAAGA,IAAIiH,GAAQjH;AACxB,MAAAgH,EAAM,UAAU,IAAIhH,GAAGkH,EAAMlH,CAAC,GAAG8E,CAAI;AAAA,EAC5C;AAAA,EACD,SAAS;AACL,UAAM,EAAE,QAAA6B,GAAQ,WAAAF,EAAW,IAAG;AAC9B,SAAK,WAAWE,CAAM;AACtB,UAAMrD,IAAMqD,EAAO,MAAM,GAAGF,CAAS;AACrC,gBAAK,QAAO,GACLnD;AAAA,EACV;AAAA,EACD,WAAW6D,GAAI;AACX,IAAAA,MAAOA,IAAK,IAAI,KAAK,YAAa,IAClCA,EAAG,IAAI,GAAG,KAAK,IAAK,CAAA;AACpB,UAAM,EAAE,UAAAX,GAAU,QAAAG,GAAQ,QAAAS,GAAQ,UAAAC,GAAU,WAAAC,GAAW,KAAAT,EAAK,IAAG;AAC/D,WAAAM,EAAG,SAASC,GACZD,EAAG,MAAMN,GACTM,EAAG,WAAWE,GACdF,EAAG,YAAYG,GACXF,IAASZ,KACTW,EAAG,OAAO,IAAIR,CAAM,GACjBQ;AAAA,EACV;AACL;AC1HA,MAAMqwC,KAAsB,oBAAI,WAAW,CAAC,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC,GAC3FC,KAAqB,oBAAI,WAAW,IAAI,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC39C,GAAGkG,MAAMA,CAAC,CAAC,GAC1E03C,KAAqB,gBAAAD,GAAG,IAAI,CAACz3C,OAAO,IAAIA,IAAI,KAAK,EAAE;AACzD,IAAI23C,KAAO,CAACF,EAAE,GACVG,KAAO,CAACF,EAAE;AACd,SAAS13C,IAAI,GAAGA,IAAI,GAAGA;AACnB,WAAS0J,KAAK,CAACiuC,IAAMC,EAAI;AACrB,IAAAluC,EAAE,KAAKA,EAAE1J,CAAC,EAAE,IAAI,CAACJ,MAAM43C,GAAI53C,CAAC,CAAC,CAAC;AACtC,MAAMi4C,KAAyB;AAAA,EAC3B,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAAA,EACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;AAC3D,EAAE,IAAI,CAAC73C,MAAM,IAAI,WAAWA,CAAC,CAAC,GACxB83C,KAA0B,gBAAAH,GAAK,IAAI,CAAC1yB,GAAKjlB,MAAMilB,EAAI,IAAI,CAACvb,MAAMmuC,GAAO73C,CAAC,EAAE0J,CAAC,CAAC,CAAC,GAC3EquC,KAA0B,gBAAAH,GAAK,IAAI,CAAC3yB,GAAKjlB,MAAMilB,EAAI,IAAI,CAACvb,MAAMmuC,GAAO73C,CAAC,EAAE0J,CAAC,CAAC,CAAC,GAC3EsuC,KAAqB,oBAAI,YAAY;AAAA,EACvC;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACpD,CAAC,GACKC,KAAqB,oBAAI,YAAY;AAAA,EACvC;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACpD,CAAC;AAED,SAASxpC,GAAEypC,GAAOtrC,GAAG8H,GAAGkC,GAAG;AACvB,SAAIshC,MAAU,IACHtrC,IAAI8H,IAAIkC,IACVshC,MAAU,IACPtrC,IAAI8H,IAAM,CAAC9H,IAAIgK,IAClBshC,MAAU,KACPtrC,IAAI,CAAC8H,KAAKkC,IACbshC,MAAU,IACPtrC,IAAIgK,IAAMlC,IAAI,CAACkC,IAEhBhK,KAAK8H,IAAI,CAACkC;AACzB;AAEA,MAAMuhC,KAAwB,oBAAI,YAAY,EAAE;AACzC,MAAMC,WAAkBb,GAAO;AAAA,EAClC,cAAc;AACV,UAAM,IAAI,IAAI,GAAG,EAAI,GACrB,KAAK,KAAK,YACV,KAAK,KAAK,YACV,KAAK,KAAK,aACV,KAAK,KAAK,WACV,KAAK,KAAK;AAAA,EACb;AAAA,EACD,MAAM;AACF,UAAM,EAAE,IAAAc,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,EAAI,IAAG;AAC/B,WAAO,CAACJ,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC7B;AAAA,EACD,IAAIJ,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AACpB,SAAK,KAAKJ,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK;AAAA,EAClB;AAAA,EACD,QAAQzyC,GAAMqC,GAAQ;AAClB,aAASrI,IAAI,GAAGA,IAAI,IAAIA,KAAKqI,KAAU;AACnC,MAAA8vC,GAAMn4C,CAAC,IAAIgG,EAAK,UAAUqC,GAAQ,EAAI;AAE1C,QAAI6uC,IAAK,KAAK,KAAK,GAAGwB,IAAKxB,GAAIyB,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIE,IAAK,KAAK,KAAK,GAAGC,IAAKD,GAAIzS,IAAK,KAAK,KAAK,GAAGpjC,IAAKojC;AAGvI,aAAS4R,IAAQ,GAAGA,IAAQ,GAAGA,KAAS;AACpC,YAAMe,IAAS,IAAIf,GACbgB,IAAMlB,GAAGE,CAAK,GAAGiB,IAAMlB,GAAGC,CAAK,GAC/BplC,IAAK6kC,GAAKO,CAAK,GAAGkB,IAAKxB,GAAKM,CAAK,GACjC3sC,IAAKusC,GAAQI,CAAK,GAAGmB,IAAKtB,GAAQG,CAAK;AAC7C,eAASl4C,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,cAAMs5C,IAAMlxB,GAAK8uB,IAAKzoC,GAAEypC,GAAOS,GAAIE,GAAIE,CAAE,IAAIZ,GAAMrlC,EAAG9S,CAAC,CAAC,IAAIk5C,GAAK3tC,EAAGvL,CAAC,CAAC,IAAIsmC,IAAM;AAChF,QAAA4Q,IAAK5Q,GAAIA,IAAKyS,GAAIA,IAAK3wB,GAAKywB,GAAI,EAAE,IAAI,GAAGA,IAAKF,GAAIA,IAAKW;AAAA,MAC1D;AAED,eAASt5C,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,cAAMu5C,IAAMnxB,GAAKswB,IAAKjqC,GAAEwqC,GAAQL,GAAIE,GAAIE,CAAE,IAAIb,GAAMiB,EAAGp5C,CAAC,CAAC,IAAIm5C,GAAKE,EAAGr5C,CAAC,CAAC,IAAIkD,IAAM;AACjF,QAAAw1C,IAAKx1C,GAAIA,IAAK81C,GAAIA,IAAK5wB,GAAK0wB,GAAI,EAAE,IAAI,GAAGA,IAAKF,GAAIA,IAAKW;AAAA,MAC1D;AAAA,IACJ;AAED,SAAK,IAAK,KAAK,KAAKV,IAAKG,IAAM,GAAI,KAAK,KAAKD,IAAK71C,IAAM,GAAI,KAAK,KAAKojC,IAAKoS,IAAM,GAAI,KAAK,KAAKxB,IAAK0B,IAAM,GAAI,KAAK,KAAKD,IAAKG,IAAM,CAAC;AAAA,EACvI;AAAA,EACD,aAAa;AACT,IAAAX,GAAM,KAAK,CAAC;AAAA,EACf;AAAA,EACD,UAAU;AACN,SAAK,YAAY,IACjB,KAAK,OAAO,KAAK,CAAC,GAClB,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EACzB;AACL;AAKO,MAAMqB,KAA4B,gBAAA/zC,GAAgB,MAAM,IAAI2yC,IAAW,GC7FxE3wC,KAA2B,oBAAI,YAAY;AAAA,EAC7C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAIKgyC,KAA4B,oBAAI,YAAY;AAAA,EAC9C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAGK9xC,KAA2B,oBAAI,YAAY,EAAE;AAC5C,MAAMmB,WAAeyuC,GAAO;AAAA,EAC/B,cAAc;AACV,UAAM,IAAI,IAAI,GAAG,EAAK,GAGtB,KAAK,IAAIkC,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI;AAAA,EAC3B;AAAA,EACD,MAAM;AACF,UAAM,EAAE,GAAA5xC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAG,IAAG;AACnC,WAAO,CAACP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EACjC;AAAA;AAAA,EAED,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAG;AACxB,SAAK,IAAIP,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI;AAAA,EAChB;AAAA,EACD,QAAQpC,GAAMqC,GAAQ;AAElB,aAASrI,IAAI,GAAGA,IAAI,IAAIA,KAAKqI,KAAU;AACnC,MAAAV,GAAS3H,CAAC,IAAIgG,EAAK,UAAUqC,GAAQ,EAAK;AAC9C,aAASrI,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAC1B,YAAMsI,IAAMX,GAAS3H,IAAI,EAAE,GACrBuI,IAAKZ,GAAS3H,IAAI,CAAC,GACnBwI,IAAK7D,GAAK2D,GAAK,CAAC,IAAI3D,GAAK2D,GAAK,EAAE,IAAKA,MAAQ,GAC7CG,IAAK9D,GAAK4D,GAAI,EAAE,IAAI5D,GAAK4D,GAAI,EAAE,IAAKA,MAAO;AACjD,MAAAZ,GAAS3H,CAAC,IAAKyI,IAAKd,GAAS3H,IAAI,CAAC,IAAIwI,IAAKb,GAAS3H,IAAI,EAAE,IAAK;AAAA,IAClE;AAED,QAAI,EAAE,GAAA6H,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAG,IAAG;AACjC,aAASpI,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,YAAM0I,IAAS/D,GAAKsD,GAAG,CAAC,IAAItD,GAAKsD,GAAG,EAAE,IAAItD,GAAKsD,GAAG,EAAE,GAC9CU,IAAMP,IAAIM,IAASnB,GAAIU,GAAGC,GAAGC,CAAC,IAAIV,GAASzH,CAAC,IAAI2H,GAAS3H,CAAC,IAAK,GAE/D4I,KADSjE,GAAKkD,GAAG,CAAC,IAAIlD,GAAKkD,GAAG,EAAE,IAAIlD,GAAKkD,GAAG,EAAE,KAC/BL,GAAIK,GAAGC,GAAGC,CAAC,IAAK;AACrC,MAAAK,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKD,IAAIW,IAAM,GACfX,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKc,IAAKC,IAAM;AAAA,IACnB;AAED,IAAAf,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnB,KAAK,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EAClC;AAAA,EACD,aAAa;AACT,IAAAT,GAAS,KAAK,CAAC;AAAA,EAClB;AAAA,EACD,UAAU;AACN,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/B,KAAK,OAAO,KAAK,CAAC;AAAA,EACrB;AACL;AAoBO,MAAMkB,KAAyB,gBAAApD,GAAgB,MAAM,IAAIqD,IAAQ,GCxHlE4wC,KAA6B,uBAAO,KAAK,KAAK,CAAC,GAC/CxzC,KAAuB,uBAAO,EAAE;AAEtC,SAASyzC,GAAQ,GAAGC,IAAK,IAAO;AAC5B,SAAIA,IACO,EAAE,GAAG,OAAO,IAAIF,EAAU,GAAG,GAAG,OAAQ,KAAKxzC,KAAQwzC,EAAU,EAAC,IACpE,EAAE,GAAG,OAAQ,KAAKxzC,KAAQwzC,EAAU,IAAI,GAAG,GAAG,OAAO,IAAIA,EAAU,IAAI,EAAC;AACnF;AACA,SAASG,GAAMjqC,GAAKgqC,IAAK,IAAO;AAC5B,MAAIE,IAAK,IAAI,YAAYlqC,EAAI,MAAM,GAC/BmqC,IAAK,IAAI,YAAYnqC,EAAI,MAAM;AACnC,WAAS5P,IAAI,GAAGA,IAAI4P,EAAI,QAAQ5P,KAAK;AACjC,UAAM,EAAE,GAAAsG,GAAG,GAAAiM,MAAMonC,GAAQ/pC,EAAI5P,CAAC,GAAG45C,CAAE;AACnC,KAACE,EAAG95C,CAAC,GAAG+5C,EAAG/5C,CAAC,CAAC,IAAI,CAACsG,GAAGiM,CAAC;AAAA,EACzB;AACD,SAAO,CAACunC,GAAIC,CAAE;AAClB;AACA,MAAMC,KAAQ,CAAC1zC,GAAGiM,MAAO,OAAOjM,MAAM,CAAC,KAAKJ,KAAQ,OAAOqM,MAAM,CAAC,GAE5D0nC,KAAQ,CAAC3zC,GAAG4zC,GAAIp/C,MAAMwL,MAAMxL,GAC5Bq/C,KAAQ,CAAC7zC,GAAGiM,GAAGzX,MAAOwL,KAAM,KAAKxL,IAAOyX,MAAMzX,GAE9Cs/C,KAAS,CAAC9zC,GAAGiM,GAAGzX,MAAOwL,MAAMxL,IAAMyX,KAAM,KAAKzX,GAC9Cu/C,KAAS,CAAC/zC,GAAGiM,GAAGzX,MAAOwL,KAAM,KAAKxL,IAAOyX,MAAMzX,GAE/Cw/C,KAAS,CAACh0C,GAAGiM,GAAGzX,MAAOwL,KAAM,KAAKxL,IAAOyX,MAAOzX,IAAI,IACpDy/C,KAAS,CAACj0C,GAAGiM,GAAGzX,MAAOwL,MAAOxL,IAAI,KAAQyX,KAAM,KAAKzX,GAErD0/C,KAAU,CAAC1jB,GAAIvkB,MAAMA,GACrBkoC,KAAU,CAACn0C,GAAG4zC,MAAO5zC,GAErBo0C,KAAS,CAACp0C,GAAGiM,GAAGzX,MAAOwL,KAAKxL,IAAMyX,MAAO,KAAKzX,GAC9C6/C,KAAS,CAACr0C,GAAGiM,GAAGzX,MAAOyX,KAAKzX,IAAMwL,MAAO,KAAKxL,GAE9C8/C,KAAS,CAACt0C,GAAGiM,GAAGzX,MAAOyX,KAAMzX,IAAI,KAAQwL,MAAO,KAAKxL,GACrD+/C,KAAS,CAACv0C,GAAGiM,GAAGzX,MAAOwL,KAAMxL,IAAI,KAAQyX,MAAO,KAAKzX;AAG3D,SAASggD,GAAIhB,GAAIC,GAAIgB,GAAIC,GAAI;AACzB,QAAMzoC,KAAKwnC,MAAO,MAAMiB,MAAO;AAC/B,SAAO,EAAE,GAAIlB,IAAKiB,KAAOxoC,IAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,IAAI,EAAC;AAC7D;AAEA,MAAM0oC,KAAQ,CAAClB,GAAIiB,GAAIE,OAAQnB,MAAO,MAAMiB,MAAO,MAAME,MAAO,IAC1DC,KAAQ,CAACC,GAAKtB,GAAIiB,GAAIM,MAAQvB,IAAKiB,IAAKM,KAAOD,IAAM,KAAK,KAAM,KAAM,GACtEE,KAAQ,CAACvB,GAAIiB,GAAIE,GAAIK,OAAQxB,MAAO,MAAMiB,MAAO,MAAME,MAAO,MAAMK,MAAO,IAC3EC,KAAQ,CAACJ,GAAKtB,GAAIiB,GAAIM,GAAII,MAAQ3B,IAAKiB,IAAKM,IAAKI,KAAOL,IAAM,KAAK,KAAM,KAAM,GAC/EM,KAAQ,CAAC3B,GAAIiB,GAAIE,GAAIK,GAAII,OAAQ5B,MAAO,MAAMiB,MAAO,MAAME,MAAO,MAAMK,MAAO,MAAMI,MAAO,IAC5FC,KAAQ,CAACR,GAAKtB,GAAIiB,GAAIM,GAAII,GAAII,MAAQ/B,IAAKiB,IAAKM,IAAKI,IAAKI,KAAOT,IAAM,KAAK,KAAM,KAAM,GAIxFU,IAAM;AAAA,EACR,SAAAnC;AAAA,EAAS,OAAAE;AAAA,EAAO,OAAAG;AAAA,EAChB,OAAAC;AAAA,EAAO,OAAAE;AAAA,EACP,QAAAC;AAAA,EAAQ,QAAAC;AAAA,EAAQ,QAAAC;AAAA,EAAQ,QAAAC;AAAA,EACxB,SAAAC;AAAA,EAAS,SAAAC;AAAA,EACT,QAAAC;AAAA,EAAQ,QAAAC;AAAA,EAAQ,QAAAC;AAAA,EAAQ,QAAAC;AAAA,EACxB,KAAAC;AAAA,EAAK,OAAAG;AAAA,EAAO,OAAAE;AAAA,EAAO,OAAAG;AAAA,EAAO,OAAAE;AAAA,EAAO,OAAAI;AAAA,EAAO,OAAAF;AAC5C,GCtDM,CAACK,IAAWC,EAAS,IAA2BF,EAAI,MAAM;AAAA,EAC5D;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AACtE,EAAE,IAAI,OAAK,OAAO,CAAC,CAAC,CAAC,GAEfG,KAA6B,oBAAI,YAAY,EAAE,GAC/CC,KAA6B,oBAAI,YAAY,EAAE;AAC9C,MAAMC,WAAe5E,GAAO;AAAA,EAC/B,cAAc;AACV,UAAM,KAAK,IAAI,IAAI,EAAK,GAKxB,KAAK,KAAK,YACV,KAAK,KAAK,YACV,KAAK,KAAK,aACV,KAAK,KAAK,aACV,KAAK,KAAK,YACV,KAAK,KAAK,WACV,KAAK,KAAK,aACV,KAAK,KAAK,YACV,KAAK,KAAK,YACV,KAAK,KAAK,aACV,KAAK,KAAK,aACV,KAAK,KAAK,WACV,KAAK,KAAK,WACV,KAAK,KAAK,WACV,KAAK,KAAK,YACV,KAAK,KAAK;AAAA,EACb;AAAA;AAAA,EAED,MAAM;AACF,UAAM,EAAE,IAAAuC,GAAI,IAAAC,GAAI,IAAAgB,GAAI,IAAAC,GAAI,IAAAK,GAAI,IAAAH,GAAI,IAAAO,GAAI,IAAAF,GAAI,IAAAM,GAAI,IAAAF,GAAI,IAAAS,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,EAAI,IAAG;AAC3E,WAAO,CAAC3C,GAAIC,GAAIgB,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAIS,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EACzE;AAAA;AAAA,EAED,IAAI3C,GAAIC,GAAIgB,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAIS,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AAChE,SAAK,KAAK3C,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKgB,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKK,IAAK,GACf,KAAK,KAAKH,IAAK,GACf,KAAK,KAAKO,IAAK,GACf,KAAK,KAAKF,IAAK,GACf,KAAK,KAAKM,IAAK,GACf,KAAK,KAAKF,IAAK,GACf,KAAK,KAAKS,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK;AAAA,EAClB;AAAA,EACD,QAAQz2C,GAAMqC,GAAQ;AAElB,aAASrI,IAAI,GAAGA,IAAI,IAAIA,KAAKqI,KAAU;AACnC,MAAA4zC,GAAWj8C,CAAC,IAAIgG,EAAK,UAAUqC,CAAM,GACrC6zC,GAAWl8C,CAAC,IAAIgG,EAAK,UAAWqC,KAAU;AAE9C,aAASrI,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAE1B,YAAM08C,IAAOT,GAAWj8C,IAAI,EAAE,IAAI,GAC5B28C,IAAOT,GAAWl8C,IAAI,EAAE,IAAI,GAC5B48C,IAAMd,EAAI,OAAOY,GAAMC,GAAM,CAAC,IAAIb,EAAI,OAAOY,GAAMC,GAAM,CAAC,IAAIb,EAAI,MAAMY,GAAMC,GAAM,CAAC,GACrFE,IAAMf,EAAI,OAAOY,GAAMC,GAAM,CAAC,IAAIb,EAAI,OAAOY,GAAMC,GAAM,CAAC,IAAIb,EAAI,MAAMY,GAAMC,GAAM,CAAC,GAErFG,IAAMb,GAAWj8C,IAAI,CAAC,IAAI,GAC1B+8C,IAAMb,GAAWl8C,IAAI,CAAC,IAAI,GAC1Bg9C,IAAMlB,EAAI,OAAOgB,GAAKC,GAAK,EAAE,IAAIjB,EAAI,OAAOgB,GAAKC,GAAK,EAAE,IAAIjB,EAAI,MAAMgB,GAAKC,GAAK,CAAC,GACjFE,IAAMnB,EAAI,OAAOgB,GAAKC,GAAK,EAAE,IAAIjB,EAAI,OAAOgB,GAAKC,GAAK,EAAE,IAAIjB,EAAI,MAAMgB,GAAKC,GAAK,CAAC,GAEjFG,IAAOpB,EAAI,MAAMe,GAAKI,GAAKf,GAAWl8C,IAAI,CAAC,GAAGk8C,GAAWl8C,IAAI,EAAE,CAAC,GAChEm9C,IAAOrB,EAAI,MAAMoB,GAAMN,GAAKI,GAAKf,GAAWj8C,IAAI,CAAC,GAAGi8C,GAAWj8C,IAAI,EAAE,CAAC;AAC5E,MAAAi8C,GAAWj8C,CAAC,IAAIm9C,IAAO,GACvBjB,GAAWl8C,CAAC,IAAIk9C,IAAO;AAAA,IAC1B;AACD,QAAI,EAAE,IAAApD,GAAI,IAAAC,GAAI,IAAAgB,GAAI,IAAAC,GAAI,IAAAK,GAAI,IAAAH,GAAI,IAAAO,GAAI,IAAAF,GAAI,IAAAM,GAAI,IAAAF,GAAI,IAAAS,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,EAAI,IAAG;AAEzE,aAASz8C,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAEzB,YAAMo9C,IAAUtB,EAAI,OAAOD,GAAIF,GAAI,EAAE,IAAIG,EAAI,OAAOD,GAAIF,GAAI,EAAE,IAAIG,EAAI,OAAOD,GAAIF,GAAI,EAAE,GACjF0B,IAAUvB,EAAI,OAAOD,GAAIF,GAAI,EAAE,IAAIG,EAAI,OAAOD,GAAIF,GAAI,EAAE,IAAIG,EAAI,OAAOD,GAAIF,GAAI,EAAE,GAEjF2B,IAAQzB,IAAKO,IAAO,CAACP,IAAKS,GAC1BiB,IAAQ5B,IAAKU,IAAO,CAACV,IAAKY,GAG1BiB,IAAO1B,EAAI,MAAMW,GAAIY,GAASE,GAAMvB,GAAUh8C,CAAC,GAAGk8C,GAAWl8C,CAAC,CAAC,GAC/Dy9C,IAAM3B,EAAI,MAAM0B,GAAMhB,GAAIY,GAASE,GAAMvB,GAAU/7C,CAAC,GAAGi8C,GAAWj8C,CAAC,CAAC,GACpE09C,IAAMF,IAAO,GAEbG,IAAU7B,EAAI,OAAOhC,GAAIC,GAAI,EAAE,IAAI+B,EAAI,OAAOhC,GAAIC,GAAI,EAAE,IAAI+B,EAAI,OAAOhC,GAAIC,GAAI,EAAE,GACjF6D,IAAU9B,EAAI,OAAOhC,GAAIC,GAAI,EAAE,IAAI+B,EAAI,OAAOhC,GAAIC,GAAI,EAAE,IAAI+B,EAAI,OAAOhC,GAAIC,GAAI,EAAE,GACjF8D,IAAQ/D,IAAKiB,IAAOjB,IAAKuB,IAAON,IAAKM,GACrCyC,IAAQ/D,IAAKiB,IAAOjB,IAAKmB,IAAOF,IAAKE;AAC3C,MAAAsB,IAAKF,IAAK,GACVG,IAAKF,IAAK,GACVD,IAAKF,IAAK,GACVG,IAAKF,IAAK,GACVD,IAAKP,IAAK,GACVQ,IAAKV,IAAK,GACT,EAAE,GAAGE,GAAI,GAAGF,EAAE,IAAKG,EAAI,IAAIL,IAAK,GAAGF,IAAK,GAAGkC,IAAM,GAAGC,IAAM,CAAC,GAC5DjC,IAAKJ,IAAK,GACVE,IAAKL,IAAK,GACVG,IAAKN,IAAK,GACVG,IAAKF,IAAK,GACVD,IAAKjB,IAAK,GACVkB,IAAKjB,IAAK;AACV,YAAMgE,IAAMjC,EAAI,MAAM4B,GAAKE,GAASE,CAAI;AACxC,MAAAhE,IAAKgC,EAAI,MAAMiC,GAAKN,GAAKE,GAASE,CAAI,GACtC9D,IAAKgE,IAAM;AAAA,IACd;AAED,KAAC,EAAE,GAAGjE,GAAI,GAAGC,MAAO+B,EAAI,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGhC,IAAK,GAAGC,IAAK,CAAC,IACnE,EAAE,GAAGgB,GAAI,GAAGC,MAAOc,EAAI,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGf,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGK,GAAI,GAAGH,MAAOY,EAAI,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGT,IAAK,GAAGH,IAAK,CAAC,GACnE,EAAE,GAAGO,GAAI,GAAGF,MAAOO,EAAI,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGL,IAAK,GAAGF,IAAK,CAAC,GACnE,EAAE,GAAGM,GAAI,GAAGF,MAAOG,EAAI,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGD,IAAK,GAAGF,IAAK,CAAC,GACnE,EAAE,GAAGS,GAAI,GAAGC,MAAOP,EAAI,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGM,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGC,GAAI,GAAGC,MAAOT,EAAI,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGQ,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGC,GAAI,GAAGC,MAAOX,EAAI,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGU,IAAK,GAAGC,IAAK,CAAC,GACpE,KAAK,IAAI3C,GAAIC,GAAIgB,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAIS,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC1E;AAAA,EACD,aAAa;AACT,IAAAR,GAAW,KAAK,CAAC,GACjBC,GAAW,KAAK,CAAC;AAAA,EACpB;AAAA,EACD,UAAU;AACN,SAAK,OAAO,KAAK,CAAC,GAClB,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EAC1D;AACL;AAsEO,MAAM8B,KAAyB,gBAAAv4C,GAAgB,MAAM,IAAI02C,IAAQ;AClOxE;AAKA,MAAMpzC,KAAsB,uBAAO,CAAC,GAC9BC,KAAsB,uBAAO,CAAC,GAC9BC,KAAsB,uBAAO,CAAC;AAC7B,SAAS2a,GAAQnf,GAAG;AACvB,SAAQA,aAAa,cAChBA,KAAK,QAAQ,OAAOA,KAAM,YAAYA,EAAE,YAAY,SAAS;AACtE;AACO,SAAS6gB,GAAO7U,GAAM;AACzB,MAAI,CAACmT,GAAQnT,CAAI;AACb,UAAM,IAAI,MAAM,qBAAqB;AAC7C;AACO,SAASkZ,GAAMxf,GAAOhK,GAAO;AAChC,MAAI,OAAOA,KAAU;AACjB,UAAM,IAAI,MAAM,GAAGgK,CAAK,gCAAgChK,CAAK,IAAI;AACzE;AAEA,MAAM+I,KAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAK,GAAE,CAACpP,GAAGkG,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAI5F,SAASmJ,GAAWrF,GAAO;AAC9B,EAAAwhB,GAAOxhB,CAAK;AAEZ,MAAIsF,IAAM;AACV,WAASpJ,IAAI,GAAGA,IAAI8D,EAAM,QAAQ9D;AAC9B,IAAAoJ,KAAOF,GAAMpF,EAAM9D,CAAC,CAAC;AAEzB,SAAOoJ;AACX;AACO,SAASC,GAAoBC,GAAK;AACrC,QAAMF,IAAME,EAAI,SAAS,EAAE;AAC3B,SAAOF,EAAI,SAAS,IAAI,IAAIA,CAAG,KAAKA;AACxC;AACO,SAASG,GAAYH,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAE5D,SAAO,OAAOA,MAAQ,KAAK,MAAM,KAAKA,CAAG,EAAE;AAC/C;AAEA,MAAM0tC,KAAS,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAG;AAChE,SAASC,GAAcC,GAAM;AACzB,MAAIA,KAAQF,GAAO,MAAME,KAAQF,GAAO;AACpC,WAAOE,IAAOF,GAAO;AACzB,MAAIE,KAAQF,GAAO,MAAME,KAAQF,GAAO;AACpC,WAAOE,KAAQF,GAAO,KAAK;AAC/B,MAAIE,KAAQF,GAAO,MAAME,KAAQF,GAAO;AACpC,WAAOE,KAAQF,GAAO,KAAK;AAEnC;AAIO,SAASttC,GAAWJ,GAAK;AAC5B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAC5D,QAAM6tC,IAAK7tC,EAAI,QACT8tC,IAAKD,IAAK;AAChB,MAAIA,IAAK;AACL,UAAM,IAAI,MAAM,4DAA4DA,CAAE;AAClF,QAAMxtC,IAAQ,IAAI,WAAWytC,CAAE;AAC/B,WAASC,IAAK,GAAGC,IAAK,GAAGD,IAAKD,GAAIC,KAAMC,KAAM,GAAG;AAC7C,UAAMC,IAAKN,GAAc3tC,EAAI,WAAWguC,CAAE,CAAC,GACrCppC,IAAK+oC,GAAc3tC,EAAI,WAAWguC,IAAK,CAAC,CAAC;AAC/C,QAAIC,MAAO,UAAarpC,MAAO,QAAW;AACtC,YAAMgpC,IAAO5tC,EAAIguC,CAAE,IAAIhuC,EAAIguC,IAAK,CAAC;AACjC,YAAM,IAAI,MAAM,iDAAiDJ,IAAO,gBAAgBI,CAAE;AAAA,IAC7F;AACD,IAAA3tC,EAAM0tC,CAAE,IAAIE,IAAK,KAAKrpC;AAAA,EACzB;AACD,SAAOvE;AACX;AAEO,SAASI,GAAgB/F,GAAO;AACnC,SAAOyF,GAAYJ,GAAWrF,CAAK,CAAC;AACxC;AACO,SAASgG,GAAgBhG,GAAO;AACnC,SAAAwhB,GAAOxhB,CAAK,GACLyF,GAAYJ,GAAW,WAAW,KAAKrF,CAAK,EAAE,QAAS,CAAA,CAAC;AACnE;AACO,SAASiG,GAAgB,GAAGnD,GAAK;AACpC,SAAO4C,GAAW,EAAE,SAAS,EAAE,EAAE,SAAS5C,IAAM,GAAG,GAAG,CAAC;AAC3D;AACO,SAASoD,GAAgB,GAAGpD,GAAK;AACpC,SAAOmD,GAAgB,GAAGnD,CAAG,EAAE,QAAO;AAC1C;AAEO,SAASqD,GAAmB,GAAG;AAClC,SAAOT,GAAWH,GAAoB,CAAC,CAAC;AAC5C;AAUO,SAASa,GAAYC,GAAOf,GAAKgB,GAAgB;AACpD,MAAI9G;AACJ,MAAI,OAAO8F,KAAQ;AACf,QAAI;AACA,MAAA9F,IAAMkG,GAAWJ,CAAG;AAAA,IACvB,SACMiB,GAAG;AACN,YAAM,IAAI,MAAM,GAAGF,CAAK,mCAAmCf,CAAG,aAAaiB,CAAC,EAAE;AAAA,IACjF;AAAA,WAEIuZ,GAAQxa,CAAG;AAGhB,IAAA9F,IAAM,WAAW,KAAK8F,CAAG;AAAA;AAGzB,UAAM,IAAI,MAAM,GAAGe,CAAK,mCAAmC;AAE/D,QAAMvD,IAAMtD,EAAI;AAChB,MAAI,OAAO8G,KAAmB,YAAYxD,MAAQwD;AAC9C,UAAM,IAAI,MAAM,GAAGD,CAAK,aAAaC,CAAc,eAAexD,CAAG,EAAE;AAC3E,SAAOtD;AACX;AAIO,SAAS6B,MAAeC,GAAQ;AACnC,MAAIE,IAAM;AACV,WAAStF,IAAI,GAAGA,IAAIoF,EAAO,QAAQpF,KAAK;AACpC,UAAMyE,IAAIW,EAAOpF,CAAC;AAClB,IAAAslB,GAAO7gB,CAAC,GACRa,KAAOb,EAAE;AAAA,EACZ;AACD,QAAMnB,IAAM,IAAI,WAAWgC,CAAG;AAC9B,WAAStF,IAAI,GAAGuF,IAAM,GAAGvF,IAAIoF,EAAO,QAAQpF,KAAK;AAC7C,UAAMyE,IAAIW,EAAOpF,CAAC;AAClB,IAAAsD,EAAI,IAAImB,GAAGc,CAAG,GACdA,KAAOd,EAAE;AAAA,EACZ;AACD,SAAOnB;AACX;AAEO,SAASgH,GAAW7F,GAAGhB,GAAG;AAC7B,MAAIgB,EAAE,WAAWhB,EAAE;AACf,WAAO;AACX,MAAIugB,IAAO;AACX,WAAShkB,IAAI,GAAGA,IAAIyE,EAAE,QAAQzE;AAC1B,IAAAgkB,KAAQvf,EAAEzE,CAAC,IAAIyD,EAAEzD,CAAC;AACtB,SAAOgkB,MAAS;AACpB;AAIO,SAASjf,GAAYC,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE;AACpE,SAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC;AACvD;AAEA,MAAMi5C,KAAW,CAAC,MAAM,OAAO,KAAM,YAAYl1C,MAAO;AACjD,SAASm1C,GAAQ,GAAG55C,GAAKhK,GAAK;AACjC,SAAO2jD,GAAS,CAAC,KAAKA,GAAS35C,CAAG,KAAK25C,GAAS3jD,CAAG,KAAKgK,KAAO,KAAK,IAAIhK;AAC5E;AAMO,SAAS6jD,GAASh0C,GAAOpP,GAAGuJ,GAAKhK,GAAK;AAMzC,MAAI,CAAC4jD,GAAQnjD,GAAGuJ,GAAKhK,CAAG;AACpB,UAAM,IAAI,MAAM,kBAAkB6P,CAAK,KAAK7F,CAAG,WAAWhK,CAAG,SAAS,OAAOS,CAAC,IAAIA,CAAC,EAAE;AAC7F;AAMO,SAAS0P,GAAO,GAAG;AACtB,MAAI7D;AACJ,OAAKA,IAAM,GAAG,IAAImC,IAAK,MAAMC,IAAKpC,KAAO;AACrC;AACJ,SAAOA;AACX;AAMO,SAAS8D,GAAO,GAAG7D,GAAK;AAC3B,SAAQ,KAAK,OAAOA,CAAG,IAAKmC;AAChC;AAIO,SAAS2B,GAAO,GAAG9D,GAAK1G,GAAO;AAClC,SAAO,KAAMA,IAAQ6I,KAAMD,OAAQ,OAAOlC,CAAG;AACjD;AAKO,MAAM+D,KAAU,CAAC,OAAO3B,MAAO,OAAO,IAAI,CAAC,KAAKD,IAEjD6B,KAAM,CAAC3F,MAAS,IAAI,WAAWA,CAAI,GACnC4F,KAAO,CAACrK,MAAQ,WAAW,KAAKA,CAAG;AAQlC,SAASsK,GAAeC,GAASC,GAAUC,GAAQ;AACtD,MAAI,OAAOF,KAAY,YAAYA,IAAU;AACzC,UAAM,IAAI,MAAM,0BAA0B;AAC9C,MAAI,OAAOC,KAAa,YAAYA,IAAW;AAC3C,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAI,OAAOC,KAAW;AAClB,UAAM,IAAI,MAAM,2BAA2B;AAE/C,MAAIhL,IAAI2K,GAAIG,CAAO,GACfpL,IAAIiL,GAAIG,CAAO,GACf,IAAI;AACR,QAAMG,IAAQ,MAAM;AAChB,IAAAjL,EAAE,KAAK,CAAC,GACRN,EAAE,KAAK,CAAC,GACR,IAAI;AAAA,EACZ,GACU0G,IAAI,IAAI7C,MAAMyH,EAAOtL,GAAGM,GAAG,GAAGuD,CAAC,GAC/B2H,IAAS,CAACC,IAAOR,SAAU;AAI7B,IAFAjL,IAAI0G,EAAEwE,GAAK,CAAC,CAAI,CAAC,GAAGO,CAAI,GACxBnL,IAAIoG,EAAC,GACD+E,EAAK,WAAW,MAEpBzL,IAAI0G,EAAEwE,GAAK,CAAC,CAAI,CAAC,GAAGO,CAAI,GACxBnL,IAAIoG,EAAC;AAAA,EACb,GACUgF,IAAM,MAAM;AAEd,QAAI,OAAO;AACP,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAI1E,IAAM;AACV,UAAMvC,IAAM,CAAA;AACZ,WAAOuC,IAAMqE,KAAU;AACnB,MAAA/K,IAAIoG,EAAC;AACL,YAAMiF,IAAKrL,EAAE;AACb,MAAAmE,EAAI,KAAKkH,CAAE,GACX3E,KAAO1G,EAAE;AAAA,IACZ;AACD,WAAOiF,GAAY,GAAGd,CAAG;AAAA,EACjC;AAUI,SATiB,CAACgH,GAAMG,MAAS;AAC7B,IAAAL,KACAC,EAAOC,CAAI;AACX,QAAI/H;AACJ,WAAO,EAAEA,IAAMkI,EAAKF,EAAK,CAAA;AACrB,MAAAF;AACJ,WAAAD,KACO7H;AAAA,EACf;AAEA;AAEA,MAAMmI,KAAe;AAAA,EACjB,QAAQ,CAACpK,MAAQ,OAAOA,KAAQ;AAAA,EAChC,UAAU,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EAClC,SAAS,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EACjC,QAAQ,CAACA,MAAQ,OAAOA,KAAQ;AAAA,EAChC,oBAAoB,CAACA,MAAQ,OAAOA,KAAQ,YAAYuiB,GAAQviB,CAAG;AAAA,EACnE,eAAe,CAACA,MAAQ,OAAO,cAAcA,CAAG;AAAA,EAChD,OAAO,CAACA,MAAQ,MAAM,QAAQA,CAAG;AAAA,EACjC,OAAO,CAACA,GAAKqK,MAAWA,EAAO,GAAG,QAAQrK,CAAG;AAAA,EAC7C,MAAM,CAACA,MAAQ,OAAOA,KAAQ,cAAc,OAAO,cAAcA,EAAI,SAAS;AAClF;AAEO,SAASsK,GAAeD,GAAQE,GAAYC,IAAgB,CAAA,GAAI;AACnE,QAAMC,IAAa,CAACC,GAAWxS,GAAMyS,MAAe;AAChD,UAAMC,IAAWR,GAAalS,CAAI;AAClC,QAAI,OAAO0S,KAAa;AACpB,YAAM,IAAI,MAAM,sBAAsB1S,CAAI,sBAAsB;AACpE,UAAM8H,IAAMqK,EAAOK,CAAS;AAC5B,QAAI,EAAAC,KAAc3K,MAAQ,WAEtB,CAAC4K,EAAS5K,GAAKqK,CAAM;AACrB,YAAM,IAAI,MAAM,iBAAiB,OAAOK,CAAS,CAAC,IAAI1K,CAAG,KAAK,OAAOA,CAAG,eAAe9H,CAAI,EAAE;AAAA,EAEzG;AACI,aAAW,CAACwS,GAAWxS,CAAI,KAAK,OAAO,QAAQqS,CAAU;AACrD,IAAAE,EAAWC,GAAWxS,GAAM,EAAK;AACrC,aAAW,CAACwS,GAAWxS,CAAI,KAAK,OAAO,QAAQsS,CAAa;AACxD,IAAAC,EAAWC,GAAWxS,GAAM,EAAI;AACpC,SAAOmS;AACX;AAYO,MAAM0yC,KAAiB,MAAM;AAChC,QAAM,IAAI,MAAM,iBAAiB;AACrC;AAKO,SAASC,GAAS5kD,GAAI;AACzB,QAAM8U,IAAM,oBAAI;AAChB,SAAO,CAACqkC,MAAQ3zB,MAAS;AACrB,UAAM5d,IAAMkN,EAAI,IAAIqkC,CAAG;AACvB,QAAIvxC,MAAQ;AACR,aAAOA;AACX,UAAMi9C,IAAW7kD,EAAGm5C,GAAK,GAAG3zB,CAAI;AAChC,WAAA1Q,EAAI,IAAIqkC,GAAK0L,CAAQ,GACdA;AAAA,EACf;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC3UA;AAIA,MAAMv1C,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGiD,KAAM,OAAO,CAAC,GAEjEC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC;AAE1C,OAAO,CAAC;AAAU,OAAO,EAAE;AAEhC,SAASC,GAAI7H,GAAGhB,GAAG;AACtB,QAAM8I,IAAS9H,IAAIhB;AACnB,SAAO8I,KAAUxD,KAAMwD,IAAS9I,IAAI8I;AACxC;AAQO,SAASC,GAAIlD,GAAKmD,GAAOC,GAAQ;AACpC,MAAIA,KAAU3D,MAAO0D,IAAQ1D;AACzB,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAI2D,MAAW1D;AACX,WAAOD;AACX,MAAIzF,IAAM0F;AACV,SAAOyD,IAAQ1D;AACX,IAAI0D,IAAQzD,OACR1F,IAAOA,IAAMgG,IAAOoD,IACxBpD,IAAOA,IAAMA,IAAOoD,GACpBD,MAAUzD;AAEd,SAAO1F;AACX;AAEO,SAASqJ,GAAKC,GAAGH,GAAOC,GAAQ;AACnC,MAAIpJ,IAAMsJ;AACV,SAAOH,MAAU1D;AACb,IAAAzF,KAAOA,GACPA,KAAOoJ;AAEX,SAAOpJ;AACX;AAEO,SAASuJ,GAAOhJ,GAAQ6I,GAAQ;AACnC,MAAI7I,MAAWkF,MAAO2D,KAAU3D;AAC5B,UAAM,IAAI,MAAM,6CAA6ClF,CAAM,QAAQ6I,CAAM,EAAE;AAIvF,MAAIjI,IAAI6H,GAAIzI,GAAQ6I,CAAM,GACtBjJ,IAAIiJ,GAEJE,IAAI7D,IAAc+D,IAAI9D;AAC1B,SAAOvE,MAAMsE,MAAK;AAEd,UAAMgE,IAAItJ,IAAIgB,GACRY,IAAI5B,IAAIgB,GACRuI,IAAIJ,IAAIE,IAAIC;AAGlB,IAAAtJ,IAAIgB,GAAGA,IAAIY,GAAGuH,IAAIE,GAAUA,IAAIE;AAAA,EACnC;AAED,MADYvJ,MACAuF;AACR,UAAM,IAAI,MAAM,wBAAwB;AAC5C,SAAOsD,GAAIM,GAAGF,CAAM;AACxB;AASO,SAASO,GAAcC,GAAG;AAM7B,QAAMC,KAAaD,IAAIlE,MAAOC;AAC9B,MAAImE,GAAGC,GAAGC;AAGV,OAAKF,IAAIF,IAAIlE,IAAKqE,IAAI,GAAGD,IAAInE,OAAQF,IAAKqE,KAAKnE,IAAKoE;AAChD;AAEJ,OAAKC,IAAIrE,IAAKqE,IAAIJ,KAAKV,GAAIc,GAAGH,GAAWD,CAAC,MAAMA,IAAIlE,IAAKsE;AACrD;AAEJ,MAAID,MAAM,GAAG;AACT,UAAME,KAAUL,IAAIlE,MAAOmD;AAC3B,WAAO,SAAqBqB,GAAIzS,GAAG;AAC/B,YAAM0S,IAAOD,EAAG,IAAIzS,GAAGwS,CAAM;AAC7B,UAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAG1S,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAO0S;AAAA,IACnB;AAAA,EACK;AAED,QAAMC,KAAUN,IAAIpE,MAAOC;AAC3B,SAAO,SAAqBuE,GAAIzS,GAAG;AAE/B,QAAIyS,EAAG,IAAIzS,GAAGoS,CAAS,MAAMK,EAAG,IAAIA,EAAG,GAAG;AACtC,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAInI,IAAIgI,GAEJM,IAAIH,EAAG,IAAIA,EAAG,IAAIA,EAAG,KAAKF,CAAC,GAAGF,CAAC,GAC/BR,IAAIY,EAAG,IAAIzS,GAAG2S,CAAM,GACpBjK,IAAI+J,EAAG,IAAIzS,GAAGqS,CAAC;AACnB,WAAO,CAACI,EAAG,IAAI/J,GAAG+J,EAAG,GAAG,KAAG;AACvB,UAAIA,EAAG,IAAI/J,GAAG+J,EAAG,IAAI;AACjB,eAAOA,EAAG;AAEd,UAAI,IAAI;AACR,eAASI,IAAKJ,EAAG,IAAI/J,CAAC,GAAG,IAAI4B,KACrB,CAAAmI,EAAG,IAAII,GAAIJ,EAAG,GAAG,GADO;AAG5B,QAAAI,IAAKJ,EAAG,IAAII,CAAE;AAGlB,YAAMC,IAAKL,EAAG,IAAIG,GAAG3E,MAAO,OAAO3D,IAAI,IAAI,CAAC,CAAC;AAC7C,MAAAsI,IAAIH,EAAG,IAAIK,CAAE,GACbjB,IAAIY,EAAG,IAAIZ,GAAGiB,CAAE,GAChBpK,IAAI+J,EAAG,IAAI/J,GAAGkK,CAAC,GACftI,IAAI;AAAA,IACP;AACD,WAAOuH;AAAA,EACf;AACA;AACO,SAASkB,GAAOZ,GAAG;AAKtB,MAAIA,IAAIf,OAAQD,IAAK;AAKjB,UAAMqB,KAAUL,IAAIlE,MAAOmD;AAC3B,WAAO,SAAmBqB,GAAIzS,GAAG;AAC7B,YAAM0S,IAAOD,EAAG,IAAIzS,GAAGwS,CAAM;AAE7B,UAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAG1S,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAO0S;AAAA,IACnB;AAAA,EACK;AAED,MAAIP,IAAIb,OAAQD,IAAK;AACjB,UAAM2B,KAAMb,IAAId,MAAOC;AACvB,WAAO,SAAmBmB,GAAIzS,GAAG;AAC7B,YAAMiT,IAAKR,EAAG,IAAIzS,GAAGkO,EAAG,GAClB/I,IAAIsN,EAAG,IAAIQ,GAAID,CAAE,GACjBE,IAAKT,EAAG,IAAIzS,GAAGmF,CAAC,GAChBF,IAAIwN,EAAG,IAAIA,EAAG,IAAIS,GAAIhF,EAAG,GAAG/I,CAAC,GAC7BuN,IAAOD,EAAG,IAAIS,GAAIT,EAAG,IAAIxN,GAAGwN,EAAG,GAAG,CAAC;AACzC,UAAI,CAACA,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAG1S,CAAC;AACvB,cAAM,IAAI,MAAM,yBAAyB;AAC7C,aAAO0S;AAAA,IACnB;AAAA,EACK;AAwBD,SAAOR,GAAcC,CAAC;AAC1B;AAIA,MAAMgB,KAAe;AAAA,EACjB;AAAA,EAAU;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAClD;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACnC;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAC5B;AACO,SAASC,GAAcC,GAAO;AACjC,QAAMC,IAAU;AAAA,IACZ,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,EACd,GACUC,IAAOJ,GAAa,OAAO,CAACK,GAAKlN,OACnCkN,EAAIlN,CAAG,IAAI,YACJkN,IACRF,CAAO;AACV,SAAO1C,GAAeyC,GAAOE,CAAI;AACrC;AAMO,SAASE,GAAMC,GAAGnF,GAAKmD,GAAO;AAGjC,MAAIA,IAAQ1D;AACR,UAAM,IAAI,MAAM,oBAAoB;AACxC,MAAI0D,MAAU1D;AACV,WAAO0F,EAAE;AACb,MAAIhC,MAAUzD;AACV,WAAOM;AACX,MAAI3J,IAAI8O,EAAE,KACNC,IAAIpF;AACR,SAAOmD,IAAQ1D;AACX,IAAI0D,IAAQzD,OACRrJ,IAAI8O,EAAE,IAAI9O,GAAG+O,CAAC,IAClBA,IAAID,EAAE,IAAIC,CAAC,GACXjC,MAAUzD;AAEd,SAAOrJ;AACX;AAKO,SAASgP,GAAcF,GAAGG,GAAM;AACnC,QAAMhJ,IAAM,IAAI,MAAMgJ,EAAK,MAAM,GAE3BC,IAAiBD,EAAK,OAAO,CAACE,GAAKxF,GAAKtJ,MACtCyO,EAAE,IAAInF,CAAG,IACFwF,KACXlJ,EAAI5F,CAAC,IAAI8O,GACFL,EAAE,IAAIK,GAAKxF,CAAG,IACtBmF,EAAE,GAAG,GAEFM,IAAWN,EAAE,IAAII,CAAc;AAErC,SAAAD,EAAK,YAAY,CAACE,GAAKxF,GAAKtJ,MACpByO,EAAE,IAAInF,CAAG,IACFwF,KACXlJ,EAAI5F,CAAC,IAAIyO,EAAE,IAAIK,GAAKlJ,EAAI5F,CAAC,CAAC,GACnByO,EAAE,IAAIK,GAAKxF,CAAG,IACtByF,CAAQ,GACJnJ;AACX;AAoBO,SAASoJ,GAAQ,GAAGC,GAAY;AAEnC,QAAMC,IAAcD,MAAe,SAAYA,IAAa,EAAE,SAAS,CAAC,EAAE,QACpEE,IAAc,KAAK,KAAKD,IAAc,CAAC;AAC7C,SAAO,EAAE,YAAYA,GAAa,aAAAC;AACtC;AAgBO,SAASC,GAAMC,GAAO5E,GAAQ3F,IAAO,IAAOwK,IAAQ,IAAI;AAC3D,MAAID,KAAStG;AACT,UAAM,IAAI,MAAM,iCAAiCsG,CAAK,EAAE;AAC5D,QAAM,EAAE,YAAYE,GAAM,aAAaC,EAAK,IAAKR,GAAQK,GAAO5E,CAAM;AACtE,MAAI+E,IAAQ;AACR,UAAM,IAAI,MAAM,iDAAiD;AACrE,QAAMC,IAAQ3B,GAAOuB,CAAK,GACpBZ,IAAI,OAAO,OAAO;AAAA,IACpB,OAAAY;AAAA,IACA,MAAAE;AAAA,IACA,OAAAC;AAAA,IACA,MAAM5E,GAAQ2E,CAAI;AAAA,IAClB,MAAMxG;AAAAA,IACN,KAAKC;AAAAA,IACL,QAAQ,CAACM,MAAQgD,GAAIhD,GAAK+F,CAAK;AAAA,IAC/B,SAAS,CAAC/F,MAAQ;AACd,UAAI,OAAOA,KAAQ;AACf,cAAM,IAAI,MAAM,+CAA+C,OAAOA,CAAG,EAAE;AAC/E,aAAOP,MAAOO,KAAOA,IAAM+F;AAAA,IAC9B;AAAA,IACD,KAAK,CAAC/F,MAAQA,MAAQP;AAAAA,IACtB,OAAO,CAACO,OAASA,IAAMN,QAASA;AAAAA,IAChC,KAAK,CAACM,MAAQgD,GAAI,CAAChD,GAAK+F,CAAK;AAAA,IAC7B,KAAK,CAACK,GAAKC,MAAQD,MAAQC;AAAA,IAC3B,KAAK,CAACrG,MAAQgD,GAAIhD,IAAMA,GAAK+F,CAAK;AAAA,IAClC,KAAK,CAACK,GAAKC,MAAQrD,GAAIoD,IAAMC,GAAKN,CAAK;AAAA,IACvC,KAAK,CAACK,GAAKC,MAAQrD,GAAIoD,IAAMC,GAAKN,CAAK;AAAA,IACvC,KAAK,CAACK,GAAKC,MAAQrD,GAAIoD,IAAMC,GAAKN,CAAK;AAAA,IACvC,KAAK,CAAC/F,GAAKmD,MAAU+B,GAAMC,GAAGnF,GAAKmD,CAAK;AAAA,IACxC,KAAK,CAACiD,GAAKC,MAAQrD,GAAIoD,IAAM7C,GAAO8C,GAAKN,CAAK,GAAGA,CAAK;AAAA;AAAA,IAEtD,MAAM,CAAC/F,MAAQA,IAAMA;AAAA,IACrB,MAAM,CAACoG,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,KAAK,CAACrG,MAAQuD,GAAOvD,GAAK+F,CAAK;AAAA,IAC/B,MAAMC,EAAM,SAAS,CAACvU,MAAM0U,EAAMhB,GAAG1T,CAAC;AAAA,IACtC,aAAa,CAAC6U,MAAQjB,GAAcF,GAAGmB,CAAG;AAAA;AAAA;AAAA,IAG1C,MAAM,CAACnL,GAAGhB,GAAG/D,MAAOA,IAAI+D,IAAIgB;AAAA,IAC5B,SAAS,CAAC6E,MAASxE,IAAOkF,GAAgBV,GAAKkG,CAAK,IAAIzF,GAAgBT,GAAKkG,CAAK;AAAA,IAClF,WAAW,CAAC1L,MAAU;AAClB,UAAIA,EAAM,WAAW0L;AACjB,cAAM,IAAI,MAAM,0BAA0BA,CAAK,SAAS1L,EAAM,MAAM,EAAE;AAC1E,aAAOgB,IAAOgF,GAAgBhG,CAAK,IAAI+F,GAAgB/F,CAAK;AAAA,IAC/D;AAAA,EACT,CAAK;AACD,SAAO,OAAO,OAAO2K,CAAC;AAC1B;AAkCO,SAASoB,GAAoBC,GAAY;AAC5C,MAAI,OAAOA,KAAe;AACtB,UAAM,IAAI,MAAM,4BAA4B;AAChD,QAAMC,IAAYD,EAAW,SAAS,CAAC,EAAE;AACzC,SAAO,KAAK,KAAKC,IAAY,CAAC;AAClC;AAQO,SAASC,GAAiBF,GAAY;AACzC,QAAM1I,IAASyI,GAAoBC,CAAU;AAC7C,SAAO1I,IAAS,KAAK,KAAKA,IAAS,CAAC;AACxC;AAcO,SAAS6I,GAAelQ,GAAK+P,GAAYhL,IAAO,IAAO;AAC1D,QAAM8B,IAAM7G,EAAI,QACVmQ,IAAWL,GAAoBC,CAAU,GACzCK,IAASH,GAAiBF,CAAU;AAE1C,MAAIlJ,IAAM,MAAMA,IAAMuJ,KAAUvJ,IAAM;AAClC,UAAM,IAAI,MAAM,YAAYuJ,CAAM,6BAA6BvJ,CAAG,EAAE;AACxE,QAAM0C,IAAMxE,IAAO+E,GAAgB9J,CAAG,IAAI+J,GAAgB/J,CAAG,GAEvDqQ,IAAU9D,GAAIhD,GAAKwG,IAAa9G,EAAG,IAAIA;AAC7C,SAAOlE,IAAOkF,GAAgBoG,GAASF,CAAQ,IAAInG,GAAgBqG,GAASF,CAAQ;AACxF;ACxaA;AAIA,MAAMnH,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GAGdgL,KAAmB,oBAAI,WACvBuqC,KAAmB,oBAAI;AAYtB,SAASluC,GAAK3Q,GAAG4Q,GAAM;AAC1B,QAAMC,IAAkB,CAACC,GAAWC,MAAS;AACzC,UAAMC,IAAMD,EAAK;AACjB,WAAOD,IAAYE,IAAMD;AAAA,EACjC,GACU+tC,IAAY,CAAC7tC,MAAM;AACrB,QAAI,CAAC,OAAO,cAAcA,CAAC,KAAKA,KAAK,KAAKA,IAAIL;AAC1C,YAAM,IAAI,MAAM,qBAAqBK,CAAC,mBAAmBL,CAAI,GAAG;AAAA,EAC5E,GACUhC,IAAO,CAACqC,MAAM;AAChB,IAAA6tC,EAAU7tC,CAAC;AACX,UAAMC,IAAU,KAAK,KAAKN,IAAOK,CAAC,IAAI,GAChCE,IAAa,MAAMF,IAAI;AAC7B,WAAO,EAAE,SAAAC,GAAS,YAAAC;EAC1B;AACI,SAAO;AAAA,IACH,iBAAAN;AAAA;AAAA,IAEA,aAAaO,GAAK/V,GAAG;AACjB,UAAI4E,IAAID,EAAE,MACNgP,IAAIoC;AACR,aAAO/V,IAAIgO;AACP,QAAIhO,IAAIiO,OACJrJ,IAAIA,EAAE,IAAI+O,CAAC,IACfA,IAAIA,EAAE,UACN3T,MAAMiO;AAEV,aAAOrJ;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAWD,iBAAiBmR,GAAKH,GAAG;AACrB,YAAM,EAAE,SAAAC,GAAS,YAAAC,EAAY,IAAGvC,EAAKqC,CAAC,GAChCI,IAAS,CAAA;AACf,UAAIpR,IAAImR,GACJE,IAAOrR;AACX,eAASsR,IAAS,GAAGA,IAASL,GAASK,KAAU;AAC7C,QAAAD,IAAOrR,GACPoR,EAAO,KAAKC,CAAI;AAEhB,iBAAShR,IAAI,GAAGA,IAAI6Q,GAAY7Q;AAC5B,UAAAgR,IAAOA,EAAK,IAAIrR,CAAC,GACjBoR,EAAO,KAAKC,CAAI;AAEpB,QAAArR,IAAIqR,EAAK;MACZ;AACD,aAAOD;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,KAAKJ,GAAGO,GAAanW,GAAG;AAGpB,YAAM,EAAE,SAAA6V,GAAS,YAAAC,EAAY,IAAGvC,EAAKqC,CAAC;AACtC,UAAIhR,IAAID,EAAE,MACN+O,IAAI/O,EAAE;AACV,YAAMyR,IAAO,OAAO,KAAKR,IAAI,CAAC,GACxBS,IAAY,KAAKT,GACjBU,IAAU,OAAOV,CAAC;AACxB,eAASM,IAAS,GAAGA,IAASL,GAASK,KAAU;AAC7C,cAAM5I,IAAS4I,IAASJ;AAExB,YAAIS,IAAQ,OAAOvW,IAAIoW,CAAI;AAE3B,QAAApW,MAAMsW,GAGFC,IAAQT,MACRS,KAASF,GACTrW,KAAKiO;AAST,cAAMuI,IAAUlJ,GACVmJ,IAAUnJ,IAAS,KAAK,IAAIiJ,CAAK,IAAI,GACrCG,IAAQR,IAAS,MAAM,GACvBS,IAAQJ,IAAQ;AACtB,QAAIA,MAAU,IAEV7C,IAAIA,EAAE,IAAI8B,EAAgBkB,GAAOP,EAAYK,CAAO,CAAC,CAAC,IAGtD5R,IAAIA,EAAE,IAAI4Q,EAAgBmB,GAAOR,EAAYM,CAAO,CAAC,CAAC;AAAA,MAE7D;AAMD,aAAO,EAAE,GAAA7R,GAAG,GAAA8O;IACf;AAAA,IACD,WAAWvB,GAAGnS,GAAG6W,GAAW;AACxB,YAAMjB,IAAI4tC,GAAiB,IAAIrxC,CAAC,KAAK;AAErC,UAAI2E,IAAOmC,GAAiB,IAAI9G,CAAC;AACjC,aAAK2E,MACDA,IAAO,KAAK,iBAAiB3E,GAAGyD,CAAC,GAC7BA,MAAM,KACNqD,GAAiB,IAAI9G,GAAG0E,EAAUC,CAAI,CAAC,IAExC,KAAK,KAAKlB,GAAGkB,GAAM9W,CAAC;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA,IAID,cAAcmS,GAAGyD,GAAG;AAChB,MAAA6tC,EAAU7tC,CAAC,GACX4tC,GAAiB,IAAIrxC,GAAGyD,CAAC,GACzBqD,GAAiB,OAAO9G,CAAC;AAAA,IAC5B;AAAA,EACT;AACA;AAYO,SAASuxC,GAAU/+C,GAAG0O,GAAO2C,GAAQ2tC,GAAS;AAOjD,MAAI,CAAC,MAAM,QAAQ3tC,CAAM,KAAK,CAAC,MAAM,QAAQ2tC,CAAO,KAAKA,EAAQ,WAAW3tC,EAAO;AAC/E,UAAM,IAAI,MAAM,qDAAqD;AACzE,EAAA2tC,EAAQ,QAAQ,CAAC5jD,GAAGkF,MAAM;AACtB,QAAI,CAACoO,EAAM,QAAQtT,CAAC;AAChB,YAAM,IAAI,MAAM,yBAAyBkF,CAAC,EAAE;AAAA,EACxD,CAAK,GACD+Q,EAAO,QAAQ,CAACpR,GAAGK,MAAM;AACrB,QAAI,EAAEL,aAAaD;AACf,YAAM,IAAI,MAAM,wBAAwBM,CAAC,EAAE;AAAA,EACvD,CAAK;AACD,QAAMsR,IAAQ7G,GAAO,OAAOsG,EAAO,MAAM,CAAC,GACpCF,IAAaS,IAAQ,KAAKA,IAAQ,IAAIA,IAAQ,IAAIA,IAAQ,IAAIA,IAAQ,IAAI,GAC1EqtC,KAAQ,KAAK9tC,KAAc,GAC3B+tC,IAAU,IAAI,MAAMD,IAAO,CAAC,EAAE,KAAKj/C,EAAE,IAAI,GACzCm/C,IAAW,KAAK,OAAOzwC,EAAM,OAAO,KAAKyC,CAAU,IAAIA;AAC7D,MAAIvL,IAAM5F,EAAE;AACZ,WAASM,IAAI6+C,GAAU7+C,KAAK,GAAGA,KAAK6Q,GAAY;AAC5C,IAAA+tC,EAAQ,KAAKl/C,EAAE,IAAI;AACnB,aAASgK,IAAI,GAAGA,IAAIg1C,EAAQ,QAAQh1C,KAAK;AACrC,YAAM4M,IAASooC,EAAQh1C,CAAC,GAClB4H,IAAQ,OAAQgF,KAAU,OAAOtW,CAAC,IAAK,OAAO2+C,CAAI,CAAC;AACzD,MAAAC,EAAQttC,CAAK,IAAIstC,EAAQttC,CAAK,EAAE,IAAIP,EAAOrH,CAAC,CAAC;AAAA,IAChD;AACD,QAAIo1C,IAAOp/C,EAAE;AAEb,aAASgK,IAAIk1C,EAAQ,SAAS,GAAGG,IAAOr/C,EAAE,MAAMgK,IAAI,GAAGA;AACnD,MAAAq1C,IAAOA,EAAK,IAAIH,EAAQl1C,CAAC,CAAC,GAC1Bo1C,IAAOA,EAAK,IAAIC,CAAI;AAGxB,QADAz5C,IAAMA,EAAI,IAAIw5C,CAAI,GACd9+C,MAAM;AACN,eAAS0J,IAAI,GAAGA,IAAImH,GAAYnH;AAC5B,QAAApE,IAAMA,EAAI;EACrB;AACD,SAAOA;AACX;AACO,SAASwM,GAAcC,GAAO;AACjC,SAAA5D,GAAc4D,EAAM,EAAE,GACtBpG,GAAeoG,GAAO;AAAA,IAClB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,IAAI;AAAA,EACZ,GAAO;AAAA,IACC,YAAY;AAAA,IACZ,aAAa;AAAA,EACrB,CAAK,GAEM,OAAO,OAAO;AAAA,IACjB,GAAG/C,GAAQ+C,EAAM,GAAGA,EAAM,UAAU;AAAA,IACpC,GAAGA;AAAA,IACE,GAAGA,EAAM,GAAG;AAAA,EACzB,CAAK;AACL;AC/NA;AAMA,SAASitC,GAAmB1wC,GAAM;AAC9B,EAAIA,EAAK,SAAS,UACdqb,GAAM,QAAQrb,EAAK,IAAI,GACvBA,EAAK,YAAY,UACjBqb,GAAM,WAAWrb,EAAK,OAAO;AACrC;AACA,SAAS0D,GAAkBD,GAAO;AAC9B,QAAMzD,IAAOwD,GAAcC,CAAK;AAChCE,EAAAA,GAAkB3D,GAAM;AAAA,IACpB,GAAG;AAAA,IACH,GAAG;AAAA,EACX,GAAO;AAAA,IACC,0BAA0B;AAAA,IAC1B,gBAAgB;AAAA,IAChB,eAAe;AAAA,IACf,eAAe;AAAA,IACf,oBAAoB;AAAA,IACpB,WAAW;AAAA,IACX,SAAS;AAAA,EACjB,CAAK;AACD,QAAM,EAAE,MAAA4D,GAAM,IAAA1E,GAAI,GAAA/I,EAAC,IAAK6J;AACxB,MAAI4D,GAAM;AACN,QAAI,CAAC1E,EAAG,IAAI/I,GAAG+I,EAAG,IAAI;AAClB,YAAM,IAAI,MAAM,mEAAmE;AAEvF,QAAI,OAAO0E,KAAS,YAChB,OAAOA,EAAK,QAAS,YACrB,OAAOA,EAAK,eAAgB;AAC5B,YAAM,IAAI,MAAM,mEAAmE;AAAA,EAE1F;AACD,SAAO,OAAO,OAAO,EAAE,GAAG5D,EAAM,CAAA;AACpC;AACA,MAAM,EAAE,iBAAiB6D,IAAK,YAAYC,GAAG,IAAKC,IAQrCC,KAAM;AAAA;AAAA,EAEf,KAAK,cAAqB,MAAM;AAAA,IAC5B,YAAYtF,IAAI,IAAI;AAChB,YAAMA,CAAC;AAAA,IACV;AAAA,EACJ;AAAA;AAAA,EAED,MAAM;AAAA,IACF,QAAQ,CAACmR,GAAKjZ,MAAS;AACnB,YAAM,EAAE,KAAK+C,EAAG,IAAGqK;AACnB,UAAI6L,IAAM,KAAKA,IAAM;AACjB,cAAM,IAAIlW,EAAE,uBAAuB;AACvC,UAAI/C,EAAK,SAAS;AACd,cAAM,IAAI+C,EAAE,2BAA2B;AAC3C,YAAMg3C,IAAU/5C,EAAK,SAAS,GACxB0B,IAAMs4C,GAAuBD,CAAO;AAC1C,UAAKr4C,EAAI,SAAS,IAAK;AACnB,cAAM,IAAIqB,EAAE,sCAAsC;AAEtD,YAAMk3C,IAASF,IAAU,MAAMC,GAAwBt4C,EAAI,SAAS,IAAK,GAAG,IAAI;AAChF,aAAO,GAAGs4C,GAAuB/gC,CAAG,CAAC,GAAGghC,CAAM,GAAGv4C,CAAG,GAAG1B,CAAI;AAAA,IAC9D;AAAA;AAAA,IAED,OAAOiZ,GAAKjZ,GAAM;AACd,YAAM,EAAE,KAAK+C,EAAG,IAAGqK;AACnB,UAAIzL,IAAM;AACV,UAAIsX,IAAM,KAAKA,IAAM;AACjB,cAAM,IAAIlW,EAAE,uBAAuB;AACvC,UAAI/C,EAAK,SAAS,KAAKA,EAAK2B,GAAK,MAAMsX;AACnC,cAAM,IAAIlW,EAAE,uBAAuB;AACvC,YAAMo9B,IAAQngC,EAAK2B,GAAK,GAClBu4C,IAAS,CAAC,EAAE/Z,IAAQ;AAC1B,UAAIj+B,IAAS;AACb,UAAI,CAACg4C;AACD,QAAAh4C,IAASi+B;AAAA,WACR;AAED,cAAM8Z,IAAS9Z,IAAQ;AACvB,YAAI,CAAC8Z;AACD,gBAAM,IAAIl3C,EAAE,mDAAmD;AACnE,YAAIk3C,IAAS;AACT,gBAAM,IAAIl3C,EAAE,0CAA0C;AAC1D,cAAMo3C,IAAcn6C,EAAK,SAAS2B,GAAKA,IAAMs4C,CAAM;AACnD,YAAIE,EAAY,WAAWF;AACvB,gBAAM,IAAIl3C,EAAE,uCAAuC;AACvD,YAAIo3C,EAAY,CAAC,MAAM;AACnB,gBAAM,IAAIp3C,EAAE,sCAAsC;AACtD,mBAAWxE,KAAK47C;AACZ,UAAAj4C,IAAUA,KAAU,IAAK3D;AAE7B,YADAoD,KAAOs4C,GACH/3C,IAAS;AACT,gBAAM,IAAIa,EAAE,wCAAwC;AAAA,MAC3D;AACD,YAAM/H,IAAIgF,EAAK,SAAS2B,GAAKA,IAAMO,CAAM;AACzC,UAAIlH,EAAE,WAAWkH;AACb,cAAM,IAAIa,EAAE,gCAAgC;AAChD,aAAO,EAAE,GAAA/H,GAAG,GAAGgF,EAAK,SAAS2B,IAAMO,CAAM;IAC5C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAKD,MAAM;AAAA,IACF,OAAOkC,GAAK;AACR,YAAM,EAAE,KAAKrB,EAAG,IAAGqK;AACnB,UAAIhJ,IAAMP;AACN,cAAM,IAAId,EAAE,4CAA4C;AAC5D,UAAImB,IAAM81C,GAAuB51C,CAAG;AAIpC,UAFI,OAAO,SAASF,EAAI,CAAC,GAAG,EAAE,IAAI,MAC9BA,IAAM,OAAOA,IACbA,EAAI,SAAS;AACb,cAAM,IAAInB,EAAE,sBAAsB;AACtC,aAAOmB;AAAA,IACV;AAAA,IACD,OAAOlE,GAAM;AACT,YAAM,EAAE,KAAK+C,EAAG,IAAGqK;AACnB,UAAIpN,EAAK,CAAC,IAAI;AACV,cAAM,IAAI+C,EAAE,qCAAqC;AACrD,UAAI/C,EAAK,CAAC,MAAM,KAAQ,EAAEA,EAAK,CAAC,IAAI;AAChC,cAAM,IAAI+C,EAAE,qDAAqD;AACrE,aAAOkK,GAAIjN,CAAI;AAAA,IAClB;AAAA,EACJ;AAAA,EACD,MAAMkE,GAAK;AAEP,UAAM,EAAE,KAAKnB,GAAG,MAAMq3C,GAAK,MAAMvoB,EAAK,IAAGzkB,IACnCpN,IAAO,OAAOkE,KAAQ,WAAWgJ,GAAIhJ,CAAG,IAAIA;AAClDm2C,IAAAA,GAAUr6C,CAAI;AACd,UAAM,EAAE,GAAGs6C,GAAU,GAAGC,MAAiB1oB,EAAI,OAAO,IAAM7xB,CAAI;AAC9D,QAAIu6C,EAAa;AACb,YAAM,IAAIx3C,EAAE,6CAA6C;AAC7D,UAAM,EAAE,GAAGy3C,GAAQ,GAAGC,MAAe5oB,EAAI,OAAO,GAAMyoB,CAAQ,GACxD,EAAE,GAAGhtC,GAAQ,GAAGotC,MAAe7oB,EAAI,OAAO,GAAM4oB,CAAU;AAChE,QAAIC,EAAW;AACX,YAAM,IAAI33C,EAAE,6CAA6C;AAC7D,WAAO,EAAE,GAAGq3C,EAAI,OAAOI,CAAM,GAAG,GAAGJ,EAAI,OAAO9sC,CAAM;EACvD;AAAA,EACD,WAAWE,GAAK;AACZ,UAAM,EAAE,MAAMqkB,GAAK,MAAMuoB,EAAG,IAAKhtC,IAC3ButC,IAAM,GAAG9oB,EAAI,OAAO,GAAMuoB,EAAI,OAAO5sC,EAAI,CAAC,CAAC,CAAC,GAAGqkB,EAAI,OAAO,GAAMuoB,EAAI,OAAO5sC,EAAI,CAAC,CAAC,CAAC;AACxF,WAAOqkB,EAAI,OAAO,IAAM8oB,CAAG;AAAA,EAC9B;AACL,GAGM92C,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC;AAAS,OAAO,CAAC;AAAE,MAACkD,KAAM,OAAO,CAAC;AAAS,OAAO,CAAC;AACjF,SAAS6G,GAAkBzE,GAAM;AACpC,QAAM0E,IAAQhB,GAAkB1D,CAAI,GAC9B,EAAE,IAAAd,EAAI,IAAGwF,GACT8sC,IAAKC,GAAU/sC,EAAM,GAAGA,EAAM,UAAU,GACxC/N,IAAU+N,EAAM,YACjB,CAACpS,GAAIqS,GAAOC,MAAkB;AAC3B,UAAMzO,IAAIwO,EAAM;AAChB,WAAOE,GAAe,WAAW,KAAK,CAAC,CAAI,CAAC,GAAG3F,EAAG,QAAQ/I,EAAE,CAAC,GAAG+I,EAAG,QAAQ/I,EAAE,CAAC,CAAC;AAAA,EAC3F,IACU2O,IAAYJ,EAAM,cACnB,CAAClP,MAAU;AAER,UAAMuP,IAAOvP,EAAM,SAAS,CAAC,GAEvB8I,IAAIY,EAAG,UAAU6F,EAAK,SAAS,GAAG7F,EAAG,KAAK,CAAC,GAC3CkH,IAAIlH,EAAG,UAAU6F,EAAK,SAAS7F,EAAG,OAAO,IAAIA,EAAG,KAAK,CAAC;AAC5D,WAAO,EAAE,GAAAZ,GAAG,GAAA8H;EACxB;AAKI,WAASpB,EAAoB1G,GAAG;AAC5B,UAAM,EAAE,GAAAnI,GAAG,GAAAhB,EAAG,IAAGuP,GACXO,IAAK/F,EAAG,IAAIZ,CAAC,GACb4G,IAAKhG,EAAG,IAAI+F,GAAI3G,CAAC;AACvB,WAAOY,EAAG,IAAIA,EAAG,IAAIgG,GAAIhG,EAAG,IAAIZ,GAAGnI,CAAC,CAAC,GAAGhB,CAAC;AAAA,EAC5C;AAKD,MAAI,CAAC+J,EAAG,IAAIA,EAAG,IAAIwF,EAAM,EAAE,GAAGM,EAAoBN,EAAM,EAAE,CAAC;AACvD,UAAM,IAAI,MAAM,6CAA6C;AAEjE,WAASS,EAAmBnK,GAAK;AAC7B,WAAO02C,GAAW12C,GAAKN,IAAKgK,EAAM,CAAC;AAAA,EACtC;AAGD,WAASW,EAAuB5T,GAAK;AACjC,UAAM,EAAE,0BAA0BgE,GAAS,aAAAoL,GAAa,gBAAAyE,GAAgB,GAAGqsC,EAAG,IAAGjtC;AACjF,QAAIjP,KAAW,OAAOhE,KAAQ,UAAU;AAIpC,UAHImgD,GAAWngD,CAAG,MACdA,IAAM8T,GAAc9T,CAAG,IAEvB,OAAOA,KAAQ,YAAY,CAACgE,EAAQ,SAAShE,EAAI,MAAM;AACvD,cAAM,IAAI,MAAM,aAAa;AACjC,MAAAA,IAAMA,EAAI,SAASoP,IAAc,GAAG,GAAG;AAAA,IAC1C;AACD,QAAI7F;AACJ,QAAI;AACA,MAAAA,IACI,OAAOvJ,KAAQ,WACTA,IACA+T,GAAmB5J,GAAY,eAAenK,GAAKoP,CAAW,CAAC;AAAA,IAC5E,QACa;AACV,YAAM,IAAI,MAAM,uBAAuBA,CAAW,8BAA8B,OAAOpP,CAAG,EAAE;AAAA,IAC/F;AACD,WAAI6T,MACAtK,IAAMyK,GAAQzK,GAAK22C,CAAC,IACxBE,GAAY,eAAe72C,GAAKN,IAAKi3C,CAAC,GAC/B32C;AAAA,EACV;AACD,WAAS2K,EAAeC,GAAO;AAC3B,QAAI,EAAEA,aAAiBC;AACnB,YAAM,IAAI,MAAM,0BAA0B;AAAA,EACjD;AAKD,QAAMisC,IAAe/B,GAAS,CAAC1+C,GAAGgX,MAAO;AACrC,UAAM,EAAE,IAAI/J,GAAG,IAAI8H,GAAG,IAAIkC,EAAG,IAAGjX;AAEhC,QAAI6N,EAAG,IAAIoJ,GAAGpJ,EAAG,GAAG;AAChB,aAAO,EAAE,GAAAZ,GAAG,GAAA8H;AAChB,UAAMH,IAAM5U,EAAE;AAGd,IAAIgX,KAAM,SACNA,IAAKpC,IAAM/G,EAAG,MAAMA,EAAG,IAAIoJ,CAAC;AAChC,UAAMC,IAAKrJ,EAAG,IAAIZ,GAAG+J,CAAE,GACjBG,IAAKtJ,EAAG,IAAIkH,GAAGiC,CAAE,GACjBI,IAAKvJ,EAAG,IAAIoJ,GAAGD,CAAE;AACvB,QAAIpC;AACA,aAAO,EAAE,GAAG/G,EAAG,MAAM,GAAGA,EAAG;AAC/B,QAAI,CAACA,EAAG,IAAIuJ,GAAIvJ,EAAG,GAAG;AAClB,YAAM,IAAI,MAAM,kBAAkB;AACtC,WAAO,EAAE,GAAGqJ,GAAI,GAAGC,EAAE;AAAA,EAC7B,CAAK,GAGKupC,IAAkBhC,GAAS,CAAC1+C,MAAM;AACpC,QAAIA,EAAE,OAAO;AAIT,UAAIqT,EAAM,sBAAsB,CAACxF,EAAG,IAAI7N,EAAE,EAAE;AACxC;AACJ,YAAM,IAAI,MAAM,iBAAiB;AAAA,IACpC;AAED,UAAM,EAAE,GAAAiN,GAAG,EAAG,IAAGjN,EAAE,SAAQ;AAE3B,QAAI,CAAC6N,EAAG,QAAQZ,CAAC,KAAK,CAACY,EAAG,QAAQ,CAAC;AAC/B,YAAM,IAAI,MAAM,0BAA0B;AAC9C,UAAMmH,IAAOnH,EAAG,IAAI,CAAC,GACfoH,IAAQtB,EAAoB1G,CAAC;AACnC,QAAI,CAACY,EAAG,IAAImH,GAAMC,CAAK;AACnB,YAAM,IAAI,MAAM,mCAAmC;AACvD,QAAI,CAACjV,EAAE,cAAe;AAClB,YAAM,IAAI,MAAM,wCAAwC;AAC5D,WAAO;AAAA,EACf,CAAK;AAAA,EAMD,MAAMwU,EAAM;AAAA,IACR,YAAYC,GAAIC,GAAIC,GAAI;AAIpB,UAHA,KAAK,KAAKF,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACNF,KAAM,QAAQ,CAAC5G,EAAG,QAAQ4G,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,UAAIC,KAAM,QAAQ,CAAC7G,EAAG,QAAQ6G,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,UAAIC,KAAM,QAAQ,CAAC9G,EAAG,QAAQ8G,CAAE;AAC5B,cAAM,IAAI,MAAM,YAAY;AAChC,aAAO,OAAO,IAAI;AAAA,IACrB;AAAA;AAAA;AAAA,IAGD,OAAO,WAAW,GAAG;AACjB,YAAM,EAAE,GAAA1H,GAAG,GAAA8H,MAAM,KAAK,CAAA;AACtB,UAAI,CAAC,KAAK,CAAClH,EAAG,QAAQZ,CAAC,KAAK,CAACY,EAAG,QAAQkH,CAAC;AACrC,cAAM,IAAI,MAAM,sBAAsB;AAC1C,UAAI,aAAaP;AACb,cAAM,IAAI,MAAM,8BAA8B;AAClD,YAAMI,IAAM,CAACvU,MAAMwN,EAAG,IAAIxN,GAAGwN,EAAG,IAAI;AAEpC,aAAI+G,EAAI3H,CAAC,KAAK2H,EAAIG,CAAC,IACRP,EAAM,OACV,IAAIA,EAAMvH,GAAG8H,GAAGlH,EAAG,GAAG;AAAA,IAChC;AAAA,IACD,IAAI,IAAI;AACJ,aAAO,KAAK,SAAU,EAAC;AAAA,IAC1B;AAAA,IACD,IAAI,IAAI;AACJ,aAAO,KAAK,SAAU,EAAC;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,WAAWuD,GAAQ;AACtB,YAAMyD,IAAQhH,EAAG,YAAYuD,EAAO,IAAI,CAACpR,MAAMA,EAAE,EAAE,CAAC;AACpD,aAAOoR,EAAO,IAAI,CAACpR,GAAGK,MAAML,EAAE,SAAS6U,EAAMxU,CAAC,CAAC,CAAC,EAAE,IAAImU,EAAM,UAAU;AAAA,IACzE;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,QAAQ/K,GAAK;AAChB,YAAM8D,IAAIiH,EAAM,WAAWf,EAAUlJ,GAAY,YAAYd,CAAG,CAAC,CAAC;AAClE,aAAA8D,EAAE,eAAc,GACTA;AAAA,IACV;AAAA;AAAA,IAED,OAAO,eAAeuH,GAAY;AAC9B,aAAON,EAAM,KAAK,SAASR,EAAuBc,CAAU,CAAC;AAAA,IAChE;AAAA;AAAA,IAED,OAAO,IAAI1D,GAAQ2tC,GAAS;AACxB,aAAOD,GAAUtqC,GAAO2rC,GAAI/uC,GAAQ2tC,CAAO;AAAA,IAC9C;AAAA;AAAA,IAED,eAAe7tC,GAAY;AACvB,MAAAiF,EAAK,cAAc,MAAMjF,CAAU;AAAA,IACtC;AAAA;AAAA,IAED,iBAAiB;AACb,MAAAwvC,EAAgB,IAAI;AAAA,IACvB;AAAA,IACD,WAAW;AACP,YAAM,EAAE,GAAA3rC,EAAC,IAAK,KAAK,SAAQ;AAC3B,UAAIlH,EAAG;AACH,eAAO,CAACA,EAAG,MAAMkH,CAAC;AACtB,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAChD;AAAA;AAAA;AAAA;AAAA,IAID,OAAOR,GAAO;AACV,MAAAD,EAAeC,CAAK;AACpB,YAAM,EAAE,IAAIW,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG,MAC7B,EAAE,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAGhB,GAC7BiB,IAAK3H,EAAG,IAAIA,EAAG,IAAIqH,GAAIK,CAAE,GAAG1H,EAAG,IAAIwH,GAAID,CAAE,CAAC,GAC1CK,IAAK5H,EAAG,IAAIA,EAAG,IAAIsH,GAAII,CAAE,GAAG1H,EAAG,IAAIyH,GAAIF,CAAE,CAAC;AAChD,aAAOI,KAAMC;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA,IAID,SAAS;AACL,aAAO,IAAIjB,EAAM,KAAK,IAAI3G,EAAG,IAAI,KAAK,EAAE,GAAG,KAAK,EAAE;AAAA,IACrD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,SAAS;AACL,YAAM,EAAE,GAAA/I,GAAG,GAAAhB,EAAG,IAAGuP,GACXqC,IAAK7H,EAAG,IAAI/J,GAAGyI,EAAG,GAClB,EAAE,IAAI2I,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG;AACnC,UAAIO,IAAK9H,EAAG,MAAM+H,IAAK/H,EAAG,MAAMgI,IAAKhI,EAAG,MACpCiI,IAAKjI,EAAG,IAAIqH,GAAIA,CAAE,GAClBa,IAAKlI,EAAG,IAAIsH,GAAIA,CAAE,GAClBlH,IAAKJ,EAAG,IAAIuH,GAAIA,CAAE,GAClBY,IAAKnI,EAAG,IAAIqH,GAAIC,CAAE;AACtB,aAAAa,IAAKnI,EAAG,IAAImI,GAAIA,CAAE,GAClBH,IAAKhI,EAAG,IAAIqH,GAAIE,CAAE,GAClBS,IAAKhI,EAAG,IAAIgI,GAAIA,CAAE,GAClBF,IAAK9H,EAAG,IAAI/I,GAAG+Q,CAAE,GACjBD,IAAK/H,EAAG,IAAI6H,GAAIzH,CAAE,GAClB2H,IAAK/H,EAAG,IAAI8H,GAAIC,CAAE,GAClBD,IAAK9H,EAAG,IAAIkI,GAAIH,CAAE,GAClBA,IAAK/H,EAAG,IAAIkI,GAAIH,CAAE,GAClBA,IAAK/H,EAAG,IAAI8H,GAAIC,CAAE,GAClBD,IAAK9H,EAAG,IAAImI,GAAIL,CAAE,GAClBE,IAAKhI,EAAG,IAAI6H,GAAIG,CAAE,GAClB5H,IAAKJ,EAAG,IAAI/I,GAAGmJ,CAAE,GACjB+H,IAAKnI,EAAG,IAAIiI,GAAI7H,CAAE,GAClB+H,IAAKnI,EAAG,IAAI/I,GAAGkR,CAAE,GACjBA,IAAKnI,EAAG,IAAImI,GAAIH,CAAE,GAClBA,IAAKhI,EAAG,IAAIiI,GAAIA,CAAE,GAClBA,IAAKjI,EAAG,IAAIgI,GAAIC,CAAE,GAClBA,IAAKjI,EAAG,IAAIiI,GAAI7H,CAAE,GAClB6H,IAAKjI,EAAG,IAAIiI,GAAIE,CAAE,GAClBJ,IAAK/H,EAAG,IAAI+H,GAAIE,CAAE,GAClB7H,IAAKJ,EAAG,IAAIsH,GAAIC,CAAE,GAClBnH,IAAKJ,EAAG,IAAII,GAAIA,CAAE,GAClB6H,IAAKjI,EAAG,IAAII,GAAI+H,CAAE,GAClBL,IAAK9H,EAAG,IAAI8H,GAAIG,CAAE,GAClBD,IAAKhI,EAAG,IAAII,GAAI8H,CAAE,GAClBF,IAAKhI,EAAG,IAAIgI,GAAIA,CAAE,GAClBA,IAAKhI,EAAG,IAAIgI,GAAIA,CAAE,GACX,IAAIrB,EAAMmB,GAAIC,GAAIC,CAAE;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAItB,GAAO;AACP,MAAAD,EAAeC,CAAK;AACpB,YAAM,EAAE,IAAIW,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAG,MAC7B,EAAE,IAAIC,GAAI,IAAIC,GAAI,IAAIC,EAAI,IAAGhB;AACnC,UAAIoB,IAAK9H,EAAG,MAAM+H,IAAK/H,EAAG,MAAMgI,IAAKhI,EAAG;AACxC,YAAM/I,IAAIuO,EAAM,GACVqC,IAAK7H,EAAG,IAAIwF,EAAM,GAAG9G,EAAG;AAC9B,UAAIuJ,IAAKjI,EAAG,IAAIqH,GAAIG,CAAE,GAClBU,IAAKlI,EAAG,IAAIsH,GAAIG,CAAE,GAClBrH,IAAKJ,EAAG,IAAIuH,GAAIG,CAAE,GAClBS,IAAKnI,EAAG,IAAIqH,GAAIC,CAAE,GAClBc,IAAKpI,EAAG,IAAIwH,GAAIC,CAAE;AACtB,MAAAU,IAAKnI,EAAG,IAAImI,GAAIC,CAAE,GAClBA,IAAKpI,EAAG,IAAIiI,GAAIC,CAAE,GAClBC,IAAKnI,EAAG,IAAImI,GAAIC,CAAE,GAClBA,IAAKpI,EAAG,IAAIqH,GAAIE,CAAE;AAClB,UAAIc,IAAKrI,EAAG,IAAIwH,GAAIE,CAAE;AACtB,aAAAU,IAAKpI,EAAG,IAAIoI,GAAIC,CAAE,GAClBA,IAAKrI,EAAG,IAAIiI,GAAI7H,CAAE,GAClBgI,IAAKpI,EAAG,IAAIoI,GAAIC,CAAE,GAClBA,IAAKrI,EAAG,IAAIsH,GAAIC,CAAE,GAClBO,IAAK9H,EAAG,IAAIyH,GAAIC,CAAE,GAClBW,IAAKrI,EAAG,IAAIqI,GAAIP,CAAE,GAClBA,IAAK9H,EAAG,IAAIkI,GAAI9H,CAAE,GAClBiI,IAAKrI,EAAG,IAAIqI,GAAIP,CAAE,GAClBE,IAAKhI,EAAG,IAAI/I,GAAGmR,CAAE,GACjBN,IAAK9H,EAAG,IAAI6H,GAAIzH,CAAE,GAClB4H,IAAKhI,EAAG,IAAI8H,GAAIE,CAAE,GAClBF,IAAK9H,EAAG,IAAIkI,GAAIF,CAAE,GAClBA,IAAKhI,EAAG,IAAIkI,GAAIF,CAAE,GAClBD,IAAK/H,EAAG,IAAI8H,GAAIE,CAAE,GAClBE,IAAKlI,EAAG,IAAIiI,GAAIA,CAAE,GAClBC,IAAKlI,EAAG,IAAIkI,GAAID,CAAE,GAClB7H,IAAKJ,EAAG,IAAI/I,GAAGmJ,CAAE,GACjBgI,IAAKpI,EAAG,IAAI6H,GAAIO,CAAE,GAClBF,IAAKlI,EAAG,IAAIkI,GAAI9H,CAAE,GAClBA,IAAKJ,EAAG,IAAIiI,GAAI7H,CAAE,GAClBA,IAAKJ,EAAG,IAAI/I,GAAGmJ,CAAE,GACjBgI,IAAKpI,EAAG,IAAIoI,GAAIhI,CAAE,GAClB6H,IAAKjI,EAAG,IAAIkI,GAAIE,CAAE,GAClBL,IAAK/H,EAAG,IAAI+H,GAAIE,CAAE,GAClBA,IAAKjI,EAAG,IAAIqI,GAAID,CAAE,GAClBN,IAAK9H,EAAG,IAAImI,GAAIL,CAAE,GAClBA,IAAK9H,EAAG,IAAI8H,GAAIG,CAAE,GAClBA,IAAKjI,EAAG,IAAImI,GAAID,CAAE,GAClBF,IAAKhI,EAAG,IAAIqI,GAAIL,CAAE,GAClBA,IAAKhI,EAAG,IAAIgI,GAAIC,CAAE,GACX,IAAItB,EAAMmB,GAAIC,GAAIC,CAAE;AAAA,IAC9B;AAAA,IACD,SAAStB,GAAO;AACZ,aAAO,KAAK,IAAIA,EAAM,OAAQ,CAAA;AAAA,IACjC;AAAA,IACD,MAAM;AACF,aAAO,KAAK,OAAOC,EAAM,IAAI;AAAA,IAChC;AAAA,IACD,KAAKpZ,GAAG;AACJ,aAAO+a,EAAK,WAAW,MAAM/a,GAAGoZ,EAAM,UAAU;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,eAAemsC,GAAI;AACfH,MAAAA,GAAY,UAAUG,GAAIv3C,IAAKiK,EAAM,CAAC;AACtC,YAAM+C,IAAI5B,EAAM;AAChB,UAAImsC,MAAOv3C;AACP,eAAOgN;AACX,UAAIuqC,MAAOt3C;AACP,eAAO;AACX,YAAM,EAAE,MAAAkJ,EAAM,IAAGc;AACjB,UAAI,CAACd;AACD,eAAO4D,EAAK,aAAa,MAAMwqC,CAAE;AAErC,UAAI,EAAE,OAAAtqC,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE,IAAKjE,EAAK,YAAYouC,CAAE,GAC9ClqC,IAAML,GACNM,IAAMN,GACNrH,IAAI;AACR,aAAOuH,IAAKlN,MAAOoN,IAAKpN;AACpB,QAAIkN,IAAKjN,OACLoN,IAAMA,EAAI,IAAI1H,CAAC,IACfyH,IAAKnN,OACLqN,IAAMA,EAAI,IAAI3H,CAAC,IACnBA,IAAIA,EAAE,UACNuH,MAAOjN,IACPmN,MAAOnN;AAEX,aAAIgN,MACAI,IAAMA,EAAI,WACVF,MACAG,IAAMA,EAAI,WACdA,IAAM,IAAIlC,EAAM3G,EAAG,IAAI6I,EAAI,IAAInE,EAAK,IAAI,GAAGmE,EAAI,IAAIA,EAAI,EAAE,GAClDD,EAAI,IAAIC,CAAG;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,SAASC,GAAQ;AACb,YAAM,EAAE,MAAApE,GAAM,GAAG+tC,EAAC,IAAKjtC;AACvBmtC,MAAAA,GAAY,UAAU7pC,GAAQtN,IAAKi3C,CAAC;AACpC,UAAIhtC,GAAOsD;AACX,UAAIrE,GAAM;AACN,cAAM,EAAE,OAAA8D,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE,IAAKjE,EAAK,YAAYoE,CAAM;AACxD,YAAI,EAAE,GAAGF,GAAK,GAAGI,EAAG,IAAK,KAAK,KAAKP,CAAE,GACjC,EAAE,GAAGI,GAAK,GAAGI,EAAG,IAAK,KAAK,KAAKN,CAAE;AACrC,QAAAC,IAAMN,EAAK,gBAAgBE,GAAOI,CAAG,GACrCC,IAAMP,EAAK,gBAAgBI,GAAOG,CAAG,GACrCA,IAAM,IAAIlC,EAAM3G,EAAG,IAAI6I,EAAI,IAAInE,EAAK,IAAI,GAAGmE,EAAI,IAAIA,EAAI,EAAE,GACzDpD,IAAQmD,EAAI,IAAIC,CAAG,GACnBE,IAAOC,EAAI,IAAIC,CAAG;AAAA,MACrB,OACI;AACD,cAAM,EAAE,GAAA9W,GAAG,GAAA8O,EAAC,IAAK,KAAK,KAAK6H,CAAM;AACjC,QAAArD,IAAQtT,GACR4W,IAAO9H;AAAA,MACV;AAED,aAAO0F,EAAM,WAAW,CAAClB,GAAOsD,CAAI,CAAC,EAAE,CAAC;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,qBAAqBnJ,GAAG3I,GAAGhB,GAAG;AAC1B,YAAM0E,IAAIgM,EAAM,MACVuC,IAAM,CAACxJ,GAAGzI,MACVA,MAAMsE,MAAOtE,MAAMuE,MAAO,CAACkE,EAAE,OAAO/E,CAAC,IAAI+E,EAAE,eAAezI,CAAC,IAAIyI,EAAE,SAASzI,CAAC,GAC3Ea,IAAMoR,EAAI,MAAMjS,CAAC,EAAE,IAAIiS,EAAItJ,GAAG3J,CAAC,CAAC;AACtC,aAAO6B,EAAI,QAAQ,SAAYA;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAID,SAASqR,GAAI;AACT,aAAOypC,EAAa,MAAMzpC,CAAE;AAAA,IAC/B;AAAA,IACD,gBAAgB;AACZ,YAAM,EAAE,GAAGK,GAAU,eAAAC,EAAa,IAAKjE;AACvC,UAAIgE,MAAahO;AACb,eAAO;AACX,UAAIiO;AACA,eAAOA,EAAc9C,GAAO,IAAI;AACpC,YAAM,IAAI,MAAM,8DAA8D;AAAA,IACjF;AAAA,IACD,gBAAgB;AACZ,YAAM,EAAE,GAAG6C,GAAU,eAAAE,EAAa,IAAKlE;AACvC,aAAIgE,MAAahO,KACN,OACPkO,IACOA,EAAc/C,GAAO,IAAI,IAC7B,KAAK,eAAenB,EAAM,CAAC;AAAA,IACrC;AAAA,IACD,WAAWmE,IAAe,IAAM;AAC5B,aAAAwS,GAAM,gBAAgBxS,CAAY,GAClC,KAAK,eAAc,GACZlS,EAAQkP,GAAO,MAAMgD,CAAY;AAAA,IAC3C;AAAA,IACD,MAAMA,IAAe,IAAM;AACvB,aAAAwS,GAAM,gBAAgBxS,CAAY,GAC3BtD,GAAc,KAAK,WAAWsD,CAAY,CAAC;AAAA,IACrD;AAAA,EACJ;AACD,EAAAhD,EAAM,OAAO,IAAIA,EAAMnB,EAAM,IAAIA,EAAM,IAAIxF,EAAG,GAAG,GACjD2G,EAAM,OAAO,IAAIA,EAAM3G,EAAG,MAAMA,EAAG,KAAKA,EAAG,IAAI;AAC/C,QAAM4J,IAAQpE,EAAM,YACd8C,IAAOzF,GAAK8D,GAAOnB,EAAM,OAAO,KAAK,KAAKoE,IAAQ,CAAC,IAAIA,CAAK;AAElE,SAAO;AAAA,IACH,OAAApE;AAAA,IACA,iBAAiBmB;AAAA,IACjB,wBAAAR;AAAA,IACA,qBAAAL;AAAA,IACA,oBAAAG;AAAA,EACR;AACA;AACA,SAAS4D,GAAatF,GAAO;AACzB,QAAMzD,IAAOwD,GAAcC,CAAK;AAChCE,SAAAA,GAAkB3D,GAAM;AAAA,IACpB,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,EACrB,GAAO;AAAA,IACC,UAAU;AAAA,IACV,eAAe;AAAA,IACf,MAAM;AAAA,EACd,CAAK,GACM,OAAO,OAAO,EAAE,MAAM,IAAM,GAAGA,EAAI,CAAE;AAChD;AAQO,SAASgJ,GAAYC,GAAU;AAClC,QAAMvE,IAAQqE,GAAaE,CAAQ,GAC7B,EAAE,IAAA/J,GAAI,GAAGgK,EAAW,IAAKxE,GACzByE,IAAgBjK,EAAG,QAAQ,GAC3BkK,IAAkB,IAAIlK,EAAG,QAAQ;AACvC,WAASoK,EAAKnT,GAAG;AACb,WAAOsP,GAAQtP,GAAG+S,CAAW;AAAA,EAChC;AACD,WAASK,EAAKpT,GAAG;AACb,WAAOqT,GAAWrT,GAAG+S,CAAW;AAAA,EACnC;AACD,QAAM,EAAE,iBAAiBrD,GAAO,wBAAAR,GAAwB,qBAAAL,GAAqB,oBAAAG,EAAqB,IAAGV,GAAkB;AAAA,IACnH,GAAGC;AAAA,IACH,QAAQpS,GAAIqS,GAAOkE,GAAc;AAC7B,YAAM1S,IAAIwO,EAAM,YACVrG,IAAIY,EAAG,QAAQ/I,EAAE,CAAC,GAClBsT,IAAM5E;AAEZ,aADAwW,GAAM,gBAAgBxS,CAAY,GAC9BA,IACOY,EAAI,WAAW,KAAK,CAAC9E,EAAM,SAAU,IAAG,IAAO,CAAI,CAAC,GAAGrG,CAAC,IAGxDmL,EAAI,WAAW,KAAK,CAAC,CAAI,CAAC,GAAGnL,GAAGY,EAAG,QAAQ/I,EAAE,CAAC,CAAC;AAAA,IAE7D;AAAA,IACD,UAAUX,GAAO;AACb,YAAM8C,IAAM9C,EAAM,QACZtB,IAAOsB,EAAM,CAAC,GACduP,IAAOvP,EAAM,SAAS,CAAC;AAE7B,UAAI8C,MAAQ6Q,MAAkBjV,MAAS,KAAQA,MAAS,IAAO;AAC3D,cAAMoK,IAAIkH,GAAmBT,CAAI;AACjC,YAAI,CAAC2sC,GAAWpzC,GAAG5D,IAAKwE,EAAG,KAAK;AAC5B,gBAAM,IAAI,MAAM,uBAAuB;AAC3C,cAAMwK,IAAK1E,EAAoB1G,CAAC;AAChC,YAAI8H;AACJ,YAAI;AACA,UAAAA,IAAIlH,EAAG,KAAKwK,CAAE;AAAA,QACjB,SACMuoC,IAAW;AACd,gBAAM3hB,KAAS2hB,cAAqB,QAAQ,OAAOA,GAAU,UAAU;AACvE,gBAAM,IAAI,MAAM,0BAA0B3hB,EAAM;AAAA,QACnD;AACD,cAAM3mB,KAAUvD,IAAI1L,QAASA;AAG7B,gBADmBxG,IAAO,OAAO,MACfyV,MACdvD,IAAIlH,EAAG,IAAIkH,CAAC,IACT,EAAE,GAAA9H,GAAG,GAAA8H;MACf,WACQ9N,MAAQ8Q,KAAmBlV,MAAS,GAAM;AAC/C,cAAMoK,IAAIY,EAAG,UAAU6F,EAAK,SAAS,GAAG7F,EAAG,KAAK,CAAC,GAC3CkH,IAAIlH,EAAG,UAAU6F,EAAK,SAAS7F,EAAG,OAAO,IAAIA,EAAG,KAAK,CAAC;AAC5D,eAAO,EAAE,GAAAZ,GAAG,GAAA8H;MACf;AAEG,cAAM,IAAI,MAAM,mBAAmB9N,CAAG,0BAA0B6Q,CAAa,wBAAwBC,CAAe,qBAAqB;AAAA,IAEhJ;AAAA,EACT,CAAK,GACKQ,IAAgB,CAAC5O,MAAQuK,GAAcsE,GAAmB7O,GAAK0J,EAAM,WAAW,CAAC;AACvF,WAASoF,EAAsBvU,GAAQ;AACnC,UAAMwU,IAAOb,KAAexO;AAC5B,WAAOnF,IAASwU;AAAA,EACnB;AACD,WAASC,EAAWxd,GAAG;AACnB,WAAOsd,EAAsBtd,CAAC,IAAI8c,EAAK,CAAC9c,CAAC,IAAIA;AAAA,EAChD;AAED,QAAMyd,IAAS,CAAC9U,GAAG+U,GAAMrR,MAAO2M,GAAmBrQ,EAAE,MAAM+U,GAAMrR,CAAE,CAAC;AAAA,EAIpE,MAAMsR,EAAU;AAAA,IACZ,YAAYpT,GAAGvK,GAAG4d,GAAU;AACxB,WAAK,IAAIrT,GACT,KAAK,IAAIvK,GACT,KAAK,WAAW4d,GAChB,KAAK,eAAc;AAAA,IACtB;AAAA;AAAA,IAED,OAAO,YAAYtP,GAAK;AACpB,YAAMmJ,IAAIS,EAAM;AAChB,aAAA5J,IAAMc,GAAY,oBAAoBd,GAAKmJ,IAAI,CAAC,GACzC,IAAIkG,EAAUF,EAAOnP,GAAK,GAAGmJ,CAAC,GAAGgG,EAAOnP,GAAKmJ,GAAG,IAAIA,CAAC,CAAC;AAAA,IAChE;AAAA;AAAA;AAAA,IAGD,OAAO,QAAQnJ,GAAK;AAChB,YAAM,EAAE,GAAA/D,GAAG,GAAAvK,EAAC,IAAKwX,GAAI,MAAMpI,GAAY,OAAOd,CAAG,CAAC;AAClD,aAAO,IAAIqP,EAAUpT,GAAGvK,CAAC;AAAA,IAC5B;AAAA,IACD,iBAAiB;AACbqlD,MAAAA,GAAY,KAAK,KAAK,GAAGn3C,IAAKwO,CAAW,GACzC2oC,GAAY,KAAK,KAAK,GAAGn3C,IAAKwO,CAAW;AAAA,IAC5C;AAAA,IACD,eAAekB,GAAU;AACrB,aAAO,IAAID,EAAU,KAAK,GAAG,KAAK,GAAGC,CAAQ;AAAA,IAChD;AAAA,IACD,iBAAiBC,GAAS;AACtB,YAAM,EAAE,GAAAtT,GAAG,GAAAvK,GAAG,UAAU8d,EAAG,IAAK,MAC1BtS,IAAIuS,EAAc3O,GAAY,WAAWyO,CAAO,CAAC;AACvD,UAAIC,KAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAASA,CAAG;AACzC,cAAM,IAAI,MAAM,qBAAqB;AACzC,YAAME,IAAOF,MAAQ,KAAKA,MAAQ,IAAIvT,IAAI2N,EAAM,IAAI3N;AACpD,UAAIyT,KAAQtL,EAAG;AACX,cAAM,IAAI,MAAM,4BAA4B;AAChD,YAAMuL,IAAUH,IAAM,IAAkB,OAAP,MAC3BI,KAAI7E,EAAM,QAAQ4E,IAASb,EAAcY,CAAI,CAAC,GAC9CG,KAAKpB,EAAKiB,CAAI,GACdI,KAAKtB,EAAK,CAACtR,IAAI2S,EAAE,GACjBE,KAAKvB,EAAK9c,IAAIme,EAAE,GAChB7L,KAAI+G,EAAM,KAAK,qBAAqB6E,IAAGE,IAAIC,EAAE;AACnD,UAAI,CAAC/L;AACD,cAAM,IAAI,MAAM,mBAAmB;AACvC,aAAAA,GAAE,eAAc,GACTA;AAAA,IACV;AAAA;AAAA,IAED,WAAW;AACP,aAAOgL,EAAsB,KAAK,CAAC;AAAA,IACtC;AAAA,IACD,aAAa;AACT,aAAO,KAAK,SAAQ,IAAK,IAAIK,EAAU,KAAK,GAAGb,EAAK,CAAC,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI;AAAA,IAClF;AAAA;AAAA,IAED,gBAAgB;AACZ,aAAOwB,GAAc,KAAK,SAAQ,CAAE;AAAA,IACvC;AAAA,IACD,WAAW;AACP,aAAO9G,GAAI,WAAW,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAC,CAAE;AAAA,IACjD;AAAA;AAAA,IAED,oBAAoB;AAChB,aAAO8G,GAAc,KAAK,aAAY,CAAE;AAAA,IAC3C;AAAA,IACD,eAAe;AACX,aAAOlB,EAAc,KAAK,CAAC,IAAIA,EAAc,KAAK,CAAC;AAAA,IACtD;AAAA,EACJ;AACD,QAAMmB,IAAQ;AAAA,IACV,kBAAkB5E,GAAY;AAC1B,UAAI;AACA,eAAAd,EAAuBc,CAAU,GAC1B;AAAA,MACV,QACa;AACV,eAAO;AAAA,MACV;AAAA,IACJ;AAAA,IACD,wBAAwBd;AAAA;AAAA;AAAA;AAAA;AAAA,IAKxB,kBAAkB,MAAM;AACpB,YAAMvM,IAASkS,GAAqBtG,EAAM,CAAC;AAC3C,aAAOuG,GAAmBvG,EAAM,YAAY5L,CAAM,GAAG4L,EAAM,CAAC;AAAA,IAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,WAAWnC,IAAa,GAAGoC,IAAQkB,EAAM,MAAM;AAC3C,aAAAlB,EAAM,eAAepC,CAAU,GAC/BoC,EAAM,SAAS,OAAO,CAAC,CAAC,GACjBA;AAAA,IACV;AAAA,EACT;AAOI,WAASuG,EAAa/E,GAAY0C,IAAe,IAAM;AACnD,WAAOhD,EAAM,eAAeM,CAAU,EAAE,WAAW0C,CAAY;AAAA,EAClE;AAID,WAASsC,EAAUhJ,GAAM;AACrB,UAAMhQ,IAAMy/C,GAAWzvC,CAAI,GACrBzL,IAAM,OAAOyL,KAAS,UACtB7J,KAAOnG,KAAOuE,MAAQyL,EAAK;AACjC,WAAIhQ,IACOmG,MAAQ6Q,KAAiB7Q,MAAQ8Q,IACxC1S,IACO4B,MAAQ,IAAI6Q,KAAiB7Q,MAAQ,IAAI8Q,IAChDjH,aAAgB0D;AAAA,EAGvB;AAWD,WAASuF,EAAgBC,GAAUC,GAASzC,IAAe,IAAM;AAC7D,QAAIsC,EAAUE,CAAQ;AAClB,YAAM,IAAI,MAAM,+BAA+B;AACnD,QAAI,CAACF,EAAUG,CAAO;AAClB,YAAM,IAAI,MAAM,+BAA+B;AAEnD,WADUzF,EAAM,QAAQyF,CAAO,EACtB,SAASjG,EAAuBgG,CAAQ,CAAC,EAAE,WAAWxC,CAAY;AAAA,EAC9E;AAKD,QAAM0C,IAAW7G,EAAM,YACnB,SAAUlP,GAAO;AAGb,UAAMwF,IAAMwK,GAAmBhQ,CAAK,GAC9BgW,IAAQhW,EAAM,SAAS,IAAIkP,EAAM;AACvC,WAAO8G,IAAQ,IAAIxQ,KAAO,OAAOwQ,CAAK,IAAIxQ;AAAA,EACtD,GACUuP,IAAgB7F,EAAM,iBACxB,SAAUlP,GAAO;AACb,WAAO8T,EAAKiC,EAAS/V,CAAK,CAAC;AAAA,EACvC,GAEUiW,IAAaC,GAAWhH,EAAM,UAAU;AAI9C,WAASiH,EAAW3Q,GAAK;AACrB62C,WAAAA,GAAY,WAAWntC,EAAM,UAAU,IAAI1J,GAAKP,IAAKgR,CAAU,GAExD5B,GAAmB7O,GAAK0J,EAAM,WAAW;AAAA,EACnD;AAMD,WAASkH,EAAQvB,GAASlE,GAAYnG,IAAO6L,GAAgB;AACzD,QAAI,CAAC,aAAa,WAAW,EAAE,KAAK,CAACva,OAAMA,MAAK0O,CAAI;AAChD,YAAM,IAAI,MAAM,qCAAqC;AACzD,UAAM,EAAE,MAAAtK,GAAM,aAAA6B,EAAa,IAAGmN;AAC9B,QAAI,EAAE,MAAAoH,GAAM,SAAAC,GAAS,cAAcC,EAAG,IAAKhM;AAC3C,IAAI8L,KAAQ,SACRA,IAAO,KACXzB,IAAUzO,GAAY,WAAWyO,CAAO,GACxCqmC,GAAmB1wC,CAAI,GACnB+L,MACA1B,IAAUzO,GAAY,qBAAqBlG,EAAK2U,CAAO,CAAC;AAI5D,UAAM4B,KAAQ1B,EAAcF,CAAO,GAC7BjK,KAAIiF,EAAuBc,CAAU,GACrC+F,KAAW,CAACP,EAAWvL,EAAC,GAAGuL,EAAWM,EAAK,CAAC;AAElD,QAAID,KAAO,QAAQA,MAAQ,IAAO;AAE9B,YAAMjQ,KAAIiQ,MAAQ,KAAOzU,EAAY2H,EAAG,KAAK,IAAI8M;AACjD,MAAAE,GAAS,KAAKtQ,GAAY,gBAAgBG,EAAC,CAAC;AAAA,IAC/C;AACD,UAAMgB,KAAO8H,GAAe,GAAGqH,EAAQ,GACjCxN,KAAIuN;AAEV,aAASE,GAAMC,IAAQ;AAEnB,YAAM9a,KAAIia,EAASa,EAAM;AACzB,UAAI,CAACjH,EAAmB7T,EAAC;AACrB;AACJ,YAAM+a,KAAK9C,EAAKjY,EAAC,GACXmN,KAAIoH,EAAM,KAAK,SAASvU,EAAC,EAAE,YAC3ByF,KAAIuS,EAAK7K,GAAE,CAAC;AAClB,UAAI1H,OAAM0D;AACN;AAIJ,YAAMjO,KAAI8c,EAAK+C,KAAK/C,EAAK5K,KAAI3H,KAAIqJ,EAAC,CAAC;AACnC,UAAI5T,OAAMiO;AACN;AACJ,UAAI2P,MAAY3L,GAAE,MAAM1H,KAAI,IAAI,KAAK,OAAO0H,GAAE,IAAI/D,EAAG,GACjD4R,KAAQ9f;AACZ,aAAIsf,KAAQhC,EAAsBtd,EAAC,MAC/B8f,KAAQtC,EAAWxd,EAAC,GACpB4d,MAAY,IAET,IAAID,EAAUpT,IAAGuV,IAAOlC,EAAQ;AAAA,IAC1C;AACD,WAAO,EAAE,MAAArN,IAAM,OAAAoP;EAClB;AACD,QAAMN,IAAiB,EAAE,MAAMnH,EAAM,MAAM,SAAS,MAC9C6H,IAAiB,EAAE,MAAM7H,EAAM,MAAM,SAAS;AAcpD,WAAS8H,EAAKnC,GAASoC,GAASzM,IAAO6L,GAAgB;AACnD,UAAM,EAAE,MAAA9O,GAAM,OAAAoP,EAAO,IAAGP,EAAQvB,GAASoC,GAASzM,CAAI,GAChDvG,IAAIiL;AAEV,WADagI,GAAkBjT,EAAE,KAAK,WAAWA,EAAE,aAAaA,EAAE,IAAI,EAC1DsD,GAAMoP,CAAK;AAAA,EAC1B;AAED,EAAAtG,EAAM,KAAK,eAAe,CAAC;AAe3B,WAAS8G,EAAOC,GAAWvC,GAASwC,GAAW7M,IAAOuM,GAAgB;A5Cx7B1E,QAAAjhB;A4Cy7BQ,UAAMwhB,IAAKF;AAGX,QAFAvC,IAAUzO,GAAY,WAAWyO,CAAO,GACxCwC,IAAYjR,GAAY,aAAaiR,CAAS,GAC1C,YAAY7M;AACZ,YAAM,IAAI,MAAM,oCAAoC;AACxD,IAAA0wC,GAAmB1wC,CAAI;AACvB,UAAM,EAAE,MAAA8L,GAAM,SAAAC,EAAS,IAAG/L;AAC1B,QAAI+M,GACAnO;AACJ,QAAI;AACA,UAAI,OAAOkO,KAAO,YAAY8kC,GAAW9kC,CAAE;AAGvC,YAAI;AACA,UAAAC,IAAO5C,EAAU,QAAQ2C,CAAE;AAAA,QAC9B,SACME,IAAU;AACb,cAAI,EAAEA,cAAoBhJ,GAAI;AAC1B,kBAAMgJ;AACV,UAAAD,IAAO5C,EAAU,YAAY2C,CAAE;AAAA,QAClC;AAAA,eAEI,OAAOA,KAAO,YAAY,OAAOA,EAAG,KAAM,YAAY,OAAOA,EAAG,KAAM,UAAU;AACrF,cAAM,EAAE,GAAA/V,IAAG,GAAAvK,GAAG,IAAGsgB;AACjB,QAAAC,IAAO,IAAI5C,EAAUpT,IAAGvK,EAAC;AAAA,MAC5B;AAEG,cAAM,IAAI,MAAM,OAAO;AAE3B,MAAAoS,KAAIiH,EAAM,QAAQgH,CAAS;AAAA,IAC9B,SACMI,IAAO;AACV,UAAIA,GAAM,YAAY;AAClB,cAAM,IAAI,MAAM,gEAAgE;AACpF,aAAO;AAAA,IACV;AACD,QAAInB,KAAQiB,EAAK,SAAU;AACvB,aAAO;AACX,IAAIhB,MACA1B,IAAU3F,EAAM,KAAK2F,CAAO;AAChC,UAAM,EAAE,GAAAtT,IAAG,GAAAvK,GAAG,IAAGugB,GACX/U,KAAIuS,EAAcF,CAAO,GACzB6C,KAAK3D,EAAK/c,EAAC,GACXoe,KAAKtB,EAAKtR,KAAIkV,EAAE,GAChBrC,KAAKvB,EAAKvS,KAAImW,EAAE,GAChBxC,MAAIpf,KAAAua,EAAM,KAAK,qBAAqBjH,IAAGgM,IAAIC,EAAE,MAAzC,gBAAAvf,GAA4C;AACtD,WAAKof,KAEKpB,EAAKoB,GAAE,CAAC,MACL3T,KAFF;AAAA,EAGd;AACD,SAAO;AAAA,IACH,OAAA2N;AAAA,IACA,cAAAwG;AAAA,IACA,iBAAAE;AAAA,IACA,MAAAoB;AAAA,IACA,QAAAG;AAAA,IACA,iBAAiB9G;AAAA,IACjB,WAAAsE;AAAA,IACA,OAAAY;AAAA,EACR;AACA;ACt/BA;AAKO,SAAS8C,GAAQnY,GAAM;AAC1B,SAAO;AAAA,IACH,MAAAA;AAAA,IACA,MAAM,CAACjE,MAAQqc,MAASJ,GAAKhY,GAAMjE,GAAKoF,GAAY,GAAGiX,CAAI,CAAC;AAAA,IAC5D,aAAAvW;AAAA,EACR;AACA;AACO,SAASwW,GAAY9E,GAAU+E,GAAS;AAC3C,QAAMC,IAAS,CAACvY,MAASsT,GAAY,EAAE,GAAGC,GAAU,GAAG4E,GAAQnY,CAAI,EAAC,CAAE;AACtE,SAAO,OAAO,OAAO,EAAE,GAAGuY,EAAOD,CAAO,GAAG,QAAAC,EAAM,CAAE;AACvD;ACfA;AAQA,MAAMC,KAAa,OAAO,oEAAoE,GACxFC,KAAa,OAAO,oEAAoE,GACxFzT,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC,GACdyT,KAAa,CAACjY,GAAGhB,OAAOgB,IAAIhB,IAAIwF,MAAOxF;AAK7C,SAASkZ,GAAQjI,GAAG;AAChB,QAAMxH,IAAIsP,IAEJtQ,IAAM,OAAO,CAAC,GAAG0Q,IAAM,OAAO,CAAC,GAAGC,IAAO,OAAO,EAAE,GAAGC,IAAO,OAAO,EAAE,GAErEC,IAAO,OAAO,EAAE,GAAGC,IAAO,OAAO,EAAE,GAAGC,IAAO,OAAO,EAAE,GACtDzS,IAAMkK,IAAIA,IAAIA,IAAKxH,GACnBmI,IAAM7K,IAAKA,IAAKkK,IAAKxH,GACrBgQ,IAAMvQ,GAAK0I,GAAInJ,GAAKgB,CAAC,IAAImI,IAAMnI,GAC/BiQ,IAAMxQ,GAAKuQ,GAAIhR,GAAKgB,CAAC,IAAImI,IAAMnI,GAC/BkQ,IAAOzQ,GAAKwQ,GAAIlU,IAAKiE,CAAC,IAAI1C,IAAM0C,GAChCmQ,IAAO1Q,GAAKyQ,GAAKP,GAAM3P,CAAC,IAAIkQ,IAAOlQ,GACnCoQ,IAAO3Q,GAAK0Q,GAAKP,GAAM5P,CAAC,IAAImQ,IAAOnQ,GACnCqQ,IAAO5Q,GAAK2Q,GAAKN,GAAM9P,CAAC,IAAIoQ,IAAOpQ,GACnCsQ,IAAQ7Q,GAAK4Q,GAAKN,GAAM/P,CAAC,IAAIqQ,IAAOrQ,GACpCuQ,IAAQ9Q,GAAK6Q,GAAMR,GAAM9P,CAAC,IAAIoQ,IAAOpQ,GACrCwQ,IAAQ/Q,GAAK8Q,GAAMvR,GAAKgB,CAAC,IAAImI,IAAMnI,GACnCwI,IAAM/I,GAAK+Q,GAAMX,GAAM7P,CAAC,IAAImQ,IAAOnQ,GACnCU,IAAMjB,GAAK+I,GAAIkH,GAAK1P,CAAC,IAAI1C,IAAM0C,GAC/BO,IAAOd,GAAKiB,GAAI3E,IAAKiE,CAAC;AAC5B,MAAI,CAACM,GAAG,IAAIA,GAAG,IAAIC,CAAI,GAAGiH,CAAC;AACvB,UAAM,IAAI,MAAM,yBAAyB;AAC7C,SAAOjH;AACX;AACA,MAAMD,KAAK4B,GAAMoN,IAAY,QAAW,QAAW,EAAE,MAAMG,GAAO,CAAE,GAIvDgB,KAAYtB,GAAY;AAAA,EACjC,GAAG,OAAO,CAAC;AAAA;AAAA,EACX,GAAG,OAAO,CAAC;AAAA;AAAA,EACX,IAAA7O;AAAA;AAAA,EACA,GAAGiP;AAAA;AAAA;AAAA,EAEH,IAAI,OAAO,+EAA+E;AAAA,EAC1F,IAAI,OAAO,+EAA+E;AAAA,EAC1F,GAAG,OAAO,CAAC;AAAA;AAAA,EACX,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAON,MAAM;AAAA,IACF,MAAM,OAAO,oEAAoE;AAAA,IACjF,aAAa,CAAC7c,MAAM;AAChB,YAAM7E,IAAI0hB,IACJmB,IAAK,OAAO,oCAAoC,GAChDrT,IAAK,CAACvB,KAAM,OAAO,oCAAoC,GACvD6U,IAAK,OAAO,qCAAqC,GACjDrT,IAAKoT,GACLE,IAAY,OAAO,qCAAqC,GACxD/P,IAAK2O,GAAWlS,IAAK5K,GAAG7E,CAAC,GACzBgjB,IAAKrB,GAAW,CAACnS,IAAK3K,GAAG7E,CAAC;AAChC,UAAIkb,IAAK3J,GAAI1M,IAAImO,IAAK6P,IAAKG,IAAKF,GAAI9iB,CAAC,GACjCob,IAAK7J,GAAI,CAACyB,IAAKxD,IAAKwT,IAAKvT,GAAIzP,CAAC;AAClC,YAAMib,IAAQC,IAAK6H,GACb5H,IAAQC,IAAK2H;AAKnB,UAJI9H,MACAC,IAAKlb,IAAIkb,IACTC,MACAC,IAAKpb,IAAIob,IACTF,IAAK6H,KAAa3H,IAAK2H;AACvB,cAAM,IAAI,MAAM,yCAAyCle,CAAC;AAE9D,aAAO,EAAE,OAAAoW,GAAO,IAAAC,GAAI,OAAAC,GAAO,IAAAC,EAAE;AAAA,IAChC;AAAA,EACJ;AACL,GAAGtN,EAAM;AAGG,OAAO,CAAC;AAiBN8U,GAAU;AC1GxB;AASA,SAASiG,GAAQnf,GAAG;AAChB,SAAQA,aAAa,cAChBA,KAAK,QAAQ,OAAOA,KAAM,YAAYA,EAAE,YAAY,SAAS;AACtE;AAAA;AAIA,SAASub,MAASf,GAAM;AACpB,QAAMuW,IAAK,CAAC/wB,MAAMA,GAEZwb,IAAO,CAACxb,GAAGhB,MAAM,CAAC/D,MAAM+E,EAAEhB,EAAE/D,CAAC,CAAC,GAE9BwgB,IAASjB,EAAK,IAAI,CAACrS,MAAMA,EAAE,MAAM,EAAE,YAAYqT,GAAMuV,CAAE,GAEvDrV,IAASlB,EAAK,IAAI,CAACrS,MAAMA,EAAE,MAAM,EAAE,OAAOqT,GAAMuV,CAAE;AACxD,SAAO,EAAE,QAAAtV,GAAQ,QAAAC;AACrB;AAAA;AAKA,SAASC,GAASA,GAAU;AACxB,SAAO;AAAA,IACH,QAAQ,CAACC,MAAW;AAChB,UAAI,CAAC,MAAM,QAAQA,CAAM,KAAMA,EAAO,UAAU,OAAOA,EAAO,CAAC,KAAM;AACjE,cAAM,IAAI,MAAM,qDAAqD;AACzE,aAAOA,EAAO,IAAI,CAACrgB,MAAM;AAErB,YAAIA,IAAI,KAAKA,KAAKogB,EAAS;AACvB,gBAAM,IAAI,MAAM,iCAAiCpgB,CAAC,eAAeogB,EAAS,MAAM,GAAG;AACvF,eAAOA,EAASpgB,CAAC;AAAA,MACjC,CAAa;AAAA,IACJ;AAAA,IACD,QAAQ,CAACsgB,MAAU;AACf,UAAI,CAAC,MAAM,QAAQA,CAAK,KAAMA,EAAM,UAAU,OAAOA,EAAM,CAAC,KAAM;AAC9D,cAAM,IAAI,MAAM,kDAAkD;AACtE,aAAOA,EAAM,IAAI,CAACC,MAAW;AACzB,YAAI,OAAOA,KAAW;AAClB,gBAAM,IAAI,MAAM,uCAAuCA,CAAM,EAAE;AACnE,cAAM1gB,IAAQugB,EAAS,QAAQG,CAAM;AACrC,YAAI1gB,MAAU;AACV,gBAAM,IAAI,MAAM,oBAAoB0gB,CAAM,eAAeH,CAAQ,EAAE;AACvE,eAAOvgB;AAAA,MACvB,CAAa;AAAA,IACJ;AAAA,EACT;AACA;AAAA;AAIA,SAAS2gB,GAAKC,IAAY,IAAI;AAC1B,MAAI,OAAOA,KAAc;AACrB,UAAM,IAAI,MAAM,iCAAiC;AACrD,SAAO;AAAA,IACH,QAAQ,CAACjI,MAAS;AACd,UAAI,CAAC,MAAM,QAAQA,CAAI,KAAMA,EAAK,UAAU,OAAOA,EAAK,CAAC,KAAM;AAC3D,cAAM,IAAI,MAAM,8CAA8C;AAClE,eAASxY,KAAKwY;AACV,YAAI,OAAOxY,KAAM;AACb,gBAAM,IAAI,MAAM,iCAAiCA,CAAC,EAAE;AAC5D,aAAOwY,EAAK,KAAKiI,CAAS;AAAA,IAC7B;AAAA,IACD,QAAQ,CAACtZ,MAAO;AACZ,UAAI,OAAOA,KAAO;AACd,cAAM,IAAI,MAAM,oCAAoC;AACxD,aAAOA,EAAG,MAAMsZ,CAAS;AAAA,IAC5B;AAAA,EACT;AACA;AAAA;AAiDA,SAASK,GAAa5b,GAAMsT,GAAMrR,GAAI;AAElC,MAAIqR,IAAO;AACP,UAAM,IAAI,MAAM,4BAA4BA,CAAI,8BAA8B;AAClF,MAAIrR,IAAK;AACL,UAAM,IAAI,MAAM,0BAA0BA,CAAE,8BAA8B;AAC9E,MAAI,CAAC,MAAM,QAAQjC,CAAI;AACnB,UAAM,IAAI,MAAM,oCAAoC;AACxD,MAAI,CAACA,EAAK;AACN,WAAO;AACX,MAAI2B,IAAM;AACV,QAAMvD,IAAM,CAAA,GACN+c,IAAS,MAAM,KAAKnb,CAAI;AAM9B,OALAmb,EAAO,QAAQ,CAAC3R,MAAM;AAElB,QAAIA,IAAI,KAAKA,KAAK8J;AACd,YAAM,IAAI,MAAM,kBAAkB9J,CAAC,EAAE;AAAA,EACjD,CAAK,OACY;AACT,QAAIqS,IAAQ,GACRC,IAAO;AACX,aAAShhB,IAAI6G,GAAK7G,IAAIqgB,EAAO,QAAQrgB,KAAK;AACtC,YAAMihB,IAAQZ,EAAOrgB,CAAC,GAChBkhB,IAAY1I,IAAOuI,IAAQE;AACjC,UAAI,CAAC,OAAO,cAAcC,CAAS,KAC9B1I,IAAOuI,IAASvI,MAASuI,KAC1BG,IAAYD,MAAUzI,IAAOuI;AAC7B,cAAM,IAAI,MAAM,8BAA8B;AAElD,MAAAA,IAAQG,IAAY/Z;AACpB,YAAMq5C,IAAU,KAAK,MAAMt/B,IAAY/Z,CAAE;AAEzC,UADAkZ,EAAOrgB,CAAC,IAAIwgD,GACR,CAAC,OAAO,cAAcA,CAAO,KAAKA,IAAUr5C,IAAK4Z,MAAUG;AAC3D,cAAM,IAAI,MAAM,8BAA8B;AAClD,UAAKF;AAEA,QAAKw/B,IAGNx/B,IAAO,KAFPna,IAAM7G;AAAA,UAFN;AAAA,IAKP;AAED,QADAsD,EAAI,KAAKyd,CAAK,GACVC;AACA;AAAA,EACP;AACD,WAAShhB,IAAI,GAAGA,IAAIkF,EAAK,SAAS,KAAKA,EAAKlF,CAAC,MAAM,GAAGA;AAClD,IAAAsD,EAAI,KAAK,CAAC;AACd,SAAOA,EAAI;AACf;AAAA;AA6CA,SAASge,GAAMhY,GAAK;AAEhB,SAAO;AAAA,IACH,QAAQ,CAACxF,MAAU;AACf,UAAI,CAAC8f,GAAQ9f,CAAK;AACd,cAAM,IAAI,MAAM,yCAAyC;AAC7D,aAAO,gBAAAgd,GAAa,MAAM,KAAKhd,CAAK,GAAG,KAAK,GAAGwF,CAAG;AAAA,IACrD;AAAA,IACD,QAAQ,CAAC+W,MAAW;AAChB,UAAI,CAAC,MAAM,QAAQA,CAAM,KAAMA,EAAO,UAAU,OAAOA,EAAO,CAAC,KAAM;AACjE,cAAM,IAAI,MAAM,+CAA+C;AACnE,aAAO,WAAW,KAAK,gBAAAS,GAAaT,GAAQ/W,GAAK,KAAK,CAAC,CAAC;AAAA,IAC3D;AAAA,EACT;AACA;AAAA;AAyCA,SAASm3C,GAAS75C,GAAKnN,GAAI;AAEvB,MAAI,OAAOA,KAAO;AACd,UAAM,IAAI,MAAM,gCAAgC;AACpD,SAAO;AAAA,IACH,OAAOyL,GAAM;AACT,UAAI,CAAC0e,GAAQ1e,CAAI;AACb,cAAM,IAAI,MAAM,6CAA6C;AACjE,YAAMu7C,IAAWhnD,EAAGyL,CAAI,EAAE,MAAM,GAAG0B,CAAG,GAChCtD,IAAM,IAAI,WAAW4B,EAAK,SAAS0B,CAAG;AAC5C,aAAAtD,EAAI,IAAI4B,CAAI,GACZ5B,EAAI,IAAIm9C,GAAUv7C,EAAK,MAAM,GACtB5B;AAAA,IACV;AAAA,IACD,OAAO4B,GAAM;AACT,UAAI,CAAC0e,GAAQ1e,CAAI;AACb,cAAM,IAAI,MAAM,6CAA6C;AACjE,YAAMk6B,IAAUl6B,EAAK,MAAM,GAAG,CAAC0B,CAAG,GAC5B85C,IAAcjnD,EAAG2lC,CAAO,EAAE,MAAM,GAAGx4B,CAAG,GACtC+5C,IAAcz7C,EAAK,MAAM,CAAC0B,CAAG;AACnC,eAAS5G,IAAI,GAAGA,IAAI4G,GAAK5G;AACrB,YAAI0gD,EAAY1gD,CAAC,MAAM2gD,EAAY3gD,CAAC;AAChC,gBAAM,IAAI,MAAM,kBAAkB;AAC1C,aAAOo/B;AAAA,IACV;AAAA,EACT;AACA;AAmBA,MAAMtd,KAAY,CAACC,MAAQ,gBAAA/B,GAAM,gBAAAsB,GAAM,EAAE,GAAG,gBAAAlB,GAAS2B,CAAG,GAAG,gBAAAvB,GAAK,EAAE,CAAC,GACtDwB,KAAyB,gBAAAF,GAAU,4DAA4D,GA+B/F8+B,KAAoB,CAAC/3C,MAAW,gBAAAmX,GAAM,gBAAAygC,GAAS,GAAG,CAACv7C,MAAS2D,EAAOA,EAAO3D,CAAI,CAAC,CAAC,GAAG8c,EAAM;AC/VtG;AAUA,MAAM7N,KAAQ0sC,GAAK,iBACbC,KAAcF,GAAkB/3C,EAAM;AAC5C,SAASk4C,GAAcj9C,GAAO;AAC1B,SAAO,OAAO,KAAKqF,GAAWrF,CAAK,CAAC,EAAE;AAC1C;AACA,SAASk9C,GAAc13C,GAAK;AACxB,SAAOE,GAAWF,EAAI,SAAS,EAAE,EAAE,SAAS,IAAI,GAAG,CAAC;AACxD;AACA,MAAM23C,KAAgBl8C,GAAY,cAAc,GAE1Cm8C,KAAmB,EAAE,SAAS,UAAY,QAAQ,SAAU,GACrDC,KAAkB,YACzBC,KAAU,CAACl8C,MAASs0C,GAAU3wC,GAAO3D,CAAI,CAAC,GAC1Cm8C,KAAU,CAACn8C,MAASR,GAAWQ,CAAI,EAAE,UAAU,GAAG,EAAK,GACvDo8C,KAAQ,CAAC,MAAM;AACjB,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK;AACnD,UAAM,IAAI,MAAM,kBAAkB,CAAC,mCAAmC;AAE1E,QAAM3lC,IAAM,IAAI,WAAW,CAAC;AAC5B,SAAAjX,GAAWiX,CAAG,EAAE,UAAU,GAAG,GAAG,EAAK,GAC9BA;AACX;AACO,MAAM4lC,GAAM;AAAA,EACf,IAAI,cAAc;AACd,QAAI,CAAC,KAAK;AACN,YAAM,IAAI,MAAM,mBAAmB;AAEvC,WAAOF,GAAQ,KAAK,OAAO;AAAA,EAC9B;AAAA,EACD,IAAI,aAAa;AACb,WAAO,KAAK;AAAA,EACf;AAAA,EACD,IAAI,aAAa;AACb,WAAO,KAAK;AAAA,EACf;AAAA,EACD,IAAI,aAAa;AACb,WAAO,KAAK,gBAAgB;AAAA,EAC/B;AAAA,EACD,IAAI,YAAY;AACZ,WAAO,KAAK,UAAU;AAAA,EACzB;AAAA,EACD,IAAI,qBAAqB;AACrB,UAAMziC,IAAO,KAAK;AAClB,QAAI,CAACA;AACD,YAAM,IAAI,MAAM,gBAAgB;AAEpC,WAAOkiC,GAAY,OAAO,KAAK,UAAU,KAAK,SAAS,SAAS37C,GAAY,IAAI,WAAW,CAAC,CAAC,CAAC,GAAGyZ,CAAI,CAAC,CAAC;AAAA,EAC1G;AAAA,EACD,IAAI,oBAAoB;AACpB,QAAI,CAAC,KAAK;AACN,YAAM,IAAI,MAAM,eAAe;AAEnC,WAAOkiC,GAAY,OAAO,KAAK,UAAU,KAAK,SAAS,QAAQ,KAAK,MAAM,CAAC;AAAA,EAC9E;AAAA,EACD,OAAO,eAAez1C,GAAMm2C,IAAWN,IAAkB;AAErD,QADArlC,GAAYxQ,CAAI,GACZ,IAAIA,EAAK,SAAS,OAAO,IAAIA,EAAK,SAAS;AAC3C,YAAM,IAAI,MAAM,4BAA4BA,EAAK,MAAM,4DAA4D;AAEvH,UAAM0K,IAAIiG,GAAKgiC,IAAQiD,IAAe51C,CAAI;AAC1C,WAAO,IAAIk2C,GAAM;AAAA,MACb,UAAAC;AAAA,MACA,WAAWzrC,EAAE,MAAM,EAAE;AAAA,MACrB,YAAYA,EAAE,MAAM,GAAG,EAAE;AAAA,IACrC,CAAS;AAAA,EACJ;AAAA,EACD,OAAO,gBAAgB0rC,GAAWD,IAAWN,IAAkB;AAE3D,UAAMQ,IAAYZ,GAAY,OAAOW,CAAS,GACxCE,IAAUj9C,GAAWg9C,CAAS,GAC9BzV,IAAU0V,EAAQ,UAAU,GAAG,EAAK,GACpCpP,IAAM;AAAA,MACR,UAAAiP;AAAA,MACA,OAAOE,EAAU,CAAC;AAAA,MAClB,mBAAmBC,EAAQ,UAAU,GAAG,EAAK;AAAA,MAC7C,OAAOA,EAAQ,UAAU,GAAG,EAAK;AAAA,MACjC,WAAWD,EAAU,MAAM,IAAI,EAAE;AAAA,IAC7C,GACc3hD,IAAM2hD,EAAU,MAAM,EAAE,GACxBE,IAAS7hD,EAAI,CAAC,MAAM;AAC1B,QAAIksC,MAAYuV,EAASI,IAAS,YAAY,QAAQ;AAClD,YAAM,IAAI,MAAM,kBAAkB;AAEtC,WAAIA,IACO,IAAIL,GAAM,EAAE,GAAGhP,GAAK,YAAYxyC,EAAI,MAAM,CAAC,EAAC,CAAE,IAG9C,IAAIwhD,GAAM,EAAE,GAAGhP,GAAK,WAAWxyC,EAAG,CAAE;AAAA,EAElD;AAAA,EACD,OAAO,SAASq1B,GAAM;AAClB,WAAOmsB,GAAM,gBAAgBnsB,EAAK,KAAK;AAAA,EAC1C;AAAA,EACD,YAAYmd,GAAK;AAKb,QAJA,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,YAAY,MACjB,KAAK,oBAAoB,GACrB,CAACA,KAAO,OAAOA,KAAQ;AACvB,YAAM,IAAI,MAAM,+CAA+C;AAOnE,QALA,KAAK,WAAWA,EAAI,YAAY2O,IAChC,KAAK,QAAQ3O,EAAI,SAAS,GAC1B,KAAK,YAAYA,EAAI,aAAa,MAClC,KAAK,QAAQA,EAAI,SAAS,GAC1B,KAAK,oBAAoBA,EAAI,qBAAqB,GAC9C,CAAC,KAAK,UACF,KAAK,qBAAqB,KAAK;AAC/B,YAAM,IAAI,MAAM,0DAA0D;AAGlF,QAAIA,EAAI,aAAaA,EAAI;AACrB,YAAM,IAAI,MAAM,+CAA+C;AAEnE,QAAIA,EAAI,YAAY;AAChB,UAAI,CAACsO,GAAK,MAAM,kBAAkBtO,EAAI,UAAU;AAC5C,cAAM,IAAI,MAAM,qBAAqB;AAEzC,WAAK,UACD,OAAOA,EAAI,cAAe,WAAWA,EAAI,aAAawO,GAAcxO,EAAI,UAAU,GACtF,KAAK,eAAeyO,GAAc,KAAK,OAAO,GAC9C,KAAK,SAASH,GAAK,aAAatO,EAAI,YAAY,EAAI;AAAA,IACvD,WACQA,EAAI;AACT,WAAK,SAASp+B,GAAM,QAAQo+B,EAAI,SAAS,EAAE,WAAW,EAAI;AAAA;AAG1D,YAAM,IAAI,MAAM,0CAA0C;AAE9D,SAAK,UAAU6O,GAAQ,KAAK,MAAM;AAAA,EACrC;AAAA,EACD,OAAOta,GAAM;AACT,QAAI,CAAC,UAAU,KAAKA,CAAI;AACpB,YAAM,IAAI,MAAM,iCAAiC;AAErD,QAAI,WAAW,KAAKA,CAAI;AACpB,aAAO;AAEX,UAAM+a,IAAQ/a,EAAK,QAAQ,aAAa,EAAE,EAAE,MAAM,GAAG;AAErD,QAAIgb,IAAQ;AACZ,eAAWpiD,KAAKmiD,GAAO;AACnB,YAAM70C,IAAI,cAAc,KAAKtN,CAAC,GACxBqiD,IAAK/0C,KAAKA,EAAE,CAAC;AACnB,UAAI,CAACA,KAAKA,EAAE,WAAW,KAAK,OAAO+0C,KAAO;AACtC,cAAM,IAAI,MAAM,wBAAwBriD,CAAC,EAAE;AAE/C,UAAIulB,IAAM,CAAC88B;AACX,UAAI,CAAC,OAAO,cAAc98B,CAAG,KAAKA,KAAOk8B;AACrC,cAAM,IAAI,MAAM,eAAe;AAGnC,MAAIn0C,EAAE,CAAC,MAAM,QACTiY,KAAOk8B,KAEXW,IAAQA,EAAM,YAAY78B,CAAG;AAAA,IAChC;AACD,WAAO68B;AAAA,EACV;AAAA,EACD,YAAYjiD,GAAO;AACf,QAAI,CAAC,KAAK,UAAU,CAAC,KAAK;AACtB,YAAM,IAAI,MAAM,+BAA+B;AAEnD,QAAIqF,IAAOo8C,GAAMzhD,CAAK;AACtB,QAAIA,KAASshD,IAAiB;AAE1B,YAAMviC,IAAO,KAAK;AAClB,UAAI,CAACA;AACD,cAAM,IAAI,MAAM,qCAAqC;AAGzD,MAAA1Z,IAAOC,GAAY,IAAI,WAAW,CAAC,CAAC,CAAC,GAAGyZ,GAAM1Z,CAAI;AAAA,IACrD;AAGG,MAAAA,IAAOC,GAAY,KAAK,QAAQD,CAAI;AAExC,UAAM6Q,IAAIiG,GAAKgiC,IAAQ,KAAK,WAAW94C,CAAI,GACrC88C,IAAajB,GAAchrC,EAAE,MAAM,GAAG,EAAE,CAAC,GACzCksC,IAAYlsC,EAAE,MAAM,EAAE;AAC5B,QAAI,CAAC8qC,GAAK,MAAM,kBAAkBmB,CAAU;AACxC,YAAM,IAAI,MAAM,+BAA+B;AAEnD,UAAMzP,IAAM;AAAA,MACR,UAAU,KAAK;AAAA,MACf,WAAA0P;AAAA,MACA,OAAO,KAAK,QAAQ;AAAA,MACpB,mBAAmB,KAAK;AAAA,MACxB,OAAApiD;AAAA,IACZ;AACQ,QAAI;AAEA,UAAI,KAAK,YAAY;AACjB,cAAMqiD,IAAQ51C,GAAI,KAAK,UAAU01C,GAAYnB,GAAK,MAAM,CAAC;AACzD,YAAI,CAACA,GAAK,MAAM,kBAAkBqB,CAAK;AACnC,gBAAM,IAAI,MAAM,mEAAmE;AAEvF,QAAA3P,EAAI,aAAa2P;AAAA,MACpB,OACI;AACD,cAAMA,IAAQ/tC,GAAM,QAAQ,KAAK,MAAM,EAAE,IAAIA,GAAM,eAAe6tC,CAAU,CAAC;AAE7E,YAAIE,EAAM,OAAO/tC,GAAM,IAAI;AACvB,gBAAM,IAAI,MAAM,sEAAsE;AAE1F,QAAAo+B,EAAI,YAAY2P,EAAM,WAAW,EAAI;AAAA,MACxC;AACD,aAAO,IAAIX,GAAMhP,CAAG;AAAA,IACvB,QACW;AACR,aAAO,KAAK,YAAY1yC,IAAQ,CAAC;AAAA,IACpC;AAAA,EACJ;AAAA,EACD,KAAKmE,GAAM;AACP,QAAI,CAAC,KAAK;AACN,YAAM,IAAI,MAAM,oBAAoB;AAExC6X,WAAAA,GAAY7X,GAAM,EAAE,GACb68C,GAAK,KAAK78C,GAAM,KAAK,OAAO,EAAE;EACxC;AAAA,EACD,OAAOA,GAAMkX,GAAW;AAGpB,QAFAW,GAAY7X,GAAM,EAAE,GACpB6X,GAAYX,GAAW,EAAE,GACrB,CAAC,KAAK;AACN,YAAM,IAAI,MAAM,mBAAmB;AAEvC,QAAIxI;AACJ,QAAI;AACA,MAAAA,IAAMmuC,GAAK,UAAU,YAAY3lC,CAAS;AAAA,IAC7C,QACa;AACV,aAAO;AAAA,IACV;AACD,WAAO2lC,GAAK,OAAOnuC,GAAK1O,GAAM,KAAK,SAAS;AAAA,EAC/C;AAAA,EACD,kBAAkB;AACd,gBAAK,UAAU,QACX,KAAK,iBACL,KAAK,aAAa,KAAK,CAAC,GACxB,KAAK,eAAe,SAEjB;AAAA,EACV;AAAA,EACD,SAAS;AACL,WAAO;AAAA,MACH,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACvB;AAAA,EACK;AAAA,EACD,UAAUioC,GAASlsC,GAAK;AACpB,QAAI,CAAC,KAAK;AACN,YAAM,IAAI,MAAM,kBAAkB;AAEtC8b,WAAAA,GAAY9b,GAAK,EAAE,GAEZoF,GAAYm8C,GAAMrV,CAAO,GAAG,IAAI,WAAW,CAAC,KAAK,KAAK,CAAC,GAAGqV,GAAM,KAAK,iBAAiB,GAAGA,GAAM,KAAK,KAAK,GAAG,KAAK,WAAWvhD,CAAG;AAAA,EACzI;AACL;AhD3QA,IAAAoiD,IAAAC,IAAAC;AiDYW,MAAMC,GAAW;AAAA,EAE1B,YAAY1zB,GAAU;AAFb,IAAA5zB,EAAA,MAAAonD;AACT,IAAApnD,EAAA,MAAAmnD;AAUA,IAAAtoD,EAAA,eAAQ;AAAA,MACN,SAAS,OAAO47B,GAAQhP,MACf87B,GAAM,QAAQ3nD,EAAA,MAAKunD,KAAY1sB,GAAQhP,CAAS;AAAA,MAEzD,SAAS,OAAOgP,GAAQnO,MACfi7B,GAAM,QAAQ3nD,EAAA,MAAKunD,KAAY1sB,GAAQnO,CAAU;AAAA,IAE9D;AAIE,IAAAztB,EAAA,eAAQ;AAAA,MACN,SAAS,OAAO47B,GAAQhP,MAAY;AAClC,cAAM0X,IAAkB1+B,EAAA,MAAK2iD,IAAAC,IAAL,WAAyB5sB;AACjD,eAAO+sB,GAAM,GAAG,QAAQ/7B,GAAW0X,CAAe;AAAA,MACnD;AAAA,MACD,SAAS,OAAO1I,GAAQnO,MAAa;AACnC,cAAM6W,IAAkB1+B,EAAA,MAAK2iD,IAAAC,IAAL,WAAyB5sB;AACjD,eAAO+sB,GAAM,GAAG,QAAQl7B,GAAY6W,CAAe;AAAA,MACpD;AAAA,IACL;AA5BI,IAAAtjC,EAAA,MAAKsnD,IAAavzB;AAAA,EACnB;AAAA,EACD,MAAM,eAAe;AACnB,WAAOpV,GAAa5e,EAAA,MAAKunD,GAAU;AAAA,EACpC;AAAA,EACD,MAAM,UAAU30B,GAAO;AACrB,WAAO0B,GAAc1B,GAAO5yB,EAAA,MAAKunD,GAAU;AAAA,EAC5C;AAsBH;AA/BEA,KAAA,eADSC,KAAA,eAmBTC,KAAmB,SAAC5sB,GAAQ;AAC1B,SAAO+sB,GAAM,GAAG,MAAM,mBAAmB5nD,EAAA,MAAKunD,KAAY1sB,CAAM;AACjE;ACrBQ,MAAMgtB,WAAoBH,GAAW;AAAA,EAC9C,YAAYj3C,GAAMq3C,IAAU,GAAE;AAC5B,UAAM5b,IAAO,eAAe4b,CAAO,SAC7B,EAAE,YAAAjuC,EAAY,IAAG8sC,GAAM,eAAel2C,CAAI,EAAE,OAAOy7B,CAAI;AAC7D,QAAI,CAACryB;AACH,YAAM,IAAI,MAAM,8BAA8B;AAEhD,UAAMA,CAAU;AAAA,EACjB;AACH;AlDrBA,IAAAkuC;AmDkBW,MAAMC,GAAW;AAAA,EAE1B,YAAYv3C,GAAK;AADjB,IAAArQ,EAAA,MAAA2nD;AAEE,IAAA9nD,EAAA,MAAK8nD,IAAQt3C;AAAA,EACd;AAAA;AAAA,EACuC,MAAM,IAAIw3C,GAAMH,IAAU,GAAG;AACnE,UAAMI,IAAY,MAAM,OAAO,OAAO,UAAU,OAAOloD,EAAA,MAAK+nD,KAAO;AAAA,MACjE,MAAM;AAAA,MACN,MAAM;AAAA,QACJ,MAAM;AAAA,MACP;AAAA,IACF,GAAE,IAAO;AAAA,MACR;AAAA,IACN,CAAK,GACKz9C,IAAO,IAAI,YAAa,EAAC,OAAO29C,CAAI,GACpC7+C,IAAO,MAAM,OAAO,OAAO,KAAK,QAAQ8+C,GAAW59C,CAAI,GACvDmG,IAAO,IAAI,WAAWrH,CAAI;AAChC,WAAO,IAAIy+C,GAAYp3C,GAAMq3C,CAAO;AAAA,EACrC;AACH;AAlBEC,KAAA;AClBK,MAAMI,GAAM;AAAA;AAAA,EACU,OAAO,QAAQ;AACxC,WAAO;AAAA,EACR;AAAA;AAAA,EACoC,OAAO,kBAAkB;AAC5D,WAAOnsC,EAAE,OAAO;AAAA,MACd,OAAOA,EAAE,OAAOA,EAAE,OAAM,EAAG,MAAM,YAAY,GAAG7b,GAAE,IAAI;AAAA,MACtD,QAAQ6b,EAAE,OAAO7b,GAAE,GAAI,GAAE6b,EAAE,MAAMA,EAAE,OAAQ,EAAC,IAAG,CAAE,CAAC,EAAE,SAAU;AAAA,IACpE,CAAK;AAAA,EACF;AAAA;AAAA,EACgD,aAAa,OAAOkiB,GAAOxqB,GAAM;AAChF,UAAM,EAAE,OAAA00C,IAAQ,WAAW,OAAO,QAAAthD,EAAQ,IAAG4M,KAAQ,IAC/CuqB,IAAQC,EAAM,MAAMiqB,GAAM,MAAO,CAAA;AACvC,QAAI,CAAClqB,EAAO,OAAM,IAAI,MAAM,wBAAwBC,CAAK,EAAE;AAC3D,UAAM,CAACh/B,GAAGqzB,IAAO,KAAKuL,CAAM,IAAIG,GAC1B1K,IAAM,IAAI,IAAI,gCAAgC,mBAAmBhB,CAAI,CAAC,IAAI,WAAWuL,CAAM,GAAG,GAC9Fp1B,IAAM,MAAM0/C,EAAM70B,GAAK;AAAA,MAC3B,QAAAzsB;AAAA,IACN,CAAK,GACK,EAAE,OAAAuhD,GAAO,QAAAzhB,EAAQ,IAAGuhB,GAAM,kBAAkB,MAAM,MAAMz/C,EAAI,KAAI,CAAE,GAClEmyB,IAASwtB,EAAM91B,CAAI;AACzB,QAAI,CAACsI,EAAQ,OAAM,IAAI,MAAM,wBAAwBqD,CAAK,EAAE;AAC5D,WAAO;AAAA,MACL,QAAArD;AAAA,MACA,SAAQ+L,KAAA,gBAAAA,EAAS/L,OAAW,CAAE;AAAA,IACpC;AAAA,EACG;AACH;AC5BuG,MAAMytB,GAAM;AAAA,EACjH,OAAO,WAAW5iC,GAAO;AACvB,UAAMub,IAAQ,kCACRsnB,IAAS,CAAA;AACf,QAAItqB;AACJ,YAAOA,IAAQgD,EAAM,KAAKvb,CAAK,OAAO;AACpC,UAAIuY,EAAM,CAAC,GAAG;AACZ,cAAM,CAAC94B,GAAK,GAAGy0B,CAAM,IAAIqE,EAAM,CAAC,EAAE,MAAM,GAAG;AAC3C,QAAAsqB,EAAO,KAAK;AAAA,UACV,KAAApjD;AAAA,UACA,OAAOy0B,EAAO,KAAK,GAAG;AAAA,QAChC,CAAS;AAAA,MACT,MAAa,CAAIqE,EAAM,CAAC,IAChBsqB,EAAO,KAAKtqB,EAAM,CAAC,EAAE,QAAQ,MAAM,EAAE,CAAC,IAC7BA,EAAM,CAAC,KAChBsqB,EAAO,KAAKtqB,EAAM,CAAC,CAAC;AAGxB,WAAOsqB;AAAA,EACR;AACH;ACnBA,MAAMC,KAAU,IAAI;AACpB,SAASC,GAAYljD,GAAO;AtDF5B,MAAAvG;AsDGE,QAAML,IAAO,OAAO4G;AACpB,SAAI5G,MAAS,WACJA,IACE4G,MAAU,OACZ,WAEAvG,IAAAuG,KAAA,gBAAAA,EAAO,gBAAP,gBAAAvG,EAAoB,SAAQ;AAEvC;AACO,SAAS0pD,GAAmBC,GAAQ;AACzC,MAAI,OAAOA,KAAW;AACpB,WAAOH,GAAQ,OAAOG,CAAM;AACvB,MAAIA,aAAkB;AAC3B,WAAOA;AACF,MAAIA,aAAkB;AAC3B,WAAO,IAAI,WAAWA,CAAM;AAE9B,QAAM,IAAI,UAAU,6FAA6FF,GAAYE,CAAM,CAAC,GAAG;AACzI;ACOA,MAAMC,KAAW,IAAI,YAAW,EAAG,OAAO,kBAAkB;AACxC,IAAI,YAAc;AACtC,MAAMC,KAAc,IAAI;AA8Bb,SAASC,GAAUC,GAAK;AACjC,QAAMC,IAAKN,GAAmBK,CAAG,GAC3Br9B,IAAM,IAAI,WAAWs9B,EAAG,SAAS,CAAC;AACxC,WAAQ5jD,IAAI,GAAGA,IAAIsmB,EAAI,QAAQtmB,KAAI;AACjC,UAAME,IAAI0jD,EAAG5jD,CAAC;AACd,IAAAsmB,EAAItmB,IAAI,CAAC,IAAIwjD,GAAStjD,KAAK,CAAC,GAC5BomB,EAAItmB,IAAI,IAAI,CAAC,IAAIwjD,GAAStjD,IAAI,EAAI;AAAA,EACnC;AACD,SAAOujD,GAAY,OAAOn9B,CAAG;AAC/B;AC7CA,MAAMu9B,KAAY;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAgBW,SAASC,GAAa5+C,GAAM;AAErC,QAAM6+C,IAAQT,GAAmBp+C,CAAI;AACrC,MAAIqH,IAAS,IACTvM;AACJ,QAAMuS,IAAIwxC,EAAM;AAChB,OAAI/jD,IAAI,GAAGA,IAAIuS,GAAGvS,KAAK;AACrB,IAAAuM,KAAUs3C,GAAUE,EAAM/jD,IAAI,CAAC,KAAK,CAAC,GACrCuM,KAAUs3C,IAAWE,EAAM/jD,IAAI,CAAC,IAAI,MAAS,IAAI+jD,EAAM/jD,IAAI,CAAC,KAAK,CAAC,GAClEuM,KAAUs3C,IAAWE,EAAM/jD,IAAI,CAAC,IAAI,OAAS,IAAI+jD,EAAM/jD,CAAC,KAAK,CAAC,GAC9DuM,KAAUs3C,GAAUE,EAAM/jD,CAAC,IAAI,EAAI;AAErC,SAAIA,MAAMuS,IAAI,MAEZhG,KAAUs3C,GAAUE,EAAM/jD,IAAI,CAAC,KAAK,CAAC,GACrCuM,KAAUs3C,IAAWE,EAAM/jD,IAAI,CAAC,IAAI,MAAS,CAAC,GAC9CuM,KAAU,OAERvM,MAAMuS,MAERhG,KAAUs3C,GAAUE,EAAM/jD,IAAI,CAAC,KAAK,CAAC,GACrCuM,KAAUs3C,IAAWE,EAAM/jD,IAAI,CAAC,IAAI,MAAS,IAAI+jD,EAAM/jD,IAAI,CAAC,KAAK,CAAC,GAClEuM,KAAUs3C,IAAWE,EAAM/jD,IAAI,CAAC,IAAI,OAAS,CAAC,GAC9CuM,KAAU,MAELA;AACT;AAmBW,SAASy3C,GAAaC,GAAK;AACpC,QAAMC,IAAY,KAAKD,CAAG,GACpBzpD,IAAO0pD,EAAU,QACjBpgD,IAAQ,IAAI,WAAWtJ,CAAI;AACjC,WAAQwF,IAAI,GAAGA,IAAIxF,GAAMwF;AACvB,IAAA8D,EAAM9D,CAAC,IAAIkkD,EAAU,WAAWlkD,CAAC;AAEnC,SAAO8D;AACT;AC5J6C,MAAMqgD,GAAI;AAAA;AAAA,EACV,OAAO,YAAY32B,GAAO;AACnE,WAAOs2B,GAAa,KAAK,UAAUt2B,CAAK,CAAC;AAAA,EAC1C;AAAA;AAAA,EAC+G,OAAO,YAAY5L,GAAQ;AACzI,UAAM9d,IAAQkgD,GAAapiC,CAAM,GAC3B+V,IAAO,IAAI,YAAa,EAAC,OAAO7zB,CAAK;AAC3C,WAAO/I,GAAE,KAAM,EAAC,KAAKA,GAAE,OAAO,EAAE,MAAM48B,CAAI;AAAA,EAC3C;AACH;ACR4F,MAAMysB,GAAM;AAAA;AAAA,EAC/C,aAAa,SAAS3N,GAASnoC,GAAM;AAC1F,UAAM,EAAE,iBAAA+1C,IAAkB;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,IACN,EAAM,SAAS5N,EAAQ,MAAM,EAAC,IAAKnoC,KAAQ,CAAA,GACjC,EAAE,QAAA80B,GAAQ,KAAAjV,EAAK,IAAGsoB,GAClBja,IAAO;AAAA,MACX;AAAA,QACE;AAAA,QACA4G;AAAA,MACD;AAAA,MACD;AAAA,QACE;AAAA,QACAjV;AAAA,MACD;AAAA,IACP;AACI,QAAIk2B,GAAiB;AACnB,YAAM19C,IAAS,MAAM8vC,EAAQ,MAAO,EAAC,YAAW,GAC1C6N,IAAS,MAAM,OAAO,OAAO,OAAO,WAAW39C,CAAM;AAC3D,MAAA61B,EAAK,KAAK;AAAA,QACR;AAAA,QACAknB,GAAUY,CAAM;AAAA,MACxB,CAAO;AAAA,IACF;AACD,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS;AAAA,MACT,MAAA9nB;AAAA,MACA,YAAY,KAAK,MAAM,KAAK,IAAG,IAAK,GAAI;AAAA,IAC9C;AAAA,EACG;AAAA;AAAA,EACoG,aAAa,OAAOia,GAASnoC,GAAM;A1DpC1I,QAAA1U,GAAAK,GAAA2G,GAAAC;A0DqCI,UAAM,EAAE,QAAA0jD,IAAS,KAAQ,iBAAAF,IAAkB;AAAA,MACzC;AAAA,MACA;AAAA,MACA;AAAA,IACN,EAAM,SAAS5N,EAAQ,MAAM,GAAC,aAAEtnB,IAAcq1B,GAAc,IAAGl2C,KAAQ,IAC7Dm2C,IAAShO,EAAQ,QAAQ,IAAI,eAAe;AAClD,QAAI,CAACgO;AACH,YAAM,IAAI,MAAM,oCAAoC;AAEtD,UAAMthB,KAAQvpC,IAAA6qD,EAAO,MAAM,cAAc,MAA3B,gBAAA7qD,EAA+B;AAC7C,QAAI,CAACupC;AACH,YAAM,IAAI,MAAM,mCAAmC;AAErD,UAAM3V,IAAQ22B,GAAI,YAAYhhB,CAAK;AACnC,QAAI,CAAChU,EAAY3B,CAAK;AACpB,YAAM,IAAI,MAAM,4BAA4B;AAE9C,UAAM9sB,IAAM,KAAK,IAAK,IAAG8sB,EAAM,aAAa,KACtC1gB,KAAI7S,IAAAuzB,EAAM,KAAK,KAAK,CAAC,CAACL,CAAI,MAAIA,MAAS,GAAG,MAAtC,gBAAAlzB,EAA0C,IAC9CmpC,KAASxiC,IAAA4sB,EAAM,KAAK,KAAK,CAAC,CAACL,CAAI,MAAIA,MAAS,QAAQ,MAA3C,gBAAAvsB,EAA+C,IACxDw+B,KAAUv+B,IAAA2sB,EAAM,KAAK,KAAK,CAAC,CAACL,CAAI,MAAIA,MAAS,SAAS,MAA5C,gBAAAtsB,EAAgD;AAChE,QAAI2sB,EAAM,SAAS;AACjB,YAAM,IAAI,MAAM,0BAA0B;AAE5C,QAAI1gB,MAAM2pC,EAAQ;AAChB,YAAM,IAAI,MAAM,sCAAsC;AAExD,QAAIrT,MAAWqT,EAAQ;AACrB,YAAM,IAAI,MAAM,iDAAiD;AAEnE,QAAI/1C,KAAO6jD;AACT,YAAM,IAAI,MAAM,eAAe;AAEjC,QAAIF,KAAmBjlB,MAAY,QAAW;AAC5C,YAAMz4B,IAAS,MAAM8vC,EAAQ,MAAO,EAAC,YAAW,GAC1C6N,IAAS,MAAM,OAAO,OAAO,OAAO,WAAW39C,CAAM;AAC3D,UAAI+8C,GAAUY,CAAM,MAAMllB;AACxB,cAAM,IAAI,MAAM,2CAA2C;AAAA,IAE9D;AACD,WAAO5R;AAAA,EACR;AACH;AC/EO,MAAMk3B,GAAO;AAAA;AAAA,EACsE,OAAO,QAAQtwB,GAAM;AAC3G,WAAO,OAAQA,KAAQA,IAAO,OAAS;AAAA,MACrC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN,EAAM,SAASA,CAAI;AAAA,EAChB;AAAA;AAAA,EACiN,OAAO,YAAYA,GAAM;AACzO,WAAO,OAASA,KAAQA,IAAO,OAAS;AAAA,MACtC;AAAA,MACA;AAAA,IACN,EAAM,SAASA,CAAI;AAAA,EAChB;AAAA;AAAA,EAC0F,OAAO,UAAUA,GAAM;AAChH,WAAO,OAASA,KAAQA,IAAO;AAAA,EAChC;AAAA;AAAA,EACmO,OAAO,yBAAyBA,GAAM;AACxQ,WAAO,OAASA,KAAQA,IAAO;AAAA,EAChC;AACH;AC1BA,SAASuwB,GAAW3gD,GAAM4gD,GAAWC,GAAOC,GAAO;AAC/CppC,EAAAA,GAAW1X,CAAI;AACf,QAAMsK,IAAOwV,GAAU,EAAE,OAAO,IAAI,WAAW,MAAMghC,CAAK,GACpD,EAAE,GAAAplD,GAAG,OAAAqlD,GAAO,WAAAC,EAAS,IAAK12C;AAIhC,MAHAyR,GAAargB,CAAC,GACdqgB,GAAaglC,CAAK,GAClBhlC,GAAailC,CAAS,GAClBtlD,IAAI;AACJ,UAAM,IAAI,MAAM,uCAAuC;AAC3D,QAAMulD,IAAWhgD,GAAQ2/C,CAAS,GAC5Bv4B,IAAOpnB,GAAQ4/C,CAAK,GAEpBK,IAAK,IAAI,WAAWH,CAAK,GAEzBI,IAAMnpC,GAAK,OAAOhY,GAAMihD,CAAQ,GAChCG,IAAUD,EAAI,WAAY,EAAC,OAAO94B,CAAI;AAC5C,SAAO,EAAE,GAAA3sB,GAAG,OAAAqlD,GAAO,WAAAC,GAAW,IAAAE,GAAI,KAAAC,GAAK,SAAAC;AAC3C;AACA,SAASC,GAAaF,GAAKC,GAASF,GAAII,GAAMx4C,GAAG;AAC7C,SAAAq4C,EAAI,QAAO,GACXC,EAAQ,QAAO,GACXE,KACAA,EAAK,QAAO,GAChBx4C,EAAE,KAAK,CAAC,GACDo4C;AACX;AAQO,SAASK,GAAOvhD,GAAMihD,GAAU54B,GAAM/d,GAAM;AAC/C,QAAM,EAAE,GAAA5O,GAAG,OAAAqlD,GAAO,IAAAG,GAAI,KAAAC,GAAK,SAAAC,MAAYT,GAAW3gD,GAAMihD,GAAU54B,GAAM/d,CAAI;AAC5E,MAAIg3C;AACJ,QAAM7kD,IAAM,IAAI,WAAW,CAAC,GACtBuF,IAAOtB,GAAWjE,CAAG,GACrBqM,IAAI,IAAI,WAAWq4C,EAAI,SAAS;AAEtC,WAASK,IAAK,GAAG3+C,IAAM,GAAGA,IAAMk+C,GAAOS,KAAM3+C,KAAOs+C,EAAI,WAAW;AAE/D,UAAMM,IAAKP,EAAG,SAASr+C,GAAKA,IAAMs+C,EAAI,SAAS;AAC/C,IAAAn/C,EAAK,SAAS,GAAGw/C,GAAI,EAAK,IAGzBF,IAAOF,EAAQ,WAAWE,CAAI,GAAG,OAAO7kD,CAAG,EAAE,WAAWqM,CAAC,GAC1D24C,EAAG,IAAI34C,EAAE,SAAS,GAAG24C,EAAG,MAAM,CAAC;AAC/B,aAASC,IAAK,GAAGA,IAAKhmD,GAAGgmD,KAAM;AAE3B,MAAAP,EAAI,WAAWG,CAAI,EAAE,OAAOx4C,CAAC,EAAE,WAAWA,CAAC;AAC3C,eAAS9M,IAAI,GAAGA,IAAIylD,EAAG,QAAQzlD;AAC3B,QAAAylD,EAAGzlD,CAAC,KAAK8M,EAAE9M,CAAC;AAAA,IACnB;AAAA,EACJ;AACD,SAAOqlD,GAAaF,GAAKC,GAASF,GAAII,GAAMx4C,CAAC;AACjD;AC5DA;AAaA,SAAS64C,GAAK3gD,GAAK;AACf,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,UAAU,0BAA0B,OAAOA,CAAG,EAAE;AAC9D,SAAOA,EAAI,UAAU,MAAM;AAC/B;AACA,SAAS6b,GAAU7b,GAAK;AACpB,QAAM4gD,IAAOD,GAAK3gD,CAAG,GACf0d,IAAQkjC,EAAK,MAAM,GAAG;AAC5B,MAAI,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,SAASljC,EAAM,MAAM;AAC3C,UAAM,IAAI,MAAM,kBAAkB;AACtC,SAAO,EAAE,MAAMkjC,GAAM,OAAAljC;AACzB;AAmFA,MAAM2J,KAAO,CAACw5B,MAAeF,GAAK,WAAWE,CAAU,EAAE;AAwBlD,SAASC,GAAmBC,GAAUF,IAAa,IAAI;AAC1D,SAAON,GAAOvH,IAAQn9B,GAAUklC,CAAQ,EAAE,MAAM15B,GAAKw5B,CAAU,GAAG,EAAE,GAAG,MAAM,OAAO,GAAI,CAAA;AAC5F;ACvHW,MAAMG,WAAsBvD,GAAY;AAAA,EACjD,YAAYsD,GAAUz3C,IAAO,IAAG;AAC9B,UAAM,EAAE,SAAAo0C,GAAS,YAAAmD,EAAY,IAAGv3C,GAC1BjD,IAAOy6C,GAAmBC,GAAUF,CAAU;AACpD,UAAMx6C,GAAMq3C,CAAO;AAAA,EACpB;AACH;ACII,IAAI9e;AACRA,KAAe,OAAO;A/DzBtB,IAAAqiB,IAAAC,IAAAC;A+D0BO,MAAMC,GAAQ;AAAA,EAInB,YAAY1kD,GAAO;AAHnB,IAAA1G,EAAA,MAAAirD,IAAS,CAAA;AACT,IAAAjrD,EAAA,MAAAkrD;AACA,IAAAlrD,EAAA,MAAAmrD,IAAW;AAET,IAAIzkD,KAAA,QAAAA,EAAQ,UACV,KAAK,MAAK,IAEVA,KAAA,QAAAA,EAAQ,iBAAiB,SAAS,MAAI,KAAK,MAAK,GAAI;AAAA,MAClD,MAAM;AAAA,IACd;AAAA,EAEG;AAAA;AAAA,EACwC,QAAQkiC,EAAY,IAAI;AAC/D,WAAM,CAAChpC,EAAA,MAAKurD,OAAS;AACnB,UAAIvrD,EAAA,MAAKqrD,IAAO,QAAQ;AACtB,cAAMrrD,EAAA,MAAKqrD,IAAO;AAClB;AAAA,MACD;AACD,YAAM,IAAI,QAAQ,CAACC,MAAW;AAC5B,QAAArrD,EAAA,MAAKqrD,IAAWA;AAAA,MACxB,CAAO;AAAA,IACF;AACD,UAAM,IAAI,aAAa,+BAA+B,YAAY;AAAA,EACnE;AAAA;AAAA,EACmG,KAAKhhD,GAAM;A/DnDjH,QAAAtL;A+DoDI,IAAAgB,EAAA,MAAKqrD,IAAO,KAAK/gD,CAAI,IACrBtL,IAAAgB,EAAA,MAAKsrD,QAAL,QAAAtsD,EAAA;AAAA,EACD;AAAA;AAAA,EAC2D,QAAQ;A/DvDtE,QAAAA;A+DwDI,IAAAiB,EAAA,MAAKsrD,IAAW,MAChBvsD,IAAAgB,EAAA,MAAKsrD,QAAL,QAAAtsD,EAAA;AAAA,EACD;AACH;AAhCEqsD,KAAA,eACAC,KAAA,eACAC,KAAA;AC7BF,IAAIviB;AAKJA,KAAe,OAAO;AA6BX,MAAMyiB,GAAM;AAAA,EAGrB,YAAY/3C,GAAK;AAFjB,IAAAzU,EAAA;AACA,IAAAA,EAAA;AAEE,SAAK,OAAOyU,GACZ,KAAK,UAAU,oBAAI;EACpB;AAAA;AAAA,EACwD,MAAM6f,GAAK;AAClE,UAAMkS,IAAQ,KAAK,QAAQ,IAAIlS,CAAG;AAClC,QAAIkS;AACF,aAAOA;AACF;AACL,YAAMA,IAAQ,KAAK,KAAK,KAAKlS,CAAG;AAChC,kBAAK,QAAQ,IAAIA,GAAKkS,CAAK,GACpBA;AAAA,IACR;AAAA,EACF;AAAA,EACD,IAAI,SAAS;AACX,WAAO,KAAK;AAAA,EACb;AAAA,EACD,OAAO,IAAI3L,GAASpmB,GAAM;AACxB,UAAMg4C,IAAa,IAAI,mBACjB5kD,IAAS4M,KAAA,QAAAA,EAAM,SAAS,YAAY,IAAI;AAAA,MAC5CA,EAAK;AAAA,MACLg4C,EAAW;AAAA,IACjB,CAAK,IAAIA,EAAW,QACVC,IAAS,MAAM,KAAK,KAAK,UAAU7xB,CAAO;AAChD,QAAI6xB,EAAO,OAAO;AAChB;AAEF,UAAMC,IAAU,IAAIJ,GAAQ1kD,CAAM,GAC5B+kD,IAAQ,oBAAI,OACZC,IAAS,oBAAI;AACnB,eAAW,CAACv4B,GAAKuG,CAAO,KAAK6xB,EAAO,QAAO,GAAG;AAC5C,YAAMlmB,IAAQ,KAAK,MAAMlS,CAAG;AAC5B,OAAC,YAAU;AACT,yBAAiB70B,KAAO+mC,EAAM,IAAI3L,GAAS;AAAA,UACzC,QAAAhzB;AAAA,QACV,CAAS;AACC,UAAIpI,EAAI,CAAC,MAAM,WACbmtD,EAAM,IAAIt4B,CAAG,GACTs4B,EAAM,SAASF,EAAO,QACxBC,EAAQ,KAAKltD,CAAG,IAGhBA,EAAI,CAAC,MAAM,aACbotD,EAAO,IAAIv4B,CAAG,GACVu4B,EAAO,SAASH,EAAO,QACzBC,EAAQ,KAAKltD,CAAG,IAGhBA,EAAI,CAAC,MAAM,WACbktD,EAAQ,KAAKltD,CAAG;AAAA,MAG5B,KAAW,MAAM,MAAI;AAAA,MAAA,CAAE;AAAA,IAClB;AACD,QAAI;AACF,uBAAiBA,KAAOktD;AACtB,cAAMltD;AAAA,IAEd,UAAa;AACP,MAAAgtD,EAAW,MAAK;AAAA,IACjB;AAAA,EACF;AAAA,EACD,MAAM,MAAM94B,GAAOlf,GAAM;AACvB,UAAMq4C,IAAY,MAAM,KAAK,KAAK,YAAYn5B,CAAK;AACnD,IAAIm5B,EAAU,SAAS,KAGvB,MAAM,QAAQ,IAAIA,EAAU,IAAI,CAACx4B,MAAM,KAAK,MAAMA,CAAG,EAAE,MAAMX,GAAOlf,CAAI,CAAC,CAAC;AAAA,EAC3E;AAAA,EACD,MAAM,MAAMomB,GAASpmB,GAAM;AACzB,UAAMg2B,IAAS,IAAIE,MACbrhB,IAAQuR,EAAQ,OAAO,CAACnoB,GAAQ+nB,MAAS/nB,IAASooB,GAAeL,CAAM,GAAG,CAAC;AACjF,QAAInR,MAAU,EAAG,QAAO;AACxB,UAAMyjC,IAAclyB,EAAQ,OAAO,CAACnoB,GAAQ+nB,MAAS;AhE9GzD,UAAA16B;AgE+GM,aAAO2S,KAAU,CAAC,GAAC3S,IAAA06B,EAAO,UAAP,QAAA16B,EAAc,KAAK,CAACgG,MAAI8kD,GAAO,YAAY9kD,CAAC,KAAK8kD,GAAO,yBAAyB9kD,CAAC;AAAA,IACtG,GAAE,EAAK;AACR,QAAI;AACF,uBAAiBtG,KAAO,KAAK,IAAIo7B,GAASpmB,CAAI,GAAE;AAC9C,YAAIhV,EAAI,CAAC,MAAM,OAAQ;AAEvB,YADIA,EAAI,CAAC,MAAM,WAASgrC,EAAO,IAAIhrC,EAAI,CAAC,CAAC,GACrCA,EAAI,CAAC,MAAM,SAAU,OAAM,IAAI,MAAM,qBAAqB;AAC9D,YAAI,CAACstD,KAAetiB,EAAO,QAAQnhB;AACjC;AAAA,MAEH;AAAA,IACF,QAAW;AAAA,IAEX;AACD,WAAO;AAAA,MACL,GAAGmhB;AAAA,IACT;AAAA,EACG;AAAA;AAAA,EACwC,MAAM,QAAQ;AACrD,UAAM,QAAQ,IAAI;AAAA,MAChB,GAAG,KAAK,QAAQ,OAAQ;AAAA,IAC9B,EAAM,IAAI,CAACjE,MAAQA,EAAM,MAAK,CAAE,CAAC;AAAA,EAC9B;AAAA,EACD,OAAOuD,EAAY,IAAI;AACrB,UAAM,KAAK;EACZ;AACH;AC3GO,MAAMijB,GAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM5B,YAAY71C,GAAM81C,GAAQ;AAEtB,QADA,KAAK,WAAW,GACZ,CAAC,OAAO,UAAU91C,CAAI,KAAKA,IAAO;AAClC,YAAM,IAAI,MAAM,yCAAyC;AAE7D,QAAI81C,MAAW,WAAc,CAAC,OAAO,UAAUA,CAAM,KAAKA,IAAS;AAC/D,YAAM,IAAI,MAAM,wDAAwD;AAE5E,SAAK,OAAO91C,GACZ,KAAK,SAAS81C,GACd,KAAK,IAAI;AAAA,EACZ;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK;AAAA,EACf;AAAA,EACD,IAAI,UAAU;AACV,WAAO,KAAK,OAAO,KAAK,IAAI,GAAG,KAAK,CAAC;AAAA,EACxC;AAAA,EACD,OAAO;AACH,gBAAK,YACL,KAAK,IACD,KAAK,WAAW,SACV,KAAK,IAAI,IACT,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,GACnC,KAAK;AAAA,EACf;AAAA,EACD,QAAQ;AACJ,SAAK,WAAW,GAChB,KAAK,IAAI;AAAA,EACZ;AACL;AC9DO,MAAMC,GAAW;AAAA,EACpB,cAAc;AACV,SAAK,WAAW;EACnB;AAAA,EACD,IAAIvV,GAAS;AACT,SAAK,SAAS,KAAKA,CAAO;AAAA,EAC7B;AAAA,EACD,QAAQ;AACJ,SAAK,SAAS,SAAS;AAAA,EAC1B;AAAA,EACD,QAAQ/3C,GAAI;AACR,SAAK,SAAS,QAAQA,CAAE;AAAA,EAC3B;AAAA,EACD,SAAS;AACL,WAAO,KAAK,SAAS;AAAA,EACxB;AAAA,EACD,UAAU;AACN,WAAO,KAAK,SAAS,WAAW;AAAA,EACnC;AAAA,EACD,OAAO;AACH,WAAO,KAAK,SAAS,CAAC;AAAA,EACzB;AAAA,EACD,OAAO;AACH,WAAO,KAAK,SAAS;EACxB;AACL;AC1BO,IAAIutD;AAAA,CACV,SAAUA,GAAgB;AAEvB,EAAAA,EAAe,OAAU,QAEzBA,EAAe,QAAW,SAE1BA,EAAe,QAAW,SAE1BA,EAAe,UAAa,WAE5BA,EAAe,QAAW,SAE1BA,EAAe,YAAe;AAClC,GAAGA,OAAmBA,KAAiB,CAAA,EAAG;ACbnC,MAAMC,GAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQnB,YAAY94B,GAAK+4B,GAAWppD,GAAS;AACjC,QAAIlE,GAAIK,GAAI2G,GAAIC,GAAIC,GAAI8zB,GAAIiC,GAAIC,GAAIqwB,GAAIjpD,GAAIg8C,GAAIkN,GAAIC,GAAIC,GAAIC;AAC5D,SAAK,gBAAgB,IAKrB,KAAK,kBAAkB,CAAC/5B,MAAU,KAAK,YAAYw5B,GAAe,MAAMx5B,CAAK,GAK7E,KAAK,mBAAmB,CAACA,MAAU,KAAK,YAAYw5B,GAAe,OAAOx5B,CAAK,GAK/E,KAAK,mBAAmB,CAACA,MAAU,KAAK,YAAYw5B,GAAe,OAAOx5B,CAAK,GAK/E,KAAK,qBAAqB,CAACA,MAAU,KAAK,YAAYw5B,GAAe,SAASx5B,CAAK,GACnF,KAAK,OAAOW,GACZ,KAAK,aAAa+4B,GAElB,KAAK,WAAW;AAAA,MACZ,QAAQppD,KAAY,OAA6B,SAASA,EAAQ;AAAA,MAClE,OAAO;AAAA,QACH,aAAalE,IAAKkE,KAAY,OAA6B,SAASA,EAAQ,WAAW,QAAQlE,MAAO,SAAS,SAASA,EAAG;AAAA,QAC3H,mBAAmBK,IAAK6D,KAAY,OAA6B,SAASA,EAAQ,WAAW,QAAQ7D,MAAO,SAAS,SAASA,EAAG;AAAA,QACjI,UAAU2G,IAAK9C,KAAY,OAA6B,SAASA,EAAQ,WAAW,QAAQ8C,MAAO,SAAS,SAASA,EAAG;AAAA,MAC3H;AAAA,MACD,WAAW;AAAA,QACP,MAAM,CAAC,IAAKE,KAAMD,IAAK/C,KAAY,OAA6B,SAASA,EAAQ,eAAe,QAAQ+C,MAAO,SAAS,SAASA,EAAG,UAAU,QAAQC,MAAO,SAASA,IAAK,CAAE,CAAC;AAAA,QAC9K,OAAO,CAAC,IAAK+1B,KAAMjC,IAAK92B,KAAY,OAA6B,SAASA,EAAQ,eAAe,QAAQ82B,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQiC,MAAO,SAASA,IAAK,CAAE,CAAC;AAAA,QAChL,OAAO,CAAC,IAAKswB,KAAMrwB,IAAKh5B,KAAY,OAA6B,SAASA,EAAQ,eAAe,QAAQg5B,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQqwB,MAAO,SAASA,IAAK,CAAE,CAAC;AAAA,QAChL,SAAS,CAAC,IAAKjN,KAAMh8C,IAAKJ,KAAY,OAA6B,SAASA,EAAQ,eAAe,QAAQI,MAAO,SAAS,SAASA,EAAG,aAAa,QAAQg8C,MAAO,SAASA,IAAK,CAAE,CAAC;AAAA,QACpL,OAAO,CAAC,IAAKmN,KAAMD,IAAKtpD,KAAY,OAA6B,SAASA,EAAQ,eAAe,QAAQspD,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQC,MAAO,SAASA,IAAK,CAAE,CAAC;AAAA,QAChL,WAAW,CAAC,IAAKE,KAAMD,IAAKxpD,KAAY,OAA6B,SAASA,EAAQ,eAAe,QAAQwpD,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQC,MAAO,SAASA,IAAK,CAAE,CAAC;AAAA,MAC3L;AAAA,IACb,GACQ,KAAK,uBAAuB,KAAK;EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,MAAM;AACN,WAAO,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,YAAY;AACZ,WAAO,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,SAAS;AACT,WAAO,KAAK,SAAS;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,aAAa;AACb,WAAO,KAAK,SAAS,MAAM;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,mBAAmB;AACnB,WAAO,KAAK,SAAS,MAAM;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,UAAU;AACV,WAAO,KAAK,SAAS,MAAM;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,eAAe;AACf,WAAO,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,iBAAiB;AACjB,WAAO,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,IAAI,sBAAsB;AACtB,WAAO,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,IAAI,aAAa;AACb,WAAO,KAAK,qBAAqB;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,IAAI,iBAAiB;AACjB,WAAO,KAAK,qBAAqB;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,IAAI,aAAa;AACb,WAAO,KAAK,qBAAqB;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,IAAI,aAAa;AACb,WAAO,KAAK,qBAAqB;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,WAAWpnD,GAAO;AAClB,SAAK,qBAAqB,aAAaA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUD,KAAK+E,GAAM;AACP,IAAI,KAAK,iBAEL,KAAK,qBAAqB,eAAe,KAAK,qBAAqB,OACnE,KAAK,qBAAqB,KAAKA,CAAI,IAE9B,KAAK,WAAW,UACrB,KAAK,OAAO,IAAIA,CAAI;AAAA,EAE3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,MAAM1L,GAAMQ,GAAQ;AAChB,SAAK,+BAA8B,GACnC,KAAK,gBAAgB,IACrB,KAAK,qBAAqB,MAAMR,GAAMQ,CAAM;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASD,iBAAiBT,GAAMiuD,GAAU1pD,GAAS;AACtC,SAAK,SAAS,UAAUvE,CAAI,EAAE,KAAK,EAAE,UAAAiuD,GAAU,SAAA1pD,EAAO,CAAE;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,oBAAoBvE,GAAMiuD,GAAU1pD,GAAS;AACzC,UAAM2pD,IAA2B,CAACl1C,MAAMA,EAAE,aAAai1C,KAAYj1C,EAAE,YAAYzU;AACjF,SAAK,SAAS,UAAUvE,CAAI,IACxB,KAAK,SAAS,UAAUA,CAAI,EAAE,OAAOkuD,CAAwB;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,aAAa;AACT,gBAAK,uBAAuB,IAAI,UAAU,KAAK,KAAK,KAAK,SAAS,GAClE,KAAK,qBAAqB,iBAAiBT,GAAe,MAAM,KAAK,eAAe,GACpF,KAAK,qBAAqB,iBAAiBA,GAAe,OAAO,KAAK,gBAAgB,GACtF,KAAK,qBAAqB,iBAAiBA,GAAe,OAAO,KAAK,gBAAgB,GACtF,KAAK,qBAAqB,iBAAiBA,GAAe,SAAS,KAAK,kBAAkB,GACnF,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAID,iBAAiB;AACb,SAAK,qBAAqB,oBAAoBA,GAAe,MAAM,KAAK,eAAe,GACvF,KAAK,qBAAqB,oBAAoBA,GAAe,OAAO,KAAK,gBAAgB,GACzF,KAAK,qBAAqB,oBAAoBA,GAAe,OAAO,KAAK,gBAAgB,GACzF,KAAK,qBAAqB,oBAAoBA,GAAe,SAAS,KAAK,kBAAkB,GAC7F,KAAK,qBAAqB;EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,cAAcztD,GAAMi0B,GAAO;AACvB,UAAMk6B,IAAiB,KAAK,SAAS,UAAUnuD,CAAI,GAC7CouD,IAAoB,CAAA;AAC1B,IAAAD,EAAe,QAAQ,CAAC,EAAE,UAAAF,GAAU,SAAA1pD,EAAO,MAAO;AAC9C,MAAA0pD,EAAS,MAAMh6B,CAAK,IAChB1vB,MAAY,UACZA,EAAQ,SAAS,UACjB,CAACA,EAAQ,SACT6pD,EAAkB,KAAK,EAAE,UAAAH,GAAU,SAAA1pD,EAAS,CAAA;AAAA,IAE5D,CAAS,GACD,KAAK,SAAS,UAAUvE,CAAI,IAAIouD;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOD,YAAYpuD,GAAMi0B,GAAO;AACrB,YAAQj0B,GAAI;AAAA,MACR,KAAKytD,GAAe;AAChB,aAAK,cAAcztD,GAAMi0B,CAAK,GAC9B,KAAK,gCAA+B;AACpC;AAAA,MACJ,KAAKw5B,GAAe;AAChB,YAAI,KAAK,YAAY,UAAa,KAAK,oBAAoB,QAAW;AAElE,gBAAMY,IAAS;AAAA,YACX,SAAS,KAAK,QAAQ;AAAA,YACtB,gBAAgB,IAAI,KAAK,KAAK,eAAe;AAAA,UACrE,GAC0Bp6B,IAAQ,IAAI,YAAYw5B,GAAe,WAAW;AAAA,YACpD,QAAAY;AAAA,UACxB,CAAqB;AACD,eAAK,cAAcZ,GAAe,WAAWx5B,CAAK,GAClD,KAAK,QAAQ;QAChB;AACD,aAAK,kBAAkB,oBAAI,QAC3B,KAAK,cAAcj0B,GAAMi0B,CAAK,GAC9B,KAAK,iBAAgB;AACrB;AAAA,MACJ,KAAKw5B,GAAe;AAChB,aAAK,cAAcztD,GAAMi0B,CAAK,GAC9B,KAAK,eAAc,GACnB,KAAK,WAAU;AACf;AAAA,MACJ;AACI,aAAK,cAAcj0B,GAAMi0B,CAAK;AAC9B;AAAA,IACP;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAID,mBAAmB;AACf,QAAI,KAAK,WAAW;AAGpB,eAASq6B,IAAM,KAAK,OAAO,KAAM,GAAEA,MAAQ,QAAWA,IAAM,KAAK,OAAO,KAAI;AACxE,aAAK,KAAKA,CAAG;AAAA,EAEpB;AAAA;AAAA;AAAA;AAAA,EAID,kCAAkC;AAI9B,QAHI,KAAK,gBAGL,KAAK,YAAY;AACjB;AAGJ,UAAMC,IAAmB,CAACF,MAAW;AACjC,YAAMp6B,IAAQ,IAAI,YAAYw5B,GAAe,OAAO,EAAE,QAAAY,EAAM,CAAE;AAC9D,WAAK,YAAYZ,GAAe,OAAOx5B,CAAK;AAAA,IACxD,GAEcu6B,IAAmB;AAAA,MACrB,SAAS,KAAK,SAAS,MAAM,qBAAqB,KAAO,IAAI,KAAK,QAAQ,KAAM;AAAA,MAChF,SAAS,KAAK,SAAS,MAAM,qBAAqB,KAC5C,IACA,KAAK,QAAQ;AAAA,MACnB,gBAAgB,KAAK;AAAA,IACjC;AAEQ,KAAI,KAAK,SAAS,MAAM,eAAe,UACnCA,EAAiB,WAAW,KAAK,SAAS,MAAM,gBAChD,KAAK,eAAe,WAAW,WAAW,MAAMD,EAAiBC,CAAgB,GAAGA,EAAiB,OAAO;AAAA,EAEnH;AAAA;AAAA;AAAA;AAAA,EAID,iCAAiC;AAC7B,eAAW,aAAa,KAAK,YAAY;AAAA,EAC5C;AACL;AC9VO,MAAMC,GAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM1B,YAAY75B,GAAK;AACb,SAAK,OAAOA;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,MAAM;AACN,WAAO,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,cAAc+4B,GAAW;AACrB,gBAAK,aAAaA,GACX;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,YAAY;AACZ,WAAO,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,eAAee,GAAY;AACvB,QAAIruD;AACJ,gBAAK,WAAW,OAAO,OAAO,OAAO,OAAO,CAAE,GAAE,KAAK,QAAQ,GAAG,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,CAAE,IAAGA,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,KAAK,GAAG,EAAE,YAAAquD,EAAY,CAAA,EAAG,CAAA,GACxL;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,aAAa;AACb,QAAIruD,GAAIK;AACR,YAAQA,KAAML,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQK,MAAO,SAAS,SAASA,EAAG;AAAA,EAC5H;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,qBAAqBiuD,GAAkB;AACnC,QAAItuD;AACJ,gBAAK,WAAW,OAAO,OAAO,OAAO,OAAO,CAAE,GAAE,KAAK,QAAQ,GAAG,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,CAAE,IAAGA,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,KAAK,GAAG,EAAE,kBAAAsuD,EAAkB,CAAA,EAAG,CAAA,GAC9L;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,mBAAmB;AACnB,QAAItuD,GAAIK;AACR,YAAQA,KAAML,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQK,MAAO,SAAS,SAASA,EAAG;AAAA,EAC5H;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,YAAYkuD,GAAS;AACjB,QAAIvuD;AACJ,gBAAK,WAAW,OAAO,OAAO,OAAO,OAAO,CAAE,GAAE,KAAK,QAAQ,GAAG,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,CAAE,IAAGA,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,KAAK,GAAG,EAAE,SAAAuuD,EAAS,CAAA,EAAG,CAAA,GACrL;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,UAAU;AACV,QAAIvuD,GAAIK;AACR,YAAQA,KAAML,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQK,MAAO,SAAS,SAASA,EAAG;AAAA,EAC5H;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,WAAW0M,GAAQ;AACf,gBAAK,WAAW,OAAO,OAAO,OAAO,OAAO,CAAE,GAAE,KAAK,QAAQ,GAAG,EAAE,QAAAA,EAAQ,CAAA,GACnE;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,IAAI,SAAS;AACT,QAAI/M;AACJ,YAAQA,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,OAAO4tD,GAAU1pD,GAAS;AACtB,gBAAK,YAAYkpD,GAAe,MAAMQ,GAAU1pD,CAAO,GAChD;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,QAAQ0pD,GAAU1pD,GAAS;AACvB,gBAAK,YAAYkpD,GAAe,OAAOQ,GAAU1pD,CAAO,GACjD;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,QAAQ0pD,GAAU1pD,GAAS;AACvB,gBAAK,YAAYkpD,GAAe,OAAOQ,GAAU1pD,CAAO,GACjD;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,UAAU0pD,GAAU1pD,GAAS;AACzB,gBAAK,YAAYkpD,GAAe,SAASQ,GAAU1pD,CAAO,GACnD;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,QAAQ0pD,GAAU1pD,GAAS;AACvB,gBAAK,YAAYkpD,GAAe,OAAOQ,GAAU1pD,CAAO,GACjD;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,YAAY0pD,GAAU1pD,GAAS;AAC3B,gBAAK,YAAYkpD,GAAe,WAAWQ,GAAU1pD,CAAO,GACrD;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMD,QAAQ;AACJ,WAAO,IAAImpD,GAAU,KAAK,MAAM,KAAK,YAAY,KAAK,QAAQ;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQD,YAAYz5B,GAAOg6B,GAAU1pD,GAAS;AAClC,QAAIlE,GAAIK,GAAI2G,GAAIC,GAAIC,GAAI8zB,GAAIiC,GAAIC,GAAIqwB,GAAIjpD,GAAIg8C,GAAIkN,GAAIC,GAAIC,GAAIC,GAAIa,GAAIpqD,GAAIqqD,GAAIC,GAAInqD,GAAIoqD;AACpF,gBAAK,WAAW,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,KAAK,QAAQ,GAAG,EAAE,WAAW;AAAA,MACrE,OAAO3nD,KAAM3G,KAAML,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQK,MAAO,SAAS,SAASA,EAAG,UAAU,QAAQ2G,MAAO,SAASA,IAAK,CAAE;AAAA,MAC3K,QAAQg0B,KAAM9zB,KAAMD,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQC,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQ8zB,MAAO,SAASA,IAAK,CAAE;AAAA,MAC7K,QAAQuyB,KAAMrwB,KAAMD,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQC,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQqwB,MAAO,SAASA,IAAK,CAAE;AAAA,MAC7K,UAAUC,KAAMlN,KAAMh8C,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQg8C,MAAO,SAAS,SAASA,EAAG,aAAa,QAAQkN,MAAO,SAASA,IAAK,CAAE;AAAA,MACjL,QAAQG,KAAMD,KAAMD,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQC,MAAO,SAAS,SAASA,EAAG,WAAW,QAAQC,MAAO,SAASA,IAAK,CAAE;AAAA,MAC7K,YAAYc,KAAMrqD,KAAMoqD,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQpqD,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQqqD,MAAO,SAASA,IAAK,CAAE;AAAA,MACrL,CAAC76B,CAAK,GAAG;AAAA,QACL,IAAK+6B,KAAMpqD,KAAMmqD,IAAK,KAAK,cAAc,QAAQA,MAAO,SAAS,SAASA,EAAG,eAAe,QAAQnqD,MAAO,SAAS,SAASA,EAAGqvB,CAAK,OAAO,QAAQ+6B,MAAO,SAASA,IAAK,CAAA;AAAA,QACzK,EAAE,UAAAf,GAAU,SAAA1pD,EAAS;AAAA,MACxB;AAAA,IACJ,EAAA,CAAE,GACA;AAAA,EACV;AACL;ACnNA,IAAI8lC;AAMJA,KAAe,OAAO;AACgC,MAAM4kB,GAAQ;AAAA,EAalE,YAAYr6B,GAAK7f,IAAO,IAAG;AAZ3B,IAAAzU,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AAOE,SAAK,MAAMs0B,GACX,KAAK,OAAO7f,GACZ,KAAK,OAAO,oBAAI,OAChB,KAAK,eAAe,IACpB,KAAK,KAAK,IAAI,eACd,KAAK,SAAS,KAAK,gBACnB,KAAK,oBAAmB;AAAA,EACzB;AAAA,EAbD,IAAI,gBAAgB;AAClB,WAAO;AAAA,MACL,GAAG,KAAK,KAAK,OAAQ;AAAA,IAC3B;AAAA,EACG;AAAA;AAAA,EAUyE,eAAe;AACvF,UAAM,EAAE,SAAA65C,IAAU,IAAItB,GAAmB,GAAI,EAAG,IAAG,KAAK;AACxD,WAAO,IAAImB,GAAiB,KAAK,GAAG,EAAE,WAAW,IAAIjB,GAAU,CAAE,EAAE,YAAYoB,MAAY,KAAQ,SAAYA,CAAO,EAAE,OAAO,MAAI;AACjI,iBAAWxR,KAAO,KAAK,KAAK,OAAM;AAChC,aAAK,KAAKA,CAAG;AAAA,IAErB,CAAK,EAAE,QAAQ,MAAI;AAEb,MAAK,KAAK,KAAK,QACb,KAAK,OAAO;IAEf,CAAA,EAAE,UAAU,CAAC8R,GAAKC,MAAK;AACtB,YAAMn8C,IAASxR,GAAE,KAAI,EAAG,KAAKA,GAAE,SAAQ,CAAE,EAAE,UAAU2tD,EAAG,IAAI;AAC5D,MAAIn8C,EAAO,WACT,KAAK,QAAQA,EAAO,IAAI;AAAA,IAEhC,CAAK,EAAE,MAAK;AAAA,EACT;AAAA;AAAA,EACqC,QAAQjT,GAAK;AACjD,UAAM,EAAE,MAAAqvD,GAAI,aAAEx5B,IAAcq1B,GAAY,IAAK,KAAK;AAClD,YAAOlrD,EAAI,CAAC,GAAC;AAAA,MACX,KAAK;AACH,YAAI,CAAC61B,EAAY71B,EAAI,CAAC,CAAC,EAAG;AAC1B,aAAK,GAAG,cAAc,IAAI,YAAY,OAAOA,EAAI,CAAC,CAAC,IAAI;AAAA,UACrD,QAAQA;AAAA,QACT,CAAA,CAAC;AACF;AAAA,MACF,KAAK;AACH,aAAK,GAAG,cAAc,IAAI,YAAY,OAAOA,EAAI,CAAC,CAAC,IAAI;AAAA,UACrD,QAAQA;AAAA,QACT,CAAA,CAAC;AACF;AAAA,MACF,KAAK;AACH,aAAK,KAAK,OAAOA,EAAI,CAAC,CAAC,GACvB,KAAK,oBAAmB,GACxB,KAAK,GAAG,cAAc,IAAI,YAAY,OAAOA,EAAI,CAAC,CAAC,IAAI;AAAA,UACrD,QAAQA;AAAA,QACT,CAAA,CAAC;AACF;AAAA,MACF,KAAK;AACH,aAAK,GAAG,cAAc,IAAI,YAAY,MAAMA,EAAI,CAAC,CAAC,IAAI;AAAA,UACpD,QAAQA;AAAA,QACT,CAAA,CAAC;AACF;AAAA,MACF,KAAK;AACH,aAAK,GAAG,cAAc,IAAI,YAAY,UAAU;AAAA,UAC9C,QAAQA;AAAA,QACT,CAAA,CAAC;AACF;AAAA,MACF,KAAK;AACH,aAAK,GAAG,cAAc,IAAI,YAAY,SAASA,EAAI,CAAC,CAAC,IAAI;AAAA,UACvD,QAAQA;AAAA,QACT,CAAA,CAAC;AACF;AAAA,MACF,KAAK;AACH,QAAAqvD,KAAA,QAAAA,EAAOrvD,EAAI,CAAC,GAAG,KAAK,CAACk0B,MAAQ,KAAK,KAAK;AAAA,UACnC;AAAA,UACAA;AAAA,QACD,CAAA,GAAG,MAAM,MAAI;AAAA,QAAA;AAAA,IACnB;AAAA,EACF;AAAA;AAAA,EACiD,KAAKl0B,GAAK;AAE1D,YADA,KAAK,KAAI,GACFA,EAAI,CAAC,GAAC;AAAA,MACX,KAAK;AACH,aAAK,KAAK,IAAIA,EAAI,CAAC,GAAGA,CAAG;AACzB;AAAA,MACF,KAAK;AACH,aAAK,KAAK,OAAOA,EAAI,CAAC,CAAC,GACvB,KAAK,oBAAmB;AACxB;AAAA,MACF,KAAK;AAAA,MACL,KAAK;AACH,eAAO,KAAK,OAAO,KAAK,KAAK,UAAUA,CAAG,CAAC;AAAA,IAC9C;AACD,IAAI,KAAK,OAAO,eAAe,UAAU,QACvC,KAAK,OAAO,KAAK,KAAK,UAAUA,CAAG,CAAC;AAAA,EAEvC;AAAA,EACD,OAAO,IAAIo7B,GAASpmB,IAAO,IAAI;AAC7B,UAAM,EAAE,QAAA5M,EAAQ,IAAG4M,GACbs6C,IAAiB,OAAO,cACxBxsC,IAAO,KAAK,GAAG,OAAOwsC,CAAc,IAAIlnD,CAAM,GAC9Ci1C,IAAM;AAAA,MACV;AAAA,MACAiS;AAAA,MACA,GAAGl0B;AAAA,IACT;AACI,SAAK,KAAKiiB,CAAG;AACb,QAAI;AACF,uBAAiBr9C,KAAO8iB,GAAK;AAE3B,YADI9iB,EAAI,CAAC,MAAM,WAAQ,MAAMA,IACzBA,EAAI,CAAC,MAAM,SAAU;AACzB,YAAIA,EAAI,CAAC,MAAM;AACb,cAAIm7B,GAAaC,GAASp7B,EAAI,CAAC,CAAC;AAC9B,kBAAMA;AAAA;AAEN;AAAA,MAGL;AAAA,IACP,UAAa;AACP,WAAK,KAAK;AAAA,QACR;AAAA,QACAsvD;AAAA,MACR,CAAO;AAAA,IACF;AAAA,EACF;AAAA,EACD,MAAM,MAAMl0B,GAASpmB,GAAM;AACzB,UAAMg2B,IAAS,IAAIE,MACbrhB,IAAQuR,EAAQ,OAAO,CAACnoB,GAAQ+nB,MAAS/nB,IAASooB,GAAeL,CAAM,GAAG,CAAC;AACjF,QAAInR,MAAU,EAAG,QAAO;AACxB,qBAAiB7pB,KAAO,KAAK,IAAIo7B,GAASpmB,CAAI,GAAE;AAC9C,UAAIhV,EAAI,CAAC,MAAM,OAAQ;AAEvB,UADIA,EAAI,CAAC,MAAM,WAASgrC,EAAO,IAAIhrC,EAAI,CAAC,CAAC,GACrCA,EAAI,CAAC,MAAM,SAAU,OAAM,IAAI,MAAM,qBAAqB;AAC9D,UAAIgrC,EAAO,QAAQnhB;AACjB;AAAA,IAEH;AACD,WAAO;AAAA,MACL,GAAGmhB;AAAA,IACT;AAAA,EACG;AAAA,EACD,MAAM,MAAM9W,GAAOlf,GAAM;AACvB,UAAM/B,IAAS,KAAK,KAAK,MAAMihB,EAAM,EAAE,IAAIlf,KAAA,gBAAAA,EAAM,MAAM;AACvD,SAAK,KAAK;AAAA,MACR;AAAA,MACAkf;AAAA,IACN,CAAK;AACD,UAAM,KAAKq7B,GAAI7uD,CAAM,IAAI,MAAMuS;AAC/B,QAAI,CAACs8C;AACH,YAAM,IAAI,MAAM7uD,CAAM;AAAA,EAEzB;AAAA,EACD,MAAM,MAAM06B,GAASpmB,GAAM;AACzB,UAAMs6C,IAAiB,OAAO,cACxBr8C,IAAS,KAAK,KAAK,SAASq8C,CAAc,IAAIt6C,KAAA,gBAAAA,EAAM,MAAM;AAChE,SAAK,KAAK;AAAA,MACR;AAAA,MACAs6C;AAAA,MACA,GAAGl0B;AAAA,IACT,CAAK;AACD,UAAM,CAAK,EAAA,EAAAuF,CAAK,IAAI,MAAM1tB;AAC1B,WAAO0tB;AAAA,EACR;AAAA;AAAA,EACiC,OAAO,GAAGl6B,GAAK2B,GAAQ;AACvD,QAAIA,KAAA,QAAAA,EAAQ,QAAS,OAAM,KAAK,WAAU;AAC1C,UAAM8kD,IAAU,IAAIJ,GAAQ1kD,CAAM,GAC5BonD,IAAQ,CAACz+C,MAAIm8C,EAAQ,KAAKn8C,EAAE,MAAM;AACxC,SAAK,GAAG,iBAAiBtK,GAAK+oD,CAAK;AACnC,QAAI;AACF,uBAAiBxvD,KAAOktD;AACtB,cAAMltD;AAAA,IAEd,UAAa;AACP,WAAK,GAAG,oBAAoByG,GAAK+oD,CAAK;AAAA,IACvC;AAAA,EACF;AAAA;AAAA,EACkC,MAAM,KAAK/oD,GAAK2B,GAAQ;AACzD,qBAAiBpI,KAAO,KAAK,GAAGyG,GAAK2B,CAAM;AACzC,aAAOpI;AAET,UAAM,IAAI,MAAM,aAAa;AAAA,EAC9B;AAAA,EACD,aAAa;AACX,WAAO,IAAI,aAAa,+BAA+B,YAAY;AAAA,EACpE;AAAA;AAAA,EACyC,sBAAsB;AAC9D,UAAM,EAAE,aAAAyvD,IAAc,QAAW,KAAK;AAEtC,IAAIA,MAAgB,OAEhB,KAAK,aAEL,KAAK,KAAK,QAEV,KAAK,iBACT,KAAK,YAAY,WAAW,MAAI,KAAK,OAAO,MAAK,GAAIA,CAAW;AAAA,EACjE;AAAA;AAAA,EAC2B,gBAAgB;AAC1C,iBAAa,KAAK,SAAS,GAC3B,KAAK,YAAY;AAAA,EAClB;AAAA;AAAA,EAC0E,OAAO;AAChF,SAAK,cAAa,GACd,CAAC,KAAK,gBAAgB,KAAK,OAAO,iBACpC,KAAK,SAAS,KAAK;EAEtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAIG,MAAM,QAAQ;AAChB,SAAK,eAAe,IACpB,KAAK,OAAO,SACZ,KAAK,cAAa,GACd,KAAK,OAAO,eAAe,UAAU,UACvC,MAAM,IAAI,QAAQ,CAACC,MAAU;AAC3B,WAAK,OAAO,iBAAiBhC,GAAe,OAAOgC,GAAS;AAAA,QAC1D,MAAM;AAAA,MAChB,CAAS;AAAA,IACT,CAAO;AAAA,EAEJ;AAAA,EACD,OAAOplB,EAAY,IAAI;AACrB,UAAM,KAAK;EACZ;AACH;ACxOA,IAAIxW,KAAiB,OAAO,UAAU,GAClCC,KAAW,CAACC,MAAQA,aAAe;AACvC,SAASC,GAAcC,GAAO;AAa5B,MAZI,CAACH,GAASG,CAAK,KAEf,OAAOA,EAAM,QAAS,YAEtB,OAAOA,EAAM,WAAY,YAEzB,OAAOA,EAAM,cAAe,YAE5B,OAAOA,EAAM,UAAW,YAExB,CAACA,EAAM,OAAO,MAAM,gBAAgB,KAEpC,CAAC,MAAM,QAAQA,EAAM,IAAI;AAC3B,WAAO;AACT,WAASC,IAAK,GAAGA,IAAKD,EAAM,KAAK,QAAQC,KAAM;AAC7C,QAAItP,IAAMqP,EAAM,KAAKC,CAAE;AACvB,QAAI,CAAC,MAAM,QAAQtP,CAAG;AACpB,aAAO;AACT,aAASzU,IAAI,GAAGA,IAAIyU,EAAI,QAAQzU;AAC9B,UAAI,OAAOyU,EAAIzU,CAAC,KAAM;AACpB,eAAO;AAAA,EAEZ;AACD,SAAO;AACT;AAMkB,IAAI,YAAY,OAAO;AACzC,IAAIwkB,KAAc,IAAI;AACtB,SAASF,GAAaG,GAAK;AACzB,EAAIA,EAAI,QAAQ,KAAK,MAAM,OACzBA,IAAM,WAAWA;AACnB,MAAIxuB,IAAI,IAAI,IAAIwuB,CAAG;AACnB,SAAAxuB,EAAE,WAAWA,EAAE,SAAS,QAAQ,QAAQ,GAAG,GACvCA,EAAE,SAAS,SAAS,GAAG,MACzBA,EAAE,WAAWA,EAAE,SAAS,MAAM,GAAG,EAAE,KACjCA,EAAE,SAAS,QAAQA,EAAE,aAAa,SAASA,EAAE,SAAS,SAASA,EAAE,aAAa,YAChFA,EAAE,OAAO,KACXA,EAAE,aAAa,QACfA,EAAE,OAAO,IACFA,EAAE;AACX;AACA,IAAIiuB,KAAY,MAAM;AAAA,EAIpB,YAAY3R,GAAS;AAHrB,IAAApiB,EAAA;AACA,IAAAA,EAAA,cAAO;AACP,IAAAA,EAAA,cAAO;AAEL,SAAK,QAAQoiB;AAAA,EACd;AACH,GACI0R,KAAQ,MAAM;AAAA,EAGhB,cAAc;AAFd,IAAA9zB,EAAA;AACA,IAAAA,EAAA;AAEE,SAAK,QAAQ,MACb,KAAK,OAAO;AAAA,EACb;AAAA,EACD,QAAQsG,GAAO;AACb,UAAMsuB,IAAU,IAAIb,GAAUztB,CAAK;AACnC,WAAK,KAAK,OAGC,KAAK,SAAS,KAAK,SAC5B,KAAK,OAAOsuB,GACZ,KAAK,KAAK,OAAO,KAAK,OACtB,KAAK,MAAM,OAAOA,MAElBA,EAAQ,OAAO,KAAK,MACpB,KAAK,KAAK,OAAOA,GACjB,KAAK,OAAOA,MATZ,KAAK,QAAQA,GACb,KAAK,OAAOA,IAUP;AAAA,EACR;AAAA,EACD,UAAU;AACR,QAAI,CAAC,KAAK;AACR,aAAO;AACT,QAAI,KAAK,UAAU,KAAK,MAAM;AAC5B,YAAMC,IAAU,KAAK;AACrB,kBAAK,QAAQ,MACb,KAAK,OAAO,MACLA,EAAQ;AAAA,IAChB;AACD,UAAMzB,IAAS,KAAK;AACpB,gBAAK,QAAQA,EAAO,MACbA,EAAO;AAAA,EACf;AACH,GAGI0B,KAAK,MAAM;AAAA,EACb,oBAAoB;AAClB,WAAOjP,GAAQ,MAAM;EACtB;AAAA,EACD,aAAakP,GAAW;AACtB,WAAOzlB,GAAWuW,GAAQ,aAAakP,CAAS,CAAC;AAAA,EAClD;AAAA,EACD,cAAczsB,GAAGysB,GAAW;AAC1B,UAAMpB,IAAQrrB;AACd,WAAAqrB,EAAM,SAASrkB,GAAWuW,GAAQ,aAAakP,CAAS,CAAC,GACzDpB,EAAM,KAAKqB,GAAarB,CAAK,GAC7BA,EAAM,MAAMrkB,GAAWuW,GAAQ,KAAKmP,GAAarB,CAAK,GAAGoB,CAAS,CAAC,GACnEpB,EAAMJ,EAAc,IAAI,IACjBI;AAAA,EACR;AAAA,EACD,YAAYA,GAAO;AACjB,QAAI,OAAOA,EAAMJ,EAAc,KAAM;AACnC,aAAOI,EAAMJ,EAAc;AAC7B,UAAMppB,IAAO6qB,GAAarB,CAAK;AAC/B,QAAIxpB,MAASwpB,EAAM;AACjB,aAAAA,EAAMJ,EAAc,IAAI,IACjB;AAET,QAAI;AACF,YAAM0B,IAAQpP,GAAQ,OAAO8N,EAAM,KAAKxpB,GAAMwpB,EAAM,MAAM;AAC1D,aAAAA,EAAMJ,EAAc,IAAI0B,GACjBA;AAAA,IACR,QAAa;AACZ,aAAAtB,EAAMJ,EAAc,IAAI,IACjB;AAAA,IACR;AAAA,EACF;AACH;AACA,SAAS2B,GAAeC,GAAK;AAC3B,MAAI,CAACzB,GAAcyB,CAAG;AACpB,UAAM,IAAI,MAAM,wDAAwD;AAC1E,SAAO,KAAK,UAAU,CAAC,GAAGA,EAAI,QAAQA,EAAI,YAAYA,EAAI,MAAMA,EAAI,MAAMA,EAAI,OAAO,CAAC;AACxF;AACA,SAASH,GAAarB,GAAO;AAC3B,MAAIyB,IAAYpmB,GAAOqlB,GAAY,OAAOa,GAAevB,CAAK,CAAC,CAAC;AAChE,SAAOrkB,GAAW8lB,CAAS;AAC7B;AACA,IAAIjvB,KAAI,IAAI2uB;AACY3uB,GAAE;AACPA,GAAE;AACDA,GAAE;AACJA,GAAE;AAGpB,IAAImwB,KAAa;AAGjB,SAASkE,GAAYC,GAAQ9G,GAAO;AAOlC,MANI8G,EAAO,OAAOA,EAAO,IAAI,QAAQ9G,EAAM,EAAE,MAAM,MAG/C8G,EAAO,SAASA,EAAO,MAAM,QAAQ9G,EAAM,IAAI,MAAM,MAGrD8G,EAAO,WAAWA,EAAO,QAAQ,QAAQ9G,EAAM,MAAM,MAAM;AAC7D,WAAO;AAET,WAAS/e,KAAK6lB;AACZ,QAAI7lB,EAAE,CAAC,MAAM,KAAK;AAChB,UAAI8lB,IAAU9lB,EAAE,MAAM,CAAC,GACnB+lB,IAASF,EAAO,IAAIC,CAAO,EAAE;AACjC,UAAIC,KAAU,CAAChH,EAAM,KAAK,KAAK,CAAC,CAACrrB,GAAGjC,CAAC,MAAMiC,MAAMsM,EAAE,MAAM,CAAC,KAAK+lB,EAAO,QAAQt0B,CAAC,MAAM,EAAE;AACrF,eAAO;AAAA,IACV;AAIH,SAFI,EAAAo0B,EAAO,SAAS9G,EAAM,aAAa8G,EAAO,SAE1CA,EAAO,SAAS9G,EAAM,aAAa8G,EAAO;AAGhD;AACA,SAASG,GAAaC,GAASlH,GAAO;AACpC,WAASC,IAAK,GAAGA,IAAKiH,EAAQ,QAAQjH;AACpC,QAAI4G,GAAYK,EAAQjH,CAAE,GAAGD,CAAK;AAChC,aAAO;AAGX,SAAO;AACT;AAGA,SAASsH,GAASM,GAAMhnB,GAAO;AAC7B,MAAIxH,IAAMwH,EAAM,SAAS,GACrB6W,IAAMmQ,EAAK,QAAQ,IAAIhnB,CAAK,IAAI,IAAIxH,GACpC,IAAIwuB,EAAK,MAAMnQ,CAAG,EAAE,QAAQ,GAAG,IAAIA,IAAM;AAC7C,SAAOmQ,EAAK,MAAM,GAAG,IAAI,EAAE;AAC7B;AACA,SAASJ,GAAkBI,GAAM;AAC/B,MAAInQ,IAAMmQ,EAAK,MAAM,GAAG,EAAE,EAAE,QAAQ,SAAS;AAC7C,MAAInQ,MAAQ;AACV,WAAO;AACT,MAAIqQ,IAASF,EAAK,MAAMnQ,IAAM,IAAI,CAAC,EAAE,QAAQ,GAAG;AAChD,MAAIqQ,MAAW;AACb,WAAO;AACT,MAAI/0B,IAAQ0kB,IAAM,IAAI,IAAIqQ,GACtBC,IAAOH,EAAK,MAAM70B,IAAQ,GAAG,EAAE,EAAE,QAAQ,GAAG;AAChD,MAAIg1B,MAAS;AACX,WAAO;AACT,MAAI3U,IAAMrgB,IAAQ,IAAIg1B;AACtB,SAAOH,EAAK,MAAM70B,IAAQ,GAAGqgB,CAAG;AAClC;AAGA,SAAS+U,GAAcC,GAAU5W,GAAW;AAC1C,SAAO;AAAA,IACL,MAAMmR;AAAA,IACN,YAAY,KAAK,MAAM,KAAK,IAAG,IAAK,GAAG;AAAA,IACvC,MAAM;AAAA,MACJ,CAAC,SAASyF,CAAQ;AAAA,MAClB,CAAC,aAAa5W,CAAS;AAAA,IACxB;AAAA,IACD,SAAS;AAAA,EACb;AACA;AAGA,eAAeiqC,KAAc;AAC3B,SAAO,IAAI,QAAQ,CAACD,MAAY;AAC9B,UAAMxc,IAAK,IAAI,kBACT0c,IAAU,MAAM;AACpB,MAAA1c,EAAG,MAAM,oBAAoB,WAAW0c,CAAO,GAC/CF;IACN;AACI,IAAAxc,EAAG,MAAM,iBAAiB,WAAW0c,CAAO,GAC5C1c,EAAG,MAAM,YAAY,CAAC,GACtBA,EAAG,MAAM;EACb,CAAG;AACH;AACA,IAAI2c,KAAa,CAAChnD,OAChBA,EAAEirB,EAAc,IAAI,IACb,KAILg8B,KAAgB,MAAM;AAAA,EAoBxB,YAAYj7B,GAAK7f,GAAM;AAnBvB,IAAAzU,EAAA;AACA,IAAAA,EAAA,oBAAa;AACb,IAAAA,EAAA,iBAAU;AACV,IAAAA,EAAA,kBAAW,CAACP,MAAQ,QAAQ,MAAM,eAAe,KAAK,GAAG,KAAKA,CAAG,EAAE;AACnE,IAAAO,EAAA,iBAAU;AACV,IAAAA,EAAA,yBAAkB;AAClB,IAAAA,EAAA,2BAAoB;AACpB,IAAAA,EAAA,kBAA2B,oBAAI;AAC/B,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA,2BAAoC,oBAAI;AACxC,IAAAA,EAAA,4BAAqC,oBAAI;AACzC,IAAAA,EAAA;AACA,IAAAA,EAAA,8BAAuB,IAAI8zB;AAC3B,IAAA9zB,EAAA,sBAAe;AACf,IAAAA,EAAA;AACA,IAAAA,EAAA,gBAAS;AACT,IAAAA,EAAA;AACA,IAAAA,EAAA;AAEE,SAAK,MAAMm0B,GAAaG,CAAG,GAC3B,KAAK,cAAc7f,EAAK,aACxB,KAAK,aAAaA,EAAK,2BAA2B;AAAA,EACnD;AAAA,EACD,aAAa,QAAQ6f,GAAK7f,GAAM;AAC9B,UAAM+xB,IAAQ,IAAI+oB,GAAcj7B,GAAK7f,CAAI;AACzC,iBAAM+xB,EAAM,WACLA;AAAA,EACR;AAAA,EACD,sBAAsBrmC,GAAQ;AAC5B,aAAS,CAACF,GAAG+rC,CAAG,KAAK,KAAK;AACxB,MAAAA,EAAI,MAAM7rC,CAAM;AAElB,SAAK,SAAS;AACd,aAAS,CAACF,GAAGuvD,CAAE,KAAK,KAAK;AACvB,MAAAA,EAAG,OAAO,IAAI,MAAMrvD,CAAM,CAAC;AAE7B,SAAK,mBAAmB;AACxB,aAAS,CAACF,GAAGg/C,CAAE,KAAK,KAAK;AACvB,MAAAA,EAAG,OAAO,IAAI,MAAM9+C,CAAM,CAAC;AAE7B,SAAK,kBAAkB;EACxB;AAAA,EACD,IAAI,YAAY;AACd,WAAO,KAAK;AAAA,EACb;AAAA,EACD,MAAM,UAAU;AACd,WAAI,KAAK,oBACA,KAAK,qBACd,KAAK,YAAY,QACjB,KAAK,oBAAoB,IAAI,QAAQ,CAACgvD,GAASM,MAAW;AACxD,WAAK,0BAA0B,WAAW,MAAM;AvEnStD,YAAA1vD;AuEoSQ,QAAA0vD,EAAO,sBAAsB,GAC7B,KAAK,oBAAoB,SACzB1vD,IAAA,KAAK,YAAL,QAAAA,EAAA,YACA,KAAK,sBAAsB,4BAA4B;AAAA,MAC/D,GAAS,KAAK,iBAAiB;AACzB,UAAI;AACF,aAAK,KAAK,IAAI,KAAK,WAAW,KAAK,GAAG;AAAA,MACvC,SAAQ2vD,GAAK;AACZ,QAAAD,EAAOC,CAAG;AACV;AAAA,MACD;AACD,WAAK,GAAG,SAAS,MAAM;AACrB,qBAAa,KAAK,uBAAuB,GACzC,KAAK,aAAa,IAClBP;MACR,GACM,KAAK,GAAG,UAAU,CAACN,MAAO;AvEpThC,YAAA9uD;AuEqTQ,QAAA0vD,EAAOZ,EAAG,WAAW,iBAAiB,GAClC,KAAK,eACP,KAAK,aAAa,IAClB,KAAK,oBAAoB,SACzB9uD,IAAA,KAAK,YAAL,QAAAA,EAAA,YACA,KAAK,sBAAsB,0BAA0B;AAAA,MAE/D,GACM,KAAK,GAAG,UAAU,YAAY;AvE7TpC,YAAAA;AuE8TQ,QAAI,KAAK,eACP,KAAK,aAAa,IAClB,KAAK,oBAAoB,SACzBA,IAAA,KAAK,YAAL,QAAAA,EAAA,YACA,KAAK,sBAAsB,yBAAyB;AAAA,MAE9D,GACM,KAAK,GAAG,YAAY,KAAK,WAAW,KAAK,IAAI;AAAA,IACnD,CAAK,GACM,KAAK;AAAA,EACb;AAAA,EACD,MAAM,WAAW;AAEf,SADA,KAAK,eAAe,IAEJ,KAAK,iBAAf;AAGJ,YAAMqvD,GAAW;AAEnB,SAAK,eAAe;AAAA,EACrB;AAAA,EACD,aAAa;AvEnVf,QAAArvD,GAAAK,GAAA2G;AuEoVI,UAAMw0B,IAAO,KAAK,qBAAqB,QAAO;AAC9C,QAAI,CAACA;AACH,aAAO;AAET,UAAMo0B,IAAQx0B,GAAkBI,CAAI;AACpC,QAAIo0B,GAAO;AACT,YAAMC,IAAK,KAAK,SAAS,IAAID,CAAK;AAClC,UAAI,CAACC;AACH;AAEF,YAAMj0B,IAAKV,GAASM,GAAM,IAAI,GACxBs0B,KAAc9vD,IAAA6vD,EAAG,qBAAH,gBAAA7vD,EAAA,KAAA6vD,GAAsBj0B;AAE1C,WADAv7B,IAAAwvD,EAAG,kBAAH,QAAAxvD,EAAA,KAAAwvD,GAAmB,MAAMj0B,IACrBk0B;AACF;AAAA,IAEH;AACD,QAAI;AACF,UAAIxkD,IAAO,KAAK,MAAMkwB,CAAI;AAC1B,cAAQlwB,EAAK,CAAC,GAAC;AAAA,QACb,KAAK,SAAS;AACZ,gBAAMukD,IAAK,KAAK,SAAS,IAAIvkD,EAAK,CAAC,CAAC,GAC9BsoB,IAAQtoB,EAAK,CAAC;AACpB,UAAI,KAAK,YAAYsoB,CAAK,KAAKiH,GAAag1B,EAAG,SAASj8B,CAAK,KAC3Di8B,EAAG,QAAQj8B,CAAK;AAElB;AAAA,QACD;AAAA,QACD,KAAK,SAAS;AACZ,gBAAMgI,IAAKtwB,EAAK,CAAC,GACXk6B,IAAUl6B,EAAK,CAAC,GAChB4zC,IAAK,KAAK,kBAAkB,IAAItjB,CAAE;AACxC,UAAIsjB,MACFA,EAAG,QAAQ1Z,EAAQ,KAAK,GACxB,KAAK,kBAAkB,OAAO5J,CAAE;AAElC;AAAA,QACD;AAAA,QACD,KAAK,QAAQ;AACX,gBAAMi0B,IAAK,KAAK,SAAS,IAAIvkD,EAAK,CAAC,CAAC;AACpC,cAAI,CAACukD;AACH;AACF,UAAAA,EAAG,aAAY;AACf;AAAA,QACD;AAAA,QACD,KAAK,MAAM;AACT,gBAAMj0B,IAAKtwB,EAAK,CAAC,GACX2jD,IAAK3jD,EAAK,CAAC,GACXlL,IAASkL,EAAK,CAAC,GACfmkD,IAAK,KAAK,mBAAmB,IAAI7zB,CAAE;AACzC,UAAIqzB,IACFQ,EAAG,QAAQrvD,CAAM,IAEjBqvD,EAAG,OAAO,IAAI,MAAMrvD,CAAM,CAAC,GAC7B,KAAK,mBAAmB,OAAOw7B,CAAE;AACjC;AAAA,QACD;AAAA,QACD,KAAK,UAAU;AACb,gBAAMA,IAAKtwB,EAAK,CAAC,GACXukD,IAAK,KAAK,SAAS,IAAIj0B,CAAE;AAC/B,cAAI,CAACi0B;AACH;AACF,UAAAA,EAAG,SAAS,IACZA,EAAG,MAAMvkD,EAAK,CAAC,CAAC;AAChB;AAAA,QACD;AAAA,QACD,KAAK;AACH,eAAK,SAASA,EAAK,CAAC,CAAC;AACrB;AAAA,QACF,KAAK,QAAQ;AACX,eAAK,YAAYA,EAAK,CAAC,IACvBtE,IAAA,KAAK,YAAL,QAAAA,EAAA,WAAesE,EAAK,CAAC;AACrB;AAAA,QACD;AAAA,MACF;AAAA,IACF,QAAa;AACZ;AAAA,IACD;AAAA,EACF;AAAA,EACD,MAAM,KAAK+W,GAAS;AAClB,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,8BAA8B;AAChD,SAAK,kBAAkB,KAAK,MAAM;AvEtatC,UAAAriB;AuEuaM,OAAAA,IAAA,KAAK,OAAL,QAAAA,EAAS,KAAKqiB;AAAA,IACpB,CAAK;AAAA,EACF;AAAA,EACD,MAAM,KAAK0tC,GAAe;AACxB,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,+CAA+C;AACjE,UAAM36B,IAAM,MAAM26B,EAAch0B,GAAc,KAAK,KAAK,KAAK,SAAS,CAAC,GACjEi0B,IAAM,IAAI,QAAQ,CAACZ,GAASM,MAAW;AAC3C,WAAK,mBAAmB,IAAIt6B,EAAI,IAAI,EAAE,SAAAg6B,GAAS,QAAAM,EAAM,CAAE;AAAA,IAC7D,CAAK;AACD,gBAAK,KAAK,aAAa,KAAK,UAAUt6B,CAAG,IAAI,GAAG,GACzC46B;AAAA,EACR;AAAA,EACD,MAAM,QAAQp8B,GAAO;AACnB,UAAMo8B,IAAM,IAAI,QAAQ,CAACZ,GAASM,MAAW;AAC3C,WAAK,mBAAmB,IAAI97B,EAAM,IAAI,EAAE,SAAAw7B,GAAS,QAAAM,EAAM,CAAE;AAAA,IAC/D,CAAK;AACD,gBAAK,KAAK,cAAc,KAAK,UAAU97B,CAAK,IAAI,GAAG,GAC5Co8B;AAAA,EACR;AAAA,EACD,MAAM,MAAMl1B,GAASxQ,GAAQ;AAC3B,SAAK;AACL,UAAMsR,KAAKtR,KAAA,gBAAAA,EAAQ,OAAM,WAAW,KAAK,QACnC0lC,IAAM,IAAI,QAAQ,CAACZ,GAASM,MAAW;AAC3C,WAAK,kBAAkB,IAAI9zB,GAAI,EAAE,SAAAwzB,GAAS,QAAAM,EAAM,CAAE;AAAA,IACxD,CAAK;AACD,gBAAK,KAAK,eAAe9zB,IAAK,OAAO,KAAK,UAAUd,CAAO,EAAE,UAAU,CAAC,CAAC,GAClEk1B;AAAA,EACR;AAAA,EACD,UAAUl1B,GAASxQ,GAAQ;AACzB,UAAM2lC,IAAe,KAAK,oBAAoBn1B,GAASxQ,CAAM;AAC7D,WAAA2lC,EAAa,KAAI,GACVA;AAAA,EACR;AAAA,EACD,oBAAoBn1B,GAASxQ,GAAQ;AACnC,SAAK;AACL,UAAMsR,IAAKtR,EAAO,MAAM,SAAS,KAAK,QAChC2lC,IAAe,IAAIC,GAAa,MAAMt0B,GAAId,GAASxQ,CAAM;AAC/D,gBAAK,SAAS,IAAIsR,GAAIq0B,CAAY,GAC3BA;AAAA,EACR;AAAA,EACD,QAAQ;AvEhdV,QAAAjwD;AuEidI,SAAK,sBAAsB,+BAA+B,GAC1D,KAAK,aAAa,KAClBA,IAAA,KAAK,OAAL,QAAAA,EAAS;AAAA,EACV;AAAA,EACD,WAAW8uD,GAAI;AACb,SAAK,qBAAqB,QAAQA,EAAG,IAAI,GACpC,KAAK,gBACR,KAAK,SAAQ;AAAA,EAEhB;AACH,GACIoB,KAAe,MAAM;AAAA,EAavB,YAAYzpB,GAAO7K,GAAId,GAASxQ,GAAQ;AAZxC,IAAArqB,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA,gBAAS;AACT,IAAAA,EAAA,eAAQ;AACR,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AACA,IAAAA,EAAA;AAEE,SAAK,QAAQwmC,GACb,KAAK,UAAU3L,GACf,KAAK,KAAKc,GACV,KAAK,mBAAmBtR,EAAO,kBAC/B,KAAK,gBAAgBA,EAAO,eAC5B,KAAK,cAAcA,EAAO,eAAemc,EAAM,iBAC/C,KAAK,SAASnc,EAAO,QACrB,KAAK,UAAUA,EAAO,SACtB,KAAK,UAAUA,EAAO,YAAY,CAACsJ,MAAU;AAC3C,cAAQ;AAAA,QACN,oDAAoD,KAAK,EAAE,cAAc,KAAK,MAAM,GAAG;AAAA,QACvFA;AAAA,MACR;AAAA,IACA;AAAA,EACG;AAAA,EACD,OAAO;AACL,SAAK,MAAM,KAAK,aAAa,KAAK,KAAK,OAAO,KAAK,UAAU,KAAK,OAAO,EAAE,UAAU,CAAC,CAAC,GACvF,KAAK,oBAAoB,WAAW,KAAK,aAAa,KAAK,IAAI,GAAG,KAAK,WAAW;AAAA,EACnF;AAAA,EACD,eAAe;AvE7fjB,QAAA5zB;AuE8fI,IAAI,KAAK,UAET,aAAa,KAAK,iBAAiB,GACnC,KAAK,QAAQ,KACbA,IAAA,KAAK,WAAL,QAAAA,EAAA;AAAA,EACD;AAAA,EACD,MAAMI,IAAS,oBAAoB;AvEpgBrC,QAAAJ;AuEqgBI,IAAI,CAAC,KAAK,UAAU,KAAK,MAAM,cAC7B,KAAK,MAAM,KAAK,cAAc,KAAK,UAAU,KAAK,EAAE,IAAI,GAAG,GAC3D,KAAK,SAAS,KAEhB,KAAK,MAAM,SAAS,OAAO,KAAK,EAAE,IAClCA,IAAA,KAAK,YAAL,QAAAA,EAAA,WAAeI;AAAA,EAChB;AACH,GAGI+vD,KAAqB,MAAM;AAAA,EAO7B,YAAYz7C,GAAM;AANlB,IAAAzU,EAAA,gBAAyB,oBAAI;AAC7B,IAAAA,EAAA,gBAAyB,oBAAI;AAC7B,IAAAA,EAAA,qBAAc;AACd,IAAAA,EAAA;AACA,IAAAA,EAAA,0BAAmC,oBAAI;AACvC,IAAAA,EAAA;AAEE,SAAK,cAAcyU,EAAK,aACxB,KAAK,aAAaA,EAAK;AAAA,EACxB;AAAA,EACD,MAAM,YAAY6f,GAAKjK,GAAQ;AAC7B,IAAAiK,IAAMH,GAAaG,CAAG;AACtB,QAAIkS,IAAQ,KAAK,OAAO,IAAIlS,CAAG;AAC/B,WAAKkS,MACHA,IAAQ,IAAI+oB,GAAcj7B,GAAK;AAAA,MAC7B,aAAa,KAAK,iBAAiB,IAAIA,CAAG,IAAIg7B,KAAa,KAAK;AAAA,MAChE,yBAAyB,KAAK;AAAA,IACtC,CAAO,GACGjlC,KAAA,QAAAA,EAAQ,sBACVmc,EAAM,oBAAoBnc,EAAO,oBACnC,KAAK,OAAO,IAAIiK,GAAKkS,CAAK,IAE5B,MAAMA,EAAM,WACLA;AAAA,EACR;AAAA,EACD,MAAMmB,GAAQ;AACZ,IAAAA,EAAO,IAAIxT,EAAY,EAAE,QAAQ,CAACG,MAAQ;AvE1iB9C,UAAAv0B;AuE2iBM,OAAAA,IAAA,KAAK,OAAO,IAAIu0B,CAAG,MAAnB,QAAAv0B,EAAsB;AAAA,IAC5B,CAAK;AAAA,EACF;AAAA,EACD,cAAc4nC,GAAQ9M,GAASxQ,GAAQ;AACrC,WAAO,KAAK,iBAAiB,OAAO,YAAYsd,EAAO,IAAI,CAACrT,MAAQ,CAACA,GAAKuG,CAAO,CAAC,CAAC,GAAGxQ,CAAM;AAAA,EAC7F;AAAA,EACD,iBAAiB8lC,GAAU9lC,GAAQ;AACjC,IAAI,KAAK,gBACPA,EAAO,gBAAgB,CAACmc,GAAO7K,MAAO;AACpC,UAAIy0B,IAAM,KAAK,OAAO,IAAIz0B,CAAE;AAC5B,MAAKy0B,MACHA,IAAsB,oBAAI,OAC1B,KAAK,OAAO,IAAIz0B,GAAIy0B,CAAG,IAEzBA,EAAI,IAAI5pB,CAAK;AAAA,IACrB;AAEI,UAAM6pB,IAA4B,oBAAI,OAChCpkB,IAAO,CAAA,GACPqkB,IAAe,OAAO,KAAKH,CAAQ,EAAE,QACrCI,IAAgB,CAAA;AACtB,QAAIC,IAAa,CAAC58B,MAAO;AvEhkB7B,UAAA7zB;AuEikBM,MAAAwwD,EAAc38B,CAAE,IAAI,IAChB28B,EAAc,OAAO,CAAC3lD,MAAMA,CAAC,EAAE,WAAW0lD,OAC5CvwD,IAAAsqB,EAAO,WAAP,QAAAtqB,EAAA,KAAAsqB,IACAmmC,IAAa,MAAM;AAAA,MAC3B;AAAA,IAEA;AACI,UAAMC,IAAiB,CAAA;AACvB,QAAIC,IAAc,CAAC98B,GAAIzzB,MAAW;AvEzkBtC,UAAAJ;AuE0kBM,MAAAywD,EAAW58B,CAAE,GACb68B,EAAe78B,CAAE,IAAIzzB,GACjBswD,EAAe,OAAO,CAAC7lD,MAAMA,CAAC,EAAE,WAAW0lD,OAC7CvwD,IAAAsqB,EAAO,YAAP,QAAAtqB,EAAA,KAAAsqB,GAAiBomC,IACjBC,IAAc,MAAM;AAAA,MAC5B;AAAA,IAEA;AACI,UAAMC,IAA+B,CAACh1B,MAAO;AvEllBjD,UAAA57B;AuEmlBM,WAAIA,IAAAsqB,EAAO,qBAAP,QAAAtqB,EAAA,KAAAsqB,GAA0BsR;AAC5B,eAAO;AAET,YAAMi1B,IAAOP,EAAU,IAAI10B,CAAE;AAC7B,aAAA00B,EAAU,IAAI10B,CAAE,GACTi1B;AAAA,IACb,GACUC,IAAY,QAAQ;AAAA,MACxB,OAAO,QAAQV,CAAQ,EAAE,IAAI,OAAOrT,GAAKlpB,GAAIhtB,MAAQ;AACnD,YAAIA,EAAI,QAAQk2C,CAAG,MAAMlpB,GAAI;AAC3B,UAAA88B,EAAY98B,GAAI,eAAe;AAC/B;AAAA,QACD;AACD,YAAI,CAACU,GAAKuG,CAAO,IAAIiiB;AACrB,QAAAxoB,IAAMH,GAAaG,CAAG;AACtB,YAAIkS;AACJ,YAAI;AACF,UAAAA,IAAQ,MAAM,KAAK,YAAYlS,GAAK;AAAA,YAClC,mBAAmBjK,EAAO,UAAU,KAAK,IAAIA,EAAO,UAAU,KAAKA,EAAO,UAAU,GAAG,IAAI;AAAA,UACvG,CAAW;AAAA,QACF,SAAQqlC,GAAK;AACZ,UAAAgB,EAAY98B,IAAI87B,KAAA,gBAAAA,EAAK,YAAW,OAAOA,CAAG,CAAC;AAC3C;AAAA,QACD;AACD,YAAIM,IAAexpB,EAAM,UAAU3L,GAAS;AAAA,UAC1C,GAAGxQ;AAAA,UACH,QAAQ,MAAMmmC,EAAW58B,CAAE;AAAA,UAC3B,SAAS,CAACzzB,MAAWuwD,EAAY98B,GAAIzzB,CAAM;AAAA,UAC3C,kBAAkBwwD;AAAA,UAClB,aAAatmC,EAAO;AAAA,QAC9B,CAAS;AACD,QAAA4hB,EAAK,KAAK+jB,CAAY;AAAA,MAC9B,CAAO;AAAA,IACP;AACI,WAAO;AAAA,MACL,MAAM,QAAQ;AACZ,cAAMa,GACN5kB,EAAK,QAAQ,CAACD,MAAQ;AACpB,UAAAA,EAAI,MAAK;AAAA,QACnB,CAAS;AAAA,MACF;AAAA,IACP;AAAA,EACG;AAAA,EACD,kBAAkBrE,GAAQ9M,GAASxQ,GAAQ;AACzC,UAAMymC,IAAY,KAAK,cAAcnpB,GAAQ9M,GAAS;AAAA,MACpD,GAAGxQ;AAAA,MACH,SAAS;AACP,QAAAymC,EAAU,MAAK;AAAA,MAChB;AAAA,IACP,CAAK;AACD,WAAOA;AAAA,EACR;AAAA,EACD,MAAM,UAAUnpB,GAAQlN,GAAQpQ,GAAQ;AACtC,WAAO,IAAI,QAAQ,OAAO8kC,MAAY;AACpC,YAAM1kB,IAAS,CAAA;AACf,WAAK,kBAAkB9C,GAAQ,CAAClN,CAAM,GAAG;AAAA,QACvC,GAAGpQ;AAAA,QACH,QAAQsJ,GAAO;AACb,UAAA8W,EAAO,KAAK9W,CAAK;AAAA,QAClB;AAAA,QACD,QAAQ1zB,GAAG;AACT,UAAAkvD,EAAQ1kB,CAAM;AAAA,QACf;AAAA,MACT,CAAO;AAAA,IACP,CAAK;AAAA,EACF;AAAA,EACD,MAAM,IAAI9C,GAAQlN,GAAQpQ,GAAQ;AAChC,IAAAoQ,EAAO,QAAQ;AACf,UAAMgQ,IAAS,MAAM,KAAK,UAAU9C,GAAQlN,GAAQpQ,CAAM;AAC1D,WAAAogB,EAAO,KAAK,CAAC7/B,GAAGhB,MAAMA,EAAE,aAAagB,EAAE,UAAU,GAC1C6/B,EAAO,CAAC,KAAK;AAAA,EACrB;AAAA,EACD,QAAQ9C,GAAQhU,GAAO;AACrB,WAAOgU,EAAO,IAAIxT,EAAY,EAAE,IAAI,OAAOG,GAAKV,GAAIhtB,MAC9CA,EAAI,QAAQ0tB,CAAG,MAAMV,IAChB,QAAQ,OAAO,eAAe,KAE/B,MAAM,KAAK,YAAYU,CAAG,GACzB,QAAQX,CAAK,CACvB;AAAA,EACF;AAAA,EACD,uBAAuB;AACrB,UAAMjf,IAAsB,oBAAI;AAChC,gBAAK,OAAO,QAAQ,CAAC8xB,GAAOlS,MAAQ5f,EAAI,IAAI4f,GAAKkS,EAAM,SAAS,CAAC,GAC1D9xB;AAAA,EACR;AAAA,EACD,UAAU;AACR,SAAK,OAAO,QAAQ,CAACq8C,MAASA,EAAK,MAAK,CAAE,GAC1C,KAAK,SAAyB,oBAAI;EACnC;AACH,GAGI/0B;AACJ,IAAI;AACF,EAAAA,KAAa;AACf,QAAQ;AACR;AC/qBW,MAAMg1B,GAAY;AAAA,EAE3B,YAAYv8C,GAAK;AADjB,IAAAzU,EAAA;AAEE,SAAK,OAAO,IAAIkwD,GAAmB;AAAA,MACjC,cAAaz7C,KAAA,gBAAAA,EAAM,gBAAe6gB;AAAA,IACxC,CAAK,GACD,KAAK,KAAK,eAAc7gB,KAAA,gBAAAA,EAAM,gBAAe,IAC7C,KAAK,KAAK,oBAAmBA,KAAA,gBAAAA,EAAM,qBAAoB,oBAAI;EAC5D;AAAA,EACD,IAAI,SAAS;AACX,UAAMw8C,IAAS,oBAAI;AACnB,eAAW,CAACt1B,GAAIgM,CAAM,KAAK,KAAK,KAAK;AACnC,MAAAspB,EAAO,IAAIt1B,GAAI,IAAI,IAAI;AAAA,QACrB,GAAGgM;AAAA,MACX,EAAQ,IAAI,CAACnB,MAAQA,EAAM,GAAG,CAAC,CAAC;AAE5B,WAAOyqB;AAAA,EACR;AAAA,EACD,OAAO,IAAIp2B,GAASpmB,IAAO,IAAI;AxEvBjC,QAAA1U,GAAAK;AwEwBI,SAAIL,IAAA0U,EAAK,WAAL,QAAA1U,EAAa,QAAS,OAAM,IAAI,aAAa,+BAA+B,YAAY;AAC5F,UAAMmxD,IAAQ,OAAO,cACfvE,IAAU,IAAIJ,GAAQ93C,EAAK,MAAM,GACjCu3B,IAAM,KAAK,KAAK,cAAcv3B,EAAK,UAAU,CAAE,GAAEomB,GAAS;AAAA,MAC9D,IAAIq2B;AAAA,MACJ,QAASv9B,GAAO;AACd,QAAAg5B,EAAQ,KAAK;AAAA,UACX;AAAA,UACAuE;AAAA,UACAv9B;AAAA,QACV,CAAS;AAAA,MACF;AAAA,MACD,SAAU;AACR,QAAAg5B,EAAQ,KAAK;AAAA,UACX;AAAA,UACAuE;AAAA,QACV,CAAS;AAAA,MACF;AAAA,MACD,QAASC,GAAS;AAChB,QAAAxE,EAAQ,KAAK;AAAA,UACX;AAAA,UACAuE;AAAA,UACAC,EAAQ,KAAK,IAAI;AAAA,QAC3B,CAAS;AAAA,MACF;AAAA,IACP,CAAK,GACKC,IAAQ,MAAI;AAChB,MAAAplB,EAAI,MAAK,GACTqlB;IACN,GACUA,IAAU,MAAI;AxEtDxB,UAAAtxD;AwEuDM,OAAAA,IAAA0U,EAAK,WAAL,QAAA1U,EAAa,oBAAoB,SAASqxD;AAAA,IAChD;AACI,KAAAhxD,IAAAqU,EAAK,WAAL,QAAArU,EAAa,iBAAiB,SAASgxD;AACvC,QAAI;AACF,uBAAiB3xD,KAAOktD;AACtB,cAAMltD;AAAA,IAEd,UAAa;AACP,MAAA2xD;IACD;AAAA,EACF;AAAA;AAAA,EAED,MAAM,MAAMz9B,GAAOlf,IAAO,IAAI;AxEnEhC,QAAA1U;AwEoEI,SAAIA,IAAA0U,EAAK,WAAL,QAAA1U,EAAa;AACf,YAAM,IAAI,aAAa,+BAA+B,YAAY;AAEpE,SAAK,KAAK,QAAQ0U,EAAK,UAAU,CAAA,GAAIkf,CAAK;AAAA,EAC3C;AAAA,EACD,MAAM,MAAMkH,GAASpmB,IAAO,IAAI;AAC9B,UAAMg2B,IAAS,CAAA;AACf,qBAAiBhrC,KAAO,KAAK,IAAIo7B,GAASpmB,CAAI,GAAE;AAC9C,UAAIhV,EAAI,CAAC,MAAM,OAAQ;AAEvB,UADIA,EAAI,CAAC,MAAM,WAASgrC,EAAO,KAAKhrC,EAAI,CAAC,CAAC,GACtCA,EAAI,CAAC,MAAM,SAAU,OAAM,IAAI,MAAM,qBAAqB;AAAA,IAC/D;AACD,WAAOgrC;AAAA,EACR;AAAA;AAAA,EAC4C,WAAW9C,GAAQ;AAC9D,SAAK,KAAK,MAAMA,CAAM;AAAA,EACvB;AAAA;AAAA,EAED,MAAM,QAAQ;AACZ,SAAK,KAAK;EACX;AACH;;;;;;;;;;;;;;;;;;;","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,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72]} \ No newline at end of file