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

ecma-evaluator 2.0.10 → 2.1.1

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/regExpSafety.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","/\n Conservative static screen for catastrophic-backtracking (\"ReDoS\") patterns.\n \n A native `RegExp` has no execution-time limit, so a pathological pattern can\n * block the event loop for an unbounded time on a tiny input (e.g.\n * `/^(a+)+$/.test(\"aaaa…!\")`). This module flags three structural shapes:\n \n 1. An unbounded quantifier over a sub-expression that itself contains an\n * unbounded quantifier, e.g. `(a+)+`, `(\\d+)`, `(ab+)+` — exponential.\n * 2. An unbounded quantifier over an alternation whose branches can match the\n * same first character, e.g. `(a\|ab)+`, `(a\|.)+`, `([ab]\|a)+` —\n * exponential. Overlap is detected both textually (one branch is a prefix\n * of another) and through an approximate first-character set.\n * 3. Adjacent unbounded quantifiers over overlapping characters, e.g.\n * `..x`, `aab`, `(a)(a)b` — polynomial (quadratic).\n \n This is a heuristic screen, not a proof: it is intentionally conservative\n * (it may reject some safe patterns such as `(a\|ab)+`) and it does not catch\n * every ReDoS shape. It removes the demonstrated exploit classes but must not\n * be treated as a guarantee. Callers that need a hard bound should not evaluate\n * untrusted patterns at all.\n \n @param {string} pattern - A regular-expression source (without slashes).\n * @returns {boolean} `true` when the pattern is potentially catastrophic.\n /\nexport function isUnsafeRegExpPattern(pattern) {\n let pos = 0;\n let depth = 0;\n const MAX_DEPTH = 1000;\n\n function parseAlternation() {\n const start = pos;\n const branches = [parseSequence()];\n while (pattern[pos] === \"\|\") {\n pos++;\n branches.push(parseSequence());\n }\n if (branches.length === 1) {\n return branches[0];\n }\n return { type: \"alt\", branches, start, end: pos };\n }\n\n function parseSequence() {\n const start = pos;\n const terms = [];\n while (pos < pattern.length && pattern[pos] !== \"\|\" && pattern[pos] !== \")\") {\n terms.push(parseTerm());\n }\n return { type: \"seq\", terms, start, end: pos };\n }\n\n function parseTerm() {\n const atom = parseAtom();\n const quantifier = parseQuantifier();\n if (quantifier) {\n return { type: \"quant\", min: quantifier.min, max: quantifier.max, body: atom, start: atom.start, end: pos };\n }\n return atom;\n }\n\n function parseQuantifier() {\n const ch = pattern[pos];\n if (ch === \"\") {\n pos++;\n return { min: 0, max: Infinity };\n }\n if (ch === \"+\") {\n pos++;\n return { min: 1, max: Infinity };\n }\n if (ch === \"?\") {\n pos++;\n return { min: 0, max: 1 };\n }\n if (ch === \"{\") {\n const match = /^\\{(\\d+)(,(\\d))?\\}/.exec(pattern.slice(pos));\n if (match) {\n pos += match[0].length;\n const min = Number(match[1]);\n let max;\n if (match[2] === undefined) {\n max = min;\n } else {\n max = match[3] === \"\" ? Infinity : Number(match[3]);\n }\n return { min, max };\n }\n }\n return null;\n }\n\n function parseAtom() {\n const start = pos;\n const ch = pattern[pos];\n\n if (ch === \"(\") {\n pos++;\n let zeroWidth = false;\n if (pattern[pos] === \"?\") {\n const rest = pattern.slice(pos);\n if (rest.startsWith(\"?:\")) {\n pos += 2;\n } else if (rest.startsWith(\"?=\") \|\| rest.startsWith(\"?!\")) {\n pos += 2;\n zeroWidth = true;\n } else if (rest.startsWith(\"?<=\") \|\| rest.startsWith(\"?<!\")) {\n pos += 3;\n zeroWidth = true;\n } else if (rest.startsWith(\"?<\")) {\n const named = /^\\?<[A-Za-z_$][\\w$]>/.exec(rest);\n pos += named ? named[0].length : 2;\n } else {\n pos += 1;\n }\n }\n depth++;\n if (depth > MAX_DEPTH) {\n throw new RangeError(\"regexp nesting too deep\");\n }\n const body = parseAlternation();\n depth--;\n if (pattern[pos] === \")\") {\n pos++;\n }\n return { type: \"group\", body, zeroWidth, start, end: pos };\n }\n\n if (ch === \"[\") {\n pos++;\n if (pattern[pos] === \"^\") {\n pos++;\n }\n if (pattern[pos] === \"]\") {\n pos++;\n }\n while (pos < pattern.length && pattern[pos] !== \"]\") {\n if (pattern[pos] === \"\\\\\") {\n pos++;\n }\n pos++;\n }\n pos++;\n return { type: \"char\", zeroWidth: false, start, end: pos };\n }\n\n if (ch === \"\\\\\") {\n pos += 2;\n const escaped = pattern[start + 1];\n return { type: \"char\", zeroWidth: escaped === \"b\" \|\| escaped === \"B\", start, end: pos };\n }\n\n pos++;\n return { type: \"char\", zeroWidth: ch === \"^\" \|\| ch === \"$\", start, end: pos };\n }\n\n const raw = (node) => pattern.slice(node.start, node.end);\n\n /*\n Approximate set of characters a node can start with, as a `Set<string>`\n * or the sentinel `ANY` when it cannot be bounded (a negated class, a\n * wildcard, a backreference, an unbounded quantifier, …). It is only used\n * to decide whether two branches/terms might consume the same\n * character, so over-approximation is safe: a false \"may overlap\" only\n * rejects a pattern that is already suspicious. A precise set is worth\n * the effort though — treating `\\s` and `\\w` as `ANY` would wrongly flag\n * the ubiquitous `\\s\\w+` as a polynomial risk.\n /\n const ANY = Symbol(\"any\");\n const DIGITS = new Set(\"0123456789\".split(\"\"));\n const WORD = new Set(\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_\".split(\"\"));\n const SPACES = new Set([\" \", \"\\t\", \"\\n\", \"\\r\", \"\\f\", \"\\v\", \"\\u00a0\", \"\\ufeff\", \"\\u2028\", \"\\u2029\"]);\n\n /** Expands a single (already unescaped) class escape such as `d`, `w`, `s`. /\n function escapeSet(esc) {\n switch (esc) {\n case \"d\":\n return DIGITS;\n case \"w\":\n return WORD;\n case \"s\":\n return SPACES;\n case \"n\":\n return new Set([\"\\n\"]);\n case \"t\":\n return new Set([\"\\t\"]);\n case \"r\":\n return new Set([\"\\r\"]);\n case \"f\":\n return new Set([\"\\f\"]);\n case \"v\":\n return new Set([\"\\v\"]);\n case \"0\":\n return new Set([\"\\0\"]);\n default:\n // A backreference (`\\1`) or a negated class (`\\D`, `\\W`,\n // `\\S`) cannot be enumerated; treat it as unbounded.\n if (/[0-9A-Za-z]/.test(esc)) {\n return ANY;\n }\n // Escaped punctuation (`\\.`, `\\+`, `\\`, …) is the\n // literal character itself.\n return new Set([esc]);\n }\n }\n\n /** Parses a `[...]` character class into a concrete set, or `ANY` when negated/opaque. /\n function classSet(text) {\n // text is the raw slice including the surrounding brackets.\n const inner = text.slice(1, -1);\n if (inner.startsWith(\"^\")) {\n return ANY;\n }\n const set = new Set();\n for (let i = 0; i < inner.length; i++) {\n let ch = inner[i];\n if (ch === \"\\\\\") {\n const esc = inner[++i];\n const expanded = escapeSet(esc);\n if (expanded === ANY) {\n return ANY;\n }\n for (const c of expanded) set.add(c);\n continue;\n }\n // Range: `a-z`.\n if (inner[i + 1] === \"-\" && inner[i + 2] !== undefined && inner[i + 2] !== \"]\") {\n const end = inner[i + 2];\n const startCode = ch.codePointAt(0);\n const endCode = end.codePointAt(0);\n // Cap the expansion so a huge range cannot blow up memory.\n if (endCode - startCode > 1024) {\n return ANY;\n }\n for (let code = startCode; code <= endCode; code++) {\n set.add(String.fromCodePoint(code));\n }\n i += 2;\n continue;\n }\n set.add(ch);\n }\n return set;\n }\n\n function firstCharSet(node) {\n switch (node.type) {\n case \"char\": {\n const text = raw(node);\n if (node.zeroWidth \|\| text.startsWith(\"^\") \|\| text.startsWith(\"$\")) {\n return new Set();\n }\n if (text === \".\") {\n return ANY;\n }\n if (text.startsWith(\"[\")) {\n return classSet(text);\n }\n if (text.startsWith(\"\\\\\")) {\n const esc = text.slice(1);\n if (esc.length === 1) {\n return escapeSet(esc);\n }\n // \\p{..}, \\k<..>, \\1 backrefs, etc. are opaque.\n return ANY;\n }\n return new Set([text[0]]);\n }\n case \"quant\":\n return node.min === 0 ? ANY : firstCharSet(node.body);\n case \"group\":\n return node.zeroWidth ? ANY : firstCharSet(node.body);\n case \"alt\": {\n const union = new Set();\n for (const branch of node.branches) {\n const set = firstCharSet(branch);\n if (set === ANY) return ANY;\n for (const ch of set) union.add(ch);\n }\n return union;\n }\n case \"seq\":\n for (const term of node.terms) {\n const set = firstCharSet(term);\n if (set === ANY) return ANY;\n if (set.size > 0) return set;\n }\n return new Set();\n default:\n return ANY;\n }\n }\n\n /* `true` when the two sets share at least one start character (or either is `ANY`). /\n function setsIntersect(a, b) {\n if (a === ANY \|\| b === ANY) return true;\n if (a.size === 0 \|\| b.size === 0) return false;\n const [small, large] = a.size <= b.size ? [a, b] : [b, a];\n for (const ch of small) {\n if (large.has(ch)) return true;\n }\n return false;\n }\n\n /\n The set of characters a quantifier can consume. Unlike\n * {@link firstCharSet}, this never returns `ANY` merely because the\n * quantifier may match the empty string: `\\s` consumes only whitespace,\n so it does not overlap `\\w+`.\n /\n function consumableCharSet(quantNode) {\n return firstCharSet(quantNode.body);\n }\n\n /\n Adjacent unbounded quantifiers whose consumed character sets overlap\n * (`aab`, `..x`) backtrack polynomially — quadratic on a\n * non-matching input. This is a different shape from the\n * nested-quantifier case: neither quantifier is inside the other. Two\n * ``/`+` terms over disjoint characters (`ab`, `\\s\\w+`) are safe and\n * must not be flagged.\n \n The quantifiers need not be literal siblings: `(a)(a)b` is the same\n * hazard with each quantifier wrapped in its own group, so the boundary\n * between two terms is compared through their trailing and leading\n * quantifiers respectively.\n /\n function trailingQuantifier(node) {\n switch (node.type) {\n case \"quant\":\n return node.max === Infinity ? node : null;\n case \"group\":\n return node.zeroWidth ? null : trailingQuantifier(node.body);\n case \"seq\": {\n for (let i = node.terms.length - 1; i >= 0; i--) {\n const quantifier = trailingQuantifier(node.terms[i]);\n if (quantifier) return quantifier;\n const set = firstCharSet(node.terms[i]);\n if (set === ANY \|\| set.size > 0) return null;\n }\n return null;\n }\n default:\n return null;\n }\n }\n\n function leadingQuantifier(node) {\n switch (node.type) {\n case \"quant\":\n return node.max === Infinity ? node : null;\n case \"group\":\n return node.zeroWidth ? null : leadingQuantifier(node.body);\n case \"seq\": {\n for (const term of node.terms) {\n const quantifier = leadingQuantifier(term);\n if (quantifier) return quantifier;\n const set = firstCharSet(term);\n if (set === ANY \|\| set.size > 0) return null;\n }\n return null;\n }\n default:\n return null;\n }\n }\n\n function hasAdjacentOverlappingQuantifiers(seqNode) {\n const terms = seqNode.terms;\n for (let i = 0; i + 1 < terms.length; i++) {\n const left = trailingQuantifier(terms[i]);\n const right = leadingQuantifier(terms[i + 1]);\n if (left && right && setsIntersect(consumableCharSet(left), consumableCharSet(right))) {\n return true;\n }\n }\n return false;\n }\n\n function containsUnboundedQuantifier(node) {\n switch (node.type) {\n case \"quant\":\n if (node.max === Infinity) {\n return true;\n }\n return containsUnboundedQuantifier(node.body);\n case \"group\":\n return containsUnboundedQuantifier(node.body);\n case \"alt\":\n return node.branches.some(containsUnboundedQuantifier);\n case \"seq\":\n return node.terms.some(containsUnboundedQuantifier);\n default:\n return false;\n }\n }\n\n function alternationOverlaps(node) {\n if (node.type !== \"alt\") {\n return false;\n }\n // A branch that can match the empty string makes every branch\n // ambiguous with it. Otherwise, one branch is a prefix of another\n // exactly when the two are adjacent after a lexicographic sort, so\n // this stays O(branches log branches) instead of quadratic.\n const texts = node.branches.map(raw).sort();\n for (let i = 0; i + 1 < texts.length; i++) {\n if (texts[i] === \"\" \|\| texts[i + 1].startsWith(texts[i])) {\n return true;\n }\n }\n // Textual prefixes miss branches that overlap through a character\n // class or a different literal that starts the same way, e.g.\n // `(a\|.)`, `([ab]\|a)`, `(\\w\|a)`. Those are catastrophic under an\n // unbounded quantifier exactly like `(a\|ab)` is, so also compare\n // the (over-approximated) set of first characters each branch can\n // consume. This is a superset of the prefix case.\n const sets = node.branches.map(firstCharSet);\n for (let i = 0; i < sets.length; i++) {\n for (let j = i + 1; j < sets.length; j++) {\n if (setsIntersect(sets[i], sets[j])) {\n return true;\n }\n }\n }\n return false;\n }\n\n function isCatastrophic(node) {\n switch (node.type) {\n case \"quant\": {\n if (node.max === Infinity) {\n const inner = node.body.type === \"group\" ? node.body.body : node.body;\n if (containsUnboundedQuantifier(inner)) {\n return true;\n }\n if (inner.type === \"alt\" && alternationOverlaps(inner)) {\n return true;\n }\n }\n return isCatastrophic(node.body);\n }\n case \"group\":\n return isCatastrophic(node.body);\n case \"alt\":\n return node.branches.some(isCatastrophic);\n case \"seq\":\n return hasAdjacentOverlappingQuantifiers(node) \|\| node.terms.some(isCatastrophic);\n default:\n return false;\n }\n }\n\n try {\n return isCatastrophic(parseAlternation());\n } catch {\n // The pattern is already validated by the host RegExp constructor, so a\n // parse failure means this analyzer is incomplete, not that the input is\n // invalid. Fail open (do not reject) to avoid breaking valid patterns.\n return false;\n }\n}\n","import * as acorn from \"acorn\";\nimport globals from \"globals\";\nimport { blockedGlobalBuiltIns, blockedMethods } from \"./block.js\";\nimport { isUnsafeRegExpPattern } from \"./regExpSafety.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 /\n/\n The `RegExp.prototype` methods that execute the receiver's own pattern when\n * reached through a `Symbol.` key (`re[Symbol.match](s)` and friends). They are\n distinct function objects from `test`/`exec`, so the invocation screen must\n * name them explicitly.\n /\nconst REGEXP_SYMBOL_METHODS = new Set(\n\t[Symbol.match, Symbol.matchAll, Symbol.replace, Symbol.search, Symbol.split]\n\t\t.map((symbol) => RegExp.prototype[symbol])\n\t\t.filter((method) => typeof method === \"function\"),\n);\n\n/\n Maps the native methods whose invocation can execute an unscreened pattern to\n * how the pattern is reached, so {@link assertSafeRegExpInvocation} can bail out\n * with a single lookup for every other call.\n /\nconst REGEXP_INVOCATION_KIND = (() => {\n\tconst map = new Map();\n\tfor (const method of [String.prototype.match, String.prototype.matchAll, String.prototype.search]) {\n\t\tmap.set(method, \"stringPattern\");\n\t}\n\tfor (const method of [RegExp.prototype.test, RegExp.prototype.exec, ...REGEXP_SYMBOL_METHODS]) {\n\t\tmap.set(method, \"receiverPattern\");\n\t}\n\tfor (const method of [String.prototype.replace, String.prototype.replaceAll, String.prototype.split]) {\n\t\tmap.set(method, \"regexArgument\");\n\t}\n\treturn map;\n})();\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\n/\n Bounded memo of patterns already proven safe. A regex literal is screened on\n * every evaluation of its node and the analysis costs ~150-400ns, a measurable\n * share of a short regex expression. Only safe patterns are cached; an unsafe\n * one throws on first sight, so it never reaches the cache. Eviction is FIFO,\n * mirroring {@link PARSE_CACHE}.\n /\nconst SAFE_REGEXP_PATTERNS = new Set();\nconst MAX_SAFE_REGEXP_PATTERNS = 1000;\n\n/\n Rejects a pattern that is structurally prone to catastrophic backtracking.\n * There is no execution-time limit on a native RegExp, so this screen is the\n * only thing standing between an untrusted pattern and an event-loop hang.\n * @param {string} pattern\n /\nfunction assertSafeRegExpPattern(pattern) {\n\tif (typeof pattern !== \"string\" \|\| SAFE_REGEXP_PATTERNS.has(pattern)) {\n\t\treturn;\n\t}\n\tif (isUnsafeRegExpPattern(pattern)) {\n\t\tthrow new RangeError(\"RegExp pattern may cause catastrophic backtracking and is not allowed\");\n\t}\n\tif (SAFE_REGEXP_PATTERNS.size >= MAX_SAFE_REGEXP_PATTERNS) {\n\t\tSAFE_REGEXP_PATTERNS.delete(SAFE_REGEXP_PATTERNS.values().next().value);\n\t}\n\tSAFE_REGEXP_PATTERNS.add(pattern);\n}\n\n/\n Screens a regex that reaches a native method by a path the construction-time\n * screen does not cover:\n \n - a `RegExp` supplied by the host in the evaluation context (it is cloned in\n * verbatim and never passed through {@link assertSafeRegExpPattern});\n * - a string argument to `String.prototype.match`/`matchAll`/`search`, which\n * the host compiles with `new RegExp(...)` internally, so a pattern like\n * `\"(a+)+b\"` is never seen by the literal / `RegExp()` screen.\n \n `replace`/`replaceAll`/`split` treat a string argument as a literal, so only\n * a `RegExp` argument can execute as a pattern there.\n * @param {Function} func - The resolved callee.\n * @param {} target - The call receiver.\n @param {Array<>} args - The evaluated arguments.\n /\nfunction assertSafeRegExpInvocation(func, target, args) {\n\t// One Set lookup keeps this off the hot path for ordinary calls.\n\tconst kind = REGEXP_INVOCATION_KIND.get(func);\n\tif (kind === undefined) {\n\t\treturn;\n\t}\n\tif (kind === \"stringPattern\") {\n\t\t// match/matchAll/search compile a string argument into a RegExp\n\t\t// internally, so the pattern never passes the construction-time screen.\n\t\tconst pattern = args[0];\n\t\tif (typeof pattern === \"string\") {\n\t\t\tassertSafeRegExpPattern(pattern);\n\t\t} else if (pattern instanceof RegExp) {\n\t\t\tassertSafeRegExpPattern(pattern.source);\n\t\t}\n\t\treturn;\n\t}\n\t// \"receiverPattern\": test/exec and the `RegExp.prototype[Symbol.]` methods all\n\t// run the receiver's own pattern, which may be a context-supplied RegExp.\n\t// \"regexArgument\": replace/replaceAll/split run a RegExp argument; a string\n\t// argument there is a literal, so it cannot execute as a pattern.\n\tconst regexp = kind === \"receiverPattern\" ? target : args[0];\n\tif (regexp instanceof RegExp) {\n\t\tassertSafeRegExpPattern(regexp.source);\n\t}\n}\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\n/\n Counts the matches a `replace`/`replaceAll` call would make, so the output\n * size can be bounded before the native engine builds the whole result. The\n * pattern has already passed {@link assertSafeRegExpPattern}, so the per-match\n * work is bounded; the only hazard here is a zero-width match, where `exec`\n * leaves `lastIndex` unchanged and the loop would never terminate. Advancing\n * `lastIndex` manually mirrors `String.prototype.replace`'s own empty-match\n * handling. The count is capped so a pathological target cannot spin the loop.\n /\nfunction countRegExpMatches(value, regexp, all) {\n\tconst flags = regexp.flags.includes(\"g\") ? regexp.flags : regexp.flags + \"g\";\n\tconst re = new RegExp(regexp.source, flags);\n\tlet count = 0;\n\tlet match;\n\twhile ((match = re.exec(value)) !== null) {\n\t\tcount++;\n\t\tif (!all \|\| count > MAX_STRING_LENGTH) {\n\t\t\tbreak;\n\t\t}\n\t\tif (re.lastIndex === match.index) {\n\t\t\tre.lastIndex++;\n\t\t}\n\t}\n\treturn count;\n}\n\n/\n Bounded, module-level cache of parsed ASTs. Expressions are frequently\n * evaluated many times (templates, repeated rules), and acorn parsing dominates\n * the runtime of a short expression - re-parsing on every call is the single\n * biggest cost in the hot path. The AST is treated as immutable after parsing\n * (no handler mutates a node), so a cached tree can be shared safely across\n * evaluations and instances.\n \n The cache is bounded by both entry count and total source length so a stream\n * of distinct large inputs cannot grow it without limit. Eviction is FIFO\n * (oldest-inserted first): a hit must not touch the Map, because a read-modify\n * \"refresh\" on every hit costs ~60ns versus ~8ns for a plain `get`.\n /\nconst PARSE_CACHE = new Map();\nconst MAX_PARSE_CACHE_ENTRIES = 1000;\nconst MAX_PARSE_CACHE_CHARS = 200000;\nlet parseCacheChars = 0;\n\nfunction parseExpression(expression) {\n\tconst cached = PARSE_CACHE.get(expression);\n\tif (cached !== undefined) {\n\t\treturn cached;\n\t}\n\n\tlet ast;\n\ttry {\n\t\tast = acorn.parse(expression, { ecmaVersion: \"latest\" });\n\t} catch (error) {\n\t\t// acorn parses recursively; a deeply nested expression can exhaust the\n\t\t// host call stack before evaluation ever starts. Surface it as a\n\t\t// normal SyntaxError instead of leaking a stack-overflow RangeError.\n\t\tif (error instanceof RangeError && /call stack/i.test(error.message)) {\n\t\t\tthrow new SyntaxError(\"Expression nesting is too deep to parse\");\n\t\t}\n\t\tthrow error;\n\t}\n\n\tif (expression.length <= MAX_PARSE_CACHE_CHARS) {\n\t\twhile (PARSE_CACHE.size >= MAX_PARSE_CACHE_ENTRIES \|\| parseCacheChars + expression.length > MAX_PARSE_CACHE_CHARS) {\n\t\t\tconst oldestKey = PARSE_CACHE.keys().next().value;\n\t\t\tif (oldestKey === undefined) break;\n\t\t\tparseCacheChars -= oldestKey.length;\n\t\t\tPARSE_CACHE.delete(oldestKey);\n\t\t}\n\t\tPARSE_CACHE.set(expression, ast);\n\t\tparseCacheChars += expression.length;\n\t}\n\n\treturn ast;\n}\n\nfunction assertBoundedData(value, label) {\n\t// Fast path: a primitive has no properties, cycles, or references to walk,\n\t// so the traversal (and its `pending` array + `WeakSet` allocations) is pure\n\t// overhead. This is the common case for arrow-function return values such as\n\t// `arr.map(v => v 2)`, where the callback returns a primitive per element.\n\t// The accounting mirrors the slow path exactly (a string costs length + 8 and\n\t// is length-bounded; every other primitive costs 8), so the budget behaves\n\t// identically whether or not the fast path is taken.\n\tconst valueType = typeof value;\n\tif (valueType === \"string\") {\n\t\tif (value.length > MAX_STRING_LENGTH) {\n\t\t\tthrow new RangeError(`${label} contains a string that exceeds the maximum length`);\n\t\t}\n\t\treturn { dataSize: value.length + 8, dataNodes: 1 };\n\t}\n\tif (value === null \|\| valueType === \"undefined\" \|\| valueType === \"number\" \|\| valueType === \"boolean\" \|\| valueType === \"bigint\") {\n\t\treturn { dataSize: 8, dataNodes: 1 };\n\t}\n\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 = new 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\t[\"in\", (a, b) => a in b],\n\t[\"instanceof\", (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). Construction\n// is deferred to first use and memoised so that importing the module has no\n// side effect at all - `sideEffects: false` in package.json then holds exactly,\n// and a bundler may drop the whole module when nothing from it is used.\nlet GLOBAL_SCOPE = null;\n\nfunction getGlobalScope() {\n\tif (GLOBAL_SCOPE === null) {\n\t\tGLOBAL_SCOPE = createGlobalScope();\n\t}\n\treturn GLOBAL_SCOPE;\n}\n\n/\n Shared default evaluation context. It is frozen and has a null prototype, and\n * the evaluator never writes to a context scope (arrow-function parameter scopes\n * are separate objects), so every instance can safely share this single object.\n * Without it, the default `variables = Object.create(null)` parameter would make\n * each construction `structuredClone` a fresh empty object - the dominant cost of\n * the one-shot `evalExpression` / `Evaluator.evaluate` path.\n /\nconst EMPTY_CONTEXT = Object.freeze(Object.create(null));\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 * @param {number} [options.maxDepth=1000] - Maximum interpreter recursion depth (hard maximum: 2000)\n\t /\n\tconstructor(variables = EMPTY_CONTEXT, 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\t// The shared default context is known to be empty and immutable, so it needs\n\t\t// neither the bounded-data walk nor a clone. Caller-supplied contexts are\n\t\t// validated and cloned so the sandbox never holds a live reference to host state.\n\t\tlet clonedVariables = EMPTY_CONTEXT;\n\t\tif (variables !== EMPTY_CONTEXT) {\n\t\t\tassertBoundedData(variables, \"Evaluation context\");\n\t\t\tclonedVariables = structuredClone(variables);\n\t\t}\n\t\tthis.scopes = [clonedVariables, getGlobalScope()].filter((scope) => scope !== null && scope !== undefined);\n\t\tthis.source = undefined;\n\t\tthis.evaluating = false;\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 Resets the per-evaluation resource budgets. Called at the start of every\n\t * `evaluate()` and, for a direct `execute()` call, at its entry. Centralised\n\t * so a thrown limit never leaves a stale counter behind.\n\t * @private\n\t /\n\tresetBudget() {\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\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.resetBudget();\n\n\t\tconst ast = parseExpression(expression);\n\n\t\t// Start recursive evaluation from the root node\n\t\tthis.evaluating = true;\n\t\ttry {\n\t\t\treturn this.execute(ast.body);\n\t\t} finally {\n\t\t\tthis.evaluating = false;\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\t// `evaluate()` resets the budget before calling in. A direct call to this\n\t\t// method (a documented escape hatch used by tests) has no such reset, so\n\t\t// initialise on entry. Keying on `evaluating` rather than on a counter value\n\t\t// avoids the previous bug where a thrown step limit left\n\t\t// `remainingEvaluationSteps` at -1 and defeated the `=== 0` guard.\n\t\tif (!this.evaluating) {\n\t\t\tthis.resetBudget();\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// Fast path: a primitive needs no clone. structuredClone costs ~300ns\n\t\t// even for a number, which dominates short expressions, while a primitive\n\t\t// is already an immutable value with no sandbox reference to leak.\n\t\t// Symbols are deliberately excluded so they still hit the clone gate\n\t\t// below and raise the non-cloneable error.\n\t\tconst resultType = typeof result;\n\t\tif (result === null \|\| resultType === \"string\" \|\| resultType === \"number\" \|\| resultType === \"boolean\" \|\| resultType === \"undefined\" \|\| resultType === \"bigint\") {\n\t\t\treturn result;\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\tswitch (node.type) {\n\t\t\t\tcase \"ExpressionStatement\": {\n\t\t\t\t\treturn this.visit(node.expression);\n\t\t\t\t}\n\t\t\t\tcase \"BinaryExpression\": {\n\t\t\t\t\treturn this.handleBinaryExpression(node);\n\t\t\t\t}\n\t\t\t\tcase \"LogicalExpression\": {\n\t\t\t\t\treturn this.handleLogicalExpression(node);\n\t\t\t\t}\n\t\t\t\tcase \"UnaryExpression\": {\n\t\t\t\t\treturn this.handleUnaryExpression(node);\n\t\t\t\t}\n\t\t\t\tcase \"Identifier\": {\n\t\t\t\t\treturn this.handleIdentifier(node);\n\t\t\t\t}\n\t\t\t\tcase \"Literal\": {\n\t\t\t\t\t// A regex literal is parsed by acorn into `node.regex`, but\n\t\t\t\t\t// `node.value` is a live RegExp that the sandbox would otherwise\n\t\t\t\t\t// hand back. Screen the pattern before it can be used.\n\t\t\t\t\tif (node.regex) {\n\t\t\t\t\t\tassertSafeRegExpPattern(node.regex.pattern);\n\t\t\t\t\t}\n\t\t\t\t\treturn node.value;\n\t\t\t\t}\n\t\t\t\tcase \"MemberExpression\": {\n\t\t\t\t\treturn this.handleMemberExpression(node);\n\t\t\t\t}\n\t\t\t\tcase \"ArrayExpression\": {\n\t\t\t\t\treturn this.handleArrayExpression(node);\n\t\t\t\t}\n\t\t\t\tcase \"SpreadElement\": {\n\t\t\t\t\treturn this.handleSpreadElement(node);\n\t\t\t\t}\n\t\t\t\tcase \"ObjectExpression\": {\n\t\t\t\t\treturn this.handleObjectExpression(node);\n\t\t\t\t}\n\t\t\t\tcase \"FunctionExpression\": {\n\t\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Function expression\"]));\n\t\t\t\t}\n\t\t\t\tcase \"ArrowFunctionExpression\": {\n\t\t\t\t\treturn this.handleArrowFunctionExpression(node);\n\t\t\t\t}\n\t\t\t\tcase \"CallExpression\": {\n\t\t\t\t\treturn this.handleCallExpression(node);\n\t\t\t\t}\n\t\t\t\tcase \"ConditionalExpression\": {\n\t\t\t\t\treturn this.visit(node.test) ? this.visit(node.consequent) : this.visit(node.alternate);\n\t\t\t\t}\n\t\t\t\tcase \"NewExpression\": {\n\t\t\t\t\tif (node.callee.type !== \"Identifier\") {\n\t\t\t\t\t\tthrow new Error(`Unsupported callee type '${node.callee.type}' in new expression`);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (node.callee.name === \"Function\") {\n\t\t\t\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"new Function() constructor\"]));\n\t\t\t\t\t}\n\n\t\t\t\t\t// Promise is fully removed from the sandbox; give a clear error\n\t\t\t\t\t// instead of a generic \"not defined\". Its executor runs\n\t\t\t\t\t// synchronously, but a throwing executor would turn into a\n\t\t\t\t\t// rejected Promise that escapes evaluate() and crashes the host.\n\t\t\t\t\tif (node.callee.name === \"Promise\") {\n\t\t\t\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Promise constructor\"]));\n\t\t\t\t\t}\n\t\t\t\t\tconst Constructor = this.visit(node.callee);\n\n\t\t\t\t\t// 仅在存在参数时构建数组\n\t\t\t\t\tconst args = node.arguments.length ? node.arguments.map((arg) => this.visit(arg)) : [];\n\t\t\t\t\tthis.assertBoundedConstruction(Constructor, args);\n\n\t\t\t\t\treturn new Constructor(...args);\n\t\t\t\t}\n\t\t\t\tcase \"ChainExpression\": {\n\t\t\t\t\treturn this.visit(node.expression);\n\t\t\t\t}\n\t\t\t\tcase \"TemplateLiteral\": {\n\t\t\t\t\treturn this.handleTemplateLiteral(node);\n\t\t\t\t}\n\t\t\t\tcase \"ThisExpression\": {\n\t\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"'this' expression\"]));\n\t\t\t\t}\n\t\t\t\tcase \"WithStatement\": {\n\t\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"'with' statement\"]));\n\t\t\t\t}\n\t\t\t\tdefault: {\n\t\t\t\t\tlet content = this.source.slice(node.start, node.end);\n\n\t\t\t\t\tif (content.length > 20) {\n\t\t\t\t\t\tcontent = content.slice(0, 17) + \"...\";\n\t\t\t\t\t}\n\n\t\t\t\t\tthrow new SyntaxError(`'${content}'` + \" \" + renderErrorMessage(ERROR_MESSAGES.IS_INVALID_SYNTAX, [content]));\n\t\t\t\t}\n\t\t\t}\n\t\t} finally {\n\t\t\tthis.evaluationDepth--;\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\tconst apply = BINARY_OPERATION_MAP.get(op);\n\t\tif (apply !== undefined) {\n\t\t\treturn apply(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 * and a pattern with catastrophic-backtracking structure is refused, rather\n\t * 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\tassertSafeRegExpPattern(args[0]);\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\t// Indexed loop: `for...of` allocates an iterator per lookup, and identifier\n\t\t// resolution is the most frequent visitor call.\n\t\tconst scopes = this.scopes;\n\t\tfor (let i = 0; i < scopes.length; i++) {\n\t\t\tconst scope = scopes[i];\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\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\t// Read the property once: the guards below all consume the same value, and a\n\t\t// getter must not run (or run twice) just to be checked. Doing this after the\n\t\t// null check also avoids touching `__proto__` on a null/undefined receiver.\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\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\tconst prototype = object.__proto__;\n\t\tif (prototype !== undefined && result === prototype) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Accessing prototype properties\"]));\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[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\t// Only simple identifier parameters are supported. A destructuring,\n\t\t// default (`a = 1`) or rest (`...a`) parameter is not an Identifier, so\n\t\t// `param.name` would be `undefined` and the binding would be written to a\n\t\t// property literally named \"undefined\" — silently mis-binding the argument\n\t\t// and shadowing the `undefined` global inside the body. Reject such a\n\t\t// signature up front instead of evaluating it incorrectly.\n\t\tfor (const param of node.params) {\n\t\t\tif (param.type !== \"Identifier\") {\n\t\t\t\tthrow new SyntaxError(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Destructuring, default, and rest parameters\"]));\n\t\t\t}\n\t\t}\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. The `typeof` guard matters: on\n\t\t// runtimes that leave `Error.prepareStackTrace` undefined (Node 18, 24),\n\t\t// a bare identity test also matches a non-function callee (`undefined`),\n\t\t// which would mask the real \"is not a function\" error.\n\t\tif (typeof func === \"function\" && func === Error.prepareStackTrace) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [\"Error.prepareStackTrace\"]));\n\t\t}\n\n\t\tconst blockedPath = getBlockedMethods().get(func);\n\t\tif (blockedPath !== undefined) {\n\t\t\tthrow new Error(renderErrorMessage(ERROR_MESSAGES.IS_NOT_ALLOWED, [blockedPath]));\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[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\tconst all = func === String.prototype.replaceAll;\n\t\t\t\tconst search = args[0];\n\t\t\t\tconst replacement = args[1];\n\t\t\t\tif (typeof replacement === \"function\") {\n\t\t\t\t\tthrow new Error(\"Only literal string replacements are allowed\");\n\t\t\t\t}\n\t\t\t\t// `$&`, `` $` ``, `$'` and `$$` expand against the matched text, so a\n\t\t\t\t// tiny pattern can be amplified into an arbitrarily large result. This\n\t\t\t\t// must be rejected for string and RegExp patterns: the native engine\n\t\t\t\t// builds the whole expanded string before any post-hoc length check, so\n\t\t\t\t// a check that only covered string patterns left a memory-exhaustion\n\t\t\t\t// hole (`\"a\".repeat(1e5).replace(/a/g, \"$&\".repeat(1000))`).\n\t\t\t\tif (typeof replacement === \"string\" && /\\$(?:[$&'`])/u.test(replacement)) {\n\t\t\t\t\tthrow new Error(\"Only literal string replacements are allowed\");\n\t\t\t\t}\n\t\t\t\tlet matchCount;\n\t\t\t\tif (typeof search === \"string\") {\n\t\t\t\t\tif (target.length * Math.max(1, search.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\tmatchCount = countLiteralMatches(target, search, all);\n\t\t\t\t} else if (search instanceof RegExp) {\n\t\t\t\t\t// `replace` with a global pattern also replaces every match, so it\n\t\t\t\t\t// needs the full count just like `replaceAll` - otherwise a large\n\t\t\t\t\t// replacement string is under-counted and the native engine allocates\n\t\t\t\t\t// the whole expanded result before the boundary check.\n\t\t\t\t\tmatchCount = countRegExpMatches(target, search, all \|\| search.flags.includes(\"g\"));\n\t\t\t\t} else {\n\t\t\t\t\tmatchCount = 0;\n\t\t\t\t}\n\t\t\t\tif (target.length + matchCount * String(replacement).length > 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 (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\t// A RegExp separator splits on every match, so it must be bounded the\n\t\t\t\t// same way as a string separator; otherwise `split(/a/)` on a large\n\t\t\t\t// string builds an array far past the configured entry limit.\n\t\t\t\tif (args[0] instanceof RegExp && countRegExpMatches(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\t// A regex can reach a native method without passing the construction-time\n\t\t// screen: a host-supplied `RegExp` in the context, or a string argument to\n\t\t// `match`/`matchAll`/`search` (which the host compiles internally). Screen\n\t\t// it here, right before the call.\n\t\tassertSafeRegExpInvocation(func, target, args);\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","isUnsafeRegExpPattern","pattern","pos","depth","MAX_DEPTH","parseAlternation","start","branches","parseSequence","terms","parseTerm","atom","parseAtom","quantifier","parseQuantifier","ch","Infinity","match","min","Number","max","undefined","zeroWidth","rest","named","RangeError","body","escaped","raw","node","ANY","DIGITS","Set","WORD","SPACES","escapeSet","esc","classSet","text","inner","set","i","expanded","_iteratorError","c","end","startCode","endCode","code","String","firstCharSet","union","branch","_iteratorError1","_iteratorError2","term","set1","setsIntersect","a","b","_ref","small","large","consumableCharSet","quantNode","trailingQuantifier","leadingQuantifier","hasAdjacentOverlappingQuantifiers","seqNode","left","right","containsUnboundedQuantifier","alternationOverlaps","texts","sets","i1","j","isCatastrophic","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","TYPED_ARRAY_CONSTRUCTORS","Int8Array","Uint8Array","Uint8ClampedArray","Int16Array","Uint16Array","Int32Array","Uint32Array","Float16Array","Float32Array","Float64Array","BigInt64Array","BigUint64Array","constructor","isTypedArrayConstructor","value","TYPED_ARRAY_MUTATORS","map","Map","_iter","name","method","REGEXP_SYMBOL_METHODS","symbol","RegExp","REGEXP_INVOCATION_KIND","method1","_iter1","method2","NO_OBJECT","renderErrorMessage","template","context","_","SAFE_REGEXP_PATTERNS","MAX_SAFE_REGEXP_PATTERNS","assertSafeRegExpPattern","assertSafeRegExpInvocation","func","target","args","kind","_instanceof","regexp","validateLimit","defaultValue","maximum","countLiteralMatches","search","all","count","position","countRegExpMatches","flags","re","PARSE_CACHE","MAX_PARSE_CACHE_ENTRIES","MAX_PARSE_CACHE_CHARS","parseCacheChars","parseExpression","expression","cached","ast","acorn","error","SyntaxError","oldestKey","assertBoundedData","label","valueType","_type_of","pending","seen","WeakSet","dataSize","dataNodes","enqueueProperties","object","keys","descriptor","TypeError","current","ArrayBuffer","Array","item","BINARY_OPERATION_MAP","createGlobalScope","scope","builtin","globals","globalThis","isWritable","GLOBAL_SCOPE","getGlobalScope","EMPTY_CONTEXT","getBlockedMethods","BLOCKED_METHODS","path","_path_split","properties","Evaluator","variables","options","clonedVariables","structuredClone","resetBudget","evaluate","execute","result","Error","Promise","resultType","visit","Constructor","arg","content","handleBinaryExpression","op","leftBits","rightBits","BigInt","Math","apply","assertBoundedRegExp","assertBoundedConstruction","_args_","size","DataView","_size_size","collectionSize","byteLength","_args_1","offset","_args_2","elementCount","_size_length","elementCount1","handleLogicalExpression","left1","left2","handleUnaryExpression","handleIdentifier","scopes","ReferenceError","handleMemberExpression","objectValue","isStaticProperty","property","Function","prototype","handleArrayExpression","element","_result","assertBoundedSpread","currentLength","handleObjectExpression","spreadPropertyCount","spreadValue","handleSpreadElement","handleArrowFunctionExpression","param","newScope","paramCount","consumeEvaluationValue","_assertBoundedData","handleCallExpression","isOptional","blockedPath","resultLength","length","replacement","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","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;AChQA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACM,SAASC,sBAAsBC,OAAO;IACrC,IAAIC,MAAM;IACV,IAAIC,QAAQ;IACZ,IAAMC,YAAY;IAElB,SAASC;QACD,IAAMC,QAAQJ;QACd,IAAMK,WAAW;YAACC;SAAgB;QAClC,MAAOP,AAAiB,QAAjBA,OAAO,CAACC,IAAI,CAAU;YACrBA;YACAK,SAAS,IAAI,CAACC;QACtB;QACA,IAAID,AAAoB,MAApBA,SAAS,MAAM,EACX,OAAOA,QAAQ,CAAC,EAAE;QAE1B,OAAO;YAAE,MAAM;YAAOA,UAAAA;YAAUD,OAAAA;YAAO,KAAKJ;QAAI;IACxD;IAEA,SAASM;QACD,IAAMF,QAAQJ;QACd,IAAMO,QAAQ,EAAE;QAChB,MAAOP,MAAMD,QAAQ,MAAM,IAAIA,AAAiB,QAAjBA,OAAO,CAACC,IAAI,IAAYD,AAAiB,QAAjBA,OAAO,CAACC,IAAI,CAC3DO,MAAM,IAAI,CAACC;QAEnB,OAAO;YAAE,MAAM;YAAOD,OAAAA;YAAOH,OAAAA;YAAO,KAAKJ;QAAI;IACrD;IAEA,SAASQ;QACD,IAAMC,OAAOC;QACb,IAAMC,aAAaC;QACnB,IAAID,YACI,OAAO;YAAE,MAAM;YAAS,KAAKA,WAAW,GAAG;YAAE,KAAKA,WAAW,GAAG;YAAE,MAAMF;YAAM,OAAOA,KAAK,KAAK;YAAE,KAAKT;QAAI;QAElH,OAAOS;IACf;IAEA,SAASG;QACD,IAAMC,KAAKd,OAAO,CAACC,IAAI;QACvB,IAAIa,AAAO,QAAPA,IAAY;YACRb;YACA,OAAO;gBAAE,KAAK;gBAAG,KAAKc;YAAS;QACvC;QACA,IAAID,AAAO,QAAPA,IAAY;YACRb;YACA,OAAO;gBAAE,KAAK;gBAAG,KAAKc;YAAS;QACvC;QACA,IAAID,AAAO,QAAPA,IAAY;YACRb;YACA,OAAO;gBAAE,KAAK;gBAAG,KAAK;YAAE;QAChC;QACA,IAAIa,AAAO,QAAPA,IAAY;YACR,IAAME,QAAQ,sBAAsB,IAAI,CAAChB,QAAQ,KAAK,CAACC;YACvD,IAAIe,OAAO;gBACHf,OAAOe,KAAK,CAAC,EAAE,CAAC,MAAM;gBACtB,IAAMC,MAAMC,OAAOF,KAAK,CAAC,EAAE;gBAC3B,IAAIG;gBAEIA,MADJH,AAAaI,WAAbJ,KAAK,CAAC,EAAE,GACEC,MAEAD,AAAa,OAAbA,KAAK,CAAC,EAAE,GAAUD,QAAWG,OAAOF,KAAK,CAAC,EAAE;gBAE1D,OAAO;oBAAEC,KAAAA;oBAAKE,KAAAA;gBAAI;YAC1B;QACR;QACA,OAAO;IACf;IAEA,SAASR;QACD,IAAMN,QAAQJ;QACd,IAAMa,KAAKd,OAAO,CAACC,IAAI;QAEvB,IAAIa,AAAO,QAAPA,IAAY;YACRb;YACA,IAAIoB,YAAY;YAChB,IAAIrB,AAAiB,QAAjBA,OAAO,CAACC,IAAI,EAAU;gBAClB,IAAMqB,OAAOtB,QAAQ,KAAK,CAACC;gBAC3B,IAAIqB,KAAK,UAAU,CAAC,OACZrB,OAAO;qBACR,IAAIqB,KAAK,UAAU,CAAC,SAASA,KAAK,UAAU,CAAC,OAAO;oBACnDrB,OAAO;oBACPoB,YAAY;gBACpB,OAAO,IAAIC,KAAK,UAAU,CAAC,UAAUA,KAAK,UAAU,CAAC,QAAQ;oBACrDrB,OAAO;oBACPoB,YAAY;gBACpB,OAAO,IAAIC,KAAK,UAAU,CAAC,OAAO;oBAC1B,IAAMC,QAAQ,wBAAwB,IAAI,CAACD;oBAC3CrB,OAAOsB,QAAQA,KAAK,CAAC,EAAE,CAAC,MAAM,GAAG;gBACzC,OACQtB,OAAO;YAEvB;YACAC;YACA,IAAIA,QAAQC,WACJ,MAAM,IAAIqB,WAAW;YAE7B,IAAMC,OAAOrB;YACbF;YACA,IAAIF,AAAiB,QAAjBA,OAAO,CAACC,IAAI,EACRA;YAER,OAAO;gBAAE,MAAM;gBAASwB,MAAAA;gBAAMJ,WAAAA;gBAAWhB,OAAAA;gBAAO,KAAKJ;YAAI;QACjE;QAEA,IAAIa,AAAO,QAAPA,IAAY;YACRb;YACA,IAAID,AAAiB,QAAjBA,OAAO,CAACC,IAAI,EACRA;YAER,IAAID,AAAiB,QAAjBA,OAAO,CAACC,IAAI,EACRA;YAER,MAAOA,MAAMD,QAAQ,MAAM,IAAIA,AAAiB,QAAjBA,OAAO,CAACC,IAAI,CAAU;gBAC7C,IAAID,AAAiB,SAAjBA,OAAO,CAACC,IAAI,EACRA;gBAERA;YACR;YACAA;YACA,OAAO;gBAAE,MAAM;gBAAQ,WAAW;gBAAOI,OAAAA;gBAAO,KAAKJ;YAAI;QACjE;QAEA,IAAIa,AAAO,SAAPA,IAAa;YACTb,OAAO;YACP,IAAMyB,UAAU1B,OAAO,CAACK,QAAQ,EAAE;YAClC,OAAO;gBAAE,MAAM;gBAAQ,WAAWqB,AAAY,QAAZA,WAAmBA,AAAY,QAAZA;gBAAiBrB,OAAAA;gBAAO,KAAKJ;YAAI;QAC9F;QAEAA;QACA,OAAO;YAAE,MAAM;YAAQ,WAAWa,AAAO,QAAPA,MAAcA,AAAO,QAAPA;YAAYT,OAAAA;YAAO,KAAKJ;QAAI;IACpF;IAEA,IAAM0B,MAAM,SAACC,IAAI;eAAK5B,QAAQ,KAAK,CAAC4B,KAAK,KAAK,EAAEA,KAAK,GAAG;;IAYxD,IAAMC,MAAMnC,OAAO;IACnB,IAAMoC,SAAS,IAAIC,IAAI,aAAa,KAAK,CAAC;IAC1C,IAAMC,OAAO,IAAID,IAAI,kEAAkE,KAAK,CAAC;IAC7F,IAAME,SAAS,IAAIF,IAAI;QAAC;QAAK;QAAM;QAAM;QAAM;QAAM;QAAM;QAAU;QAAU;QAAU;KAAS;IAGlG,SAASG,UAAUC,GAAG;QACd,OAAQA;YACA,KAAK;gBACG,OAAOL;YACf,KAAK;gBACG,OAAOE;YACf,KAAK;gBACG,OAAOC;YACf,KAAK;gBACG,OAAO,IAAIF,IAAI;oBAAC;iBAAK;YAC7B,KAAK;gBACG,OAAO,IAAIA,IAAI;oBAAC;iBAAK;YAC7B,KAAK;gBACG,OAAO,IAAIA,IAAI;oBAAC;iBAAK;YAC7B,KAAK;gBACG,OAAO,IAAIA,IAAI;oBAAC;iBAAK;YAC7B,KAAK;gBACG,OAAO,IAAIA,IAAI;oBAAC;iBAAK;YAC7B,KAAK;gBACG,OAAO,IAAIA,IAAI;oBAAC;iBAAK;YAC7B;gBAGQ,IAAI,cAAc,IAAI,CAACI,MACf,OAAON;gBAIf,OAAO,IAAIE,IAAI;oBAACI;iBAAI;QACpC;IACR;IAGA,SAASC,SAASC,IAAI;QAEd,IAAMC,QAAQD,KAAK,KAAK,CAAC,GAAG;QAC5B,IAAIC,MAAM,UAAU,CAAC,MACb,OAAOT;QAEf,IAAMU,MAAM,IAAIR;QAChB,IAAK,IAAIS,IAAI,GAAGA,IAAIF,MAAM,MAAM,EAAEE,IAAK;YAC/B,IAAI1B,KAAKwB,KAAK,CAACE,EAAE;YACjB,IAAI1B,AAAO,SAAPA,IAAa;gBACT,IAAMqB,MAAMG,KAAK,CAAC,EAAEE,EAAE;gBACtB,IAAMC,WAAWP,UAAUC;gBAC3B,IAAIM,aAAaZ,KACT,OAAOA;oBAEVa,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAWD,QAAQ,CAARA,OAAAA,QAAAA,CAAAA,IAAXC,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAAA;wBAAAA,IAAMC,IAAND,MAAAA,KAAAA;wBAAqBH,IAAI,GAAG,CAACI;;;oBAA7BD,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBACL;YACR;YAEA,IAAIJ,AAAiB,QAAjBA,KAAK,CAACE,IAAI,EAAE,IAAYF,AAAiBlB,WAAjBkB,KAAK,CAACE,IAAI,EAAE,IAAkBF,AAAiB,QAAjBA,KAAK,CAACE,IAAI,EAAE,EAAU;gBACxE,IAAMI,MAAMN,KAAK,CAACE,IAAI,EAAE;gBACxB,IAAMK,YAAY/B,GAAG,WAAW,CAAC;gBACjC,IAAMgC,UAAUF,IAAI,WAAW,CAAC;gBAEhC,IAAIE,UAAUD,YAAY,MAClB,OAAOhB;gBAEf,IAAK,IAAIkB,OAAOF,WAAWE,QAAQD,SAASC,OACpCR,IAAI,GAAG,CAACS,OAAO,aAAa,CAACD;gBAErCP,KAAK;gBACL;YACR;YACAD,IAAI,GAAG,CAACzB;QAChB;QACA,OAAOyB;IACf;IAEA,SAASU,aAAarB,IAAI;QAClB,OAAQA,KAAK,IAAI;YACT,KAAK;gBACG,IAAMS,OAAOV,IAAIC;gBACjB,IAAIA,KAAK,SAAS,IAAIS,KAAK,UAAU,CAAC,QAAQA,KAAK,UAAU,CAAC,MACtD,OAAO,IAAIN;gBAEnB,IAAIM,AAAS,QAATA,MACI,OAAOR;gBAEf,IAAIQ,KAAK,UAAU,CAAC,MACZ,OAAOD,SAASC;gBAExB,IAAIA,KAAK,UAAU,CAAC,OAAO;oBACnB,IAAMF,MAAME,KAAK,KAAK,CAAC;oBACvB,IAAIF,AAAe,MAAfA,IAAI,MAAM,EACN,OAAOD,UAAUC;oBAGzB,OAAON;gBACf;gBACA,OAAO,IAAIE,IAAI;oBAACM,IAAI,CAAC,EAAE;iBAAC;YAEhC,KAAK;gBACG,OAAOT,AAAa,MAAbA,KAAK,GAAG,GAASC,MAAMoB,aAAarB,KAAK,IAAI;YAC5D,KAAK;gBACG,OAAOA,KAAK,SAAS,GAAGC,MAAMoB,aAAarB,KAAK,IAAI;YAC5D,KAAK;gBACG,IAAMsB,QAAQ,IAAInB;oBACbW,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAgBd,KAAK,QAAQ,qBAA7Bc,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA+B;wBAA/BA,IAAMS,SAANT,MAAAA,KAAAA;wBACG,IAAMH,MAAMU,aAAaE;wBACzB,IAAIZ,QAAQV,KAAK,OAAOA;4BACnBuB,6BAAAA,MAAAA,qBAAAA,OAAAA,kBAAAA;;4BAAL,QAAKA,aAAYb,GAAG,CAAHA,OAAAA,QAAAA,CAAAA,IAAZa,QAAAA,CAAAA,CAAAA,6BAAAA,AAAAA,CAAAA,SAAAA,WAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,6BAAAA,KAAAA;gCAAAA,IAAMtC,KAANsC,OAAAA,KAAAA;gCAAiBF,MAAM,GAAG,CAACpC;;;4BAA3BsC,qBAAAA;4BAAAA,kBAAAA;;;qCAAAA,8BAAAA,AAAAA,QAAAA,WAAAA,MAAAA,EAAAA,WAAAA,MAAAA;;oCAAAA,oB,MAAAA;;;oBACb;;oBAJKV,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAKL,OAAOQ;YAEf,KAAK;oBACQG,6BAAAA,MAAAA,qBAAAA,OAAAA,kBAAAA;;oBAAL,QAAKA,aAAczB,KAAK,KAAK,qBAAxByB,QAAAA,CAAAA,CAAAA,6BAAAA,AAAAA,CAAAA,SAAAA,WAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,6BAAAA,KAA0B;wBAA1BA,IAAMC,OAAND,OAAAA,KAAAA;wBACG,IAAME,OAAMN,aAAaK;wBACzB,IAAIC,SAAQ1B,KAAK,OAAOA;wBACxB,IAAI0B,KAAI,IAAI,GAAG,GAAG,OAAOA;oBACjC;;oBAJKF,qBAAAA;oBAAAA,kBAAAA;;;6BAAAA,8BAAAA,AAAAA,QAAAA,WAAAA,MAAAA,EAAAA,WAAAA,MAAAA;;4BAAAA,oB,MAAAA;;;gBAKL,OAAO,IAAItB;YACnB;gBACQ,OAAOF;QACvB;IACR;IAGA,SAAS2B,cAAcC,CAAC,EAAEC,CAAC;QACnB,IAAID,MAAM5B,OAAO6B,MAAM7B,KAAK,OAAO;QACnC,IAAI4B,AAAW,MAAXA,EAAE,IAAI,IAAUC,AAAW,MAAXA,EAAE,IAAI,EAAQ,OAAO;QACzC,IAAuBC,OAAAA,iBAAAA,EAAE,IAAI,IAAID,EAAE,IAAI,GAAG;YAACD;YAAGC;SAAE,GAAG;YAACA;YAAGD;SAAE,MAAlDG,QAAgBD,IAAAA,CAAAA,EAAAA,EAATE,QAASF,IAAAA,CAAAA,EAAAA;YAClBjB,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;YAAL,QAAKA,YAAYkB,KAAK,CAALA,OAAAA,QAAAA,CAAAA,IAAZlB,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAmB;gBAAnBA,IAAM5B,KAAN4B,MAAAA,KAAAA;gBACG,IAAImB,MAAM,GAAG,CAAC/C,KAAK,OAAO;YAClC;;YAFK4B,oBAAAA;YAAAA,iBAAAA;;;qBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;oBAAAA,mB,MAAAA;;;QAGL,OAAO;IACf;IAQA,SAASoB,kBAAkBC,SAAS;QAC5B,OAAOd,aAAac,UAAU,IAAI;IAC1C;IAeA,SAASC,mBAAmBpC,IAAI;QACxB,OAAQA,KAAK,IAAI;YACT,KAAK;gBACG,OAAOA,KAAK,GAAG,KAAKb,QAAWa,OAAO;YAC9C,KAAK;gBACG,OAAOA,KAAK,SAAS,GAAG,OAAOoC,mBAAmBpC,KAAK,IAAI;YACnE,KAAK;gBACG,IAAK,IAAIY,IAAIZ,KAAK,KAAK,CAAC,MAAM,GAAG,GAAGY,KAAK,GAAGA,IAAK;oBACzC,IAAM5B,aAAaoD,mBAAmBpC,KAAK,KAAK,CAACY,EAAE;oBACnD,IAAI5B,YAAY,OAAOA;oBACvB,IAAM2B,MAAMU,aAAarB,KAAK,KAAK,CAACY,EAAE;oBACtC,IAAID,QAAQV,OAAOU,IAAI,IAAI,GAAG,GAAG;gBACzC;gBACA,OAAO;YAEf;gBACQ,OAAO;QACvB;IACR;IAEA,SAAS0B,kBAAkBrC,IAAI;QACvB,OAAQA,KAAK,IAAI;YACT,KAAK;gBACG,OAAOA,KAAK,GAAG,KAAKb,QAAWa,OAAO;YAC9C,KAAK;gBACG,OAAOA,KAAK,SAAS,GAAG,OAAOqC,kBAAkBrC,KAAK,IAAI;YAClE,KAAK;oBACQc,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAcd,KAAK,KAAK,qBAAxBc,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA0B;wBAA1BA,IAAMY,OAANZ,MAAAA,KAAAA;wBACG,IAAM9B,aAAaqD,kBAAkBX;wBACrC,IAAI1C,YAAY,OAAOA;wBACvB,IAAM2B,MAAMU,aAAaK;wBACzB,IAAIf,QAAQV,OAAOU,IAAI,IAAI,GAAG,GAAG,OAAO;oBAChD;;oBALKG,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAML,OAAO;YAEf;gBACQ,OAAO;QACvB;IACR;IAEA,SAASwB,kCAAkCC,OAAO;QAC1C,IAAM3D,QAAQ2D,QAAQ,KAAK;QAC3B,IAAK,IAAI3B,IAAI,GAAGA,IAAI,IAAIhC,MAAM,MAAM,EAAEgC,IAAK;YACnC,IAAM4B,OAAOJ,mBAAmBxD,KAAK,CAACgC,EAAE;YACxC,IAAM6B,QAAQJ,kBAAkBzD,KAAK,CAACgC,IAAI,EAAE;YAC5C,IAAI4B,QAAQC,SAASb,cAAcM,kBAAkBM,OAAON,kBAAkBO,SACtE,OAAO;QAEvB;QACA,OAAO;IACf;IAEA,SAASC,4BAA4B1C,IAAI;QACjC,OAAQA,KAAK,IAAI;YACT,KAAK;gBACG,IAAIA,KAAK,GAAG,KAAKb,OACT,OAAO;gBAEf,OAAOuD,4BAA4B1C,KAAK,IAAI;YACpD,KAAK;gBACG,OAAO0C,4BAA4B1C,KAAK,IAAI;YACpD,KAAK;gBACG,OAAOA,KAAK,QAAQ,CAAC,IAAI,CAAC0C;YAClC,KAAK;gBACG,OAAO1C,KAAK,KAAK,CAAC,IAAI,CAAC0C;YAC/B;gBACQ,OAAO;QACvB;IACR;IAEA,SAASC,oBAAoB3C,IAAI;QACzB,IAAIA,AAAc,UAAdA,KAAK,IAAI,EACL,OAAO;QAMf,IAAM4C,QAAQ5C,KAAK,QAAQ,CAAC,GAAG,CAACD,KAAK,IAAI;QACzC,IAAK,IAAIa,IAAI,GAAGA,IAAI,IAAIgC,MAAM,MAAM,EAAEhC,IAC9B,IAAIgC,AAAa,OAAbA,KAAK,CAAChC,EAAE,IAAWgC,KAAK,CAAChC,IAAI,EAAE,CAAC,UAAU,CAACgC,KAAK,CAAChC,EAAE,GAC/C,OAAO;QASvB,IAAMiC,OAAO7C,KAAK,QAAQ,CAAC,GAAG,CAACqB;QAC/B,IAAK,IAAIyB,KAAI,GAAGA,KAAID,KAAK,MAAM,EAAEC,KACzB,IAAK,IAAIC,IAAID,KAAI,GAAGC,IAAIF,KAAK,MAAM,EAAEE,IAC7B,IAAInB,cAAciB,IAAI,CAACC,GAAE,EAAED,IAAI,CAACE,EAAE,GAC1B,OAAO;QAI/B,OAAO;IACf;IAEA,SAASC,eAAehD,IAAI;QACpB,OAAQA,KAAK,IAAI;YACT,KAAK;gBACG,IAAIA,KAAK,GAAG,KAAKb,OAAU;oBACnB,IAAMuB,QAAQV,AAAmB,YAAnBA,KAAK,IAAI,CAAC,IAAI,GAAeA,KAAK,IAAI,CAAC,IAAI,GAAGA,KAAK,IAAI;oBACrE,IAAI0C,4BAA4BhC,QACxB,OAAO;oBAEf,IAAIA,AAAe,UAAfA,MAAM,IAAI,IAAciC,oBAAoBjC,QACxC,OAAO;gBAEvB;gBACA,OAAOsC,eAAehD,KAAK,IAAI;YAEvC,KAAK;gBACG,OAAOgD,eAAehD,KAAK,IAAI;YACvC,KAAK;gBACG,OAAOA,KAAK,QAAQ,CAAC,IAAI,CAACgD;YAClC,KAAK;gBACG,OAAOV,kCAAkCtC,SAASA,KAAK,KAAK,CAAC,IAAI,CAACgD;YAC1E;gBACQ,OAAO;QACvB;IACR;IAEA,IAAI;QACI,OAAOA,eAAexE;IAC9B,EAAE,UAAM;QAIA,OAAO;IACf;AACR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACvcA,IAAMyE,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,IAAI7D,IAAI;IAAC;IAAW;IAAwB;IAAY;IAAqB;IAAU;CAAW;AAC9H,IAAM8D,2BAA2B,IAAI9D,IACpC;IACC+D;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;QACXrE,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;QAAL,QAAKA,YAAqBmD,wBAAwB,CAAxBA,OAAAA,QAAAA,CAAAA,IAArBnD,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA+C;YAA/CA,IAAMgE,cAANhE,MAAAA,KAAAA;YACJ,gBAAmBsE,QAAAA;gBAAC;gBAAO;gBAAQ;gBAAW;gBAAQ;aAAa,OAAhDA,MAAAA,MAAAA,EAAAA,KAAkD;oBAA1DC,OAAQD,KAAAA,CAAAA,GAAAA;gBAClB,IAAME,SAASR,YAAY,SAAS,CAACO,KAAK;gBAC1C,IAAI,AAAkB,cAAlB,OAAOC,UAAyB,CAACJ,IAAI,GAAG,CAACI,SAC5CJ,IAAI,GAAG,CAACI,QAAQD;YAElB;QACD;;QAPKvE,oBAAAA;QAAAA,iBAAAA;;;iBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;gBAAAA,mB,MAAAA;;;IAQL,OAAOoE;AACR;AAYA,IAAMK,wBAAwB,IAAIpF,IACjC;IAACrC,OAAO,KAAK;IAAEA,OAAO,QAAQ;IAAEA,OAAO,OAAO;IAAEA,OAAO,MAAM;IAAEA,OAAO,KAAK;CAAC,CAC1E,GAAG,CAAC,SAAC0H,MAAM;WAAKC,OAAO,SAAS,CAACD,OAAO;GACxC,MAAM,CAAC,SAACF,MAAM;WAAK,AAAkB,cAAlB,OAAOA;;AAQ7B,IAAMI,yBAA0B;IAC/B,IAAMR,MAAM,IAAIC;IAChB,gBAAqBC,QAAAA;QAAChE,OAAO,SAAS,CAAC,KAAK;QAAEA,OAAO,SAAS,CAAC,QAAQ;QAAEA,OAAO,SAAS,CAAC,MAAM;KAAC,OAA5EgE,MAAAA,MAAAA,EAAAA,KAA8E;YAAxFE,SAAUF,KAAAA,CAAAA,GAAAA;QACpBF,IAAI,GAAG,CAACI,QAAQ;IACjB;QACKxE,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;QAAL,QAAKA,YAAgB;YAAC2E,OAAO,SAAS,CAAC,IAAI;YAAEA,OAAO,SAAS,CAAC,IAAI;SAA2B,CAAxE,OAA+C,8BAAGF,uBAAAA,CAAAA,OAAAA,QAAAA,CAAAA,IAAlEzE,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA0F;YAA1FA,IAAM6E,UAAN7E,MAAAA,KAAAA;YACJoE,IAAI,GAAG,CAACS,SAAQ;QACjB;;QAFK7E,oBAAAA;QAAAA,iBAAAA;;;iBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;gBAAAA,mB,MAAAA;;;IAGL,iBAAqB8E,SAAAA;QAACxE,OAAO,SAAS,CAAC,OAAO;QAAEA,OAAO,SAAS,CAAC,UAAU;QAAEA,OAAO,SAAS,CAAC,KAAK;KAAC,QAA/EwE,OAAAA,MAAAA,EAAAA,MAAiF;YAA3FC,UAAUD,MAAAA,CAAAA,IAAAA;QACpBV,IAAI,GAAG,CAACW,SAAQ;IACjB;IACA,OAAOX;AACR;AAEA,IAAMY,YAAYhI,OAAO;AAWzB,IAAMiI,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,EAAExI,GAAG;eAAK0D,OAAO6E,OAAO,CAACvI,IAAI;;;AASnH,IAAMyI,uBAAuB,IAAIhG;AACjC,IAAMiG,2BAA2B;AAQjC,SAASC,wBAAwBjI,OAAO;IACvC,IAAI,AAAmB,YAAnB,OAAOA,WAAwB+H,qBAAqB,GAAG,CAAC/H,UAC3D;IAED,IAAID,sBAAsBC,UACzB,MAAM,IAAIwB,WAAW;IAEtB,IAAIuG,qBAAqB,IAAI,IAAIC,0BAChCD,qBAAqB,MAAM,CAACA,qBAAqB,MAAM,GAAG,IAAI,GAAG,KAAK;IAEvEA,qBAAqB,GAAG,CAAC/H;AAC1B;AAkBA,SAASkI,2BAA2BC,IAAI,EAAEC,MAAM,EAAEC,IAAI;IAErD,IAAMC,OAAOhB,uBAAuB,GAAG,CAACa;IACxC,IAAIG,AAASlH,WAATkH,MACH;IAED,IAAIA,AAAS,oBAATA,MAA0B;QAG7B,IAAMtI,UAAUqI,IAAI,CAAC,EAAE;QACvB,IAAI,AAAmB,YAAnB,OAAOrI,SACViI,wBAAwBjI;aAClB,IAAWuI,YAAPvI,SAAmBqH,SAC7BY,wBAAwBjI,QAAQ,MAAM;QAEvC;IACD;IAKA,IAAMwI,SAASF,AAAS,sBAATA,OAA6BF,SAASC,IAAI,CAAC,EAAE;IAC5D,IAAUE,YAANC,QAAkBnB,SACrBY,wBAAwBO,OAAO,MAAM;AAEvC;AAEA,SAASC,cAAc7B,KAAK,EAAEK,IAAI,EAAEyB,YAAY,EAAEC,OAAO;IACxD,IAAI/B,AAAUxF,WAAVwF,OACH,OAAO8B;IAER,IAAI,CAACxH,OAAO,aAAa,CAAC0F,UAAUA,QAAQ,KAAKA,QAAQ+B,SACxD,MAAM,IAAInH,WAAY,GAA2CmH,MAAAA,CAAzC1B,MAAK,sCAA4C,OAAR0B;IAElE,OAAO/B;AACR;AAEA,SAASgC,oBAAoBhC,KAAK,EAAEiC,MAAM,EAAEC,GAAG;IAC9C,IAAID,AAAW,OAAXA,QACH,OAAOC,MAAMlC,MAAM,MAAM,GAAG,IAAI;IAEjC,IAAImC,QAAQ;IACZ,IAAIC,WAAW;IACf,MAAQA,AAAgD,OAAhDA,CAAAA,WAAWpC,MAAM,OAAO,CAACiC,QAAQG,SAAQ,EAAW;QAC3DD;QACA,IAAI,CAACD,KACJ;QAEDE,YAAYH,OAAO,MAAM;IAC1B;IACA,OAAOE;AACR;AAWA,SAASE,mBAAmBrC,KAAK,EAAE4B,MAAM,EAAEM,GAAG;IAC7C,IAAMI,QAAQV,OAAO,KAAK,CAAC,QAAQ,CAAC,OAAOA,OAAO,KAAK,GAAGA,OAAO,KAAK,GAAG;IACzE,IAAMW,KAAK,IAAI9B,OAAOmB,OAAO,MAAM,EAAEU;IACrC,IAAIH,QAAQ;IACZ,IAAI/H;IACJ,MAAQA,AAA4B,SAA5BA,CAAAA,QAAQmI,GAAG,IAAI,CAACvC,MAAK,EAAa;QACzCmC;QACA,IAAI,CAACD,OAAOC,QAAQ3D,mBACnB;QAED,IAAI+D,GAAG,SAAS,KAAKnI,MAAM,KAAK,EAC/BmI,GAAG,SAAS;IAEd;IACA,OAAOJ;AACR;AAeA,IAAMK,cAAc,IAAIrC;AACxB,IAAMsC,0BAA0B;AAChC,IAAMC,wBAAwB;AAC9B,IAAIC,kBAAkB;AAEtB,SAASC,gBAAgBC,UAAU;IAClC,IAAMC,SAASN,YAAY,GAAG,CAACK;IAC/B,IAAIC,AAAWtI,WAAXsI,QACH,OAAOA;IAGR,IAAIC;IACJ,IAAI;QACHA,MAAMC,+BAAAA,KAAW,CAACH,YAAY;YAAE,aAAa;QAAS;IACvD,EAAE,OAAOI,OAAO;QAIf,IAAStB,YAALsB,OAAiBrI,eAAc,cAAc,IAAI,CAACqI,MAAM,OAAO,GAClE,MAAM,IAAIC,YAAY;QAEvB,MAAMD;IACP;IAEA,IAAIJ,WAAW,MAAM,IAAIH,uBAAuB;QAC/C,MAAOF,YAAY,IAAI,IAAIC,2BAA2BE,kBAAkBE,WAAW,MAAM,GAAGH,sBAAuB;YAClH,IAAMS,YAAYX,YAAY,IAAI,GAAG,IAAI,GAAG,KAAK;YACjD,IAAIW,AAAc3I,WAAd2I,WAAyB;YAC7BR,mBAAmBQ,UAAU,MAAM;YACnCX,YAAY,MAAM,CAACW;QACpB;QACAX,YAAY,GAAG,CAACK,YAAYE;QAC5BJ,mBAAmBE,WAAW,MAAM;IACrC;IAEA,OAAOE;AACR;AAEA,SAASK,kBAAkBpD,KAAK,EAAEqD,KAAK;IAQtC,IAAMC,YAAYC,AAAOvD,WAAAA,QAAAA,cAAPuD,SAAOvD;IACzB,IAAIsD,AAAc,aAAdA,WAAwB;QAC3B,IAAItD,MAAM,MAAM,GAAGxB,mBAClB,MAAM,IAAI5D,WAAY,GAAQ,OAANyI,OAAM;QAE/B,OAAO;YAAE,UAAUrD,MAAM,MAAM,GAAG;YAAG,WAAW;QAAE;IACnD;IACA,IAAIA,AAAU,SAAVA,SAAkBsD,AAAc,gBAAdA,aAA6BA,AAAc,aAAdA,aAA0BA,AAAc,cAAdA,aAA2BA,AAAc,aAAdA,WACvG,OAAO;QAAE,UAAU;QAAG,WAAW;IAAE;IAGpC,IAAME,UAAU;QAACxD;KAAM;IACvB,IAAMyD,OAAO,IAAIC;IACjB,IAAIC,WAAW;IACf,IAAIC,YAAY;IAChB,IAAMC,oBAAoB,SAACC,MAAM;QAChC,IAAMC,OAAOpL,OAAO,IAAI,CAACmL;QACzB,IAAIN,QAAQ,MAAM,GAAGO,KAAK,MAAM,GAAGtF,gBAClC,MAAM,IAAI7D,WAAY,GAAQ,OAANyI,OAAM;YAE1BvH,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;YAAL,QAAKA,YAAaiI,IAAI,CAAJA,OAAAA,QAAAA,CAAAA,IAAbjI,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAmB;gBAAnBA,IAAMpD,MAANoD,MAAAA,KAAAA;gBACJ6H,YAAYjL,IAAI,MAAM;gBACtB,IAAMsL,aAAarL,OAAO,wBAAwB,CAACmL,QAAQpL;gBAC3D,IAAI,CAACsL,cAAc,CAACrL,OAAO,MAAM,CAACqL,YAAY,UAC7C,MAAM,IAAIC,UAAW,GAAQ,OAANZ,OAAM;gBAE9BG,QAAQ,IAAI,CAACQ,WAAW,KAAK;YAC9B;;YAPKlI,oBAAAA;YAAAA,iBAAAA;;;qBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;oBAAAA,mB,MAAAA;;;IAQN;IAEA,MAAO0H,QAAQ,MAAM,GAAG,EAAG;QAC1B,IAAMU,UAAUV,QAAQ,GAAG;QAC3BI;QACA,IAAIA,YAAYnF,gBACf,MAAM,IAAI7D,WAAY,GAAQ,OAANyI,OAAM;QAG/B,IAAI,AAAmB,YAAnB,OAAOa,SAAsB;YAChC,IAAIA,QAAQ,MAAM,GAAG1F,mBACpB,MAAM,IAAI5D,WAAY,GAAQ,OAANyI,OAAM;YAE/BM,YAAYO,QAAQ,MAAM,GAAG;QAC9B,OAAO,IAAIA,AAAY,SAAZA,WAAqBX,AAAAA,CAAOW,WAAAA,UAAAA,cAAPX,SAAOW,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,IAAWhC,YAAPuC,SAAmBC,gBAAeA,YAAY,MAAM,CAACD,UACxDP,YAAYO,QAAQ,UAAU;iBACxB,IAAIE,MAAM,OAAO,CAACF,UAAU;gBAClC,IAAIA,QAAQ,MAAM,GAAG5F,kBACpB,MAAM,IAAI1D,WAAY,GAAQ,OAANyI,OAAM;gBAE/BM,YAAYO,AAAiB,IAAjBA,QAAQ,MAAM;gBAC1BL,kBAAkBK;YACnB,OAAO,IAAWvC,YAAPuC,SAAmB/D,MAAK;gBAClC,IAAI+D,QAAQ,IAAI,GAAG5F,kBAClB,MAAM,IAAI1D,WAAY,GAAQ,OAANyI,OAAM;gBAE/BM,YAAYO,AAAe,KAAfA,QAAQ,IAAI;gBACxB/D,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC+D,SAAS,SAACG,IAAI,EAAE3L,GAAG;2BAAK8K,QAAQ,IAAI,CAAC9K,KAAK2L;;YACtE,OAAO,IAAW1C,YAAPuC,SAAmB/I,MAAK;gBAClC,IAAI+I,QAAQ,IAAI,GAAG5F,kBAClB,MAAM,IAAI1D,WAAY,GAAQ,OAANyI,OAAM;gBAE/BM,YAAYO,AAAe,IAAfA,QAAQ,IAAI;gBACxB/I,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC+I,SAAS,SAACG,IAAI;2BAAKb,QAAQ,IAAI,CAACa;;YAC5D,OACCR,kBAAkBK;QAEpB;QAEA,IAAIP,WAAWpF,kBACd,MAAM,IAAI3D,WAAY,GAAQ,OAANyI,OAAM;IAEhC;IACA,OAAO;QAAEM,UAAAA;QAAUC,WAAAA;IAAU;AAC9B;AAEA,IAAMU,uBAAuB,IAAInE,IAAI;IACpC;QAAC;QAAK,SAACtD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAM,SAACD,CAAC,EAAEC,CAAC;mBAAKD,KAAAA,GAAAA,CAAAA,GAAKC;;KAAE;IACxB;QAAC;QAAM,SAACD,CAAC,EAAEC,CAAC;mBAAKD,KAAKC;;KAAE;IACxB;QAAC;QAAO,SAACD,CAAC,EAAEC,CAAC;mBAAKD,MAAMC;;KAAE;IAC1B;QAAC;QAAM,SAACD,CAAC,EAAEC,CAAC;mBAAKD,KAAKC;;KAAE;IACxB;QAAC;QAAO,SAACD,CAAC,EAAEC,CAAC;mBAAKD,MAAMC;;KAAE;IAC1B;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAM,SAACD,CAAC,EAAEC,CAAC;mBAAKD,KAAKC;;KAAE;IACxB;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAM,SAACD,CAAC,EAAEC,CAAC;mBAAKD,KAAKC;;KAAE;IACxB;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAK,SAACD,CAAC,EAAEC,CAAC;mBAAKD,IAAIC;;KAAE;IACtB;QAAC;QAAM,SAACD,CAAC,EAAEC,CAAC;mBAAKD,KAAKC;;KAAE;IACxB;QAAC;QAAM,SAACD,CAAC,EAAEC,CAAC;mBAAKD,KAAKC;;KAAE;IACxB;QAAC;QAAO,SAACD,CAAC,EAAEC,CAAC;mBAAKD,MAAMC;;KAAE;IAC1B;QAAC;QAAM,SAACD,CAAC,EAAEC,CAAC;mBAAKD,KAAKC;;KAAE;IACxB;QAAC;QAAc,SAACD,CAAC,EAAEC,CAAC;mBAAM6E,YAAD9E,GAAaC;;KAAE;CACxC;AAED,SAASyH;IACR,IAAMC,QAAQ7L,OAAO,MAAM,CAAC;IAC5B,IAAQ8L,UAAYC,iCAAAA,OAALD;IAOf,IAAK,IAAM/L,OAAO+L,QAAS;QAC1B,KAAIvL,sBAAsB,QAAQ,CAACR,MAGnC;YAAA,KAAIsG,oBAAoB,GAAG,CAACtG,MAG5B;gBAAA,IAAKC,OAAO,MAAM,CAACgM,YAAYjM;oBAK/B,IAAMkM,aAAaH,OAAO,CAAC/L,IAAI;oBAE/BC,OAAO,cAAc,CAAC6L,OAAO9L,KAAK;wBACjC,OAAOiM,UAAU,CAACjM,IAAI;wBACtB,UAAUkM;wBACV,YAAY;wBACZ,cAAc;oBACf;;YAVA;QAHA;IAcD;IAEAjM,OAAO,cAAc,CAAC6L,OAAO,cAAc;QAC1C,OAAOA;QACP,UAAU;QACV,YAAY;QACZ,cAAc;IACf;IAEA,OAAOA;AACR;AAQA,IAAIK,eAAe;AAEnB,SAASC;IACR,IAAID,AAAiB,SAAjBA,cACHA,eAAeN;IAEhB,OAAOM;AACR;AAUA,IAAME,gBAAgBpM,OAAO,MAAM,CAACA,OAAO,MAAM,CAAC;AAElD,IAAMqM,oBAAqB;IAI1B,IAAIC,kBAAkB;IAEtB,OAAO;QACN,IAAIA,iBAAiB,OAAOA;QAE5B,IAAM/E,MAAM,IAAIC;YACXrE,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;YAAL,QAAKA,YAAc7C,cAAcA,CAAAA,OAAAA,QAAAA,CAAAA,IAA5B6C,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA8B;gBAA9BA,IAAMoJ,OAANpJ,MAAAA,KAAAA;gBACJ,IAAgCqJ,cAAAA,UAAAA,KAAK,KAAK,CAAC,OAApCrB,SAAyBqB,WAAAA,CAAAA,EAAAA,EAAdC,aAAcD,YAAAA,KAAAA,CAAjB;gBACf,IAAIjB,UAAUS,UAAU,CAACb,OAAO;oBAC3BtH,6BAAAA,MAAAA,qBAAAA,OAAAA,kBAAAA;;oBAAL,QAAKA,aAAc4I,UAAU,CAAVA,OAAAA,QAAAA,CAAAA,IAAd5I,QAAAA,CAAAA,CAAAA,6BAAAA,AAAAA,CAAAA,SAAAA,WAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,6BAAAA,KAA0B;wBAA1BA,IAAM3D,OAAN2D,OAAAA,KAAAA;wBACJ,IAAI0H,WAAWvL,OAAO,MAAM,CAACuL,SAASrL,OACrCqL,UAAUA,OAAO,CAACrL,KAAK;6BACjB;4BACNqL,UAAU;4BACV;wBACD;oBACD;;oBAPK1H,qBAAAA;oBAAAA,kBAAAA;;;6BAAAA,8BAAAA,AAAAA,QAAAA,WAAAA,MAAAA,EAAAA,WAAAA,MAAAA;;4BAAAA,oB,MAAAA;;;gBAQL,IAAI,AAAmB,cAAnB,OAAO0H,SAAwBhE,IAAI,GAAG,CAACgE,SAASgB;YACrD;;YAZKpJ,oBAAAA;YAAAA,iBAAAA;;;qBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;oBAAAA,mB,MAAAA;;;QAaLmJ,kBAAkB/E;QAElB,OAAO+E;IACR;AACD;AAeO,IAAMI,sBAASA,WAAAA,GAAf;;aAAMA;YAUAC,YAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAYP,eAAeQ,UAAAA,UAAAA,MAAAA,GAAAA,IAAAA,SAAAA,CAAAA,EAAAA,GAAAA,KAAAA;gCAV3BF;QAWX,IAAI,CAAC,cAAc,GAAGxD,cAAc0D,QAAAA,UAAAA,KAAAA,IAAAA,QAAS,cAAc,EAAE,kBAAkBrH,0BAA0BC;QACzG,IAAI,CAAC,kBAAkB,GAAG0D,cAAc0D,QAAAA,UAAAA,KAAAA,IAAAA,QAAS,kBAAkB,EAAE,sBAAsBnH,8BAA8BC;QACzH,IAAI,CAAC,QAAQ,GAAGwD,cAAc0D,QAAAA,UAAAA,KAAAA,IAAAA,QAAS,QAAQ,EAAE,YAAY3G,mBAAmBC;QAIhF,IAAI2G,kBAAkBT;QACtB,IAAIO,cAAcP,eAAe;YAChC3B,kBAAkBkC,WAAW;YAC7BE,kBAAkBC,gBAAgBH;QACnC;QACA,IAAI,CAAC,MAAM,GAAG;YAACE;YAAiBV;SAAiB,CAAC,MAAM,CAAC,SAACN,KAAK;mBAAKA,QAAAA;;QACpE,IAAI,CAAC,MAAM,GAAGhK;QACd,IAAI,CAAC,UAAU,GAAG;QAClB,IAAI,CAAC,wBAAwB,GAAG;QAChC,IAAI,CAAC,iBAAiB,GAAG+D;QACzB,IAAI,CAAC,kBAAkB,GAAGE;QAC1B,IAAI,CAAC,eAAe,GAAG;;kBA5BZ4G,WAAAA;;YAqCZK,KAAAA;mBAAAA;gBACC,IAAI,CAAC,wBAAwB,GAAG,IAAI,CAAC,kBAAkB;gBACvD,IAAI,CAAC,iBAAiB,GAAGnH;gBACzB,IAAI,CAAC,kBAAkB,GAAGE;gBAC1B,IAAI,CAAC,eAAe,GAAG;YACxB;;;YAqBAkH,KAAAA;mBAAAA,SAAS9C,UAAU;gBAClB,IAAI,AAAsB,YAAtB,OAAOA,YACV,MAAM,IAAIoB,UAAU;gBAGrB,IAAIpB,WAAW,MAAM,GAAG,IAAI,CAAC,cAAc,EAC1C,MAAM,IAAIK,YAAYnC,mBAAmB9C,eAAe,mBAAmB,EAAE;oBAAC,IAAI,CAAC,cAAc;iBAAC;gBAGnG,IAAI,CAAC,MAAM,GAAG4E;gBACd,IAAI,CAAC,WAAW;gBAEhB,IAAME,MAAMH,gBAAgBC;gBAG5B,IAAI,CAAC,UAAU,GAAG;gBAClB,IAAI;oBACH,OAAO,IAAI,CAAC,OAAO,CAACE,IAAI,IAAI;gBAC7B,SAAU;oBACT,IAAI,CAAC,UAAU,GAAG;oBAClB,IAAI,CAAC,MAAM,GAAGvI;gBACf;YACD;;;YAQAoL,KAAAA;mBAAAA,SAAQ/K,IAAI;gBAMX,IAAI,CAAC,IAAI,CAAC,UAAU,EACnB,IAAI,CAAC,WAAW;gBAEjB,IAAIgL;oBAEC/J,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAcjB,IAAI,CAAJA,OAAAA,QAAAA,CAAAA,IAAdiB,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAoB;wBAApBA,IAAMd,OAANc,MAAAA,KAAAA;wBACJ+J,SAAS,IAAI,CAAC,KAAK,CAAC7K;oBACrB;;oBAFKc,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAIL,IAAI,AAAkB,cAAlB,OAAO+J,QACV,MAAM,IAAIC,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAAuC;gBAG3GmF,kBAAkByC,QAAQ;gBAK1B,IAAUlE,YAANkE,QAAkBE,UACrB,MAAM,IAAID,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAAsC;gBAQ1G,IAAM+H,aAAazC,AAAOsC,WAAAA,SAAAA,cAAPtC,SAAOsC;gBAC1B,IAAIA,AAAW,SAAXA,UAAmBG,AAAe,aAAfA,cAA2BA,AAAe,aAAfA,cAA2BA,AAAe,cAAfA,cAA4BA,AAAe,gBAAfA,cAA8BA,AAAe,aAAfA,YACtI,OAAOH;gBAYR,IAAI;oBACH,OAAOJ,gBAAgBI;gBACxB,EAAE,OAAO5C,OAAO;oBACf,IAAIA,SAASA,AAAe,qBAAfA,MAAM,IAAI,EACtB,MAAM,IAAI6C,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;wBAAC;qBAAkD;oBAEtH,MAAMgF;gBACP;YACD;;;YAQAgD,KAAAA;mBAAAA,SAAMjL,IAAI;;gBACT,IAAI,CAAC,wBAAwB;gBAC7B,IAAI,IAAI,CAAC,wBAAwB,GAAG,GACnC,MAAM,IAAIJ,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,OAAQI,KAAK,IAAI;wBAChB,KAAK;4BACJ,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,UAAU;wBAElC,KAAK;4BACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;wBAEpC,KAAK;4BACJ,OAAO,IAAI,CAAC,uBAAuB,CAACA;wBAErC,KAAK;4BACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;wBAEnC,KAAK;4BACJ,OAAO,IAAI,CAAC,gBAAgB,CAACA;wBAE9B,KAAK;4BAIJ,IAAIA,KAAK,KAAK,EACbqG,wBAAwBrG,KAAK,KAAK,CAAC,OAAO;4BAE3C,OAAOA,KAAK,KAAK;wBAElB,KAAK;4BACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;wBAEpC,KAAK;4BACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;wBAEnC,KAAK;4BACJ,OAAO,IAAI,CAAC,mBAAmB,CAACA;wBAEjC,KAAK;4BACJ,OAAO,IAAI,CAAC,sBAAsB,CAACA;wBAEpC,KAAK;4BACJ,MAAM,IAAIkI,YAAYnC,mBAAmB9C,eAAe,cAAc,EAAE;gCAAC;6BAAsB;wBAEhG,KAAK;4BACJ,OAAO,IAAI,CAAC,6BAA6B,CAACjD;wBAE3C,KAAK;4BACJ,OAAO,IAAI,CAAC,oBAAoB,CAACA;wBAElC,KAAK;4BACJ,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAACA,KAAK,UAAU,IAAI,IAAI,CAAC,KAAK,CAACA,KAAK,SAAS;wBAEvF,KAAK;4BACJ,IAAIA,AAAqB,iBAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAI8K,MAAO,4BAA4C,OAAjB9K,KAAK,MAAM,CAAC,IAAI,EAAC;4BAG9D,IAAIA,AAAqB,eAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAI8K,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;gCAAC;6BAA6B;4BAOjG,IAAIjD,AAAqB,cAArBA,KAAK,MAAM,CAAC,IAAI,EACnB,MAAM,IAAI8K,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;gCAAC;6BAAsB;4BAE1F,IAAMiI,cAAc,IAAI,CAAC,KAAK,CAAClL,KAAK,MAAM;4BAG1C,IAAMyG,OAAOzG,KAAK,SAAS,CAAC,MAAM,GAAGA,KAAK,SAAS,CAAC,GAAG,CAAC,SAACmL,GAAG;uCAAK,MAAK,KAAK,CAACA;iCAAQ,EAAE;4BACtF,IAAI,CAAC,yBAAyB,CAACD,aAAazE;4BAE5C,OAAO,WAAIyE,aAAY,8BAAGzE;wBAE3B,KAAK;4BACJ,OAAO,IAAI,CAAC,KAAK,CAACzG,KAAK,UAAU;wBAElC,KAAK;4BACJ,OAAO,IAAI,CAAC,qBAAqB,CAACA;wBAEnC,KAAK;4BACJ,MAAM,IAAIkI,YAAYnC,mBAAmB9C,eAAe,cAAc,EAAE;gCAAC;6BAAoB;wBAE9F,KAAK;4BACJ,MAAM,IAAIiF,YAAYnC,mBAAmB9C,eAAe,cAAc,EAAE;gCAAC;6BAAmB;wBAE7F;4BACC,IAAImI,UAAU,IAAI,CAAC,MAAM,CAAC,KAAK,CAACpL,KAAK,KAAK,EAAEA,KAAK,GAAG;4BAEpD,IAAIoL,QAAQ,MAAM,GAAG,IACpBA,UAAUA,QAAQ,KAAK,CAAC,GAAG,MAAM;4BAGlC,MAAM,IAAIlD,YAAa,IAAW,OAARkD,SAAQ,OAAK,MAAMrF,mBAAmB9C,eAAe,iBAAiB,EAAE;gCAACmI;6BAAQ;oBAE7G;gBACD,SAAU;oBACT,IAAI,CAAC,eAAe;gBACrB;YACD;;;YAOAC,KAAAA;mBAAAA,SAAuBrL,IAAI;gBAC1B,IAAMsL,KAAKtL,KAAK,QAAQ;gBACxB,IAAMwC,OAAO,IAAI,CAAC,KAAK,CAACxC,KAAK,IAAI;gBACjC,IAAMyC,QAAQ,IAAI,CAAC,KAAK,CAACzC,KAAK,KAAK;gBACnC,IAAIsL,AAAO,QAAPA,MAAe,CAAgB,YAAhB,OAAO9I,QAAqB,AAAiB,YAAjB,OAAOC,KAAiB,GACtE;oBAAA,IAAIrB,OAAOoB,MAAM,MAAM,GAAGpB,OAAOqB,OAAO,MAAM,GAAGe,mBAChD,MAAM,IAAI5D,WAAW;gBACtB;gBAED,IAAI2I,AAAAA,CAAgB,WAAT/F,OAAAA,cAAP+F,SAAO/F,KAAI,MAAK,YAAY+F,AAAAA,CAAiB,WAAV9F,QAAAA,cAAP8F,SAAO9F,MAAK,MAAK,UAAU;oBAC1D,IAAI6I,AAAO,SAAPA,MAAgB7I,CAAAA,QAAQiB,uBAAuBjB,QAAQ,EAAC,GAC3D,MAAM,IAAI7C,WAAY,yCAA4D,OAApB8D;oBAE/D,IAAM6H,WAAW/I,KAAK,QAAQ,CAAC,GAAG,MAAM;oBACxC,IAAMgJ,YAAY/I,MAAM,QAAQ,CAAC,GAAG,MAAM;oBAC1C,IACE6I,AAAO,SAAPA,MAAeC,WAAWjM,OAAOmD,SAASkB,mBAC1C2H,AAAO,SAAPA,MAAe7I,QAAQgJ,OAAO9H,oBAC9B2H,AAAO,SAAPA,MAAe7I,SAAS,EAAE,IAAI8I,WAAWjM,OAAOmD,SAASkB,mBACzD2H,AAAO,QAAPA,MAAcC,WAAWC,YAAY7H,mBACpC2H,AAAAA,CAAAA,AAAO,QAAPA,MAAcA,AAAO,QAAPA,EAAS,KAAMI,KAAK,GAAG,CAACH,UAAUC,aAAa,IAAI7H,iBAEnE,MAAM,IAAI/D,WAAW;gBAEvB;gBAEA,IAAM+L,QAAQrC,qBAAqB,GAAG,CAACgC;gBACvC,IAAIK,AAAUnM,WAAVmM,OACH,OAAOA,MAAMnJ,MAAMC;gBAGpB,MAAM,IAAIyF,YAAa,yBAAsC,OAAdlI,KAAK,QAAQ;YAC7D;;;YASA4L,KAAAA;mBAAAA,SAAoBnF,IAAI;gBACvB,IAAI,AAAmB,YAAnB,OAAOA,IAAI,CAAC,EAAE,IAAiBA,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG3C,0BACnD,MAAM,IAAIlE,WAAW;gBAEtB,IAAI,AAAmB,YAAnB,OAAO6G,IAAI,CAAC,EAAE,IAAiBA,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG1C,yBACnD,MAAM,IAAInE,WAAW;gBAEtByG,wBAAwBI,IAAI,CAAC,EAAE;YAChC;;;YAEAoF,KAAAA;mBAAAA,SAA0BX,WAAW,EAAEzE,IAAI;oBAQqBqF;gBAP/D,IAAIZ,gBAAgBzF,QACnB,IAAI,CAAC,mBAAmB,CAACgB;gBAE1B,IAAMsF,OAAOtF,IAAI,CAAC,EAAE;gBACpB,IAAIyE,gBAAgB9B,SAAS3C,AAAgB,MAAhBA,KAAK,MAAM,IAAU,AAAgB,YAAhB,OAAOsF,QAAqBA,OAAOzI,kBACpF,MAAM,IAAI1D,WAAW;gBAEtB,IAAIsL,gBAAgB/B,eAAgB4C,CAAAA,OAAOxI,oBAAoBuI,AAAAA,SAAAA,CAAAA,SAAAA,IAAI,CAAC,EAAE,AAAD,IAANA,KAAAA,IAAAA,OAAS,aAAa,AAAD,IAAIvI,gBAAe,GACtG,MAAM,IAAI3D,WAAW;gBAEtB,IAAIsL,gBAAgBc,YAAgBrF,YAAJoF,MAAgB5C,gBAAe4C,KAAK,UAAU,GAAGxI,kBAChF,MAAM,IAAI3D,WAAW;gBAEtB,IAAIsL,gBAAgB/F,OAAO+F,gBAAgB/K,KAAK;wBACwC8L;oBAAvF,IAAMC,iBAAiB,AAAgB,YAAhB,OAAOH,QAAqB3C,MAAM,OAAO,CAAC2C,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,iBAAiB5I,kBAC1D,MAAM,IAAI1D,WAAW;gBAEvB;gBACA,IAAImF,wBAAwBmG,cAAc;oBACzC,IAAIiB;oBACJ,IAAQxF,YAAJoF,MAAgB5C,cAAa;4BACjBiD;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,IAAKnB,YAAY,iBAAiB;wBACrGiB,aAAaI,eAAerB,YAAY,iBAAiB;oBAC1D,OAAO;4BACiDsB;wBAAvD,IAAMC,gBAAe,AAAgB,YAAhB,OAAOV,OAAoBA,OAAOS,QAAAA,CAAAA,eAAAA,QAAAA,OAAAA,KAAAA,IAAAA,KAAM,MAAM,AAAD,IAAXA,eAAgB;wBACvEL,aAAaM,gBAAevB,YAAY,iBAAiB;oBAC1D;oBACA,IAAIiB,aAAa5I,kBAChB,MAAM,IAAI3D,WAAW;gBAEvB;YACD;;;YAOA8M,KAAAA;mBAAAA,SAAwB1M,IAAI;gBAC3B,OAAQA,KAAK,QAAQ;oBACpB,KAAK;wBACJ,IAAMwC,OAAO,IAAI,CAAC,KAAK,CAACxC,KAAK,IAAI;wBACjC,OAAOwC,OAAO,IAAI,CAAC,KAAK,CAACxC,KAAK,KAAK,IAAIwC;oBAExC,KAAK;wBACJ,IAAMmK,QAAO,IAAI,CAAC,KAAK,CAAC3M,KAAK,IAAI;wBACjC,OAAO2M,QAAOA,QAAO,IAAI,CAAC,KAAK,CAAC3M,KAAK,KAAK;oBAE3C,KAAK;wBACJ,IAAM4M,QAAO,IAAI,CAAC,KAAK,CAAC5M,KAAK,IAAI;wBACjC,OAAO4M,QAAAA,QAAsCA,QAAO,IAAI,CAAC,KAAK,CAAC5M,KAAK,KAAK;oBAE1E;wBACC,MAAM,IAAIkI,YAAa,iCAA8C,OAAdlI,KAAK,QAAQ;gBAEtE;YACD;;;YAMA6M,KAAAA;mBAAAA,SAAsB7M,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,OAAOuI,SAAO,IAAI,CAAC,KAAK,CAACvI,KAAK,QAAQ;oBAEvC,KAAK;wBACJ,OAAO,KAAK,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;oBAErC,KAAK;wBACJ,MAAM,IAAIkI,YAAYnC,mBAAmB9C,eAAe,cAAc,EAAE;4BAAC;yBAAkB;oBAE5F;wBACC,MAAM,IAAIiF,YAAa,+BAA4C,OAAdlI,KAAK,QAAQ;gBAEpE;YACD;;;YAMA8M,KAAAA;mBAAAA,SAAiB9M,IAAI;gBACpB,IAAMqF,OAAOrF,KAAK,IAAI;gBAGtB,IAAM+M,SAAS,IAAI,CAAC,MAAM;gBAC1B,IAAK,IAAInM,IAAI,GAAGA,IAAImM,OAAO,MAAM,EAAEnM,IAAK;oBACvC,IAAM4I,QAAQuD,MAAM,CAACnM,EAAE;oBACvB,IAAIjD,OAAO,MAAM,CAAC6L,OAAOnE,OACxB,OAAOmE,KAAK,CAACnE,KAAK;gBAEpB;gBAEA,MAAM,IAAI2H,eAAejH,mBAAmB9C,eAAe,cAAc,EAAE;oBAACoC;iBAAK;YAClF;;;YAMA4H,KAAAA;mBAAAA,SAAuBjN,IAAI;oBAAEkN,cAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAcpH;gBAC1C,IAAMgD,SAASoE,gBAAgBpH,YAAY,IAAI,CAAC,KAAK,CAAC9F,KAAK,MAAM,IAAIkN;gBAErE,IAAMC,mBAAmBnN,AAAuB,iBAAvBA,KAAK,QAAQ,CAAC,IAAI,IAAqB,CAACA,KAAK,QAAQ;gBAC9E,IAAMoN,WAAWD,mBAAmBnN,KAAK,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;gBAMjF,IAAIoN,AAAa,YAAbA,YAA8BzG,YAANmC,QAAkBgC,QAC7C,MAAM,IAAIA,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAAwB;gBAG5F,IAAI6F,QAAAA,QAAyC;oBAE5C,IAAI9I,KAAK,QAAQ,EAChB;oBAED,MAAM,IAAIiJ,UAAUlD,mBAAmB9C,eAAe,qBAAqB,EAAE;wBAAC6F;wBAAQsE;qBAAS;gBAChG;gBAKA,IAAMvC,SAAS/B,MAAM,CAACsE,SAAS;gBAQ/B,IAAIvC,WAAWwC,YAAYxC,WAAWwC,SAAS,SAAS,EACvD,MAAM,IAAIvC,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAQ3F,IAAMqK,YAAYxE,OAAO,SAAS;gBAClC,IAAIwE,AAAc9N,WAAd8N,aAA2BzC,WAAWyC,WACzC,MAAM,IAAIxC,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAAiC;gBAGrG,OAAO4H;YACR;;;YAMA0C,KAAAA;mBAAAA,SAAsBvN,IAAI;gBACzB,IAAM6K,SAAS,EAAE;gBAEjB,IAAK,IAAIjK,IAAI,GAAGA,IAAIZ,KAAK,QAAQ,CAAC,MAAM,EAAEY,IAAK;oBAC9C,IAAM4M,UAAUxN,KAAK,QAAQ,CAACY,EAAE;oBAIhC,IAAI4M,AAAY,SAAZA,SAAkB;wBACrB3C,OAAO,MAAM;wBACb;oBACD;oBAEA,IAAM7F,QAAQ,IAAI,CAAC,KAAK,CAACwI;oBAEzB,IAAIA,AAAiB,oBAAjBA,QAAQ,IAAI,EAAsB;4BAErCC;wBADA,IAAI,CAAC,mBAAmB,CAAC5C,OAAO,MAAM,EAAE7F;wBACxCyI,CAAAA,UAAAA,MAAK,EAAE,IAAI,OAAXA,SAAY,8BAAGzI;oBAChB,OACC6F,OAAO,IAAI,CAAC7F;gBAEd;gBAEA,OAAO6F;YACR;;;YAEA6C,KAAAA;mBAAAA,SAAoBC,aAAa,EAAE3I,KAAK;gBACvC,IAAM+G,OAAO,AAAiB,YAAjB,OAAO/G,SAAsBoE,MAAM,OAAO,CAACpE,SAASA,MAAM,MAAM,GAAGA,QAAAA,QAAAA,KAAAA,IAAAA,MAAO,IAAI;gBAC3F,IAAI,AAAgB,YAAhB,OAAO+G,QAAqB4B,gBAAgB5B,OAAOzI,kBACtD,MAAM,IAAI1D,WAAW;YAEvB;;;YAMAgO,KAAAA;mBAAAA,SAAuB5N,IAAI;gBAC1B,IAAMpC,MAAM,CAAC;gBACb,IAAIiQ,sBAAsB;oBACrB/M,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAcd,KAAK,UAAU,qBAA7Bc,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA+B;wBAA/BA,IAAMjD,OAANiD,MAAAA,KAAAA;wBACJ,IAAIjD,AAAc,oBAAdA,KAAK,IAAI,EAAsB;4BAClC,IAAMiQ,cAAc,IAAI,CAAC,KAAK,CAACjQ,KAAK,QAAQ;4BAC5CgQ,uBAAuBlQ,OAAO,IAAI,CAACmQ,aAAa,MAAM;4BACtD,IAAID,sBAAsBvK,kBACzB,MAAM,IAAI1D,WAAW;4BAEtBjC,OAAO,MAAM,CAACC,KAAKkQ;4BACnB;wBACD;wBAOA,IAAMpQ,MAAMG,KAAK,QAAQ,GAAG,IAAI,CAAC,KAAK,CAACA,KAAK,GAAG,IAAIA,KAAK,GAAG,CAAC,IAAI,IAAIA,KAAK,GAAG,CAAC,KAAK;wBAClF,IAAMmH,QAAQ,IAAI,CAAC,KAAK,CAACnH,KAAK,KAAK;wBACnC,IAAIA,KAAK,QAAQ,EAChBF,OAAO,cAAc,CAACC,KAAKF,KAAK;4BAAEsH,OAAAA;4BAAO,UAAU;4BAAM,YAAY;4BAAM,cAAc;wBAAK;6BAE9FpH,GAAG,CAACF,IAAI,GAAGsH;oBAEb;;oBAvBKlE,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAwBL,OAAOlD;YACR;;;YAEAmQ,KAAAA;mBAAAA,SAAoB/N,IAAI;gBACvB,OAAO,IAAI,CAAC,KAAK,CAACA,KAAK,QAAQ;YAChC;;;YAQAgO,KAAAA;mBAAAA,SAA8BhO,IAAI;;oBAO5Bc,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;oBAAL,QAAKA,YAAed,KAAK,MAAM,qBAA1Bc,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAA4B;wBAA5BA,IAAMmN,QAANnN,MAAAA,KAAAA;wBACJ,IAAImN,AAAe,iBAAfA,MAAM,IAAI,EACb,MAAM,IAAI/F,YAAYnC,mBAAmB9C,eAAe,cAAc,EAAE;4BAAC;yBAA8C;oBAEzH;;oBAJKnC,oBAAAA;oBAAAA,iBAAAA;;;6BAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;4BAAAA,mB,MAAAA;;;gBAKL,OAAO;qDAAI2F,OAAAA,IAAAA,MAAAA,OAAAA,OAAAA,GAAAA,OAAAA,MAAAA,OAAAA,IAAI,CAAJA,KAAAA,GAAAA,SAAAA,CAAAA,KAAAA;oBAEV,IAAMyH,WAAW,CAAC;oBAClB,IAAMC,aAAanO,KAAK,MAAM,CAAC,MAAM;oBACrC,IAAK,IAAIY,IAAI,GAAGA,IAAIuN,YAAYvN,IAC/BsN,QAAQ,CAAClO,KAAK,MAAM,CAACY,EAAE,CAAC,IAAI,CAAC,GAAG6F,IAAI,CAAC7F,EAAE;oBAOxC,MAAK,MAAM,CAAC,OAAO,CAACsN;oBACpB,IAAI;wBACH,IAAMrD,SAAS,MAAK,KAAK,CAAC7K,KAAK,IAAI;wBACnC,MAAK,sBAAsB,CAAC6K;wBAC5B,OAAOA;oBACR,SAAU;wBACT,MAAK,MAAM,CAAC,KAAK;oBAClB;gBACD;YACD;;;YAEAuD,KAAAA;mBAAAA,SAAuBpJ,KAAK;gBAC3B,IAAgCqJ,qBAAAA,kBAAkBrJ,OAAO,mCAAjD2D,WAAwB0F,mBAAxB1F,QAAQ,EAAEC,YAAcyF,mBAAdzF,SAAS;gBAC3B,IAAI,CAAC,iBAAiB,IAAID;gBAC1B,IAAI,CAAC,kBAAkB,IAAIC;gBAC3B,IAAI,IAAI,CAAC,iBAAiB,GAAG,KAAK,IAAI,CAAC,kBAAkB,GAAG,GAC3D,MAAM,IAAIhJ,WAAW;YAEvB;;;YAMA0O,KAAAA;mBAAAA,SAAqBtO,IAAI;;gBACxB,IAAMuO,aAAavO,KAAK,QAAQ,IAAKA,AAAqB,uBAArBA,KAAK,MAAM,CAAC,IAAI,IAA2BA,KAAK,MAAM,CAAC,QAAQ;gBACpG,IAAIuG;gBACJ,IAAIC,SAAS;gBAEb,IAAIxG,AAAqB,uBAArBA,KAAK,MAAM,CAAC,IAAI,EAAyB;oBAO5CwG,SAAS,IAAI,CAAC,KAAK,CAACxG,KAAK,MAAM,CAAC,MAAM;oBACtCuG,OAAO,IAAI,CAAC,sBAAsB,CAACvG,KAAK,MAAM,EAAEwG;gBACjD,OACCD,OAAO,IAAI,CAAC,KAAK,CAACvG,KAAK,MAAM;gBAG9B,IAAKuG,QAAAA,QAAwCgI,YAC5C;gBAGD,IAAIhI,SAAS8G,UACZ,MAAM,IAAIvC,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAS3F,IAAI,AAAgB,cAAhB,OAAOsD,QAAuBA,SAASuE,MAAM,iBAAiB,EACjE,MAAM,IAAIA,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAA0B;gBAG9F,IAAMuL,cAAcxE,oBAAoB,GAAG,CAACzD;gBAC5C,IAAIiI,AAAgBhP,WAAhBgP,aACH,MAAM,IAAI1D,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAACuL;iBAAY;gBAKhF,IAAIvJ,qBAAqB,GAAG,CAACsB,OAC5B,MAAM,IAAIuE,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAE,wBAAsD,OAA/BgC,qBAAqB,GAAG,CAACsB;iBAAQ;gBAI7H,IAAME,OAAQ;oBACb,IAAIzG,AAA0B,MAA1BA,KAAK,SAAS,CAAC,MAAM,EACxB,OAAO,EAAE;oBAGV,IAAI6K,SAAS,EAAE;oBAEf,IAAK,IAAIjK,IAAI,GAAGA,IAAIZ,KAAK,SAAS,CAAC,MAAM,EAAEY,IAAK;wBAC/C,IAAM4M,UAAUxN,KAAK,SAAS,CAACY,EAAE;wBACjC,IAAMoE,QAAQ,MAAK,KAAK,CAACwI;wBAEzB,IAAIA,AAAiB,oBAAjBA,QAAQ,IAAI,EAAsB;gCAErCC;4BADA,MAAK,mBAAmB,CAAC5C,OAAO,MAAM,EAAE7F;4BACxCyI,CAAAA,UAAAA,MAAK,EAAE,IAAI,OAAXA,SAAY,8BAAGzI;wBAChB,OACC6F,OAAO,IAAI,CAAC7F;oBAEd;oBAEA,OAAO6F;gBACR;gBAMA,IAAIpE,KAAK,IAAI,CAAC,SAAC0E,GAAG;2BAAKA,QAAQkC;oBAC9B,MAAM,IAAIvC,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAAuB;gBAE3F,IAAI,AAAkB,YAAlB,OAAOuD,QAAqB;oBAC/B,IAAIpF,OAAO,SAAS,CAAC,MAAM,IAAImF,SAASnF,OAAO,SAAS,CAAC,MAAM,IAAIoF,OAAO,MAAM,GAAGlH,OAAOmH,IAAI,CAAC,EAAE,IAAIjD,mBACpG,MAAM,IAAI5D,WAAW;oBAEtB,IAAKwB,AAAAA,CAAAA,OAAO,SAAS,CAAC,QAAQ,IAAImF,SAASnF,OAAO,SAAS,CAAC,QAAQ,IAAImF,SAASnF,OAAO,SAAS,CAAC,MAAK,KAAM9B,OAAOmH,IAAI,CAAC,EAAE,IAAIjD,mBAC9H,MAAM,IAAI5D,WAAW;oBAEtB,IAAIwB,OAAO,SAAS,CAAC,MAAM,IAAImF,SAASnF,OAAO,SAAS,CAAC,MAAM,EAAE;wBAChE,IAAMqN,eAAejI,OAAO,MAAM,GAAGC,KAAK,MAAM,CAAC,SAACiI,MAAM,EAAE1J,KAAK;mCAAK0J,SAAStN,OAAO4D,OAAO,MAAM;2BAAE;wBACnG,IAAIyJ,eAAejL,mBAClB,MAAM,IAAI5D,WAAW;oBAEvB;oBACA,IAAKwB,OAAO,SAAS,CAAC,OAAO,IAAImF,SAASnF,OAAO,SAAS,CAAC,OAAO,IAAMA,OAAO,SAAS,CAAC,UAAU,IAAImF,SAASnF,OAAO,SAAS,CAAC,UAAU,EAAG;wBAC7I,IAAM8F,MAAMX,SAASnF,OAAO,SAAS,CAAC,UAAU;wBAChD,IAAM6F,SAASR,IAAI,CAAC,EAAE;wBACtB,IAAMkI,cAAclI,IAAI,CAAC,EAAE;wBAC3B,IAAI,AAAuB,cAAvB,OAAOkI,aACV,MAAM,IAAI7D,MAAM;wBAQjB,IAAI,AAAuB,YAAvB,OAAO6D,eAA4B,6BAAgB,IAAI,CAACA,cAC3D,MAAM,IAAI7D,MAAM;wBAEjB,IAAI8D;wBACJ,IAAI,AAAkB,YAAlB,OAAO3H,QAAqB;4BAC/B,IAAIT,OAAO,MAAM,GAAGkF,KAAK,GAAG,CAAC,GAAGzE,OAAO,MAAM,IAAI,UAChD,MAAM,IAAIrH,WAAW;4BAEtBgP,aAAa5H,oBAAoBR,QAAQS,QAAQC;wBAClD,OAKC0H,aALgBjI,YAANM,QAAkBxB,UAKf4B,mBAAmBb,QAAQS,QAAQC,OAAOD,OAAO,KAAK,CAAC,QAAQ,CAAC,QAEhE;wBAEd,IAAIT,OAAO,MAAM,GAAGoI,aAAaxN,OAAOuN,aAAa,MAAM,GAAGnL,mBAC7D,MAAM,IAAI5D,WAAW;oBAEvB;oBACA,IAAI2G,SAASnF,OAAO,SAAS,CAAC,KAAK,EAAE;wBACpC,IAAIqF,AAAY,OAAZA,IAAI,CAAC,EAAE,IAAWD,OAAO,MAAM,GAAGlD,kBACrC,MAAM,IAAI1D,WAAW;wBAEtB,IAAI,AAAmB,YAAnB,OAAO6G,IAAI,CAAC,EAAE,IAAiBA,AAAY,OAAZA,IAAI,CAAC,EAAE,IAAWO,oBAAoBR,QAAQC,IAAI,CAAC,EAAE,EAAE,SAASnD,kBAClG,MAAM,IAAI1D,WAAW;wBAKtB,IAAW+G,YAAPF,IAAI,CAAC,EAAEE,EAAYlB,WAAU4B,mBAAmBb,QAAQC,IAAI,CAAC,EAAE,EAAE,SAASnD,kBAC7E,MAAM,IAAI1D,WAAW;oBAEvB;gBACD;gBACA,IAAI2G,SAASd,QACZ,IAAI,CAAC,mBAAmB,CAACgB;gBAM1BH,2BAA2BC,MAAMC,QAAQC;gBACzC,IAAKD,AAAAA,CAAAA,WAAW4C,SAASrE,wBAAwByB,OAAM,KAAMD,SAASC,OAAO,IAAI,EAAE;oBAClF,IAAMqI,SAASpI,IAAI,CAAC,EAAE;wBAC6DqI;oBAAnF,IAAM/C,OAAO,AAAkB,YAAlB,OAAO8C,UAAuBzF,MAAM,OAAO,CAACyF,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,OAAO9C,QAAqBA,OAAOzI,kBACtC,MAAM,IAAI1D,WAAW;gBAEvB;gBAEA,IAAI,AAAgB,cAAhB,OAAO2G,MAAqB;oBAC/B,IAAMwI,eAAeC,cAAchP,KAAK,MAAM;oBAC9C,MAAM,IAAIiJ,UAAUlD,mBAAmB9C,eAAe,eAAe,EAAE;wBAAC8L;qBAAa;gBACtF;gBAEA,IAAMlE,SAAStE,KAAK,KAAK,CAACC,QAAQC;gBAKlC,IAAUE,YAANkE,QAAkBE,UACrB,MAAM,IAAID,MAAM/E,mBAAmB9C,eAAe,cAAc,EAAE;oBAAC;iBAAsC;gBAG1G,OAAO4H;YACR;;;YAOAoE,KAAAA;mBAAAA,SAAsBjP,IAAI;gBACzB,IAAI6K,SAAS;gBACb,IAAMqE,kBAAkBlP,KAAK,WAAW,CAAC,MAAM;gBAE/C,IAAK,IAAIY,IAAI,GAAGA,IAAIZ,KAAK,MAAM,CAAC,MAAM,EAAEY,IAAK;oBAC5CiK,UAAU7K,KAAK,MAAM,CAACY,EAAE,CAAC,KAAK,CAAC,GAAG;oBAClC,IAAIA,IAAIsO,iBACPrE,UAAU,IAAI,CAAC,KAAK,CAAC7K,KAAK,WAAW,CAACY,EAAE;gBAE1C;gBAEA,OAAOiK;YACR;;;;YA5vBOF,KAAAA;mBAAP,SAAgB9C,UAAU,EAAE5B,OAAO;gBAClC,IAAMkJ,YAAY,IAnDP9E,UAmDqBpE;gBAChC,OAAOkJ,UAAU,QAAQ,CAACtH;YAC3B;;;WArDYwC;;AAszBN,SAAS2E,cAAchP,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,SAACoP,KAAK;uBAAMA,AAAU,SAAVA,QAAiB,KAAKJ,cAAcI;eAAS,IAAI,CAAC,MAAK;QAEjG,KAAK;YAEJ,IAAIpP,AAA2B,MAA3BA,KAAK,UAAU,CAAC,MAAM,EACzB,OAAO;YAGR,OAAO;QAER,KAAK;YACJ,IAAMqP,YAAYL,cAAchP,KAAK,MAAM;YAC3C,IAAMsP,cAAcN,cAAchP,KAAK,QAAQ;YAE/C,IAAIA,KAAK,QAAQ,EAChB,OAAQ,GAAesP,MAAAA,CAAbD,WAAU,KAAe,OAAZC,aAAY;YAEpC,OAAQ,GAAeA,MAAAA,CAAbD,WAAU,KAAe,OAAZC;QAExB;YACC,OAAO;IAET;AACD;ACz2CC;;;;;;;;;;;;;;;;;AACD,IAAMC,8BAA8B;AACpC,IAAMC,mCAAmC;AACzC,IAAMC,qBAAqB;AAC3B,IAAMC,0BAA0B;AAEhC,SAAS7I,6BAAc7B,KAAK,EAAEK,IAAI,EAAEyB,YAAY,EAAEC,OAAO;IACxD,IAAI/B,AAAUxF,WAAVwF,OACH,OAAO8B;IAER,IAAI,CAACxH,OAAO,aAAa,CAAC0F,UAAUA,QAAQ,KAAKA,QAAQ+B,SACxD,MAAM,IAAInH,WAAY,GAA2CmH,MAAAA,CAAzC1B,MAAK,sCAA4C,OAAR0B;IAElE,OAAO/B;AACR;AAEA,IAAM2K,gCAAcA,WAAAA,GAApB;;aAAMA;YAQOpF,UAAAA,UAAAA,MAAAA,GAAAA,KAAAA,AAAAA,KAAAA,MAAAA,SAAAA,CAAAA,EAAAA,GAAAA,SAAAA,CAAAA,EAAAA,GAAU,CAAC;8CARlBoF;QASJpF,QAAAA,WAAAA,CAAAA,UAAY,CAAC;QACb,IAAI,CAAC,iBAAiB,GAAG1D,6BAAc0D,QAAQ,iBAAiB,EAAE,qBAAqBgF,6BAA6BC;QACpH,IAAI,CAAC,SAAS,GAAG3I,6BAAc0D,QAAQ,SAAS,EAAE,aAAakF,oBAAoBC;QACnF,IAAInF,AAA4B/K,WAA5B+K,QAAQ,eAAe,IAAmB,CAAmC,YAAnC,OAAOA,QAAQ,eAAe,IAAiBA,AAAmC,MAAnCA,QAAQ,eAAe,CAAC,MAAM,IAAUA,QAAQ,eAAe,CAAC,MAAM,GAAG,GAAE,GACvK,MAAM,IAAItB,UAAU;QAErB,IAAIsB,AAA0B/K,WAA1B+K,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,IAAItB,UAAU;QAGrB,IAAI,CAAC,SAAS,GAAGsB,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;;gCA3BhDoF,gBAAAA;;YAmCLC,KAAAA;mBAAAA,SAAM5J,QAAQ;;gBAEb,IAAI,AAAoB,YAApB,OAAOA,UACV,MAAM,IAAIiD,UAAU;gBAErB,IAAIjD,SAAS,MAAM,GAAG,IAAI,CAAC,iBAAiB,EAC3C,MAAM,IAAIpG,WAAY,0CAAgE,OAAvB,IAAI,CAAC,iBAAiB,EAAC;gBAGvF,IAAMiQ,SAAS,EAAE;gBACjB,IAAMC,YAAY,SAACC,KAAK;oBACvB,IAAIF,OAAO,MAAM,IAAI,MAAK,SAAS,EAClC,MAAM,IAAIjQ,WAAY,+CAA6D,OAAf,MAAK,SAAS;oBAEnFiQ,OAAO,IAAI,CAACE;gBACb;gBACA,IAAMrB,SAAS1I,SAAS,MAAM;gBAG9B,IAAIgK,QAAQ;gBACZ,IAAIC,SAAS;gBACb,IAAIC,eAAe;gBACnB,IAAI7R,MAAM;gBAEV,IAAI8R,eAAe;gBAGnB,MAAO9R,MAAMqQ,OAAQ;oBACpB,IAAM0B,OAAOpK,QAAQ,CAAC3H,IAAI;oBAC1B,IAAMgS,WAAWrK,QAAQ,CAAC3H,MAAM,EAAE;oBAGlC,OAAQ2R;wBAEP,KAAK;4BAEJ,IAAI,IAAI,CAAC,QAAQ,CAAC3R,KAAK2H,UAAU,IAAI,CAAC,SAAS,GAAG;gCAEjD,IAAIiK,OAAO,MAAM,GAAG,GAAG;oCACtBH,UAAU;wCAAE,MAAM;wCAAQ,OAAOG;wCAAQ,OAAO5R,MAAM4R,OAAO,MAAM;wCAAE,KAAK5R;oCAAI;oCAC9E4R,SAAS;gCACV;gCAEAD,QAAQ;gCACRE,eAAe7R;gCACf8R,eAAe;gCACf9R,OAAO,IAAI,CAAC,QAAQ;gCACpB;4BACD;4BAEA4R,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,QAATA,QAAgB,IAAI,CAAC,gBAAgB,CAACD,eAKhDH,QAAQ;iCACF,IAAII,AAAS,SAATA,MAEYJ,QAAlBK,AAAa,QAAbA,WAA0B,cACrBA,AAAa,QAAbA,WAA0B,cAC1BA,AAAa,QAAbA,WAA0B,oBACtB;iCACP,IAAI,IAAI,CAAC,QAAQ,CAAChS,KAAK2H,UAAU,IAAI,CAAC,OAAO,GAAG;gCAEtD,IAAMsK,YAAY,IAAI,CAAC,kBAAkB,GAAGL,SAASA,OAAO,IAAI;gCAChE,IAAIK,UAAU,MAAM,GAAG,GACtBR,UAAU;oCACT,MAAM;oCACN,OAAOQ;oCACP,OAAOJ;oCACP,KAAK7R,MAAM,IAAI,CAAC,MAAM;oCACtB,cAAc6R,eAAe,IAAI,CAAC,QAAQ;oCAC1C,YAAY7R;gCACb;gCAGD4R,SAAS;gCACTD,QAAQ;gCACR3R,OAAO,IAAI,CAAC,MAAM;gCAClB;4BACD;4BAGA,IAAI,CAAC,mBAAM,IAAI,CAAC+R,OACfD,eAAeC;4BAEhBH,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;wBAED,KAAK;4BACJ,IAAIA,AAAS,SAATA,MACHJ,QAAQ;iCACF,IAAII,AAAS,QAATA,MAEVJ,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;wBAED,KAAK;4BACJC,UAAUG;4BACVJ,QAAQ;4BACR;oBACF;oBAGA3R;gBACD;gBAIA,IAAI4R,OAAO,MAAM,GAAG,GACnB,IAAID,AAAU,WAAVA,OAEHF,UAAU;oBAAE,MAAM;oBAAQ,OAAOG;oBAAQ,OAAO5R,MAAM4R,OAAO,MAAM;oBAAE,KAAK5R;gBAAI;qBACxE;oBAEN,IAAMkS,iBAAiB,IAAI,CAAC,SAAS,GAAGN;oBACxCH,UAAU;wBAAE,MAAM;wBAAQ,OAAOS;wBAAgB,OAAOL;wBAAc,KAAK7R;oBAAI;gBAChF;gBAGD,OAAOwR;YACR;;;YASAW,KAAAA;mBAAAA,SAAiBC,IAAI;gBACpB,OAAOA,AAAS,OAATA,QAAe,uBAAuB,QAAQ,CAACA;YACvD;;;YAUAC,KAAAA;mBAAAA,SAASrS,GAAG,EAAE2H,QAAQ,EAAE2K,QAAQ;gBAE/B,IAAItS,MAAMsS,SAAS,MAAM,GAAG3K,SAAS,MAAM,EAC1C,OAAO;gBAIR,IAAK,IAAIpF,IAAI,GAAGA,IAAI+P,SAAS,MAAM,EAAE/P,IACpC,IAAIoF,QAAQ,CAAC3H,MAAMuC,EAAE,KAAK+P,QAAQ,CAAC/P,EAAE,EACpC,OAAO;gBAIT,OAAO;YACR;;;;YAQOgP,KAAAA;mBAAP,SAAa5J,QAAQ,EAAEuE,OAAO;gBAC7B,IAAMqG,SAAS,IAtRXjB,eAsR8BpF;gBAClC,OAAOqG,OAAO,KAAK,CAAC5K;YACrB;;;WAxRK2J;;;;;;ACfN,IAAMkB,mCAAmC;AACzC,IAAMC,2BAA2B;AACjC,IAAMC,qCAAqC;AAC3C,IAAMC,6BAA6B;AAEnC,SAASnK,kBAAc7B,KAAK,EAAEK,IAAI,EAAEyB,YAAY,EAAEC,OAAO;IACxD,IAAI/B,AAAUxF,WAAVwF,OACH,OAAO8B;IAER,IAAI,CAACxH,OAAO,aAAa,CAAC0F,UAAUA,QAAQ,KAAKA,QAAQ+B,SACxD,MAAM,IAAInH,WAAY,GAA2CmH,MAAAA,CAAzC1B,MAAK,sCAA4C,OAAR0B;IAElE,OAAO/B;AACR;AAUO,SAASiM,eAAepJ,UAAU,EAAE5B,OAAO;IACjD,OAAOoE,oBAAAA,QAAkB,CAACxC,YAAY5B;AACvC;AAaO,SAASiL,aAAalL,QAAQ,EAAEC,OAAO,EAAEkL,qBAAqB;IACpE,IAAM5G,UAAU4G,QAAAA,wBAAAA,wBAAyB,CAAC;IAC1C,IAAMC,iBAAiBvK,kBAAc0D,QAAQ,cAAc,EAAE,kBAAkBsG,kCAAkCC;IACjH,IAAMO,kBAAkBxK,kBAAc0D,QAAQ,eAAe,EAAE,mBAAmBwG,oCAAoCC;IACtH,IAAMnB,SAASF,8BAAAA,KAAoB,CAAC3J,UAAUuE;IAC9C,IAAIM,SAAS;IACb,IAAIqE,kBAAkB;IAStB,IAAMC,YAAY,IAAI9E,oBAAUpE,SAAS;QACxC,gBAAgBsE,QAAQ,mBAAmB;QAC3C,oBAAoBA,QAAQ,kBAAkB;IAC/C;IAEA,IAAM+G,cAAc;QACnB,MAAM,SAACvB,KAAK;mBAAKA,MAAM,KAAK;;QAC5B,YAAY,SAACA,KAAK;YACjB,IAAI;gBACH,OAAOZ,UAAU,QAAQ,CAACY,MAAM,KAAK;YACtC,EAAE,OAAO9H,OAAO;gBAEf,IAAStB,eAALsB,OAAiB+E,mBAAkB/E,MAAM,OAAO,CAAC,QAAQ,CAAC,mBAC7D,OAAO;gBAEP,MAAMA;YAER;QACD;IACD;QAEKnH,4BAAAA,MAAAA,oBAAAA,OAAAA,iBAAAA;;QAAL,QAAKA,YAAe+O,MAAM,CAANA,OAAAA,QAAAA,CAAAA,IAAf/O,OAAAA,CAAAA,CAAAA,4BAAAA,AAAAA,CAAAA,QAAAA,UAAAA,IAAAA,EAAAA,EAAAA,IAAAA,AAAAA,GAAAA,4BAAAA,KAAuB;YAAvBA,IAAMiP,QAANjP,MAAAA,KAAAA;gBAEYyQ;YAAhB,IAAMC,UAAUD,QAAAA,CAAAA,0BAAAA,WAAW,CAACxB,MAAM,IAAI,CAAC,AAAD,IAAtBwB,0BAA2BD,WAAW,CAAC,OAAO;YAC9D,IAAIvB,AAAe,iBAAfA,MAAM,IAAI,EAAmB;gBAChCb;gBACA,IAAIA,kBAAkBkC,gBACrB,MAAM,IAAIxR,WAAY,oDAAkE,OAAfwR;YAE3E;YAEA,IAAMK,QAAQrQ,OAAOoQ,QAAQzB;YAC7B,IAAIlF,OAAO,MAAM,GAAG4G,MAAM,MAAM,GAAGJ,iBAClC,MAAM,IAAIzR,WAAY,iDAAgE,OAAhByR,iBAAgB;YAEvFxG,UAAU4G;QACX;;QAfK3Q,oBAAAA;QAAAA,iBAAAA;;;iBAAAA,6BAAAA,AAAAA,QAAAA,UAAAA,MAAAA,EAAAA,UAAAA,MAAAA;;gBAAAA,mB,MAAAA;;;IAiBL,OAAO+J;AACR"}