ds-harness-remote 0.3.8

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/index.ts", "../../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/external.js", "../../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/helpers/util.js", "../../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/ZodError.js", "../../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/locales/en.js", "../../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/errors.js", "../../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/helpers/parseUtil.js", "../../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/helpers/errorUtil.js", "../../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/types.js", "../../protocol/src/index.ts", "../../client-core/src/index.ts", "../../webrtc/src/transport.ts", "../../webrtc/src/util.ts", "../../webrtc/src/rtc-adapter.ts", "../../webrtc/src/rtc-chunking.ts", "../../webrtc/src/rtc-data-channel.ts", "../../webrtc/src/adaptive-transport.ts", "../src/api-proxy-switch.ts", "../../../node_modules/.pnpm/@noble+ciphers@1.3.0/node_modules/@noble/ciphers/src/cryptoNode.ts", "../../../node_modules/.pnpm/@noble+ciphers@1.3.0/node_modules/@noble/ciphers/src/webcrypto.ts", "../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/src/cryptoNode.ts", "../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/src/utils.ts", "../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/src/_md.ts", "../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/src/_u64.ts", "../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/src/sha2.ts", "../../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/src/utils.ts", "../../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/src/abstract/modular.ts", "../../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/src/abstract/curve.ts", "../../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/src/abstract/edwards.ts", "../../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/src/abstract/montgomery.ts", "../../../node_modules/.pnpm/@noble+curves@1.9.7/node_modules/@noble/curves/src/ed25519.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/constants.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/errors.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/handshakePattern.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/cipherState.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/symmetricState.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/transportState.ts", "../../../node_modules/.pnpm/@noble+hashes@2.3.0/node_modules/@noble/hashes/_u64.js", "../../../node_modules/.pnpm/@noble+hashes@2.3.0/node_modules/@noble/hashes/utils.js", "../../../node_modules/.pnpm/@noble+hashes@2.3.0/node_modules/@noble/hashes/_md.js", "../../../node_modules/.pnpm/@noble+hashes@2.3.0/node_modules/@noble/hashes/sha2.js", "../../../node_modules/.pnpm/@noble+curves@2.3.0/node_modules/@noble/curves/utils.js", "../../../node_modules/.pnpm/@noble+curves@2.3.0/node_modules/@noble/curves/abstract/modular.js", "../../../node_modules/.pnpm/@noble+curves@2.3.0/node_modules/@noble/curves/abstract/curve.js", "../../../node_modules/.pnpm/@noble+curves@2.3.0/node_modules/@noble/curves/abstract/edwards.js", "../../../node_modules/.pnpm/@noble+curves@2.3.0/node_modules/@noble/curves/abstract/montgomery.js", "../../../node_modules/.pnpm/@noble+curves@2.3.0/node_modules/@noble/curves/ed25519.js", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/dhX25519.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/protocolNames.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/nqHandshake.ts", "../../../node_modules/.pnpm/@noble+hashes@2.3.0/node_modules/@noble/hashes/_blake.js", "../../../node_modules/.pnpm/@noble+hashes@2.3.0/node_modules/@noble/hashes/blake2.js", "../../../node_modules/.pnpm/@noble+hashes@2.3.0/node_modules/@noble/hashes/hmac.js", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/crypto/hash.ts", "../../../node_modules/.pnpm/@noble+ciphers@2.3.0/node_modules/@noble/ciphers/utils.js", "../../../node_modules/.pnpm/@noble+ciphers@2.3.0/node_modules/@noble/ciphers/_arx.js", "../../../node_modules/.pnpm/@noble+ciphers@2.3.0/node_modules/@noble/ciphers/_poly1305.js", "../../../node_modules/.pnpm/@noble+ciphers@2.3.0/node_modules/@noble/ciphers/chacha.js", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/crypto/cipher.ts", "../../../node_modules/.pnpm/@lukeburns+clatterjs@1.0.0/node_modules/@lukeburns/clatterjs/src/noiseNq.ts", "../../crypto/src/noise.ts", "../../crypto/src/index.ts", "../src/client-secure-transport.ts", "../src/ids.ts", "../src/remote-api-proxy.ts", "../src/server-api.ts", "../src/config.ts", "../src/version.ts", "../src/typert-gateway-switch.ts", "../src/client-runtime.ts", "../src/control-runtime.ts", "../src/identity-store.ts", "../src/server-credentials.ts", "../src/logging.ts", "../src/connection-controller.ts", "../src/rpc-router.ts", "../src/server-connection.ts", "../src/remote-directory-browser.ts", "../src/harness-api-bridge.ts", "../src/werift-rtc.ts", "../src/service.ts"],
+  "sourcesContent": ["import type { Context } from '@deepseek-ai/cordis'\nimport type { ApiProxy } from '@deepseek-ai/dsh-host-apiproxy/api'\nimport { settingsNamespace, type SettingsScope } from '@deepseek-ai/dsh-settings'\nimport { ClientModeRuntime, type HostConnectionHandle } from './client-runtime.js'\nimport { Config, resolveConfig, type Config as ConfigInput, type ResolvedConfig } from './config.js'\nimport { PluginControlRuntime } from './control-runtime.js'\nimport { IdentityStore, serverStorageDirectory } from './identity-store.js'\nimport { SafeLogger } from './logging.js'\nimport { HostPluginRuntime } from './service.js'\nimport { ClientServerApi } from './server-api.js'\nimport { ServerCredentialStore } from './server-credentials.js'\nimport type { TypertGatewayLike } from './harness-api-bridge.js'\nimport { TypertGatewaySwitch } from './typert-gateway-switch.js'\n\ndeclare module '@deepseek-ai/cordis' {\n  interface Context {\n    dshRemote: HostPluginRuntime\n    dshRemoteClient: ClientModeRuntime\n    typertGateway: TypertGatewayLike\n  }\n}\n\nexport const name = 'dsh-remote'\nexport { Config }\n\nexport function apply(ctx: Context, input: ConfigInput = {}): void {\n  ctx.inject(['settings', 'apiProxy', 'connection', 'typertGateway'], runtimeContext => activate(runtimeContext, input))\n}\n\nasync function activate(ctx: Context, input: ConfigInput): Promise<void> {\n  const settings = ctx.get('settings')\n  const settingsScope: SettingsScope<ConfigInput> | undefined = settings?.register(settingsNamespace('dsh-remote'), Config, {\n    base: input,\n    applies: 'restart',\n    validate: value => { resolveConfig(value) },\n  })\n  const config: ResolvedConfig = resolveConfig(settingsScope?.get() ?? input)\n  if (!config.enabled) return\n  // Mirrors SafeLogger output to the process stdout/stderr as well as the DSH\n  // logger: the web process stdout is captured by the Desktop shell into\n  // desktop.log, so remote RPC/transport diagnostics stay greppable there.\n  const logger = new SafeLogger({\n    debug: message => { ctx.logger.debug(message); console.debug(message) },\n    info: message => { ctx.logger.info(message); console.info(message) },\n    warn: message => { ctx.logger.warn(message); console.warn(message) },\n    error: message => { ctx.logger.error(message); console.error(message) },\n  }, config.logLevel)\n  const defaultIdentityDirectory = new IdentityStore().directory\n  const hostIdentities = new IdentityStore({\n    directory: config.serverUrl === undefined\n      ? defaultIdentityDirectory\n      : serverStorageDirectory(defaultIdentityDirectory, config.serverUrl, 'host'),\n  })\n  const apiProxy = ctx.get('apiProxy') as ApiProxy\n  const connection = ctx.get('connection') as HostConnectionHandle | undefined\n  // The official Typert gateway (`typertGateway` from dsh-api-gateway) is the\n  // dispatch path behind `/api/commands/*` on the host. It is an explicit\n  // activation dependency so a peer bridge never silently omits commands.\n  const nativeTypertGateway = ctx.get('typertGateway') as TypertGatewayLike\n  const localTypertGateway = new TypertGatewaySwitch(nativeTypertGateway).local()\n  const runtime = new HostPluginRuntime(config, hostIdentities, apiProxy, logger, () => localTypertGateway)\n\n  let clientRuntime: ClientModeRuntime | undefined\n  const hostControl = runtime\n  if (config.serverUrl !== undefined && apiProxy !== undefined && connection !== undefined) {\n    const clientIdentities = new IdentityStore({\n      directory: serverStorageDirectory(defaultIdentityDirectory, config.serverUrl, 'client'),\n    })\n    clientRuntime = new ClientModeRuntime(\n      config,\n      clientIdentities,\n      new ClientServerApi(config.serverUrl, new ServerCredentialStore(clientIdentities.directory)),\n      apiProxy,\n      nativeTypertGateway,\n      logger,\n      hostControl,\n    )\n  }\n\n  const controlRuntime = connection === undefined\n    ? undefined\n    : new PluginControlRuntime(config, defaultIdentityDirectory, settingsScope, clientRuntime, hostControl)\n\n  ctx.provide('dshRemote', runtime)\n  if (clientRuntime !== undefined) ctx.provide('dshRemoteClient', clientRuntime)\n  await ctx.effect(async () => {\n    const disposeControl = controlRuntime?.register(connection!)\n    try {\n      await runtime.start()\n      if (clientRuntime !== undefined) {\n        await clientRuntime.start()\n      } else {\n        logger.warn('client remote mode is unavailable', {\n          serverConfigured: config.serverUrl !== undefined,\n          apiProxyAvailable: apiProxy !== undefined,\n          connectionAvailable: connection !== undefined,\n        })\n      }\n    } catch (error) {\n      await disposeControl?.()\n      await clientRuntime?.close()\n      await runtime.close()\n      throw error\n    }\n    return async () => {\n      await disposeControl?.()\n      await clientRuntime?.close()\n      await runtime.close()\n    }\n  }, 'dsh-remote lifecycle')\n}\n\nexport type { ResolvedConfig } from './config.js'\nexport { resolveConfig } from './config.js'\nexport { ConnectionController, ConnectionRejectedError } from './connection-controller.js'\nexport type { PeerConnectionContext, RpcRouterFactory } from './connection-controller.js'\nexport { fingerprint, IdentityInvalidError, IdentityStore } from './identity-store.js'\nexport { serverStorageDirectory } from './identity-store.js'\nexport type { HostIdentity, RemoteDeviceRole, TrustedPeer } from './identity-store.js'\nexport { ClientServerApi, HostServerApi, ServerApiError } from './server-api.js'\nexport { HostServerConnection } from './server-connection.js'\nexport type { WebSocketFactory } from './server-connection.js'\nexport { ServerCredentialStore, ServerCredentialsInvalidError } from './server-credentials.js'\nexport type { ServerCredentials } from './server-credentials.js'\nexport { HOST_CAPABILITIES, RpcError, RpcRouter } from './rpc-router.js'\nexport { HostPluginRuntime } from './service.js'\nexport { ApiProxySwitch } from './api-proxy-switch.js'\nexport { ClientModeError, ClientModeRuntime } from './client-runtime.js'\nexport { PluginControlRuntime } from './control-runtime.js'\nexport { ClientSecureTransport } from './client-secure-transport.js'\nexport { HARNESS_API_ALLOWLIST, HarnessApiBridge } from './harness-api-bridge.js'\nexport { RemoteHarnessApiProxy } from './remote-api-proxy.js'\nexport { TypertGatewaySwitch } from './typert-gateway-switch.js'\nexport type { AuthenticatedPeerChannel } from './types.js'\n", "export * from \"./errors.js\";\nexport * from \"./helpers/parseUtil.js\";\nexport * from \"./helpers/typeAliases.js\";\nexport * from \"./helpers/util.js\";\nexport * from \"./types.js\";\nexport * from \"./ZodError.js\";\n", "export var util;\n(function (util) {\n    util.assertEqual = (_) => { };\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\" && Number.isFinite(val) && Math.floor(val) === val;\n    function joinValues(array, separator = \" | \") {\n        return array.map((val) => (typeof val === \"string\" ? `'${val}'` : val)).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 = {}));\nexport var objectUtil;\n(function (objectUtil) {\n    objectUtil.mergeShapes = (first, second) => {\n        return {\n            ...first,\n            ...second, // second overwrites first\n        };\n    };\n})(objectUtil || (objectUtil = {}));\nexport const 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]);\nexport const 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 Number.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 && typeof data.then === \"function\" && data.catch && 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", "import { util } from \"./helpers/util.js\";\nexport const 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]);\nexport const quotelessJson = (obj) => {\n    const json = JSON.stringify(obj, null, 2);\n    return json.replace(/\"([^\"]+)\":/g, \"$1:\");\n};\nexport class ZodError extends Error {\n    get errors() {\n        return this.issues;\n    }\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    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                const firstEl = sub.path[0];\n                fieldErrors[firstEl] = fieldErrors[firstEl] || [];\n                fieldErrors[firstEl].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", "import { ZodIssueCode } from \"../ZodError.js\";\nimport { util, ZodParsedType } from \"../helpers/util.js\";\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 ? `exactly equal to ` : issue.inclusive ? `greater than or equal to ` : `greater than `}${issue.minimum}`;\n            else if (issue.type === \"bigint\")\n                message = `Number must be ${issue.exact ? `exactly equal to ` : issue.inclusive ? `greater than or equal to ` : `greater than `}${issue.minimum}`;\n            else if (issue.type === \"date\")\n                message = `Date must be ${issue.exact ? `exactly equal to ` : issue.inclusive ? `greater than or equal to ` : `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 ? `exactly` : issue.inclusive ? `less than or equal to` : `less than`} ${issue.maximum}`;\n            else if (issue.type === \"bigint\")\n                message = `BigInt must be ${issue.exact ? `exactly` : issue.inclusive ? `less than or equal to` : `less than`} ${issue.maximum}`;\n            else if (issue.type === \"date\")\n                message = `Date must be ${issue.exact ? `exactly` : issue.inclusive ? `smaller than or equal to` : `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};\nexport default errorMap;\n", "import defaultErrorMap from \"./locales/en.js\";\nlet overrideErrorMap = defaultErrorMap;\nexport { defaultErrorMap };\nexport function setErrorMap(map) {\n    overrideErrorMap = map;\n}\nexport function getErrorMap() {\n    return overrideErrorMap;\n}\n", "import { getErrorMap } from \"../errors.js\";\nimport defaultErrorMap from \"../locales/en.js\";\nexport const 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};\nexport const EMPTY_PATH = [];\nexport function 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, // contextual error map is first priority\n            ctx.schemaErrorMap, // then schema-bound map if available\n            overrideMap, // then global override map\n            overrideMap === defaultErrorMap ? undefined : defaultErrorMap, // then global default map\n        ].filter((x) => !!x),\n    });\n    ctx.common.issues.push(issue);\n}\nexport class 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__\" && (typeof value.value !== \"undefined\" || pair.alwaysSet)) {\n                finalObject[key.value] = value.value;\n            }\n        }\n        return { status: status.value, value: finalObject };\n    }\n}\nexport const INVALID = Object.freeze({\n    status: \"aborted\",\n});\nexport const DIRTY = (value) => ({ status: \"dirty\", value });\nexport const OK = (value) => ({ status: \"valid\", value });\nexport const isAborted = (x) => x.status === \"aborted\";\nexport const isDirty = (x) => x.status === \"dirty\";\nexport const isValid = (x) => x.status === \"valid\";\nexport const isAsync = (x) => typeof Promise !== \"undefined\" && x instanceof Promise;\n", "export var errorUtil;\n(function (errorUtil) {\n    errorUtil.errToObj = (message) => typeof message === \"string\" ? { message } : message || {};\n    // biome-ignore lint:\n    errorUtil.toString = (message) => typeof message === \"string\" ? message : message?.message;\n})(errorUtil || (errorUtil = {}));\n", "import { ZodError, ZodIssueCode, } from \"./ZodError.js\";\nimport { defaultErrorMap, getErrorMap } from \"./errors.js\";\nimport { errorUtil } from \"./helpers/errorUtil.js\";\nimport { DIRTY, INVALID, OK, ParseStatus, addIssueToContext, isAborted, isAsync, isDirty, isValid, makeIssue, } from \"./helpers/parseUtil.js\";\nimport { util, ZodParsedType, getParsedType } from \"./helpers/util.js\";\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 (Array.isArray(this._key)) {\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        const { message } = params;\n        if (iss.code === \"invalid_enum_value\") {\n            return { message: message ?? ctx.defaultError };\n        }\n        if (typeof ctx.data === \"undefined\") {\n            return { message: message ?? required_error ?? ctx.defaultError };\n        }\n        if (iss.code !== \"invalid_type\")\n            return { message: ctx.defaultError };\n        return { message: message ?? invalid_type_error ?? ctx.defaultError };\n    };\n    return { errorMap: customMap, description };\n}\nexport class ZodType {\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        const ctx = {\n            common: {\n                issues: [],\n                async: params?.async ?? false,\n                contextualErrorMap: params?.errorMap,\n            },\n            path: 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    \"~validate\"(data) {\n        const ctx = {\n            common: {\n                issues: [],\n                async: !!this[\"~standard\"].async,\n            },\n            path: [],\n            schemaErrorMap: this._def.errorMap,\n            parent: null,\n            data,\n            parsedType: getParsedType(data),\n        };\n        if (!this[\"~standard\"].async) {\n            try {\n                const result = this._parseSync({ data, path: [], parent: ctx });\n                return isValid(result)\n                    ? {\n                        value: result.value,\n                    }\n                    : {\n                        issues: ctx.common.issues,\n                    };\n            }\n            catch (err) {\n                if (err?.message?.toLowerCase()?.includes(\"encountered\")) {\n                    this[\"~standard\"].async = true;\n                }\n                ctx.common = {\n                    issues: [],\n                    async: true,\n                };\n            }\n        }\n        return this._parseAsync({ data, path: [], parent: ctx }).then((result) => isValid(result)\n            ? {\n                value: result.value,\n            }\n            : {\n                issues: ctx.common.issues,\n            });\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?.errorMap,\n                async: true,\n            },\n            path: 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) ? maybeAsyncResult : 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\" ? refinementData(val, ctx) : 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    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        this[\"~standard\"] = {\n            version: 1,\n            vendor: \"zod\",\n            validate: (data) => this[\"~validate\"](data),\n        };\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);\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}$/i;\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 jwtRegex = /^[A-Za-z0-9-_]+\\.[A-Za-z0-9-_]+\\.[A-Za-z0-9-_]*$/;\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.!#$%&\u2019*+/=?^_`{|}~-]+@[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 ipv4CidrRegex = /^(?:(?: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])\\/(3[0-2]|[12]?[0-9])$/;\n// const ipv6Regex =\n// /^(([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})))$/;\nconst ipv6Regex = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))$/;\nconst ipv6CidrRegex = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))\\/(12[0-8]|1[01][0-9]|[1-9]?[0-9])$/;\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// https://base64.guru/standards/base64url\nconst base64urlRegex = /^([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 secondsRegexSource = `[0-5]\\\\d`;\n    if (args.precision) {\n        secondsRegexSource = `${secondsRegexSource}\\\\.\\\\d{${args.precision}}`;\n    }\n    else if (args.precision == null) {\n        secondsRegexSource = `${secondsRegexSource}(\\\\.\\\\d+)?`;\n    }\n    const secondsQuantifier = args.precision ? \"+\" : \"?\"; // require seconds if precision is nonzero\n    return `([01]\\\\d|2[0-3]):[0-5]\\\\d(:${secondsRegexSource})${secondsQuantifier}`;\n}\nfunction timeRegex(args) {\n    return new RegExp(`^${timeRegexSource(args)}$`);\n}\n// Adapted from https://stackoverflow.com/a/3143231\nexport function 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}\nfunction isValidJWT(jwt, alg) {\n    if (!jwtRegex.test(jwt))\n        return false;\n    try {\n        const [header] = jwt.split(\".\");\n        if (!header)\n            return false;\n        // Convert base64url to base64\n        const base64 = header\n            .replace(/-/g, \"+\")\n            .replace(/_/g, \"/\")\n            .padEnd(header.length + ((4 - (header.length % 4)) % 4), \"=\");\n        const decoded = JSON.parse(atob(base64));\n        if (typeof decoded !== \"object\" || decoded === null)\n            return false;\n        if (\"typ\" in decoded && decoded?.typ !== \"JWT\")\n            return false;\n        if (!decoded.alg)\n            return false;\n        if (alg && decoded.alg !== alg)\n            return false;\n        return true;\n    }\n    catch {\n        return false;\n    }\n}\nfunction isValidCidr(ip, version) {\n    if ((version === \"v4\" || !version) && ipv4CidrRegex.test(ip)) {\n        return true;\n    }\n    if ((version === \"v6\" || !version) && ipv6CidrRegex.test(ip)) {\n        return true;\n    }\n    return false;\n}\nexport class 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 {\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 === \"jwt\") {\n                if (!isValidJWT(input.data, check.alg)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    addIssueToContext(ctx, {\n                        validation: \"jwt\",\n                        code: ZodIssueCode.invalid_string,\n                        message: check.message,\n                    });\n                    status.dirty();\n                }\n            }\n            else if (check.kind === \"cidr\") {\n                if (!isValidCidr(input.data, check.version)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    addIssueToContext(ctx, {\n                        validation: \"cidr\",\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 if (check.kind === \"base64url\") {\n                if (!base64urlRegex.test(input.data)) {\n                    ctx = this._getOrReturnCtx(input, ctx);\n                    addIssueToContext(ctx, {\n                        validation: \"base64url\",\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    base64url(message) {\n        // base64url encoding is a modification of base64 that can safely be used in URLs and filenames\n        return this._addCheck({\n            kind: \"base64url\",\n            ...errorUtil.errToObj(message),\n        });\n    }\n    jwt(options) {\n        return this._addCheck({ kind: \"jwt\", ...errorUtil.errToObj(options) });\n    }\n    ip(options) {\n        return this._addCheck({ kind: \"ip\", ...errorUtil.errToObj(options) });\n    }\n    cidr(options) {\n        return this._addCheck({ kind: \"cidr\", ...errorUtil.errToObj(options) });\n    }\n    datetime(options) {\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?.precision === \"undefined\" ? null : options?.precision,\n            offset: options?.offset ?? false,\n            local: options?.local ?? false,\n            ...errorUtil.errToObj(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?.precision === \"undefined\" ? null : options?.precision,\n            ...errorUtil.errToObj(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?.position,\n            ...errorUtil.errToObj(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     * Equivalent to `.min(1)`\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 isCIDR() {\n        return !!this._def.checks.find((ch) => ch.kind === \"cidr\");\n    }\n    get isBase64() {\n        return !!this._def.checks.find((ch) => ch.kind === \"base64\");\n    }\n    get isBase64url() {\n        // base64url encoding is a modification of base64 that can safely be used in URLs and filenames\n        return !!this._def.checks.find((ch) => ch.kind === \"base64url\");\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    return new ZodString({\n        checks: [],\n        typeName: ZodFirstPartyTypeKind.ZodString,\n        coerce: params?.coerce ?? 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 = Number.parseInt(val.toFixed(decCount).replace(\".\", \"\"));\n    const stepInt = Number.parseInt(step.toFixed(decCount).replace(\".\", \"\"));\n    return (valInt % stepInt) / 10 ** decCount;\n}\nexport class 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 ? input.data < check.value : 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 ? input.data > check.value : 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\" || (ch.kind === \"multipleOf\" && util.isInteger(ch.value)));\n    }\n    get isFinite() {\n        let max = null;\n        let min = null;\n        for (const ch of this._def.checks) {\n            if (ch.kind === \"finite\" || ch.kind === \"int\" || 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?.coerce || false,\n        ...processCreateParams(params),\n    });\n};\nexport class 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            try {\n                input.data = BigInt(input.data);\n            }\n            catch {\n                return this._getInvalidInput(input);\n            }\n        }\n        const parsedType = this._getType(input);\n        if (parsedType !== ZodParsedType.bigint) {\n            return this._getInvalidInput(input);\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 ? input.data < check.value : 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 ? input.data > check.value : 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    _getInvalidInput(input) {\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    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    return new ZodBigInt({\n        checks: [],\n        typeName: ZodFirstPartyTypeKind.ZodBigInt,\n        coerce: params?.coerce ?? false,\n        ...processCreateParams(params),\n    });\n};\nexport class 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?.coerce || false,\n        ...processCreateParams(params),\n    });\n};\nexport class 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 (Number.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?.coerce || false,\n        typeName: ZodFirstPartyTypeKind.ZodDate,\n        ...processCreateParams(params),\n    });\n};\nexport class 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};\nexport class 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};\nexport class 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};\nexport class 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};\nexport class 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};\nexport class 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};\nexport class 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};\nexport class 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}\nexport class 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<T, Augmentation>,\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        this._cached = { shape, keys };\n        return this._cached;\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 && 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            }\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                        const defaultError = this._def.errorMap?.(issue, ctx).message ?? ctx.defaultError;\n                        if (issue.code === \"unrecognized_keys\")\n                            return {\n                                message: errorUtil.errToObj(message).message ?? 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 extends ZodObjectDef>(def: Def) =>\n    //   <Augmentation extends ZodRawShape>(\n    //     augmentation: Augmentation\n    //   ): ZodObject<\n    //     extendShape<ReturnType<Def[\"shape\"]>, 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<T, ReturnType<Incoming[\"_def\"][\"shape\"]>>,\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<Incoming extends AnyZodObject>(\n    //   merging: Incoming\n    // ): //ZodObject<T & Incoming[\"_shape\"], UnknownKeys, Catchall> = (merging) => {\n    // ZodObject<\n    //   extendShape<T, ReturnType<Incoming[\"_def\"][\"shape\"]>>,\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        for (const key of util.objectKeys(mask)) {\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        for (const key of util.objectKeys(this.shape)) {\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        for (const key of util.objectKeys(this.shape)) {\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        for (const key of util.objectKeys(this.shape)) {\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};\nexport class 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};\nexport class 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.objectKeys(a).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 && bType === ZodParsedType.date && +a === +b) {\n        return { valid: true, data: a };\n    }\n    else {\n        return { valid: false };\n    }\n}\nexport class 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};\n// type ZodTupleItems = [ZodTypeAny, ...ZodTypeAny[]];\nexport class 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};\nexport class 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}\nexport class 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};\nexport class 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};\nexport class 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: [ctx.common.contextualErrorMap, ctx.schemaErrorMap, getErrorMap(), defaultErrorMap].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: [ctx.common.contextualErrorMap, ctx.schemaErrorMap, getErrorMap(), defaultErrorMap].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.parseAsync(args, params).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 ? args : ZodTuple.create([]).rest(ZodUnknown.create())),\n            returns: returns || ZodUnknown.create(),\n            typeName: ZodFirstPartyTypeKind.ZodFunction,\n            ...processCreateParams(params),\n        });\n    }\n}\nexport class 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};\nexport class 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}\nexport class ZodEnum extends ZodType {\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 (!this._cache) {\n            this._cache = new Set(this._def.values);\n        }\n        if (!this._cache.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}\nZodEnum.create = createZodEnum;\nexport class ZodNativeEnum extends ZodType {\n    _parse(input) {\n        const nativeEnumValues = util.getValidEnumValues(this._def.values);\n        const ctx = this._getOrReturnCtx(input);\n        if (ctx.parsedType !== ZodParsedType.string && 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 (!this._cache) {\n            this._cache = new Set(util.getValidEnumValues(this._def.values));\n        }\n        if (!this._cache.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}\nZodNativeEnum.create = (values, params) => {\n    return new ZodNativeEnum({\n        values: values,\n        typeName: ZodFirstPartyTypeKind.ZodNativeEnum,\n        ...processCreateParams(params),\n    });\n};\nexport class 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 && 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 ? ctx.data : 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};\nexport class 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._parseAsync({ data: ctx.data, path: ctx.path, parent: ctx }).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 INVALID;\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._parseAsync({ data: ctx.data, path: ctx.path, parent: ctx }).then((base) => {\n                    if (!isValid(base))\n                        return INVALID;\n                    return Promise.resolve(effect.transform(base.value, checkCtx)).then((result) => ({\n                        status: status.value,\n                        value: result,\n                    }));\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};\nexport { ZodEffects as ZodTransformer };\nexport class 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};\nexport class 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};\nexport class 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\" ? params.default : () => params.default,\n        ...processCreateParams(params),\n    });\n};\nexport class 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};\nexport class 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};\nexport const BRAND = Symbol(\"zod_brand\");\nexport class 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}\nexport class 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}\nexport class 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) ? result.then((data) => freeze(data)) : 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};\n////////////////////////////////////////\n////////////////////////////////////////\n//////////                    //////////\n//////////      z.custom      //////////\n//////////                    //////////\n////////////////////////////////////////\n////////////////////////////////////////\nfunction cleanParams(params, data) {\n    const p = typeof params === \"function\" ? params(data) : typeof params === \"string\" ? { message: params } : params;\n    const p2 = typeof p === \"string\" ? { message: p } : p;\n    return p2;\n}\nexport function 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            const r = check(data);\n            if (r instanceof Promise) {\n                return r.then((r) => {\n                    if (!r) {\n                        const params = cleanParams(_params, data);\n                        const _fatal = params.fatal ?? fatal ?? true;\n                        ctx.addIssue({ code: \"custom\", ...params, fatal: _fatal });\n                    }\n                });\n            }\n            if (!r) {\n                const params = cleanParams(_params, data);\n                const _fatal = params.fatal ?? fatal ?? true;\n                ctx.addIssue({ code: \"custom\", ...params, fatal: _fatal });\n            }\n            return;\n        });\n    return ZodAny.create();\n}\nexport { ZodType as Schema, ZodType as ZodSchema };\nexport const late = {\n    object: ZodObject.lazycreate,\n};\nexport var 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 = {}));\n// requires TS 4.4+\nclass Class {\n    constructor(..._) { }\n}\nconst instanceOfType = (\n// const instanceOfType = <T extends new (...args: any[]) => 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();\nexport const 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};\nexport { anyType as any, arrayType as array, bigIntType as bigint, booleanType as boolean, dateType as date, discriminatedUnionType as discriminatedUnion, effectsType as effect, enumType as enum, functionType as function, instanceOfType as instanceof, intersectionType as intersection, lazyType as lazy, literalType as literal, mapType as map, nanType as nan, nativeEnumType as nativeEnum, neverType as never, nullType as null, nullableType as nullable, numberType as number, objectType as object, oboolean, onumber, optionalType as optional, ostring, pipelineType as pipeline, preprocessType as preprocess, promiseType as promise, recordType as record, setType as set, strictObjectType as strictObject, stringType as string, symbolType as symbol, effectsType as transformer, tupleType as tuple, undefinedType as undefined, unionType as union, unknownType as unknown, voidType as void, };\nexport const NEVER = INVALID;\n", "import { z } from 'zod'\n\nexport const PROTOCOL_VERSION = 1\nexport const SECURE_FRAGMENT_CHUNK_BYTES = 48 * 1024\nexport const MAX_SECURE_MESSAGE_BYTES = 4 * 1024 * 1024\n\nconst SECURE_FRAGMENT_MAGIC = new Uint8Array([0x44, 0x53, 0x48, 0x46]) // DSHF\nconst SECURE_FRAGMENT_VERSION = 1\nconst SECURE_FRAGMENT_HEADER_BYTES = 17\nconst MAX_IN_FLIGHT_SECURE_MESSAGES = 8\n\nexport const messageTypes = [\n  'rpc.request',\n  'rpc.response',\n  'rpc.error',\n  'event',\n] as const\n\nexport const controlFrameTypes = [\n  'hello',\n  'hello.ack',\n  'connect.request',\n  'connect.incoming',\n  'connect.accepted',\n  'connect.rejected',\n  'secure.handshake',\n  'relay',\n  'signal.offer',\n  'signal.answer',\n  'signal.ice',\n  'transport.selected',\n  'ping',\n  'pong',\n  'error',\n] as const\n\nexport const rpcMethods = [\n  'harness.api.call',\n  'harness.api.respond',\n  'harness.api.stream.open',\n  'harness.api.stream.close',\n] as const\n\nexport const remoteEvents = [\n  'session.created',\n  'session.updated',\n  'message.created',\n  'message.delta',\n  'tool.started',\n  'tool.updated',\n  'tool.finished',\n  'permission.requested',\n  'permission.resolved',\n  'agent.status',\n  'connection.stats',\n  'harness.api.frame',\n  'harness.api.stream.closed',\n] as const\n\nexport type MessageType = typeof messageTypes[number]\nexport type ControlFrameType = typeof controlFrameTypes[number]\nexport type RpcMethod = typeof rpcMethods[number]\nexport type RemoteEventName = typeof remoteEvents[number]\n\nexport interface ControlFrame<TPayload = unknown> {\n  v: typeof PROTOCOL_VERSION\n  id: string\n  type: ControlFrameType\n  timestamp: number\n  payload: TPayload\n}\n\nexport interface HelloPayload {\n  role: 'host' | 'client'\n  deviceId: string\n  accessToken: string\n  protocols: number[]\n  capabilities: string[]\n  /** Version of the Client/Plugin software reporting in; symmetric to ``HelloAckPayload.serverVersion``. */\n  clientVersion?: string\n}\n\nexport interface HelloAckPayload {\n  protocol: typeof PROTOCOL_VERSION\n  serverVersion: string\n  connectionSessionId: string\n  heartbeatIntervalMs: number\n  maxControlFrameBytes: number\n  maxRelayFrameBytes: number\n  webrtcEnabled?: boolean\n  webrtcFallbackTimeoutMs?: number\n}\n\nexport interface ConnectRequestPayload {\n  hostDeviceId: string\n  preferredTransports: Array<'lan' | 'p2p' | 'turn' | 'relay'>\n}\n\nexport interface ConnectIncomingPayload {\n  connectionId: string\n  clientDeviceId: string\n  clientIdentityKey: string\n  authorization: 'account'\n  preferredTransports: Array<'lan' | 'p2p' | 'turn' | 'relay'>\n}\n\nexport interface ConnectAcceptedPayload {\n  connectionId: string\n}\n\nexport interface ConnectRejectedPayload {\n  connectionId: string\n  code?: string\n  message?: string\n}\n\nexport interface SecureHandshakePayload {\n  connectionId: string\n  targetDeviceId: string\n  step: number\n  data: string\n}\n\nexport interface ControlErrorPayload {\n  code: string\n  message: string\n  retryable?: boolean\n  connectionId?: string\n}\n\nexport interface RelayPayload {\n  connectionId: string\n  targetDeviceId: string\n  counter: number\n  ciphertext: string\n}\n\nexport const selectedTransports = ['p2p', 'turn', 'relay'] as const\nexport type SelectedTransport = typeof selectedTransports[number]\n\nexport interface SignalPayload {\n  connectionId: string\n  targetDeviceId: string\n  sdp: string\n}\n\nexport interface IceCandidatePayload {\n  candidate?: string\n  sdpMid?: string | null\n  sdpMLineIndex?: number | null\n  usernameFragment?: string | null\n}\n\nexport interface SignalIcePayload {\n  connectionId: string\n  targetDeviceId: string\n  candidate: IceCandidatePayload\n}\n\nexport interface TransportSelectedPayload {\n  connectionId: string\n  targetDeviceId: string\n  transport: SelectedTransport\n}\n\n/** Capabilities both ends announce in ``hello`` to negotiate the data plane. */\nexport const transportCapabilities = [\n  'transport.p2p',\n  'transport.turn',\n  'transport.relay',\n] as const\n\nexport interface RemoteMessage<TPayload = unknown> {\n  v: typeof PROTOCOL_VERSION\n  id: string\n  type: MessageType\n  timestamp: number\n  payload: TPayload\n}\n\nexport interface RpcRequestPayload<TParams = unknown> {\n  method: RpcMethod\n  params: TParams\n}\n\nexport interface RpcResponsePayload<TResult = unknown> {\n  requestId: string\n  result: TResult\n}\n\nexport interface RpcErrorPayload {\n  requestId: string\n  code: string\n  message: string\n  retryable?: boolean\n  details?: unknown\n}\n\nexport interface EventPayload<TData = unknown> {\n  seq?: number\n  event: RemoteEventName\n  sessionId?: string\n  data: TData\n}\n\nexport interface DeviceDescriptor {\n  deviceId: string\n  name: string\n  role: 'host' | 'client'\n  platform: string\n  identityKey: string\n  clientVersion: string\n  harnessVersion?: string\n}\n\nexport interface SessionSummary {\n  id: string\n  title: string\n  cwd?: string\n  running: boolean\n  updatedAt?: number\n}\n\nexport interface PermissionRequest {\n  requestId: string\n  sessionId: string\n  permission: {\n    kind: 'command' | 'tool' | 'workspace' | 'unknown'\n    command?: string\n    cwd?: string\n    toolName?: string\n    description?: string\n    raw?: unknown\n  }\n}\n\nexport type PermissionDecision = 'allow_once' | 'deny'\n\nexport interface TransportStats {\n  mode: 'LAN' | 'P2P' | 'TURN' | 'Relay' | 'Disconnected'\n  connected: boolean\n  rttMs?: number\n  bytesSent?: number\n  bytesReceived?: number\n}\n\n/** Native Harness API request tunneled inside the authenticated business channel. */\nexport interface HarnessApiCallParams {\n  method: string\n  rpcId: string\n  payload: unknown\n}\n\n/** Response to an answerable native Harness server request (approval/question). */\nexport interface HarnessApiRespondParams {\n  message: {\n    type: 'client-response'\n    rpcId: string\n    result: unknown\n  }\n}\n\nexport interface HarnessApiStreamOpenParams {\n  streamId: string\n  stream: 'mux' | 'host'\n  rpcId: string\n  payload: {\n    /** Optional mux focus: only forward frames for this session. */\n    sessionId?: string\n  }\n}\n\nexport interface HarnessApiStreamCloseParams {\n  streamId: string\n}\n\nexport interface HarnessApiFrameData {\n  streamId: string\n  frame: {\n    rpcId: string\n    payload: unknown\n  }\n}\n\nexport interface HarnessApiStreamClosedData {\n  streamId: string\n  reason: 'cancelled' | 'completed' | 'failed' | 'peer-disconnected'\n}\n\nconst rpcMethodSchema = z.enum(rpcMethods)\nconst messageTypeSchema = z.enum(messageTypes)\nconst controlFrameTypeSchema = z.enum(controlFrameTypes)\n\nexport const remoteMessageSchema = z.object({\n  v: z.literal(PROTOCOL_VERSION),\n  id: z.string().min(1),\n  type: messageTypeSchema,\n  timestamp: z.number().int().positive(),\n  payload: z.unknown(),\n}) as unknown as z.ZodType<RemoteMessage>\n\nexport const controlFrameSchema = z.object({\n  v: z.literal(PROTOCOL_VERSION),\n  id: z.string().min(1),\n  type: controlFrameTypeSchema,\n  timestamp: z.number().int().positive(),\n  payload: z.unknown(),\n}).strict() as unknown as z.ZodType<ControlFrame>\n\n// \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n// Control frame payload schemas (protocol.md \u00A710-\u00A723)\n// \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nconst transportEnum = z.enum(['lan', 'p2p', 'turn', 'relay'])\nconst selectedTransportEnum = z.enum(['p2p', 'turn', 'relay'])\n\nexport const helloPayloadSchema = z.object({\n  role: z.enum(['host', 'client']),\n  deviceId: z.string().min(1),\n  accessToken: z.string().min(1),\n  protocols: z.array(z.number().int()).min(1),\n  capabilities: z.array(z.string()),\n  clientVersion: z.string().optional(),\n})\n\nexport const helloAckPayloadSchema = z.object({\n  protocol: z.literal(PROTOCOL_VERSION),\n  serverVersion: z.string().min(1),\n  connectionSessionId: z.string().min(1),\n  heartbeatIntervalMs: z.number().int().positive(),\n  maxControlFrameBytes: z.number().int().positive(),\n  maxRelayFrameBytes: z.number().int().positive(),\n  webrtcEnabled: z.boolean().optional(),\n  webrtcFallbackTimeoutMs: z.number().int().positive().optional(),\n})\n\nexport const connectRequestPayloadSchema = z.object({\n  hostDeviceId: z.string().min(1),\n  preferredTransports: z.array(transportEnum).min(1),\n})\n\nexport const connectIncomingPayloadSchema = z.object({\n  connectionId: z.string().min(1),\n  clientDeviceId: z.string().min(1),\n  clientIdentityKey: z.string().min(1),\n  authorization: z.literal('account'),\n  preferredTransports: z.array(transportEnum).min(1),\n})\n\nexport const connectAcceptedPayloadSchema = z.object({\n  connectionId: z.string().min(1),\n})\n\nexport const connectRejectedPayloadSchema = z.object({\n  connectionId: z.string().min(1),\n  code: z.string().optional(),\n  message: z.string().optional(),\n})\n\nexport const secureHandshakePayloadSchema = z.object({\n  connectionId: z.string().min(1),\n  targetDeviceId: z.string().min(1),\n  step: z.number().int().positive(),\n  data: z.string().min(1),\n})\n\nexport const relayPayloadSchema = z.object({\n  connectionId: z.string().min(1),\n  targetDeviceId: z.string().min(1),\n  counter: z.number().int().nonnegative(),\n  ciphertext: z.string().min(1),\n})\n\nexport const signalPayloadSchema = z.object({\n  connectionId: z.string().min(1),\n  targetDeviceId: z.string().min(1),\n  sdp: z.string().min(1),\n})\n\nexport const signalIcePayloadSchema = z.object({\n  connectionId: z.string().min(1),\n  targetDeviceId: z.string().min(1),\n  candidate: z.object({\n    candidate: z.string().optional(),\n    sdpMid: z.string().nullable().optional(),\n    sdpMLineIndex: z.number().int().nullable().optional(),\n    usernameFragment: z.string().nullable().optional(),\n  }),\n})\n\nexport const transportSelectedPayloadSchema = z.object({\n  connectionId: z.string().min(1),\n  targetDeviceId: z.string().min(1),\n  transport: selectedTransportEnum,\n})\n\nexport const pingPongPayloadSchema = z.object({\n  nonce: z.string().min(1),\n})\n\nexport const controlErrorPayloadSchema = z.object({\n  code: z.string().min(1),\n  message: z.string().min(1),\n  retryable: z.boolean().optional(),\n  connectionId: z.string().min(1).optional(),\n})\n\nconst controlFramePayloadSchemas: Record<ControlFrameType, z.ZodType> = {\n  'hello': helloPayloadSchema,\n  'hello.ack': helloAckPayloadSchema,\n  'connect.request': connectRequestPayloadSchema,\n  'connect.incoming': connectIncomingPayloadSchema,\n  'connect.accepted': connectAcceptedPayloadSchema,\n  'connect.rejected': connectRejectedPayloadSchema,\n  'secure.handshake': secureHandshakePayloadSchema,\n  'relay': relayPayloadSchema,\n  'signal.offer': signalPayloadSchema,\n  'signal.answer': signalPayloadSchema,\n  'signal.ice': signalIcePayloadSchema,\n  'transport.selected': transportSelectedPayloadSchema,\n  'ping': pingPongPayloadSchema,\n  'pong': pingPongPayloadSchema,\n  'error': controlErrorPayloadSchema,\n}\n\nexport const rpcRequestPayloadSchema = z.object({\n  method: rpcMethodSchema,\n  params: z.unknown(),\n}) as unknown as z.ZodType<RpcRequestPayload>\n\nexport const rpcResponsePayloadSchema = z.object({\n  requestId: z.string().min(1),\n  result: z.unknown(),\n}) as unknown as z.ZodType<RpcResponsePayload>\n\nexport const rpcErrorPayloadSchema: z.ZodType<RpcErrorPayload> = z.object({\n  requestId: z.string().min(1),\n  code: z.string().min(1),\n  message: z.string().min(1),\n  retryable: z.boolean().optional(),\n  details: z.unknown().optional(),\n})\n\nexport function createMessage<TPayload>(\n  type: MessageType,\n  payload: TPayload,\n  id = cryptoRandomId(),\n): RemoteMessage<TPayload> {\n  return {\n    v: PROTOCOL_VERSION,\n    id,\n    type,\n    timestamp: Date.now(),\n    payload,\n  }\n}\n\nexport function createControlFrame<TPayload>(\n  type: ControlFrameType,\n  payload: TPayload,\n  id = cryptoRandomId(),\n): ControlFrame<TPayload> {\n  return {\n    v: PROTOCOL_VERSION,\n    id,\n    type,\n    timestamp: Date.now(),\n    payload,\n  }\n}\n\nexport function createRpcRequest<TParams>(\n  method: RpcMethod,\n  params: TParams,\n  id?: string,\n): RemoteMessage<RpcRequestPayload<TParams>> {\n  return createMessage('rpc.request', { method, params }, id)\n}\n\nexport function createRpcResponse<TResult>(\n  requestId: string,\n  result: TResult,\n): RemoteMessage<RpcResponsePayload<TResult>> {\n  return createMessage('rpc.response', { requestId, result })\n}\n\nexport function createRpcError(\n  requestId: string,\n  code: string,\n  message: string,\n  details?: unknown,\n  retryable?: boolean,\n): RemoteMessage<RpcErrorPayload> {\n  return createMessage('rpc.error', { requestId, code, message, details, retryable })\n}\n\nexport function createEvent<TData>(\n  event: RemoteEventName,\n  data: TData,\n  options: { seq?: number; sessionId?: string } = {},\n): RemoteMessage<EventPayload<TData>> {\n  return createMessage('event', { event, data, ...options })\n}\n\nexport function parseRemoteMessage(input: unknown): RemoteMessage {\n  return remoteMessageSchema.parse(input)\n}\n\nexport function parseControlFrame(input: unknown): ControlFrame {\n  const frame = controlFrameSchema.parse(input)\n  const payloadSchema = controlFramePayloadSchemas[frame.type]\n  if (payloadSchema) {\n    return { ...frame, payload: payloadSchema.parse(frame.payload) }\n  }\n  return frame\n}\n\nexport function encodeMessage(message: RemoteMessage): Uint8Array {\n  return new TextEncoder().encode(JSON.stringify(message))\n}\n\nexport function decodeMessage(data: Uint8Array | string): RemoteMessage {\n  const text = typeof data === 'string' ? data : new TextDecoder().decode(data)\n  return parseRemoteMessage(JSON.parse(text))\n}\n\ninterface FragmentAssembly {\n  total: number\n  totalBytes: number\n  receivedBytes: number\n  chunks: Uint8Array[]\n}\n\n/**\n * Splits application plaintext before Noise encryption and reassembles it\n * after decryption. Noise transport messages have a 65,535-byte ceiling, so\n * large native ApiProxy responses cannot be encrypted as one message.\n */\nexport class SecureMessageCodec {\n  private nextMessageId = 1\n  private readonly assemblies = new Map<number, FragmentAssembly>()\n\n  encode(message: Uint8Array): Uint8Array[] {\n    if (message.byteLength > MAX_SECURE_MESSAGE_BYTES) {\n      throw new Error('Secure message exceeds the reassembly limit.')\n    }\n    if (message.byteLength <= SECURE_FRAGMENT_CHUNK_BYTES) return [message]\n\n    const messageId = this.nextMessageId\n    this.nextMessageId = messageId === 0xffff_ffff ? 1 : messageId + 1\n    const total = Math.ceil(message.byteLength / SECURE_FRAGMENT_CHUNK_BYTES)\n    const frames: Uint8Array[] = []\n    for (let index = 0; index < total; index += 1) {\n      const start = index * SECURE_FRAGMENT_CHUNK_BYTES\n      const chunk = message.subarray(start, Math.min(message.byteLength, start + SECURE_FRAGMENT_CHUNK_BYTES))\n      const frame = new Uint8Array(SECURE_FRAGMENT_HEADER_BYTES + chunk.byteLength)\n      frame.set(SECURE_FRAGMENT_MAGIC)\n      frame[4] = SECURE_FRAGMENT_VERSION\n      const view = new DataView(frame.buffer)\n      view.setUint32(5, messageId)\n      view.setUint16(9, index)\n      view.setUint16(11, total)\n      view.setUint32(13, message.byteLength)\n      frame.set(chunk, SECURE_FRAGMENT_HEADER_BYTES)\n      frames.push(frame)\n    }\n    return frames\n  }\n\n  decode(frame: Uint8Array): Uint8Array | undefined {\n    if (!isSecureFragment(frame)) return frame\n    if (frame.byteLength < SECURE_FRAGMENT_HEADER_BYTES || frame[4] !== SECURE_FRAGMENT_VERSION) {\n      throw new Error('Secure fragment header is invalid.')\n    }\n    const view = new DataView(frame.buffer, frame.byteOffset, frame.byteLength)\n    const messageId = view.getUint32(5)\n    const index = view.getUint16(9)\n    const total = view.getUint16(11)\n    const totalBytes = view.getUint32(13)\n    if (messageId === 0 || total < 2 || index >= total || totalBytes <= SECURE_FRAGMENT_CHUNK_BYTES\n      || totalBytes > MAX_SECURE_MESSAGE_BYTES\n      || total !== Math.ceil(totalBytes / SECURE_FRAGMENT_CHUNK_BYTES)) {\n      throw new Error('Secure fragment metadata is invalid.')\n    }\n    const expectedChunkBytes = Math.min(\n      SECURE_FRAGMENT_CHUNK_BYTES,\n      totalBytes - index * SECURE_FRAGMENT_CHUNK_BYTES,\n    )\n    const chunk = frame.subarray(SECURE_FRAGMENT_HEADER_BYTES)\n    if (chunk.byteLength !== expectedChunkBytes) throw new Error('Secure fragment length is invalid.')\n\n    let assembly = this.assemblies.get(messageId)\n    if (assembly === undefined) {\n      if (index !== 0 || this.assemblies.size >= MAX_IN_FLIGHT_SECURE_MESSAGES) {\n        throw new Error('Secure fragment sequence is invalid.')\n      }\n      assembly = { total, totalBytes, receivedBytes: 0, chunks: [] }\n      this.assemblies.set(messageId, assembly)\n    }\n    if (assembly.total !== total || assembly.totalBytes !== totalBytes || index !== assembly.chunks.length) {\n      this.assemblies.delete(messageId)\n      throw new Error('Secure fragment sequence is invalid.')\n    }\n    assembly.chunks.push(Uint8Array.from(chunk))\n    assembly.receivedBytes += chunk.byteLength\n    if (assembly.chunks.length < total) return undefined\n    this.assemblies.delete(messageId)\n    if (assembly.receivedBytes !== totalBytes) throw new Error('Secure message length is invalid.')\n    const message = new Uint8Array(totalBytes)\n    let offset = 0\n    for (const part of assembly.chunks) {\n      message.set(part, offset)\n      offset += part.byteLength\n    }\n    return message\n  }\n\n  reset(): void {\n    this.nextMessageId = 1\n    this.assemblies.clear()\n  }\n}\n\nfunction isSecureFragment(frame: Uint8Array): boolean {\n  if (frame.byteLength < SECURE_FRAGMENT_MAGIC.byteLength) return false\n  for (let index = 0; index < SECURE_FRAGMENT_MAGIC.byteLength; index += 1) {\n    if (frame[index] !== SECURE_FRAGMENT_MAGIC[index]) return false\n  }\n  return true\n}\n\nfunction cryptoRandomId(): string {\n  const g = globalThis.crypto\n  if (g?.randomUUID) return g.randomUUID()\n  return `msg_${Date.now().toString(36)}_${Math.random().toString(36).slice(2)}`\n}\n", "import {\n  createRpcRequest,\n  decodeMessage,\n  encodeMessage,\n  type EventPayload,\n  type RemoteEventName,\n  type RemoteMessage,\n  type RpcErrorPayload,\n  type RpcMethod,\n  type RpcResponsePayload,\n} from '@dsh-remote/protocol'\nimport type { RemoteTransport } from '@dsh-remote/webrtc'\n\ninterface PendingCall {\n  resolve: (value: unknown) => void\n  reject: (error: Error) => void\n  timer: ReturnType<typeof setTimeout>\n  removeAbort?: () => void\n}\n\nexport class RemoteClientCore {\n  private readonly pending = new Map<string, PendingCall>()\n  private readonly eventHandlers = new Set<(event: EventPayload) => void>()\n  private unsubscribeTransport?: () => void\n  private unsubscribeClose?: () => void\n  private readonly closeHandlers = new Set<() => void>()\n\n  constructor(private readonly transport: RemoteTransport, private readonly timeoutMs = 30_000) {}\n\n  async connect(): Promise<void> {\n    if (this.unsubscribeTransport !== undefined) return\n    this.unsubscribeTransport = this.transport.onMessage(data => this.handleMessage(data))\n    this.unsubscribeClose = this.transport.onClose?.(() => this.handleTransportClose())\n    try {\n      await this.transport.connect()\n    } catch (error) {\n      this.unsubscribeTransport()\n      this.unsubscribeTransport = undefined\n      this.unsubscribeClose?.()\n      this.unsubscribeClose = undefined\n      throw error\n    }\n  }\n\n  async rpc<TResult = unknown, TParams = unknown>(method: string, params: TParams, signal?: AbortSignal): Promise<TResult> {\n    signal?.throwIfAborted()\n    const request = createRpcRequest(method as RpcMethod, params)\n    const result = new Promise<TResult>((resolve, reject) => {\n      const timer = setTimeout(() => {\n        const pending = this.pending.get(request.id)\n        pending?.removeAbort?.()\n        this.pending.delete(request.id)\n        reject(new Error(`RPC ${method} timed out`))\n      }, this.timeoutMs)\n      const pending: PendingCall = { resolve: resolve as (value: unknown) => void, reject, timer }\n      if (signal !== undefined) {\n        const onAbort = () => {\n          if (this.pending.get(request.id) !== pending) return\n          clearTimeout(timer)\n          this.pending.delete(request.id)\n          reject(signal.reason instanceof Error ? signal.reason : new Error('RPC was cancelled'))\n        }\n        signal.addEventListener('abort', onAbort, { once: true })\n        pending.removeAbort = () => signal.removeEventListener('abort', onAbort)\n      }\n      this.pending.set(request.id, pending)\n    })\n    try {\n      await this.transport.send(encodeMessage(request))\n    } catch (error) {\n      const pending = this.pending.get(request.id)\n      if (pending !== undefined) {\n        clearTimeout(pending.timer)\n        pending.removeAbort?.()\n      }\n      this.pending.delete(request.id)\n      throw error\n    }\n    return result\n  }\n\n  onEvent(handler: (event: EventPayload) => void): () => void {\n    this.eventHandlers.add(handler)\n    return () => this.eventHandlers.delete(handler)\n  }\n\n  onClose(handler: () => void): () => void {\n    this.closeHandlers.add(handler)\n    return () => this.closeHandlers.delete(handler)\n  }\n\n  getStats() {\n    return this.transport.getStats()\n  }\n\n  async close(): Promise<void> {\n    this.unsubscribeTransport?.()\n    this.unsubscribeTransport = undefined\n    this.unsubscribeClose?.()\n    this.unsubscribeClose = undefined\n    await this.transport.close()\n    for (const pending of this.pending.values()) {\n      clearTimeout(pending.timer)\n      pending.removeAbort?.()\n      pending.reject(new Error('remote client closed'))\n    }\n    this.pending.clear()\n  }\n\n  private handleTransportClose(): void {\n    for (const pending of this.pending.values()) {\n      clearTimeout(pending.timer)\n      pending.removeAbort?.()\n      pending.reject(new Error('remote transport closed'))\n    }\n    this.pending.clear()\n    for (const handler of this.closeHandlers) handler()\n  }\n\n  private handleMessage(data: Uint8Array): void {\n    const message = decodeMessage(data)\n    if (message.type === 'rpc.response') this.handleResponse(message as RemoteMessage<RpcResponsePayload>)\n    if (message.type === 'rpc.error') this.handleError(message as RemoteMessage<RpcErrorPayload>)\n    if (message.type === 'event') {\n      const event = message.payload as EventPayload\n      for (const handler of this.eventHandlers) handler(event)\n    }\n  }\n\n  private handleResponse(message: RemoteMessage<RpcResponsePayload>): void {\n    const pending = this.pending.get(message.payload.requestId)\n    if (pending === undefined) return\n    this.pending.delete(message.payload.requestId)\n    clearTimeout(pending.timer)\n    pending.removeAbort?.()\n    pending.resolve(message.payload.result)\n  }\n\n  private handleError(message: RemoteMessage<RpcErrorPayload>): void {\n    const pending = this.pending.get(message.payload.requestId)\n    if (pending === undefined) return\n    this.pending.delete(message.payload.requestId)\n    clearTimeout(pending.timer)\n    pending.removeAbort?.()\n    pending.reject(Object.assign(new Error(message.payload.message), { code: message.payload.code }))\n  }\n}\n\nexport type { EventPayload, RemoteEventName, RemoteTransport }\n", "import type { TransportStats } from '@dsh-remote/protocol'\n\nexport interface RemoteTransport {\n  connect(): Promise<void>\n  send(data: Uint8Array): Promise<void>\n  onMessage(cb: (data: Uint8Array) => void): () => void\n  onClose?(cb: () => void): () => void\n  close(): Promise<void>\n  getStats(): TransportStats\n}\n\nexport interface SecureHandshakeTransport extends RemoteTransport {\n  connectionInfo(): { connectionId: string; localDeviceId: string; remoteDeviceId: string }\n  sendHandshake(step: number, data: Uint8Array): Promise<void>\n  onHandshake(cb: (step: number, data: Uint8Array) => void): () => void\n}\n\ntype MessageHandler = (data: Uint8Array) => void\n\nexport abstract class BaseTransport implements RemoteTransport {\n  protected handlers = new Set<MessageHandler>()\n  protected closeHandlers = new Set<() => void>()\n\n  onMessage(cb: MessageHandler): () => void {\n    this.handlers.add(cb)\n    return () => this.handlers.delete(cb)\n  }\n\n  onClose(cb: () => void): () => void {\n    this.closeHandlers.add(cb)\n    return () => this.closeHandlers.delete(cb)\n  }\n\n  protected emit(data: Uint8Array): void {\n    for (const handler of this.handlers) handler(data)\n  }\n\n  protected emitClose(): void {\n    for (const handler of this.closeHandlers) handler()\n  }\n\n  abstract connect(): Promise<void>\n  abstract send(data: Uint8Array): Promise<void>\n  abstract close(): Promise<void>\n  abstract getStats(): TransportStats\n}\n", "export async function socketText(data: string | ArrayBuffer | Blob): Promise<string> {\n  if (typeof data === 'string') return data\n  if (data instanceof ArrayBuffer) return new TextDecoder().decode(data)\n  return new TextDecoder().decode(await data.arrayBuffer())\n}\n\nexport function toBase64Url(bytes: Uint8Array): string {\n  const binary = Array.from(bytes, byte => String.fromCharCode(byte)).join('')\n  const base64 = typeof btoa === 'function' ? btoa(binary) : Buffer.from(bytes).toString('base64')\n  return base64.replaceAll('+', '-').replaceAll('/', '_').replaceAll('=', '')\n}\n\nexport function fromBase64Url(value: string): Uint8Array {\n  const normalized = value.replaceAll('-', '+').replaceAll('_', '/')\n  const padded = normalized.padEnd(Math.ceil(normalized.length / 4) * 4, '=')\n  if (typeof atob === 'function') return Uint8Array.from(atob(padded), char => char.charCodeAt(0))\n  return new Uint8Array(Buffer.from(padded, 'base64'))\n}\n", "/**\n * Environment-agnostic RTC peer-connection surface.\n *\n * The transport state machine only talks to these narrow interfaces so the\n * browser native `RTCPeerConnection` and a future Node host backend can both\n * provide the underlying peer connection without the business code depending\n * on a specific RTC implementation (webrtc-implementation-plan.md \u00A76.1/\u00A76.2).\n */\n\nexport interface RtcIceServer {\n  urls: string | string[]\n  username?: string\n  credential?: string\n}\n\nexport interface RtcIceCandidateInit {\n  candidate?: string\n  sdpMid?: string | null\n  sdpMLineIndex?: number | null\n  usernameFragment?: string | null\n}\n\nexport interface RtcSessionDescriptionInit {\n  type: 'offer' | 'answer'\n  sdp?: string\n}\n\nexport interface RtcDataChannelInit {\n  ordered?: boolean\n}\n\nexport interface RtcDataChannel {\n  readonly label: string\n  readonly ordered: boolean\n  readyState: 'connecting' | 'open' | 'closing' | 'closed'\n  bufferedAmount: number\n  binaryType: string\n  onopen: (() => void) | null\n  onmessage: ((event: { data: ArrayBuffer | string }) => void) | null\n  onclose: (() => void) | null\n  onerror: (() => void) | null\n  onbufferedamountlow: (() => void) | null\n  send(data: ArrayBuffer | string): void\n  close(): void\n}\n\nexport interface RtcPeerConnection {\n  connectionState: string\n  iceConnectionState: string\n  iceGatheringState: string\n  signalingState: string\n  onconnectionstatechange: (() => void) | null\n  oniceconnectionstatechange: (() => void) | null\n  onicegatheringstatechange: (() => void) | null\n  onicecandidate: ((event: { candidate: RtcIceCandidateInit | null }) => void) | null\n  ondatachannel: ((event: { channel: RtcDataChannel }) => void) | null\n  createDataChannel(label: string, options?: RtcDataChannelInit): RtcDataChannel\n  createOffer(): Promise<RtcSessionDescriptionInit>\n  createAnswer(): Promise<RtcSessionDescriptionInit>\n  setLocalDescription(description?: RtcSessionDescriptionInit): Promise<void>\n  setRemoteDescription(description: RtcSessionDescriptionInit): Promise<void>\n  addIceCandidate(candidate?: RtcIceCandidateInit): Promise<void>\n  getStats(): Promise<RtcStats>\n  close(): void\n}\n\n/** A single WebRTC stats report entry (id -> typed record). */\nexport interface RtcStatsEntry {\n  type?: string\n  [key: string]: unknown\n}\n\nexport type RtcStats = Iterable<readonly [string, RtcStatsEntry]>\n\nexport interface RtcPeerConnectionFactory {\n  create(configuration: { iceServers?: RtcIceServer[] }): RtcPeerConnection\n}\n\nexport const RTC_DATA_CHANNEL_LABEL = 'dsh'\nexport const RTC_DATA_CHANNEL_OPTIONS = { ordered: true } as const\n\n/**\n * Default browser-backed factory. This module is the only place in the webrtc\n * package that references the DOM `RTCPeerConnection` global, so Node hosts\n * inject their own factory and never import browser natives.\n */\nexport function browserRtcFactory(): RtcPeerConnectionFactory {\n  return {\n    create(configuration) {\n      // `any` keeps the DOM handler `this`/event typing out of the adapter.\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const raw = new RTCPeerConnection(configuration) as any\n      return {\n        get connectionState(): string { return raw.connectionState as string },\n        get iceConnectionState(): string { return raw.iceConnectionState as string },\n        get iceGatheringState(): string { return raw.iceGatheringState as string },\n        get signalingState(): string { return raw.signalingState as string },\n        set onconnectionstatechange(value) { raw.onconnectionstatechange = value },\n        get onconnectionstatechange() { return raw.onconnectionstatechange as (() => void) | null },\n        set oniceconnectionstatechange(value) { raw.oniceconnectionstatechange = value },\n        get oniceconnectionstatechange() { return raw.oniceconnectionstatechange as (() => void) | null },\n        set onicegatheringstatechange(value) { raw.onicegatheringstatechange = value },\n        get onicegatheringstatechange() { return raw.onicegatheringstatechange as (() => void) | null },\n        set onicecandidate(value) { raw.onicecandidate = value },\n        get onicecandidate() { return raw.onicecandidate as ((event: { candidate: RtcIceCandidateInit | null }) => void) | null },\n        set ondatachannel(value) { raw.ondatachannel = value },\n        get ondatachannel() { return raw.ondatachannel as ((event: { channel: RtcDataChannel }) => void) | null },\n        createDataChannel(label, options) { return adaptDataChannel(raw.createDataChannel(label, options)) },\n        createOffer() { return raw.createOffer() },\n        createAnswer() { return raw.createAnswer() },\n        setLocalDescription(description) { return raw.setLocalDescription(description) },\n        setRemoteDescription(description) { return raw.setRemoteDescription(description) },\n        addIceCandidate(candidate) { return raw.addIceCandidate(candidate) },\n        async getStats() { return await raw.getStats() },\n        close() { raw.close() },\n      }\n    },\n  }\n}\n\nfunction adaptDataChannel(raw: RTCDataChannel): RtcDataChannel {\n  return {\n    get label(): string { return raw.label },\n    get ordered(): boolean { return raw.ordered },\n    get readyState() { return raw.readyState },\n    get bufferedAmount(): number { return raw.bufferedAmount },\n    get binaryType(): string { return raw.binaryType },\n    set onopen(value) { raw.onopen = value },\n    get onopen() { return raw.onopen as (() => void) | null },\n    set onmessage(value) { raw.onmessage = value },\n    get onmessage() { return raw.onmessage as ((event: { data: ArrayBuffer | string }) => void) | null },\n    set onclose(value) { raw.onclose = value },\n    get onclose() { return raw.onclose as (() => void) | null },\n    set onerror(value) { raw.onerror = value },\n    get onerror() { return raw.onerror as (() => void) | null },\n    set onbufferedamountlow(value) { raw.onbufferedamountlow = value },\n    get onbufferedamountlow() { return raw.onbufferedamountlow as (() => void) | null },\n    send(data) { raw.send(data as never) },\n    close() { raw.close() },\n  }\n}\n", "/**\n * WebRTC transport-level chunking (webrtc-implementation-plan workaround).\n *\n * werift's SCTP `send()` blocks until a whole message is handed to the wire\n * through the slow-start congestion window, which stalls for large messages\n * when the peer is Chromium. To keep every DataChannel message small, large\n * Noise ciphertext frames are split here \u2014 *below* the DataChannel, *above*\n * Noise \u2014 and transparently reassembled on the other side. The Remote Protocol\n * and Noise semantics are untouched; this layer only changes how ciphertext\n * bytes are framed over the DataChannel.\n *\n * Frame layout (only when the payload exceeds the chunk size):\n *\n *   [0..4)  magic  \"RTCH\"\n *   [4..8)  messageId  uint32\n *   [8..10) index      uint16\n *   [10..12) total     uint16\n *   [12..)  payload    up to RTC_CHUNK_PAYLOAD_BYTES\n */\n\nexport const RTC_CHUNK_MAGIC = new Uint8Array([0x52, 0x54, 0x43, 0x48]) // \"RTCH\"\nexport const RTC_CHUNK_HEADER_BYTES = 12\nexport const RTC_CHUNK_PAYLOAD_BYTES = 8 * 1024\nexport const RTC_CHUNK_MAX_MESSAGE_BYTES = 4 * 1024 * 1024\nconst RTC_CHUNK_MAX_TOTAL = Math.ceil(RTC_CHUNK_MAX_MESSAGE_BYTES / RTC_CHUNK_PAYLOAD_BYTES)\nconst MAX_IN_FLIGHT_MESSAGES = 8\nconst MAX_ASSEMBLY_AGE_MS = 30_000\n\ninterface Assembly {\n  messageId: number\n  total: number\n  receivedBytes: number\n  chunks: Uint8Array[]\n  updatedAt: number\n}\n\nexport class RtcChunkCodec {\n  private nextMessageId = 1\n  private readonly assemblies = new Map<number, Assembly>()\n\n  encode(data: Uint8Array): Uint8Array[] {\n    if (data.byteLength <= RTC_CHUNK_PAYLOAD_BYTES) return [data]\n    if (data.byteLength > RTC_CHUNK_MAX_MESSAGE_BYTES) {\n      throw new Error('WebRTC transport message exceeds the reassembly limit.')\n    }\n    const messageId = this.nextMessageId\n    this.nextMessageId = messageId === 0xffff_ffff ? 1 : messageId + 1\n    const total = Math.ceil(data.byteLength / RTC_CHUNK_PAYLOAD_BYTES)\n    const frames: Uint8Array[] = []\n    for (let index = 0; index < total; index += 1) {\n      const start = index * RTC_CHUNK_PAYLOAD_BYTES\n      const chunk = data.subarray(start, Math.min(data.byteLength, start + RTC_CHUNK_PAYLOAD_BYTES))\n      const frame = new Uint8Array(RTC_CHUNK_HEADER_BYTES + chunk.byteLength)\n      frame.set(RTC_CHUNK_MAGIC)\n      const view = new DataView(frame.buffer)\n      view.setUint32(4, messageId)\n      view.setUint16(8, index)\n      view.setUint16(10, total)\n      frame.set(chunk, RTC_CHUNK_HEADER_BYTES)\n      frames.push(frame)\n    }\n    return frames\n  }\n\n  decode(frame: Uint8Array): Uint8Array | undefined {\n    if (!isChunk(frame)) {\n      if (frame.byteLength > RTC_CHUNK_MAX_MESSAGE_BYTES) {\n        throw new Error('WebRTC transport message exceeds the reassembly limit.')\n      }\n      return frame\n    }\n    if (frame.byteLength < RTC_CHUNK_HEADER_BYTES) throw new Error('WebRTC transport chunk header is invalid.')\n    const view = new DataView(frame.buffer, frame.byteOffset, frame.byteLength)\n    const messageId = view.getUint32(4)\n    const index = view.getUint16(8)\n    const total = view.getUint16(10)\n    if (messageId === 0 || total < 2 || total > RTC_CHUNK_MAX_TOTAL || index >= total) {\n      throw new Error('WebRTC transport chunk metadata is invalid.')\n    }\n    const chunk = frame.subarray(RTC_CHUNK_HEADER_BYTES)\n    if (chunk.byteLength > RTC_CHUNK_PAYLOAD_BYTES\n      || (index < total - 1 && chunk.byteLength !== RTC_CHUNK_PAYLOAD_BYTES)\n      || (index === total - 1 && chunk.byteLength === 0)) {\n      throw new Error('WebRTC transport chunk length is invalid.')\n    }\n\n    this.pruneStale()\n    let assembly = this.assemblies.get(messageId)\n    if (assembly === undefined) {\n      if (index !== 0 || this.assemblies.size >= MAX_IN_FLIGHT_MESSAGES) {\n        throw new Error('WebRTC transport chunk sequence is invalid.')\n      }\n      assembly = { messageId, total, receivedBytes: 0, chunks: [], updatedAt: Date.now() }\n      this.assemblies.set(messageId, assembly)\n    }\n    if (assembly.total !== total || index !== assembly.chunks.length) {\n      this.assemblies.delete(messageId)\n      throw new Error('WebRTC transport chunk sequence is invalid.')\n    }\n    const receivedBytes = assembly.receivedBytes + chunk.byteLength\n    if (receivedBytes > RTC_CHUNK_MAX_MESSAGE_BYTES) {\n      this.assemblies.delete(messageId)\n      throw new Error('WebRTC transport message exceeds the reassembly limit.')\n    }\n    assembly.chunks.push(Uint8Array.from(chunk))\n    assembly.receivedBytes = receivedBytes\n    assembly.updatedAt = Date.now()\n    if (assembly.chunks.length < total) return undefined\n    this.assemblies.delete(messageId)\n    const message = new Uint8Array(assembly.receivedBytes)\n    let offset = 0\n    for (const part of assembly.chunks) {\n      message.set(part, offset)\n      offset += part.byteLength\n    }\n    return message\n  }\n\n  reset(): void {\n    this.nextMessageId = 1\n    this.assemblies.clear()\n  }\n\n  private pruneStale(): void {\n    const now = Date.now()\n    for (const [messageId, assembly] of this.assemblies) {\n      if (now - assembly.updatedAt > MAX_ASSEMBLY_AGE_MS) this.assemblies.delete(messageId)\n    }\n  }\n}\n\nfunction isChunk(frame: Uint8Array): boolean {\n  if (frame.byteLength < RTC_CHUNK_MAGIC.byteLength) return false\n  for (let index = 0; index < RTC_CHUNK_MAGIC.byteLength; index += 1) {\n    if (frame[index] !== RTC_CHUNK_MAGIC[index]) return false\n  }\n  return true\n}\n", "import type { TransportStats } from '@dsh-remote/protocol'\nimport {\n  RTC_DATA_CHANNEL_LABEL,\n  RTC_DATA_CHANNEL_OPTIONS,\n  type RtcDataChannel,\n  type RtcIceCandidateInit,\n  type RtcIceServer,\n  type RtcPeerConnection,\n  type RtcPeerConnectionFactory,\n  type RtcStats,\n  type RtcStatsEntry,\n} from './rtc-adapter.js'\nimport { RtcChunkCodec, RTC_CHUNK_MAX_MESSAGE_BYTES } from './rtc-chunking.js'\n\nexport type RtcRole = 'initiator' | 'responder'\nexport type RtcSelectedTransport = 'p2p' | 'turn'\n\nexport type RtcSignal =\n  | { type: 'offer'; sdp: string }\n  | { type: 'answer'; sdp: string }\n  | { type: 'ice'; candidate: RtcIceCandidateInit }\n\nexport interface RtcDataChannelTransportOptions {\n  role: RtcRole\n  iceServers?: RtcIceServer[]\n  factory: RtcPeerConnectionFactory\n  onSignal: (signal: RtcSignal) => void\n  negotiateTimeoutMs?: number\n  channelLabel?: string\n  /** Send watchdog: if a frame stays queued longer than this, the transport is failed. */\n  sendTimeoutMs?: number\n  /** Human-readable diagnostic label; never logged with sensitive content. */\n  label?: string\n}\n\nconst DEFAULT_NEGOTIATE_TIMEOUT_MS = 8_000\nconst DEFAULT_SEND_TIMEOUT_MS = 5_000\n\n/**\n * Complete WebRTC DataChannel transport state machine (webrtc plan \u00A76.1).\n *\n * Owns one `RTCPeerConnection` + ordered `dsh` DataChannel for a single\n * connection establishment. It emits offer/answer/trickle-ICE via `onSignal`\n * and consumes the peer's signaling through `handleSignal`; the owner wires\n * those two ends to the Server control channel. `connect()` resolves only\n * once the DataChannel reaches `open`.\n */\nexport class RtcDataChannelTransport {\n  private readonly pc: RtcPeerConnection\n  private readonly role: RtcRole\n  private readonly onSignal: (signal: RtcSignal) => void\n  private readonly negotiateTimeoutMs: number\n  private readonly channelLabel: string\n  private readonly sendTimeoutMs: number\n\n  private channel?: RtcDataChannel\n  private readonly remoteCandidates: RtcIceCandidateInit[] = []\n  private remoteDescriptionSet = false\n  private opened = false\n  private closed = false\n\n  private readonly messageHandlers = new Set<(data: Uint8Array) => void>()\n  private readonly closeHandlers = new Set<() => void>()\n  private readonly errorHandlers = new Set<(error: Error) => void>()\n\n  private connectPromise?: Promise<void>\n  private openResolve?: () => void\n  private openReject?: (error: Error) => void\n  private negotiateTimer?: ReturnType<typeof setTimeout>\n  private removeAbort?: () => void\n  private watchdogTimer?: ReturnType<typeof setTimeout>\n\n  private readonly outgoing = new RtcChunkCodec()\n  private readonly incoming = new RtcChunkCodec()\n  private bytesSent = 0\n  private bytesReceived = 0\n  private selected?: RtcSelectedTransport\n  private lastBufferedAmount = 0\n\n  constructor(options: RtcDataChannelTransportOptions) {\n    this.role = options.role\n    this.onSignal = options.onSignal\n    this.negotiateTimeoutMs = options.negotiateTimeoutMs ?? DEFAULT_NEGOTIATE_TIMEOUT_MS\n    this.channelLabel = options.channelLabel ?? RTC_DATA_CHANNEL_LABEL\n    this.sendTimeoutMs = options.sendTimeoutMs ?? DEFAULT_SEND_TIMEOUT_MS\n\n    this.pc = options.factory.create({ iceServers: options.iceServers })\n    this.pc.ondatachannel = event => this.adoptChannel(event.channel)\n    this.pc.onicecandidate = event => {\n      if (event.candidate !== null && !this.closed) {\n        this.onSignal({ type: 'ice', candidate: event.candidate })\n      }\n    }\n    this.pc.onconnectionstatechange = () => this.checkConnectionState()\n    this.pc.oniceconnectionstatechange = () => this.checkConnectionState()\n  }\n\n  /** Begin negotiation; resolves when the DataChannel is open. */\n  connect(signal?: AbortSignal): Promise<void> {\n    if (this.opened) return Promise.resolve()\n    if (this.connectPromise !== undefined) return this.connectPromise\n    this.armAbort(signal)\n    this.connectPromise = new Promise<void>((resolve, reject) => {\n      this.openResolve = resolve\n      this.openReject = reject\n      this.negotiateTimer = setTimeout(() => {\n        this.failOpen(new RtcConnectError('RTC_CONNECT_TIMEOUT', `WebRTC negotiation timed out after ${this.negotiateTimeoutMs}ms.`))\n      }, this.negotiateTimeoutMs)\n      if (this.role === 'initiator') {\n        void this.startInitiator().catch(error => this.failOpen(asError(error)))\n      }\n    })\n    return this.connectPromise\n  }\n\n  handleSignal(signal: RtcSignal): void {\n    if (this.closed) return\n    if (signal.type === 'offer') void this.handleOffer(signal.sdp)\n    else if (signal.type === 'answer') void this.handleAnswer(signal.sdp)\n    else void this.handleIce(signal.candidate)\n  }\n\n  async send(data: Uint8Array): Promise<void> {\n    const channel = this.requireOpenChannel()\n    if (channel.readyState !== 'open') throw new Error('WebRTC data channel is not open.')\n    for (const frame of this.outgoing.encode(data)) {\n      try {\n        channel.send(toArrayBuffer(frame))\n      } catch (error) {\n        console.error('[rtc-send-error] bytes=' + frame.byteLength, error instanceof Error ? error.message : error)\n        throw error\n      }\n    }\n    this.bytesSent += data.byteLength\n    this.armWatchdog(channel)\n  }\n\n  onMessage(handler: (data: Uint8Array) => void): () => void {\n    this.messageHandlers.add(handler)\n    return () => this.messageHandlers.delete(handler)\n  }\n\n  onClose(handler: () => void): () => void {\n    this.closeHandlers.add(handler)\n    return () => this.closeHandlers.delete(handler)\n  }\n\n  onError(handler: (error: Error) => void): () => void {\n    this.errorHandlers.add(handler)\n    return () => this.errorHandlers.delete(handler)\n  }\n\n  selectedTransport(): RtcSelectedTransport | undefined {\n    return this.selected\n  }\n\n  getStats(): TransportStats {\n    const connected = this.channel?.readyState === 'open'\n    return {\n      mode: !connected ? 'Disconnected' : this.selected === 'turn' ? 'TURN' : 'P2P',\n      connected,\n      bytesSent: this.bytesSent,\n      bytesReceived: this.bytesReceived,\n    }\n  }\n\n  /** Idempotent close: releases PeerConnection, DataChannel, timers and listeners. */\n  async close(): Promise<void> {\n    if (this.closed) return\n    this.closed = true\n    this.clearNegotiation()\n    this.clearWatchdog()\n    const channel = this.channel\n    this.channel = undefined\n    if (channel !== undefined) {\n      channel.onopen = null\n      channel.onmessage = null\n      channel.onclose = null\n      channel.onerror = null\n      channel.onbufferedamountlow = null\n      try { channel.close() } catch { /* already closed */ }\n    }\n    this.pc.onicecandidate = null\n    this.pc.ondatachannel = null\n    this.pc.onconnectionstatechange = null\n    this.pc.oniceconnectionstatechange = null\n    try { this.pc.close() } catch { /* already closed */ }\n    if (this.opened) {\n      this.opened = false\n      for (const handler of this.closeHandlers) handler()\n    }\n  }\n\n  private armAbort(signal: AbortSignal | undefined): void {\n    this.removeAbort?.()\n    this.removeAbort = undefined\n    if (signal === undefined) return\n    const onAbort = () => {\n      this.failOpen(new RtcConnectError('RTC_ABORTED', 'WebRTC negotiation was aborted.'))\n    }\n    signal.addEventListener('abort', onAbort, { once: true })\n    this.removeAbort = () => signal.removeEventListener('abort', onAbort)\n    if (signal.aborted) onAbort()\n  }\n\n  private async startInitiator(): Promise<void> {\n    const channel = this.pc.createDataChannel(this.channelLabel, RTC_DATA_CHANNEL_OPTIONS)\n    this.adoptChannel(channel)\n    const offer = await this.pc.createOffer()\n    await this.pc.setLocalDescription(offer)\n    this.onSignal({ type: 'offer', sdp: requireSdp(offer) })\n  }\n\n  private async handleOffer(sdp: string): Promise<void> {\n    if (this.role !== 'responder' || this.remoteDescriptionSet) {\n      this.failOpen(new RtcConnectError('RTC_INVALID_STATE', 'Received an unexpected WebRTC offer.'))\n      return\n    }\n    try {\n      await this.pc.setRemoteDescription({ type: 'offer', sdp })\n      this.remoteDescriptionSet = true\n      await this.flushRemoteCandidates()\n      const answer = await this.pc.createAnswer()\n      await this.pc.setLocalDescription(answer)\n      this.onSignal({ type: 'answer', sdp: requireSdp(answer) })\n    } catch (error) {\n      this.failOpen(asError(error))\n    }\n  }\n\n  private async handleAnswer(sdp: string): Promise<void> {\n    if (this.role !== 'initiator' || this.remoteDescriptionSet) {\n      this.failOpen(new RtcConnectError('RTC_INVALID_STATE', 'Received an unexpected WebRTC answer.'))\n      return\n    }\n    try {\n      await this.pc.setRemoteDescription({ type: 'answer', sdp })\n      this.remoteDescriptionSet = true\n      await this.flushRemoteCandidates()\n    } catch (error) {\n      this.failOpen(asError(error))\n    }\n  }\n\n  private async handleIce(candidate: RtcIceCandidateInit): Promise<void> {\n    if (!this.remoteDescriptionSet) {\n      this.remoteCandidates.push(candidate)\n      return\n    }\n    try {\n      await this.pc.addIceCandidate(candidate)\n    } catch {\n      // Ignore malformed/duplicate candidates; the connection either proceeds\n      // or the negotiation timeout surfaces the failure.\n    }\n  }\n\n  private async flushRemoteCandidates(): Promise<void> {\n    const buffered = this.remoteCandidates.splice(0, this.remoteCandidates.length)\n    for (const candidate of buffered) {\n      try { await this.pc.addIceCandidate(candidate) } catch { /* ignored */ }\n    }\n  }\n\n  private adoptChannel(channel: RtcDataChannel): void {\n    if (this.channel !== undefined && this.channel !== channel) {\n      try { channel.close() } catch { /* ignored */ }\n      return\n    }\n    this.channel = channel\n    channel.binaryType = 'arraybuffer'\n    channel.onopen = () => {\n      if (this.closed || this.opened) return\n      this.opened = true\n      const resolve = this.openResolve\n      this.clearNegotiation()\n      void this.resolveSelectedTransport().then(() => resolve?.())\n    }\n    channel.onmessage = event => {\n      if (this.closed || !this.opened) return\n      const data = event.data\n      const frame = typeof data === 'string' ? new TextEncoder().encode(data) : new Uint8Array(data)\n      this.bytesReceived += frame.byteLength\n      try {\n        const message = this.incoming.decode(frame)\n        if (message === undefined) return\n        for (const handler of this.messageHandlers) handler(message)\n      } catch {\n        void this.close()\n      }\n    }\n    channel.onclose = () => {\n      if (this.closed) return\n      this.failOpen(new RtcConnectError('RTC_CLOSED', 'WebRTC data channel closed.'))\n      if (this.opened) {\n        this.opened = false\n        for (const handler of this.closeHandlers) handler()\n      }\n    }\n    channel.onerror = () => {\n      const error = new RtcConnectError('RTC_FAILED', 'WebRTC data channel reported an error.')\n      this.failOpen(error)\n      for (const handler of this.errorHandlers) handler(error)\n    }\n  }\n\n  private async resolveSelectedTransport(): Promise<void> {\n    try {\n      this.selected = detectSelectedTransport(await this.pc.getStats())\n    } catch {\n      this.selected = undefined\n    }\n  }\n\n  private checkConnectionState(): void {\n    if (this.closed || this.opened) return\n    if (this.pc.connectionState === 'failed' || this.pc.iceConnectionState === 'failed'\n      || this.pc.connectionState === 'closed' || this.pc.iceConnectionState === 'closed') {\n      this.failOpen(new RtcConnectError('RTC_FAILED', 'WebRTC peer connection failed before the data channel opened.'))\n    }\n  }\n\n  private failOpen(error: Error): void {\n    if (this.closed || this.opened || this.openReject === undefined) return\n    const reject = this.openReject\n    this.clearNegotiation()\n    this.openResolve = undefined\n    this.openReject = undefined\n    reject(error)\n    void this.close()\n  }\n\n  private clearNegotiation(): void {\n    if (this.negotiateTimer !== undefined) clearTimeout(this.negotiateTimer)\n    this.negotiateTimer = undefined\n    this.removeAbort?.()\n    this.removeAbort = undefined\n    this.openResolve = undefined\n    this.openReject = undefined\n  }\n\n  private requireOpenChannel(): RtcDataChannel {\n    const channel = this.channel\n    if (channel === undefined || channel.readyState !== 'open' || this.closed || !this.opened) {\n      throw new Error('WebRTC data channel is not open.')\n    }\n    return channel\n  }\n\n  private armWatchdog(channel: RtcDataChannel): void {\n    if (this.watchdogTimer !== undefined || this.closed) return\n    const baseline = channel.bufferedAmount\n    if (baseline <= 0) return\n    this.lastBufferedAmount = baseline\n    this.watchdogTimer = setTimeout(() => {\n      this.watchdogTimer = undefined\n      if (this.closed || this.channel !== channel || channel.readyState !== 'open') return\n      const current = channel.bufferedAmount\n      if (current > 0 && current >= this.lastBufferedAmount) {\n        // The outbound queue has not drained since the last check: the peer is\n        // not ACKing. Treat the transport as unhealthy so the owner can fall\n        // back instead of leaving the RPC sender queue blocked forever.\n        const error = new RtcConnectError('RTC_SEND_TIMEOUT', 'DataChannel send stalled.')\n        for (const handler of this.errorHandlers) handler(error)\n        void this.close()\n        return\n      }\n      this.lastBufferedAmount = current\n      if (current > 0) this.armWatchdog(channel)\n    }, this.sendTimeoutMs)\n  }\n\n  private clearWatchdog(): void {\n    if (this.watchdogTimer !== undefined) clearTimeout(this.watchdogTimer)\n    this.watchdogTimer = undefined\n    this.lastBufferedAmount = 0\n  }\n}\n\nexport class RtcConnectError extends Error {\n  constructor(readonly code: string, message: string) { super(message) }\n}\n\nexport function detectSelectedTransport(stats: RtcStats): RtcSelectedTransport | undefined {\n  // candidate-pair `localCandidateId`/`remoteCandidateId` reference the `id`\n  // member of the local/remote-candidate stats (not the report map key).\n  const candidateTypes = new Map<string, string>()\n  const selectedPairs: RtcStatsEntry[] = []\n  for (const [, entry] of stats) {\n    if (entry.type === 'local-candidate' || entry.type === 'remote-candidate') {\n      if (typeof entry.candidateType === 'string' && entry.id !== undefined) {\n        candidateTypes.set(String(entry.id), entry.candidateType)\n      }\n    } else if (entry.type === 'candidate-pair' || entry.type === 'transport') {\n      if (entry.selected === true || entry.nominated === true) selectedPairs.push(entry)\n    }\n  }\n  for (const pair of selectedPairs) {\n    const local = candidateTypes.get(String(pair.localCandidateId))\n    const remote = candidateTypes.get(String(pair.remoteCandidateId))\n    if (local === 'relay' || remote === 'relay') return 'turn'\n    if (local !== undefined || remote !== undefined) return 'p2p'\n  }\n  return undefined\n}\n\nfunction requireSdp(description: { type: 'offer' | 'answer'; sdp?: string }): string {\n  if (typeof description.sdp !== 'string' || description.sdp.length === 0) {\n    throw new RtcConnectError('RTC_FAILED', 'The RTC backend produced an empty session description.')\n  }\n  return description.sdp\n}\n\nfunction toArrayBuffer(data: Uint8Array): ArrayBuffer {\n  if (data.byteOffset === 0 && data.byteLength === data.buffer.byteLength) return data.buffer as ArrayBuffer\n  return data.slice().buffer as ArrayBuffer\n}\n\nfunction asError(error: unknown): Error {\n  return error instanceof Error ? error : new RtcConnectError('RTC_FAILED', 'WebRTC negotiation failed.')\n}\n\nfunction sleep(ms: number): Promise<void> {\n  return new Promise(resolve => setTimeout(resolve, ms))\n}\n", "import {\n  PROTOCOL_VERSION,\n  createControlFrame,\n  parseControlFrame,\n  type ConnectAcceptedPayload,\n  type HelloAckPayload,\n  type RelayPayload,\n  type SecureHandshakePayload,\n  type SelectedTransport,\n  type TransportSelectedPayload,\n  type TransportStats,\n} from '@dsh-remote/protocol'\nimport { browserRtcFactory, type RtcIceServer, type RtcPeerConnectionFactory } from './rtc-adapter.js'\nimport { RtcConnectError, RtcDataChannelTransport, type RtcSelectedTransport, type RtcSignal } from './rtc-data-channel.js'\nimport { BaseTransport } from './transport.js'\nimport { fromBase64Url, socketText, toBase64Url } from './util.js'\n\nexport interface AdaptiveTransportOptions {\n  role: 'client'\n  deviceId: string\n  accessToken: string\n  targetDeviceId: string\n  capabilities?: string[]\n  preferredTransports?: Array<'lan' | 'p2p' | 'turn' | 'relay'>\n  forceRelay?: boolean\n  handshakeTimeoutMs?: number\n  negotiateTimeoutMs?: number\n  rtcFactory?: RtcPeerConnectionFactory\n  fetchIceServers?: (connectionId: string) => Promise<RtcIceServer[]>\n}\n\nconst DEFAULT_CAPABILITIES = ['transport.p2p', 'transport.turn', 'transport.relay', 'harness.api.v1']\nconst DEFAULT_PREFERRED_TRANSPORTS = ['p2p', 'turn', 'relay'] as const\n\n/**\n * Client-side adaptive transport: `p2p -> turn -> relay` (webrtc plan \u00A74/\u00A76.4).\n *\n * Owns the Server control WebSocket and negotiates the data plane after\n * `connect.accepted`. WebRTC (initiator) is attempted first unless\n * `forceRelay` is set or no RTC backend is available; every failure path\n * closes the RTC state and falls back to the WebSocket Relay data plane.\n * Noise IK always runs over `secure.handshake` control frames; only the Noise\n * ciphertext moves to the DataChannel once WebRTC is established.\n */\nexport class AdaptiveTransport extends BaseTransport {\n  private readonly handshakeHandlers = new Set<(step: number, data: Uint8Array) => void>()\n  private socket?: WebSocket\n  private connectionId?: string\n  private relayCounter = 0\n  private bytesSent = 0\n  private bytesReceived = 0\n  private dataMode: 'relay' | 'webrtc' = 'relay'\n  private selected?: SelectedTransport\n  private rtc?: RtcDataChannelTransport\n  private readyResolve?: () => void\n  private readyReject?: (error: Error) => void\n  private handshakeTimer?: ReturnType<typeof setTimeout>\n  private webrtcEnabled = true\n  private serverNegotiateTimeoutMs?: number\n\n  constructor(\n    private readonly url: string,\n    private readonly options: AdaptiveTransportOptions,\n  ) {\n    super()\n  }\n\n  async connect(): Promise<void> {\n    if (this.socket !== undefined) return\n    this.socket = new WebSocket(this.url)\n    this.socket.binaryType = 'arraybuffer'\n    await new Promise<void>((resolve, reject) => {\n      this.readyResolve = resolve\n      this.readyReject = reject\n      this.handshakeTimer = setTimeout(\n        () => this.failConnection(new Error('Adaptive control handshake timed out')),\n        this.options.handshakeTimeoutMs ?? 15_000,\n      )\n      const socket = this.socket!\n      socket.onmessage = event => { void this.handleSocketMessage(event.data) }\n      socket.onopen = () => {\n        this.sendControl('hello', {\n          role: this.options.role,\n          deviceId: this.options.deviceId,\n          accessToken: this.options.accessToken,\n          protocols: [PROTOCOL_VERSION],\n          capabilities: this.options.capabilities ?? DEFAULT_CAPABILITIES,\n        })\n      }\n      socket.onerror = () => this.failConnection(new Error(`AdaptiveTransport failed to connect to ${this.url}`))\n      socket.onclose = () => {\n        const pending = this.readyReject !== undefined\n        if (pending) this.failConnection(new Error('Adaptive control channel closed before it was ready'))\n        this.socket = undefined\n        this.connectionId = undefined\n        this.emitClose()\n      }\n    })\n  }\n\n  async send(data: Uint8Array): Promise<void> {\n    if (this.connectionId === undefined) throw new Error('adaptive transport has not been authorized')\n    if (this.dataMode === 'webrtc') {\n      const rtc = this.rtc\n      if (rtc === undefined) throw new Error('webrtc data channel is not available')\n      this.bytesSent += data.byteLength\n      await rtc.send(data)\n      return\n    }\n    if (this.socket?.readyState !== WebSocket.OPEN) throw new Error('adaptive transport is not connected')\n    this.bytesSent += data.byteLength\n    this.sendControl('relay', {\n      connectionId: this.connectionId,\n      targetDeviceId: this.options.targetDeviceId,\n      counter: this.relayCounter,\n      ciphertext: toBase64Url(data),\n    } satisfies RelayPayload)\n    this.relayCounter += 1\n  }\n\n  connectionInfo(): { connectionId: string; localDeviceId: string; remoteDeviceId: string } {\n    if (this.connectionId === undefined) throw new Error('adaptive transport has not been authorized')\n    return {\n      connectionId: this.connectionId,\n      localDeviceId: this.options.deviceId,\n      remoteDeviceId: this.options.targetDeviceId,\n    }\n  }\n\n  async sendHandshake(step: number, data: Uint8Array): Promise<void> {\n    if (this.socket?.readyState !== WebSocket.OPEN || this.connectionId === undefined) {\n      throw new Error('adaptive transport has not been authorized')\n    }\n    this.sendControl('secure.handshake', {\n      connectionId: this.connectionId,\n      targetDeviceId: this.options.targetDeviceId,\n      step,\n      data: toBase64Url(data),\n    } satisfies SecureHandshakePayload)\n  }\n\n  onHandshake(cb: (step: number, data: Uint8Array) => void): () => void {\n    this.handshakeHandlers.add(cb)\n    return () => this.handshakeHandlers.delete(cb)\n  }\n\n  async close(): Promise<void> {\n    this.clearHandshake()\n    await this.rtc?.close()\n    this.rtc = undefined\n    this.socket?.close()\n    this.socket = undefined\n    this.connectionId = undefined\n  }\n\n  getStats(): TransportStats {\n    const webrtcConnected = this.dataMode === 'webrtc' && this.rtc?.getStats().connected === true\n    const relayConnected = this.dataMode === 'relay'\n      && this.socket?.readyState === WebSocket.OPEN\n      && this.connectionId !== undefined\n    const connected = webrtcConnected || relayConnected\n    let mode: TransportStats['mode'] = 'Disconnected'\n    if (this.selected === 'relay') mode = relayConnected ? 'Relay' : 'Disconnected'\n    else if (this.selected === 'turn') mode = webrtcConnected ? 'TURN' : 'Disconnected'\n    else if (this.selected === 'p2p') mode = webrtcConnected ? 'P2P' : 'Disconnected'\n    return { mode, connected, bytesSent: this.bytesSent, bytesReceived: this.bytesReceived }\n  }\n\n  private async handleSocketMessage(raw: string | ArrayBuffer | Blob): Promise<void> {\n    try {\n      const text = await socketText(raw)\n      const frame = parseControlFrame(JSON.parse(text))\n      if (frame.type === 'hello.ack') {\n        const payload = frame.payload as Partial<HelloAckPayload>\n        if (payload.protocol !== PROTOCOL_VERSION) throw new Error('Server selected an unsupported protocol version')\n        if (payload.webrtcEnabled === false) this.webrtcEnabled = false\n        if (typeof payload.webrtcFallbackTimeoutMs === 'number'\n          && Number.isSafeInteger(payload.webrtcFallbackTimeoutMs)\n          && payload.webrtcFallbackTimeoutMs > 0) {\n          this.serverNegotiateTimeoutMs = payload.webrtcFallbackTimeoutMs\n        }\n        this.sendControl('connect.request', {\n          hostDeviceId: this.options.targetDeviceId,\n          preferredTransports: this.options.forceRelay === true\n            ? ['relay']\n            : this.options.preferredTransports ?? [...DEFAULT_PREFERRED_TRANSPORTS],\n        })\n        return\n      }\n      if (frame.type === 'connect.accepted') {\n        const payload = frame.payload as Partial<ConnectAcceptedPayload>\n        if (typeof payload.connectionId !== 'string' || payload.connectionId.length === 0) {\n          throw new Error('connect.accepted did not include a connectionId')\n        }\n        this.connectionId = payload.connectionId\n        void this.negotiate()\n        return\n      }\n      if (frame.type === 'connect.rejected' || frame.type === 'error') {\n        const payload = frame.payload as { message?: unknown; code?: unknown }\n        const message = typeof payload.message === 'string' ? payload.message : 'Server rejected the connection'\n        throw Object.assign(new Error(message), { code: payload.code })\n      }\n      if (frame.type === 'relay') {\n        if (this.dataMode !== 'relay') return\n        this.handleRelay(frame.payload as Partial<RelayPayload>)\n        return\n      }\n      if (frame.type === 'secure.handshake') {\n        const payload = frame.payload as Partial<SecureHandshakePayload>\n        if (payload.connectionId !== this.connectionId\n          || payload.targetDeviceId !== this.options.deviceId\n          || !Number.isSafeInteger(payload.step)\n          || typeof payload.data !== 'string') {\n          throw new Error('Received a secure handshake frame for an unknown connection')\n        }\n        const data = fromBase64Url(payload.data)\n        for (const handler of this.handshakeHandlers) handler(payload.step!, data)\n        return\n      }\n      if (frame.type === 'signal.answer') {\n        const payload = frame.payload as { connectionId?: unknown; targetDeviceId?: unknown; sdp?: unknown }\n        if (payload.connectionId === this.connectionId && typeof payload.sdp === 'string') {\n          this.rtc?.handleSignal({ type: 'answer', sdp: payload.sdp })\n        }\n        return\n      }\n      if (frame.type === 'signal.ice') {\n        const payload = frame.payload as { connectionId?: unknown; candidate?: unknown }\n        if (payload.connectionId === this.connectionId && isObject(payload.candidate)) {\n          this.rtc?.handleSignal({ type: 'ice', candidate: payload.candidate })\n        }\n        return\n      }\n      if (frame.type === 'signal.offer' || frame.type === 'transport.selected') return\n      if (frame.type === 'ping') this.sendControl('pong', frame.payload)\n    } catch (error) {\n      this.failConnection(error instanceof Error ? error : new Error('Invalid adaptive control frame'))\n    }\n  }\n\n  private handleRelay(payload: Partial<RelayPayload>): void {\n    if (payload.connectionId !== this.connectionId\n      || payload.targetDeviceId !== this.options.deviceId\n      || !Number.isSafeInteger(payload.counter)\n      || typeof payload.ciphertext !== 'string') {\n      throw new Error('Received a relay frame for an unknown connection')\n    }\n    const data = fromBase64Url(payload.ciphertext)\n    this.bytesReceived += data.byteLength\n    this.emit(data)\n  }\n\n  private async negotiate(): Promise<void> {\n    if (this.connectionId === undefined) return\n    const preferred = this.options.preferredTransports ?? [...DEFAULT_PREFERRED_TRANSPORTS]\n    const wantWebRtc = !this.options.forceRelay && this.webrtcEnabled\n      && (preferred.includes('p2p') || preferred.includes('turn'))\n    let selected: SelectedTransport = 'relay'\n    if (wantWebRtc) {\n      try {\n        const rtcSelected = await this.tryWebRtc()\n        this.dataMode = 'webrtc'\n        selected = rtcSelected\n      } catch {\n        await this.rtc?.close()\n        this.rtc = undefined\n        this.dataMode = 'relay'\n        selected = 'relay'\n      }\n    } else {\n      this.dataMode = 'relay'\n      selected = 'relay'\n    }\n    this.selected = selected\n    this.sendControl('transport.selected', {\n      connectionId: this.connectionId,\n      targetDeviceId: this.options.targetDeviceId,\n      transport: selected,\n    } satisfies TransportSelectedPayload)\n    this.finishConnection()\n  }\n\n  private async tryWebRtc(): Promise<RtcSelectedTransport> {\n    const connectionId = this.connectionId\n    if (connectionId === undefined) throw new RtcConnectError('RTC_UNAVAILABLE', 'No connection id for WebRTC negotiation.')\n    const factory = this.options.rtcFactory\n      ?? (typeof RTCPeerConnection === 'undefined' ? undefined : browserRtcFactory())\n    if (factory === undefined) {\n      throw new RtcConnectError('RTC_UNAVAILABLE', 'No RTC backend is available in this environment.')\n    }\n    let iceServers: RtcIceServer[] = []\n    try {\n      iceServers = await (this.options.fetchIceServers?.(connectionId) ?? [])\n    } catch {\n      // TURN/STUN unavailable: still attempt direct P2P with host candidates.\n      iceServers = []\n    }\n    const rtc = new RtcDataChannelTransport({\n      role: 'initiator',\n      factory,\n      iceServers,\n      onSignal: signal => this.sendRtcSignal(signal),\n      negotiateTimeoutMs: this.serverNegotiateTimeoutMs ?? this.options.negotiateTimeoutMs,\n      label: `client->${this.options.targetDeviceId}`,\n    })\n    this.rtc = rtc\n    rtc.onMessage(data => {\n      this.bytesReceived += data.byteLength\n      this.emit(data)\n    })\n    rtc.onClose(() => this.emitClose())\n    try {\n      await rtc.connect()\n    } catch (error) {\n      await rtc.close()\n      this.rtc = undefined\n      throw error\n    }\n    return rtc.selectedTransport() ?? 'p2p'\n  }\n\n  private sendRtcSignal(signal: RtcSignal): void {\n    if (this.connectionId === undefined) return\n    if (signal.type === 'offer') {\n      this.sendControl('signal.offer', {\n        connectionId: this.connectionId,\n        targetDeviceId: this.options.targetDeviceId,\n        sdp: signal.sdp,\n      })\n    } else if (signal.type === 'answer') {\n      this.sendControl('signal.answer', {\n        connectionId: this.connectionId,\n        targetDeviceId: this.options.targetDeviceId,\n        sdp: signal.sdp,\n      })\n    } else {\n      this.sendControl('signal.ice', {\n        connectionId: this.connectionId,\n        targetDeviceId: this.options.targetDeviceId,\n        candidate: signal.candidate,\n      })\n    }\n  }\n\n  private sendControl(type: Parameters<typeof createControlFrame>[0], payload: unknown): void {\n    if (this.socket?.readyState !== WebSocket.OPEN) throw new Error('adaptive control socket is not open')\n    this.socket.send(JSON.stringify(createControlFrame(type, payload)))\n  }\n\n  private finishConnection(): void {\n    this.clearHandshake()\n    this.readyResolve?.()\n    this.readyResolve = undefined\n    this.readyReject = undefined\n  }\n\n  private failConnection(error: Error): void {\n    this.clearHandshake()\n    const reject = this.readyReject\n    this.readyResolve = undefined\n    this.readyReject = undefined\n    reject?.(error)\n    void this.rtc?.close()\n    this.rtc = undefined\n    this.socket?.close()\n    this.socket = undefined\n    this.connectionId = undefined\n  }\n\n  private clearHandshake(): void {\n    if (this.handshakeTimer !== undefined) clearTimeout(this.handshakeTimer)\n    this.handshakeTimer = undefined\n  }\n}\n\nfunction isObject(value: unknown): value is Record<string, unknown> {\n  return typeof value === 'object' && value !== null && !Array.isArray(value)\n}\n", "import type { ApiProxy } from '@deepseek-ai/dsh-host-apiproxy/api'\n\nexport type HarnessMode = 'local' | 'remote'\n\nexport interface RemoteTarget {\n  deviceId: string\n  name: string\n}\n\nconst SWITCHED_DOMAINS = [\n  'sessions',\n  'subagents',\n  'host',\n  'workspace',\n  'skills',\n  'agentPresets',\n  'events',\n  'goals',\n  'llm',\n] as const satisfies ReadonlyArray<keyof ApiProxy>\n\n/**\n * Installs stable forwarding objects into the official ApiProxy instance.\n * Existing HTTP/WebSocket carriers retain the same service identity while new\n * requests resolve against the currently selected local or remote target.\n */\nexport class ApiProxySwitch {\n  private remote?: ApiProxy\n  private target?: RemoteTarget\n  private mode: HarnessMode = 'local'\n  private installed = false\n  private readonly local: ApiProxy\n  private readonly originals: Map<typeof SWITCHED_DOMAINS[number], ApiProxy[typeof SWITCHED_DOMAINS[number]]>\n  private readonly localRespond: ApiProxy['respond']\n\n  constructor(local: ApiProxy) {\n    this.local = local\n    this.originals = new Map(SWITCHED_DOMAINS.map(domain => [domain, local[domain]]))\n    this.localRespond = local.respond.bind(local)\n  }\n\n  install(): void {\n    if (this.installed) return\n    for (const domain of SWITCHED_DOMAINS) {\n      const localDomain = this.local[domain]\n      const forwarder = new Proxy({}, {\n        get: (_target, key) => {\n          const selected = this.selected(domain) as unknown as Record<PropertyKey, unknown>\n          const value = selected[key]\n          return typeof value === 'function' ? value.bind(selected) : value\n        },\n      })\n      Object.defineProperty(this.local, domain, {\n        configurable: true,\n        enumerable: true,\n        writable: true,\n        value: forwarder as typeof localDomain,\n      })\n    }\n    Object.defineProperty(this.local, 'respond', {\n      configurable: true,\n      enumerable: true,\n      writable: true,\n      value: (...args: Parameters<ApiProxy['respond']>) => this.mode === 'remote'\n        ? this.requireRemote().respond(...args)\n        : this.localRespond(...args),\n    })\n    this.installed = true\n  }\n\n  selectRemote(api: ApiProxy, target: RemoteTarget): void {\n    if (!this.installed) throw new Error('The Harness API switch is not installed.')\n    this.remote = api\n    this.target = { ...target }\n    this.mode = 'remote'\n  }\n\n  selectLocal(): void {\n    this.mode = 'local'\n    this.remote = undefined\n    this.target = undefined\n  }\n\n  status(): { mode: HarnessMode; target?: RemoteTarget } {\n    return { mode: this.mode, ...(this.target === undefined ? {} : { target: { ...this.target } }) }\n  }\n\n  restore(): void {\n    if (!this.installed) return\n    this.selectLocal()\n    for (const [domain, value] of this.originals) Object.defineProperty(this.local, domain, {\n      configurable: true,\n      enumerable: true,\n      writable: true,\n      value,\n    })\n    Object.defineProperty(this.local, 'respond', {\n      configurable: true,\n      enumerable: true,\n      writable: true,\n      value: this.localRespond,\n    })\n    this.installed = false\n  }\n\n  private selected(domain: typeof SWITCHED_DOMAINS[number]): ApiProxy[typeof domain] {\n    if (this.mode === 'local') return this.originalDomain(domain)\n    return this.requireRemote()[domain]\n  }\n\n  private originalDomain(domain: typeof SWITCHED_DOMAINS[number]): ApiProxy[typeof domain] {\n    return this.originals.get(domain) as ApiProxy[typeof domain]\n  }\n\n  private requireRemote(): ApiProxy {\n    if (this.remote === undefined) throw new Error('No remote Harness target is selected.')\n    return this.remote\n  }\n}\n", "/**\n * Internal webcrypto alias.\n * We prefer WebCrypto aka globalThis.crypto, which exists in node.js 16+.\n * Falls back to Node.js built-in crypto for Node.js <=v14.\n * See utils.ts for details.\n * @module\n */\n// @ts-ignore\nimport * as nc from 'node:crypto';\nexport const crypto: any =\n  nc && typeof nc === 'object' && 'webcrypto' in nc\n    ? (nc.webcrypto as any)\n    : nc && typeof nc === 'object' && 'randomBytes' in nc\n      ? nc\n      : undefined;\n", "/**\n * WebCrypto-based AES gcm/ctr/cbc, `managedNonce` and `randomBytes`.\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.js on#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.\n * @module\n */\n// Use full path so that Node.js can rewrite it to `cryptoNode.js`.\nimport { crypto } from '@noble/ciphers/crypto';\nimport { abytes, anumber, type AsyncCipher, type Cipher, concatBytes } from './utils.ts';\n\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32): Uint8Array {\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 Uint8Array.from(crypto.randomBytes(bytesLength));\n  }\n  throw new Error('crypto.getRandomValues must be defined');\n}\n\nexport function getWebcryptoSubtle(): any {\n  if (crypto && typeof crypto.subtle === 'object' && crypto.subtle != null) return crypto.subtle;\n  throw new Error('crypto.subtle must be defined');\n}\n\ntype RemoveNonceInner<T extends any[], Ret> = ((...args: T) => Ret) extends (\n  arg0: any,\n  arg1: any,\n  ...rest: infer R\n) => any\n  ? (key: Uint8Array, ...args: R) => Ret\n  : never;\n\ntype RemoveNonce<T extends (...args: any) => any> = RemoveNonceInner<Parameters<T>, ReturnType<T>>;\ntype CipherWithNonce = ((key: Uint8Array, nonce: Uint8Array, ...args: any[]) => Cipher) & {\n  nonceLength: number;\n};\n\n/**\n * Uses CSPRG for nonce, nonce injected in ciphertext.\n * @example\n * const gcm = managedNonce(aes.gcm);\n * const ciphr = gcm(key).encrypt(data);\n * const plain = gcm(key).decrypt(ciph);\n */\nexport function managedNonce<T extends CipherWithNonce>(fn: T): RemoveNonce<T> {\n  const { nonceLength } = fn;\n  anumber(nonceLength);\n  return ((key: Uint8Array, ...args: any[]): any => ({\n    encrypt(plaintext: Uint8Array, ...argsEnc: any[]) {\n      const nonce = randomBytes(nonceLength);\n      const ciphertext = (fn(key, nonce, ...args).encrypt as any)(plaintext, ...argsEnc);\n      const out = concatBytes(nonce, ciphertext);\n      ciphertext.fill(0);\n      return out;\n    },\n    decrypt(ciphertext: Uint8Array, ...argsDec: any[]) {\n      const nonce = ciphertext.subarray(0, nonceLength);\n      const data = ciphertext.subarray(nonceLength);\n      return (fn(key, nonce, ...args).decrypt as any)(data, ...argsDec);\n    },\n  })) as RemoveNonce<T>;\n}\n\n// Overridable\n// @TODO\nexport const utils: {\n  encrypt: (key: Uint8Array, ...all: any[]) => Promise<Uint8Array>;\n  decrypt: (key: Uint8Array, ...all: any[]) => Promise<Uint8Array>;\n} = {\n  async encrypt(\n    key: Uint8Array,\n    keyParams: any,\n    cryptParams: any,\n    plaintext: Uint8Array\n  ): Promise<Uint8Array> {\n    const cr = getWebcryptoSubtle();\n    const iKey = await cr.importKey('raw', key, keyParams, true, ['encrypt']);\n    const ciphertext = await cr.encrypt(cryptParams, iKey, plaintext);\n    return new Uint8Array(ciphertext);\n  },\n  async decrypt(\n    key: Uint8Array,\n    keyParams: any,\n    cryptParams: any,\n    ciphertext: Uint8Array\n  ): Promise<Uint8Array> {\n    const cr = getWebcryptoSubtle();\n    const iKey = await cr.importKey('raw', key, keyParams, true, ['decrypt']);\n    const plaintext = await cr.decrypt(cryptParams, iKey, ciphertext);\n    return new Uint8Array(plaintext);\n  },\n};\n\nconst mode = {\n  CBC: 'AES-CBC',\n  CTR: 'AES-CTR',\n  GCM: 'AES-GCM',\n} as const;\ntype BlockMode = (typeof mode)[keyof typeof mode];\n\nfunction getCryptParams(algo: BlockMode, nonce: Uint8Array, AAD?: Uint8Array) {\n  if (algo === mode.CBC) return { name: mode.CBC, iv: nonce };\n  if (algo === mode.CTR) return { name: mode.CTR, counter: nonce, length: 64 };\n  if (algo === mode.GCM) {\n    if (AAD) return { name: mode.GCM, iv: nonce, additionalData: AAD };\n    else return { name: mode.GCM, iv: nonce };\n  }\n\n  throw new Error('unknown aes block mode');\n}\n\nfunction generate(algo: BlockMode) {\n  return (key: Uint8Array, nonce: Uint8Array, AAD?: Uint8Array): AsyncCipher => {\n    abytes(key);\n    abytes(nonce);\n    const keyParams = { name: algo, length: key.length * 8 };\n    const cryptParams = getCryptParams(algo, nonce, AAD);\n    let consumed = false;\n    return {\n      // keyLength,\n      encrypt(plaintext: Uint8Array) {\n        abytes(plaintext);\n        if (consumed) throw new Error('Cannot encrypt() twice with same key / nonce');\n        consumed = true;\n        return utils.encrypt(key, keyParams, cryptParams, plaintext);\n      },\n      decrypt(ciphertext: Uint8Array) {\n        abytes(ciphertext);\n        return utils.decrypt(key, keyParams, cryptParams, ciphertext);\n      },\n    };\n  };\n}\n\n/** AES-CBC, native webcrypto version */\nexport const cbc: (key: Uint8Array, iv: Uint8Array) => AsyncCipher = /* @__PURE__ */ (() =>\n  generate(mode.CBC))();\n/** AES-CTR, native webcrypto version */\nexport const ctr: (key: Uint8Array, nonce: Uint8Array) => AsyncCipher = /* @__PURE__ */ (() =>\n  generate(mode.CTR))();\n/** AES-GCM, native webcrypto version */\nexport const gcm: (key: Uint8Array, nonce: Uint8Array, AAD?: Uint8Array) => AsyncCipher =\n  /* @__PURE__ */ (() => generate(mode.GCM))();\n\n// // Type tests\n// import { siv, gcm, ctr, ecb, cbc } from '../aes.ts';\n// import { xsalsa20poly1305 } from '../salsa.ts';\n// import { chacha20poly1305, xchacha20poly1305 } from '../chacha.ts';\n\n// const wsiv = managedNonce(siv);\n// const wgcm = managedNonce(gcm);\n// const wctr = managedNonce(ctr);\n// const wcbc = managedNonce(cbc);\n// const wsalsapoly = managedNonce(xsalsa20poly1305);\n// const wchacha = managedNonce(chacha20poly1305);\n// const wxchacha = managedNonce(xchacha20poly1305);\n\n// // should fail\n// const wcbc2 = managedNonce(managedNonce(cbc));\n// const wctr = managedNonce(ctr);\n", "/**\n * Internal webcrypto alias.\n * We prefer WebCrypto aka globalThis.crypto, which exists in node.js 16+.\n * Falls back to Node.js built-in crypto for Node.js <=v14.\n * See utils.ts for details.\n * @module\n */\n// @ts-ignore\nimport * as nc from 'node:crypto';\nexport const crypto: any =\n  nc && typeof nc === 'object' && 'webcrypto' in nc\n    ? (nc.webcrypto as any)\n    : nc && typeof nc === 'object' && 'randomBytes' in nc\n      ? nc\n      : undefined;\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\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';\n\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n  return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number): void {\n  if (!Number.isSafeInteger(n) || n < 0) throw new Error('positive integer expected, got ' + n);\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(b: Uint8Array | undefined, ...lengths: number[]): void {\n  if (!isBytes(b)) throw new Error('Uint8Array expected');\n  if (lengths.length > 0 && !lengths.includes(b.length))\n    throw new Error('Uint8Array expected of length ' + lengths + ', got length=' + b.length);\n}\n\n/** Asserts something is hash */\nexport function ahash(h: IHash): void {\n  if (typeof h !== 'function' || typeof h.create !== 'function')\n    throw new Error('Hash should be wrapped by utils.createHasher');\n  anumber(h.outputLen);\n  anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n  if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n  if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n  abytes(out);\n  const min = instance.outputLen;\n  if (out.length < min) {\n    throw new Error('digestInto() expects output buffer of length at least ' + min);\n  }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n  Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n  return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n  return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n  for (let i = 0; i < arrays.length; i++) {\n    arrays[i].fill(0);\n  }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n  return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n  return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n  return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n  new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n  return (\n    ((word << 24) & 0xff000000) |\n    ((word << 8) & 0xff0000) |\n    ((word >>> 8) & 0xff00) |\n    ((word >>> 24) & 0xff)\n  );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n  ? (n: number) => n\n  : (n: number) => byteSwap(n);\n\n/** @deprecated */\nexport const byteSwapIfBE: typeof swap8IfBE = swap8IfBE;\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n  for (let i = 0; i < arr.length; i++) {\n    arr[i] = byteSwap(arr[i]);\n  }\n  return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n  ? (u: Uint32Array) => u\n  : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n  // @ts-ignore\n  typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n  i.toString(16).padStart(2, '0')\n);\n\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n  abytes(bytes);\n  // @ts-ignore\n  if (hasHexBuiltin) return bytes.toHex();\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// 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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n  if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n  if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n  if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n  return;\n}\n\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  // @ts-ignore\n  if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n  const hl = hex.length;\n  const al = hl / 2;\n  if (hl % 2) throw new Error('hex string expected, got unpadded hex of length ' + hl);\n  const array = new Uint8Array(al);\n  for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n    const n1 = asciiToBase16(hex.charCodeAt(hi));\n    const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n    if (n1 === undefined || n2 === undefined) {\n      const char = hex[hi] + hex[hi + 1];\n      throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n    }\n    array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n  }\n  return array;\n}\n\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\nexport const nextTick = async (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n  iters: number,\n  tick: number,\n  cb: (i: number) => void\n): Promise<void> {\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) continue;\n    await nextTick();\n    ts += diff;\n  }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\ndeclare const TextDecoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n  if (typeof str !== 'string') throw new Error('string expected');\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes: Uint8Array): string {\n  return new TextDecoder().decode(bytes);\n}\n\n/** Accepted input of hash functions. Strings are converted to byte arrays. */\nexport type Input = string | Uint8Array;\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: Input): Uint8Array {\n  if (typeof data === 'string') data = utf8ToBytes(data);\n  abytes(data);\n  return data;\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data: KDFInput): Uint8Array {\n  if (typeof data === 'string') data = utf8ToBytes(data);\n  abytes(data);\n  return data;\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n  defaults: T1,\n  opts?: T2\n): T1 & T2 {\n  if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n    throw new Error('options should be object or undefined');\n  const merged = Object.assign(defaults, opts);\n  return merged as T1 & T2;\n}\n\n/** Hash interface. */\nexport type IHash = {\n  (data: Uint8Array): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create: any;\n};\n\n/** For runtime check if class implements interface */\nexport abstract class Hash<T extends Hash<T>> {\n  abstract blockLen: number; // Bytes per block\n  abstract outputLen: number; // Bytes in output\n  abstract update(buf: Input): this;\n  // Writes digest into buf\n  abstract digestInto(buf: Uint8Array): void;\n  abstract digest(): Uint8Array;\n  /**\n   * Resets internal state. Makes Hash instance unusable.\n   * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n   * by user, they will need to manually call `destroy()` when zeroing is necessary.\n   */\n  abstract destroy(): void;\n  /**\n   * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n   * when no options are passed.\n   * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n   * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n   * There are no guarantees for clean-up because it's impossible in JS.\n   */\n  abstract _cloneInto(to?: T): T;\n  // Safe version that clones internal state\n  abstract clone(): T;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n  xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n  xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash function */\nexport type CHash = ReturnType<typeof createHasher>;\n/** Hash function with output */\nexport type CHashO = ReturnType<typeof createOptHasher>;\n/** XOF with output */\nexport type CHashXO = ReturnType<typeof createXOFer>;\n\n/** Wraps hash function, creating an interface on top of it */\nexport function createHasher<T extends Hash<T>>(\n  hashCons: () => Hash<T>\n): {\n  (msg: Input): Uint8Array;\n  outputLen: number;\n  blockLen: number;\n  create(): Hash<T>;\n} {\n  const hashC = (msg: Input): Uint8Array => 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}\n\nexport function createOptHasher<H extends Hash<H>, T extends Object>(\n  hashCons: (opts?: T) => Hash<H>\n): {\n  (msg: Input, opts?: T): Uint8Array;\n  outputLen: number;\n  blockLen: number;\n  create(opts?: T): Hash<H>;\n} {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts?: T) => hashCons(opts);\n  return hashC;\n}\n\nexport function createXOFer<H extends HashXOF<H>, T extends Object>(\n  hashCons: (opts?: T) => HashXOF<H>\n): {\n  (msg: Input, opts?: T): Uint8Array;\n  outputLen: number;\n  blockLen: number;\n  create(opts?: T): HashXOF<H>;\n} {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts?: T) => hashCons(opts);\n  return hashC;\n}\nexport const wrapConstructor: typeof createHasher = createHasher;\nexport const wrapConstructorWithOpts: typeof createOptHasher = createOptHasher;\nexport const wrapXOFConstructorWithOpts: typeof createXOFer = createXOFer;\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\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 Uint8Array.from(crypto.randomBytes(bytesLength));\n  }\n  throw new Error('crypto.getRandomValues must be defined');\n}\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { type Input, Hash, abytes, aexists, aoutput, clean, createView, toBytes } from './utils.ts';\n\n/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */\nexport function setBigUint64(\n  view: DataView,\n  byteOffset: number,\n  value: bigint,\n  isLE: boolean\n): void {\n  if (typeof view.setBigUint64 === 'function') 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 */\nexport function Chi(a: number, b: number, c: number): number {\n  return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n  return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> extends Hash<T> {\n  protected abstract process(buf: DataView, offset: number): void;\n  protected abstract get(): number[];\n  protected abstract set(...args: number[]): void;\n  abstract destroy(): void;\n  protected abstract roundClean(): void;\n\n  readonly blockLen: number;\n  readonly outputLen: number;\n  readonly padOffset: number;\n  readonly isLE: boolean;\n\n  // For partial updates less than block size\n  protected buffer: Uint8Array;\n  protected view: DataView;\n  protected finished = false;\n  protected length = 0;\n  protected pos = 0;\n  protected destroyed = false;\n\n  constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\n    super();\n    this.blockLen = blockLen;\n    this.outputLen = outputLen;\n    this.padOffset = padOffset;\n    this.isLE = isLE;\n    this.buffer = new Uint8Array(blockLen);\n    this.view = createView(this.buffer);\n  }\n  update(data: Input): this {\n    aexists(this);\n    data = toBytes(data);\n    abytes(data);\n    const { view, buffer, blockLen } = this;\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) 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: Uint8Array): void {\n    aexists(this);\n    aoutput(out, this);\n    this.finished = true;\n    // Padding\n    // We can avoid allocation of buffer for padding completely if it\n    // was previously not allocated here. But it won't change performance.\n    const { buffer, view, blockLen, isLE } = this;\n    let { pos } = this;\n    // append the bit '1' to the message\n    buffer[pos++] = 0b10000000;\n    clean(this.buffer.subarray(pos));\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++) 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) 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) throw new Error('_sha2: outputLen bigger than state');\n    for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n  }\n  digest(): Uint8Array {\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?: T): T {\n    to ||= new (this.constructor as any)() as T;\n    to.set(...this.get());\n    const { blockLen, buffer, length, finished, destroyed, pos } = this;\n    to.destroyed = destroyed;\n    to.finished = finished;\n    to.length = length;\n    to.pos = pos;\n    if (length % blockLen) to.buffer.set(buffer);\n    return to;\n  }\n  clone(): T {\n    return this._cloneInto();\n  }\n}\n\n/**\n * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n */\n\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n  0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n  0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n  0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n  0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n  0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n  0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n\nfunction fromBig(\n  n: bigint,\n  le = false\n): {\n  h: number;\n  l: number;\n} {\n  if (le) 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}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\n  const len = lst.length;\n  let Ah = new Uint32Array(len);\n  let Al = new Uint32Array(len);\n  for (let i = 0; i < len; i++) {\n    const { h, l } = fromBig(lst[i], le);\n    [Ah[i], Al[i]] = [h, l];\n  }\n  return [Ah, Al];\n}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\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(\n  Ah: number,\n  Al: number,\n  Bh: number,\n  Bl: number\n): {\n  h: number;\n  l: number;\n} {\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: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n  (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n  (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n  (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n  (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n  (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n  add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\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", "/**\n * SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and\n * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n */\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from './_md.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, rotr } from './utils.ts';\n\n/**\n * Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n */\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ Uint32Array.from([\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nexport class SHA256 extends HashMD<SHA256> {\n  // We cannot use array here since array allows indexing by variable\n  // which means optimizer/compiler cannot use registers.\n  protected A: number = SHA256_IV[0] | 0;\n  protected B: number = SHA256_IV[1] | 0;\n  protected C: number = SHA256_IV[2] | 0;\n  protected D: number = SHA256_IV[3] | 0;\n  protected E: number = SHA256_IV[4] | 0;\n  protected F: number = SHA256_IV[5] | 0;\n  protected G: number = SHA256_IV[6] | 0;\n  protected H: number = SHA256_IV[7] | 0;\n\n  constructor(outputLen: number = 32) {\n    super(64, outputLen, 8, false);\n  }\n  protected get(): [number, number, number, number, number, number, number, number] {\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  protected set(\n    A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n  ): void {\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  protected process(view: DataView, offset: number): void {\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) 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  protected roundClean(): void {\n    clean(SHA256_W);\n  }\n  destroy(): void {\n    this.set(0, 0, 0, 0, 0, 0, 0, 0);\n    clean(this.buffer);\n  }\n}\n\nexport class SHA224 extends SHA256 {\n  protected A: number = SHA224_IV[0] | 0;\n  protected B: number = SHA224_IV[1] | 0;\n  protected C: number = SHA224_IV[2] | 0;\n  protected D: number = SHA224_IV[3] | 0;\n  protected E: number = SHA224_IV[4] | 0;\n  protected F: number = SHA224_IV[5] | 0;\n  protected G: number = SHA224_IV[6] | 0;\n  protected H: number = SHA224_IV[7] | 0;\n  constructor() {\n    super(28);\n  }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = /* @__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))))();\nconst SHA512_Kh = /* @__PURE__ */ (() => K512[0])();\nconst SHA512_Kl = /* @__PURE__ */ (() => K512[1])();\n\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\nexport class SHA512 extends HashMD<SHA512> {\n  // We cannot use array here since array allows indexing by variable\n  // which means optimizer/compiler cannot use registers.\n  // h -- high 32 bits, l -- low 32 bits\n  protected Ah: number = SHA512_IV[0] | 0;\n  protected Al: number = SHA512_IV[1] | 0;\n  protected Bh: number = SHA512_IV[2] | 0;\n  protected Bl: number = SHA512_IV[3] | 0;\n  protected Ch: number = SHA512_IV[4] | 0;\n  protected Cl: number = SHA512_IV[5] | 0;\n  protected Dh: number = SHA512_IV[6] | 0;\n  protected Dl: number = SHA512_IV[7] | 0;\n  protected Eh: number = SHA512_IV[8] | 0;\n  protected El: number = SHA512_IV[9] | 0;\n  protected Fh: number = SHA512_IV[10] | 0;\n  protected Fl: number = SHA512_IV[11] | 0;\n  protected Gh: number = SHA512_IV[12] | 0;\n  protected Gl: number = SHA512_IV[13] | 0;\n  protected Hh: number = SHA512_IV[14] | 0;\n  protected Hl: number = SHA512_IV[15] | 0;\n\n  constructor(outputLen: number = 64) {\n    super(128, outputLen, 16, false);\n  }\n  // prettier-ignore\n  protected get(): [\n    number, number, number, number, number, number, number, number,\n    number, number, number, number, number, number, number, number\n  ] {\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  protected set(\n    Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n    Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n  ): void {\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  protected process(view: DataView, offset: number): void {\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  protected roundClean(): void {\n    clean(SHA512_W_H, SHA512_W_L);\n  }\n  destroy(): void {\n    clean(this.buffer);\n    this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n  }\n}\n\nexport class SHA384 extends SHA512 {\n  protected Ah: number = SHA384_IV[0] | 0;\n  protected Al: number = SHA384_IV[1] | 0;\n  protected Bh: number = SHA384_IV[2] | 0;\n  protected Bl: number = SHA384_IV[3] | 0;\n  protected Ch: number = SHA384_IV[4] | 0;\n  protected Cl: number = SHA384_IV[5] | 0;\n  protected Dh: number = SHA384_IV[6] | 0;\n  protected Dl: number = SHA384_IV[7] | 0;\n  protected Eh: number = SHA384_IV[8] | 0;\n  protected El: number = SHA384_IV[9] | 0;\n  protected Fh: number = SHA384_IV[10] | 0;\n  protected Fl: number = SHA384_IV[11] | 0;\n  protected Gh: number = SHA384_IV[12] | 0;\n  protected Gl: number = SHA384_IV[13] | 0;\n  protected Hh: number = SHA384_IV[14] | 0;\n  protected Hl: number = SHA384_IV[15] | 0;\n\n  constructor() {\n    super(48);\n  }\n}\n\n/**\n * Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n */\n\n/** SHA512/224 IV */\nconst T224_IV = /* @__PURE__ */ Uint32Array.from([\n  0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n  0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n\n/** SHA512/256 IV */\nconst T256_IV = /* @__PURE__ */ Uint32Array.from([\n  0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n  0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n\nexport class SHA512_224 extends SHA512 {\n  protected Ah: number = T224_IV[0] | 0;\n  protected Al: number = T224_IV[1] | 0;\n  protected Bh: number = T224_IV[2] | 0;\n  protected Bl: number = T224_IV[3] | 0;\n  protected Ch: number = T224_IV[4] | 0;\n  protected Cl: number = T224_IV[5] | 0;\n  protected Dh: number = T224_IV[6] | 0;\n  protected Dl: number = T224_IV[7] | 0;\n  protected Eh: number = T224_IV[8] | 0;\n  protected El: number = T224_IV[9] | 0;\n  protected Fh: number = T224_IV[10] | 0;\n  protected Fl: number = T224_IV[11] | 0;\n  protected Gh: number = T224_IV[12] | 0;\n  protected Gl: number = T224_IV[13] | 0;\n  protected Hh: number = T224_IV[14] | 0;\n  protected Hl: number = T224_IV[15] | 0;\n\n  constructor() {\n    super(28);\n  }\n}\n\nexport class SHA512_256 extends SHA512 {\n  protected Ah: number = T256_IV[0] | 0;\n  protected Al: number = T256_IV[1] | 0;\n  protected Bh: number = T256_IV[2] | 0;\n  protected Bl: number = T256_IV[3] | 0;\n  protected Ch: number = T256_IV[4] | 0;\n  protected Cl: number = T256_IV[5] | 0;\n  protected Dh: number = T256_IV[6] | 0;\n  protected Dl: number = T256_IV[7] | 0;\n  protected Eh: number = T256_IV[8] | 0;\n  protected El: number = T256_IV[9] | 0;\n  protected Fh: number = T256_IV[10] | 0;\n  protected Fl: number = T256_IV[11] | 0;\n  protected Gh: number = T256_IV[12] | 0;\n  protected Gl: number = T256_IV[13] | 0;\n  protected Hh: number = T256_IV[14] | 0;\n  protected Hl: number = T256_IV[15] | 0;\n\n  constructor() {\n    super(32);\n  }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634.\n *\n * It is the fastest JS hash, even faster than Blake3.\n * To break sha256 using birthday attack, attackers need to try 2^128 hashes.\n * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n */\nexport const sha256: CHash = /* @__PURE__ */ createHasher(() => new SHA256());\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash = /* @__PURE__ */ createHasher(() => new SHA224());\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash = /* @__PURE__ */ createHasher(() => new SHA512());\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash = /* @__PURE__ */ createHasher(() => new SHA384());\n\n/**\n * SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n */\nexport const sha512_256: CHash = /* @__PURE__ */ createHasher(() => new SHA512_256());\n/**\n * SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n */\nexport const sha512_224: CHash = /* @__PURE__ */ createHasher(() => new SHA512_224());\n", "/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport {\n  abytes as abytes_,\n  bytesToHex as bytesToHex_,\n  concatBytes as concatBytes_,\n  hexToBytes as hexToBytes_,\n  isBytes as isBytes_,\n} from '@noble/hashes/utils.js';\nexport {\n  abytes,\n  anumber,\n  bytesToHex,\n  bytesToUtf8,\n  concatBytes,\n  hexToBytes,\n  isBytes,\n  randomBytes,\n  utf8ToBytes,\n} from '@noble/hashes/utils.js';\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nexport type Hex = Uint8Array | string; // hex strings are accepted for simplicity\nexport type PrivKey = Hex | bigint; // bigints are accepted to ease learning curve\nexport type CHash = {\n  (message: Uint8Array | string): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array | string) => Uint8Array;\n\nexport function abool(title: string, value: boolean): void {\n  if (typeof value !== 'boolean') throw new Error(title + ' boolean expected, got ' + value);\n}\n\n// tmp name until v2\nexport function _abool2(value: boolean, title: string = ''): boolean {\n  if (typeof value !== 'boolean') {\n    const prefix = title && `\"${title}\"`;\n    throw new Error(prefix + 'expected boolean, got type=' + typeof value);\n  }\n  return value;\n}\n\n// tmp name until v2\n/** Asserts something is Uint8Array. */\nexport function _abytes2(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\n  const bytes = isBytes_(value);\n  const len = value?.length;\n  const needsLen = length !== undefined;\n  if (!bytes || (needsLen && len !== length)) {\n    const prefix = title && `\"${title}\" `;\n    const ofLen = needsLen ? ` of length ${length}` : '';\n    const got = bytes ? `length=${len}` : `type=${typeof value}`;\n    throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n  }\n  return value;\n}\n\n// Used in weierstrass, der\nexport function numberToHexUnpadded(num: number | bigint): string {\n  const hex = num.toString(16);\n  return hex.length & 1 ? '0' + hex : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n  return hexToNumber(bytesToHex_(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n  abytes_(bytes);\n  return hexToNumber(bytesToHex_(Uint8Array.from(bytes).reverse()));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n  return hexToBytes_(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n: number | bigint, len: number): Uint8Array {\n  return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number | bigint): Uint8Array {\n  return hexToBytes_(numberToHexUnpadded(n));\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. 'secret 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: string, hex: Hex, expectedLength?: number): Uint8Array {\n  let res: Uint8Array;\n  if (typeof hex === 'string') {\n    try {\n      res = hexToBytes_(hex);\n    } catch (e) {\n      throw new Error(title + ' must be hex string or Uint8Array, cause: ' + e);\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  } else {\n    throw new Error(title + ' must be hex string or Uint8Array');\n  }\n  const len = res.length;\n  if (typeof expectedLength === 'number' && len !== expectedLength)\n    throw new Error(title + ' of length ' + expectedLength + ' expected, got ' + len);\n  return res;\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array): boolean {\n  if (a.length !== b.length) return false;\n  let diff = 0;\n  for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n  return diff === 0;\n}\n/**\n * Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,\n * and Buffer#slice creates mutable copy. Never use Buffers!\n */\nexport function copyBytes(bytes: Uint8Array): Uint8Array {\n  return Uint8Array.from(bytes);\n}\n\n/**\n * Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols\n * Should be safe to use for things expected to be ASCII.\n * Returns exact same result as utf8ToBytes for ASCII or throws.\n */\nexport function asciiToBytes(ascii: string): Uint8Array {\n  return Uint8Array.from(ascii, (c, i) => {\n    const charCode = c.charCodeAt(0);\n    if (c.length !== 1 || charCode > 127) {\n      throw new Error(\n        `string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`\n      );\n    }\n    return charCode;\n  });\n}\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\n// export const utf8ToBytes: typeof utf8ToBytes_ = utf8ToBytes_;\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\n// export const bytesToUtf8: typeof bytesToUtf8_ = bytesToUtf8_;\n\n// Is positive bigint\nconst isPosBig = (n: bigint) => typeof n === 'bigint' && _0n <= n;\n\nexport function inRange(n: bigint, min: bigint, max: bigint): boolean {\n  return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\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: string, n: bigint, min: bigint, max: bigint): void {\n  // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n  // consider P=256n, min=0n, max=P\n  // - a for min=0 would require -1:          `inRange('x', x, -1n, P)`\n  // - b would commonly require subtraction:  `inRange('x', x, 0n, P - 1n)`\n  // - our way is the cleanest:               `inRange('x', x, 0n, P)\n  if (!inRange(n, min, max))\n    throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n\n// Bit operations\n\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n * TODO: merge with nLength in modular\n */\nexport function bitLen(n: bigint): number {\n  let len;\n  for (len = 0; n > _0n; n >>= _1n, len += 1);\n  return len;\n}\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: bigint, pos: number): bigint {\n  return (n >> BigInt(pos)) & _1n;\n}\n\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n: bigint, pos: number, value: boolean): bigint {\n  return n | ((value ? _1n : _0n) << BigInt(pos));\n}\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: number): bigint => (_1n << BigInt(n)) - _1n;\n\n// DRBG\n\ntype Pred<T> = (v: Uint8Array) => T | undefined;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg<T>(\n  hashLen: number,\n  qByteLen: number,\n  hmacFn: (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n  if (typeof hashLen !== 'number' || hashLen < 2) throw new Error('hashLen must be a number');\n  if (typeof qByteLen !== 'number' || qByteLen < 2) throw new Error('qByteLen must be a number');\n  if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\n  // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n  const u8n = (len: number) => new Uint8Array(len); // creates Uint8Array\n  const u8of = (byte: number) => Uint8Array.of(byte); // another shortcut\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: Uint8Array[]) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n  const reseed = (seed = u8n(0)) => {\n    // HMAC-DRBG reseed() function. Steps D-G\n    k = h(u8of(0x00), seed); // k = hmac(k || v || 0x00 || seed)\n    v = h(); // v = hmac(k || v)\n    if (seed.length === 0) return;\n    k = h(u8of(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) throw new Error('drbg: tried 1000 values');\n    let len = 0;\n    const out: Uint8Array[] = [];\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: Uint8Array, pred: Pred<T>): T => {\n    reset();\n    reseed(seed); // Steps D-G\n    let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]\n    while (!(res = pred(gen()))) reseed();\n    reset();\n    return res;\n  };\n  return genUntil;\n}\n\n// Validating curves and fields\n\nconst validatorFns = {\n  bigint: (val: any): boolean => typeof val === 'bigint',\n  function: (val: any): boolean => typeof val === 'function',\n  boolean: (val: any): boolean => typeof val === 'boolean',\n  string: (val: any): boolean => typeof val === 'string',\n  stringOrUint8Array: (val: any): boolean => typeof val === 'string' || isBytes_(val),\n  isSafeInteger: (val: any): boolean => Number.isSafeInteger(val),\n  array: (val: any): boolean => Array.isArray(val),\n  field: (val: any, object: any): any => (object as any).Fp.isValid(val),\n  hash: (val: any): boolean => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n} as const;\ntype Validator = keyof typeof validatorFns;\ntype ValMap<T extends Record<string, any>> = { [K in keyof T]?: Validator };\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\n\nexport function validateObject<T extends Record<string, any>>(\n  object: T,\n  validators: ValMap<T>,\n  optValidators: ValMap<T> = {}\n): T {\n  const checkField = (fieldName: keyof T, type: Validator, isOptional: boolean) => {\n    const checkVal = validatorFns[type];\n    if (typeof checkVal !== 'function') throw new Error('invalid validator function');\n\n    const val = object[fieldName as keyof typeof object];\n    if (isOptional && val === undefined) return;\n    if (!checkVal(val, object)) {\n      throw new Error(\n        'param ' + String(fieldName) + ' is invalid. Expected ' + type + ', got ' + val\n      );\n    }\n  };\n  for (const [fieldName, type] of Object.entries(validators)) checkField(fieldName, type!, false);\n  for (const [fieldName, type] of Object.entries(optValidators)) 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\nexport function isHash(val: CHash): boolean {\n  return typeof val === 'function' && Number.isSafeInteger(val.outputLen);\n}\nexport function _validateObject(\n  object: Record<string, any>,\n  fields: Record<string, string>,\n  optFields: Record<string, string> = {}\n): void {\n  if (!object || typeof object !== 'object') throw new Error('expected valid options object');\n  type Item = keyof typeof object;\n  function checkField(fieldName: Item, expectedType: string, isOpt: boolean) {\n    const val = object[fieldName];\n    if (isOpt && val === undefined) return;\n    const current = typeof val;\n    if (current !== expectedType || val === null)\n      throw new Error(`param \"${fieldName}\" is invalid: expected ${expectedType}, got ${current}`);\n  }\n  Object.entries(fields).forEach(([k, v]) => checkField(k, v, false));\n  Object.entries(optFields).forEach(([k, v]) => checkField(k, v, true));\n}\n\n/**\n * throws not implemented error\n */\nexport const notImplemented = (): never => {\n  throw new Error('not implemented');\n};\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<T extends object, R, O extends any[]>(\n  fn: (arg: T, ...args: O) => R\n): (arg: T, ...args: O) => R {\n  const map = new WeakMap<T, R>();\n  return (arg: T, ...args: O): R => {\n    const val = map.get(arg);\n    if (val !== undefined) return val;\n    const computed = fn(arg, ...args);\n    map.set(arg, computed);\n    return computed;\n  };\n}\n", "/**\n * Utils for modular division and fields.\n * Field over 11 is a finite (Galois) field is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport {\n  _validateObject,\n  anumber,\n  bitMask,\n  bytesToNumberBE,\n  bytesToNumberLE,\n  ensureBytes,\n  numberToBytesBE,\n  numberToBytesLE,\n} from '../utils.ts';\n\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = /* @__PURE__ */ BigInt(2), _3n = /* @__PURE__ */ BigInt(3);\n// prettier-ignore\nconst _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5), _7n = /* @__PURE__ */ BigInt(7);\n// prettier-ignore\nconst _8n = /* @__PURE__ */ BigInt(8), _9n = /* @__PURE__ */ BigInt(9), _16n = /* @__PURE__ */ BigInt(16);\n\n// Calculates a modulo b\nexport function mod(a: bigint, b: bigint): bigint {\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 */\nexport function pow(num: bigint, power: bigint, modulo: bigint): bigint {\n  return FpPow(Field(modulo), num, power);\n}\n\n/** Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` */\nexport function pow2(x: bigint, power: bigint, modulo: bigint): bigint {\n  let res = x;\n  while (power-- > _0n) {\n    res *= res;\n    res %= modulo;\n  }\n  return res;\n}\n\n/**\n * Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n */\nexport function invert(number: bigint, modulo: bigint): bigint {\n  if (number === _0n) throw new Error('invert: expected non-zero number');\n  if (modulo <= _0n) throw new Error('invert: expected positive modulus, got ' + modulo);\n  // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n  let a = mod(number, modulo);\n  let b = modulo;\n  // prettier-ignore\n  let x = _0n, y = _1n, u = _1n, v = _0n;\n  while (a !== _0n) {\n    // JIT applies optimization if those two lines follow each other\n    const q = b / a;\n    const r = b % a;\n    const m = x - u * q;\n    const n = y - v * q;\n    // prettier-ignore\n    b = a, a = r, x = u, y = v, u = m, v = n;\n  }\n  const gcd = b;\n  if (gcd !== _1n) throw new Error('invert: does not exist');\n  return mod(x, modulo);\n}\n\nfunction assertIsSquare<T>(Fp: IField<T>, root: T, n: T): void {\n  if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n}\n\n// Not all roots are possible! Example which will throw:\n// const NUM =\n// n = 72057594037927816n;\n// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));\nfunction sqrt3mod4<T>(Fp: IField<T>, n: T) {\n  const p1div4 = (Fp.ORDER + _1n) / _4n;\n  const root = Fp.pow(n, p1div4);\n  assertIsSquare(Fp, root, n);\n  return root;\n}\n\nfunction sqrt5mod8<T>(Fp: IField<T>, n: T) {\n  const p5div8 = (Fp.ORDER - _5n) / _8n;\n  const n2 = Fp.mul(n, _2n);\n  const v = Fp.pow(n2, p5div8);\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  assertIsSquare(Fp, root, n);\n  return root;\n}\n\n// Based on RFC9380, Kong algorithm\n// prettier-ignore\nfunction sqrt9mod16(P: bigint): <T>(Fp: IField<T>, n: T) => T {\n  const Fp_ = Field(P);\n  const tn = tonelliShanks(P);\n  const c1 = tn(Fp_, Fp_.neg(Fp_.ONE));//  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n  const c2 = tn(Fp_, c1);              //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n  const c3 = tn(Fp_, Fp_.neg(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  return <T>(Fp: IField<T>, n: T) => {\n    let tv1 = Fp.pow(n, c4);           //  1. tv1 = x^c4\n    let tv2 = Fp.mul(tv1, c1);         //  2. tv2 = c1 * tv1\n    const tv3 = Fp.mul(tv1, c2);       //  3. tv3 = c2 * tv1\n    const tv4 = Fp.mul(tv1, c3);       //  4. tv4 = c3 * tv1\n    const e1 = Fp.eql(Fp.sqr(tv2), n); //  5.  e1 = (tv2^2) == x\n    const e2 = Fp.eql(Fp.sqr(tv3), n); //  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.eql(Fp.sqr(tv2), n); //  9.  e3 = (tv2^2) == x\n    const root = Fp.cmov(tv1, tv2, e3);// 10.  z = CMOV(tv1, tv2, e3)   # Select sqrt from tv1 & tv2\n    assertIsSquare(Fp, root, n);\n    return root;\n  };\n}\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 * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P: bigint): <T>(Fp: IField<T>, n: T) => T {\n  // Initialization (precomputation).\n  // Caching initialization could boost perf by 7%.\n  if (P < _3n) throw new Error('sqrt is not defined for small field');\n  // Factor P - 1 = Q * 2^S, where Q is odd\n  let Q = P - _1n;\n  let S = 0;\n  while (Q % _2n === _0n) {\n    Q /= _2n;\n    S++;\n  }\n\n  // Find the first quadratic non-residue Z >= 2\n  let Z = _2n;\n  const _Fp = Field(P);\n  while (FpLegendre(_Fp, Z) === 1) {\n    // Basic primality test for P. After x iterations, chance of\n    // not finding quadratic non-residue is 2^x, so 2^1000.\n    if (Z++ > 1000) throw new Error('Cannot find square root: probably non-prime P');\n  }\n  // Fast-path; usually done before Z, but we do \"primality test\".\n  if (S === 1) return sqrt3mod4;\n\n  // Slow-path\n  // TODO: test on Fp2 and others\n  let cc = _Fp.pow(Z, Q); // c = z^Q\n  const Q1div2 = (Q + _1n) / _2n;\n  return function tonelliSlow<T>(Fp: IField<T>, n: T): T {\n    if (Fp.is0(n)) return n;\n    // Check if n is a quadratic residue using Legendre symbol\n    if (FpLegendre(Fp, n) !== 1) throw new Error('Cannot find square root');\n\n    // Initialize variables for the main loop\n    let M = S;\n    let c = Fp.mul(Fp.ONE, cc); // c = z^Q, move cc from field _Fp into field Fp\n    let t = Fp.pow(n, Q); // t = n^Q, first guess at the fudge factor\n    let R = Fp.pow(n, Q1div2); // R = n^((Q+1)/2), first guess at the square root\n\n    // Main loop\n    // while t != 1\n    while (!Fp.eql(t, Fp.ONE)) {\n      if (Fp.is0(t)) return Fp.ZERO; // if t=0 return R=0\n      let i = 1;\n\n      // Find the smallest i >= 1 such that t^(2^i) \u2261 1 (mod P)\n      let t_tmp = Fp.sqr(t); // t^(2^1)\n      while (!Fp.eql(t_tmp, Fp.ONE)) {\n        i++;\n        t_tmp = Fp.sqr(t_tmp); // t^(2^2)...\n        if (i === M) throw new Error('Cannot find square root');\n      }\n\n      // Calculate the exponent for b: 2^(M - i - 1)\n      const exponent = _1n << BigInt(M - i - 1); // bigint is important\n      const b = Fp.pow(c, exponent); // b = 2^(M - i - 1)\n\n      // Update variables\n      M = i;\n      c = Fp.sqr(b); // c = b^2\n      t = Fp.mul(t, c); // t = (t * b^2)\n      R = Fp.mul(R, b); // R = R*b\n    }\n    return R;\n  };\n}\n\n/**\n * Square root for a finite field. Will try optimized versions first:\n *\n * 1. P \u2261 3 (mod 4)\n * 2. P \u2261 5 (mod 8)\n * 3. P \u2261 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n *\n * Different algorithms can give different roots, it is up to user to decide which one they want.\n * For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n */\nexport function FpSqrt(P: bigint): <T>(Fp: IField<T>, n: T) => T {\n  // P \u2261 3 (mod 4) => \u221An = n^((P+1)/4)\n  if (P % _4n === _3n) return sqrt3mod4;\n  // P \u2261 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf\n  if (P % _8n === _5n) return sqrt5mod8;\n  // P \u2261 9 (mod 16) => Kong algorithm, page 11 of https://eprint.iacr.org/2012/685.pdf (algorithm 4)\n  if (P % _16n === _9n) return sqrt9mod16(P);\n  // Tonelli-Shanks algorithm\n  return tonelliShanks(P);\n}\n\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num: bigint, modulo: bigint): boolean =>\n  (mod(num, modulo) & _1n) === _1n;\n\n/** Field is not always over prime: for example, Fp2 has ORDER(q)=p^m. */\nexport interface IField<T> {\n  ORDER: bigint;\n  isLE: boolean;\n  BYTES: number;\n  BITS: number;\n  MASK: bigint;\n  ZERO: T;\n  ONE: T;\n  // 1-arg\n  create: (num: T) => T;\n  isValid: (num: T) => boolean;\n  is0: (num: T) => boolean;\n  isValidNot0: (num: T) => boolean;\n  neg(num: T): T;\n  inv(num: T): T;\n  sqrt(num: T): T;\n  sqr(num: T): T;\n  // 2-args\n  eql(lhs: T, rhs: T): boolean;\n  add(lhs: T, rhs: T): T;\n  sub(lhs: T, rhs: T): T;\n  mul(lhs: T, rhs: T | bigint): T;\n  pow(lhs: T, power: bigint): T;\n  div(lhs: T, rhs: T | bigint): T;\n  // N for NonNormalized (for now)\n  addN(lhs: T, rhs: T): T;\n  subN(lhs: T, rhs: T): T;\n  mulN(lhs: T, rhs: T | bigint): T;\n  sqrN(num: T): T;\n\n  // Optional\n  // Should be same as sgn0 function in\n  // [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#section-4.1).\n  // NOTE: sgn0 is 'negative in LE', which is same as odd. And negative in LE is kinda strange definition anyway.\n  isOdd?(num: T): boolean; // Odd instead of even since we have it for Fp2\n  allowedLengths?: number[];\n  // legendre?(num: T): T;\n  invertBatch: (lst: T[]) => T[];\n  toBytes(num: T): Uint8Array;\n  fromBytes(bytes: Uint8Array, skipValidation?: boolean): T;\n  // If c is False, CMOV returns a, otherwise it returns b.\n  cmov(a: T, b: T, c: boolean): T;\n}\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] as const;\nexport function validateField<T>(field: IField<T>): IField<T> {\n  const initial = {\n    ORDER: 'bigint',\n    MASK: 'bigint',\n    BYTES: 'number',\n    BITS: 'number',\n  } as Record<string, string>;\n  const opts = FIELD_FIELDS.reduce((map, val: string) => {\n    map[val] = 'function';\n    return map;\n  }, initial);\n  _validateObject(field, opts);\n  // const max = 16384;\n  // if (field.BYTES < 1 || field.BYTES > max) throw new Error('invalid field');\n  // if (field.BITS < 1 || field.BITS > 8 * max) throw new Error('invalid field');\n  return field;\n}\n\n// Generic field functions\n\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<T>(Fp: IField<T>, num: T, power: bigint): T {\n  if (power < _0n) throw new Error('invalid exponent, negatives unsupported');\n  if (power === _0n) return Fp.ONE;\n  if (power === _1n) return num;\n  let p = Fp.ONE;\n  let d = num;\n  while (power > _0n) {\n    if (power & _1n) p = Fp.mul(p, d);\n    d = Fp.sqr(d);\n    power >>= _1n;\n  }\n  return p;\n}\n\n/**\n * Efficiently invert an array of Field elements.\n * Exception-free. Will return `undefined` for 0 elements.\n * @param passZero map 0 to 0 (instead of undefined)\n */\nexport function FpInvertBatch<T>(Fp: IField<T>, nums: T[], passZero = false): T[] {\n  const inverted = new Array(nums.length).fill(passZero ? Fp.ZERO : undefined);\n  // Walk from first to last, multiply them by each other MOD p\n  const multipliedAcc = nums.reduce((acc, num, i) => {\n    if (Fp.is0(num)) return acc;\n    inverted[i] = acc;\n    return Fp.mul(acc, num);\n  }, Fp.ONE);\n  // Invert last element\n  const invertedAcc = Fp.inv(multipliedAcc);\n  // Walk from last to first, multiply them by inverted each other MOD p\n  nums.reduceRight((acc, num, i) => {\n    if (Fp.is0(num)) return acc;\n    inverted[i] = Fp.mul(acc, inverted[i]);\n    return Fp.mul(acc, num);\n  }, invertedAcc);\n  return inverted;\n}\n\n// TODO: remove\nexport function FpDiv<T>(Fp: IField<T>, lhs: T, rhs: T | bigint): T {\n  return Fp.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, Fp.ORDER) : Fp.inv(rhs));\n}\n\n/**\n * Legendre symbol.\n * Legendre constant is used to calculate Legendre symbol (a | p)\n * which denotes the value of a^((p-1)/2) (mod p).\n *\n * * (a | p) \u2261 1    if a is a square (mod p), quadratic residue\n * * (a | p) \u2261 -1   if a is not a square (mod p), quadratic non residue\n * * (a | p) \u2261 0    if a \u2261 0 (mod p)\n */\nexport function FpLegendre<T>(Fp: IField<T>, n: T): -1 | 0 | 1 {\n  // We can use 3rd argument as optional cache of this value\n  // but seems unneeded for now. The operation is very fast.\n  const p1mod2 = (Fp.ORDER - _1n) / _2n;\n  const powered = Fp.pow(n, p1mod2);\n  const yes = Fp.eql(powered, Fp.ONE);\n  const zero = Fp.eql(powered, Fp.ZERO);\n  const no = Fp.eql(powered, Fp.neg(Fp.ONE));\n  if (!yes && !zero && !no) throw new Error('invalid Legendre symbol result');\n  return yes ? 1 : zero ? 0 : -1;\n}\n\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare<T>(Fp: IField<T>, n: T): boolean {\n  const l = FpLegendre(Fp, n);\n  return l === 1;\n}\n\nexport type NLength = { nByteLength: number; nBitLength: number };\n// CURVE.n lengths\nexport function nLength(n: bigint, nBitLength?: number): NLength {\n  // Bit size, byte size of CURVE.n\n  if (nBitLength !== undefined) anumber(nBitLength);\n  const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n  const nByteLength = Math.ceil(_nBitLength / 8);\n  return { nBitLength: _nBitLength, nByteLength };\n}\n\ntype FpField = IField<bigint> & Required<Pick<IField<bigint>, 'isOdd'>>;\ntype SqrtFn = (n: bigint) => bigint;\ntype FieldOpts = Partial<{\n  sqrt: SqrtFn;\n  isLE: boolean;\n  BITS: number;\n  modFromBytes: boolean; // bls12-381 requires mod(n) instead of rejecting keys >= n\n  allowedLengths?: readonly number[]; // for P521 (adds padding for smaller sizes)\n}>;\n/**\n * Creates a finite field. Major performance optimizations:\n * * 1. Denormalized operations like mulN instead of mul.\n * * 2. Identical object shape: never add or remove keys.\n * * 3. `Object.freeze`.\n * Fragile: always run a benchmark on a change.\n * Security note: operations don't check 'isValid' for all elements for performance reasons,\n * it is caller responsibility to check this.\n * This is low-level code, please make sure you know what you're doing.\n *\n * Note about field properties:\n * * CHARACTERISTIC p = prime number, number of elements in main subgroup.\n * * ORDER q = similar to cofactor in curves, may be composite `q = p^m`.\n *\n * @param ORDER field order, probably prime, or could be composite\n * @param bitLen how many bits the field consumes\n * @param isLE (default: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(\n  ORDER: bigint,\n  bitLenOrOpts?: number | FieldOpts, // TODO: use opts only in v2?\n  isLE = false,\n  opts: { sqrt?: SqrtFn } = {}\n): Readonly<FpField> {\n  if (ORDER <= _0n) throw new Error('invalid field: expected ORDER > 0, got ' + ORDER);\n  let _nbitLength: number | undefined = undefined;\n  let _sqrt: SqrtFn | undefined = undefined;\n  let modFromBytes: boolean = false;\n  let allowedLengths: undefined | readonly number[] = undefined;\n  if (typeof bitLenOrOpts === 'object' && bitLenOrOpts != null) {\n    if (opts.sqrt || isLE) throw new Error('cannot specify opts in two arguments');\n    const _opts = bitLenOrOpts;\n    if (_opts.BITS) _nbitLength = _opts.BITS;\n    if (_opts.sqrt) _sqrt = _opts.sqrt;\n    if (typeof _opts.isLE === 'boolean') isLE = _opts.isLE;\n    if (typeof _opts.modFromBytes === 'boolean') modFromBytes = _opts.modFromBytes;\n    allowedLengths = _opts.allowedLengths;\n  } else {\n    if (typeof bitLenOrOpts === 'number') _nbitLength = bitLenOrOpts;\n    if (opts.sqrt) _sqrt = opts.sqrt;\n  }\n  const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, _nbitLength);\n  if (BYTES > 2048) throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n  let sqrtP: ReturnType<typeof FpSqrt>; // cached sqrtP\n  const f: Readonly<FpField> = Object.freeze({\n    ORDER,\n    isLE,\n    BITS,\n    BYTES,\n    MASK: bitMask(BITS),\n    ZERO: _0n,\n    ONE: _1n,\n    allowedLengths: allowedLengths,\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    // is valid and invertible\n    isValidNot0: (num: bigint) => !f.is0(num) && f.isValid(num),\n    isOdd: (num) => (num & _1n) === _1n,\n    neg: (num) => mod(-num, ORDER),\n    eql: (lhs, rhs) => lhs === rhs,\n\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\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\n    inv: (num) => invert(num, ORDER),\n    sqrt:\n      _sqrt ||\n      ((n) => {\n        if (!sqrtP) sqrtP = FpSqrt(ORDER);\n        return sqrtP(f, n);\n      }),\n    toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n    fromBytes: (bytes, skipValidation = true) => {\n      if (allowedLengths) {\n        if (!allowedLengths.includes(bytes.length) || bytes.length > BYTES) {\n          throw new Error(\n            'Field.fromBytes: expected ' + allowedLengths + ' bytes, got ' + bytes.length\n          );\n        }\n        const padded = new Uint8Array(BYTES);\n        // isLE add 0 to right, !isLE to the left.\n        padded.set(bytes, isLE ? 0 : padded.length - bytes.length);\n        bytes = padded;\n      }\n      if (bytes.length !== BYTES)\n        throw new Error('Field.fromBytes: expected ' + BYTES + ' bytes, got ' + bytes.length);\n      let scalar = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n      if (modFromBytes) scalar = mod(scalar, ORDER);\n      if (!skipValidation)\n        if (!f.isValid(scalar)) throw new Error('invalid field element: outside of range 0..ORDER');\n      // NOTE: we don't validate scalar here, please use isValid. This done such way because some\n      // protocol may allow non-reduced scalar that reduced later or changed some other way.\n      return scalar;\n    },\n    // TODO: we don't need it here, move out to separate fn\n    invertBatch: (lst) => FpInvertBatch(f, lst),\n    // We can't move this out because Fp6, Fp12 implement it\n    // and it's unclear what to return in there.\n    cmov: (a, b, c) => (c ? b : a),\n  } as FpField);\n  return Object.freeze(f);\n}\n\n// Generic random scalar, we can do same for other fields if via Fp2.mul(Fp2.ONE, Fp2.random)?\n// This allows unsafe methods like ignore bias or zero. These unsafe, but often used in different protocols (if deterministic RNG).\n// which mean we cannot force this via opts.\n// Not sure what to do with randomBytes, we can accept it inside opts if wanted.\n// Probably need to export getMinHashLength somewhere?\n// random(bytes?: Uint8Array, unsafeAllowZero = false, unsafeAllowBias = false) {\n//   const LEN = !unsafeAllowBias ? getMinHashLength(ORDER) : BYTES;\n//   if (bytes === undefined) bytes = randomBytes(LEN); // _opts.randomBytes?\n//   const num = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n//   // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n//   const reduced = unsafeAllowZero ? mod(num, ORDER) : mod(num, ORDER - _1n) + _1n;\n//   return reduced;\n// },\n\nexport function FpSqrtOdd<T>(Fp: IField<T>, elm: T): T {\n  if (!Fp.isOdd) throw new Error(\"Field doesn't have isOdd\");\n  const root = Fp.sqrt(elm);\n  return Fp.isOdd(root) ? root : Fp.neg(root);\n}\n\nexport function FpSqrtEven<T>(Fp: IField<T>, elm: T): T {\n  if (!Fp.isOdd) 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/**\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(\n  hash: string | Uint8Array,\n  groupOrder: bigint,\n  isLE = false\n): bigint {\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(\n      'hashToPrivateScalar: expected ' + minLen + '-1024 bytes of input, got ' + hashLen\n    );\n  const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n  return mod(num, groupOrder - _1n) + _1n;\n}\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: bigint): number {\n  if (typeof fieldOrder !== 'bigint') throw new Error('field order must be bigint');\n  const bitLength = fieldOrder.toString(2).length;\n  return Math.ceil(bitLength / 8);\n}\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: bigint): number {\n  const length = getFieldBytesLength(fieldOrder);\n  return length + Math.ceil(length / 2);\n}\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: Uint8Array, fieldOrder: bigint, isLE = false): Uint8Array {\n  const len = key.length;\n  const fieldLen = getFieldBytesLength(fieldOrder);\n  const minLen = getMinHashLength(fieldOrder);\n  // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n  if (len < 16 || len < minLen || len > 1024)\n    throw new Error('expected ' + minLen + '-1024 bytes of input, got ' + len);\n  const num = isLE ? bytesToNumberLE(key) : bytesToNumberBE(key);\n  // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n  const reduced = mod(num, fieldOrder - _1n) + _1n;\n  return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n", "/**\n * Methods for elliptic curve multiplication by scalars.\n * Contains wNAF, pippenger.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { bitLen, bitMask, validateObject } from '../utils.ts';\nimport { Field, FpInvertBatch, nLength, validateField, type IField } from './modular.ts';\n\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n\nexport type AffinePoint<T> = {\n  x: T;\n  y: T;\n} & { Z?: never };\n\n// This was initialy do this way to re-use montgomery ladder in field (add->mul,double->sqr), but\n// that didn't happen and there is probably not much reason to have separate Group like this?\nexport interface Group<T extends Group<T>> {\n  double(): T;\n  negate(): T;\n  add(other: T): T;\n  subtract(other: T): T;\n  equals(other: T): boolean;\n  multiply(scalar: bigint): T;\n  toAffine?(invertedZ?: any): AffinePoint<any>;\n}\n\n// We can't \"abstract out\" coordinates (X, Y, Z; and T in Edwards): argument names of constructor\n// are not accessible. See Typescript gh-56093, gh-41594.\n//\n// We have to use recursive types, so it will return actual point, not constained `CurvePoint`.\n// If, at any point, P is `any`, it will erase all types and replace it\n// with `any`, because of recursion, `any implements CurvePoint`,\n// but we lose all constrains on methods.\n\n/** Base interface for all elliptic curve Points. */\nexport interface CurvePoint<F, P extends CurvePoint<F, P>> extends Group<P> {\n  /** Affine x coordinate. Different from projective / extended X coordinate. */\n  x: F;\n  /** Affine y coordinate. Different from projective / extended Y coordinate. */\n  y: F;\n  Z?: F;\n  double(): P;\n  negate(): P;\n  add(other: P): P;\n  subtract(other: P): P;\n  equals(other: P): boolean;\n  multiply(scalar: bigint): P;\n  assertValidity(): void;\n  clearCofactor(): P;\n  is0(): boolean;\n  isTorsionFree(): boolean;\n  isSmallOrder(): boolean;\n  multiplyUnsafe(scalar: bigint): P;\n  /**\n   * Massively speeds up `p.multiply(n)` by using precompute tables (caching). See {@link wNAF}.\n   * @param isLazy calculate cache now. Default (true) ensures it's deferred to first `multiply()`\n   */\n  precompute(windowSize?: number, isLazy?: boolean): P;\n  /** Converts point to 2D xy affine coordinates */\n  toAffine(invertedZ?: F): AffinePoint<F>;\n  toBytes(): Uint8Array;\n  toHex(): string;\n}\n\n/** Base interface for all elliptic curve Point constructors. */\nexport interface CurvePointCons<P extends CurvePoint<any, P>> {\n  [Symbol.hasInstance]: (item: unknown) => boolean;\n  BASE: P;\n  ZERO: P;\n  /** Field for basic curve math */\n  Fp: IField<P_F<P>>;\n  /** Scalar field, for scalars in multiply and others */\n  Fn: IField<bigint>;\n  /** Creates point from x, y. Does NOT validate if the point is valid. Use `.assertValidity()`. */\n  fromAffine(p: AffinePoint<P_F<P>>): P;\n  fromBytes(bytes: Uint8Array): P;\n  fromHex(hex: Uint8Array | string): P;\n}\n\n// Type inference helpers: PC - PointConstructor, P - Point, Fp - Field element\n// Short names, because we use them a lot in result types:\n// * we can't do 'P = GetCurvePoint<PC>': this is default value and doesn't constrain anything\n// * we can't do 'type X = GetCurvePoint<PC>': it won't be accesible for arguments/return types\n// * `CurvePointCons<P extends CurvePoint<any, P>>` constraints from interface definition\n//   won't propagate, if `PC extends CurvePointCons<any>`: the P would be 'any', which is incorrect\n// * PC could be super specific with super specific P, which implements CurvePoint<any, P>.\n//   this means we need to do stuff like\n//   `function test<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(`\n//   if we want type safety around P, otherwise PC_P<PC> will be any\n\n/** Returns Fp type from Point (P_F<P> == P.F) */\nexport type P_F<P extends CurvePoint<any, P>> = P extends CurvePoint<infer F, P> ? F : never;\n/** Returns Fp type from PointCons (PC_F<PC> == PC.P.F) */\nexport type PC_F<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['Fp']['ZERO'];\n/** Returns Point type from PointCons (PC_P<PC> == PC.P) */\nexport type PC_P<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['ZERO'];\n\n// Ugly hack to get proper type inference, because in typescript fails to infer resursively.\n// The hack allows to do up to 10 chained operations without applying type erasure.\n//\n// Types which won't work:\n// * `CurvePointCons<CurvePoint<any, any>>`, will return `any` after 1 operation\n// * `CurvePointCons<any>: WeierstrassPointCons<bigint> extends CurvePointCons<any> = false`\n// * `P extends CurvePoint, PC extends CurvePointCons<P>`\n//     * It can't infer P from PC alone\n//     * Too many relations between F, P & PC\n//     * It will infer P/F if `arg: CurvePointCons<F, P>`, but will fail if PC is generic\n//     * It will work correctly if there is an additional argument of type P\n//     * But generally, we don't want to parametrize `CurvePointCons` over `F`: it will complicate\n//       types, making them un-inferable\n// prettier-ignore\nexport type PC_ANY = CurvePointCons<\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any,\n  CurvePoint<any, any>\n  >>>>>>>>>\n>;\n\nexport interface CurveLengths {\n  secretKey?: number;\n  publicKey?: number;\n  publicKeyUncompressed?: number;\n  publicKeyHasPrefix?: boolean;\n  signature?: number;\n  seed?: number;\n}\nexport type GroupConstructor<T> = {\n  BASE: T;\n  ZERO: T;\n};\n/** @deprecated */\nexport type ExtendedGroupConstructor<T> = GroupConstructor<T> & {\n  Fp: IField<any>;\n  Fn: IField<bigint>;\n  fromAffine(ap: AffinePoint<any>): T;\n};\nexport type Mapper<T> = (i: T[]) => T[];\n\nexport function negateCt<T extends { negate: () => T }>(condition: boolean, item: T): T {\n  const neg = item.negate();\n  return condition ? neg : item;\n}\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 */\nexport function normalizeZ<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n  c: PC,\n  points: P[]\n): P[] {\n  const invertedZs = FpInvertBatch(\n    c.Fp,\n    points.map((p) => p.Z!)\n  );\n  return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));\n}\n\nfunction validateW(W: number, bits: number) {\n  if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n    throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\n\n/** Internal wNAF opts for specific W and scalarBits */\nexport type WOpts = {\n  windows: number;\n  windowSize: number;\n  mask: bigint;\n  maxNumber: number;\n  shiftBy: bigint;\n};\n\nfunction calcWOpts(W: number, scalarBits: number): WOpts {\n  validateW(W, scalarBits);\n  const windows = Math.ceil(scalarBits / W) + 1; // W=8 33. Not 32, because we skip zero\n  const windowSize = 2 ** (W - 1); // W=8 128. Not 256, because we skip zero\n  const maxNumber = 2 ** W; // W=8 256\n  const mask = bitMask(W); // W=8 255 == mask 0b11111111\n  const shiftBy = BigInt(W); // W=8 8\n  return { windows, windowSize, mask, maxNumber, shiftBy };\n}\n\nfunction calcOffsets(n: bigint, window: number, wOpts: WOpts) {\n  const { windowSize, mask, maxNumber, shiftBy } = wOpts;\n  let wbits = Number(n & mask); // extract W bits.\n  let nextN = n >> shiftBy; // shift number by W bits.\n\n  // What actually happens here:\n  // const highestBit = Number(mask ^ (mask >> 1n));\n  // let wbits2 = wbits - 1; // skip zero\n  // if (wbits2 & highestBit) { wbits2 ^= Number(mask); // (~);\n\n  // split if bits > max: +224 => 256-32\n  if (wbits > windowSize) {\n    // we skip zero, which means instead of `>= size-1`, we do `> size`\n    wbits -= maxNumber; // -32, can be maxNumber - wbits, but then we need to set isNeg here.\n    nextN += _1n; // +256 (carry)\n  }\n  const offsetStart = window * windowSize;\n  const offset = offsetStart + Math.abs(wbits) - 1; // -1 because we skip zero\n  const isZero = wbits === 0; // is current window slice a 0?\n  const isNeg = wbits < 0; // is current window slice negative?\n  const isNegF = window % 2 !== 0; // fake random statement for noise\n  const offsetF = offsetStart; // fake offset for noise\n  return { nextN, offset, isZero, isNeg, isNegF, offsetF };\n}\n\nfunction validateMSMPoints(points: any[], c: any) {\n  if (!Array.isArray(points)) throw new Error('array expected');\n  points.forEach((p, i) => {\n    if (!(p instanceof c)) throw new Error('invalid point at index ' + i);\n  });\n}\nfunction validateMSMScalars(scalars: any[], field: any) {\n  if (!Array.isArray(scalars)) throw new Error('array of scalars expected');\n  scalars.forEach((s, i) => {\n    if (!field.isValid(s)) throw new Error('invalid scalar at index ' + i);\n  });\n}\n\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes.\n// Allows to make points frozen / immutable.\nconst pointPrecomputes = new WeakMap<any, any[]>();\nconst pointWindowSizes = new WeakMap<any, number>();\n\nfunction getW(P: any): number {\n  // To disable precomputes:\n  // return 1;\n  return pointWindowSizes.get(P) || 1;\n}\n\nfunction assert0(n: bigint): void {\n  if (n !== _0n) throw new Error('invalid wNAF');\n}\n\n/**\n * Elliptic curve multiplication of Point by scalar. Fragile.\n * Table generation takes **30MB of ram and 10ms on high-end CPU**,\n * but may take much longer on slow devices. Actual generation will happen on\n * first call of `multiply()`. By default, `BASE` point is precomputed.\n *\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 / \uD835\uDC4A) + 1' point additions (fixed for any scalar)\n * - +1 window is neccessary for wNAF\n * - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n *\n * @todo Research returning 2d JS array of windows, instead of a single window.\n * This would allow windows to be in different memory locations\n */\nexport class wNAF<PC extends PC_ANY> {\n  private readonly BASE: PC_P<PC>;\n  private readonly ZERO: PC_P<PC>;\n  private readonly Fn: PC['Fn'];\n  readonly bits: number;\n\n  // Parametrized with a given Point class (not individual point)\n  constructor(Point: PC, bits: number) {\n    this.BASE = Point.BASE;\n    this.ZERO = Point.ZERO;\n    this.Fn = Point.Fn;\n    this.bits = bits;\n  }\n\n  // non-const time multiplication ladder\n  _unsafeLadder(elm: PC_P<PC>, n: bigint, p: PC_P<PC> = this.ZERO): PC_P<PC> {\n    let d: PC_P<PC> = elm;\n    while (n > _0n) {\n      if (n & _1n) p = p.add(d);\n      d = d.double();\n      n >>= _1n;\n    }\n    return p;\n  }\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^(\uD835\uDC4A\u22121) * (Math.ceil(\uD835\uDC5B / \uD835\uDC4A) + 1), where:\n   * - \uD835\uDC4A is the window size\n   * - \uD835\uDC5B is the bitlength of the curve order.\n   * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n   * @param point Point instance\n   * @param W window size\n   * @returns precomputed point tables flattened to a single array\n   */\n  private precomputeWindow(point: PC_P<PC>, W: number): PC_P<PC>[] {\n    const { windows, windowSize } = calcWOpts(W, this.bits);\n    const points: PC_P<PC>[] = [];\n    let p: PC_P<PC> = point;\n    let base = p;\n    for (let window = 0; window < windows; window++) {\n      base = p;\n      points.push(base);\n      // i=1, bc we skip 0\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  /**\n   * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n   * More compact implementation:\n   * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541\n   * @returns real and fake (for const-time) points\n   */\n  private wNAF(W: number, precomputes: PC_P<PC>[], n: bigint): { p: PC_P<PC>; f: PC_P<PC> } {\n    // Scalar should be smaller than field order\n    if (!this.Fn.isValid(n)) throw new Error('invalid scalar');\n    // Accumulators\n    let p = this.ZERO;\n    let f = this.BASE;\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    const wo = calcWOpts(W, this.bits);\n    for (let window = 0; window < wo.windows; window++) {\n      // (n === _0n) is handled and not early-exited. isEven and offsetF are used for noise\n      const { nextN, offset, isZero, isNeg, isNegF, offsetF } = calcOffsets(n, window, wo);\n      n = nextN;\n      if (isZero) {\n        // bits are 0: add garbage to fake point\n        // Important part for const-time getPublicKey: add random \"noise\" point to f.\n        f = f.add(negateCt(isNegF, precomputes[offsetF]));\n      } else {\n        // bits are 1: add to result point\n        p = p.add(negateCt(isNeg, precomputes[offset]));\n      }\n    }\n    assert0(n);\n    // Return both real and fake points: JIT won't eliminate f.\n    // At this point there is a way to F be infinity-point even if p is not,\n    // which makes it less const-time: around 1 bigint multiply.\n    return { p, f };\n  }\n\n  /**\n   * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.\n   * @param acc accumulator point to add result of multiplication\n   * @returns point\n   */\n  private wNAFUnsafe(\n    W: number,\n    precomputes: PC_P<PC>[],\n    n: bigint,\n    acc: PC_P<PC> = this.ZERO\n  ): PC_P<PC> {\n    const wo = calcWOpts(W, this.bits);\n    for (let window = 0; window < wo.windows; window++) {\n      if (n === _0n) break; // Early-exit, skip 0 value\n      const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);\n      n = nextN;\n      if (isZero) {\n        // Window bits are 0: skip processing.\n        // Move to next window.\n        continue;\n      } else {\n        const item = precomputes[offset];\n        acc = acc.add(isNeg ? item.negate() : item); // Re-using acc allows to save adds in MSM\n      }\n    }\n    assert0(n);\n    return acc;\n  }\n\n  private getPrecomputes(W: number, point: PC_P<PC>, transform?: Mapper<PC_P<PC>>): PC_P<PC>[] {\n    // Calculate precomputes on a first run, reuse them after\n    let comp = pointPrecomputes.get(point);\n    if (!comp) {\n      comp = this.precomputeWindow(point, W) as PC_P<PC>[];\n      if (W !== 1) {\n        // Doing transform outside of if brings 15% perf hit\n        if (typeof transform === 'function') comp = transform(comp);\n        pointPrecomputes.set(point, comp);\n      }\n    }\n    return comp;\n  }\n\n  cached(\n    point: PC_P<PC>,\n    scalar: bigint,\n    transform?: Mapper<PC_P<PC>>\n  ): { p: PC_P<PC>; f: PC_P<PC> } {\n    const W = getW(point);\n    return this.wNAF(W, this.getPrecomputes(W, point, transform), scalar);\n  }\n\n  unsafe(point: PC_P<PC>, scalar: bigint, transform?: Mapper<PC_P<PC>>, prev?: PC_P<PC>): PC_P<PC> {\n    const W = getW(point);\n    if (W === 1) return this._unsafeLadder(point, scalar, prev); // For W=1 ladder is ~x2 faster\n    return this.wNAFUnsafe(W, this.getPrecomputes(W, point, transform), scalar, prev);\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  createCache(P: PC_P<PC>, W: number): void {\n    validateW(W, this.bits);\n    pointWindowSizes.set(P, W);\n    pointPrecomputes.delete(P);\n  }\n\n  hasCache(elm: PC_P<PC>): boolean {\n    return getW(elm) !== 1;\n  }\n}\n\n/**\n * Endomorphism-specific multiplication for Koblitz curves.\n * Cost: 128 dbl, 0-256 adds.\n */\nexport function mulEndoUnsafe<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n  Point: PC,\n  point: P,\n  k1: bigint,\n  k2: bigint\n): { p1: P; p2: P } {\n  let acc = point;\n  let p1 = Point.ZERO;\n  let p2 = Point.ZERO;\n  while (k1 > _0n || k2 > _0n) {\n    if (k1 & _1n) p1 = p1.add(acc);\n    if (k2 & _1n) p2 = p2.add(acc);\n    acc = acc.double();\n    k1 >>= _1n;\n    k2 >>= _1n;\n  }\n  return { p1, p2 };\n}\n\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster than precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @param scalars array of L scalars (aka secret keys / bigints)\n */\nexport function pippenger<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n  c: PC,\n  fieldN: IField<bigint>,\n  points: P[],\n  scalars: bigint[]\n): P {\n  // If we split scalars by some window (let's say 8 bits), every chunk will only\n  // take 256 buckets even if there are 4096 scalars, also re-uses double.\n  // TODO:\n  // - https://eprint.iacr.org/2024/750.pdf\n  // - https://tches.iacr.org/index.php/TCHES/article/view/10287\n  // 0 is accepted in scalars\n  validateMSMPoints(points, c);\n  validateMSMScalars(scalars, fieldN);\n  const plength = points.length;\n  const slength = scalars.length;\n  if (plength !== slength) throw new Error('arrays of points and scalars must have equal length');\n  // if (plength === 0) throw new Error('array must be of length >= 2');\n  const zero = c.ZERO;\n  const wbits = bitLen(BigInt(plength));\n  let windowSize = 1; // bits\n  if (wbits > 12) windowSize = wbits - 3;\n  else if (wbits > 4) windowSize = wbits - 2;\n  else if (wbits > 0) windowSize = 2;\n  const MASK = bitMask(windowSize);\n  const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array\n  const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;\n  let sum = zero;\n  for (let i = lastBits; i >= 0; i -= windowSize) {\n    buckets.fill(zero);\n    for (let j = 0; j < slength; j++) {\n      const scalar = scalars[j];\n      const wbits = Number((scalar >> BigInt(i)) & MASK);\n      buckets[wbits] = buckets[wbits].add(points[j]);\n    }\n    let resI = zero; // not using this will do small speed-up, but will lose ct\n    // Skip first bucket, because it is zero\n    for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n      sumI = sumI.add(buckets[j]);\n      resI = resI.add(sumI);\n    }\n    sum = sum.add(resI);\n    if (i !== 0) for (let j = 0; j < windowSize; j++) sum = sum.double();\n  }\n  return sum as P;\n}\n/**\n * Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @returns function which multiplies points with scaars\n */\nexport function precomputeMSMUnsafe<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n  c: PC,\n  fieldN: IField<bigint>,\n  points: P[],\n  windowSize: number\n): (scalars: bigint[]) => P {\n  /**\n   * Performance Analysis of Window-based Precomputation\n   *\n   * Base Case (256-bit scalar, 8-bit window):\n   * - Standard precomputation requires:\n   *   - 31 additions per scalar \u00D7 256 scalars = 7,936 ops\n   *   - Plus 255 summary additions = 8,191 total ops\n   *   Note: Summary additions can be optimized via accumulator\n   *\n   * Chunked Precomputation Analysis:\n   * - Using 32 chunks requires:\n   *   - 255 additions per chunk\n   *   - 256 doublings\n   *   - Total: (255 \u00D7 32) + 256 = 8,416 ops\n   *\n   * Memory Usage Comparison:\n   * Window Size | Standard Points | Chunked Points\n   * ------------|-----------------|---------------\n   *     4-bit   |     520         |      15\n   *     8-bit   |    4,224        |     255\n   *    10-bit   |   13,824        |   1,023\n   *    16-bit   |  557,056        |  65,535\n   *\n   * Key Advantages:\n   * 1. Enables larger window sizes due to reduced memory overhead\n   * 2. More efficient for smaller scalar counts:\n   *    - 16 chunks: (16 \u00D7 255) + 256 = 4,336 ops\n   *    - ~2x faster than standard 8,191 ops\n   *\n   * Limitations:\n   * - Not suitable for plain precomputes (requires 256 constant doublings)\n   * - Performance degrades with larger scalar counts:\n   *   - Optimal for ~256 scalars\n   *   - Less efficient for 4096+ scalars (Pippenger preferred)\n   */\n  validateW(windowSize, fieldN.BITS);\n  validateMSMPoints(points, c);\n  const zero = c.ZERO;\n  const tableSize = 2 ** windowSize - 1; // table size (without zero)\n  const chunks = Math.ceil(fieldN.BITS / windowSize); // chunks of item\n  const MASK = bitMask(windowSize);\n  const tables = points.map((p: P) => {\n    const res = [];\n    for (let i = 0, acc = p; i < tableSize; i++) {\n      res.push(acc);\n      acc = acc.add(p);\n    }\n    return res;\n  });\n  return (scalars: bigint[]): P => {\n    validateMSMScalars(scalars, fieldN);\n    if (scalars.length > points.length)\n      throw new Error('array of scalars must be smaller than array of points');\n    let res = zero;\n    for (let i = 0; i < chunks; i++) {\n      // No need to double if accumulator is still zero.\n      if (res !== zero) for (let j = 0; j < windowSize; j++) res = res.double();\n      const shiftBy = BigInt(chunks * windowSize - (i + 1) * windowSize);\n      for (let j = 0; j < scalars.length; j++) {\n        const n = scalars[j];\n        const curr = Number((n >> shiftBy) & MASK);\n        if (!curr) continue; // skip zero scalars chunks\n        res = res.add(tables[j][curr - 1]);\n      }\n    }\n    return res;\n  };\n}\n\n// TODO: remove\n/**\n * Generic BasicCurve interface: works even for polynomial fields (BLS): P, n, h would be ok.\n * Though generator can be different (Fp2 / Fp6 for BLS).\n */\nexport type BasicCurve<T> = {\n  Fp: IField<T>; // Field over which we'll do calculations (Fp)\n  n: bigint; // Curve order, total count of valid points in the field\n  nBitLength?: number; // bit length of curve order\n  nByteLength?: number; // byte length of curve order\n  h: bigint; // cofactor. we can assign default=1, but users will just ignore it w/o validation\n  hEff?: bigint; // Number to multiply to clear cofactor\n  Gx: T; // base point X coordinate\n  Gy: T; // base point Y coordinate\n  allowInfinityPoint?: boolean; // bls12-381 requires it. ZERO point is valid, but invalid pubkey\n};\n\n// TODO: remove\n/** @deprecated */\nexport function validateBasic<FP, T>(\n  curve: BasicCurve<FP> & T\n): Readonly<\n  {\n    readonly nBitLength: number;\n    readonly nByteLength: number;\n  } & BasicCurve<FP> &\n    T & {\n      p: bigint;\n    }\n> {\n  validateField(curve.Fp);\n  validateObject(\n    curve,\n    {\n      n: 'bigint',\n      h: 'bigint',\n      Gx: 'field',\n      Gy: 'field',\n    },\n    {\n      nBitLength: 'isSafeInteger',\n      nByteLength: 'isSafeInteger',\n    }\n  );\n  // Set defaults\n  return Object.freeze({\n    ...nLength(curve.n, curve.nBitLength),\n    ...curve,\n    ...{ p: curve.Fp.ORDER },\n  } as const);\n}\n\nexport type ValidCurveParams<T> = {\n  p: bigint;\n  n: bigint;\n  h: bigint;\n  a: T;\n  b?: T;\n  d?: T;\n  Gx: T;\n  Gy: T;\n};\n\nfunction createField<T>(order: bigint, field?: IField<T>, isLE?: boolean): IField<T> {\n  if (field) {\n    if (field.ORDER !== order) throw new Error('Field.ORDER must match order: Fp == p, Fn == n');\n    validateField(field);\n    return field;\n  } else {\n    return Field(order, { isLE }) as unknown as IField<T>;\n  }\n}\nexport type FpFn<T> = { Fp: IField<T>; Fn: IField<bigint> };\n\n/** Validates CURVE opts and creates fields */\nexport function _createCurveFields<T>(\n  type: 'weierstrass' | 'edwards',\n  CURVE: ValidCurveParams<T>,\n  curveOpts: Partial<FpFn<T>> = {},\n  FpFnLE?: boolean\n): FpFn<T> & { CURVE: ValidCurveParams<T> } {\n  if (FpFnLE === undefined) FpFnLE = type === 'edwards';\n  if (!CURVE || typeof CURVE !== 'object') throw new Error(`expected valid ${type} CURVE object`);\n  for (const p of ['p', 'n', 'h'] as const) {\n    const val = CURVE[p];\n    if (!(typeof val === 'bigint' && val > _0n))\n      throw new Error(`CURVE.${p} must be positive bigint`);\n  }\n  const Fp = createField(CURVE.p, curveOpts.Fp, FpFnLE);\n  const Fn = createField(CURVE.n, curveOpts.Fn, FpFnLE);\n  const _b: 'b' | 'd' = type === 'weierstrass' ? 'b' : 'd';\n  const params = ['Gx', 'Gy', 'a', _b] as const;\n  for (const p of params) {\n    // @ts-ignore\n    if (!Fp.isValid(CURVE[p]))\n      throw new Error(`CURVE.${p} must be valid field element of CURVE.Fp`);\n  }\n  CURVE = Object.freeze(Object.assign({}, CURVE));\n  return { CURVE, Fp, Fn };\n}\n", "/**\n * Twisted Edwards curve. The formula is: ax\u00B2 + y\u00B2 = 1 + dx\u00B2y\u00B2.\n * For design rationale of types / exports, see weierstrass module documentation.\n * Untwisted Edwards curves exist, but they aren't used in real-world protocols.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport {\n  _validateObject,\n  _abool2 as abool,\n  _abytes2 as abytes,\n  aInRange,\n  bytesToHex,\n  bytesToNumberLE,\n  concatBytes,\n  copyBytes,\n  ensureBytes,\n  isBytes,\n  memoized,\n  notImplemented,\n  randomBytes as randomBytesWeb,\n  type FHash,\n  type Hex,\n} from '../utils.ts';\nimport {\n  _createCurveFields,\n  normalizeZ,\n  pippenger,\n  wNAF,\n  type AffinePoint,\n  type BasicCurve,\n  type CurveLengths,\n  type CurvePoint,\n  type CurvePointCons,\n} from './curve.ts';\nimport { Field, type IField, type NLength } from './modular.ts';\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), _8n = BigInt(8);\n\nexport type UVRatio = (u: bigint, v: bigint) => { isValid: boolean; value: bigint };\n\n/** Instance of Extended Point with coordinates in X, Y, Z, T. */\nexport interface EdwardsPoint extends CurvePoint<bigint, EdwardsPoint> {\n  /** extended X coordinate. Different from affine x. */\n  readonly X: bigint;\n  /** extended Y coordinate. Different from affine y. */\n  readonly Y: bigint;\n  /** extended Z coordinate */\n  readonly Z: bigint;\n  /** extended T coordinate */\n  readonly T: bigint;\n\n  /** @deprecated use `toBytes` */\n  toRawBytes(): Uint8Array;\n  /** @deprecated use `p.precompute(windowSize)` */\n  _setWindowSize(windowSize: number): void;\n  /** @deprecated use .X */\n  readonly ex: bigint;\n  /** @deprecated use .Y */\n  readonly ey: bigint;\n  /** @deprecated use .Z */\n  readonly ez: bigint;\n  /** @deprecated use .T */\n  readonly et: bigint;\n}\n/** Static methods of Extended Point with coordinates in X, Y, Z, T. */\nexport interface EdwardsPointCons extends CurvePointCons<EdwardsPoint> {\n  new (X: bigint, Y: bigint, Z: bigint, T: bigint): EdwardsPoint;\n  CURVE(): EdwardsOpts;\n  fromBytes(bytes: Uint8Array, zip215?: boolean): EdwardsPoint;\n  fromHex(hex: Hex, zip215?: boolean): EdwardsPoint;\n  /** @deprecated use `import { pippenger } from '@noble/curves/abstract/curve.js';` */\n  msm(points: EdwardsPoint[], scalars: bigint[]): EdwardsPoint;\n}\n/** @deprecated use EdwardsPoint */\nexport type ExtPointType = EdwardsPoint;\n/** @deprecated use EdwardsPointCons */\nexport type ExtPointConstructor = EdwardsPointCons;\n\n/**\n * Twisted Edwards curve options.\n *\n * * a: formula param\n * * d: formula param\n * * p: prime characteristic (order) of finite field, in which arithmetics is done\n * * n: order of prime subgroup a.k.a total amount of valid curve points\n * * h: cofactor. h*n is group order; n is subgroup order\n * * Gx: x coordinate of generator point a.k.a. base point\n * * Gy: y coordinate of generator point\n */\nexport type EdwardsOpts = Readonly<{\n  p: bigint;\n  n: bigint;\n  h: bigint;\n  a: bigint;\n  d: bigint;\n  Gx: bigint;\n  Gy: bigint;\n}>;\n\n/**\n * Extra curve options for Twisted Edwards.\n *\n * * Fp: redefined Field over curve.p\n * * Fn: redefined Field over curve.n\n * * uvRatio: helper function for decompression, calculating \u221A(u/v)\n */\nexport type EdwardsExtraOpts = Partial<{\n  Fp: IField<bigint>;\n  Fn: IField<bigint>;\n  FpFnLE: boolean;\n  uvRatio: (u: bigint, v: bigint) => { isValid: boolean; value: bigint };\n}>;\n\n/**\n * EdDSA (Edwards Digital Signature algorithm) options.\n *\n * * hash: hash function used to hash secret keys and messages\n * * adjustScalarBytes: clears bits to get valid field element\n * * domain: Used for hashing\n * * mapToCurve: for hash-to-curve standard\n * * prehash: RFC 8032 pre-hashing of messages to sign() / verify()\n * * randomBytes: function generating random bytes, used for randomSecretKey\n */\nexport type EdDSAOpts = Partial<{\n  adjustScalarBytes: (bytes: Uint8Array) => Uint8Array;\n  domain: (data: Uint8Array, ctx: Uint8Array, phflag: boolean) => Uint8Array;\n  mapToCurve: (scalar: bigint[]) => AffinePoint<bigint>;\n  prehash: FHash;\n  randomBytes: (bytesLength?: number) => Uint8Array;\n}>;\n\n/**\n * EdDSA (Edwards Digital Signature algorithm) interface.\n *\n * Allows to create and verify signatures, create public and secret keys.\n */\nexport interface EdDSA {\n  keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n  getPublicKey: (secretKey: Hex) => Uint8Array;\n  sign: (message: Hex, secretKey: Hex, options?: { context?: Hex }) => Uint8Array;\n  verify: (\n    sig: Hex,\n    message: Hex,\n    publicKey: Hex,\n    options?: { context?: Hex; zip215: boolean }\n  ) => boolean;\n  Point: EdwardsPointCons;\n  utils: {\n    randomSecretKey: (seed?: Uint8Array) => Uint8Array;\n    isValidSecretKey: (secretKey: Uint8Array) => boolean;\n    isValidPublicKey: (publicKey: Uint8Array, zip215?: boolean) => boolean;\n\n    /**\n     * Converts ed public key to x public key.\n     *\n     * There is NO `fromMontgomery`:\n     * - There are 2 valid ed25519 points for every x25519, with flipped coordinate\n     * - Sometimes there are 0 valid ed25519 points, because x25519 *additionally*\n     *   accepts inputs on the quadratic twist, which can't be moved to ed25519\n     *\n     * @example\n     * ```js\n     * const someonesPub = ed25519.getPublicKey(ed25519.utils.randomSecretKey());\n     * const aPriv = x25519.utils.randomSecretKey();\n     * x25519.getSharedSecret(aPriv, ed25519.utils.toMontgomery(someonesPub))\n     * ```\n     */\n    toMontgomery: (publicKey: Uint8Array) => Uint8Array;\n    /**\n     * Converts ed secret key to x secret key.\n     * @example\n     * ```js\n     * const someonesPub = x25519.getPublicKey(x25519.utils.randomSecretKey());\n     * const aPriv = ed25519.utils.randomSecretKey();\n     * x25519.getSharedSecret(ed25519.utils.toMontgomerySecret(aPriv), someonesPub)\n     * ```\n     */\n    toMontgomerySecret: (privateKey: Uint8Array) => Uint8Array;\n    getExtendedPublicKey: (key: Hex) => {\n      head: Uint8Array;\n      prefix: Uint8Array;\n      scalar: bigint;\n      point: EdwardsPoint;\n      pointBytes: Uint8Array;\n    };\n\n    /** @deprecated use `randomSecretKey` */\n    randomPrivateKey: (seed?: Uint8Array) => Uint8Array;\n    /** @deprecated use `point.precompute()` */\n    precompute: (windowSize?: number, point?: EdwardsPoint) => EdwardsPoint;\n  };\n  lengths: CurveLengths;\n}\n\nfunction isEdValidXY(Fp: IField<bigint>, CURVE: EdwardsOpts, x: bigint, y: bigint): boolean {\n  const x2 = Fp.sqr(x);\n  const y2 = Fp.sqr(y);\n  const left = Fp.add(Fp.mul(CURVE.a, x2), y2);\n  const right = Fp.add(Fp.ONE, Fp.mul(CURVE.d, Fp.mul(x2, y2)));\n  return Fp.eql(left, right);\n}\n\nexport function edwards(params: EdwardsOpts, extraOpts: EdwardsExtraOpts = {}): EdwardsPointCons {\n  const validated = _createCurveFields('edwards', params, extraOpts, extraOpts.FpFnLE);\n  const { Fp, Fn } = validated;\n  let CURVE = validated.CURVE as EdwardsOpts;\n  const { h: cofactor } = CURVE;\n  _validateObject(extraOpts, {}, { uvRatio: 'function' });\n\n  // Important:\n  // There are some places where Fp.BYTES is used instead of nByteLength.\n  // So far, everything has been tested with curves of Fp.BYTES == nByteLength.\n  // TODO: test and find curves which behave otherwise.\n  const MASK = _2n << (BigInt(Fn.BYTES * 8) - _1n);\n  const modP = (n: bigint) => Fp.create(n); // Function overrides\n\n  // sqrt(u/v)\n  const uvRatio =\n    extraOpts.uvRatio ||\n    ((u: bigint, v: bigint) => {\n      try {\n        return { isValid: true, value: Fp.sqrt(Fp.div(u, v)) };\n      } catch (e) {\n        return { isValid: false, value: _0n };\n      }\n    });\n\n  // Validate whether the passed curve params are valid.\n  // equation ax\u00B2 + y\u00B2 = 1 + dx\u00B2y\u00B2 should work for generator point.\n  if (!isEdValidXY(Fp, CURVE, CURVE.Gx, CURVE.Gy))\n    throw new Error('bad curve params: generator point');\n\n  /**\n   * Asserts coordinate is valid: 0 <= n < MASK.\n   * Coordinates >= Fp.ORDER are allowed for zip215.\n   */\n  function acoord(title: string, n: bigint, banZero = false) {\n    const min = banZero ? _1n : _0n;\n    aInRange('coordinate ' + title, n, min, MASK);\n    return n;\n  }\n\n  function aextpoint(other: unknown) {\n    if (!(other instanceof Point)) throw new Error('ExtendedPoint expected');\n  }\n  // Converts Extended point to default (x, y) coordinates.\n  // Can accept precomputed Z^-1 - for example, from invertBatch.\n  const toAffineMemo = memoized((p: Point, iz?: bigint): AffinePoint<bigint> => {\n    const { X, Y, Z } = p;\n    const is0 = p.is0();\n    if (iz == null) iz = is0 ? _8n : (Fp.inv(Z) as bigint); // 8 was chosen arbitrarily\n    const x = modP(X * iz);\n    const y = modP(Y * iz);\n    const zz = Fp.mul(Z, iz);\n    if (is0) return { x: _0n, y: _1n };\n    if (zz !== _1n) throw new Error('invZ was invalid');\n    return { x, y };\n  });\n  const assertValidMemo = memoized((p: Point) => {\n    const { a, d } = CURVE;\n    if (p.is0()) throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?\n    // Equation in affine coordinates: ax\u00B2 + y\u00B2 = 1 + dx\u00B2y\u00B2\n    // Equation in projective coordinates (X/Z, Y/Z, Z):  (aX\u00B2 + Y\u00B2)Z\u00B2 = Z\u2074 + dX\u00B2Y\u00B2\n    const { X, Y, Z, T } = p;\n    const X2 = modP(X * X); // X\u00B2\n    const Y2 = modP(Y * Y); // Y\u00B2\n    const Z2 = modP(Z * Z); // Z\u00B2\n    const Z4 = modP(Z2 * Z2); // Z\u2074\n    const aX2 = modP(X2 * a); // aX\u00B2\n    const left = modP(Z2 * modP(aX2 + Y2)); // (aX\u00B2 + Y\u00B2)Z\u00B2\n    const right = modP(Z4 + modP(d * modP(X2 * Y2))); // Z\u2074 + dX\u00B2Y\u00B2\n    if (left !== right) throw new Error('bad point: equation left != right (1)');\n    // In Extended coordinates we also have T, which is x*y=T/Z: check X*Y == Z*T\n    const XY = modP(X * Y);\n    const ZT = modP(Z * T);\n    if (XY !== ZT) throw new Error('bad point: equation left != right (2)');\n    return true;\n  });\n\n  // Extended Point works in extended coordinates: (X, Y, Z, T) \u220B (x=X/Z, y=Y/Z, T=xy).\n  // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates\n  class Point implements EdwardsPoint {\n    // base / generator point\n    static readonly BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));\n    // zero / infinity / identity point\n    static readonly ZERO = new Point(_0n, _1n, _1n, _0n); // 0, 1, 1, 0\n    // math field\n    static readonly Fp = Fp;\n    // scalar field\n    static readonly Fn = Fn;\n\n    readonly X: bigint;\n    readonly Y: bigint;\n    readonly Z: bigint;\n    readonly T: bigint;\n\n    constructor(X: bigint, Y: bigint, Z: bigint, T: bigint) {\n      this.X = acoord('x', X);\n      this.Y = acoord('y', Y);\n      this.Z = acoord('z', Z, true);\n      this.T = acoord('t', T);\n      Object.freeze(this);\n    }\n\n    static CURVE(): EdwardsOpts {\n      return CURVE;\n    }\n\n    static fromAffine(p: AffinePoint<bigint>): Point {\n      if (p instanceof Point) throw new Error('extended point not allowed');\n      const { x, y } = p || {};\n      acoord('x', x);\n      acoord('y', y);\n      return new Point(x, y, _1n, modP(x * y));\n    }\n\n    // Uses algo from RFC8032 5.1.3.\n    static fromBytes(bytes: Uint8Array, zip215 = false): Point {\n      const len = Fp.BYTES;\n      const { a, d } = CURVE;\n      bytes = copyBytes(abytes(bytes, len, 'point'));\n      abool(zip215, 'zip215');\n      const normed = copyBytes(bytes); // copy again, we'll manipulate it\n      const lastByte = bytes[len - 1]; // select last byte\n      normed[len - 1] = lastByte & ~0x80; // clear last bit\n      const y = bytesToNumberLE(normed);\n\n      // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\n      // RFC8032 prohibits >= p, but ZIP215 doesn't\n      // zip215=true:  0 <= y < MASK (2^256 for ed25519)\n      // zip215=false: 0 <= y < P (2^255-19 for ed25519)\n      const max = zip215 ? MASK : Fp.ORDER;\n      aInRange('point.y', y, _0n, max);\n\n      // Ed25519: x\u00B2 = (y\u00B2-1)/(dy\u00B2+1) mod p. Ed448: x\u00B2 = (y\u00B2-1)/(dy\u00B2-1) mod p. Generic case:\n      // ax\u00B2+y\u00B2=1+dx\u00B2y\u00B2 => y\u00B2-1=dx\u00B2y\u00B2-ax\u00B2 => y\u00B2-1=x\u00B2(dy\u00B2-a) => x\u00B2=(y\u00B2-1)/(dy\u00B2-a)\n      const y2 = modP(y * y); // denominator is always non-0 mod p.\n      const u = modP(y2 - _1n); // u = y\u00B2 - 1\n      const v = modP(d * y2 - a); // v = d y\u00B2 + 1.\n      let { isValid, value: x } = uvRatio(u, v); // \u221A(u/v)\n      if (!isValid) throw new Error('bad point: invalid y coordinate');\n      const isXOdd = (x & _1n) === _1n; // There are 2 square roots. Use x_0 bit to select proper\n      const isLastByteOdd = (lastByte & 0x80) !== 0; // x_0, last bit\n      if (!zip215 && x === _0n && isLastByteOdd)\n        // if x=0 and x_0 = 1, fail\n        throw new Error('bad point: x=0 and x_0=1');\n      if (isLastByteOdd !== isXOdd) x = modP(-x); // if x_0 != x mod 2, set x = p-x\n      return Point.fromAffine({ x, y });\n    }\n    static fromHex(bytes: Uint8Array, zip215 = false): Point {\n      return Point.fromBytes(ensureBytes('point', bytes), zip215);\n    }\n\n    get x(): bigint {\n      return this.toAffine().x;\n    }\n    get y(): bigint {\n      return this.toAffine().y;\n    }\n\n    precompute(windowSize: number = 8, isLazy = true) {\n      wnaf.createCache(this, windowSize);\n      if (!isLazy) this.multiply(_2n); // random number\n      return this;\n    }\n\n    // Useful in fromAffine() - not for fromBytes(), which always created valid points.\n    assertValidity(): void {\n      assertValidMemo(this);\n    }\n\n    // Compare one point to another.\n    equals(other: Point): boolean {\n      aextpoint(other);\n      const { X: X1, Y: Y1, Z: Z1 } = this;\n      const { X: X2, Y: Y2, Z: Z2 } = other;\n      const X1Z2 = modP(X1 * Z2);\n      const X2Z1 = modP(X2 * Z1);\n      const Y1Z2 = modP(Y1 * Z2);\n      const Y2Z1 = modP(Y2 * Z1);\n      return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n    }\n\n    is0(): boolean {\n      return this.equals(Point.ZERO);\n    }\n\n    negate(): Point {\n      // Flips point sign to a negative one (-x, y in affine coords)\n      return new Point(modP(-this.X), this.Y, this.Z, modP(-this.T));\n    }\n\n    // Fast algo for doubling Extended Point.\n    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n    // Cost: 4M + 4S + 1*a + 6add + 1*2.\n    double(): Point {\n      const { a } = CURVE;\n      const { X: X1, Y: Y1, Z: Z1 } = this;\n      const A = modP(X1 * X1); // A = X12\n      const B = modP(Y1 * Y1); // B = Y12\n      const C = modP(_2n * modP(Z1 * Z1)); // C = 2*Z12\n      const D = modP(a * A); // D = a*A\n      const x1y1 = X1 + Y1;\n      const E = modP(modP(x1y1 * x1y1) - A - B); // E = (X1+Y1)2-A-B\n      const G = D + B; // G = D+B\n      const F = G - C; // F = G-C\n      const H = D - B; // H = D-B\n      const X3 = modP(E * F); // X3 = E*F\n      const Y3 = modP(G * H); // Y3 = G*H\n      const T3 = modP(E * H); // T3 = E*H\n      const Z3 = modP(F * G); // Z3 = F*G\n      return new Point(X3, Y3, Z3, T3);\n    }\n\n    // Fast algo for adding 2 Extended Points.\n    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n    // Cost: 9M + 1*a + 1*d + 7add.\n    add(other: Point) {\n      aextpoint(other);\n      const { a, d } = CURVE;\n      const { X: X1, Y: Y1, Z: Z1, T: T1 } = this;\n      const { X: X2, Y: Y2, Z: Z2, T: T2 } = other;\n      const A = modP(X1 * X2); // A = X1*X2\n      const B = modP(Y1 * Y2); // B = Y1*Y2\n      const C = modP(T1 * d * T2); // C = T1*d*T2\n      const D = modP(Z1 * Z2); // D = Z1*Z2\n      const E = modP((X1 + Y1) * (X2 + Y2) - A - B); // E = (X1+Y1)*(X2+Y2)-A-B\n      const F = D - C; // F = D-C\n      const G = D + C; // G = D+C\n      const H = modP(B - a * A); // H = B-a*A\n      const X3 = modP(E * F); // X3 = E*F\n      const Y3 = modP(G * H); // Y3 = G*H\n      const T3 = modP(E * H); // T3 = E*H\n      const Z3 = modP(F * G); // Z3 = F*G\n      return new Point(X3, Y3, Z3, T3);\n    }\n\n    subtract(other: Point): Point {\n      return this.add(other.negate());\n    }\n\n    // Constant-time multiplication.\n    multiply(scalar: bigint): Point {\n      // 1 <= scalar < L\n      if (!Fn.isValidNot0(scalar)) throw new Error('invalid scalar: expected 1 <= sc < curve.n');\n      const { p, f } = wnaf.cached(this, scalar, (p) => normalizeZ(Point, p));\n      return normalizeZ(Point, [p, f])[0];\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.\n    // Does NOT allow scalars higher than CURVE.n.\n    // Accepts optional accumulator to merge with multiply (important for sparse scalars)\n    multiplyUnsafe(scalar: bigint, acc = Point.ZERO): Point {\n      // 0 <= scalar < L\n      if (!Fn.isValid(scalar)) throw new Error('invalid scalar: expected 0 <= sc < curve.n');\n      if (scalar === _0n) return Point.ZERO;\n      if (this.is0() || scalar === _1n) return this;\n      return wnaf.unsafe(this, scalar, (p) => normalizeZ(Point, p), acc);\n    }\n\n    // Checks if point is of small order.\n    // If you add something to small order point, you will have \"dirty\"\n    // point with torsion component.\n    // Multiplies point by cofactor and checks if the result is 0.\n    isSmallOrder(): boolean {\n      return this.multiplyUnsafe(cofactor).is0();\n    }\n\n    // Multiplies point by curve order and checks if the result is 0.\n    // Returns `false` is the point is dirty.\n    isTorsionFree(): boolean {\n      return wnaf.unsafe(this, CURVE.n).is0();\n    }\n\n    // Converts Extended point to default (x, y) coordinates.\n    // Can accept precomputed Z^-1 - for example, from invertBatch.\n    toAffine(invertedZ?: bigint): AffinePoint<bigint> {\n      return toAffineMemo(this, invertedZ);\n    }\n\n    clearCofactor(): Point {\n      if (cofactor === _1n) return this;\n      return this.multiplyUnsafe(cofactor);\n    }\n\n    toBytes(): Uint8Array {\n      const { x, y } = this.toAffine();\n      // Fp.toBytes() allows non-canonical encoding of y (>= p).\n      const bytes = Fp.toBytes(y);\n      // Each y has 2 valid points: (x, y), (x,-y).\n      // When compressing, it's enough to store y and use the last byte to encode sign of x\n      bytes[bytes.length - 1] |= x & _1n ? 0x80 : 0;\n      return bytes;\n    }\n    toHex(): string {\n      return bytesToHex(this.toBytes());\n    }\n\n    toString() {\n      return `<Point ${this.is0() ? 'ZERO' : this.toHex()}>`;\n    }\n\n    // TODO: remove\n    get ex(): bigint {\n      return this.X;\n    }\n    get ey(): bigint {\n      return this.Y;\n    }\n    get ez(): bigint {\n      return this.Z;\n    }\n    get et(): bigint {\n      return this.T;\n    }\n    static normalizeZ(points: Point[]): Point[] {\n      return normalizeZ(Point, points);\n    }\n    static msm(points: Point[], scalars: bigint[]): Point {\n      return pippenger(Point, Fn, points, scalars);\n    }\n    _setWindowSize(windowSize: number) {\n      this.precompute(windowSize);\n    }\n    toRawBytes(): Uint8Array {\n      return this.toBytes();\n    }\n  }\n  const wnaf = new wNAF(Point, Fn.BITS);\n  Point.BASE.precompute(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n  return Point;\n}\n\n/**\n * Base class for prime-order points like Ristretto255 and Decaf448.\n * These points eliminate cofactor issues by representing equivalence classes\n * of Edwards curve points.\n */\nexport abstract class PrimeEdwardsPoint<T extends PrimeEdwardsPoint<T>>\n  implements CurvePoint<bigint, T>\n{\n  static BASE: PrimeEdwardsPoint<any>;\n  static ZERO: PrimeEdwardsPoint<any>;\n  static Fp: IField<bigint>;\n  static Fn: IField<bigint>;\n\n  protected readonly ep: EdwardsPoint;\n\n  constructor(ep: EdwardsPoint) {\n    this.ep = ep;\n  }\n\n  // Abstract methods that must be implemented by subclasses\n  abstract toBytes(): Uint8Array;\n  abstract equals(other: T): boolean;\n\n  // Static methods that must be implemented by subclasses\n  static fromBytes(_bytes: Uint8Array): any {\n    notImplemented();\n  }\n\n  static fromHex(_hex: Hex): any {\n    notImplemented();\n  }\n\n  get x(): bigint {\n    return this.toAffine().x;\n  }\n  get y(): bigint {\n    return this.toAffine().y;\n  }\n\n  // Common implementations\n  clearCofactor(): T {\n    // no-op for prime-order groups\n    return this as any;\n  }\n\n  assertValidity(): void {\n    this.ep.assertValidity();\n  }\n\n  toAffine(invertedZ?: bigint): AffinePoint<bigint> {\n    return this.ep.toAffine(invertedZ);\n  }\n\n  toHex(): string {\n    return bytesToHex(this.toBytes());\n  }\n\n  toString(): string {\n    return this.toHex();\n  }\n\n  isTorsionFree(): boolean {\n    return true;\n  }\n\n  isSmallOrder(): boolean {\n    return false;\n  }\n\n  add(other: T): T {\n    this.assertSame(other);\n    return this.init(this.ep.add(other.ep));\n  }\n\n  subtract(other: T): T {\n    this.assertSame(other);\n    return this.init(this.ep.subtract(other.ep));\n  }\n\n  multiply(scalar: bigint): T {\n    return this.init(this.ep.multiply(scalar));\n  }\n\n  multiplyUnsafe(scalar: bigint): T {\n    return this.init(this.ep.multiplyUnsafe(scalar));\n  }\n\n  double(): T {\n    return this.init(this.ep.double());\n  }\n\n  negate(): T {\n    return this.init(this.ep.negate());\n  }\n\n  precompute(windowSize?: number, isLazy?: boolean): T {\n    return this.init(this.ep.precompute(windowSize, isLazy));\n  }\n\n  // Helper methods\n  abstract is0(): boolean;\n  protected abstract assertSame(other: T): void;\n  protected abstract init(ep: EdwardsPoint): T;\n\n  /** @deprecated use `toBytes` */\n  toRawBytes(): Uint8Array {\n    return this.toBytes();\n  }\n}\n\n/**\n * Initializes EdDSA signatures over given Edwards curve.\n */\nexport function eddsa(Point: EdwardsPointCons, cHash: FHash, eddsaOpts: EdDSAOpts = {}): EdDSA {\n  if (typeof cHash !== 'function') throw new Error('\"hash\" function param is required');\n  _validateObject(\n    eddsaOpts,\n    {},\n    {\n      adjustScalarBytes: 'function',\n      randomBytes: 'function',\n      domain: 'function',\n      prehash: 'function',\n      mapToCurve: 'function',\n    }\n  );\n\n  const { prehash } = eddsaOpts;\n  const { BASE, Fp, Fn } = Point;\n\n  const randomBytes = eddsaOpts.randomBytes || randomBytesWeb;\n  const adjustScalarBytes = eddsaOpts.adjustScalarBytes || ((bytes: Uint8Array) => bytes);\n  const domain =\n    eddsaOpts.domain ||\n    ((data: Uint8Array, ctx: Uint8Array, phflag: boolean) => {\n      abool(phflag, 'phflag');\n      if (ctx.length || phflag) throw new Error('Contexts/pre-hash are not supported');\n      return data;\n    }); // NOOP\n\n  // Little-endian SHA512 with modulo n\n  function modN_LE(hash: Uint8Array): bigint {\n    return Fn.create(bytesToNumberLE(hash)); // Not Fn.fromBytes: it has length limit\n  }\n\n  // Get the hashed private scalar per RFC8032 5.1.5\n  function getPrivateScalar(key: Hex) {\n    const len = lengths.secretKey;\n    key = ensureBytes('private key', key, len);\n    // Hash private key with curve's hash function to produce uniformingly random input\n    // Check byte lengths: ensure(64, h(ensure(32, key)))\n    const hashed = ensureBytes('hashed private key', cHash(key), 2 * len);\n    const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE\n    const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)\n    const scalar = modN_LE(head); // The actual private scalar\n    return { head, prefix, scalar };\n  }\n\n  /** Convenience method that creates public key from scalar. RFC8032 5.1.5 */\n  function getExtendedPublicKey(secretKey: Hex) {\n    const { head, prefix, scalar } = getPrivateScalar(secretKey);\n    const point = BASE.multiply(scalar); // Point on Edwards curve aka public key\n    const pointBytes = point.toBytes();\n    return { head, prefix, scalar, point, pointBytes };\n  }\n\n  /** Calculates EdDSA pub key. RFC8032 5.1.5. */\n  function getPublicKey(secretKey: Hex): Uint8Array {\n    return getExtendedPublicKey(secretKey).pointBytes;\n  }\n\n  // int('LE', SHA512(dom2(F, C) || msgs)) mod N\n  function hashDomainToScalar(context: Hex = Uint8Array.of(), ...msgs: Uint8Array[]) {\n    const msg = concatBytes(...msgs);\n    return modN_LE(cHash(domain(msg, ensureBytes('context', context), !!prehash)));\n  }\n\n  /** Signs message with privateKey. RFC8032 5.1.6 */\n  function sign(msg: Hex, secretKey: Hex, options: { context?: Hex } = {}): Uint8Array {\n    msg = ensureBytes('message', msg);\n    if (prehash) msg = prehash(msg); // for ed25519ph etc.\n    const { prefix, scalar, pointBytes } = getExtendedPublicKey(secretKey);\n    const r = hashDomainToScalar(options.context, prefix, msg); // r = dom2(F, C) || prefix || PH(M)\n    const R = BASE.multiply(r).toBytes(); // R = rG\n    const k = hashDomainToScalar(options.context, R, pointBytes, msg); // R || A || PH(M)\n    const s = Fn.create(r + k * scalar); // S = (r + k * s) mod L\n    if (!Fn.isValid(s)) throw new Error('sign failed: invalid s'); // 0 <= s < L\n    const rs = concatBytes(R, Fn.toBytes(s));\n    return abytes(rs, lengths.signature, 'result');\n  }\n\n  // verification rule is either zip215 or rfc8032 / nist186-5. Consult fromHex:\n  const verifyOpts: { context?: Hex; zip215?: boolean } = { zip215: true };\n\n  /**\n   * Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n   * An extended group equation is checked.\n   */\n  function verify(sig: Hex, msg: Hex, publicKey: Hex, options = verifyOpts): boolean {\n    const { context, zip215 } = options;\n    const len = lengths.signature;\n    sig = ensureBytes('signature', sig, len);\n    msg = ensureBytes('message', msg);\n    publicKey = ensureBytes('publicKey', publicKey, lengths.publicKey);\n    if (zip215 !== undefined) abool(zip215, 'zip215');\n    if (prehash) msg = prehash(msg); // for ed25519ph, etc\n\n    const mid = len / 2;\n    const r = sig.subarray(0, mid);\n    const s = bytesToNumberLE(sig.subarray(mid, len));\n    let A, R, SB;\n    try {\n      // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\n      // zip215=true:  0 <= y < MASK (2^256 for ed25519)\n      // zip215=false: 0 <= y < P (2^255-19 for ed25519)\n      A = Point.fromBytes(publicKey, zip215);\n      R = Point.fromBytes(r, zip215);\n      SB = BASE.multiplyUnsafe(s); // 0 <= s < l is done inside\n    } catch (error) {\n      return false;\n    }\n    if (!zip215 && A.isSmallOrder()) return false; // zip215 allows public keys of small order\n\n    const k = hashDomainToScalar(context, R.toBytes(), A.toBytes(), msg);\n    const RkA = R.add(A.multiplyUnsafe(k));\n    // Extended group equation\n    // [8][S]B = [8]R + [8][k]A'\n    return RkA.subtract(SB).clearCofactor().is0();\n  }\n\n  const _size = Fp.BYTES; // 32 for ed25519, 57 for ed448\n  const lengths = {\n    secretKey: _size,\n    publicKey: _size,\n    signature: 2 * _size,\n    seed: _size,\n  };\n  function randomSecretKey(seed = randomBytes(lengths.seed)): Uint8Array {\n    return abytes(seed, lengths.seed, 'seed');\n  }\n  function keygen(seed?: Uint8Array) {\n    const secretKey = utils.randomSecretKey(seed);\n    return { secretKey, publicKey: getPublicKey(secretKey) };\n  }\n  function isValidSecretKey(key: Uint8Array): boolean {\n    return isBytes(key) && key.length === Fn.BYTES;\n  }\n  function isValidPublicKey(key: Uint8Array, zip215?: boolean): boolean {\n    try {\n      return !!Point.fromBytes(key, zip215);\n    } catch (error) {\n      return false;\n    }\n  }\n\n  const utils = {\n    getExtendedPublicKey,\n    randomSecretKey,\n    isValidSecretKey,\n    isValidPublicKey,\n    /**\n     * Converts ed public key to x public key. Uses formula:\n     * - ed25519:\n     *   - `(u, v) = ((1+y)/(1-y), sqrt(-486664)*u/x)`\n     *   - `(x, y) = (sqrt(-486664)*u/v, (u-1)/(u+1))`\n     * - ed448:\n     *   - `(u, v) = ((y-1)/(y+1), sqrt(156324)*u/x)`\n     *   - `(x, y) = (sqrt(156324)*u/v, (1+u)/(1-u))`\n     */\n    toMontgomery(publicKey: Uint8Array): Uint8Array {\n      const { y } = Point.fromBytes(publicKey);\n      const size = lengths.publicKey;\n      const is25519 = size === 32;\n      if (!is25519 && size !== 57) throw new Error('only defined for 25519 and 448');\n      const u = is25519 ? Fp.div(_1n + y, _1n - y) : Fp.div(y - _1n, y + _1n);\n      return Fp.toBytes(u);\n    },\n\n    toMontgomerySecret(secretKey: Uint8Array): Uint8Array {\n      const size = lengths.secretKey;\n      abytes(secretKey, size);\n      const hashed = cHash(secretKey.subarray(0, size));\n      return adjustScalarBytes(hashed).subarray(0, size);\n    },\n\n    /** @deprecated */\n    randomPrivateKey: randomSecretKey,\n    /** @deprecated */\n    precompute(windowSize = 8, point: EdwardsPoint = Point.BASE): EdwardsPoint {\n      return point.precompute(windowSize, false);\n    },\n  };\n\n  return Object.freeze({\n    keygen,\n    getPublicKey,\n    sign,\n    verify,\n    utils,\n    Point,\n    lengths,\n  });\n}\n\n// TODO: remove everything below\nexport type CurveType = BasicCurve<bigint> & {\n  a: bigint; // curve param a\n  d: bigint; // curve param d\n  /** @deprecated the property will be removed in next release */\n  hash: FHash; // Hashing\n  randomBytes?: (bytesLength?: number) => Uint8Array; // CSPRNG\n  adjustScalarBytes?: (bytes: Uint8Array) => Uint8Array; // clears bits to get valid field elemtn\n  domain?: (data: Uint8Array, ctx: Uint8Array, phflag: boolean) => Uint8Array; // Used for hashing\n  uvRatio?: UVRatio; // Ratio \u221A(u/v)\n  prehash?: FHash; // RFC 8032 pre-hashing of messages to sign() / verify()\n  mapToCurve?: (scalar: bigint[]) => AffinePoint<bigint>; // for hash-to-curve standard\n};\nexport type CurveTypeWithLength = Readonly<CurveType & Partial<NLength>>;\nexport type CurveFn = {\n  /** @deprecated the property will be removed in next release */\n  CURVE: CurveType;\n  keygen: EdDSA['keygen'];\n  getPublicKey: EdDSA['getPublicKey'];\n  sign: EdDSA['sign'];\n  verify: EdDSA['verify'];\n  Point: EdwardsPointCons;\n  /** @deprecated use `Point` */\n  ExtendedPoint: EdwardsPointCons;\n  utils: EdDSA['utils'];\n  lengths: CurveLengths;\n};\nexport type EdComposed = {\n  CURVE: EdwardsOpts;\n  curveOpts: EdwardsExtraOpts;\n  hash: FHash;\n  eddsaOpts: EdDSAOpts;\n};\nfunction _eddsa_legacy_opts_to_new(c: CurveTypeWithLength): EdComposed {\n  const CURVE: EdwardsOpts = {\n    a: c.a,\n    d: c.d,\n    p: c.Fp.ORDER,\n    n: c.n,\n    h: c.h,\n    Gx: c.Gx,\n    Gy: c.Gy,\n  };\n  const Fp = c.Fp;\n  const Fn = Field(CURVE.n, c.nBitLength, true);\n  const curveOpts: EdwardsExtraOpts = { Fp, Fn, uvRatio: c.uvRatio };\n  const eddsaOpts: EdDSAOpts = {\n    randomBytes: c.randomBytes,\n    adjustScalarBytes: c.adjustScalarBytes,\n    domain: c.domain,\n    prehash: c.prehash,\n    mapToCurve: c.mapToCurve,\n  };\n  return { CURVE, curveOpts, hash: c.hash, eddsaOpts };\n}\nfunction _eddsa_new_output_to_legacy(c: CurveTypeWithLength, eddsa: EdDSA): CurveFn {\n  const Point = eddsa.Point;\n  const legacy = Object.assign({}, eddsa, {\n    ExtendedPoint: Point,\n    CURVE: c,\n    nBitLength: Point.Fn.BITS,\n    nByteLength: Point.Fn.BYTES,\n  });\n  return legacy;\n}\n// TODO: remove. Use eddsa\nexport function twistedEdwards(c: CurveTypeWithLength): CurveFn {\n  const { CURVE, curveOpts, hash, eddsaOpts } = _eddsa_legacy_opts_to_new(c);\n  const Point = edwards(CURVE, curveOpts);\n  const EDDSA = eddsa(Point, hash, eddsaOpts);\n  return _eddsa_new_output_to_legacy(c, EDDSA);\n}\n", "/**\n * Montgomery curve methods. It's not really whole montgomery curve,\n * just bunch of very specific methods for X25519 / X448 from\n * [RFC 7748](https://www.rfc-editor.org/rfc/rfc7748)\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport {\n  _validateObject,\n  abytes,\n  aInRange,\n  bytesToNumberLE,\n  ensureBytes,\n  numberToBytesLE,\n  randomBytes,\n} from '../utils.ts';\nimport type { CurveLengths } from './curve.ts';\nimport { mod } from './modular.ts';\n\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\ntype Hex = string | Uint8Array;\n\nexport type CurveType = {\n  P: bigint; // finite field prime\n  type: 'x25519' | 'x448';\n  adjustScalarBytes: (bytes: Uint8Array) => Uint8Array;\n  powPminus2: (x: bigint) => bigint;\n  randomBytes?: (bytesLength?: number) => Uint8Array;\n};\n\nexport type MontgomeryECDH = {\n  scalarMult: (scalar: Hex, u: Hex) => Uint8Array;\n  scalarMultBase: (scalar: Hex) => Uint8Array;\n  getSharedSecret: (secretKeyA: Hex, publicKeyB: Hex) => Uint8Array;\n  getPublicKey: (secretKey: Hex) => Uint8Array;\n  utils: {\n    randomSecretKey: () => Uint8Array;\n    /** @deprecated use `randomSecretKey` */\n    randomPrivateKey: () => Uint8Array;\n  };\n  GuBytes: Uint8Array;\n  lengths: CurveLengths;\n  keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n};\nexport type CurveFn = MontgomeryECDH;\n\nfunction validateOpts(curve: CurveType) {\n  _validateObject(curve, {\n    adjustScalarBytes: 'function',\n    powPminus2: 'function',\n  });\n  return Object.freeze({ ...curve } as const);\n}\n\nexport function montgomery(curveDef: CurveType): MontgomeryECDH {\n  const CURVE = validateOpts(curveDef);\n  const { P, type, adjustScalarBytes, powPminus2, randomBytes: rand } = CURVE;\n  const is25519 = type === 'x25519';\n  if (!is25519 && type !== 'x448') throw new Error('invalid type');\n  const randomBytes_ = rand || randomBytes;\n\n  const montgomeryBits = is25519 ? 255 : 448;\n  const fieldLen = is25519 ? 32 : 56;\n  const Gu = is25519 ? BigInt(9) : BigInt(5);\n  // RFC 7748 #5:\n  // The constant a24 is (486662 - 2) / 4 = 121665 for curve25519/X25519 and\n  // (156326 - 2) / 4 = 39081 for curve448/X448\n  // const a = is25519 ? 156326n : 486662n;\n  const a24 = is25519 ? BigInt(121665) : BigInt(39081);\n  // RFC: x25519 \"the resulting integer is of the form 2^254 plus\n  // eight times a value between 0 and 2^251 - 1 (inclusive)\"\n  // x448: \"2^447 plus four times a value between 0 and 2^445 - 1 (inclusive)\"\n  const minScalar = is25519 ? _2n ** BigInt(254) : _2n ** BigInt(447);\n  const maxAdded = is25519\n    ? BigInt(8) * _2n ** BigInt(251) - _1n\n    : BigInt(4) * _2n ** BigInt(445) - _1n;\n  const maxScalar = minScalar + maxAdded + _1n; // (inclusive)\n  const modP = (n: bigint) => mod(n, P);\n  const GuBytes = encodeU(Gu);\n  function encodeU(u: bigint): Uint8Array {\n    return numberToBytesLE(modP(u), fieldLen);\n  }\n  function decodeU(u: Hex): bigint {\n    const _u = ensureBytes('u coordinate', u, fieldLen);\n    // RFC: When receiving such an array, implementations of X25519\n    // (but not X448) MUST mask the most significant bit in the final byte.\n    if (is25519) _u[31] &= 127; // 0b0111_1111\n    // RFC: Implementations MUST accept non-canonical values and process them as\n    // if they had been reduced modulo the field prime.  The non-canonical\n    // values are 2^255 - 19 through 2^255 - 1 for X25519 and 2^448 - 2^224\n    // - 1 through 2^448 - 1 for X448.\n    return modP(bytesToNumberLE(_u));\n  }\n  function decodeScalar(scalar: Hex): bigint {\n    return bytesToNumberLE(adjustScalarBytes(ensureBytes('scalar', scalar, fieldLen)));\n  }\n  function scalarMult(scalar: Hex, u: Hex): Uint8Array {\n    const pu = montgomeryLadder(decodeU(u), decodeScalar(scalar));\n    // Some public keys are useless, of low-order. Curve author doesn't think\n    // it needs to be validated, but we do it nonetheless.\n    // https://cr.yp.to/ecdh.html#validate\n    if (pu === _0n) throw new Error('invalid private or public key received');\n    return encodeU(pu);\n  }\n  // Computes public key from private. By doing scalar multiplication of base point.\n  function scalarMultBase(scalar: Hex): Uint8Array {\n    return scalarMult(scalar, GuBytes);\n  }\n\n  // cswap from RFC7748 \"example code\"\n  function cswap(swap: bigint, x_2: bigint, x_3: bigint): { x_2: bigint; x_3: bigint } {\n    // dummy = mask(swap) AND (x_2 XOR x_3)\n    // Where mask(swap) is the all-1 or all-0 word of the same length as x_2\n    // and x_3, computed, e.g., as mask(swap) = 0 - swap.\n    const dummy = modP(swap * (x_2 - x_3));\n    x_2 = modP(x_2 - dummy); // x_2 = x_2 XOR dummy\n    x_3 = modP(x_3 + dummy); // x_3 = x_3 XOR dummy\n    return { x_2, x_3 };\n  }\n\n  /**\n   * Montgomery x-only multiplication ladder.\n   * @param pointU u coordinate (x) on Montgomery Curve 25519\n   * @param scalar by which the point would be multiplied\n   * @returns new Point on Montgomery curve\n   */\n  function montgomeryLadder(u: bigint, scalar: bigint): bigint {\n    aInRange('u', u, _0n, P);\n    aInRange('scalar', scalar, minScalar, maxScalar);\n    const k = scalar;\n    const x_1 = u;\n    let x_2 = _1n;\n    let z_2 = _0n;\n    let x_3 = u;\n    let z_3 = _1n;\n    let swap = _0n;\n    for (let t = BigInt(montgomeryBits - 1); t >= _0n; t--) {\n      const k_t = (k >> t) & _1n;\n      swap ^= k_t;\n      ({ x_2, x_3 } = cswap(swap, x_2, x_3));\n      ({ x_2: z_2, x_3: z_3 } = cswap(swap, z_2, z_3));\n      swap = k_t;\n\n      const A = x_2 + z_2;\n      const AA = modP(A * A);\n      const B = x_2 - z_2;\n      const BB = modP(B * B);\n      const E = AA - BB;\n      const C = x_3 + z_3;\n      const D = x_3 - z_3;\n      const DA = modP(D * A);\n      const CB = modP(C * B);\n      const dacb = DA + CB;\n      const da_cb = DA - CB;\n      x_3 = modP(dacb * dacb);\n      z_3 = modP(x_1 * modP(da_cb * da_cb));\n      x_2 = modP(AA * BB);\n      z_2 = modP(E * (AA + modP(a24 * E)));\n    }\n    ({ x_2, x_3 } = cswap(swap, x_2, x_3));\n    ({ x_2: z_2, x_3: z_3 } = cswap(swap, z_2, z_3));\n    const z2 = powPminus2(z_2); // `Fp.pow(x, P - _2n)` is much slower equivalent\n    return modP(x_2 * z2); // Return x_2 * (z_2^(p - 2))\n  }\n  const lengths = {\n    secretKey: fieldLen,\n    publicKey: fieldLen,\n    seed: fieldLen,\n  };\n  const randomSecretKey = (seed = randomBytes_(fieldLen)) => {\n    abytes(seed, lengths.seed);\n    return seed;\n  };\n  function keygen(seed?: Uint8Array) {\n    const secretKey = randomSecretKey(seed);\n    return { secretKey, publicKey: scalarMultBase(secretKey) };\n  }\n  const utils = {\n    randomSecretKey,\n    randomPrivateKey: randomSecretKey,\n  };\n  return {\n    keygen,\n    getSharedSecret: (secretKey: Hex, publicKey: Hex) => scalarMult(secretKey, publicKey),\n    getPublicKey: (secretKey: Hex): Uint8Array => scalarMultBase(secretKey),\n    scalarMult,\n    scalarMultBase,\n    utils,\n    GuBytes: GuBytes.slice(),\n    lengths,\n  };\n}\n", "/**\n * ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha512 } from '@noble/hashes/sha2.js';\nimport { abytes, concatBytes, utf8ToBytes } from '@noble/hashes/utils.js';\nimport { pippenger, type AffinePoint } from './abstract/curve.ts';\nimport {\n  PrimeEdwardsPoint,\n  twistedEdwards,\n  type CurveFn,\n  type EdwardsOpts,\n  type EdwardsPoint,\n} from './abstract/edwards.ts';\nimport {\n  _DST_scalar,\n  createHasher,\n  expand_message_xmd,\n  type H2CHasher,\n  type H2CHasherBase,\n  type H2CMethod,\n  type htfBasicOpts,\n} from './abstract/hash-to-curve.ts';\nimport {\n  Field,\n  FpInvertBatch,\n  FpSqrtEven,\n  isNegativeLE,\n  mod,\n  pow2,\n  type IField,\n} from './abstract/modular.ts';\nimport { montgomery, type MontgomeryECDH as XCurveFn } from './abstract/montgomery.ts';\nimport { bytesToNumberLE, ensureBytes, equalBytes, type Hex } from './utils.ts';\n\n// prettier-ignore\nconst _0n = /* @__PURE__ */ BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _5n = BigInt(5), _8n = BigInt(8);\n\n// P = 2n**255n-19n\nconst ed25519_CURVE_p = BigInt(\n  '0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed'\n);\n\n// N = 2n**252n + 27742317777372353535851937790883648493n\n// a = Fp.create(BigInt(-1))\n// d = -121665/121666 a.k.a. Fp.neg(121665 * Fp.inv(121666))\nconst ed25519_CURVE: EdwardsOpts = /* @__PURE__ */ (() => ({\n  p: ed25519_CURVE_p,\n  n: BigInt('0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed'),\n  h: _8n,\n  a: BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec'),\n  d: BigInt('0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3'),\n  Gx: BigInt('0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a'),\n  Gy: BigInt('0x6666666666666666666666666666666666666666666666666666666666666658'),\n}))();\n\nfunction ed25519_pow_2_252_3(x: bigint) {\n  // prettier-ignore\n  const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);\n  const P = ed25519_CURVE_p;\n  const x2 = (x * x) % P;\n  const b2 = (x2 * x) % P; // x^3, 11\n  const b4 = (pow2(b2, _2n, P) * b2) % P; // x^15, 1111\n  const b5 = (pow2(b4, _1n, P) * x) % P; // x^31\n  const b10 = (pow2(b5, _5n, P) * b5) % P;\n  const b20 = (pow2(b10, _10n, P) * b10) % P;\n  const b40 = (pow2(b20, _20n, P) * b20) % P;\n  const b80 = (pow2(b40, _40n, P) * b40) % P;\n  const b160 = (pow2(b80, _80n, P) * b80) % P;\n  const b240 = (pow2(b160, _80n, P) * b80) % P;\n  const b250 = (pow2(b240, _10n, P) * b10) % P;\n  const pow_p_5_8 = (pow2(b250, _2n, P) * x) % P;\n  // ^ To pow to (p+3)/8, multiply it by x.\n  return { pow_p_5_8, b2 };\n}\n\nfunction adjustScalarBytes(bytes: Uint8Array): Uint8Array {\n  // Section 5: For X25519, in order to decode 32 random bytes as an integer scalar,\n  // set the three least significant bits of the first byte\n  bytes[0] &= 248; // 0b1111_1000\n  // and the most significant bit of the last to zero,\n  bytes[31] &= 127; // 0b0111_1111\n  // set the second most significant bit of the last byte to 1\n  bytes[31] |= 64; // 0b0100_0000\n  return bytes;\n}\n\n// \u221A(-1) aka \u221A(a) aka 2^((p-1)/4)\n// Fp.sqrt(Fp.neg(1))\nconst ED25519_SQRT_M1 = /* @__PURE__ */ BigInt(\n  '19681161376707505956807079304988542015446066515923890162744021073123829784752'\n);\n// sqrt(u/v)\nfunction uvRatio(u: bigint, v: bigint): { isValid: boolean; value: bigint } {\n  const P = ed25519_CURVE_p;\n  const v3 = mod(v * v * v, P); // v\u00B3\n  const v7 = mod(v3 * v3 * v, P); // v\u2077\n  // (p+3)/8 and (p-5)/8\n  const pow = ed25519_pow_2_252_3(u * v7).pow_p_5_8;\n  let x = mod(u * v3 * pow, P); // (uv\u00B3)(uv\u2077)^(p-5)/8\n  const vx2 = mod(v * x * x, P); // vx\u00B2\n  const root1 = x; // First root candidate\n  const root2 = mod(x * ED25519_SQRT_M1, P); // Second root candidate\n  const useRoot1 = vx2 === u; // If vx\u00B2 = u (mod p), x is a square root\n  const useRoot2 = vx2 === mod(-u, P); // If vx\u00B2 = -u, set x <-- x * 2^((p-1)/4)\n  const noRoot = vx2 === mod(-u * ED25519_SQRT_M1, P); // There is no valid root, vx\u00B2 = -u\u221A(-1)\n  if (useRoot1) x = root1;\n  if (useRoot2 || noRoot) x = root2; // We return root2 anyway, for const-time\n  if (isNegativeLE(x, P)) x = mod(-x, P);\n  return { isValid: useRoot1 || useRoot2, value: x };\n}\n\nconst Fp = /* @__PURE__ */ (() => Field(ed25519_CURVE.p, { isLE: true }))();\nconst Fn = /* @__PURE__ */ (() => Field(ed25519_CURVE.n, { isLE: true }))();\n\nconst ed25519Defaults = /* @__PURE__ */ (() => ({\n  ...ed25519_CURVE,\n  Fp,\n  hash: sha512,\n  adjustScalarBytes,\n  // dom2\n  // Ratio of u to v. Allows us to combine inversion and square root. Uses algo from RFC8032 5.1.3.\n  // Constant-time, u/\u221Av\n  uvRatio,\n}))();\n\n/**\n * ed25519 curve with EdDSA signatures.\n * @example\n * import { ed25519 } from '@noble/curves/ed25519';\n * const { secretKey, publicKey } = ed25519.keygen();\n * const msg = new TextEncoder().encode('hello');\n * const sig = ed25519.sign(msg, priv);\n * ed25519.verify(sig, msg, pub); // Default mode: follows ZIP215\n * ed25519.verify(sig, msg, pub, { zip215: false }); // RFC8032 / FIPS 186-5\n */\nexport const ed25519: CurveFn = /* @__PURE__ */ (() => twistedEdwards(ed25519Defaults))();\n\nfunction ed25519_domain(data: Uint8Array, ctx: Uint8Array, phflag: boolean) {\n  if (ctx.length > 255) throw new Error('Context is too big');\n  return concatBytes(\n    utf8ToBytes('SigEd25519 no Ed25519 collisions'),\n    new Uint8Array([phflag ? 1 : 0, ctx.length]),\n    ctx,\n    data\n  );\n}\n\n/** Context of ed25519. Uses context for domain separation. */\nexport const ed25519ctx: CurveFn = /* @__PURE__ */ (() =>\n  twistedEdwards({\n    ...ed25519Defaults,\n    domain: ed25519_domain,\n  }))();\n\n/** Prehashed version of ed25519. Accepts already-hashed messages in sign() and verify(). */\nexport const ed25519ph: CurveFn = /* @__PURE__ */ (() =>\n  twistedEdwards(\n    Object.assign({}, ed25519Defaults, {\n      domain: ed25519_domain,\n      prehash: sha512,\n    })\n  ))();\n\n/**\n * ECDH using curve25519 aka x25519.\n * @example\n * import { x25519 } from '@noble/curves/ed25519';\n * const priv = 'a546e36bf0527c9d3b16154b82465edd62144c0ac1fc5a18506a2244ba449ac4';\n * const pub = 'e6db6867583030db3594c1a424b15f7c726624ec26b3353b10a903a6d0ab1c4c';\n * x25519.getSharedSecret(priv, pub) === x25519.scalarMult(priv, pub); // aliases\n * x25519.getPublicKey(priv) === x25519.scalarMultBase(priv);\n * x25519.getPublicKey(x25519.utils.randomSecretKey());\n */\nexport const x25519: XCurveFn = /* @__PURE__ */ (() => {\n  const P = Fp.ORDER;\n  return montgomery({\n    P,\n    type: 'x25519',\n    powPminus2: (x: bigint): bigint => {\n      // x^(p-2) aka x^(2^255-21)\n      const { pow_p_5_8, b2 } = ed25519_pow_2_252_3(x);\n      return mod(pow2(pow_p_5_8, _3n, P) * b2, P);\n    },\n    adjustScalarBytes,\n  });\n})();\n\n// Hash To Curve Elligator2 Map (NOTE: different from ristretto255 elligator)\n// NOTE: very important part is usage of FpSqrtEven for ELL2_C1_EDWARDS, since\n// SageMath returns different root first and everything falls apart\nconst ELL2_C1 = /* @__PURE__ */ (() => (ed25519_CURVE_p + _3n) / _8n)(); // 1. c1 = (q + 3) / 8       # Integer arithmetic\nconst ELL2_C2 = /* @__PURE__ */ (() => Fp.pow(_2n, ELL2_C1))(); // 2. c2 = 2^c1\nconst ELL2_C3 = /* @__PURE__ */ (() => Fp.sqrt(Fp.neg(Fp.ONE)))(); // 3. c3 = sqrt(-1)\n\n// prettier-ignore\nfunction map_to_curve_elligator2_curve25519(u: bigint) {\n  const ELL2_C4 = (ed25519_CURVE_p - _5n) / _8n; // 4. c4 = (q - 5) / 8       # Integer arithmetic\n  const ELL2_J = BigInt(486662);\n\n  let tv1 = Fp.sqr(u);          //  1.  tv1 = u^2\n  tv1 = Fp.mul(tv1, _2n);       //  2.  tv1 = 2 * tv1\n  let xd = Fp.add(tv1, Fp.ONE); //  3.   xd = tv1 + 1         # Nonzero: -1 is square (mod p), tv1 is not\n  let x1n = Fp.neg(ELL2_J);     //  4.  x1n = -J              # x1 = x1n / xd = -J / (1 + 2 * u^2)\n  let tv2 = Fp.sqr(xd);         //  5.  tv2 = xd^2\n  let gxd = Fp.mul(tv2, xd);    //  6.  gxd = tv2 * xd        # gxd = xd^3\n  let gx1 = Fp.mul(tv1, ELL2_J);//  7.  gx1 = J * tv1         # x1n + J * xd\n  gx1 = Fp.mul(gx1, x1n);       //  8.  gx1 = gx1 * x1n       # x1n^2 + J * x1n * xd\n  gx1 = Fp.add(gx1, tv2);       //  9.  gx1 = gx1 + tv2       # x1n^2 + J * x1n * xd + xd^2\n  gx1 = Fp.mul(gx1, x1n);       //  10. gx1 = gx1 * x1n       # x1n^3 + J * x1n^2 * xd + x1n * xd^2\n  let tv3 = Fp.sqr(gxd);        //  11. tv3 = gxd^2\n  tv2 = Fp.sqr(tv3);            //  12. tv2 = tv3^2           # gxd^4\n  tv3 = Fp.mul(tv3, gxd);       //  13. tv3 = tv3 * gxd       # gxd^3\n  tv3 = Fp.mul(tv3, gx1);       //  14. tv3 = tv3 * gx1       # gx1 * gxd^3\n  tv2 = Fp.mul(tv2, tv3);       //  15. tv2 = tv2 * tv3       # gx1 * gxd^7\n  let y11 = Fp.pow(tv2, ELL2_C4); //  16. y11 = tv2^c4        # (gx1 * gxd^7)^((p - 5) / 8)\n  y11 = Fp.mul(y11, tv3);       //  17. y11 = y11 * tv3       # gx1*gxd^3*(gx1*gxd^7)^((p-5)/8)\n  let y12 = Fp.mul(y11, ELL2_C3); //  18. y12 = y11 * c3\n  tv2 = Fp.sqr(y11);            //  19. tv2 = y11^2\n  tv2 = Fp.mul(tv2, gxd);       //  20. tv2 = tv2 * gxd\n  let e1 = Fp.eql(tv2, gx1);    //  21.  e1 = tv2 == gx1\n  let y1 = Fp.cmov(y12, y11, e1); //  22.  y1 = CMOV(y12, y11, e1)  # If g(x1) is square, this is its sqrt\n  let x2n = Fp.mul(x1n, tv1);   //  23. x2n = x1n * tv1       # x2 = x2n / xd = 2 * u^2 * x1n / xd\n  let y21 = Fp.mul(y11, u);     //  24. y21 = y11 * u\n  y21 = Fp.mul(y21, ELL2_C2);   //  25. y21 = y21 * c2\n  let y22 = Fp.mul(y21, ELL2_C3); //  26. y22 = y21 * c3\n  let gx2 = Fp.mul(gx1, tv1);   //  27. gx2 = gx1 * tv1       # g(x2) = gx2 / gxd = 2 * u^2 * g(x1)\n  tv2 = Fp.sqr(y21);            //  28. tv2 = y21^2\n  tv2 = Fp.mul(tv2, gxd);       //  29. tv2 = tv2 * gxd\n  let e2 = Fp.eql(tv2, gx2);    //  30.  e2 = tv2 == gx2\n  let y2 = Fp.cmov(y22, y21, e2); //  31.  y2 = CMOV(y22, y21, e2)  # If g(x2) is square, this is its sqrt\n  tv2 = Fp.sqr(y1);             //  32. tv2 = y1^2\n  tv2 = Fp.mul(tv2, gxd);       //  33. tv2 = tv2 * gxd\n  let e3 = Fp.eql(tv2, gx1);    //  34.  e3 = tv2 == gx1\n  let xn = Fp.cmov(x2n, x1n, e3); //  35.  xn = CMOV(x2n, x1n, e3)  # If e3, x = x1, else x = x2\n  let y = Fp.cmov(y2, y1, e3);  //  36.   y = CMOV(y2, y1, e3)    # If e3, y = y1, else y = y2\n  let e4 = Fp.isOdd!(y);         //  37.  e4 = sgn0(y) == 1        # Fix sign of y\n  y = Fp.cmov(y, Fp.neg(y), e3 !== e4); //  38.   y = CMOV(y, -y, e3 XOR e4)\n  return { xMn: xn, xMd: xd, yMn: y, yMd: _1n }; //  39. return (xn, xd, y, 1)\n}\n\nconst ELL2_C1_EDWARDS = /* @__PURE__ */ (() => FpSqrtEven(Fp, Fp.neg(BigInt(486664))))(); // sgn0(c1) MUST equal 0\nfunction map_to_curve_elligator2_edwards25519(u: bigint) {\n  const { xMn, xMd, yMn, yMd } = map_to_curve_elligator2_curve25519(u); //  1.  (xMn, xMd, yMn, yMd) =\n  // map_to_curve_elligator2_curve25519(u)\n  let xn = Fp.mul(xMn, yMd); //  2.  xn = xMn * yMd\n  xn = Fp.mul(xn, ELL2_C1_EDWARDS); //  3.  xn = xn * c1\n  let xd = Fp.mul(xMd, yMn); //  4.  xd = xMd * yMn    # xn / xd = c1 * xM / yM\n  let yn = Fp.sub(xMn, xMd); //  5.  yn = xMn - xMd\n  let yd = Fp.add(xMn, xMd); //  6.  yd = xMn + xMd    # (n / d - 1) / (n / d + 1) = (n - d) / (n + d)\n  let tv1 = Fp.mul(xd, yd); //  7. tv1 = xd * yd\n  let e = Fp.eql(tv1, Fp.ZERO); //  8.   e = tv1 == 0\n  xn = Fp.cmov(xn, Fp.ZERO, e); //  9.  xn = CMOV(xn, 0, e)\n  xd = Fp.cmov(xd, Fp.ONE, e); //  10. xd = CMOV(xd, 1, e)\n  yn = Fp.cmov(yn, Fp.ONE, e); //  11. yn = CMOV(yn, 1, e)\n  yd = Fp.cmov(yd, Fp.ONE, e); //  12. yd = CMOV(yd, 1, e)\n  const [xd_inv, yd_inv] = FpInvertBatch(Fp, [xd, yd], true); // batch division\n  return { x: Fp.mul(xn, xd_inv), y: Fp.mul(yn, yd_inv) }; //  13. return (xn, xd, yn, yd)\n}\n\n/** Hashing to ed25519 points / field. RFC 9380 methods. */\nexport const ed25519_hasher: H2CHasher<bigint> = /* @__PURE__ */ (() =>\n  createHasher(\n    ed25519.Point,\n    (scalars: bigint[]) => map_to_curve_elligator2_edwards25519(scalars[0]),\n    {\n      DST: 'edwards25519_XMD:SHA-512_ELL2_RO_',\n      encodeDST: 'edwards25519_XMD:SHA-512_ELL2_NU_',\n      p: ed25519_CURVE_p,\n      m: 1,\n      k: 128,\n      expand: 'xmd',\n      hash: sha512,\n    }\n  ))();\n\n// \u221A(-1) aka \u221A(a) aka 2^((p-1)/4)\nconst SQRT_M1 = ED25519_SQRT_M1;\n// \u221A(ad - 1)\nconst SQRT_AD_MINUS_ONE = /* @__PURE__ */ BigInt(\n  '25063068953384623474111414158702152701244531502492656460079210482610430750235'\n);\n// 1 / \u221A(a-d)\nconst INVSQRT_A_MINUS_D = /* @__PURE__ */ BigInt(\n  '54469307008909316920995813868745141605393597292927456921205312896311721017578'\n);\n// 1-d\u00B2\nconst ONE_MINUS_D_SQ = /* @__PURE__ */ BigInt(\n  '1159843021668779879193775521855586647937357759715417654439879720876111806838'\n);\n// (d-1)\u00B2\nconst D_MINUS_ONE_SQ = /* @__PURE__ */ BigInt(\n  '40440834346308536858101042469323190826248399146238708352240133220865137265952'\n);\n// Calculates 1/\u221A(number)\nconst invertSqrt = (number: bigint) => uvRatio(_1n, number);\n\nconst MAX_255B = /* @__PURE__ */ BigInt(\n  '0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff'\n);\nconst bytes255ToNumberLE = (bytes: Uint8Array) =>\n  ed25519.Point.Fp.create(bytesToNumberLE(bytes) & MAX_255B);\n\ntype ExtendedPoint = EdwardsPoint;\n\n/**\n * Computes Elligator map for Ristretto255.\n * Described in [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#appendix-B) and on\n * the [website](https://ristretto.group/formulas/elligator.html).\n */\nfunction calcElligatorRistrettoMap(r0: bigint): ExtendedPoint {\n  const { d } = ed25519_CURVE;\n  const P = ed25519_CURVE_p;\n  const mod = (n: bigint) => Fp.create(n);\n  const r = mod(SQRT_M1 * r0 * r0); // 1\n  const Ns = mod((r + _1n) * ONE_MINUS_D_SQ); // 2\n  let c = BigInt(-1); // 3\n  const D = mod((c - d * r) * mod(r + d)); // 4\n  let { isValid: Ns_D_is_sq, value: s } = uvRatio(Ns, D); // 5\n  let s_ = mod(s * r0); // 6\n  if (!isNegativeLE(s_, P)) s_ = mod(-s_);\n  if (!Ns_D_is_sq) s = s_; // 7\n  if (!Ns_D_is_sq) c = r; // 8\n  const Nt = mod(c * (r - _1n) * D_MINUS_ONE_SQ - D); // 9\n  const s2 = s * s;\n  const W0 = mod((s + s) * D); // 10\n  const W1 = mod(Nt * SQRT_AD_MINUS_ONE); // 11\n  const W2 = mod(_1n - s2); // 12\n  const W3 = mod(_1n + s2); // 13\n  return new ed25519.Point(mod(W0 * W3), mod(W2 * W1), mod(W1 * W3), mod(W0 * W2));\n}\n\nfunction ristretto255_map(bytes: Uint8Array): _RistrettoPoint {\n  abytes(bytes, 64);\n  const r1 = bytes255ToNumberLE(bytes.subarray(0, 32));\n  const R1 = calcElligatorRistrettoMap(r1);\n  const r2 = bytes255ToNumberLE(bytes.subarray(32, 64));\n  const R2 = calcElligatorRistrettoMap(r2);\n  return new _RistrettoPoint(R1.add(R2));\n}\n\n/**\n * Wrapper over Edwards Point for ristretto255.\n *\n * Each ed25519/ExtendedPoint has 8 different equivalent points. This can be\n * a source of bugs for protocols like ring signatures. Ristretto was created to solve this.\n * Ristretto point operates in X:Y:Z:T extended coordinates like ExtendedPoint,\n * but it should work in its own namespace: do not combine those two.\n * See [RFC9496](https://www.rfc-editor.org/rfc/rfc9496).\n */\nclass _RistrettoPoint extends PrimeEdwardsPoint<_RistrettoPoint> {\n  // Do NOT change syntax: the following gymnastics is done,\n  // because typescript strips comments, which makes bundlers disable tree-shaking.\n  // prettier-ignore\n  static BASE: _RistrettoPoint =\n    /* @__PURE__ */ (() => new _RistrettoPoint(ed25519.Point.BASE))();\n  // prettier-ignore\n  static ZERO: _RistrettoPoint =\n    /* @__PURE__ */ (() => new _RistrettoPoint(ed25519.Point.ZERO))();\n  // prettier-ignore\n  static Fp: IField<bigint> =\n    /* @__PURE__ */ (() => Fp)();\n  // prettier-ignore\n  static Fn: IField<bigint> =\n    /* @__PURE__ */ (() => Fn)();\n\n  constructor(ep: ExtendedPoint) {\n    super(ep);\n  }\n\n  static fromAffine(ap: AffinePoint<bigint>): _RistrettoPoint {\n    return new _RistrettoPoint(ed25519.Point.fromAffine(ap));\n  }\n\n  protected assertSame(other: _RistrettoPoint): void {\n    if (!(other instanceof _RistrettoPoint)) throw new Error('RistrettoPoint expected');\n  }\n\n  protected init(ep: EdwardsPoint): _RistrettoPoint {\n    return new _RistrettoPoint(ep);\n  }\n\n  /** @deprecated use `import { ristretto255_hasher } from '@noble/curves/ed25519.js';` */\n  static hashToCurve(hex: Hex): _RistrettoPoint {\n    return ristretto255_map(ensureBytes('ristrettoHash', hex, 64));\n  }\n\n  static fromBytes(bytes: Uint8Array): _RistrettoPoint {\n    abytes(bytes, 32);\n    const { a, d } = ed25519_CURVE;\n    const P = ed25519_CURVE_p;\n    const mod = (n: bigint) => Fp.create(n);\n    const s = bytes255ToNumberLE(bytes);\n    // 1. Check that s_bytes is the canonical encoding of a field element, or else abort.\n    // 3. Check that s is non-negative, or else abort\n    if (!equalBytes(Fp.toBytes(s), bytes) || isNegativeLE(s, P))\n      throw new Error('invalid ristretto255 encoding 1');\n    const s2 = mod(s * s);\n    const u1 = mod(_1n + a * s2); // 4 (a is -1)\n    const u2 = mod(_1n - a * s2); // 5\n    const u1_2 = mod(u1 * u1);\n    const u2_2 = mod(u2 * u2);\n    const v = mod(a * d * u1_2 - u2_2); // 6\n    const { isValid, value: I } = invertSqrt(mod(v * u2_2)); // 7\n    const Dx = mod(I * u2); // 8\n    const Dy = mod(I * Dx * v); // 9\n    let x = mod((s + s) * Dx); // 10\n    if (isNegativeLE(x, P)) x = mod(-x); // 10\n    const y = mod(u1 * Dy); // 11\n    const t = mod(x * y); // 12\n    if (!isValid || isNegativeLE(t, P) || y === _0n)\n      throw new Error('invalid ristretto255 encoding 2');\n    return new _RistrettoPoint(new ed25519.Point(x, y, _1n, t));\n  }\n\n  /**\n   * Converts ristretto-encoded string to ristretto point.\n   * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-decode).\n   * @param hex Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding\n   */\n  static fromHex(hex: Hex): _RistrettoPoint {\n    return _RistrettoPoint.fromBytes(ensureBytes('ristrettoHex', hex, 32));\n  }\n\n  static msm(points: _RistrettoPoint[], scalars: bigint[]): _RistrettoPoint {\n    return pippenger(_RistrettoPoint, ed25519.Point.Fn, points, scalars);\n  }\n\n  /**\n   * Encodes ristretto point to Uint8Array.\n   * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-encode).\n   */\n  toBytes(): Uint8Array {\n    let { X, Y, Z, T } = this.ep;\n    const P = ed25519_CURVE_p;\n    const mod = (n: bigint) => Fp.create(n);\n    const u1 = mod(mod(Z + Y) * mod(Z - Y)); // 1\n    const u2 = mod(X * Y); // 2\n    // Square root always exists\n    const u2sq = mod(u2 * u2);\n    const { value: invsqrt } = invertSqrt(mod(u1 * u2sq)); // 3\n    const D1 = mod(invsqrt * u1); // 4\n    const D2 = mod(invsqrt * u2); // 5\n    const zInv = mod(D1 * D2 * T); // 6\n    let D: bigint; // 7\n    if (isNegativeLE(T * zInv, P)) {\n      let _x = mod(Y * SQRT_M1);\n      let _y = mod(X * SQRT_M1);\n      X = _x;\n      Y = _y;\n      D = mod(D1 * INVSQRT_A_MINUS_D);\n    } else {\n      D = D2; // 8\n    }\n    if (isNegativeLE(X * zInv, P)) Y = mod(-Y); // 9\n    let s = mod((Z - Y) * D); // 10 (check footer's note, no sqrt(-a))\n    if (isNegativeLE(s, P)) s = mod(-s);\n    return Fp.toBytes(s); // 11\n  }\n\n  /**\n   * Compares two Ristretto points.\n   * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-equals).\n   */\n  equals(other: _RistrettoPoint): boolean {\n    this.assertSame(other);\n    const { X: X1, Y: Y1 } = this.ep;\n    const { X: X2, Y: Y2 } = other.ep;\n    const mod = (n: bigint) => Fp.create(n);\n    // (x1 * y2 == y1 * x2) | (y1 * y2 == x1 * x2)\n    const one = mod(X1 * Y2) === mod(Y1 * X2);\n    const two = mod(Y1 * Y2) === mod(X1 * X2);\n    return one || two;\n  }\n\n  is0(): boolean {\n    return this.equals(_RistrettoPoint.ZERO);\n  }\n}\n\nexport const ristretto255: {\n  Point: typeof _RistrettoPoint;\n} = { Point: _RistrettoPoint };\n\n/** Hashing to ristretto255 points / field. RFC 9380 methods. */\nexport const ristretto255_hasher: H2CHasherBase<bigint> = {\n  hashToCurve(msg: Uint8Array, options?: htfBasicOpts): _RistrettoPoint {\n    const DST = options?.DST || 'ristretto255_XMD:SHA-512_R255MAP_RO_';\n    const xmd = expand_message_xmd(msg, DST, 64, sha512);\n    return ristretto255_map(xmd);\n  },\n  hashToScalar(msg: Uint8Array, options: htfBasicOpts = { DST: _DST_scalar }) {\n    const xmd = expand_message_xmd(msg, options.DST, 64, sha512);\n    return Fn.create(bytesToNumberLE(xmd));\n  },\n};\n\n// export const ristretto255_oprf: OPRF = createORPF({\n//   name: 'ristretto255-SHA512',\n//   Point: RistrettoPoint,\n//   hash: sha512,\n//   hashToGroup: ristretto255_hasher.hashToCurve,\n//   hashToScalar: ristretto255_hasher.hashToScalar,\n// });\n\n/**\n * Weird / bogus points, useful for debugging.\n * All 8 ed25519 points of 8-torsion subgroup can be generated from the point\n * T = `26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05`.\n * \u27E8T\u27E9 = { O, T, 2T, 3T, 4T, 5T, 6T, 7T }\n */\nexport const ED25519_TORSION_SUBGROUP: string[] = [\n  '0100000000000000000000000000000000000000000000000000000000000000',\n  'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a',\n  '0000000000000000000000000000000000000000000000000000000000000080',\n  '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05',\n  'ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f',\n  '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85',\n  '0000000000000000000000000000000000000000000000000000000000000000',\n  'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa',\n];\n\n/** @deprecated use `ed25519.utils.toMontgomery` */\nexport function edwardsToMontgomeryPub(edwardsPub: Hex): Uint8Array {\n  return ed25519.utils.toMontgomery(ensureBytes('pub', edwardsPub));\n}\n/** @deprecated use `ed25519.utils.toMontgomery` */\nexport const edwardsToMontgomery: typeof edwardsToMontgomeryPub = edwardsToMontgomeryPub;\n\n/** @deprecated use `ed25519.utils.toMontgomerySecret` */\nexport function edwardsToMontgomeryPriv(edwardsPriv: Uint8Array): Uint8Array {\n  return ed25519.utils.toMontgomerySecret(ensureBytes('pub', edwardsPriv));\n}\n\n/** @deprecated use `ristretto255.Point` */\nexport const RistrettoPoint: typeof _RistrettoPoint = _RistrettoPoint;\n/** @deprecated use `import { ed25519_hasher } from '@noble/curves/ed25519.js';` */\nexport const hashToCurve: H2CMethod<bigint> = /* @__PURE__ */ (() => ed25519_hasher.hashToCurve)();\n/** @deprecated use `import { ed25519_hasher } from '@noble/curves/ed25519.js';` */\nexport const encodeToCurve: H2CMethod<bigint> = /* @__PURE__ */ (() =>\n  ed25519_hasher.encodeToCurve)();\ntype RistHasher = (msg: Uint8Array, options: htfBasicOpts) => _RistrettoPoint;\n/** @deprecated use `import { ristretto255_hasher } from '@noble/curves/ed25519.js';` */\nexport const hashToRistretto255: RistHasher = /* @__PURE__ */ (() =>\n  ristretto255_hasher.hashToCurve as RistHasher)();\n/** @deprecated use `import { ristretto255_hasher } from '@noble/curves/ed25519.js';` */\nexport const hash_to_ristretto255: RistHasher = /* @__PURE__ */ (() =>\n  ristretto255_hasher.hashToCurve as RistHasher)();\n", null, null, null, null, null, null, "const U32_MASK64 = /* @__PURE__ */ (() => BigInt(2 ** 32 - 1))();\nconst _32n = /* @__PURE__ */ BigInt(32);\n// Split bigint into two 32-bit halves. With `le=true`, returned fields become `{ h: low, l: high\n// }` to match little-endian word order rather than the property names.\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}\n// Split bigint list into `[highWords, lowWords]` when `le=false`; with `le=true`, the first array\n// holds the low halves because `fromBig(...)` swaps the semantic meaning of `h` and `l`.\nfunction split(lst, le = false) {\n    const len = lst.length;\n    let Ah = new Uint32Array(len);\n    let Al = new Uint32Array(len);\n    for (let i = 0; i < len; i++) {\n        const { h, l } = fromBig(lst[i], le);\n        [Ah[i], Al[i]] = [h, l];\n    }\n    return [Ah, Al];\n}\n// Combine explicit `(high, low)` 32-bit halves into a bigint; `>>> 0` normalizes signed JS\n// bitwise results back to uint32 first, and little-endian callers must swap.\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// Split a JS number into u32 halves without a BigInt allocation. Exact only for integers\n// `0 <= n < 2**53`; callers use it on byte / bit counters, which JS length math caps far below\n// that (an ArrayBuffer cannot exceed 2**53 - 1 bytes).\nconst fromNumH = (n) => (n / 2 ** 32) | 0;\nconst fromNumL = (n) => n >>> 0;\n// Drop-in replacement for `view.setBigUint64(byteOffset, BigInt(n), isLE)` without the per-call\n// BigInt allocation. Same `n < 2**53` precondition as `fromNumH`/`fromNumL`.\nfunction setU64FromNum(view, byteOffset, n, isLE) {\n    const h = fromNumH(n);\n    const l = fromNumL(n);\n    view.setUint32(byteOffset, isLE ? l : h, isLE);\n    view.setUint32(byteOffset + 4, isLE ? h : l, isLE);\n}\n// High 32-bit half of a 64-bit logical right shift for `s` in `0..31`.\nconst shrSH = (h, _l, s) => h >>> s;\n// Low 32-bit half of a 64-bit logical right shift, valid for `s` in `1..31`.\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// High 32-bit half of a 64-bit right rotate, valid for `s` in `1..31`.\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\n// Low 32-bit half of a 64-bit right rotate, valid for `s` in `1..31`.\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// High 32-bit half of a 64-bit right rotate, valid for `s` in `33..63`; `32` uses `rotr32*`.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\n// Low 32-bit half of a 64-bit right rotate, valid for `s` in `33..63`; `32` uses `rotr32*`.\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// High 32-bit half of a 64-bit right rotate for `s === 32`; this is just the swapped low half.\nconst rotr32H = (_h, l) => l;\n// Low 32-bit half of a 64-bit right rotate for `s === 32`; this is just the swapped high half.\nconst rotr32L = (h, _l) => h;\n// 64-bit left rotates (rotl*) are not defined here: sha3.ts, their only consumer, keeps\n// local copies so V8 inlines them into keccakP.\n// Add two split 64-bit words and return the split `{ h, l }` sum.\n// JS uses 32-bit signed integers for bitwise operations, so we cannot simply shift the carry out\n// of the low sum and instead 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\n// Unmasked low-word accumulator for 3-way addition; pass the raw result into `add3H(...)`.\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\n// High-word finalize step for 3-way addition; `low` must be the untruncated output of `add3L(...)`.\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\n// Unmasked low-word accumulator for 4-way addition; pass the raw result into `add4H(...)`.\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\n// High-word finalize step for 4-way addition; `low` must be the untruncated output of `add4L(...)`.\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\n// Unmasked low-word accumulator for 5-way addition; pass the raw result into `add5H(...)`.\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\n// High-word finalize step for 5-way addition; `low` must be the untruncated output of `add5L(...)`.\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, fromNumH, fromNumL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, setU64FromNum, shrSH, shrSL, split, toBig };\n", "/**\n * Checks if something is Uint8Array. Be careful: nodejs Buffer will return true.\n * @param a - value to test\n * @returns `true` when the value is a Uint8Array-compatible view.\n * @example\n * Check whether a value is a Uint8Array-compatible view.\n * ```ts\n * isBytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function isBytes(a) {\n    // Plain `instanceof Uint8Array` is too strict for some Buffer / proxy / cross-realm cases.\n    // The fallback still requires a real ArrayBuffer view, so plain\n    // JSON-deserialized `{ constructor: ... }` spoofing is rejected, and\n    // `BYTES_PER_ELEMENT === 1` keeps the fallback on byte-oriented views.\n    return (a instanceof Uint8Array ||\n        (ArrayBuffer.isView(a) &&\n            a.constructor.name === 'Uint8Array' &&\n            'BYTES_PER_ELEMENT' in a &&\n            a.BYTES_PER_ELEMENT === 1));\n}\n// Shared error-message prefix builder. Only called on throw paths, so assert\n// success paths never pay for the string concatenation.\nconst atitle = (title) => (title ? `\"${title}\" ` : '');\n/**\n * Asserts something is a non-negative integer.\n * @param n - number to validate\n * @param title - label included in thrown errors\n * @returns The validated number.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a non-negative integer option.\n * ```ts\n * anumber(32, 'length');\n * ```\n */\nexport function anumber(n, title = '') {\n    if (typeof n !== 'number')\n        throw new TypeError(atitle(title) + 'expected number, got ' + typeof n);\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new RangeError(atitle(title) + 'expected integer >= 0, got ' + n);\n    return n;\n}\n/**\n * Asserts something is a boolean.\n * @param value - value to validate\n * @param title - label included in thrown errors\n * @returns The validated boolean.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate a boolean option.\n * ```ts\n * abool(true, 'enableXOF');\n * ```\n */\nexport function abool(value, title = '') {\n    if (typeof value !== 'boolean')\n        throw new TypeError(atitle(title) + 'expected boolean, got type=' + typeof value);\n    return value;\n}\n/**\n * Asserts something is Uint8Array.\n * @param value - value to validate\n * @param length - optional exact length constraint\n * @param title - label included in thrown errors\n * @returns The validated byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate that a value is a byte array.\n * ```ts\n * abytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function abytes(value, length, title = '') {\n    // Success path first: this runs at the start of every update() / digestInto(), and the\n    // common `abytes(data)` form must not pay for length handling it does not use.\n    if (isBytes(value) && (length === undefined || value.length === length))\n        return value;\n    // Error path: recompute freely to build the exact message.\n    if (length !== undefined)\n        anumber(length, 'length');\n    const bytes = isBytes(value);\n    const ofLen = length !== undefined ? ` of length ${length}` : '';\n    const got = bytes ? `length=${value.length}` : `type=${typeof value}`;\n    const message = atitle(title) + 'expected Uint8Array' + ofLen + ', got ' + got;\n    if (!bytes)\n        throw new TypeError(message);\n    throw new RangeError(message);\n}\n/**\n * Copies bytes into a fresh Uint8Array.\n * Buffer-style slices can alias the same backing store, so callers that need ownership should copy.\n * @param bytes - source bytes to clone\n * @returns Freshly allocated copy of `bytes`.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Clone a byte array before mutating it.\n * ```ts\n * const copy = copyBytes(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function copyBytes(bytes) {\n    // `Uint8Array.from(...)` would also accept arrays / other typed arrays. Keep this helper strict\n    // because callers use it at byte-validation boundaries before mutating the detached copy.\n    return Uint8Array.from(abytes(bytes));\n}\n/**\n * Asserts something is a wrapped hash constructor.\n * @param h - hash constructor to validate\n * @throws On wrong argument types or invalid hash wrapper shape. {@link TypeError}\n * @throws On invalid hash metadata ranges or values. {@link RangeError}\n * @throws If the hash metadata allows empty outputs or block sizes. {@link Error}\n * @example\n * Validate a callable hash wrapper.\n * ```ts\n * import { ahash } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * ahash(sha256);\n * ```\n */\nexport function ahash(h) {\n    if (typeof h !== 'function' || typeof h.create !== 'function')\n        throw new TypeError('expected hash wrapped by utils.createHasher');\n    anumber(h.outputLen);\n    anumber(h.blockLen);\n    // HMAC and KDF callers treat these as real byte lengths; allowing zero lets fake wrappers pass\n    // validation and can produce empty outputs instead of failing fast.\n    if (h.outputLen < 1 || h.blockLen < 1)\n        throw new Error('hash blockLen / outputLen must be >= 1');\n}\nconst aobject = (value, label) => {\n    if (value === null || typeof value !== 'object' || Array.isArray(value))\n        throw new TypeError((label === 'object' ? '' : `\"${label}\" `) + 'expected object, got type=' + typeof value);\n};\n/**\n * Asserts a hash instance has not been destroyed or finished.\n * @param instance - hash instance to validate\n * @param checkFinished - whether to reject finalized instances\n * @throws If the hash instance has already been destroyed or finalized. {@link Error}\n * @example\n * Validate that a hash instance is still usable.\n * ```ts\n * import { aexists } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hash = sha256.create();\n * aexists(hash);\n * ```\n */\nexport function aexists(instance, checkFinished = true) {\n    // Runs on every update()/digestInto(); the flags are library-owned booleans, so only their\n    // truthiness is checked - re-validating their type per call was pure hot-path overhead.\n    if (instance.destroyed)\n        throw new Error('hash was destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('digest() was already called');\n}\n/**\n * Asserts output is a sufficiently-sized byte array.\n * @param out - destination buffer\n * @param instance - hash instance providing output length\n * Oversized buffers are allowed; downstream code only promises to fill the first `outputLen` bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a caller-provided digest buffer.\n * ```ts\n * import { aoutput } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hash = sha256.create();\n * aoutput(new Uint8Array(hash.outputLen), hash);\n * ```\n */\nexport function aoutput(out, instance) {\n    abytes(out, undefined, 'output');\n    // `outputLen` is a library-owned readonly number; the negated comparison keeps failing fast\n    // when it is missing/NaN (comparisons with undefined/NaN are false) without an anumber() call.\n    const min = instance.outputLen;\n    if (!(out.length >= min)) {\n        throw new RangeError('\"output\" expected length >= ' + min);\n    }\n}\n/**\n * Casts a typed array view to Uint8Array.\n * @param arr - source typed array\n * @returns Uint8Array view over the same buffer.\n * @example\n * Reinterpret a typed array as bytes.\n * ```ts\n * u8(new Uint32Array([1, 2]));\n * ```\n */\nexport function u8(arr) {\n    return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/**\n * Casts a typed array view to Uint32Array.\n * `arr.byteOffset` must already be 4-byte aligned or the platform\n * Uint32Array constructor will throw.\n * @param arr - source typed array\n * @returns Uint32Array view over the same buffer.\n * @example\n * Reinterpret a byte array as 32-bit words.\n * ```ts\n * u32(new Uint8Array(8));\n * ```\n */\nexport function u32(arr) {\n    return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/**\n * Zeroizes typed arrays in place. Warning: JS provides no guarantees.\n * @param arrays - arrays to overwrite with zeros\n * @example\n * Zeroize sensitive buffers in place.\n * ```ts\n * clean(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport function clean(...arrays) {\n    for (let i = 0; i < arrays.length; i++) {\n        arrays[i].fill(0);\n    }\n}\n/**\n * Creates a DataView for byte-level manipulation.\n * @param arr - source typed array\n * @returns DataView over the same buffer region.\n * @example\n * Create a DataView over an existing buffer.\n * ```ts\n * createView(new Uint8Array(4));\n * ```\n */\nexport function createView(arr) {\n    return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/**\n * Rotate-right operation for uint32 values.\n * @param word - source word\n * @param shift - shift amount in bits\n * @returns Rotated word.\n * @example\n * Rotate a 32-bit word to the right.\n * ```ts\n * rotr(0x12345678, 8);\n * ```\n */\nexport function rotr(word, shift) {\n    return (word << (32 - shift)) | (word >>> shift);\n}\n/**\n * Rotate-left operation for uint32 values.\n * @param word - source word\n * @param shift - shift amount in bits\n * @returns Rotated word.\n * @example\n * Rotate a 32-bit word to the left.\n * ```ts\n * rotl(0x12345678, 8);\n * ```\n */\nexport function rotl(word, shift) {\n    return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Whether the current platform is little-endian. */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/**\n * Byte-swap operation for uint32 values.\n * @param word - source word\n * @returns Word with reversed byte order.\n * @example\n * Reverse the byte order of a 32-bit word.\n * ```ts\n * byteSwap(0x11223344);\n * ```\n */\nexport function byteSwap(word) {\n    return (((word << 24) & 0xff000000) |\n        ((word << 8) & 0xff0000) |\n        ((word >>> 8) & 0xff00) |\n        ((word >>> 24) & 0xff));\n}\n/**\n * Conditionally byte-swaps one 32-bit word on big-endian platforms.\n * @param n - source word\n * @returns Original or byte-swapped word depending on platform endianness.\n * @example\n * Normalize a 32-bit word for host endianness.\n * ```ts\n * swap8IfBE(0x11223344);\n * ```\n */\nexport const swap8IfBE = isLE\n    ? (n) => n\n    : (n) => byteSwap(n) >>> 0;\n/**\n * Byte-swaps every word of a Uint32Array in place.\n * @param arr - array to mutate\n * @returns The same array after mutation; callers pass live state arrays here.\n * @example\n * Reverse the byte order of every word in place.\n * ```ts\n * byteSwap32(new Uint32Array([0x11223344]));\n * ```\n */\nexport function byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n    return arr;\n}\n/**\n * Conditionally byte-swaps a Uint32Array on big-endian platforms.\n * @param u - array to normalize for host endianness\n * @returns Original or byte-swapped array depending on platform endianness.\n *   On big-endian runtimes this mutates `u` in place via `byteSwap32(...)`.\n * @example\n * Normalize a word array for host endianness.\n * ```ts\n * swap32IfBE(new Uint32Array([0x11223344]));\n * ```\n */\nexport const swap32IfBE = isLE\n    ? (u) => u\n    : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = /* @__PURE__ */ (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string.\n * Uses the built-in function when available and assumes it matches the tested\n * fallback semantics.\n * @param bytes - bytes to encode\n * @returns Lowercase hexadecimal string.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Convert bytes to lowercase hexadecimal.\n * ```ts\n * bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])); // 'cafe0123'\n * ```\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // @ts-ignore\n    if (hasHexBuiltin)\n        return bytes.toHex();\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// Strict ASCII nibble parser: non-ASCII hex lookalikes are rejected as undefined.\n// ASCII codes: '0'..'9' = 48..57, 'A'..'F' = 65..70, 'a'..'f' = 97..102.\n// prettier-ignore\nfunction asciiToBase16(ch) {\n    return ch >= 48 && ch <= 57 ? ch - 48 // '2' => 50-48\n        : ch >= 65 && ch <= 70 ? ch - (65 - 10) // 'B' => 66-(65-10)\n            : ch >= 97 && ch <= 102 ? ch - (97 - 10) // 'b' => 98-(97-10)\n                : undefined;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @param hex - hexadecimal string to decode\n * @returns Decoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Decode lowercase hexadecimal into bytes.\n * ```ts\n * hexToBytes('cafe0123'); // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n * ```\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new TypeError('hex string expected, got ' + typeof hex);\n    if (hasHexBuiltin) {\n        try {\n            return Uint8Array.fromHex(hex);\n        }\n        catch (error) {\n            if (error instanceof SyntaxError)\n                throw new RangeError(error.message);\n            throw error;\n        }\n    }\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new RangeError('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)); // parse first char, multiply it by 16\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1)); // parse second char\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new RangeError('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2; // example: 'A9' => 10*16 + 9\n    }\n    return array;\n}\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * This yields to the Promise/microtask scheduler queue, not to timers or the\n * full macrotask event loop.\n * @example\n * Yield to the next scheduler tick.\n * ```ts\n * await nextTick();\n * ```\n */\nexport const nextTick = async () => { };\n/**\n * Returns control to the Promise/microtask scheduler every `tick`\n * milliseconds to avoid blocking long loops.\n * @param iters - number of loop iterations to run\n * @param tick - maximum time slice in milliseconds\n * @param cb - callback executed on each iteration\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Run a loop that periodically yields back to the event loop.\n * ```ts\n * await asyncLoop(2, 0, () => {});\n * ```\n */\nexport async function asyncLoop(iters, tick, cb) {\n    anumber(iters, 'iters');\n    anumber(tick, 'tick');\n    if (typeof cb !== 'function')\n        throw new TypeError('callback must be a function');\n    // Callback is synchronous by contract; asyncLoop only yields between sync work windows.\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        // Track only synchronous work time; scheduler delay after yielding is outside our budget.\n        ts += diff;\n    }\n}\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * Non-ASCII details are delegated to the platform `TextEncoder`.\n * @param str - string to encode\n * @returns UTF-8 encoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Encode a string as UTF-8 bytes.\n * ```ts\n * utf8ToBytes('abc'); // Uint8Array.from([97, 98, 99])\n * ```\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new TypeError('string expected');\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Helper for KDFs: consumes Uint8Array or string.\n * String inputs are UTF-8 encoded; byte-array inputs stay aliased to the caller buffer.\n * @param data - user-provided KDF input\n * @param errorTitle - label included in thrown errors\n * @returns Byte representation of the input.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Normalize KDF input to bytes.\n * ```ts\n * kdfInputToBytes('password');\n * ```\n */\nexport function kdfInputToBytes(data, errorTitle = '') {\n    if (typeof data === 'string')\n        return utf8ToBytes(data);\n    return abytes(data, undefined, errorTitle);\n}\n/**\n * Copies several Uint8Arrays into one.\n * @param arrays - arrays to concatenate\n * @returns Concatenated byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Concatenate multiple byte arrays.\n * ```ts\n * concatBytes(new Uint8Array([1]), new Uint8Array([2]));\n * ```\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/**\n * Validates declared required and optional field types on a plain object.\n * This walks field schemas and formats detailed errors, so avoid it on hot paths; use direct\n * one-line guards such as `abytes()`, `abool()`, or `anumber()` instead.\n * @param object - object to validate\n * @param fields - map of required field names to expected types\n * @param optFields - map of optional field names to expected types\n * @param title - label included in thrown errors\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate required and optional option fields.\n * ```ts\n * validateObject({ N: 1024, dkLen: 32 }, { N: 'number' }, { dkLen: 'number' });\n * ```\n */\nexport const validateObject = (object, fields = {}, optFields = {}, title = 'object') => {\n    aobject(object, title);\n    aobject(fields, 'fields');\n    aobject(optFields, 'optFields');\n    function checkField(fieldName, expectedType, isOpt) {\n        const label = title === 'object' ? `param \"${String(fieldName)}\"` : `\"${title}.${String(fieldName)}\"`;\n        // Config fields must be explicit own properties. Optional inherited values are rejected too\n        // because callers keep reading the same options object after validation.\n        const val = object[fieldName];\n        // Runtime objects such as Field instances intentionally satisfy required method slots\n        // via their shared prototype.\n        if (!Object.hasOwn(object, fieldName) &&\n            (isOpt ? val !== undefined : expectedType !== 'function')) {\n            throw new TypeError(`${label} is invalid: expected own property`);\n        }\n        if (isOpt && val === undefined)\n            return;\n        const current = typeof val;\n        if (current !== expectedType || val === null)\n            throw new TypeError(`${label} is invalid: expected ${expectedType}, got ${current}`);\n    }\n    const iter = (f, isOpt) => Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n    iter(fields, false);\n    iter(optFields, true);\n};\n/**\n * Merges default options and passed options.\n * @param defaults - base option object\n * @param opts - user overrides\n * @param title - label included in thrown override errors\n * @returns Merged option object. The merge mutates `defaults` in place.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Merge user overrides onto default options.\n * ```ts\n * checkOpts({ dkLen: 32 }, { asyncTick: 10 });\n * ```\n */\nexport function checkOpts(defaults, opts, title = 'opts') {\n    aobject(defaults, 'defaults');\n    if (opts !== undefined)\n        aobject(opts, title);\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\n/**\n * Creates a callable hash function from a stateful class constructor.\n * @param hashCons - hash constructor or factory\n * @param info - optional metadata such as DER OID\n * @returns Frozen callable hash wrapper with `.create()`.\n *   Wrapper construction eagerly calls `hashCons(undefined)` once to read\n *   `outputLen` / `blockLen`, so constructor side effects happen at module\n *   init time.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Wrap a stateful hash constructor into a callable helper.\n * ```ts\n * import { createHasher } from '@noble/hashes/utils.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const wrapped = createHasher(sha256.create, { oid: sha256.oid });\n * wrapped(new Uint8Array([1]));\n * ```\n */\nexport function createHasher(hashCons, info = {}) {\n    if (typeof hashCons !== 'function')\n        throw new TypeError('\"hashCons\" expected function, got type=' + typeof hashCons);\n    info = checkOpts({}, info, 'info');\n    const hashC = (msg, opts) => hashCons(opts)\n        .update(msg)\n        .digest();\n    const tmp = hashCons(undefined);\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.canXOF = tmp.canXOF;\n    hashC.create = (opts) => hashCons(opts);\n    Object.assign(hashC, info);\n    return Object.freeze(hashC);\n}\n/**\n * Cryptographically secure PRNG backed by `crypto.getRandomValues`.\n * @param bytesLength - number of random bytes to generate\n * @returns Random bytes.\n * The platform `getRandomValues()` implementation still defines any\n * single-call length cap, and this helper rejects oversize requests\n * with a stable library `RangeError` instead of host-specific errors.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If the current runtime does not provide `crypto.getRandomValues`. {@link Error}\n * @example\n * Generate a fresh random key or nonce.\n * ```ts\n * const key = randomBytes(16);\n * ```\n */\nexport function randomBytes(bytesLength = 32) {\n    // Match the repo's other length-taking helpers instead of relying on Uint8Array coercion.\n    anumber(bytesLength, 'bytesLength');\n    const cr = typeof globalThis === 'object' ? globalThis.crypto : null;\n    if (typeof cr?.getRandomValues !== 'function')\n        throw new Error('crypto.getRandomValues must be defined');\n    // Web Cryptography API Level 2 \u00A710.1.1:\n    // if `byteLength > 65536`, throw `QuotaExceededError`.\n    // Keep the guard explicit so callers can see the quota in code\n    // instead of discovering it by reading the spec or host errors.\n    // This wrapper surfaces the same quota as a stable library RangeError.\n    if (bytesLength > 65536)\n        throw new RangeError(`\"bytesLength\" expected <= 65536, got ${bytesLength}`);\n    return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/**\n * Creates OID metadata for NIST hashes with prefix `06 09 60 86 48 01 65 03 04 02`.\n * @param suffix - final OID byte for the selected hash.\n *   The helper accepts any byte even though only the documented NIST hash\n *   suffixes are meaningful downstream.\n * @returns Object containing the DER-encoded OID.\n * @example\n * Build OID metadata for a NIST hash.\n * ```ts\n * oidNist(0x01);\n * ```\n */\nexport const oidNist = (suffix) => ({\n    // Current NIST hashAlgs suffixes used here fit in one DER subidentifier octet.\n    // Larger suffix values would need base-128 OID encoding and a different length byte.\n    oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { setU64FromNum } from \"./_u64.js\";\nimport { abytes, aexists, aoutput, createView } from \"./utils.js\";\n/**\n * Shared 32-bit conditional boolean primitive reused by SHA-256, SHA-1, and MD5 `F`.\n * Returns bits from `b` when `a` is set, otherwise from `c`.\n * The XOR form is equivalent to MD5's `F(X,Y,Z) = XY v not(X)Z` because the masked terms never\n * set the same bit.\n * @param a - selector word\n * @param b - word chosen when selector bit is set\n * @param c - word chosen when selector bit is clear\n * @returns Mixed 32-bit word.\n * @example\n * Combine three words with the shared 32-bit choice primitive.\n * ```ts\n * Chi(0xffffffff, 0x12345678, 0x87654321);\n * ```\n */\nexport function Chi(a, b, c) {\n    return (a & b) ^ (~a & c);\n}\n/**\n * Shared 32-bit majority primitive reused by SHA-256 and SHA-1.\n * Returns bits shared by at least two inputs.\n * @param a - first input word\n * @param b - second input word\n * @param c - third input word\n * @returns Mixed 32-bit word.\n * @example\n * Combine three words with the shared 32-bit majority primitive.\n * ```ts\n * Maj(0xffffffff, 0x12345678, 0x87654321);\n * ```\n */\nexport function Maj(a, b, c) {\n    return (a & b) ^ (a & c) ^ (b & c);\n}\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n * Accepts only byte-aligned `Uint8Array` input, even when the underlying spec describes bit\n * strings with partial-byte tails.\n * @param blockLen - internal block size in bytes\n * @param outputLen - digest size in bytes\n * @param padOffset - trailing length field size in bytes\n * @param isLE - whether length and state words are encoded in little-endian\n * @example\n * Use a concrete subclass to get the shared Merkle-Damgard update/digest flow.\n * ```ts\n * import { _SHA1 } from '@noble/hashes/legacy.js';\n * const hash = new _SHA1();\n * hash.update(new Uint8Array([97, 98, 99]));\n * hash.digest();\n * ```\n */\nexport class HashMD {\n    blockLen;\n    outputLen;\n    canXOF = false;\n    padOffset;\n    isLE;\n    // For partial updates less than block size\n    buffer;\n    view;\n    finished = false;\n    length = 0;\n    pos = 0;\n    destroyed = false;\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        aexists(this);\n        abytes(data);\n        const { view, buffer, blockLen } = this;\n        const len = data.length;\n        let processed = false;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path only when there is no buffered partial block: `take === blockLen` implies\n            // `this.pos === 0`, so we can process full blocks directly from the input view.\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                processed = true;\n                continue;\n            }\n            // When the whole input is buffered in one go (common for short messages), passing `data`\n            // directly avoids allocating a subarray view.\n            buffer.set(pos === 0 && take === len ? data : 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                processed = true;\n            }\n        }\n        this.length += data.length;\n        // Shared schedule buffers only pick up input-derived words inside process(); if everything\n        // was buffered without processing, there is nothing to zero.\n        if (processed)\n            this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        aoutput(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message, then zero-pad the rest of the block\n        buffer[pos++] = 0b10000000;\n        buffer.fill(0, pos);\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            buffer.fill(0);\n        }\n        // `padOffset` reserves the whole length field. For SHA-384/512 the high 64 bits stay zero from\n        // the padding fill above, and JS will overflow before user input can make that half non-zero.\n        // So we only need to write the low 64 bits here (`length * 8` only scales the exponent of an\n        // integer below 2**53, so the split inside the helper stays exact).\n        setU64FromNum(view, blockLen - 8, this.length * 8, isLE);\n        this.process(view, 0);\n        // The final block above is processed outside update(), so the shared message-schedule\n        // buffers (e.g. SHA256_W) would otherwise retain input-derived words after digest().\n        this.roundClean();\n        // digest() passes our own `buffer` as `out`; reuse its cached view instead of allocating one.\n        const oview = out === buffer ? view : createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which must be fused in single op with modulo by JIT\n        const outLen = len / 4;\n        const state = this.get();\n        // Subclass-misconfiguration invariant: outputLen must be 32-bit aligned and fit the state.\n        if (len % 4 || outLen > state.length)\n            throw new Error('invalid outputLen');\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        // Copy before destroy(): subclasses wipe `buffer` during cleanup, but `digest()` must return\n        // fresh bytes to the caller.\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneIntoMeta(to) {\n        const { buffer, length, finished, destroyed, pos } = this;\n        to.destroyed = destroyed;\n        to.finished = finished;\n        to.length = length;\n        to.pos = pos;\n        // Only partial-block bytes need copying: when `length % blockLen === 0`, `pos === 0` and\n        // later `update()` / `digestInto()` overwrite `to.buffer` from the start before reading it.\n        if (pos)\n            to.buffer.set(buffer); // Avoid a hot modulo guard.\n        return to;\n    }\n    clone() {\n        return this._cloneInto();\n    }\n}\n/**\n * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n */\n/** Initial SHA256 state from RFC 6234 \u00A76.1: the first 32 bits of the fractional parts of the\n * square roots of the first eight prime numbers. Exported as a shared table; callers must treat\n * it as read-only because constructors copy words from it by index. */\nexport const SHA256_IV = /* @__PURE__ */ Uint32Array.from([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n/** Initial SHA224 state `H(0)` from RFC 6234 \u00A76.1. Exported as a shared table; callers must\n * treat it as read-only because constructors copy words from it by index. */\nexport const SHA224_IV = /* @__PURE__ */ Uint32Array.from([\n    0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n/** Initial SHA384 state from RFC 6234 \u00A76.3: eight RFC 64-bit `H(0)` words stored as sixteen\n * big-endian 32-bit halves. Derived from the fractional parts of the square roots of the ninth\n * through sixteenth prime numbers. Exported as a shared table; callers must treat it as read-only\n * because constructors copy halves from it by index. */\nexport const SHA384_IV = /* @__PURE__ */ Uint32Array.from([\n    0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n    0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n/** Initial SHA512 state from RFC 6234 \u00A76.3: eight RFC 64-bit `H(0)` words stored as sixteen\n * big-endian 32-bit halves. Derived from the fractional parts of the square roots of the first\n * eight prime numbers. Exported as a shared table; callers must treat it as read-only because\n * constructors copy halves from it by index. */\nexport const SHA512_IV = /* @__PURE__ */ Uint32Array.from([\n    0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n    0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\n * SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out {@link https://www.rfc-editor.org/rfc/rfc4634 | RFC 4634} and\n * {@link https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf | FIPS 180-4}.\n * @module\n */\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from \"./_md.js\";\nimport * as u64 from \"./_u64.js\";\nimport { clean, createHasher, oidNist, rotr } from \"./utils.js\";\n/**\n * SHA-224 / SHA-256 round constants from RFC 6234 \u00A75.1: the first 32 bits\n * of the cube roots of the first 64 primes (2..311).\n */\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ Uint32Array.from([\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/** Reusable SHA-224 / SHA-256 message schedule buffer `W_t` from RFC 6234 \u00A76.2 step 1. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n/** Internal SHA-224 / SHA-256 compression engine from RFC 6234 \u00A76.2. */\nclass SHA2_32B extends HashMD {\n    // We cannot use array here since array allows indexing by variable\n    // which means optimizer/compiler cannot use registers.\n    // Numeric initializers matter: starting the fields as `undefined` changes\n    // V8's field representation and makes sha256 3x slower (measured).\n    A = 0;\n    B = 0;\n    C = 0;\n    D = 0;\n    E = 0;\n    F = 0;\n    G = 0;\n    H = 0;\n    constructor(outputLen, IV) {\n        super(64, outputLen, 8, false);\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    _cloneInto(to) {\n        (to ||= new this.constructor()).set(...this.get());\n        return this._cloneIntoMeta(to);\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        clean(SHA256_W);\n    }\n    destroy() {\n        // HashMD callers route post-destroy usability through `destroyed`; zeroizing alone still leaves\n        // update()/digest() callable on reused instances.\n        this.destroyed = true;\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        clean(this.buffer);\n    }\n}\n/** Internal SHA-256 hash class grounded in RFC 6234 \u00A76.2. */\nexport class _SHA256 extends SHA2_32B {\n    constructor() {\n        super(32, SHA256_IV);\n    }\n}\n/** Internal SHA-224 hash class grounded in RFC 6234 \u00A76.2 and \u00A78.5. */\nexport class _SHA224 extends SHA2_32B {\n    constructor() {\n        super(28, SHA224_IV);\n    }\n}\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n// SHA-384 / SHA-512 round constants from RFC 6234 \u00A75.2:\n// 80 full 64-bit words split into high/low halves.\n// prettier-ignore\nconst K512 = /* @__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))))();\nconst SHA512_Kh = /* @__PURE__ */ (() => K512[0])();\nconst SHA512_Kl = /* @__PURE__ */ (() => K512[1])();\n// Reusable high-half schedule buffer for the RFC 6234 \u00A76.4 64-bit `W_t` words.\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\n// Reusable low-half schedule buffer for the RFC 6234 \u00A76.4 64-bit `W_t` words.\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n/** Internal SHA-384 / SHA-512 compression engine from RFC 6234 \u00A76.4. */\nclass SHA2_64B extends HashMD {\n    // We cannot use array here since array allows indexing by variable\n    // which means optimizer/compiler cannot use registers.\n    // h -- high 32 bits, l -- low 32 bits\n    // Numeric initializers matter: starting the fields as `undefined` changes\n    // V8's field representation and slows hashing down (measured on sha256).\n    Ah = 0;\n    Al = 0;\n    Bh = 0;\n    Bl = 0;\n    Ch = 0;\n    Cl = 0;\n    Dh = 0;\n    Dl = 0;\n    Eh = 0;\n    El = 0;\n    Fh = 0;\n    Fl = 0;\n    Gh = 0;\n    Gl = 0;\n    Hh = 0;\n    Hl = 0;\n    constructor(outputLen, IV) {\n        super(128, outputLen, 16, false);\n        this.Ah = IV[0] | 0;\n        this.Al = IV[1] | 0;\n        this.Bh = IV[2] | 0;\n        this.Bl = IV[3] | 0;\n        this.Ch = IV[4] | 0;\n        this.Cl = IV[5] | 0;\n        this.Dh = IV[6] | 0;\n        this.Dl = IV[7] | 0;\n        this.Eh = IV[8] | 0;\n        this.El = IV[9] | 0;\n        this.Fh = IV[10] | 0;\n        this.Fl = IV[11] | 0;\n        this.Gh = IV[12] | 0;\n        this.Gl = IV[13] | 0;\n        this.Hh = IV[14] | 0;\n        this.Hl = IV[15] | 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    _cloneInto(to) {\n        (to ||= new this.constructor()).set(...this.get());\n        return this._cloneIntoMeta(to);\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            // SHA512_W[i] = s0 + s1 + SHA512_W[i - 7] + SHA512_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        clean(SHA512_W_H, SHA512_W_L);\n    }\n    destroy() {\n        // HashMD callers route post-destroy usability through `destroyed`; zeroizing alone still leaves\n        // update()/digest() callable on reused instances.\n        this.destroyed = true;\n        clean(this.buffer);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\n/** Internal SHA-512 hash class grounded in RFC 6234 \u00A76.3 and \u00A76.4. */\nexport class _SHA512 extends SHA2_64B {\n    constructor() {\n        super(64, SHA512_IV);\n    }\n}\n/** Internal SHA-384 hash class grounded in RFC 6234 \u00A76.3 and \u00A76.4. */\nexport class _SHA384 extends SHA2_64B {\n    constructor() {\n        super(48, SHA384_IV);\n    }\n}\n/**\n * Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See the repo-side derivation recipe in `test/misc/sha2-gen-iv.js`.\n * These IV literals are checked against that script rather than a dedicated\n * local RFC section.\n */\n/** SHA-512/224 IV derived by the SHA-512/t recipe in `test/misc/sha2-gen-iv.js` and\n * stored as sixteen big-endian 32-bit halves. */\nconst T224_IV = /* @__PURE__ */ Uint32Array.from([\n    0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n    0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n/** SHA-512/256 IV derived by the SHA-512/t recipe in `test/misc/sha2-gen-iv.js` and\n * stored as sixteen big-endian 32-bit halves. */\nconst T256_IV = /* @__PURE__ */ Uint32Array.from([\n    0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n    0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n/** Internal SHA-512/224 hash class using the derived `T224_IV` and the shared\n * RFC 6234 \u00A76.4 compression engine. */\nexport class _SHA512_224 extends SHA2_64B {\n    constructor() {\n        super(28, T224_IV);\n    }\n}\n/** Internal SHA-512/256 hash class using the derived `T256_IV` and the shared\n * RFC 6234 \u00A76.4 compression engine. */\nexport class _SHA512_256 extends SHA2_64B {\n    constructor() {\n        super(32, T256_IV);\n    }\n}\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-256.\n * ```ts\n * sha256(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha256 = /* @__PURE__ */ createHasher(() => new _SHA256(), \n/* @__PURE__ */ oidNist(0x01));\n/**\n * SHA2-224 hash function from RFC 4634.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-224.\n * ```ts\n * sha224(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha224 = /* @__PURE__ */ createHasher(() => new _SHA224(), \n/* @__PURE__ */ oidNist(0x04));\n/**\n * SHA2-512 hash function from RFC 4634.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-512.\n * ```ts\n * sha512(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha512 = /* @__PURE__ */ createHasher(() => new _SHA512(), \n/* @__PURE__ */ oidNist(0x03));\n/**\n * SHA2-384 hash function from RFC 4634.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-384.\n * ```ts\n * sha384(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha384 = /* @__PURE__ */ createHasher(() => new _SHA384(), \n/* @__PURE__ */ oidNist(0x02));\n/**\n * SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on {@link https://eprint.iacr.org/2010/548.pdf | truncated SHA512}.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-512/256.\n * ```ts\n * sha512_256(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha512_256 = /* @__PURE__ */ createHasher(() => new _SHA512_256(), \n/* @__PURE__ */ oidNist(0x06));\n/**\n * SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on {@link https://eprint.iacr.org/2010/548.pdf | truncated SHA512}.\n * @param msg - message bytes to hash\n * @param opts - Reserved hash options.\n * @returns Digest bytes.\n * @example\n * Hash a message with SHA2-512/224.\n * ```ts\n * sha512_224(new Uint8Array([97, 98, 99]));\n * ```\n */\nexport const sha512_224 = /* @__PURE__ */ createHasher(() => new _SHA512_224(), \n/* @__PURE__ */ oidNist(0x05));\n", "/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { abytes as abytes_, anumber as anumber_, bytesToHex as bytesToHex_, concatBytes as concatBytes_, hexToBytes as hexToBytes_, isBytes as isBytes_, randomBytes as randomBytes_, } from '@noble/hashes/utils.js';\n/**\n * Validates that a value is an array, optionally validating each element.\n * @param item - Value to validate.\n * @param title - Label included in thrown errors.\n * @param inner - Optional per-element validator, called with the element and its label.\n * @returns The validated array.\n * @example\n * Validate an array of points before batch processing.\n *\n * ```ts\n * aarray([1n, 2n], 'scalars');\n * ```\n */\nexport function aarray(item, title, inner = () => { }) {\n    if (!Array.isArray(item))\n        throw new TypeError(`\"${title}\" expected array, got type=${typeof item}`);\n    for (let i = 0; i < item.length; i++)\n        inner(item[i], `${title}[${i}]`);\n    return item;\n}\n/**\n * Validates that a value is a byte array.\n * @param value - Value to validate.\n * @param length - Optional exact byte length.\n * @param title - Optional field name.\n * @returns Original byte array.\n * @example\n * Reject non-byte input before passing data into curve code.\n *\n * ```ts\n * abytes(new Uint8Array(1));\n * ```\n */\nexport const abytes = (value, length, title) => abytes_(value, length, title);\n/**\n * Validates that a value is a non-negative safe integer.\n * @param n - Value to validate.\n * @param title - Optional field name.\n * @returns The validated number.\n * @example\n * Validate a numeric length before allocating buffers.\n *\n * ```ts\n * anumber(1);\n * ```\n */\nexport const anumber = anumber_;\n/**\n * Asserts something is a string.\n * @param value - Value to validate.\n * @param title - Label included in thrown errors.\n * @returns The validated string.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate a label string.\n *\n * ```ts\n * astring('example', 'label');\n * ```\n */\nexport function astring(value, title = '') {\n    if (typeof value !== 'string') {\n        const prefix = title && `\"${title}\" `;\n        throw new TypeError(prefix + 'expected string, got type=' + typeof value);\n    }\n    return value;\n}\n/**\n * Asserts something is a plain object-ish value, not null or array.\n * @param value - Value to validate.\n * @param title - Label included in thrown errors.\n * @returns The validated object.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate an options object before checking fields.\n *\n * ```ts\n * aobject({ flag: true });\n * ```\n */\nexport function aobject(value, title = 'object') {\n    if (value === null || typeof value !== 'object' || Array.isArray(value))\n        throw new TypeError(title === 'object'\n            ? 'expected valid options object'\n            : `\"${title}\" expected object, got type=${typeof value}`);\n    return value;\n}\n/**\n * Asserts something is a function.\n * @param value - Value to validate.\n * @param title - Label included in thrown errors.\n * @returns The validated function.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validate a required method before calling it.\n *\n * ```ts\n * afunction(() => true, 'predicate');\n * ```\n */\nexport function afunction(value, title) {\n    if (typeof value !== 'function')\n        throw new TypeError(`\"${title}\" is invalid: expected function, got ${typeof value}`);\n    return value;\n}\n/**\n * Encodes bytes as lowercase hex.\n * @param bytes - Bytes to encode.\n * @returns Lowercase hex string.\n * @example\n * Serialize bytes as hex for logging or fixtures.\n *\n * ```ts\n * bytesToHex(Uint8Array.of(1, 2, 3));\n * ```\n */\nexport const bytesToHex = bytesToHex_;\n/**\n * Concatenates byte arrays.\n * @param arrays - Byte arrays to join.\n * @returns Concatenated bytes.\n * @example\n * Join domain-separated chunks into one buffer.\n *\n * ```ts\n * concatBytes(Uint8Array.of(1), Uint8Array.of(2));\n * ```\n */\nexport const concatBytes = (...arrays) => concatBytes_(...arrays);\n/**\n * Decodes lowercase or uppercase hex into bytes.\n * @param hex - Hex string to decode.\n * @returns Decoded bytes.\n * @example\n * Parse fixture hex into bytes before hashing.\n *\n * ```ts\n * hexToBytes('0102');\n * ```\n */\nexport const hexToBytes = (hex) => hexToBytes_(hex);\n/**\n * Checks whether a value is a Uint8Array.\n * @param a - Value to inspect.\n * @returns `true` when `a` is a Uint8Array.\n * @example\n * Branch on byte input before decoding it.\n *\n * ```ts\n * isBytes(new Uint8Array(1));\n * ```\n */\nexport const isBytes = isBytes_;\n/**\n * Reads random bytes from the platform CSPRNG.\n * @param bytesLength - Number of random bytes to read.\n * @returns Fresh random bytes.\n * @example\n * Generate a random seed for a keypair.\n *\n * ```ts\n * randomBytes(2);\n * ```\n */\nexport const randomBytes = (bytesLength) => randomBytes_(bytesLength);\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\n// Shared error-message prefix builder. Only called on throw paths, so assert\n// success paths never pay for the string concatenation.\nconst atitle = (title) => (title ? `\"${title}\" ` : '');\n/**\n * Validates that a flag is boolean.\n * @param value - Value to validate.\n * @param title - Optional field name.\n * @returns Original value.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Reject non-boolean option flags early.\n *\n * ```ts\n * abool(true);\n * ```\n */\nexport function abool(value, title = '') {\n    if (typeof value !== 'boolean')\n        throw new TypeError(atitle(title) + 'expected boolean, got type=' + typeof value);\n    return value;\n}\n/**\n * Validates that a value is a non-negative bigint or safe integer.\n * @param n - Value to validate.\n * @returns The same validated value.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate one integer-like value before serializing it.\n *\n * ```ts\n * abignumber(1n);\n * ```\n */\nexport function abignumber(n) {\n    if (typeof n === 'bigint') {\n        if (!isPosBig(n))\n            throw new RangeError('positive bigint expected, got ' + n);\n    }\n    else\n        anumber(n);\n    return n;\n}\n/**\n * Validates that a value is a safe integer.\n * @param value - Integer to validate.\n * @param title - Optional field name.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validate a window size before scalar arithmetic uses it.\n *\n * ```ts\n * asafenumber(1);\n * ```\n */\nexport function asafenumber(value, title = '') {\n    if (typeof value !== 'number') {\n        const prefix = title && `\"${title}\" `;\n        throw new TypeError(prefix + 'expected number, got type=' + typeof value);\n    }\n    if (!Number.isSafeInteger(value)) {\n        const prefix = title && `\"${title}\" `;\n        throw new RangeError(prefix + 'expected safe integer, got ' + value);\n    }\n}\n/**\n * Encodes a bigint into even-length big-endian hex.\n * The historical \"unpadded\" name only means \"no fixed-width field padding\"; odd-length hex still\n * gets one leading zero nibble so the result always represents whole bytes.\n * @param num - Number to encode.\n * @returns Big-endian hex string.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Encode a scalar into hex without a `0x` prefix.\n *\n * ```ts\n * numberToHexUnpadded(255n);\n * ```\n */\nexport function numberToHexUnpadded(num) {\n    const hex = abignumber(num).toString(16);\n    return hex.length & 1 ? '0' + hex : hex;\n}\n/**\n * Parses a big-endian hex string into bigint.\n * Accepts odd-length hex through the native `BigInt('0x' + hex)` parser and currently surfaces the\n * same native `SyntaxError` for malformed hex instead of wrapping it in a library-specific error.\n * @param hex - Hex string without `0x`.\n * @returns Parsed bigint value.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Parse a scalar from fixture hex.\n *\n * ```ts\n * hexToNumber('ff');\n * ```\n */\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new TypeError('hex string expected, got ' + typeof hex);\n    return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// BE: Big Endian, LE: Little Endian\n/**\n * Parses big-endian bytes into bigint.\n * @param bytes - Bytes in big-endian order.\n * @returns Parsed bigint value.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Read a scalar encoded in network byte order.\n *\n * ```ts\n * bytesToNumberBE(Uint8Array.of(1, 0));\n * ```\n */\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex_(bytes));\n}\n/**\n * Parses little-endian bytes into bigint.\n * @param bytes - Bytes in little-endian order.\n * @returns Parsed bigint value.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Read a scalar encoded in little-endian form.\n *\n * ```ts\n * bytesToNumberLE(Uint8Array.of(1, 0));\n * ```\n */\nexport function bytesToNumberLE(bytes) {\n    return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));\n}\n/**\n * Encodes a bigint into fixed-length big-endian bytes.\n * @param n - Number to encode.\n * @param len - Output length in bytes. Must be greater than zero.\n * @returns Big-endian byte array.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If a documented runtime validation or state check fails. {@link Error}\n * @example\n * Serialize a scalar into a 32-byte field element.\n *\n * ```ts\n * numberToBytesBE(255n, 2);\n * ```\n */\nexport function numberToBytesBE(n, len) {\n    anumber_(len);\n    if (len === 0)\n        throw new Error('zero output length is invalid');\n    n = abignumber(n);\n    const expectedLen = len * 2;\n    const hex = n.toString(16);\n    // Detect overflow before hex parsing so oversized values don't leak the shared odd-hex error.\n    if (hex.length > expectedLen)\n        throw new RangeError('number is too large');\n    return hexToBytes_(hex.padStart(expectedLen, '0'));\n}\n/**\n * Encodes a bigint into fixed-length little-endian bytes.\n * @param n - Number to encode.\n * @param len - Output length in bytes.\n * @returns Little-endian byte array.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If a documented runtime validation or state check fails. {@link Error}\n * @example\n * Serialize a scalar for little-endian protocols.\n *\n * ```ts\n * numberToBytesLE(255n, 2);\n * ```\n */\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\n/**\n * Encodes a bigint into variable-length big-endian bytes.\n * @param n - Number to encode.\n * @returns Variable-length big-endian bytes.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Serialize a bigint without fixed-width padding.\n *\n * ```ts\n * numberToVarBytesBE(255n);\n * ```\n */\nexport function numberToVarBytesBE(n) {\n    return hexToBytes_(numberToHexUnpadded(abignumber(n)));\n}\n// Compares 2 u8a-s in kinda constant time\n/**\n * Compares two byte arrays in constant-ish time.\n * @param a - Left byte array.\n * @param b - Right byte array.\n * @returns `true` when bytes match.\n * @example\n * Compare two encoded points without early exit.\n *\n * ```ts\n * equalBytes(Uint8Array.of(1), Uint8Array.of(1));\n * ```\n */\nexport function equalBytes(a, b) {\n    a = abytes(a);\n    b = abytes(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 * Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,\n * and Buffer#slice creates mutable copy. Never use Buffers!\n * @param bytes - Bytes to copy.\n * @returns Detached copy.\n * @example\n * Make an isolated copy before mutating serialized bytes.\n *\n * ```ts\n * copyBytes(Uint8Array.of(1, 2, 3));\n * ```\n */\nexport function copyBytes(bytes) {\n    // `Uint8Array.from(...)` would also accept arrays / other typed arrays. Keep this helper strict\n    // because callers use it at byte-validation boundaries before mutating the detached copy.\n    return Uint8Array.from(abytes(bytes));\n}\n/**\n * Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols\n * Should be safe to use for things expected to be ASCII.\n * Returns exact same result as `TextEncoder` for ASCII or throws.\n * @param ascii - ASCII input text.\n * @returns Encoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Encode an ASCII domain-separation tag.\n *\n * ```ts\n * asciiToBytes('ABC');\n * ```\n */\nexport function asciiToBytes(ascii) {\n    if (typeof ascii !== 'string')\n        throw new TypeError('ascii string expected, got ' + typeof ascii);\n    return Uint8Array.from(ascii, (c, i) => {\n        const charCode = c.charCodeAt(0);\n        if (c.length !== 1 || charCode > 127) {\n            throw new RangeError(`string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`);\n        }\n        return charCode;\n    });\n}\n/**\n * Checks whether n is non-negative bigint. Historical name.\n * @param n - candidate value\n * @returns `true` when the value is bigint and 0 or larger\n * @example\n * Check a candidate scalar before range validation.\n *\n * ```ts\n * isPosBig(2n);\n * ```\n */\nexport function isPosBig(n) {\n    return typeof n === 'bigint' && _0n <= n;\n}\n/**\n * Checks whether a bigint lies inside a half-open range.\n * @param n - Candidate value.\n * @param min - Inclusive lower bound.\n * @param max - Exclusive upper bound.\n * @returns `true` when the value is inside the range.\n * @example\n * Check whether a candidate scalar fits the field order.\n *\n * ```ts\n * inRange(2n, 1n, 3n);\n * ```\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: upper bound is exclusive.\n * @param title - Value label for error messages.\n * @param n - Candidate value.\n * @param min - Inclusive lower bound.\n * @param max - Exclusive upper bound.\n * Wrong-type inputs are not separated from out-of-range values here: they still flow through the\n * shared `RangeError` path because this is only a throwing wrapper around `inRange(...)`.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Assert that a bigint stays within one half-open range.\n *\n * ```ts\n * aInRange('x', 2n, 1n, 256n);\n * ```\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 RangeError('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n * TODO: merge with nLength in modular\n * @param n - Value to inspect.\n * @returns Bit length.\n * @throws If the value is negative. {@link Error}\n * @example\n * Measure the bit length of a scalar before serialization.\n *\n * ```ts\n * bitLen(8n);\n * ```\n */\nexport function bitLen(n) {\n    // Size callers in this repo only use non-negative orders / scalars, so negative inputs are a\n    // contract bug and must not silently collapse to zero bits.\n    if (n < _0n)\n        throw new Error('expected non-negative bigint, got ' + n);\n    // Native radix conversion beats a shift loop at every size, and the loop is quadratic in bits.\n    return n === _0n ? 0 : n.toString(2).length;\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 * @param n - Source value.\n * @param pos - Bit position. Negative positions are passed through to raw\n *   bigint shift semantics; because the mask is built as `1n << pos`,\n *   they currently collapse to `0n` and make the helper a no-op.\n * @returns Bit as bigint.\n * @example\n * Gets single bit at position.\n *\n * ```ts\n * bitGet(5n, 0);\n * ```\n */\nexport function bitGet(n, pos) {\n    if (typeof n !== 'bigint')\n        throw new TypeError('\"n\" expected bigint, got type=' + typeof n);\n    asafenumber(pos, 'pos');\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n * @param n - Source value.\n * @param pos - Bit position. Negative positions are passed through to raw bigint shift semantics,\n *   so they currently behave like left shifts.\n * @param value - Whether the bit should be set.\n * @returns Updated bigint.\n * @example\n * Sets single bit at position.\n *\n * ```ts\n * bitSet(0n, 1, true);\n * ```\n */\nexport function bitSet(n, pos, value) {\n    if (typeof n !== 'bigint')\n        throw new TypeError('\"n\" expected bigint, got type=' + typeof n);\n    asafenumber(pos, 'pos');\n    abool(value, 'value');\n    const mask = _1n << BigInt(pos);\n    // Clearing needs AND-not here; OR with zero leaves an already-set bit untouched.\n    return value ? n | mask : n & ~mask;\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 * @param n - Number of bits. Negative widths are currently passed through to raw bigint shift\n *   semantics and therefore produce `-1n`.\n * @returns Bitmask value.\n * @example\n * Calculate mask for N bits.\n *\n * ```ts\n * bitMask(4);\n * ```\n */\nexport const bitMask = (n) => {\n    asafenumber(n, 'n');\n    return (_1n << BigInt(n)) - _1n;\n};\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @param hashLen - Hash output size in bytes. Callers are expected to pass a positive length; `0`\n *   is not rejected here and would make the internal generate loop non-progressing.\n * @param qByteLen - Requested output size in bytes. Callers are expected to pass a positive length.\n * @param hmacFn - HMAC implementation.\n * @returns Function that will call DRBG until the predicate returns anything\n *   other than `undefined`.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Build a deterministic nonce generator for RFC6979-style signing.\n *\n * ```ts\n * import { createHmacDrbg } from '@noble/curves/utils.js';\n * import { hmac } from '@noble/hashes/hmac.js';\n * import { sha256 } from '@noble/hashes/sha2.js';\n * const hmacFn = (key: Uint8Array, msg: Uint8Array) => hmac(sha256, key, msg);\n * const drbg = createHmacDrbg(32, 32, hmacFn);\n * const seed = new Uint8Array(32);\n * drbg(seed, (bytes) => bytes);\n * ```\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    anumber_(hashLen, 'hashLen');\n    anumber_(qByteLen, 'qByteLen');\n    if (typeof hmacFn !== 'function')\n        throw new TypeError('hmacFn must be a function');\n    // creates Uint8Array\n    const u8n = (len) => new Uint8Array(len);\n    const NULL = Uint8Array.of();\n    const byte0 = Uint8Array.of(0x00);\n    const byte1 = Uint8Array.of(0x01);\n    const _maxDrbgIters = 1000;\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8).\n    // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 signatures.\n    let v = u8n(hashLen);\n    // Steps B and C of RFC6979 3.2.\n    let k = u8n(hashLen);\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    // hmac(k)(v, ...values)\n    const h = (...msgs) => hmacFn(k, concatBytes(v, ...msgs));\n    const reseed = (seed = NULL) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(byte0, seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(byte1, 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++ >= _maxDrbgIters)\n            throw new Error('drbg: tried max amount of iterations');\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 the predicate accepts a candidate.\n        // Falsy values like 0 are valid outputs.\n        while ((res = pred(gen())) === undefined)\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n/**\n * Validates declared required and optional field types on a plain object.\n * Extra keys are intentionally ignored because many callers validate only the subset they use from\n * richer option bags or runtime objects.\n * This walks field schemas and formats detailed errors, so avoid it on hot paths; use direct\n * one-line guards such as `aobject()`, `afunction()`, `abool()`, or `asafenumber()` instead.\n * @param object - Object to validate.\n * @param fields - Required field types.\n * @param optFields - Optional field types.\n * @param title - Object label included in thrown errors.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Check user options before building a curve helper.\n *\n * ```ts\n * validateObject({ flag: true }, { flag: 'boolean' });\n * ```\n */\nexport function validateObject(object, fields = {}, optFields = {}, title = 'object') {\n    aobject(object, title);\n    aobject(fields, 'fields');\n    aobject(optFields, 'optFields');\n    function checkField(fieldName, expectedType, isOpt) {\n        const label = title === 'object' ? `param \"${String(fieldName)}\"` : `\"${title}.${String(fieldName)}\"`;\n        // Config fields must be explicit own properties. Optional inherited values are rejected too\n        // because callers keep reading the same options object after validation.\n        const val = object[fieldName];\n        // Runtime objects such as Field instances intentionally satisfy required method slots\n        // via their shared prototype.\n        if (!Object.hasOwn(object, fieldName) &&\n            (isOpt ? val !== undefined : expectedType !== 'function')) {\n            throw new TypeError(`${label} is invalid: expected own property`);\n        }\n        if (isOpt && val === undefined)\n            return;\n        const current = typeof val;\n        if (current !== expectedType || val === null)\n            throw new TypeError(`${label} is invalid: expected ${expectedType}, got ${current}`);\n    }\n    const iter = (f, isOpt) => Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n    iter(fields, false);\n    iter(optFields, true);\n}\n/**\n * Throws not implemented error.\n * @returns Never returns.\n * @throws If the unfinished code path is reached. {@link Error}\n * @example\n * Surface the placeholder error from an unfinished code path.\n *\n * ```ts\n * try {\n *   notImplemented();\n * } catch {}\n * ```\n */\nexport const notImplemented = () => {\n    throw new Error('not implemented');\n};\n", "/**\n * Utils for modular division and fields.\n * Field over 11 is a finite (Galois) field is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { aarray, abool, abytes, afunction, anumber, aobject, asafenumber, bitLen, bytesToNumberBE, bytesToNumberLE, numberToBytesBE, numberToBytesLE, } from \"../utils.js\";\n// Numbers aren't used in x25519 / x448 builds\n// prettier-ignore\nconst _0n = /* @__PURE__ */ BigInt(0), _1n = /* @__PURE__ */ BigInt(1), _2n = /* @__PURE__ */ BigInt(2);\n// prettier-ignore\nconst _3n = /* @__PURE__ */ BigInt(3), _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5);\n// prettier-ignore\nconst _7n = /* @__PURE__ */ BigInt(7), _8n = /* @__PURE__ */ BigInt(8), _9n = /* @__PURE__ */ BigInt(9);\nconst _15n = /* @__PURE__ */ BigInt(15), _16n = /* @__PURE__ */ BigInt(16);\n// 2^64: exponents below this use plain square-and-multiply in pow()/FpPow(); the windowed path's\n// table build (14 multiplications) only pays off for longer exponents (break-even ~50 bits).\nconst POW_WINDOWED_MIN = /* @__PURE__ */ BigInt('0x10000000000000000');\n/**\n * @param a - Dividend value.\n * @param b - Positive modulus.\n * @returns Reduced value in `[0, b)` only when `b` is positive.\n * @throws If the modulus is not positive. {@link Error}\n * @example\n * Normalize a bigint into one field residue.\n *\n * ```ts\n * mod(-1n, 5n);\n * ```\n */\nexport function mod(a, b) {\n    if (b <= _0n)\n        throw new Error('mod: expected positive modulus, got ' + b);\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to a power with modular reduction.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * Low-level helper: callers that need canonical residues must pass a valid `num` for the chosen\n * modulus instead of relying on the `power===0/1` fast paths to normalize it.\n * @param num - Base value.\n * @param power - Exponent value.\n * @param modulo - Reduction modulus.\n * @returns Modular exponentiation result.\n * @throws If the modulus or exponent is invalid. {@link Error}\n * @example\n * Raise one bigint to a modular power.\n *\n * ```ts\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n * ```\n */\nexport function pow(num, power, modulo) {\n    if (modulo <= _1n)\n        throw new Error('pow: expected modulus > 1, got ' + modulo);\n    // Non-bigint exponents coerce every comparison below to false and would silently return 1.\n    if (typeof power !== 'bigint')\n        throw new TypeError('invalid exponent: expected bigint, got ' + typeof power);\n    if (power < _0n)\n        throw new Error('invalid exponent, negatives unsupported');\n    if (power === _0n)\n        return _1n;\n    if (power === _1n)\n        return num;\n    let d = num % modulo;\n    if (d < _0n)\n        d += modulo;\n    // Control flow in both branches below depends only on the exponent, never on `num` \u2014 invertCt()\n    // relies on that for its (public-exponent) secret-independence guarantee.\n    if (power < POW_WINDOWED_MIN) {\n        // Square-and-multiply: cheaper than the windowed path for short exponents.\n        let p = _1n;\n        while (power > _0n) {\n            if (power & _1n)\n                p = (p * d) % modulo;\n            d = (d * d) % modulo;\n            power >>= _1n;\n        }\n        return p;\n    }\n    // Fixed 4-bit windows, MSB-first: a 14-multiplication table drops per-window cost to <1\n    // multiplication (vs ~2 per window for square-and-multiply), ~25-30% faster for the dense\n    // 256-bit exponents of sqrt / Legendre / invertCt.\n    const digits = [];\n    while (power > _0n) {\n        digits.push(Number(power & _15n));\n        power >>= _4n;\n    }\n    const table = new Array(16);\n    table[0] = _1n;\n    table[1] = d;\n    for (let i = 2; i < 16; i++)\n        table[i] = (table[i - 1] * d) % modulo;\n    let p = table[digits[digits.length - 1]]; // top digit is nonzero: the loop above stops on 0\n    for (let w = digits.length - 2; w >= 0; w--) {\n        p = (p * p) % modulo;\n        p = (p * p) % modulo;\n        p = (p * p) % modulo;\n        p = (p * p) % modulo;\n        const digit = digits[w];\n        if (digit !== 0)\n            p = (p * table[digit]) % modulo;\n    }\n    return p;\n}\n/**\n * Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)`.\n * Low-level helper: callers that need canonical residues must pass a valid `x` for the chosen\n * modulus; the `power===0` fast path intentionally returns the input unchanged.\n * @param x - Base value.\n * @param power - Number of squarings.\n * @param modulo - Reduction modulus.\n * @returns Repeated-squaring result.\n * @throws If the exponent is negative. {@link Error}\n * @example\n * Apply repeated squaring inside one field.\n *\n * ```ts\n * pow2(3n, 2n, 11n);\n * ```\n */\nexport function pow2(x, power, modulo) {\n    if (modulo <= _1n)\n        throw new Error('pow2: expected modulus > 1, got ' + modulo);\n    if (power < _0n)\n        throw new Error('pow2: expected non-negative exponent, got ' + power);\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n/**\n * Inverses number over modulo.\n * Implemented using the {@link https://brilliant.org/wiki/extended-euclidean-algorithm/ | extended Euclidean algorithm}.\n * @param number - Value to invert.\n * @param modulo - Modulus greater than 1.\n * @returns Multiplicative inverse.\n * @throws If the modulus is invalid or the inverse does not exist. {@link Error}\n * @example\n * Compute one modular inverse with the extended Euclidean algorithm.\n *\n * ```ts\n * invert(3n, 11n);\n * ```\n */\nexport function invert(number, modulo) {\n    if (number === _0n)\n        throw new Error('invert: expected non-zero number');\n    // modulo = 1 is the zero ring: gcd(x, 1) = 1 makes the loop below \"succeed\" and return the\n    // useless inverse 0. Reject it like pow() and invertCt() do.\n    if (modulo <= _1n)\n        throw new Error('invert: expected modulus > 1, got ' + modulo);\n    // This is variable-time: the loop count depends on `number`. For a secret-independent\n    // (Fermat) alternative over a prime modulus, see {@link invertCt} (~4x slower).\n    let a = mod(number, modulo);\n    let b = modulo;\n    // Only the B\u00E9zout coefficient of `number` (x/u chain) is tracked; the coefficient of `modulo`\n    // never affects the output, so it is not computed.\n    // prettier-ignore\n    let x = _0n, u = _1n;\n    while (a !== _0n) {\n        const q = b / a;\n        const r = b - a * q;\n        const m = x - u * q;\n        // prettier-ignore\n        b = a, a = r, x = u, u = m;\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 * Inverses number over modulo using Fermat's little theorem: `a^(p-2) \u2261 a\u207B\u00B9 (mod p)`.\n *\n * Unlike {@link invert} (extended Euclidean), the exponent `p-2` is a public constant, so the\n * underlying square-and-multiply has the same control flow for every secret `a`: there is no\n * data-dependent branching or loop count that could leak `a` through timing (e.g. Minerva-style\n * ECDSA nonce-inversion attacks). This is only \"algorithmically\" constant-time \u2014 JS bigint\n * multiplication/reduction is still value-dependent \u2014 and it is roughly 4x slower than\n * {@link invert}.\n *\n * REQUIRES a prime modulus; Fermat's theorem does not hold otherwise. The result is verified to be\n * a real inverse, so a non-prime modulus (or a non-invertible input) fails closed with an error\n * instead of returning a wrong value.\n * @param a - Value to invert.\n * @param prime - Prime modulus.\n * @returns Multiplicative inverse in `[1, prime)`.\n * @throws If the modulus is below 2, the input reduces to zero, or the inverse does not exist.\n *   {@link Error}\n * @example\n * Compute one modular inverse without secret-dependent branching.\n *\n * ```ts\n * invertCt(3n, 11n); // 4n, since 3 * 4 = 12 \u2261 1 (mod 11)\n * ```\n */\nexport function invertCt(a, prime) {\n    if (prime <= _1n)\n        throw new Error('invertCt: expected prime modulus > 1, got ' + prime);\n    const an = mod(a, prime);\n    if (an === _0n)\n        throw new Error('invertCt: expected non-zero number');\n    // Exponent (prime - 2) is public, so FpPow's square-and-multiply is secret-independent.\n    const inverse = pow(an, prime - _2n, prime);\n    // O(1) safety net: verifies the inverse and rejects composite moduli where a^(p-2) is not one.\n    if (mod(an * inverse, prime) !== _1n)\n        throw new Error('invertCt: does not exist');\n    return inverse;\n}\nfunction assertIsSquare(Fp, root, n) {\n    const F = Fp;\n    if (!F.eql(F.sqr(root), n))\n        throw new Error('Cannot find square root');\n}\n// The Legendre symbol and every sqrt variant here are only defined over an odd (prime) modulus.\n// An even ORDER makes their integer divisions \u2014 (p-1)/2, (p+1)/4, (p-5)/8, (p+7)/16 \u2014 truncate and\n// silently return a wrong result, so reject it explicitly at the entry points instead. This is a\n// cheap necessary-condition check, not a primality test (composite odd moduli are caught later by\n// the Legendre-result / assertIsSquare checks).\nfunction aoddModulus(order, fnName) {\n    if ((order & _1n) === _0n)\n        throw new Error(fnName + ': expected odd modulus, got ' + order);\n}\n// Not all roots are possible! Example which will throw:\n// const NUM =\n// n = 72057594037927816n;\n// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));\nfunction sqrt3mod4(Fp, n) {\n    const F = Fp;\n    const p1div4 = (F.ORDER + _1n) / _4n;\n    const root = F.pow(n, p1div4);\n    assertIsSquare(F, root, n);\n    return root;\n}\n// Equivalent `q = 5 (mod 8)` square-root formula (Atkin-style), not the RFC Appendix I.2 CMOV\n// pseudocode verbatim.\nfunction sqrt5mod8(Fp, n) {\n    const F = Fp;\n    const p5div8 = (F.ORDER - _5n) / _8n;\n    const n2 = F.mul(n, _2n);\n    const v = F.pow(n2, p5div8);\n    const nv = F.mul(n, v);\n    const i = F.mul(F.mul(nv, _2n), v);\n    const root = F.mul(nv, F.sub(i, F.ONE));\n    assertIsSquare(F, root, n);\n    return root;\n}\n// Based on RFC9380, Kong algorithm\n// prettier-ignore\nfunction sqrt9mod16(P) {\n    const Fp_ = Field(P);\n    const tn = tonelliShanks(P);\n    const c1 = tn(Fp_, Fp_.neg(Fp_.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n    const c2 = tn(Fp_, c1); //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n    const c3 = tn(Fp_, Fp_.neg(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    return ((Fp, n) => {\n        const F = Fp;\n        let tv1 = F.pow(n, c4); //  1. tv1 = x^c4\n        let tv2 = F.mul(tv1, c1); //  2. tv2 = c1 * tv1\n        const tv3 = F.mul(tv1, c2); //  3. tv3 = c2 * tv1\n        const tv4 = F.mul(tv1, c3); //  4. tv4 = c3 * tv1\n        const e1 = F.eql(F.sqr(tv2), n); //  5.  e1 = (tv2^2) == x\n        const e2 = F.eql(F.sqr(tv3), n); //  6.  e2 = (tv3^2) == x\n        tv1 = F.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        tv2 = F.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        const e3 = F.eql(F.sqr(tv2), n); //  9.  e3 = (tv2^2) == x\n        const root = F.cmov(tv1, tv2, e3); // 10.  z = CMOV(tv1, tv2, e3)   # Select sqrt from tv1 & tv2\n        assertIsSquare(F, root, n);\n        return root;\n    });\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * This implementation is variable-time: it searches data-dependently for the first non-residue `Z`\n * and for the smallest `i` in the main loop, unlike RFC 9380 Appendix I.4's constant-time shape.\n * 1. {@link https://eprint.iacr.org/2012/685.pdf | eprint 2012/685}, page 12\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * @param P - field order\n * @returns function that takes field Fp (created from P) and number n\n * @throws If the field is too small, non-prime, or the square root does not exist. {@link Error}\n * @example\n * Construct a square-root helper for primes that need Tonelli-Shanks.\n *\n * ```ts\n * import { Field, tonelliShanks } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const sqrt = tonelliShanks(17n)(Fp, 4n);\n * ```\n */\nexport function tonelliShanks(P) {\n    // Initialization (precomputation).\n    // Caching initialization could boost perf by 7%.\n    if (P < _3n)\n        throw new Error('sqrt is not defined for small field');\n    aoddModulus(P, 'tonelliShanks');\n    // Factor P - 1 = Q * 2^S, where Q is odd\n    let Q = P - _1n;\n    let S = 0;\n    while (Q % _2n === _0n) {\n        Q /= _2n;\n        S++;\n    }\n    // Find the first quadratic non-residue Z >= 2\n    let Z = _2n;\n    const _Fp = Field(P);\n    while (FpLegendre(_Fp, Z) === 1) {\n        // Basic primality test for P. After x iterations, chance of\n        // not finding quadratic non-residue is 2^x, so 2^1000.\n        if (Z++ > 1000)\n            throw new Error('Cannot find square root: probably non-prime P');\n    }\n    // Fast-path; usually done before Z, but we do \"primality test\".\n    if (S === 1)\n        return sqrt3mod4;\n    // Slow-path\n    // TODO: test on Fp2 and others\n    let cc = _Fp.pow(Z, Q); // c = z^Q\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        const F = Fp;\n        if (F.is0(n))\n            return n;\n        // Check if n is a quadratic residue using Legendre symbol\n        if (FpLegendre(F, n) !== 1)\n            throw new Error('Cannot find square root');\n        // Initialize variables for the main loop\n        let M = S;\n        let c = F.mul(F.ONE, cc); // c = z^Q, move cc from field _Fp into field Fp\n        let t = F.pow(n, Q); // t = n^Q, first guess at the fudge factor\n        let R = F.pow(n, Q1div2); // R = n^((Q+1)/2), first guess at the square root\n        // Main loop\n        // while t != 1\n        while (!F.eql(t, F.ONE)) {\n            // Unreachable over a genuine field (no zero divisors; n=0 already returned above). A zero t\n            // means composite ORDER, where a fabricated root would be wrong: fail closed instead.\n            if (F.is0(t))\n                throw new Error('Cannot find square root: probably non-prime P');\n            let i = 1;\n            // Find the smallest i >= 1 such that t^(2^i) \u2261 1 (mod P)\n            let t_tmp = F.sqr(t); // t^(2^1)\n            while (!F.eql(t_tmp, F.ONE)) {\n                i++;\n                t_tmp = F.sqr(t_tmp); // t^(2^2)...\n                if (i === M)\n                    throw new Error('Cannot find square root');\n            }\n            // Calculate the exponent for b: 2^(M - i - 1)\n            const exponent = _1n << BigInt(M - i - 1); // bigint is important\n            const b = F.pow(c, exponent); // b = 2^(M - i - 1)\n            // Update variables\n            M = i;\n            c = F.sqr(b); // c = b^2\n            t = F.mul(t, c); // t = (t * b^2)\n            R = F.mul(R, b); // R = R*b\n        }\n        return R;\n    };\n}\n/**\n * Square root for a finite field. Will try optimized versions first:\n *\n * 1. P \u2261 3 (mod 4)\n * 2. P \u2261 5 (mod 8)\n * 3. P \u2261 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n *\n * Different algorithms can give different roots, it is up to user to decide which one they want.\n * For example there is FpSqrtOdd/FpSqrtEven to choose a root by oddness\n * (used for hash-to-curve).\n * @param P - Field order.\n * @returns Square-root helper. The generic fallback inherits Tonelli-Shanks' variable-time\n *   behavior and this selector assumes prime-field-style integer moduli.\n * @throws If the field is unsupported or the square root does not exist. {@link Error}\n * @example\n * Choose the square-root helper appropriate for one field modulus.\n *\n * ```ts\n * import { Field, FpSqrt } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const sqrt = FpSqrt(17n)(Fp, 4n);\n * ```\n */\nexport function FpSqrt(P) {\n    aoddModulus(P, 'Fp.sqrt');\n    // P \u2261 3 (mod 4) => \u221An = n^((P+1)/4)\n    if (P % _4n === _3n)\n        return sqrt3mod4;\n    // P \u2261 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf\n    if (P % _8n === _5n)\n        return sqrt5mod8;\n    // P \u2261 9 (mod 16) => Kong algorithm, page 11 of https://eprint.iacr.org/2012/685.pdf (algorithm 4)\n    if (P % _16n === _9n)\n        return sqrt9mod16(P);\n    // Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n/**\n * @param num - Value to inspect.\n * @param modulo - Field modulus.\n * @returns `true` when the least-significant little-endian bit is set.\n * @throws If the modulus is invalid for `mod(...)`. {@link Error}\n * @example\n * Inspect the low bit used by little-endian sign conventions.\n *\n * ```ts\n * isNegativeLE(3n, 11n);\n * ```\n */\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\n// Arithmetic-only subset checked by validateField(). This is intentionally not the full runtime\n// IField contract: helpers like `isValidNot0`, `invertBatch`, `toBytes`, `fromBytes`, `cmov`, and\n// field-specific extras like `isOdd` are left to the callers that actually need them.\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\n/**\n * @param field - Field implementation.\n * @returns Validated field. This only checks the arithmetic subset needed by generic helpers; it\n *   does not guarantee full runtime-method coverage for serialization, batching, `cmov`, or\n *   field-specific extras beyond positive `BYTES` / `BITS`.\n * @throws If the field shape or numeric metadata are invalid. {@link Error}\n * @example\n * Check that a field implementation exposes the operations curve code expects.\n *\n * ```ts\n * import { Field, validateField } from '@noble/curves/abstract/modular.js';\n * const Fp = validateField(Field(17n));\n * ```\n */\nexport function validateField(field) {\n    aobject(field, 'field');\n    if (typeof field.ORDER !== 'bigint')\n        throw new TypeError('param \"ORDER\" is invalid: expected bigint, got ' + typeof field.ORDER);\n    // Runtime field implementations must expose real integer byte/bit sizes; fractional / NaN /\n    // infinite metadata breaks encoders and caches.\n    asafenumber(field.BYTES, 'BYTES');\n    asafenumber(field.BITS, 'BITS');\n    for (const name of FIELD_FIELDS)\n        afunction(field[name], 'field.' + name);\n    // Runtime field implementations must expose positive byte/bit sizes; zero leaks through the\n    // numeric shape checks above but still breaks encoding helpers and cached-length assumptions.\n    if (field.BYTES < 1 || field.BITS < 1)\n        throw new Error('invalid field: expected BYTES/BITS > 0');\n    if (field.ORDER <= _1n)\n        throw new Error('invalid field: expected ORDER > 1, got ' + field.ORDER);\n    return field;\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 * @param Fp - Field implementation.\n * @param num - Base value.\n * @param power - Exponent value.\n * @returns Powered field element.\n * @throws If the exponent is negative. {@link Error}\n * @example\n * Raise one field element to a public exponent.\n *\n * ```ts\n * import { Field, FpPow } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const x = FpPow(Fp, 3n, 5n);\n * ```\n */\nexport function FpPow(Fp, num, power) {\n    validateField(Fp);\n    const F = Fp;\n    // Non-bigint exponents (e.g. an accidental field element) coerce every comparison below to\n    // false and would silently return ONE.\n    if (typeof power !== 'bigint')\n        throw new TypeError('invalid exponent: expected bigint, got ' + typeof power);\n    if (power < _0n)\n        throw new Error('invalid exponent, negatives unsupported');\n    if (power === _0n)\n        return F.ONE;\n    if (power === _1n)\n        return num;\n    if (power < POW_WINDOWED_MIN) {\n        // Square-and-multiply: cheaper than the windowed path for short exponents (e.g. poseidon\n        // sbox x^5), which would waste the 14-multiplication table build.\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    // Fixed 4-bit windows, MSB-first \u2014 same shape as pow() above, over generic field ops.\n    // Speeds up dense long exponents (extension-field sqrt / Legendre, e.g. Fp2 decompression).\n    const digits = [];\n    while (power > _0n) {\n        digits.push(Number(power & _15n));\n        power >>= _4n;\n    }\n    const table = new Array(16);\n    table[0] = F.ONE;\n    table[1] = num;\n    for (let i = 2; i < 16; i++)\n        table[i] = F.mul(table[i - 1], num);\n    let p = table[digits[digits.length - 1]]; // top digit is nonzero: the loop above stops on 0\n    for (let w = digits.length - 2; w >= 0; w--) {\n        p = F.sqr(F.sqr(F.sqr(F.sqr(p))));\n        const digit = digits[w];\n        if (digit !== 0)\n            p = F.mul(p, table[digit]);\n    }\n    return p;\n}\nexport function FpInvertBatch(Fp, nums, passZero = false) {\n    validateField(Fp);\n    aarray(nums, 'nums');\n    abool(passZero, 'passZero');\n    const F = Fp;\n    const inverted = new Array(nums.length).fill(passZero ? F.ZERO : undefined);\n    // Walk from first to last, multiply them by each other MOD p\n    const multipliedAcc = nums.reduce((acc, num, i) => {\n        if (F.is0(num))\n            return acc;\n        inverted[i] = acc;\n        return F.mul(acc, num);\n    }, F.ONE);\n    // Invert last element\n    const invertedAcc = F.inv(multipliedAcc);\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        // Non-zero `num` means the forward pass already stored a defined prefix product at index i.\n        inverted[i] = F.mul(acc, inverted[i]);\n        return F.mul(acc, num);\n    }, invertedAcc);\n    return inverted;\n}\n/**\n * @param Fp - Field implementation.\n * @param lhs - Dividend value.\n * @param rhs - Divisor value.\n * @returns Division result.\n * @throws If the divisor is non-invertible. {@link Error}\n * @example\n * Divide one field element by another.\n *\n * ```ts\n * import { Field, FpDiv } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const x = FpDiv(Fp, 6n, 3n);\n * ```\n */\nexport function FpDiv(Fp, lhs, rhs) {\n    validateField(Fp);\n    const F = Fp;\n    return F.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, F.ORDER) : F.inv(rhs));\n}\n/**\n * Legendre symbol.\n * Legendre constant is used to calculate Legendre symbol (a | p)\n * which denotes the value of a^((p-1)/2) (mod p).\n *\n * * (a | p) \u2261 1    if a is a square (mod p), quadratic residue\n * * (a | p) \u2261 -1   if a is not a square (mod p), quadratic non residue\n * * (a | p) \u2261 0    if a \u2261 0 (mod p)\n * @param Fp - Field implementation.\n * @param n - Value to inspect.\n * @returns Legendre symbol.\n * @throws If the powered value does not match a valid Legendre symbol. {@link Error}\n * @example\n * Compute the Legendre symbol of one field element.\n *\n * ```ts\n * import { Field, FpLegendre } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const symbol = FpLegendre(Fp, 4n);\n * ```\n */\nexport function FpLegendre(Fp, n) {\n    validateField(Fp);\n    const F = Fp;\n    aoddModulus(F.ORDER, 'FpLegendre');\n    // We can use 3rd argument as optional cache of this value\n    // but seems unneeded for now. The operation is very fast.\n    const p1mod2 = (F.ORDER - _1n) / _2n;\n    const powered = F.pow(n, p1mod2);\n    const yes = F.eql(powered, F.ONE);\n    const zero = F.eql(powered, F.ZERO);\n    const no = F.eql(powered, F.neg(F.ONE));\n    if (!yes && !zero && !no)\n        throw new Error('invalid Legendre symbol result');\n    return yes ? 1 : zero ? 0 : -1;\n}\n/**\n * @param Fp - Field implementation.\n * @param n - Value to inspect.\n * @returns `true` when `Fp.sqrt(n)` exists. This includes `0`, even though strict \"quadratic\n *   residue\" terminology often reserves that name for the non-zero square class.\n * @throws If the field returns an invalid Legendre symbol value. {@link Error}\n * @example\n * Check whether one field element has a square root in the field.\n *\n * ```ts\n * import { Field, FpIsSquare } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const isSquare = FpIsSquare(Fp, 4n);\n * ```\n */\nexport function FpIsSquare(Fp, n) {\n    const l = FpLegendre(Fp, n);\n    // Zero is a square too: 0 = 0^2, and Fp.sqrt(0) already returns 0.\n    return l !== -1;\n}\n/**\n * @param n - Curve order. Callers are expected to pass a positive order.\n * @param nBitLength - Optional cached bit length. Callers are expected to pass a positive cached\n *   value when overriding the derived bit length.\n * @returns Byte and bit lengths.\n * @throws If the order or cached bit length is invalid. {@link Error}\n * @example\n * Measure the encoding sizes needed for one modulus.\n *\n * ```ts\n * nLength(255n);\n * ```\n */\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    if (nBitLength !== undefined)\n        anumber(nBitLength);\n    if (n <= _0n)\n        throw new Error('invalid n length: expected positive n, got ' + n);\n    if (nBitLength !== undefined && nBitLength < 1)\n        throw new Error('invalid n length: expected positive bit length, got ' + nBitLength);\n    const bits = bitLen(n);\n    // Cached bit lengths smaller than ORDER would truncate serialized scalars/elements and poison\n    // any math that relies on the derived field metadata.\n    if (nBitLength !== undefined && nBitLength < bits)\n        throw new Error(`invalid n length: expected nBitLength (${nBitLength}) >= bitLen(n) (${bits})`);\n    const _nBitLength = nBitLength !== undefined ? nBitLength : bits;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n// Keep the lazy sqrt cache off-instance so Field(...) can return a frozen object. Otherwise the\n// cached helper write would keep the field surface externally mutable.\nconst FIELD_SQRT = new WeakMap();\nclass _Field {\n    ORDER;\n    BITS;\n    BYTES;\n    isLE;\n    ZERO = _0n;\n    ONE = _1n;\n    _lengths;\n    _mod;\n    constructor(ORDER, opts = {}) {\n        // ORDER <= 1 is degenerate: ONE would not be a valid field element and helpers like pow/inv\n        // would stop modeling field arithmetic.\n        if (ORDER <= _1n)\n            throw new Error('invalid field: expected ORDER > 1, got ' + ORDER);\n        let _nbitLength = undefined;\n        this.isLE = false;\n        if (opts != null && typeof opts === 'object') {\n            // Cached bit lengths are trusted here and should already be positive / consistent with ORDER.\n            if (typeof opts.BITS === 'number')\n                _nbitLength = opts.BITS;\n            if (typeof opts.sqrt === 'function')\n                // `_Field.prototype` is frozen below, so custom sqrt hooks must become own properties\n                // explicitly instead of relying on writable prototype shadowing via assignment.\n                Object.defineProperty(this, 'sqrt', { value: opts.sqrt, enumerable: true });\n            if (typeof opts.isLE === 'boolean')\n                this.isLE = opts.isLE;\n            if (opts.allowedLengths)\n                this._lengths = Object.freeze(opts.allowedLengths.slice());\n            if (typeof opts.modFromBytes === 'boolean')\n                this._mod = opts.modFromBytes;\n        }\n        const { nBitLength, nByteLength } = nLength(ORDER, _nbitLength);\n        if (nByteLength > 2048)\n            throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n        this.ORDER = ORDER;\n        this.BITS = nBitLength;\n        this.BYTES = nByteLength;\n        Object.freeze(this);\n    }\n    create(num) {\n        return mod(num, this.ORDER);\n    }\n    isValid(num) {\n        if (typeof num !== 'bigint')\n            throw new TypeError('invalid field element: expected bigint, got ' + typeof num);\n        return _0n <= num && num < this.ORDER; // 0 is valid element, but it's not invertible\n    }\n    is0(num) {\n        return num === _0n;\n    }\n    // is valid and invertible\n    isValidNot0(num) {\n        return !this.is0(num) && this.isValid(num);\n    }\n    isOdd(num) {\n        return (num & _1n) === _1n;\n    }\n    neg(num) {\n        return mod(-num, this.ORDER);\n    }\n    eql(lhs, rhs) {\n        return lhs === rhs;\n    }\n    sqr(num) {\n        return mod(num * num, this.ORDER);\n    }\n    add(lhs, rhs) {\n        return mod(lhs + rhs, this.ORDER);\n    }\n    sub(lhs, rhs) {\n        return mod(lhs - rhs, this.ORDER);\n    }\n    mul(lhs, rhs) {\n        return mod(lhs * rhs, this.ORDER);\n    }\n    pow(num, power) {\n        return pow(num, power, this.ORDER);\n    }\n    div(lhs, rhs) {\n        return mod(lhs * invert(rhs, this.ORDER), this.ORDER);\n    }\n    // Same as above, but doesn't normalize\n    sqrN(num) {\n        return num * num;\n    }\n    addN(lhs, rhs) {\n        return lhs + rhs;\n    }\n    subN(lhs, rhs) {\n        return lhs - rhs;\n    }\n    mulN(lhs, rhs) {\n        return lhs * rhs;\n    }\n    inv(num) {\n        return invert(num, this.ORDER);\n    }\n    sqrt(num) {\n        // Caching sqrt helpers speeds up sqrt9mod16 by 5x and Tonelli-Shanks by about 10% without keeping\n        // the field instance itself mutable.\n        let sqrt = FIELD_SQRT.get(this);\n        if (!sqrt)\n            FIELD_SQRT.set(this, (sqrt = FpSqrt(this.ORDER)));\n        return sqrt(this, num);\n    }\n    toBytes(num) {\n        // Serialize fixed-width limbs without re-validating the field range. Callers that need a\n        // canonical encoding must pass a valid element; some protocols intentionally serialize raw\n        // residues here and reduce or validate them elsewhere.\n        return this.isLE ? numberToBytesLE(num, this.BYTES) : numberToBytesBE(num, this.BYTES);\n    }\n    fromBytes(bytes, skipValidation = false) {\n        abytes(bytes);\n        const { _lengths: allowedLengths, BYTES, isLE, ORDER, _mod: modFromBytes } = this;\n        if (allowedLengths) {\n            // `allowedLengths` must list real positive byte lengths; otherwise empty input would get\n            // padded into zero and silently decode as a field element.\n            if (bytes.length < 1 || !allowedLengths.includes(bytes.length) || bytes.length > BYTES) {\n                throw new Error('Field.fromBytes: expected ' + allowedLengths + ' bytes, got ' + bytes.length);\n            }\n            const padded = new Uint8Array(BYTES);\n            // isLE add 0 to right, !isLE to the left.\n            padded.set(bytes, isLE ? 0 : padded.length - bytes.length);\n            bytes = padded;\n        }\n        if (bytes.length !== BYTES)\n            throw new Error('Field.fromBytes: expected ' + BYTES + ' bytes, got ' + bytes.length);\n        let scalar = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        if (modFromBytes)\n            scalar = mod(scalar, ORDER);\n        if (!skipValidation)\n            if (!this.isValid(scalar))\n                throw new Error('invalid field element: outside of range 0..ORDER');\n        // Range validation is optional here because some protocols intentionally decode raw residues\n        // and reduce or validate them elsewhere.\n        return scalar;\n    }\n    // TODO: we don't need it here, move out to separate fn\n    invertBatch(lst) {\n        // `passZero` keeps the `bigint[]` contract honest: zero inputs map to `0` instead of leaking\n        // `undefined` into a `bigint[]`. Callers that must distinguish non-invertible inputs should use\n        // `FpInvertBatch` directly, whose default omits `passZero` and returns `(bigint | undefined)[]`.\n        return FpInvertBatch(this, lst, true);\n    }\n    // We can't move this out because Fp6, Fp12 implement it\n    // and it's unclear what to return in there.\n    cmov(a, b, condition) {\n        // Field elements have `isValid(...)`; the CMOV branch bit is a direct runtime input, so reject\n        // non-boolean selectors here instead of letting JS truthiness silently change arithmetic.\n        abool(condition, 'condition');\n        return condition ? b : a;\n    }\n}\n/**\n * Creates a finite field. Major performance optimizations:\n * * 1. Denormalized operations like mulN instead of mul.\n * * 2. Identical object shape: never add or remove keys.\n * * 3. Frozen stable object shape; the lazy sqrt cache lives in a module-level `WeakMap`.\n * Fragile: always run a benchmark on a change.\n * Security note: operations and low-level serializers like `toBytes` don't check `isValid` for\n * all elements for performance and protocol-flexibility reasons; callers are responsible for\n * supplying valid elements when they need canonical field behavior.\n * This is low-level code, please make sure you know what you're doing.\n *\n * Note about field properties:\n * * CHARACTERISTIC p = prime number, number of elements in main subgroup.\n * * ORDER q = similar to cofactor in curves, may be composite `q = p^m`.\n *\n * @param ORDER - field order, probably prime, or could be composite\n * @param opts - Field options such as bit length or endianness. See {@link FieldOpts}.\n * @returns Frozen field instance with a stable object shape. This wrapper forwards `opts` straight\n *   into `_Field`, so it inherits `_Field`'s assumptions about cached sizes and `allowedLengths`.\n * @example\n * Construct one prime field with optional overrides.\n *\n * ```ts\n * Field(11n);\n * ```\n */\nexport function Field(ORDER, opts = {}) {\n    // Freeze the shared method surface before any instance is reachable; otherwise callers can\n    // poison every Field instance by monkey-patching `_Field.prototype` even if each instance is\n    // frozen. Freezing here instead of module scope keeps `_Field` tree-shakeable for importers\n    // that never construct a field; the call is idempotent and cheap.\n    Object.freeze(_Field.prototype);\n    return new _Field(ORDER, opts);\n}\n/**\n * @param Fp - Field implementation.\n * @param elm - Value to square-root.\n * @returns Odd square root when two roots exist. The special case `elm = 0` still returns `0`,\n *   which is the only square root but is not odd.\n * @throws If the field lacks oddness checks or the square root does not exist. {@link Error}\n * @example\n * Select the odd square root when two roots exist.\n *\n * ```ts\n * import { Field, FpSqrtOdd } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const root = FpSqrtOdd(Fp, 4n);\n * ```\n */\nexport function FpSqrtOdd(Fp, elm) {\n    validateField(Fp);\n    const F = Fp;\n    if (!F.isOdd)\n        throw new Error(\"Field doesn't have isOdd\");\n    const root = F.sqrt(elm);\n    return F.isOdd(root) ? root : F.neg(root);\n}\n/**\n * @param Fp - Field implementation.\n * @param elm - Value to square-root.\n * @returns Even square root.\n * @throws If the field lacks oddness checks or the square root does not exist. {@link Error}\n * @example\n * Select the even square root when two roots exist.\n *\n * ```ts\n * import { Field, FpSqrtEven } from '@noble/curves/abstract/modular.js';\n * const Fp = Field(17n);\n * const root = FpSqrtEven(Fp, 4n);\n * ```\n */\nexport function FpSqrtEven(Fp, elm) {\n    validateField(Fp);\n    const F = Fp;\n    if (!F.isOdd)\n        throw new Error(\"Field doesn't have isOdd\");\n    const root = F.sqrt(elm);\n    return F.isOdd(root) ? F.neg(root) : root;\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. Callers are expected to pass an\n *   order greater than 1.\n * @returns byte length of field\n * @throws If the field order is not a bigint. {@link Error}\n * @example\n * Read the fixed-width byte length of one field.\n *\n * ```ts\n * getFieldBytesLength(255n);\n * ```\n */\nexport function getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    // Valid field elements are in 0..ORDER-1, so ORDER <= 1 would make the encoded range degenerate.\n    if (fieldOrder <= _1n)\n        throw new Error('field order must be greater than 1');\n    // Valid field elements are < ORDER, so the maximal encoded element is ORDER - 1.\n    const bitLength = bitLen(fieldOrder - _1n);\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 * This is the reduction / modulo-bias lower bound; higher-level helpers may still impose a larger\n * absolute floor for policy reasons.\n * @param fieldOrder - number of field elements greater than 1, usually CURVE.n.\n * @returns byte length of target hash\n * @throws If the field order is invalid. {@link Error}\n * @example\n * Compute the minimum hash length needed for field reduction.\n *\n * ```ts\n * getMinHashLength(255n);\n * ```\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. The implementation also keeps a hard\n * 16-byte minimum even when `getMinHashLength(...)` is smaller, so toy-small inputs do not look\n * accidentally acceptable for real scalar derivation.\n * See {@link https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/ | Kudelski's modulo-bias guide},\n * {@link https://csrc.nist.gov/publications/detail/fips/186/5/final | FIPS 186-5 appendix A.2}, and\n * {@link https://www.rfc-editor.org/rfc/rfc9380#section-5 | RFC 9380 section 5}. Unlike RFC 9380\n * `hash_to_field`, this helper intentionally maps into the non-zero private-scalar range `1..n-1`.\n * @param key - Uniform input bytes.\n * @param fieldOrder - Size of subgroup.\n * @param isLE - interpret hash bytes as LE num\n * @returns valid private scalar\n * @throws If the hash length or field order is invalid for scalar reduction. {@link Error}\n * @example\n * Map hash output into a private scalar range.\n *\n * ```ts\n * mapHashToField(new Uint8Array(48).fill(1), 255n);\n * ```\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n    abytes(key);\n    const len = key.length;\n    const fieldLen = getFieldBytesLength(fieldOrder);\n    const minLen = Math.max(getMinHashLength(fieldOrder), 16);\n    // No toy-small inputs: the helper is for real scalar derivation, not tiny test curves. No huge\n    // inputs: easier to reason about JS timing / allocation behavior.\n    if (len < minLen || len > 1024)\n        throw new Error('expected ' + minLen + '-1024 bytes of input, got ' + len);\n    const num = isLE ? bytesToNumberLE(key) : bytesToNumberBE(key);\n    // Map into the non-zero scalar range [1, fieldOrder-1]: reduce mod (fieldOrder-1) to land in\n    // [0, fieldOrder-2], then add 1. This shifts the range off zero; it is NOT equal to\n    // `mod(num, fieldOrder)` (which spans [0, fieldOrder-1] and can be 0). A residual modulo bias\n    // remains but is negligible (~2^-(nBits/2), e.g. ~2^-128 for a 256-bit order) because `key` is\n    // required to be at least `getMinHashLength(fieldOrder)` (~1.5x field size) bytes of input.\n    const reduced = mod(num, fieldOrder - _1n) + _1n;\n    return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n", "/**\n * Methods for elliptic curve multiplication by scalars.\n * Contains wNAF-based ScalarMultiplier, pippenger.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { aarray, abool, afunction, aobject, bitLen, bitMask, bytesToNumberBE, inRange, isBytes, isPosBig, validateObject, } from \"../utils.js\";\nimport { Field, FpInvertBatch, validateField } from \"./modular.js\";\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _4n = /* @__PURE__ */ BigInt(4);\nconst BLIND_BYTES = 16;\nconst BLIND_BITS = 128;\n// Fixed-window width for the constant-time multiply of un-precomputed points (W===1).\n// A flat 2^FW_WINDOW table has a small, scalar-independent build cost that amortizes over a single\n// multiply, unlike the larger per-point wNAF tables that only pay off when cached.\nconst FW_WINDOW = 5;\n// Precompute tables are capped at ~2 GiB of estimated heap. Rejecting larger windows up front\n// turns a typo'd window size into an immediate error instead of a multi-GB allocation (or an\n// effective hang) when the lazy table is built on first multiply.\nconst TABLE_BYTES_MAX = /* @__PURE__ */ (() => 2 ** 31)();\n/**\n * Validates the static surface of a point constructor.\n * This is only a cheap sanity check for the constructor hooks and fields consumed by generic\n * factories; it does not certify `BASE`/`ZERO` semantics or prove the curve implementation itself.\n * @param Point - Runtime point constructor.\n * @throws On missing constructor hooks or malformed field metadata. {@link TypeError}\n * @example\n * Check that one point constructor exposes the static hooks generic helpers need.\n *\n * ```ts\n * import { ed25519 } from '@noble/curves/ed25519.js';\n * import { validatePointCons } from '@noble/curves/abstract/curve.js';\n * validatePointCons(ed25519.Point);\n * ```\n */\nexport function validatePointCons(Point) {\n    const pc = Point;\n    if (typeof pc !== 'function')\n        throw new TypeError('\"Point\" expected constructor, got type=' + typeof Point);\n    afunction(pc.fromAffine, 'Point.fromAffine');\n    afunction(pc.fromBytes, 'Point.fromBytes');\n    afunction(pc.fromHex, 'Point.fromHex');\n    // Generic helpers (ScalarMultiplier, normalizeZ, MSM) dereference BASE / ZERO:\n    // fail here with a typed error instead of an `undefined` access later.\n    aobject(pc.BASE, 'Point.BASE');\n    aobject(pc.ZERO, 'Point.ZERO');\n    validateField(pc.Fp);\n    validateField(pc.Fn);\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 * Input points are left unchanged; the normalized points are returned as fresh instances.\n * @param c - Point constructor.\n * @param points - Projective points.\n * @returns Fresh projective points reconstructed from normalized affine coordinates.\n * @example\n * Batch-normalize projective points with a single shared inversion.\n *\n * ```ts\n * import { normalizeZ } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const points = normalizeZ(p256.Point, [p256.Point.BASE, p256.Point.BASE.double()]);\n * ```\n */\nexport function normalizeZ(c, points) {\n    // Match MSM helpers: reject malformed public inputs before reading projective internals.\n    validatePointCons(c);\n    validateMSMPoints(points, c);\n    // Identity points (Z=0) rely on an implicit contract: FpInvertBatch without `passZero`\n    // yields `undefined` for zero inputs, and `toAffine(undefined)` falls back to its internal\n    // is0 handling instead of using the batch inverse.\n    const invertedZs = FpInvertBatch(c.Fp, points.map((p) => p.Z));\n    return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));\n}\nfunction validateW(W, bits, min = 1) {\n    if (!Number.isSafeInteger(W) || W < min || W > bits)\n        throw new Error('invalid window size, expected [' + min + '..' + bits + '], got W=' + W);\n}\n// Rough per-point heap estimate for the {@link TABLE_BYTES_MAX} cap: up to 4 projective/extended\n// coordinates of Fp.BYTES each, plus bigint/object overhead. Callers pass the point count of the\n// largest table the checked parameters can produce.\nfunction validateTableBytes(numPoints, fpBytes) {\n    const bytes = numPoints * (4 * fpBytes + 128);\n    if (bytes > TABLE_BYTES_MAX)\n        throw new Error('invalid window size: table would need ~' +\n            Math.ceil(bytes / 2 ** 20) +\n            ' MiB, max ' +\n            TABLE_BYTES_MAX / 2 ** 20 +\n            ' MiB');\n}\n/**\n * Probes an RNG once, at construction time: returns `undefined` when it is unavailable \u2014\n * throws or returns malformed bytes \u2014 so callers can downgrade to their unblinded /\n * deterministic constant-time fallback. Blinding is defense-in-depth (DPA/template\n * hardening), not a correctness or key-secrecy requirement, so availability-based\n * downgrade is acceptable.\n *\n * The downgrade decision is deliberately static. After a successful probe the RNG becomes\n * part of the trusted contract: later misbehavior must fail closed in per-call validation\n * (throw), never downgrade \u2014 a dynamic fallback would let a tampered RNG silently strip\n * blinding on demand. A probe can only ever classify broken environments, not adversarial\n * RNGs: a stateful RNG can always behave while probed and misbehave later.\n * @param randomBytes - RNG to probe, or `undefined` when the environment provides none.\n * @param length - Byte length requested from the probe call.\n * @returns The RNG when the probe produced `length` valid bytes; `undefined` otherwise.\n * @example\n * Probe an RNG once before enabling scalar blinding.\n *\n * ```ts\n * import { probeRandomBytes } from '@noble/curves/abstract/curve.js';\n * import { randomBytes } from '@noble/hashes/utils.js';\n * const rng = probeRandomBytes(randomBytes, 16);\n * ```\n */\nexport function probeRandomBytes(randomBytes, length) {\n    if (randomBytes === undefined)\n        return undefined;\n    afunction(randomBytes, 'randomBytes');\n    try {\n        const probe = randomBytes(length);\n        if (!isBytes(probe) || probe.length !== length)\n            return undefined;\n    }\n    catch {\n        return undefined;\n    }\n    return randomBytes;\n}\nfunction validateMSMPoints(points, c) {\n    aarray(points, 'points');\n    points.forEach((p, i) => {\n        if (!(p instanceof c))\n            throw new Error('invalid point at index ' + i);\n    });\n}\n// Default bound is field membership (0 <= s < field.ORDER); a `maxScalar` override widens it\n// to 0 <= s < maxScalar for callers that accept oversized scalars.\nfunction validateMSMScalars(scalars, field, maxScalar) {\n    if (!Array.isArray(scalars))\n        throw new Error('array of scalars expected');\n    scalars.forEach((s, i) => {\n        const ok = maxScalar === undefined ? field.isValid(s) : isPosBig(s) && s < maxScalar;\n        if (!ok)\n            throw new Error('invalid scalar at index ' + i);\n    });\n}\nconst pointWindowSizes = new WeakMap();\nfunction getWindowSize(P) {\n    // `1` is the uncached sentinel: use the non-precomputed (wNAF / fixed-window) path.\n    return pointWindowSizes.get(P) || 1;\n}\n/** Table of odd multiples [1P, 3P, ..., (2\u22C5size\u22121)P]; width-W wNAF uses size = 2^(W\u22122). */\nfunction oddMultiples(p, size) {\n    const dbl = p.double();\n    const t = [p];\n    for (let j = 1; j < size; j++)\n        t.push(t[j - 1].add(dbl));\n    return t;\n}\n/**\n * Width-W wNAF signed-digit recoding (W >= 2), LSB-first: digits are 0 or odd with\n * |digit| < 2^(W\u22121); nonzero density ~1/(W+1) (a nonzero digit is followed by W\u22121 zeros).\n */\nfunction wnafDigits(n, W) {\n    const size = 2 ** W;\n    const half = size / 2;\n    const mask = BigInt(size - 1);\n    const d = [];\n    while (n > _0n) {\n        let w = 0;\n        if (n & _1n) {\n            w = Number(n & mask); // n mod 2^W, odd\n            if (w >= half)\n                w -= size; // signed residue\n            n -= BigInt(w); // n - w \u2261 0 mod 2^W: next W\u22121 digits are zero\n        }\n        d.push(w);\n        n >>= _1n;\n    }\n    return d;\n}\n/**\n * Fixed-position signed-window recoding for precomputed wNAF: `n = \u03A3 digits[w]\u22C52^(w\u22C5W)` with\n * digits in `[\u22122^(W\u22121)+1, 2^(W\u22121)]`. Digit count is fixed by `windows` (callers reserve one\n * extra window for the final carry), so recoding length does not depend on the scalar.\n */\nfunction signedWindowDigits(n, W, windows) {\n    const size = 2 ** W;\n    const half = size / 2;\n    const mask = BigInt(size - 1);\n    const shiftBy = BigInt(W);\n    const d = [];\n    for (let w = 0; w < windows; w++) {\n        let v = Number(n & mask);\n        n >>= shiftBy;\n        if (v > half) {\n            v -= size; // negative digit, carry into the next window\n            n += _1n;\n        }\n        d.push(v);\n    }\n    // Internal invariant: leftover bits mean the window count did not cover the scalar.\n    if (n !== _0n)\n        throw new Error('invalid wnaf');\n    return d;\n}\n/**\n * Shared vartime walk over per-scalar wNAF digit streams: one doubling of a single shared\n * accumulator per bit position of the longest recoding, one signed table addition per\n * nonzero digit. `tables[i]` must hold the odd multiples of the i-th point.\n */\nfunction wnafWalk(zero, tables, digits) {\n    let max = 0;\n    for (const d of digits)\n        max = Math.max(max, d.length);\n    let acc = zero;\n    for (let bit = max - 1; bit >= 0; bit--) {\n        if (bit !== max - 1)\n            acc = acc.double();\n        for (let i = 0; i < digits.length; i++) {\n            const w = digits[i][bit]; // reads past shorter recodings yield undefined, skipped below\n            if (w) {\n                const item = tables[i][(Math.abs(w) - 1) >> 1];\n                acc = acc.add(w < 0 ? item.negate() : item);\n            }\n        }\n    }\n    return acc;\n}\n/**\n * Elliptic curve multiplication of Point by scalar.\n * Routes between cached-table, fixed-window, and one-shot wNAF paths; entry points validate\n * their own scalars (`mulCT`/`mulCTBlinded`: `1 <= s < Fn.ORDER`; `mulUnsafe`: up to the\n * `Fn.ORDER^4` DoS cap via {@link mulAddUnsafe}).\n * Table generation is expensive and happens on first call of `multiply()`\n * (or eagerly via `precompute(W, false)`). By default, `BASE` point is precomputed.\n *\n * Cached algorithm is signed fixed-window wNAF:\n * - table stores, for every window w, the multiples `[1..2^(W\u22121)]\u22C52^(w\u22C5W)\u22C5P` \u2014 all doublings\n *   are baked in, so a multiplication is exactly one table addition per window\n * - window count is fixed (`ceil(bits/W) + 1`), so the point-operation count is scalar-independent\n *   (basis of the constant-time path)\n * - for a 256-bit curve and W=6: 44\u22C532 = 1408 table points, 44 additions per multiply\n * - secret scalars are additionally blinded (see {@link ScalarMultiplier.mulCTBlinded}), which\n *   widens tables by 128 bits\n * @param Point - Point constructor.\n * @param randomBytes - RNG used for scalar blinding; required by the blinded secret path.\n * @example\n * Elliptic curve multiplication of Point by scalar.\n *\n * ```ts\n * import { ScalarMultiplier } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const mul = new ScalarMultiplier(p256.Point);\n * ```\n */\nexport class ScalarMultiplier {\n    Point;\n    BASE;\n    ZERO;\n    randomBytes;\n    wnafPrecomputes = new WeakMap();\n    baseCanBeBlinded;\n    bits;\n    // Parametrized with a given Point class (not individual point)\n    constructor(Point, randomBytes) {\n        validatePointCons(Point);\n        // Probe the RNG once (see {@link probeRandomBytes}): in environments without working\n        // randomness (e.g. no WebCrypto), shouldBlind() then routes secret multiplication to the\n        // unblinded constant-time path instead of throwing on every multiply(). The shape of\n        // returned bytes is still validated on every blinded call, where breakage fails closed.\n        this.randomBytes = probeRandomBytes(randomBytes, BLIND_BYTES);\n        this.Point = Point;\n        this.BASE = Point.BASE;\n        this.ZERO = Point.ZERO;\n        this.bits = Point.Fn.BITS;\n    }\n    /**\n     * Creates a signed fixed-window wNAF precomputation table: for every window w, the\n     * multiples `[1..2^(W\u22121)]\u22C52^(w\u22C5W)\u22C5P`, flattened. All doublings are baked into the table,\n     * so cached multiplication is additions-only. `windows = ceil(bits/W) + 1`: the extra\n     * window absorbs the final carry of signed-digit recoding.\n     * For a 256-bit curve and W=6, the table is 44\u22C532 = 1408 points.\n     * @param point - Point instance\n     * @param W - window size\n     * @param bits - scalar bitlength the table must cover\n     */\n    buildWnafTable(point, W, bits) {\n        // W needs no re-validation: its only source is setWindowSize(), which enforces\n        // 1 <= W <= Fn.BITS <= bits (the blinded path only ever widens bits) and caps the\n        // resulting table at ~2 GiB (sized against the wider blinded layout).\n        const windows = Math.ceil(bits / W) + 1;\n        const half = 2 ** (W - 1);\n        const comp = [];\n        let base = point;\n        for (let w = 0; w < windows; w++) {\n            let acc = base;\n            for (let i = 0; i < half; i++) {\n                comp.push(acc);\n                acc = acc.add(base);\n            }\n            base = comp[comp.length - 1].double(); // 2\u22C5(2^(W\u22121)\u22C5base) = next window's base\n        }\n        return { W, bits, windows, comp };\n    }\n    /**\n     * Implements ec multiplication using precomputed signed fixed-window wNAF tables.\n     * Constant-time: fixed window count with one table addition per window \u2014 zero digits feed\n     * the fake accumulator \u2014 and no doublings; the lookup scans the whole window slice.\n     * Scalar bounds are validated by the public entry points ({@link ScalarMultiplier.mulCT},\n     * {@link ScalarMultiplier.mulCTBlinded}, {@link ScalarMultiplier.mulUnsafe});\n     * signedWindowDigits throws if `n` exceeds the table.\n     * @returns real and fake (for const-time) points\n     */\n    wnafCachedCT(precomputes, n) {\n        const { W, windows, comp } = precomputes;\n        const half = 2 ** (W - 1);\n        const digits = signedWindowDigits(n, W, windows);\n        let p = this.ZERO;\n        let f = this.BASE;\n        for (let w = 0; w < windows; w++) {\n            const digit = digits[w];\n            const start = w * half;\n            // Data-oblivious select: touch every entry of the window before the digit branch.\n            const idx = Math.abs(digit) - 1; // -1 for zero digits: matches nothing, `sel` unused\n            let sel = comp[start];\n            for (let i = 1; i < half; i++)\n                sel = i === idx ? comp[start + i] : sel;\n            const neg = sel.negate(); // compute both signs; the digit only picks one\n            if (digit === 0)\n                f = f.add(comp[start]);\n            else\n                p = p.add(digit < 0 ? neg : sel);\n        }\n        return { p, f };\n    }\n    // Cache key is point identity plus (W, bits); at most two entries exist per point (public-width\n    // `Fn.BITS` and blinded `Fn.BITS + BLIND_BITS`). Callers must not reuse the same point with\n    // incompatible `transform(...)` layouts and expect a separate cache entry.\n    getWnafPrecomputes(W, point, bits, transform) {\n        let entries = this.wnafPrecomputes.get(point);\n        let comp = entries?.find((entry) => entry.W === W && entry.bits === bits);\n        if (!comp) {\n            comp = this.buildWnafTable(point, W, bits);\n            if (typeof transform === 'function')\n                comp = { ...comp, comp: transform(comp.comp) };\n            if (!entries) {\n                entries = [];\n                this.wnafPrecomputes.set(point, entries);\n            }\n            entries.push(comp);\n        }\n        return comp;\n    }\n    assertPoint(point) {\n        if (!(point instanceof this.Point))\n            throw new TypeError('\"point\" expected Point instance, got type=' + typeof point);\n    }\n    // Shared prologue of the constant-time entry points. Rejects scalar 0: in key/signature-style\n    // callers a zero scalar means broken upstream plumbing, and concrete Points already reject it.\n    // Uses inRange instead of Fn.isValidNot0: validateField() only certifies the arithmetic subset.\n    validateMulInput(point, scalar) {\n        this.assertPoint(point);\n        if (!inRange(scalar, _1n, this.Point.Fn.ORDER))\n            throw new Error('invalid scalar');\n    }\n    // Constant-time dispatch shared by mulCT / mulCTBlinded. Un-precomputed points (W===1, e.g.\n    // ECDH peer keys) skip building a throwaway cached table in favor of a small fixed-window\n    // multiply. `n` must be < 2^bits.\n    runCT(point, n, bits, transform) {\n        const W = getWindowSize(point);\n        if (W === 1)\n            return this.fixedWindowCT(point, n, bits);\n        return this.wnafCachedCT(this.getWnafPrecomputes(W, point, bits, transform), n);\n    }\n    mulCT(point, scalar, transform) {\n        this.validateMulInput(point, scalar);\n        return this.runCT(point, scalar, this.bits, transform);\n    }\n    mulCTBlinded(point, scalar, transform) {\n        this.validateMulInput(point, scalar);\n        // Blinding computes n = scalar + blind*Fn.ORDER, then n*P via a constant-time multiply. This\n        // equals scalar*P only when Fn.ORDER*P == O; callers guarantee that via shouldBlind() (always\n        // for cofactor-1 curves; for cofactored curves only BASE, and only after checking BASE*n == O).\n        // Fail before building the (large) precompute table if randomness is unavailable.\n        if (this.randomBytes === undefined)\n            throw new Error('randomBytes is required for scalar blinding');\n        const bits = this.Point.Fn.BITS + BLIND_BITS;\n        const blind = this.randomBytes(BLIND_BYTES);\n        if (!isBytes(blind) || blind.length !== BLIND_BYTES)\n            throw new Error('randomBytes returned invalid byte array');\n        // Force the top two bits of the 128-bit blind to 10xxxxxx, so blind is in [2^127, 1.5*2^127):\n        // * `| 0x80` (bit 127 = 1) is the load-bearing part: it guarantees blind >= 2^127, so the blind\n        //   is always a full-width, nonzero factor and the scalar is masked even with a degenerate RNG.\n        // * `& 0x3f` (bit 126 = 0) is a safety margin: it caps blind < 1.5*2^127, keeping\n        //   blind*Fn.ORDER + scalar < 0.75*2^(nBits+128), i.e. ~half a window below the 2^(nBits+128)\n        //   ceiling. Not strictly required for the bound (see below), but it reserves headroom so the\n        //   guarantee does not rest on the tight `Fn.ORDER < 2^Fn.BITS` fact and the final carry window\n        //   only ever holds a small carry, never a full digit.\n        blind[0] = (blind[0] & 0x3f) | 0x80;\n        // Even at the extreme (blind < 2^128, scalar < Fn.ORDER < 2^nBits): n <= 2^128*Fn.ORDER - 1 <\n        // 2^(nBits+128), so n stays below 2^bits and within the blinded table's\n        // window count. Both cached CT kernels run a fixed number of windows/rows with one point-add\n        // each, so the add count is independent of scalar (constant-time).\n        const n = scalar + bytesToNumberBE(blind) * this.Point.Fn.ORDER;\n        return this.runCT(point, n, bits, transform);\n    }\n    /**\n     * Constant-time multiplication `n*point` for an un-precomputed point, via a small fixed window.\n     * A cached wNAF table only pays off when reused; a flat 2^FW_WINDOW table (`size-1` adds) is\n     * far cheaper to build for a single use. The point-operation sequence is independent of `n`:\n     * build the table, then per window exactly FW_WINDOW doublings, a data-oblivious scan over\n     * every table entry, and one addition (adds the identity when the window digit is 0 \u2014 never\n     * skipped).\n     *\n     * `n` must be `< 2^bits`. Assumes complete addition (adding the identity costs the same as any\n     * add), which holds for the Weierstrass/Edwards point types used here. The table is left in\n     * projective form (no normalizeZ): normalizing this small a table costs more than the\n     * mixed-add savings it would buy for a single multiply.\n     * @returns real point `p`; `f` duplicates it only to match {@link wnafCachedCT}'s return shape\n     * (this path needs no fake accumulator \u2014 its op-count is already scalar-independent).\n     */\n    fixedWindowCT(point, n, bits) {\n        const W = FW_WINDOW;\n        const size = 1 << W;\n        const mask = bitMask(W);\n        // Flat table [O, point, 2*point, ..., (size-1)*point].\n        const table = new Array(size);\n        table[0] = this.ZERO;\n        for (let i = 1; i < size; i++)\n            table[i] = table[i - 1].add(point);\n        // Horner MSB->LSB. windows*W >= bits and n < 2^bits, so every bit of n is consumed.\n        const windows = Math.ceil(bits / W);\n        let acc = this.ZERO;\n        for (let window = windows - 1; window >= 0; window--) {\n            // W doublings per window; skipped for the first (topmost) window, where acc is still the\n            // identity. The skip is scalar-independent: it depends only on the loop index.\n            if (window !== windows - 1)\n                for (let d = 0; d < W; d++)\n                    acc = acc.double();\n            const digit = Number((n >> BigInt(window * W)) & mask);\n            // Data-oblivious select: touch every entry, same as wnafCachedCT.\n            let sel = table[0];\n            for (let i = 1; i < size; i++)\n                sel = i === digit ? table[i] : sel;\n            acc = acc.add(sel); // one add per window, even for digit 0\n        }\n        return { p: acc, f: acc };\n    }\n    shouldBlind(point, cofactor) {\n        // No usable RNG (probed in the constructor): blinding is impossible, use the plain CT path.\n        if (this.randomBytes === undefined)\n            return false;\n        if (cofactor === _1n)\n            return true;\n        if (point !== this.BASE)\n            return false;\n        if (this.baseCanBeBlinded === undefined)\n            this.baseCanBeBlinded = this.mulUnsafe(this.BASE, this.Point.Fn.ORDER).is0();\n        return this.baseCanBeBlinded;\n    }\n    mulSecret(point, scalar, cofactor, transform) {\n        return this.shouldBlind(point, cofactor)\n            ? this.mulCTBlinded(point, scalar, transform)\n            : this.mulCT(point, scalar, transform);\n    }\n    mulUnsafe(point, scalar, transform) {\n        this.assertPoint(point);\n        if (!isPosBig(scalar))\n            throw new Error('invalid scalar');\n        const W = getWindowSize(point);\n        // W === 1 (un-precomputed): one-shot width-4 wNAF via {@link mulAddUnsafe} with L=1 \u2014\n        // a cached table would be thrown away after one use. `allowOversized` swaps the\n        // `s < Fn.ORDER` check for mulAddUnsafe's `Fn.ORDER^4` DoS cap.\n        //\n        // Oversized scalar could happen when:\n        // a) user passes large scalar on their own (rare)\n        // b) `assertValidity()` calls `isTorsionFree()`, which multiplies point by `Fn.ORDER`\n        if (W === 1 || scalar >= this.Point.Fn.ORDER)\n            return mulAddUnsafe(this.Point, [point], [scalar], true);\n        // Precomputed points reuse the CT kernel (fake accumulator discarded): with W=6 only\n        // ~1/64 of window-adds are skippable, so a dedicated vartime kernel saved just ~6% on\n        // this path while doubling the cached-table code surface.\n        const precomputes = this.getWnafPrecomputes(W, point, this.bits, transform);\n        return this.wnafCachedCT(precomputes, scalar).p;\n    }\n    // Remembers the window size used for precomputed wNAF multiplication of the given point\n    // and drops any previously built tables. Usually only the base point is precomputed.\n    // W=1 resets the point to the un-precomputed (table-less) paths.\n    // W is additionally capped so tables stay under ~2 GiB ({@link TABLE_BYTES_MAX}).\n    setWindowSize(point, W) {\n        this.assertPoint(point);\n        validateW(W, this.bits);\n        // Size against the widest table this W can produce: the blinded path adds BLIND_BITS.\n        const windows = Math.ceil((this.bits + BLIND_BITS) / W) + 1;\n        validateTableBytes(windows * 2 ** (W - 1), this.Point.Fp.BYTES);\n        pointWindowSizes.set(point, W);\n        this.wnafPrecomputes.delete(point);\n    }\n    // True when a window size is set: tables themselves are built lazily on first multiply.\n    hasWindowSize(point) {\n        return getWindowSize(point) !== 1;\n    }\n}\n/**\n * Combined multi-scalar multiplication `\u03A3 scalars[i]\u22C5points[i]` via interleaved width-4 wNAF\n * (Strauss\u2013Shamir). Every input gets its own table of odd multiples `[1P, 3P, 5P, 7P]` and\n * signed-digit recoding, but all walks share one doubling chain, so total cost is\n * `~bits` doublings + `L\u22C5bits/5` additions instead of `L\u22C5bits` doublings for separate\n * multiplications. Intended for the 2-4 point shapes of signature verification\n * (`R = u1\u22C5G + u2\u22C5P`); use {@link pippenger} for larger batches.\n *\n * Not constant-time: only for public inputs. Scalars must satisfy `0 <= s < Fn.ORDER`;\n * fold negative signs into the points before calling.\n * @param c - Point constructor.\n * @param points - Array of curve points.\n * @param scalars - Array of non-negative scalars, same length as points.\n * @param allowOversized - Replace the `s < Fn.ORDER` scalar check with a `Fn.ORDER^4` DoS cap.\n *   Off by default. For scalars that must NOT be reduced mod ORDER: torsion checks\n *   (`Fn.ORDER\u22C5P \u225F O`) and cofactor-clearing multiples. Walk length grows with `bitLen(s)`.\n * @returns Combined multiplication result; identity for empty input.\n * @throws If the point set or scalar set is invalid. {@link Error}\n * @example\n * Combined multi-scalar multiplication via Strauss\u2013Shamir.\n *\n * ```ts\n * import { mulAddUnsafe } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const G = p256.Point.BASE;\n * const R = mulAddUnsafe(p256.Point, [G, G.double()], [2n, 3n]); // 2\u22C5G + 3\u22C5(2\u22C5G)\n * ```\n */\nexport function mulAddUnsafe(c, points, scalars, allowOversized = false) {\n    validatePointCons(c);\n    validateMSMPoints(points, c);\n    abool(allowOversized, 'allowOversized');\n    // Oversized cap is ORDER^4: hard bound to mitigate DoS, walk length grows with bitLen(s).\n    validateMSMScalars(scalars, c.Fn, allowOversized ? c.Fn.ORDER ** _4n : undefined);\n    if (points.length !== scalars.length)\n        throw new Error('arrays of points and scalars must have equal length');\n    const tables = points.map((p) => oddMultiples(p, 4));\n    const digits = scalars.map((n) => wnafDigits(n, 4));\n    return wnafWalk(c.ZERO, tables, digits);\n}\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster than precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Point-operation count is scalar-independent (for same L), even when 1 point + scalar, or when\n * scalar = 0 \u2014 but bucket indices are scalar windows, so the memory-access pattern is\n * scalar-dependent: do not rely on this for secret scalars.\n *\n * A repaired LFG bucket-set variant from ePrint 2024/750 was benchmarked on BLS12-381 G1\n * against this implementation: ~1.4x faster at 2048 points and ~1.1-1.25x faster at\n * 4096-32768 points, at the cost of extra recoding and multiplier-table complexity.\n * @param c - Curve Point constructor\n * @param points - array of L curve points\n * @param scalars - array of L scalars (aka secret keys / bigints)\n * @returns MSM result point. Empty input is accepted and returns the identity.\n * @throws If the point set, scalar set, or MSM sizing is invalid. {@link Error}\n * @example\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n *\n * ```ts\n * import { pippenger } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const point = pippenger(p256.Point, [p256.Point.BASE, p256.Point.BASE.double()], [2n, 3n]);\n * ```\n */\nexport function pippenger(c, points, scalars) {\n    // 0 is accepted in scalars\n    validatePointCons(c);\n    const fieldN = c.Fn;\n    validateMSMPoints(points, c);\n    validateMSMScalars(scalars, fieldN);\n    const plength = points.length;\n    const slength = scalars.length;\n    if (plength !== slength)\n        throw new Error('arrays of points and scalars must have equal length');\n    const zero = c.ZERO;\n    // Without this, the window loop below would still run ~Fn.BITS doublings of ZERO.\n    if (plength === 0)\n        return zero;\n    const wbits = bitLen(BigInt(plength));\n    let windowSize = 1; // bits\n    if (wbits > 12)\n        windowSize = wbits - 3;\n    else if (wbits > 4)\n        windowSize = wbits - 2;\n    else if (wbits > 0)\n        windowSize = 2;\n    const MASK = bitMask(windowSize);\n    const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array\n    const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;\n    let sum = zero;\n    for (let i = lastBits; i >= 0; i -= windowSize) {\n        buckets.fill(zero);\n        for (let j = 0; j < slength; j++) {\n            const scalar = scalars[j];\n            const wbits = Number((scalar >> BigInt(i)) & MASK);\n            buckets[wbits] = buckets[wbits].add(points[j]);\n        }\n        let resI = zero; // not using this will do small speed-up, but will lose ct\n        // Skip first bucket, because it is zero\n        for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n            sumI = sumI.add(buckets[j]);\n            resI = resI.add(sumI);\n        }\n        sum = sum.add(resI);\n        if (i !== 0)\n            for (let j = 0; j < windowSize; j++)\n                sum = sum.double();\n    }\n    return sum;\n}\n/**\n * Interleaved wNAF multi-scalar multiplication (MSM, Pa + Qb + Rc + ...) over a FIXED set\n * of points: each point gets a one-time table of odd multiples\n * `[1P, 3P, ..., (2^(W\u22121)\u22121)P]`, and the returned closure evaluates MSMs against those\n * tables. All scalars share one doubling chain (Straus 1964) \u2014 one doubling per scalar bit\n * plus one signed table addition per nonzero width-W wNAF digit (density ~1/(W+1)) \u2014 the\n * \"interleaving\" method of M\u00F6ller, \"Algorithms for multi-exponentiation\" (SAC 2001).\n *\n * Table memory is `L\u22C52^(W\u22122)` points, capped at ~2 GiB. Prefer this over {@link pippenger}\n * when the same points are reused across many MSMs (fixed-base commitments etc.) and up to a\n * few hundred points; prefer pippenger for one-shot MSMs or thousands of points, where\n * bucketing beats per-point tables.\n *\n * Not constant-time (zero digits are skipped): public inputs only.\n * @param c - Curve Point constructor\n * @param points - array of L curve points, captured by the returned closure\n * @param windowSize - window width W in bits, from 2 to Fn.BITS; also capped so the\n *   per-closure tables stay under ~2 GiB\n * @returns Function which multiplies points with scalars. The closure accepts at most\n *   `points.length` scalars, and omitted trailing scalars are treated as zero.\n * @throws If the point set or precompute window is invalid. {@link Error}\n * @example\n * Interleaved wNAF multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n *\n * ```ts\n * import { interleavedMSMUnsafe } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const msm = interleavedMSMUnsafe(p256.Point, [p256.Point.BASE], 4);\n * const point = msm([3n]);\n * ```\n */\nexport function interleavedMSMUnsafe(c, points, windowSize) {\n    validatePointCons(c);\n    const fieldN = c.Fn;\n    // Signed odd digits need at least width 2 (W=2 is plain NAF with a single-entry table).\n    validateW(windowSize, fieldN.BITS, 2);\n    validateMSMPoints(points, c);\n    validateTableBytes(points.length * 2 ** (windowSize - 2), c.Fp.BYTES);\n    const tables = points.map((p) => oddMultiples(p, 2 ** (windowSize - 2)));\n    return (scalars) => {\n        validateMSMScalars(scalars, fieldN);\n        if (scalars.length > points.length)\n            throw new Error('array of scalars must not be larger than array of points');\n        return wnafWalk(c.ZERO, tables, scalars.map((n) => wnafDigits(n, windowSize)));\n    };\n}\nfunction createField(order, field, isLE) {\n    if (field) {\n        // Reuse supplied field overrides as-is; `isLE` only affects freshly constructed fallback\n        // fields, and validateField() below only checks the arithmetic subset, not full byte/cmov\n        // behavior.\n        if (field.ORDER !== order)\n            throw new Error('Field.ORDER must match order: Fp == p, Fn == n');\n        validateField(field);\n        return field;\n    }\n    else {\n        return Field(order, { isLE });\n    }\n}\n/**\n * Validates basic CURVE shape and field membership, then creates fields.\n * This does not prove that the generator is on-curve, that subgroup/order data are consistent, or\n * that the curve equation itself is otherwise sane.\n * @param type - Curve family.\n * @param CURVE - Curve parameters.\n * @param curveOpts - Optional field overrides. See {@link FpFn}:\n *   - `Fp` (optional): Optional base-field override.\n *   - `Fn` (optional): Optional scalar-field override.\n * @param FpFnLE - Whether field encoding is little-endian.\n * @returns Frozen curve parameters and fields.\n * @throws If the curve parameters or field overrides are invalid. {@link Error}\n * @example\n * Build curve fields from raw constants before constructing a curve instance.\n *\n * ```ts\n * const curve = createCurveFields('weierstrass', {\n *   p: 17n,\n *   n: 19n,\n *   h: 1n,\n *   a: 2n,\n *   b: 2n,\n *   Gx: 5n,\n *   Gy: 1n,\n * });\n * ```\n */\nexport function createCurveFields(type, CURVE, curveOpts = {}, FpFnLE) {\n    if (type !== 'weierstrass' && type !== 'edwards')\n        throw new Error('expected curve type \"weierstrass\" or \"edwards\"');\n    if (FpFnLE === undefined)\n        FpFnLE = type === 'edwards';\n    if (!CURVE || typeof CURVE !== 'object')\n        throw new Error(`expected valid ${type} CURVE object`);\n    // Validate before reading Fp/Fn so explicit null fails with an options-object error.\n    validateObject(curveOpts);\n    for (const p of ['p', 'n', 'h']) {\n        const val = CURVE[p];\n        if (!(isPosBig(val) && val !== _0n))\n            throw new Error(`CURVE.${p} must be positive bigint`);\n    }\n    const Fp = createField(CURVE.p, curveOpts.Fp, FpFnLE);\n    const Fn = createField(CURVE.n, curveOpts.Fn, FpFnLE);\n    const _b = type === 'weierstrass' ? 'b' : 'd';\n    const params = ['Gx', 'Gy', 'a', _b];\n    for (const p of params) {\n        // @ts-ignore\n        if (!Fp.isValid(CURVE[p]))\n            throw new Error(`CURVE.${p} must be valid field element of CURVE.Fp`);\n    }\n    CURVE = Object.freeze(Object.assign({}, CURVE));\n    return { CURVE, Fp, Fn };\n}\n/**\n * @param randomSecretKey - Secret-key generator.\n * @param getPublicKey - Public-key derivation helper.\n * @returns Keypair generator.\n * @example\n * Build a `keygen()` helper from existing secret-key and public-key primitives.\n *\n * ```ts\n * import { createKeygen } from '@noble/curves/abstract/curve.js';\n * import { p256 } from '@noble/curves/nist.js';\n * const keygen = createKeygen(p256.utils.randomSecretKey, p256.getPublicKey);\n * const pair = keygen();\n * ```\n */\nexport function createKeygen(randomSecretKey, getPublicKey) {\n    return function keygen(seed) {\n        const secretKey = randomSecretKey(seed);\n        return { secretKey, publicKey: getPublicKey(secretKey) };\n    };\n}\n", "/**\n * Twisted Edwards curve. The formula is: ax\u00B2 + y\u00B2 = 1 + dx\u00B2y\u00B2.\n * For design rationale of types / exports, see weierstrass module documentation.\n * Untwisted Edwards curves exist, but they aren't used in real-world protocols.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { abool, abytes, aInRange, asafenumber, bytesToHex, bytesToNumberLE, concatBytes, copyBytes, hexToBytes, isBytes, notImplemented, validateObject, randomBytes as wcRandomBytes, } from \"../utils.js\";\nimport { createCurveFields, createKeygen, normalizeZ, ScalarMultiplier, validatePointCons, } from \"./curve.js\";\nimport { FpLegendre } from \"./modular.js\";\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = /* @__PURE__ */ BigInt(0), _1n = /* @__PURE__ */ BigInt(1), _2n = /* @__PURE__ */ BigInt(2), _4n = /* @__PURE__ */ BigInt(4), _8n = /* @__PURE__ */ BigInt(8);\n// Affine Edwards-equation check only; this does not prove subgroup membership, canonical\n// encoding, prime-order base-point requirements, or identity exclusion.\nfunction isEdValidXY(Fp, CURVE, x, y) {\n    const x2 = Fp.sqr(x);\n    const y2 = Fp.sqr(y);\n    const left = Fp.add(Fp.mul(CURVE.a, x2), y2);\n    const right = Fp.add(Fp.ONE, Fp.mul(CURVE.d, Fp.mul(x2, y2)));\n    return Fp.eql(left, right);\n}\n/**\n * @param params - Curve parameters. See {@link EdwardsOpts}.\n * @param extraOpts - Optional helpers and overrides. See {@link EdwardsExtraOpts}.\n * @returns Edwards point constructor. Generator validation here only checks\n *   that `(Gx, Gy)` satisfies the affine Edwards equation.\n *   RFC 8032 base-point constraints like `B != (0,1)` and `[L]B = 0`\n *   are left to the caller's chosen parameters, since eager subgroup\n *   validation here adds about 10-15ms to heavyweight imports like ed448.\n *   The returned constructor also eagerly marks `Point.BASE` for W=6\n *   precompute caching. Some code paths still assume\n *   `Fp.BYTES === Fn.BYTES`, so mismatched byte lengths are not fully audited here.\n * @throws If the curve parameters or Edwards overrides are invalid. {@link Error}\n * @example\n * ```ts\n * import { edwards } from '@noble/curves/abstract/edwards.js';\n * import { jubjub } from '@noble/curves/misc.js';\n * // Build a point constructor from explicit curve parameters, then use its base point.\n * const Point = edwards(jubjub.Point.CURVE());\n * Point.BASE.toHex();\n * ```\n */\nexport function edwards(params, extraOpts = {}) {\n    validateObject(extraOpts, {}, {}, 'extraOpts');\n    const opts = extraOpts;\n    const validated = createCurveFields('edwards', params, opts, opts.FpFnLE);\n    const { Fp, Fn } = validated;\n    let CURVE = validated.CURVE;\n    const { h: cofactor } = CURVE;\n    // The unified add-2008-hwcd formulas (see EdwardsPoint.add/double) are complete \u2014\n    // exception-free for every input pair \u2014 only when a is a square and d a non-square in Fp\n    // (Bernstein\u2013Birkner\u2013Joye\u2013Lange\u2013Peters, \"Twisted Edwards curves\", thm 3.3). The constant-time\n    // kernels in curve.ts assume completeness, so an incomplete curve could silently produce\n    // wrong results on exceptional inputs. Fail construction instead.\n    if (FpLegendre(Fp, CURVE.a) !== 1)\n        throw new Error('edwards: CURVE.a must be a square in Fp for complete addition formulas');\n    if (FpLegendre(Fp, CURVE.d) !== -1)\n        throw new Error('edwards: CURVE.d must be a non-square in Fp for complete addition formulas');\n    validateObject(opts, {}, { uvRatio: 'function', randomBytes: 'function' });\n    const randomBytes = opts.randomBytes === undefined ? wcRandomBytes : opts.randomBytes;\n    // Coordinate and ZIP-215 bounds follow the base-field byte container, not scalar bytes.\n    const MASK = _2n << (BigInt(Fp.BYTES * 8) - _1n);\n    function isOdd(n) {\n        if (!Fp.isOdd)\n            throw new Error('Field does not have .isOdd()');\n        return Fp.isOdd(n);\n    }\n    // sqrt(u/v)\n    const uvRatio = opts.uvRatio === undefined\n        ? (u, v) => {\n            try {\n                return { isValid: true, value: Fp.sqrt(Fp.div(u, v)) };\n            }\n            catch (e) {\n                return { isValid: false, value: _0n };\n            }\n        }\n        : opts.uvRatio;\n    // Validate whether the passed curve params are valid.\n    // equation ax\u00B2 + y\u00B2 = 1 + dx\u00B2y\u00B2 should work for generator point.\n    if (!isEdValidXY(Fp, CURVE, CURVE.Gx, CURVE.Gy))\n        throw new Error('bad curve params: generator point');\n    // Multiplication by param `a` sits on the double() / add() hot paths. For the common twists\n    // a=-1 (ed25519, jubjub) and a=1 (ed448) the full field multiplication is replaced with\n    // negation / identity. Selection depends only on public curve constants.\n    const mulA = Fp.eql(CURVE.a, Fp.neg(Fp.ONE)) ? (x) => Fp.neg(x)\n        : Fp.eql(CURVE.a, Fp.ONE) ? (x) => x\n            : (x) => Fp.mul(CURVE.a, x); // prettier-ignore\n    /**\n     * Asserts coordinate is valid: 0 <= n < MASK.\n     * Coordinates >= Fp.ORDER are allowed for zip215.\n     */\n    function acoord(title, n, banZero = false) {\n        const min = banZero ? _1n : _0n;\n        aInRange('coordinate ' + title, n, min, MASK);\n        return n;\n    }\n    function aedpoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('EdwardsPoint expected');\n    }\n    // Extended Point works in extended coordinates: (X, Y, Z, T) \u220B (x=X/Z, y=Y/Z, T=xy).\n    // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates\n    class Point {\n        static BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE, Fp.mul(CURVE.Gx, CURVE.Gy));\n        static ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ONE, Fp.ZERO);\n        static Fp = Fp;\n        static Fn = Fn;\n        X;\n        Y;\n        Z;\n        T;\n        constructor(X, Y, Z, T) {\n            this.X = acoord('x', X);\n            this.Y = acoord('y', Y);\n            this.Z = acoord('z', Z, true);\n            this.T = acoord('t', T);\n            Object.freeze(this);\n        }\n        static CURVE() {\n            return CURVE;\n        }\n        /**\n         * Create one extended Edwards point from affine coordinates.\n         * Does NOT validate that the point is on-curve or torsion-free.\n         * Use `.assertValidity()` on adversarial inputs.\n         */\n        static fromAffine(p) {\n            if (p instanceof Point)\n                throw new Error('extended point not allowed');\n            const { x, y } = p || {};\n            acoord('x', x);\n            acoord('y', y);\n            return new Point(x, y, Fp.ONE, Fp.mul(x, y));\n        }\n        // Uses algo from RFC8032 5.1.3.\n        static fromBytes(bytes, zip215 = false) {\n            const len = Fp.BYTES;\n            const { a, d } = CURVE;\n            bytes = copyBytes(abytes(bytes, len, 'point'));\n            abool(zip215, 'zip215');\n            const normed = copyBytes(bytes); // copy again, we'll manipulate it\n            const lastByte = bytes[len - 1]; // select last byte\n            normed[len - 1] = lastByte & ~0x80; // clear last bit\n            const y = bytesToNumberLE(normed);\n            // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\n            // RFC8032 prohibits >= p, but ZIP215 doesn't\n            // zip215=true:  0 <= y < MASK (2^256 for ed25519)\n            // zip215=false: 0 <= y < P (2^255-19 for ed25519)\n            const max = zip215 ? MASK : Fp.ORDER;\n            aInRange('point.y', y, _0n, max);\n            // Ed25519: x\u00B2 = (y\u00B2-1)/(dy\u00B2+1) mod p. Ed448: x\u00B2 = (y\u00B2-1)/(dy\u00B2-1) mod p. Generic case:\n            // ax\u00B2+y\u00B2=1+dx\u00B2y\u00B2 => y\u00B2-1=dx\u00B2y\u00B2-ax\u00B2 => y\u00B2-1=x\u00B2(dy\u00B2-a) => x\u00B2=(y\u00B2-1)/(dy\u00B2-a)\n            const y2 = Fp.sqr(y); // denominator is always non-0 mod p.\n            const u = Fp.sub(y2, Fp.ONE); // u = y\u00B2 - 1\n            const v = Fp.sub(Fp.mulN(d, y2), a); // v = d y\u00B2 - a.\n            let { isValid, value: x } = uvRatio(u, v); // \u221A(u/v)\n            if (!isValid)\n                throw new Error('bad point: invalid y coordinate');\n            const isXOdd = isOdd(x); // There are 2 square roots. Use x_0 bit to select proper\n            const isLastByteOdd = (lastByte & 0x80) !== 0; // x_0, last bit\n            if (!zip215 && Fp.is0(x) && isLastByteOdd)\n                // if x=0 and x_0 = 1, fail\n                throw new Error('bad point: x=0 and x_0=1');\n            if (isLastByteOdd !== isXOdd)\n                x = Fp.neg(x); // if x_0 != x mod 2, set x = p-x\n            return Point.fromAffine({ x, y });\n        }\n        static fromHex(hex, zip215 = false) {\n            return Point.fromBytes(hexToBytes(hex), zip215);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        precompute(windowSize = 6, isLazy = true) {\n            wnaf.setWindowSize(this, windowSize);\n            if (!isLazy)\n                this.multiply(_2n); // random number\n            return this;\n        }\n        // Useful in fromAffine() - not for fromBytes(), which always created valid points.\n        assertValidity() {\n            const p = this;\n            const { a, d } = CURVE;\n            // Keep generic Edwards validation fail-closed on the neutral point.\n            // Even though ZERO is algebraically valid and can roundtrip through encodings, higher-level\n            // callers often reach it only through broken hash/scalar plumbing; rejecting it here avoids\n            // silently treating that degenerate state as an ordinary public point.\n            if (p.is0())\n                throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?\n            // Equation in affine coordinates: ax\u00B2 + y\u00B2 = 1 + dx\u00B2y\u00B2\n            // Equation in projective coordinates (X/Z, Y/Z, Z):  (aX\u00B2 + Y\u00B2)Z\u00B2 = Z\u2074 + dX\u00B2Y\u00B2\n            const { X, Y, Z, T } = p;\n            const X2 = Fp.sqr(X); // X\u00B2\n            const Y2 = Fp.sqr(Y); // Y\u00B2\n            const Z2 = Fp.sqr(Z); // Z\u00B2\n            const Z4 = Fp.sqr(Z2); // Z\u2074\n            const aX2 = Fp.mul(X2, a); // aX\u00B2\n            const left = Fp.mul(Fp.add(aX2, Y2), Z2); // (aX\u00B2 + Y\u00B2)Z\u00B2\n            const right = Fp.add(Z4, Fp.mul(d, Fp.mul(X2, Y2))); // Z\u2074 + dX\u00B2Y\u00B2\n            if (!Fp.eql(left, right))\n                throw new Error('bad point: equation left != right (1)');\n            // In Extended coordinates we also have T, which is x*y=T/Z: check X*Y == Z*T\n            const XY = Fp.mul(X, Y);\n            const ZT = Fp.mul(Z, T);\n            if (!Fp.eql(XY, ZT))\n                throw new Error('bad point: equation left != right (2)');\n        }\n        // Compare one point to another.\n        equals(other) {\n            aedpoint(other);\n            const { X: X1, Y: Y1, Z: Z1 } = this;\n            const { X: X2, Y: Y2, Z: Z2 } = other;\n            const X1Z2 = Fp.mul(X1, Z2);\n            const X2Z1 = Fp.mul(X2, Z1);\n            const Y1Z2 = Fp.mul(Y1, Z2);\n            const Y2Z1 = Fp.mul(Y2, Z1);\n            return Fp.eql(X1Z2, X2Z1) && Fp.eql(Y1Z2, Y2Z1);\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        negate() {\n            // Flips point sign to a negative one (-x, y in affine coords)\n            return new Point(Fp.neg(this.X), this.Y, this.Z, Fp.neg(this.T));\n        }\n        // Fast algo for doubling Extended Point.\n        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n        // Cost: 4M + 4S + 1*a + 6add + 1*2.\n        double() {\n            const { X: X1, Y: Y1, Z: Z1 } = this;\n            const A = Fp.sqr(X1); // A = X12\n            const B = Fp.sqr(Y1); // B = Y12\n            const C = Fp.mul(Fp.sqr(Z1), _2n); // C = 2*Z12\n            const D = mulA(A); // D = a*A\n            const x1y1 = Fp.addN(X1, Y1);\n            const E = Fp.sub(Fp.subN(Fp.sqr(x1y1), A), B); // E = (X1+Y1)2-A-B\n            const G = Fp.addN(D, B); // G = D+B\n            const F = Fp.subN(G, C); // F = G-C\n            const H = Fp.subN(D, B); // H = D-B\n            const X3 = Fp.mul(E, F); // X3 = E*F\n            const Y3 = Fp.mul(G, H); // Y3 = G*H\n            const T3 = Fp.mul(E, H); // T3 = E*H\n            const Z3 = Fp.mul(F, G); // Z3 = F*G\n            return new Point(X3, Y3, Z3, T3);\n        }\n        // Fast algo for adding 2 Extended Points.\n        // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n        // Cost: 9M + 1*a + 1*d + 7add.\n        add(other) {\n            aedpoint(other);\n            const { d } = CURVE;\n            const { X: X1, Y: Y1, Z: Z1, T: T1 } = this;\n            const { X: X2, Y: Y2, Z: Z2, T: T2 } = other;\n            const A = Fp.mul(X1, X2); // A = X1*X2\n            const B = Fp.mul(Y1, Y2); // B = Y1*Y2\n            const C = Fp.mul(Fp.mulN(T1, d), T2); // C = T1*d*T2\n            const D = Fp.mul(Z1, Z2); // D = Z1*Z2\n            // E = (X1+Y1)*(X2+Y2)-A-B\n            const E = Fp.sub(Fp.subN(Fp.mulN(Fp.addN(X1, Y1), Fp.addN(X2, Y2)), A), B);\n            const F = Fp.subN(D, C); // F = D-C\n            const G = Fp.addN(D, C); // G = D+C\n            const H = Fp.sub(B, mulA(A)); // H = B-a*A\n            const X3 = Fp.mul(E, F); // X3 = E*F\n            const Y3 = Fp.mul(G, H); // Y3 = G*H\n            const T3 = Fp.mul(E, H); // T3 = E*H\n            const Z3 = Fp.mul(F, G); // Z3 = F*G\n            return new Point(X3, Y3, Z3, T3);\n        }\n        subtract(other) {\n            // Validate before calling `negate()` so wrong inputs fail with the point guard\n            // instead of leaking a foreign `negate()` error.\n            aedpoint(other);\n            return this.add(other.negate());\n        }\n        // Constant-time multiplication.\n        multiply(scalar) {\n            // 1 <= scalar < L\n            // Keep the subgroup-scalar contract strict instead of reducing 0 / n to ZERO.\n            // In keygen/signing-style callers, those values usually mean broken hash/scalar plumbing,\n            // and failing closed is safer than silently producing the identity point.\n            if (!Fn.isValidNot0(scalar))\n                throw new RangeError('invalid scalar: expected 1 <= sc < curve.n');\n            const { p, f } = wnaf.mulSecret(this, scalar, cofactor, normalize);\n            return normalize([p, f])[0];\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.\n        // Keeps the same subgroup-scalar contract: 0 is allowed for public-scalar callers, but\n        // n and larger values are rejected instead of being reduced mod n to the identity point.\n        multiplyUnsafe(scalar) {\n            // 0 <= scalar < L\n            if (!Fn.isValid(scalar))\n                throw new RangeError('invalid scalar: expected 0 <= sc < curve.n');\n            if (scalar === _0n)\n                return Point.ZERO;\n            if (this.is0() || scalar === _1n)\n                return this;\n            return wnaf.mulUnsafe(this, scalar, normalize);\n        }\n        // Checks if point is of small order.\n        // If you add something to small order point, you will have \"dirty\"\n        // point with torsion component.\n        // Clears cofactor and checks if the result is 0.\n        isSmallOrder() {\n            return this.clearCofactor().is0();\n        }\n        // Multiplies point by curve order and checks if the result is 0.\n        // Returns `false` is the point is dirty.\n        isTorsionFree() {\n            return wnaf.mulUnsafe(this, CURVE.n).is0();\n        }\n        // Converts Extended point to default (x, y) coordinates.\n        // Can accept precomputed Z^-1 - for example, from invertBatch.\n        toAffine(invertedZ) {\n            const p = this;\n            let iz = invertedZ;\n            if (iz != null && typeof iz !== 'bigint')\n                throw new TypeError('\"invertedZ\" expected bigint, got type=' + typeof iz);\n            const { X, Y, Z } = p;\n            const is0 = p.is0();\n            if (iz == null)\n                iz = is0 ? Fp.create(_8n) : Fp.inv(Z);\n            const x = Fp.mul(X, iz);\n            const y = Fp.mul(Y, iz);\n            const zz = Fp.mul(Z, iz);\n            if (is0)\n                return { x: Fp.ZERO, y: Fp.ONE };\n            if (!Fp.eql(zz, Fp.ONE))\n                throw new Error('invZ was invalid');\n            return { x, y };\n        }\n        clearCofactor() {\n            if (cofactor === _1n)\n                return this;\n            // 2.8-3.8x speed-up vs naive\n            if (cofactor === _2n)\n                return this.double();\n            if (cofactor === _4n)\n                return this.double().double();\n            if (cofactor === _8n)\n                return this.double().double().double();\n            return this.multiplyUnsafe(cofactor);\n        }\n        toBytes() {\n            const { x, y } = this.toAffine();\n            // Fp.toBytes() allows non-canonical encoding of y (>= p).\n            const bytes = Fp.toBytes(y);\n            // Each y has 2 valid points: (x, y), (x,-y).\n            // When compressing, it's enough to store y and use the last byte to encode sign of x\n            bytes[bytes.length - 1] |= isOdd(x) ? 0x80 : 0;\n            return bytes;\n        }\n        toHex() {\n            return bytesToHex(this.toBytes());\n        }\n        toString() {\n            return `<Point ${this.is0() ? 'ZERO' : this.toHex()}>`;\n        }\n    }\n    // Keep constructor work cheap: subgroup/generator validation belongs to the caller's curve\n    // parameters, and doing the extra checks here adds about 10-15ms to heavy module imports.\n    // Callers that construct custom curves are responsible for supplying the correct base point.\n    // try {\n    //   Point.BASE.assertValidity();\n    //   if (!Point.BASE.isTorsionFree()) throw new Error('bad point: not in prime-order subgroup');\n    // } catch {\n    //   throw new Error('bad curve params: generator point');\n    // }\n    const normalize = (points) => normalizeZ(Point, points);\n    const wnaf = new ScalarMultiplier(Point, randomBytes);\n    // Enable W=6 wNAF precomputes. Slows down first publicKey computation.\n    // Disable for tiny toy curves, with scalar fields < 6 bits.\n    if (wnaf.bits >= 6)\n        Point.BASE.precompute(6);\n    Object.freeze(Point.prototype);\n    Object.freeze(Point);\n    return Point;\n}\n/**\n * Base class for prime-order points like Ristretto255 and Decaf448.\n * These points eliminate cofactor issues by representing equivalence classes\n * of Edwards curve points. Multiple Edwards representatives can describe the\n * same abstract wrapper element, so wrapper validity is not the same thing as\n * the hidden representative being torsion-free.\n * @param ep - Backing Edwards point.\n * @example\n * Base class for prime-order points like Ristretto255 and Decaf448.\n *\n * ```ts\n * import { ristretto255 } from '@noble/curves/ed25519.js';\n * const point = ristretto255.Point.BASE.multiply(2n);\n * ```\n */\nexport class PrimeEdwardsPoint {\n    static BASE;\n    static ZERO;\n    static Fp;\n    static Fn;\n    ep;\n    /**\n     * Wrap one internal Edwards representative directly.\n     * This is not a canonical encoding boundary: alternate Edwards\n     * representatives may still describe the same abstract wrapper element.\n     */\n    constructor(ep) {\n        this.ep = ep;\n    }\n    // Static methods that must be implemented by subclasses\n    static fromBytes(_bytes) {\n        notImplemented();\n    }\n    static fromHex(_hex) {\n        notImplemented();\n    }\n    get x() {\n        return this.toAffine().x;\n    }\n    get y() {\n        return this.toAffine().y;\n    }\n    // Common implementations\n    clearCofactor() {\n        // no-op for the abstract prime-order wrapper group; this is about the\n        // wrapper element, not the hidden Edwards representative.\n        return this;\n    }\n    assertValidity() {\n        // Keep wrapper validity at the abstract-group boundary. Canonical decode\n        // may choose Edwards representatives that differ by small torsion, so\n        // checking `this.ep.isTorsionFree()` here would reject valid wrapper points.\n        this.ep.assertValidity();\n    }\n    /**\n     * Return affine coordinates of the current internal Edwards representative.\n     * This is a convenience helper, not a canonical Ristretto/Decaf encoding.\n     * Equal abstract elements may expose different `x` / `y`; use\n     * `toBytes()` / `fromBytes()` for canonical roundtrips.\n     */\n    toAffine(invertedZ) {\n        return this.ep.toAffine(invertedZ);\n    }\n    toHex() {\n        return bytesToHex(this.toBytes());\n    }\n    toString() {\n        return this.toHex();\n    }\n    isTorsionFree() {\n        // Abstract Ristretto/Decaf elements are already prime-order even when the\n        // hidden Edwards representative is not torsion-free.\n        return true;\n    }\n    isSmallOrder() {\n        return false;\n    }\n    add(other) {\n        this.assertSame(other);\n        return this.init(this.ep.add(other.ep));\n    }\n    subtract(other) {\n        this.assertSame(other);\n        return this.init(this.ep.subtract(other.ep));\n    }\n    multiply(scalar) {\n        return this.init(this.ep.multiply(scalar));\n    }\n    multiplyUnsafe(scalar) {\n        return this.init(this.ep.multiplyUnsafe(scalar));\n    }\n    double() {\n        return this.init(this.ep.double());\n    }\n    negate() {\n        return this.init(this.ep.negate());\n    }\n    precompute(windowSize, isLazy) {\n        this.ep.precompute(windowSize, isLazy);\n        // Keep the wrapper identity stable like the backing Edwards API instead of\n        // allocating a fresh wrapper around the same cached point.\n        return this;\n    }\n}\n/**\n * Initializes EdDSA signatures over given Edwards curve.\n * @param Point - Edwards point constructor.\n * @param cHash - Hash function.\n * @param eddsaOpts - Optional signature helpers. See {@link EdDSAOpts}.\n * @returns EdDSA helper namespace.\n * @throws If the hash function, options, or derived point operations are invalid. {@link Error}\n * @example\n * Initializes EdDSA signatures over given Edwards curve.\n *\n * ```ts\n * import { eddsa } from '@noble/curves/abstract/edwards.js';\n * import { jubjub } from '@noble/curves/misc.js';\n * import { sha512 } from '@noble/hashes/sha2.js';\n * const sigs = eddsa(jubjub.Point, sha512);\n * const { secretKey, publicKey } = sigs.keygen();\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = sigs.sign(msg, secretKey);\n * const isValid = sigs.verify(sig, msg, publicKey);\n * ```\n */\nexport function eddsa(Point, cHash, eddsaOpts = {}) {\n    validatePointCons(Point);\n    if (typeof cHash !== 'function')\n        throw new Error('\"hash\" function param is required');\n    const hash = cHash;\n    const opts = eddsaOpts;\n    validateObject(opts, {}, {\n        adjustScalarBytes: 'function',\n        randomBytes: 'function',\n        domain: 'function',\n        prehash: 'function',\n        zip215: 'boolean',\n        mapToCurve: 'function',\n        toMontgomery: 'function',\n        toMontgomerySecret: 'function',\n    });\n    const { prehash } = opts;\n    const { BASE, Fp, Fn } = Point;\n    const outputLen = hash.outputLen;\n    const expectedLen = 2 * Fp.BYTES;\n    // When hash metadata is available, reject incompatible EdDSA wrappers at construction time\n    // instead of deferring the mismatch until the first keygen/sign call.\n    if (outputLen !== undefined) {\n        asafenumber(outputLen, 'hash.outputLen');\n        if (outputLen !== expectedLen)\n            throw new Error(`hash.outputLen must be ${expectedLen}, got ${outputLen}`);\n    }\n    const randomBytes = opts.randomBytes === undefined ? wcRandomBytes : opts.randomBytes;\n    const toMontgomery = opts.toMontgomery;\n    const toMontgomerySecret = opts.toMontgomerySecret;\n    const adjustScalarBytes = opts.adjustScalarBytes === undefined\n        ? (bytes) => bytes\n        : opts.adjustScalarBytes;\n    const domain = opts.domain === undefined\n        ? (data, ctx, phflag) => {\n            abool(phflag, 'phflag');\n            if (ctx.length || phflag)\n                throw new Error('Contexts/pre-hash are not supported');\n            return data;\n        }\n        : opts.domain; // NOOP\n    // Parse an EdDSA digest as a little-endian integer and reduce it modulo the scalar field order.\n    function modN_LE(hash) {\n        return Fn.create(bytesToNumberLE(hash)); // Not Fn.fromBytes: it has length limit\n    }\n    // Get the hashed private scalar per RFC8032 5.1.5\n    function getPrivateScalar(key) {\n        const len = lengths.secretKey;\n        abytes(key, lengths.secretKey, 'secretKey');\n        // Hash private key with curve's hash function to produce uniformingly random input\n        // Check byte lengths: ensure(64, h(ensure(32, key)))\n        const hashed = abytes(hash(key), 2 * len, 'hashedSecretKey');\n        // Slice before clamping so in-place adjustors don't corrupt the prefix half.\n        const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE\n        const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)\n        const scalar = modN_LE(head); // The actual private scalar\n        return { head, prefix, scalar };\n    }\n    /** Convenience method that creates public key from scalar. RFC8032 5.1.5\n     * Also exposes the derived scalar/prefix tuple and point form reused by sign().\n     */\n    function getExtendedPublicKey(secretKey) {\n        const { head, prefix, scalar } = getPrivateScalar(secretKey);\n        const point = BASE.multiply(scalar); // Point on Edwards curve aka public key\n        const pointBytes = point.toBytes();\n        return { head, prefix, scalar, point, pointBytes };\n    }\n    /** Calculates EdDSA pub key. RFC8032 5.1.5. */\n    function getPublicKey(secretKey) {\n        return getExtendedPublicKey(secretKey).pointBytes;\n    }\n    // Hash domain-separated chunks into a little-endian scalar modulo the group order.\n    function hashDomainToScalar(context = Uint8Array.of(), ...msgs) {\n        const msg = concatBytes(...msgs);\n        return modN_LE(hash(domain(msg, abytes(context, undefined, 'context'), !!prehash)));\n    }\n    /** Signs message with secret key. RFC8032 5.1.6 */\n    function sign(msg, secretKey, options = {}) {\n        validateObject(options, {}, {}, 'options');\n        msg = abytes(msg, undefined, 'message');\n        if (prehash)\n            msg = prehash(msg); // for ed25519ph etc.\n        const { prefix, scalar, pointBytes } = getExtendedPublicKey(secretKey);\n        const r = hashDomainToScalar(options.context, prefix, msg); // r = dom2(F, C) || prefix || PH(M)\n        // RFC 8032 5.1.6 allows r mod L = 0, and SUPERCOP ref10 accepts the resulting identity-point\n        // signature.\n        // We intentionally keep the safe multiply() rejection here so a miswired all-zero hash provider\n        // fails loudly instead of silently producing a degenerate signature.\n        const R = BASE.multiply(r).toBytes(); // R = rG\n        const k = hashDomainToScalar(options.context, R, pointBytes, msg); // R || A || PH(M)\n        const s = Fn.create(r + k * scalar); // S = (r + k * s) mod L\n        if (!Fn.isValid(s))\n            throw new Error('sign failed: invalid s'); // 0 <= s < L\n        const rs = concatBytes(R, Fn.toBytes(s));\n        return abytes(rs, lengths.signature, 'result');\n    }\n    // Keep the shared helper strict by default: RFC 8032 / NIST-style wrappers should reject\n    // non-canonical encodings unless they explicitly opt into ZIP-215's more permissive decode rules.\n    const verifyOpts = {\n        zip215: opts.zip215,\n    };\n    /**\n     * Verifies EdDSA signature against message and public key. RFC 8032 \u00A7\u00A75.1.7 and 5.2.7.\n     * A cofactored verification equation is checked.\n     */\n    function verify(sig, msg, publicKey, options = verifyOpts) {\n        // Validate before destructuring so explicit null follows the standard options error.\n        validateObject(options);\n        // Preserve the wrapper-selected default for `{}` / `{ zip215: undefined }`, not just omitted opts.\n        const { context } = options;\n        const zip215 = options.zip215 === undefined ? !!verifyOpts.zip215 : options.zip215;\n        const len = lengths.signature;\n        sig = abytes(sig, len, 'signature');\n        msg = abytes(msg, undefined, 'message');\n        publicKey = abytes(publicKey, lengths.publicKey, 'publicKey');\n        if (zip215 !== undefined)\n            abool(zip215, 'zip215');\n        if (prehash)\n            msg = prehash(msg); // for ed25519ph, etc\n        const mid = len / 2;\n        const r = sig.subarray(0, mid);\n        const s = bytesToNumberLE(sig.subarray(mid, len));\n        let A, R, SB;\n        try {\n            // ZIP-215 is more permissive than RFC 8032 / NIST186-5. Use it only for wrappers that\n            // explicitly want consensus-style unreduced encoding acceptance.\n            // zip215=true:  0 <= y < MASK (2^256 for ed25519)\n            // zip215=false: 0 <= y < P (2^255-19 for ed25519)\n            A = Point.fromBytes(publicKey, zip215);\n            R = Point.fromBytes(r, zip215);\n            SB = BASE.multiplyUnsafe(s); // 0 <= s < l is done inside\n        }\n        catch (error) {\n            return false;\n        }\n        // RFC 8032 \u00A7\u00A75.1.7/5.2.7 and FIPS 186-5 \u00A7\u00A77.7.2/7.8.2 only decode A' and check the cofactored\n        // verification equation; they do not add a separate low-order-public-key rejection here.\n        // Strict mode still rejects small-order A' intentionally for SBS-style non-repudiation and to\n        // avoid ambiguous verification outcomes where unusual low-order keys can make distinct\n        // key/signature/message combinations verify.\n        if (!zip215 && A.isSmallOrder())\n            return false;\n        // ZIP-215 accepts noncanonical / unreduced point encodings, so the challenge hash must use the\n        // exact signature/public-key bytes rather than canonicalized re-encodings of the decoded points.\n        const k = hashDomainToScalar(context, r, publicKey, msg);\n        const RkA = R.add(A.multiplyUnsafe(k));\n        // Check the cofactored verification equation via the curve cofactor h.\n        // [h][S]B = [h]R + [h][k]A'\n        return RkA.subtract(SB).clearCofactor().is0();\n    }\n    const _size = Fp.BYTES; // 32 for ed25519, 57 for ed448\n    const lengths = {\n        secretKey: _size,\n        publicKey: _size,\n        signature: 2 * _size,\n        seed: _size,\n    };\n    function randomSecretKey(seed) {\n        seed = seed === undefined ? randomBytes(lengths.seed) : seed;\n        return abytes(seed, lengths.seed, 'seed');\n    }\n    function isValidSecretKey(key) {\n        return isBytes(key) && key.length === lengths.secretKey;\n    }\n    function isValidPublicKey(key, zip215) {\n        try {\n            // Preserve the wrapper-selected default for omitted / `undefined` ZIP-215 flags here too.\n            return !!Point.fromBytes(key, zip215 === undefined ? verifyOpts.zip215 : zip215);\n        }\n        catch (error) {\n            return false;\n        }\n    }\n    const utils = {\n        getExtendedPublicKey,\n        randomSecretKey,\n        isValidSecretKey,\n        isValidPublicKey,\n        /** Converts an Edwards public key to a companion Montgomery public key. */\n        toMontgomery(publicKey) {\n            if (toMontgomery === undefined)\n                throw new Error('Montgomery conversion is not supported for this curve');\n            return toMontgomery(Point.fromBytes(publicKey));\n        },\n        toMontgomerySecret(secretKey) {\n            if (toMontgomerySecret === undefined)\n                throw new Error('Montgomery conversion is not supported for this curve');\n            return toMontgomerySecret(secretKey);\n        },\n    };\n    Object.freeze(lengths);\n    Object.freeze(utils);\n    return Object.freeze({\n        keygen: createKeygen(randomSecretKey, getPublicKey),\n        getPublicKey,\n        sign,\n        verify,\n        utils,\n        Point,\n        lengths,\n    });\n}\n", "/**\n * Montgomery curve methods. It's not really whole montgomery curve,\n * just bunch of very specific methods for X25519 / X448 from\n * [RFC 7748](https://www.rfc-editor.org/rfc/rfc7748)\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { abytes, aInRange, bytesToNumberLE, copyBytes, numberToBytesLE, randomBytes, validateObject, } from \"../utils.js\";\nimport { createKeygen } from \"./curve.js\";\nimport { mod } from \"./modular.js\";\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\n// cswap from RFC7748 \"example code\", adapted to BigInt.\n//\n// RFC: \"dummy = mask(swap) AND (x_2 XOR x_3), where mask(swap) is the all-1 or all-0 word of the\n// same length as x_2 and x_3\". On fixed-width machine words both cases cost the same. BigInt has\n// no fixed width, so a {0n, 1n} selector does not: V8 short-circuits `0n * v` - and, identically,\n// `0n & v`, `v + 0n`, `v - 0n` - to a no-op, while `1n * v` is a real multiply. The ladder calls\n// this with swap = k_t XOR k_(t+1), which would make total running time a linear function of how\n// often adjacent bits of the secret scalar differ: remotely measurable, and worth ~4 bits of a\n// long-term key.\n//\n// So select with a full-width mask instead, and interpolate rather than mask off a dummy.\n/**\n * Selector for cswap(): `P` to keep, `P + 1` to swap, chosen by the low bit of `swap`.\n * Higher bits are ignored, and `swap` is passed in whole rather than as a {0n, 1n} bit on\n * purpose: `P + (swap & _1n)` would short-circuit the addition whenever the bit is clear, which\n * is the very leak this construction avoids, one round-trip further down. Subtracting `swap`\n * with its low bit cleared keeps every operand full-width instead.\n * @param P - Field modulus.\n * @param swap - Value whose low bit selects; ignored above that bit.\n * @returns `P` when the low bit is clear, `P + 1` when it is set.\n */\nfunction cmask(P, swap) {\n    return P + swap - ((swap >> _1n) << _1n);\n}\n/**\n * Swap two field elements when `mask` is `P + 1`, keep them when it is `P`:\n *\n *   d    = 6P + x_3 - x_2\n *   x_2' = d * mask + x_2   (mod P)      x_3' = (x_2 + x_3) - x_2'\n *\n * The extra `6P * mask` vanishes modulo P, so `mask === P` leaves x_2 and `mask === P + 1`\n * leaves x_3. Without the offset, the reduction dividend changes sign with input order and crosses\n * BigInt limb boundaries; those classes measured differently on the tested Node/V8 build. For\n * canonical inputs, the deliberately left-associative `offset + x_3 - x_2` is between 5P and 7P,\n * keeping the dividend positive and in one word-count band for both RFC fields and masks. Six is\n * the smallest coefficient `c` for which the shared offset `cP` has that property.\n *\n * This reduced the tested sign/size timing ratios, but JavaScript BigInt has no constant-time\n * contract and the contents of the multiply and remainder still vary. Valid ladder states can\n * contain genuine zero coordinates; this construction does not mask those value-shape effects.\n * Computing `x_3'` independently as `((6P + x_2 - x_3) * mask + x_3) % P` is more symmetric.\n * On the tested Node/V8 build, it reduced the timing difference between keeping `(0, v)` and\n * swapping `(v, 0)`\u2014both return `(0, v)`\u2014from about 10%/13% for X25519/X448 to about 3%.\n * Successful calls cannot reach that zero-in-the-first-output case. For the case they can reach,\n * swapping `(0, v)` and keeping `(v, 0)` both return `(v, 0)`; the difference instead grew from\n * about 0.7%/1.1% to 2.7%/2.8%. The extra multiply/remainder also made public\n * `getSharedSecret()` about 16% slower. The retained one-remainder form measured about 2.5%\n * slower than the prior helper for public X25519 `getSharedSecret()` in the same environment.\n * x_3' falls out of the sum, which a swap leaves invariant: no second multiply or reduction is\n * needed. Bind `6P` once per field so production and the timing regression exercise the same\n * configured helper without paying for the multiplication in every ladder round.\n *\n * The returned function is called twice per ladder round, so it validates nothing. Both elements\n * MUST already be reduced mod P; unreduced input silently corrupts the kept-side output.\n * @param P - Field modulus.\n * @returns A field-bound swap function taking mask, x_2, and x_3.\n */\nfunction cswap(P) {\n    const offset = BigInt(6) * P;\n    return (mask, x_2, x_3) => {\n        const sum = x_2 + x_3;\n        const d = offset + x_3 - x_2;\n        const a = (d * mask + x_2) % P;\n        return { x_2: a, x_3: sum - a };\n    };\n}\n/** Internal helpers, exported for tests only. Not part of the public API. */\nexport const __TEST = /* @__PURE__ */ Object.freeze({\n    cmask,\n    cswap,\n});\nfunction validateOpts(curve) {\n    // Validate constructor config eagerly, but do not call user-provided hooks here:\n    // `randomBytes` may be transcript-backed or otherwise contextual. Runtime type checks are\n    // enough to fail fast on malformed configs without consuming user state.\n    validateObject(curve, {\n        P: 'bigint',\n        type: 'string',\n        adjustScalarBytes: 'function',\n        powPminus2: 'function',\n    }, {\n        randomBytes: 'function',\n        scalarMultBase: 'function',\n    });\n    return Object.freeze({ ...curve });\n}\n/**\n * @param curveDef - Montgomery curve definition.\n * @returns ECDH helper namespace.\n * @throws If the curve definition or derived shared point is invalid. {@link Error}\n * @example\n * Build an X25519 helper from curve parameters, then derive one public key.\n *\n * ```ts\n * import { montgomery } from '@noble/curves/abstract/montgomery.js';\n * const P = 2n ** 255n - 19n;\n * const mod = (num: bigint) => {\n *   const out = num % P;\n *   return out >= 0n ? out : out + P;\n * };\n * const pow = (num: bigint, power: bigint) => {\n *   let res = 1n;\n *   for (; power > 0n; power >>= 1n) {\n *     if (power & 1n) res = mod(res * num);\n *     num = mod(num * num);\n *   }\n *   return res;\n * };\n * const x25519 = montgomery({\n *   P,\n *   type: 'x25519',\n *   adjustScalarBytes(bytes: Uint8Array) {\n *     bytes[0] &= 248;\n *     bytes[31] &= 127;\n *     bytes[31] |= 64;\n *     return bytes;\n *   },\n *   powPminus2(x) {\n *     return pow(x, P - 2n);\n *   },\n * });\n * const publicKey = x25519.getPublicKey(new Uint8Array(32).fill(1));\n * ```\n */\nexport function montgomery(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { P, type, adjustScalarBytes, powPminus2, randomBytes: rand } = CURVE;\n    const mulBaseHook = CURVE.scalarMultBase;\n    const is25519 = type === 'x25519';\n    if (!is25519 && type !== 'x448')\n        throw new Error('invalid type');\n    const randomBytes_ = rand === undefined ? randomBytes : rand;\n    const montgomeryBits = is25519 ? 255 : 448;\n    const swap = cswap(P);\n    const fieldLen = is25519 ? 32 : 56;\n    const Gu = is25519 ? BigInt(9) : BigInt(5);\n    // RFC 7748 #5:\n    // The constant a24 is (486662 - 2) / 4 = 121665 for curve25519/X25519 and\n    // (156326 - 2) / 4 = 39081 for curve448/X448\n    // const a = is25519 ? 486662n : 156326n;\n    const a24 = is25519 ? BigInt(121665) : BigInt(39081);\n    // RFC: x25519 \"the resulting integer is of the form 2^254 plus\n    // eight times a value between 0 and 2^251 - 1 (inclusive)\"\n    // x448: \"2^447 plus four times a value between 0 and 2^445 - 1 (inclusive)\"\n    const minScalar = is25519 ? _2n ** BigInt(254) : _2n ** BigInt(447);\n    const maxAdded = is25519\n        ? BigInt(8) * (_2n ** BigInt(251) - _1n)\n        : BigInt(4) * (_2n ** BigInt(445) - _1n);\n    const maxScalar = minScalar + maxAdded + _1n; // (inclusive)\n    const modP = (n) => mod(n, P);\n    const GuBytes = encodeU(Gu);\n    function encodeU(u) {\n        return numberToBytesLE(modP(u), fieldLen);\n    }\n    function decodeU(u) {\n        const _u = copyBytes(abytes(u, fieldLen, 'uCoordinate'));\n        // RFC: When receiving such an array, implementations of X25519\n        // (but not X448) MUST mask the most significant bit in the final byte.\n        if (is25519)\n            _u[31] &= 127; // 0b0111_1111\n        // RFC: Implementations MUST accept non-canonical values and process them as\n        // if they had been reduced modulo the field prime.  The non-canonical\n        // values are 2^255 - 19 through 2^255 - 1 for X25519 and 2^448 - 2^224\n        // - 1 through 2^448 - 1 for X448.\n        return modP(bytesToNumberLE(_u));\n    }\n    function decodeScalar(scalar) {\n        return bytesToNumberLE(adjustScalarBytes(copyBytes(abytes(scalar, fieldLen, 'scalar'))));\n    }\n    /**\n     * u coordinates whose order divides the cofactor, on the curve and on its quadratic twist -\n     * the ladder sends every one of them to zero. Same blocklist libsodium and post-CVE-2017-0379\n     * Libgcrypt carry. decodeU() reduces mod P first, so the non-canonical encodings P and P + 1\n     * collapse onto 0 and 1, and `type` admits no curve beyond these two, so both lists are total.\n     *\n     * Complete by construction: x-only doubling sends u to (u^2 - 1)^2 / 4u(u^2 + a*u + 1). Order 4\n     * therefore needs (u^2 - 1)^2 === 0, i.e. u = +-1; order 2 needs u(u^2 + a*u + 1) === 0, and\n     * a^2 - 4 is a non-residue on both curves, leaving u = 0. curve448 stops there (cofactor 4);\n     * curve25519 (cofactor 8) adds the two order-8 roots below. Cross-checked by clearing the\n     * cofactor with those same doublings over 200k random u: no sixth value exists.\n     */\n    const lowOrderU = new Set(is25519\n        ? [\n            _0n,\n            _1n,\n            P - _1n,\n            BigInt('325606250916557431795983626356110631294008115727848805560023387167927233504'),\n            BigInt('39382357235489614581723060781553021112529911719440698176882885853963445705823'),\n        ]\n        : [_0n, _1n, P - _1n]);\n    function scalarMult(scalar, u) {\n        // Some public keys are useless, of low-order. Curve author doesn't think\n        // it needs to be validated, but we do it nonetheless.\n        // https://cr.yp.to/ecdh.html#validate\n        //\n        // Reject them BEFORE the ladder. RFC 7748 #6.1 also permits detecting them from the\n        // all-zero output, but that first runs all 255 rounds against the long-term secret,\n        // handing an unauthenticated attacker a free timing oracle. Low-order inputs also drive\n        // the ladder into a degenerate state (x_2 + z_2 === 0) whose extra zero-operand\n        // multiplications amplify any residual key-dependent timing.\n        const pointU = decodeU(u);\n        if (lowOrderU.has(pointU))\n            throw new Error('invalid private or public key received');\n        const pu = montgomeryLadder(pointU, decodeScalar(scalar));\n        // Unreachable for RFC 7748 clamped scalars, which are cofactor multiples smaller than the\n        // group order; kept because adjustScalarBytes is caller-supplied.\n        if (pu === _0n)\n            throw new Error('invalid private or public key received');\n        return encodeU(pu);\n    }\n    // Computes public key from private. By doing scalar multiplication of base point.\n    // With a curve-provided fixed-base hook (Edwards tables), the ladder is skipped, but the\n    // contract \u2014 scalar validation, low-order rejection, encoding \u2014 stays identical.\n    function scalarMultBase(scalar) {\n        if (mulBaseHook === undefined)\n            return scalarMult(scalar, GuBytes);\n        const k = decodeScalar(scalar);\n        aInRange('scalar', k, minScalar, maxScalar);\n        const pu = modP(mulBaseHook(k));\n        if (pu === _0n)\n            throw new Error('invalid private or public key received');\n        return encodeU(pu);\n    }\n    const getPublicKey = scalarMultBase;\n    const getSharedSecret = scalarMult;\n    /**\n     * Montgomery x-only multiplication ladder for the selected X25519/X448 curve.\n     * @param pointU - decoded Montgomery u coordinate for the selected curve\n     * @param scalar - decoded clamped scalar by which the point is multiplied\n     * @returns resulting Montgomery u coordinate for the selected curve\n     */\n    function montgomeryLadder(u, scalar) {\n        aInRange('u', u, _0n, P);\n        aInRange('scalar', scalar, minScalar, maxScalar);\n        const k = scalar;\n        const x_1 = u;\n        let x_2 = _1n;\n        let z_2 = _0n;\n        let x_3 = u;\n        let z_3 = _1n;\n        // The RFC tracks `swap` across rounds to hold k_t XOR k_(t+1); the low bit of `kx >> t` is\n        // the same value, without the carried state. aInRange above pins bit (montgomeryBits - 1)\n        // of k set and everything above it clear, so `kx >> t` is never zero and its width is a\n        // function of t alone - never of a secret bit.\n        const kx = k ^ (k >> _1n);\n        for (let t = BigInt(montgomeryBits - 1); t >= _0n; t--) {\n            const mask = cmask(P, kx >> t);\n            ({ x_2, x_3 } = swap(mask, x_2, x_3));\n            ({ x_2: z_2, x_3: z_3 } = swap(mask, z_2, z_3));\n            const A = x_2 + z_2;\n            const AA = modP(A * A);\n            const B = x_2 - z_2;\n            const BB = modP(B * B);\n            const E = AA - BB;\n            const C = x_3 + z_3;\n            const D = x_3 - z_3;\n            const DA = modP(D * A);\n            const CB = modP(C * B);\n            const dacb = DA + CB;\n            const da_cb = DA - CB;\n            x_3 = modP(dacb * dacb);\n            z_3 = modP(x_1 * modP(da_cb * da_cb));\n            x_2 = modP(AA * BB);\n            z_2 = modP(E * (AA + modP(a24 * E)));\n        }\n        // trailing cswap: the RFC's `swap` holds k_0 here, which is the low bit of k\n        const mask = cmask(P, k);\n        ({ x_2, x_3 } = swap(mask, x_2, x_3));\n        ({ x_2: z_2, x_3: z_3 } = swap(mask, z_2, z_3));\n        const z2 = powPminus2(z_2); // `Fp.pow(x, P - _2n)` is much slower equivalent\n        return modP(x_2 * z2); // Return x_2 * (z_2^(p - 2))\n    }\n    const lengths = {\n        secretKey: fieldLen,\n        publicKey: fieldLen,\n        seed: fieldLen,\n    };\n    const randomSecretKey = (seed) => {\n        seed = seed === undefined ? randomBytes_(fieldLen) : seed;\n        abytes(seed, lengths.seed, 'seed');\n        // Reuse caller-supplied seed bytes verbatim; clamping is deferred until\n        // decodeScalar(...) when the secret key is actually used.\n        return seed;\n    };\n    const utils = { randomSecretKey };\n    Object.freeze(lengths);\n    Object.freeze(utils);\n    return Object.freeze({\n        keygen: createKeygen(randomSecretKey, getPublicKey),\n        getSharedSecret,\n        getPublicKey,\n        scalarMult,\n        scalarMultBase,\n        utils,\n        GuBytes: GuBytes.slice(),\n        lengths,\n    });\n}\n", "/**\n * ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha512 } from '@noble/hashes/sha2.js';\nimport { abytes, concatBytes, hexToBytes } from '@noble/hashes/utils.js';\nimport {} from \"./abstract/curve.js\";\nimport { eddsa, edwards, PrimeEdwardsPoint, } from \"./abstract/edwards.js\";\nimport { createFROST } from \"./abstract/frost.js\";\nimport { _DST_scalar, createHasher, expand_message_xmd, } from \"./abstract/hash-to-curve.js\";\nimport { FpInvertBatch, FpSqrtEven, isNegativeLE, mod, pow2, } from \"./abstract/modular.js\";\nimport { montgomery } from \"./abstract/montgomery.js\";\nimport { createOPRF } from \"./abstract/oprf.js\";\nimport { asciiToBytes, bytesToNumberLE, equalBytes } from \"./utils.js\";\n// prettier-ignore\nconst _0n = /* @__PURE__ */ BigInt(0), _1n = /* @__PURE__ */ BigInt(1), _2n = /* @__PURE__ */ BigInt(2), _3n = /* @__PURE__ */ BigInt(3);\n// prettier-ignore\nconst _5n = /* @__PURE__ */ BigInt(5), _8n = /* @__PURE__ */ BigInt(8);\n// P = 2n**255n - 19n\nconst ed25519_CURVE_p = /* @__PURE__ */ BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed');\n// N = 2n**252n + 27742317777372353535851937790883648493n\n// a = Fp.create(BigInt(-1))\n// d = -121665/121666 a.k.a. Fp.neg(121665 * Fp.inv(121666))\nconst ed25519_CURVE = /* @__PURE__ */ (() => ({\n    p: ed25519_CURVE_p,\n    n: BigInt('0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed'),\n    h: _8n,\n    a: BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec'),\n    d: BigInt('0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3'),\n    Gx: BigInt('0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a'),\n    Gy: BigInt('0x6666666666666666666666666666666666666666666666666666666666666658'),\n}))();\nfunction ed25519_pow_2_252_3(x) {\n    // prettier-ignore\n    const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);\n    const P = ed25519_CURVE_p;\n    const x2 = (x * x) % P;\n    const b2 = (x2 * x) % P; // x^3, 11\n    const b4 = (pow2(b2, _2n, P) * b2) % P; // x^15, 1111\n    const b5 = (pow2(b4, _1n, P) * x) % P; // x^31\n    const b10 = (pow2(b5, _5n, P) * b5) % P;\n    const b20 = (pow2(b10, _10n, P) * b10) % P;\n    const b40 = (pow2(b20, _20n, P) * b20) % P;\n    const b80 = (pow2(b40, _40n, P) * b40) % P;\n    const b160 = (pow2(b80, _80n, P) * b80) % P;\n    const b240 = (pow2(b160, _80n, P) * b80) % P;\n    const b250 = (pow2(b240, _10n, P) * b10) % P;\n    const pow_p_5_8 = (pow2(b250, _2n, P) * x) % P;\n    // ^ This is x^((p-5)/8); multiply by x once more to get x^((p+3)/8).\n    return { pow_p_5_8, b2 };\n}\n// Mutates and returns the provided 32-byte buffer in place.\nfunction adjustScalarBytes(bytes) {\n    // Section 5: For X25519, in order to decode 32 random bytes as an integer scalar,\n    // set the three least significant bits of the first byte\n    bytes[0] &= 248; // 0b1111_1000\n    // and the most significant bit of the last to zero,\n    bytes[31] &= 127; // 0b0111_1111\n    // set the second most significant bit of the last byte to 1\n    bytes[31] |= 64; // 0b0100_0000\n    return bytes;\n}\n// \u221A(-1) aka \u221A(a) aka 2^((p-1)/4)\n// Fp.sqrt(Fp.neg(1))\nconst ED25519_SQRT_M1 = /* @__PURE__ */ BigInt('19681161376707505956807079304988542015446066515923890162744021073123829784752');\n// sqrt(u/v). Returns `{ isValid, value }`; on non-squares `value` is still a\n// dummy root-shaped field element so callers can stay constant-time.\nfunction uvRatio(u, v) {\n    const P = ed25519_CURVE_p;\n    const v3 = mod(v * v * v, P); // v\u00B3\n    const v7 = mod(v3 * v3 * v, P); // v\u2077\n    // (p+3)/8 and (p-5)/8\n    const pow = ed25519_pow_2_252_3(u * v7).pow_p_5_8;\n    let x = mod(u * v3 * pow, P); // (uv\u00B3)(uv\u2077)^(p-5)/8\n    const vx2 = mod(v * x * x, P); // vx\u00B2\n    const root1 = x; // First root candidate\n    const root2 = mod(x * ED25519_SQRT_M1, P); // Second root candidate\n    const useRoot1 = vx2 === u; // If vx\u00B2 = u (mod p), x is a square root\n    const useRoot2 = vx2 === mod(-u, P); // If vx\u00B2 = -u, set x <-- x * 2^((p-1)/4)\n    const noRoot = vx2 === mod(-u * ED25519_SQRT_M1, P); // There is no valid root, vx\u00B2 = -u\u221A(-1)\n    if (useRoot1)\n        x = root1;\n    if (useRoot2 || noRoot)\n        x = root2; // We return root2 anyway, for const-time\n    if (isNegativeLE(x, P))\n        x = mod(-x, P);\n    return { isValid: useRoot1 || useRoot2, value: x };\n}\nconst ed25519_Point = /* @__PURE__ */ edwards(ed25519_CURVE, { uvRatio });\n// Public field alias stays stricter than the RFC 8032 Appendix A sample code:\n// `Fp.inv(0)` throws instead of returning `0`.\nconst Fp = /* @__PURE__ */ (() => ed25519_Point.Fp)();\nfunction toMontgomery(point) {\n    // Birational map from Ed25519 to Curve25519 / X25519:\n    //   (u, v) = ((1 + y) / (1 - y), sqrt(-486664) * u / x)\n    //   (x, y) = (sqrt(-486664) * u / v, (u - 1) / (u + 1))\n    const { y } = point;\n    return Fp.toBytes(Fp.div(_1n + y, _1n - y));\n}\nfunction toMontgomerySecret(secretKey) {\n    const size = ed25519_Point.Fp.BYTES;\n    abytes(secretKey, size);\n    return adjustScalarBytes(sha512(secretKey.subarray(0, size))).subarray(0, size);\n}\nconst Fn = /* @__PURE__ */ (() => ed25519_Point.Fn)();\n// RFC 8032 `dom2` helper for ctx/ph variants only. Plain Ed25519 keeps the\n// empty-domain path in `ed()` and would be wrong if routed through this helper.\nfunction ed25519_domain(data, ctx, phflag) {\n    if (ctx.length > 255)\n        throw new Error('Context is too big');\n    return concatBytes(asciiToBytes('SigEd25519 no Ed25519 collisions'), new Uint8Array([phflag ? 1 : 0, ctx.length]), ctx, data);\n}\nfunction ed(opts) {\n    // Ed25519 keeps ZIP-215 default verification semantics for consensus compatibility.\n    return eddsa(ed25519_Point, sha512, Object.assign({ adjustScalarBytes, toMontgomery, toMontgomerySecret, zip215: true }, opts));\n}\n/**\n * ed25519 curve with EdDSA signatures.\n * Seeded `keygen(seed)` / `utils.randomSecretKey(seed)` reuse the provided\n * 32-byte seed buffer instead of copying it.\n * @example\n * Generate one Ed25519 keypair, sign a message, and verify it.\n *\n * ```js\n * import { ed25519 } from '@noble/curves/ed25519.js';\n * const { secretKey, publicKey } = ed25519.keygen();\n * // const publicKey = ed25519.getPublicKey(secretKey);\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = ed25519.sign(msg, secretKey);\n * const isValid = ed25519.verify(sig, msg, publicKey); // ZIP215\n * // RFC8032 / FIPS 186-5\n * const isValid2 = ed25519.verify(sig, msg, publicKey, { zip215: false });\n * ```\n */\nexport const ed25519 = /* @__PURE__ */ ed({});\n/**\n * Context version of ed25519 (ctx for domain separation). See {@link ed25519}\n * Seeded `keygen(seed)` / `utils.randomSecretKey(seed)` reuse the provided\n * 32-byte seed buffer instead of copying it.\n * @example\n * Sign and verify with Ed25519ctx under one explicit context.\n *\n * ```ts\n * const context = new TextEncoder().encode('docs');\n * const { secretKey, publicKey } = ed25519ctx.keygen();\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = ed25519ctx.sign(msg, secretKey, { context });\n * const isValid = ed25519ctx.verify(sig, msg, publicKey, { context });\n * ```\n */\nexport const ed25519ctx = /* @__PURE__ */ ed({ domain: ed25519_domain });\n/**\n * Prehashed version of ed25519. See {@link ed25519}\n * Seeded `keygen(seed)` / `utils.randomSecretKey(seed)` reuse the provided\n * 32-byte seed buffer instead of copying it.\n * @example\n * Use the prehashed Ed25519 variant for one message.\n *\n * ```ts\n * const { secretKey, publicKey } = ed25519ph.keygen();\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = ed25519ph.sign(msg, secretKey);\n * const isValid = ed25519ph.verify(sig, msg, publicKey);\n * ```\n */\nexport const ed25519ph = /* @__PURE__ */ ed({ domain: ed25519_domain, prehash: sha512 });\n/**\n * FROST threshold signatures over ed25519. RFC 9591.\n * @example\n * Create one trusted-dealer package for 2-of-3 ed25519 signing.\n *\n * ```ts\n * const alice = ed25519_FROST.Identifier.derive('alice@example.com');\n * const bob = ed25519_FROST.Identifier.derive('bob@example.com');\n * const carol = ed25519_FROST.Identifier.derive('carol@example.com');\n * const deal = ed25519_FROST.trustedDealer({ min: 2, max: 3 }, [alice, bob, carol]);\n * ```\n */\nexport const ed25519_FROST = /* @__PURE__ */ (() => createFROST({\n    name: 'FROST-ED25519-SHA512-v1',\n    Point: ed25519_Point,\n    validatePoint: (p) => {\n        p.assertValidity();\n        if (!p.isTorsionFree())\n            throw new Error('bad point: not torsion-free');\n    },\n    hash: sha512,\n    // RFC 9591 keeps H2 undecorated here for RFC 8032 compatibility. In createFROST(),\n    // `H2: ''` becomes an empty DST prefix; the built-in hashToScalar fallback treats\n    // that the same as omitted DST, even though custom hooks can still observe the empty bag.\n    H2: '',\n}))();\n/**\n * ECDH using curve25519 aka x25519.\n * `getSharedSecret()` rejects low-order peer inputs by default, and seeded\n * `keygen(seed)` reuses the provided 32-byte seed buffer instead of copying it.\n * @example\n * Derive one shared secret between two X25519 peers.\n *\n * ```js\n * import { x25519 } from '@noble/curves/ed25519.js';\n * const alice = x25519.keygen();\n * const bob = x25519.keygen();\n * const alicePublic = x25519.getPublicKey(alice.secretKey);\n * const shared = x25519.getSharedSecret(alice.secretKey, bob.publicKey);\n * ```\n */\nexport const x25519 = /* @__PURE__ */ (() => {\n    const P = ed25519_CURVE_p;\n    const powPminus2 = (x) => {\n        // x^(p-2) aka x^(2^255-21)\n        const { pow_p_5_8, b2 } = ed25519_pow_2_252_3(x);\n        return mod(pow2(pow_p_5_8, _3n, P) * b2, P);\n    };\n    return montgomery({\n        P,\n        type: 'x25519',\n        powPminus2,\n        adjustScalarBytes,\n        // ~3x faster fixed-base: [k]B on the birationally-equivalent Edwards curve using cached\n        // base tables, mapped back via u = (1+y)/(1-y) = (Z+Y)/(Z-Y) with one Fermat inversion.\n        // Same construction as libsodium's crypto_scalarmult_curve25519_base.\n        scalarMultBase: (k) => {\n            // Clamped k (\u22482^254) exceeds n, but B has prime order n, so [k]B == [k mod n]B.\n            const kn = mod(k, ed25519_Point.Fn.ORDER);\n            // k \u2261 0 (mod n): [k]B is the point at infinity, whose u is 0 in the x-only ladder;\n            // returning 0 makes montgomery() reject it exactly like the ladder path.\n            if (kn === _0n)\n                return _0n;\n            const p = ed25519_Point.BASE.multiply(kn);\n            // Z-Y == 0 only at the identity, which kn != 0 excludes.\n            return mod((p.Z + p.Y) * powPminus2(mod(p.Z - p.Y, P)), P);\n        },\n    });\n})();\n// Hash To Curve Elligator2 Map (NOTE: different from ristretto255 elligator)\n// RFC 9380 Appendix G.2.2 / Err4730 requires `sgn0(c1) = 0` for the Edwards\n// map constant below, so use the even root explicitly.\n// 1. c1 = (q + 3) / 8 # Integer arithmetic\nconst ELL2_C1 = /* @__PURE__ */ (() => (ed25519_CURVE_p + _3n) / _8n)();\nconst ELL2_C2 = /* @__PURE__ */ (() => Fp.pow(_2n, ELL2_C1))(); // 2. c2 = 2^c1\nconst ELL2_C3 = /* @__PURE__ */ (() => Fp.sqrt(Fp.neg(Fp.ONE)))(); // 3. c3 = sqrt(-1)\nconst ELL2_J = /* @__PURE__ */ BigInt(486662);\n/**\n * RFC 9380 method `map_to_curve_elligator2_curve25519`. Experimental name: may be renamed later.\n * @private\n */\n// prettier-ignore\nexport function _map_to_curve_elligator2_curve25519(u) {\n    // 4. c4 = (q - 5) / 8: tv2^c4 below reuses the ed25519_pow_2_252_3 addition chain,\n    // whose pow_p_5_8 output is exactly x^((p-5)/8).\n    let tv1 = Fp.sqr(u); //  1.  tv1 = u^2\n    tv1 = Fp.mul(tv1, _2n); //  2.  tv1 = 2 * tv1\n    // 3. xd = tv1 + 1 # Nonzero: -1 is square (mod p), tv1 is not\n    let xd = Fp.add(tv1, Fp.ONE);\n    let x1n = Fp.neg(ELL2_J); //  4.  x1n = -J              # x1 = x1n / xd = -J / (1 + 2 * u^2)\n    let tv2 = Fp.sqr(xd); //  5.  tv2 = xd^2\n    let gxd = Fp.mul(tv2, xd); //  6.  gxd = tv2 * xd        # gxd = xd^3\n    let gx1 = Fp.mul(tv1, ELL2_J); //  7.  gx1 = J * tv1         # x1n + J * xd\n    gx1 = Fp.mul(gx1, x1n); //  8.  gx1 = gx1 * x1n       # x1n^2 + J * x1n * xd\n    gx1 = Fp.add(gx1, tv2); //  9.  gx1 = gx1 + tv2       # x1n^2 + J * x1n * xd + xd^2\n    gx1 = Fp.mul(gx1, x1n); //  10. gx1 = gx1 * x1n       # x1n^3 + J * x1n^2 * xd + x1n * xd^2\n    let tv3 = Fp.sqr(gxd); //  11. tv3 = gxd^2\n    tv2 = Fp.sqr(tv3); //  12. tv2 = tv3^2           # gxd^4\n    tv3 = Fp.mul(tv3, gxd); //  13. tv3 = tv3 * gxd       # gxd^3\n    tv3 = Fp.mul(tv3, gx1); //  14. tv3 = tv3 * gx1       # gx1 * gxd^3\n    tv2 = Fp.mul(tv2, tv3); //  15. tv2 = tv2 * tv3       # gx1 * gxd^7\n    let y11 = ed25519_pow_2_252_3(tv2).pow_p_5_8; //  16. y11 = tv2^c4  # (gx1 * gxd^7)^((p - 5) / 8)\n    y11 = Fp.mul(y11, tv3); //  17. y11 = y11 * tv3       # gx1*gxd^3*(gx1*gxd^7)^((p-5)/8)\n    let y12 = Fp.mul(y11, ELL2_C3); //  18. y12 = y11 * c3\n    tv2 = Fp.sqr(y11); //  19. tv2 = y11^2\n    tv2 = Fp.mul(tv2, gxd); //  20. tv2 = tv2 * gxd\n    let e1 = Fp.eql(tv2, gx1); //  21.  e1 = tv2 == gx1\n    // 22. y1 = CMOV(y12, y11, e1) # If g(x1) is square, this is its sqrt\n    let y1 = Fp.cmov(y12, y11, e1);\n    let x2n = Fp.mul(x1n, tv1); //  23. x2n = x1n * tv1       # x2 = x2n / xd = 2 * u^2 * x1n / xd\n    let y21 = Fp.mul(y11, u); //  24. y21 = y11 * u\n    y21 = Fp.mul(y21, ELL2_C2); //  25. y21 = y21 * c2\n    let y22 = Fp.mul(y21, ELL2_C3); //  26. y22 = y21 * c3\n    let gx2 = Fp.mul(gx1, tv1); //  27. gx2 = gx1 * tv1       # g(x2) = gx2 / gxd = 2 * u^2 * g(x1)\n    tv2 = Fp.sqr(y21); //  28. tv2 = y21^2\n    tv2 = Fp.mul(tv2, gxd); //  29. tv2 = tv2 * gxd\n    let e2 = Fp.eql(tv2, gx2); //  30.  e2 = tv2 == gx2\n    // 31. y2 = CMOV(y22, y21, e2) # If g(x2) is square, this is its sqrt\n    let y2 = Fp.cmov(y22, y21, e2);\n    tv2 = Fp.sqr(y1); //  32. tv2 = y1^2\n    tv2 = Fp.mul(tv2, gxd); //  33. tv2 = tv2 * gxd\n    let e3 = Fp.eql(tv2, gx1); //  34.  e3 = tv2 == gx1\n    let xn = Fp.cmov(x2n, x1n, e3); //  35.  xn = CMOV(x2n, x1n, e3)  # If e3, x = x1, else x = x2\n    let y = Fp.cmov(y2, y1, e3); //  36.   y = CMOV(y2, y1, e3)    # If e3, y = y1, else y = y2\n    let e4 = Fp.isOdd(y); //  37.  e4 = sgn0(y) == 1        # Fix sign of y\n    y = Fp.cmov(y, Fp.neg(y), e3 !== e4); //  38.   y = CMOV(y, -y, e3 XOR e4)\n    return { xMn: xn, xMd: xd, yMn: y, yMd: _1n }; //  39. return (xn, xd, y, 1)\n}\n// sgn0(c1) MUST equal 0\nconst ELL2_C1_EDWARDS = /* @__PURE__ */ (() => FpSqrtEven(Fp, Fp.neg(BigInt(486664))))();\nfunction map_to_curve_elligator2_edwards25519(u) {\n    // 1. (xMn, xMd, yMn, yMd) = map_to_curve_elligator2_curve25519(u)\n    const { xMn, xMd, yMn, yMd } = _map_to_curve_elligator2_curve25519(u);\n    // map_to_curve_elligator2_curve25519(u)\n    let xn = Fp.mul(xMn, yMd); //  2.  xn = xMn * yMd\n    xn = Fp.mul(xn, ELL2_C1_EDWARDS); //  3.  xn = xn * c1\n    let xd = Fp.mul(xMd, yMn); //  4.  xd = xMd * yMn    # xn / xd = c1 * xM / yM\n    let yn = Fp.sub(xMn, xMd); //  5.  yn = xMn - xMd\n    // 6. yd = xMn + xMd # (n / d - 1) / (n / d + 1) = (n - d) / (n + d)\n    let yd = Fp.add(xMn, xMd);\n    let tv1 = Fp.mul(xd, yd); //  7. tv1 = xd * yd\n    let e = Fp.eql(tv1, Fp.ZERO); //  8.   e = tv1 == 0\n    xn = Fp.cmov(xn, Fp.ZERO, e); //  9.  xn = CMOV(xn, 0, e)\n    xd = Fp.cmov(xd, Fp.ONE, e); //  10. xd = CMOV(xd, 1, e)\n    yn = Fp.cmov(yn, Fp.ONE, e); //  11. yn = CMOV(yn, 1, e)\n    yd = Fp.cmov(yd, Fp.ONE, e); //  12. yd = CMOV(yd, 1, e)\n    const [xd_inv, yd_inv] = FpInvertBatch(Fp, [xd, yd], true); // batch division\n    // Noble normalizes the RFC rational representation to affine `{ x, y }`\n    // before returning from the internal helper.\n    return { x: Fp.mul(xn, xd_inv), y: Fp.mul(yn, yd_inv) }; //  13. return (xn, xd, yn, yd)\n}\n/**\n * Hashing to ed25519 points / field. RFC 9380 methods.\n * Public `mapToCurve()` returns the cofactor-cleared subgroup point; the\n * internal map callback below consumes one field element bigint, not `[bigint]`.\n * @example\n * Hash one message onto the ed25519 curve.\n *\n * ```ts\n * const point = ed25519_hasher.hashToCurve(new TextEncoder().encode('hello noble'));\n * ```\n */\nexport const ed25519_hasher = /* @__PURE__ */ (() => createHasher(ed25519_Point, (scalars) => map_to_curve_elligator2_edwards25519(scalars[0]), {\n    DST: 'edwards25519_XMD:SHA-512_ELL2_RO_',\n    encodeDST: 'edwards25519_XMD:SHA-512_ELL2_NU_',\n    p: ed25519_CURVE_p,\n    m: 1,\n    k: 128,\n    expand: 'xmd',\n    hash: sha512,\n}))();\n// \u221A(-1) aka \u221A(a) aka 2^((p-1)/4)\nconst SQRT_M1 = ED25519_SQRT_M1;\n// \u221A(ad - 1)\nconst SQRT_AD_MINUS_ONE = /* @__PURE__ */ BigInt('25063068953384623474111414158702152701244531502492656460079210482610430750235');\n// 1 / \u221A(a-d)\nconst INVSQRT_A_MINUS_D = /* @__PURE__ */ BigInt('54469307008909316920995813868745141605393597292927456921205312896311721017578');\n// 1-d\u00B2\nconst ONE_MINUS_D_SQ = /* @__PURE__ */ BigInt('1159843021668779879193775521855586647937357759715417654439879720876111806838');\n// (d-1)\u00B2\nconst D_MINUS_ONE_SQ = /* @__PURE__ */ BigInt('40440834346308536858101042469323190826248399146238708352240133220865137265952');\n// `SQRT_RATIO_M1(1, number)` specialization. Returns `{ isValid, value }`,\n// where non-squares get the nonnegative `sqrt(SQRT_M1 / number)` branch.\nconst invertSqrt = (number) => uvRatio(_1n, number);\nconst MAX_255B = /* @__PURE__ */ BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff');\n// RFC 9496 \u00A74.3.4 MAP parser: masks bit 255 and reduces modulo p for element\n// derivation. The decode path has the opposite contract and rejects that bit.\nconst bytes255ToNumberLE = (bytes) => Fp.create(bytesToNumberLE(bytes) & MAX_255B);\n/**\n * Computes Elligator map for Ristretto255.\n * Primary formula source is RFC 9496 \u00A74.3.4 MAP; RFC 9380 Appendix B builds\n * `hash_to_ristretto255` on top of this helper.\n * Returns an internal Edwards representative, not a public `_RistrettoPoint`.\n */\nfunction calcElligatorRistrettoMap(r0) {\n    const { d } = ed25519_CURVE;\n    const r = Fp.mul(Fp.mulN(SQRT_M1, r0), r0); // 1\n    const Ns = Fp.mul(Fp.addN(r, _1n), ONE_MINUS_D_SQ); // 2\n    let c = BigInt(-1); // 3\n    const D = Fp.mul(Fp.subN(c, Fp.mulN(d, r)), Fp.add(r, d)); // 4\n    let { isValid: Ns_D_is_sq, value: s } = uvRatio(Ns, D); // 5\n    let s_ = Fp.mul(s, r0); // 6\n    if (!Fp.isOdd(s_))\n        s_ = Fp.neg(s_);\n    if (!Ns_D_is_sq)\n        s = s_; // 7\n    if (!Ns_D_is_sq)\n        c = r; // 8\n    const Nt = Fp.sub(Fp.mulN(Fp.mulN(c, Fp.subN(r, _1n)), D_MINUS_ONE_SQ), D); // 9\n    const s2 = Fp.sqrN(s);\n    const W0 = Fp.mul(Fp.addN(s, s), D); // 10\n    const W1 = Fp.mul(Nt, SQRT_AD_MINUS_ONE); // 11\n    const W2 = Fp.sub(_1n, s2); // 12\n    const W3 = Fp.add(_1n, s2); // 13\n    return new ed25519_Point(Fp.mul(W0, W3), Fp.mul(W2, W1), Fp.mul(W1, W3), Fp.mul(W0, W2));\n}\n/**\n * Wrapper over Edwards Point for ristretto255.\n *\n * Each ed25519/EdwardsPoint has 8 different equivalent points. This can be\n * a source of bugs for protocols like ring signatures. Ristretto was created to solve this.\n * Ristretto point operates in X:Y:Z:T extended coordinates like EdwardsPoint,\n * but it should work in its own namespace: do not combine those two.\n * See [RFC9496](https://www.rfc-editor.org/rfc/rfc9496).\n */\nclass _RistrettoPoint extends PrimeEdwardsPoint {\n    // Do NOT change syntax: the following gymnastics is done,\n    // because typescript strips comments, which makes bundlers disable tree-shaking.\n    // prettier-ignore\n    static BASE = \n    /* @__PURE__ */ (() => new _RistrettoPoint(ed25519_Point.BASE))();\n    // prettier-ignore\n    static ZERO = \n    /* @__PURE__ */ (() => new _RistrettoPoint(ed25519_Point.ZERO))();\n    // prettier-ignore\n    static Fp = \n    /* @__PURE__ */ (() => Fp)();\n    // prettier-ignore\n    static Fn = \n    /* @__PURE__ */ (() => Fn)();\n    constructor(ep) {\n        super(ep);\n    }\n    /**\n     * Create one Ristretto255 point from affine Edwards coordinates.\n     * This wraps the internal Edwards representative directly and is not a\n     * canonical ristretto255 decoding path.\n     * Use `toBytes()` / `fromBytes()` if canonical ristretto255 bytes matter.\n     */\n    static fromAffine(ap) {\n        return new _RistrettoPoint(ed25519_Point.fromAffine(ap));\n    }\n    assertSame(other) {\n        if (!(other instanceof _RistrettoPoint))\n            throw new Error('RistrettoPoint expected');\n    }\n    init(ep) {\n        return new _RistrettoPoint(ep);\n    }\n    static fromBytes(bytes) {\n        abytes(bytes, 32);\n        const { a, d } = ed25519_CURVE;\n        const s = bytes255ToNumberLE(bytes);\n        // 1. Check that s_bytes is the canonical encoding of a field element, or else abort.\n        // 3. Check that s is non-negative, or else abort\n        if (!equalBytes(Fp.toBytes(s), bytes) || Fp.isOdd(s))\n            throw new Error('invalid ristretto255 encoding 1');\n        const s2 = Fp.sqr(s);\n        const u1 = Fp.add(_1n, Fp.mulN(a, s2)); // 4 (a is -1)\n        const u2 = Fp.sub(_1n, Fp.mulN(a, s2)); // 5\n        const u1_2 = Fp.sqr(u1);\n        const u2_2 = Fp.sqr(u2);\n        const v = Fp.sub(Fp.mulN(Fp.mulN(a, d), u1_2), u2_2); // 6\n        const { isValid, value: I } = invertSqrt(Fp.mul(v, u2_2)); // 7\n        const Dx = Fp.mul(I, u2); // 8\n        const Dy = Fp.mul(Fp.mulN(I, Dx), v); // 9\n        let x = Fp.mul(Fp.addN(s, s), Dx); // 10\n        if (Fp.isOdd(x))\n            x = Fp.neg(x); // 10\n        const y = Fp.mul(u1, Dy); // 11\n        const t = Fp.mul(x, y); // 12\n        if (!isValid || Fp.isOdd(t) || Fp.is0(y))\n            throw new Error('invalid ristretto255 encoding 2');\n        return new _RistrettoPoint(new ed25519_Point(x, y, Fp.ONE, t));\n    }\n    /**\n     * Converts ristretto-encoded string to ristretto point.\n     * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-decode).\n     * @param hex - Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding\n     */\n    static fromHex(hex) {\n        return _RistrettoPoint.fromBytes(hexToBytes(hex));\n    }\n    /**\n     * Encodes ristretto point to Uint8Array.\n     * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-encode).\n     */\n    toBytes() {\n        let { X, Y, Z, T } = this.ep;\n        const u1 = Fp.mul(Fp.add(Z, Y), Fp.sub(Z, Y)); // 1\n        const u2 = Fp.mul(X, Y); // 2\n        // Square root always exists\n        const u2sq = Fp.sqr(u2);\n        const { value: invsqrt } = invertSqrt(Fp.mul(u1, u2sq)); // 3\n        const D1 = Fp.mul(invsqrt, u1); // 4\n        const D2 = Fp.mul(invsqrt, u2); // 5\n        const zInv = Fp.mul(Fp.mulN(D1, D2), T); // 6\n        let D; // 7\n        if (Fp.isOdd(Fp.mul(T, zInv))) {\n            let _x = Fp.mul(Y, SQRT_M1);\n            let _y = Fp.mul(X, SQRT_M1);\n            X = _x;\n            Y = _y;\n            D = Fp.mul(D1, INVSQRT_A_MINUS_D);\n        }\n        else {\n            D = D2; // 8\n        }\n        if (Fp.isOdd(Fp.mul(X, zInv)))\n            Y = Fp.neg(Y); // 9\n        let s = Fp.mul(Fp.subN(Z, Y), D); // 10 (check footer's note, no sqrt(-a))\n        if (Fp.isOdd(s))\n            s = Fp.neg(s);\n        return Fp.toBytes(s); // 11\n    }\n    /**\n     * Compares two Ristretto points.\n     * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-equals).\n     */\n    equals(other) {\n        this.assertSame(other);\n        const { X: X1, Y: Y1 } = this.ep;\n        const { X: X2, Y: Y2 } = other.ep;\n        // (x1 * y2 == y1 * x2) | (y1 * y2 == x1 * x2)\n        const one = Fp.eql(Fp.mul(X1, Y2), Fp.mul(Y1, X2));\n        const two = Fp.eql(Fp.mul(Y1, Y2), Fp.mul(X1, X2));\n        return one || two;\n    }\n    is0() {\n        return this.equals(_RistrettoPoint.ZERO);\n    }\n}\n/** Prime-order Ristretto255 group bundle. */\nexport const ristretto255 = /* @__PURE__ */ (() => {\n    Object.freeze(_RistrettoPoint.BASE);\n    Object.freeze(_RistrettoPoint.ZERO);\n    Object.freeze(_RistrettoPoint.prototype);\n    Object.freeze(_RistrettoPoint);\n    return Object.freeze({ Point: _RistrettoPoint });\n})();\n/**\n * Hashing to ristretto255 points / field. RFC 9380 methods.\n * `hashToCurve()` is RFC 9380 Appendix B, `deriveToCurve()` is the RFC 9496\n * \u00A74.3.4 element-derivation building block, and `hashToScalar()` is a\n * library-specific helper for OPRF-style use.\n * @example\n * Hash one message onto ristretto255.\n *\n * ```ts\n * const point = ristretto255_hasher.hashToCurve(new TextEncoder().encode('hello noble'));\n * ```\n */\nexport const ristretto255_hasher = \n/* @__PURE__ */ Object.freeze({\n    Point: _RistrettoPoint,\n    /**\n  * Spec: https://www.rfc-editor.org/rfc/rfc9380.html#name-hashing-to-ristretto255. Caveats:\n  * * There are no test vectors\n  * * encodeToCurve / mapToCurve is undefined\n  * * mapToCurve would be `calcElligatorRistrettoMap(scalars[0])`, not ristretto255_map!\n  * * hashToScalar is undefined too, so we just use OPRF implementation\n  * * We cannot re-use 'createHasher', because ristretto255_map is different algorithm/RFC\n    (os2ip -> bytes255ToNumberLE)\n  * * mapToCurve == calcElligatorRistrettoMap, hashToCurve == ristretto255_map\n  * * hashToScalar is undefined in RFC9380 for ristretto, so we use the OPRF\n    version here. Using `bytes255ToNumblerLE` will create a different result\n    if we use `bytes255ToNumberLE` as os2ip\n  * * current version is closest to spec.\n  */\n    hashToCurve(msg, options) {\n        // == 'hash_to_ristretto255'\n        // Preserve explicit empty/invalid DST overrides so expand_message_xmd() can reject them.\n        const DST = options?.DST === undefined ? 'ristretto255_XMD:SHA-512_R255MAP_RO_' : options.DST;\n        const xmd = expand_message_xmd(msg, DST, 64, sha512);\n        // NOTE: RFC 9380 incorrectly calls this function `ristretto255_map`.\n        // In RFC 9496, `map` was the per-point function inside the construction.\n        // That also led to confusion that `ristretto255_map` is `mapToCurve`.\n        // It is not: it is the older hash-to-curve construction.\n        return ristretto255_hasher.deriveToCurve(xmd);\n    },\n    hashToScalar(msg, options) {\n        const DST = options?.DST === undefined ? _DST_scalar : options.DST;\n        const xmd = expand_message_xmd(msg, DST, 64, sha512);\n        return Fn.create(bytesToNumberLE(xmd));\n    },\n    /**\n     * HashToCurve-like construction based on RFC 9496 (Element Derivation).\n     * Converts 64 uniform random bytes into a curve point.\n     *\n     * WARNING: This represents an older hash-to-curve construction from before\n     * RFC 9380 was finalized.\n     * It was later reused as a component in the newer\n     * `hash_to_ristretto255` function defined in RFC 9380.\n     */\n    deriveToCurve(bytes) {\n        // https://www.rfc-editor.org/rfc/rfc9496.html#name-element-derivation\n        abytes(bytes, 64);\n        const r1 = bytes255ToNumberLE(bytes.subarray(0, 32));\n        const R1 = calcElligatorRistrettoMap(r1);\n        const r2 = bytes255ToNumberLE(bytes.subarray(32, 64));\n        const R2 = calcElligatorRistrettoMap(r2);\n        return new _RistrettoPoint(R1.add(R2));\n    },\n});\n/**\n * ristretto255 OPRF/VOPRF/POPRF bundle, defined in RFC 9497.\n * @example\n * Run one blind/evaluate/finalize OPRF round over ristretto255.\n *\n * ```ts\n * const input = new TextEncoder().encode('hello noble');\n * const keys = ristretto255_oprf.oprf.generateKeyPair();\n * const blind = ristretto255_oprf.oprf.blind(input);\n * const evaluated = ristretto255_oprf.oprf.blindEvaluate(keys.secretKey, blind.blinded);\n * const output = ristretto255_oprf.oprf.finalize(input, blind.blind, evaluated);\n * ```\n */\nexport const ristretto255_oprf = /* @__PURE__ */ (() => createOPRF({\n    name: 'ristretto255-SHA512',\n    Point: _RistrettoPoint,\n    hash: sha512,\n    hashToGroup: ristretto255_hasher.hashToCurve,\n    hashToScalar: ristretto255_hasher.hashToScalar,\n}))();\n/**\n * FROST threshold signatures over ristretto255. RFC 9591.\n * @example\n * Create one trusted-dealer package for 2-of-3 ristretto255 signing.\n *\n * ```ts\n * const alice = ristretto255_FROST.Identifier.derive('alice@example.com');\n * const bob = ristretto255_FROST.Identifier.derive('bob@example.com');\n * const carol = ristretto255_FROST.Identifier.derive('carol@example.com');\n * const deal = ristretto255_FROST.trustedDealer({ min: 2, max: 3 }, [alice, bob, carol]);\n * ```\n */\nexport const ristretto255_FROST = /* @__PURE__ */ (() => createFROST({\n    name: 'FROST-RISTRETTO255-SHA512-v1',\n    Point: _RistrettoPoint,\n    validatePoint: (p) => {\n        // Prime-order wrappers are torsion-free at the abstract-group level.\n        p.assertValidity();\n    },\n    hash: sha512,\n}))();\n/**\n * Weird / bogus points, useful for debugging.\n * All 8 ed25519 points of 8-torsion subgroup can be generated from the point\n * T = `26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05`.\n * The subgroup generated by `T` is `{ O, T, 2T, 3T, 4T, 5T, 6T, 7T }`; the\n * array below is that set, not the powers in that exact index order.\n * @example\n * Decode one known torsion point for debugging.\n *\n * ```ts\n * import { ED25519_TORSION_SUBGROUP, ed25519 } from '@noble/curves/ed25519.js';\n * const point = ed25519.Point.fromHex(ED25519_TORSION_SUBGROUP[1]);\n * ```\n */\nexport const ED25519_TORSION_SUBGROUP = /* @__PURE__ */ Object.freeze([\n    '0100000000000000000000000000000000000000000000000000000000000000',\n    'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a',\n    '0000000000000000000000000000000000000000000000000000000000000080',\n    '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05',\n    'ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f',\n    '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85',\n    '0000000000000000000000000000000000000000000000000000000000000000',\n    'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa',\n]);\n", null, null, null, "/**\n * Internal helpers for blake hash.\n * @module\n */\nimport { rotr } from \"./utils.js\";\n// Unrealized speed-up: a file-local copy of rotr measured ~1-2% faster blake2s/blake256/blake3\n// on Node 24 (V8 does not inline it into G1s/G2s across the module boundary). Reused from\n// utils for deduplication.\n/**\n * Internal blake permutation table.\n * Rows `0..9` serve BLAKE2s, rows `0..11` serve BLAKE2b with `10..11 = 0..1`, and Blake1 also\n * reuses the later rows shown below. Blake1 expands rounds `10..15` as `SIGMA[i % 10]`, so rows\n * `10..15` intentionally repeat rows `0..5` for the 14-round (256) and 16-round (512) variants.\n */\n// prettier-ignore\nexport const BSIGMA = /* @__PURE__ */ Uint8Array.from([\n    0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n    14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n    11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n    7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n    9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n    2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n    12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,\n    13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,\n    6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,\n    10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0,\n    0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n    14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n    // Blake1, unused in others\n    11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n    7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n    9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n    2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n]);\n// Unrealized speed-up: G1s/G2s return a fresh {a,b,c,d} per call (160\u00D7/blake2s block), which\n// V8's escape analysis does not eliminate when G stays a real call. Writing into one reused\n// module-level slot instead measured +4-6% blake2s/blake256 1MB throughput on Node 24 \u2014 but\n// ~2% slower blake3 (whose profile inlines G and scalar-replaces the fresh object) and no\n// difference on 32-byte inputs. Kept simple.\n// 32-bit / BLAKE2s first half of G, with the fixed `(16, 12)` rotation pair.\n// Parameter `x` is the RFC 7693 first-half message word, or Blake1's pre-mixed\n// `m[sigma[r][2i]] ^ u[sigma[r][2i+1]]` addend in the 32-bit path.\nexport function G1s(a, b, c, d, x) {\n    a = (a + b + x) | 0;\n    d = rotr(d ^ a, 16);\n    c = (c + d) | 0;\n    b = rotr(b ^ c, 12);\n    return { a, b, c, d };\n}\n// 32-bit / BLAKE2s second half of G.\n// Parameter `x` is the RFC 7693 second-half (`y`) message word, or Blake1's pre-mixed\n// `m[sigma[r][2i + 1]] ^ u[sigma[r][2i]]` addend in the 32-bit path.\nexport function G2s(a, b, c, d, x) {\n    a = (a + b + x) | 0;\n    d = rotr(d ^ a, 8);\n    c = (c + d) | 0;\n    b = rotr(b ^ c, 7);\n    return { a, b, c, d };\n}\n", "/**\n * blake2b (64-bit) & blake2s (8 to 32-bit) hash functions.\n * b could have been faster, but there is no fast u64 in js, so s is 1.5x faster.\n * @module\n */\nimport { BSIGMA, G1s, G2s } from \"./_blake.js\";\nimport { SHA256_IV } from \"./_md.js\";\nimport * as u64 from \"./_u64.js\";\n// prettier-ignore\nimport { abytes, aexists, anumber, aoutput, checkOpts, clean, copyBytes, createHasher, swap32IfBE, swap8IfBE, u32 } from \"./utils.js\";\n// Same IV words as `SHA512_IV`, but endian-swapped into LE u32 low/high halves\n// for the BLAKE2b u64 helpers below.\nconst B2B_IV = /* @__PURE__ */ Uint32Array.from([\n    0xf3bcc908, 0x6a09e667, 0x84caa73b, 0xbb67ae85, 0xfe94f82b, 0x3c6ef372, 0x5f1d36f1, 0xa54ff53a,\n    0xade682d1, 0x510e527f, 0x2b3e6c1f, 0x9b05688c, 0xfb41bd6b, 0x1f83d9ab, 0x137e2179, 0x5be0cd19,\n]);\n// Shared synchronous BLAKE2b work vector as LE u32 low/high halves.\nconst BBUF = /* @__PURE__ */ new Uint32Array(32);\n// BLAKE2b G mix split into two half-rounds over LE u32 low/high limbs.\nfunction G1b(a, b, c, d, msg, x) {\n    // NOTE: V is LE here\n    const Xl = msg[x], Xh = msg[x + 1]; // prettier-ignore\n    let Al = BBUF[2 * a], Ah = BBUF[2 * a + 1]; // prettier-ignore\n    let Bl = BBUF[2 * b], Bh = BBUF[2 * b + 1]; // prettier-ignore\n    let Cl = BBUF[2 * c], Ch = BBUF[2 * c + 1]; // prettier-ignore\n    let Dl = BBUF[2 * d], Dh = BBUF[2 * d + 1]; // prettier-ignore\n    // v[a] = (v[a] + v[b] + x) | 0;\n    const ll = u64.add3L(Al, Bl, Xl);\n    Ah = u64.add3H(ll, Ah, Bh, Xh);\n    Al = ll | 0;\n    // v[d] = rotr(v[d] ^ v[a], 32)\n    let xh = Dh ^ Ah, xl = Dl ^ Al; // prettier-ignore\n    Dh = u64.rotr32H(xh, xl);\n    Dl = u64.rotr32L(xh, xl);\n    // v[c] = (v[c] + v[d]) | 0;\n    ({ h: Ch, l: Cl } = u64.add(Ch, Cl, Dh, Dl));\n    // v[b] = rotr(v[b] ^ v[c], 24)\n    xh = Bh ^ Ch;\n    xl = Bl ^ Cl;\n    Bh = u64.rotrSH(xh, xl, 24);\n    Bl = u64.rotrSL(xh, xl, 24);\n    BBUF[2 * a] = Al;\n    BBUF[2 * a + 1] = Ah;\n    BBUF[2 * b] = Bl;\n    BBUF[2 * b + 1] = Bh;\n    BBUF[2 * c] = Cl;\n    BBUF[2 * c + 1] = Ch;\n    BBUF[2 * d] = Dl;\n    BBUF[2 * d + 1] = Dh;\n}\n// Second half-round of the same LE-limb BLAKE2b G mix; `x` is the message word offset.\nfunction G2b(a, b, c, d, msg, x) {\n    // NOTE: V is LE here\n    const Xl = msg[x], Xh = msg[x + 1]; // prettier-ignore\n    let Al = BBUF[2 * a], Ah = BBUF[2 * a + 1]; // prettier-ignore\n    let Bl = BBUF[2 * b], Bh = BBUF[2 * b + 1]; // prettier-ignore\n    let Cl = BBUF[2 * c], Ch = BBUF[2 * c + 1]; // prettier-ignore\n    let Dl = BBUF[2 * d], Dh = BBUF[2 * d + 1]; // prettier-ignore\n    // v[a] = (v[a] + v[b] + x) | 0;\n    const ll = u64.add3L(Al, Bl, Xl);\n    Ah = u64.add3H(ll, Ah, Bh, Xh);\n    Al = ll | 0;\n    // v[d] = rotr(v[d] ^ v[a], 16)\n    let xh = Dh ^ Ah, xl = Dl ^ Al; // prettier-ignore\n    Dh = u64.rotrSH(xh, xl, 16);\n    Dl = u64.rotrSL(xh, xl, 16);\n    // v[c] = (v[c] + v[d]) | 0;\n    ({ h: Ch, l: Cl } = u64.add(Ch, Cl, Dh, Dl));\n    // v[b] = rotr(v[b] ^ v[c], 63)\n    xh = Bh ^ Ch;\n    xl = Bl ^ Cl;\n    Bh = u64.rotrBH(xh, xl, 63);\n    Bl = u64.rotrBL(xh, xl, 63);\n    BBUF[2 * a] = Al;\n    BBUF[2 * a + 1] = Ah;\n    BBUF[2 * b] = Bl;\n    BBUF[2 * b + 1] = Bh;\n    BBUF[2 * c] = Cl;\n    BBUF[2 * c + 1] = Ch;\n    BBUF[2 * d] = Dl;\n    BBUF[2 * d + 1] = Dh;\n}\nfunction checkBlake2Opts(outputLen, opts = {}, keyLen, saltLen, persLen) {\n    anumber(keyLen);\n    // RFC 7693 \u00A72.1 requires digest length nn in 1..keyLen (keyLen doubles as\n    // the per-variant max for both key and digest lengths: 64 for b, 32 for s).\n    if (outputLen <= 0 || outputLen > keyLen)\n        throw new Error('\"dkLen\" must be 1..' + keyLen + ', got ' + outputLen);\n    const { key, salt, personalization } = opts;\n    // This API uses `undefined` for the RFC 7693 `kk = 0` case, so a provided key must be non-empty.\n    if (key !== undefined && (key.length < 1 || key.length > keyLen))\n        throw new Error('\"key\" expected to be undefined or of length=1..' + keyLen);\n    if (salt !== undefined)\n        abytes(salt, saltLen, 'salt');\n    if (personalization !== undefined)\n        abytes(personalization, persLen, 'personalization');\n}\n/** Internal base class for BLAKE2. */\nexport class _BLAKE2 {\n    buffer;\n    buffer32;\n    finished = false;\n    destroyed = false;\n    length = 0;\n    pos = 0;\n    blockLen;\n    outputLen;\n    canXOF = false;\n    constructor(blockLen, outputLen) {\n        anumber(blockLen);\n        anumber(outputLen);\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.buffer = new Uint8Array(blockLen);\n        this.buffer32 = u32(this.buffer);\n    }\n    update(data) {\n        aexists(this);\n        abytes(data);\n        // Main difference with other hashes: there is flag for last block,\n        // so we cannot process current block before we know that there\n        // is the next one. This significantly complicates logic and reduces ability\n        // to do zero-copy processing\n        const { blockLen, buffer, buffer32 } = this;\n        const len = data.length;\n        const offset = data.byteOffset;\n        const buf = data.buffer;\n        for (let pos = 0; pos < len;) {\n            // If buffer is full and we still have input (don't process last block, same as blake2s)\n            if (this.pos === blockLen) {\n                swap32IfBE(buffer32);\n                this.compress(buffer32, 0, false);\n                swap32IfBE(buffer32);\n                this.pos = 0;\n            }\n            const take = Math.min(blockLen - this.pos, len - pos);\n            const dataOffset = offset + pos;\n            // Zero-copy only for full, 4-byte-aligned, non-final blocks.\n            if (take === blockLen && !(dataOffset % 4) && pos + take < len) {\n                const data32 = new Uint32Array(buf, dataOffset, Math.floor((len - pos) / 4));\n                swap32IfBE(data32);\n                for (let pos32 = 0; pos + blockLen < len; pos32 += buffer32.length, pos += blockLen) {\n                    this.length += blockLen;\n                    this.compress(data32, pos32, false);\n                }\n                swap32IfBE(data32);\n                continue;\n            }\n            // When the whole input is buffered in one go (common for short messages), passing `data`\n            // directly avoids allocating a subarray view.\n            buffer.set(pos === 0 && take === len ? data : data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            this.length += take;\n            pos += take;\n        }\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        aoutput(out, this);\n        // Reject unaligned views explicitly instead of hiding them behind a full scratch copy.\n        if (out.byteOffset & 3)\n            throw new RangeError('\"output\" expected 4-byte aligned byteOffset, got ' + out.byteOffset);\n        const { pos, buffer32 } = this;\n        this.finished = true;\n        // Padding\n        this.buffer.fill(0, pos);\n        swap32IfBE(buffer32);\n        this.compress(buffer32, 0, true);\n        swap32IfBE(buffer32);\n        const state = this.get();\n        // digest() passes our own `buffer` as `out`; reuse its cached u32 view instead of allocating.\n        const out32 = out === this.buffer ? buffer32 : u32(out);\n        const full = Math.floor(this.outputLen / 4);\n        for (let i = 0; i < full; i++)\n            out32[i] = swap8IfBE(state[i]);\n        const tail = this.outputLen % 4;\n        if (!tail)\n            return;\n        const off = full * 4;\n        const word = state[full];\n        for (let i = 0; i < tail; i++)\n            out[off + i] = word >>> (8 * i);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        // Return a copy so callers do not alias the instance scratch buffer used during finalization.\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        const { buffer, length, finished, destroyed, outputLen, pos } = this;\n        // Recreate only `dkLen`; key/salt/personalization are already absorbed into the copied state.\n        to ||= new this.constructor({ dkLen: outputLen });\n        to.set(...this.get());\n        // Last-block-aware lazy compression keeps the pending block live even when full.\n        to.buffer.set(buffer);\n        to.destroyed = destroyed;\n        to.finished = finished;\n        to.length = length;\n        to.pos = pos;\n        // @ts-ignore\n        to.outputLen = outputLen;\n        return to;\n    }\n    clone() {\n        return this._cloneInto();\n    }\n}\n/** Internal blake2b hash class with state stored as LE u32 low/high halves. */\nexport class _BLAKE2b extends _BLAKE2 {\n    // Same IV words as SHA-512 / BLAKE2b, encoded as LE u32 low/high halves.\n    v0l = B2B_IV[0] | 0;\n    v0h = B2B_IV[1] | 0;\n    v1l = B2B_IV[2] | 0;\n    v1h = B2B_IV[3] | 0;\n    v2l = B2B_IV[4] | 0;\n    v2h = B2B_IV[5] | 0;\n    v3l = B2B_IV[6] | 0;\n    v3h = B2B_IV[7] | 0;\n    v4l = B2B_IV[8] | 0;\n    v4h = B2B_IV[9] | 0;\n    v5l = B2B_IV[10] | 0;\n    v5h = B2B_IV[11] | 0;\n    v6l = B2B_IV[12] | 0;\n    v6h = B2B_IV[13] | 0;\n    v7l = B2B_IV[14] | 0;\n    v7h = B2B_IV[15] | 0;\n    constructor(opts = {}) {\n        opts = checkOpts({}, opts);\n        const olen = opts.dkLen === undefined ? 64 : opts.dkLen;\n        super(128, olen);\n        checkBlake2Opts(olen, opts, 64, 16, 16);\n        let { key, personalization, salt } = opts;\n        let keyLength = 0;\n        if (key !== undefined) {\n            abytes(key, undefined, 'key');\n            keyLength = key.length;\n        }\n        // RFC 7693 \u00A72.5: xor `p[0] = 0x0101kknn` into the low 32 bits of `h[0]`;\n        // the high 32 bits stay at `IV[0]`.\n        this.v0l ^= this.outputLen | (keyLength << 8) | (0x01 << 16) | (0x01 << 24);\n        if (salt !== undefined) {\n            abytes(salt, undefined, 'salt');\n            // Copy: u32() would throw on views with byteOffset not divisible by 4.\n            const slt = u32(copyBytes(salt));\n            this.v4l ^= swap8IfBE(slt[0]);\n            this.v4h ^= swap8IfBE(slt[1]);\n            this.v5l ^= swap8IfBE(slt[2]);\n            this.v5h ^= swap8IfBE(slt[3]);\n        }\n        if (personalization !== undefined) {\n            abytes(personalization, undefined, 'personalization');\n            // Copy: u32() would throw on views with byteOffset not divisible by 4.\n            const pers = u32(copyBytes(personalization));\n            this.v6l ^= swap8IfBE(pers[0]);\n            this.v6h ^= swap8IfBE(pers[1]);\n            this.v7l ^= swap8IfBE(pers[2]);\n            this.v7h ^= swap8IfBE(pers[3]);\n        }\n        if (key !== undefined) {\n            // Pad to blockLen and update\n            const tmp = new Uint8Array(this.blockLen);\n            tmp.set(key);\n            this.update(tmp);\n            // The padded copy holds key material; buffer/state keep what they need.\n            clean(tmp);\n        }\n    }\n    // prettier-ignore\n    get() {\n        let { v0l, v0h, v1l, v1h, v2l, v2h, v3l, v3h, v4l, v4h, v5l, v5h, v6l, v6h, v7l, v7h } = this;\n        return [v0l, v0h, v1l, v1h, v2l, v2h, v3l, v3h, v4l, v4h, v5l, v5h, v6l, v6h, v7l, v7h];\n    }\n    // prettier-ignore\n    set(v0l, v0h, v1l, v1h, v2l, v2h, v3l, v3h, v4l, v4h, v5l, v5h, v6l, v6h, v7l, v7h) {\n        this.v0l = v0l | 0;\n        this.v0h = v0h | 0;\n        this.v1l = v1l | 0;\n        this.v1h = v1h | 0;\n        this.v2l = v2l | 0;\n        this.v2h = v2h | 0;\n        this.v3l = v3l | 0;\n        this.v3h = v3h | 0;\n        this.v4l = v4l | 0;\n        this.v4h = v4h | 0;\n        this.v5l = v5l | 0;\n        this.v5h = v5h | 0;\n        this.v6l = v6l | 0;\n        this.v6h = v6h | 0;\n        this.v7l = v7l | 0;\n        this.v7h = v7h | 0;\n    }\n    compress(msg, offset, isLast) {\n        // First half from state. Direct writes: get() would allocate an array +\n        // closure per block.\n        // prettier-ignore\n        const { v0l, v0h, v1l, v1h, v2l, v2h, v3l, v3h, v4l, v4h, v5l, v5h, v6l, v6h, v7l, v7h } = this;\n        // prettier-ignore\n        {\n            BBUF[0] = v0l;\n            BBUF[1] = v0h;\n            BBUF[2] = v1l;\n            BBUF[3] = v1h;\n            BBUF[4] = v2l;\n            BBUF[5] = v2h;\n            BBUF[6] = v3l;\n            BBUF[7] = v3h;\n            BBUF[8] = v4l;\n            BBUF[9] = v4h;\n            BBUF[10] = v5l;\n            BBUF[11] = v5h;\n            BBUF[12] = v6l;\n            BBUF[13] = v6h;\n            BBUF[14] = v7l;\n            BBUF[15] = v7h;\n        }\n        BBUF.set(B2B_IV, 16); // Second half from IV.\n        const l = u64.fromNumL(this.length);\n        const h = u64.fromNumH(this.length);\n        BBUF[24] = B2B_IV[8] ^ l; // Low word of the offset.\n        BBUF[25] = B2B_IV[9] ^ h; // High word.\n        // Invert all bits for last block\n        if (isLast) {\n            BBUF[28] = ~BBUF[28];\n            BBUF[29] = ~BBUF[29];\n        }\n        let j = 0;\n        const s = BSIGMA;\n        // SIGMA selects 64-bit message words; multiply by 2 because `msg` stores\n        // each word as [low32, high32].\n        for (let i = 0; i < 12; i++) {\n            G1b(0, 4, 8, 12, msg, offset + 2 * s[j++]);\n            G2b(0, 4, 8, 12, msg, offset + 2 * s[j++]);\n            G1b(1, 5, 9, 13, msg, offset + 2 * s[j++]);\n            G2b(1, 5, 9, 13, msg, offset + 2 * s[j++]);\n            G1b(2, 6, 10, 14, msg, offset + 2 * s[j++]);\n            G2b(2, 6, 10, 14, msg, offset + 2 * s[j++]);\n            G1b(3, 7, 11, 15, msg, offset + 2 * s[j++]);\n            G2b(3, 7, 11, 15, msg, offset + 2 * s[j++]);\n            G1b(0, 5, 10, 15, msg, offset + 2 * s[j++]);\n            G2b(0, 5, 10, 15, msg, offset + 2 * s[j++]);\n            G1b(1, 6, 11, 12, msg, offset + 2 * s[j++]);\n            G2b(1, 6, 11, 12, msg, offset + 2 * s[j++]);\n            G1b(2, 7, 8, 13, msg, offset + 2 * s[j++]);\n            G2b(2, 7, 8, 13, msg, offset + 2 * s[j++]);\n            G1b(3, 4, 9, 14, msg, offset + 2 * s[j++]);\n            G2b(3, 4, 9, 14, msg, offset + 2 * s[j++]);\n        }\n        this.v0l ^= BBUF[0] ^ BBUF[16];\n        this.v0h ^= BBUF[1] ^ BBUF[17];\n        this.v1l ^= BBUF[2] ^ BBUF[18];\n        this.v1h ^= BBUF[3] ^ BBUF[19];\n        this.v2l ^= BBUF[4] ^ BBUF[20];\n        this.v2h ^= BBUF[5] ^ BBUF[21];\n        this.v3l ^= BBUF[6] ^ BBUF[22];\n        this.v3h ^= BBUF[7] ^ BBUF[23];\n        this.v4l ^= BBUF[8] ^ BBUF[24];\n        this.v4h ^= BBUF[9] ^ BBUF[25];\n        this.v5l ^= BBUF[10] ^ BBUF[26];\n        this.v5h ^= BBUF[11] ^ BBUF[27];\n        this.v6l ^= BBUF[12] ^ BBUF[28];\n        this.v6h ^= BBUF[13] ^ BBUF[29];\n        this.v7l ^= BBUF[14] ^ BBUF[30];\n        this.v7h ^= BBUF[15] ^ BBUF[31];\n        clean(BBUF);\n    }\n    destroy() {\n        this.destroyed = true;\n        clean(this.buffer32);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\n/**\n * Blake2b hash function. 64-bit. 1.5x slower than blake2s in JS.\n * @param msg - message that would be hashed\n * @param opts - Optional output, MAC, salt, and personalization settings.\n *   `dkLen` must be 1..64 bytes; `salt` and `personalization`, if present,\n *   must be 16 bytes each. See {@link Blake2Opts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with Blake2b.\n * ```ts\n * blake2b(new Uint8Array([97, 98, 99]));\n * ```\n * @example\n * Hash a message with Blake2b while selecting output, MAC, salt, and personalization settings.\n * ```ts\n * blake2b(new Uint8Array([97, 98, 99]), {\n *   dkLen: 32,\n *   key: new Uint8Array(32),\n *   salt: new Uint8Array(16),\n *   personalization: new Uint8Array(16),\n * });\n * ```\n */\nexport const blake2b = /* @__PURE__ */ createHasher((opts) => new _BLAKE2b(opts));\n/**\n * BLAKE2-compress core method.\n * Runs only the round function over a caller-supplied local vector; callers initialize `v0..v15`\n * and apply the final `h[i] ^= v[i] ^ v[i + 8]` fold themselves.\n * @param s - flattened sigma schedule bytes\n * @param offset - starting word offset inside `msg`, not a byte offset\n * @param msg - message words\n * @param rounds - round count to execute\n * @param v0 - state word 0\n * @param v1 - state word 1\n * @param v2 - state word 2\n * @param v3 - state word 3\n * @param v4 - state word 4\n * @param v5 - state word 5\n * @param v6 - state word 6\n * @param v7 - state word 7\n * @param v8 - state word 8\n * @param v9 - state word 9\n * @param v10 - state word 10\n * @param v11 - state word 11\n * @param v12 - state word 12\n * @param v13 - state word 13\n * @param v14 - state word 14\n * @param v15 - state word 15\n * @returns Updated compression state words.\n * @example\n * Run the BLAKE2 compression core on zeroed state and message words.\n * ```ts\n * import { _compress } from '@noble/hashes/blake2.js';\n * const state = _compress(\n *   new Uint8Array(16),\n *   0,\n *   new Uint32Array(16),\n *   1,\n *   0, 0, 0, 0, 0, 0, 0, 0,\n *   0, 0, 0, 0, 0, 0, 0, 0\n * );\n * state.v0;\n * ```\n */\n// prettier-ignore\nexport function _compress(s, offset, msg, rounds, v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15) {\n    let j = 0;\n    for (let i = 0; i < rounds; i++) {\n        ({ a: v0, b: v4, c: v8, d: v12 } = G1s(v0, v4, v8, v12, msg[offset + s[j++]]));\n        ({ a: v0, b: v4, c: v8, d: v12 } = G2s(v0, v4, v8, v12, msg[offset + s[j++]]));\n        ({ a: v1, b: v5, c: v9, d: v13 } = G1s(v1, v5, v9, v13, msg[offset + s[j++]]));\n        ({ a: v1, b: v5, c: v9, d: v13 } = G2s(v1, v5, v9, v13, msg[offset + s[j++]]));\n        ({ a: v2, b: v6, c: v10, d: v14 } = G1s(v2, v6, v10, v14, msg[offset + s[j++]]));\n        ({ a: v2, b: v6, c: v10, d: v14 } = G2s(v2, v6, v10, v14, msg[offset + s[j++]]));\n        ({ a: v3, b: v7, c: v11, d: v15 } = G1s(v3, v7, v11, v15, msg[offset + s[j++]]));\n        ({ a: v3, b: v7, c: v11, d: v15 } = G2s(v3, v7, v11, v15, msg[offset + s[j++]]));\n        ({ a: v0, b: v5, c: v10, d: v15 } = G1s(v0, v5, v10, v15, msg[offset + s[j++]]));\n        ({ a: v0, b: v5, c: v10, d: v15 } = G2s(v0, v5, v10, v15, msg[offset + s[j++]]));\n        ({ a: v1, b: v6, c: v11, d: v12 } = G1s(v1, v6, v11, v12, msg[offset + s[j++]]));\n        ({ a: v1, b: v6, c: v11, d: v12 } = G2s(v1, v6, v11, v12, msg[offset + s[j++]]));\n        ({ a: v2, b: v7, c: v8, d: v13 } = G1s(v2, v7, v8, v13, msg[offset + s[j++]]));\n        ({ a: v2, b: v7, c: v8, d: v13 } = G2s(v2, v7, v8, v13, msg[offset + s[j++]]));\n        ({ a: v3, b: v4, c: v9, d: v14 } = G1s(v3, v4, v9, v14, msg[offset + s[j++]]));\n        ({ a: v3, b: v4, c: v9, d: v14 } = G2s(v3, v4, v9, v14, msg[offset + s[j++]]));\n    }\n    return { v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15 };\n}\n// Blake2s reuses the SHA-256 IV words as-is.\nconst B2S_IV = /* @__PURE__ */ SHA256_IV.slice();\n/** Internal blake2s hash class. */\nexport class _BLAKE2s extends _BLAKE2 {\n    // Internal state, same as SHA-256\n    v0 = B2S_IV[0] | 0;\n    v1 = B2S_IV[1] | 0;\n    v2 = B2S_IV[2] | 0;\n    v3 = B2S_IV[3] | 0;\n    v4 = B2S_IV[4] | 0;\n    v5 = B2S_IV[5] | 0;\n    v6 = B2S_IV[6] | 0;\n    v7 = B2S_IV[7] | 0;\n    constructor(opts = {}) {\n        opts = checkOpts({}, opts);\n        const olen = opts.dkLen === undefined ? 32 : opts.dkLen;\n        super(64, olen);\n        checkBlake2Opts(olen, opts, 32, 8, 8);\n        let { key, personalization, salt } = opts;\n        let keyLength = 0;\n        if (key !== undefined) {\n            abytes(key, undefined, 'key');\n            keyLength = key.length;\n        }\n        // RFC 7693 \u00A72.5: xor `p[0] = 0x0101kknn` directly into `h[0]`, since\n        // BLAKE2s stores each state word as one `u32`.\n        this.v0 ^= this.outputLen | (keyLength << 8) | (0x01 << 16) | (0x01 << 24);\n        if (salt !== undefined) {\n            abytes(salt, undefined, 'salt');\n            // Copy: u32() would throw on views with byteOffset not divisible by 4.\n            const slt = u32(copyBytes(salt));\n            this.v4 ^= swap8IfBE(slt[0]);\n            this.v5 ^= swap8IfBE(slt[1]);\n        }\n        if (personalization !== undefined) {\n            abytes(personalization, undefined, 'personalization');\n            // Copy: u32() would throw on views with byteOffset not divisible by 4.\n            const pers = u32(copyBytes(personalization));\n            this.v6 ^= swap8IfBE(pers[0]);\n            this.v7 ^= swap8IfBE(pers[1]);\n        }\n        if (key !== undefined) {\n            // Pad to blockLen and update\n            const tmp = new Uint8Array(this.blockLen);\n            tmp.set(key);\n            this.update(tmp);\n            // The padded copy holds key material; buffer/state keep what they need.\n            clean(tmp);\n        }\n    }\n    get() {\n        const { v0, v1, v2, v3, v4, v5, v6, v7 } = this;\n        return [v0, v1, v2, v3, v4, v5, v6, v7];\n    }\n    // prettier-ignore\n    set(v0, v1, v2, v3, v4, v5, v6, v7) {\n        this.v0 = v0 | 0;\n        this.v1 = v1 | 0;\n        this.v2 = v2 | 0;\n        this.v3 = v3 | 0;\n        this.v4 = v4 | 0;\n        this.v5 = v5 | 0;\n        this.v6 = v6 | 0;\n        this.v7 = v7 | 0;\n    }\n    compress(msg, offset, isLast) {\n        const l = u64.fromNumL(this.length);\n        const h = u64.fromNumH(this.length);\n        // Seed v8..v15 from the IV, xor the low/high 32-bit byte counter into\n        // v12/v13, and invert v14 on the final block.\n        // prettier-ignore\n        const { v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15 } = _compress(BSIGMA, offset, msg, 10, this.v0, this.v1, this.v2, this.v3, this.v4, this.v5, this.v6, this.v7, B2S_IV[0], B2S_IV[1], B2S_IV[2], B2S_IV[3], l ^ B2S_IV[4], h ^ B2S_IV[5], isLast ? ~B2S_IV[6] : B2S_IV[6], B2S_IV[7]);\n        this.v0 ^= v0 ^ v8;\n        this.v1 ^= v1 ^ v9;\n        this.v2 ^= v2 ^ v10;\n        this.v3 ^= v3 ^ v11;\n        this.v4 ^= v4 ^ v12;\n        this.v5 ^= v5 ^ v13;\n        this.v6 ^= v6 ^ v14;\n        this.v7 ^= v7 ^ v15;\n    }\n    destroy() {\n        this.destroyed = true;\n        clean(this.buffer32);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\n/**\n * Blake2s hash function. Focuses on 8-bit to 32-bit platforms. 1.5x faster than blake2b in JS.\n * @param msg - message that would be hashed\n * @param opts - Optional output, MAC, salt, and personalization settings.\n *   `dkLen` must be 1..32 bytes; `salt` and `personalization`, if present,\n *   must be 8 bytes each. See {@link Blake2Opts}.\n * @returns Digest bytes.\n * @example\n * Hash a message with Blake2s.\n * ```ts\n * blake2s(new Uint8Array([97, 98, 99]));\n * ```\n * @example\n * Hash a message with Blake2s while selecting output, MAC, salt, and personalization settings.\n * ```ts\n * blake2s(new Uint8Array([97, 98, 99]), {\n *   dkLen: 16,\n *   key: new Uint8Array(32),\n *   salt: new Uint8Array(8),\n *   personalization: new Uint8Array(8),\n * });\n * ```\n */\nexport const blake2s = /* @__PURE__ */ createHasher((opts) => new _BLAKE2s(opts));\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, aoutput, clean, } from \"./utils.js\";\n/**\n * Internal class for HMAC.\n * Accepts any byte key, although RFC 2104 \u00A73 recommends keys at least\n * `HashLen` bytes long.\n */\nexport class _HMAC {\n    oHash;\n    iHash;\n    blockLen;\n    outputLen;\n    canXOF = false;\n    finished = false;\n    destroyed = false;\n    constructor(hash, key) {\n        ahash(hash);\n        abytes(key, undefined, 'key');\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('expected Hash instance');\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 the first block) of the outer hash here,\n        // 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        clean(pad);\n    }\n    update(buf) {\n        aexists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        aoutput(out, this);\n        this.finished = true;\n        const buf = out.subarray(0, this.outputLen);\n        // Reuse the first outputLen bytes for the inner digest; the outer hash consumes them before\n        // overwriting that same prefix with the final tag, leaving any oversized tail untouched.\n        this.iHash.digestInto(buf);\n        this.oHash.update(buf);\n        this.oHash.digestInto(buf);\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 the key\n        // is already in state and we don't know it.\n        to ||= Object.create(Object.getPrototypeOf(this), {});\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen, canXOF } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.canXOF = canXOF;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    clone() {\n        return this._cloneInto();\n    }\n    destroy() {\n        this.destroyed = true;\n        this.oHash.destroy();\n        this.iHash.destroy();\n    }\n}\nexport const hmac = /* @__PURE__ */ (() => {\n    const hmac_ = ((hash, key, message) => new _HMAC(hash, key).update(message).digest());\n    hmac_.create = (hash, key) => new _HMAC(hash, key);\n    return hmac_;\n})();\n", null, "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */\nexport function aarray(item, title, inner = () => { }) {\n    if (!Array.isArray(item))\n        throw new TypeError(`\"${title}\" expected array, got type=${typeof item}`);\n    for (let i = 0; i < item.length; i++)\n        inner(item[i], `${title}[${i}]`);\n    return item;\n}\n/**\n * Checks if something is Uint8Array. Be careful: nodejs Buffer will return true.\n * @param a - Value to inspect.\n * @returns `true` when the value is a Uint8Array view, including Node's `Buffer`.\n * @example\n * Guards a value before treating it as raw key material.\n *\n * ```ts\n * isBytes(new Uint8Array());\n * ```\n */\nexport function isBytes(a) {\n    // Plain `instanceof Uint8Array` is too strict for some Buffer / proxy /\n    // cross-realm cases. The fallback still requires a real ArrayBuffer view\n    // so plain JSON-deserialized `{ constructor: ... }`\n    // spoofing is rejected, and `BYTES_PER_ELEMENT === 1` keeps the fallback on byte-oriented views.\n    return (a instanceof Uint8Array ||\n        (ArrayBuffer.isView(a) &&\n            a.constructor.name === 'Uint8Array' &&\n            'BYTES_PER_ELEMENT' in a &&\n            a.BYTES_PER_ELEMENT === 1));\n}\n// Shared error-message prefix builder. Only called on throw paths, so assert\n// success paths never pay for the string concatenation.\nconst atitle = (title) => (title ? `\"${title}\" ` : '');\n/**\n * Asserts something is boolean.\n * @param value - Value to validate.\n * @returns The validated boolean.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Validates a boolean option before branching on it.\n *\n * ```ts\n * abool(true);\n * ```\n */\nexport function abool(value, title = '') {\n    if (typeof value !== 'boolean')\n        throw new TypeError(atitle(title) + 'expected boolean, got type=' + typeof value);\n    return value;\n}\n/**\n * Asserts something is a non-negative safe integer.\n * @param n - Value to validate.\n * @returns The validated number.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Validates a non-negative length or counter.\n *\n * ```ts\n * anumber(1);\n * ```\n */\nexport function anumber(n, title = '') {\n    if (typeof n !== 'number')\n        throw new TypeError(atitle(title) + 'expected number, got ' + typeof n);\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new RangeError(atitle(title) + 'expected integer >= 0, got ' + n);\n    return n;\n}\n/**\n * Asserts something is Uint8Array.\n * @param value - Value to validate.\n * @param length - Expected byte length.\n * @param title - Optional label used in error messages.\n * @returns The validated byte array.\n * On Node, `Buffer` is accepted too because it is a Uint8Array view.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument lengths. {@link RangeError}\n * @example\n * Validates a fixed-length nonce or key buffer.\n *\n * ```ts\n * abytes(new Uint8Array([1, 2]), 2);\n * ```\n */\nexport function abytes(value, length, title = '') {\n    // Success path first: this runs at the start of every update() / digestInto(), and the\n    // common `abytes(data)` form must not pay for length handling it does not use.\n    if (isBytes(value) && (length === undefined || value.length === length))\n        return value;\n    // Error path: recompute freely to build the exact message.\n    if (length !== undefined)\n        anumber(length, 'length');\n    const bytes = isBytes(value);\n    const ofLen = length !== undefined ? ` of length ${length}` : '';\n    const got = bytes ? `length=${value.length}` : `type=${typeof value}`;\n    const message = atitle(title) + 'expected Uint8Array' + ofLen + ', got ' + got;\n    if (!bytes)\n        throw new TypeError(message);\n    throw new RangeError(message);\n}\nconst aobject = (value, label) => {\n    if (value === null || typeof value !== 'object' || Array.isArray(value))\n        throw new TypeError(label === 'object'\n            ? 'expected valid options object'\n            : `\"${label}\" expected object, got type=${typeof value}`);\n};\n/**\n * Asserts a hash- or MAC-like instance has not been destroyed or finished.\n * @param instance - Stateful instance to validate.\n * @param checkFinished - Whether to reject finished instances.\n * When `false`, only `destroyed` is checked.\n * @throws If the hash instance has already been destroyed or finalized. {@link Error}\n * @example\n * Guards against calling `update()` or `digest()` on a finished hash.\n *\n * ```ts\n * aexists({ destroyed: false, finished: false });\n * ```\n */\nexport function aexists(instance, checkFinished = true) {\n    // Runs on every update()/digestInto(); the flags are library-owned booleans, so only their\n    // truthiness is checked - re-validating their type per call was pure hot-path overhead.\n    if (instance.destroyed)\n        throw new Error('hash was destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('digest() was already called');\n}\n/**\n * Asserts output is a sufficiently-sized byte array.\n * @param out - Output buffer to validate.\n * @param instance - Hash-like instance providing `outputLen`.\n * This is the relaxed `digestInto()`-style contract: output must be at least `outputLen`,\n * unlike one-shot cipher helpers elsewhere in the repo that often require exact lengths.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong output buffer lengths. {@link RangeError}\n * @example\n * Verifies that a caller-provided output buffer is large enough.\n *\n * ```ts\n * aoutput(new Uint8Array(16), { outputLen: 16 });\n * ```\n */\nexport function aoutput(out, instance) {\n    abytes(out, undefined, 'output');\n    // `outputLen` is a library-owned readonly number; the negated comparison keeps failing fast\n    // when it is missing/NaN (comparisons with undefined/NaN are false) without an anumber() call.\n    const min = instance.outputLen;\n    if (!(out.length >= min)) {\n        throw new RangeError('\"output\" expected length >= ' + min);\n    }\n}\n/**\n * Asserts output is a sufficiently-sized, 4-byte-aligned byte array.\n * {@link aoutput} plus an {@link isAligned32} check, for `digestInto()` paths\n * that write through zero-allocation `u32` word views.\n * @param out - Output buffer to validate.\n * @param instance - Hash-like instance providing `outputLen`.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong output buffer lengths. {@link RangeError}\n * @throws On wrong output buffer alignment. {@link Error}\n * @example\n * Verifies that a caller-provided output buffer is large enough and aligned.\n *\n * ```ts\n * aoutput32(new Uint8Array(16), { outputLen: 16 });\n * ```\n */\nexport function aoutput32(out, instance) {\n    aoutput(out, instance);\n    if (!isAligned32(out))\n        throw new Error('invalid output, must be aligned');\n}\n/**\n * Casts a typed-array view to Uint8Array.\n * @param arr - Typed-array view to reinterpret.\n * @returns Uint8Array view over the same bytes.\n * @example\n * Views 32-bit words as raw bytes without copying.\n *\n * ```ts\n * u8(new Uint32Array([1]));\n * ```\n */\nexport function u8(arr) {\n    return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/**\n * Casts a typed-array view to Uint32Array.\n * @param arr - Typed-array view to reinterpret.\n * @returns Uint32Array view over the same bytes. Callers are expected to provide a\n * 4-byte-aligned offset; trailing `1..3` bytes are silently dropped.\n * @example\n * Views a byte buffer as 32-bit words for block processing.\n *\n * ```ts\n * u32(new Uint8Array(4));\n * ```\n */\nexport function u32(arr) {\n    return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/**\n * Zeroizes typed arrays in place.\n * Warning: JS provides no guarantees.\n * @param arrays - Arrays to wipe.\n * @example\n * Wipes a temporary key buffer after use.\n *\n * ```ts\n * const bytes = new Uint8Array([1]);\n * clean(bytes);\n * ```\n */\nexport function clean(...arrays) {\n    for (let i = 0; i < arrays.length; i++) {\n        arrays[i].fill(0);\n    }\n}\n/**\n * Creates a DataView for byte-level manipulation.\n * @param arr - Typed-array view to wrap.\n * @returns DataView over the same bytes.\n * @example\n * Creates an endian-aware view for length encoding.\n *\n * ```ts\n * createView(new Uint8Array(4));\n * ```\n */\nexport function createView(arr) {\n    return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/**\n * Whether the current platform is little-endian.\n * Most are; some IBM systems are not.\n */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/**\n * Reverses byte order of one 32-bit word.\n * @param word - Unsigned 32-bit word to swap.\n * @returns The same word with bytes reversed.\n * @example\n * Swaps a big-endian word into little-endian byte order.\n *\n * ```ts\n * byteSwap(0x11223344);\n * ```\n */\nexport function byteSwap(word) {\n    return (((word << 24) & 0xff000000) |\n        ((word << 8) & 0xff0000) |\n        ((word >>> 8) & 0xff00) |\n        ((word >>> 24) & 0xff));\n}\n/**\n * Normalizes one 32-bit word to the little-endian representation expected by cipher cores.\n * @param n - Unsigned 32-bit word to normalize.\n * @returns Little-endian normalized word on big-endian hosts, else the input word unchanged.\n * @example\n * Normalizes a host-endian word before passing it into an ARX/AES core.\n *\n * ```ts\n * swap8IfBE(0x11223344);\n * ```\n */\nexport const swap8IfBE = isLE\n    ? (n) => n\n    : (n) => byteSwap(n) >>> 0;\n/**\n * Byte-swaps every word of a Uint32Array in place.\n * @param arr - Uint32Array whose words should be swapped.\n * @returns The same array after in-place byte swapping.\n * @example\n * Swaps every 32-bit word in a word-view buffer.\n *\n * ```ts\n * byteSwap32(new Uint32Array([0x11223344]));\n * ```\n */\nexport function byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n    return arr;\n}\n/**\n * Normalizes a Uint32Array view to the little-endian representation expected by cipher cores.\n * @param u - Word view to normalize in place.\n * @returns Little-endian normalized word view.\n * @example\n * Normalizes a word-view buffer before block processing.\n *\n * ```ts\n * swap32IfBE(new Uint32Array([0x11223344]));\n * ```\n */\nexport const swap32IfBE = isLE\n    ? (u) => u\n    : byteSwap32;\n// Built-in hex conversion:\n// {@link https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex | caniuse entry}\nconst hasHexBuiltin = /* @__PURE__ */ (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @param bytes - Bytes to encode.\n * @returns Lowercase hexadecimal string.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Formats ciphertext bytes for logs or test vectors.\n *\n * ```ts\n * bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])); // 'cafe0123'\n * ```\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // @ts-ignore\n    if (hasHexBuiltin)\n        return bytes.toHex();\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// Strict ASCII nibble parser: non-ASCII hex lookalikes are rejected as undefined.\n// ASCII codes: '0'..'9' = 48..57, 'A'..'F' = 65..70, 'a'..'f' = 97..102.\n// prettier-ignore\nfunction asciiToBase16(ch) {\n    return ch >= 48 && ch <= 57 ? ch - 48 // '2' => 50-48\n        : ch >= 65 && ch <= 70 ? ch - (65 - 10) // 'B' => 66-(65-10)\n            : ch >= 97 && ch <= 102 ? ch - (97 - 10) // 'b' => 98-(97-10)\n                : undefined;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @param hex - hexadecimal string to decode\n * @returns Decoded bytes.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Decode lowercase hexadecimal into bytes.\n * ```ts\n * hexToBytes('cafe0123'); // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n * ```\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new TypeError('hex string expected, got ' + typeof hex);\n    if (hasHexBuiltin) {\n        try {\n            return Uint8Array.fromHex(hex);\n        }\n        catch (error) {\n            if (error instanceof SyntaxError)\n                throw new RangeError(error.message);\n            throw error;\n        }\n    }\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new RangeError('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)); // parse first char, multiply it by 16\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1)); // parse second char\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new RangeError('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2; // example: 'A9' => 10*16 + 9\n    }\n    return array;\n}\nconst _0n = /* @__PURE__ */ BigInt(0);\n// Used in ff1, via bytesToNumberBE\n/**\n * Converts a big-endian hex string into bigint.\n * @param hex - Hexadecimal string without `0x`.\n * @returns Parsed bigint value. The empty string is treated as `0n`.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Parses a big-endian field element or counter from hex.\n *\n * ```ts\n * hexToNumber('ff');\n * ```\n */\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new TypeError('hex string expected, got ' + typeof hex);\n    // Numeric parser, not byte-hex decoder: odd-length forms like 'f' are valid,\n    // and malformed syntax follows BigInt's native error behavior.\n    return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// Used in ff1\n// BE: Big Endian, LE: Little Endian\n/**\n * Converts big-endian bytes into bigint.\n * @param bytes - Big-endian bytes.\n * @returns Parsed bigint value. Empty input is treated as `0n`.\n * @throws On invalid byte input passed to the internal hex conversion. {@link TypeError}\n * @example\n * Reads a big-endian integer from serialized bytes.\n *\n * ```ts\n * bytesToNumberBE(new Uint8Array([1, 0]));\n * ```\n */\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\n/**\n * Validates that a value is a non-negative bigint or safe integer.\n * @param n - Value to validate.\n * @returns The same validated value.\n * @throws On wrong argument ranges or values. {@link RangeError}\n */\nfunction abignumber(n) {\n    if (typeof n === 'bigint') {\n        if (!(_0n <= n))\n            throw new RangeError('positive bigint expected, got ' + n);\n    }\n    else\n        anumber(n);\n    return n;\n}\n// Used in ff1\n/**\n * Converts a number into big-endian bytes of fixed length.\n * @param n - Number to encode.\n * @param len - Output length in bytes. Must be greater than zero.\n * @returns Big-endian bytes padded to `len`.\n * Negative values, `len = 0`, and values that do not fit are rejected before\n * downstream hex parsing.\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If a documented runtime validation or state check fails. {@link Error}\n * @example\n * Encodes a counter as fixed-width big-endian bytes.\n *\n * ```ts\n * numberToBytesBE(1, 2);\n * ```\n */\nexport function numberToBytesBE(n, len) {\n    anumber(len);\n    if (len === 0)\n        throw new Error('zero output length is invalid');\n    n = abignumber(n);\n    const expectedLen = len * 2;\n    const hex = n.toString(16);\n    // Detect overflow before hex parsing so oversized values don't leak the shared odd-hex error.\n    if (hex.length > expectedLen)\n        throw new RangeError('number is too large');\n    return hexToBytes(hex.padStart(expectedLen, '0'));\n}\n/**\n * Converts string to bytes using UTF8 encoding.\n * @param str - String to encode.\n * @returns UTF-8 bytes in a detached fresh Uint8Array copy.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Encodes application text before encryption or MACing.\n *\n * ```ts\n * utf8ToBytes('abc'); // new Uint8Array([97, 98, 99])\n * ```\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new TypeError('string expected');\n    return new Uint8Array(new TextEncoder().encode(str)); // {@link https://bugzil.la/1681809 | Firefox bug 1681809}\n}\n/**\n * Converts bytes to string using UTF8 encoding.\n * @param bytes - UTF-8 bytes.\n * @returns Decoded string. Input validation is delegated to `TextDecoder`, and malformed\n * UTF-8 is replacement-decoded instead of rejected.\n * @example\n * Decodes UTF-8 plaintext back into a string.\n *\n * ```ts\n * bytesToUtf8(new Uint8Array([97, 98, 99])); // 'abc'\n * ```\n */\nexport function bytesToUtf8(bytes) {\n    return new TextDecoder().decode(bytes);\n}\n/**\n * Checks if two U8A use same underlying buffer and overlaps.\n * This is invalid and can corrupt data.\n * @param a - First byte view.\n * @param b - Second byte view.\n * @returns `true` when the views overlap in memory.\n * @example\n * Detects whether two slices alias the same backing buffer.\n *\n * ```ts\n * overlapBytes(new Uint8Array(4), new Uint8Array(4));\n * ```\n */\nexport function overlapBytes(a, b) {\n    // Zero-length views cannot overwrite anything, even if their offset sits inside another range.\n    if (!a.byteLength || !b.byteLength)\n        return false;\n    return (a.buffer === b.buffer && // best we can do, may fail with an obscure Proxy\n        a.byteOffset < b.byteOffset + b.byteLength && // a starts before b end\n        b.byteOffset < a.byteOffset + a.byteLength // b starts before a end\n    );\n}\n/**\n * If input and output overlap and input starts before output, we will overwrite end of input before\n * we start processing it, so this is not supported for most ciphers\n * (except chacha/salsa, which were designed for this)\n * @param input - Input bytes.\n * @param output - Output bytes.\n * @throws If the output view would overwrite unread input bytes. {@link Error}\n * @example\n * Rejects an in-place layout that would overwrite unread input bytes.\n *\n * ```ts\n * complexOverlapBytes(new Uint8Array(4), new Uint8Array(4));\n * ```\n */\nexport function complexOverlapBytes(input, output) {\n    // This is very cursed. It works somehow, but I'm completely unsure,\n    // reasoning about overlapping aligned windows is very hard.\n    if (overlapBytes(input, output) && input.byteOffset < output.byteOffset)\n        throw new Error('complex overlap of input and output is not supported');\n}\n/**\n * Copies several Uint8Arrays into one.\n * @param arrays - Byte arrays to concatenate.\n * @returns Combined byte array.\n * @throws On wrong argument types inside the byte-array list. {@link TypeError}\n * @example\n * Builds a `nonce || ciphertext` style buffer.\n *\n * ```ts\n * concatBytes(new Uint8Array([1]), new Uint8Array([2]));\n * ```\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/**\n * Merges user options into defaults.\n * @param defaults - Default option values.\n * @param opts - User-provided overrides.\n * @returns Combined options object.\n * `defaults` is a library-owned mutable object; user-provided `opts` only need to be\n * object-shaped, since \"plain object\" checks reject valid proxy/cross-realm containers.\n * The merge mutates `defaults` in place and returns the same object, so direct callers\n * should pass a fresh defaults object unless they intentionally want shared state updated.\n * @throws If options are missing or not an object. {@link Error}\n * @example\n * Applies user overrides to the default cipher options.\n *\n * ```ts\n * checkOpts({ rounds: 20 }, { rounds: 8 });\n * ```\n */\nexport function checkOpts(defaults, opts) {\n    aobject(defaults, 'defaults');\n    aobject(opts, 'opts');\n    // Mutates defaults by design. __proto__ follows Object.assign semantics here and can only\n    // affect this local option object; callers already control this low-level options surface.\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\n/**\n * Compares two byte arrays in kinda constant time once lengths already match.\n * @param a - First byte array.\n * @param b - Second byte array.\n * @returns `true` when the arrays contain the same bytes. Different lengths still return early.\n * @example\n * Compares an expected authentication tag with the received one.\n *\n * ```ts\n * equalBytes(new Uint8Array([1]), new Uint8Array([1]));\n * ```\n */\nexport function equalBytes(a, b) {\n    a = abytes(a);\n    b = abytes(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 * Wraps a keyed MAC constructor into a one-shot helper with `.create()`.\n * @param keyLen - Valid probe-key length used to read static metadata once.\n * The probe key is only used for `outputLen` / `blockLen`, so callers with several valid key sizes\n * can pass any representative size as long as those values stay fixed.\n * @param macCons - Keyed MAC constructor or factory.\n * @param fromMsg - Optional adapter that derives extra constructor args from the one-shot message.\n * @returns Callable MAC helper with `.create()`.\n */\nexport function wrapMacConstructor(keyLen, macCons, fromMsg) {\n    const mac = macCons;\n    const getArgs = (fromMsg || (() => []));\n    const macC = (msg, key) => mac(key, ...getArgs(msg))\n        .update(msg)\n        .digest();\n    const tmp = mac(new Uint8Array(keyLen), ...getArgs(new Uint8Array(0)));\n    macC.outputLen = tmp.outputLen;\n    macC.blockLen = tmp.blockLen;\n    macC.create = (key, ...args) => mac(key, ...args);\n    return macC;\n}\n/**\n * Wraps a cipher: validates args, ensures encrypt() can only be called once.\n * Used internally by the exported cipher constructors.\n * Output-buffer support is inferred from the wrapped `encrypt` / `decrypt`\n * arity (`fn.length === 2`), so wrapped output-capable methods must use a normal\n * second parameter, not a default/rest parameter. AAD support is explicit in\n * `params.withAAD`; optional AAD starts after the nonce slot when one is present.\n * @__NO_SIDE_EFFECTS__\n * @param params - Static cipher metadata. See {@link CipherParams}.\n * @param constructor - Cipher constructor.\n * @returns Wrapped constructor with validation.\n */\nexport const wrapCipher = (params, constructor) => {\n    function wrappedCipher(key, ...args) {\n        // Validate key\n        abytes(key, undefined, 'key');\n        // Validate nonce if nonceLength is present\n        if (params.nonceLength !== undefined) {\n            const nonce = args[0];\n            abytes(nonce, params.varSizeNonce ? undefined : params.nonceLength, 'nonce');\n        }\n        // Keep tag length available for decrypt-size checks after constructor validation.\n        const tagl = params.tagLength;\n        const aadStart = params.nonceLength !== undefined ? 1 : 0;\n        // No-AAD constructors otherwise silently ignore byte args meant as AAD.\n        if (!params.withAAD) {\n            for (let i = aadStart; i < args.length; i++)\n                if (isBytes(args[i]))\n                    throw new Error('AAD not supported');\n        }\n        // Validate the first AAD slot early; rest-arg AAD constructors validate the tail themselves.\n        if (params.withAAD && args[aadStart] !== undefined)\n            abytes(args[aadStart], undefined, 'AAD');\n        const cipher = constructor(key, ...args);\n        const checkOutput = (fnLength, output) => {\n            if (output !== undefined) {\n                if (fnLength !== 2)\n                    throw new Error('cipher output not supported');\n                abytes(output, undefined, 'output');\n            }\n        };\n        // Create wrapped cipher with validation and single-use encryption\n        let called = false;\n        const wrCipher = {\n            encrypt(data, output) {\n                if (called)\n                    throw new Error('cannot encrypt() twice with same key + nonce');\n                // Any encrypt attempt consumes the instance, even if validation rejects below.\n                called = true;\n                abytes(data, undefined, 'data');\n                checkOutput(cipher.encrypt.length, output);\n                return cipher.encrypt(data, output);\n            },\n            decrypt(data, output) {\n                abytes(data, undefined, 'data');\n                if (tagl && data.length < tagl)\n                    throw new Error('\"ciphertext\" expected length >= tagLength=' + tagl);\n                checkOutput(cipher.decrypt.length, output);\n                return cipher.decrypt(data, output);\n            },\n        };\n        return wrCipher;\n    }\n    Object.assign(wrappedCipher, params);\n    return wrappedCipher;\n};\n/**\n * By default, returns u8a of length.\n * When out is available, it checks it for validity and uses it.\n * @param expectedLength - Required output length.\n * @param out - Optional destination buffer.\n * @param onlyAligned - Whether `out` must be 4-byte aligned.\n * @returns Output buffer ready for writing.\n * @throws On wrong argument types. {@link TypeError}\n * @throws If the provided output buffer has the wrong size. {@link RangeError}\n * @throws If the provided output buffer has the wrong alignment. {@link Error}\n * @example\n * Reuses a caller-provided output buffer when lengths match.\n *\n * ```ts\n * getOutput(16, new Uint8Array(16));\n * ```\n */\nexport function getOutput(expectedLength, out, onlyAligned = true) {\n    if (out === undefined)\n        return new Uint8Array(expectedLength);\n    // Keep Buffer/cross-realm Uint8Array support here instead of trusting a shape-compatible object.\n    abytes(out, expectedLength, 'output');\n    if (onlyAligned && !isAligned32(out))\n        throw new Error('invalid output, must be aligned');\n    return out;\n}\n/**\n * Encodes data and AAD lengths into a 16-byte buffer.\n * @param dataLength - Data length. Units are caller-defined: GCM passes bit\n * lengths, ChaCha20-Poly1305 passes byte lengths \u2014 the helper writes the raw values.\n * @param aadLength - AAD length, same unit convention as `dataLength`.\n * The serialized block is still `aadLength || dataLength`, matching GCM/Poly1305\n * conventions even though the helper parameter order is `(dataLength, aadLength)`.\n * @param isLE - Whether to encode lengths as little-endian.\n * @returns 16-byte length block.\n * @throws On wrong argument types passed to the endian validator. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @example\n * Builds the length block appended by GCM and Poly1305.\n *\n * ```ts\n * u64Lengths(16, 8, true);\n * ```\n */\nexport function u64Lengths(dataLength, aadLength, isLE) {\n    // Reject coercible non-number lengths like '10' and true before BigInt(...) accepts them.\n    anumber(dataLength);\n    anumber(aadLength);\n    abool(isLE);\n    const num = new Uint8Array(16);\n    const view = createView(num);\n    view.setBigUint64(0, BigInt(aadLength), isLE);\n    view.setBigUint64(8, BigInt(dataLength), isLE);\n    return num;\n}\n/**\n * Checks whether a byte array is aligned to a 4-byte offset.\n * @param bytes - Byte array to inspect.\n * @returns `true` when the view is 4-byte aligned.\n * @example\n * Checks whether a buffer can be safely viewed as Uint32Array.\n *\n * ```ts\n * isAligned32(new Uint8Array(4));\n * ```\n */\nexport function isAligned32(bytes) {\n    return bytes.byteOffset % 4 === 0;\n}\n/**\n * Copies bytes into a new Uint8Array.\n * @param bytes - Bytes to copy.\n * @returns Copied byte array.\n * @throws On wrong argument types. {@link TypeError}\n * @example\n * Copies input into an aligned Uint8Array before block processing.\n *\n * ```ts\n * copyBytes(new Uint8Array([1, 2]));\n * ```\n */\nexport function copyBytes(bytes) {\n    // `Uint8Array.from(...)` would also accept arrays / other typed arrays. Keep this helper strict\n    // because callers use it at byte-validation boundaries before mutating the detached copy.\n    return Uint8Array.from(abytes(bytes));\n}\n/**\n * Cryptographically secure PRNG backed by `crypto.getRandomValues`.\n * @param bytesLength - number of random bytes to generate\n * @returns Random bytes.\n * The platform `getRandomValues()` implementation still defines any\n * single-call length cap, and this helper rejects oversize requests\n * with a stable library `RangeError` instead of host-specific errors.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On wrong argument ranges or values. {@link RangeError}\n * @throws If the current runtime does not provide `crypto.getRandomValues`. {@link Error}\n * @example\n * Generate a fresh random key or nonce.\n * ```ts\n * const key = randomBytes(16);\n * ```\n */\nexport function randomBytes(bytesLength = 32) {\n    // Match the repo's other length-taking helpers instead of relying on Uint8Array coercion.\n    anumber(bytesLength, 'bytesLength');\n    const cr = typeof globalThis === 'object' ? globalThis.crypto : null;\n    if (typeof cr?.getRandomValues !== 'function')\n        throw new Error('crypto.getRandomValues must be defined');\n    // Web Cryptography API Level 2 \u00A710.1.1:\n    // if `byteLength > 65536`, throw `QuotaExceededError`.\n    // Keep the guard explicit so callers can see the quota in code\n    // instead of discovering it by reading the spec or host errors.\n    // This wrapper surfaces the same quota as a stable library RangeError.\n    if (bytesLength > 65536)\n        throw new RangeError(`\"bytesLength\" expected <= 65536, got ${bytesLength}`);\n    return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n/**\n * Uses CSPRNG for nonce, nonce injected in ciphertext.\n * For `encrypt`, a `nonceBytes`-length buffer is fetched from CSPRNG and\n * prepended to encrypted ciphertext. For `decrypt`, first `nonceBytes` of ciphertext\n * are treated as nonce. The wrapper always allocates a fresh `nonce || ciphertext`\n * buffer on encrypt and intentionally does not support caller-provided destination buffers.\n * Too-short decrypt inputs are split into short/empty nonce views and then delegated\n * to the wrapped cipher instead of being rejected here first.\n *\n * NOTE: Under the same key, using random nonces (e.g. `managedNonce`) with AES-GCM and ChaCha\n * should be limited to `2**23` (8M) messages to get a collision chance of\n * `2**-50`. Stretching to `2**32` (4B) messages would raise that chance to\n * `2**-33`, still negligible but creeping up.\n * @param fn - Cipher constructor that expects a nonce.\n * @param randomBytes_ - Random-byte source used for nonce generation.\n * @returns Cipher constructor that prepends the nonce to ciphertext.\n * @throws On wrong argument types. {@link TypeError}\n * @throws On invalid nonce lengths observed at wrapper construction or use. {@link RangeError}\n * @example\n * Prepends a fresh random nonce to every ciphertext.\n *\n * ```ts\n * import { gcm } from '@noble/ciphers/aes.js';\n * import { managedNonce, randomBytes } from '@noble/ciphers/utils.js';\n * const wrapped = managedNonce(gcm);\n * const key = randomBytes(16);\n * const ciphertext = wrapped(key).encrypt(new Uint8Array([1, 2, 3]));\n * wrapped(key).decrypt(ciphertext);\n * ```\n */\nexport function managedNonce(fn, randomBytes_ = randomBytes) {\n    if (typeof fn !== 'function')\n        throw new TypeError('\"fn\" expected cipher constructor, got type=' + typeof fn);\n    if (typeof randomBytes_ !== 'function')\n        throw new TypeError('\"randomBytes_\" expected function, got type=' + typeof randomBytes_);\n    const { nonceLength } = fn;\n    anumber(nonceLength, 'fn.nonceLength');\n    const addNonce = (nonce, ciphertext, plaintext) => {\n        const out = concatBytes(nonce, ciphertext);\n        // Wrapped ciphers may alias caller plaintext on encrypt(); never zero\n        // caller-owned buffers here.\n        if (!overlapBytes(plaintext, ciphertext))\n            ciphertext.fill(0);\n        return out;\n    };\n    // NOTE: we cannot support DST here, it would be mistake:\n    // - we don't know how much dst length cipher requires\n    // - nonce may unalign dst and break everything\n    // - we create new u8a anyway (concatBytes)\n    // - previously we passed all args to cipher, but that was mistake!\n    const res = ((key, ...args) => ({\n        encrypt(plaintext) {\n            abytes(plaintext, undefined, 'data');\n            const nonce = randomBytes_(nonceLength);\n            const encrypted = fn(key, nonce, ...args).encrypt(plaintext);\n            // @ts-ignore\n            if (encrypted instanceof Promise)\n                return encrypted.then((ct) => addNonce(nonce, ct, plaintext));\n            return addNonce(nonce, encrypted, plaintext);\n        },\n        decrypt(ciphertext) {\n            abytes(ciphertext, undefined, 'data');\n            const nonce = ciphertext.subarray(0, nonceLength);\n            const decrypted = ciphertext.subarray(nonceLength);\n            return fn(key, nonce, ...args).decrypt(decrypted);\n        },\n    }));\n    // Auto-nonce wrappers still preserve the wrapped payload geometry.\n    if ('blockSize' in fn)\n        res.blockSize = fn.blockSize;\n    if ('tagLength' in fn)\n        res.tagLength = fn.tagLength;\n    if ('withAAD' in fn)\n        res.withAAD = fn.withAAD;\n    return res;\n}\n", "/**\n * Basic utils for ARX (add-rotate-xor) salsa and chacha ciphers.\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) | cnt(2) | s[2] | k(4) | s[3]\n  chacha:       s(4) | k(8) | cnt(1) | nonce(3)\n  chacha20orig: s(4) | k(8) | cnt(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 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).\nCounter overflow is undefined; see {@link https://mailarchive.ietf.org/arch/msg/cfrg/gsOnTJzcbgG6OqD8Sc0GO5aR_tU/ | the CFRG thread}.\nCurrent noble policy is strict non-wrap for the shared 32-bit counter path:\nexported ARX ciphers reject initial `0xffffffff` and stop before any implicit\nwrap back to zero.\nSee {@link https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha#appendix-A.2 | the XChaCha appendix} for the extended-nonce construction.\n\n * @module\n */\nimport { abool, abytes, anumber, checkOpts, clean, copyBytes, getOutput, isAligned32, isLE, randomBytes, swap32IfBE, u32, } from \"./utils.js\";\n// Replaces `TextEncoder` for ASCII literals, which is enough for sigma constants.\n// Non-ASCII input would not match UTF-8 `TextEncoder` output.\nconst encodeStr = (str) => Uint8Array.from(str.split(''), (c) => c.charCodeAt(0));\n// Raw `createCipher(...)` exports consume these native-endian `u32(...)` views directly.\n// Public `wrapCipher(...)` APIs reject non-little-endian platforms before reaching this path.\n// RFC 8439 \u00A72.3 / RFC 7539 \u00A72.3 only define the 256-bit-key constants; this 16-byte sigma is\n// kept for legacy allowShortKeys Salsa/ChaCha variants.\nconst sigma16_32 = /* @__PURE__ */ (() => swap32IfBE(u32(encodeStr('expand 16-byte k'))))();\n// RFC 8439 \u00A72.3 / RFC 7539 \u00A72.3 define words 0-3 as\n// `0x61707865 0x3320646e 0x79622d32 0x6b206574`, i.e. `expand 32-byte k`.\nconst sigma32_32 = /* @__PURE__ */ (() => swap32IfBE(u32(encodeStr('expand 32-byte k'))))();\n/**\n * Rotates a 32-bit word left.\n * @param a - Input word.\n * @param b - Rotation count in bits.\n * @returns Rotated 32-bit word.\n * @example\n * Moves the top byte of `0x12345678` into the low byte position.\n * ```ts\n * rotl(0x12345678, 8);\n * ```\n */\nexport function rotl(a, b) {\n    return (a << b) | (a >>> (32 - b));\n}\n// Salsa and Chacha block length is always 512-bit\nconst BLOCK_LEN = 64;\n// RFC 8439 \u00A72.2 / RFC 7539 \u00A72.2: the ChaCha state has 16 32-bit words.\nconst BLOCK_LEN32 = 16;\n// Counter policy for the shared public `counter` argument:\n// - RFC/IETF ChaCha20 uses a 32-bit counter.\n// - OpenSSL/Node `chacha20` instead treat the full 16-byte IV as a 128-bit\n//   counter state and carry into the next word.\n// - Raw `chacha20orig`, `salsa20`, `xsalsa20`, and `xchacha20` use 64-bit counters in libsodium\n//   and libtomcrypt, while some libs (for example libtomcrypt's RFC/IETF path) reject the max\n//   boundary instead of carrying.\n// - AEAD wrappers diverge too: libsodium `xchacha20poly1305` uses the IETF payload counter from\n//   block 1, while `secretstream_xchacha20poly1305` is a different protocol with rekey/reset.\n// Noble intentionally throws instead of silently picking one wrap model for users. In the default\n// path, even a 32-bit boundary would take 2^32 blocks * 64 bytes = 256 GiB, which is practically\n// unreachable for normal JS callers; advanced users who pass `counter` explicitly can implement\n// whatever wider carry / wrap policy they need on top.\nconst MAX_COUNTER = /* @__PURE__ */ (() => 2 ** 32 - 1)();\nconst U32_EMPTY = /* @__PURE__ */ Uint32Array.of();\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 = isLE && isAligned32(data) && isAligned32(output);\n    const d32 = isAligned ? u32(data) : U32_EMPTY;\n    const o32 = isAligned ? u32(output) : U32_EMPTY;\n    // RFC 8439 \u00A72.4.1 / RFC 7539 \u00A72.4.1 allow XORing one keystream block at a time and\n    // truncating the final partial block instead of materializing the whole keystream.\n    if (!isLE) {\n        for (let pos = 0; pos < len; counter++) {\n            core(sigma, key, nonce, b32, counter, rounds);\n            // RFC 8439 \u00A72.4 / RFC 7539 \u00A72.4 serialize keystream words in little-endian order.\n            swap32IfBE(b32);\n            if (counter >= MAX_COUNTER)\n                throw new Error('arx: counter overflow');\n            const take = Math.min(BLOCK_LEN, len - pos);\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        return;\n    }\n    for (let pos = 0; pos < len; counter++) {\n        core(sigma, key, nonce, b32, counter, rounds);\n        // See MAX_COUNTER policy note above: never silently wrap the shared public counter.\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}\n/**\n * Creates an ARX stream cipher from a 32-bit core permutation.\n * Used internally to build the exported Salsa and ChaCha stream ciphers.\n * @param core - Core function that fills one keystream block.\n * @param opts - Cipher layout and nonce-extension options. See {@link CipherOpts}.\n * @returns Stream cipher function over byte arrays.\n * @throws If the core callback, key size, counter, or output sizing is invalid. {@link Error}\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, undefined, 'key');\n        abytes(nonce, undefined, 'nonce');\n        abytes(data, undefined, 'data');\n        const len = data.length;\n        // Raw XorStream APIs return ciphertext/plaintext bytes directly, so caller-provided outputs\n        // must match the logical result length exactly instead of returning an oversized workspace.\n        output = getOutput(len, output, false);\n        anumber(counter);\n        // See MAX_COUNTER policy note above: reject advanced explicit-counter requests before any wrap.\n        if (counter < 0 || counter >= MAX_COUNTER)\n            throw new Error('arx: counter overflow');\n        const toClean = [];\n        // Key & sigma\n        // key=16 -> sigma16, k=key|key\n        // key=32 -> sigma32, k=key\n        let l = key.length;\n        let k;\n        let sigma;\n        if (l === 32) {\n            // Copy caller keys too: big-endian normalization, extended-nonce subkey derivation, and\n            // final clean(...) all mutate or wipe the temporary buffer in place.\n            toClean.push((k = copyBytes(key)));\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            abytes(key, 32, 'arx key');\n            throw new Error('invalid key size');\n            // throw new Error(`\"arx key\" expected Uint8Array of length 32, 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        // Copy before taking u32(...) views on misaligned inputs, and on big-endian so later\n        // swap32IfBE(...) never mutates caller nonce bytes in place.\n        if (!isLE || !isAligned32(nonce))\n            toClean.push((nonce = copyBytes(nonce)));\n        let 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            const n16 = nonce.subarray(0, 16);\n            if (isLE)\n                extendNonceFn(sigma, k32, u32(n16), k32);\n            else {\n                const sigmaRaw = swap32IfBE(Uint32Array.from(sigma));\n                extendNonceFn(sigmaRaw, k32, u32(n16), k32);\n                clean(sigmaRaw);\n                swap32IfBE(k32);\n            }\n            nonce = nonce.subarray(16);\n        }\n        else if (!isLE)\n            swap32IfBE(k32);\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        // Normalize 64-bit-nonce layouts to the 12-byte core input: ChaCha/XChaCha prefix 4 zero\n        // counter bytes, while Salsa/XSalsa append them after the nonce words.\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 = swap32IfBE(u32(nonce));\n        // Ensure temporary key/nonce copies are wiped even if the remaining\n        // runtime guard in runCipher(...) throws on counter overflow.\n        try {\n            runCipher(core, sigma, k32, n32, data, output, counter, rounds);\n            return output;\n        }\n        finally {\n            clean(...toClean);\n        }\n    };\n}\n/** Internal class which wraps chacha20 or chacha8 to create CSPRNG. */\nexport class _XorStreamPRG {\n    blockLen;\n    keyLen;\n    nonceLen;\n    state;\n    buf;\n    key;\n    nonce;\n    pos;\n    ctr;\n    cipher;\n    constructor(cipher, blockLen, keyLen, nonceLen, seed) {\n        this.cipher = cipher;\n        this.blockLen = blockLen;\n        this.keyLen = keyLen;\n        this.nonceLen = nonceLen;\n        this.state = new Uint8Array(this.keyLen + this.nonceLen);\n        this.reseed(seed);\n        this.ctr = 0;\n        this.pos = this.blockLen;\n        this.buf = new Uint8Array(this.blockLen);\n        // Keep a single key||nonce backing buffer so reseed/addEntropy/clean update the live cipher\n        // inputs in place through these subarray views.\n        this.key = this.state.subarray(0, this.keyLen);\n        this.nonce = this.state.subarray(this.keyLen);\n    }\n    reseed(seed) {\n        abytes(seed, undefined, 'seed');\n        if (!seed || seed.length === 0)\n            throw new Error('entropy required');\n        // Mix variable-length entropy cyclically across the whole key||nonce state, then restart the\n        // keystream so buffered leftovers from the previous state are never reused.\n        for (let i = 0; i < seed.length; i++)\n            this.state[i % this.state.length] ^= seed[i];\n        this.ctr = 0;\n        this.pos = this.blockLen;\n    }\n    addEntropy(seed) {\n        // Reject empty entropy before re-keying, otherwise a throwing call would still advance state.\n        abytes(seed, undefined, 'seed');\n        if (seed.length === 0)\n            throw new Error('entropy required');\n        // Re-key from the current stream first, then mix external entropy into the fresh key||nonce\n        // state through reseed() so stale buffered bytes are discarded.\n        this.state.set(this.randomBytes(this.state.length));\n        this.reseed(seed);\n    }\n    randomBytes(len) {\n        anumber(len);\n        if (len === 0)\n            return new Uint8Array(0);\n        const avail = this.pos < this.blockLen ? this.blockLen - this.pos : 0;\n        const blocks = Math.ceil(Math.max(0, len - avail) / this.blockLen);\n        // Preflight overflow so failed reads don't partially consume keystream\n        // and leave the PRG repeating blocks.\n        if (blocks > 0 && this.ctr > MAX_COUNTER - blocks)\n            throw new Error('arx: counter overflow');\n        const out = new Uint8Array(len);\n        let outPos = 0;\n        // `out` starts zero-filled, and `buf.fill(0)` below does the same for leftovers: XOR-stream\n        // ciphers then emit raw keystream bytes directly into those buffers.\n        // Serve buffered leftovers first so split reads stay identical to one larger read.\n        if (this.pos < this.blockLen) {\n            const take = Math.min(len, this.blockLen - this.pos);\n            out.set(this.buf.subarray(this.pos, this.pos + take), 0);\n            this.pos += take;\n            outPos += take;\n            if (outPos === len)\n                return out; // fast path\n        }\n        // Full blocks directly to out\n        const full = Math.floor((len - outPos) / this.blockLen);\n        if (full > 0) {\n            const blockBytes = full * this.blockLen;\n            const b = out.subarray(outPos, outPos + blockBytes);\n            this.cipher(this.key, this.nonce, b, b, this.ctr);\n            this.ctr += full;\n            outPos += blockBytes;\n        }\n        // Save leftovers\n        const left = len - outPos;\n        if (left > 0) {\n            this.buf.fill(0);\n            // NOTE: cipher will handle overflow\n            this.cipher(this.key, this.nonce, this.buf, this.buf, this.ctr++);\n            out.set(this.buf.subarray(0, left), outPos);\n            this.pos = left;\n        }\n        return out;\n    }\n    // Clone seeds the new instance from this stream, so the source PRG advances too.\n    clone() {\n        return new _XorStreamPRG(this.cipher, this.blockLen, this.keyLen, this.nonceLen, this.randomBytes(this.state.length));\n    }\n    // Zeroes the current state and leftover buffer, but does not make the instance unusable:\n    // Later reads first drain zeros from the cleared buffer and then continue\n    // from zero key||nonce state.\n    clean() {\n        this.pos = 0;\n        this.ctr = 0;\n        this.buf.fill(0);\n        this.state.fill(0);\n    }\n}\n/**\n * Creates a PRG constructor from a stream cipher.\n * @param cipher - Stream cipher used to fill output blocks.\n * @param blockLen - Keystream block length in bytes.\n * @param keyLen - Internal key length in bytes.\n * @param nonceLen - Internal nonce length in bytes.\n * @returns PRG factory for seeded concrete `_XorStreamPRG` instances.\n * @example\n * Builds a PRG from XChaCha20 and reads bytes from a randomly seeded instance.\n * ```ts\n * import { xchacha20 } from '@noble/ciphers/chacha.js';\n * import { createPRG } from '@noble/ciphers/_arx.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const seed = randomBytes(32);\n * const init = createPRG(xchacha20, 64, 32, 24);\n * const prg = init(seed);\n * prg.randomBytes(8);\n * ```\n */\nexport const createPRG = (cipher, blockLen, keyLen, nonceLen) => {\n    return ((seed = randomBytes(32)) => new _XorStreamPRG(cipher, blockLen, keyLen, nonceLen, seed));\n};\n", "/**\n * Poly1305 ({@link https://cr.yp.to/mac/poly1305-20050329.pdf | PDF},\n * {@link https://en.wikipedia.org/wiki/Poly1305 | wiki})\n * is a fast and parallel secret-key message-authentication code suitable for\n * a wide variety of applications. It was standardized in\n * {@link https://www.rfc-editor.org/rfc/rfc8439 | RFC 8439} and is now used in TLS 1.3.\n *\n * Polynomial MACs are not perfect for every situation:\n * they lack Random Key Robustness: the MAC can be forged, and can't be used in PAKE schemes.\n * See {@link https://keymaterial.net/2020/09/07/invisible-salamanders-in-aes-gcm-siv/ | the invisible salamanders attack writeup}.\n * To combat invisible salamanders, `hash(key)` can be included in ciphertext,\n * however, this would violate ciphertext indistinguishability:\n * an attacker would know which key was used - so `HKDF(key, i)`\n * could be used instead.\n *\n * Check out the {@link https://cr.yp.to/mac.html | original website}.\n * Based on public-domain {@link https://github.com/floodyberry/poly1305-donna | poly1305-donna}.\n * @module\n */\n// prettier-ignore\nimport { abytes, aexists, aoutput, clean, copyBytes, wrapMacConstructor } from \"./utils.js\";\n// A simple-loop reference version (`poly1305_small`) lives in\n// `test/misc/micro-ciphers.ts`, provided for auditability.\n// Little-endian 2-byte load used by the Poly1305 limb decomposition.\nfunction u8to16(a, i) {\n    return (a[i++] & 0xff) | ((a[i++] & 0xff) << 8);\n}\n/**\n * Incremental Poly1305 MAC state.\n * Prefer `poly1305()` for one-shot use.\n * @param key - 32-byte Poly1305 one-time key.\n * @example\n * Feeds one chunk into an incremental Poly1305 state with a fresh one-time key.\n *\n * ```ts\n * import { Poly1305 } from '@noble/ciphers/_poly1305.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const mac = new Poly1305(key);\n * mac.update(new Uint8Array([1, 2, 3]));\n * mac.digest();\n * ```\n */\nexport class Poly1305 {\n    blockLen = 16;\n    outputLen = 16;\n    buffer = new Uint8Array(16);\n    r = new Uint16Array(10); // Allocating 1 array with .subarray() here is slower than 3\n    h = new Uint16Array(10);\n    pad = new Uint16Array(8);\n    pos = 0;\n    finished = false;\n    destroyed = false;\n    // Can be speed-up using BigUint64Array, at the cost of complexity\n    constructor(key) {\n        key = copyBytes(abytes(key, 32, 'key'));\n        const t0 = u8to16(key, 0);\n        const t1 = u8to16(key, 2);\n        const t2 = u8to16(key, 4);\n        const t3 = u8to16(key, 6);\n        const t4 = u8to16(key, 8);\n        const t5 = u8to16(key, 10);\n        const t6 = u8to16(key, 12);\n        const t7 = u8to16(key, 14);\n        // RFC 8439 \u00A72.5.1 / RFC 7539 \u00A72.5.1 clamp r before multiplication.\n        // These masks unpack that clamped value into 13-bit limbs, while pad\n        // keeps the raw s half for finalize().\n        // {@link https://github.com/floodyberry/poly1305-donna/blob/e6ad6e091d30d7f4ec2d4f978be1fcfcbce72781/poly1305-donna-16.h#L47 | poly1305-donna reference}\n        this.r[0] = t0 & 0x1fff;\n        this.r[1] = ((t0 >>> 13) | (t1 << 3)) & 0x1fff;\n        this.r[2] = ((t1 >>> 10) | (t2 << 6)) & 0x1f03;\n        this.r[3] = ((t2 >>> 7) | (t3 << 9)) & 0x1fff;\n        this.r[4] = ((t3 >>> 4) | (t4 << 12)) & 0x00ff;\n        this.r[5] = (t4 >>> 1) & 0x1ffe;\n        this.r[6] = ((t4 >>> 14) | (t5 << 2)) & 0x1fff;\n        this.r[7] = ((t5 >>> 11) | (t6 << 5)) & 0x1f81;\n        this.r[8] = ((t6 >>> 8) | (t7 << 8)) & 0x1fff;\n        this.r[9] = (t7 >>> 5) & 0x007f;\n        for (let i = 0; i < 8; i++)\n            this.pad[i] = u8to16(key, 16 + 2 * i);\n    }\n    process(data, offset, isLast = false) {\n        // RFC 8439 \u00A72.5 / \u00A72.5.1 and RFC 7539 \u00A72.5 / \u00A72.5.1 add an extra high\n        // bit to every full 16-byte block. The final partial block gets its\n        // explicit `1` byte during digestInto(), so `hibit` stays zero there.\n        const hibit = isLast ? 0 : 1 << 11;\n        const { h, r } = this;\n        const r0 = r[0];\n        const r1 = r[1];\n        const r2 = r[2];\n        const r3 = r[3];\n        const r4 = r[4];\n        const r5 = r[5];\n        const r6 = r[6];\n        const r7 = r[7];\n        const r8 = r[8];\n        const r9 = r[9];\n        const t0 = u8to16(data, offset + 0);\n        const t1 = u8to16(data, offset + 2);\n        const t2 = u8to16(data, offset + 4);\n        const t3 = u8to16(data, offset + 6);\n        const t4 = u8to16(data, offset + 8);\n        const t5 = u8to16(data, offset + 10);\n        const t6 = u8to16(data, offset + 12);\n        const t7 = u8to16(data, offset + 14);\n        let h0 = h[0] + (t0 & 0x1fff);\n        let h1 = h[1] + (((t0 >>> 13) | (t1 << 3)) & 0x1fff);\n        let h2 = h[2] + (((t1 >>> 10) | (t2 << 6)) & 0x1fff);\n        let h3 = h[3] + (((t2 >>> 7) | (t3 << 9)) & 0x1fff);\n        let h4 = h[4] + (((t3 >>> 4) | (t4 << 12)) & 0x1fff);\n        let h5 = h[5] + ((t4 >>> 1) & 0x1fff);\n        let h6 = h[6] + (((t4 >>> 14) | (t5 << 2)) & 0x1fff);\n        let h7 = h[7] + (((t5 >>> 11) | (t6 << 5)) & 0x1fff);\n        let h8 = h[8] + (((t6 >>> 8) | (t7 << 8)) & 0x1fff);\n        let h9 = h[9] + ((t7 >>> 5) | hibit);\n        let c = 0;\n        let d0 = c + h0 * r0 + h1 * (5 * r9) + h2 * (5 * r8) + h3 * (5 * r7) + h4 * (5 * r6);\n        c = d0 >>> 13;\n        d0 &= 0x1fff;\n        d0 += h5 * (5 * r5) + h6 * (5 * r4) + h7 * (5 * r3) + h8 * (5 * r2) + h9 * (5 * r1);\n        c += d0 >>> 13;\n        d0 &= 0x1fff;\n        let d1 = c + h0 * r1 + h1 * r0 + h2 * (5 * r9) + h3 * (5 * r8) + h4 * (5 * r7);\n        c = d1 >>> 13;\n        d1 &= 0x1fff;\n        d1 += h5 * (5 * r6) + h6 * (5 * r5) + h7 * (5 * r4) + h8 * (5 * r3) + h9 * (5 * r2);\n        c += d1 >>> 13;\n        d1 &= 0x1fff;\n        let d2 = c + h0 * r2 + h1 * r1 + h2 * r0 + h3 * (5 * r9) + h4 * (5 * r8);\n        c = d2 >>> 13;\n        d2 &= 0x1fff;\n        d2 += h5 * (5 * r7) + h6 * (5 * r6) + h7 * (5 * r5) + h8 * (5 * r4) + h9 * (5 * r3);\n        c += d2 >>> 13;\n        d2 &= 0x1fff;\n        let d3 = c + h0 * r3 + h1 * r2 + h2 * r1 + h3 * r0 + h4 * (5 * r9);\n        c = d3 >>> 13;\n        d3 &= 0x1fff;\n        d3 += h5 * (5 * r8) + h6 * (5 * r7) + h7 * (5 * r6) + h8 * (5 * r5) + h9 * (5 * r4);\n        c += d3 >>> 13;\n        d3 &= 0x1fff;\n        let d4 = c + h0 * r4 + h1 * r3 + h2 * r2 + h3 * r1 + h4 * r0;\n        c = d4 >>> 13;\n        d4 &= 0x1fff;\n        d4 += h5 * (5 * r9) + h6 * (5 * r8) + h7 * (5 * r7) + h8 * (5 * r6) + h9 * (5 * r5);\n        c += d4 >>> 13;\n        d4 &= 0x1fff;\n        let d5 = c + h0 * r5 + h1 * r4 + h2 * r3 + h3 * r2 + h4 * r1;\n        c = d5 >>> 13;\n        d5 &= 0x1fff;\n        d5 += h5 * r0 + h6 * (5 * r9) + h7 * (5 * r8) + h8 * (5 * r7) + h9 * (5 * r6);\n        c += d5 >>> 13;\n        d5 &= 0x1fff;\n        let d6 = c + h0 * r6 + h1 * r5 + h2 * r4 + h3 * r3 + h4 * r2;\n        c = d6 >>> 13;\n        d6 &= 0x1fff;\n        d6 += h5 * r1 + h6 * r0 + h7 * (5 * r9) + h8 * (5 * r8) + h9 * (5 * r7);\n        c += d6 >>> 13;\n        d6 &= 0x1fff;\n        let d7 = c + h0 * r7 + h1 * r6 + h2 * r5 + h3 * r4 + h4 * r3;\n        c = d7 >>> 13;\n        d7 &= 0x1fff;\n        d7 += h5 * r2 + h6 * r1 + h7 * r0 + h8 * (5 * r9) + h9 * (5 * r8);\n        c += d7 >>> 13;\n        d7 &= 0x1fff;\n        let d8 = c + h0 * r8 + h1 * r7 + h2 * r6 + h3 * r5 + h4 * r4;\n        c = d8 >>> 13;\n        d8 &= 0x1fff;\n        d8 += h5 * r3 + h6 * r2 + h7 * r1 + h8 * r0 + h9 * (5 * r9);\n        c += d8 >>> 13;\n        d8 &= 0x1fff;\n        let d9 = c + h0 * r9 + h1 * r8 + h2 * r7 + h3 * r6 + h4 * r5;\n        c = d9 >>> 13;\n        d9 &= 0x1fff;\n        d9 += h5 * r4 + h6 * r3 + h7 * r2 + h8 * r1 + h9 * r0;\n        c += d9 >>> 13;\n        d9 &= 0x1fff;\n        c = ((c << 2) + c) | 0;\n        c = (c + d0) | 0;\n        d0 = c & 0x1fff;\n        c = c >>> 13;\n        d1 += c;\n        h[0] = d0;\n        h[1] = d1;\n        h[2] = d2;\n        h[3] = d3;\n        h[4] = d4;\n        h[5] = d5;\n        h[6] = d6;\n        h[7] = d7;\n        h[8] = d8;\n        h[9] = d9;\n    }\n    finalize() {\n        const { h, pad } = this;\n        const g = new Uint16Array(10);\n        let c = h[1] >>> 13;\n        h[1] &= 0x1fff;\n        for (let i = 2; i < 10; i++) {\n            h[i] += c;\n            c = h[i] >>> 13;\n            h[i] &= 0x1fff;\n        }\n        h[0] += c * 5;\n        c = h[0] >>> 13;\n        h[0] &= 0x1fff;\n        h[1] += c;\n        c = h[1] >>> 13;\n        h[1] &= 0x1fff;\n        h[2] += c;\n        // RFC 8439 \u00A72.5 / RFC 7539 \u00A72.5 reduce modulo 2^130-5 before repacking\n        // to 16-bit words and adding the raw s half.\n        g[0] = h[0] + 5;\n        c = g[0] >>> 13;\n        g[0] &= 0x1fff;\n        for (let i = 1; i < 10; i++) {\n            g[i] = h[i] + c;\n            c = g[i] >>> 13;\n            g[i] &= 0x1fff;\n        }\n        g[9] -= 1 << 13;\n        let mask = (c ^ 1) - 1;\n        for (let i = 0; i < 10; i++)\n            g[i] &= mask;\n        mask = ~mask;\n        for (let i = 0; i < 10; i++)\n            h[i] = (h[i] & mask) | g[i];\n        h[0] = (h[0] | (h[1] << 13)) & 0xffff;\n        h[1] = ((h[1] >>> 3) | (h[2] << 10)) & 0xffff;\n        h[2] = ((h[2] >>> 6) | (h[3] << 7)) & 0xffff;\n        h[3] = ((h[3] >>> 9) | (h[4] << 4)) & 0xffff;\n        h[4] = ((h[4] >>> 12) | (h[5] << 1) | (h[6] << 14)) & 0xffff;\n        h[5] = ((h[6] >>> 2) | (h[7] << 11)) & 0xffff;\n        h[6] = ((h[7] >>> 5) | (h[8] << 8)) & 0xffff;\n        h[7] = ((h[8] >>> 8) | (h[9] << 5)) & 0xffff;\n        let f = h[0] + pad[0];\n        h[0] = f & 0xffff;\n        for (let i = 1; i < 8; i++) {\n            f = (((h[i] + pad[i]) | 0) + (f >>> 16)) | 0;\n            h[i] = f & 0xffff;\n        }\n        clean(g);\n    }\n    update(data) {\n        aexists(this);\n        abytes(data);\n        data = copyBytes(data);\n        const { buffer, blockLen } = this;\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\n            if (take === blockLen) {\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(data, 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(buffer, 0, false);\n                this.pos = 0;\n            }\n        }\n        return this;\n    }\n    destroy() {\n        // `aexists(this)` guards update/digest paths, so destroy must mark the instance unusable too.\n        this.destroyed = true;\n        clean(this.h, this.r, this.buffer, this.pad);\n    }\n    digestInto(out) {\n        aexists(this);\n        aoutput(out, this);\n        this.finished = true;\n        const { buffer, h } = this;\n        let { pos } = this;\n        if (pos) {\n            // RFC 8439 \u00A72.5 / RFC 7539 \u00A72.5: the final short block appends a\n            // single `0x01` byte and zero-fills the remaining bytes before the\n            // last multiplication step.\n            buffer[pos++] = 1;\n            for (; pos < 16; pos++)\n                buffer[pos] = 0;\n            this.process(buffer, 0, true);\n        }\n        this.finalize();\n        let opos = 0;\n        for (let i = 0; i < 8; i++) {\n            out[opos++] = h[i] >>> 0;\n            out[opos++] = h[i] >>> 8;\n        }\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        // Copy out before destroy() zeroes the internal buffer.\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n}\n/**\n * Poly1305 MAC from RFC 8439.\n * @param msg - Message bytes to authenticate.\n * @param key - 32-byte Poly1305 one-time key.\n * @returns 16-byte authentication tag.\n * @example\n * Authenticates one message with a one-shot Poly1305 call and a fresh key.\n *\n * ```ts\n * import { poly1305 } from '@noble/ciphers/_poly1305.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * poly1305(new Uint8Array(), key);\n * ```\n */\nexport const poly1305 = /* @__PURE__ */ wrapMacConstructor(32, (key) => new Poly1305(key));\n", "/**\n * ChaCha stream cipher, released\n * in 2008. Developed after Salsa20, ChaCha aims to increase diffusion per round.\n * It was standardized in\n * {@link https://www.rfc-editor.org/rfc/rfc8439 | RFC 8439} and\n * is now used in TLS 1.3.\n *\n * {@link https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha | XChaCha20}\n * extended-nonce variant is also provided. Similar to XSalsa, it's safe to use with\n * randomly-generated nonces.\n *\n * Check out\n * {@link http://cr.yp.to/chacha/chacha-20080128.pdf | PDF},\n * {@link https://en.wikipedia.org/wiki/Salsa20 | wiki}, and\n * {@link https://cr.yp.to/chacha.html | website}.\n *\n * @module\n */\nimport { createCipher, createPRG, rotl } from \"./_arx.js\";\nimport { poly1305 } from \"./_poly1305.js\";\nimport { abytes, clean, equalBytes, getOutput, isLE, swap32IfBE, u64Lengths, wrapCipher, } from \"./utils.js\";\n/**\n * ChaCha core function. Uses an unrolled loop (chachaCore, hchacha) - 4x\n * faster than a simple loop, but larger & harder to read. A simple-loop\n * reference version lives in `test/misc/micro-ciphers.ts`;\n * `test/arx.test.ts` keeps the two aligned.\n * The specific implementation is selected in `createCipher` below.\n */\n/** RFC 8439 \u00A72.3 block core for `state = constants | key | counter | nonce`. */\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  Nonce   Nonce   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    // RFC 8439 \u00A72.3 / \u00A72.3.1: add the original state words back in state order.\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 hashes key and nonce into key' and nonce' for xchacha20.\n * Algorithmically identical to `hchacha_small` from `test/misc/micro-ciphers.ts`,\n * but this exported path normalizes word order on big-endian hosts.\n * Reuses `chachaCore` and subtracts its feed-forward, keeping the hot per-block\n * path untouched.\n * @param s - Sigma constants as 32-bit words.\n * @param k - Key words.\n * @param i - Nonce-prefix words.\n * @param out - Output buffer for the derived subkey.\n * @example\n * Derives the XChaCha subkey from sigma, key, and nonce-prefix words.\n *\n * ```ts\n * const sigma = new Uint32Array(4);\n * const key = new Uint32Array(8);\n * const nonce = new Uint32Array(4);\n * const out = new Uint32Array(8);\n * hchacha(sigma, key, nonce, out);\n * ```\n */\n// prettier-ignore\nexport function hchacha(s, k, i, out) {\n    // Runs the shared chachaCore permutation, then subtracts the RFC 8439 feed-forward\n    // it applies, recovering the raw permutation words hchacha needs.\n    // LE hosts read the caller arrays in place (no copies); BE hosts get\n    // byte-swapped scratch copies, wiped before returning.\n    const s2 = isLE ? s : swap32IfBE(s.slice(0, 4));\n    const k2 = isLE ? k : swap32IfBE(k.slice(0, 8));\n    const i2 = isLE ? i : swap32IfBE(i.slice(0, 4));\n    const t = new Uint32Array(16);\n    chachaCore(s2, k2, i2.subarray(1), t, i2[0]);\n    let oi = 0;\n    out[oi++] = (t[0] - s2[0]) | 0;\n    out[oi++] = (t[1] - s2[1]) | 0;\n    out[oi++] = (t[2] - s2[2]) | 0;\n    out[oi++] = (t[3] - s2[3]) | 0;\n    out[oi++] = (t[12] - i2[0]) | 0;\n    out[oi++] = (t[13] - i2[1]) | 0;\n    out[oi++] = (t[14] - i2[2]) | 0;\n    out[oi++] = (t[15] - i2[3]) | 0;\n    swap32IfBE(out);\n    if (!isLE)\n        clean(s2, k2, i2);\n    clean(t);\n}\n/**\n * Original, non-RFC chacha20 from DJB. 8-byte nonce, 8-byte counter.\n * The nonce/counter layout still reserves 8 counter bytes internally, but the shared public\n * `counter` argument follows noble's strict non-wrapping 32-bit policy. See `src/_arx.ts`\n * near `MAX_COUNTER` for the full counter-policy rationale.\n * @param key - 16-byte or 32-byte key.\n * @param nonce - 8-byte nonce.\n * @param data - Input bytes to xor with the keystream.\n * @param output - Optional destination buffer.\n * @param counter - Initial block counter.\n * @returns Encrypted or decrypted bytes.\n * @example\n * Encrypts bytes with the original 8-byte-nonce ChaCha variant and a fresh key/nonce.\n *\n * ```ts\n * import { chacha20orig } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const nonce = randomBytes(8);\n * chacha20orig(key, nonce, new Uint8Array(4));\n * ```\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 smaller nonce, it's not safe to make it random (CSPRNG), due to collision chance.\n * @param key - 32-byte key.\n * @param nonce - 12-byte nonce.\n * @param data - Input bytes to xor with the keystream.\n * @param output - Optional destination buffer.\n * @param counter - Initial block counter.\n * @returns Encrypted or decrypted bytes.\n * @example\n * Encrypts bytes with the RFC 8439 ChaCha20 stream cipher and a fresh key/nonce.\n *\n * ```ts\n * import { chacha20 } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const nonce = randomBytes(12);\n * chacha20(key, nonce, new Uint8Array(4));\n * ```\n */\nexport const chacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n    counterRight: false,\n    counterLength: 4,\n    allowShortKeys: false,\n});\n/**\n * XChaCha eXtended-nonce ChaCha. With 24-byte nonce, it's safe to make it random (CSPRNG).\n * See {@link https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha | the IRTF draft}.\n * The nonce/counter layout still reserves 8 counter bytes internally, but the shared public\n * `counter` argument follows noble's strict non-wrapping 32-bit policy. See `src/_arx.ts`\n * near `MAX_COUNTER` for the full counter-policy rationale.\n * @param key - 32-byte key.\n * @param nonce - 24-byte extended nonce.\n * @param data - Input bytes to xor with the keystream.\n * @param output - Optional destination buffer.\n * @param counter - Initial block counter.\n * @returns Encrypted or decrypted bytes.\n * @example\n * Encrypts bytes with XChaCha20 using a fresh key and random 24-byte nonce.\n *\n * ```ts\n * import { xchacha20 } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const nonce = randomBytes(24);\n * xchacha20(key, nonce, new Uint8Array(4));\n * ```\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 * @param key - 32-byte key.\n * @param nonce - 12-byte nonce.\n * @param data - Input bytes to xor with the keystream.\n * @param output - Optional destination buffer.\n * @param counter - Initial block counter.\n * @returns Encrypted or decrypted bytes.\n * @example\n * Uses the reduced 8-round variant for non-critical workloads with a fresh key/nonce.\n *\n * ```ts\n * import { chacha8 } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const nonce = randomBytes(12);\n * chacha8(key, nonce, new Uint8Array(4));\n * ```\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 * @param key - 32-byte key.\n * @param nonce - 12-byte nonce.\n * @param data - Input bytes to xor with the keystream.\n * @param output - Optional destination buffer.\n * @param counter - Initial block counter.\n * @returns Encrypted or decrypted bytes.\n * @example\n * Uses the reduced 12-round variant for non-critical workloads with a fresh key/nonce.\n *\n * ```ts\n * import { chacha12 } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const nonce = randomBytes(12);\n * chacha12(key, nonce, new Uint8Array(4));\n * ```\n */\nexport const chacha12 = /* @__PURE__ */ createCipher(chachaCore, {\n    counterRight: false,\n    counterLength: 4,\n    rounds: 12,\n});\n// Test-only hook: exposes the unrolled production core so tests can compare it\n// with the simple/reference core from `test/misc/micro-ciphers.ts`.\nexport const __TESTS = /* @__PURE__ */ Object.freeze({ chachaCore });\n// RFC 8439 \u00A72.8.1 pad16(x): shared zero block for AAD/ciphertext padding.\nconst ZEROS16 = /* @__PURE__ */ new Uint8Array(16);\n// RFC 8439 \u00A72.8 / \u00A72.8.1: aligned inputs add nothing, otherwise append 16-(len%16) zero bytes.\nconst updatePadded = (h, msg) => {\n    h.update(msg);\n    const leftover = msg.length % 16;\n    if (leftover)\n        h.update(ZEROS16.subarray(leftover));\n};\n// RFC 8439 \u00A72.6.1 poly1305_key_gen returns `block[0..31]`, so AEAD key\n// generation only needs 32 zero bytes.\nconst ZEROS32 = /* @__PURE__ */ new Uint8Array(32);\nfunction computeTag(fn, key, nonce, ciphertext, AAD) {\n    if (AAD !== undefined)\n        abytes(AAD, undefined, 'AAD');\n    // RFC 8439 \u00A72.6 / \u00A72.8: derive the Poly1305 one-time key from counter 0,\n    // then MAC AAD || pad16(AAD) || ciphertext || pad16(ciphertext) || len(AAD) || len(ciphertext).\n    const authKey = fn(key, nonce, ZEROS32);\n    const lengths = u64Lengths(ciphertext.length, AAD ? AAD.length : 0, true);\n    // Methods below can be replaced with\n    // `return poly1305_computeTag_small(authKey, lengths, ciphertext, AAD)`\n    // from `test/misc/micro-ciphers.ts`.\n    const h = poly1305.create(authKey);\n    if (AAD)\n        updatePadded(h, AAD);\n    updatePadded(h, ciphertext);\n    h.update(lengths);\n    const res = h.digest();\n    clean(authKey, lengths);\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, 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    // This borrows caller key/nonce/AAD buffers by reference; mutating them after construction\n    // changes future encrypt/decrypt results.\n    const tagLength = 16;\n    return {\n        encrypt(plaintext, output) {\n            const plength = plaintext.length;\n            output = getOutput(plength + tagLength, output, false);\n            output.set(plaintext);\n            const oPlain = output.subarray(0, -tagLength);\n            // RFC 8439 \u00A72.8: payload encryption starts at counter 1 because counter 0 produced the OTK.\n            xorStream(key, nonce, oPlain, oPlain, 1);\n            const tag = computeTag(xorStream, key, nonce, oPlain, AAD);\n            output.set(tag, plength); // append tag\n            clean(tag);\n            return output;\n        },\n        decrypt(ciphertext, output) {\n            output = getOutput(ciphertext.length - tagLength, output, false);\n            const data = ciphertext.subarray(0, -tagLength);\n            const passedTag = ciphertext.subarray(-tagLength);\n            const tag = computeTag(xorStream, key, nonce, data, AAD);\n            // RFC 8439 \u00A72.8 / \u00A74: authenticate ciphertext before decrypting it, and compare tags with\n            // the constant-time equalBytes() helper rather than decrypting speculative plaintext first.\n            if (!equalBytes(passedTag, tag)) {\n                clean(tag);\n                throw new Error('invalid tag');\n            }\n            output.set(ciphertext.subarray(0, -tagLength));\n            // Actual decryption\n            xorStream(key, nonce, output, output, 1); // start stream with i=1\n            clean(tag);\n            return output;\n        },\n    };\n};\n/**\n * ChaCha20-Poly1305 from RFC 8439.\n *\n * Unsafe to use random nonces under the same key, due to collision chance.\n * Prefer XChaCha instead.\n * @param key - 32-byte key.\n * @param nonce - 12-byte nonce.\n * @param AAD - Additional authenticated data.\n * @returns AEAD cipher instance.\n * @example\n * Encrypts and authenticates plaintext with a fresh key and nonce.\n *\n * ```ts\n * import { chacha20poly1305 } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const nonce = randomBytes(12);\n * const aad = new TextEncoder().encode('session metadata');\n * const cipher = chacha20poly1305(key, nonce, aad);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const chacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 12, tagLength: 16, withAAD: true }, \n/* @__PURE__ */ _poly1305_aead(chacha20));\n/**\n * XChaCha20-Poly1305 extended-nonce chacha.\n *\n * Can be safely used with random nonces (CSPRNG).\n * See {@link https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha | the IRTF draft}.\n * @param key - 32-byte key.\n * @param nonce - 24-byte nonce.\n * @param AAD - Additional authenticated data.\n * @returns AEAD cipher instance.\n * @example\n * Encrypts and authenticates plaintext with a fresh key and random 24-byte nonce.\n *\n * ```ts\n * import { xchacha20poly1305 } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const key = randomBytes(32);\n * const nonce = randomBytes(24);\n * const aad = new TextEncoder().encode('session metadata');\n * const cipher = xchacha20poly1305(key, nonce, aad);\n * cipher.encrypt(new Uint8Array([1, 2, 3]));\n * ```\n */\nexport const xchacha20poly1305 = /* @__PURE__ */ wrapCipher({ blockSize: 64, nonceLength: 24, tagLength: 16, withAAD: true }, \n/* @__PURE__ */ _poly1305_aead(xchacha20));\n/**\n * Chacha20 CSPRNG (cryptographically secure pseudorandom number generator).\n * It's best to limit usage to non-production, non-critical cases: for example, test-only.\n * Compatible with libtomcrypt. It does not have a specification, so unclear how secure it is.\n * @param seed - Optional seed bytes mixed into the internal `key || nonce` state. When omitted,\n * only 32 random bytes are mixed into the 40-byte state.\n * @returns Seeded concrete `_XorStreamPRG` instance, including `clone()`.\n * @example\n * Seeds the test-only ChaCha20 DRBG from fresh entropy.\n *\n * ```ts\n * import { rngChacha20 } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const seed = randomBytes(32);\n * const prg = rngChacha20(seed);\n * prg.randomBytes(8);\n * ```\n */\nexport const rngChacha20 = /* @__PURE__ */ createPRG(chacha20orig, 64, 32, 8);\n/**\n * Chacha20/8 CSPRNG (cryptographically secure pseudorandom number generator).\n * It's best to limit usage to non-production, non-critical cases: for example, test-only.\n * Faster than `rngChacha20`.\n * @param seed - Optional seed bytes mixed into the internal `key || nonce` state. When omitted,\n * only 32 random bytes are mixed into the 44-byte state.\n * @returns Seeded concrete `_XorStreamPRG` instance, including `clone()`.\n * @example\n * Seeds the faster test-only ChaCha8 DRBG from fresh entropy.\n *\n * ```ts\n * import { rngChacha8 } from '@noble/ciphers/chacha.js';\n * import { randomBytes } from '@noble/ciphers/utils.js';\n * const seed = randomBytes(32);\n * const prg = rngChacha8(seed);\n * prg.randomBytes(8);\n * ```\n */\nexport const rngChacha8 = /* @__PURE__ */ createPRG(chacha8, 64, 32, 12);\n", null, null, "import {\n  NqHandshake,\n  chachaPoly,\n  noiseIk,\n  sha256H,\n  type TransportState,\n} from '@lukeburns/clatterjs'\nimport { randomBytes } from '@noble/ciphers/webcrypto'\nimport { fromBase64Url } from './index.js'\n\nexport const NOISE_IK_PROTOCOL = 'Noise_IK_25519_ChaChaPoly_SHA256' as const\n\nexport interface NoiseIkSessionOptions {\n  role: 'initiator' | 'responder'\n  localPrivateKey: string\n  localPublicKey: string\n  remotePublicKey: string\n  prologue: Uint8Array\n  random?: (length: number) => Uint8Array\n}\n\n/**\n * A narrow DSH Remote wrapper around a maintained Noise framework.\n *\n * It intentionally exposes only the fixed v1 IK suite and verifies the\n * transcript's remote static key before transport messages can be used.\n */\nexport class NoiseIkSession {\n  private readonly handshake: NqHandshake\n  private readonly expectedRemoteStatic: Uint8Array\n  private transport?: TransportState\n  private destroyed = false\n\n  constructor(options: NoiseIkSessionOptions) {\n    const localPrivate = requireKey(options.localPrivateKey, 'local private key')\n    const localPublic = requireKey(options.localPublicKey, 'local public key')\n    this.expectedRemoteStatic = requireKey(options.remotePublicKey, 'remote public key')\n    const initiator = options.role === 'initiator'\n    this.handshake = new NqHandshake(noiseIk(), {\n      prologue: Uint8Array.from(options.prologue),\n      initiator,\n      s: { secretKey: localPrivate, publicKey: localPublic },\n      ...(initiator ? { rs: Uint8Array.from(this.expectedRemoteStatic) } : {}),\n      cipher: chachaPoly,\n      hash: sha256H,\n      rng: options.random ?? randomBytes,\n    })\n    if (this.handshake.getName() !== NOISE_IK_PROTOCOL) {\n      throw new NoiseSessionError('NOISE_SUITE_MISMATCH', 'The Noise provider selected an unexpected cipher suite.')\n    }\n  }\n\n  get protocol(): typeof NOISE_IK_PROTOCOL { return NOISE_IK_PROTOCOL }\n\n  get complete(): boolean { return this.transport !== undefined }\n\n  get canWriteHandshake(): boolean {\n    this.assertLive()\n    return !this.complete && this.handshake.isWriteTurn()\n  }\n\n  writeHandshake(payload = new Uint8Array()): Uint8Array {\n    this.assertHandshake(false)\n    const output = new Uint8Array(payload.byteLength + this.handshake.getNextMessageOverhead())\n    const length = this.handshake.writeMessage(payload, output)\n    this.finishIfReady()\n    return output.slice(0, length)\n  }\n\n  readHandshake(message: Uint8Array): Uint8Array {\n    this.assertHandshake(true)\n    const output = new Uint8Array(message.byteLength)\n    const length = this.handshake.readMessage(message, output)\n    this.verifyRemoteStatic()\n    this.finishIfReady()\n    return output.slice(0, length)\n  }\n\n  encrypt(plaintext: Uint8Array): Uint8Array {\n    this.assertLive()\n    if (this.transport === undefined) throw new NoiseSessionError('NOISE_NOT_READY', 'The Noise handshake is not complete.')\n    return this.transport.sendVec(plaintext)\n  }\n\n  decrypt(ciphertext: Uint8Array): Uint8Array {\n    this.assertLive()\n    if (this.transport === undefined) throw new NoiseSessionError('NOISE_NOT_READY', 'The Noise handshake is not complete.')\n    return this.transport.receiveVec(ciphertext)\n  }\n\n  sendingCounter(): bigint {\n    if (this.transport === undefined) return 0n\n    return this.transport.sendingNonce()\n  }\n\n  receivingCounter(): bigint {\n    if (this.transport === undefined) return 0n\n    return this.transport.receivingNonce()\n  }\n\n  destroy(): void {\n    this.destroyed = true\n    this.expectedRemoteStatic.fill(0)\n    this.transport = undefined\n  }\n\n  private finishIfReady(): void {\n    if (!this.handshake.isFinished()) return\n    this.verifyRemoteStatic()\n    this.transport = this.handshake.finalize()\n  }\n\n  private verifyRemoteStatic(): void {\n    const actual = this.handshake.getRemoteStatic()\n    if (actual === undefined || !constantTimeEqual(actual, this.expectedRemoteStatic)) {\n      this.destroy()\n      throw new NoiseSessionError('PEER_IDENTITY_MISMATCH', 'The Noise peer static key does not match local trust.')\n    }\n  }\n\n  private assertHandshake(reading: boolean): void {\n    this.assertLive()\n    if (this.complete) throw new NoiseSessionError('NOISE_ALREADY_READY', 'The Noise handshake is already complete.')\n    if (this.handshake.isWriteTurn() === reading) {\n      throw new NoiseSessionError('NOISE_HANDSHAKE_ORDER', 'The Noise handshake message arrived out of order.')\n    }\n  }\n\n  private assertLive(): void {\n    if (this.destroyed) throw new NoiseSessionError('NOISE_DESTROYED', 'The Noise session is closed.')\n  }\n}\n\nexport class NoiseSessionError extends Error {\n  constructor(readonly code: string, message: string) { super(message) }\n}\n\nexport function createNoisePrologue(connectionId: string, hostDeviceId: string, clientDeviceId: string): Uint8Array {\n  for (const [name, value] of Object.entries({ connectionId, hostDeviceId, clientDeviceId })) {\n    if (value.length === 0 || value.includes('\\0')) throw new TypeError(`${name} is not safe for a Noise prologue`)\n  }\n  return new TextEncoder().encode(\n    `DSH-REMOTE\\0v=1\\0connection=${connectionId}\\0host=${hostDeviceId}\\0client=${clientDeviceId}`,\n  )\n}\n\nfunction requireKey(value: string, label: string): Uint8Array {\n  const key = fromBase64Url(value)\n  if (key.byteLength !== 32) throw new NoiseSessionError('INVALID_KEY', `${label} must be a 32-byte X25519 key.`)\n  return Uint8Array.from(key)\n}\n\nfunction constantTimeEqual(left: Uint8Array, right: Uint8Array): boolean {\n  if (left.byteLength !== right.byteLength) return false\n  let different = 0\n  for (let index = 0; index < left.byteLength; index += 1) different |= left[index]! ^ right[index]!\n  return different === 0\n}\n", "import { chacha20poly1305 } from '@noble/ciphers/chacha'\nimport { randomBytes } from '@noble/ciphers/webcrypto'\nimport { x25519 } from '@noble/curves/ed25519'\nimport { hkdf } from '@noble/hashes/hkdf'\nimport { sha256 } from '@noble/hashes/sha256'\n\nexport interface KeyPair {\n  publicKey: string\n  privateKey: string\n}\n\nexport interface EncryptedFrame {\n  nonce: string\n  ciphertext: string\n}\n\nexport function generateKeyPair(privateKeyBytes?: Uint8Array): KeyPair {\n  const privateKey = privateKeyBytes ?? x25519.utils.randomPrivateKey()\n  if (privateKey.byteLength !== 32) throw new Error('X25519 private keys must be 32 bytes')\n  const publicKey = x25519.getPublicKey(privateKey)\n  return {\n    privateKey: toBase64Url(privateKey),\n    publicKey: toBase64Url(publicKey),\n  }\n}\n\nexport function deriveSharedKey(privateKey: string, peerPublicKey: string, salt = 'dsh-remote-v1'): Uint8Array {\n  const shared = x25519.getSharedSecret(fromBase64Url(privateKey), fromBase64Url(peerPublicKey))\n  return hkdf(sha256, shared, new TextEncoder().encode(salt), new TextEncoder().encode('remote-channel'), 32)\n}\n\nexport function encryptFrame(key: Uint8Array, plaintext: Uint8Array, aad = 'dsh-remote-v1'): EncryptedFrame {\n  const nonce = randomBytes(12)\n  const cipher = chacha20poly1305(key, nonce, new TextEncoder().encode(aad))\n  return {\n    nonce: toBase64Url(nonce),\n    ciphertext: toBase64Url(cipher.encrypt(plaintext)),\n  }\n}\n\nexport function decryptFrame(key: Uint8Array, frame: EncryptedFrame, aad = 'dsh-remote-v1'): Uint8Array {\n  const cipher = chacha20poly1305(key, fromBase64Url(frame.nonce), new TextEncoder().encode(aad))\n  return cipher.decrypt(fromBase64Url(frame.ciphertext))\n}\n\nexport function toBase64Url(bytes: Uint8Array): string {\n  const binary = Array.from(bytes, byte => String.fromCharCode(byte)).join('')\n  const base64 = typeof btoa === 'function'\n    ? btoa(binary)\n    : Buffer.from(bytes).toString('base64')\n  return base64.replaceAll('+', '-').replaceAll('/', '_').replaceAll('=', '')\n}\n\nexport function fromBase64Url(value: string): Uint8Array {\n  const normalized = value.replaceAll('-', '+').replaceAll('_', '/')\n  const padded = normalized.padEnd(Math.ceil(normalized.length / 4) * 4, '=')\n  if (typeof atob === 'function') {\n    return Uint8Array.from(atob(padded), char => char.charCodeAt(0))\n  }\n  return new Uint8Array(Buffer.from(padded, 'base64'))\n}\n\nexport function identityFingerprint(publicKey: string): string {\n  return Array.from(sha256(fromBase64Url(publicKey)).slice(0, 6), byte => byte.toString(16).padStart(2, '0'))\n    .join('')\n    .toUpperCase()\n}\n\nexport {\n  NOISE_IK_PROTOCOL,\n  NoiseIkSession,\n  NoiseSessionError,\n  createNoisePrologue,\n} from './noise.js'\nexport type { NoiseIkSessionOptions } from './noise.js'\n", "import { NoiseIkSession, createNoisePrologue } from '@dsh-remote/crypto'\nimport { SecureMessageCodec } from '@dsh-remote/protocol'\nimport type { RemoteTransport, SecureHandshakeTransport } from '@dsh-remote/webrtc'\nimport type { HostIdentity, TrustedPeer } from './identity-store.js'\n\n/** Client-side Noise IK wrapper used by the local Harness remote-mode runtime. */\nexport class ClientSecureTransport implements RemoteTransport {\n  private noise?: NoiseIkSession\n  private unsubscribeInner?: () => void\n  private readonly incoming = new SecureMessageCodec()\n  private readonly outgoing = new SecureMessageCodec()\n  private closed = false\n\n  constructor(\n    private readonly inner: SecureHandshakeTransport,\n    private readonly identity: HostIdentity,\n    private readonly host: TrustedPeer,\n  ) {}\n\n  async connect(): Promise<void> {\n    this.closed = false\n    this.incoming.reset()\n    this.outgoing.reset()\n    await this.inner.connect()\n    const info = this.inner.connectionInfo()\n    if (info.localDeviceId !== this.identity.deviceId || info.remoteDeviceId !== this.host.deviceId) {\n      await this.inner.close()\n      throw new Error('The relay connection is bound to an unexpected device.')\n    }\n    const noise = new NoiseIkSession({\n      role: 'initiator',\n      localPrivateKey: this.identity.privateKey,\n      localPublicKey: this.identity.publicKey,\n      remotePublicKey: this.host.publicKey,\n      prologue: createNoisePrologue(info.connectionId, this.host.deviceId, this.identity.deviceId),\n    })\n    this.noise = noise\n    try {\n      await waitForResponder(this.inner, noise)\n    } catch (error) {\n      noise.destroy()\n      this.noise = undefined\n      await this.inner.close()\n      throw error\n    }\n  }\n\n  async send(data: Uint8Array): Promise<void> {\n    for (const plaintext of this.outgoing.encode(data)) {\n      await this.inner.send(this.requireNoise().encrypt(plaintext))\n    }\n  }\n\n  onMessage(handler: (data: Uint8Array) => void): () => void {\n    this.unsubscribeInner?.()\n    this.unsubscribeInner = this.inner.onMessage(data => {\n      const noise = this.noise\n      if (noise === undefined || !noise.complete || this.closed) return\n      try {\n        const message = this.incoming.decode(noise.decrypt(data))\n        if (message !== undefined) handler(message)\n      } catch {\n        void this.close()\n      }\n    })\n    return () => {\n      this.unsubscribeInner?.()\n      this.unsubscribeInner = undefined\n    }\n  }\n\n  onClose(handler: () => void): () => void {\n    return this.inner.onClose?.(handler) ?? (() => undefined)\n  }\n\n  async close(): Promise<void> {\n    if (this.closed) return\n    this.closed = true\n    this.unsubscribeInner?.()\n    this.unsubscribeInner = undefined\n    this.incoming.reset()\n    this.outgoing.reset()\n    this.noise?.destroy()\n    this.noise = undefined\n    await this.inner.close()\n  }\n\n  getStats() { return this.inner.getStats() }\n\n  private requireNoise(): NoiseIkSession {\n    if (this.noise === undefined || !this.noise.complete || this.closed) {\n      throw new Error('The authenticated Noise channel is not connected.')\n    }\n    return this.noise\n  }\n}\n\nasync function waitForResponder(inner: SecureHandshakeTransport, noise: NoiseIkSession): Promise<void> {\n  await new Promise<void>((resolve, reject) => {\n    let settled = false\n    const timer = setTimeout(() => finish(new Error('Noise IK handshake timed out.')), 10_000)\n    const unsubscribe = inner.onHandshake((step, data) => {\n      if (settled) return\n      try {\n        if (step !== 2) throw new Error('Noise IK responder sent an out-of-order handshake message.')\n        noise.readHandshake(data)\n        if (!noise.complete) throw new Error('Noise IK handshake did not complete.')\n        finish()\n      } catch (error) {\n        finish(error instanceof Error ? error : new Error('Noise IK handshake failed.'))\n      }\n    })\n    const finish = (error?: Error): void => {\n      if (settled) return\n      settled = true\n      clearTimeout(timer)\n      unsubscribe()\n      if (error === undefined) resolve()\n      else reject(error)\n    }\n    void inner.sendHandshake(1, noise.writeHandshake()).catch(error => {\n      finish(error instanceof Error ? error : new Error('Noise IK handshake failed.'))\n    })\n  })\n}\n", "import { randomBytes } from 'node:crypto'\n\nexport function uuidV7(now = Date.now()): string {\n  if (!Number.isSafeInteger(now) || now < 0 || now > 0xffffffffffff) {\n    throw new RangeError('UUIDv7 timestamp must be a non-negative 48-bit integer')\n  }\n  const bytes = randomBytes(16)\n  let timestamp = BigInt(now)\n  for (let index = 5; index >= 0; index -= 1) {\n    bytes[index] = Number(timestamp & 0xffn)\n    timestamp >>= 8n\n  }\n  bytes[6] = 0x70 | (bytes[6]! & 0x0f)\n  bytes[8] = 0x80 | (bytes[8]! & 0x3f)\n  const hex = bytes.toString('hex')\n  return `${hex.slice(0, 8)}-${hex.slice(8, 12)}-${hex.slice(12, 16)}-${hex.slice(16, 20)}-${hex.slice(20)}`\n}\n", "import type {\n  ApiProxy,\n  ClientResponse,\n  HostFrame,\n  MuxFrame,\n  RpcRequest,\n  RpcResponse,\n} from '@deepseek-ai/dsh-host-apiproxy/api'\nimport type { RemoteClientCore } from '@dsh-remote/client-core'\nimport type { EventPayload, HarnessApiFrameData, HarnessApiStreamClosedData } from '@dsh-remote/protocol'\nimport { uuidV7 } from './ids.js'\n\ntype NativeRequest = RpcRequest<unknown>\ntype NativeResponse = RpcResponse<unknown>\ntype NativeCall = (request: NativeRequest, signal?: AbortSignal) => Promise<NativeResponse>\n\n/** ApiProxy-compatible face that preserves the native Harness envelopes over Remote RPC. */\nexport class RemoteHarnessApiProxy {\n  readonly api: ApiProxy\n\n  constructor(private readonly client: RemoteClientCore) {\n    const call = (method: string): NativeCall => (request, signal) => this.call(method, request, signal)\n    this.api = {\n      sessions: {\n        list: call('session.list') as never,\n        search: call('session.search') as never,\n        create: call('session.create') as never,\n        history: call('session.history') as never,\n        models: call('session.models') as never,\n        selectModel: call('session.selectModel') as never,\n        rename: call('session.rename') as never,\n        fork: call('session.fork') as never,\n        prompt: call('session.prompt') as never,\n        attachment: call('session.attachment') as never,\n        updateQueue: call('session.updateQueue') as never,\n        cancel: call('session.cancel') as never,\n      },\n      subagents: {\n        list: call('subagent.list') as never,\n        history: call('subagent.history') as never,\n        prompt: call('subagent.prompt') as never,\n        interrupt: call('subagent.interrupt') as never,\n      },\n      host: {\n        describe: call('host.describe') as never,\n        pickDirectory: call('host.pickDirectory') as never,\n        listDirectory: call('host.listDirectory') as never,\n        createDirectory: call('host.createDirectory') as never,\n        openPath: call('host.openPath') as never,\n      },\n      workspace: {\n        list: call('workspace.list') as never,\n        create: call('workspace.create') as never,\n        rename: call('workspace.rename') as never,\n        delete: call('workspace.delete') as never,\n        insertBefore: call('workspace.insertBefore') as never,\n        insertSessionBefore: call('workspace.insertSessionBefore') as never,\n        archiveSession: call('workspace.archiveSession') as never,\n      },\n      skills: { list: call('skill.list') as never },\n      agentPresets: {\n        list: call('agentPreset.list') as never,\n        select: call('agentPreset.select') as never,\n        read: call('agentPreset.read') as never,\n        copy: call('agentPreset.copy') as never,\n        openDocument: call('agentPreset.openDocument') as never,\n        remove: call('agentPreset.remove') as never,\n      },\n      goals: {\n        create: call('goal.create') as never,\n        edit: call('goal.edit') as never,\n        pause: call('goal.pause') as never,\n        resume: call('goal.resume') as never,\n        complete: call('goal.complete') as never,\n        clear: call('goal.clear') as never,\n      },\n      settings: {\n        describe: call('settings.describe') as never,\n        openDocument: call('settings.openDocument') as never,\n        update: call('settings.update') as never,\n        replace: call('settings.replace') as never,\n        mutate: call('settings.mutate') as never,\n      },\n      credentials: {\n        describe: call('credentials.describe') as never,\n        set: call('credentials.set') as never,\n        unset: call('credentials.unset') as never,\n      },\n      llm: {\n        providers: call('llm.providers') as never,\n        models: call('llm.models') as never,\n        discoverModels: call('llm.discoverModels') as never,\n      },\n      events: {\n        mux: (request, signal) => this.stream<MuxFrame>('mux', request, signal),\n        host: (request, signal) => this.stream<HostFrame>('host', request, signal),\n      },\n      downloads: {} as ApiProxy['downloads'],\n      respond: message => this.respond(message),\n    }\n  }\n\n  private async call(method: string, request: NativeRequest, signal?: AbortSignal): Promise<NativeResponse> {\n    const response = await this.client.rpc<NativeResponse>('harness.api.call', {\n      method,\n      rpcId: String(request.rpcId),\n      payload: request.payload,\n    }, signal)\n    if (String(response.rpcId) !== String(request.rpcId) || typeof response.result !== 'object' || response.result === null) {\n      throw new Error('The remote Host returned an invalid Harness API response.')\n    }\n    return response\n  }\n\n  private async respond(message: ClientResponse): Promise<Awaited<ReturnType<ApiProxy['respond']>>> {\n    return this.client.rpc('harness.api.respond', { message }) as Promise<Awaited<ReturnType<ApiProxy['respond']>>>\n  }\n\n  private async *stream<TFrame extends MuxFrame | HostFrame>(\n    stream: 'mux' | 'host',\n    request: RpcRequest<unknown>,\n    signal: AbortSignal,\n  ): AsyncIterable<RpcRequest<TFrame>> {\n    const streamId = uuidV7()\n    const queue = new AsyncFrameQueue<TFrame>()\n    const unsubscribe = this.client.onEvent(event => routeStreamEvent(event, streamId, queue))\n    const unsubscribeClose = this.client.onClose(() => queue.close())\n    const onAbort = () => queue.close()\n    signal.addEventListener('abort', onAbort, { once: true })\n    try {\n      try {\n        await this.client.rpc('harness.api.stream.open', {\n          streamId,\n          stream,\n          rpcId: String(request.rpcId),\n          payload: request.payload,\n        }, signal)\n        for await (const frame of queue) yield frame\n      } catch (error) {\n        // Native Harness event consumers treat a thrown stream iterator as a\n        // fatal load failure. A remote disconnect is normal lifecycle here:\n        // ClientModeRuntime has already switched ApiProxy back to local mode,\n        // so finish this old iterator cleanly instead of terminating Harness.\n        if (!isRemoteDisconnect(error)) throw error\n      }\n    } finally {\n      signal.removeEventListener('abort', onAbort)\n      unsubscribe()\n      unsubscribeClose()\n      queue.close()\n      await this.client.rpc('harness.api.stream.close', { streamId }).catch(() => undefined)\n    }\n  }\n}\n\nfunction isRemoteDisconnect(error: unknown): boolean {\n  return error instanceof Error && (error.message === 'remote transport closed' || error.message === 'remote client closed')\n}\n\nclass AsyncFrameQueue<TFrame> implements AsyncIterable<RpcRequest<TFrame>> {\n  private readonly values: RpcRequest<TFrame>[] = []\n  private readonly waiters: Array<(result: IteratorResult<RpcRequest<TFrame>>) => void> = []\n  private closed = false\n\n  push(value: RpcRequest<TFrame>): void {\n    if (this.closed) return\n    const waiter = this.waiters.shift()\n    if (waiter === undefined) this.values.push(value)\n    else waiter({ done: false, value })\n  }\n\n  close(): void {\n    if (this.closed) return\n    this.closed = true\n    for (const waiter of this.waiters.splice(0)) waiter({ done: true, value: undefined })\n  }\n\n  async *[Symbol.asyncIterator](): AsyncIterator<RpcRequest<TFrame>> {\n    while (true) {\n      const value = this.values.shift()\n      if (value !== undefined) {\n        yield value\n        continue\n      }\n      if (this.closed) return\n      const next = await new Promise<IteratorResult<RpcRequest<TFrame>>>(resolve => this.waiters.push(resolve))\n      if (next.done) return\n      yield next.value\n    }\n  }\n}\n\nfunction routeStreamEvent<TFrame>(event: EventPayload, streamId: string, queue: AsyncFrameQueue<TFrame>): void {\n  if (event.event === 'harness.api.frame') {\n    const data = event.data as Partial<HarnessApiFrameData>\n    if (data.streamId !== streamId || typeof data.frame !== 'object' || data.frame === null\n      || typeof data.frame.rpcId !== 'string' || !('payload' in data.frame)) return\n    queue.push(data.frame as RpcRequest<TFrame>)\n  }\n  if (event.event === 'harness.api.stream.closed') {\n    const data = event.data as Partial<HarnessApiStreamClosedData>\n    if (data.streamId === streamId) queue.close()\n  }\n}\n", "import { platform } from 'node:os'\nimport { fromBase64Url, toBase64Url } from '@dsh-remote/crypto'\nimport type { RtcIceServer } from '@dsh-remote/webrtc'\nimport type { HostIdentity } from './identity-store.js'\nimport type { ServerCredentialStore, ServerCredentials } from './server-credentials.js'\nimport { normalizeServerUrl } from './config.js'\nimport { PLUGIN_VERSION } from './version.js'\n\ninterface TokenPair {\n  accessToken: string\n  accessTokenExpiresAt: number\n  refreshToken: string\n  refreshTokenExpiresAt: number\n}\n\ninterface ErrorEnvelope {\n  error?: { code?: unknown; message?: unknown; retryable?: unknown }\n  detail?: unknown\n}\n\ninterface WebLoginResponse {\n  token: string\n  expiresAt: number\n  account: string\n  profile: unknown\n  isAdmin: boolean\n}\n\nexport interface OAuthQrSession {\n  qrId: string\n  scanUrl: string\n  expiresIn: number\n}\n\nexport type OAuthQrPollResult =\n  | { status: 'pending' | 'expired' }\n  | { status: 'complete'; authorization: DeviceAuthorization }\n\nexport interface DeviceAuthorization {\n  method: 'account' | 'host_registration_code' | 'owned_device'\n  account?: string\n  expiresAt?: number\n  isAdmin?: boolean\n}\n\nexport type FetchImplementation = typeof fetch\n\nexport interface ServerHostDevice {\n  deviceId: string\n  name: string\n  platform: string\n  membershipId: string\n  online?: boolean\n  lastSeenAt?: number\n  clientVersion?: string\n  harnessVersion?: string\n}\n\nexport interface AuthorizedPeerDevice extends ServerHostDevice {\n  role: 'host' | 'client'\n  identityKey: string\n}\n\nexport class HostServerApi {\n  readonly baseUrl: string\n  private identity?: HostIdentity\n  private credentials?: ServerCredentials\n  private credentialsPromise?: Promise<ServerCredentials>\n\n  constructor(\n    serverUrl: string,\n    private readonly store: ServerCredentialStore,\n    private readonly fetchImplementation: FetchImplementation = fetch,\n    private readonly role: 'host' | 'client' = 'host',\n  ) {\n    this.baseUrl = normalizeServerUrl(serverUrl)\n  }\n\n  bindIdentity(identity: HostIdentity): void { this.identity = identity }\n\n  currentAuthorization(): DeviceAuthorization | undefined {\n    if (this.credentials === undefined) return undefined\n    return {\n      method: this.credentials.authorizationMethod,\n      ...(this.credentials.account === undefined ? {} : { account: this.credentials.account }),\n    }\n  }\n\n  async clearAuthorization(): Promise<void> {\n    this.credentials = undefined\n    this.credentialsPromise = undefined\n    await this.store.clear()\n  }\n\n  async revokeCurrentDevice(): Promise<void> {\n    const identity = this.requireIdentity()\n    if (await this.store.load(this.baseUrl, identity.deviceId) === undefined) {\n      await this.clearAuthorization()\n      return\n    }\n    try {\n      await this.request<unknown>('/api/v1/devices/self', { method: 'DELETE' })\n    } finally {\n      await this.clearAuthorization()\n    }\n  }\n\n  async authorizeWithAccount(identity: HostIdentity, email: string, password: string): Promise<DeviceAuthorization> {\n    this.bindIdentity(identity)\n    const account = email.trim()\n    if (account.length === 0 || password.length === 0) {\n      throw new ServerApiError('INVALID_MESSAGE', 'Email and password are required.', false)\n    }\n    const login = validateWebLogin(await this.publicRequest<unknown>('/api/v1/auth/login', {\n      method: 'POST',\n      body: JSON.stringify({ email: account, password }),\n    }))\n    await this.register(identity, {\n      accountToken: login.token,\n      account: login.account,\n      authorizationMethod: 'account',\n    })\n    return {\n      method: 'account',\n      account: login.account,\n      expiresAt: login.expiresAt,\n      isAdmin: login.isAdmin,\n    }\n  }\n\n  async startOAuthQrLogin(): Promise<OAuthQrSession> {\n    const value = requireRecord(await this.publicRequest<unknown>('/api/v1/auth/oauth/qr/start', {\n      method: 'POST',\n      body: '{}',\n    }), 'QR login')\n    if (typeof value.qrId !== 'string' || value.qrId.length < 20\n      || typeof value.scanUrl !== 'string' || !value.scanUrl.startsWith(`${this.baseUrl}/`)\n      || !Number.isSafeInteger(value.expiresIn)) {\n      throw new ServerApiError('INVALID_MESSAGE', 'The Server returned an invalid QR login session.', false)\n    }\n    return { qrId: value.qrId, scanUrl: value.scanUrl, expiresIn: value.expiresIn as number }\n  }\n\n  async pollOAuthQrLogin(identity: HostIdentity, qrId: string): Promise<OAuthQrPollResult> {\n    const value = requireRecord(await this.publicRequest<unknown>(\n      `/api/v1/auth/oauth/qr/${encodeURIComponent(qrId)}`,\n      { method: 'GET' },\n    ), 'QR login status')\n    if (value.status === 'pending' || value.status === 'expired') return { status: value.status }\n    if (value.status !== 'complete' || typeof value.token !== 'string' || value.token.length < 16) {\n      throw new ServerApiError('INVALID_MESSAGE', 'The Server returned an invalid QR login status.', false)\n    }\n    const account = requireRecord(await this.publicRequest<unknown>(\n      '/api/v1/auth/me',\n      { method: 'GET' },\n      value.token,\n    ), 'account profile')\n    if (typeof account.account !== 'string' || account.account.length === 0 || typeof account.isAdmin !== 'boolean') {\n      throw new ServerApiError('INVALID_MESSAGE', 'The Server returned an invalid account profile.', false)\n    }\n    await this.register(identity, {\n      accountToken: value.token,\n      account: account.account,\n      authorizationMethod: 'account',\n    })\n    return {\n      status: 'complete',\n      authorization: { method: 'account', account: account.account, isAdmin: account.isAdmin },\n    }\n  }\n\n  async authorizeHostWithCode(identity: HostIdentity, code: string): Promise<DeviceAuthorization> {\n    if (this.role !== 'host') {\n      throw new ServerApiError('METHOD_NOT_ALLOWED', 'Host registration codes can only authorize a Host device.', false)\n    }\n    const registrationCode = code.trim().toUpperCase()\n    if (registrationCode.length === 0) {\n      throw new ServerApiError('INVALID_MESSAGE', 'A Host registration code is required.', false)\n    }\n    this.bindIdentity(identity)\n    const tokens = await this.publicRequest<TokenPair>('/api/v1/devices/register-with-code', {\n      method: 'POST',\n      body: JSON.stringify({ v: 1, code: registrationCode, device: this.deviceDescriptor(identity) }),\n    })\n    this.credentials = await this.saveTokens(identity, validateTokens(tokens), {\n      authorizationMethod: 'host_registration_code',\n    })\n    return { method: 'host_registration_code' }\n  }\n\n  async authorizeOwnedRole(\n    identity: HostIdentity,\n    authorizingAccessToken: string,\n    account?: string,\n  ): Promise<DeviceAuthorization> {\n    this.bindIdentity(identity)\n    const tokens = await this.publicRequest<TokenPair>('/api/v1/devices/register-owned-role', {\n      method: 'POST',\n      body: JSON.stringify({ v: 1, device: this.deviceDescriptor(identity) }),\n    }, authorizingAccessToken)\n    this.credentials = await this.saveTokens(identity, validateTokens(tokens), {\n      authorizationMethod: 'owned_device',\n      ...(account === undefined ? {} : { account }),\n    })\n    return {\n      method: 'owned_device',\n      ...(account === undefined ? {} : { account }),\n    }\n  }\n\n  async authenticate(identity = this.requireIdentity()): Promise<ServerCredentials> {\n    this.bindIdentity(identity)\n    if (this.credentials !== undefined && this.credentials.accessTokenExpiresAt > Date.now() + 30_000) {\n      return this.credentials\n    }\n    this.credentialsPromise ??= this.loadOrIssue(identity).finally(() => { this.credentialsPromise = undefined })\n    this.credentials = await this.credentialsPromise\n    return this.credentials\n  }\n\n  async refreshCredentials(): Promise<ServerCredentials> {\n    const identity = this.requireIdentity()\n    const stored = await this.store.load(this.baseUrl, identity.deviceId)\n    if (stored === undefined || stored.refreshTokenExpiresAt <= Date.now()) return this.register(identity)\n    const tokens = await this.publicRequest<TokenPair>('/api/v1/auth/refresh', {\n      method: 'POST',\n      body: JSON.stringify({ deviceId: identity.deviceId, refreshToken: stored.refreshToken }),\n    })\n    this.credentials = await this.store.save({\n      serverUrl: this.baseUrl,\n      deviceId: identity.deviceId,\n      authorizationMethod: stored.authorizationMethod,\n      ...(stored.account === undefined ? {} : { account: stored.account }),\n      ...validateTokens(tokens),\n    })\n    return this.credentials\n  }\n\n  async listDevices(): Promise<ServerHostDevice[]> {\n    const result = await this.request<{ items?: unknown }>('/api/v1/devices')\n    if (!Array.isArray(result.items)) throw new ServerApiError('INVALID_MESSAGE', 'The Server returned an invalid device list.', false)\n    return result.items.map(parseHostDevice)\n  }\n\n  async deviceFor(peerDeviceId: string): Promise<AuthorizedPeerDevice> {\n    const result = await this.request<unknown>(`/api/v1/devices/${encodeURIComponent(peerDeviceId)}`)\n    return parseAuthorizedPeer(result)\n  }\n\n  async turnCredentials(connectionId: string): Promise<RtcIceServer[]> {\n    const result = await this.request<{ iceServers?: unknown }>(\n      `/api/v1/turn/credentials?connection_id=${encodeURIComponent(connectionId)}`,\n    )\n    if (!Array.isArray(result.iceServers)) return []\n    return result.iceServers.map(parseIceServer)\n  }\n\n  async presenceFor(deviceId: string): Promise<{ online: boolean; lastSeenAt?: number }> {\n    const result = await this.request<Record<string, unknown>>(`/api/v1/devices/${encodeURIComponent(deviceId)}/presence`)\n    if (typeof result.online !== 'boolean'\n      || (result.lastSeenAt !== null && result.lastSeenAt !== undefined && !Number.isSafeInteger(result.lastSeenAt))) {\n      throw new ServerApiError('INVALID_MESSAGE', 'The Server returned invalid device presence.', false)\n    }\n    return { online: result.online, ...(typeof result.lastSeenAt === 'number' ? { lastSeenAt: result.lastSeenAt } : {}) }\n  }\n\n  private async loadOrIssue(identity: HostIdentity): Promise<ServerCredentials> {\n    const stored = await this.store.load(this.baseUrl, identity.deviceId)\n    if (stored === undefined || stored.refreshTokenExpiresAt <= Date.now() + 30_000) {\n      return this.register(identity)\n    }\n    if (stored.accessTokenExpiresAt > Date.now() + 30_000) return stored\n    const tokens = await this.publicRequest<TokenPair>('/api/v1/auth/refresh', {\n      method: 'POST',\n      body: JSON.stringify({ deviceId: identity.deviceId, refreshToken: stored.refreshToken }),\n    })\n    return this.store.save({\n      serverUrl: this.baseUrl,\n      deviceId: identity.deviceId,\n      authorizationMethod: stored.authorizationMethod,\n      ...(stored.account === undefined ? {} : { account: stored.account }),\n      ...validateTokens(tokens),\n    })\n  }\n\n  private async register(\n    identity: HostIdentity,\n    authorization?: {\n      accountToken: string\n      account: string\n      authorizationMethod: 'account'\n    },\n  ): Promise<ServerCredentials> {\n    const tokens = await this.publicRequest<TokenPair>('/api/v1/devices/register', {\n      method: 'POST',\n      body: JSON.stringify({\n        v: 1,\n        device: this.deviceDescriptor(identity),\n      }),\n    }, authorization?.accountToken)\n    this.credentials = await this.saveTokens(identity, validateTokens(tokens), {\n      authorizationMethod: authorization?.authorizationMethod ?? 'account',\n      ...(authorization?.account === undefined ? {} : { account: authorization.account }),\n    })\n    return this.credentials\n  }\n\n  private deviceDescriptor(identity: HostIdentity): Record<string, unknown> {\n    return {\n      deviceId: identity.deviceId,\n      name: identity.name,\n      role: this.role,\n      platform: platform(),\n      identityKey: identity.publicKey,\n      clientVersion: PLUGIN_VERSION,\n      ...(this.role === 'host' ? { harnessVersion: '0.1.0-rc.6' } : {}),\n    }\n  }\n\n  private saveTokens(\n    identity: HostIdentity,\n    tokens: TokenPair,\n    authorization: Pick<ServerCredentials, 'authorizationMethod' | 'account'>,\n  ): Promise<ServerCredentials> {\n    return this.store.save({\n      serverUrl: this.baseUrl,\n      deviceId: identity.deviceId,\n      authorizationMethod: authorization.authorizationMethod,\n      ...(authorization.account === undefined ? {} : { account: authorization.account }),\n      ...tokens,\n    })\n  }\n\n  private async request<TResult>(path: string, init: RequestInit = {}): Promise<TResult> {\n    const credentials = await this.authenticate()\n    return this.publicRequest<TResult>(path, init, credentials.accessToken)\n  }\n\n  private async publicRequest<TResult>(path: string, init: RequestInit, accessToken?: string): Promise<TResult> {\n    const controller = new AbortController()\n    const timer = setTimeout(() => controller.abort(), 10_000)\n    let response: Response\n    try {\n      response = await this.fetchImplementation(`${this.baseUrl}${path}`, {\n        ...init,\n        signal: controller.signal,\n        headers: {\n          Accept: 'application/json',\n          'Content-Type': 'application/json',\n          ...(accessToken === undefined ? {} : { Authorization: `Bearer ${accessToken}` }),\n          ...init.headers,\n        },\n      })\n    } catch (error) {\n      throw new ServerApiError('CONNECTION_FAILED', error instanceof Error ? error.message : 'Server request failed.', true)\n    } finally {\n      clearTimeout(timer)\n    }\n    const body = await parseBody(response)\n    if (!response.ok) {\n      const envelope = (body ?? {}) as ErrorEnvelope\n      throw new ServerApiError(\n        typeof envelope.error?.code === 'string' ? envelope.error.code : mapStatus(response.status),\n        typeof envelope.error?.message === 'string' ? envelope.error.message : 'The Server rejected the request.',\n        envelope.error?.retryable === true || response.status >= 500,\n        response.status,\n      )\n    }\n    return body as TResult\n  }\n\n  private requireIdentity(): HostIdentity {\n    if (this.identity === undefined) throw new ServerApiError('IDENTITY_INVALID', 'The device identity is not loaded.', false)\n    return this.identity\n  }\n}\n\nexport class ClientServerApi extends HostServerApi {\n  constructor(serverUrl: string, store: ServerCredentialStore, fetchImplementation: FetchImplementation = fetch) {\n    super(serverUrl, store, fetchImplementation, 'client')\n  }\n}\n\nexport class ServerApiError extends Error {\n  constructor(\n    readonly code: string,\n    message: string,\n    readonly retryable: boolean,\n    readonly status?: number,\n  ) { super(message) }\n}\n\nfunction validateTokens(value: TokenPair): TokenPair {\n  if (typeof value.accessToken !== 'string' || value.accessToken.length < 16\n    || typeof value.refreshToken !== 'string' || value.refreshToken.length < 16\n    || !Number.isSafeInteger(value.accessTokenExpiresAt)\n    || !Number.isSafeInteger(value.refreshTokenExpiresAt)) {\n    throw new ServerApiError('INVALID_MESSAGE', 'The Server returned invalid device credentials.', false)\n  }\n  return value\n}\n\nfunction validateWebLogin(value: unknown): WebLoginResponse {\n  const item = requireRecord(value, 'account login')\n  if (typeof item.token !== 'string' || item.token.length < 16\n    || !Number.isSafeInteger(item.expiresAt)\n    || typeof item.account !== 'string' || item.account.length === 0 || item.account.length > 254\n    || typeof item.isAdmin !== 'boolean') {\n    throw new ServerApiError('INVALID_MESSAGE', 'The Server returned an invalid account session.', false)\n  }\n  return {\n    token: item.token,\n    expiresAt: item.expiresAt as number,\n    account: item.account,\n    profile: item.profile,\n    isAdmin: item.isAdmin,\n  }\n}\n\nasync function parseBody(response: Response): Promise<unknown> {\n  const text = await response.text()\n  if (text.length === 0) return undefined\n  try {\n    return JSON.parse(text)\n  } catch {\n    throw new ServerApiError('INVALID_MESSAGE', 'The Server returned invalid JSON.', false, response.status)\n  }\n}\n\nfunction mapStatus(status: number): string {\n  if (status === 401) return 'AUTH_INVALID'\n  if (status === 403) return 'AUTH_REQUIRED'\n  if (status === 404) return 'DEVICE_NOT_FOUND'\n  if (status === 429) return 'RATE_LIMITED'\n  return status >= 500 ? 'CONNECTION_FAILED' : 'INVALID_MESSAGE'\n}\n\nfunction parseHostDevice(value: unknown): ServerHostDevice {\n  const item = requireRecord(value, 'host device')\n  if (item.role !== 'host' || typeof item.deviceId !== 'string' || typeof item.name !== 'string'\n    || typeof item.platform !== 'string' || typeof item.membershipId !== 'string' || item.membershipId.length === 0) {\n    throw new ServerApiError('INVALID_MESSAGE', 'The Server returned invalid host device data.', false)\n  }\n  return {\n    deviceId: item.deviceId,\n    name: item.name,\n    platform: item.platform,\n    membershipId: item.membershipId,\n    ...(typeof item.online === 'boolean' ? { online: item.online } : {}),\n    ...(typeof item.lastSeenAt === 'number' && Number.isSafeInteger(item.lastSeenAt) ? { lastSeenAt: item.lastSeenAt } : {}),\n    ...(typeof item.clientVersion === 'string' ? { clientVersion: item.clientVersion } : {}),\n    ...(typeof item.harnessVersion === 'string' ? { harnessVersion: item.harnessVersion } : {}),\n  }\n}\n\nfunction parseAuthorizedPeer(value: unknown): AuthorizedPeerDevice {\n  const item = requireRecord(value, 'authorized peer')\n  if ((item.role !== 'host' && item.role !== 'client')\n    || typeof item.deviceId !== 'string' || item.deviceId.length === 0\n    || typeof item.name !== 'string' || item.name.length === 0\n    || typeof item.platform !== 'string' || item.platform.length === 0\n    || typeof item.identityKey !== 'string' || !isIdentityKey(item.identityKey)\n    || typeof item.membershipId !== 'string' || item.membershipId.length === 0) {\n    throw new ServerApiError('INVALID_MESSAGE', 'The Server returned invalid authorized peer data.', false)\n  }\n  return {\n    deviceId: item.deviceId,\n    name: item.name,\n    role: item.role,\n    platform: item.platform,\n    identityKey: item.identityKey,\n    membershipId: item.membershipId,\n    ...(typeof item.online === 'boolean' ? { online: item.online } : {}),\n    ...(typeof item.lastSeenAt === 'number' && Number.isSafeInteger(item.lastSeenAt) ? { lastSeenAt: item.lastSeenAt } : {}),\n  }\n}\n\nfunction parseIceServer(value: unknown): RtcIceServer {\n  const item = requireRecord(value, 'ICE server')\n  const urls = item.urls\n  if (typeof urls !== 'string' && !(Array.isArray(urls) && urls.every(url => typeof url === 'string'))) {\n    throw new ServerApiError('INVALID_MESSAGE', 'The Server returned an invalid ICE server.', false)\n  }\n  return {\n    urls,\n    ...(typeof item.username === 'string' ? { username: item.username } : {}),\n    ...(typeof item.credential === 'string' ? { credential: item.credential } : {}),\n  }\n}\n\nfunction isIdentityKey(value: string): boolean {\n  try {\n    const decoded = fromBase64Url(value)\n    return decoded.length === 32 && toBase64Url(decoded) === value\n  } catch {\n    return false\n  }\n}\n\nfunction requireRecord(value: unknown, name: string): Record<string, unknown> {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new ServerApiError('INVALID_MESSAGE', `The Server returned invalid ${name} data.`, false)\n  }\n  return value as Record<string, unknown>\n}\n", "import { hostname } from 'node:os'\nimport s from '@deepseek-ai/schemastery'\nimport { z } from 'zod'\n\nexport interface Config {\n  enabled?: boolean\n  role?: 'host' | 'client' | 'both'\n  serverUrl?: string\n  deviceName?: string\n  forceRelay?: boolean\n  logLevel?: 'debug' | 'info' | 'warn' | 'error'\n  reconnect?: boolean | {\n    initialDelayMs?: number\n    maxDelayMs?: number\n    jitter?: number\n  }\n}\n\nexport interface ResolvedConfig {\n  enabled: boolean\n  role: 'host' | 'client' | 'both'\n  serverUrl?: string\n  deviceName: string\n  forceRelay: boolean\n  logLevel: 'debug' | 'info' | 'warn' | 'error'\n  reconnect: {\n    enabled: boolean\n    initialDelayMs: number\n    maxDelayMs: number\n    jitter: number\n  }\n}\n\n/** Cordis-facing configuration shape; runtime bounds are enforced by resolveConfig. */\nexport const Config: s<Config> = s.object({\n  enabled: s.boolean(),\n  role: s.union(['host', 'client', 'both'] as const),\n  serverUrl: s.string(),\n  deviceName: s.string(),\n  forceRelay: s.boolean(),\n  logLevel: s.union(['debug', 'info', 'warn', 'error'] as const),\n  reconnect: s.union([\n    s.boolean(),\n    s.object({\n      initialDelayMs: s.number(),\n      maxDelayMs: s.number(),\n      jitter: s.number(),\n    }),\n  ]),\n})\n\nconst reconnectSchema = z.union([\n  z.boolean(),\n  z.object({\n    initialDelayMs: z.number().int().min(100).max(60_000).optional(),\n    maxDelayMs: z.number().int().min(1_000).max(300_000).optional(),\n    jitter: z.number().min(0).max(1).optional(),\n  }).strict(),\n])\n\nconst configSchema = z.object({\n  enabled: z.boolean().optional(),\n  role: z.enum(['host', 'client', 'both']).optional(),\n  serverUrl: z.string().url().optional(),\n  deviceName: z.string().trim().min(1).max(80).optional(),\n  forceRelay: z.boolean().optional(),\n  logLevel: z.enum(['debug', 'info', 'warn', 'error']).optional(),\n  reconnect: reconnectSchema.optional(),\n}).strict()\n\nexport function resolveConfig(input: Config = {}, env: NodeJS.ProcessEnv = process.env): ResolvedConfig {\n  const parsed = configSchema.parse(input)\n  const reconnect = typeof parsed.reconnect === 'object' ? parsed.reconnect : {}\n  const configuredServerUrl = parsed.serverUrl ?? env.DSH_REMOTE_SERVER\n  const serverUrl = configuredServerUrl === undefined ? undefined : normalizeServerUrl(configuredServerUrl)\n  const initialDelayMs = reconnect.initialDelayMs ?? 1_000\n  const maxDelayMs = reconnect.maxDelayMs ?? 30_000\n  if (maxDelayMs < initialDelayMs) {\n    throw new TypeError('reconnect.maxDelayMs must be greater than or equal to reconnect.initialDelayMs')\n  }\n  return {\n    enabled: parsed.enabled ?? true,\n    role: parsed.role ?? 'host',\n    ...(serverUrl === undefined ? {} : { serverUrl }),\n    deviceName: parsed.deviceName ?? hostname(),\n    forceRelay: parsed.forceRelay ?? false,\n    logLevel: parsed.logLevel ?? 'info',\n    reconnect: {\n      enabled: parsed.reconnect !== false,\n      initialDelayMs,\n      maxDelayMs,\n      jitter: reconnect.jitter ?? 0.2,\n    },\n  }\n}\n\nexport function normalizeServerUrl(value: string): string {\n  const url = new URL(value)\n  const local = url.hostname === 'localhost' || url.hostname === '127.0.0.1' || url.hostname === '::1'\n  if (url.protocol !== 'https:' && !(local && url.protocol === 'http:')) {\n    throw new TypeError('serverUrl must use HTTPS (HTTP is allowed only for localhost)')\n  }\n  if (url.username !== '' || url.password !== '') {\n    throw new TypeError('serverUrl must not contain credentials')\n  }\n  if (url.search !== '' || url.hash !== '') {\n    throw new TypeError('serverUrl must not contain query parameters or fragments')\n  }\n  if (url.pathname !== '' && url.pathname !== '/') {\n    throw new TypeError('serverUrl must be an origin without a path')\n  }\n  return url.origin\n}\n", "/**\n * Version of the `ds-harness-remote` distribution.\n *\n * This is reported to the Server during device registration (`clientVersion`\n * in the Device Descriptor) and again in the WebSocket `hello` frame, so the\n * Server can surface the plugin version in its device list and diagnostics.\n * Keep it in sync with `packages/plugin/package.json` (`version`).\n * If they diverge, `npm scripts` checks in `scripts/verify-version-sync.mjs`\n * will fail fast during build/check/test.\n */\nexport const PLUGIN_VERSION = '0.3.8'\n", "import type { TypertGatewayLike } from './harness-api-bridge.js'\n\ntype RemoteInvoke = (request: Parameters<TypertGatewayLike['invoke']>[0]) => Promise<unknown>\n\n/** Keeps the native gateway identity stable while command execution follows the selected Host. */\nexport class TypertGatewaySwitch {\n  private readonly originalInvoke: TypertGatewayLike['invoke']\n  private readonly localInvoke: TypertGatewayLike['invoke']\n  private remoteInvoke?: RemoteInvoke\n  private installed = false\n\n  constructor(private readonly gateway: TypertGatewayLike) {\n    this.originalInvoke = gateway.invoke\n    this.localInvoke = this.originalInvoke.bind(gateway)\n  }\n\n  /** A facade that always invokes the original local gateway. */\n  local(): TypertGatewayLike {\n    return { invoke: this.localInvoke }\n  }\n\n  install(): void {\n    if (this.installed) return\n    this.gateway.invoke = request => request.namespace === 'commands' && request.method === 'execute'\n      ? (this.remoteInvoke ?? this.localInvoke)(request)\n      : this.localInvoke(request)\n    this.installed = true\n  }\n\n  selectRemote(invoke: RemoteInvoke): void {\n    if (!this.installed) throw new Error('The Typert gateway switch is not installed.')\n    this.remoteInvoke = invoke\n  }\n\n  selectLocal(): void {\n    this.remoteInvoke = undefined\n  }\n\n  restore(): void {\n    if (!this.installed) return\n    this.selectLocal()\n    this.gateway.invoke = this.originalInvoke\n    this.installed = false\n  }\n}\n", "import type { ApiProxy, RpcResult } from '@deepseek-ai/dsh-host-apiproxy/api'\nimport { RemoteClientCore } from '@dsh-remote/client-core'\nimport { AdaptiveTransport } from '@dsh-remote/webrtc'\nimport { ApiProxySwitch, type HarnessMode } from './api-proxy-switch.js'\nimport { ClientSecureTransport } from './client-secure-transport.js'\nimport type { ResolvedConfig } from './config.js'\nimport type { HostIdentity, IdentityStore, TrustedPeer } from './identity-store.js'\nimport type { TypertGatewayLike } from './harness-api-bridge.js'\nimport { uuidV7 } from './ids.js'\nimport type { SafeLogger } from './logging.js'\nimport { RemoteHarnessApiProxy } from './remote-api-proxy.js'\nimport { ClientServerApi, ServerApiError, type AuthorizedPeerDevice, type ServerHostDevice } from './server-api.js'\nimport { TypertGatewaySwitch } from './typert-gateway-switch.js'\n\ninterface ConnectedRemote {\n  client: RemoteClientCore\n  target: TrustedPeer\n}\n\nexport interface RemoteDirectoryEntry {\n  name: string\n  path: string\n  hidden: boolean\n}\n\nexport interface RemoteDirectoryListing {\n  path: string\n  home: string\n  crumbs: RemoteDirectoryEntry[]\n  entries: RemoteDirectoryEntry[]\n  truncated: boolean\n}\n\nexport interface RemoteWorkspaceView {\n  workspaceId: string\n  path: string\n  title: string\n}\n\nexport interface RemoteDeviceView {\n  deviceId: string\n  name: string\n  platform: string\n  membershipId: string\n  online: boolean\n  lastSeenAt?: number\n  clientVersion?: string\n  harnessVersion?: string\n}\n\nexport interface HostConnectionRpc {\n  handle(\n    channel: string,\n    handler: (endpoint: string, payload: unknown, signal: AbortSignal) => Promise<RpcResult<unknown>>,\n    options: { authority: 'loopback' | 'trusted-host' },\n  ): () => Promise<void>\n}\n\nexport interface HostConnectionHandle { rpc: HostConnectionRpc }\n\nexport interface HostAuthorizationControl {\n  hostStatus(): {\n    deviceId?: string\n    configured: boolean\n    online: boolean\n    reconnecting: boolean\n    lastActiveAt?: number\n    error?: string\n    account?: string\n    authorized: boolean\n    accountRequired: boolean\n  }\n  reconnectHost(): void\n  clearHostAuthorization(): Promise<void>\n  authorizeHostAsOwned(accessToken: string, account?: string): Promise<unknown>\n  authorizeHostWithAccount(email: string, password: string): Promise<unknown>\n  authorizeHostWithCode(code: string): Promise<unknown>\n}\n\nexport class ClientModeRuntime {\n  private identity?: HostIdentity\n  private connected?: ConnectedRemote\n  private readonly proxySwitch: ApiProxySwitch\n  private readonly gatewaySwitch: TypertGatewaySwitch\n  private closed = false\n\n  constructor(\n    private readonly config: ResolvedConfig,\n    private readonly identities: IdentityStore,\n    private readonly server: ClientServerApi,\n    apiProxy: ApiProxy,\n    typertGateway: TypertGatewayLike,\n    private readonly logger: SafeLogger,\n    private readonly host?: HostAuthorizationControl,\n  ) {\n    this.proxySwitch = new ApiProxySwitch(apiProxy)\n    this.gatewaySwitch = new TypertGatewaySwitch(typertGateway)\n  }\n\n  async start(): Promise<void> {\n    if (this.closed) throw new Error('client remote-mode runtime is closed')\n    this.identity = await this.identities.loadOrCreate(this.config.deviceName)\n    this.server.bindIdentity(this.identity)\n    this.proxySwitch.install()\n    this.gatewaySwitch.install()\n    this.logger.info('client remote-mode identity ready', {\n      deviceId: shortId(this.identity.deviceId),\n      fingerprint: this.identity.fingerprint,\n    })\n  }\n\n  registerControl(connection: HostConnectionHandle): () => Promise<void> {\n    return connection.rpc.handle('/remote', (endpoint, payload, signal) => this.handleControl(endpoint, payload, signal), {\n      authority: 'loopback',\n    })\n  }\n\n  status(): Record<string, unknown> {\n    return {\n      available: this.config.serverUrl !== undefined,\n      identityReady: this.identity !== undefined,\n      deviceId: this.identity?.deviceId,\n      serverUrl: this.config.serverUrl,\n      ...this.proxySwitch.status(),\n      connected: this.connected !== undefined,\n      transport: this.connected?.client.getStats().mode ?? 'Disconnected',\n      hostAuthorizationAvailable: this.host !== undefined,\n      ...(this.host === undefined ? {} : { host: this.host.hostStatus() }),\n    }\n  }\n\n  async devices(): Promise<RemoteDeviceView[]> {\n    this.requireIdentity()\n    const serverDevices = await this.server.listDevices()\n    const remoteDevices = serverDevices.filter(device => device.deviceId !== this.host?.hostStatus().deviceId)\n    return Promise.all(remoteDevices.map(async device => {\n      await this.authorizeHostPeer(device)\n      const presence = await this.server.presenceFor(device.deviceId).catch(() => ({ online: false }))\n      return { ...device, ...presence }\n    }))\n  }\n\n  async authorizeClientWithAccount(email: string, password: string): Promise<unknown> {\n    let authorization\n    try {\n      authorization = await this.server.authorizeWithAccount(this.requireIdentity(), email, password)\n    } catch (error) {\n      if (!(error instanceof ServerApiError) || error.code !== 'DEVICE_REVOKED') throw error\n      this.identity = await this.identities.reset(this.config.deviceName)\n      this.server.bindIdentity(this.identity)\n      authorization = await this.server.authorizeWithAccount(this.identity, email, password)\n    }\n    this.logger.info('Client account authorized')\n    return authorization\n  }\n\n  async startClientOAuthQrLogin(): Promise<unknown> {\n    return this.server.startOAuthQrLogin()\n  }\n\n  async pollClientOAuthQrLogin(qrId: string): Promise<unknown> {\n    try {\n      const result = await this.server.pollOAuthQrLogin(this.requireIdentity(), qrId)\n      if (result.status === 'complete') this.logger.info('Client account authorized with QR login')\n      return result\n    } catch (error) {\n      if (!(error instanceof ServerApiError) || error.code !== 'DEVICE_REVOKED') throw error\n      this.identity = await this.identities.reset(this.config.deviceName)\n      this.server.bindIdentity(this.identity)\n      this.logger.info('Rotated revoked Client identity before QR retry')\n      return { status: 'expired' }\n    }\n  }\n\n  async clearClientAuthorization(): Promise<void> {\n    const previous = this.connected\n    this.connected = undefined\n    this.proxySwitch.selectLocal()\n    this.gatewaySwitch.selectLocal()\n    await previous?.client.close().catch(() => undefined)\n    await this.server.revokeCurrentDevice()\n    this.identity = await this.identities.reset(this.config.deviceName)\n    this.server.bindIdentity(this.identity)\n  }\n\n  async setHostAuthorization(enabled: boolean): Promise<unknown> {\n    if (this.host === undefined) throw new ClientModeError('METHOD_NOT_ALLOWED', 'This plugin is not running as a Host.')\n    if (!enabled) {\n      await this.host.clearHostAuthorization()\n      return this.status()\n    }\n    const credentials = await this.server.authenticate(this.requireIdentity())\n    await this.host.authorizeHostAsOwned(credentials.accessToken, credentials.account)\n    return this.status()\n  }\n\n  async setMode(mode: HarnessMode, targetDeviceId?: string, signal?: AbortSignal): Promise<Record<string, unknown>> {\n    if (mode === 'local') {\n      this.proxySwitch.selectLocal()\n      this.gatewaySwitch.selectLocal()\n      const previous = this.connected\n      this.connected = undefined\n      await previous?.client.close().catch(() => undefined)\n      this.logger.info('Harness target switched', { mode: 'local' })\n      return this.status()\n    }\n    if (targetDeviceId === undefined || targetDeviceId.length === 0) {\n      throw new ClientModeError('INVALID_MESSAGE', 'A targetDeviceId is required for remote mode.')\n    }\n    const next = await this.connect(targetDeviceId, signal)\n    const previous = this.connected\n    this.connected = next\n    const remoteApi = new RemoteHarnessApiProxy(next.client).api\n    this.proxySwitch.selectRemote(remoteApi, { deviceId: next.target.deviceId, name: next.target.name })\n    this.gatewaySwitch.selectRemote(request => invokeRemoteCommand(next.client, request))\n    await previous?.client.close().catch(() => undefined)\n    this.logger.info('Harness target switched', { mode: 'remote', targetDeviceId: shortId(next.target.deviceId) })\n    return this.status()\n  }\n\n  async listRemoteDirectory(targetDeviceId: string, path?: string, signal?: AbortSignal): Promise<RemoteDirectoryListing> {\n    const remote = await this.ensureConnected(targetDeviceId, signal)\n    const api = new RemoteHarnessApiProxy(remote.client).api\n    const response = await api.host.listDirectory({\n      rpcId: `remote-directory-${Date.now()}` as never,\n      payload: path === undefined ? {} : { path },\n    }, signal ?? new AbortController().signal)\n    return unwrapNativeResult<RemoteDirectoryListing>(response)\n  }\n\n  async listRemoteWorkspaces(targetDeviceId: string, signal?: AbortSignal): Promise<RemoteWorkspaceView[]> {\n    const remote = await this.ensureConnected(targetDeviceId, signal)\n    const api = new RemoteHarnessApiProxy(remote.client).api\n    const response = await api.workspace.list({\n      rpcId: `remote-workspaces-${Date.now()}` as never,\n      payload: {},\n    })\n    const value = unwrapNativeResult<{ items: RemoteWorkspaceView[] }>(response)\n    return value.items\n  }\n\n  async openRemoteWorkspace(targetDeviceId: string, path: string, signal?: AbortSignal): Promise<Record<string, unknown>> {\n    if (path.trim() === '') throw new ClientModeError('INVALID_MESSAGE', 'A remote working directory is required.')\n    const remote = await this.ensureConnected(targetDeviceId, signal)\n    const api = new RemoteHarnessApiProxy(remote.client).api\n    const response = await api.workspace.create({\n      rpcId: `remote-workspace-${Date.now()}` as never,\n      payload: { path },\n    })\n    const workspace = unwrapNativeResult<{ workspace: unknown; created: boolean }>(response)\n    this.proxySwitch.selectRemote(api, { deviceId: remote.target.deviceId, name: remote.target.name })\n    this.gatewaySwitch.selectRemote(request => invokeRemoteCommand(remote.client, request))\n    this.logger.info('Remote workspace opened', { targetDeviceId: shortId(remote.target.deviceId) })\n    return { ...this.status(), workspace }\n  }\n\n  async close(): Promise<void> {\n    if (this.closed) return\n    this.closed = true\n    this.proxySwitch.selectLocal()\n    this.gatewaySwitch.selectLocal()\n    await this.connected?.client.close().catch(() => undefined)\n    this.connected = undefined\n    this.proxySwitch.restore()\n    this.gatewaySwitch.restore()\n  }\n\n  private async connect(targetDeviceId: string, signal?: AbortSignal): Promise<ConnectedRemote> {\n    signal?.throwIfAborted()\n    const identity = this.requireIdentity()\n    const serverDevice = (await this.server.listDevices()).find(device => device.deviceId === targetDeviceId)\n    if (serverDevice === undefined) {\n      throw new ClientModeError('MEMBERSHIP_REQUIRED', 'The selected Host is not authorized for this account.')\n    }\n    const target = await this.authorizeHostPeer(serverDevice)\n    const presence = await this.server.presenceFor(targetDeviceId)\n    if (!presence.online) throw new ClientModeError('HOST_OFFLINE', 'The selected Host is offline.', true)\n    const credentials = await this.server.authenticate(identity)\n    const transport = new AdaptiveTransport(websocketUrl(this.server.baseUrl), {\n      role: 'client',\n      deviceId: identity.deviceId,\n      accessToken: credentials.accessToken,\n      targetDeviceId,\n      forceRelay: this.config.forceRelay,\n      preferredTransports: this.config.forceRelay ? ['relay'] : ['p2p', 'turn', 'relay'],\n      fetchIceServers: async connectionId => this.server.turnCredentials(connectionId),\n    })\n    const client = new RemoteClientCore(new ClientSecureTransport(transport, identity, target), 60_000)\n    try {\n      await client.connect()\n      signal?.throwIfAborted()\n      client.onClose(() => {\n        if (this.connected?.client !== client) return\n        this.connected = undefined\n        this.proxySwitch.selectLocal()\n        this.gatewaySwitch.selectLocal()\n        void client.close().catch(() => undefined)\n        this.logger.warn('remote Harness transport closed; falling back to local mode', {\n          targetDeviceId: shortId(target.deviceId),\n        })\n      })\n      return { client, target }\n    } catch (error) {\n      await client.close().catch(() => undefined)\n      throw error\n    }\n  }\n\n  private async ensureConnected(targetDeviceId: string, signal?: AbortSignal): Promise<ConnectedRemote> {\n    if (this.connected?.target.deviceId === targetDeviceId) return this.connected\n    const next = await this.connect(targetDeviceId, signal)\n    const previous = this.connected\n    this.connected = next\n    await previous?.client.close().catch(() => undefined)\n    return next\n  }\n\n  async handleControl(endpoint: string, payload: unknown, signal: AbortSignal): Promise<RpcResult<unknown>> {\n    try {\n      if (endpoint === 'status') return ok(this.status())\n      if (endpoint === 'devices') return ok(await this.devices())\n      if (endpoint === 'client.account.login') {\n        const value = record(payload)\n        if (typeof value.email !== 'string' || typeof value.password !== 'string') {\n          throw new ClientModeError('INVALID_MESSAGE', 'Email and password are required.')\n        }\n        return ok(await this.authorizeClientWithAccount(value.email, value.password))\n      }\n      if (endpoint === 'client.account.qr.start') return ok(await this.startClientOAuthQrLogin())\n      if (endpoint === 'client.account.qr.poll') {\n        const value = record(payload)\n        if (typeof value.qrId !== 'string' || value.qrId.length < 20) {\n          throw new ClientModeError('INVALID_MESSAGE', 'A QR login session is required.')\n        }\n        return ok(await this.pollClientOAuthQrLogin(value.qrId))\n      }\n      if (endpoint === 'directory.list') {\n        const value = record(payload)\n        if (typeof value.targetDeviceId !== 'string') throw new ClientModeError('INVALID_MESSAGE', 'A Host is required.')\n        return ok(await this.listRemoteDirectory(\n          value.targetDeviceId,\n          typeof value.path === 'string' ? value.path : undefined,\n          signal,\n        ))\n      }\n      if (endpoint === 'workspaces.list') {\n        const value = record(payload)\n        if (typeof value.targetDeviceId !== 'string') throw new ClientModeError('INVALID_MESSAGE', 'A Host is required.')\n        return ok(await this.listRemoteWorkspaces(value.targetDeviceId, signal))\n      }\n      if (endpoint === 'workspace.open') {\n        const value = record(payload)\n        if (typeof value.targetDeviceId !== 'string' || typeof value.path !== 'string') {\n          throw new ClientModeError('INVALID_MESSAGE', 'A Host and working directory are required.')\n        }\n        return ok(await this.openRemoteWorkspace(value.targetDeviceId, value.path, signal))\n      }\n      if (endpoint === 'host.account.login') {\n        if (this.host === undefined) throw new ClientModeError('METHOD_NOT_ALLOWED', 'This plugin is not running as a Host.')\n        const value = record(payload)\n        if (typeof value.email !== 'string' || typeof value.password !== 'string') {\n          throw new ClientModeError('INVALID_MESSAGE', 'Email and password are required.')\n        }\n        return ok(await this.host.authorizeHostWithAccount(value.email, value.password))\n      }\n      if (endpoint === 'host.authorization.set') {\n        const value = record(payload)\n        if (typeof value.enabled !== 'boolean') {\n          throw new ClientModeError('INVALID_MESSAGE', 'Host authorization state is required.')\n        }\n        return ok(await this.setHostAuthorization(value.enabled))\n      }\n      if (endpoint === 'host.registration-code.submit') {\n        if (this.host === undefined) throw new ClientModeError('METHOD_NOT_ALLOWED', 'This plugin is not running as a Host.')\n        const value = record(payload)\n        if (typeof value.code !== 'string' || value.code.trim() === '') {\n          throw new ClientModeError('INVALID_MESSAGE', 'A Host registration code is required.')\n        }\n        return ok(await this.host.authorizeHostWithCode(value.code))\n      }\n      if (endpoint === 'mode.set') {\n        const value = record(payload)\n        if (value.mode !== 'local' && value.mode !== 'remote') throw new ClientModeError('INVALID_MESSAGE', 'Mode must be local or remote.')\n        return ok(await this.setMode(value.mode, typeof value.targetDeviceId === 'string' ? value.targetDeviceId : undefined, signal))\n      }\n      throw new ClientModeError('METHOD_NOT_FOUND', 'The remote-mode control method does not exist.')\n    } catch (error) {\n      return fail(error)\n    }\n  }\n\n  private requireIdentity(): HostIdentity {\n    if (this.identity === undefined) throw new ClientModeError('IDENTITY_INVALID', 'The client identity is not ready.')\n    return this.identity\n  }\n\n  private async authorizeHostPeer(serverDevice: ServerHostDevice): Promise<TrustedPeer> {\n    const descriptor = await this.server.deviceFor(serverDevice.deviceId)\n    assertAuthorizedHost(serverDevice, descriptor)\n    const existing = this.identities.trustedPeer(descriptor.deviceId)\n    if (existing !== undefined && existing.publicKey !== descriptor.identityKey) {\n      throw new ClientModeError('PEER_IDENTITY_MISMATCH', 'The authorized Host identity key changed unexpectedly.')\n    }\n    if (existing !== undefined\n      && existing.membershipId === descriptor.membershipId\n      && existing.name === descriptor.name\n      && existing.platform === descriptor.platform) {\n      return existing\n    }\n    return this.identities.trustPeer({\n      deviceId: descriptor.deviceId,\n      name: descriptor.name,\n      platform: descriptor.platform,\n      publicKey: descriptor.identityKey,\n      membershipId: descriptor.membershipId,\n    })\n  }\n}\n\nexport class ClientModeError extends Error {\n  constructor(readonly code: string, message: string, readonly retryable = false) { super(message) }\n}\n\nfunction assertAuthorizedHost(listed: ServerHostDevice, descriptor: AuthorizedPeerDevice): void {\n  if (descriptor.role !== 'host' || descriptor.deviceId !== listed.deviceId\n    || descriptor.membershipId !== listed.membershipId) {\n    throw new ClientModeError('PEER_IDENTITY_MISMATCH', 'Server Host details do not match the authorized device list.')\n  }\n}\n\nfunction websocketUrl(baseUrl: string): string {\n  const url = new URL(baseUrl)\n  url.protocol = url.protocol === 'https:' ? 'wss:' : 'ws:'\n  url.pathname = `${url.pathname.replace(/\\/$/, '')}/ws/v1/connect`\n  return url.toString()\n}\n\nfunction record(value: unknown): Record<string, unknown> {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new ClientModeError('INVALID_MESSAGE', 'The control request payload is invalid.')\n  }\n  return value as Record<string, unknown>\n}\n\nfunction ok(value: unknown): RpcResult<unknown> { return { ok: true, value } }\n\nasync function invokeRemoteCommand(\n  client: RemoteClientCore,\n  request: Parameters<TypertGatewayLike['invoke']>[0],\n): Promise<unknown> {\n  const rpcId = uuidV7()\n  const response = await client.rpc<{ rpcId: string; result: unknown }>('harness.api.call', {\n    method: `${request.namespace}.${request.method}`,\n    rpcId,\n    payload: request.args,\n  }, request.signal)\n  if (response.rpcId !== rpcId) {\n    throw new ClientModeError('INVALID_MESSAGE', 'The remote Host returned an invalid command response.')\n  }\n  return unwrapNativeResult(response)\n}\n\nfunction unwrapNativeResult<T>(response: { result: unknown }): T {\n  const result = response.result\n  if (typeof result !== 'object' || result === null || !('ok' in result)) {\n    throw new ClientModeError('INVALID_MESSAGE', 'The remote Host returned an invalid response.')\n  }\n  if (result.ok !== true || !('value' in result)) {\n    const message = 'error' in result && typeof result.error === 'object' && result.error !== null\n      && 'message' in result.error && typeof result.error.message === 'string'\n      ? result.error.message\n      : 'The remote Host rejected the request.'\n    throw new ClientModeError('REMOTE_API_ERROR', message)\n  }\n  return result.value as T\n}\n\nfunction fail(error: unknown): RpcResult<unknown> {\n  const source = error instanceof Error ? error : undefined\n  const remoteCode = source !== undefined && 'code' in source && typeof source.code === 'string'\n    ? source.code\n    : source instanceof ClientModeError ? source.code : undefined\n  const retryable = source !== undefined && 'retryable' in source && typeof source.retryable === 'boolean'\n    ? source.retryable\n    : source instanceof ClientModeError ? source.retryable : false\n  return {\n    ok: false,\n    error: {\n      code: 'internal',\n      message: source?.message ?? 'The remote-mode operation failed.',\n      details: remoteCode === undefined ? {} : { remoteCode, retryable },\n    },\n  }\n}\n\nfunction shortId(value: string): string { return value.length <= 12 ? value : `${value.slice(0, 8)}\u2026${value.slice(-4)}` }\n", "import { hostname } from 'node:os'\nimport type { RpcResult } from '@deepseek-ai/dsh-host-apiproxy/api'\nimport type { SettingsScope } from '@deepseek-ai/dsh-settings'\nimport { resolveConfig, type Config, type ResolvedConfig } from './config.js'\nimport {\n  ClientModeError,\n  type ClientModeRuntime,\n  type HostConnectionHandle,\n  type HostAuthorizationControl,\n} from './client-runtime.js'\nimport { IdentityStore, serverStorageDirectory } from './identity-store.js'\nimport { ClientServerApi, HostServerApi } from './server-api.js'\nimport { ServerCredentialStore } from './server-credentials.js'\n\nexport interface PluginSettingsView {\n  config: Config\n  deviceName: string\n  writable: boolean\n  applies: 'restart'\n  association?: PluginAssociation\n  associations: Partial<Record<'host' | 'client', PluginAssociation>>\n}\n\nexport interface PluginAssociation {\n  method: 'account' | 'host_registration_code' | 'owned_device'\n  account?: string\n}\n\n/** Loopback-only control plane shared by Local/Remote switching and plugin setup. */\nexport class PluginControlRuntime {\n  constructor(\n    private readonly config: ResolvedConfig,\n    private readonly identityDirectory: string,\n    private readonly settings: SettingsScope<Config> | undefined,\n    private readonly client: ClientModeRuntime | undefined,\n    private readonly host: HostAuthorizationControl | undefined,\n  ) {}\n\n  register(connection: HostConnectionHandle): () => Promise<void> {\n    return connection.rpc.handle('/remote', (endpoint, payload, signal) => this.handle(endpoint, payload, signal), {\n      authority: 'loopback',\n    })\n  }\n\n  private async handle(endpoint: string, payload: unknown, signal: AbortSignal): Promise<RpcResult<unknown>> {\n    try {\n      if (endpoint === 'settings.get') return ok(await this.settingsView())\n      if (endpoint === 'settings.configure') return ok(await this.configure(payload))\n      if (endpoint === 'settings.server.set') return ok(await this.setServer(payload))\n      if (endpoint === 'settings.role.set') return ok(await this.setRole(payload))\n      if (endpoint === 'settings.logout') return ok(await this.logout())\n      if (endpoint === 'host.reconnect') {\n        if (this.host === undefined) throw new ClientModeError('METHOD_NOT_ALLOWED', 'This plugin is not running as a Host.')\n        this.host.reconnectHost()\n        return ok(this.hostOnlyStatus())\n      }\n      if (this.client !== undefined) return this.client.handleControl(endpoint, payload, signal)\n\n      if (endpoint === 'status') return ok(this.hostOnlyStatus())\n      if (endpoint === 'devices') return ok([])\n      if (endpoint === 'host.account.login') {\n        if (this.host === undefined) throw new ClientModeError('METHOD_NOT_ALLOWED', 'This plugin is not running as a Host.')\n        const value = record(payload)\n        if (typeof value.email !== 'string' || typeof value.password !== 'string') {\n          throw new ClientModeError('INVALID_MESSAGE', 'Email and password are required.')\n        }\n        return ok(await this.host.authorizeHostWithAccount(value.email, value.password))\n      }\n      if (endpoint === 'host.registration-code.submit') {\n        if (this.host === undefined) throw new ClientModeError('METHOD_NOT_ALLOWED', 'This plugin is not running as a Host.')\n        const value = record(payload)\n        if (typeof value.code !== 'string' || value.code.trim() === '') {\n          throw new ClientModeError('INVALID_MESSAGE', 'A Host registration code is required.')\n        }\n        return ok(await this.host.authorizeHostWithCode(value.code))\n      }\n      if (endpoint === 'mode.set' && record(payload).mode === 'local') return ok(this.hostOnlyStatus())\n      throw new ClientModeError('METHOD_NOT_ALLOWED', 'Remote Client mode is disabled by the plugin role.')\n    } catch (error) {\n      return fail(error)\n    }\n  }\n\n  private async configure(payload: unknown): Promise<Record<string, unknown>> {\n    if (this.settings === undefined) {\n      throw new ClientModeError('SETTINGS_UNAVAILABLE', 'DSH user settings are unavailable in this profile.')\n    }\n    const value = record(payload)\n    if (value.role !== 'host' && value.role !== 'client') {\n      throw new ClientModeError('INVALID_MESSAGE', 'Role must be Host or Client.')\n    }\n    if (typeof value.serverUrl !== 'string') {\n      throw new ClientModeError('INVALID_MESSAGE', 'Server URL is required.')\n    }\n    const current = editableConfig(resolveConfig(this.settings.get()))\n    const next = resolveConfig({ ...current, role: value.role, serverUrl: value.serverUrl })\n\n    const identities = new IdentityStore({\n      directory: serverStorageDirectory(this.identityDirectory, next.serverUrl!, value.role),\n    })\n    const identity = await identities.loadOrCreate(hostname())\n    const api = value.role === 'host'\n      ? new HostServerApi(next.serverUrl!, new ServerCredentialStore(identities.directory))\n      : new ClientServerApi(next.serverUrl!, new ServerCredentialStore(identities.directory))\n    let authorization\n    if (value.role === 'host' && typeof value.registrationCode === 'string' && value.registrationCode.trim() !== '') {\n      authorization = await api.authorizeHostWithCode(identity, value.registrationCode)\n    } else {\n      if (typeof value.email !== 'string' || typeof value.password !== 'string') {\n        throw new ClientModeError('INVALID_MESSAGE', 'Email and password are required for account authorization.')\n      }\n      authorization = await api.authorizeWithAccount(identity, value.email, value.password)\n    }\n    await this.settings.replace(editableConfig(next))\n    return {\n      status: 'authorized',\n      role: value.role,\n      ...(authorization.account === undefined ? {} : { account: authorization.account }),\n      settings: await this.settingsView(),\n    }\n  }\n\n  private async setServer(payload: unknown): Promise<PluginSettingsView> {\n    if (this.settings === undefined) {\n      throw new ClientModeError('SETTINGS_UNAVAILABLE', 'DSH user settings are unavailable in this profile.')\n    }\n    const value = record(payload)\n    if (typeof value.serverUrl !== 'string') {\n      throw new ClientModeError('INVALID_MESSAGE', 'Server URL is required.')\n    }\n    const current = editableConfig(resolveConfig(this.settings.get()))\n    const next = resolveConfig({ ...current, serverUrl: value.serverUrl })\n    await this.settings.replace(editableConfig(next))\n    return this.settingsView()\n  }\n\n  private async setRole(payload: unknown): Promise<PluginSettingsView> {\n    if (this.settings === undefined) {\n      throw new ClientModeError('SETTINGS_UNAVAILABLE', 'DSH user settings are unavailable in this profile.')\n    }\n    const role = record(payload).role\n    if (role !== 'host' && role !== 'client') {\n      throw new ClientModeError('INVALID_MESSAGE', 'Role must be Host or Client.')\n    }\n    const current = editableConfig(resolveConfig(this.settings.get()))\n    const currentRole = current.role === 'client' ? 'client' : 'host'\n    if (role !== currentRole && current.serverUrl !== undefined\n      && await this.association(current.serverUrl, role) === undefined) {\n      await this.authorizeOwnedRole(current.serverUrl, currentRole, role)\n    }\n    await this.settings.replace({ ...current, role })\n    return this.settingsView()\n  }\n\n  private async authorizeOwnedRole(\n    serverUrl: string,\n    sourceRole: 'host' | 'client',\n    targetRole: 'host' | 'client',\n  ): Promise<void> {\n    const sourceDirectory = serverStorageDirectory(this.identityDirectory, serverUrl, sourceRole)\n    const sourceIdentity = await new IdentityStore({ directory: sourceDirectory }).loadOrCreate(hostname())\n    const sourceStore = new ServerCredentialStore(sourceDirectory)\n    if (await sourceStore.load(serverUrl, sourceIdentity.deviceId) === undefined) return\n    const sourceApi = sourceRole === 'host'\n      ? new HostServerApi(serverUrl, sourceStore)\n      : new ClientServerApi(serverUrl, sourceStore)\n    const sourceCredentials = await sourceApi.authenticate(sourceIdentity)\n\n    const targetDirectory = serverStorageDirectory(this.identityDirectory, serverUrl, targetRole)\n    const targetIdentity = await new IdentityStore({ directory: targetDirectory }).loadOrCreate(hostname())\n    const targetApi = targetRole === 'host'\n      ? new HostServerApi(serverUrl, new ServerCredentialStore(targetDirectory))\n      : new ClientServerApi(serverUrl, new ServerCredentialStore(targetDirectory))\n    await targetApi.authorizeOwnedRole(targetIdentity, sourceCredentials.accessToken, sourceCredentials.account)\n  }\n\n  private async logout(): Promise<PluginSettingsView> {\n    if (this.settings === undefined) {\n      throw new ClientModeError('SETTINGS_UNAVAILABLE', 'DSH user settings are unavailable in this profile.')\n    }\n    const config = resolveConfig(this.settings.get())\n    if (config.serverUrl !== undefined) {\n      await Promise.all([\n        this.client?.clearClientAuthorization(),\n        this.host?.clearHostAuthorization(),\n      ])\n      await Promise.all((['host', 'client'] as const).map(async role => {\n        const directory = serverStorageDirectory(this.identityDirectory, config.serverUrl!, role)\n        await new ServerCredentialStore(directory).clear()\n      }))\n    }\n    return this.settingsView()\n  }\n\n  private async settingsView(): Promise<PluginSettingsView> {\n    const config = this.settings === undefined ? editableConfig(this.config) : editableConfig(resolveConfig(this.settings.get()))\n    const associations = await this.associations(config)\n    const role = config.role === 'client' ? 'client' : 'host'\n    const association = associations[role]\n    return {\n      config,\n      deviceName: hostname(),\n      writable: this.settings !== undefined,\n      applies: 'restart',\n      associations,\n      ...(association === undefined ? {} : { association }),\n    }\n  }\n\n  private async associations(config: Config): Promise<PluginSettingsView['associations']> {\n    if (config.serverUrl === undefined) return {}\n    const [host, client] = await Promise.all([\n      this.association(config.serverUrl, 'host'),\n      this.association(config.serverUrl, 'client'),\n    ])\n    return {\n      ...(host === undefined ? {} : { host }),\n      ...(client === undefined ? {} : { client }),\n    }\n  }\n\n  private async association(serverUrl: string, role: 'host' | 'client'): Promise<PluginAssociation | undefined> {\n    const identities = new IdentityStore({\n      directory: serverStorageDirectory(this.identityDirectory, serverUrl, role),\n    })\n    const identity = await identities.loadOrCreate(hostname())\n    const credentials = await new ServerCredentialStore(identities.directory).load(serverUrl, identity.deviceId)\n    if (credentials === undefined) return undefined\n    return {\n      method: credentials.authorizationMethod,\n      ...(credentials.account === undefined ? {} : { account: credentials.account }),\n    }\n  }\n\n  private hostOnlyStatus(): Record<string, unknown> {\n    return {\n      mode: 'local',\n      available: false,\n      hostAuthorizationAvailable: this.host !== undefined,\n      ...(this.host === undefined ? {} : { host: this.host.hostStatus() }),\n    }\n  }\n}\n\nfunction editableConfig(config: ResolvedConfig): Config {\n  return {\n    enabled: config.enabled,\n    role: config.role,\n    ...(config.serverUrl === undefined ? {} : { serverUrl: config.serverUrl }),\n    forceRelay: config.forceRelay,\n    logLevel: config.logLevel,\n    reconnect: config.reconnect.enabled\n      ? {\n          initialDelayMs: config.reconnect.initialDelayMs,\n          maxDelayMs: config.reconnect.maxDelayMs,\n          jitter: config.reconnect.jitter,\n        }\n      : false,\n  }\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === 'object' && value !== null && !Array.isArray(value)\n}\n\nfunction record(value: unknown): Record<string, unknown> {\n  if (!isRecord(value)) throw new ClientModeError('INVALID_MESSAGE', 'The control request payload is invalid.')\n  return value\n}\n\nfunction ok(value: unknown): RpcResult<unknown> { return { ok: true, value } }\n\nfunction fail(error: unknown): RpcResult<unknown> {\n  const source = error instanceof Error ? error : undefined\n  const remoteCode = source !== undefined && 'code' in source && typeof source.code === 'string'\n    ? source.code\n    : source instanceof ClientModeError ? source.code : undefined\n  return {\n    ok: false,\n    error: {\n      code: 'internal',\n      message: source?.message ?? 'The plugin control operation failed.',\n      details: remoteCode === undefined ? {} : { remoteCode },\n    },\n  }\n}\n", "import { createHash } from 'node:crypto'\nimport { chmod, mkdir, readFile, rename, rm, stat, writeFile } from 'node:fs/promises'\nimport { homedir } from 'node:os'\nimport { dirname, join } from 'node:path'\nimport { fromBase64Url, generateKeyPair } from '@dsh-remote/crypto'\nimport { z } from 'zod'\nimport { uuidV7 } from './ids.js'\n\nconst identitySchema = z.object({\n  schemaVersion: z.literal(1),\n  deviceId: z.string().uuid(),\n  name: z.string().min(1).max(80),\n  publicKey: z.string().min(1),\n}).strict()\n\nconst trustedPeerSchema = z.object({\n  deviceId: z.string().min(1),\n  name: z.string().min(1).max(80),\n  platform: z.string().min(1).max(40),\n  publicKey: z.string().min(1),\n  fingerprint: z.string().min(1),\n  trustedAt: z.number().int().nonnegative(),\n  membershipId: z.string().min(1).optional(),\n}).strict()\n\nconst trustedPeersSchema = z.object({\n  schemaVersion: z.literal(1),\n  peers: z.array(trustedPeerSchema),\n}).strict()\n\nexport interface HostIdentity {\n  schemaVersion: 1\n  deviceId: string\n  name: string\n  publicKey: string\n  privateKey: string\n  fingerprint: string\n}\n\nexport interface TrustedPeer {\n  deviceId: string\n  name: string\n  platform: string\n  publicKey: string\n  fingerprint: string\n  trustedAt: number\n  membershipId?: string\n}\n\nexport interface IdentityStoreOptions {\n  directory?: string\n  env?: NodeJS.ProcessEnv\n  homeDirectory?: string\n}\n\nexport type RemoteDeviceRole = 'host' | 'client'\n\nexport class IdentityInvalidError extends Error {\n  readonly code = 'IDENTITY_INVALID'\n}\n\nexport class IdentityStore {\n  readonly directory: string\n  private identity?: HostIdentity\n  private peers = new Map<string, TrustedPeer>()\n\n  constructor(options: IdentityStoreOptions = {}) {\n    const env = options.env ?? process.env\n    const dshHome = env.DSH_HOME || join(options.homeDirectory ?? homedir(), '.dsh')\n    this.directory = options.directory ?? join(dshHome, 'remote')\n  }\n\n  async loadOrCreate(deviceName: string): Promise<HostIdentity> {\n    await mkdir(this.directory, { recursive: true, mode: 0o700 })\n    await chmod(this.directory, 0o700)\n    const devicePath = join(this.directory, 'device.json')\n    const keyPath = join(this.directory, 'device.key')\n    const [hasDevice, hasKey] = await Promise.all([exists(devicePath), exists(keyPath)])\n    if (hasDevice !== hasKey) {\n      throw new IdentityInvalidError('device identity is incomplete; repair it explicitly before reconnecting')\n    }\n\n    if (!hasDevice) {\n      const keys = generateKeyPair()\n      const record = { schemaVersion: 1 as const, deviceId: uuidV7(), name: deviceName, publicKey: keys.publicKey }\n      await atomicJsonWrite(devicePath, record, 0o600)\n      await atomicTextWrite(keyPath, `${keys.privateKey}\\n`, 0o600)\n    }\n\n    await assertPrivateMode(keyPath)\n    try {\n      let record = identitySchema.parse(JSON.parse(await readFile(devicePath, 'utf8')))\n      const privateKey = (await readFile(keyPath, 'utf8')).trim()\n      const regenerated = generateKeyPair(fromBase64Url(privateKey))\n      if (regenerated.publicKey !== record.publicKey) {\n        throw new IdentityInvalidError('device public and private keys do not match')\n      }\n      if (record.name !== deviceName) {\n        record = { ...record, name: deviceName }\n        await atomicJsonWrite(devicePath, record, 0o600)\n      }\n      this.identity = { ...record, privateKey, fingerprint: fingerprint(record.publicKey) }\n      await this.loadPeers()\n      return this.identity\n    } catch (error: unknown) {\n      if (error instanceof IdentityInvalidError) throw error\n      throw new IdentityInvalidError(`device identity is invalid: ${safeErrorMessage(error)}`)\n    }\n  }\n\n  current(): HostIdentity {\n    if (this.identity === undefined) throw new Error('identity store has not been loaded')\n    return this.identity\n  }\n\n  async reset(deviceName: string): Promise<HostIdentity> {\n    await rm(this.directory, { recursive: true, force: true })\n    this.identity = undefined\n    this.peers.clear()\n    return this.loadOrCreate(deviceName)\n  }\n\n  listTrustedPeers(): TrustedPeer[] {\n    return [...this.peers.values()].map(peer => ({ ...peer }))\n  }\n\n  trustedPeer(deviceId: string): TrustedPeer | undefined {\n    const peer = this.peers.get(deviceId)\n    return peer === undefined ? undefined : { ...peer }\n  }\n\n  isTrusted(deviceId: string, publicKey: string): boolean {\n    return this.peers.get(deviceId)?.publicKey === publicKey\n  }\n\n  async trustPeer(input: Omit<TrustedPeer, 'fingerprint' | 'trustedAt'>): Promise<TrustedPeer> {\n    this.current()\n    const peer: TrustedPeer = {\n      ...input,\n      fingerprint: fingerprint(input.publicKey),\n      trustedAt: Date.now(),\n    }\n    this.peers.set(peer.deviceId, peer)\n    await this.savePeers()\n    return { ...peer }\n  }\n\n  async revokePeer(deviceId: string): Promise<boolean> {\n    const removed = this.peers.delete(deviceId)\n    if (removed) await this.savePeers()\n    return removed\n  }\n\n  private async loadPeers(): Promise<void> {\n    const path = join(this.directory, 'trusted-peers.json')\n    if (!(await exists(path))) {\n      await atomicJsonWrite(path, { schemaVersion: 1, peers: [] }, 0o600)\n    }\n    const parsed = trustedPeersSchema.parse(JSON.parse(await readFile(path, 'utf8')))\n    const peers = new Map<string, TrustedPeer>()\n    for (const peer of parsed.peers) {\n      if (peer.fingerprint !== fingerprint(peer.publicKey)) {\n        throw new IdentityInvalidError(`trusted peer ${peer.deviceId} has an invalid fingerprint`)\n      }\n      if (peers.has(peer.deviceId)) throw new IdentityInvalidError(`trusted peer ${peer.deviceId} is duplicated`)\n      peers.set(peer.deviceId, peer)\n    }\n    this.peers = peers\n  }\n\n  private async savePeers(): Promise<void> {\n    await atomicJsonWrite(join(this.directory, 'trusted-peers.json'), {\n      schemaVersion: 1,\n      peers: [...this.peers.values()],\n    }, 0o600)\n  }\n}\n\nexport function serverStorageDirectory(root: string, serverUrl: string, role: RemoteDeviceRole): string {\n  const origin = new URL(serverUrl).origin\n  const scope = createHash('sha256').update(origin).digest('hex').slice(0, 24)\n  return join(root, 'servers', scope, role)\n}\n\nexport function fingerprint(publicKey: string): string {\n  const compact = createHash('sha256').update(fromBase64Url(publicKey)).digest('hex').slice(0, 12).toUpperCase()\n  return compact.match(/.{1,4}/g)!.join(' ')\n}\n\nasync function assertPrivateMode(path: string): Promise<void> {\n  if (process.platform === 'win32') return\n  const mode = (await stat(path)).mode & 0o777\n  if ((mode & 0o077) !== 0) {\n    throw new IdentityInvalidError(`private key permissions must be 0600, got ${mode.toString(8).padStart(3, '0')}`)\n  }\n}\n\nasync function atomicJsonWrite(path: string, value: unknown, mode: number): Promise<void> {\n  await atomicTextWrite(path, `${JSON.stringify(value, null, 2)}\\n`, mode)\n}\n\nasync function atomicTextWrite(path: string, value: string, mode: number): Promise<void> {\n  await mkdir(dirname(path), { recursive: true, mode: 0o700 })\n  const temporary = `${path}.${process.pid}.${uuidV7()}.tmp`\n  await writeFile(temporary, value, { encoding: 'utf8', mode, flag: 'wx' })\n  await chmod(temporary, mode)\n  await rename(temporary, path)\n  await chmod(path, mode)\n}\n\nasync function exists(path: string): Promise<boolean> {\n  try {\n    await stat(path)\n    return true\n  } catch (error: unknown) {\n    if (isNodeError(error) && error.code === 'ENOENT') return false\n    throw error\n  }\n}\n\nfunction isNodeError(error: unknown): error is NodeJS.ErrnoException {\n  return error instanceof Error && 'code' in error\n}\n\nfunction safeErrorMessage(error: unknown): string {\n  return error instanceof Error ? error.message : 'invalid identity data'\n}\n", "import { chmod, mkdir, readFile, rename, rm, stat, writeFile } from 'node:fs/promises'\nimport { dirname, join } from 'node:path'\nimport { z } from 'zod'\nimport { uuidV7 } from './ids.js'\n\nconst credentialSchema = z.object({\n  schemaVersion: z.literal(1),\n  serverUrl: z.string().url(),\n  deviceId: z.string().min(1),\n  authorizationMethod: z.enum(['account', 'host_registration_code', 'owned_device']),\n  account: z.string().min(1).max(254).optional(),\n  accessToken: z.string().min(16),\n  accessTokenExpiresAt: z.number().int().positive(),\n  refreshToken: z.string().min(16),\n  refreshTokenExpiresAt: z.number().int().positive(),\n}).strict()\n\nexport interface ServerCredentials extends z.infer<typeof credentialSchema> {}\n\nexport class ServerCredentialStore {\n  private readonly path: string\n\n  constructor(directory: string) { this.path = join(directory, 'server-credentials.json') }\n\n  async load(serverUrl: string, deviceId: string): Promise<ServerCredentials | undefined> {\n    if (!(await exists(this.path))) return undefined\n    await assertPrivateMode(this.path)\n    let parsed: ServerCredentials\n    try {\n      parsed = credentialSchema.parse(JSON.parse(await readFile(this.path, 'utf8')))\n    } catch (error) {\n      throw new ServerCredentialsInvalidError(`server credentials are invalid: ${safeMessage(error)}`)\n    }\n    return parsed.serverUrl === serverUrl && parsed.deviceId === deviceId ? parsed : undefined\n  }\n\n  async save(credentials: Omit<ServerCredentials, 'schemaVersion'>): Promise<ServerCredentials> {\n    const record = credentialSchema.parse({ schemaVersion: 1, ...credentials })\n    await atomicWrite(this.path, `${JSON.stringify(record, null, 2)}\\n`)\n    return record\n  }\n\n  async clear(): Promise<void> {\n    await rm(this.path, { force: true })\n  }\n}\n\nexport class ServerCredentialsInvalidError extends Error {\n  readonly code = 'SERVER_CREDENTIALS_INVALID'\n}\n\nasync function atomicWrite(path: string, contents: string): Promise<void> {\n  await mkdir(dirname(path), { recursive: true, mode: 0o700 })\n  const temporary = `${path}.${process.pid}.${uuidV7()}.tmp`\n  await writeFile(temporary, contents, { encoding: 'utf8', mode: 0o600, flag: 'wx' })\n  await chmod(temporary, 0o600)\n  await rename(temporary, path)\n  await chmod(path, 0o600)\n}\n\nasync function assertPrivateMode(path: string): Promise<void> {\n  if (process.platform === 'win32') return\n  const mode = (await stat(path)).mode & 0o777\n  if ((mode & 0o077) !== 0) throw new ServerCredentialsInvalidError('server credentials permissions must be 0600')\n}\n\nasync function exists(path: string): Promise<boolean> {\n  try {\n    await stat(path)\n    return true\n  } catch (error: unknown) {\n    if (error instanceof Error && 'code' in error && error.code === 'ENOENT') return false\n    throw error\n  }\n}\n\nfunction safeMessage(error: unknown): string { return error instanceof Error ? error.message : 'invalid credential data' }\n", "export type LogLevel = 'debug' | 'info' | 'warn' | 'error'\n\nexport interface LogSink {\n  debug(message: string): void\n  info(message: string): void\n  warn(message: string): void\n  error(message: string): void\n}\n\nconst levels: readonly LogLevel[] = ['debug', 'info', 'warn', 'error']\nconst secretKey = /authorization|cookie|token|secret|private|shared|ciphertext|payload|prompt|source|workspace|output|registrationCode|deviceCode/i\n\nexport class SafeLogger {\n  constructor(private readonly sink: LogSink, private readonly threshold: LogLevel = 'info') {}\n\n  debug(message: string, fields?: Record<string, unknown>): void { this.write('debug', message, fields) }\n  info(message: string, fields?: Record<string, unknown>): void { this.write('info', message, fields) }\n  warn(message: string, fields?: Record<string, unknown>): void { this.write('warn', message, fields) }\n  error(message: string, fields?: Record<string, unknown>): void { this.write('error', message, fields) }\n\n  private write(level: LogLevel, message: string, fields?: Record<string, unknown>): void {\n    if (levels.indexOf(level) < levels.indexOf(this.threshold)) return\n    const safeFields = fields === undefined ? '' : ` ${JSON.stringify(redact(fields))}`\n    this.sink[level](`[dsh-remote] ${message}${safeFields}`)\n  }\n}\n\nfunction redact(value: unknown, key = ''): unknown {\n  if (secretKey.test(key)) return '[REDACTED]'\n  if (Array.isArray(value)) return value.map(item => redact(item))\n  if (typeof value !== 'object' || value === null) return value\n  return Object.fromEntries(Object.entries(value).map(([childKey, child]) => [childKey, redact(child, childKey)]))\n}\n", "import {\n  MAX_SECURE_MESSAGE_BYTES,\n  createRpcError,\n  encodeMessage,\n  type RemoteMessage,\n} from '@dsh-remote/protocol'\nimport type { IdentityStore } from './identity-store.js'\nimport type { SafeLogger } from './logging.js'\nimport type { RpcRouter } from './rpc-router.js'\nimport type { AuthenticatedPeerChannel } from './types.js'\n\ninterface ActiveConnection {\n  channel: AuthenticatedPeerChannel\n  router: RpcRouter\n  unsubscribe: () => void\n}\n\nexport interface PeerConnectionContext {\n  connectionId: string\n  peerDeviceId: string\n}\n\nexport type RpcRouterFactory = (\n  context: PeerConnectionContext,\n  send: (message: RemoteMessage) => Promise<void>,\n) => RpcRouter\n\nexport class ConnectionController {\n  private readonly active = new Map<string, ActiveConnection>()\n  private acceptQueue: Promise<void> = Promise.resolve()\n\n  constructor(\n    private readonly identities: IdentityStore,\n    private readonly createRouter: RpcRouterFactory,\n    private readonly logger?: SafeLogger,\n  ) {}\n\n  accept(channel: AuthenticatedPeerChannel): Promise<void> {\n    const operation = this.acceptQueue.then(() => this.acceptOne(channel))\n    this.acceptQueue = operation.catch(() => undefined)\n    return operation\n  }\n\n  private async acceptOne(channel: AuthenticatedPeerChannel): Promise<void> {\n    if (channel.security?.protocol !== 'Noise_IK_25519_ChaChaPoly_SHA256'\n      || channel.security.connectionId === ''\n      || channel.security.membershipId === '') {\n      await channel.close('SECURE_CHANNEL_FAILED')\n      throw new ConnectionRejectedError('SECURE_CHANNEL_FAILED', 'The channel is missing its authenticated Noise or membership context.')\n    }\n    if (!this.identities.isTrusted(channel.peerDeviceId, channel.peerIdentityKey)) {\n      await channel.close('PEER_IDENTITY_MISMATCH')\n      throw new ConnectionRejectedError('PEER_IDENTITY_MISMATCH', 'The peer identity does not match local trust.')\n    }\n    const connectionId = channel.security.connectionId\n    const connectionConflict = this.active.get(connectionId)\n    if (connectionConflict !== undefined && connectionConflict.channel.peerDeviceId !== channel.peerDeviceId) {\n      await channel.close('SECURE_CHANNEL_FAILED')\n      throw new ConnectionRejectedError('SECURE_CHANNEL_FAILED', 'The connection id is already bound to another peer.')\n    }\n\n    const replaced = [...this.active.values()].filter(connection => (\n      connection.channel.peerDeviceId === channel.peerDeviceId\n      || connection.channel.security.connectionId === connectionId\n    ))\n    if (replaced.length > 0) {\n      this.logger?.warn('replacing active peer connection', {\n        peerDeviceId: shortId(channel.peerDeviceId),\n        replacedCount: replaced.length,\n        replacedPeerDeviceIds: replaced.map(connection => shortId(connection.channel.peerDeviceId)),\n      })\n    }\n    await Promise.all(replaced.map(connection => this.disconnect(connection, 'CONNECTION_REPLACED')))\n\n    const router = this.createRouter(\n      { connectionId, peerDeviceId: channel.peerDeviceId },\n      message => this.sendTo(connectionId, channel, message),\n    )\n    const connection: ActiveConnection = {\n      channel,\n      router,\n      unsubscribe: () => undefined,\n    }\n    this.active.set(connectionId, connection)\n    try {\n      connection.unsubscribe = channel.onMessage(message => { void this.handle(connection, message) })\n    } catch (error) {\n      await this.disconnect(connection)\n      throw error\n    }\n    this.logger?.info('peer connection accepted', {\n      peerDeviceId: shortId(channel.peerDeviceId),\n      connectionId: shortId(connectionId),\n      mode: channel.mode,\n    })\n  }\n\n  isOnline(): boolean { return this.active.size > 0 }\n\n  connectionCount(): number { return this.active.size }\n\n  peerDeviceIds(): string[] {\n    return [...new Set([...this.active.values()].map(connection => connection.channel.peerDeviceId))]\n  }\n\n  peerDeviceId(): string | undefined {\n    const peers = this.peerDeviceIds()\n    return peers.length === 1 ? peers[0] : undefined\n  }\n\n  connectionMode(): 'LAN' | 'P2P' | 'TURN' | 'Relay' | 'Disconnected' {\n    const connection = this.active.values().next().value as ActiveConnection | undefined\n    return connection?.channel.mode ?? (connection === undefined ? 'Disconnected' : 'Relay')\n  }\n\n  async send(message: RemoteMessage): Promise<void> {\n    await Promise.all([...this.active.values()].map(connection => this.sendConnection(connection, message)))\n  }\n\n  async revoke(deviceId: string): Promise<void> {\n    const revoked = [...this.active.values()].filter(connection => connection.channel.peerDeviceId === deviceId)\n    await Promise.all(revoked.map(connection => this.disconnect(connection, 'DEVICE_REVOKED')))\n  }\n\n  async closeConnection(connectionId: string, code?: string): Promise<boolean> {\n    const connection = this.active.get(connectionId)\n    if (connection === undefined) return false\n    await this.disconnect(connection, code)\n    return true\n  }\n\n  async close(): Promise<void> {\n    await this.acceptQueue\n    await Promise.all([...this.active.values()].map(connection => this.disconnect(connection)))\n  }\n\n  private async handle(connection: ActiveConnection, message: RemoteMessage): Promise<void> {\n    if (!this.isActive(connection)) return\n    try {\n      const response = await connection.router.handle(message)\n      if (!this.isActive(connection)) return\n      const outbound = encodeMessage(response).byteLength <= MAX_SECURE_MESSAGE_BYTES\n        ? response\n        : createRpcError(\n            message.id,\n            'RESPONSE_TOO_LARGE',\n            'The Host response is too large for the secure Remote channel. Request a smaller page.',\n            { maxBytes: MAX_SECURE_MESSAGE_BYTES },\n            true,\n          )\n      await connection.channel.send(outbound)\n    } catch (error) {\n      this.logger?.warn('peer message handling failed; disconnecting', {\n        peerDeviceId: shortId(connection.channel.peerDeviceId),\n        reason: diagnosticReason(error),\n      })\n      await this.disconnect(connection)\n    }\n  }\n\n  private async sendTo(connectionId: string, channel: AuthenticatedPeerChannel, message: RemoteMessage): Promise<void> {\n    const connection = this.active.get(connectionId)\n    if (connection === undefined || connection.channel !== channel) return\n    await this.sendConnection(connection, message)\n  }\n\n  private async sendConnection(connection: ActiveConnection, message: RemoteMessage): Promise<void> {\n    if (!this.isActive(connection)) return\n    try {\n      await connection.channel.send(message)\n    } catch (error) {\n      this.logger?.warn('peer send failed; disconnecting', {\n        peerDeviceId: shortId(connection.channel.peerDeviceId),\n        messageType: message.type,\n        reason: diagnosticReason(error),\n      })\n      await this.disconnect(connection)\n    }\n  }\n\n  private async disconnect(connection: ActiveConnection, code?: string): Promise<void> {\n    if (!this.isActive(connection)) return\n    this.active.delete(connection.channel.security.connectionId)\n    connection.unsubscribe()\n    try {\n      await connection.router.closePeerStreams()\n    } finally {\n      await connection.channel.close(code)\n    }\n    this.logger?.info('peer connection disconnected', {\n      peerDeviceId: shortId(connection.channel.peerDeviceId),\n      connectionId: shortId(connection.channel.security.connectionId),\n      code: code ?? 'closed',\n    })\n  }\n\n  private isActive(connection: ActiveConnection): boolean {\n    return this.active.get(connection.channel.security.connectionId) === connection\n  }\n}\n\nexport class ConnectionRejectedError extends Error {\n  constructor(readonly code: string, message: string) { super(message) }\n}\n\nfunction diagnosticReason(error: unknown): string {\n  const message = error instanceof Error ? error.message : String(error)\n  return message.replace(/[\\r\\n]+/g, ' ').slice(0, 160) || 'Unknown peer connection failure.'\n}\n\nfunction shortId(value: string): string { return value.length <= 12 ? value : `${value.slice(0, 8)}\u2026${value.slice(-4)}` }\n", "import {\n  createRpcError,\n  createRpcResponse,\n  type RemoteMessage,\n  type RpcErrorPayload,\n  type RpcRequestPayload,\n} from '@dsh-remote/protocol'\nimport { z } from 'zod'\nimport type { HarnessApiBridge } from './harness-api-bridge.js'\nimport type { SafeLogger } from './logging.js'\n\nconst wireRequestSchema = z.object({ method: z.string().min(1), params: z.unknown() }).strict()\nconst apiMethods = new Set([\n  'harness.api.call',\n  'harness.api.respond',\n  'harness.api.stream.open',\n  'harness.api.stream.close',\n])\n\nexport const HOST_CAPABILITIES = ['harness.api.v1'] as const\n\nexport class RpcRouter {\n  private active = 0\n\n  constructor(\n    private readonly harnessApi: HarnessApiBridge,\n    private readonly maxPending = 128,\n    private readonly logger?: SafeLogger,\n  ) {}\n\n  closePeerStreams(): Promise<void> { return this.harnessApi.closeAll() }\n\n  async handle(message: RemoteMessage): Promise<RemoteMessage> {\n    if (message.type !== 'rpc.request') {\n      return createRpcError(message.id, 'INVALID_MESSAGE', 'Only RPC requests are accepted on the Host business channel.')\n    }\n    const parsedPayload = wireRequestSchema.safeParse(message.payload)\n    if (!parsedPayload.success) return createRpcError(message.id, 'INVALID_MESSAGE', 'The RPC request payload is invalid.')\n    if (!apiMethods.has(parsedPayload.data.method)) {\n      return createRpcError(message.id, 'METHOD_NOT_FOUND', 'The requested method does not exist.')\n    }\n    const request = message as RemoteMessage<RpcRequestPayload>\n    if (this.active >= this.maxPending) {\n      return createRpcError(request.id, 'RATE_LIMITED', 'Too many Host requests are already pending.', undefined, true)\n    }\n    this.active += 1\n    const startedAt = performance.now()\n    try {\n      const result = await this.invoke(request.payload.method, request.payload.params)\n      this.logger?.debug('host rpc ok', {\n        method: request.payload.method,\n        durationMs: Math.round(performance.now() - startedAt),\n      })\n      return createRpcResponse(request.id, result)\n    } catch (error: unknown) {\n      const response = errorResponse(request.id, error)\n      this.logger?.warn('host rpc failed', {\n        method: request.payload.method,\n        durationMs: Math.round(performance.now() - startedAt),\n        code: response.payload.code,\n        retryable: response.payload.retryable,\n        reason: diagnosticReason(error),\n      })\n      return response\n    } finally {\n      this.active -= 1\n    }\n  }\n\n  private invoke(method: string, params: unknown): Promise<unknown> | unknown {\n    switch (method) {\n      case 'harness.api.call': return this.harnessApi.call(params)\n      case 'harness.api.respond': return this.harnessApi.respond(params)\n      case 'harness.api.stream.open': return this.harnessApi.openStream(params)\n      case 'harness.api.stream.close': return this.harnessApi.closeStream(params)\n      default: throw new RpcError('METHOD_NOT_FOUND', 'The requested method does not exist.')\n    }\n  }\n}\n\nexport class RpcError extends Error {\n  constructor(readonly code: string, message: string, readonly details?: unknown, readonly retryable = false) { super(message) }\n}\n\nfunction errorResponse(requestId: string, error: unknown): RemoteMessage<RpcErrorPayload> {\n  if (error instanceof RpcError) return createRpcError(requestId, error.code, error.message, error.details, error.retryable)\n  if (error instanceof z.ZodError) return createRpcError(requestId, 'INVALID_MESSAGE', 'The RPC parameters are invalid.')\n  return createRpcError(requestId, 'INTERNAL_ERROR', 'The Host could not complete the request.')\n}\n\nfunction diagnosticReason(error: unknown): string {\n  const message = error instanceof Error ? error.message : String(error)\n  return message.replace(/[\\r\\n]+/g, ' ').slice(0, 160) || 'Unknown Host request failure.'\n}\n", "import {\n  NoiseIkSession,\n  createNoisePrologue,\n  fromBase64Url,\n  toBase64Url,\n} from '@dsh-remote/crypto'\nimport {\n  PROTOCOL_VERSION,\n  SecureMessageCodec,\n  createControlFrame,\n  decodeMessage,\n  encodeMessage,\n  parseControlFrame,\n  type ConnectIncomingPayload,\n  type ControlErrorPayload,\n  type HelloAckPayload,\n  type RelayPayload,\n  type RemoteMessage,\n  type SecureHandshakePayload,\n  type SelectedTransport,\n  type SignalIcePayload,\n  type SignalPayload,\n  type TransportSelectedPayload,\n} from '@dsh-remote/protocol'\nimport {\n  RtcDataChannelTransport,\n  type RtcIceServer,\n  type RtcPeerConnectionFactory,\n  type RtcSelectedTransport,\n  type RtcSignal,\n} from '@dsh-remote/webrtc'\nimport type { ConnectionController } from './connection-controller.js'\nimport type { ResolvedConfig } from './config.js'\nimport type { HostIdentity, IdentityStore, TrustedPeer } from './identity-store.js'\nimport type { SafeLogger } from './logging.js'\nimport type { AuthorizedPeerDevice, HostServerApi } from './server-api.js'\nimport { ServerApiError } from './server-api.js'\nimport type { AuthenticatedPeerChannel } from './types.js'\nimport { PLUGIN_VERSION } from './version.js'\n\ninterface WebSocketLike {\n  readonly readyState: number\n  onopen: ((event: unknown) => void) | null\n  onmessage: ((event: { data: unknown }) => void) | null\n  onerror: ((event: unknown) => void) | null\n  onclose: ((event: { code: number; reason: string }) => void) | null\n  send(data: string): void\n  close(code?: number, reason?: string): void\n}\n\nexport type WebSocketFactory = (url: string) => WebSocketLike\n\ninterface PendingTunnel {\n  connectionId: string\n  membershipId: string\n  peer: TrustedPeer\n  noise: NoiseIkSession\n  transport: 'negotiating' | SelectedTransport\n  rtc?: RtcDataChannelTransport\n  channel?: ServerNoiseChannel\n}\n\nconst DEFAULT_WEBRTC_NEGOTIATE_TIMEOUT_MS = 8_000\n\nexport class HostServerConnection {\n  private socket?: WebSocketLike\n  private running?: Promise<void>\n  private stopped = true\n  private online = false\n  private retryWake?: () => void\n  private readonly tunnels = new Map<string, PendingTunnel>()\n  private terminalError?: string\n  private lastActiveAt?: number\n  private reconnectRequested = false\n  private resumeQueued = false\n  private rtcFactory?: RtcPeerConnectionFactory\n\n  constructor(\n    private readonly config: ResolvedConfig,\n    private readonly identity: HostIdentity,\n    private readonly identities: IdentityStore,\n    private readonly api: HostServerApi,\n    private readonly connections: ConnectionController,\n    private readonly logger: SafeLogger,\n    private readonly createWebSocket: WebSocketFactory = url => new WebSocket(url) as unknown as WebSocketLike,\n    private readonly rtcFactoryProvider?: () => Promise<RtcPeerConnectionFactory | undefined>,\n  ) {}\n\n  start(): void {\n    if (this.running !== undefined) return\n    this.stopped = false\n    this.running = this.run().finally(() => { this.running = undefined })\n  }\n\n  resume(): void {\n    this.terminalError = undefined\n    this.stopped = false\n    if (this.running === undefined) {\n      this.start()\n      return\n    }\n    if (this.resumeQueued) return\n    this.resumeQueued = true\n    void this.running.finally(() => {\n      this.resumeQueued = false\n      if (!this.stopped) this.start()\n    })\n  }\n\n  async stop(): Promise<void> {\n    this.stopped = true\n    this.reconnectRequested = false\n    this.retryWake?.()\n    this.retryWake = undefined\n    this.socket?.close(1000, 'plugin stopped')\n    await this.running\n    await this.dropTunnels()\n  }\n\n  isOnline(): boolean { return this.online }\n\n  lastError(): string | undefined { return this.terminalError }\n\n  lastActivity(): number | undefined { return this.lastActiveAt }\n\n  isReconnecting(): boolean { return !this.online && !this.stopped && this.running !== undefined }\n\n  reconnect(): void {\n    this.terminalError = undefined\n    this.stopped = false\n    if (this.running === undefined) {\n      this.start()\n      return\n    }\n    this.reconnectRequested = true\n    this.retryWake?.()\n    this.socket?.close(4000, 'manual reconnect')\n    void this.running.finally(() => {\n      if (!this.reconnectRequested || this.stopped) return\n      this.reconnectRequested = false\n      this.start()\n    })\n  }\n\n  private async run(): Promise<void> {\n    let delayMs = this.config.reconnect.initialDelayMs\n    while (!this.stopped) {\n      try {\n        await this.connectOnce()\n        delayMs = this.config.reconnect.initialDelayMs\n      } catch (error) {\n        const code = errorCode(error)\n        this.terminalError = code\n        this.logger.warn('server control connection failed', { code, retryable: isRetryable(error) })\n        if (TERMINAL_AUTH_ERRORS.has(code) || !this.config.reconnect.enabled) return\n      }\n      if (this.stopped) return\n      if (this.reconnectRequested) {\n        this.reconnectRequested = false\n        delayMs = this.config.reconnect.initialDelayMs\n        continue\n      }\n      if (!this.config.reconnect.enabled) return\n      await this.waitBeforeRetry(delayMs)\n      if (this.reconnectRequested) {\n        this.reconnectRequested = false\n        delayMs = this.config.reconnect.initialDelayMs\n        continue\n      }\n      delayMs = Math.min(this.config.reconnect.maxDelayMs, delayMs * 2)\n    }\n  }\n\n  private async connectOnce(): Promise<void> {\n    const credentials = await this.api.authenticate(this.identity)\n    if (this.stopped) return\n    const socket = this.createWebSocket(websocketUrl(this.api.baseUrl))\n    this.socket = socket\n    let acknowledged = false\n    let messageQueue = Promise.resolve()\n    await new Promise<void>((resolve, reject) => {\n      let settled = false\n      const helloTimer = setTimeout(() => socket.close(4001, 'hello timeout'), 10_000)\n      const finish = (error?: Error): void => {\n        if (settled) return\n        settled = true\n        clearTimeout(helloTimer)\n        this.online = false\n        if (this.socket === socket) this.socket = undefined\n        void this.dropTunnels().finally(() => error === undefined ? resolve() : reject(error))\n      }\n      socket.onopen = () => {\n        this.sendControl('hello', {\n          role: 'host',\n          deviceId: this.identity.deviceId,\n          accessToken: credentials.accessToken,\n          protocols: [PROTOCOL_VERSION],\n          clientVersion: PLUGIN_VERSION,\n          capabilities: this.rtcFactoryProvider === undefined || this.config.forceRelay\n            ? ['transport.relay', 'harness.api.v1']\n            : ['transport.p2p', 'transport.turn', 'transport.relay', 'harness.api.v1'],\n        })\n      }\n      socket.onmessage = event => {\n        messageQueue = messageQueue.then(async () => {\n          const frame = decodeControl(event.data)\n          this.lastActiveAt = Date.now()\n          if (frame.type === 'hello.ack') {\n            const payload = requireHelloAck(frame.payload)\n            acknowledged = true\n            clearTimeout(helloTimer)\n            this.online = true\n            this.terminalError = undefined\n            this.logger.info('server control connection online', {\n              serverVersion: payload.serverVersion,\n              connectionSessionId: shortId(payload.connectionSessionId),\n            })\n            return\n          }\n          if (!acknowledged) throw new ControlConnectionError('INVALID_MESSAGE', 'Server sent a frame before hello.ack.')\n          await this.handleFrame(frame)\n        }).catch(error => {\n          const code = errorCode(error)\n          this.terminalError = code\n          this.logger.error('server control frame failed', {\n            code,\n            reason: diagnosticReason(error),\n          })\n          socket.close(4008, 'invalid control frame')\n        })\n      }\n      socket.onerror = () => {\n        if (!acknowledged) finish(new ControlConnectionError('CONNECTION_FAILED', 'Unable to open the Server WebSocket.'))\n      }\n      socket.onclose = event => {\n        const close = async (): Promise<void> => {\n          await messageQueue.catch(() => undefined)\n          if (event.code === 4002) {\n            try { await this.api.refreshCredentials() } catch (error) { finish(asError(error)); return }\n          }\n          if (event.code === 4004) { finish(new ControlConnectionError('DEVICE_REVOKED', 'The Server revoked this Host device.')); return }\n          if (acknowledged) this.terminalError = closeCode(event.code)\n          finish(acknowledged ? undefined : new ControlConnectionError(closeCode(event.code), event.reason || 'Server control connection closed.'))\n        }\n        void close()\n      }\n    })\n  }\n\n  private async handleFrame(frame: ReturnType<typeof parseControlFrame>): Promise<void> {\n    if (frame.type === 'ping') {\n      const nonce = objectValue(frame.payload, 'nonce')\n      if (typeof nonce !== 'string') throw new ControlConnectionError('INVALID_MESSAGE', 'Control ping has no nonce.')\n      this.sendControl('pong', { nonce })\n      return\n    }\n    if (frame.type === 'pong') return\n    if (frame.type === 'connect.incoming') {\n      await this.handleConnectIncoming(requireConnectIncoming(frame.payload))\n      return\n    }\n    if (frame.type === 'secure.handshake') {\n      await this.handleHandshake(requireHandshake(frame.payload))\n      return\n    }\n    if (frame.type === 'relay') {\n      await this.handleRelay(requireRelay(frame.payload))\n      return\n    }\n    if (frame.type === 'signal.offer') {\n      await this.handleSignalOffer(requireSignal(frame.payload))\n      return\n    }\n    if (frame.type === 'signal.ice') {\n      this.handleSignalIce(requireSignalIce(frame.payload))\n      return\n    }\n    if (frame.type === 'transport.selected') return\n    if (frame.type === 'signal.answer') return\n    if (frame.type === 'error') {\n      const payload = requireControlError(frame.payload)\n      if (payload.code === 'DEVICE_REVOKED') {\n        this.terminalError = payload.code\n        this.socket?.close(4004, 'device revoked')\n      } else if (payload.connectionId !== undefined) {\n        await this.dropTunnel(payload.connectionId, payload.code)\n        this.logger.warn('server closed a remote connection', {\n          code: payload.code,\n          connectionId: shortId(payload.connectionId),\n          retryable: payload.retryable,\n        })\n      } else {\n        this.terminalError = payload.code\n        this.logger.warn('server returned a control error', { code: payload.code, retryable: payload.retryable })\n      }\n      return\n    }\n    throw new ControlConnectionError('INVALID_MESSAGE', `Unexpected Server control frame: ${frame.type}`)\n  }\n\n  private async handleConnectIncoming(payload: ConnectIncomingPayload): Promise<void> {\n    let descriptor: AuthorizedPeerDevice\n    try {\n      descriptor = await this.api.deviceFor(payload.clientDeviceId)\n    } catch (error) {\n      this.sendControl('connect.rejected', { connectionId: payload.connectionId })\n      this.logger.warn('connection rejected by account authorization', {\n        clientDeviceId: shortId(payload.clientDeviceId),\n        code: errorCode(error),\n      })\n      return\n    }\n    if (descriptor.role !== 'client' || descriptor.deviceId !== payload.clientDeviceId\n      || descriptor.identityKey !== payload.clientIdentityKey) {\n      this.sendControl('connect.rejected', { connectionId: payload.connectionId })\n      this.logger.warn('connection rejected by peer identity validation', {\n        clientDeviceId: shortId(payload.clientDeviceId),\n      })\n      return\n    }\n    const existing = this.identities.trustedPeer(descriptor.deviceId)\n    if (existing !== undefined && existing.publicKey !== descriptor.identityKey) {\n      this.sendControl('connect.rejected', { connectionId: payload.connectionId })\n      this.logger.warn('connection rejected by pinned peer identity', {\n        clientDeviceId: shortId(payload.clientDeviceId),\n      })\n      return\n    }\n    const peer = existing !== undefined\n      && existing.membershipId === descriptor.membershipId\n      && existing.name === descriptor.name\n      && existing.platform === descriptor.platform\n      ? existing\n      : await this.identities.trustPeer({\n          deviceId: descriptor.deviceId,\n          name: descriptor.name,\n          platform: descriptor.platform,\n          publicKey: descriptor.identityKey,\n          membershipId: descriptor.membershipId,\n        })\n    const previous = this.tunnels.get(payload.connectionId)\n    previous?.noise.destroy()\n    const noise = new NoiseIkSession({\n      role: 'responder',\n      localPrivateKey: this.identity.privateKey,\n      localPublicKey: this.identity.publicKey,\n      remotePublicKey: peer.publicKey,\n      prologue: createNoisePrologue(payload.connectionId, this.identity.deviceId, peer.deviceId),\n    })\n    this.tunnels.set(payload.connectionId, {\n      connectionId: payload.connectionId,\n      membershipId: descriptor.membershipId,\n      peer,\n      noise,\n      transport: 'negotiating',\n    })\n    this.sendControl('connect.accepted', { connectionId: payload.connectionId })\n  }\n\n  private async handleHandshake(payload: SecureHandshakePayload): Promise<void> {\n    const tunnel = this.tunnels.get(payload.connectionId)\n    if (tunnel !== undefined\n      && tunnel.channel !== undefined\n      && payload.targetDeviceId === this.identity.deviceId\n      && payload.step === 1) {\n      // A queued Relay/WebRTC fallback can deliver the initiator's first\n      // handshake again after the authenticated channel is already ready.\n      // It belongs to this exact tunnel, so ignore it without taking the\n      // Host's shared control connection offline.\n      this.logger.warn('duplicate secure handshake ignored', {\n        connectionId: shortId(tunnel.connectionId),\n        peerDeviceId: shortId(tunnel.peer.deviceId),\n      })\n      return\n    }\n    if (tunnel === undefined || payload.targetDeviceId !== this.identity.deviceId || payload.step !== 1) {\n      throw new ControlConnectionError('SECURE_CHANNEL_FAILED', 'Noise IK handshake is not valid for this connection.')\n    }\n    tunnel.noise.readHandshake(fromBase64Url(payload.data))\n    const reply = tunnel.noise.writeHandshake()\n    if (!tunnel.noise.complete) throw new ControlConnectionError('SECURE_CHANNEL_FAILED', 'Noise IK handshake did not complete.')\n    const viaWebRtc = tunnel.rtc !== undefined && (tunnel.transport === 'p2p' || tunnel.transport === 'turn')\n    if (!viaWebRtc && tunnel.transport === 'negotiating') tunnel.transport = 'relay'\n    const mode = viaWebRtc ? (tunnel.transport === 'turn' ? 'TURN' : 'P2P') : 'Relay'\n    const transmit = viaWebRtc\n      ? (ciphertext: Uint8Array) => tunnel.rtc!.send(ciphertext)\n      : (ciphertext: Uint8Array) => this.sendRelay(tunnel, ciphertext)\n    const channel = new ServerNoiseChannel(tunnel, transmit, () => {\n      if (this.tunnels.get(tunnel.connectionId) === tunnel) this.tunnels.delete(tunnel.connectionId)\n    }, mode)\n    tunnel.channel = channel\n    await this.connections.accept(channel)\n    // Publish the responder handshake only after the channel is registered.\n    // The Client starts its first RPC as soon as step 2 arrives; sending the\n    // reply earlier lets WebRTC deliver that RPC while tunnel.channel is still\n    // undefined, which silently drops the request.\n    this.sendControl('secure.handshake', {\n      connectionId: tunnel.connectionId,\n      targetDeviceId: tunnel.peer.deviceId,\n      step: 2,\n      data: toBase64Url(reply),\n    } satisfies SecureHandshakePayload)\n    this.logger.info('authenticated peer channel ready', {\n      connectionId: shortId(tunnel.connectionId),\n      peerDeviceId: shortId(tunnel.peer.deviceId),\n      transport: mode,\n    })\n  }\n\n  private async handleRelay(payload: RelayPayload): Promise<void> {\n    if (payload.targetDeviceId !== this.identity.deviceId) {\n      throw new ControlConnectionError('INVALID_MESSAGE', 'Relay frame target does not match this Host.')\n    }\n    const tunnel = this.tunnels.get(payload.connectionId)\n    if (tunnel?.channel === undefined) {\n      this.logger.warn('stale relay frame ignored', {\n        connectionId: shortId(payload.connectionId),\n      })\n      return\n    }\n    try {\n      tunnel.channel.receive(payload.counter, fromBase64Url(payload.ciphertext))\n    } catch (error) {\n      await tunnel.channel.close()\n      throw new ControlConnectionError('SECURE_CHANNEL_FAILED', asError(error).message)\n    }\n  }\n\n  private async handleSignalOffer(payload: SignalPayload): Promise<void> {\n    const tunnel = this.tunnels.get(payload.connectionId)\n    if (tunnel === undefined || payload.targetDeviceId !== this.identity.deviceId) {\n      this.logger.warn('stale webrtc offer ignored', { connectionId: shortId(payload.connectionId) })\n      return\n    }\n    if (tunnel.channel !== undefined || tunnel.rtc !== undefined) {\n      // Late or duplicate offer after relay establishment / RTC start: ignore.\n      this.logger.warn('duplicate webrtc offer ignored', { connectionId: shortId(tunnel.connectionId) })\n      return\n    }\n    if (this.config.forceRelay) {\n      // Device-level forced degradation (webrtc plan \u00A711).\n      this.logger.warn('webrtc offer ignored: forceRelay is enabled', { connectionId: shortId(tunnel.connectionId) })\n      return\n    }\n    if (this.rtcFactory === undefined && this.rtcFactoryProvider !== undefined) {\n      this.rtcFactory = await this.rtcFactoryProvider().catch(() => undefined)\n    }\n    if (this.rtcFactory === undefined) {\n      // No Node RTC backend on this Host (webrtc plan \u00A76.2): drop the offer so\n      // the initiator times out and falls back to the Relay data plane.\n      this.logger.warn('webrtc offer ignored: no RTC backend available', { connectionId: shortId(tunnel.connectionId) })\n      return\n    }\n    let iceServers: RtcIceServer[] = []\n    try {\n      iceServers = await this.api.turnCredentials(tunnel.connectionId)\n    } catch (error) {\n      this.logger.warn('TURN credentials unavailable; trying direct candidates', {\n        connectionId: shortId(tunnel.connectionId),\n        code: errorCode(error),\n      })\n    }\n    const rtc = new RtcDataChannelTransport({\n      role: 'responder',\n      factory: this.rtcFactory,\n      iceServers,\n      onSignal: signal => this.sendRtcSignal(tunnel, signal),\n      negotiateTimeoutMs: DEFAULT_WEBRTC_NEGOTIATE_TIMEOUT_MS,\n      label: `host<-${tunnel.peer.deviceId}`,\n    })\n    tunnel.rtc = rtc\n    rtc.onMessage(data => tunnel.channel?.receive(undefined, data))\n    rtc.onClose(() => {\n      void this.handleRtcFailed(tunnel, rtc, new Error('WebRTC data channel closed.'))\n    })\n    void rtc.connect().then(() => {\n      this.handleRtcOpened(tunnel, rtc.selectedTransport() ?? 'p2p')\n    }).catch(error => {\n      void this.handleRtcFailed(tunnel, rtc, asError(error))\n    })\n    rtc.handleSignal({ type: 'offer', sdp: payload.sdp })\n  }\n\n  private handleSignalIce(payload: SignalIcePayload): void {\n    const tunnel = this.tunnels.get(payload.connectionId)\n    if (tunnel === undefined || payload.targetDeviceId !== this.identity.deviceId) return\n    tunnel.rtc?.handleSignal({ type: 'ice', candidate: payload.candidate })\n  }\n\n  private sendRtcSignal(tunnel: PendingTunnel, signal: RtcSignal): void {\n    if (signal.type === 'answer') {\n      this.sendControl('signal.answer', {\n        connectionId: tunnel.connectionId,\n        targetDeviceId: tunnel.peer.deviceId,\n        sdp: signal.sdp,\n      } satisfies SignalPayload)\n    } else if (signal.type === 'ice') {\n      this.sendControl('signal.ice', {\n        connectionId: tunnel.connectionId,\n        targetDeviceId: tunnel.peer.deviceId,\n        candidate: signal.candidate,\n      } satisfies SignalIcePayload)\n    }\n  }\n\n  private handleRtcOpened(tunnel: PendingTunnel, selected: RtcSelectedTransport): void {\n    if (this.tunnels.get(tunnel.connectionId) !== tunnel || tunnel.rtc === undefined) return\n    tunnel.transport = selected\n    this.sendTransportSelected(tunnel, selected)\n    this.logger.info('webrtc data channel ready', {\n      connectionId: shortId(tunnel.connectionId),\n      peerDeviceId: shortId(tunnel.peer.deviceId),\n      transport: selected,\n    })\n  }\n\n  private async handleRtcFailed(\n    tunnel: PendingTunnel,\n    rtc: RtcDataChannelTransport,\n    error: Error,\n  ): Promise<void> {\n    if (this.tunnels.get(tunnel.connectionId) !== tunnel || tunnel.rtc !== rtc) return\n    if (tunnel.channel !== undefined || tunnel.transport === 'p2p' || tunnel.transport === 'turn') {\n      this.logger.warn('webrtc data channel failed; disconnecting peer', {\n        connectionId: shortId(tunnel.connectionId),\n        reason: diagnosticReason(error),\n      })\n      await this.dropTunnel(tunnel.connectionId, 'CONNECTION_FAILED')\n      return\n    }\n    tunnel.rtc = undefined\n    tunnel.transport = 'relay'\n    await rtc.close()\n    this.logger.warn('webrtc negotiation failed; falling back to relay', {\n      connectionId: shortId(tunnel.connectionId),\n      reason: diagnosticReason(error),\n    })\n  }\n\n  private sendTransportSelected(tunnel: PendingTunnel, transport: SelectedTransport): void {\n    this.sendControl('transport.selected', {\n      connectionId: tunnel.connectionId,\n      targetDeviceId: tunnel.peer.deviceId,\n      transport,\n    } satisfies TransportSelectedPayload)\n  }\n\n  private async sendRelay(tunnel: PendingTunnel, ciphertext: Uint8Array): Promise<void> {\n    const counter = Number(tunnel.noise.sendingCounter() - 1n)\n    if (!Number.isSafeInteger(counter) || counter < 0) throw new ControlConnectionError('FRAME_TOO_LARGE', 'Noise transport counter overflowed.')\n    this.sendControl('relay', {\n      connectionId: tunnel.connectionId,\n      targetDeviceId: tunnel.peer.deviceId,\n      counter,\n      ciphertext: toBase64Url(ciphertext),\n    } satisfies RelayPayload)\n  }\n\n  private sendControl(type: Parameters<typeof createControlFrame>[0], payload: unknown): void {\n    const socket = this.socket\n    if (socket === undefined || socket.readyState !== 1) throw new ControlConnectionError('CONNECTION_FAILED', 'Server control socket is not open.')\n    socket.send(JSON.stringify(createControlFrame(type, payload)))\n  }\n\n  private async dropTunnels(): Promise<void> {\n    const tunnels = [...this.tunnels.values()]\n    this.tunnels.clear()\n    await Promise.all(tunnels.map(async tunnel => {\n      if (tunnel.rtc !== undefined) await tunnel.rtc.close()\n      if (tunnel.channel !== undefined) await tunnel.channel.close()\n      else tunnel.noise.destroy()\n    }))\n    await this.connections.close()\n  }\n\n  private async dropTunnel(connectionId: string, code?: string): Promise<void> {\n    const tunnel = this.tunnels.get(connectionId)\n    if (tunnel === undefined) return\n    this.tunnels.delete(connectionId)\n    try {\n      await tunnel.rtc?.close()\n    } catch (error) {\n      this.logger.warn('remote connection RTC cleanup failed', {\n        connectionId: shortId(connectionId),\n        reason: diagnosticReason(error),\n      })\n    }\n    if (tunnel.channel !== undefined) {\n      try {\n        const closed = await this.connections.closeConnection(connectionId, code)\n        if (!closed) await tunnel.channel.close(code)\n      } catch (error) {\n        await tunnel.channel.close(code).catch(() => undefined)\n        this.logger.warn('remote connection channel cleanup failed', {\n          connectionId: shortId(connectionId),\n          reason: diagnosticReason(error),\n        })\n      }\n    } else {\n      tunnel.noise.destroy()\n    }\n  }\n\n  private waitBeforeRetry(baseDelay: number): Promise<void> {\n    const spread = baseDelay * this.config.reconnect.jitter\n    const delay = Math.max(0, Math.round(baseDelay - spread + Math.random() * spread * 2))\n    return new Promise(resolve => {\n      const timer = setTimeout(() => { this.retryWake = undefined; resolve() }, delay)\n      this.retryWake = () => { clearTimeout(timer); resolve() }\n    })\n  }\n}\n\nconst TERMINAL_AUTH_ERRORS = new Set([\n  'ACCOUNT_AUTH_REQUIRED',\n  'AUTH_INVALID',\n  'DEVICE_OWNERSHIP_REQUIRED',\n  'DEVICE_REVOKED',\n  'TOKEN_EXPIRED',\n])\n\nclass ServerNoiseChannel implements AuthenticatedPeerChannel {\n  readonly security\n  readonly peerDeviceId: string\n  readonly peerIdentityKey: string\n  readonly mode: 'P2P' | 'TURN' | 'Relay'\n  private readonly handlers = new Set<(message: RemoteMessage) => void>()\n  private readonly incoming = new SecureMessageCodec()\n  private readonly outgoing = new SecureMessageCodec()\n  private closed = false\n\n  constructor(\n    private readonly tunnel: PendingTunnel,\n    private readonly transmit: (ciphertext: Uint8Array) => Promise<void>,\n    private readonly onClose: () => void,\n    mode: 'P2P' | 'TURN' | 'Relay',\n  ) {\n    this.mode = mode\n    this.security = {\n      protocol: 'Noise_IK_25519_ChaChaPoly_SHA256' as const,\n      connectionId: tunnel.connectionId,\n      membershipId: tunnel.membershipId,\n    }\n    this.peerDeviceId = tunnel.peer.deviceId\n    this.peerIdentityKey = tunnel.peer.publicKey\n  }\n\n  async send(message: RemoteMessage): Promise<void> {\n    if (this.closed) throw new Error('secure channel is closed')\n    for (const plaintext of this.outgoing.encode(encodeMessage(message))) {\n      await this.transmit(this.tunnel.noise.encrypt(plaintext))\n    }\n  }\n\n  onMessage(handler: (message: RemoteMessage) => void): () => void {\n    this.handlers.add(handler)\n    return () => this.handlers.delete(handler)\n  }\n\n  receive(counter: number | undefined, ciphertext: Uint8Array): void {\n    if (this.closed) return\n    if (counter !== undefined) {\n      const expected = Number(this.tunnel.noise.receivingCounter())\n      if (!Number.isSafeInteger(counter) || counter !== expected) {\n        throw new ControlConnectionError('INVALID_MESSAGE', 'Relay counter is duplicated or out of order.')\n      }\n    }\n    const plaintext = this.incoming.decode(this.tunnel.noise.decrypt(ciphertext))\n    if (plaintext === undefined) return\n    const message = decodeMessage(plaintext)\n    for (const handler of this.handlers) handler(message)\n  }\n\n  async close(_code?: string): Promise<void> {\n    if (this.closed) return\n    this.closed = true\n    this.handlers.clear()\n    this.incoming.reset()\n    this.outgoing.reset()\n    this.tunnel.noise.destroy()\n    this.onClose()\n  }\n}\n\nclass ControlConnectionError extends Error {\n  constructor(readonly code: string, message: string) { super(message) }\n}\n\nfunction websocketUrl(baseUrl: string): string {\n  const url = new URL(baseUrl)\n  url.protocol = url.protocol === 'https:' ? 'wss:' : 'ws:'\n  url.pathname = `${url.pathname.replace(/\\/$/, '')}/ws/v1/connect`\n  return url.toString()\n}\n\nfunction decodeControl(data: unknown): ReturnType<typeof parseControlFrame> {\n  if (typeof data !== 'string') throw new ControlConnectionError('INVALID_MESSAGE', 'Server control frames must be text JSON.')\n  try { return parseControlFrame(JSON.parse(data)) } catch { throw new ControlConnectionError('INVALID_MESSAGE', 'Server sent an invalid control frame.') }\n}\n\nfunction requireHelloAck(value: unknown): HelloAckPayload {\n  const payload = requireObject(value)\n  if (payload.protocol !== PROTOCOL_VERSION || typeof payload.serverVersion !== 'string'\n    || typeof payload.connectionSessionId !== 'string' || !Number.isSafeInteger(payload.heartbeatIntervalMs)\n    || !Number.isSafeInteger(payload.maxControlFrameBytes) || !Number.isSafeInteger(payload.maxRelayFrameBytes)) {\n    throw new ControlConnectionError('INVALID_MESSAGE', 'hello.ack payload is invalid.')\n  }\n  return payload as unknown as HelloAckPayload\n}\n\nfunction requireConnectIncoming(value: unknown): ConnectIncomingPayload {\n  const payload = requireObject(value)\n  if (typeof payload.connectionId !== 'string' || typeof payload.clientDeviceId !== 'string'\n    || typeof payload.clientIdentityKey !== 'string' || payload.authorization !== 'account'\n    || !Array.isArray(payload.preferredTransports)) {\n    throw new ControlConnectionError('INVALID_MESSAGE', 'connect.incoming payload is invalid.')\n  }\n  return payload as unknown as ConnectIncomingPayload\n}\n\nfunction requireHandshake(value: unknown): SecureHandshakePayload {\n  const payload = requireObject(value)\n  if (typeof payload.connectionId !== 'string' || typeof payload.targetDeviceId !== 'string'\n    || !Number.isSafeInteger(payload.step) || typeof payload.data !== 'string') {\n    throw new ControlConnectionError('INVALID_MESSAGE', 'secure.handshake payload is invalid.')\n  }\n  return payload as unknown as SecureHandshakePayload\n}\n\nfunction requireRelay(value: unknown): RelayPayload {\n  const payload = requireObject(value)\n  if (typeof payload.connectionId !== 'string' || typeof payload.targetDeviceId !== 'string'\n    || !Number.isSafeInteger(payload.counter) || typeof payload.ciphertext !== 'string') {\n    throw new ControlConnectionError('INVALID_MESSAGE', 'relay payload is invalid.')\n  }\n  return payload as unknown as RelayPayload\n}\n\nfunction requireSignal(value: unknown): SignalPayload {\n  const payload = requireObject(value)\n  if (typeof payload.connectionId !== 'string' || typeof payload.targetDeviceId !== 'string'\n    || typeof payload.sdp !== 'string' || payload.sdp.length === 0) {\n    throw new ControlConnectionError('INVALID_MESSAGE', 'signal offer/answer payload is invalid.')\n  }\n  return payload as unknown as SignalPayload\n}\n\nfunction requireSignalIce(value: unknown): SignalIcePayload {\n  const payload = requireObject(value)\n  if (typeof payload.connectionId !== 'string' || typeof payload.targetDeviceId !== 'string'\n    || typeof payload.candidate !== 'object' || payload.candidate === null || Array.isArray(payload.candidate)) {\n    throw new ControlConnectionError('INVALID_MESSAGE', 'signal.ice payload is invalid.')\n  }\n  return payload as unknown as SignalIcePayload\n}\n\nfunction requireControlError(value: unknown): ControlErrorPayload {\n  const payload = requireObject(value)\n  if (typeof payload.code !== 'string' || typeof payload.message !== 'string'\n    || (payload.connectionId !== undefined && (typeof payload.connectionId !== 'string' || payload.connectionId === ''))) {\n    throw new ControlConnectionError('INVALID_MESSAGE', 'error payload is invalid.')\n  }\n  return payload as unknown as ControlErrorPayload\n}\n\nfunction requireObject(value: unknown): Record<string, unknown> {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new ControlConnectionError('INVALID_MESSAGE', 'Control payload must be an object.')\n  }\n  return value as Record<string, unknown>\n}\n\nfunction objectValue(value: unknown, key: string): unknown { return requireObject(value)[key] }\nfunction shortId(value: string): string { return value.length <= 12 ? value : `${value.slice(0, 8)}\u2026${value.slice(-4)}` }\nfunction asError(error: unknown): Error { return error instanceof Error ? error : new Error('Unknown Server connection error.') }\nfunction diagnosticReason(error: unknown): string {\n  const message = asError(error).message.replace(/[\\r\\n]+/g, ' ').slice(0, 160)\n  return message || 'Unknown Server connection error.'\n}\nfunction errorCode(error: unknown): string { return error instanceof ServerApiError || error instanceof ControlConnectionError ? error.code : 'CONNECTION_FAILED' }\nfunction isRetryable(error: unknown): boolean { return error instanceof ServerApiError ? error.retryable : errorCode(error) !== 'DEVICE_REVOKED' }\nfunction closeCode(code: number): string {\n  if (code === 4002) return 'AUTH_INVALID'\n  if (code === 4004) return 'DEVICE_REVOKED'\n  if (code === 4007) return 'RATE_LIMITED'\n  if (code === 4011) return 'UNSUPPORTED_VERSION'\n  return 'CONNECTION_FAILED'\n}\n", "import { readdir, stat } from 'node:fs/promises'\nimport { homedir, platform } from 'node:os'\nimport { basename, dirname, isAbsolute, parse, resolve } from 'node:path'\n\ninterface DirectoryEntry { name: string; path: string; hidden: boolean }\nexport interface DirectoryListing {\n  path: string\n  home: string\n  crumbs: DirectoryEntry[]\n  entries: DirectoryEntry[]\n  truncated: boolean\n}\n\nconst MAX_ENTRIES = 500\n\n/** Read-only fallback used only over an authenticated Host channel when Harness has a native-only picker. */\nexport async function listRemoteDirectory(path?: string, signal?: AbortSignal): Promise<DirectoryListing> {\n  signal?.throwIfAborted()\n  const home = resolve(homedir())\n  const target = path === undefined || path.trim() === '' ? home : resolve(path)\n  if (!isAbsolute(target)) throw new Error('The remote directory path must be absolute.')\n  const rows = await readdir(target, { withFileTypes: true })\n  const directories: DirectoryEntry[] = []\n  for (const row of rows) {\n    signal?.throwIfAborted()\n    const child = resolve(target, row.name)\n    let directory = row.isDirectory()\n    if (!directory && row.isSymbolicLink()) directory = await stat(child).then(value => value.isDirectory()).catch(() => false)\n    if (!directory) continue\n    directories.push({ name: row.name, path: child, hidden: platform() !== 'win32' && row.name.startsWith('.') })\n  }\n  directories.sort((left, right) => left.name.localeCompare(right.name, undefined, { sensitivity: 'base' }))\n  return {\n    path: target,\n    home,\n    crumbs: crumbs(target),\n    entries: directories.slice(0, MAX_ENTRIES),\n    truncated: directories.length > MAX_ENTRIES,\n  }\n}\n\nfunction crumbs(path: string): DirectoryEntry[] {\n  const root = parse(path).root\n  const result: DirectoryEntry[] = [{ name: root, path: root, hidden: false }]\n  const segments: string[] = []\n  let current = path\n  while (current !== root) {\n    segments.unshift(basename(current))\n    current = dirname(current)\n  }\n  for (const segment of segments) {\n    current = resolve(current, segment)\n    result.push({ name: segment, path: current, hidden: false })\n  }\n  return result\n}\n", "import type {\n  ApiProxy,\n  ClientResponse,\n  HostFrame,\n  MuxFrame,\n  RpcRequest,\n  RpcResponse,\n} from '@deepseek-ai/dsh-host-apiproxy/api'\nimport type {\n  HarnessApiCallParams,\n  HarnessApiFrameData,\n  HarnessApiRespondParams,\n  HarnessApiStreamClosedData,\n  HarnessApiStreamOpenParams,\n} from '@dsh-remote/protocol'\nimport {\n  createRpcResponse,\n  encodeMessage,\n  MAX_SECURE_MESSAGE_BYTES,\n} from '@dsh-remote/protocol'\nimport { z } from 'zod'\nimport type { SafeLogger } from './logging.js'\nimport { RpcError } from './rpc-router.js'\nimport { listRemoteDirectory } from './remote-directory-browser.js'\n\ntype HarnessStream = AsyncIterable<RpcRequest<MuxFrame | HostFrame>>\ntype NativeMethod = (request: RpcRequest<unknown>, signal?: AbortSignal) => Promise<RpcResponse<unknown>>\ntype PublishFrame = (event: 'harness.api.frame' | 'harness.api.stream.closed', data: HarnessApiFrameData | HarnessApiStreamClosedData) => Promise<void>\n\nconst callSchema = z.object({\n  method: z.string().min(1).max(80),\n  rpcId: z.string().min(1).max(128),\n  payload: z.unknown(),\n}).strict()\n\nconst respondSchema = z.object({\n  message: z.object({\n    type: z.literal('client-response'),\n    rpcId: z.string().min(1).max(128),\n    result: z.unknown(),\n  }).strict(),\n}).strict()\n\nconst streamOpenSchema = z.object({\n  streamId: z.string().min(1).max(128),\n  stream: z.enum(['mux', 'host']),\n  rpcId: z.string().min(1).max(128),\n  payload: z.object({\n    // Optional focus for a mux stream: only frames belonging to this session\n    // are forwarded. The Remote Web selects one session at a time, so without\n    // this every active session's events (potentially megabytes) would be\n    // pushed over the tunnel and stall the WebRTC data channel.\n    sessionId: z.string().min(1).max(128).optional(),\n  }).strict(),\n}).strict()\n\nconst streamCloseSchema = z.object({ streamId: z.string().min(1).max(128) }).strict()\n\nconst permissionCommandSchema = z.object({\n  agentId: z.string().min(1).max(128),\n  line: z.string().regex(/^\\/permission [a-z0-9]+(?:-[a-z0-9]+)*$/),\n}).strict()\n\n/**\n * Harness API methods that are safe to expose to an authenticated remote UI.\n * Settings, credentials, native open/picker calls, directory mutation, file\n * contents, downloads, and attachment upload intentionally remain outside\n * this bridge. Directory listing exposes metadata only for workspace picking.\n */\nexport const HARNESS_API_ALLOWLIST = [\n  'session.list',\n  'session.search',\n  'session.create',\n  'session.history',\n  'session.models',\n  'session.selectModel',\n  'session.rename',\n  'session.fork',\n  'session.prompt',\n  'session.updateQueue',\n  'session.cancel',\n  'subagent.list',\n  'subagent.history',\n  'subagent.prompt',\n  'subagent.interrupt',\n  'host.describe',\n  'host.listDirectory',\n  'workspace.list',\n  'workspace.create',\n  'workspace.rename',\n  'workspace.delete',\n  'workspace.insertBefore',\n  'workspace.insertSessionBefore',\n  'workspace.archiveSession',\n  'skill.list',\n  'agentPreset.list',\n  'agentPreset.select',\n  'agentPreset.read',\n  'goal.create',\n  'goal.edit',\n  'goal.pause',\n  'goal.resume',\n  'goal.complete',\n  'goal.clear',\n  'commands.execute',\n  'llm.providers',\n  'llm.models',\n] as const\n\nexport type AllowedHarnessApiMethod = typeof HARNESS_API_ALLOWLIST[number]\n\ninterface ActiveStream {\n  controller: AbortController\n  task: Promise<void>\n  /** For a mux stream: only forward frames for this session (undefined = all). */\n  focusSessionId?: string\n}\n\n/**\n * Native Harness ApiProxy call timeout. The Remote Web frontend gives each\n * `harness.api.call` RPC a 60s window; this bridge must fail faster so the\n * RPC error (not a silent Web-side timeout) reaches the peer and the pending\n * call is released. 30s gives slow native methods room while still beating the\n * Web-side 60s timer by a wide margin.\n */\nconst NATIVE_CALL_TIMEOUT_MS = 30_000\n\nconst SESSION_HISTORY_PAGE_SIZES = [50, 30, 20, 12, 6, 3, 1] as const\n\n/**\n * The official Typert gateway surface (`typertGateway` service from\n * `dsh-api-gateway`) used to dispatch Harness command endpoints. The ApiProxy\n * has no `commands` domain \u2014 commands live behind the Typert registry, which\n * is exactly the path the official Web UI exercises via `/api/commands/*`.\n */\nexport interface TypertGatewayLike {\n  invoke(request: {\n    namespace: string\n    method: string\n    args: Record<string, unknown>\n    signal?: AbortSignal\n  }): Promise<unknown>\n}\n\nexport class HarnessApiBridge {\n  private readonly methods: ReadonlyMap<string, NativeMethod>\n  private readonly streams = new Map<string, ActiveStream>()\n  private readonly respondable = new Map<string, string>()\n  private readonly mux: ApiProxy['events']['mux']\n  private readonly host: ApiProxy['events']['host']\n  private readonly answer: ApiProxy['respond']\n\n  constructor(\n    private readonly api: ApiProxy,\n    private readonly publish: PublishFrame,\n    private readonly maxStreams = 3,\n    private readonly logger?: SafeLogger,\n    typertGateway?: TypertGatewayLike,\n  ) {\n    this.methods = createMethodMap(api, typertGateway)\n    this.mux = api.events.mux.bind(api.events)\n    this.host = api.events.host.bind(api.events)\n    this.answer = api.respond.bind(api)\n  }\n\n  async call(input: unknown): Promise<RpcResponse<unknown>> {\n    const params = callSchema.parse(input) as HarnessApiCallParams\n    const method = this.methods.get(params.method)\n    if (method === undefined) throw deniedMethod(params.method)\n    const startedAt = performance.now()\n    const signal = AbortSignal.timeout(NATIVE_CALL_TIMEOUT_MS)\n    const request = { rpcId: params.rpcId as never, payload: params.payload }\n    try {\n      // Race the native call against the timeout: some native ApiProxy\n      // methods ignore AbortSignal, and without this the Host would never\n      // answer and the Web-side 60s timer would fire instead. A guaranteed\n      // local response turns that into a fast, explicit RPC error.\n      const callWithTimeout = (overridePayload: unknown) => withTimeout(\n        method({ rpcId: params.rpcId as never, payload: overridePayload }, signal),\n        NATIVE_CALL_TIMEOUT_MS,\n        `Harness API call ${params.method} timed out after ${NATIVE_CALL_TIMEOUT_MS}ms`,\n      )\n      let response: RpcResponse<unknown>\n      if (params.method === 'session.history') {\n        response = await callSessionHistory(callWithTimeout, params.payload, params.rpcId as never)\n      } else {\n        response = await callWithTimeout(request.payload)\n      }\n      if (params.method === 'host.listDirectory' && needsRemoteDirectoryFallback(response)) {\n        const payload = typeof params.payload === 'object' && params.payload !== null ? params.payload as { path?: unknown } : {}\n        const value = await listRemoteDirectory(typeof payload.path === 'string' ? payload.path : undefined, signal)\n        response = { rpcId: params.rpcId as never, result: { ok: true, value } }\n      }\n      this.logger?.debug('harness api call ok', {\n        method: params.method,\n        durationMs: Math.round(performance.now() - startedAt),\n      })\n      return response\n    } catch (error) {\n      const durationMs = Math.round(performance.now() - startedAt)\n      this.logger?.warn('harness api call failed', {\n        method: params.method,\n        durationMs,\n        timedOut: signal.aborted,\n        reason: diagnosticReason(error),\n      })\n      throw error\n    }\n  }\n\n  async respond(input: unknown): Promise<unknown> {\n    const params = respondSchema.parse(input) as HarnessApiRespondParams\n    this.logger?.debug('harness api respond', { rpcId: shortId(params.message.rpcId) })\n    if (!this.respondable.has(params.message.rpcId)) {\n      throw new RpcError('PERMISSION_NOT_PENDING', 'The response id was not emitted on this peer connection.')\n    }\n    const receipt = await this.answer(params.message as ClientResponse)\n    if (receipt.accepted || receipt.reason === 'not-pending') this.respondable.delete(params.message.rpcId)\n    return receipt\n  }\n\n  openStream(input: unknown): { opened: true; streamId: string } {\n    const params = streamOpenSchema.parse(input) as HarnessApiStreamOpenParams\n    if (this.streams.has(params.streamId)) throw new RpcError('REQUEST_CONFLICT', 'The Harness event stream is already open.')\n    if (this.streams.size >= this.maxStreams) throw new RpcError('RATE_LIMITED', 'Too many Harness event streams are open.', undefined, true)\n    const controller = new AbortController()\n    const request = { rpcId: params.rpcId as never, payload: params.payload }\n    const stream = params.stream === 'mux'\n      ? this.mux(request as never, controller.signal)\n      : this.host(request as never, controller.signal)\n    const focusSessionId = params.stream === 'mux' ? params.payload.sessionId : undefined\n    const task = this.pump(params.streamId, stream, controller.signal, focusSessionId)\n    this.streams.set(params.streamId, { controller, task, ...(focusSessionId === undefined ? {} : { focusSessionId }) })\n    this.logger?.debug('harness api stream open', {\n      stream: params.stream,\n      streamId: shortId(params.streamId),\n      ...(focusSessionId === undefined ? {} : { focusSessionId: shortId(focusSessionId) }),\n    })\n    return { opened: true, streamId: params.streamId }\n  }\n\n  closeStream(input: unknown): { closed: boolean; streamId: string } {\n    const params = streamCloseSchema.parse(input)\n    const active = this.streams.get(params.streamId)\n    if (active !== undefined) {\n      // Free the slot synchronously. A native ApiProxy stream may not observe\n      // the abort until its next frame, so a session-focused mux stream on an\n      // idle session could otherwise hold its slot forever and block the\n      // client's documented close-then-reopen session switch with\n      // RATE_LIMITED. The pump's finally performs a no-op delete later.\n      this.streams.delete(params.streamId)\n      active.controller.abort()\n    }\n    this.logger?.debug('harness api stream close', { streamId: shortId(params.streamId), closed: active !== undefined })\n    return { closed: active !== undefined, streamId: params.streamId }\n  }\n\n  async closeAll(reason: HarnessApiStreamClosedData['reason'] = 'peer-disconnected'): Promise<void> {\n    const streams = [...this.streams.values()]\n    this.streams.clear()\n    this.respondable.clear()\n    for (const stream of streams) stream.controller.abort(reason)\n    // A native ApiProxy stream may not observe AbortSignal until its next\n    // frame. Waiting for every pump here would block a replacement peer from\n    // installing its message handler indefinitely. The detached pumps own\n    // their errors and terminal event publication, so abort and release them\n    // without holding up the authenticated connection handoff.\n  }\n\n  private async pump(\n    streamId: string,\n    stream: HarnessStream,\n    signal: AbortSignal,\n    focusSessionId?: string,\n  ): Promise<void> {\n    let reason: HarnessApiStreamClosedData['reason'] = 'completed'\n    try {\n      for await (const frame of stream) {\n        if (signal.aborted) break\n        if (focusSessionId !== undefined && frameSessionId(frame) !== undefined && frameSessionId(frame) !== focusSessionId) {\n          // Keep pushing to the native stream (the peer's upstream may still\n          // emit approvals for the focused session through the same pump) but\n          // do not forward other sessions' traffic over the tunnel.\n          continue\n        }\n        this.trackRespondable(frame)\n        await this.publish('harness.api.frame', { streamId, frame } satisfies HarnessApiFrameData)\n      }\n      if (signal.aborted) reason = 'cancelled'\n    } catch {\n      reason = signal.aborted ? 'cancelled' : 'failed'\n    } finally {\n      this.streams.delete(streamId)\n      await this.publish('harness.api.stream.closed', { streamId, reason } satisfies HarnessApiStreamClosedData).catch(() => undefined)\n    }\n  }\n\n  private trackRespondable(frame: RpcRequest<MuxFrame | HostFrame>): void {\n    const payload = frame.payload\n    if (payload.type === 'approval/requested') {\n      this.respondable.set(String(frame.rpcId), `approval:${String(payload.approvalId)}`)\n      return\n    }\n    if (payload.type === 'question/requested') {\n      this.respondable.set(String(frame.rpcId), `question:${String(frame.rpcId)}`)\n      return\n    }\n    if (payload.type === 'approval/resolved') {\n      this.deleteRespondable(`approval:${String(payload.approvalId)}`)\n      return\n    }\n    if (payload.type === 'question/resolved') {\n      this.respondable.delete(String(payload.questionRpcId))\n    }\n  }\n\n  private deleteRespondable(value: string): void {\n    for (const [rpcId, correlation] of this.respondable) {\n      if (correlation === value) this.respondable.delete(rpcId)\n    }\n  }\n}\n\nfunction needsRemoteDirectoryFallback(response: RpcResponse<unknown>): boolean {\n  const result = response.result\n  return typeof result === 'object' && result !== null && 'ok' in result && result.ok === false\n    && 'error' in result && typeof result.error === 'object' && result.error !== null\n    && 'code' in result.error && result.error.code === 'directory-picker-unavailable'\n}\n\nfunction createMethodMap(api: ApiProxy, typertGateway?: TypertGatewayLike): ReadonlyMap<string, NativeMethod> {\n  const domains = api as unknown as Record<string, Record<string, NativeMethod>>\n  const methods = new Map<string, NativeMethod>()\n  for (const method of HARNESS_API_ALLOWLIST) {\n    if (method === 'commands.execute') {\n      // Commands live behind the official Typert registry (no ApiProxy\n      // `commands` domain). Dispatch them through the gateway when it is\n      // available; without it the method stays denied (fail-closed).\n      if (typertGateway === undefined) continue\n      const implementation: NativeMethod = async (request, signal) => {\n        const args = permissionCommandSchema.parse(request.payload)\n        const [namespace, commandMethod] = method.split('.') as [string, string]\n        const value = await typertGateway.invoke({\n          namespace,\n          method: commandMethod,\n          args,\n          ...(signal === undefined ? {} : { signal }),\n        })\n        return { rpcId: request.rpcId, result: { ok: true, value } }\n      }\n      methods.set(method, implementation)\n      continue\n    }\n    const [wireDomain, action] = method.split('.') as [string, string]\n    const domain = domainProperty(wireDomain)\n    const implementation = domains[domain]?.[action]\n    if (typeof implementation !== 'function') continue\n    methods.set(method, implementation.bind(domains[domain]))\n  }\n  return methods\n}\n\nfunction domainProperty(wireDomain: string): string {\n  if (wireDomain === 'session') return 'sessions'\n  if (wireDomain === 'subagent') return 'subagents'\n  if (wireDomain === 'skill') return 'skills'\n  if (wireDomain === 'agentPreset') return 'agentPresets'\n  if (wireDomain === 'goal') return 'goals'\n  return wireDomain\n}\n\nfunction deniedMethod(method: string): RpcError {\n  return new RpcError('METHOD_NOT_ALLOWED', `Harness API method ${JSON.stringify(method)} is not available in remote mode.`)\n}\n\nfunction diagnosticReason(error: unknown): string {\n  const message = error instanceof Error ? error.message : String(error)\n  return message.replace(/[\\r\\n]+/g, ' ').slice(0, 160) || 'Unknown Harness API failure.'\n}\n\n/** Session id of a mux frame, or undefined for frames without one (e.g. stream/error). */\nfunction frameSessionId(frame: RpcRequest<MuxFrame | HostFrame>): string | undefined {\n  const payload = frame.payload as { sessionId?: unknown }\n  return typeof payload.sessionId === 'string' && payload.sessionId.length > 0 ? payload.sessionId : undefined\n}\n\nfunction callSessionHistory(\n  callWithTimeout: (payload: unknown) => Promise<RpcResponse<unknown>>,\n  payload: unknown,\n  rpcId: string,\n): Promise<RpcResponse<unknown>> {\n  const fallbackPageSizes = sessionHistoryFallbackPageSizes(payloadMaxMessages(payload))\n  return callHistoryWithRetry(callWithTimeout, payload, rpcId, fallbackPageSizes)\n}\n\nasync function callHistoryWithRetry(\n  callWithTimeout: (payload: unknown) => Promise<RpcResponse<unknown>>,\n  payload: unknown,\n  rpcId: string,\n  pageSizes: readonly number[],\n): Promise<RpcResponse<unknown>> {\n  for (const maxMessages of pageSizes) {\n    const requestPayload = historyRequestPayload(payload, maxMessages)\n    const response = await callWithTimeout(requestPayload)\n    const request = createRpcResponse(rpcId, response.result)\n    if (encodeMessage(request).byteLength <= MAX_SECURE_MESSAGE_BYTES) return response\n    if (maxMessages === pageSizes[pageSizes.length - 1]) {\n      throw new RpcError(\n        'RESPONSE_TOO_LARGE',\n        'The Host response is too large for the remote channel. Request a smaller page.',\n        { maxBytes: MAX_SECURE_MESSAGE_BYTES },\n        true,\n      )\n    }\n  }\n  throw new RpcError('INTERNAL_ERROR', 'Failed to load session history with a fallback page size.')\n}\n\nfunction sessionHistoryFallbackPageSizes(requestedMaxMessages: number | undefined): readonly number[] {\n  const requested = normalizeSessionHistoryPageSize(requestedMaxMessages)\n  const sizes: number[] = []\n  if (requested === undefined) {\n    sizes.push(...SESSION_HISTORY_PAGE_SIZES)\n    return sizes\n  }\n  sizes.push(requested)\n  for (const value of SESSION_HISTORY_PAGE_SIZES) {\n    if (value < requested && !sizes.includes(value)) sizes.push(value)\n  }\n  return sizes\n}\n\nfunction normalizeSessionHistoryPageSize(value: number | undefined): number | undefined {\n  if (value === undefined) return undefined\n  if (!Number.isInteger(value)) return undefined\n  if (value <= 0) return undefined\n  return Math.max(1, value)\n}\n\nfunction payloadMaxMessages(payload: unknown): number | undefined {\n  if (payload === null || typeof payload !== 'object') return undefined\n  const value = (payload as { maxMessages?: unknown }).maxMessages\n  return typeof value === 'number' && Number.isInteger(value) && value > 0 ? value : undefined\n}\n\nfunction historyRequestPayload(payload: unknown, maxMessages: number): unknown {\n  if (payload === null || typeof payload !== 'object' || Array.isArray(payload)) return { maxMessages }\n  return { ...payload, maxMessages }\n}\n\nfunction withTimeout<T>(promise: Promise<T>, ms: number, message: string): Promise<T> {\n  return new Promise<T>((resolve, reject) => {\n    const timer = setTimeout(() => {\n      reject(new RpcError('TIMEOUT', message, undefined, true))\n    }, ms)\n    timer.unref?.()\n    promise.then(\n      value => { clearTimeout(timer); resolve(value) },\n      error => { clearTimeout(timer); reject(error) },\n    )\n  })\n}\n\nfunction shortId(value: string): string { return value.length <= 12 ? value : `${value.slice(0, 8)}\u2026${value.slice(-4)}` }\n", "/**\n * werift-backed Node RTC factory (webrtc-implementation-plan.md \u00A76.2).\n *\n * werift is a pure-TypeScript WebRTC implementation with no native addons, so\n * it installs and runs on Linux x64/ARM64 without toolchains. The factory is\n * loaded lazily: `loadWeriftFactory` dynamically imports werift on first use,\n * keeping DSH startup time and memory unaffected for hosts that never receive\n * a WebRTC offer (or run with `forceRelay`).\n */\n\nimport { networkInterfaces } from 'node:os'\nimport type {\n  RtcDataChannel,\n  RtcIceCandidateInit,\n  RtcIceServer,\n  RtcPeerConnection,\n  RtcPeerConnectionFactory,\n  RtcStats,\n} from '@dsh-remote/webrtc'\n\ninterface WeriftModule {\n  RTCPeerConnection: new (config?: WeriftConfig) => WeriftPeerConnection\n}\n\ninterface WeriftConfig {\n  iceServers?: Array<{ urls: string | string[]; username?: string; credential?: string }>\n  iceUseIpv6?: boolean\n  iceUseLinkLocalAddress?: boolean\n  iceInterfaceAddresses?: { udp4?: string; udp6?: string }\n}\n\ninterface WeriftPeerConnection {\n  connectionState: string\n  iceConnectionState: string\n  iceGatheringState: string\n  signalingState: string\n  onconnectionstatechange: (() => void) | null\n  oniceconnectionstatechange: (() => void) | null\n  onicegatheringstatechange: (() => void) | null\n  onicecandidate: ((event: { candidate?: { toJSON(): RtcIceCandidateInit } }) => void) | null\n  ondatachannel: ((event: { channel: WeriftDataChannel }) => void) | null\n  createDataChannel(label: string, options: { ordered: boolean }): WeriftDataChannel\n  createOffer(): Promise<{ type: 'offer' | 'answer'; sdp: string }>\n  createAnswer(): Promise<{ type: 'offer' | 'answer'; sdp: string }>\n  setLocalDescription(description?: { type: string; sdp?: string }): Promise<unknown>\n  setRemoteDescription(description: { type: string; sdp?: string }): Promise<void>\n  addIceCandidate(candidate?: RtcIceCandidateInit | null): Promise<void>\n  getStats(): Promise<RtcStats>\n  close(): Promise<void>\n}\n\ninterface WeriftDataChannel {\n  readonly label: string\n  readonly ordered: boolean\n  readyState: string\n  bufferedAmount: number\n  onopen: (() => void) | null\n  onclose: (() => void) | null\n  onerror: (() => void) | null\n  onmessage: ((event: { data: string | Uint8Array }) => void) | null\n  send(data: Buffer | string): void\n  close(): void\n}\n\nlet cachedFactory: RtcPeerConnectionFactory | undefined\n\n/** Load (once) a werift-backed factory, or `undefined` when it cannot be loaded. */\nexport async function loadWeriftFactory(): Promise<RtcPeerConnectionFactory | undefined> {\n  if (cachedFactory !== undefined) return cachedFactory\n  try {\n    const werift = (await import('werift')) as unknown as WeriftModule\n    cachedFactory = buildWeriftFactory(werift)\n    return cachedFactory\n  } catch {\n    return undefined\n  }\n}\n\n/** Synchronous factory for tests and callers that already resolved werift. */\nexport function buildWeriftFactory(werift: WeriftModule): RtcPeerConnectionFactory {\n  return {\n    create(configuration) {\n      const hostIpv4 = detectHostIpv4()\n      const raw = new werift.RTCPeerConnection({\n        iceServers: (configuration.iceServers ?? []) as RtcIceServer[],\n        iceUseIpv6: false,\n        iceUseLinkLocalAddress: false,\n        ...(hostIpv4 === undefined ? {} : { iceInterfaceAddresses: { udp4: hostIpv4 } }),\n      })\n\n      let onIceCandidate: ((event: { candidate: RtcIceCandidateInit | null }) => void) | null = null\n      let onDataChannel: ((event: { channel: RtcDataChannel }) => void) | null = null\n      raw.onicecandidate = event => {\n        if (onIceCandidate === null) return\n        onIceCandidate({ candidate: event.candidate === undefined ? null : event.candidate.toJSON() })\n      }\n      raw.ondatachannel = event => {\n        if (onDataChannel === null) return\n        onDataChannel({ channel: adaptDataChannel(event.channel) })\n      }\n\n      const pc: RtcPeerConnection = {\n        get connectionState(): string { return raw.connectionState },\n        get iceConnectionState(): string { return raw.iceConnectionState },\n        get iceGatheringState(): string { return raw.iceGatheringState },\n        get signalingState(): string { return raw.signalingState },\n        set onconnectionstatechange(value) { raw.onconnectionstatechange = value },\n        get onconnectionstatechange() { return raw.onconnectionstatechange },\n        set oniceconnectionstatechange(value) { raw.oniceconnectionstatechange = value },\n        get oniceconnectionstatechange() { return raw.oniceconnectionstatechange },\n        set onicegatheringstatechange(value) { raw.onicegatheringstatechange = value },\n        get onicegatheringstatechange() { return raw.onicegatheringstatechange },\n        set onicecandidate(value) { onIceCandidate = value },\n        get onicecandidate() { return onIceCandidate },\n        set ondatachannel(value) { onDataChannel = value },\n        get ondatachannel() { return onDataChannel },\n        createDataChannel(label, options) {\n          return adaptDataChannel(raw.createDataChannel(label, { ordered: options?.ordered ?? true }))\n        },\n        createOffer() { return raw.createOffer() },\n        createAnswer() { return raw.createAnswer() },\n        setLocalDescription(description) { return raw.setLocalDescription(description).then(() => undefined) },\n        setRemoteDescription(description) { return raw.setRemoteDescription(description) },\n        addIceCandidate(candidate) { return raw.addIceCandidate(candidate) },\n        getStats() { return raw.getStats() },\n        close() { void raw.close().catch(() => undefined) },\n      }\n      return pc\n    },\n  }\n}\n\nfunction adaptDataChannel(raw: WeriftDataChannel): RtcDataChannel {\n  return {\n    get label(): string { return raw.label },\n    get ordered(): boolean { return raw.ordered },\n    get readyState() { return raw.readyState as RtcDataChannel['readyState'] },\n    get bufferedAmount(): number { return raw.bufferedAmount },\n    binaryType: 'arraybuffer',\n    set onopen(value: (() => void) | null) { raw.onopen = value },\n    get onopen(): (() => void) | null { return raw.onopen },\n    set onmessage(value: ((event: { data: ArrayBuffer | string }) => void) | null) {\n      raw.onmessage = value === null ? null : event => value({ data: toArrayBuffer(event.data) })\n    },\n    get onmessage(): ((event: { data: ArrayBuffer | string }) => void) | null { return null },\n    set onclose(value: (() => void) | null) { raw.onclose = value },\n    get onclose(): (() => void) | null { return raw.onclose },\n    set onerror(value: (() => void) | null) { raw.onerror = value },\n    get onerror(): (() => void) | null { return raw.onerror },\n    onbufferedamountlow: null,\n    send(data: ArrayBuffer | string) {\n      const bytes = typeof data === 'string' ? Buffer.byteLength(data) : data.byteLength\n      try {\n        raw.send(typeof data === 'string' ? data : Buffer.from(data))\n      } catch (error) {\n        console.error('[werift-send-error] bytes=' + bytes, error instanceof Error ? error.message : error)\n        throw error\n      }\n    },\n    close() { raw.close() },\n  }\n}\n\nfunction toArrayBuffer(data: string | Uint8Array): ArrayBuffer | string {\n  if (typeof data === 'string') return data\n  // `Buffer.prototype.slice()` (unlike `Uint8Array.prototype.slice()`) returns a\n  // *view* over the pooled 8 KiB receive buffer, so slicing the underlying\n  // ArrayBuffer by byte offset/length is required to extract just the message.\n  return data.buffer.slice(data.byteOffset, data.byteOffset + data.byteLength) as ArrayBuffer\n}\n\n/**\n * Pick the single best IPv4 host address for ICE gathering.\n *\n * On macOS a host exposes many interfaces (WiFi `en0`, Thunderbolt `en1-4`,\n * `bridge*`, Apple Wireless Direct Link `awdl0`/`llw0`, and several VPN `utun*`\n * tunnels whose small MTUs drop large SCTP packets). Gathering a candidate for\n * every interface lets ICE select a bad path. Restrict werift to one real\n * interface and disable IPv6/link-local so the DataChannel rides the same\n * interface as the Server control connection.\n */\nfunction detectHostIpv4(): string | undefined {\n  const preferred: string[] = []\n  const fallback: string[] = []\n  for (const [name, addresses] of Object.entries(networkInterfaces())) {\n    if (isVirtualInterface(name)) continue\n    for (const address of addresses ?? []) {\n      if (address.internal || address.family !== 'IPv4') continue\n      const ip = address.address\n      if (ip.startsWith('127.') || ip.startsWith('169.254.') || isCgnat(ip)) continue\n      if (isPrivate(ip)) preferred.push(ip)\n      else fallback.push(ip)\n    }\n  }\n  return preferred[0] ?? fallback[0]\n}\n\nfunction isVirtualInterface(name: string): boolean {\n  return /^(utun|ppp|bridge|awdl|llw|gif|stf|anpi|ap\\d|en[1-9]\\d*$)/i.test(name)\n}\n\nfunction isCgnat(ip: string): boolean {\n  const parts = ip.split('.').map(Number)\n  return parts.length === 4 && parts[0] === 100 && parts[1] >= 64 && parts[1] <= 127\n}\n\nfunction isPrivate(ip: string): boolean {\n  const parts = ip.split('.').map(Number)\n  if (parts.length !== 4) return false\n  if (parts[0] === 10) return true\n  if (parts[0] === 192 && parts[1] === 168) return true\n  return parts[0] === 172 && parts[1] >= 16 && parts[1] <= 31\n}\n", "import type { ApiProxy } from '@deepseek-ai/dsh-host-apiproxy/api'\nimport { createEvent } from '@dsh-remote/protocol'\nimport { ConnectionController } from './connection-controller.js'\nimport type { ResolvedConfig } from './config.js'\nimport type { HostIdentity, IdentityStore } from './identity-store.js'\nimport type { SafeLogger } from './logging.js'\nimport { RpcRouter } from './rpc-router.js'\nimport { HostServerApi, ServerApiError, type DeviceAuthorization } from './server-api.js'\nimport { HostServerConnection } from './server-connection.js'\nimport { ServerCredentialStore } from './server-credentials.js'\nimport { HarnessApiBridge, type TypertGatewayLike } from './harness-api-bridge.js'\nimport { loadWeriftFactory } from './werift-rtc.js'\nimport type { AuthenticatedPeerChannel } from './types.js'\n\nexport interface HostRemoteStatus {\n  deviceId?: string\n  configured: boolean\n  online: boolean\n  reconnecting: boolean\n  lastActiveAt?: number\n  error?: string\n  account?: string\n  authorized: boolean\n  accountRequired: boolean\n}\n\nexport class HostPluginRuntime {\n  readonly connections: ConnectionController\n  private identity?: HostIdentity\n  private readonly serverApi?: HostServerApi\n  private serverConnection?: HostServerConnection\n  private closed = false\n\n  constructor(\n    private readonly config: ResolvedConfig,\n    private readonly identities: IdentityStore,\n    apiProxy: ApiProxy,\n    private readonly logger: SafeLogger,\n    typertGateway?: () => TypertGatewayLike | undefined,\n  ) {\n    this.connections = new ConnectionController(this.identities, (_context, send) => {\n      const harnessApi = new HarnessApiBridge(\n        apiProxy,\n        (event, data) => send(createEvent(event, data)),\n        undefined,\n        this.logger,\n        typertGateway?.(),\n      )\n      return new RpcRouter(harnessApi, undefined, this.logger)\n    }, this.logger)\n    if (config.serverUrl !== undefined) {\n      this.serverApi = new HostServerApi(config.serverUrl, new ServerCredentialStore(identities.directory))\n    }\n  }\n\n  async start(): Promise<void> {\n    if (this.closed) throw new Error('remote runtime is closed')\n    this.identity = await this.identities.loadOrCreate(this.config.deviceName)\n    this.logger.info('host identity ready', {\n      deviceId: shortId(this.identity.deviceId),\n      fingerprint: this.identity.fingerprint,\n      server: this.config.serverUrl ?? 'not configured',\n    })\n    if (this.serverApi !== undefined) {\n      this.serverApi.bindIdentity(this.identity)\n      this.serverConnection = this.createServerConnection(this.identity)\n      this.serverConnection.start()\n    }\n  }\n\n  currentIdentity(): HostIdentity {\n    if (this.identity === undefined) throw new Error('remote runtime has not started')\n    return this.identity\n  }\n\n  acceptAuthenticatedPeer(channel: AuthenticatedPeerChannel): Promise<void> {\n    this.currentIdentity()\n    return this.connections.accept(channel)\n  }\n\n  hostStatus(): HostRemoteStatus {\n    const error = this.serverConnection?.lastError()\n    const authorization = this.serverApi?.currentAuthorization()\n    return {\n      ...(this.identity === undefined ? {} : { deviceId: this.identity.deviceId }),\n      configured: this.serverApi !== undefined,\n      online: this.serverConnection?.isOnline() ?? false,\n      reconnecting: this.serverConnection?.isReconnecting() ?? false,\n      ...(this.serverConnection?.lastActivity() === undefined\n        ? {}\n        : { lastActiveAt: this.serverConnection.lastActivity() }),\n      ...(error === undefined ? {} : { error }),\n      ...(authorization?.account === undefined ? {} : { account: authorization.account }),\n      authorized: authorization !== undefined,\n      accountRequired: error === 'ACCOUNT_AUTH_REQUIRED' || error === 'AUTH_INVALID' || error === 'TOKEN_EXPIRED',\n    }\n  }\n\n  reconnectHost(): void {\n    if (this.closed) throw new Error('remote runtime is closed')\n    if (this.serverConnection === undefined) {\n      throw new ServerApiError('SERVER_NOT_CONFIGURED', 'Configure serverUrl before reconnecting.', false)\n    }\n    this.serverConnection.reconnect()\n  }\n\n  async clearHostAuthorization(): Promise<void> {\n    await this.serverConnection?.stop()\n    await this.serverApi?.revokeCurrentDevice()\n    this.identity = await this.identities.reset(this.config.deviceName)\n    this.serverApi?.bindIdentity(this.identity)\n    if (this.serverApi !== undefined) this.serverConnection = this.createServerConnection(this.identity)\n    this.logger.info('Host authorization cleared')\n  }\n\n  async authorizeHostAsOwned(accessToken: string, account?: string): Promise<DeviceAuthorization> {\n    if (this.serverApi === undefined) {\n      throw new ServerApiError('SERVER_NOT_CONFIGURED', 'Configure serverUrl before enabling Host access.', false)\n    }\n    let result\n    try {\n      result = await this.serverApi.authorizeOwnedRole(this.currentIdentity(), accessToken, account)\n    } catch (error) {\n      if (!(error instanceof ServerApiError) || error.code !== 'DEVICE_REVOKED') throw error\n      await this.serverConnection?.stop()\n      this.identity = await this.identities.reset(this.config.deviceName)\n      this.serverApi.bindIdentity(this.identity)\n      this.serverConnection = this.createServerConnection(this.identity)\n      result = await this.serverApi.authorizeOwnedRole(this.identity, accessToken, account)\n      this.logger.info('Rotated revoked Host identity before owned-device authorization')\n    }\n    this.serverConnection?.resume()\n    this.logger.info('Host authorized as an owned device')\n    return result\n  }\n\n  async authorizeHostWithAccount(email: string, password: string): Promise<DeviceAuthorization> {\n    if (this.serverApi === undefined) {\n      throw new ServerApiError('SERVER_NOT_CONFIGURED', 'Configure serverUrl before signing in.', false)\n    }\n    const result = await this.serverApi.authorizeWithAccount(this.currentIdentity(), email, password)\n    this.serverConnection?.resume()\n    this.logger.info('Host account authorized')\n    return result\n  }\n\n  async authorizeHostWithCode(code: string): Promise<DeviceAuthorization> {\n    if (this.serverApi === undefined) {\n      throw new ServerApiError('SERVER_NOT_CONFIGURED', 'Configure serverUrl before entering a Host registration code.', false)\n    }\n    const result = await this.serverApi.authorizeHostWithCode(this.currentIdentity(), code)\n    this.serverConnection?.resume()\n    this.logger.info('Host registration code authorized')\n    return result\n  }\n\n  async revokePeer(deviceId: string): Promise<boolean> {\n    const revoked = await this.identities.revokePeer(deviceId)\n    if (revoked) await this.connections.revoke(deviceId)\n    return revoked\n  }\n\n  async close(): Promise<void> {\n    if (this.closed) return\n    this.closed = true\n    await this.serverConnection?.stop()\n    await this.connections.close()\n    this.logger.info('host runtime stopped')\n  }\n\n  diagnostics() {\n    return {\n      loaded: this.identity !== undefined,\n      deviceId: this.identity === undefined ? undefined : shortId(this.identity.deviceId),\n      identityValid: this.identity !== undefined,\n      serverConfigured: this.config.serverUrl !== undefined,\n      serverOnline: this.serverConnection?.isOnline() ?? false,\n      serverError: this.serverConnection?.lastError(),\n      online: this.connections.isOnline(),\n      activeConnections: this.connections.connectionCount(),\n      peerDeviceId: this.connections.peerDeviceId() === undefined ? undefined : shortId(this.connections.peerDeviceId()!),\n      peerDeviceIds: this.connections.peerDeviceIds().map(shortId),\n      trustedPeers: this.identities.listTrustedPeers().length,\n    }\n  }\n\n  private createServerConnection(identity: HostIdentity): HostServerConnection {\n    return new HostServerConnection(\n      this.config,\n      identity,\n      this.identities,\n      this.serverApi!,\n      this.connections,\n      this.logger,\n      undefined,\n      this.config.forceRelay ? undefined : loadWeriftFactory,\n    )\n  }\n}\n\nfunction shortId(value: string): string { return value.length <= 12 ? value : `${value.slice(0, 8)}\u2026${value.slice(-4)}` }\n"],
+  "mappings": ";;;;;;;AAEA,SAAS,yBAA6C;;;ACFtD;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;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;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;AAAA;;;ACAO,IAAI;AAAA,CACV,SAAUA,OAAM;AACb,EAAAA,MAAK,cAAc,CAAC,MAAM;AAAA,EAAE;AAC5B,WAAS,SAAS,MAAM;AAAA,EAAE;AAC1B,EAAAA,MAAK,WAAW;AAChB,WAAS,YAAY,IAAI;AACrB,UAAM,IAAI,MAAM;AAAA,EACpB;AACA,EAAAA,MAAK,cAAc;AACnB,EAAAA,MAAK,cAAc,CAAC,UAAU;AAC1B,UAAM,MAAM,CAAC;AACb,eAAW,QAAQ,OAAO;AACtB,UAAI,IAAI,IAAI;AAAA,IAChB;AACA,WAAO;AAAA,EACX;AACA,EAAAA,MAAK,qBAAqB,CAAC,QAAQ;AAC/B,UAAM,YAAYA,MAAK,WAAW,GAAG,EAAE,OAAO,CAAC,MAAM,OAAO,IAAI,IAAI,CAAC,CAAC,MAAM,QAAQ;AACpF,UAAM,WAAW,CAAC;AAClB,eAAW,KAAK,WAAW;AACvB,eAAS,CAAC,IAAI,IAAI,CAAC;AAAA,IACvB;AACA,WAAOA,MAAK,aAAa,QAAQ;AAAA,EACrC;AACA,EAAAA,MAAK,eAAe,CAAC,QAAQ;AACzB,WAAOA,MAAK,WAAW,GAAG,EAAE,IAAI,SAAU,GAAG;AACzC,aAAO,IAAI,CAAC;AAAA,IAChB,CAAC;AAAA,EACL;AACA,EAAAA,MAAK,aAAa,OAAO,OAAO,SAAS,aACnC,CAAC,QAAQ,OAAO,KAAK,GAAG,IACxB,CAAC,WAAW;AACV,UAAM,OAAO,CAAC;AACd,eAAW,OAAO,QAAQ;AACtB,UAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;AACnD,aAAK,KAAK,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ,EAAAA,MAAK,OAAO,CAAC,KAAK,YAAY;AAC1B,eAAW,QAAQ,KAAK;AACpB,UAAI,QAAQ,IAAI;AACZ,eAAO;AAAA,IACf;AACA,WAAO;AAAA,EACX;AACA,EAAAA,MAAK,YAAY,OAAO,OAAO,cAAc,aACvC,CAAC,QAAQ,OAAO,UAAU,GAAG,IAC7B,CAAC,QAAQ,OAAO,QAAQ,YAAY,OAAO,SAAS,GAAG,KAAK,KAAK,MAAM,GAAG,MAAM;AACtF,WAAS,WAAW,OAAO,YAAY,OAAO;AAC1C,WAAO,MAAM,IAAI,CAAC,QAAS,OAAO,QAAQ,WAAW,IAAI,GAAG,MAAM,GAAI,EAAE,KAAK,SAAS;AAAA,EAC1F;AACA,EAAAA,MAAK,aAAa;AAClB,EAAAA,MAAK,wBAAwB,CAAC,GAAG,UAAU;AACvC,QAAI,OAAO,UAAU,UAAU;AAC3B,aAAO,MAAM,SAAS;AAAA,IAC1B;AACA,WAAO;AAAA,EACX;AACJ,GAAG,SAAS,OAAO,CAAC,EAAE;AACf,IAAI;AAAA,CACV,SAAUC,aAAY;AACnB,EAAAA,YAAW,cAAc,CAAC,OAAO,WAAW;AACxC,WAAO;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA;AAAA,IACP;AAAA,EACJ;AACJ,GAAG,eAAe,aAAa,CAAC,EAAE;AAC3B,IAAM,gBAAgB,KAAK,YAAY;AAAA,EAC1C;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;AACM,IAAM,gBAAgB,CAAC,SAAS;AACnC,QAAM,IAAI,OAAO;AACjB,UAAQ,GAAG;AAAA,IACP,KAAK;AACD,aAAO,cAAc;AAAA,IACzB,KAAK;AACD,aAAO,cAAc;AAAA,IACzB,KAAK;AACD,aAAO,OAAO,MAAM,IAAI,IAAI,cAAc,MAAM,cAAc;AAAA,IAClE,KAAK;AACD,aAAO,cAAc;AAAA,IACzB,KAAK;AACD,aAAO,cAAc;AAAA,IACzB,KAAK;AACD,aAAO,cAAc;AAAA,IACzB,KAAK;AACD,aAAO,cAAc;AAAA,IACzB,KAAK;AACD,UAAI,MAAM,QAAQ,IAAI,GAAG;AACrB,eAAO,cAAc;AAAA,MACzB;AACA,UAAI,SAAS,MAAM;AACf,eAAO,cAAc;AAAA,MACzB;AACA,UAAI,KAAK,QAAQ,OAAO,KAAK,SAAS,cAAc,KAAK,SAAS,OAAO,KAAK,UAAU,YAAY;AAChG,eAAO,cAAc;AAAA,MACzB;AACA,UAAI,OAAO,QAAQ,eAAe,gBAAgB,KAAK;AACnD,eAAO,cAAc;AAAA,MACzB;AACA,UAAI,OAAO,QAAQ,eAAe,gBAAgB,KAAK;AACnD,eAAO,cAAc;AAAA,MACzB;AACA,UAAI,OAAO,SAAS,eAAe,gBAAgB,MAAM;AACrD,eAAO,cAAc;AAAA,MACzB;AACA,aAAO,cAAc;AAAA,IACzB;AACI,aAAO,cAAc;AAAA,EAC7B;AACJ;;;ACnIO,IAAM,eAAe,KAAK,YAAY;AAAA,EACzC;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;AACM,IAAM,gBAAgB,CAAC,QAAQ;AAClC,QAAM,OAAO,KAAK,UAAU,KAAK,MAAM,CAAC;AACxC,SAAO,KAAK,QAAQ,eAAe,KAAK;AAC5C;AACO,IAAM,WAAN,MAAM,kBAAiB,MAAM;AAAA,EAChC,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,YAAY,QAAQ;AAChB,UAAM;AACN,SAAK,SAAS,CAAC;AACf,SAAK,WAAW,CAAC,QAAQ;AACrB,WAAK,SAAS,CAAC,GAAG,KAAK,QAAQ,GAAG;AAAA,IACtC;AACA,SAAK,YAAY,CAAC,OAAO,CAAC,MAAM;AAC5B,WAAK,SAAS,CAAC,GAAG,KAAK,QAAQ,GAAG,IAAI;AAAA,IAC1C;AACA,UAAM,cAAc,WAAW;AAC/B,QAAI,OAAO,gBAAgB;AAEvB,aAAO,eAAe,MAAM,WAAW;AAAA,IAC3C,OACK;AACD,WAAK,YAAY;AAAA,IACrB;AACA,SAAK,OAAO;AACZ,SAAK,SAAS;AAAA,EAClB;AAAA,EACA,OAAO,SAAS;AACZ,UAAM,SAAS,WACX,SAAU,OAAO;AACb,aAAO,MAAM;AAAA,IACjB;AACJ,UAAM,cAAc,EAAE,SAAS,CAAC,EAAE;AAClC,UAAM,eAAe,CAAC,UAAU;AAC5B,iBAAW,SAAS,MAAM,QAAQ;AAC9B,YAAI,MAAM,SAAS,iBAAiB;AAChC,gBAAM,YAAY,IAAI,YAAY;AAAA,QACtC,WACS,MAAM,SAAS,uBAAuB;AAC3C,uBAAa,MAAM,eAAe;AAAA,QACtC,WACS,MAAM,SAAS,qBAAqB;AACzC,uBAAa,MAAM,cAAc;AAAA,QACrC,WACS,MAAM,KAAK,WAAW,GAAG;AAC9B,sBAAY,QAAQ,KAAK,OAAO,KAAK,CAAC;AAAA,QAC1C,OACK;AACD,cAAI,OAAO;AACX,cAAI,IAAI;AACR,iBAAO,IAAI,MAAM,KAAK,QAAQ;AAC1B,kBAAM,KAAK,MAAM,KAAK,CAAC;AACvB,kBAAM,WAAW,MAAM,MAAM,KAAK,SAAS;AAC3C,gBAAI,CAAC,UAAU;AACX,mBAAK,EAAE,IAAI,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE;AAAA,YAQzC,OACK;AACD,mBAAK,EAAE,IAAI,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE;AACrC,mBAAK,EAAE,EAAE,QAAQ,KAAK,OAAO,KAAK,CAAC;AAAA,YACvC;AACA,mBAAO,KAAK,EAAE;AACd;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,iBAAa,IAAI;AACjB,WAAO;AAAA,EACX;AAAA,EACA,OAAO,OAAO,OAAO;AACjB,QAAI,EAAE,iBAAiB,YAAW;AAC9B,YAAM,IAAI,MAAM,mBAAmB,KAAK,EAAE;AAAA,IAC9C;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,UAAU,KAAK,QAAQ,KAAK,uBAAuB,CAAC;AAAA,EACpE;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,OAAO,WAAW;AAAA,EAClC;AAAA,EACA,QAAQ,SAAS,CAAC,UAAU,MAAM,SAAS;AACvC,UAAM,cAAc,CAAC;AACrB,UAAM,aAAa,CAAC;AACpB,eAAW,OAAO,KAAK,QAAQ;AAC3B,UAAI,IAAI,KAAK,SAAS,GAAG;AACrB,cAAM,UAAU,IAAI,KAAK,CAAC;AAC1B,oBAAY,OAAO,IAAI,YAAY,OAAO,KAAK,CAAC;AAChD,oBAAY,OAAO,EAAE,KAAK,OAAO,GAAG,CAAC;AAAA,MACzC,OACK;AACD,mBAAW,KAAK,OAAO,GAAG,CAAC;AAAA,MAC/B;AAAA,IACJ;AACA,WAAO,EAAE,YAAY,YAAY;AAAA,EACrC;AAAA,EACA,IAAI,aAAa;AACb,WAAO,KAAK,QAAQ;AAAA,EACxB;AACJ;AACA,SAAS,SAAS,CAAC,WAAW;AAC1B,QAAM,QAAQ,IAAI,SAAS,MAAM;AACjC,SAAO;AACX;;;AClIA,IAAM,WAAW,CAAC,OAAO,SAAS;AAC9B,MAAI;AACJ,UAAQ,MAAM,MAAM;AAAA,IAChB,KAAK,aAAa;AACd,UAAI,MAAM,aAAa,cAAc,WAAW;AAC5C,kBAAU;AAAA,MACd,OACK;AACD,kBAAU,YAAY,MAAM,QAAQ,cAAc,MAAM,QAAQ;AAAA,MACpE;AACA;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU,mCAAmC,KAAK,UAAU,MAAM,UAAU,KAAK,qBAAqB,CAAC;AACvG;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU,kCAAkC,KAAK,WAAW,MAAM,MAAM,IAAI,CAAC;AAC7E;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU;AACV;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU,yCAAyC,KAAK,WAAW,MAAM,OAAO,CAAC;AACjF;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU,gCAAgC,KAAK,WAAW,MAAM,OAAO,CAAC,eAAe,MAAM,QAAQ;AACrG;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU;AACV;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU;AACV;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU;AACV;AAAA,IACJ,KAAK,aAAa;AACd,UAAI,OAAO,MAAM,eAAe,UAAU;AACtC,YAAI,cAAc,MAAM,YAAY;AAChC,oBAAU,gCAAgC,MAAM,WAAW,QAAQ;AACnE,cAAI,OAAO,MAAM,WAAW,aAAa,UAAU;AAC/C,sBAAU,GAAG,OAAO,sDAAsD,MAAM,WAAW,QAAQ;AAAA,UACvG;AAAA,QACJ,WACS,gBAAgB,MAAM,YAAY;AACvC,oBAAU,mCAAmC,MAAM,WAAW,UAAU;AAAA,QAC5E,WACS,cAAc,MAAM,YAAY;AACrC,oBAAU,iCAAiC,MAAM,WAAW,QAAQ;AAAA,QACxE,OACK;AACD,eAAK,YAAY,MAAM,UAAU;AAAA,QACrC;AAAA,MACJ,WACS,MAAM,eAAe,SAAS;AACnC,kBAAU,WAAW,MAAM,UAAU;AAAA,MACzC,OACK;AACD,kBAAU;AAAA,MACd;AACA;AAAA,IACJ,KAAK,aAAa;AACd,UAAI,MAAM,SAAS;AACf,kBAAU,sBAAsB,MAAM,QAAQ,YAAY,MAAM,YAAY,aAAa,WAAW,IAAI,MAAM,OAAO;AAAA,eAChH,MAAM,SAAS;AACpB,kBAAU,uBAAuB,MAAM,QAAQ,YAAY,MAAM,YAAY,aAAa,MAAM,IAAI,MAAM,OAAO;AAAA,eAC5G,MAAM,SAAS;AACpB,kBAAU,kBAAkB,MAAM,QAAQ,sBAAsB,MAAM,YAAY,8BAA8B,eAAe,GAAG,MAAM,OAAO;AAAA,eAC1I,MAAM,SAAS;AACpB,kBAAU,kBAAkB,MAAM,QAAQ,sBAAsB,MAAM,YAAY,8BAA8B,eAAe,GAAG,MAAM,OAAO;AAAA,eAC1I,MAAM,SAAS;AACpB,kBAAU,gBAAgB,MAAM,QAAQ,sBAAsB,MAAM,YAAY,8BAA8B,eAAe,GAAG,IAAI,KAAK,OAAO,MAAM,OAAO,CAAC,CAAC;AAAA;AAE/J,kBAAU;AACd;AAAA,IACJ,KAAK,aAAa;AACd,UAAI,MAAM,SAAS;AACf,kBAAU,sBAAsB,MAAM,QAAQ,YAAY,MAAM,YAAY,YAAY,WAAW,IAAI,MAAM,OAAO;AAAA,eAC/G,MAAM,SAAS;AACpB,kBAAU,uBAAuB,MAAM,QAAQ,YAAY,MAAM,YAAY,YAAY,OAAO,IAAI,MAAM,OAAO;AAAA,eAC5G,MAAM,SAAS;AACpB,kBAAU,kBAAkB,MAAM,QAAQ,YAAY,MAAM,YAAY,0BAA0B,WAAW,IAAI,MAAM,OAAO;AAAA,eACzH,MAAM,SAAS;AACpB,kBAAU,kBAAkB,MAAM,QAAQ,YAAY,MAAM,YAAY,0BAA0B,WAAW,IAAI,MAAM,OAAO;AAAA,eACzH,MAAM,SAAS;AACpB,kBAAU,gBAAgB,MAAM,QAAQ,YAAY,MAAM,YAAY,6BAA6B,cAAc,IAAI,IAAI,KAAK,OAAO,MAAM,OAAO,CAAC,CAAC;AAAA;AAEpJ,kBAAU;AACd;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU;AACV;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU;AACV;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU,gCAAgC,MAAM,UAAU;AAC1D;AAAA,IACJ,KAAK,aAAa;AACd,gBAAU;AACV;AAAA,IACJ;AACI,gBAAU,KAAK;AACf,WAAK,YAAY,KAAK;AAAA,EAC9B;AACA,SAAO,EAAE,QAAQ;AACrB;AACA,IAAO,aAAQ;;;AC3Gf,IAAI,mBAAmB;AAEhB,SAAS,YAAY,KAAK;AAC7B,qBAAmB;AACvB;AACO,SAAS,cAAc;AAC1B,SAAO;AACX;;;ACNO,IAAM,YAAY,CAAC,WAAW;AACjC,QAAM,EAAE,MAAM,MAAM,WAAW,UAAU,IAAI;AAC7C,QAAM,WAAW,CAAC,GAAG,MAAM,GAAI,UAAU,QAAQ,CAAC,CAAE;AACpD,QAAM,YAAY;AAAA,IACd,GAAG;AAAA,IACH,MAAM;AAAA,EACV;AACA,MAAI,UAAU,YAAY,QAAW;AACjC,WAAO;AAAA,MACH,GAAG;AAAA,MACH,MAAM;AAAA,MACN,SAAS,UAAU;AAAA,IACvB;AAAA,EACJ;AACA,MAAI,eAAe;AACnB,QAAM,OAAO,UACR,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EACjB,MAAM,EACN,QAAQ;AACb,aAAW,OAAO,MAAM;AACpB,mBAAe,IAAI,WAAW,EAAE,MAAM,cAAc,aAAa,CAAC,EAAE;AAAA,EACxE;AACA,SAAO;AAAA,IACH,GAAG;AAAA,IACH,MAAM;AAAA,IACN,SAAS;AAAA,EACb;AACJ;AACO,IAAM,aAAa,CAAC;AACpB,SAAS,kBAAkB,KAAK,WAAW;AAC9C,QAAM,cAAc,YAAY;AAChC,QAAM,QAAQ,UAAU;AAAA,IACpB;AAAA,IACA,MAAM,IAAI;AAAA,IACV,MAAM,IAAI;AAAA,IACV,WAAW;AAAA,MACP,IAAI,OAAO;AAAA;AAAA,MACX,IAAI;AAAA;AAAA,MACJ;AAAA;AAAA,MACA,gBAAgB,aAAkB,SAAY;AAAA;AAAA,IAClD,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AAAA,EACvB,CAAC;AACD,MAAI,OAAO,OAAO,KAAK,KAAK;AAChC;AACO,IAAM,cAAN,MAAM,aAAY;AAAA,EACrB,cAAc;AACV,SAAK,QAAQ;AAAA,EACjB;AAAA,EACA,QAAQ;AACJ,QAAI,KAAK,UAAU;AACf,WAAK,QAAQ;AAAA,EACrB;AAAA,EACA,QAAQ;AACJ,QAAI,KAAK,UAAU;AACf,WAAK,QAAQ;AAAA,EACrB;AAAA,EACA,OAAO,WAAW,QAAQ,SAAS;AAC/B,UAAM,aAAa,CAAC;AACpB,eAAWC,MAAK,SAAS;AACrB,UAAIA,GAAE,WAAW;AACb,eAAO;AACX,UAAIA,GAAE,WAAW;AACb,eAAO,MAAM;AACjB,iBAAW,KAAKA,GAAE,KAAK;AAAA,IAC3B;AACA,WAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,WAAW;AAAA,EACrD;AAAA,EACA,aAAa,iBAAiB,QAAQ,OAAO;AACzC,UAAM,YAAY,CAAC;AACnB,eAAW,QAAQ,OAAO;AACtB,YAAM,MAAM,MAAM,KAAK;AACvB,YAAM,QAAQ,MAAM,KAAK;AACzB,gBAAU,KAAK;AAAA,QACX;AAAA,QACA;AAAA,MACJ,CAAC;AAAA,IACL;AACA,WAAO,aAAY,gBAAgB,QAAQ,SAAS;AAAA,EACxD;AAAA,EACA,OAAO,gBAAgB,QAAQ,OAAO;AAClC,UAAM,cAAc,CAAC;AACrB,eAAW,QAAQ,OAAO;AACtB,YAAM,EAAE,KAAK,MAAM,IAAI;AACvB,UAAI,IAAI,WAAW;AACf,eAAO;AACX,UAAI,MAAM,WAAW;AACjB,eAAO;AACX,UAAI,IAAI,WAAW;AACf,eAAO,MAAM;AACjB,UAAI,MAAM,WAAW;AACjB,eAAO,MAAM;AACjB,UAAI,IAAI,UAAU,gBAAgB,OAAO,MAAM,UAAU,eAAe,KAAK,YAAY;AACrF,oBAAY,IAAI,KAAK,IAAI,MAAM;AAAA,MACnC;AAAA,IACJ;AACA,WAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,YAAY;AAAA,EACtD;AACJ;AACO,IAAM,UAAU,OAAO,OAAO;AAAA,EACjC,QAAQ;AACZ,CAAC;AACM,IAAM,QAAQ,CAAC,WAAW,EAAE,QAAQ,SAAS,MAAM;AACnD,IAAM,KAAK,CAAC,WAAW,EAAE,QAAQ,SAAS,MAAM;AAChD,IAAM,YAAY,CAAC,MAAM,EAAE,WAAW;AACtC,IAAM,UAAU,CAAC,MAAM,EAAE,WAAW;AACpC,IAAM,UAAU,CAAC,MAAM,EAAE,WAAW;AACpC,IAAM,UAAU,CAAC,MAAM,OAAO,YAAY,eAAe,aAAa;;;AC5GtE,IAAI;AAAA,CACV,SAAUC,YAAW;AAClB,EAAAA,WAAU,WAAW,CAAC,YAAY,OAAO,YAAY,WAAW,EAAE,QAAQ,IAAI,WAAW,CAAC;AAE1F,EAAAA,WAAU,WAAW,CAAC,YAAY,OAAO,YAAY,WAAW,UAAU,SAAS;AACvF,GAAG,cAAc,YAAY,CAAC,EAAE;;;ACAhC,IAAM,qBAAN,MAAyB;AAAA,EACrB,YAAY,QAAQ,OAAO,MAAM,KAAK;AAClC,SAAK,cAAc,CAAC;AACpB,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,OAAO;AAAA,EAChB;AAAA,EACA,IAAI,OAAO;AACP,QAAI,CAAC,KAAK,YAAY,QAAQ;AAC1B,UAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;AAC1B,aAAK,YAAY,KAAK,GAAG,KAAK,OAAO,GAAG,KAAK,IAAI;AAAA,MACrD,OACK;AACD,aAAK,YAAY,KAAK,GAAG,KAAK,OAAO,KAAK,IAAI;AAAA,MAClD;AAAA,IACJ;AACA,WAAO,KAAK;AAAA,EAChB;AACJ;AACA,IAAM,eAAe,CAAC,KAAK,WAAW;AAClC,MAAI,QAAQ,MAAM,GAAG;AACjB,WAAO,EAAE,SAAS,MAAM,MAAM,OAAO,MAAM;AAAA,EAC/C,OACK;AACD,QAAI,CAAC,IAAI,OAAO,OAAO,QAAQ;AAC3B,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC/D;AACA,WAAO;AAAA,MACH,SAAS;AAAA,MACT,IAAI,QAAQ;AACR,YAAI,KAAK;AACL,iBAAO,KAAK;AAChB,cAAM,QAAQ,IAAI,SAAS,IAAI,OAAO,MAAM;AAC5C,aAAK,SAAS;AACd,eAAO,KAAK;AAAA,MAChB;AAAA,IACJ;AAAA,EACJ;AACJ;AACA,SAAS,oBAAoB,QAAQ;AACjC,MAAI,CAAC;AACD,WAAO,CAAC;AACZ,QAAM,EAAE,UAAAC,WAAU,oBAAoB,gBAAgB,YAAY,IAAI;AACtE,MAAIA,cAAa,sBAAsB,iBAAiB;AACpD,UAAM,IAAI,MAAM,0FAA0F;AAAA,EAC9G;AACA,MAAIA;AACA,WAAO,EAAE,UAAUA,WAAU,YAAY;AAC7C,QAAM,YAAY,CAAC,KAAK,QAAQ;AAC5B,UAAM,EAAE,QAAQ,IAAI;AACpB,QAAI,IAAI,SAAS,sBAAsB;AACnC,aAAO,EAAE,SAAS,WAAW,IAAI,aAAa;AAAA,IAClD;AACA,QAAI,OAAO,IAAI,SAAS,aAAa;AACjC,aAAO,EAAE,SAAS,WAAW,kBAAkB,IAAI,aAAa;AAAA,IACpE;AACA,QAAI,IAAI,SAAS;AACb,aAAO,EAAE,SAAS,IAAI,aAAa;AACvC,WAAO,EAAE,SAAS,WAAW,sBAAsB,IAAI,aAAa;AAAA,EACxE;AACA,SAAO,EAAE,UAAU,WAAW,YAAY;AAC9C;AACO,IAAM,UAAN,MAAc;AAAA,EACjB,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,SAAS,OAAO;AACZ,WAAO,cAAc,MAAM,IAAI;AAAA,EACnC;AAAA,EACA,gBAAgB,OAAO,KAAK;AACxB,WAAQ,OAAO;AAAA,MACX,QAAQ,MAAM,OAAO;AAAA,MACrB,MAAM,MAAM;AAAA,MACZ,YAAY,cAAc,MAAM,IAAI;AAAA,MACpC,gBAAgB,KAAK,KAAK;AAAA,MAC1B,MAAM,MAAM;AAAA,MACZ,QAAQ,MAAM;AAAA,IAClB;AAAA,EACJ;AAAA,EACA,oBAAoB,OAAO;AACvB,WAAO;AAAA,MACH,QAAQ,IAAI,YAAY;AAAA,MACxB,KAAK;AAAA,QACD,QAAQ,MAAM,OAAO;AAAA,QACrB,MAAM,MAAM;AAAA,QACZ,YAAY,cAAc,MAAM,IAAI;AAAA,QACpC,gBAAgB,KAAK,KAAK;AAAA,QAC1B,MAAM,MAAM;AAAA,QACZ,QAAQ,MAAM;AAAA,MAClB;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,WAAW,OAAO;AACd,UAAM,SAAS,KAAK,OAAO,KAAK;AAChC,QAAI,QAAQ,MAAM,GAAG;AACjB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC5D;AACA,WAAO;AAAA,EACX;AAAA,EACA,YAAY,OAAO;AACf,UAAM,SAAS,KAAK,OAAO,KAAK;AAChC,WAAO,QAAQ,QAAQ,MAAM;AAAA,EACjC;AAAA,EACA,MAAM,MAAM,QAAQ;AAChB,UAAM,SAAS,KAAK,UAAU,MAAM,MAAM;AAC1C,QAAI,OAAO;AACP,aAAO,OAAO;AAClB,UAAM,OAAO;AAAA,EACjB;AAAA,EACA,UAAU,MAAM,QAAQ;AACpB,UAAM,MAAM;AAAA,MACR,QAAQ;AAAA,QACJ,QAAQ,CAAC;AAAA,QACT,OAAO,QAAQ,SAAS;AAAA,QACxB,oBAAoB,QAAQ;AAAA,MAChC;AAAA,MACA,MAAM,QAAQ,QAAQ,CAAC;AAAA,MACvB,gBAAgB,KAAK,KAAK;AAAA,MAC1B,QAAQ;AAAA,MACR;AAAA,MACA,YAAY,cAAc,IAAI;AAAA,IAClC;AACA,UAAM,SAAS,KAAK,WAAW,EAAE,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAI,CAAC;AACpE,WAAO,aAAa,KAAK,MAAM;AAAA,EACnC;AAAA,EACA,YAAY,MAAM;AACd,UAAM,MAAM;AAAA,MACR,QAAQ;AAAA,QACJ,QAAQ,CAAC;AAAA,QACT,OAAO,CAAC,CAAC,KAAK,WAAW,EAAE;AAAA,MAC/B;AAAA,MACA,MAAM,CAAC;AAAA,MACP,gBAAgB,KAAK,KAAK;AAAA,MAC1B,QAAQ;AAAA,MACR;AAAA,MACA,YAAY,cAAc,IAAI;AAAA,IAClC;AACA,QAAI,CAAC,KAAK,WAAW,EAAE,OAAO;AAC1B,UAAI;AACA,cAAM,SAAS,KAAK,WAAW,EAAE,MAAM,MAAM,CAAC,GAAG,QAAQ,IAAI,CAAC;AAC9D,eAAO,QAAQ,MAAM,IACf;AAAA,UACE,OAAO,OAAO;AAAA,QAClB,IACE;AAAA,UACE,QAAQ,IAAI,OAAO;AAAA,QACvB;AAAA,MACR,SACO,KAAK;AACR,YAAI,KAAK,SAAS,YAAY,GAAG,SAAS,aAAa,GAAG;AACtD,eAAK,WAAW,EAAE,QAAQ;AAAA,QAC9B;AACA,YAAI,SAAS;AAAA,UACT,QAAQ,CAAC;AAAA,UACT,OAAO;AAAA,QACX;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,KAAK,YAAY,EAAE,MAAM,MAAM,CAAC,GAAG,QAAQ,IAAI,CAAC,EAAE,KAAK,CAAC,WAAW,QAAQ,MAAM,IAClF;AAAA,MACE,OAAO,OAAO;AAAA,IAClB,IACE;AAAA,MACE,QAAQ,IAAI,OAAO;AAAA,IACvB,CAAC;AAAA,EACT;AAAA,EACA,MAAM,WAAW,MAAM,QAAQ;AAC3B,UAAM,SAAS,MAAM,KAAK,eAAe,MAAM,MAAM;AACrD,QAAI,OAAO;AACP,aAAO,OAAO;AAClB,UAAM,OAAO;AAAA,EACjB;AAAA,EACA,MAAM,eAAe,MAAM,QAAQ;AAC/B,UAAM,MAAM;AAAA,MACR,QAAQ;AAAA,QACJ,QAAQ,CAAC;AAAA,QACT,oBAAoB,QAAQ;AAAA,QAC5B,OAAO;AAAA,MACX;AAAA,MACA,MAAM,QAAQ,QAAQ,CAAC;AAAA,MACvB,gBAAgB,KAAK,KAAK;AAAA,MAC1B,QAAQ;AAAA,MACR;AAAA,MACA,YAAY,cAAc,IAAI;AAAA,IAClC;AACA,UAAM,mBAAmB,KAAK,OAAO,EAAE,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAI,CAAC;AAC1E,UAAM,SAAS,OAAO,QAAQ,gBAAgB,IAAI,mBAAmB,QAAQ,QAAQ,gBAAgB;AACrG,WAAO,aAAa,KAAK,MAAM;AAAA,EACnC;AAAA,EACA,OAAO,OAAO,SAAS;AACnB,UAAM,qBAAqB,CAAC,QAAQ;AAChC,UAAI,OAAO,YAAY,YAAY,OAAO,YAAY,aAAa;AAC/D,eAAO,EAAE,QAAQ;AAAA,MACrB,WACS,OAAO,YAAY,YAAY;AACpC,eAAO,QAAQ,GAAG;AAAA,MACtB,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO,KAAK,YAAY,CAAC,KAAK,QAAQ;AAClC,YAAM,SAAS,MAAM,GAAG;AACxB,YAAM,WAAW,MAAM,IAAI,SAAS;AAAA,QAChC,MAAM,aAAa;AAAA,QACnB,GAAG,mBAAmB,GAAG;AAAA,MAC7B,CAAC;AACD,UAAI,OAAO,YAAY,eAAe,kBAAkB,SAAS;AAC7D,eAAO,OAAO,KAAK,CAAC,SAAS;AACzB,cAAI,CAAC,MAAM;AACP,qBAAS;AACT,mBAAO;AAAA,UACX,OACK;AACD,mBAAO;AAAA,UACX;AAAA,QACJ,CAAC;AAAA,MACL;AACA,UAAI,CAAC,QAAQ;AACT,iBAAS;AACT,eAAO;AAAA,MACX,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,WAAW,OAAO,gBAAgB;AAC9B,WAAO,KAAK,YAAY,CAAC,KAAK,QAAQ;AAClC,UAAI,CAAC,MAAM,GAAG,GAAG;AACb,YAAI,SAAS,OAAO,mBAAmB,aAAa,eAAe,KAAK,GAAG,IAAI,cAAc;AAC7F,eAAO;AAAA,MACX,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,YAAY,YAAY;AACpB,WAAO,IAAI,WAAW;AAAA,MAClB,QAAQ;AAAA,MACR,UAAU,sBAAsB;AAAA,MAChC,QAAQ,EAAE,MAAM,cAAc,WAAW;AAAA,IAC7C,CAAC;AAAA,EACL;AAAA,EACA,YAAY,YAAY;AACpB,WAAO,KAAK,YAAY,UAAU;AAAA,EACtC;AAAA,EACA,YAAY,KAAK;AAEb,SAAK,MAAM,KAAK;AAChB,SAAK,OAAO;AACZ,SAAK,QAAQ,KAAK,MAAM,KAAK,IAAI;AACjC,SAAK,YAAY,KAAK,UAAU,KAAK,IAAI;AACzC,SAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAC3C,SAAK,iBAAiB,KAAK,eAAe,KAAK,IAAI;AACnD,SAAK,MAAM,KAAK,IAAI,KAAK,IAAI;AAC7B,SAAK,SAAS,KAAK,OAAO,KAAK,IAAI;AACnC,SAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAC3C,SAAK,cAAc,KAAK,YAAY,KAAK,IAAI;AAC7C,SAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,SAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,SAAK,UAAU,KAAK,QAAQ,KAAK,IAAI;AACrC,SAAK,QAAQ,KAAK,MAAM,KAAK,IAAI;AACjC,SAAK,UAAU,KAAK,QAAQ,KAAK,IAAI;AACrC,SAAK,KAAK,KAAK,GAAG,KAAK,IAAI;AAC3B,SAAK,MAAM,KAAK,IAAI,KAAK,IAAI;AAC7B,SAAK,YAAY,KAAK,UAAU,KAAK,IAAI;AACzC,SAAK,QAAQ,KAAK,MAAM,KAAK,IAAI;AACjC,SAAK,UAAU,KAAK,QAAQ,KAAK,IAAI;AACrC,SAAK,QAAQ,KAAK,MAAM,KAAK,IAAI;AACjC,SAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,SAAK,OAAO,KAAK,KAAK,KAAK,IAAI;AAC/B,SAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,SAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAC3C,SAAK,aAAa,KAAK,WAAW,KAAK,IAAI;AAC3C,SAAK,WAAW,IAAI;AAAA,MAChB,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,UAAU,CAAC,SAAS,KAAK,WAAW,EAAE,IAAI;AAAA,IAC9C;AAAA,EACJ;AAAA,EACA,WAAW;AACP,WAAO,YAAY,OAAO,MAAM,KAAK,IAAI;AAAA,EAC7C;AAAA,EACA,WAAW;AACP,WAAO,YAAY,OAAO,MAAM,KAAK,IAAI;AAAA,EAC7C;AAAA,EACA,UAAU;AACN,WAAO,KAAK,SAAS,EAAE,SAAS;AAAA,EACpC;AAAA,EACA,QAAQ;AACJ,WAAO,SAAS,OAAO,IAAI;AAAA,EAC/B;AAAA,EACA,UAAU;AACN,WAAO,WAAW,OAAO,MAAM,KAAK,IAAI;AAAA,EAC5C;AAAA,EACA,GAAG,QAAQ;AACP,WAAO,SAAS,OAAO,CAAC,MAAM,MAAM,GAAG,KAAK,IAAI;AAAA,EACpD;AAAA,EACA,IAAI,UAAU;AACV,WAAO,gBAAgB,OAAO,MAAM,UAAU,KAAK,IAAI;AAAA,EAC3D;AAAA,EACA,UAAU,WAAW;AACjB,WAAO,IAAI,WAAW;AAAA,MAClB,GAAG,oBAAoB,KAAK,IAAI;AAAA,MAChC,QAAQ;AAAA,MACR,UAAU,sBAAsB;AAAA,MAChC,QAAQ,EAAE,MAAM,aAAa,UAAU;AAAA,IAC3C,CAAC;AAAA,EACL;AAAA,EACA,QAAQ,KAAK;AACT,UAAM,mBAAmB,OAAO,QAAQ,aAAa,MAAM,MAAM;AACjE,WAAO,IAAI,WAAW;AAAA,MAClB,GAAG,oBAAoB,KAAK,IAAI;AAAA,MAChC,WAAW;AAAA,MACX,cAAc;AAAA,MACd,UAAU,sBAAsB;AAAA,IACpC,CAAC;AAAA,EACL;AAAA,EACA,QAAQ;AACJ,WAAO,IAAI,WAAW;AAAA,MAClB,UAAU,sBAAsB;AAAA,MAChC,MAAM;AAAA,MACN,GAAG,oBAAoB,KAAK,IAAI;AAAA,IACpC,CAAC;AAAA,EACL;AAAA,EACA,MAAM,KAAK;AACP,UAAM,iBAAiB,OAAO,QAAQ,aAAa,MAAM,MAAM;AAC/D,WAAO,IAAI,SAAS;AAAA,MAChB,GAAG,oBAAoB,KAAK,IAAI;AAAA,MAChC,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,UAAU,sBAAsB;AAAA,IACpC,CAAC;AAAA,EACL;AAAA,EACA,SAAS,aAAa;AAClB,UAAM,OAAO,KAAK;AAClB,WAAO,IAAI,KAAK;AAAA,MACZ,GAAG,KAAK;AAAA,MACR;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,KAAK,QAAQ;AACT,WAAO,YAAY,OAAO,MAAM,MAAM;AAAA,EAC1C;AAAA,EACA,WAAW;AACP,WAAO,YAAY,OAAO,IAAI;AAAA,EAClC;AAAA,EACA,aAAa;AACT,WAAO,KAAK,UAAU,MAAS,EAAE;AAAA,EACrC;AAAA,EACA,aAAa;AACT,WAAO,KAAK,UAAU,IAAI,EAAE;AAAA,EAChC;AACJ;AACA,IAAM,YAAY;AAClB,IAAM,aAAa;AACnB,IAAM,YAAY;AAGlB,IAAM,YAAY;AAClB,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,gBAAgB;AAatB,IAAM,aAAa;AAInB,IAAM,cAAc;AACpB,IAAI;AAEJ,IAAM,YAAY;AAClB,IAAM,gBAAgB;AAGtB,IAAM,YAAY;AAClB,IAAM,gBAAgB;AAEtB,IAAM,cAAc;AAEpB,IAAM,iBAAiB;AAMvB,IAAM,kBAAkB;AACxB,IAAM,YAAY,IAAI,OAAO,IAAI,eAAe,GAAG;AACnD,SAAS,gBAAgB,MAAM;AAC3B,MAAI,qBAAqB;AACzB,MAAI,KAAK,WAAW;AAChB,yBAAqB,GAAG,kBAAkB,UAAU,KAAK,SAAS;AAAA,EACtE,WACS,KAAK,aAAa,MAAM;AAC7B,yBAAqB,GAAG,kBAAkB;AAAA,EAC9C;AACA,QAAM,oBAAoB,KAAK,YAAY,MAAM;AACjD,SAAO,8BAA8B,kBAAkB,IAAI,iBAAiB;AAChF;AACA,SAAS,UAAU,MAAM;AACrB,SAAO,IAAI,OAAO,IAAI,gBAAgB,IAAI,CAAC,GAAG;AAClD;AAEO,SAAS,cAAc,MAAM;AAChC,MAAI,QAAQ,GAAG,eAAe,IAAI,gBAAgB,IAAI,CAAC;AACvD,QAAM,OAAO,CAAC;AACd,OAAK,KAAK,KAAK,QAAQ,OAAO,GAAG;AACjC,MAAI,KAAK;AACL,SAAK,KAAK,sBAAsB;AACpC,UAAQ,GAAG,KAAK,IAAI,KAAK,KAAK,GAAG,CAAC;AAClC,SAAO,IAAI,OAAO,IAAI,KAAK,GAAG;AAClC;AACA,SAAS,UAAU,IAAI,SAAS;AAC5B,OAAK,YAAY,QAAQ,CAAC,YAAY,UAAU,KAAK,EAAE,GAAG;AACtD,WAAO;AAAA,EACX;AACA,OAAK,YAAY,QAAQ,CAAC,YAAY,UAAU,KAAK,EAAE,GAAG;AACtD,WAAO;AAAA,EACX;AACA,SAAO;AACX;AACA,SAAS,WAAW,KAAK,KAAK;AAC1B,MAAI,CAAC,SAAS,KAAK,GAAG;AAClB,WAAO;AACX,MAAI;AACA,UAAM,CAAC,MAAM,IAAI,IAAI,MAAM,GAAG;AAC9B,QAAI,CAAC;AACD,aAAO;AAEX,UAAM,SAAS,OACV,QAAQ,MAAM,GAAG,EACjB,QAAQ,MAAM,GAAG,EACjB,OAAO,OAAO,UAAW,IAAK,OAAO,SAAS,KAAM,GAAI,GAAG;AAChE,UAAM,UAAU,KAAK,MAAM,KAAK,MAAM,CAAC;AACvC,QAAI,OAAO,YAAY,YAAY,YAAY;AAC3C,aAAO;AACX,QAAI,SAAS,WAAW,SAAS,QAAQ;AACrC,aAAO;AACX,QAAI,CAAC,QAAQ;AACT,aAAO;AACX,QAAI,OAAO,QAAQ,QAAQ;AACvB,aAAO;AACX,WAAO;AAAA,EACX,QACM;AACF,WAAO;AAAA,EACX;AACJ;AACA,SAAS,YAAY,IAAI,SAAS;AAC9B,OAAK,YAAY,QAAQ,CAAC,YAAY,cAAc,KAAK,EAAE,GAAG;AAC1D,WAAO;AAAA,EACX;AACA,OAAK,YAAY,QAAQ,CAAC,YAAY,cAAc,KAAK,EAAE,GAAG;AAC1D,WAAO;AAAA,EACX;AACA,SAAO;AACX;AACO,IAAM,YAAN,MAAM,mBAAkB,QAAQ;AAAA,EACnC,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,YAAM,OAAO,OAAO,MAAM,IAAI;AAAA,IAClC;AACA,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,QAAQ;AACrC,YAAMC,OAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkBA,MAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAUA,KAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,SAAS,IAAI,YAAY;AAC/B,QAAI,MAAM;AACV,eAAW,SAAS,KAAK,KAAK,QAAQ;AAClC,UAAI,MAAM,SAAS,OAAO;AACtB,YAAI,MAAM,KAAK,SAAS,MAAM,OAAO;AACjC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,YACf,MAAM;AAAA,YACN,WAAW;AAAA,YACX,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,OAAO;AAC3B,YAAI,MAAM,KAAK,SAAS,MAAM,OAAO;AACjC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,YACf,MAAM;AAAA,YACN,WAAW;AAAA,YACX,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,UAAU;AAC9B,cAAM,SAAS,MAAM,KAAK,SAAS,MAAM;AACzC,cAAM,WAAW,MAAM,KAAK,SAAS,MAAM;AAC3C,YAAI,UAAU,UAAU;AACpB,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,cAAI,QAAQ;AACR,8BAAkB,KAAK;AAAA,cACnB,MAAM,aAAa;AAAA,cACnB,SAAS,MAAM;AAAA,cACf,MAAM;AAAA,cACN,WAAW;AAAA,cACX,OAAO;AAAA,cACP,SAAS,MAAM;AAAA,YACnB,CAAC;AAAA,UACL,WACS,UAAU;AACf,8BAAkB,KAAK;AAAA,cACnB,MAAM,aAAa;AAAA,cACnB,SAAS,MAAM;AAAA,cACf,MAAM;AAAA,cACN,WAAW;AAAA,cACX,OAAO;AAAA,cACP,SAAS,MAAM;AAAA,YACnB,CAAC;AAAA,UACL;AACA,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,SAAS;AAC7B,YAAI,CAAC,WAAW,KAAK,MAAM,IAAI,GAAG;AAC9B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,SAAS;AAC7B,YAAI,CAAC,YAAY;AACb,uBAAa,IAAI,OAAO,aAAa,GAAG;AAAA,QAC5C;AACA,YAAI,CAAC,WAAW,KAAK,MAAM,IAAI,GAAG;AAC9B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,QAAQ;AAC5B,YAAI,CAAC,UAAU,KAAK,MAAM,IAAI,GAAG;AAC7B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,UAAU;AAC9B,YAAI,CAAC,YAAY,KAAK,MAAM,IAAI,GAAG;AAC/B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,QAAQ;AAC5B,YAAI,CAAC,UAAU,KAAK,MAAM,IAAI,GAAG;AAC7B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,SAAS;AAC7B,YAAI,CAAC,WAAW,KAAK,MAAM,IAAI,GAAG;AAC9B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,QAAQ;AAC5B,YAAI,CAAC,UAAU,KAAK,MAAM,IAAI,GAAG;AAC7B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,OAAO;AAC3B,YAAI;AACA,cAAI,IAAI,MAAM,IAAI;AAAA,QACtB,QACM;AACF,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,SAAS;AAC7B,cAAM,MAAM,YAAY;AACxB,cAAM,aAAa,MAAM,MAAM,KAAK,MAAM,IAAI;AAC9C,YAAI,CAAC,YAAY;AACb,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,QAAQ;AAC5B,cAAM,OAAO,MAAM,KAAK,KAAK;AAAA,MACjC,WACS,MAAM,SAAS,YAAY;AAChC,YAAI,CAAC,MAAM,KAAK,SAAS,MAAM,OAAO,MAAM,QAAQ,GAAG;AACnD,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,YAAY,EAAE,UAAU,MAAM,OAAO,UAAU,MAAM,SAAS;AAAA,YAC9D,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,eAAe;AACnC,cAAM,OAAO,MAAM,KAAK,YAAY;AAAA,MACxC,WACS,MAAM,SAAS,eAAe;AACnC,cAAM,OAAO,MAAM,KAAK,YAAY;AAAA,MACxC,WACS,MAAM,SAAS,cAAc;AAClC,YAAI,CAAC,MAAM,KAAK,WAAW,MAAM,KAAK,GAAG;AACrC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,YAAY,EAAE,YAAY,MAAM,MAAM;AAAA,YACtC,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,YAAY;AAChC,YAAI,CAAC,MAAM,KAAK,SAAS,MAAM,KAAK,GAAG;AACnC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,YAAY,EAAE,UAAU,MAAM,MAAM;AAAA,YACpC,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,YAAY;AAChC,cAAM,QAAQ,cAAc,KAAK;AACjC,YAAI,CAAC,MAAM,KAAK,MAAM,IAAI,GAAG;AACzB,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,YAAY;AAAA,YACZ,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,QAAQ;AAC5B,cAAM,QAAQ;AACd,YAAI,CAAC,MAAM,KAAK,MAAM,IAAI,GAAG;AACzB,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,YAAY;AAAA,YACZ,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,QAAQ;AAC5B,cAAM,QAAQ,UAAU,KAAK;AAC7B,YAAI,CAAC,MAAM,KAAK,MAAM,IAAI,GAAG;AACzB,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,YAAY;AAAA,YACZ,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,YAAY;AAChC,YAAI,CAAC,cAAc,KAAK,MAAM,IAAI,GAAG;AACjC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,MAAM;AAC1B,YAAI,CAAC,UAAU,MAAM,MAAM,MAAM,OAAO,GAAG;AACvC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,OAAO;AAC3B,YAAI,CAAC,WAAW,MAAM,MAAM,MAAM,GAAG,GAAG;AACpC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,QAAQ;AAC5B,YAAI,CAAC,YAAY,MAAM,MAAM,MAAM,OAAO,GAAG;AACzC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,UAAU;AAC9B,YAAI,CAAC,YAAY,KAAK,MAAM,IAAI,GAAG;AAC/B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,aAAa;AACjC,YAAI,CAAC,eAAe,KAAK,MAAM,IAAI,GAAG;AAClC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,YAAY;AAAA,YACZ,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,OACK;AACD,aAAK,YAAY,KAAK;AAAA,MAC1B;AAAA,IACJ;AACA,WAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,KAAK;AAAA,EACrD;AAAA,EACA,OAAO,OAAO,YAAY,SAAS;AAC/B,WAAO,KAAK,WAAW,CAAC,SAAS,MAAM,KAAK,IAAI,GAAG;AAAA,MAC/C;AAAA,MACA,MAAM,aAAa;AAAA,MACnB,GAAG,UAAU,SAAS,OAAO;AAAA,IACjC,CAAC;AAAA,EACL;AAAA,EACA,UAAU,OAAO;AACb,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,MAAM,SAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC3E;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,UAAU,EAAE,MAAM,OAAO,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EACzE;AAAA,EACA,MAAM,SAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC3E;AAAA,EACA,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC1E;AAAA,EACA,OAAO,SAAS;AACZ,WAAO,KAAK,UAAU,EAAE,MAAM,UAAU,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC5E;AAAA,EACA,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC1E;AAAA,EACA,MAAM,SAAS;AACX,WAAO,KAAK,UAAU,EAAE,MAAM,SAAS,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC3E;AAAA,EACA,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC1E;AAAA,EACA,OAAO,SAAS;AACZ,WAAO,KAAK,UAAU,EAAE,MAAM,UAAU,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC5E;AAAA,EACA,UAAU,SAAS;AAEf,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,GAAG,UAAU,SAAS,OAAO;AAAA,IACjC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,UAAU,EAAE,MAAM,OAAO,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EACzE;AAAA,EACA,GAAG,SAAS;AACR,WAAO,KAAK,UAAU,EAAE,MAAM,MAAM,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EACxE;AAAA,EACA,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC1E;AAAA,EACA,SAAS,SAAS;AACd,QAAI,OAAO,YAAY,UAAU;AAC7B,aAAO,KAAK,UAAU;AAAA,QAClB,MAAM;AAAA,QACN,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,SAAS;AAAA,MACb,CAAC;AAAA,IACL;AACA,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,WAAW,OAAO,SAAS,cAAc,cAAc,OAAO,SAAS;AAAA,MACvE,QAAQ,SAAS,UAAU;AAAA,MAC3B,OAAO,SAAS,SAAS;AAAA,MACzB,GAAG,UAAU,SAAS,SAAS,OAAO;AAAA,IAC1C,CAAC;AAAA,EACL;AAAA,EACA,KAAK,SAAS;AACV,WAAO,KAAK,UAAU,EAAE,MAAM,QAAQ,QAAQ,CAAC;AAAA,EACnD;AAAA,EACA,KAAK,SAAS;AACV,QAAI,OAAO,YAAY,UAAU;AAC7B,aAAO,KAAK,UAAU;AAAA,QAClB,MAAM;AAAA,QACN,WAAW;AAAA,QACX,SAAS;AAAA,MACb,CAAC;AAAA,IACL;AACA,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,WAAW,OAAO,SAAS,cAAc,cAAc,OAAO,SAAS;AAAA,MACvE,GAAG,UAAU,SAAS,SAAS,OAAO;AAAA,IAC1C,CAAC;AAAA,EACL;AAAA,EACA,SAAS,SAAS;AACd,WAAO,KAAK,UAAU,EAAE,MAAM,YAAY,GAAG,UAAU,SAAS,OAAO,EAAE,CAAC;AAAA,EAC9E;AAAA,EACA,MAAM,OAAO,SAAS;AAClB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN;AAAA,MACA,GAAG,UAAU,SAAS,OAAO;AAAA,IACjC,CAAC;AAAA,EACL;AAAA,EACA,SAAS,OAAO,SAAS;AACrB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN;AAAA,MACA,UAAU,SAAS;AAAA,MACnB,GAAG,UAAU,SAAS,SAAS,OAAO;AAAA,IAC1C,CAAC;AAAA,EACL;AAAA,EACA,WAAW,OAAO,SAAS;AACvB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN;AAAA,MACA,GAAG,UAAU,SAAS,OAAO;AAAA,IACjC,CAAC;AAAA,EACL;AAAA,EACA,SAAS,OAAO,SAAS;AACrB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN;AAAA,MACA,GAAG,UAAU,SAAS,OAAO;AAAA,IACjC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,WAAW,SAAS;AACpB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,GAAG,UAAU,SAAS,OAAO;AAAA,IACjC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,WAAW,SAAS;AACpB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,GAAG,UAAU,SAAS,OAAO;AAAA,IACjC,CAAC;AAAA,EACL;AAAA,EACA,OAAO,KAAK,SAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,GAAG,UAAU,SAAS,OAAO;AAAA,IACjC,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,SAAS,SAAS;AACd,WAAO,KAAK,IAAI,GAAG,UAAU,SAAS,OAAO,CAAC;AAAA,EAClD;AAAA,EACA,OAAO;AACH,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,OAAO,CAAC;AAAA,IAClD,CAAC;AAAA,EACL;AAAA,EACA,cAAc;AACV,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,cAAc,CAAC;AAAA,IACzD,CAAC;AAAA,EACL;AAAA,EACA,cAAc;AACV,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,EAAE,MAAM,cAAc,CAAC;AAAA,IACzD,CAAC;AAAA,EACL;AAAA,EACA,IAAI,aAAa;AACb,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,UAAU;AAAA,EACjE;AAAA,EACA,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,MAAM;AAAA,EAC7D;AAAA,EACA,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,MAAM;AAAA,EAC7D;AAAA,EACA,IAAI,aAAa;AACb,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,UAAU;AAAA,EACjE;AAAA,EACA,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,OAAO;AAAA,EAC9D;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,KAAK;AAAA,EAC5D;AAAA,EACA,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,OAAO;AAAA,EAC9D;AAAA,EACA,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,MAAM;AAAA,EAC7D;AAAA,EACA,IAAI,WAAW;AACX,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,QAAQ;AAAA,EAC/D;AAAA,EACA,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,MAAM;AAAA,EAC7D;AAAA,EACA,IAAI,UAAU;AACV,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,OAAO;AAAA,EAC9D;AAAA,EACA,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,MAAM;AAAA,EAC7D;AAAA,EACA,IAAI,OAAO;AACP,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,IAAI;AAAA,EAC3D;AAAA,EACA,IAAI,SAAS;AACT,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,MAAM;AAAA,EAC7D;AAAA,EACA,IAAI,WAAW;AACX,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,QAAQ;AAAA,EAC/D;AAAA,EACA,IAAI,cAAc;AAEd,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,WAAW;AAAA,EAClE;AAAA,EACA,IAAI,YAAY;AACZ,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,OAAO;AACnB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,YAAY;AACZ,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,OAAO;AACnB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AACA,UAAU,SAAS,CAAC,WAAW;AAC3B,SAAO,IAAI,UAAU;AAAA,IACjB,QAAQ,CAAC;AAAA,IACT,UAAU,sBAAsB;AAAA,IAChC,QAAQ,QAAQ,UAAU;AAAA,IAC1B,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AAEA,SAAS,mBAAmB,KAAK,MAAM;AACnC,QAAM,eAAe,IAAI,SAAS,EAAE,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI;AACzD,QAAM,gBAAgB,KAAK,SAAS,EAAE,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI;AAC3D,QAAM,WAAW,cAAc,eAAe,cAAc;AAC5D,QAAM,SAAS,OAAO,SAAS,IAAI,QAAQ,QAAQ,EAAE,QAAQ,KAAK,EAAE,CAAC;AACrE,QAAM,UAAU,OAAO,SAAS,KAAK,QAAQ,QAAQ,EAAE,QAAQ,KAAK,EAAE,CAAC;AACvE,SAAQ,SAAS,UAAW,MAAM;AACtC;AACO,IAAM,YAAN,MAAM,mBAAkB,QAAQ;AAAA,EACnC,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAChB,SAAK,OAAO,KAAK;AAAA,EACrB;AAAA,EACA,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,YAAM,OAAO,OAAO,MAAM,IAAI;AAAA,IAClC;AACA,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,QAAQ;AACrC,YAAMA,OAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkBA,MAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAUA,KAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,QAAI,MAAM;AACV,UAAM,SAAS,IAAI,YAAY;AAC/B,eAAW,SAAS,KAAK,KAAK,QAAQ;AAClC,UAAI,MAAM,SAAS,OAAO;AACtB,YAAI,CAAC,KAAK,UAAU,MAAM,IAAI,GAAG;AAC7B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,UAAU;AAAA,YACV,UAAU;AAAA,YACV,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,OAAO;AAC3B,cAAM,WAAW,MAAM,YAAY,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAClF,YAAI,UAAU;AACV,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,YACf,MAAM;AAAA,YACN,WAAW,MAAM;AAAA,YACjB,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,OAAO;AAC3B,cAAM,SAAS,MAAM,YAAY,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAChF,YAAI,QAAQ;AACR,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,YACf,MAAM;AAAA,YACN,WAAW,MAAM;AAAA,YACjB,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,cAAc;AAClC,YAAI,mBAAmB,MAAM,MAAM,MAAM,KAAK,MAAM,GAAG;AACnD,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,YAAY,MAAM;AAAA,YAClB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,UAAU;AAC9B,YAAI,CAAC,OAAO,SAAS,MAAM,IAAI,GAAG;AAC9B,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,OACK;AACD,aAAK,YAAY,KAAK;AAAA,MAC1B;AAAA,IACJ;AACA,WAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,KAAK;AAAA,EACrD;AAAA,EACA,IAAI,OAAO,SAAS;AAChB,WAAO,KAAK,SAAS,OAAO,OAAO,MAAM,UAAU,SAAS,OAAO,CAAC;AAAA,EACxE;AAAA,EACA,GAAG,OAAO,SAAS;AACf,WAAO,KAAK,SAAS,OAAO,OAAO,OAAO,UAAU,SAAS,OAAO,CAAC;AAAA,EACzE;AAAA,EACA,IAAI,OAAO,SAAS;AAChB,WAAO,KAAK,SAAS,OAAO,OAAO,MAAM,UAAU,SAAS,OAAO,CAAC;AAAA,EACxE;AAAA,EACA,GAAG,OAAO,SAAS;AACf,WAAO,KAAK,SAAS,OAAO,OAAO,OAAO,UAAU,SAAS,OAAO,CAAC;AAAA,EACzE;AAAA,EACA,SAAS,MAAM,OAAO,WAAW,SAAS;AACtC,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ;AAAA,QACJ,GAAG,KAAK,KAAK;AAAA,QACb;AAAA,UACI;AAAA,UACA;AAAA,UACA;AAAA,UACA,SAAS,UAAU,SAAS,OAAO;AAAA,QACvC;AAAA,MACJ;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,UAAU,OAAO;AACb,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,SAAS,SAAS;AACd,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,WAAW;AAAA,MACX,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,SAAS,SAAS;AACd,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,WAAW;AAAA,MACX,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,YAAY,SAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,WAAW;AAAA,MACX,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,YAAY,SAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,WAAW;AAAA,MACX,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,WAAW,OAAO,SAAS;AACvB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN;AAAA,MACA,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,OAAO,SAAS;AACZ,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,KAAK,SAAS;AACV,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,WAAW;AAAA,MACX,OAAO,OAAO;AAAA,MACd,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC,EAAE,UAAU;AAAA,MACT,MAAM;AAAA,MACN,WAAW;AAAA,MACX,OAAO,OAAO;AAAA,MACd,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,WAAW;AACX,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,OAAO;AACnB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,WAAW;AACX,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,OAAO;AACnB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,CAAC,CAAC,KAAK,KAAK,OAAO,KAAK,CAAC,OAAO,GAAG,SAAS,SAAU,GAAG,SAAS,gBAAgB,KAAK,UAAU,GAAG,KAAK,CAAE;AAAA,EACtH;AAAA,EACA,IAAI,WAAW;AACX,QAAI,MAAM;AACV,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,YAAY,GAAG,SAAS,SAAS,GAAG,SAAS,cAAc;AACvE,eAAO;AAAA,MACX,WACS,GAAG,SAAS,OAAO;AACxB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB,WACS,GAAG,SAAS,OAAO;AACxB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO,OAAO,SAAS,GAAG,KAAK,OAAO,SAAS,GAAG;AAAA,EACtD;AACJ;AACA,UAAU,SAAS,CAAC,WAAW;AAC3B,SAAO,IAAI,UAAU;AAAA,IACjB,QAAQ,CAAC;AAAA,IACT,UAAU,sBAAsB;AAAA,IAChC,QAAQ,QAAQ,UAAU;AAAA,IAC1B,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,YAAN,MAAM,mBAAkB,QAAQ;AAAA,EACnC,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAAA,EACpB;AAAA,EACA,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,UAAI;AACA,cAAM,OAAO,OAAO,MAAM,IAAI;AAAA,MAClC,QACM;AACF,eAAO,KAAK,iBAAiB,KAAK;AAAA,MACtC;AAAA,IACJ;AACA,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,QAAQ;AACrC,aAAO,KAAK,iBAAiB,KAAK;AAAA,IACtC;AACA,QAAI,MAAM;AACV,UAAM,SAAS,IAAI,YAAY;AAC/B,eAAW,SAAS,KAAK,KAAK,QAAQ;AAClC,UAAI,MAAM,SAAS,OAAO;AACtB,cAAM,WAAW,MAAM,YAAY,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAClF,YAAI,UAAU;AACV,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,MAAM;AAAA,YACN,SAAS,MAAM;AAAA,YACf,WAAW,MAAM;AAAA,YACjB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,OAAO;AAC3B,cAAM,SAAS,MAAM,YAAY,MAAM,OAAO,MAAM,QAAQ,MAAM,QAAQ,MAAM;AAChF,YAAI,QAAQ;AACR,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,MAAM;AAAA,YACN,SAAS,MAAM;AAAA,YACf,WAAW,MAAM;AAAA,YACjB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,cAAc;AAClC,YAAI,MAAM,OAAO,MAAM,UAAU,OAAO,CAAC,GAAG;AACxC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,YAAY,MAAM;AAAA,YAClB,SAAS,MAAM;AAAA,UACnB,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,OACK;AACD,aAAK,YAAY,KAAK;AAAA,MAC1B;AAAA,IACJ;AACA,WAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,KAAK;AAAA,EACrD;AAAA,EACA,iBAAiB,OAAO;AACpB,UAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,sBAAkB,KAAK;AAAA,MACnB,MAAM,aAAa;AAAA,MACnB,UAAU,cAAc;AAAA,MACxB,UAAU,IAAI;AAAA,IAClB,CAAC;AACD,WAAO;AAAA,EACX;AAAA,EACA,IAAI,OAAO,SAAS;AAChB,WAAO,KAAK,SAAS,OAAO,OAAO,MAAM,UAAU,SAAS,OAAO,CAAC;AAAA,EACxE;AAAA,EACA,GAAG,OAAO,SAAS;AACf,WAAO,KAAK,SAAS,OAAO,OAAO,OAAO,UAAU,SAAS,OAAO,CAAC;AAAA,EACzE;AAAA,EACA,IAAI,OAAO,SAAS;AAChB,WAAO,KAAK,SAAS,OAAO,OAAO,MAAM,UAAU,SAAS,OAAO,CAAC;AAAA,EACxE;AAAA,EACA,GAAG,OAAO,SAAS;AACf,WAAO,KAAK,SAAS,OAAO,OAAO,OAAO,UAAU,SAAS,OAAO,CAAC;AAAA,EACzE;AAAA,EACA,SAAS,MAAM,OAAO,WAAW,SAAS;AACtC,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ;AAAA,QACJ,GAAG,KAAK,KAAK;AAAA,QACb;AAAA,UACI;AAAA,UACA;AAAA,UACA;AAAA,UACA,SAAS,UAAU,SAAS,OAAO;AAAA,QACvC;AAAA,MACJ;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,UAAU,OAAO;AACb,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,SAAS,SAAS;AACd,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,OAAO,CAAC;AAAA,MACf,WAAW;AAAA,MACX,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,SAAS,SAAS;AACd,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,OAAO,CAAC;AAAA,MACf,WAAW;AAAA,MACX,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,YAAY,SAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,OAAO,CAAC;AAAA,MACf,WAAW;AAAA,MACX,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,YAAY,SAAS;AACjB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,OAAO,CAAC;AAAA,MACf,WAAW;AAAA,MACX,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,WAAW,OAAO,SAAS;AACvB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN;AAAA,MACA,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,WAAW;AACX,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,OAAO;AACnB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,WAAW;AACX,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,OAAO;AACnB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AACA,UAAU,SAAS,CAAC,WAAW;AAC3B,SAAO,IAAI,UAAU;AAAA,IACjB,QAAQ,CAAC;AAAA,IACT,UAAU,sBAAsB;AAAA,IAChC,QAAQ,QAAQ,UAAU;AAAA,IAC1B,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,aAAN,cAAyB,QAAQ;AAAA,EACpC,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,YAAM,OAAO,QAAQ,MAAM,IAAI;AAAA,IACnC;AACA,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,SAAS;AACtC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AACJ;AACA,WAAW,SAAS,CAAC,WAAW;AAC5B,SAAO,IAAI,WAAW;AAAA,IAClB,UAAU,sBAAsB;AAAA,IAChC,QAAQ,QAAQ,UAAU;AAAA,IAC1B,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,UAAN,MAAM,iBAAgB,QAAQ;AAAA,EACjC,OAAO,OAAO;AACV,QAAI,KAAK,KAAK,QAAQ;AAClB,YAAM,OAAO,IAAI,KAAK,MAAM,IAAI;AAAA,IACpC;AACA,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,MAAM;AACnC,YAAMA,OAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkBA,MAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAUA,KAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,QAAI,OAAO,MAAM,MAAM,KAAK,QAAQ,CAAC,GAAG;AACpC,YAAMA,OAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkBA,MAAK;AAAA,QACnB,MAAM,aAAa;AAAA,MACvB,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,SAAS,IAAI,YAAY;AAC/B,QAAI,MAAM;AACV,eAAW,SAAS,KAAK,KAAK,QAAQ;AAClC,UAAI,MAAM,SAAS,OAAO;AACtB,YAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,OAAO;AACpC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,YACf,WAAW;AAAA,YACX,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,MAAM;AAAA,UACV,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,MAAM,SAAS,OAAO;AAC3B,YAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,OAAO;AACpC,gBAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,SAAS,MAAM;AAAA,YACf,WAAW;AAAA,YACX,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,MAAM;AAAA,UACV,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,OACK;AACD,aAAK,YAAY,KAAK;AAAA,MAC1B;AAAA,IACJ;AACA,WAAO;AAAA,MACH,QAAQ,OAAO;AAAA,MACf,OAAO,IAAI,KAAK,MAAM,KAAK,QAAQ,CAAC;AAAA,IACxC;AAAA,EACJ;AAAA,EACA,UAAU,OAAO;AACb,WAAO,IAAI,SAAQ;AAAA,MACf,GAAG,KAAK;AAAA,MACR,QAAQ,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,SAAS,SAAS;AAClB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,QAAQ,QAAQ;AAAA,MACvB,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,SAAS,SAAS;AAClB,WAAO,KAAK,UAAU;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,QAAQ,QAAQ;AAAA,MACvB,SAAS,UAAU,SAAS,OAAO;AAAA,IACvC,CAAC;AAAA,EACL;AAAA,EACA,IAAI,UAAU;AACV,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,OAAO;AACnB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO,OAAO,OAAO,IAAI,KAAK,GAAG,IAAI;AAAA,EACzC;AAAA,EACA,IAAI,UAAU;AACV,QAAI,MAAM;AACV,eAAW,MAAM,KAAK,KAAK,QAAQ;AAC/B,UAAI,GAAG,SAAS,OAAO;AACnB,YAAI,QAAQ,QAAQ,GAAG,QAAQ;AAC3B,gBAAM,GAAG;AAAA,MACjB;AAAA,IACJ;AACA,WAAO,OAAO,OAAO,IAAI,KAAK,GAAG,IAAI;AAAA,EACzC;AACJ;AACA,QAAQ,SAAS,CAAC,WAAW;AACzB,SAAO,IAAI,QAAQ;AAAA,IACf,QAAQ,CAAC;AAAA,IACT,QAAQ,QAAQ,UAAU;AAAA,IAC1B,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,YAAN,cAAwB,QAAQ;AAAA,EACnC,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,QAAQ;AACrC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AACJ;AACA,UAAU,SAAS,CAAC,WAAW;AAC3B,SAAO,IAAI,UAAU;AAAA,IACjB,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,eAAN,cAA2B,QAAQ;AAAA,EACtC,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,WAAW;AACxC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AACJ;AACA,aAAa,SAAS,CAAC,WAAW;AAC9B,SAAO,IAAI,aAAa;AAAA,IACpB,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,UAAN,cAAsB,QAAQ;AAAA,EACjC,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,MAAM;AACnC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AACJ;AACA,QAAQ,SAAS,CAAC,WAAW;AACzB,SAAO,IAAI,QAAQ;AAAA,IACf,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,SAAN,cAAqB,QAAQ;AAAA,EAChC,cAAc;AACV,UAAM,GAAG,SAAS;AAElB,SAAK,OAAO;AAAA,EAChB;AAAA,EACA,OAAO,OAAO;AACV,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AACJ;AACA,OAAO,SAAS,CAAC,WAAW;AACxB,SAAO,IAAI,OAAO;AAAA,IACd,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,aAAN,cAAyB,QAAQ;AAAA,EACpC,cAAc;AACV,UAAM,GAAG,SAAS;AAElB,SAAK,WAAW;AAAA,EACpB;AAAA,EACA,OAAO,OAAO;AACV,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AACJ;AACA,WAAW,SAAS,CAAC,WAAW;AAC5B,SAAO,IAAI,WAAW;AAAA,IAClB,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,WAAN,cAAuB,QAAQ;AAAA,EAClC,OAAO,OAAO;AACV,UAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,sBAAkB,KAAK;AAAA,MACnB,MAAM,aAAa;AAAA,MACnB,UAAU,cAAc;AAAA,MACxB,UAAU,IAAI;AAAA,IAClB,CAAC;AACD,WAAO;AAAA,EACX;AACJ;AACA,SAAS,SAAS,CAAC,WAAW;AAC1B,SAAO,IAAI,SAAS;AAAA,IAChB,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,UAAN,cAAsB,QAAQ;AAAA,EACjC,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,WAAW;AACxC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AACJ;AACA,QAAQ,SAAS,CAAC,WAAW;AACzB,SAAO,IAAI,QAAQ;AAAA,IACf,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,WAAN,MAAM,kBAAiB,QAAQ;AAAA,EAClC,OAAO,OAAO;AACV,UAAM,EAAE,KAAK,OAAO,IAAI,KAAK,oBAAoB,KAAK;AACtD,UAAM,MAAM,KAAK;AACjB,QAAI,IAAI,eAAe,cAAc,OAAO;AACxC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,QAAI,IAAI,gBAAgB,MAAM;AAC1B,YAAM,SAAS,IAAI,KAAK,SAAS,IAAI,YAAY;AACjD,YAAM,WAAW,IAAI,KAAK,SAAS,IAAI,YAAY;AACnD,UAAI,UAAU,UAAU;AACpB,0BAAkB,KAAK;AAAA,UACnB,MAAM,SAAS,aAAa,UAAU,aAAa;AAAA,UACnD,SAAU,WAAW,IAAI,YAAY,QAAQ;AAAA,UAC7C,SAAU,SAAS,IAAI,YAAY,QAAQ;AAAA,UAC3C,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAAS,IAAI,YAAY;AAAA,QAC7B,CAAC;AACD,eAAO,MAAM;AAAA,MACjB;AAAA,IACJ;AACA,QAAI,IAAI,cAAc,MAAM;AACxB,UAAI,IAAI,KAAK,SAAS,IAAI,UAAU,OAAO;AACvC,0BAAkB,KAAK;AAAA,UACnB,MAAM,aAAa;AAAA,UACnB,SAAS,IAAI,UAAU;AAAA,UACvB,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAAS,IAAI,UAAU;AAAA,QAC3B,CAAC;AACD,eAAO,MAAM;AAAA,MACjB;AAAA,IACJ;AACA,QAAI,IAAI,cAAc,MAAM;AACxB,UAAI,IAAI,KAAK,SAAS,IAAI,UAAU,OAAO;AACvC,0BAAkB,KAAK;AAAA,UACnB,MAAM,aAAa;AAAA,UACnB,SAAS,IAAI,UAAU;AAAA,UACvB,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAAS,IAAI,UAAU;AAAA,QAC3B,CAAC;AACD,eAAO,MAAM;AAAA,MACjB;AAAA,IACJ;AACA,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI,CAAC,GAAG,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,MAAM;AAC9C,eAAO,IAAI,KAAK,YAAY,IAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC;AAAA,MAC9E,CAAC,CAAC,EAAE,KAAK,CAACC,YAAW;AACjB,eAAO,YAAY,WAAW,QAAQA,OAAM;AAAA,MAChD,CAAC;AAAA,IACL;AACA,UAAM,SAAS,CAAC,GAAG,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,MAAM;AAC1C,aAAO,IAAI,KAAK,WAAW,IAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC;AAAA,IAC7E,CAAC;AACD,WAAO,YAAY,WAAW,QAAQ,MAAM;AAAA,EAChD;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,IAAI,WAAW,SAAS;AACpB,WAAO,IAAI,UAAS;AAAA,MAChB,GAAG,KAAK;AAAA,MACR,WAAW,EAAE,OAAO,WAAW,SAAS,UAAU,SAAS,OAAO,EAAE;AAAA,IACxE,CAAC;AAAA,EACL;AAAA,EACA,IAAI,WAAW,SAAS;AACpB,WAAO,IAAI,UAAS;AAAA,MAChB,GAAG,KAAK;AAAA,MACR,WAAW,EAAE,OAAO,WAAW,SAAS,UAAU,SAAS,OAAO,EAAE;AAAA,IACxE,CAAC;AAAA,EACL;AAAA,EACA,OAAO,KAAK,SAAS;AACjB,WAAO,IAAI,UAAS;AAAA,MAChB,GAAG,KAAK;AAAA,MACR,aAAa,EAAE,OAAO,KAAK,SAAS,UAAU,SAAS,OAAO,EAAE;AAAA,IACpE,CAAC;AAAA,EACL;AAAA,EACA,SAAS,SAAS;AACd,WAAO,KAAK,IAAI,GAAG,OAAO;AAAA,EAC9B;AACJ;AACA,SAAS,SAAS,CAAC,QAAQ,WAAW;AAClC,SAAO,IAAI,SAAS;AAAA,IAChB,MAAM;AAAA,IACN,WAAW;AAAA,IACX,WAAW;AAAA,IACX,aAAa;AAAA,IACb,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACA,SAAS,eAAe,QAAQ;AAC5B,MAAI,kBAAkB,WAAW;AAC7B,UAAM,WAAW,CAAC;AAClB,eAAW,OAAO,OAAO,OAAO;AAC5B,YAAM,cAAc,OAAO,MAAM,GAAG;AACpC,eAAS,GAAG,IAAI,YAAY,OAAO,eAAe,WAAW,CAAC;AAAA,IAClE;AACA,WAAO,IAAI,UAAU;AAAA,MACjB,GAAG,OAAO;AAAA,MACV,OAAO,MAAM;AAAA,IACjB,CAAC;AAAA,EACL,WACS,kBAAkB,UAAU;AACjC,WAAO,IAAI,SAAS;AAAA,MAChB,GAAG,OAAO;AAAA,MACV,MAAM,eAAe,OAAO,OAAO;AAAA,IACvC,CAAC;AAAA,EACL,WACS,kBAAkB,aAAa;AACpC,WAAO,YAAY,OAAO,eAAe,OAAO,OAAO,CAAC,CAAC;AAAA,EAC7D,WACS,kBAAkB,aAAa;AACpC,WAAO,YAAY,OAAO,eAAe,OAAO,OAAO,CAAC,CAAC;AAAA,EAC7D,WACS,kBAAkB,UAAU;AACjC,WAAO,SAAS,OAAO,OAAO,MAAM,IAAI,CAAC,SAAS,eAAe,IAAI,CAAC,CAAC;AAAA,EAC3E,OACK;AACD,WAAO;AAAA,EACX;AACJ;AACO,IAAM,YAAN,MAAM,mBAAkB,QAAQ;AAAA,EACnC,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,UAAU;AAKf,SAAK,YAAY,KAAK;AAqCtB,SAAK,UAAU,KAAK;AAAA,EACxB;AAAA,EACA,aAAa;AACT,QAAI,KAAK,YAAY;AACjB,aAAO,KAAK;AAChB,UAAM,QAAQ,KAAK,KAAK,MAAM;AAC9B,UAAM,OAAO,KAAK,WAAW,KAAK;AAClC,SAAK,UAAU,EAAE,OAAO,KAAK;AAC7B,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,QAAQ;AACrC,YAAMD,OAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkBA,MAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAUA,KAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,EAAE,QAAQ,IAAI,IAAI,KAAK,oBAAoB,KAAK;AACtD,UAAM,EAAE,OAAO,MAAM,UAAU,IAAI,KAAK,WAAW;AACnD,UAAM,YAAY,CAAC;AACnB,QAAI,EAAE,KAAK,KAAK,oBAAoB,YAAY,KAAK,KAAK,gBAAgB,UAAU;AAChF,iBAAW,OAAO,IAAI,MAAM;AACxB,YAAI,CAAC,UAAU,SAAS,GAAG,GAAG;AAC1B,oBAAU,KAAK,GAAG;AAAA,QACtB;AAAA,MACJ;AAAA,IACJ;AACA,UAAM,QAAQ,CAAC;AACf,eAAW,OAAO,WAAW;AACzB,YAAM,eAAe,MAAM,GAAG;AAC9B,YAAM,QAAQ,IAAI,KAAK,GAAG;AAC1B,YAAM,KAAK;AAAA,QACP,KAAK,EAAE,QAAQ,SAAS,OAAO,IAAI;AAAA,QACnC,OAAO,aAAa,OAAO,IAAI,mBAAmB,KAAK,OAAO,IAAI,MAAM,GAAG,CAAC;AAAA,QAC5E,WAAW,OAAO,IAAI;AAAA,MAC1B,CAAC;AAAA,IACL;AACA,QAAI,KAAK,KAAK,oBAAoB,UAAU;AACxC,YAAM,cAAc,KAAK,KAAK;AAC9B,UAAI,gBAAgB,eAAe;AAC/B,mBAAW,OAAO,WAAW;AACzB,gBAAM,KAAK;AAAA,YACP,KAAK,EAAE,QAAQ,SAAS,OAAO,IAAI;AAAA,YACnC,OAAO,EAAE,QAAQ,SAAS,OAAO,IAAI,KAAK,GAAG,EAAE;AAAA,UACnD,CAAC;AAAA,QACL;AAAA,MACJ,WACS,gBAAgB,UAAU;AAC/B,YAAI,UAAU,SAAS,GAAG;AACtB,4BAAkB,KAAK;AAAA,YACnB,MAAM,aAAa;AAAA,YACnB,MAAM;AAAA,UACV,CAAC;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ,WACS,gBAAgB,SAAS;AAAA,MAClC,OACK;AACD,cAAM,IAAI,MAAM,sDAAsD;AAAA,MAC1E;AAAA,IACJ,OACK;AAED,YAAM,WAAW,KAAK,KAAK;AAC3B,iBAAW,OAAO,WAAW;AACzB,cAAM,QAAQ,IAAI,KAAK,GAAG;AAC1B,cAAM,KAAK;AAAA,UACP,KAAK,EAAE,QAAQ,SAAS,OAAO,IAAI;AAAA,UACnC,OAAO,SAAS;AAAA,YAAO,IAAI,mBAAmB,KAAK,OAAO,IAAI,MAAM,GAAG;AAAA;AAAA,UACvE;AAAA,UACA,WAAW,OAAO,IAAI;AAAA,QAC1B,CAAC;AAAA,MACL;AAAA,IACJ;AACA,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,QAAQ,EAClB,KAAK,YAAY;AAClB,cAAM,YAAY,CAAC;AACnB,mBAAW,QAAQ,OAAO;AACtB,gBAAM,MAAM,MAAM,KAAK;AACvB,gBAAM,QAAQ,MAAM,KAAK;AACzB,oBAAU,KAAK;AAAA,YACX;AAAA,YACA;AAAA,YACA,WAAW,KAAK;AAAA,UACpB,CAAC;AAAA,QACL;AACA,eAAO;AAAA,MACX,CAAC,EACI,KAAK,CAAC,cAAc;AACrB,eAAO,YAAY,gBAAgB,QAAQ,SAAS;AAAA,MACxD,CAAC;AAAA,IACL,OACK;AACD,aAAO,YAAY,gBAAgB,QAAQ,KAAK;AAAA,IACpD;AAAA,EACJ;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK,MAAM;AAAA,EAC3B;AAAA,EACA,OAAO,SAAS;AACZ,cAAU;AACV,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,aAAa;AAAA,MACb,GAAI,YAAY,SACV;AAAA,QACE,UAAU,CAAC,OAAO,QAAQ;AACtB,gBAAM,eAAe,KAAK,KAAK,WAAW,OAAO,GAAG,EAAE,WAAW,IAAI;AACrE,cAAI,MAAM,SAAS;AACf,mBAAO;AAAA,cACH,SAAS,UAAU,SAAS,OAAO,EAAE,WAAW;AAAA,YACpD;AACJ,iBAAO;AAAA,YACH,SAAS;AAAA,UACb;AAAA,QACJ;AAAA,MACJ,IACE,CAAC;AAAA,IACX,CAAC;AAAA,EACL;AAAA,EACA,QAAQ;AACJ,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,aAAa;AAAA,IACjB,CAAC;AAAA,EACL;AAAA,EACA,cAAc;AACV,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,aAAa;AAAA,IACjB,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,OAAO,cAAc;AACjB,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,OAAO;AAAA,QACV,GAAG,KAAK,KAAK,MAAM;AAAA,QACnB,GAAG;AAAA,MACP;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,SAAS;AACX,UAAM,SAAS,IAAI,WAAU;AAAA,MACzB,aAAa,QAAQ,KAAK;AAAA,MAC1B,UAAU,QAAQ,KAAK;AAAA,MACvB,OAAO,OAAO;AAAA,QACV,GAAG,KAAK,KAAK,MAAM;AAAA,QACnB,GAAG,QAAQ,KAAK,MAAM;AAAA,MAC1B;AAAA,MACA,UAAU,sBAAsB;AAAA,IACpC,CAAC;AACD,WAAO;AAAA,EACX;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,EAoCA,OAAO,KAAK,QAAQ;AAChB,WAAO,KAAK,QAAQ,EAAE,CAAC,GAAG,GAAG,OAAO,CAAC;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,SAAS,OAAO;AACZ,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,UAAU;AAAA,IACd,CAAC;AAAA,EACL;AAAA,EACA,KAAK,MAAM;AACP,UAAM,QAAQ,CAAC;AACf,eAAW,OAAO,KAAK,WAAW,IAAI,GAAG;AACrC,UAAI,KAAK,GAAG,KAAK,KAAK,MAAM,GAAG,GAAG;AAC9B,cAAM,GAAG,IAAI,KAAK,MAAM,GAAG;AAAA,MAC/B;AAAA,IACJ;AACA,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,MAAM;AAAA,IACjB,CAAC;AAAA,EACL;AAAA,EACA,KAAK,MAAM;AACP,UAAM,QAAQ,CAAC;AACf,eAAW,OAAO,KAAK,WAAW,KAAK,KAAK,GAAG;AAC3C,UAAI,CAAC,KAAK,GAAG,GAAG;AACZ,cAAM,GAAG,IAAI,KAAK,MAAM,GAAG;AAAA,MAC/B;AAAA,IACJ;AACA,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,MAAM;AAAA,IACjB,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc;AACV,WAAO,eAAe,IAAI;AAAA,EAC9B;AAAA,EACA,QAAQ,MAAM;AACV,UAAM,WAAW,CAAC;AAClB,eAAW,OAAO,KAAK,WAAW,KAAK,KAAK,GAAG;AAC3C,YAAM,cAAc,KAAK,MAAM,GAAG;AAClC,UAAI,QAAQ,CAAC,KAAK,GAAG,GAAG;AACpB,iBAAS,GAAG,IAAI;AAAA,MACpB,OACK;AACD,iBAAS,GAAG,IAAI,YAAY,SAAS;AAAA,MACzC;AAAA,IACJ;AACA,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,MAAM;AAAA,IACjB,CAAC;AAAA,EACL;AAAA,EACA,SAAS,MAAM;AACX,UAAM,WAAW,CAAC;AAClB,eAAW,OAAO,KAAK,WAAW,KAAK,KAAK,GAAG;AAC3C,UAAI,QAAQ,CAAC,KAAK,GAAG,GAAG;AACpB,iBAAS,GAAG,IAAI,KAAK,MAAM,GAAG;AAAA,MAClC,OACK;AACD,cAAM,cAAc,KAAK,MAAM,GAAG;AAClC,YAAI,WAAW;AACf,eAAO,oBAAoB,aAAa;AACpC,qBAAW,SAAS,KAAK;AAAA,QAC7B;AACA,iBAAS,GAAG,IAAI;AAAA,MACpB;AAAA,IACJ;AACA,WAAO,IAAI,WAAU;AAAA,MACjB,GAAG,KAAK;AAAA,MACR,OAAO,MAAM;AAAA,IACjB,CAAC;AAAA,EACL;AAAA,EACA,QAAQ;AACJ,WAAO,cAAc,KAAK,WAAW,KAAK,KAAK,CAAC;AAAA,EACpD;AACJ;AACA,UAAU,SAAS,CAAC,OAAO,WAAW;AAClC,SAAO,IAAI,UAAU;AAAA,IACjB,OAAO,MAAM;AAAA,IACb,aAAa;AAAA,IACb,UAAU,SAAS,OAAO;AAAA,IAC1B,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACA,UAAU,eAAe,CAAC,OAAO,WAAW;AACxC,SAAO,IAAI,UAAU;AAAA,IACjB,OAAO,MAAM;AAAA,IACb,aAAa;AAAA,IACb,UAAU,SAAS,OAAO;AAAA,IAC1B,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACA,UAAU,aAAa,CAAC,OAAO,WAAW;AACtC,SAAO,IAAI,UAAU;AAAA,IACjB;AAAA,IACA,aAAa;AAAA,IACb,UAAU,SAAS,OAAO;AAAA,IAC1B,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,WAAN,cAAuB,QAAQ;AAAA,EAClC,OAAO,OAAO;AACV,UAAM,EAAE,IAAI,IAAI,KAAK,oBAAoB,KAAK;AAC9C,UAAM,UAAU,KAAK,KAAK;AAC1B,aAAS,cAAc,SAAS;AAE5B,iBAAW,UAAU,SAAS;AAC1B,YAAI,OAAO,OAAO,WAAW,SAAS;AAClC,iBAAO,OAAO;AAAA,QAClB;AAAA,MACJ;AACA,iBAAW,UAAU,SAAS;AAC1B,YAAI,OAAO,OAAO,WAAW,SAAS;AAElC,cAAI,OAAO,OAAO,KAAK,GAAG,OAAO,IAAI,OAAO,MAAM;AAClD,iBAAO,OAAO;AAAA,QAClB;AAAA,MACJ;AAEA,YAAM,cAAc,QAAQ,IAAI,CAAC,WAAW,IAAI,SAAS,OAAO,IAAI,OAAO,MAAM,CAAC;AAClF,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB;AAAA,MACJ,CAAC;AACD,aAAO;AAAA,IACX;AACA,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI,QAAQ,IAAI,OAAO,WAAW;AAC7C,cAAM,WAAW;AAAA,UACb,GAAG;AAAA,UACH,QAAQ;AAAA,YACJ,GAAG,IAAI;AAAA,YACP,QAAQ,CAAC;AAAA,UACb;AAAA,UACA,QAAQ;AAAA,QACZ;AACA,eAAO;AAAA,UACH,QAAQ,MAAM,OAAO,YAAY;AAAA,YAC7B,MAAM,IAAI;AAAA,YACV,MAAM,IAAI;AAAA,YACV,QAAQ;AAAA,UACZ,CAAC;AAAA,UACD,KAAK;AAAA,QACT;AAAA,MACJ,CAAC,CAAC,EAAE,KAAK,aAAa;AAAA,IAC1B,OACK;AACD,UAAI,QAAQ;AACZ,YAAM,SAAS,CAAC;AAChB,iBAAW,UAAU,SAAS;AAC1B,cAAM,WAAW;AAAA,UACb,GAAG;AAAA,UACH,QAAQ;AAAA,YACJ,GAAG,IAAI;AAAA,YACP,QAAQ,CAAC;AAAA,UACb;AAAA,UACA,QAAQ;AAAA,QACZ;AACA,cAAM,SAAS,OAAO,WAAW;AAAA,UAC7B,MAAM,IAAI;AAAA,UACV,MAAM,IAAI;AAAA,UACV,QAAQ;AAAA,QACZ,CAAC;AACD,YAAI,OAAO,WAAW,SAAS;AAC3B,iBAAO;AAAA,QACX,WACS,OAAO,WAAW,WAAW,CAAC,OAAO;AAC1C,kBAAQ,EAAE,QAAQ,KAAK,SAAS;AAAA,QACpC;AACA,YAAI,SAAS,OAAO,OAAO,QAAQ;AAC/B,iBAAO,KAAK,SAAS,OAAO,MAAM;AAAA,QACtC;AAAA,MACJ;AACA,UAAI,OAAO;AACP,YAAI,OAAO,OAAO,KAAK,GAAG,MAAM,IAAI,OAAO,MAAM;AACjD,eAAO,MAAM;AAAA,MACjB;AACA,YAAM,cAAc,OAAO,IAAI,CAACE,YAAW,IAAI,SAASA,OAAM,CAAC;AAC/D,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB;AAAA,MACJ,CAAC;AACD,aAAO;AAAA,IACX;AAAA,EACJ;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACA,SAAS,SAAS,CAAC,OAAO,WAAW;AACjC,SAAO,IAAI,SAAS;AAAA,IAChB,SAAS;AAAA,IACT,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AAQA,IAAM,mBAAmB,CAAC,SAAS;AAC/B,MAAI,gBAAgB,SAAS;AACzB,WAAO,iBAAiB,KAAK,MAAM;AAAA,EACvC,WACS,gBAAgB,YAAY;AACjC,WAAO,iBAAiB,KAAK,UAAU,CAAC;AAAA,EAC5C,WACS,gBAAgB,YAAY;AACjC,WAAO,CAAC,KAAK,KAAK;AAAA,EACtB,WACS,gBAAgB,SAAS;AAC9B,WAAO,KAAK;AAAA,EAChB,WACS,gBAAgB,eAAe;AAEpC,WAAO,KAAK,aAAa,KAAK,IAAI;AAAA,EACtC,WACS,gBAAgB,YAAY;AACjC,WAAO,iBAAiB,KAAK,KAAK,SAAS;AAAA,EAC/C,WACS,gBAAgB,cAAc;AACnC,WAAO,CAAC,MAAS;AAAA,EACrB,WACS,gBAAgB,SAAS;AAC9B,WAAO,CAAC,IAAI;AAAA,EAChB,WACS,gBAAgB,aAAa;AAClC,WAAO,CAAC,QAAW,GAAG,iBAAiB,KAAK,OAAO,CAAC,CAAC;AAAA,EACzD,WACS,gBAAgB,aAAa;AAClC,WAAO,CAAC,MAAM,GAAG,iBAAiB,KAAK,OAAO,CAAC,CAAC;AAAA,EACpD,WACS,gBAAgB,YAAY;AACjC,WAAO,iBAAiB,KAAK,OAAO,CAAC;AAAA,EACzC,WACS,gBAAgB,aAAa;AAClC,WAAO,iBAAiB,KAAK,OAAO,CAAC;AAAA,EACzC,WACS,gBAAgB,UAAU;AAC/B,WAAO,iBAAiB,KAAK,KAAK,SAAS;AAAA,EAC/C,OACK;AACD,WAAO,CAAC;AAAA,EACZ;AACJ;AACO,IAAM,wBAAN,MAAM,+BAA8B,QAAQ;AAAA,EAC/C,OAAO,OAAO;AACV,UAAM,EAAE,IAAI,IAAI,KAAK,oBAAoB,KAAK;AAC9C,QAAI,IAAI,eAAe,cAAc,QAAQ;AACzC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,gBAAgB,KAAK;AAC3B,UAAM,qBAAqB,IAAI,KAAK,aAAa;AACjD,UAAM,SAAS,KAAK,WAAW,IAAI,kBAAkB;AACrD,QAAI,CAAC,QAAQ;AACT,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,SAAS,MAAM,KAAK,KAAK,WAAW,KAAK,CAAC;AAAA,QAC1C,MAAM,CAAC,aAAa;AAAA,MACxB,CAAC;AACD,aAAO;AAAA,IACX;AACA,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,OAAO,YAAY;AAAA,QACtB,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,QAAQ;AAAA,MACZ,CAAC;AAAA,IACL,OACK;AACD,aAAO,OAAO,WAAW;AAAA,QACrB,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,QAAQ;AAAA,MACZ,CAAC;AAAA,IACL;AAAA,EACJ;AAAA,EACA,IAAI,gBAAgB;AAChB,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,IAAI,aAAa;AACb,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,OAAO,eAAe,SAAS,QAAQ;AAE1C,UAAM,aAAa,oBAAI,IAAI;AAE3B,eAAW,QAAQ,SAAS;AACxB,YAAM,sBAAsB,iBAAiB,KAAK,MAAM,aAAa,CAAC;AACtE,UAAI,CAAC,oBAAoB,QAAQ;AAC7B,cAAM,IAAI,MAAM,mCAAmC,aAAa,mDAAmD;AAAA,MACvH;AACA,iBAAW,SAAS,qBAAqB;AACrC,YAAI,WAAW,IAAI,KAAK,GAAG;AACvB,gBAAM,IAAI,MAAM,0BAA0B,OAAO,aAAa,CAAC,wBAAwB,OAAO,KAAK,CAAC,EAAE;AAAA,QAC1G;AACA,mBAAW,IAAI,OAAO,IAAI;AAAA,MAC9B;AAAA,IACJ;AACA,WAAO,IAAI,uBAAsB;AAAA,MAC7B,UAAU,sBAAsB;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAG,oBAAoB,MAAM;AAAA,IACjC,CAAC;AAAA,EACL;AACJ;AACA,SAAS,YAAY,GAAG,GAAG;AACvB,QAAM,QAAQ,cAAc,CAAC;AAC7B,QAAM,QAAQ,cAAc,CAAC;AAC7B,MAAI,MAAM,GAAG;AACT,WAAO,EAAE,OAAO,MAAM,MAAM,EAAE;AAAA,EAClC,WACS,UAAU,cAAc,UAAU,UAAU,cAAc,QAAQ;AACvE,UAAM,QAAQ,KAAK,WAAW,CAAC;AAC/B,UAAM,aAAa,KAAK,WAAW,CAAC,EAAE,OAAO,CAAC,QAAQ,MAAM,QAAQ,GAAG,MAAM,EAAE;AAC/E,UAAM,SAAS,EAAE,GAAG,GAAG,GAAG,EAAE;AAC5B,eAAW,OAAO,YAAY;AAC1B,YAAM,cAAc,YAAY,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC;AAC9C,UAAI,CAAC,YAAY,OAAO;AACpB,eAAO,EAAE,OAAO,MAAM;AAAA,MAC1B;AACA,aAAO,GAAG,IAAI,YAAY;AAAA,IAC9B;AACA,WAAO,EAAE,OAAO,MAAM,MAAM,OAAO;AAAA,EACvC,WACS,UAAU,cAAc,SAAS,UAAU,cAAc,OAAO;AACrE,QAAI,EAAE,WAAW,EAAE,QAAQ;AACvB,aAAO,EAAE,OAAO,MAAM;AAAA,IAC1B;AACA,UAAM,WAAW,CAAC;AAClB,aAAS,QAAQ,GAAG,QAAQ,EAAE,QAAQ,SAAS;AAC3C,YAAM,QAAQ,EAAE,KAAK;AACrB,YAAM,QAAQ,EAAE,KAAK;AACrB,YAAM,cAAc,YAAY,OAAO,KAAK;AAC5C,UAAI,CAAC,YAAY,OAAO;AACpB,eAAO,EAAE,OAAO,MAAM;AAAA,MAC1B;AACA,eAAS,KAAK,YAAY,IAAI;AAAA,IAClC;AACA,WAAO,EAAE,OAAO,MAAM,MAAM,SAAS;AAAA,EACzC,WACS,UAAU,cAAc,QAAQ,UAAU,cAAc,QAAQ,CAAC,MAAM,CAAC,GAAG;AAChF,WAAO,EAAE,OAAO,MAAM,MAAM,EAAE;AAAA,EAClC,OACK;AACD,WAAO,EAAE,OAAO,MAAM;AAAA,EAC1B;AACJ;AACO,IAAM,kBAAN,cAA8B,QAAQ;AAAA,EACzC,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAI,IAAI,KAAK,oBAAoB,KAAK;AACtD,UAAM,eAAe,CAAC,YAAY,gBAAgB;AAC9C,UAAI,UAAU,UAAU,KAAK,UAAU,WAAW,GAAG;AACjD,eAAO;AAAA,MACX;AACA,YAAM,SAAS,YAAY,WAAW,OAAO,YAAY,KAAK;AAC9D,UAAI,CAAC,OAAO,OAAO;AACf,0BAAkB,KAAK;AAAA,UACnB,MAAM,aAAa;AAAA,QACvB,CAAC;AACD,eAAO;AAAA,MACX;AACA,UAAI,QAAQ,UAAU,KAAK,QAAQ,WAAW,GAAG;AAC7C,eAAO,MAAM;AAAA,MACjB;AACA,aAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,OAAO,KAAK;AAAA,IACtD;AACA,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI;AAAA,QACf,KAAK,KAAK,KAAK,YAAY;AAAA,UACvB,MAAM,IAAI;AAAA,UACV,MAAM,IAAI;AAAA,UACV,QAAQ;AAAA,QACZ,CAAC;AAAA,QACD,KAAK,KAAK,MAAM,YAAY;AAAA,UACxB,MAAM,IAAI;AAAA,UACV,MAAM,IAAI;AAAA,UACV,QAAQ;AAAA,QACZ,CAAC;AAAA,MACL,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,KAAK,MAAM,aAAa,MAAM,KAAK,CAAC;AAAA,IACxD,OACK;AACD,aAAO,aAAa,KAAK,KAAK,KAAK,WAAW;AAAA,QAC1C,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,QAAQ;AAAA,MACZ,CAAC,GAAG,KAAK,KAAK,MAAM,WAAW;AAAA,QAC3B,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,QAAQ;AAAA,MACZ,CAAC,CAAC;AAAA,IACN;AAAA,EACJ;AACJ;AACA,gBAAgB,SAAS,CAAC,MAAM,OAAO,WAAW;AAC9C,SAAO,IAAI,gBAAgB;AAAA,IACvB;AAAA,IACA;AAAA,IACA,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AAEO,IAAM,WAAN,MAAM,kBAAiB,QAAQ;AAAA,EAClC,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAI,IAAI,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,eAAe,cAAc,OAAO;AACxC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,QAAI,IAAI,KAAK,SAAS,KAAK,KAAK,MAAM,QAAQ;AAC1C,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,SAAS,KAAK,KAAK,MAAM;AAAA,QACzB,WAAW;AAAA,QACX,OAAO;AAAA,QACP,MAAM;AAAA,MACV,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,OAAO,KAAK,KAAK;AACvB,QAAI,CAAC,QAAQ,IAAI,KAAK,SAAS,KAAK,KAAK,MAAM,QAAQ;AACnD,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,SAAS,KAAK,KAAK,MAAM;AAAA,QACzB,WAAW;AAAA,QACX,OAAO;AAAA,QACP,MAAM;AAAA,MACV,CAAC;AACD,aAAO,MAAM;AAAA,IACjB;AACA,UAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,EACrB,IAAI,CAAC,MAAM,cAAc;AAC1B,YAAM,SAAS,KAAK,KAAK,MAAM,SAAS,KAAK,KAAK,KAAK;AACvD,UAAI,CAAC;AACD,eAAO;AACX,aAAO,OAAO,OAAO,IAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM,SAAS,CAAC;AAAA,IAC/E,CAAC,EACI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AACtB,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI,KAAK,EAAE,KAAK,CAAC,YAAY;AACxC,eAAO,YAAY,WAAW,QAAQ,OAAO;AAAA,MACjD,CAAC;AAAA,IACL,OACK;AACD,aAAO,YAAY,WAAW,QAAQ,KAAK;AAAA,IAC/C;AAAA,EACJ;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,KAAK,MAAM;AACP,WAAO,IAAI,UAAS;AAAA,MAChB,GAAG,KAAK;AAAA,MACR;AAAA,IACJ,CAAC;AAAA,EACL;AACJ;AACA,SAAS,SAAS,CAAC,SAAS,WAAW;AACnC,MAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AACzB,UAAM,IAAI,MAAM,uDAAuD;AAAA,EAC3E;AACA,SAAO,IAAI,SAAS;AAAA,IAChB,OAAO;AAAA,IACP,UAAU,sBAAsB;AAAA,IAChC,MAAM;AAAA,IACN,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,YAAN,MAAM,mBAAkB,QAAQ;AAAA,EACnC,IAAI,YAAY;AACZ,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAI,IAAI,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,eAAe,cAAc,QAAQ;AACzC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,QAAQ,CAAC;AACf,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,YAAY,KAAK,KAAK;AAC5B,eAAW,OAAO,IAAI,MAAM;AACxB,YAAM,KAAK;AAAA,QACP,KAAK,QAAQ,OAAO,IAAI,mBAAmB,KAAK,KAAK,IAAI,MAAM,GAAG,CAAC;AAAA,QACnE,OAAO,UAAU,OAAO,IAAI,mBAAmB,KAAK,IAAI,KAAK,GAAG,GAAG,IAAI,MAAM,GAAG,CAAC;AAAA,QACjF,WAAW,OAAO,IAAI;AAAA,MAC1B,CAAC;AAAA,IACL;AACA,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,YAAY,iBAAiB,QAAQ,KAAK;AAAA,IACrD,OACK;AACD,aAAO,YAAY,gBAAgB,QAAQ,KAAK;AAAA,IACpD;AAAA,EACJ;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,OAAO,OAAO,OAAO,QAAQ,OAAO;AAChC,QAAI,kBAAkB,SAAS;AAC3B,aAAO,IAAI,WAAU;AAAA,QACjB,SAAS;AAAA,QACT,WAAW;AAAA,QACX,UAAU,sBAAsB;AAAA,QAChC,GAAG,oBAAoB,KAAK;AAAA,MAChC,CAAC;AAAA,IACL;AACA,WAAO,IAAI,WAAU;AAAA,MACjB,SAAS,UAAU,OAAO;AAAA,MAC1B,WAAW;AAAA,MACX,UAAU,sBAAsB;AAAA,MAChC,GAAG,oBAAoB,MAAM;AAAA,IACjC,CAAC;AAAA,EACL;AACJ;AACO,IAAM,SAAN,cAAqB,QAAQ;AAAA,EAChC,IAAI,YAAY;AACZ,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,IAAI,cAAc;AACd,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAI,IAAI,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,eAAe,cAAc,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,YAAY,KAAK,KAAK;AAC5B,UAAM,QAAQ,CAAC,GAAG,IAAI,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,UAAU;AAC/D,aAAO;AAAA,QACH,KAAK,QAAQ,OAAO,IAAI,mBAAmB,KAAK,KAAK,IAAI,MAAM,CAAC,OAAO,KAAK,CAAC,CAAC;AAAA,QAC9E,OAAO,UAAU,OAAO,IAAI,mBAAmB,KAAK,OAAO,IAAI,MAAM,CAAC,OAAO,OAAO,CAAC,CAAC;AAAA,MAC1F;AAAA,IACJ,CAAC;AACD,QAAI,IAAI,OAAO,OAAO;AAClB,YAAM,WAAW,oBAAI,IAAI;AACzB,aAAO,QAAQ,QAAQ,EAAE,KAAK,YAAY;AACtC,mBAAW,QAAQ,OAAO;AACtB,gBAAM,MAAM,MAAM,KAAK;AACvB,gBAAM,QAAQ,MAAM,KAAK;AACzB,cAAI,IAAI,WAAW,aAAa,MAAM,WAAW,WAAW;AACxD,mBAAO;AAAA,UACX;AACA,cAAI,IAAI,WAAW,WAAW,MAAM,WAAW,SAAS;AACpD,mBAAO,MAAM;AAAA,UACjB;AACA,mBAAS,IAAI,IAAI,OAAO,MAAM,KAAK;AAAA,QACvC;AACA,eAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,SAAS;AAAA,MACnD,CAAC;AAAA,IACL,OACK;AACD,YAAM,WAAW,oBAAI,IAAI;AACzB,iBAAW,QAAQ,OAAO;AACtB,cAAM,MAAM,KAAK;AACjB,cAAM,QAAQ,KAAK;AACnB,YAAI,IAAI,WAAW,aAAa,MAAM,WAAW,WAAW;AACxD,iBAAO;AAAA,QACX;AACA,YAAI,IAAI,WAAW,WAAW,MAAM,WAAW,SAAS;AACpD,iBAAO,MAAM;AAAA,QACjB;AACA,iBAAS,IAAI,IAAI,OAAO,MAAM,KAAK;AAAA,MACvC;AACA,aAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,SAAS;AAAA,IACnD;AAAA,EACJ;AACJ;AACA,OAAO,SAAS,CAAC,SAAS,WAAW,WAAW;AAC5C,SAAO,IAAI,OAAO;AAAA,IACd;AAAA,IACA;AAAA,IACA,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,SAAN,MAAM,gBAAe,QAAQ;AAAA,EAChC,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAI,IAAI,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,eAAe,cAAc,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,MAAM,KAAK;AACjB,QAAI,IAAI,YAAY,MAAM;AACtB,UAAI,IAAI,KAAK,OAAO,IAAI,QAAQ,OAAO;AACnC,0BAAkB,KAAK;AAAA,UACnB,MAAM,aAAa;AAAA,UACnB,SAAS,IAAI,QAAQ;AAAA,UACrB,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAAS,IAAI,QAAQ;AAAA,QACzB,CAAC;AACD,eAAO,MAAM;AAAA,MACjB;AAAA,IACJ;AACA,QAAI,IAAI,YAAY,MAAM;AACtB,UAAI,IAAI,KAAK,OAAO,IAAI,QAAQ,OAAO;AACnC,0BAAkB,KAAK;AAAA,UACnB,MAAM,aAAa;AAAA,UACnB,SAAS,IAAI,QAAQ;AAAA,UACrB,MAAM;AAAA,UACN,WAAW;AAAA,UACX,OAAO;AAAA,UACP,SAAS,IAAI,QAAQ;AAAA,QACzB,CAAC;AACD,eAAO,MAAM;AAAA,MACjB;AAAA,IACJ;AACA,UAAM,YAAY,KAAK,KAAK;AAC5B,aAAS,YAAYC,WAAU;AAC3B,YAAM,YAAY,oBAAI,IAAI;AAC1B,iBAAW,WAAWA,WAAU;AAC5B,YAAI,QAAQ,WAAW;AACnB,iBAAO;AACX,YAAI,QAAQ,WAAW;AACnB,iBAAO,MAAM;AACjB,kBAAU,IAAI,QAAQ,KAAK;AAAA,MAC/B;AACA,aAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,UAAU;AAAA,IACpD;AACA,UAAM,WAAW,CAAC,GAAG,IAAI,KAAK,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,MAAM,UAAU,OAAO,IAAI,mBAAmB,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC;AACzH,QAAI,IAAI,OAAO,OAAO;AAClB,aAAO,QAAQ,IAAI,QAAQ,EAAE,KAAK,CAACA,cAAa,YAAYA,SAAQ,CAAC;AAAA,IACzE,OACK;AACD,aAAO,YAAY,QAAQ;AAAA,IAC/B;AAAA,EACJ;AAAA,EACA,IAAI,SAAS,SAAS;AAClB,WAAO,IAAI,QAAO;AAAA,MACd,GAAG,KAAK;AAAA,MACR,SAAS,EAAE,OAAO,SAAS,SAAS,UAAU,SAAS,OAAO,EAAE;AAAA,IACpE,CAAC;AAAA,EACL;AAAA,EACA,IAAI,SAAS,SAAS;AAClB,WAAO,IAAI,QAAO;AAAA,MACd,GAAG,KAAK;AAAA,MACR,SAAS,EAAE,OAAO,SAAS,SAAS,UAAU,SAAS,OAAO,EAAE;AAAA,IACpE,CAAC;AAAA,EACL;AAAA,EACA,KAAK,MAAM,SAAS;AAChB,WAAO,KAAK,IAAI,MAAM,OAAO,EAAE,IAAI,MAAM,OAAO;AAAA,EACpD;AAAA,EACA,SAAS,SAAS;AACd,WAAO,KAAK,IAAI,GAAG,OAAO;AAAA,EAC9B;AACJ;AACA,OAAO,SAAS,CAAC,WAAW,WAAW;AACnC,SAAO,IAAI,OAAO;AAAA,IACd;AAAA,IACA,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,cAAN,MAAM,qBAAoB,QAAQ;AAAA,EACrC,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,WAAW,KAAK;AAAA,EACzB;AAAA,EACA,OAAO,OAAO;AACV,UAAM,EAAE,IAAI,IAAI,KAAK,oBAAoB,KAAK;AAC9C,QAAI,IAAI,eAAe,cAAc,UAAU;AAC3C,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,aAAS,cAAc,MAAM,OAAO;AAChC,aAAO,UAAU;AAAA,QACb,MAAM;AAAA,QACN,MAAM,IAAI;AAAA,QACV,WAAW,CAAC,IAAI,OAAO,oBAAoB,IAAI,gBAAgB,YAAY,GAAG,UAAe,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AAAA,QAChH,WAAW;AAAA,UACP,MAAM,aAAa;AAAA,UACnB,gBAAgB;AAAA,QACpB;AAAA,MACJ,CAAC;AAAA,IACL;AACA,aAAS,iBAAiB,SAAS,OAAO;AACtC,aAAO,UAAU;AAAA,QACb,MAAM;AAAA,QACN,MAAM,IAAI;AAAA,QACV,WAAW,CAAC,IAAI,OAAO,oBAAoB,IAAI,gBAAgB,YAAY,GAAG,UAAe,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AAAA,QAChH,WAAW;AAAA,UACP,MAAM,aAAa;AAAA,UACnB,iBAAiB;AAAA,QACrB;AAAA,MACJ,CAAC;AAAA,IACL;AACA,UAAM,SAAS,EAAE,UAAU,IAAI,OAAO,mBAAmB;AACzD,UAAM,KAAK,IAAI;AACf,QAAI,KAAK,KAAK,mBAAmB,YAAY;AAIzC,YAAM,KAAK;AACX,aAAO,GAAG,kBAAmB,MAAM;AAC/B,cAAM,QAAQ,IAAI,SAAS,CAAC,CAAC;AAC7B,cAAM,aAAa,MAAM,GAAG,KAAK,KAAK,WAAW,MAAM,MAAM,EAAE,MAAM,CAAC,MAAM;AACxE,gBAAM,SAAS,cAAc,MAAM,CAAC,CAAC;AACrC,gBAAM;AAAA,QACV,CAAC;AACD,cAAM,SAAS,MAAM,QAAQ,MAAM,IAAI,MAAM,UAAU;AACvD,cAAM,gBAAgB,MAAM,GAAG,KAAK,QAAQ,KAAK,KAC5C,WAAW,QAAQ,MAAM,EACzB,MAAM,CAAC,MAAM;AACd,gBAAM,SAAS,iBAAiB,QAAQ,CAAC,CAAC;AAC1C,gBAAM;AAAA,QACV,CAAC;AACD,eAAO;AAAA,MACX,CAAC;AAAA,IACL,OACK;AAID,YAAM,KAAK;AACX,aAAO,GAAG,YAAa,MAAM;AACzB,cAAM,aAAa,GAAG,KAAK,KAAK,UAAU,MAAM,MAAM;AACtD,YAAI,CAAC,WAAW,SAAS;AACrB,gBAAM,IAAI,SAAS,CAAC,cAAc,MAAM,WAAW,KAAK,CAAC,CAAC;AAAA,QAC9D;AACA,cAAM,SAAS,QAAQ,MAAM,IAAI,MAAM,WAAW,IAAI;AACtD,cAAM,gBAAgB,GAAG,KAAK,QAAQ,UAAU,QAAQ,MAAM;AAC9D,YAAI,CAAC,cAAc,SAAS;AACxB,gBAAM,IAAI,SAAS,CAAC,iBAAiB,QAAQ,cAAc,KAAK,CAAC,CAAC;AAAA,QACtE;AACA,eAAO,cAAc;AAAA,MACzB,CAAC;AAAA,IACL;AAAA,EACJ;AAAA,EACA,aAAa;AACT,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,aAAa;AACT,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,QAAQ,OAAO;AACX,WAAO,IAAI,aAAY;AAAA,MACnB,GAAG,KAAK;AAAA,MACR,MAAM,SAAS,OAAO,KAAK,EAAE,KAAK,WAAW,OAAO,CAAC;AAAA,IACzD,CAAC;AAAA,EACL;AAAA,EACA,QAAQ,YAAY;AAChB,WAAO,IAAI,aAAY;AAAA,MACnB,GAAG,KAAK;AAAA,MACR,SAAS;AAAA,IACb,CAAC;AAAA,EACL;AAAA,EACA,UAAU,MAAM;AACZ,UAAM,gBAAgB,KAAK,MAAM,IAAI;AACrC,WAAO;AAAA,EACX;AAAA,EACA,gBAAgB,MAAM;AAClB,UAAM,gBAAgB,KAAK,MAAM,IAAI;AACrC,WAAO;AAAA,EACX;AAAA,EACA,OAAO,OAAO,MAAM,SAAS,QAAQ;AACjC,WAAO,IAAI,aAAY;AAAA,MACnB,MAAO,OAAO,OAAO,SAAS,OAAO,CAAC,CAAC,EAAE,KAAK,WAAW,OAAO,CAAC;AAAA,MACjE,SAAS,WAAW,WAAW,OAAO;AAAA,MACtC,UAAU,sBAAsB;AAAA,MAChC,GAAG,oBAAoB,MAAM;AAAA,IACjC,CAAC;AAAA,EACL;AACJ;AACO,IAAM,UAAN,cAAsB,QAAQ;AAAA,EACjC,IAAI,SAAS;AACT,WAAO,KAAK,KAAK,OAAO;AAAA,EAC5B;AAAA,EACA,OAAO,OAAO;AACV,UAAM,EAAE,IAAI,IAAI,KAAK,oBAAoB,KAAK;AAC9C,UAAM,aAAa,KAAK,KAAK,OAAO;AACpC,WAAO,WAAW,OAAO,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAI,CAAC;AAAA,EAC5E;AACJ;AACA,QAAQ,SAAS,CAAC,QAAQ,WAAW;AACjC,SAAO,IAAI,QAAQ;AAAA,IACf;AAAA,IACA,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,aAAN,cAAyB,QAAQ;AAAA,EACpC,OAAO,OAAO;AACV,QAAI,MAAM,SAAS,KAAK,KAAK,OAAO;AAChC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,UAAU,IAAI;AAAA,QACd,MAAM,aAAa;AAAA,QACnB,UAAU,KAAK,KAAK;AAAA,MACxB,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,EAAE,QAAQ,SAAS,OAAO,MAAM,KAAK;AAAA,EAChD;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACA,WAAW,SAAS,CAAC,OAAO,WAAW;AACnC,SAAO,IAAI,WAAW;AAAA,IAClB;AAAA,IACA,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACA,SAAS,cAAc,QAAQ,QAAQ;AACnC,SAAO,IAAI,QAAQ;AAAA,IACf;AAAA,IACA,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,UAAN,MAAM,iBAAgB,QAAQ;AAAA,EACjC,OAAO,OAAO;AACV,QAAI,OAAO,MAAM,SAAS,UAAU;AAChC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,YAAM,iBAAiB,KAAK,KAAK;AACjC,wBAAkB,KAAK;AAAA,QACnB,UAAU,KAAK,WAAW,cAAc;AAAA,QACxC,UAAU,IAAI;AAAA,QACd,MAAM,aAAa;AAAA,MACvB,CAAC;AACD,aAAO;AAAA,IACX;AACA,QAAI,CAAC,KAAK,QAAQ;AACd,WAAK,SAAS,IAAI,IAAI,KAAK,KAAK,MAAM;AAAA,IAC1C;AACA,QAAI,CAAC,KAAK,OAAO,IAAI,MAAM,IAAI,GAAG;AAC9B,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,YAAM,iBAAiB,KAAK,KAAK;AACjC,wBAAkB,KAAK;AAAA,QACnB,UAAU,IAAI;AAAA,QACd,MAAM,aAAa;AAAA,QACnB,SAAS;AAAA,MACb,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,IAAI,OAAO;AACP,UAAM,aAAa,CAAC;AACpB,eAAW,OAAO,KAAK,KAAK,QAAQ;AAChC,iBAAW,GAAG,IAAI;AAAA,IACtB;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,SAAS;AACT,UAAM,aAAa,CAAC;AACpB,eAAW,OAAO,KAAK,KAAK,QAAQ;AAChC,iBAAW,GAAG,IAAI;AAAA,IACtB;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,OAAO;AACP,UAAM,aAAa,CAAC;AACpB,eAAW,OAAO,KAAK,KAAK,QAAQ;AAChC,iBAAW,GAAG,IAAI;AAAA,IACtB;AACA,WAAO;AAAA,EACX;AAAA,EACA,QAAQ,QAAQ,SAAS,KAAK,MAAM;AAChC,WAAO,SAAQ,OAAO,QAAQ;AAAA,MAC1B,GAAG,KAAK;AAAA,MACR,GAAG;AAAA,IACP,CAAC;AAAA,EACL;AAAA,EACA,QAAQ,QAAQ,SAAS,KAAK,MAAM;AAChC,WAAO,SAAQ,OAAO,KAAK,QAAQ,OAAO,CAAC,QAAQ,CAAC,OAAO,SAAS,GAAG,CAAC,GAAG;AAAA,MACvE,GAAG,KAAK;AAAA,MACR,GAAG;AAAA,IACP,CAAC;AAAA,EACL;AACJ;AACA,QAAQ,SAAS;AACV,IAAM,gBAAN,cAA4B,QAAQ;AAAA,EACvC,OAAO,OAAO;AACV,UAAM,mBAAmB,KAAK,mBAAmB,KAAK,KAAK,MAAM;AACjE,UAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,QAAI,IAAI,eAAe,cAAc,UAAU,IAAI,eAAe,cAAc,QAAQ;AACpF,YAAM,iBAAiB,KAAK,aAAa,gBAAgB;AACzD,wBAAkB,KAAK;AAAA,QACnB,UAAU,KAAK,WAAW,cAAc;AAAA,QACxC,UAAU,IAAI;AAAA,QACd,MAAM,aAAa;AAAA,MACvB,CAAC;AACD,aAAO;AAAA,IACX;AACA,QAAI,CAAC,KAAK,QAAQ;AACd,WAAK,SAAS,IAAI,IAAI,KAAK,mBAAmB,KAAK,KAAK,MAAM,CAAC;AAAA,IACnE;AACA,QAAI,CAAC,KAAK,OAAO,IAAI,MAAM,IAAI,GAAG;AAC9B,YAAM,iBAAiB,KAAK,aAAa,gBAAgB;AACzD,wBAAkB,KAAK;AAAA,QACnB,UAAU,IAAI;AAAA,QACd,MAAM,aAAa;AAAA,QACnB,SAAS;AAAA,MACb,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,GAAG,MAAM,IAAI;AAAA,EACxB;AAAA,EACA,IAAI,OAAO;AACP,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACA,cAAc,SAAS,CAAC,QAAQ,WAAW;AACvC,SAAO,IAAI,cAAc;AAAA,IACrB;AAAA,IACA,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,aAAN,cAAyB,QAAQ;AAAA,EACpC,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,OAAO,OAAO;AACV,UAAM,EAAE,IAAI,IAAI,KAAK,oBAAoB,KAAK;AAC9C,QAAI,IAAI,eAAe,cAAc,WAAW,IAAI,OAAO,UAAU,OAAO;AACxE,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,UAAM,cAAc,IAAI,eAAe,cAAc,UAAU,IAAI,OAAO,QAAQ,QAAQ,IAAI,IAAI;AAClG,WAAO,GAAG,YAAY,KAAK,CAAC,SAAS;AACjC,aAAO,KAAK,KAAK,KAAK,WAAW,MAAM;AAAA,QACnC,MAAM,IAAI;AAAA,QACV,UAAU,IAAI,OAAO;AAAA,MACzB,CAAC;AAAA,IACL,CAAC,CAAC;AAAA,EACN;AACJ;AACA,WAAW,SAAS,CAAC,QAAQ,WAAW;AACpC,SAAO,IAAI,WAAW;AAAA,IAClB,MAAM;AAAA,IACN,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,aAAN,cAAyB,QAAQ;AAAA,EACpC,YAAY;AACR,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,aAAa;AACT,WAAO,KAAK,KAAK,OAAO,KAAK,aAAa,sBAAsB,aAC1D,KAAK,KAAK,OAAO,WAAW,IAC5B,KAAK,KAAK;AAAA,EACpB;AAAA,EACA,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAI,IAAI,KAAK,oBAAoB,KAAK;AACtD,UAAM,SAAS,KAAK,KAAK,UAAU;AACnC,UAAM,WAAW;AAAA,MACb,UAAU,CAAC,QAAQ;AACf,0BAAkB,KAAK,GAAG;AAC1B,YAAI,IAAI,OAAO;AACX,iBAAO,MAAM;AAAA,QACjB,OACK;AACD,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ;AAAA,MACA,IAAI,OAAO;AACP,eAAO,IAAI;AAAA,MACf;AAAA,IACJ;AACA,aAAS,WAAW,SAAS,SAAS,KAAK,QAAQ;AACnD,QAAI,OAAO,SAAS,cAAc;AAC9B,YAAM,YAAY,OAAO,UAAU,IAAI,MAAM,QAAQ;AACrD,UAAI,IAAI,OAAO,OAAO;AAClB,eAAO,QAAQ,QAAQ,SAAS,EAAE,KAAK,OAAOC,eAAc;AACxD,cAAI,OAAO,UAAU;AACjB,mBAAO;AACX,gBAAM,SAAS,MAAM,KAAK,KAAK,OAAO,YAAY;AAAA,YAC9C,MAAMA;AAAA,YACN,MAAM,IAAI;AAAA,YACV,QAAQ;AAAA,UACZ,CAAC;AACD,cAAI,OAAO,WAAW;AAClB,mBAAO;AACX,cAAI,OAAO,WAAW;AAClB,mBAAO,MAAM,OAAO,KAAK;AAC7B,cAAI,OAAO,UAAU;AACjB,mBAAO,MAAM,OAAO,KAAK;AAC7B,iBAAO;AAAA,QACX,CAAC;AAAA,MACL,OACK;AACD,YAAI,OAAO,UAAU;AACjB,iBAAO;AACX,cAAM,SAAS,KAAK,KAAK,OAAO,WAAW;AAAA,UACvC,MAAM;AAAA,UACN,MAAM,IAAI;AAAA,UACV,QAAQ;AAAA,QACZ,CAAC;AACD,YAAI,OAAO,WAAW;AAClB,iBAAO;AACX,YAAI,OAAO,WAAW;AAClB,iBAAO,MAAM,OAAO,KAAK;AAC7B,YAAI,OAAO,UAAU;AACjB,iBAAO,MAAM,OAAO,KAAK;AAC7B,eAAO;AAAA,MACX;AAAA,IACJ;AACA,QAAI,OAAO,SAAS,cAAc;AAC9B,YAAM,oBAAoB,CAAC,QAAQ;AAC/B,cAAM,SAAS,OAAO,WAAW,KAAK,QAAQ;AAC9C,YAAI,IAAI,OAAO,OAAO;AAClB,iBAAO,QAAQ,QAAQ,MAAM;AAAA,QACjC;AACA,YAAI,kBAAkB,SAAS;AAC3B,gBAAM,IAAI,MAAM,2FAA2F;AAAA,QAC/G;AACA,eAAO;AAAA,MACX;AACA,UAAI,IAAI,OAAO,UAAU,OAAO;AAC5B,cAAM,QAAQ,KAAK,KAAK,OAAO,WAAW;AAAA,UACtC,MAAM,IAAI;AAAA,UACV,MAAM,IAAI;AAAA,UACV,QAAQ;AAAA,QACZ,CAAC;AACD,YAAI,MAAM,WAAW;AACjB,iBAAO;AACX,YAAI,MAAM,WAAW;AACjB,iBAAO,MAAM;AAEjB,0BAAkB,MAAM,KAAK;AAC7B,eAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,MAAM;AAAA,MACtD,OACK;AACD,eAAO,KAAK,KAAK,OAAO,YAAY,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAI,CAAC,EAAE,KAAK,CAAC,UAAU;AACjG,cAAI,MAAM,WAAW;AACjB,mBAAO;AACX,cAAI,MAAM,WAAW;AACjB,mBAAO,MAAM;AACjB,iBAAO,kBAAkB,MAAM,KAAK,EAAE,KAAK,MAAM;AAC7C,mBAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,MAAM,MAAM;AAAA,UACtD,CAAC;AAAA,QACL,CAAC;AAAA,MACL;AAAA,IACJ;AACA,QAAI,OAAO,SAAS,aAAa;AAC7B,UAAI,IAAI,OAAO,UAAU,OAAO;AAC5B,cAAM,OAAO,KAAK,KAAK,OAAO,WAAW;AAAA,UACrC,MAAM,IAAI;AAAA,UACV,MAAM,IAAI;AAAA,UACV,QAAQ;AAAA,QACZ,CAAC;AACD,YAAI,CAAC,QAAQ,IAAI;AACb,iBAAO;AACX,cAAM,SAAS,OAAO,UAAU,KAAK,OAAO,QAAQ;AACpD,YAAI,kBAAkB,SAAS;AAC3B,gBAAM,IAAI,MAAM,iGAAiG;AAAA,QACrH;AACA,eAAO,EAAE,QAAQ,OAAO,OAAO,OAAO,OAAO;AAAA,MACjD,OACK;AACD,eAAO,KAAK,KAAK,OAAO,YAAY,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAI,CAAC,EAAE,KAAK,CAAC,SAAS;AAChG,cAAI,CAAC,QAAQ,IAAI;AACb,mBAAO;AACX,iBAAO,QAAQ,QAAQ,OAAO,UAAU,KAAK,OAAO,QAAQ,CAAC,EAAE,KAAK,CAAC,YAAY;AAAA,YAC7E,QAAQ,OAAO;AAAA,YACf,OAAO;AAAA,UACX,EAAE;AAAA,QACN,CAAC;AAAA,MACL;AAAA,IACJ;AACA,SAAK,YAAY,MAAM;AAAA,EAC3B;AACJ;AACA,WAAW,SAAS,CAAC,QAAQ,QAAQ,WAAW;AAC5C,SAAO,IAAI,WAAW;AAAA,IAClB;AAAA,IACA,UAAU,sBAAsB;AAAA,IAChC;AAAA,IACA,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACA,WAAW,uBAAuB,CAAC,YAAY,QAAQ,WAAW;AAC9D,SAAO,IAAI,WAAW;AAAA,IAClB;AAAA,IACA,QAAQ,EAAE,MAAM,cAAc,WAAW,WAAW;AAAA,IACpD,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AAEO,IAAM,cAAN,cAA0B,QAAQ;AAAA,EACrC,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,WAAW;AACxC,aAAO,GAAG,MAAS;AAAA,IACvB;AACA,WAAO,KAAK,KAAK,UAAU,OAAO,KAAK;AAAA,EAC3C;AAAA,EACA,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACA,YAAY,SAAS,CAAC,MAAM,WAAW;AACnC,SAAO,IAAI,YAAY;AAAA,IACnB,WAAW;AAAA,IACX,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,cAAN,cAA0B,QAAQ;AAAA,EACrC,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,MAAM;AACnC,aAAO,GAAG,IAAI;AAAA,IAClB;AACA,WAAO,KAAK,KAAK,UAAU,OAAO,KAAK;AAAA,EAC3C;AAAA,EACA,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACA,YAAY,SAAS,CAAC,MAAM,WAAW;AACnC,SAAO,IAAI,YAAY;AAAA,IACnB,WAAW;AAAA,IACX,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,aAAN,cAAyB,QAAQ;AAAA,EACpC,OAAO,OAAO;AACV,UAAM,EAAE,IAAI,IAAI,KAAK,oBAAoB,KAAK;AAC9C,QAAI,OAAO,IAAI;AACf,QAAI,IAAI,eAAe,cAAc,WAAW;AAC5C,aAAO,KAAK,KAAK,aAAa;AAAA,IAClC;AACA,WAAO,KAAK,KAAK,UAAU,OAAO;AAAA,MAC9B;AAAA,MACA,MAAM,IAAI;AAAA,MACV,QAAQ;AAAA,IACZ,CAAC;AAAA,EACL;AAAA,EACA,gBAAgB;AACZ,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACA,WAAW,SAAS,CAAC,MAAM,WAAW;AAClC,SAAO,IAAI,WAAW;AAAA,IAClB,WAAW;AAAA,IACX,UAAU,sBAAsB;AAAA,IAChC,cAAc,OAAO,OAAO,YAAY,aAAa,OAAO,UAAU,MAAM,OAAO;AAAA,IACnF,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,WAAN,cAAuB,QAAQ;AAAA,EAClC,OAAO,OAAO;AACV,UAAM,EAAE,IAAI,IAAI,KAAK,oBAAoB,KAAK;AAE9C,UAAM,SAAS;AAAA,MACX,GAAG;AAAA,MACH,QAAQ;AAAA,QACJ,GAAG,IAAI;AAAA,QACP,QAAQ,CAAC;AAAA,MACb;AAAA,IACJ;AACA,UAAM,SAAS,KAAK,KAAK,UAAU,OAAO;AAAA,MACtC,MAAM,OAAO;AAAA,MACb,MAAM,OAAO;AAAA,MACb,QAAQ;AAAA,QACJ,GAAG;AAAA,MACP;AAAA,IACJ,CAAC;AACD,QAAI,QAAQ,MAAM,GAAG;AACjB,aAAO,OAAO,KAAK,CAACC,YAAW;AAC3B,eAAO;AAAA,UACH,QAAQ;AAAA,UACR,OAAOA,QAAO,WAAW,UACnBA,QAAO,QACP,KAAK,KAAK,WAAW;AAAA,YACnB,IAAI,QAAQ;AACR,qBAAO,IAAI,SAAS,OAAO,OAAO,MAAM;AAAA,YAC5C;AAAA,YACA,OAAO,OAAO;AAAA,UAClB,CAAC;AAAA,QACT;AAAA,MACJ,CAAC;AAAA,IACL,OACK;AACD,aAAO;AAAA,QACH,QAAQ;AAAA,QACR,OAAO,OAAO,WAAW,UACnB,OAAO,QACP,KAAK,KAAK,WAAW;AAAA,UACnB,IAAI,QAAQ;AACR,mBAAO,IAAI,SAAS,OAAO,OAAO,MAAM;AAAA,UAC5C;AAAA,UACA,OAAO,OAAO;AAAA,QAClB,CAAC;AAAA,MACT;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,cAAc;AACV,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACA,SAAS,SAAS,CAAC,MAAM,WAAW;AAChC,SAAO,IAAI,SAAS;AAAA,IAChB,WAAW;AAAA,IACX,UAAU,sBAAsB;AAAA,IAChC,YAAY,OAAO,OAAO,UAAU,aAAa,OAAO,QAAQ,MAAM,OAAO;AAAA,IAC7E,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,SAAN,cAAqB,QAAQ;AAAA,EAChC,OAAO,OAAO;AACV,UAAM,aAAa,KAAK,SAAS,KAAK;AACtC,QAAI,eAAe,cAAc,KAAK;AAClC,YAAM,MAAM,KAAK,gBAAgB,KAAK;AACtC,wBAAkB,KAAK;AAAA,QACnB,MAAM,aAAa;AAAA,QACnB,UAAU,cAAc;AAAA,QACxB,UAAU,IAAI;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACX;AACA,WAAO,EAAE,QAAQ,SAAS,OAAO,MAAM,KAAK;AAAA,EAChD;AACJ;AACA,OAAO,SAAS,CAAC,WAAW;AACxB,SAAO,IAAI,OAAO;AAAA,IACd,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AACO,IAAM,QAAQ,OAAO,WAAW;AAChC,IAAM,aAAN,cAAyB,QAAQ;AAAA,EACpC,OAAO,OAAO;AACV,UAAM,EAAE,IAAI,IAAI,KAAK,oBAAoB,KAAK;AAC9C,UAAM,OAAO,IAAI;AACjB,WAAO,KAAK,KAAK,KAAK,OAAO;AAAA,MACzB;AAAA,MACA,MAAM,IAAI;AAAA,MACV,QAAQ;AAAA,IACZ,CAAC;AAAA,EACL;AAAA,EACA,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACO,IAAM,cAAN,MAAM,qBAAoB,QAAQ;AAAA,EACrC,OAAO,OAAO;AACV,UAAM,EAAE,QAAQ,IAAI,IAAI,KAAK,oBAAoB,KAAK;AACtD,QAAI,IAAI,OAAO,OAAO;AAClB,YAAM,cAAc,YAAY;AAC5B,cAAM,WAAW,MAAM,KAAK,KAAK,GAAG,YAAY;AAAA,UAC5C,MAAM,IAAI;AAAA,UACV,MAAM,IAAI;AAAA,UACV,QAAQ;AAAA,QACZ,CAAC;AACD,YAAI,SAAS,WAAW;AACpB,iBAAO;AACX,YAAI,SAAS,WAAW,SAAS;AAC7B,iBAAO,MAAM;AACb,iBAAO,MAAM,SAAS,KAAK;AAAA,QAC/B,OACK;AACD,iBAAO,KAAK,KAAK,IAAI,YAAY;AAAA,YAC7B,MAAM,SAAS;AAAA,YACf,MAAM,IAAI;AAAA,YACV,QAAQ;AAAA,UACZ,CAAC;AAAA,QACL;AAAA,MACJ;AACA,aAAO,YAAY;AAAA,IACvB,OACK;AACD,YAAM,WAAW,KAAK,KAAK,GAAG,WAAW;AAAA,QACrC,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,QAAQ;AAAA,MACZ,CAAC;AACD,UAAI,SAAS,WAAW;AACpB,eAAO;AACX,UAAI,SAAS,WAAW,SAAS;AAC7B,eAAO,MAAM;AACb,eAAO;AAAA,UACH,QAAQ;AAAA,UACR,OAAO,SAAS;AAAA,QACpB;AAAA,MACJ,OACK;AACD,eAAO,KAAK,KAAK,IAAI,WAAW;AAAA,UAC5B,MAAM,SAAS;AAAA,UACf,MAAM,IAAI;AAAA,UACV,QAAQ;AAAA,QACZ,CAAC;AAAA,MACL;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,OAAO,OAAO,GAAG,GAAG;AAChB,WAAO,IAAI,aAAY;AAAA,MACnB,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,UAAU,sBAAsB;AAAA,IACpC,CAAC;AAAA,EACL;AACJ;AACO,IAAM,cAAN,cAA0B,QAAQ;AAAA,EACrC,OAAO,OAAO;AACV,UAAM,SAAS,KAAK,KAAK,UAAU,OAAO,KAAK;AAC/C,UAAM,SAAS,CAAC,SAAS;AACrB,UAAI,QAAQ,IAAI,GAAG;AACf,aAAK,QAAQ,OAAO,OAAO,KAAK,KAAK;AAAA,MACzC;AACA,aAAO;AAAA,IACX;AACA,WAAO,QAAQ,MAAM,IAAI,OAAO,KAAK,CAAC,SAAS,OAAO,IAAI,CAAC,IAAI,OAAO,MAAM;AAAA,EAChF;AAAA,EACA,SAAS;AACL,WAAO,KAAK,KAAK;AAAA,EACrB;AACJ;AACA,YAAY,SAAS,CAAC,MAAM,WAAW;AACnC,SAAO,IAAI,YAAY;AAAA,IACnB,WAAW;AAAA,IACX,UAAU,sBAAsB;AAAA,IAChC,GAAG,oBAAoB,MAAM;AAAA,EACjC,CAAC;AACL;AAQA,SAAS,YAAY,QAAQ,MAAM;AAC/B,QAAM,IAAI,OAAO,WAAW,aAAa,OAAO,IAAI,IAAI,OAAO,WAAW,WAAW,EAAE,SAAS,OAAO,IAAI;AAC3G,QAAM,KAAK,OAAO,MAAM,WAAW,EAAE,SAAS,EAAE,IAAI;AACpD,SAAO;AACX;AACO,SAAS,OAAO,OAAO,UAAU,CAAC,GAWzC,OAAO;AACH,MAAI;AACA,WAAO,OAAO,OAAO,EAAE,YAAY,CAAC,MAAM,QAAQ;AAC9C,YAAM,IAAI,MAAM,IAAI;AACpB,UAAI,aAAa,SAAS;AACtB,eAAO,EAAE,KAAK,CAACC,OAAM;AACjB,cAAI,CAACA,IAAG;AACJ,kBAAM,SAAS,YAAY,SAAS,IAAI;AACxC,kBAAM,SAAS,OAAO,SAAS,SAAS;AACxC,gBAAI,SAAS,EAAE,MAAM,UAAU,GAAG,QAAQ,OAAO,OAAO,CAAC;AAAA,UAC7D;AAAA,QACJ,CAAC;AAAA,MACL;AACA,UAAI,CAAC,GAAG;AACJ,cAAM,SAAS,YAAY,SAAS,IAAI;AACxC,cAAM,SAAS,OAAO,SAAS,SAAS;AACxC,YAAI,SAAS,EAAE,MAAM,UAAU,GAAG,QAAQ,OAAO,OAAO,CAAC;AAAA,MAC7D;AACA;AAAA,IACJ,CAAC;AACL,SAAO,OAAO,OAAO;AACzB;AAEO,IAAM,OAAO;AAAA,EAChB,QAAQ,UAAU;AACtB;AACO,IAAI;AAAA,CACV,SAAUC,wBAAuB;AAC9B,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,QAAQ,IAAI;AAClC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,cAAc,IAAI;AACxC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,QAAQ,IAAI;AAClC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,uBAAuB,IAAI;AACjD,EAAAA,uBAAsB,iBAAiB,IAAI;AAC3C,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,WAAW,IAAI;AACrC,EAAAA,uBAAsB,QAAQ,IAAI;AAClC,EAAAA,uBAAsB,QAAQ,IAAI;AAClC,EAAAA,uBAAsB,aAAa,IAAI;AACvC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,SAAS,IAAI;AACnC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,eAAe,IAAI;AACzC,EAAAA,uBAAsB,aAAa,IAAI;AACvC,EAAAA,uBAAsB,aAAa,IAAI;AACvC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,UAAU,IAAI;AACpC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,YAAY,IAAI;AACtC,EAAAA,uBAAsB,aAAa,IAAI;AACvC,EAAAA,uBAAsB,aAAa,IAAI;AAC3C,GAAG,0BAA0B,wBAAwB,CAAC,EAAE;AAKxD,IAAM,iBAAiB,CAEvB,KAAK,SAAS;AAAA,EACV,SAAS,yBAAyB,IAAI,IAAI;AAC9C,MAAM,OAAO,CAAC,SAAS,gBAAgB,KAAK,MAAM;AAClD,IAAM,aAAa,UAAU;AAC7B,IAAM,aAAa,UAAU;AAC7B,IAAM,UAAU,OAAO;AACvB,IAAM,aAAa,UAAU;AAC7B,IAAM,cAAc,WAAW;AAC/B,IAAM,WAAW,QAAQ;AACzB,IAAM,aAAa,UAAU;AAC7B,IAAM,gBAAgB,aAAa;AACnC,IAAM,WAAW,QAAQ;AACzB,IAAM,UAAU,OAAO;AACvB,IAAM,cAAc,WAAW;AAC/B,IAAM,YAAY,SAAS;AAC3B,IAAM,WAAW,QAAQ;AACzB,IAAM,YAAY,SAAS;AAC3B,IAAM,aAAa,UAAU;AAC7B,IAAM,mBAAmB,UAAU;AACnC,IAAM,YAAY,SAAS;AAC3B,IAAM,yBAAyB,sBAAsB;AACrD,IAAM,mBAAmB,gBAAgB;AACzC,IAAM,YAAY,SAAS;AAC3B,IAAM,aAAa,UAAU;AAC7B,IAAM,UAAU,OAAO;AACvB,IAAM,UAAU,OAAO;AACvB,IAAM,eAAe,YAAY;AACjC,IAAM,WAAW,QAAQ;AACzB,IAAM,cAAc,WAAW;AAC/B,IAAM,WAAW,QAAQ;AACzB,IAAM,iBAAiB,cAAc;AACrC,IAAM,cAAc,WAAW;AAC/B,IAAM,cAAc,WAAW;AAC/B,IAAM,eAAe,YAAY;AACjC,IAAM,eAAe,YAAY;AACjC,IAAM,iBAAiB,WAAW;AAClC,IAAM,eAAe,YAAY;AACjC,IAAM,UAAU,MAAM,WAAW,EAAE,SAAS;AAC5C,IAAM,UAAU,MAAM,WAAW,EAAE,SAAS;AAC5C,IAAM,WAAW,MAAM,YAAY,EAAE,SAAS;AACvC,IAAM,SAAS;AAAA,EAClB,SAAS,CAAC,QAAQ,UAAU,OAAO,EAAE,GAAG,KAAK,QAAQ,KAAK,CAAC;AAAA,EAC3D,SAAS,CAAC,QAAQ,UAAU,OAAO,EAAE,GAAG,KAAK,QAAQ,KAAK,CAAC;AAAA,EAC3D,UAAU,CAAC,QAAQ,WAAW,OAAO;AAAA,IACjC,GAAG;AAAA,IACH,QAAQ;AAAA,EACZ,CAAC;AAAA,EACD,SAAS,CAAC,QAAQ,UAAU,OAAO,EAAE,GAAG,KAAK,QAAQ,KAAK,CAAC;AAAA,EAC3D,OAAO,CAAC,QAAQ,QAAQ,OAAO,EAAE,GAAG,KAAK,QAAQ,KAAK,CAAC;AAC3D;AAEO,IAAM,QAAQ;;;AC1mHd,IAAM,mBAAmB;AACzB,IAAM,8BAA8B,KAAK;AACzC,IAAM,2BAA2B,IAAI,OAAO;AAEnD,IAAM,wBAAwB,IAAI,WAAW,CAAC,IAAM,IAAM,IAAM,EAAI,CAAC;AACrE,IAAM,0BAA0B;AAChC,IAAM,+BAA+B;AACrC,IAAM,gCAAgC;AAE/B,IAAM,eAAe;EAC1B;EACA;EACA;EACA;;AAGK,IAAM,oBAAoB;EAC/B;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAGK,IAAM,aAAa;EACxB;EACA;EACA;EACA;;AAyPF,IAAM,kBAAkB,iBAAE,KAAK,UAAU;AACzC,IAAM,oBAAoB,iBAAE,KAAK,YAAY;AAC7C,IAAM,yBAAyB,iBAAE,KAAK,iBAAiB;AAEhD,IAAM,sBAAsB,iBAAE,OAAO;EAC1C,GAAG,iBAAE,QAAQ,gBAAgB;EAC7B,IAAI,iBAAE,OAAM,EAAG,IAAI,CAAC;EACpB,MAAM;EACN,WAAW,iBAAE,OAAM,EAAG,IAAG,EAAG,SAAQ;EACpC,SAAS,iBAAE,QAAO;CACnB;AAEM,IAAM,qBAAqB,iBAAE,OAAO;EACzC,GAAG,iBAAE,QAAQ,gBAAgB;EAC7B,IAAI,iBAAE,OAAM,EAAG,IAAI,CAAC;EACpB,MAAM;EACN,WAAW,iBAAE,OAAM,EAAG,IAAG,EAAG,SAAQ;EACpC,SAAS,iBAAE,QAAO;CACnB,EAAE,OAAM;AAMT,IAAM,gBAAgB,iBAAE,KAAK,CAAC,OAAO,OAAO,QAAQ,OAAO,CAAC;AAC5D,IAAM,wBAAwB,iBAAE,KAAK,CAAC,OAAO,QAAQ,OAAO,CAAC;AAEtD,IAAM,qBAAqB,iBAAE,OAAO;EACzC,MAAM,iBAAE,KAAK,CAAC,QAAQ,QAAQ,CAAC;EAC/B,UAAU,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC1B,aAAa,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC7B,WAAW,iBAAE,MAAM,iBAAE,OAAM,EAAG,IAAG,CAAE,EAAE,IAAI,CAAC;EAC1C,cAAc,iBAAE,MAAM,iBAAE,OAAM,CAAE;EAChC,eAAe,iBAAE,OAAM,EAAG,SAAQ;CACnC;AAEM,IAAM,wBAAwB,iBAAE,OAAO;EAC5C,UAAU,iBAAE,QAAQ,gBAAgB;EACpC,eAAe,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC/B,qBAAqB,iBAAE,OAAM,EAAG,IAAI,CAAC;EACrC,qBAAqB,iBAAE,OAAM,EAAG,IAAG,EAAG,SAAQ;EAC9C,sBAAsB,iBAAE,OAAM,EAAG,IAAG,EAAG,SAAQ;EAC/C,oBAAoB,iBAAE,OAAM,EAAG,IAAG,EAAG,SAAQ;EAC7C,eAAe,iBAAE,QAAO,EAAG,SAAQ;EACnC,yBAAyB,iBAAE,OAAM,EAAG,IAAG,EAAG,SAAQ,EAAG,SAAQ;CAC9D;AAEM,IAAM,8BAA8B,iBAAE,OAAO;EAClD,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC9B,qBAAqB,iBAAE,MAAM,aAAa,EAAE,IAAI,CAAC;CAClD;AAEM,IAAM,+BAA+B,iBAAE,OAAO;EACnD,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC9B,gBAAgB,iBAAE,OAAM,EAAG,IAAI,CAAC;EAChC,mBAAmB,iBAAE,OAAM,EAAG,IAAI,CAAC;EACnC,eAAe,iBAAE,QAAQ,SAAS;EAClC,qBAAqB,iBAAE,MAAM,aAAa,EAAE,IAAI,CAAC;CAClD;AAEM,IAAM,+BAA+B,iBAAE,OAAO;EACnD,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;CAC/B;AAEM,IAAM,+BAA+B,iBAAE,OAAO;EACnD,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC9B,MAAM,iBAAE,OAAM,EAAG,SAAQ;EACzB,SAAS,iBAAE,OAAM,EAAG,SAAQ;CAC7B;AAEM,IAAM,+BAA+B,iBAAE,OAAO;EACnD,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC9B,gBAAgB,iBAAE,OAAM,EAAG,IAAI,CAAC;EAChC,MAAM,iBAAE,OAAM,EAAG,IAAG,EAAG,SAAQ;EAC/B,MAAM,iBAAE,OAAM,EAAG,IAAI,CAAC;CACvB;AAEM,IAAM,qBAAqB,iBAAE,OAAO;EACzC,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC9B,gBAAgB,iBAAE,OAAM,EAAG,IAAI,CAAC;EAChC,SAAS,iBAAE,OAAM,EAAG,IAAG,EAAG,YAAW;EACrC,YAAY,iBAAE,OAAM,EAAG,IAAI,CAAC;CAC7B;AAEM,IAAM,sBAAsB,iBAAE,OAAO;EAC1C,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC9B,gBAAgB,iBAAE,OAAM,EAAG,IAAI,CAAC;EAChC,KAAK,iBAAE,OAAM,EAAG,IAAI,CAAC;CACtB;AAEM,IAAM,yBAAyB,iBAAE,OAAO;EAC7C,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC9B,gBAAgB,iBAAE,OAAM,EAAG,IAAI,CAAC;EAChC,WAAW,iBAAE,OAAO;IAClB,WAAW,iBAAE,OAAM,EAAG,SAAQ;IAC9B,QAAQ,iBAAE,OAAM,EAAG,SAAQ,EAAG,SAAQ;IACtC,eAAe,iBAAE,OAAM,EAAG,IAAG,EAAG,SAAQ,EAAG,SAAQ;IACnD,kBAAkB,iBAAE,OAAM,EAAG,SAAQ,EAAG,SAAQ;GACjD;CACF;AAEM,IAAM,iCAAiC,iBAAE,OAAO;EACrD,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC9B,gBAAgB,iBAAE,OAAM,EAAG,IAAI,CAAC;EAChC,WAAW;CACZ;AAEM,IAAM,wBAAwB,iBAAE,OAAO;EAC5C,OAAO,iBAAE,OAAM,EAAG,IAAI,CAAC;CACxB;AAEM,IAAM,4BAA4B,iBAAE,OAAO;EAChD,MAAM,iBAAE,OAAM,EAAG,IAAI,CAAC;EACtB,SAAS,iBAAE,OAAM,EAAG,IAAI,CAAC;EACzB,WAAW,iBAAE,QAAO,EAAG,SAAQ;EAC/B,cAAc,iBAAE,OAAM,EAAG,IAAI,CAAC,EAAE,SAAQ;CACzC;AAED,IAAM,6BAAkE;EACtE,SAAS;EACT,aAAa;EACb,mBAAmB;EACnB,oBAAoB;EACpB,oBAAoB;EACpB,oBAAoB;EACpB,oBAAoB;EACpB,SAAS;EACT,gBAAgB;EAChB,iBAAiB;EACjB,cAAc;EACd,sBAAsB;EACtB,QAAQ;EACR,QAAQ;EACR,SAAS;;AAGJ,IAAM,0BAA0B,iBAAE,OAAO;EAC9C,QAAQ;EACR,QAAQ,iBAAE,QAAO;CAClB;AAEM,IAAM,2BAA2B,iBAAE,OAAO;EAC/C,WAAW,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC3B,QAAQ,iBAAE,QAAO;CAClB;AAEM,IAAM,wBAAoD,iBAAE,OAAO;EACxE,WAAW,iBAAE,OAAM,EAAG,IAAI,CAAC;EAC3B,MAAM,iBAAE,OAAM,EAAG,IAAI,CAAC;EACtB,SAAS,iBAAE,OAAM,EAAG,IAAI,CAAC;EACzB,WAAW,iBAAE,QAAO,EAAG,SAAQ;EAC/B,SAAS,iBAAE,QAAO,EAAG,SAAQ;CAC9B;AAEK,SAAU,cACd,MACA,SACA,KAAK,eAAc,GAAE;AAErB,SAAO;IACL,GAAG;IACH;IACA;IACA,WAAW,KAAK,IAAG;IACnB;;AAEJ;AAEM,SAAU,mBACd,MACA,SACA,KAAK,eAAc,GAAE;AAErB,SAAO;IACL,GAAG;IACH;IACA;IACA,WAAW,KAAK,IAAG;IACnB;;AAEJ;AAEM,SAAU,iBACd,QACA,QACA,IAAW;AAEX,SAAO,cAAc,eAAe,EAAE,QAAQ,OAAM,GAAI,EAAE;AAC5D;AAEM,SAAU,kBACd,WACA,QAAe;AAEf,SAAO,cAAc,gBAAgB,EAAE,WAAW,OAAM,CAAE;AAC5D;AAEM,SAAU,eACd,WACA,MACA,SACA,SACA,WAAmB;AAEnB,SAAO,cAAc,aAAa,EAAE,WAAW,MAAM,SAAS,SAAS,UAAS,CAAE;AACpF;AAEM,SAAU,YACd,OACA,MACA,UAAgD,CAAA,GAAE;AAElD,SAAO,cAAc,SAAS,EAAE,OAAO,MAAM,GAAG,QAAO,CAAE;AAC3D;AAEM,SAAU,mBAAmB,OAAc;AAC/C,SAAO,oBAAoB,MAAM,KAAK;AACxC;AAEM,SAAU,kBAAkB,OAAc;AAC9C,QAAM,QAAQ,mBAAmB,MAAM,KAAK;AAC5C,QAAM,gBAAgB,2BAA2B,MAAM,IAAI;AAC3D,MAAI,eAAe;AACjB,WAAO,EAAE,GAAG,OAAO,SAAS,cAAc,MAAM,MAAM,OAAO,EAAC;EAChE;AACA,SAAO;AACT;AAEM,SAAU,cAAc,SAAsB;AAClD,SAAO,IAAI,YAAW,EAAG,OAAO,KAAK,UAAU,OAAO,CAAC;AACzD;AAEM,SAAU,cAAc,MAAyB;AACrD,QAAM,OAAO,OAAO,SAAS,WAAW,OAAO,IAAI,YAAW,EAAG,OAAO,IAAI;AAC5E,SAAO,mBAAmB,KAAK,MAAM,IAAI,CAAC;AAC5C;AAcM,IAAO,qBAAP,MAAyB;EACrB,gBAAgB;EACP,aAAa,oBAAI,IAAG;EAErC,OAAO,SAAmB;AACxB,QAAI,QAAQ,aAAa,0BAA0B;AACjD,YAAM,IAAI,MAAM,8CAA8C;IAChE;AACA,QAAI,QAAQ,cAAc;AAA6B,aAAO,CAAC,OAAO;AAEtE,UAAM,YAAY,KAAK;AACvB,SAAK,gBAAgB,cAAc,aAAc,IAAI,YAAY;AACjE,UAAM,QAAQ,KAAK,KAAK,QAAQ,aAAa,2BAA2B;AACxE,UAAM,SAAuB,CAAA;AAC7B,aAAS,QAAQ,GAAG,QAAQ,OAAO,SAAS,GAAG;AAC7C,YAAM,QAAQ,QAAQ;AACtB,YAAM,QAAQ,QAAQ,SAAS,OAAO,KAAK,IAAI,QAAQ,YAAY,QAAQ,2BAA2B,CAAC;AACvG,YAAM,QAAQ,IAAI,WAAW,+BAA+B,MAAM,UAAU;AAC5E,YAAM,IAAI,qBAAqB;AAC/B,YAAM,CAAC,IAAI;AACX,YAAM,OAAO,IAAI,SAAS,MAAM,MAAM;AACtC,WAAK,UAAU,GAAG,SAAS;AAC3B,WAAK,UAAU,GAAG,KAAK;AACvB,WAAK,UAAU,IAAI,KAAK;AACxB,WAAK,UAAU,IAAI,QAAQ,UAAU;AACrC,YAAM,IAAI,OAAO,4BAA4B;AAC7C,aAAO,KAAK,KAAK;IACnB;AACA,WAAO;EACT;EAEA,OAAO,OAAiB;AACtB,QAAI,CAAC,iBAAiB,KAAK;AAAG,aAAO;AACrC,QAAI,MAAM,aAAa,gCAAgC,MAAM,CAAC,MAAM,yBAAyB;AAC3F,YAAM,IAAI,MAAM,oCAAoC;IACtD;AACA,UAAM,OAAO,IAAI,SAAS,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU;AAC1E,UAAM,YAAY,KAAK,UAAU,CAAC;AAClC,UAAM,QAAQ,KAAK,UAAU,CAAC;AAC9B,UAAM,QAAQ,KAAK,UAAU,EAAE;AAC/B,UAAM,aAAa,KAAK,UAAU,EAAE;AACpC,QAAI,cAAc,KAAK,QAAQ,KAAK,SAAS,SAAS,cAAc,+BAC/D,aAAa,4BACb,UAAU,KAAK,KAAK,aAAa,2BAA2B,GAAG;AAClE,YAAM,IAAI,MAAM,sCAAsC;IACxD;AACA,UAAM,qBAAqB,KAAK,IAC9B,6BACA,aAAa,QAAQ,2BAA2B;AAElD,UAAM,QAAQ,MAAM,SAAS,4BAA4B;AACzD,QAAI,MAAM,eAAe;AAAoB,YAAM,IAAI,MAAM,oCAAoC;AAEjG,QAAI,WAAW,KAAK,WAAW,IAAI,SAAS;AAC5C,QAAI,aAAa,QAAW;AAC1B,UAAI,UAAU,KAAK,KAAK,WAAW,QAAQ,+BAA+B;AACxE,cAAM,IAAI,MAAM,sCAAsC;MACxD;AACA,iBAAW,EAAE,OAAO,YAAY,eAAe,GAAG,QAAQ,CAAA,EAAE;AAC5D,WAAK,WAAW,IAAI,WAAW,QAAQ;IACzC;AACA,QAAI,SAAS,UAAU,SAAS,SAAS,eAAe,cAAc,UAAU,SAAS,OAAO,QAAQ;AACtG,WAAK,WAAW,OAAO,SAAS;AAChC,YAAM,IAAI,MAAM,sCAAsC;IACxD;AACA,aAAS,OAAO,KAAK,WAAW,KAAK,KAAK,CAAC;AAC3C,aAAS,iBAAiB,MAAM;AAChC,QAAI,SAAS,OAAO,SAAS;AAAO,aAAO;AAC3C,SAAK,WAAW,OAAO,SAAS;AAChC,QAAI,SAAS,kBAAkB;AAAY,YAAM,IAAI,MAAM,mCAAmC;AAC9F,UAAM,UAAU,IAAI,WAAW,UAAU;AACzC,QAAI,SAAS;AACb,eAAW,QAAQ,SAAS,QAAQ;AAClC,cAAQ,IAAI,MAAM,MAAM;AACxB,gBAAU,KAAK;IACjB;AACA,WAAO;EACT;EAEA,QAAK;AACH,SAAK,gBAAgB;AACrB,SAAK,WAAW,MAAK;EACvB;;AAGF,SAAS,iBAAiB,OAAiB;AACzC,MAAI,MAAM,aAAa,sBAAsB;AAAY,WAAO;AAChE,WAAS,QAAQ,GAAG,QAAQ,sBAAsB,YAAY,SAAS,GAAG;AACxE,QAAI,MAAM,KAAK,MAAM,sBAAsB,KAAK;AAAG,aAAO;EAC5D;AACA,SAAO;AACT;AAEA,SAAS,iBAAc;AACrB,QAAM,IAAI,WAAW;AACrB,MAAI,GAAG;AAAY,WAAO,EAAE,WAAU;AACtC,SAAO,OAAO,KAAK,IAAG,EAAG,SAAS,EAAE,CAAC,IAAI,KAAK,OAAM,EAAG,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;AAC9E;;;ACvmBM,IAAO,mBAAP,MAAuB;EAOE;EAA6C;EANzD,UAAU,oBAAI,IAAG;EACjB,gBAAgB,oBAAI,IAAG;EAChC;EACA;EACS,gBAAgB,oBAAI,IAAG;EAExC,YAA6B,WAA6C,YAAY,KAAM;AAA/D,SAAA,YAAA;AAA6C,SAAA,YAAA;EAAqB;EAE/F,MAAM,UAAO;AACX,QAAI,KAAK,yBAAyB;AAAW;AAC7C,SAAK,uBAAuB,KAAK,UAAU,UAAU,UAAQ,KAAK,cAAc,IAAI,CAAC;AACrF,SAAK,mBAAmB,KAAK,UAAU,UAAU,MAAM,KAAK,qBAAoB,CAAE;AAClF,QAAI;AACF,YAAM,KAAK,UAAU,QAAO;IAC9B,SAAS,OAAO;AACd,WAAK,qBAAoB;AACzB,WAAK,uBAAuB;AAC5B,WAAK,mBAAkB;AACvB,WAAK,mBAAmB;AACxB,YAAM;IACR;EACF;EAEA,MAAM,IAA0C,QAAgB,QAAiB,QAAoB;AACnG,YAAQ,eAAc;AACtB,UAAM,UAAU,iBAAiB,QAAqB,MAAM;AAC5D,UAAM,SAAS,IAAI,QAAiB,CAACC,UAAS,WAAU;AACtD,YAAM,QAAQ,WAAW,MAAK;AAC5B,cAAMC,WAAU,KAAK,QAAQ,IAAI,QAAQ,EAAE;AAC3C,QAAAA,UAAS,cAAa;AACtB,aAAK,QAAQ,OAAO,QAAQ,EAAE;AAC9B,eAAO,IAAI,MAAM,OAAO,MAAM,YAAY,CAAC;MAC7C,GAAG,KAAK,SAAS;AACjB,YAAM,UAAuB,EAAE,SAASD,UAAqC,QAAQ,MAAK;AAC1F,UAAI,WAAW,QAAW;AACxB,cAAM,UAAU,MAAK;AACnB,cAAI,KAAK,QAAQ,IAAI,QAAQ,EAAE,MAAM;AAAS;AAC9C,uBAAa,KAAK;AAClB,eAAK,QAAQ,OAAO,QAAQ,EAAE;AAC9B,iBAAO,OAAO,kBAAkB,QAAQ,OAAO,SAAS,IAAI,MAAM,mBAAmB,CAAC;QACxF;AACA,eAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAI,CAAE;AACxD,gBAAQ,cAAc,MAAM,OAAO,oBAAoB,SAAS,OAAO;MACzE;AACA,WAAK,QAAQ,IAAI,QAAQ,IAAI,OAAO;IACtC,CAAC;AACD,QAAI;AACF,YAAM,KAAK,UAAU,KAAK,cAAc,OAAO,CAAC;IAClD,SAAS,OAAO;AACd,YAAM,UAAU,KAAK,QAAQ,IAAI,QAAQ,EAAE;AAC3C,UAAI,YAAY,QAAW;AACzB,qBAAa,QAAQ,KAAK;AAC1B,gBAAQ,cAAa;MACvB;AACA,WAAK,QAAQ,OAAO,QAAQ,EAAE;AAC9B,YAAM;IACR;AACA,WAAO;EACT;EAEA,QAAQ,SAAsC;AAC5C,SAAK,cAAc,IAAI,OAAO;AAC9B,WAAO,MAAM,KAAK,cAAc,OAAO,OAAO;EAChD;EAEA,QAAQ,SAAmB;AACzB,SAAK,cAAc,IAAI,OAAO;AAC9B,WAAO,MAAM,KAAK,cAAc,OAAO,OAAO;EAChD;EAEA,WAAQ;AACN,WAAO,KAAK,UAAU,SAAQ;EAChC;EAEA,MAAM,QAAK;AACT,SAAK,uBAAsB;AAC3B,SAAK,uBAAuB;AAC5B,SAAK,mBAAkB;AACvB,SAAK,mBAAmB;AACxB,UAAM,KAAK,UAAU,MAAK;AAC1B,eAAW,WAAW,KAAK,QAAQ,OAAM,GAAI;AAC3C,mBAAa,QAAQ,KAAK;AAC1B,cAAQ,cAAa;AACrB,cAAQ,OAAO,IAAI,MAAM,sBAAsB,CAAC;IAClD;AACA,SAAK,QAAQ,MAAK;EACpB;EAEQ,uBAAoB;AAC1B,eAAW,WAAW,KAAK,QAAQ,OAAM,GAAI;AAC3C,mBAAa,QAAQ,KAAK;AAC1B,cAAQ,cAAa;AACrB,cAAQ,OAAO,IAAI,MAAM,yBAAyB,CAAC;IACrD;AACA,SAAK,QAAQ,MAAK;AAClB,eAAW,WAAW,KAAK;AAAe,cAAO;EACnD;EAEQ,cAAc,MAAgB;AACpC,UAAM,UAAU,cAAc,IAAI;AAClC,QAAI,QAAQ,SAAS;AAAgB,WAAK,eAAe,OAA4C;AACrG,QAAI,QAAQ,SAAS;AAAa,WAAK,YAAY,OAAyC;AAC5F,QAAI,QAAQ,SAAS,SAAS;AAC5B,YAAM,QAAQ,QAAQ;AACtB,iBAAW,WAAW,KAAK;AAAe,gBAAQ,KAAK;IACzD;EACF;EAEQ,eAAe,SAA0C;AAC/D,UAAM,UAAU,KAAK,QAAQ,IAAI,QAAQ,QAAQ,SAAS;AAC1D,QAAI,YAAY;AAAW;AAC3B,SAAK,QAAQ,OAAO,QAAQ,QAAQ,SAAS;AAC7C,iBAAa,QAAQ,KAAK;AAC1B,YAAQ,cAAa;AACrB,YAAQ,QAAQ,QAAQ,QAAQ,MAAM;EACxC;EAEQ,YAAY,SAAuC;AACzD,UAAM,UAAU,KAAK,QAAQ,IAAI,QAAQ,QAAQ,SAAS;AAC1D,QAAI,YAAY;AAAW;AAC3B,SAAK,QAAQ,OAAO,QAAQ,QAAQ,SAAS;AAC7C,iBAAa,QAAQ,KAAK;AAC1B,YAAQ,cAAa;AACrB,YAAQ,OAAO,OAAO,OAAO,IAAI,MAAM,QAAQ,QAAQ,OAAO,GAAG,EAAE,MAAM,QAAQ,QAAQ,KAAI,CAAE,CAAC;EAClG;;;;AC9HI,IAAgB,gBAAhB,MAA6B;EACvB,WAAW,oBAAI,IAAG;EAClB,gBAAgB,oBAAI,IAAG;EAEjC,UAAU,IAAkB;AAC1B,SAAK,SAAS,IAAI,EAAE;AACpB,WAAO,MAAM,KAAK,SAAS,OAAO,EAAE;EACtC;EAEA,QAAQ,IAAc;AACpB,SAAK,cAAc,IAAI,EAAE;AACzB,WAAO,MAAM,KAAK,cAAc,OAAO,EAAE;EAC3C;EAEU,KAAK,MAAgB;AAC7B,eAAW,WAAW,KAAK;AAAU,cAAQ,IAAI;EACnD;EAEU,YAAS;AACjB,eAAW,WAAW,KAAK;AAAe,cAAO;EACnD;;;;ACvCF,eAAsB,WAAW,MAAiC;AAChE,MAAI,OAAO,SAAS;AAAU,WAAO;AACrC,MAAI,gBAAgB;AAAa,WAAO,IAAI,YAAW,EAAG,OAAO,IAAI;AACrE,SAAO,IAAI,YAAW,EAAG,OAAO,MAAM,KAAK,YAAW,CAAE;AAC1D;AAEM,SAAU,YAAY,OAAiB;AAC3C,QAAM,SAAS,MAAM,KAAK,OAAO,UAAQ,OAAO,aAAa,IAAI,CAAC,EAAE,KAAK,EAAE;AAC3E,QAAM,SAAS,OAAO,SAAS,aAAa,KAAK,MAAM,IAAI,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ;AAC/F,SAAO,OAAO,WAAW,KAAK,GAAG,EAAE,WAAW,KAAK,GAAG,EAAE,WAAW,KAAK,EAAE;AAC5E;AAEM,SAAU,cAAc,OAAa;AACzC,QAAM,aAAa,MAAM,WAAW,KAAK,GAAG,EAAE,WAAW,KAAK,GAAG;AACjE,QAAM,SAAS,WAAW,OAAO,KAAK,KAAK,WAAW,SAAS,CAAC,IAAI,GAAG,GAAG;AAC1E,MAAI,OAAO,SAAS;AAAY,WAAO,WAAW,KAAK,KAAK,MAAM,GAAG,UAAQ,KAAK,WAAW,CAAC,CAAC;AAC/F,SAAO,IAAI,WAAW,OAAO,KAAK,QAAQ,QAAQ,CAAC;AACrD;;;AC6DO,IAAM,yBAAyB;AAC/B,IAAM,2BAA2B,EAAE,SAAS,KAAI;AAOjD,SAAU,oBAAiB;AAC/B,SAAO;IACL,OAAO,eAAa;AAGlB,YAAM,MAAM,IAAI,kBAAkB,aAAa;AAC/C,aAAO;QACL,IAAI,kBAAe;AAAa,iBAAO,IAAI;QAA0B;QACrE,IAAI,qBAAkB;AAAa,iBAAO,IAAI;QAA6B;QAC3E,IAAI,oBAAiB;AAAa,iBAAO,IAAI;QAA4B;QACzE,IAAI,iBAAc;AAAa,iBAAO,IAAI;QAAyB;QACnE,IAAI,wBAAwB,OAAK;AAAI,cAAI,0BAA0B;QAAM;QACzE,IAAI,0BAAuB;AAAK,iBAAO,IAAI;QAA+C;QAC1F,IAAI,2BAA2B,OAAK;AAAI,cAAI,6BAA6B;QAAM;QAC/E,IAAI,6BAA0B;AAAK,iBAAO,IAAI;QAAkD;QAChG,IAAI,0BAA0B,OAAK;AAAI,cAAI,4BAA4B;QAAM;QAC7E,IAAI,4BAAyB;AAAK,iBAAO,IAAI;QAAiD;QAC9F,IAAI,eAAe,OAAK;AAAI,cAAI,iBAAiB;QAAM;QACvD,IAAI,iBAAc;AAAK,iBAAO,IAAI;QAAsF;QACxH,IAAI,cAAc,OAAK;AAAI,cAAI,gBAAgB;QAAM;QACrD,IAAI,gBAAa;AAAK,iBAAO,IAAI;QAAuE;QACxG,kBAAkB,OAAO,SAAO;AAAI,iBAAO,iBAAiB,IAAI,kBAAkB,OAAO,OAAO,CAAC;QAAE;QACnG,cAAW;AAAK,iBAAO,IAAI,YAAW;QAAG;QACzC,eAAY;AAAK,iBAAO,IAAI,aAAY;QAAG;QAC3C,oBAAoB,aAAW;AAAI,iBAAO,IAAI,oBAAoB,WAAW;QAAE;QAC/E,qBAAqB,aAAW;AAAI,iBAAO,IAAI,qBAAqB,WAAW;QAAE;QACjF,gBAAgB,WAAS;AAAI,iBAAO,IAAI,gBAAgB,SAAS;QAAE;QACnE,MAAM,WAAQ;AAAK,iBAAO,MAAM,IAAI,SAAQ;QAAG;QAC/C,QAAK;AAAK,cAAI,MAAK;QAAG;;IAE1B;;AAEJ;AAEA,SAAS,iBAAiB,KAAmB;AAC3C,SAAO;IACL,IAAI,QAAK;AAAa,aAAO,IAAI;IAAM;IACvC,IAAI,UAAO;AAAc,aAAO,IAAI;IAAQ;IAC5C,IAAI,aAAU;AAAK,aAAO,IAAI;IAAW;IACzC,IAAI,iBAAc;AAAa,aAAO,IAAI;IAAe;IACzD,IAAI,aAAU;AAAa,aAAO,IAAI;IAAW;IACjD,IAAI,OAAO,OAAK;AAAI,UAAI,SAAS;IAAM;IACvC,IAAI,SAAM;AAAK,aAAO,IAAI;IAA8B;IACxD,IAAI,UAAU,OAAK;AAAI,UAAI,YAAY;IAAM;IAC7C,IAAI,YAAS;AAAK,aAAO,IAAI;IAAsE;IACnG,IAAI,QAAQ,OAAK;AAAI,UAAI,UAAU;IAAM;IACzC,IAAI,UAAO;AAAK,aAAO,IAAI;IAA+B;IAC1D,IAAI,QAAQ,OAAK;AAAI,UAAI,UAAU;IAAM;IACzC,IAAI,UAAO;AAAK,aAAO,IAAI;IAA+B;IAC1D,IAAI,oBAAoB,OAAK;AAAI,UAAI,sBAAsB;IAAM;IACjE,IAAI,sBAAmB;AAAK,aAAO,IAAI;IAA2C;IAClF,KAAK,MAAI;AAAI,UAAI,KAAK,IAAa;IAAE;IACrC,QAAK;AAAK,UAAI,MAAK;IAAG;;AAE1B;;;ACxHO,IAAM,kBAAkB,IAAI,WAAW,CAAC,IAAM,IAAM,IAAM,EAAI,CAAC;AAC/D,IAAM,yBAAyB;AAC/B,IAAM,0BAA0B,IAAI;AACpC,IAAM,8BAA8B,IAAI,OAAO;AACtD,IAAM,sBAAsB,KAAK,KAAK,8BAA8B,uBAAuB;AAC3F,IAAM,yBAAyB;AAC/B,IAAM,sBAAsB;AAUtB,IAAO,gBAAP,MAAoB;EAChB,gBAAgB;EACP,aAAa,oBAAI,IAAG;EAErC,OAAO,MAAgB;AACrB,QAAI,KAAK,cAAc;AAAyB,aAAO,CAAC,IAAI;AAC5D,QAAI,KAAK,aAAa,6BAA6B;AACjD,YAAM,IAAI,MAAM,wDAAwD;IAC1E;AACA,UAAM,YAAY,KAAK;AACvB,SAAK,gBAAgB,cAAc,aAAc,IAAI,YAAY;AACjE,UAAM,QAAQ,KAAK,KAAK,KAAK,aAAa,uBAAuB;AACjE,UAAM,SAAuB,CAAA;AAC7B,aAAS,QAAQ,GAAG,QAAQ,OAAO,SAAS,GAAG;AAC7C,YAAM,QAAQ,QAAQ;AACtB,YAAM,QAAQ,KAAK,SAAS,OAAO,KAAK,IAAI,KAAK,YAAY,QAAQ,uBAAuB,CAAC;AAC7F,YAAM,QAAQ,IAAI,WAAW,yBAAyB,MAAM,UAAU;AACtE,YAAM,IAAI,eAAe;AACzB,YAAM,OAAO,IAAI,SAAS,MAAM,MAAM;AACtC,WAAK,UAAU,GAAG,SAAS;AAC3B,WAAK,UAAU,GAAG,KAAK;AACvB,WAAK,UAAU,IAAI,KAAK;AACxB,YAAM,IAAI,OAAO,sBAAsB;AACvC,aAAO,KAAK,KAAK;IACnB;AACA,WAAO;EACT;EAEA,OAAO,OAAiB;AACtB,QAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,UAAI,MAAM,aAAa,6BAA6B;AAClD,cAAM,IAAI,MAAM,wDAAwD;MAC1E;AACA,aAAO;IACT;AACA,QAAI,MAAM,aAAa;AAAwB,YAAM,IAAI,MAAM,2CAA2C;AAC1G,UAAM,OAAO,IAAI,SAAS,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU;AAC1E,UAAM,YAAY,KAAK,UAAU,CAAC;AAClC,UAAM,QAAQ,KAAK,UAAU,CAAC;AAC9B,UAAM,QAAQ,KAAK,UAAU,EAAE;AAC/B,QAAI,cAAc,KAAK,QAAQ,KAAK,QAAQ,uBAAuB,SAAS,OAAO;AACjF,YAAM,IAAI,MAAM,6CAA6C;IAC/D;AACA,UAAM,QAAQ,MAAM,SAAS,sBAAsB;AACnD,QAAI,MAAM,aAAa,2BACjB,QAAQ,QAAQ,KAAK,MAAM,eAAe,2BAC1C,UAAU,QAAQ,KAAK,MAAM,eAAe,GAAI;AACpD,YAAM,IAAI,MAAM,2CAA2C;IAC7D;AAEA,SAAK,WAAU;AACf,QAAI,WAAW,KAAK,WAAW,IAAI,SAAS;AAC5C,QAAI,aAAa,QAAW;AAC1B,UAAI,UAAU,KAAK,KAAK,WAAW,QAAQ,wBAAwB;AACjE,cAAM,IAAI,MAAM,6CAA6C;MAC/D;AACA,iBAAW,EAAE,WAAW,OAAO,eAAe,GAAG,QAAQ,CAAA,GAAI,WAAW,KAAK,IAAG,EAAE;AAClF,WAAK,WAAW,IAAI,WAAW,QAAQ;IACzC;AACA,QAAI,SAAS,UAAU,SAAS,UAAU,SAAS,OAAO,QAAQ;AAChE,WAAK,WAAW,OAAO,SAAS;AAChC,YAAM,IAAI,MAAM,6CAA6C;IAC/D;AACA,UAAM,gBAAgB,SAAS,gBAAgB,MAAM;AACrD,QAAI,gBAAgB,6BAA6B;AAC/C,WAAK,WAAW,OAAO,SAAS;AAChC,YAAM,IAAI,MAAM,wDAAwD;IAC1E;AACA,aAAS,OAAO,KAAK,WAAW,KAAK,KAAK,CAAC;AAC3C,aAAS,gBAAgB;AACzB,aAAS,YAAY,KAAK,IAAG;AAC7B,QAAI,SAAS,OAAO,SAAS;AAAO,aAAO;AAC3C,SAAK,WAAW,OAAO,SAAS;AAChC,UAAM,UAAU,IAAI,WAAW,SAAS,aAAa;AACrD,QAAI,SAAS;AACb,eAAW,QAAQ,SAAS,QAAQ;AAClC,cAAQ,IAAI,MAAM,MAAM;AACxB,gBAAU,KAAK;IACjB;AACA,WAAO;EACT;EAEA,QAAK;AACH,SAAK,gBAAgB;AACrB,SAAK,WAAW,MAAK;EACvB;EAEQ,aAAU;AAChB,UAAM,MAAM,KAAK,IAAG;AACpB,eAAW,CAAC,WAAW,QAAQ,KAAK,KAAK,YAAY;AACnD,UAAI,MAAM,SAAS,YAAY;AAAqB,aAAK,WAAW,OAAO,SAAS;IACtF;EACF;;AAGF,SAAS,QAAQ,OAAiB;AAChC,MAAI,MAAM,aAAa,gBAAgB;AAAY,WAAO;AAC1D,WAAS,QAAQ,GAAG,QAAQ,gBAAgB,YAAY,SAAS,GAAG;AAClE,QAAI,MAAM,KAAK,MAAM,gBAAgB,KAAK;AAAG,aAAO;EACtD;AACA,SAAO;AACT;;;ACtGA,IAAM,+BAA+B;AACrC,IAAM,0BAA0B;AAW1B,IAAO,0BAAP,MAA8B;EACjB;EACA;EACA;EACA;EACA;EACA;EAET;EACS,mBAA0C,CAAA;EACnD,uBAAuB;EACvB,SAAS;EACT,SAAS;EAEA,kBAAkB,oBAAI,IAAG;EACzB,gBAAgB,oBAAI,IAAG;EACvB,gBAAgB,oBAAI,IAAG;EAEhC;EACA;EACA;EACA;EACA;EACA;EAES,WAAW,IAAI,cAAa;EAC5B,WAAW,IAAI,cAAa;EACrC,YAAY;EACZ,gBAAgB;EAChB;EACA,qBAAqB;EAE7B,YAAY,SAAuC;AACjD,SAAK,OAAO,QAAQ;AACpB,SAAK,WAAW,QAAQ;AACxB,SAAK,qBAAqB,QAAQ,sBAAsB;AACxD,SAAK,eAAe,QAAQ,gBAAgB;AAC5C,SAAK,gBAAgB,QAAQ,iBAAiB;AAE9C,SAAK,KAAK,QAAQ,QAAQ,OAAO,EAAE,YAAY,QAAQ,WAAU,CAAE;AACnE,SAAK,GAAG,gBAAgB,WAAS,KAAK,aAAa,MAAM,OAAO;AAChE,SAAK,GAAG,iBAAiB,WAAQ;AAC/B,UAAI,MAAM,cAAc,QAAQ,CAAC,KAAK,QAAQ;AAC5C,aAAK,SAAS,EAAE,MAAM,OAAO,WAAW,MAAM,UAAS,CAAE;MAC3D;IACF;AACA,SAAK,GAAG,0BAA0B,MAAM,KAAK,qBAAoB;AACjE,SAAK,GAAG,6BAA6B,MAAM,KAAK,qBAAoB;EACtE;;EAGA,QAAQ,QAAoB;AAC1B,QAAI,KAAK;AAAQ,aAAO,QAAQ,QAAO;AACvC,QAAI,KAAK,mBAAmB;AAAW,aAAO,KAAK;AACnD,SAAK,SAAS,MAAM;AACpB,SAAK,iBAAiB,IAAI,QAAc,CAACE,UAAS,WAAU;AAC1D,WAAK,cAAcA;AACnB,WAAK,aAAa;AAClB,WAAK,iBAAiB,WAAW,MAAK;AACpC,aAAK,SAAS,IAAI,gBAAgB,uBAAuB,sCAAsC,KAAK,kBAAkB,KAAK,CAAC;MAC9H,GAAG,KAAK,kBAAkB;AAC1B,UAAI,KAAK,SAAS,aAAa;AAC7B,aAAK,KAAK,eAAc,EAAG,MAAM,WAAS,KAAK,SAAS,QAAQ,KAAK,CAAC,CAAC;MACzE;IACF,CAAC;AACD,WAAO,KAAK;EACd;EAEA,aAAa,QAAiB;AAC5B,QAAI,KAAK;AAAQ;AACjB,QAAI,OAAO,SAAS;AAAS,WAAK,KAAK,YAAY,OAAO,GAAG;aACpD,OAAO,SAAS;AAAU,WAAK,KAAK,aAAa,OAAO,GAAG;;AAC/D,WAAK,KAAK,UAAU,OAAO,SAAS;EAC3C;EAEA,MAAM,KAAK,MAAgB;AACzB,UAAM,UAAU,KAAK,mBAAkB;AACvC,QAAI,QAAQ,eAAe;AAAQ,YAAM,IAAI,MAAM,kCAAkC;AACrF,eAAW,SAAS,KAAK,SAAS,OAAO,IAAI,GAAG;AAC9C,UAAI;AACF,gBAAQ,KAAK,cAAc,KAAK,CAAC;MACnC,SAAS,OAAO;AACd,gBAAQ,MAAM,4BAA4B,MAAM,YAAY,iBAAiB,QAAQ,MAAM,UAAU,KAAK;AAC1G,cAAM;MACR;IACF;AACA,SAAK,aAAa,KAAK;AACvB,SAAK,YAAY,OAAO;EAC1B;EAEA,UAAU,SAAmC;AAC3C,SAAK,gBAAgB,IAAI,OAAO;AAChC,WAAO,MAAM,KAAK,gBAAgB,OAAO,OAAO;EAClD;EAEA,QAAQ,SAAmB;AACzB,SAAK,cAAc,IAAI,OAAO;AAC9B,WAAO,MAAM,KAAK,cAAc,OAAO,OAAO;EAChD;EAEA,QAAQ,SAA+B;AACrC,SAAK,cAAc,IAAI,OAAO;AAC9B,WAAO,MAAM,KAAK,cAAc,OAAO,OAAO;EAChD;EAEA,oBAAiB;AACf,WAAO,KAAK;EACd;EAEA,WAAQ;AACN,UAAM,YAAY,KAAK,SAAS,eAAe;AAC/C,WAAO;MACL,MAAM,CAAC,YAAY,iBAAiB,KAAK,aAAa,SAAS,SAAS;MACxE;MACA,WAAW,KAAK;MAChB,eAAe,KAAK;;EAExB;;EAGA,MAAM,QAAK;AACT,QAAI,KAAK;AAAQ;AACjB,SAAK,SAAS;AACd,SAAK,iBAAgB;AACrB,SAAK,cAAa;AAClB,UAAM,UAAU,KAAK;AACrB,SAAK,UAAU;AACf,QAAI,YAAY,QAAW;AACzB,cAAQ,SAAS;AACjB,cAAQ,YAAY;AACpB,cAAQ,UAAU;AAClB,cAAQ,UAAU;AAClB,cAAQ,sBAAsB;AAC9B,UAAI;AAAE,gBAAQ,MAAK;MAAG,QAAQ;MAAuB;IACvD;AACA,SAAK,GAAG,iBAAiB;AACzB,SAAK,GAAG,gBAAgB;AACxB,SAAK,GAAG,0BAA0B;AAClC,SAAK,GAAG,6BAA6B;AACrC,QAAI;AAAE,WAAK,GAAG,MAAK;IAAG,QAAQ;IAAuB;AACrD,QAAI,KAAK,QAAQ;AACf,WAAK,SAAS;AACd,iBAAW,WAAW,KAAK;AAAe,gBAAO;IACnD;EACF;EAEQ,SAAS,QAA+B;AAC9C,SAAK,cAAa;AAClB,SAAK,cAAc;AACnB,QAAI,WAAW;AAAW;AAC1B,UAAM,UAAU,MAAK;AACnB,WAAK,SAAS,IAAI,gBAAgB,eAAe,iCAAiC,CAAC;IACrF;AACA,WAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAI,CAAE;AACxD,SAAK,cAAc,MAAM,OAAO,oBAAoB,SAAS,OAAO;AACpE,QAAI,OAAO;AAAS,cAAO;EAC7B;EAEQ,MAAM,iBAAc;AAC1B,UAAM,UAAU,KAAK,GAAG,kBAAkB,KAAK,cAAc,wBAAwB;AACrF,SAAK,aAAa,OAAO;AACzB,UAAM,QAAQ,MAAM,KAAK,GAAG,YAAW;AACvC,UAAM,KAAK,GAAG,oBAAoB,KAAK;AACvC,SAAK,SAAS,EAAE,MAAM,SAAS,KAAK,WAAW,KAAK,EAAC,CAAE;EACzD;EAEQ,MAAM,YAAY,KAAW;AACnC,QAAI,KAAK,SAAS,eAAe,KAAK,sBAAsB;AAC1D,WAAK,SAAS,IAAI,gBAAgB,qBAAqB,sCAAsC,CAAC;AAC9F;IACF;AACA,QAAI;AACF,YAAM,KAAK,GAAG,qBAAqB,EAAE,MAAM,SAAS,IAAG,CAAE;AACzD,WAAK,uBAAuB;AAC5B,YAAM,KAAK,sBAAqB;AAChC,YAAM,SAAS,MAAM,KAAK,GAAG,aAAY;AACzC,YAAM,KAAK,GAAG,oBAAoB,MAAM;AACxC,WAAK,SAAS,EAAE,MAAM,UAAU,KAAK,WAAW,MAAM,EAAC,CAAE;IAC3D,SAAS,OAAO;AACd,WAAK,SAAS,QAAQ,KAAK,CAAC;IAC9B;EACF;EAEQ,MAAM,aAAa,KAAW;AACpC,QAAI,KAAK,SAAS,eAAe,KAAK,sBAAsB;AAC1D,WAAK,SAAS,IAAI,gBAAgB,qBAAqB,uCAAuC,CAAC;AAC/F;IACF;AACA,QAAI;AACF,YAAM,KAAK,GAAG,qBAAqB,EAAE,MAAM,UAAU,IAAG,CAAE;AAC1D,WAAK,uBAAuB;AAC5B,YAAM,KAAK,sBAAqB;IAClC,SAAS,OAAO;AACd,WAAK,SAAS,QAAQ,KAAK,CAAC;IAC9B;EACF;EAEQ,MAAM,UAAU,WAA8B;AACpD,QAAI,CAAC,KAAK,sBAAsB;AAC9B,WAAK,iBAAiB,KAAK,SAAS;AACpC;IACF;AACA,QAAI;AACF,YAAM,KAAK,GAAG,gBAAgB,SAAS;IACzC,QAAQ;IAGR;EACF;EAEQ,MAAM,wBAAqB;AACjC,UAAM,WAAW,KAAK,iBAAiB,OAAO,GAAG,KAAK,iBAAiB,MAAM;AAC7E,eAAW,aAAa,UAAU;AAChC,UAAI;AAAE,cAAM,KAAK,GAAG,gBAAgB,SAAS;MAAE,QAAQ;MAAgB;IACzE;EACF;EAEQ,aAAa,SAAuB;AAC1C,QAAI,KAAK,YAAY,UAAa,KAAK,YAAY,SAAS;AAC1D,UAAI;AAAE,gBAAQ,MAAK;MAAG,QAAQ;MAAgB;AAC9C;IACF;AACA,SAAK,UAAU;AACf,YAAQ,aAAa;AACrB,YAAQ,SAAS,MAAK;AACpB,UAAI,KAAK,UAAU,KAAK;AAAQ;AAChC,WAAK,SAAS;AACd,YAAMA,WAAU,KAAK;AACrB,WAAK,iBAAgB;AACrB,WAAK,KAAK,yBAAwB,EAAG,KAAK,MAAMA,WAAS,CAAE;IAC7D;AACA,YAAQ,YAAY,WAAQ;AAC1B,UAAI,KAAK,UAAU,CAAC,KAAK;AAAQ;AACjC,YAAM,OAAO,MAAM;AACnB,YAAM,QAAQ,OAAO,SAAS,WAAW,IAAI,YAAW,EAAG,OAAO,IAAI,IAAI,IAAI,WAAW,IAAI;AAC7F,WAAK,iBAAiB,MAAM;AAC5B,UAAI;AACF,cAAM,UAAU,KAAK,SAAS,OAAO,KAAK;AAC1C,YAAI,YAAY;AAAW;AAC3B,mBAAW,WAAW,KAAK;AAAiB,kBAAQ,OAAO;MAC7D,QAAQ;AACN,aAAK,KAAK,MAAK;MACjB;IACF;AACA,YAAQ,UAAU,MAAK;AACrB,UAAI,KAAK;AAAQ;AACjB,WAAK,SAAS,IAAI,gBAAgB,cAAc,6BAA6B,CAAC;AAC9E,UAAI,KAAK,QAAQ;AACf,aAAK,SAAS;AACd,mBAAW,WAAW,KAAK;AAAe,kBAAO;MACnD;IACF;AACA,YAAQ,UAAU,MAAK;AACrB,YAAM,QAAQ,IAAI,gBAAgB,cAAc,wCAAwC;AACxF,WAAK,SAAS,KAAK;AACnB,iBAAW,WAAW,KAAK;AAAe,gBAAQ,KAAK;IACzD;EACF;EAEQ,MAAM,2BAAwB;AACpC,QAAI;AACF,WAAK,WAAW,wBAAwB,MAAM,KAAK,GAAG,SAAQ,CAAE;IAClE,QAAQ;AACN,WAAK,WAAW;IAClB;EACF;EAEQ,uBAAoB;AAC1B,QAAI,KAAK,UAAU,KAAK;AAAQ;AAChC,QAAI,KAAK,GAAG,oBAAoB,YAAY,KAAK,GAAG,uBAAuB,YACtE,KAAK,GAAG,oBAAoB,YAAY,KAAK,GAAG,uBAAuB,UAAU;AACpF,WAAK,SAAS,IAAI,gBAAgB,cAAc,+DAA+D,CAAC;IAClH;EACF;EAEQ,SAAS,OAAY;AAC3B,QAAI,KAAK,UAAU,KAAK,UAAU,KAAK,eAAe;AAAW;AACjE,UAAM,SAAS,KAAK;AACpB,SAAK,iBAAgB;AACrB,SAAK,cAAc;AACnB,SAAK,aAAa;AAClB,WAAO,KAAK;AACZ,SAAK,KAAK,MAAK;EACjB;EAEQ,mBAAgB;AACtB,QAAI,KAAK,mBAAmB;AAAW,mBAAa,KAAK,cAAc;AACvE,SAAK,iBAAiB;AACtB,SAAK,cAAa;AAClB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,SAAK,aAAa;EACpB;EAEQ,qBAAkB;AACxB,UAAM,UAAU,KAAK;AACrB,QAAI,YAAY,UAAa,QAAQ,eAAe,UAAU,KAAK,UAAU,CAAC,KAAK,QAAQ;AACzF,YAAM,IAAI,MAAM,kCAAkC;IACpD;AACA,WAAO;EACT;EAEQ,YAAY,SAAuB;AACzC,QAAI,KAAK,kBAAkB,UAAa,KAAK;AAAQ;AACrD,UAAM,WAAW,QAAQ;AACzB,QAAI,YAAY;AAAG;AACnB,SAAK,qBAAqB;AAC1B,SAAK,gBAAgB,WAAW,MAAK;AACnC,WAAK,gBAAgB;AACrB,UAAI,KAAK,UAAU,KAAK,YAAY,WAAW,QAAQ,eAAe;AAAQ;AAC9E,YAAM,UAAU,QAAQ;AACxB,UAAI,UAAU,KAAK,WAAW,KAAK,oBAAoB;AAIrD,cAAM,QAAQ,IAAI,gBAAgB,oBAAoB,2BAA2B;AACjF,mBAAW,WAAW,KAAK;AAAe,kBAAQ,KAAK;AACvD,aAAK,KAAK,MAAK;AACf;MACF;AACA,WAAK,qBAAqB;AAC1B,UAAI,UAAU;AAAG,aAAK,YAAY,OAAO;IAC3C,GAAG,KAAK,aAAa;EACvB;EAEQ,gBAAa;AACnB,QAAI,KAAK,kBAAkB;AAAW,mBAAa,KAAK,aAAa;AACrE,SAAK,gBAAgB;AACrB,SAAK,qBAAqB;EAC5B;;AAGI,IAAO,kBAAP,cAA+B,MAAK;EACnB;EAArB,YAAqB,MAAc,SAAe;AAAI,UAAM,OAAO;AAA9C,SAAA,OAAA;EAAgD;;AAGjE,SAAU,wBAAwB,OAAe;AAGrD,QAAM,iBAAiB,oBAAI,IAAG;AAC9B,QAAM,gBAAiC,CAAA;AACvC,aAAW,CAAC,EAAE,KAAK,KAAK,OAAO;AAC7B,QAAI,MAAM,SAAS,qBAAqB,MAAM,SAAS,oBAAoB;AACzE,UAAI,OAAO,MAAM,kBAAkB,YAAY,MAAM,OAAO,QAAW;AACrE,uBAAe,IAAI,OAAO,MAAM,EAAE,GAAG,MAAM,aAAa;MAC1D;IACF,WAAW,MAAM,SAAS,oBAAoB,MAAM,SAAS,aAAa;AACxE,UAAI,MAAM,aAAa,QAAQ,MAAM,cAAc;AAAM,sBAAc,KAAK,KAAK;IACnF;EACF;AACA,aAAW,QAAQ,eAAe;AAChC,UAAM,QAAQ,eAAe,IAAI,OAAO,KAAK,gBAAgB,CAAC;AAC9D,UAAM,SAAS,eAAe,IAAI,OAAO,KAAK,iBAAiB,CAAC;AAChE,QAAI,UAAU,WAAW,WAAW;AAAS,aAAO;AACpD,QAAI,UAAU,UAAa,WAAW;AAAW,aAAO;EAC1D;AACA,SAAO;AACT;AAEA,SAAS,WAAW,aAAuD;AACzE,MAAI,OAAO,YAAY,QAAQ,YAAY,YAAY,IAAI,WAAW,GAAG;AACvE,UAAM,IAAI,gBAAgB,cAAc,wDAAwD;EAClG;AACA,SAAO,YAAY;AACrB;AAEA,SAAS,cAAc,MAAgB;AACrC,MAAI,KAAK,eAAe,KAAK,KAAK,eAAe,KAAK,OAAO;AAAY,WAAO,KAAK;AACrF,SAAO,KAAK,MAAK,EAAG;AACtB;AAEA,SAAS,QAAQ,OAAc;AAC7B,SAAO,iBAAiB,QAAQ,QAAQ,IAAI,gBAAgB,cAAc,4BAA4B;AACxG;;;ACrYA,IAAM,uBAAuB,CAAC,iBAAiB,kBAAkB,mBAAmB,gBAAgB;AACpG,IAAM,+BAA+B,CAAC,OAAO,QAAQ,OAAO;AAYtD,IAAO,oBAAP,cAAiC,cAAa;EAiB/B;EACA;EAjBF,oBAAoB,oBAAI,IAAG;EACpC;EACA;EACA,eAAe;EACf,YAAY;EACZ,gBAAgB;EAChB,WAA+B;EAC/B;EACA;EACA;EACA;EACA;EACA,gBAAgB;EAChB;EAER,YACmB,KACA,SAAiC;AAElD,UAAK;AAHY,SAAA,MAAA;AACA,SAAA,UAAA;EAGnB;EAEA,MAAM,UAAO;AACX,QAAI,KAAK,WAAW;AAAW;AAC/B,SAAK,SAAS,IAAI,UAAU,KAAK,GAAG;AACpC,SAAK,OAAO,aAAa;AACzB,UAAM,IAAI,QAAc,CAACC,UAAS,WAAU;AAC1C,WAAK,eAAeA;AACpB,WAAK,cAAc;AACnB,WAAK,iBAAiB,WACpB,MAAM,KAAK,eAAe,IAAI,MAAM,sCAAsC,CAAC,GAC3E,KAAK,QAAQ,sBAAsB,IAAM;AAE3C,YAAM,SAAS,KAAK;AACpB,aAAO,YAAY,WAAQ;AAAG,aAAK,KAAK,oBAAoB,MAAM,IAAI;MAAE;AACxE,aAAO,SAAS,MAAK;AACnB,aAAK,YAAY,SAAS;UACxB,MAAM,KAAK,QAAQ;UACnB,UAAU,KAAK,QAAQ;UACvB,aAAa,KAAK,QAAQ;UAC1B,WAAW,CAAC,gBAAgB;UAC5B,cAAc,KAAK,QAAQ,gBAAgB;SAC5C;MACH;AACA,aAAO,UAAU,MAAM,KAAK,eAAe,IAAI,MAAM,0CAA0C,KAAK,GAAG,EAAE,CAAC;AAC1G,aAAO,UAAU,MAAK;AACpB,cAAM,UAAU,KAAK,gBAAgB;AACrC,YAAI;AAAS,eAAK,eAAe,IAAI,MAAM,qDAAqD,CAAC;AACjG,aAAK,SAAS;AACd,aAAK,eAAe;AACpB,aAAK,UAAS;MAChB;IACF,CAAC;EACH;EAEA,MAAM,KAAK,MAAgB;AACzB,QAAI,KAAK,iBAAiB;AAAW,YAAM,IAAI,MAAM,4CAA4C;AACjG,QAAI,KAAK,aAAa,UAAU;AAC9B,YAAM,MAAM,KAAK;AACjB,UAAI,QAAQ;AAAW,cAAM,IAAI,MAAM,sCAAsC;AAC7E,WAAK,aAAa,KAAK;AACvB,YAAM,IAAI,KAAK,IAAI;AACnB;IACF;AACA,QAAI,KAAK,QAAQ,eAAe,UAAU;AAAM,YAAM,IAAI,MAAM,qCAAqC;AACrG,SAAK,aAAa,KAAK;AACvB,SAAK,YAAY,SAAS;MACxB,cAAc,KAAK;MACnB,gBAAgB,KAAK,QAAQ;MAC7B,SAAS,KAAK;MACd,YAAY,YAAY,IAAI;KACN;AACxB,SAAK,gBAAgB;EACvB;EAEA,iBAAc;AACZ,QAAI,KAAK,iBAAiB;AAAW,YAAM,IAAI,MAAM,4CAA4C;AACjG,WAAO;MACL,cAAc,KAAK;MACnB,eAAe,KAAK,QAAQ;MAC5B,gBAAgB,KAAK,QAAQ;;EAEjC;EAEA,MAAM,cAAc,MAAc,MAAgB;AAChD,QAAI,KAAK,QAAQ,eAAe,UAAU,QAAQ,KAAK,iBAAiB,QAAW;AACjF,YAAM,IAAI,MAAM,4CAA4C;IAC9D;AACA,SAAK,YAAY,oBAAoB;MACnC,cAAc,KAAK;MACnB,gBAAgB,KAAK,QAAQ;MAC7B;MACA,MAAM,YAAY,IAAI;KACU;EACpC;EAEA,YAAY,IAA4C;AACtD,SAAK,kBAAkB,IAAI,EAAE;AAC7B,WAAO,MAAM,KAAK,kBAAkB,OAAO,EAAE;EAC/C;EAEA,MAAM,QAAK;AACT,SAAK,eAAc;AACnB,UAAM,KAAK,KAAK,MAAK;AACrB,SAAK,MAAM;AACX,SAAK,QAAQ,MAAK;AAClB,SAAK,SAAS;AACd,SAAK,eAAe;EACtB;EAEA,WAAQ;AACN,UAAM,kBAAkB,KAAK,aAAa,YAAY,KAAK,KAAK,SAAQ,EAAG,cAAc;AACzF,UAAM,iBAAiB,KAAK,aAAa,WACpC,KAAK,QAAQ,eAAe,UAAU,QACtC,KAAK,iBAAiB;AAC3B,UAAM,YAAY,mBAAmB;AACrC,QAAI,OAA+B;AACnC,QAAI,KAAK,aAAa;AAAS,aAAO,iBAAiB,UAAU;aACxD,KAAK,aAAa;AAAQ,aAAO,kBAAkB,SAAS;aAC5D,KAAK,aAAa;AAAO,aAAO,kBAAkB,QAAQ;AACnE,WAAO,EAAE,MAAM,WAAW,WAAW,KAAK,WAAW,eAAe,KAAK,cAAa;EACxF;EAEQ,MAAM,oBAAoB,KAAgC;AAChE,QAAI;AACF,YAAM,OAAO,MAAM,WAAW,GAAG;AACjC,YAAM,QAAQ,kBAAkB,KAAK,MAAM,IAAI,CAAC;AAChD,UAAI,MAAM,SAAS,aAAa;AAC9B,cAAM,UAAU,MAAM;AACtB,YAAI,QAAQ,aAAa;AAAkB,gBAAM,IAAI,MAAM,iDAAiD;AAC5G,YAAI,QAAQ,kBAAkB;AAAO,eAAK,gBAAgB;AAC1D,YAAI,OAAO,QAAQ,4BAA4B,YAC1C,OAAO,cAAc,QAAQ,uBAAuB,KACpD,QAAQ,0BAA0B,GAAG;AACxC,eAAK,2BAA2B,QAAQ;QAC1C;AACA,aAAK,YAAY,mBAAmB;UAClC,cAAc,KAAK,QAAQ;UAC3B,qBAAqB,KAAK,QAAQ,eAAe,OAC7C,CAAC,OAAO,IACR,KAAK,QAAQ,uBAAuB,CAAC,GAAG,4BAA4B;SACzE;AACD;MACF;AACA,UAAI,MAAM,SAAS,oBAAoB;AACrC,cAAM,UAAU,MAAM;AACtB,YAAI,OAAO,QAAQ,iBAAiB,YAAY,QAAQ,aAAa,WAAW,GAAG;AACjF,gBAAM,IAAI,MAAM,iDAAiD;QACnE;AACA,aAAK,eAAe,QAAQ;AAC5B,aAAK,KAAK,UAAS;AACnB;MACF;AACA,UAAI,MAAM,SAAS,sBAAsB,MAAM,SAAS,SAAS;AAC/D,cAAM,UAAU,MAAM;AACtB,cAAM,UAAU,OAAO,QAAQ,YAAY,WAAW,QAAQ,UAAU;AACxE,cAAM,OAAO,OAAO,IAAI,MAAM,OAAO,GAAG,EAAE,MAAM,QAAQ,KAAI,CAAE;MAChE;AACA,UAAI,MAAM,SAAS,SAAS;AAC1B,YAAI,KAAK,aAAa;AAAS;AAC/B,aAAK,YAAY,MAAM,OAAgC;AACvD;MACF;AACA,UAAI,MAAM,SAAS,oBAAoB;AACrC,cAAM,UAAU,MAAM;AACtB,YAAI,QAAQ,iBAAiB,KAAK,gBAC7B,QAAQ,mBAAmB,KAAK,QAAQ,YACxC,CAAC,OAAO,cAAc,QAAQ,IAAI,KAClC,OAAO,QAAQ,SAAS,UAAU;AACrC,gBAAM,IAAI,MAAM,6DAA6D;QAC/E;AACA,cAAM,OAAO,cAAc,QAAQ,IAAI;AACvC,mBAAW,WAAW,KAAK;AAAmB,kBAAQ,QAAQ,MAAO,IAAI;AACzE;MACF;AACA,UAAI,MAAM,SAAS,iBAAiB;AAClC,cAAM,UAAU,MAAM;AACtB,YAAI,QAAQ,iBAAiB,KAAK,gBAAgB,OAAO,QAAQ,QAAQ,UAAU;AACjF,eAAK,KAAK,aAAa,EAAE,MAAM,UAAU,KAAK,QAAQ,IAAG,CAAE;QAC7D;AACA;MACF;AACA,UAAI,MAAM,SAAS,cAAc;AAC/B,cAAM,UAAU,MAAM;AACtB,YAAI,QAAQ,iBAAiB,KAAK,gBAAgB,SAAS,QAAQ,SAAS,GAAG;AAC7E,eAAK,KAAK,aAAa,EAAE,MAAM,OAAO,WAAW,QAAQ,UAAS,CAAE;QACtE;AACA;MACF;AACA,UAAI,MAAM,SAAS,kBAAkB,MAAM,SAAS;AAAsB;AAC1E,UAAI,MAAM,SAAS;AAAQ,aAAK,YAAY,QAAQ,MAAM,OAAO;IACnE,SAAS,OAAO;AACd,WAAK,eAAe,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,gCAAgC,CAAC;IAClG;EACF;EAEQ,YAAY,SAA8B;AAChD,QAAI,QAAQ,iBAAiB,KAAK,gBAC7B,QAAQ,mBAAmB,KAAK,QAAQ,YACxC,CAAC,OAAO,cAAc,QAAQ,OAAO,KACrC,OAAO,QAAQ,eAAe,UAAU;AAC3C,YAAM,IAAI,MAAM,kDAAkD;IACpE;AACA,UAAM,OAAO,cAAc,QAAQ,UAAU;AAC7C,SAAK,iBAAiB,KAAK;AAC3B,SAAK,KAAK,IAAI;EAChB;EAEQ,MAAM,YAAS;AACrB,QAAI,KAAK,iBAAiB;AAAW;AACrC,UAAM,YAAY,KAAK,QAAQ,uBAAuB,CAAC,GAAG,4BAA4B;AACtF,UAAM,aAAa,CAAC,KAAK,QAAQ,cAAc,KAAK,kBAC9C,UAAU,SAAS,KAAK,KAAK,UAAU,SAAS,MAAM;AAC5D,QAAI,WAA8B;AAClC,QAAI,YAAY;AACd,UAAI;AACF,cAAM,cAAc,MAAM,KAAK,UAAS;AACxC,aAAK,WAAW;AAChB,mBAAW;MACb,QAAQ;AACN,cAAM,KAAK,KAAK,MAAK;AACrB,aAAK,MAAM;AACX,aAAK,WAAW;AAChB,mBAAW;MACb;IACF,OAAO;AACL,WAAK,WAAW;AAChB,iBAAW;IACb;AACA,SAAK,WAAW;AAChB,SAAK,YAAY,sBAAsB;MACrC,cAAc,KAAK;MACnB,gBAAgB,KAAK,QAAQ;MAC7B,WAAW;KACuB;AACpC,SAAK,iBAAgB;EACvB;EAEQ,MAAM,YAAS;AACrB,UAAM,eAAe,KAAK;AAC1B,QAAI,iBAAiB;AAAW,YAAM,IAAI,gBAAgB,mBAAmB,0CAA0C;AACvH,UAAM,UAAU,KAAK,QAAQ,eACvB,OAAO,sBAAsB,cAAc,SAAY,kBAAiB;AAC9E,QAAI,YAAY,QAAW;AACzB,YAAM,IAAI,gBAAgB,mBAAmB,kDAAkD;IACjG;AACA,QAAI,aAA6B,CAAA;AACjC,QAAI;AACF,mBAAa,OAAO,KAAK,QAAQ,kBAAkB,YAAY,KAAK,CAAA;IACtE,QAAQ;AAEN,mBAAa,CAAA;IACf;AACA,UAAM,MAAM,IAAI,wBAAwB;MACtC,MAAM;MACN;MACA;MACA,UAAU,YAAU,KAAK,cAAc,MAAM;MAC7C,oBAAoB,KAAK,4BAA4B,KAAK,QAAQ;MAClE,OAAO,WAAW,KAAK,QAAQ,cAAc;KAC9C;AACD,SAAK,MAAM;AACX,QAAI,UAAU,UAAO;AACnB,WAAK,iBAAiB,KAAK;AAC3B,WAAK,KAAK,IAAI;IAChB,CAAC;AACD,QAAI,QAAQ,MAAM,KAAK,UAAS,CAAE;AAClC,QAAI;AACF,YAAM,IAAI,QAAO;IACnB,SAAS,OAAO;AACd,YAAM,IAAI,MAAK;AACf,WAAK,MAAM;AACX,YAAM;IACR;AACA,WAAO,IAAI,kBAAiB,KAAM;EACpC;EAEQ,cAAc,QAAiB;AACrC,QAAI,KAAK,iBAAiB;AAAW;AACrC,QAAI,OAAO,SAAS,SAAS;AAC3B,WAAK,YAAY,gBAAgB;QAC/B,cAAc,KAAK;QACnB,gBAAgB,KAAK,QAAQ;QAC7B,KAAK,OAAO;OACb;IACH,WAAW,OAAO,SAAS,UAAU;AACnC,WAAK,YAAY,iBAAiB;QAChC,cAAc,KAAK;QACnB,gBAAgB,KAAK,QAAQ;QAC7B,KAAK,OAAO;OACb;IACH,OAAO;AACL,WAAK,YAAY,cAAc;QAC7B,cAAc,KAAK;QACnB,gBAAgB,KAAK,QAAQ;QAC7B,WAAW,OAAO;OACnB;IACH;EACF;EAEQ,YAAY,MAAgD,SAAgB;AAClF,QAAI,KAAK,QAAQ,eAAe,UAAU;AAAM,YAAM,IAAI,MAAM,qCAAqC;AACrG,SAAK,OAAO,KAAK,KAAK,UAAU,mBAAmB,MAAM,OAAO,CAAC,CAAC;EACpE;EAEQ,mBAAgB;AACtB,SAAK,eAAc;AACnB,SAAK,eAAc;AACnB,SAAK,eAAe;AACpB,SAAK,cAAc;EACrB;EAEQ,eAAe,OAAY;AACjC,SAAK,eAAc;AACnB,UAAM,SAAS,KAAK;AACpB,SAAK,eAAe;AACpB,SAAK,cAAc;AACnB,aAAS,KAAK;AACd,SAAK,KAAK,KAAK,MAAK;AACpB,SAAK,MAAM;AACX,SAAK,QAAQ,MAAK;AAClB,SAAK,SAAS;AACd,SAAK,eAAe;EACtB;EAEQ,iBAAc;AACpB,QAAI,KAAK,mBAAmB;AAAW,mBAAa,KAAK,cAAc;AACvE,SAAK,iBAAiB;EACxB;;AAGF,SAAS,SAAS,OAAc;AAC9B,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;;;ACjXA,IAAM,mBAAmB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAOO,IAAM,iBAAN,MAAqB;AAAA,EAClB;AAAA,EACA;AAAA,EACA,OAAoB;AAAA,EACpB,YAAY;AAAA,EACH;AAAA,EACA;AAAA,EACA;AAAA,EAEjB,YAAY,OAAiB;AAC3B,SAAK,QAAQ;AACb,SAAK,YAAY,IAAI,IAAI,iBAAiB,IAAI,YAAU,CAAC,QAAQ,MAAM,MAAM,CAAC,CAAC,CAAC;AAChF,SAAK,eAAe,MAAM,QAAQ,KAAK,KAAK;AAAA,EAC9C;AAAA,EAEA,UAAgB;AACd,QAAI,KAAK,UAAW;AACpB,eAAW,UAAU,kBAAkB;AACrC,YAAM,cAAc,KAAK,MAAM,MAAM;AACrC,YAAM,YAAY,IAAI,MAAM,CAAC,GAAG;AAAA,QAC9B,KAAK,CAAC,SAAS,QAAQ;AACrB,gBAAM,WAAW,KAAK,SAAS,MAAM;AACrC,gBAAM,QAAQ,SAAS,GAAG;AAC1B,iBAAO,OAAO,UAAU,aAAa,MAAM,KAAK,QAAQ,IAAI;AAAA,QAC9D;AAAA,MACF,CAAC;AACD,aAAO,eAAe,KAAK,OAAO,QAAQ;AAAA,QACxC,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AACA,WAAO,eAAe,KAAK,OAAO,WAAW;AAAA,MAC3C,cAAc;AAAA,MACd,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,OAAO,IAAI,SAA0C,KAAK,SAAS,WAC/D,KAAK,cAAc,EAAE,QAAQ,GAAG,IAAI,IACpC,KAAK,aAAa,GAAG,IAAI;AAAA,IAC/B,CAAC;AACD,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,aAAa,KAAe,QAA4B;AACtD,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,0CAA0C;AAC/E,SAAK,SAAS;AACd,SAAK,SAAS,EAAE,GAAG,OAAO;AAC1B,SAAK,OAAO;AAAA,EACd;AAAA,EAEA,cAAoB;AAClB,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,SAAuD;AACrD,WAAO,EAAE,MAAM,KAAK,MAAM,GAAI,KAAK,WAAW,SAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,KAAK,OAAO,EAAE,EAAG;AAAA,EACjG;AAAA,EAEA,UAAgB;AACd,QAAI,CAAC,KAAK,UAAW;AACrB,SAAK,YAAY;AACjB,eAAW,CAAC,QAAQ,KAAK,KAAK,KAAK,UAAW,QAAO,eAAe,KAAK,OAAO,QAAQ;AAAA,MACtF,cAAc;AAAA,MACd,YAAY;AAAA,MACZ,UAAU;AAAA,MACV;AAAA,IACF,CAAC;AACD,WAAO,eAAe,KAAK,OAAO,WAAW;AAAA,MAC3C,cAAc;AAAA,MACd,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,OAAO,KAAK;AAAA,IACd,CAAC;AACD,SAAK,YAAY;AAAA,EACnB;AAAA,EAEQ,SAAS,QAAkE;AACjF,QAAI,KAAK,SAAS,QAAS,QAAO,KAAK,eAAe,MAAM;AAC5D,WAAO,KAAK,cAAc,EAAE,MAAM;AAAA,EACpC;AAAA,EAEQ,eAAe,QAAkE;AACvF,WAAO,KAAK,UAAU,IAAI,MAAM;AAAA,EAClC;AAAA,EAEQ,gBAA0B;AAChC,QAAI,KAAK,WAAW,OAAW,OAAM,IAAI,MAAM,uCAAuC;AACtF,WAAO,KAAK;AAAA,EACd;AACF;;;AC9GA,YAAY,QAAQ;AACb,IAAM,SACX,MAAM,OAAO,OAAO,YAAY,eAAe,KACvC,eACJ,MAAM,OAAO,OAAO,YAAY,iBAAiB,KAC/C,KACA;;;ACGF,SAAU,YAAY,cAAc,IAAE;AAC1C,MAAI,UAAU,OAAO,OAAO,oBAAoB,YAAY;AAC1D,WAAO,OAAO,gBAAgB,IAAI,WAAW,WAAW,CAAC;EAC3D;AAEA,MAAI,UAAU,OAAO,OAAO,gBAAgB,YAAY;AACtD,WAAO,WAAW,KAAK,OAAO,YAAY,WAAW,CAAC;EACxD;AACA,QAAM,IAAI,MAAM,wCAAwC;AAC1D;;;AClBA,YAAYC,SAAQ;AACb,IAAMC,UACXD,OAAM,OAAOA,QAAO,YAAY,eAAeA,MACvC,gBACJA,OAAM,OAAOA,QAAO,YAAY,iBAAiBA,MAC/CA,MACA;;;ACCF,SAAU,QAAQ,GAAU;AAChC,SAAO,aAAa,cAAe,YAAY,OAAO,CAAC,KAAK,EAAE,YAAY,SAAS;AACrF;AAGM,SAAU,QAAQ,GAAS;AAC/B,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAAG,UAAM,IAAI,MAAM,oCAAoC,CAAC;AAC9F;AAGM,SAAU,OAAO,MAA8B,SAAiB;AACpE,MAAI,CAAC,QAAQ,CAAC;AAAG,UAAM,IAAI,MAAM,qBAAqB;AACtD,MAAI,QAAQ,SAAS,KAAK,CAAC,QAAQ,SAAS,EAAE,MAAM;AAClD,UAAM,IAAI,MAAM,mCAAmC,UAAU,kBAAkB,EAAE,MAAM;AAC3F;AAWM,SAAU,QAAQ,UAAe,gBAAgB,MAAI;AACzD,MAAI,SAAS;AAAW,UAAM,IAAI,MAAM,kCAAkC;AAC1E,MAAI,iBAAiB,SAAS;AAAU,UAAM,IAAI,MAAM,uCAAuC;AACjG;AAGM,SAAU,QAAQ,KAAU,UAAa;AAC7C,SAAO,GAAG;AACV,QAAM,MAAM,SAAS;AACrB,MAAI,IAAI,SAAS,KAAK;AACpB,UAAM,IAAI,MAAM,2DAA2D,GAAG;EAChF;AACF;AAkBM,SAAU,SAAS,QAAoB;AAC3C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,WAAO,CAAC,EAAE,KAAK,CAAC;EAClB;AACF;AAGM,SAAU,WAAW,KAAe;AACxC,SAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AAChE;AA6CA,IAAM,gBAA0C;;EAE9C,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,UAAU,cAAc,OAAO,WAAW,YAAY;GAAW;AAG9F,IAAM,QAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAAC,GAAG,MAC5D,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAO3B,SAAU,WAAW,OAAiB;AAC1C,SAAO,KAAK;AAEZ,MAAI;AAAe,WAAO,MAAM,MAAK;AAErC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAO,MAAM,MAAM,CAAC,CAAC;EACvB;AACA,SAAO;AACT;AAGA,IAAM,SAAS,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAG;AAC5D,SAAS,cAAc,IAAU;AAC/B,MAAI,MAAM,OAAO,MAAM,MAAM,OAAO;AAAI,WAAO,KAAK,OAAO;AAC3D,MAAI,MAAM,OAAO,KAAK,MAAM,OAAO;AAAG,WAAO,MAAM,OAAO,IAAI;AAC9D,MAAI,MAAM,OAAO,KAAK,MAAM,OAAO;AAAG,WAAO,MAAM,OAAO,IAAI;AAC9D;AACF;AAMM,SAAU,WAAW,KAAW;AACpC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AAErF,MAAI;AAAe,WAAO,WAAW,QAAQ,GAAG;AAChD,QAAM,KAAK,IAAI;AACf,QAAM,KAAK,KAAK;AAChB,MAAI,KAAK;AAAG,UAAM,IAAI,MAAM,qDAAqD,EAAE;AACnF,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,WAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAC/C,UAAM,KAAK,cAAc,IAAI,WAAW,EAAE,CAAC;AAC3C,UAAM,KAAK,cAAc,IAAI,WAAW,KAAK,CAAC,CAAC;AAC/C,QAAI,OAAO,UAAa,OAAO,QAAW;AACxC,YAAM,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AACjC,YAAM,IAAI,MAAM,iDAAiD,OAAO,gBAAgB,EAAE;IAC5F;AACA,UAAM,EAAE,IAAI,KAAK,KAAK;EACxB;AACA,SAAO;AACT;AAkCM,SAAU,YAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,iBAAiB;AAC9D,SAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;AACrD;AAiBM,SAAU,QAAQ,MAAW;AACjC,MAAI,OAAO,SAAS;AAAU,WAAO,YAAY,IAAI;AACrD,SAAO,IAAI;AACX,SAAO;AACT;AAeM,SAAU,eAAe,QAAoB;AACjD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,CAAC;AACR,WAAO,EAAE;EACX;AACA,QAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,WAAS,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC/C,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,IAAI,GAAG,GAAG;AACd,WAAO,EAAE;EACX;AACA,SAAO;AACT;AAsBM,IAAgB,OAAhB,MAAoB;;AA4CpB,SAAU,aACd,UAAuB;AAOvB,QAAM,QAAQ,CAAC,QAA2B,SAAQ,EAAG,OAAO,QAAQ,GAAG,CAAC,EAAE,OAAM;AAChF,QAAM,MAAM,SAAQ;AACpB,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,MAAM,SAAQ;AAC7B,SAAO;AACT;AAsCM,SAAUE,aAAY,cAAc,IAAE;AAC1C,MAAIC,WAAU,OAAOA,QAAO,oBAAoB,YAAY;AAC1D,WAAOA,QAAO,gBAAgB,IAAI,WAAW,WAAW,CAAC;EAC3D;AAEA,MAAIA,WAAU,OAAOA,QAAO,gBAAgB,YAAY;AACtD,WAAO,WAAW,KAAKA,QAAO,YAAY,WAAW,CAAC;EACxD;AACA,QAAM,IAAI,MAAM,wCAAwC;AAC1D;;;ACnYM,SAAU,aACd,MACA,YACA,OACAC,OAAa;AAEb,MAAI,OAAO,KAAK,iBAAiB;AAAY,WAAO,KAAK,aAAa,YAAY,OAAOA,KAAI;AAC7F,QAAMC,QAAO,OAAO,EAAE;AACtB,QAAM,WAAW,OAAO,UAAU;AAClC,QAAM,KAAK,OAAQ,SAASA,QAAQ,QAAQ;AAC5C,QAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,QAAM,IAAID,QAAO,IAAI;AACrB,QAAM,IAAIA,QAAO,IAAI;AACrB,OAAK,UAAU,aAAa,GAAG,IAAIA,KAAI;AACvC,OAAK,UAAU,aAAa,GAAG,IAAIA,KAAI;AACzC;AAgBM,IAAgB,SAAhB,cAAoD,KAAO;EAoB/D,YAAY,UAAkB,WAAmB,WAAmBE,OAAa;AAC/E,UAAK;AANG,SAAA,WAAW;AACX,SAAA,SAAS;AACT,SAAA,MAAM;AACN,SAAA,YAAY;AAIpB,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,YAAY;AACjB,SAAK,OAAOA;AACZ,SAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,SAAK,OAAO,WAAW,KAAK,MAAM;EACpC;EACA,OAAO,MAAW;AAChB,YAAQ,IAAI;AACZ,WAAO,QAAQ,IAAI;AACnB,WAAO,IAAI;AACX,UAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,UAAI,SAAS,UAAU;AACrB,cAAM,WAAW,WAAW,IAAI;AAChC,eAAO,YAAY,MAAM,KAAK,OAAO;AAAU,eAAK,QAAQ,UAAU,GAAG;AACzE;MACF;AACA,aAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,WAAK,OAAO;AACZ,aAAO;AACP,UAAI,KAAK,QAAQ,UAAU;AACzB,aAAK,QAAQ,MAAM,CAAC;AACpB,aAAK,MAAM;MACb;IACF;AACA,SAAK,UAAU,KAAK;AACpB,SAAK,WAAU;AACf,WAAO;EACT;EACA,WAAW,KAAe;AACxB,YAAQ,IAAI;AACZ,YAAQ,KAAK,IAAI;AACjB,SAAK,WAAW;AAIhB,UAAM,EAAE,QAAQ,MAAM,UAAU,MAAAA,MAAI,IAAK;AACzC,QAAI,EAAE,IAAG,IAAK;AAEd,WAAO,KAAK,IAAI;AAChB,UAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,QAAI,KAAK,YAAY,WAAW,KAAK;AACnC,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM;IACR;AAEA,aAAS,IAAI,KAAK,IAAI,UAAU;AAAK,aAAO,CAAC,IAAI;AAIjD,iBAAa,MAAM,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGA,KAAI;AAC9D,SAAK,QAAQ,MAAM,CAAC;AACpB,UAAM,QAAQ,WAAW,GAAG;AAC5B,UAAM,MAAM,KAAK;AAEjB,QAAI,MAAM;AAAG,YAAM,IAAI,MAAM,6CAA6C;AAC1E,UAAM,SAAS,MAAM;AACrB,UAAM,QAAQ,KAAK,IAAG;AACtB,QAAI,SAAS,MAAM;AAAQ,YAAM,IAAI,MAAM,oCAAoC;AAC/E,aAAS,IAAI,GAAG,IAAI,QAAQ;AAAK,YAAM,UAAU,IAAI,GAAG,MAAM,CAAC,GAAGA,KAAI;EACxE;EACA,SAAM;AACJ,UAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,SAAK,WAAW,MAAM;AACtB,UAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAO;AACZ,WAAO;EACT;EACA,WAAW,IAAM;AACf,WAAA,KAAO,IAAK,KAAK,YAAmB;AACpC,OAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,SAAS;AACZ,OAAG,MAAM;AACT,QAAI,SAAS;AAAU,SAAG,OAAO,IAAI,MAAM;AAC3C,WAAO;EACT;EACA,QAAK;AACH,WAAO,KAAK,WAAU;EACxB;;AAyBK,IAAM,YAAyC,4BAAY,KAAK;EACrE;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;;;AC1KD,IAAM,aAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,IAAM,OAAuB,uBAAO,EAAE;AAEtC,SAAS,QACP,GACA,KAAK,OAAK;AAKV,MAAI;AAAI,WAAO,EAAE,GAAG,OAAO,IAAI,UAAU,GAAG,GAAG,OAAQ,KAAK,OAAQ,UAAU,EAAC;AAC/E,SAAO,EAAE,GAAG,OAAQ,KAAK,OAAQ,UAAU,IAAI,GAAG,GAAG,OAAO,IAAI,UAAU,IAAI,EAAC;AACjF;AAEA,SAAS,MAAM,KAAe,KAAK,OAAK;AACtC,QAAM,MAAM,IAAI;AAChB,MAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,MAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,UAAM,EAAE,GAAG,EAAC,IAAK,QAAQ,IAAI,CAAC,GAAG,EAAE;AACnC,KAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;EACxB;AACA,SAAO,CAAC,IAAI,EAAE;AAChB;AAIA,IAAM,QAAQ,CAAC,GAAW,IAAYC,OAAsB,MAAMA;AAClE,IAAM,QAAQ,CAAC,GAAW,GAAWA,OAAuB,KAAM,KAAKA,KAAO,MAAMA;AAEpF,IAAM,SAAS,CAAC,GAAW,GAAWA,OAAuB,MAAMA,KAAM,KAAM,KAAKA;AACpF,IAAM,SAAS,CAAC,GAAW,GAAWA,OAAuB,KAAM,KAAKA,KAAO,MAAMA;AAErF,IAAM,SAAS,CAAC,GAAW,GAAWA,OAAuB,KAAM,KAAKA,KAAO,MAAOA,KAAI;AAC1F,IAAM,SAAS,CAAC,GAAW,GAAWA,OAAuB,MAAOA,KAAI,KAAQ,KAAM,KAAKA;AAa3F,SAAS,IACP,IACA,IACA,IACA,IAAU;AAKV,QAAM,KAAK,OAAO,MAAM,OAAO;AAC/B,SAAO,EAAE,GAAI,KAAK,MAAO,IAAI,KAAK,KAAM,KAAM,GAAG,GAAG,IAAI,EAAC;AAC3D;AAEA,IAAM,QAAQ,CAAC,IAAY,IAAY,QAAwB,OAAO,MAAM,OAAO,MAAM,OAAO;AAChG,IAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,OACjD,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAC3C,IAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,QAChD,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AACjD,IAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,OAC7D,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAChD,IAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,QAC5D,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC9D,IAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,OACzE,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;ACmDrD,IAAM,OAAwB,uBAAU,MAAM;EAC5C;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE,IAAI,OAAK,OAAO,CAAC,CAAC,CAAC,GAAE;AACvB,IAAM,YAA6B,uBAAM,KAAK,CAAC,GAAE;AACjD,IAAM,YAA6B,uBAAM,KAAK,CAAC,GAAE;AAGjD,IAAM,aAA6B,oBAAI,YAAY,EAAE;AACrD,IAAM,aAA6B,oBAAI,YAAY,EAAE;AAE/C,IAAO,SAAP,cAAsB,OAAc;EAqBxC,YAAY,YAAoB,IAAE;AAChC,UAAM,KAAK,WAAW,IAAI,KAAK;AAlBvB,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,CAAC,IAAI;AAC5B,SAAA,KAAa,UAAU,EAAE,IAAI;AAC7B,SAAA,KAAa,UAAU,EAAE,IAAI;AAC7B,SAAA,KAAa,UAAU,EAAE,IAAI;AAC7B,SAAA,KAAa,UAAU,EAAE,IAAI;AAC7B,SAAA,KAAa,UAAU,EAAE,IAAI;AAC7B,SAAA,KAAa,UAAU,EAAE,IAAI;EAIvC;;EAEU,MAAG;AAIX,UAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC3E,WAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;EACxE;;EAEU,IACR,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IACpF,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAU;AAE9F,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;EACjB;EACU,QAAQ,MAAgB,QAAc;AAE9C,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,UAAU,GAAG;AACxC,iBAAW,CAAC,IAAI,KAAK,UAAU,MAAM;AACrC,iBAAW,CAAC,IAAI,KAAK,UAAW,UAAU,CAAE;IAC9C;AACA,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,YAAM,OAAO,WAAW,IAAI,EAAE,IAAI;AAClC,YAAM,OAAO,WAAW,IAAI,EAAE,IAAI;AAClC,YAAM,MAAU,OAAO,MAAM,MAAM,CAAC,IAAQ,OAAO,MAAM,MAAM,CAAC,IAAQ,MAAM,MAAM,MAAM,CAAC;AAC3F,YAAM,MAAU,OAAO,MAAM,MAAM,CAAC,IAAQ,OAAO,MAAM,MAAM,CAAC,IAAQ,MAAM,MAAM,MAAM,CAAC;AAE3F,YAAM,MAAM,WAAW,IAAI,CAAC,IAAI;AAChC,YAAM,MAAM,WAAW,IAAI,CAAC,IAAI;AAChC,YAAM,MAAU,OAAO,KAAK,KAAK,EAAE,IAAQ,OAAO,KAAK,KAAK,EAAE,IAAQ,MAAM,KAAK,KAAK,CAAC;AACvF,YAAM,MAAU,OAAO,KAAK,KAAK,EAAE,IAAQ,OAAO,KAAK,KAAK,EAAE,IAAQ,MAAM,KAAK,KAAK,CAAC;AAEvF,YAAM,OAAW,MAAM,KAAK,KAAK,WAAW,IAAI,CAAC,GAAG,WAAW,IAAI,EAAE,CAAC;AACtE,YAAM,OAAW,MAAM,MAAM,KAAK,KAAK,WAAW,IAAI,CAAC,GAAG,WAAW,IAAI,EAAE,CAAC;AAC5E,iBAAW,CAAC,IAAI,OAAO;AACvB,iBAAW,CAAC,IAAI,OAAO;IACzB;AACA,QAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAEzE,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAE3B,YAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,YAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AAEvF,YAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,YAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,YAAM,OAAW,MAAM,IAAI,SAAS,MAAM,UAAU,CAAC,GAAG,WAAW,CAAC,CAAC;AACrE,YAAM,MAAU,MAAM,MAAM,IAAI,SAAS,MAAM,UAAU,CAAC,GAAG,WAAW,CAAC,CAAC;AAC1E,YAAM,MAAM,OAAO;AAEnB,YAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,YAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,YAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,YAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,YAAM,MAAU,MAAM,KAAK,SAAS,IAAI;AACxC,WAAS,MAAM,KAAK,KAAK,SAAS,IAAI;AACtC,WAAK,MAAM;IACb;AAEA,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,SAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;EACzE;EACU,aAAU;AAClB,UAAM,YAAY,UAAU;EAC9B;EACA,UAAO;AACL,UAAM,KAAK,MAAM;AACjB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;EACzD;;AAuGK,IAAM,SAAgC,6BAAa,MAAM,IAAI,OAAM,CAAE;;;AC7W5E,IAAM,MAAsB,uBAAO,CAAC;AACpC,IAAM,MAAsB,uBAAO,CAAC;AAgB9B,SAAU,QAAQ,OAAgB,QAAgB,IAAE;AACxD,MAAI,OAAO,UAAU,WAAW;AAC9B,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,MAAM,SAAS,gCAAgC,OAAO,KAAK;EACvE;AACA,SAAO;AACT;AAIM,SAAU,SAAS,OAAmB,QAAiB,QAAgB,IAAE;AAC7E,QAAM,QAAQ,QAAS,KAAK;AAC5B,QAAM,MAAM,OAAO;AACnB,QAAM,WAAW,WAAW;AAC5B,MAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,UAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,UAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;EACzE;AACA,SAAO;AACT;AAQM,SAAU,YAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AACrF,SAAO,QAAQ,KAAK,MAAM,OAAO,OAAO,GAAG;AAC7C;AAGM,SAAU,gBAAgB,OAAiB;AAC/C,SAAO,YAAY,WAAY,KAAK,CAAC;AACvC;AACM,SAAU,gBAAgB,OAAiB;AAC/C,SAAQ,KAAK;AACb,SAAO,YAAY,WAAY,WAAW,KAAK,KAAK,EAAE,QAAO,CAAE,CAAC;AAClE;AAEM,SAAU,gBAAgB,GAAoB,KAAW;AAC7D,SAAO,WAAY,EAAE,SAAS,EAAE,EAAE,SAAS,MAAM,GAAG,GAAG,CAAC;AAC1D;AACM,SAAU,gBAAgB,GAAoB,KAAW;AAC7D,SAAO,gBAAgB,GAAG,GAAG,EAAE,QAAO;AACxC;AAeM,SAAU,YAAY,OAAe,KAAU,gBAAuB;AAC1E,MAAI;AACJ,MAAI,OAAO,QAAQ,UAAU;AAC3B,QAAI;AACF,YAAM,WAAY,GAAG;IACvB,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,QAAQ,+CAA+C,CAAC;IAC1E;EACF,WAAW,QAAS,GAAG,GAAG;AAGxB,UAAM,WAAW,KAAK,GAAG;EAC3B,OAAO;AACL,UAAM,IAAI,MAAM,QAAQ,mCAAmC;EAC7D;AACA,QAAM,MAAM,IAAI;AAChB,MAAI,OAAO,mBAAmB,YAAY,QAAQ;AAChD,UAAM,IAAI,MAAM,QAAQ,gBAAgB,iBAAiB,oBAAoB,GAAG;AAClF,SAAO;AACT;AAGM,SAAU,WAAW,GAAe,GAAa;AACrD,MAAI,EAAE,WAAW,EAAE;AAAQ,WAAO;AAClC,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAAK,YAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AACrD,SAAO,SAAS;AAClB;AAKM,SAAU,UAAU,OAAiB;AACzC,SAAO,WAAW,KAAK,KAAK;AAC9B;AA8BA,IAAM,WAAW,CAAC,MAAc,OAAO,MAAM,YAAY,OAAO;AAE1D,SAAU,QAAQ,GAAW,KAAa,KAAW;AACzD,SAAO,SAAS,CAAC,KAAK,SAAS,GAAG,KAAK,SAAS,GAAG,KAAK,OAAO,KAAK,IAAI;AAC1E;AAOM,SAAU,SAAS,OAAe,GAAW,KAAa,KAAW;AAMzE,MAAI,CAAC,QAAQ,GAAG,KAAK,GAAG;AACtB,UAAM,IAAI,MAAM,oBAAoB,QAAQ,OAAO,MAAM,aAAa,MAAM,WAAW,CAAC;AAC5F;AASM,SAAU,OAAO,GAAS;AAC9B,MAAI;AACJ,OAAK,MAAM,GAAG,IAAI,KAAK,MAAM,KAAK,OAAO;AAAE;AAC3C,SAAO;AACT;AAsBO,IAAM,UAAU,CAAC,OAAuB,OAAO,OAAO,CAAC,KAAK;AAkH7D,SAAU,gBACd,QACA,QACA,YAAoC,CAAA,GAAE;AAEtC,MAAI,CAAC,UAAU,OAAO,WAAW;AAAU,UAAM,IAAI,MAAM,+BAA+B;AAE1F,WAAS,WAAW,WAAiB,cAAsB,OAAc;AACvE,UAAM,MAAM,OAAO,SAAS;AAC5B,QAAI,SAAS,QAAQ;AAAW;AAChC,UAAM,UAAU,OAAO;AACvB,QAAI,YAAY,gBAAgB,QAAQ;AACtC,YAAM,IAAI,MAAM,UAAU,SAAS,0BAA0B,YAAY,SAAS,OAAO,EAAE;EAC/F;AACA,SAAO,QAAQ,MAAM,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,WAAW,GAAG,GAAG,KAAK,CAAC;AAClE,SAAO,QAAQ,SAAS,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,WAAW,GAAG,GAAG,IAAI,CAAC;AACtE;AAKO,IAAM,iBAAiB,MAAY;AACxC,QAAM,IAAI,MAAM,iBAAiB;AACnC;AAMM,SAAU,SACd,IAA6B;AAE7B,QAAM,MAAM,oBAAI,QAAO;AACvB,SAAO,CAAC,QAAW,SAAc;AAC/B,UAAM,MAAM,IAAI,IAAI,GAAG;AACvB,QAAI,QAAQ;AAAW,aAAO;AAC9B,UAAM,WAAW,GAAG,KAAK,GAAG,IAAI;AAChC,QAAI,IAAI,KAAK,QAAQ;AACrB,WAAO;EACT;AACF;;;ACpWA,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAArC,IAAwC,MAAsB,uBAAO,CAAC;AAAtE,IAAyE,MAAsB,uBAAO,CAAC;AAEvG,IAAM,MAAsB,uBAAO,CAAC;AAApC,IAAuC,MAAsB,uBAAO,CAAC;AAArE,IAAwE,MAAsB,uBAAO,CAAC;AAEtG,IAAM,MAAsB,uBAAO,CAAC;AAApC,IAAuC,MAAsB,uBAAO,CAAC;AAArE,IAAwE,OAAuB,uBAAO,EAAE;AAGlG,SAAU,IAAI,GAAW,GAAS;AACtC,QAAM,SAAS,IAAI;AACnB,SAAO,UAAUD,OAAM,SAAS,IAAI;AACtC;AAYM,SAAU,KAAK,GAAW,OAAe,QAAc;AAC3D,MAAI,MAAM;AACV,SAAO,UAAUE,MAAK;AACpB,WAAO;AACP,WAAO;EACT;AACA,SAAO;AACT;AAMM,SAAU,OAAO,QAAgB,QAAc;AACnD,MAAI,WAAWA;AAAK,UAAM,IAAI,MAAM,kCAAkC;AACtE,MAAI,UAAUA;AAAK,UAAM,IAAI,MAAM,4CAA4C,MAAM;AAErF,MAAI,IAAI,IAAI,QAAQ,MAAM;AAC1B,MAAI,IAAI;AAER,MAAI,IAAIA,MAAK,IAAIC,MAAK,IAAIA,MAAK,IAAID;AACnC,SAAO,MAAMA,MAAK;AAEhB,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI,IAAI;AAClB,UAAM,IAAI,IAAI,IAAI;AAElB,QAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;EACzC;AACA,QAAM,MAAM;AACZ,MAAI,QAAQC;AAAK,UAAM,IAAI,MAAM,wBAAwB;AACzD,SAAO,IAAI,GAAG,MAAM;AACtB;AAEA,SAAS,eAAkBC,KAAe,MAAS,GAAI;AACrD,MAAI,CAACA,IAAG,IAAIA,IAAG,IAAI,IAAI,GAAG,CAAC;AAAG,UAAM,IAAI,MAAM,yBAAyB;AACzE;AAMA,SAAS,UAAaA,KAAe,GAAI;AACvC,QAAM,UAAUA,IAAG,QAAQD,QAAO;AAClC,QAAM,OAAOC,IAAG,IAAI,GAAG,MAAM;AAC7B,iBAAeA,KAAI,MAAM,CAAC;AAC1B,SAAO;AACT;AAEA,SAAS,UAAaA,KAAe,GAAI;AACvC,QAAM,UAAUA,IAAG,QAAQ,OAAO;AAClC,QAAM,KAAKA,IAAG,IAAI,GAAG,GAAG;AACxB,QAAM,IAAIA,IAAG,IAAI,IAAI,MAAM;AAC3B,QAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,QAAM,IAAIA,IAAG,IAAIA,IAAG,IAAI,IAAI,GAAG,GAAG,CAAC;AACnC,QAAM,OAAOA,IAAG,IAAI,IAAIA,IAAG,IAAI,GAAGA,IAAG,GAAG,CAAC;AACzC,iBAAeA,KAAI,MAAM,CAAC;AAC1B,SAAO;AACT;AAIA,SAAS,WAAW,GAAS;AAC3B,QAAM,MAAM,MAAM,CAAC;AACnB,QAAM,KAAK,cAAc,CAAC;AAC1B,QAAM,KAAK,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AACnC,QAAM,KAAK,GAAG,KAAK,EAAE;AACrB,QAAM,KAAK,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC;AAC9B,QAAM,MAAM,IAAI,OAAO;AACvB,SAAO,CAAIA,KAAe,MAAQ;AAChC,QAAI,MAAMA,IAAG,IAAI,GAAG,EAAE;AACtB,QAAI,MAAMA,IAAG,IAAI,KAAK,EAAE;AACxB,UAAM,MAAMA,IAAG,IAAI,KAAK,EAAE;AAC1B,UAAM,MAAMA,IAAG,IAAI,KAAK,EAAE;AAC1B,UAAM,KAAKA,IAAG,IAAIA,IAAG,IAAI,GAAG,GAAG,CAAC;AAChC,UAAM,KAAKA,IAAG,IAAIA,IAAG,IAAI,GAAG,GAAG,CAAC;AAChC,UAAMA,IAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,UAAMA,IAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,UAAM,KAAKA,IAAG,IAAIA,IAAG,IAAI,GAAG,GAAG,CAAC;AAChC,UAAM,OAAOA,IAAG,KAAK,KAAK,KAAK,EAAE;AACjC,mBAAeA,KAAI,MAAM,CAAC;AAC1B,WAAO;EACT;AACF;AASM,SAAU,cAAc,GAAS;AAGrC,MAAI,IAAI;AAAK,UAAM,IAAI,MAAM,qCAAqC;AAElE,MAAI,IAAI,IAAID;AACZ,MAAI,IAAI;AACR,SAAO,IAAI,QAAQD,MAAK;AACtB,SAAK;AACL;EACF;AAGA,MAAI,IAAI;AACR,QAAM,MAAM,MAAM,CAAC;AACnB,SAAO,WAAW,KAAK,CAAC,MAAM,GAAG;AAG/B,QAAI,MAAM;AAAM,YAAM,IAAI,MAAM,+CAA+C;EACjF;AAEA,MAAI,MAAM;AAAG,WAAO;AAIpB,MAAI,KAAK,IAAI,IAAI,GAAG,CAAC;AACrB,QAAM,UAAU,IAAIC,QAAO;AAC3B,SAAO,SAAS,YAAeC,KAAe,GAAI;AAChD,QAAIA,IAAG,IAAI,CAAC;AAAG,aAAO;AAEtB,QAAI,WAAWA,KAAI,CAAC,MAAM;AAAG,YAAM,IAAI,MAAM,yBAAyB;AAGtE,QAAI,IAAI;AACR,QAAI,IAAIA,IAAG,IAAIA,IAAG,KAAK,EAAE;AACzB,QAAI,IAAIA,IAAG,IAAI,GAAG,CAAC;AACnB,QAAI,IAAIA,IAAG,IAAI,GAAG,MAAM;AAIxB,WAAO,CAACA,IAAG,IAAI,GAAGA,IAAG,GAAG,GAAG;AACzB,UAAIA,IAAG,IAAI,CAAC;AAAG,eAAOA,IAAG;AACzB,UAAI,IAAI;AAGR,UAAI,QAAQA,IAAG,IAAI,CAAC;AACpB,aAAO,CAACA,IAAG,IAAI,OAAOA,IAAG,GAAG,GAAG;AAC7B;AACA,gBAAQA,IAAG,IAAI,KAAK;AACpB,YAAI,MAAM;AAAG,gBAAM,IAAI,MAAM,yBAAyB;MACxD;AAGA,YAAM,WAAWD,QAAO,OAAO,IAAI,IAAI,CAAC;AACxC,YAAM,IAAIC,IAAG,IAAI,GAAG,QAAQ;AAG5B,UAAI;AACJ,UAAIA,IAAG,IAAI,CAAC;AACZ,UAAIA,IAAG,IAAI,GAAG,CAAC;AACf,UAAIA,IAAG,IAAI,GAAG,CAAC;IACjB;AACA,WAAO;EACT;AACF;AAaM,SAAU,OAAO,GAAS;AAE9B,MAAI,IAAI,QAAQ;AAAK,WAAO;AAE5B,MAAI,IAAI,QAAQ;AAAK,WAAO;AAE5B,MAAI,IAAI,SAAS;AAAK,WAAO,WAAW,CAAC;AAEzC,SAAO,cAAc,CAAC;AACxB;AAGO,IAAM,eAAe,CAAC,KAAa,YACvC,IAAI,KAAK,MAAM,IAAID,UAASA;AA+C/B,IAAM,eAAe;EACnB;EAAU;EAAW;EAAO;EAAO;EAAO;EAAQ;EAClD;EAAO;EAAO;EAAO;EAAO;EAAO;EACnC;EAAQ;EAAQ;EAAQ;;AAEpB,SAAU,cAAiB,OAAgB;AAC/C,QAAM,UAAU;IACd,OAAO;IACP,MAAM;IACN,OAAO;IACP,MAAM;;AAER,QAAM,OAAO,aAAa,OAAO,CAAC,KAAK,QAAe;AACpD,QAAI,GAAG,IAAI;AACX,WAAO;EACT,GAAG,OAAO;AACV,kBAAgB,OAAO,IAAI;AAI3B,SAAO;AACT;AAQM,SAAU,MAASC,KAAe,KAAQ,OAAa;AAC3D,MAAI,QAAQF;AAAK,UAAM,IAAI,MAAM,yCAAyC;AAC1E,MAAI,UAAUA;AAAK,WAAOE,IAAG;AAC7B,MAAI,UAAUD;AAAK,WAAO;AAC1B,MAAI,IAAIC,IAAG;AACX,MAAI,IAAI;AACR,SAAO,QAAQF,MAAK;AAClB,QAAI,QAAQC;AAAK,UAAIC,IAAG,IAAI,GAAG,CAAC;AAChC,QAAIA,IAAG,IAAI,CAAC;AACZ,cAAUD;EACZ;AACA,SAAO;AACT;AAOM,SAAU,cAAiBC,KAAe,MAAW,WAAW,OAAK;AACzE,QAAM,WAAW,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,WAAWA,IAAG,OAAO,MAAS;AAE3E,QAAM,gBAAgB,KAAK,OAAO,CAAC,KAAK,KAAK,MAAK;AAChD,QAAIA,IAAG,IAAI,GAAG;AAAG,aAAO;AACxB,aAAS,CAAC,IAAI;AACd,WAAOA,IAAG,IAAI,KAAK,GAAG;EACxB,GAAGA,IAAG,GAAG;AAET,QAAM,cAAcA,IAAG,IAAI,aAAa;AAExC,OAAK,YAAY,CAAC,KAAK,KAAK,MAAK;AAC/B,QAAIA,IAAG,IAAI,GAAG;AAAG,aAAO;AACxB,aAAS,CAAC,IAAIA,IAAG,IAAI,KAAK,SAAS,CAAC,CAAC;AACrC,WAAOA,IAAG,IAAI,KAAK,GAAG;EACxB,GAAG,WAAW;AACd,SAAO;AACT;AAgBM,SAAU,WAAcC,KAAe,GAAI;AAG/C,QAAM,UAAUA,IAAG,QAAQC,QAAO;AAClC,QAAM,UAAUD,IAAG,IAAI,GAAG,MAAM;AAChC,QAAM,MAAMA,IAAG,IAAI,SAASA,IAAG,GAAG;AAClC,QAAM,OAAOA,IAAG,IAAI,SAASA,IAAG,IAAI;AACpC,QAAM,KAAKA,IAAG,IAAI,SAASA,IAAG,IAAIA,IAAG,GAAG,CAAC;AACzC,MAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;AAAI,UAAM,IAAI,MAAM,gCAAgC;AAC1E,SAAO,MAAM,IAAI,OAAO,IAAI;AAC9B;AAUM,SAAU,QAAQ,GAAW,YAAmB;AAEpD,MAAI,eAAe;AAAW,YAAQ,UAAU;AAChD,QAAM,cAAc,eAAe,SAAY,aAAa,EAAE,SAAS,CAAC,EAAE;AAC1E,QAAM,cAAc,KAAK,KAAK,cAAc,CAAC;AAC7C,SAAO,EAAE,YAAY,aAAa,YAAW;AAC/C;AA8BM,SAAU,MACd,OACA,cACAE,QAAO,OACP,OAA0B,CAAA,GAAE;AAE5B,MAAI,SAASC;AAAK,UAAM,IAAI,MAAM,4CAA4C,KAAK;AACnF,MAAI,cAAkC;AACtC,MAAI,QAA4B;AAChC,MAAI,eAAwB;AAC5B,MAAI,iBAAgD;AACpD,MAAI,OAAO,iBAAiB,YAAY,gBAAgB,MAAM;AAC5D,QAAI,KAAK,QAAQD;AAAM,YAAM,IAAI,MAAM,sCAAsC;AAC7E,UAAM,QAAQ;AACd,QAAI,MAAM;AAAM,oBAAc,MAAM;AACpC,QAAI,MAAM;AAAM,cAAQ,MAAM;AAC9B,QAAI,OAAO,MAAM,SAAS;AAAW,MAAAA,QAAO,MAAM;AAClD,QAAI,OAAO,MAAM,iBAAiB;AAAW,qBAAe,MAAM;AAClE,qBAAiB,MAAM;EACzB,OAAO;AACL,QAAI,OAAO,iBAAiB;AAAU,oBAAc;AACpD,QAAI,KAAK;AAAM,cAAQ,KAAK;EAC9B;AACA,QAAM,EAAE,YAAY,MAAM,aAAa,MAAK,IAAK,QAAQ,OAAO,WAAW;AAC3E,MAAI,QAAQ;AAAM,UAAM,IAAI,MAAM,gDAAgD;AAClF,MAAI;AACJ,QAAM,IAAuB,OAAO,OAAO;IACzC;IACA,MAAAA;IACA;IACA;IACA,MAAM,QAAQ,IAAI;IAClB,MAAMC;IACN,KAAKC;IACL;IACA,QAAQ,CAAC,QAAQ,IAAI,KAAK,KAAK;IAC/B,SAAS,CAAC,QAAO;AACf,UAAI,OAAO,QAAQ;AACjB,cAAM,IAAI,MAAM,iDAAiD,OAAO,GAAG;AAC7E,aAAOD,QAAO,OAAO,MAAM;IAC7B;IACA,KAAK,CAAC,QAAQ,QAAQA;;IAEtB,aAAa,CAAC,QAAgB,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,QAAQ,GAAG;IAC1D,OAAO,CAAC,SAAS,MAAMC,UAASA;IAChC,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,KAAK;IAC7B,KAAK,CAAC,KAAK,QAAQ,QAAQ;IAE3B,KAAK,CAAC,QAAQ,IAAI,MAAM,KAAK,KAAK;IAClC,KAAK,CAAC,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK;IACvC,KAAK,CAAC,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK;IACvC,KAAK,CAAC,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK;IACvC,KAAK,CAAC,KAAK,UAAU,MAAM,GAAG,KAAK,KAAK;IACxC,KAAK,CAAC,KAAK,QAAQ,IAAI,MAAM,OAAO,KAAK,KAAK,GAAG,KAAK;;IAGtD,MAAM,CAAC,QAAQ,MAAM;IACrB,MAAM,CAAC,KAAK,QAAQ,MAAM;IAC1B,MAAM,CAAC,KAAK,QAAQ,MAAM;IAC1B,MAAM,CAAC,KAAK,QAAQ,MAAM;IAE1B,KAAK,CAAC,QAAQ,OAAO,KAAK,KAAK;IAC/B,MACE,UACC,CAAC,MAAK;AACL,UAAI,CAAC;AAAO,gBAAQ,OAAO,KAAK;AAChC,aAAO,MAAM,GAAG,CAAC;IACnB;IACF,SAAS,CAAC,QAASF,QAAO,gBAAgB,KAAK,KAAK,IAAI,gBAAgB,KAAK,KAAK;IAClF,WAAW,CAAC,OAAO,iBAAiB,SAAQ;AAC1C,UAAI,gBAAgB;AAClB,YAAI,CAAC,eAAe,SAAS,MAAM,MAAM,KAAK,MAAM,SAAS,OAAO;AAClE,gBAAM,IAAI,MACR,+BAA+B,iBAAiB,iBAAiB,MAAM,MAAM;QAEjF;AACA,cAAM,SAAS,IAAI,WAAW,KAAK;AAEnC,eAAO,IAAI,OAAOA,QAAO,IAAI,OAAO,SAAS,MAAM,MAAM;AACzD,gBAAQ;MACV;AACA,UAAI,MAAM,WAAW;AACnB,cAAM,IAAI,MAAM,+BAA+B,QAAQ,iBAAiB,MAAM,MAAM;AACtF,UAAI,SAASA,QAAO,gBAAgB,KAAK,IAAI,gBAAgB,KAAK;AAClE,UAAI;AAAc,iBAAS,IAAI,QAAQ,KAAK;AAC5C,UAAI,CAAC;AACH,YAAI,CAAC,EAAE,QAAQ,MAAM;AAAG,gBAAM,IAAI,MAAM,kDAAkD;;AAG5F,aAAO;IACT;;IAEA,aAAa,CAAC,QAAQ,cAAc,GAAG,GAAG;;;IAG1C,MAAM,CAAC,GAAG,GAAG,MAAO,IAAI,IAAI;GAClB;AACZ,SAAO,OAAO,OAAO,CAAC;AACxB;;;ACjfA,IAAMG,OAAM,OAAO,CAAC;AACpB,IAAMC,OAAM,OAAO,CAAC;AA0Id,SAAU,SAAwC,WAAoB,MAAO;AACjF,QAAM,MAAM,KAAK,OAAM;AACvB,SAAO,YAAY,MAAM;AAC3B;AAQM,SAAU,WACd,GACA,QAAW;AAEX,QAAM,aAAa,cACjB,EAAE,IACF,OAAO,IAAI,CAAC,MAAM,EAAE,CAAE,CAAC;AAEzB,SAAO,OAAO,IAAI,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,SAAS,WAAW,CAAC,CAAC,CAAC,CAAC;AACrE;AAEA,SAAS,UAAU,GAAW,MAAY;AACxC,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,KAAK,KAAK,IAAI;AAC5C,UAAM,IAAI,MAAM,uCAAuC,OAAO,cAAc,CAAC;AACjF;AAWA,SAAS,UAAU,GAAW,YAAkB;AAC9C,YAAU,GAAG,UAAU;AACvB,QAAM,UAAU,KAAK,KAAK,aAAa,CAAC,IAAI;AAC5C,QAAM,aAAa,MAAM,IAAI;AAC7B,QAAM,YAAY,KAAK;AACvB,QAAM,OAAO,QAAQ,CAAC;AACtB,QAAM,UAAU,OAAO,CAAC;AACxB,SAAO,EAAE,SAAS,YAAY,MAAM,WAAW,QAAO;AACxD;AAEA,SAAS,YAAY,GAAW,QAAgB,OAAY;AAC1D,QAAM,EAAE,YAAY,MAAM,WAAW,QAAO,IAAK;AACjD,MAAI,QAAQ,OAAO,IAAI,IAAI;AAC3B,MAAI,QAAQ,KAAK;AAQjB,MAAI,QAAQ,YAAY;AAEtB,aAAS;AACT,aAASA;EACX;AACA,QAAM,cAAc,SAAS;AAC7B,QAAM,SAAS,cAAc,KAAK,IAAI,KAAK,IAAI;AAC/C,QAAM,SAAS,UAAU;AACzB,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,SAAS,MAAM;AAC9B,QAAM,UAAU;AAChB,SAAO,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO;AACxD;AAEA,SAAS,kBAAkB,QAAe,GAAM;AAC9C,MAAI,CAAC,MAAM,QAAQ,MAAM;AAAG,UAAM,IAAI,MAAM,gBAAgB;AAC5D,SAAO,QAAQ,CAAC,GAAG,MAAK;AACtB,QAAI,EAAE,aAAa;AAAI,YAAM,IAAI,MAAM,4BAA4B,CAAC;EACtE,CAAC;AACH;AACA,SAAS,mBAAmB,SAAgB,OAAU;AACpD,MAAI,CAAC,MAAM,QAAQ,OAAO;AAAG,UAAM,IAAI,MAAM,2BAA2B;AACxE,UAAQ,QAAQ,CAACC,IAAG,MAAK;AACvB,QAAI,CAAC,MAAM,QAAQA,EAAC;AAAG,YAAM,IAAI,MAAM,6BAA6B,CAAC;EACvE,CAAC;AACH;AAKA,IAAM,mBAAmB,oBAAI,QAAO;AACpC,IAAM,mBAAmB,oBAAI,QAAO;AAEpC,SAAS,KAAK,GAAM;AAGlB,SAAO,iBAAiB,IAAI,CAAC,KAAK;AACpC;AAEA,SAAS,QAAQ,GAAS;AACxB,MAAI,MAAMF;AAAK,UAAM,IAAI,MAAM,cAAc;AAC/C;AAoBM,IAAO,OAAP,MAAW;;EAOf,YAAY,OAAW,MAAY;AACjC,SAAK,OAAO,MAAM;AAClB,SAAK,OAAO,MAAM;AAClB,SAAK,KAAK,MAAM;AAChB,SAAK,OAAO;EACd;;EAGA,cAAc,KAAe,GAAW,IAAc,KAAK,MAAI;AAC7D,QAAI,IAAc;AAClB,WAAO,IAAIA,MAAK;AACd,UAAI,IAAIC;AAAK,YAAI,EAAE,IAAI,CAAC;AACxB,UAAI,EAAE,OAAM;AACZ,YAAMA;IACR;AACA,WAAO;EACT;;;;;;;;;;;;;EAcQ,iBAAiB,OAAiB,GAAS;AACjD,UAAM,EAAE,SAAS,WAAU,IAAK,UAAU,GAAG,KAAK,IAAI;AACtD,UAAM,SAAqB,CAAA;AAC3B,QAAI,IAAc;AAClB,QAAI,OAAO;AACX,aAAS,SAAS,GAAG,SAAS,SAAS,UAAU;AAC/C,aAAO;AACP,aAAO,KAAK,IAAI;AAEhB,eAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,eAAO,KAAK,IAAI,CAAC;AACjB,eAAO,KAAK,IAAI;MAClB;AACA,UAAI,KAAK,OAAM;IACjB;AACA,WAAO;EACT;;;;;;;EAQQ,KAAK,GAAW,aAAyB,GAAS;AAExD,QAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;AAAG,YAAM,IAAI,MAAM,gBAAgB;AAEzD,QAAI,IAAI,KAAK;AACb,QAAI,IAAI,KAAK;AAMb,UAAM,KAAK,UAAU,GAAG,KAAK,IAAI;AACjC,aAAS,SAAS,GAAG,SAAS,GAAG,SAAS,UAAU;AAElD,YAAM,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO,IAAK,YAAY,GAAG,QAAQ,EAAE;AACnF,UAAI;AACJ,UAAI,QAAQ;AAGV,YAAI,EAAE,IAAI,SAAS,QAAQ,YAAY,OAAO,CAAC,CAAC;MAClD,OAAO;AAEL,YAAI,EAAE,IAAI,SAAS,OAAO,YAAY,MAAM,CAAC,CAAC;MAChD;IACF;AACA,YAAQ,CAAC;AAIT,WAAO,EAAE,GAAG,EAAC;EACf;;;;;;EAOQ,WACN,GACA,aACA,GACA,MAAgB,KAAK,MAAI;AAEzB,UAAM,KAAK,UAAU,GAAG,KAAK,IAAI;AACjC,aAAS,SAAS,GAAG,SAAS,GAAG,SAAS,UAAU;AAClD,UAAI,MAAMD;AAAK;AACf,YAAM,EAAE,OAAO,QAAQ,QAAQ,MAAK,IAAK,YAAY,GAAG,QAAQ,EAAE;AAClE,UAAI;AACJ,UAAI,QAAQ;AAGV;MACF,OAAO;AACL,cAAM,OAAO,YAAY,MAAM;AAC/B,cAAM,IAAI,IAAI,QAAQ,KAAK,OAAM,IAAK,IAAI;MAC5C;IACF;AACA,YAAQ,CAAC;AACT,WAAO;EACT;EAEQ,eAAe,GAAW,OAAiB,WAA4B;AAE7E,QAAI,OAAO,iBAAiB,IAAI,KAAK;AACrC,QAAI,CAAC,MAAM;AACT,aAAO,KAAK,iBAAiB,OAAO,CAAC;AACrC,UAAI,MAAM,GAAG;AAEX,YAAI,OAAO,cAAc;AAAY,iBAAO,UAAU,IAAI;AAC1D,yBAAiB,IAAI,OAAO,IAAI;MAClC;IACF;AACA,WAAO;EACT;EAEA,OACE,OACA,QACA,WAA4B;AAE5B,UAAM,IAAI,KAAK,KAAK;AACpB,WAAO,KAAK,KAAK,GAAG,KAAK,eAAe,GAAG,OAAO,SAAS,GAAG,MAAM;EACtE;EAEA,OAAO,OAAiB,QAAgB,WAA8B,MAAe;AACnF,UAAM,IAAI,KAAK,KAAK;AACpB,QAAI,MAAM;AAAG,aAAO,KAAK,cAAc,OAAO,QAAQ,IAAI;AAC1D,WAAO,KAAK,WAAW,GAAG,KAAK,eAAe,GAAG,OAAO,SAAS,GAAG,QAAQ,IAAI;EAClF;;;;EAKA,YAAY,GAAa,GAAS;AAChC,cAAU,GAAG,KAAK,IAAI;AACtB,qBAAiB,IAAI,GAAG,CAAC;AACzB,qBAAiB,OAAO,CAAC;EAC3B;EAEA,SAAS,KAAa;AACpB,WAAO,KAAK,GAAG,MAAM;EACvB;;AAoCI,SAAU,UACd,GACA,QACA,QACA,SAAiB;AAQjB,oBAAkB,QAAQ,CAAC;AAC3B,qBAAmB,SAAS,MAAM;AAClC,QAAM,UAAU,OAAO;AACvB,QAAM,UAAU,QAAQ;AACxB,MAAI,YAAY;AAAS,UAAM,IAAI,MAAM,qDAAqD;AAE9F,QAAM,OAAO,EAAE;AACf,QAAM,QAAQ,OAAO,OAAO,OAAO,CAAC;AACpC,MAAI,aAAa;AACjB,MAAI,QAAQ;AAAI,iBAAa,QAAQ;WAC5B,QAAQ;AAAG,iBAAa,QAAQ;WAChC,QAAQ;AAAG,iBAAa;AACjC,QAAM,OAAO,QAAQ,UAAU;AAC/B,QAAM,UAAU,IAAI,MAAM,OAAO,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI;AACrD,QAAM,WAAW,KAAK,OAAO,OAAO,OAAO,KAAK,UAAU,IAAI;AAC9D,MAAI,MAAM;AACV,WAAS,IAAI,UAAU,KAAK,GAAG,KAAK,YAAY;AAC9C,YAAQ,KAAK,IAAI;AACjB,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAM,SAAS,QAAQ,CAAC;AACxB,YAAMG,SAAQ,OAAQ,UAAU,OAAO,CAAC,IAAK,IAAI;AACjD,cAAQA,MAAK,IAAI,QAAQA,MAAK,EAAE,IAAI,OAAO,CAAC,CAAC;IAC/C;AACA,QAAI,OAAO;AAEX,aAAS,IAAI,QAAQ,SAAS,GAAG,OAAO,MAAM,IAAI,GAAG,KAAK;AACxD,aAAO,KAAK,IAAI,QAAQ,CAAC,CAAC;AAC1B,aAAO,KAAK,IAAI,IAAI;IACtB;AACA,UAAM,IAAI,IAAI,IAAI;AAClB,QAAI,MAAM;AAAG,eAAS,IAAI,GAAG,IAAI,YAAY;AAAK,cAAM,IAAI,OAAM;EACpE;AACA,SAAO;AACT;AAkJA,SAAS,YAAe,OAAe,OAAmBC,OAAc;AACtE,MAAI,OAAO;AACT,QAAI,MAAM,UAAU;AAAO,YAAM,IAAI,MAAM,gDAAgD;AAC3F,kBAAc,KAAK;AACnB,WAAO;EACT,OAAO;AACL,WAAO,MAAM,OAAO,EAAE,MAAAA,MAAI,CAAE;EAC9B;AACF;AAIM,SAAU,mBACd,MACA,OACA,YAA8B,CAAA,GAC9B,QAAgB;AAEhB,MAAI,WAAW;AAAW,aAAS,SAAS;AAC5C,MAAI,CAAC,SAAS,OAAO,UAAU;AAAU,UAAM,IAAI,MAAM,kBAAkB,IAAI,eAAe;AAC9F,aAAW,KAAK,CAAC,KAAK,KAAK,GAAG,GAAY;AACxC,UAAM,MAAM,MAAM,CAAC;AACnB,QAAI,EAAE,OAAO,QAAQ,YAAY,MAAMC;AACrC,YAAM,IAAI,MAAM,SAAS,CAAC,0BAA0B;EACxD;AACA,QAAMC,MAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,QAAMC,MAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,QAAM,KAAgB,SAAS,gBAAgB,MAAM;AACrD,QAAM,SAAS,CAAC,MAAM,MAAM,KAAK,EAAE;AACnC,aAAW,KAAK,QAAQ;AAEtB,QAAI,CAACD,IAAG,QAAQ,MAAM,CAAC,CAAC;AACtB,YAAM,IAAI,MAAM,SAAS,CAAC,0CAA0C;EACxE;AACA,UAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,KAAK,CAAC;AAC9C,SAAO,EAAE,OAAO,IAAAA,KAAI,IAAAC,IAAE;AACxB;;;AC5oBA,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAArC,IAAwCC,OAAM,OAAO,CAAC;AAAtD,IAAyDC,OAAM,OAAO,CAAC;AA8JvE,SAAS,YAAYC,KAAoB,OAAoB,GAAW,GAAS;AAC/E,QAAM,KAAKA,IAAG,IAAI,CAAC;AACnB,QAAM,KAAKA,IAAG,IAAI,CAAC;AACnB,QAAM,OAAOA,IAAG,IAAIA,IAAG,IAAI,MAAM,GAAG,EAAE,GAAG,EAAE;AAC3C,QAAM,QAAQA,IAAG,IAAIA,IAAG,KAAKA,IAAG,IAAI,MAAM,GAAGA,IAAG,IAAI,IAAI,EAAE,CAAC,CAAC;AAC5D,SAAOA,IAAG,IAAI,MAAM,KAAK;AAC3B;AAEM,SAAU,QAAQ,QAAqB,YAA8B,CAAA,GAAE;AAC3E,QAAM,YAAY,mBAAmB,WAAW,QAAQ,WAAW,UAAU,MAAM;AACnF,QAAM,EAAE,IAAAA,KAAI,IAAAC,IAAE,IAAK;AACnB,MAAI,QAAQ,UAAU;AACtB,QAAM,EAAE,GAAG,SAAQ,IAAK;AACxB,kBAAgB,WAAW,CAAA,GAAI,EAAE,SAAS,WAAU,CAAE;AAMtD,QAAM,OAAOH,QAAQ,OAAOG,IAAG,QAAQ,CAAC,IAAIJ;AAC5C,QAAM,OAAO,CAAC,MAAcG,IAAG,OAAO,CAAC;AAGvC,QAAME,WACJ,UAAU,YACT,CAAC,GAAW,MAAa;AACxB,QAAI;AACF,aAAO,EAAE,SAAS,MAAM,OAAOF,IAAG,KAAKA,IAAG,IAAI,GAAG,CAAC,CAAC,EAAC;IACtD,SAAS,GAAG;AACV,aAAO,EAAE,SAAS,OAAO,OAAOJ,KAAG;IACrC;EACF;AAIF,MAAI,CAAC,YAAYI,KAAI,OAAO,MAAM,IAAI,MAAM,EAAE;AAC5C,UAAM,IAAI,MAAM,mCAAmC;AAMrD,WAAS,OAAO,OAAe,GAAW,UAAU,OAAK;AACvD,UAAM,MAAM,UAAUH,OAAMD;AAC5B,aAAS,gBAAgB,OAAO,GAAG,KAAK,IAAI;AAC5C,WAAO;EACT;AAEA,WAAS,UAAU,OAAc;AAC/B,QAAI,EAAE,iBAAiB;AAAQ,YAAM,IAAI,MAAM,wBAAwB;EACzE;AAGA,QAAM,eAAe,SAAS,CAAC,GAAU,OAAoC;AAC3E,UAAM,EAAE,GAAG,GAAG,EAAC,IAAK;AACpB,UAAM,MAAM,EAAE,IAAG;AACjB,QAAI,MAAM;AAAM,WAAK,MAAMG,OAAOC,IAAG,IAAI,CAAC;AAC1C,UAAM,IAAI,KAAK,IAAI,EAAE;AACrB,UAAM,IAAI,KAAK,IAAI,EAAE;AACrB,UAAM,KAAKA,IAAG,IAAI,GAAG,EAAE;AACvB,QAAI;AAAK,aAAO,EAAE,GAAGJ,MAAK,GAAGC,KAAG;AAChC,QAAI,OAAOA;AAAK,YAAM,IAAI,MAAM,kBAAkB;AAClD,WAAO,EAAE,GAAG,EAAC;EACf,CAAC;AACD,QAAM,kBAAkB,SAAS,CAAC,MAAY;AAC5C,UAAM,EAAE,GAAG,EAAC,IAAK;AACjB,QAAI,EAAE,IAAG;AAAI,YAAM,IAAI,MAAM,iBAAiB;AAG9C,UAAM,EAAE,GAAG,GAAG,GAAG,EAAC,IAAK;AACvB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,KAAK,EAAE;AACvB,UAAM,MAAM,KAAK,KAAK,CAAC;AACvB,UAAM,OAAO,KAAK,KAAK,KAAK,MAAM,EAAE,CAAC;AACrC,UAAM,QAAQ,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC;AAC/C,QAAI,SAAS;AAAO,YAAM,IAAI,MAAM,uCAAuC;AAE3E,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,QAAI,OAAO;AAAI,YAAM,IAAI,MAAM,uCAAuC;AACtE,WAAO;EACT,CAAC;EAID,MAAM,MAAK;IAeT,YAAY,GAAW,GAAW,GAAW,GAAS;AACpD,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,WAAK,IAAI,OAAO,KAAK,GAAG,IAAI;AAC5B,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,aAAO,OAAO,IAAI;IACpB;IAEA,OAAO,QAAK;AACV,aAAO;IACT;IAEA,OAAO,WAAW,GAAsB;AACtC,UAAI,aAAa;AAAO,cAAM,IAAI,MAAM,4BAA4B;AACpE,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,CAAA;AACtB,aAAO,KAAK,CAAC;AACb,aAAO,KAAK,CAAC;AACb,aAAO,IAAI,MAAM,GAAG,GAAGA,MAAK,KAAK,IAAI,CAAC,CAAC;IACzC;;IAGA,OAAO,UAAU,OAAmB,SAAS,OAAK;AAChD,YAAM,MAAMG,IAAG;AACf,YAAM,EAAE,GAAG,EAAC,IAAK;AACjB,cAAQ,UAAU,SAAO,OAAO,KAAK,OAAO,CAAC;AAC7C,cAAM,QAAQ,QAAQ;AACtB,YAAM,SAAS,UAAU,KAAK;AAC9B,YAAM,WAAW,MAAM,MAAM,CAAC;AAC9B,aAAO,MAAM,CAAC,IAAI,WAAW,CAAC;AAC9B,YAAM,IAAI,gBAAgB,MAAM;AAMhC,YAAM,MAAM,SAAS,OAAOA,IAAG;AAC/B,eAAS,WAAW,GAAGJ,MAAK,GAAG;AAI/B,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,IAAI,KAAK,KAAKC,IAAG;AACvB,YAAM,IAAI,KAAK,IAAI,KAAK,CAAC;AACzB,UAAI,EAAE,SAAAM,UAAS,OAAO,EAAC,IAAKD,SAAQ,GAAG,CAAC;AACxC,UAAI,CAACC;AAAS,cAAM,IAAI,MAAM,iCAAiC;AAC/D,YAAM,UAAU,IAAIN,UAASA;AAC7B,YAAM,iBAAiB,WAAW,SAAU;AAC5C,UAAI,CAAC,UAAU,MAAMD,QAAO;AAE1B,cAAM,IAAI,MAAM,0BAA0B;AAC5C,UAAI,kBAAkB;AAAQ,YAAI,KAAK,CAAC,CAAC;AACzC,aAAO,MAAM,WAAW,EAAE,GAAG,EAAC,CAAE;IAClC;IACA,OAAO,QAAQ,OAAmB,SAAS,OAAK;AAC9C,aAAO,MAAM,UAAU,YAAY,SAAS,KAAK,GAAG,MAAM;IAC5D;IAEA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;IACA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;IAEA,WAAW,aAAqB,GAAG,SAAS,MAAI;AAC9C,WAAK,YAAY,MAAM,UAAU;AACjC,UAAI,CAAC;AAAQ,aAAK,SAASE,IAAG;AAC9B,aAAO;IACT;;IAGA,iBAAc;AACZ,sBAAgB,IAAI;IACtB;;IAGA,OAAO,OAAY;AACjB,gBAAU,KAAK;AACf,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,OAAO,KAAK,KAAK,EAAE;AACzB,YAAM,OAAO,KAAK,KAAK,EAAE;AACzB,YAAM,OAAO,KAAK,KAAK,EAAE;AACzB,YAAM,OAAO,KAAK,KAAK,EAAE;AACzB,aAAO,SAAS,QAAQ,SAAS;IACnC;IAEA,MAAG;AACD,aAAO,KAAK,OAAO,MAAM,IAAI;IAC/B;IAEA,SAAM;AAEJ,aAAO,IAAI,MAAM,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAC/D;;;;IAKA,SAAM;AACJ,YAAM,EAAE,EAAC,IAAK;AACd,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,KAAKA,OAAM,KAAK,KAAK,EAAE,CAAC;AAClC,YAAM,IAAI,KAAK,IAAI,CAAC;AACpB,YAAM,OAAO,KAAK;AAClB,YAAM,IAAI,KAAK,KAAK,OAAO,IAAI,IAAI,IAAI,CAAC;AACxC,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,IAAI;AACd,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,aAAO,IAAI,MAAM,IAAI,IAAI,IAAI,EAAE;IACjC;;;;IAKA,IAAI,OAAY;AACd,gBAAU,KAAK;AACf,YAAM,EAAE,GAAG,EAAC,IAAK;AACjB,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AACvC,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AACvC,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,KAAK,KAAK,IAAI,EAAE;AAC1B,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,MAAM,KAAK,OAAO,KAAK,MAAM,IAAI,CAAC;AAC5C,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,KAAK,IAAI,IAAI,CAAC;AACxB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,aAAO,IAAI,MAAM,IAAI,IAAI,IAAI,EAAE;IACjC;IAEA,SAAS,OAAY;AACnB,aAAO,KAAK,IAAI,MAAM,OAAM,CAAE;IAChC;;IAGA,SAAS,QAAc;AAErB,UAAI,CAACG,IAAG,YAAY,MAAM;AAAG,cAAM,IAAI,MAAM,4CAA4C;AACzF,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,OAAO,MAAM,QAAQ,CAACG,OAAM,WAAW,OAAOA,EAAC,CAAC;AACtE,aAAO,WAAW,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;IACpC;;;;;;IAOA,eAAe,QAAgB,MAAM,MAAM,MAAI;AAE7C,UAAI,CAACH,IAAG,QAAQ,MAAM;AAAG,cAAM,IAAI,MAAM,4CAA4C;AACrF,UAAI,WAAWL;AAAK,eAAO,MAAM;AACjC,UAAI,KAAK,IAAG,KAAM,WAAWC;AAAK,eAAO;AACzC,aAAO,KAAK,OAAO,MAAM,QAAQ,CAAC,MAAM,WAAW,OAAO,CAAC,GAAG,GAAG;IACnE;;;;;IAMA,eAAY;AACV,aAAO,KAAK,eAAe,QAAQ,EAAE,IAAG;IAC1C;;;IAIA,gBAAa;AACX,aAAO,KAAK,OAAO,MAAM,MAAM,CAAC,EAAE,IAAG;IACvC;;;IAIA,SAAS,WAAkB;AACzB,aAAO,aAAa,MAAM,SAAS;IACrC;IAEA,gBAAa;AACX,UAAI,aAAaA;AAAK,eAAO;AAC7B,aAAO,KAAK,eAAe,QAAQ;IACrC;IAEA,UAAO;AACL,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,SAAQ;AAE9B,YAAM,QAAQG,IAAG,QAAQ,CAAC;AAG1B,YAAM,MAAM,SAAS,CAAC,KAAK,IAAIH,OAAM,MAAO;AAC5C,aAAO;IACT;IACA,QAAK;AACH,aAAO,WAAW,KAAK,QAAO,CAAE;IAClC;IAEA,WAAQ;AACN,aAAO,UAAU,KAAK,IAAG,IAAK,SAAS,KAAK,MAAK,CAAE;IACrD;;IAGA,IAAI,KAAE;AACJ,aAAO,KAAK;IACd;IACA,IAAI,KAAE;AACJ,aAAO,KAAK;IACd;IACA,IAAI,KAAE;AACJ,aAAO,KAAK;IACd;IACA,IAAI,KAAE;AACJ,aAAO,KAAK;IACd;IACA,OAAO,WAAW,QAAe;AAC/B,aAAO,WAAW,OAAO,MAAM;IACjC;IACA,OAAO,IAAI,QAAiB,SAAiB;AAC3C,aAAO,UAAU,OAAOI,KAAI,QAAQ,OAAO;IAC7C;IACA,eAAe,YAAkB;AAC/B,WAAK,WAAW,UAAU;IAC5B;IACA,aAAU;AACR,aAAO,KAAK,QAAO;IACrB;;AArPgB,QAAA,OAAO,IAAI,MAAM,MAAM,IAAI,MAAM,IAAIJ,MAAK,KAAK,MAAM,KAAK,MAAM,EAAE,CAAC;AAEnE,QAAA,OAAO,IAAI,MAAMD,MAAKC,MAAKA,MAAKD,IAAG;AAEnC,QAAA,KAAKI;AAEL,QAAA,KAAKC;AAiPvB,QAAM,OAAO,IAAI,KAAK,OAAOA,IAAG,IAAI;AACpC,QAAM,KAAK,WAAW,CAAC;AACvB,SAAO;AACT;AAOM,IAAgB,oBAAhB,MAAiC;EAUrC,YAAY,IAAgB;AAC1B,SAAK,KAAK;EACZ;;EAOA,OAAO,UAAU,QAAkB;AACjC,mBAAc;EAChB;EAEA,OAAO,QAAQ,MAAS;AACtB,mBAAc;EAChB;EAEA,IAAI,IAAC;AACH,WAAO,KAAK,SAAQ,EAAG;EACzB;EACA,IAAI,IAAC;AACH,WAAO,KAAK,SAAQ,EAAG;EACzB;;EAGA,gBAAa;AAEX,WAAO;EACT;EAEA,iBAAc;AACZ,SAAK,GAAG,eAAc;EACxB;EAEA,SAAS,WAAkB;AACzB,WAAO,KAAK,GAAG,SAAS,SAAS;EACnC;EAEA,QAAK;AACH,WAAO,WAAW,KAAK,QAAO,CAAE;EAClC;EAEA,WAAQ;AACN,WAAO,KAAK,MAAK;EACnB;EAEA,gBAAa;AACX,WAAO;EACT;EAEA,eAAY;AACV,WAAO;EACT;EAEA,IAAI,OAAQ;AACV,SAAK,WAAW,KAAK;AACrB,WAAO,KAAK,KAAK,KAAK,GAAG,IAAI,MAAM,EAAE,CAAC;EACxC;EAEA,SAAS,OAAQ;AACf,SAAK,WAAW,KAAK;AACrB,WAAO,KAAK,KAAK,KAAK,GAAG,SAAS,MAAM,EAAE,CAAC;EAC7C;EAEA,SAAS,QAAc;AACrB,WAAO,KAAK,KAAK,KAAK,GAAG,SAAS,MAAM,CAAC;EAC3C;EAEA,eAAe,QAAc;AAC3B,WAAO,KAAK,KAAK,KAAK,GAAG,eAAe,MAAM,CAAC;EACjD;EAEA,SAAM;AACJ,WAAO,KAAK,KAAK,KAAK,GAAG,OAAM,CAAE;EACnC;EAEA,SAAM;AACJ,WAAO,KAAK,KAAK,KAAK,GAAG,OAAM,CAAE;EACnC;EAEA,WAAW,YAAqB,QAAgB;AAC9C,WAAO,KAAK,KAAK,KAAK,GAAG,WAAW,YAAY,MAAM,CAAC;EACzD;;EAQA,aAAU;AACR,WAAO,KAAK,QAAO;EACrB;;AAMI,SAAU,MAAM,OAAyB,OAAc,YAAuB,CAAA,GAAE;AACpF,MAAI,OAAO,UAAU;AAAY,UAAM,IAAI,MAAM,mCAAmC;AACpF,kBACE,WACA,CAAA,GACA;IACE,mBAAmB;IACnB,aAAa;IACb,QAAQ;IACR,SAAS;IACT,YAAY;GACb;AAGH,QAAM,EAAE,QAAO,IAAK;AACpB,QAAM,EAAE,MAAM,IAAAD,KAAI,IAAAC,IAAE,IAAK;AAEzB,QAAMI,eAAc,UAAU,eAAeA;AAC7C,QAAMC,qBAAoB,UAAU,sBAAsB,CAAC,UAAsB;AACjF,QAAM,SACJ,UAAU,WACT,CAAC,MAAkB,KAAiB,WAAmB;AACtD,YAAM,QAAQ,QAAQ;AACtB,QAAI,IAAI,UAAU;AAAQ,YAAM,IAAI,MAAM,qCAAqC;AAC/E,WAAO;EACT;AAGF,WAAS,QAAQ,MAAgB;AAC/B,WAAOL,IAAG,OAAO,gBAAgB,IAAI,CAAC;EACxC;AAGA,WAAS,iBAAiB,KAAQ;AAChC,UAAM,MAAM,QAAQ;AACpB,UAAM,YAAY,eAAe,KAAK,GAAG;AAGzC,UAAM,SAAS,YAAY,sBAAsB,MAAM,GAAG,GAAG,IAAI,GAAG;AACpE,UAAM,OAAOK,mBAAkB,OAAO,MAAM,GAAG,GAAG,CAAC;AACnD,UAAM,SAAS,OAAO,MAAM,KAAK,IAAI,GAAG;AACxC,UAAM,SAAS,QAAQ,IAAI;AAC3B,WAAO,EAAE,MAAM,QAAQ,OAAM;EAC/B;AAGA,WAAS,qBAAqBC,YAAc;AAC1C,UAAM,EAAE,MAAM,QAAQ,OAAM,IAAK,iBAAiBA,UAAS;AAC3D,UAAM,QAAQ,KAAK,SAAS,MAAM;AAClC,UAAM,aAAa,MAAM,QAAO;AAChC,WAAO,EAAE,MAAM,QAAQ,QAAQ,OAAO,WAAU;EAClD;AAGA,WAAS,aAAaA,YAAc;AAClC,WAAO,qBAAqBA,UAAS,EAAE;EACzC;AAGA,WAAS,mBAAmB,UAAe,WAAW,GAAE,MAAO,MAAkB;AAC/E,UAAM,MAAM,YAAY,GAAG,IAAI;AAC/B,WAAO,QAAQ,MAAM,OAAO,KAAK,YAAY,WAAW,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;EAC/E;AAGA,WAAS,KAAK,KAAUA,YAAgB,UAA6B,CAAA,GAAE;AACrE,UAAM,YAAY,WAAW,GAAG;AAChC,QAAI;AAAS,YAAM,QAAQ,GAAG;AAC9B,UAAM,EAAE,QAAQ,QAAQ,WAAU,IAAK,qBAAqBA,UAAS;AACrE,UAAM,IAAI,mBAAmB,QAAQ,SAAS,QAAQ,GAAG;AACzD,UAAM,IAAI,KAAK,SAAS,CAAC,EAAE,QAAO;AAClC,UAAM,IAAI,mBAAmB,QAAQ,SAAS,GAAG,YAAY,GAAG;AAChE,UAAMC,KAAIP,IAAG,OAAO,IAAI,IAAI,MAAM;AAClC,QAAI,CAACA,IAAG,QAAQO,EAAC;AAAG,YAAM,IAAI,MAAM,wBAAwB;AAC5D,UAAM,KAAK,YAAY,GAAGP,IAAG,QAAQO,EAAC,CAAC;AACvC,WAAO,SAAO,IAAI,QAAQ,WAAW,QAAQ;EAC/C;AAGA,QAAM,aAAkD,EAAE,QAAQ,KAAI;AAMtE,WAAS,OAAO,KAAU,KAAU,WAAgB,UAAU,YAAU;AACtE,UAAM,EAAE,SAAS,OAAM,IAAK;AAC5B,UAAM,MAAM,QAAQ;AACpB,UAAM,YAAY,aAAa,KAAK,GAAG;AACvC,UAAM,YAAY,WAAW,GAAG;AAChC,gBAAY,YAAY,aAAa,WAAW,QAAQ,SAAS;AACjE,QAAI,WAAW;AAAW,cAAM,QAAQ,QAAQ;AAChD,QAAI;AAAS,YAAM,QAAQ,GAAG;AAE9B,UAAM,MAAM,MAAM;AAClB,UAAM,IAAI,IAAI,SAAS,GAAG,GAAG;AAC7B,UAAMA,KAAI,gBAAgB,IAAI,SAAS,KAAK,GAAG,CAAC;AAChD,QAAI,GAAG,GAAG;AACV,QAAI;AAIF,UAAI,MAAM,UAAU,WAAW,MAAM;AACrC,UAAI,MAAM,UAAU,GAAG,MAAM;AAC7B,WAAK,KAAK,eAAeA,EAAC;IAC5B,SAAS,OAAO;AACd,aAAO;IACT;AACA,QAAI,CAAC,UAAU,EAAE,aAAY;AAAI,aAAO;AAExC,UAAM,IAAI,mBAAmB,SAAS,EAAE,QAAO,GAAI,EAAE,QAAO,GAAI,GAAG;AACnE,UAAM,MAAM,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;AAGrC,WAAO,IAAI,SAAS,EAAE,EAAE,cAAa,EAAG,IAAG;EAC7C;AAEA,QAAM,QAAQR,IAAG;AACjB,QAAM,UAAU;IACd,WAAW;IACX,WAAW;IACX,WAAW,IAAI;IACf,MAAM;;AAER,WAAS,gBAAgB,OAAOK,aAAY,QAAQ,IAAI,GAAC;AACvD,WAAO,SAAO,MAAM,QAAQ,MAAM,MAAM;EAC1C;AACA,WAAS,OAAO,MAAiB;AAC/B,UAAME,aAAY,MAAM,gBAAgB,IAAI;AAC5C,WAAO,EAAE,WAAAA,YAAW,WAAW,aAAaA,UAAS,EAAC;EACxD;AACA,WAAS,iBAAiB,KAAe;AACvC,WAAO,QAAQ,GAAG,KAAK,IAAI,WAAWN,IAAG;EAC3C;AACA,WAAS,iBAAiB,KAAiB,QAAgB;AACzD,QAAI;AACF,aAAO,CAAC,CAAC,MAAM,UAAU,KAAK,MAAM;IACtC,SAAS,OAAO;AACd,aAAO;IACT;EACF;AAEA,QAAM,QAAQ;IACZ;IACA;IACA;IACA;;;;;;;;;;IAUA,aAAa,WAAqB;AAChC,YAAM,EAAE,EAAC,IAAK,MAAM,UAAU,SAAS;AACvC,YAAM,OAAO,QAAQ;AACrB,YAAM,UAAU,SAAS;AACzB,UAAI,CAAC,WAAW,SAAS;AAAI,cAAM,IAAI,MAAM,gCAAgC;AAC7E,YAAM,IAAI,UAAUD,IAAG,IAAIH,OAAM,GAAGA,OAAM,CAAC,IAAIG,IAAG,IAAI,IAAIH,MAAK,IAAIA,IAAG;AACtE,aAAOG,IAAG,QAAQ,CAAC;IACrB;IAEA,mBAAmBO,YAAqB;AACtC,YAAM,OAAO,QAAQ;AACrB,eAAOA,YAAW,IAAI;AACtB,YAAM,SAAS,MAAMA,WAAU,SAAS,GAAG,IAAI,CAAC;AAChD,aAAOD,mBAAkB,MAAM,EAAE,SAAS,GAAG,IAAI;IACnD;;IAGA,kBAAkB;;IAElB,WAAW,aAAa,GAAG,QAAsB,MAAM,MAAI;AACzD,aAAO,MAAM,WAAW,YAAY,KAAK;IAC3C;;AAGF,SAAO,OAAO,OAAO;IACnB;IACA;IACA;IACA;IACA;IACA;IACA;GACD;AACH;AAmCA,SAAS,0BAA0B,GAAsB;AACvD,QAAM,QAAqB;IACzB,GAAG,EAAE;IACL,GAAG,EAAE;IACL,GAAG,EAAE,GAAG;IACR,GAAG,EAAE;IACL,GAAG,EAAE;IACL,IAAI,EAAE;IACN,IAAI,EAAE;;AAER,QAAMN,MAAK,EAAE;AACb,QAAMC,MAAK,MAAM,MAAM,GAAG,EAAE,YAAY,IAAI;AAC5C,QAAM,YAA8B,EAAE,IAAAD,KAAI,IAAAC,KAAI,SAAS,EAAE,QAAO;AAChE,QAAM,YAAuB;IAC3B,aAAa,EAAE;IACf,mBAAmB,EAAE;IACrB,QAAQ,EAAE;IACV,SAAS,EAAE;IACX,YAAY,EAAE;;AAEhB,SAAO,EAAE,OAAO,WAAW,MAAM,EAAE,MAAM,UAAS;AACpD;AACA,SAAS,4BAA4B,GAAwBQ,QAAY;AACvE,QAAM,QAAQA,OAAM;AACpB,QAAM,SAAS,OAAO,OAAO,CAAA,GAAIA,QAAO;IACtC,eAAe;IACf,OAAO;IACP,YAAY,MAAM,GAAG;IACrB,aAAa,MAAM,GAAG;GACvB;AACD,SAAO;AACT;AAEM,SAAU,eAAe,GAAsB;AACnD,QAAM,EAAE,OAAO,WAAW,MAAM,UAAS,IAAK,0BAA0B,CAAC;AACzE,QAAM,QAAQ,QAAQ,OAAO,SAAS;AACtC,QAAM,QAAQ,MAAM,OAAO,MAAM,SAAS;AAC1C,SAAO,4BAA4B,GAAG,KAAK;AAC7C;;;AC93BA,IAAMC,OAAM,OAAO,CAAC;AACpB,IAAMC,OAAM,OAAO,CAAC;AACpB,IAAMC,OAAM,OAAO,CAAC;AA2BpB,SAAS,aAAa,OAAgB;AACpC,kBAAgB,OAAO;IACrB,mBAAmB;IACnB,YAAY;GACb;AACD,SAAO,OAAO,OAAO,EAAE,GAAG,MAAK,CAAW;AAC5C;AAEM,SAAU,WAAW,UAAmB;AAC5C,QAAM,QAAQ,aAAa,QAAQ;AACnC,QAAM,EAAE,GAAG,MAAM,mBAAAC,oBAAmB,YAAY,aAAa,KAAI,IAAK;AACtE,QAAM,UAAU,SAAS;AACzB,MAAI,CAAC,WAAW,SAAS;AAAQ,UAAM,IAAI,MAAM,cAAc;AAC/D,QAAM,eAAe,QAAQC;AAE7B,QAAM,iBAAiB,UAAU,MAAM;AACvC,QAAM,WAAW,UAAU,KAAK;AAChC,QAAM,KAAK,UAAU,OAAO,CAAC,IAAI,OAAO,CAAC;AAKzC,QAAM,MAAM,UAAU,OAAO,MAAM,IAAI,OAAO,KAAK;AAInD,QAAM,YAAY,UAAUF,QAAO,OAAO,GAAG,IAAIA,QAAO,OAAO,GAAG;AAClE,QAAM,WAAW,UACb,OAAO,CAAC,IAAIA,QAAO,OAAO,GAAG,IAAID,OACjC,OAAO,CAAC,IAAIC,QAAO,OAAO,GAAG,IAAID;AACrC,QAAM,YAAY,YAAY,WAAWA;AACzC,QAAM,OAAO,CAAC,MAAc,IAAI,GAAG,CAAC;AACpC,QAAM,UAAU,QAAQ,EAAE;AAC1B,WAAS,QAAQ,GAAS;AACxB,WAAO,gBAAgB,KAAK,CAAC,GAAG,QAAQ;EAC1C;AACA,WAAS,QAAQ,GAAM;AACrB,UAAM,KAAK,YAAY,gBAAgB,GAAG,QAAQ;AAGlD,QAAI;AAAS,SAAG,EAAE,KAAK;AAKvB,WAAO,KAAK,gBAAgB,EAAE,CAAC;EACjC;AACA,WAAS,aAAa,QAAW;AAC/B,WAAO,gBAAgBE,mBAAkB,YAAY,UAAU,QAAQ,QAAQ,CAAC,CAAC;EACnF;AACA,WAAS,WAAW,QAAa,GAAM;AACrC,UAAM,KAAK,iBAAiB,QAAQ,CAAC,GAAG,aAAa,MAAM,CAAC;AAI5D,QAAI,OAAOH;AAAK,YAAM,IAAI,MAAM,wCAAwC;AACxE,WAAO,QAAQ,EAAE;EACnB;AAEA,WAAS,eAAe,QAAW;AACjC,WAAO,WAAW,QAAQ,OAAO;EACnC;AAGA,WAASK,OAAM,MAAc,KAAa,KAAW;AAInD,UAAM,QAAQ,KAAK,QAAQ,MAAM,IAAI;AACrC,UAAM,KAAK,MAAM,KAAK;AACtB,UAAM,KAAK,MAAM,KAAK;AACtB,WAAO,EAAE,KAAK,IAAG;EACnB;AAQA,WAAS,iBAAiB,GAAW,QAAc;AACjD,aAAS,KAAK,GAAGL,MAAK,CAAC;AACvB,aAAS,UAAU,QAAQ,WAAW,SAAS;AAC/C,UAAM,IAAI;AACV,UAAM,MAAM;AACZ,QAAI,MAAMC;AACV,QAAI,MAAMD;AACV,QAAI,MAAM;AACV,QAAI,MAAMC;AACV,QAAI,OAAOD;AACX,aAAS,IAAI,OAAO,iBAAiB,CAAC,GAAG,KAAKA,MAAK,KAAK;AACtD,YAAM,MAAO,KAAK,IAAKC;AACvB,cAAQ;AACR,OAAC,EAAE,KAAK,IAAG,IAAKI,OAAM,MAAM,KAAK,GAAG;AACpC,OAAC,EAAE,KAAK,KAAK,KAAK,IAAG,IAAKA,OAAM,MAAM,KAAK,GAAG;AAC9C,aAAO;AAEP,YAAM,IAAI,MAAM;AAChB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,IAAI,MAAM;AAChB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,IAAI,KAAK;AACf,YAAM,IAAI,MAAM;AAChB,YAAM,IAAI,MAAM;AAChB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,OAAO,KAAK;AAClB,YAAM,QAAQ,KAAK;AACnB,YAAM,KAAK,OAAO,IAAI;AACtB,YAAM,KAAK,MAAM,KAAK,QAAQ,KAAK,CAAC;AACpC,YAAM,KAAK,KAAK,EAAE;AAClB,YAAM,KAAK,KAAK,KAAK,KAAK,MAAM,CAAC,EAAE;IACrC;AACA,KAAC,EAAE,KAAK,IAAG,IAAKA,OAAM,MAAM,KAAK,GAAG;AACpC,KAAC,EAAE,KAAK,KAAK,KAAK,IAAG,IAAKA,OAAM,MAAM,KAAK,GAAG;AAC9C,UAAM,KAAK,WAAW,GAAG;AACzB,WAAO,KAAK,MAAM,EAAE;EACtB;AACA,QAAM,UAAU;IACd,WAAW;IACX,WAAW;IACX,MAAM;;AAER,QAAM,kBAAkB,CAAC,OAAO,aAAa,QAAQ,MAAK;AACxD,WAAO,MAAM,QAAQ,IAAI;AACzB,WAAO;EACT;AACA,WAAS,OAAO,MAAiB;AAC/B,UAAMC,aAAY,gBAAgB,IAAI;AACtC,WAAO,EAAE,WAAAA,YAAW,WAAW,eAAeA,UAAS,EAAC;EAC1D;AACA,QAAM,QAAQ;IACZ;IACA,kBAAkB;;AAEpB,SAAO;IACL;IACA,iBAAiB,CAACA,YAAgB,cAAmB,WAAWA,YAAW,SAAS;IACpF,cAAc,CAACA,eAA+B,eAAeA,UAAS;IACtE;IACA;IACA;IACA,SAAS,QAAQ,MAAK;IACtB;;AAEJ;;;ACzJA,IAAMC,OAAsB,uBAAO,CAAC;AAApC,IAAuCC,OAAM,OAAO,CAAC;AAArD,IAAwDC,OAAM,OAAO,CAAC;AAAtE,IAAyEC,OAAM,OAAO,CAAC;AAEvF,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAGrC,IAAM,kBAAkB,OACtB,oEAAoE;AAMtE,IAAM,gBAA8C,wBAAO;EACzD,GAAG;EACH,GAAG,OAAO,oEAAoE;EAC9E,GAAGA;EACH,GAAG,OAAO,oEAAoE;EAC9E,GAAG,OAAO,oEAAoE;EAC9E,IAAI,OAAO,oEAAoE;EAC/E,IAAI,OAAO,oEAAoE;IAC9E;AAEH,SAAS,oBAAoB,GAAS;AAEpC,QAAM,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAC/E,QAAM,IAAI;AACV,QAAM,KAAM,IAAI,IAAK;AACrB,QAAM,KAAM,KAAK,IAAK;AACtB,QAAM,KAAM,KAAK,IAAIH,MAAK,CAAC,IAAI,KAAM;AACrC,QAAM,KAAM,KAAK,IAAID,MAAK,CAAC,IAAI,IAAK;AACpC,QAAM,MAAO,KAAK,IAAIG,MAAK,CAAC,IAAI,KAAM;AACtC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,OAAQ,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AAC1C,QAAM,OAAQ,KAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AAC3C,QAAM,OAAQ,KAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AAC3C,QAAM,YAAa,KAAK,MAAMF,MAAK,CAAC,IAAI,IAAK;AAE7C,SAAO,EAAE,WAAW,GAAE;AACxB;AAEA,SAAS,kBAAkB,OAAiB;AAG1C,QAAM,CAAC,KAAK;AAEZ,QAAM,EAAE,KAAK;AAEb,QAAM,EAAE,KAAK;AACb,SAAO;AACT;AAIA,IAAM,kBAAkC,uBACtC,+EAA+E;AAGjF,SAAS,QAAQ,GAAW,GAAS;AACnC,QAAM,IAAI;AACV,QAAM,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AAC3B,QAAM,KAAK,IAAI,KAAK,KAAK,GAAG,CAAC;AAE7B,QAAMI,OAAM,oBAAoB,IAAI,EAAE,EAAE;AACxC,MAAI,IAAI,IAAI,IAAI,KAAKA,MAAK,CAAC;AAC3B,QAAM,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC;AAC5B,QAAM,QAAQ;AACd,QAAM,QAAQ,IAAI,IAAI,iBAAiB,CAAC;AACxC,QAAM,WAAW,QAAQ;AACzB,QAAM,WAAW,QAAQ,IAAI,CAAC,GAAG,CAAC;AAClC,QAAM,SAAS,QAAQ,IAAI,CAAC,IAAI,iBAAiB,CAAC;AAClD,MAAI;AAAU,QAAI;AAClB,MAAI,YAAY;AAAQ,QAAI;AAC5B,MAAI,aAAa,GAAG,CAAC;AAAG,QAAI,IAAI,CAAC,GAAG,CAAC;AACrC,SAAO,EAAE,SAAS,YAAY,UAAU,OAAO,EAAC;AAClD;AAEA,IAAM,KAAsB,uBAAM,MAAM,cAAc,GAAG,EAAE,MAAM,KAAI,CAAE,GAAE;AACzE,IAAM,KAAsB,uBAAM,MAAM,cAAc,GAAG,EAAE,MAAM,KAAI,CAAE,GAAE;AAEzE,IAAM,kBAAmC,wBAAO;EAC9C,GAAG;EACH;EACA,MAAM;EACN;;;;EAIA;IACC;AAYI,IAAM,UAAoC,uBAAM,eAAe,eAAe,GAAE;AAsChF,IAAM,SAAoC,uBAAK;AACpD,QAAM,IAAI,GAAG;AACb,SAAO,WAAW;IAChB;IACA,MAAM;IACN,YAAY,CAAC,MAAqB;AAEhC,YAAM,EAAE,WAAW,GAAE,IAAK,oBAAoB,CAAC;AAC/C,aAAO,IAAI,KAAK,WAAWC,MAAK,CAAC,IAAI,IAAI,CAAC;IAC5C;IACA;GACD;AACH,GAAE;AA2FF,IAAM,UAAU;AAEhB,IAAM,oBAAoC,uBACxC,+EAA+E;AAGjF,IAAM,oBAAoC,uBACxC,+EAA+E;AAGjF,IAAM,iBAAiC,uBACrC,8EAA8E;AAGhF,IAAM,iBAAiC,uBACrC,+EAA+E;AAGjF,IAAM,aAAa,CAAC,WAAmB,QAAQC,MAAK,MAAM;AAE1D,IAAM,WAA2B,uBAC/B,oEAAoE;AAEtE,IAAM,qBAAqB,CAAC,UAC1B,QAAQ,MAAM,GAAG,OAAO,gBAAgB,KAAK,IAAI,QAAQ;AAS3D,SAAS,0BAA0B,IAAU;AAC3C,QAAM,EAAE,EAAC,IAAK;AACd,QAAM,IAAI;AACV,QAAMC,OAAM,CAAC,MAAc,GAAG,OAAO,CAAC;AACtC,QAAM,IAAIA,KAAI,UAAU,KAAK,EAAE;AAC/B,QAAM,KAAKA,MAAK,IAAID,QAAO,cAAc;AACzC,MAAI,IAAI,OAAO,EAAE;AACjB,QAAM,IAAIC,MAAK,IAAI,IAAI,KAAKA,KAAI,IAAI,CAAC,CAAC;AACtC,MAAI,EAAE,SAAS,YAAY,OAAOC,GAAC,IAAK,QAAQ,IAAI,CAAC;AACrD,MAAI,KAAKD,KAAIC,KAAI,EAAE;AACnB,MAAI,CAAC,aAAa,IAAI,CAAC;AAAG,SAAKD,KAAI,CAAC,EAAE;AACtC,MAAI,CAAC;AAAY,IAAAC,KAAI;AACrB,MAAI,CAAC;AAAY,QAAI;AACrB,QAAM,KAAKD,KAAI,KAAK,IAAID,QAAO,iBAAiB,CAAC;AACjD,QAAMG,MAAKD,KAAIA;AACf,QAAM,KAAKD,MAAKC,KAAIA,MAAK,CAAC;AAC1B,QAAM,KAAKD,KAAI,KAAK,iBAAiB;AACrC,QAAM,KAAKA,KAAID,OAAMG,GAAE;AACvB,QAAM,KAAKF,KAAID,OAAMG,GAAE;AACvB,SAAO,IAAI,QAAQ,MAAMF,KAAI,KAAK,EAAE,GAAGA,KAAI,KAAK,EAAE,GAAGA,KAAI,KAAK,EAAE,GAAGA,KAAI,KAAK,EAAE,CAAC;AACjF;AAEA,SAAS,iBAAiB,OAAiB;AACzC,SAAO,OAAO,EAAE;AAChB,QAAM,KAAK,mBAAmB,MAAM,SAAS,GAAG,EAAE,CAAC;AACnD,QAAM,KAAK,0BAA0B,EAAE;AACvC,QAAM,KAAK,mBAAmB,MAAM,SAAS,IAAI,EAAE,CAAC;AACpD,QAAM,KAAK,0BAA0B,EAAE;AACvC,SAAO,IAAI,gBAAgB,GAAG,IAAI,EAAE,CAAC;AACvC;AAWA,IAAM,kBAAN,MAAM,yBAAwB,kBAAkC;EAgB9D,YAAY,IAAiB;AAC3B,UAAM,EAAE;EACV;EAEA,OAAO,WAAW,IAAuB;AACvC,WAAO,IAAI,iBAAgB,QAAQ,MAAM,WAAW,EAAE,CAAC;EACzD;EAEU,WAAW,OAAsB;AACzC,QAAI,EAAE,iBAAiB;AAAkB,YAAM,IAAI,MAAM,yBAAyB;EACpF;EAEU,KAAK,IAAgB;AAC7B,WAAO,IAAI,iBAAgB,EAAE;EAC/B;;EAGA,OAAO,YAAY,KAAQ;AACzB,WAAO,iBAAiB,YAAY,iBAAiB,KAAK,EAAE,CAAC;EAC/D;EAEA,OAAO,UAAU,OAAiB;AAChC,WAAO,OAAO,EAAE;AAChB,UAAM,EAAE,GAAG,EAAC,IAAK;AACjB,UAAM,IAAI;AACV,UAAMA,OAAM,CAAC,MAAc,GAAG,OAAO,CAAC;AACtC,UAAMC,KAAI,mBAAmB,KAAK;AAGlC,QAAI,CAAC,WAAW,GAAG,QAAQA,EAAC,GAAG,KAAK,KAAK,aAAaA,IAAG,CAAC;AACxD,YAAM,IAAI,MAAM,iCAAiC;AACnD,UAAMC,MAAKF,KAAIC,KAAIA,EAAC;AACpB,UAAM,KAAKD,KAAID,OAAM,IAAIG,GAAE;AAC3B,UAAM,KAAKF,KAAID,OAAM,IAAIG,GAAE;AAC3B,UAAM,OAAOF,KAAI,KAAK,EAAE;AACxB,UAAM,OAAOA,KAAI,KAAK,EAAE;AACxB,UAAM,IAAIA,KAAI,IAAI,IAAI,OAAO,IAAI;AACjC,UAAM,EAAE,SAAAG,UAAS,OAAO,EAAC,IAAK,WAAWH,KAAI,IAAI,IAAI,CAAC;AACtD,UAAM,KAAKA,KAAI,IAAI,EAAE;AACrB,UAAM,KAAKA,KAAI,IAAI,KAAK,CAAC;AACzB,QAAI,IAAIA,MAAKC,KAAIA,MAAK,EAAE;AACxB,QAAI,aAAa,GAAG,CAAC;AAAG,UAAID,KAAI,CAAC,CAAC;AAClC,UAAM,IAAIA,KAAI,KAAK,EAAE;AACrB,UAAM,IAAIA,KAAI,IAAI,CAAC;AACnB,QAAI,CAACG,YAAW,aAAa,GAAG,CAAC,KAAK,MAAMC;AAC1C,YAAM,IAAI,MAAM,iCAAiC;AACnD,WAAO,IAAI,iBAAgB,IAAI,QAAQ,MAAM,GAAG,GAAGL,MAAK,CAAC,CAAC;EAC5D;;;;;;EAOA,OAAO,QAAQ,KAAQ;AACrB,WAAO,iBAAgB,UAAU,YAAY,gBAAgB,KAAK,EAAE,CAAC;EACvE;EAEA,OAAO,IAAI,QAA2B,SAAiB;AACrD,WAAO,UAAU,kBAAiB,QAAQ,MAAM,IAAI,QAAQ,OAAO;EACrE;;;;;EAMA,UAAO;AACL,QAAI,EAAE,GAAG,GAAG,GAAG,EAAC,IAAK,KAAK;AAC1B,UAAM,IAAI;AACV,UAAMC,OAAM,CAAC,MAAc,GAAG,OAAO,CAAC;AACtC,UAAM,KAAKA,KAAIA,KAAI,IAAI,CAAC,IAAIA,KAAI,IAAI,CAAC,CAAC;AACtC,UAAM,KAAKA,KAAI,IAAI,CAAC;AAEpB,UAAM,OAAOA,KAAI,KAAK,EAAE;AACxB,UAAM,EAAE,OAAO,QAAO,IAAK,WAAWA,KAAI,KAAK,IAAI,CAAC;AACpD,UAAM,KAAKA,KAAI,UAAU,EAAE;AAC3B,UAAM,KAAKA,KAAI,UAAU,EAAE;AAC3B,UAAM,OAAOA,KAAI,KAAK,KAAK,CAAC;AAC5B,QAAI;AACJ,QAAI,aAAa,IAAI,MAAM,CAAC,GAAG;AAC7B,UAAI,KAAKA,KAAI,IAAI,OAAO;AACxB,UAAI,KAAKA,KAAI,IAAI,OAAO;AACxB,UAAI;AACJ,UAAI;AACJ,UAAIA,KAAI,KAAK,iBAAiB;IAChC,OAAO;AACL,UAAI;IACN;AACA,QAAI,aAAa,IAAI,MAAM,CAAC;AAAG,UAAIA,KAAI,CAAC,CAAC;AACzC,QAAIC,KAAID,MAAK,IAAI,KAAK,CAAC;AACvB,QAAI,aAAaC,IAAG,CAAC;AAAG,MAAAA,KAAID,KAAI,CAACC,EAAC;AAClC,WAAO,GAAG,QAAQA,EAAC;EACrB;;;;;EAMA,OAAO,OAAsB;AAC3B,SAAK,WAAW,KAAK;AACrB,UAAM,EAAE,GAAG,IAAI,GAAG,GAAE,IAAK,KAAK;AAC9B,UAAM,EAAE,GAAG,IAAI,GAAG,GAAE,IAAK,MAAM;AAC/B,UAAMD,OAAM,CAAC,MAAc,GAAG,OAAO,CAAC;AAEtC,UAAM,MAAMA,KAAI,KAAK,EAAE,MAAMA,KAAI,KAAK,EAAE;AACxC,UAAM,MAAMA,KAAI,KAAK,EAAE,MAAMA,KAAI,KAAK,EAAE;AACxC,WAAO,OAAO;EAChB;EAEA,MAAG;AACD,WAAO,KAAK,OAAO,iBAAgB,IAAI;EACzC;;AA3HO,gBAAA,OACY,uBAAM,IAAI,gBAAgB,QAAQ,MAAM,IAAI,GAAE;AAE1D,gBAAA,OACY,uBAAM,IAAI,gBAAgB,QAAQ,MAAM,IAAI,GAAE;AAE1D,gBAAA,KACY,uBAAM,IAAG;AAErB,gBAAA,KACY,uBAAM,IAAG;;;ACjXvB,IAAM,cAAc;AACpB,IAAM,cAAc;AACpB,IAAM,kBAAkB;AACxB,IAAM,UAAU;AAChB,IAAM,WAAW;AACjB,IAAM,4BAA4B;AAClC,IAAM,2BAA2B;AAEjC,IAAM,oBAAoB,IAAI,YAAW,EAAG,OAAO,iCAAiC;;;ACTrF,IAAO,cAAP,cAA2B,MAAK;EAEzB;EADX,YACW,MACT,SAAgB;AAEhB,UAAM,WAAW,IAAI;AAHZ,SAAA,OAAA;AAIT,SAAK,OAAO;EACd;;AAgBI,IAAO,iBAAP,cAA8B,MAAK;EAE5B;EAEA;EAHX,YACW,MACT,SACS,UAAgB;AAEzB,UAAM,WAAW,IAAI;AAJZ,SAAA,OAAA;AAEA,SAAA,WAAA;AAGT,SAAK,OAAO;EACd;;AAGI,IAAO,eAAP,cAA4B,MAAK;EAE1B;EADX,YACW,MACT,SAAgB;AAEhB,UAAM,WAAW,IAAI;AAHZ,SAAA,OAAA;AAIT,SAAK,OAAO;EACd;;AAGI,IAAO,iBAAP,cAA8B,MAAK;EAE5B;EADX,YACW,MACT,SAAgB;AAEhB,UAAM,WAAW,IAAI;AAHZ,SAAA,OAAA;AAIT,SAAK,OAAO;EACd;;;;ACzBF,SAAS,aAAa,WAA0C,WAAwC;AACtG,aAAW,KAAK,WAAW;AACzB,QAAI,EAAE,SAAS,2BAA2B;AACxC,YAAM,IAAI,MAAM,0CAA0C;IAC5D;EACF;AACA,aAAW,KAAK,WAAW;AACzB,QAAI,EAAE,SAAS,2BAA2B;AACxC,YAAM,IAAI,MAAM,0CAA0C;IAC5D;EACF;AACA,MAAI,UAAU,SAAS,4BAA4B,UAAU,SAAS,0BAA0B;AAC9F,UAAM,IAAI,MAAM,sCAAsC;EACxD;AACF;AAEA,SAAS,aAAa,GAAiB;AACrC,QAAM,IAAI,CAAC,QAAe,QAAG,KAAmB,QAAG;AACnD,SACE,EAAE,UAAU,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE,UAAU,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAE3E;AAEA,SAAS,YAAY,GAAiB;AACpC,QAAM,IAAI,CAAC,QACT,QAAG,KAAiB,QAAG,KAAiB,QAAG,KAAiB,QAAG;AACjE,SACE,EAAE,UAAU,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE,UAAU,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAE3E;AAEA,SAAS,qBAAqB,GAAiB;AAC7C,SACE,EAAE,UAAU,KAAK,CAAC,MAAM,EAAE;IAAQ;;EAAA,CAAW,KAC7C,EAAE,UAAU,KAAK,CAAC,MAAM,EAAE;IAAQ;;EAAA,CAAW;AAEjD;AAEM,SAAU,yBAAyB,UAAuC;AAC9E,aAAW,WAAW,UAAU;AAC9B,QAAI,WAAW;AACf,QAAI,gBAAgB;AACpB,eAAW,SAAS,SAAS;AAC3B,UAAI,UAAK,GAAiB;AACxB,YAAI;AAAe,gBAAM,IAAI,aAAa,uBAAuB;AACjE,YAAI;AAAU,gBAAM,IAAI,aAAa,uBAAuB;MAC9D,WAAW,UAAK,GAAiB;AAC/B,mBAAW;AACX,YAAI;AAAe,gBAAM,IAAI,aAAa,uBAAuB;MACnE,WAAW,UAAK,KAAgB,UAAK,GAAc;AACjD,wBAAgB;MAClB;IACF;EACF;AACF;AAEA,SAAS,gBAAgB,UAAuC;AAC9D,MAAI,UAAU;AACd,aAAW,WAAW,UAAU;AAC9B,eAAW,SAAS,SAAS;AAC3B,UAAI,UAAK,GAAgB;AACvB,kBAAU;MACZ,WAAW,UAAK,KAAgB,UAAK,GAAiB;AACpD;MACF,WAAW,UAAK,GAAiB;AAC/B,YAAI;AAAS,gBAAM,IAAI,aAAa,sBAAsB;AAC1D;MACF,WAAW,UAAK,GAAc;AAC5B,YAAI;AAAS,gBAAM,IAAI,aAAa,sBAAsB;MAC5D;IACF;EACF;AACF;AAEM,IAAO,mBAAP,MAAO,kBAAgB;EAQhB;EAPM;EACA;EACA;EACA;EACA;EAEjB,YACWK,OACT,cACA,cACA,WACA,WAAwC;AAJ/B,SAAA,OAAAA;AAMT,iBAAa,WAAW,SAAS;AACjC,SAAK,eAAe,CAAC,GAAG,YAAY;AACpC,SAAK,eAAe,CAAC,GAAG,YAAY;AACpC,SAAK,iBAAiB;MACpB,WAAW,UAAU,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;MACtC,WAAW,UAAU,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;;AAExC,UAAM,SAAS,aAAa,KAAK,cAAc;AAC/C,UAAM,QAAQ,YAAY,KAAK,cAAc;AAC7C,QAAI,UAAU,OAAO;AACnB,WAAK,SAAM;IACb,WAAW,QAAQ;AACjB,WAAK,SAAM;IACb,WAAW,OAAO;AAChB,WAAK,SAAM;IACb,OAAO;AACL,YAAM,IAAI,MAAM,2BAA2B;IAC7C;AACA,SAAK,aAAa,qBAAqB,KAAK,cAAc;AAC1D,QAAI,KAAK,YAAY;AACnB,sBAAgB,KAAK,eAAe,SAAS;AAC7C,sBAAgB,KAAK,eAAe,SAAS;IAC/C;AACA,QAAI,QAAQ;AACV,+BAAyB,KAAK,eAAe,SAAS;AACtD,+BAAyB,KAAK,eAAe,SAAS;IACxD;EACF;EAEA,oBAAiB;AACf,WAAO,KAAK;EACd;EAEA,yBAAsB;AACpB,WAAO,KAAK,eAAe,UAAU;EACvC;EAEA,yBAAsB;AACpB,WAAO,KAAK,eAAe,UAAU;EACvC;EAEA,wBAAqB;AACnB,WAAO,KAAK;EACd;EAEA,wBAAqB;AACnB,WAAO,KAAK;EACd;EAEA,oBAAoB,GAAS;AAC3B,WAAO,KAAK,eAAe,UAAU,CAAC,KAAK,CAAA;EAC7C;EAEA,oBAAoB,GAAS;AAC3B,WAAO,KAAK,eAAe,UAAU,CAAC,KAAK,CAAA;EAC7C;EAEA,SAAM;AACJ,WAAO,KAAK;EACd;EAEA,UAAO;AACL,WAAO,KAAK;EACd;EAEA,WAAQ;AACN,WAAO,KAAK,eAAe,UAAU,WAAW;EAClD;EAEA,UAAO;AACL,WAAO,KAAK;EACd;EAEA,QAAQ,WAA8B,SAAe;AACnD,UAAM,YAAY,KAAK,eAAe,UAAU,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACjE,UAAM,YAAY,KAAK,eAAe,UAAU,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACjE,eAAW,OAAO,WAAW;AAC3B,UAAI,QAAQ,GAAG;AACb,SAAC,UAAU,CAAC,MAAM,CAAA,GAAI;UAAO;;QAAA;MAC/B,WAAW,MAAM,MAAM,GAAG;AACxB,cAAM,IAAI,MAAM,IAAI;AACpB,SAAC,UAAU,CAAC,MAAM,CAAA,GAAI;UAAI;;QAAA;MAC5B,OAAO;AACL,cAAM,MAAM,MAAM,KAAK;AACvB,SAAC,UAAU,EAAE,MAAM,CAAA,GAAI;UAAI;;QAAA;MAC7B;IACF;AACA,WAAO,IAAI,kBAAiB,SAAS,KAAK,cAAc,KAAK,cAAc,WAAW,SAAS;EACjG;;;;ACvMF,IAAM,UAAU;AAGV,IAAO,cAAP,MAAkB;EAMH;EALX;EACA,IAAI;EACJ,aAAa;EAErB,YACmB,GACjB,GACA,YAAkB;AAFD,SAAA,IAAA;AAIjB,SAAK,MAAM,WAAW,KAAK,CAAC;AAC5B,SAAK,IAAI;EACX;EAEA,WAAQ;AACN,WAAO,KAAK;EACd;EAEA,SAAS,GAAS;AAChB,SAAK,IAAI;EACX;;;;;;EAOA,SAAM;AACJ,WAAO,WAAW,KAAK,KAAK,GAAG;EACjC;EAEA,cAAc,IAAgB,WAAuB,KAAe;AAClE,QAAI,KAAK;AAAY,YAAM,IAAI,YAAY,eAAe;AAC1D,SAAK,EAAE,QAAQ,KAAK,KAAK,KAAK,GAAG,IAAI,WAAW,GAAG;AACnD,SAAK,UAAS;EAChB;EAEA,qBAAqB,IAAgB,OAAmB,cAAoB;AAC1E,QAAI,KAAK;AAAY,YAAM,IAAI,YAAY,eAAe;AAC1D,UAAM,MAAM,KAAK,EAAE,eAAe,KAAK,KAAK,KAAK,GAAG,IAAI,OAAO,YAAY;AAC3E,SAAK,UAAS;AACd,WAAO;EACT;EAEA,cAAc,IAAgB,YAAwB,KAAe;AACnE,QAAI,KAAK;AAAY,YAAM,IAAI,YAAY,eAAe;AAC1D,SAAK,EAAE,QAAQ,KAAK,KAAK,KAAK,GAAG,IAAI,YAAY,GAAG;AACpD,SAAK,UAAS;EAChB;EAEA,qBACE,IACA,OACA,eAAqB;AAErB,QAAI,KAAK;AAAY,YAAM,IAAI,YAAY,eAAe;AAC1D,UAAM,MAAM,KAAK,EAAE,eAAe,KAAK,KAAK,KAAK,GAAG,IAAI,OAAO,aAAa;AAC5E,SAAK,UAAS;AACd,WAAO;EACT;EAEA,QAAK;AACH,SAAK,IAAI,IAAI,KAAK,EAAE,MAAM,KAAK,GAAG,CAAC;EACrC;EAEQ,YAAS;AACf,QAAI,KAAK,MAAM,SAAS;AACtB,WAAK,aAAa;AAClB;IACF;AACA,SAAK,KAAK;EACZ;;AAGI,IAAO,eAAP,MAAmB;EAEZ;EACA;EAFX,YACW,sBACA,sBAAiC;AADjC,SAAA,uBAAA;AACA,SAAA,uBAAA;EACR;;;;AC/EL,SAAS,gBAAgB,MAAkB,GAAa;AACtD,SAAO,KAAK,MAAM,GAAG,EAAE,MAAM;AAC/B;AAEM,IAAO,iBAAP,MAAqB;EAMN;EACA;EANX;EACA;EACA;EAER,YACmB,GACA,GACjB,kBAAwB;AAFP,SAAA,IAAA;AACA,SAAA,IAAA;AAGjB,UAAM,KAAK,IAAI,YAAW,EAAG,OAAO,gBAAgB;AACpD,SAAK,IAAI,EAAE,UAAS;AACpB,SAAK,KAAK,EAAE,UAAS;AACrB,SAAK,EAAE,KAAK,CAAC;AACb,QAAI,GAAG,UAAU,EAAE,SAAS;AAC1B,WAAK,EAAE,IAAI,IAAI,CAAC;IAClB,OAAO;AACL,WAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,SAAS,GAAG,EAAE,OAAO,CAAC;IAC9C;AACA,SAAK,GAAG,IAAI,KAAK,CAAC;EACpB;EAEA,QAAQ,MAAgB;AACtB,SAAK,EAAE,IAAI,KAAK,EAAE,KAAK,OAAO,KAAK,GAAG,IAAI,CAAC,EAAE,SAAS,GAAG,KAAK,EAAE,OAAO,CAAC;EAC1E;EAEA,OAAO,kBAA4B;AACjC,UAAM,CAAC,IAAI,IAAI,IAAI,KAAK,EAAE,KAAK,KAAK,IAAI,gBAAgB;AACxD,SAAK,GAAG,IAAI,GAAG,SAAS,GAAG,KAAK,EAAE,OAAO,CAAC;AAC1C,UAAM,IAAI,gBAAgB,MAAM,KAAK,CAAC;AACtC,SAAK,cAAc,IAAI,YAAY,KAAK,GAAG,GAAG,EAAE;EAClD;EAEA,cAAc,kBAA4B;AACxC,UAAM,CAAC,IAAI,OAAO,KAAK,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,gBAAgB;AACjE,SAAK,GAAG,IAAI,GAAG,SAAS,GAAG,KAAK,EAAE,OAAO,CAAC;AAC1C,SAAK,QAAQ,KAAK;AAClB,UAAM,IAAI,gBAAgB,OAAO,KAAK,CAAC;AACvC,SAAK,cAAc,IAAI,YAAY,KAAK,GAAG,GAAG,EAAE;EAClD;EAEA,eAAe,WAAuB,KAAe;AACnD,QAAI,KAAK,aAAa;AACpB,WAAK,YAAY,cAAc,KAAK,GAAG,WAAW,GAAG;IACvD,OAAO;AACL,UAAI,IAAI,SAAS;IACnB;AACA,SAAK,QAAQ,GAAG;EAClB;EAEA,eAAe,MAAkB,KAAe;AAC9C,QAAI,KAAK,aAAa;AACpB,WAAK,YAAY,cAAc,KAAK,GAAG,MAAM,GAAG;IAClD,OAAO;AACL,UAAI,IAAI,IAAI;IACd;AACA,SAAK,QAAQ,IAAI;EACnB;EAEA,QAAK;AACH,QAAI,CAAC,KAAK,OAAM,GAAI;AAClB,YAAM,IAAI,YAAY,oBAAoB;IAC5C;AACA,UAAM,CAAC,IAAI,EAAE,IAAI,KAAK,EAAE,KAAK,KAAK,IAAI,IAAI,WAAW,CAAC,CAAC;AACvD,UAAM,KAAK,gBAAgB,IAAI,KAAK,CAAC;AACrC,UAAM,KAAK,gBAAgB,IAAI,KAAK,CAAC;AACrC,WAAO,IAAI,aACT,IAAI,YAAY,KAAK,GAAG,IAAI,EAAE,GAC9B,IAAI,YAAY,KAAK,GAAG,IAAI,EAAE,CAAC;EAEnC;EAEA,UAAO;AACL,WAAO,WAAW,KAAK,KAAK,CAAC;EAC/B;EAEA,iBAAc;AACZ,WAAO,WAAW,KAAK,KAAK,EAAE;EAChC;EAEA,SAAM;AACJ,WAAO,KAAK,gBAAgB;EAC9B;EAEA,UAAO;AACL,SAAK,EAAE,KAAK,CAAC;AACb,SAAK,GAAG,KAAK,CAAC;AACd,SAAK,cAAc;EACrB;;AAGF,SAAS,OAAO,GAAe,GAAa;AAC1C,QAAM,IAAI,IAAI,WAAW,EAAE,SAAS,EAAE,MAAM;AAC5C,IAAE,IAAI,GAAG,CAAC;AACV,IAAE,IAAI,GAAG,EAAE,MAAM;AACjB,SAAO;AACT;;;AC5FA,SAAS,UAAU,GAAU;AAC3B,MAAI,aAAa;AAAgB,WAAO;AACxC,MAAI,aAAa,aAAa;AAC5B,WAAO,IAAI,eAAe,UAAU,EAAE,OAAO;EAC/C;AACA,QAAM;AACR;AAKM,IAAO,iBAAP,MAAqB;EACR;EACA;EACA;EACA;EACA;EAEjB,YAAY,GAAkB;AAC5B,SAAK,UAAU,EAAE;AACjB,SAAK,eAAe,EAAE;AACtB,SAAK,IAAI,EAAE;AACX,SAAK,YAAY,EAAE;AACnB,SAAK,SAAS,EAAE;EAClB;EAEA,mBAAgB;AACd,WAAO,KAAK;EACd;;EAGA,wBAAqB;AACnB,WAAO,KAAK;EACd;EAEA,KAAK,KAAiB,KAAe;AACnC,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,IAAI,SAAS;AACvB,QAAI,IAAI,iBAAiB;AACvB,YAAM,IAAI,MAAM,uCAAuC;IACzD;AACA,QAAI,IAAI,SAAS,GAAG;AAClB,YAAM,IAAI,eAAe,gBAAgB;IAC3C;AACA,QAAI,KAAK,QAAQ,SAAQ,KAAM,CAAC,KAAK,WAAW;AAC9C,YAAM,IAAI,eAAe,iBAAiB;IAC5C;AACA,UAAM,IAAI,KAAK,UAAS;AACxB,QAAI;AACF,QAAE,cAAc,IAAI,WAAW,CAAC,GAAG,KAAK,IAAI,SAAS,GAAG,CAAC,CAAC;IAC5D,SAAS,GAAG;AACV,YAAM,UAAU,CAAC;IACnB;AACA,WAAO;EACT;EAEA,YAAY,KAAiB,QAAc;AACzC,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,SAAS;AACnB,QAAI,IAAI,iBAAiB;AACvB,YAAM,IAAI,MAAM,uCAAuC;IACzD;AACA,QAAI,IAAI,SAAS,GAAG;AAClB,YAAM,IAAI,eAAe,gBAAgB;IAC3C;AACA,QAAI,KAAK,QAAQ,SAAQ,KAAM,CAAC,KAAK,WAAW;AAC9C,YAAM,IAAI,eAAe,iBAAiB;IAC5C;AACA,UAAM,IAAI,KAAK,UAAS;AACxB,QAAI;AACF,aAAO,EAAE,qBAAqB,IAAI,WAAW,CAAC,GAAG,KAAK,MAAM;IAC9D,SAAS,GAAG;AACV,YAAM,UAAU,CAAC;IACnB;EACF;EAEA,QAAQ,KAAe;AACrB,UAAM,IAAI,KAAK;AACf,UAAM,MAAM,IAAI,WAAW,IAAI,SAAS,CAAC;AACzC,SAAK,KAAK,KAAK,GAAG;AAClB,WAAO;EACT;EAEA,QAAQ,KAAiB,KAAe;AACtC,UAAM,IAAI,KAAK;AACf,QAAI,IAAI,SAAS,GAAG;AAClB,YAAM,IAAI,eAAe,UAAU;IACrC;AACA,QAAI,IAAI,SAAS,iBAAiB;AAChC,YAAM,IAAI,MAAM,uCAAuC;IACzD;AACA,QAAI,KAAK,QAAQ,SAAQ,KAAM,KAAK,WAAW;AAC7C,YAAM,IAAI,eAAe,iBAAiB;IAC5C;AACA,UAAM,IAAI,KAAK,SAAQ;AACvB,UAAM,OAAO,IAAI,SAAS;AAC1B,QAAI,IAAI,SAAS,MAAM;AACrB,YAAM,IAAI,eAAe,gBAAgB;IAC3C;AACA,QAAI;AACF,QAAE,cAAc,IAAI,WAAW,CAAC,GAAG,KAAK,IAAI,SAAS,GAAG,IAAI,CAAC;IAC/D,SAAS,GAAG;AACV,YAAM,UAAU,CAAC;IACnB;AACA,WAAO;EACT;EAEA,eAAe,KAAiB,QAAc;AAC5C,UAAM,IAAI,KAAK;AACf,QAAI,SAAS,GAAG;AACd,YAAM,IAAI,eAAe,UAAU;IACrC;AACA,QAAI,SAAS,iBAAiB;AAC5B,YAAM,IAAI,MAAM,uCAAuC;IACzD;AACA,QAAI,SAAS,IAAI,QAAQ;AACvB,YAAM,IAAI,eAAe,gBAAgB;IAC3C;AACA,QAAI,KAAK,QAAQ,SAAQ,KAAM,KAAK,WAAW;AAC7C,YAAM,IAAI,eAAe,iBAAiB;IAC5C;AACA,UAAM,IAAI,KAAK,SAAQ;AACvB,QAAI;AACF,aAAO,EAAE,qBAAqB,IAAI,WAAW,CAAC,GAAG,KAAK,MAAM;IAC9D,SAAS,GAAG;AACV,YAAM,UAAU,CAAC;IACnB;EACF;EAEA,WAAW,KAAe;AACxB,UAAM,IAAI,KAAK;AACf,UAAM,MAAM,IAAI,WAAW,IAAI,SAAS,CAAC;AACzC,SAAK,QAAQ,KAAK,GAAG;AACrB,WAAO;EACT;EAEA,eAAY;AACV,WAAO,KAAK,UAAS,EAAG,SAAQ;EAClC;EAEA,iBAAc;AACZ,WAAO,KAAK,SAAQ,EAAG,SAAQ;EACjC;EAEA,kBAAkB,GAAS;AACzB,SAAK,SAAQ,EAAG,SAAS,CAAC;EAC5B;EAEA,cAAW;AACT,QAAI;AACF,WAAK,UAAS,EAAG,MAAK;IACxB,SAAS,GAAG;AACV,YAAM,UAAU,CAAC;IACnB;EACF;EAEA,gBAAa;AACX,QAAI;AACF,WAAK,SAAQ,EAAG,MAAK;IACvB,SAAS,GAAG;AACV,YAAM,UAAU,CAAC;IACnB;EACF;;;;;EAMA,cAAW;AACT,WAAO,KAAK;EACd;EAEQ,YAAS;AACf,WAAO,KAAK,YACR,KAAK,aAAa,uBAClB,KAAK,aAAa;EACxB;EAEQ,WAAQ;AACd,WAAO,KAAK,YACR,KAAK,aAAa,uBAClB,KAAK,aAAa;EACxB;;;;ACnMF,IAAMC,cAA8B,uBAAM,OAAO,KAAK,KAAK,CAAC,GAAG;AAC/D,IAAMC,QAAuB,uBAAO,EAAE;AAGtC,SAASC,SAAQ,GAAG,KAAK,OAAO;AAC5B,MAAI;AACA,WAAO,EAAE,GAAG,OAAO,IAAIF,WAAU,GAAG,GAAG,OAAQ,KAAKC,QAAQD,WAAU,EAAE;AAC5E,SAAO,EAAE,GAAG,OAAQ,KAAKC,QAAQD,WAAU,IAAI,GAAG,GAAG,OAAO,IAAIA,WAAU,IAAI,EAAE;AACpF;AAGA,SAASG,OAAM,KAAK,KAAK,OAAO;AAC5B,QAAM,MAAM,IAAI;AAChB,MAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,MAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,UAAM,EAAE,GAAG,EAAE,IAAID,SAAQ,IAAI,CAAC,GAAG,EAAE;AACnC,KAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;AAAA,EAC1B;AACA,SAAO,CAAC,IAAI,EAAE;AAClB;AAOA,IAAM,WAAW,CAAC,MAAO,IAAI,KAAK,KAAM;AACxC,IAAM,WAAW,CAAC,MAAM,MAAM;AAG9B,SAAS,cAAc,MAAM,YAAY,GAAGE,OAAM;AAC9C,QAAM,IAAI,SAAS,CAAC;AACpB,QAAM,IAAI,SAAS,CAAC;AACpB,OAAK,UAAU,YAAYA,QAAO,IAAI,GAAGA,KAAI;AAC7C,OAAK,UAAU,aAAa,GAAGA,QAAO,IAAI,GAAGA,KAAI;AACrD;AAEA,IAAMC,SAAQ,CAAC,GAAG,IAAIC,OAAM,MAAMA;AAElC,IAAMC,SAAQ,CAAC,GAAG,GAAGD,OAAO,KAAM,KAAKA,KAAO,MAAMA;AAEpD,IAAME,UAAS,CAAC,GAAG,GAAGF,OAAO,MAAMA,KAAM,KAAM,KAAKA;AAEpD,IAAMG,UAAS,CAAC,GAAG,GAAGH,OAAO,KAAM,KAAKA,KAAO,MAAMA;AAErD,IAAMI,UAAS,CAAC,GAAG,GAAGJ,OAAO,KAAM,KAAKA,KAAO,MAAOA,KAAI;AAE1D,IAAMK,UAAS,CAAC,GAAG,GAAGL,OAAO,MAAOA,KAAI,KAAQ,KAAM,KAAKA;AAE3D,IAAM,UAAU,CAAC,IAAI,MAAM;AAE3B,IAAM,UAAU,CAAC,GAAG,OAAO;AAM3B,SAASM,KAAI,IAAI,IAAI,IAAI,IAAI;AACzB,QAAM,KAAK,OAAO,MAAM,OAAO;AAC/B,SAAO,EAAE,GAAI,KAAK,MAAO,IAAI,KAAK,KAAM,KAAM,GAAG,GAAG,IAAI,EAAE;AAC9D;AAGA,IAAMC,SAAQ,CAAC,IAAI,IAAI,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO;AAEhE,IAAMC,SAAQ,CAAC,KAAK,IAAI,IAAI,OAAQ,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAE5E,IAAMC,SAAQ,CAAC,IAAI,IAAI,IAAI,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAEjF,IAAMC,SAAQ,CAAC,KAAK,IAAI,IAAI,IAAI,OAAQ,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAErF,IAAMC,SAAQ,CAAC,IAAI,IAAI,IAAI,IAAI,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAElG,IAAMC,SAAQ,CAAC,KAAK,IAAI,IAAI,IAAI,IAAI,OAAQ,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;AChEvF,SAASC,SAAQ,GAAG;AAKvB,SAAQ,aAAa,cAChB,YAAY,OAAO,CAAC,KACjB,EAAE,YAAY,SAAS,gBACvB,uBAAuB,KACvB,EAAE,sBAAsB;AACpC;AAGA,IAAM,SAAS,CAAC,UAAW,QAAQ,IAAI,KAAK,OAAO;AAc5C,SAASC,SAAQ,GAAG,QAAQ,IAAI;AACnC,MAAI,OAAO,MAAM;AACb,UAAM,IAAI,UAAU,OAAO,KAAK,IAAI,0BAA0B,OAAO,CAAC;AAC1E,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAChC,UAAM,IAAI,WAAW,OAAO,KAAK,IAAI,gCAAgC,CAAC;AAC1E,SAAO;AACX;AAgCO,SAASC,QAAO,OAAO,QAAQ,QAAQ,IAAI;AAG9C,MAAIC,SAAQ,KAAK,MAAM,WAAW,UAAa,MAAM,WAAW;AAC5D,WAAO;AAEX,MAAI,WAAW;AACX,IAAAC,SAAQ,QAAQ,QAAQ;AAC5B,QAAM,QAAQD,SAAQ,KAAK;AAC3B,QAAM,QAAQ,WAAW,SAAY,cAAc,MAAM,KAAK;AAC9D,QAAM,MAAM,QAAQ,UAAU,MAAM,MAAM,KAAK,QAAQ,OAAO,KAAK;AACnE,QAAM,UAAU,OAAO,KAAK,IAAI,wBAAwB,QAAQ,WAAW;AAC3E,MAAI,CAAC;AACD,UAAM,IAAI,UAAU,OAAO;AAC/B,QAAM,IAAI,WAAW,OAAO;AAChC;AAaO,SAASE,WAAU,OAAO;AAG7B,SAAO,WAAW,KAAKH,QAAO,KAAK,CAAC;AACxC;AAeO,SAAS,MAAM,GAAG;AACrB,MAAI,OAAO,MAAM,cAAc,OAAO,EAAE,WAAW;AAC/C,UAAM,IAAI,UAAU,6CAA6C;AACrE,EAAAE,SAAQ,EAAE,SAAS;AACnB,EAAAA,SAAQ,EAAE,QAAQ;AAGlB,MAAI,EAAE,YAAY,KAAK,EAAE,WAAW;AAChC,UAAM,IAAI,MAAM,wCAAwC;AAChE;AACA,IAAM,UAAU,CAAC,OAAO,UAAU;AAC9B,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK;AAClE,UAAM,IAAI,WAAW,UAAU,WAAW,KAAK,IAAI,KAAK,QAAQ,+BAA+B,OAAO,KAAK;AACnH;AAeO,SAASE,SAAQ,UAAU,gBAAgB,MAAM;AAGpD,MAAI,SAAS;AACT,UAAM,IAAI,MAAM,oBAAoB;AACxC,MAAI,iBAAiB,SAAS;AAC1B,UAAM,IAAI,MAAM,6BAA6B;AACrD;AAiBO,SAASC,SAAQ,KAAK,UAAU;AACnC,EAAAL,QAAO,KAAK,QAAW,QAAQ;AAG/B,QAAM,MAAM,SAAS;AACrB,MAAI,EAAE,IAAI,UAAU,MAAM;AACtB,UAAM,IAAI,WAAW,iCAAiC,GAAG;AAAA,EAC7D;AACJ;AA0BO,SAAS,IAAI,KAAK;AACrB,SAAO,IAAI,YAAY,IAAI,QAAQ,IAAI,YAAY,KAAK,MAAM,IAAI,aAAa,CAAC,CAAC;AACrF;AAUO,SAASM,UAAS,QAAQ;AAC7B,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,WAAO,CAAC,EAAE,KAAK,CAAC;AAAA,EACpB;AACJ;AAWO,SAASC,YAAW,KAAK;AAC5B,SAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AAClE;AAYO,SAASC,MAAK,MAAM,OAAO;AAC9B,SAAQ,QAAS,KAAK,QAAW,SAAS;AAC9C;AAgBO,IAAM,OAAwB,uBAAM,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM,IAAM;AAWtG,SAAS,SAAS,MAAM;AAC3B,SAAU,QAAQ,KAAM,aAClB,QAAQ,IAAK,WACb,SAAS,IAAK,QACd,SAAS,KAAM;AACzB;AAWO,IAAM,YAAY,OACnB,CAAC,MAAM,IACP,CAAC,MAAM,SAAS,CAAC,MAAM;AAWtB,SAAS,WAAW,KAAK;AAC5B,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,QAAI,CAAC,IAAI,SAAS,IAAI,CAAC,CAAC;AAAA,EAC5B;AACA,SAAO;AACX;AAYO,IAAM,aAAa,OACpB,CAAC,MAAM,IACP;AAEN,IAAMC,iBAAiC;AAAA;AAAA,EAEvC,OAAO,WAAW,KAAK,CAAC,CAAC,EAAE,UAAU,cAAc,OAAO,WAAW,YAAY;AAAA,GAAY;AAE7F,IAAMC,SAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAI,GAAG,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAc5F,SAASC,YAAW,OAAO;AAC9B,EAAAC,QAAO,KAAK;AAEZ,MAAIH;AACA,WAAO,MAAM,MAAM;AAEvB,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,WAAOC,OAAM,MAAM,CAAC,CAAC;AAAA,EACzB;AACA,SAAO;AACX;AAIA,SAASG,eAAc,IAAI;AACvB,SAAO,MAAM,MAAM,MAAM,KAAK,KAAK,KAC7B,MAAM,MAAM,MAAM,KAAK,MAAM,KAAK,MAC9B,MAAM,MAAM,MAAM,MAAM,MAAM,KAAK,MAC/B;AAClB;AAaO,SAASC,YAAW,KAAK;AAC5B,MAAI,OAAO,QAAQ;AACf,UAAM,IAAI,UAAU,8BAA8B,OAAO,GAAG;AAChE,MAAIL,gBAAe;AACf,QAAI;AACA,aAAO,WAAW,QAAQ,GAAG;AAAA,IACjC,SACO,OAAO;AACV,UAAI,iBAAiB;AACjB,cAAM,IAAI,WAAW,MAAM,OAAO;AACtC,YAAM;AAAA,IACV;AAAA,EACJ;AACA,QAAM,KAAK,IAAI;AACf,QAAM,KAAK,KAAK;AAChB,MAAI,KAAK;AACL,UAAM,IAAI,WAAW,qDAAqD,EAAE;AAChF,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,WAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAC7C,UAAM,KAAKI,eAAc,IAAI,WAAW,EAAE,CAAC;AAC3C,UAAM,KAAKA,eAAc,IAAI,WAAW,KAAK,CAAC,CAAC;AAC/C,QAAI,OAAO,UAAa,OAAO,QAAW;AACtC,YAAM,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AACjC,YAAM,IAAI,WAAW,iDAAiD,OAAO,gBAAgB,EAAE;AAAA,IACnG;AACA,UAAM,EAAE,IAAI,KAAK,KAAK;AAAA,EAC1B;AACA,SAAO;AACX;AA2FO,SAASE,gBAAe,QAAQ;AACnC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,UAAM,IAAI,OAAO,CAAC;AAClB,IAAAC,QAAO,CAAC;AACR,WAAO,EAAE;AAAA,EACb;AACA,QAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,WAAS,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC7C,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,IAAI,GAAG,GAAG;AACd,WAAO,EAAE;AAAA,EACb;AACA,SAAO;AACX;AAsDO,SAAS,UAAU,UAAU,MAAM,QAAQ,QAAQ;AACtD,UAAQ,UAAU,UAAU;AAC5B,MAAI,SAAS;AACT,YAAQ,MAAM,KAAK;AACvB,QAAM,SAAS,OAAO,OAAO,UAAU,IAAI;AAC3C,SAAO;AACX;AAmBO,SAASC,cAAa,UAAU,OAAO,CAAC,GAAG;AAC9C,MAAI,OAAO,aAAa;AACpB,UAAM,IAAI,UAAU,4CAA4C,OAAO,QAAQ;AACnF,SAAO,UAAU,CAAC,GAAG,MAAM,MAAM;AACjC,QAAM,QAAQ,CAAC,KAAK,SAAS,SAAS,IAAI,EACrC,OAAO,GAAG,EACV,OAAO;AACZ,QAAM,MAAM,SAAS,MAAS;AAC9B,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,IAAI;AACnB,QAAM,SAAS,CAAC,SAAS,SAAS,IAAI;AACtC,SAAO,OAAO,OAAO,IAAI;AACzB,SAAO,OAAO,OAAO,KAAK;AAC9B;AAiBO,SAASC,aAAY,cAAc,IAAI;AAE1C,EAAAC,SAAQ,aAAa,aAAa;AAClC,QAAM,KAAK,OAAO,eAAe,WAAW,WAAW,SAAS;AAChE,MAAI,OAAO,IAAI,oBAAoB;AAC/B,UAAM,IAAI,MAAM,wCAAwC;AAM5D,MAAI,cAAc;AACd,UAAM,IAAI,WAAW,wCAAwC,WAAW,EAAE;AAC9E,SAAO,GAAG,gBAAgB,IAAI,WAAW,WAAW,CAAC;AACzD;AAaO,IAAM,UAAU,CAAC,YAAY;AAAA;AAAA;AAAA,EAGhC,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;AAC7F;;;ACxnBO,SAASC,KAAI,GAAG,GAAG,GAAG;AACzB,SAAQ,IAAI,IAAM,CAAC,IAAI;AAC3B;AAcO,SAASC,KAAI,GAAG,GAAG,GAAG;AACzB,SAAQ,IAAI,IAAM,IAAI,IAAM,IAAI;AACpC;AAmBO,IAAMC,UAAN,MAAa;AAAA,EAChB;AAAA,EACA;AAAA,EACA,SAAS;AAAA,EACT;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA,WAAW;AAAA,EACX,SAAS;AAAA,EACT,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,YAAY,UAAU,WAAW,WAAWC,OAAM;AAC9C,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,YAAY;AACjB,SAAK,OAAOA;AACZ,SAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,SAAK,OAAOC,YAAW,KAAK,MAAM;AAAA,EACtC;AAAA,EACA,OAAO,MAAM;AACT,IAAAC,SAAQ,IAAI;AACZ,IAAAC,QAAO,IAAI;AACX,UAAM,EAAE,MAAM,QAAQ,SAAS,IAAI;AACnC,UAAM,MAAM,KAAK;AACjB,QAAI,YAAY;AAChB,aAAS,MAAM,GAAG,MAAM,OAAM;AAC1B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAGpD,UAAI,SAAS,UAAU;AACnB,cAAM,WAAWF,YAAW,IAAI;AAChC,eAAO,YAAY,MAAM,KAAK,OAAO;AACjC,eAAK,QAAQ,UAAU,GAAG;AAC9B,oBAAY;AACZ;AAAA,MACJ;AAGA,aAAO,IAAI,QAAQ,KAAK,SAAS,MAAM,OAAO,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACtF,WAAK,OAAO;AACZ,aAAO;AACP,UAAI,KAAK,QAAQ,UAAU;AACvB,aAAK,QAAQ,MAAM,CAAC;AACpB,aAAK,MAAM;AACX,oBAAY;AAAA,MAChB;AAAA,IACJ;AACA,SAAK,UAAU,KAAK;AAGpB,QAAI;AACA,WAAK,WAAW;AACpB,WAAO;AAAA,EACX;AAAA,EACA,WAAW,KAAK;AACZ,IAAAC,SAAQ,IAAI;AACZ,IAAAE,SAAQ,KAAK,IAAI;AACjB,SAAK,WAAW;AAIhB,UAAM,EAAE,QAAQ,MAAM,UAAU,MAAAJ,MAAK,IAAI;AACzC,QAAI,EAAE,IAAI,IAAI;AAEd,WAAO,KAAK,IAAI;AAChB,WAAO,KAAK,GAAG,GAAG;AAGlB,QAAI,KAAK,YAAY,WAAW,KAAK;AACjC,WAAK,QAAQ,MAAM,CAAC;AACpB,aAAO,KAAK,CAAC;AAAA,IACjB;AAKA,kBAAc,MAAM,WAAW,GAAG,KAAK,SAAS,GAAGA,KAAI;AACvD,SAAK,QAAQ,MAAM,CAAC;AAGpB,SAAK,WAAW;AAEhB,UAAM,QAAQ,QAAQ,SAAS,OAAOC,YAAW,GAAG;AACpD,UAAM,MAAM,KAAK;AAEjB,UAAM,SAAS,MAAM;AACrB,UAAM,QAAQ,KAAK,IAAI;AAEvB,QAAI,MAAM,KAAK,SAAS,MAAM;AAC1B,YAAM,IAAI,MAAM,mBAAmB;AACvC,aAAS,IAAI,GAAG,IAAI,QAAQ;AACxB,YAAM,UAAU,IAAI,GAAG,MAAM,CAAC,GAAGD,KAAI;AAAA,EAC7C;AAAA,EACA,SAAS;AACL,UAAM,EAAE,QAAQ,UAAU,IAAI;AAC9B,SAAK,WAAW,MAAM;AAGtB,UAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAQ;AACb,WAAO;AAAA,EACX;AAAA,EACA,eAAe,IAAI;AACf,UAAM,EAAE,QAAQ,QAAQ,UAAU,WAAW,IAAI,IAAI;AACrD,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,SAAS;AACZ,OAAG,MAAM;AAGT,QAAI;AACA,SAAG,OAAO,IAAI,MAAM;AACxB,WAAO;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,WAAW;AAAA,EAC3B;AACJ;AAQO,IAAMK,aAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC;AAkBM,IAAMC,aAA4B,4BAAY,KAAK;AAAA,EACtD;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;;;ACjMD,IAAM,WAA2B,4BAAY,KAAK;AAAA,EAC9C;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;AAED,IAAM,WAA2B,oBAAI,YAAY,EAAE;AAEnD,IAAM,WAAN,cAAuBC,QAAO;AAAA;AAAA;AAAA;AAAA;AAAA,EAK1B,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,YAAY,WAAW,IAAI;AACvB,UAAM,IAAI,WAAW,GAAG,KAAK;AAC7B,SAAK,IAAI,GAAG,CAAC,IAAI;AACjB,SAAK,IAAI,GAAG,CAAC,IAAI;AACjB,SAAK,IAAI,GAAG,CAAC,IAAI;AACjB,SAAK,IAAI,GAAG,CAAC,IAAI;AACjB,SAAK,IAAI,GAAG,CAAC,IAAI;AACjB,SAAK,IAAI,GAAG,CAAC,IAAI;AACjB,SAAK,IAAI,GAAG,CAAC,IAAI;AACjB,SAAK,IAAI,GAAG,CAAC,IAAI;AAAA,EACrB;AAAA,EACA,MAAM;AACF,UAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,IAAI;AACnC,WAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EAClC;AAAA;AAAA,EAEA,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACxB,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AAAA,EACjB;AAAA,EACA,WAAW,IAAI;AACX,KAAC,OAAO,IAAI,KAAK,YAAY,GAAG,IAAI,GAAG,KAAK,IAAI,CAAC;AACjD,WAAO,KAAK,eAAe,EAAE;AAAA,EACjC;AAAA,EACA,QAAQ,MAAM,QAAQ;AAElB,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,UAAU;AACnC,eAAS,CAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AAC9C,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC1B,YAAM,MAAM,SAAS,IAAI,EAAE;AAC3B,YAAM,KAAK,SAAS,IAAI,CAAC;AACzB,YAAM,KAAKC,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,YAAM,KAAKA,MAAK,IAAI,EAAE,IAAIA,MAAK,IAAI,EAAE,IAAK,OAAO;AACjD,eAAS,CAAC,IAAK,KAAK,SAAS,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,IAAK;AAAA,IACnE;AAEA,QAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,IAAI;AACjC,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,YAAM,SAASA,MAAK,GAAG,CAAC,IAAIA,MAAK,GAAG,EAAE,IAAIA,MAAK,GAAG,EAAE;AACpD,YAAM,KAAM,IAAI,SAASC,KAAI,GAAG,GAAG,CAAC,IAAI,SAAS,CAAC,IAAI,SAAS,CAAC,IAAK;AACrE,YAAM,SAASD,MAAK,GAAG,CAAC,IAAIA,MAAK,GAAG,EAAE,IAAIA,MAAK,GAAG,EAAE;AACpD,YAAM,KAAM,SAASE,KAAI,GAAG,GAAG,CAAC,IAAK;AACrC,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAK,IAAI,KAAM;AACf,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAK,KAAK,KAAM;AAAA,IACpB;AAEA,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EACnC;AAAA,EACA,aAAa;AACT,IAAAC,OAAM,QAAQ;AAAA,EAClB;AAAA,EACA,UAAU;AAGN,SAAK,YAAY;AACjB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,IAAAA,OAAM,KAAK,MAAM;AAAA,EACrB;AACJ;AAEO,IAAM,UAAN,cAAsB,SAAS;AAAA,EAClC,cAAc;AACV,UAAM,IAAIC,UAAS;AAAA,EACvB;AACJ;AAWA,IAAMC,QAAwB,uBAAUC,OAAM;AAAA,EAC1C;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,GAAG;AACxB,IAAMC,aAA6B,uBAAMF,MAAK,CAAC,GAAG;AAClD,IAAMG,aAA6B,uBAAMH,MAAK,CAAC,GAAG;AAElD,IAAMI,cAA6B,oBAAI,YAAY,EAAE;AAErD,IAAMC,cAA6B,oBAAI,YAAY,EAAE;AAErD,IAAM,WAAN,cAAuBC,QAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM1B,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,YAAY,WAAW,IAAI;AACvB,UAAM,KAAK,WAAW,IAAI,KAAK;AAC/B,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,CAAC,IAAI;AAClB,SAAK,KAAK,GAAG,EAAE,IAAI;AACnB,SAAK,KAAK,GAAG,EAAE,IAAI;AACnB,SAAK,KAAK,GAAG,EAAE,IAAI;AACnB,SAAK,KAAK,GAAG,EAAE,IAAI;AACnB,SAAK,KAAK,GAAG,EAAE,IAAI;AACnB,SAAK,KAAK,GAAG,EAAE,IAAI;AAAA,EACvB;AAAA;AAAA,EAEA,MAAM;AACF,UAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI;AAC3E,WAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EAC1E;AAAA;AAAA,EAEA,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAChE,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AAAA,EACnB;AAAA,EACA,WAAW,IAAI;AACX,KAAC,OAAO,IAAI,KAAK,YAAY,GAAG,IAAI,GAAG,KAAK,IAAI,CAAC;AACjD,WAAO,KAAK,eAAe,EAAE;AAAA,EACjC;AAAA,EACA,QAAQ,MAAM,QAAQ;AAElB,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,UAAU,GAAG;AACtC,MAAAF,YAAW,CAAC,IAAI,KAAK,UAAU,MAAM;AACrC,MAAAC,YAAW,CAAC,IAAI,KAAK,UAAW,UAAU,CAAE;AAAA,IAChD;AACA,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE1B,YAAM,OAAOD,YAAW,IAAI,EAAE,IAAI;AAClC,YAAM,OAAOC,YAAW,IAAI,EAAE,IAAI;AAClC,YAAM,MAAUE,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAC3F,YAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAE3F,YAAM,MAAMN,YAAW,IAAI,CAAC,IAAI;AAChC,YAAM,MAAMC,YAAW,IAAI,CAAC,IAAI;AAChC,YAAM,MAAUE,QAAO,KAAK,KAAK,EAAE,IAAQI,QAAO,KAAK,KAAK,EAAE,IAAQH,OAAM,KAAK,KAAK,CAAC;AACvF,YAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQG,QAAO,KAAK,KAAK,EAAE,IAAQF,OAAM,KAAK,KAAK,CAAC;AAEvF,YAAM,OAAWG,OAAM,KAAK,KAAKR,YAAW,IAAI,CAAC,GAAGA,YAAW,IAAI,EAAE,CAAC;AACtE,YAAM,OAAWS,OAAM,MAAM,KAAK,KAAKV,YAAW,IAAI,CAAC,GAAGA,YAAW,IAAI,EAAE,CAAC;AAC5E,MAAAA,YAAW,CAAC,IAAI,OAAO;AACvB,MAAAC,YAAW,CAAC,IAAI,OAAO;AAAA,IAC3B;AACA,QAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI;AAEzE,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAEzB,YAAM,UAAcE,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE;AACvF,YAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE;AAEvF,YAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,YAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,YAAM,OAAWG,OAAM,IAAI,SAAS,MAAMZ,WAAU,CAAC,GAAGE,YAAW,CAAC,CAAC;AACrE,YAAM,MAAUW,OAAM,MAAM,IAAI,SAAS,MAAMd,WAAU,CAAC,GAAGE,YAAW,CAAC,CAAC;AAC1E,YAAM,MAAM,OAAO;AAEnB,YAAM,UAAcG,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,YAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,YAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,YAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,OAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQK,KAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,YAAM,MAAUC,OAAM,KAAK,SAAS,IAAI;AACxC,WAASC,OAAM,KAAK,KAAK,SAAS,IAAI;AACtC,WAAK,MAAM;AAAA,IACf;AAEA,KAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQF,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,SAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EAC3E;AAAA,EACA,aAAa;AACT,IAAAG,OAAMhB,aAAYC,WAAU;AAAA,EAChC;AAAA,EACA,UAAU;AAGN,SAAK,YAAY;AACjB,IAAAe,OAAM,KAAK,MAAM;AACjB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EAC3D;AACJ;AAEO,IAAM,UAAN,cAAsB,SAAS;AAAA,EAClC,cAAc;AACV,UAAM,IAAIC,UAAS;AAAA,EACvB;AACJ;AAyDO,IAAM,SAAyB,gBAAAC;AAAA,EAAa,MAAM,IAAI,QAAQ;AAAA,EACrD,wBAAQ,CAAI;AAAC;AAyBtB,IAAMC,UAAyB,gBAAAC;AAAA,EAAa,MAAM,IAAI,QAAQ;AAAA,EACrD,wBAAQ,CAAI;AAAC;;;ACjYtB,SAAS,OAAO,MAAM,OAAO,QAAQ,MAAM;AAAE,GAAG;AACnD,MAAI,CAAC,MAAM,QAAQ,IAAI;AACnB,UAAM,IAAI,UAAU,IAAI,KAAK,8BAA8B,OAAO,IAAI,EAAE;AAC5E,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ;AAC7B,UAAM,KAAK,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,GAAG;AACnC,SAAO;AACX;AAcO,IAAMC,UAAS,CAAC,OAAO,QAAQ,UAAUA,QAAQ,OAAO,QAAQ,KAAK;AAarE,IAAMC,WAAUA;AAkChB,SAASC,SAAQ,OAAO,QAAQ,UAAU;AAC7C,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK;AAClE,UAAM,IAAI,UAAU,UAAU,WACxB,kCACA,IAAI,KAAK,+BAA+B,OAAO,KAAK,EAAE;AAChE,SAAO;AACX;AAcO,SAAS,UAAU,OAAO,OAAO;AACpC,MAAI,OAAO,UAAU;AACjB,UAAM,IAAI,UAAU,IAAI,KAAK,wCAAwC,OAAO,KAAK,EAAE;AACvF,SAAO;AACX;AAYO,IAAMC,cAAaA;AAwBnB,IAAMC,cAAa,CAAC,QAAQA,YAAY,GAAG;AAY3C,IAAMC,WAAUA;AAYhB,IAAMC,eAAc,CAAC,gBAAgBA,aAAa,WAAW;AACpE,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AAGpC,IAAMC,UAAS,CAAC,UAAW,QAAQ,IAAI,KAAK,OAAO;AAc5C,SAAS,MAAM,OAAO,QAAQ,IAAI;AACrC,MAAI,OAAO,UAAU;AACjB,UAAM,IAAI,UAAUA,QAAO,KAAK,IAAI,gCAAgC,OAAO,KAAK;AACpF,SAAO;AACX;AAaO,SAAS,WAAW,GAAG;AAC1B,MAAI,OAAO,MAAM,UAAU;AACvB,QAAI,CAACC,UAAS,CAAC;AACX,YAAM,IAAI,WAAW,mCAAmC,CAAC;AAAA,EACjE;AAEI,IAAAC,SAAQ,CAAC;AACb,SAAO;AACX;AAcO,SAAS,YAAY,OAAO,QAAQ,IAAI;AAC3C,MAAI,OAAO,UAAU,UAAU;AAC3B,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,UAAU,SAAS,+BAA+B,OAAO,KAAK;AAAA,EAC5E;AACA,MAAI,CAAC,OAAO,cAAc,KAAK,GAAG;AAC9B,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,WAAW,SAAS,gCAAgC,KAAK;AAAA,EACvE;AACJ;AAiCO,SAASC,aAAY,KAAK;AAC7B,MAAI,OAAO,QAAQ;AACf,UAAM,IAAI,UAAU,8BAA8B,OAAO,GAAG;AAChE,SAAO,QAAQ,KAAKC,OAAM,OAAO,OAAO,GAAG;AAC/C;AAcO,SAASC,iBAAgB,OAAO;AACnC,SAAOF,aAAYG,YAAY,KAAK,CAAC;AACzC;AAaO,SAASC,iBAAgB,OAAO;AACnC,SAAOJ,aAAYG,YAAYE,WAAUC,QAAQ,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC;AACvE;AAeO,SAASC,iBAAgB,GAAG,KAAK;AACpC,EAAAC,SAAS,GAAG;AACZ,MAAI,QAAQ;AACR,UAAM,IAAI,MAAM,+BAA+B;AACnD,MAAI,WAAW,CAAC;AAChB,QAAM,cAAc,MAAM;AAC1B,QAAM,MAAM,EAAE,SAAS,EAAE;AAEzB,MAAI,IAAI,SAAS;AACb,UAAM,IAAI,WAAW,qBAAqB;AAC9C,SAAOC,YAAY,IAAI,SAAS,aAAa,GAAG,CAAC;AACrD;AAeO,SAASC,iBAAgB,GAAG,KAAK;AACpC,SAAOH,iBAAgB,GAAG,GAAG,EAAE,QAAQ;AAC3C;AAoDO,SAASI,WAAU,OAAO;AAG7B,SAAO,WAAW,KAAKC,QAAO,KAAK,CAAC;AACxC;AAqCO,SAASC,UAAS,GAAG;AACxB,SAAO,OAAO,MAAM,YAAYC,QAAO;AAC3C;AAcO,SAASC,SAAQ,GAAG,KAAK,KAAK;AACjC,SAAOF,UAAS,CAAC,KAAKA,UAAS,GAAG,KAAKA,UAAS,GAAG,KAAK,OAAO,KAAK,IAAI;AAC5E;AAiBO,SAASG,UAAS,OAAO,GAAG,KAAK,KAAK;AAMzC,MAAI,CAACD,SAAQ,GAAG,KAAK,GAAG;AACpB,UAAM,IAAI,WAAW,oBAAoB,QAAQ,OAAO,MAAM,aAAa,MAAM,WAAW,CAAC;AACrG;AAgBO,SAASE,QAAO,GAAG;AAGtB,MAAI,IAAIH;AACJ,UAAM,IAAI,MAAM,uCAAuC,CAAC;AAE5D,SAAO,MAAMA,OAAM,IAAI,EAAE,SAAS,CAAC,EAAE;AACzC;AA2DO,IAAMI,WAAU,CAAC,MAAM;AAC1B,cAAY,GAAG,GAAG;AAClB,UAAQC,QAAO,OAAO,CAAC,KAAKA;AAChC;AAoGO,SAASC,gBAAe,QAAQ,SAAS,CAAC,GAAG,YAAY,CAAC,GAAG,QAAQ,UAAU;AAClF,EAAAC,SAAQ,QAAQ,KAAK;AACrB,EAAAA,SAAQ,QAAQ,QAAQ;AACxB,EAAAA,SAAQ,WAAW,WAAW;AAC9B,WAAS,WAAW,WAAW,cAAc,OAAO;AAChD,UAAM,QAAQ,UAAU,WAAW,UAAU,OAAO,SAAS,CAAC,MAAM,IAAI,KAAK,IAAI,OAAO,SAAS,CAAC;AAGlG,UAAM,MAAM,OAAO,SAAS;AAG5B,QAAI,CAAC,OAAO,OAAO,QAAQ,SAAS,MAC/B,QAAQ,QAAQ,SAAY,iBAAiB,aAAa;AAC3D,YAAM,IAAI,UAAU,GAAG,KAAK,oCAAoC;AAAA,IACpE;AACA,QAAI,SAAS,QAAQ;AACjB;AACJ,UAAM,UAAU,OAAO;AACvB,QAAI,YAAY,gBAAgB,QAAQ;AACpC,YAAM,IAAI,UAAU,GAAG,KAAK,yBAAyB,YAAY,SAAS,OAAO,EAAE;AAAA,EAC3F;AACA,QAAM,OAAO,CAAC,GAAG,UAAU,OAAO,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,WAAW,GAAG,GAAG,KAAK,CAAC;AACxF,OAAK,QAAQ,KAAK;AAClB,OAAK,WAAW,IAAI;AACxB;;;AC3qBA,IAAMC,OAAsB,uBAAO,CAAC;AAApC,IAAuCC,OAAsB,uBAAO,CAAC;AAArE,IAAwEC,OAAsB,uBAAO,CAAC;AAEtG,IAAMC,OAAsB,uBAAO,CAAC;AAApC,IAAuCC,OAAsB,uBAAO,CAAC;AAArE,IAAwEC,OAAsB,uBAAO,CAAC;AAEtG,IAAMC,OAAsB,uBAAO,CAAC;AAApC,IAAuCC,OAAsB,uBAAO,CAAC;AAArE,IAAwEC,OAAsB,uBAAO,CAAC;AACtG,IAAM,OAAuB,uBAAO,EAAE;AAAtC,IAAyCC,QAAuB,uBAAO,EAAE;AAGzE,IAAM,mBAAmC,uBAAO,qBAAqB;AAa9D,SAASC,KAAI,GAAG,GAAG;AACtB,MAAI,KAAKV;AACL,UAAM,IAAI,MAAM,yCAAyC,CAAC;AAC9D,QAAM,SAAS,IAAI;AACnB,SAAO,UAAUA,OAAM,SAAS,IAAI;AACxC;AAkBO,SAAS,IAAI,KAAK,OAAO,QAAQ;AACpC,MAAI,UAAUC;AACV,UAAM,IAAI,MAAM,oCAAoC,MAAM;AAE9D,MAAI,OAAO,UAAU;AACjB,UAAM,IAAI,UAAU,4CAA4C,OAAO,KAAK;AAChF,MAAI,QAAQD;AACR,UAAM,IAAI,MAAM,yCAAyC;AAC7D,MAAI,UAAUA;AACV,WAAOC;AACX,MAAI,UAAUA;AACV,WAAO;AACX,MAAI,IAAI,MAAM;AACd,MAAI,IAAID;AACJ,SAAK;AAGT,MAAI,QAAQ,kBAAkB;AAE1B,QAAIW,KAAIV;AACR,WAAO,QAAQD,MAAK;AAChB,UAAI,QAAQC;AACR,QAAAU,KAAKA,KAAI,IAAK;AAClB,UAAK,IAAI,IAAK;AACd,gBAAUV;AAAA,IACd;AACA,WAAOU;AAAA,EACX;AAIA,QAAM,SAAS,CAAC;AAChB,SAAO,QAAQX,MAAK;AAChB,WAAO,KAAK,OAAO,QAAQ,IAAI,CAAC;AAChC,cAAUI;AAAA,EACd;AACA,QAAM,QAAQ,IAAI,MAAM,EAAE;AAC1B,QAAM,CAAC,IAAIH;AACX,QAAM,CAAC,IAAI;AACX,WAAS,IAAI,GAAG,IAAI,IAAI;AACpB,UAAM,CAAC,IAAK,MAAM,IAAI,CAAC,IAAI,IAAK;AACpC,MAAI,IAAI,MAAM,OAAO,OAAO,SAAS,CAAC,CAAC;AACvC,WAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,QAAK,IAAI,IAAK;AACd,QAAK,IAAI,IAAK;AACd,QAAK,IAAI,IAAK;AACd,QAAK,IAAI,IAAK;AACd,UAAM,QAAQ,OAAO,CAAC;AACtB,QAAI,UAAU;AACV,UAAK,IAAI,MAAM,KAAK,IAAK;AAAA,EACjC;AACA,SAAO;AACX;AAiBO,SAASW,MAAK,GAAG,OAAO,QAAQ;AACnC,MAAI,UAAUX;AACV,UAAM,IAAI,MAAM,qCAAqC,MAAM;AAC/D,MAAI,QAAQD;AACR,UAAM,IAAI,MAAM,+CAA+C,KAAK;AACxE,MAAI,MAAM;AACV,SAAO,UAAUA,MAAK;AAClB,WAAO;AACP,WAAO;AAAA,EACX;AACA,SAAO;AACX;AAeO,SAASa,QAAO,QAAQ,QAAQ;AACnC,MAAI,WAAWb;AACX,UAAM,IAAI,MAAM,kCAAkC;AAGtD,MAAI,UAAUC;AACV,UAAM,IAAI,MAAM,uCAAuC,MAAM;AAGjE,MAAI,IAAIS,KAAI,QAAQ,MAAM;AAC1B,MAAI,IAAI;AAIR,MAAI,IAAIV,MAAK,IAAIC;AACjB,SAAO,MAAMD,MAAK;AACd,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI,IAAI;AAClB,UAAM,IAAI,IAAI,IAAI;AAElB,QAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;AAAA,EAC7B;AACA,QAAM,MAAM;AACZ,MAAI,QAAQC;AACR,UAAM,IAAI,MAAM,wBAAwB;AAC5C,SAAOS,KAAI,GAAG,MAAM;AACxB;AAuCA,SAASI,gBAAeC,KAAI,MAAM,GAAG;AACjC,QAAM,IAAIA;AACV,MAAI,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC;AACrB,UAAM,IAAI,MAAM,yBAAyB;AACjD;AAMA,SAAS,YAAY,OAAO,QAAQ;AAChC,OAAK,QAAQC,UAASC;AAClB,UAAM,IAAI,MAAM,SAAS,iCAAiC,KAAK;AACvE;AAKA,SAASC,WAAUH,KAAI,GAAG;AACtB,QAAM,IAAIA;AACV,QAAM,UAAU,EAAE,QAAQC,QAAOG;AACjC,QAAM,OAAO,EAAE,IAAI,GAAG,MAAM;AAC5B,EAAAL,gBAAe,GAAG,MAAM,CAAC;AACzB,SAAO;AACX;AAGA,SAASM,WAAUL,KAAI,GAAG;AACtB,QAAM,IAAIA;AACV,QAAM,UAAU,EAAE,QAAQM,QAAOC;AACjC,QAAM,KAAK,EAAE,IAAI,GAAGC,IAAG;AACvB,QAAM,IAAI,EAAE,IAAI,IAAI,MAAM;AAC1B,QAAM,KAAK,EAAE,IAAI,GAAG,CAAC;AACrB,QAAM,IAAI,EAAE,IAAI,EAAE,IAAI,IAAIA,IAAG,GAAG,CAAC;AACjC,QAAM,OAAO,EAAE,IAAI,IAAI,EAAE,IAAI,GAAG,EAAE,GAAG,CAAC;AACtC,EAAAT,gBAAe,GAAG,MAAM,CAAC;AACzB,SAAO;AACX;AAGA,SAASU,YAAW,GAAG;AACnB,QAAM,MAAMC,OAAM,CAAC;AACnB,QAAM,KAAKC,eAAc,CAAC;AAC1B,QAAM,KAAK,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AACnC,QAAM,KAAK,GAAG,KAAK,EAAE;AACrB,QAAM,KAAK,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC;AAC9B,QAAM,MAAM,IAAIC,QAAOC;AACvB,UAAQ,CAACb,KAAI,MAAM;AACf,UAAM,IAAIA;AACV,QAAI,MAAM,EAAE,IAAI,GAAG,EAAE;AACrB,QAAI,MAAM,EAAE,IAAI,KAAK,EAAE;AACvB,UAAM,MAAM,EAAE,IAAI,KAAK,EAAE;AACzB,UAAM,MAAM,EAAE,IAAI,KAAK,EAAE;AACzB,UAAM,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC;AAC9B,UAAM,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC;AAC9B,UAAM,EAAE,KAAK,KAAK,KAAK,EAAE;AACzB,UAAM,EAAE,KAAK,KAAK,KAAK,EAAE;AACzB,UAAM,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC;AAC9B,UAAM,OAAO,EAAE,KAAK,KAAK,KAAK,EAAE;AAChC,IAAAD,gBAAe,GAAG,MAAM,CAAC;AACzB,WAAO;AAAA,EACX;AACJ;AAmBO,SAASY,eAAc,GAAG;AAG7B,MAAI,IAAIG;AACJ,UAAM,IAAI,MAAM,qCAAqC;AACzD,cAAY,GAAG,eAAe;AAE9B,MAAI,IAAI,IAAIb;AACZ,MAAI,IAAI;AACR,SAAO,IAAIO,SAAQN,MAAK;AACpB,SAAKM;AACL;AAAA,EACJ;AAEA,MAAI,IAAIA;AACR,QAAM,MAAME,OAAM,CAAC;AACnB,SAAOK,YAAW,KAAK,CAAC,MAAM,GAAG;AAG7B,QAAI,MAAM;AACN,YAAM,IAAI,MAAM,+CAA+C;AAAA,EACvE;AAEA,MAAI,MAAM;AACN,WAAOZ;AAGX,MAAI,KAAK,IAAI,IAAI,GAAG,CAAC;AACrB,QAAM,UAAU,IAAIF,QAAOO;AAC3B,SAAO,SAAS,YAAYR,KAAI,GAAG;AAC/B,UAAM,IAAIA;AACV,QAAI,EAAE,IAAI,CAAC;AACP,aAAO;AAEX,QAAIe,YAAW,GAAG,CAAC,MAAM;AACrB,YAAM,IAAI,MAAM,yBAAyB;AAE7C,QAAI,IAAI;AACR,QAAI,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE;AACvB,QAAI,IAAI,EAAE,IAAI,GAAG,CAAC;AAClB,QAAI,IAAI,EAAE,IAAI,GAAG,MAAM;AAGvB,WAAO,CAAC,EAAE,IAAI,GAAG,EAAE,GAAG,GAAG;AAGrB,UAAI,EAAE,IAAI,CAAC;AACP,cAAM,IAAI,MAAM,+CAA+C;AACnE,UAAI,IAAI;AAER,UAAI,QAAQ,EAAE,IAAI,CAAC;AACnB,aAAO,CAAC,EAAE,IAAI,OAAO,EAAE,GAAG,GAAG;AACzB;AACA,gBAAQ,EAAE,IAAI,KAAK;AACnB,YAAI,MAAM;AACN,gBAAM,IAAI,MAAM,yBAAyB;AAAA,MACjD;AAEA,YAAM,WAAWd,QAAO,OAAO,IAAI,IAAI,CAAC;AACxC,YAAM,IAAI,EAAE,IAAI,GAAG,QAAQ;AAE3B,UAAI;AACJ,UAAI,EAAE,IAAI,CAAC;AACX,UAAI,EAAE,IAAI,GAAG,CAAC;AACd,UAAI,EAAE,IAAI,GAAG,CAAC;AAAA,IAClB;AACA,WAAO;AAAA,EACX;AACJ;AAyBO,SAASe,QAAO,GAAG;AACtB,cAAY,GAAG,SAAS;AAExB,MAAI,IAAIZ,SAAQU;AACZ,WAAOX;AAEX,MAAI,IAAII,SAAQD;AACZ,WAAOD;AAEX,MAAI,IAAIQ,UAASI;AACb,WAAOR,YAAW,CAAC;AAEvB,SAAOE,eAAc,CAAC;AAC1B;AAaO,IAAMO,gBAAe,CAAC,KAAK,YAAYC,KAAI,KAAK,MAAM,IAAIlB,UAASA;AAK1E,IAAMmB,gBAAe;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;AAeO,SAASC,eAAc,OAAO;AACjC,EAAAC,SAAQ,OAAO,OAAO;AACtB,MAAI,OAAO,MAAM,UAAU;AACvB,UAAM,IAAI,UAAU,oDAAoD,OAAO,MAAM,KAAK;AAG9F,cAAY,MAAM,OAAO,OAAO;AAChC,cAAY,MAAM,MAAM,MAAM;AAC9B,aAAWC,SAAQH;AACf,cAAU,MAAMG,KAAI,GAAG,WAAWA,KAAI;AAG1C,MAAI,MAAM,QAAQ,KAAK,MAAM,OAAO;AAChC,UAAM,IAAI,MAAM,wCAAwC;AAC5D,MAAI,MAAM,SAAStB;AACf,UAAM,IAAI,MAAM,4CAA4C,MAAM,KAAK;AAC3E,SAAO;AACX;AAkEO,SAASuB,eAAcC,KAAI,MAAM,WAAW,OAAO;AACtD,EAAAC,eAAcD,GAAE;AAChB,SAAO,MAAM,MAAM;AACnB,QAAM,UAAU,UAAU;AAC1B,QAAM,IAAIA;AACV,QAAM,WAAW,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,WAAW,EAAE,OAAO,MAAS;AAE1E,QAAM,gBAAgB,KAAK,OAAO,CAAC,KAAK,KAAK,MAAM;AAC/C,QAAI,EAAE,IAAI,GAAG;AACT,aAAO;AACX,aAAS,CAAC,IAAI;AACd,WAAO,EAAE,IAAI,KAAK,GAAG;AAAA,EACzB,GAAG,EAAE,GAAG;AAER,QAAM,cAAc,EAAE,IAAI,aAAa;AAEvC,OAAK,YAAY,CAAC,KAAK,KAAK,MAAM;AAC9B,QAAI,EAAE,IAAI,GAAG;AACT,aAAO;AAEX,aAAS,CAAC,IAAI,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC;AACpC,WAAO,EAAE,IAAI,KAAK,GAAG;AAAA,EACzB,GAAG,WAAW;AACd,SAAO;AACX;AA0CO,SAASE,YAAWC,KAAI,GAAG;AAC9B,EAAAC,eAAcD,GAAE;AAChB,QAAM,IAAIA;AACV,cAAY,EAAE,OAAO,YAAY;AAGjC,QAAM,UAAU,EAAE,QAAQE,QAAOC;AACjC,QAAM,UAAU,EAAE,IAAI,GAAG,MAAM;AAC/B,QAAM,MAAM,EAAE,IAAI,SAAS,EAAE,GAAG;AAChC,QAAM,OAAO,EAAE,IAAI,SAAS,EAAE,IAAI;AAClC,QAAM,KAAK,EAAE,IAAI,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC;AACtC,MAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;AAClB,UAAM,IAAI,MAAM,gCAAgC;AACpD,SAAO,MAAM,IAAI,OAAO,IAAI;AAChC;AAkCO,SAASC,SAAQ,GAAG,YAAY;AAEnC,MAAI,eAAe;AACf,IAAAC,SAAQ,UAAU;AACtB,MAAI,KAAKC;AACL,UAAM,IAAI,MAAM,gDAAgD,CAAC;AACrE,MAAI,eAAe,UAAa,aAAa;AACzC,UAAM,IAAI,MAAM,yDAAyD,UAAU;AACvF,QAAM,OAAOC,QAAO,CAAC;AAGrB,MAAI,eAAe,UAAa,aAAa;AACzC,UAAM,IAAI,MAAM,0CAA0C,UAAU,mBAAmB,IAAI,GAAG;AAClG,QAAM,cAAc,eAAe,SAAY,aAAa;AAC5D,QAAM,cAAc,KAAK,KAAK,cAAc,CAAC;AAC7C,SAAO,EAAE,YAAY,aAAa,YAAY;AAClD;AAGA,IAAM,aAAa,oBAAI,QAAQ;AAC/B,IAAM,SAAN,MAAa;AAAA,EACT;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,OAAOD;AAAA,EACP,MAAME;AAAA,EACN;AAAA,EACA;AAAA,EACA,YAAY,OAAO,OAAO,CAAC,GAAG;AAG1B,QAAI,SAASA;AACT,YAAM,IAAI,MAAM,4CAA4C,KAAK;AACrE,QAAI,cAAc;AAClB,SAAK,OAAO;AACZ,QAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAE1C,UAAI,OAAO,KAAK,SAAS;AACrB,sBAAc,KAAK;AACvB,UAAI,OAAO,KAAK,SAAS;AAGrB,eAAO,eAAe,MAAM,QAAQ,EAAE,OAAO,KAAK,MAAM,YAAY,KAAK,CAAC;AAC9E,UAAI,OAAO,KAAK,SAAS;AACrB,aAAK,OAAO,KAAK;AACrB,UAAI,KAAK;AACL,aAAK,WAAW,OAAO,OAAO,KAAK,eAAe,MAAM,CAAC;AAC7D,UAAI,OAAO,KAAK,iBAAiB;AAC7B,aAAK,OAAO,KAAK;AAAA,IACzB;AACA,UAAM,EAAE,YAAY,YAAY,IAAIJ,SAAQ,OAAO,WAAW;AAC9D,QAAI,cAAc;AACd,YAAM,IAAI,MAAM,gDAAgD;AACpE,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,WAAO,OAAO,IAAI;AAAA,EACtB;AAAA,EACA,OAAO,KAAK;AACR,WAAOK,KAAI,KAAK,KAAK,KAAK;AAAA,EAC9B;AAAA,EACA,QAAQ,KAAK;AACT,QAAI,OAAO,QAAQ;AACf,YAAM,IAAI,UAAU,iDAAiD,OAAO,GAAG;AACnF,WAAOH,QAAO,OAAO,MAAM,KAAK;AAAA,EACpC;AAAA,EACA,IAAI,KAAK;AACL,WAAO,QAAQA;AAAA,EACnB;AAAA;AAAA,EAEA,YAAY,KAAK;AACb,WAAO,CAAC,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,GAAG;AAAA,EAC7C;AAAA,EACA,MAAM,KAAK;AACP,YAAQ,MAAME,UAASA;AAAA,EAC3B;AAAA,EACA,IAAI,KAAK;AACL,WAAOC,KAAI,CAAC,KAAK,KAAK,KAAK;AAAA,EAC/B;AAAA,EACA,IAAI,KAAK,KAAK;AACV,WAAO,QAAQ;AAAA,EACnB;AAAA,EACA,IAAI,KAAK;AACL,WAAOA,KAAI,MAAM,KAAK,KAAK,KAAK;AAAA,EACpC;AAAA,EACA,IAAI,KAAK,KAAK;AACV,WAAOA,KAAI,MAAM,KAAK,KAAK,KAAK;AAAA,EACpC;AAAA,EACA,IAAI,KAAK,KAAK;AACV,WAAOA,KAAI,MAAM,KAAK,KAAK,KAAK;AAAA,EACpC;AAAA,EACA,IAAI,KAAK,KAAK;AACV,WAAOA,KAAI,MAAM,KAAK,KAAK,KAAK;AAAA,EACpC;AAAA,EACA,IAAI,KAAK,OAAO;AACZ,WAAO,IAAI,KAAK,OAAO,KAAK,KAAK;AAAA,EACrC;AAAA,EACA,IAAI,KAAK,KAAK;AACV,WAAOA,KAAI,MAAMC,QAAO,KAAK,KAAK,KAAK,GAAG,KAAK,KAAK;AAAA,EACxD;AAAA;AAAA,EAEA,KAAK,KAAK;AACN,WAAO,MAAM;AAAA,EACjB;AAAA,EACA,KAAK,KAAK,KAAK;AACX,WAAO,MAAM;AAAA,EACjB;AAAA,EACA,KAAK,KAAK,KAAK;AACX,WAAO,MAAM;AAAA,EACjB;AAAA,EACA,KAAK,KAAK,KAAK;AACX,WAAO,MAAM;AAAA,EACjB;AAAA,EACA,IAAI,KAAK;AACL,WAAOA,QAAO,KAAK,KAAK,KAAK;AAAA,EACjC;AAAA,EACA,KAAK,KAAK;AAGN,QAAI,OAAO,WAAW,IAAI,IAAI;AAC9B,QAAI,CAAC;AACD,iBAAW,IAAI,MAAO,OAAOC,QAAO,KAAK,KAAK,CAAE;AACpD,WAAO,KAAK,MAAM,GAAG;AAAA,EACzB;AAAA,EACA,QAAQ,KAAK;AAIT,WAAO,KAAK,OAAOC,iBAAgB,KAAK,KAAK,KAAK,IAAIC,iBAAgB,KAAK,KAAK,KAAK;AAAA,EACzF;AAAA,EACA,UAAU,OAAO,iBAAiB,OAAO;AACrC,IAAAC,QAAO,KAAK;AACZ,UAAM,EAAE,UAAU,gBAAgB,OAAO,MAAAC,OAAM,OAAO,MAAM,aAAa,IAAI;AAC7E,QAAI,gBAAgB;AAGhB,UAAI,MAAM,SAAS,KAAK,CAAC,eAAe,SAAS,MAAM,MAAM,KAAK,MAAM,SAAS,OAAO;AACpF,cAAM,IAAI,MAAM,+BAA+B,iBAAiB,iBAAiB,MAAM,MAAM;AAAA,MACjG;AACA,YAAM,SAAS,IAAI,WAAW,KAAK;AAEnC,aAAO,IAAI,OAAOA,QAAO,IAAI,OAAO,SAAS,MAAM,MAAM;AACzD,cAAQ;AAAA,IACZ;AACA,QAAI,MAAM,WAAW;AACjB,YAAM,IAAI,MAAM,+BAA+B,QAAQ,iBAAiB,MAAM,MAAM;AACxF,QAAI,SAASA,QAAOC,iBAAgB,KAAK,IAAIC,iBAAgB,KAAK;AAClE,QAAI;AACA,eAASR,KAAI,QAAQ,KAAK;AAC9B,QAAI,CAAC;AACD,UAAI,CAAC,KAAK,QAAQ,MAAM;AACpB,cAAM,IAAI,MAAM,kDAAkD;AAAA;AAG1E,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,YAAY,KAAK;AAIb,WAAOS,eAAc,MAAM,KAAK,IAAI;AAAA,EACxC;AAAA;AAAA;AAAA,EAGA,KAAK,GAAG,GAAG,WAAW;AAGlB,UAAM,WAAW,WAAW;AAC5B,WAAO,YAAY,IAAI;AAAA,EAC3B;AACJ;AA2BO,SAASC,OAAM,OAAO,OAAO,CAAC,GAAG;AAKpC,SAAO,OAAO,OAAO,SAAS;AAC9B,SAAO,IAAI,OAAO,OAAO,IAAI;AACjC;;;ACj0BA,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAM,cAAc;AACpB,IAAM,aAAa;AAInB,IAAM,YAAY;AAIlB,IAAM,kBAAmC,uBAAM,KAAK,IAAI;AAgBjD,SAAS,kBAAkB,OAAO;AACrC,QAAM,KAAK;AACX,MAAI,OAAO,OAAO;AACd,UAAM,IAAI,UAAU,4CAA4C,OAAO,KAAK;AAChF,YAAU,GAAG,YAAY,kBAAkB;AAC3C,YAAU,GAAG,WAAW,iBAAiB;AACzC,YAAU,GAAG,SAAS,eAAe;AAGrC,EAAAC,SAAQ,GAAG,MAAM,YAAY;AAC7B,EAAAA,SAAQ,GAAG,MAAM,YAAY;AAC7B,EAAAC,eAAc,GAAG,EAAE;AACnB,EAAAA,eAAc,GAAG,EAAE;AACvB;AAmBO,SAASC,YAAW,GAAG,QAAQ;AAElC,oBAAkB,CAAC;AACnB,EAAAC,mBAAkB,QAAQ,CAAC;AAI3B,QAAM,aAAaC,eAAc,EAAE,IAAI,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAC7D,SAAO,OAAO,IAAI,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,SAAS,WAAW,CAAC,CAAC,CAAC,CAAC;AACvE;AACA,SAASC,WAAU,GAAG,MAAM,MAAM,GAAG;AACjC,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,OAAO,IAAI;AAC3C,UAAM,IAAI,MAAM,oCAAoC,MAAM,OAAO,OAAO,cAAc,CAAC;AAC/F;AAIA,SAAS,mBAAmB,WAAW,SAAS;AAC5C,QAAM,QAAQ,aAAa,IAAI,UAAU;AACzC,MAAI,QAAQ;AACR,UAAM,IAAI,MAAM,4CACZ,KAAK,KAAK,QAAQ,KAAK,EAAE,IACzB,eACA,kBAAkB,KAAK,KACvB,MAAM;AAClB;AAyBO,SAAS,iBAAiBC,cAAa,QAAQ;AAClD,MAAIA,iBAAgB;AAChB,WAAO;AACX,YAAUA,cAAa,aAAa;AACpC,MAAI;AACA,UAAM,QAAQA,aAAY,MAAM;AAChC,QAAI,CAACC,SAAQ,KAAK,KAAK,MAAM,WAAW;AACpC,aAAO;AAAA,EACf,QACM;AACF,WAAO;AAAA,EACX;AACA,SAAOD;AACX;AACA,SAASH,mBAAkB,QAAQ,GAAG;AAClC,SAAO,QAAQ,QAAQ;AACvB,SAAO,QAAQ,CAAC,GAAG,MAAM;AACrB,QAAI,EAAE,aAAa;AACf,YAAM,IAAI,MAAM,4BAA4B,CAAC;AAAA,EACrD,CAAC;AACL;AAGA,SAASK,oBAAmB,SAAS,OAAO,WAAW;AACnD,MAAI,CAAC,MAAM,QAAQ,OAAO;AACtB,UAAM,IAAI,MAAM,2BAA2B;AAC/C,UAAQ,QAAQ,CAACC,IAAG,MAAM;AACtB,UAAMC,MAAK,cAAc,SAAY,MAAM,QAAQD,EAAC,IAAIE,UAASF,EAAC,KAAKA,KAAI;AAC3E,QAAI,CAACC;AACD,YAAM,IAAI,MAAM,6BAA6B,CAAC;AAAA,EACtD,CAAC;AACL;AACA,IAAME,oBAAmB,oBAAI,QAAQ;AACrC,SAAS,cAAc,GAAG;AAEtB,SAAOA,kBAAiB,IAAI,CAAC,KAAK;AACtC;AAEA,SAAS,aAAa,GAAG,MAAM;AAC3B,QAAM,MAAM,EAAE,OAAO;AACrB,QAAM,IAAI,CAAC,CAAC;AACZ,WAAS,IAAI,GAAG,IAAI,MAAM;AACtB,MAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAC5B,SAAO;AACX;AAKA,SAAS,WAAW,GAAG,GAAG;AACtB,QAAM,OAAO,KAAK;AAClB,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,OAAO,OAAO,CAAC;AAC5B,QAAM,IAAI,CAAC;AACX,SAAO,IAAIf,MAAK;AACZ,QAAI,IAAI;AACR,QAAI,IAAIC,MAAK;AACT,UAAI,OAAO,IAAI,IAAI;AACnB,UAAI,KAAK;AACL,aAAK;AACT,WAAK,OAAO,CAAC;AAAA,IACjB;AACA,MAAE,KAAK,CAAC;AACR,UAAMA;AAAA,EACV;AACA,SAAO;AACX;AAMA,SAAS,mBAAmB,GAAG,GAAG,SAAS;AACvC,QAAM,OAAO,KAAK;AAClB,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,OAAO,OAAO,CAAC;AAC5B,QAAM,UAAU,OAAO,CAAC;AACxB,QAAM,IAAI,CAAC;AACX,WAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAC9B,QAAI,IAAI,OAAO,IAAI,IAAI;AACvB,UAAM;AACN,QAAI,IAAI,MAAM;AACV,WAAK;AACL,WAAKA;AAAA,IACT;AACA,MAAE,KAAK,CAAC;AAAA,EACZ;AAEA,MAAI,MAAMD;AACN,UAAM,IAAI,MAAM,cAAc;AAClC,SAAO;AACX;AAMA,SAAS,SAAS,MAAM,QAAQ,QAAQ;AACpC,MAAI,MAAM;AACV,aAAW,KAAK;AACZ,UAAM,KAAK,IAAI,KAAK,EAAE,MAAM;AAChC,MAAI,MAAM;AACV,WAAS,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO;AACrC,QAAI,QAAQ,MAAM;AACd,YAAM,IAAI,OAAO;AACrB,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,YAAM,IAAI,OAAO,CAAC,EAAE,GAAG;AACvB,UAAI,GAAG;AACH,cAAM,OAAO,OAAO,CAAC,EAAG,KAAK,IAAI,CAAC,IAAI,KAAM,CAAC;AAC7C,cAAM,IAAI,IAAI,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI;AAAA,MAC9C;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;AA4BO,IAAM,mBAAN,MAAuB;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,kBAAkB,oBAAI,QAAQ;AAAA,EAC9B;AAAA,EACA;AAAA;AAAA,EAEA,YAAY,OAAOS,cAAa;AAC5B,sBAAkB,KAAK;AAKvB,SAAK,cAAc,iBAAiBA,cAAa,WAAW;AAC5D,SAAK,QAAQ;AACb,SAAK,OAAO,MAAM;AAClB,SAAK,OAAO,MAAM;AAClB,SAAK,OAAO,MAAM,GAAG;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,eAAe,OAAO,GAAG,MAAM;AAI3B,UAAM,UAAU,KAAK,KAAK,OAAO,CAAC,IAAI;AACtC,UAAM,OAAO,MAAM,IAAI;AACvB,UAAM,OAAO,CAAC;AACd,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAC9B,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,aAAK,KAAK,GAAG;AACb,cAAM,IAAI,IAAI,IAAI;AAAA,MACtB;AACA,aAAO,KAAK,KAAK,SAAS,CAAC,EAAE,OAAO;AAAA,IACxC;AACA,WAAO,EAAE,GAAG,MAAM,SAAS,KAAK;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa,aAAa,GAAG;AACzB,UAAM,EAAE,GAAG,SAAS,KAAK,IAAI;AAC7B,UAAM,OAAO,MAAM,IAAI;AACvB,UAAM,SAAS,mBAAmB,GAAG,GAAG,OAAO;AAC/C,QAAI,IAAI,KAAK;AACb,QAAI,IAAI,KAAK;AACb,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAC9B,YAAM,QAAQ,OAAO,CAAC;AACtB,YAAM,QAAQ,IAAI;AAElB,YAAM,MAAM,KAAK,IAAI,KAAK,IAAI;AAC9B,UAAI,MAAM,KAAK,KAAK;AACpB,eAAS,IAAI,GAAG,IAAI,MAAM;AACtB,cAAM,MAAM,MAAM,KAAK,QAAQ,CAAC,IAAI;AACxC,YAAM,MAAM,IAAI,OAAO;AACvB,UAAI,UAAU;AACV,YAAI,EAAE,IAAI,KAAK,KAAK,CAAC;AAAA;AAErB,YAAI,EAAE,IAAI,QAAQ,IAAI,MAAM,GAAG;AAAA,IACvC;AACA,WAAO,EAAE,GAAG,EAAE;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAIA,mBAAmB,GAAG,OAAO,MAAM,WAAW;AAC1C,QAAI,UAAU,KAAK,gBAAgB,IAAI,KAAK;AAC5C,QAAI,OAAO,SAAS,KAAK,CAAC,UAAU,MAAM,MAAM,KAAK,MAAM,SAAS,IAAI;AACxE,QAAI,CAAC,MAAM;AACP,aAAO,KAAK,eAAe,OAAO,GAAG,IAAI;AACzC,UAAI,OAAO,cAAc;AACrB,eAAO,EAAE,GAAG,MAAM,MAAM,UAAU,KAAK,IAAI,EAAE;AACjD,UAAI,CAAC,SAAS;AACV,kBAAU,CAAC;AACX,aAAK,gBAAgB,IAAI,OAAO,OAAO;AAAA,MAC3C;AACA,cAAQ,KAAK,IAAI;AAAA,IACrB;AACA,WAAO;AAAA,EACX;AAAA,EACA,YAAY,OAAO;AACf,QAAI,EAAE,iBAAiB,KAAK;AACxB,YAAM,IAAI,UAAU,+CAA+C,OAAO,KAAK;AAAA,EACvF;AAAA;AAAA;AAAA;AAAA,EAIA,iBAAiB,OAAO,QAAQ;AAC5B,SAAK,YAAY,KAAK;AACtB,QAAI,CAACO,SAAQ,QAAQf,MAAK,KAAK,MAAM,GAAG,KAAK;AACzC,YAAM,IAAI,MAAM,gBAAgB;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAIA,MAAM,OAAO,GAAG,MAAM,WAAW;AAC7B,UAAM,IAAI,cAAc,KAAK;AAC7B,QAAI,MAAM;AACN,aAAO,KAAK,cAAc,OAAO,GAAG,IAAI;AAC5C,WAAO,KAAK,aAAa,KAAK,mBAAmB,GAAG,OAAO,MAAM,SAAS,GAAG,CAAC;AAAA,EAClF;AAAA,EACA,MAAM,OAAO,QAAQ,WAAW;AAC5B,SAAK,iBAAiB,OAAO,MAAM;AACnC,WAAO,KAAK,MAAM,OAAO,QAAQ,KAAK,MAAM,SAAS;AAAA,EACzD;AAAA,EACA,aAAa,OAAO,QAAQ,WAAW;AACnC,SAAK,iBAAiB,OAAO,MAAM;AAKnC,QAAI,KAAK,gBAAgB;AACrB,YAAM,IAAI,MAAM,6CAA6C;AACjE,UAAM,OAAO,KAAK,MAAM,GAAG,OAAO;AAClC,UAAM,QAAQ,KAAK,YAAY,WAAW;AAC1C,QAAI,CAACS,SAAQ,KAAK,KAAK,MAAM,WAAW;AACpC,YAAM,IAAI,MAAM,yCAAyC;AAS7D,UAAM,CAAC,IAAK,MAAM,CAAC,IAAI,KAAQ;AAK/B,UAAM,IAAI,SAASO,iBAAgB,KAAK,IAAI,KAAK,MAAM,GAAG;AAC1D,WAAO,KAAK,MAAM,OAAO,GAAG,MAAM,SAAS;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,cAAc,OAAO,GAAG,MAAM;AAC1B,UAAM,IAAI;AACV,UAAM,OAAO,KAAK;AAClB,UAAM,OAAOC,SAAQ,CAAC;AAEtB,UAAM,QAAQ,IAAI,MAAM,IAAI;AAC5B,UAAM,CAAC,IAAI,KAAK;AAChB,aAAS,IAAI,GAAG,IAAI,MAAM;AACtB,YAAM,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,IAAI,KAAK;AAErC,UAAM,UAAU,KAAK,KAAK,OAAO,CAAC;AAClC,QAAI,MAAM,KAAK;AACf,aAAS,SAAS,UAAU,GAAG,UAAU,GAAG,UAAU;AAGlD,UAAI,WAAW,UAAU;AACrB,iBAAS,IAAI,GAAG,IAAI,GAAG;AACnB,gBAAM,IAAI,OAAO;AACzB,YAAM,QAAQ,OAAQ,KAAK,OAAO,SAAS,CAAC,IAAK,IAAI;AAErD,UAAI,MAAM,MAAM,CAAC;AACjB,eAAS,IAAI,GAAG,IAAI,MAAM;AACtB,cAAM,MAAM,QAAQ,MAAM,CAAC,IAAI;AACnC,YAAM,IAAI,IAAI,GAAG;AAAA,IACrB;AACA,WAAO,EAAE,GAAG,KAAK,GAAG,IAAI;AAAA,EAC5B;AAAA,EACA,YAAY,OAAO,UAAU;AAEzB,QAAI,KAAK,gBAAgB;AACrB,aAAO;AACX,QAAI,aAAajB;AACb,aAAO;AACX,QAAI,UAAU,KAAK;AACf,aAAO;AACX,QAAI,KAAK,qBAAqB;AAC1B,WAAK,mBAAmB,KAAK,UAAU,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,EAAE,IAAI;AAC/E,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,UAAU,OAAO,QAAQ,UAAU,WAAW;AAC1C,WAAO,KAAK,YAAY,OAAO,QAAQ,IACjC,KAAK,aAAa,OAAO,QAAQ,SAAS,IAC1C,KAAK,MAAM,OAAO,QAAQ,SAAS;AAAA,EAC7C;AAAA,EACA,UAAU,OAAO,QAAQ,WAAW;AAChC,SAAK,YAAY,KAAK;AACtB,QAAI,CAACa,UAAS,MAAM;AAChB,YAAM,IAAI,MAAM,gBAAgB;AACpC,UAAM,IAAI,cAAc,KAAK;AAQ7B,QAAI,MAAM,KAAK,UAAU,KAAK,MAAM,GAAG;AACnC,aAAO,aAAa,KAAK,OAAO,CAAC,KAAK,GAAG,CAAC,MAAM,GAAG,IAAI;AAI3D,UAAM,cAAc,KAAK,mBAAmB,GAAG,OAAO,KAAK,MAAM,SAAS;AAC1E,WAAO,KAAK,aAAa,aAAa,MAAM,EAAE;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,OAAO,GAAG;AACpB,SAAK,YAAY,KAAK;AACtB,IAAAN,WAAU,GAAG,KAAK,IAAI;AAEtB,UAAM,UAAU,KAAK,MAAM,KAAK,OAAO,cAAc,CAAC,IAAI;AAC1D,uBAAmB,UAAU,MAAM,IAAI,IAAI,KAAK,MAAM,GAAG,KAAK;AAC9D,IAAAO,kBAAiB,IAAI,OAAO,CAAC;AAC7B,SAAK,gBAAgB,OAAO,KAAK;AAAA,EACrC;AAAA;AAAA,EAEA,cAAc,OAAO;AACjB,WAAO,cAAc,KAAK,MAAM;AAAA,EACpC;AACJ;AA6BO,SAAS,aAAa,GAAG,QAAQ,SAAS,iBAAiB,OAAO;AACrE,oBAAkB,CAAC;AACnB,EAAAT,mBAAkB,QAAQ,CAAC;AAC3B,QAAM,gBAAgB,gBAAgB;AAEtC,EAAAK,oBAAmB,SAAS,EAAE,IAAI,iBAAiB,EAAE,GAAG,SAAST,OAAM,MAAS;AAChF,MAAI,OAAO,WAAW,QAAQ;AAC1B,UAAM,IAAI,MAAM,qDAAqD;AACzE,QAAM,SAAS,OAAO,IAAI,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AACnD,QAAM,SAAS,QAAQ,IAAI,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAClD,SAAO,SAAS,EAAE,MAAM,QAAQ,MAAM;AAC1C;AAsHA,SAASiB,aAAY,OAAO,OAAOC,OAAM;AACrC,MAAI,OAAO;AAIP,QAAI,MAAM,UAAU;AAChB,YAAM,IAAI,MAAM,gDAAgD;AACpE,IAAAC,eAAc,KAAK;AACnB,WAAO;AAAA,EACX,OACK;AACD,WAAOC,OAAM,OAAO,EAAE,MAAAF,MAAK,CAAC;AAAA,EAChC;AACJ;AA4BO,SAAS,kBAAkB,MAAM,OAAO,YAAY,CAAC,GAAG,QAAQ;AACnE,MAAI,SAAS,iBAAiB,SAAS;AACnC,UAAM,IAAI,MAAM,gDAAgD;AACpE,MAAI,WAAW;AACX,aAAS,SAAS;AACtB,MAAI,CAAC,SAAS,OAAO,UAAU;AAC3B,UAAM,IAAI,MAAM,kBAAkB,IAAI,eAAe;AAEzD,EAAAG,gBAAe,SAAS;AACxB,aAAW,KAAK,CAAC,KAAK,KAAK,GAAG,GAAG;AAC7B,UAAM,MAAM,MAAM,CAAC;AACnB,QAAI,EAAEC,UAAS,GAAG,KAAK,QAAQC;AAC3B,YAAM,IAAI,MAAM,SAAS,CAAC,0BAA0B;AAAA,EAC5D;AACA,QAAMC,MAAKP,aAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,QAAMQ,MAAKR,aAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,QAAM,KAAK,SAAS,gBAAgB,MAAM;AAC1C,QAAM,SAAS,CAAC,MAAM,MAAM,KAAK,EAAE;AACnC,aAAW,KAAK,QAAQ;AAEpB,QAAI,CAACO,IAAG,QAAQ,MAAM,CAAC,CAAC;AACpB,YAAM,IAAI,MAAM,SAAS,CAAC,0CAA0C;AAAA,EAC5E;AACA,UAAQ,OAAO,OAAO,OAAO,OAAO,CAAC,GAAG,KAAK,CAAC;AAC9C,SAAO,EAAE,OAAO,IAAAA,KAAI,IAAAC,IAAG;AAC3B;AAeO,SAAS,aAAa,iBAAiB,cAAc;AACxD,SAAO,SAAS,OAAO,MAAM;AACzB,UAAMC,aAAY,gBAAgB,IAAI;AACtC,WAAO,EAAE,WAAAA,YAAW,WAAW,aAAaA,UAAS,EAAE;AAAA,EAC3D;AACJ;;;ACnuBA,IAAMC,QAAsB,uBAAO,CAAC;AAApC,IAAuCC,QAAsB,uBAAO,CAAC;AAArE,IAAwEC,OAAsB,uBAAO,CAAC;AAAtG,IAAyGC,OAAsB,uBAAO,CAAC;AAAvI,IAA0IC,OAAsB,uBAAO,CAAC;AAGxK,SAASC,aAAYC,KAAI,OAAO,GAAG,GAAG;AAClC,QAAM,KAAKA,IAAG,IAAI,CAAC;AACnB,QAAM,KAAKA,IAAG,IAAI,CAAC;AACnB,QAAM,OAAOA,IAAG,IAAIA,IAAG,IAAI,MAAM,GAAG,EAAE,GAAG,EAAE;AAC3C,QAAM,QAAQA,IAAG,IAAIA,IAAG,KAAKA,IAAG,IAAI,MAAM,GAAGA,IAAG,IAAI,IAAI,EAAE,CAAC,CAAC;AAC5D,SAAOA,IAAG,IAAI,MAAM,KAAK;AAC7B;AAsBO,SAASC,SAAQ,QAAQ,YAAY,CAAC,GAAG;AAC5C,EAAAC,gBAAe,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW;AAC7C,QAAM,OAAO;AACb,QAAM,YAAY,kBAAkB,WAAW,QAAQ,MAAM,KAAK,MAAM;AACxE,QAAM,EAAE,IAAAF,KAAI,IAAAG,IAAG,IAAI;AACnB,MAAI,QAAQ,UAAU;AACtB,QAAM,EAAE,GAAG,SAAS,IAAI;AAMxB,MAAIC,YAAWJ,KAAI,MAAM,CAAC,MAAM;AAC5B,UAAM,IAAI,MAAM,wEAAwE;AAC5F,MAAII,YAAWJ,KAAI,MAAM,CAAC,MAAM;AAC5B,UAAM,IAAI,MAAM,4EAA4E;AAChG,EAAAE,gBAAe,MAAM,CAAC,GAAG,EAAE,SAAS,YAAY,aAAa,WAAW,CAAC;AACzE,QAAMG,eAAc,KAAK,gBAAgB,SAAYA,eAAgB,KAAK;AAE1E,QAAM,OAAOT,QAAQ,OAAOI,IAAG,QAAQ,CAAC,IAAIL;AAC5C,WAAS,MAAM,GAAG;AACd,QAAI,CAACK,IAAG;AACJ,YAAM,IAAI,MAAM,8BAA8B;AAClD,WAAOA,IAAG,MAAM,CAAC;AAAA,EACrB;AAEA,QAAMM,WAAU,KAAK,YAAY,SAC3B,CAAC,GAAG,MAAM;AACR,QAAI;AACA,aAAO,EAAE,SAAS,MAAM,OAAON,IAAG,KAAKA,IAAG,IAAI,GAAG,CAAC,CAAC,EAAE;AAAA,IACzD,SACO,GAAG;AACN,aAAO,EAAE,SAAS,OAAO,OAAON,MAAI;AAAA,IACxC;AAAA,EACJ,IACE,KAAK;AAGX,MAAI,CAACK,aAAYC,KAAI,OAAO,MAAM,IAAI,MAAM,EAAE;AAC1C,UAAM,IAAI,MAAM,mCAAmC;AAIvD,QAAM,OAAOA,IAAG,IAAI,MAAM,GAAGA,IAAG,IAAIA,IAAG,GAAG,CAAC,IAAI,CAAC,MAAMA,IAAG,IAAI,CAAC,IACxDA,IAAG,IAAI,MAAM,GAAGA,IAAG,GAAG,IAAI,CAAC,MAAM,IAC7B,CAAC,MAAMA,IAAG,IAAI,MAAM,GAAG,CAAC;AAKlC,WAAS,OAAO,OAAO,GAAG,UAAU,OAAO;AACvC,UAAM,MAAM,UAAUL,QAAMD;AAC5B,IAAAa,UAAS,gBAAgB,OAAO,GAAG,KAAK,IAAI;AAC5C,WAAO;AAAA,EACX;AACA,WAAS,SAAS,OAAO;AACrB,QAAI,EAAE,iBAAiB;AACnB,YAAM,IAAI,MAAM,uBAAuB;AAAA,EAC/C;AAAA,EAGA,MAAM,MAAM;AAAA,IACR,OAAO,OAAO,IAAI,MAAM,MAAM,IAAI,MAAM,IAAIP,IAAG,KAAKA,IAAG,IAAI,MAAM,IAAI,MAAM,EAAE,CAAC;AAAA,IAC9E,OAAO,OAAO,IAAI,MAAMA,IAAG,MAAMA,IAAG,KAAKA,IAAG,KAAKA,IAAG,IAAI;AAAA,IACxD,OAAO,KAAKA;AAAA,IACZ,OAAO,KAAKG;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,GAAG,GAAG,GAAG,GAAG;AACpB,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,WAAK,IAAI,OAAO,KAAK,GAAG,IAAI;AAC5B,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,aAAO,OAAO,IAAI;AAAA,IACtB;AAAA,IACA,OAAO,QAAQ;AACX,aAAO;AAAA,IACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,OAAO,WAAW,GAAG;AACjB,UAAI,aAAa;AACb,cAAM,IAAI,MAAM,4BAA4B;AAChD,YAAM,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC;AACvB,aAAO,KAAK,CAAC;AACb,aAAO,KAAK,CAAC;AACb,aAAO,IAAI,MAAM,GAAG,GAAGH,IAAG,KAAKA,IAAG,IAAI,GAAG,CAAC,CAAC;AAAA,IAC/C;AAAA;AAAA,IAEA,OAAO,UAAU,OAAO,SAAS,OAAO;AACpC,YAAM,MAAMA,IAAG;AACf,YAAM,EAAE,GAAG,EAAE,IAAI;AACjB,cAAQQ,WAAUC,QAAO,OAAO,KAAK,OAAO,CAAC;AAC7C,YAAM,QAAQ,QAAQ;AACtB,YAAM,SAASD,WAAU,KAAK;AAC9B,YAAM,WAAW,MAAM,MAAM,CAAC;AAC9B,aAAO,MAAM,CAAC,IAAI,WAAW,CAAC;AAC9B,YAAM,IAAIE,iBAAgB,MAAM;AAKhC,YAAM,MAAM,SAAS,OAAOV,IAAG;AAC/B,MAAAO,UAAS,WAAW,GAAGb,OAAK,GAAG;AAG/B,YAAM,KAAKM,IAAG,IAAI,CAAC;AACnB,YAAM,IAAIA,IAAG,IAAI,IAAIA,IAAG,GAAG;AAC3B,YAAM,IAAIA,IAAG,IAAIA,IAAG,KAAK,GAAG,EAAE,GAAG,CAAC;AAClC,UAAI,EAAE,SAAAW,UAAS,OAAO,EAAE,IAAIL,SAAQ,GAAG,CAAC;AACxC,UAAI,CAACK;AACD,cAAM,IAAI,MAAM,iCAAiC;AACrD,YAAM,SAAS,MAAM,CAAC;AACtB,YAAM,iBAAiB,WAAW,SAAU;AAC5C,UAAI,CAAC,UAAUX,IAAG,IAAI,CAAC,KAAK;AAExB,cAAM,IAAI,MAAM,0BAA0B;AAC9C,UAAI,kBAAkB;AAClB,YAAIA,IAAG,IAAI,CAAC;AAChB,aAAO,MAAM,WAAW,EAAE,GAAG,EAAE,CAAC;AAAA,IACpC;AAAA,IACA,OAAO,QAAQ,KAAK,SAAS,OAAO;AAChC,aAAO,MAAM,UAAUY,YAAW,GAAG,GAAG,MAAM;AAAA,IAClD;AAAA,IACA,IAAI,IAAI;AACJ,aAAO,KAAK,SAAS,EAAE;AAAA,IAC3B;AAAA,IACA,IAAI,IAAI;AACJ,aAAO,KAAK,SAAS,EAAE;AAAA,IAC3B;AAAA,IACA,WAAW,aAAa,GAAG,SAAS,MAAM;AACtC,WAAK,cAAc,MAAM,UAAU;AACnC,UAAI,CAAC;AACD,aAAK,SAAShB,IAAG;AACrB,aAAO;AAAA,IACX;AAAA;AAAA,IAEA,iBAAiB;AACb,YAAM,IAAI;AACV,YAAM,EAAE,GAAG,EAAE,IAAI;AAKjB,UAAI,EAAE,IAAI;AACN,cAAM,IAAI,MAAM,iBAAiB;AAGrC,YAAM,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI;AACvB,YAAM,KAAKI,IAAG,IAAI,CAAC;AACnB,YAAM,KAAKA,IAAG,IAAI,CAAC;AACnB,YAAM,KAAKA,IAAG,IAAI,CAAC;AACnB,YAAM,KAAKA,IAAG,IAAI,EAAE;AACpB,YAAM,MAAMA,IAAG,IAAI,IAAI,CAAC;AACxB,YAAM,OAAOA,IAAG,IAAIA,IAAG,IAAI,KAAK,EAAE,GAAG,EAAE;AACvC,YAAM,QAAQA,IAAG,IAAI,IAAIA,IAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,EAAE,CAAC,CAAC;AAClD,UAAI,CAACA,IAAG,IAAI,MAAM,KAAK;AACnB,cAAM,IAAI,MAAM,uCAAuC;AAE3D,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,UAAI,CAACA,IAAG,IAAI,IAAI,EAAE;AACd,cAAM,IAAI,MAAM,uCAAuC;AAAA,IAC/D;AAAA;AAAA,IAEA,OAAO,OAAO;AACV,eAAS,KAAK;AACd,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI;AAChC,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI;AAChC,YAAM,OAAOA,IAAG,IAAI,IAAI,EAAE;AAC1B,YAAM,OAAOA,IAAG,IAAI,IAAI,EAAE;AAC1B,YAAM,OAAOA,IAAG,IAAI,IAAI,EAAE;AAC1B,YAAM,OAAOA,IAAG,IAAI,IAAI,EAAE;AAC1B,aAAOA,IAAG,IAAI,MAAM,IAAI,KAAKA,IAAG,IAAI,MAAM,IAAI;AAAA,IAClD;AAAA,IACA,MAAM;AACF,aAAO,KAAK,OAAO,MAAM,IAAI;AAAA,IACjC;AAAA,IACA,SAAS;AAEL,aAAO,IAAI,MAAMA,IAAG,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,GAAGA,IAAG,IAAI,KAAK,CAAC,CAAC;AAAA,IACnE;AAAA;AAAA;AAAA;AAAA,IAIA,SAAS;AACL,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI;AAChC,YAAM,IAAIA,IAAG,IAAI,EAAE;AACnB,YAAM,IAAIA,IAAG,IAAI,EAAE;AACnB,YAAM,IAAIA,IAAG,IAAIA,IAAG,IAAI,EAAE,GAAGJ,IAAG;AAChC,YAAM,IAAI,KAAK,CAAC;AAChB,YAAM,OAAOI,IAAG,KAAK,IAAI,EAAE;AAC3B,YAAM,IAAIA,IAAG,IAAIA,IAAG,KAAKA,IAAG,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC;AAC5C,YAAM,IAAIA,IAAG,KAAK,GAAG,CAAC;AACtB,YAAM,IAAIA,IAAG,KAAK,GAAG,CAAC;AACtB,YAAM,IAAIA,IAAG,KAAK,GAAG,CAAC;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,aAAO,IAAI,MAAM,IAAI,IAAI,IAAI,EAAE;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA,IAIA,IAAI,OAAO;AACP,eAAS,KAAK;AACd,YAAM,EAAE,EAAE,IAAI;AACd,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI;AACvC,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI;AACvC,YAAM,IAAIA,IAAG,IAAI,IAAI,EAAE;AACvB,YAAM,IAAIA,IAAG,IAAI,IAAI,EAAE;AACvB,YAAM,IAAIA,IAAG,IAAIA,IAAG,KAAK,IAAI,CAAC,GAAG,EAAE;AACnC,YAAM,IAAIA,IAAG,IAAI,IAAI,EAAE;AAEvB,YAAM,IAAIA,IAAG,IAAIA,IAAG,KAAKA,IAAG,KAAKA,IAAG,KAAK,IAAI,EAAE,GAAGA,IAAG,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC;AACzE,YAAM,IAAIA,IAAG,KAAK,GAAG,CAAC;AACtB,YAAM,IAAIA,IAAG,KAAK,GAAG,CAAC;AACtB,YAAM,IAAIA,IAAG,IAAI,GAAG,KAAK,CAAC,CAAC;AAC3B,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,aAAO,IAAI,MAAM,IAAI,IAAI,IAAI,EAAE;AAAA,IACnC;AAAA,IACA,SAAS,OAAO;AAGZ,eAAS,KAAK;AACd,aAAO,KAAK,IAAI,MAAM,OAAO,CAAC;AAAA,IAClC;AAAA;AAAA,IAEA,SAAS,QAAQ;AAKb,UAAI,CAACG,IAAG,YAAY,MAAM;AACtB,cAAM,IAAI,WAAW,4CAA4C;AACrE,YAAM,EAAE,GAAG,EAAE,IAAI,KAAK,UAAU,MAAM,QAAQ,UAAU,SAAS;AACjE,aAAO,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,eAAe,QAAQ;AAEnB,UAAI,CAACA,IAAG,QAAQ,MAAM;AAClB,cAAM,IAAI,WAAW,4CAA4C;AACrE,UAAI,WAAWT;AACX,eAAO,MAAM;AACjB,UAAI,KAAK,IAAI,KAAK,WAAWC;AACzB,eAAO;AACX,aAAO,KAAK,UAAU,MAAM,QAAQ,SAAS;AAAA,IACjD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,eAAe;AACX,aAAO,KAAK,cAAc,EAAE,IAAI;AAAA,IACpC;AAAA;AAAA;AAAA,IAGA,gBAAgB;AACZ,aAAO,KAAK,UAAU,MAAM,MAAM,CAAC,EAAE,IAAI;AAAA,IAC7C;AAAA;AAAA;AAAA,IAGA,SAAS,WAAW;AAChB,YAAM,IAAI;AACV,UAAI,KAAK;AACT,UAAI,MAAM,QAAQ,OAAO,OAAO;AAC5B,cAAM,IAAI,UAAU,2CAA2C,OAAO,EAAE;AAC5E,YAAM,EAAE,GAAG,GAAG,EAAE,IAAI;AACpB,YAAM,MAAM,EAAE,IAAI;AAClB,UAAI,MAAM;AACN,aAAK,MAAMK,IAAG,OAAOF,IAAG,IAAIE,IAAG,IAAI,CAAC;AACxC,YAAM,IAAIA,IAAG,IAAI,GAAG,EAAE;AACtB,YAAM,IAAIA,IAAG,IAAI,GAAG,EAAE;AACtB,YAAM,KAAKA,IAAG,IAAI,GAAG,EAAE;AACvB,UAAI;AACA,eAAO,EAAE,GAAGA,IAAG,MAAM,GAAGA,IAAG,IAAI;AACnC,UAAI,CAACA,IAAG,IAAI,IAAIA,IAAG,GAAG;AAClB,cAAM,IAAI,MAAM,kBAAkB;AACtC,aAAO,EAAE,GAAG,EAAE;AAAA,IAClB;AAAA,IACA,gBAAgB;AACZ,UAAI,aAAaL;AACb,eAAO;AAEX,UAAI,aAAaC;AACb,eAAO,KAAK,OAAO;AACvB,UAAI,aAAaC;AACb,eAAO,KAAK,OAAO,EAAE,OAAO;AAChC,UAAI,aAAaC;AACb,eAAO,KAAK,OAAO,EAAE,OAAO,EAAE,OAAO;AACzC,aAAO,KAAK,eAAe,QAAQ;AAAA,IACvC;AAAA,IACA,UAAU;AACN,YAAM,EAAE,GAAG,EAAE,IAAI,KAAK,SAAS;AAE/B,YAAM,QAAQE,IAAG,QAAQ,CAAC;AAG1B,YAAM,MAAM,SAAS,CAAC,KAAK,MAAM,CAAC,IAAI,MAAO;AAC7C,aAAO;AAAA,IACX;AAAA,IACA,QAAQ;AACJ,aAAOa,YAAW,KAAK,QAAQ,CAAC;AAAA,IACpC;AAAA,IACA,WAAW;AACP,aAAO,UAAU,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,CAAC;AAAA,IACvD;AAAA,EACJ;AAUA,QAAM,YAAY,CAAC,WAAWC,YAAW,OAAO,MAAM;AACtD,QAAM,OAAO,IAAI,iBAAiB,OAAOT,YAAW;AAGpD,MAAI,KAAK,QAAQ;AACb,UAAM,KAAK,WAAW,CAAC;AAC3B,SAAO,OAAO,MAAM,SAAS;AAC7B,SAAO,OAAO,KAAK;AACnB,SAAO;AACX;;;ACrXA,IAAMU,QAAsB,uBAAO,CAAC;AACpC,IAAMC,QAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AAsBpC,SAAS,MAAM,GAAG,MAAM;AACpB,SAAO,IAAI,QAAS,QAAQD,SAAQA;AACxC;AAkCA,SAAS,MAAM,GAAG;AACd,QAAM,SAAS,OAAO,CAAC,IAAI;AAC3B,SAAO,CAAC,MAAM,KAAK,QAAQ;AACvB,UAAM,MAAM,MAAM;AAClB,UAAM,IAAI,SAAS,MAAM;AACzB,UAAM,KAAK,IAAI,OAAO,OAAO;AAC7B,WAAO,EAAE,KAAK,GAAG,KAAK,MAAM,EAAE;AAAA,EAClC;AACJ;AAMA,SAASE,cAAa,OAAO;AAIzB,EAAAC,gBAAe,OAAO;AAAA,IAClB,GAAG;AAAA,IACH,MAAM;AAAA,IACN,mBAAmB;AAAA,IACnB,YAAY;AAAA,EAChB,GAAG;AAAA,IACC,aAAa;AAAA,IACb,gBAAgB;AAAA,EACpB,CAAC;AACD,SAAO,OAAO,OAAO,EAAE,GAAG,MAAM,CAAC;AACrC;AAuCO,SAASC,YAAW,UAAU;AACjC,QAAM,QAAQF,cAAa,QAAQ;AACnC,QAAM,EAAE,GAAG,MAAM,mBAAAG,oBAAmB,YAAY,aAAa,KAAK,IAAI;AACtE,QAAM,cAAc,MAAM;AAC1B,QAAM,UAAU,SAAS;AACzB,MAAI,CAAC,WAAW,SAAS;AACrB,UAAM,IAAI,MAAM,cAAc;AAClC,QAAM,eAAe,SAAS,SAAYC,eAAc;AACxD,QAAM,iBAAiB,UAAU,MAAM;AACvC,QAAM,OAAO,MAAM,CAAC;AACpB,QAAM,WAAW,UAAU,KAAK;AAChC,QAAM,KAAK,UAAU,OAAO,CAAC,IAAI,OAAO,CAAC;AAKzC,QAAM,MAAM,UAAU,OAAO,MAAM,IAAI,OAAO,KAAK;AAInD,QAAM,YAAY,UAAUC,QAAO,OAAO,GAAG,IAAIA,QAAO,OAAO,GAAG;AAClE,QAAM,WAAW,UACX,OAAO,CAAC,KAAKA,QAAO,OAAO,GAAG,IAAIC,SAClC,OAAO,CAAC,KAAKD,QAAO,OAAO,GAAG,IAAIC;AACxC,QAAM,YAAY,YAAY,WAAWA;AACzC,QAAM,OAAO,CAAC,MAAMC,KAAI,GAAG,CAAC;AAC5B,QAAM,UAAU,QAAQ,EAAE;AAC1B,WAAS,QAAQ,GAAG;AAChB,WAAOC,iBAAgB,KAAK,CAAC,GAAG,QAAQ;AAAA,EAC5C;AACA,WAAS,QAAQ,GAAG;AAChB,UAAM,KAAKC,WAAUC,QAAO,GAAG,UAAU,aAAa,CAAC;AAGvD,QAAI;AACA,SAAG,EAAE,KAAK;AAKd,WAAO,KAAKC,iBAAgB,EAAE,CAAC;AAAA,EACnC;AACA,WAAS,aAAa,QAAQ;AAC1B,WAAOA,iBAAgBR,mBAAkBM,WAAUC,QAAO,QAAQ,UAAU,QAAQ,CAAC,CAAC,CAAC;AAAA,EAC3F;AAaA,QAAM,YAAY,IAAI,IAAI,UACpB;AAAA,IACEE;AAAA,IACAN;AAAA,IACA,IAAIA;AAAA,IACJ,OAAO,6EAA6E;AAAA,IACpF,OAAO,+EAA+E;AAAA,EAC1F,IACE,CAACM,OAAKN,OAAK,IAAIA,KAAG,CAAC;AACzB,WAAS,WAAW,QAAQ,GAAG;AAU3B,UAAM,SAAS,QAAQ,CAAC;AACxB,QAAI,UAAU,IAAI,MAAM;AACpB,YAAM,IAAI,MAAM,wCAAwC;AAC5D,UAAM,KAAK,iBAAiB,QAAQ,aAAa,MAAM,CAAC;AAGxD,QAAI,OAAOM;AACP,YAAM,IAAI,MAAM,wCAAwC;AAC5D,WAAO,QAAQ,EAAE;AAAA,EACrB;AAIA,WAAS,eAAe,QAAQ;AAC5B,QAAI,gBAAgB;AAChB,aAAO,WAAW,QAAQ,OAAO;AACrC,UAAM,IAAI,aAAa,MAAM;AAC7B,IAAAC,UAAS,UAAU,GAAG,WAAW,SAAS;AAC1C,UAAM,KAAK,KAAK,YAAY,CAAC,CAAC;AAC9B,QAAI,OAAOD;AACP,YAAM,IAAI,MAAM,wCAAwC;AAC5D,WAAO,QAAQ,EAAE;AAAA,EACrB;AACA,QAAM,eAAe;AACrB,QAAM,kBAAkB;AAOxB,WAAS,iBAAiB,GAAG,QAAQ;AACjC,IAAAC,UAAS,KAAK,GAAGD,OAAK,CAAC;AACvB,IAAAC,UAAS,UAAU,QAAQ,WAAW,SAAS;AAC/C,UAAM,IAAI;AACV,UAAM,MAAM;AACZ,QAAI,MAAMP;AACV,QAAI,MAAMM;AACV,QAAI,MAAM;AACV,QAAI,MAAMN;AAKV,UAAM,KAAK,IAAK,KAAKA;AACrB,aAAS,IAAI,OAAO,iBAAiB,CAAC,GAAG,KAAKM,OAAK,KAAK;AACpD,YAAME,QAAO,MAAM,GAAG,MAAM,CAAC;AAC7B,OAAC,EAAE,KAAK,IAAI,IAAI,KAAKA,OAAM,KAAK,GAAG;AACnC,OAAC,EAAE,KAAK,KAAK,KAAK,IAAI,IAAI,KAAKA,OAAM,KAAK,GAAG;AAC7C,YAAM,IAAI,MAAM;AAChB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,IAAI,MAAM;AAChB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,IAAI,KAAK;AACf,YAAM,IAAI,MAAM;AAChB,YAAM,IAAI,MAAM;AAChB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,OAAO,KAAK;AAClB,YAAM,QAAQ,KAAK;AACnB,YAAM,KAAK,OAAO,IAAI;AACtB,YAAM,KAAK,MAAM,KAAK,QAAQ,KAAK,CAAC;AACpC,YAAM,KAAK,KAAK,EAAE;AAClB,YAAM,KAAK,KAAK,KAAK,KAAK,MAAM,CAAC,EAAE;AAAA,IACvC;AAEA,UAAM,OAAO,MAAM,GAAG,CAAC;AACvB,KAAC,EAAE,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,GAAG;AACnC,KAAC,EAAE,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,GAAG;AAC7C,UAAM,KAAK,WAAW,GAAG;AACzB,WAAO,KAAK,MAAM,EAAE;AAAA,EACxB;AACA,QAAM,UAAU;AAAA,IACZ,WAAW;AAAA,IACX,WAAW;AAAA,IACX,MAAM;AAAA,EACV;AACA,QAAM,kBAAkB,CAAC,SAAS;AAC9B,WAAO,SAAS,SAAY,aAAa,QAAQ,IAAI;AACrD,IAAAJ,QAAO,MAAM,QAAQ,MAAM,MAAM;AAGjC,WAAO;AAAA,EACX;AACA,QAAM,QAAQ,EAAE,gBAAgB;AAChC,SAAO,OAAO,OAAO;AACrB,SAAO,OAAO,KAAK;AACnB,SAAO,OAAO,OAAO;AAAA,IACjB,QAAQ,aAAa,iBAAiB,YAAY;AAAA,IAClD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,QAAQ,MAAM;AAAA,IACvB;AAAA,EACJ,CAAC;AACL;;;ACnSA,IAAMK,QAAsB,uBAAO,CAAC;AAApC,IAAuCC,QAAsB,uBAAO,CAAC;AAArE,IAAwEC,OAAsB,uBAAO,CAAC;AAAtG,IAAyGC,OAAsB,uBAAO,CAAC;AAEvI,IAAMC,OAAsB,uBAAO,CAAC;AAApC,IAAuCC,OAAsB,uBAAO,CAAC;AAErE,IAAMC,mBAAkC,uBAAO,oEAAoE;AAInH,IAAMC,iBAAiC,wBAAO;AAAA,EAC1C,GAAGD;AAAA,EACH,GAAG,OAAO,oEAAoE;AAAA,EAC9E,GAAGD;AAAA,EACH,GAAG,OAAO,oEAAoE;AAAA,EAC9E,GAAG,OAAO,oEAAoE;AAAA,EAC9E,IAAI,OAAO,oEAAoE;AAAA,EAC/E,IAAI,OAAO,oEAAoE;AACnF,IAAI;AACJ,SAASG,qBAAoB,GAAG;AAE5B,QAAM,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAC/E,QAAM,IAAIF;AACV,QAAM,KAAM,IAAI,IAAK;AACrB,QAAM,KAAM,KAAK,IAAK;AACtB,QAAM,KAAMG,MAAK,IAAIP,MAAK,CAAC,IAAI,KAAM;AACrC,QAAM,KAAMO,MAAK,IAAIR,OAAK,CAAC,IAAI,IAAK;AACpC,QAAM,MAAOQ,MAAK,IAAIL,MAAK,CAAC,IAAI,KAAM;AACtC,QAAM,MAAOK,MAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAOA,MAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAOA,MAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,OAAQA,MAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AAC1C,QAAM,OAAQA,MAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AAC3C,QAAM,OAAQA,MAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AAC3C,QAAM,YAAaA,MAAK,MAAMP,MAAK,CAAC,IAAI,IAAK;AAE7C,SAAO,EAAE,WAAW,GAAG;AAC3B;AAEA,SAASQ,mBAAkB,OAAO;AAG9B,QAAM,CAAC,KAAK;AAEZ,QAAM,EAAE,KAAK;AAEb,QAAM,EAAE,KAAK;AACb,SAAO;AACX;AAGA,IAAMC,mBAAkC,uBAAO,+EAA+E;AAG9H,SAASC,SAAQ,GAAG,GAAG;AACnB,QAAM,IAAIN;AACV,QAAM,KAAKO,KAAI,IAAI,IAAI,GAAG,CAAC;AAC3B,QAAM,KAAKA,KAAI,KAAK,KAAK,GAAG,CAAC;AAE7B,QAAMC,OAAMN,qBAAoB,IAAI,EAAE,EAAE;AACxC,MAAI,IAAIK,KAAI,IAAI,KAAKC,MAAK,CAAC;AAC3B,QAAM,MAAMD,KAAI,IAAI,IAAI,GAAG,CAAC;AAC5B,QAAM,QAAQ;AACd,QAAM,QAAQA,KAAI,IAAIF,kBAAiB,CAAC;AACxC,QAAM,WAAW,QAAQ;AACzB,QAAM,WAAW,QAAQE,KAAI,CAAC,GAAG,CAAC;AAClC,QAAM,SAAS,QAAQA,KAAI,CAAC,IAAIF,kBAAiB,CAAC;AAClD,MAAI;AACA,QAAI;AACR,MAAI,YAAY;AACZ,QAAI;AACR,MAAII,cAAa,GAAG,CAAC;AACjB,QAAIF,KAAI,CAAC,GAAG,CAAC;AACjB,SAAO,EAAE,SAAS,YAAY,UAAU,OAAO,EAAE;AACrD;AACA,IAAM,gBAAgC,gBAAAG,SAAQT,gBAAe,EAAE,SAAAK,SAAQ,CAAC;AAuHjE,IAAMK,UAA0B,uBAAM;AACzC,QAAM,IAAIC;AACV,QAAM,aAAa,CAAC,MAAM;AAEtB,UAAM,EAAE,WAAW,GAAG,IAAIC,qBAAoB,CAAC;AAC/C,WAAOC,KAAIC,MAAK,WAAWC,MAAK,CAAC,IAAI,IAAI,CAAC;AAAA,EAC9C;AACA,SAAOC,YAAW;AAAA,IACd;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA,mBAAAC;AAAA;AAAA;AAAA;AAAA,IAIA,gBAAgB,CAAC,MAAM;AAEnB,YAAM,KAAKJ,KAAI,GAAG,cAAc,GAAG,KAAK;AAGxC,UAAI,OAAOK;AACP,eAAOA;AACX,YAAM,IAAI,cAAc,KAAK,SAAS,EAAE;AAExC,aAAOL,MAAK,EAAE,IAAI,EAAE,KAAK,WAAWA,KAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAAA,IAC7D;AAAA,EACJ,CAAC;AACL,GAAG;;;AC5OH,IAAM,KAAK;AAEJ,IAAM,cAAc;AAIrB,SAAU,aAAa,KAA8B;AACzD,QAAM,KAAK,IAAI,EAAE;AACjB,SAAO,EAAE,WAAW,IAAI,WAAWM,QAAO,aAAa,EAAE,EAAC;AAC5D;AAEM,SAAU,SAAS,QAAoB,UAAoB;AAC/D,SAAOA,QAAO,gBAAgB,QAAQ,QAAQ;AAChD;AAEM,SAAU,cAAW;AACzB,SAAO;AACT;;;ACdM,SAAU,eACd,aACA,QACA,MAAc;AAEd,SAAO,SAAS,WAAW,IAAI,WAAW,IAAI,OAAO,IAAI,IAAI,KAAK,IAAI;AACxE;;;ACYA,IAAMC,MAAK,MAAM,YAAW;AAEtB,IAAO,cAAP,MAAkB;EAcH;EACA;EAdX;EACA;EACA;EACA;EACA;EACA;EACA,wBAAwB;EACxB,wBAAwB;EACxB,OAAqB,CAAA;EACrB,aAAa;EACb,uBAAuB;EAE/B,YACmB,SACA,QAAyB;AADzB,SAAA,UAAA;AACA,SAAA,SAAA;AAEjB,QAAI,QAAQ,QAAO,MAAE,GAAuB;AAC1C,YAAM,IAAI,eAAe,gBAAgB;IAC3C;AACA,UAAMC,QAAO,eACX,QAAQ,QAAO,GACf,OAAO,QACP,OAAO,IAAI;AAEb,SAAK,YAAY,IAAI,eAAe,OAAO,QAAQ,OAAO,MAAMA,KAAI;AACpE,SAAK,UAAU,QAAQ,OAAO,QAAQ;AAEtC,UAAM,IAAI,OAAO;AACjB,eAAW,KAAK,QAAQ,sBAAqB,GAAI;AAC/C,UAAI,MAAC,GAAc;AACjB,aAAK,UAAU,SACZ,IACG,OAAO,GAAG,YACV,OAAO,OAAO,aAAY,CAAE;MAEpC,OAAO;AACL,cAAM,IAAI,MAAM,qCAAqC;MACvD;IACF;AACA,eAAW,KAAK,QAAQ,sBAAqB,GAAI;AAC/C,UAAI,MAAC,GAAc;AACjB,aAAK,UAAU,SACZ,IACG,OAAO,KACP,OAAO,GAAG,cAAc,aAAY,CAAE;MAE9C,WAAW,MAAC,GAAc;AACxB,YAAI,GAAG;AACL,gBAAM,MAAM,OAAO,MAAM,aAAY;AACrC,eAAK,UAAU,QAAQ,GAAG;AAC1B,cAAI,QAAQ,OAAM,GAAI;AACpB,iBAAK,UAAU,OAAO,GAAG;UAC3B;QACF,OAAO;AACL,gBAAM,KAAK,OAAO,GAAG,aAAa,aAAY;AAC9C,eAAK,UAAU,QAAQ,EAAE;AACzB,cAAI,QAAQ,OAAM,GAAI;AACpB,iBAAK,UAAU,OAAO,EAAE;UAC1B;QACF;MACF,OAAO;AACL,cAAM,IAAI,MAAM,qCAAqC;MACvD;IACF;AAEA,SAAK,IAAI,OAAO;AAChB,SAAK,IAAI,OAAO;AAChB,SAAK,KAAK,OAAO;AACjB,SAAK,KAAK,OAAO;AACjB,SAAK,SAAS,OAAO,YAAW,IAAuB;EACzD;EAEA,aAAU;AACR,WAAO,KAAK;EACd;EAEA,cAAW;AACT,WAAO,KAAK,OAAO;EACrB;EAEA,cAAW;AACT,WAAO,KAAK,WAAM;EACpB;EAEA,aAAU;AACR,WAAO,KAAK,WAAM;EACpB;EAEA,QAAQ,MAAgB;AACtB,SAAK,UAAU,QAAQ,IAAI;EAC7B;EAEA,cAAc,MAAgB;AAC5B,SAAK,UAAU,cAAc,IAAI;EACnC;EAEA,QAAQ,KAAe;AACrB,QAAI,IAAI,WAAW,SAAS;AAC1B,YAAM,IAAI,MAAM,eAAe,OAAO,QAAQ;IAChD;AACA,QAAI,KAAK,KAAK,UAAU,UAAU;AAChC,YAAM,IAAI,MAAM,gBAAgB;IAClC;AACA,SAAK,KAAK,KAAK,WAAW,KAAK,GAAG,CAAC;EACrC;EAEA,UAAO;AACL,WAAO,eACL,KAAK,QAAQ,QAAO,GACpB,KAAK,OAAO,QACZ,KAAK,OAAO,IAAI;EAEpB;EAEA,UAAO;AACL,WAAO,KAAK,UAAU,QAAO;EAC/B;EAEA,kBAAe;AACb,WAAO,KAAK,KAAK,WAAW,KAAK,KAAK,EAAE,IAAI;EAC9C;EAEA,qBAAkB;AAChB,WAAO,KAAK,KAAK,WAAW,KAAK,KAAK,EAAE,IAAI;EAC9C;EAEA,aAAU;AACR,QAAI;AACF,aAAO,KAAK,UAAU,MAAK;IAC7B,SAAS,GAAG;AACV,UAAI,aAAa,aAAa;AAC5B,cAAM,IAAI,eAAe,UAAU,QAAW,CAAC;MACjD;AACA,YAAM;IACR;EACF;EAEA,WAAQ;AACN,QAAI,CAAC,KAAK,WAAU,GAAI;AACtB,YAAM,IAAI,eAAe,cAAc;IACzC;AACA,WAAO,IAAI,eAAe;MACxB,SAAS,KAAK;MACd,cAAc,KAAK,WAAU;MAC7B,eAAe,KAAK,QAAO;MAC3B,WAAW,KAAK,YAAW;MAC3B,QAAQ,KAAK,OAAO,OAAO;KAC5B;EACH;EAEQ,2BAAwB;AAC9B,UAAM,IAAI,KAAK,OAAO;AACtB,UAAM,KAAK,KAAK;AAChB,QAAI,OAAE,KAA8B,OAAE,GAA4B;AAChE,YAAM,IAAI,eAAe,cAAc;IACzC;AACA,QAAK,KAAK,OAAE,KAA+B,CAAC,KAAK,OAAE,GAA+B;AAChF,aAAO,KAAK,QAAQ,oBAAoB,KAAK,qBAAqB,KAAK,SAAQ;IACjF;AACA,WAAO,KAAK,QAAQ,oBAAoB,KAAK,qBAAqB,KAAK,SAAQ;EACjF;EAEA,yBAAsB;AACpB,UAAM,UAAU,KAAK,yBAAwB;AAC7C,QAAI,WAAW;AACf,QAAI,SAAS,KAAK,UAAU,OAAM;AAClC,UAAM,SAAS,KAAK,QAAQ,OAAM;AAClC,UAAM,EAAE,QAAQ,EAAC,IAAK,KAAK;AAC3B,UAAM,MAAMD,IAAE;AACd,eAAW,SAAS,SAAS;AAC3B,UAAI,UAAK,GAAc;AACrB,oBAAY;AACZ,YAAI,QAAQ;AACV,mBAAS;QACX;MACF,WAAW,UAAK,GAAc;AAC5B,oBAAY;AACZ,YAAI,QAAQ;AACV,sBAAY,EAAE;QAChB;MACF,WACE,UAAK,KACF,UAAK,KACL,UAAK,KACL,UAAK,GACR;AACA,iBAAS;MACX,WAAW,UAAK,GAAgB;MAEhC,OAAO;AACL,cAAM,IAAI,MAAM,sBAAsB;MACxC;IACF;AACA,QAAI,QAAQ;AACV,kBAAY,EAAE;IAChB;AACA,WAAO;EACT;EAEA,aAAa,SAAqB,KAAe;AAC/C,QAAI,KAAK,WAAM,GAA4B;AACzC,YAAM,IAAI,eAAe,YAAY;IACvC;AACA,QAAI,CAAC,KAAK,YAAW,GAAI;AACvB,YAAM,IAAI,eAAe,cAAc;IACzC;AACA,UAAM,KAAK,KAAK,uBAAsB;AACtC,UAAM,SAAS,QAAQ,SAAS;AAChC,QAAI,SAAS,iBAAiB;AAC5B,YAAM,IAAI,MAAM,uCAAuC;IACzD;AACA,QAAI,IAAI,SAAS,QAAQ;AACvB,YAAM,IAAI,eAAe,gBAAgB;IAC3C;AACA,QAAI;AACF,aAAO,KAAK,iBAAiB,SAAS,KAAK,MAAM;IACnD,SAAS,GAAG;AACV,WAAK,SAAQ;AACb,YAAM;IACR;EACF;EAEA,YAAY,SAAqB,KAAe;AAC9C,QAAI,QAAQ,SAAS,iBAAiB;AACpC,YAAM,IAAI,MAAM,uCAAuC;IACzD;AACA,QAAI,KAAK,WAAM,GAA4B;AACzC,YAAM,IAAI,eAAe,YAAY;IACvC;AACA,QAAI,KAAK,YAAW,GAAI;AACtB,YAAM,IAAI,eAAe,cAAc;IACzC;AACA,UAAM,KAAK,KAAK,uBAAsB;AACtC,QAAI,QAAQ,SAAS,IAAI;AACvB,YAAM,IAAI,eAAe,gBAAgB;IAC3C;AACA,UAAM,SAAS,QAAQ,SAAS;AAChC,QAAI,IAAI,SAAS,QAAQ;AACvB,YAAM,IAAI,eAAe,gBAAgB;IAC3C;AACA,QAAI;AACF,aAAO,KAAK,gBAAgB,SAAS,KAAK,MAAM;IAClD,SAAS,GAAG;AACV,WAAK,SAAQ;AACb,YAAM;IACR;EACF;EAEQ,WAAQ;AACd,SAAK,SAAM;AACX,SAAK,UAAU,QAAO;EACxB;EAEQ,mBAAgB;AACtB,QAAI,KAAK,cAAc,CAAC,KAAK,sBAAsB;AACjD,YAAM,IAAI,eACR,WACA,wBACA,IAAI,aAAa,sBAAsB,CAAC;IAE5C;EACF;EAEQ,UAAO;AACb,UAAM,IAAI,KAAK,KAAK,MAAK;AACzB,QAAI,CAAC,GAAG;AACN,YAAM,IAAI,eAAe,YAAY;IACvC;AACA,SAAK,aAAa;AAClB,WAAO;EACT;EAEQ,MAAM,GAAQ;AACpB,UAAM,QAAQ,CAAC,OAA6B;AAC1C,UAAI,CAAC,IAAI;AACP,cAAM,IAAI,eAAe,iBAAiB;MAC5C;AACA,aAAO;IACT;AACA,UAAM,QAAQ,CAAC,MAA6B;AAC1C,UAAI,CAAC,GAAG;AACN,cAAM,IAAI,eAAe,iBAAiB;MAC5C;AACA,aAAO;IACT;AACA,QAAI;AACJ,QAAI;AACF,UAAI,MAAC,GAAe;AAClB,aAAK,SAAS,MAAM,KAAK,CAAC,EAAE,WAAW,MAAM,KAAK,EAAE,CAAC;MACvD,WAAW,MAAC,GAAe;AACzB,YAAI,KAAK,YAAW,GAAI;AACtB,eAAK,SAAS,MAAM,KAAK,CAAC,EAAE,WAAW,MAAM,KAAK,EAAE,CAAC;QACvD,OAAO;AACL,eAAK,SAAS,MAAM,KAAK,CAAC,EAAE,WAAW,MAAM,KAAK,EAAE,CAAC;QACvD;MACF,WAAW,MAAC,GAAe;AACzB,YAAI,KAAK,YAAW,GAAI;AACtB,eAAK,SAAS,MAAM,KAAK,CAAC,EAAE,WAAW,MAAM,KAAK,EAAE,CAAC;QACvD,OAAO;AACL,eAAK,SAAS,MAAM,KAAK,CAAC,EAAE,WAAW,MAAM,KAAK,EAAE,CAAC;QACvD;MACF,WAAW,MAAC,GAAe;AACzB,aAAK,SAAS,MAAM,KAAK,CAAC,EAAE,WAAW,MAAM,KAAK,EAAE,CAAC;MACvD,OAAO;AACL,cAAM,IAAI,MAAM,OAAO;MACzB;IACF,SAAS,GAAG;AACV,UAAI,aAAa,gBAAgB;AAC/B,cAAM;MACR;AACA,YAAM,IAAI,eAAe,MAAM,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;IAC3E;AACA,QAAI,GAAG,WAAW,IAAI;AACpB,YAAM,IAAI,eAAe,MAAM,8BAA8B;IAC/D;AACA,WAAO;EACT;EAEQ,iBAAc;AACpB,QACE,KAAK,0BAA0B,KAAK,QAAQ,uBAAsB,KAClE,KAAK,0BAA0B,KAAK,QAAQ,uBAAsB,GAClE;AACA,WAAK,SAAM;IACb,WAAW,KAAK,WAAM,GAA8B;AAClD,WAAK,SAAM;IACb,OAAO;AACL,WAAK,SAAM;IACb;EACF;EAEQ,iBACN,SACA,KACA,QAAc;AAEd,UAAM,UAAU,KAAK,YAAW,IAC3B,KAAK,QAAQ,oBAAoB,KAAK,uBAAuB,IAC7D,KAAK,QAAQ,oBAAoB,KAAK,uBAAuB;AAClE,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,eAAe,cAAc;IACzC;AACA,UAAM,EAAE,QAAQ,GAAG,IAAG,IAAK,KAAK;AAChC,UAAM,MAAMA,IAAE;AACd,QAAI,MAAM;AACV,eAAW,SAAS,SAAS;AAC3B,UAAI,UAAK,GAAc;AACrB,YAAI,CAAC,KAAK,GAAG;AACX,eAAK,IAAI,aAAa,GAAG;QAC3B;AACA,cAAM,OAAO,KAAK,EAAE;AACpB,aAAK,UAAU,QAAQ,IAAI;AAC3B,YAAI,KAAK,QAAQ,OAAM,GAAI;AACzB,eAAK,UAAU,OAAO,IAAI;QAC5B;AACA,YAAI,IAAI,MAAM,GAAG;AACjB,eAAO;AACP,aAAK,uBAAuB;MAC9B,WAAW,UAAK,GAAc;AAC5B,YAAI,CAAC,KAAK,GAAG;AACX,gBAAM,IAAI,eAAe,iBAAiB;QAC5C;AACA,aAAK,iBAAgB;AACrB,cAAM,MAAM,KAAK,UAAU,OAAM,IAAK,MAAM,EAAE,SAAS;AACvD,aAAK,UAAU,eACb,KAAK,EAAE,WACP,IAAI,SAAS,KAAK,MAAM,GAAG,CAAC;AAE9B,eAAO;MACT,WAAW,UAAK,GAAgB;AAC9B,aAAK,UAAU,cAAc,KAAK,QAAO,CAAE;MAC7C,WACE,UAAK,KACF,UAAK,KACL,UAAK,KACL,UAAK,GACR;AACA,aAAK,UAAU,OAAO,KAAK,MAAM,KAAK,CAAC;MACzC,OAAO;AACL,cAAM,IAAI,MAAM,sBAAsB;MACxC;IACF;AAEA,QAAI,QAAQ,SAAS,KAAK,KAAK,cAAc,CAAC,KAAK,sBAAsB;AACvE,YAAM,IAAI,eACR,WACA,wBACA,IAAI,aAAa,sBAAsB,CAAC;IAE5C;AAEA,SAAK,UAAU,eAAe,SAAS,IAAI,SAAS,KAAK,MAAM,CAAC;AAChE,SAAK,eAAc;AACnB,WAAO;EACT;EAEQ,gBACN,SACA,KACA,QAAc;AAEd,QAAI,OAAO;AACX,UAAM,OAAO,CAAC,MAAa;AACzB,UAAI,KAAK,SAAS,GAAG;AACnB,cAAM,IAAI,eAAe,gBAAgB;MAC3C;AACA,YAAME,KAAI,KAAK,SAAS,GAAG,CAAC;AAC5B,aAAO,KAAK,SAAS,CAAC;AACtB,aAAOA;IACT;AAEA,UAAM,MAAM,KAAK,YAAW,IACvB,KAAK,QAAQ,oBAAoB,KAAK,uBAAuB,IAC7D,KAAK,QAAQ,oBAAoB,KAAK,uBAAuB;AAClE,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,eAAe,cAAc;IACzC;AAEA,UAAM,EAAE,QAAQ,EAAC,IAAK,KAAK;AAC3B,UAAM,MAAMF,IAAE;AACd,eAAW,SAAS,KAAK;AACvB,UAAI,UAAK,GAAc;AACrB,cAAM,KAAK,WAAW,KAAK,KAAK,GAAG,CAAC;AACpC,aAAK,UAAU,QAAQ,EAAE;AACzB,YAAI,KAAK,QAAQ,OAAM,GAAI;AACzB,eAAK,UAAU,OAAO,EAAE;QAC1B;AACA,aAAK,KAAK;MACZ,WAAW,UAAK,GAAc;AAC5B,cAAM,MAAM,KAAK,UAAU,OAAM,IAAK,MAAM,EAAE,SAAS;AACvD,cAAM,KAAK,IAAI,WAAW,GAAG;AAC7B,aAAK,UAAU,eAAe,KAAK,GAAG,GAAG,EAAE;AAC3C,aAAK,KAAK;MACZ,WAAW,UAAK,GAAgB;AAC9B,aAAK,UAAU,cAAc,KAAK,QAAO,CAAE;MAC7C,WACE,UAAK,KACF,UAAK,KACL,UAAK,KACL,UAAK,GACR;AACA,aAAK,UAAU,OAAO,KAAK,MAAM,KAAK,CAAC;MACzC,OAAO;AACL,cAAM,IAAI,MAAM,sBAAsB;MACxC;IACF;AAEA,SAAK,UAAU,eAAe,MAAM,IAAI,SAAS,GAAG,MAAM,CAAC;AAC3D,SAAK,eAAc;AACnB,WAAO;EACT;;AAGF,SAAS,eAAY;AACnB,QAAM,IAAI,eAAe,iBAAiB;AAC5C;AAEA,SAAS,WAAQ;AACf,QAAM,IAAI,eAAe,cAAc;AACzC;;;ACtdO,IAAM,SAAyB,2BAAW,KAAK;AAAA,EAClD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAClD;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EACnD;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACnD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EACnD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAClD;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EACnD;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAClD;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAClD;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EACnD;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EACnD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAClD;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA;AAAA,EAEnD;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EACnD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EACnD;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAClD;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAG;AACvD,CAAC;AASM,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG;AAC/B,MAAK,IAAI,IAAI,IAAK;AAClB,MAAIG,MAAK,IAAI,GAAG,EAAE;AAClB,MAAK,IAAI,IAAK;AACd,MAAIA,MAAK,IAAI,GAAG,EAAE;AAClB,SAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AACxB;AAIO,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG;AAC/B,MAAK,IAAI,IAAI,IAAK;AAClB,MAAIA,MAAK,IAAI,GAAG,CAAC;AACjB,MAAK,IAAI,IAAK;AACd,MAAIA,MAAK,IAAI,GAAG,CAAC;AACjB,SAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AACxB;;;AC9CA,IAAM,SAAyB,4BAAY,KAAK;AAAA,EAC5C;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;AAED,IAAM,OAAuB,oBAAI,YAAY,EAAE;AAE/C,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG;AAE7B,QAAM,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC;AACjC,MAAI,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI,CAAC;AACzC,MAAI,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI,CAAC;AACzC,MAAI,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI,CAAC;AACzC,MAAI,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI,CAAC;AAEzC,QAAM,KAASC,OAAM,IAAI,IAAI,EAAE;AAC/B,OAASC,OAAM,IAAI,IAAI,IAAI,EAAE;AAC7B,OAAK,KAAK;AAEV,MAAI,KAAK,KAAK,IAAI,KAAK,KAAK;AAC5B,OAAS,QAAQ,IAAI,EAAE;AACvB,OAAS,QAAQ,IAAI,EAAE;AAEvB,GAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQC,KAAI,IAAI,IAAI,IAAI,EAAE;AAE1C,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAASC,QAAO,IAAI,IAAI,EAAE;AAC1B,OAASC,QAAO,IAAI,IAAI,EAAE;AAC1B,OAAK,IAAI,CAAC,IAAI;AACd,OAAK,IAAI,IAAI,CAAC,IAAI;AAClB,OAAK,IAAI,CAAC,IAAI;AACd,OAAK,IAAI,IAAI,CAAC,IAAI;AAClB,OAAK,IAAI,CAAC,IAAI;AACd,OAAK,IAAI,IAAI,CAAC,IAAI;AAClB,OAAK,IAAI,CAAC,IAAI;AACd,OAAK,IAAI,IAAI,CAAC,IAAI;AACtB;AAEA,SAAS,IAAI,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG;AAE7B,QAAM,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC;AACjC,MAAI,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI,CAAC;AACzC,MAAI,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI,CAAC;AACzC,MAAI,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI,CAAC;AACzC,MAAI,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI,CAAC;AAEzC,QAAM,KAASJ,OAAM,IAAI,IAAI,EAAE;AAC/B,OAASC,OAAM,IAAI,IAAI,IAAI,EAAE;AAC7B,OAAK,KAAK;AAEV,MAAI,KAAK,KAAK,IAAI,KAAK,KAAK;AAC5B,OAASE,QAAO,IAAI,IAAI,EAAE;AAC1B,OAASC,QAAO,IAAI,IAAI,EAAE;AAE1B,GAAC,EAAE,GAAG,IAAI,GAAG,GAAG,IAAQF,KAAI,IAAI,IAAI,IAAI,EAAE;AAE1C,OAAK,KAAK;AACV,OAAK,KAAK;AACV,OAASG,QAAO,IAAI,IAAI,EAAE;AAC1B,OAASC,QAAO,IAAI,IAAI,EAAE;AAC1B,OAAK,IAAI,CAAC,IAAI;AACd,OAAK,IAAI,IAAI,CAAC,IAAI;AAClB,OAAK,IAAI,CAAC,IAAI;AACd,OAAK,IAAI,IAAI,CAAC,IAAI;AAClB,OAAK,IAAI,CAAC,IAAI;AACd,OAAK,IAAI,IAAI,CAAC,IAAI;AAClB,OAAK,IAAI,CAAC,IAAI;AACd,OAAK,IAAI,IAAI,CAAC,IAAI;AACtB;AACA,SAAS,gBAAgB,WAAW,OAAO,CAAC,GAAG,QAAQ,SAAS,SAAS;AACrE,EAAAC,SAAQ,MAAM;AAGd,MAAI,aAAa,KAAK,YAAY;AAC9B,UAAM,IAAI,MAAM,wBAAwB,SAAS,WAAW,SAAS;AACzE,QAAM,EAAE,KAAK,MAAM,gBAAgB,IAAI;AAEvC,MAAI,QAAQ,WAAc,IAAI,SAAS,KAAK,IAAI,SAAS;AACrD,UAAM,IAAI,MAAM,oDAAoD,MAAM;AAC9E,MAAI,SAAS;AACT,IAAAC,QAAO,MAAM,SAAS,MAAM;AAChC,MAAI,oBAAoB;AACpB,IAAAA,QAAO,iBAAiB,SAAS,iBAAiB;AAC1D;AAEO,IAAM,UAAN,MAAc;AAAA,EACjB;AAAA,EACA;AAAA,EACA,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,SAAS;AAAA,EACT,MAAM;AAAA,EACN;AAAA,EACA;AAAA,EACA,SAAS;AAAA,EACT,YAAY,UAAU,WAAW;AAC7B,IAAAD,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,SAAS;AACjB,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,SAAK,WAAW,IAAI,KAAK,MAAM;AAAA,EACnC;AAAA,EACA,OAAO,MAAM;AACT,IAAAE,SAAQ,IAAI;AACZ,IAAAD,QAAO,IAAI;AAKX,UAAM,EAAE,UAAU,QAAQ,SAAS,IAAI;AACvC,UAAM,MAAM,KAAK;AACjB,UAAM,SAAS,KAAK;AACpB,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAM;AAE1B,UAAI,KAAK,QAAQ,UAAU;AACvB,mBAAW,QAAQ;AACnB,aAAK,SAAS,UAAU,GAAG,KAAK;AAChC,mBAAW,QAAQ;AACnB,aAAK,MAAM;AAAA,MACf;AACA,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AACpD,YAAM,aAAa,SAAS;AAE5B,UAAI,SAAS,YAAY,EAAE,aAAa,MAAM,MAAM,OAAO,KAAK;AAC5D,cAAM,SAAS,IAAI,YAAY,KAAK,YAAY,KAAK,OAAO,MAAM,OAAO,CAAC,CAAC;AAC3E,mBAAW,MAAM;AACjB,iBAAS,QAAQ,GAAG,MAAM,WAAW,KAAK,SAAS,SAAS,QAAQ,OAAO,UAAU;AACjF,eAAK,UAAU;AACf,eAAK,SAAS,QAAQ,OAAO,KAAK;AAAA,QACtC;AACA,mBAAW,MAAM;AACjB;AAAA,MACJ;AAGA,aAAO,IAAI,QAAQ,KAAK,SAAS,MAAM,OAAO,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACtF,WAAK,OAAO;AACZ,WAAK,UAAU;AACf,aAAO;AAAA,IACX;AACA,WAAO;AAAA,EACX;AAAA,EACA,WAAW,KAAK;AACZ,IAAAC,SAAQ,IAAI;AACZ,IAAAC,SAAQ,KAAK,IAAI;AAEjB,QAAI,IAAI,aAAa;AACjB,YAAM,IAAI,WAAW,sDAAsD,IAAI,UAAU;AAC7F,UAAM,EAAE,KAAK,SAAS,IAAI;AAC1B,SAAK,WAAW;AAEhB,SAAK,OAAO,KAAK,GAAG,GAAG;AACvB,eAAW,QAAQ;AACnB,SAAK,SAAS,UAAU,GAAG,IAAI;AAC/B,eAAW,QAAQ;AACnB,UAAM,QAAQ,KAAK,IAAI;AAEvB,UAAM,QAAQ,QAAQ,KAAK,SAAS,WAAW,IAAI,GAAG;AACtD,UAAM,OAAO,KAAK,MAAM,KAAK,YAAY,CAAC;AAC1C,aAAS,IAAI,GAAG,IAAI,MAAM;AACtB,YAAM,CAAC,IAAI,UAAU,MAAM,CAAC,CAAC;AACjC,UAAM,OAAO,KAAK,YAAY;AAC9B,QAAI,CAAC;AACD;AACJ,UAAM,MAAM,OAAO;AACnB,UAAM,OAAO,MAAM,IAAI;AACvB,aAAS,IAAI,GAAG,IAAI,MAAM;AACtB,UAAI,MAAM,CAAC,IAAI,SAAU,IAAI;AAAA,EACrC;AAAA,EACA,SAAS;AACL,UAAM,EAAE,QAAQ,UAAU,IAAI;AAC9B,SAAK,WAAW,MAAM;AAEtB,UAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAQ;AACb,WAAO;AAAA,EACX;AAAA,EACA,WAAW,IAAI;AACX,UAAM,EAAE,QAAQ,QAAQ,UAAU,WAAW,WAAW,IAAI,IAAI;AAEhE,WAAO,IAAI,KAAK,YAAY,EAAE,OAAO,UAAU,CAAC;AAChD,OAAG,IAAI,GAAG,KAAK,IAAI,CAAC;AAEpB,OAAG,OAAO,IAAI,MAAM;AACpB,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,SAAS;AACZ,OAAG,MAAM;AAET,OAAG,YAAY;AACf,WAAO;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,WAAW;AAAA,EAC3B;AACJ;AAEO,IAAM,WAAN,cAAuB,QAAQ;AAAA;AAAA,EAElC,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,CAAC,IAAI;AAAA,EAClB,MAAM,OAAO,EAAE,IAAI;AAAA,EACnB,MAAM,OAAO,EAAE,IAAI;AAAA,EACnB,MAAM,OAAO,EAAE,IAAI;AAAA,EACnB,MAAM,OAAO,EAAE,IAAI;AAAA,EACnB,MAAM,OAAO,EAAE,IAAI;AAAA,EACnB,MAAM,OAAO,EAAE,IAAI;AAAA,EACnB,YAAY,OAAO,CAAC,GAAG;AACnB,WAAO,UAAU,CAAC,GAAG,IAAI;AACzB,UAAM,OAAO,KAAK,UAAU,SAAY,KAAK,KAAK;AAClD,UAAM,KAAK,IAAI;AACf,oBAAgB,MAAM,MAAM,IAAI,IAAI,EAAE;AACtC,QAAI,EAAE,KAAK,iBAAiB,KAAK,IAAI;AACrC,QAAI,YAAY;AAChB,QAAI,QAAQ,QAAW;AACnB,MAAAF,QAAO,KAAK,QAAW,KAAK;AAC5B,kBAAY,IAAI;AAAA,IACpB;AAGA,SAAK,OAAO,KAAK,YAAa,aAAa,IAAM,KAAQ,KAAO,KAAQ;AACxE,QAAI,SAAS,QAAW;AACpB,MAAAA,QAAO,MAAM,QAAW,MAAM;AAE9B,YAAM,MAAM,IAAIG,WAAU,IAAI,CAAC;AAC/B,WAAK,OAAO,UAAU,IAAI,CAAC,CAAC;AAC5B,WAAK,OAAO,UAAU,IAAI,CAAC,CAAC;AAC5B,WAAK,OAAO,UAAU,IAAI,CAAC,CAAC;AAC5B,WAAK,OAAO,UAAU,IAAI,CAAC,CAAC;AAAA,IAChC;AACA,QAAI,oBAAoB,QAAW;AAC/B,MAAAH,QAAO,iBAAiB,QAAW,iBAAiB;AAEpD,YAAM,OAAO,IAAIG,WAAU,eAAe,CAAC;AAC3C,WAAK,OAAO,UAAU,KAAK,CAAC,CAAC;AAC7B,WAAK,OAAO,UAAU,KAAK,CAAC,CAAC;AAC7B,WAAK,OAAO,UAAU,KAAK,CAAC,CAAC;AAC7B,WAAK,OAAO,UAAU,KAAK,CAAC,CAAC;AAAA,IACjC;AACA,QAAI,QAAQ,QAAW;AAEnB,YAAM,MAAM,IAAI,WAAW,KAAK,QAAQ;AACxC,UAAI,IAAI,GAAG;AACX,WAAK,OAAO,GAAG;AAEf,MAAAC,OAAM,GAAG;AAAA,IACb;AAAA,EACJ;AAAA;AAAA,EAEA,MAAM;AACF,QAAI,EAAE,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI;AACzF,WAAO,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAAA,EAC1F;AAAA;AAAA,EAEA,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAChF,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AACjB,SAAK,MAAM,MAAM;AAAA,EACrB;AAAA,EACA,SAAS,KAAK,QAAQ,QAAQ;AAI1B,UAAM,EAAE,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI;AAE3F;AACI,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AACV,WAAK,EAAE,IAAI;AACX,WAAK,EAAE,IAAI;AACX,WAAK,EAAE,IAAI;AACX,WAAK,EAAE,IAAI;AACX,WAAK,EAAE,IAAI;AACX,WAAK,EAAE,IAAI;AAAA,IACf;AACA,SAAK,IAAI,QAAQ,EAAE;AACnB,UAAM,IAAQ,SAAS,KAAK,MAAM;AAClC,UAAM,IAAQ,SAAS,KAAK,MAAM;AAClC,SAAK,EAAE,IAAI,OAAO,CAAC,IAAI;AACvB,SAAK,EAAE,IAAI,OAAO,CAAC,IAAI;AAEvB,QAAI,QAAQ;AACR,WAAK,EAAE,IAAI,CAAC,KAAK,EAAE;AACnB,WAAK,EAAE,IAAI,CAAC,KAAK,EAAE;AAAA,IACvB;AACA,QAAI,IAAI;AACR,UAAMC,KAAI;AAGV,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,UAAI,GAAG,GAAG,GAAG,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AACzC,UAAI,GAAG,GAAG,GAAG,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AACzC,UAAI,GAAG,GAAG,GAAG,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AACzC,UAAI,GAAG,GAAG,GAAG,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AACzC,UAAI,GAAG,GAAG,IAAI,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAC1C,UAAI,GAAG,GAAG,IAAI,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAC1C,UAAI,GAAG,GAAG,IAAI,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAC1C,UAAI,GAAG,GAAG,IAAI,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAC1C,UAAI,GAAG,GAAG,IAAI,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAC1C,UAAI,GAAG,GAAG,IAAI,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAC1C,UAAI,GAAG,GAAG,IAAI,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAC1C,UAAI,GAAG,GAAG,IAAI,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAC1C,UAAI,GAAG,GAAG,GAAG,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AACzC,UAAI,GAAG,GAAG,GAAG,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AACzC,UAAI,GAAG,GAAG,GAAG,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AACzC,UAAI,GAAG,GAAG,GAAG,IAAI,KAAK,SAAS,IAAIA,GAAE,GAAG,CAAC;AAAA,IAC7C;AACA,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,CAAC,IAAI,KAAK,EAAE;AAC7B,SAAK,OAAO,KAAK,EAAE,IAAI,KAAK,EAAE;AAC9B,SAAK,OAAO,KAAK,EAAE,IAAI,KAAK,EAAE;AAC9B,SAAK,OAAO,KAAK,EAAE,IAAI,KAAK,EAAE;AAC9B,SAAK,OAAO,KAAK,EAAE,IAAI,KAAK,EAAE;AAC9B,SAAK,OAAO,KAAK,EAAE,IAAI,KAAK,EAAE;AAC9B,SAAK,OAAO,KAAK,EAAE,IAAI,KAAK,EAAE;AAC9B,IAAAD,OAAM,IAAI;AAAA,EACd;AAAA,EACA,UAAU;AACN,SAAK,YAAY;AACjB,IAAAA,OAAM,KAAK,QAAQ;AACnB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EAC3D;AACJ;AAwBO,IAAM,UAA0B,gBAAAE,cAAa,CAAC,SAAS,IAAI,SAAS,IAAI,CAAC;AA0CzE,SAAS,UAAUD,IAAG,QAAQ,KAAK,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AACpH,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC5E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC5E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC5E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC5E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC9E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC9E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC9E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC9E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC9E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC9E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC9E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC9E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC5E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC5E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAC5E,KAAC,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,SAASA,GAAE,GAAG,CAAC,CAAC;AAAA,EAChF;AACA,SAAO,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AAClF;AAEA,IAAM,SAAyB,gBAAAE,WAAU,MAAM;AAExC,IAAM,WAAN,cAAuB,QAAQ;AAAA;AAAA,EAElC,KAAK,OAAO,CAAC,IAAI;AAAA,EACjB,KAAK,OAAO,CAAC,IAAI;AAAA,EACjB,KAAK,OAAO,CAAC,IAAI;AAAA,EACjB,KAAK,OAAO,CAAC,IAAI;AAAA,EACjB,KAAK,OAAO,CAAC,IAAI;AAAA,EACjB,KAAK,OAAO,CAAC,IAAI;AAAA,EACjB,KAAK,OAAO,CAAC,IAAI;AAAA,EACjB,KAAK,OAAO,CAAC,IAAI;AAAA,EACjB,YAAY,OAAO,CAAC,GAAG;AACnB,WAAO,UAAU,CAAC,GAAG,IAAI;AACzB,UAAM,OAAO,KAAK,UAAU,SAAY,KAAK,KAAK;AAClD,UAAM,IAAI,IAAI;AACd,oBAAgB,MAAM,MAAM,IAAI,GAAG,CAAC;AACpC,QAAI,EAAE,KAAK,iBAAiB,KAAK,IAAI;AACrC,QAAI,YAAY;AAChB,QAAI,QAAQ,QAAW;AACnB,MAAAP,QAAO,KAAK,QAAW,KAAK;AAC5B,kBAAY,IAAI;AAAA,IACpB;AAGA,SAAK,MAAM,KAAK,YAAa,aAAa,IAAM,KAAQ,KAAO,KAAQ;AACvE,QAAI,SAAS,QAAW;AACpB,MAAAA,QAAO,MAAM,QAAW,MAAM;AAE9B,YAAM,MAAM,IAAIG,WAAU,IAAI,CAAC;AAC/B,WAAK,MAAM,UAAU,IAAI,CAAC,CAAC;AAC3B,WAAK,MAAM,UAAU,IAAI,CAAC,CAAC;AAAA,IAC/B;AACA,QAAI,oBAAoB,QAAW;AAC/B,MAAAH,QAAO,iBAAiB,QAAW,iBAAiB;AAEpD,YAAM,OAAO,IAAIG,WAAU,eAAe,CAAC;AAC3C,WAAK,MAAM,UAAU,KAAK,CAAC,CAAC;AAC5B,WAAK,MAAM,UAAU,KAAK,CAAC,CAAC;AAAA,IAChC;AACA,QAAI,QAAQ,QAAW;AAEnB,YAAM,MAAM,IAAI,WAAW,KAAK,QAAQ;AACxC,UAAI,IAAI,GAAG;AACX,WAAK,OAAO,GAAG;AAEf,MAAAC,OAAM,GAAG;AAAA,IACb;AAAA,EACJ;AAAA,EACA,MAAM;AACF,UAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI;AAC3C,WAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAAA,EAC1C;AAAA;AAAA,EAEA,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAChC,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AAAA,EACnB;AAAA,EACA,SAAS,KAAK,QAAQ,QAAQ;AAC1B,UAAM,IAAQ,SAAS,KAAK,MAAM;AAClC,UAAM,IAAQ,SAAS,KAAK,MAAM;AAIlC,UAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI,UAAU,QAAQ,QAAQ,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAChT,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAChB,SAAK,MAAM,KAAK;AAAA,EACpB;AAAA,EACA,UAAU;AACN,SAAK,YAAY;AACjB,IAAAA,OAAM,KAAK,QAAQ;AACnB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EACnC;AACJ;AAwBO,IAAM,UAA0B,gBAAAE,cAAa,CAAC,SAAS,IAAI,SAAS,IAAI,CAAC;;;ACljBzE,IAAM,QAAN,MAAY;AAAA,EACf;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAS;AAAA,EACT,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,YAAY,MAAM,KAAK;AACnB,UAAM,IAAI;AACV,IAAAE,QAAO,KAAK,QAAW,KAAK;AAC5B,SAAK,QAAQ,KAAK,OAAO;AACzB,QAAI,OAAO,KAAK,MAAM,WAAW;AAC7B,YAAM,IAAI,MAAM,wBAAwB;AAC5C,SAAK,WAAW,KAAK,MAAM;AAC3B,SAAK,YAAY,KAAK,MAAM;AAC5B,UAAM,WAAW,KAAK;AACtB,UAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,QAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,IAAI,GAAG;AACxE,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC5B,UAAI,CAAC,KAAK;AACd,SAAK,MAAM,OAAO,GAAG;AAGrB,SAAK,QAAQ,KAAK,OAAO;AAEzB,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAC5B,UAAI,CAAC,KAAK,KAAO;AACrB,SAAK,MAAM,OAAO,GAAG;AACrB,IAAAC,OAAM,GAAG;AAAA,EACb;AAAA,EACA,OAAO,KAAK;AACR,IAAAC,SAAQ,IAAI;AACZ,SAAK,MAAM,OAAO,GAAG;AACrB,WAAO;AAAA,EACX;AAAA,EACA,WAAW,KAAK;AACZ,IAAAA,SAAQ,IAAI;AACZ,IAAAC,SAAQ,KAAK,IAAI;AACjB,SAAK,WAAW;AAChB,UAAM,MAAM,IAAI,SAAS,GAAG,KAAK,SAAS;AAG1C,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,QAAQ;AAAA,EACjB;AAAA,EACA,SAAS;AACL,UAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,SAAK,WAAW,GAAG;AACnB,WAAO;AAAA,EACX;AAAA,EACA,WAAW,IAAI;AAGX,WAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAC,CAAC;AACpD,UAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,WAAW,OAAO,IAAI;AAC3E,SAAK;AACL,OAAG,WAAW;AACd,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,YAAY;AACf,OAAG,SAAS;AACZ,OAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,OAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,WAAO;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,WAAW;AAAA,EAC3B;AAAA,EACA,UAAU;AACN,SAAK,YAAY;AACjB,SAAK,MAAM,QAAQ;AACnB,SAAK,MAAM,QAAQ;AAAA,EACvB;AACJ;AACO,IAAM,OAAwB,uBAAM;AACvC,QAAM,SAAS,CAAC,MAAM,KAAK,YAAY,IAAI,MAAM,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAO;AACnF,QAAM,SAAS,CAAC,MAAM,QAAQ,IAAI,MAAM,MAAM,GAAG;AACjD,SAAO;AACX,GAAG;;;ACtEH,SAAS,SACPC,OACA,MACA,SACA,UAAgB;AAEhB,QAAM,SAAS,CAAC,SAAiC,KAAK,OAAM,EAAG,OAAO,IAAI,EAAE,OAAM;AAElF,QAAM,QAAQ,CAAC,KAAiB,SAAiC,KAAK,MAAM,KAAK,IAAI;AAErF,QAAM,WAAW,CAAC,KAAiB,UACjC,MAAM,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAKC,aAAY,GAAG,KAAK,CAAC;AAEnE,SAAO;IACL,MAAAD;IACA;IACA;IACA,MAAM;IACN,MAAM;IACN;IACA,KAAK,IAAgB,KAAe;AAClC,YAAM,OAAO,MAAM,IAAI,GAAG;AAC1B,YAAM,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;AAC1C,YAAM,KAAK,SAAS,MAAM,CAAC,IAAI,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AACnD,aAAO,CAAC,IAAI,EAAE;IAChB;IACA,MAAM,IAAgB,KAAe;AACnC,YAAM,OAAO,MAAM,IAAI,GAAG;AAC1B,YAAM,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;AAC1C,YAAM,KAAK,SAAS,MAAM,CAAC,IAAI,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AACnD,YAAM,KAAK,SAAS,MAAM,CAAC,IAAI,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AACnD,aAAO,CAAC,IAAI,IAAI,EAAE;IACpB;IACA,YAAS;AACP,aAAO,IAAI,WAAW,OAAO;IAC/B;;AAEJ;AAEO,IAAM,UAAoB,SAAS,UAAU,QAAQ,IAAI,EAAE;AAC3D,IAAM,UAAoB,SAAS,UAAUE,SAAQ,IAAI,GAAG;AAC5D,IAAM,WAAqB,SAAS,WAAW,SAAS,IAAI,GAAG;AAC/D,IAAM,WAAqB,SAAS,WAAW,SAAS,IAAI,EAAE;;;ACzC9D,SAASC,SAAQ,GAAG;AAKvB,SAAQ,aAAa,cAChB,YAAY,OAAO,CAAC,KACjB,EAAE,YAAY,SAAS,gBACvB,uBAAuB,KACvB,EAAE,sBAAsB;AACpC;AAGA,IAAMC,UAAS,CAAC,UAAW,QAAQ,IAAI,KAAK,OAAO;AAa5C,SAASC,OAAM,OAAO,QAAQ,IAAI;AACrC,MAAI,OAAO,UAAU;AACjB,UAAM,IAAI,UAAUD,QAAO,KAAK,IAAI,gCAAgC,OAAO,KAAK;AACpF,SAAO;AACX;AAcO,SAASE,SAAQ,GAAG,QAAQ,IAAI;AACnC,MAAI,OAAO,MAAM;AACb,UAAM,IAAI,UAAUF,QAAO,KAAK,IAAI,0BAA0B,OAAO,CAAC;AAC1E,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAChC,UAAM,IAAI,WAAWA,QAAO,KAAK,IAAI,gCAAgC,CAAC;AAC1E,SAAO;AACX;AAiBO,SAASG,QAAO,OAAO,QAAQ,QAAQ,IAAI;AAG9C,MAAIJ,SAAQ,KAAK,MAAM,WAAW,UAAa,MAAM,WAAW;AAC5D,WAAO;AAEX,MAAI,WAAW;AACX,IAAAG,SAAQ,QAAQ,QAAQ;AAC5B,QAAM,QAAQH,SAAQ,KAAK;AAC3B,QAAM,QAAQ,WAAW,SAAY,cAAc,MAAM,KAAK;AAC9D,QAAM,MAAM,QAAQ,UAAU,MAAM,MAAM,KAAK,QAAQ,OAAO,KAAK;AACnE,QAAM,UAAUC,QAAO,KAAK,IAAI,wBAAwB,QAAQ,WAAW;AAC3E,MAAI,CAAC;AACD,UAAM,IAAI,UAAU,OAAO;AAC/B,QAAM,IAAI,WAAW,OAAO;AAChC;AACA,IAAMI,WAAU,CAAC,OAAO,UAAU;AAC9B,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK;AAClE,UAAM,IAAI,UAAU,UAAU,WACxB,kCACA,IAAI,KAAK,+BAA+B,OAAO,KAAK,EAAE;AACpE;AAcO,SAASC,SAAQ,UAAU,gBAAgB,MAAM;AAGpD,MAAI,SAAS;AACT,UAAM,IAAI,MAAM,oBAAoB;AACxC,MAAI,iBAAiB,SAAS;AAC1B,UAAM,IAAI,MAAM,6BAA6B;AACrD;AAgBO,SAASC,SAAQ,KAAK,UAAU;AACnC,EAAAH,QAAO,KAAK,QAAW,QAAQ;AAG/B,QAAM,MAAM,SAAS;AACrB,MAAI,EAAE,IAAI,UAAU,MAAM;AACtB,UAAM,IAAI,WAAW,iCAAiC,GAAG;AAAA,EAC7D;AACJ;AAgDO,SAASI,KAAI,KAAK;AACrB,SAAO,IAAI,YAAY,IAAI,QAAQ,IAAI,YAAY,KAAK,MAAM,IAAI,aAAa,CAAC,CAAC;AACrF;AAaO,SAASC,UAAS,QAAQ;AAC7B,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,WAAO,CAAC,EAAE,KAAK,CAAC;AAAA,EACpB;AACJ;AAYO,SAASC,YAAW,KAAK;AAC5B,SAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AAClE;AAKO,IAAMC,QAAwB,uBAAM,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM,IAAM;AAYtG,SAASC,UAAS,MAAM;AAC3B,SAAU,QAAQ,KAAM,aAClB,QAAQ,IAAK,WACb,SAAS,IAAK,QACd,SAAS,KAAM;AACzB;AA0BO,SAASC,YAAW,KAAK;AAC5B,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,QAAI,CAAC,IAAIC,UAAS,IAAI,CAAC,CAAC;AAAA,EAC5B;AACA,SAAO;AACX;AAYO,IAAMC,cAAaC,QACpB,CAAC,MAAM,IACPH;AA0RC,SAASI,WAAU,UAAU,MAAM;AACtC,EAAAC,SAAQ,UAAU,UAAU;AAC5B,EAAAA,SAAQ,MAAM,MAAM;AAGpB,QAAM,SAAS,OAAO,OAAO,UAAU,IAAI;AAC3C,SAAO;AACX;AAaO,SAASC,YAAW,GAAG,GAAG;AAC7B,MAAIC,QAAO,CAAC;AACZ,MAAIA,QAAO,CAAC;AACZ,MAAI,EAAE,WAAW,EAAE;AACf,WAAO;AACX,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAC1B,YAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AACtB,SAAO,SAAS;AACpB;AAUO,SAAS,mBAAmB,QAAQ,SAAS,SAAS;AACzD,QAAM,MAAM;AACZ,QAAM,UAAW,YAAY,MAAM,CAAC;AACpC,QAAM,OAAO,CAAC,KAAK,QAAQ,IAAI,KAAK,GAAG,QAAQ,GAAG,CAAC,EAC9C,OAAO,GAAG,EACV,OAAO;AACZ,QAAM,MAAM,IAAI,IAAI,WAAW,MAAM,GAAG,GAAG,QAAQ,IAAI,WAAW,CAAC,CAAC,CAAC;AACrE,OAAK,YAAY,IAAI;AACrB,OAAK,WAAW,IAAI;AACpB,OAAK,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,GAAG,IAAI;AAChD,SAAO;AACX;AAaO,IAAM,wCAAa,CAAC,QAAQ,gBAAgB;AAC/C,WAAS,cAAc,QAAQ,MAAM;AAEjC,IAAAA,QAAO,KAAK,QAAW,KAAK;AAE5B,QAAI,OAAO,gBAAgB,QAAW;AAClC,YAAM,QAAQ,KAAK,CAAC;AACpB,MAAAA,QAAO,OAAO,OAAO,eAAe,SAAY,OAAO,aAAa,OAAO;AAAA,IAC/E;AAEA,UAAM,OAAO,OAAO;AACpB,UAAM,WAAW,OAAO,gBAAgB,SAAY,IAAI;AAExD,QAAI,CAAC,OAAO,SAAS;AACjB,eAAS,IAAI,UAAU,IAAI,KAAK,QAAQ;AACpC,YAAIC,SAAQ,KAAK,CAAC,CAAC;AACf,gBAAM,IAAI,MAAM,mBAAmB;AAAA,IAC/C;AAEA,QAAI,OAAO,WAAW,KAAK,QAAQ,MAAM;AACrC,MAAAD,QAAO,KAAK,QAAQ,GAAG,QAAW,KAAK;AAC3C,UAAM,SAAS,YAAY,KAAK,GAAG,IAAI;AACvC,UAAM,cAAc,CAAC,UAAU,WAAW;AACtC,UAAI,WAAW,QAAW;AACtB,YAAI,aAAa;AACb,gBAAM,IAAI,MAAM,6BAA6B;AACjD,QAAAA,QAAO,QAAQ,QAAW,QAAQ;AAAA,MACtC;AAAA,IACJ;AAEA,QAAI,SAAS;AACb,UAAM,WAAW;AAAA,MACb,QAAQ,MAAM,QAAQ;AAClB,YAAI;AACA,gBAAM,IAAI,MAAM,8CAA8C;AAElE,iBAAS;AACT,QAAAA,QAAO,MAAM,QAAW,MAAM;AAC9B,oBAAY,OAAO,QAAQ,QAAQ,MAAM;AACzC,eAAO,OAAO,QAAQ,MAAM,MAAM;AAAA,MACtC;AAAA,MACA,QAAQ,MAAM,QAAQ;AAClB,QAAAA,QAAO,MAAM,QAAW,MAAM;AAC9B,YAAI,QAAQ,KAAK,SAAS;AACtB,gBAAM,IAAI,MAAM,+CAA+C,IAAI;AACvE,oBAAY,OAAO,QAAQ,QAAQ,MAAM;AACzC,eAAO,OAAO,QAAQ,MAAM,MAAM;AAAA,MACtC;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACA,SAAO,OAAO,eAAe,MAAM;AACnC,SAAO;AACX;AAkBO,SAAS,UAAU,gBAAgB,KAAK,cAAc,MAAM;AAC/D,MAAI,QAAQ;AACR,WAAO,IAAI,WAAW,cAAc;AAExC,EAAAA,QAAO,KAAK,gBAAgB,QAAQ;AACpC,MAAI,eAAe,CAAC,YAAY,GAAG;AAC/B,UAAM,IAAI,MAAM,iCAAiC;AACrD,SAAO;AACX;AAmBO,SAAS,WAAW,YAAY,WAAWE,OAAM;AAEpD,EAAAC,SAAQ,UAAU;AAClB,EAAAA,SAAQ,SAAS;AACjB,EAAAC,OAAMF,KAAI;AACV,QAAM,MAAM,IAAI,WAAW,EAAE;AAC7B,QAAM,OAAOG,YAAW,GAAG;AAC3B,OAAK,aAAa,GAAG,OAAO,SAAS,GAAGH,KAAI;AAC5C,OAAK,aAAa,GAAG,OAAO,UAAU,GAAGA,KAAI;AAC7C,SAAO;AACX;AAYO,SAAS,YAAY,OAAO;AAC/B,SAAO,MAAM,aAAa,MAAM;AACpC;AAaO,SAASI,WAAU,OAAO;AAG7B,SAAO,WAAW,KAAKN,QAAO,KAAK,CAAC;AACxC;;;ACzuBA,IAAM,YAAY,CAAC,QAAQ,WAAW,KAAK,IAAI,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAKhF,IAAM,aAA8B,uBAAMO,YAAWC,KAAI,UAAU,kBAAkB,CAAC,CAAC,GAAG;AAG1F,IAAM,aAA8B,uBAAMD,YAAWC,KAAI,UAAU,kBAAkB,CAAC,CAAC,GAAG;AAYnF,SAAS,KAAK,GAAG,GAAG;AACvB,SAAQ,KAAK,IAAM,MAAO,KAAK;AACnC;AAEA,IAAM,YAAY;AAElB,IAAM,cAAc;AAcpB,IAAM,cAA+B,uBAAM,KAAK,KAAK,GAAG;AACxD,IAAM,YAA4B,4BAAY,GAAG;AACjD,SAAS,UAAU,MAAM,OAAO,KAAK,OAAO,MAAM,QAAQ,SAAS,QAAQ;AACvE,QAAM,MAAM,KAAK;AACjB,QAAM,QAAQ,IAAI,WAAW,SAAS;AACtC,QAAM,MAAMA,KAAI,KAAK;AAErB,QAAM,YAAYC,SAAQ,YAAY,IAAI,KAAK,YAAY,MAAM;AACjE,QAAM,MAAM,YAAYD,KAAI,IAAI,IAAI;AACpC,QAAM,MAAM,YAAYA,KAAI,MAAM,IAAI;AAGtC,MAAI,CAACC,OAAM;AACP,aAAS,MAAM,GAAG,MAAM,KAAK,WAAW;AACpC,WAAK,OAAO,KAAK,OAAO,KAAK,SAAS,MAAM;AAE5C,MAAAF,YAAW,GAAG;AACd,UAAI,WAAW;AACX,cAAM,IAAI,MAAM,uBAAuB;AAC3C,YAAM,OAAO,KAAK,IAAI,WAAW,MAAM,GAAG;AAC1C,eAAS,IAAI,GAAG,MAAM,IAAI,MAAM,KAAK;AACjC,eAAO,MAAM;AACb,eAAO,IAAI,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC;AAAA,MACvC;AACA,aAAO;AAAA,IACX;AACA;AAAA,EACJ;AACA,WAAS,MAAM,GAAG,MAAM,KAAK,WAAW;AACpC,SAAK,OAAO,KAAK,OAAO,KAAK,SAAS,MAAM;AAE5C,QAAI,WAAW;AACX,YAAM,IAAI,MAAM,uBAAuB;AAC3C,UAAM,OAAO,KAAK,IAAI,WAAW,MAAM,GAAG;AAE1C,QAAI,aAAa,SAAS,WAAW;AACjC,YAAM,QAAQ,MAAM;AACpB,UAAI,MAAM,MAAM;AACZ,cAAM,IAAI,MAAM,6BAA6B;AACjD,eAAS,IAAI,GAAG,MAAM,IAAI,aAAa,KAAK;AACxC,eAAO,QAAQ;AACf,YAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;AAAA,MACjC;AACA,aAAO;AACP;AAAA,IACJ;AACA,aAAS,IAAI,GAAG,MAAM,IAAI,MAAM,KAAK;AACjC,aAAO,MAAM;AACb,aAAO,IAAI,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC;AAAA,IACvC;AACA,WAAO;AAAA,EACX;AACJ;AASO,SAAS,aAAa,MAAM,MAAM;AACrC,QAAM,EAAE,gBAAgB,eAAe,eAAe,cAAc,OAAO,IAAIG,WAAU,EAAE,gBAAgB,OAAO,eAAe,GAAG,cAAc,OAAO,QAAQ,GAAG,GAAG,IAAI;AAC3K,MAAI,OAAO,SAAS;AAChB,UAAM,IAAI,MAAM,yBAAyB;AAC7C,EAAAC,SAAQ,aAAa;AACrB,EAAAA,SAAQ,MAAM;AACd,EAAAC,OAAM,YAAY;AAClB,EAAAA,OAAM,cAAc;AACpB,SAAO,CAAC,KAAK,OAAO,MAAM,QAAQ,UAAU,MAAM;AAC9C,IAAAC,QAAO,KAAK,QAAW,KAAK;AAC5B,IAAAA,QAAO,OAAO,QAAW,OAAO;AAChC,IAAAA,QAAO,MAAM,QAAW,MAAM;AAC9B,UAAM,MAAM,KAAK;AAGjB,aAAS,UAAU,KAAK,QAAQ,KAAK;AACrC,IAAAF,SAAQ,OAAO;AAEf,QAAI,UAAU,KAAK,WAAW;AAC1B,YAAM,IAAI,MAAM,uBAAuB;AAC3C,UAAM,UAAU,CAAC;AAIjB,QAAI,IAAI,IAAI;AACZ,QAAI;AACJ,QAAI;AACJ,QAAI,MAAM,IAAI;AAGV,cAAQ,KAAM,IAAIG,WAAU,GAAG,CAAE;AACjC,cAAQ;AAAA,IACZ,WACS,MAAM,MAAM,gBAAgB;AACjC,UAAI,IAAI,WAAW,EAAE;AACrB,QAAE,IAAI,GAAG;AACT,QAAE,IAAI,KAAK,EAAE;AACb,cAAQ;AACR,cAAQ,KAAK,CAAC;AAAA,IAClB,OACK;AACD,MAAAD,QAAO,KAAK,IAAI,SAAS;AACzB,YAAM,IAAI,MAAM,kBAAkB;AAAA,IAEtC;AASA,QAAI,CAACJ,SAAQ,CAAC,YAAY,KAAK;AAC3B,cAAQ,KAAM,QAAQK,WAAU,KAAK,CAAE;AAC3C,QAAI,MAAMN,KAAI,CAAC;AAEf,QAAI,eAAe;AACf,UAAI,MAAM,WAAW;AACjB,cAAM,IAAI,MAAM,sCAAsC;AAC1D,YAAM,MAAM,MAAM,SAAS,GAAG,EAAE;AAChC,UAAIC;AACA,sBAAc,OAAO,KAAKD,KAAI,GAAG,GAAG,GAAG;AAAA,WACtC;AACD,cAAM,WAAWD,YAAW,YAAY,KAAK,KAAK,CAAC;AACnD,sBAAc,UAAU,KAAKC,KAAI,GAAG,GAAG,GAAG;AAC1C,QAAAO,OAAM,QAAQ;AACd,QAAAR,YAAW,GAAG;AAAA,MAClB;AACA,cAAQ,MAAM,SAAS,EAAE;AAAA,IAC7B,WACS,CAACE;AACN,MAAAF,YAAW,GAAG;AAElB,UAAM,aAAa,KAAK;AACxB,QAAI,eAAe,MAAM;AACrB,YAAM,IAAI,MAAM,sBAAsB,UAAU,cAAc;AAGlE,QAAI,eAAe,IAAI;AACnB,YAAMS,MAAK,IAAI,WAAW,EAAE;AAC5B,MAAAA,IAAG,IAAI,OAAO,eAAe,IAAI,KAAK,MAAM,MAAM;AAClD,cAAQA;AACR,cAAQ,KAAK,KAAK;AAAA,IACtB;AACA,UAAM,MAAMT,YAAWC,KAAI,KAAK,CAAC;AAGjC,QAAI;AACA,gBAAU,MAAM,OAAO,KAAK,KAAK,MAAM,QAAQ,SAAS,MAAM;AAC9D,aAAO;AAAA,IACX,UACA;AACI,MAAAO,OAAM,GAAG,OAAO;AAAA,IACpB;AAAA,EACJ;AACJ;;;ACxNA,SAAS,OAAO,GAAG,GAAG;AAClB,SAAQ,EAAE,GAAG,IAAI,OAAU,EAAE,GAAG,IAAI,QAAS;AACjD;AAiBO,IAAM,WAAN,MAAe;AAAA,EAClB,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,SAAS,IAAI,WAAW,EAAE;AAAA,EAC1B,IAAI,IAAI,YAAY,EAAE;AAAA;AAAA,EACtB,IAAI,IAAI,YAAY,EAAE;AAAA,EACtB,MAAM,IAAI,YAAY,CAAC;AAAA,EACvB,MAAM;AAAA,EACN,WAAW;AAAA,EACX,YAAY;AAAA;AAAA,EAEZ,YAAY,KAAK;AACb,UAAME,WAAUC,QAAO,KAAK,IAAI,KAAK,CAAC;AACtC,UAAM,KAAK,OAAO,KAAK,CAAC;AACxB,UAAM,KAAK,OAAO,KAAK,CAAC;AACxB,UAAM,KAAK,OAAO,KAAK,CAAC;AACxB,UAAM,KAAK,OAAO,KAAK,CAAC;AACxB,UAAM,KAAK,OAAO,KAAK,CAAC;AACxB,UAAM,KAAK,OAAO,KAAK,EAAE;AACzB,UAAM,KAAK,OAAO,KAAK,EAAE;AACzB,UAAM,KAAK,OAAO,KAAK,EAAE;AAKzB,SAAK,EAAE,CAAC,IAAI,KAAK;AACjB,SAAK,EAAE,CAAC,KAAM,OAAO,KAAO,MAAM,KAAM;AACxC,SAAK,EAAE,CAAC,KAAM,OAAO,KAAO,MAAM,KAAM;AACxC,SAAK,EAAE,CAAC,KAAM,OAAO,IAAM,MAAM,KAAM;AACvC,SAAK,EAAE,CAAC,KAAM,OAAO,IAAM,MAAM,MAAO;AACxC,SAAK,EAAE,CAAC,IAAK,OAAO,IAAK;AACzB,SAAK,EAAE,CAAC,KAAM,OAAO,KAAO,MAAM,KAAM;AACxC,SAAK,EAAE,CAAC,KAAM,OAAO,KAAO,MAAM,KAAM;AACxC,SAAK,EAAE,CAAC,KAAM,OAAO,IAAM,MAAM,KAAM;AACvC,SAAK,EAAE,CAAC,IAAK,OAAO,IAAK;AACzB,aAAS,IAAI,GAAG,IAAI,GAAG;AACnB,WAAK,IAAI,CAAC,IAAI,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,EAC5C;AAAA,EACA,QAAQ,MAAM,QAAQ,SAAS,OAAO;AAIlC,UAAM,QAAQ,SAAS,IAAI,KAAK;AAChC,UAAM,EAAE,GAAG,EAAE,IAAI;AACjB,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,EAAE,CAAC;AACd,UAAM,KAAK,OAAO,MAAM,SAAS,CAAC;AAClC,UAAM,KAAK,OAAO,MAAM,SAAS,CAAC;AAClC,UAAM,KAAK,OAAO,MAAM,SAAS,CAAC;AAClC,UAAM,KAAK,OAAO,MAAM,SAAS,CAAC;AAClC,UAAM,KAAK,OAAO,MAAM,SAAS,CAAC;AAClC,UAAM,KAAK,OAAO,MAAM,SAAS,EAAE;AACnC,UAAM,KAAK,OAAO,MAAM,SAAS,EAAE;AACnC,UAAM,KAAK,OAAO,MAAM,SAAS,EAAE;AACnC,QAAI,KAAK,EAAE,CAAC,KAAK,KAAK;AACtB,QAAI,KAAK,EAAE,CAAC,MAAO,OAAO,KAAO,MAAM,KAAM;AAC7C,QAAI,KAAK,EAAE,CAAC,MAAO,OAAO,KAAO,MAAM,KAAM;AAC7C,QAAI,KAAK,EAAE,CAAC,MAAO,OAAO,IAAM,MAAM,KAAM;AAC5C,QAAI,KAAK,EAAE,CAAC,MAAO,OAAO,IAAM,MAAM,MAAO;AAC7C,QAAI,KAAK,EAAE,CAAC,KAAM,OAAO,IAAK;AAC9B,QAAI,KAAK,EAAE,CAAC,MAAO,OAAO,KAAO,MAAM,KAAM;AAC7C,QAAI,KAAK,EAAE,CAAC,MAAO,OAAO,KAAO,MAAM,KAAM;AAC7C,QAAI,KAAK,EAAE,CAAC,MAAO,OAAO,IAAM,MAAM,KAAM;AAC5C,QAAI,KAAK,EAAE,CAAC,KAAM,OAAO,IAAK;AAC9B,QAAI,IAAI;AACR,QAAI,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AACjF,QAAI,OAAO;AACX,UAAM;AACN,UAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AAChF,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AAC3E,QAAI,OAAO;AACX,UAAM;AACN,UAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AAChF,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,IAAI,MAAM,MAAM,IAAI;AACrE,QAAI,OAAO;AACX,UAAM;AACN,UAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AAChF,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,IAAI;AAC/D,QAAI,OAAO;AACX,UAAM;AACN,UAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AAChF,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAC1D,QAAI,OAAO;AACX,UAAM;AACN,UAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AAChF,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAC1D,QAAI,OAAO;AACX,UAAM;AACN,UAAM,KAAK,KAAK,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AAC1E,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAC1D,QAAI,OAAO;AACX,UAAM;AACN,UAAM,KAAK,KAAK,KAAK,KAAK,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AACpE,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAC1D,QAAI,OAAO;AACX,UAAM;AACN,UAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,IAAI,MAAM,MAAM,IAAI;AAC9D,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAC1D,QAAI,OAAO;AACX,UAAM;AACN,UAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,IAAI;AACxD,SAAK,OAAO;AACZ,UAAM;AACN,QAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AAC1D,QAAI,OAAO;AACX,UAAM;AACN,UAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;AACnD,SAAK,OAAO;AACZ,UAAM;AACN,SAAM,KAAK,KAAK,IAAK;AACrB,QAAK,IAAI,KAAM;AACf,SAAK,IAAI;AACT,QAAI,MAAM;AACV,UAAM;AACN,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AACP,MAAE,CAAC,IAAI;AAAA,EACX;AAAA,EACA,WAAW;AACP,UAAM,EAAE,GAAG,IAAI,IAAI;AACnB,UAAM,IAAI,IAAI,YAAY,EAAE;AAC5B,QAAI,IAAI,EAAE,CAAC,MAAM;AACjB,MAAE,CAAC,KAAK;AACR,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,QAAE,CAAC,KAAK;AACR,UAAI,EAAE,CAAC,MAAM;AACb,QAAE,CAAC,KAAK;AAAA,IACZ;AACA,MAAE,CAAC,KAAK,IAAI;AACZ,QAAI,EAAE,CAAC,MAAM;AACb,MAAE,CAAC,KAAK;AACR,MAAE,CAAC,KAAK;AACR,QAAI,EAAE,CAAC,MAAM;AACb,MAAE,CAAC,KAAK;AACR,MAAE,CAAC,KAAK;AAGR,MAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AACd,QAAI,EAAE,CAAC,MAAM;AACb,MAAE,CAAC,KAAK;AACR,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AACzB,QAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AACd,UAAI,EAAE,CAAC,MAAM;AACb,QAAE,CAAC,KAAK;AAAA,IACZ;AACA,MAAE,CAAC,KAAK,KAAK;AACb,QAAI,QAAQ,IAAI,KAAK;AACrB,aAAS,IAAI,GAAG,IAAI,IAAI;AACpB,QAAE,CAAC,KAAK;AACZ,WAAO,CAAC;AACR,aAAS,IAAI,GAAG,IAAI,IAAI;AACpB,QAAE,CAAC,IAAK,EAAE,CAAC,IAAI,OAAQ,EAAE,CAAC;AAC9B,MAAE,CAAC,KAAK,EAAE,CAAC,IAAK,EAAE,CAAC,KAAK,MAAO;AAC/B,MAAE,CAAC,KAAM,EAAE,CAAC,MAAM,IAAM,EAAE,CAAC,KAAK,MAAO;AACvC,MAAE,CAAC,KAAM,EAAE,CAAC,MAAM,IAAM,EAAE,CAAC,KAAK,KAAM;AACtC,MAAE,CAAC,KAAM,EAAE,CAAC,MAAM,IAAM,EAAE,CAAC,KAAK,KAAM;AACtC,MAAE,CAAC,KAAM,EAAE,CAAC,MAAM,KAAO,EAAE,CAAC,KAAK,IAAM,EAAE,CAAC,KAAK,MAAO;AACtD,MAAE,CAAC,KAAM,EAAE,CAAC,MAAM,IAAM,EAAE,CAAC,KAAK,MAAO;AACvC,MAAE,CAAC,KAAM,EAAE,CAAC,MAAM,IAAM,EAAE,CAAC,KAAK,KAAM;AACtC,MAAE,CAAC,KAAM,EAAE,CAAC,MAAM,IAAM,EAAE,CAAC,KAAK,KAAM;AACtC,QAAI,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC;AACpB,MAAE,CAAC,IAAI,IAAI;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,WAAO,EAAE,CAAC,IAAI,IAAI,CAAC,IAAK,MAAM,MAAM,MAAO;AAC3C,QAAE,CAAC,IAAI,IAAI;AAAA,IACf;AACA,IAAAC,OAAM,CAAC;AAAA,EACX;AAAA,EACA,OAAO,MAAM;AACT,IAAAC,SAAQ,IAAI;AACZ,IAAAF,QAAO,IAAI;AACX,WAAOD,WAAU,IAAI;AACrB,UAAM,EAAE,QAAQ,SAAS,IAAI;AAC7B,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAM;AAC1B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,UAAI,SAAS,UAAU;AACnB,eAAO,YAAY,MAAM,KAAK,OAAO;AACjC,eAAK,QAAQ,MAAM,GAAG;AAC1B;AAAA,MACJ;AACA,aAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,WAAK,OAAO;AACZ,aAAO;AACP,UAAI,KAAK,QAAQ,UAAU;AACvB,aAAK,QAAQ,QAAQ,GAAG,KAAK;AAC7B,aAAK,MAAM;AAAA,MACf;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA,EACA,UAAU;AAEN,SAAK,YAAY;AACjB,IAAAE,OAAM,KAAK,GAAG,KAAK,GAAG,KAAK,QAAQ,KAAK,GAAG;AAAA,EAC/C;AAAA,EACA,WAAW,KAAK;AACZ,IAAAC,SAAQ,IAAI;AACZ,IAAAC,SAAQ,KAAK,IAAI;AACjB,SAAK,WAAW;AAChB,UAAM,EAAE,QAAQ,EAAE,IAAI;AACtB,QAAI,EAAE,IAAI,IAAI;AACd,QAAI,KAAK;AAIL,aAAO,KAAK,IAAI;AAChB,aAAO,MAAM,IAAI;AACb,eAAO,GAAG,IAAI;AAClB,WAAK,QAAQ,QAAQ,GAAG,IAAI;AAAA,IAChC;AACA,SAAK,SAAS;AACd,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,UAAI,MAAM,IAAI,EAAE,CAAC,MAAM;AACvB,UAAI,MAAM,IAAI,EAAE,CAAC,MAAM;AAAA,IAC3B;AAAA,EACJ;AAAA,EACA,SAAS;AACL,UAAM,EAAE,QAAQ,UAAU,IAAI;AAC9B,SAAK,WAAW,MAAM;AAEtB,UAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAQ;AACb,WAAO;AAAA,EACX;AACJ;AAgBO,IAAM,WAA2B,mCAAmB,IAAI,CAAC,QAAQ,IAAI,SAAS,GAAG,CAAC;;;AC/RzF,SAAS,WAAWC,IAAG,GAAG,GAAG,KAAK,KAAK,SAAS,IAAI;AAChD,MAAI,MAAMA,GAAE,CAAC,GAAG,MAAMA,GAAE,CAAC,GAAG,MAAMA,GAAE,CAAC,GAAG,MAAMA,GAAE,CAAC,GACjD,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAC7C,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAC7C,MAAM,KAAK,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC;AAE5C,MAAI,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM;AAC/K,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG;AAChC,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,EAAE;AACxB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AACvB,UAAO,MAAM,MAAO;AACpB,UAAM,KAAK,MAAM,KAAK,CAAC;AAAA,EAC3B;AAEA,MAAI,KAAK;AACT,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC1B,MAAI,IAAI,IAAK,MAAM,MAAO;AAC9B;AA8FO,IAAM,WAA2B,6BAAa,YAAY;AAAA,EAC7D,cAAc;AAAA,EACd,eAAe;AAAA,EACf,gBAAgB;AACpB,CAAC;AAkFD,IAAM,UAA0B,oBAAI,WAAW,EAAE;AAEjD,IAAM,eAAe,CAAC,GAAG,QAAQ;AAC7B,IAAE,OAAO,GAAG;AACZ,QAAM,WAAW,IAAI,SAAS;AAC9B,MAAI;AACA,MAAE,OAAO,QAAQ,SAAS,QAAQ,CAAC;AAC3C;AAGA,IAAM,UAA0B,oBAAI,WAAW,EAAE;AACjD,SAAS,WAAW,IAAI,KAAK,OAAO,YAAY,KAAK;AACjD,MAAI,QAAQ;AACR,IAAAC,QAAO,KAAK,QAAW,KAAK;AAGhC,QAAM,UAAU,GAAG,KAAK,OAAO,OAAO;AACtC,QAAM,UAAU,WAAW,WAAW,QAAQ,MAAM,IAAI,SAAS,GAAG,IAAI;AAIxE,QAAM,IAAI,SAAS,OAAO,OAAO;AACjC,MAAI;AACA,iBAAa,GAAG,GAAG;AACvB,eAAa,GAAG,UAAU;AAC1B,IAAE,OAAO,OAAO;AAChB,QAAM,MAAM,EAAE,OAAO;AACrB,EAAAC,OAAM,SAAS,OAAO;AACtB,SAAO;AACX;AAQO,IAAM,iBAAiB,CAAC,cAAc,CAAC,KAAK,OAAO,QAAQ;AAG9D,QAAM,YAAY;AAClB,SAAO;AAAA,IACH,QAAQ,WAAW,QAAQ;AACvB,YAAM,UAAU,UAAU;AAC1B,eAAS,UAAU,UAAU,WAAW,QAAQ,KAAK;AACrD,aAAO,IAAI,SAAS;AACpB,YAAM,SAAS,OAAO,SAAS,GAAG,CAAC,SAAS;AAE5C,gBAAU,KAAK,OAAO,QAAQ,QAAQ,CAAC;AACvC,YAAM,MAAM,WAAW,WAAW,KAAK,OAAO,QAAQ,GAAG;AACzD,aAAO,IAAI,KAAK,OAAO;AACvB,MAAAA,OAAM,GAAG;AACT,aAAO;AAAA,IACX;AAAA,IACA,QAAQ,YAAY,QAAQ;AACxB,eAAS,UAAU,WAAW,SAAS,WAAW,QAAQ,KAAK;AAC/D,YAAM,OAAO,WAAW,SAAS,GAAG,CAAC,SAAS;AAC9C,YAAM,YAAY,WAAW,SAAS,CAAC,SAAS;AAChD,YAAM,MAAM,WAAW,WAAW,KAAK,OAAO,MAAM,GAAG;AAGvD,UAAI,CAACC,YAAW,WAAW,GAAG,GAAG;AAC7B,QAAAD,OAAM,GAAG;AACT,cAAM,IAAI,MAAM,aAAa;AAAA,MACjC;AACA,aAAO,IAAI,WAAW,SAAS,GAAG,CAAC,SAAS,CAAC;AAE7C,gBAAU,KAAK,OAAO,QAAQ,QAAQ,CAAC;AACvC,MAAAA,OAAM,GAAG;AACT,aAAO;AAAA,IACX;AAAA,EACJ;AACJ;AAuBO,IAAM,mBAAmC;AAAA,EAAW,EAAE,WAAW,IAAI,aAAa,IAAI,WAAW,IAAI,SAAS,KAAK;AAAA,EAC1G,+BAAe,QAAQ;AAAC;;;ACvYxC,IAAME,WAAU;AAEhB,SAAS,YAAY,GAAS;AAC5B,QAAM,IAAI,IAAI,WAAW,EAAE;AAC3B,MAAI,SAAS,EAAE,MAAM,EAAE,aAAa,GAAG,GAAG,IAAI;AAC9C,SAAO;AACT;AA2CA,SAAS,MAAM,GAAY,IAAyB;AAClD,MAAI,aAAa;AAAa,WAAO;AACrC,SAAO,IAAI,YAAY,IAAI,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;AACvE;AAEO,IAAM,aAA0B,uBAAK;AAC1C,QAAM,SAAS;AACf,QAAM,SAAS;AACf,SAAO;IACL,MAAM;IACN;IACA;IACA,QAAQ,KAAK,OAAO,IAAI,WAAW,KAAG;AACpC,YAAM,KAAK,iBAAiB,KAAK,YAAY,KAAK,GAAG,EAAE,EAAE,QAAQ,SAAS;AAC1E,UAAI,IAAI,EAAE;IACZ;IACA,eAAe,KAAK,OAAO,IAAI,OAAO,cAAY;AAChD,YAAM,MAAM,MAAM,SAAS,GAAG,eAAe,MAAM;AACnD,YAAM,KAAK,MAAM,SAAS,GAAG,YAAY;AACzC,UAAI;AACF,cAAM,KAAK,iBAAiB,KAAK,YAAY,KAAK,GAAG,EAAE,EAAE,QAAQ,EAAE;AACnE,YAAI,IAAI,EAAE;AACV,eAAO,GAAG;MACZ,SAAS,GAAG;AACV,cAAM,MAAM,GAAG,SAAS;MAC1B;IACF;IACA,QAAQ,KAAK,OAAO,IAAI,YAAY,KAAG;AACrC,UAAI;AACF,cAAM,KAAK,iBAAiB,KAAK,YAAY,KAAK,GAAG,EAAE,EAAE,QAAQ,UAAU;AAC3E,YAAI,IAAI,EAAE;MACZ,SAAS,GAAG;AACV,cAAM,MAAM,GAAG,SAAS;MAC1B;IACF;IACA,eAAe,KAAK,OAAO,IAAI,OAAO,eAAa;AACjD,YAAM,MAAM,MAAM,SAAS,GAAG,aAAa;AAC3C,UAAI;AACF,cAAM,KAAK,iBAAiB,KAAK,YAAY,KAAK,GAAG,EAAE,EAAE,QAAQ,GAAG;AACpE,cAAM,IAAI,EAAE;AACZ,eAAO,GAAG;MACZ,SAAS,GAAG;AACV,cAAM,MAAM,GAAG,SAAS;MAC1B;IACF;IACA,MAAM,KAAG;AACP,YAAM,OAAO,IAAI,WAAW,cAAc,WAAW;AACrD,YAAM,IAAI,IAAI,WAAW,MAAM;AAC/B,YAAM,KAAK,iBAAiB,KAAK,YAAYC,QAAO,GAAG,IAAI,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC;AACnF,WAAK,IAAI,EAAE;AACX,aAAO,KAAK,SAAS,GAAG,MAAM;IAChC;;AAEJ,GAAE;;;ACQI,SAAU,UAAO;AACrB,SAAO,IAAI,iBAAiB,MAAM,CAAA,GAAI;IAAA;;EAAA,GAAW;IAC/C;MAAA;MAAA;MAAA;MAAA;;IAAA;KACC,CAAC;IAAA;IAAA;IAAA;;EAAA,CAA6B,CAAC;AACpC;;;AC9GO,IAAM,oBAAoB;AAiB3B,IAAO,iBAAP,MAAqB;EACR;EACA;EACT;EACA,YAAY;EAEpB,YAAY,SAA8B;AACxC,UAAM,eAAe,WAAW,QAAQ,iBAAiB,mBAAmB;AAC5E,UAAM,cAAc,WAAW,QAAQ,gBAAgB,kBAAkB;AACzE,SAAK,uBAAuB,WAAW,QAAQ,iBAAiB,mBAAmB;AACnF,UAAM,YAAY,QAAQ,SAAS;AACnC,SAAK,YAAY,IAAI,YAAY,QAAO,GAAI;MAC1C,UAAU,WAAW,KAAK,QAAQ,QAAQ;MAC1C;MACA,GAAG,EAAE,WAAW,cAAc,WAAW,YAAW;MACpD,GAAI,YAAY,EAAE,IAAI,WAAW,KAAK,KAAK,oBAAoB,EAAC,IAAK,CAAA;MACrE,QAAQ;MACR,MAAM;MACN,KAAK,QAAQ,UAAU;KACxB;AACD,QAAI,KAAK,UAAU,QAAO,MAAO,mBAAmB;AAClD,YAAM,IAAI,kBAAkB,wBAAwB,yDAAyD;IAC/G;EACF;EAEA,IAAI,WAAQ;AAA+B,WAAO;EAAkB;EAEpE,IAAI,WAAQ;AAAc,WAAO,KAAK,cAAc;EAAU;EAE9D,IAAI,oBAAiB;AACnB,SAAK,WAAU;AACf,WAAO,CAAC,KAAK,YAAY,KAAK,UAAU,YAAW;EACrD;EAEA,eAAe,UAAU,IAAI,WAAU,GAAE;AACvC,SAAK,gBAAgB,KAAK;AAC1B,UAAM,SAAS,IAAI,WAAW,QAAQ,aAAa,KAAK,UAAU,uBAAsB,CAAE;AAC1F,UAAM,SAAS,KAAK,UAAU,aAAa,SAAS,MAAM;AAC1D,SAAK,cAAa;AAClB,WAAO,OAAO,MAAM,GAAG,MAAM;EAC/B;EAEA,cAAc,SAAmB;AAC/B,SAAK,gBAAgB,IAAI;AACzB,UAAM,SAAS,IAAI,WAAW,QAAQ,UAAU;AAChD,UAAM,SAAS,KAAK,UAAU,YAAY,SAAS,MAAM;AACzD,SAAK,mBAAkB;AACvB,SAAK,cAAa;AAClB,WAAO,OAAO,MAAM,GAAG,MAAM;EAC/B;EAEA,QAAQ,WAAqB;AAC3B,SAAK,WAAU;AACf,QAAI,KAAK,cAAc;AAAW,YAAM,IAAI,kBAAkB,mBAAmB,sCAAsC;AACvH,WAAO,KAAK,UAAU,QAAQ,SAAS;EACzC;EAEA,QAAQ,YAAsB;AAC5B,SAAK,WAAU;AACf,QAAI,KAAK,cAAc;AAAW,YAAM,IAAI,kBAAkB,mBAAmB,sCAAsC;AACvH,WAAO,KAAK,UAAU,WAAW,UAAU;EAC7C;EAEA,iBAAc;AACZ,QAAI,KAAK,cAAc;AAAW,aAAO;AACzC,WAAO,KAAK,UAAU,aAAY;EACpC;EAEA,mBAAgB;AACd,QAAI,KAAK,cAAc;AAAW,aAAO;AACzC,WAAO,KAAK,UAAU,eAAc;EACtC;EAEA,UAAO;AACL,SAAK,YAAY;AACjB,SAAK,qBAAqB,KAAK,CAAC;AAChC,SAAK,YAAY;EACnB;EAEQ,gBAAa;AACnB,QAAI,CAAC,KAAK,UAAU,WAAU;AAAI;AAClC,SAAK,mBAAkB;AACvB,SAAK,YAAY,KAAK,UAAU,SAAQ;EAC1C;EAEQ,qBAAkB;AACxB,UAAM,SAAS,KAAK,UAAU,gBAAe;AAC7C,QAAI,WAAW,UAAa,CAAC,kBAAkB,QAAQ,KAAK,oBAAoB,GAAG;AACjF,WAAK,QAAO;AACZ,YAAM,IAAI,kBAAkB,0BAA0B,uDAAuD;IAC/G;EACF;EAEQ,gBAAgB,SAAgB;AACtC,SAAK,WAAU;AACf,QAAI,KAAK;AAAU,YAAM,IAAI,kBAAkB,uBAAuB,0CAA0C;AAChH,QAAI,KAAK,UAAU,YAAW,MAAO,SAAS;AAC5C,YAAM,IAAI,kBAAkB,yBAAyB,mDAAmD;IAC1G;EACF;EAEQ,aAAU;AAChB,QAAI,KAAK;AAAW,YAAM,IAAI,kBAAkB,mBAAmB,8BAA8B;EACnG;;AAGI,IAAO,oBAAP,cAAiC,MAAK;EACrB;EAArB,YAAqB,MAAc,SAAe;AAAI,UAAM,OAAO;AAA9C,SAAA,OAAA;EAAgD;;AAGjE,SAAU,oBAAoB,cAAsB,cAAsB,gBAAsB;AACpG,aAAW,CAACC,OAAM,KAAK,KAAK,OAAO,QAAQ,EAAE,cAAc,cAAc,eAAc,CAAE,GAAG;AAC1F,QAAI,MAAM,WAAW,KAAK,MAAM,SAAS,IAAI;AAAG,YAAM,IAAI,UAAU,GAAGA,KAAI,mCAAmC;EAChH;AACA,SAAO,IAAI,YAAW,EAAG,OACvB,+BAA+B,YAAY,UAAU,YAAY,YAAY,cAAc,EAAE;AAEjG;AAEA,SAAS,WAAW,OAAe,OAAa;AAC9C,QAAM,MAAMC,eAAc,KAAK;AAC/B,MAAI,IAAI,eAAe;AAAI,UAAM,IAAI,kBAAkB,eAAe,GAAG,KAAK,gCAAgC;AAC9G,SAAO,WAAW,KAAK,GAAG;AAC5B;AAEA,SAAS,kBAAkB,MAAkB,OAAiB;AAC5D,MAAI,KAAK,eAAe,MAAM;AAAY,WAAO;AACjD,MAAI,YAAY;AAChB,WAAS,QAAQ,GAAG,QAAQ,KAAK,YAAY,SAAS;AAAG,iBAAa,KAAK,KAAK,IAAK,MAAM,KAAK;AAChG,SAAO,cAAc;AACvB;;;AC7IM,SAAU,gBAAgB,iBAA4B;AAC1D,QAAM,aAAa,mBAAmB,OAAO,MAAM,iBAAgB;AACnE,MAAI,WAAW,eAAe;AAAI,UAAM,IAAI,MAAM,sCAAsC;AACxF,QAAM,YAAY,OAAO,aAAa,UAAU;AAChD,SAAO;IACL,YAAYC,aAAY,UAAU;IAClC,WAAWA,aAAY,SAAS;;AAEpC;AAqBM,SAAUC,aAAY,OAAiB;AAC3C,QAAM,SAAS,MAAM,KAAK,OAAO,UAAQ,OAAO,aAAa,IAAI,CAAC,EAAE,KAAK,EAAE;AAC3E,QAAM,SAAS,OAAO,SAAS,aAC3B,KAAK,MAAM,IACX,OAAO,KAAK,KAAK,EAAE,SAAS,QAAQ;AACxC,SAAO,OAAO,WAAW,KAAK,GAAG,EAAE,WAAW,KAAK,GAAG,EAAE,WAAW,KAAK,EAAE;AAC5E;AAEM,SAAUC,eAAc,OAAa;AACzC,QAAM,aAAa,MAAM,WAAW,KAAK,GAAG,EAAE,WAAW,KAAK,GAAG;AACjE,QAAM,SAAS,WAAW,OAAO,KAAK,KAAK,WAAW,SAAS,CAAC,IAAI,GAAG,GAAG;AAC1E,MAAI,OAAO,SAAS,YAAY;AAC9B,WAAO,WAAW,KAAK,KAAK,MAAM,GAAG,UAAQ,KAAK,WAAW,CAAC,CAAC;EACjE;AACA,SAAO,IAAI,WAAW,OAAO,KAAK,QAAQ,QAAQ,CAAC;AACrD;;;ACtDO,IAAM,wBAAN,MAAuD;AAAA,EAO5D,YACmB,OACA,UACA,MACjB;AAHiB;AACA;AACA;AAAA,EAChB;AAAA,EAVK;AAAA,EACA;AAAA,EACS,WAAW,IAAI,mBAAmB;AAAA,EAClC,WAAW,IAAI,mBAAmB;AAAA,EAC3C,SAAS;AAAA,EAQjB,MAAM,UAAyB;AAC7B,SAAK,SAAS;AACd,SAAK,SAAS,MAAM;AACpB,SAAK,SAAS,MAAM;AACpB,UAAM,KAAK,MAAM,QAAQ;AACzB,UAAM,OAAO,KAAK,MAAM,eAAe;AACvC,QAAI,KAAK,kBAAkB,KAAK,SAAS,YAAY,KAAK,mBAAmB,KAAK,KAAK,UAAU;AAC/F,YAAM,KAAK,MAAM,MAAM;AACvB,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AACA,UAAM,QAAQ,IAAI,eAAe;AAAA,MAC/B,MAAM;AAAA,MACN,iBAAiB,KAAK,SAAS;AAAA,MAC/B,gBAAgB,KAAK,SAAS;AAAA,MAC9B,iBAAiB,KAAK,KAAK;AAAA,MAC3B,UAAU,oBAAoB,KAAK,cAAc,KAAK,KAAK,UAAU,KAAK,SAAS,QAAQ;AAAA,IAC7F,CAAC;AACD,SAAK,QAAQ;AACb,QAAI;AACF,YAAM,iBAAiB,KAAK,OAAO,KAAK;AAAA,IAC1C,SAAS,OAAO;AACd,YAAM,QAAQ;AACd,WAAK,QAAQ;AACb,YAAM,KAAK,MAAM,MAAM;AACvB,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,KAAK,MAAiC;AAC1C,eAAW,aAAa,KAAK,SAAS,OAAO,IAAI,GAAG;AAClD,YAAM,KAAK,MAAM,KAAK,KAAK,aAAa,EAAE,QAAQ,SAAS,CAAC;AAAA,IAC9D;AAAA,EACF;AAAA,EAEA,UAAU,SAAiD;AACzD,SAAK,mBAAmB;AACxB,SAAK,mBAAmB,KAAK,MAAM,UAAU,UAAQ;AACnD,YAAM,QAAQ,KAAK;AACnB,UAAI,UAAU,UAAa,CAAC,MAAM,YAAY,KAAK,OAAQ;AAC3D,UAAI;AACF,cAAM,UAAU,KAAK,SAAS,OAAO,MAAM,QAAQ,IAAI,CAAC;AACxD,YAAI,YAAY,OAAW,SAAQ,OAAO;AAAA,MAC5C,QAAQ;AACN,aAAK,KAAK,MAAM;AAAA,MAClB;AAAA,IACF,CAAC;AACD,WAAO,MAAM;AACX,WAAK,mBAAmB;AACxB,WAAK,mBAAmB;AAAA,IAC1B;AAAA,EACF;AAAA,EAEA,QAAQ,SAAiC;AACvC,WAAO,KAAK,MAAM,UAAU,OAAO,MAAM,MAAM;AAAA,EACjD;AAAA,EAEA,MAAM,QAAuB;AAC3B,QAAI,KAAK,OAAQ;AACjB,SAAK,SAAS;AACd,SAAK,mBAAmB;AACxB,SAAK,mBAAmB;AACxB,SAAK,SAAS,MAAM;AACpB,SAAK,SAAS,MAAM;AACpB,SAAK,OAAO,QAAQ;AACpB,SAAK,QAAQ;AACb,UAAM,KAAK,MAAM,MAAM;AAAA,EACzB;AAAA,EAEA,WAAW;AAAE,WAAO,KAAK,MAAM,SAAS;AAAA,EAAE;AAAA,EAElC,eAA+B;AACrC,QAAI,KAAK,UAAU,UAAa,CAAC,KAAK,MAAM,YAAY,KAAK,QAAQ;AACnE,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACrE;AACA,WAAO,KAAK;AAAA,EACd;AACF;AAEA,eAAe,iBAAiB,OAAiC,OAAsC;AACrG,QAAM,IAAI,QAAc,CAACC,UAAS,WAAW;AAC3C,QAAI,UAAU;AACd,UAAM,QAAQ,WAAW,MAAM,OAAO,IAAI,MAAM,+BAA+B,CAAC,GAAG,GAAM;AACzF,UAAM,cAAc,MAAM,YAAY,CAAC,MAAM,SAAS;AACpD,UAAI,QAAS;AACb,UAAI;AACF,YAAI,SAAS,EAAG,OAAM,IAAI,MAAM,4DAA4D;AAC5F,cAAM,cAAc,IAAI;AACxB,YAAI,CAAC,MAAM,SAAU,OAAM,IAAI,MAAM,sCAAsC;AAC3E,eAAO;AAAA,MACT,SAAS,OAAO;AACd,eAAO,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,4BAA4B,CAAC;AAAA,MACjF;AAAA,IACF,CAAC;AACD,UAAM,SAAS,CAAC,UAAwB;AACtC,UAAI,QAAS;AACb,gBAAU;AACV,mBAAa,KAAK;AAClB,kBAAY;AACZ,UAAI,UAAU,OAAW,CAAAA,SAAQ;AAAA,UAC5B,QAAO,KAAK;AAAA,IACnB;AACA,SAAK,MAAM,cAAc,GAAG,MAAM,eAAe,CAAC,EAAE,MAAM,WAAS;AACjE,aAAO,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,4BAA4B,CAAC;AAAA,IACjF,CAAC;AAAA,EACH,CAAC;AACH;;;AC5HA,SAAS,eAAAC,oBAAmB;AAErB,SAAS,OAAO,MAAM,KAAK,IAAI,GAAW;AAC/C,MAAI,CAAC,OAAO,cAAc,GAAG,KAAK,MAAM,KAAK,MAAM,iBAAgB;AACjE,UAAM,IAAI,WAAW,wDAAwD;AAAA,EAC/E;AACA,QAAM,QAAQA,aAAY,EAAE;AAC5B,MAAI,YAAY,OAAO,GAAG;AAC1B,WAAS,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG;AAC1C,UAAM,KAAK,IAAI,OAAO,YAAY,KAAK;AACvC,kBAAc;AAAA,EAChB;AACA,QAAM,CAAC,IAAI,MAAQ,MAAM,CAAC,IAAK;AAC/B,QAAM,CAAC,IAAI,MAAQ,MAAM,CAAC,IAAK;AAC/B,QAAM,MAAM,MAAM,SAAS,KAAK;AAChC,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,CAAC,IAAI,IAAI,MAAM,IAAI,EAAE,CAAC,IAAI,IAAI,MAAM,IAAI,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,CAAC;AAC1G;;;ACCO,IAAM,wBAAN,MAA4B;AAAA,EAGjC,YAA6B,QAA0B;AAA1B;AAC3B,UAAM,OAAO,CAAC,WAA+B,CAAC,SAAS,WAAW,KAAK,KAAK,QAAQ,SAAS,MAAM;AACnG,SAAK,MAAM;AAAA,MACT,UAAU;AAAA,QACR,MAAM,KAAK,cAAc;AAAA,QACzB,QAAQ,KAAK,gBAAgB;AAAA,QAC7B,QAAQ,KAAK,gBAAgB;AAAA,QAC7B,SAAS,KAAK,iBAAiB;AAAA,QAC/B,QAAQ,KAAK,gBAAgB;AAAA,QAC7B,aAAa,KAAK,qBAAqB;AAAA,QACvC,QAAQ,KAAK,gBAAgB;AAAA,QAC7B,MAAM,KAAK,cAAc;AAAA,QACzB,QAAQ,KAAK,gBAAgB;AAAA,QAC7B,YAAY,KAAK,oBAAoB;AAAA,QACrC,aAAa,KAAK,qBAAqB;AAAA,QACvC,QAAQ,KAAK,gBAAgB;AAAA,MAC/B;AAAA,MACA,WAAW;AAAA,QACT,MAAM,KAAK,eAAe;AAAA,QAC1B,SAAS,KAAK,kBAAkB;AAAA,QAChC,QAAQ,KAAK,iBAAiB;AAAA,QAC9B,WAAW,KAAK,oBAAoB;AAAA,MACtC;AAAA,MACA,MAAM;AAAA,QACJ,UAAU,KAAK,eAAe;AAAA,QAC9B,eAAe,KAAK,oBAAoB;AAAA,QACxC,eAAe,KAAK,oBAAoB;AAAA,QACxC,iBAAiB,KAAK,sBAAsB;AAAA,QAC5C,UAAU,KAAK,eAAe;AAAA,MAChC;AAAA,MACA,WAAW;AAAA,QACT,MAAM,KAAK,gBAAgB;AAAA,QAC3B,QAAQ,KAAK,kBAAkB;AAAA,QAC/B,QAAQ,KAAK,kBAAkB;AAAA,QAC/B,QAAQ,KAAK,kBAAkB;AAAA,QAC/B,cAAc,KAAK,wBAAwB;AAAA,QAC3C,qBAAqB,KAAK,+BAA+B;AAAA,QACzD,gBAAgB,KAAK,0BAA0B;AAAA,MACjD;AAAA,MACA,QAAQ,EAAE,MAAM,KAAK,YAAY,EAAW;AAAA,MAC5C,cAAc;AAAA,QACZ,MAAM,KAAK,kBAAkB;AAAA,QAC7B,QAAQ,KAAK,oBAAoB;AAAA,QACjC,MAAM,KAAK,kBAAkB;AAAA,QAC7B,MAAM,KAAK,kBAAkB;AAAA,QAC7B,cAAc,KAAK,0BAA0B;AAAA,QAC7C,QAAQ,KAAK,oBAAoB;AAAA,MACnC;AAAA,MACA,OAAO;AAAA,QACL,QAAQ,KAAK,aAAa;AAAA,QAC1B,MAAM,KAAK,WAAW;AAAA,QACtB,OAAO,KAAK,YAAY;AAAA,QACxB,QAAQ,KAAK,aAAa;AAAA,QAC1B,UAAU,KAAK,eAAe;AAAA,QAC9B,OAAO,KAAK,YAAY;AAAA,MAC1B;AAAA,MACA,UAAU;AAAA,QACR,UAAU,KAAK,mBAAmB;AAAA,QAClC,cAAc,KAAK,uBAAuB;AAAA,QAC1C,QAAQ,KAAK,iBAAiB;AAAA,QAC9B,SAAS,KAAK,kBAAkB;AAAA,QAChC,QAAQ,KAAK,iBAAiB;AAAA,MAChC;AAAA,MACA,aAAa;AAAA,QACX,UAAU,KAAK,sBAAsB;AAAA,QACrC,KAAK,KAAK,iBAAiB;AAAA,QAC3B,OAAO,KAAK,mBAAmB;AAAA,MACjC;AAAA,MACA,KAAK;AAAA,QACH,WAAW,KAAK,eAAe;AAAA,QAC/B,QAAQ,KAAK,YAAY;AAAA,QACzB,gBAAgB,KAAK,oBAAoB;AAAA,MAC3C;AAAA,MACA,QAAQ;AAAA,QACN,KAAK,CAAC,SAAS,WAAW,KAAK,OAAiB,OAAO,SAAS,MAAM;AAAA,QACtE,MAAM,CAAC,SAAS,WAAW,KAAK,OAAkB,QAAQ,SAAS,MAAM;AAAA,MAC3E;AAAA,MACA,WAAW,CAAC;AAAA,MACZ,SAAS,aAAW,KAAK,QAAQ,OAAO;AAAA,IAC1C;AAAA,EACF;AAAA,EAlFS;AAAA,EAoFT,MAAc,KAAK,QAAgB,SAAwB,QAA+C;AACxG,UAAM,WAAW,MAAM,KAAK,OAAO,IAAoB,oBAAoB;AAAA,MACzE;AAAA,MACA,OAAO,OAAO,QAAQ,KAAK;AAAA,MAC3B,SAAS,QAAQ;AAAA,IACnB,GAAG,MAAM;AACT,QAAI,OAAO,SAAS,KAAK,MAAM,OAAO,QAAQ,KAAK,KAAK,OAAO,SAAS,WAAW,YAAY,SAAS,WAAW,MAAM;AACvH,YAAM,IAAI,MAAM,2DAA2D;AAAA,IAC7E;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,QAAQ,SAA4E;AAChG,WAAO,KAAK,OAAO,IAAI,uBAAuB,EAAE,QAAQ,CAAC;AAAA,EAC3D;AAAA,EAEA,OAAe,OACb,QACA,SACA,QACmC;AACnC,UAAM,WAAW,OAAO;AACxB,UAAM,QAAQ,IAAI,gBAAwB;AAC1C,UAAM,cAAc,KAAK,OAAO,QAAQ,WAAS,iBAAiB,OAAO,UAAU,KAAK,CAAC;AACzF,UAAM,mBAAmB,KAAK,OAAO,QAAQ,MAAM,MAAM,MAAM,CAAC;AAChE,UAAM,UAAU,MAAM,MAAM,MAAM;AAClC,WAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACxD,QAAI;AACF,UAAI;AACF,cAAM,KAAK,OAAO,IAAI,2BAA2B;AAAA,UAC/C;AAAA,UACA;AAAA,UACA,OAAO,OAAO,QAAQ,KAAK;AAAA,UAC3B,SAAS,QAAQ;AAAA,QACnB,GAAG,MAAM;AACT,yBAAiB,SAAS,MAAO,OAAM;AAAA,MACzC,SAAS,OAAO;AAKd,YAAI,CAAC,mBAAmB,KAAK,EAAG,OAAM;AAAA,MACxC;AAAA,IACF,UAAE;AACA,aAAO,oBAAoB,SAAS,OAAO;AAC3C,kBAAY;AACZ,uBAAiB;AACjB,YAAM,MAAM;AACZ,YAAM,KAAK,OAAO,IAAI,4BAA4B,EAAE,SAAS,CAAC,EAAE,MAAM,MAAM,MAAS;AAAA,IACvF;AAAA,EACF;AACF;AAEA,SAAS,mBAAmB,OAAyB;AACnD,SAAO,iBAAiB,UAAU,MAAM,YAAY,6BAA6B,MAAM,YAAY;AACrG;AAEA,IAAM,kBAAN,MAA2E;AAAA,EACxD,SAA+B,CAAC;AAAA,EAChC,UAAuE,CAAC;AAAA,EACjF,SAAS;AAAA,EAEjB,KAAK,OAAiC;AACpC,QAAI,KAAK,OAAQ;AACjB,UAAM,SAAS,KAAK,QAAQ,MAAM;AAClC,QAAI,WAAW,OAAW,MAAK,OAAO,KAAK,KAAK;AAAA,QAC3C,QAAO,EAAE,MAAM,OAAO,MAAM,CAAC;AAAA,EACpC;AAAA,EAEA,QAAc;AACZ,QAAI,KAAK,OAAQ;AACjB,SAAK,SAAS;AACd,eAAW,UAAU,KAAK,QAAQ,OAAO,CAAC,EAAG,QAAO,EAAE,MAAM,MAAM,OAAO,OAAU,CAAC;AAAA,EACtF;AAAA,EAEA,QAAQ,OAAO,aAAa,IAAuC;AACjE,WAAO,MAAM;AACX,YAAM,QAAQ,KAAK,OAAO,MAAM;AAChC,UAAI,UAAU,QAAW;AACvB,cAAM;AACN;AAAA,MACF;AACA,UAAI,KAAK,OAAQ;AACjB,YAAM,OAAO,MAAM,IAAI,QAA4C,CAAAC,aAAW,KAAK,QAAQ,KAAKA,QAAO,CAAC;AACxG,UAAI,KAAK,KAAM;AACf,YAAM,KAAK;AAAA,IACb;AAAA,EACF;AACF;AAEA,SAAS,iBAAyB,OAAqB,UAAkB,OAAsC;AAC7G,MAAI,MAAM,UAAU,qBAAqB;AACvC,UAAM,OAAO,MAAM;AACnB,QAAI,KAAK,aAAa,YAAY,OAAO,KAAK,UAAU,YAAY,KAAK,UAAU,QAC9E,OAAO,KAAK,MAAM,UAAU,YAAY,EAAE,aAAa,KAAK,OAAQ;AACzE,UAAM,KAAK,KAAK,KAA2B;AAAA,EAC7C;AACA,MAAI,MAAM,UAAU,6BAA6B;AAC/C,UAAM,OAAO,MAAM;AACnB,QAAI,KAAK,aAAa,SAAU,OAAM,MAAM;AAAA,EAC9C;AACF;;;AC3MA,SAAS,gBAAgB;;;ACAzB,SAAS,gBAAgB;AACzB,OAAO,OAAO;AAiCP,IAAM,SAAoB,EAAE,OAAO;AAAA,EACxC,SAAS,EAAE,QAAQ;AAAA,EACnB,MAAM,EAAE,MAAM,CAAC,QAAQ,UAAU,MAAM,CAAU;AAAA,EACjD,WAAW,EAAE,OAAO;AAAA,EACpB,YAAY,EAAE,OAAO;AAAA,EACrB,YAAY,EAAE,QAAQ;AAAA,EACtB,UAAU,EAAE,MAAM,CAAC,SAAS,QAAQ,QAAQ,OAAO,CAAU;AAAA,EAC7D,WAAW,EAAE,MAAM;AAAA,IACjB,EAAE,QAAQ;AAAA,IACV,EAAE,OAAO;AAAA,MACP,gBAAgB,EAAE,OAAO;AAAA,MACzB,YAAY,EAAE,OAAO;AAAA,MACrB,QAAQ,EAAE,OAAO;AAAA,IACnB,CAAC;AAAA,EACH,CAAC;AACH,CAAC;AAED,IAAM,kBAAkB,iBAAE,MAAM;AAAA,EAC9B,iBAAE,QAAQ;AAAA,EACV,iBAAE,OAAO;AAAA,IACP,gBAAgB,iBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE,IAAI,GAAM,EAAE,SAAS;AAAA,IAC/D,YAAY,iBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAK,EAAE,IAAI,GAAO,EAAE,SAAS;AAAA,IAC9D,QAAQ,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAC5C,CAAC,EAAE,OAAO;AACZ,CAAC;AAED,IAAM,eAAe,iBAAE,OAAO;AAAA,EAC5B,SAAS,iBAAE,QAAQ,EAAE,SAAS;AAAA,EAC9B,MAAM,iBAAE,KAAK,CAAC,QAAQ,UAAU,MAAM,CAAC,EAAE,SAAS;AAAA,EAClD,WAAW,iBAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACrC,YAAY,iBAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,EACtD,YAAY,iBAAE,QAAQ,EAAE,SAAS;AAAA,EACjC,UAAU,iBAAE,KAAK,CAAC,SAAS,QAAQ,QAAQ,OAAO,CAAC,EAAE,SAAS;AAAA,EAC9D,WAAW,gBAAgB,SAAS;AACtC,CAAC,EAAE,OAAO;AAEH,SAAS,cAAc,QAAgB,CAAC,GAAG,MAAyB,QAAQ,KAAqB;AACtG,QAAM,SAAS,aAAa,MAAM,KAAK;AACvC,QAAM,YAAY,OAAO,OAAO,cAAc,WAAW,OAAO,YAAY,CAAC;AAC7E,QAAM,sBAAsB,OAAO,aAAa,IAAI;AACpD,QAAM,YAAY,wBAAwB,SAAY,SAAY,mBAAmB,mBAAmB;AACxG,QAAM,iBAAiB,UAAU,kBAAkB;AACnD,QAAM,aAAa,UAAU,cAAc;AAC3C,MAAI,aAAa,gBAAgB;AAC/B,UAAM,IAAI,UAAU,gFAAgF;AAAA,EACtG;AACA,SAAO;AAAA,IACL,SAAS,OAAO,WAAW;AAAA,IAC3B,MAAM,OAAO,QAAQ;AAAA,IACrB,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,UAAU;AAAA,IAC/C,YAAY,OAAO,cAAc,SAAS;AAAA,IAC1C,YAAY,OAAO,cAAc;AAAA,IACjC,UAAU,OAAO,YAAY;AAAA,IAC7B,WAAW;AAAA,MACT,SAAS,OAAO,cAAc;AAAA,MAC9B;AAAA,MACA;AAAA,MACA,QAAQ,UAAU,UAAU;AAAA,IAC9B;AAAA,EACF;AACF;AAEO,SAAS,mBAAmB,OAAuB;AACxD,QAAM,MAAM,IAAI,IAAI,KAAK;AACzB,QAAM,QAAQ,IAAI,aAAa,eAAe,IAAI,aAAa,eAAe,IAAI,aAAa;AAC/F,MAAI,IAAI,aAAa,YAAY,EAAE,SAAS,IAAI,aAAa,UAAU;AACrE,UAAM,IAAI,UAAU,+DAA+D;AAAA,EACrF;AACA,MAAI,IAAI,aAAa,MAAM,IAAI,aAAa,IAAI;AAC9C,UAAM,IAAI,UAAU,wCAAwC;AAAA,EAC9D;AACA,MAAI,IAAI,WAAW,MAAM,IAAI,SAAS,IAAI;AACxC,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAChF;AACA,MAAI,IAAI,aAAa,MAAM,IAAI,aAAa,KAAK;AAC/C,UAAM,IAAI,UAAU,4CAA4C;AAAA,EAClE;AACA,SAAO,IAAI;AACb;;;ACtGO,IAAM,iBAAiB;;;AFqDvB,IAAM,gBAAN,MAAoB;AAAA,EAMzB,YACE,WACiB,OACA,sBAA2C,OAC3C,OAA0B,QAC3C;AAHiB;AACA;AACA;AAEjB,SAAK,UAAU,mBAAmB,SAAS;AAAA,EAC7C;AAAA,EAZS;AAAA,EACD;AAAA,EACA;AAAA,EACA;AAAA,EAWR,aAAa,UAA8B;AAAE,SAAK,WAAW;AAAA,EAAS;AAAA,EAEtE,uBAAwD;AACtD,QAAI,KAAK,gBAAgB,OAAW,QAAO;AAC3C,WAAO;AAAA,MACL,QAAQ,KAAK,YAAY;AAAA,MACzB,GAAI,KAAK,YAAY,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,KAAK,YAAY,QAAQ;AAAA,IACxF;AAAA,EACF;AAAA,EAEA,MAAM,qBAAoC;AACxC,SAAK,cAAc;AACnB,SAAK,qBAAqB;AAC1B,UAAM,KAAK,MAAM,MAAM;AAAA,EACzB;AAAA,EAEA,MAAM,sBAAqC;AACzC,UAAM,WAAW,KAAK,gBAAgB;AACtC,QAAI,MAAM,KAAK,MAAM,KAAK,KAAK,SAAS,SAAS,QAAQ,MAAM,QAAW;AACxE,YAAM,KAAK,mBAAmB;AAC9B;AAAA,IACF;AACA,QAAI;AACF,YAAM,KAAK,QAAiB,wBAAwB,EAAE,QAAQ,SAAS,CAAC;AAAA,IAC1E,UAAE;AACA,YAAM,KAAK,mBAAmB;AAAA,IAChC;AAAA,EACF;AAAA,EAEA,MAAM,qBAAqB,UAAwB,OAAe,UAAgD;AAChH,SAAK,aAAa,QAAQ;AAC1B,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,QAAQ,WAAW,KAAK,SAAS,WAAW,GAAG;AACjD,YAAM,IAAI,eAAe,mBAAmB,oCAAoC,KAAK;AAAA,IACvF;AACA,UAAM,QAAQ,iBAAiB,MAAM,KAAK,cAAuB,sBAAsB;AAAA,MACrF,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,OAAO,SAAS,SAAS,CAAC;AAAA,IACnD,CAAC,CAAC;AACF,UAAM,KAAK,SAAS,UAAU;AAAA,MAC5B,cAAc,MAAM;AAAA,MACpB,SAAS,MAAM;AAAA,MACf,qBAAqB;AAAA,IACvB,CAAC;AACD,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,SAAS,MAAM;AAAA,MACf,WAAW,MAAM;AAAA,MACjB,SAAS,MAAM;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,MAAM,oBAA6C;AACjD,UAAM,QAAQ,cAAc,MAAM,KAAK,cAAuB,+BAA+B;AAAA,MAC3F,QAAQ;AAAA,MACR,MAAM;AAAA,IACR,CAAC,GAAG,UAAU;AACd,QAAI,OAAO,MAAM,SAAS,YAAY,MAAM,KAAK,SAAS,MACrD,OAAO,MAAM,YAAY,YAAY,CAAC,MAAM,QAAQ,WAAW,GAAG,KAAK,OAAO,GAAG,KACjF,CAAC,OAAO,cAAc,MAAM,SAAS,GAAG;AAC3C,YAAM,IAAI,eAAe,mBAAmB,oDAAoD,KAAK;AAAA,IACvG;AACA,WAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,SAAS,WAAW,MAAM,UAAoB;AAAA,EAC1F;AAAA,EAEA,MAAM,iBAAiB,UAAwB,MAA0C;AACvF,UAAM,QAAQ,cAAc,MAAM,KAAK;AAAA,MACrC,yBAAyB,mBAAmB,IAAI,CAAC;AAAA,MACjD,EAAE,QAAQ,MAAM;AAAA,IAClB,GAAG,iBAAiB;AACpB,QAAI,MAAM,WAAW,aAAa,MAAM,WAAW,UAAW,QAAO,EAAE,QAAQ,MAAM,OAAO;AAC5F,QAAI,MAAM,WAAW,cAAc,OAAO,MAAM,UAAU,YAAY,MAAM,MAAM,SAAS,IAAI;AAC7F,YAAM,IAAI,eAAe,mBAAmB,mDAAmD,KAAK;AAAA,IACtG;AACA,UAAM,UAAU,cAAc,MAAM,KAAK;AAAA,MACvC;AAAA,MACA,EAAE,QAAQ,MAAM;AAAA,MAChB,MAAM;AAAA,IACR,GAAG,iBAAiB;AACpB,QAAI,OAAO,QAAQ,YAAY,YAAY,QAAQ,QAAQ,WAAW,KAAK,OAAO,QAAQ,YAAY,WAAW;AAC/G,YAAM,IAAI,eAAe,mBAAmB,mDAAmD,KAAK;AAAA,IACtG;AACA,UAAM,KAAK,SAAS,UAAU;AAAA,MAC5B,cAAc,MAAM;AAAA,MACpB,SAAS,QAAQ;AAAA,MACjB,qBAAqB;AAAA,IACvB,CAAC;AACD,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,eAAe,EAAE,QAAQ,WAAW,SAAS,QAAQ,SAAS,SAAS,QAAQ,QAAQ;AAAA,IACzF;AAAA,EACF;AAAA,EAEA,MAAM,sBAAsB,UAAwB,MAA4C;AAC9F,QAAI,KAAK,SAAS,QAAQ;AACxB,YAAM,IAAI,eAAe,sBAAsB,6DAA6D,KAAK;AAAA,IACnH;AACA,UAAM,mBAAmB,KAAK,KAAK,EAAE,YAAY;AACjD,QAAI,iBAAiB,WAAW,GAAG;AACjC,YAAM,IAAI,eAAe,mBAAmB,yCAAyC,KAAK;AAAA,IAC5F;AACA,SAAK,aAAa,QAAQ;AAC1B,UAAM,SAAS,MAAM,KAAK,cAAyB,sCAAsC;AAAA,MACvF,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,GAAG,GAAG,MAAM,kBAAkB,QAAQ,KAAK,iBAAiB,QAAQ,EAAE,CAAC;AAAA,IAChG,CAAC;AACD,SAAK,cAAc,MAAM,KAAK,WAAW,UAAU,eAAe,MAAM,GAAG;AAAA,MACzE,qBAAqB;AAAA,IACvB,CAAC;AACD,WAAO,EAAE,QAAQ,yBAAyB;AAAA,EAC5C;AAAA,EAEA,MAAM,mBACJ,UACA,wBACA,SAC8B;AAC9B,SAAK,aAAa,QAAQ;AAC1B,UAAM,SAAS,MAAM,KAAK,cAAyB,uCAAuC;AAAA,MACxF,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,GAAG,GAAG,QAAQ,KAAK,iBAAiB,QAAQ,EAAE,CAAC;AAAA,IACxE,GAAG,sBAAsB;AACzB,SAAK,cAAc,MAAM,KAAK,WAAW,UAAU,eAAe,MAAM,GAAG;AAAA,MACzE,qBAAqB;AAAA,MACrB,GAAI,YAAY,SAAY,CAAC,IAAI,EAAE,QAAQ;AAAA,IAC7C,CAAC;AACD,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,GAAI,YAAY,SAAY,CAAC,IAAI,EAAE,QAAQ;AAAA,IAC7C;AAAA,EACF;AAAA,EAEA,MAAM,aAAa,WAAW,KAAK,gBAAgB,GAA+B;AAChF,SAAK,aAAa,QAAQ;AAC1B,QAAI,KAAK,gBAAgB,UAAa,KAAK,YAAY,uBAAuB,KAAK,IAAI,IAAI,KAAQ;AACjG,aAAO,KAAK;AAAA,IACd;AACA,SAAK,uBAAuB,KAAK,YAAY,QAAQ,EAAE,QAAQ,MAAM;AAAE,WAAK,qBAAqB;AAAA,IAAU,CAAC;AAC5G,SAAK,cAAc,MAAM,KAAK;AAC9B,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAM,qBAAiD;AACrD,UAAM,WAAW,KAAK,gBAAgB;AACtC,UAAM,SAAS,MAAM,KAAK,MAAM,KAAK,KAAK,SAAS,SAAS,QAAQ;AACpE,QAAI,WAAW,UAAa,OAAO,yBAAyB,KAAK,IAAI,EAAG,QAAO,KAAK,SAAS,QAAQ;AACrG,UAAM,SAAS,MAAM,KAAK,cAAyB,wBAAwB;AAAA,MACzE,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,UAAU,SAAS,UAAU,cAAc,OAAO,aAAa,CAAC;AAAA,IACzF,CAAC;AACD,SAAK,cAAc,MAAM,KAAK,MAAM,KAAK;AAAA,MACvC,WAAW,KAAK;AAAA,MAChB,UAAU,SAAS;AAAA,MACnB,qBAAqB,OAAO;AAAA,MAC5B,GAAI,OAAO,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,OAAO,QAAQ;AAAA,MAClE,GAAG,eAAe,MAAM;AAAA,IAC1B,CAAC;AACD,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAM,cAA2C;AAC/C,UAAM,SAAS,MAAM,KAAK,QAA6B,iBAAiB;AACxE,QAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,EAAG,OAAM,IAAI,eAAe,mBAAmB,+CAA+C,KAAK;AAClI,WAAO,OAAO,MAAM,IAAI,eAAe;AAAA,EACzC;AAAA,EAEA,MAAM,UAAU,cAAqD;AACnE,UAAM,SAAS,MAAM,KAAK,QAAiB,mBAAmB,mBAAmB,YAAY,CAAC,EAAE;AAChG,WAAO,oBAAoB,MAAM;AAAA,EACnC;AAAA,EAEA,MAAM,gBAAgB,cAA+C;AACnE,UAAM,SAAS,MAAM,KAAK;AAAA,MACxB,0CAA0C,mBAAmB,YAAY,CAAC;AAAA,IAC5E;AACA,QAAI,CAAC,MAAM,QAAQ,OAAO,UAAU,EAAG,QAAO,CAAC;AAC/C,WAAO,OAAO,WAAW,IAAI,cAAc;AAAA,EAC7C;AAAA,EAEA,MAAM,YAAY,UAAqE;AACrF,UAAM,SAAS,MAAM,KAAK,QAAiC,mBAAmB,mBAAmB,QAAQ,CAAC,WAAW;AACrH,QAAI,OAAO,OAAO,WAAW,aACvB,OAAO,eAAe,QAAQ,OAAO,eAAe,UAAa,CAAC,OAAO,cAAc,OAAO,UAAU,GAAI;AAChH,YAAM,IAAI,eAAe,mBAAmB,gDAAgD,KAAK;AAAA,IACnG;AACA,WAAO,EAAE,QAAQ,OAAO,QAAQ,GAAI,OAAO,OAAO,eAAe,WAAW,EAAE,YAAY,OAAO,WAAW,IAAI,CAAC,EAAG;AAAA,EACtH;AAAA,EAEA,MAAc,YAAY,UAAoD;AAC5E,UAAM,SAAS,MAAM,KAAK,MAAM,KAAK,KAAK,SAAS,SAAS,QAAQ;AACpE,QAAI,WAAW,UAAa,OAAO,yBAAyB,KAAK,IAAI,IAAI,KAAQ;AAC/E,aAAO,KAAK,SAAS,QAAQ;AAAA,IAC/B;AACA,QAAI,OAAO,uBAAuB,KAAK,IAAI,IAAI,IAAQ,QAAO;AAC9D,UAAM,SAAS,MAAM,KAAK,cAAyB,wBAAwB;AAAA,MACzE,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,EAAE,UAAU,SAAS,UAAU,cAAc,OAAO,aAAa,CAAC;AAAA,IACzF,CAAC;AACD,WAAO,KAAK,MAAM,KAAK;AAAA,MACrB,WAAW,KAAK;AAAA,MAChB,UAAU,SAAS;AAAA,MACnB,qBAAqB,OAAO;AAAA,MAC5B,GAAI,OAAO,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,OAAO,QAAQ;AAAA,MAClE,GAAG,eAAe,MAAM;AAAA,IAC1B,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,SACZ,UACA,eAK4B;AAC5B,UAAM,SAAS,MAAM,KAAK,cAAyB,4BAA4B;AAAA,MAC7E,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU;AAAA,QACnB,GAAG;AAAA,QACH,QAAQ,KAAK,iBAAiB,QAAQ;AAAA,MACxC,CAAC;AAAA,IACH,GAAG,eAAe,YAAY;AAC9B,SAAK,cAAc,MAAM,KAAK,WAAW,UAAU,eAAe,MAAM,GAAG;AAAA,MACzE,qBAAqB,eAAe,uBAAuB;AAAA,MAC3D,GAAI,eAAe,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,cAAc,QAAQ;AAAA,IACnF,CAAC;AACD,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,iBAAiB,UAAiD;AACxE,WAAO;AAAA,MACL,UAAU,SAAS;AAAA,MACnB,MAAM,SAAS;AAAA,MACf,MAAM,KAAK;AAAA,MACX,UAAU,SAAS;AAAA,MACnB,aAAa,SAAS;AAAA,MACtB,eAAe;AAAA,MACf,GAAI,KAAK,SAAS,SAAS,EAAE,gBAAgB,aAAa,IAAI,CAAC;AAAA,IACjE;AAAA,EACF;AAAA,EAEQ,WACN,UACA,QACA,eAC4B;AAC5B,WAAO,KAAK,MAAM,KAAK;AAAA,MACrB,WAAW,KAAK;AAAA,MAChB,UAAU,SAAS;AAAA,MACnB,qBAAqB,cAAc;AAAA,MACnC,GAAI,cAAc,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,cAAc,QAAQ;AAAA,MAChF,GAAG;AAAA,IACL,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,QAAiB,MAAc,OAAoB,CAAC,GAAqB;AACrF,UAAM,cAAc,MAAM,KAAK,aAAa;AAC5C,WAAO,KAAK,cAAuB,MAAM,MAAM,YAAY,WAAW;AAAA,EACxE;AAAA,EAEA,MAAc,cAAuB,MAAc,MAAmB,aAAwC;AAC5G,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,GAAM;AACzD,QAAI;AACJ,QAAI;AACF,iBAAW,MAAM,KAAK,oBAAoB,GAAG,KAAK,OAAO,GAAG,IAAI,IAAI;AAAA,QAClE,GAAG;AAAA,QACH,QAAQ,WAAW;AAAA,QACnB,SAAS;AAAA,UACP,QAAQ;AAAA,UACR,gBAAgB;AAAA,UAChB,GAAI,gBAAgB,SAAY,CAAC,IAAI,EAAE,eAAe,UAAU,WAAW,GAAG;AAAA,UAC9E,GAAG,KAAK;AAAA,QACV;AAAA,MACF,CAAC;AAAA,IACH,SAAS,OAAO;AACd,YAAM,IAAI,eAAe,qBAAqB,iBAAiB,QAAQ,MAAM,UAAU,0BAA0B,IAAI;AAAA,IACvH,UAAE;AACA,mBAAa,KAAK;AAAA,IACpB;AACA,UAAM,OAAO,MAAM,UAAU,QAAQ;AACrC,QAAI,CAAC,SAAS,IAAI;AAChB,YAAM,WAAY,QAAQ,CAAC;AAC3B,YAAM,IAAI;AAAA,QACR,OAAO,SAAS,OAAO,SAAS,WAAW,SAAS,MAAM,OAAO,UAAU,SAAS,MAAM;AAAA,QAC1F,OAAO,SAAS,OAAO,YAAY,WAAW,SAAS,MAAM,UAAU;AAAA,QACvE,SAAS,OAAO,cAAc,QAAQ,SAAS,UAAU;AAAA,QACzD,SAAS;AAAA,MACX;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,kBAAgC;AACtC,QAAI,KAAK,aAAa,OAAW,OAAM,IAAI,eAAe,oBAAoB,sCAAsC,KAAK;AACzH,WAAO,KAAK;AAAA,EACd;AACF;AAEO,IAAM,kBAAN,cAA8B,cAAc;AAAA,EACjD,YAAY,WAAmB,OAA8B,sBAA2C,OAAO;AAC7G,UAAM,WAAW,OAAO,qBAAqB,QAAQ;AAAA,EACvD;AACF;AAEO,IAAM,iBAAN,cAA6B,MAAM;AAAA,EACxC,YACW,MACT,SACS,WACA,QACT;AAAE,UAAM,OAAO;AAJN;AAEA;AACA;AAAA,EACQ;AACrB;AAEA,SAAS,eAAe,OAA6B;AACnD,MAAI,OAAO,MAAM,gBAAgB,YAAY,MAAM,YAAY,SAAS,MACnE,OAAO,MAAM,iBAAiB,YAAY,MAAM,aAAa,SAAS,MACtE,CAAC,OAAO,cAAc,MAAM,oBAAoB,KAChD,CAAC,OAAO,cAAc,MAAM,qBAAqB,GAAG;AACvD,UAAM,IAAI,eAAe,mBAAmB,mDAAmD,KAAK;AAAA,EACtG;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAkC;AAC1D,QAAM,OAAO,cAAc,OAAO,eAAe;AACjD,MAAI,OAAO,KAAK,UAAU,YAAY,KAAK,MAAM,SAAS,MACrD,CAAC,OAAO,cAAc,KAAK,SAAS,KACpC,OAAO,KAAK,YAAY,YAAY,KAAK,QAAQ,WAAW,KAAK,KAAK,QAAQ,SAAS,OACvF,OAAO,KAAK,YAAY,WAAW;AACtC,UAAM,IAAI,eAAe,mBAAmB,mDAAmD,KAAK;AAAA,EACtG;AACA,SAAO;AAAA,IACL,OAAO,KAAK;AAAA,IACZ,WAAW,KAAK;AAAA,IAChB,SAAS,KAAK;AAAA,IACd,SAAS,KAAK;AAAA,IACd,SAAS,KAAK;AAAA,EAChB;AACF;AAEA,eAAe,UAAU,UAAsC;AAC7D,QAAM,OAAO,MAAM,SAAS,KAAK;AACjC,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,MAAI;AACF,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB,QAAQ;AACN,UAAM,IAAI,eAAe,mBAAmB,qCAAqC,OAAO,SAAS,MAAM;AAAA,EACzG;AACF;AAEA,SAAS,UAAU,QAAwB;AACzC,MAAI,WAAW,IAAK,QAAO;AAC3B,MAAI,WAAW,IAAK,QAAO;AAC3B,MAAI,WAAW,IAAK,QAAO;AAC3B,MAAI,WAAW,IAAK,QAAO;AAC3B,SAAO,UAAU,MAAM,sBAAsB;AAC/C;AAEA,SAAS,gBAAgB,OAAkC;AACzD,QAAM,OAAO,cAAc,OAAO,aAAa;AAC/C,MAAI,KAAK,SAAS,UAAU,OAAO,KAAK,aAAa,YAAY,OAAO,KAAK,SAAS,YACjF,OAAO,KAAK,aAAa,YAAY,OAAO,KAAK,iBAAiB,YAAY,KAAK,aAAa,WAAW,GAAG;AACjH,UAAM,IAAI,eAAe,mBAAmB,iDAAiD,KAAK;AAAA,EACpG;AACA,SAAO;AAAA,IACL,UAAU,KAAK;AAAA,IACf,MAAM,KAAK;AAAA,IACX,UAAU,KAAK;AAAA,IACf,cAAc,KAAK;AAAA,IACnB,GAAI,OAAO,KAAK,WAAW,YAAY,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,IAClE,GAAI,OAAO,KAAK,eAAe,YAAY,OAAO,cAAc,KAAK,UAAU,IAAI,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;AAAA,IACtH,GAAI,OAAO,KAAK,kBAAkB,WAAW,EAAE,eAAe,KAAK,cAAc,IAAI,CAAC;AAAA,IACtF,GAAI,OAAO,KAAK,mBAAmB,WAAW,EAAE,gBAAgB,KAAK,eAAe,IAAI,CAAC;AAAA,EAC3F;AACF;AAEA,SAAS,oBAAoB,OAAsC;AACjE,QAAM,OAAO,cAAc,OAAO,iBAAiB;AACnD,MAAK,KAAK,SAAS,UAAU,KAAK,SAAS,YACtC,OAAO,KAAK,aAAa,YAAY,KAAK,SAAS,WAAW,KAC9D,OAAO,KAAK,SAAS,YAAY,KAAK,KAAK,WAAW,KACtD,OAAO,KAAK,aAAa,YAAY,KAAK,SAAS,WAAW,KAC9D,OAAO,KAAK,gBAAgB,YAAY,CAAC,cAAc,KAAK,WAAW,KACvE,OAAO,KAAK,iBAAiB,YAAY,KAAK,aAAa,WAAW,GAAG;AAC5E,UAAM,IAAI,eAAe,mBAAmB,qDAAqD,KAAK;AAAA,EACxG;AACA,SAAO;AAAA,IACL,UAAU,KAAK;AAAA,IACf,MAAM,KAAK;AAAA,IACX,MAAM,KAAK;AAAA,IACX,UAAU,KAAK;AAAA,IACf,aAAa,KAAK;AAAA,IAClB,cAAc,KAAK;AAAA,IACnB,GAAI,OAAO,KAAK,WAAW,YAAY,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,IAClE,GAAI,OAAO,KAAK,eAAe,YAAY,OAAO,cAAc,KAAK,UAAU,IAAI,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;AAAA,EACxH;AACF;AAEA,SAAS,eAAe,OAA8B;AACpD,QAAM,OAAO,cAAc,OAAO,YAAY;AAC9C,QAAM,OAAO,KAAK;AAClB,MAAI,OAAO,SAAS,YAAY,EAAE,MAAM,QAAQ,IAAI,KAAK,KAAK,MAAM,SAAO,OAAO,QAAQ,QAAQ,IAAI;AACpG,UAAM,IAAI,eAAe,mBAAmB,8CAA8C,KAAK;AAAA,EACjG;AACA,SAAO;AAAA,IACL;AAAA,IACA,GAAI,OAAO,KAAK,aAAa,WAAW,EAAE,UAAU,KAAK,SAAS,IAAI,CAAC;AAAA,IACvE,GAAI,OAAO,KAAK,eAAe,WAAW,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;AAAA,EAC/E;AACF;AAEA,SAAS,cAAc,OAAwB;AAC7C,MAAI;AACF,UAAM,UAAUC,eAAc,KAAK;AACnC,WAAO,QAAQ,WAAW,MAAMC,aAAY,OAAO,MAAM;AAAA,EAC3D,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,cAAc,OAAgBC,OAAuC;AAC5E,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI,eAAe,mBAAmB,+BAA+BA,KAAI,UAAU,KAAK;AAAA,EAChG;AACA,SAAO;AACT;;;AGnfO,IAAM,sBAAN,MAA0B;AAAA,EAM/B,YAA6B,SAA4B;AAA5B;AAC3B,SAAK,iBAAiB,QAAQ;AAC9B,SAAK,cAAc,KAAK,eAAe,KAAK,OAAO;AAAA,EACrD;AAAA,EARiB;AAAA,EACA;AAAA,EACT;AAAA,EACA,YAAY;AAAA;AAAA,EAQpB,QAA2B;AACzB,WAAO,EAAE,QAAQ,KAAK,YAAY;AAAA,EACpC;AAAA,EAEA,UAAgB;AACd,QAAI,KAAK,UAAW;AACpB,SAAK,QAAQ,SAAS,aAAW,QAAQ,cAAc,cAAc,QAAQ,WAAW,aACnF,KAAK,gBAAgB,KAAK,aAAa,OAAO,IAC/C,KAAK,YAAY,OAAO;AAC5B,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,aAAa,QAA4B;AACvC,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,6CAA6C;AAClF,SAAK,eAAe;AAAA,EACtB;AAAA,EAEA,cAAoB;AAClB,SAAK,eAAe;AAAA,EACtB;AAAA,EAEA,UAAgB;AACd,QAAI,CAAC,KAAK,UAAW;AACrB,SAAK,YAAY;AACjB,SAAK,QAAQ,SAAS,KAAK;AAC3B,SAAK,YAAY;AAAA,EACnB;AACF;;;ACmCO,IAAM,oBAAN,MAAwB;AAAA,EAO7B,YACmB,QACA,YACA,QACjB,UACA,eACiB,QACA,MACjB;AAPiB;AACA;AACA;AAGA;AACA;AAEjB,SAAK,cAAc,IAAI,eAAe,QAAQ;AAC9C,SAAK,gBAAgB,IAAI,oBAAoB,aAAa;AAAA,EAC5D;AAAA,EAjBQ;AAAA,EACA;AAAA,EACS;AAAA,EACA;AAAA,EACT,SAAS;AAAA,EAejB,MAAM,QAAuB;AAC3B,QAAI,KAAK,OAAQ,OAAM,IAAI,MAAM,sCAAsC;AACvE,SAAK,WAAW,MAAM,KAAK,WAAW,aAAa,KAAK,OAAO,UAAU;AACzE,SAAK,OAAO,aAAa,KAAK,QAAQ;AACtC,SAAK,YAAY,QAAQ;AACzB,SAAK,cAAc,QAAQ;AAC3B,SAAK,OAAO,KAAK,qCAAqC;AAAA,MACpD,UAAU,QAAQ,KAAK,SAAS,QAAQ;AAAA,MACxC,aAAa,KAAK,SAAS;AAAA,IAC7B,CAAC;AAAA,EACH;AAAA,EAEA,gBAAgB,YAAuD;AACrE,WAAO,WAAW,IAAI,OAAO,WAAW,CAAC,UAAU,SAAS,WAAW,KAAK,cAAc,UAAU,SAAS,MAAM,GAAG;AAAA,MACpH,WAAW;AAAA,IACb,CAAC;AAAA,EACH;AAAA,EAEA,SAAkC;AAChC,WAAO;AAAA,MACL,WAAW,KAAK,OAAO,cAAc;AAAA,MACrC,eAAe,KAAK,aAAa;AAAA,MACjC,UAAU,KAAK,UAAU;AAAA,MACzB,WAAW,KAAK,OAAO;AAAA,MACvB,GAAG,KAAK,YAAY,OAAO;AAAA,MAC3B,WAAW,KAAK,cAAc;AAAA,MAC9B,WAAW,KAAK,WAAW,OAAO,SAAS,EAAE,QAAQ;AAAA,MACrD,4BAA4B,KAAK,SAAS;AAAA,MAC1C,GAAI,KAAK,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,KAAK,KAAK,WAAW,EAAE;AAAA,IACpE;AAAA,EACF;AAAA,EAEA,MAAM,UAAuC;AAC3C,SAAK,gBAAgB;AACrB,UAAM,gBAAgB,MAAM,KAAK,OAAO,YAAY;AACpD,UAAM,gBAAgB,cAAc,OAAO,YAAU,OAAO,aAAa,KAAK,MAAM,WAAW,EAAE,QAAQ;AACzG,WAAO,QAAQ,IAAI,cAAc,IAAI,OAAM,WAAU;AACnD,YAAM,KAAK,kBAAkB,MAAM;AACnC,YAAM,WAAW,MAAM,KAAK,OAAO,YAAY,OAAO,QAAQ,EAAE,MAAM,OAAO,EAAE,QAAQ,MAAM,EAAE;AAC/F,aAAO,EAAE,GAAG,QAAQ,GAAG,SAAS;AAAA,IAClC,CAAC,CAAC;AAAA,EACJ;AAAA,EAEA,MAAM,2BAA2B,OAAe,UAAoC;AAClF,QAAI;AACJ,QAAI;AACF,sBAAgB,MAAM,KAAK,OAAO,qBAAqB,KAAK,gBAAgB,GAAG,OAAO,QAAQ;AAAA,IAChG,SAAS,OAAO;AACd,UAAI,EAAE,iBAAiB,mBAAmB,MAAM,SAAS,iBAAkB,OAAM;AACjF,WAAK,WAAW,MAAM,KAAK,WAAW,MAAM,KAAK,OAAO,UAAU;AAClE,WAAK,OAAO,aAAa,KAAK,QAAQ;AACtC,sBAAgB,MAAM,KAAK,OAAO,qBAAqB,KAAK,UAAU,OAAO,QAAQ;AAAA,IACvF;AACA,SAAK,OAAO,KAAK,2BAA2B;AAC5C,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,0BAA4C;AAChD,WAAO,KAAK,OAAO,kBAAkB;AAAA,EACvC;AAAA,EAEA,MAAM,uBAAuB,MAAgC;AAC3D,QAAI;AACF,YAAM,SAAS,MAAM,KAAK,OAAO,iBAAiB,KAAK,gBAAgB,GAAG,IAAI;AAC9E,UAAI,OAAO,WAAW,WAAY,MAAK,OAAO,KAAK,yCAAyC;AAC5F,aAAO;AAAA,IACT,SAAS,OAAO;AACd,UAAI,EAAE,iBAAiB,mBAAmB,MAAM,SAAS,iBAAkB,OAAM;AACjF,WAAK,WAAW,MAAM,KAAK,WAAW,MAAM,KAAK,OAAO,UAAU;AAClE,WAAK,OAAO,aAAa,KAAK,QAAQ;AACtC,WAAK,OAAO,KAAK,iDAAiD;AAClE,aAAO,EAAE,QAAQ,UAAU;AAAA,IAC7B;AAAA,EACF;AAAA,EAEA,MAAM,2BAA0C;AAC9C,UAAM,WAAW,KAAK;AACtB,SAAK,YAAY;AACjB,SAAK,YAAY,YAAY;AAC7B,SAAK,cAAc,YAAY;AAC/B,UAAM,UAAU,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AACpD,UAAM,KAAK,OAAO,oBAAoB;AACtC,SAAK,WAAW,MAAM,KAAK,WAAW,MAAM,KAAK,OAAO,UAAU;AAClE,SAAK,OAAO,aAAa,KAAK,QAAQ;AAAA,EACxC;AAAA,EAEA,MAAM,qBAAqB,SAAoC;AAC7D,QAAI,KAAK,SAAS,OAAW,OAAM,IAAI,gBAAgB,sBAAsB,uCAAuC;AACpH,QAAI,CAAC,SAAS;AACZ,YAAM,KAAK,KAAK,uBAAuB;AACvC,aAAO,KAAK,OAAO;AAAA,IACrB;AACA,UAAM,cAAc,MAAM,KAAK,OAAO,aAAa,KAAK,gBAAgB,CAAC;AACzE,UAAM,KAAK,KAAK,qBAAqB,YAAY,aAAa,YAAY,OAAO;AACjF,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA,EAEA,MAAM,QAAQ,MAAmB,gBAAyB,QAAwD;AAChH,QAAI,SAAS,SAAS;AACpB,WAAK,YAAY,YAAY;AAC7B,WAAK,cAAc,YAAY;AAC/B,YAAMC,YAAW,KAAK;AACtB,WAAK,YAAY;AACjB,YAAMA,WAAU,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AACpD,WAAK,OAAO,KAAK,2BAA2B,EAAE,MAAM,QAAQ,CAAC;AAC7D,aAAO,KAAK,OAAO;AAAA,IACrB;AACA,QAAI,mBAAmB,UAAa,eAAe,WAAW,GAAG;AAC/D,YAAM,IAAI,gBAAgB,mBAAmB,+CAA+C;AAAA,IAC9F;AACA,UAAM,OAAO,MAAM,KAAK,QAAQ,gBAAgB,MAAM;AACtD,UAAM,WAAW,KAAK;AACtB,SAAK,YAAY;AACjB,UAAM,YAAY,IAAI,sBAAsB,KAAK,MAAM,EAAE;AACzD,SAAK,YAAY,aAAa,WAAW,EAAE,UAAU,KAAK,OAAO,UAAU,MAAM,KAAK,OAAO,KAAK,CAAC;AACnG,SAAK,cAAc,aAAa,aAAW,oBAAoB,KAAK,QAAQ,OAAO,CAAC;AACpF,UAAM,UAAU,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AACpD,SAAK,OAAO,KAAK,2BAA2B,EAAE,MAAM,UAAU,gBAAgB,QAAQ,KAAK,OAAO,QAAQ,EAAE,CAAC;AAC7G,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA,EAEA,MAAM,oBAAoB,gBAAwB,MAAe,QAAuD;AACtH,UAAM,SAAS,MAAM,KAAK,gBAAgB,gBAAgB,MAAM;AAChE,UAAM,MAAM,IAAI,sBAAsB,OAAO,MAAM,EAAE;AACrD,UAAM,WAAW,MAAM,IAAI,KAAK,cAAc;AAAA,MAC5C,OAAO,oBAAoB,KAAK,IAAI,CAAC;AAAA,MACrC,SAAS,SAAS,SAAY,CAAC,IAAI,EAAE,KAAK;AAAA,IAC5C,GAAG,UAAU,IAAI,gBAAgB,EAAE,MAAM;AACzC,WAAO,mBAA2C,QAAQ;AAAA,EAC5D;AAAA,EAEA,MAAM,qBAAqB,gBAAwB,QAAsD;AACvG,UAAM,SAAS,MAAM,KAAK,gBAAgB,gBAAgB,MAAM;AAChE,UAAM,MAAM,IAAI,sBAAsB,OAAO,MAAM,EAAE;AACrD,UAAM,WAAW,MAAM,IAAI,UAAU,KAAK;AAAA,MACxC,OAAO,qBAAqB,KAAK,IAAI,CAAC;AAAA,MACtC,SAAS,CAAC;AAAA,IACZ,CAAC;AACD,UAAM,QAAQ,mBAAqD,QAAQ;AAC3E,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,MAAM,oBAAoB,gBAAwB,MAAc,QAAwD;AACtH,QAAI,KAAK,KAAK,MAAM,GAAI,OAAM,IAAI,gBAAgB,mBAAmB,yCAAyC;AAC9G,UAAM,SAAS,MAAM,KAAK,gBAAgB,gBAAgB,MAAM;AAChE,UAAM,MAAM,IAAI,sBAAsB,OAAO,MAAM,EAAE;AACrD,UAAM,WAAW,MAAM,IAAI,UAAU,OAAO;AAAA,MAC1C,OAAO,oBAAoB,KAAK,IAAI,CAAC;AAAA,MACrC,SAAS,EAAE,KAAK;AAAA,IAClB,CAAC;AACD,UAAM,YAAY,mBAA6D,QAAQ;AACvF,SAAK,YAAY,aAAa,KAAK,EAAE,UAAU,OAAO,OAAO,UAAU,MAAM,OAAO,OAAO,KAAK,CAAC;AACjG,SAAK,cAAc,aAAa,aAAW,oBAAoB,OAAO,QAAQ,OAAO,CAAC;AACtF,SAAK,OAAO,KAAK,2BAA2B,EAAE,gBAAgB,QAAQ,OAAO,OAAO,QAAQ,EAAE,CAAC;AAC/F,WAAO,EAAE,GAAG,KAAK,OAAO,GAAG,UAAU;AAAA,EACvC;AAAA,EAEA,MAAM,QAAuB;AAC3B,QAAI,KAAK,OAAQ;AACjB,SAAK,SAAS;AACd,SAAK,YAAY,YAAY;AAC7B,SAAK,cAAc,YAAY;AAC/B,UAAM,KAAK,WAAW,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AAC1D,SAAK,YAAY;AACjB,SAAK,YAAY,QAAQ;AACzB,SAAK,cAAc,QAAQ;AAAA,EAC7B;AAAA,EAEA,MAAc,QAAQ,gBAAwB,QAAgD;AAC5F,YAAQ,eAAe;AACvB,UAAM,WAAW,KAAK,gBAAgB;AACtC,UAAM,gBAAgB,MAAM,KAAK,OAAO,YAAY,GAAG,KAAK,YAAU,OAAO,aAAa,cAAc;AACxG,QAAI,iBAAiB,QAAW;AAC9B,YAAM,IAAI,gBAAgB,uBAAuB,uDAAuD;AAAA,IAC1G;AACA,UAAM,SAAS,MAAM,KAAK,kBAAkB,YAAY;AACxD,UAAM,WAAW,MAAM,KAAK,OAAO,YAAY,cAAc;AAC7D,QAAI,CAAC,SAAS,OAAQ,OAAM,IAAI,gBAAgB,gBAAgB,iCAAiC,IAAI;AACrG,UAAM,cAAc,MAAM,KAAK,OAAO,aAAa,QAAQ;AAC3D,UAAM,YAAY,IAAI,kBAAkB,aAAa,KAAK,OAAO,OAAO,GAAG;AAAA,MACzE,MAAM;AAAA,MACN,UAAU,SAAS;AAAA,MACnB,aAAa,YAAY;AAAA,MACzB;AAAA,MACA,YAAY,KAAK,OAAO;AAAA,MACxB,qBAAqB,KAAK,OAAO,aAAa,CAAC,OAAO,IAAI,CAAC,OAAO,QAAQ,OAAO;AAAA,MACjF,iBAAiB,OAAM,iBAAgB,KAAK,OAAO,gBAAgB,YAAY;AAAA,IACjF,CAAC;AACD,UAAM,SAAS,IAAI,iBAAiB,IAAI,sBAAsB,WAAW,UAAU,MAAM,GAAG,GAAM;AAClG,QAAI;AACF,YAAM,OAAO,QAAQ;AACrB,cAAQ,eAAe;AACvB,aAAO,QAAQ,MAAM;AACnB,YAAI,KAAK,WAAW,WAAW,OAAQ;AACvC,aAAK,YAAY;AACjB,aAAK,YAAY,YAAY;AAC7B,aAAK,cAAc,YAAY;AAC/B,aAAK,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AACzC,aAAK,OAAO,KAAK,+DAA+D;AAAA,UAC9E,gBAAgB,QAAQ,OAAO,QAAQ;AAAA,QACzC,CAAC;AAAA,MACH,CAAC;AACD,aAAO,EAAE,QAAQ,OAAO;AAAA,IAC1B,SAAS,OAAO;AACd,YAAM,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AAC1C,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAc,gBAAgB,gBAAwB,QAAgD;AACpG,QAAI,KAAK,WAAW,OAAO,aAAa,eAAgB,QAAO,KAAK;AACpE,UAAM,OAAO,MAAM,KAAK,QAAQ,gBAAgB,MAAM;AACtD,UAAM,WAAW,KAAK;AACtB,SAAK,YAAY;AACjB,UAAM,UAAU,OAAO,MAAM,EAAE,MAAM,MAAM,MAAS;AACpD,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,cAAc,UAAkB,SAAkB,QAAkD;AACxG,QAAI;AACF,UAAI,aAAa,SAAU,QAAO,GAAG,KAAK,OAAO,CAAC;AAClD,UAAI,aAAa,UAAW,QAAO,GAAG,MAAM,KAAK,QAAQ,CAAC;AAC1D,UAAI,aAAa,wBAAwB;AACvC,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,UAAU,YAAY,OAAO,MAAM,aAAa,UAAU;AACzE,gBAAM,IAAI,gBAAgB,mBAAmB,kCAAkC;AAAA,QACjF;AACA,eAAO,GAAG,MAAM,KAAK,2BAA2B,MAAM,OAAO,MAAM,QAAQ,CAAC;AAAA,MAC9E;AACA,UAAI,aAAa,0BAA2B,QAAO,GAAG,MAAM,KAAK,wBAAwB,CAAC;AAC1F,UAAI,aAAa,0BAA0B;AACzC,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,SAAS,YAAY,MAAM,KAAK,SAAS,IAAI;AAC5D,gBAAM,IAAI,gBAAgB,mBAAmB,iCAAiC;AAAA,QAChF;AACA,eAAO,GAAG,MAAM,KAAK,uBAAuB,MAAM,IAAI,CAAC;AAAA,MACzD;AACA,UAAI,aAAa,kBAAkB;AACjC,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,mBAAmB,SAAU,OAAM,IAAI,gBAAgB,mBAAmB,qBAAqB;AAChH,eAAO,GAAG,MAAM,KAAK;AAAA,UACnB,MAAM;AAAA,UACN,OAAO,MAAM,SAAS,WAAW,MAAM,OAAO;AAAA,UAC9C;AAAA,QACF,CAAC;AAAA,MACH;AACA,UAAI,aAAa,mBAAmB;AAClC,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,mBAAmB,SAAU,OAAM,IAAI,gBAAgB,mBAAmB,qBAAqB;AAChH,eAAO,GAAG,MAAM,KAAK,qBAAqB,MAAM,gBAAgB,MAAM,CAAC;AAAA,MACzE;AACA,UAAI,aAAa,kBAAkB;AACjC,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,mBAAmB,YAAY,OAAO,MAAM,SAAS,UAAU;AAC9E,gBAAM,IAAI,gBAAgB,mBAAmB,4CAA4C;AAAA,QAC3F;AACA,eAAO,GAAG,MAAM,KAAK,oBAAoB,MAAM,gBAAgB,MAAM,MAAM,MAAM,CAAC;AAAA,MACpF;AACA,UAAI,aAAa,sBAAsB;AACrC,YAAI,KAAK,SAAS,OAAW,OAAM,IAAI,gBAAgB,sBAAsB,uCAAuC;AACpH,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,UAAU,YAAY,OAAO,MAAM,aAAa,UAAU;AACzE,gBAAM,IAAI,gBAAgB,mBAAmB,kCAAkC;AAAA,QACjF;AACA,eAAO,GAAG,MAAM,KAAK,KAAK,yBAAyB,MAAM,OAAO,MAAM,QAAQ,CAAC;AAAA,MACjF;AACA,UAAI,aAAa,0BAA0B;AACzC,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,YAAY,WAAW;AACtC,gBAAM,IAAI,gBAAgB,mBAAmB,uCAAuC;AAAA,QACtF;AACA,eAAO,GAAG,MAAM,KAAK,qBAAqB,MAAM,OAAO,CAAC;AAAA,MAC1D;AACA,UAAI,aAAa,iCAAiC;AAChD,YAAI,KAAK,SAAS,OAAW,OAAM,IAAI,gBAAgB,sBAAsB,uCAAuC;AACpH,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,SAAS,YAAY,MAAM,KAAK,KAAK,MAAM,IAAI;AAC9D,gBAAM,IAAI,gBAAgB,mBAAmB,uCAAuC;AAAA,QACtF;AACA,eAAO,GAAG,MAAM,KAAK,KAAK,sBAAsB,MAAM,IAAI,CAAC;AAAA,MAC7D;AACA,UAAI,aAAa,YAAY;AAC3B,cAAM,QAAQ,OAAO,OAAO;AAC5B,YAAI,MAAM,SAAS,WAAW,MAAM,SAAS,SAAU,OAAM,IAAI,gBAAgB,mBAAmB,+BAA+B;AACnI,eAAO,GAAG,MAAM,KAAK,QAAQ,MAAM,MAAM,OAAO,MAAM,mBAAmB,WAAW,MAAM,iBAAiB,QAAW,MAAM,CAAC;AAAA,MAC/H;AACA,YAAM,IAAI,gBAAgB,oBAAoB,gDAAgD;AAAA,IAChG,SAAS,OAAO;AACd,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,EACF;AAAA,EAEQ,kBAAgC;AACtC,QAAI,KAAK,aAAa,OAAW,OAAM,IAAI,gBAAgB,oBAAoB,mCAAmC;AAClH,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAc,kBAAkB,cAAsD;AACpF,UAAM,aAAa,MAAM,KAAK,OAAO,UAAU,aAAa,QAAQ;AACpE,yBAAqB,cAAc,UAAU;AAC7C,UAAM,WAAW,KAAK,WAAW,YAAY,WAAW,QAAQ;AAChE,QAAI,aAAa,UAAa,SAAS,cAAc,WAAW,aAAa;AAC3E,YAAM,IAAI,gBAAgB,0BAA0B,wDAAwD;AAAA,IAC9G;AACA,QAAI,aAAa,UACZ,SAAS,iBAAiB,WAAW,gBACrC,SAAS,SAAS,WAAW,QAC7B,SAAS,aAAa,WAAW,UAAU;AAC9C,aAAO;AAAA,IACT;AACA,WAAO,KAAK,WAAW,UAAU;AAAA,MAC/B,UAAU,WAAW;AAAA,MACrB,MAAM,WAAW;AAAA,MACjB,UAAU,WAAW;AAAA,MACrB,WAAW,WAAW;AAAA,MACtB,cAAc,WAAW;AAAA,IAC3B,CAAC;AAAA,EACH;AACF;AAEO,IAAM,kBAAN,cAA8B,MAAM;AAAA,EACzC,YAAqB,MAAc,SAA0B,YAAY,OAAO;AAAE,UAAM,OAAO;AAA1E;AAAwC;AAAA,EAAoC;AACnG;AAEA,SAAS,qBAAqB,QAA0B,YAAwC;AAC9F,MAAI,WAAW,SAAS,UAAU,WAAW,aAAa,OAAO,YAC5D,WAAW,iBAAiB,OAAO,cAAc;AACpD,UAAM,IAAI,gBAAgB,0BAA0B,8DAA8D;AAAA,EACpH;AACF;AAEA,SAAS,aAAa,SAAyB;AAC7C,QAAM,MAAM,IAAI,IAAI,OAAO;AAC3B,MAAI,WAAW,IAAI,aAAa,WAAW,SAAS;AACpD,MAAI,WAAW,GAAG,IAAI,SAAS,QAAQ,OAAO,EAAE,CAAC;AACjD,SAAO,IAAI,SAAS;AACtB;AAEA,SAAS,OAAO,OAAyC;AACvD,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI,gBAAgB,mBAAmB,yCAAyC;AAAA,EACxF;AACA,SAAO;AACT;AAEA,SAAS,GAAG,OAAoC;AAAE,SAAO,EAAE,IAAI,MAAM,MAAM;AAAE;AAE7E,eAAe,oBACb,QACA,SACkB;AAClB,QAAM,QAAQ,OAAO;AACrB,QAAM,WAAW,MAAM,OAAO,IAAwC,oBAAoB;AAAA,IACxF,QAAQ,GAAG,QAAQ,SAAS,IAAI,QAAQ,MAAM;AAAA,IAC9C;AAAA,IACA,SAAS,QAAQ;AAAA,EACnB,GAAG,QAAQ,MAAM;AACjB,MAAI,SAAS,UAAU,OAAO;AAC5B,UAAM,IAAI,gBAAgB,mBAAmB,uDAAuD;AAAA,EACtG;AACA,SAAO,mBAAmB,QAAQ;AACpC;AAEA,SAAS,mBAAsB,UAAkC;AAC/D,QAAM,SAAS,SAAS;AACxB,MAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,EAAE,QAAQ,SAAS;AACtE,UAAM,IAAI,gBAAgB,mBAAmB,+CAA+C;AAAA,EAC9F;AACA,MAAI,OAAO,OAAO,QAAQ,EAAE,WAAW,SAAS;AAC9C,UAAM,UAAU,WAAW,UAAU,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,QACrF,aAAa,OAAO,SAAS,OAAO,OAAO,MAAM,YAAY,WAC9D,OAAO,MAAM,UACb;AACJ,UAAM,IAAI,gBAAgB,oBAAoB,OAAO;AAAA,EACvD;AACA,SAAO,OAAO;AAChB;AAEA,SAAS,KAAK,OAAoC;AAChD,QAAM,SAAS,iBAAiB,QAAQ,QAAQ;AAChD,QAAM,aAAa,WAAW,UAAa,UAAU,UAAU,OAAO,OAAO,SAAS,WAClF,OAAO,OACP,kBAAkB,kBAAkB,OAAO,OAAO;AACtD,QAAM,YAAY,WAAW,UAAa,eAAe,UAAU,OAAO,OAAO,cAAc,YAC3F,OAAO,YACP,kBAAkB,kBAAkB,OAAO,YAAY;AAC3D,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,OAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS,QAAQ,WAAW;AAAA,MAC5B,SAAS,eAAe,SAAY,CAAC,IAAI,EAAE,YAAY,UAAU;AAAA,IACnE;AAAA,EACF;AACF;AAEA,SAAS,QAAQ,OAAuB;AAAE,SAAO,MAAM,UAAU,KAAK,QAAQ,GAAG,MAAM,MAAM,GAAG,CAAC,CAAC,SAAI,MAAM,MAAM,EAAE,CAAC;AAAG;;;AC/exH,SAAS,YAAAC,iBAAgB;;;ACAzB,SAAS,kBAAkB;AAC3B,SAAS,OAAO,OAAO,UAAU,QAAQ,IAAI,MAAM,iBAAiB;AACpE,SAAS,eAAe;AACxB,SAAS,SAAS,YAAY;AAK9B,IAAM,iBAAiB,iBAAE,OAAO;AAAA,EAC9B,eAAe,iBAAE,QAAQ,CAAC;AAAA,EAC1B,UAAU,iBAAE,OAAO,EAAE,KAAK;AAAA,EAC1B,MAAM,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;AAAA,EAC9B,WAAW,iBAAE,OAAO,EAAE,IAAI,CAAC;AAC7B,CAAC,EAAE,OAAO;AAEV,IAAM,oBAAoB,iBAAE,OAAO;AAAA,EACjC,UAAU,iBAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC1B,MAAM,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;AAAA,EAC9B,UAAU,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;AAAA,EAClC,WAAW,iBAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC3B,aAAa,iBAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC7B,WAAW,iBAAE,OAAO,EAAE,IAAI,EAAE,YAAY;AAAA,EACxC,cAAc,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAC3C,CAAC,EAAE,OAAO;AAEV,IAAM,qBAAqB,iBAAE,OAAO;AAAA,EAClC,eAAe,iBAAE,QAAQ,CAAC;AAAA,EAC1B,OAAO,iBAAE,MAAM,iBAAiB;AAClC,CAAC,EAAE,OAAO;AA6BH,IAAM,uBAAN,cAAmC,MAAM;AAAA,EACrC,OAAO;AAClB;AAEO,IAAM,gBAAN,MAAoB;AAAA,EAChB;AAAA,EACD;AAAA,EACA,QAAQ,oBAAI,IAAyB;AAAA,EAE7C,YAAY,UAAgC,CAAC,GAAG;AAC9C,UAAM,MAAM,QAAQ,OAAO,QAAQ;AACnC,UAAM,UAAU,IAAI,YAAY,KAAK,QAAQ,iBAAiB,QAAQ,GAAG,MAAM;AAC/E,SAAK,YAAY,QAAQ,aAAa,KAAK,SAAS,QAAQ;AAAA,EAC9D;AAAA,EAEA,MAAM,aAAa,YAA2C;AAC5D,UAAM,MAAM,KAAK,WAAW,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AAC5D,UAAM,MAAM,KAAK,WAAW,GAAK;AACjC,UAAM,aAAa,KAAK,KAAK,WAAW,aAAa;AACrD,UAAM,UAAU,KAAK,KAAK,WAAW,YAAY;AACjD,UAAM,CAAC,WAAW,MAAM,IAAI,MAAM,QAAQ,IAAI,CAAC,OAAO,UAAU,GAAG,OAAO,OAAO,CAAC,CAAC;AACnF,QAAI,cAAc,QAAQ;AACxB,YAAM,IAAI,qBAAqB,yEAAyE;AAAA,IAC1G;AAEA,QAAI,CAAC,WAAW;AACd,YAAM,OAAO,gBAAgB;AAC7B,YAAMC,UAAS,EAAE,eAAe,GAAY,UAAU,OAAO,GAAG,MAAM,YAAY,WAAW,KAAK,UAAU;AAC5G,YAAM,gBAAgB,YAAYA,SAAQ,GAAK;AAC/C,YAAM,gBAAgB,SAAS,GAAG,KAAK,UAAU;AAAA,GAAM,GAAK;AAAA,IAC9D;AAEA,UAAM,kBAAkB,OAAO;AAC/B,QAAI;AACF,UAAIA,UAAS,eAAe,MAAM,KAAK,MAAM,MAAM,SAAS,YAAY,MAAM,CAAC,CAAC;AAChF,YAAM,cAAc,MAAM,SAAS,SAAS,MAAM,GAAG,KAAK;AAC1D,YAAM,cAAc,gBAAgBC,eAAc,UAAU,CAAC;AAC7D,UAAI,YAAY,cAAcD,QAAO,WAAW;AAC9C,cAAM,IAAI,qBAAqB,6CAA6C;AAAA,MAC9E;AACA,UAAIA,QAAO,SAAS,YAAY;AAC9B,QAAAA,UAAS,EAAE,GAAGA,SAAQ,MAAM,WAAW;AACvC,cAAM,gBAAgB,YAAYA,SAAQ,GAAK;AAAA,MACjD;AACA,WAAK,WAAW,EAAE,GAAGA,SAAQ,YAAY,aAAa,YAAYA,QAAO,SAAS,EAAE;AACpF,YAAM,KAAK,UAAU;AACrB,aAAO,KAAK;AAAA,IACd,SAAS,OAAgB;AACvB,UAAI,iBAAiB,qBAAsB,OAAM;AACjD,YAAM,IAAI,qBAAqB,+BAA+B,iBAAiB,KAAK,CAAC,EAAE;AAAA,IACzF;AAAA,EACF;AAAA,EAEA,UAAwB;AACtB,QAAI,KAAK,aAAa,OAAW,OAAM,IAAI,MAAM,oCAAoC;AACrF,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAM,MAAM,YAA2C;AACrD,UAAM,GAAG,KAAK,WAAW,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AACzD,SAAK,WAAW;AAChB,SAAK,MAAM,MAAM;AACjB,WAAO,KAAK,aAAa,UAAU;AAAA,EACrC;AAAA,EAEA,mBAAkC;AAChC,WAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE,IAAI,WAAS,EAAE,GAAG,KAAK,EAAE;AAAA,EAC3D;AAAA,EAEA,YAAY,UAA2C;AACrD,UAAM,OAAO,KAAK,MAAM,IAAI,QAAQ;AACpC,WAAO,SAAS,SAAY,SAAY,EAAE,GAAG,KAAK;AAAA,EACpD;AAAA,EAEA,UAAU,UAAkB,WAA4B;AACtD,WAAO,KAAK,MAAM,IAAI,QAAQ,GAAG,cAAc;AAAA,EACjD;AAAA,EAEA,MAAM,UAAU,OAA6E;AAC3F,SAAK,QAAQ;AACb,UAAM,OAAoB;AAAA,MACxB,GAAG;AAAA,MACH,aAAa,YAAY,MAAM,SAAS;AAAA,MACxC,WAAW,KAAK,IAAI;AAAA,IACtB;AACA,SAAK,MAAM,IAAI,KAAK,UAAU,IAAI;AAClC,UAAM,KAAK,UAAU;AACrB,WAAO,EAAE,GAAG,KAAK;AAAA,EACnB;AAAA,EAEA,MAAM,WAAW,UAAoC;AACnD,UAAM,UAAU,KAAK,MAAM,OAAO,QAAQ;AAC1C,QAAI,QAAS,OAAM,KAAK,UAAU;AAClC,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,YAA2B;AACvC,UAAM,OAAO,KAAK,KAAK,WAAW,oBAAoB;AACtD,QAAI,CAAE,MAAM,OAAO,IAAI,GAAI;AACzB,YAAM,gBAAgB,MAAM,EAAE,eAAe,GAAG,OAAO,CAAC,EAAE,GAAG,GAAK;AAAA,IACpE;AACA,UAAM,SAAS,mBAAmB,MAAM,KAAK,MAAM,MAAM,SAAS,MAAM,MAAM,CAAC,CAAC;AAChF,UAAM,QAAQ,oBAAI,IAAyB;AAC3C,eAAW,QAAQ,OAAO,OAAO;AAC/B,UAAI,KAAK,gBAAgB,YAAY,KAAK,SAAS,GAAG;AACpD,cAAM,IAAI,qBAAqB,gBAAgB,KAAK,QAAQ,6BAA6B;AAAA,MAC3F;AACA,UAAI,MAAM,IAAI,KAAK,QAAQ,EAAG,OAAM,IAAI,qBAAqB,gBAAgB,KAAK,QAAQ,gBAAgB;AAC1G,YAAM,IAAI,KAAK,UAAU,IAAI;AAAA,IAC/B;AACA,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,MAAc,YAA2B;AACvC,UAAM,gBAAgB,KAAK,KAAK,WAAW,oBAAoB,GAAG;AAAA,MAChE,eAAe;AAAA,MACf,OAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC;AAAA,IAChC,GAAG,GAAK;AAAA,EACV;AACF;AAEO,SAAS,uBAAuB,MAAc,WAAmB,MAAgC;AACtG,QAAM,SAAS,IAAI,IAAI,SAAS,EAAE;AAClC,QAAM,QAAQ,WAAW,QAAQ,EAAE,OAAO,MAAM,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AAC3E,SAAO,KAAK,MAAM,WAAW,OAAO,IAAI;AAC1C;AAEO,SAAS,YAAY,WAA2B;AACrD,QAAM,UAAU,WAAW,QAAQ,EAAE,OAAOC,eAAc,SAAS,CAAC,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE,EAAE,YAAY;AAC7G,SAAO,QAAQ,MAAM,SAAS,EAAG,KAAK,GAAG;AAC3C;AAEA,eAAe,kBAAkB,MAA6B;AAC5D,MAAI,QAAQ,aAAa,QAAS;AAClC,QAAM,QAAQ,MAAM,KAAK,IAAI,GAAG,OAAO;AACvC,OAAK,OAAO,QAAW,GAAG;AACxB,UAAM,IAAI,qBAAqB,6CAA6C,KAAK,SAAS,CAAC,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE;AAAA,EACjH;AACF;AAEA,eAAe,gBAAgB,MAAc,OAAgB,MAA6B;AACxF,QAAM,gBAAgB,MAAM,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,CAAC;AAAA,GAAM,IAAI;AACzE;AAEA,eAAe,gBAAgB,MAAc,OAAe,MAA6B;AACvF,QAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AAC3D,QAAM,YAAY,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,OAAO,CAAC;AACpD,QAAM,UAAU,WAAW,OAAO,EAAE,UAAU,QAAQ,MAAM,MAAM,KAAK,CAAC;AACxE,QAAM,MAAM,WAAW,IAAI;AAC3B,QAAM,OAAO,WAAW,IAAI;AAC5B,QAAM,MAAM,MAAM,IAAI;AACxB;AAEA,eAAe,OAAO,MAAgC;AACpD,MAAI;AACF,UAAM,KAAK,IAAI;AACf,WAAO;AAAA,EACT,SAAS,OAAgB;AACvB,QAAI,YAAY,KAAK,KAAK,MAAM,SAAS,SAAU,QAAO;AAC1D,UAAM;AAAA,EACR;AACF;AAEA,SAAS,YAAY,OAAgD;AACnE,SAAO,iBAAiB,SAAS,UAAU;AAC7C;AAEA,SAAS,iBAAiB,OAAwB;AAChD,SAAO,iBAAiB,QAAQ,MAAM,UAAU;AAClD;;;AClOA,SAAS,SAAAC,QAAO,SAAAC,QAAO,YAAAC,WAAU,UAAAC,SAAQ,MAAAC,KAAI,QAAAC,OAAM,aAAAC,kBAAiB;AACpE,SAAS,WAAAC,UAAS,QAAAC,aAAY;AAI9B,IAAM,mBAAmB,iBAAE,OAAO;AAAA,EAChC,eAAe,iBAAE,QAAQ,CAAC;AAAA,EAC1B,WAAW,iBAAE,OAAO,EAAE,IAAI;AAAA,EAC1B,UAAU,iBAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC1B,qBAAqB,iBAAE,KAAK,CAAC,WAAW,0BAA0B,cAAc,CAAC;AAAA,EACjF,SAAS,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAC7C,aAAa,iBAAE,OAAO,EAAE,IAAI,EAAE;AAAA,EAC9B,sBAAsB,iBAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EAChD,cAAc,iBAAE,OAAO,EAAE,IAAI,EAAE;AAAA,EAC/B,uBAAuB,iBAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AACnD,CAAC,EAAE,OAAO;AAIH,IAAM,wBAAN,MAA4B;AAAA,EAChB;AAAA,EAEjB,YAAY,WAAmB;AAAE,SAAK,OAAOC,MAAK,WAAW,yBAAyB;AAAA,EAAE;AAAA,EAExF,MAAM,KAAK,WAAmB,UAA0D;AACtF,QAAI,CAAE,MAAMC,QAAO,KAAK,IAAI,EAAI,QAAO;AACvC,UAAMC,mBAAkB,KAAK,IAAI;AACjC,QAAI;AACJ,QAAI;AACF,eAAS,iBAAiB,MAAM,KAAK,MAAM,MAAMC,UAAS,KAAK,MAAM,MAAM,CAAC,CAAC;AAAA,IAC/E,SAAS,OAAO;AACd,YAAM,IAAI,8BAA8B,mCAAmC,YAAY,KAAK,CAAC,EAAE;AAAA,IACjG;AACA,WAAO,OAAO,cAAc,aAAa,OAAO,aAAa,WAAW,SAAS;AAAA,EACnF;AAAA,EAEA,MAAM,KAAK,aAAmF;AAC5F,UAAMC,UAAS,iBAAiB,MAAM,EAAE,eAAe,GAAG,GAAG,YAAY,CAAC;AAC1E,UAAM,YAAY,KAAK,MAAM,GAAG,KAAK,UAAUA,SAAQ,MAAM,CAAC,CAAC;AAAA,CAAI;AACnE,WAAOA;AAAA,EACT;AAAA,EAEA,MAAM,QAAuB;AAC3B,UAAMC,IAAG,KAAK,MAAM,EAAE,OAAO,KAAK,CAAC;AAAA,EACrC;AACF;AAEO,IAAM,gCAAN,cAA4C,MAAM;AAAA,EAC9C,OAAO;AAClB;AAEA,eAAe,YAAY,MAAc,UAAiC;AACxE,QAAMC,OAAMC,SAAQ,IAAI,GAAG,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AAC3D,QAAM,YAAY,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,OAAO,CAAC;AACpD,QAAMC,WAAU,WAAW,UAAU,EAAE,UAAU,QAAQ,MAAM,KAAO,MAAM,KAAK,CAAC;AAClF,QAAMC,OAAM,WAAW,GAAK;AAC5B,QAAMC,QAAO,WAAW,IAAI;AAC5B,QAAMD,OAAM,MAAM,GAAK;AACzB;AAEA,eAAeP,mBAAkB,MAA6B;AAC5D,MAAI,QAAQ,aAAa,QAAS;AAClC,QAAM,QAAQ,MAAMS,MAAK,IAAI,GAAG,OAAO;AACvC,OAAK,OAAO,QAAW,EAAG,OAAM,IAAI,8BAA8B,6CAA6C;AACjH;AAEA,eAAeV,QAAO,MAAgC;AACpD,MAAI;AACF,UAAMU,MAAK,IAAI;AACf,WAAO;AAAA,EACT,SAAS,OAAgB;AACvB,QAAI,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS,SAAU,QAAO;AACjF,UAAM;AAAA,EACR;AACF;AAEA,SAAS,YAAY,OAAwB;AAAE,SAAO,iBAAiB,QAAQ,MAAM,UAAU;AAA0B;;;AF/ClH,IAAM,uBAAN,MAA2B;AAAA,EAChC,YACmB,QACA,mBACA,UACA,QACA,MACjB;AALiB;AACA;AACA;AACA;AACA;AAAA,EAChB;AAAA,EAEH,SAAS,YAAuD;AAC9D,WAAO,WAAW,IAAI,OAAO,WAAW,CAAC,UAAU,SAAS,WAAW,KAAK,OAAO,UAAU,SAAS,MAAM,GAAG;AAAA,MAC7G,WAAW;AAAA,IACb,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,OAAO,UAAkB,SAAkB,QAAkD;AACzG,QAAI;AACF,UAAI,aAAa,eAAgB,QAAOC,IAAG,MAAM,KAAK,aAAa,CAAC;AACpE,UAAI,aAAa,qBAAsB,QAAOA,IAAG,MAAM,KAAK,UAAU,OAAO,CAAC;AAC9E,UAAI,aAAa,sBAAuB,QAAOA,IAAG,MAAM,KAAK,UAAU,OAAO,CAAC;AAC/E,UAAI,aAAa,oBAAqB,QAAOA,IAAG,MAAM,KAAK,QAAQ,OAAO,CAAC;AAC3E,UAAI,aAAa,kBAAmB,QAAOA,IAAG,MAAM,KAAK,OAAO,CAAC;AACjE,UAAI,aAAa,kBAAkB;AACjC,YAAI,KAAK,SAAS,OAAW,OAAM,IAAI,gBAAgB,sBAAsB,uCAAuC;AACpH,aAAK,KAAK,cAAc;AACxB,eAAOA,IAAG,KAAK,eAAe,CAAC;AAAA,MACjC;AACA,UAAI,KAAK,WAAW,OAAW,QAAO,KAAK,OAAO,cAAc,UAAU,SAAS,MAAM;AAEzF,UAAI,aAAa,SAAU,QAAOA,IAAG,KAAK,eAAe,CAAC;AAC1D,UAAI,aAAa,UAAW,QAAOA,IAAG,CAAC,CAAC;AACxC,UAAI,aAAa,sBAAsB;AACrC,YAAI,KAAK,SAAS,OAAW,OAAM,IAAI,gBAAgB,sBAAsB,uCAAuC;AACpH,cAAM,QAAQC,QAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,UAAU,YAAY,OAAO,MAAM,aAAa,UAAU;AACzE,gBAAM,IAAI,gBAAgB,mBAAmB,kCAAkC;AAAA,QACjF;AACA,eAAOD,IAAG,MAAM,KAAK,KAAK,yBAAyB,MAAM,OAAO,MAAM,QAAQ,CAAC;AAAA,MACjF;AACA,UAAI,aAAa,iCAAiC;AAChD,YAAI,KAAK,SAAS,OAAW,OAAM,IAAI,gBAAgB,sBAAsB,uCAAuC;AACpH,cAAM,QAAQC,QAAO,OAAO;AAC5B,YAAI,OAAO,MAAM,SAAS,YAAY,MAAM,KAAK,KAAK,MAAM,IAAI;AAC9D,gBAAM,IAAI,gBAAgB,mBAAmB,uCAAuC;AAAA,QACtF;AACA,eAAOD,IAAG,MAAM,KAAK,KAAK,sBAAsB,MAAM,IAAI,CAAC;AAAA,MAC7D;AACA,UAAI,aAAa,cAAcC,QAAO,OAAO,EAAE,SAAS,QAAS,QAAOD,IAAG,KAAK,eAAe,CAAC;AAChG,YAAM,IAAI,gBAAgB,sBAAsB,oDAAoD;AAAA,IACtG,SAAS,OAAO;AACd,aAAOE,MAAK,KAAK;AAAA,IACnB;AAAA,EACF;AAAA,EAEA,MAAc,UAAU,SAAoD;AAC1E,QAAI,KAAK,aAAa,QAAW;AAC/B,YAAM,IAAI,gBAAgB,wBAAwB,oDAAoD;AAAA,IACxG;AACA,UAAM,QAAQD,QAAO,OAAO;AAC5B,QAAI,MAAM,SAAS,UAAU,MAAM,SAAS,UAAU;AACpD,YAAM,IAAI,gBAAgB,mBAAmB,8BAA8B;AAAA,IAC7E;AACA,QAAI,OAAO,MAAM,cAAc,UAAU;AACvC,YAAM,IAAI,gBAAgB,mBAAmB,yBAAyB;AAAA,IACxE;AACA,UAAM,UAAU,eAAe,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC;AACjE,UAAM,OAAO,cAAc,EAAE,GAAG,SAAS,MAAM,MAAM,MAAM,WAAW,MAAM,UAAU,CAAC;AAEvF,UAAM,aAAa,IAAI,cAAc;AAAA,MACnC,WAAW,uBAAuB,KAAK,mBAAmB,KAAK,WAAY,MAAM,IAAI;AAAA,IACvF,CAAC;AACD,UAAM,WAAW,MAAM,WAAW,aAAaE,UAAS,CAAC;AACzD,UAAM,MAAM,MAAM,SAAS,SACvB,IAAI,cAAc,KAAK,WAAY,IAAI,sBAAsB,WAAW,SAAS,CAAC,IAClF,IAAI,gBAAgB,KAAK,WAAY,IAAI,sBAAsB,WAAW,SAAS,CAAC;AACxF,QAAI;AACJ,QAAI,MAAM,SAAS,UAAU,OAAO,MAAM,qBAAqB,YAAY,MAAM,iBAAiB,KAAK,MAAM,IAAI;AAC/G,sBAAgB,MAAM,IAAI,sBAAsB,UAAU,MAAM,gBAAgB;AAAA,IAClF,OAAO;AACL,UAAI,OAAO,MAAM,UAAU,YAAY,OAAO,MAAM,aAAa,UAAU;AACzE,cAAM,IAAI,gBAAgB,mBAAmB,4DAA4D;AAAA,MAC3G;AACA,sBAAgB,MAAM,IAAI,qBAAqB,UAAU,MAAM,OAAO,MAAM,QAAQ;AAAA,IACtF;AACA,UAAM,KAAK,SAAS,QAAQ,eAAe,IAAI,CAAC;AAChD,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,MAAM,MAAM;AAAA,MACZ,GAAI,cAAc,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,cAAc,QAAQ;AAAA,MAChF,UAAU,MAAM,KAAK,aAAa;AAAA,IACpC;AAAA,EACF;AAAA,EAEA,MAAc,UAAU,SAA+C;AACrE,QAAI,KAAK,aAAa,QAAW;AAC/B,YAAM,IAAI,gBAAgB,wBAAwB,oDAAoD;AAAA,IACxG;AACA,UAAM,QAAQF,QAAO,OAAO;AAC5B,QAAI,OAAO,MAAM,cAAc,UAAU;AACvC,YAAM,IAAI,gBAAgB,mBAAmB,yBAAyB;AAAA,IACxE;AACA,UAAM,UAAU,eAAe,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC;AACjE,UAAM,OAAO,cAAc,EAAE,GAAG,SAAS,WAAW,MAAM,UAAU,CAAC;AACrE,UAAM,KAAK,SAAS,QAAQ,eAAe,IAAI,CAAC;AAChD,WAAO,KAAK,aAAa;AAAA,EAC3B;AAAA,EAEA,MAAc,QAAQ,SAA+C;AACnE,QAAI,KAAK,aAAa,QAAW;AAC/B,YAAM,IAAI,gBAAgB,wBAAwB,oDAAoD;AAAA,IACxG;AACA,UAAM,OAAOA,QAAO,OAAO,EAAE;AAC7B,QAAI,SAAS,UAAU,SAAS,UAAU;AACxC,YAAM,IAAI,gBAAgB,mBAAmB,8BAA8B;AAAA,IAC7E;AACA,UAAM,UAAU,eAAe,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC;AACjE,UAAM,cAAc,QAAQ,SAAS,WAAW,WAAW;AAC3D,QAAI,SAAS,eAAe,QAAQ,cAAc,UAC7C,MAAM,KAAK,YAAY,QAAQ,WAAW,IAAI,MAAM,QAAW;AAClE,YAAM,KAAK,mBAAmB,QAAQ,WAAW,aAAa,IAAI;AAAA,IACpE;AACA,UAAM,KAAK,SAAS,QAAQ,EAAE,GAAG,SAAS,KAAK,CAAC;AAChD,WAAO,KAAK,aAAa;AAAA,EAC3B;AAAA,EAEA,MAAc,mBACZ,WACA,YACA,YACe;AACf,UAAM,kBAAkB,uBAAuB,KAAK,mBAAmB,WAAW,UAAU;AAC5F,UAAM,iBAAiB,MAAM,IAAI,cAAc,EAAE,WAAW,gBAAgB,CAAC,EAAE,aAAaE,UAAS,CAAC;AACtG,UAAM,cAAc,IAAI,sBAAsB,eAAe;AAC7D,QAAI,MAAM,YAAY,KAAK,WAAW,eAAe,QAAQ,MAAM,OAAW;AAC9E,UAAM,YAAY,eAAe,SAC7B,IAAI,cAAc,WAAW,WAAW,IACxC,IAAI,gBAAgB,WAAW,WAAW;AAC9C,UAAM,oBAAoB,MAAM,UAAU,aAAa,cAAc;AAErE,UAAM,kBAAkB,uBAAuB,KAAK,mBAAmB,WAAW,UAAU;AAC5F,UAAM,iBAAiB,MAAM,IAAI,cAAc,EAAE,WAAW,gBAAgB,CAAC,EAAE,aAAaA,UAAS,CAAC;AACtG,UAAM,YAAY,eAAe,SAC7B,IAAI,cAAc,WAAW,IAAI,sBAAsB,eAAe,CAAC,IACvE,IAAI,gBAAgB,WAAW,IAAI,sBAAsB,eAAe,CAAC;AAC7E,UAAM,UAAU,mBAAmB,gBAAgB,kBAAkB,aAAa,kBAAkB,OAAO;AAAA,EAC7G;AAAA,EAEA,MAAc,SAAsC;AAClD,QAAI,KAAK,aAAa,QAAW;AAC/B,YAAM,IAAI,gBAAgB,wBAAwB,oDAAoD;AAAA,IACxG;AACA,UAAM,SAAS,cAAc,KAAK,SAAS,IAAI,CAAC;AAChD,QAAI,OAAO,cAAc,QAAW;AAClC,YAAM,QAAQ,IAAI;AAAA,QAChB,KAAK,QAAQ,yBAAyB;AAAA,QACtC,KAAK,MAAM,uBAAuB;AAAA,MACpC,CAAC;AACD,YAAM,QAAQ,IAAK,CAAC,QAAQ,QAAQ,EAAY,IAAI,OAAM,SAAQ;AAChE,cAAM,YAAY,uBAAuB,KAAK,mBAAmB,OAAO,WAAY,IAAI;AACxF,cAAM,IAAI,sBAAsB,SAAS,EAAE,MAAM;AAAA,MACnD,CAAC,CAAC;AAAA,IACJ;AACA,WAAO,KAAK,aAAa;AAAA,EAC3B;AAAA,EAEA,MAAc,eAA4C;AACxD,UAAM,SAAS,KAAK,aAAa,SAAY,eAAe,KAAK,MAAM,IAAI,eAAe,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC;AAC5H,UAAM,eAAe,MAAM,KAAK,aAAa,MAAM;AACnD,UAAM,OAAO,OAAO,SAAS,WAAW,WAAW;AACnD,UAAM,cAAc,aAAa,IAAI;AACrC,WAAO;AAAA,MACL;AAAA,MACA,YAAYA,UAAS;AAAA,MACrB,UAAU,KAAK,aAAa;AAAA,MAC5B,SAAS;AAAA,MACT;AAAA,MACA,GAAI,gBAAgB,SAAY,CAAC,IAAI,EAAE,YAAY;AAAA,IACrD;AAAA,EACF;AAAA,EAEA,MAAc,aAAa,QAA6D;AACtF,QAAI,OAAO,cAAc,OAAW,QAAO,CAAC;AAC5C,UAAM,CAAC,MAAM,MAAM,IAAI,MAAM,QAAQ,IAAI;AAAA,MACvC,KAAK,YAAY,OAAO,WAAW,MAAM;AAAA,MACzC,KAAK,YAAY,OAAO,WAAW,QAAQ;AAAA,IAC7C,CAAC;AACD,WAAO;AAAA,MACL,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,KAAK;AAAA,MACrC,GAAI,WAAW,SAAY,CAAC,IAAI,EAAE,OAAO;AAAA,IAC3C;AAAA,EACF;AAAA,EAEA,MAAc,YAAY,WAAmB,MAAiE;AAC5G,UAAM,aAAa,IAAI,cAAc;AAAA,MACnC,WAAW,uBAAuB,KAAK,mBAAmB,WAAW,IAAI;AAAA,IAC3E,CAAC;AACD,UAAM,WAAW,MAAM,WAAW,aAAaA,UAAS,CAAC;AACzD,UAAM,cAAc,MAAM,IAAI,sBAAsB,WAAW,SAAS,EAAE,KAAK,WAAW,SAAS,QAAQ;AAC3G,QAAI,gBAAgB,OAAW,QAAO;AACtC,WAAO;AAAA,MACL,QAAQ,YAAY;AAAA,MACpB,GAAI,YAAY,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,YAAY,QAAQ;AAAA,IAC9E;AAAA,EACF;AAAA,EAEQ,iBAA0C;AAChD,WAAO;AAAA,MACL,MAAM;AAAA,MACN,WAAW;AAAA,MACX,4BAA4B,KAAK,SAAS;AAAA,MAC1C,GAAI,KAAK,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,KAAK,KAAK,WAAW,EAAE;AAAA,IACpE;AAAA,EACF;AACF;AAEA,SAAS,eAAe,QAAgC;AACtD,SAAO;AAAA,IACL,SAAS,OAAO;AAAA,IAChB,MAAM,OAAO;AAAA,IACb,GAAI,OAAO,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,OAAO,UAAU;AAAA,IACxE,YAAY,OAAO;AAAA,IACnB,UAAU,OAAO;AAAA,IACjB,WAAW,OAAO,UAAU,UACxB;AAAA,MACE,gBAAgB,OAAO,UAAU;AAAA,MACjC,YAAY,OAAO,UAAU;AAAA,MAC7B,QAAQ,OAAO,UAAU;AAAA,IAC3B,IACA;AAAA,EACN;AACF;AAEA,SAAS,SAAS,OAAkD;AAClE,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAEA,SAASF,QAAO,OAAyC;AACvD,MAAI,CAAC,SAAS,KAAK,EAAG,OAAM,IAAI,gBAAgB,mBAAmB,yCAAyC;AAC5G,SAAO;AACT;AAEA,SAASD,IAAG,OAAoC;AAAE,SAAO,EAAE,IAAI,MAAM,MAAM;AAAE;AAE7E,SAASE,MAAK,OAAoC;AAChD,QAAM,SAAS,iBAAiB,QAAQ,QAAQ;AAChD,QAAM,aAAa,WAAW,UAAa,UAAU,UAAU,OAAO,OAAO,SAAS,WAClF,OAAO,OACP,kBAAkB,kBAAkB,OAAO,OAAO;AACtD,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,OAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS,QAAQ,WAAW;AAAA,MAC5B,SAAS,eAAe,SAAY,CAAC,IAAI,EAAE,WAAW;AAAA,IACxD;AAAA,EACF;AACF;;;AGpRA,IAAM,SAA8B,CAAC,SAAS,QAAQ,QAAQ,OAAO;AACrE,IAAM,YAAY;AAEX,IAAM,aAAN,MAAiB;AAAA,EACtB,YAA6B,MAAgC,YAAsB,QAAQ;AAA9D;AAAgC;AAAA,EAA+B;AAAA,EAE5F,MAAM,SAAiB,QAAwC;AAAE,SAAK,MAAM,SAAS,SAAS,MAAM;AAAA,EAAE;AAAA,EACtG,KAAK,SAAiB,QAAwC;AAAE,SAAK,MAAM,QAAQ,SAAS,MAAM;AAAA,EAAE;AAAA,EACpG,KAAK,SAAiB,QAAwC;AAAE,SAAK,MAAM,QAAQ,SAAS,MAAM;AAAA,EAAE;AAAA,EACpG,MAAM,SAAiB,QAAwC;AAAE,SAAK,MAAM,SAAS,SAAS,MAAM;AAAA,EAAE;AAAA,EAE9F,MAAM,OAAiB,SAAiB,QAAwC;AACtF,QAAI,OAAO,QAAQ,KAAK,IAAI,OAAO,QAAQ,KAAK,SAAS,EAAG;AAC5D,UAAM,aAAa,WAAW,SAAY,KAAK,IAAI,KAAK,UAAU,OAAO,MAAM,CAAC,CAAC;AACjF,SAAK,KAAK,KAAK,EAAE,gBAAgB,OAAO,GAAG,UAAU,EAAE;AAAA,EACzD;AACF;AAEA,SAAS,OAAO,OAAgB,MAAM,IAAa;AACjD,MAAI,UAAU,KAAK,GAAG,EAAG,QAAO;AAChC,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,UAAQ,OAAO,IAAI,CAAC;AAC/D,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,SAAO,OAAO,YAAY,OAAO,QAAQ,KAAK,EAAE,IAAI,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,UAAU,OAAO,OAAO,QAAQ,CAAC,CAAC,CAAC;AACjH;;;ACLO,IAAM,uBAAN,MAA2B;AAAA,EAIhC,YACmB,YACA,cACA,QACjB;AAHiB;AACA;AACA;AAAA,EAChB;AAAA,EAPc,SAAS,oBAAI,IAA8B;AAAA,EACpD,cAA6B,QAAQ,QAAQ;AAAA,EAQrD,OAAO,SAAkD;AACvD,UAAM,YAAY,KAAK,YAAY,KAAK,MAAM,KAAK,UAAU,OAAO,CAAC;AACrE,SAAK,cAAc,UAAU,MAAM,MAAM,MAAS;AAClD,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,UAAU,SAAkD;AACxE,QAAI,QAAQ,UAAU,aAAa,sCAC9B,QAAQ,SAAS,iBAAiB,MAClC,QAAQ,SAAS,iBAAiB,IAAI;AACzC,YAAM,QAAQ,MAAM,uBAAuB;AAC3C,YAAM,IAAI,wBAAwB,yBAAyB,uEAAuE;AAAA,IACpI;AACA,QAAI,CAAC,KAAK,WAAW,UAAU,QAAQ,cAAc,QAAQ,eAAe,GAAG;AAC7E,YAAM,QAAQ,MAAM,wBAAwB;AAC5C,YAAM,IAAI,wBAAwB,0BAA0B,+CAA+C;AAAA,IAC7G;AACA,UAAM,eAAe,QAAQ,SAAS;AACtC,UAAM,qBAAqB,KAAK,OAAO,IAAI,YAAY;AACvD,QAAI,uBAAuB,UAAa,mBAAmB,QAAQ,iBAAiB,QAAQ,cAAc;AACxG,YAAM,QAAQ,MAAM,uBAAuB;AAC3C,YAAM,IAAI,wBAAwB,yBAAyB,qDAAqD;AAAA,IAClH;AAEA,UAAM,WAAW,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC,EAAE,OAAO,CAAAE,gBAChDA,YAAW,QAAQ,iBAAiB,QAAQ,gBACzCA,YAAW,QAAQ,SAAS,iBAAiB,YACjD;AACD,QAAI,SAAS,SAAS,GAAG;AACvB,WAAK,QAAQ,KAAK,oCAAoC;AAAA,QACpD,cAAcC,SAAQ,QAAQ,YAAY;AAAA,QAC1C,eAAe,SAAS;AAAA,QACxB,uBAAuB,SAAS,IAAI,CAAAD,gBAAcC,SAAQD,YAAW,QAAQ,YAAY,CAAC;AAAA,MAC5F,CAAC;AAAA,IACH;AACA,UAAM,QAAQ,IAAI,SAAS,IAAI,CAAAA,gBAAc,KAAK,WAAWA,aAAY,qBAAqB,CAAC,CAAC;AAEhG,UAAM,SAAS,KAAK;AAAA,MAClB,EAAE,cAAc,cAAc,QAAQ,aAAa;AAAA,MACnD,aAAW,KAAK,OAAO,cAAc,SAAS,OAAO;AAAA,IACvD;AACA,UAAM,aAA+B;AAAA,MACnC;AAAA,MACA;AAAA,MACA,aAAa,MAAM;AAAA,IACrB;AACA,SAAK,OAAO,IAAI,cAAc,UAAU;AACxC,QAAI;AACF,iBAAW,cAAc,QAAQ,UAAU,aAAW;AAAE,aAAK,KAAK,OAAO,YAAY,OAAO;AAAA,MAAE,CAAC;AAAA,IACjG,SAAS,OAAO;AACd,YAAM,KAAK,WAAW,UAAU;AAChC,YAAM;AAAA,IACR;AACA,SAAK,QAAQ,KAAK,4BAA4B;AAAA,MAC5C,cAAcC,SAAQ,QAAQ,YAAY;AAAA,MAC1C,cAAcA,SAAQ,YAAY;AAAA,MAClC,MAAM,QAAQ;AAAA,IAChB,CAAC;AAAA,EACH;AAAA,EAEA,WAAoB;AAAE,WAAO,KAAK,OAAO,OAAO;AAAA,EAAE;AAAA,EAElD,kBAA0B;AAAE,WAAO,KAAK,OAAO;AAAA,EAAK;AAAA,EAEpD,gBAA0B;AACxB,WAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC,EAAE,IAAI,gBAAc,WAAW,QAAQ,YAAY,CAAC,CAAC;AAAA,EAClG;AAAA,EAEA,eAAmC;AACjC,UAAM,QAAQ,KAAK,cAAc;AACjC,WAAO,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI;AAAA,EACzC;AAAA,EAEA,iBAAoE;AAClE,UAAM,aAAa,KAAK,OAAO,OAAO,EAAE,KAAK,EAAE;AAC/C,WAAO,YAAY,QAAQ,SAAS,eAAe,SAAY,iBAAiB;AAAA,EAClF;AAAA,EAEA,MAAM,KAAK,SAAuC;AAChD,UAAM,QAAQ,IAAI,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC,EAAE,IAAI,gBAAc,KAAK,eAAe,YAAY,OAAO,CAAC,CAAC;AAAA,EACzG;AAAA,EAEA,MAAM,OAAO,UAAiC;AAC5C,UAAM,UAAU,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC,EAAE,OAAO,gBAAc,WAAW,QAAQ,iBAAiB,QAAQ;AAC3G,UAAM,QAAQ,IAAI,QAAQ,IAAI,gBAAc,KAAK,WAAW,YAAY,gBAAgB,CAAC,CAAC;AAAA,EAC5F;AAAA,EAEA,MAAM,gBAAgB,cAAsB,MAAiC;AAC3E,UAAM,aAAa,KAAK,OAAO,IAAI,YAAY;AAC/C,QAAI,eAAe,OAAW,QAAO;AACrC,UAAM,KAAK,WAAW,YAAY,IAAI;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,QAAuB;AAC3B,UAAM,KAAK;AACX,UAAM,QAAQ,IAAI,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC,EAAE,IAAI,gBAAc,KAAK,WAAW,UAAU,CAAC,CAAC;AAAA,EAC5F;AAAA,EAEA,MAAc,OAAO,YAA8B,SAAuC;AACxF,QAAI,CAAC,KAAK,SAAS,UAAU,EAAG;AAChC,QAAI;AACF,YAAM,WAAW,MAAM,WAAW,OAAO,OAAO,OAAO;AACvD,UAAI,CAAC,KAAK,SAAS,UAAU,EAAG;AAChC,YAAM,WAAW,cAAc,QAAQ,EAAE,cAAc,2BACnD,WACA;AAAA,QACE,QAAQ;AAAA,QACR;AAAA,QACA;AAAA,QACA,EAAE,UAAU,yBAAyB;AAAA,QACrC;AAAA,MACF;AACJ,YAAM,WAAW,QAAQ,KAAK,QAAQ;AAAA,IACxC,SAAS,OAAO;AACd,WAAK,QAAQ,KAAK,+CAA+C;AAAA,QAC/D,cAAcA,SAAQ,WAAW,QAAQ,YAAY;AAAA,QACrD,QAAQ,iBAAiB,KAAK;AAAA,MAChC,CAAC;AACD,YAAM,KAAK,WAAW,UAAU;AAAA,IAClC;AAAA,EACF;AAAA,EAEA,MAAc,OAAO,cAAsB,SAAmC,SAAuC;AACnH,UAAM,aAAa,KAAK,OAAO,IAAI,YAAY;AAC/C,QAAI,eAAe,UAAa,WAAW,YAAY,QAAS;AAChE,UAAM,KAAK,eAAe,YAAY,OAAO;AAAA,EAC/C;AAAA,EAEA,MAAc,eAAe,YAA8B,SAAuC;AAChG,QAAI,CAAC,KAAK,SAAS,UAAU,EAAG;AAChC,QAAI;AACF,YAAM,WAAW,QAAQ,KAAK,OAAO;AAAA,IACvC,SAAS,OAAO;AACd,WAAK,QAAQ,KAAK,mCAAmC;AAAA,QACnD,cAAcA,SAAQ,WAAW,QAAQ,YAAY;AAAA,QACrD,aAAa,QAAQ;AAAA,QACrB,QAAQ,iBAAiB,KAAK;AAAA,MAChC,CAAC;AACD,YAAM,KAAK,WAAW,UAAU;AAAA,IAClC;AAAA,EACF;AAAA,EAEA,MAAc,WAAW,YAA8B,MAA8B;AACnF,QAAI,CAAC,KAAK,SAAS,UAAU,EAAG;AAChC,SAAK,OAAO,OAAO,WAAW,QAAQ,SAAS,YAAY;AAC3D,eAAW,YAAY;AACvB,QAAI;AACF,YAAM,WAAW,OAAO,iBAAiB;AAAA,IAC3C,UAAE;AACA,YAAM,WAAW,QAAQ,MAAM,IAAI;AAAA,IACrC;AACA,SAAK,QAAQ,KAAK,gCAAgC;AAAA,MAChD,cAAcA,SAAQ,WAAW,QAAQ,YAAY;AAAA,MACrD,cAAcA,SAAQ,WAAW,QAAQ,SAAS,YAAY;AAAA,MAC9D,MAAM,QAAQ;AAAA,IAChB,CAAC;AAAA,EACH;AAAA,EAEQ,SAAS,YAAuC;AACtD,WAAO,KAAK,OAAO,IAAI,WAAW,QAAQ,SAAS,YAAY,MAAM;AAAA,EACvE;AACF;AAEO,IAAM,0BAAN,cAAsC,MAAM;AAAA,EACjD,YAAqB,MAAc,SAAiB;AAAE,UAAM,OAAO;AAA9C;AAAA,EAAgD;AACvE;AAEA,SAAS,iBAAiB,OAAwB;AAChD,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,SAAO,QAAQ,QAAQ,YAAY,GAAG,EAAE,MAAM,GAAG,GAAG,KAAK;AAC3D;AAEA,SAASA,SAAQ,OAAuB;AAAE,SAAO,MAAM,UAAU,KAAK,QAAQ,GAAG,MAAM,MAAM,GAAG,CAAC,CAAC,SAAI,MAAM,MAAM,EAAE,CAAC;AAAG;;;ACvMxH,IAAM,oBAAoB,iBAAE,OAAO,EAAE,QAAQ,iBAAE,OAAO,EAAE,IAAI,CAAC,GAAG,QAAQ,iBAAE,QAAQ,EAAE,CAAC,EAAE,OAAO;AAC9F,IAAM,aAAa,oBAAI,IAAI;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,oBAAoB,CAAC,gBAAgB;AAE3C,IAAM,YAAN,MAAgB;AAAA,EAGrB,YACmB,YACA,aAAa,KACb,QACjB;AAHiB;AACA;AACA;AAAA,EAChB;AAAA,EANK,SAAS;AAAA,EAQjB,mBAAkC;AAAE,WAAO,KAAK,WAAW,SAAS;AAAA,EAAE;AAAA,EAEtE,MAAM,OAAO,SAAgD;AAC3D,QAAI,QAAQ,SAAS,eAAe;AAClC,aAAO,eAAe,QAAQ,IAAI,mBAAmB,8DAA8D;AAAA,IACrH;AACA,UAAM,gBAAgB,kBAAkB,UAAU,QAAQ,OAAO;AACjE,QAAI,CAAC,cAAc,QAAS,QAAO,eAAe,QAAQ,IAAI,mBAAmB,qCAAqC;AACtH,QAAI,CAAC,WAAW,IAAI,cAAc,KAAK,MAAM,GAAG;AAC9C,aAAO,eAAe,QAAQ,IAAI,oBAAoB,sCAAsC;AAAA,IAC9F;AACA,UAAM,UAAU;AAChB,QAAI,KAAK,UAAU,KAAK,YAAY;AAClC,aAAO,eAAe,QAAQ,IAAI,gBAAgB,+CAA+C,QAAW,IAAI;AAAA,IAClH;AACA,SAAK,UAAU;AACf,UAAM,YAAY,YAAY,IAAI;AAClC,QAAI;AACF,YAAM,SAAS,MAAM,KAAK,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,MAAM;AAC/E,WAAK,QAAQ,MAAM,eAAe;AAAA,QAChC,QAAQ,QAAQ,QAAQ;AAAA,QACxB,YAAY,KAAK,MAAM,YAAY,IAAI,IAAI,SAAS;AAAA,MACtD,CAAC;AACD,aAAO,kBAAkB,QAAQ,IAAI,MAAM;AAAA,IAC7C,SAAS,OAAgB;AACvB,YAAM,WAAW,cAAc,QAAQ,IAAI,KAAK;AAChD,WAAK,QAAQ,KAAK,mBAAmB;AAAA,QACnC,QAAQ,QAAQ,QAAQ;AAAA,QACxB,YAAY,KAAK,MAAM,YAAY,IAAI,IAAI,SAAS;AAAA,QACpD,MAAM,SAAS,QAAQ;AAAA,QACvB,WAAW,SAAS,QAAQ;AAAA,QAC5B,QAAQC,kBAAiB,KAAK;AAAA,MAChC,CAAC;AACD,aAAO;AAAA,IACT,UAAE;AACA,WAAK,UAAU;AAAA,IACjB;AAAA,EACF;AAAA,EAEQ,OAAO,QAAgB,QAA6C;AAC1E,YAAQ,QAAQ;AAAA,MACd,KAAK;AAAoB,eAAO,KAAK,WAAW,KAAK,MAAM;AAAA,MAC3D,KAAK;AAAuB,eAAO,KAAK,WAAW,QAAQ,MAAM;AAAA,MACjE,KAAK;AAA2B,eAAO,KAAK,WAAW,WAAW,MAAM;AAAA,MACxE,KAAK;AAA4B,eAAO,KAAK,WAAW,YAAY,MAAM;AAAA,MAC1E;AAAS,cAAM,IAAI,SAAS,oBAAoB,sCAAsC;AAAA,IACxF;AAAA,EACF;AACF;AAEO,IAAM,WAAN,cAAuB,MAAM;AAAA,EAClC,YAAqB,MAAc,SAA0B,SAA4B,YAAY,OAAO;AAAE,UAAM,OAAO;AAAtG;AAAwC;AAA4B;AAAA,EAAoC;AAC/H;AAEA,SAAS,cAAc,WAAmB,OAAgD;AACxF,MAAI,iBAAiB,SAAU,QAAO,eAAe,WAAW,MAAM,MAAM,MAAM,SAAS,MAAM,SAAS,MAAM,SAAS;AACzH,MAAI,iBAAiB,iBAAE,SAAU,QAAO,eAAe,WAAW,mBAAmB,iCAAiC;AACtH,SAAO,eAAe,WAAW,kBAAkB,0CAA0C;AAC/F;AAEA,SAASA,kBAAiB,OAAwB;AAChD,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,SAAO,QAAQ,QAAQ,YAAY,GAAG,EAAE,MAAM,GAAG,GAAG,KAAK;AAC3D;;;AC/BA,IAAM,sCAAsC;AAErC,IAAM,uBAAN,MAA2B;AAAA,EAahC,YACmB,QACA,UACA,YACA,KACA,aACA,QACA,kBAAoC,SAAO,IAAI,UAAU,GAAG,GAC5D,oBACjB;AARiB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAAA,EAChB;AAAA,EArBK;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,SAAS;AAAA,EACT;AAAA,EACS,UAAU,oBAAI,IAA2B;AAAA,EAClD;AAAA,EACA;AAAA,EACA,qBAAqB;AAAA,EACrB,eAAe;AAAA,EACf;AAAA,EAaR,QAAc;AACZ,QAAI,KAAK,YAAY,OAAW;AAChC,SAAK,UAAU;AACf,SAAK,UAAU,KAAK,IAAI,EAAE,QAAQ,MAAM;AAAE,WAAK,UAAU;AAAA,IAAU,CAAC;AAAA,EACtE;AAAA,EAEA,SAAe;AACb,SAAK,gBAAgB;AACrB,SAAK,UAAU;AACf,QAAI,KAAK,YAAY,QAAW;AAC9B,WAAK,MAAM;AACX;AAAA,IACF;AACA,QAAI,KAAK,aAAc;AACvB,SAAK,eAAe;AACpB,SAAK,KAAK,QAAQ,QAAQ,MAAM;AAC9B,WAAK,eAAe;AACpB,UAAI,CAAC,KAAK,QAAS,MAAK,MAAM;AAAA,IAChC,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,OAAsB;AAC1B,SAAK,UAAU;AACf,SAAK,qBAAqB;AAC1B,SAAK,YAAY;AACjB,SAAK,YAAY;AACjB,SAAK,QAAQ,MAAM,KAAM,gBAAgB;AACzC,UAAM,KAAK;AACX,UAAM,KAAK,YAAY;AAAA,EACzB;AAAA,EAEA,WAAoB;AAAE,WAAO,KAAK;AAAA,EAAO;AAAA,EAEzC,YAAgC;AAAE,WAAO,KAAK;AAAA,EAAc;AAAA,EAE5D,eAAmC;AAAE,WAAO,KAAK;AAAA,EAAa;AAAA,EAE9D,iBAA0B;AAAE,WAAO,CAAC,KAAK,UAAU,CAAC,KAAK,WAAW,KAAK,YAAY;AAAA,EAAU;AAAA,EAE/F,YAAkB;AAChB,SAAK,gBAAgB;AACrB,SAAK,UAAU;AACf,QAAI,KAAK,YAAY,QAAW;AAC9B,WAAK,MAAM;AACX;AAAA,IACF;AACA,SAAK,qBAAqB;AAC1B,SAAK,YAAY;AACjB,SAAK,QAAQ,MAAM,KAAM,kBAAkB;AAC3C,SAAK,KAAK,QAAQ,QAAQ,MAAM;AAC9B,UAAI,CAAC,KAAK,sBAAsB,KAAK,QAAS;AAC9C,WAAK,qBAAqB;AAC1B,WAAK,MAAM;AAAA,IACb,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,MAAqB;AACjC,QAAI,UAAU,KAAK,OAAO,UAAU;AACpC,WAAO,CAAC,KAAK,SAAS;AACpB,UAAI;AACF,cAAM,KAAK,YAAY;AACvB,kBAAU,KAAK,OAAO,UAAU;AAAA,MAClC,SAAS,OAAO;AACd,cAAM,OAAO,UAAU,KAAK;AAC5B,aAAK,gBAAgB;AACrB,aAAK,OAAO,KAAK,oCAAoC,EAAE,MAAM,WAAW,YAAY,KAAK,EAAE,CAAC;AAC5F,YAAI,qBAAqB,IAAI,IAAI,KAAK,CAAC,KAAK,OAAO,UAAU,QAAS;AAAA,MACxE;AACA,UAAI,KAAK,QAAS;AAClB,UAAI,KAAK,oBAAoB;AAC3B,aAAK,qBAAqB;AAC1B,kBAAU,KAAK,OAAO,UAAU;AAChC;AAAA,MACF;AACA,UAAI,CAAC,KAAK,OAAO,UAAU,QAAS;AACpC,YAAM,KAAK,gBAAgB,OAAO;AAClC,UAAI,KAAK,oBAAoB;AAC3B,aAAK,qBAAqB;AAC1B,kBAAU,KAAK,OAAO,UAAU;AAChC;AAAA,MACF;AACA,gBAAU,KAAK,IAAI,KAAK,OAAO,UAAU,YAAY,UAAU,CAAC;AAAA,IAClE;AAAA,EACF;AAAA,EAEA,MAAc,cAA6B;AACzC,UAAM,cAAc,MAAM,KAAK,IAAI,aAAa,KAAK,QAAQ;AAC7D,QAAI,KAAK,QAAS;AAClB,UAAM,SAAS,KAAK,gBAAgBC,cAAa,KAAK,IAAI,OAAO,CAAC;AAClE,SAAK,SAAS;AACd,QAAI,eAAe;AACnB,QAAI,eAAe,QAAQ,QAAQ;AACnC,UAAM,IAAI,QAAc,CAACC,UAAS,WAAW;AAC3C,UAAI,UAAU;AACd,YAAM,aAAa,WAAW,MAAM,OAAO,MAAM,MAAM,eAAe,GAAG,GAAM;AAC/E,YAAM,SAAS,CAAC,UAAwB;AACtC,YAAI,QAAS;AACb,kBAAU;AACV,qBAAa,UAAU;AACvB,aAAK,SAAS;AACd,YAAI,KAAK,WAAW,OAAQ,MAAK,SAAS;AAC1C,aAAK,KAAK,YAAY,EAAE,QAAQ,MAAM,UAAU,SAAYA,SAAQ,IAAI,OAAO,KAAK,CAAC;AAAA,MACvF;AACA,aAAO,SAAS,MAAM;AACpB,aAAK,YAAY,SAAS;AAAA,UACxB,MAAM;AAAA,UACN,UAAU,KAAK,SAAS;AAAA,UACxB,aAAa,YAAY;AAAA,UACzB,WAAW,CAAC,gBAAgB;AAAA,UAC5B,eAAe;AAAA,UACf,cAAc,KAAK,uBAAuB,UAAa,KAAK,OAAO,aAC/D,CAAC,mBAAmB,gBAAgB,IACpC,CAAC,iBAAiB,kBAAkB,mBAAmB,gBAAgB;AAAA,QAC7E,CAAC;AAAA,MACH;AACA,aAAO,YAAY,WAAS;AAC1B,uBAAe,aAAa,KAAK,YAAY;AAC3C,gBAAM,QAAQ,cAAc,MAAM,IAAI;AACtC,eAAK,eAAe,KAAK,IAAI;AAC7B,cAAI,MAAM,SAAS,aAAa;AAC9B,kBAAM,UAAU,gBAAgB,MAAM,OAAO;AAC7C,2BAAe;AACf,yBAAa,UAAU;AACvB,iBAAK,SAAS;AACd,iBAAK,gBAAgB;AACrB,iBAAK,OAAO,KAAK,oCAAoC;AAAA,cACnD,eAAe,QAAQ;AAAA,cACvB,qBAAqBC,SAAQ,QAAQ,mBAAmB;AAAA,YAC1D,CAAC;AACD;AAAA,UACF;AACA,cAAI,CAAC,aAAc,OAAM,IAAI,uBAAuB,mBAAmB,uCAAuC;AAC9G,gBAAM,KAAK,YAAY,KAAK;AAAA,QAC9B,CAAC,EAAE,MAAM,WAAS;AAChB,gBAAM,OAAO,UAAU,KAAK;AAC5B,eAAK,gBAAgB;AACrB,eAAK,OAAO,MAAM,+BAA+B;AAAA,YAC/C;AAAA,YACA,QAAQC,kBAAiB,KAAK;AAAA,UAChC,CAAC;AACD,iBAAO,MAAM,MAAM,uBAAuB;AAAA,QAC5C,CAAC;AAAA,MACH;AACA,aAAO,UAAU,MAAM;AACrB,YAAI,CAAC,aAAc,QAAO,IAAI,uBAAuB,qBAAqB,sCAAsC,CAAC;AAAA,MACnH;AACA,aAAO,UAAU,WAAS;AACxB,cAAM,QAAQ,YAA2B;AACvC,gBAAM,aAAa,MAAM,MAAM,MAAS;AACxC,cAAI,MAAM,SAAS,MAAM;AACvB,gBAAI;AAAE,oBAAM,KAAK,IAAI,mBAAmB;AAAA,YAAE,SAAS,OAAO;AAAE,qBAAOC,SAAQ,KAAK,CAAC;AAAG;AAAA,YAAO;AAAA,UAC7F;AACA,cAAI,MAAM,SAAS,MAAM;AAAE,mBAAO,IAAI,uBAAuB,kBAAkB,sCAAsC,CAAC;AAAG;AAAA,UAAO;AAChI,cAAI,aAAc,MAAK,gBAAgB,UAAU,MAAM,IAAI;AAC3D,iBAAO,eAAe,SAAY,IAAI,uBAAuB,UAAU,MAAM,IAAI,GAAG,MAAM,UAAU,mCAAmC,CAAC;AAAA,QAC1I;AACA,aAAK,MAAM;AAAA,MACb;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,YAAY,OAA4D;AACpF,QAAI,MAAM,SAAS,QAAQ;AACzB,YAAM,QAAQ,YAAY,MAAM,SAAS,OAAO;AAChD,UAAI,OAAO,UAAU,SAAU,OAAM,IAAI,uBAAuB,mBAAmB,4BAA4B;AAC/G,WAAK,YAAY,QAAQ,EAAE,MAAM,CAAC;AAClC;AAAA,IACF;AACA,QAAI,MAAM,SAAS,OAAQ;AAC3B,QAAI,MAAM,SAAS,oBAAoB;AACrC,YAAM,KAAK,sBAAsB,uBAAuB,MAAM,OAAO,CAAC;AACtE;AAAA,IACF;AACA,QAAI,MAAM,SAAS,oBAAoB;AACrC,YAAM,KAAK,gBAAgB,iBAAiB,MAAM,OAAO,CAAC;AAC1D;AAAA,IACF;AACA,QAAI,MAAM,SAAS,SAAS;AAC1B,YAAM,KAAK,YAAY,aAAa,MAAM,OAAO,CAAC;AAClD;AAAA,IACF;AACA,QAAI,MAAM,SAAS,gBAAgB;AACjC,YAAM,KAAK,kBAAkB,cAAc,MAAM,OAAO,CAAC;AACzD;AAAA,IACF;AACA,QAAI,MAAM,SAAS,cAAc;AAC/B,WAAK,gBAAgB,iBAAiB,MAAM,OAAO,CAAC;AACpD;AAAA,IACF;AACA,QAAI,MAAM,SAAS,qBAAsB;AACzC,QAAI,MAAM,SAAS,gBAAiB;AACpC,QAAI,MAAM,SAAS,SAAS;AAC1B,YAAM,UAAU,oBAAoB,MAAM,OAAO;AACjD,UAAI,QAAQ,SAAS,kBAAkB;AACrC,aAAK,gBAAgB,QAAQ;AAC7B,aAAK,QAAQ,MAAM,MAAM,gBAAgB;AAAA,MAC3C,WAAW,QAAQ,iBAAiB,QAAW;AAC7C,cAAM,KAAK,WAAW,QAAQ,cAAc,QAAQ,IAAI;AACxD,aAAK,OAAO,KAAK,qCAAqC;AAAA,UACpD,MAAM,QAAQ;AAAA,UACd,cAAcF,SAAQ,QAAQ,YAAY;AAAA,UAC1C,WAAW,QAAQ;AAAA,QACrB,CAAC;AAAA,MACH,OAAO;AACL,aAAK,gBAAgB,QAAQ;AAC7B,aAAK,OAAO,KAAK,mCAAmC,EAAE,MAAM,QAAQ,MAAM,WAAW,QAAQ,UAAU,CAAC;AAAA,MAC1G;AACA;AAAA,IACF;AACA,UAAM,IAAI,uBAAuB,mBAAmB,oCAAoC,MAAM,IAAI,EAAE;AAAA,EACtG;AAAA,EAEA,MAAc,sBAAsB,SAAgD;AAClF,QAAI;AACJ,QAAI;AACF,mBAAa,MAAM,KAAK,IAAI,UAAU,QAAQ,cAAc;AAAA,IAC9D,SAAS,OAAO;AACd,WAAK,YAAY,oBAAoB,EAAE,cAAc,QAAQ,aAAa,CAAC;AAC3E,WAAK,OAAO,KAAK,gDAAgD;AAAA,QAC/D,gBAAgBA,SAAQ,QAAQ,cAAc;AAAA,QAC9C,MAAM,UAAU,KAAK;AAAA,MACvB,CAAC;AACD;AAAA,IACF;AACA,QAAI,WAAW,SAAS,YAAY,WAAW,aAAa,QAAQ,kBAC/D,WAAW,gBAAgB,QAAQ,mBAAmB;AACzD,WAAK,YAAY,oBAAoB,EAAE,cAAc,QAAQ,aAAa,CAAC;AAC3E,WAAK,OAAO,KAAK,mDAAmD;AAAA,QAClE,gBAAgBA,SAAQ,QAAQ,cAAc;AAAA,MAChD,CAAC;AACD;AAAA,IACF;AACA,UAAM,WAAW,KAAK,WAAW,YAAY,WAAW,QAAQ;AAChE,QAAI,aAAa,UAAa,SAAS,cAAc,WAAW,aAAa;AAC3E,WAAK,YAAY,oBAAoB,EAAE,cAAc,QAAQ,aAAa,CAAC;AAC3E,WAAK,OAAO,KAAK,+CAA+C;AAAA,QAC9D,gBAAgBA,SAAQ,QAAQ,cAAc;AAAA,MAChD,CAAC;AACD;AAAA,IACF;AACA,UAAM,OAAO,aAAa,UACrB,SAAS,iBAAiB,WAAW,gBACrC,SAAS,SAAS,WAAW,QAC7B,SAAS,aAAa,WAAW,WAClC,WACA,MAAM,KAAK,WAAW,UAAU;AAAA,MAC9B,UAAU,WAAW;AAAA,MACrB,MAAM,WAAW;AAAA,MACjB,UAAU,WAAW;AAAA,MACrB,WAAW,WAAW;AAAA,MACtB,cAAc,WAAW;AAAA,IAC3B,CAAC;AACL,UAAM,WAAW,KAAK,QAAQ,IAAI,QAAQ,YAAY;AACtD,cAAU,MAAM,QAAQ;AACxB,UAAM,QAAQ,IAAI,eAAe;AAAA,MAC/B,MAAM;AAAA,MACN,iBAAiB,KAAK,SAAS;AAAA,MAC/B,gBAAgB,KAAK,SAAS;AAAA,MAC9B,iBAAiB,KAAK;AAAA,MACtB,UAAU,oBAAoB,QAAQ,cAAc,KAAK,SAAS,UAAU,KAAK,QAAQ;AAAA,IAC3F,CAAC;AACD,SAAK,QAAQ,IAAI,QAAQ,cAAc;AAAA,MACrC,cAAc,QAAQ;AAAA,MACtB,cAAc,WAAW;AAAA,MACzB;AAAA,MACA;AAAA,MACA,WAAW;AAAA,IACb,CAAC;AACD,SAAK,YAAY,oBAAoB,EAAE,cAAc,QAAQ,aAAa,CAAC;AAAA,EAC7E;AAAA,EAEA,MAAc,gBAAgB,SAAgD;AAC5E,UAAM,SAAS,KAAK,QAAQ,IAAI,QAAQ,YAAY;AACpD,QAAI,WAAW,UACV,OAAO,YAAY,UACnB,QAAQ,mBAAmB,KAAK,SAAS,YACzC,QAAQ,SAAS,GAAG;AAKvB,WAAK,OAAO,KAAK,sCAAsC;AAAA,QACrD,cAAcA,SAAQ,OAAO,YAAY;AAAA,QACzC,cAAcA,SAAQ,OAAO,KAAK,QAAQ;AAAA,MAC5C,CAAC;AACD;AAAA,IACF;AACA,QAAI,WAAW,UAAa,QAAQ,mBAAmB,KAAK,SAAS,YAAY,QAAQ,SAAS,GAAG;AACnG,YAAM,IAAI,uBAAuB,yBAAyB,sDAAsD;AAAA,IAClH;AACA,WAAO,MAAM,cAAcG,eAAc,QAAQ,IAAI,CAAC;AACtD,UAAM,QAAQ,OAAO,MAAM,eAAe;AAC1C,QAAI,CAAC,OAAO,MAAM,SAAU,OAAM,IAAI,uBAAuB,yBAAyB,sCAAsC;AAC5H,UAAM,YAAY,OAAO,QAAQ,WAAc,OAAO,cAAc,SAAS,OAAO,cAAc;AAClG,QAAI,CAAC,aAAa,OAAO,cAAc,cAAe,QAAO,YAAY;AACzE,UAAM,OAAO,YAAa,OAAO,cAAc,SAAS,SAAS,QAAS;AAC1E,UAAM,WAAW,YACb,CAAC,eAA2B,OAAO,IAAK,KAAK,UAAU,IACvD,CAAC,eAA2B,KAAK,UAAU,QAAQ,UAAU;AACjE,UAAM,UAAU,IAAI,mBAAmB,QAAQ,UAAU,MAAM;AAC7D,UAAI,KAAK,QAAQ,IAAI,OAAO,YAAY,MAAM,OAAQ,MAAK,QAAQ,OAAO,OAAO,YAAY;AAAA,IAC/F,GAAG,IAAI;AACP,WAAO,UAAU;AACjB,UAAM,KAAK,YAAY,OAAO,OAAO;AAKrC,SAAK,YAAY,oBAAoB;AAAA,MACnC,cAAc,OAAO;AAAA,MACrB,gBAAgB,OAAO,KAAK;AAAA,MAC5B,MAAM;AAAA,MACN,MAAMC,aAAY,KAAK;AAAA,IACzB,CAAkC;AAClC,SAAK,OAAO,KAAK,oCAAoC;AAAA,MACnD,cAAcJ,SAAQ,OAAO,YAAY;AAAA,MACzC,cAAcA,SAAQ,OAAO,KAAK,QAAQ;AAAA,MAC1C,WAAW;AAAA,IACb,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,YAAY,SAAsC;AAC9D,QAAI,QAAQ,mBAAmB,KAAK,SAAS,UAAU;AACrD,YAAM,IAAI,uBAAuB,mBAAmB,8CAA8C;AAAA,IACpG;AACA,UAAM,SAAS,KAAK,QAAQ,IAAI,QAAQ,YAAY;AACpD,QAAI,QAAQ,YAAY,QAAW;AACjC,WAAK,OAAO,KAAK,6BAA6B;AAAA,QAC5C,cAAcA,SAAQ,QAAQ,YAAY;AAAA,MAC5C,CAAC;AACD;AAAA,IACF;AACA,QAAI;AACF,aAAO,QAAQ,QAAQ,QAAQ,SAASG,eAAc,QAAQ,UAAU,CAAC;AAAA,IAC3E,SAAS,OAAO;AACd,YAAM,OAAO,QAAQ,MAAM;AAC3B,YAAM,IAAI,uBAAuB,yBAAyBD,SAAQ,KAAK,EAAE,OAAO;AAAA,IAClF;AAAA,EACF;AAAA,EAEA,MAAc,kBAAkB,SAAuC;AACrE,UAAM,SAAS,KAAK,QAAQ,IAAI,QAAQ,YAAY;AACpD,QAAI,WAAW,UAAa,QAAQ,mBAAmB,KAAK,SAAS,UAAU;AAC7E,WAAK,OAAO,KAAK,8BAA8B,EAAE,cAAcF,SAAQ,QAAQ,YAAY,EAAE,CAAC;AAC9F;AAAA,IACF;AACA,QAAI,OAAO,YAAY,UAAa,OAAO,QAAQ,QAAW;AAE5D,WAAK,OAAO,KAAK,kCAAkC,EAAE,cAAcA,SAAQ,OAAO,YAAY,EAAE,CAAC;AACjG;AAAA,IACF;AACA,QAAI,KAAK,OAAO,YAAY;AAE1B,WAAK,OAAO,KAAK,+CAA+C,EAAE,cAAcA,SAAQ,OAAO,YAAY,EAAE,CAAC;AAC9G;AAAA,IACF;AACA,QAAI,KAAK,eAAe,UAAa,KAAK,uBAAuB,QAAW;AAC1E,WAAK,aAAa,MAAM,KAAK,mBAAmB,EAAE,MAAM,MAAM,MAAS;AAAA,IACzE;AACA,QAAI,KAAK,eAAe,QAAW;AAGjC,WAAK,OAAO,KAAK,kDAAkD,EAAE,cAAcA,SAAQ,OAAO,YAAY,EAAE,CAAC;AACjH;AAAA,IACF;AACA,QAAI,aAA6B,CAAC;AAClC,QAAI;AACF,mBAAa,MAAM,KAAK,IAAI,gBAAgB,OAAO,YAAY;AAAA,IACjE,SAAS,OAAO;AACd,WAAK,OAAO,KAAK,0DAA0D;AAAA,QACzE,cAAcA,SAAQ,OAAO,YAAY;AAAA,QACzC,MAAM,UAAU,KAAK;AAAA,MACvB,CAAC;AAAA,IACH;AACA,UAAM,MAAM,IAAI,wBAAwB;AAAA,MACtC,MAAM;AAAA,MACN,SAAS,KAAK;AAAA,MACd;AAAA,MACA,UAAU,YAAU,KAAK,cAAc,QAAQ,MAAM;AAAA,MACrD,oBAAoB;AAAA,MACpB,OAAO,SAAS,OAAO,KAAK,QAAQ;AAAA,IACtC,CAAC;AACD,WAAO,MAAM;AACb,QAAI,UAAU,UAAQ,OAAO,SAAS,QAAQ,QAAW,IAAI,CAAC;AAC9D,QAAI,QAAQ,MAAM;AAChB,WAAK,KAAK,gBAAgB,QAAQ,KAAK,IAAI,MAAM,6BAA6B,CAAC;AAAA,IACjF,CAAC;AACD,SAAK,IAAI,QAAQ,EAAE,KAAK,MAAM;AAC5B,WAAK,gBAAgB,QAAQ,IAAI,kBAAkB,KAAK,KAAK;AAAA,IAC/D,CAAC,EAAE,MAAM,WAAS;AAChB,WAAK,KAAK,gBAAgB,QAAQ,KAAKE,SAAQ,KAAK,CAAC;AAAA,IACvD,CAAC;AACD,QAAI,aAAa,EAAE,MAAM,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,EACtD;AAAA,EAEQ,gBAAgB,SAAiC;AACvD,UAAM,SAAS,KAAK,QAAQ,IAAI,QAAQ,YAAY;AACpD,QAAI,WAAW,UAAa,QAAQ,mBAAmB,KAAK,SAAS,SAAU;AAC/E,WAAO,KAAK,aAAa,EAAE,MAAM,OAAO,WAAW,QAAQ,UAAU,CAAC;AAAA,EACxE;AAAA,EAEQ,cAAc,QAAuB,QAAyB;AACpE,QAAI,OAAO,SAAS,UAAU;AAC5B,WAAK,YAAY,iBAAiB;AAAA,QAChC,cAAc,OAAO;AAAA,QACrB,gBAAgB,OAAO,KAAK;AAAA,QAC5B,KAAK,OAAO;AAAA,MACd,CAAyB;AAAA,IAC3B,WAAW,OAAO,SAAS,OAAO;AAChC,WAAK,YAAY,cAAc;AAAA,QAC7B,cAAc,OAAO;AAAA,QACrB,gBAAgB,OAAO,KAAK;AAAA,QAC5B,WAAW,OAAO;AAAA,MACpB,CAA4B;AAAA,IAC9B;AAAA,EACF;AAAA,EAEQ,gBAAgB,QAAuB,UAAsC;AACnF,QAAI,KAAK,QAAQ,IAAI,OAAO,YAAY,MAAM,UAAU,OAAO,QAAQ,OAAW;AAClF,WAAO,YAAY;AACnB,SAAK,sBAAsB,QAAQ,QAAQ;AAC3C,SAAK,OAAO,KAAK,6BAA6B;AAAA,MAC5C,cAAcF,SAAQ,OAAO,YAAY;AAAA,MACzC,cAAcA,SAAQ,OAAO,KAAK,QAAQ;AAAA,MAC1C,WAAW;AAAA,IACb,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,gBACZ,QACA,KACA,OACe;AACf,QAAI,KAAK,QAAQ,IAAI,OAAO,YAAY,MAAM,UAAU,OAAO,QAAQ,IAAK;AAC5E,QAAI,OAAO,YAAY,UAAa,OAAO,cAAc,SAAS,OAAO,cAAc,QAAQ;AAC7F,WAAK,OAAO,KAAK,kDAAkD;AAAA,QACjE,cAAcA,SAAQ,OAAO,YAAY;AAAA,QACzC,QAAQC,kBAAiB,KAAK;AAAA,MAChC,CAAC;AACD,YAAM,KAAK,WAAW,OAAO,cAAc,mBAAmB;AAC9D;AAAA,IACF;AACA,WAAO,MAAM;AACb,WAAO,YAAY;AACnB,UAAM,IAAI,MAAM;AAChB,SAAK,OAAO,KAAK,oDAAoD;AAAA,MACnE,cAAcD,SAAQ,OAAO,YAAY;AAAA,MACzC,QAAQC,kBAAiB,KAAK;AAAA,IAChC,CAAC;AAAA,EACH;AAAA,EAEQ,sBAAsB,QAAuB,WAAoC;AACvF,SAAK,YAAY,sBAAsB;AAAA,MACrC,cAAc,OAAO;AAAA,MACrB,gBAAgB,OAAO,KAAK;AAAA,MAC5B;AAAA,IACF,CAAoC;AAAA,EACtC;AAAA,EAEA,MAAc,UAAU,QAAuB,YAAuC;AACpF,UAAM,UAAU,OAAO,OAAO,MAAM,eAAe,IAAI,EAAE;AACzD,QAAI,CAAC,OAAO,cAAc,OAAO,KAAK,UAAU,EAAG,OAAM,IAAI,uBAAuB,mBAAmB,qCAAqC;AAC5I,SAAK,YAAY,SAAS;AAAA,MACxB,cAAc,OAAO;AAAA,MACrB,gBAAgB,OAAO,KAAK;AAAA,MAC5B;AAAA,MACA,YAAYG,aAAY,UAAU;AAAA,IACpC,CAAwB;AAAA,EAC1B;AAAA,EAEQ,YAAY,MAAgD,SAAwB;AAC1F,UAAM,SAAS,KAAK;AACpB,QAAI,WAAW,UAAa,OAAO,eAAe,EAAG,OAAM,IAAI,uBAAuB,qBAAqB,oCAAoC;AAC/I,WAAO,KAAK,KAAK,UAAU,mBAAmB,MAAM,OAAO,CAAC,CAAC;AAAA,EAC/D;AAAA,EAEA,MAAc,cAA6B;AACzC,UAAM,UAAU,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC;AACzC,SAAK,QAAQ,MAAM;AACnB,UAAM,QAAQ,IAAI,QAAQ,IAAI,OAAM,WAAU;AAC5C,UAAI,OAAO,QAAQ,OAAW,OAAM,OAAO,IAAI,MAAM;AACrD,UAAI,OAAO,YAAY,OAAW,OAAM,OAAO,QAAQ,MAAM;AAAA,UACxD,QAAO,MAAM,QAAQ;AAAA,IAC5B,CAAC,CAAC;AACF,UAAM,KAAK,YAAY,MAAM;AAAA,EAC/B;AAAA,EAEA,MAAc,WAAW,cAAsB,MAA8B;AAC3E,UAAM,SAAS,KAAK,QAAQ,IAAI,YAAY;AAC5C,QAAI,WAAW,OAAW;AAC1B,SAAK,QAAQ,OAAO,YAAY;AAChC,QAAI;AACF,YAAM,OAAO,KAAK,MAAM;AAAA,IAC1B,SAAS,OAAO;AACd,WAAK,OAAO,KAAK,wCAAwC;AAAA,QACvD,cAAcJ,SAAQ,YAAY;AAAA,QAClC,QAAQC,kBAAiB,KAAK;AAAA,MAChC,CAAC;AAAA,IACH;AACA,QAAI,OAAO,YAAY,QAAW;AAChC,UAAI;AACF,cAAM,SAAS,MAAM,KAAK,YAAY,gBAAgB,cAAc,IAAI;AACxE,YAAI,CAAC,OAAQ,OAAM,OAAO,QAAQ,MAAM,IAAI;AAAA,MAC9C,SAAS,OAAO;AACd,cAAM,OAAO,QAAQ,MAAM,IAAI,EAAE,MAAM,MAAM,MAAS;AACtD,aAAK,OAAO,KAAK,4CAA4C;AAAA,UAC3D,cAAcD,SAAQ,YAAY;AAAA,UAClC,QAAQC,kBAAiB,KAAK;AAAA,QAChC,CAAC;AAAA,MACH;AAAA,IACF,OAAO;AACL,aAAO,MAAM,QAAQ;AAAA,IACvB;AAAA,EACF;AAAA,EAEQ,gBAAgB,WAAkC;AACxD,UAAM,SAAS,YAAY,KAAK,OAAO,UAAU;AACjD,UAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,YAAY,SAAS,KAAK,OAAO,IAAI,SAAS,CAAC,CAAC;AACrF,WAAO,IAAI,QAAQ,CAAAF,aAAW;AAC5B,YAAM,QAAQ,WAAW,MAAM;AAAE,aAAK,YAAY;AAAW,QAAAA,SAAQ;AAAA,MAAE,GAAG,KAAK;AAC/E,WAAK,YAAY,MAAM;AAAE,qBAAa,KAAK;AAAG,QAAAA,SAAQ;AAAA,MAAE;AAAA,IAC1D,CAAC;AAAA,EACH;AACF;AAEA,IAAM,uBAAuB,oBAAI,IAAI;AAAA,EACnC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,qBAAN,MAA6D;AAAA,EAU3D,YACmB,QACA,UACA,SACjB,MACA;AAJiB;AACA;AACA;AAGjB,SAAK,OAAO;AACZ,SAAK,WAAW;AAAA,MACd,UAAU;AAAA,MACV,cAAc,OAAO;AAAA,MACrB,cAAc,OAAO;AAAA,IACvB;AACA,SAAK,eAAe,OAAO,KAAK;AAChC,SAAK,kBAAkB,OAAO,KAAK;AAAA,EACrC;AAAA,EAvBS;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACQ,WAAW,oBAAI,IAAsC;AAAA,EACrD,WAAW,IAAI,mBAAmB;AAAA,EAClC,WAAW,IAAI,mBAAmB;AAAA,EAC3C,SAAS;AAAA,EAkBjB,MAAM,KAAK,SAAuC;AAChD,QAAI,KAAK,OAAQ,OAAM,IAAI,MAAM,0BAA0B;AAC3D,eAAW,aAAa,KAAK,SAAS,OAAO,cAAc,OAAO,CAAC,GAAG;AACpE,YAAM,KAAK,SAAS,KAAK,OAAO,MAAM,QAAQ,SAAS,CAAC;AAAA,IAC1D;AAAA,EACF;AAAA,EAEA,UAAU,SAAuD;AAC/D,SAAK,SAAS,IAAI,OAAO;AACzB,WAAO,MAAM,KAAK,SAAS,OAAO,OAAO;AAAA,EAC3C;AAAA,EAEA,QAAQ,SAA6B,YAA8B;AACjE,QAAI,KAAK,OAAQ;AACjB,QAAI,YAAY,QAAW;AACzB,YAAM,WAAW,OAAO,KAAK,OAAO,MAAM,iBAAiB,CAAC;AAC5D,UAAI,CAAC,OAAO,cAAc,OAAO,KAAK,YAAY,UAAU;AAC1D,cAAM,IAAI,uBAAuB,mBAAmB,8CAA8C;AAAA,MACpG;AAAA,IACF;AACA,UAAM,YAAY,KAAK,SAAS,OAAO,KAAK,OAAO,MAAM,QAAQ,UAAU,CAAC;AAC5E,QAAI,cAAc,OAAW;AAC7B,UAAM,UAAU,cAAc,SAAS;AACvC,eAAW,WAAW,KAAK,SAAU,SAAQ,OAAO;AAAA,EACtD;AAAA,EAEA,MAAM,MAAM,OAA+B;AACzC,QAAI,KAAK,OAAQ;AACjB,SAAK,SAAS;AACd,SAAK,SAAS,MAAM;AACpB,SAAK,SAAS,MAAM;AACpB,SAAK,SAAS,MAAM;AACpB,SAAK,OAAO,MAAM,QAAQ;AAC1B,SAAK,QAAQ;AAAA,EACf;AACF;AAEA,IAAM,yBAAN,cAAqC,MAAM;AAAA,EACzC,YAAqB,MAAc,SAAiB;AAAE,UAAM,OAAO;AAA9C;AAAA,EAAgD;AACvE;AAEA,SAASD,cAAa,SAAyB;AAC7C,QAAM,MAAM,IAAI,IAAI,OAAO;AAC3B,MAAI,WAAW,IAAI,aAAa,WAAW,SAAS;AACpD,MAAI,WAAW,GAAG,IAAI,SAAS,QAAQ,OAAO,EAAE,CAAC;AACjD,SAAO,IAAI,SAAS;AACtB;AAEA,SAAS,cAAc,MAAqD;AAC1E,MAAI,OAAO,SAAS,SAAU,OAAM,IAAI,uBAAuB,mBAAmB,0CAA0C;AAC5H,MAAI;AAAE,WAAO,kBAAkB,KAAK,MAAM,IAAI,CAAC;AAAA,EAAE,QAAQ;AAAE,UAAM,IAAI,uBAAuB,mBAAmB,uCAAuC;AAAA,EAAE;AAC1J;AAEA,SAAS,gBAAgB,OAAiC;AACxD,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,QAAQ,aAAa,oBAAoB,OAAO,QAAQ,kBAAkB,YACzE,OAAO,QAAQ,wBAAwB,YAAY,CAAC,OAAO,cAAc,QAAQ,mBAAmB,KACpG,CAAC,OAAO,cAAc,QAAQ,oBAAoB,KAAK,CAAC,OAAO,cAAc,QAAQ,kBAAkB,GAAG;AAC7G,UAAM,IAAI,uBAAuB,mBAAmB,+BAA+B;AAAA,EACrF;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,OAAwC;AACtE,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,OAAO,QAAQ,iBAAiB,YAAY,OAAO,QAAQ,mBAAmB,YAC7E,OAAO,QAAQ,sBAAsB,YAAY,QAAQ,kBAAkB,aAC3E,CAAC,MAAM,QAAQ,QAAQ,mBAAmB,GAAG;AAChD,UAAM,IAAI,uBAAuB,mBAAmB,sCAAsC;AAAA,EAC5F;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAwC;AAChE,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,OAAO,QAAQ,iBAAiB,YAAY,OAAO,QAAQ,mBAAmB,YAC7E,CAAC,OAAO,cAAc,QAAQ,IAAI,KAAK,OAAO,QAAQ,SAAS,UAAU;AAC5E,UAAM,IAAI,uBAAuB,mBAAmB,sCAAsC;AAAA,EAC5F;AACA,SAAO;AACT;AAEA,SAAS,aAAa,OAA8B;AAClD,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,OAAO,QAAQ,iBAAiB,YAAY,OAAO,QAAQ,mBAAmB,YAC7E,CAAC,OAAO,cAAc,QAAQ,OAAO,KAAK,OAAO,QAAQ,eAAe,UAAU;AACrF,UAAM,IAAI,uBAAuB,mBAAmB,2BAA2B;AAAA,EACjF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,OAA+B;AACpD,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,OAAO,QAAQ,iBAAiB,YAAY,OAAO,QAAQ,mBAAmB,YAC7E,OAAO,QAAQ,QAAQ,YAAY,QAAQ,IAAI,WAAW,GAAG;AAChE,UAAM,IAAI,uBAAuB,mBAAmB,yCAAyC;AAAA,EAC/F;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAkC;AAC1D,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,OAAO,QAAQ,iBAAiB,YAAY,OAAO,QAAQ,mBAAmB,YAC7E,OAAO,QAAQ,cAAc,YAAY,QAAQ,cAAc,QAAQ,MAAM,QAAQ,QAAQ,SAAS,GAAG;AAC5G,UAAM,IAAI,uBAAuB,mBAAmB,gCAAgC;AAAA,EACtF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAAqC;AAChE,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,OAAO,QAAQ,SAAS,YAAY,OAAO,QAAQ,YAAY,YAC7D,QAAQ,iBAAiB,WAAc,OAAO,QAAQ,iBAAiB,YAAY,QAAQ,iBAAiB,KAAM;AACtH,UAAM,IAAI,uBAAuB,mBAAmB,2BAA2B;AAAA,EACjF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,OAAyC;AAC9D,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI,uBAAuB,mBAAmB,oCAAoC;AAAA,EAC1F;AACA,SAAO;AACT;AAEA,SAAS,YAAY,OAAgB,KAAsB;AAAE,SAAO,cAAc,KAAK,EAAE,GAAG;AAAE;AAC9F,SAASE,SAAQ,OAAuB;AAAE,SAAO,MAAM,UAAU,KAAK,QAAQ,GAAG,MAAM,MAAM,GAAG,CAAC,CAAC,SAAI,MAAM,MAAM,EAAE,CAAC;AAAG;AACxH,SAASE,SAAQ,OAAuB;AAAE,SAAO,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,kCAAkC;AAAE;AAChI,SAASD,kBAAiB,OAAwB;AAChD,QAAM,UAAUC,SAAQ,KAAK,EAAE,QAAQ,QAAQ,YAAY,GAAG,EAAE,MAAM,GAAG,GAAG;AAC5E,SAAO,WAAW;AACpB;AACA,SAAS,UAAU,OAAwB;AAAE,SAAO,iBAAiB,kBAAkB,iBAAiB,yBAAyB,MAAM,OAAO;AAAoB;AAClK,SAAS,YAAY,OAAyB;AAAE,SAAO,iBAAiB,iBAAiB,MAAM,YAAY,UAAU,KAAK,MAAM;AAAiB;AACjJ,SAAS,UAAU,MAAsB;AACvC,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,SAAS,KAAM,QAAO;AAC1B,SAAO;AACT;;;ACnxBA,SAAS,SAAS,QAAAG,aAAY;AAC9B,SAAS,WAAAC,UAAS,YAAAC,iBAAgB;AAClC,SAAS,UAAU,WAAAC,UAAS,YAAY,OAAO,eAAe;AAW9D,IAAM,cAAc;AAGpB,eAAsB,oBAAoB,MAAe,QAAiD;AACxG,UAAQ,eAAe;AACvB,QAAM,OAAO,QAAQF,SAAQ,CAAC;AAC9B,QAAM,SAAS,SAAS,UAAa,KAAK,KAAK,MAAM,KAAK,OAAO,QAAQ,IAAI;AAC7E,MAAI,CAAC,WAAW,MAAM,EAAG,OAAM,IAAI,MAAM,6CAA6C;AACtF,QAAM,OAAO,MAAM,QAAQ,QAAQ,EAAE,eAAe,KAAK,CAAC;AAC1D,QAAM,cAAgC,CAAC;AACvC,aAAW,OAAO,MAAM;AACtB,YAAQ,eAAe;AACvB,UAAM,QAAQ,QAAQ,QAAQ,IAAI,IAAI;AACtC,QAAI,YAAY,IAAI,YAAY;AAChC,QAAI,CAAC,aAAa,IAAI,eAAe,EAAG,aAAY,MAAMD,MAAK,KAAK,EAAE,KAAK,WAAS,MAAM,YAAY,CAAC,EAAE,MAAM,MAAM,KAAK;AAC1H,QAAI,CAAC,UAAW;AAChB,gBAAY,KAAK,EAAE,MAAM,IAAI,MAAM,MAAM,OAAO,QAAQE,UAAS,MAAM,WAAW,IAAI,KAAK,WAAW,GAAG,EAAE,CAAC;AAAA,EAC9G;AACA,cAAY,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,MAAM,QAAW,EAAE,aAAa,OAAO,CAAC,CAAC;AACzG,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,QAAQ,OAAO,MAAM;AAAA,IACrB,SAAS,YAAY,MAAM,GAAG,WAAW;AAAA,IACzC,WAAW,YAAY,SAAS;AAAA,EAClC;AACF;AAEA,SAAS,OAAO,MAAgC;AAC9C,QAAM,OAAO,MAAM,IAAI,EAAE;AACzB,QAAM,SAA2B,CAAC,EAAE,MAAM,MAAM,MAAM,MAAM,QAAQ,MAAM,CAAC;AAC3E,QAAM,WAAqB,CAAC;AAC5B,MAAI,UAAU;AACd,SAAO,YAAY,MAAM;AACvB,aAAS,QAAQ,SAAS,OAAO,CAAC;AAClC,cAAUC,SAAQ,OAAO;AAAA,EAC3B;AACA,aAAW,WAAW,UAAU;AAC9B,cAAU,QAAQ,SAAS,OAAO;AAClC,WAAO,KAAK,EAAE,MAAM,SAAS,MAAM,SAAS,QAAQ,MAAM,CAAC;AAAA,EAC7D;AACA,SAAO;AACT;;;AC1BA,IAAM,aAAa,iBAAE,OAAO;AAAA,EAC1B,QAAQ,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;AAAA,EAChC,OAAO,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG;AAAA,EAChC,SAAS,iBAAE,QAAQ;AACrB,CAAC,EAAE,OAAO;AAEV,IAAM,gBAAgB,iBAAE,OAAO;AAAA,EAC7B,SAAS,iBAAE,OAAO;AAAA,IAChB,MAAM,iBAAE,QAAQ,iBAAiB;AAAA,IACjC,OAAO,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG;AAAA,IAChC,QAAQ,iBAAE,QAAQ;AAAA,EACpB,CAAC,EAAE,OAAO;AACZ,CAAC,EAAE,OAAO;AAEV,IAAM,mBAAmB,iBAAE,OAAO;AAAA,EAChC,UAAU,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG;AAAA,EACnC,QAAQ,iBAAE,KAAK,CAAC,OAAO,MAAM,CAAC;AAAA,EAC9B,OAAO,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG;AAAA,EAChC,SAAS,iBAAE,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKhB,WAAW,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EACjD,CAAC,EAAE,OAAO;AACZ,CAAC,EAAE,OAAO;AAEV,IAAM,oBAAoB,iBAAE,OAAO,EAAE,UAAU,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,EAAE,OAAO;AAEpF,IAAM,0BAA0B,iBAAE,OAAO;AAAA,EACvC,SAAS,iBAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG;AAAA,EAClC,MAAM,iBAAE,OAAO,EAAE,MAAM,yCAAyC;AAClE,CAAC,EAAE,OAAO;AAQH,IAAM,wBAAwB;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;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;AAkBA,IAAM,yBAAyB;AAE/B,IAAM,6BAA6B,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,CAAC;AAiBpD,IAAM,mBAAN,MAAuB;AAAA,EAQ5B,YACmB,KACA,SACA,aAAa,GACb,QACjB,eACA;AALiB;AACA;AACA;AACA;AAGjB,SAAK,UAAU,gBAAgB,KAAK,aAAa;AACjD,SAAK,MAAM,IAAI,OAAO,IAAI,KAAK,IAAI,MAAM;AACzC,SAAK,OAAO,IAAI,OAAO,KAAK,KAAK,IAAI,MAAM;AAC3C,SAAK,SAAS,IAAI,QAAQ,KAAK,GAAG;AAAA,EACpC;AAAA,EAlBiB;AAAA,EACA,UAAU,oBAAI,IAA0B;AAAA,EACxC,cAAc,oBAAI,IAAoB;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AAAA,EAejB,MAAM,KAAK,OAA+C;AACxD,UAAM,SAAS,WAAW,MAAM,KAAK;AACrC,UAAM,SAAS,KAAK,QAAQ,IAAI,OAAO,MAAM;AAC7C,QAAI,WAAW,OAAW,OAAM,aAAa,OAAO,MAAM;AAC1D,UAAM,YAAY,YAAY,IAAI;AAClC,UAAM,SAAS,YAAY,QAAQ,sBAAsB;AACzD,UAAM,UAAU,EAAE,OAAO,OAAO,OAAgB,SAAS,OAAO,QAAQ;AACxE,QAAI;AAKF,YAAM,kBAAkB,CAAC,oBAA6B;AAAA,QACpD,OAAO,EAAE,OAAO,OAAO,OAAgB,SAAS,gBAAgB,GAAG,MAAM;AAAA,QACzE;AAAA,QACA,oBAAoB,OAAO,MAAM,oBAAoB,sBAAsB;AAAA,MAC7E;AACA,UAAI;AACJ,UAAI,OAAO,WAAW,mBAAmB;AACvC,mBAAW,MAAM,mBAAmB,iBAAiB,OAAO,SAAS,OAAO,KAAc;AAAA,MAC5F,OAAO;AACL,mBAAW,MAAM,gBAAgB,QAAQ,OAAO;AAAA,MAClD;AACA,UAAI,OAAO,WAAW,wBAAwB,6BAA6B,QAAQ,GAAG;AACpF,cAAM,UAAU,OAAO,OAAO,YAAY,YAAY,OAAO,YAAY,OAAO,OAAO,UAAgC,CAAC;AACxH,cAAM,QAAQ,MAAM,oBAAoB,OAAO,QAAQ,SAAS,WAAW,QAAQ,OAAO,QAAW,MAAM;AAC3G,mBAAW,EAAE,OAAO,OAAO,OAAgB,QAAQ,EAAE,IAAI,MAAM,MAAM,EAAE;AAAA,MACzE;AACA,WAAK,QAAQ,MAAM,uBAAuB;AAAA,QACxC,QAAQ,OAAO;AAAA,QACf,YAAY,KAAK,MAAM,YAAY,IAAI,IAAI,SAAS;AAAA,MACtD,CAAC;AACD,aAAO;AAAA,IACT,SAAS,OAAO;AACd,YAAM,aAAa,KAAK,MAAM,YAAY,IAAI,IAAI,SAAS;AAC3D,WAAK,QAAQ,KAAK,2BAA2B;AAAA,QAC3C,QAAQ,OAAO;AAAA,QACf;AAAA,QACA,UAAU,OAAO;AAAA,QACjB,QAAQC,kBAAiB,KAAK;AAAA,MAChC,CAAC;AACD,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,QAAQ,OAAkC;AAC9C,UAAM,SAAS,cAAc,MAAM,KAAK;AACxC,SAAK,QAAQ,MAAM,uBAAuB,EAAE,OAAOC,SAAQ,OAAO,QAAQ,KAAK,EAAE,CAAC;AAClF,QAAI,CAAC,KAAK,YAAY,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC/C,YAAM,IAAI,SAAS,0BAA0B,0DAA0D;AAAA,IACzG;AACA,UAAM,UAAU,MAAM,KAAK,OAAO,OAAO,OAAyB;AAClE,QAAI,QAAQ,YAAY,QAAQ,WAAW,cAAe,MAAK,YAAY,OAAO,OAAO,QAAQ,KAAK;AACtG,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,OAAoD;AAC7D,UAAM,SAAS,iBAAiB,MAAM,KAAK;AAC3C,QAAI,KAAK,QAAQ,IAAI,OAAO,QAAQ,EAAG,OAAM,IAAI,SAAS,oBAAoB,2CAA2C;AACzH,QAAI,KAAK,QAAQ,QAAQ,KAAK,WAAY,OAAM,IAAI,SAAS,gBAAgB,4CAA4C,QAAW,IAAI;AACxI,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,UAAU,EAAE,OAAO,OAAO,OAAgB,SAAS,OAAO,QAAQ;AACxE,UAAM,SAAS,OAAO,WAAW,QAC7B,KAAK,IAAI,SAAkB,WAAW,MAAM,IAC5C,KAAK,KAAK,SAAkB,WAAW,MAAM;AACjD,UAAM,iBAAiB,OAAO,WAAW,QAAQ,OAAO,QAAQ,YAAY;AAC5E,UAAM,OAAO,KAAK,KAAK,OAAO,UAAU,QAAQ,WAAW,QAAQ,cAAc;AACjF,SAAK,QAAQ,IAAI,OAAO,UAAU,EAAE,YAAY,MAAM,GAAI,mBAAmB,SAAY,CAAC,IAAI,EAAE,eAAe,EAAG,CAAC;AACnH,SAAK,QAAQ,MAAM,2BAA2B;AAAA,MAC5C,QAAQ,OAAO;AAAA,MACf,UAAUA,SAAQ,OAAO,QAAQ;AAAA,MACjC,GAAI,mBAAmB,SAAY,CAAC,IAAI,EAAE,gBAAgBA,SAAQ,cAAc,EAAE;AAAA,IACpF,CAAC;AACD,WAAO,EAAE,QAAQ,MAAM,UAAU,OAAO,SAAS;AAAA,EACnD;AAAA,EAEA,YAAY,OAAuD;AACjE,UAAM,SAAS,kBAAkB,MAAM,KAAK;AAC5C,UAAM,SAAS,KAAK,QAAQ,IAAI,OAAO,QAAQ;AAC/C,QAAI,WAAW,QAAW;AAMxB,WAAK,QAAQ,OAAO,OAAO,QAAQ;AACnC,aAAO,WAAW,MAAM;AAAA,IAC1B;AACA,SAAK,QAAQ,MAAM,4BAA4B,EAAE,UAAUA,SAAQ,OAAO,QAAQ,GAAG,QAAQ,WAAW,OAAU,CAAC;AACnH,WAAO,EAAE,QAAQ,WAAW,QAAW,UAAU,OAAO,SAAS;AAAA,EACnE;AAAA,EAEA,MAAM,SAAS,SAA+C,qBAAoC;AAChG,UAAM,UAAU,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC;AACzC,SAAK,QAAQ,MAAM;AACnB,SAAK,YAAY,MAAM;AACvB,eAAW,UAAU,QAAS,QAAO,WAAW,MAAM,MAAM;AAAA,EAM9D;AAAA,EAEA,MAAc,KACZ,UACA,QACA,QACA,gBACe;AACf,QAAI,SAA+C;AACnD,QAAI;AACF,uBAAiB,SAAS,QAAQ;AAChC,YAAI,OAAO,QAAS;AACpB,YAAI,mBAAmB,UAAa,eAAe,KAAK,MAAM,UAAa,eAAe,KAAK,MAAM,gBAAgB;AAInH;AAAA,QACF;AACA,aAAK,iBAAiB,KAAK;AAC3B,cAAM,KAAK,QAAQ,qBAAqB,EAAE,UAAU,MAAM,CAA+B;AAAA,MAC3F;AACA,UAAI,OAAO,QAAS,UAAS;AAAA,IAC/B,QAAQ;AACN,eAAS,OAAO,UAAU,cAAc;AAAA,IAC1C,UAAE;AACA,WAAK,QAAQ,OAAO,QAAQ;AAC5B,YAAM,KAAK,QAAQ,6BAA6B,EAAE,UAAU,OAAO,CAAsC,EAAE,MAAM,MAAM,MAAS;AAAA,IAClI;AAAA,EACF;AAAA,EAEQ,iBAAiB,OAA+C;AACtE,UAAM,UAAU,MAAM;AACtB,QAAI,QAAQ,SAAS,sBAAsB;AACzC,WAAK,YAAY,IAAI,OAAO,MAAM,KAAK,GAAG,YAAY,OAAO,QAAQ,UAAU,CAAC,EAAE;AAClF;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,sBAAsB;AACzC,WAAK,YAAY,IAAI,OAAO,MAAM,KAAK,GAAG,YAAY,OAAO,MAAM,KAAK,CAAC,EAAE;AAC3E;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,qBAAqB;AACxC,WAAK,kBAAkB,YAAY,OAAO,QAAQ,UAAU,CAAC,EAAE;AAC/D;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,qBAAqB;AACxC,WAAK,YAAY,OAAO,OAAO,QAAQ,aAAa,CAAC;AAAA,IACvD;AAAA,EACF;AAAA,EAEQ,kBAAkB,OAAqB;AAC7C,eAAW,CAAC,OAAO,WAAW,KAAK,KAAK,aAAa;AACnD,UAAI,gBAAgB,MAAO,MAAK,YAAY,OAAO,KAAK;AAAA,IAC1D;AAAA,EACF;AACF;AAEA,SAAS,6BAA6B,UAAyC;AAC7E,QAAM,SAAS,SAAS;AACxB,SAAO,OAAO,WAAW,YAAY,WAAW,QAAQ,QAAQ,UAAU,OAAO,OAAO,SACnF,WAAW,UAAU,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,QAC1E,UAAU,OAAO,SAAS,OAAO,MAAM,SAAS;AACvD;AAEA,SAAS,gBAAgB,KAAe,eAAsE;AAC5G,QAAM,UAAU;AAChB,QAAM,UAAU,oBAAI,IAA0B;AAC9C,aAAW,UAAU,uBAAuB;AAC1C,QAAI,WAAW,oBAAoB;AAIjC,UAAI,kBAAkB,OAAW;AACjC,YAAMC,kBAA+B,OAAO,SAAS,WAAW;AAC9D,cAAM,OAAO,wBAAwB,MAAM,QAAQ,OAAO;AAC1D,cAAM,CAAC,WAAW,aAAa,IAAI,OAAO,MAAM,GAAG;AACnD,cAAM,QAAQ,MAAM,cAAc,OAAO;AAAA,UACvC;AAAA,UACA,QAAQ;AAAA,UACR;AAAA,UACA,GAAI,WAAW,SAAY,CAAC,IAAI,EAAE,OAAO;AAAA,QAC3C,CAAC;AACD,eAAO,EAAE,OAAO,QAAQ,OAAO,QAAQ,EAAE,IAAI,MAAM,MAAM,EAAE;AAAA,MAC7D;AACA,cAAQ,IAAI,QAAQA,eAAc;AAClC;AAAA,IACF;AACA,UAAM,CAAC,YAAY,MAAM,IAAI,OAAO,MAAM,GAAG;AAC7C,UAAM,SAAS,eAAe,UAAU;AACxC,UAAM,iBAAiB,QAAQ,MAAM,IAAI,MAAM;AAC/C,QAAI,OAAO,mBAAmB,WAAY;AAC1C,YAAQ,IAAI,QAAQ,eAAe,KAAK,QAAQ,MAAM,CAAC,CAAC;AAAA,EAC1D;AACA,SAAO;AACT;AAEA,SAAS,eAAe,YAA4B;AAClD,MAAI,eAAe,UAAW,QAAO;AACrC,MAAI,eAAe,WAAY,QAAO;AACtC,MAAI,eAAe,QAAS,QAAO;AACnC,MAAI,eAAe,cAAe,QAAO;AACzC,MAAI,eAAe,OAAQ,QAAO;AAClC,SAAO;AACT;AAEA,SAAS,aAAa,QAA0B;AAC9C,SAAO,IAAI,SAAS,sBAAsB,sBAAsB,KAAK,UAAU,MAAM,CAAC,mCAAmC;AAC3H;AAEA,SAASF,kBAAiB,OAAwB;AAChD,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,SAAO,QAAQ,QAAQ,YAAY,GAAG,EAAE,MAAM,GAAG,GAAG,KAAK;AAC3D;AAGA,SAAS,eAAe,OAA6D;AACnF,QAAM,UAAU,MAAM;AACtB,SAAO,OAAO,QAAQ,cAAc,YAAY,QAAQ,UAAU,SAAS,IAAI,QAAQ,YAAY;AACrG;AAEA,SAAS,mBACP,iBACA,SACA,OAC+B;AAC/B,QAAM,oBAAoB,gCAAgC,mBAAmB,OAAO,CAAC;AACrF,SAAO,qBAAqB,iBAAiB,SAAS,OAAO,iBAAiB;AAChF;AAEA,eAAe,qBACb,iBACA,SACA,OACA,WAC+B;AAC/B,aAAW,eAAe,WAAW;AACnC,UAAM,iBAAiB,sBAAsB,SAAS,WAAW;AACjE,UAAM,WAAW,MAAM,gBAAgB,cAAc;AACrD,UAAM,UAAU,kBAAkB,OAAO,SAAS,MAAM;AACxD,QAAI,cAAc,OAAO,EAAE,cAAc,yBAA0B,QAAO;AAC1E,QAAI,gBAAgB,UAAU,UAAU,SAAS,CAAC,GAAG;AACnD,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,QACA,EAAE,UAAU,yBAAyB;AAAA,QACrC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,IAAI,SAAS,kBAAkB,2DAA2D;AAClG;AAEA,SAAS,gCAAgC,sBAA6D;AACpG,QAAM,YAAY,gCAAgC,oBAAoB;AACtE,QAAM,QAAkB,CAAC;AACzB,MAAI,cAAc,QAAW;AAC3B,UAAM,KAAK,GAAG,0BAA0B;AACxC,WAAO;AAAA,EACT;AACA,QAAM,KAAK,SAAS;AACpB,aAAW,SAAS,4BAA4B;AAC9C,QAAI,QAAQ,aAAa,CAAC,MAAM,SAAS,KAAK,EAAG,OAAM,KAAK,KAAK;AAAA,EACnE;AACA,SAAO;AACT;AAEA,SAAS,gCAAgC,OAA+C;AACtF,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,UAAU,KAAK,EAAG,QAAO;AACrC,MAAI,SAAS,EAAG,QAAO;AACvB,SAAO,KAAK,IAAI,GAAG,KAAK;AAC1B;AAEA,SAAS,mBAAmB,SAAsC;AAChE,MAAI,YAAY,QAAQ,OAAO,YAAY,SAAU,QAAO;AAC5D,QAAM,QAAS,QAAsC;AACrD,SAAO,OAAO,UAAU,YAAY,OAAO,UAAU,KAAK,KAAK,QAAQ,IAAI,QAAQ;AACrF;AAEA,SAAS,sBAAsB,SAAkB,aAA8B;AAC7E,MAAI,YAAY,QAAQ,OAAO,YAAY,YAAY,MAAM,QAAQ,OAAO,EAAG,QAAO,EAAE,YAAY;AACpG,SAAO,EAAE,GAAG,SAAS,YAAY;AACnC;AAEA,SAAS,YAAe,SAAqB,IAAY,SAA6B;AACpF,SAAO,IAAI,QAAW,CAACG,UAAS,WAAW;AACzC,UAAM,QAAQ,WAAW,MAAM;AAC7B,aAAO,IAAI,SAAS,WAAW,SAAS,QAAW,IAAI,CAAC;AAAA,IAC1D,GAAG,EAAE;AACL,UAAM,QAAQ;AACd,YAAQ;AAAA,MACN,WAAS;AAAE,qBAAa,KAAK;AAAG,QAAAA,SAAQ,KAAK;AAAA,MAAE;AAAA,MAC/C,WAAS;AAAE,qBAAa,KAAK;AAAG,eAAO,KAAK;AAAA,MAAE;AAAA,IAChD;AAAA,EACF,CAAC;AACH;AAEA,SAASF,SAAQ,OAAuB;AAAE,SAAO,MAAM,UAAU,KAAK,QAAQ,GAAG,MAAM,MAAM,GAAG,CAAC,CAAC,SAAI,MAAM,MAAM,EAAE,CAAC;AAAG;;;ACrcxH,SAAS,yBAAyB;AAsDlC,IAAI;AAGJ,eAAsB,oBAAmE;AACvF,MAAI,kBAAkB,OAAW,QAAO;AACxC,MAAI;AACF,UAAM,SAAU,MAAM,OAAO,QAAQ;AACrC,oBAAgB,mBAAmB,MAAM;AACzC,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGO,SAAS,mBAAmB,QAAgD;AACjF,SAAO;AAAA,IACL,OAAO,eAAe;AACpB,YAAM,WAAW,eAAe;AAChC,YAAM,MAAM,IAAI,OAAO,kBAAkB;AAAA,QACvC,YAAa,cAAc,cAAc,CAAC;AAAA,QAC1C,YAAY;AAAA,QACZ,wBAAwB;AAAA,QACxB,GAAI,aAAa,SAAY,CAAC,IAAI,EAAE,uBAAuB,EAAE,MAAM,SAAS,EAAE;AAAA,MAChF,CAAC;AAED,UAAI,iBAAsF;AAC1F,UAAI,gBAAuE;AAC3E,UAAI,iBAAiB,WAAS;AAC5B,YAAI,mBAAmB,KAAM;AAC7B,uBAAe,EAAE,WAAW,MAAM,cAAc,SAAY,OAAO,MAAM,UAAU,OAAO,EAAE,CAAC;AAAA,MAC/F;AACA,UAAI,gBAAgB,WAAS;AAC3B,YAAI,kBAAkB,KAAM;AAC5B,sBAAc,EAAE,SAASG,kBAAiB,MAAM,OAAO,EAAE,CAAC;AAAA,MAC5D;AAEA,YAAM,KAAwB;AAAA,QAC5B,IAAI,kBAA0B;AAAE,iBAAO,IAAI;AAAA,QAAgB;AAAA,QAC3D,IAAI,qBAA6B;AAAE,iBAAO,IAAI;AAAA,QAAmB;AAAA,QACjE,IAAI,oBAA4B;AAAE,iBAAO,IAAI;AAAA,QAAkB;AAAA,QAC/D,IAAI,iBAAyB;AAAE,iBAAO,IAAI;AAAA,QAAe;AAAA,QACzD,IAAI,wBAAwB,OAAO;AAAE,cAAI,0BAA0B;AAAA,QAAM;AAAA,QACzE,IAAI,0BAA0B;AAAE,iBAAO,IAAI;AAAA,QAAwB;AAAA,QACnE,IAAI,2BAA2B,OAAO;AAAE,cAAI,6BAA6B;AAAA,QAAM;AAAA,QAC/E,IAAI,6BAA6B;AAAE,iBAAO,IAAI;AAAA,QAA2B;AAAA,QACzE,IAAI,0BAA0B,OAAO;AAAE,cAAI,4BAA4B;AAAA,QAAM;AAAA,QAC7E,IAAI,4BAA4B;AAAE,iBAAO,IAAI;AAAA,QAA0B;AAAA,QACvE,IAAI,eAAe,OAAO;AAAE,2BAAiB;AAAA,QAAM;AAAA,QACnD,IAAI,iBAAiB;AAAE,iBAAO;AAAA,QAAe;AAAA,QAC7C,IAAI,cAAc,OAAO;AAAE,0BAAgB;AAAA,QAAM;AAAA,QACjD,IAAI,gBAAgB;AAAE,iBAAO;AAAA,QAAc;AAAA,QAC3C,kBAAkB,OAAO,SAAS;AAChC,iBAAOA,kBAAiB,IAAI,kBAAkB,OAAO,EAAE,SAAS,SAAS,WAAW,KAAK,CAAC,CAAC;AAAA,QAC7F;AAAA,QACA,cAAc;AAAE,iBAAO,IAAI,YAAY;AAAA,QAAE;AAAA,QACzC,eAAe;AAAE,iBAAO,IAAI,aAAa;AAAA,QAAE;AAAA,QAC3C,oBAAoB,aAAa;AAAE,iBAAO,IAAI,oBAAoB,WAAW,EAAE,KAAK,MAAM,MAAS;AAAA,QAAE;AAAA,QACrG,qBAAqB,aAAa;AAAE,iBAAO,IAAI,qBAAqB,WAAW;AAAA,QAAE;AAAA,QACjF,gBAAgB,WAAW;AAAE,iBAAO,IAAI,gBAAgB,SAAS;AAAA,QAAE;AAAA,QACnE,WAAW;AAAE,iBAAO,IAAI,SAAS;AAAA,QAAE;AAAA,QACnC,QAAQ;AAAE,eAAK,IAAI,MAAM,EAAE,MAAM,MAAM,MAAS;AAAA,QAAE;AAAA,MACpD;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAASA,kBAAiB,KAAwC;AAChE,SAAO;AAAA,IACL,IAAI,QAAgB;AAAE,aAAO,IAAI;AAAA,IAAM;AAAA,IACvC,IAAI,UAAmB;AAAE,aAAO,IAAI;AAAA,IAAQ;AAAA,IAC5C,IAAI,aAAa;AAAE,aAAO,IAAI;AAAA,IAA2C;AAAA,IACzE,IAAI,iBAAyB;AAAE,aAAO,IAAI;AAAA,IAAe;AAAA,IACzD,YAAY;AAAA,IACZ,IAAI,OAAO,OAA4B;AAAE,UAAI,SAAS;AAAA,IAAM;AAAA,IAC5D,IAAI,SAA8B;AAAE,aAAO,IAAI;AAAA,IAAO;AAAA,IACtD,IAAI,UAAU,OAAiE;AAC7E,UAAI,YAAY,UAAU,OAAO,OAAO,WAAS,MAAM,EAAE,MAAMC,eAAc,MAAM,IAAI,EAAE,CAAC;AAAA,IAC5F;AAAA,IACA,IAAI,YAAsE;AAAE,aAAO;AAAA,IAAK;AAAA,IACxF,IAAI,QAAQ,OAA4B;AAAE,UAAI,UAAU;AAAA,IAAM;AAAA,IAC9D,IAAI,UAA+B;AAAE,aAAO,IAAI;AAAA,IAAQ;AAAA,IACxD,IAAI,QAAQ,OAA4B;AAAE,UAAI,UAAU;AAAA,IAAM;AAAA,IAC9D,IAAI,UAA+B;AAAE,aAAO,IAAI;AAAA,IAAQ;AAAA,IACxD,qBAAqB;AAAA,IACrB,KAAK,MAA4B;AAC/B,YAAM,QAAQ,OAAO,SAAS,WAAW,OAAO,WAAW,IAAI,IAAI,KAAK;AACxE,UAAI;AACF,YAAI,KAAK,OAAO,SAAS,WAAW,OAAO,OAAO,KAAK,IAAI,CAAC;AAAA,MAC9D,SAAS,OAAO;AACd,gBAAQ,MAAM,+BAA+B,OAAO,iBAAiB,QAAQ,MAAM,UAAU,KAAK;AAClG,cAAM;AAAA,MACR;AAAA,IACF;AAAA,IACA,QAAQ;AAAE,UAAI,MAAM;AAAA,IAAE;AAAA,EACxB;AACF;AAEA,SAASA,eAAc,MAAiD;AACtE,MAAI,OAAO,SAAS,SAAU,QAAO;AAIrC,SAAO,KAAK,OAAO,MAAM,KAAK,YAAY,KAAK,aAAa,KAAK,UAAU;AAC7E;AAYA,SAAS,iBAAqC;AAC5C,QAAM,YAAsB,CAAC;AAC7B,QAAM,WAAqB,CAAC;AAC5B,aAAW,CAACC,OAAM,SAAS,KAAK,OAAO,QAAQ,kBAAkB,CAAC,GAAG;AACnE,QAAI,mBAAmBA,KAAI,EAAG;AAC9B,eAAW,WAAW,aAAa,CAAC,GAAG;AACrC,UAAI,QAAQ,YAAY,QAAQ,WAAW,OAAQ;AACnD,YAAM,KAAK,QAAQ;AACnB,UAAI,GAAG,WAAW,MAAM,KAAK,GAAG,WAAW,UAAU,KAAK,QAAQ,EAAE,EAAG;AACvE,UAAI,UAAU,EAAE,EAAG,WAAU,KAAK,EAAE;AAAA,UAC/B,UAAS,KAAK,EAAE;AAAA,IACvB;AAAA,EACF;AACA,SAAO,UAAU,CAAC,KAAK,SAAS,CAAC;AACnC;AAEA,SAAS,mBAAmBA,OAAuB;AACjD,SAAO,6DAA6D,KAAKA,KAAI;AAC/E;AAEA,SAAS,QAAQ,IAAqB;AACpC,QAAM,QAAQ,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AACtC,SAAO,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK;AACjF;AAEA,SAAS,UAAU,IAAqB;AACtC,QAAM,QAAQ,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM;AACtC,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,MAAI,MAAM,CAAC,MAAM,GAAI,QAAO;AAC5B,MAAI,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,IAAK,QAAO;AACjD,SAAO,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK;AAC3D;;;AC1LO,IAAM,oBAAN,MAAwB;AAAA,EAO7B,YACmB,QACA,YACjB,UACiB,QACjB,eACA;AALiB;AACA;AAEA;AAGjB,SAAK,cAAc,IAAI,qBAAqB,KAAK,YAAY,CAAC,UAAU,SAAS;AAC/E,YAAM,aAAa,IAAI;AAAA,QACrB;AAAA,QACA,CAAC,OAAO,SAAS,KAAK,YAAY,OAAO,IAAI,CAAC;AAAA,QAC9C;AAAA,QACA,KAAK;AAAA,QACL,gBAAgB;AAAA,MAClB;AACA,aAAO,IAAI,UAAU,YAAY,QAAW,KAAK,MAAM;AAAA,IACzD,GAAG,KAAK,MAAM;AACd,QAAI,OAAO,cAAc,QAAW;AAClC,WAAK,YAAY,IAAI,cAAc,OAAO,WAAW,IAAI,sBAAsB,WAAW,SAAS,CAAC;AAAA,IACtG;AAAA,EACF;AAAA,EA1BS;AAAA,EACD;AAAA,EACS;AAAA,EACT;AAAA,EACA,SAAS;AAAA,EAwBjB,MAAM,QAAuB;AAC3B,QAAI,KAAK,OAAQ,OAAM,IAAI,MAAM,0BAA0B;AAC3D,SAAK,WAAW,MAAM,KAAK,WAAW,aAAa,KAAK,OAAO,UAAU;AACzE,SAAK,OAAO,KAAK,uBAAuB;AAAA,MACtC,UAAUC,SAAQ,KAAK,SAAS,QAAQ;AAAA,MACxC,aAAa,KAAK,SAAS;AAAA,MAC3B,QAAQ,KAAK,OAAO,aAAa;AAAA,IACnC,CAAC;AACD,QAAI,KAAK,cAAc,QAAW;AAChC,WAAK,UAAU,aAAa,KAAK,QAAQ;AACzC,WAAK,mBAAmB,KAAK,uBAAuB,KAAK,QAAQ;AACjE,WAAK,iBAAiB,MAAM;AAAA,IAC9B;AAAA,EACF;AAAA,EAEA,kBAAgC;AAC9B,QAAI,KAAK,aAAa,OAAW,OAAM,IAAI,MAAM,gCAAgC;AACjF,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,wBAAwB,SAAkD;AACxE,SAAK,gBAAgB;AACrB,WAAO,KAAK,YAAY,OAAO,OAAO;AAAA,EACxC;AAAA,EAEA,aAA+B;AAC7B,UAAM,QAAQ,KAAK,kBAAkB,UAAU;AAC/C,UAAM,gBAAgB,KAAK,WAAW,qBAAqB;AAC3D,WAAO;AAAA,MACL,GAAI,KAAK,aAAa,SAAY,CAAC,IAAI,EAAE,UAAU,KAAK,SAAS,SAAS;AAAA,MAC1E,YAAY,KAAK,cAAc;AAAA,MAC/B,QAAQ,KAAK,kBAAkB,SAAS,KAAK;AAAA,MAC7C,cAAc,KAAK,kBAAkB,eAAe,KAAK;AAAA,MACzD,GAAI,KAAK,kBAAkB,aAAa,MAAM,SAC1C,CAAC,IACD,EAAE,cAAc,KAAK,iBAAiB,aAAa,EAAE;AAAA,MACzD,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,MACvC,GAAI,eAAe,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,cAAc,QAAQ;AAAA,MACjF,YAAY,kBAAkB;AAAA,MAC9B,iBAAiB,UAAU,2BAA2B,UAAU,kBAAkB,UAAU;AAAA,IAC9F;AAAA,EACF;AAAA,EAEA,gBAAsB;AACpB,QAAI,KAAK,OAAQ,OAAM,IAAI,MAAM,0BAA0B;AAC3D,QAAI,KAAK,qBAAqB,QAAW;AACvC,YAAM,IAAI,eAAe,yBAAyB,4CAA4C,KAAK;AAAA,IACrG;AACA,SAAK,iBAAiB,UAAU;AAAA,EAClC;AAAA,EAEA,MAAM,yBAAwC;AAC5C,UAAM,KAAK,kBAAkB,KAAK;AAClC,UAAM,KAAK,WAAW,oBAAoB;AAC1C,SAAK,WAAW,MAAM,KAAK,WAAW,MAAM,KAAK,OAAO,UAAU;AAClE,SAAK,WAAW,aAAa,KAAK,QAAQ;AAC1C,QAAI,KAAK,cAAc,OAAW,MAAK,mBAAmB,KAAK,uBAAuB,KAAK,QAAQ;AACnG,SAAK,OAAO,KAAK,4BAA4B;AAAA,EAC/C;AAAA,EAEA,MAAM,qBAAqB,aAAqB,SAAgD;AAC9F,QAAI,KAAK,cAAc,QAAW;AAChC,YAAM,IAAI,eAAe,yBAAyB,oDAAoD,KAAK;AAAA,IAC7G;AACA,QAAI;AACJ,QAAI;AACF,eAAS,MAAM,KAAK,UAAU,mBAAmB,KAAK,gBAAgB,GAAG,aAAa,OAAO;AAAA,IAC/F,SAAS,OAAO;AACd,UAAI,EAAE,iBAAiB,mBAAmB,MAAM,SAAS,iBAAkB,OAAM;AACjF,YAAM,KAAK,kBAAkB,KAAK;AAClC,WAAK,WAAW,MAAM,KAAK,WAAW,MAAM,KAAK,OAAO,UAAU;AAClE,WAAK,UAAU,aAAa,KAAK,QAAQ;AACzC,WAAK,mBAAmB,KAAK,uBAAuB,KAAK,QAAQ;AACjE,eAAS,MAAM,KAAK,UAAU,mBAAmB,KAAK,UAAU,aAAa,OAAO;AACpF,WAAK,OAAO,KAAK,iEAAiE;AAAA,IACpF;AACA,SAAK,kBAAkB,OAAO;AAC9B,SAAK,OAAO,KAAK,oCAAoC;AACrD,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,yBAAyB,OAAe,UAAgD;AAC5F,QAAI,KAAK,cAAc,QAAW;AAChC,YAAM,IAAI,eAAe,yBAAyB,0CAA0C,KAAK;AAAA,IACnG;AACA,UAAM,SAAS,MAAM,KAAK,UAAU,qBAAqB,KAAK,gBAAgB,GAAG,OAAO,QAAQ;AAChG,SAAK,kBAAkB,OAAO;AAC9B,SAAK,OAAO,KAAK,yBAAyB;AAC1C,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,sBAAsB,MAA4C;AACtE,QAAI,KAAK,cAAc,QAAW;AAChC,YAAM,IAAI,eAAe,yBAAyB,iEAAiE,KAAK;AAAA,IAC1H;AACA,UAAM,SAAS,MAAM,KAAK,UAAU,sBAAsB,KAAK,gBAAgB,GAAG,IAAI;AACtF,SAAK,kBAAkB,OAAO;AAC9B,SAAK,OAAO,KAAK,mCAAmC;AACpD,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,WAAW,UAAoC;AACnD,UAAM,UAAU,MAAM,KAAK,WAAW,WAAW,QAAQ;AACzD,QAAI,QAAS,OAAM,KAAK,YAAY,OAAO,QAAQ;AACnD,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,QAAuB;AAC3B,QAAI,KAAK,OAAQ;AACjB,SAAK,SAAS;AACd,UAAM,KAAK,kBAAkB,KAAK;AAClC,UAAM,KAAK,YAAY,MAAM;AAC7B,SAAK,OAAO,KAAK,sBAAsB;AAAA,EACzC;AAAA,EAEA,cAAc;AACZ,WAAO;AAAA,MACL,QAAQ,KAAK,aAAa;AAAA,MAC1B,UAAU,KAAK,aAAa,SAAY,SAAYA,SAAQ,KAAK,SAAS,QAAQ;AAAA,MAClF,eAAe,KAAK,aAAa;AAAA,MACjC,kBAAkB,KAAK,OAAO,cAAc;AAAA,MAC5C,cAAc,KAAK,kBAAkB,SAAS,KAAK;AAAA,MACnD,aAAa,KAAK,kBAAkB,UAAU;AAAA,MAC9C,QAAQ,KAAK,YAAY,SAAS;AAAA,MAClC,mBAAmB,KAAK,YAAY,gBAAgB;AAAA,MACpD,cAAc,KAAK,YAAY,aAAa,MAAM,SAAY,SAAYA,SAAQ,KAAK,YAAY,aAAa,CAAE;AAAA,MAClH,eAAe,KAAK,YAAY,cAAc,EAAE,IAAIA,QAAO;AAAA,MAC3D,cAAc,KAAK,WAAW,iBAAiB,EAAE;AAAA,IACnD;AAAA,EACF;AAAA,EAEQ,uBAAuB,UAA8C;AAC3E,WAAO,IAAI;AAAA,MACT,KAAK;AAAA,MACL;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA,KAAK,OAAO,aAAa,SAAY;AAAA,IACvC;AAAA,EACF;AACF;AAEA,SAASA,SAAQ,OAAuB;AAAE,SAAO,MAAM,UAAU,KAAK,QAAQ,GAAG,MAAM,MAAM,GAAG,CAAC,CAAC,SAAI,MAAM,MAAM,EAAE,CAAC;AAAG;;;AhFlLjH,IAAM,OAAO;AAGb,SAAS,MAAM,KAAc,QAAqB,CAAC,GAAS;AACjE,MAAI,OAAO,CAAC,YAAY,YAAY,cAAc,eAAe,GAAG,oBAAkB,SAAS,gBAAgB,KAAK,CAAC;AACvH;AAEA,eAAe,SAAS,KAAc,OAAmC;AACvE,QAAM,WAAW,IAAI,IAAI,UAAU;AACnC,QAAM,gBAAwD,UAAU,SAAS,kBAAkB,YAAY,GAAG,QAAQ;AAAA,IACxH,MAAM;AAAA,IACN,SAAS;AAAA,IACT,UAAU,WAAS;AAAE,oBAAc,KAAK;AAAA,IAAE;AAAA,EAC5C,CAAC;AACD,QAAM,SAAyB,cAAc,eAAe,IAAI,KAAK,KAAK;AAC1E,MAAI,CAAC,OAAO,QAAS;AAIrB,QAAM,SAAS,IAAI,WAAW;AAAA,IAC5B,OAAO,aAAW;AAAE,UAAI,OAAO,MAAM,OAAO;AAAG,cAAQ,MAAM,OAAO;AAAA,IAAE;AAAA,IACtE,MAAM,aAAW;AAAE,UAAI,OAAO,KAAK,OAAO;AAAG,cAAQ,KAAK,OAAO;AAAA,IAAE;AAAA,IACnE,MAAM,aAAW;AAAE,UAAI,OAAO,KAAK,OAAO;AAAG,cAAQ,KAAK,OAAO;AAAA,IAAE;AAAA,IACnE,OAAO,aAAW;AAAE,UAAI,OAAO,MAAM,OAAO;AAAG,cAAQ,MAAM,OAAO;AAAA,IAAE;AAAA,EACxE,GAAG,OAAO,QAAQ;AAClB,QAAM,2BAA2B,IAAI,cAAc,EAAE;AACrD,QAAM,iBAAiB,IAAI,cAAc;AAAA,IACvC,WAAW,OAAO,cAAc,SAC5B,2BACA,uBAAuB,0BAA0B,OAAO,WAAW,MAAM;AAAA,EAC/E,CAAC;AACD,QAAM,WAAW,IAAI,IAAI,UAAU;AACnC,QAAM,aAAa,IAAI,IAAI,YAAY;AAIvC,QAAM,sBAAsB,IAAI,IAAI,eAAe;AACnD,QAAM,qBAAqB,IAAI,oBAAoB,mBAAmB,EAAE,MAAM;AAC9E,QAAM,UAAU,IAAI,kBAAkB,QAAQ,gBAAgB,UAAU,QAAQ,MAAM,kBAAkB;AAExG,MAAI;AACJ,QAAM,cAAc;AACpB,MAAI,OAAO,cAAc,UAAa,aAAa,UAAa,eAAe,QAAW;AACxF,UAAM,mBAAmB,IAAI,cAAc;AAAA,MACzC,WAAW,uBAAuB,0BAA0B,OAAO,WAAW,QAAQ;AAAA,IACxF,CAAC;AACD,oBAAgB,IAAI;AAAA,MAClB;AAAA,MACA;AAAA,MACA,IAAI,gBAAgB,OAAO,WAAW,IAAI,sBAAsB,iBAAiB,SAAS,CAAC;AAAA,MAC3F;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,iBAAiB,eAAe,SAClC,SACA,IAAI,qBAAqB,QAAQ,0BAA0B,eAAe,eAAe,WAAW;AAExG,MAAI,QAAQ,aAAa,OAAO;AAChC,MAAI,kBAAkB,OAAW,KAAI,QAAQ,mBAAmB,aAAa;AAC7E,QAAM,IAAI,OAAO,YAAY;AAC3B,UAAM,iBAAiB,gBAAgB,SAAS,UAAW;AAC3D,QAAI;AACF,YAAM,QAAQ,MAAM;AACpB,UAAI,kBAAkB,QAAW;AAC/B,cAAM,cAAc,MAAM;AAAA,MAC5B,OAAO;AACL,eAAO,KAAK,qCAAqC;AAAA,UAC/C,kBAAkB,OAAO,cAAc;AAAA,UACvC,mBAAmB,aAAa;AAAA,UAChC,qBAAqB,eAAe;AAAA,QACtC,CAAC;AAAA,MACH;AAAA,IACF,SAAS,OAAO;AACd,YAAM,iBAAiB;AACvB,YAAM,eAAe,MAAM;AAC3B,YAAM,QAAQ,MAAM;AACpB,YAAM;AAAA,IACR;AACA,WAAO,YAAY;AACjB,YAAM,iBAAiB;AACvB,YAAM,eAAe,MAAM;AAC3B,YAAM,QAAQ,MAAM;AAAA,IACtB;AAAA,EACF,GAAG,sBAAsB;AAC3B;",
+  "names": ["util", "objectUtil", "s", "errorUtil", "errorMap", "ctx", "result", "issues", "elements", "processed", "result", "r", "ZodFirstPartyTypeKind", "resolve", "pending", "resolve", "resolve", "nc", "crypto", "randomBytes", "crypto", "isLE", "_32n", "isLE", "s", "_0n", "_1n", "_0n", "_1n", "Fp", "Fp", "_1n", "isLE", "_0n", "_1n", "_0n", "_1n", "s", "wbits", "isLE", "_0n", "Fp", "Fn", "_0n", "_1n", "_2n", "_8n", "Fp", "Fn", "uvRatio", "isValid", "p", "randomBytes", "adjustScalarBytes", "secretKey", "s", "eddsa", "_0n", "_1n", "_2n", "adjustScalarBytes", "randomBytes", "cswap", "secretKey", "_0n", "_1n", "_2n", "_3n", "_5n", "_8n", "pow", "_3n", "_1n", "mod", "s", "s2", "isValid", "_0n", "name", "U32_MASK64", "_32n", "fromBig", "split", "isLE", "shrSH", "s", "shrSL", "rotrSH", "rotrSL", "rotrBH", "rotrBL", "add", "add3L", "add3H", "add4L", "add4H", "add5L", "add5H", "isBytes", "anumber", "abytes", "isBytes", "anumber", "copyBytes", "aexists", "aoutput", "clean", "createView", "rotr", "hasHexBuiltin", "hexes", "bytesToHex", "abytes", "asciiToBase16", "hexToBytes", "concatBytes", "abytes", "createHasher", "randomBytes", "anumber", "Chi", "Maj", "HashMD", "isLE", "createView", "aexists", "abytes", "aoutput", "SHA256_IV", "SHA512_IV", "HashMD", "rotr", "Chi", "Maj", "clean", "SHA256_IV", "K512", "split", "SHA512_Kh", "SHA512_Kl", "SHA512_W_H", "SHA512_W_L", "HashMD", "rotrSH", "shrSH", "rotrSL", "shrSL", "rotrBH", "rotrBL", "add4L", "add4H", "add5L", "add5H", "add", "add3L", "add3H", "clean", "SHA512_IV", "createHasher", "sha512", "createHasher", "abytes", "anumber", "aobject", "bytesToHex", "hexToBytes", "isBytes", "randomBytes", "_0n", "_1n", "atitle", "isPosBig", "anumber", "hexToNumber", "_0n", "bytesToNumberBE", "bytesToHex", "bytesToNumberLE", "copyBytes", "abytes", "numberToBytesBE", "anumber", "hexToBytes", "numberToBytesLE", "copyBytes", "abytes", "isPosBig", "_0n", "inRange", "aInRange", "bitLen", "bitMask", "_1n", "validateObject", "aobject", "_0n", "_1n", "_2n", "_3n", "_4n", "_5n", "_7n", "_8n", "_9n", "_16n", "mod", "p", "pow2", "invert", "assertIsSquare", "Fp", "_1n", "_0n", "sqrt3mod4", "_4n", "sqrt5mod8", "_5n", "_8n", "_2n", "sqrt9mod16", "Field", "tonelliShanks", "_7n", "_16n", "_3n", "FpLegendre", "FpSqrt", "_9n", "isNegativeLE", "mod", "FIELD_FIELDS", "validateField", "aobject", "name", "FpInvertBatch", "Fp", "validateField", "FpLegendre", "Fp", "validateField", "_1n", "_2n", "nLength", "anumber", "_0n", "bitLen", "_1n", "mod", "invert", "FpSqrt", "numberToBytesLE", "numberToBytesBE", "abytes", "isLE", "bytesToNumberLE", "bytesToNumberBE", "FpInvertBatch", "Field", "_0n", "_1n", "_4n", "aobject", "validateField", "normalizeZ", "validateMSMPoints", "FpInvertBatch", "validateW", "randomBytes", "isBytes", "validateMSMScalars", "s", "ok", "isPosBig", "pointWindowSizes", "inRange", "bytesToNumberBE", "bitMask", "createField", "isLE", "validateField", "Field", "validateObject", "isPosBig", "_0n", "Fp", "Fn", "secretKey", "_0n", "_1n", "_2n", "_4n", "_8n", "isEdValidXY", "Fp", "edwards", "validateObject", "Fn", "FpLegendre", "randomBytes", "uvRatio", "aInRange", "copyBytes", "abytes", "bytesToNumberLE", "isValid", "hexToBytes", "bytesToHex", "normalizeZ", "_0n", "_1n", "_2n", "validateOpts", "validateObject", "montgomery", "adjustScalarBytes", "randomBytes", "_2n", "_1n", "mod", "numberToBytesLE", "copyBytes", "abytes", "bytesToNumberLE", "_0n", "aInRange", "mask", "_0n", "_1n", "_2n", "_3n", "_5n", "_8n", "ed25519_CURVE_p", "ed25519_CURVE", "ed25519_pow_2_252_3", "pow2", "adjustScalarBytes", "ED25519_SQRT_M1", "uvRatio", "mod", "pow", "isNegativeLE", "edwards", "x25519", "ed25519_CURVE_p", "ed25519_pow_2_252_3", "mod", "pow2", "_3n", "montgomery", "adjustScalarBytes", "_0n", "x25519", "PK", "name", "s", "rotr", "add3L", "add3H", "add", "rotrSH", "rotrSL", "rotrBH", "rotrBL", "anumber", "abytes", "aexists", "aoutput", "copyBytes", "clean", "s", "createHasher", "SHA256_IV", "abytes", "clean", "aexists", "aoutput", "name", "concatBytes", "sha512", "isBytes", "atitle", "abool", "anumber", "abytes", "aobject", "aexists", "aoutput", "u32", "clean", "createView", "isLE", "byteSwap", "byteSwap32", "byteSwap", "swap32IfBE", "isLE", "checkOpts", "aobject", "equalBytes", "abytes", "isBytes", "isLE", "anumber", "abool", "createView", "copyBytes", "swap32IfBE", "u32", "isLE", "checkOpts", "anumber", "abool", "abytes", "copyBytes", "clean", "nc", "copyBytes", "abytes", "clean", "aexists", "aoutput", "s", "abytes", "clean", "equalBytes", "U64_MAX", "U64_MAX", "name", "fromBase64Url", "toBase64Url", "toBase64Url", "fromBase64Url", "resolve", "randomBytes", "resolve", "fromBase64Url", "toBase64Url", "name", "previous", "hostname", "record", "fromBase64Url", "chmod", "mkdir", "readFile", "rename", "rm", "stat", "writeFile", "dirname", "join", "join", "exists", "assertPrivateMode", "readFile", "record", "rm", "mkdir", "dirname", "writeFile", "chmod", "rename", "stat", "ok", "record", "fail", "hostname", "connection", "shortId", "diagnosticReason", "websocketUrl", "resolve", "shortId", "diagnosticReason", "asError", "fromBase64Url", "toBase64Url", "stat", "homedir", "platform", "dirname", "diagnosticReason", "shortId", "implementation", "resolve", "adaptDataChannel", "toArrayBuffer", "name", "shortId"]
+}