npm - ecma-evaluator - Versions diffs - 2.0.10 → 2.1.0 - Mend

ecma-evaluator 2.0.10 → 2.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (9) hide show

package/dist/cjs/index.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"cjs/index.cjs","sources":["webpack/runtime/define_property_getters","webpack/runtime/has_own_property","webpack/runtime/make_namespace_object","../../src/block.js","../../src/Evaluator.js","../../src/TemplateParser.js","../../src/index.js"],"sourcesContent":["__webpack_require__.d = function(exports, definition) {\n\tfor(var key in definition) {\n if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n }\n }\n};","__webpack_require__.o = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); }","// define __esModule on exports\n__webpack_require__.r = function(exports) {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","const mutableMethods = [\n\t\"Array.prototype.push\",\n\t\"Array.prototype.pop\",\n\t\"Array.prototype.shift\",\n\t\"Array.prototype.unshift\",\n\t\"Array.prototype.splice\",\n\t\"Array.prototype.reverse\",\n\t\"Array.prototype.sort\",\n\t\"Array.prototype.fill\",\n\t\"Array.prototype.copyWithin\",\n\n\t\"Object.defineProperty\",\n\t\"Object.defineProperties\",\n\t\"Object.preventExtensions\",\n\t\"Object.seal\",\n\t\"Object.freeze\",\n\t\"Object.setPrototypeOf\",\n\t\"Object.assign\",\n\t\"Object.prototype.__defineGetter__\",\n\t\"Object.prototype.__defineSetter__\",\n\n\t\"Reflect.set\",\n\t\"Reflect.defineProperty\",\n\t\"Reflect.deleteProperty\",\n\t\"Reflect.setPrototypeOf\",\n\t\"Reflect.preventExtensions\",\n\n\t\"Set.prototype.add\",\n\t\"Set.prototype.delete\",\n\t\"Set.prototype.clear\",\n\t\"WeakSet.prototype.add\",\n\t\"WeakSet.prototype.delete\",\n\n\t\"Map.prototype.set\",\n\t\"Map.prototype.delete\",\n\t\"Map.prototype.clear\",\n\t\"WeakMap.prototype.set\",\n\t\"WeakMap.prototype.delete\",\n\n\t\"Date.prototype.setTime\",\n\t\"Date.prototype.setMilliseconds\",\n\t\"Date.prototype.setUTCSeconds\",\n\t\"Date.prototype.setSeconds\",\n\t\"Date.prototype.setMinutes\",\n\t\"Date.prototype.setHours\",\n\t\"Date.prototype.setDate\",\n\t\"Date.prototype.setMonth\",\n\t\"Date.prototype.setFullYear\",\n\t\"Date.prototype.setYear\",\n\t\"Date.prototype.setUTCMilliseconds\",\n\t\"Date.prototype.setUTCMinutes\",\n\t\"Date.prototype.setUTCHours\",\n\t\"Date.prototype.setUTCDate\",\n\t\"Date.prototype.setUTCMonth\",\n\t\"Date.prototype.setUTCFullYear\",\n\n\t\"RegExp.prototype.compile\",\n\n\t\"Int8Array.prototype.set\",\n\t\"Uint8Array.prototype.set\",\n\t\"Uint8ClampedArray.prototype.set\",\n\t\"Int16Array.prototype.set\",\n\t\"Uint16Array.prototype.set\",\n\t\"Int32Array.prototype.set\",\n\t\"Uint32Array.prototype.set\",\n\t\"Float32Array.prototype.set\",\n\t\"Float64Array.prototype.set\",\n\t\"BigInt64Array.prototype.set\",\n\t\"BigUint64Array.prototype.set\",\n\n\t\"Int8Array.prototype.fill\",\n\t\"Uint8Array.prototype.fill\",\n\t\"Uint8ClampedArray.prototype.fill\",\n\t\"Int16Array.prototype.fill\",\n\t\"Uint16Array.prototype.fill\",\n\t\"Int32Array.prototype.fill\",\n\t\"Uint32Array.prototype.fill\",\n\t\"Float32Array.prototype.fill\",\n\t\"Float64Array.prototype.fill\",\n\t\"BigInt64Array.prototype.fill\",\n\t\"BigUint64Array.prototype.fill\",\n\n\t\"Int8Array.prototype.reverse\",\n\t\"Uint8Array.prototype.reverse\",\n\t\"Uint8ClampedArray.prototype.reverse\",\n\t\"Int16Array.prototype.reverse\",\n\t\"Uint16Array.prototype.reverse\",\n\t\"Int32Array.prototype.reverse\",\n\t\"Uint32Array.prototype.reverse\",\n\t\"Float32Array.prototype.reverse\",\n\t\"Float64Array.prototype.reverse\",\n\t\"BigInt64Array.prototype.reverse\",\n\t\"BigUint64Array.prototype.reverse\",\n\n\t\"Int8Array.prototype.sort\",\n\t\"Uint8Array.prototype.sort\",\n\t\"Uint8ClampedArray.prototype.sort\",\n\t\"Int16Array.prototype.sort\",\n\t\"Uint16Array.prototype.sort\",\n\t\"Int32Array.prototype.sort\",\n\t\"Uint32Array.prototype.sort\",\n\t\"Float32Array.prototype.sort\",\n\t\"Float64Array.prototype.sort\",\n\t\"BigInt64Array.prototype.sort\",\n\t\"BigUint64Array.prototype.sort\",\n\n\t\"Int8Array.prototype.copyWithin\",\n\t\"Uint8Array.prototype.copyWithin\",\n\t\"Uint8ClampedArray.prototype.copyWithin\",\n\t\"Int16Array.prototype.copyWithin\",\n\t\"Uint16Array.prototype.copyWithin\",\n\t\"Int32Array.prototype.copyWithin\",\n\t\"Uint32Array.prototype.copyWithin\",\n\t\"Float32Array.prototype.copyWithin\",\n\t\"Float64Array.prototype.copyWithin\",\n\t\"BigInt64Array.prototype.copyWithin\",\n\t\"BigUint64Array.prototype.copyWithin\",\n\n\t\"ArrayBuffer.prototype.transfer\",\n\t\"ArrayBuffer.prototype.transferToFixedLength\",\n\n\t\"SharedArrayBuffer.prototype.grow\",\n\n\t\"DataView.prototype.setInt8\",\n\t\"DataView.prototype.setUint8\",\n\t\"DataView.prototype.setInt16\",\n\t\"DataView.prototype.setUint16\",\n\t\"DataView.prototype.setInt32\",\n\t\"DataView.prototype.setUint32\",\n\t\"DataView.prototype.setFloat32\",\n\t\"DataView.prototype.setFloat64\",\n\t\"DataView.prototype.setBigInt64\",\n\t\"DataView.prototype.setBigUint64\",\n\n\t\"Generator.prototype.next\",\n\t\"Generator.prototype.return\",\n\t\"Generator.prototype.throw\",\n\n\t\"AsyncGenerator.prototype.next\",\n\t\"AsyncGenerator.prototype.return\",\n\t\"AsyncGenerator.prototype.throw\",\n\n\t\"Iterator.prototype.next\",\n\n\t\"WeakRef.prototype.deref\",\n\n\t\"FinalizationRegistry.prototype.register\",\n\t\"FinalizationRegistry.prototype.unregister\",\n\n\t\"URLSearchParams.prototype.append\",\n\t\"URLSearchParams.prototype.delete\",\n\t\"URLSearchParams.prototype.set\",\n\t\"URLSearchParams.prototype.sort\",\n\n\t\"FormData.prototype.append\",\n\t\"FormData.prototype.delete\",\n\t\"FormData.prototype.set\",\n\n\t\"Headers.prototype.append\",\n\t\"Headers.prototype.delete\",\n\t\"Headers.prototype.set\",\n\n\t// Function call/apply/bind can be used to invoke with arbitrary `this`\n\t\"Function.prototype.call\",\n\t\"Function.prototype.apply\",\n\t\"Function.prototype.bind\",\n\t\"Function.prototype.constructor\",\n\n\t// Legacy lookup helpers\n\t\"Object.prototype.__lookupGetter__\",\n\t\"Object.prototype.__lookupSetter__\",\n\n\t// Constructor property can be abused to retrieve the Function constructor\n\t\"Object.prototype.constructor\",\n];\n\nconst dangerousMethods = [\n\t\"Object.getPrototypeOf\",\n\t// Various reflective/object-inspection APIs that may expose internals\n\t\"Object.getOwnPropertyDescriptor\",\n\t\"Object.getOwnPropertyDescriptors\",\n\t\"Object.getOwnPropertyNames\",\n\t\"Object.getOwnPropertySymbols\",\n\n\t// Error reflection: Error.captureStackTrace(obj) installs a host `stack`\n\t// property on any object - including Object.prototype - polluting the\n\t// host. Error.prepareStackTrace is a host-installed callback that, if\n\t// called with attacker-controlled Error/frames, executes host code paths.\n\t\"Error.captureStackTrace\",\n\t\"Error.prepareStackTrace\",\n];\n\n// Some prototype-style aliases/properties that can be used to break sandboxes\nmutableMethods.push(\"Object.prototype.__proto__\");\n\n/*\n List of methods to block due to mutability or dangerousness\n /\nexport const blockedMethods = [...mutableMethods, ...dangerousMethods];\n\n/\n List of global built-ins to block entirely\n /\nexport const blockedGlobalBuiltIns = [\n\t\"Function\",\n\t\"GeneratorFunction\",\n\t\"AsyncFunction\",\n\t\"AsyncGeneratorFunction\",\n\t\"eval\",\n\t\"setTimeout\",\n\t\"setInterval\",\n\t\"clearTimeout\",\n\t\"clearInterval\",\n\t\"setImmediate\",\n\t\"XMLHttpRequest\",\n\t\"fetch\",\n\t\"WebSocket\",\n\t\"globalThis\",\n\n\t// Node / runtime globals\n\t\"process\",\n\t\"require\",\n\t\"module\",\n\t\"exports\",\n\t\"global\",\n\t\"Buffer\",\n\t\"setImmediate\",\n\t\"clearImmediate\",\n\n\t// Worker / threading / messaging\n\t\"importScripts\",\n\t\"Worker\",\n\t\"SharedWorker\",\n\t\"ServiceWorker\",\n\t\"BroadcastChannel\",\n\t\"MessageChannel\",\n\t\"MessagePort\",\n\t\"postMessage\",\n\n\t// Host environment globals (browser)\n\t\"window\",\n\t\"document\",\n\t\"navigator\",\n\t\"location\",\n\t\"localStorage\",\n\t\"sessionStorage\",\n\t\"indexedDB\",\n\t\"performance\",\n\n\t// Low-level / concurrent / binary APIs\n\t\"Proxy\",\n\t\"Reflect\",\n\t\"Atomics\",\n\t\"WebAssembly\",\n\t// SharedArrayBuffer escapes as a live reference to host shared memory\n\t// (structuredClone copies the handle, not the memory) and its constructor\n\t// allows multi-GiB allocations from ~20 characters of input\n\t\"SharedArrayBuffer\",\n\n\t// Asynchronous scheduling primitives that invoke callbacks in the host\n\t// runtime after evaluate() returns, escaping synchronous error handling\n\t\"queueMicrotask\",\n\t// AbortSignal.timeout() schedules a host timer whose abort listener runs\n\t// outside the interpreter; the whole global is blocked to close that hole\n\t\"AbortSignal\",\n\n\t// Promise is removed entirely. Any Promise that escapes evaluate() would\n\t// schedule its settlement callbacks in the host microtask queue, where\n\t// errors bypass the caller's synchronous try/catch and become unhandled\n\t// rejections. This single entry replaces the former per-method blocklist\n\t// (then/catch/finally/resolve/reject/all/race/any/allSettled/withResolvers).\n\t\"Promise\",\n\n\t// Console and internationalization\n\t\"console\",\n\t\"Intl\",\n\n\t// Other runtimes\n\t\"Deno\",\n];\n","import as acorn from \"acorn\";\nimport globals from \"globals\";\nimport { blockedGlobalBuiltIns, blockedMethods } from \"./block.js\";\n\n// Error message constants for better maintainability\nconst ERROR_MESSAGES = {\n\tCAN_NOT_READ_PROPERTY: \"Cannot read property of {0} (reading '{1}')\",\n\tIS_INVALID_SYNTAX: \"{0} is not a valid syntax\",\n\tIS_NOT_FUNCTION: \"{0} is not a function\",\n\tIS_NOT_DEFINED: \"{0} is not defined\",\n\tIS_NOT_ALLOWED: \"{0} is not allowed\",\n\tEXPRESSION_TOO_LONG: \"Expression exceeds the maximum length of {0} characters\",\n};\n\n/*\n Default maximum input length for a single expression.\n * Protects against resource exhaustion from overly long inputs.\n * Can be overridden per-instance via `new Evaluator(variables, { maxInputLength })`.\n /\nconst DEFAULT_MAX_INPUT_LENGTH = 10000;\nconst MAX_CONFIGURABLE_INPUT_LENGTH = 100000;\nconst DEFAULT_MAX_EVALUATION_STEPS = 10000;\nconst MAX_CONFIGURABLE_EVALUATION_STEPS = 100000;\nconst MAX_ARRAY_LENGTH = 10000;\nconst MAX_BUFFER_BYTES = 1000000;\nconst MAX_STRING_LENGTH = 100000;\nconst MAX_DATA_NODES = 100000;\nconst MAX_BIGINT_EXPONENT = 256n;\nconst MAX_BIGINT_BITS = 65536;\nconst TYPED_ARRAY_CONSTRUCTORS = new Set(\n\t[\n\t\tInt8Array,\n\t\tUint8Array,\n\t\tUint8ClampedArray,\n\t\tInt16Array,\n\t\tUint16Array,\n\t\tInt32Array,\n\t\tUint32Array,\n\t\tFloat32Array,\n\t\tFloat64Array,\n\t\ttypeof BigInt64Array === \"function\" ? BigInt64Array : null,\n\t\ttypeof BigUint64Array === \"function\" ? BigUint64Array : null,\n\t].filter((constructor) => typeof constructor === \"function\")\n);\n/\n Sentinel used to distinguish \"caller passed no pre-evaluated object\" from\n * \"the object expression itself evaluated to undefined\". See\n * {@link Evaluator#handleMemberExpression}.\n /\nconst NO_OBJECT = Symbol(\"no-object\");\n\n/\n Renders an error message by replacing placeholders with context values.\n * @param {string} template\n * @param {Record<string, any>} context\n * @example\n * ```js\n * const msg = renderErrorMessage(\"Cannot call mutable prototype method: {method}\", { method: \"push\" });\n * ```\n /\nconst renderErrorMessage = (template, context = {}) => template.replace(/{(\\w+)}/g, (_, key) => String(context[key]));\n\nfunction validateLimit(value, name, defaultValue, maximum) {\n\tif (value === undefined) {\n\t\treturn defaultValue;\n\t}\n\tif (!Number.isSafeInteger(value) \|\| value < 1 \|\| value > maximum) {\n\t\tthrow new RangeError(`${name} must be an integer between 1 and ${maximum}`);\n\t}\n\treturn value;\n}\n\nfunction countLiteralMatches(value, search, all) {\n\tif (search === \"\") {\n\t\treturn all ? value.length + 1 : 1;\n\t}\n\tlet count = 0;\n\tlet position = 0;\n\twhile ((position = value.indexOf(search, position)) !== -1) {\n\t\tcount++;\n\t\tif (!all) {\n\t\t\tbreak;\n\t\t}\n\t\tposition += search.length;\n\t}\n\treturn count;\n}\n\nfunction assertBoundedData(value, label) {\n\tconst pending = [value];\n\tconst seen = new WeakSet();\n\tlet dataSize = 0;\n\tlet dataNodes = 0;\n\tconst enqueueProperties = (object) => {\n\t\tconst keys = Object.keys(object);\n\t\tif (pending.length + keys.length > MAX_DATA_NODES) {\n\t\t\tthrow new RangeError(`${label} exceeds the maximum data node count`);\n\t\t}\n\t\tfor (const key of keys) {\n\t\t\tdataSize += key.length;\n\t\t\tconst descriptor = Object.getOwnPropertyDescriptor(object, key);\n\t\t\tif (!descriptor \|\| !Object.hasOwn(descriptor, \"value\")) {\n\t\t\t\tthrow new TypeError(`${label} cannot contain accessor properties`);\n\t\t\t}\n\t\t\tpending.push(descriptor.value);\n\t\t}\n\t};\n\n\twhile (pending.length > 0) {\n\t\tconst current = pending.pop();\n\t\tdataNodes++;\n\t\tif (dataNodes > MAX_DATA_NODES) {\n\t\t\tthrow new RangeError(`${label} exceeds the maximum data node count`);\n\t\t}\n\n\t\tif (typeof current === \"string\") {\n\t\t\tif (current.length > MAX_STRING_LENGTH) {\n\t\t\t\tthrow new RangeError(`${label} contains a string that exceeds the maximum length`);\n\t\t\t}\n\t\t\tdataSize += current.length + 8;\n\t\t} else if (current === null \|\| (typeof current !== \"object\" && typeof current !== \"function\")) {\n\t\t\tdataSize += 8;\n\t\t\tcontinue;\n\t\t} else if (typeof current === \"function\" \|\| seen.has(current)) {\n\t\t\tcontinue;\n\t\t} else {\n\t\t\tseen.add(current);\n\t\t\tdataSize += 16;\n\t\t\tif (current instanceof ArrayBuffer \|\| ArrayBuffer.isView(current)) {\n\t\t\t\tdataSize += current.byteLength;\n\t\t\t} else if (Array.isArray(current)) {\n\t\t\t\tif (current.length > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(`${label} contains an array that exceeds the maximum length`);\n\t\t\t\t}\n\t\t\t\tdataSize += current.length 8;\n\t\t\t\tenqueueProperties(current);\n\t\t\t} else if (current instanceof Map) {\n\t\t\t\tif (current.size > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(`${label} contains a map that exceeds the maximum size`);\n\t\t\t\t}\n\t\t\t\tdataSize += current.size * 16;\n\t\t\t\tMap.prototype.forEach.call(current, (item, key) => pending.push(key, item));\n\t\t\t} else if (current instanceof Set) {\n\t\t\t\tif (current.size > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(`${label} contains a set that exceeds the maximum size`);\n\t\t\t\t}\n\t\t\t\tdataSize += current.size * 8;\n\t\t\t\tSet.prototype.forEach.call(current, (item) => pending.push(item));\n\t\t\t} else {\n\t\t\t\tenqueueProperties(current);\n\t\t\t}\n\t\t}\n\n\t\tif (dataSize > MAX_BUFFER_BYTES) {\n\t\t\tthrow new RangeError(`${label} exceeds the maximum data size`);\n\t\t}\n\t}\n\treturn { dataSize, dataNodes };\n}\n\nconst BINARY_OPERATION_MAP = {\n\t\"+\": (a, b) => a + b,\n\t\"-\": (a, b) => a - b,\n\t\"\": (a, b) => a b,\n\t\"\": (a, b) => a b,\n\t\"==\": (a, b) => a == b,\n\t\"===\": (a, b) => a === b,\n\t\"!=\": (a, b) => a != b,\n\t\"!==\": (a, b) => a !== b,\n\t\">\": (a, b) => a > b,\n\t\">=\": (a, b) => a >= b,\n\t\"<\": (a, b) => a < b,\n\t\"<=\": (a, b) => a <= b,\n\t\"%\": (a, b) => a % b,\n\t\"/\": (a, b) => a / b,\n\t\"\|\": (a, b) => a \| b,\n\t\"&\": (a, b) => a & b,\n\t\"^\": (a, b) => a ^ b,\n\t\"<<\": (a, b) => a << b,\n\t\">>\": (a, b) => a >> b,\n\t\">>>\": (a, b) => a >>> b,\n\tin: (a, b) => a in b,\n\tinstanceof: (a, b) => a instanceof b,\n};\n\nfunction createGlobalScope() {\n\tconst scope = Object.create(null);\n\tconst { builtin } = globals;\n\n\tfor (const key in builtin) {\n\t\tif (blockedGlobalBuiltIns.includes(key)) {\n\t\t\tcontinue;\n\t\t}\n\n\t\t/** @type {boolean} /\n\t\tconst isWritable = builtin[key];\n\n\t\tObject.defineProperty(scope, key, {\n\t\t\tvalue: globalThis[key],\n\t\t\twritable: isWritable,\n\t\t\tenumerable: false,\n\t\t\tconfigurable: false,\n\t\t});\n\t}\n\n\tObject.defineProperty(scope, \"globalThis\", {\n\t\tvalue: scope,\n\t\twritable: false,\n\t\tenumerable: false,\n\t\tconfigurable: false,\n\t});\n\n\treturn scope;\n}\n\nconst getBlockedMethods = (() => {\n\t/\n\t @type {Map<Function, string>}\n\t /\n\tlet BLOCKED_METHODS = null;\n\n\treturn () => {\n\t\tif (BLOCKED_METHODS) return BLOCKED_METHODS;\n\n\t\tconst map = new Map();\n\t\tfor (const path of blockedMethods) {\n\t\t\tconst [object, ...properties] = path.split(\".\");\n\t\t\tlet current = globalThis[object];\n\t\t\tfor (const prop of properties) {\n\t\t\t\tif (current && Object.hasOwn(current, prop)) {\n\t\t\t\t\tcurrent = current[prop];\n\t\t\t\t} else {\n\t\t\t\t\tcurrent = null;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (typeof current === \"function\") map.set(current, path);\n\t\t}\n\t\tBLOCKED_METHODS = map;\n\n\t\treturn BLOCKED_METHODS;\n\t};\n})();\n\n/\n A JavaScript expression evaluator that safely evaluates expressions within a sandboxed environment.\n * Supports various JavaScript features including arithmetic, logical operations, functions, and more.\n \n Security features:\n * - Blocks mutable methods to prevent side effects\n * - No access to eval() or Function() constructor\n * - Sandboxed scope with limited global objects\n \n @example\n * const evaluator = new Evaluator({ x: 10, y: 20 });\n * evaluator.evaluate('x + y') // returns 30\n /\nexport class Evaluator {\n\t/\n\t Creates a new Evaluator instance with a custom variable context.\n\t * The scope hierarchy is: user variables -> global scope\n\t * @param {Object} [variables={}] - An optional object containing variables to make available in the evaluation context\n\t * @param {Object} [options={}] - Additional configuration options\n\t * @param {number} [options.maxInputLength=10000] - Maximum expression length (hard maximum: 100000)\n\t * @param {number} [options.maxEvaluationSteps=10000] - Maximum AST node visits per evaluation (hard maximum: 100000)\n\t /\n\tconstructor(variables = Object.create(null), options) {\n\t\tthis.maxInputLength = validateLimit(options?.maxInputLength, \"maxInputLength\", DEFAULT_MAX_INPUT_LENGTH, MAX_CONFIGURABLE_INPUT_LENGTH);\n\t\tthis.maxEvaluationSteps = validateLimit(options?.maxEvaluationSteps, \"maxEvaluationSteps\", DEFAULT_MAX_EVALUATION_STEPS, MAX_CONFIGURABLE_EVALUATION_STEPS);\n\t\tassertBoundedData(variables, \"Evaluation context\");\n\t\tconst clonedVariables = structuredClone(variables);\n\t\tthis.scopes = [clonedVariables, createGlobalScope()].filter((scope) => scope !== null && scope !== undefined);\n\t\tthis.source = undefined;\n\t\tthis.remainingEvaluationSteps = 0;\n\t\tthis.remainingDataSize = MAX_BUFFER_BYTES;\n\t\tthis.remainingDataNodes = MAX_DATA_NODES;\n\t}\n\n\t/\n\t Evaluates a JavaScript expression with an optional context.\n\t * @param {string} expression\n\t * @param {unknown} [context]\n\t * @returns\n\t /\n\tstatic evaluate(expression, context) {\n\t\tconst evaluator = new Evaluator(context);\n\t\treturn evaluator.evaluate(expression);\n\t}\n\n\t/\n\t Parses and evaluates a JavaScript expression using acorn parser.\n\t * @param {string} expression - The JavaScript expression to evaluate\n\t * @returns {} The result of the evaluation\n\t @throws {SyntaxError} If the expression has invalid syntax\n\t * @throws {ReferenceError} If referencing undefined variables\n\t * @throws {TypeError} If performing invalid operations\n\t /\n\tevaluate(expression) {\n\t\tif (typeof expression !== \"string\") {\n\t\t\tthrow new TypeError(\"Expression must be a string\");\n\t\t}\n\n\t\tif (expression.length > this.maxInputLength) {\n\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.EXPRESSION_TOO_LONG, [this.maxInputLength]));\n\t\t}\n\n\t\tthis.source = expression;\n\t\tthis.remainingEvaluationSteps = this.maxEvaluationSteps;\n\t\tthis.remainingDataSize = MAX_BUFFER_BYTES;\n\t\tthis.remainingDataNodes = MAX_DATA_NODES;\n\n\t\tconst ast = acorn.parse(expression, { ecmaVersion: \"latest\" });\n\n\t\t// Start recursive evaluation from the root node\n\t\ttry {\n\t\t\treturn this.execute(ast.body);\n\t\t} finally {\n\t\t\tthis.source = undefined;\n\t\t}\n\t}\n\n\t/\n\t Executes an array of AST body nodes sequentially.\n\t * @private\n\t * @param {Array} body - Array of AST nodes to execute\n\t * @returns {} The result of the last executed node\n\t /\n\texecute(body) {\n\t\tif (this.remainingEvaluationSteps === 0) {\n\t\t\tthis.remainingEvaluationSteps = this.maxEvaluationSteps;\n\t\t\tthis.remainingDataSize = MAX_BUFFER_BYTES;\n\t\t\tthis.remainingDataNodes = MAX_DATA_NODES;\n\t\t}\n\t\tlet result;\n\n\t\tfor (const node of body) {\n\t\t\tresult = this.visit(node);\n\t\t}\n\n\t\tif (typeof result === \"function\") {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Returning functions from expressions\"]));\n\t\t}\n\n\t\tassertBoundedData(result, \"Evaluation result\");\n\n\t\t// A leaked Promise schedules sandbox callbacks (and rejection errors)\n\t\t// in the host microtask queue, outside the caller's try/catch. Never\n\t\t// allow one to escape evaluate() as a value.\n\t\tif (result instanceof Promise) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Returning promises from expressions\"]));\n\t\t}\n\n\t\t// Final gate: the return value must be cloneable, pure data. A\n\t\t// function (or any non-cloneable object) smuggled inside an object or\n\t\t// array - no matter how deeply nested - fails structuredClone with a\n\t\t// DataCloneError. Without this, closures could escape evaluate() (e.g.\n\t\t// `({ f: () => secret })`) and keep reading the evaluator's scopes\n\t\t// (and host-passed objects) long after evaluate() returned. Cloning\n\t\t// also hands the host a copy instead of a reference to sandbox\n\t\t// internals, and it rejects WeakRef/FinalizationRegistry/Proxy and\n\t\t// other host-only objects.\n\t\ttry {\n\t\t\treturn structuredClone(result);\n\t\t} catch (error) {\n\t\t\tif (error && error.name === \"DataCloneError\") {\n\t\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Returning non-cloneable values from expressions\"]));\n\t\t\t}\n\t\t\tthrow error;\n\t\t}\n\t}\n\n\t/*\n\t Visits an AST node and delegates to the appropriate handler based on node type.\n\t * @private\n\t * @param {import(\"acorn\").Node} node - The AST node to visit\n\t * @returns {} The result of visiting the node\n\t /\n\tvisit(node) {\n\t\tthis.remainingEvaluationSteps--;\n\t\tif (this.remainingEvaluationSteps < 0) {\n\t\t\tthrow new RangeError(\"Evaluation step limit exceeded\");\n\t\t}\n\n\t\tswitch (node.type) {\n\t\t\tcase \"ExpressionStatement\": {\n\t\t\t\treturn this.visit(node.expression);\n\t\t\t}\n\t\t\tcase \"BinaryExpression\": {\n\t\t\t\treturn this.handleBinaryExpression(node);\n\t\t\t}\n\t\t\tcase \"LogicalExpression\": {\n\t\t\t\treturn this.handleLogicalExpression(node);\n\t\t\t}\n\t\t\tcase \"UnaryExpression\": {\n\t\t\t\treturn this.handleUnaryExpression(node);\n\t\t\t}\n\t\t\tcase \"Identifier\": {\n\t\t\t\treturn this.handleIdentifier(node);\n\t\t\t}\n\t\t\tcase \"Literal\": {\n\t\t\t\treturn node.value;\n\t\t\t}\n\t\t\tcase \"MemberExpression\": {\n\t\t\t\treturn this.handleMemberExpression(node);\n\t\t\t}\n\t\t\tcase \"ArrayExpression\": {\n\t\t\t\treturn this.handleArrayExpression(node);\n\t\t\t}\n\t\t\tcase \"SpreadElement\": {\n\t\t\t\treturn this.handleSpreadElement(node);\n\t\t\t}\n\t\t\tcase \"ObjectExpression\": {\n\t\t\t\treturn this.handleObjectExpression(node);\n\t\t\t}\n\t\t\tcase \"FunctionExpression\": {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function expression\"]));\n\t\t\t}\n\t\t\tcase \"ArrowFunctionExpression\": {\n\t\t\t\treturn this.handleArrowFunctionExpression(node);\n\t\t\t}\n\t\t\tcase \"CallExpression\": {\n\t\t\t\treturn this.handleCallExpression(node);\n\t\t\t}\n\t\t\tcase \"ConditionalExpression\": {\n\t\t\t\treturn this.visit(node.test) ? this.visit(node.consequent) : this.visit(node.alternate);\n\t\t\t}\n\t\t\tcase \"NewExpression\": {\n\t\t\t\tif (node.callee.type !== \"Identifier\") {\n\t\t\t\t\tthrow new Error(`Unsupported callee type '${node.callee.type}' in new expression`);\n\t\t\t\t}\n\n\t\t\t\tif (node.callee.name === \"Function\") {\n\t\t\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"new Function() constructor\"]));\n\t\t\t\t}\n\n\t\t\t\t// Promise is fully removed from the sandbox; give a clear error\n\t\t\t\t// instead of a generic \"not defined\". Its executor runs\n\t\t\t\t// synchronously, but a throwing executor would turn into a\n\t\t\t\t// rejected Promise that escapes evaluate() and crashes the host.\n\t\t\t\tif (node.callee.name === \"Promise\") {\n\t\t\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Promise constructor\"]));\n\t\t\t\t}\n\t\t\t\tconst Constructor = this.visit(node.callee);\n\n\t\t\t\t// 仅在存在参数时构建数组\n\t\t\t\tconst args = node.arguments.length ? node.arguments.map((arg) => this.visit(arg)) : [];\n\t\t\t\tthis.assertBoundedConstruction(Constructor, args);\n\n\t\t\t\treturn new Constructor(...args);\n\t\t\t}\n\t\t\tcase \"ChainExpression\": {\n\t\t\t\treturn this.visit(node.expression);\n\t\t\t}\n\t\t\tcase \"TemplateLiteral\": {\n\t\t\t\treturn this.handleTemplateLiteral(node);\n\t\t\t}\n\t\t\tcase \"ThisExpression\": {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"'this' expression\"]));\n\t\t\t}\n\t\t\tcase \"WithStatement\": {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"'with' statement\"]));\n\t\t\t}\n\t\t\tdefault: {\n\t\t\t\tlet content = this.source.slice(node.start, node.end);\n\n\t\t\t\tif (content.length > 20) {\n\t\t\t\t\tcontent = content.slice(0, 17) + \"...\";\n\t\t\t\t}\n\n\t\t\t\tthrow new SyntaxError(`'${content}'` + \" \" + renderErrorMessage(ERROR_MESSAGES.IS_INVALID_SYNTAX, [content]));\n\t\t\t}\n\t\t}\n\t}\n\n\t/*\n\t Handles binary expressions (arithmetic and comparison operations).\n\t * @param {import('acorn').BinaryExpression} node\n\t * @private\n\t /\n\thandleBinaryExpression(node) {\n\t\tconst op = node.operator;\n\t\tconst left = this.visit(node.left);\n\t\tconst right = this.visit(node.right);\n\t\tif (op === \"+\" && (typeof left === \"string\" \|\| typeof right === \"string\")) {\n\t\t\tif (String(left).length + String(right).length > MAX_STRING_LENGTH) {\n\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t}\n\t\t}\n\t\tif (typeof left === \"bigint\" && typeof right === \"bigint\") {\n\t\t\tif (op === \"\" && (right > MAX_BIGINT_EXPONENT \|\| right < 0n)) {\n\t\t\t\tthrow new RangeError(`BigInt exponent must be between 0 and ${MAX_BIGINT_EXPONENT}`);\n\t\t\t}\n\t\t\tconst leftBits = left.toString(2).length;\n\t\t\tconst rightBits = right.toString(2).length;\n\t\t\tif (\n\t\t\t\t(op === \"\" && leftBits Number(right) > MAX_BIGINT_BITS) \|\|\n\t\t\t\t(op === \"<<\" && right > BigInt(MAX_BIGINT_BITS)) \|\|\n\t\t\t\t(op === \"<<\" && right >= 0n && leftBits + Number(right) > MAX_BIGINT_BITS) \|\|\n\t\t\t\t(op === \"\" && leftBits + rightBits > MAX_BIGINT_BITS) \|\|\n\t\t\t\t((op === \"+\" \|\| op === \"-\") && Math.max(leftBits, rightBits) + 1 > MAX_BIGINT_BITS)\n\t\t\t) {\n\t\t\t\tthrow new RangeError(\"BigInt result exceeds the maximum allowed size\");\n\t\t\t}\n\t\t}\n\n\t\tif (BINARY_OPERATION_MAP.hasOwnProperty(op)) {\n\t\t\treturn BINARY_OPERATION_MAP[op](left, right);\n\t\t}\n\n\t\tthrow new SyntaxError(`Unsupported operator: ${node.operator}`);\n\t}\n\n\tassertBoundedConstruction(Constructor, args) {\n\t\tconst size = args[0];\n\t\tif (Constructor === Array && args.length === 1 && typeof size === \"number\" && size > MAX_ARRAY_LENGTH) {\n\t\t\tthrow new RangeError(\"Array length exceeds the maximum allowed length\");\n\t\t}\n\t\tif (Constructor === ArrayBuffer && (size > MAX_BUFFER_BYTES \|\| args[1]?.maxByteLength > MAX_BUFFER_BYTES)) {\n\t\t\tthrow new RangeError(\"ArrayBuffer size exceeds the maximum allowed size\");\n\t\t}\n\t\tif (Constructor === DataView && size instanceof ArrayBuffer && size.byteLength > MAX_BUFFER_BYTES) {\n\t\t\tthrow new RangeError(\"DataView size exceeds the maximum allowed size\");\n\t\t}\n\t\tif (Constructor === Map \|\| Constructor === Set) {\n\t\t\tconst collectionSize = typeof size === \"string\" \|\| Array.isArray(size) ? size.length : size?.size ?? size?.length;\n\t\t\tif (typeof collectionSize === \"number\" && collectionSize > MAX_ARRAY_LENGTH) {\n\t\t\t\tthrow new RangeError(\"Collection source exceeds the maximum allowed size\");\n\t\t\t}\n\t\t}\n\t\tif (TYPED_ARRAY_CONSTRUCTORS.has(Constructor)) {\n\t\t\tlet byteLength;\n\t\t\tif (size instanceof ArrayBuffer) {\n\t\t\t\tconst offset = args[1] ?? 0;\n\t\t\t\tconst elementCount = args[2] ?? Math.floor((size.byteLength - offset) / Constructor.BYTES_PER_ELEMENT);\n\t\t\t\tbyteLength = elementCount Constructor.BYTES_PER_ELEMENT;\n\t\t\t} else {\n\t\t\t\tconst elementCount = typeof size === \"number\" ? size : size?.length ?? 0;\n\t\t\t\tbyteLength = elementCount * Constructor.BYTES_PER_ELEMENT;\n\t\t\t}\n\t\t\tif (byteLength > MAX_BUFFER_BYTES) {\n\t\t\t\tthrow new RangeError(\"Typed array size exceeds the maximum allowed size\");\n\t\t\t}\n\t\t}\n\t}\n\n\t/*\n\t Handles logical expressions (&&, \|\|, ??).\n\t * Implements proper short-circuit evaluation for performance.\n\t * @private\n\t /\n\thandleLogicalExpression(node) {\n\t\tswitch (node.operator) {\n\t\t\tcase \"&&\": {\n\t\t\t\tconst left = this.visit(node.left);\n\t\t\t\treturn left ? this.visit(node.right) : left;\n\t\t\t}\n\t\t\tcase \"\|\|\": {\n\t\t\t\tconst left = this.visit(node.left);\n\t\t\t\treturn left ? left : this.visit(node.right);\n\t\t\t}\n\t\t\tcase \"??\": {\n\t\t\t\tconst left = this.visit(node.left);\n\t\t\t\treturn left !== null && left !== undefined ? left : this.visit(node.right);\n\t\t\t}\n\t\t\tdefault: {\n\t\t\t\tthrow new SyntaxError(`Unsupported logical operator: ${node.operator}`);\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t Handles unary expressions (-, +, !, ~, typeof, void).\n\t * @private\n\t /\n\thandleUnaryExpression(node) {\n\t\tswitch (node.operator) {\n\t\t\tcase \"-\": {\n\t\t\t\treturn -this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"+\": {\n\t\t\t\treturn +this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"!\": {\n\t\t\t\treturn !this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"~\": {\n\t\t\t\treturn ~this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"typeof\": {\n\t\t\t\treturn typeof this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"void\": {\n\t\t\t\treturn void this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"delete\": {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Delete operator\"]));\n\t\t\t}\n\t\t\tdefault: {\n\t\t\t\tthrow new SyntaxError(`Unsupported unary operator: ${node.operator}`);\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t Handles identifier (variable) lookups in the scope chain.\n\t * @private\n\t /\n\thandleIdentifier(node) {\n\t\tconst name = node.name;\n\t\tfor (const scope of this.scopes) {\n\t\t\tif (Object.hasOwn(scope, name)) {\n\t\t\t\treturn scope[name];\n\t\t\t}\n\t\t}\n\n\t\tthrow new ReferenceError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_DEFINED, [name]));\n\t}\n\n\t/\n\t Handles member expressions (property access like obj.prop or obj[prop]).\n\t * @private\n\t /\n\thandleMemberExpression(node, objectValue = NO_OBJECT) {\n\t\tconst object = objectValue === NO_OBJECT ? this.visit(node.object) : objectValue;\n\t\t// Determine property name: either identifier name or computed value\n\t\tconst isStaticProperty = node.property.type === \"Identifier\" && !node.computed;\n\t\tconst property = isStaticProperty ? node.property.name : this.visit(node.property);\n\n\t\t// Reading `.stack` on an Error instance forces V8 to materialize the\n\t\t// stack, which invokes a host-installed Error.prepareStackTrace with\n\t\t// sandbox-owned values. Block it before* any property access, since\n\t\t// even the prototype check below would trigger the getter.\n\t\tif (property === \"stack\" && object instanceof Error) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Accessing error stack\"]));\n\t\t}\n\n\t\t// Prevent access to prototype properties\n\t\tif (typeof object !== \"undefined\" && object !== null && object[property] === object?.__proto__) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Accessing prototype properties\"]));\n\t\t}\n\n\t\tif (object === null \|\| object === undefined) {\n\t\t\t// optional chaining\n\t\t\tif (node.optional) {\n\t\t\t\treturn void 0;\n\t\t\t}\n\t\t\tthrow new TypeError(renderErrorMessage(ERROR_MESSAGES.CAN_NOT_READ_PROPERTY, [object, property]));\n\t\t}\n\n\t\tconst result = object[property];\n\n\t\t// The Function constructor must never be reachable from an expression.\n\t\t// If it escapes as a value, native callbacks (e.g. Promise.then,\n\t\t// Array.prototype.map) invoke it outside the interpreter's call path,\n\t\t// enabling arbitrary host code execution. This is a structural guard:\n\t\t// no matter how many `.constructor` hops an expression takes, the\n\t\t// final value can never be `Function` (or its prototype).\n\t\tif (result === Function \|\| result === Function.prototype) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function constructor\"]));\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/*\n\t Handles array literal expressions.\n\t * @private\n\t /\n\thandleArrayExpression(node) {\n\t\tconst result = [];\n\n\t\tfor (let i = 0; i < node.elements.length; i++) {\n\t\t\tconst element = node.elements.at(i);\n\n\t\t\t// Array holes (`[1, , 3]`) are represented as null elements by\n\t\t\t// acorn. Preserve them instead of crashing on node.type access.\n\t\t\tif (element === null) {\n\t\t\t\tresult.length++;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst value = this.visit(element);\n\n\t\t\tif (element.type === \"SpreadElement\") {\n\t\t\t\tthis.assertBoundedSpread(result.length, value);\n\t\t\t\tresult.push(...value);\n\t\t\t} else {\n\t\t\t\tresult.push(value);\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n\n\tassertBoundedSpread(currentLength, value) {\n\t\tconst size = typeof value === \"string\" \|\| Array.isArray(value) ? value.length : value?.size;\n\t\tif (typeof size === \"number\" && currentLength + size > MAX_ARRAY_LENGTH) {\n\t\t\tthrow new RangeError(\"Spread value exceeds the maximum allowed length\");\n\t\t}\n\t}\n\n\t/\n\t Handles object literal expressions.\n\t * @returns\n\t /\n\thandleObjectExpression(node) {\n\t\tconst obj = {};\n\t\tlet spreadPropertyCount = 0;\n\t\tfor (const prop of node.properties) {\n\t\t\tif (prop.type === \"SpreadElement\") {\n\t\t\t\tconst spreadValue = this.visit(prop.argument);\n\t\t\t\tspreadPropertyCount += Object.keys(spreadValue).length;\n\t\t\t\tif (spreadPropertyCount > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(\"Object spread exceeds the maximum allowed property count\");\n\t\t\t\t}\n\t\t\t\tObject.assign(obj, spreadValue);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// Computed keys must be evaluated* (`{ [1 + 1]: v }` -> key \"2\"),\n\t\t\t// not taken from the property name. Non-computed keys keep the\n\t\t\t// literal `__proto__: v` semantics (which sets the prototype via\n\t\t\t// the Object.prototype.__proto__ setter), while computed keys are\n\t\t\t// plain properties: `{ [\"__proto__\"]: v }` must NOT touch the\n\t\t\t// prototype.\n\t\t\tconst key = prop.computed ? this.visit(prop.key) : prop.key.name \|\| prop.key.value;\n\t\t\tconst value = this.visit(prop.value);\n\t\t\tif (prop.computed) {\n\t\t\t\tObject.defineProperty(obj, key, { value, writable: true, enumerable: true, configurable: true });\n\t\t\t} else {\n\t\t\t\tobj[key] = value;\n\t\t\t}\n\t\t}\n\t\treturn obj;\n\t}\n\n\thandleSpreadElement(node) {\n\t\treturn this.visit(node.argument);\n\t}\n\n\t/*\n\t Handles arrow function expressions.\n\t * Creates a closure that captures the current scope and executes the function body\n\t * with parameters bound to a new scope.\n\t * @private\n\t /\n\thandleArrowFunctionExpression(node) {\n\t\treturn (...args) => {\n\t\t\t// Create new scope with parameters bound to arguments\n\t\t\tconst newScope = {};\n\t\t\tconst paramCount = node.params.length;\n\t\t\tfor (let i = 0; i < paramCount; i++) {\n\t\t\t\tnewScope[node.params[i].name] = args[i];\n\t\t\t}\n\n\t\t\t// Push new scope, evaluate body, then pop scope. The scope must be\n\t\t\t// popped even when the body throws: a leaked scope would make the\n\t\t\t// parameter bindings visible to subsequent evaluations on the same\n\t\t\t// instance.\n\t\t\tthis.scopes.unshift(newScope);\n\t\t\ttry {\n\t\t\t\tconst result = this.visit(node.body);\n\t\t\t\tthis.consumeEvaluationValue(result);\n\t\t\t\treturn result;\n\t\t\t} finally {\n\t\t\t\tthis.scopes.shift();\n\t\t\t}\n\t\t};\n\t}\n\n\tconsumeEvaluationValue(value) {\n\t\tconst { dataSize, dataNodes } = assertBoundedData(value, \"Intermediate evaluation result\");\n\t\tthis.remainingDataSize -= dataSize;\n\t\tthis.remainingDataNodes -= dataNodes;\n\t\tif (this.remainingDataSize < 0 \|\| this.remainingDataNodes < 0) {\n\t\t\tthrow new RangeError(\"Evaluation allocation budget exceeded\");\n\t\t}\n\t}\n\n\t/\n\t Handles function call expressions, including optional chaining.\n\t * @private\n\t /\n\thandleCallExpression(node) {\n\t\tconst isOptional = node.optional \|\| (node.callee.type === \"MemberExpression\" && node.callee.optional);\n\t\tlet func;\n\t\tlet target = null;\n\n\t\tif (node.callee.type === \"MemberExpression\") {\n\t\t\t// Evaluate the object expression exactly once, then resolve the\n\t\t\t// property through handleMemberExpression so that all of its\n\t\t\t// guards (.stack access, prototype access, Function constructor)\n\t\t\t// still apply. Visiting the whole callee and then the object again\n\t\t\t// would double-evaluate side-effecting expressions such as\n\t\t\t// `new Date(1000).getTime()` or `f().g()`.\n\t\t\ttarget = this.visit(node.callee.object);\n\t\t\tfunc = this.handleMemberExpression(node.callee, target);\n\t\t} else {\n\t\t\tfunc = this.visit(node.callee);\n\t\t}\n\n\t\tif ((func === undefined \|\| func === null) && isOptional) {\n\t\t\treturn void 0;\n\t\t}\n\n\t\tif (func === Function) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function constructor\"]));\n\t\t}\n\t\t// Error.prepareStackTrace is a host-installed callback. It must be\n\t\t// checked dynamically: the blocked-methods map is built lazily on first\n\t\t// use, so a host that installs the callback after* that point would\n\t\t// otherwise evade the static blocklist.\n\t\tif (func === Error.prepareStackTrace) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Error.prepareStackTrace\"]));\n\t\t}\n\n\t\tif (getBlockedMethods().has(func)) {\n\t\t\tconst path = getBlockedMethods().get(func);\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [path]));\n\t\t}\n\n\t\t// 仅在存在参数时构建数组\n\t\tconst args = (() => {\n\t\t\tif (node.arguments.length === 0) {\n\t\t\t\treturn [];\n\t\t\t}\n\n\t\t\tlet result = [];\n\n\t\t\tfor (let i = 0; i < node.arguments.length; i++) {\n\t\t\t\tconst element = node.arguments.at(i);\n\t\t\t\tconst value = this.visit(element);\n\n\t\t\t\tif (element.type === \"SpreadElement\") {\n\t\t\t\t\tthis.assertBoundedSpread(result.length, value);\n\t\t\t\t\tresult.push(...value);\n\t\t\t\t} else {\n\t\t\t\t\tresult.push(value);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t})();\n\n\t\t// Defense in depth: even if a `Function` reference were somehow\n\t\t// produced by an expression, it must not be passed as an argument.\n\t\t// Native methods (Promise.then, Array.prototype.map, ...) would\n\t\t// invoke it in the host runtime, outside this interpreter's checks.\n\t\tif (args.some((arg) => arg === Function)) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function constructor\"]));\n\t\t}\n\t\tif (typeof target === \"string\") {\n\t\t\tif (String.prototype.repeat && func === String.prototype.repeat && target.length * Number(args[0]) > MAX_STRING_LENGTH) {\n\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t}\n\t\t\tif ((String.prototype.padStart && func === String.prototype.padStart \|\| func === String.prototype.padEnd) && Number(args[0]) > MAX_STRING_LENGTH) {\n\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t}\n\t\t\tif (String.prototype.concat && func === String.prototype.concat) {\n\t\t\t\tconst resultLength = target.length + args.reduce((length, value) => length + String(value).length, 0);\n\t\t\t\tif (resultLength > MAX_STRING_LENGTH) {\n\t\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ((String.prototype.replace && func === String.prototype.replace) \|\| (String.prototype.replaceAll && func === String.prototype.replaceAll)) {\n\t\t\t\tif (typeof args[0] === \"string\") {\n\t\t\t\t\tif (typeof args[1] === \"function\" \|\| (typeof args[1] === \"string\" && /\\$(?:[$&'`])/u.test(args[1]))) {\n\t\t\t\t\t\tthrow new Error(\"Only literal string replacements are allowed\");\n\t\t\t\t\t}\n\t\t\t\t\tif (target.length * Math.max(1, args[0].length) > 10000000) {\n\t\t\t\t\t\tthrow new RangeError(\"String operation exceeds the maximum work limit\");\n\t\t\t\t\t}\n\t\t\t\t\tconst matchCount = countLiteralMatches(target, args[0], func === String.prototype.replaceAll);\n\t\t\t\t\tif (target.length + matchCount * String(args[1]).length > MAX_STRING_LENGTH) {\n\t\t\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (func === String.prototype.split) {\n\t\t\t\tif (args[0] === \"\" && target.length > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(\"Split result exceeds the maximum allowed length\");\n\t\t\t\t}\n\t\t\t\tif (typeof args[0] === \"string\" && args[0] !== \"\" && countLiteralMatches(target, args[0], true) >= MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(\"Split result exceeds the maximum allowed length\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif ((target === Array \|\| TYPED_ARRAY_CONSTRUCTORS.has(target)) && func === target.from) {\n\t\t\tconst source = args[0];\n\t\t\tconst size = typeof source === \"string\" \|\| Array.isArray(source) ? source.length : source?.size ?? source?.length;\n\t\t\tif (typeof size === \"number\" && size > MAX_ARRAY_LENGTH) {\n\t\t\t\tthrow new RangeError(\"Array.from source exceeds the maximum allowed length\");\n\t\t\t}\n\t\t}\n\n\t\tif (typeof func !== \"function\") {\n\t\t\tconst calledString = getNodeString(node.callee);\n\t\t\tthrow new TypeError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_FUNCTION, [calledString]));\n\t\t}\n\n\t\tconst result = func.apply(target, args);\n\n\t\t// Defense in depth: never let a Promise escape as a call result. Its\n\t\t// settlement callbacks run in the host microtask queue, where errors\n\t\t// bypass the caller's synchronous try/catch entirely.\n\t\tif (result instanceof Promise) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Returning promises from expressions\"]));\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/*\n\t Handles template literal expressions.\n\t * More efficient implementation that interleaves quasis and expressions without sorting.\n\t * @private\n\t /\n\thandleTemplateLiteral(node) {\n\t\tlet result = \"\";\n\t\tconst expressionCount = node.expressions.length;\n\n\t\tfor (let i = 0; i < node.quasis.length; i++) {\n\t\t\tresult += node.quasis[i].value.raw;\n\t\t\tif (i < expressionCount) {\n\t\t\t\tresult += this.visit(node.expressions[i]);\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n}\n\n/\n \n * @param {import('acorn').Node} node\n * @returns\n /\nexport function getNodeString(node) {\n\tswitch (node.type) {\n\t\tcase \"Identifier\": {\n\t\t\treturn node.name;\n\t\t}\n\t\tcase \"Literal\": {\n\t\t\treturn node.raw;\n\t\t}\n\t\tcase \"ArrayExpression\": {\n\t\t\treturn `[${node.elements.map((child) => getNodeString(child)).join(\",\")}]`;\n\t\t}\n\t\tcase \"ObjectExpression\": {\n\t\t\t// if keys is empty\n\t\t\tif (node.properties.length === 0) {\n\t\t\t\treturn \"{}\";\n\t\t\t}\n\n\t\t\treturn \"{(intermediate value)}\";\n\t\t}\n\t\tcase \"MemberExpression\": {\n\t\t\tconst objectStr = getNodeString(node.object);\n\t\t\tconst propertyStr = getNodeString(node.property);\n\n\t\t\tif (node.computed) {\n\t\t\t\treturn `${objectStr}[${propertyStr}]`;\n\t\t\t}\n\t\t\treturn `${objectStr}.${propertyStr}`;\n\t\t}\n\t\tdefault: {\n\t\t\treturn null;\n\t\t}\n\t}\n}\n","/\n 简单状态机模板解析器\n * 能够正确处理表达式中包含字符串、转义字符和结束标记的情况\n * @class SimpleStateTemplateParser\n /\nconst DEFAULT_MAX_TEMPLATE_LENGTH = 100000;\nconst MAX_CONFIGURABLE_TEMPLATE_LENGTH = 1000000;\nconst DEFAULT_MAX_TOKENS = 1000;\nconst MAX_CONFIGURABLE_TOKENS = 10000;\n\nfunction validateLimit(value, name, defaultValue, maximum) {\n\tif (value === undefined) {\n\t\treturn defaultValue;\n\t}\n\tif (!Number.isSafeInteger(value) \|\| value < 1 \|\| value > maximum) {\n\t\tthrow new RangeError(`${name} must be an integer between 1 and ${maximum}`);\n\t}\n\treturn value;\n}\n\nclass TemplateParser {\n\t/\n\t 创建解析器实例\n\t * @param {Object} [options] - 配置选项\n\t * @param {string} [options.expressionStart='{{'] - 表达式开始标记\n\t * @param {string} [options.expressionEnd='}}'] - 表达式结束标记\n\t * @param {boolean} [options.preserveWhitespace=true] - 是否保留表达式周围的空白字符\n\t /\n\tconstructor(options = {}) {\n\t\toptions ??= {};\n\t\tthis.maxTemplateLength = validateLimit(options.maxTemplateLength, \"maxTemplateLength\", DEFAULT_MAX_TEMPLATE_LENGTH, MAX_CONFIGURABLE_TEMPLATE_LENGTH);\n\t\tthis.maxTokens = validateLimit(options.maxTokens, \"maxTokens\", DEFAULT_MAX_TOKENS, MAX_CONFIGURABLE_TOKENS);\n\t\tif (options.expressionStart !== undefined && (typeof options.expressionStart !== \"string\" \|\| options.expressionStart.length === 0 \|\| options.expressionStart.length > 128)) {\n\t\t\tthrow new TypeError(\"expressionStart must be a non-empty string of at most 128 characters\");\n\t\t}\n\t\tif (options.expressionEnd !== undefined && (typeof options.expressionEnd !== \"string\" \|\| options.expressionEnd.length === 0 \|\| options.expressionEnd.length > 128)) {\n\t\t\tthrow new TypeError(\"expressionEnd must be a non-empty string of at most 128 characters\");\n\t\t}\n\t\t// 表达式标记配置\n\t\tthis.exprStart = options.expressionStart \|\| \"{{\";\n\t\tthis.exprEnd = options.expressionEnd \|\| \"}}\";\n\n\t\t// 标记长度缓存，避免重复计算\n\t\tthis.startLen = this.exprStart.length;\n\t\tthis.endLen = this.exprEnd.length;\n\n\t\t// 其他配置\n\t\tthis.preserveWhitespace = options.preserveWhitespace === true;\n\t}\n\n\t/\n\t 解析模板字符串，将其转换为 token 数组\n\t * @param {string} template - 要解析的模板字符串\n\t * @returns {Array<{type: string, value: string}>} token 数组\n\t /\n\tparse(template) {\n\t\t// 输入验证\n\t\tif (typeof template !== \"string\") {\n\t\t\tthrow new TypeError(\"模板必须是字符串\");\n\t\t}\n\t\tif (template.length > this.maxTemplateLength) {\n\t\t\tthrow new RangeError(`Template exceeds the maximum length of ${this.maxTemplateLength} characters`);\n\t\t}\n\n\t\tconst tokens = []; // 存储解析结果的 token 数组\n\t\tconst pushToken = (token) => {\n\t\t\tif (tokens.length >= this.maxTokens) {\n\t\t\t\tthrow new RangeError(`Template exceeds the maximum token count of ${this.maxTokens}`);\n\t\t\t}\n\t\t\ttokens.push(token);\n\t\t};\n\t\tconst length = template.length;\n\n\t\t// 状态机变量\n\t\tlet state = \"TEXT\"; // 当前状态：TEXT \| EXPR \| STRING_SQ \| STRING_DQ \| TEMPLATE \| ESCAPE_\n\t\tlet buffer = \"\"; // 当前状态的字符缓冲区\n\t\tlet exprStartPos = 0; // 当前表达式的开始位置（用于错误恢复）\n\t\tlet pos = 0; // 当前扫描位置\n\n\t\t// 主解析循环：逐个字符扫描模板\n\t\twhile (pos < length) {\n\t\t\tconst char = template[pos];\n\t\t\tconst nextChar = template[pos + 1];\n\n\t\t\t// 状态机核心逻辑\n\t\t\tswitch (state) {\n\t\t\t\t// ==================== 文本状态 ====================\n\t\t\t\tcase \"TEXT\":\n\t\t\t\t\t// 检查是否遇到表达式开始标记\n\t\t\t\t\tif (this._isMatch(pos, template, this.exprStart)) {\n\t\t\t\t\t\t// 将缓冲区中的文本保存为 token\n\t\t\t\t\t\tif (buffer.length > 0) {\n\t\t\t\t\t\t\tpushToken({ type: \"text\", value: buffer, start: pos - buffer.length, end: pos });\n\t\t\t\t\t\t\tbuffer = \"\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// 切换到表达式状态\n\t\t\t\t\t\tstate = \"EXPR\";\n\t\t\t\t\t\texprStartPos = pos; // 记录表达式开始位置\n\t\t\t\t\t\tpos += this.startLen; // 跳过开始标记\n\t\t\t\t\t\tcontinue; // 继续处理下一个字符（跳过本次循环的剩余部分）\n\t\t\t\t\t}\n\t\t\t\t\t// 普通文本字符，添加到缓冲区\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\t// ==================== 表达式状态 ====================\n\t\t\t\tcase \"EXPR\":\n\t\t\t\t\t// 在表达式中，需要处理各种字符串和转义字符\n\t\t\t\t\tif (char === \"'\") {\n\t\t\t\t\t\t// 进入单引号字符串状态\n\t\t\t\t\t\tstate = \"STRING_SQ\";\n\t\t\t\t\t} else if (char === '\"') {\n\t\t\t\t\t\t// 进入双引号字符串状态\n\t\t\t\t\t\tstate = \"STRING_DQ\";\n\t\t\t\t\t} else if (char === \"`\") {\n\t\t\t\t\t\t// 进入模板字符串状态\n\t\t\t\t\t\tstate = \"TEMPLATE\";\n\t\t\t\t\t} else if (char === \"\\\\\") {\n\t\t\t\t\t\t// 遇到转义字符，根据当前上下文进入相应的转义状态\n\t\t\t\t\t\tif (nextChar === \"'\") state = \"ESCAPE_SQ\";\n\t\t\t\t\t\telse if (nextChar === '\"') state = \"ESCAPE_DQ\";\n\t\t\t\t\t\telse if (nextChar === \"`\") state = \"ESCAPE_TEMPLATE\";\n\t\t\t\t\t\telse state = \"ESCAPE_EXPR\";\n\t\t\t\t\t} else if (this._isMatch(pos, template, this.exprEnd)) {\n\t\t\t\t\t\t// 找到表达式结束标记，且不在字符串中\n\t\t\t\t\t\tconst exprValue = this.preserveWhitespace ? buffer : buffer.trim();\n\t\t\t\t\t\tif (exprValue.length > 0) {\n\t\t\t\t\t\t\tpushToken({\n\t\t\t\t\t\t\t\ttype: \"expression\",\n\t\t\t\t\t\t\t\tvalue: exprValue,\n\t\t\t\t\t\t\t\tstart: exprStartPos,\n\t\t\t\t\t\t\t\tend: pos + this.endLen,\n\t\t\t\t\t\t\t\tcontentStart: exprStartPos + this.startLen,\n\t\t\t\t\t\t\t\tcontentEnd: pos,\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// 重置状态，准备处理后续文本\n\t\t\t\t\t\tbuffer = \"\";\n\t\t\t\t\t\tstate = \"TEXT\";\n\t\t\t\t\t\tpos += this.endLen; // 跳过结束标记\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\t// 将当前字符添加到表达式缓冲区\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\t// ==================== 字符串状态 ====================\n\t\t\t\tcase \"STRING_SQ\": // 单引号字符串\n\t\t\t\t\tif (char === \"\\\\\") {\n\t\t\t\t\t\tstate = \"ESCAPE_SQ\"; // 遇到转义字符\n\t\t\t\t\t} else if (char === \"'\") {\n\t\t\t\t\t\tstate = \"EXPR\"; // 字符串结束，回到表达式状态\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"STRING_DQ\": // 双引号字符串\n\t\t\t\t\tif (char === \"\\\\\") {\n\t\t\t\t\t\tstate = \"ESCAPE_DQ\";\n\t\t\t\t\t} else if (char === '\"') {\n\t\t\t\t\t\tstate = \"EXPR\";\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"TEMPLATE\": // 模板字符串\n\t\t\t\t\tif (char === \"\\\\\") {\n\t\t\t\t\t\tstate = \"ESCAPE_TEMPLATE\";\n\t\t\t\t\t} else if (char === \"`\") {\n\t\t\t\t\t\tstate = \"EXPR\";\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\t// ==================== 转义状态 ====================\n\t\t\t\t// 转义状态：处理转义字符，然后返回到之前的状态\n\t\t\t\tcase \"ESCAPE_SQ\":\n\t\t\t\t\tbuffer += char; // 添加转义后的字符\n\t\t\t\t\tstate = \"STRING_SQ\"; // 回到单引号字符串状态\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"ESCAPE_DQ\":\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tstate = \"STRING_DQ\";\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"ESCAPE_TEMPLATE\":\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tstate = \"TEMPLATE\";\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"ESCAPE_EXPR\":\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tstate = \"EXPR\";\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// 移动到下一个字符\n\t\t\tpos++;\n\t\t}\n\n\t\t// ==================== 后处理 ====================\n\t\t// 处理扫描结束后缓冲区中剩余的内容\n\t\tif (buffer.length > 0) {\n\t\t\tif (state === \"TEXT\") {\n\t\t\t\t// 剩余的文本内容\n\t\t\t\tpushToken({ type: \"text\", value: buffer, start: pos - buffer.length, end: pos });\n\t\t\t} else {\n\t\t\t\t// 未完成的表达式，将其作为普通文本处理\n\t\t\t\tconst incompleteExpr = this.exprStart + buffer;\n\t\t\t\tpushToken({ type: \"text\", value: incompleteExpr, start: exprStartPos, end: pos });\n\t\t\t}\n\t\t}\n\n\t\treturn tokens;\n\t}\n\n\t/*\n\t 检查指定位置是否匹配给定的字符序列\n\t * @param {number} pos - 开始检查的位置\n\t * @param {string} template - 模板字符串\n\t * @param {string} sequence - 要匹配的字符序列\n\t * @returns {boolean} 是否匹配\n\t * @private\n\t /\n\t_isMatch(pos, template, sequence) {\n\t\t// 检查剩余长度是否足够\n\t\tif (pos + sequence.length > template.length) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// 逐个字符比较\n\t\tfor (let i = 0; i < sequence.length; i++) {\n\t\t\tif (template[pos + i] !== sequence[i]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t 静态方法：快速解析模板\n\t * @param {string} template - 模板字符串\n\t * @param {Object} [options] - 配置选项\n\t * @returns {Array} token 数组\n\t /\n\tstatic parse(template, options) {\n\t\tconst parser = new TemplateParser(options);\n\t\treturn parser.parse(template);\n\t}\n}\n\nexport { TemplateParser };\n","import { Evaluator } from \"./Evaluator.js\";\nimport { TemplateParser } from \"./TemplateParser.js\";\n\nexport { Evaluator, TemplateParser };\n\nconst DEFAULT_MAX_TEMPLATE_EXPRESSIONS = 100;\nconst MAX_TEMPLATE_EXPRESSIONS = 1000;\nconst DEFAULT_MAX_TEMPLATE_OUTPUT_LENGTH = 100000;\nconst MAX_TEMPLATE_OUTPUT_LENGTH = 1000000;\n\nfunction validateLimit(value, name, defaultValue, maximum) {\n\tif (value === undefined) {\n\t\treturn defaultValue;\n\t}\n\tif (!Number.isSafeInteger(value) \|\| value < 1 \|\| value > maximum) {\n\t\tthrow new RangeError(`${name} must be an integer between 1 and ${maximum}`);\n\t}\n\treturn value;\n}\n\n/\n Evaluates a JavaScript expression with an optional context.\n * @param {string} expression - The JavaScript expression to evaluate\n * @param {unknown} [context] - Optional context object with variables to use in the expression\n * @returns {} The result of evaluating the expression\n @example\n * evalExpression('a + b', { a: 1, b: 2 }) // returns 3\n /\nexport function evalExpression(expression, context) {\n\treturn Evaluator.evaluate(expression, context);\n}\n\n/\n Evaluates a template string by replacing {{ expression }} patterns with their evaluated values.\n * Undefined variables in expressions are replaced with empty strings instead of throwing errors.\n * @param {string} template - The template string containing {{ expression }} patterns\n * @param {Object} [context] - Optional context object with variables to use in expressions\n * @param {Object} [templateParserOptions] - Optional options for the template parser\n * @returns {string} The template with all expressions evaluated and replaced\n * @example\n * evalTemplate('Hello {{ name }}!', { name: 'World' }) // returns 'Hello World!'\n */\nexport function evalTemplate(template, context, templateParserOptions) {\n\tconst options = templateParserOptions ?? {};\n\tconst maxExpressions = validateLimit(options.maxExpressions, \"maxExpressions\", DEFAULT_MAX_TEMPLATE_EXPRESSIONS, MAX_TEMPLATE_EXPRESSIONS);\n\tconst maxOutputLength = validateLimit(options.maxOutputLength, \"maxOutputLength\", DEFAULT_MAX_TEMPLATE_OUTPUT_LENGTH, MAX_TEMPLATE_OUTPUT_LENGTH);\n\tconst tokens = TemplateParser.parse(template, options);\n\tlet result = \"\";\n\tlet expressionCount = 0;\n\n\t// Reuse a single Evaluator instance for every expression in the template.\n\t// `Evaluator.evaluate` builds a new instance per call, cloning the whole\n\t// context via structuredClone for each expression - wasteful when a\n\t// template contains many expressions. Reusing one instance is safe here:\n\t// evaluate() never mutates the scope chain outside its own call (arrow\n\t// function scopes are pushed and popped in a finally block), and closures\n\t// cannot escape because the cloneable-return gate rejects them.\n\tconst evaluator = new Evaluator(context, {\n\t\tmaxInputLength: options.maxExpressionLength,\n\t\tmaxEvaluationSteps: options.maxEvaluationSteps,\n\t});\n\n\tconst typeHandler = {\n\t\ttext: (token) => token.value,\n\t\texpression: (token) => {\n\t\t\ttry {\n\t\t\t\treturn evaluator.evaluate(token.value);\n\t\t\t} catch (error) {\n\t\t\t\t// Replace undefined variables with empty string for graceful degradation\n\t\t\t\tif (error instanceof ReferenceError && error.message.endsWith(\"is not defined\")) {\n\t\t\t\t\treturn \"undefined\";\n\t\t\t\t} else {\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n\n\tfor (const token of tokens) {\n\t\t// Unknown token type, treat as text\n\t\tconst handler = typeHandler[token.type] ?? typeHandler[\"text\"];\n\t\tif (token.type === \"expression\") {\n\t\t\texpressionCount++;\n\t\t\tif (expressionCount > maxExpressions) {\n\t\t\t\tthrow new RangeError(`Template exceeds the maximum expression count of ${maxExpressions}`);\n\t\t\t}\n\t\t}\n\n\t\tconst chunk = String(handler(token));\n\t\tif (result.length + chunk.length > maxOutputLength) {\n\t\t\tthrow new RangeError(`Template output exceeds the maximum length of ${maxOutputLength} characters`);\n\t\t}\n\t\tresult += chunk;\n\t}\n\n\treturn result;\n}\n"],"names":["__webpack_require__","definition","key","Object","obj","prop","Symbol","mutableMethods","dangerousMethods","blockedMethods","blockedGlobalBuiltIns","ERROR_MESSAGES","DEFAULT_MAX_INPUT_LENGTH","MAX_CONFIGURABLE_INPUT_LENGTH","DEFAULT_MAX_EVALUATION_STEPS","MAX_CONFIGURABLE_EVALUATION_STEPS","MAX_ARRAY_LENGTH","MAX_BUFFER_BYTES","MAX_STRING_LENGTH","MAX_DATA_NODES","MAX_BIGINT_EXPONENT","MAX_BIGINT_BITS","TYPED_ARRAY_CONSTRUCTORS","Set","Int8Array","Uint8Array","Uint8ClampedArray","Int16Array","Uint16Array","Int32Array","Uint32Array","Float32Array","Float64Array","BigInt64Array","BigUint64Array","constructor","NO_OBJECT","renderErrorMessage","template","context","_","String","validateLimit","value","name","defaultValue","maximum","undefined","Number","RangeError","countLiteralMatches","search","all","count","position","assertBoundedData","label","pending","seen","WeakSet","dataSize","dataNodes","enqueueProperties","object","keys","_iteratorError","descriptor","TypeError","current","_type_of","_instanceof","ArrayBuffer","Array","Map","item","BINARY_OPERATION_MAP","a","b","createGlobalScope","scope","builtin","globals","isWritable","globalThis","getBlockedMethods","BLOCKED_METHODS","map","path","_path_split","properties","_iteratorError1","Evaluator","variables","options","clonedVariables","structuredClone","evaluate","expression","SyntaxError","ast","acorn","execute","body","result","node","Error","Promise","error","visit","Constructor","args","arg","content","handleBinaryExpression","op","left","right","leftBits","rightBits","BigInt","Math","assertBoundedConstruction","_args_","size","DataView","_size_size","collectionSize","byteLength","_args_1","offset","_args_2","elementCount","_size_length","elementCount1","handleLogicalExpression","left1","left2","handleUnaryExpression","handleIdentifier","ReferenceError","handleMemberExpression","objectValue","isStaticProperty","property","Function","handleArrayExpression","i","element","_result","assertBoundedSpread","currentLength","handleObjectExpression","spreadPropertyCount","spreadValue","handleSpreadElement","handleArrowFunctionExpression","newScope","paramCount","consumeEvaluationValue","_assertBoundedData","handleCallExpression","isOptional","func","target","resultLength","length","matchCount","source","_source_size","calledString","getNodeString","handleTemplateLiteral","expressionCount","evaluator","child","objectStr","propertyStr","DEFAULT_MAX_TEMPLATE_LENGTH","MAX_CONFIGURABLE_TEMPLATE_LENGTH","DEFAULT_MAX_TOKENS","MAX_CONFIGURABLE_TOKENS","TemplateParser","parse","tokens","pushToken","token","state","buffer","exprStartPos","pos","char","nextChar","exprValue","incompleteExpr","_isMatch","sequence","parser","DEFAULT_MAX_TEMPLATE_EXPRESSIONS","MAX_TEMPLATE_EXPRESSIONS","DEFAULT_MAX_TEMPLATE_OUTPUT_LENGTH","MAX_TEMPLATE_OUTPUT_LENGTH","evalExpression","evalTemplate","templateParserOptions","maxExpressions","maxOutputLength","typeHandler","_typeHandler_token_type","handler","chunk"],"mappings":";;;IAAAA,oBAAoB,CAAC,GAAG,SAAS,QAAO,EAAEC,UAAU;QACnD,IAAI,IAAIC,OAAOD,WACR,IAAGD,oBAAoB,CAAC,CAACC,YAAYC,QAAQ,CAACF,oBAAoB,CAAC,CAAC,UAASE,MACzEC,OAAO,cAAc,CAAC,UAASD,KAAK;YAAE,YAAY;YAAM,KAAKD,UAAU,CAACC,IAAI;QAAC;IAGzF;;;ICNAF,oBAAoB,CAAC,GAAG,SAASI,GAAG,EAAEC,IAAI;QAAI,OAAOF,OAAO,SAAS,CAAC,cAAc,CAAC,IAAI,CAACC,KAAKC;IAAO;;;ICCtGL,oBAAoB,CAAC,GAAG,SAAS,QAAO;QACvC,IAAG,AAAkB,eAAlB,OAAOM,UAA0BA,OAAO,WAAW,EACrDH,OAAO,cAAc,CAAC,UAASG,OAAO,WAAW,EAAE;YAAE,OAAO;QAAS;QAEtEH,OAAO,cAAc,CAAC,UAAS,cAAc;YAAE,OAAO;QAAK;IAC5D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACNA,IAAMI,iBAAiB;IACtB;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IAEA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IAEA;IACA;IACA;IAEA;IAEA;IAEA;IACA;IAEA;IACA;IACA;IACA;IAEA;IACA;IACA;IAEA;IACA;IACA;IAGA;IACA;IACA;IACA;IAGA;IACA;IAGA;CACA;AAED,IAAMC,mBAAmB;IACxB;IAEA;IACA;IACA;IACA;IAMA;IACA;CACA;AAGDD,eAAe,IAAI,CAAC;AAKb,IAAME,iBAAkB,qBAAGF,gBAAAA,MAAAA,CAAgB,qBAAGC;AAK9C,IAAME,wBAAwB;IACpC;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAGA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAGA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAGA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAGA;IACA;IACA;IACA;IAIA;IAIA;IAGA;IAOA;IAGA;IACA;IAGA;CACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClRD,IAAMC,iBAAiB;IACtB,uBAAuB;IACvB,mBAAmB;IACnB,iBAAiB;IACjB,gBAAgB;IAChB,gBAAgB;IAChB,qBAAqB;AACtB;AAOA,IAAMC,2BAA2B;AACjC,IAAMC,gCAAgC;AACtC,IAAMC,+BAA+B;AACrC,IAAMC,oCAAoC;AAC1C,IAAMC,mBAAmB;AACzB,IAAMC,mBAAmB;AACzB,IAAMC,oBAAoB;AAC1B,IAAMC,iBAAiB;AACvB,IAAMC,sBAAsB,IAAI;AAChC,IAAMC,kBAAkB;AACxB,IAAMC,2BAA2B,IAAIC,IACpC;IACCC;IACAC;IACAC;IACAC;IACAC;IACAC;IACAC;IACAC;IACAC;IACyB,cAAzB,OAAOC,gBAA+BA,gBAAgB;IAC5B,cAA1B,OAAOC,iBAAgCA,iBAAiB;CACxD,CAAC,MAAM,CAAC,SAACC,WAAW;WAAK,AAAuB,cAAvB,OAAOA;;AAOlC,IAAMC,YAAY9B,OAAO;AAWzB,IAAM+B,qBAAqB,SAACC,QAAQ;QAAEC,UAAU,UAAVA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAU,CAAC;WAAMD,SAAS,OAAO,CAAC,YAAY,SAACE,CAAC,EAAEtC,GAAG;eAAKuC,OAAOF,OAAO,CAACrC,IAAI;;;AAEnH,SAASwC,cAAcC,KAAK,EAAEC,IAAI,EAAEC,YAAY,EAAEC,OAAO;IACxD,IAAIH,AAAUI,WAAVJ,OACH,OAAOE;IAER,IAAI,CAACG,OAAO,aAAa,CAACL,UAAUA,QAAQ,KAAKA,QAAQG,SACxD,MAAM,IAAIG,WAAY,GAA2CH,MAAAA,CAAzCF,MAAK,sCAA4C,OAARE;IAElE,OAAOH;AACR;AAEA,SAASO,oBAAoBP,KAAK,EAAEQ,MAAM,EAAEC,GAAG;IAC9C,IAAID,AAAW,OAAXA,QACH,OAAOC,MAAMT,MAAM,MAAM,GAAG,IAAI;IAEjC,IAAIU,QAAQ;IACZ,IAAIC,WAAW;IACf,MAAQA,AAAgD,OAAhDA,CAAAA,WAAWX,MAAM,OAAO,CAACQ,QAAQG,SAAQ,EAAW;QAC3DD;QACA,IAAI,CAACD,KACJ;QAEDE,YAAYH,OAAO,MAAM;IAC1B;IACA,OAAOE;AACR;AAEA,SAASE,kBAAkBZ,KAAK,EAAEa,KAAK;IACtC,IAAMC,UAAU;QAACd;KAAM;IACvB,IAAMe,OAAO,IAAIC;IACjB,IAAIC,WAAW;IACf,IAAIC,YAAY;IAChB,IAAMC,oBAAoB,SAACC,MAAM;QAChC,IAAMC,OAAO7D,OAAO,IAAI,CAAC4D;QACzB,IAAIN,QAAQ,MAAM,GAAGO,KAAK,MAAM,GAAG7C,gBAClC,MAAM,IAAI8B,WAAY,GAAQ,OAANO,OAAM;YAE1BS,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;YAAL,QAAKA,YAAaD,IAAI,CAAJA,OAAAA,QAAAA,CAAAA,IAAbC,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAmB;gBAAnBA,IAAM/D,MAAN+D,MAAAA,KAAAA;gBACJL,YAAY1D,IAAI,MAAM;gBACtB,IAAMgE,aAAa/D,OAAO,wBAAwB,CAAC4D,QAAQ7D;gBAC3D,IAAI,CAACgE,cAAc,CAAC/D,OAAO,MAAM,CAAC+D,YAAY,UAC7C,MAAM,IAAIC,UAAW,GAAQ,OAANX,OAAM;gBAE9BC,QAAQ,IAAI,CAACS,WAAW,KAAK;YAC9B;;YAPKD,oBAAAA;YAAAA,iBAAAA;;;qBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;oBAAAA,mB,MAAAA;;;IAQN;IAEA,MAAOR,QAAQ,MAAM,GAAG,EAAG;QAC1B,IAAMW,UAAUX,QAAQ,GAAG;QAC3BI;QACA,IAAIA,YAAY1C,gBACf,MAAM,IAAI8B,WAAY,GAAQ,OAANO,OAAM;QAG/B,IAAI,AAAmB,YAAnB,OAAOY,SAAsB;YAChC,IAAIA,QAAQ,MAAM,GAAGlD,mBACpB,MAAM,IAAI+B,WAAY,GAAQ,OAANO,OAAM;YAE/BI,YAAYQ,QAAQ,MAAM,GAAG;QAC9B,OAAO,IAAIA,AAAY,SAAZA,WAAqBC,AAAAA,CAAOD,WAAAA,UAAAA,cAAPC,SAAOD,QAAO,MAAK,YAAY,AAAmB,cAAnB,OAAOA,SAAyB;YAC9FR,YAAY;YACZ;QACD,OAEO;YAFA,IAAI,AAAmB,cAAnB,OAAOQ,WAA0BV,KAAK,GAAG,CAACU,UACpD;YAEAV,KAAK,GAAG,CAACU;YACTR,YAAY;YACZ,IAAWU,YAAPF,SAAmBG,gBAAeA,YAAY,MAAM,CAACH,UACxDR,YAAYQ,QAAQ,UAAU;iBACxB,IAAII,MAAM,OAAO,CAACJ,UAAU;gBAClC,IAAIA,QAAQ,MAAM,GAAGpD,kBACpB,MAAM,IAAIiC,WAAY,GAAQ,OAANO,OAAM;gBAE/BI,YAAYQ,AAAiB,IAAjBA,QAAQ,MAAM;gBAC1BN,kBAAkBM;YACnB,OAAO,IAAWE,YAAPF,SAAmBK,MAAK;gBAClC,IAAIL,QAAQ,IAAI,GAAGpD,kBAClB,MAAM,IAAIiC,WAAY,GAAQ,OAANO,OAAM;gBAE/BI,YAAYQ,AAAe,KAAfA,QAAQ,IAAI;gBACxBK,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAACL,SAAS,SAACM,IAAI,EAAExE,GAAG;2BAAKuD,QAAQ,IAAI,CAACvD,KAAKwE;;YACtE,OAAO,IAAWJ,YAAPF,SAAmB7C,MAAK;gBAClC,IAAI6C,QAAQ,IAAI,GAAGpD,kBAClB,MAAM,IAAIiC,WAAY,GAAQ,OAANO,OAAM;gBAE/BI,YAAYQ,AAAe,IAAfA,QAAQ,IAAI;gBACxB7C,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC6C,SAAS,SAACM,IAAI;2BAAKjB,QAAQ,IAAI,CAACiB;;YAC5D,OACCZ,kBAAkBM;QAEpB;QAEA,IAAIR,WAAW3C,kBACd,MAAM,IAAIgC,WAAY,GAAQ,OAANO,OAAM;IAEhC;IACA,OAAO;QAAEI,UAAAA;QAAUC,WAAAA;IAAU;AAC9B;AAEA,IAAMc,uBAAuB;IAC5B,KAAK,SAACC,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAAA,GAAAA,CAAAA,GAAKC;;IACrB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,OAAO,SAACD,CAAC,EAAEC,CAAC;eAAKD,MAAMC;;IACvB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,OAAO,SAACD,CAAC,EAAEC,CAAC;eAAKD,MAAMC;;IACvB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,OAAO,SAACD,CAAC,EAAEC,CAAC;eAAKD,MAAMC;;IACvB,IAAI,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACnB,YAAY,SAACD,CAAC,EAAEC,CAAC;eAAMP,YAADM,GAAaC;;AACpC;AAEA,SAASC;IACR,IAAMC,QAAQ5E,OAAO,MAAM,CAAC;IAC5B,IAAQ6E,UAAYC,iCAAAA,OAALD;IAEf,IAAK,IAAM9E,OAAO8E,QACjB,KAAItE,sBAAsB,QAAQ,CAACR;QAKnC,IAAMgF,aAAaF,OAAO,CAAC9E,IAAI;QAE/BC,OAAO,cAAc,CAAC4E,OAAO7E,KAAK;YACjC,OAAOiF,UAAU,CAACjF,IAAI;YACtB,UAAUgF;YACV,YAAY;YACZ,cAAc;QACf;;IAGD/E,OAAO,cAAc,CAAC4E,OAAO,cAAc;QAC1C,OAAOA;QACP,UAAU;QACV,YAAY;QACZ,cAAc;IACf;IAEA,OAAOA;AACR;AAEA,IAAMK,oBAAqB;IAI1B,IAAIC,kBAAkB;IAEtB,OAAO;QACN,IAAIA,iBAAiB,OAAOA;QAE5B,IAAMC,MAAM,IAAIb;YACXR,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;YAAL,QAAKA,YAAcxD,cAAcA,CAAAA,OAAAA,QAAAA,CAAAA,IAA5BwD,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA8B;gBAA9BA,IAAMsB,OAANtB,MAAAA,KAAAA;gBACJ,IAAgCuB,cAAAA,UAAAA,KAAK,KAAK,CAAC,OAApCzB,SAAyByB,WAAAA,CAAAA,EAAAA,EAAdC,aAAcD,YAAAA,KAAAA,CAAjB;gBACf,IAAIpB,UAAUe,UAAU,CAACpB,OAAO;oBAC3B2B,6BAAAA,MAAAA,qBAAAA,OAAAA,kBAAAA;;oBAAL,QAAKA,aAAcD,UAAU,CAAVA,OAAAA,QAAAA,CAAAA,IAAdC,QAAAA,CAAAA,CAAAA,6BAAAA,AAAAA,CAAAA,SAAAA,WAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,6BAAAA,KAA0B;wBAA1BA,IAAMrF,OAANqF,OAAAA,KAAAA;wBACJ,IAAItB,WAAWjE,OAAO,MAAM,CAACiE,SAAS/D,OACrC+D,UAAUA,OAAO,CAAC/D,KAAK;6BACjB;4BACN+D,UAAU;4BACV;wBACD;oBACD;;oBAPKsB,qBAAAA;oBAAAA,kBAAAA;;;6BAAAA,8BAAAA,AAAAA,QAAAA,WAAAA,MAAAA,EAAAA,WAAAA,MAAAA;;4BAAAA,oB,MAAAA;;;gBAQL,IAAI,AAAmB,cAAnB,OAAOtB,SAAwBkB,IAAI,GAAG,CAAClB,SAASmB;YACrD;;YAZKtB,oBAAAA;YAAAA,iBAAAA;;;qBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;oBAAAA,mB,MAAAA;;;QAaLoB,kBAAkBC;QAElB,OAAOD;IACR;AACD;AAeO,IAAMM,sBAASA,WAAAA,GAAf;;aAAMA;YASAC,YAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAYzF,OAAO,MAAM,CAAC,OAAO0F,UAAAA,UAAAA,MAAAA,GAAAA,IAAAA,SAAAA,CAAAA,EAAAA,GAAAA,KAAAA;gCATjCF;QAUX,IAAI,CAAC,cAAc,GAAGjD,cAAcmD,QAAAA,UAAAA,KAAAA,IAAAA,QAAS,cAAc,EAAE,kBAAkBjF,0BAA0BC;QACzG,IAAI,CAAC,kBAAkB,GAAG6B,cAAcmD,QAAAA,UAAAA,KAAAA,IAAAA,QAAS,kBAAkB,EAAE,sBAAsB/E,8BAA8BC;QACzHwC,kBAAkBqC,WAAW;QAC7B,IAAME,kBAAkBC,gBAAgBH;QACxC,IAAI,CAAC,MAAM,GAAG;YAACE;YAAiBhB;SAAoB,CAAC,MAAM,CAAC,SAACC,KAAK;mBAAKA,QAAAA;;QACvE,IAAI,CAAC,MAAM,GAAGhC;QACd,IAAI,CAAC,wBAAwB,GAAG;QAChC,IAAI,CAAC,iBAAiB,GAAG9B;QACzB,IAAI,CAAC,kBAAkB,GAAGE;;kBAlBfwE,WAAAA;;YAwCZK,KAAAA;mBAAAA,SAASC,UAAU;gBAClB,IAAI,AAAsB,YAAtB,OAAOA,YACV,MAAM,IAAI9B,UAAU;gBAGrB,IAAI8B,WAAW,MAAM,GAAG,IAAI,CAAC,cAAc,EAC1C,MAAM,IAAIC,YAAY7D,mBAAmB1B,eAAe,mBAAmB,EAAE;oBAAC,IAAI,CAAC,cAAc;iBAAC;gBAGnG,IAAI,CAAC,MAAM,GAAGsF;gBACd,IAAI,CAAC,wBAAwB,GAAG,IAAI,CAAC,kBAAkB;gBACvD,IAAI,CAAC,iBAAiB,GAAGhF;gBACzB,IAAI,CAAC,kBAAkB,GAAGE;gBAE1B,IAAMgF,MAAMC,+BAAAA,KAAW,CAACH,YAAY;oBAAE,aAAa;gBAAS;gBAG5D,IAAI;oBACH,OAAO,IAAI,CAAC,OAAO,CAACE,IAAI,IAAI;gBAC7B,SAAU;oBACT,IAAI,CAAC,MAAM,GAAGpD;gBACf;YACD;;;YAQAsD,KAAAA;mBAAAA,SAAQC,IAAI;gBACX,IAAI,AAAkC,MAAlC,IAAI,CAAC,wBAAwB,EAAQ;oBACxC,IAAI,CAAC,wBAAwB,GAAG,IAAI,CAAC,kBAAkB;oBACvD,IAAI,CAAC,iBAAiB,GAAGrF;oBACzB,IAAI,CAAC,kBAAkB,GAAGE;gBAC3B;gBACA,IAAIoF;oBAECtC,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAcqC,IAAI,CAAJA,OAAAA,QAAAA,CAAAA,IAAdrC,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAoB;wBAApBA,IAAMuC,OAANvC,MAAAA,KAAAA;wBACJsC,SAAS,IAAI,CAAC,KAAK,CAACC;oBACrB;;oBAFKvC,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAIL,IAAI,AAAkB,cAAlB,OAAOsC,QACV,MAAM,IAAIE,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAAuC;gBAG3G4C,kBAAkBgD,QAAQ;gBAK1B,IAAUjC,YAANiC,QAAkBG,UACrB,MAAM,IAAID,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAAsC;gBAY1G,IAAI;oBACH,OAAOoF,gBAAgBQ;gBACxB,EAAE,OAAOI,OAAO;oBACf,IAAIA,SAASA,AAAe,qBAAfA,MAAM,IAAI,EACtB,MAAM,IAAIF,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;wBAAC;qBAAkD;oBAEtH,MAAMgG;gBACP;YACD;;;YAQAC,KAAAA;mBAAAA,SAAMJ,IAAI;;gBACT,IAAI,CAAC,wBAAwB;gBAC7B,IAAI,IAAI,CAAC,wBAAwB,GAAG,GACnC,MAAM,IAAIvD,WAAW;gBAGtB,OAAQuD,KAAK,IAAI;oBAChB,KAAK;wBACJ,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,UAAU;oBAElC,KAAK;wBACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;oBAEpC,KAAK;wBACJ,OAAO,IAAI,CAAC,uBAAuB,CAACA;oBAErC,KAAK;wBACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;oBAEnC,KAAK;wBACJ,OAAO,IAAI,CAAC,gBAAgB,CAACA;oBAE9B,KAAK;wBACJ,OAAOA,KAAK,KAAK;oBAElB,KAAK;wBACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;oBAEpC,KAAK;wBACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;oBAEnC,KAAK;wBACJ,OAAO,IAAI,CAAC,mBAAmB,CAACA;oBAEjC,KAAK;wBACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;oBAEpC,KAAK;wBACJ,MAAM,IAAIN,YAAY7D,mBAAmB1B,eAAe,cAAc,EAAE;4BAAC;yBAAsB;oBAEhG,KAAK;wBACJ,OAAO,IAAI,CAAC,6BAA6B,CAAC6F;oBAE3C,KAAK;wBACJ,OAAO,IAAI,CAAC,oBAAoB,CAACA;oBAElC,KAAK;wBACJ,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAACA,KAAK,UAAU,IAAI,IAAI,CAAC,KAAK,CAACA,KAAK,SAAS;oBAEvF,KAAK;wBACJ,IAAIA,AAAqB,iBAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAIC,MAAO,4BAA4C,OAAjBD,KAAK,MAAM,CAAC,IAAI,EAAC;wBAG9D,IAAIA,AAAqB,eAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAIC,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;4BAAC;yBAA6B;wBAOjG,IAAI6F,AAAqB,cAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAIC,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;4BAAC;yBAAsB;wBAE1F,IAAMkG,cAAc,IAAI,CAAC,KAAK,CAACL,KAAK,MAAM;wBAG1C,IAAMM,OAAON,KAAK,SAAS,CAAC,MAAM,GAAGA,KAAK,SAAS,CAAC,GAAG,CAAC,SAACO,GAAG;mCAAK,MAAK,KAAK,CAACA;6BAAQ,EAAE;wBACtF,IAAI,CAAC,yBAAyB,CAACF,aAAaC;wBAE5C,OAAO,WAAID,aAAY,8BAAGC;oBAE3B,KAAK;wBACJ,OAAO,IAAI,CAAC,KAAK,CAACN,KAAK,UAAU;oBAElC,KAAK;wBACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;oBAEnC,KAAK;wBACJ,MAAM,IAAIN,YAAY7D,mBAAmB1B,eAAe,cAAc,EAAE;4BAAC;yBAAoB;oBAE9F,KAAK;wBACJ,MAAM,IAAIuF,YAAY7D,mBAAmB1B,eAAe,cAAc,EAAE;4BAAC;yBAAmB;oBAE7F;wBACC,IAAIqG,UAAU,IAAI,CAAC,MAAM,CAAC,KAAK,CAACR,KAAK,KAAK,EAAEA,KAAK,GAAG;wBAEpD,IAAIQ,QAAQ,MAAM,GAAG,IACpBA,UAAUA,QAAQ,KAAK,CAAC,GAAG,MAAM;wBAGlC,MAAM,IAAId,YAAa,IAAW,OAARc,SAAQ,OAAK,MAAM3E,mBAAmB1B,eAAe,iBAAiB,EAAE;4BAACqG;yBAAQ;gBAE7G;YACD;;;YAOAC,KAAAA;mBAAAA,SAAuBT,IAAI;gBAC1B,IAAMU,KAAKV,KAAK,QAAQ;gBACxB,IAAMW,OAAO,IAAI,CAAC,KAAK,CAACX,KAAK,IAAI;gBACjC,IAAMY,QAAQ,IAAI,CAAC,KAAK,CAACZ,KAAK,KAAK;gBACnC,IAAIU,AAAO,QAAPA,MAAe,CAAgB,YAAhB,OAAOC,QAAqB,AAAiB,YAAjB,OAAOC,KAAiB,GACtE;oBAAA,IAAI3E,OAAO0E,MAAM,MAAM,GAAG1E,OAAO2E,OAAO,MAAM,GAAGlG,mBAChD,MAAM,IAAI+B,WAAW;gBACtB;gBAED,IAAIoB,AAAAA,CAAgB,WAAT8C,OAAAA,cAAP9C,SAAO8C,KAAI,MAAK,YAAY9C,AAAAA,CAAiB,WAAV+C,QAAAA,cAAP/C,SAAO+C,MAAK,MAAK,UAAU;oBAC1D,IAAIF,AAAO,SAAPA,MAAgBE,CAAAA,QAAQhG,uBAAuBgG,QAAQ,EAAC,GAC3D,MAAM,IAAInE,WAAY,yCAA4D,OAApB7B;oBAE/D,IAAMiG,WAAWF,KAAK,QAAQ,CAAC,GAAG,MAAM;oBACxC,IAAMG,YAAYF,MAAM,QAAQ,CAAC,GAAG,MAAM;oBAC1C,IACEF,AAAO,SAAPA,MAAeG,WAAWrE,OAAOoE,SAAS/F,mBAC1C6F,AAAO,SAAPA,MAAeE,QAAQG,OAAOlG,oBAC9B6F,AAAO,SAAPA,MAAeE,SAAS,EAAE,IAAIC,WAAWrE,OAAOoE,SAAS/F,mBACzD6F,AAAO,QAAPA,MAAcG,WAAWC,YAAYjG,mBACpC6F,AAAAA,CAAAA,AAAO,QAAPA,MAAcA,AAAO,QAAPA,EAAS,KAAMM,KAAK,GAAG,CAACH,UAAUC,aAAa,IAAIjG,iBAEnE,MAAM,IAAI4B,WAAW;gBAEvB;gBAEA,IAAI0B,qBAAqB,cAAc,CAACuC,KACvC,OAAOvC,oBAAoB,CAACuC,GAAG,CAACC,MAAMC;gBAGvC,MAAM,IAAIlB,YAAa,yBAAsC,OAAdM,KAAK,QAAQ;YAC7D;;;YAEAiB,KAAAA;mBAAAA,SAA0BZ,WAAW,EAAEC,IAAI;oBAKqBY;gBAJ/D,IAAMC,OAAOb,IAAI,CAAC,EAAE;gBACpB,IAAID,gBAAgBrC,SAASsC,AAAgB,MAAhBA,KAAK,MAAM,IAAU,AAAgB,YAAhB,OAAOa,QAAqBA,OAAO3G,kBACpF,MAAM,IAAIiC,WAAW;gBAEtB,IAAI4D,gBAAgBtC,eAAgBoD,CAAAA,OAAO1G,oBAAoByG,AAAAA,SAAAA,CAAAA,SAAAA,IAAI,CAAC,EAAE,AAAD,IAANA,KAAAA,IAAAA,OAAS,aAAa,AAAD,IAAIzG,gBAAe,GACtG,MAAM,IAAIgC,WAAW;gBAEtB,IAAI4D,gBAAgBe,YAAgBtD,YAAJqD,MAAgBpD,gBAAeoD,KAAK,UAAU,GAAG1G,kBAChF,MAAM,IAAIgC,WAAW;gBAEtB,IAAI4D,gBAAgBpC,OAAOoC,gBAAgBtF,KAAK;wBACwCsG;oBAAvF,IAAMC,iBAAiB,AAAgB,YAAhB,OAAOH,QAAqBnD,MAAM,OAAO,CAACmD,QAAQA,KAAK,MAAM,GAAGE,QAAAA,CAAAA,aAAAA,QAAAA,OAAAA,KAAAA,IAAAA,KAAM,IAAI,AAAD,IAATA,aAAcF,QAAAA,OAAAA,KAAAA,IAAAA,KAAM,MAAM;oBACjH,IAAI,AAA0B,YAA1B,OAAOG,kBAA+BA,iBAAiB9G,kBAC1D,MAAM,IAAIiC,WAAW;gBAEvB;gBACA,IAAI3B,yBAAyB,GAAG,CAACuF,cAAc;oBAC9C,IAAIkB;oBACJ,IAAQzD,YAAJqD,MAAgBpD,cAAa;4BACjByD;wBAAf,IAAMC,SAASD,QAAAA,CAAAA,UAAAA,IAAI,CAAC,EAAE,AAAD,IAANA,UAAW;4BACLE;wBAArB,IAAMC,eAAeD,QAAAA,CAAAA,UAAAA,IAAI,CAAC,EAAE,AAAD,IAANA,UAAWV,KAAK,KAAK,CAAEG,AAAAA,CAAAA,KAAK,UAAU,GAAGM,MAAK,IAAKpB,YAAY,iBAAiB;wBACrGkB,aAAaI,eAAetB,YAAY,iBAAiB;oBAC1D,OAAO;4BACiDuB;wBAAvD,IAAMC,gBAAe,AAAgB,YAAhB,OAAOV,OAAoBA,OAAOS,QAAAA,CAAAA,eAAAA,QAAAA,OAAAA,KAAAA,IAAAA,KAAM,MAAM,AAAD,IAAXA,eAAgB;wBACvEL,aAAaM,gBAAexB,YAAY,iBAAiB;oBAC1D;oBACA,IAAIkB,aAAa9G,kBAChB,MAAM,IAAIgC,WAAW;gBAEvB;YACD;;;YAOAqF,KAAAA;mBAAAA,SAAwB9B,IAAI;gBAC3B,OAAQA,KAAK,QAAQ;oBACpB,KAAK;wBACJ,IAAMW,OAAO,IAAI,CAAC,KAAK,CAACX,KAAK,IAAI;wBACjC,OAAOW,OAAO,IAAI,CAAC,KAAK,CAACX,KAAK,KAAK,IAAIW;oBAExC,KAAK;wBACJ,IAAMoB,QAAO,IAAI,CAAC,KAAK,CAAC/B,KAAK,IAAI;wBACjC,OAAO+B,QAAOA,QAAO,IAAI,CAAC,KAAK,CAAC/B,KAAK,KAAK;oBAE3C,KAAK;wBACJ,IAAMgC,QAAO,IAAI,CAAC,KAAK,CAAChC,KAAK,IAAI;wBACjC,OAAOgC,QAAAA,QAAsCA,QAAO,IAAI,CAAC,KAAK,CAAChC,KAAK,KAAK;oBAE1E;wBACC,MAAM,IAAIN,YAAa,iCAA8C,OAAdM,KAAK,QAAQ;gBAEtE;YACD;;;YAMAiC,KAAAA;mBAAAA,SAAsBjC,IAAI;gBACzB,OAAQA,KAAK,QAAQ;oBACpB,KAAK;wBACJ,OAAO,CAAC,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAEjC,KAAK;wBACJ,OAAO,CAAC,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAEjC,KAAK;wBACJ,OAAO,CAAC,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAEjC,KAAK;wBACJ,OAAO,CAAC,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAEjC,KAAK;wBACJ,OAAOnC,SAAO,IAAI,CAAC,KAAK,CAACmC,KAAK,QAAQ;oBAEvC,KAAK;wBACJ,OAAO,KAAK,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAErC,KAAK;wBACJ,MAAM,IAAIN,YAAY7D,mBAAmB1B,eAAe,cAAc,EAAE;4BAAC;yBAAkB;oBAE5F;wBACC,MAAM,IAAIuF,YAAa,+BAA4C,OAAdM,KAAK,QAAQ;gBAEpE;YACD;;;YAMAkC,KAAAA;mBAAAA,SAAiBlC,IAAI;gBACpB,IAAM5D,OAAO4D,KAAK,IAAI;oBACjBvC,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAe,IAAI,CAAC,MAAM,qBAA1BA,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA4B;wBAA5BA,IAAMc,QAANd,MAAAA,KAAAA;wBACJ,IAAI9D,OAAO,MAAM,CAAC4E,OAAOnC,OACxB,OAAOmC,KAAK,CAACnC,KAAK;oBAEpB;;oBAJKqB,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAML,MAAM,IAAI0E,eAAetG,mBAAmB1B,eAAe,cAAc,EAAE;oBAACiC;iBAAK;YAClF;;;YAMAgG,KAAAA;mBAAAA,SAAuBpC,IAAI;oBAAEqC,cAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAczG;gBAC1C,IAAM2B,SAAS8E,gBAAgBzG,YAAY,IAAI,CAAC,KAAK,CAACoE,KAAK,MAAM,IAAIqC;gBAErE,IAAMC,mBAAmBtC,AAAuB,iBAAvBA,KAAK,QAAQ,CAAC,IAAI,IAAqB,CAACA,KAAK,QAAQ;gBAC9E,IAAMuC,WAAWD,mBAAmBtC,KAAK,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;gBAMjF,IAAIuC,AAAa,YAAbA,YAA8BzE,YAANP,QAAkB0C,QAC7C,MAAM,IAAIA,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAAwB;gBAI5F,IAAI,QAAOoD,UAA6CA,MAAM,CAACgF,SAAS,KAAKhF,CAAAA,QAAAA,SAAAA,KAAAA,IAAAA,OAAQ,SAAS,AAAD,GAC5F,MAAM,IAAI0C,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAAiC;gBAGrG,IAAIoD,QAAAA,QAAyC;oBAE5C,IAAIyC,KAAK,QAAQ,EAChB;oBAED,MAAM,IAAIrC,UAAU9B,mBAAmB1B,eAAe,qBAAqB,EAAE;wBAACoD;wBAAQgF;qBAAS;gBAChG;gBAEA,IAAMxC,SAASxC,MAAM,CAACgF,SAAS;gBAQ/B,IAAIxC,WAAWyC,YAAYzC,WAAWyC,SAAS,SAAS,EACvD,MAAM,IAAIvC,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAG3F,OAAO4F;YACR;;;YAMA0C,KAAAA;mBAAAA,SAAsBzC,IAAI;gBACzB,IAAMD,SAAS,EAAE;gBAEjB,IAAK,IAAI2C,IAAI,GAAGA,IAAI1C,KAAK,QAAQ,CAAC,MAAM,EAAE0C,IAAK;oBAC9C,IAAMC,UAAU3C,KAAK,QAAQ,CAAC,EAAE,CAAC0C;oBAIjC,IAAIC,AAAY,SAAZA,SAAkB;wBACrB5C,OAAO,MAAM;wBACb;oBACD;oBAEA,IAAM5D,QAAQ,IAAI,CAAC,KAAK,CAACwG;oBAEzB,IAAIA,AAAiB,oBAAjBA,QAAQ,IAAI,EAAsB;4BAErCC;wBADA,IAAI,CAAC,mBAAmB,CAAC7C,OAAO,MAAM,EAAE5D;wBACxCyG,CAAAA,UAAAA,MAAK,EAAE,IAAI,OAAXA,SAAY,8BAAGzG;oBAChB,OACC4D,OAAO,IAAI,CAAC5D;gBAEd;gBAEA,OAAO4D;YACR;;;YAEA8C,KAAAA;mBAAAA,SAAoBC,aAAa,EAAE3G,KAAK;gBACvC,IAAMgF,OAAO,AAAiB,YAAjB,OAAOhF,SAAsB6B,MAAM,OAAO,CAAC7B,SAASA,MAAM,MAAM,GAAGA,QAAAA,QAAAA,KAAAA,IAAAA,MAAO,IAAI;gBAC3F,IAAI,AAAgB,YAAhB,OAAOgF,QAAqB2B,gBAAgB3B,OAAO3G,kBACtD,MAAM,IAAIiC,WAAW;YAEvB;;;YAMAsG,KAAAA;mBAAAA,SAAuB/C,IAAI;gBAC1B,IAAMpG,MAAM,CAAC;gBACb,IAAIoJ,sBAAsB;oBACrBvF,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAcuC,KAAK,UAAU,qBAA7BvC,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA+B;wBAA/BA,IAAM5D,OAAN4D,MAAAA,KAAAA;wBACJ,IAAI5D,AAAc,oBAAdA,KAAK,IAAI,EAAsB;4BAClC,IAAMoJ,cAAc,IAAI,CAAC,KAAK,CAACpJ,KAAK,QAAQ;4BAC5CmJ,uBAAuBrJ,OAAO,IAAI,CAACsJ,aAAa,MAAM;4BACtD,IAAID,sBAAsBxI,kBACzB,MAAM,IAAIiC,WAAW;4BAEtB9C,OAAO,MAAM,CAACC,KAAKqJ;4BACnB;wBACD;wBAOA,IAAMvJ,MAAMG,KAAK,QAAQ,GAAG,IAAI,CAAC,KAAK,CAACA,KAAK,GAAG,IAAIA,KAAK,GAAG,CAAC,IAAI,IAAIA,KAAK,GAAG,CAAC,KAAK;wBAClF,IAAMsC,QAAQ,IAAI,CAAC,KAAK,CAACtC,KAAK,KAAK;wBACnC,IAAIA,KAAK,QAAQ,EAChBF,OAAO,cAAc,CAACC,KAAKF,KAAK;4BAAEyC,OAAAA;4BAAO,UAAU;4BAAM,YAAY;4BAAM,cAAc;wBAAK;6BAE9FvC,GAAG,CAACF,IAAI,GAAGyC;oBAEb;;oBAvBKsB,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAwBL,OAAO7D;YACR;;;YAEAsJ,KAAAA;mBAAAA,SAAoBlD,IAAI;gBACvB,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;YAChC;;;YAQAmD,KAAAA;mBAAAA,SAA8BnD,IAAI;;gBACjC,OAAO;qDAAIM,OAAAA,IAAAA,MAAAA,OAAAA,OAAAA,GAAAA,OAAAA,MAAAA,OAAAA,IAAI,CAAJA,KAAAA,GAAAA,SAAAA,CAAAA,KAAAA;oBAEV,IAAM8C,WAAW,CAAC;oBAClB,IAAMC,aAAarD,KAAK,MAAM,CAAC,MAAM;oBACrC,IAAK,IAAI0C,IAAI,GAAGA,IAAIW,YAAYX,IAC/BU,QAAQ,CAACpD,KAAK,MAAM,CAAC0C,EAAE,CAAC,IAAI,CAAC,GAAGpC,IAAI,CAACoC,EAAE;oBAOxC,MAAK,MAAM,CAAC,OAAO,CAACU;oBACpB,IAAI;wBACH,IAAMrD,SAAS,MAAK,KAAK,CAACC,KAAK,IAAI;wBACnC,MAAK,sBAAsB,CAACD;wBAC5B,OAAOA;oBACR,SAAU;wBACT,MAAK,MAAM,CAAC,KAAK;oBAClB;gBACD;YACD;;;YAEAuD,KAAAA;mBAAAA,SAAuBnH,KAAK;gBAC3B,IAAgCoH,qBAAAA,kBAAkBpH,OAAO,mCAAjDiB,WAAwBmG,mBAAxBnG,QAAQ,EAAEC,YAAckG,mBAAdlG,SAAS;gBAC3B,IAAI,CAAC,iBAAiB,IAAID;gBAC1B,IAAI,CAAC,kBAAkB,IAAIC;gBAC3B,IAAI,IAAI,CAAC,iBAAiB,GAAG,KAAK,IAAI,CAAC,kBAAkB,GAAG,GAC3D,MAAM,IAAIZ,WAAW;YAEvB;;;YAMA+G,KAAAA;mBAAAA,SAAqBxD,IAAI;;gBACxB,IAAMyD,aAAazD,KAAK,QAAQ,IAAKA,AAAqB,uBAArBA,KAAK,MAAM,CAAC,IAAI,IAA2BA,KAAK,MAAM,CAAC,QAAQ;gBACpG,IAAI0D;gBACJ,IAAIC,SAAS;gBAEb,IAAI3D,AAAqB,uBAArBA,KAAK,MAAM,CAAC,IAAI,EAAyB;oBAO5C2D,SAAS,IAAI,CAAC,KAAK,CAAC3D,KAAK,MAAM,CAAC,MAAM;oBACtC0D,OAAO,IAAI,CAAC,sBAAsB,CAAC1D,KAAK,MAAM,EAAE2D;gBACjD,OACCD,OAAO,IAAI,CAAC,KAAK,CAAC1D,KAAK,MAAM;gBAG9B,IAAK0D,QAAAA,QAAwCD,YAC5C;gBAGD,IAAIC,SAASlB,UACZ,MAAM,IAAIvC,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAM3F,IAAIuJ,SAASzD,MAAM,iBAAiB,EACnC,MAAM,IAAIA,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAA0B;gBAG9F,IAAIyE,oBAAoB,GAAG,CAAC8E,OAAO;oBAClC,IAAM3E,OAAOH,oBAAoB,GAAG,CAAC8E;oBACrC,MAAM,IAAIzD,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;wBAAC4E;qBAAK;gBACzE;gBAGA,IAAMuB,OAAQ;oBACb,IAAIN,AAA0B,MAA1BA,KAAK,SAAS,CAAC,MAAM,EACxB,OAAO,EAAE;oBAGV,IAAID,SAAS,EAAE;oBAEf,IAAK,IAAI2C,IAAI,GAAGA,IAAI1C,KAAK,SAAS,CAAC,MAAM,EAAE0C,IAAK;wBAC/C,IAAMC,UAAU3C,KAAK,SAAS,CAAC,EAAE,CAAC0C;wBAClC,IAAMvG,QAAQ,MAAK,KAAK,CAACwG;wBAEzB,IAAIA,AAAiB,oBAAjBA,QAAQ,IAAI,EAAsB;gCAErCC;4BADA,MAAK,mBAAmB,CAAC7C,OAAO,MAAM,EAAE5D;4BACxCyG,CAAAA,UAAAA,MAAK,EAAE,IAAI,OAAXA,SAAY,8BAAGzG;wBAChB,OACC4D,OAAO,IAAI,CAAC5D;oBAEd;oBAEA,OAAO4D;gBACR;gBAMA,IAAIO,KAAK,IAAI,CAAC,SAACC,GAAG;2BAAKA,QAAQiC;oBAC9B,MAAM,IAAIvC,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAE3F,IAAI,AAAkB,YAAlB,OAAOwJ,QAAqB;oBAC/B,IAAI1H,OAAO,SAAS,CAAC,MAAM,IAAIyH,SAASzH,OAAO,SAAS,CAAC,MAAM,IAAI0H,OAAO,MAAM,GAAGnH,OAAO8D,IAAI,CAAC,EAAE,IAAI5F,mBACpG,MAAM,IAAI+B,WAAW;oBAEtB,IAAKR,AAAAA,CAAAA,OAAO,SAAS,CAAC,QAAQ,IAAIyH,SAASzH,OAAO,SAAS,CAAC,QAAQ,IAAIyH,SAASzH,OAAO,SAAS,CAAC,MAAK,KAAMO,OAAO8D,IAAI,CAAC,EAAE,IAAI5F,mBAC9H,MAAM,IAAI+B,WAAW;oBAEtB,IAAIR,OAAO,SAAS,CAAC,MAAM,IAAIyH,SAASzH,OAAO,SAAS,CAAC,MAAM,EAAE;wBAChE,IAAM2H,eAAeD,OAAO,MAAM,GAAGrD,KAAK,MAAM,CAAC,SAACuD,MAAM,EAAE1H,KAAK;mCAAK0H,SAAS5H,OAAOE,OAAO,MAAM;2BAAE;wBACnG,IAAIyH,eAAelJ,mBAClB,MAAM,IAAI+B,WAAW;oBAEvB;oBACA,IAAKR,OAAO,SAAS,CAAC,OAAO,IAAIyH,SAASzH,OAAO,SAAS,CAAC,OAAO,IAAMA,OAAO,SAAS,CAAC,UAAU,IAAIyH,SAASzH,OAAO,SAAS,CAAC,UAAU,EAC1I;wBAAA,IAAI,AAAmB,YAAnB,OAAOqE,IAAI,CAAC,EAAE,EAAe;4BAChC,IAAI,AAAmB,cAAnB,OAAOA,IAAI,CAAC,EAAE,IAAoB,AAAmB,YAAnB,OAAOA,IAAI,CAAC,EAAE,IAAiB,6BAAgB,IAAI,CAACA,IAAI,CAAC,EAAE,GAChG,MAAM,IAAIL,MAAM;4BAEjB,IAAI0D,OAAO,MAAM,GAAG3C,KAAK,GAAG,CAAC,GAAGV,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,UACjD,MAAM,IAAI7D,WAAW;4BAEtB,IAAMqH,aAAapH,oBAAoBiH,QAAQrD,IAAI,CAAC,EAAE,EAAEoD,SAASzH,OAAO,SAAS,CAAC,UAAU;4BAC5F,IAAI0H,OAAO,MAAM,GAAGG,aAAa7H,OAAOqE,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG5F,mBACzD,MAAM,IAAI+B,WAAW;wBAEvB;oBAAA;oBAED,IAAIiH,SAASzH,OAAO,SAAS,CAAC,KAAK,EAAE;wBACpC,IAAIqE,AAAY,OAAZA,IAAI,CAAC,EAAE,IAAWqD,OAAO,MAAM,GAAGnJ,kBACrC,MAAM,IAAIiC,WAAW;wBAEtB,IAAI,AAAmB,YAAnB,OAAO6D,IAAI,CAAC,EAAE,IAAiBA,AAAY,OAAZA,IAAI,CAAC,EAAE,IAAW5D,oBAAoBiH,QAAQrD,IAAI,CAAC,EAAE,EAAE,SAAS9F,kBAClG,MAAM,IAAIiC,WAAW;oBAEvB;gBACD;gBACA,IAAKkH,AAAAA,CAAAA,WAAW3F,SAASlD,yBAAyB,GAAG,CAAC6I,OAAM,KAAMD,SAASC,OAAO,IAAI,EAAE;oBACvF,IAAMI,SAASzD,IAAI,CAAC,EAAE;wBAC6D0D;oBAAnF,IAAM7C,OAAO,AAAkB,YAAlB,OAAO4C,UAAuB/F,MAAM,OAAO,CAAC+F,UAAUA,OAAO,MAAM,GAAGC,QAAAA,CAAAA,eAAAA,QAAAA,SAAAA,KAAAA,IAAAA,OAAQ,IAAI,AAAD,IAAXA,eAAgBD,QAAAA,SAAAA,KAAAA,IAAAA,OAAQ,MAAM;oBACjH,IAAI,AAAgB,YAAhB,OAAO5C,QAAqBA,OAAO3G,kBACtC,MAAM,IAAIiC,WAAW;gBAEvB;gBAEA,IAAI,AAAgB,cAAhB,OAAOiH,MAAqB;oBAC/B,IAAMO,eAAeC,cAAclE,KAAK,MAAM;oBAC9C,MAAM,IAAIrC,UAAU9B,mBAAmB1B,eAAe,eAAe,EAAE;wBAAC8J;qBAAa;gBACtF;gBAEA,IAAMlE,SAAS2D,KAAK,KAAK,CAACC,QAAQrD;gBAKlC,IAAUxC,YAANiC,QAAkBG,UACrB,MAAM,IAAID,MAAMpE,mBAAmB1B,eAAe,cAAc,EAAE;oBAAC;iBAAsC;gBAG1G,OAAO4F;YACR;;;YAOAoE,KAAAA;mBAAAA,SAAsBnE,IAAI;gBACzB,IAAID,SAAS;gBACb,IAAMqE,kBAAkBpE,KAAK,WAAW,CAAC,MAAM;gBAE/C,IAAK,IAAI0C,IAAI,GAAGA,IAAI1C,KAAK,MAAM,CAAC,MAAM,EAAE0C,IAAK;oBAC5C3C,UAAUC,KAAK,MAAM,CAAC0C,EAAE,CAAC,KAAK,CAAC,GAAG;oBAClC,IAAIA,IAAI0B,iBACPrE,UAAU,IAAI,CAAC,KAAK,CAACC,KAAK,WAAW,CAAC0C,EAAE;gBAE1C;gBAEA,OAAO3C;YACR;;;;YApoBOP,KAAAA;mBAAP,SAAgBC,UAAU,EAAE1D,OAAO;gBAClC,IAAMsI,YAAY,IA5BPlF,UA4BqBpD;gBAChC,OAAOsI,UAAU,QAAQ,CAAC5E;YAC3B;;;WA9BYN;;AAuqBN,SAAS+E,cAAclE,IAAI;IACjC,OAAQA,KAAK,IAAI;QAChB,KAAK;YACJ,OAAOA,KAAK,IAAI;QAEjB,KAAK;YACJ,OAAOA,KAAK,GAAG;QAEhB,KAAK;YACJ,OAAQ,IAAgE,OAA7DA,KAAK,QAAQ,CAAC,GAAG,CAAC,SAACsE,KAAK;uBAAKJ,cAAcI;eAAQ,IAAI,CAAC,MAAK;QAEzE,KAAK;YAEJ,IAAItE,AAA2B,MAA3BA,KAAK,UAAU,CAAC,MAAM,EACzB,OAAO;YAGR,OAAO;QAER,KAAK;YACJ,IAAMuE,YAAYL,cAAclE,KAAK,MAAM;YAC3C,IAAMwE,cAAcN,cAAclE,KAAK,QAAQ;YAE/C,IAAIA,KAAK,QAAQ,EAChB,OAAQ,GAAewE,MAAAA,CAAbD,WAAU,KAAe,OAAZC,aAAY;YAEpC,OAAQ,GAAeA,MAAAA,CAAbD,WAAU,KAAe,OAAZC;QAExB;YACC,OAAO;IAET;AACD;ACp8BC;;;;;;;;;;;;;;;;;AACD,IAAMC,8BAA8B;AACpC,IAAMC,mCAAmC;AACzC,IAAMC,qBAAqB;AAC3B,IAAMC,0BAA0B;AAEhC,SAAS1I,6BAAcC,KAAK,EAAEC,IAAI,EAAEC,YAAY,EAAEC,OAAO;IACxD,IAAIH,AAAUI,WAAVJ,OACH,OAAOE;IAER,IAAI,CAACG,OAAO,aAAa,CAACL,UAAUA,QAAQ,KAAKA,QAAQG,SACxD,MAAM,IAAIG,WAAY,GAA2CH,MAAAA,CAAzCF,MAAK,sCAA4C,OAARE;IAElE,OAAOH;AACR;AAEA,IAAM0I,gCAAcA,WAAAA,GAApB;;aAAMA;YAQOxF,UAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAU,CAAC;8CARlBwF;QASJxF,QAAAA,WAAAA,CAAAA,UAAY,CAAC;QACb,IAAI,CAAC,iBAAiB,GAAGnD,6BAAcmD,QAAQ,iBAAiB,EAAE,qBAAqBoF,6BAA6BC;QACpH,IAAI,CAAC,SAAS,GAAGxI,6BAAcmD,QAAQ,SAAS,EAAE,aAAasF,oBAAoBC;QACnF,IAAIvF,AAA4B9C,WAA5B8C,QAAQ,eAAe,IAAmB,CAAmC,YAAnC,OAAOA,QAAQ,eAAe,IAAiBA,AAAmC,MAAnCA,QAAQ,eAAe,CAAC,MAAM,IAAUA,QAAQ,eAAe,CAAC,MAAM,GAAG,GAAE,GACvK,MAAM,IAAI1B,UAAU;QAErB,IAAI0B,AAA0B9C,WAA1B8C,QAAQ,aAAa,IAAmB,CAAiC,YAAjC,OAAOA,QAAQ,aAAa,IAAiBA,AAAiC,MAAjCA,QAAQ,aAAa,CAAC,MAAM,IAAUA,QAAQ,aAAa,CAAC,MAAM,GAAG,GAAE,GAC/J,MAAM,IAAI1B,UAAU;QAGrB,IAAI,CAAC,SAAS,GAAG0B,QAAQ,eAAe,IAAI;QAC5C,IAAI,CAAC,OAAO,GAAGA,QAAQ,aAAa,IAAI;QAGxC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;QACrC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;QAGjC,IAAI,CAAC,kBAAkB,GAAGA,AAA+B,SAA/BA,QAAQ,kBAAkB;;gCA3BhDwF,gBAAAA;;YAmCLC,KAAAA;mBAAAA,SAAMhJ,QAAQ;;gBAEb,IAAI,AAAoB,YAApB,OAAOA,UACV,MAAM,IAAI6B,UAAU;gBAErB,IAAI7B,SAAS,MAAM,GAAG,IAAI,CAAC,iBAAiB,EAC3C,MAAM,IAAIW,WAAY,0CAAgE,OAAvB,IAAI,CAAC,iBAAiB,EAAC;gBAGvF,IAAMsI,SAAS,EAAE;gBACjB,IAAMC,YAAY,SAACC,KAAK;oBACvB,IAAIF,OAAO,MAAM,IAAI,MAAK,SAAS,EAClC,MAAM,IAAItI,WAAY,+CAA6D,OAAf,MAAK,SAAS;oBAEnFsI,OAAO,IAAI,CAACE;gBACb;gBACA,IAAMpB,SAAS/H,SAAS,MAAM;gBAG9B,IAAIoJ,QAAQ;gBACZ,IAAIC,SAAS;gBACb,IAAIC,eAAe;gBACnB,IAAIC,MAAM;gBAGV,MAAOA,MAAMxB,OAAQ;oBACpB,IAAMyB,OAAOxJ,QAAQ,CAACuJ,IAAI;oBAC1B,IAAME,WAAWzJ,QAAQ,CAACuJ,MAAM,EAAE;oBAGlC,OAAQH;wBAEP,KAAK;4BAEJ,IAAI,IAAI,CAAC,QAAQ,CAACG,KAAKvJ,UAAU,IAAI,CAAC,SAAS,GAAG;gCAEjD,IAAIqJ,OAAO,MAAM,GAAG,GAAG;oCACtBH,UAAU;wCAAE,MAAM;wCAAQ,OAAOG;wCAAQ,OAAOE,MAAMF,OAAO,MAAM;wCAAE,KAAKE;oCAAI;oCAC9EF,SAAS;gCACV;gCAEAD,QAAQ;gCACRE,eAAeC;gCACfA,OAAO,IAAI,CAAC,QAAQ;gCACpB;4BACD;4BAEAF,UAAUG;4BACV;wBAGD,KAAK;4BAEJ,IAAIA,AAAS,QAATA,MAEHJ,QAAQ;iCACF,IAAII,AAAS,QAATA,MAEVJ,QAAQ;iCACF,IAAII,AAAS,QAATA,MAEVJ,QAAQ;iCACF,IAAII,AAAS,SAATA,MAEYJ,QAAlBK,AAAa,QAAbA,WAA0B,cACrBA,AAAa,QAAbA,WAA0B,cAC1BA,AAAa,QAAbA,WAA0B,oBACtB;iCACP,IAAI,IAAI,CAAC,QAAQ,CAACF,KAAKvJ,UAAU,IAAI,CAAC,OAAO,GAAG;gCAEtD,IAAM0J,YAAY,IAAI,CAAC,kBAAkB,GAAGL,SAASA,OAAO,IAAI;gCAChE,IAAIK,UAAU,MAAM,GAAG,GACtBR,UAAU;oCACT,MAAM;oCACN,OAAOQ;oCACP,OAAOJ;oCACP,KAAKC,MAAM,IAAI,CAAC,MAAM;oCACtB,cAAcD,eAAe,IAAI,CAAC,QAAQ;oCAC1C,YAAYC;gCACb;gCAGDF,SAAS;gCACTD,QAAQ;gCACRG,OAAO,IAAI,CAAC,MAAM;gCAClB;4BACD;4BAEAF,UAAUG;4BACV;wBAGD,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHJ,QAAQ;iCACF,IAAII,AAAS,QAATA,MACVJ,QAAQ;4BAETC,UAAUG;4BACV;wBAED,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHJ,QAAQ;iCACF,IAAII,AAAS,QAATA,MACVJ,QAAQ;4BAETC,UAAUG;4BACV;wBAED,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHJ,QAAQ;iCACF,IAAII,AAAS,QAATA,MACVJ,QAAQ;4BAETC,UAAUG;4BACV;wBAID,KAAK;4BACJH,UAAUG;4BACVJ,QAAQ;4BACR;wBAED,KAAK;4BACJC,UAAUG;4BACVJ,QAAQ;4BACR;wBAED,KAAK;4BACJC,UAAUG;4BACVJ,QAAQ;4BACR;wBAED,KAAK;4BACJC,UAAUG;4BACVJ,QAAQ;4BACR;oBACF;oBAGAG;gBACD;gBAIA,IAAIF,OAAO,MAAM,GAAG,GACnB,IAAID,AAAU,WAAVA,OAEHF,UAAU;oBAAE,MAAM;oBAAQ,OAAOG;oBAAQ,OAAOE,MAAMF,OAAO,MAAM;oBAAE,KAAKE;gBAAI;qBACxE;oBAEN,IAAMI,iBAAiB,IAAI,CAAC,SAAS,GAAGN;oBACxCH,UAAU;wBAAE,MAAM;wBAAQ,OAAOS;wBAAgB,OAAOL;wBAAc,KAAKC;oBAAI;gBAChF;gBAGD,OAAON;YACR;;;YAUAW,KAAAA;mBAAAA,SAASL,GAAG,EAAEvJ,QAAQ,EAAE6J,QAAQ;gBAE/B,IAAIN,MAAMM,SAAS,MAAM,GAAG7J,SAAS,MAAM,EAC1C,OAAO;gBAIR,IAAK,IAAI4G,IAAI,GAAGA,IAAIiD,SAAS,MAAM,EAAEjD,IACpC,IAAI5G,QAAQ,CAACuJ,MAAM3C,EAAE,KAAKiD,QAAQ,CAACjD,EAAE,EACpC,OAAO;gBAIT,OAAO;YACR;;;;YAQOoC,KAAAA;mBAAP,SAAahJ,QAAQ,EAAEuD,OAAO;gBAC7B,IAAMuG,SAAS,IApOXf,eAoO8BxF;gBAClC,OAAOuG,OAAO,KAAK,CAAC9J;YACrB;;;WAtOK+I;;;;;;ACfN,IAAMgB,mCAAmC;AACzC,IAAMC,2BAA2B;AACjC,IAAMC,qCAAqC;AAC3C,IAAMC,6BAA6B;AAEnC,SAAS9J,kBAAcC,KAAK,EAAEC,IAAI,EAAEC,YAAY,EAAEC,OAAO;IACxD,IAAIH,AAAUI,WAAVJ,OACH,OAAOE;IAER,IAAI,CAACG,OAAO,aAAa,CAACL,UAAUA,QAAQ,KAAKA,QAAQG,SACxD,MAAM,IAAIG,WAAY,GAA2CH,MAAAA,CAAzCF,MAAK,sCAA4C,OAARE;IAElE,OAAOH;AACR;AAUO,SAAS8J,eAAexG,UAAU,EAAE1D,OAAO;IACjD,OAAOoD,oBAAAA,QAAkB,CAACM,YAAY1D;AACvC;AAYO,SAASmK,aAAapK,QAAQ,EAAEC,OAAO,EAAEoK,qBAAqB;IACpE,IAAM9G,UAAU8G,QAAAA,wBAAAA,wBAAyB,CAAC;IAC1C,IAAMC,iBAAiBlK,kBAAcmD,QAAQ,cAAc,EAAE,kBAAkBwG,kCAAkCC;IACjH,IAAMO,kBAAkBnK,kBAAcmD,QAAQ,eAAe,EAAE,mBAAmB0G,oCAAoCC;IACtH,IAAMjB,SAASF,8BAAAA,KAAoB,CAAC/I,UAAUuD;IAC9C,IAAIU,SAAS;IACb,IAAIqE,kBAAkB;IAStB,IAAMC,YAAY,IAAIlF,oBAAUpD,SAAS;QACxC,gBAAgBsD,QAAQ,mBAAmB;QAC3C,oBAAoBA,QAAQ,kBAAkB;IAC/C;IAEA,IAAMiH,cAAc;QACnB,MAAM,SAACrB,KAAK;mBAAKA,MAAM,KAAK;;QAC5B,YAAY,SAACA,KAAK;YACjB,IAAI;gBACH,OAAOZ,UAAU,QAAQ,CAACY,MAAM,KAAK;YACtC,EAAE,OAAO9E,OAAO;gBAEf,IAASrC,eAALqC,OAAiBgC,mBAAkBhC,MAAM,OAAO,CAAC,QAAQ,CAAC,mBAC7D,OAAO;gBAEP,MAAMA;YAER;QACD;IACD;QAEK1C,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;QAAL,QAAKA,YAAesH,MAAM,CAANA,OAAAA,QAAAA,CAAAA,IAAftH,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAuB;YAAvBA,IAAMwH,QAANxH,MAAAA,KAAAA;gBAEY8I;YAAhB,IAAMC,UAAUD,QAAAA,CAAAA,0BAAAA,WAAW,CAACtB,MAAM,IAAI,CAAC,AAAD,IAAtBsB,0BAA2BD,WAAW,CAAC,OAAO;YAC9D,IAAIrB,AAAe,iBAAfA,MAAM,IAAI,EAAmB;gBAChCb;gBACA,IAAIA,kBAAkBgC,gBACrB,MAAM,IAAI3J,WAAY,oDAAkE,OAAf2J;YAE3E;YAEA,IAAMK,QAAQxK,OAAOuK,QAAQvB;YAC7B,IAAIlF,OAAO,MAAM,GAAG0G,MAAM,MAAM,GAAGJ,iBAClC,MAAM,IAAI5J,WAAY,iDAAgE,OAAhB4J,iBAAgB;YAEvFtG,UAAU0G;QACX;;QAfKhJ,oBAAAA;QAAAA,iBAAAA;;;iBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;gBAAAA,mB,MAAAA;;;IAiBL,OAAOsC;AACR"}
1	+ {"version":3,"file":"cjs/index.cjs","sources":["webpack/runtime/define_property_getters","webpack/runtime/has_own_property","webpack/runtime/make_namespace_object","../../src/block.js","../../src/Evaluator.js","../../src/TemplateParser.js","../../src/index.js"],"sourcesContent":["__webpack_require__.d = function(exports, definition) {\n\tfor(var key in definition) {\n if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n }\n }\n};","__webpack_require__.o = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); }","// define __esModule on exports\n__webpack_require__.r = function(exports) {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","const mutableMethods = [\n\t\"Array.prototype.push\",\n\t\"Array.prototype.pop\",\n\t\"Array.prototype.shift\",\n\t\"Array.prototype.unshift\",\n\t\"Array.prototype.splice\",\n\t\"Array.prototype.reverse\",\n\t\"Array.prototype.sort\",\n\t\"Array.prototype.fill\",\n\t\"Array.prototype.copyWithin\",\n\n\t\"Object.create\",\n\t\"Object.defineProperty\",\n\t\"Object.defineProperties\",\n\t\"Object.preventExtensions\",\n\t\"Object.seal\",\n\t\"Object.freeze\",\n\t\"Object.setPrototypeOf\",\n\t\"Object.assign\",\n\t\"Object.prototype.__defineGetter__\",\n\t\"Object.prototype.__defineSetter__\",\n\n\t\"Reflect.set\",\n\t\"Reflect.defineProperty\",\n\t\"Reflect.deleteProperty\",\n\t\"Reflect.setPrototypeOf\",\n\t\"Reflect.preventExtensions\",\n\n\t\"Set.prototype.add\",\n\t\"Set.prototype.delete\",\n\t\"Set.prototype.clear\",\n\t\"WeakSet.prototype.add\",\n\t\"WeakSet.prototype.delete\",\n\n\t\"Map.prototype.set\",\n\t\"Map.prototype.delete\",\n\t\"Map.prototype.clear\",\n\t\"WeakMap.prototype.set\",\n\t\"WeakMap.prototype.delete\",\n\n\t\"Date.prototype.setTime\",\n\t\"Date.prototype.setMilliseconds\",\n\t\"Date.prototype.setUTCSeconds\",\n\t\"Date.prototype.setSeconds\",\n\t\"Date.prototype.setMinutes\",\n\t\"Date.prototype.setHours\",\n\t\"Date.prototype.setDate\",\n\t\"Date.prototype.setMonth\",\n\t\"Date.prototype.setFullYear\",\n\t\"Date.prototype.setYear\",\n\t\"Date.prototype.setUTCMilliseconds\",\n\t\"Date.prototype.setUTCMinutes\",\n\t\"Date.prototype.setUTCHours\",\n\t\"Date.prototype.setUTCDate\",\n\t\"Date.prototype.setUTCMonth\",\n\t\"Date.prototype.setUTCFullYear\",\n\n\t\"RegExp.prototype.compile\",\n\n\t\"Int8Array.prototype.set\",\n\t\"Uint8Array.prototype.set\",\n\t\"Uint8ClampedArray.prototype.set\",\n\t\"Int16Array.prototype.set\",\n\t\"Uint16Array.prototype.set\",\n\t\"Int32Array.prototype.set\",\n\t\"Uint32Array.prototype.set\",\n\t\"Float32Array.prototype.set\",\n\t\"Float64Array.prototype.set\",\n\t\"BigInt64Array.prototype.set\",\n\t\"BigUint64Array.prototype.set\",\n\n\t\"Int8Array.prototype.fill\",\n\t\"Uint8Array.prototype.fill\",\n\t\"Uint8ClampedArray.prototype.fill\",\n\t\"Int16Array.prototype.fill\",\n\t\"Uint16Array.prototype.fill\",\n\t\"Int32Array.prototype.fill\",\n\t\"Uint32Array.prototype.fill\",\n\t\"Float32Array.prototype.fill\",\n\t\"Float64Array.prototype.fill\",\n\t\"BigInt64Array.prototype.fill\",\n\t\"BigUint64Array.prototype.fill\",\n\n\t\"Int8Array.prototype.reverse\",\n\t\"Uint8Array.prototype.reverse\",\n\t\"Uint8ClampedArray.prototype.reverse\",\n\t\"Int16Array.prototype.reverse\",\n\t\"Uint16Array.prototype.reverse\",\n\t\"Int32Array.prototype.reverse\",\n\t\"Uint32Array.prototype.reverse\",\n\t\"Float32Array.prototype.reverse\",\n\t\"Float64Array.prototype.reverse\",\n\t\"BigInt64Array.prototype.reverse\",\n\t\"BigUint64Array.prototype.reverse\",\n\n\t\"Int8Array.prototype.sort\",\n\t\"Uint8Array.prototype.sort\",\n\t\"Uint8ClampedArray.prototype.sort\",\n\t\"Int16Array.prototype.sort\",\n\t\"Uint16Array.prototype.sort\",\n\t\"Int32Array.prototype.sort\",\n\t\"Uint32Array.prototype.sort\",\n\t\"Float32Array.prototype.sort\",\n\t\"Float64Array.prototype.sort\",\n\t\"BigInt64Array.prototype.sort\",\n\t\"BigUint64Array.prototype.sort\",\n\n\t\"Int8Array.prototype.copyWithin\",\n\t\"Uint8Array.prototype.copyWithin\",\n\t\"Uint8ClampedArray.prototype.copyWithin\",\n\t\"Int16Array.prototype.copyWithin\",\n\t\"Uint16Array.prototype.copyWithin\",\n\t\"Int32Array.prototype.copyWithin\",\n\t\"Uint32Array.prototype.copyWithin\",\n\t\"Float32Array.prototype.copyWithin\",\n\t\"Float64Array.prototype.copyWithin\",\n\t\"BigInt64Array.prototype.copyWithin\",\n\t\"BigUint64Array.prototype.copyWithin\",\n\n\t\"ArrayBuffer.prototype.transfer\",\n\t\"ArrayBuffer.prototype.transferToFixedLength\",\n\n\t\"SharedArrayBuffer.prototype.grow\",\n\n\t\"DataView.prototype.setInt8\",\n\t\"DataView.prototype.setUint8\",\n\t\"DataView.prototype.setInt16\",\n\t\"DataView.prototype.setUint16\",\n\t\"DataView.prototype.setInt32\",\n\t\"DataView.prototype.setUint32\",\n\t\"DataView.prototype.setFloat32\",\n\t\"DataView.prototype.setFloat64\",\n\t\"DataView.prototype.setBigInt64\",\n\t\"DataView.prototype.setBigUint64\",\n\n\t\"Generator.prototype.next\",\n\t\"Generator.prototype.return\",\n\t\"Generator.prototype.throw\",\n\n\t\"AsyncGenerator.prototype.next\",\n\t\"AsyncGenerator.prototype.return\",\n\t\"AsyncGenerator.prototype.throw\",\n\n\t\"Iterator.prototype.next\",\n\n\t\"WeakRef.prototype.deref\",\n\n\t\"FinalizationRegistry.prototype.register\",\n\t\"FinalizationRegistry.prototype.unregister\",\n\n\t\"URLSearchParams.prototype.append\",\n\t\"URLSearchParams.prototype.delete\",\n\t\"URLSearchParams.prototype.set\",\n\t\"URLSearchParams.prototype.sort\",\n\n\t\"FormData.prototype.append\",\n\t\"FormData.prototype.delete\",\n\t\"FormData.prototype.set\",\n\n\t\"Headers.prototype.append\",\n\t\"Headers.prototype.delete\",\n\t\"Headers.prototype.set\",\n\n\t// Function call/apply/bind can be used to invoke with arbitrary `this`\n\t\"Function.prototype.call\",\n\t\"Function.prototype.apply\",\n\t\"Function.prototype.bind\",\n\t\"Function.prototype.constructor\",\n\n\t// Legacy lookup helpers\n\t\"Object.prototype.__lookupGetter__\",\n\t\"Object.prototype.__lookupSetter__\",\n\n\t// Constructor property can be abused to retrieve the Function constructor\n\t\"Object.prototype.constructor\",\n];\n\nconst dangerousMethods = [\n\t\"Object.getPrototypeOf\",\n\t// Various reflective/object-inspection APIs that may expose internals\n\t\"Object.getOwnPropertyDescriptor\",\n\t\"Object.getOwnPropertyDescriptors\",\n\t\"Object.getOwnPropertyNames\",\n\t\"Object.getOwnPropertySymbols\",\n\n\t// Error reflection: Error.captureStackTrace(obj) installs a host `stack`\n\t// property on any object - including Object.prototype - polluting the\n\t// host. Error.prepareStackTrace is a host-installed callback that, if\n\t// called with attacker-controlled Error/frames, executes host code paths.\n\t\"Error.captureStackTrace\",\n\t\"Error.prepareStackTrace\",\n];\n\n// Some prototype-style aliases/properties that can be used to break sandboxes\nmutableMethods.push(\"Object.prototype.__proto__\");\n\n/*\n List of methods to block due to mutability or dangerousness\n /\nexport const blockedMethods = [...mutableMethods, ...dangerousMethods];\n\n/\n List of global built-ins to block entirely\n /\nexport const blockedGlobalBuiltIns = [\n\t\"Function\",\n\t\"GeneratorFunction\",\n\t\"AsyncFunction\",\n\t\"AsyncGeneratorFunction\",\n\t\"eval\",\n\t\"setTimeout\",\n\t\"setInterval\",\n\t\"clearTimeout\",\n\t\"clearInterval\",\n\t\"setImmediate\",\n\t\"XMLHttpRequest\",\n\t\"fetch\",\n\t\"WebSocket\",\n\t\"globalThis\",\n\n\t// Node / runtime globals\n\t\"process\",\n\t\"require\",\n\t\"module\",\n\t\"exports\",\n\t\"global\",\n\t\"Buffer\",\n\t\"setImmediate\",\n\t\"clearImmediate\",\n\n\t// Worker / threading / messaging\n\t\"importScripts\",\n\t\"Worker\",\n\t\"SharedWorker\",\n\t\"ServiceWorker\",\n\t\"BroadcastChannel\",\n\t\"MessageChannel\",\n\t\"MessagePort\",\n\t\"postMessage\",\n\n\t// Host environment globals (browser)\n\t\"window\",\n\t\"document\",\n\t\"navigator\",\n\t\"location\",\n\t\"localStorage\",\n\t\"sessionStorage\",\n\t\"indexedDB\",\n\t\"performance\",\n\n\t// Low-level / concurrent / binary APIs\n\t\"Proxy\",\n\t\"Reflect\",\n\t\"Atomics\",\n\t\"WebAssembly\",\n\t// SharedArrayBuffer escapes as a live reference to host shared memory\n\t// (structuredClone copies the handle, not the memory) and its constructor\n\t// allows multi-GiB allocations from ~20 characters of input\n\t\"SharedArrayBuffer\",\n\n\t// Asynchronous scheduling primitives that invoke callbacks in the host\n\t// runtime after evaluate() returns, escaping synchronous error handling\n\t\"queueMicrotask\",\n\t// AbortSignal.timeout() schedules a host timer whose abort listener runs\n\t// outside the interpreter; the whole global is blocked to close that hole\n\t\"AbortSignal\",\n\n\t// Promise is removed entirely. Any Promise that escapes evaluate() would\n\t// schedule its settlement callbacks in the host microtask queue, where\n\t// errors bypass the caller's synchronous try/catch and become unhandled\n\t// rejections. This single entry replaces the former per-method blocklist\n\t// (then/catch/finally/resolve/reject/all/race/any/allSettled/withResolvers).\n\t\"Promise\",\n\n\t// Console and internationalization\n\t\"console\",\n\t\"Intl\",\n\n\t// Other runtimes\n\t\"Deno\",\n];\n","import as acorn from \"acorn\";\nimport globals from \"globals\";\nimport { blockedGlobalBuiltIns, blockedMethods } from \"./block.js\";\n\n// Error message constants for better maintainability\nconst ERROR_MESSAGES = {\n\tCAN_NOT_READ_PROPERTY: \"Cannot read property of {0} (reading '{1}')\",\n\tIS_INVALID_SYNTAX: \"{0} is not a valid syntax\",\n\tIS_NOT_FUNCTION: \"{0} is not a function\",\n\tIS_NOT_DEFINED: \"{0} is not defined\",\n\tIS_NOT_ALLOWED: \"{0} is not allowed\",\n\tEXPRESSION_TOO_LONG: \"Expression exceeds the maximum length of {0} characters\",\n};\n\n/*\n Default maximum input length for a single expression.\n * Protects against resource exhaustion from overly long inputs.\n * Can be overridden per-instance via `new Evaluator(variables, { maxInputLength })`.\n /\nconst DEFAULT_MAX_INPUT_LENGTH = 10000;\nconst MAX_CONFIGURABLE_INPUT_LENGTH = 100000;\nconst DEFAULT_MAX_EVALUATION_STEPS = 10000;\nconst MAX_CONFIGURABLE_EVALUATION_STEPS = 100000;\nconst MAX_ARRAY_LENGTH = 10000;\nconst MAX_BUFFER_BYTES = 1000000;\nconst MAX_STRING_LENGTH = 100000;\nconst MAX_DATA_NODES = 100000;\nconst MAX_BIGINT_EXPONENT = 256n;\nconst MAX_BIGINT_BITS = 65536;\nconst DEFAULT_MAX_DEPTH = 1000;\nconst MAX_CONFIGURABLE_DEPTH = 2000;\nconst MAX_REGEXP_SOURCE_LENGTH = 1000;\nconst MAX_REGEXP_FLAGS_LENGTH = 32;\n/\n Builtins that must never be exposed even though the host runtime provides\n * them. They are either host-only references (WeakRef/FinalizationRegistry),\n * escaped-memory handles (SharedArrayBuffer), deprecated helpers, or reflection\n * surfaces with no legitimate expression use. Kept as an explicit exclusion\n * list on top of the allowlist below so a future V8 global cannot slip in.\n /\nconst NON_SANDBOX_GLOBALS = new Set([\"WeakRef\", \"FinalizationRegistry\", \"Iterator\", \"SharedArrayBuffer\", \"escape\", \"unescape\"]);\nconst TYPED_ARRAY_CONSTRUCTORS = new Set(\n\t[\n\t\tInt8Array,\n\t\tUint8Array,\n\t\tUint8ClampedArray,\n\t\tInt16Array,\n\t\tUint16Array,\n\t\tInt32Array,\n\t\tUint32Array,\n\t\ttypeof Float16Array === \"function\" ? Float16Array : null,\n\t\tFloat32Array,\n\t\tFloat64Array,\n\t\ttypeof BigInt64Array === \"function\" ? BigInt64Array : null,\n\t\ttypeof BigUint64Array === \"function\" ? BigUint64Array : null,\n\t].filter((constructor) => typeof constructor === \"function\")\n);\n\n/\n Returns whether `value` is a typed-array constructor. The explicit set is\n * the fast path; the `BYTES_PER_ELEMENT` probe also catches typed-array\n * constructors added to the host after this module was loaded, so a new\n * global (e.g. a future Float16Array) cannot silently escape the size bounds\n * enforced by {@link Evaluator#assertBoundedConstruction}.\n /\nfunction isTypedArrayConstructor(value) {\n\treturn TYPED_ARRAY_CONSTRUCTORS.has(value) \|\| (typeof value === \"function\" && typeof value.BYTES_PER_ELEMENT === \"number\");\n}\n\n/\n Prototype mutators shared by every typed array. They are inherited from\n * `%TypedArray%.prototype`, so a `hasOwnProperty` walk over each typed-array\n * prototype never finds them - the explicit string paths in `block.js` are\n * therefore resolved here against the actual prototype functions.\n /\nconst TYPED_ARRAY_MUTATORS = (() => {\n\tconst map = new Map();\n\tfor (const constructor of TYPED_ARRAY_CONSTRUCTORS) {\n\t\tfor (const name of [\"set\", \"fill\", \"reverse\", \"sort\", \"copyWithin\"]) {\n\t\t\tconst method = constructor.prototype[name];\n\t\t\tif (typeof method === \"function\" && !map.has(method)) {\n\t\t\t\tmap.set(method, name);\n\t\t\t}\n\t\t}\n\t}\n\treturn map;\n})();\n/\n Sentinel used to distinguish \"caller passed no pre-evaluated object\" from\n * \"the object expression itself evaluated to undefined\". See\n * {@link Evaluator#handleMemberExpression}.\n /\nconst NO_OBJECT = Symbol(\"no-object\");\n\n/\n Renders an error message by replacing placeholders with context values.\n * @param {string} template\n * @param {Record<string, any>} context\n * @example\n * ```js\n * const msg = renderErrorMessage(\"Cannot call mutable prototype method: {method}\", { method: \"push\" });\n * ```\n /\nconst renderErrorMessage = (template, context = {}) => template.replace(/{(\\w+)}/g, (_, key) => String(context[key]));\n\nfunction validateLimit(value, name, defaultValue, maximum) {\n\tif (value === undefined) {\n\t\treturn defaultValue;\n\t}\n\tif (!Number.isSafeInteger(value) \|\| value < 1 \|\| value > maximum) {\n\t\tthrow new RangeError(`${name} must be an integer between 1 and ${maximum}`);\n\t}\n\treturn value;\n}\n\nfunction countLiteralMatches(value, search, all) {\n\tif (search === \"\") {\n\t\treturn all ? value.length + 1 : 1;\n\t}\n\tlet count = 0;\n\tlet position = 0;\n\twhile ((position = value.indexOf(search, position)) !== -1) {\n\t\tcount++;\n\t\tif (!all) {\n\t\t\tbreak;\n\t\t}\n\t\tposition += search.length;\n\t}\n\treturn count;\n}\n\nfunction assertBoundedData(value, label) {\n\tconst pending = [value];\n\tconst seen = new WeakSet();\n\tlet dataSize = 0;\n\tlet dataNodes = 0;\n\tconst enqueueProperties = (object) => {\n\t\tconst keys = Object.keys(object);\n\t\tif (pending.length + keys.length > MAX_DATA_NODES) {\n\t\t\tthrow new RangeError(`${label} exceeds the maximum data node count`);\n\t\t}\n\t\tfor (const key of keys) {\n\t\t\tdataSize += key.length;\n\t\t\tconst descriptor = Object.getOwnPropertyDescriptor(object, key);\n\t\t\tif (!descriptor \|\| !Object.hasOwn(descriptor, \"value\")) {\n\t\t\t\tthrow new TypeError(`${label} cannot contain accessor properties`);\n\t\t\t}\n\t\t\tpending.push(descriptor.value);\n\t\t}\n\t};\n\n\twhile (pending.length > 0) {\n\t\tconst current = pending.pop();\n\t\tdataNodes++;\n\t\tif (dataNodes > MAX_DATA_NODES) {\n\t\t\tthrow new RangeError(`${label} exceeds the maximum data node count`);\n\t\t}\n\n\t\tif (typeof current === \"string\") {\n\t\t\tif (current.length > MAX_STRING_LENGTH) {\n\t\t\t\tthrow new RangeError(`${label} contains a string that exceeds the maximum length`);\n\t\t\t}\n\t\t\tdataSize += current.length + 8;\n\t\t} else if (current === null \|\| (typeof current !== \"object\" && typeof current !== \"function\")) {\n\t\t\tdataSize += 8;\n\t\t\tcontinue;\n\t\t} else if (typeof current === \"function\" \|\| seen.has(current)) {\n\t\t\tcontinue;\n\t\t} else {\n\t\t\tseen.add(current);\n\t\t\tdataSize += 16;\n\t\t\tif (current instanceof ArrayBuffer \|\| ArrayBuffer.isView(current)) {\n\t\t\t\tdataSize += current.byteLength;\n\t\t\t} else if (Array.isArray(current)) {\n\t\t\t\tif (current.length > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(`${label} contains an array that exceeds the maximum length`);\n\t\t\t\t}\n\t\t\t\tdataSize += current.length 8;\n\t\t\t\tenqueueProperties(current);\n\t\t\t} else if (current instanceof Map) {\n\t\t\t\tif (current.size > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(`${label} contains a map that exceeds the maximum size`);\n\t\t\t\t}\n\t\t\t\tdataSize += current.size * 16;\n\t\t\t\tMap.prototype.forEach.call(current, (item, key) => pending.push(key, item));\n\t\t\t} else if (current instanceof Set) {\n\t\t\t\tif (current.size > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(`${label} contains a set that exceeds the maximum size`);\n\t\t\t\t}\n\t\t\t\tdataSize += current.size * 8;\n\t\t\t\tSet.prototype.forEach.call(current, (item) => pending.push(item));\n\t\t\t} else {\n\t\t\t\tenqueueProperties(current);\n\t\t\t}\n\t\t}\n\n\t\tif (dataSize > MAX_BUFFER_BYTES) {\n\t\t\tthrow new RangeError(`${label} exceeds the maximum data size`);\n\t\t}\n\t}\n\treturn { dataSize, dataNodes };\n}\n\nconst BINARY_OPERATION_MAP = {\n\t\"+\": (a, b) => a + b,\n\t\"-\": (a, b) => a - b,\n\t\"\": (a, b) => a b,\n\t\"\": (a, b) => a b,\n\t\"==\": (a, b) => a == b,\n\t\"===\": (a, b) => a === b,\n\t\"!=\": (a, b) => a != b,\n\t\"!==\": (a, b) => a !== b,\n\t\">\": (a, b) => a > b,\n\t\">=\": (a, b) => a >= b,\n\t\"<\": (a, b) => a < b,\n\t\"<=\": (a, b) => a <= b,\n\t\"%\": (a, b) => a % b,\n\t\"/\": (a, b) => a / b,\n\t\"\|\": (a, b) => a \| b,\n\t\"&\": (a, b) => a & b,\n\t\"^\": (a, b) => a ^ b,\n\t\"<<\": (a, b) => a << b,\n\t\">>\": (a, b) => a >> b,\n\t\">>>\": (a, b) => a >>> b,\n\tin: (a, b) => a in b,\n\tinstanceof: (a, b) => a instanceof b,\n};\n\nfunction createGlobalScope() {\n\tconst scope = Object.create(null);\n\tconst { builtin } = globals;\n\n\t// Allowlist: expose a builtin only when the host actually provides it and\n\t// it is not explicitly denied. A missing global (e.g. BigInt64Array on an\n\t// old runtime, or Float16Array before it shipped) is simply skipped instead\n\t// of being defined as `undefined`, so `typeof Missing === \"undefined\"` and\n\t// identifier resolution behave as the platform does.\n\tfor (const key in builtin) {\n\t\tif (blockedGlobalBuiltIns.includes(key)) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (NON_SANDBOX_GLOBALS.has(key)) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (!Object.hasOwn(globalThis, key)) {\n\t\t\tcontinue;\n\t\t}\n\n\t\t/** @type {boolean} /\n\t\tconst isWritable = builtin[key];\n\n\t\tObject.defineProperty(scope, key, {\n\t\t\tvalue: globalThis[key],\n\t\t\twritable: isWritable,\n\t\t\tenumerable: false,\n\t\t\tconfigurable: false,\n\t\t});\n\t}\n\n\tObject.defineProperty(scope, \"globalThis\", {\n\t\tvalue: scope,\n\t\twritable: false,\n\t\tenumerable: false,\n\t\tconfigurable: false,\n\t});\n\n\treturn scope;\n}\n\n// The sandbox global scope is identical for every instance, so build it once.\n// Rebuilding it per `new Evaluator()` cost a full `defineProperty` pass over\n// every builtin (measurably ~5x slower for short-lived instances).\nconst GLOBAL_SCOPE = createGlobalScope();\n\nconst getBlockedMethods = (() => {\n\t/\n\t @type {Map<Function, string>}\n\t /\n\tlet BLOCKED_METHODS = null;\n\n\treturn () => {\n\t\tif (BLOCKED_METHODS) return BLOCKED_METHODS;\n\n\t\tconst map = new Map();\n\t\tfor (const path of blockedMethods) {\n\t\t\tconst [object, ...properties] = path.split(\".\");\n\t\t\tlet current = globalThis[object];\n\t\t\tfor (const prop of properties) {\n\t\t\t\tif (current && Object.hasOwn(current, prop)) {\n\t\t\t\t\tcurrent = current[prop];\n\t\t\t\t} else {\n\t\t\t\t\tcurrent = null;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (typeof current === \"function\") map.set(current, path);\n\t\t}\n\t\tBLOCKED_METHODS = map;\n\n\t\treturn BLOCKED_METHODS;\n\t};\n})();\n\n/\n A JavaScript expression evaluator that safely evaluates expressions within a sandboxed environment.\n * Supports various JavaScript features including arithmetic, logical operations, functions, and more.\n \n Security features:\n * - Blocks mutable methods to prevent side effects\n * - No access to eval() or Function() constructor\n * - Sandboxed scope with limited global objects\n \n @example\n * const evaluator = new Evaluator({ x: 10, y: 20 });\n * evaluator.evaluate('x + y') // returns 30\n /\nexport class Evaluator {\n\t/\n\t Creates a new Evaluator instance with a custom variable context.\n\t * The scope hierarchy is: user variables -> global scope\n\t * @param {Object} [variables={}] - An optional object containing variables to make available in the evaluation context\n\t * @param {Object} [options={}] - Additional configuration options\n\t * @param {number} [options.maxInputLength=10000] - Maximum expression length (hard maximum: 100000)\n\t * @param {number} [options.maxEvaluationSteps=10000] - Maximum AST node visits per evaluation (hard maximum: 100000)\n\t /\n\tconstructor(variables = Object.create(null), options) {\n\t\tthis.maxInputLength = validateLimit(options?.maxInputLength, \"maxInputLength\", DEFAULT_MAX_INPUT_LENGTH, MAX_CONFIGURABLE_INPUT_LENGTH);\n\t\tthis.maxEvaluationSteps = validateLimit(options?.maxEvaluationSteps, \"maxEvaluationSteps\", DEFAULT_MAX_EVALUATION_STEPS, MAX_CONFIGURABLE_EVALUATION_STEPS);\n\t\tthis.maxDepth = validateLimit(options?.maxDepth, \"maxDepth\", DEFAULT_MAX_DEPTH, MAX_CONFIGURABLE_DEPTH);\n\t\tassertBoundedData(variables, \"Evaluation context\");\n\t\tconst clonedVariables = structuredClone(variables);\n\t\tthis.scopes = [clonedVariables, GLOBAL_SCOPE].filter((scope) => scope !== null && scope !== undefined);\n\t\tthis.source = undefined;\n\t\tthis.remainingEvaluationSteps = 0;\n\t\tthis.remainingDataSize = MAX_BUFFER_BYTES;\n\t\tthis.remainingDataNodes = MAX_DATA_NODES;\n\t\tthis.evaluationDepth = 0;\n\t}\n\n\t/\n\t Evaluates a JavaScript expression with an optional context.\n\t * @param {string} expression\n\t * @param {unknown} [context]\n\t * @returns\n\t /\n\tstatic evaluate(expression, context) {\n\t\tconst evaluator = new Evaluator(context);\n\t\treturn evaluator.evaluate(expression);\n\t}\n\n\t/\n\t Parses and evaluates a JavaScript expression using acorn parser.\n\t * @param {string} expression - The JavaScript expression to evaluate\n\t * @returns {} The result of the evaluation\n\t @throws {SyntaxError} If the expression has invalid syntax\n\t * @throws {ReferenceError} If referencing undefined variables\n\t * @throws {TypeError} If performing invalid operations\n\t /\n\tevaluate(expression) {\n\t\tif (typeof expression !== \"string\") {\n\t\t\tthrow new TypeError(\"Expression must be a string\");\n\t\t}\n\n\t\tif (expression.length > this.maxInputLength) {\n\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.EXPRESSION_TOO_LONG, [this.maxInputLength]));\n\t\t}\n\n\t\tthis.source = expression;\n\t\tthis.remainingEvaluationSteps = this.maxEvaluationSteps;\n\t\tthis.remainingDataSize = MAX_BUFFER_BYTES;\n\t\tthis.remainingDataNodes = MAX_DATA_NODES;\n\t\tthis.evaluationDepth = 0;\n\n\t\tlet ast;\n\t\ttry {\n\t\t\tast = acorn.parse(expression, { ecmaVersion: \"latest\" });\n\t\t} catch (error) {\n\t\t\t// acorn parses recursively; a deeply nested expression can exhaust the\n\t\t\t// host call stack before evaluation ever starts. Surface it as a\n\t\t\t// normal SyntaxError instead of leaking a stack-overflow RangeError.\n\t\t\tif (error instanceof RangeError && /call stack/i.test(error.message)) {\n\t\t\t\tthrow new SyntaxError(\"Expression nesting is too deep to parse\");\n\t\t\t}\n\t\t\tthrow error;\n\t\t}\n\n\t\t// Start recursive evaluation from the root node\n\t\ttry {\n\t\t\treturn this.execute(ast.body);\n\t\t} finally {\n\t\t\tthis.source = undefined;\n\t\t}\n\t}\n\n\t/\n\t Executes an array of AST body nodes sequentially.\n\t * @private\n\t * @param {Array} body - Array of AST nodes to execute\n\t * @returns {} The result of the last executed node\n\t /\n\texecute(body) {\n\t\tif (this.remainingEvaluationSteps === 0) {\n\t\t\tthis.remainingEvaluationSteps = this.maxEvaluationSteps;\n\t\t\tthis.remainingDataSize = MAX_BUFFER_BYTES;\n\t\t\tthis.remainingDataNodes = MAX_DATA_NODES;\n\t\t}\n\t\tlet result;\n\n\t\tfor (const node of body) {\n\t\t\tresult = this.visit(node);\n\t\t}\n\n\t\tif (typeof result === \"function\") {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Returning functions from expressions\"]));\n\t\t}\n\n\t\tassertBoundedData(result, \"Evaluation result\");\n\n\t\t// A leaked Promise schedules sandbox callbacks (and rejection errors)\n\t\t// in the host microtask queue, outside the caller's try/catch. Never\n\t\t// allow one to escape evaluate() as a value.\n\t\tif (result instanceof Promise) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Returning promises from expressions\"]));\n\t\t}\n\n\t\t// Final gate: the return value must be cloneable, pure data. A\n\t\t// function (or any non-cloneable object) smuggled inside an object or\n\t\t// array - no matter how deeply nested - fails structuredClone with a\n\t\t// DataCloneError. Without this, closures could escape evaluate() (e.g.\n\t\t// `({ f: () => secret })`) and keep reading the evaluator's scopes\n\t\t// (and host-passed objects) long after evaluate() returned. Cloning\n\t\t// also hands the host a copy instead of a reference to sandbox\n\t\t// internals, and it rejects WeakRef/FinalizationRegistry/Proxy and\n\t\t// other host-only objects.\n\t\ttry {\n\t\t\treturn structuredClone(result);\n\t\t} catch (error) {\n\t\t\tif (error && error.name === \"DataCloneError\") {\n\t\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Returning non-cloneable values from expressions\"]));\n\t\t\t}\n\t\t\tthrow error;\n\t\t}\n\t}\n\n\t/*\n\t Visits an AST node and delegates to the appropriate handler based on node type.\n\t * @private\n\t * @param {import(\"acorn\").Node} node - The AST node to visit\n\t * @returns {} The result of visiting the node\n\t /\n\tvisit(node) {\n\t\tthis.remainingEvaluationSteps--;\n\t\tif (this.remainingEvaluationSteps < 0) {\n\t\t\tthrow new RangeError(\"Evaluation step limit exceeded\");\n\t\t}\n\n\t\t// Bound interpreter recursion depth so a deeply nested expression\n\t\t// (e.g. `[[[[...]]]]`) cannot exhaust the host call stack. The parser\n\t\t// has its own, lower practical limit, but the visitor is reached from\n\t\t// native callbacks too, so it needs an explicit ceiling.\n\t\tthis.evaluationDepth++;\n\t\tif (this.evaluationDepth > this.maxDepth) {\n\t\t\tthis.evaluationDepth--;\n\t\t\tthrow new RangeError(\"Maximum evaluation depth exceeded\");\n\t\t}\n\t\ttry {\n\t\t\treturn this.visitNode(node);\n\t\t} finally {\n\t\t\tthis.evaluationDepth--;\n\t\t}\n\t}\n\n\tvisitNode(node) {\n\t\tswitch (node.type) {\n\t\t\tcase \"ExpressionStatement\": {\n\t\t\t\treturn this.visit(node.expression);\n\t\t\t}\n\t\t\tcase \"BinaryExpression\": {\n\t\t\t\treturn this.handleBinaryExpression(node);\n\t\t\t}\n\t\t\tcase \"LogicalExpression\": {\n\t\t\t\treturn this.handleLogicalExpression(node);\n\t\t\t}\n\t\t\tcase \"UnaryExpression\": {\n\t\t\t\treturn this.handleUnaryExpression(node);\n\t\t\t}\n\t\t\tcase \"Identifier\": {\n\t\t\t\treturn this.handleIdentifier(node);\n\t\t\t}\n\t\t\tcase \"Literal\": {\n\t\t\t\treturn node.value;\n\t\t\t}\n\t\t\tcase \"MemberExpression\": {\n\t\t\t\treturn this.handleMemberExpression(node);\n\t\t\t}\n\t\t\tcase \"ArrayExpression\": {\n\t\t\t\treturn this.handleArrayExpression(node);\n\t\t\t}\n\t\t\tcase \"SpreadElement\": {\n\t\t\t\treturn this.handleSpreadElement(node);\n\t\t\t}\n\t\t\tcase \"ObjectExpression\": {\n\t\t\t\treturn this.handleObjectExpression(node);\n\t\t\t}\n\t\t\tcase \"FunctionExpression\": {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function expression\"]));\n\t\t\t}\n\t\t\tcase \"ArrowFunctionExpression\": {\n\t\t\t\treturn this.handleArrowFunctionExpression(node);\n\t\t\t}\n\t\t\tcase \"CallExpression\": {\n\t\t\t\treturn this.handleCallExpression(node);\n\t\t\t}\n\t\t\tcase \"ConditionalExpression\": {\n\t\t\t\treturn this.visit(node.test) ? this.visit(node.consequent) : this.visit(node.alternate);\n\t\t\t}\n\t\t\tcase \"NewExpression\": {\n\t\t\t\tif (node.callee.type !== \"Identifier\") {\n\t\t\t\t\tthrow new Error(`Unsupported callee type '${node.callee.type}' in new expression`);\n\t\t\t\t}\n\n\t\t\t\tif (node.callee.name === \"Function\") {\n\t\t\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"new Function() constructor\"]));\n\t\t\t\t}\n\n\t\t\t\t// Promise is fully removed from the sandbox; give a clear error\n\t\t\t\t// instead of a generic \"not defined\". Its executor runs\n\t\t\t\t// synchronously, but a throwing executor would turn into a\n\t\t\t\t// rejected Promise that escapes evaluate() and crashes the host.\n\t\t\t\tif (node.callee.name === \"Promise\") {\n\t\t\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Promise constructor\"]));\n\t\t\t\t}\n\t\t\t\tconst Constructor = this.visit(node.callee);\n\n\t\t\t\t// 仅在存在参数时构建数组\n\t\t\t\tconst args = node.arguments.length ? node.arguments.map((arg) => this.visit(arg)) : [];\n\t\t\t\tthis.assertBoundedConstruction(Constructor, args);\n\n\t\t\t\treturn new Constructor(...args);\n\t\t\t}\n\t\t\tcase \"ChainExpression\": {\n\t\t\t\treturn this.visit(node.expression);\n\t\t\t}\n\t\t\tcase \"TemplateLiteral\": {\n\t\t\t\treturn this.handleTemplateLiteral(node);\n\t\t\t}\n\t\t\tcase \"ThisExpression\": {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"'this' expression\"]));\n\t\t\t}\n\t\t\tcase \"WithStatement\": {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"'with' statement\"]));\n\t\t\t}\n\t\t\tdefault: {\n\t\t\t\tlet content = this.source.slice(node.start, node.end);\n\n\t\t\t\tif (content.length > 20) {\n\t\t\t\t\tcontent = content.slice(0, 17) + \"...\";\n\t\t\t\t}\n\n\t\t\t\tthrow new SyntaxError(`'${content}'` + \" \" + renderErrorMessage(ERROR_MESSAGES.IS_INVALID_SYNTAX, [content]));\n\t\t\t}\n\t\t}\n\t}\n\n\t/*\n\t Handles binary expressions (arithmetic and comparison operations).\n\t * @param {import('acorn').BinaryExpression} node\n\t * @private\n\t /\n\thandleBinaryExpression(node) {\n\t\tconst op = node.operator;\n\t\tconst left = this.visit(node.left);\n\t\tconst right = this.visit(node.right);\n\t\tif (op === \"+\" && (typeof left === \"string\" \|\| typeof right === \"string\")) {\n\t\t\tif (String(left).length + String(right).length > MAX_STRING_LENGTH) {\n\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t}\n\t\t}\n\t\tif (typeof left === \"bigint\" && typeof right === \"bigint\") {\n\t\t\tif (op === \"\" && (right > MAX_BIGINT_EXPONENT \|\| right < 0n)) {\n\t\t\t\tthrow new RangeError(`BigInt exponent must be between 0 and ${MAX_BIGINT_EXPONENT}`);\n\t\t\t}\n\t\t\tconst leftBits = left.toString(2).length;\n\t\t\tconst rightBits = right.toString(2).length;\n\t\t\tif (\n\t\t\t\t(op === \"\" && leftBits Number(right) > MAX_BIGINT_BITS) \|\|\n\t\t\t\t(op === \"<<\" && right > BigInt(MAX_BIGINT_BITS)) \|\|\n\t\t\t\t(op === \"<<\" && right >= 0n && leftBits + Number(right) > MAX_BIGINT_BITS) \|\|\n\t\t\t\t(op === \"\" && leftBits + rightBits > MAX_BIGINT_BITS) \|\|\n\t\t\t\t((op === \"+\" \|\| op === \"-\") && Math.max(leftBits, rightBits) + 1 > MAX_BIGINT_BITS)\n\t\t\t) {\n\t\t\t\tthrow new RangeError(\"BigInt result exceeds the maximum allowed size\");\n\t\t\t}\n\t\t}\n\n\t\tif (BINARY_OPERATION_MAP.hasOwnProperty(op)) {\n\t\t\treturn BINARY_OPERATION_MAP[op](left, right);\n\t\t}\n\n\t\tthrow new SyntaxError(`Unsupported operator: ${node.operator}`);\n\t}\n\n\t/\n\t Bounds a regular-expression pattern. There is no execution-time limit on\n\t * a native RegExp, so an oversized source/flags string is rejected up front\n\t * rather than allowed to build a pathological matcher.\n\t * @private\n\t /\n\tassertBoundedRegExp(args) {\n\t\tif (typeof args[0] === \"string\" && args[0].length > MAX_REGEXP_SOURCE_LENGTH) {\n\t\t\tthrow new RangeError(\"RegExp source exceeds the maximum allowed length\");\n\t\t}\n\t\tif (typeof args[1] === \"string\" && args[1].length > MAX_REGEXP_FLAGS_LENGTH) {\n\t\t\tthrow new RangeError(\"RegExp flags exceed the maximum allowed length\");\n\t\t}\n\t}\n\n\tassertBoundedConstruction(Constructor, args) {\n\t\tif (Constructor === RegExp) {\n\t\t\tthis.assertBoundedRegExp(args);\n\t\t}\n\t\tconst size = args[0];\n\t\tif (Constructor === Array && args.length === 1 && typeof size === \"number\" && size > MAX_ARRAY_LENGTH) {\n\t\t\tthrow new RangeError(\"Array length exceeds the maximum allowed length\");\n\t\t}\n\t\tif (Constructor === ArrayBuffer && (size > MAX_BUFFER_BYTES \|\| args[1]?.maxByteLength > MAX_BUFFER_BYTES)) {\n\t\t\tthrow new RangeError(\"ArrayBuffer size exceeds the maximum allowed size\");\n\t\t}\n\t\tif (Constructor === DataView && size instanceof ArrayBuffer && size.byteLength > MAX_BUFFER_BYTES) {\n\t\t\tthrow new RangeError(\"DataView size exceeds the maximum allowed size\");\n\t\t}\n\t\tif (Constructor === Map \|\| Constructor === Set) {\n\t\t\tconst collectionSize = typeof size === \"string\" \|\| Array.isArray(size) ? size.length : size?.size ?? size?.length;\n\t\t\tif (typeof collectionSize === \"number\" && collectionSize > MAX_ARRAY_LENGTH) {\n\t\t\t\tthrow new RangeError(\"Collection source exceeds the maximum allowed size\");\n\t\t\t}\n\t\t}\n\t\tif (isTypedArrayConstructor(Constructor)) {\n\t\t\tlet byteLength;\n\t\t\tif (size instanceof ArrayBuffer) {\n\t\t\t\tconst offset = args[1] ?? 0;\n\t\t\t\tconst elementCount = args[2] ?? Math.floor((size.byteLength - offset) / Constructor.BYTES_PER_ELEMENT);\n\t\t\t\tbyteLength = elementCount Constructor.BYTES_PER_ELEMENT;\n\t\t\t} else {\n\t\t\t\tconst elementCount = typeof size === \"number\" ? size : size?.length ?? 0;\n\t\t\t\tbyteLength = elementCount * Constructor.BYTES_PER_ELEMENT;\n\t\t\t}\n\t\t\tif (byteLength > MAX_BUFFER_BYTES) {\n\t\t\t\tthrow new RangeError(\"Typed array size exceeds the maximum allowed size\");\n\t\t\t}\n\t\t}\n\t}\n\n\t/*\n\t Handles logical expressions (&&, \|\|, ??).\n\t * Implements proper short-circuit evaluation for performance.\n\t * @private\n\t /\n\thandleLogicalExpression(node) {\n\t\tswitch (node.operator) {\n\t\t\tcase \"&&\": {\n\t\t\t\tconst left = this.visit(node.left);\n\t\t\t\treturn left ? this.visit(node.right) : left;\n\t\t\t}\n\t\t\tcase \"\|\|\": {\n\t\t\t\tconst left = this.visit(node.left);\n\t\t\t\treturn left ? left : this.visit(node.right);\n\t\t\t}\n\t\t\tcase \"??\": {\n\t\t\t\tconst left = this.visit(node.left);\n\t\t\t\treturn left !== null && left !== undefined ? left : this.visit(node.right);\n\t\t\t}\n\t\t\tdefault: {\n\t\t\t\tthrow new SyntaxError(`Unsupported logical operator: ${node.operator}`);\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t Handles unary expressions (-, +, !, ~, typeof, void).\n\t * @private\n\t /\n\thandleUnaryExpression(node) {\n\t\tswitch (node.operator) {\n\t\t\tcase \"-\": {\n\t\t\t\treturn -this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"+\": {\n\t\t\t\treturn +this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"!\": {\n\t\t\t\treturn !this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"~\": {\n\t\t\t\treturn ~this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"typeof\": {\n\t\t\t\treturn typeof this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"void\": {\n\t\t\t\treturn void this.visit(node.argument);\n\t\t\t}\n\t\t\tcase \"delete\": {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Delete operator\"]));\n\t\t\t}\n\t\t\tdefault: {\n\t\t\t\tthrow new SyntaxError(`Unsupported unary operator: ${node.operator}`);\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t Handles identifier (variable) lookups in the scope chain.\n\t * @private\n\t /\n\thandleIdentifier(node) {\n\t\tconst name = node.name;\n\t\tfor (const scope of this.scopes) {\n\t\t\tif (Object.hasOwn(scope, name)) {\n\t\t\t\treturn scope[name];\n\t\t\t}\n\t\t}\n\n\t\tthrow new ReferenceError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_DEFINED, [name]));\n\t}\n\n\t/\n\t Handles member expressions (property access like obj.prop or obj[prop]).\n\t * @private\n\t /\n\thandleMemberExpression(node, objectValue = NO_OBJECT) {\n\t\tconst object = objectValue === NO_OBJECT ? this.visit(node.object) : objectValue;\n\t\t// Determine property name: either identifier name or computed value\n\t\tconst isStaticProperty = node.property.type === \"Identifier\" && !node.computed;\n\t\tconst property = isStaticProperty ? node.property.name : this.visit(node.property);\n\n\t\t// Reading `.stack` on an Error instance forces V8 to materialize the\n\t\t// stack, which invokes a host-installed Error.prepareStackTrace with\n\t\t// sandbox-owned values. Block it before* any property access, since\n\t\t// even the prototype check below would trigger the getter.\n\t\tif (property === \"stack\" && object instanceof Error) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Accessing error stack\"]));\n\t\t}\n\n\t\t// Prevent access to prototype properties. The comparison must be guarded\n\t\t// against a null/undefined prototype: for a null-prototype object\n\t\t// (`Object.create(null)`) `object[property]` and `object.__proto__` are\n\t\t// both `undefined`, and `undefined === undefined` would otherwise reject\n\t\t// every missing property with a misleading \"prototype\" error.\n\t\tif (typeof object !== \"undefined\" && object !== null && object.__proto__ !== undefined && object[property] === object.__proto__) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Accessing prototype properties\"]));\n\t\t}\n\n\t\tif (object === null \|\| object === undefined) {\n\t\t\t// optional chaining\n\t\t\tif (node.optional) {\n\t\t\t\treturn void 0;\n\t\t\t}\n\t\t\tthrow new TypeError(renderErrorMessage(ERROR_MESSAGES.CAN_NOT_READ_PROPERTY, [object, property]));\n\t\t}\n\n\t\tconst result = object[property];\n\n\t\t// The Function constructor must never be reachable from an expression.\n\t\t// If it escapes as a value, native callbacks (e.g. Promise.then,\n\t\t// Array.prototype.map) invoke it outside the interpreter's call path,\n\t\t// enabling arbitrary host code execution. This is a structural guard:\n\t\t// no matter how many `.constructor` hops an expression takes, the\n\t\t// final value can never be `Function` (or its prototype).\n\t\tif (result === Function \|\| result === Function.prototype) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function constructor\"]));\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/*\n\t Handles array literal expressions.\n\t * @private\n\t /\n\thandleArrayExpression(node) {\n\t\tconst result = [];\n\n\t\tfor (let i = 0; i < node.elements.length; i++) {\n\t\t\tconst element = node.elements.at(i);\n\n\t\t\t// Array holes (`[1, , 3]`) are represented as null elements by\n\t\t\t// acorn. Preserve them instead of crashing on node.type access.\n\t\t\tif (element === null) {\n\t\t\t\tresult.length++;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst value = this.visit(element);\n\n\t\t\tif (element.type === \"SpreadElement\") {\n\t\t\t\tthis.assertBoundedSpread(result.length, value);\n\t\t\t\tresult.push(...value);\n\t\t\t} else {\n\t\t\t\tresult.push(value);\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n\n\tassertBoundedSpread(currentLength, value) {\n\t\tconst size = typeof value === \"string\" \|\| Array.isArray(value) ? value.length : value?.size;\n\t\tif (typeof size === \"number\" && currentLength + size > MAX_ARRAY_LENGTH) {\n\t\t\tthrow new RangeError(\"Spread value exceeds the maximum allowed length\");\n\t\t}\n\t}\n\n\t/\n\t Handles object literal expressions.\n\t * @returns\n\t /\n\thandleObjectExpression(node) {\n\t\tconst obj = {};\n\t\tlet spreadPropertyCount = 0;\n\t\tfor (const prop of node.properties) {\n\t\t\tif (prop.type === \"SpreadElement\") {\n\t\t\t\tconst spreadValue = this.visit(prop.argument);\n\t\t\t\tspreadPropertyCount += Object.keys(spreadValue).length;\n\t\t\t\tif (spreadPropertyCount > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(\"Object spread exceeds the maximum allowed property count\");\n\t\t\t\t}\n\t\t\t\tObject.assign(obj, spreadValue);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// Computed keys must be evaluated* (`{ [1 + 1]: v }` -> key \"2\"),\n\t\t\t// not taken from the property name. Non-computed keys keep the\n\t\t\t// literal `__proto__: v` semantics (which sets the prototype via\n\t\t\t// the Object.prototype.__proto__ setter), while computed keys are\n\t\t\t// plain properties: `{ [\"__proto__\"]: v }` must NOT touch the\n\t\t\t// prototype.\n\t\t\tconst key = prop.computed ? this.visit(prop.key) : prop.key.name \|\| prop.key.value;\n\t\t\tconst value = this.visit(prop.value);\n\t\t\tif (prop.computed) {\n\t\t\t\tObject.defineProperty(obj, key, { value, writable: true, enumerable: true, configurable: true });\n\t\t\t} else {\n\t\t\t\tobj[key] = value;\n\t\t\t}\n\t\t}\n\t\treturn obj;\n\t}\n\n\thandleSpreadElement(node) {\n\t\treturn this.visit(node.argument);\n\t}\n\n\t/*\n\t Handles arrow function expressions.\n\t * Creates a closure that captures the current scope and executes the function body\n\t * with parameters bound to a new scope.\n\t * @private\n\t /\n\thandleArrowFunctionExpression(node) {\n\t\treturn (...args) => {\n\t\t\t// Create new scope with parameters bound to arguments\n\t\t\tconst newScope = {};\n\t\t\tconst paramCount = node.params.length;\n\t\t\tfor (let i = 0; i < paramCount; i++) {\n\t\t\t\tnewScope[node.params[i].name] = args[i];\n\t\t\t}\n\n\t\t\t// Push new scope, evaluate body, then pop scope. The scope must be\n\t\t\t// popped even when the body throws: a leaked scope would make the\n\t\t\t// parameter bindings visible to subsequent evaluations on the same\n\t\t\t// instance.\n\t\t\tthis.scopes.unshift(newScope);\n\t\t\ttry {\n\t\t\t\tconst result = this.visit(node.body);\n\t\t\t\tthis.consumeEvaluationValue(result);\n\t\t\t\treturn result;\n\t\t\t} finally {\n\t\t\t\tthis.scopes.shift();\n\t\t\t}\n\t\t};\n\t}\n\n\tconsumeEvaluationValue(value) {\n\t\tconst { dataSize, dataNodes } = assertBoundedData(value, \"Intermediate evaluation result\");\n\t\tthis.remainingDataSize -= dataSize;\n\t\tthis.remainingDataNodes -= dataNodes;\n\t\tif (this.remainingDataSize < 0 \|\| this.remainingDataNodes < 0) {\n\t\t\tthrow new RangeError(\"Evaluation allocation budget exceeded\");\n\t\t}\n\t}\n\n\t/\n\t Handles function call expressions, including optional chaining.\n\t * @private\n\t /\n\thandleCallExpression(node) {\n\t\tconst isOptional = node.optional \|\| (node.callee.type === \"MemberExpression\" && node.callee.optional);\n\t\tlet func;\n\t\tlet target = null;\n\n\t\tif (node.callee.type === \"MemberExpression\") {\n\t\t\t// Evaluate the object expression exactly once, then resolve the\n\t\t\t// property through handleMemberExpression so that all of its\n\t\t\t// guards (.stack access, prototype access, Function constructor)\n\t\t\t// still apply. Visiting the whole callee and then the object again\n\t\t\t// would double-evaluate side-effecting expressions such as\n\t\t\t// `new Date(1000).getTime()` or `f().g()`.\n\t\t\ttarget = this.visit(node.callee.object);\n\t\t\tfunc = this.handleMemberExpression(node.callee, target);\n\t\t} else {\n\t\t\tfunc = this.visit(node.callee);\n\t\t}\n\n\t\tif ((func === undefined \|\| func === null) && isOptional) {\n\t\t\treturn void 0;\n\t\t}\n\n\t\tif (func === Function) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function constructor\"]));\n\t\t}\n\t\t// Error.prepareStackTrace is a host-installed callback. It must be\n\t\t// checked dynamically: the blocked-methods map is built lazily on first\n\t\t// use, so a host that installs the callback after* that point would\n\t\t// otherwise evade the static blocklist.\n\t\tif (func === Error.prepareStackTrace) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Error.prepareStackTrace\"]));\n\t\t}\n\n\t\tif (getBlockedMethods().has(func)) {\n\t\t\tconst path = getBlockedMethods().get(func);\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [path]));\n\t\t}\n\t\t// Typed-array mutators live on `%TypedArray%.prototype`, which the\n\t\t// own-property walk in `getBlockedMethods` never reaches, so resolve\n\t\t// them against the real prototype functions here.\n\t\tif (TYPED_ARRAY_MUTATORS.has(func)) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [`TypedArray.prototype.${TYPED_ARRAY_MUTATORS.get(func)}`]));\n\t\t}\n\n\t\t// 仅在存在参数时构建数组\n\t\tconst args = (() => {\n\t\t\tif (node.arguments.length === 0) {\n\t\t\t\treturn [];\n\t\t\t}\n\n\t\t\tlet result = [];\n\n\t\t\tfor (let i = 0; i < node.arguments.length; i++) {\n\t\t\t\tconst element = node.arguments.at(i);\n\t\t\t\tconst value = this.visit(element);\n\n\t\t\t\tif (element.type === \"SpreadElement\") {\n\t\t\t\t\tthis.assertBoundedSpread(result.length, value);\n\t\t\t\t\tresult.push(...value);\n\t\t\t\t} else {\n\t\t\t\t\tresult.push(value);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn result;\n\t\t})();\n\n\t\t// Defense in depth: even if a `Function` reference were somehow\n\t\t// produced by an expression, it must not be passed as an argument.\n\t\t// Native methods (Promise.then, Array.prototype.map, ...) would\n\t\t// invoke it in the host runtime, outside this interpreter's checks.\n\t\tif (args.some((arg) => arg === Function)) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function constructor\"]));\n\t\t}\n\t\tif (typeof target === \"string\") {\n\t\t\tif (String.prototype.repeat && func === String.prototype.repeat && target.length * Number(args[0]) > MAX_STRING_LENGTH) {\n\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t}\n\t\t\tif ((String.prototype.padStart && func === String.prototype.padStart \|\| func === String.prototype.padEnd) && Number(args[0]) > MAX_STRING_LENGTH) {\n\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t}\n\t\t\tif (String.prototype.concat && func === String.prototype.concat) {\n\t\t\t\tconst resultLength = target.length + args.reduce((length, value) => length + String(value).length, 0);\n\t\t\t\tif (resultLength > MAX_STRING_LENGTH) {\n\t\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ((String.prototype.replace && func === String.prototype.replace) \|\| (String.prototype.replaceAll && func === String.prototype.replaceAll)) {\n\t\t\t\tif (typeof args[0] === \"string\") {\n\t\t\t\t\tif (typeof args[1] === \"function\" \|\| (typeof args[1] === \"string\" && /\\$(?:[$&'`])/u.test(args[1]))) {\n\t\t\t\t\t\tthrow new Error(\"Only literal string replacements are allowed\");\n\t\t\t\t\t}\n\t\t\t\t\tif (target.length * Math.max(1, args[0].length) > 10000000) {\n\t\t\t\t\t\tthrow new RangeError(\"String operation exceeds the maximum work limit\");\n\t\t\t\t\t}\n\t\t\t\t\tconst matchCount = countLiteralMatches(target, args[0], func === String.prototype.replaceAll);\n\t\t\t\t\tif (target.length + matchCount * String(args[1]).length > MAX_STRING_LENGTH) {\n\t\t\t\t\t\tthrow new RangeError(\"String result exceeds the maximum allowed length\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (func === String.prototype.split) {\n\t\t\t\tif (args[0] === \"\" && target.length > MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(\"Split result exceeds the maximum allowed length\");\n\t\t\t\t}\n\t\t\t\tif (typeof args[0] === \"string\" && args[0] !== \"\" && countLiteralMatches(target, args[0], true) >= MAX_ARRAY_LENGTH) {\n\t\t\t\t\tthrow new RangeError(\"Split result exceeds the maximum allowed length\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (func === RegExp) {\n\t\t\tthis.assertBoundedRegExp(args);\n\t\t}\n\t\tif ((target === Array \|\| isTypedArrayConstructor(target)) && func === target.from) {\n\t\t\tconst source = args[0];\n\t\t\tconst size = typeof source === \"string\" \|\| Array.isArray(source) ? source.length : source?.size ?? source?.length;\n\t\t\tif (typeof size === \"number\" && size > MAX_ARRAY_LENGTH) {\n\t\t\t\tthrow new RangeError(\"Array.from source exceeds the maximum allowed length\");\n\t\t\t}\n\t\t}\n\n\t\tif (typeof func !== \"function\") {\n\t\t\tconst calledString = getNodeString(node.callee);\n\t\t\tthrow new TypeError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_FUNCTION, [calledString]));\n\t\t}\n\n\t\tconst result = func.apply(target, args);\n\n\t\t// Defense in depth: never let a Promise escape as a call result. Its\n\t\t// settlement callbacks run in the host microtask queue, where errors\n\t\t// bypass the caller's synchronous try/catch entirely.\n\t\tif (result instanceof Promise) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Returning promises from expressions\"]));\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/*\n\t Handles template literal expressions.\n\t * More efficient implementation that interleaves quasis and expressions without sorting.\n\t * @private\n\t /\n\thandleTemplateLiteral(node) {\n\t\tlet result = \"\";\n\t\tconst expressionCount = node.expressions.length;\n\n\t\tfor (let i = 0; i < node.quasis.length; i++) {\n\t\t\tresult += node.quasis[i].value.raw;\n\t\t\tif (i < expressionCount) {\n\t\t\t\tresult += this.visit(node.expressions[i]);\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n}\n\n/\n \n * @param {import('acorn').Node} node\n * @returns\n /\nexport function getNodeString(node) {\n\tswitch (node.type) {\n\t\tcase \"Identifier\": {\n\t\t\treturn node.name;\n\t\t}\n\t\tcase \"Literal\": {\n\t\t\treturn node.raw;\n\t\t}\n\t\tcase \"ArrayExpression\": {\n\t\t\treturn `[${node.elements.map((child) => (child === null ? \"\" : getNodeString(child))).join(\",\")}]`;\n\t\t}\n\t\tcase \"ObjectExpression\": {\n\t\t\t// if keys is empty\n\t\t\tif (node.properties.length === 0) {\n\t\t\t\treturn \"{}\";\n\t\t\t}\n\n\t\t\treturn \"{(intermediate value)}\";\n\t\t}\n\t\tcase \"MemberExpression\": {\n\t\t\tconst objectStr = getNodeString(node.object);\n\t\t\tconst propertyStr = getNodeString(node.property);\n\n\t\t\tif (node.computed) {\n\t\t\t\treturn `${objectStr}[${propertyStr}]`;\n\t\t\t}\n\t\t\treturn `${objectStr}.${propertyStr}`;\n\t\t}\n\t\tdefault: {\n\t\t\treturn null;\n\t\t}\n\t}\n}\n","/\n 简单状态机模板解析器\n * 能够正确处理表达式中包含字符串、转义字符和结束标记的情况\n * @class SimpleStateTemplateParser\n /\nconst DEFAULT_MAX_TEMPLATE_LENGTH = 100000;\nconst MAX_CONFIGURABLE_TEMPLATE_LENGTH = 1000000;\nconst DEFAULT_MAX_TOKENS = 1000;\nconst MAX_CONFIGURABLE_TOKENS = 10000;\n\nfunction validateLimit(value, name, defaultValue, maximum) {\n\tif (value === undefined) {\n\t\treturn defaultValue;\n\t}\n\tif (!Number.isSafeInteger(value) \|\| value < 1 \|\| value > maximum) {\n\t\tthrow new RangeError(`${name} must be an integer between 1 and ${maximum}`);\n\t}\n\treturn value;\n}\n\nclass TemplateParser {\n\t/\n\t 创建解析器实例\n\t * @param {Object} [options] - 配置选项\n\t * @param {string} [options.expressionStart='{{'] - 表达式开始标记\n\t * @param {string} [options.expressionEnd='}}'] - 表达式结束标记\n\t * @param {boolean} [options.preserveWhitespace=true] - 是否保留表达式周围的空白字符\n\t /\n\tconstructor(options = {}) {\n\t\toptions ??= {};\n\t\tthis.maxTemplateLength = validateLimit(options.maxTemplateLength, \"maxTemplateLength\", DEFAULT_MAX_TEMPLATE_LENGTH, MAX_CONFIGURABLE_TEMPLATE_LENGTH);\n\t\tthis.maxTokens = validateLimit(options.maxTokens, \"maxTokens\", DEFAULT_MAX_TOKENS, MAX_CONFIGURABLE_TOKENS);\n\t\tif (options.expressionStart !== undefined && (typeof options.expressionStart !== \"string\" \|\| options.expressionStart.length === 0 \|\| options.expressionStart.length > 128)) {\n\t\t\tthrow new TypeError(\"expressionStart must be a non-empty string of at most 128 characters\");\n\t\t}\n\t\tif (options.expressionEnd !== undefined && (typeof options.expressionEnd !== \"string\" \|\| options.expressionEnd.length === 0 \|\| options.expressionEnd.length > 128)) {\n\t\t\tthrow new TypeError(\"expressionEnd must be a non-empty string of at most 128 characters\");\n\t\t}\n\t\t// 表达式标记配置\n\t\tthis.exprStart = options.expressionStart \|\| \"{{\";\n\t\tthis.exprEnd = options.expressionEnd \|\| \"}}\";\n\n\t\t// 标记长度缓存，避免重复计算\n\t\tthis.startLen = this.exprStart.length;\n\t\tthis.endLen = this.exprEnd.length;\n\n\t\t// 其他配置\n\t\tthis.preserveWhitespace = options.preserveWhitespace === true;\n\t}\n\n\t/\n\t 解析模板字符串，将其转换为 token 数组\n\t * @param {string} template - 要解析的模板字符串\n\t * @returns {Array<{type: string, value: string}>} token 数组\n\t /\n\tparse(template) {\n\t\t// 输入验证\n\t\tif (typeof template !== \"string\") {\n\t\t\tthrow new TypeError(\"模板必须是字符串\");\n\t\t}\n\t\tif (template.length > this.maxTemplateLength) {\n\t\t\tthrow new RangeError(`Template exceeds the maximum length of ${this.maxTemplateLength} characters`);\n\t\t}\n\n\t\tconst tokens = []; // 存储解析结果的 token 数组\n\t\tconst pushToken = (token) => {\n\t\t\tif (tokens.length >= this.maxTokens) {\n\t\t\t\tthrow new RangeError(`Template exceeds the maximum token count of ${this.maxTokens}`);\n\t\t\t}\n\t\t\ttokens.push(token);\n\t\t};\n\t\tconst length = template.length;\n\n\t\t// 状态机变量\n\t\tlet state = \"TEXT\"; // 当前状态：TEXT \| EXPR \| STRING_SQ \| STRING_DQ \| TEMPLATE \| REGEX \| REGEX_CLASS \| ESCAPE_\n\t\tlet buffer = \"\"; // 当前状态的字符缓冲区\n\t\tlet exprStartPos = 0; // 当前表达式的开始位置（用于错误恢复）\n\t\tlet pos = 0; // 当前扫描位置\n\t\t// 上一次有意义的表达式字符，用于区分正则字面量的 `/` 与除号 `/`\n\t\tlet prevExprChar = \"\";\n\n\t\t// 主解析循环：逐个字符扫描模板\n\t\twhile (pos < length) {\n\t\t\tconst char = template[pos];\n\t\t\tconst nextChar = template[pos + 1];\n\n\t\t\t// 状态机核心逻辑\n\t\t\tswitch (state) {\n\t\t\t\t// ==================== 文本状态 ====================\n\t\t\t\tcase \"TEXT\":\n\t\t\t\t\t// 检查是否遇到表达式开始标记\n\t\t\t\t\tif (this._isMatch(pos, template, this.exprStart)) {\n\t\t\t\t\t\t// 将缓冲区中的文本保存为 token\n\t\t\t\t\t\tif (buffer.length > 0) {\n\t\t\t\t\t\t\tpushToken({ type: \"text\", value: buffer, start: pos - buffer.length, end: pos });\n\t\t\t\t\t\t\tbuffer = \"\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// 切换到表达式状态\n\t\t\t\t\t\tstate = \"EXPR\";\n\t\t\t\t\t\texprStartPos = pos; // 记录表达式开始位置\n\t\t\t\t\t\tprevExprChar = \"\"; // 每个表达式独立判断正则/除号上下文\n\t\t\t\t\t\tpos += this.startLen; // 跳过开始标记\n\t\t\t\t\t\tcontinue; // 继续处理下一个字符（跳过本次循环的剩余部分）\n\t\t\t\t\t}\n\t\t\t\t\t// 普通文本字符，添加到缓冲区\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\t// ==================== 表达式状态 ====================\n\t\t\t\tcase \"EXPR\":\n\t\t\t\t\t// 在表达式中，需要处理各种字符串和转义字符\n\t\t\t\t\tif (char === \"'\") {\n\t\t\t\t\t\t// 进入单引号字符串状态\n\t\t\t\t\t\tstate = \"STRING_SQ\";\n\t\t\t\t\t} else if (char === '\"') {\n\t\t\t\t\t\t// 进入双引号字符串状态\n\t\t\t\t\t\tstate = \"STRING_DQ\";\n\t\t\t\t\t} else if (char === \"`\") {\n\t\t\t\t\t\t// 进入模板字符串状态\n\t\t\t\t\t\tstate = \"TEMPLATE\";\n\t\t\t\t\t} else if (char === \"/\" && this._isRegexPosition(prevExprChar)) {\n\t\t\t\t\t\t// A `/` in expression position starts a regex literal, which may\n\t\t\t\t\t\t// itself contain the closing delimiter (e.g. `/}}/`). Track it so\n\t\t\t\t\t\t// the delimiter inside the pattern is not mistaken for the end of\n\t\t\t\t\t\t// the expression.\n\t\t\t\t\t\tstate = \"REGEX\";\n\t\t\t\t\t} else if (char === \"\\\\\") {\n\t\t\t\t\t\t// 遇到转义字符，根据当前上下文进入相应的转义状态\n\t\t\t\t\t\tif (nextChar === \"'\") state = \"ESCAPE_SQ\";\n\t\t\t\t\t\telse if (nextChar === '\"') state = \"ESCAPE_DQ\";\n\t\t\t\t\t\telse if (nextChar === \"`\") state = \"ESCAPE_TEMPLATE\";\n\t\t\t\t\t\telse state = \"ESCAPE_EXPR\";\n\t\t\t\t\t} else if (this._isMatch(pos, template, this.exprEnd)) {\n\t\t\t\t\t\t// 找到表达式结束标记，且不在字符串中\n\t\t\t\t\t\tconst exprValue = this.preserveWhitespace ? buffer : buffer.trim();\n\t\t\t\t\t\tif (exprValue.length > 0) {\n\t\t\t\t\t\t\tpushToken({\n\t\t\t\t\t\t\t\ttype: \"expression\",\n\t\t\t\t\t\t\t\tvalue: exprValue,\n\t\t\t\t\t\t\t\tstart: exprStartPos,\n\t\t\t\t\t\t\t\tend: pos + this.endLen,\n\t\t\t\t\t\t\t\tcontentStart: exprStartPos + this.startLen,\n\t\t\t\t\t\t\t\tcontentEnd: pos,\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// 重置状态，准备处理后续文本\n\t\t\t\t\t\tbuffer = \"\";\n\t\t\t\t\t\tstate = \"TEXT\";\n\t\t\t\t\t\tpos += this.endLen; // 跳过结束标记\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\t// 将当前字符添加到表达式缓冲区。空白字符不更新 prevExprChar，\n\t\t\t\t\t// 这样 `{{ /re/ }}` 中前导空格不会让 `/` 被误判为除号。\n\t\t\t\t\tif (!/\\s/u.test(char)) {\n\t\t\t\t\t\tprevExprChar = char;\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\t// ==================== 字符串状态 ====================\n\t\t\t\tcase \"STRING_SQ\": // 单引号字符串\n\t\t\t\t\tif (char === \"\\\\\") {\n\t\t\t\t\t\tstate = \"ESCAPE_SQ\"; // 遇到转义字符\n\t\t\t\t\t} else if (char === \"'\") {\n\t\t\t\t\t\tstate = \"EXPR\"; // 字符串结束，回到表达式状态\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"STRING_DQ\": // 双引号字符串\n\t\t\t\t\tif (char === \"\\\\\") {\n\t\t\t\t\t\tstate = \"ESCAPE_DQ\";\n\t\t\t\t\t} else if (char === '\"') {\n\t\t\t\t\t\tstate = \"EXPR\";\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"TEMPLATE\": // 模板字符串\n\t\t\t\t\tif (char === \"\\\\\") {\n\t\t\t\t\t\tstate = \"ESCAPE_TEMPLATE\";\n\t\t\t\t\t} else if (char === \"`\") {\n\t\t\t\t\t\tstate = \"EXPR\";\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"REGEX\": // 正则字面量\n\t\t\t\t\tif (char === \"\\\\\") {\n\t\t\t\t\t\tstate = \"ESCAPE_REGEX\";\n\t\t\t\t\t} else if (char === \"[\") {\n\t\t\t\t\t\t// A character class may contain an unescaped `/`.\n\t\t\t\t\t\tstate = \"REGEX_CLASS\";\n\t\t\t\t\t} else if (char === \"/\") {\n\t\t\t\t\t\tstate = \"EXPR\"; // 正则结束（flags 之后回到表达式状态）\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"REGEX_CLASS\": // 正则字符类 [...]\n\t\t\t\t\tif (char === \"\\\\\") {\n\t\t\t\t\t\tstate = \"ESCAPE_REGEX\";\n\t\t\t\t\t} else if (char === \"]\") {\n\t\t\t\t\t\tstate = \"REGEX\";\n\t\t\t\t\t}\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tbreak;\n\n\t\t\t\t// ==================== 转义状态 ====================\n\t\t\t\t// 转义状态：处理转义字符，然后返回到之前的状态\n\t\t\t\tcase \"ESCAPE_SQ\":\n\t\t\t\t\tbuffer += char; // 添加转义后的字符\n\t\t\t\t\tstate = \"STRING_SQ\"; // 回到单引号字符串状态\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"ESCAPE_DQ\":\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tstate = \"STRING_DQ\";\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"ESCAPE_TEMPLATE\":\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tstate = \"TEMPLATE\";\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"ESCAPE_REGEX\":\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tstate = \"REGEX\";\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"ESCAPE_EXPR\":\n\t\t\t\t\tbuffer += char;\n\t\t\t\t\tstate = \"EXPR\";\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// 移动到下一个字符\n\t\t\tpos++;\n\t\t}\n\n\t\t// ==================== 后处理 ====================\n\t\t// 处理扫描结束后缓冲区中剩余的内容\n\t\tif (buffer.length > 0) {\n\t\t\tif (state === \"TEXT\") {\n\t\t\t\t// 剩余的文本内容\n\t\t\t\tpushToken({ type: \"text\", value: buffer, start: pos - buffer.length, end: pos });\n\t\t\t} else {\n\t\t\t\t// 未完成的表达式，将其作为普通文本处理\n\t\t\t\tconst incompleteExpr = this.exprStart + buffer;\n\t\t\t\tpushToken({ type: \"text\", value: incompleteExpr, start: exprStartPos, end: pos });\n\t\t\t}\n\t\t}\n\n\t\treturn tokens;\n\t}\n\n\t/*\n\t 判断 `/` 是否处于正则字面量的起始位置。当上一个有意义的字符是\n\t * 开头、运算符或左括号时，`/` 开始一个正则；否则它是除号。\n\t * @param {string} prev - 上一个有意义的表达式字符（可能为空）\n\t * @returns {boolean}\n\t * @private\n\t /\n\t_isRegexPosition(prev) {\n\t\treturn prev === \"\" \|\| \"(,=:[!&\|?{};+-%^~<>\".includes(prev);\n\t}\n\n\t/*\n\t 检查指定位置是否匹配给定的字符序列\n\t * @param {number} pos - 开始检查的位置\n\t * @param {string} template - 模板字符串\n\t * @param {string} sequence - 要匹配的字符序列\n\t * @returns {boolean} 是否匹配\n\t * @private\n\t /\n\t_isMatch(pos, template, sequence) {\n\t\t// 检查剩余长度是否足够\n\t\tif (pos + sequence.length > template.length) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// 逐个字符比较\n\t\tfor (let i = 0; i < sequence.length; i++) {\n\t\t\tif (template[pos + i] !== sequence[i]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t 静态方法：快速解析模板\n\t * @param {string} template - 模板字符串\n\t * @param {Object} [options] - 配置选项\n\t * @returns {Array} token 数组\n\t /\n\tstatic parse(template, options) {\n\t\tconst parser = new TemplateParser(options);\n\t\treturn parser.parse(template);\n\t}\n}\n\nexport { TemplateParser };\n","import { Evaluator } from \"./Evaluator.js\";\nimport { TemplateParser } from \"./TemplateParser.js\";\n\nexport { Evaluator, TemplateParser };\n\nconst DEFAULT_MAX_TEMPLATE_EXPRESSIONS = 100;\nconst MAX_TEMPLATE_EXPRESSIONS = 1000;\nconst DEFAULT_MAX_TEMPLATE_OUTPUT_LENGTH = 100000;\nconst MAX_TEMPLATE_OUTPUT_LENGTH = 1000000;\n\nfunction validateLimit(value, name, defaultValue, maximum) {\n\tif (value === undefined) {\n\t\treturn defaultValue;\n\t}\n\tif (!Number.isSafeInteger(value) \|\| value < 1 \|\| value > maximum) {\n\t\tthrow new RangeError(`${name} must be an integer between 1 and ${maximum}`);\n\t}\n\treturn value;\n}\n\n/\n Evaluates a JavaScript expression with an optional context.\n * @param {string} expression - The JavaScript expression to evaluate\n * @param {unknown} [context] - Optional context object with variables to use in the expression\n * @returns {} The result of evaluating the expression\n @example\n * evalExpression('a + b', { a: 1, b: 2 }) // returns 3\n /\nexport function evalExpression(expression, context) {\n\treturn Evaluator.evaluate(expression, context);\n}\n\n/\n Evaluates a template string by replacing {{ expression }} patterns with their evaluated values.\n * An expression that references an undefined variable resolves to the string\n * `\"undefined\"` instead of throwing, so a missing variable degrades gracefully.\n * @param {string} template - The template string containing {{ expression }} patterns\n * @param {Object} [context] - Optional context object with variables to use in expressions\n * @param {Object} [templateParserOptions] - Optional options for the template parser\n * @returns {string} The template with all expressions evaluated and replaced\n * @example\n * evalTemplate('Hello {{ name }}!', { name: 'World' }) // returns 'Hello World!'\n */\nexport function evalTemplate(template, context, templateParserOptions) {\n\tconst options = templateParserOptions ?? {};\n\tconst maxExpressions = validateLimit(options.maxExpressions, \"maxExpressions\", DEFAULT_MAX_TEMPLATE_EXPRESSIONS, MAX_TEMPLATE_EXPRESSIONS);\n\tconst maxOutputLength = validateLimit(options.maxOutputLength, \"maxOutputLength\", DEFAULT_MAX_TEMPLATE_OUTPUT_LENGTH, MAX_TEMPLATE_OUTPUT_LENGTH);\n\tconst tokens = TemplateParser.parse(template, options);\n\tlet result = \"\";\n\tlet expressionCount = 0;\n\n\t// Reuse a single Evaluator instance for every expression in the template.\n\t// `Evaluator.evaluate` builds a new instance per call, cloning the whole\n\t// context via structuredClone for each expression - wasteful when a\n\t// template contains many expressions. Reusing one instance is safe here:\n\t// evaluate() never mutates the scope chain outside its own call (arrow\n\t// function scopes are pushed and popped in a finally block), and closures\n\t// cannot escape because the cloneable-return gate rejects them.\n\tconst evaluator = new Evaluator(context, {\n\t\tmaxInputLength: options.maxExpressionLength,\n\t\tmaxEvaluationSteps: options.maxEvaluationSteps,\n\t});\n\n\tconst typeHandler = {\n\t\ttext: (token) => token.value,\n\t\texpression: (token) => {\n\t\t\ttry {\n\t\t\t\treturn evaluator.evaluate(token.value);\n\t\t\t} catch (error) {\n\t\t\t\t// Replace undefined variables with empty string for graceful degradation\n\t\t\t\tif (error instanceof ReferenceError && error.message.endsWith(\"is not defined\")) {\n\t\t\t\t\treturn \"undefined\";\n\t\t\t\t} else {\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n\n\tfor (const token of tokens) {\n\t\t// Unknown token type, treat as text\n\t\tconst handler = typeHandler[token.type] ?? typeHandler[\"text\"];\n\t\tif (token.type === \"expression\") {\n\t\t\texpressionCount++;\n\t\t\tif (expressionCount > maxExpressions) {\n\t\t\t\tthrow new RangeError(`Template exceeds the maximum expression count of ${maxExpressions}`);\n\t\t\t}\n\t\t}\n\n\t\tconst chunk = String(handler(token));\n\t\tif (result.length + chunk.length > maxOutputLength) {\n\t\t\tthrow new RangeError(`Template output exceeds the maximum length of ${maxOutputLength} characters`);\n\t\t}\n\t\tresult += chunk;\n\t}\n\n\treturn result;\n}\n"],"names":["__webpack_require__","definition","key","Object","obj","prop","Symbol","mutableMethods","dangerousMethods","blockedMethods","blockedGlobalBuiltIns","ERROR_MESSAGES","DEFAULT_MAX_INPUT_LENGTH","MAX_CONFIGURABLE_INPUT_LENGTH","DEFAULT_MAX_EVALUATION_STEPS","MAX_CONFIGURABLE_EVALUATION_STEPS","MAX_ARRAY_LENGTH","MAX_BUFFER_BYTES","MAX_STRING_LENGTH","MAX_DATA_NODES","MAX_BIGINT_EXPONENT","MAX_BIGINT_BITS","DEFAULT_MAX_DEPTH","MAX_CONFIGURABLE_DEPTH","MAX_REGEXP_SOURCE_LENGTH","MAX_REGEXP_FLAGS_LENGTH","NON_SANDBOX_GLOBALS","Set","TYPED_ARRAY_CONSTRUCTORS","Int8Array","Uint8Array","Uint8ClampedArray","Int16Array","Uint16Array","Int32Array","Uint32Array","Float16Array","Float32Array","Float64Array","BigInt64Array","BigUint64Array","constructor","isTypedArrayConstructor","value","TYPED_ARRAY_MUTATORS","map","Map","_iteratorError","_iter","name","method","NO_OBJECT","renderErrorMessage","template","context","_","String","validateLimit","defaultValue","maximum","undefined","Number","RangeError","countLiteralMatches","search","all","count","position","assertBoundedData","label","pending","seen","WeakSet","dataSize","dataNodes","enqueueProperties","object","keys","descriptor","TypeError","current","_type_of","_instanceof","ArrayBuffer","Array","item","BINARY_OPERATION_MAP","a","b","createGlobalScope","scope","builtin","globals","globalThis","isWritable","GLOBAL_SCOPE","getBlockedMethods","BLOCKED_METHODS","path","_path_split","properties","_iteratorError1","Evaluator","variables","options","clonedVariables","structuredClone","evaluate","expression","SyntaxError","ast","acorn","error","execute","body","result","node","Error","Promise","visit","visitNode","Constructor","args","arg","content","handleBinaryExpression","op","left","right","leftBits","rightBits","BigInt","Math","assertBoundedRegExp","assertBoundedConstruction","_args_","RegExp","size","DataView","_size_size","collectionSize","byteLength","_args_1","offset","_args_2","elementCount","_size_length","elementCount1","handleLogicalExpression","left1","left2","handleUnaryExpression","handleIdentifier","ReferenceError","handleMemberExpression","objectValue","isStaticProperty","property","Function","handleArrayExpression","i","element","_result","assertBoundedSpread","currentLength","handleObjectExpression","spreadPropertyCount","spreadValue","handleSpreadElement","handleArrowFunctionExpression","newScope","paramCount","consumeEvaluationValue","_assertBoundedData","handleCallExpression","isOptional","func","target","resultLength","length","matchCount","source","_source_size","calledString","getNodeString","handleTemplateLiteral","expressionCount","evaluator","child","objectStr","propertyStr","DEFAULT_MAX_TEMPLATE_LENGTH","MAX_CONFIGURABLE_TEMPLATE_LENGTH","DEFAULT_MAX_TOKENS","MAX_CONFIGURABLE_TOKENS","TemplateParser","parse","tokens","pushToken","token","state","buffer","exprStartPos","pos","prevExprChar","char","nextChar","exprValue","incompleteExpr","_isRegexPosition","prev","_isMatch","sequence","parser","DEFAULT_MAX_TEMPLATE_EXPRESSIONS","MAX_TEMPLATE_EXPRESSIONS","DEFAULT_MAX_TEMPLATE_OUTPUT_LENGTH","MAX_TEMPLATE_OUTPUT_LENGTH","evalExpression","evalTemplate","templateParserOptions","maxExpressions","maxOutputLength","typeHandler","_typeHandler_token_type","handler","chunk"],"mappings":";;;IAAAA,oBAAoB,CAAC,GAAG,SAAS,QAAO,EAAEC,UAAU;QACnD,IAAI,IAAIC,OAAOD,WACR,IAAGD,oBAAoB,CAAC,CAACC,YAAYC,QAAQ,CAACF,oBAAoB,CAAC,CAAC,UAASE,MACzEC,OAAO,cAAc,CAAC,UAASD,KAAK;YAAE,YAAY;YAAM,KAAKD,UAAU,CAACC,IAAI;QAAC;IAGzF;;;ICNAF,oBAAoB,CAAC,GAAG,SAASI,GAAG,EAAEC,IAAI;QAAI,OAAOF,OAAO,SAAS,CAAC,cAAc,CAAC,IAAI,CAACC,KAAKC;IAAO;;;ICCtGL,oBAAoB,CAAC,GAAG,SAAS,QAAO;QACvC,IAAG,AAAkB,eAAlB,OAAOM,UAA0BA,OAAO,WAAW,EACrDH,OAAO,cAAc,CAAC,UAASG,OAAO,WAAW,EAAE;YAAE,OAAO;QAAS;QAEtEH,OAAO,cAAc,CAAC,UAAS,cAAc;YAAE,OAAO;QAAK;IAC5D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACNA,IAAMI,iBAAiB;IACtB;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IAEA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IACA;IACA;IAEA;IACA;IACA;IAEA;IAEA;IAEA;IACA;IAEA;IACA;IACA;IACA;IAEA;IACA;IACA;IAEA;IACA;IACA;IAGA;IACA;IACA;IACA;IAGA;IACA;IAGA;CACA;AAED,IAAMC,mBAAmB;IACxB;IAEA;IACA;IACA;IACA;IAMA;IACA;CACA;AAGDD,eAAe,IAAI,CAAC;AAKb,IAAME,iBAAkB,qBAAGF,gBAAAA,MAAAA,CAAgB,qBAAGC;AAK9C,IAAME,wBAAwB;IACpC;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAGA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAGA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAGA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAGA;IACA;IACA;IACA;IAIA;IAIA;IAGA;IAOA;IAGA;IACA;IAGA;CACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnRD,IAAMC,iBAAiB;IACtB,uBAAuB;IACvB,mBAAmB;IACnB,iBAAiB;IACjB,gBAAgB;IAChB,gBAAgB;IAChB,qBAAqB;AACtB;AAOA,IAAMC,2BAA2B;AACjC,IAAMC,gCAAgC;AACtC,IAAMC,+BAA+B;AACrC,IAAMC,oCAAoC;AAC1C,IAAMC,mBAAmB;AACzB,IAAMC,mBAAmB;AACzB,IAAMC,oBAAoB;AAC1B,IAAMC,iBAAiB;AACvB,IAAMC,sBAAsB,IAAI;AAChC,IAAMC,kBAAkB;AACxB,IAAMC,oBAAoB;AAC1B,IAAMC,yBAAyB;AAC/B,IAAMC,2BAA2B;AACjC,IAAMC,0BAA0B;AAQhC,IAAMC,sBAAsB,IAAIC,IAAI;IAAC;IAAW;IAAwB;IAAY;IAAqB;IAAU;CAAW;AAC9H,IAAMC,2BAA2B,IAAID,IACpC;IACCE;IACAC;IACAC;IACAC;IACAC;IACAC;IACAC;IACwB,cAAxB,OAAOC,eAA8BA,eAAe;IACpDC;IACAC;IACyB,cAAzB,OAAOC,gBAA+BA,gBAAgB;IAC5B,cAA1B,OAAOC,iBAAgCA,iBAAiB;CACxD,CAAC,MAAM,CAAC,SAACC,WAAW;WAAK,AAAuB,cAAvB,OAAOA;;AAUlC,SAASC,wBAAwBC,KAAK;IACrC,OAAOf,yBAAyB,GAAG,CAACe,UAAW,AAAiB,cAAjB,OAAOA,SAAwB,AAAmC,YAAnC,OAAOA,MAAM,iBAAiB;AAC7G;AAQA,IAAMC,uBAAwB;IAC7B,IAAMC,MAAM,IAAIC;QACXC,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;QAAL,QAAKA,YAAqBnB,wBAAwB,CAAxBA,OAAAA,QAAAA,CAAAA,IAArBmB,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA+C;YAA/CA,IAAMN,cAANM,MAAAA,KAAAA;YACJ,gBAAmBC,QAAAA;gBAAC;gBAAO;gBAAQ;gBAAW;gBAAQ;aAAa,OAAhDA,MAAAA,MAAAA,EAAAA,KAAkD;oBAA1DC,OAAQD,KAAAA,CAAAA,GAAAA;gBAClB,IAAME,SAAST,YAAY,SAAS,CAACQ,KAAK;gBAC1C,IAAI,AAAkB,cAAlB,OAAOC,UAAyB,CAACL,IAAI,GAAG,CAACK,SAC5CL,IAAI,GAAG,CAACK,QAAQD;YAElB;QACD;;QAPKF,oBAAAA;QAAAA,iBAAAA;;;iBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;gBAAAA,mB,MAAAA;;;IAQL,OAAOF;AACR;AAMA,IAAMM,YAAY7C,OAAO;AAWzB,IAAM8C,qBAAqB,SAACC,QAAQ;QAAEC,UAAU,UAAVA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAU,CAAC;WAAMD,SAAS,OAAO,CAAC,YAAY,SAACE,CAAC,EAAErD,GAAG;eAAKsD,OAAOF,OAAO,CAACpD,IAAI;;;AAEnH,SAASuD,cAAcd,KAAK,EAAEM,IAAI,EAAES,YAAY,EAAEC,OAAO;IACxD,IAAIhB,AAAUiB,WAAVjB,OACH,OAAOe;IAER,IAAI,CAACG,OAAO,aAAa,CAAClB,UAAUA,QAAQ,KAAKA,QAAQgB,SACxD,MAAM,IAAIG,WAAY,GAA2CH,MAAAA,CAAzCV,MAAK,sCAA4C,OAARU;IAElE,OAAOhB;AACR;AAEA,SAASoB,oBAAoBpB,KAAK,EAAEqB,MAAM,EAAEC,GAAG;IAC9C,IAAID,AAAW,OAAXA,QACH,OAAOC,MAAMtB,MAAM,MAAM,GAAG,IAAI;IAEjC,IAAIuB,QAAQ;IACZ,IAAIC,WAAW;IACf,MAAQA,AAAgD,OAAhDA,CAAAA,WAAWxB,MAAM,OAAO,CAACqB,QAAQG,SAAQ,EAAW;QAC3DD;QACA,IAAI,CAACD,KACJ;QAEDE,YAAYH,OAAO,MAAM;IAC1B;IACA,OAAOE;AACR;AAEA,SAASE,kBAAkBzB,KAAK,EAAE0B,KAAK;IACtC,IAAMC,UAAU;QAAC3B;KAAM;IACvB,IAAM4B,OAAO,IAAIC;IACjB,IAAIC,WAAW;IACf,IAAIC,YAAY;IAChB,IAAMC,oBAAoB,SAACC,MAAM;QAChC,IAAMC,OAAO1E,OAAO,IAAI,CAACyE;QACzB,IAAIN,QAAQ,MAAM,GAAGO,KAAK,MAAM,GAAG1D,gBAClC,MAAM,IAAI2C,WAAY,GAAQ,OAANO,OAAM;YAE1BtB,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;YAAL,QAAKA,YAAa8B,IAAI,CAAJA,OAAAA,QAAAA,CAAAA,IAAb9B,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAmB;gBAAnBA,IAAM7C,MAAN6C,MAAAA,KAAAA;gBACJ0B,YAAYvE,IAAI,MAAM;gBACtB,IAAM4E,aAAa3E,OAAO,wBAAwB,CAACyE,QAAQ1E;gBAC3D,IAAI,CAAC4E,cAAc,CAAC3E,OAAO,MAAM,CAAC2E,YAAY,UAC7C,MAAM,IAAIC,UAAW,GAAQ,OAANV,OAAM;gBAE9BC,QAAQ,IAAI,CAACQ,WAAW,KAAK;YAC9B;;YAPK/B,oBAAAA;YAAAA,iBAAAA;;;qBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;oBAAAA,mB,MAAAA;;;IAQN;IAEA,MAAOuB,QAAQ,MAAM,GAAG,EAAG;QAC1B,IAAMU,UAAUV,QAAQ,GAAG;QAC3BI;QACA,IAAIA,YAAYvD,gBACf,MAAM,IAAI2C,WAAY,GAAQ,OAANO,OAAM;QAG/B,IAAI,AAAmB,YAAnB,OAAOW,SAAsB;YAChC,IAAIA,QAAQ,MAAM,GAAG9D,mBACpB,MAAM,IAAI4C,WAAY,GAAQ,OAANO,OAAM;YAE/BI,YAAYO,QAAQ,MAAM,GAAG;QAC9B,OAAO,IAAIA,AAAY,SAAZA,WAAqBC,AAAAA,CAAOD,WAAAA,UAAAA,cAAPC,SAAOD,QAAO,MAAK,YAAY,AAAmB,cAAnB,OAAOA,SAAyB;YAC9FP,YAAY;YACZ;QACD,OAEO;YAFA,IAAI,AAAmB,cAAnB,OAAOO,WAA0BT,KAAK,GAAG,CAACS,UACpD;YAEAT,KAAK,GAAG,CAACS;YACTP,YAAY;YACZ,IAAWS,YAAPF,SAAmBG,gBAAeA,YAAY,MAAM,CAACH,UACxDP,YAAYO,QAAQ,UAAU;iBACxB,IAAII,MAAM,OAAO,CAACJ,UAAU;gBAClC,IAAIA,QAAQ,MAAM,GAAGhE,kBACpB,MAAM,IAAI8C,WAAY,GAAQ,OAANO,OAAM;gBAE/BI,YAAYO,AAAiB,IAAjBA,QAAQ,MAAM;gBAC1BL,kBAAkBK;YACnB,OAAO,IAAWE,YAAPF,SAAmBlC,MAAK;gBAClC,IAAIkC,QAAQ,IAAI,GAAGhE,kBAClB,MAAM,IAAI8C,WAAY,GAAQ,OAANO,OAAM;gBAE/BI,YAAYO,AAAe,KAAfA,QAAQ,IAAI;gBACxBlC,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAACkC,SAAS,SAACK,IAAI,EAAEnF,GAAG;2BAAKoE,QAAQ,IAAI,CAACpE,KAAKmF;;YACtE,OAAO,IAAWH,YAAPF,SAAmBrD,MAAK;gBAClC,IAAIqD,QAAQ,IAAI,GAAGhE,kBAClB,MAAM,IAAI8C,WAAY,GAAQ,OAANO,OAAM;gBAE/BI,YAAYO,AAAe,IAAfA,QAAQ,IAAI;gBACxBrD,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAACqD,SAAS,SAACK,IAAI;2BAAKf,QAAQ,IAAI,CAACe;;YAC5D,OACCV,kBAAkBK;QAEpB;QAEA,IAAIP,WAAWxD,kBACd,MAAM,IAAI6C,WAAY,GAAQ,OAANO,OAAM;IAEhC;IACA,OAAO;QAAEI,UAAAA;QAAUC,WAAAA;IAAU;AAC9B;AAEA,IAAMY,uBAAuB;IAC5B,KAAK,SAACC,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAAA,GAAAA,CAAAA,GAAKC;;IACrB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,OAAO,SAACD,CAAC,EAAEC,CAAC;eAAKD,MAAMC;;IACvB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,OAAO,SAACD,CAAC,EAAEC,CAAC;eAAKD,MAAMC;;IACvB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,KAAK,SAACD,CAAC,EAAEC,CAAC;eAAKD,IAAIC;;IACnB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,MAAM,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACrB,OAAO,SAACD,CAAC,EAAEC,CAAC;eAAKD,MAAMC;;IACvB,IAAI,SAACD,CAAC,EAAEC,CAAC;eAAKD,KAAKC;;IACnB,YAAY,SAACD,CAAC,EAAEC,CAAC;eAAMN,YAADK,GAAaC;;AACpC;AAEA,SAASC;IACR,IAAMC,QAAQvF,OAAO,MAAM,CAAC;IAC5B,IAAQwF,UAAYC,iCAAAA,OAALD;IAOf,IAAK,IAAMzF,OAAOyF,QAAS;QAC1B,KAAIjF,sBAAsB,QAAQ,CAACR,MAGnC;YAAA,KAAIwB,oBAAoB,GAAG,CAACxB,MAG5B;gBAAA,IAAKC,OAAO,MAAM,CAAC0F,YAAY3F;oBAK/B,IAAM4F,aAAaH,OAAO,CAACzF,IAAI;oBAE/BC,OAAO,cAAc,CAACuF,OAAOxF,KAAK;wBACjC,OAAO2F,UAAU,CAAC3F,IAAI;wBACtB,UAAU4F;wBACV,YAAY;wBACZ,cAAc;oBACf;;YAVA;QAHA;IAcD;IAEA3F,OAAO,cAAc,CAACuF,OAAO,cAAc;QAC1C,OAAOA;QACP,UAAU;QACV,YAAY;QACZ,cAAc;IACf;IAEA,OAAOA;AACR;AAKA,IAAMK,eAAeN;AAErB,IAAMO,oBAAqB;IAI1B,IAAIC,kBAAkB;IAEtB,OAAO;QACN,IAAIA,iBAAiB,OAAOA;QAE5B,IAAMpD,MAAM,IAAIC;YACXC,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;YAAL,QAAKA,YAActC,cAAcA,CAAAA,OAAAA,QAAAA,CAAAA,IAA5BsC,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA8B;gBAA9BA,IAAMmD,OAANnD,MAAAA,KAAAA;gBACJ,IAAgCoD,cAAAA,UAAAA,KAAK,KAAK,CAAC,OAApCvB,SAAyBuB,WAAAA,CAAAA,EAAAA,EAAdC,aAAcD,YAAAA,KAAAA,CAAjB;gBACf,IAAInB,UAAUa,UAAU,CAACjB,OAAO;oBAC3ByB,6BAAAA,MAAAA,qBAAAA,OAAAA,kBAAAA;;oBAAL,QAAKA,aAAcD,UAAU,CAAVA,OAAAA,QAAAA,CAAAA,IAAdC,QAAAA,CAAAA,CAAAA,6BAAAA,AAAAA,CAAAA,SAAAA,WAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,6BAAAA,KAA0B;wBAA1BA,IAAMhG,OAANgG,OAAAA,KAAAA;wBACJ,IAAIrB,WAAW7E,OAAO,MAAM,CAAC6E,SAAS3E,OACrC2E,UAAUA,OAAO,CAAC3E,KAAK;6BACjB;4BACN2E,UAAU;4BACV;wBACD;oBACD;;oBAPKqB,qBAAAA;oBAAAA,kBAAAA;;;6BAAAA,8BAAAA,AAAAA,QAAAA,WAAAA,MAAAA,EAAAA,WAAAA,MAAAA;;4BAAAA,oB,MAAAA;;;gBAQL,IAAI,AAAmB,cAAnB,OAAOrB,SAAwBnC,IAAI,GAAG,CAACmC,SAASkB;YACrD;;YAZKnD,oBAAAA;YAAAA,iBAAAA;;;qBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;oBAAAA,mB,MAAAA;;;QAaLkD,kBAAkBpD;QAElB,OAAOoD;IACR;AACD;AAeO,IAAMK,sBAASA,WAAAA,GAAf;;aAAMA;YASAC,YAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAYpG,OAAO,MAAM,CAAC,OAAOqG,UAAAA,UAAAA,MAAAA,GAAAA,IAAAA,SAAAA,CAAAA,EAAAA,GAAAA,KAAAA;gCATjCF;QAUX,IAAI,CAAC,cAAc,GAAG7C,cAAc+C,QAAAA,UAAAA,KAAAA,IAAAA,QAAS,cAAc,EAAE,kBAAkB5F,0BAA0BC;QACzG,IAAI,CAAC,kBAAkB,GAAG4C,cAAc+C,QAAAA,UAAAA,KAAAA,IAAAA,QAAS,kBAAkB,EAAE,sBAAsB1F,8BAA8BC;QACzH,IAAI,CAAC,QAAQ,GAAG0C,cAAc+C,QAAAA,UAAAA,KAAAA,IAAAA,QAAS,QAAQ,EAAE,YAAYlF,mBAAmBC;QAChF6C,kBAAkBmC,WAAW;QAC7B,IAAME,kBAAkBC,gBAAgBH;QACxC,IAAI,CAAC,MAAM,GAAG;YAACE;YAAiBV;SAAa,CAAC,MAAM,CAAC,SAACL,KAAK;mBAAKA,QAAAA;;QAChE,IAAI,CAAC,MAAM,GAAG9B;QACd,IAAI,CAAC,wBAAwB,GAAG;QAChC,IAAI,CAAC,iBAAiB,GAAG3C;QACzB,IAAI,CAAC,kBAAkB,GAAGE;QAC1B,IAAI,CAAC,eAAe,GAAG;;kBApBZmF,WAAAA;;YA0CZK,KAAAA;mBAAAA,SAASC,UAAU;gBAClB,IAAI,AAAsB,YAAtB,OAAOA,YACV,MAAM,IAAI7B,UAAU;gBAGrB,IAAI6B,WAAW,MAAM,GAAG,IAAI,CAAC,cAAc,EAC1C,MAAM,IAAIC,YAAYzD,mBAAmBzC,eAAe,mBAAmB,EAAE;oBAAC,IAAI,CAAC,cAAc;iBAAC;gBAGnG,IAAI,CAAC,MAAM,GAAGiG;gBACd,IAAI,CAAC,wBAAwB,GAAG,IAAI,CAAC,kBAAkB;gBACvD,IAAI,CAAC,iBAAiB,GAAG3F;gBACzB,IAAI,CAAC,kBAAkB,GAAGE;gBAC1B,IAAI,CAAC,eAAe,GAAG;gBAEvB,IAAI2F;gBACJ,IAAI;oBACHA,MAAMC,+BAAAA,KAAW,CAACH,YAAY;wBAAE,aAAa;oBAAS;gBACvD,EAAE,OAAOI,OAAO;oBAIf,IAAS9B,YAAL8B,OAAiBlD,eAAc,cAAc,IAAI,CAACkD,MAAM,OAAO,GAClE,MAAM,IAAIH,YAAY;oBAEvB,MAAMG;gBACP;gBAGA,IAAI;oBACH,OAAO,IAAI,CAAC,OAAO,CAACF,IAAI,IAAI;gBAC7B,SAAU;oBACT,IAAI,CAAC,MAAM,GAAGlD;gBACf;YACD;;;YAQAqD,KAAAA;mBAAAA,SAAQC,IAAI;gBACX,IAAI,AAAkC,MAAlC,IAAI,CAAC,wBAAwB,EAAQ;oBACxC,IAAI,CAAC,wBAAwB,GAAG,IAAI,CAAC,kBAAkB;oBACvD,IAAI,CAAC,iBAAiB,GAAGjG;oBACzB,IAAI,CAAC,kBAAkB,GAAGE;gBAC3B;gBACA,IAAIgG;oBAECpE,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAcmE,IAAI,CAAJA,OAAAA,QAAAA,CAAAA,IAAdnE,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAoB;wBAApBA,IAAMqE,OAANrE,MAAAA,KAAAA;wBACJoE,SAAS,IAAI,CAAC,KAAK,CAACC;oBACrB;;oBAFKrE,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAIL,IAAI,AAAkB,cAAlB,OAAOoE,QACV,MAAM,IAAIE,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAAuC;gBAG3GyD,kBAAkB+C,QAAQ;gBAK1B,IAAUjC,YAANiC,QAAkBG,UACrB,MAAM,IAAID,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAAsC;gBAY1G,IAAI;oBACH,OAAO+F,gBAAgBS;gBACxB,EAAE,OAAOH,OAAO;oBACf,IAAIA,SAASA,AAAe,qBAAfA,MAAM,IAAI,EACtB,MAAM,IAAIK,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;wBAAC;qBAAkD;oBAEtH,MAAMqG;gBACP;YACD;;;YAQAO,KAAAA;mBAAAA,SAAMH,IAAI;gBACT,IAAI,CAAC,wBAAwB;gBAC7B,IAAI,IAAI,CAAC,wBAAwB,GAAG,GACnC,MAAM,IAAItD,WAAW;gBAOtB,IAAI,CAAC,eAAe;gBACpB,IAAI,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,QAAQ,EAAE;oBACzC,IAAI,CAAC,eAAe;oBACpB,MAAM,IAAIA,WAAW;gBACtB;gBACA,IAAI;oBACH,OAAO,IAAI,CAAC,SAAS,CAACsD;gBACvB,SAAU;oBACT,IAAI,CAAC,eAAe;gBACrB;YACD;;;YAEAI,KAAAA;mBAAAA,SAAUJ,IAAI;;gBACb,OAAQA,KAAK,IAAI;oBAChB,KAAK;wBACJ,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,UAAU;oBAElC,KAAK;wBACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;oBAEpC,KAAK;wBACJ,OAAO,IAAI,CAAC,uBAAuB,CAACA;oBAErC,KAAK;wBACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;oBAEnC,KAAK;wBACJ,OAAO,IAAI,CAAC,gBAAgB,CAACA;oBAE9B,KAAK;wBACJ,OAAOA,KAAK,KAAK;oBAElB,KAAK;wBACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;oBAEpC,KAAK;wBACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;oBAEnC,KAAK;wBACJ,OAAO,IAAI,CAAC,mBAAmB,CAACA;oBAEjC,KAAK;wBACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;oBAEpC,KAAK;wBACJ,MAAM,IAAIP,YAAYzD,mBAAmBzC,eAAe,cAAc,EAAE;4BAAC;yBAAsB;oBAEhG,KAAK;wBACJ,OAAO,IAAI,CAAC,6BAA6B,CAACyG;oBAE3C,KAAK;wBACJ,OAAO,IAAI,CAAC,oBAAoB,CAACA;oBAElC,KAAK;wBACJ,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAACA,KAAK,UAAU,IAAI,IAAI,CAAC,KAAK,CAACA,KAAK,SAAS;oBAEvF,KAAK;wBACJ,IAAIA,AAAqB,iBAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAIC,MAAO,4BAA4C,OAAjBD,KAAK,MAAM,CAAC,IAAI,EAAC;wBAG9D,IAAIA,AAAqB,eAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAIC,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;4BAAC;yBAA6B;wBAOjG,IAAIyG,AAAqB,cAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAIC,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;4BAAC;yBAAsB;wBAE1F,IAAM8G,cAAc,IAAI,CAAC,KAAK,CAACL,KAAK,MAAM;wBAG1C,IAAMM,OAAON,KAAK,SAAS,CAAC,MAAM,GAAGA,KAAK,SAAS,CAAC,GAAG,CAAC,SAACO,GAAG;mCAAK,MAAK,KAAK,CAACA;6BAAQ,EAAE;wBACtF,IAAI,CAAC,yBAAyB,CAACF,aAAaC;wBAE5C,OAAO,WAAID,aAAY,8BAAGC;oBAE3B,KAAK;wBACJ,OAAO,IAAI,CAAC,KAAK,CAACN,KAAK,UAAU;oBAElC,KAAK;wBACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;oBAEnC,KAAK;wBACJ,MAAM,IAAIP,YAAYzD,mBAAmBzC,eAAe,cAAc,EAAE;4BAAC;yBAAoB;oBAE9F,KAAK;wBACJ,MAAM,IAAIkG,YAAYzD,mBAAmBzC,eAAe,cAAc,EAAE;4BAAC;yBAAmB;oBAE7F;wBACC,IAAIiH,UAAU,IAAI,CAAC,MAAM,CAAC,KAAK,CAACR,KAAK,KAAK,EAAEA,KAAK,GAAG;wBAEpD,IAAIQ,QAAQ,MAAM,GAAG,IACpBA,UAAUA,QAAQ,KAAK,CAAC,GAAG,MAAM;wBAGlC,MAAM,IAAIf,YAAa,IAAW,OAARe,SAAQ,OAAK,MAAMxE,mBAAmBzC,eAAe,iBAAiB,EAAE;4BAACiH;yBAAQ;gBAE7G;YACD;;;YAOAC,KAAAA;mBAAAA,SAAuBT,IAAI;gBAC1B,IAAMU,KAAKV,KAAK,QAAQ;gBACxB,IAAMW,OAAO,IAAI,CAAC,KAAK,CAACX,KAAK,IAAI;gBACjC,IAAMY,QAAQ,IAAI,CAAC,KAAK,CAACZ,KAAK,KAAK;gBACnC,IAAIU,AAAO,QAAPA,MAAe,CAAgB,YAAhB,OAAOC,QAAqB,AAAiB,YAAjB,OAAOC,KAAiB,GACtE;oBAAA,IAAIxE,OAAOuE,MAAM,MAAM,GAAGvE,OAAOwE,OAAO,MAAM,GAAG9G,mBAChD,MAAM,IAAI4C,WAAW;gBACtB;gBAED,IAAImB,AAAAA,CAAgB,WAAT8C,OAAAA,cAAP9C,SAAO8C,KAAI,MAAK,YAAY9C,AAAAA,CAAiB,WAAV+C,QAAAA,cAAP/C,SAAO+C,MAAK,MAAK,UAAU;oBAC1D,IAAIF,AAAO,SAAPA,MAAgBE,CAAAA,QAAQ5G,uBAAuB4G,QAAQ,EAAC,GAC3D,MAAM,IAAIlE,WAAY,yCAA4D,OAApB1C;oBAE/D,IAAM6G,WAAWF,KAAK,QAAQ,CAAC,GAAG,MAAM;oBACxC,IAAMG,YAAYF,MAAM,QAAQ,CAAC,GAAG,MAAM;oBAC1C,IACEF,AAAO,SAAPA,MAAeG,WAAWpE,OAAOmE,SAAS3G,mBAC1CyG,AAAO,SAAPA,MAAeE,QAAQG,OAAO9G,oBAC9ByG,AAAO,SAAPA,MAAeE,SAAS,EAAE,IAAIC,WAAWpE,OAAOmE,SAAS3G,mBACzDyG,AAAO,QAAPA,MAAcG,WAAWC,YAAY7G,mBACpCyG,AAAAA,CAAAA,AAAO,QAAPA,MAAcA,AAAO,QAAPA,EAAS,KAAMM,KAAK,GAAG,CAACH,UAAUC,aAAa,IAAI7G,iBAEnE,MAAM,IAAIyC,WAAW;gBAEvB;gBAEA,IAAIwB,qBAAqB,cAAc,CAACwC,KACvC,OAAOxC,oBAAoB,CAACwC,GAAG,CAACC,MAAMC;gBAGvC,MAAM,IAAInB,YAAa,yBAAsC,OAAdO,KAAK,QAAQ;YAC7D;;;YAQAiB,KAAAA;mBAAAA,SAAoBX,IAAI;gBACvB,IAAI,AAAmB,YAAnB,OAAOA,IAAI,CAAC,EAAE,IAAiBA,IAAI,CAAC,EAAE,CAAC,MAAM,GAAGlG,0BACnD,MAAM,IAAIsC,WAAW;gBAEtB,IAAI,AAAmB,YAAnB,OAAO4D,IAAI,CAAC,EAAE,IAAiBA,IAAI,CAAC,EAAE,CAAC,MAAM,GAAGjG,yBACnD,MAAM,IAAIqC,WAAW;YAEvB;;;YAEAwE,KAAAA;mBAAAA,SAA0Bb,WAAW,EAAEC,IAAI;oBAQqBa;gBAP/D,IAAId,gBAAgBe,QACnB,IAAI,CAAC,mBAAmB,CAACd;gBAE1B,IAAMe,OAAOf,IAAI,CAAC,EAAE;gBACpB,IAAID,gBAAgBrC,SAASsC,AAAgB,MAAhBA,KAAK,MAAM,IAAU,AAAgB,YAAhB,OAAOe,QAAqBA,OAAOzH,kBACpF,MAAM,IAAI8C,WAAW;gBAEtB,IAAI2D,gBAAgBtC,eAAgBsD,CAAAA,OAAOxH,oBAAoBsH,AAAAA,SAAAA,CAAAA,SAAAA,IAAI,CAAC,EAAE,AAAD,IAANA,KAAAA,IAAAA,OAAS,aAAa,AAAD,IAAItH,gBAAe,GACtG,MAAM,IAAI6C,WAAW;gBAEtB,IAAI2D,gBAAgBiB,YAAgBxD,YAAJuD,MAAgBtD,gBAAesD,KAAK,UAAU,GAAGxH,kBAChF,MAAM,IAAI6C,WAAW;gBAEtB,IAAI2D,gBAAgB3E,OAAO2E,gBAAgB9F,KAAK;wBACwCgH;oBAAvF,IAAMC,iBAAiB,AAAgB,YAAhB,OAAOH,QAAqBrD,MAAM,OAAO,CAACqD,QAAQA,KAAK,MAAM,GAAGE,QAAAA,CAAAA,aAAAA,QAAAA,OAAAA,KAAAA,IAAAA,KAAM,IAAI,AAAD,IAATA,aAAcF,QAAAA,OAAAA,KAAAA,IAAAA,KAAM,MAAM;oBACjH,IAAI,AAA0B,YAA1B,OAAOG,kBAA+BA,iBAAiB5H,kBAC1D,MAAM,IAAI8C,WAAW;gBAEvB;gBACA,IAAIpB,wBAAwB+E,cAAc;oBACzC,IAAIoB;oBACJ,IAAQ3D,YAAJuD,MAAgBtD,cAAa;4BACjB2D;wBAAf,IAAMC,SAASD,QAAAA,CAAAA,UAAAA,IAAI,CAAC,EAAE,AAAD,IAANA,UAAW;4BACLE;wBAArB,IAAMC,eAAeD,QAAAA,CAAAA,UAAAA,IAAI,CAAC,EAAE,AAAD,IAANA,UAAWZ,KAAK,KAAK,CAAEK,AAAAA,CAAAA,KAAK,UAAU,GAAGM,MAAK,IAAKtB,YAAY,iBAAiB;wBACrGoB,aAAaI,eAAexB,YAAY,iBAAiB;oBAC1D,OAAO;4BACiDyB;wBAAvD,IAAMC,gBAAe,AAAgB,YAAhB,OAAOV,OAAoBA,OAAOS,QAAAA,CAAAA,eAAAA,QAAAA,OAAAA,KAAAA,IAAAA,KAAM,MAAM,AAAD,IAAXA,eAAgB;wBACvEL,aAAaM,gBAAe1B,YAAY,iBAAiB;oBAC1D;oBACA,IAAIoB,aAAa5H,kBAChB,MAAM,IAAI6C,WAAW;gBAEvB;YACD;;;YAOAsF,KAAAA;mBAAAA,SAAwBhC,IAAI;gBAC3B,OAAQA,KAAK,QAAQ;oBACpB,KAAK;wBACJ,IAAMW,OAAO,IAAI,CAAC,KAAK,CAACX,KAAK,IAAI;wBACjC,OAAOW,OAAO,IAAI,CAAC,KAAK,CAACX,KAAK,KAAK,IAAIW;oBAExC,KAAK;wBACJ,IAAMsB,QAAO,IAAI,CAAC,KAAK,CAACjC,KAAK,IAAI;wBACjC,OAAOiC,QAAOA,QAAO,IAAI,CAAC,KAAK,CAACjC,KAAK,KAAK;oBAE3C,KAAK;wBACJ,IAAMkC,QAAO,IAAI,CAAC,KAAK,CAAClC,KAAK,IAAI;wBACjC,OAAOkC,QAAAA,QAAsCA,QAAO,IAAI,CAAC,KAAK,CAAClC,KAAK,KAAK;oBAE1E;wBACC,MAAM,IAAIP,YAAa,iCAA8C,OAAdO,KAAK,QAAQ;gBAEtE;YACD;;;YAMAmC,KAAAA;mBAAAA,SAAsBnC,IAAI;gBACzB,OAAQA,KAAK,QAAQ;oBACpB,KAAK;wBACJ,OAAO,CAAC,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAEjC,KAAK;wBACJ,OAAO,CAAC,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAEjC,KAAK;wBACJ,OAAO,CAAC,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAEjC,KAAK;wBACJ,OAAO,CAAC,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAEjC,KAAK;wBACJ,OAAOnC,SAAO,IAAI,CAAC,KAAK,CAACmC,KAAK,QAAQ;oBAEvC,KAAK;wBACJ,OAAO,KAAK,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAErC,KAAK;wBACJ,MAAM,IAAIP,YAAYzD,mBAAmBzC,eAAe,cAAc,EAAE;4BAAC;yBAAkB;oBAE5F;wBACC,MAAM,IAAIkG,YAAa,+BAA4C,OAAdO,KAAK,QAAQ;gBAEpE;YACD;;;YAMAoC,KAAAA;mBAAAA,SAAiBpC,IAAI;gBACpB,IAAMnE,OAAOmE,KAAK,IAAI;oBACjBrE,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAe,IAAI,CAAC,MAAM,qBAA1BA,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA4B;wBAA5BA,IAAM2C,QAAN3C,MAAAA,KAAAA;wBACJ,IAAI5C,OAAO,MAAM,CAACuF,OAAOzC,OACxB,OAAOyC,KAAK,CAACzC,KAAK;oBAEpB;;oBAJKF,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAML,MAAM,IAAI0G,eAAerG,mBAAmBzC,eAAe,cAAc,EAAE;oBAACsC;iBAAK;YAClF;;;YAMAyG,KAAAA;mBAAAA,SAAuBtC,IAAI;oBAAEuC,cAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAcxG;gBAC1C,IAAMyB,SAAS+E,gBAAgBxG,YAAY,IAAI,CAAC,KAAK,CAACiE,KAAK,MAAM,IAAIuC;gBAErE,IAAMC,mBAAmBxC,AAAuB,iBAAvBA,KAAK,QAAQ,CAAC,IAAI,IAAqB,CAACA,KAAK,QAAQ;gBAC9E,IAAMyC,WAAWD,mBAAmBxC,KAAK,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;gBAMjF,IAAIyC,AAAa,YAAbA,YAA8B3E,YAANN,QAAkByC,QAC7C,MAAM,IAAIA,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAAwB;gBAQ5F,IAAI,QAAOiE,UAA6CA,AAAqBhB,WAArBgB,OAAO,SAAS,IAAkBA,MAAM,CAACiF,SAAS,KAAKjF,OAAO,SAAS,EAC9H,MAAM,IAAIyC,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAAiC;gBAGrG,IAAIiE,QAAAA,QAAyC;oBAE5C,IAAIwC,KAAK,QAAQ,EAChB;oBAED,MAAM,IAAIrC,UAAU3B,mBAAmBzC,eAAe,qBAAqB,EAAE;wBAACiE;wBAAQiF;qBAAS;gBAChG;gBAEA,IAAM1C,SAASvC,MAAM,CAACiF,SAAS;gBAQ/B,IAAI1C,WAAW2C,YAAY3C,WAAW2C,SAAS,SAAS,EACvD,MAAM,IAAIzC,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAG3F,OAAOwG;YACR;;;YAMA4C,KAAAA;mBAAAA,SAAsB3C,IAAI;gBACzB,IAAMD,SAAS,EAAE;gBAEjB,IAAK,IAAI6C,IAAI,GAAGA,IAAI5C,KAAK,QAAQ,CAAC,MAAM,EAAE4C,IAAK;oBAC9C,IAAMC,UAAU7C,KAAK,QAAQ,CAAC,EAAE,CAAC4C;oBAIjC,IAAIC,AAAY,SAAZA,SAAkB;wBACrB9C,OAAO,MAAM;wBACb;oBACD;oBAEA,IAAMxE,QAAQ,IAAI,CAAC,KAAK,CAACsH;oBAEzB,IAAIA,AAAiB,oBAAjBA,QAAQ,IAAI,EAAsB;4BAErCC;wBADA,IAAI,CAAC,mBAAmB,CAAC/C,OAAO,MAAM,EAAExE;wBACxCuH,CAAAA,UAAAA,MAAK,EAAE,IAAI,OAAXA,SAAY,8BAAGvH;oBAChB,OACCwE,OAAO,IAAI,CAACxE;gBAEd;gBAEA,OAAOwE;YACR;;;YAEAgD,KAAAA;mBAAAA,SAAoBC,aAAa,EAAEzH,KAAK;gBACvC,IAAM8F,OAAO,AAAiB,YAAjB,OAAO9F,SAAsByC,MAAM,OAAO,CAACzC,SAASA,MAAM,MAAM,GAAGA,QAAAA,QAAAA,KAAAA,IAAAA,MAAO,IAAI;gBAC3F,IAAI,AAAgB,YAAhB,OAAO8F,QAAqB2B,gBAAgB3B,OAAOzH,kBACtD,MAAM,IAAI8C,WAAW;YAEvB;;;YAMAuG,KAAAA;mBAAAA,SAAuBjD,IAAI;gBAC1B,IAAMhH,MAAM,CAAC;gBACb,IAAIkK,sBAAsB;oBACrBvH,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAcqE,KAAK,UAAU,qBAA7BrE,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA+B;wBAA/BA,IAAM1C,OAAN0C,MAAAA,KAAAA;wBACJ,IAAI1C,AAAc,oBAAdA,KAAK,IAAI,EAAsB;4BAClC,IAAMkK,cAAc,IAAI,CAAC,KAAK,CAAClK,KAAK,QAAQ;4BAC5CiK,uBAAuBnK,OAAO,IAAI,CAACoK,aAAa,MAAM;4BACtD,IAAID,sBAAsBtJ,kBACzB,MAAM,IAAI8C,WAAW;4BAEtB3D,OAAO,MAAM,CAACC,KAAKmK;4BACnB;wBACD;wBAOA,IAAMrK,MAAMG,KAAK,QAAQ,GAAG,IAAI,CAAC,KAAK,CAACA,KAAK,GAAG,IAAIA,KAAK,GAAG,CAAC,IAAI,IAAIA,KAAK,GAAG,CAAC,KAAK;wBAClF,IAAMsC,QAAQ,IAAI,CAAC,KAAK,CAACtC,KAAK,KAAK;wBACnC,IAAIA,KAAK,QAAQ,EAChBF,OAAO,cAAc,CAACC,KAAKF,KAAK;4BAAEyC,OAAAA;4BAAO,UAAU;4BAAM,YAAY;4BAAM,cAAc;wBAAK;6BAE9FvC,GAAG,CAACF,IAAI,GAAGyC;oBAEb;;oBAvBKI,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAwBL,OAAO3C;YACR;;;YAEAoK,KAAAA;mBAAAA,SAAoBpD,IAAI;gBACvB,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;YAChC;;;YAQAqD,KAAAA;mBAAAA,SAA8BrD,IAAI;;gBACjC,OAAO;qDAAIM,OAAAA,IAAAA,MAAAA,OAAAA,OAAAA,GAAAA,OAAAA,MAAAA,OAAAA,IAAI,CAAJA,KAAAA,GAAAA,SAAAA,CAAAA,KAAAA;oBAEV,IAAMgD,WAAW,CAAC;oBAClB,IAAMC,aAAavD,KAAK,MAAM,CAAC,MAAM;oBACrC,IAAK,IAAI4C,IAAI,GAAGA,IAAIW,YAAYX,IAC/BU,QAAQ,CAACtD,KAAK,MAAM,CAAC4C,EAAE,CAAC,IAAI,CAAC,GAAGtC,IAAI,CAACsC,EAAE;oBAOxC,MAAK,MAAM,CAAC,OAAO,CAACU;oBACpB,IAAI;wBACH,IAAMvD,SAAS,MAAK,KAAK,CAACC,KAAK,IAAI;wBACnC,MAAK,sBAAsB,CAACD;wBAC5B,OAAOA;oBACR,SAAU;wBACT,MAAK,MAAM,CAAC,KAAK;oBAClB;gBACD;YACD;;;YAEAyD,KAAAA;mBAAAA,SAAuBjI,KAAK;gBAC3B,IAAgCkI,qBAAAA,kBAAkBlI,OAAO,mCAAjD8B,WAAwBoG,mBAAxBpG,QAAQ,EAAEC,YAAcmG,mBAAdnG,SAAS;gBAC3B,IAAI,CAAC,iBAAiB,IAAID;gBAC1B,IAAI,CAAC,kBAAkB,IAAIC;gBAC3B,IAAI,IAAI,CAAC,iBAAiB,GAAG,KAAK,IAAI,CAAC,kBAAkB,GAAG,GAC3D,MAAM,IAAIZ,WAAW;YAEvB;;;YAMAgH,KAAAA;mBAAAA,SAAqB1D,IAAI;;gBACxB,IAAM2D,aAAa3D,KAAK,QAAQ,IAAKA,AAAqB,uBAArBA,KAAK,MAAM,CAAC,IAAI,IAA2BA,KAAK,MAAM,CAAC,QAAQ;gBACpG,IAAI4D;gBACJ,IAAIC,SAAS;gBAEb,IAAI7D,AAAqB,uBAArBA,KAAK,MAAM,CAAC,IAAI,EAAyB;oBAO5C6D,SAAS,IAAI,CAAC,KAAK,CAAC7D,KAAK,MAAM,CAAC,MAAM;oBACtC4D,OAAO,IAAI,CAAC,sBAAsB,CAAC5D,KAAK,MAAM,EAAE6D;gBACjD,OACCD,OAAO,IAAI,CAAC,KAAK,CAAC5D,KAAK,MAAM;gBAG9B,IAAK4D,QAAAA,QAAwCD,YAC5C;gBAGD,IAAIC,SAASlB,UACZ,MAAM,IAAIzC,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAM3F,IAAIqK,SAAS3D,MAAM,iBAAiB,EACnC,MAAM,IAAIA,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAA0B;gBAG9F,IAAIqF,oBAAoB,GAAG,CAACgF,OAAO;oBAClC,IAAM9E,OAAOF,oBAAoB,GAAG,CAACgF;oBACrC,MAAM,IAAI3D,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;wBAACuF;qBAAK;gBACzE;gBAIA,IAAItD,qBAAqB,GAAG,CAACoI,OAC5B,MAAM,IAAI3D,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAE,wBAAsD,OAA/BiC,qBAAqB,GAAG,CAACoI;iBAAQ;gBAI7H,IAAMtD,OAAQ;oBACb,IAAIN,AAA0B,MAA1BA,KAAK,SAAS,CAAC,MAAM,EACxB,OAAO,EAAE;oBAGV,IAAID,SAAS,EAAE;oBAEf,IAAK,IAAI6C,IAAI,GAAGA,IAAI5C,KAAK,SAAS,CAAC,MAAM,EAAE4C,IAAK;wBAC/C,IAAMC,UAAU7C,KAAK,SAAS,CAAC,EAAE,CAAC4C;wBAClC,IAAMrH,QAAQ,MAAK,KAAK,CAACsH;wBAEzB,IAAIA,AAAiB,oBAAjBA,QAAQ,IAAI,EAAsB;gCAErCC;4BADA,MAAK,mBAAmB,CAAC/C,OAAO,MAAM,EAAExE;4BACxCuH,CAAAA,UAAAA,MAAK,EAAE,IAAI,OAAXA,SAAY,8BAAGvH;wBAChB,OACCwE,OAAO,IAAI,CAACxE;oBAEd;oBAEA,OAAOwE;gBACR;gBAMA,IAAIO,KAAK,IAAI,CAAC,SAACC,GAAG;2BAAKA,QAAQmC;oBAC9B,MAAM,IAAIzC,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAE3F,IAAI,AAAkB,YAAlB,OAAOsK,QAAqB;oBAC/B,IAAIzH,OAAO,SAAS,CAAC,MAAM,IAAIwH,SAASxH,OAAO,SAAS,CAAC,MAAM,IAAIyH,OAAO,MAAM,GAAGpH,OAAO6D,IAAI,CAAC,EAAE,IAAIxG,mBACpG,MAAM,IAAI4C,WAAW;oBAEtB,IAAKN,AAAAA,CAAAA,OAAO,SAAS,CAAC,QAAQ,IAAIwH,SAASxH,OAAO,SAAS,CAAC,QAAQ,IAAIwH,SAASxH,OAAO,SAAS,CAAC,MAAK,KAAMK,OAAO6D,IAAI,CAAC,EAAE,IAAIxG,mBAC9H,MAAM,IAAI4C,WAAW;oBAEtB,IAAIN,OAAO,SAAS,CAAC,MAAM,IAAIwH,SAASxH,OAAO,SAAS,CAAC,MAAM,EAAE;wBAChE,IAAM0H,eAAeD,OAAO,MAAM,GAAGvD,KAAK,MAAM,CAAC,SAACyD,MAAM,EAAExI,KAAK;mCAAKwI,SAAS3H,OAAOb,OAAO,MAAM;2BAAE;wBACnG,IAAIuI,eAAehK,mBAClB,MAAM,IAAI4C,WAAW;oBAEvB;oBACA,IAAKN,OAAO,SAAS,CAAC,OAAO,IAAIwH,SAASxH,OAAO,SAAS,CAAC,OAAO,IAAMA,OAAO,SAAS,CAAC,UAAU,IAAIwH,SAASxH,OAAO,SAAS,CAAC,UAAU,EAC1I;wBAAA,IAAI,AAAmB,YAAnB,OAAOkE,IAAI,CAAC,EAAE,EAAe;4BAChC,IAAI,AAAmB,cAAnB,OAAOA,IAAI,CAAC,EAAE,IAAoB,AAAmB,YAAnB,OAAOA,IAAI,CAAC,EAAE,IAAiB,6BAAgB,IAAI,CAACA,IAAI,CAAC,EAAE,GAChG,MAAM,IAAIL,MAAM;4BAEjB,IAAI4D,OAAO,MAAM,GAAG7C,KAAK,GAAG,CAAC,GAAGV,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,UACjD,MAAM,IAAI5D,WAAW;4BAEtB,IAAMsH,aAAarH,oBAAoBkH,QAAQvD,IAAI,CAAC,EAAE,EAAEsD,SAASxH,OAAO,SAAS,CAAC,UAAU;4BAC5F,IAAIyH,OAAO,MAAM,GAAGG,aAAa5H,OAAOkE,IAAI,CAAC,EAAE,EAAE,MAAM,GAAGxG,mBACzD,MAAM,IAAI4C,WAAW;wBAEvB;oBAAA;oBAED,IAAIkH,SAASxH,OAAO,SAAS,CAAC,KAAK,EAAE;wBACpC,IAAIkE,AAAY,OAAZA,IAAI,CAAC,EAAE,IAAWuD,OAAO,MAAM,GAAGjK,kBACrC,MAAM,IAAI8C,WAAW;wBAEtB,IAAI,AAAmB,YAAnB,OAAO4D,IAAI,CAAC,EAAE,IAAiBA,AAAY,OAAZA,IAAI,CAAC,EAAE,IAAW3D,oBAAoBkH,QAAQvD,IAAI,CAAC,EAAE,EAAE,SAAS1G,kBAClG,MAAM,IAAI8C,WAAW;oBAEvB;gBACD;gBACA,IAAIkH,SAASxC,QACZ,IAAI,CAAC,mBAAmB,CAACd;gBAE1B,IAAKuD,AAAAA,CAAAA,WAAW7F,SAAS1C,wBAAwBuI,OAAM,KAAMD,SAASC,OAAO,IAAI,EAAE;oBAClF,IAAMI,SAAS3D,IAAI,CAAC,EAAE;wBAC6D4D;oBAAnF,IAAM7C,OAAO,AAAkB,YAAlB,OAAO4C,UAAuBjG,MAAM,OAAO,CAACiG,UAAUA,OAAO,MAAM,GAAGC,QAAAA,CAAAA,eAAAA,QAAAA,SAAAA,KAAAA,IAAAA,OAAQ,IAAI,AAAD,IAAXA,eAAgBD,QAAAA,SAAAA,KAAAA,IAAAA,OAAQ,MAAM;oBACjH,IAAI,AAAgB,YAAhB,OAAO5C,QAAqBA,OAAOzH,kBACtC,MAAM,IAAI8C,WAAW;gBAEvB;gBAEA,IAAI,AAAgB,cAAhB,OAAOkH,MAAqB;oBAC/B,IAAMO,eAAeC,cAAcpE,KAAK,MAAM;oBAC9C,MAAM,IAAIrC,UAAU3B,mBAAmBzC,eAAe,eAAe,EAAE;wBAAC4K;qBAAa;gBACtF;gBAEA,IAAMpE,SAAS6D,KAAK,KAAK,CAACC,QAAQvD;gBAKlC,IAAUxC,YAANiC,QAAkBG,UACrB,MAAM,IAAID,MAAMjE,mBAAmBzC,eAAe,cAAc,EAAE;oBAAC;iBAAsC;gBAG1G,OAAOwG;YACR;;;YAOAsE,KAAAA;mBAAAA,SAAsBrE,IAAI;gBACzB,IAAID,SAAS;gBACb,IAAMuE,kBAAkBtE,KAAK,WAAW,CAAC,MAAM;gBAE/C,IAAK,IAAI4C,IAAI,GAAGA,IAAI5C,KAAK,MAAM,CAAC,MAAM,EAAE4C,IAAK;oBAC5C7C,UAAUC,KAAK,MAAM,CAAC4C,EAAE,CAAC,KAAK,CAAC,GAAG;oBAClC,IAAIA,IAAI0B,iBACPvE,UAAU,IAAI,CAAC,KAAK,CAACC,KAAK,WAAW,CAAC4C,EAAE;gBAE1C;gBAEA,OAAO7C;YACR;;;;YAhsBOR,KAAAA;mBAAP,SAAgBC,UAAU,EAAEtD,OAAO;gBAClC,IAAMqI,YAAY,IA9BPrF,UA8BqBhD;gBAChC,OAAOqI,UAAU,QAAQ,CAAC/E;YAC3B;;;WAhCYN;;AAquBN,SAASkF,cAAcpE,IAAI;IACjC,OAAQA,KAAK,IAAI;QAChB,KAAK;YACJ,OAAOA,KAAK,IAAI;QAEjB,KAAK;YACJ,OAAOA,KAAK,GAAG;QAEhB,KAAK;YACJ,OAAQ,IAAwF,OAArFA,KAAK,QAAQ,CAAC,GAAG,CAAC,SAACwE,KAAK;uBAAMA,AAAU,SAAVA,QAAiB,KAAKJ,cAAcI;eAAS,IAAI,CAAC,MAAK;QAEjG,KAAK;YAEJ,IAAIxE,AAA2B,MAA3BA,KAAK,UAAU,CAAC,MAAM,EACzB,OAAO;YAGR,OAAO;QAER,KAAK;YACJ,IAAMyE,YAAYL,cAAcpE,KAAK,MAAM;YAC3C,IAAM0E,cAAcN,cAAcpE,KAAK,QAAQ;YAE/C,IAAIA,KAAK,QAAQ,EAChB,OAAQ,GAAe0E,MAAAA,CAAbD,WAAU,KAAe,OAAZC,aAAY;YAEpC,OAAQ,GAAeA,MAAAA,CAAbD,WAAU,KAAe,OAAZC;QAExB;YACC,OAAO;IAET;AACD;AC7jCC;;;;;;;;;;;;;;;;;AACD,IAAMC,8BAA8B;AACpC,IAAMC,mCAAmC;AACzC,IAAMC,qBAAqB;AAC3B,IAAMC,0BAA0B;AAEhC,SAASzI,6BAAcd,KAAK,EAAEM,IAAI,EAAES,YAAY,EAAEC,OAAO;IACxD,IAAIhB,AAAUiB,WAAVjB,OACH,OAAOe;IAER,IAAI,CAACG,OAAO,aAAa,CAAClB,UAAUA,QAAQ,KAAKA,QAAQgB,SACxD,MAAM,IAAIG,WAAY,GAA2CH,MAAAA,CAAzCV,MAAK,sCAA4C,OAARU;IAElE,OAAOhB;AACR;AAEA,IAAMwJ,gCAAcA,WAAAA,GAApB;;aAAMA;YAQO3F,UAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAU,CAAC;8CARlB2F;QASJ3F,QAAAA,WAAAA,CAAAA,UAAY,CAAC;QACb,IAAI,CAAC,iBAAiB,GAAG/C,6BAAc+C,QAAQ,iBAAiB,EAAE,qBAAqBuF,6BAA6BC;QACpH,IAAI,CAAC,SAAS,GAAGvI,6BAAc+C,QAAQ,SAAS,EAAE,aAAayF,oBAAoBC;QACnF,IAAI1F,AAA4B5C,WAA5B4C,QAAQ,eAAe,IAAmB,CAAmC,YAAnC,OAAOA,QAAQ,eAAe,IAAiBA,AAAmC,MAAnCA,QAAQ,eAAe,CAAC,MAAM,IAAUA,QAAQ,eAAe,CAAC,MAAM,GAAG,GAAE,GACvK,MAAM,IAAIzB,UAAU;QAErB,IAAIyB,AAA0B5C,WAA1B4C,QAAQ,aAAa,IAAmB,CAAiC,YAAjC,OAAOA,QAAQ,aAAa,IAAiBA,AAAiC,MAAjCA,QAAQ,aAAa,CAAC,MAAM,IAAUA,QAAQ,aAAa,CAAC,MAAM,GAAG,GAAE,GAC/J,MAAM,IAAIzB,UAAU;QAGrB,IAAI,CAAC,SAAS,GAAGyB,QAAQ,eAAe,IAAI;QAC5C,IAAI,CAAC,OAAO,GAAGA,QAAQ,aAAa,IAAI;QAGxC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;QACrC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;QAGjC,IAAI,CAAC,kBAAkB,GAAGA,AAA+B,SAA/BA,QAAQ,kBAAkB;;gCA3BhD2F,gBAAAA;;YAmCLC,KAAAA;mBAAAA,SAAM/I,QAAQ;;gBAEb,IAAI,AAAoB,YAApB,OAAOA,UACV,MAAM,IAAI0B,UAAU;gBAErB,IAAI1B,SAAS,MAAM,GAAG,IAAI,CAAC,iBAAiB,EAC3C,MAAM,IAAIS,WAAY,0CAAgE,OAAvB,IAAI,CAAC,iBAAiB,EAAC;gBAGvF,IAAMuI,SAAS,EAAE;gBACjB,IAAMC,YAAY,SAACC,KAAK;oBACvB,IAAIF,OAAO,MAAM,IAAI,MAAK,SAAS,EAClC,MAAM,IAAIvI,WAAY,+CAA6D,OAAf,MAAK,SAAS;oBAEnFuI,OAAO,IAAI,CAACE;gBACb;gBACA,IAAMpB,SAAS9H,SAAS,MAAM;gBAG9B,IAAImJ,QAAQ;gBACZ,IAAIC,SAAS;gBACb,IAAIC,eAAe;gBACnB,IAAIC,MAAM;gBAEV,IAAIC,eAAe;gBAGnB,MAAOD,MAAMxB,OAAQ;oBACpB,IAAM0B,OAAOxJ,QAAQ,CAACsJ,IAAI;oBAC1B,IAAMG,WAAWzJ,QAAQ,CAACsJ,MAAM,EAAE;oBAGlC,OAAQH;wBAEP,KAAK;4BAEJ,IAAI,IAAI,CAAC,QAAQ,CAACG,KAAKtJ,UAAU,IAAI,CAAC,SAAS,GAAG;gCAEjD,IAAIoJ,OAAO,MAAM,GAAG,GAAG;oCACtBH,UAAU;wCAAE,MAAM;wCAAQ,OAAOG;wCAAQ,OAAOE,MAAMF,OAAO,MAAM;wCAAE,KAAKE;oCAAI;oCAC9EF,SAAS;gCACV;gCAEAD,QAAQ;gCACRE,eAAeC;gCACfC,eAAe;gCACfD,OAAO,IAAI,CAAC,QAAQ;gCACpB;4BACD;4BAEAF,UAAUI;4BACV;wBAGD,KAAK;4BAEJ,IAAIA,AAAS,QAATA,MAEHL,QAAQ;iCACF,IAAIK,AAAS,QAATA,MAEVL,QAAQ;iCACF,IAAIK,AAAS,QAATA,MAEVL,QAAQ;iCACF,IAAIK,AAAS,QAATA,QAAgB,IAAI,CAAC,gBAAgB,CAACD,eAKhDJ,QAAQ;iCACF,IAAIK,AAAS,SAATA,MAEYL,QAAlBM,AAAa,QAAbA,WAA0B,cACrBA,AAAa,QAAbA,WAA0B,cAC1BA,AAAa,QAAbA,WAA0B,oBACtB;iCACP,IAAI,IAAI,CAAC,QAAQ,CAACH,KAAKtJ,UAAU,IAAI,CAAC,OAAO,GAAG;gCAEtD,IAAM0J,YAAY,IAAI,CAAC,kBAAkB,GAAGN,SAASA,OAAO,IAAI;gCAChE,IAAIM,UAAU,MAAM,GAAG,GACtBT,UAAU;oCACT,MAAM;oCACN,OAAOS;oCACP,OAAOL;oCACP,KAAKC,MAAM,IAAI,CAAC,MAAM;oCACtB,cAAcD,eAAe,IAAI,CAAC,QAAQ;oCAC1C,YAAYC;gCACb;gCAGDF,SAAS;gCACTD,QAAQ;gCACRG,OAAO,IAAI,CAAC,MAAM;gCAClB;4BACD;4BAGA,IAAI,CAAC,mBAAM,IAAI,CAACE,OACfD,eAAeC;4BAEhBJ,UAAUI;4BACV;wBAGD,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHL,QAAQ;iCACF,IAAIK,AAAS,QAATA,MACVL,QAAQ;4BAETC,UAAUI;4BACV;wBAED,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHL,QAAQ;iCACF,IAAIK,AAAS,QAATA,MACVL,QAAQ;4BAETC,UAAUI;4BACV;wBAED,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHL,QAAQ;iCACF,IAAIK,AAAS,QAATA,MACVL,QAAQ;4BAETC,UAAUI;4BACV;wBAED,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHL,QAAQ;iCACF,IAAIK,AAAS,QAATA,MAEVL,QAAQ;iCACF,IAAIK,AAAS,QAATA,MACVL,QAAQ;4BAETC,UAAUI;4BACV;wBAED,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHL,QAAQ;iCACF,IAAIK,AAAS,QAATA,MACVL,QAAQ;4BAETC,UAAUI;4BACV;wBAID,KAAK;4BACJJ,UAAUI;4BACVL,QAAQ;4BACR;wBAED,KAAK;4BACJC,UAAUI;4BACVL,QAAQ;4BACR;wBAED,KAAK;4BACJC,UAAUI;4BACVL,QAAQ;4BACR;wBAED,KAAK;4BACJC,UAAUI;4BACVL,QAAQ;4BACR;wBAED,KAAK;4BACJC,UAAUI;4BACVL,QAAQ;4BACR;oBACF;oBAGAG;gBACD;gBAIA,IAAIF,OAAO,MAAM,GAAG,GACnB,IAAID,AAAU,WAAVA,OAEHF,UAAU;oBAAE,MAAM;oBAAQ,OAAOG;oBAAQ,OAAOE,MAAMF,OAAO,MAAM;oBAAE,KAAKE;gBAAI;qBACxE;oBAEN,IAAMK,iBAAiB,IAAI,CAAC,SAAS,GAAGP;oBACxCH,UAAU;wBAAE,MAAM;wBAAQ,OAAOU;wBAAgB,OAAON;wBAAc,KAAKC;oBAAI;gBAChF;gBAGD,OAAON;YACR;;;YASAY,KAAAA;mBAAAA,SAAiBC,IAAI;gBACpB,OAAOA,AAAS,OAATA,QAAe,uBAAuB,QAAQ,CAACA;YACvD;;;YAUAC,KAAAA;mBAAAA,SAASR,GAAG,EAAEtJ,QAAQ,EAAE+J,QAAQ;gBAE/B,IAAIT,MAAMS,SAAS,MAAM,GAAG/J,SAAS,MAAM,EAC1C,OAAO;gBAIR,IAAK,IAAI2G,IAAI,GAAGA,IAAIoD,SAAS,MAAM,EAAEpD,IACpC,IAAI3G,QAAQ,CAACsJ,MAAM3C,EAAE,KAAKoD,QAAQ,CAACpD,EAAE,EACpC,OAAO;gBAIT,OAAO;YACR;;;;YAQOoC,KAAAA;mBAAP,SAAa/I,QAAQ,EAAEmD,OAAO;gBAC7B,IAAM6G,SAAS,IAtRXlB,eAsR8B3F;gBAClC,OAAO6G,OAAO,KAAK,CAAChK;YACrB;;;WAxRK8I;;;;;;ACfN,IAAMmB,mCAAmC;AACzC,IAAMC,2BAA2B;AACjC,IAAMC,qCAAqC;AAC3C,IAAMC,6BAA6B;AAEnC,SAAShK,kBAAcd,KAAK,EAAEM,IAAI,EAAES,YAAY,EAAEC,OAAO;IACxD,IAAIhB,AAAUiB,WAAVjB,OACH,OAAOe;IAER,IAAI,CAACG,OAAO,aAAa,CAAClB,UAAUA,QAAQ,KAAKA,QAAQgB,SACxD,MAAM,IAAIG,WAAY,GAA2CH,MAAAA,CAAzCV,MAAK,sCAA4C,OAARU;IAElE,OAAOhB;AACR;AAUO,SAAS+K,eAAe9G,UAAU,EAAEtD,OAAO;IACjD,OAAOgD,oBAAAA,QAAkB,CAACM,YAAYtD;AACvC;AAaO,SAASqK,aAAatK,QAAQ,EAAEC,OAAO,EAAEsK,qBAAqB;IACpE,IAAMpH,UAAUoH,QAAAA,wBAAAA,wBAAyB,CAAC;IAC1C,IAAMC,iBAAiBpK,kBAAc+C,QAAQ,cAAc,EAAE,kBAAkB8G,kCAAkCC;IACjH,IAAMO,kBAAkBrK,kBAAc+C,QAAQ,eAAe,EAAE,mBAAmBgH,oCAAoCC;IACtH,IAAMpB,SAASF,8BAAAA,KAAoB,CAAC9I,UAAUmD;IAC9C,IAAIW,SAAS;IACb,IAAIuE,kBAAkB;IAStB,IAAMC,YAAY,IAAIrF,oBAAUhD,SAAS;QACxC,gBAAgBkD,QAAQ,mBAAmB;QAC3C,oBAAoBA,QAAQ,kBAAkB;IAC/C;IAEA,IAAMuH,cAAc;QACnB,MAAM,SAACxB,KAAK;mBAAKA,MAAM,KAAK;;QAC5B,YAAY,SAACA,KAAK;YACjB,IAAI;gBACH,OAAOZ,UAAU,QAAQ,CAACY,MAAM,KAAK;YACtC,EAAE,OAAOvF,OAAO;gBAEf,IAAS9B,eAAL8B,OAAiByC,mBAAkBzC,MAAM,OAAO,CAAC,QAAQ,CAAC,mBAC7D,OAAO;gBAEP,MAAMA;YAER;QACD;IACD;QAEKjE,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;QAAL,QAAKA,YAAesJ,MAAM,CAANA,OAAAA,QAAAA,CAAAA,IAAftJ,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAuB;YAAvBA,IAAMwJ,QAANxJ,MAAAA,KAAAA;gBAEYiL;YAAhB,IAAMC,UAAUD,QAAAA,CAAAA,0BAAAA,WAAW,CAACzB,MAAM,IAAI,CAAC,AAAD,IAAtByB,0BAA2BD,WAAW,CAAC,OAAO;YAC9D,IAAIxB,AAAe,iBAAfA,MAAM,IAAI,EAAmB;gBAChCb;gBACA,IAAIA,kBAAkBmC,gBACrB,MAAM,IAAI/J,WAAY,oDAAkE,OAAf+J;YAE3E;YAEA,IAAMK,QAAQ1K,OAAOyK,QAAQ1B;YAC7B,IAAIpF,OAAO,MAAM,GAAG+G,MAAM,MAAM,GAAGJ,iBAClC,MAAM,IAAIhK,WAAY,iDAAgE,OAAhBgK,iBAAgB;YAEvF3G,UAAU+G;QACX;;QAfKnL,oBAAAA;QAAAA,iBAAAA;;;iBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;gBAAAA,mB,MAAAA;;;IAiBL,OAAOoE;AACR"}

package/dist/esm/Evaluator.d.mts CHANGED Viewed

@@ -11,6 +11,12 @@ export interface EvaluatorOptions {
 	 * @default 10000
 	 */
 	maxEvaluationSteps?: number;
+	/**
+	 * Maximum interpreter recursion depth (hard maximum: 2000). Bounds nested
+	 * expressions so a deeply nested input cannot exhaust the host call stack.
+	 * @default 1000
+	 */
+	maxDepth?: number;
 }
 export declare class Evaluator {
@@ -21,4 +27,8 @@ export declare class Evaluator {
 	evaluate<T = unknown>(expression: string): T;
 }
-export declare function getNodeString(node: Node): string;
+/**
+ * Renders an AST node back to a short source-like string. Returns `null` for
+ * node types that have no textual representation.
+ */
+export declare function getNodeString(node: Node): string | null;