@capxul/cli 4.20.0-beta.3 → 4.20.0-beta.30

package/dist/record-U7Yu4KQP.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"record-U7Yu4KQP.mjs","names":["encoder","size_","size","toBytes"],"sources":["../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/errors/version.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/errors/base.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/errors/encoding.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/data/isHex.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/data/size.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/data/trim.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/errors/data.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/data/pad.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/encoding/toHex.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/encoding/toBytes.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/encoding/fromHex.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/data/concat.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/errors/cursor.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/cursor.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/encoding/toRlp.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/unit/Value.js","../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/_u64.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/errors/address.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/lru.js","../../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/sha3.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/hash/keccak256.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/address/getAddress.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/address/isAddress.js","../../../node_modules/.pnpm/viem@2.55.18_@typescript+typescript6@6.0.2_zod@4.6.5/node_modules/viem/_esm/utils/data/slice.js","../../../packages/protocol/src/primitives/record.ts"],"sourcesContent":["export const version = '2.55.18';\n//# sourceMappingURL=version.js.map","import { version } from './version.js';\nlet errorConfig = {\n    getDocsUrl: ({ docsBaseUrl, docsPath = '', docsSlug, }) => docsPath\n        ? `${docsBaseUrl ?? 'https://viem.sh'}${docsPath}${docsSlug ? `#${docsSlug}` : ''}`\n        : undefined,\n    version: `viem@${version}`,\n};\nexport function setErrorConfig(config) {\n    errorConfig = config;\n}\nexport class BaseError extends Error {\n    constructor(shortMessage, args = {}) {\n        const details = (() => {\n            if (args.cause instanceof BaseError)\n                return args.cause.details;\n            if (args.cause?.message)\n                return args.cause.message;\n            return args.details;\n        })();\n        const docsPath = (() => {\n            if (args.cause instanceof BaseError)\n                return args.cause.docsPath || args.docsPath;\n            return args.docsPath;\n        })();\n        const docsUrl = errorConfig.getDocsUrl?.({ ...args, docsPath });\n        const message = [\n            shortMessage || 'An error occurred.',\n            '',\n            ...(args.metaMessages ? [...args.metaMessages, ''] : []),\n            ...(docsUrl ? [`Docs: ${docsUrl}`] : []),\n            ...(details ? [`Details: ${details}`] : []),\n            ...(errorConfig.version ? [`Version: ${errorConfig.version}`] : []),\n        ].join('\\n');\n        super(message, args.cause ? { cause: args.cause } : undefined);\n        Object.defineProperty(this, \"details\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: void 0\n        });\n        Object.defineProperty(this, \"docsPath\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: void 0\n        });\n        Object.defineProperty(this, \"metaMessages\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: void 0\n        });\n        Object.defineProperty(this, \"shortMessage\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: void 0\n        });\n        Object.defineProperty(this, \"version\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: void 0\n        });\n        Object.defineProperty(this, \"name\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: 'BaseError'\n        });\n        this.details = details;\n        this.docsPath = docsPath;\n        this.metaMessages = args.metaMessages;\n        this.name = args.name ?? this.name;\n        this.shortMessage = shortMessage;\n        this.version = version;\n    }\n    walk(fn) {\n        return walk(this, fn);\n    }\n}\nfunction walk(err, fn) {\n    if (fn?.(err))\n        return err;\n    if (err &&\n        typeof err === 'object' &&\n        'cause' in err &&\n        err.cause !== undefined)\n        return walk(err.cause, fn);\n    return fn ? null : err;\n}\n//# sourceMappingURL=base.js.map","import { BaseError } from './base.js';\nexport class IntegerOutOfRangeError extends BaseError {\n    constructor({ max, min, signed, size, value, }) {\n        super(`Number \"${value}\" is not in safe ${size ? `${size * 8}-bit ${signed ? 'signed' : 'unsigned'} ` : ''}integer range ${max ? `(${min} to ${max})` : `(above ${min})`}`, { name: 'IntegerOutOfRangeError' });\n    }\n}\nexport class InvalidBytesBooleanError extends BaseError {\n    constructor(bytes) {\n        super(`Bytes value \"${bytes}\" is not a valid boolean. The bytes array must contain a single byte of either a 0 or 1 value.`, {\n            name: 'InvalidBytesBooleanError',\n        });\n    }\n}\nexport class InvalidHexBooleanError extends BaseError {\n    constructor(hex) {\n        super(`Hex value \"${hex}\" is not a valid boolean. The hex value must be \"0x0\" (false) or \"0x1\" (true).`, { name: 'InvalidHexBooleanError' });\n    }\n}\nexport class InvalidHexValueError extends BaseError {\n    constructor(value) {\n        super(`Hex value \"${value}\" is an odd length (${value.length}). It must be an even length.`, { name: 'InvalidHexValueError' });\n    }\n}\nexport class RlpDepthLimitExceededError extends BaseError {\n    constructor({ limit }) {\n        super(`RLP depth limit of \\`${limit}\\` exceeded.`, {\n            name: 'RlpDepthLimitExceededError',\n        });\n    }\n}\nexport class RlpListBoundaryExceededError extends BaseError {\n    constructor({ consumed, declared }) {\n        super(`RLP list items consumed \\`${consumed}\\` bytes but the list declared a length of \\`${declared}\\`.`, { name: 'RlpListBoundaryExceededError' });\n    }\n}\nexport class RlpTrailingBytesError extends BaseError {\n    constructor({ count }) {\n        super(`RLP payload encodes a single item, but \\`${count}\\` trailing ${count === 1 ? 'byte remains' : 'bytes remain'}.`, { name: 'RlpTrailingBytesError' });\n    }\n}\nexport class SizeOverflowError extends BaseError {\n    constructor({ givenSize, maxSize }) {\n        super(`Size cannot exceed ${maxSize} bytes. Given size: ${givenSize} bytes.`, { name: 'SizeOverflowError' });\n    }\n}\n//# sourceMappingURL=encoding.js.map","export function isHex(value, { strict = true } = {}) {\n    if (!value)\n        return false;\n    if (typeof value !== 'string')\n        return false;\n    return strict ? /^0x[0-9a-fA-F]*$/.test(value) : value.startsWith('0x');\n}\n//# sourceMappingURL=isHex.js.map","import { isHex } from './isHex.js';\n/**\n * @description Retrieves the size of the value (in bytes).\n *\n * @param value The value (hex or byte array) to retrieve the size of.\n * @returns The size of the value (in bytes).\n */\nexport function size(value) {\n    if (isHex(value, { strict: false }))\n        return Math.ceil((value.length - 2) / 2);\n    return value.length;\n}\n//# sourceMappingURL=size.js.map","export function trim(hexOrBytes, { dir = 'left' } = {}) {\n    let data = typeof hexOrBytes === 'string' ? hexOrBytes.replace('0x', '') : hexOrBytes;\n    let sliceLength = 0;\n    for (let i = 0; i < data.length - 1; i++) {\n        if (data[dir === 'left' ? i : data.length - i - 1].toString() === '0')\n            sliceLength++;\n        else\n            break;\n    }\n    data =\n        dir === 'left'\n            ? data.slice(sliceLength)\n            : data.slice(0, data.length - sliceLength);\n    if (typeof hexOrBytes === 'string') {\n        if (data.length === 1 && dir === 'right')\n            data = `${data}0`;\n        return `0x${data.length % 2 === 1 ? `0${data}` : data}`;\n    }\n    return data;\n}\n//# sourceMappingURL=trim.js.map","import { BaseError } from './base.js';\nexport class SliceOffsetOutOfBoundsError extends BaseError {\n    constructor({ offset, position, size, }) {\n        super(`Slice ${position === 'start' ? 'starting' : 'ending'} at offset \"${offset}\" is out-of-bounds (size: ${size}).`, { name: 'SliceOffsetOutOfBoundsError' });\n    }\n}\nexport class SizeExceedsPaddingSizeError extends BaseError {\n    constructor({ size, targetSize, type, }) {\n        super(`${type.charAt(0).toUpperCase()}${type\n            .slice(1)\n            .toLowerCase()} size (${size}) exceeds padding size (${targetSize}).`, { name: 'SizeExceedsPaddingSizeError' });\n    }\n}\nexport class InvalidBytesLengthError extends BaseError {\n    constructor({ size, targetSize, type, }) {\n        super(`${type.charAt(0).toUpperCase()}${type\n            .slice(1)\n            .toLowerCase()} is expected to be ${targetSize} ${type} long, but is ${size} ${type} long.`, { name: 'InvalidBytesLengthError' });\n    }\n}\n//# sourceMappingURL=data.js.map","import { SizeExceedsPaddingSizeError, } from '../../errors/data.js';\nexport function pad(hexOrBytes, { dir, size = 32 } = {}) {\n    if (typeof hexOrBytes === 'string')\n        return padHex(hexOrBytes, { dir, size });\n    return padBytes(hexOrBytes, { dir, size });\n}\nexport function padHex(hex_, { dir, size = 32 } = {}) {\n    if (size === null)\n        return hex_;\n    const hex = hex_.replace('0x', '');\n    if (hex.length > size * 2)\n        throw new SizeExceedsPaddingSizeError({\n            size: Math.ceil(hex.length / 2),\n            targetSize: size,\n            type: 'hex',\n        });\n    return `0x${hex[dir === 'right' ? 'padEnd' : 'padStart'](size * 2, '0')}`;\n}\nexport function padBytes(bytes, { dir, size = 32 } = {}) {\n    if (size === null)\n        return bytes;\n    if (bytes.length > size)\n        throw new SizeExceedsPaddingSizeError({\n            size: bytes.length,\n            targetSize: size,\n            type: 'bytes',\n        });\n    const paddedBytes = new Uint8Array(size);\n    for (let i = 0; i < size; i++) {\n        const padEnd = dir === 'right';\n        paddedBytes[padEnd ? i : size - i - 1] =\n            bytes[padEnd ? i : bytes.length - i - 1];\n    }\n    return paddedBytes;\n}\n//# sourceMappingURL=pad.js.map","import { IntegerOutOfRangeError, } from '../../errors/encoding.js';\nimport { pad } from '../data/pad.js';\nimport { assertSize } from './fromHex.js';\nconst hexes = /*#__PURE__*/ Array.from({ length: 256 }, (_v, i) => i.toString(16).padStart(2, '0'));\n/**\n * Encodes a string, number, bigint, or ByteArray into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex\n * - Example: https://viem.sh/docs/utilities/toHex#usage\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { toHex } from 'viem'\n * const data = toHex('Hello world')\n * // '0x48656c6c6f20776f726c6421'\n *\n * @example\n * import { toHex } from 'viem'\n * const data = toHex(420)\n * // '0x1a4'\n *\n * @example\n * import { toHex } from 'viem'\n * const data = toHex('Hello world', { size: 32 })\n * // '0x48656c6c6f20776f726c64210000000000000000000000000000000000000000'\n */\nexport function toHex(value, opts = {}) {\n    if (typeof value === 'number' || typeof value === 'bigint')\n        return numberToHex(value, opts);\n    if (typeof value === 'string') {\n        return stringToHex(value, opts);\n    }\n    if (typeof value === 'boolean')\n        return boolToHex(value, opts);\n    return bytesToHex(value, opts);\n}\n/**\n * Encodes a boolean into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex#booltohex\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { boolToHex } from 'viem'\n * const data = boolToHex(true)\n * // '0x1'\n *\n * @example\n * import { boolToHex } from 'viem'\n * const data = boolToHex(false)\n * // '0x0'\n *\n * @example\n * import { boolToHex } from 'viem'\n * const data = boolToHex(true, { size: 32 })\n * // '0x0000000000000000000000000000000000000000000000000000000000000001'\n */\nexport function boolToHex(value, opts = {}) {\n    const hex = `0x${Number(value)}`;\n    if (typeof opts.size === 'number') {\n        assertSize(hex, { size: opts.size });\n        return pad(hex, { size: opts.size });\n    }\n    return hex;\n}\n/**\n * Encodes a bytes array into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex#bytestohex\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { bytesToHex } from 'viem'\n * const data = bytesToHex(Uint8Array.from([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33])\n * // '0x48656c6c6f20576f726c6421'\n *\n * @example\n * import { bytesToHex } from 'viem'\n * const data = bytesToHex(Uint8Array.from([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33]), { size: 32 })\n * // '0x48656c6c6f20576f726c64210000000000000000000000000000000000000000'\n */\nexport function bytesToHex(value, opts = {}) {\n    let string = '';\n    for (let i = 0; i < value.length; i++) {\n        string += hexes[value[i]];\n    }\n    const hex = `0x${string}`;\n    if (typeof opts.size === 'number') {\n        assertSize(hex, { size: opts.size });\n        return pad(hex, { dir: 'right', size: opts.size });\n    }\n    return hex;\n}\n/**\n * Encodes a number or bigint into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex#numbertohex\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { numberToHex } from 'viem'\n * const data = numberToHex(420)\n * // '0x1a4'\n *\n * @example\n * import { numberToHex } from 'viem'\n * const data = numberToHex(420, { size: 32 })\n * // '0x00000000000000000000000000000000000000000000000000000000000001a4'\n */\nexport function numberToHex(value_, opts = {}) {\n    const { signed, size } = opts;\n    const value = BigInt(value_);\n    let maxValue;\n    if (size) {\n        if (signed)\n            maxValue = (1n << (BigInt(size) * 8n - 1n)) - 1n;\n        else\n            maxValue = 2n ** (BigInt(size) * 8n) - 1n;\n    }\n    else if (typeof value_ === 'number') {\n        maxValue = BigInt(Number.MAX_SAFE_INTEGER);\n    }\n    const minValue = typeof maxValue === 'bigint' && signed ? -maxValue - 1n : 0;\n    if ((maxValue && value > maxValue) || value < minValue) {\n        const suffix = typeof value_ === 'bigint' ? 'n' : '';\n        throw new IntegerOutOfRangeError({\n            max: maxValue ? `${maxValue}${suffix}` : undefined,\n            min: `${minValue}${suffix}`,\n            signed,\n            size,\n            value: `${value_}${suffix}`,\n        });\n    }\n    const hex = `0x${(signed && value < 0 ? (1n << BigInt(size * 8)) + BigInt(value) : value).toString(16)}`;\n    if (size)\n        return pad(hex, { size });\n    return hex;\n}\nconst encoder = /*#__PURE__*/ new TextEncoder();\n/**\n * Encodes a UTF-8 string into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex#stringtohex\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { stringToHex } from 'viem'\n * const data = stringToHex('Hello World!')\n * // '0x48656c6c6f20576f726c6421'\n *\n * @example\n * import { stringToHex } from 'viem'\n * const data = stringToHex('Hello World!', { size: 32 })\n * // '0x48656c6c6f20576f726c64210000000000000000000000000000000000000000'\n */\nexport function stringToHex(value_, opts = {}) {\n    const value = encoder.encode(value_);\n    return bytesToHex(value, opts);\n}\n//# sourceMappingURL=toHex.js.map","import { BaseError } from '../../errors/base.js';\nimport { isHex } from '../data/isHex.js';\nimport { pad } from '../data/pad.js';\nimport { assertSize } from './fromHex.js';\nimport { numberToHex, } from './toHex.js';\nconst encoder = /*#__PURE__*/ new TextEncoder();\n/**\n * Encodes a UTF-8 string, hex value, bigint, number or boolean to a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes\n * - Example: https://viem.sh/docs/utilities/toBytes#usage\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { toBytes } from 'viem'\n * const data = toBytes('Hello world')\n * // Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33])\n *\n * @example\n * import { toBytes } from 'viem'\n * const data = toBytes(420)\n * // Uint8Array([1, 164])\n *\n * @example\n * import { toBytes } from 'viem'\n * const data = toBytes(420, { size: 4 })\n * // Uint8Array([0, 0, 1, 164])\n */\nexport function toBytes(value, opts = {}) {\n    if (typeof value === 'number' || typeof value === 'bigint')\n        return numberToBytes(value, opts);\n    if (typeof value === 'boolean')\n        return boolToBytes(value, opts);\n    if (isHex(value))\n        return hexToBytes(value, opts);\n    return stringToBytes(value, opts);\n}\n/**\n * Encodes a boolean into a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes#booltobytes\n *\n * @param value Boolean value to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { boolToBytes } from 'viem'\n * const data = boolToBytes(true)\n * // Uint8Array([1])\n *\n * @example\n * import { boolToBytes } from 'viem'\n * const data = boolToBytes(true, { size: 32 })\n * // Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1])\n */\nexport function boolToBytes(value, opts = {}) {\n    const bytes = new Uint8Array(1);\n    bytes[0] = Number(value);\n    if (typeof opts.size === 'number') {\n        assertSize(bytes, { size: opts.size });\n        return pad(bytes, { size: opts.size });\n    }\n    return bytes;\n}\n// We use very optimized technique to convert hex string to byte array\nconst charCodeMap = {\n    zero: 48,\n    nine: 57,\n    A: 65,\n    F: 70,\n    a: 97,\n    f: 102,\n};\nfunction charCodeToBase16(char) {\n    if (char >= charCodeMap.zero && char <= charCodeMap.nine)\n        return char - charCodeMap.zero;\n    if (char >= charCodeMap.A && char <= charCodeMap.F)\n        return char - (charCodeMap.A - 10);\n    if (char >= charCodeMap.a && char <= charCodeMap.f)\n        return char - (charCodeMap.a - 10);\n    return undefined;\n}\n/**\n * Encodes a hex string into a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes#hextobytes\n *\n * @param hex Hex string to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { hexToBytes } from 'viem'\n * const data = hexToBytes('0x48656c6c6f20776f726c6421')\n * // Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33])\n *\n * @example\n * import { hexToBytes } from 'viem'\n * const data = hexToBytes('0x48656c6c6f20776f726c6421', { size: 32 })\n * // Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0])\n */\nexport function hexToBytes(hex_, opts = {}) {\n    let hex = hex_;\n    if (opts.size) {\n        assertSize(hex, { size: opts.size });\n        hex = pad(hex, { dir: 'right', size: opts.size });\n    }\n    let hexString = hex.slice(2);\n    if (hexString.length % 2)\n        hexString = `0${hexString}`;\n    const length = hexString.length / 2;\n    const bytes = new Uint8Array(length);\n    for (let index = 0, j = 0; index < length; index++) {\n        const nibbleLeft = charCodeToBase16(hexString.charCodeAt(j++));\n        const nibbleRight = charCodeToBase16(hexString.charCodeAt(j++));\n        if (nibbleLeft === undefined || nibbleRight === undefined) {\n            throw new BaseError(`Invalid byte sequence (\"${hexString[j - 2]}${hexString[j - 1]}\" in \"${hexString}\").`);\n        }\n        bytes[index] = nibbleLeft * 16 + nibbleRight;\n    }\n    return bytes;\n}\n/**\n * Encodes a number into a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes#numbertobytes\n *\n * @param value Number to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { numberToBytes } from 'viem'\n * const data = numberToBytes(420)\n * // Uint8Array([1, 164])\n *\n * @example\n * import { numberToBytes } from 'viem'\n * const data = numberToBytes(420, { size: 4 })\n * // Uint8Array([0, 0, 1, 164])\n */\nexport function numberToBytes(value, opts) {\n    const hex = numberToHex(value, opts);\n    return hexToBytes(hex);\n}\n/**\n * Encodes a UTF-8 string into a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes#stringtobytes\n *\n * @param value String to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { stringToBytes } from 'viem'\n * const data = stringToBytes('Hello world!')\n * // Uint8Array([72, 101, 108, 108, 111, 32, 119, 111, 114, 108, 100, 33])\n *\n * @example\n * import { stringToBytes } from 'viem'\n * const data = stringToBytes('Hello world!', { size: 32 })\n * // Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0])\n */\nexport function stringToBytes(value, opts = {}) {\n    const bytes = encoder.encode(value);\n    if (typeof opts.size === 'number') {\n        assertSize(bytes, { size: opts.size });\n        return pad(bytes, { dir: 'right', size: opts.size });\n    }\n    return bytes;\n}\n//# sourceMappingURL=toBytes.js.map","import { IntegerOutOfRangeError, InvalidHexBooleanError, SizeOverflowError, } from '../../errors/encoding.js';\nimport { size as size_ } from '../data/size.js';\nimport { trim } from '../data/trim.js';\nimport { hexToBytes } from './toBytes.js';\nexport function assertSize(hexOrBytes, { size }) {\n    if (size_(hexOrBytes) > size)\n        throw new SizeOverflowError({\n            givenSize: size_(hexOrBytes),\n            maxSize: size,\n        });\n}\n/**\n * Decodes a hex string into a string, number, bigint, boolean, or byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex\n * - Example: https://viem.sh/docs/utilities/fromHex#usage\n *\n * @param hex Hex string to decode.\n * @param toOrOpts Type to convert to or options.\n * @returns Decoded value.\n *\n * @example\n * import { fromHex } from 'viem'\n * const data = fromHex('0x1a4', 'number')\n * // 420\n *\n * @example\n * import { fromHex } from 'viem'\n * const data = fromHex('0x48656c6c6f20576f726c6421', 'string')\n * // 'Hello world'\n *\n * @example\n * import { fromHex } from 'viem'\n * const data = fromHex('0x48656c6c6f20576f726c64210000000000000000000000000000000000000000', {\n *   size: 32,\n *   to: 'string'\n * })\n * // 'Hello world'\n */\nexport function fromHex(hex, toOrOpts) {\n    const opts = typeof toOrOpts === 'string' ? { to: toOrOpts } : toOrOpts;\n    const to = opts.to;\n    if (to === 'number')\n        return hexToNumber(hex, opts);\n    if (to === 'bigint')\n        return hexToBigInt(hex, opts);\n    if (to === 'string')\n        return hexToString(hex, opts);\n    if (to === 'boolean')\n        return hexToBool(hex, opts);\n    return hexToBytes(hex, opts);\n}\n/**\n * Decodes a hex value into a bigint.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex#hextobigint\n *\n * @param hex Hex value to decode.\n * @param opts Options.\n * @returns BigInt value.\n *\n * @example\n * import { hexToBigInt } from 'viem'\n * const data = hexToBigInt('0x1a4', { signed: true })\n * // 420n\n *\n * @example\n * import { hexToBigInt } from 'viem'\n * const data = hexToBigInt('0x00000000000000000000000000000000000000000000000000000000000001a4', { size: 32 })\n * // 420n\n */\nexport function hexToBigInt(hex, opts = {}) {\n    const { signed } = opts;\n    if (opts.size)\n        assertSize(hex, { size: opts.size });\n    const value = BigInt(hex);\n    if (!signed)\n        return value;\n    const size = (hex.length - 2) / 2;\n    const max = (1n << (BigInt(size) * 8n - 1n)) - 1n;\n    if (value <= max)\n        return value;\n    return value - BigInt(`0x${'f'.padStart(size * 2, 'f')}`) - 1n;\n}\n/**\n * Decodes a hex value into a boolean.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex#hextobool\n *\n * @param hex Hex value to decode.\n * @param opts Options.\n * @returns Boolean value.\n *\n * @example\n * import { hexToBool } from 'viem'\n * const data = hexToBool('0x01')\n * // true\n *\n * @example\n * import { hexToBool } from 'viem'\n * const data = hexToBool('0x0000000000000000000000000000000000000000000000000000000000000001', { size: 32 })\n * // true\n */\nexport function hexToBool(hex_, opts = {}) {\n    let hex = hex_;\n    if (opts.size) {\n        assertSize(hex, { size: opts.size });\n        hex = trim(hex);\n    }\n    if (trim(hex) === '0x00')\n        return false;\n    if (trim(hex) === '0x01')\n        return true;\n    throw new InvalidHexBooleanError(hex);\n}\n/**\n * Decodes a hex string into a number.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex#hextonumber\n *\n * @param hex Hex value to decode.\n * @param opts Options.\n * @returns Number value.\n *\n * @example\n * import { hexToNumber } from 'viem'\n * const data = hexToNumber('0x1a4')\n * // 420\n *\n * @example\n * import { hexToNumber } from 'viem'\n * const data = hexToNumber('0x00000000000000000000000000000000000000000000000000000000000001a4', { size: 32 })\n * // 420\n */\nexport function hexToNumber(hex, opts = {}) {\n    const value = hexToBigInt(hex, opts);\n    const number = Number(value);\n    if (!Number.isSafeInteger(number))\n        throw new IntegerOutOfRangeError({\n            max: `${Number.MAX_SAFE_INTEGER}`,\n            min: `${Number.MIN_SAFE_INTEGER}`,\n            signed: opts.signed,\n            size: opts.size,\n            value: `${value}n`,\n        });\n    return number;\n}\n/**\n * Decodes a hex value into a UTF-8 string.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex#hextostring\n *\n * @param hex Hex value to decode.\n * @param opts Options.\n * @returns String value.\n *\n * @example\n * import { hexToString } from 'viem'\n * const data = hexToString('0x48656c6c6f20576f726c6421')\n * // 'Hello world!'\n *\n * @example\n * import { hexToString } from 'viem'\n * const data = hexToString('0x48656c6c6f20576f726c64210000000000000000000000000000000000000000', {\n *  size: 32,\n * })\n * // 'Hello world'\n */\nexport function hexToString(hex, opts = {}) {\n    let bytes = hexToBytes(hex);\n    if (opts.size) {\n        assertSize(bytes, { size: opts.size });\n        bytes = trim(bytes, { dir: 'right' });\n    }\n    return new TextDecoder().decode(bytes);\n}\n//# sourceMappingURL=fromHex.js.map","export function concat(values) {\n    if (typeof values[0] === 'string')\n        return concatHex(values);\n    return concatBytes(values);\n}\nexport function concatBytes(values) {\n    let length = 0;\n    for (const arr of values) {\n        length += arr.length;\n    }\n    const result = new Uint8Array(length);\n    let offset = 0;\n    for (const arr of values) {\n        result.set(arr, offset);\n        offset += arr.length;\n    }\n    return result;\n}\nexport function concatHex(values) {\n    return `0x${values.reduce((acc, x) => acc + x.replace('0x', ''), '')}`;\n}\n//# sourceMappingURL=concat.js.map","import { BaseError } from './base.js';\nexport class NegativeOffsetError extends BaseError {\n    constructor({ offset }) {\n        super(`Offset \\`${offset}\\` cannot be negative.`, {\n            name: 'NegativeOffsetError',\n        });\n    }\n}\nexport class PositionOutOfBoundsError extends BaseError {\n    constructor({ length, position }) {\n        super(`Position \\`${position}\\` is out of bounds (\\`0 < position < ${length}\\`).`, { name: 'PositionOutOfBoundsError' });\n    }\n}\nexport class RecursiveReadLimitExceededError extends BaseError {\n    constructor({ count, limit }) {\n        super(`Recursive read limit of \\`${limit}\\` exceeded (recursive read count: \\`${count}\\`).`, { name: 'RecursiveReadLimitExceededError' });\n    }\n}\n//# sourceMappingURL=cursor.js.map","import { NegativeOffsetError, PositionOutOfBoundsError, RecursiveReadLimitExceededError, } from '../errors/cursor.js';\nconst staticCursor = {\n    bytes: new Uint8Array(),\n    dataView: new DataView(new ArrayBuffer(0)),\n    position: 0,\n    positionReadCount: new Map(),\n    recursiveReadCount: 0,\n    recursiveReadLimit: Number.POSITIVE_INFINITY,\n    assertReadLimit() {\n        if (this.recursiveReadCount >= this.recursiveReadLimit)\n            throw new RecursiveReadLimitExceededError({\n                count: this.recursiveReadCount + 1,\n                limit: this.recursiveReadLimit,\n            });\n    },\n    assertPosition(position) {\n        if (position < 0 || position > this.bytes.length - 1)\n            throw new PositionOutOfBoundsError({\n                length: this.bytes.length,\n                position,\n            });\n    },\n    decrementPosition(offset) {\n        if (offset < 0)\n            throw new NegativeOffsetError({ offset });\n        const position = this.position - offset;\n        this.assertPosition(position);\n        this.position = position;\n    },\n    getReadCount(position) {\n        return this.positionReadCount.get(position || this.position) || 0;\n    },\n    incrementPosition(offset) {\n        if (offset < 0)\n            throw new NegativeOffsetError({ offset });\n        const position = this.position + offset;\n        this.assertPosition(position);\n        this.position = position;\n    },\n    inspectByte(position_) {\n        const position = position_ ?? this.position;\n        this.assertPosition(position);\n        return this.bytes[position];\n    },\n    inspectBytes(length, position_) {\n        const position = position_ ?? this.position;\n        this.assertPosition(position + length - 1);\n        return this.bytes.subarray(position, position + length);\n    },\n    inspectUint8(position_) {\n        const position = position_ ?? this.position;\n        this.assertPosition(position);\n        return this.bytes[position];\n    },\n    inspectUint16(position_) {\n        const position = position_ ?? this.position;\n        this.assertPosition(position + 1);\n        return this.dataView.getUint16(position);\n    },\n    inspectUint24(position_) {\n        const position = position_ ?? this.position;\n        this.assertPosition(position + 2);\n        return ((this.dataView.getUint16(position) << 8) +\n            this.dataView.getUint8(position + 2));\n    },\n    inspectUint32(position_) {\n        const position = position_ ?? this.position;\n        this.assertPosition(position + 3);\n        return this.dataView.getUint32(position);\n    },\n    pushByte(byte) {\n        this.assertPosition(this.position);\n        this.bytes[this.position] = byte;\n        this.position++;\n    },\n    pushBytes(bytes) {\n        this.assertPosition(this.position + bytes.length - 1);\n        this.bytes.set(bytes, this.position);\n        this.position += bytes.length;\n    },\n    pushUint8(value) {\n        this.assertPosition(this.position);\n        this.bytes[this.position] = value;\n        this.position++;\n    },\n    pushUint16(value) {\n        this.assertPosition(this.position + 1);\n        this.dataView.setUint16(this.position, value);\n        this.position += 2;\n    },\n    pushUint24(value) {\n        this.assertPosition(this.position + 2);\n        this.dataView.setUint16(this.position, value >> 8);\n        this.dataView.setUint8(this.position + 2, value & ~4294967040);\n        this.position += 3;\n    },\n    pushUint32(value) {\n        this.assertPosition(this.position + 3);\n        this.dataView.setUint32(this.position, value);\n        this.position += 4;\n    },\n    readByte() {\n        this.assertReadLimit();\n        this._touch();\n        const value = this.inspectByte();\n        this.position++;\n        return value;\n    },\n    readBytes(length, size) {\n        this.assertReadLimit();\n        this._touch();\n        const value = this.inspectBytes(length);\n        this.position += size ?? length;\n        return value;\n    },\n    readUint8() {\n        this.assertReadLimit();\n        this._touch();\n        const value = this.inspectUint8();\n        this.position += 1;\n        return value;\n    },\n    readUint16() {\n        this.assertReadLimit();\n        this._touch();\n        const value = this.inspectUint16();\n        this.position += 2;\n        return value;\n    },\n    readUint24() {\n        this.assertReadLimit();\n        this._touch();\n        const value = this.inspectUint24();\n        this.position += 3;\n        return value;\n    },\n    readUint32() {\n        this.assertReadLimit();\n        this._touch();\n        const value = this.inspectUint32();\n        this.position += 4;\n        return value;\n    },\n    get remaining() {\n        return this.bytes.length - this.position;\n    },\n    setPosition(position) {\n        const oldPosition = this.position;\n        this.assertPosition(position);\n        this.position = position;\n        return () => (this.position = oldPosition);\n    },\n    _touch() {\n        if (this.recursiveReadLimit === Number.POSITIVE_INFINITY)\n            return;\n        const count = this.getReadCount();\n        this.positionReadCount.set(this.position, count + 1);\n        if (count > 0)\n            this.recursiveReadCount++;\n    },\n};\nexport function createCursor(bytes, { recursiveReadLimit = 8_192 } = {}) {\n    const cursor = Object.create(staticCursor);\n    cursor.bytes = bytes;\n    cursor.dataView = new DataView(bytes.buffer ?? bytes, bytes.byteOffset, bytes.byteLength);\n    cursor.positionReadCount = new Map();\n    cursor.recursiveReadLimit = recursiveReadLimit;\n    return cursor;\n}\n//# sourceMappingURL=cursor.js.map","import { BaseError } from '../../errors/base.js';\nimport { createCursor, } from '../cursor.js';\nimport { hexToBytes } from './toBytes.js';\nimport { bytesToHex } from './toHex.js';\nexport function toRlp(bytes, to = 'hex') {\n    const encodable = getEncodable(bytes);\n    const cursor = createCursor(new Uint8Array(encodable.length));\n    encodable.encode(cursor);\n    if (to === 'hex')\n        return bytesToHex(cursor.bytes);\n    return cursor.bytes;\n}\nexport function bytesToRlp(bytes, to = 'bytes') {\n    return toRlp(bytes, to);\n}\nexport function hexToRlp(hex, to = 'hex') {\n    return toRlp(hex, to);\n}\nfunction getEncodable(bytes) {\n    if (Array.isArray(bytes))\n        return getEncodableList(bytes.map((x) => getEncodable(x)));\n    return getEncodableBytes(bytes);\n}\nfunction getEncodableList(list) {\n    const bodyLength = list.reduce((acc, x) => acc + x.length, 0);\n    const sizeOfBodyLength = getSizeOfLength(bodyLength);\n    const length = (() => {\n        if (bodyLength <= 55)\n            return 1 + bodyLength;\n        return 1 + sizeOfBodyLength + bodyLength;\n    })();\n    return {\n        length,\n        encode(cursor) {\n            if (bodyLength <= 55) {\n                cursor.pushByte(0xc0 + bodyLength);\n            }\n            else {\n                cursor.pushByte(0xc0 + 55 + sizeOfBodyLength);\n                if (sizeOfBodyLength === 1)\n                    cursor.pushUint8(bodyLength);\n                else if (sizeOfBodyLength === 2)\n                    cursor.pushUint16(bodyLength);\n                else if (sizeOfBodyLength === 3)\n                    cursor.pushUint24(bodyLength);\n                else\n                    cursor.pushUint32(bodyLength);\n            }\n            for (const { encode } of list) {\n                encode(cursor);\n            }\n        },\n    };\n}\nfunction getEncodableBytes(bytesOrHex) {\n    const bytes = typeof bytesOrHex === 'string' ? hexToBytes(bytesOrHex) : bytesOrHex;\n    const sizeOfBytesLength = getSizeOfLength(bytes.length);\n    const length = (() => {\n        if (bytes.length === 1 && bytes[0] < 0x80)\n            return 1;\n        if (bytes.length <= 55)\n            return 1 + bytes.length;\n        return 1 + sizeOfBytesLength + bytes.length;\n    })();\n    return {\n        length,\n        encode(cursor) {\n            if (bytes.length === 1 && bytes[0] < 0x80) {\n                cursor.pushBytes(bytes);\n            }\n            else if (bytes.length <= 55) {\n                cursor.pushByte(0x80 + bytes.length);\n                cursor.pushBytes(bytes);\n            }\n            else {\n                cursor.pushByte(0x80 + 55 + sizeOfBytesLength);\n                if (sizeOfBytesLength === 1)\n                    cursor.pushUint8(bytes.length);\n                else if (sizeOfBytesLength === 2)\n                    cursor.pushUint16(bytes.length);\n                else if (sizeOfBytesLength === 3)\n                    cursor.pushUint24(bytes.length);\n                else\n                    cursor.pushUint32(bytes.length);\n                cursor.pushBytes(bytes);\n            }\n        },\n    };\n}\nfunction getSizeOfLength(length) {\n    if (length < 2 ** 8)\n        return 1;\n    if (length < 2 ** 16)\n        return 2;\n    if (length < 2 ** 24)\n        return 3;\n    if (length < 2 ** 32)\n        return 4;\n    throw new BaseError('Length is too large.');\n}\n//# sourceMappingURL=toRlp.js.map","// Adapted from the Ox v1 `Value` module.\n/** @see https://ethereum.github.io/yellowpaper/paper.pdf */\nconst exponents = {\n    wei: 0,\n    gwei: 9,\n    szabo: 12,\n    finney: 15,\n    ether: 18,\n};\n/**\n * Formats a `bigint` Value to its string representation (divided by the given exponent).\n *\n * @example\n * ```ts twoslash\n * import { Value } from 'ox'\n *\n * Value.format(420_000_000_000n, 9)\n * // @log: '420'\n * ```\n *\n * @param value - The `bigint` Value to format.\n * @param decimals - The exponent to divide the `bigint` Value by.\n * @returns The string representation of the Value.\n */\nexport function format(value, decimals = 0) {\n    if (!Number.isInteger(decimals) || decimals < 0)\n        throw new InvalidDecimalsError({ decimals });\n    let display = value.toString();\n    const negative = display.startsWith('-');\n    if (negative)\n        display = display.slice(1);\n    display = display.padStart(decimals, '0');\n    let [integer, fraction] = [\n        display.slice(0, display.length - decimals),\n        display.slice(display.length - decimals),\n    ];\n    fraction = fraction.replace(/(0+)$/, '');\n    return `${negative ? '-' : ''}${integer || '0'}${fraction ? `.${fraction}` : ''}`;\n}\n/**\n * Formats a `bigint` Value (default: wei) to a string representation of Ether.\n *\n * @example\n * ```ts twoslash\n * import { Value } from 'ox'\n *\n * Value.formatEther(1_000_000_000_000_000_000n)\n * // @log: '1'\n * ```\n *\n * @param wei - The Value to format.\n * @param unit - The unit to format the Value in. @default 'wei'.\n * @returns The Ether string representation of the Value.\n */\nexport function formatEther(wei, unit = 'wei') {\n    return format(wei, exponents.ether - exponents[unit]);\n}\n/**\n * Formats a `bigint` Value (default: wei) to a string representation of Gwei.\n *\n * @example\n * ```ts twoslash\n * import { Value } from 'ox'\n *\n * Value.formatGwei(1_000_000_000n)\n * // @log: '1'\n * ```\n *\n * @param wei - The Value to format.\n * @param unit - The unit to format the Value in. @default 'wei'.\n * @returns The Gwei string representation of the Value.\n */\nexport function formatGwei(wei, unit = 'wei') {\n    return format(wei, exponents.gwei - exponents[unit]);\n}\n/**\n * Parses a `string` representation of a Value to `bigint` (multiplied by the given exponent).\n *\n * @example\n * ```ts twoslash\n * import { Value } from 'ox'\n *\n * Value.from('420', 9)\n * // @log: 420000000000n\n * ```\n *\n * @param value - The string representation of the Value.\n * @param decimals - The exponent to multiply the Value by.\n * @returns The `bigint` representation of the Value.\n */\nexport function from(value, decimals = 0) {\n    if (!Number.isInteger(decimals) || decimals < 0)\n        throw new InvalidDecimalsError({ decimals });\n    // Require at least one digit overall. Rejects '', '.', '-', '-.' which\n    // the previous regex accepted (and which then either produced garbage or\n    // threw a raw `SyntaxError` from `BigInt('')`).\n    if (!/^-?(?:[0-9]+(?:\\.[0-9]*)?|\\.[0-9]+)$/.test(value))\n        throw new InvalidDecimalNumberError({ value });\n    let [integer = '', fraction = '0'] = value.split('.');\n    const negative = integer.startsWith('-');\n    if (negative)\n        integer = integer.slice(1);\n    if (integer === '')\n        integer = '0';\n    // trim trailing zeros.\n    fraction = fraction.replace(/(0+)$/, '');\n    // round off if the fraction is larger than the number of decimals.\n    if (decimals === 0) {\n        // Round half-away-from-zero by inspecting the first fractional digit.\n        if (fraction.length > 0 && Number.parseInt(fraction[0], 10) >= 5)\n            integer = `${BigInt(integer) + 1n}`;\n        fraction = '';\n    }\n    else if (fraction.length > decimals) {\n        const left = fraction.slice(0, decimals);\n        const roundDigit = Number.parseInt(fraction.slice(decimals, decimals + 1), 10);\n        if (roundDigit >= 5) {\n            // Carry through the truncated fraction digits into the integer part\n            // without converting to a JS Number (avoids float precision loss).\n            const carried = carry(left);\n            if (carried.length > decimals) {\n                // Carry overflowed into the integer part.\n                fraction = carried.slice(1);\n                integer = `${BigInt(integer) + 1n}`;\n            }\n            else {\n                fraction = carried;\n            }\n        }\n        else {\n            fraction = left;\n        }\n    }\n    else {\n        fraction = fraction.padEnd(decimals, '0');\n    }\n    return BigInt(`${negative ? '-' : ''}${integer}${fraction}`);\n}\n/**\n * Adds 1 to a digit string with carry, returning a string of the same length\n * unless the carry overflows past the most-significant digit (in which case\n * the returned string is one digit longer).\n *\n * @internal\n */\nfunction carry(digits) {\n    const out = digits.split('');\n    let i = out.length - 1;\n    while (i >= 0) {\n        const d = Number.parseInt(out[i], 10) + 1;\n        if (d < 10) {\n            out[i] = String(d);\n            return out.join('');\n        }\n        out[i] = '0';\n        i--;\n    }\n    return `1${out.join('')}`;\n}\n/**\n * Parses a string representation of Ether to a `bigint` Value (default: wei).\n *\n * @example\n * ```ts twoslash\n * import { Value } from 'ox'\n *\n * Value.fromEther('420')\n * // @log: 420000000000000000000n\n * ```\n *\n * @param ether - String representation of Ether.\n * @param unit - The unit to parse to. @default 'wei'.\n * @returns A `bigint` Value.\n */\nexport function fromEther(ether, unit = 'wei') {\n    return from(ether, exponents.ether - exponents[unit]);\n}\n/**\n * Parses a string representation of Gwei to a `bigint` Value (default: wei).\n *\n * @example\n * ```ts twoslash\n * import { Value } from 'ox'\n *\n * Value.fromGwei('420')\n * // @log: 420000000000n\n * ```\n *\n * @param gwei - String representation of Gwei.\n * @param unit - The unit to parse to. @default 'wei'.\n * @returns A `bigint` Value.\n */\nexport function fromGwei(gwei, unit = 'wei') {\n    return from(gwei, exponents.gwei - exponents[unit]);\n}\n/**\n * Thrown when a value is not a valid decimal number.\n *\n * @example\n * ```ts twoslash\n * import { Value } from 'ox'\n *\n * Value.fromEther('123.456.789')\n * // @error: Value.InvalidDecimalNumberError: Value `123.456.789` is not a valid decimal number.\n * ```\n */\nclass InvalidDecimalNumberError extends Error {\n    constructor({ value }) {\n        super(`Value \\`${value}\\` is not a valid decimal number.`);\n        Object.defineProperty(this, \"name\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: 'Value.InvalidDecimalNumberError'\n        });\n    }\n}\n/**\n * Thrown when the `decimals` argument is not a non-negative integer.\n *\n * @example\n * ```ts twoslash\n * import { Value } from 'ox'\n *\n * Value.from('1', -1)\n * // @error: Value.InvalidDecimalsError: `decimals` must be a non-negative integer. Got `-1`.\n * ```\n */\nclass InvalidDecimalsError extends Error {\n    constructor({ decimals }) {\n        super(`\\`decimals\\` must be a non-negative integer. Got \\`${decimals}\\`.`);\n        Object.defineProperty(this, \"name\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: 'Value.InvalidDecimalsError'\n        });\n    }\n}\n//# sourceMappingURL=Value.js.map","/**\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);\nfunction fromBig(n, le = false) {\n    if (le)\n        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n    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}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n    const l = (Al >>> 0) + (Bl >>> 0);\n    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig };\n// prettier-ignore\nconst u64 = {\n    fromBig, split, toBig,\n    shrSH, shrSL,\n    rotrSH, rotrSL, rotrBH, rotrBL,\n    rotr32H, rotr32L,\n    rotlSH, rotlSL, rotlBH, rotlBL,\n    add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","import { BaseError } from './base.js';\nexport class InvalidAddressError extends BaseError {\n    constructor({ address }) {\n        super(`Address \"${address}\" is invalid.`, {\n            metaMessages: [\n                '- Address must be a hex value of 20 bytes (40 hex characters).',\n                '- Address must match its checksum counterpart.',\n            ],\n            name: 'InvalidAddressError',\n        });\n    }\n}\n//# sourceMappingURL=address.js.map","/**\n * Map with a LRU (Least recently used) policy.\n *\n * @link https://en.wikipedia.org/wiki/Cache_replacement_policies#LRU\n */\nexport class LruMap extends Map {\n    constructor(size) {\n        super();\n        Object.defineProperty(this, \"maxSize\", {\n            enumerable: true,\n            configurable: true,\n            writable: true,\n            value: void 0\n        });\n        this.maxSize = size;\n    }\n    get(key) {\n        const value = super.get(key);\n        if (super.has(key)) {\n            super.delete(key);\n            super.set(key, value);\n        }\n        return value;\n    }\n    set(key, value) {\n        if (super.has(key))\n            super.delete(key);\n        super.set(key, value);\n        if (this.maxSize && this.size > this.maxSize) {\n            const firstKey = super.keys().next().value;\n            if (firstKey !== undefined)\n                super.delete(firstKey);\n        }\n        return this;\n    }\n}\n//# sourceMappingURL=lru.js.map","/**\n * SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n *\n * Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),\n * [Website](https://keccak.team/keccak.html),\n * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).\n *\n * Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n */\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from \"./_u64.js\";\n// prettier-ignore\nimport { abytes, aexists, anumber, aoutput, clean, createHasher, createXOFer, Hash, swap32IfBE, toBytes, u32 } from \"./utils.js\";\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI = [];\nconst SHA3_ROTL = [];\nconst _SHA3_IOTA = [];\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n    // Pi\n    [x, y] = [y, (2 * x + 3 * y) % 5];\n    SHA3_PI.push(2 * (5 * y + x));\n    // Rotational\n    SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n    // Iota\n    let t = _0n;\n    for (let j = 0; j < 7; j++) {\n        R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n        if (R & _2n)\n            t ^= _1n << ((_1n << /* @__PURE__ */ BigInt(j)) - _1n);\n    }\n    _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n/** `keccakf1600` internal function, additionally allows to adjust round count. */\nexport function keccakP(s, rounds = 24) {\n    const B = new Uint32Array(5 * 2);\n    // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n    for (let round = 24 - rounds; round < 24; round++) {\n        // Theta θ\n        for (let x = 0; x < 10; x++)\n            B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n        for (let x = 0; x < 10; x += 2) {\n            const idx1 = (x + 8) % 10;\n            const idx0 = (x + 2) % 10;\n            const B0 = B[idx0];\n            const B1 = B[idx0 + 1];\n            const Th = rotlH(B0, B1, 1) ^ B[idx1];\n            const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n            for (let y = 0; y < 50; y += 10) {\n                s[x + y] ^= Th;\n                s[x + y + 1] ^= Tl;\n            }\n        }\n        // Rho (ρ) and Pi (π)\n        let curH = s[2];\n        let curL = s[3];\n        for (let t = 0; t < 24; t++) {\n            const shift = SHA3_ROTL[t];\n            const Th = rotlH(curH, curL, shift);\n            const Tl = rotlL(curH, curL, shift);\n            const PI = SHA3_PI[t];\n            curH = s[PI];\n            curL = s[PI + 1];\n            s[PI] = Th;\n            s[PI + 1] = Tl;\n        }\n        // Chi (χ)\n        for (let y = 0; y < 50; y += 10) {\n            for (let x = 0; x < 10; x++)\n                B[x] = s[y + x];\n            for (let x = 0; x < 10; x++)\n                s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n        }\n        // Iota (ι)\n        s[0] ^= SHA3_IOTA_H[round];\n        s[1] ^= SHA3_IOTA_L[round];\n    }\n    clean(B);\n}\n/** Keccak sponge function. */\nexport class Keccak extends Hash {\n    // NOTE: we accept arguments in bytes instead of bits here.\n    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n        super();\n        this.pos = 0;\n        this.posOut = 0;\n        this.finished = false;\n        this.destroyed = false;\n        this.enableXOF = false;\n        this.blockLen = blockLen;\n        this.suffix = suffix;\n        this.outputLen = outputLen;\n        this.enableXOF = enableXOF;\n        this.rounds = rounds;\n        // Can be passed from user as dkLen\n        anumber(outputLen);\n        // 1600 = 5x5 matrix of 64bit.  1600 bits === 200 bytes\n        // 0 < blockLen < 200\n        if (!(0 < blockLen && blockLen < 200))\n            throw new Error('only keccak-f1600 function is supported');\n        this.state = new Uint8Array(200);\n        this.state32 = u32(this.state);\n    }\n    clone() {\n        return this._cloneInto();\n    }\n    keccak() {\n        swap32IfBE(this.state32);\n        keccakP(this.state32, this.rounds);\n        swap32IfBE(this.state32);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\n        aexists(this);\n        data = toBytes(data);\n        abytes(data);\n        const { blockLen, state } = this;\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            for (let i = 0; i < take; i++)\n                state[this.pos++] ^= data[pos++];\n            if (this.pos === blockLen)\n                this.keccak();\n        }\n        return this;\n    }\n    finish() {\n        if (this.finished)\n            return;\n        this.finished = true;\n        const { state, suffix, pos, blockLen } = this;\n        // Do the padding\n        state[pos] ^= suffix;\n        if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n            this.keccak();\n        state[blockLen - 1] ^= 0x80;\n        this.keccak();\n    }\n    writeInto(out) {\n        aexists(this, false);\n        abytes(out);\n        this.finish();\n        const bufferOut = this.state;\n        const { blockLen } = this;\n        for (let pos = 0, len = out.length; pos < len;) {\n            if (this.posOut >= blockLen)\n                this.keccak();\n            const take = Math.min(blockLen - this.posOut, len - pos);\n            out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n            this.posOut += take;\n            pos += take;\n        }\n        return out;\n    }\n    xofInto(out) {\n        // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n        if (!this.enableXOF)\n            throw new Error('XOF is not possible for this instance');\n        return this.writeInto(out);\n    }\n    xof(bytes) {\n        anumber(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        aoutput(out, this);\n        if (this.finished)\n            throw new Error('digest() was already called');\n        this.writeInto(out);\n        this.destroy();\n        return out;\n    }\n    digest() {\n        return this.digestInto(new Uint8Array(this.outputLen));\n    }\n    destroy() {\n        this.destroyed = true;\n        clean(this.state);\n    }\n    _cloneInto(to) {\n        const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n        to || (to = new Keccak(blockLen, suffix, outputLen, enableXOF, rounds));\n        to.state32.set(this.state32);\n        to.pos = this.pos;\n        to.posOut = this.posOut;\n        to.finished = this.finished;\n        to.rounds = rounds;\n        // Suffix can change in cSHAKE\n        to.suffix = suffix;\n        to.outputLen = outputLen;\n        to.enableXOF = enableXOF;\n        to.destroyed = this.destroyed;\n        return to;\n    }\n}\nconst gen = (suffix, blockLen, outputLen) => createHasher(() => new Keccak(blockLen, suffix, outputLen));\n/** SHA3-224 hash function. */\nexport const sha3_224 = /* @__PURE__ */ (() => gen(0x06, 144, 224 / 8))();\n/** SHA3-256 hash function. Different from keccak-256. */\nexport const sha3_256 = /* @__PURE__ */ (() => gen(0x06, 136, 256 / 8))();\n/** SHA3-384 hash function. */\nexport const sha3_384 = /* @__PURE__ */ (() => gen(0x06, 104, 384 / 8))();\n/** SHA3-512 hash function. */\nexport const sha3_512 = /* @__PURE__ */ (() => gen(0x06, 72, 512 / 8))();\n/** keccak-224 hash function. */\nexport const keccak_224 = /* @__PURE__ */ (() => gen(0x01, 144, 224 / 8))();\n/** keccak-256 hash function. Different from SHA3-256. */\nexport const keccak_256 = /* @__PURE__ */ (() => gen(0x01, 136, 256 / 8))();\n/** keccak-384 hash function. */\nexport const keccak_384 = /* @__PURE__ */ (() => gen(0x01, 104, 384 / 8))();\n/** keccak-512 hash function. */\nexport const keccak_512 = /* @__PURE__ */ (() => gen(0x01, 72, 512 / 8))();\nconst genShake = (suffix, blockLen, outputLen) => createXOFer((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\n/** SHAKE128 XOF with 128-bit security. */\nexport const shake128 = /* @__PURE__ */ (() => genShake(0x1f, 168, 128 / 8))();\n/** SHAKE256 XOF with 256-bit security. */\nexport const shake256 = /* @__PURE__ */ (() => genShake(0x1f, 136, 256 / 8))();\n//# sourceMappingURL=sha3.js.map","import { keccak_256 } from '@noble/hashes/sha3';\nimport { isHex } from '../data/isHex.js';\nimport { toBytes } from '../encoding/toBytes.js';\nimport { toHex } from '../encoding/toHex.js';\nexport function keccak256(value, to_) {\n    const to = to_ || 'hex';\n    const bytes = keccak_256(isHex(value, { strict: false }) ? toBytes(value) : value);\n    if (to === 'bytes')\n        return bytes;\n    return toHex(bytes);\n}\n//# sourceMappingURL=keccak256.js.map","import { InvalidAddressError } from '../../errors/address.js';\nimport { stringToBytes, } from '../encoding/toBytes.js';\nimport { keccak256 } from '../hash/keccak256.js';\nimport { LruMap } from '../lru.js';\nimport { isAddress } from './isAddress.js';\nconst checksumAddressCache = /*#__PURE__*/ new LruMap(8192);\nexport function checksumAddress(address_, \n/**\n * Warning: EIP-1191 checksum addresses are generally not backwards compatible with the\n * wider Ethereum ecosystem, meaning it will break when validated against an application/tool\n * that relies on EIP-55 checksum encoding (checksum without chainId).\n *\n * It is highly recommended to not use this feature unless you\n * know what you are doing.\n *\n * See more: https://github.com/ethereum/EIPs/issues/1121\n */\nchainId) {\n    if (checksumAddressCache.has(`${address_}.${chainId}`))\n        return checksumAddressCache.get(`${address_}.${chainId}`);\n    const hexAddress = chainId\n        ? `${chainId}${address_.toLowerCase()}`\n        : address_.substring(2).toLowerCase();\n    const hash = keccak256(stringToBytes(hexAddress), 'bytes');\n    const address = (chainId ? hexAddress.substring(`${chainId}0x`.length) : hexAddress).split('');\n    for (let i = 0; i < 40; i += 2) {\n        if (hash[i >> 1] >> 4 >= 8 && address[i]) {\n            address[i] = address[i].toUpperCase();\n        }\n        if ((hash[i >> 1] & 0x0f) >= 8 && address[i + 1]) {\n            address[i + 1] = address[i + 1].toUpperCase();\n        }\n    }\n    const result = `0x${address.join('')}`;\n    checksumAddressCache.set(`${address_}.${chainId}`, result);\n    return result;\n}\nexport function getAddress(address, \n/**\n * Warning: EIP-1191 checksum addresses are generally not backwards compatible with the\n * wider Ethereum ecosystem, meaning it will break when validated against an application/tool\n * that relies on EIP-55 checksum encoding (checksum without chainId).\n *\n * It is highly recommended to not use this feature unless you\n * know what you are doing.\n *\n * See more: https://github.com/ethereum/EIPs/issues/1121\n */\nchainId) {\n    if (!isAddress(address, { strict: false }))\n        throw new InvalidAddressError({ address });\n    return checksumAddress(address, chainId);\n}\n//# sourceMappingURL=getAddress.js.map","import { LruMap } from '../lru.js';\nimport { checksumAddress } from './getAddress.js';\nconst addressRegex = /^0x[a-fA-F0-9]{40}$/;\n/** @internal */\nexport const isAddressCache = /*#__PURE__*/ new LruMap(8192);\nexport function isAddress(address, options) {\n    const { strict = true } = options ?? {};\n    const cacheKey = `${address}.${strict}`;\n    if (isAddressCache.has(cacheKey))\n        return isAddressCache.get(cacheKey);\n    const result = (() => {\n        if (!addressRegex.test(address))\n            return false;\n        if (address.toLowerCase() === address)\n            return true;\n        if (strict)\n            return checksumAddress(address) === address;\n        return true;\n    })();\n    isAddressCache.set(cacheKey, result);\n    return result;\n}\n//# sourceMappingURL=isAddress.js.map","import { SliceOffsetOutOfBoundsError, } from '../../errors/data.js';\nimport { isHex } from './isHex.js';\nimport { size } from './size.js';\n/**\n * @description Returns a section of the hex or byte array given a start/end bytes offset.\n *\n * @param value The hex or byte array to slice.\n * @param start The start offset (in bytes).\n * @param end The end offset (in bytes).\n */\nexport function slice(value, start, end, { strict } = {}) {\n    if (isHex(value, { strict: false }))\n        return sliceHex(value, start, end, {\n            strict,\n        });\n    return sliceBytes(value, start, end, {\n        strict,\n    });\n}\nfunction assertStartOffset(value, start) {\n    if (typeof start === 'number' && start > 0 && start > size(value) - 1)\n        throw new SliceOffsetOutOfBoundsError({\n            offset: start,\n            position: 'start',\n            size: size(value),\n        });\n}\nfunction assertEndOffset(value, start, end) {\n    if (typeof start === 'number' &&\n        typeof end === 'number' &&\n        size(value) !== end - start) {\n        throw new SliceOffsetOutOfBoundsError({\n            offset: end,\n            position: 'end',\n            size: size(value),\n        });\n    }\n}\n/**\n * @description Returns a section of the byte array given a start/end bytes offset.\n *\n * @param value The byte array to slice.\n * @param start The start offset (in bytes).\n * @param end The end offset (in bytes).\n */\nexport function sliceBytes(value_, start, end, { strict } = {}) {\n    assertStartOffset(value_, start);\n    const value = value_.slice(start, end);\n    if (strict)\n        assertEndOffset(value, start, end);\n    return value;\n}\n/**\n * @description Returns a section of the hex value given a start/end bytes offset.\n *\n * @param value The hex value to slice.\n * @param start The start offset (in bytes).\n * @param end The end offset (in bytes).\n */\nexport function sliceHex(value_, start, end, { strict } = {}) {\n    assertStartOffset(value_, start);\n    const value = `0x${value_\n        .replace('0x', '')\n        .slice((start ?? 0) * 2, (end ?? value_.length) * 2)}`;\n    if (strict)\n        assertEndOffset(value, start, end);\n    return value;\n}\n//# sourceMappingURL=slice.js.map","// The one home for reading an unknown value as a plain record. Every package\n// imports these instead of writing its own `typeof x === \"object\"` guard.\n\n/** A non-null object that is not an array: a value whose fields can be read by name. */\nexport function isRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\n/** The field `key` of `value` when `value` is a record, else undefined. */\nexport function readField(value: unknown, key: string): unknown {\n  return isRecord(value) ? value[key] : undefined;\n}\n\n/** An array whose every entry is a string. */\nexport function isStringArray(value: unknown): value is readonly string[] {\n  return Array.isArray(value) && value.every((entry) => typeof entry === \"string\");\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23],"mappings":";;AAAA,MAAa,UAAU;;;ACCvB,IAAI,cAAc;CACd,aAAa,EAAE,aAAa,WAAW,IAAI,eAAgB,WACrD,GAAG,eAAe,oBAAoB,WAAW,WAAW,IAAI,aAAa,OAC7E,KAAA;CACN,SAAS,QAAQ;AACrB;AAIA,IAAa,YAAb,MAAa,kBAAkB,MAAM;CACjC,YAAY,cAAc,OAAO,CAAC,GAAG;EACjC,MAAM,iBAAiB;GACnB,IAAI,KAAK,iBAAiB,WACtB,OAAO,KAAK,MAAM;GACtB,IAAI,KAAK,OAAO,SACZ,OAAO,KAAK,MAAM;GACtB,OAAO,KAAK;EAChB,EAAA,CAAG;EACH,MAAM,kBAAkB;GACpB,IAAI,KAAK,iBAAiB,WACtB,OAAO,KAAK,MAAM,YAAY,KAAK;GACvC,OAAO,KAAK;EAChB,EAAA,CAAG;EACH,MAAM,UAAU,YAAY,aAAa;GAAE,GAAG;GAAM;EAAS,CAAC;EAC9D,MAAM,UAAU;GACZ,gBAAgB;GAChB;GACA,GAAI,KAAK,eAAe,CAAC,GAAG,KAAK,cAAc,EAAE,IAAI,CAAC;GACtD,GAAI,UAAU,CAAC,SAAS,SAAS,IAAI,CAAC;GACtC,GAAI,UAAU,CAAC,YAAY,SAAS,IAAI,CAAC;GACzC,GAAI,YAAY,UAAU,CAAC,YAAY,YAAY,SAAS,IAAI,CAAC;EACrE,CAAC,CAAC,KAAK,IAAI;EACX,MAAM,SAAS,KAAK,QAAQ,EAAE,OAAO,KAAK,MAAM,IAAI,KAAA,CAAS;EAC7D,OAAO,eAAe,MAAM,WAAW;GACnC,YAAY;GACZ,cAAc;GACd,UAAU;GACV,OAAO,KAAK;EAChB,CAAC;EACD,OAAO,eAAe,MAAM,YAAY;GACpC,YAAY;GACZ,cAAc;GACd,UAAU;GACV,OAAO,KAAK;EAChB,CAAC;EACD,OAAO,eAAe,MAAM,gBAAgB;GACxC,YAAY;GACZ,cAAc;GACd,UAAU;GACV,OAAO,KAAK;EAChB,CAAC;EACD,OAAO,eAAe,MAAM,gBAAgB;GACxC,YAAY;GACZ,cAAc;GACd,UAAU;GACV,OAAO,KAAK;EAChB,CAAC;EACD,OAAO,eAAe,MAAM,WAAW;GACnC,YAAY;GACZ,cAAc;GACd,UAAU;GACV,OAAO,KAAK;EAChB,CAAC;EACD,OAAO,eAAe,MAAM,QAAQ;GAChC,YAAY;GACZ,cAAc;GACd,UAAU;GACV,OAAO;EACX,CAAC;EACD,KAAK,UAAU;EACf,KAAK,WAAW;EAChB,KAAK,eAAe,KAAK;EACzB,KAAK,OAAO,KAAK,QAAQ,KAAK;EAC9B,KAAK,eAAe;EACpB,KAAK,UAAU;CACnB;CACA,KAAK,IAAI;EACL,OAAO,KAAK,MAAM,EAAE;CACxB;AACJ;AACA,SAAS,KAAK,KAAK,IAAI;CACnB,IAAI,KAAK,GAAG,GACR,OAAO;CACX,IAAI,OACA,OAAO,QAAQ,YACf,WAAW,OACX,IAAI,UAAU,KAAA,GACd,OAAO,KAAK,IAAI,OAAO,EAAE;CAC7B,OAAO,KAAK,OAAO;AACvB;;;ACzFA,IAAa,yBAAb,cAA4C,UAAU;CAClD,YAAY,EAAE,KAAK,KAAK,QAAQ,MAAM,SAAU;EAC5C,MAAM,WAAW,MAAM,mBAAmB,OAAO,GAAG,OAAO,EAAE,OAAO,SAAS,WAAW,WAAW,KAAK,GAAG,gBAAgB,MAAM,IAAI,IAAI,MAAM,IAAI,KAAK,UAAU,IAAI,MAAM,EAAE,MAAM,yBAAyB,CAAC;CAClN;AACJ;AACA,IAAa,2BAAb,cAA8C,UAAU;CACpD,YAAY,OAAO;EACf,MAAM,gBAAgB,MAAM,iGAAiG,EACzH,MAAM,2BACV,CAAC;CACL;AACJ;AA4BA,IAAa,oBAAb,cAAuC,UAAU;CAC7C,YAAY,EAAE,WAAW,WAAW;EAChC,MAAM,sBAAsB,QAAQ,sBAAsB,UAAU,UAAU,EAAE,MAAM,oBAAoB,CAAC;CAC/G;AACJ;;;AC5CA,SAAgB,MAAM,OAAO,EAAE,SAAS,SAAS,CAAC,GAAG;CACjD,IAAI,CAAC,OACD,OAAO;CACX,IAAI,OAAO,UAAU,UACjB,OAAO;CACX,OAAO,SAAS,mBAAmB,KAAK,KAAK,IAAI,MAAM,WAAW,IAAI;AAC1E;;;;;;;;;ACCA,SAAgB,KAAK,OAAO;CACxB,IAAI,MAAM,OAAO,EAAE,QAAQ,MAAM,CAAC,GAC9B,OAAO,KAAK,MAAM,MAAM,SAAS,KAAK,CAAC;CAC3C,OAAO,MAAM;AACjB;;;ACXA,SAAgB,KAAK,YAAY,EAAE,MAAM,WAAW,CAAC,GAAG;CACpD,IAAI,OAAO,OAAO,eAAe,WAAW,WAAW,QAAQ,MAAM,EAAE,IAAI;CAC3E,IAAI,cAAc;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KACjC,IAAI,KAAK,QAAQ,SAAS,IAAI,KAAK,SAAS,IAAI,EAAE,CAAC,SAAS,MAAM,KAC9D;MAEA;CAER,OACI,QAAQ,SACF,KAAK,MAAM,WAAW,IACtB,KAAK,MAAM,GAAG,KAAK,SAAS,WAAW;CACjD,IAAI,OAAO,eAAe,UAAU;EAChC,IAAI,KAAK,WAAW,KAAK,QAAQ,SAC7B,OAAO,GAAG,KAAK;EACnB,OAAO,KAAK,KAAK,SAAS,MAAM,IAAI,IAAI,SAAS;CACrD;CACA,OAAO;AACX;;;AClBA,IAAa,8BAAb,cAAiD,UAAU;CACvD,YAAY,EAAE,QAAQ,UAAU,QAAS;EACrC,MAAM,SAAS,aAAa,UAAU,aAAa,SAAS,cAAc,OAAO,4BAA4B,KAAK,KAAK,EAAE,MAAM,8BAA8B,CAAC;CAClK;AACJ;AACA,IAAa,8BAAb,cAAiD,UAAU;CACvD,YAAY,EAAE,MAAM,YAAY,QAAS;EACrC,MAAM,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KACnC,MAAM,CAAC,CAAC,CACR,YAAY,EAAE,SAAS,KAAK,0BAA0B,WAAW,KAAK,EAAE,MAAM,8BAA8B,CAAC;CACtH;AACJ;;;ACXA,SAAgB,IAAI,YAAY,EAAE,KAAK,OAAO,OAAO,CAAC,GAAG;CACrD,IAAI,OAAO,eAAe,UACtB,OAAO,OAAO,YAAY;EAAE;EAAK;CAAK,CAAC;CAC3C,OAAO,SAAS,YAAY;EAAE;EAAK;CAAK,CAAC;AAC7C;AACA,SAAgB,OAAO,MAAM,EAAE,KAAK,OAAO,OAAO,CAAC,GAAG;CAClD,IAAI,SAAS,MACT,OAAO;CACX,MAAM,MAAM,KAAK,QAAQ,MAAM,EAAE;CACjC,IAAI,IAAI,SAAS,OAAO,GACpB,MAAM,IAAI,4BAA4B;EAClC,MAAM,KAAK,KAAK,IAAI,SAAS,CAAC;EAC9B,YAAY;EACZ,MAAM;CACV,CAAC;CACL,OAAO,KAAK,IAAI,QAAQ,UAAU,WAAW,WAAW,CAAC,OAAO,GAAG,GAAG;AAC1E;AACA,SAAgB,SAAS,OAAO,EAAE,KAAK,OAAO,OAAO,CAAC,GAAG;CACrD,IAAI,SAAS,MACT,OAAO;CACX,IAAI,MAAM,SAAS,MACf,MAAM,IAAI,4BAA4B;EAClC,MAAM,MAAM;EACZ,YAAY;EACZ,MAAM;CACV,CAAC;CACL,MAAM,cAAc,IAAI,WAAW,IAAI;CACvC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;EAC3B,MAAM,SAAS,QAAQ;EACvB,YAAY,SAAS,IAAI,OAAO,IAAI,KAChC,MAAM,SAAS,IAAI,MAAM,SAAS,IAAI;CAC9C;CACA,OAAO;AACX;;;AC/BA,MAAM,QAAsB,oBAAM,KAAK,EAAE,QAAQ,IAAI,IAAI,IAAI,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BlG,SAAgB,MAAM,OAAO,OAAO,CAAC,GAAG;CACpC,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAC9C,OAAO,YAAY,OAAO,IAAI;CAClC,IAAI,OAAO,UAAU,UACjB,OAAO,YAAY,OAAO,IAAI;CAElC,IAAI,OAAO,UAAU,WACjB,OAAO,UAAU,OAAO,IAAI;CAChC,OAAO,WAAW,OAAO,IAAI;AACjC;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAAgB,UAAU,OAAO,OAAO,CAAC,GAAG;CACxC,MAAM,MAAM,KAAK,OAAO,KAAK;CAC7B,IAAI,OAAO,KAAK,SAAS,UAAU;EAC/B,WAAW,KAAK,EAAE,MAAM,KAAK,KAAK,CAAC;EACnC,OAAO,IAAI,KAAK,EAAE,MAAM,KAAK,KAAK,CAAC;CACvC;CACA,OAAO;AACX;;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,WAAW,OAAO,OAAO,CAAC,GAAG;CACzC,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAC9B,UAAU,MAAM,MAAM;CAE1B,MAAM,MAAM,KAAK;CACjB,IAAI,OAAO,KAAK,SAAS,UAAU;EAC/B,WAAW,KAAK,EAAE,MAAM,KAAK,KAAK,CAAC;EACnC,OAAO,IAAI,KAAK;GAAE,KAAK;GAAS,MAAM,KAAK;EAAK,CAAC;CACrD;CACA,OAAO;AACX;;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,YAAY,QAAQ,OAAO,CAAC,GAAG;CAC3C,MAAM,EAAE,QAAQ,SAAS;CACzB,MAAM,QAAQ,OAAO,MAAM;CAC3B,IAAI;CACJ,IAAI,MAAM;EACN,IAAI,QACA,YAAY,MAAO,OAAO,IAAI,IAAI,KAAK,MAAO;OAE9C,WAAW,OAAO,OAAO,IAAI,IAAI,MAAM;CAC/C,OACK,IAAI,OAAO,WAAW,UACvB,WAAW,OAAO,OAAO,gBAAgB;CAE7C,MAAM,WAAW,OAAO,aAAa,YAAY,SAAS,CAAC,WAAW,KAAK;CAC3E,IAAK,YAAY,QAAQ,YAAa,QAAQ,UAAU;EACpD,MAAM,SAAS,OAAO,WAAW,WAAW,MAAM;EAClD,MAAM,IAAI,uBAAuB;GAC7B,KAAK,WAAW,GAAG,WAAW,WAAW,KAAA;GACzC,KAAK,GAAG,WAAW;GACnB;GACA;GACA,OAAO,GAAG,SAAS;EACvB,CAAC;CACL;CACA,MAAM,MAAM,MAAM,UAAU,QAAQ,KAAK,MAAM,OAAO,OAAO,CAAC,KAAK,OAAO,KAAK,IAAI,MAAA,CAAO,SAAS,EAAE;CACrG,IAAI,MACA,OAAO,IAAI,KAAK,EAAE,KAAK,CAAC;CAC5B,OAAO;AACX;AACA,MAAMA,0BAAwB,IAAI,YAAY;;;;;;;;;;;;;;;;;;;;AAoB9C,SAAgB,YAAY,QAAQ,OAAO,CAAC,GAAG;CAE3C,OAAO,WADOA,UAAQ,OAAO,MACP,GAAG,IAAI;AACjC;;;ACxKA,MAAM,wBAAwB,IAAI,YAAY;;;;;;;;;;;;;;;;;;;;;;;;;;AA0B9C,SAAgB,QAAQ,OAAO,OAAO,CAAC,GAAG;CACtC,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAC9C,OAAO,cAAc,OAAO,IAAI;CACpC,IAAI,OAAO,UAAU,WACjB,OAAO,YAAY,OAAO,IAAI;CAClC,IAAI,MAAM,KAAK,GACX,OAAO,WAAW,OAAO,IAAI;CACjC,OAAO,cAAc,OAAO,IAAI;AACpC;;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,YAAY,OAAO,OAAO,CAAC,GAAG;CAC1C,MAAM,wBAAQ,IAAI,WAAW,CAAC;CAC9B,MAAM,KAAK,OAAO,KAAK;CACvB,IAAI,OAAO,KAAK,SAAS,UAAU;EAC/B,WAAW,OAAO,EAAE,MAAM,KAAK,KAAK,CAAC;EACrC,OAAO,IAAI,OAAO,EAAE,MAAM,KAAK,KAAK,CAAC;CACzC;CACA,OAAO;AACX;AAEA,MAAM,cAAc;CAChB,MAAM;CACN,MAAM;CACN,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;AACP;AACA,SAAS,iBAAiB,MAAM;CAC5B,IAAI,QAAQ,YAAY,QAAQ,QAAQ,YAAY,MAChD,OAAO,OAAO,YAAY;CAC9B,IAAI,QAAQ,YAAY,KAAK,QAAQ,YAAY,GAC7C,OAAO,QAAQ,YAAY,IAAI;CACnC,IAAI,QAAQ,YAAY,KAAK,QAAQ,YAAY,GAC7C,OAAO,QAAQ,YAAY,IAAI;AAEvC;;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,WAAW,MAAM,OAAO,CAAC,GAAG;CACxC,IAAI,MAAM;CACV,IAAI,KAAK,MAAM;EACX,WAAW,KAAK,EAAE,MAAM,KAAK,KAAK,CAAC;EACnC,MAAM,IAAI,KAAK;GAAE,KAAK;GAAS,MAAM,KAAK;EAAK,CAAC;CACpD;CACA,IAAI,YAAY,IAAI,MAAM,CAAC;CAC3B,IAAI,UAAU,SAAS,GACnB,YAAY,IAAI;CACpB,MAAM,SAAS,UAAU,SAAS;CAClC,MAAM,QAAQ,IAAI,WAAW,MAAM;CACnC,KAAK,IAAI,QAAQ,GAAG,IAAI,GAAG,QAAQ,QAAQ,SAAS;EAChD,MAAM,aAAa,iBAAiB,UAAU,WAAW,GAAG,CAAC;EAC7D,MAAM,cAAc,iBAAiB,UAAU,WAAW,GAAG,CAAC;EAC9D,IAAI,eAAe,KAAA,KAAa,gBAAgB,KAAA,GAC5C,MAAM,IAAI,UAAU,2BAA2B,UAAU,IAAI,KAAK,UAAU,IAAI,GAAG,QAAQ,UAAU,IAAI;EAE7G,MAAM,SAAS,aAAa,KAAK;CACrC;CACA,OAAO;AACX;;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,cAAc,OAAO,MAAM;CAEvC,OAAO,WADK,YAAY,OAAO,IACX,CAAC;AACzB;;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,cAAc,OAAO,OAAO,CAAC,GAAG;CAC5C,MAAM,QAAQ,QAAQ,OAAO,KAAK;CAClC,IAAI,OAAO,KAAK,SAAS,UAAU;EAC/B,WAAW,OAAO,EAAE,MAAM,KAAK,KAAK,CAAC;EACrC,OAAO,IAAI,OAAO;GAAE,KAAK;GAAS,MAAM,KAAK;EAAK,CAAC;CACvD;CACA,OAAO;AACX;;;AC3KA,SAAgB,WAAW,YAAY,EAAE,MAAA,UAAQ;CAC7C,IAAIC,KAAM,UAAU,IAAIC,QACpB,MAAM,IAAI,kBAAkB;EACxB,WAAWD,KAAM,UAAU;EAC3B,SAASC;CACb,CAAC;AACT;;;;;;;;;;;;;;;;;;;;AA6DA,SAAgB,YAAY,KAAK,OAAO,CAAC,GAAG;CACxC,MAAM,EAAE,WAAW;CACnB,IAAI,KAAK,MACL,WAAW,KAAK,EAAE,MAAM,KAAK,KAAK,CAAC;CACvC,MAAM,QAAQ,OAAO,GAAG;CACxB,IAAI,CAAC,QACD,OAAO;CACX,MAAM,QAAQ,IAAI,SAAS,KAAK;CAEhC,IAAI,UADS,MAAO,OAAO,IAAI,IAAI,KAAK,MAAO,IAE3C,OAAO;CACX,OAAO,QAAQ,OAAO,KAAK,IAAI,SAAS,OAAO,GAAG,GAAG,GAAG,IAAI;AAChE;;;;;;;;;;;;;;;;;;;;AAmDA,SAAgB,YAAY,KAAK,OAAO,CAAC,GAAG;CACxC,MAAM,QAAQ,YAAY,KAAK,IAAI;CACnC,MAAM,SAAS,OAAO,KAAK;CAC3B,IAAI,CAAC,OAAO,cAAc,MAAM,GAC5B,MAAM,IAAI,uBAAuB;EAC7B,KAAK,GAAG,OAAO;EACf,KAAK,GAAG,OAAO;EACf,QAAQ,KAAK;EACb,MAAM,KAAK;EACX,OAAO,GAAG,MAAM;CACpB,CAAC;CACL,OAAO;AACX;;;AClJA,SAAgB,OAAO,QAAQ;CAC3B,IAAI,OAAO,OAAO,OAAO,UACrB,OAAO,UAAU,MAAM;CAC3B,OAAO,YAAY,MAAM;AAC7B;AACA,SAAgB,YAAY,QAAQ;CAChC,IAAI,SAAS;CACb,KAAK,MAAM,OAAO,QACd,UAAU,IAAI;CAElB,MAAM,SAAS,IAAI,WAAW,MAAM;CACpC,IAAI,SAAS;CACb,KAAK,MAAM,OAAO,QAAQ;EACtB,OAAO,IAAI,KAAK,MAAM;EACtB,UAAU,IAAI;CAClB;CACA,OAAO;AACX;AACA,SAAgB,UAAU,QAAQ;CAC9B,OAAO,KAAK,OAAO,QAAQ,KAAK,MAAM,MAAM,EAAE,QAAQ,MAAM,EAAE,GAAG,EAAE;AACvE;;;ACnBA,IAAa,sBAAb,cAAyC,UAAU;CAC/C,YAAY,EAAE,UAAU;EACpB,MAAM,YAAY,OAAO,yBAAyB,EAC9C,MAAM,sBACV,CAAC;CACL;AACJ;AACA,IAAa,2BAAb,cAA8C,UAAU;CACpD,YAAY,EAAE,QAAQ,YAAY;EAC9B,MAAM,cAAc,SAAS,wCAAwC,OAAO,OAAO,EAAE,MAAM,2BAA2B,CAAC;CAC3H;AACJ;AACA,IAAa,kCAAb,cAAqD,UAAU;CAC3D,YAAY,EAAE,OAAO,SAAS;EAC1B,MAAM,6BAA6B,MAAM,uCAAuC,MAAM,OAAO,EAAE,MAAM,kCAAkC,CAAC;CAC5I;AACJ;;;AChBA,MAAM,eAAe;CACjB,uBAAO,IAAI,WAAW;CACtB,0BAAU,IAAI,yBAAS,IAAI,YAAY,CAAC,CAAC;CACzC,UAAU;CACV,mCAAmB,IAAI,IAAI;CAC3B,oBAAoB;CACpB,oBAAoB,OAAO;CAC3B,kBAAkB;EACd,IAAI,KAAK,sBAAsB,KAAK,oBAChC,MAAM,IAAI,gCAAgC;GACtC,OAAO,KAAK,qBAAqB;GACjC,OAAO,KAAK;EAChB,CAAC;CACT;CACA,eAAe,UAAU;EACrB,IAAI,WAAW,KAAK,WAAW,KAAK,MAAM,SAAS,GAC/C,MAAM,IAAI,yBAAyB;GAC/B,QAAQ,KAAK,MAAM;GACnB;EACJ,CAAC;CACT;CACA,kBAAkB,QAAQ;EACtB,IAAI,SAAS,GACT,MAAM,IAAI,oBAAoB,EAAE,OAAO,CAAC;EAC5C,MAAM,WAAW,KAAK,WAAW;EACjC,KAAK,eAAe,QAAQ;EAC5B,KAAK,WAAW;CACpB;CACA,aAAa,UAAU;EACnB,OAAO,KAAK,kBAAkB,IAAI,YAAY,KAAK,QAAQ,KAAK;CACpE;CACA,kBAAkB,QAAQ;EACtB,IAAI,SAAS,GACT,MAAM,IAAI,oBAAoB,EAAE,OAAO,CAAC;EAC5C,MAAM,WAAW,KAAK,WAAW;EACjC,KAAK,eAAe,QAAQ;EAC5B,KAAK,WAAW;CACpB;CACA,YAAY,WAAW;EACnB,MAAM,WAAW,aAAa,KAAK;EACnC,KAAK,eAAe,QAAQ;EAC5B,OAAO,KAAK,MAAM;CACtB;CACA,aAAa,QAAQ,WAAW;EAC5B,MAAM,WAAW,aAAa,KAAK;EACnC,KAAK,eAAe,WAAW,SAAS,CAAC;EACzC,OAAO,KAAK,MAAM,SAAS,UAAU,WAAW,MAAM;CAC1D;CACA,aAAa,WAAW;EACpB,MAAM,WAAW,aAAa,KAAK;EACnC,KAAK,eAAe,QAAQ;EAC5B,OAAO,KAAK,MAAM;CACtB;CACA,cAAc,WAAW;EACrB,MAAM,WAAW,aAAa,KAAK;EACnC,KAAK,eAAe,WAAW,CAAC;EAChC,OAAO,KAAK,SAAS,UAAU,QAAQ;CAC3C;CACA,cAAc,WAAW;EACrB,MAAM,WAAW,aAAa,KAAK;EACnC,KAAK,eAAe,WAAW,CAAC;EAChC,QAAS,KAAK,SAAS,UAAU,QAAQ,KAAK,KAC1C,KAAK,SAAS,SAAS,WAAW,CAAC;CAC3C;CACA,cAAc,WAAW;EACrB,MAAM,WAAW,aAAa,KAAK;EACnC,KAAK,eAAe,WAAW,CAAC;EAChC,OAAO,KAAK,SAAS,UAAU,QAAQ;CAC3C;CACA,SAAS,MAAM;EACX,KAAK,eAAe,KAAK,QAAQ;EACjC,KAAK,MAAM,KAAK,YAAY;EAC5B,KAAK;CACT;CACA,UAAU,OAAO;EACb,KAAK,eAAe,KAAK,WAAW,MAAM,SAAS,CAAC;EACpD,KAAK,MAAM,IAAI,OAAO,KAAK,QAAQ;EACnC,KAAK,YAAY,MAAM;CAC3B;CACA,UAAU,OAAO;EACb,KAAK,eAAe,KAAK,QAAQ;EACjC,KAAK,MAAM,KAAK,YAAY;EAC5B,KAAK;CACT;CACA,WAAW,OAAO;EACd,KAAK,eAAe,KAAK,WAAW,CAAC;EACrC,KAAK,SAAS,UAAU,KAAK,UAAU,KAAK;EAC5C,KAAK,YAAY;CACrB;CACA,WAAW,OAAO;EACd,KAAK,eAAe,KAAK,WAAW,CAAC;EACrC,KAAK,SAAS,UAAU,KAAK,UAAU,SAAS,CAAC;EACjD,KAAK,SAAS,SAAS,KAAK,WAAW,GAAG,QAAQ,GAAW;EAC7D,KAAK,YAAY;CACrB;CACA,WAAW,OAAO;EACd,KAAK,eAAe,KAAK,WAAW,CAAC;EACrC,KAAK,SAAS,UAAU,KAAK,UAAU,KAAK;EAC5C,KAAK,YAAY;CACrB;CACA,WAAW;EACP,KAAK,gBAAgB;EACrB,KAAK,OAAO;EACZ,MAAM,QAAQ,KAAK,YAAY;EAC/B,KAAK;EACL,OAAO;CACX;CACA,UAAU,QAAQ,MAAM;EACpB,KAAK,gBAAgB;EACrB,KAAK,OAAO;EACZ,MAAM,QAAQ,KAAK,aAAa,MAAM;EACtC,KAAK,YAAY,QAAQ;EACzB,OAAO;CACX;CACA,YAAY;EACR,KAAK,gBAAgB;EACrB,KAAK,OAAO;EACZ,MAAM,QAAQ,KAAK,aAAa;EAChC,KAAK,YAAY;EACjB,OAAO;CACX;CACA,aAAa;EACT,KAAK,gBAAgB;EACrB,KAAK,OAAO;EACZ,MAAM,QAAQ,KAAK,cAAc;EACjC,KAAK,YAAY;EACjB,OAAO;CACX;CACA,aAAa;EACT,KAAK,gBAAgB;EACrB,KAAK,OAAO;EACZ,MAAM,QAAQ,KAAK,cAAc;EACjC,KAAK,YAAY;EACjB,OAAO;CACX;CACA,aAAa;EACT,KAAK,gBAAgB;EACrB,KAAK,OAAO;EACZ,MAAM,QAAQ,KAAK,cAAc;EACjC,KAAK,YAAY;EACjB,OAAO;CACX;CACA,IAAI,YAAY;EACZ,OAAO,KAAK,MAAM,SAAS,KAAK;CACpC;CACA,YAAY,UAAU;EAClB,MAAM,cAAc,KAAK;EACzB,KAAK,eAAe,QAAQ;EAC5B,KAAK,WAAW;EAChB,aAAc,KAAK,WAAW;CAClC;CACA,SAAS;EACL,IAAI,KAAK,uBAAuB,OAAO,mBACnC;EACJ,MAAM,QAAQ,KAAK,aAAa;EAChC,KAAK,kBAAkB,IAAI,KAAK,UAAU,QAAQ,CAAC;EACnD,IAAI,QAAQ,GACR,KAAK;CACb;AACJ;AACA,SAAgB,aAAa,OAAO,EAAE,qBAAqB,SAAU,CAAC,GAAG;CACrE,MAAM,SAAS,OAAO,OAAO,YAAY;CACzC,OAAO,QAAQ;CACf,OAAO,WAAW,IAAI,SAAS,MAAM,UAAU,OAAO,MAAM,YAAY,MAAM,UAAU;CACxF,OAAO,oCAAoB,IAAI,IAAI;CACnC,OAAO,qBAAqB;CAC5B,OAAO;AACX;;;ACpKA,SAAgB,MAAM,OAAO,KAAK,OAAO;CACrC,MAAM,YAAY,aAAa,KAAK;CACpC,MAAM,SAAS,aAAa,IAAI,WAAW,UAAU,MAAM,CAAC;CAC5D,UAAU,OAAO,MAAM;CACvB,IAAI,OAAO,OACP,OAAO,WAAW,OAAO,KAAK;CAClC,OAAO,OAAO;AAClB;AAOA,SAAS,aAAa,OAAO;CACzB,IAAI,MAAM,QAAQ,KAAK,GACnB,OAAO,iBAAiB,MAAM,KAAK,MAAM,aAAa,CAAC,CAAC,CAAC;CAC7D,OAAO,kBAAkB,KAAK;AAClC;AACA,SAAS,iBAAiB,MAAM;CAC5B,MAAM,aAAa,KAAK,QAAQ,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;CAC5D,MAAM,mBAAmB,gBAAgB,UAAU;CAMnD,OAAO;EACH,eANkB;GAClB,IAAI,cAAc,IACd,OAAO,IAAI;GACf,OAAO,IAAI,mBAAmB;EAClC,EAAA,CAES;EACL,OAAO,QAAQ;GACX,IAAI,cAAc,IACd,OAAO,SAAS,MAAO,UAAU;QAEhC;IACD,OAAO,SAAS,MAAY,gBAAgB;IAC5C,IAAI,qBAAqB,GACrB,OAAO,UAAU,UAAU;SAC1B,IAAI,qBAAqB,GAC1B,OAAO,WAAW,UAAU;SAC3B,IAAI,qBAAqB,GAC1B,OAAO,WAAW,UAAU;SAE5B,OAAO,WAAW,UAAU;GACpC;GACA,KAAK,MAAM,EAAE,YAAY,MACrB,OAAO,MAAM;EAErB;CACJ;AACJ;AACA,SAAS,kBAAkB,YAAY;CACnC,MAAM,QAAQ,OAAO,eAAe,WAAW,WAAW,UAAU,IAAI;CACxE,MAAM,oBAAoB,gBAAgB,MAAM,MAAM;CAQtD,OAAO;EACH,eARkB;GAClB,IAAI,MAAM,WAAW,KAAK,MAAM,KAAK,KACjC,OAAO;GACX,IAAI,MAAM,UAAU,IAChB,OAAO,IAAI,MAAM;GACrB,OAAO,IAAI,oBAAoB,MAAM;EACzC,EAAA,CAES;EACL,OAAO,QAAQ;GACX,IAAI,MAAM,WAAW,KAAK,MAAM,KAAK,KACjC,OAAO,UAAU,KAAK;QAErB,IAAI,MAAM,UAAU,IAAI;IACzB,OAAO,SAAS,MAAO,MAAM,MAAM;IACnC,OAAO,UAAU,KAAK;GAC1B,OACK;IACD,OAAO,SAAS,MAAY,iBAAiB;IAC7C,IAAI,sBAAsB,GACtB,OAAO,UAAU,MAAM,MAAM;SAC5B,IAAI,sBAAsB,GAC3B,OAAO,WAAW,MAAM,MAAM;SAC7B,IAAI,sBAAsB,GAC3B,OAAO,WAAW,MAAM,MAAM;SAE9B,OAAO,WAAW,MAAM,MAAM;IAClC,OAAO,UAAU,KAAK;GAC1B;EACJ;CACJ;AACJ;AACA,SAAS,gBAAgB,QAAQ;CAC7B,IAAI,SAAS,KACT,OAAO;CACX,IAAI,SAAS,KAAK,IACd,OAAO;CACX,IAAI,SAAS,KAAK,IACd,OAAO;CACX,IAAI,SAAS,KAAK,IACd,OAAO;CACX,MAAM,IAAI,UAAU,sBAAsB;AAC9C;;;;ACjGA,MAAM,YAAY;CACd,KAAK;CACL,MAAM;CACN,OAAO;CACP,QAAQ;CACR,OAAO;AACX;;;;;;;;;;;;;;;;AAgBA,SAAgB,OAAO,OAAO,WAAW,GAAG;CACxC,IAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,GAC1C,MAAM,IAAI,qBAAqB,EAAE,SAAS,CAAC;CAC/C,IAAI,UAAU,MAAM,SAAS;CAC7B,MAAM,WAAW,QAAQ,WAAW,GAAG;CACvC,IAAI,UACA,UAAU,QAAQ,MAAM,CAAC;CAC7B,UAAU,QAAQ,SAAS,UAAU,GAAG;CACxC,IAAI,CAAC,SAAS,YAAY,CACtB,QAAQ,MAAM,GAAG,QAAQ,SAAS,QAAQ,GAC1C,QAAQ,MAAM,QAAQ,SAAS,QAAQ,CAC3C;CACA,WAAW,SAAS,QAAQ,SAAS,EAAE;CACvC,OAAO,GAAG,WAAW,MAAM,KAAK,WAAW,MAAM,WAAW,IAAI,aAAa;AACjF;;;;;;;;;;;;;;;;AAkCA,SAAgB,WAAW,KAAK,OAAO,OAAO;CAC1C,OAAO,OAAO,KAAK,UAAU,OAAO,UAAU,KAAK;AACvD;;;;;;;;;;;;AA0JA,IAAM,uBAAN,cAAmC,MAAM;CACrC,YAAY,EAAE,YAAY;EACtB,MAAM,sDAAsD,SAAS,IAAI;EACzE,OAAO,eAAe,MAAM,QAAQ;GAChC,YAAY;GACZ,cAAc;GACd,UAAU;GACV,OAAO;EACX,CAAC;CACL;AACJ;;;;;;;;ACzOA,MAAM,aAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,MAAM,OAAuB,uBAAO,EAAE;AACtC,SAAS,QAAQ,GAAG,KAAK,OAAO;CAC5B,IAAI,IACA,OAAO;EAAE,GAAG,OAAO,IAAI,UAAU;EAAG,GAAG,OAAQ,KAAK,OAAQ,UAAU;CAAE;CAC5E,OAAO;EAAE,GAAG,OAAQ,KAAK,OAAQ,UAAU,IAAI;EAAG,GAAG,OAAO,IAAI,UAAU,IAAI;CAAE;AACpF;AACA,SAAS,MAAM,KAAK,KAAK,OAAO;CAC5B,MAAM,MAAM,IAAI;CAChB,IAAI,KAAK,IAAI,YAAY,GAAG;CAC5B,IAAI,KAAK,IAAI,YAAY,GAAG;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;EAC1B,MAAM,EAAE,GAAG,MAAM,QAAQ,IAAI,IAAI,EAAE;EACnC,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;CAC1B;CACA,OAAO,CAAC,IAAI,EAAE;AAClB;AAeA,MAAM,UAAU,GAAG,GAAG,MAAO,KAAK,IAAM,MAAO,KAAK;AACpD,MAAM,UAAU,GAAG,GAAG,MAAO,KAAK,IAAM,MAAO,KAAK;AAEpD,MAAM,UAAU,GAAG,GAAG,MAAO,KAAM,IAAI,KAAQ,MAAO,KAAK;AAC3D,MAAM,UAAU,GAAG,GAAG,MAAO,KAAM,IAAI,KAAQ,MAAO,KAAK;;;ACvC3D,IAAa,sBAAb,cAAyC,UAAU;CAC/C,YAAY,EAAE,WAAW;EACrB,MAAM,YAAY,QAAQ,gBAAgB;GACtC,cAAc,CACV,kEACA,gDACJ;GACA,MAAM;EACV,CAAC;CACL;AACJ;;;;;;;;ACNA,IAAa,SAAb,cAA4B,IAAI;CAC5B,YAAY,MAAM;EACd,MAAM;EACN,OAAO,eAAe,MAAM,WAAW;GACnC,YAAY;GACZ,cAAc;GACd,UAAU;GACV,OAAO,KAAK;EAChB,CAAC;EACD,KAAK,UAAU;CACnB;CACA,IAAI,KAAK;EACL,MAAM,QAAQ,MAAM,IAAI,GAAG;EAC3B,IAAI,MAAM,IAAI,GAAG,GAAG;GAChB,MAAM,OAAO,GAAG;GAChB,MAAM,IAAI,KAAK,KAAK;EACxB;EACA,OAAO;CACX;CACA,IAAI,KAAK,OAAO;EACZ,IAAI,MAAM,IAAI,GAAG,GACb,MAAM,OAAO,GAAG;EACpB,MAAM,IAAI,KAAK,KAAK;EACpB,IAAI,KAAK,WAAW,KAAK,OAAO,KAAK,SAAS;GAC1C,MAAM,WAAW,MAAM,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;GACrC,IAAI,aAAa,KAAA,GACb,MAAM,OAAO,QAAQ;EAC7B;EACA,OAAO;CACX;AACJ;;;;;;;;;;;;;;AClBA,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,QAAQ,OAAO,GAAG;AACxB,MAAM,SAAS,OAAO,GAAI;AAC1B,MAAM,UAAU,CAAC;AACjB,MAAM,YAAY,CAAC;AACnB,MAAM,aAAa,CAAC;AACpB,KAAK,IAAI,QAAQ,GAAG,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,QAAQ,IAAI,SAAS;CAE5D,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC;CAChC,QAAQ,KAAK,KAAK,IAAI,IAAI,EAAE;CAE5B,UAAU,MAAQ,QAAQ,MAAM,QAAQ,KAAM,IAAK,EAAE;CAErD,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EACxB,KAAM,KAAK,OAAS,KAAK,OAAO,UAAW;EAC3C,IAAI,IAAI,KACJ,KAAK,QAAS,OAAuB,uBAAO,CAAC,KAAK;CAC1D;CACA,WAAW,KAAK,CAAC;AACrB;AACA,MAAM,QAAQ,MAAM,YAAY,IAAI;AACpC,MAAM,cAAc,MAAM;AAC1B,MAAM,cAAc,MAAM;AAE1B,MAAM,SAAS,GAAG,GAAG,MAAO,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC,IAAI,OAAO,GAAG,GAAG,CAAC;AACrE,MAAM,SAAS,GAAG,GAAG,MAAO,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC,IAAI,OAAO,GAAG,GAAG,CAAC;;AAErE,SAAgB,QAAQ,GAAG,SAAS,IAAI;CACpC,MAAM,oBAAI,IAAI,YAAY,EAAK;CAE/B,KAAK,IAAI,QAAQ,KAAK,QAAQ,QAAQ,IAAI,SAAS;EAE/C,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACpB,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI;EAC5D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;GAC5B,MAAM,QAAQ,IAAI,KAAK;GACvB,MAAM,QAAQ,IAAI,KAAK;GACvB,MAAM,KAAK,EAAE;GACb,MAAM,KAAK,EAAE,OAAO;GACpB,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE;GAChC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,OAAO;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI;IAC7B,EAAE,IAAI,MAAM;IACZ,EAAE,IAAI,IAAI,MAAM;GACpB;EACJ;EAEA,IAAI,OAAO,EAAE;EACb,IAAI,OAAO,EAAE;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;GACzB,MAAM,QAAQ,UAAU;GACxB,MAAM,KAAK,MAAM,MAAM,MAAM,KAAK;GAClC,MAAM,KAAK,MAAM,MAAM,MAAM,KAAK;GAClC,MAAM,KAAK,QAAQ;GACnB,OAAO,EAAE;GACT,OAAO,EAAE,KAAK;GACd,EAAE,MAAM;GACR,EAAE,KAAK,KAAK;EAChB;EAEA,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI;GAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACpB,EAAE,KAAK,EAAE,IAAI;GACjB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KACpB,EAAE,IAAI,MAAM,CAAC,GAAG,IAAI,KAAK,MAAM,GAAG,IAAI,KAAK;EACnD;EAEA,EAAE,MAAM,YAAY;EACpB,EAAE,MAAM,YAAY;CACxB;CACA,MAAM,CAAC;AACX;;AAEA,IAAa,SAAb,MAAa,eAAe,KAAK;CAE7B,YAAY,UAAU,QAAQ,WAAW,YAAY,OAAO,SAAS,IAAI;EACrE,MAAM;EACN,KAAK,MAAM;EACX,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,KAAK,YAAY;EACjB,KAAK,YAAY;EACjB,KAAK,WAAW;EAChB,KAAK,SAAS;EACd,KAAK,YAAY;EACjB,KAAK,YAAY;EACjB,KAAK,SAAS;EAEd,QAAQ,SAAS;EAGjB,IAAI,EAAE,IAAI,YAAY,WAAW,MAC7B,MAAM,IAAI,MAAM,yCAAyC;EAC7D,KAAK,wBAAQ,IAAI,WAAW,GAAG;EAC/B,KAAK,UAAU,IAAI,KAAK,KAAK;CACjC;CACA,QAAQ;EACJ,OAAO,KAAK,WAAW;CAC3B;CACA,SAAS;EACL,WAAW,KAAK,OAAO;EACvB,QAAQ,KAAK,SAAS,KAAK,MAAM;EACjC,WAAW,KAAK,OAAO;EACvB,KAAK,SAAS;EACd,KAAK,MAAM;CACf;CACA,OAAO,MAAM;EACT,QAAQ,IAAI;EACZ,OAAOC,UAAQ,IAAI;EACnB,OAAO,IAAI;EACX,MAAM,EAAE,UAAU,UAAU;EAC5B,MAAM,MAAM,KAAK;EACjB,KAAK,IAAI,MAAM,GAAG,MAAM,MAAM;GAC1B,MAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;GACpD,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KACtB,MAAM,KAAK,UAAU,KAAK;GAC9B,IAAI,KAAK,QAAQ,UACb,KAAK,OAAO;EACpB;EACA,OAAO;CACX;CACA,SAAS;EACL,IAAI,KAAK,UACL;EACJ,KAAK,WAAW;EAChB,MAAM,EAAE,OAAO,QAAQ,KAAK,aAAa;EAEzC,MAAM,QAAQ;EACd,KAAK,SAAS,SAAU,KAAK,QAAQ,WAAW,GAC5C,KAAK,OAAO;EAChB,MAAM,WAAW,MAAM;EACvB,KAAK,OAAO;CAChB;CACA,UAAU,KAAK;EACX,QAAQ,MAAM,KAAK;EACnB,OAAO,GAAG;EACV,KAAK,OAAO;EACZ,MAAM,YAAY,KAAK;EACvB,MAAM,EAAE,aAAa;EACrB,KAAK,IAAI,MAAM,GAAG,MAAM,IAAI,QAAQ,MAAM,MAAM;GAC5C,IAAI,KAAK,UAAU,UACf,KAAK,OAAO;GAChB,MAAM,OAAO,KAAK,IAAI,WAAW,KAAK,QAAQ,MAAM,GAAG;GACvD,IAAI,IAAI,UAAU,SAAS,KAAK,QAAQ,KAAK,SAAS,IAAI,GAAG,GAAG;GAChE,KAAK,UAAU;GACf,OAAO;EACX;EACA,OAAO;CACX;CACA,QAAQ,KAAK;EAET,IAAI,CAAC,KAAK,WACN,MAAM,IAAI,MAAM,uCAAuC;EAC3D,OAAO,KAAK,UAAU,GAAG;CAC7B;CACA,IAAI,OAAO;EACP,QAAQ,KAAK;EACb,OAAO,KAAK,QAAQ,IAAI,WAAW,KAAK,CAAC;CAC7C;CACA,WAAW,KAAK;EACZ,QAAQ,KAAK,IAAI;EACjB,IAAI,KAAK,UACL,MAAM,IAAI,MAAM,6BAA6B;EACjD,KAAK,UAAU,GAAG;EAClB,KAAK,QAAQ;EACb,OAAO;CACX;CACA,SAAS;EACL,OAAO,KAAK,WAAW,IAAI,WAAW,KAAK,SAAS,CAAC;CACzD;CACA,UAAU;EACN,KAAK,YAAY;EACjB,MAAM,KAAK,KAAK;CACpB;CACA,WAAW,IAAI;EACX,MAAM,EAAE,UAAU,QAAQ,WAAW,QAAQ,cAAc;EAC3D,OAAO,KAAK,IAAI,OAAO,UAAU,QAAQ,WAAW,WAAW,MAAM;EACrE,GAAG,QAAQ,IAAI,KAAK,OAAO;EAC3B,GAAG,MAAM,KAAK;EACd,GAAG,SAAS,KAAK;EACjB,GAAG,WAAW,KAAK;EACnB,GAAG,SAAS;EAEZ,GAAG,SAAS;EACZ,GAAG,YAAY;EACf,GAAG,YAAY;EACf,GAAG,YAAY,KAAK;EACpB,OAAO;CACX;AACJ;AACA,MAAM,OAAO,QAAQ,UAAU,cAAc,mBAAmB,IAAI,OAAO,UAAU,QAAQ,SAAS,CAAC;;AAYvG,MAAa,aAA6B,uBAAO,IAAI,GAAM,KAAK,EAAO,EAAA,CAAG;;;AC3N1E,SAAgB,UAAU,OAAO,KAAK;CAClC,MAAM,KAAK,OAAO;CAClB,MAAM,QAAQ,WAAW,MAAM,OAAO,EAAE,QAAQ,MAAM,CAAC,IAAI,QAAQ,KAAK,IAAI,KAAK;CACjF,IAAI,OAAO,SACP,OAAO;CACX,OAAO,MAAM,KAAK;AACtB;;;ACLA,MAAM,qCAAqC,IAAI,OAAO,IAAI;AAC1D,SAAgB,gBAAgB,UAWhC,SAAS;CACL,IAAI,qBAAqB,IAAI,GAAG,SAAS,GAAG,SAAS,GACjD,OAAO,qBAAqB,IAAI,GAAG,SAAS,GAAG,SAAS;CAC5D,MAAM,aAAa,UACb,GAAG,UAAU,SAAS,YAAY,MAClC,SAAS,UAAU,CAAC,CAAC,CAAC,YAAY;CACxC,MAAM,OAAO,UAAU,cAAc,UAAU,GAAG,OAAO;CACzD,MAAM,WAAW,UAAU,WAAW,UAAU,GAAG,QAAQ,IAAI,MAAM,IAAI,WAAA,CAAY,MAAM,EAAE;CAC7F,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;EAC5B,IAAI,KAAK,KAAK,MAAM,KAAK,KAAK,QAAQ,IAClC,QAAQ,KAAK,QAAQ,EAAE,CAAC,YAAY;EAExC,KAAK,KAAK,KAAK,KAAK,OAAS,KAAK,QAAQ,IAAI,IAC1C,QAAQ,IAAI,KAAK,QAAQ,IAAI,EAAE,CAAC,YAAY;CAEpD;CACA,MAAM,SAAS,KAAK,QAAQ,KAAK,EAAE;CACnC,qBAAqB,IAAI,GAAG,SAAS,GAAG,WAAW,MAAM;CACzD,OAAO;AACX;AACA,SAAgB,WAAW,SAW3B,SAAS;CACL,IAAI,CAAC,UAAU,SAAS,EAAE,QAAQ,MAAM,CAAC,GACrC,MAAM,IAAI,oBAAoB,EAAE,QAAQ,CAAC;CAC7C,OAAO,gBAAgB,SAAS,OAAO;AAC3C;;;AClDA,MAAM,eAAe;;AAErB,MAAa,+BAA+B,IAAI,OAAO,IAAI;AAC3D,SAAgB,UAAU,SAAS,SAAS;CACxC,MAAM,EAAE,SAAS,SAAS,WAAW,CAAC;CACtC,MAAM,WAAW,GAAG,QAAQ,GAAG;CAC/B,IAAI,eAAe,IAAI,QAAQ,GAC3B,OAAO,eAAe,IAAI,QAAQ;CACtC,MAAM,gBAAgB;EAClB,IAAI,CAAC,aAAa,KAAK,OAAO,GAC1B,OAAO;EACX,IAAI,QAAQ,YAAY,MAAM,SAC1B,OAAO;EACX,IAAI,QACA,OAAO,gBAAgB,OAAO,MAAM;EACxC,OAAO;CACX,EAAA,CAAG;CACH,eAAe,IAAI,UAAU,MAAM;CACnC,OAAO;AACX;;;;;;;;;;ACXA,SAAgB,MAAM,OAAO,OAAO,KAAK,EAAE,WAAW,CAAC,GAAG;CACtD,IAAI,MAAM,OAAO,EAAE,QAAQ,MAAM,CAAC,GAC9B,OAAO,SAAS,OAAO,OAAO,KAAK,EAC/B,OACJ,CAAC;CACL,OAAO,WAAW,OAAO,OAAO,KAAK,EACjC,OACJ,CAAC;AACL;AACA,SAAS,kBAAkB,OAAO,OAAO;CACrC,IAAI,OAAO,UAAU,YAAY,QAAQ,KAAK,QAAQ,KAAK,KAAK,IAAI,GAChE,MAAM,IAAI,4BAA4B;EAClC,QAAQ;EACR,UAAU;EACV,MAAM,KAAK,KAAK;CACpB,CAAC;AACT;AACA,SAAS,gBAAgB,OAAO,OAAO,KAAK;CACxC,IAAI,OAAO,UAAU,YACjB,OAAO,QAAQ,YACf,KAAK,KAAK,MAAM,MAAM,OACtB,MAAM,IAAI,4BAA4B;EAClC,QAAQ;EACR,UAAU;EACV,MAAM,KAAK,KAAK;CACpB,CAAC;AAET;;;;;;;;AAQA,SAAgB,WAAW,QAAQ,OAAO,KAAK,EAAE,WAAW,CAAC,GAAG;CAC5D,kBAAkB,QAAQ,KAAK;CAC/B,MAAM,QAAQ,OAAO,MAAM,OAAO,GAAG;CACrC,IAAI,QACA,gBAAgB,OAAO,OAAO,GAAG;CACrC,OAAO;AACX;;;;;;;;AAQA,SAAgB,SAAS,QAAQ,OAAO,KAAK,EAAE,WAAW,CAAC,GAAG;CAC1D,kBAAkB,QAAQ,KAAK;CAC/B,MAAM,QAAQ,KAAK,OACd,QAAQ,MAAM,EAAE,CAAC,CACjB,OAAO,SAAS,KAAK,IAAI,OAAO,OAAO,UAAU,CAAC;CACvD,IAAI,QACA,gBAAgB,OAAO,OAAO,GAAG;CACrC,OAAO;AACX;;;;AC/DA,SAAgB,SAAS,OAAkD;CACzE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;;AAGA,SAAgB,UAAU,OAAgB,KAAsB;CAC9D,OAAO,SAAS,KAAK,IAAI,MAAM,OAAO,KAAA;AACxC"}

package/dist/{secp256k1-Cc9JhcTQ.mjs → secp256k1-D8L212-Z.mjs}

@@ -1,298 +1,5 @@
-import { a as abytes$1, c as anumber, d as concatBytes$1, f as createHasher, g as toBytes, h as rotr, i as Hash, l as aoutput, m as randomBytes, o as aexists, p as createView, s as ahash, u as clean } from "./main.mjs";
-//#region ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/_md.js
-/**
-* Internal Merkle-Damgard hash utils.
-* @module
-*/
-/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */
-function setBigUint64(view, byteOffset, value, isLE) {
-	if (typeof view.setBigUint64 === "function") return view.setBigUint64(byteOffset, value, isLE);
-	const _32n = BigInt(32);
-	const _u32_max = BigInt(4294967295);
-	const wh = Number(value >> _32n & _u32_max);
-	const wl = Number(value & _u32_max);
-	const h = isLE ? 4 : 0;
-	const l = isLE ? 0 : 4;
-	view.setUint32(byteOffset + h, wh, isLE);
-	view.setUint32(byteOffset + l, wl, isLE);
-}
-/** Choice: a ? b : c */
-function Chi(a, b, c) {
-	return a & b ^ ~a & c;
-}
-/** Majority function, true if any two inputs is true. */
-function Maj(a, b, c) {
-	return a & b ^ a & c ^ b & c;
-}
-/**
-* Merkle-Damgard hash construction base class.
-* Could be used to create MD5, RIPEMD, SHA1, SHA2.
-*/
-var HashMD = class extends Hash {
-	constructor(blockLen, outputLen, padOffset, isLE) {
-		super();
-		this.finished = false;
-		this.length = 0;
-		this.pos = 0;
-		this.destroyed = false;
-		this.blockLen = blockLen;
-		this.outputLen = outputLen;
-		this.padOffset = padOffset;
-		this.isLE = isLE;
-		this.buffer = new Uint8Array(blockLen);
-		this.view = createView(this.buffer);
-	}
-	update(data) {
-		aexists(this);
-		data = toBytes(data);
-		abytes$1(data);
-		const { view, buffer, blockLen } = this;
-		const len = data.length;
-		for (let pos = 0; pos < len;) {
-			const take = Math.min(blockLen - this.pos, len - pos);
-			if (take === blockLen) {
-				const dataView = createView(data);
-				for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);
-				continue;
-			}
-			buffer.set(data.subarray(pos, pos + take), this.pos);
-			this.pos += take;
-			pos += take;
-			if (this.pos === blockLen) {
-				this.process(view, 0);
-				this.pos = 0;
-			}
-		}
-		this.length += data.length;
-		this.roundClean();
-		return this;
-	}
-	digestInto(out) {
-		aexists(this);
-		aoutput(out, this);
-		this.finished = true;
-		const { buffer, view, blockLen, isLE } = this;
-		let { pos } = this;
-		buffer[pos++] = 128;
-		clean(this.buffer.subarray(pos));
-		if (this.padOffset > blockLen - pos) {
-			this.process(view, 0);
-			pos = 0;
-		}
-		for (let i = pos; i < blockLen; i++) buffer[i] = 0;
-		setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);
-		this.process(view, 0);
-		const oview = createView(out);
-		const len = this.outputLen;
-		if (len % 4) throw new Error("_sha2: outputLen should be aligned to 32bit");
-		const outLen = len / 4;
-		const state = this.get();
-		if (outLen > state.length) throw new Error("_sha2: outputLen bigger than state");
-		for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);
-	}
-	digest() {
-		const { buffer, outputLen } = this;
-		this.digestInto(buffer);
-		const res = buffer.slice(0, outputLen);
-		this.destroy();
-		return res;
-	}
-	_cloneInto(to) {
-		to || (to = new this.constructor());
-		to.set(...this.get());
-		const { blockLen, buffer, length, finished, destroyed, pos } = this;
-		to.destroyed = destroyed;
-		to.finished = finished;
-		to.length = length;
-		to.pos = pos;
-		if (length % blockLen) to.buffer.set(buffer);
-		return to;
-	}
-	clone() {
-		return this._cloneInto();
-	}
-};
-/**
-* Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.
-* Check out `test/misc/sha2-gen-iv.js` for recomputation guide.
-*/
-/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */
-const SHA256_IV = /* @__PURE__ */ Uint32Array.from([
-	1779033703,
-	3144134277,
-	1013904242,
-	2773480762,
-	1359893119,
-	2600822924,
-	528734635,
-	1541459225
-]);
-//#endregion
-//#region ../../node_modules/.pnpm/@noble+hashes@1.8.0/node_modules/@noble/hashes/esm/sha2.js
-/**
-* SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.
-* SHA256 is the fastest hash implementable in JS, even faster than Blake3.
-* Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and
-* [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).
-* @module
-*/
-/**
-* Round constants:
-* First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)
-*/
-const SHA256_K = /* @__PURE__ */ Uint32Array.from([
-	1116352408,
-	1899447441,
-	3049323471,
-	3921009573,
-	961987163,
-	1508970993,
-	2453635748,
-	2870763221,
-	3624381080,
-	310598401,
-	607225278,
-	1426881987,
-	1925078388,
-	2162078206,
-	2614888103,
-	3248222580,
-	3835390401,
-	4022224774,
-	264347078,
-	604807628,
-	770255983,
-	1249150122,
-	1555081692,
-	1996064986,
-	2554220882,
-	2821834349,
-	2952996808,
-	3210313671,
-	3336571891,
-	3584528711,
-	113926993,
-	338241895,
-	666307205,
-	773529912,
-	1294757372,
-	1396182291,
-	1695183700,
-	1986661051,
-	2177026350,
-	2456956037,
-	2730485921,
-	2820302411,
-	3259730800,
-	3345764771,
-	3516065817,
-	3600352804,
-	4094571909,
-	275423344,
-	430227734,
-	506948616,
-	659060556,
-	883997877,
-	958139571,
-	1322822218,
-	1537002063,
-	1747873779,
-	1955562222,
-	2024104815,
-	2227730452,
-	2361852424,
-	2428436474,
-	2756734187,
-	3204031479,
-	3329325298
-]);
-/** Reusable temporary buffer. "W" comes straight from spec. */
-const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
-var SHA256 = class extends HashMD {
-	constructor(outputLen = 32) {
-		super(64, outputLen, 8, false);
-		this.A = SHA256_IV[0] | 0;
-		this.B = SHA256_IV[1] | 0;
-		this.C = SHA256_IV[2] | 0;
-		this.D = SHA256_IV[3] | 0;
-		this.E = SHA256_IV[4] | 0;
-		this.F = SHA256_IV[5] | 0;
-		this.G = SHA256_IV[6] | 0;
-		this.H = SHA256_IV[7] | 0;
-	}
-	get() {
-		const { A, B, C, D, E, F, G, H } = this;
-		return [
-			A,
-			B,
-			C,
-			D,
-			E,
-			F,
-			G,
-			H
-		];
-	}
-	set(A, B, C, D, E, F, G, H) {
-		this.A = A | 0;
-		this.B = B | 0;
-		this.C = C | 0;
-		this.D = D | 0;
-		this.E = E | 0;
-		this.F = F | 0;
-		this.G = G | 0;
-		this.H = H | 0;
-	}
-	process(view, offset) {
-		for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);
-		for (let i = 16; i < 64; i++) {
-			const W15 = SHA256_W[i - 15];
-			const W2 = SHA256_W[i - 2];
-			const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ W15 >>> 3;
-			const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ W2 >>> 10;
-			SHA256_W[i] = s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16] | 0;
-		}
-		let { A, B, C, D, E, F, G, H } = this;
-		for (let i = 0; i < 64; i++) {
-			const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);
-			const T1 = H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i] | 0;
-			const T2 = (rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22)) + Maj(A, B, C) | 0;
-			H = G;
-			G = F;
-			F = E;
-			E = D + T1 | 0;
-			D = C;
-			C = B;
-			B = A;
-			A = T1 + T2 | 0;
-		}
-		A = A + this.A | 0;
-		B = B + this.B | 0;
-		C = C + this.C | 0;
-		D = D + this.D | 0;
-		E = E + this.E | 0;
-		F = F + this.F | 0;
-		G = G + this.G | 0;
-		H = H + this.H | 0;
-		this.set(A, B, C, D, E, F, G, H);
-	}
-	roundClean() {
-		clean(SHA256_W);
-	}
-	destroy() {
-		this.set(0, 0, 0, 0, 0, 0, 0, 0);
-		clean(this.buffer);
-	}
-};
-/**
-* SHA2-256 hash function from RFC 4634.
-*
-* It is the fastest JS hash, even faster than Blake3.
-* To break sha256 using birthday attack, attackers need to try 2^128 hashes.
-* BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
-*/
-const sha256 = /* @__PURE__ */ createHasher(() => new SHA256());
-//#endregion
+import { a as anumber, c as concatBytes$1, d as randomBytes, i as ahash, m as toBytes, n as abytes$1, r as aexists, s as clean, t as Hash } from "./utils-DmKXBQjM.mjs";
+import { t as sha256 } from "./sha2-CR2DnMEk.mjs";
 //#region ../../node_modules/.pnpm/@noble+curves@1.9.1/node_modules/@noble/curves/esm/abstract/utils.js
 /**
 * Hex, bytes and number utilities.
@@ -437,8 +144,8 @@ function aInRange(title, n, min, max) {
 * TODO: merge with nLength in modular
 */
 function bitLen(n) {
-	let len;
-	for (len = 0; n > _0n$4; n >>= _1n$4, len += 1);
+	let len = 0;
+	for (; n > _0n$4; n >>= _1n$4, len += 1);
 	return len;
 }
 /**
@@ -2216,4 +1923,4 @@ const secp256k1 = createCurve({
 //#endregion
 export { secp256k1 };
 
-//# sourceMappingURL=secp256k1-Cc9JhcTQ.mjs.map
+//# sourceMappingURL=secp256k1-D8L212-Z.mjs.map