@divmain/jdm-asm 0.2.0 → 0.2.3

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/compiler/errors.ts","../node_modules/acorn/dist/acorn.mjs","../src/compiler/utils.ts","../src/compiler/nodes/function.ts","../src/compiler/parser.ts","../src/compiler/graph.ts","../src/compiler/nodes/input.ts","../src/compiler/nodes/context-resolvers.ts","../src/compiler/nodes/expression-compiler.ts","../src/compiler/nodes/expression.ts","../src/compiler/unary-transform.ts","../src/compiler/nodes/decision-table.ts","../src/compiler/code-generators.ts","../src/compiler/nodes/switch.ts","../src/compiler/nodes/decision.ts","../src/compiler/compile-time-validation.ts","../src/compiler/switch-branch-detection.ts","../src/compiler/result-selection.ts","../src/compiler/orchestrator.ts","../src/compiler/cache.ts","../src/compiler/runtime/index.ts","../src/compiler/asc-compiler.ts","../src/compiler/virtual-fs.ts","../src/compiler/codegen/js-marshal.ts","../src/compiler/codegen/js-validation.ts","../src/compiler/runtime-codegen.ts","../src/compiler/runtime.ts","../src/compiler/build.ts","../src/compiler/schema.ts","../src/compiler/index.ts","../src/compiler/ast-types.ts","../src/compiler/expression-parser.ts","../src/compiler/cst-visitor.ts","../src/compiler/unary-ast-transforms.ts","../src/compiler/unary-parser.ts","../src/compiler/optimizer.ts","../src/compiler/runtime-validation-codegen.ts"],"sourcesContent":["/**\n * Error handling infrastructure for the JDM compiler.\n *\n * This module provides:\n * - CompilationError: The main error class for all compilation failures\n * - ErrorCode: A comprehensive enumeration of all possible error types\n * - SourceLocation: Detailed location information for error reporting\n * - ErrorCollector: Aggregates non-fatal expression errors for batch reporting\n */\n\n/**\n * Detailed source location for error reporting.\n */\nexport interface SourceLocation {\n  /** ID of the node where the error occurred */\n  nodeId?: string;\n  /** Name of the node where the error occurred */\n  nodeName?: string;\n  /** Field name within the node */\n  field?: string;\n  /** Line number in source JDM */\n  line?: number;\n  /** Column number in source JDM */\n  column?: number;\n}\n\n/**\n * Enumeration of all possible compilation error codes.\n *\n * Errors are categorized into three types:\n * - Structural errors: Critical JDM structure issues that fail compilation immediately\n * - Feature errors: Unsupported features that cannot be handled\n * - Expression errors: Issues in expression parsing that can be collected and reported together\n */\nexport enum ErrorCode {\n  // Structural errors (fail immediately)\n  INVALID_JSON = 'INVALID_JSON',\n  INVALID_NODE_STRUCTURE = 'INVALID_NODE_STRUCTURE',\n  MISSING_INPUT_NODE = 'MISSING_INPUT_NODE',\n  MISSING_OUTPUT_NODE = 'MISSING_OUTPUT_NODE',\n  MULTIPLE_INPUT_NODES = 'MULTIPLE_INPUT_NODES',\n  CYCLE_DETECTED = 'CYCLE_DETECTED',\n  INVALID_EDGE = 'INVALID_EDGE',\n\n  // Feature errors (fail immediately)\n  UNSUPPORTED_FUNCTION_NODE = 'UNSUPPORTED_FUNCTION_NODE',\n  UNSUPPORTED_EXPRESSION = 'UNSUPPORTED_EXPRESSION',\n\n  // Expression errors (collected, reported together)\n  PARSE_ERROR = 'PARSE_ERROR',\n  UNKNOWN_FUNCTION = 'UNKNOWN_FUNCTION',\n  TYPE_MISMATCH = 'TYPE_MISMATCH',\n  UNKNOWN_FIELD = 'UNKNOWN_FIELD',\n\n  // Schema errors\n  SCHEMA_MISMATCH = 'SCHEMA_MISMATCH',\n  INVALID_SCHEMA = 'INVALID_SCHEMA',\n}\n\n/**\n * Custom error class for compilation failures.\n *\n * Provides structured error information including error code, source location,\n * and additional context for debugging.\n */\nexport class CompilationError extends Error {\n  readonly name = 'CompilationError';\n\n  constructor(\n    message: string,\n    public readonly code: ErrorCode,\n    public readonly location?: SourceLocation,\n    public readonly context?: Record<string, unknown>,\n  ) {\n    super(message);\n    // Exclude the CompilationError constructor frame from the stack trace.\n    // Without this, stack traces would include an unhelpful constructor frame,\n    // making it harder to identify the actual error source in compiled code.\n    // Only available on V8-based engines (Node.js, Chrome, Edge).\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, CompilationError);\n    }\n  }\n\n  /**\n   * Get a formatted error message with location information.\n   */\n  getFormattedMessage(): string {\n    const parts: string[] = [];\n\n    if (this.location) {\n      const locParts: string[] = [];\n      if (this.location.nodeName) {\n        locParts.push(this.location.nodeName);\n      }\n      if (this.location.nodeId) {\n        locParts.push(`(id: ${this.location.nodeId})`);\n      }\n      if (this.location.field) {\n        locParts.push(`.${this.location.field}`);\n      }\n      // Combine line and column: @10:5\n      if (this.location.line !== undefined && this.location.column !== undefined) {\n        locParts.push(`@${this.location.line}:${this.location.column}`);\n      } else if (this.location.line !== undefined) {\n        locParts.push(`@${this.location.line}`);\n      } else if (this.location.column !== undefined) {\n        locParts.push(`:${this.location.column}`);\n      }\n\n      if (locParts.length > 0) {\n        parts.push(`[${locParts.join(' ')}]`);\n      }\n    }\n\n    parts.push(`[${this.code}]`);\n    parts.push(this.message);\n\n    return parts.join(' ');\n  }\n}\n\n/**\n * Collector for non-fatal errors during expression parsing.\n *\n * This allows the parser to continue and collect multiple errors rather than\n * failing on the first one, providing a better user experience by reporting\n * all issues at once.\n *\n * @example\n * const collector = new ErrorCollector();\n * collector.add(new CompilationError('Undefined variable', ErrorCode.UNKNOWN_FIELD, { nodeName: 'AgeCheck' }));\n * collector.add(new CompilationError('Type mismatch', ErrorCode.TYPE_MISMATCH, { nodeName: 'AgeCheck' }));\n * collector.throwIfErrors(); // Throws with aggregated message\n */\nexport class ErrorCollector {\n  private errors: CompilationError[] = [];\n\n  /**\n   * Add an error to the collector.\n   */\n  add(error: CompilationError): void {\n    this.errors.push(error);\n  }\n\n  /**\n   * Check if any errors have been collected.\n   */\n  hasErrors(): boolean {\n    return this.errors.length > 0;\n  }\n\n  /**\n   * Throw if there are any collected errors.\n   *\n   * Single errors throw directly to preserve original context and stack trace. Multiple\n   * errors are aggregated into one with numbered list, so developers see all problems at\n   * once instead of fixing issues one-by-one through repeated compile attempts.\n   */\n  throwIfErrors(): void {\n    if (this.errors.length === 0) {\n      return;\n    }\n\n    if (this.errors.length === 1) {\n      throw this.errors[0];\n    }\n\n    const message =\n      `${this.errors.length} compilation errors:\\n` +\n      this.errors\n        .map((e, i) => {\n          const prefix = `  ${i + 1}. ${e.code}`;\n          const formatted = e.getFormattedMessage();\n          // getFormattedMessage() includes [CODE] prefix, but we already show the code in\n          // our numbered list, so strip it to avoid \"1. CODE: [CODE] message\"\n          const rest = formatted.replace(`[${e.code}]`, '').trim();\n          return `${prefix}${rest ? ': ' + rest : ''}`;\n        })\n        .join('\\n');\n\n    // Use the location from the first error as the aggregated error's location\n    const firstErrorLocation = this.errors[0].location;\n    throw new CompilationError(message, ErrorCode.PARSE_ERROR, firstErrorLocation);\n  }\n}\n\n/**\n * Type guard to check if an error is a CompilationError.\n */\nexport function isCompilationError(error: unknown): error is CompilationError {\n  return error instanceof CompilationError;\n}\n\n/**\n * Type guard to check if an error code is a structural error.\n */\nexport function isStructuralError(code: ErrorCode): boolean {\n  return [\n    ErrorCode.INVALID_JSON,\n    ErrorCode.INVALID_NODE_STRUCTURE,\n    ErrorCode.MISSING_INPUT_NODE,\n    ErrorCode.MISSING_OUTPUT_NODE,\n    ErrorCode.MULTIPLE_INPUT_NODES,\n    ErrorCode.CYCLE_DETECTED,\n    ErrorCode.INVALID_EDGE,\n  ].includes(code);\n}\n\n/**\n * Type guard to check if an error code is a feature error.\n */\nexport function isFeatureError(code: ErrorCode): boolean {\n  return [ErrorCode.UNSUPPORTED_FUNCTION_NODE, ErrorCode.UNSUPPORTED_EXPRESSION].includes(code);\n}\n\n/**\n * Type guard to check if an error code is an expression error.\n */\nexport function isExpressionError(code: ErrorCode): boolean {\n  return [\n    ErrorCode.PARSE_ERROR,\n    ErrorCode.UNKNOWN_FUNCTION,\n    ErrorCode.TYPE_MISMATCH,\n    ErrorCode.UNKNOWN_FIELD,\n  ].includes(code);\n}\n","// This file was generated. Do not modify manually!\nvar astralIdentifierCodes = [509, 0, 227, 0, 150, 4, 294, 9, 1368, 2, 2, 1, 6, 3, 41, 2, 5, 0, 166, 1, 574, 3, 9, 9, 7, 9, 32, 4, 318, 1, 80, 3, 71, 10, 50, 3, 123, 2, 54, 14, 32, 10, 3, 1, 11, 3, 46, 10, 8, 0, 46, 9, 7, 2, 37, 13, 2, 9, 6, 1, 45, 0, 13, 2, 49, 13, 9, 3, 2, 11, 83, 11, 7, 0, 3, 0, 158, 11, 6, 9, 7, 3, 56, 1, 2, 6, 3, 1, 3, 2, 10, 0, 11, 1, 3, 6, 4, 4, 68, 8, 2, 0, 3, 0, 2, 3, 2, 4, 2, 0, 15, 1, 83, 17, 10, 9, 5, 0, 82, 19, 13, 9, 214, 6, 3, 8, 28, 1, 83, 16, 16, 9, 82, 12, 9, 9, 7, 19, 58, 14, 5, 9, 243, 14, 166, 9, 71, 5, 2, 1, 3, 3, 2, 0, 2, 1, 13, 9, 120, 6, 3, 6, 4, 0, 29, 9, 41, 6, 2, 3, 9, 0, 10, 10, 47, 15, 343, 9, 54, 7, 2, 7, 17, 9, 57, 21, 2, 13, 123, 5, 4, 0, 2, 1, 2, 6, 2, 0, 9, 9, 49, 4, 2, 1, 2, 4, 9, 9, 330, 3, 10, 1, 2, 0, 49, 6, 4, 4, 14, 10, 5350, 0, 7, 14, 11465, 27, 2343, 9, 87, 9, 39, 4, 60, 6, 26, 9, 535, 9, 470, 0, 2, 54, 8, 3, 82, 0, 12, 1, 19628, 1, 4178, 9, 519, 45, 3, 22, 543, 4, 4, 5, 9, 7, 3, 6, 31, 3, 149, 2, 1418, 49, 513, 54, 5, 49, 9, 0, 15, 0, 23, 4, 2, 14, 1361, 6, 2, 16, 3, 6, 2, 1, 2, 4, 101, 0, 161, 6, 10, 9, 357, 0, 62, 13, 499, 13, 245, 1, 2, 9, 726, 6, 110, 6, 6, 9, 4759, 9, 787719, 239];\n\n// This file was generated. Do not modify manually!\nvar astralIdentifierStartCodes = [0, 11, 2, 25, 2, 18, 2, 1, 2, 14, 3, 13, 35, 122, 70, 52, 268, 28, 4, 48, 48, 31, 14, 29, 6, 37, 11, 29, 3, 35, 5, 7, 2, 4, 43, 157, 19, 35, 5, 35, 5, 39, 9, 51, 13, 10, 2, 14, 2, 6, 2, 1, 2, 10, 2, 14, 2, 6, 2, 1, 4, 51, 13, 310, 10, 21, 11, 7, 25, 5, 2, 41, 2, 8, 70, 5, 3, 0, 2, 43, 2, 1, 4, 0, 3, 22, 11, 22, 10, 30, 66, 18, 2, 1, 11, 21, 11, 25, 71, 55, 7, 1, 65, 0, 16, 3, 2, 2, 2, 28, 43, 28, 4, 28, 36, 7, 2, 27, 28, 53, 11, 21, 11, 18, 14, 17, 111, 72, 56, 50, 14, 50, 14, 35, 39, 27, 10, 22, 251, 41, 7, 1, 17, 2, 60, 28, 11, 0, 9, 21, 43, 17, 47, 20, 28, 22, 13, 52, 58, 1, 3, 0, 14, 44, 33, 24, 27, 35, 30, 0, 3, 0, 9, 34, 4, 0, 13, 47, 15, 3, 22, 0, 2, 0, 36, 17, 2, 24, 20, 1, 64, 6, 2, 0, 2, 3, 2, 14, 2, 9, 8, 46, 39, 7, 3, 1, 3, 21, 2, 6, 2, 1, 2, 4, 4, 0, 19, 0, 13, 4, 31, 9, 2, 0, 3, 0, 2, 37, 2, 0, 26, 0, 2, 0, 45, 52, 19, 3, 21, 2, 31, 47, 21, 1, 2, 0, 185, 46, 42, 3, 37, 47, 21, 0, 60, 42, 14, 0, 72, 26, 38, 6, 186, 43, 117, 63, 32, 7, 3, 0, 3, 7, 2, 1, 2, 23, 16, 0, 2, 0, 95, 7, 3, 38, 17, 0, 2, 0, 29, 0, 11, 39, 8, 0, 22, 0, 12, 45, 20, 0, 19, 72, 200, 32, 32, 8, 2, 36, 18, 0, 50, 29, 113, 6, 2, 1, 2, 37, 22, 0, 26, 5, 2, 1, 2, 31, 15, 0, 328, 18, 16, 0, 2, 12, 2, 33, 125, 0, 80, 921, 103, 110, 18, 195, 2637, 96, 16, 1071, 18, 5, 26, 3994, 6, 582, 6842, 29, 1763, 568, 8, 30, 18, 78, 18, 29, 19, 47, 17, 3, 32, 20, 6, 18, 433, 44, 212, 63, 129, 74, 6, 0, 67, 12, 65, 1, 2, 0, 29, 6135, 9, 1237, 42, 9, 8936, 3, 2, 6, 2, 1, 2, 290, 16, 0, 30, 2, 3, 0, 15, 3, 9, 395, 2309, 106, 6, 12, 4, 8, 8, 9, 5991, 84, 2, 70, 2, 1, 3, 0, 3, 1, 3, 3, 2, 11, 2, 0, 2, 6, 2, 64, 2, 3, 3, 7, 2, 6, 2, 27, 2, 3, 2, 4, 2, 0, 4, 6, 2, 339, 3, 24, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 7, 1845, 30, 7, 5, 262, 61, 147, 44, 11, 6, 17, 0, 322, 29, 19, 43, 485, 27, 229, 29, 3, 0, 496, 6, 2, 3, 2, 1, 2, 14, 2, 196, 60, 67, 8, 0, 1205, 3, 2, 26, 2, 1, 2, 0, 3, 0, 2, 9, 2, 3, 2, 0, 2, 0, 7, 0, 5, 0, 2, 0, 2, 0, 2, 2, 2, 1, 2, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 1, 2, 0, 3, 3, 2, 6, 2, 3, 2, 3, 2, 0, 2, 9, 2, 16, 6, 2, 2, 4, 2, 16, 4421, 42719, 33, 4153, 7, 221, 3, 5761, 15, 7472, 16, 621, 2467, 541, 1507, 4938, 6, 4191];\n\n// This file was generated. Do not modify manually!\nvar nonASCIIidentifierChars = \"\\u200c\\u200d\\xb7\\u0300-\\u036f\\u0387\\u0483-\\u0487\\u0591-\\u05bd\\u05bf\\u05c1\\u05c2\\u05c4\\u05c5\\u05c7\\u0610-\\u061a\\u064b-\\u0669\\u0670\\u06d6-\\u06dc\\u06df-\\u06e4\\u06e7\\u06e8\\u06ea-\\u06ed\\u06f0-\\u06f9\\u0711\\u0730-\\u074a\\u07a6-\\u07b0\\u07c0-\\u07c9\\u07eb-\\u07f3\\u07fd\\u0816-\\u0819\\u081b-\\u0823\\u0825-\\u0827\\u0829-\\u082d\\u0859-\\u085b\\u0897-\\u089f\\u08ca-\\u08e1\\u08e3-\\u0903\\u093a-\\u093c\\u093e-\\u094f\\u0951-\\u0957\\u0962\\u0963\\u0966-\\u096f\\u0981-\\u0983\\u09bc\\u09be-\\u09c4\\u09c7\\u09c8\\u09cb-\\u09cd\\u09d7\\u09e2\\u09e3\\u09e6-\\u09ef\\u09fe\\u0a01-\\u0a03\\u0a3c\\u0a3e-\\u0a42\\u0a47\\u0a48\\u0a4b-\\u0a4d\\u0a51\\u0a66-\\u0a71\\u0a75\\u0a81-\\u0a83\\u0abc\\u0abe-\\u0ac5\\u0ac7-\\u0ac9\\u0acb-\\u0acd\\u0ae2\\u0ae3\\u0ae6-\\u0aef\\u0afa-\\u0aff\\u0b01-\\u0b03\\u0b3c\\u0b3e-\\u0b44\\u0b47\\u0b48\\u0b4b-\\u0b4d\\u0b55-\\u0b57\\u0b62\\u0b63\\u0b66-\\u0b6f\\u0b82\\u0bbe-\\u0bc2\\u0bc6-\\u0bc8\\u0bca-\\u0bcd\\u0bd7\\u0be6-\\u0bef\\u0c00-\\u0c04\\u0c3c\\u0c3e-\\u0c44\\u0c46-\\u0c48\\u0c4a-\\u0c4d\\u0c55\\u0c56\\u0c62\\u0c63\\u0c66-\\u0c6f\\u0c81-\\u0c83\\u0cbc\\u0cbe-\\u0cc4\\u0cc6-\\u0cc8\\u0cca-\\u0ccd\\u0cd5\\u0cd6\\u0ce2\\u0ce3\\u0ce6-\\u0cef\\u0cf3\\u0d00-\\u0d03\\u0d3b\\u0d3c\\u0d3e-\\u0d44\\u0d46-\\u0d48\\u0d4a-\\u0d4d\\u0d57\\u0d62\\u0d63\\u0d66-\\u0d6f\\u0d81-\\u0d83\\u0dca\\u0dcf-\\u0dd4\\u0dd6\\u0dd8-\\u0ddf\\u0de6-\\u0def\\u0df2\\u0df3\\u0e31\\u0e34-\\u0e3a\\u0e47-\\u0e4e\\u0e50-\\u0e59\\u0eb1\\u0eb4-\\u0ebc\\u0ec8-\\u0ece\\u0ed0-\\u0ed9\\u0f18\\u0f19\\u0f20-\\u0f29\\u0f35\\u0f37\\u0f39\\u0f3e\\u0f3f\\u0f71-\\u0f84\\u0f86\\u0f87\\u0f8d-\\u0f97\\u0f99-\\u0fbc\\u0fc6\\u102b-\\u103e\\u1040-\\u1049\\u1056-\\u1059\\u105e-\\u1060\\u1062-\\u1064\\u1067-\\u106d\\u1071-\\u1074\\u1082-\\u108d\\u108f-\\u109d\\u135d-\\u135f\\u1369-\\u1371\\u1712-\\u1715\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17b4-\\u17d3\\u17dd\\u17e0-\\u17e9\\u180b-\\u180d\\u180f-\\u1819\\u18a9\\u1920-\\u192b\\u1930-\\u193b\\u1946-\\u194f\\u19d0-\\u19da\\u1a17-\\u1a1b\\u1a55-\\u1a5e\\u1a60-\\u1a7c\\u1a7f-\\u1a89\\u1a90-\\u1a99\\u1ab0-\\u1abd\\u1abf-\\u1ace\\u1b00-\\u1b04\\u1b34-\\u1b44\\u1b50-\\u1b59\\u1b6b-\\u1b73\\u1b80-\\u1b82\\u1ba1-\\u1bad\\u1bb0-\\u1bb9\\u1be6-\\u1bf3\\u1c24-\\u1c37\\u1c40-\\u1c49\\u1c50-\\u1c59\\u1cd0-\\u1cd2\\u1cd4-\\u1ce8\\u1ced\\u1cf4\\u1cf7-\\u1cf9\\u1dc0-\\u1dff\\u200c\\u200d\\u203f\\u2040\\u2054\\u20d0-\\u20dc\\u20e1\\u20e5-\\u20f0\\u2cef-\\u2cf1\\u2d7f\\u2de0-\\u2dff\\u302a-\\u302f\\u3099\\u309a\\u30fb\\ua620-\\ua629\\ua66f\\ua674-\\ua67d\\ua69e\\ua69f\\ua6f0\\ua6f1\\ua802\\ua806\\ua80b\\ua823-\\ua827\\ua82c\\ua880\\ua881\\ua8b4-\\ua8c5\\ua8d0-\\ua8d9\\ua8e0-\\ua8f1\\ua8ff-\\ua909\\ua926-\\ua92d\\ua947-\\ua953\\ua980-\\ua983\\ua9b3-\\ua9c0\\ua9d0-\\ua9d9\\ua9e5\\ua9f0-\\ua9f9\\uaa29-\\uaa36\\uaa43\\uaa4c\\uaa4d\\uaa50-\\uaa59\\uaa7b-\\uaa7d\\uaab0\\uaab2-\\uaab4\\uaab7\\uaab8\\uaabe\\uaabf\\uaac1\\uaaeb-\\uaaef\\uaaf5\\uaaf6\\uabe3-\\uabea\\uabec\\uabed\\uabf0-\\uabf9\\ufb1e\\ufe00-\\ufe0f\\ufe20-\\ufe2f\\ufe33\\ufe34\\ufe4d-\\ufe4f\\uff10-\\uff19\\uff3f\\uff65\";\n\n// This file was generated. Do not modify manually!\nvar nonASCIIidentifierStartChars = \"\\xaa\\xb5\\xba\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02c1\\u02c6-\\u02d1\\u02e0-\\u02e4\\u02ec\\u02ee\\u0370-\\u0374\\u0376\\u0377\\u037a-\\u037d\\u037f\\u0386\\u0388-\\u038a\\u038c\\u038e-\\u03a1\\u03a3-\\u03f5\\u03f7-\\u0481\\u048a-\\u052f\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05d0-\\u05ea\\u05ef-\\u05f2\\u0620-\\u064a\\u066e\\u066f\\u0671-\\u06d3\\u06d5\\u06e5\\u06e6\\u06ee\\u06ef\\u06fa-\\u06fc\\u06ff\\u0710\\u0712-\\u072f\\u074d-\\u07a5\\u07b1\\u07ca-\\u07ea\\u07f4\\u07f5\\u07fa\\u0800-\\u0815\\u081a\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086a\\u0870-\\u0887\\u0889-\\u088e\\u08a0-\\u08c9\\u0904-\\u0939\\u093d\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098c\\u098f\\u0990\\u0993-\\u09a8\\u09aa-\\u09b0\\u09b2\\u09b6-\\u09b9\\u09bd\\u09ce\\u09dc\\u09dd\\u09df-\\u09e1\\u09f0\\u09f1\\u09fc\\u0a05-\\u0a0a\\u0a0f\\u0a10\\u0a13-\\u0a28\\u0a2a-\\u0a30\\u0a32\\u0a33\\u0a35\\u0a36\\u0a38\\u0a39\\u0a59-\\u0a5c\\u0a5e\\u0a72-\\u0a74\\u0a85-\\u0a8d\\u0a8f-\\u0a91\\u0a93-\\u0aa8\\u0aaa-\\u0ab0\\u0ab2\\u0ab3\\u0ab5-\\u0ab9\\u0abd\\u0ad0\\u0ae0\\u0ae1\\u0af9\\u0b05-\\u0b0c\\u0b0f\\u0b10\\u0b13-\\u0b28\\u0b2a-\\u0b30\\u0b32\\u0b33\\u0b35-\\u0b39\\u0b3d\\u0b5c\\u0b5d\\u0b5f-\\u0b61\\u0b71\\u0b83\\u0b85-\\u0b8a\\u0b8e-\\u0b90\\u0b92-\\u0b95\\u0b99\\u0b9a\\u0b9c\\u0b9e\\u0b9f\\u0ba3\\u0ba4\\u0ba8-\\u0baa\\u0bae-\\u0bb9\\u0bd0\\u0c05-\\u0c0c\\u0c0e-\\u0c10\\u0c12-\\u0c28\\u0c2a-\\u0c39\\u0c3d\\u0c58-\\u0c5a\\u0c5d\\u0c60\\u0c61\\u0c80\\u0c85-\\u0c8c\\u0c8e-\\u0c90\\u0c92-\\u0ca8\\u0caa-\\u0cb3\\u0cb5-\\u0cb9\\u0cbd\\u0cdd\\u0cde\\u0ce0\\u0ce1\\u0cf1\\u0cf2\\u0d04-\\u0d0c\\u0d0e-\\u0d10\\u0d12-\\u0d3a\\u0d3d\\u0d4e\\u0d54-\\u0d56\\u0d5f-\\u0d61\\u0d7a-\\u0d7f\\u0d85-\\u0d96\\u0d9a-\\u0db1\\u0db3-\\u0dbb\\u0dbd\\u0dc0-\\u0dc6\\u0e01-\\u0e30\\u0e32\\u0e33\\u0e40-\\u0e46\\u0e81\\u0e82\\u0e84\\u0e86-\\u0e8a\\u0e8c-\\u0ea3\\u0ea5\\u0ea7-\\u0eb0\\u0eb2\\u0eb3\\u0ebd\\u0ec0-\\u0ec4\\u0ec6\\u0edc-\\u0edf\\u0f00\\u0f40-\\u0f47\\u0f49-\\u0f6c\\u0f88-\\u0f8c\\u1000-\\u102a\\u103f\\u1050-\\u1055\\u105a-\\u105d\\u1061\\u1065\\u1066\\u106e-\\u1070\\u1075-\\u1081\\u108e\\u10a0-\\u10c5\\u10c7\\u10cd\\u10d0-\\u10fa\\u10fc-\\u1248\\u124a-\\u124d\\u1250-\\u1256\\u1258\\u125a-\\u125d\\u1260-\\u1288\\u128a-\\u128d\\u1290-\\u12b0\\u12b2-\\u12b5\\u12b8-\\u12be\\u12c0\\u12c2-\\u12c5\\u12c8-\\u12d6\\u12d8-\\u1310\\u1312-\\u1315\\u1318-\\u135a\\u1380-\\u138f\\u13a0-\\u13f5\\u13f8-\\u13fd\\u1401-\\u166c\\u166f-\\u167f\\u1681-\\u169a\\u16a0-\\u16ea\\u16ee-\\u16f8\\u1700-\\u1711\\u171f-\\u1731\\u1740-\\u1751\\u1760-\\u176c\\u176e-\\u1770\\u1780-\\u17b3\\u17d7\\u17dc\\u1820-\\u1878\\u1880-\\u18a8\\u18aa\\u18b0-\\u18f5\\u1900-\\u191e\\u1950-\\u196d\\u1970-\\u1974\\u1980-\\u19ab\\u19b0-\\u19c9\\u1a00-\\u1a16\\u1a20-\\u1a54\\u1aa7\\u1b05-\\u1b33\\u1b45-\\u1b4c\\u1b83-\\u1ba0\\u1bae\\u1baf\\u1bba-\\u1be5\\u1c00-\\u1c23\\u1c4d-\\u1c4f\\u1c5a-\\u1c7d\\u1c80-\\u1c8a\\u1c90-\\u1cba\\u1cbd-\\u1cbf\\u1ce9-\\u1cec\\u1cee-\\u1cf3\\u1cf5\\u1cf6\\u1cfa\\u1d00-\\u1dbf\\u1e00-\\u1f15\\u1f18-\\u1f1d\\u1f20-\\u1f45\\u1f48-\\u1f4d\\u1f50-\\u1f57\\u1f59\\u1f5b\\u1f5d\\u1f5f-\\u1f7d\\u1f80-\\u1fb4\\u1fb6-\\u1fbc\\u1fbe\\u1fc2-\\u1fc4\\u1fc6-\\u1fcc\\u1fd0-\\u1fd3\\u1fd6-\\u1fdb\\u1fe0-\\u1fec\\u1ff2-\\u1ff4\\u1ff6-\\u1ffc\\u2071\\u207f\\u2090-\\u209c\\u2102\\u2107\\u210a-\\u2113\\u2115\\u2118-\\u211d\\u2124\\u2126\\u2128\\u212a-\\u2139\\u213c-\\u213f\\u2145-\\u2149\\u214e\\u2160-\\u2188\\u2c00-\\u2ce4\\u2ceb-\\u2cee\\u2cf2\\u2cf3\\u2d00-\\u2d25\\u2d27\\u2d2d\\u2d30-\\u2d67\\u2d6f\\u2d80-\\u2d96\\u2da0-\\u2da6\\u2da8-\\u2dae\\u2db0-\\u2db6\\u2db8-\\u2dbe\\u2dc0-\\u2dc6\\u2dc8-\\u2dce\\u2dd0-\\u2dd6\\u2dd8-\\u2dde\\u3005-\\u3007\\u3021-\\u3029\\u3031-\\u3035\\u3038-\\u303c\\u3041-\\u3096\\u309b-\\u309f\\u30a1-\\u30fa\\u30fc-\\u30ff\\u3105-\\u312f\\u3131-\\u318e\\u31a0-\\u31bf\\u31f0-\\u31ff\\u3400-\\u4dbf\\u4e00-\\ua48c\\ua4d0-\\ua4fd\\ua500-\\ua60c\\ua610-\\ua61f\\ua62a\\ua62b\\ua640-\\ua66e\\ua67f-\\ua69d\\ua6a0-\\ua6ef\\ua717-\\ua71f\\ua722-\\ua788\\ua78b-\\ua7cd\\ua7d0\\ua7d1\\ua7d3\\ua7d5-\\ua7dc\\ua7f2-\\ua801\\ua803-\\ua805\\ua807-\\ua80a\\ua80c-\\ua822\\ua840-\\ua873\\ua882-\\ua8b3\\ua8f2-\\ua8f7\\ua8fb\\ua8fd\\ua8fe\\ua90a-\\ua925\\ua930-\\ua946\\ua960-\\ua97c\\ua984-\\ua9b2\\ua9cf\\ua9e0-\\ua9e4\\ua9e6-\\ua9ef\\ua9fa-\\ua9fe\\uaa00-\\uaa28\\uaa40-\\uaa42\\uaa44-\\uaa4b\\uaa60-\\uaa76\\uaa7a\\uaa7e-\\uaaaf\\uaab1\\uaab5\\uaab6\\uaab9-\\uaabd\\uaac0\\uaac2\\uaadb-\\uaadd\\uaae0-\\uaaea\\uaaf2-\\uaaf4\\uab01-\\uab06\\uab09-\\uab0e\\uab11-\\uab16\\uab20-\\uab26\\uab28-\\uab2e\\uab30-\\uab5a\\uab5c-\\uab69\\uab70-\\uabe2\\uac00-\\ud7a3\\ud7b0-\\ud7c6\\ud7cb-\\ud7fb\\uf900-\\ufa6d\\ufa70-\\ufad9\\ufb00-\\ufb06\\ufb13-\\ufb17\\ufb1d\\ufb1f-\\ufb28\\ufb2a-\\ufb36\\ufb38-\\ufb3c\\ufb3e\\ufb40\\ufb41\\ufb43\\ufb44\\ufb46-\\ufbb1\\ufbd3-\\ufd3d\\ufd50-\\ufd8f\\ufd92-\\ufdc7\\ufdf0-\\ufdfb\\ufe70-\\ufe74\\ufe76-\\ufefc\\uff21-\\uff3a\\uff41-\\uff5a\\uff66-\\uffbe\\uffc2-\\uffc7\\uffca-\\uffcf\\uffd2-\\uffd7\\uffda-\\uffdc\";\n\n// These are a run-length and offset encoded representation of the\n// >0xffff code points that are a valid part of identifiers. The\n// offset starts at 0x10000, and each pair of numbers represents an\n// offset to the next range, and then a size of the range.\n\n// Reserved word lists for various dialects of the language\n\nvar reservedWords = {\n  3: \"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile\",\n  5: \"class enum extends super const export import\",\n  6: \"enum\",\n  strict: \"implements interface let package private protected public static yield\",\n  strictBind: \"eval arguments\"\n};\n\n// And the keywords\n\nvar ecma5AndLessKeywords = \"break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this\";\n\nvar keywords$1 = {\n  5: ecma5AndLessKeywords,\n  \"5module\": ecma5AndLessKeywords + \" export import\",\n  6: ecma5AndLessKeywords + \" const class extends export import super\"\n};\n\nvar keywordRelationalOperator = /^in(stanceof)?$/;\n\n// ## Character categories\n\nvar nonASCIIidentifierStart = new RegExp(\"[\" + nonASCIIidentifierStartChars + \"]\");\nvar nonASCIIidentifier = new RegExp(\"[\" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + \"]\");\n\n// This has a complexity linear to the value of the code. The\n// assumption is that looking up astral identifier characters is\n// rare.\nfunction isInAstralSet(code, set) {\n  var pos = 0x10000;\n  for (var i = 0; i < set.length; i += 2) {\n    pos += set[i];\n    if (pos > code) { return false }\n    pos += set[i + 1];\n    if (pos >= code) { return true }\n  }\n  return false\n}\n\n// Test whether a given character code starts an identifier.\n\nfunction isIdentifierStart(code, astral) {\n  if (code < 65) { return code === 36 }\n  if (code < 91) { return true }\n  if (code < 97) { return code === 95 }\n  if (code < 123) { return true }\n  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }\n  if (astral === false) { return false }\n  return isInAstralSet(code, astralIdentifierStartCodes)\n}\n\n// Test whether a given character is part of an identifier.\n\nfunction isIdentifierChar(code, astral) {\n  if (code < 48) { return code === 36 }\n  if (code < 58) { return true }\n  if (code < 65) { return false }\n  if (code < 91) { return true }\n  if (code < 97) { return code === 95 }\n  if (code < 123) { return true }\n  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }\n  if (astral === false) { return false }\n  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)\n}\n\n// ## Token types\n\n// The assignment of fine-grained, information-carrying type objects\n// allows the tokenizer to store the information it has about a\n// token in a way that is very cheap for the parser to look up.\n\n// All token type variables start with an underscore, to make them\n// easy to recognize.\n\n// The `beforeExpr` property is used to disambiguate between regular\n// expressions and divisions. It is set on all token types that can\n// be followed by an expression (thus, a slash after them would be a\n// regular expression).\n//\n// The `startsExpr` property is used to check if the token ends a\n// `yield` expression. It is set on all token types that either can\n// directly start an expression (like a quotation mark) or can\n// continue an expression (like the body of a string).\n//\n// `isLoop` marks a keyword as starting a loop, which is important\n// to know when parsing a label, in order to allow or disallow\n// continue jumps to that label.\n\nvar TokenType = function TokenType(label, conf) {\n  if ( conf === void 0 ) conf = {};\n\n  this.label = label;\n  this.keyword = conf.keyword;\n  this.beforeExpr = !!conf.beforeExpr;\n  this.startsExpr = !!conf.startsExpr;\n  this.isLoop = !!conf.isLoop;\n  this.isAssign = !!conf.isAssign;\n  this.prefix = !!conf.prefix;\n  this.postfix = !!conf.postfix;\n  this.binop = conf.binop || null;\n  this.updateContext = null;\n};\n\nfunction binop(name, prec) {\n  return new TokenType(name, {beforeExpr: true, binop: prec})\n}\nvar beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};\n\n// Map keyword names to token types.\n\nvar keywords = {};\n\n// Succinct definitions of keyword token types\nfunction kw(name, options) {\n  if ( options === void 0 ) options = {};\n\n  options.keyword = name;\n  return keywords[name] = new TokenType(name, options)\n}\n\nvar types$1 = {\n  num: new TokenType(\"num\", startsExpr),\n  regexp: new TokenType(\"regexp\", startsExpr),\n  string: new TokenType(\"string\", startsExpr),\n  name: new TokenType(\"name\", startsExpr),\n  privateId: new TokenType(\"privateId\", startsExpr),\n  eof: new TokenType(\"eof\"),\n\n  // Punctuation token types.\n  bracketL: new TokenType(\"[\", {beforeExpr: true, startsExpr: true}),\n  bracketR: new TokenType(\"]\"),\n  braceL: new TokenType(\"{\", {beforeExpr: true, startsExpr: true}),\n  braceR: new TokenType(\"}\"),\n  parenL: new TokenType(\"(\", {beforeExpr: true, startsExpr: true}),\n  parenR: new TokenType(\")\"),\n  comma: new TokenType(\",\", beforeExpr),\n  semi: new TokenType(\";\", beforeExpr),\n  colon: new TokenType(\":\", beforeExpr),\n  dot: new TokenType(\".\"),\n  question: new TokenType(\"?\", beforeExpr),\n  questionDot: new TokenType(\"?.\"),\n  arrow: new TokenType(\"=>\", beforeExpr),\n  template: new TokenType(\"template\"),\n  invalidTemplate: new TokenType(\"invalidTemplate\"),\n  ellipsis: new TokenType(\"...\", beforeExpr),\n  backQuote: new TokenType(\"`\", startsExpr),\n  dollarBraceL: new TokenType(\"${\", {beforeExpr: true, startsExpr: true}),\n\n  // Operators. These carry several kinds of properties to help the\n  // parser use them properly (the presence of these properties is\n  // what categorizes them as operators).\n  //\n  // `binop`, when present, specifies that this operator is a binary\n  // operator, and will refer to its precedence.\n  //\n  // `prefix` and `postfix` mark the operator as a prefix or postfix\n  // unary operator.\n  //\n  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as\n  // binary operators with a very low precedence, that should result\n  // in AssignmentExpression nodes.\n\n  eq: new TokenType(\"=\", {beforeExpr: true, isAssign: true}),\n  assign: new TokenType(\"_=\", {beforeExpr: true, isAssign: true}),\n  incDec: new TokenType(\"++/--\", {prefix: true, postfix: true, startsExpr: true}),\n  prefix: new TokenType(\"!/~\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  logicalOR: binop(\"||\", 1),\n  logicalAND: binop(\"&&\", 2),\n  bitwiseOR: binop(\"|\", 3),\n  bitwiseXOR: binop(\"^\", 4),\n  bitwiseAND: binop(\"&\", 5),\n  equality: binop(\"==/!=/===/!==\", 6),\n  relational: binop(\"</>/<=/>=\", 7),\n  bitShift: binop(\"<</>>/>>>\", 8),\n  plusMin: new TokenType(\"+/-\", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),\n  modulo: binop(\"%\", 10),\n  star: binop(\"*\", 10),\n  slash: binop(\"/\", 10),\n  starstar: new TokenType(\"**\", {beforeExpr: true}),\n  coalesce: binop(\"??\", 1),\n\n  // Keyword token types.\n  _break: kw(\"break\"),\n  _case: kw(\"case\", beforeExpr),\n  _catch: kw(\"catch\"),\n  _continue: kw(\"continue\"),\n  _debugger: kw(\"debugger\"),\n  _default: kw(\"default\", beforeExpr),\n  _do: kw(\"do\", {isLoop: true, beforeExpr: true}),\n  _else: kw(\"else\", beforeExpr),\n  _finally: kw(\"finally\"),\n  _for: kw(\"for\", {isLoop: true}),\n  _function: kw(\"function\", startsExpr),\n  _if: kw(\"if\"),\n  _return: kw(\"return\", beforeExpr),\n  _switch: kw(\"switch\"),\n  _throw: kw(\"throw\", beforeExpr),\n  _try: kw(\"try\"),\n  _var: kw(\"var\"),\n  _const: kw(\"const\"),\n  _while: kw(\"while\", {isLoop: true}),\n  _with: kw(\"with\"),\n  _new: kw(\"new\", {beforeExpr: true, startsExpr: true}),\n  _this: kw(\"this\", startsExpr),\n  _super: kw(\"super\", startsExpr),\n  _class: kw(\"class\", startsExpr),\n  _extends: kw(\"extends\", beforeExpr),\n  _export: kw(\"export\"),\n  _import: kw(\"import\", startsExpr),\n  _null: kw(\"null\", startsExpr),\n  _true: kw(\"true\", startsExpr),\n  _false: kw(\"false\", startsExpr),\n  _in: kw(\"in\", {beforeExpr: true, binop: 7}),\n  _instanceof: kw(\"instanceof\", {beforeExpr: true, binop: 7}),\n  _typeof: kw(\"typeof\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _void: kw(\"void\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _delete: kw(\"delete\", {beforeExpr: true, prefix: true, startsExpr: true})\n};\n\n// Matches a whole line break (where CRLF is considered a single\n// line break). Used to count lines.\n\nvar lineBreak = /\\r\\n?|\\n|\\u2028|\\u2029/;\nvar lineBreakG = new RegExp(lineBreak.source, \"g\");\n\nfunction isNewLine(code) {\n  return code === 10 || code === 13 || code === 0x2028 || code === 0x2029\n}\n\nfunction nextLineBreak(code, from, end) {\n  if ( end === void 0 ) end = code.length;\n\n  for (var i = from; i < end; i++) {\n    var next = code.charCodeAt(i);\n    if (isNewLine(next))\n      { return i < end - 1 && next === 13 && code.charCodeAt(i + 1) === 10 ? i + 2 : i + 1 }\n  }\n  return -1\n}\n\nvar nonASCIIwhitespace = /[\\u1680\\u2000-\\u200a\\u202f\\u205f\\u3000\\ufeff]/;\n\nvar skipWhiteSpace = /(?:\\s|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/g;\n\nvar ref = Object.prototype;\nvar hasOwnProperty = ref.hasOwnProperty;\nvar toString = ref.toString;\n\nvar hasOwn = Object.hasOwn || (function (obj, propName) { return (\n  hasOwnProperty.call(obj, propName)\n); });\n\nvar isArray = Array.isArray || (function (obj) { return (\n  toString.call(obj) === \"[object Array]\"\n); });\n\nvar regexpCache = Object.create(null);\n\nfunction wordsRegexp(words) {\n  return regexpCache[words] || (regexpCache[words] = new RegExp(\"^(?:\" + words.replace(/ /g, \"|\") + \")$\"))\n}\n\nfunction codePointToString(code) {\n  // UTF-16 Decoding\n  if (code <= 0xFFFF) { return String.fromCharCode(code) }\n  code -= 0x10000;\n  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)\n}\n\nvar loneSurrogate = /(?:[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF])/;\n\n// These are used when `options.locations` is on, for the\n// `startLoc` and `endLoc` properties.\n\nvar Position = function Position(line, col) {\n  this.line = line;\n  this.column = col;\n};\n\nPosition.prototype.offset = function offset (n) {\n  return new Position(this.line, this.column + n)\n};\n\nvar SourceLocation = function SourceLocation(p, start, end) {\n  this.start = start;\n  this.end = end;\n  if (p.sourceFile !== null) { this.source = p.sourceFile; }\n};\n\n// The `getLineInfo` function is mostly useful when the\n// `locations` option is off (for performance reasons) and you\n// want to find the line/column position for a given character\n// offset. `input` should be the code string that the offset refers\n// into.\n\nfunction getLineInfo(input, offset) {\n  for (var line = 1, cur = 0;;) {\n    var nextBreak = nextLineBreak(input, cur, offset);\n    if (nextBreak < 0) { return new Position(line, offset - cur) }\n    ++line;\n    cur = nextBreak;\n  }\n}\n\n// A second argument must be given to configure the parser process.\n// These options are recognized (only `ecmaVersion` is required):\n\nvar defaultOptions = {\n  // `ecmaVersion` indicates the ECMAScript version to parse. Must be\n  // either 3, 5, 6 (or 2015), 7 (2016), 8 (2017), 9 (2018), 10\n  // (2019), 11 (2020), 12 (2021), 13 (2022), 14 (2023), or `\"latest\"`\n  // (the latest version the library supports). This influences\n  // support for strict mode, the set of reserved words, and support\n  // for new syntax features.\n  ecmaVersion: null,\n  // `sourceType` indicates the mode the code should be parsed in.\n  // Can be either `\"script\"` or `\"module\"`. This influences global\n  // strict mode and parsing of `import` and `export` declarations.\n  sourceType: \"script\",\n  // `onInsertedSemicolon` can be a callback that will be called when\n  // a semicolon is automatically inserted. It will be passed the\n  // position of the inserted semicolon as an offset, and if\n  // `locations` is enabled, it is given the location as a `{line,\n  // column}` object as second argument.\n  onInsertedSemicolon: null,\n  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for\n  // trailing commas.\n  onTrailingComma: null,\n  // By default, reserved words are only enforced if ecmaVersion >= 5.\n  // Set `allowReserved` to a boolean value to explicitly turn this on\n  // an off. When this option has the value \"never\", reserved words\n  // and keywords can also not be used as property names.\n  allowReserved: null,\n  // When enabled, a return at the top level is not considered an\n  // error.\n  allowReturnOutsideFunction: false,\n  // When enabled, import/export statements are not constrained to\n  // appearing at the top of the program, and an import.meta expression\n  // in a script isn't considered an error.\n  allowImportExportEverywhere: false,\n  // By default, await identifiers are allowed to appear at the top-level scope only if ecmaVersion >= 2022.\n  // When enabled, await identifiers are allowed to appear at the top-level scope,\n  // but they are still not allowed in non-async functions.\n  allowAwaitOutsideFunction: null,\n  // When enabled, super identifiers are not constrained to\n  // appearing in methods and do not raise an error when they appear elsewhere.\n  allowSuperOutsideMethod: null,\n  // When enabled, hashbang directive in the beginning of file is\n  // allowed and treated as a line comment. Enabled by default when\n  // `ecmaVersion` >= 2023.\n  allowHashBang: false,\n  // By default, the parser will verify that private properties are\n  // only used in places where they are valid and have been declared.\n  // Set this to false to turn such checks off.\n  checkPrivateFields: true,\n  // When `locations` is on, `loc` properties holding objects with\n  // `start` and `end` properties in `{line, column}` form (with\n  // line being 1-based and column 0-based) will be attached to the\n  // nodes.\n  locations: false,\n  // A function can be passed as `onToken` option, which will\n  // cause Acorn to call that function with object in the same\n  // format as tokens returned from `tokenizer().getToken()`. Note\n  // that you are not allowed to call the parser from the\n  // callback—that will corrupt its internal state.\n  onToken: null,\n  // A function can be passed as `onComment` option, which will\n  // cause Acorn to call that function with `(block, text, start,\n  // end)` parameters whenever a comment is skipped. `block` is a\n  // boolean indicating whether this is a block (`/* */`) comment,\n  // `text` is the content of the comment, and `start` and `end` are\n  // character offsets that denote the start and end of the comment.\n  // When the `locations` option is on, two more parameters are\n  // passed, the full `{line, column}` locations of the start and\n  // end of the comments. Note that you are not allowed to call the\n  // parser from the callback—that will corrupt its internal state.\n  // When this option has an array as value, objects representing the\n  // comments are pushed to it.\n  onComment: null,\n  // Nodes have their start and end characters offsets recorded in\n  // `start` and `end` properties (directly on the node, rather than\n  // the `loc` object, which holds line/column data. To also add a\n  // [semi-standardized][range] `range` property holding a `[start,\n  // end]` array with the same numbers, set the `ranges` option to\n  // `true`.\n  //\n  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678\n  ranges: false,\n  // It is possible to parse multiple files into a single AST by\n  // passing the tree produced by parsing the first file as\n  // `program` option in subsequent parses. This will add the\n  // toplevel forms of the parsed file to the `Program` (top) node\n  // of an existing parse tree.\n  program: null,\n  // When `locations` is on, you can pass this to record the source\n  // file in every node's `loc` object.\n  sourceFile: null,\n  // This value, if given, is stored in every node, whether\n  // `locations` is on or off.\n  directSourceFile: null,\n  // When enabled, parenthesized expressions are represented by\n  // (non-standard) ParenthesizedExpression nodes\n  preserveParens: false\n};\n\n// Interpret and default an options object\n\nvar warnedAboutEcmaVersion = false;\n\nfunction getOptions(opts) {\n  var options = {};\n\n  for (var opt in defaultOptions)\n    { options[opt] = opts && hasOwn(opts, opt) ? opts[opt] : defaultOptions[opt]; }\n\n  if (options.ecmaVersion === \"latest\") {\n    options.ecmaVersion = 1e8;\n  } else if (options.ecmaVersion == null) {\n    if (!warnedAboutEcmaVersion && typeof console === \"object\" && console.warn) {\n      warnedAboutEcmaVersion = true;\n      console.warn(\"Since Acorn 8.0.0, options.ecmaVersion is required.\\nDefaulting to 2020, but this will stop working in the future.\");\n    }\n    options.ecmaVersion = 11;\n  } else if (options.ecmaVersion >= 2015) {\n    options.ecmaVersion -= 2009;\n  }\n\n  if (options.allowReserved == null)\n    { options.allowReserved = options.ecmaVersion < 5; }\n\n  if (!opts || opts.allowHashBang == null)\n    { options.allowHashBang = options.ecmaVersion >= 14; }\n\n  if (isArray(options.onToken)) {\n    var tokens = options.onToken;\n    options.onToken = function (token) { return tokens.push(token); };\n  }\n  if (isArray(options.onComment))\n    { options.onComment = pushComment(options, options.onComment); }\n\n  return options\n}\n\nfunction pushComment(options, array) {\n  return function(block, text, start, end, startLoc, endLoc) {\n    var comment = {\n      type: block ? \"Block\" : \"Line\",\n      value: text,\n      start: start,\n      end: end\n    };\n    if (options.locations)\n      { comment.loc = new SourceLocation(this, startLoc, endLoc); }\n    if (options.ranges)\n      { comment.range = [start, end]; }\n    array.push(comment);\n  }\n}\n\n// Each scope gets a bitset that may contain these flags\nvar\n    SCOPE_TOP = 1,\n    SCOPE_FUNCTION = 2,\n    SCOPE_ASYNC = 4,\n    SCOPE_GENERATOR = 8,\n    SCOPE_ARROW = 16,\n    SCOPE_SIMPLE_CATCH = 32,\n    SCOPE_SUPER = 64,\n    SCOPE_DIRECT_SUPER = 128,\n    SCOPE_CLASS_STATIC_BLOCK = 256,\n    SCOPE_CLASS_FIELD_INIT = 512,\n    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION | SCOPE_CLASS_STATIC_BLOCK;\n\nfunction functionFlags(async, generator) {\n  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)\n}\n\n// Used in checkLVal* and declareName to determine the type of a binding\nvar\n    BIND_NONE = 0, // Not a binding\n    BIND_VAR = 1, // Var-style binding\n    BIND_LEXICAL = 2, // Let- or const-style binding\n    BIND_FUNCTION = 3, // Function declaration\n    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding\n    BIND_OUTSIDE = 5; // Special case for function names as bound inside the function\n\nvar Parser = function Parser(options, input, startPos) {\n  this.options = options = getOptions(options);\n  this.sourceFile = options.sourceFile;\n  this.keywords = wordsRegexp(keywords$1[options.ecmaVersion >= 6 ? 6 : options.sourceType === \"module\" ? \"5module\" : 5]);\n  var reserved = \"\";\n  if (options.allowReserved !== true) {\n    reserved = reservedWords[options.ecmaVersion >= 6 ? 6 : options.ecmaVersion === 5 ? 5 : 3];\n    if (options.sourceType === \"module\") { reserved += \" await\"; }\n  }\n  this.reservedWords = wordsRegexp(reserved);\n  var reservedStrict = (reserved ? reserved + \" \" : \"\") + reservedWords.strict;\n  this.reservedWordsStrict = wordsRegexp(reservedStrict);\n  this.reservedWordsStrictBind = wordsRegexp(reservedStrict + \" \" + reservedWords.strictBind);\n  this.input = String(input);\n\n  // Used to signal to callers of `readWord1` whether the word\n  // contained any escape sequences. This is needed because words with\n  // escape sequences must not be interpreted as keywords.\n  this.containsEsc = false;\n\n  // Set up token state\n\n  // The current position of the tokenizer in the input.\n  if (startPos) {\n    this.pos = startPos;\n    this.lineStart = this.input.lastIndexOf(\"\\n\", startPos - 1) + 1;\n    this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;\n  } else {\n    this.pos = this.lineStart = 0;\n    this.curLine = 1;\n  }\n\n  // Properties of the current token:\n  // Its type\n  this.type = types$1.eof;\n  // For tokens that include more information than their type, the value\n  this.value = null;\n  // Its start and end offset\n  this.start = this.end = this.pos;\n  // And, if locations are used, the {line, column} object\n  // corresponding to those offsets\n  this.startLoc = this.endLoc = this.curPosition();\n\n  // Position information for the previous token\n  this.lastTokEndLoc = this.lastTokStartLoc = null;\n  this.lastTokStart = this.lastTokEnd = this.pos;\n\n  // The context stack is used to superficially track syntactic\n  // context to predict whether a regular expression is allowed in a\n  // given position.\n  this.context = this.initialContext();\n  this.exprAllowed = true;\n\n  // Figure out if it's a module code.\n  this.inModule = options.sourceType === \"module\";\n  this.strict = this.inModule || this.strictDirective(this.pos);\n\n  // Used to signify the start of a potential arrow function\n  this.potentialArrowAt = -1;\n  this.potentialArrowInForAwait = false;\n\n  // Positions to delayed-check that yield/await does not exist in default parameters.\n  this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;\n  // Labels in scope.\n  this.labels = [];\n  // Thus-far undefined exports.\n  this.undefinedExports = Object.create(null);\n\n  // If enabled, skip leading hashbang line.\n  if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === \"#!\")\n    { this.skipLineComment(2); }\n\n  // Scope tracking for duplicate variable names (see scope.js)\n  this.scopeStack = [];\n  this.enterScope(SCOPE_TOP);\n\n  // For RegExp validation\n  this.regexpState = null;\n\n  // The stack of private names.\n  // Each element has two properties: 'declared' and 'used'.\n  // When it exited from the outermost class definition, all used private names must be declared.\n  this.privateNameStack = [];\n};\n\nvar prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },canAwait: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true },allowNewDotTarget: { configurable: true },inClassStaticBlock: { configurable: true } };\n\nParser.prototype.parse = function parse () {\n  var node = this.options.program || this.startNode();\n  this.nextToken();\n  return this.parseTopLevel(node)\n};\n\nprototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };\n\nprototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 };\n\nprototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 };\n\nprototypeAccessors.canAwait.get = function () {\n  for (var i = this.scopeStack.length - 1; i >= 0; i--) {\n    var ref = this.scopeStack[i];\n      var flags = ref.flags;\n    if (flags & (SCOPE_CLASS_STATIC_BLOCK | SCOPE_CLASS_FIELD_INIT)) { return false }\n    if (flags & SCOPE_FUNCTION) { return (flags & SCOPE_ASYNC) > 0 }\n  }\n  return (this.inModule && this.options.ecmaVersion >= 13) || this.options.allowAwaitOutsideFunction\n};\n\nprototypeAccessors.allowSuper.get = function () {\n  var ref = this.currentThisScope();\n    var flags = ref.flags;\n  return (flags & SCOPE_SUPER) > 0 || this.options.allowSuperOutsideMethod\n};\n\nprototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };\n\nprototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };\n\nprototypeAccessors.allowNewDotTarget.get = function () {\n  for (var i = this.scopeStack.length - 1; i >= 0; i--) {\n    var ref = this.scopeStack[i];\n      var flags = ref.flags;\n    if (flags & (SCOPE_CLASS_STATIC_BLOCK | SCOPE_CLASS_FIELD_INIT) ||\n        ((flags & SCOPE_FUNCTION) && !(flags & SCOPE_ARROW))) { return true }\n  }\n  return false\n};\n\nprototypeAccessors.inClassStaticBlock.get = function () {\n  return (this.currentVarScope().flags & SCOPE_CLASS_STATIC_BLOCK) > 0\n};\n\nParser.extend = function extend () {\n    var plugins = [], len = arguments.length;\n    while ( len-- ) plugins[ len ] = arguments[ len ];\n\n  var cls = this;\n  for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }\n  return cls\n};\n\nParser.parse = function parse (input, options) {\n  return new this(options, input).parse()\n};\n\nParser.parseExpressionAt = function parseExpressionAt (input, pos, options) {\n  var parser = new this(options, input, pos);\n  parser.nextToken();\n  return parser.parseExpression()\n};\n\nParser.tokenizer = function tokenizer (input, options) {\n  return new this(options, input)\n};\n\nObject.defineProperties( Parser.prototype, prototypeAccessors );\n\nvar pp$9 = Parser.prototype;\n\n// ## Parser utilities\n\nvar literal = /^(?:'((?:\\\\[^]|[^'\\\\])*?)'|\"((?:\\\\[^]|[^\"\\\\])*?)\")/;\npp$9.strictDirective = function(start) {\n  if (this.options.ecmaVersion < 5) { return false }\n  for (;;) {\n    // Try to find string literal.\n    skipWhiteSpace.lastIndex = start;\n    start += skipWhiteSpace.exec(this.input)[0].length;\n    var match = literal.exec(this.input.slice(start));\n    if (!match) { return false }\n    if ((match[1] || match[2]) === \"use strict\") {\n      skipWhiteSpace.lastIndex = start + match[0].length;\n      var spaceAfter = skipWhiteSpace.exec(this.input), end = spaceAfter.index + spaceAfter[0].length;\n      var next = this.input.charAt(end);\n      return next === \";\" || next === \"}\" ||\n        (lineBreak.test(spaceAfter[0]) &&\n         !(/[(`.[+\\-/*%<>=,?^&]/.test(next) || next === \"!\" && this.input.charAt(end + 1) === \"=\"))\n    }\n    start += match[0].length;\n\n    // Skip semicolon, if any.\n    skipWhiteSpace.lastIndex = start;\n    start += skipWhiteSpace.exec(this.input)[0].length;\n    if (this.input[start] === \";\")\n      { start++; }\n  }\n};\n\n// Predicate that tests whether the next token is of the given\n// type, and if yes, consumes it as a side effect.\n\npp$9.eat = function(type) {\n  if (this.type === type) {\n    this.next();\n    return true\n  } else {\n    return false\n  }\n};\n\n// Tests whether parsed token is a contextual keyword.\n\npp$9.isContextual = function(name) {\n  return this.type === types$1.name && this.value === name && !this.containsEsc\n};\n\n// Consumes contextual keyword if possible.\n\npp$9.eatContextual = function(name) {\n  if (!this.isContextual(name)) { return false }\n  this.next();\n  return true\n};\n\n// Asserts that following token is given contextual keyword.\n\npp$9.expectContextual = function(name) {\n  if (!this.eatContextual(name)) { this.unexpected(); }\n};\n\n// Test whether a semicolon can be inserted at the current position.\n\npp$9.canInsertSemicolon = function() {\n  return this.type === types$1.eof ||\n    this.type === types$1.braceR ||\n    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n};\n\npp$9.insertSemicolon = function() {\n  if (this.canInsertSemicolon()) {\n    if (this.options.onInsertedSemicolon)\n      { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }\n    return true\n  }\n};\n\n// Consume a semicolon, or, failing that, see if we are allowed to\n// pretend that there is a semicolon at this position.\n\npp$9.semicolon = function() {\n  if (!this.eat(types$1.semi) && !this.insertSemicolon()) { this.unexpected(); }\n};\n\npp$9.afterTrailingComma = function(tokType, notNext) {\n  if (this.type === tokType) {\n    if (this.options.onTrailingComma)\n      { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }\n    if (!notNext)\n      { this.next(); }\n    return true\n  }\n};\n\n// Expect a token of a given type. If found, consume it, otherwise,\n// raise an unexpected token error.\n\npp$9.expect = function(type) {\n  this.eat(type) || this.unexpected();\n};\n\n// Raise an unexpected token error.\n\npp$9.unexpected = function(pos) {\n  this.raise(pos != null ? pos : this.start, \"Unexpected token\");\n};\n\nvar DestructuringErrors = function DestructuringErrors() {\n  this.shorthandAssign =\n  this.trailingComma =\n  this.parenthesizedAssign =\n  this.parenthesizedBind =\n  this.doubleProto =\n    -1;\n};\n\npp$9.checkPatternErrors = function(refDestructuringErrors, isAssign) {\n  if (!refDestructuringErrors) { return }\n  if (refDestructuringErrors.trailingComma > -1)\n    { this.raiseRecoverable(refDestructuringErrors.trailingComma, \"Comma is not permitted after the rest element\"); }\n  var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;\n  if (parens > -1) { this.raiseRecoverable(parens, isAssign ? \"Assigning to rvalue\" : \"Parenthesized pattern\"); }\n};\n\npp$9.checkExpressionErrors = function(refDestructuringErrors, andThrow) {\n  if (!refDestructuringErrors) { return false }\n  var shorthandAssign = refDestructuringErrors.shorthandAssign;\n  var doubleProto = refDestructuringErrors.doubleProto;\n  if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }\n  if (shorthandAssign >= 0)\n    { this.raise(shorthandAssign, \"Shorthand property assignments are valid only in destructuring patterns\"); }\n  if (doubleProto >= 0)\n    { this.raiseRecoverable(doubleProto, \"Redefinition of __proto__ property\"); }\n};\n\npp$9.checkYieldAwaitInDefaultParams = function() {\n  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))\n    { this.raise(this.yieldPos, \"Yield expression cannot be a default value\"); }\n  if (this.awaitPos)\n    { this.raise(this.awaitPos, \"Await expression cannot be a default value\"); }\n};\n\npp$9.isSimpleAssignTarget = function(expr) {\n  if (expr.type === \"ParenthesizedExpression\")\n    { return this.isSimpleAssignTarget(expr.expression) }\n  return expr.type === \"Identifier\" || expr.type === \"MemberExpression\"\n};\n\nvar pp$8 = Parser.prototype;\n\n// ### Statement parsing\n\n// Parse a program. Initializes the parser, reads any number of\n// statements, and wraps them in a Program node.  Optionally takes a\n// `program` argument.  If present, the statements will be appended\n// to its body instead of creating a new node.\n\npp$8.parseTopLevel = function(node) {\n  var exports = Object.create(null);\n  if (!node.body) { node.body = []; }\n  while (this.type !== types$1.eof) {\n    var stmt = this.parseStatement(null, true, exports);\n    node.body.push(stmt);\n  }\n  if (this.inModule)\n    { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)\n      {\n        var name = list[i];\n\n        this.raiseRecoverable(this.undefinedExports[name].start, (\"Export '\" + name + \"' is not defined\"));\n      } }\n  this.adaptDirectivePrologue(node.body);\n  this.next();\n  node.sourceType = this.options.sourceType;\n  return this.finishNode(node, \"Program\")\n};\n\nvar loopLabel = {kind: \"loop\"}, switchLabel = {kind: \"switch\"};\n\npp$8.isLet = function(context) {\n  if (this.options.ecmaVersion < 6 || !this.isContextual(\"let\")) { return false }\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n  // For ambiguous cases, determine if a LexicalDeclaration (or only a\n  // Statement) is allowed here. If context is not empty then only a Statement\n  // is allowed. However, `let [` is an explicit negative lookahead for\n  // ExpressionStatement, so special-case it first.\n  if (nextCh === 91 || nextCh === 92) { return true } // '[', '\\'\n  if (context) { return false }\n\n  if (nextCh === 123 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true } // '{', astral\n  if (isIdentifierStart(nextCh, true)) {\n    var pos = next + 1;\n    while (isIdentifierChar(nextCh = this.input.charCodeAt(pos), true)) { ++pos; }\n    if (nextCh === 92 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true }\n    var ident = this.input.slice(next, pos);\n    if (!keywordRelationalOperator.test(ident)) { return true }\n  }\n  return false\n};\n\n// check 'async [no LineTerminator here] function'\n// - 'async /*foo*/ function' is OK.\n// - 'async /*\\n*/ function' is invalid.\npp$8.isAsyncFunction = function() {\n  if (this.options.ecmaVersion < 8 || !this.isContextual(\"async\"))\n    { return false }\n\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length, after;\n  return !lineBreak.test(this.input.slice(this.pos, next)) &&\n    this.input.slice(next, next + 8) === \"function\" &&\n    (next + 8 === this.input.length ||\n     !(isIdentifierChar(after = this.input.charCodeAt(next + 8)) || after > 0xd7ff && after < 0xdc00))\n};\n\npp$8.isUsingKeyword = function(isAwaitUsing, isFor) {\n  if (this.options.ecmaVersion < 17 || !this.isContextual(isAwaitUsing ? \"await\" : \"using\"))\n    { return false }\n\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length;\n\n  if (lineBreak.test(this.input.slice(this.pos, next))) { return false }\n\n  if (isAwaitUsing) {\n    var awaitEndPos = next + 5 /* await */, after;\n    if (this.input.slice(next, awaitEndPos) !== \"using\" ||\n      awaitEndPos === this.input.length ||\n      isIdentifierChar(after = this.input.charCodeAt(awaitEndPos)) ||\n      (after > 0xd7ff && after < 0xdc00)\n    ) { return false }\n\n    skipWhiteSpace.lastIndex = awaitEndPos;\n    var skipAfterUsing = skipWhiteSpace.exec(this.input);\n    if (skipAfterUsing && lineBreak.test(this.input.slice(awaitEndPos, awaitEndPos + skipAfterUsing[0].length))) { return false }\n  }\n\n  if (isFor) {\n    var ofEndPos = next + 2 /* of */, after$1;\n    if (this.input.slice(next, ofEndPos) === \"of\") {\n      if (ofEndPos === this.input.length ||\n        (!isIdentifierChar(after$1 = this.input.charCodeAt(ofEndPos)) && !(after$1 > 0xd7ff && after$1 < 0xdc00))) { return false }\n    }\n  }\n\n  var ch = this.input.charCodeAt(next);\n  return isIdentifierStart(ch, true) || ch === 92 // '\\'\n};\n\npp$8.isAwaitUsing = function(isFor) {\n  return this.isUsingKeyword(true, isFor)\n};\n\npp$8.isUsing = function(isFor) {\n  return this.isUsingKeyword(false, isFor)\n};\n\n// Parse a single statement.\n//\n// If expecting a statement and finding a slash operator, parse a\n// regular expression literal. This is to handle cases like\n// `if (foo) /blah/.exec(foo)`, where looking at the previous token\n// does not help.\n\npp$8.parseStatement = function(context, topLevel, exports) {\n  var starttype = this.type, node = this.startNode(), kind;\n\n  if (this.isLet(context)) {\n    starttype = types$1._var;\n    kind = \"let\";\n  }\n\n  // Most types of statements are recognized by the keyword they\n  // start with. Many are trivial to parse, some require a bit of\n  // complexity.\n\n  switch (starttype) {\n  case types$1._break: case types$1._continue: return this.parseBreakContinueStatement(node, starttype.keyword)\n  case types$1._debugger: return this.parseDebuggerStatement(node)\n  case types$1._do: return this.parseDoStatement(node)\n  case types$1._for: return this.parseForStatement(node)\n  case types$1._function:\n    // Function as sole body of either an if statement or a labeled statement\n    // works, but not when it is part of a labeled statement that is the sole\n    // body of an if statement.\n    if ((context && (this.strict || context !== \"if\" && context !== \"label\")) && this.options.ecmaVersion >= 6) { this.unexpected(); }\n    return this.parseFunctionStatement(node, false, !context)\n  case types$1._class:\n    if (context) { this.unexpected(); }\n    return this.parseClass(node, true)\n  case types$1._if: return this.parseIfStatement(node)\n  case types$1._return: return this.parseReturnStatement(node)\n  case types$1._switch: return this.parseSwitchStatement(node)\n  case types$1._throw: return this.parseThrowStatement(node)\n  case types$1._try: return this.parseTryStatement(node)\n  case types$1._const: case types$1._var:\n    kind = kind || this.value;\n    if (context && kind !== \"var\") { this.unexpected(); }\n    return this.parseVarStatement(node, kind)\n  case types$1._while: return this.parseWhileStatement(node)\n  case types$1._with: return this.parseWithStatement(node)\n  case types$1.braceL: return this.parseBlock(true, node)\n  case types$1.semi: return this.parseEmptyStatement(node)\n  case types$1._export:\n  case types$1._import:\n    if (this.options.ecmaVersion > 10 && starttype === types$1._import) {\n      skipWhiteSpace.lastIndex = this.pos;\n      var skip = skipWhiteSpace.exec(this.input);\n      var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n      if (nextCh === 40 || nextCh === 46) // '(' or '.'\n        { return this.parseExpressionStatement(node, this.parseExpression()) }\n    }\n\n    if (!this.options.allowImportExportEverywhere) {\n      if (!topLevel)\n        { this.raise(this.start, \"'import' and 'export' may only appear at the top level\"); }\n      if (!this.inModule)\n        { this.raise(this.start, \"'import' and 'export' may appear only with 'sourceType: module'\"); }\n    }\n    return starttype === types$1._import ? this.parseImport(node) : this.parseExport(node, exports)\n\n    // If the statement does not start with a statement keyword or a\n    // brace, it's an ExpressionStatement or LabeledStatement. We\n    // simply start parsing an expression, and afterwards, if the\n    // next token is a colon and the expression was a simple\n    // Identifier node, we switch to interpreting it as a label.\n  default:\n    if (this.isAsyncFunction()) {\n      if (context) { this.unexpected(); }\n      this.next();\n      return this.parseFunctionStatement(node, true, !context)\n    }\n\n    var usingKind = this.isAwaitUsing(false) ? \"await using\" : this.isUsing(false) ? \"using\" : null;\n    if (usingKind) {\n      if (topLevel && this.options.sourceType === \"script\") {\n        this.raise(this.start, \"Using declaration cannot appear in the top level when source type is `script`\");\n      }\n      if (usingKind === \"await using\") {\n        if (!this.canAwait) {\n          this.raise(this.start, \"Await using cannot appear outside of async function\");\n        }\n        this.next();\n      }\n      this.next();\n      this.parseVar(node, false, usingKind);\n      this.semicolon();\n      return this.finishNode(node, \"VariableDeclaration\")\n    }\n\n    var maybeName = this.value, expr = this.parseExpression();\n    if (starttype === types$1.name && expr.type === \"Identifier\" && this.eat(types$1.colon))\n      { return this.parseLabeledStatement(node, maybeName, expr, context) }\n    else { return this.parseExpressionStatement(node, expr) }\n  }\n};\n\npp$8.parseBreakContinueStatement = function(node, keyword) {\n  var isBreak = keyword === \"break\";\n  this.next();\n  if (this.eat(types$1.semi) || this.insertSemicolon()) { node.label = null; }\n  else if (this.type !== types$1.name) { this.unexpected(); }\n  else {\n    node.label = this.parseIdent();\n    this.semicolon();\n  }\n\n  // Verify that there is an actual destination to break or\n  // continue to.\n  var i = 0;\n  for (; i < this.labels.length; ++i) {\n    var lab = this.labels[i];\n    if (node.label == null || lab.name === node.label.name) {\n      if (lab.kind != null && (isBreak || lab.kind === \"loop\")) { break }\n      if (node.label && isBreak) { break }\n    }\n  }\n  if (i === this.labels.length) { this.raise(node.start, \"Unsyntactic \" + keyword); }\n  return this.finishNode(node, isBreak ? \"BreakStatement\" : \"ContinueStatement\")\n};\n\npp$8.parseDebuggerStatement = function(node) {\n  this.next();\n  this.semicolon();\n  return this.finishNode(node, \"DebuggerStatement\")\n};\n\npp$8.parseDoStatement = function(node) {\n  this.next();\n  this.labels.push(loopLabel);\n  node.body = this.parseStatement(\"do\");\n  this.labels.pop();\n  this.expect(types$1._while);\n  node.test = this.parseParenExpression();\n  if (this.options.ecmaVersion >= 6)\n    { this.eat(types$1.semi); }\n  else\n    { this.semicolon(); }\n  return this.finishNode(node, \"DoWhileStatement\")\n};\n\n// Disambiguating between a `for` and a `for`/`in` or `for`/`of`\n// loop is non-trivial. Basically, we have to parse the init `var`\n// statement or expression, disallowing the `in` operator (see\n// the second parameter to `parseExpression`), and then check\n// whether the next token is `in` or `of`. When there is no init\n// part (semicolon immediately after the opening parenthesis), it\n// is a regular `for` loop.\n\npp$8.parseForStatement = function(node) {\n  this.next();\n  var awaitAt = (this.options.ecmaVersion >= 9 && this.canAwait && this.eatContextual(\"await\")) ? this.lastTokStart : -1;\n  this.labels.push(loopLabel);\n  this.enterScope(0);\n  this.expect(types$1.parenL);\n  if (this.type === types$1.semi) {\n    if (awaitAt > -1) { this.unexpected(awaitAt); }\n    return this.parseFor(node, null)\n  }\n  var isLet = this.isLet();\n  if (this.type === types$1._var || this.type === types$1._const || isLet) {\n    var init$1 = this.startNode(), kind = isLet ? \"let\" : this.value;\n    this.next();\n    this.parseVar(init$1, true, kind);\n    this.finishNode(init$1, \"VariableDeclaration\");\n    return this.parseForAfterInit(node, init$1, awaitAt)\n  }\n  var startsWithLet = this.isContextual(\"let\"), isForOf = false;\n\n  var usingKind = this.isUsing(true) ? \"using\" : this.isAwaitUsing(true) ? \"await using\" : null;\n  if (usingKind) {\n    var init$2 = this.startNode();\n    this.next();\n    if (usingKind === \"await using\") { this.next(); }\n    this.parseVar(init$2, true, usingKind);\n    this.finishNode(init$2, \"VariableDeclaration\");\n    return this.parseForAfterInit(node, init$2, awaitAt)\n  }\n  var containsEsc = this.containsEsc;\n  var refDestructuringErrors = new DestructuringErrors;\n  var initPos = this.start;\n  var init = awaitAt > -1\n    ? this.parseExprSubscripts(refDestructuringErrors, \"await\")\n    : this.parseExpression(true, refDestructuringErrors);\n  if (this.type === types$1._in || (isForOf = this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) {\n    if (awaitAt > -1) { // implies `ecmaVersion >= 9` (see declaration of awaitAt)\n      if (this.type === types$1._in) { this.unexpected(awaitAt); }\n      node.await = true;\n    } else if (isForOf && this.options.ecmaVersion >= 8) {\n      if (init.start === initPos && !containsEsc && init.type === \"Identifier\" && init.name === \"async\") { this.unexpected(); }\n      else if (this.options.ecmaVersion >= 9) { node.await = false; }\n    }\n    if (startsWithLet && isForOf) { this.raise(init.start, \"The left-hand side of a for-of loop may not start with 'let'.\"); }\n    this.toAssignable(init, false, refDestructuringErrors);\n    this.checkLValPattern(init);\n    return this.parseForIn(node, init)\n  } else {\n    this.checkExpressionErrors(refDestructuringErrors, true);\n  }\n  if (awaitAt > -1) { this.unexpected(awaitAt); }\n  return this.parseFor(node, init)\n};\n\n// Helper method to parse for loop after variable initialization\npp$8.parseForAfterInit = function(node, init, awaitAt) {\n  if ((this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) && init.declarations.length === 1) {\n    if (this.options.ecmaVersion >= 9) {\n      if (this.type === types$1._in) {\n        if (awaitAt > -1) { this.unexpected(awaitAt); }\n      } else { node.await = awaitAt > -1; }\n    }\n    return this.parseForIn(node, init)\n  }\n  if (awaitAt > -1) { this.unexpected(awaitAt); }\n  return this.parseFor(node, init)\n};\n\npp$8.parseFunctionStatement = function(node, isAsync, declarationPosition) {\n  this.next();\n  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)\n};\n\npp$8.parseIfStatement = function(node) {\n  this.next();\n  node.test = this.parseParenExpression();\n  // allow function declarations in branches, but only in non-strict mode\n  node.consequent = this.parseStatement(\"if\");\n  node.alternate = this.eat(types$1._else) ? this.parseStatement(\"if\") : null;\n  return this.finishNode(node, \"IfStatement\")\n};\n\npp$8.parseReturnStatement = function(node) {\n  if (!this.inFunction && !this.options.allowReturnOutsideFunction)\n    { this.raise(this.start, \"'return' outside of function\"); }\n  this.next();\n\n  // In `return` (and `break`/`continue`), the keywords with\n  // optional arguments, we eagerly look for a semicolon or the\n  // possibility to insert one.\n\n  if (this.eat(types$1.semi) || this.insertSemicolon()) { node.argument = null; }\n  else { node.argument = this.parseExpression(); this.semicolon(); }\n  return this.finishNode(node, \"ReturnStatement\")\n};\n\npp$8.parseSwitchStatement = function(node) {\n  this.next();\n  node.discriminant = this.parseParenExpression();\n  node.cases = [];\n  this.expect(types$1.braceL);\n  this.labels.push(switchLabel);\n  this.enterScope(0);\n\n  // Statements under must be grouped (by label) in SwitchCase\n  // nodes. `cur` is used to keep the node that we are currently\n  // adding statements to.\n\n  var cur;\n  for (var sawDefault = false; this.type !== types$1.braceR;) {\n    if (this.type === types$1._case || this.type === types$1._default) {\n      var isCase = this.type === types$1._case;\n      if (cur) { this.finishNode(cur, \"SwitchCase\"); }\n      node.cases.push(cur = this.startNode());\n      cur.consequent = [];\n      this.next();\n      if (isCase) {\n        cur.test = this.parseExpression();\n      } else {\n        if (sawDefault) { this.raiseRecoverable(this.lastTokStart, \"Multiple default clauses\"); }\n        sawDefault = true;\n        cur.test = null;\n      }\n      this.expect(types$1.colon);\n    } else {\n      if (!cur) { this.unexpected(); }\n      cur.consequent.push(this.parseStatement(null));\n    }\n  }\n  this.exitScope();\n  if (cur) { this.finishNode(cur, \"SwitchCase\"); }\n  this.next(); // Closing brace\n  this.labels.pop();\n  return this.finishNode(node, \"SwitchStatement\")\n};\n\npp$8.parseThrowStatement = function(node) {\n  this.next();\n  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))\n    { this.raise(this.lastTokEnd, \"Illegal newline after throw\"); }\n  node.argument = this.parseExpression();\n  this.semicolon();\n  return this.finishNode(node, \"ThrowStatement\")\n};\n\n// Reused empty array added for node fields that are always empty.\n\nvar empty$1 = [];\n\npp$8.parseCatchClauseParam = function() {\n  var param = this.parseBindingAtom();\n  var simple = param.type === \"Identifier\";\n  this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);\n  this.checkLValPattern(param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);\n  this.expect(types$1.parenR);\n\n  return param\n};\n\npp$8.parseTryStatement = function(node) {\n  this.next();\n  node.block = this.parseBlock();\n  node.handler = null;\n  if (this.type === types$1._catch) {\n    var clause = this.startNode();\n    this.next();\n    if (this.eat(types$1.parenL)) {\n      clause.param = this.parseCatchClauseParam();\n    } else {\n      if (this.options.ecmaVersion < 10) { this.unexpected(); }\n      clause.param = null;\n      this.enterScope(0);\n    }\n    clause.body = this.parseBlock(false);\n    this.exitScope();\n    node.handler = this.finishNode(clause, \"CatchClause\");\n  }\n  node.finalizer = this.eat(types$1._finally) ? this.parseBlock() : null;\n  if (!node.handler && !node.finalizer)\n    { this.raise(node.start, \"Missing catch or finally clause\"); }\n  return this.finishNode(node, \"TryStatement\")\n};\n\npp$8.parseVarStatement = function(node, kind, allowMissingInitializer) {\n  this.next();\n  this.parseVar(node, false, kind, allowMissingInitializer);\n  this.semicolon();\n  return this.finishNode(node, \"VariableDeclaration\")\n};\n\npp$8.parseWhileStatement = function(node) {\n  this.next();\n  node.test = this.parseParenExpression();\n  this.labels.push(loopLabel);\n  node.body = this.parseStatement(\"while\");\n  this.labels.pop();\n  return this.finishNode(node, \"WhileStatement\")\n};\n\npp$8.parseWithStatement = function(node) {\n  if (this.strict) { this.raise(this.start, \"'with' in strict mode\"); }\n  this.next();\n  node.object = this.parseParenExpression();\n  node.body = this.parseStatement(\"with\");\n  return this.finishNode(node, \"WithStatement\")\n};\n\npp$8.parseEmptyStatement = function(node) {\n  this.next();\n  return this.finishNode(node, \"EmptyStatement\")\n};\n\npp$8.parseLabeledStatement = function(node, maybeName, expr, context) {\n  for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)\n    {\n    var label = list[i$1];\n\n    if (label.name === maybeName)\n      { this.raise(expr.start, \"Label '\" + maybeName + \"' is already declared\");\n  } }\n  var kind = this.type.isLoop ? \"loop\" : this.type === types$1._switch ? \"switch\" : null;\n  for (var i = this.labels.length - 1; i >= 0; i--) {\n    var label$1 = this.labels[i];\n    if (label$1.statementStart === node.start) {\n      // Update information about previous labels on this node\n      label$1.statementStart = this.start;\n      label$1.kind = kind;\n    } else { break }\n  }\n  this.labels.push({name: maybeName, kind: kind, statementStart: this.start});\n  node.body = this.parseStatement(context ? context.indexOf(\"label\") === -1 ? context + \"label\" : context : \"label\");\n  this.labels.pop();\n  node.label = expr;\n  return this.finishNode(node, \"LabeledStatement\")\n};\n\npp$8.parseExpressionStatement = function(node, expr) {\n  node.expression = expr;\n  this.semicolon();\n  return this.finishNode(node, \"ExpressionStatement\")\n};\n\n// Parse a semicolon-enclosed block of statements, handling `\"use\n// strict\"` declarations when `allowStrict` is true (used for\n// function bodies).\n\npp$8.parseBlock = function(createNewLexicalScope, node, exitStrict) {\n  if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;\n  if ( node === void 0 ) node = this.startNode();\n\n  node.body = [];\n  this.expect(types$1.braceL);\n  if (createNewLexicalScope) { this.enterScope(0); }\n  while (this.type !== types$1.braceR) {\n    var stmt = this.parseStatement(null);\n    node.body.push(stmt);\n  }\n  if (exitStrict) { this.strict = false; }\n  this.next();\n  if (createNewLexicalScope) { this.exitScope(); }\n  return this.finishNode(node, \"BlockStatement\")\n};\n\n// Parse a regular `for` loop. The disambiguation code in\n// `parseStatement` will already have parsed the init statement or\n// expression.\n\npp$8.parseFor = function(node, init) {\n  node.init = init;\n  this.expect(types$1.semi);\n  node.test = this.type === types$1.semi ? null : this.parseExpression();\n  this.expect(types$1.semi);\n  node.update = this.type === types$1.parenR ? null : this.parseExpression();\n  this.expect(types$1.parenR);\n  node.body = this.parseStatement(\"for\");\n  this.exitScope();\n  this.labels.pop();\n  return this.finishNode(node, \"ForStatement\")\n};\n\n// Parse a `for`/`in` and `for`/`of` loop, which are almost\n// same from parser's perspective.\n\npp$8.parseForIn = function(node, init) {\n  var isForIn = this.type === types$1._in;\n  this.next();\n\n  if (\n    init.type === \"VariableDeclaration\" &&\n    init.declarations[0].init != null &&\n    (\n      !isForIn ||\n      this.options.ecmaVersion < 8 ||\n      this.strict ||\n      init.kind !== \"var\" ||\n      init.declarations[0].id.type !== \"Identifier\"\n    )\n  ) {\n    this.raise(\n      init.start,\n      ((isForIn ? \"for-in\" : \"for-of\") + \" loop variable declaration may not have an initializer\")\n    );\n  }\n  node.left = init;\n  node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();\n  this.expect(types$1.parenR);\n  node.body = this.parseStatement(\"for\");\n  this.exitScope();\n  this.labels.pop();\n  return this.finishNode(node, isForIn ? \"ForInStatement\" : \"ForOfStatement\")\n};\n\n// Parse a list of variable declarations.\n\npp$8.parseVar = function(node, isFor, kind, allowMissingInitializer) {\n  node.declarations = [];\n  node.kind = kind;\n  for (;;) {\n    var decl = this.startNode();\n    this.parseVarId(decl, kind);\n    if (this.eat(types$1.eq)) {\n      decl.init = this.parseMaybeAssign(isFor);\n    } else if (!allowMissingInitializer && kind === \"const\" && !(this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\")))) {\n      this.unexpected();\n    } else if (!allowMissingInitializer && (kind === \"using\" || kind === \"await using\") && this.options.ecmaVersion >= 17 && this.type !== types$1._in && !this.isContextual(\"of\")) {\n      this.raise(this.lastTokEnd, (\"Missing initializer in \" + kind + \" declaration\"));\n    } else if (!allowMissingInitializer && decl.id.type !== \"Identifier\" && !(isFor && (this.type === types$1._in || this.isContextual(\"of\")))) {\n      this.raise(this.lastTokEnd, \"Complex binding patterns require an initialization value\");\n    } else {\n      decl.init = null;\n    }\n    node.declarations.push(this.finishNode(decl, \"VariableDeclarator\"));\n    if (!this.eat(types$1.comma)) { break }\n  }\n  return node\n};\n\npp$8.parseVarId = function(decl, kind) {\n  decl.id = kind === \"using\" || kind === \"await using\"\n    ? this.parseIdent()\n    : this.parseBindingAtom();\n\n  this.checkLValPattern(decl.id, kind === \"var\" ? BIND_VAR : BIND_LEXICAL, false);\n};\n\nvar FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;\n\n// Parse a function declaration or literal (depending on the\n// `statement & FUNC_STATEMENT`).\n\n// Remove `allowExpressionBody` for 7.0.0, as it is only called with false\npp$8.parseFunction = function(node, statement, allowExpressionBody, isAsync, forInit) {\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {\n    if (this.type === types$1.star && (statement & FUNC_HANGING_STATEMENT))\n      { this.unexpected(); }\n    node.generator = this.eat(types$1.star);\n  }\n  if (this.options.ecmaVersion >= 8)\n    { node.async = !!isAsync; }\n\n  if (statement & FUNC_STATEMENT) {\n    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types$1.name ? null : this.parseIdent();\n    if (node.id && !(statement & FUNC_HANGING_STATEMENT))\n      // If it is a regular function declaration in sloppy mode, then it is\n      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding\n      // mode depends on properties of the current scope (see\n      // treatFunctionsAsVar).\n      { this.checkLValSimple(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }\n  }\n\n  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n  this.enterScope(functionFlags(node.async, node.generator));\n\n  if (!(statement & FUNC_STATEMENT))\n    { node.id = this.type === types$1.name ? this.parseIdent() : null; }\n\n  this.parseFunctionParams(node);\n  this.parseFunctionBody(node, allowExpressionBody, false, forInit);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, (statement & FUNC_STATEMENT) ? \"FunctionDeclaration\" : \"FunctionExpression\")\n};\n\npp$8.parseFunctionParams = function(node) {\n  this.expect(types$1.parenL);\n  node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);\n  this.checkYieldAwaitInDefaultParams();\n};\n\n// Parse a class declaration or literal (depending on the\n// `isStatement` parameter).\n\npp$8.parseClass = function(node, isStatement) {\n  this.next();\n\n  // ecma-262 14.6 Class Definitions\n  // A class definition is always strict mode code.\n  var oldStrict = this.strict;\n  this.strict = true;\n\n  this.parseClassId(node, isStatement);\n  this.parseClassSuper(node);\n  var privateNameMap = this.enterClassBody();\n  var classBody = this.startNode();\n  var hadConstructor = false;\n  classBody.body = [];\n  this.expect(types$1.braceL);\n  while (this.type !== types$1.braceR) {\n    var element = this.parseClassElement(node.superClass !== null);\n    if (element) {\n      classBody.body.push(element);\n      if (element.type === \"MethodDefinition\" && element.kind === \"constructor\") {\n        if (hadConstructor) { this.raiseRecoverable(element.start, \"Duplicate constructor in the same class\"); }\n        hadConstructor = true;\n      } else if (element.key && element.key.type === \"PrivateIdentifier\" && isPrivateNameConflicted(privateNameMap, element)) {\n        this.raiseRecoverable(element.key.start, (\"Identifier '#\" + (element.key.name) + \"' has already been declared\"));\n      }\n    }\n  }\n  this.strict = oldStrict;\n  this.next();\n  node.body = this.finishNode(classBody, \"ClassBody\");\n  this.exitClassBody();\n  return this.finishNode(node, isStatement ? \"ClassDeclaration\" : \"ClassExpression\")\n};\n\npp$8.parseClassElement = function(constructorAllowsSuper) {\n  if (this.eat(types$1.semi)) { return null }\n\n  var ecmaVersion = this.options.ecmaVersion;\n  var node = this.startNode();\n  var keyName = \"\";\n  var isGenerator = false;\n  var isAsync = false;\n  var kind = \"method\";\n  var isStatic = false;\n\n  if (this.eatContextual(\"static\")) {\n    // Parse static init block\n    if (ecmaVersion >= 13 && this.eat(types$1.braceL)) {\n      this.parseClassStaticBlock(node);\n      return node\n    }\n    if (this.isClassElementNameStart() || this.type === types$1.star) {\n      isStatic = true;\n    } else {\n      keyName = \"static\";\n    }\n  }\n  node.static = isStatic;\n  if (!keyName && ecmaVersion >= 8 && this.eatContextual(\"async\")) {\n    if ((this.isClassElementNameStart() || this.type === types$1.star) && !this.canInsertSemicolon()) {\n      isAsync = true;\n    } else {\n      keyName = \"async\";\n    }\n  }\n  if (!keyName && (ecmaVersion >= 9 || !isAsync) && this.eat(types$1.star)) {\n    isGenerator = true;\n  }\n  if (!keyName && !isAsync && !isGenerator) {\n    var lastValue = this.value;\n    if (this.eatContextual(\"get\") || this.eatContextual(\"set\")) {\n      if (this.isClassElementNameStart()) {\n        kind = lastValue;\n      } else {\n        keyName = lastValue;\n      }\n    }\n  }\n\n  // Parse element name\n  if (keyName) {\n    // 'async', 'get', 'set', or 'static' were not a keyword contextually.\n    // The last token is any of those. Make it the element name.\n    node.computed = false;\n    node.key = this.startNodeAt(this.lastTokStart, this.lastTokStartLoc);\n    node.key.name = keyName;\n    this.finishNode(node.key, \"Identifier\");\n  } else {\n    this.parseClassElementName(node);\n  }\n\n  // Parse element value\n  if (ecmaVersion < 13 || this.type === types$1.parenL || kind !== \"method\" || isGenerator || isAsync) {\n    var isConstructor = !node.static && checkKeyName(node, \"constructor\");\n    var allowsDirectSuper = isConstructor && constructorAllowsSuper;\n    // Couldn't move this check into the 'parseClassMethod' method for backward compatibility.\n    if (isConstructor && kind !== \"method\") { this.raise(node.key.start, \"Constructor can't have get/set modifier\"); }\n    node.kind = isConstructor ? \"constructor\" : kind;\n    this.parseClassMethod(node, isGenerator, isAsync, allowsDirectSuper);\n  } else {\n    this.parseClassField(node);\n  }\n\n  return node\n};\n\npp$8.isClassElementNameStart = function() {\n  return (\n    this.type === types$1.name ||\n    this.type === types$1.privateId ||\n    this.type === types$1.num ||\n    this.type === types$1.string ||\n    this.type === types$1.bracketL ||\n    this.type.keyword\n  )\n};\n\npp$8.parseClassElementName = function(element) {\n  if (this.type === types$1.privateId) {\n    if (this.value === \"constructor\") {\n      this.raise(this.start, \"Classes can't have an element named '#constructor'\");\n    }\n    element.computed = false;\n    element.key = this.parsePrivateIdent();\n  } else {\n    this.parsePropertyName(element);\n  }\n};\n\npp$8.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {\n  // Check key and flags\n  var key = method.key;\n  if (method.kind === \"constructor\") {\n    if (isGenerator) { this.raise(key.start, \"Constructor can't be a generator\"); }\n    if (isAsync) { this.raise(key.start, \"Constructor can't be an async method\"); }\n  } else if (method.static && checkKeyName(method, \"prototype\")) {\n    this.raise(key.start, \"Classes may not have a static property named prototype\");\n  }\n\n  // Parse value\n  var value = method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);\n\n  // Check value\n  if (method.kind === \"get\" && value.params.length !== 0)\n    { this.raiseRecoverable(value.start, \"getter should have no params\"); }\n  if (method.kind === \"set\" && value.params.length !== 1)\n    { this.raiseRecoverable(value.start, \"setter should have exactly one param\"); }\n  if (method.kind === \"set\" && value.params[0].type === \"RestElement\")\n    { this.raiseRecoverable(value.params[0].start, \"Setter cannot use rest params\"); }\n\n  return this.finishNode(method, \"MethodDefinition\")\n};\n\npp$8.parseClassField = function(field) {\n  if (checkKeyName(field, \"constructor\")) {\n    this.raise(field.key.start, \"Classes can't have a field named 'constructor'\");\n  } else if (field.static && checkKeyName(field, \"prototype\")) {\n    this.raise(field.key.start, \"Classes can't have a static field named 'prototype'\");\n  }\n\n  if (this.eat(types$1.eq)) {\n    // To raise SyntaxError if 'arguments' exists in the initializer.\n    this.enterScope(SCOPE_CLASS_FIELD_INIT | SCOPE_SUPER);\n    field.value = this.parseMaybeAssign();\n    this.exitScope();\n  } else {\n    field.value = null;\n  }\n  this.semicolon();\n\n  return this.finishNode(field, \"PropertyDefinition\")\n};\n\npp$8.parseClassStaticBlock = function(node) {\n  node.body = [];\n\n  var oldLabels = this.labels;\n  this.labels = [];\n  this.enterScope(SCOPE_CLASS_STATIC_BLOCK | SCOPE_SUPER);\n  while (this.type !== types$1.braceR) {\n    var stmt = this.parseStatement(null);\n    node.body.push(stmt);\n  }\n  this.next();\n  this.exitScope();\n  this.labels = oldLabels;\n\n  return this.finishNode(node, \"StaticBlock\")\n};\n\npp$8.parseClassId = function(node, isStatement) {\n  if (this.type === types$1.name) {\n    node.id = this.parseIdent();\n    if (isStatement)\n      { this.checkLValSimple(node.id, BIND_LEXICAL, false); }\n  } else {\n    if (isStatement === true)\n      { this.unexpected(); }\n    node.id = null;\n  }\n};\n\npp$8.parseClassSuper = function(node) {\n  node.superClass = this.eat(types$1._extends) ? this.parseExprSubscripts(null, false) : null;\n};\n\npp$8.enterClassBody = function() {\n  var element = {declared: Object.create(null), used: []};\n  this.privateNameStack.push(element);\n  return element.declared\n};\n\npp$8.exitClassBody = function() {\n  var ref = this.privateNameStack.pop();\n  var declared = ref.declared;\n  var used = ref.used;\n  if (!this.options.checkPrivateFields) { return }\n  var len = this.privateNameStack.length;\n  var parent = len === 0 ? null : this.privateNameStack[len - 1];\n  for (var i = 0; i < used.length; ++i) {\n    var id = used[i];\n    if (!hasOwn(declared, id.name)) {\n      if (parent) {\n        parent.used.push(id);\n      } else {\n        this.raiseRecoverable(id.start, (\"Private field '#\" + (id.name) + \"' must be declared in an enclosing class\"));\n      }\n    }\n  }\n};\n\nfunction isPrivateNameConflicted(privateNameMap, element) {\n  var name = element.key.name;\n  var curr = privateNameMap[name];\n\n  var next = \"true\";\n  if (element.type === \"MethodDefinition\" && (element.kind === \"get\" || element.kind === \"set\")) {\n    next = (element.static ? \"s\" : \"i\") + element.kind;\n  }\n\n  // `class { get #a(){}; static set #a(_){} }` is also conflict.\n  if (\n    curr === \"iget\" && next === \"iset\" ||\n    curr === \"iset\" && next === \"iget\" ||\n    curr === \"sget\" && next === \"sset\" ||\n    curr === \"sset\" && next === \"sget\"\n  ) {\n    privateNameMap[name] = \"true\";\n    return false\n  } else if (!curr) {\n    privateNameMap[name] = next;\n    return false\n  } else {\n    return true\n  }\n}\n\nfunction checkKeyName(node, name) {\n  var computed = node.computed;\n  var key = node.key;\n  return !computed && (\n    key.type === \"Identifier\" && key.name === name ||\n    key.type === \"Literal\" && key.value === name\n  )\n}\n\n// Parses module export declaration.\n\npp$8.parseExportAllDeclaration = function(node, exports) {\n  if (this.options.ecmaVersion >= 11) {\n    if (this.eatContextual(\"as\")) {\n      node.exported = this.parseModuleExportName();\n      this.checkExport(exports, node.exported, this.lastTokStart);\n    } else {\n      node.exported = null;\n    }\n  }\n  this.expectContextual(\"from\");\n  if (this.type !== types$1.string) { this.unexpected(); }\n  node.source = this.parseExprAtom();\n  if (this.options.ecmaVersion >= 16)\n    { node.attributes = this.parseWithClause(); }\n  this.semicolon();\n  return this.finishNode(node, \"ExportAllDeclaration\")\n};\n\npp$8.parseExport = function(node, exports) {\n  this.next();\n  // export * from '...'\n  if (this.eat(types$1.star)) {\n    return this.parseExportAllDeclaration(node, exports)\n  }\n  if (this.eat(types$1._default)) { // export default ...\n    this.checkExport(exports, \"default\", this.lastTokStart);\n    node.declaration = this.parseExportDefaultDeclaration();\n    return this.finishNode(node, \"ExportDefaultDeclaration\")\n  }\n  // export var|const|let|function|class ...\n  if (this.shouldParseExportStatement()) {\n    node.declaration = this.parseExportDeclaration(node);\n    if (node.declaration.type === \"VariableDeclaration\")\n      { this.checkVariableExport(exports, node.declaration.declarations); }\n    else\n      { this.checkExport(exports, node.declaration.id, node.declaration.id.start); }\n    node.specifiers = [];\n    node.source = null;\n    if (this.options.ecmaVersion >= 16)\n      { node.attributes = []; }\n  } else { // export { x, y as z } [from '...']\n    node.declaration = null;\n    node.specifiers = this.parseExportSpecifiers(exports);\n    if (this.eatContextual(\"from\")) {\n      if (this.type !== types$1.string) { this.unexpected(); }\n      node.source = this.parseExprAtom();\n      if (this.options.ecmaVersion >= 16)\n        { node.attributes = this.parseWithClause(); }\n    } else {\n      for (var i = 0, list = node.specifiers; i < list.length; i += 1) {\n        // check for keywords used as local names\n        var spec = list[i];\n\n        this.checkUnreserved(spec.local);\n        // check if export is defined\n        this.checkLocalExport(spec.local);\n\n        if (spec.local.type === \"Literal\") {\n          this.raise(spec.local.start, \"A string literal cannot be used as an exported binding without `from`.\");\n        }\n      }\n\n      node.source = null;\n      if (this.options.ecmaVersion >= 16)\n        { node.attributes = []; }\n    }\n    this.semicolon();\n  }\n  return this.finishNode(node, \"ExportNamedDeclaration\")\n};\n\npp$8.parseExportDeclaration = function(node) {\n  return this.parseStatement(null)\n};\n\npp$8.parseExportDefaultDeclaration = function() {\n  var isAsync;\n  if (this.type === types$1._function || (isAsync = this.isAsyncFunction())) {\n    var fNode = this.startNode();\n    this.next();\n    if (isAsync) { this.next(); }\n    return this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync)\n  } else if (this.type === types$1._class) {\n    var cNode = this.startNode();\n    return this.parseClass(cNode, \"nullableID\")\n  } else {\n    var declaration = this.parseMaybeAssign();\n    this.semicolon();\n    return declaration\n  }\n};\n\npp$8.checkExport = function(exports, name, pos) {\n  if (!exports) { return }\n  if (typeof name !== \"string\")\n    { name = name.type === \"Identifier\" ? name.name : name.value; }\n  if (hasOwn(exports, name))\n    { this.raiseRecoverable(pos, \"Duplicate export '\" + name + \"'\"); }\n  exports[name] = true;\n};\n\npp$8.checkPatternExport = function(exports, pat) {\n  var type = pat.type;\n  if (type === \"Identifier\")\n    { this.checkExport(exports, pat, pat.start); }\n  else if (type === \"ObjectPattern\")\n    { for (var i = 0, list = pat.properties; i < list.length; i += 1)\n      {\n        var prop = list[i];\n\n        this.checkPatternExport(exports, prop);\n      } }\n  else if (type === \"ArrayPattern\")\n    { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {\n      var elt = list$1[i$1];\n\n        if (elt) { this.checkPatternExport(exports, elt); }\n    } }\n  else if (type === \"Property\")\n    { this.checkPatternExport(exports, pat.value); }\n  else if (type === \"AssignmentPattern\")\n    { this.checkPatternExport(exports, pat.left); }\n  else if (type === \"RestElement\")\n    { this.checkPatternExport(exports, pat.argument); }\n};\n\npp$8.checkVariableExport = function(exports, decls) {\n  if (!exports) { return }\n  for (var i = 0, list = decls; i < list.length; i += 1)\n    {\n    var decl = list[i];\n\n    this.checkPatternExport(exports, decl.id);\n  }\n};\n\npp$8.shouldParseExportStatement = function() {\n  return this.type.keyword === \"var\" ||\n    this.type.keyword === \"const\" ||\n    this.type.keyword === \"class\" ||\n    this.type.keyword === \"function\" ||\n    this.isLet() ||\n    this.isAsyncFunction()\n};\n\n// Parses a comma-separated list of module exports.\n\npp$8.parseExportSpecifier = function(exports) {\n  var node = this.startNode();\n  node.local = this.parseModuleExportName();\n\n  node.exported = this.eatContextual(\"as\") ? this.parseModuleExportName() : node.local;\n  this.checkExport(\n    exports,\n    node.exported,\n    node.exported.start\n  );\n\n  return this.finishNode(node, \"ExportSpecifier\")\n};\n\npp$8.parseExportSpecifiers = function(exports) {\n  var nodes = [], first = true;\n  // export { x, y as z } [from '...']\n  this.expect(types$1.braceL);\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    nodes.push(this.parseExportSpecifier(exports));\n  }\n  return nodes\n};\n\n// Parses import declaration.\n\npp$8.parseImport = function(node) {\n  this.next();\n\n  // import '...'\n  if (this.type === types$1.string) {\n    node.specifiers = empty$1;\n    node.source = this.parseExprAtom();\n  } else {\n    node.specifiers = this.parseImportSpecifiers();\n    this.expectContextual(\"from\");\n    node.source = this.type === types$1.string ? this.parseExprAtom() : this.unexpected();\n  }\n  if (this.options.ecmaVersion >= 16)\n    { node.attributes = this.parseWithClause(); }\n  this.semicolon();\n  return this.finishNode(node, \"ImportDeclaration\")\n};\n\n// Parses a comma-separated list of module imports.\n\npp$8.parseImportSpecifier = function() {\n  var node = this.startNode();\n  node.imported = this.parseModuleExportName();\n\n  if (this.eatContextual(\"as\")) {\n    node.local = this.parseIdent();\n  } else {\n    this.checkUnreserved(node.imported);\n    node.local = node.imported;\n  }\n  this.checkLValSimple(node.local, BIND_LEXICAL);\n\n  return this.finishNode(node, \"ImportSpecifier\")\n};\n\npp$8.parseImportDefaultSpecifier = function() {\n  // import defaultObj, { x, y as z } from '...'\n  var node = this.startNode();\n  node.local = this.parseIdent();\n  this.checkLValSimple(node.local, BIND_LEXICAL);\n  return this.finishNode(node, \"ImportDefaultSpecifier\")\n};\n\npp$8.parseImportNamespaceSpecifier = function() {\n  var node = this.startNode();\n  this.next();\n  this.expectContextual(\"as\");\n  node.local = this.parseIdent();\n  this.checkLValSimple(node.local, BIND_LEXICAL);\n  return this.finishNode(node, \"ImportNamespaceSpecifier\")\n};\n\npp$8.parseImportSpecifiers = function() {\n  var nodes = [], first = true;\n  if (this.type === types$1.name) {\n    nodes.push(this.parseImportDefaultSpecifier());\n    if (!this.eat(types$1.comma)) { return nodes }\n  }\n  if (this.type === types$1.star) {\n    nodes.push(this.parseImportNamespaceSpecifier());\n    return nodes\n  }\n  this.expect(types$1.braceL);\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    nodes.push(this.parseImportSpecifier());\n  }\n  return nodes\n};\n\npp$8.parseWithClause = function() {\n  var nodes = [];\n  if (!this.eat(types$1._with)) {\n    return nodes\n  }\n  this.expect(types$1.braceL);\n  var attributeKeys = {};\n  var first = true;\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    var attr = this.parseImportAttribute();\n    var keyName = attr.key.type === \"Identifier\" ? attr.key.name : attr.key.value;\n    if (hasOwn(attributeKeys, keyName))\n      { this.raiseRecoverable(attr.key.start, \"Duplicate attribute key '\" + keyName + \"'\"); }\n    attributeKeys[keyName] = true;\n    nodes.push(attr);\n  }\n  return nodes\n};\n\npp$8.parseImportAttribute = function() {\n  var node = this.startNode();\n  node.key = this.type === types$1.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== \"never\");\n  this.expect(types$1.colon);\n  if (this.type !== types$1.string) {\n    this.unexpected();\n  }\n  node.value = this.parseExprAtom();\n  return this.finishNode(node, \"ImportAttribute\")\n};\n\npp$8.parseModuleExportName = function() {\n  if (this.options.ecmaVersion >= 13 && this.type === types$1.string) {\n    var stringLiteral = this.parseLiteral(this.value);\n    if (loneSurrogate.test(stringLiteral.value)) {\n      this.raise(stringLiteral.start, \"An export name cannot include a lone surrogate.\");\n    }\n    return stringLiteral\n  }\n  return this.parseIdent(true)\n};\n\n// Set `ExpressionStatement#directive` property for directive prologues.\npp$8.adaptDirectivePrologue = function(statements) {\n  for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {\n    statements[i].directive = statements[i].expression.raw.slice(1, -1);\n  }\n};\npp$8.isDirectiveCandidate = function(statement) {\n  return (\n    this.options.ecmaVersion >= 5 &&\n    statement.type === \"ExpressionStatement\" &&\n    statement.expression.type === \"Literal\" &&\n    typeof statement.expression.value === \"string\" &&\n    // Reject parenthesized strings.\n    (this.input[statement.start] === \"\\\"\" || this.input[statement.start] === \"'\")\n  )\n};\n\nvar pp$7 = Parser.prototype;\n\n// Convert existing expression atom to assignable pattern\n// if possible.\n\npp$7.toAssignable = function(node, isBinding, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 6 && node) {\n    switch (node.type) {\n    case \"Identifier\":\n      if (this.inAsync && node.name === \"await\")\n        { this.raise(node.start, \"Cannot use 'await' as identifier inside an async function\"); }\n      break\n\n    case \"ObjectPattern\":\n    case \"ArrayPattern\":\n    case \"AssignmentPattern\":\n    case \"RestElement\":\n      break\n\n    case \"ObjectExpression\":\n      node.type = \"ObjectPattern\";\n      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n      for (var i = 0, list = node.properties; i < list.length; i += 1) {\n        var prop = list[i];\n\n      this.toAssignable(prop, isBinding);\n        // Early error:\n        //   AssignmentRestProperty[Yield, Await] :\n        //     `...` DestructuringAssignmentTarget[Yield, Await]\n        //\n        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.\n        if (\n          prop.type === \"RestElement\" &&\n          (prop.argument.type === \"ArrayPattern\" || prop.argument.type === \"ObjectPattern\")\n        ) {\n          this.raise(prop.argument.start, \"Unexpected token\");\n        }\n      }\n      break\n\n    case \"Property\":\n      // AssignmentProperty has type === \"Property\"\n      if (node.kind !== \"init\") { this.raise(node.key.start, \"Object pattern can't contain getter or setter\"); }\n      this.toAssignable(node.value, isBinding);\n      break\n\n    case \"ArrayExpression\":\n      node.type = \"ArrayPattern\";\n      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n      this.toAssignableList(node.elements, isBinding);\n      break\n\n    case \"SpreadElement\":\n      node.type = \"RestElement\";\n      this.toAssignable(node.argument, isBinding);\n      if (node.argument.type === \"AssignmentPattern\")\n        { this.raise(node.argument.start, \"Rest elements cannot have a default value\"); }\n      break\n\n    case \"AssignmentExpression\":\n      if (node.operator !== \"=\") { this.raise(node.left.end, \"Only '=' operator can be used for specifying default value.\"); }\n      node.type = \"AssignmentPattern\";\n      delete node.operator;\n      this.toAssignable(node.left, isBinding);\n      break\n\n    case \"ParenthesizedExpression\":\n      this.toAssignable(node.expression, isBinding, refDestructuringErrors);\n      break\n\n    case \"ChainExpression\":\n      this.raiseRecoverable(node.start, \"Optional chaining cannot appear in left-hand side\");\n      break\n\n    case \"MemberExpression\":\n      if (!isBinding) { break }\n\n    default:\n      this.raise(node.start, \"Assigning to rvalue\");\n    }\n  } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n  return node\n};\n\n// Convert list of expression atoms to binding list.\n\npp$7.toAssignableList = function(exprList, isBinding) {\n  var end = exprList.length;\n  for (var i = 0; i < end; i++) {\n    var elt = exprList[i];\n    if (elt) { this.toAssignable(elt, isBinding); }\n  }\n  if (end) {\n    var last = exprList[end - 1];\n    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === \"RestElement\" && last.argument.type !== \"Identifier\")\n      { this.unexpected(last.argument.start); }\n  }\n  return exprList\n};\n\n// Parses spread element.\n\npp$7.parseSpread = function(refDestructuringErrors) {\n  var node = this.startNode();\n  this.next();\n  node.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n  return this.finishNode(node, \"SpreadElement\")\n};\n\npp$7.parseRestBinding = function() {\n  var node = this.startNode();\n  this.next();\n\n  // RestElement inside of a function parameter must be an identifier\n  if (this.options.ecmaVersion === 6 && this.type !== types$1.name)\n    { this.unexpected(); }\n\n  node.argument = this.parseBindingAtom();\n\n  return this.finishNode(node, \"RestElement\")\n};\n\n// Parses lvalue (assignable) atom.\n\npp$7.parseBindingAtom = function() {\n  if (this.options.ecmaVersion >= 6) {\n    switch (this.type) {\n    case types$1.bracketL:\n      var node = this.startNode();\n      this.next();\n      node.elements = this.parseBindingList(types$1.bracketR, true, true);\n      return this.finishNode(node, \"ArrayPattern\")\n\n    case types$1.braceL:\n      return this.parseObj(true)\n    }\n  }\n  return this.parseIdent()\n};\n\npp$7.parseBindingList = function(close, allowEmpty, allowTrailingComma, allowModifiers) {\n  var elts = [], first = true;\n  while (!this.eat(close)) {\n    if (first) { first = false; }\n    else { this.expect(types$1.comma); }\n    if (allowEmpty && this.type === types$1.comma) {\n      elts.push(null);\n    } else if (allowTrailingComma && this.afterTrailingComma(close)) {\n      break\n    } else if (this.type === types$1.ellipsis) {\n      var rest = this.parseRestBinding();\n      this.parseBindingListItem(rest);\n      elts.push(rest);\n      if (this.type === types$1.comma) { this.raiseRecoverable(this.start, \"Comma is not permitted after the rest element\"); }\n      this.expect(close);\n      break\n    } else {\n      elts.push(this.parseAssignableListItem(allowModifiers));\n    }\n  }\n  return elts\n};\n\npp$7.parseAssignableListItem = function(allowModifiers) {\n  var elem = this.parseMaybeDefault(this.start, this.startLoc);\n  this.parseBindingListItem(elem);\n  return elem\n};\n\npp$7.parseBindingListItem = function(param) {\n  return param\n};\n\n// Parses assignment pattern around given atom if possible.\n\npp$7.parseMaybeDefault = function(startPos, startLoc, left) {\n  left = left || this.parseBindingAtom();\n  if (this.options.ecmaVersion < 6 || !this.eat(types$1.eq)) { return left }\n  var node = this.startNodeAt(startPos, startLoc);\n  node.left = left;\n  node.right = this.parseMaybeAssign();\n  return this.finishNode(node, \"AssignmentPattern\")\n};\n\n// The following three functions all verify that a node is an lvalue —\n// something that can be bound, or assigned to. In order to do so, they perform\n// a variety of checks:\n//\n// - Check that none of the bound/assigned-to identifiers are reserved words.\n// - Record name declarations for bindings in the appropriate scope.\n// - Check duplicate argument names, if checkClashes is set.\n//\n// If a complex binding pattern is encountered (e.g., object and array\n// destructuring), the entire pattern is recursively checked.\n//\n// There are three versions of checkLVal*() appropriate for different\n// circumstances:\n//\n// - checkLValSimple() shall be used if the syntactic construct supports\n//   nothing other than identifiers and member expressions. Parenthesized\n//   expressions are also correctly handled. This is generally appropriate for\n//   constructs for which the spec says\n//\n//   > It is a Syntax Error if AssignmentTargetType of [the production] is not\n//   > simple.\n//\n//   It is also appropriate for checking if an identifier is valid and not\n//   defined elsewhere, like import declarations or function/class identifiers.\n//\n//   Examples where this is used include:\n//     a += …;\n//     import a from '…';\n//   where a is the node to be checked.\n//\n// - checkLValPattern() shall be used if the syntactic construct supports\n//   anything checkLValSimple() supports, as well as object and array\n//   destructuring patterns. This is generally appropriate for constructs for\n//   which the spec says\n//\n//   > It is a Syntax Error if [the production] is neither an ObjectLiteral nor\n//   > an ArrayLiteral and AssignmentTargetType of [the production] is not\n//   > simple.\n//\n//   Examples where this is used include:\n//     (a = …);\n//     const a = …;\n//     try { … } catch (a) { … }\n//   where a is the node to be checked.\n//\n// - checkLValInnerPattern() shall be used if the syntactic construct supports\n//   anything checkLValPattern() supports, as well as default assignment\n//   patterns, rest elements, and other constructs that may appear within an\n//   object or array destructuring pattern.\n//\n//   As a special case, function parameters also use checkLValInnerPattern(),\n//   as they also support defaults and rest constructs.\n//\n// These functions deliberately support both assignment and binding constructs,\n// as the logic for both is exceedingly similar. If the node is the target of\n// an assignment, then bindingType should be set to BIND_NONE. Otherwise, it\n// should be set to the appropriate BIND_* constant, like BIND_VAR or\n// BIND_LEXICAL.\n//\n// If the function is called with a non-BIND_NONE bindingType, then\n// additionally a checkClashes object may be specified to allow checking for\n// duplicate argument names. checkClashes is ignored if the provided construct\n// is an assignment (i.e., bindingType is BIND_NONE).\n\npp$7.checkLValSimple = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  var isBind = bindingType !== BIND_NONE;\n\n  switch (expr.type) {\n  case \"Identifier\":\n    if (this.strict && this.reservedWordsStrictBind.test(expr.name))\n      { this.raiseRecoverable(expr.start, (isBind ? \"Binding \" : \"Assigning to \") + expr.name + \" in strict mode\"); }\n    if (isBind) {\n      if (bindingType === BIND_LEXICAL && expr.name === \"let\")\n        { this.raiseRecoverable(expr.start, \"let is disallowed as a lexically bound name\"); }\n      if (checkClashes) {\n        if (hasOwn(checkClashes, expr.name))\n          { this.raiseRecoverable(expr.start, \"Argument name clash\"); }\n        checkClashes[expr.name] = true;\n      }\n      if (bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }\n    }\n    break\n\n  case \"ChainExpression\":\n    this.raiseRecoverable(expr.start, \"Optional chaining cannot appear in left-hand side\");\n    break\n\n  case \"MemberExpression\":\n    if (isBind) { this.raiseRecoverable(expr.start, \"Binding member expression\"); }\n    break\n\n  case \"ParenthesizedExpression\":\n    if (isBind) { this.raiseRecoverable(expr.start, \"Binding parenthesized expression\"); }\n    return this.checkLValSimple(expr.expression, bindingType, checkClashes)\n\n  default:\n    this.raise(expr.start, (isBind ? \"Binding\" : \"Assigning to\") + \" rvalue\");\n  }\n};\n\npp$7.checkLValPattern = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  switch (expr.type) {\n  case \"ObjectPattern\":\n    for (var i = 0, list = expr.properties; i < list.length; i += 1) {\n      var prop = list[i];\n\n    this.checkLValInnerPattern(prop, bindingType, checkClashes);\n    }\n    break\n\n  case \"ArrayPattern\":\n    for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {\n      var elem = list$1[i$1];\n\n    if (elem) { this.checkLValInnerPattern(elem, bindingType, checkClashes); }\n    }\n    break\n\n  default:\n    this.checkLValSimple(expr, bindingType, checkClashes);\n  }\n};\n\npp$7.checkLValInnerPattern = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  switch (expr.type) {\n  case \"Property\":\n    // AssignmentProperty has type === \"Property\"\n    this.checkLValInnerPattern(expr.value, bindingType, checkClashes);\n    break\n\n  case \"AssignmentPattern\":\n    this.checkLValPattern(expr.left, bindingType, checkClashes);\n    break\n\n  case \"RestElement\":\n    this.checkLValPattern(expr.argument, bindingType, checkClashes);\n    break\n\n  default:\n    this.checkLValPattern(expr, bindingType, checkClashes);\n  }\n};\n\n// The algorithm used to determine whether a regexp can appear at a\n// given point in the program is loosely based on sweet.js' approach.\n// See https://github.com/mozilla/sweet.js/wiki/design\n\n\nvar TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {\n  this.token = token;\n  this.isExpr = !!isExpr;\n  this.preserveSpace = !!preserveSpace;\n  this.override = override;\n  this.generator = !!generator;\n};\n\nvar types = {\n  b_stat: new TokContext(\"{\", false),\n  b_expr: new TokContext(\"{\", true),\n  b_tmpl: new TokContext(\"${\", false),\n  p_stat: new TokContext(\"(\", false),\n  p_expr: new TokContext(\"(\", true),\n  q_tmpl: new TokContext(\"`\", true, true, function (p) { return p.tryReadTemplateToken(); }),\n  f_stat: new TokContext(\"function\", false),\n  f_expr: new TokContext(\"function\", true),\n  f_expr_gen: new TokContext(\"function\", true, false, null, true),\n  f_gen: new TokContext(\"function\", false, false, null, true)\n};\n\nvar pp$6 = Parser.prototype;\n\npp$6.initialContext = function() {\n  return [types.b_stat]\n};\n\npp$6.curContext = function() {\n  return this.context[this.context.length - 1]\n};\n\npp$6.braceIsBlock = function(prevType) {\n  var parent = this.curContext();\n  if (parent === types.f_expr || parent === types.f_stat)\n    { return true }\n  if (prevType === types$1.colon && (parent === types.b_stat || parent === types.b_expr))\n    { return !parent.isExpr }\n\n  // The check for `tt.name && exprAllowed` detects whether we are\n  // after a `yield` or `of` construct. See the `updateContext` for\n  // `tt.name`.\n  if (prevType === types$1._return || prevType === types$1.name && this.exprAllowed)\n    { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }\n  if (prevType === types$1._else || prevType === types$1.semi || prevType === types$1.eof || prevType === types$1.parenR || prevType === types$1.arrow)\n    { return true }\n  if (prevType === types$1.braceL)\n    { return parent === types.b_stat }\n  if (prevType === types$1._var || prevType === types$1._const || prevType === types$1.name)\n    { return false }\n  return !this.exprAllowed\n};\n\npp$6.inGeneratorContext = function() {\n  for (var i = this.context.length - 1; i >= 1; i--) {\n    var context = this.context[i];\n    if (context.token === \"function\")\n      { return context.generator }\n  }\n  return false\n};\n\npp$6.updateContext = function(prevType) {\n  var update, type = this.type;\n  if (type.keyword && prevType === types$1.dot)\n    { this.exprAllowed = false; }\n  else if (update = type.updateContext)\n    { update.call(this, prevType); }\n  else\n    { this.exprAllowed = type.beforeExpr; }\n};\n\n// Used to handle edge cases when token context could not be inferred correctly during tokenization phase\n\npp$6.overrideContext = function(tokenCtx) {\n  if (this.curContext() !== tokenCtx) {\n    this.context[this.context.length - 1] = tokenCtx;\n  }\n};\n\n// Token-specific context update code\n\ntypes$1.parenR.updateContext = types$1.braceR.updateContext = function() {\n  if (this.context.length === 1) {\n    this.exprAllowed = true;\n    return\n  }\n  var out = this.context.pop();\n  if (out === types.b_stat && this.curContext().token === \"function\") {\n    out = this.context.pop();\n  }\n  this.exprAllowed = !out.isExpr;\n};\n\ntypes$1.braceL.updateContext = function(prevType) {\n  this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr);\n  this.exprAllowed = true;\n};\n\ntypes$1.dollarBraceL.updateContext = function() {\n  this.context.push(types.b_tmpl);\n  this.exprAllowed = true;\n};\n\ntypes$1.parenL.updateContext = function(prevType) {\n  var statementParens = prevType === types$1._if || prevType === types$1._for || prevType === types$1._with || prevType === types$1._while;\n  this.context.push(statementParens ? types.p_stat : types.p_expr);\n  this.exprAllowed = true;\n};\n\ntypes$1.incDec.updateContext = function() {\n  // tokExprAllowed stays unchanged\n};\n\ntypes$1._function.updateContext = types$1._class.updateContext = function(prevType) {\n  if (prevType.beforeExpr && prevType !== types$1._else &&\n      !(prevType === types$1.semi && this.curContext() !== types.p_stat) &&\n      !(prevType === types$1._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&\n      !((prevType === types$1.colon || prevType === types$1.braceL) && this.curContext() === types.b_stat))\n    { this.context.push(types.f_expr); }\n  else\n    { this.context.push(types.f_stat); }\n  this.exprAllowed = false;\n};\n\ntypes$1.colon.updateContext = function() {\n  if (this.curContext().token === \"function\") { this.context.pop(); }\n  this.exprAllowed = true;\n};\n\ntypes$1.backQuote.updateContext = function() {\n  if (this.curContext() === types.q_tmpl)\n    { this.context.pop(); }\n  else\n    { this.context.push(types.q_tmpl); }\n  this.exprAllowed = false;\n};\n\ntypes$1.star.updateContext = function(prevType) {\n  if (prevType === types$1._function) {\n    var index = this.context.length - 1;\n    if (this.context[index] === types.f_expr)\n      { this.context[index] = types.f_expr_gen; }\n    else\n      { this.context[index] = types.f_gen; }\n  }\n  this.exprAllowed = true;\n};\n\ntypes$1.name.updateContext = function(prevType) {\n  var allowed = false;\n  if (this.options.ecmaVersion >= 6 && prevType !== types$1.dot) {\n    if (this.value === \"of\" && !this.exprAllowed ||\n        this.value === \"yield\" && this.inGeneratorContext())\n      { allowed = true; }\n  }\n  this.exprAllowed = allowed;\n};\n\n// A recursive descent parser operates by defining functions for all\n// syntactic elements, and recursively calling those, each function\n// advancing the input stream and returning an AST node. Precedence\n// of constructs (for example, the fact that `!x[1]` means `!(x[1])`\n// instead of `(!x)[1]` is handled by the fact that the parser\n// function that parses unary prefix operators is called first, and\n// in turn calls the function that parses `[]` subscripts — that\n// way, it'll receive the node for `x[1]` already parsed, and wraps\n// *that* in the unary operator node.\n//\n// Acorn uses an [operator precedence parser][opp] to handle binary\n// operator precedence, because it is much more compact than using\n// the technique outlined above, which uses different, nesting\n// functions to specify precedence, for all of the ten binary\n// precedence levels that JavaScript defines.\n//\n// [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser\n\n\nvar pp$5 = Parser.prototype;\n\n// Check if property name clashes with already added.\n// Object/class getters and setters are not allowed to clash —\n// either with each other or with an init property — and in\n// strict mode, init properties are also not allowed to be repeated.\n\npp$5.checkPropClash = function(prop, propHash, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 9 && prop.type === \"SpreadElement\")\n    { return }\n  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))\n    { return }\n  var key = prop.key;\n  var name;\n  switch (key.type) {\n  case \"Identifier\": name = key.name; break\n  case \"Literal\": name = String(key.value); break\n  default: return\n  }\n  var kind = prop.kind;\n  if (this.options.ecmaVersion >= 6) {\n    if (name === \"__proto__\" && kind === \"init\") {\n      if (propHash.proto) {\n        if (refDestructuringErrors) {\n          if (refDestructuringErrors.doubleProto < 0) {\n            refDestructuringErrors.doubleProto = key.start;\n          }\n        } else {\n          this.raiseRecoverable(key.start, \"Redefinition of __proto__ property\");\n        }\n      }\n      propHash.proto = true;\n    }\n    return\n  }\n  name = \"$\" + name;\n  var other = propHash[name];\n  if (other) {\n    var redefinition;\n    if (kind === \"init\") {\n      redefinition = this.strict && other.init || other.get || other.set;\n    } else {\n      redefinition = other.init || other[kind];\n    }\n    if (redefinition)\n      { this.raiseRecoverable(key.start, \"Redefinition of property\"); }\n  } else {\n    other = propHash[name] = {\n      init: false,\n      get: false,\n      set: false\n    };\n  }\n  other[kind] = true;\n};\n\n// ### Expression parsing\n\n// These nest, from the most general expression type at the top to\n// 'atomic', nondivisible expression types at the bottom. Most of\n// the functions will simply let the function(s) below them parse,\n// and, *if* the syntactic construct they handle is present, wrap\n// the AST node that the inner parser gave them in another node.\n\n// Parse a full expression. The optional arguments are used to\n// forbid the `in` operator (in for loops initalization expressions)\n// and provide reference for storing '=' operator inside shorthand\n// property assignment in contexts where both object expression\n// and object pattern might appear (so it's possible to raise\n// delayed syntax error at correct position).\n\npp$5.parseExpression = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseMaybeAssign(forInit, refDestructuringErrors);\n  if (this.type === types$1.comma) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.expressions = [expr];\n    while (this.eat(types$1.comma)) { node.expressions.push(this.parseMaybeAssign(forInit, refDestructuringErrors)); }\n    return this.finishNode(node, \"SequenceExpression\")\n  }\n  return expr\n};\n\n// Parse an assignment expression. This includes applications of\n// operators like `+=`.\n\npp$5.parseMaybeAssign = function(forInit, refDestructuringErrors, afterLeftParse) {\n  if (this.isContextual(\"yield\")) {\n    if (this.inGenerator) { return this.parseYield(forInit) }\n    // The tokenizer will assume an expression is allowed after\n    // `yield`, but this isn't that kind of yield\n    else { this.exprAllowed = false; }\n  }\n\n  var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldDoubleProto = -1;\n  if (refDestructuringErrors) {\n    oldParenAssign = refDestructuringErrors.parenthesizedAssign;\n    oldTrailingComma = refDestructuringErrors.trailingComma;\n    oldDoubleProto = refDestructuringErrors.doubleProto;\n    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = -1;\n  } else {\n    refDestructuringErrors = new DestructuringErrors;\n    ownDestructuringErrors = true;\n  }\n\n  var startPos = this.start, startLoc = this.startLoc;\n  if (this.type === types$1.parenL || this.type === types$1.name) {\n    this.potentialArrowAt = this.start;\n    this.potentialArrowInForAwait = forInit === \"await\";\n  }\n  var left = this.parseMaybeConditional(forInit, refDestructuringErrors);\n  if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }\n  if (this.type.isAssign) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.operator = this.value;\n    if (this.type === types$1.eq)\n      { left = this.toAssignable(left, false, refDestructuringErrors); }\n    if (!ownDestructuringErrors) {\n      refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.doubleProto = -1;\n    }\n    if (refDestructuringErrors.shorthandAssign >= left.start)\n      { refDestructuringErrors.shorthandAssign = -1; } // reset because shorthand default was used correctly\n    if (this.type === types$1.eq)\n      { this.checkLValPattern(left); }\n    else\n      { this.checkLValSimple(left); }\n    node.left = left;\n    this.next();\n    node.right = this.parseMaybeAssign(forInit);\n    if (oldDoubleProto > -1) { refDestructuringErrors.doubleProto = oldDoubleProto; }\n    return this.finishNode(node, \"AssignmentExpression\")\n  } else {\n    if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }\n  }\n  if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }\n  if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }\n  return left\n};\n\n// Parse a ternary conditional (`?:`) operator.\n\npp$5.parseMaybeConditional = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseExprOps(forInit, refDestructuringErrors);\n  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n  if (this.eat(types$1.question)) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.test = expr;\n    node.consequent = this.parseMaybeAssign();\n    this.expect(types$1.colon);\n    node.alternate = this.parseMaybeAssign(forInit);\n    return this.finishNode(node, \"ConditionalExpression\")\n  }\n  return expr\n};\n\n// Start the precedence parser.\n\npp$5.parseExprOps = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseMaybeUnary(refDestructuringErrors, false, false, forInit);\n  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n  return expr.start === startPos && expr.type === \"ArrowFunctionExpression\" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, forInit)\n};\n\n// Parse binary operators with the operator precedence parsing\n// algorithm. `left` is the left-hand side of the operator.\n// `minPrec` provides context that allows the function to stop and\n// defer further parser to one of its callers when it encounters an\n// operator that has a lower precedence than the set it is parsing.\n\npp$5.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, forInit) {\n  var prec = this.type.binop;\n  if (prec != null && (!forInit || this.type !== types$1._in)) {\n    if (prec > minPrec) {\n      var logical = this.type === types$1.logicalOR || this.type === types$1.logicalAND;\n      var coalesce = this.type === types$1.coalesce;\n      if (coalesce) {\n        // Handle the precedence of `tt.coalesce` as equal to the range of logical expressions.\n        // In other words, `node.right` shouldn't contain logical expressions in order to check the mixed error.\n        prec = types$1.logicalAND.binop;\n      }\n      var op = this.value;\n      this.next();\n      var startPos = this.start, startLoc = this.startLoc;\n      var right = this.parseExprOp(this.parseMaybeUnary(null, false, false, forInit), startPos, startLoc, prec, forInit);\n      var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical || coalesce);\n      if ((logical && this.type === types$1.coalesce) || (coalesce && (this.type === types$1.logicalOR || this.type === types$1.logicalAND))) {\n        this.raiseRecoverable(this.start, \"Logical expressions and coalesce expressions cannot be mixed. Wrap either by parentheses\");\n      }\n      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, forInit)\n    }\n  }\n  return left\n};\n\npp$5.buildBinary = function(startPos, startLoc, left, right, op, logical) {\n  if (right.type === \"PrivateIdentifier\") { this.raise(right.start, \"Private identifier can only be left side of binary expression\"); }\n  var node = this.startNodeAt(startPos, startLoc);\n  node.left = left;\n  node.operator = op;\n  node.right = right;\n  return this.finishNode(node, logical ? \"LogicalExpression\" : \"BinaryExpression\")\n};\n\n// Parse unary operators, both prefix and postfix.\n\npp$5.parseMaybeUnary = function(refDestructuringErrors, sawUnary, incDec, forInit) {\n  var startPos = this.start, startLoc = this.startLoc, expr;\n  if (this.isContextual(\"await\") && this.canAwait) {\n    expr = this.parseAwait(forInit);\n    sawUnary = true;\n  } else if (this.type.prefix) {\n    var node = this.startNode(), update = this.type === types$1.incDec;\n    node.operator = this.value;\n    node.prefix = true;\n    this.next();\n    node.argument = this.parseMaybeUnary(null, true, update, forInit);\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    if (update) { this.checkLValSimple(node.argument); }\n    else if (this.strict && node.operator === \"delete\" && isLocalVariableAccess(node.argument))\n      { this.raiseRecoverable(node.start, \"Deleting local variable in strict mode\"); }\n    else if (node.operator === \"delete\" && isPrivateFieldAccess(node.argument))\n      { this.raiseRecoverable(node.start, \"Private fields can not be deleted\"); }\n    else { sawUnary = true; }\n    expr = this.finishNode(node, update ? \"UpdateExpression\" : \"UnaryExpression\");\n  } else if (!sawUnary && this.type === types$1.privateId) {\n    if ((forInit || this.privateNameStack.length === 0) && this.options.checkPrivateFields) { this.unexpected(); }\n    expr = this.parsePrivateIdent();\n    // only could be private fields in 'in', such as #x in obj\n    if (this.type !== types$1._in) { this.unexpected(); }\n  } else {\n    expr = this.parseExprSubscripts(refDestructuringErrors, forInit);\n    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n    while (this.type.postfix && !this.canInsertSemicolon()) {\n      var node$1 = this.startNodeAt(startPos, startLoc);\n      node$1.operator = this.value;\n      node$1.prefix = false;\n      node$1.argument = expr;\n      this.checkLValSimple(expr);\n      this.next();\n      expr = this.finishNode(node$1, \"UpdateExpression\");\n    }\n  }\n\n  if (!incDec && this.eat(types$1.starstar)) {\n    if (sawUnary)\n      { this.unexpected(this.lastTokStart); }\n    else\n      { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false, false, forInit), \"**\", false) }\n  } else {\n    return expr\n  }\n};\n\nfunction isLocalVariableAccess(node) {\n  return (\n    node.type === \"Identifier\" ||\n    node.type === \"ParenthesizedExpression\" && isLocalVariableAccess(node.expression)\n  )\n}\n\nfunction isPrivateFieldAccess(node) {\n  return (\n    node.type === \"MemberExpression\" && node.property.type === \"PrivateIdentifier\" ||\n    node.type === \"ChainExpression\" && isPrivateFieldAccess(node.expression) ||\n    node.type === \"ParenthesizedExpression\" && isPrivateFieldAccess(node.expression)\n  )\n}\n\n// Parse call, dot, and `[]`-subscript expressions.\n\npp$5.parseExprSubscripts = function(refDestructuringErrors, forInit) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseExprAtom(refDestructuringErrors, forInit);\n  if (expr.type === \"ArrowFunctionExpression\" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== \")\")\n    { return expr }\n  var result = this.parseSubscripts(expr, startPos, startLoc, false, forInit);\n  if (refDestructuringErrors && result.type === \"MemberExpression\") {\n    if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }\n    if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }\n    if (refDestructuringErrors.trailingComma >= result.start) { refDestructuringErrors.trailingComma = -1; }\n  }\n  return result\n};\n\npp$5.parseSubscripts = function(base, startPos, startLoc, noCalls, forInit) {\n  var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === \"Identifier\" && base.name === \"async\" &&\n      this.lastTokEnd === base.end && !this.canInsertSemicolon() && base.end - base.start === 5 &&\n      this.potentialArrowAt === base.start;\n  var optionalChained = false;\n\n  while (true) {\n    var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit);\n\n    if (element.optional) { optionalChained = true; }\n    if (element === base || element.type === \"ArrowFunctionExpression\") {\n      if (optionalChained) {\n        var chainNode = this.startNodeAt(startPos, startLoc);\n        chainNode.expression = element;\n        element = this.finishNode(chainNode, \"ChainExpression\");\n      }\n      return element\n    }\n\n    base = element;\n  }\n};\n\npp$5.shouldParseAsyncArrow = function() {\n  return !this.canInsertSemicolon() && this.eat(types$1.arrow)\n};\n\npp$5.parseSubscriptAsyncArrow = function(startPos, startLoc, exprList, forInit) {\n  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true, forInit)\n};\n\npp$5.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit) {\n  var optionalSupported = this.options.ecmaVersion >= 11;\n  var optional = optionalSupported && this.eat(types$1.questionDot);\n  if (noCalls && optional) { this.raise(this.lastTokStart, \"Optional chaining cannot appear in the callee of new expressions\"); }\n\n  var computed = this.eat(types$1.bracketL);\n  if (computed || (optional && this.type !== types$1.parenL && this.type !== types$1.backQuote) || this.eat(types$1.dot)) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.object = base;\n    if (computed) {\n      node.property = this.parseExpression();\n      this.expect(types$1.bracketR);\n    } else if (this.type === types$1.privateId && base.type !== \"Super\") {\n      node.property = this.parsePrivateIdent();\n    } else {\n      node.property = this.parseIdent(this.options.allowReserved !== \"never\");\n    }\n    node.computed = !!computed;\n    if (optionalSupported) {\n      node.optional = optional;\n    }\n    base = this.finishNode(node, \"MemberExpression\");\n  } else if (!noCalls && this.eat(types$1.parenL)) {\n    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    this.awaitIdentPos = 0;\n    var exprList = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);\n    if (maybeAsyncArrow && !optional && this.shouldParseAsyncArrow()) {\n      this.checkPatternErrors(refDestructuringErrors, false);\n      this.checkYieldAwaitInDefaultParams();\n      if (this.awaitIdentPos > 0)\n        { this.raise(this.awaitIdentPos, \"Cannot use 'await' as identifier inside an async function\"); }\n      this.yieldPos = oldYieldPos;\n      this.awaitPos = oldAwaitPos;\n      this.awaitIdentPos = oldAwaitIdentPos;\n      return this.parseSubscriptAsyncArrow(startPos, startLoc, exprList, forInit)\n    }\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    this.yieldPos = oldYieldPos || this.yieldPos;\n    this.awaitPos = oldAwaitPos || this.awaitPos;\n    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;\n    var node$1 = this.startNodeAt(startPos, startLoc);\n    node$1.callee = base;\n    node$1.arguments = exprList;\n    if (optionalSupported) {\n      node$1.optional = optional;\n    }\n    base = this.finishNode(node$1, \"CallExpression\");\n  } else if (this.type === types$1.backQuote) {\n    if (optional || optionalChained) {\n      this.raise(this.start, \"Optional chaining cannot appear in the tag of tagged template expressions\");\n    }\n    var node$2 = this.startNodeAt(startPos, startLoc);\n    node$2.tag = base;\n    node$2.quasi = this.parseTemplate({isTagged: true});\n    base = this.finishNode(node$2, \"TaggedTemplateExpression\");\n  }\n  return base\n};\n\n// Parse an atomic expression — either a single token that is an\n// expression, an expression started by a keyword like `function` or\n// `new`, or an expression wrapped in punctuation like `()`, `[]`,\n// or `{}`.\n\npp$5.parseExprAtom = function(refDestructuringErrors, forInit, forNew) {\n  // If a division operator appears in an expression position, the\n  // tokenizer got confused, and we force it to read a regexp instead.\n  if (this.type === types$1.slash) { this.readRegexp(); }\n\n  var node, canBeArrow = this.potentialArrowAt === this.start;\n  switch (this.type) {\n  case types$1._super:\n    if (!this.allowSuper)\n      { this.raise(this.start, \"'super' keyword outside a method\"); }\n    node = this.startNode();\n    this.next();\n    if (this.type === types$1.parenL && !this.allowDirectSuper)\n      { this.raise(node.start, \"super() call outside constructor of a subclass\"); }\n    // The `super` keyword can appear at below:\n    // SuperProperty:\n    //     super [ Expression ]\n    //     super . IdentifierName\n    // SuperCall:\n    //     super ( Arguments )\n    if (this.type !== types$1.dot && this.type !== types$1.bracketL && this.type !== types$1.parenL)\n      { this.unexpected(); }\n    return this.finishNode(node, \"Super\")\n\n  case types$1._this:\n    node = this.startNode();\n    this.next();\n    return this.finishNode(node, \"ThisExpression\")\n\n  case types$1.name:\n    var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;\n    var id = this.parseIdent(false);\n    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === \"async\" && !this.canInsertSemicolon() && this.eat(types$1._function)) {\n      this.overrideContext(types.f_expr);\n      return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true, forInit)\n    }\n    if (canBeArrow && !this.canInsertSemicolon()) {\n      if (this.eat(types$1.arrow))\n        { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false, forInit) }\n      if (this.options.ecmaVersion >= 8 && id.name === \"async\" && this.type === types$1.name && !containsEsc &&\n          (!this.potentialArrowInForAwait || this.value !== \"of\" || this.containsEsc)) {\n        id = this.parseIdent(false);\n        if (this.canInsertSemicolon() || !this.eat(types$1.arrow))\n          { this.unexpected(); }\n        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true, forInit)\n      }\n    }\n    return id\n\n  case types$1.regexp:\n    var value = this.value;\n    node = this.parseLiteral(value.value);\n    node.regex = {pattern: value.pattern, flags: value.flags};\n    return node\n\n  case types$1.num: case types$1.string:\n    return this.parseLiteral(this.value)\n\n  case types$1._null: case types$1._true: case types$1._false:\n    node = this.startNode();\n    node.value = this.type === types$1._null ? null : this.type === types$1._true;\n    node.raw = this.type.keyword;\n    this.next();\n    return this.finishNode(node, \"Literal\")\n\n  case types$1.parenL:\n    var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow, forInit);\n    if (refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))\n        { refDestructuringErrors.parenthesizedAssign = start; }\n      if (refDestructuringErrors.parenthesizedBind < 0)\n        { refDestructuringErrors.parenthesizedBind = start; }\n    }\n    return expr\n\n  case types$1.bracketL:\n    node = this.startNode();\n    this.next();\n    node.elements = this.parseExprList(types$1.bracketR, true, true, refDestructuringErrors);\n    return this.finishNode(node, \"ArrayExpression\")\n\n  case types$1.braceL:\n    this.overrideContext(types.b_expr);\n    return this.parseObj(false, refDestructuringErrors)\n\n  case types$1._function:\n    node = this.startNode();\n    this.next();\n    return this.parseFunction(node, 0)\n\n  case types$1._class:\n    return this.parseClass(this.startNode(), false)\n\n  case types$1._new:\n    return this.parseNew()\n\n  case types$1.backQuote:\n    return this.parseTemplate()\n\n  case types$1._import:\n    if (this.options.ecmaVersion >= 11) {\n      return this.parseExprImport(forNew)\n    } else {\n      return this.unexpected()\n    }\n\n  default:\n    return this.parseExprAtomDefault()\n  }\n};\n\npp$5.parseExprAtomDefault = function() {\n  this.unexpected();\n};\n\npp$5.parseExprImport = function(forNew) {\n  var node = this.startNode();\n\n  // Consume `import` as an identifier for `import.meta`.\n  // Because `this.parseIdent(true)` doesn't check escape sequences, it needs the check of `this.containsEsc`.\n  if (this.containsEsc) { this.raiseRecoverable(this.start, \"Escape sequence in keyword import\"); }\n  this.next();\n\n  if (this.type === types$1.parenL && !forNew) {\n    return this.parseDynamicImport(node)\n  } else if (this.type === types$1.dot) {\n    var meta = this.startNodeAt(node.start, node.loc && node.loc.start);\n    meta.name = \"import\";\n    node.meta = this.finishNode(meta, \"Identifier\");\n    return this.parseImportMeta(node)\n  } else {\n    this.unexpected();\n  }\n};\n\npp$5.parseDynamicImport = function(node) {\n  this.next(); // skip `(`\n\n  // Parse node.source.\n  node.source = this.parseMaybeAssign();\n\n  if (this.options.ecmaVersion >= 16) {\n    if (!this.eat(types$1.parenR)) {\n      this.expect(types$1.comma);\n      if (!this.afterTrailingComma(types$1.parenR)) {\n        node.options = this.parseMaybeAssign();\n        if (!this.eat(types$1.parenR)) {\n          this.expect(types$1.comma);\n          if (!this.afterTrailingComma(types$1.parenR)) {\n            this.unexpected();\n          }\n        }\n      } else {\n        node.options = null;\n      }\n    } else {\n      node.options = null;\n    }\n  } else {\n    // Verify ending.\n    if (!this.eat(types$1.parenR)) {\n      var errorPos = this.start;\n      if (this.eat(types$1.comma) && this.eat(types$1.parenR)) {\n        this.raiseRecoverable(errorPos, \"Trailing comma is not allowed in import()\");\n      } else {\n        this.unexpected(errorPos);\n      }\n    }\n  }\n\n  return this.finishNode(node, \"ImportExpression\")\n};\n\npp$5.parseImportMeta = function(node) {\n  this.next(); // skip `.`\n\n  var containsEsc = this.containsEsc;\n  node.property = this.parseIdent(true);\n\n  if (node.property.name !== \"meta\")\n    { this.raiseRecoverable(node.property.start, \"The only valid meta property for import is 'import.meta'\"); }\n  if (containsEsc)\n    { this.raiseRecoverable(node.start, \"'import.meta' must not contain escaped characters\"); }\n  if (this.options.sourceType !== \"module\" && !this.options.allowImportExportEverywhere)\n    { this.raiseRecoverable(node.start, \"Cannot use 'import.meta' outside a module\"); }\n\n  return this.finishNode(node, \"MetaProperty\")\n};\n\npp$5.parseLiteral = function(value) {\n  var node = this.startNode();\n  node.value = value;\n  node.raw = this.input.slice(this.start, this.end);\n  if (node.raw.charCodeAt(node.raw.length - 1) === 110)\n    { node.bigint = node.value != null ? node.value.toString() : node.raw.slice(0, -1).replace(/_/g, \"\"); }\n  this.next();\n  return this.finishNode(node, \"Literal\")\n};\n\npp$5.parseParenExpression = function() {\n  this.expect(types$1.parenL);\n  var val = this.parseExpression();\n  this.expect(types$1.parenR);\n  return val\n};\n\npp$5.shouldParseArrow = function(exprList) {\n  return !this.canInsertSemicolon()\n};\n\npp$5.parseParenAndDistinguishExpression = function(canBeArrow, forInit) {\n  var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;\n  if (this.options.ecmaVersion >= 6) {\n    this.next();\n\n    var innerStartPos = this.start, innerStartLoc = this.startLoc;\n    var exprList = [], first = true, lastIsComma = false;\n    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    // Do not save awaitIdentPos to allow checking awaits nested in parameters\n    while (this.type !== types$1.parenR) {\n      first ? first = false : this.expect(types$1.comma);\n      if (allowTrailingComma && this.afterTrailingComma(types$1.parenR, true)) {\n        lastIsComma = true;\n        break\n      } else if (this.type === types$1.ellipsis) {\n        spreadStart = this.start;\n        exprList.push(this.parseParenItem(this.parseRestBinding()));\n        if (this.type === types$1.comma) {\n          this.raiseRecoverable(\n            this.start,\n            \"Comma is not permitted after the rest element\"\n          );\n        }\n        break\n      } else {\n        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));\n      }\n    }\n    var innerEndPos = this.lastTokEnd, innerEndLoc = this.lastTokEndLoc;\n    this.expect(types$1.parenR);\n\n    if (canBeArrow && this.shouldParseArrow(exprList) && this.eat(types$1.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false);\n      this.checkYieldAwaitInDefaultParams();\n      this.yieldPos = oldYieldPos;\n      this.awaitPos = oldAwaitPos;\n      return this.parseParenArrowList(startPos, startLoc, exprList, forInit)\n    }\n\n    if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }\n    if (spreadStart) { this.unexpected(spreadStart); }\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    this.yieldPos = oldYieldPos || this.yieldPos;\n    this.awaitPos = oldAwaitPos || this.awaitPos;\n\n    if (exprList.length > 1) {\n      val = this.startNodeAt(innerStartPos, innerStartLoc);\n      val.expressions = exprList;\n      this.finishNodeAt(val, \"SequenceExpression\", innerEndPos, innerEndLoc);\n    } else {\n      val = exprList[0];\n    }\n  } else {\n    val = this.parseParenExpression();\n  }\n\n  if (this.options.preserveParens) {\n    var par = this.startNodeAt(startPos, startLoc);\n    par.expression = val;\n    return this.finishNode(par, \"ParenthesizedExpression\")\n  } else {\n    return val\n  }\n};\n\npp$5.parseParenItem = function(item) {\n  return item\n};\n\npp$5.parseParenArrowList = function(startPos, startLoc, exprList, forInit) {\n  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, false, forInit)\n};\n\n// New's precedence is slightly tricky. It must allow its argument to\n// be a `[]` or dot subscript expression, but not a call — at least,\n// not without wrapping it in parentheses. Thus, it uses the noCalls\n// argument to parseSubscripts to prevent it from consuming the\n// argument list.\n\nvar empty = [];\n\npp$5.parseNew = function() {\n  if (this.containsEsc) { this.raiseRecoverable(this.start, \"Escape sequence in keyword new\"); }\n  var node = this.startNode();\n  this.next();\n  if (this.options.ecmaVersion >= 6 && this.type === types$1.dot) {\n    var meta = this.startNodeAt(node.start, node.loc && node.loc.start);\n    meta.name = \"new\";\n    node.meta = this.finishNode(meta, \"Identifier\");\n    this.next();\n    var containsEsc = this.containsEsc;\n    node.property = this.parseIdent(true);\n    if (node.property.name !== \"target\")\n      { this.raiseRecoverable(node.property.start, \"The only valid meta property for new is 'new.target'\"); }\n    if (containsEsc)\n      { this.raiseRecoverable(node.start, \"'new.target' must not contain escaped characters\"); }\n    if (!this.allowNewDotTarget)\n      { this.raiseRecoverable(node.start, \"'new.target' can only be used in functions and class static block\"); }\n    return this.finishNode(node, \"MetaProperty\")\n  }\n  var startPos = this.start, startLoc = this.startLoc;\n  node.callee = this.parseSubscripts(this.parseExprAtom(null, false, true), startPos, startLoc, true, false);\n  if (this.eat(types$1.parenL)) { node.arguments = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false); }\n  else { node.arguments = empty; }\n  return this.finishNode(node, \"NewExpression\")\n};\n\n// Parse template expression.\n\npp$5.parseTemplateElement = function(ref) {\n  var isTagged = ref.isTagged;\n\n  var elem = this.startNode();\n  if (this.type === types$1.invalidTemplate) {\n    if (!isTagged) {\n      this.raiseRecoverable(this.start, \"Bad escape sequence in untagged template literal\");\n    }\n    elem.value = {\n      raw: this.value.replace(/\\r\\n?/g, \"\\n\"),\n      cooked: null\n    };\n  } else {\n    elem.value = {\n      raw: this.input.slice(this.start, this.end).replace(/\\r\\n?/g, \"\\n\"),\n      cooked: this.value\n    };\n  }\n  this.next();\n  elem.tail = this.type === types$1.backQuote;\n  return this.finishNode(elem, \"TemplateElement\")\n};\n\npp$5.parseTemplate = function(ref) {\n  if ( ref === void 0 ) ref = {};\n  var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;\n\n  var node = this.startNode();\n  this.next();\n  node.expressions = [];\n  var curElt = this.parseTemplateElement({isTagged: isTagged});\n  node.quasis = [curElt];\n  while (!curElt.tail) {\n    if (this.type === types$1.eof) { this.raise(this.pos, \"Unterminated template literal\"); }\n    this.expect(types$1.dollarBraceL);\n    node.expressions.push(this.parseExpression());\n    this.expect(types$1.braceR);\n    node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));\n  }\n  this.next();\n  return this.finishNode(node, \"TemplateLiteral\")\n};\n\npp$5.isAsyncProp = function(prop) {\n  return !prop.computed && prop.key.type === \"Identifier\" && prop.key.name === \"async\" &&\n    (this.type === types$1.name || this.type === types$1.num || this.type === types$1.string || this.type === types$1.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types$1.star)) &&\n    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n};\n\n// Parse an object literal or binding pattern.\n\npp$5.parseObj = function(isPattern, refDestructuringErrors) {\n  var node = this.startNode(), first = true, propHash = {};\n  node.properties = [];\n  this.next();\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.options.ecmaVersion >= 5 && this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    var prop = this.parseProperty(isPattern, refDestructuringErrors);\n    if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }\n    node.properties.push(prop);\n  }\n  return this.finishNode(node, isPattern ? \"ObjectPattern\" : \"ObjectExpression\")\n};\n\npp$5.parseProperty = function(isPattern, refDestructuringErrors) {\n  var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;\n  if (this.options.ecmaVersion >= 9 && this.eat(types$1.ellipsis)) {\n    if (isPattern) {\n      prop.argument = this.parseIdent(false);\n      if (this.type === types$1.comma) {\n        this.raiseRecoverable(this.start, \"Comma is not permitted after the rest element\");\n      }\n      return this.finishNode(prop, \"RestElement\")\n    }\n    // Parse argument.\n    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n    // To disallow trailing comma via `this.toAssignable()`.\n    if (this.type === types$1.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {\n      refDestructuringErrors.trailingComma = this.start;\n    }\n    // Finish\n    return this.finishNode(prop, \"SpreadElement\")\n  }\n  if (this.options.ecmaVersion >= 6) {\n    prop.method = false;\n    prop.shorthand = false;\n    if (isPattern || refDestructuringErrors) {\n      startPos = this.start;\n      startLoc = this.startLoc;\n    }\n    if (!isPattern)\n      { isGenerator = this.eat(types$1.star); }\n  }\n  var containsEsc = this.containsEsc;\n  this.parsePropertyName(prop);\n  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {\n    isAsync = true;\n    isGenerator = this.options.ecmaVersion >= 9 && this.eat(types$1.star);\n    this.parsePropertyName(prop);\n  } else {\n    isAsync = false;\n  }\n  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);\n  return this.finishNode(prop, \"Property\")\n};\n\npp$5.parseGetterSetter = function(prop) {\n  var kind = prop.key.name;\n  this.parsePropertyName(prop);\n  prop.value = this.parseMethod(false);\n  prop.kind = kind;\n  var paramCount = prop.kind === \"get\" ? 0 : 1;\n  if (prop.value.params.length !== paramCount) {\n    var start = prop.value.start;\n    if (prop.kind === \"get\")\n      { this.raiseRecoverable(start, \"getter should have no params\"); }\n    else\n      { this.raiseRecoverable(start, \"setter should have exactly one param\"); }\n  } else {\n    if (prop.kind === \"set\" && prop.value.params[0].type === \"RestElement\")\n      { this.raiseRecoverable(prop.value.params[0].start, \"Setter cannot use rest params\"); }\n  }\n};\n\npp$5.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {\n  if ((isGenerator || isAsync) && this.type === types$1.colon)\n    { this.unexpected(); }\n\n  if (this.eat(types$1.colon)) {\n    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);\n    prop.kind = \"init\";\n  } else if (this.options.ecmaVersion >= 6 && this.type === types$1.parenL) {\n    if (isPattern) { this.unexpected(); }\n    prop.method = true;\n    prop.value = this.parseMethod(isGenerator, isAsync);\n    prop.kind = \"init\";\n  } else if (!isPattern && !containsEsc &&\n             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === \"Identifier\" &&\n             (prop.key.name === \"get\" || prop.key.name === \"set\") &&\n             (this.type !== types$1.comma && this.type !== types$1.braceR && this.type !== types$1.eq)) {\n    if (isGenerator || isAsync) { this.unexpected(); }\n    this.parseGetterSetter(prop);\n  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === \"Identifier\") {\n    if (isGenerator || isAsync) { this.unexpected(); }\n    this.checkUnreserved(prop.key);\n    if (prop.key.name === \"await\" && !this.awaitIdentPos)\n      { this.awaitIdentPos = startPos; }\n    if (isPattern) {\n      prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));\n    } else if (this.type === types$1.eq && refDestructuringErrors) {\n      if (refDestructuringErrors.shorthandAssign < 0)\n        { refDestructuringErrors.shorthandAssign = this.start; }\n      prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));\n    } else {\n      prop.value = this.copyNode(prop.key);\n    }\n    prop.kind = \"init\";\n    prop.shorthand = true;\n  } else { this.unexpected(); }\n};\n\npp$5.parsePropertyName = function(prop) {\n  if (this.options.ecmaVersion >= 6) {\n    if (this.eat(types$1.bracketL)) {\n      prop.computed = true;\n      prop.key = this.parseMaybeAssign();\n      this.expect(types$1.bracketR);\n      return prop.key\n    } else {\n      prop.computed = false;\n    }\n  }\n  return prop.key = this.type === types$1.num || this.type === types$1.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== \"never\")\n};\n\n// Initialize empty function node.\n\npp$5.initFunction = function(node) {\n  node.id = null;\n  if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }\n  if (this.options.ecmaVersion >= 8) { node.async = false; }\n};\n\n// Parse object or class method.\n\npp$5.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {\n  var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 6)\n    { node.generator = isGenerator; }\n  if (this.options.ecmaVersion >= 8)\n    { node.async = !!isAsync; }\n\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));\n\n  this.expect(types$1.parenL);\n  node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);\n  this.checkYieldAwaitInDefaultParams();\n  this.parseFunctionBody(node, false, true, false);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, \"FunctionExpression\")\n};\n\n// Parse arrow function expression with given parameters.\n\npp$5.parseArrowExpression = function(node, params, isAsync, forInit) {\n  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n\n  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }\n\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n\n  node.params = this.toAssignableList(params, true);\n  this.parseFunctionBody(node, true, false, forInit);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, \"ArrowFunctionExpression\")\n};\n\n// Parse function body and check parameters.\n\npp$5.parseFunctionBody = function(node, isArrowFunction, isMethod, forInit) {\n  var isExpression = isArrowFunction && this.type !== types$1.braceL;\n  var oldStrict = this.strict, useStrict = false;\n\n  if (isExpression) {\n    node.body = this.parseMaybeAssign(forInit);\n    node.expression = true;\n    this.checkParams(node, false);\n  } else {\n    var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);\n    if (!oldStrict || nonSimple) {\n      useStrict = this.strictDirective(this.end);\n      // If this is a strict mode function, verify that argument names\n      // are not repeated, and it does not try to bind the words `eval`\n      // or `arguments`.\n      if (useStrict && nonSimple)\n        { this.raiseRecoverable(node.start, \"Illegal 'use strict' directive in function with non-simple parameter list\"); }\n    }\n    // Start a new scope with regard to labels and the `inFunction`\n    // flag (restore them to their old value afterwards).\n    var oldLabels = this.labels;\n    this.labels = [];\n    if (useStrict) { this.strict = true; }\n\n    // Add the params to varDeclaredNames to ensure that an error is thrown\n    // if a let/const declaration in the function clashes with one of the params.\n    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));\n    // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'\n    if (this.strict && node.id) { this.checkLValSimple(node.id, BIND_OUTSIDE); }\n    node.body = this.parseBlock(false, undefined, useStrict && !oldStrict);\n    node.expression = false;\n    this.adaptDirectivePrologue(node.body.body);\n    this.labels = oldLabels;\n  }\n  this.exitScope();\n};\n\npp$5.isSimpleParamList = function(params) {\n  for (var i = 0, list = params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    if (param.type !== \"Identifier\") { return false\n  } }\n  return true\n};\n\n// Checks function params for various disallowed patterns such as using \"eval\"\n// or \"arguments\" and duplicate parameters.\n\npp$5.checkParams = function(node, allowDuplicates) {\n  var nameHash = Object.create(null);\n  for (var i = 0, list = node.params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    this.checkLValInnerPattern(param, BIND_VAR, allowDuplicates ? null : nameHash);\n  }\n};\n\n// Parses a comma-separated list of expressions, and returns them as\n// an array. `close` is the token type that ends the list, and\n// `allowEmpty` can be turned on to allow subsequent commas with\n// nothing in between them to be parsed as `null` (which is needed\n// for array literals).\n\npp$5.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {\n  var elts = [], first = true;\n  while (!this.eat(close)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (allowTrailingComma && this.afterTrailingComma(close)) { break }\n    } else { first = false; }\n\n    var elt = (void 0);\n    if (allowEmpty && this.type === types$1.comma)\n      { elt = null; }\n    else if (this.type === types$1.ellipsis) {\n      elt = this.parseSpread(refDestructuringErrors);\n      if (refDestructuringErrors && this.type === types$1.comma && refDestructuringErrors.trailingComma < 0)\n        { refDestructuringErrors.trailingComma = this.start; }\n    } else {\n      elt = this.parseMaybeAssign(false, refDestructuringErrors);\n    }\n    elts.push(elt);\n  }\n  return elts\n};\n\npp$5.checkUnreserved = function(ref) {\n  var start = ref.start;\n  var end = ref.end;\n  var name = ref.name;\n\n  if (this.inGenerator && name === \"yield\")\n    { this.raiseRecoverable(start, \"Cannot use 'yield' as identifier inside a generator\"); }\n  if (this.inAsync && name === \"await\")\n    { this.raiseRecoverable(start, \"Cannot use 'await' as identifier inside an async function\"); }\n  if (!(this.currentThisScope().flags & SCOPE_VAR) && name === \"arguments\")\n    { this.raiseRecoverable(start, \"Cannot use 'arguments' in class field initializer\"); }\n  if (this.inClassStaticBlock && (name === \"arguments\" || name === \"await\"))\n    { this.raise(start, (\"Cannot use \" + name + \" in class static initialization block\")); }\n  if (this.keywords.test(name))\n    { this.raise(start, (\"Unexpected keyword '\" + name + \"'\")); }\n  if (this.options.ecmaVersion < 6 &&\n    this.input.slice(start, end).indexOf(\"\\\\\") !== -1) { return }\n  var re = this.strict ? this.reservedWordsStrict : this.reservedWords;\n  if (re.test(name)) {\n    if (!this.inAsync && name === \"await\")\n      { this.raiseRecoverable(start, \"Cannot use keyword 'await' outside an async function\"); }\n    this.raiseRecoverable(start, (\"The keyword '\" + name + \"' is reserved\"));\n  }\n};\n\n// Parse the next token as an identifier. If `liberal` is true (used\n// when parsing properties), it will also convert keywords into\n// identifiers.\n\npp$5.parseIdent = function(liberal) {\n  var node = this.parseIdentNode();\n  this.next(!!liberal);\n  this.finishNode(node, \"Identifier\");\n  if (!liberal) {\n    this.checkUnreserved(node);\n    if (node.name === \"await\" && !this.awaitIdentPos)\n      { this.awaitIdentPos = node.start; }\n  }\n  return node\n};\n\npp$5.parseIdentNode = function() {\n  var node = this.startNode();\n  if (this.type === types$1.name) {\n    node.name = this.value;\n  } else if (this.type.keyword) {\n    node.name = this.type.keyword;\n\n    // To fix https://github.com/acornjs/acorn/issues/575\n    // `class` and `function` keywords push new context into this.context.\n    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.\n    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword\n    if ((node.name === \"class\" || node.name === \"function\") &&\n      (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {\n      this.context.pop();\n    }\n    this.type = types$1.name;\n  } else {\n    this.unexpected();\n  }\n  return node\n};\n\npp$5.parsePrivateIdent = function() {\n  var node = this.startNode();\n  if (this.type === types$1.privateId) {\n    node.name = this.value;\n  } else {\n    this.unexpected();\n  }\n  this.next();\n  this.finishNode(node, \"PrivateIdentifier\");\n\n  // For validating existence\n  if (this.options.checkPrivateFields) {\n    if (this.privateNameStack.length === 0) {\n      this.raise(node.start, (\"Private field '#\" + (node.name) + \"' must be declared in an enclosing class\"));\n    } else {\n      this.privateNameStack[this.privateNameStack.length - 1].used.push(node);\n    }\n  }\n\n  return node\n};\n\n// Parses yield expression inside generator.\n\npp$5.parseYield = function(forInit) {\n  if (!this.yieldPos) { this.yieldPos = this.start; }\n\n  var node = this.startNode();\n  this.next();\n  if (this.type === types$1.semi || this.canInsertSemicolon() || (this.type !== types$1.star && !this.type.startsExpr)) {\n    node.delegate = false;\n    node.argument = null;\n  } else {\n    node.delegate = this.eat(types$1.star);\n    node.argument = this.parseMaybeAssign(forInit);\n  }\n  return this.finishNode(node, \"YieldExpression\")\n};\n\npp$5.parseAwait = function(forInit) {\n  if (!this.awaitPos) { this.awaitPos = this.start; }\n\n  var node = this.startNode();\n  this.next();\n  node.argument = this.parseMaybeUnary(null, true, false, forInit);\n  return this.finishNode(node, \"AwaitExpression\")\n};\n\nvar pp$4 = Parser.prototype;\n\n// This function is used to raise exceptions on parse errors. It\n// takes an offset integer (into the current `input`) to indicate\n// the location of the error, attaches the position to the end\n// of the error message, and then raises a `SyntaxError` with that\n// message.\n\npp$4.raise = function(pos, message) {\n  var loc = getLineInfo(this.input, pos);\n  message += \" (\" + loc.line + \":\" + loc.column + \")\";\n  if (this.sourceFile) {\n    message += \" in \" + this.sourceFile;\n  }\n  var err = new SyntaxError(message);\n  err.pos = pos; err.loc = loc; err.raisedAt = this.pos;\n  throw err\n};\n\npp$4.raiseRecoverable = pp$4.raise;\n\npp$4.curPosition = function() {\n  if (this.options.locations) {\n    return new Position(this.curLine, this.pos - this.lineStart)\n  }\n};\n\nvar pp$3 = Parser.prototype;\n\nvar Scope = function Scope(flags) {\n  this.flags = flags;\n  // A list of var-declared names in the current lexical scope\n  this.var = [];\n  // A list of lexically-declared names in the current lexical scope\n  this.lexical = [];\n  // A list of lexically-declared FunctionDeclaration names in the current lexical scope\n  this.functions = [];\n};\n\n// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.\n\npp$3.enterScope = function(flags) {\n  this.scopeStack.push(new Scope(flags));\n};\n\npp$3.exitScope = function() {\n  this.scopeStack.pop();\n};\n\n// The spec says:\n// > At the top level of a function, or script, function declarations are\n// > treated like var declarations rather than like lexical declarations.\npp$3.treatFunctionsAsVarInScope = function(scope) {\n  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)\n};\n\npp$3.declareName = function(name, bindingType, pos) {\n  var redeclared = false;\n  if (bindingType === BIND_LEXICAL) {\n    var scope = this.currentScope();\n    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;\n    scope.lexical.push(name);\n    if (this.inModule && (scope.flags & SCOPE_TOP))\n      { delete this.undefinedExports[name]; }\n  } else if (bindingType === BIND_SIMPLE_CATCH) {\n    var scope$1 = this.currentScope();\n    scope$1.lexical.push(name);\n  } else if (bindingType === BIND_FUNCTION) {\n    var scope$2 = this.currentScope();\n    if (this.treatFunctionsAsVar)\n      { redeclared = scope$2.lexical.indexOf(name) > -1; }\n    else\n      { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }\n    scope$2.functions.push(name);\n  } else {\n    for (var i = this.scopeStack.length - 1; i >= 0; --i) {\n      var scope$3 = this.scopeStack[i];\n      if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||\n          !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {\n        redeclared = true;\n        break\n      }\n      scope$3.var.push(name);\n      if (this.inModule && (scope$3.flags & SCOPE_TOP))\n        { delete this.undefinedExports[name]; }\n      if (scope$3.flags & SCOPE_VAR) { break }\n    }\n  }\n  if (redeclared) { this.raiseRecoverable(pos, (\"Identifier '\" + name + \"' has already been declared\")); }\n};\n\npp$3.checkLocalExport = function(id) {\n  // scope.functions must be empty as Module code is always strict.\n  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&\n      this.scopeStack[0].var.indexOf(id.name) === -1) {\n    this.undefinedExports[id.name] = id;\n  }\n};\n\npp$3.currentScope = function() {\n  return this.scopeStack[this.scopeStack.length - 1]\n};\n\npp$3.currentVarScope = function() {\n  for (var i = this.scopeStack.length - 1;; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.flags & (SCOPE_VAR | SCOPE_CLASS_FIELD_INIT | SCOPE_CLASS_STATIC_BLOCK)) { return scope }\n  }\n};\n\n// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.\npp$3.currentThisScope = function() {\n  for (var i = this.scopeStack.length - 1;; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.flags & (SCOPE_VAR | SCOPE_CLASS_FIELD_INIT | SCOPE_CLASS_STATIC_BLOCK) &&\n        !(scope.flags & SCOPE_ARROW)) { return scope }\n  }\n};\n\nvar Node = function Node(parser, pos, loc) {\n  this.type = \"\";\n  this.start = pos;\n  this.end = 0;\n  if (parser.options.locations)\n    { this.loc = new SourceLocation(parser, loc); }\n  if (parser.options.directSourceFile)\n    { this.sourceFile = parser.options.directSourceFile; }\n  if (parser.options.ranges)\n    { this.range = [pos, 0]; }\n};\n\n// Start an AST node, attaching a start offset.\n\nvar pp$2 = Parser.prototype;\n\npp$2.startNode = function() {\n  return new Node(this, this.start, this.startLoc)\n};\n\npp$2.startNodeAt = function(pos, loc) {\n  return new Node(this, pos, loc)\n};\n\n// Finish an AST node, adding `type` and `end` properties.\n\nfunction finishNodeAt(node, type, pos, loc) {\n  node.type = type;\n  node.end = pos;\n  if (this.options.locations)\n    { node.loc.end = loc; }\n  if (this.options.ranges)\n    { node.range[1] = pos; }\n  return node\n}\n\npp$2.finishNode = function(node, type) {\n  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)\n};\n\n// Finish node at given position\n\npp$2.finishNodeAt = function(node, type, pos, loc) {\n  return finishNodeAt.call(this, node, type, pos, loc)\n};\n\npp$2.copyNode = function(node) {\n  var newNode = new Node(this, node.start, this.startLoc);\n  for (var prop in node) { newNode[prop] = node[prop]; }\n  return newNode\n};\n\n// This file was generated by \"bin/generate-unicode-script-values.js\". Do not modify manually!\nvar scriptValuesAddedInUnicode = \"Gara Garay Gukh Gurung_Khema Hrkt Katakana_Or_Hiragana Kawi Kirat_Rai Krai Nag_Mundari Nagm Ol_Onal Onao Sunu Sunuwar Todhri Todr Tulu_Tigalari Tutg Unknown Zzzz\";\n\n// This file contains Unicode properties extracted from the ECMAScript specification.\n// The lists are extracted like so:\n// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)\n\n// #table-binary-unicode-properties\nvar ecma9BinaryProperties = \"ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS\";\nvar ecma10BinaryProperties = ecma9BinaryProperties + \" Extended_Pictographic\";\nvar ecma11BinaryProperties = ecma10BinaryProperties;\nvar ecma12BinaryProperties = ecma11BinaryProperties + \" EBase EComp EMod EPres ExtPict\";\nvar ecma13BinaryProperties = ecma12BinaryProperties;\nvar ecma14BinaryProperties = ecma13BinaryProperties;\n\nvar unicodeBinaryProperties = {\n  9: ecma9BinaryProperties,\n  10: ecma10BinaryProperties,\n  11: ecma11BinaryProperties,\n  12: ecma12BinaryProperties,\n  13: ecma13BinaryProperties,\n  14: ecma14BinaryProperties\n};\n\n// #table-binary-unicode-properties-of-strings\nvar ecma14BinaryPropertiesOfStrings = \"Basic_Emoji Emoji_Keycap_Sequence RGI_Emoji_Modifier_Sequence RGI_Emoji_Flag_Sequence RGI_Emoji_Tag_Sequence RGI_Emoji_ZWJ_Sequence RGI_Emoji\";\n\nvar unicodeBinaryPropertiesOfStrings = {\n  9: \"\",\n  10: \"\",\n  11: \"\",\n  12: \"\",\n  13: \"\",\n  14: ecma14BinaryPropertiesOfStrings\n};\n\n// #table-unicode-general-category-values\nvar unicodeGeneralCategoryValues = \"Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu\";\n\n// #table-unicode-script-values\nvar ecma9ScriptValues = \"Adlam Adlm Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb\";\nvar ecma10ScriptValues = ecma9ScriptValues + \" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd\";\nvar ecma11ScriptValues = ecma10ScriptValues + \" Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho\";\nvar ecma12ScriptValues = ecma11ScriptValues + \" Chorasmian Chrs Diak Dives_Akuru Khitan_Small_Script Kits Yezi Yezidi\";\nvar ecma13ScriptValues = ecma12ScriptValues + \" Cypro_Minoan Cpmn Old_Uyghur Ougr Tangsa Tnsa Toto Vithkuqi Vith\";\nvar ecma14ScriptValues = ecma13ScriptValues + \" \" + scriptValuesAddedInUnicode;\n\nvar unicodeScriptValues = {\n  9: ecma9ScriptValues,\n  10: ecma10ScriptValues,\n  11: ecma11ScriptValues,\n  12: ecma12ScriptValues,\n  13: ecma13ScriptValues,\n  14: ecma14ScriptValues\n};\n\nvar data = {};\nfunction buildUnicodeData(ecmaVersion) {\n  var d = data[ecmaVersion] = {\n    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + \" \" + unicodeGeneralCategoryValues),\n    binaryOfStrings: wordsRegexp(unicodeBinaryPropertiesOfStrings[ecmaVersion]),\n    nonBinary: {\n      General_Category: wordsRegexp(unicodeGeneralCategoryValues),\n      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])\n    }\n  };\n  d.nonBinary.Script_Extensions = d.nonBinary.Script;\n\n  d.nonBinary.gc = d.nonBinary.General_Category;\n  d.nonBinary.sc = d.nonBinary.Script;\n  d.nonBinary.scx = d.nonBinary.Script_Extensions;\n}\n\nfor (var i = 0, list = [9, 10, 11, 12, 13, 14]; i < list.length; i += 1) {\n  var ecmaVersion = list[i];\n\n  buildUnicodeData(ecmaVersion);\n}\n\nvar pp$1 = Parser.prototype;\n\n// Track disjunction structure to determine whether a duplicate\n// capture group name is allowed because it is in a separate branch.\nvar BranchID = function BranchID(parent, base) {\n  // Parent disjunction branch\n  this.parent = parent;\n  // Identifies this set of sibling branches\n  this.base = base || this;\n};\n\nBranchID.prototype.separatedFrom = function separatedFrom (alt) {\n  // A branch is separate from another branch if they or any of\n  // their parents are siblings in a given disjunction\n  for (var self = this; self; self = self.parent) {\n    for (var other = alt; other; other = other.parent) {\n      if (self.base === other.base && self !== other) { return true }\n    }\n  }\n  return false\n};\n\nBranchID.prototype.sibling = function sibling () {\n  return new BranchID(this.parent, this.base)\n};\n\nvar RegExpValidationState = function RegExpValidationState(parser) {\n  this.parser = parser;\n  this.validFlags = \"gim\" + (parser.options.ecmaVersion >= 6 ? \"uy\" : \"\") + (parser.options.ecmaVersion >= 9 ? \"s\" : \"\") + (parser.options.ecmaVersion >= 13 ? \"d\" : \"\") + (parser.options.ecmaVersion >= 15 ? \"v\" : \"\");\n  this.unicodeProperties = data[parser.options.ecmaVersion >= 14 ? 14 : parser.options.ecmaVersion];\n  this.source = \"\";\n  this.flags = \"\";\n  this.start = 0;\n  this.switchU = false;\n  this.switchV = false;\n  this.switchN = false;\n  this.pos = 0;\n  this.lastIntValue = 0;\n  this.lastStringValue = \"\";\n  this.lastAssertionIsQuantifiable = false;\n  this.numCapturingParens = 0;\n  this.maxBackReference = 0;\n  this.groupNames = Object.create(null);\n  this.backReferenceNames = [];\n  this.branchID = null;\n};\n\nRegExpValidationState.prototype.reset = function reset (start, pattern, flags) {\n  var unicodeSets = flags.indexOf(\"v\") !== -1;\n  var unicode = flags.indexOf(\"u\") !== -1;\n  this.start = start | 0;\n  this.source = pattern + \"\";\n  this.flags = flags;\n  if (unicodeSets && this.parser.options.ecmaVersion >= 15) {\n    this.switchU = true;\n    this.switchV = true;\n    this.switchN = true;\n  } else {\n    this.switchU = unicode && this.parser.options.ecmaVersion >= 6;\n    this.switchV = false;\n    this.switchN = unicode && this.parser.options.ecmaVersion >= 9;\n  }\n};\n\nRegExpValidationState.prototype.raise = function raise (message) {\n  this.parser.raiseRecoverable(this.start, (\"Invalid regular expression: /\" + (this.source) + \"/: \" + message));\n};\n\n// If u flag is given, this returns the code point at the index (it combines a surrogate pair).\n// Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).\nRegExpValidationState.prototype.at = function at (i, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var s = this.source;\n  var l = s.length;\n  if (i >= l) {\n    return -1\n  }\n  var c = s.charCodeAt(i);\n  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {\n    return c\n  }\n  var next = s.charCodeAt(i + 1);\n  return next >= 0xDC00 && next <= 0xDFFF ? (c << 10) + next - 0x35FDC00 : c\n};\n\nRegExpValidationState.prototype.nextIndex = function nextIndex (i, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var s = this.source;\n  var l = s.length;\n  if (i >= l) {\n    return l\n  }\n  var c = s.charCodeAt(i), next;\n  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l ||\n      (next = s.charCodeAt(i + 1)) < 0xDC00 || next > 0xDFFF) {\n    return i + 1\n  }\n  return i + 2\n};\n\nRegExpValidationState.prototype.current = function current (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  return this.at(this.pos, forceU)\n};\n\nRegExpValidationState.prototype.lookahead = function lookahead (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  return this.at(this.nextIndex(this.pos, forceU), forceU)\n};\n\nRegExpValidationState.prototype.advance = function advance (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  this.pos = this.nextIndex(this.pos, forceU);\n};\n\nRegExpValidationState.prototype.eat = function eat (ch, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  if (this.current(forceU) === ch) {\n    this.advance(forceU);\n    return true\n  }\n  return false\n};\n\nRegExpValidationState.prototype.eatChars = function eatChars (chs, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var pos = this.pos;\n  for (var i = 0, list = chs; i < list.length; i += 1) {\n    var ch = list[i];\n\n      var current = this.at(pos, forceU);\n    if (current === -1 || current !== ch) {\n      return false\n    }\n    pos = this.nextIndex(pos, forceU);\n  }\n  this.pos = pos;\n  return true\n};\n\n/**\n * Validate the flags part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp$1.validateRegExpFlags = function(state) {\n  var validFlags = state.validFlags;\n  var flags = state.flags;\n\n  var u = false;\n  var v = false;\n\n  for (var i = 0; i < flags.length; i++) {\n    var flag = flags.charAt(i);\n    if (validFlags.indexOf(flag) === -1) {\n      this.raise(state.start, \"Invalid regular expression flag\");\n    }\n    if (flags.indexOf(flag, i + 1) > -1) {\n      this.raise(state.start, \"Duplicate regular expression flag\");\n    }\n    if (flag === \"u\") { u = true; }\n    if (flag === \"v\") { v = true; }\n  }\n  if (this.options.ecmaVersion >= 15 && u && v) {\n    this.raise(state.start, \"Invalid regular expression flag\");\n  }\n};\n\nfunction hasProp(obj) {\n  for (var _ in obj) { return true }\n  return false\n}\n\n/**\n * Validate the pattern part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp$1.validateRegExpPattern = function(state) {\n  this.regexp_pattern(state);\n\n  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of\n  // parsing contains a |GroupName|, reparse with the goal symbol\n  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*\n  // exception if _P_ did not conform to the grammar, if any elements of _P_\n  // were not matched by the parse, or if any Early Error conditions exist.\n  if (!state.switchN && this.options.ecmaVersion >= 9 && hasProp(state.groupNames)) {\n    state.switchN = true;\n    this.regexp_pattern(state);\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern\npp$1.regexp_pattern = function(state) {\n  state.pos = 0;\n  state.lastIntValue = 0;\n  state.lastStringValue = \"\";\n  state.lastAssertionIsQuantifiable = false;\n  state.numCapturingParens = 0;\n  state.maxBackReference = 0;\n  state.groupNames = Object.create(null);\n  state.backReferenceNames.length = 0;\n  state.branchID = null;\n\n  this.regexp_disjunction(state);\n\n  if (state.pos !== state.source.length) {\n    // Make the same messages as V8.\n    if (state.eat(0x29 /* ) */)) {\n      state.raise(\"Unmatched ')'\");\n    }\n    if (state.eat(0x5D /* ] */) || state.eat(0x7D /* } */)) {\n      state.raise(\"Lone quantifier brackets\");\n    }\n  }\n  if (state.maxBackReference > state.numCapturingParens) {\n    state.raise(\"Invalid escape\");\n  }\n  for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {\n    var name = list[i];\n\n    if (!state.groupNames[name]) {\n      state.raise(\"Invalid named capture referenced\");\n    }\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction\npp$1.regexp_disjunction = function(state) {\n  var trackDisjunction = this.options.ecmaVersion >= 16;\n  if (trackDisjunction) { state.branchID = new BranchID(state.branchID, null); }\n  this.regexp_alternative(state);\n  while (state.eat(0x7C /* | */)) {\n    if (trackDisjunction) { state.branchID = state.branchID.sibling(); }\n    this.regexp_alternative(state);\n  }\n  if (trackDisjunction) { state.branchID = state.branchID.parent; }\n\n  // Make the same message as V8.\n  if (this.regexp_eatQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\");\n  }\n  if (state.eat(0x7B /* { */)) {\n    state.raise(\"Lone quantifier brackets\");\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative\npp$1.regexp_alternative = function(state) {\n  while (state.pos < state.source.length && this.regexp_eatTerm(state)) {}\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term\npp$1.regexp_eatTerm = function(state) {\n  if (this.regexp_eatAssertion(state)) {\n    // Handle `QuantifiableAssertion Quantifier` alternative.\n    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion\n    // is a QuantifiableAssertion.\n    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {\n      // Make the same message as V8.\n      if (state.switchU) {\n        state.raise(\"Invalid quantifier\");\n      }\n    }\n    return true\n  }\n\n  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {\n    this.regexp_eatQuantifier(state);\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion\npp$1.regexp_eatAssertion = function(state) {\n  var start = state.pos;\n  state.lastAssertionIsQuantifiable = false;\n\n  // ^, $\n  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {\n    return true\n  }\n\n  // \\b \\B\n  if (state.eat(0x5C /* \\ */)) {\n    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {\n      return true\n    }\n    state.pos = start;\n  }\n\n  // Lookahead / Lookbehind\n  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {\n    var lookbehind = false;\n    if (this.options.ecmaVersion >= 9) {\n      lookbehind = state.eat(0x3C /* < */);\n    }\n    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {\n      this.regexp_disjunction(state);\n      if (!state.eat(0x29 /* ) */)) {\n        state.raise(\"Unterminated group\");\n      }\n      state.lastAssertionIsQuantifiable = !lookbehind;\n      return true\n    }\n  }\n\n  state.pos = start;\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier\npp$1.regexp_eatQuantifier = function(state, noError) {\n  if ( noError === void 0 ) noError = false;\n\n  if (this.regexp_eatQuantifierPrefix(state, noError)) {\n    state.eat(0x3F /* ? */);\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix\npp$1.regexp_eatQuantifierPrefix = function(state, noError) {\n  return (\n    state.eat(0x2A /* * */) ||\n    state.eat(0x2B /* + */) ||\n    state.eat(0x3F /* ? */) ||\n    this.regexp_eatBracedQuantifier(state, noError)\n  )\n};\npp$1.regexp_eatBracedQuantifier = function(state, noError) {\n  var start = state.pos;\n  if (state.eat(0x7B /* { */)) {\n    var min = 0, max = -1;\n    if (this.regexp_eatDecimalDigits(state)) {\n      min = state.lastIntValue;\n      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {\n        max = state.lastIntValue;\n      }\n      if (state.eat(0x7D /* } */)) {\n        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term\n        if (max !== -1 && max < min && !noError) {\n          state.raise(\"numbers out of order in {} quantifier\");\n        }\n        return true\n      }\n    }\n    if (state.switchU && !noError) {\n      state.raise(\"Incomplete quantifier\");\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom\npp$1.regexp_eatAtom = function(state) {\n  return (\n    this.regexp_eatPatternCharacters(state) ||\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state)\n  )\n};\npp$1.regexp_eatReverseSolidusAtomEscape = function(state) {\n  var start = state.pos;\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatAtomEscape(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatUncapturingGroup = function(state) {\n  var start = state.pos;\n  if (state.eat(0x28 /* ( */)) {\n    if (state.eat(0x3F /* ? */)) {\n      if (this.options.ecmaVersion >= 16) {\n        var addModifiers = this.regexp_eatModifiers(state);\n        var hasHyphen = state.eat(0x2D /* - */);\n        if (addModifiers || hasHyphen) {\n          for (var i = 0; i < addModifiers.length; i++) {\n            var modifier = addModifiers.charAt(i);\n            if (addModifiers.indexOf(modifier, i + 1) > -1) {\n              state.raise(\"Duplicate regular expression modifiers\");\n            }\n          }\n          if (hasHyphen) {\n            var removeModifiers = this.regexp_eatModifiers(state);\n            if (!addModifiers && !removeModifiers && state.current() === 0x3A /* : */) {\n              state.raise(\"Invalid regular expression modifiers\");\n            }\n            for (var i$1 = 0; i$1 < removeModifiers.length; i$1++) {\n              var modifier$1 = removeModifiers.charAt(i$1);\n              if (\n                removeModifiers.indexOf(modifier$1, i$1 + 1) > -1 ||\n                addModifiers.indexOf(modifier$1) > -1\n              ) {\n                state.raise(\"Duplicate regular expression modifiers\");\n              }\n            }\n          }\n        }\n      }\n      if (state.eat(0x3A /* : */)) {\n        this.regexp_disjunction(state);\n        if (state.eat(0x29 /* ) */)) {\n          return true\n        }\n        state.raise(\"Unterminated group\");\n      }\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatCapturingGroup = function(state) {\n  if (state.eat(0x28 /* ( */)) {\n    if (this.options.ecmaVersion >= 9) {\n      this.regexp_groupSpecifier(state);\n    } else if (state.current() === 0x3F /* ? */) {\n      state.raise(\"Invalid group\");\n    }\n    this.regexp_disjunction(state);\n    if (state.eat(0x29 /* ) */)) {\n      state.numCapturingParens += 1;\n      return true\n    }\n    state.raise(\"Unterminated group\");\n  }\n  return false\n};\n// RegularExpressionModifiers ::\n//   [empty]\n//   RegularExpressionModifiers RegularExpressionModifier\npp$1.regexp_eatModifiers = function(state) {\n  var modifiers = \"\";\n  var ch = 0;\n  while ((ch = state.current()) !== -1 && isRegularExpressionModifier(ch)) {\n    modifiers += codePointToString(ch);\n    state.advance();\n  }\n  return modifiers\n};\n// RegularExpressionModifier :: one of\n//   `i` `m` `s`\nfunction isRegularExpressionModifier(ch) {\n  return ch === 0x69 /* i */ || ch === 0x6d /* m */ || ch === 0x73 /* s */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom\npp$1.regexp_eatExtendedAtom = function(state) {\n  return (\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state) ||\n    this.regexp_eatInvalidBracedQuantifier(state) ||\n    this.regexp_eatExtendedPatternCharacter(state)\n  )\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier\npp$1.regexp_eatInvalidBracedQuantifier = function(state) {\n  if (this.regexp_eatBracedQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter\npp$1.regexp_eatSyntaxCharacter = function(state) {\n  var ch = state.current();\n  if (isSyntaxCharacter(ch)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n  return false\n};\nfunction isSyntaxCharacter(ch) {\n  return (\n    ch === 0x24 /* $ */ ||\n    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||\n    ch === 0x2E /* . */ ||\n    ch === 0x3F /* ? */ ||\n    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||\n    ch >= 0x7B /* { */ && ch <= 0x7D /* } */\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter\n// But eat eager.\npp$1.regexp_eatPatternCharacters = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {\n    state.advance();\n  }\n  return state.pos !== start\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter\npp$1.regexp_eatExtendedPatternCharacter = function(state) {\n  var ch = state.current();\n  if (\n    ch !== -1 &&\n    ch !== 0x24 /* $ */ &&\n    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&\n    ch !== 0x2E /* . */ &&\n    ch !== 0x3F /* ? */ &&\n    ch !== 0x5B /* [ */ &&\n    ch !== 0x5E /* ^ */ &&\n    ch !== 0x7C /* | */\n  ) {\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// GroupSpecifier ::\n//   [empty]\n//   `?` GroupName\npp$1.regexp_groupSpecifier = function(state) {\n  if (state.eat(0x3F /* ? */)) {\n    if (!this.regexp_eatGroupName(state)) { state.raise(\"Invalid group\"); }\n    var trackDisjunction = this.options.ecmaVersion >= 16;\n    var known = state.groupNames[state.lastStringValue];\n    if (known) {\n      if (trackDisjunction) {\n        for (var i = 0, list = known; i < list.length; i += 1) {\n          var altID = list[i];\n\n          if (!altID.separatedFrom(state.branchID))\n            { state.raise(\"Duplicate capture group name\"); }\n        }\n      } else {\n        state.raise(\"Duplicate capture group name\");\n      }\n    }\n    if (trackDisjunction) {\n      (known || (state.groupNames[state.lastStringValue] = [])).push(state.branchID);\n    } else {\n      state.groupNames[state.lastStringValue] = true;\n    }\n  }\n};\n\n// GroupName ::\n//   `<` RegExpIdentifierName `>`\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$1.regexp_eatGroupName = function(state) {\n  state.lastStringValue = \"\";\n  if (state.eat(0x3C /* < */)) {\n    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {\n      return true\n    }\n    state.raise(\"Invalid capture group name\");\n  }\n  return false\n};\n\n// RegExpIdentifierName ::\n//   RegExpIdentifierStart\n//   RegExpIdentifierName RegExpIdentifierPart\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$1.regexp_eatRegExpIdentifierName = function(state) {\n  state.lastStringValue = \"\";\n  if (this.regexp_eatRegExpIdentifierStart(state)) {\n    state.lastStringValue += codePointToString(state.lastIntValue);\n    while (this.regexp_eatRegExpIdentifierPart(state)) {\n      state.lastStringValue += codePointToString(state.lastIntValue);\n    }\n    return true\n  }\n  return false\n};\n\n// RegExpIdentifierStart ::\n//   UnicodeIDStart\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\npp$1.regexp_eatRegExpIdentifierStart = function(state) {\n  var start = state.pos;\n  var forceU = this.options.ecmaVersion >= 11;\n  var ch = state.current(forceU);\n  state.advance(forceU);\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {\n    ch = state.lastIntValue;\n  }\n  if (isRegExpIdentifierStart(ch)) {\n    state.lastIntValue = ch;\n    return true\n  }\n\n  state.pos = start;\n  return false\n};\nfunction isRegExpIdentifierStart(ch) {\n  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */\n}\n\n// RegExpIdentifierPart ::\n//   UnicodeIDContinue\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\n//   <ZWNJ>\n//   <ZWJ>\npp$1.regexp_eatRegExpIdentifierPart = function(state) {\n  var start = state.pos;\n  var forceU = this.options.ecmaVersion >= 11;\n  var ch = state.current(forceU);\n  state.advance(forceU);\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {\n    ch = state.lastIntValue;\n  }\n  if (isRegExpIdentifierPart(ch)) {\n    state.lastIntValue = ch;\n    return true\n  }\n\n  state.pos = start;\n  return false\n};\nfunction isRegExpIdentifierPart(ch) {\n  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape\npp$1.regexp_eatAtomEscape = function(state) {\n  if (\n    this.regexp_eatBackReference(state) ||\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state) ||\n    (state.switchN && this.regexp_eatKGroupName(state))\n  ) {\n    return true\n  }\n  if (state.switchU) {\n    // Make the same message as V8.\n    if (state.current() === 0x63 /* c */) {\n      state.raise(\"Invalid unicode escape\");\n    }\n    state.raise(\"Invalid escape\");\n  }\n  return false\n};\npp$1.regexp_eatBackReference = function(state) {\n  var start = state.pos;\n  if (this.regexp_eatDecimalEscape(state)) {\n    var n = state.lastIntValue;\n    if (state.switchU) {\n      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape\n      if (n > state.maxBackReference) {\n        state.maxBackReference = n;\n      }\n      return true\n    }\n    if (n <= state.numCapturingParens) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatKGroupName = function(state) {\n  if (state.eat(0x6B /* k */)) {\n    if (this.regexp_eatGroupName(state)) {\n      state.backReferenceNames.push(state.lastStringValue);\n      return true\n    }\n    state.raise(\"Invalid named reference\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape\npp$1.regexp_eatCharacterEscape = function(state) {\n  return (\n    this.regexp_eatControlEscape(state) ||\n    this.regexp_eatCControlLetter(state) ||\n    this.regexp_eatZero(state) ||\n    this.regexp_eatHexEscapeSequence(state) ||\n    this.regexp_eatRegExpUnicodeEscapeSequence(state, false) ||\n    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||\n    this.regexp_eatIdentityEscape(state)\n  )\n};\npp$1.regexp_eatCControlLetter = function(state) {\n  var start = state.pos;\n  if (state.eat(0x63 /* c */)) {\n    if (this.regexp_eatControlLetter(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatZero = function(state) {\n  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {\n    state.lastIntValue = 0;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape\npp$1.regexp_eatControlEscape = function(state) {\n  var ch = state.current();\n  if (ch === 0x74 /* t */) {\n    state.lastIntValue = 0x09; /* \\t */\n    state.advance();\n    return true\n  }\n  if (ch === 0x6E /* n */) {\n    state.lastIntValue = 0x0A; /* \\n */\n    state.advance();\n    return true\n  }\n  if (ch === 0x76 /* v */) {\n    state.lastIntValue = 0x0B; /* \\v */\n    state.advance();\n    return true\n  }\n  if (ch === 0x66 /* f */) {\n    state.lastIntValue = 0x0C; /* \\f */\n    state.advance();\n    return true\n  }\n  if (ch === 0x72 /* r */) {\n    state.lastIntValue = 0x0D; /* \\r */\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter\npp$1.regexp_eatControlLetter = function(state) {\n  var ch = state.current();\n  if (isControlLetter(ch)) {\n    state.lastIntValue = ch % 0x20;\n    state.advance();\n    return true\n  }\n  return false\n};\nfunction isControlLetter(ch) {\n  return (\n    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence\npp$1.regexp_eatRegExpUnicodeEscapeSequence = function(state, forceU) {\n  if ( forceU === void 0 ) forceU = false;\n\n  var start = state.pos;\n  var switchU = forceU || state.switchU;\n\n  if (state.eat(0x75 /* u */)) {\n    if (this.regexp_eatFixedHexDigits(state, 4)) {\n      var lead = state.lastIntValue;\n      if (switchU && lead >= 0xD800 && lead <= 0xDBFF) {\n        var leadSurrogateEnd = state.pos;\n        if (state.eat(0x5C /* \\ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {\n          var trail = state.lastIntValue;\n          if (trail >= 0xDC00 && trail <= 0xDFFF) {\n            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;\n            return true\n          }\n        }\n        state.pos = leadSurrogateEnd;\n        state.lastIntValue = lead;\n      }\n      return true\n    }\n    if (\n      switchU &&\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatHexDigits(state) &&\n      state.eat(0x7D /* } */) &&\n      isValidUnicode(state.lastIntValue)\n    ) {\n      return true\n    }\n    if (switchU) {\n      state.raise(\"Invalid unicode escape\");\n    }\n    state.pos = start;\n  }\n\n  return false\n};\nfunction isValidUnicode(ch) {\n  return ch >= 0 && ch <= 0x10FFFF\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape\npp$1.regexp_eatIdentityEscape = function(state) {\n  if (state.switchU) {\n    if (this.regexp_eatSyntaxCharacter(state)) {\n      return true\n    }\n    if (state.eat(0x2F /* / */)) {\n      state.lastIntValue = 0x2F; /* / */\n      return true\n    }\n    return false\n  }\n\n  var ch = state.current();\n  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape\npp$1.regexp_eatDecimalEscape = function(state) {\n  state.lastIntValue = 0;\n  var ch = state.current();\n  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {\n    do {\n      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);\n      state.advance();\n    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)\n    return true\n  }\n  return false\n};\n\n// Return values used by character set parsing methods, needed to\n// forbid negation of sets that can match strings.\nvar CharSetNone = 0; // Nothing parsed\nvar CharSetOk = 1; // Construct parsed, cannot contain strings\nvar CharSetString = 2; // Construct parsed, can contain strings\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape\npp$1.regexp_eatCharacterClassEscape = function(state) {\n  var ch = state.current();\n\n  if (isCharacterClassEscape(ch)) {\n    state.lastIntValue = -1;\n    state.advance();\n    return CharSetOk\n  }\n\n  var negate = false;\n  if (\n    state.switchU &&\n    this.options.ecmaVersion >= 9 &&\n    ((negate = ch === 0x50 /* P */) || ch === 0x70 /* p */)\n  ) {\n    state.lastIntValue = -1;\n    state.advance();\n    var result;\n    if (\n      state.eat(0x7B /* { */) &&\n      (result = this.regexp_eatUnicodePropertyValueExpression(state)) &&\n      state.eat(0x7D /* } */)\n    ) {\n      if (negate && result === CharSetString) { state.raise(\"Invalid property name\"); }\n      return result\n    }\n    state.raise(\"Invalid property name\");\n  }\n\n  return CharSetNone\n};\n\nfunction isCharacterClassEscape(ch) {\n  return (\n    ch === 0x64 /* d */ ||\n    ch === 0x44 /* D */ ||\n    ch === 0x73 /* s */ ||\n    ch === 0x53 /* S */ ||\n    ch === 0x77 /* w */ ||\n    ch === 0x57 /* W */\n  )\n}\n\n// UnicodePropertyValueExpression ::\n//   UnicodePropertyName `=` UnicodePropertyValue\n//   LoneUnicodePropertyNameOrValue\npp$1.regexp_eatUnicodePropertyValueExpression = function(state) {\n  var start = state.pos;\n\n  // UnicodePropertyName `=` UnicodePropertyValue\n  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {\n    var name = state.lastStringValue;\n    if (this.regexp_eatUnicodePropertyValue(state)) {\n      var value = state.lastStringValue;\n      this.regexp_validateUnicodePropertyNameAndValue(state, name, value);\n      return CharSetOk\n    }\n  }\n  state.pos = start;\n\n  // LoneUnicodePropertyNameOrValue\n  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {\n    var nameOrValue = state.lastStringValue;\n    return this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue)\n  }\n  return CharSetNone\n};\n\npp$1.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {\n  if (!hasOwn(state.unicodeProperties.nonBinary, name))\n    { state.raise(\"Invalid property name\"); }\n  if (!state.unicodeProperties.nonBinary[name].test(value))\n    { state.raise(\"Invalid property value\"); }\n};\n\npp$1.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {\n  if (state.unicodeProperties.binary.test(nameOrValue)) { return CharSetOk }\n  if (state.switchV && state.unicodeProperties.binaryOfStrings.test(nameOrValue)) { return CharSetString }\n  state.raise(\"Invalid property name\");\n};\n\n// UnicodePropertyName ::\n//   UnicodePropertyNameCharacters\npp$1.regexp_eatUnicodePropertyName = function(state) {\n  var ch = 0;\n  state.lastStringValue = \"\";\n  while (isUnicodePropertyNameCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch);\n    state.advance();\n  }\n  return state.lastStringValue !== \"\"\n};\n\nfunction isUnicodePropertyNameCharacter(ch) {\n  return isControlLetter(ch) || ch === 0x5F /* _ */\n}\n\n// UnicodePropertyValue ::\n//   UnicodePropertyValueCharacters\npp$1.regexp_eatUnicodePropertyValue = function(state) {\n  var ch = 0;\n  state.lastStringValue = \"\";\n  while (isUnicodePropertyValueCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch);\n    state.advance();\n  }\n  return state.lastStringValue !== \"\"\n};\nfunction isUnicodePropertyValueCharacter(ch) {\n  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)\n}\n\n// LoneUnicodePropertyNameOrValue ::\n//   UnicodePropertyValueCharacters\npp$1.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {\n  return this.regexp_eatUnicodePropertyValue(state)\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass\npp$1.regexp_eatCharacterClass = function(state) {\n  if (state.eat(0x5B /* [ */)) {\n    var negate = state.eat(0x5E /* ^ */);\n    var result = this.regexp_classContents(state);\n    if (!state.eat(0x5D /* ] */))\n      { state.raise(\"Unterminated character class\"); }\n    if (negate && result === CharSetString)\n      { state.raise(\"Negated character class may contain strings\"); }\n    return true\n  }\n  return false\n};\n\n// https://tc39.es/ecma262/#prod-ClassContents\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges\npp$1.regexp_classContents = function(state) {\n  if (state.current() === 0x5D /* ] */) { return CharSetOk }\n  if (state.switchV) { return this.regexp_classSetExpression(state) }\n  this.regexp_nonEmptyClassRanges(state);\n  return CharSetOk\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash\npp$1.regexp_nonEmptyClassRanges = function(state) {\n  while (this.regexp_eatClassAtom(state)) {\n    var left = state.lastIntValue;\n    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {\n      var right = state.lastIntValue;\n      if (state.switchU && (left === -1 || right === -1)) {\n        state.raise(\"Invalid character class\");\n      }\n      if (left !== -1 && right !== -1 && left > right) {\n        state.raise(\"Range out of order in character class\");\n      }\n    }\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash\npp$1.regexp_eatClassAtom = function(state) {\n  var start = state.pos;\n\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatClassEscape(state)) {\n      return true\n    }\n    if (state.switchU) {\n      // Make the same message as V8.\n      var ch$1 = state.current();\n      if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {\n        state.raise(\"Invalid class escape\");\n      }\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n\n  var ch = state.current();\n  if (ch !== 0x5D /* ] */) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape\npp$1.regexp_eatClassEscape = function(state) {\n  var start = state.pos;\n\n  if (state.eat(0x62 /* b */)) {\n    state.lastIntValue = 0x08; /* <BS> */\n    return true\n  }\n\n  if (state.switchU && state.eat(0x2D /* - */)) {\n    state.lastIntValue = 0x2D; /* - */\n    return true\n  }\n\n  if (!state.switchU && state.eat(0x63 /* c */)) {\n    if (this.regexp_eatClassControlLetter(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n\n  return (\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state)\n  )\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetExpression\n// https://tc39.es/ecma262/#prod-ClassUnion\n// https://tc39.es/ecma262/#prod-ClassIntersection\n// https://tc39.es/ecma262/#prod-ClassSubtraction\npp$1.regexp_classSetExpression = function(state) {\n  var result = CharSetOk, subResult;\n  if (this.regexp_eatClassSetRange(state)) ; else if (subResult = this.regexp_eatClassSetOperand(state)) {\n    if (subResult === CharSetString) { result = CharSetString; }\n    // https://tc39.es/ecma262/#prod-ClassIntersection\n    var start = state.pos;\n    while (state.eatChars([0x26, 0x26] /* && */)) {\n      if (\n        state.current() !== 0x26 /* & */ &&\n        (subResult = this.regexp_eatClassSetOperand(state))\n      ) {\n        if (subResult !== CharSetString) { result = CharSetOk; }\n        continue\n      }\n      state.raise(\"Invalid character in character class\");\n    }\n    if (start !== state.pos) { return result }\n    // https://tc39.es/ecma262/#prod-ClassSubtraction\n    while (state.eatChars([0x2D, 0x2D] /* -- */)) {\n      if (this.regexp_eatClassSetOperand(state)) { continue }\n      state.raise(\"Invalid character in character class\");\n    }\n    if (start !== state.pos) { return result }\n  } else {\n    state.raise(\"Invalid character in character class\");\n  }\n  // https://tc39.es/ecma262/#prod-ClassUnion\n  for (;;) {\n    if (this.regexp_eatClassSetRange(state)) { continue }\n    subResult = this.regexp_eatClassSetOperand(state);\n    if (!subResult) { return result }\n    if (subResult === CharSetString) { result = CharSetString; }\n  }\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetRange\npp$1.regexp_eatClassSetRange = function(state) {\n  var start = state.pos;\n  if (this.regexp_eatClassSetCharacter(state)) {\n    var left = state.lastIntValue;\n    if (state.eat(0x2D /* - */) && this.regexp_eatClassSetCharacter(state)) {\n      var right = state.lastIntValue;\n      if (left !== -1 && right !== -1 && left > right) {\n        state.raise(\"Range out of order in character class\");\n      }\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetOperand\npp$1.regexp_eatClassSetOperand = function(state) {\n  if (this.regexp_eatClassSetCharacter(state)) { return CharSetOk }\n  return this.regexp_eatClassStringDisjunction(state) || this.regexp_eatNestedClass(state)\n};\n\n// https://tc39.es/ecma262/#prod-NestedClass\npp$1.regexp_eatNestedClass = function(state) {\n  var start = state.pos;\n  if (state.eat(0x5B /* [ */)) {\n    var negate = state.eat(0x5E /* ^ */);\n    var result = this.regexp_classContents(state);\n    if (state.eat(0x5D /* ] */)) {\n      if (negate && result === CharSetString) {\n        state.raise(\"Negated character class may contain strings\");\n      }\n      return result\n    }\n    state.pos = start;\n  }\n  if (state.eat(0x5C /* \\ */)) {\n    var result$1 = this.regexp_eatCharacterClassEscape(state);\n    if (result$1) {\n      return result$1\n    }\n    state.pos = start;\n  }\n  return null\n};\n\n// https://tc39.es/ecma262/#prod-ClassStringDisjunction\npp$1.regexp_eatClassStringDisjunction = function(state) {\n  var start = state.pos;\n  if (state.eatChars([0x5C, 0x71] /* \\q */)) {\n    if (state.eat(0x7B /* { */)) {\n      var result = this.regexp_classStringDisjunctionContents(state);\n      if (state.eat(0x7D /* } */)) {\n        return result\n      }\n    } else {\n      // Make the same message as V8.\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n  return null\n};\n\n// https://tc39.es/ecma262/#prod-ClassStringDisjunctionContents\npp$1.regexp_classStringDisjunctionContents = function(state) {\n  var result = this.regexp_classString(state);\n  while (state.eat(0x7C /* | */)) {\n    if (this.regexp_classString(state) === CharSetString) { result = CharSetString; }\n  }\n  return result\n};\n\n// https://tc39.es/ecma262/#prod-ClassString\n// https://tc39.es/ecma262/#prod-NonEmptyClassString\npp$1.regexp_classString = function(state) {\n  var count = 0;\n  while (this.regexp_eatClassSetCharacter(state)) { count++; }\n  return count === 1 ? CharSetOk : CharSetString\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetCharacter\npp$1.regexp_eatClassSetCharacter = function(state) {\n  var start = state.pos;\n  if (state.eat(0x5C /* \\ */)) {\n    if (\n      this.regexp_eatCharacterEscape(state) ||\n      this.regexp_eatClassSetReservedPunctuator(state)\n    ) {\n      return true\n    }\n    if (state.eat(0x62 /* b */)) {\n      state.lastIntValue = 0x08; /* <BS> */\n      return true\n    }\n    state.pos = start;\n    return false\n  }\n  var ch = state.current();\n  if (ch < 0 || ch === state.lookahead() && isClassSetReservedDoublePunctuatorCharacter(ch)) { return false }\n  if (isClassSetSyntaxCharacter(ch)) { return false }\n  state.advance();\n  state.lastIntValue = ch;\n  return true\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetReservedDoublePunctuator\nfunction isClassSetReservedDoublePunctuatorCharacter(ch) {\n  return (\n    ch === 0x21 /* ! */ ||\n    ch >= 0x23 /* # */ && ch <= 0x26 /* & */ ||\n    ch >= 0x2A /* * */ && ch <= 0x2C /* , */ ||\n    ch === 0x2E /* . */ ||\n    ch >= 0x3A /* : */ && ch <= 0x40 /* @ */ ||\n    ch === 0x5E /* ^ */ ||\n    ch === 0x60 /* ` */ ||\n    ch === 0x7E /* ~ */\n  )\n}\n\n// https://tc39.es/ecma262/#prod-ClassSetSyntaxCharacter\nfunction isClassSetSyntaxCharacter(ch) {\n  return (\n    ch === 0x28 /* ( */ ||\n    ch === 0x29 /* ) */ ||\n    ch === 0x2D /* - */ ||\n    ch === 0x2F /* / */ ||\n    ch >= 0x5B /* [ */ && ch <= 0x5D /* ] */ ||\n    ch >= 0x7B /* { */ && ch <= 0x7D /* } */\n  )\n}\n\n// https://tc39.es/ecma262/#prod-ClassSetReservedPunctuator\npp$1.regexp_eatClassSetReservedPunctuator = function(state) {\n  var ch = state.current();\n  if (isClassSetReservedPunctuator(ch)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetReservedPunctuator\nfunction isClassSetReservedPunctuator(ch) {\n  return (\n    ch === 0x21 /* ! */ ||\n    ch === 0x23 /* # */ ||\n    ch === 0x25 /* % */ ||\n    ch === 0x26 /* & */ ||\n    ch === 0x2C /* , */ ||\n    ch === 0x2D /* - */ ||\n    ch >= 0x3A /* : */ && ch <= 0x3E /* > */ ||\n    ch === 0x40 /* @ */ ||\n    ch === 0x60 /* ` */ ||\n    ch === 0x7E /* ~ */\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter\npp$1.regexp_eatClassControlLetter = function(state) {\n  var ch = state.current();\n  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {\n    state.lastIntValue = ch % 0x20;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$1.regexp_eatHexEscapeSequence = function(state) {\n  var start = state.pos;\n  if (state.eat(0x78 /* x */)) {\n    if (this.regexp_eatFixedHexDigits(state, 2)) {\n      return true\n    }\n    if (state.switchU) {\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits\npp$1.regexp_eatDecimalDigits = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  state.lastIntValue = 0;\n  while (isDecimalDigit(ch = state.current())) {\n    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);\n    state.advance();\n  }\n  return state.pos !== start\n};\nfunction isDecimalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits\npp$1.regexp_eatHexDigits = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  state.lastIntValue = 0;\n  while (isHexDigit(ch = state.current())) {\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n    state.advance();\n  }\n  return state.pos !== start\n};\nfunction isHexDigit(ch) {\n  return (\n    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||\n    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)\n  )\n}\nfunction hexToInt(ch) {\n  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {\n    return 10 + (ch - 0x41 /* A */)\n  }\n  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {\n    return 10 + (ch - 0x61 /* a */)\n  }\n  return ch - 0x30 /* 0 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence\n// Allows only 0-377(octal) i.e. 0-255(decimal).\npp$1.regexp_eatLegacyOctalEscapeSequence = function(state) {\n  if (this.regexp_eatOctalDigit(state)) {\n    var n1 = state.lastIntValue;\n    if (this.regexp_eatOctalDigit(state)) {\n      var n2 = state.lastIntValue;\n      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {\n        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;\n      } else {\n        state.lastIntValue = n1 * 8 + n2;\n      }\n    } else {\n      state.lastIntValue = n1;\n    }\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit\npp$1.regexp_eatOctalDigit = function(state) {\n  var ch = state.current();\n  if (isOctalDigit(ch)) {\n    state.lastIntValue = ch - 0x30; /* 0 */\n    state.advance();\n    return true\n  }\n  state.lastIntValue = 0;\n  return false\n};\nfunction isOctalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit\n// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$1.regexp_eatFixedHexDigits = function(state, length) {\n  var start = state.pos;\n  state.lastIntValue = 0;\n  for (var i = 0; i < length; ++i) {\n    var ch = state.current();\n    if (!isHexDigit(ch)) {\n      state.pos = start;\n      return false\n    }\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n    state.advance();\n  }\n  return true\n};\n\n// Object type used to represent tokens. Note that normally, tokens\n// simply exist as properties on the parser object. This is only\n// used for the onToken callback and the external tokenizer.\n\nvar Token = function Token(p) {\n  this.type = p.type;\n  this.value = p.value;\n  this.start = p.start;\n  this.end = p.end;\n  if (p.options.locations)\n    { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }\n  if (p.options.ranges)\n    { this.range = [p.start, p.end]; }\n};\n\n// ## Tokenizer\n\nvar pp = Parser.prototype;\n\n// Move to the next token\n\npp.next = function(ignoreEscapeSequenceInKeyword) {\n  if (!ignoreEscapeSequenceInKeyword && this.type.keyword && this.containsEsc)\n    { this.raiseRecoverable(this.start, \"Escape sequence in keyword \" + this.type.keyword); }\n  if (this.options.onToken)\n    { this.options.onToken(new Token(this)); }\n\n  this.lastTokEnd = this.end;\n  this.lastTokStart = this.start;\n  this.lastTokEndLoc = this.endLoc;\n  this.lastTokStartLoc = this.startLoc;\n  this.nextToken();\n};\n\npp.getToken = function() {\n  this.next();\n  return new Token(this)\n};\n\n// If we're in an ES6 environment, make parsers iterable\nif (typeof Symbol !== \"undefined\")\n  { pp[Symbol.iterator] = function() {\n    var this$1$1 = this;\n\n    return {\n      next: function () {\n        var token = this$1$1.getToken();\n        return {\n          done: token.type === types$1.eof,\n          value: token\n        }\n      }\n    }\n  }; }\n\n// Toggle strict mode. Re-reads the next number or string to please\n// pedantic tests (`\"use strict\"; 010;` should fail).\n\n// Read a single token, updating the parser object's token-related\n// properties.\n\npp.nextToken = function() {\n  var curContext = this.curContext();\n  if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }\n\n  this.start = this.pos;\n  if (this.options.locations) { this.startLoc = this.curPosition(); }\n  if (this.pos >= this.input.length) { return this.finishToken(types$1.eof) }\n\n  if (curContext.override) { return curContext.override(this) }\n  else { this.readToken(this.fullCharCodeAtPos()); }\n};\n\npp.readToken = function(code) {\n  // Identifier or keyword. '\\uXXXX' sequences are allowed in\n  // identifiers, so '\\' also dispatches to that.\n  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\\' */)\n    { return this.readWord() }\n\n  return this.getTokenFromCode(code)\n};\n\npp.fullCharCodeAtPos = function() {\n  var code = this.input.charCodeAt(this.pos);\n  if (code <= 0xd7ff || code >= 0xdc00) { return code }\n  var next = this.input.charCodeAt(this.pos + 1);\n  return next <= 0xdbff || next >= 0xe000 ? code : (code << 10) + next - 0x35fdc00\n};\n\npp.skipBlockComment = function() {\n  var startLoc = this.options.onComment && this.curPosition();\n  var start = this.pos, end = this.input.indexOf(\"*/\", this.pos += 2);\n  if (end === -1) { this.raise(this.pos - 2, \"Unterminated comment\"); }\n  this.pos = end + 2;\n  if (this.options.locations) {\n    for (var nextBreak = (void 0), pos = start; (nextBreak = nextLineBreak(this.input, pos, this.pos)) > -1;) {\n      ++this.curLine;\n      pos = this.lineStart = nextBreak;\n    }\n  }\n  if (this.options.onComment)\n    { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,\n                           startLoc, this.curPosition()); }\n};\n\npp.skipLineComment = function(startSkip) {\n  var start = this.pos;\n  var startLoc = this.options.onComment && this.curPosition();\n  var ch = this.input.charCodeAt(this.pos += startSkip);\n  while (this.pos < this.input.length && !isNewLine(ch)) {\n    ch = this.input.charCodeAt(++this.pos);\n  }\n  if (this.options.onComment)\n    { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,\n                           startLoc, this.curPosition()); }\n};\n\n// Called at the start of the parse and after every token. Skips\n// whitespace and comments, and.\n\npp.skipSpace = function() {\n  loop: while (this.pos < this.input.length) {\n    var ch = this.input.charCodeAt(this.pos);\n    switch (ch) {\n    case 32: case 160: // ' '\n      ++this.pos;\n      break\n    case 13:\n      if (this.input.charCodeAt(this.pos + 1) === 10) {\n        ++this.pos;\n      }\n    case 10: case 8232: case 8233:\n      ++this.pos;\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n      break\n    case 47: // '/'\n      switch (this.input.charCodeAt(this.pos + 1)) {\n      case 42: // '*'\n        this.skipBlockComment();\n        break\n      case 47:\n        this.skipLineComment(2);\n        break\n      default:\n        break loop\n      }\n      break\n    default:\n      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {\n        ++this.pos;\n      } else {\n        break loop\n      }\n    }\n  }\n};\n\n// Called at the end of every token. Sets `end`, `val`, and\n// maintains `context` and `exprAllowed`, and skips the space after\n// the token, so that the next one's `start` will point at the\n// right position.\n\npp.finishToken = function(type, val) {\n  this.end = this.pos;\n  if (this.options.locations) { this.endLoc = this.curPosition(); }\n  var prevType = this.type;\n  this.type = type;\n  this.value = val;\n\n  this.updateContext(prevType);\n};\n\n// ### Token reading\n\n// This is the function that is called to fetch the next token. It\n// is somewhat obscure, because it works in character codes rather\n// than characters, and because operator parsing has been inlined\n// into it.\n//\n// All in the name of speed.\n//\npp.readToken_dot = function() {\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next >= 48 && next <= 57) { return this.readNumber(true) }\n  var next2 = this.input.charCodeAt(this.pos + 2);\n  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'\n    this.pos += 3;\n    return this.finishToken(types$1.ellipsis)\n  } else {\n    ++this.pos;\n    return this.finishToken(types$1.dot)\n  }\n};\n\npp.readToken_slash = function() { // '/'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.slash, 1)\n};\n\npp.readToken_mult_modulo_exp = function(code) { // '%*'\n  var next = this.input.charCodeAt(this.pos + 1);\n  var size = 1;\n  var tokentype = code === 42 ? types$1.star : types$1.modulo;\n\n  // exponentiation operator ** and **=\n  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {\n    ++size;\n    tokentype = types$1.starstar;\n    next = this.input.charCodeAt(this.pos + 2);\n  }\n\n  if (next === 61) { return this.finishOp(types$1.assign, size + 1) }\n  return this.finishOp(tokentype, size)\n};\n\npp.readToken_pipe_amp = function(code) { // '|&'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === code) {\n    if (this.options.ecmaVersion >= 12) {\n      var next2 = this.input.charCodeAt(this.pos + 2);\n      if (next2 === 61) { return this.finishOp(types$1.assign, 3) }\n    }\n    return this.finishOp(code === 124 ? types$1.logicalOR : types$1.logicalAND, 2)\n  }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(code === 124 ? types$1.bitwiseOR : types$1.bitwiseAND, 1)\n};\n\npp.readToken_caret = function() { // '^'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.bitwiseXOR, 1)\n};\n\npp.readToken_plus_min = function(code) { // '+-'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === code) {\n    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&\n        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {\n      // A `-->` line comment\n      this.skipLineComment(3);\n      this.skipSpace();\n      return this.nextToken()\n    }\n    return this.finishOp(types$1.incDec, 2)\n  }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.plusMin, 1)\n};\n\npp.readToken_lt_gt = function(code) { // '<>'\n  var next = this.input.charCodeAt(this.pos + 1);\n  var size = 1;\n  if (next === code) {\n    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;\n    if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types$1.assign, size + 1) }\n    return this.finishOp(types$1.bitShift, size)\n  }\n  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&\n      this.input.charCodeAt(this.pos + 3) === 45) {\n    // `<!--`, an XML-style comment that should be interpreted as a line comment\n    this.skipLineComment(4);\n    this.skipSpace();\n    return this.nextToken()\n  }\n  if (next === 61) { size = 2; }\n  return this.finishOp(types$1.relational, size)\n};\n\npp.readToken_eq_excl = function(code) { // '=!'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === 61) { return this.finishOp(types$1.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }\n  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'\n    this.pos += 2;\n    return this.finishToken(types$1.arrow)\n  }\n  return this.finishOp(code === 61 ? types$1.eq : types$1.prefix, 1)\n};\n\npp.readToken_question = function() { // '?'\n  var ecmaVersion = this.options.ecmaVersion;\n  if (ecmaVersion >= 11) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 46) {\n      var next2 = this.input.charCodeAt(this.pos + 2);\n      if (next2 < 48 || next2 > 57) { return this.finishOp(types$1.questionDot, 2) }\n    }\n    if (next === 63) {\n      if (ecmaVersion >= 12) {\n        var next2$1 = this.input.charCodeAt(this.pos + 2);\n        if (next2$1 === 61) { return this.finishOp(types$1.assign, 3) }\n      }\n      return this.finishOp(types$1.coalesce, 2)\n    }\n  }\n  return this.finishOp(types$1.question, 1)\n};\n\npp.readToken_numberSign = function() { // '#'\n  var ecmaVersion = this.options.ecmaVersion;\n  var code = 35; // '#'\n  if (ecmaVersion >= 13) {\n    ++this.pos;\n    code = this.fullCharCodeAtPos();\n    if (isIdentifierStart(code, true) || code === 92 /* '\\' */) {\n      return this.finishToken(types$1.privateId, this.readWord1())\n    }\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString(code) + \"'\");\n};\n\npp.getTokenFromCode = function(code) {\n  switch (code) {\n  // The interpretation of a dot depends on whether it is followed\n  // by a digit or another two dots.\n  case 46: // '.'\n    return this.readToken_dot()\n\n  // Punctuation tokens.\n  case 40: ++this.pos; return this.finishToken(types$1.parenL)\n  case 41: ++this.pos; return this.finishToken(types$1.parenR)\n  case 59: ++this.pos; return this.finishToken(types$1.semi)\n  case 44: ++this.pos; return this.finishToken(types$1.comma)\n  case 91: ++this.pos; return this.finishToken(types$1.bracketL)\n  case 93: ++this.pos; return this.finishToken(types$1.bracketR)\n  case 123: ++this.pos; return this.finishToken(types$1.braceL)\n  case 125: ++this.pos; return this.finishToken(types$1.braceR)\n  case 58: ++this.pos; return this.finishToken(types$1.colon)\n\n  case 96: // '`'\n    if (this.options.ecmaVersion < 6) { break }\n    ++this.pos;\n    return this.finishToken(types$1.backQuote)\n\n  case 48: // '0'\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number\n    if (this.options.ecmaVersion >= 6) {\n      if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number\n      if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number\n    }\n\n  // Anything else beginning with a digit is an integer, octal\n  // number, or float.\n  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9\n    return this.readNumber(false)\n\n  // Quotes produce strings.\n  case 34: case 39: // '\"', \"'\"\n    return this.readString(code)\n\n  // Operators are parsed inline in tiny state machines. '=' (61) is\n  // often referred to. `finishOp` simply skips the amount of\n  // characters it is given as second argument, and returns a token\n  // of the type given by its first argument.\n  case 47: // '/'\n    return this.readToken_slash()\n\n  case 37: case 42: // '%*'\n    return this.readToken_mult_modulo_exp(code)\n\n  case 124: case 38: // '|&'\n    return this.readToken_pipe_amp(code)\n\n  case 94: // '^'\n    return this.readToken_caret()\n\n  case 43: case 45: // '+-'\n    return this.readToken_plus_min(code)\n\n  case 60: case 62: // '<>'\n    return this.readToken_lt_gt(code)\n\n  case 61: case 33: // '=!'\n    return this.readToken_eq_excl(code)\n\n  case 63: // '?'\n    return this.readToken_question()\n\n  case 126: // '~'\n    return this.finishOp(types$1.prefix, 1)\n\n  case 35: // '#'\n    return this.readToken_numberSign()\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString(code) + \"'\");\n};\n\npp.finishOp = function(type, size) {\n  var str = this.input.slice(this.pos, this.pos + size);\n  this.pos += size;\n  return this.finishToken(type, str)\n};\n\npp.readRegexp = function() {\n  var escaped, inClass, start = this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(start, \"Unterminated regular expression\"); }\n    var ch = this.input.charAt(this.pos);\n    if (lineBreak.test(ch)) { this.raise(start, \"Unterminated regular expression\"); }\n    if (!escaped) {\n      if (ch === \"[\") { inClass = true; }\n      else if (ch === \"]\" && inClass) { inClass = false; }\n      else if (ch === \"/\" && !inClass) { break }\n      escaped = ch === \"\\\\\";\n    } else { escaped = false; }\n    ++this.pos;\n  }\n  var pattern = this.input.slice(start, this.pos);\n  ++this.pos;\n  var flagsStart = this.pos;\n  var flags = this.readWord1();\n  if (this.containsEsc) { this.unexpected(flagsStart); }\n\n  // Validate pattern\n  var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));\n  state.reset(start, pattern, flags);\n  this.validateRegExpFlags(state);\n  this.validateRegExpPattern(state);\n\n  // Create Literal#value property value.\n  var value = null;\n  try {\n    value = new RegExp(pattern, flags);\n  } catch (e) {\n    // ESTree requires null if it failed to instantiate RegExp object.\n    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral\n  }\n\n  return this.finishToken(types$1.regexp, {pattern: pattern, flags: flags, value: value})\n};\n\n// Read an integer in the given radix. Return null if zero digits\n// were read, the integer value otherwise. When `len` is given, this\n// will return `null` unless the integer has exactly `len` digits.\n\npp.readInt = function(radix, len, maybeLegacyOctalNumericLiteral) {\n  // `len` is used for character escape sequences. In that case, disallow separators.\n  var allowSeparators = this.options.ecmaVersion >= 12 && len === undefined;\n\n  // `maybeLegacyOctalNumericLiteral` is true if it doesn't have prefix (0x,0o,0b)\n  // and isn't fraction part nor exponent part. In that case, if the first digit\n  // is zero then disallow separators.\n  var isLegacyOctalNumericLiteral = maybeLegacyOctalNumericLiteral && this.input.charCodeAt(this.pos) === 48;\n\n  var start = this.pos, total = 0, lastCode = 0;\n  for (var i = 0, e = len == null ? Infinity : len; i < e; ++i, ++this.pos) {\n    var code = this.input.charCodeAt(this.pos), val = (void 0);\n\n    if (allowSeparators && code === 95) {\n      if (isLegacyOctalNumericLiteral) { this.raiseRecoverable(this.pos, \"Numeric separator is not allowed in legacy octal numeric literals\"); }\n      if (lastCode === 95) { this.raiseRecoverable(this.pos, \"Numeric separator must be exactly one underscore\"); }\n      if (i === 0) { this.raiseRecoverable(this.pos, \"Numeric separator is not allowed at the first of digits\"); }\n      lastCode = code;\n      continue\n    }\n\n    if (code >= 97) { val = code - 97 + 10; } // a\n    else if (code >= 65) { val = code - 65 + 10; } // A\n    else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9\n    else { val = Infinity; }\n    if (val >= radix) { break }\n    lastCode = code;\n    total = total * radix + val;\n  }\n\n  if (allowSeparators && lastCode === 95) { this.raiseRecoverable(this.pos - 1, \"Numeric separator is not allowed at the last of digits\"); }\n  if (this.pos === start || len != null && this.pos - start !== len) { return null }\n\n  return total\n};\n\nfunction stringToNumber(str, isLegacyOctalNumericLiteral) {\n  if (isLegacyOctalNumericLiteral) {\n    return parseInt(str, 8)\n  }\n\n  // `parseFloat(value)` stops parsing at the first numeric separator then returns a wrong value.\n  return parseFloat(str.replace(/_/g, \"\"))\n}\n\nfunction stringToBigInt(str) {\n  if (typeof BigInt !== \"function\") {\n    return null\n  }\n\n  // `BigInt(value)` throws syntax error if the string contains numeric separators.\n  return BigInt(str.replace(/_/g, \"\"))\n}\n\npp.readRadixNumber = function(radix) {\n  var start = this.pos;\n  this.pos += 2; // 0x\n  var val = this.readInt(radix);\n  if (val == null) { this.raise(this.start + 2, \"Expected number in radix \" + radix); }\n  if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {\n    val = stringToBigInt(this.input.slice(start, this.pos));\n    ++this.pos;\n  } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n  return this.finishToken(types$1.num, val)\n};\n\n// Read an integer, octal integer, or floating-point number.\n\npp.readNumber = function(startsWithDot) {\n  var start = this.pos;\n  if (!startsWithDot && this.readInt(10, undefined, true) === null) { this.raise(start, \"Invalid number\"); }\n  var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;\n  if (octal && this.strict) { this.raise(start, \"Invalid number\"); }\n  var next = this.input.charCodeAt(this.pos);\n  if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {\n    var val$1 = stringToBigInt(this.input.slice(start, this.pos));\n    ++this.pos;\n    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n    return this.finishToken(types$1.num, val$1)\n  }\n  if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }\n  if (next === 46 && !octal) { // '.'\n    ++this.pos;\n    this.readInt(10);\n    next = this.input.charCodeAt(this.pos);\n  }\n  if ((next === 69 || next === 101) && !octal) { // 'eE'\n    next = this.input.charCodeAt(++this.pos);\n    if (next === 43 || next === 45) { ++this.pos; } // '+-'\n    if (this.readInt(10) === null) { this.raise(start, \"Invalid number\"); }\n  }\n  if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n\n  var val = stringToNumber(this.input.slice(start, this.pos), octal);\n  return this.finishToken(types$1.num, val)\n};\n\n// Read a string value, interpreting backslash-escapes.\n\npp.readCodePoint = function() {\n  var ch = this.input.charCodeAt(this.pos), code;\n\n  if (ch === 123) { // '{'\n    if (this.options.ecmaVersion < 6) { this.unexpected(); }\n    var codePos = ++this.pos;\n    code = this.readHexChar(this.input.indexOf(\"}\", this.pos) - this.pos);\n    ++this.pos;\n    if (code > 0x10FFFF) { this.invalidStringToken(codePos, \"Code point out of bounds\"); }\n  } else {\n    code = this.readHexChar(4);\n  }\n  return code\n};\n\npp.readString = function(quote) {\n  var out = \"\", chunkStart = ++this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(this.start, \"Unterminated string constant\"); }\n    var ch = this.input.charCodeAt(this.pos);\n    if (ch === quote) { break }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos);\n      out += this.readEscapedChar(false);\n      chunkStart = this.pos;\n    } else if (ch === 0x2028 || ch === 0x2029) {\n      if (this.options.ecmaVersion < 10) { this.raise(this.start, \"Unterminated string constant\"); }\n      ++this.pos;\n      if (this.options.locations) {\n        this.curLine++;\n        this.lineStart = this.pos;\n      }\n    } else {\n      if (isNewLine(ch)) { this.raise(this.start, \"Unterminated string constant\"); }\n      ++this.pos;\n    }\n  }\n  out += this.input.slice(chunkStart, this.pos++);\n  return this.finishToken(types$1.string, out)\n};\n\n// Reads template string tokens.\n\nvar INVALID_TEMPLATE_ESCAPE_ERROR = {};\n\npp.tryReadTemplateToken = function() {\n  this.inTemplateElement = true;\n  try {\n    this.readTmplToken();\n  } catch (err) {\n    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {\n      this.readInvalidTemplateToken();\n    } else {\n      throw err\n    }\n  }\n\n  this.inTemplateElement = false;\n};\n\npp.invalidStringToken = function(position, message) {\n  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {\n    throw INVALID_TEMPLATE_ESCAPE_ERROR\n  } else {\n    this.raise(position, message);\n  }\n};\n\npp.readTmplToken = function() {\n  var out = \"\", chunkStart = this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(this.start, \"Unterminated template\"); }\n    var ch = this.input.charCodeAt(this.pos);\n    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'\n      if (this.pos === this.start && (this.type === types$1.template || this.type === types$1.invalidTemplate)) {\n        if (ch === 36) {\n          this.pos += 2;\n          return this.finishToken(types$1.dollarBraceL)\n        } else {\n          ++this.pos;\n          return this.finishToken(types$1.backQuote)\n        }\n      }\n      out += this.input.slice(chunkStart, this.pos);\n      return this.finishToken(types$1.template, out)\n    }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos);\n      out += this.readEscapedChar(true);\n      chunkStart = this.pos;\n    } else if (isNewLine(ch)) {\n      out += this.input.slice(chunkStart, this.pos);\n      ++this.pos;\n      switch (ch) {\n      case 13:\n        if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }\n      case 10:\n        out += \"\\n\";\n        break\n      default:\n        out += String.fromCharCode(ch);\n        break\n      }\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n      chunkStart = this.pos;\n    } else {\n      ++this.pos;\n    }\n  }\n};\n\n// Reads a template token to search for the end, without validating any escape sequences\npp.readInvalidTemplateToken = function() {\n  for (; this.pos < this.input.length; this.pos++) {\n    switch (this.input[this.pos]) {\n    case \"\\\\\":\n      ++this.pos;\n      break\n\n    case \"$\":\n      if (this.input[this.pos + 1] !== \"{\") { break }\n      // fall through\n    case \"`\":\n      return this.finishToken(types$1.invalidTemplate, this.input.slice(this.start, this.pos))\n\n    case \"\\r\":\n      if (this.input[this.pos + 1] === \"\\n\") { ++this.pos; }\n      // fall through\n    case \"\\n\": case \"\\u2028\": case \"\\u2029\":\n      ++this.curLine;\n      this.lineStart = this.pos + 1;\n      break\n    }\n  }\n  this.raise(this.start, \"Unterminated template\");\n};\n\n// Used to read escaped characters\n\npp.readEscapedChar = function(inTemplate) {\n  var ch = this.input.charCodeAt(++this.pos);\n  ++this.pos;\n  switch (ch) {\n  case 110: return \"\\n\" // 'n' -> '\\n'\n  case 114: return \"\\r\" // 'r' -> '\\r'\n  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'\n  case 117: return codePointToString(this.readCodePoint()) // 'u'\n  case 116: return \"\\t\" // 't' -> '\\t'\n  case 98: return \"\\b\" // 'b' -> '\\b'\n  case 118: return \"\\u000b\" // 'v' -> '\\u000b'\n  case 102: return \"\\f\" // 'f' -> '\\f'\n  case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\\r\\n'\n  case 10: // ' \\n'\n    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }\n    return \"\"\n  case 56:\n  case 57:\n    if (this.strict) {\n      this.invalidStringToken(\n        this.pos - 1,\n        \"Invalid escape sequence\"\n      );\n    }\n    if (inTemplate) {\n      var codePos = this.pos - 1;\n\n      this.invalidStringToken(\n        codePos,\n        \"Invalid escape sequence in template string\"\n      );\n    }\n  default:\n    if (ch >= 48 && ch <= 55) {\n      var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];\n      var octal = parseInt(octalStr, 8);\n      if (octal > 255) {\n        octalStr = octalStr.slice(0, -1);\n        octal = parseInt(octalStr, 8);\n      }\n      this.pos += octalStr.length - 1;\n      ch = this.input.charCodeAt(this.pos);\n      if ((octalStr !== \"0\" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {\n        this.invalidStringToken(\n          this.pos - 1 - octalStr.length,\n          inTemplate\n            ? \"Octal literal in template string\"\n            : \"Octal literal in strict mode\"\n        );\n      }\n      return String.fromCharCode(octal)\n    }\n    if (isNewLine(ch)) {\n      // Unicode new line characters after \\ get removed from output in both\n      // template literals and strings\n      if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }\n      return \"\"\n    }\n    return String.fromCharCode(ch)\n  }\n};\n\n// Used to read character escape sequences ('\\x', '\\u', '\\U').\n\npp.readHexChar = function(len) {\n  var codePos = this.pos;\n  var n = this.readInt(16, len);\n  if (n === null) { this.invalidStringToken(codePos, \"Bad character escape sequence\"); }\n  return n\n};\n\n// Read an identifier, and return it as a string. Sets `this.containsEsc`\n// to whether the word contained a '\\u' escape.\n//\n// Incrementally adds only escaped chars, adding other chunks as-is\n// as a micro-optimization.\n\npp.readWord1 = function() {\n  this.containsEsc = false;\n  var word = \"\", first = true, chunkStart = this.pos;\n  var astral = this.options.ecmaVersion >= 6;\n  while (this.pos < this.input.length) {\n    var ch = this.fullCharCodeAtPos();\n    if (isIdentifierChar(ch, astral)) {\n      this.pos += ch <= 0xffff ? 1 : 2;\n    } else if (ch === 92) { // \"\\\"\n      this.containsEsc = true;\n      word += this.input.slice(chunkStart, this.pos);\n      var escStart = this.pos;\n      if (this.input.charCodeAt(++this.pos) !== 117) // \"u\"\n        { this.invalidStringToken(this.pos, \"Expecting Unicode escape sequence \\\\uXXXX\"); }\n      ++this.pos;\n      var esc = this.readCodePoint();\n      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))\n        { this.invalidStringToken(escStart, \"Invalid Unicode escape\"); }\n      word += codePointToString(esc);\n      chunkStart = this.pos;\n    } else {\n      break\n    }\n    first = false;\n  }\n  return word + this.input.slice(chunkStart, this.pos)\n};\n\n// Read an identifier or keyword token. Will check for reserved\n// words when necessary.\n\npp.readWord = function() {\n  var word = this.readWord1();\n  var type = types$1.name;\n  if (this.keywords.test(word)) {\n    type = keywords[word];\n  }\n  return this.finishToken(type, word)\n};\n\n// Acorn is a tiny, fast JavaScript parser written in JavaScript.\n//\n// Acorn was written by Marijn Haverbeke, Ingvar Stepanyan, and\n// various contributors and released under an MIT license.\n//\n// Git repositories for Acorn are available at\n//\n//     http://marijnhaverbeke.nl/git/acorn\n//     https://github.com/acornjs/acorn.git\n//\n// Please use the [github bug tracker][ghbt] to report issues.\n//\n// [ghbt]: https://github.com/acornjs/acorn/issues\n\n\nvar version = \"8.15.0\";\n\nParser.acorn = {\n  Parser: Parser,\n  version: version,\n  defaultOptions: defaultOptions,\n  Position: Position,\n  SourceLocation: SourceLocation,\n  getLineInfo: getLineInfo,\n  Node: Node,\n  TokenType: TokenType,\n  tokTypes: types$1,\n  keywordTypes: keywords,\n  TokContext: TokContext,\n  tokContexts: types,\n  isIdentifierChar: isIdentifierChar,\n  isIdentifierStart: isIdentifierStart,\n  Token: Token,\n  isNewLine: isNewLine,\n  lineBreak: lineBreak,\n  lineBreakG: lineBreakG,\n  nonASCIIwhitespace: nonASCIIwhitespace\n};\n\n// The main exported interface (under `self.acorn` when in the\n// browser) is a `parse` function that takes a code string and returns\n// an abstract syntax tree as specified by the [ESTree spec][estree].\n//\n// [estree]: https://github.com/estree/estree\n\nfunction parse(input, options) {\n  return Parser.parse(input, options)\n}\n\n// This function tries to parse a single expression at a given\n// offset in a string. Useful for parsing mixed-language formats\n// that embed JavaScript expressions.\n\nfunction parseExpressionAt(input, pos, options) {\n  return Parser.parseExpressionAt(input, pos, options)\n}\n\n// Acorn is organized as a tokenizer and a recursive-descent parser.\n// The `tokenizer` export provides an interface to the tokenizer.\n\nfunction tokenizer(input, options) {\n  return Parser.tokenizer(input, options)\n}\n\nexport { Node, Parser, Position, SourceLocation, TokContext, Token, TokenType, defaultOptions, getLineInfo, isIdentifierChar, isIdentifierStart, isNewLine, keywords as keywordTypes, lineBreak, lineBreakG, nonASCIIwhitespace, parse, parseExpressionAt, types as tokContexts, types$1 as tokTypes, tokenizer, version };\n","/**\n * Sanitize an ID for use as an AssemblyScript identifier.\n * Replaces hyphens and other special characters with underscores.\n *\n * @param id - The ID to sanitize\n * @returns A valid AssemblyScript identifier\n */\nexport function sanitizeId(id: string): string {\n  // Replace hyphens and other non-alphanumeric characters (except underscores) with underscores\n  return id.replace(/[^a-zA-Z0-9_]/g, '_');\n}\n\n/**\n * Convert a node name to a camelCase key.\n * Used for wrapping decision table outputs with the node name.\n * Example: \"RiskFactors\" -> \"riskFactors\", \"DiscountRules\" -> \"discountRules\"\n *\n * @param name - The node name to convert\n * @returns A camelCase key\n */\nexport function nodeNameToKey(name: string): string {\n  if (!name || name.length === 0) {\n    return name;\n  }\n  // Lowercase the first character\n  return name.charAt(0).toLowerCase() + name.slice(1);\n}\n","import type { CompilationContext } from '../types';\nimport { CompilationError, ErrorCode, type SourceLocation } from '../errors';\nimport { parse as parseAcorn } from 'acorn';\nimport { sanitizeId } from '../utils';\n\n/**\n * Function node content interface\n */\nexport interface FunctionNodeContent {\n  /** The JavaScript source code for the function */\n  source: string;\n  /** Parsed AST of the function body */\n  ast?: any;\n  /** Extracted function parameters */\n  parameters: string[];\n}\n\n/**\n * Extract the source code from a function node content field.\n *\n * Handles both legacy format (plain string) and v2 format (object with source property).\n * TODO: Verify if legacy format still exists in fixtures, update comment accordingly\n *\n * @param content - The content field from a function node\n * @param location - Optional source location for error reporting\n * @returns The JavaScript source code string\n */\nexport function extractFunctionSource(content: any, location?: SourceLocation): string {\n  if (content === null || content === undefined) {\n    throw new CompilationError(\n      'Function node content is missing',\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      location,\n    );\n  }\n\n  if (typeof content === 'object' && content.source !== undefined) {\n    if (typeof content.source !== 'string') {\n      throw new CompilationError(\n        'Function node content.source must be a string',\n        ErrorCode.INVALID_NODE_STRUCTURE,\n        { ...location, field: 'content.source' },\n      );\n    }\n    return content.source;\n  }\n\n  if (typeof content === 'string') {\n    return content;\n  }\n\n  throw new CompilationError(\n    'Function node content must be either a string or an object with a source property',\n    ErrorCode.INVALID_NODE_STRUCTURE,\n    { ...location, field: 'content' },\n  );\n}\n\n/**\n * Parse JavaScript function code to extract parameters and body.\n *\n * @param source - The JavaScript source code string\n * @param location - Optional source location for error reporting\n * @returns A FunctionNodeContent with extracted information\n */\nexport function parseFunctionCode(source: string, location?: SourceLocation): FunctionNodeContent {\n  const content: FunctionNodeContent = {\n    source,\n    parameters: [],\n  };\n\n  try {\n    // Parse the source code using Acorn.\n    const ast = parseAcorn(source, {\n      ecmaVersion: 'latest',\n      sourceType: 'module',\n      allowAwaitOutsideFunction: true,\n    });\n\n    content.ast = ast;\n\n    const functionNode = findExportedFunction(ast);\n\n    if (functionNode) {\n      content.parameters = extractParameters(functionNode);\n    }\n  } catch (error) {\n    // Parse errors in function code should fail compilation immediately with clear error\n    // messages, rather than deferring to runtime where the error context would be lost.\n    if (error instanceof Error) {\n      throw new CompilationError(\n        `Failed to parse function code: ${error.message}`,\n        ErrorCode.PARSE_ERROR,\n        { ...location, field: 'content.source' },\n      );\n    }\n    throw error;\n  }\n\n  return content;\n}\n\n/**\n * Validate a function node's content structure.\n *\n * @param node - The JDM function node to validate\n * @returns Extracted and validated function node content\n */\nexport function validateFunctionNode(node: {\n  id: string;\n  name: string;\n  content?: any;\n}): FunctionNodeContent {\n  const location: SourceLocation = { nodeId: node.id, nodeName: node.name };\n\n  if (!node.content) {\n    throw new CompilationError(\n      `Function node \"${node.name}\" (${node.id}) is missing required content field`,\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { ...location, field: 'content' },\n    );\n  }\n\n  const source = extractFunctionSource(node.content, location);\n\n  const parsedContent = parseFunctionCode(source, location);\n\n  return {\n    ...parsedContent,\n    source,\n  };\n}\n\n/**\n * Find an exported function in the AST.\n *\n * Looks for patterns like:\n * - `export const handler = (input) => { ... }`\n * - `export function handler(input) { ... }`\n *\n * @param ast - The parsed AST\n * @returns The function declaration or expression, or null if not found\n */\nfunction findExportedFunction(ast: any): any {\n  if (!ast.body) {\n    return null;\n  }\n\n  for (const node of ast.body) {\n    // Pattern: export function name(...) { ... }\n    if (node.type === 'ExportNamedDeclaration' && node.declaration) {\n      if (node.declaration.type === 'FunctionDeclaration') {\n        return node.declaration;\n      }\n    }\n\n    // Pattern: export const/let/var name = (input) => { ... }\n    if (node.type === 'ExportNamedDeclaration' && node.declaration) {\n      if (node.declaration.type === 'VariableDeclaration') {\n        const declarator = node.declaration.declarations[0];\n        if (declarator && declarator.init) {\n          // Arrow function: (input) => { ... }\n          if (declarator.init.type === 'ArrowFunctionExpression') {\n            return declarator.init;\n          }\n          // Regular function: function(input) { ... }\n          if (declarator.init.type === 'FunctionExpression') {\n            return declarator.init;\n          }\n        }\n      }\n    }\n\n    // Pattern: export default ...) => { ... }\n    if (node.type === 'ExportDefaultDeclaration') {\n      if (node.declaration.type === 'FunctionDeclaration') {\n        return node.declaration;\n      }\n      if (node.declaration.type === 'ArrowFunctionExpression') {\n        return node.declaration;\n      }\n      if (node.declaration.type === 'FunctionExpression') {\n        return node.declaration;\n      }\n    }\n  }\n\n  return null;\n}\n\n/**\n * Extract parameter names from a function AST node.\n *\n * @param functionNode - The function AST node\n * @returns Array of parameter names\n */\nfunction extractParameters(functionNode: any): string[] {\n  if (!functionNode.params || !Array.isArray(functionNode.params)) {\n    return [];\n  }\n\n  return functionNode.params\n    .map((param: any) => {\n      // Simple identifier: input\n      if (param.type === 'Identifier') {\n        return param.name;\n      }\n\n      // Destructuring: { input, context } or [input, context]\n      if (param.type === 'ObjectPattern') {\n        return param.properties\n          .map((prop: any) => prop.key?.name || prop.value?.name)\n          .filter(Boolean);\n      }\n\n      if (param.type === 'ArrayPattern') {\n        return param.elements.map((elem: any) => elem?.name).filter(Boolean);\n      }\n\n      return null;\n    })\n    .flat()\n    .filter(Boolean) as string[];\n}\n\n/**\n * Compile a function node to AssemblyScript code.\n *\n * This function generates AssemblyScript code that:\n * 1. Reads input parameters from the context\n * 2. Calls the JavaScript bridge function to execute the user's function\n * 3. Converts the return value to the Value type\n *\n * @param node - The JDM function node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code for evaluating the function node\n */\nexport function compileFunctionNode(\n  node: {\n    id: string;\n    name: string;\n    content?: any;\n    parsedContent?: FunctionNodeContent;\n  },\n  context: CompilationContext,\n): string {\n  const sanitizedId = sanitizeId(node.id);\n\n  if (!node.parsedContent) {\n    throw new CompilationError(\n      `Function node \"${node.name}\" (${node.id}) has not been parsed`,\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { nodeId: node.id, nodeName: node.name, field: 'parsedContent' },\n    );\n  }\n\n  const { source, parameters } = node.parsedContent;\n\n  // Store the function source in the compilation context for later retrieval.\n  // Function sources must be kept separate from runtime context data to avoid naming conflicts\n  // and ensure proper scoping. The prefix prevents collisions with user-defined fields.\n  if (!context.functionSources) {\n    context.functionSources = new Map();\n  }\n  context.functionSources.set(sanitizedId, source);\n\n  // Generate parameter reading and marshaling code\n  // Parameters need to be collected into an array for the bridge call\n  const paramReads =\n    parameters.length > 0\n      ? parameters\n          .map((param) => {\n            return `  let ${param} = ctx.get(\"${param}\");`;\n          })\n          .join('\\n')\n      : '';\n\n  const paramArray =\n    parameters.length > 0\n      ? `\n  // Create parameter array for JavaScript bridge\n  let params = new Array<Value>(0);\n${parameters.map((param) => `  params.push(${param});`).join('\\n')}\n`\n      : `\n  // No parameters\n  let params = new Array<Value>(0);\n`;\n\n  // Generate the main evaluateNode function\n  // TODO: Mock execution returns a placeholder result for testing purposes.\n  // This allows the compiler to generate valid code and tests to run while the JavaScript\n  // function execution bridge is not yet implemented. This will be replaced with actual\n  // JavaScript bridge functionality in a future phase\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  // Function node: ${node.name}\n  // This node would execute JavaScript code and return the result\n  // For now, we return a mock result to allow compilation and testing\n\n${paramReads}\n${paramArray}\n  // Mock result: return an object indicating function execution\n  // This is a placeholder - actual JavaScript execution will be implemented\n  // via a JavaScript bridge in the runtime\n  let mockResult = new Map<string, Value>();\n  mockResult.set(\"_isFunctionNode\", Value.Bool(true));\n  mockResult.set(\"_nodeName\", Value.String(\"${node.name}\"));\n${parameters.length > 0 ? parameters.map((param) => `  mockResult.set(\"_${param}\", ${param});`).join('\\n') : ''}\n  mockResult.set(\"_output\", Value.String(\"Function execution not yet implemented\"));\n  \n  let result = Value.Object(mockResult);\n\n  return result;\n}`;\n}\n","import { CompilationError, ErrorCode } from './errors';\nimport { validateFunctionNode } from './nodes/function';\n\nexport enum NodeType {\n  INPUT = 'inputNode',\n  OUTPUT = 'outputNode',\n  DECISION_TABLE = 'decisionTableNode',\n  SWITCH = 'switchNode',\n  EXPRESSION = 'expressionNode',\n  DECISION = 'decisionNode',\n  FUNCTION = 'functionNode',\n}\n\nexport interface JDMNode {\n  id: string;\n  type: NodeType;\n  name: string;\n  position: { x: number; y: number };\n  content?: any;\n  parsedContent?: any;\n}\n\nexport interface JDMEdge {\n  id: string;\n  type: string;\n  sourceId: string;\n  targetId: string;\n  /** Optional source handle for nodes with multiple outputs (e.g., switch statements) */\n  sourceHandle?: string;\n}\n\nexport interface JDMDecision {\n  nodes: JDMNode[];\n  edges: JDMEdge[];\n  metadata?: any;\n}\n\n/**\n * Validate that a node has all required fields.\n *\n * All JDM nodes must have: id, name, and type.\n * Validating early provides clear error messages before processing.\n *\n * @param node - The node to validate\n * @param index - The index of the node in the nodes array (for error reporting)\n * @throws CompilationError if required fields are missing\n */\nexport function validateNodeStructure(node: any, index: number): void {\n  const missingFields: string[] = [];\n\n  if (typeof node.id !== 'string' || node.id.trim() === '') {\n    missingFields.push('id');\n  }\n\n  if (typeof node.name !== 'string') {\n    missingFields.push('name');\n  }\n\n  if (typeof node.type !== 'string' || node.type.trim() === '') {\n    missingFields.push('type');\n  }\n\n  if (missingFields.length > 0) {\n    const nodeIdentifier = node.id || node.name || `at index ${index}`;\n    throw new CompilationError(\n      `Node \"${nodeIdentifier}\" is missing required field(s): ${missingFields.join(', ')}`,\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { nodeId: node.id, nodeName: node.name },\n    );\n  }\n}\n\n/**\n * Parse and validate JDM JSON.\n * Function nodes have complex internal structure that needs schema validation and transformation.\n * Validating early provides better error messages and catches issues before expensive compilation steps.\n */\nexport function parseJDM(jdm: string | JDMDecision | any): JDMDecision {\n  const parsed: JDMDecision = typeof jdm === 'string' ? JSON.parse(jdm) : jdm;\n\n  // Validate basic structure before processing\n  if (!parsed.nodes || !Array.isArray(parsed.nodes)) {\n    throw new CompilationError(\n      \"Invalid JDM: missing or invalid 'nodes' array\",\n      ErrorCode.INVALID_JSON,\n      { field: 'nodes' },\n    );\n  }\n\n  // Validate each node has required fields before any processing\n  parsed.nodes.forEach((node: any, index: number) => {\n    validateNodeStructure(node, index);\n  });\n\n  // Function nodes have rich content structure (parameters, return type, expressions) requiring special\n  // parsing. Other node types have simpler content handled during codegen.\n  parsed.nodes.forEach((node: any) => {\n    if (node.type === NodeType.FUNCTION) {\n      try {\n        node.parsedContent = validateFunctionNode(node);\n      } catch (error) {\n        if (error instanceof CompilationError) {\n          throw error;\n        }\n        throw new CompilationError(\n          `Failed to parse function node \"${node.name}\": ${error instanceof Error ? error.message : String(error)}`,\n          ErrorCode.INVALID_NODE_STRUCTURE,\n          { nodeId: node.id, nodeName: node.name },\n        );\n      }\n    }\n  });\n\n  return parsed;\n}\n","import { DirectedGraph } from 'graphology';\nimport { topologicalSort } from 'graphology-dag';\nimport { type JDMNode, type JDMEdge, type JDMDecision, NodeType } from './parser';\nimport { CompilationError, ErrorCode, type SourceLocation } from './errors';\n\nexport type JDMGraph = DirectedGraph<JDMNode, JDMEdge>;\n\nexport function buildGraph(jdm: JDMDecision): JDMGraph {\n  const graph = new DirectedGraph<JDMNode, JDMEdge>();\n\n  // Map provides O(1) lookups for edge validation and node existence checks\n  const nodeMap = new Map<string, JDMNode>();\n  for (const node of jdm.nodes) {\n    graph.addNode(node.id, node);\n    nodeMap.set(node.id, node);\n  }\n\n  // Switch nodes can have multiple edges to same target (different cases/handles pointing to\n  // same node), but topological sort only needs one edge per source→target pair to establish\n  // ordering dependencies.\n  const addedEdges = new Set<string>();\n\n  // Add edges and check for self-references\n  for (const edge of jdm.edges) {\n    if (!nodeMap.has(edge.sourceId) || !nodeMap.has(edge.targetId)) {\n      const sourceNode = nodeMap.get(edge.sourceId);\n      const targetNode = nodeMap.get(edge.targetId);\n      throw new CompilationError(\n        `Invalid edge \"${edge.id}\": references non-existent node`,\n        ErrorCode.INVALID_EDGE,\n        {\n          nodeId: edge.sourceId,\n          nodeName: sourceNode?.name ?? targetNode?.name,\n          field: !nodeMap.has(edge.sourceId) ? 'sourceId' : 'targetId',\n        },\n      );\n    }\n\n    // Check for self-references (edge where source equals target)\n    if (edge.sourceId === edge.targetId) {\n      const node = graph.getNodeAttributes(edge.sourceId);\n      const location: SourceLocation = { nodeId: edge.sourceId, nodeName: node.name };\n      throw new CompilationError(\n        `Self-reference detected: node \"${node.name || edge.sourceId}\" references itself through edge \"${edge.id}\"`,\n        ErrorCode.CYCLE_DETECTED,\n        location,\n      );\n    }\n\n    // For topological ordering, we only need one edge between any two nodes.\n    // Switch nodes may have multiple edges to the same target (via different handles).\n    // We track the edge pair to avoid duplicates while preserving all edges in jdm.edges\n    // for the switch node compilation to use.\n    const edgePairKey = `${edge.sourceId}->${edge.targetId}`;\n    if (!addedEdges.has(edgePairKey)) {\n      graph.addEdgeWithKey(edge.id, edge.sourceId, edge.targetId, edge);\n      addedEdges.add(edgePairKey);\n    }\n  }\n\n  return graph;\n}\n\n/**\n * Find a cycle path in the graph using DFS. Graphology's cycle detection only returns a boolean,\n * but we need the actual cycle path to provide better error messages showing the problematic node\n * sequence to users.\n *\n * @param graph - The graph to search\n * @returns Array of node IDs representing the cycle, or null if no cycle\n */\nfunction findCyclePath(graph: JDMGraph): string[] | null {\n  const visited = new Set<string>();\n  const recursionStack = new Set<string>();\n  const parentMap = new Map<string, string | null>();\n\n  function dfs(nodeId: string, path: string[]): string[] | null {\n    visited.add(nodeId);\n    recursionStack.add(nodeId);\n    path.push(nodeId);\n\n    const neighbors = graph.outNeighbors(nodeId);\n    for (const neighborId of neighbors) {\n      if (!visited.has(neighborId)) {\n        parentMap.set(neighborId, nodeId);\n        const cycle = dfs(neighborId, path);\n        if (cycle) {\n          return cycle;\n        }\n      } else if (recursionStack.has(neighborId)) {\n        // Found a back edge - reconstruct the cycle path\n        // Path contains full traversal, but cycle only starts where we revisit a node.\n        // Slicing gives just the cycle portion (e.g., A→B→C→B extracts B→C→B).\n        const startIndex = path.indexOf(neighborId);\n        const cycle = [...path.slice(startIndex), neighborId];\n        return cycle;\n      }\n    }\n\n    recursionStack.delete(nodeId);\n    path.pop();\n    return null;\n  }\n\n  // Start DFS from each unvisited node\n  for (const nodeId of graph.nodes()) {\n    if (!visited.has(nodeId)) {\n      const cycle = dfs(nodeId, []);\n      if (cycle) {\n        return cycle;\n      }\n    }\n  }\n\n  return null;\n}\n\n/**\n * Format a cycle path as a readable string.\n *\n * @param cycle - Array of node IDs representing a cycle\n * @param graph - The graph to get node names from\n * @returns Formatted string like \"Node1 -> Node2 -> Node3 -> Node1\"\n */\nfunction formatCyclePath(cycle: string[], graph: JDMGraph): string {\n  return cycle\n    .map((nodeId) => {\n      const node = graph.getNodeAttributes(nodeId);\n      return node.name || nodeId;\n    })\n    .join(' -> ');\n}\n\nexport function validateGraph(graph: JDMGraph): void {\n  // Check for cycles using DFS to find the actual cycle path\n  const cyclePath = findCyclePath(graph);\n  if (cyclePath) {\n    const formattedPath = formatCyclePath(cyclePath, graph);\n    throw new CompilationError(\n      `Circular dependency detected: ${formattedPath}`,\n      ErrorCode.CYCLE_DETECTED,\n      { nodeId: cyclePath[0], nodeName: graph.getNodeAttributes(cyclePath[0]).name },\n    );\n  }\n\n  // Check for single input node\n  const inputNodes: string[] = [];\n  const outputNodes: string[] = [];\n\n  graph.forEachNode((nodeId, attrs) => {\n    if (attrs.type === NodeType.INPUT) {\n      inputNodes.push(nodeId);\n    }\n    if (attrs.type === NodeType.OUTPUT) {\n      outputNodes.push(nodeId);\n    }\n  });\n\n  if (inputNodes.length !== 1) {\n    // If there are multiple input nodes, include the first one in the location\n    const firstInputNode = inputNodes.length > 0 ? graph.getNodeAttributes(inputNodes[0]) : null;\n    throw new CompilationError(\n      `Expected exactly 1 input node, found ${inputNodes.length}`,\n      ErrorCode.MULTIPLE_INPUT_NODES,\n      firstInputNode ? { nodeId: firstInputNode.id, nodeName: firstInputNode.name } : undefined,\n    );\n  }\n  if (outputNodes.length === 0) {\n    throw new CompilationError(\n      'Expected at least 1 output node, found 0',\n      ErrorCode.MISSING_OUTPUT_NODE,\n      { field: 'outputNode' },\n    );\n  }\n}\n\n/**\n * Get nodes in topological order for evaluation.\n * This ensures dependencies are evaluated before dependents.\n */\nexport function getEvaluationOrder(graph: JDMGraph): string[] {\n  return topologicalSort(graph);\n}\n\n/**\n * Get all nodes that feed into a given node.\n */\nexport function getInputNodes(graph: JDMGraph, nodeId: string): JDMNode[] {\n  return graph.inNeighbors(nodeId).map((id) => graph.getNodeAttributes(id));\n}\n\n/**\n * Get all nodes that a given node feeds into.\n */\nexport function getOutputNodes(graph: JDMGraph, nodeId: string): JDMNode[] {\n  return graph.outNeighbors(nodeId).map((id) => graph.getNodeAttributes(id));\n}\n","import type { JDMNode } from '../parser';\nimport type { CompilationContext, AssemblyScriptCode } from '../types';\nimport { sanitizeId } from '../utils';\n\n/**\n * Compile an input node.\n *\n * Input nodes serve as entry points for the decision model and simply\n * pass through the context data.\n *\n * @param node - The JDM input node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileInputNode(node: JDMNode, _context: CompilationContext): AssemblyScriptCode {\n  const sanitizedId = sanitizeId(node.id);\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  // Input nodes are markers - they trigger evaluation but don't produce output.\n  // Null is used as a semantic marker meaning \"input processed, no output to add\".\n  // This distinguishes from actual output values while avoiding undefined/error states.\n  return Value.Null();\n}\n`;\n}\n\n/**\n * Compile an output node.\n *\n * Output nodes mark the end of the decision model and return the final result.\n * They return the accumulated context data from passThrough nodes.\n *\n * @param node - The JDM output node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileOutputNode(node: JDMNode, _context: CompilationContext): AssemblyScriptCode {\n  const sanitizedId = sanitizeId(node.id);\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  // Output nodes return the accumulated context data (passThrough values)\n  // Build result from all non-internal context entries\n  let __finalResult = new Map<string, Value>();\n  const __ctxKeys = ctx.data.keys();\n  for (let __i = 0; __i < __ctxKeys.length; __i++) {\n    const __key = __ctxKeys[__i];\n    // $-prefixed keys are internal namespaces ($nodes, $)\n    // # is iteration variable\n    // acc is reduce accumulator\n    // None should appear in final output - only actual output fields.\n    if (!__key.startsWith(\"$\") && __key !== \"#\" && __key !== \"acc\") {\n      // AssemblyScript has no Map.filter(), so we must iterate and conditionally add keys.\n      // This is more verbose but necessary given AS limitations.\n      __finalResult.set(__key, ctx.data.get(__key));\n    }\n  }\n  return Value.Object(__finalResult);\n}\n`;\n}\n","// ============================================================================\n// Context Resolver Strategy Pattern\n// ============================================================================\n//\n// The ContextResolver interface provides a strategy for resolving identifiers\n// and dollar references in different compilation contexts. This replaces three\n// separate compilation functions with a single unified function plus small\n// strategy implementations.\n//\n// Three modes:\n// 1. Standard: $ -> ctx.get(\"$\"), identifiers -> ctx.get(\"name\")\n// 2. LocalDollar: $ -> Value.Object(dollarVar), identifiers -> ctx.get(\"name\")\n// 3. Scoped: $ -> Value.Object(resultVar), identifiers -> scopedCtx.get(\"name\")\n\n/**\n * Strategy interface for resolving context references during expression compilation.\n *\n * Different compilation contexts require different resolutions:\n * - In standard expressions, $ refers to the global context\n * - In expression nodes, $ refers to the local result object being built\n * - In scoped expressions (inputField), identifiers resolve from a scoped context\n */\nexport interface ContextResolver {\n  /** Resolve an identifier reference (e.g., \"firstName\") */\n  resolveIdentifier(name: string): string;\n\n  /** Resolve a $ reference */\n  resolveDollarRef(): string;\n\n  /** Resolve a # reference (current element in higher-order functions) */\n  resolveHashRef(): string;\n\n  /** Resolve a member access path rooted at $ (e.g., \"$.foo.bar\" returns \"foo.bar\") */\n  resolveDollarPath(path: string): string;\n\n  /** Resolve a $nodes.X.Y path */\n  resolveNodesPath(path: string): string;\n\n  /** Get the context variable name for use in helper functions */\n  getContextVar(): string;\n\n  /** Create a child resolver for use inside helper functions (e.g., object literals) */\n  createChildResolver(): ContextResolver;\n\n  /** Get extra parameters for generated helper function signatures */\n  getHelperParams(): string;\n\n  /** Get extra arguments for calls to generated helper functions */\n  getHelperArgs(): string;\n}\n\n/**\n * Standard context resolver: $ and identifiers resolve from the global context.\n * Used in switch conditions, decision tables, and other standard expressions.\n */\nexport class StandardContextResolver implements ContextResolver {\n  resolveIdentifier(name: string): string {\n    return `ctx.get(\"${name}\")`;\n  }\n\n  resolveDollarRef(): string {\n    return `ctx.get(\"$\")`;\n  }\n\n  resolveHashRef(): string {\n    return `ctx.get(\"#\")`;\n  }\n\n  resolveDollarPath(path: string): string {\n    // In standard mode, $.foo.bar -> getProperty(ctx.get(\"$\"), \"foo\", \"bar\")\n    // Actually use nested getProperty calls for each segment\n    const segments = path.split('.');\n    let result = `ctx.get(\"$\")`;\n    for (const segment of segments) {\n      result = `getProperty(${result}, \"${segment}\")`;\n    }\n    return result;\n  }\n\n  resolveNodesPath(path: string): string {\n    return `ctx.get(\"${path}\")`;\n  }\n\n  getContextVar(): string {\n    return 'ctx';\n  }\n\n  createChildResolver(): ContextResolver {\n    // Child is same as parent in standard mode\n    return this;\n  }\n\n  getHelperParams(): string {\n    return '';\n  }\n\n  getHelperArgs(): string {\n    return '';\n  }\n}\n\n/**\n * Local dollar resolver: $ refers to a local Map variable (e.g., \"result\").\n * Used in expression nodes where $ references the output being built.\n */\nexport class LocalDollarContextResolver implements ContextResolver {\n  constructor(private dollarVar: string = 'result') {}\n\n  resolveIdentifier(name: string): string {\n    return `ctx.get(\"${name}\")`;\n  }\n\n  resolveDollarRef(): string {\n    return `Value.Object(${this.dollarVar})`;\n  }\n\n  resolveHashRef(): string {\n    return `ctx.get(\"#\")`;\n  }\n\n  resolveDollarPath(path: string): string {\n    // $.foo.bar looks up \"foo.bar\" as a flat key in the local result map\n    // Expression nodes store keys like \"eligibility.specialOffers\" as flat strings\n    return `(${this.dollarVar}.has(\"${path}\") ? ${this.dollarVar}.get(\"${path}\") : Value.Null())`;\n  }\n\n  resolveNodesPath(path: string): string {\n    return `ctx.get(\"${path}\")`;\n  }\n\n  getContextVar(): string {\n    return 'ctx';\n  }\n\n  createChildResolver(): ContextResolver {\n    // Child resolver references 'parentResult' to maintain access to outer scope\n    // Example: {a: 5, nested: {b: $.a}} - nested object's $.a refers to outer result\n    return new LocalDollarContextResolver('parentResult');\n  }\n\n  getHelperParams(): string {\n    return ', parentResult: Map<string, Value>';\n  }\n\n  getHelperArgs(): string {\n    return `, ${this.dollarVar}`;\n  }\n}\n\n/**\n * Scoped context resolver: identifiers resolve from a scoped context variable.\n * Used for inputField scoping and loop mode where a subset of the context is available.\n */\nexport class ScopedContextResolver implements ContextResolver {\n  constructor(\n    private ctxVar: string = 'scopedCtx',\n    private resultVar: string = 'itemResult',\n  ) {}\n\n  resolveIdentifier(name: string): string {\n    return `${this.ctxVar}.get(\"${name}\")`;\n  }\n\n  resolveDollarRef(): string {\n    return `Value.Object(${this.resultVar})`;\n  }\n\n  resolveHashRef(): string {\n    return `${this.ctxVar}.get(\"#\")`;\n  }\n\n  resolveDollarPath(path: string): string {\n    // $.foo looks up \"foo\" in the local result variable\n    return `(${this.resultVar}.has(\"${path}\") ? ${this.resultVar}.get(\"${path}\") : Value.Null())`;\n  }\n\n  resolveNodesPath(path: string): string {\n    return `${this.ctxVar}.get(\"${path}\")`;\n  }\n\n  getContextVar(): string {\n    return this.ctxVar;\n  }\n\n  createChildResolver(): ContextResolver {\n    // In scoped context, child keeps the same context var and result var\n    return this;\n  }\n\n  getHelperParams(): string {\n    return `, ${this.ctxVar}: Context, ${this.resultVar}: Map<string, Value>`;\n  }\n\n  getHelperArgs(): string {\n    return `, ${this.ctxVar}, ${this.resultVar}`;\n  }\n}\n","// ============================================================================\n// Expression AST Compiler\n// ============================================================================\n//\n// This module provides the core expression compilation functionality for\n// transforming expression ASTs into AssemblyScript code. It uses the\n// ContextResolver strategy pattern to handle different compilation contexts.\n\nimport type {\n  ExpressionAST,\n  BinaryOp,\n  UnaryOp,\n  NumberLiteral,\n  StringLiteral,\n  BooleanLiteral,\n  Identifier,\n  TernaryOp,\n  MemberAccess,\n  IndexAccess,\n  FunctionCall,\n  Interval,\n  TemplateLiteral,\n  ArrayLiteral,\n  ObjectLiteral,\n} from '../ast-types';\nimport type { CompilationContext } from '../types';\nimport type { ContextResolver } from './context-resolvers';\nimport { StandardContextResolver } from './context-resolvers';\n\n// ============================================================================\n// Unified Expression Compiler\n// ============================================================================\n\n/**\n * Compile an expression AST using the provided context resolver strategy.\n *\n * This is the single unified implementation that handles all expression compilation.\n * The resolver parameter determines how identifiers, $, and # are resolved.\n *\n * @param ast - The AST node to compile\n * @param context - The compilation context\n * @param resolver - The context resolution strategy\n * @returns AssemblyScript code string that produces a Value\n */\nexport function compileExpressionUnified(\n  ast: ExpressionAST,\n  context: CompilationContext,\n  resolver: ContextResolver,\n): string {\n  switch (ast.type) {\n    case 'NumberLiteral':\n      return `Value.Float(${(ast as NumberLiteral).value})`;\n\n    case 'StringLiteral':\n      return `Value.String(\"${escapeString((ast as StringLiteral).value)}\")`;\n\n    case 'BooleanLiteral':\n      return `Value.Bool(${(ast as BooleanLiteral).value})`;\n\n    case 'NullLiteral':\n      return `Value.Null()`;\n\n    case 'Identifier':\n      return resolver.resolveIdentifier((ast as Identifier).name);\n\n    case 'DollarRef':\n      return resolver.resolveDollarRef();\n\n    case 'HashRef':\n      return resolver.resolveHashRef();\n\n    case 'BinaryOp': {\n      const bop = ast as BinaryOp;\n      const left = compileExpressionUnified(bop.left, context, resolver);\n      const right = compileExpressionUnified(bop.right, context, resolver);\n      return compileBinaryOpWithValues(bop.op, left, right);\n    }\n\n    case 'UnaryOp': {\n      const uop = ast as UnaryOp;\n      const operand = compileExpressionUnified(uop.operand, context, resolver);\n      switch (uop.op) {\n        case 'not':\n          return `Value.Bool(!(${operand}).asBool())`;\n        case '-':\n          return `negateValue(${operand})`;\n        default:\n          throw new Error(`Unknown unary operator: ${uop.op}`);\n      }\n    }\n\n    case 'TernaryOp': {\n      const top = ast as TernaryOp;\n      const cond = compileExpressionUnified(top.condition, context, resolver);\n      const cons = compileExpressionUnified(top.consequent, context, resolver);\n      const alt = compileExpressionUnified(top.alternate, context, resolver);\n      return `(${cond}.asBool() ? ${cons} : ${alt})`;\n    }\n\n    case 'MemberAccess': {\n      const ma = ast as MemberAccess;\n      // Handle $.property.subproperty - look up in appropriate context\n      const dollarPath = buildDollarPath(ma);\n      if (dollarPath) {\n        return resolver.resolveDollarPath(dollarPath);\n      }\n      // Check if this is a $nodes reference\n      if (checkIsNodesReference(ma)) {\n        const nodesPath = buildNodesPath(ma);\n        return resolver.resolveNodesPath(nodesPath);\n      }\n      // For other member access, use getProperty helper\n      const obj = compileExpressionUnified(ma.object, context, resolver);\n      return `getProperty(${obj}, \"${ma.property}\")`;\n    }\n\n    case 'IndexAccess': {\n      const ia = ast as IndexAccess;\n      const arr = compileExpressionUnified(ia.object, context, resolver);\n      const idx = compileExpressionUnified(ia.index, context, resolver);\n      return `getIndex(${arr}, ${idx})`;\n    }\n\n    case 'FunctionCall': {\n      const fc = ast as FunctionCall;\n      if (fc.callee.type === 'Identifier') {\n        const name = (fc.callee as Identifier).name;\n\n        // Higher-order functions need special handling\n        if (name === 'filter') {\n          return compileHigherOrderCall(fc, context, resolver, 'filter');\n        }\n        if (name === 'map') {\n          return compileHigherOrderCall(fc, context, resolver, 'map');\n        }\n        if (name === 'reduce') {\n          return compileHigherOrderCall(fc, context, resolver, 'reduce');\n        }\n        if (name === 'all') {\n          return compileHigherOrderCall(fc, context, resolver, 'all');\n        }\n        if (name === 'some') {\n          return compileHigherOrderCall(fc, context, resolver, 'some');\n        }\n\n        // Regular function call\n        const args = fc.args.map((arg) => compileExpressionUnified(arg, context, resolver));\n        const numArgs = args.length;\n\n        // AssemblyScript requires typed array constructors\n        if (numArgs === 1) {\n          return `evaluateFunction(\"${name}\", makeArgs1(${args[0]}))`;\n        } else if (numArgs === 2) {\n          return `evaluateFunction(\"${name}\", makeArgs2(${args[0]}, ${args[1]}))`;\n        } else if (numArgs === 3) {\n          return `evaluateFunction(\"${name}\", makeArgs3(${args[0]}, ${args[1]}, ${args[2]}))`;\n        } else {\n          return `evaluateFunction(\"${name}\", [${args.join(', ')}])`;\n        }\n      }\n      throw new Error('Only direct function calls are supported');\n    }\n\n    case 'Interval': {\n      const intv = ast as Interval;\n      const start = compileExpressionUnified(intv.start, context, resolver);\n      const end = compileExpressionUnified(intv.end, context, resolver);\n      return `createInterval(${start}, ${end}, ${intv.startInclusive}, ${intv.endInclusive})`;\n    }\n\n    case 'ArrayLiteral': {\n      const al = ast as ArrayLiteral;\n      if (al.elements.length === 0) {\n        return 'Value.Array(new Array<Value>(0))';\n      }\n      const elements = al.elements.map((e) => compileExpressionUnified(e, context, resolver));\n      return `Value.Array([${elements.join(', ')}])`;\n    }\n\n    case 'ObjectLiteral': {\n      const ol = ast as ObjectLiteral;\n      if (ol.properties.length === 0) {\n        return 'Value.Object(new Map<string, Value>())';\n      }\n      // Generate a helper function for object construction\n      const childResolver = resolver.createChildResolver();\n      const helperId = context.getUniqueId('object');\n      const props = ol.properties.map((p) => {\n        const value = compileExpressionUnified(p.value, context, childResolver);\n        return `  objResult.set(\"${p.key}\", ${value});`;\n      });\n\n      const helperCode = `\nfunction objectHelper_${helperId}(ctx: Context${resolver.getHelperParams()}): Value {\n  const objResult = new Map<string, Value>();\n${props.join('\\n')}\n  return Value.Object(objResult);\n}`;\n      context.helperFunctions.set(`objectHelper_${helperId}`, helperCode);\n      return `objectHelper_${helperId}(ctx${resolver.getHelperArgs()})`;\n    }\n\n    case 'TemplateLiteral': {\n      const tl = ast as TemplateLiteral;\n      const parts = tl.parts.map((part) => {\n        if ('text' in part) {\n          return `\"${escapeString(part.text)}\"`;\n        } else {\n          return `(${compileExpressionUnified(part.expr, context, resolver)}).asString()`;\n        }\n      });\n      if (parts.length === 0) {\n        return 'Value.String(\"\")';\n      }\n      if (parts.length === 1) {\n        return `Value.String(${parts[0]})`;\n      }\n      return `Value.String(${parts.join(' + ')})`;\n    }\n\n    default:\n      throw new Error(`Unsupported expression type: ${(ast as any).type}`);\n  }\n}\n\n// ============================================================================\n// Higher-Order Function Compilation\n// ============================================================================\n\n/**\n * Compile a higher-order function call (filter, map, reduce, all, some).\n *\n * These functions iterate over arrays and need helper functions that set # for each element.\n * The resolver's child resolver is used inside the helper to maintain proper scoping.\n */\nfunction compileHigherOrderCall(\n  ast: FunctionCall,\n  context: CompilationContext,\n  resolver: ContextResolver,\n  fnName: 'filter' | 'map' | 'reduce' | 'all' | 'some',\n): string {\n  const expectedArgs = fnName === 'reduce' ? 3 : 2;\n  if (ast.args.length !== expectedArgs) {\n    throw new Error(\n      `${fnName}() requires exactly ${expectedArgs} arguments, got ${ast.args.length}`,\n    );\n  }\n\n  const arrayExpr = ast.args[0];\n  const lambdaExpr = ast.args[1];\n\n  // Compile array expression with current resolver\n  const arrayCode = compileExpressionUnified(arrayExpr, context, resolver);\n\n  // Use child resolver for lambda (maintains access to outer scope)\n  const childResolver = resolver.createChildResolver();\n  const lambdaCode = compileExpressionUnified(lambdaExpr, context, childResolver);\n\n  const helperId = context.getUniqueId(fnName);\n  const extraParams = resolver.getHelperParams();\n  const extraArgs = resolver.getHelperArgs();\n\n  let helperCode: string;\n\n  switch (fnName) {\n    case 'filter':\n      helperCode = `\nfunction filterHelper_${helperId}(ctx: Context, arr: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return Value.Array(new Array<Value>(0));\n  }\n\n  const inputArr = arr.asArray();\n  const filterResult = new Array<Value>(0);\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    if (${lambdaCode}.asBool()) {\n      filterResult.push(element);\n    }\n  }\n\n  return Value.Array(filterResult);\n}`;\n      break;\n\n    case 'map':\n      helperCode = `\nfunction mapHelper_${helperId}(ctx: Context, arr: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return Value.Array(new Array<Value>(0));\n  }\n\n  const inputArr = arr.asArray();\n  const mapResult = new Array<Value>(0);\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    mapResult.push(${lambdaCode});\n  }\n\n  return Value.Array(mapResult);\n}`;\n      break;\n\n    case 'reduce': {\n      const initialExpr = ast.args[2];\n      const initialCode = compileExpressionUnified(initialExpr, context, resolver);\n      helperCode = `\nfunction reduceHelper_${helperId}(ctx: Context, arr: Value, initAcc: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return initAcc;\n  }\n\n  const inputArr = arr.asArray();\n  let reduceAcc = initAcc;\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    ctx.set(\"acc\", reduceAcc);\n    reduceAcc = ${lambdaCode};\n  }\n\n  return reduceAcc;\n}`;\n      context.helperFunctions.set(`reduceHelper_${helperId}`, helperCode);\n      return `reduceHelper_${helperId}(ctx, ${arrayCode}, ${initialCode}${extraArgs})`;\n    }\n\n    case 'all':\n      helperCode = `\nfunction allHelper_${helperId}(ctx: Context, arr: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return Value.Bool(false);\n  }\n\n  const inputArr = arr.asArray();\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    if (!${lambdaCode}.asBool()) {\n      return Value.Bool(false);\n    }\n  }\n\n  return Value.Bool(true);\n}`;\n      break;\n\n    case 'some':\n      helperCode = `\nfunction someHelper_${helperId}(ctx: Context, arr: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return Value.Bool(false);\n  }\n\n  const inputArr = arr.asArray();\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    if (${lambdaCode}.asBool()) {\n      return Value.Bool(true);\n    }\n  }\n\n  return Value.Bool(false);\n}`;\n      break;\n  }\n\n  context.helperFunctions.set(`${fnName}Helper_${helperId}`, helperCode);\n  return `${fnName}Helper_${helperId}(ctx, ${arrayCode}${extraArgs})`;\n}\n\n// ============================================================================\n// Binary Operator Compilation\n// ============================================================================\n\n/**\n * Helper to compile binary operations with pre-compiled left and right values.\n * This is the single source of truth for all binary operator code generation.\n *\n * @param op - The operator string (e.g., \"+\", \"-\", \"==\", \"and\", etc.)\n * @param left - Pre-compiled code string for the left operand\n * @param right - Pre-compiled code string for the right operand\n * @returns AssemblyScript code string for the binary operation\n */\nexport function compileBinaryOpWithValues(op: string, left: string, right: string): string {\n  switch (op) {\n    // Arithmetic\n    case '+':\n      return `addValues(${left}, ${right})`;\n    case '-':\n      return `subtractValues(${left}, ${right})`;\n    case '*':\n      return `multiplyValues(${left}, ${right})`;\n    case '/':\n      return `divideValues(${left}, ${right})`;\n    case '%':\n      return `moduloValues(${left}, ${right})`;\n    case '^':\n      return `powerValues(${left}, ${right})`;\n\n    // Comparison\n    case '==':\n      return `Value.Bool(valuesEqual(${left}, ${right}))`;\n    case '!=':\n      return `Value.Bool(!valuesEqual(${left}, ${right}))`;\n    case '<':\n      return `Value.Bool(compareValues(${left}, ${right}) < 0)`;\n    case '>':\n      return `Value.Bool(compareValues(${left}, ${right}) > 0)`;\n    case '<=':\n      return `Value.Bool(compareValues(${left}, ${right}) <= 0)`;\n    case '>=':\n      return `Value.Bool(compareValues(${left}, ${right}) >= 0)`;\n\n    // Logical\n    case 'and':\n      return `((${left}).asBool() ? (${right}) : (${left}))`;\n    case 'or':\n      return `((${left}).asBool() ? (${left}) : (${right}))`;\n\n    // Null coalescing\n    case '??':\n      return `(${left}.isNull() ? ${right} : ${left})`;\n\n    // Membership\n    case 'in':\n      return `valueIn(${left}, ${right})`;\n    case 'not in':\n      return `Value.Bool(!valueIn(${left}, ${right}).asBool())`;\n\n    default:\n      throw new Error(`Unknown binary operator: ${op}`);\n  }\n}\n\n// ============================================================================\n// Utility Functions\n// ============================================================================\n\n/**\n * Escape a string for use in AssemblyScript string literals.\n */\nexport function escapeString(s: string): string {\n  return s\n    .replace(/\\\\/g, '\\\\\\\\')\n    .replace(/\"/g, '\\\\\"')\n    .replace(/\\n/g, '\\\\n')\n    .replace(/\\r/g, '\\\\r')\n    .replace(/\\t/g, '\\\\t');\n}\n\n/**\n * Build the full dotted path for a $-rooted member access chain.\n * Returns null if the path is not rooted at $.\n *\n * Example: $.eligibility.specialOffers -> \"eligibility.specialOffers\"\n */\nexport function buildDollarPath(ast: MemberAccess): string | null {\n  if (ast.object.type === 'DollarRef') {\n    return ast.property;\n  }\n  if (ast.object.type === 'MemberAccess') {\n    const parentPath = buildDollarPath(ast.object as MemberAccess);\n    if (parentPath !== null) {\n      return `${parentPath}.${ast.property}`;\n    }\n  }\n  return null;\n}\n\n/**\n * Check if a member access chain is rooted at the '$nodes' identifier.\n */\nexport function checkIsNodesReference(ast: MemberAccess): boolean {\n  if (ast.object.type === 'Identifier') {\n    return (ast.object as Identifier).name === '$nodes';\n  } else if (ast.object.type === 'MemberAccess') {\n    return checkIsNodesReference(ast.object as MemberAccess);\n  }\n  return false;\n}\n\n/**\n * Build the full dotted path for a $nodes-rooted member access chain.\n */\nexport function buildNodesPath(ast: MemberAccess): string {\n  if (ast.object.type === 'Identifier') {\n    return `${(ast.object as Identifier).name}.${ast.property}`;\n  } else if (ast.object.type === 'MemberAccess') {\n    return `${buildNodesPath(ast.object as MemberAccess)}.${ast.property}`;\n  }\n  throw new Error('Invalid object type for $nodes reference');\n}\n\n// ============================================================================\n// Convenience Functions\n// ============================================================================\n\n// Singleton instance for standard context compilation\nconst standardResolver = new StandardContextResolver();\n\n/**\n * Compile an AST node to AssemblyScript code using standard context resolution.\n *\n * This is a convenience function that uses StandardContextResolver, where:\n * - $ references resolve to ctx.get(\"$\")\n * - Identifiers resolve to ctx.get(\"name\")\n *\n * For specialized compilation contexts (expression nodes with local $, scoped contexts),\n * use compileExpressionUnified directly with the appropriate resolver.\n *\n * @param ast - The AST node to compile\n * @param context - The compilation context\n * @returns AssemblyScript code string that produces a Value\n */\nexport function compileExpression(ast: ExpressionAST, context: CompilationContext): string {\n  return compileExpressionUnified(ast, context, standardResolver);\n}\n","// ============================================================================\n// Expression Node Compilation\n// ============================================================================\n//\n// This module provides compilation functionality for JDM expression nodes.\n// Expression nodes contain key-value pairs where values are expression strings.\n//\n// For the core expression AST compilation, see expression-compiler.ts.\n// For context resolution strategies, see context-resolvers.ts.\n\nimport type { CompilationContext, AssemblyScriptCode } from '../types';\nimport type { JDMNode } from '../parser';\nimport { sanitizeId } from '../utils';\nimport { LocalDollarContextResolver, ScopedContextResolver } from './context-resolvers';\nimport { compileExpressionUnified } from './expression-compiler';\n\n// Re-export commonly used items for backwards compatibility\nexport type { ContextResolver } from './context-resolvers';\nexport {\n  StandardContextResolver,\n  LocalDollarContextResolver,\n  ScopedContextResolver,\n} from './context-resolvers';\n\nexport {\n  compileExpressionUnified,\n  compileBinaryOpWithValues,\n  compileExpression,\n  escapeString,\n  buildDollarPath,\n  checkIsNodesReference,\n  buildNodesPath,\n} from './expression-compiler';\n\n/**\n * Compile an expression node.\n *\n * Expression nodes can contain one or more key-value pairs where\n * each value is an expression string that needs to be compiled.\n *\n * In expression nodes, the $ symbol refers to the local result object\n * being built, allowing later expressions to reference earlier ones.\n * For example: { \"a\": \"5\", \"b\": \"$.a + 10\" } - $.a references the 'a' computed above.\n *\n * Additional features:\n * - inputField: Specifies a sub-object path to use as the evaluation scope\n * - outputPath: Specifies the context path where the results will be stored\n * - executionMode: \"loop\" - Iterates over an array at inputField path\n *\n * @param node - The JDM expression node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileExpressionNode(\n  node: JDMNode,\n  context: CompilationContext,\n): AssemblyScriptCode {\n  const expressions = node.content.expressions as Array<{ key: string; value: string }>;\n  const passThrough = node.content.passThrough === true;\n  const inputField = node.content.inputField as string | undefined;\n  const outputPath = node.content.outputPath as string | undefined;\n  const executionMode = node.content.executionMode as string | undefined;\n  const sanitizedId = sanitizeId(node.id);\n\n  // Loop mode: iterates over array at inputField, evaluating expressions for each element\n  // Used when executionMode === \"loop\" to transform array items in place\n  if (executionMode === 'loop') {\n    return compileLoopExpressionNode(\n      node,\n      context,\n      expressions,\n      passThrough,\n      inputField,\n      outputPath,\n      sanitizedId,\n    );\n  }\n\n  // If inputField is specified, generate scoped evaluation code\n  if (inputField) {\n    return compileScopedExpressionNode(\n      node,\n      context,\n      expressions,\n      passThrough,\n      inputField,\n      outputPath,\n      sanitizedId,\n    );\n  }\n\n  // Standard mode: evaluates expressions in global context without inputField scoping\n  // Used when no inputField is specified - expressions resolve variables from root context\n  const resolver = new LocalDollarContextResolver('result');\n  const expressionAssignments = expressions\n    .map((expr) => {\n      try {\n        const ast = context.parseExpression(expr.value);\n        // Compile with $ resolved to local result variable using unified compiler\n        const compiled = compileExpressionUnified(ast, context, resolver);\n        return `  result.set(\"${expr.key}\", ${compiled});`;\n      } catch (e) {\n        throw new Error(`Failed to compile expression \"${expr.value}\" for key \"${expr.key}\": ${e}`);\n      }\n    })\n    .join('\\n');\n\n  if (passThrough) {\n    return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Copy all context values to preserve workflow state and allow referencing prior node results\n  // passThrough=true ensures downstream nodes can access both input data and intermediate results\n  const keys = ctx.data.keys();\n  for (let i = 0; i < keys.length; i++) {\n    const key = keys[i];\n    const value = ctx.data.get(key);\n    result.set(key, value);\n  }\n\n${expressionAssignments}\n\n  return Value.Object(result);\n}\n`;\n  }\n\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n  \n${expressionAssignments}\n  \n  return Value.Object(result);\n}\n`;\n}\n\n/**\n * Compile an expression node with inputField scoping.\n *\n * When inputField is specified (e.g., \"customer\"), expressions are evaluated\n * with the sub-object as the scope. So `firstName` resolves to `customer.firstName`.\n *\n * @param node - The JDM expression node\n * @param context - The compilation context\n * @param expressions - Array of key-value expression pairs\n * @param passThrough - Whether to pass through context values\n * @param inputField - The path to the input field (e.g., \"customer\")\n * @param outputPath - The path to store the output (e.g., \"customer\")\n * @param sanitizedId - Sanitized node ID\n * @returns Generated AssemblyScript code\n */\nfunction compileScopedExpressionNode(\n  node: JDMNode,\n  context: CompilationContext,\n  expressions: Array<{ key: string; value: string }>,\n  passThrough: boolean,\n  inputField: string,\n  outputPath: string | undefined,\n  sanitizedId: string,\n): AssemblyScriptCode {\n  // Generate unique helper to avoid name collisions in multi-node compilation\n  const helperId = context.getUniqueId('scopedExpr');\n\n  // Scoped evaluation: creates a temporary context where inputField object properties become top-level identifiers\n  // Enables expressions like \"firstName\" to resolve to \"customer.firstName\" when inputField=\"customer\"\n  const resolver = new ScopedContextResolver('scopedCtx', 'itemResult');\n  const expressionAssignments = expressions\n    .map((expr) => {\n      try {\n        const ast = context.parseExpression(expr.value);\n        // Use unified compiler with scoped context resolver\n        const compiled = compileExpressionUnified(ast, context, resolver);\n        return `    itemResult.set(\"${expr.key}\", ${compiled});`;\n      } catch (e) {\n        throw new Error(`Failed to compile expression \"${expr.value}\" for key \"${expr.key}\": ${e}`);\n      }\n    })\n    .join('\\n');\n\n  // Generate the helper function for scoped evaluation\n  // Can't use Context constructor directly - AssemblyScript Context requires specific initialization\n  // that's tied to the WASM module's memory management, so we use ScopedContext wrapper instead\n  const helperCode = `\nfunction scopedExprHelper_${helperId}(ctx: Context, inputObj: Value): Value {\n  // Build result starting with input object fields (for passThrough behavior)\n  const itemResult = new Map<string, Value>();\n  if (inputObj.isObject()) {\n    const inputMap = inputObj.asObject();\n    const inputKeys = inputMap.keys();\n    for (let i = 0; i < inputKeys.length; i++) {\n      const key = inputKeys[i];\n      itemResult.set(key, inputMap.get(key));\n    }\n  }\n  \n  // Two-layer context enables variable shadowing: inputField properties take precedence over parent context\n  // Allows \"status\" in inputField to shadow global \"status\" while preserving access to non-shadowed globals\n  const scopedData = new Map<string, Value>();\n  \n  // Copy parent context data first\n  const parentKeys = ctx.data.keys();\n  for (let i = 0; i < parentKeys.length; i++) {\n    const key = parentKeys[i];\n    scopedData.set(key, ctx.data.get(key));\n  }\n  \n  // Override with fields from the input object (inputField scope)\n  if (inputObj.isObject()) {\n    const inputMap = inputObj.asObject();\n    const inputKeys = inputMap.keys();\n    for (let i = 0; i < inputKeys.length; i++) {\n      const key = inputKeys[i];\n      scopedData.set(key, inputMap.get(key));\n    }\n  }\n  \n  // Create a scoped context wrapper for expression evaluation\n  const scopedCtx = new ScopedContext(scopedData);\n  \n  // Evaluate expressions in the scoped context\n${expressionAssignments}\n  \n  return Value.Object(itemResult);\n}`;\n\n  context.helperFunctions.set(`scopedExprHelper_${helperId}`, helperCode);\n\n  // Generate the main function that extracts inputField and calls the helper\n  if (passThrough) {\n    return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Pass through all context values (input + intermediate results)\n  const keys = ctx.data.keys();\n  for (let i = 0; i < keys.length; i++) {\n    const key = keys[i];\n    const value = ctx.data.get(key);\n    result.set(key, value);\n  }\n\n  // Get input object from inputField path: ${inputField}\n  const inputObj = ctx.get(\"${inputField}\");\n  \n  // Evaluate expressions in scoped context and store at outputPath: ${outputPath || inputField}\n  const scopedResult = scopedExprHelper_${helperId}(ctx, inputObj);\n  result.set(\"${outputPath || inputField}\", scopedResult);\n\n  return Value.Object(result);\n}\n`;\n  }\n\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Get input object from inputField path: ${inputField}\n  const inputObj = ctx.get(\"${inputField}\");\n  \n  // Evaluate expressions in scoped context and store at outputPath: ${outputPath || inputField}\n  const scopedResult = scopedExprHelper_${helperId}(ctx, inputObj);\n  result.set(\"${outputPath || inputField}\", scopedResult);\n\n  return Value.Object(result);\n}\n`;\n}\n\n/**\n * Compile an expression node with executionMode: \"loop\".\n *\n * When executionMode is \"loop\", expressions are evaluated for each item\n * in the array at inputField path. Each item gets the computed fields added.\n *\n * @param node - The JDM expression node\n * @param context - The compilation context\n * @param expressions - Array of key-value expression pairs\n * @param passThrough - Whether to pass through context values\n * @param inputField - The path to the input array (e.g., \"cart.items\")\n * @param outputPath - The path to store the output array (e.g., \"cart.items\")\n * @param sanitizedId - Sanitized node ID\n * @returns Generated AssemblyScript code\n */\nfunction compileLoopExpressionNode(\n  node: JDMNode,\n  context: CompilationContext,\n  expressions: Array<{ key: string; value: string }>,\n  passThrough: boolean,\n  inputField: string | undefined,\n  outputPath: string | undefined,\n  sanitizedId: string,\n): AssemblyScriptCode {\n  if (!inputField) {\n    throw new Error(`executionMode: \"loop\" requires inputField to be specified`);\n  }\n\n  // Generate a unique helper function for loop evaluation\n  const helperId = context.getUniqueId('loopExpr');\n\n  // Each iteration gets its own scoped context to isolate variables and prevent data leakage between iterations\n  // Ensures expressions like \"price * quantity\" use current item's values, not previous iteration's\n  const resolver = new ScopedContextResolver('itemCtx', 'itemResult');\n  const expressionAssignments = expressions\n    .map((expr) => {\n      try {\n        const ast = context.parseExpression(expr.value);\n        // Use unified compiler with scoped context resolver for array item\n        const compiled = compileExpressionUnified(ast, context, resolver);\n        return `      itemResult.set(\"${expr.key}\", ${compiled});`;\n      } catch (e) {\n        throw new Error(`Failed to compile expression \"${expr.value}\" for key \"${expr.key}\": ${e}`);\n      }\n    })\n    .join('\\n');\n\n  // Generate the helper function for loop evaluation\n  const helperCode = `\nfunction loopExprHelper_${helperId}(ctx: Context, inputArr: Value): Value {\n  if (!inputArr.isArray()) {\n    return Value.Array(new Array<Value>(0));\n  }\n  \n  const items = inputArr.asArray();\n  const resultItems = new Array<Value>(0);\n  \n  for (let i = 0; i < items.length; i++) {\n    const item = items[i];\n    \n    // Build result item starting with existing fields\n    const itemResult = new Map<string, Value>();\n    if (item.isObject()) {\n      const itemMap = item.asObject();\n      const itemKeys = itemMap.keys();\n      for (let j = 0; j < itemKeys.length; j++) {\n        const key = itemKeys[j];\n        itemResult.set(key, itemMap.get(key));\n      }\n    }\n    \n    // Create a scoped data map that combines parent context with item fields\n    const scopedData = new Map<string, Value>();\n    \n    // Copy parent context data first\n    const parentKeys = ctx.data.keys();\n    for (let j = 0; j < parentKeys.length; j++) {\n      const key = parentKeys[j];\n      scopedData.set(key, ctx.data.get(key));\n    }\n    \n    // Override with fields from the current item\n    if (item.isObject()) {\n      const itemMap = item.asObject();\n      const itemKeys = itemMap.keys();\n      for (let j = 0; j < itemKeys.length; j++) {\n        const key = itemKeys[j];\n        scopedData.set(key, itemMap.get(key));\n      }\n    }\n    \n    // Create a scoped context for expression evaluation\n    const itemCtx = new ScopedContext(scopedData);\n    \n    // Evaluate expressions for this item\n${expressionAssignments}\n    \n    resultItems.push(Value.Object(itemResult));\n  }\n  \n  return Value.Array(resultItems);\n}`;\n\n  context.helperFunctions.set(`loopExprHelper_${helperId}`, helperCode);\n\n  // Determine output path - use outputPath if specified, otherwise inputField\n  const effectiveOutputPath = outputPath || inputField;\n\n  // Generate the main function that extracts inputField array and calls the helper\n  if (passThrough) {\n    return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Pass through all context values (input + intermediate results)\n  const keys = ctx.data.keys();\n  for (let i = 0; i < keys.length; i++) {\n    const key = keys[i];\n    const value = ctx.data.get(key);\n    result.set(key, value);\n  }\n\n  // Get input array from inputField path: ${inputField}\n  const inputArr = ctx.get(\"${inputField}\");\n  \n  // Evaluate expressions for each item in the array\n  const loopResult = loopExprHelper_${helperId}(ctx, inputArr);\n  \n  // Store result at outputPath: ${effectiveOutputPath}\n  result.set(\"${effectiveOutputPath}\", loopResult);\n\n  return Value.Object(result);\n}\n`;\n  }\n\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Get input array from inputField path: ${inputField}\n  const inputArr = ctx.get(\"${inputField}\");\n  \n  // Evaluate expressions for each item in the array\n  const loopResult = loopExprHelper_${helperId}(ctx, inputArr);\n  \n  // Store result at outputPath: ${effectiveOutputPath}\n  result.set(\"${effectiveOutputPath}\", loopResult);\n\n  return Value.Object(result);\n}\n`;\n}\n","/**\n * Unary expression transformation utilities for decision table compilation.\n *\n * In decision tables, expressions are evaluated in a \"unary\" context where\n * the $ symbol is automatically bound to the input field's value. Since\n * AssemblyScript doesn't support closures, we transform the AST to replace\n * DollarRef nodes with pre-compiled code.\n *\n * This module provides:\n * - InlineCode: A marker type for pre-compiled code in ASTs\n * - replaceDollarRefWithCode: AST transformer for dollar reference substitution\n * - compileExpressionWithInlineCode: Compiler that handles InlineCode nodes\n */\n\nimport type { CompilationContext } from './types';\nimport { compileExpression, compileBinaryOpWithValues } from './nodes/expression';\n\n/**\n * Special marker type for inline code that should be inserted directly.\n *\n * Used when AST transformation requires embedding already-compiled code.\n * For example, when compiling \"$ > 100\" where $ refers to a field value,\n * we replace the DollarRef node with an InlineCode node containing the\n * pre-compiled field access code.\n */\nexport interface InlineCode {\n  type: 'InlineCode';\n  code: string;\n}\n\n/**\n * Recursively replace DollarRef nodes in an AST with InlineCode nodes\n * containing the pre-compiled field expression.\n *\n * This transformation enables unary expression compilation in AssemblyScript\n * by substituting $ references with actual field access code at compile time.\n *\n * @param ast - The AST node to transform\n * @param compiledField - The pre-compiled code for the field value\n * @returns The transformed AST with InlineCode nodes instead of DollarRef\n *\n * @example\n * // Original AST for \"$ > 100\":\n * // { type: \"BinaryOp\", op: \">\", left: { type: \"DollarRef\" }, right: { type: \"NumberLiteral\", value: 100 } }\n * //\n * // After transformation with compiledField = 'ctx.get(\"creditScore\")':\n * // { type: \"BinaryOp\", op: \">\", left: { type: \"InlineCode\", code: 'ctx.get(\"creditScore\")' }, right: { type: \"NumberLiteral\", value: 100 } }\n */\nexport function replaceDollarRefWithCode(ast: any, compiledField: string): any {\n  if (!ast || typeof ast !== 'object') {\n    return ast;\n  }\n\n  // If this is a DollarRef, replace it with InlineCode containing the compiled field\n  if (ast.type === 'DollarRef') {\n    return { type: 'InlineCode', code: compiledField } as InlineCode;\n  }\n\n  // Recursively transform child nodes\n  const result: any = { type: ast.type };\n\n  for (const key of Object.keys(ast)) {\n    if (key === 'type') {\n      continue;\n    }\n\n    const value = ast[key];\n    if (Array.isArray(value)) {\n      result[key] = value.map((item) => replaceDollarRefWithCode(item, compiledField));\n    } else if (value && typeof value === 'object') {\n      result[key] = replaceDollarRefWithCode(value, compiledField);\n    } else {\n      result[key] = value;\n    }\n  }\n\n  return result;\n}\n\n/**\n * Compile an AST that may contain InlineCode nodes.\n *\n * This compiler extends the standard expression compiler to handle InlineCode\n * nodes, which contain pre-compiled code that should be inserted directly.\n * It's used after replaceDollarRefWithCode to compile the transformed AST.\n *\n * @param ast - The AST node to compile (may contain InlineCode nodes)\n * @param context - The compilation context\n * @returns Compiled AssemblyScript code string\n */\nexport function compileExpressionWithInlineCode(ast: any, context: CompilationContext): string {\n  // Handle InlineCode nodes specially - just return the pre-compiled code\n  if (ast.type === 'InlineCode') {\n    return (ast as InlineCode).code;\n  }\n\n  // For nodes with binary operations\n  if (ast.type === 'BinaryOp') {\n    const left = compileExpressionWithInlineCode(ast.left, context);\n    const right = compileExpressionWithInlineCode(ast.right, context);\n    return compileBinaryOpWithValues(ast.op, left, right);\n  }\n\n  // For unary operations\n  if (ast.type === 'UnaryOp') {\n    const operand = compileExpressionWithInlineCode(ast.operand, context);\n    switch (ast.op) {\n      case 'not':\n        return `Value.Bool(!(${operand}).asBool())`;\n      case '-':\n        return `negateValue(${operand})`;\n      default:\n        throw new Error(`Unknown unary operator: ${ast.op}`);\n    }\n  }\n\n  // For function calls, compile args recursively to handle InlineCode\n  if (ast.type === 'FunctionCall') {\n    const callee = ast.callee;\n    if (callee.type === 'Identifier') {\n      const args = ast.args.map((arg: any) => compileExpressionWithInlineCode(arg, context));\n      const numArgs = args.length;\n\n      // Use helper functions to create argument arrays\n      if (numArgs === 1) {\n        return `evaluateFunction(\"${callee.name}\", makeArgs1(${args[0]}))`;\n      } else if (numArgs === 2) {\n        return `evaluateFunction(\"${callee.name}\", makeArgs2(${args[0]}, ${args[1]}))`;\n      } else if (numArgs === 3) {\n        return `evaluateFunction(\"${callee.name}\", makeArgs3(${args[0]}, ${args[1]}, ${args[2]}))`;\n      } else {\n        return `evaluateFunction(\"${callee.name}\", [${args.join(', ')}])`;\n      }\n    }\n    throw new Error('Only direct function calls are supported');\n  }\n\n  // For member access\n  if (ast.type === 'MemberAccess') {\n    const obj = compileExpressionWithInlineCode(ast.object, context);\n    return `getProperty(${obj}, \"${ast.property}\")`;\n  }\n\n  // For index access\n  if (ast.type === 'IndexAccess') {\n    const obj = compileExpressionWithInlineCode(ast.object, context);\n    const idx = compileExpressionWithInlineCode(ast.index, context);\n    return `getIndex(${obj}, ${idx})`;\n  }\n\n  // For ternary operations\n  if (ast.type === 'TernaryOp') {\n    const cond = compileExpressionWithInlineCode(ast.condition, context);\n    const cons = compileExpressionWithInlineCode(ast.consequent, context);\n    const alt = compileExpressionWithInlineCode(ast.alternate, context);\n    return `(${cond}.asBool() ? ${cons} : ${alt})`;\n  }\n\n  // For other node types, delegate to standard compileExpression\n  return compileExpression(ast, context);\n}\n","import type { JDMNode } from '../parser';\nimport type { CompilationContext, AssemblyScriptCode, NoMatchBehavior } from '../types';\nimport { sanitizeId } from '../utils';\nimport { compileExpression } from './expression';\nimport { replaceDollarRefWithCode, compileExpressionWithInlineCode } from '../unary-transform';\n\n/**\n * Decision table content structure.\n */\ninterface DecisionTableContent {\n  rules: any[];\n  inputs: any[];\n  outputs: any[];\n  hitPolicy: 'first' | 'collect' | 'unique' | 'ruleOrder' | 'outputOrder' | 'priority';\n  /** Override the global no-match behavior for this table */\n  noMatchBehavior?: NoMatchBehavior;\n  /** Whether to pass through input values to output */\n  passThrough?: boolean;\n}\n\n/**\n * Compile a comparison expression for a decision table condition.\n *\n * In decision tables, expressions are evaluated in a \"unary\" context where\n * the $ symbol is automatically bound to the input field's value.\n *\n * For example:\n * - \"> 100\" becomes \"$ > 100\" with $ bound to the input field\n * - \"admin\" becomes \"$ == admin\" (equality check)\n * - \"[1..10]\" becomes \"$ in [1..10]\" (range check)\n *\n * The field parameter can be either:\n * - A simple field name like \"creditScore\" → ctx.get(\"creditScore\")\n * - An expression like \"date(order.createdAt)\" → needs to be parsed and evaluated\n *\n * Since AssemblyScript doesn't support closures, we transform the AST\n * to replace DollarRef nodes with the compiled field expression.\n *\n * @param expr - The raw expression string\n * @param inputType - The type of the input field\n * @param field - The field expression to compare against\n * @param context - The compilation context\n * @returns Compiled AssemblyScript code for the comparison\n */\nfunction compileComparison(\n  expr: string,\n  inputType: string,\n  field: string | undefined,\n  context: CompilationContext,\n): string {\n  // Handle empty expressions or unset values. Empty cells mean \"any value matches\" for\n  // that column. This is flexible (allows partial rule specification) but can be dangerous\n  // (typos become wildcards). Following DMN/JDM convention where blank = don't care.\n  if (!expr || expr === '' || expr === '-') {\n    return 'true';\n  }\n\n  try {\n    // When input field is \"$\", the cell contains a full boolean expression rather than a\n    // unary comparison:\n    //   e.g., \"age > 18 and tier == 'gold'\"\n    // This allows complex conditions that span multiple input values in a single cell, useful\n    // for cross-column logic.\n    if (!field || field === '$') {\n      // Parse and compile the expression directly as a standard expression\n      const ast = context.parseExpression(expr);\n      const compiledExpr = compileExpression(ast, context);\n      return `${compiledExpr}.asBool()`;\n    }\n\n    // Parse the expression using unary parser for decision table cells\n    // This transforms expressions like \"> 100\" into AST representing \"$ > 100\"\n    const ast = context.parseUnaryExpression(expr);\n\n    // Compile the field expression to get the value to compare against\n    // The field can be a simple name like \"creditScore\" or an expression like \"date(order.createdAt)\"\n    const fieldAst = context.parseExpression(field);\n    const compiledField = compileExpression(fieldAst, context);\n\n    // Transform the AST to replace DollarRef nodes with the compiled field expression\n    // AssemblyScript doesn't support closures, so we can't create a function context\n    // where $ refers to the field value. Instead, we do direct AST substitution.\n    const transformedAst = replaceDollarRefWithCode(ast, compiledField);\n\n    // Compile the transformed AST to AssemblyScript code\n    const compiledExpr = compileExpressionWithInlineCode(transformedAst, context);\n\n    // Return the compiled expression wrapped in .asBool() for the condition\n    return `${compiledExpr}.asBool()`;\n  } catch (e) {\n    // If parsing fails, log the error and return false (no match)\n    // This prevents compilation failures from breaking the entire decision\n    throw new Error(\n      `Failed to compile decision table condition \"${expr}\" for field \"${field}\": ${e}`,\n    );\n  }\n}\n\n/**\n * Compile an output value for a decision table result.\n *\n * @param value - The raw value string\n * @param outputType - The type of the output field\n * @param field - The field name being set\n * @param context - The compilation context\n * @returns Compiled AssemblyScript code for the value\n */\nfunction compileOutputValue(\n  value: string,\n  outputType: string,\n  field: string,\n  context: CompilationContext,\n): string {\n  // Handle empty/unset values: in multi-output tables, rules may set some outputs but not others.\n  // Empty cells mean \"this rule doesn't provide a value for this output field\", allowing sparse tables.\n  if (!value || value === '-' || value === '') {\n    return '';\n  }\n\n  const normalizedType = (outputType || '').toLowerCase();\n\n  // Check if value is a quoted string literal ('value' or \"value\")\n  // In JDM format, string literals are often wrapped in single quotes\n  const isQuotedString =\n    (value.startsWith(\"'\") && value.endsWith(\"'\")) ||\n    (value.startsWith('\"') && value.endsWith('\"'));\n\n  // Strip outer quotes if present for string literal values\n  const unquotedValue = isQuotedString ? value.slice(1, -1) : value;\n\n  switch (normalizedType) {\n    case 'expression': {\n      // For expression type, parse and compile the value as an expression\n      // This allows output values to reference context variables or perform calculations\n      const ast = context.parseExpression(value);\n      return compileExpression(ast, context);\n    }\n\n    case 'string':\n    case 'text':\n      // Input values may have quotes that need escaping for the generated AS code. Must escape\n      // both backslashes (for escape sequences) and double quotes (for string delimiters).\n      const escaped = unquotedValue.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n      return 'Value.String(\"' + escaped + '\")';\n\n    case 'number':\n    case 'integer':\n    case 'decimal':\n    case 'double':\n      return `Value.Float(${parseFloat(value)})`;\n\n    case 'boolean':\n    case 'bool':\n      return `Value.Bool(${value.toLowerCase() === 'true'})`;\n\n    default:\n      // For untyped values, infer type through a cascade:\n      // 1. Quoted strings → string literal\n      // 2. \"true\"/\"false\" → boolean\n      // 3. Numeric format → number\n      // 4. Otherwise → try parsing as expression, fallback to string literal\n      if (isQuotedString) {\n        // Value is a string literal - use the unquoted value\n        const defaultEscaped = unquotedValue.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n        return 'Value.String(\"' + defaultEscaped + '\")';\n      }\n\n      // Check if it's a boolean\n      if (value.toLowerCase() === 'true' || value.toLowerCase() === 'false') {\n        return `Value.Bool(${value.toLowerCase() === 'true'})`;\n      }\n\n      // Check if it's a number (use regex to handle trailing zeros like \"0.10\")\n      // The regex matches integer, decimal, and scientific notation formats\n      if (/^-?(\\d+\\.?\\d*|\\.\\d+)([eE][+-]?\\d+)?$/.test(value)) {\n        return `Value.Float(${parseFloat(value)})`;\n      }\n\n      // For unquoted non-literal values, treat as an expression\n      // This handles cases like \"basicEligibility.reason\" or \"totalScore * 1.5\"\n      try {\n        const ast = context.parseExpression(value);\n        return compileExpression(ast, context);\n      } catch (e) {\n        // Throw error instead of silently falling back to string literal\n        // This prevents type errors and typos from being silently converted to strings\n        throw new Error(\n          `Failed to compile output value \"${value}\" for field \"${field}\": ${e}. ` +\n            `If you intended a literal string, wrap it in quotes: '\"${value}\"' or \"'${value}'\"`,\n        );\n      }\n  }\n}\n\n/**\n * Extract string literals from compiled code and generate hoisted constants.\n * This optimization avoids repeated string allocations in large decision tables.\n *\n * Hoisting string literals to module-level constants prevents repeated allocations\n * that can exhaust WASM memory during table evaluation.\n *\n * @param code - The compiled code containing Value.String(...) calls\n * @param nodeId - Unique identifier for this node (used in constant names)\n * @returns Object with hoisted constants code and transformed code\n */\nfunction hoistStringLiterals(code: string, nodeId: string): { constants: string; code: string } {\n  // Find all Value.String(\"...\") patterns\n  const stringLiteralRegex = /Value\\.String\\(\"([^\"\\\\]|\\\\.)*\"\\)/g;\n  const matches = code.match(stringLiteralRegex) || [];\n\n  // Count occurrences\n  const counts = new Map<string, number>();\n  for (const match of matches) {\n    counts.set(match, (counts.get(match) || 0) + 1);\n  }\n\n  // Only hoist strings that appear more than once\n  const toHoist = new Map<string, string>();\n  let constIndex = 0;\n  for (const [literal, count] of counts) {\n    if (count > 1) {\n      // Extract the string content for naming\n      const constName = `__str_${sanitizeId(nodeId)}_${constIndex++}`;\n      toHoist.set(literal, constName);\n    }\n  }\n\n  // If nothing to hoist, return original\n  if (toHoist.size === 0) {\n    return { constants: '', code };\n  }\n\n  // Generate constant declarations\n  const constants = Array.from(toHoist.entries())\n    .map(([literal, constName]) => `const ${constName}: Value = ${literal};`)\n    .join('\\n');\n\n  // Replace literals with constant references\n  let transformedCode = code;\n  for (const [literal, constName] of toHoist) {\n    // Need to escape regex special chars in the literal\n    const escapedLiteral = literal.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n    transformedCode = transformedCode.replace(new RegExp(escapedLiteral, 'g'), constName);\n  }\n\n  return { constants, code: transformedCode };\n}\n\n/**\n * Compile a decision table node.\n *\n * Generates if/else chains for decision table evaluation, supporting:\n * - FIRST hit policy: Returns the first matching rule's output\n * - COLLECT hit policy: Aggregates all matching rules' outputs\n * - UNIQUE hit policy: Returns output if exactly one rule matches\n * - RULE ORDER hit policy: Returns all matching rules' outputs in rule order\n * - OUTPUT ORDER hit policy: Returns all matching rules sorted by output priority\n * - PRIORITY hit policy: Returns only the highest-priority matching rule\n *\n * For large decision tables (many rules with repeated string literals),\n * string literals are hoisted to module-level constants to avoid\n * repeated allocations that can exhaust memory.\n *\n * @param node - The JDM decision table node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileDecisionTableNode(\n  node: JDMNode,\n  context: CompilationContext,\n): AssemblyScriptCode {\n  const {\n    rules,\n    inputs,\n    outputs,\n    hitPolicy,\n    noMatchBehavior: tableNoMatchBehavior,\n    passThrough,\n  } = node.content as DecisionTableContent;\n\n  // Determine the effective no-match behavior (table-level overrides global)\n  const noMatchBehavior = tableNoMatchBehavior ??\n    context.options.noMatchBehavior ?? { type: 'returnNull' };\n\n  // Unique and priority need to evaluate all rules before making a decision\n  const isCollectAll =\n    hitPolicy === 'collect' ||\n    hitPolicy === 'unique' ||\n    hitPolicy === 'ruleOrder' ||\n    hitPolicy === 'outputOrder' ||\n    hitPolicy === 'priority';\n\n  // Generate the result declaration based on hit policy\n  let resultDeclaration: string;\n  if (isCollectAll) {\n    resultDeclaration = 'let results = new Array<Value>();';\n  } else {\n    resultDeclaration = '';\n  }\n\n  // Generate the rule evaluation branches\n  const ruleBranches = rules\n    .map((rule, idx) => {\n      // Compile all input conditions for this rule\n      const conditions = inputs\n        .map((input) => {\n          const expr = rule[input.id];\n          if (!expr || expr === '' || expr === '-') {\n            return 'true';\n          }\n          return compileComparison(expr, input.type, input.field, context);\n        })\n        .join(' && ');\n\n      // Compile all output values for this rule\n      const resultAssignments = outputs\n        .map((output) => {\n          const value = rule[output.id];\n          if (!value || value === '' || value === '-') {\n            return '';\n          }\n          const compiled = compileOutputValue(value, output.type, output.field, context);\n          return `    result.set(\"${output.field}\", ${compiled});`;\n        })\n        .filter(Boolean)\n        .join('\\n');\n\n      // Generate the conditional expression and action\n      if (isCollectAll) {\n        // For collect-mode hit policies, evaluate all rules independently\n        return `\n  if (${conditions || 'true'}) {\n    let result = new Map<string, Value>();\n${resultAssignments}\n    results.push(Value.Object(result));\n  }`;\n      } else {\n        // For FIRST hit policy, use if/else if chain\n        const conditionalExpr =\n          idx === 0 ? `if (${conditions || 'true'})` : `else if (${conditions || 'true'})`;\n        return `${conditionalExpr} {\n    let result = new Map<string, Value>();\n${resultAssignments}\n    return Value.Object(result);\n  }`;\n      }\n    })\n    .join(isCollectAll ? '\\n' : '\\n');\n\n  // Generate the no-match handler based on the effective behavior\n  function generateNoMatchHandler(): string {\n    const returnNull = 'return Value.Null();';\n\n    // We need to signal to the caller that no rules matched but the table has passThrough enabled,\n    // so it should return accumulated context. We can't directly access the outer context here, so\n    // we return a marker object that the caller detects and handles.\n    const returnPassthroughSignal = `let __pt = new Map<string, Value>();\n    __pt.set(\"__passthrough\", Value.Bool(true));\n    return Value.Object(__pt);`;\n\n    if (noMatchBehavior.type === 'throwError') {\n      return `SetLastErrorWithMessage(RuntimeErrorCode.EVALUATION_ERROR, \"Decision table \\\\\"${node.name}\\\\\" (id: ${node.id}): No matching rules found\");\\n  ${returnNull}`;\n    } else if (noMatchBehavior.type === 'returnDefault') {\n      const defaultValue = noMatchBehavior.value;\n\n      // Generate the default value as a Value based on its JavaScript type\n      let defaultValueCode: string;\n      switch (typeof defaultValue) {\n        case 'string':\n          defaultValueCode = `Value.String(\"${String(defaultValue).replace(/\"/g, '\\\\\"')}\")`;\n          break;\n        case 'number':\n          defaultValueCode = `Value.Float(${defaultValue})`;\n          break;\n        case 'boolean':\n          defaultValueCode = `Value.Bool(${defaultValue})`;\n          break;\n        default:\n          defaultValueCode = `Value.String(\"${String(defaultValue)}\")`;\n      }\n\n      // Assign the default value to each output field\n      const defaultAssignments = outputs\n        .map((output) => {\n          return `    result.set(\"${output.field}\", ${defaultValueCode});`;\n        })\n        .join('\\n');\n\n      const defaultAssignmentSingle =\n        outputs.length > 0\n          ? `  let result = new Map<string, Value>();\\n${defaultAssignments}\\n  return Value.Object(result);`\n          : returnNull;\n\n      if (isCollectAll) {\n        // For collect-mode policies, return array with default result\n        return `  let result = new Map<string, Value>();\\n${defaultAssignments}\\n  return Value.Array([Value.Object(result)]);`;\n      } else {\n        return defaultAssignmentSingle;\n      }\n    } else {\n      // Default: returnNull\n      // But for FIRST hit policy with passThrough, signal to use accumulated context\n      if (passThrough && hitPolicy === 'first') {\n        return returnPassthroughSignal;\n      }\n      return returnNull;\n    }\n  }\n\n  // Generate the final return statement based on hit policy\n  // COLLECT-style policies return arrays directly (not wrapped in object)\n  // The node name keying is handled by codegen.ts when storing in context\n  let finalReturn: string;\n  if (hitPolicy === 'collect' || hitPolicy === 'ruleOrder') {\n    // For collect policies no-match handling\n    if (noMatchBehavior.type === 'throwError') {\n      finalReturn = `\n  if (results.length == 0) {\n${generateNoMatchHandler()}\n  }\n  return Value.Array(results);`;\n    } else if (noMatchBehavior.type === 'returnDefault') {\n      finalReturn = `\n  if (results.length == 0) {\n${generateNoMatchHandler()}\n  }\n  return Value.Array(results);`;\n    } else {\n      finalReturn = `return Value.Array(results);`;\n    }\n  } else if (hitPolicy === 'unique') {\n    finalReturn = `\n  // Validate exactly one match\n  if (results.length == 1) {\n    return results[0];\n  } else if (results.length == 0) {\n    ${generateNoMatchHandler()}\n  } else {\n    // Multiple matches - this violates UNIQUE constraint\n    SetLastErrorWithMessage(RuntimeErrorCode.EVALUATION_ERROR, \"Decision table \\\\\"${node.name}\\\\\" (id: ${node.id}): Multiple rules matched but UNIQUE hit policy requires exactly one match\");\n    return Value.Null();\n  }`;\n  } else if (hitPolicy === 'outputOrder' || hitPolicy === 'priority') {\n    if (outputs.length === 0) {\n      throw new Error(`${hitPolicy.toUpperCase()} hit policy requires at least one output field`);\n    }\n\n    const primaryOutput = outputs[0];\n    finalReturn = `\n  // Sort by output value (descending priority), with rule order as tie-breaker\n  results.sort((a: Value, b: Value): i32 => {\n    let aOutput = a.asObject().get(\"${primaryOutput.field}\");\n    let bOutput = b.asObject().get(\"${primaryOutput.field}\");\n\n    // Compare the primary output values\n    let cmp = compareValues(aOutput, bOutput);\n\n    // If outputs are equal, maintain rule order (lower index = higher priority)\n    if (cmp == 0) {\n      return 1; // already in rule order, so keep it\n    }\n\n    // Return results in descending order of output priority\n    // Higher output values come first\n    return cmp < 0 ? 1 : -1;\n  });\n\n  if (results.length == 0) {\n${generateNoMatchHandler()}\n  }\n\n  ${\n    hitPolicy === 'priority'\n      ? '// Return only the highest-priority result\\n  return results[0];'\n      : 'return Value.Array(results);'\n  }`;\n  } else {\n    // Default case - FIRST hit policy\n    finalReturn = `\\n  else {\\n    ${generateNoMatchHandler()}\\n  }`;\n  }\n\n  const sanitizedId = sanitizeId(node.id);\n\n  // Build the raw function body\n  const rawFunctionBody = `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  ${resultDeclaration}\n\n${ruleBranches}\n${finalReturn}\n}\n`;\n\n  // For large decision tables, hoist repeated string literals to module-level constants\n  // This prevents memory exhaustion from repeated Value.String() allocations\n  if (rules.length > 100) {\n    const { constants, code: optimizedBody } = hoistStringLiterals(rawFunctionBody, node.id);\n    if (constants) {\n      return `// Hoisted string constants for decision table \"${node.name}\" (${rules.length} rules)\n${constants}\n\n${optimizedBody}`;\n    }\n  }\n\n  return rawFunctionBody;\n}\n","/**\n * Code generation helpers for shared AssemblyScript code patterns.\n *\n * These helpers generate AssemblyScript code strings that can be used across\n * different compiler modules to avoid duplication.\n */\n\nimport { sanitizeId } from './utils';\n\n/**\n * Generate AssemblyScript code to assign a value to a nested path in the context.\n *\n * This handles dotted paths like \"cart.items.total\" by navigating/creating the\n * necessary object hierarchy in the context. The algorithm:\n * 1. Splits the path by \".\"\n * 2. Gets or creates the root object from context\n * 3. Navigates/creates intermediate objects for each part\n * 4. Sets the final value at the leaf\n *\n * @param path - The dotted path string (e.g., \"cart.items.total\")\n * @param valueExpr - The AssemblyScript expression for the value to assign\n * @param prefix - Optional prefix for generated variable names to avoid collisions (default: \"__np\")\n * @returns AssemblyScript code string that performs the nested assignment\n */\nexport function generateNestedPathAssignment(\n  path: string,\n  valueExpr: string,\n  prefix: string = '__np',\n): string {\n  return `// Store value at nested path: ${path}\n{\n  const ${prefix}_value = ${valueExpr};\n  const ${prefix}_parts = \"${path}\".split(\".\");\n  const ${prefix}_rootKey = ${prefix}_parts[0];\n  // Get or create the root object\n  let ${prefix}_rootObj: Map<string, Value>;\n  if (ctx.data.has(${prefix}_rootKey) && ctx.data.get(${prefix}_rootKey).isObject()) {\n    ${prefix}_rootObj = ctx.data.get(${prefix}_rootKey).asObject();\n  } else {\n    ${prefix}_rootObj = new Map<string, Value>();\n    ctx.set(${prefix}_rootKey, Value.Object(${prefix}_rootObj));\n  }\n  // Navigate/create nested objects for intermediate parts\n  let ${prefix}_current = ${prefix}_rootObj;\n  for (let ${prefix}_j = 1; ${prefix}_j < ${prefix}_parts.length - 1; ${prefix}_j++) {\n    const ${prefix}_part = ${prefix}_parts[${prefix}_j];\n    if (${prefix}_current.has(${prefix}_part) && ${prefix}_current.get(${prefix}_part).isObject()) {\n      ${prefix}_current = ${prefix}_current.get(${prefix}_part).asObject();\n    } else {\n      const ${prefix}_newObj = new Map<string, Value>();\n      ${prefix}_current.set(${prefix}_part, Value.Object(${prefix}_newObj));\n      ${prefix}_current = ${prefix}_newObj;\n    }\n  }\n  // Set the final value at the leaf of the path\n  ${prefix}_current.set(${prefix}_parts[${prefix}_parts.length - 1], ${prefix}_value);\n}`;\n}\n\n/**\n * Generate AssemblyScript code to build a final result from accumulated context.\n *\n * This extracts all user-facing keys from the context (excluding internal namespaces)\n * and builds a Map suitable for returning as a Value.Object result.\n *\n * The generated code:\n * 1. Creates a new Map for the result\n * 2. Iterates over all keys in ctx.data\n * 3. Filters out internal keys ($*, #, acc)\n * 4. Copies remaining keys to the result map\n *\n * @param resultVarName - The name of the variable to store the result in\n * @param prefix - Optional prefix for loop variables to avoid collisions (default: \"__bfr\")\n * @returns AssemblyScript code string that builds the result map\n */\nexport function generateBuildFinalResultCode(\n  resultVarName: string,\n  prefix: string = '__bfr',\n): string {\n  return `// Build final result from accumulated context\nlet ${resultVarName} = new Map<string, Value>();\nconst ${prefix}_keys = ctx.data.keys();\nfor (let ${prefix}_i = 0; ${prefix}_i < ${prefix}_keys.length; ${prefix}_i++) {\n  const ${prefix}_key = ${prefix}_keys[${prefix}_i];\n  // $nodes/$ are internal namespaces\n  // # is iteration variable,\n  // acc is accumulator\n  // None should appear in final output, only actual output field names\n  if (!${prefix}_key.startsWith(\"$\") && ${prefix}_key !== \"#\" && ${prefix}_key !== \"acc\") {\n    ${resultVarName}.set(${prefix}_key, ctx.data.get(${prefix}_key));\n  }\n}`;\n}\n\n/**\n * Generate AssemblyScript code to evaluate a single node and handle its outputPath and passThrough settings.\n *\n * This is the standard node evaluation pattern used across the codebase. It:\n * 1. Calls the node's evaluateNode function\n * 2. Stores the result in $nodes.<nodeName>\n * 3. Handles outputPath if specified (storing result at the given path)\n * 4. Handles passThrough merge if the node is configured for it\n *\n * @param nodeId - The raw node ID\n * @param nodeName - The name of the node (for context storage)\n * @param node - The JDM node definition (optional, for outputPath/passThrough handling)\n * @returns AssemblyScript code string that evaluates the node\n */\nexport function generateNodeEvaluationCode(\n  nodeId: string,\n  nodeName: string,\n  node?: {\n    type?: string;\n    content?: { outputPath?: string; passThrough?: boolean; outputs?: Array<{ field?: string }> };\n  },\n): string {\n  const sanitizedId = sanitizeId(nodeId);\n  const statements: string[] = [];\n\n  // Call the node's evaluateNode function and store result\n  statements.push(`ctx.set(\"$nodes.${nodeName}\", evaluateNode_${sanitizedId}(ctx));`);\n\n  if (!node) {\n    return statements.join('\\n    ');\n  }\n\n  const outputPath = node.content?.outputPath;\n  if (outputPath) {\n    if (!outputPath.includes('.')) {\n      statements.push(`ctx.set(\"${outputPath}\", ctx.get(\"$nodes.${nodeName}\"));`);\n    } else {\n      statements.push(generateNestedPathAssignment(outputPath, `ctx.get(\"$nodes.${nodeName}\")`));\n    }\n  }\n\n  // Determine if we should merge node results into context\n  // Expression nodes compute values meant for the output, so their results should flow\n  // through to the final result regardless of passThrough setting. Decision tables with\n  // dotted output fields (e.g., \"flag.turnover\") similarly need merging to build nested\n  // output structures.\n  const hasOutputFields =\n    node.type === 'decisionTableNode' &&\n    node.content?.outputs?.some((o: { field?: string }) => o.field && o.field.includes('.'));\n  const shouldMerge =\n    node.type === 'expressionNode' || node.content?.passThrough === true || hasOutputFields;\n\n  if (shouldMerge) {\n    statements.push(generatePassThroughMergeCode(nodeName));\n  }\n\n  return statements.join('\\n    ');\n}\n\n/**\n * Generate AssemblyScript code to merge passThrough node results into the context.\n *\n * This handles both simple keys (e.g., \"status\") and nested paths (e.g., \"evaluation.score\").\n * For nested paths, it navigates/creates the necessary object hierarchy in the context.\n *\n * The generated code:\n * 1. Gets the node result from `$nodes.<nodeName>`\n * 2. Iterates over all keys in the result\n * 3. For simple keys, sets them directly in the context\n * 4. For nested paths, navigates/creates intermediate objects and sets the leaf value\n *\n * @param nodeName - The name of the node whose results should be merged\n * @returns AssemblyScript code string that performs the merge\n */\nexport function generatePassThroughMergeCode(nodeName: string): string {\n  // Generate the nested path assignment code for use inside the loop\n  // We use a special prefix \"__pt\" to avoid collisions with other generated code\n  const nestedPathCode = `const __pt_parts = __key.split(\".\");\n        const __pt_rootKey = __pt_parts[0];\n        let __pt_rootObj: Map<string, Value>;\n        if (ctx.data.has(__pt_rootKey) && ctx.data.get(__pt_rootKey).isObject()) {\n          __pt_rootObj = ctx.data.get(__pt_rootKey).asObject();\n        } else {\n          __pt_rootObj = new Map<string, Value>();\n          ctx.set(__pt_rootKey, Value.Object(__pt_rootObj));\n        }\n        let __pt_current = __pt_rootObj;\n        for (let __pt_j = 1; __pt_j < __pt_parts.length - 1; __pt_j++) {\n          const __pt_part = __pt_parts[__pt_j];\n          if (__pt_current.has(__pt_part) && __pt_current.get(__pt_part).isObject()) {\n            __pt_current = __pt_current.get(__pt_part).asObject();\n          } else {\n            const __pt_newObj = new Map<string, Value>();\n            __pt_current.set(__pt_part, Value.Object(__pt_newObj));\n            __pt_current = __pt_newObj;\n          }\n        }\n        __pt_current.set(__pt_parts[__pt_parts.length - 1], __value);`;\n\n  return `// Merge passThrough results for ${nodeName}\n{\n  const __nodeResult = ctx.get(\"$nodes.${nodeName}\");\n  if (__nodeResult.isObject()) {\n    const __resultMap = __nodeResult.asObject();\n    const __keys = __resultMap.keys();\n    for (let __i = 0; __i < __keys.length; __i++) {\n      const __key = __keys[__i];\n      const __value = __resultMap.get(__key);\n      if (__key.includes(\".\")) {\n        ${nestedPathCode}\n      } else {\n        ctx.set(__key, __value);\n      }\n    }\n  }\n}`;\n}\n","import type { JDMNode } from '../parser';\nimport type { CompilationContext, AssemblyScriptCode, NoMatchBehavior } from '../types';\nimport { compileExpression } from './expression';\nimport { sanitizeId } from '../utils';\nimport { generateNodeEvaluationCode, generateBuildFinalResultCode } from '../code-generators';\n\n/**\n * Switch statement definition (from JDM format).\n */\ninterface SwitchStatement {\n  id: string;\n  condition: string; // Empty string means default case\n}\n\n/**\n * Switch node content structure (from JDM format).\n */\ninterface JDMNodeContent {\n  statements: SwitchStatement[];\n  hitPolicy?: 'first' | 'collect' | 'unique' | 'ruleOrder' | 'outputOrder' | 'priority';\n  /** Override the global no-match behavior for this switch */\n  noMatchBehavior?: NoMatchBehavior;\n}\n\n/**\n * Internal switch condition definition.\n */\ninterface SwitchCondition {\n  id: string;\n  expression: string;\n  nodes: string[];\n  isDefault: boolean;\n}\n\n/**\n * Get all nodes reachable from a starting node via BFS, stopping at switch nodes.\n *\n * Each switch evaluates its own branches independently. If we traversed into nested\n * switches, we'd incorrectly include nodes that should be conditionally evaluated by\n * the nested switch, not unconditionally evaluated by the parent branch.\n */\nfunction getBranchNodes(startNodeId: string, context: CompilationContext): string[] {\n  const nodeMap = new Map(context.jdm.nodes.map((n) => [n.id, n]));\n  const visited = new Set<string>();\n  const result: string[] = [];\n  const queue = [startNodeId];\n\n  while (queue.length > 0) {\n    const currentId = queue.shift()!;\n    if (visited.has(currentId)) {\n      continue;\n    }\n    visited.add(currentId);\n    result.push(currentId);\n\n    // Get the current node\n    const currentNode = nodeMap.get(currentId);\n\n    // If node not found in context, just include it and stop traversal\n    // (this handles test mocks that don't define all nodes)\n    if (!currentNode) {\n      continue;\n    }\n\n    // If this is a switch node, don't traverse its outgoing edges\n    // The switch will handle its own branches when it's evaluated\n    if (currentNode.type === 'switchNode') {\n      continue;\n    }\n\n    // Find outgoing edges from this node\n    const outgoingEdges = context.jdm.edges.filter((e) => e.sourceId === currentId);\n    for (const edge of outgoingEdges) {\n      queue.push(edge.targetId);\n    }\n  }\n\n  return result;\n}\n\n/**\n * Generate inline code to evaluate an entire branch (all nodes in sequence).\n * Returns the statements and a final result expression.\n *\n * Uses shared node evaluation infrastructure (generateNodeEvaluationCode) to ensure\n * consistent handling of outputPath and passThrough across the codebase.\n */\nfunction generateBranchEvaluation(\n  branchNodeIds: string[],\n  context: CompilationContext,\n): { statements: string; resultExpr: string } {\n  const nodeMap = new Map(context.jdm.nodes.map((n) => [n.id, n]));\n\n  if (branchNodeIds.length === 0) {\n    return { statements: '', resultExpr: 'Value.Null()' };\n  }\n\n  // Generate evaluation code for each node using shared helper\n  const evalStatements = branchNodeIds.map((nodeId) => {\n    const node = nodeMap.get(nodeId);\n    const nodeName = node?.name || sanitizeId(nodeId);\n    return generateNodeEvaluationCode(nodeId, nodeName, node);\n  });\n\n  // Determine result expression based on the last node's type\n  const lastNodeId = branchNodeIds[branchNodeIds.length - 1];\n  const lastNode = nodeMap.get(lastNodeId);\n  const lastNodeName = lastNode?.name || sanitizeId(lastNodeId);\n\n  // For output nodes or nodes with passThrough, build result from accumulated context\n  const shouldUseAccumulatedContext =\n    lastNode?.type === 'outputNode' || lastNode?.content?.passThrough === true;\n\n  if (shouldUseAccumulatedContext) {\n    // Use shared helper to build final result from context\n    evalStatements.push(generateBuildFinalResultCode('__branchFinalResult', '__branch'));\n    return {\n      statements: evalStatements.join('\\n    '),\n      resultExpr: 'Value.Object(__branchFinalResult)',\n    };\n  }\n\n  return {\n    statements: evalStatements.join('\\n    '),\n    resultExpr: `ctx.get(\"$nodes.${lastNodeName}\")`,\n  };\n}\n\n/**\n * Compile a switch node.\n *\n * Generates conditional chains (switch-like logic) for evaluating multiple\n * conditions and routing to the appropriate target nodes.\n *\n * Supports:\n * - FIRST hit policy: Returns the first matching condition's result\n * - COLLECT hit policy: Aggregates all matching conditions' results\n * - RULE ORDER hit policy: Returns all matching conditions' results in order\n * - UNIQUE hit policy: Returns result if exactly one condition matches\n * - OUTPUT ORDER hit policy: Returns all matching conditions' results sorted by value\n * - PRIORITY hit policy: Returns only the highest-priority matching condition's result\n *\n * Default Cases:\n * - A statement with an empty condition string acts as the default case\n * - When no conditions match, the default case is evaluated (if provided)\n * - Default case has access to the full input context\n * - If no default case is provided, the configured no-match behavior applies\n *\n * @param node - The JDM switch node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileSwitchNode(node: JDMNode, context: CompilationContext): AssemblyScriptCode {\n  const jdmContent = node.content as JDMNodeContent;\n  const {\n    statements,\n    hitPolicy: jdmHitPolicy,\n    noMatchBehavior: switchNoMatchBehavior,\n  } = jdmContent;\n\n  const hitPolicy = jdmHitPolicy ?? 'first';\n\n  // Determine the effective no-match behavior (node-level overrides global)\n  const noMatchBehavior = switchNoMatchBehavior ??\n    context.options.noMatchBehavior ?? { type: 'returnNull' };\n\n  // RULE ORDER, COLLECT, OUTPUT ORDER, and PRIORITY all use array collection mode\n  const isCollectMode =\n    hitPolicy === 'collect' ||\n    hitPolicy === 'ruleOrder' ||\n    hitPolicy === 'outputOrder' ||\n    hitPolicy === 'priority';\n\n  const nodeMap = new Map(context.jdm.nodes.map((n) => [n.id, n]));\n\n  // In collect mode, if all branches terminate at output nodes, we can merge their results into\n  // a single object instead of returning an array. This allows collect-mode switches to build\n  // structured outputs progressively, avoiding unnecessary nesting.\n  function checkAllBranchesTerminateAtOutput(): boolean {\n    if (!isCollectMode) {\n      return false;\n    }\n\n    for (const statement of statements) {\n      if (statement.condition === '' || statement.condition.trim() === '') {\n        continue;\n      } // Skip default\n\n      // Find target edge for this statement\n      const edge = context.jdm.edges.find(\n        (e) => e.sourceId === node.id && e.sourceHandle === statement.id,\n      );\n      if (!edge) {\n        continue;\n      }\n\n      // Get the terminal node(s) for this branch\n      const branchNodes = getBranchNodes(edge.targetId, context);\n      if (branchNodes.length === 0) {\n        return false;\n      }\n\n      const lastNodeId = branchNodes[branchNodes.length - 1];\n      const lastNode = nodeMap.get(lastNodeId);\n      if (!lastNode || lastNode.type !== 'outputNode') {\n        return false;\n      }\n    }\n\n    // Also check default case if exists\n    const defaultStatement = statements.find(\n      (s) => s.condition === '' || s.condition.trim() === '',\n    );\n    if (defaultStatement) {\n      const edge = context.jdm.edges.find(\n        (e) => e.sourceId === node.id && e.sourceHandle === defaultStatement.id,\n      );\n      if (edge) {\n        const branchNodes = getBranchNodes(edge.targetId, context);\n        if (branchNodes.length > 0) {\n          const lastNodeId = branchNodes[branchNodes.length - 1];\n          const lastNode = nodeMap.get(lastNodeId);\n          if (!lastNode || lastNode.type !== 'outputNode') {\n            return false;\n          }\n        }\n      }\n    }\n\n    return true;\n  }\n\n  const shouldMergeCollectResults = checkAllBranchesTerminateAtOutput();\n\n  // Transform JDM statements to internal conditions format\n  const conditions: SwitchCondition[] = statements.map((statement) => {\n    // Find target nodes for this statement by looking for edges with this statement as sourceHandle\n    const edges = context.jdm.edges.filter(\n      (edge) => edge.sourceId === node.id && edge.sourceHandle === statement.id,\n    );\n    const targetNodeIds = edges.map((edge) => sanitizeId(edge.targetId));\n\n    return {\n      id: statement.id,\n      expression: statement.condition,\n      nodes: targetNodeIds,\n      // In collect mode, all matching conditions execute (empty = always match).\n      // In first mode, execution stops at first match, so empty condition acts as fallback \"default\" case.\n      isDefault:\n        !isCollectMode && (statement.condition === '' || statement.condition.trim() === ''),\n    };\n  });\n\n  // Separate regular conditions from default case\n  // In collect mode, there are no defaults - empty conditions are just \"always true\"\n  const regularConditions = conditions.filter((c) => !c.isDefault);\n  const defaultCase = isCollectMode ? undefined : conditions.find((c) => c.isDefault);\n\n  // Generate the result declaration based on hit policy\n  const resultDeclaration = isCollectMode ? 'let results = new Array<Value>();' : '';\n\n  // Generate the no-match handler based on the effective behavior\n  function generateNoMatchHandler(): string {\n    if (noMatchBehavior.type === 'throwError') {\n      return `SetLastErrorWithMessage(RuntimeErrorCode.EVALUATION_ERROR, \"Switch node \\\\\"${node.name}\\\\\" (id: ${node.id}): No matching condition found\");\\n  return Value.Null();`;\n    } else if (noMatchBehavior.type === 'returnDefault') {\n      // Generate the default value as a Value\n      const defaultValue = noMatchBehavior.value;\n      let defaultValueCode: string;\n      switch (typeof defaultValue) {\n        case 'string':\n          defaultValueCode = `Value.String(\"${String(defaultValue).replace(/\"/g, '\\\\\"')}\")`;\n          break;\n        case 'number':\n          defaultValueCode = `Value.Float(${defaultValue})`;\n          break;\n        case 'boolean':\n          defaultValueCode = `Value.Bool(${defaultValue})`;\n          break;\n        default:\n          defaultValueCode = `Value.String(\"${String(defaultValue)}\")`;\n      }\n\n      return isCollectMode\n        ? `return Value.Array([${defaultValueCode}]);`\n        : `return ${defaultValueCode};`;\n    } else {\n      // Default: returnNull\n      return 'return Value.Null();';\n    }\n  }\n\n  // Helper function to generate code that evaluates the default case (entire branch)\n  function generateDefaultCaseEvaluation(): string {\n    if (!defaultCase) {\n      return generateNoMatchHandler();\n    }\n\n    // Get the first node ID for the default case\n    // If no target node is connected to the default case, use no-match behavior\n    if (!defaultCase.nodes || defaultCase.nodes.length === 0) {\n      // Default case exists but has no target - treat as no-match\n      return generateNoMatchHandler();\n    }\n\n    // Get all nodes in this branch (from target to end)\n    const branchStartId = defaultCase.nodes[0]; // Use raw ID, not sanitized\n    // Find the raw ID from the edge\n    const defaultEdge = context.jdm.edges.find(\n      (e) => e.sourceId === node.id && e.sourceHandle === defaultCase.id,\n    );\n    const rawTargetId = defaultEdge?.targetId || branchStartId;\n    const branchNodeIds = getBranchNodes(rawTargetId, context);\n\n    // Generate code to evaluate the entire branch\n    const { statements, resultExpr } = generateBranchEvaluation(branchNodeIds, context);\n\n    if (isCollectMode) {\n      return `    ${statements}\\n    results.push(${resultExpr});`;\n    } else {\n      return `    ${statements}\\n    return ${resultExpr};`;\n    }\n  }\n\n  // Generate the conditional branches for each condition (excluding default)\n  let conditionBranches: string;\n  let finalReturn: string;\n\n  // Helper to get branch nodes for a condition\n  function getBranchNodesForCondition(condition: SwitchCondition): string[] {\n    if (!condition.nodes || condition.nodes.length === 0) {\n      return [];\n    }\n\n    // Find the edge for this condition to get the raw target ID\n    const edge = context.jdm.edges.find(\n      (e) => e.sourceId === node.id && e.sourceHandle === condition.id,\n    );\n    const rawTargetId = edge?.targetId || condition.nodes[0];\n    return getBranchNodes(rawTargetId, context);\n  }\n\n  // Handle the case where there are no regular conditions but there is a default case\n  if (regularConditions.length === 0) {\n    conditionBranches = '';\n    if (defaultCase && defaultCase.nodes && defaultCase.nodes.length > 0) {\n      // Only default case exists with a target - evaluate the entire branch\n      const branchNodeIds = getBranchNodesForCondition(defaultCase);\n      const { statements, resultExpr } = generateBranchEvaluation(branchNodeIds, context);\n\n      if (isCollectMode) {\n        finalReturn = `\n  ${statements}\n  results.push(${resultExpr});\n  return Value.Array(results);`;\n      } else {\n        finalReturn = `\n  ${statements}\n  return ${resultExpr};`;\n      }\n    } else {\n      // No conditions and no default case (or default with no target) - use no-match behavior\n      finalReturn = `\\n  ${generateNoMatchHandler()}`;\n    }\n  } else {\n    // Generate the conditional branches for each condition (excluding default)\n    conditionBranches = regularConditions\n      .map((condition, idx) => {\n        // Parse and compile the condition expression\n        let compiledExpr: string;\n        // Empty condition means \"always true\" (especially in collect mode)\n        if (condition.expression === '' || condition.expression.trim() === '') {\n          compiledExpr = 'true';\n        } else {\n          try {\n            const ast = context.parseExpression(condition.expression);\n            // Get the conditional value (expects a boolean result)\n            const exprCode = compileExpression(ast, context);\n            compiledExpr = `${exprCode}.asBool()`;\n          } catch {\n            // If parsing fails, provide a comment indicating the issue\n            // Can fail if expression syntax is invalid (checked at compile time)\n            compiledExpr = '/* ERROR: Could not parse expression */ false';\n          }\n        }\n\n        // Get all nodes in this branch (from target to end)\n        const branchNodeIds = getBranchNodesForCondition(condition);\n        const { statements, resultExpr } = generateBranchEvaluation(branchNodeIds, context);\n\n        // Generate the conditional branch\n        if (isCollectMode) {\n          // For collect-mode hit policies, evaluate all conditions independently\n          if (shouldMergeCollectResults) {\n            // When all branches terminate at output nodes, just evaluate (don't collect)\n            // The context accumulates all results which get merged at the end\n            const branchCode = `\\n  if (${compiledExpr}) {\n    ${statements}\n  }`;\n            return branchCode;\n          }\n          const branchCode = `\\n  if (${compiledExpr}) {\n    ${statements}\n    results.push(${resultExpr});\n  }`;\n          return branchCode;\n        } else {\n          // For FIRST hit policy, use if/else if chain (short-circuit on first match)\n          const prefix = idx === 0 ? '\\n  if' : '\\n  else if';\n          const branchCode = `${prefix} (${compiledExpr}) {\n    ${statements}\n    return ${resultExpr};\n  }`;\n          return branchCode;\n        }\n      })\n      .join('');\n\n    if (isCollectMode) {\n      // For OUTPUT ORDER and PRIORITY, sort the results by value (descending)\n      if (hitPolicy === 'outputOrder' || hitPolicy === 'priority') {\n        if (\n          defaultCase ||\n          noMatchBehavior.type === 'throwError' ||\n          noMatchBehavior.type === 'returnDefault'\n        ) {\n          finalReturn = `\n  // Sort by value (descending priority), with rule order as tie-breaker\n  // compareValues returns: -1 if a < b, 0 if equal, 1 if a > b\n  // For descending order (higher priority first): return inverted comparison\n  // Tie-breaker: when equal, return 1 to maintain original rule order (stable sort)\n  results.sort((a: Value, b: Value): i32 => {\n    let cmp = compareValues(a, b);\n    if (cmp == 0) {\n      return 1;\n    }\n    return cmp < 0 ? 1 : -1;\n  });\n\n  if (results.length == 0) {\n${generateDefaultCaseEvaluation()}\n  }\n\n  ${hitPolicy === 'priority' ? 'return results[0];' : 'return Value.Array(results);'}`;\n        } else {\n          finalReturn = `\n  // Sort by value (descending priority), with rule order as tie-breaker\n  // compareValues returns: -1 if a < b, 0 if equal, 1 if a > b\n  // For descending order (higher priority first): return inverted comparison\n  // Tie-breaker: when equal, return 1 to maintain original rule order (stable sort)\n  results.sort((a: Value, b: Value): i32 => {\n    let cmp = compareValues(a, b);\n    if (cmp == 0) {\n      return 1;\n    }\n    return cmp < 0 ? 1 : -1;\n  });\n\n  ${\n    hitPolicy === 'priority'\n      ? 'return results.length > 0 ? results[0] : Value.Null();'\n      : 'return Value.Array(results);'\n  }`;\n        }\n      } else {\n        // Collect or rule order without sorting\n        if (shouldMergeCollectResults) {\n          // When merging results, return the accumulated context (excluding input keys)\n          // First check if any branch was evaluated, if not run default\n          if (defaultCase) {\n            finalReturn = `\n  // Build merged result from accumulated context (excluding input keys)\n  // Runtime variables: $=context root, #=current array element, acc=reduce accumulator\n  let __mergedResult = new Map<string, Value>();\n  const __mergedCtxKeys = ctx.data.keys();\n  for (let __mergedI = 0; __mergedI < __mergedCtxKeys.length; __mergedI++) {\n    const __mergedKey = __mergedCtxKeys[__mergedI];\n    // Skip internal entries, special variables, and input keys\n    if (!__mergedKey.startsWith(\"$\") && __mergedKey !== \"#\" && __mergedKey !== \"acc\" && !ctx.inputKeys.has(__mergedKey)) {\n      __mergedResult.set(__mergedKey, ctx.data.get(__mergedKey));\n    }\n  }\n  // If no output was produced, run default case\n  if (__mergedResult.size == 0) {\n${generateDefaultCaseEvaluation()}\n    // Rebuild result after default case\n    __mergedResult = new Map<string, Value>();\n    const __afterDefaultKeys = ctx.data.keys();\n    for (let __afterI = 0; __afterI < __afterDefaultKeys.length; __afterI++) {\n      const __afterKey = __afterDefaultKeys[__afterI];\n      if (!__afterKey.startsWith(\"$\") && __afterKey !== \"#\" && __afterKey !== \"acc\" && !ctx.inputKeys.has(__afterKey)) {\n        __mergedResult.set(__afterKey, ctx.data.get(__afterKey));\n      }\n    }\n  }\n  return Value.Object(__mergedResult);`;\n          } else {\n            finalReturn = `\n  // Build merged result from accumulated context (excluding input keys)\n  // Runtime variables: $=context root, #=current array element, acc=reduce accumulator\n  let __mergedResult = new Map<string, Value>();\n  const __mergedCtxKeys = ctx.data.keys();\n  for (let __mergedI = 0; __mergedI < __mergedCtxKeys.length; __mergedI++) {\n    const __mergedKey = __mergedCtxKeys[__mergedI];\n    // Skip internal entries, special variables, and input keys\n    if (!__mergedKey.startsWith(\"$\") && __mergedKey !== \"#\" && __mergedKey !== \"acc\" && !ctx.inputKeys.has(__mergedKey)) {\n      __mergedResult.set(__mergedKey, ctx.data.get(__mergedKey));\n    }\n  }\n  return Value.Object(__mergedResult);`;\n          }\n        } else if (\n          defaultCase ||\n          noMatchBehavior.type === 'throwError' ||\n          noMatchBehavior.type === 'returnDefault'\n        ) {\n          finalReturn = `\n  if (results.length == 0) {\n${generateDefaultCaseEvaluation()}\n  }\n  return Value.Array(results);`;\n        } else {\n          finalReturn = '\\n  return Value.Array(results);';\n        }\n      }\n    } else {\n      // Non-collect mode (FIRST, PRIORITY)\n      if (defaultCase) {\n        // Use else block to evaluate default case\n        // Last branch already has closing brace, so just add else block\n        finalReturn = `\\n  else {\\n    // Default case - no conditions matched\\n${generateDefaultCaseEvaluation()}\\n  }`;\n      } else {\n        // Use else block for no-match handling\n        finalReturn = `\\n  else {\\n    ${generateNoMatchHandler()}\\n  }`;\n      }\n    }\n  }\n\n  const sanitizedId = sanitizeId(node.id);\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  ${resultDeclaration}\n\n  ${conditionBranches}${finalReturn}\n}\n`;\n}\n","import type { JDMNode, JDMDecision } from '../parser';\nimport type { CompilationContext, AssemblyScriptCode } from '../types';\nimport { sanitizeId } from '../utils';\nimport { compileDecisionTableNode } from './decision-table';\nimport { compileSwitchNode } from './switch';\nimport { compileInputNode } from './input';\nimport { compileExpressionNode } from './expression';\nimport { compileFunctionNode } from './function';\nimport { buildGraph, getEvaluationOrder } from '../graph';\n\n/**\n * Generate a unique prefix for sub-decision node IDs to avoid naming conflicts.\n */\nfunction decisionNodePrefix(nodeId: string): string {\n  return `sub_${sanitizeId(nodeId)}_`;\n}\n\n/**\n * Generate the sub-decision entry point function that contains the actual evaluation logic.\n */\nfunction generateSubDecisionEntryPoint(\n  node: JDMNode,\n  context: CompilationContext,\n  subDecision: JDMDecision,\n  prefix: string,\n): AssemblyScriptCode {\n  const sanitizedId = sanitizeId(node.id);\n\n  // Build the sub-decision graph and get evaluation order\n  const graph = buildGraph(subDecision);\n  // Catches circular sub-decision references at compile time for better error messages and\n  // fail-fast behavior, rather than discovering cycles at runtime with stack overflow.\n  const evaluationOrder = getEvaluationOrder(graph);\n\n  // Create a node lookup for quick access\n  const nodeMap = new Map(subDecision.nodes.map((n) => [n.id, n]));\n\n  // Generate evaluation code for each node in topological order\n  // Skip output nodes - they mark graph termination but don't perform computation\n  // Skip input nodes (input just passes context through)\n  const evaluationCode = evaluationOrder\n    .map((nodeId) => {\n      const subNode = nodeMap.get(nodeId);\n      if (!subNode || subNode.type === 'outputNode' || subNode.type === 'inputNode') {\n        return '';\n      }\n      const prefixedId = prefix + sanitizeId(nodeId);\n      // Store node result in context under $nodes.<nodeName>\n      return `  ctx.set(\"$nodes.${subNode.name}\", evaluateNode_${prefixedId}(ctx));`;\n    })\n    .filter(Boolean)\n    .join('\\n');\n\n  // Find the last non-input, non-output node that was evaluated to return its result\n  const evaluatedNodes = evaluationOrder.filter((id) => {\n    const subNode = nodeMap.get(id);\n    if (!subNode) {\n      return false;\n    }\n    return subNode.type !== 'inputNode' && subNode.type !== 'outputNode';\n  });\n\n  // Determine what to return:\n  // - If there are evaluated nodes, return the last one's result\n  // - Otherwise, return an empty object for passthrough graphs\n  let resultCode: string;\n  if (evaluatedNodes.length > 0) {\n    const lastNodeId = evaluatedNodes[evaluatedNodes.length - 1];\n    const lastNode = nodeMap.get(lastNodeId)!;\n    resultCode = `  let result = ctx.get(\"$nodes.${lastNode.name}\");`;\n  } else {\n    // For passthrough graphs (input->output with no intermediate nodes),\n    // return an empty object to indicate \"no transformation\"\n    //\n    // Can't return ctx.toValue: Returning ctx as-is would create circular reference when the\n    // result is merged back into parent context. Empty object signals \"pass through unchanged\".\n    resultCode = `  let result = Value.Object(new Map<string, Value>());`;\n  }\n\n  return `\n// Sub-decision entry point function for ${node.id}\nexport function evaluateSubDecision_${sanitizedId}(ctx: Context): Value {\n  // Evaluate the sub-decision graph\n${evaluationCode}\n\n  // Get the final result\n${resultCode}\n\n  return result;\n}\n`;\n}\n\n/**\n * Generate a wrapper function that handles caching, recursion detection, and delegates to the sub-decision entry point.\n */\nfunction generateDecisionNodeWrapper(\n  node: JDMNode,\n  subDecisionFunctionName: string,\n): AssemblyScriptCode {\n  const sanitizedId = sanitizeId(node.id);\n  const cacheKey = `\"evaluateNode_${sanitizedId}\"`;\n\n  return `\n// Wrapper function to evaluate sub-decision ${node.id}\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  // Check cache first to avoid redundant evaluation\n  if (ctx.decisionResults.has(${cacheKey})) {\n    return ctx.decisionResults.get(${cacheKey});\n  }\n\n  // Compile-time detection catches static cycles, but runtime detection is needed for dynamic\n  // sub-decision loading or conditional recursion based on input data.\n  if (ctx.decisionStack.includes(\"${sanitizedId}\")) {\n    const recursionPath = ctx.decisionStack.join(' -> ') + ' -> ' + \"${sanitizedId}\";\n    SetLastError(RuntimeErrorCode.EVALUATION_ERROR);\n    return Value.Null();\n  }\n\n  // Add to decision stack before evaluation\n  ctx.decisionStack.push(\"${sanitizedId}\");\n\n  // Evaluate the sub-decision\n  let result = ${subDecisionFunctionName}(ctx);\n\n  // Check for errors from sub-decision evaluation\n  if (hasError()) {\n    // Error occurred in sub-decision - propagate it up\n    // Remove from decision stack\n    const stackIndex = ctx.decisionStack.indexOf(\"${sanitizedId}\");\n    if (stackIndex >= 0) {\n      ctx.decisionStack.splice(stackIndex, 1);\n    }\n    return Value.Null();\n  }\n\n  // Store result in cache\n  ctx.decisionResults.set(${cacheKey}, result);\n\n  // Remove from decision stack after evaluation\n  const stackIndex = ctx.decisionStack.indexOf(\"${sanitizedId}\");\n  if (stackIndex >= 0) {\n    ctx.decisionStack.splice(stackIndex, 1);\n  }\n\n  return result;\n}\n`;\n}\n\n/**\n * Compile a sub-decision node.\n *\n * Sub-decision nodes allow a decision to call another decision as part of its\n * evaluation. This function generates code that:\n * 1. Loads the referenced sub-decision JDM\n * 2. Recursively compiles all nodes in the sub-decision\n * 3. Creates a wrapper function to invoke the sub-decision\n * 4. Returns the code for both the wrapper and the sub-decision logic\n *\n * @param node - The JDM sub-decision node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code for the sub-decision\n */\nexport function compileDecisionNode(\n  node: JDMNode,\n  context: CompilationContext,\n): AssemblyScriptCode {\n  // Check for cycles in the decision graph\n  if (context.decisionPath.includes(node.id)) {\n    throw new Error(\n      `Circular dependency detected in decision graph: ${context.decisionPath.join(' -> ')} -> ${node.id}`,\n    );\n  }\n\n  // Extract the sub-decision reference key from the decision node content\n  const subDecisionKey = node.content?.key;\n  if (!subDecisionKey) {\n    throw new Error(\n      `Decision node ${node.id} has no content.key - cannot determine which decision to call`,\n    );\n  }\n\n  // Check if this sub-decision JDM has already been loaded (caching the parsed JDM)\n  // We don't cache the generated code because each reference needs its own function names\n  // But we can cache the parsed JDM to avoid re-parsing\n  let subDecision: JDMDecision;\n\n  // Add to decision path for cycle detection\n  context.decisionPath.push(node.id);\n\n  try {\n    // Load the sub-decision JDM using the loader\n    subDecision = context.loadDecision(subDecisionKey);\n\n    // Find the input and output nodes in the sub-decision\n    const inputNode = subDecision.nodes.find((n) => n.type === 'inputNode');\n    const outputNodes = subDecision.nodes.filter((n) => n.type === 'outputNode');\n\n    if (!inputNode) {\n      throw new Error(`Sub-decision ${subDecisionKey} has no input node`);\n    }\n\n    if (outputNodes.length === 0) {\n      throw new Error(`Sub-decision ${subDecisionKey} has no output nodes`);\n    }\n\n    // Check if this sub-decision has already been compiled (for caching)\n    const cachedFunctionName = context.compiledSubDecisions.get(subDecisionKey);\n    if (cachedFunctionName) {\n      // Sub-decision was already compiled, just generate a wrapper that calls the cached entry point\n      const wrapperCode = generateDecisionNodeWrapper(node, cachedFunctionName);\n      return wrapperCode;\n    }\n\n    // Add unique prefix to sub-decision node IDs to avoid conflicts\n    const prefix = decisionNodePrefix(node.id);\n    const sanitizedId = sanitizeId(node.id);\n    const subDecisionFunctionName = `evaluateSubDecision_${sanitizedId}`;\n\n    // Cache the entry point function name for reuse\n    context.compiledSubDecisions.set(subDecisionKey, subDecisionFunctionName);\n\n    // Create a modified context for recursive compilation. Sub-decisions need isolated compilation\n    // state (separate decision path, separate compiled cache) to avoid conflicts with parent decision\n    // while sharing global settings.\n    const subContext: CompilationContext = {\n      ...context,\n      decisionPath: [...context.decisionPath],\n    };\n\n    // Compile each node in the sub-decision\n    let subCompiled = '';\n    for (const subNode of subDecision.nodes) {\n      const nodeType = subNode.type;\n\n      // Skip output nodes - they're just markers\n      if (nodeType === 'outputNode') {\n        continue;\n      }\n\n      // Create a prefixed version of the node to avoid ID conflicts\n      const prefixedNode = {\n        ...subNode,\n        id: prefix + subNode.id,\n      };\n\n      // Compile the node based on its type\n      switch (nodeType) {\n        case 'inputNode':\n          subCompiled += compileInputNode(prefixedNode, context);\n          break;\n        case 'decisionTableNode':\n          subCompiled += compileDecisionTableNode(prefixedNode, context);\n          break;\n        case 'switchNode':\n          subCompiled += compileSwitchNode(prefixedNode, context);\n          break;\n        case 'expressionNode':\n          subCompiled += compileExpressionNode(prefixedNode, context);\n          break;\n        case 'functionNode':\n          subCompiled += compileFunctionNode(prefixedNode, context);\n          break;\n        case 'decisionNode':\n          // Recursive sub-decision\n          subCompiled += compileDecisionNode(prefixedNode, subContext);\n          break;\n        default:\n          // Output nodes don't need compilation\n          break;\n      }\n    }\n\n    // Generate the sub-decision entry point function\n    const entryPointCode = generateSubDecisionEntryPoint(node, context, subDecision, prefix);\n\n    // Generate the wrapper function that handles caching, recursion detection, and delegates\n    const wrapperCode = generateDecisionNodeWrapper(node, subDecisionFunctionName);\n\n    const completeCode = wrapperCode + entryPointCode + subCompiled;\n\n    // Return the complete code (wrapper + entry point + sub-decision node functions)\n    return completeCode;\n  } finally {\n    // Remove from decision path (backtracking)\n    const pathIndex = context.decisionPath.indexOf(node.id);\n    if (pathIndex !== -1) {\n      context.decisionPath.splice(pathIndex, 1);\n    }\n  }\n}\n","/**\n * Compile-time validation for decision models.\n *\n * This module provides functions to perform static analysis of JDM structure\n * and references at compile time. These checks detect missing references,\n * undeclared identifiers, and unassigned outputs before code generation.\n *\n * These functions operate on ASTs and CompilationContext - they do NOT\n * execute at runtime. For runtime data validation, see runtime-validation-codegen.ts.\n */\n\nimport type { ExpressionAST, Identifier } from './ast-types';\nimport { CompilationError, ErrorCode, ErrorCollector, type SourceLocation } from './errors';\nimport type { CompilationContext } from './types';\n\n/**\n * Collect all identifier references from an expression AST.\n *\n * This function walks the AST and collects all variable/field references\n * that need to be resolved from the context. It handles:\n * - Simple identifiers: `age`, `name`\n * - Member access: `customer.age`, `order.items[0].price`\n *\n * @param ast - The expression AST to analyze\n * @returns Set of all identifier names referenced in the expression\n */\nexport function collectIdentifiers(ast: ExpressionAST): Set<string> {\n  const identifiers = new Set<string>();\n  collectIdentifiersRecursive(ast, identifiers);\n  return identifiers;\n}\n\n/**\n * Recursively collect identifiers from an AST node.\n */\nfunction collectIdentifiersRecursive(ast: ExpressionAST, identifiers: Set<string>): void {\n  switch (ast.type) {\n    case 'Identifier': {\n      const ident = ast as Identifier;\n      identifiers.add(ident.name);\n      break;\n    }\n\n    case 'MemberAccess':\n      // For member access like `customer.age`, we need to track the base object `customer`\n      collectIdentifiersRecursive((ast as any).object, identifiers);\n      // The property name is a literal, not an identifier\n      break;\n\n    case 'IndexAccess':\n      // For index access like `items[0]`, we need the base object\n      collectIdentifiersRecursive((ast as any).object, identifiers);\n      // The index is an expression that may contain identifiers\n      collectIdentifiersRecursive((ast as any).index, identifiers);\n      break;\n\n    case 'BinaryOp':\n      collectIdentifiersRecursive((ast as any).left, identifiers);\n      collectIdentifiersRecursive((ast as any).right, identifiers);\n      break;\n\n    case 'UnaryOp':\n      collectIdentifiersRecursive((ast as any).operand, identifiers);\n      break;\n\n    case 'TernaryOp':\n      collectIdentifiersRecursive((ast as any).condition, identifiers);\n      collectIdentifiersRecursive((ast as any).consequent, identifiers);\n      collectIdentifiersRecursive((ast as any).alternate, identifiers);\n      break;\n\n    case 'FunctionCall':\n      collectIdentifiersRecursive((ast as any).callee, identifiers);\n      for (const arg of (ast as any).args) {\n        collectIdentifiersRecursive(arg, identifiers);\n      }\n      break;\n\n    case 'ArrayLiteral':\n      for (const element of (ast as any).elements) {\n        collectIdentifiersRecursive(element, identifiers);\n      }\n      break;\n\n    case 'ObjectLiteral':\n      for (const [_key, value] of Object.entries((ast as any).properties)) {\n        collectIdentifiersRecursive(value as ExpressionAST, identifiers);\n      }\n      break;\n\n    case 'TemplateLiteral':\n      for (const part of (ast as any).parts) {\n        if (typeof part === 'object') {\n          // It's an expression\n          collectIdentifiersRecursive(part as ExpressionAST, identifiers);\n        }\n        // String literals are ignored\n      }\n      break;\n\n    case 'Interval':\n      collectIdentifiersRecursive((ast as any).start, identifiers);\n      collectIdentifiersRecursive((ast as any).end, identifiers);\n      break;\n\n    // Literals don't reference identifiers\n    case 'NumberLiteral':\n    case 'StringLiteral':\n    case 'BooleanLiteral':\n    case 'NullLiteral':\n    case 'DollarRef':\n    case 'HashRef':\n      // No identifiers to collect\n      break;\n\n    default:\n      throw new Error(`Unknown AST node type: ${(ast as any).type}`);\n  }\n}\n\n/**\n * Validate that all referenced identifiers exist in the input schema.\n *\n * This function checks that all input references in expressions are declared\n * in the input schema. It builds a set of expected input fields from the\n * flattened layout and compares it against the identifiers used in expressions.\n *\n * @param referencedIdentifiers - Set of identifiers used in expressions\n * @param context - The compilation context containing the input schema\n * @param location - Source location for error reporting\n * @throws CompilationError if any referenced input is not declared\n */\nexport function validateInputReferences(\n  referencedIdentifiers: Set<string>,\n  context: CompilationContext,\n  location?: SourceLocation,\n): void {\n  // Build a set of all expected input fields from the flattened layout\n  const expectedInputs = new Set<string>();\n\n  // Add all top-level fields (e.g., \"age\", \"name\", \"customer\")\n  for (const field of context.inputLayout.fields) {\n    const parts = field.path.split('.');\n    expectedInputs.add(parts[0]); // Add the top-level field name\n\n    // Also add the full path for cases like \"customer.age\"\n    expectedInputs.add(field.path);\n  }\n\n  // Check each referenced identifier\n  const missingInputs: string[] = [];\n\n  for (const identifier of referencedIdentifiers) {\n    // $ is the unary context variable in decision table cells, # is the iteration variable\n    // in higher-order functions (map, filter, etc.). Both are implicit and don't need schema\n    // declaration.\n    if (identifier === '$' || identifier === '#') {\n      continue;\n    }\n\n    // Check if this identifier is declared\n    let found = false;\n    // Check exact match first\n    if (expectedInputs.has(identifier)) {\n      found = true;\n    } else {\n      // Check if it's a prefix match (e.g., \"customer\" matches \"customer.age\")\n      for (const expected of expectedInputs) {\n        if (expected.startsWith(identifier + '.')) {\n          found = true;\n          break;\n        }\n      }\n    }\n\n    if (!found) {\n      missingInputs.push(identifier);\n    }\n  }\n\n  // If we found missing inputs, throw an error\n  if (missingInputs.length > 0) {\n    const missingList = missingInputs\n      .sort()\n      .map((id) => `\"${id}\"`)\n      .join(', ');\n    const message =\n      missingInputs.length === 1\n        ? `Input reference \"${missingInputs[0]}\" is not declared in the input schema`\n        : `Input references are not declared in the input schema: ${missingList}`;\n\n    throw new CompilationError(\n      message,\n      ErrorCode.UNKNOWN_FIELD,\n      {\n        ...location,\n        field: 'inputs',\n      },\n      { missingInputs: missingInputs as any },\n    );\n  }\n}\n\n/**\n * Collect all output assignments from a decision.\n *\n * This function walks through all nodes in the decision and collects\n * the output paths that are assigned by expression nodes and decision table nodes.\n *\n * @param context - The compilation context\n * @returns Set of all output paths assigned by the decision\n */\nexport function collectOutputAssignments(\n  context: CompilationContext,\n  errorCollector?: ErrorCollector,\n): Set<string> {\n  const assignedOutputs = new Set<string>();\n\n  for (const node of context.jdm.nodes) {\n    const nodeType = node.type;\n\n    try {\n      if (nodeType === 'expressionNode') {\n        // Collect output assignments from expression nodes\n        const expressions = node.content.expressions as Array<{ key: string; value: string }>;\n        for (const expr of expressions) {\n          assignedOutputs.add(expr.key);\n        }\n      } else if (nodeType === 'decisionTableNode') {\n        // Collect output fields from decision table nodes\n        const content = node.content as any;\n        if (content.outputs) {\n          for (const output of content.outputs) {\n            if (output.field) {\n              assignedOutputs.add(output.field);\n            }\n          }\n        }\n      }\n      // Switch nodes and sub-decision nodes delegate to other nodes which will be processed\n      // separately, so their outputs will be collected from those target nodes.\n    } catch (error) {\n      // Collect errors for batch reporting rather than swallowing them silently\n      if (errorCollector) {\n        const err =\n          error instanceof CompilationError\n            ? error\n            : new CompilationError(\n                `Failed to collect output assignments from node \"${node.name || node.id}\": ${error instanceof Error ? error.message : String(error)}`,\n                ErrorCode.PARSE_ERROR,\n                { nodeId: node.id, nodeName: node.name },\n              );\n        errorCollector.add(err);\n      }\n    }\n  }\n\n  return assignedOutputs;\n}\n\n/**\n * Validate that all expected outputs from the schema are assigned.\n *\n * This function checks that all output fields defined in the output schema\n * are actually assigned by the decision logic. It builds a set of expected\n * output fields from the flattened layout and compares it against the\n * outputs that are assigned by expression nodes and decision table nodes.\n *\n * @param assignedOutputs - Set of output paths assigned by the decision\n * @param context - The compilation context containing the output schema\n * @param location - Source location for error reporting\n * @throws CompilationError if any expected output is not assigned\n */\nexport function validateOutputReferences(\n  assignedOutputs: Set<string>,\n  context: CompilationContext,\n  location?: SourceLocation,\n): void {\n  // Build a set of all expected output fields from the flattened layout\n  const expectedOutputs = new Set<string>();\n\n  // Add all output fields from the layout\n  for (const field of context.outputLayout.fields) {\n    expectedOutputs.add(field.path);\n  }\n\n  // Check each expected output\n  const missingOutputs: string[] = [];\n\n  for (const output of expectedOutputs) {\n    // Prefix matching handles nested object assignment - if schema expects \"customer\" but decision\n    // assigns \"customer.name\" and \"customer.age\", those partial assignments satisfy the requirement\n    let found = false;\n\n    // Check exact match\n    if (assignedOutputs.has(output)) {\n      found = true;\n    } else {\n      // Check if any assigned output is a nested field of the expected output\n      // e.g., if \"customer\" is expected and \"customer.name\" is assigned\n      for (const assigned of assignedOutputs) {\n        if (assigned.startsWith(output + '.')) {\n          found = true;\n          break;\n        }\n      }\n    }\n\n    if (!found) {\n      missingOutputs.push(output);\n    }\n  }\n\n  // If we found missing outputs, throw an error\n  if (missingOutputs.length > 0) {\n    const missingList = missingOutputs\n      .sort()\n      .map((field) => `\"${field}\"`)\n      .join(', ');\n    const message =\n      missingOutputs.length === 1\n        ? `Output field \"${missingOutputs[0]}\" is declared in the output schema but not assigned by the decision`\n        : `Output fields are declared in the output schema but not assigned by the decision: ${missingList}`;\n\n    throw new CompilationError(\n      message,\n      ErrorCode.UNKNOWN_FIELD,\n      {\n        ...location,\n        field: 'outputs',\n      },\n      { missingOutputs: missingOutputs as any },\n    );\n  }\n}\n\n/**\n * Validate output assignments for all nodes in a decision.\n *\n * This is a convenience function that validates that all expected outputs\n * from the output schema are actually assigned by the decision logic.\n *\n * @param context - The compilation context\n * @throws CompilationError if any expected output is not assigned or if errors occur during collection\n */\nexport function validateAllOutputReferences(context: CompilationContext): void {\n  const errorCollector = new ErrorCollector();\n\n  // Collect all output assignments, gathering any errors\n  const assignedOutputs = collectOutputAssignments(context, errorCollector);\n\n  // Validate that all expected outputs are assigned\n  try {\n    validateOutputReferences(assignedOutputs, context);\n  } catch (error) {\n    if (error instanceof CompilationError) {\n      errorCollector.add(error);\n    } else {\n      throw error;\n    }\n  }\n\n  // Throw all collected errors (parse errors + validation errors)\n  errorCollector.throwIfErrors();\n}\n\n/**\n * Validate input references for all expression nodes in a decision.\n *\n * This is a convenience function that validates all expressions in the decision\n * at once, collecting all errors before throwing.\n *\n * @param context - The compilation context\n * @throws CompilationError if any expression references an undeclared input or contains parse errors\n */\nexport function validateAllInputReferences(context: CompilationContext): void {\n  const errorCollector = new ErrorCollector();\n  const inputLayout = context.inputLayout;\n  const expectedInputs = new Set<string>();\n\n  // Build set of expected inputs\n  for (const field of inputLayout.fields) {\n    const parts = field.path.split('.');\n    expectedInputs.add(parts[0]);\n    expectedInputs.add(field.path);\n  }\n\n  // Collect all references and validate them\n  const allIdentifiers = new Set<string>();\n\n  // Helper to create a parse error with location context\n  const createParseError = (\n    nodeId: string,\n    nodeName: string | undefined,\n    expression: string,\n    error: unknown,\n  ): CompilationError => {\n    if (error instanceof CompilationError) {\n      // Preserve original error but add node context if missing\n      if (!error.location?.nodeId) {\n        return new CompilationError(error.message, error.code, { nodeId, nodeName }, error.context);\n      }\n      return error;\n    }\n    return new CompilationError(\n      `Failed to parse expression \"${expression}\": ${error instanceof Error ? error.message : String(error)}`,\n      ErrorCode.PARSE_ERROR,\n      { nodeId, nodeName },\n    );\n  };\n\n  // Process all nodes that contain expressions\n  for (const node of context.jdm.nodes) {\n    const nodeType = node.type;\n\n    try {\n      if (nodeType === 'expressionNode') {\n        // Collect identifiers from all expressions in the node\n        const expressions = node.content.expressions as Array<{ key: string; value: string }>;\n        for (const expr of expressions) {\n          try {\n            const ast = context.parseExpression(expr.value);\n            const identifiers = collectIdentifiers(ast);\n            for (const id of identifiers) {\n              allIdentifiers.add(id);\n            }\n          } catch (error) {\n            errorCollector.add(createParseError(node.id, node.name, expr.value, error));\n          }\n        }\n      } else if (nodeType === 'decisionTableNode') {\n        // Collect identifiers from decision table conditions\n        const content = node.content as any;\n        if (content.rules) {\n          for (const rule of content.rules) {\n            if (rule.input) {\n              for (const [_key, value] of Object.entries(rule.input as Record<string, string>)) {\n                if (\n                  value &&\n                  typeof value === 'string' &&\n                  !['true', 'false', 'null'].includes(value.toLowerCase())\n                ) {\n                  try {\n                    const ast = context.parseExpression(value);\n                    const identifiers = collectIdentifiers(ast);\n                    for (const id of identifiers) {\n                      allIdentifiers.add(id);\n                    }\n                  } catch (error) {\n                    // Collect parse errors for batch reporting\n                    errorCollector.add(createParseError(node.id, node.name, value, error));\n                  }\n                }\n              }\n            }\n          }\n        }\n      } else if (nodeType === 'switchNode') {\n        // Collect identifiers from switch conditions\n        const content = node.content as any;\n        if (content.cases) {\n          for (const switchCase of content.cases) {\n            if (switchCase.condition && switchCase.condition.expression) {\n              try {\n                const ast = context.parseExpression(switchCase.condition.expression);\n                const identifiers = collectIdentifiers(ast);\n                for (const id of identifiers) {\n                  allIdentifiers.add(id);\n                }\n              } catch (error) {\n                // Collect parse errors for batch reporting\n                errorCollector.add(\n                  createParseError(node.id, node.name, switchCase.condition.expression, error),\n                );\n              }\n            }\n          }\n        }\n      }\n    } catch (error) {\n      // Collect errors from node processing for batch reporting\n      const err =\n        error instanceof CompilationError\n          ? error\n          : new CompilationError(\n              `Failed to process node \"${node.name || node.id}\": ${error instanceof Error ? error.message : String(error)}`,\n              ErrorCode.PARSE_ERROR,\n              { nodeId: node.id, nodeName: node.name },\n            );\n      errorCollector.add(err);\n    }\n  }\n\n  // Validate all collected identifiers\n  try {\n    validateInputReferences(allIdentifiers, context);\n  } catch (error) {\n    if (error instanceof CompilationError) {\n      errorCollector.add(error);\n    } else {\n      throw error;\n    }\n  }\n\n  // Throw all collected errors (parse errors + validation errors)\n  errorCollector.throwIfErrors();\n}\n","/**\n * Switch branch detection algorithm for JDM decisions.\n *\n * This module identifies nodes that are exclusively reachable through switch node branches.\n * These nodes are marked as \"switchBranchTargets\" and should be skipped during the main\n * evaluation loop because the switch node evaluates them inline when taking a branch.\n *\n * WHY: Prevent double-evaluation - switch nodes evaluate branches inline, so downstream\n * nodes must be skipped in the main evaluation loop to avoid executing them twice.\n *\n * OPTIMIZATION: Uses a single forward traversal through the graph to mark all nodes\n * reachable from switch branches. This is O(n + m) instead of O(s × b × (n + m))\n * where s = switches, b = branches, n = nodes, m = edges.\n */\n\nimport type { JDMDecision, JDMEdge } from './parser';\n\n/**\n * Build an adjacency map for fast edge lookups.\n * Maps each source node ID to an array of target node IDs.\n *\n * @param edges - All edges in the decision graph\n * @returns Map from source node ID to array of target node IDs\n */\nfunction buildAdjacencyMap(edges: JDMEdge[]): Map<string, string[]> {\n  const adjacencyMap = new Map<string, string[]>();\n\n  for (const edge of edges) {\n    const targets = adjacencyMap.get(edge.sourceId);\n    if (targets) {\n      targets.push(edge.targetId);\n    } else {\n      adjacencyMap.set(edge.sourceId, [edge.targetId]);\n    }\n  }\n\n  return adjacencyMap;\n}\n\n/**\n * Find all nodes that are exclusively reachable through switch node branches.\n *\n * Optimized algorithm:\n * 1. Build adjacency map once for O(1) edge lookups\n * 2. Identify all direct targets of switch nodes\n * 3. Use BFS with efficient queue operations to traverse from all switch targets\n * 4. Marks all nodes reachable from switch branches in a single traversal\n *\n * Time complexity: O(n + m) where n = nodes, m = edges\n * Space complexity: O(n + m) for adjacency map and visited set\n *\n * @param jdm - The parsed JDM decision\n * @returns Set of node IDs that are switch branch targets\n */\nexport function findSwitchBranchTargets(jdm: JDMDecision): Set<string> {\n  // Build adjacency map once for O(1) lookups instead of O(m) filtering\n  const adjacencyMap = buildAdjacencyMap(jdm.edges);\n\n  // Find all direct targets of switch nodes\n  const switchNodes = jdm.nodes.filter((n) => n.type === 'switchNode');\n  const switchBranchTargets = new Set<string>();\n\n  // Collect all direct switch targets to start BFS from\n  const bfsQueue: string[] = [];\n  for (const switchNode of switchNodes) {\n    const targets = adjacencyMap.get(switchNode.id) || [];\n    for (const targetId of targets) {\n      if (!switchBranchTargets.has(targetId)) {\n        switchBranchTargets.add(targetId);\n        bfsQueue.push(targetId);\n      }\n    }\n  }\n\n  // Single BFS traversal from all switch targets\n  // Use index-based iteration instead of shift() to avoid O(n) array operations\n  let queueIndex = 0;\n  while (queueIndex < bfsQueue.length) {\n    const currentId = bfsQueue[queueIndex++];\n\n    // Get all outgoing edges using O(1) map lookup\n    const targets = adjacencyMap.get(currentId) || [];\n    for (const targetId of targets) {\n      if (!switchBranchTargets.has(targetId)) {\n        switchBranchTargets.add(targetId);\n        bfsQueue.push(targetId);\n      }\n    }\n  }\n\n  return switchBranchTargets;\n}\n","/**\n * Result selection logic for JDM decisions.\n *\n * This module determines how to compute the final result from the evaluation order.\n * It handles different scenarios:\n * - Switch nodes that route to different branches\n * - Decision tables with collect-style hit policies\n * - PassThrough nodes that accumulate context\n * - Regular nodes that return their result directly\n */\n\nimport type { JDMNode } from './parser';\n\n/**\n * Check if a decision table node uses a collect-style hit policy.\n * Collect-style policies return arrays and need to be wrapped in an object with the node name as key.\n */\nexport function isCollectStyleHitPolicy(node: JDMNode): boolean {\n  if (node.type !== 'decisionTableNode') {\n    return false;\n  }\n  const hitPolicy = node.content?.hitPolicy || 'first';\n  return ['collect', 'ruleOrder', 'outputOrder', 'priority'].includes(hitPolicy);\n}\n\n/**\n * Options for result code generation.\n */\nexport interface ResultSelectionOptions {\n  /** Map of node IDs to JDMNode objects */\n  nodeMap: Map<string, JDMNode>;\n  /** Ordered list of node IDs that were actually evaluated (not skipped) */\n  evaluatedNodes: string[];\n  /** Set of node IDs that are switch branch targets (skipped in main loop) */\n  switchBranchTargets: Set<string>;\n}\n\n/**\n * Determine which node's result should be used as the final output.\n *\n * Priority order:\n * 1. If there's a switch node, use its result (it handles routing)\n * 2. Otherwise, use the last non-input, non-output node result\n * 3. Fallback to output node or null\n *\n * @param options - The selection options\n * @returns The node to use for the final result, or null if fallback needed\n */\nexport function selectResultNode(options: ResultSelectionOptions): JDMNode | null {\n  const { nodeMap, evaluatedNodes } = options;\n\n  // Check if there's a switch node that routes to different branches\n  // Only switch nodes truly route - decision tables in a linear flow are NOT routing nodes\n  const switchNodes = evaluatedNodes.filter((id) => {\n    const node = nodeMap.get(id);\n    return node && node.type === 'switchNode';\n  });\n\n  // When there are switch nodes, use the switch result since it handles branch evaluation\n  if (switchNodes.length > 0) {\n    // Use the last switch node's result (it handles branch routing to terminal nodes)\n    const lastSwitchNodeId = switchNodes[switchNodes.length - 1];\n    return nodeMap.get(lastSwitchNodeId) || null;\n  }\n\n  // Use the last evaluated node\n  if (evaluatedNodes.length > 0) {\n    const lastNodeId = evaluatedNodes[evaluatedNodes.length - 1];\n    return nodeMap.get(lastNodeId) || null;\n  }\n\n  return null;\n}\n\n/**\n * Generate AssemblyScript code to extract the final result from a node.\n *\n * Handles:\n * - Collect-style hit policies (return array directly)\n * - PassThrough nodes (return accumulated context)\n * - Regular nodes (return node result directly)\n *\n * @param node - The node to generate result code for\n * @returns AssemblyScript code string\n */\nexport function generateResultCode(node: JDMNode): string {\n  // COLLECT-style hit policies return arrays directly (not wrapped in an object with the\n  // node name as key) to match zen-engine behavior where the array IS the result\n  if (isCollectStyleHitPolicy(node)) {\n    return `  let result = ctx.get(\"$nodes.${node.name}\");`;\n  }\n\n  // If the node has passThrough enabled, return the accumulated context\n  // This includes all values from previous nodes that were merged via passThrough\n  //\n  // Both 'no match with passThrough' and 'valid result' return Objects, so we use\n  // the __passthrough marker a marker to distinguish these cases while maintaining\n  // type safety.\n  const hasPassThrough = node.content?.passThrough === true;\n  if (hasPassThrough) {\n    return `  // Check node result for passThrough handling\n  let __nodeResult = ctx.get(\"$nodes.${node.name}\");\n  let result: Value;\n  \n  // Check if this is a \"passthrough signal\" (no match with passThrough enabled)\n  if (!__nodeResult.isNull() && __nodeResult.isObject()) {\n    let __obj = __nodeResult.asObject();\n    if (__obj.has(\"__passthrough\") && __obj.get(\"__passthrough\").asBool()) {\n      // Node signaled to use passthrough - return accumulated context\n      let __finalResult = new Map<string, Value>();\n      const __ctxKeys = ctx.data.keys();\n      for (let __i = 0; __i < __ctxKeys.length; __i++) {\n        const __key = __ctxKeys[__i];\n        if (!__key.startsWith(\"$\") && __key !== \"#\" && __key !== \"acc\") {\n          __finalResult.set(__key, ctx.data.get(__key));\n        }\n      }\n      result = Value.Object(__finalResult);\n    } else {\n      // Valid result - build from accumulated context (passThrough merges input with output)\n      let __finalResult = new Map<string, Value>();\n      const __ctxKeys = ctx.data.keys();\n      for (let __i = 0; __i < __ctxKeys.length; __i++) {\n        const __key = __ctxKeys[__i];\n        if (!__key.startsWith(\"$\") && __key !== \"#\" && __key !== \"acc\") {\n          __finalResult.set(__key, ctx.data.get(__key));\n        }\n      }\n      result = Value.Object(__finalResult);\n    }\n  } else if (__nodeResult.isNull()) {\n    // Node returned null (error case) - return null, don't passthrough\n    result = Value.Null();\n  } else {\n    // Non-object result - return as-is\n    result = __nodeResult;\n  }`;\n  }\n\n  return `  let result = ctx.get(\"$nodes.${node.name}\");`;\n}\n\n/**\n * Generate fallback result code when no suitable node is found.\n *\n * @param outputNodeIds - Set of output node IDs\n * @param sanitizeId - Function to sanitize node IDs for code generation\n * @returns AssemblyScript code string\n */\nexport function generateFallbackResultCode(\n  outputNodeIds: Set<string>,\n  sanitizeId: (id: string) => string,\n): string {\n  if (outputNodeIds.size > 0) {\n    // Fallback: evaluate output node if no other nodes were evaluated\n    const outputNodeId = Array.from(outputNodeIds)[0];\n    const sanitizedOutputId = sanitizeId(outputNodeId);\n    return `  let result = evaluateNode_${sanitizedOutputId}(ctx);`;\n  }\n  return '  let result = Value.Null();';\n}\n","/**\n * Main compilation orchestrator for JDM decisions.\n *\n * This module coordinates the compilation pipeline, bringing together:\n * - Graph building and topological ordering\n * - Node compilation\n * - Switch branch detection\n * - Result selection\n * - Memory layout code generation\n *\n * The orchestrator itself does minimal work - it delegates to specialized modules\n * for each concern.\n */\n\nimport type { JDMDecision, JDMNode } from './parser';\nimport type { CompilationContext, AssemblyScriptCode } from './types';\nimport { buildGraph, getEvaluationOrder } from './graph';\nimport { compileInputNode, compileOutputNode } from './nodes/input';\nimport { compileDecisionTableNode } from './nodes/decision-table';\nimport { compileSwitchNode } from './nodes/switch';\nimport { compileDecisionNode } from './nodes/decision';\nimport { compileExpressionNode } from './nodes/expression';\nimport { compileFunctionNode } from './nodes/function';\nimport { sanitizeId } from './utils';\nimport { validateAllInputReferences, validateAllOutputReferences } from './compile-time-validation';\nimport { generatePassThroughMergeCode, generateNestedPathAssignment } from './code-generators';\nimport { findSwitchBranchTargets } from './switch-branch-detection';\nimport {\n  selectResultNode,\n  generateResultCode,\n  generateFallbackResultCode,\n} from './result-selection';\n\n// ============================================================================\n// Memory Layout Constants\n// ============================================================================\n\n/**\n * Custom heap start offset in bytes (512KB).\n *\n * The custom heap starts at 512KB to avoid conflicts with:\n * 1. AssemblyScript's internal runtime heap (~50KB - ~192KB)\n * 2. Host-written input buffer region (192KB - 512KB, up to 320KB)\n *\n * This ensures clear separation of memory regions and prevents\n * the AS runtime from interfering with our custom heap allocator.\n * Host must grow memory to at least 768KB to use this layout.\n */\nconst CUSTOM_HEAP_START_BYTES = 512 * 1024;\n\n/**\n * Compile a JDM decision to AssemblyScript code.\n *\n * This function orchestrates compilation of all nodes in the decision graph\n * and generates the complete AssemblyScript module.\n *\n * @param jdm - The parsed JDM decision\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileDecision(jdm: JDMDecision, context: CompilationContext): AssemblyScriptCode {\n  // Build the graph\n  const graph = buildGraph(jdm);\n\n  // Get nodes in topological order to ensure dependencies are compiled before dependents\n  const evaluationOrder = getEvaluationOrder(graph);\n\n  // Validate references if enabled\n  if (context.options.validate !== false) {\n    validateAllInputReferences(context);\n    validateAllOutputReferences(context);\n  }\n\n  // Create a node lookup for quick access\n  const nodeMap = new Map(jdm.nodes.map((n) => [n.id, n]));\n\n  // Compile each node based on its type\n  const compiledCode = compileNodes(evaluationOrder, nodeMap, context);\n\n  // Generate helper functions for higher-order operations\n  const helperFunctionsCode = Array.from(context.helperFunctions.values()).join('\\n');\n\n  // Find nodes that are switch branch targets (should be skipped in main evaluation)\n  const switchBranchTargets = findSwitchBranchTargets(jdm);\n\n  // Generate evaluation code for each node in topological order\n  const evaluationCode = generateEvaluationCode(evaluationOrder, nodeMap, switchBranchTargets);\n\n  // Find output nodes (nodes with no outgoing edges)\n  const outputNodeIds = findOutputNodeIds(jdm);\n\n  // Find evaluated nodes (excluding input, output, and switch branch targets)\n  const evaluatedNodes = filterEvaluatedNodes(evaluationOrder, nodeMap, switchBranchTargets);\n\n  // Generate result selection code\n  const resultCode = generateResultSelectionCode(nodeMap, evaluatedNodes, outputNodeIds);\n\n  // Generate the complete AssemblyScript module\n  return generateModuleCode(helperFunctionsCode, compiledCode, evaluationCode, resultCode);\n}\n\n/**\n * Compile all nodes in evaluation order.\n */\nfunction compileNodes(\n  evaluationOrder: string[],\n  nodeMap: Map<string, JDMNode>,\n  context: CompilationContext,\n): string {\n  let compiledCode = '';\n\n  for (const nodeId of evaluationOrder) {\n    const node = nodeMap.get(nodeId);\n    if (!node) {\n      continue;\n    }\n\n    const nodeType = node.type;\n\n    switch (nodeType) {\n      case 'inputNode':\n        compiledCode += compileInputNode(node, context);\n        break;\n      case 'decisionTableNode':\n        compiledCode += compileDecisionTableNode(node, context);\n        break;\n      case 'switchNode':\n        compiledCode += compileSwitchNode(node, context);\n        break;\n      case 'decisionNode':\n        compiledCode += compileDecisionNode(node, context);\n        break;\n      case 'outputNode':\n        compiledCode += compileOutputNode(node, context);\n        break;\n      case 'expressionNode':\n        compiledCode += compileExpressionNode(node, context);\n        break;\n      case 'functionNode':\n        compiledCode += compileFunctionNode(node, context);\n        break;\n      default:\n        // Unknown node type - skip\n        break;\n    }\n  }\n\n  return compiledCode;\n}\n\n/**\n * Generate evaluation code for each node in topological order.\n * Skips output nodes and switch branch targets.\n */\nfunction generateEvaluationCode(\n  evaluationOrder: string[],\n  nodeMap: Map<string, JDMNode>,\n  switchBranchTargets: Set<string>,\n): string {\n  return evaluationOrder\n    .map((nodeId) => {\n      const node = nodeMap.get(nodeId);\n      if (!node || node.type === 'outputNode') {\n        return '';\n      }\n\n      // Skip nodes that are switch branch targets - they'll be evaluated by the switch\n      if (switchBranchTargets.has(nodeId)) {\n        return '';\n      }\n\n      return generateNodeEvaluationCode(node);\n    })\n    .filter(Boolean)\n    .join('\\n');\n}\n\n/**\n * Generate evaluation code for a single node.\n */\nfunction generateNodeEvaluationCode(node: JDMNode): string {\n  const sanitizedId = sanitizeId(node.id);\n\n  // Check if this node has passThrough enabled (decision tables and expression nodes)\n  const hasPassThrough = node.content?.passThrough === true;\n\n  // Store node result in context under $nodes.<nodeName>\n  let code = `  ctx.set(\"$nodes.${node.name}\", evaluateNode_${sanitizedId}(ctx));`;\n\n  // Handle outputPath - if specified, store the result at the given path\n  // This is used for collect-style decision tables to place array results at a nested path\n  const outputPath = node.content?.outputPath;\n  if (outputPath) {\n    // Check if it's a simple (non-nested) path or a nested path\n    if (!outputPath.includes('.')) {\n      // Simple path - just set directly in context\n      code += `\n  // Store node output at outputPath: ${outputPath} (simple path)\n  ctx.set(\"${outputPath}\", ctx.get(\"$nodes.${node.name}\"));`;\n    } else {\n      // Nested path - use shared helper to generate nested object structure\n      code += `\n  ${generateNestedPathAssignment(outputPath, `ctx.get(\"$nodes.${node.name}\")`)}`;\n    }\n  }\n\n  // If passThrough is enabled, merge the node's output properties back into the context\n  // This allows subsequent nodes to access the computed values directly\n  if (hasPassThrough) {\n    code += `\\n  ${generatePassThroughMergeCode(node.name)}`;\n  }\n\n  return code;\n}\n\n/**\n * Find output node IDs (nodes with no outgoing edges).\n */\nfunction findOutputNodeIds(jdm: JDMDecision): Set<string> {\n  const outputNodeIds = new Set<string>();\n  for (const node of jdm.nodes) {\n    const outgoingEdges = jdm.edges.filter((e) => e.sourceId === node.id);\n    if (outgoingEdges.length === 0) {\n      outputNodeIds.add(node.id);\n    }\n  }\n  return outputNodeIds;\n}\n\n/**\n * Filter evaluation order to get only nodes that were actually evaluated.\n */\nfunction filterEvaluatedNodes(\n  evaluationOrder: string[],\n  nodeMap: Map<string, JDMNode>,\n  switchBranchTargets: Set<string>,\n): string[] {\n  return evaluationOrder.filter((id) => {\n    const node = nodeMap.get(id);\n    if (!node) {\n      return false;\n    }\n    // Exclude input and output nodes\n    if (node.type === 'inputNode' || node.type === 'outputNode') {\n      return false;\n    }\n    // Exclude switch branch targets - they're evaluated by the switch\n    if (switchBranchTargets.has(id)) {\n      return false;\n    }\n    return true;\n  });\n}\n\n/**\n * Generate code to select and extract the final result.\n */\nfunction generateResultSelectionCode(\n  nodeMap: Map<string, JDMNode>,\n  evaluatedNodes: string[],\n  outputNodeIds: Set<string>,\n): string {\n  // Use the result-selection module to determine which node's result to use\n  const resultNode = selectResultNode({\n    nodeMap,\n    evaluatedNodes,\n    switchBranchTargets: new Set(), // Already filtered out\n  });\n\n  if (resultNode) {\n    return generateResultCode(resultNode);\n  }\n\n  return generateFallbackResultCode(outputNodeIds, sanitizeId);\n}\n\n/**\n * Generate the complete AssemblyScript module code.\n */\nfunction generateModuleCode(\n  helperFunctionsCode: string,\n  compiledCode: string,\n  evaluationCode: string,\n  resultCode: string,\n): string {\n  return `\nimport { Value } from './values';\nimport { Context, ScopedContext } from './context';\nimport {\n  addValues,\n  subtractValues,\n  multiplyValues,\n  divideValues,\n  moduloValues,\n  powerValues,\n  negateValue,\n  valuesEqual,\n  compareValues,\n  getProperty,\n  getIndex,\n  valueIn,\n  createInterval,\n  evaluateFunction,\n  makeArgs1,\n  makeArgs2,\n  makeArgs3\n} from './expressions';\nimport { SetLastError, SetLastErrorWithMessage, hasError, RuntimeErrorCode, initializeMemoryLayout, resetHeap } from './memory';\nimport { readValueMap, writeValue } from './arrays';\n\n${helperFunctionsCode}\n\n${compiledCode}\n\n// Main entry point for the compiled decision\n// Input: pointer to input data in WASM memory (serialized Map<string, Value>)\n// Returns: pointer to output data in WASM memory (serialized Value)\nexport function evaluate(inputPtr: usize): usize {\n  // Initialize memory layout for custom heap (used for output marshaling)\n  // Memory regions (from 0):\n  // +--------------------------+\n  // | Static data              | 0 - ~50KB (AS's __heap_base)\n  // +--------------------------+\n  // | AS runtime heap          | ~50KB - ~192KB (grows upward during evaluation)\n  // +--------------------------+\n  // | Input data buffer        | 192KB - 512KB (written by host, up to 320KB)\n  // +--------------------------+\n  // | Custom heap (ours)       | 512KB - (used for writeValue/marshaling)\n  // +--------------------------+\n  // The custom heap starts at 512KB to avoid conflicts with AS's internal heap\n  // and the host-written input buffer. Host must grow memory to at least 768KB.\n  initializeMemoryLayout(${CUSTOM_HEAP_START_BYTES}, 0);\n\n  // Reset heap for fresh evaluation\n  resetHeap();\n\n  // Read input from memory\n  let input = readValueMap(inputPtr);\n\n  // Create context with input data\n  let ctx = new Context(input);\n\n  // Evaluate the decision graph in topological order\n${evaluationCode}\n\n  // Get the final result\n${resultCode}\n  // Write result to output memory and return pointer\n  return writeValue(result);\n}\n`;\n}\n","/**\n * Caches compiled WASM modules keyed by source code + runtime + compiler options.\n * WASM compilation via AssemblyScript is expensive (~250ms per decision), so caching\n * identical compilations significantly improves the speed of iterative development\n * and testing.\n */\n\nimport { createHash } from 'crypto';\nimport {\n  existsSync,\n  mkdirSync,\n  readFileSync,\n  writeFileSync,\n  readdirSync,\n  statSync,\n  unlinkSync,\n} from 'fs';\nimport { join, dirname } from 'path';\n\n// Import runtime source strings to include in cache key\nimport {\n  RUNTIME_VALUES,\n  RUNTIME_CONTEXT,\n  RUNTIME_EXPRESSIONS,\n  RUNTIME_TABLES,\n  RUNTIME_MEMORY,\n  RUNTIME_STRINGS,\n  RUNTIME_ARRAYS,\n} from './runtime/index';\n\n// Package version - included in cache key to invalidate cache across compiler versions\nlet packageVersion: string = '';\n\nfunction getPackageVersion(): string {\n  if (packageVersion === '') {\n    try {\n      // Try to find package.json from this file's location\n      const packagePath = join(dirname(__dirname), '..', 'package.json');\n      const pkg = JSON.parse(readFileSync(packagePath, 'utf-8'));\n      packageVersion = pkg.version || 'unknown';\n    } catch {\n      packageVersion = 'unknown';\n    }\n  }\n  return packageVersion;\n}\n\n/**\n * Cache directory location\n */\nfunction getCacheDir(): string {\n  // Use node_modules/.cache/jdm-asm for caching\n  // This is a common convention and gets cleaned up with node_modules\n  const cacheDir = join(process.cwd(), 'node_modules', '.cache', 'jdm-asm');\n  return cacheDir;\n}\n\n/**\n * Ensure the cache directory exists\n * @throws Error if directory creation fails\n */\nfunction ensureCacheDir(): string {\n  const cacheDir = getCacheDir();\n  if (!existsSync(cacheDir)) {\n    try {\n      mkdirSync(cacheDir, { recursive: true });\n    } catch (error) {\n      const errorMsg = error instanceof Error ? error.message : String(error);\n      throw new Error(`Failed to create cache directory at ${cacheDir}: ${errorMsg}`);\n    }\n  }\n  return cacheDir;\n}\n\n/**\n * Compute a stable hash for cache key.\n */\nexport function computeCacheKey(\n  assemblyScriptCode: string,\n  options: { optimize?: boolean; debug?: boolean },\n): string {\n  const hash = createHash('sha256');\n\n  // Include package version\n  hash.update(`version:${getPackageVersion()}\\n`);\n\n  // Include compiler options\n  hash.update(`optimize:${options.optimize ?? true}\\n`);\n  hash.update(`debug:${options.debug ?? false}\\n`);\n\n  // Include all runtime source files: runtime code changes affect WASM output, so\n  // must be part of cache key\n  hash.update('---RUNTIME_VALUES---\\n');\n  hash.update(RUNTIME_VALUES);\n  hash.update('---RUNTIME_CONTEXT---\\n');\n  hash.update(RUNTIME_CONTEXT);\n  hash.update('---RUNTIME_EXPRESSIONS---\\n');\n  hash.update(RUNTIME_EXPRESSIONS);\n  hash.update('---RUNTIME_TABLES---\\n');\n  hash.update(RUNTIME_TABLES);\n  hash.update('---RUNTIME_MEMORY---\\n');\n  hash.update(RUNTIME_MEMORY);\n  hash.update('---RUNTIME_STRINGS---\\n');\n  hash.update(RUNTIME_STRINGS);\n  hash.update('---RUNTIME_ARRAYS---\\n');\n  hash.update(RUNTIME_ARRAYS);\n\n  // Include the generated AssemblyScript code\n  hash.update('---ASSEMBLYSCRIPT---\\n');\n  hash.update(assemblyScriptCode);\n\n  // Return first 32 characters of hex digest (128 bits - sufficient for cache key)\n  return hash.digest('hex').slice(0, 32);\n}\n\n/**\n * Cache entry format\n */\ninterface CacheEntry {\n  version: string;\n  timestamp: number;\n  binary: string; // Base64 encoded WASM binary\n  wat: string;\n}\n\n/**\n * Read cached WASM compilation result from disk if available\n */\nexport function readCacheFromDisk(cacheKey: string): { binary: Uint8Array; wat: string } | null {\n  const cacheDir = getCacheDir();\n  const cachePath = join(cacheDir, `${cacheKey}.json`);\n\n  if (!existsSync(cachePath)) {\n    return null;\n  }\n\n  try {\n    const content = readFileSync(cachePath, 'utf-8');\n    const entry: CacheEntry = JSON.parse(content);\n\n    // Version changes invalidate cache to prevent incompatible compiled code from being used\n    // when the compiler implementation changes between releases\n    if (entry.version !== getPackageVersion()) {\n      // Version mismatch, invalidate\n      unlinkSync(cachePath);\n      return null;\n    }\n\n    // Decode binary from base64\n    const binary = new Uint8Array(Buffer.from(entry.binary, 'base64'));\n    return { binary, wat: entry.wat };\n  } catch (error) {\n    // Distinguish between different error types for better diagnostics\n    if (error && typeof error === 'object' && 'code' in error) {\n      const code = (error as { code: string }).code;\n\n      // ENOENT (file not found) is benign - cache miss\n      if (code === 'ENOENT') {\n        return null;\n      }\n\n      // EACCES/EPERM (permission denied) should warn the user\n      if (code === 'EACCES' || code === 'EPERM') {\n        const errorMsg = error instanceof Error ? error.message : String(error);\n        console.warn(\n          `[jdm-asm] Warning: Cache file exists but cannot be read due to permissions: ${cachePath}\\n${errorMsg}`,\n        );\n        return null;\n      }\n    }\n\n    // Cache corruption or other errors are benign since we can regenerate the result.\n    // Failing fast would hurt UX when cache is just a performance optimization, not critical.\n    // Try to clean up corrupted cache file\n    try {\n      unlinkSync(cachePath);\n    } catch (cleanupError) {\n      // If we can't delete it, just warn (might be permission issue)\n      if (cleanupError && typeof cleanupError === 'object' && 'code' in cleanupError) {\n        const code = (cleanupError as { code: string }).code;\n        if (code === 'EACCES' || code === 'EPERM') {\n          console.warn(\n            `[jdm-asm] Warning: Cannot clean up corrupted cache file (permission denied): ${cachePath}`,\n          );\n        }\n      }\n    }\n    return null;\n  }\n}\n\n/**\n * Write compilation result to disk cache\n * Failures are logged as warnings but do not throw since caching is optional\n */\nexport function writeCacheToDisk(\n  cacheKey: string,\n  result: { binary: Uint8Array; wat: string },\n): void {\n  try {\n    const cacheDir = ensureCacheDir();\n    const cachePath = join(cacheDir, `${cacheKey}.json`);\n\n    const entry: CacheEntry = {\n      version: getPackageVersion(),\n      timestamp: Date.now(),\n      binary: Buffer.from(result.binary).toString('base64'),\n      wat: result.wat,\n    };\n\n    writeFileSync(cachePath, JSON.stringify(entry));\n  } catch (error) {\n    // Cache write failures should not break compilation since caching is a performance\n    // optimization, not a requirement. Warn the user so they know cache isn't working.\n    const errorMsg = error instanceof Error ? error.message : String(error);\n\n    // Provide more specific guidance for common errors\n    if (error && typeof error === 'object' && 'code' in error) {\n      const code = (error as { code: string }).code;\n\n      if (code === 'ENOSPC') {\n        console.warn(`[jdm-asm] Warning: Failed to write cache (disk full): ${errorMsg}`);\n      } else if (code === 'EACCES' || code === 'EPERM' || code === 'EROFS') {\n        console.warn(\n          `[jdm-asm] Warning: Failed to write cache (permission denied or read-only filesystem): ${errorMsg}`,\n        );\n      } else {\n        console.warn(`[jdm-asm] Warning: Failed to write cache: ${errorMsg}`);\n      }\n    } else {\n      console.warn(`[jdm-asm] Warning: Failed to write cache: ${errorMsg}`);\n    }\n  }\n}\n\n/**\n * Get the cache directory path\n * Exposes where compiled WASM modules are stored on disk\n */\nexport function getCacheDirectory(): string {\n  return getCacheDir();\n}\n\n/**\n * Get cache health diagnostics\n * Returns information about cache status, any issues, and recent operations\n */\nexport function getCacheHealth(): {\n  enabled: boolean;\n  directory: string;\n  directoryExists: boolean;\n  accessible: boolean;\n  stats: {\n    entries: number;\n    totalSize: number;\n    oldestEntry: number | null;\n    newestEntry: number | null;\n  };\n  issues: string[];\n} {\n  const enabled = isCacheEnabled();\n  const directory = getCacheDir();\n  const directoryExists = existsSync(directory);\n  const issues: string[] = [];\n\n  // Check if cache is disabled\n  if (!enabled) {\n    issues.push('Cache is disabled via JDM_ASM_NO_CACHE environment variable');\n  }\n\n  // Check if directory exists\n  if (enabled && !directoryExists) {\n    issues.push('Cache directory does not exist yet (will be created on first write)');\n  }\n\n  // Check if directory is accessible\n  let accessible = false;\n  if (directoryExists) {\n    try {\n      // Try to read the directory to check accessibility\n      readdirSync(directory);\n      accessible = true;\n    } catch (error) {\n      accessible = false;\n      issues.push(\n        `Cache directory exists but is not accessible: ${error instanceof Error ? error.message : String(error)}`,\n      );\n    }\n  }\n\n  // Get cache stats if accessible\n  const stats = accessible\n    ? getCacheStats()\n    : {\n        entries: 0,\n        totalSize: 0,\n        oldestEntry: null,\n        newestEntry: null,\n      };\n\n  return {\n    enabled,\n    directory,\n    directoryExists,\n    accessible,\n    stats,\n    issues,\n  };\n}\n\n/**\n * Clear the entire cache\n */\nexport function clearCache(): void {\n  const cacheDir = getCacheDir();\n  if (!existsSync(cacheDir)) {\n    return;\n  }\n\n  const files = readdirSync(cacheDir);\n  for (const file of files) {\n    if (file.endsWith('.json')) {\n      try {\n        unlinkSync(join(cacheDir, file));\n      } catch {}\n    }\n  }\n}\n\n/**\n * Get cache statistics\n */\nexport function getCacheStats(): {\n  entries: number;\n  totalSize: number;\n  oldestEntry: number | null;\n  newestEntry: number | null;\n} {\n  const cacheDir = getCacheDir();\n  if (!existsSync(cacheDir)) {\n    return { entries: 0, totalSize: 0, oldestEntry: null, newestEntry: null };\n  }\n\n  const files = readdirSync(cacheDir).filter((f) => f.endsWith('.json'));\n  let totalSize = 0;\n  let oldestEntry: number | null = null;\n  let newestEntry: number | null = null;\n\n  for (const file of files) {\n    const stat = statSync(join(cacheDir, file));\n    totalSize += stat.size;\n\n    const mtime = stat.mtimeMs;\n    if (oldestEntry === null || mtime < oldestEntry) {\n      oldestEntry = mtime;\n    }\n    if (newestEntry === null || mtime > newestEntry) {\n      newestEntry = mtime;\n    }\n  }\n\n  return { entries: files.length, totalSize, oldestEntry, newestEntry };\n}\n\n/**\n * Prune old cache entries (keep most recent N entries or entries younger than maxAge)\n */\nexport function pruneCache(\n  options: {\n    maxEntries?: number;\n    maxAgeMs?: number;\n  } = {},\n): number {\n  const { maxEntries = 100, maxAgeMs = 7 * 24 * 60 * 60 * 1000 } = options; // Default: 100 entries, 7 days\n  const cacheDir = getCacheDir();\n\n  if (!existsSync(cacheDir)) {\n    return 0;\n  }\n\n  const files = readdirSync(cacheDir)\n    .filter((f) => f.endsWith('.json'))\n    .map((f) => {\n      const stat = statSync(join(cacheDir, f));\n      return { name: f, mtime: stat.mtimeMs };\n    })\n    .sort((a, b) => b.mtime - a.mtime); // Sort by newest first\n\n  const now = Date.now();\n  let removed = 0;\n\n  for (let i = 0; i < files.length; i++) {\n    const file = files[i];\n    const age = now - file.mtime;\n\n    // Remove if exceeds max entries or max age\n    if (i >= maxEntries || age > maxAgeMs) {\n      try {\n        unlinkSync(join(cacheDir, file.name));\n        removed++;\n      } catch {}\n    }\n  }\n\n  return removed;\n}\n\n/**\n * Check if caching is enabled\n * Can be disabled via JDM_ASM_NO_CACHE=1 environment variable\n */\nexport function isCacheEnabled(): boolean {\n  return process.env.JDM_ASM_NO_CACHE !== '1';\n}\n","// src/compiler/runtime/index.ts\nimport { readFileSync } from 'fs';\nimport { resolve, dirname } from 'path';\nimport { fileURLToPath } from 'url';\n\nconst __dirname = dirname(fileURLToPath(import.meta.url));\n\n// Must work in both development (src/compiler/runtime) and installed package (dist/compiler/runtime).\n// Relative path from __dirname traverses up to src/runtime.\nfunction getAssemblyRuntimePath(): string {\n  // From dist/compiler/runtime -> ../../runtime\n  return resolve(__dirname, '..', '..', 'runtime');\n}\n\nfunction loadRuntime(filename: string): string {\n  const runtimePath = getAssemblyRuntimePath();\n  return readFileSync(resolve(runtimePath, filename), 'utf-8');\n}\n\nexport const RUNTIME_VALUES = loadRuntime('values.ts');\nexport const RUNTIME_CONTEXT = loadRuntime('context.ts');\nexport const RUNTIME_EXPRESSIONS = loadRuntime('expressions.ts');\nexport const RUNTIME_TABLES = loadRuntime('tables.ts');\nexport const RUNTIME_MEMORY = loadRuntime('memory.ts');\nexport const RUNTIME_STRINGS = loadRuntime('strings.ts');\nexport const RUNTIME_ARRAYS = loadRuntime('arrays.ts');\n","/**\n * AssemblyScript compilation to WebAssembly.\n * Handles compiler invocation, optimization levels, and memory configuration.\n */\n\nimport * as fs from 'fs';\nimport * as path from 'path';\nimport type { CompilerOptions } from './types';\nimport { CompilationError, ErrorCode } from './errors';\nimport { createVirtualFS, createASCFileSystemCallbacks, getCompilationOutput } from './virtual-fs';\n\n// ============================================================================\n// Compilation Thresholds and Memory Constants\n// ============================================================================\n\n/**\n * Threshold for determining if a module is \"large\" (40KB of source code).\n *\n * Empirically determined based on decision table compilation patterns:\n * - Tables with 1000+ rules generate >40KB of code\n * - These create deeply nested if/else chains that stress the optimizer\n * - Larger modules need more initial memory to avoid runtime growth overhead\n *\n * Large modules require:\n * 1. More initial memory pages (16 vs 4) for string allocations\n * 2. Lower optimization level (O2 vs O3) to avoid stack overflow in Binaryen\n * 3. Skipping WAT generation to avoid O(n²) memory complexity\n */\nconst LARGE_MODULE_THRESHOLD_BYTES = 40000;\n\n/**\n * Threshold for \"very large\" modules (1MB of source code).\n * These modules skip optimization entirely to avoid Binaryen crashes.\n */\nconst VERY_LARGE_MODULE_THRESHOLD_BYTES = 1_000_000;\n\n// Normal module memory configuration (for modules < 40KB)\n/** Initial memory pages for normal modules (256KB total) */\nconst NORMAL_MODULE_INITIAL_PAGES = 4;\n/** Maximum memory pages for normal modules (1MB total) */\nconst NORMAL_MODULE_MAX_PAGES = 16;\n\n// Large module memory configuration (for modules >= 40KB)\n/** Initial memory pages for large modules (1MB total) */\nconst LARGE_MODULE_INITIAL_PAGES = 16;\n/** Maximum memory pages for large modules (16MB total) */\nconst LARGE_MODULE_MAX_PAGES = 256;\n\n/**\n * Compilation settings based on code size.\n * Large modules need different optimization and memory settings.\n */\nexport interface CompilationSettings {\n  /** Whether the module is considered large (>40KB) */\n  isLargeModule: boolean;\n  /** Initial WebAssembly memory pages (64KB each) */\n  initialMemoryPages: number;\n  /** Maximum WebAssembly memory pages */\n  maxMemoryPages: number;\n  /** Binaryen optimization level (0-3) */\n  optimizeLevel: number;\n  /** Binaryen shrink level (0-2) */\n  shrinkLevel: number;\n  /** Whether to generate WAT text format */\n  generateWat: boolean;\n}\n\n/**\n * Determine compilation settings based on code size.\n *\n * Memory pages are 64KB each (WASM_PAGE_SIZE_BYTES). Large modules need more\n * initial memory to avoid runtime allocation overhead during string operations\n * and table lookups.\n * - Normal modules: NORMAL_MODULE_INITIAL_PAGES (256KB), max NORMAL_MODULE_MAX_PAGES (1MB)\n * - Large modules: LARGE_MODULE_INITIAL_PAGES (1MB), max LARGE_MODULE_MAX_PAGES (16MB)\n *\n * Large modules (>LARGE_MODULE_THRESHOLD_BYTES) need more memory because:\n *  (1) decision tables generate many string allocations during lookup,\n *  (2) each string requires heap allocation at runtime, and\n *  (3) insufficient initial memory causes frequent growth operations which are slow.\n *\n * Optimization levels scaled by module size because:\n *  (1) Binaryen's optimizer recursively traverses deeply nested if/else chains,\n *  (2) decision tables with 1000+ rules create nesting depth that exceeds stack limits at O3,\n *  (3) O2 uses iterative algorithms that handle deep nesting,\n *  (4) very large modules (>1MB) disable optimization entirely to avoid 10+ minute compile times.\n *\n * WAT generation skipped for large modules because Binaryen's text emitter has O(n²)\n * memory complexity and crashes with OOM on modules >LARGE_MODULE_THRESHOLD_BYTES source.\n *\n * @param codeLength - Length of the AssemblyScript source code\n * @returns Compilation settings appropriate for the code size\n */\nexport function getCompilationSettings(codeLength: number): CompilationSettings {\n  const isLargeModule = codeLength > LARGE_MODULE_THRESHOLD_BYTES;\n  const isVeryLargeModule = codeLength > VERY_LARGE_MODULE_THRESHOLD_BYTES;\n\n  let optimizeLevel: number;\n  let shrinkLevel: number;\n\n  if (isVeryLargeModule) {\n    // Very large module (>1MB source) - skip optimization to avoid Binaryen crash\n    optimizeLevel = 0;\n    shrinkLevel = 0;\n  } else if (isLargeModule) {\n    // Medium-large module (40KB-1MB) - use moderate optimization\n    optimizeLevel = 2;\n    shrinkLevel = 1;\n  } else {\n    // Small module (<40KB) - use full optimization\n    optimizeLevel = 3;\n    shrinkLevel = 2;\n  }\n\n  return {\n    isLargeModule,\n    initialMemoryPages: isLargeModule ? LARGE_MODULE_INITIAL_PAGES : NORMAL_MODULE_INITIAL_PAGES,\n    maxMemoryPages: isLargeModule ? LARGE_MODULE_MAX_PAGES : NORMAL_MODULE_MAX_PAGES,\n    optimizeLevel,\n    shrinkLevel,\n    generateWat: !isLargeModule,\n  };\n}\n\n/**\n * Create a secure temporary debug file with restricted permissions.\n *\n * Creates a temporary directory with a random name and writes the code to a file\n * with 0o600 permissions (owner read/write only).\n *\n * This function only writes files if a debug output path is provided via options\n * or the JDM_ASM_DEBUG_OUTPUT environment variable.\n *\n * @param code - The code content to write\n * @param basePath - Base directory for debug output (from options or env var)\n * @param suffix - Optional suffix for the filename (e.g., \"-no-binary\")\n * @returns Path to the created debug file, or null if debug output is disabled or write fails\n */\nfunction createSecureDebugFile(\n  code: string,\n  basePath: string | undefined,\n  suffix = '',\n): string | null {\n  // Only write debug files if explicitly requested\n  if (!basePath) {\n    return null;\n  }\n\n  try {\n    // Create a secure temporary directory with random name\n    const tmpDir = fs.mkdtempSync(path.join(basePath, 'jdm-asm-debug-'));\n\n    // Create debug file path\n    const debugFile = path.join(tmpDir, `assembly-debug${suffix}.ts`);\n\n    // Write file with restricted permissions (owner read/write only)\n    fs.writeFileSync(debugFile, code, { mode: 0o600 });\n\n    return debugFile;\n  } catch (error) {\n    // Debug output is best-effort: warn but don't break compilation\n    const errorMsg = error instanceof Error ? error.message : String(error);\n    console.warn(`[jdm-asm] Warning: Failed to write debug output to ${basePath}: ${errorMsg}`);\n    return null;\n  }\n}\n\n/**\n * Build compiler arguments based on options and settings.\n *\n * @param options - User-provided compiler options\n * @param settings - Size-based compilation settings\n * @returns Array of command-line arguments for the ASC compiler\n */\nexport function buildCompilerArgs(\n  options: CompilerOptions,\n  settings: CompilationSettings,\n): string[] {\n  const args = [\n    'src/runtime/index.ts',\n    '--outFile',\n    'output.wasm',\n    '--runtime',\n    'incremental', // Use incremental GC runtime for memory reuse across evaluations\n    '--exportRuntime', // Export __new, __pin, __collect, etc.\n    '--initialMemory',\n    String(settings.initialMemoryPages),\n    '--maximumMemory',\n    String(settings.maxMemoryPages),\n  ];\n\n  // Only generate WAT for smaller modules (large ones crash Binaryen's text emitter)\n  if (settings.generateWat) {\n    args.push('--textFile', 'output.wat');\n  }\n\n  // Add optimization flags if requested\n  if (options.optimize) {\n    if (settings.optimizeLevel > 0) {\n      args.push('--optimize');\n    }\n    args.push('--optimizeLevel', String(settings.optimizeLevel));\n    args.push('--shrinkLevel', String(settings.shrinkLevel));\n  }\n\n  // Add debug flags if requested\n  if (options.debug) {\n    args.push('--debug', '--sourceMap');\n  }\n\n  // Disable assertions in production (non-debug) mode\n  if (!options.debug) {\n    args.push('--noAssert');\n  }\n\n  return args;\n}\n\n/**\n * Compile AssemblyScript code to WebAssembly.\n *\n * This function uses the AssemblyScript compiler to generate WASM from\n * the generated AssemblyScript source code using a virtual filesystem.\n *\n * **Filesystem Side Effects:**\n * If `options.debugOutputPath` is set or the `JDM_ASM_DEBUG_OUTPUT` environment\n * variable is defined, compilation failures will write the generated AssemblyScript\n * code to disk for debugging. Files are written to secure temporary directories\n * with restricted permissions (0o600) and are NOT automatically cleaned up.\n *\n * Note: This is the internal compilation function without caching.\n * Use compileAssemblyScript() from build.ts for cached compilation.\n *\n * @param code - The AssemblyScript source code to compile\n * @param options - Compiler options (optimize, debug, debugOutputPath, etc.)\n * @returns An object with the compiled binary and WAT text\n */\nexport async function compileAssemblyScriptInternal(\n  code: string,\n  options: CompilerOptions,\n): Promise<{ binary: Uint8Array; wat: string }> {\n  // Import the AssemblyScript compiler\n  const ascModule = await import('assemblyscript/asc');\n\n  // Determine debug output path: explicit option takes precedence over environment variable\n  const debugOutputPath = options.debugOutputPath ?? process.env.JDM_ASM_DEBUG_OUTPUT;\n\n  // Save generated code before compilation so it's available for debugging even if\n  // compilation crashes the process (Binaryen can segfault on malformed input).\n  // Only write if debug output is explicitly enabled.\n  const debugFile = createSecureDebugFile(code, debugOutputPath);\n\n  // Set up virtual filesystem\n  const virtualFS = createVirtualFS(code);\n\n  // Get size-based compilation settings\n  const settings = getCompilationSettings(code.length);\n\n  // Build compiler arguments\n  const compilerArgs = buildCompilerArgs(options, settings);\n\n  // Get filesystem callbacks for ASC\n  const fsCallbacks = createASCFileSystemCallbacks(virtualFS);\n\n  // Create an in-memory stderr stream\n  let stderrOutput = '';\n  const stderrStream = ascModule.createMemoryStream((chunk: Uint8Array | string) => {\n    stderrOutput += typeof chunk === 'string' ? chunk : new TextDecoder().decode(chunk);\n  });\n\n  // Compile using the asc compiler with virtual filesystem\n  const { error } = await ascModule.main(compilerArgs, {\n    ...fsCallbacks,\n    stderr: stderrStream,\n  });\n\n  // Check for compilation errors\n  if (error) {\n    const debugFileInfo = debugFile\n      ? `\\n\\nGenerated code saved to ${debugFile}`\n      : '\\n\\n(Set debugOutputPath option or JDM_ASM_DEBUG_OUTPUT env var to save generated code for debugging)';\n\n    throw new CompilationError(\n      `AssemblyScript compilation failed:\\n${stderrOutput || error.message}${debugFileInfo}`,\n      ErrorCode.PARSE_ERROR,\n      { field: 'assemblyScript' },\n      { stderrOutput },\n    );\n  }\n\n  // Get output from virtual filesystem\n  const output = getCompilationOutput(virtualFS);\n\n  if (!output.binary) {\n    const noBinaryDebugFile = createSecureDebugFile(code, debugOutputPath, '-no-binary');\n    stderrOutput = stderrOutput || '(no stderr output)';\n    const files = [...virtualFS.keys()].join(', ');\n\n    const debugFileInfo = noBinaryDebugFile\n      ? `\\nGenerated code saved to ${noBinaryDebugFile}`\n      : '\\n(Set debugOutputPath option or JDM_ASM_DEBUG_OUTPUT env var to save generated code for debugging)';\n\n    throw new CompilationError(\n      `Compilation produced no WASM binary output.\\nCompiler stderr: ${stderrOutput}\\nFiles in virtualFS: ${files}${debugFileInfo}`,\n      ErrorCode.PARSE_ERROR,\n      { field: 'assemblyScript' },\n      { stderrOutput, virtualFSFiles: files },\n    );\n  }\n\n  return {\n    binary: output.binary,\n    wat: output.wat ?? '',\n  };\n}\n","/**\n * Virtual filesystem for in-memory AssemblyScript compilation.\n * Manages file mappings for the ASC compiler.\n */\n\nimport {\n  RUNTIME_VALUES,\n  RUNTIME_CONTEXT,\n  RUNTIME_EXPRESSIONS,\n  RUNTIME_TABLES,\n  RUNTIME_MEMORY,\n  RUNTIME_STRINGS,\n  RUNTIME_ARRAYS,\n} from './runtime/index';\n\n/** VirtualFS stores files as string or Uint8Array content */\nexport type VirtualFS = Map<string, string | Uint8Array>;\n\n/**\n * Create a virtual filesystem with runtime libraries and user code.\n * @param code - User's AssemblyScript code to compile\n * @returns Configured virtual filesystem\n */\nexport function createVirtualFS(code: string): VirtualFS {\n  const virtualFS: VirtualFS = new Map();\n  virtualFS.set('src/runtime/index.ts', code);\n  virtualFS.set('src/runtime/values.ts', RUNTIME_VALUES);\n  virtualFS.set('src/runtime/context.ts', RUNTIME_CONTEXT);\n  virtualFS.set('src/runtime/expressions.ts', RUNTIME_EXPRESSIONS);\n  virtualFS.set('src/runtime/tables.ts', RUNTIME_TABLES);\n  virtualFS.set('src/runtime/memory.ts', RUNTIME_MEMORY);\n  virtualFS.set('src/runtime/strings.ts', RUNTIME_STRINGS);\n  virtualFS.set('src/runtime/arrays.ts', RUNTIME_ARRAYS);\n  return virtualFS;\n}\n\n/**\n * Create ASC-compatible file system callbacks.\n * @param virtualFS - The virtual filesystem to use\n * @returns Object with readFile, writeFile, listFiles functions for ASC compiler\n */\nexport function createASCFileSystemCallbacks(virtualFS: VirtualFS) {\n  return {\n    readFile(name: string, baseDir: string): string | null {\n      // Try multiple path variations to find the file\n      const possibleKeys = [\n        // 'src/runtime/index.ts'\n        name,\n        // './src/runtime/index.ts' or 'src/runtime/index.ts'\n        baseDir ? `${baseDir}/${name}` : name,\n        // Remove leading ./\n        name.startsWith('./') ? name.slice(2) : name,\n      ];\n\n      for (const key of possibleKeys) {\n        const content = virtualFS.get(key);\n        if (typeof content === 'string') {\n          return content;\n        }\n      }\n      return null;\n    },\n    writeFile(name: string, data: Uint8Array | string, baseDir: string): void {\n      const key = baseDir ? `${baseDir}/${name}` : name;\n      virtualFS.set(key, data);\n    },\n    listFiles(dirname: string, baseDir: string): string[] | null {\n      const prefix = baseDir ? `${baseDir}/${dirname}` : dirname;\n      return [...virtualFS.keys()].filter((f) => f.startsWith(prefix));\n    },\n  };\n}\n\n/**\n * Get output files from virtual filesystem after compilation.\n * @param virtualFS - The virtual filesystem\n * @returns Object with binary and wat files (may be undefined if not present)\n */\nexport function getCompilationOutput(virtualFS: VirtualFS): {\n  binary: Uint8Array | undefined;\n  wat: string | undefined;\n} {\n  // The compiler writes to ./output.wasm (with ./ prefix)\n  const binary = virtualFS.get('output.wasm') || virtualFS.get('./output.wasm');\n  const wat = virtualFS.get('output.wat') || virtualFS.get('./output.wat');\n  return {\n    binary: binary instanceof Uint8Array ? binary : undefined,\n    wat: typeof wat === 'string' ? wat : undefined,\n  };\n}\n","/**\n * JavaScript Marshaling Code Generation\n *\n * This module generates JavaScript code for serializing JavaScript objects to\n * WebAssembly memory and deserializing results back. The generated code handles:\n *\n * - Input marshaling: Converting JS objects to WASM memory format\n * - Output unmarshaling: Converting WASM memory back to JS objects\n * - Size calculation: Computing memory requirements for marshaling\n * - Type-tagged value encoding: Writing values with type tags for dynamic typing\n *\n * The generated code operates on DataView for cross-endian compatibility and\n * handles both fixed-size types (numbers, booleans) and variable-length types\n * (strings, arrays, objects).\n */\n\nimport type { FlattenedLayout } from '../types';\n\n/**\n * Generate JavaScript marshaling code.\n *\n * This function generates the JavaScript code that will serialize\n * JavaScript objects to WebAssembly memory and deserialize results back.\n *\n * @param inputLayout - The flattened input schema layout\n * @param outputLayout - The flattened output schema layout\n * @param schemaHash - The schema hash for runtime validation\n * @returns Generated JavaScript marshaling code as a string\n */\nexport function generateMarshalCode(\n  inputLayout: FlattenedLayout,\n  outputLayout: FlattenedLayout,\n  schemaHash: bigint,\n): string {\n  const schemaHashHex = `0x${schemaHash.toString(16).padStart(16, '0')}`;\n\n  // Calculate fixed sizes (sum of all fixed-size fields)\n  const inputFixedSize = inputLayout.fields\n    .filter((f) => f.size !== -1)\n    .reduce((sum, f) => sum + f.size, 0);\n  const outputFixedSize = outputLayout.fields\n    .filter((f) => f.size !== -1)\n    .reduce((sum, f) => sum + f.size, 0);\n\n  return `\n// Generated marshaling code for schema hash ${schemaHashHex}\n// Input fixed size: ${inputFixedSize} bytes\n// Output fixed size: ${outputFixedSize} bytes\n\n// Type tags for marshaling (must match AssemblyScript runtime/Values.ts)\n// All type tags are stored as 4-byte u32\nconst TAG_NULL = 0;\nconst TAG_BOOLEAN = 1;\nconst TAG_INT = 2;\nconst TAG_FLOAT = 3;\nconst TAG_STRING = 4;\nconst TAG_ARRAY = 5;\nconst TAG_OBJECT = 6;\n\n// Size of type tag in bytes (must match VALUE_TYPE_SIZE in AssemblyScript)\nconst TAG_SIZE = 4;\n\nconst SCHEMA_HASH = ${schemaHashHex}n;\nconst INPUT_FIXED_SIZE = ${inputFixedSize};\nconst OUTPUT_FIXED_SIZE = ${outputFixedSize};\n\n/**\n * Marshal JavaScript input object to WebAssembly memory as a ValueMap.\n *\n * The WASM runtime expects input as a ValueMap: [length: u32][keyPtr1: u32][valuePtr1: u32]...\n * where keys are raw UTF-16 strings and values are tagged Value structures.\n *\n * @param data - The input JavaScript object\n * @param memory - WebAssembly Memory instance\n * @param allocate - Function to allocate memory: (size: number) => number\n * @returns Pointer to marshaled ValueMap in WASM memory\n */\nexport function marshalInput(data, memory, allocate) {\n  const view = new DataView(memory.buffer);\n  const entries = Object.entries(data);\n  const length = entries.length;\n\n  // Calculate total size needed for ValueMap\n  // Format: [length: u32][keyPtr1: u32][valuePtr1: u32]...[key data...][value data...]\n  let totalSize = 4 + length * 8; // map header + key/value pointer pairs\n\n  // Calculate size for keys (raw strings) and values (tagged)\n  for (let i = 0; i < length; i++) {\n    const [key, value] = entries[i];\n    // Key: raw UTF-16 string [length: u32][utf16 chars...]\n    totalSize += 4 + key.length * 2;\n    // Value: tagged value\n    totalSize += calculateValueSize(value);\n  }\n\n  // Allocate memory\n  const ptr = allocate(totalSize);\n\n  // Write map length\n  view.setUint32(ptr, length, true);\n\n  // Current offset for variable data (after map structure)\n  let currentOffset = ptr + 4 + length * 8;\n\n  // Write each key/value pair\n  let ptrOffset = ptr + 4;\n  for (let i = 0; i < length; i++) {\n    const [key, value] = entries[i];\n\n    // Write key as raw string (not tagged): [length: u32][utf16 chars...]\n    const keyPtr = currentOffset;\n    view.setUint32(keyPtr, key.length, true);\n    for (let j = 0; j < key.length; j++) {\n      view.setUint16(keyPtr + 4 + j * 2, key.charCodeAt(j), true);\n    }\n    currentOffset += 4 + key.length * 2;\n\n    // Write value (tagged)\n    const valuePtr = currentOffset;\n    currentOffset += writeValue(value, view, valuePtr);\n\n    // Write pointers to map structure\n    view.setUint32(ptrOffset, keyPtr, true);\n    view.setUint32(ptrOffset + 4, valuePtr, true);\n    ptrOffset += 8;\n  }\n\n  return ptr;\n}\n\n/**\n * Unmarshal WebAssembly memory to JavaScript output object.\n * @param ptr - Pointer to output data in WASM memory\n * @param memory - WebAssembly Memory instance\n * @returns The output JavaScript object\n */\nexport function unmarshalOutput(ptr, memory) {\n  const view = new DataView(memory.buffer);\n\n  // Output is written using writeValue() which writes a tagged Value\n  // Use readValue() to read it back generically\n  const output = readValue(view, ptr);\n  \n  // Convert flat dotted keys to nested objects.\n  // Decision tables with passThrough emit flat keys like 'features.prioritySupport'\n  // which must be restructured into nested objects for JavaScript consumption.\n  // e.g., {\"features.prioritySupport\": true} -> {\"features\": {\"prioritySupport\": true}}\n  return unflattenObject(output);\n}\n\n/**\n * Convert flat dotted keys to nested objects.\n * Recursively processes objects and arrays.\n * \n * @param value - The value to unflatten\n * @returns The unflattened value\n */\nfunction unflattenObject(value) {\n  if (value === null || value === undefined) {\n    return value;\n  }\n  \n  if (Array.isArray(value)) {\n    return value.map(item => unflattenObject(item));\n  }\n  \n  if (typeof value !== 'object') {\n    return value;\n  }\n  \n  const result = {};\n  \n  for (const [key, val] of Object.entries(value)) {\n    // Recursively unflatten the value first\n    const unflattenedVal = unflattenObject(val);\n    \n    if (key.includes('.')) {\n      // Split the key and create nested structure\n      const parts = key.split('.');\n      let current = result;\n      \n      for (let i = 0; i < parts.length - 1; i++) {\n        const part = parts[i];\n        if (!(part in current)) {\n          current[part] = {};\n        } else if (typeof current[part] !== 'object' || current[part] === null) {\n          // Conflicts where both 'a' and 'a.b' exist can occur from multiple decision\n          // table rules. Nested structure takes precedence to preserve data hierarchy.\n          current[part] = {};\n        }\n        current = current[part];\n      }\n      \n      current[parts[parts.length - 1]] = unflattenedVal;\n    } else {\n      // No dot in key - check if we already have a nested object from a dotted key\n      if (key in result && typeof result[key] === 'object' && result[key] !== null && typeof unflattenedVal === 'object' && unflattenedVal !== null) {\n        // Merge the objects\n        Object.assign(result[key], unflattenedVal);\n      } else {\n        result[key] = unflattenedVal;\n      }\n    }\n  }\n  \n  return result;\n}\n\n/**\n * Calculate the total memory size needed for marshaling the input as a ValueMap.\n *\n * Format: [length: u32][keyPtr1: u32][valuePtr1: u32]...[key data...][value data...]\n */\nfunction calculateInputSize(data) {\n  const entries = Object.entries(data);\n  const length = entries.length;\n\n  // Map header + key/value pointer pairs\n  let size = 4 + length * 8;\n\n  // Add size for keys (raw strings) and values (tagged)\n  for (let i = 0; i < length; i++) {\n    const [key, value] = entries[i];\n    // Key: raw UTF-16 string [length: u32][utf16 chars...]\n    size += 4 + key.length * 2;\n    // Value: tagged value\n    size += calculateValueSize(value);\n  }\n\n  return size;\n}\n\n/**\n * Write null value with type tag.\n *\n * Format: [tag: u32]\n *\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written (4 bytes for tag)\n */\nfunction writeNull(view, offset) {\n  // Write tag\n  view.setUint32(offset, TAG_NULL, true);\n  return TAG_SIZE; // tag only\n}\n\n/**\n * Write boolean value with type tag.\n *\n * Format: [tag: u32][value: u8]\n *\n * @param value - The boolean value to write\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written (5 bytes: tag + value)\n */\nfunction writeBoolean(value, view, offset) {\n  // Write tag\n  view.setUint32(offset, TAG_BOOLEAN, true);\n  // Write boolean value as 1 byte (0 or 1)\n  view.setUint8(offset + TAG_SIZE, value ? 1 : 0);\n  return TAG_SIZE + 1; // tag + value\n}\n\n/**\n * Write float (number) value with type tag.\n *\n * Format: [tag: u32][value: f64]\n *\n * Handles all JavaScript number types including:\n * - Regular numbers (0, -0, integers, floats)\n * - Special values (NaN, Infinity, -Infinity)\n *\n * @param value - The number value to write\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written (12 bytes: 4-byte tag + 8-byte f64)\n */\nfunction writeFloat(value, view, offset) {\n  // Write tag\n  view.setUint32(offset, TAG_FLOAT, true);\n  // Write number as f64 (little-endian)\n  view.setFloat64(offset + TAG_SIZE, value, true);\n  return TAG_SIZE + 8; // tag + f64\n}\n\n/**\n * Read a float value from memory.\n *\n * Format: [tag: u32][value: f64]\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded number value (as integer if it's a whole number)\n * @throws {Error} If type tag is not TAG_FLOAT\n */\nfunction readFloat(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_FLOAT) {\n    throw new Error(\\`Expected float tag (\\${TAG_FLOAT}), got \\${tag}\\`);\n  }\n  // Read number as f64 (little-endian)\n  const value = view.getFloat64(offset + TAG_SIZE, true);\n  // Return as integer if it's a whole number (for cleaner JSON output)\n  if (Number.isInteger(value)) {\n    return value;\n  }\n  return value;\n}\n\n/**\n * Write a UTF-16 string to memory with type tag.\n *\n * Format: [tag: u32][pointer: u32] - pointer points to string data\n * String data format: [length: u32][utf16 code units...]\n *\n * The pointer in the Value structure points immediately after the Value structure\n * itself (at offset + 8), where the string data begins.\n *\n * Uses UTF-16 encoding to match AssemblyScript's native string format.\n *\n * @param str - The string to write\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written (tag + pointer + string data)\n */\nfunction writeString(str, view, offset) {\n  const len = str.length;\n  // Write tag\n  view.setUint32(offset, TAG_STRING, true);\n  // String data starts right after the Value structure (tag + pointer = 8 bytes)\n  const stringDataPtr = offset + TAG_SIZE + 4;\n  // Write pointer to string data\n  view.setUint32(offset + TAG_SIZE, stringDataPtr, true);\n  // Write string data: [length: u32][utf16 code units...]\n  view.setUint32(stringDataPtr, len, true);\n  for (let i = 0; i < len; i++) {\n    view.setUint16(stringDataPtr + 4 + i * 2, str.charCodeAt(i), true);\n  }\n  // Total: tag (4) + pointer (4) + length (4) + utf16 data (len * 2)\n  return 8 + 4 + len * 2;\n}\n\n/**\n * Read null value with type tag.\n *\n * Format: [tag: u32]\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns null value\n * @throws {Error} If type tag is not TAG_NULL\n */\nfunction readNull(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_NULL) {\n    throw new Error(\\`Expected null tag (\\${TAG_NULL}), got \\${tag}\\`);\n  }\n  return null;\n}\n\n/**\n * Read boolean value with type tag.\n *\n * Format: [tag: u32][value: u8]\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded boolean value\n * @throws {Error} If type tag is not TAG_BOOLEAN\n */\nfunction readBoolean(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_BOOLEAN) {\n    throw new Error(\\`Expected boolean tag (\\${TAG_BOOLEAN}), got \\${tag}\\`);\n  }\n  // Read boolean value and convert to boolean\n  const value = view.getUint8(offset + TAG_SIZE);\n  return value !== 0;\n}\n\n/**\n * Read an integer value from memory with type tag.\n *\n * Format: [tag: u32][value: i64]\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded integer value\n * @throws {Error} If type tag is not TAG_INT\n */\nfunction readInt(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_INT) {\n    throw new Error(\\`Expected int tag (\\${TAG_INT}), got \\${tag}\\`);\n  }\n  // Read i64 value (little-endian)\n  // JavaScript DataView doesn't have getBigInt64 in older versions, so use two 32-bit reads\n  const low = view.getUint32(offset + TAG_SIZE, true);\n  const high = view.getInt32(offset + TAG_SIZE + 4, true);\n  // Combine to form a 64-bit signed integer\n  // For values that fit in Number, this works fine\n  const value = low + high * 0x100000000;\n  return value;\n}\n\n/**\n * Read a UTF-16 string from memory with type tag.\n *\n * WASM Format: [tag: u32=4][stringPtr: u32]\n * String data at stringPtr: [length: u32][utf16 chars...]\n *\n * FORMAT DIFFERENCE: This reads the canonical WASM representation using pointers\n * and UTF-16 encoding (AssemblyScript's native string format), while writeString()\n * uses an inlined UTF-8 format for simplicity. Both are valid Value representations.\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded string\n * @throws {Error} If type tag is not TAG_STRING\n */\nfunction readString(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_STRING) {\n    throw new Error(\\`Expected string tag (\\${TAG_STRING}), got \\${tag}\\`);\n  }\n  // Read pointer to string data\n  const stringPtr = view.getUint32(offset + TAG_SIZE, true);\n  \n  // Read string data from the pointer\n  if (stringPtr === 0) return '';\n  \n  const length = view.getUint32(stringPtr, true);\n  if (length === 0) return '';\n  \n  // Read UTF-16 code units and convert to string\n  let result = '';\n  for (let i = 0; i < length; i++) {\n    const codeUnit = view.getUint16(stringPtr + 4 + i * 2, true);\n    result += String.fromCharCode(codeUnit);\n  }\n  \n  return result;\n}\n\n/**\n * Marshal a primitive value to memory with automatic type detection.\n *\n * Supports null, boolean, number, and string types.\n *\n * @param value - The value to write (null, boolean, number, or string)\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written\n * @throws {Error} If value type is not supported\n */\nfunction writePrimitive(value, view, offset) {\n  if (value === null) {\n    return writeNull(view, offset);\n  } else if (typeof value === 'boolean') {\n    return writeBoolean(value, view, offset);\n  } else if (typeof value === 'number') {\n    return writeFloat(value, view, offset);\n  } else if (typeof value === 'string') {\n    return writeString(value, view, offset);\n  } else {\n    throw new Error('Unsupported type for marshaling: ' + typeof value);\n  }\n}\n\n/**\n * Read a primitive value from memory with type detection.\n *\n * Reads the type tag and dispatches to the appropriate read function.\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded value (null, boolean, number, or string)\n * @throws {Error} If type tag is not recognized\n */\nfunction readPrimitive(view, offset) {\n  const tag = view.getUint32(offset, true);\n  switch (tag) {\n    case TAG_NULL:\n      return readNull(view, offset);\n    case TAG_BOOLEAN:\n      return readBoolean(view, offset);\n    case TAG_INT:\n      return readInt(view, offset);\n    case TAG_FLOAT:\n      return readFloat(view, offset);\n    case TAG_STRING:\n      return readString(view, offset);\n    default:\n      throw new Error('Unexpected type tag: ' + tag);\n  }\n}\n\n/**\n * Marshal an object to memory.\n * Returns the total bytes written for the object.\n *\n * Format: [tag: u32][propertyCount: u32][key1: tagged string][value1: tagged][key2: tagged string][value2: tagged]...\n *\n * Keys are written as tagged strings, followed by tagged values.\n * Property order is preserved for deterministic serialization using Object.entries.\n *\n * @param obj - The object to marshal\n * @param view - DataView for writing\n * @param writeOffset - Offset to write the object at\n * @returns Total bytes written\n */\nfunction writeObject(obj, view, writeOffset) {\n  const startOffset = writeOffset;\n  let offset = writeOffset;\n\n  // Write tag\n  view.setUint32(offset, TAG_OBJECT, true);\n  offset += TAG_SIZE;\n\n  // Get properties in order\n  const entries = Object.entries(obj);\n  const propCount = entries.length;\n\n  // Write property count\n  view.setUint32(offset, propCount, true);\n  offset += 4;\n\n  // Write each (key, value) pair\n  for (let i = 0; i < propCount; i++) {\n    const [key, value] = entries[i];\n\n    // Write key as tagged string (keys are tagged with TAG_STRING)\n    offset += writeString(key, view, offset);\n\n    // Write value (tagged)\n    offset += writeValue(value, view, offset);\n  }\n\n  return offset - startOffset;\n}\n\n/**\n * Marshal a value to memory with automatic type detection.\n *\n * Supports null, boolean, number, string, array, and object types.\n * This is the top-level value marshaling function that dispatches to\n * the appropriate type-specific function.\n *\n * @param value - The value to write\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written\n * @throws {Error} If value type is not supported\n */\nfunction writeValue(value, view, offset) {\n  if (value === null || value === undefined) {\n    return writeNull(view, offset);\n  } else if (typeof value === 'boolean') {\n    return writeBoolean(value, view, offset);\n  } else if (typeof value === 'number') {\n    return writeFloat(value, view, offset);\n  } else if (typeof value === 'string') {\n    return writeString(value, view, offset);\n  } else if (Array.isArray(value)) {\n    return writeArray(value, view, 0, offset);\n  } else if (typeof value === 'object') {\n    return writeObject(value, view, offset);\n  } else {\n    throw new Error('Unsupported type for marshaling: ' + typeof value);\n  }\n}\n\n/**\n * Read an object from memory.\n *\n * WASM Format: Value.Object has: [type: u32=6][objectPtr: u32]\n * objectPtr points to Map structure: [propCount: u32][keyPtr1: u32][valuePtr1: u32][keyPtr2: u32][valuePtr2: u32]...\n * Key pointers point to UTF-16 string data\n * Value pointers point to heap-allocated tagged values.\n *\n * @param view - DataView for reading\n * @param offset - Offset to the Value.Object structure (NOT objectPtr)\n * @returns The unmarshaled object\n */\nfunction readObject(view, offset) {\n  // Two cases:\n  // 1. If offset has TAG_OBJECT (6), it's a Value.Object structure: [type: u32][objectPtr: u32]\n  // 2. Otherwise, offset might already point to the Map structure directly\n\n  const tag = view.getUint32(offset, true);\n  let objectPtr;\n\n  if (tag === TAG_OBJECT) {\n    // Case 1: Value.Object structure, read pointer to Map\n    objectPtr = view.getUint32(offset + 4, true);\n  } else {\n    // Case 2: offset point directly to Map structure\n    objectPtr = offset;\n  }\n\n  const result = {};\n  if (objectPtr !== 0) {\n    // Read property count from map structure\n    const propCount = view.getUint32(objectPtr, true);\n    let mapOffset = objectPtr + 4;\n\n    for (let i = 0; i < propCount; i++) {\n      // Read key pointer and value pointer\n      const keyPtr = view.getUint32(mapOffset, true);\n      const valuePtr = view.getUint32(mapOffset + 4, true);\n      mapOffset += 8;\n\n      // Read key (raw UTF-16 string data at keyPtr: [length: u32][utf16 chars...])\n      const keyLen = view.getUint32(keyPtr, true);\n      let key = '';\n      for (let j = 0; j < keyLen; j++) {\n        const codeUnit = view.getUint16(keyPtr + 4 + j * 2, true);\n        key += String.fromCharCode(codeUnit);\n      }\n\n      // Read value (tagged value at valuePtr)\n      const value = readValue(view, valuePtr);\n\n      result[key] = value;\n    }\n  }\n\n  return result;\n}\n\n/**\n * Calculate the size in bytes of a tagged value at the given offset.\n *\n * @param view - DataView for reading\n * @param offset - Offset to calculate size from\n * @returns Total bytes the value occupies\n * @throws {Error} If type tag is not recognized\n */\nfunction getValueSize(view, offset) {\n  const tag = view.getUint32(offset, true);\n\n  switch (tag) {\n    case TAG_NULL:\n      return TAG_SIZE;\n    case TAG_BOOLEAN:\n      return TAG_SIZE + 1;\n    case TAG_INT:\n      return TAG_SIZE + 8;\n    case TAG_FLOAT:\n      return TAG_SIZE + 8;\n    case TAG_STRING: {\n      const strLen = view.getUint32(offset + TAG_SIZE, true);\n      return TAG_SIZE + 4 + strLen;\n    }\n    case TAG_ARRAY: {\n      const arrLen = view.getUint32(offset + TAG_SIZE, true);\n      let size = TAG_SIZE + 4; // tag + length\n      let elemOffset = offset + TAG_SIZE + 4;\n      for (let i = 0; i < arrLen; i++) {\n        const elemSize = getValueSize(view, elemOffset);\n        size += elemSize;\n        elemOffset += elemSize;\n      }\n      return size;\n    }\n    case TAG_OBJECT: {\n      const propCount = view.getUint32(offset + TAG_SIZE, true);\n      let size = TAG_SIZE + 4; // tag + property count\n      let propOffset = offset + TAG_SIZE + 4;\n      for (let i = 0; i < propCount; i++) {\n        // Skip key (tagged string)\n        const keySize = getValueSize(view, propOffset);\n        size += keySize;\n        propOffset += keySize;\n\n        // Skip value (tagged value)\n        const valSize = getValueSize(view, propOffset);\n        size += valSize;\n        propOffset += valSize;\n      }\n      return size;\n    }\n    default:\n      throw new Error('Unexpected type tag: ' + tag);\n  }\n}\n\n/**\n * Read a value from memory with type detection.\n *\n * Reads the type tag and dispatches to the appropriate read function.\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded value\n * @throws {Error} If type tag is not recognized\n */\nfunction readValue(view, offset) {\n  const tag = view.getUint32(offset, true);\n  switch (tag) {\n    case TAG_NULL:\n      return readNull(view, offset);\n    case TAG_BOOLEAN:\n      return readBoolean(view, offset);\n    case TAG_INT:\n      return readInt(view, offset);\n    case TAG_FLOAT:\n      return readFloat(view, offset);\n    case TAG_STRING:\n      return readString(view, offset);\n    case TAG_ARRAY:\n      return readArray(view, offset);\n    case TAG_OBJECT:\n      return readObject(view, offset);\n    default:\n      throw new Error('Unexpected type tag: ' + tag);\n  }\n}\n\n/**\n * Marshal an array to memory.\n * Returns the total bytes written for the array.\n *\n * Format: [tag: u32][length: u32][tagged elements...]\n *\n * @param arr - The array to marshal\n * @param view - DataView for writing\n * @param ptr - Base pointer (unused, kept for API compatibility)\n * @param writeOffset - Offset to write the array at\n * @returns Total bytes written\n */\nfunction writeArray(arr, view, ptr, writeOffset) {\n  const startOffset = writeOffset;\n  let offset = writeOffset;\n\n  // Write tag\n  view.setUint32(offset, TAG_ARRAY, true);\n  offset += TAG_SIZE;\n\n  // Write length\n  view.setUint32(offset, arr.length, true);\n  offset += 4;\n\n  // Write elements recursively\n  for (let i = 0; i < arr.length; i++) {\n    const value = arr[i];\n    offset += writeValue(value, view, offset);\n  }\n\n  return offset - startOffset;\n}\n\n/**\n * Calculate the size needed to marshal an object.\n *\n * Format: [tag: byte][propertyCount: u32][key1: tagged string][value1: tagged][key2: tagged string][value2: tagged]...\n *\n * @param obj - The object to calculate size for\n * @returns Total bytes needed for the object\n */\nfunction calculateObjectSize(obj) {\n  let size = 5; // tag (1 byte) + property count (4 bytes)\n\n  const entries = Object.entries(obj);\n  for (let i = 0; i < entries.length; i++) {\n    const [key, value] = entries[i];\n    // Key: tagged string (tag: 4 + pointer: 4 + length: 4 + UTF-16 data: 2 bytes per code unit)\n    size += 8 + 4 + key.length * 2;\n    // Value: calculate size of tagged value\n    size += calculateValueSize(value);\n  }\n\n  return size;\n}\n\n/**\n * Calculate the size needed to marshal a value.\n *\n * @param value - The value to calculate size for\n * @returns Total bytes needed for the value\n */\nfunction calculateValueSize(value) {\n  if (value === null || value === undefined) {\n    return 1;\n  } else if (typeof value === 'boolean') {\n    return 2;\n  } else if (typeof value === 'number') {\n    return 9;\n  } else if (typeof value === 'string') {\n    // tag (4) + pointer (4) + length (4) + UTF-16 data (2 bytes per code unit)\n    return 8 + 4 + value.length * 2;\n  } else if (Array.isArray(value)) {\n    let size = 5;\n    for (let i = 0; i < value.length; i++) {\n      size += calculateValueSize(value[i]);\n    }\n    return size;\n  } else if (typeof value === 'object') {\n    return calculateObjectSize(value);\n  } else {\n    throw new Error('Unsupported type for marshaling: ' + typeof value);\n  }\n}\n\n/**\n * Read an array from memory.\n *\n * WASM Format: Value.Array has: [type: u32=5][arrayPtr: u32]\n * arrayPtr points to array structure: [length: u32][elementPtr1: u32][elementPtr2: u32]...\n * Each elementPtr points to a tagged Value structure\n *\n * @param view - DataView for reading\n * @param offset - Offset to the Value.Array structure (NOT arrayPtr)\n * @returns The unmarshaled array\n */\nfunction readArray(view, offset) {\n  // Two cases:\n  // 1. If offset has TAG_ARRAY (5), it's a Value.Array structure: [type: u32][arrayPtr: u32]\n  // 2. Otherwise, offset might already point to the array structure directly\n\n  const tag = view.getUint32(offset, true);\n  let arrayPtr;\n\n  if (tag === TAG_ARRAY) {\n    // Case 1: Value.Array structure, read pointer to array data\n    arrayPtr = view.getUint32(offset + 4, true);\n  } else {\n    // Case 2: offset points directly to array structure\n    arrayPtr = offset;\n  }\n\n  // Validate arrayPtr is within bounds\n  if (arrayPtr === 0 || arrayPtr >= view.byteLength) {\n    return [];\n  }\n\n  // Read length field (may have high bit set for flat format)\n  const lengthField = view.getUint32(arrayPtr, true);\n  const FLAT_ARRAY_MARKER = 0x80000000;\n\n  // Check if this is a flat numeric array (high bit set)\n  if ((lengthField & FLAT_ARRAY_MARKER) !== 0) {\n    // Flat numeric format: [length | marker: u32][f64 elements...]\n    const length = lengthField & ~FLAT_ARRAY_MARKER;\n    const result = [];\n    for (let i = 0; i < length; i++) {\n      const value = view.getFloat64(arrayPtr + 4 + i * 8, true);\n      result.push(value);\n    }\n    return result;\n  }\n\n  // Generic format: [length: u32][Value pointers...]\n  const length = lengthField;\n\n  // Read element pointers and dereference them\n  const result = [];\n  for (let i = 0; i < length; i++) {\n    const elemPtr = view.getUint32(arrayPtr + 4 + i * 4, true);\n    // Skip invalid pointers\n    if (elemPtr === 0 || elemPtr >= view.byteLength) {\n      result.push(null);\n      continue;\n    }\n    const value = readValue(view, elemPtr);\n    result.push(value);\n  }\n\n  return result;\n}\n`;\n}\n\n/**\n * Generate the unmarshal function body.\n *\n * This function is currently unused but kept for potential future use with alternative\n * marshaling strategies. It generates code to read fixed-layout structs directly,\n * which could be more efficient than the current generic Value-based approach.\n *\n * @param layout - The flattened schema layout\n * @param _prefix - Unused parameter (reserved for potential future use with prefixed field names)\n * @returns Generated JavaScript code for unmarshaling\n */\nexport function _generateUnmarshalBody(layout: FlattenedLayout, _prefix: string): string {\n  const lines: string[] = [];\n\n  lines.push('  const output = {};');\n  lines.push('');\n\n  // Build nested object structure\n  const paths = buildNestedPaths(layout.fields);\n  lines.push(...paths);\n\n  lines.push('');\n\n  // Read fixed fields\n  for (const field of layout.fields) {\n    if (field.type === 'string' || field.type === 'array') {\n      // Skip - handled in variable section\n      continue;\n    } else if (field.type === 'bool') {\n      lines.push('  // ' + field.path);\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = view.getUint32(readOffset + ${field.offset}, true) !== 0;`,\n      );\n    } else if (field.type === 'i64') {\n      lines.push('  // ' + field.path);\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = Number(view.getBigInt64(readOffset + ${field.offset}, true));`,\n      );\n    } else {\n      lines.push('  // ' + field.path);\n      const valueGetter = field.type === 'f64' ? 'getFloat64' : 'getInt32';\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = view.${valueGetter}(readOffset + ${field.offset}, true);`,\n      );\n    }\n  }\n\n  // Read variable-length data\n  for (const field of layout.fields) {\n    if (field.type === 'string') {\n      lines.push('');\n      lines.push('  // ' + field.path);\n      lines.push(\n        `  const ${field.flatName}_ptr = view.getUint32(readOffset + ${field.offset}, true);`,\n      );\n      lines.push(\n        `  const ${field.flatName}_len = view.getUint32(readOffset + ${field.offset} + 4, true);`,\n      );\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = ${field.flatName}_len > 0 ? readString(view, ${field.flatName}_ptr) : '';`,\n      );\n    } else if (field.type === 'array') {\n      lines.push('');\n      lines.push('  // ' + field.path);\n      lines.push(\n        `  const ${field.flatName}_ptr = view.getUint32(readOffset + ${field.offset}, true);`,\n      );\n      lines.push(\n        `  const ${field.flatName}_len = view.getUint32(readOffset + ${field.offset} + 4, true);`,\n      );\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = readArray(view, ${field.flatName}_ptr);`,\n      );\n    }\n  }\n\n  return lines.join('\\n');\n}\n\n/**\n * Build nested object initialization code\n */\nfunction buildNestedPaths(fields: Array<{ path: string }>): string[] {\n  const paths: string[] = [];\n  const nestedObjects = new Set<string>();\n\n  for (const field of fields) {\n    const parts = field.path.split('.');\n    for (let i = 0; i < parts.length - 1; i++) {\n      const prefix = parts.slice(0, i + 1).join('.');\n      if (!nestedObjects.has(prefix)) {\n        nestedObjects.add(prefix);\n        const code = `  output${prefix\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = {};`;\n        paths.push(code);\n      }\n    }\n  }\n\n  // Deduplicate and sort\n  return Array.from(new Set(paths));\n}\n","/**\n * JavaScript Validation Code Generation\n *\n * This module generates JavaScript code for validating input data against\n * TypeBox schemas before marshaling. The generated code performs:\n *\n * - Type checking for primitives (string, number, boolean)\n * - Required field validation\n * - Nested object validation\n * - Array element validation\n * - Union type validation\n * - Literal value validation\n *\n * The generated validators are standalone JavaScript code that doesn't\n * require runtime schema compilation, making validation fast and predictable.\n */\n\nimport { type TSchema, Kind } from '@sinclair/typebox';\n\n/**\n * Generate JavaScript validation code.\n *\n * This function generates JavaScript code that validates input data\n * against the TypeBox schema before marshaling.\n *\n * Generates custom validation code that checks types and required fields\n * without requiring runtime schema compilation.\n *\n * @param schema - The TypeBox schema to validate against\n * @returns Generated validation code as a string\n */\nexport function generateValidationCode(schema: TSchema): string {\n  const validatorCode = generateSchemaValidator(schema, 'data');\n\n  return `// Generated validation code for TypeBox schema\n\n/**\n * Validate input data against the schema.\n * Throws an error if validation fails.\n *\n * @param data - The input data to validate\n * @throws {ValidationError} If validation fails\n */\nexport function validateInput(data) {\n  const errors = ${validatorCode};\n  if (errors.length > 0) {\n    throw new ValidationError('Invalid input data', errors);\n  }\n}\n\n/**\n * Custom error class for validation errors\n */\nexport class ValidationError extends Error {\n  constructor(message, errors) {\n    const errorList = errors\n      .map((e, i) => '[' + (i + 1) + '] ' + e.path + ': ' + e.message)\n      .join('\\\\n  ');\n    super(message + ':\\\\n  ' + errorList);\n    this.name = 'ValidationError';\n    this.errors = errors;\n  }\n}\n\n/**\n * Safely validate input without throwing.\n *\n * @param data - The input data to validate\n * @returns true if valid, false otherwise\n */\nexport function checkInput(data) {\n  try {\n    validateInput(data);\n    return true;\n  } catch {\n    return false;\n  }\n}\n`;\n}\n\n/**\n * Generate validation code for a given schema.\n *\n * @param schema - The TypeBox schema to generate validation for\n * @param dataPath - JavaScript expression for accessing the data at this level\n * @returns JavaScript code that returns an array of error objects\n */\nfunction generateSchemaValidator(schema: TSchema, dataPath: string): string {\n  const kind = (schema as any)[Kind];\n\n  switch (kind) {\n    case 'Object': {\n      return validateObject(schema, dataPath);\n    }\n\n    case 'String': {\n      return validatePrimitive(dataPath, 'string', 'Expected string');\n    }\n\n    case 'Number': {\n      return validatePrimitive(dataPath, 'number', 'Expected number');\n    }\n\n    case 'Integer': {\n      return `${validatePrimitive(dataPath, 'number', 'Expected integer')}.concat(\n        ${dataPath} !== undefined && ${dataPath} !== null && !Number.isInteger(${dataPath})\n          ? [{ path: '${dataPath}', message: 'Expected integer', value: ${dataPath} }]\n          : []\n      )`;\n    }\n\n    case 'Boolean': {\n      return validatePrimitive(dataPath, 'boolean', 'Expected boolean');\n    }\n\n    case 'Array': {\n      return validateArray(schema, dataPath);\n    }\n\n    case 'Union': {\n      return validateUnion(schema, dataPath);\n    }\n\n    case 'Literal': {\n      const literalValue = (schema as any).const;\n      const literalStr =\n        typeof literalValue === 'string' ? `'${literalValue}'` : String(literalValue);\n      const message2 = 'Expected literal value ' + String(literalStr);\n      return `${validatePrimitive(dataPath, typeof literalValue, '${message2}')}.concat(\n        ${dataPath} !== undefined && ${dataPath} !== null && ${dataPath} !== ${literalStr}\n          ? [{ path: '${dataPath}', message: '${message2}', value: ${dataPath} }]\n          : []\n      )`;\n    }\n\n    default:\n      // Unknown type - accept anything\n      return '[]';\n  }\n}\n\n/**\n * Generate validation for object schema.\n */\nfunction validateObject(schema: TSchema, dataPath: string): string {\n  const properties = (schema as any).properties || {};\n  const required = new Set((schema as any).required || []);\n\n  let code = `[]`;\n\n  // Check if data is an object\n  code = `(${dataPath} === null || ${dataPath} === undefined || typeof ${dataPath} !== 'object' || Array.isArray(${dataPath})) ? [{ path: '${dataPath}', message: 'Expected object', value: ${dataPath} }] : []`;\n\n  // Check each property\n  for (const [key, propSchema] of Object.entries(properties)) {\n    const propPath = `${dataPath}.${key}`;\n    const isRequired = required.has(key);\n\n    // Check if required field is present\n    if (isRequired) {\n      code += `.concat(\n        ${propPath} === undefined || ${propPath} === null\n          ? [{ path: '${propPath}', message: 'Required field is missing', value: undefined }]\n          : []\n      )`;\n    } else {\n      // Skip validation if optional field is missing\n      code += `.concat(\n        ${propPath} === undefined || ${propPath} === null\n          ? []\n          : ${generateSchemaValidator(propSchema as TSchema, propPath)}\n      )`;\n    }\n\n    // Validate the field if present\n    if (isRequired) {\n      code += `.concat(\n        ${propPath} !== undefined && ${propPath} !== null\n          ? ${generateSchemaValidator(propSchema as TSchema, propPath)}\n          : []\n      )`;\n    }\n  }\n\n  return code;\n}\n\n/**\n * Generate validation for array schema.\n */\nfunction validateArray(schema: TSchema, dataPath: string): string {\n  const itemsSchema = (schema as any).items;\n\n  // Check if data is an array\n  const arrayCheck = `Array.isArray(${dataPath})`;\n\n  // Validate array elements\n  if (itemsSchema) {\n    const elementValidation = `\n      ${dataPath}.reduce((errs, item, idx) => {\n        const itemPath = '${dataPath}[' + idx + ']';\n        const elementErrors = ${generateSchemaValidator(itemsSchema as TSchema, 'item')};\n        return errs.concat(elementErrors.map(e => ({\n          ...e,\n          path: itemPath\n        })));\n      }, [])\n    `;\n\n    return `(${arrayCheck} ? ${elementValidation} : [{ path: '${dataPath}', message: 'Expected array', value: ${dataPath} }])`;\n  }\n\n  return `${arrayCheck} ? [] : [{ path: '${dataPath}', message: 'Expected array', value: ${dataPath} }]`;\n}\n\n/**\n * Generate validation for union schema.\n */\nfunction validateUnion(schema: TSchema, dataPath: string): string {\n  const anyOf = (schema as any).anyOf || [];\n  if (anyOf.length === 0) {\n    return '[]';\n  }\n\n  // Generate validators for each option\n  const validators = anyOf.map((option: TSchema) => generateSchemaValidator(option, dataPath));\n\n  // Check if at least one option passes\n  return `(${dataPath} === undefined || ${dataPath} === null) ? []\n    : ${validators.join('.length === 0 || ')}.length === 0\n      ? []\n      : [{ path: '${dataPath}', message: 'Value does not match any allowed type', value: ${dataPath} }]`;\n}\n\n/**\n * Generate validation for primitive types.\n */\nfunction validatePrimitive(dataPath: string, expectedType: string, message: string): string {\n  return `(${dataPath} === undefined || ${dataPath} === null || typeof ${dataPath} !== '${expectedType}')\n    ? [{ path: '${dataPath}', message: '${message}', value: ${dataPath} }]\n    : []`;\n}\n","// src/compiler/runtime-codegen.ts\n// Compile-time code generation utilities for loading generated marshaling and validation code\n\nimport { CompilationError, ErrorCode } from './errors';\n\n/**\n * Type definitions for marshal and unmarshal functions.\n */\nexport type MarshalFn = (data: Record<string, unknown>, memory: WebAssembly.Memory) => number;\n\nexport type UnmarshalFn = (ptr: number, memory: WebAssembly.Memory) => Record<string, unknown>;\n\nexport type ValidateFn = (data: unknown) => void;\n\n/**\n * Load generated marshaling code as executable functions.\n *\n * @internal This function uses Function constructor to execute generated code.\n * The code is generated by the compiler and is trusted, but users should be\n * aware that this executes arbitrary JavaScript in the current context.\n *\n * @param code - The generated marshaling code\n * @returns Object with marshal and unmarshal functions\n */\nexport function loadGeneratedMarshaling(code: string): {\n  marshal: MarshalFn;\n  unmarshal: UnmarshalFn;\n} {\n  // Create a function from the generated code\n\n  // We use string replacement instead of ES module loading because: (1) generated code\n  // uses ES6 exports which Function() doesn't support, (2) avoiding eval() for security,\n  // (3) provides isolated scope for generated code. Convert export syntax to regular functions.\n  const cleanedCode = code\n    .replace(/^export function marshalInput/gm, 'function marshalInputHelper')\n    .replace(/^export function unmarshalOutput/gm, 'function unmarshalOutputHelper')\n    .replace(/^export const SCHEMA_HASH/gm, 'const SCHEMA_HASH')\n    .replace(/^export const INPUT_FIXED_SIZE/gm, 'const INPUT_FIXED_SIZE')\n    .replace(/^export const OUTPUT_FIXED_SIZE/gm, 'const OUTPUT_FIXED_SIZE')\n    .replace(/^export function writeString/gm, 'function writeStringHelper')\n    .replace(/^export function readString/gm, 'function readStringHelper')\n    .replace(/^export function writeArray/gm, 'function writeArrayHelper')\n    .replace(/^export function readArray/gm, 'function readArrayHelper')\n    .replace(/^export function calculateInputSize/gm, 'function calculateInputSizeHelper');\n\n  // Helper function to extract nested values\n  const helperCode = `\n    function getNestedValue(obj, path) {\n      const parts = path.split('.');\n      let current = obj;\n      for (const part of parts) {\n        if (current == null) return undefined;\n        if (typeof current !== 'object') return undefined;\n        current = current[part];\n      }\n      return current;\n    }\n  `;\n\n  // Type for the raw 3-argument marshal function\n  type RawMarshalFn = (\n    data: Record<string, unknown>,\n    memory: WebAssembly.Memory,\n    allocate: (size: number) => number,\n  ) => number;\n\n  const module: { marshalInput?: RawMarshalFn; unmarshalOutput?: UnmarshalFn } = {};\n\n  const setupFn = new Function(\n    'module',\n    helperCode +\n      cleanedCode +\n      `\n      module.marshalInput = marshalInputHelper;\n      module.unmarshalOutput = unmarshalOutputHelper;\n    `,\n  );\n\n  setupFn(module);\n\n  if (!module.marshalInput || !module.unmarshalOutput) {\n    throw new CompilationError(\n      'Generated marshaling code did not export required functions',\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { field: 'marshalCode' },\n    );\n  }\n\n  // Create a 2-argument wrapper that provides an internal allocator\n  // The allocator starts at 192KB to avoid collision with:\n  //   - AssemblyScript static data (0 - ~50KB)\n  //   - AssemblyScript runtime heap (~50KB - ~192KB, grows during evaluation)\n  // This matches the memory layout expected by the WASM module.\n  const rawMarshal = module.marshalInput;\n  const INPUT_BUFFER_START = 192 * 1024; // 192KB\n  const REQUIRED_MEMORY = 768 * 1024; // 768KB minimum to fit input + output buffers\n\n  const wrappedMarshal: MarshalFn = (data, memory) => {\n    // Ensure memory is large enough for the expected layout\n    if (memory.buffer.byteLength < REQUIRED_MEMORY) {\n      const pagesNeeded = Math.ceil((REQUIRED_MEMORY - memory.buffer.byteLength) / 65536);\n      memory.grow(pagesNeeded);\n    }\n\n    // Simple bump allocator starting at 192KB (after AS runtime heap region)\n    let heapOffset = INPUT_BUFFER_START;\n    const allocate = (size: number): number => {\n      const ptr = heapOffset;\n      heapOffset += size;\n      // Grow memory if needed\n      if (heapOffset > memory.buffer.byteLength) {\n        const pagesNeeded = Math.ceil((heapOffset - memory.buffer.byteLength) / 65536);\n        memory.grow(pagesNeeded);\n      }\n      return ptr;\n    };\n    return rawMarshal(data, memory, allocate);\n  };\n\n  return {\n    marshal: wrappedMarshal,\n    unmarshal: module.unmarshalOutput,\n  };\n}\n\n// Cache TypeCompiler to avoid repeated dynamic imports\nlet cachedTypeCompiler: unknown = null;\n\n/**\n * Load generated validation code as executable function.\n *\n * @param code - The generated validation code\n * @returns Validation function\n */\nexport async function loadGeneratedValidation(code: string): Promise<ValidateFn> {\n  // The generated validation code uses ES6 import/export syntax and TypeScript syntax\n  // We need to:\n  // 1. Strip import statements\n  // 2. Strip TypeScript type annotations\n  // 3. Convert exports to regular function/class definitions\n  // 4. Pass TypeCompiler as a dependency\n  // 5. Return the validateInput function\n\n  let cleanedCode = code;\n\n  // Remove import statements\n  const importRegex = /^import\\s+.*from\\s+['\"].*['\"];?\\s*$/gm;\n  cleanedCode = cleanedCode.replace(importRegex, '');\n\n  // Strip TypeScript parameter type annotations\n  // Matches: function foo(param: Type, other: Type)\n  cleanedCode = cleanedCode.replace(/(\\w+)\\s*:\\s*\\w+(?:<[^>]+>)?(?=[,)])/g, '$1');\n\n  // Strip TypeScript \"asserts\" return type annotations\n  // Matches: ): asserts data is Type {\n  cleanedCode = cleanedCode.replace(/\\):\\s+asserts\\s+\\w+\\s+is\\s+\\w+\\s*(<[^>]+>)?\\s*\\{/g, ') {');\n\n  // Strip TypeScript class property modifiers\n  // Matches: public readonly errors: Type {\n  cleanedCode = cleanedCode.replace(/public\\s+readonly\\s+/g, '');\n  cleanedCode = cleanedCode.replace(/public\\s+/g, '');\n\n  // Strip generic type annotations from Array\n  // Matches: Array<{...}> and Array<Type>\n  cleanedCode = cleanedCode.replace(/Array<([^>]+)>/g, 'Array');\n\n  // Strip TSchema type reference (from @sinclair/typebox)\n  cleanedCode = cleanedCode.replace(/:\\s*TSchema/g, '');\n\n  // Convert exports to regular definitions\n  cleanedCode = cleanedCode\n    .replace(/^export function validateInput/gm, 'function validateInput')\n    .replace(/^export class ValidationError/gm, 'class ValidationError')\n    .replace(/^export function checkInput/gm, 'function checkInput');\n\n  // Import TypeCompiler dynamically (cached for performance)\n  if (!cachedTypeCompiler) {\n    const module = await import('@sinclair/typebox/compiler');\n    cachedTypeCompiler = module.TypeCompiler;\n  }\n  const TypeCompiler = cachedTypeCompiler;\n\n  // Create a module object to hold the validator (no type annotation for Function context)\n  const module: any = {};\n\n  const setupFn = new Function(\n    'TypeCompiler',\n    'module',\n    `\n      ${cleanedCode}\n      module.validateInput = validateInput;\n    `,\n  );\n\n  setupFn(TypeCompiler, module);\n\n  if (!module.validateInput) {\n    throw new CompilationError(\n      'Generated validation code did not export validateInput function',\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { field: 'validationCode' },\n    );\n  }\n\n  return module.validateInput;\n}\n\n/**\n * Re-export validation code generation functions from marshal-gen\n */\nexport { generateValidationCode } from './marshal-gen';\n","// src/compiler/runtime.ts\n// Runtime execution support for evaluating compiled JDM decisions\n\nimport type { CompilationResult } from './types';\nimport {\n  loadGeneratedMarshaling,\n  loadGeneratedValidation,\n  type MarshalFn,\n  type UnmarshalFn,\n  type ValidateFn,\n} from './runtime-codegen';\n\n// ============================================================================\n// Memory Constants\n// ============================================================================\n\n/**\n * WebAssembly page size in bytes (64KB).\n * This is a fixed constant defined by the WebAssembly specification.\n * Used to calculate memory requirements and convert between pages and bytes.\n */\nconst WASM_PAGE_SIZE_BYTES = 65536;\n\n/**\n * Default maximum memory pages for compiled decisions (256 pages = 16MB).\n *\n * This limit balances:\n * 1. Allowing large decision tables with many rules\n * 2. Preventing unbounded memory growth\n * 3. Browser compatibility (most browsers support at least 32MB per WASM instance)\n *\n * Can be overridden via CompiledDecisionOptions.maximumMemoryPages.\n */\nconst DEFAULT_MAX_MEMORY_PAGES = 256;\n\n/**\n * Input buffer start offset in bytes (after null pointer trap).\n *\n * Must match INPUT_BUFFER_START in src/runtime/memory.ts (which equals\n * NULL_POINTER_TRAP_SIZE = 4 bytes). This ensures correct memory layout\n * coordination between JavaScript marshaling and WASM memory access.\n *\n * The first 4 bytes are reserved as a null pointer trap zone - accessing\n * address 0 will read/write this trap zone, helping catch null pointer bugs.\n */\nconst INPUT_BUFFER_START_OFFSET = 4;\n\n/**\n * Error type for runtime evaluation errors.\n */\nexport class RuntimeError extends Error {\n  constructor(\n    message: string,\n    public readonly code: number = -1,\n    public readonly context?: Record<string, unknown>,\n  ) {\n    super(message);\n    this.name = 'RuntimeError';\n  }\n}\n\n/**\n * Ensure WASM memory is large enough for the required size.\n *\n * This function checks if the current memory buffer is large enough\n * and grows it by 64KB pages if needed.\n *\n * @param memory - The WebAssembly.Memory instance\n * @param required - The required memory size in bytes\n * @throws {RuntimeError} If memory cannot be grown (e.g., exceeds maximum)\n *\n * @example\n * ```typescript\n * ensureMemory(memory, 131072); // Ensure at least 128KB is available\n * ```\n */\nexport function ensureMemory(memory: WebAssembly.Memory, required: number): void {\n  const current = memory.buffer.byteLength;\n  if (required <= current) {\n    return; // Already have enough memory\n  }\n\n  // Calculate how many pages to grow\n  const pagesNeeded = Math.ceil((required - current) / WASM_PAGE_SIZE_BYTES);\n\n  // Attempt to grow memory\n  try {\n    const oldPages = memory.grow(pagesNeeded);\n    if (oldPages < 0) {\n      throw new RuntimeError(`Failed to grow memory by ${pagesNeeded} pages`, 5); // OUT_OF_MEMORY\n    }\n  } catch (error) {\n    // Re-throw RuntimeError as-is\n    if (error instanceof RuntimeError) {\n      throw error;\n    }\n    throw new RuntimeError(\n      `Cannot grow WASM memory: required ${required} bytes, ` +\n        `current ${current} bytes, need ${pagesNeeded} more pages. ` +\n        (error instanceof Error ? error.message : String(error)),\n      5, // OUT_OF_MEMORY\n    );\n  }\n}\n\n// Re-export type definitions from runtime-codegen for backward compatibility\nexport type { MarshalFn, UnmarshalFn, ValidateFn } from './runtime-codegen';\n\n/**\n * Options for creating a CompiledDecision instance.\n */\nexport interface CompiledDecisionOptions {\n  /** The compiled WASM binary */\n  wasm: Uint8Array;\n  /** Schema hash for validation */\n  schemaHash: bigint;\n  /** Function to marshal input to WASM memory */\n  marshal: MarshalFn;\n  /** Function to unmarshal output from WASM memory */\n  unmarshal: UnmarshalFn;\n  /** Function to validate input against schema */\n  validate?: ValidateFn;\n  /** Initial memory size in pages (default: 1 page = 64KB) */\n  initialMemoryPages?: number;\n  /** Maximum memory pages (default: DEFAULT_MAX_MEMORY_PAGES = 256 pages = 16MB) */\n  maximumMemoryPages?: number;\n}\n\n/**\n * A compiled JDM decision ready for evaluation.\n *\n * This class manages the lifecycle of evaluating a compiled decision:\n * 1. Validates input against schema (fail fast with good error)\n * 2. Marshals input to WASM memory\n * 3. Resets heap for fresh evaluation\n * 4. Runs evaluation\n * 5. Checks for runtime errors (schema mismatch, etc.)\n * 6. Unmarshals output from WASM memory\n *\n * @example\n * ```typescript\n * const decision = new CompiledDecision({\n *   wasm: compilationResult.wasm,\n *   schemaHash: compilationResult.schemaHash,\n *   marshal: marshalInput,\n *   unmarshal: unmarshalOutput,\n *   validate: validateInput,\n * });\n *\n * const output = await decision.evaluate({ age: 25, name: 'Alice' });\n * ```\n */\nexport class CompiledDecision {\n  private instance: WebAssembly.Instance | null = null;\n  private memory: WebAssembly.Memory | null = null;\n  private module: WebAssembly.Module;\n  private marshal: MarshalFn;\n  private unmarshal: UnmarshalFn;\n  private validate?: ValidateFn;\n\n  constructor(private options: CompiledDecisionOptions) {\n    // WebAssembly.Module requires an ArrayBuffer starting at offset 0, but Uint8Array may\n    // be a view into a larger buffer at a non-zero offset, which would cause Module\n    // construction to fail. Create a proper Uint8Array view that the Module constructor\n    // can safely access, ensuring we only pass the exact bytes of the WASM binary.\n    const buffer = new Uint8Array(\n      options.wasm.buffer,\n      options.wasm.byteOffset,\n      options.wasm.byteLength,\n    );\n    this.module = new WebAssembly.Module(buffer as unknown as ArrayBuffer);\n\n    this.marshal = options.marshal;\n    this.unmarshal = options.unmarshal;\n    this.validate = options.validate;\n  }\n\n  /**\n   * Initialize the WebAssembly instance.\n   * This is done lazily on first evaluation, or can be called explicitly.\n   */\n  private async initialize(): Promise<void> {\n    if (this.instance !== null) {\n      return;\n    }\n\n    // Don't provide memory via import - let the WASM module use its own exported memory.\n    // AssemblyScript's incremental GC runtime requires specific memory initialization\n    // that only works correctly with the module's own memory.\n    this.instance = await WebAssembly.instantiate(this.module, {\n      env: {\n        abort: () => {\n          throw new RuntimeError('WASM abort called');\n        },\n        seed: () => {\n          return Date.now();\n        },\n        'Date.now': () => Date.now(),\n      },\n      // Empty index module provided for AssemblyScript compatibility\n      index: {},\n    });\n\n    // Get memory from the WASM module's exports\n    this.memory = this.instance.exports.memory as WebAssembly.Memory;\n  }\n\n  /**\n   * Evaluate the decision with the given input.\n   *\n   * @param input - The input data to evaluate\n   * @returns The output of the decision evaluation\n   * @throws {RuntimeError} If evaluation fails\n   * @throws {ValidationError} If input validation fails (if validate is provided)\n   */\n  async evaluate<I = Record<string, unknown>, O = Record<string, unknown>>(input: I): Promise<O> {\n    await this.initialize();\n\n    if (!this.instance || !this.memory) {\n      throw new RuntimeError('WASM instance not initialized');\n    }\n\n    // Local references to avoid null checks in the hot path\n    const memory = this.memory;\n    const instance = this.instance;\n\n    // 1. Validate input against schema (fail fast with good error)\n    if (this.validate) {\n      try {\n        this.validate(input);\n      } catch (error) {\n        if (error instanceof Error) {\n          throw new RuntimeError(`Input validation failed: ${error.message}`, 1, { input });\n        }\n        throw error;\n      }\n    }\n\n    // Clear any stale error state from previous evaluations before starting new evaluation.\n    // This ensures each evaluation starts with a clean slate.\n    const clearLastErrorFn = instance.exports.clearLastError as () => void;\n    if (clearLastErrorFn) {\n      clearLastErrorFn();\n    }\n\n    try {\n      // 2. Marshal input to WASM memory\n      const inputPtr: number = this.marshal(input as Record<string, unknown>, memory);\n\n      // Verify input pointer is valid\n      if (inputPtr < INPUT_BUFFER_START_OFFSET) {\n        throw new RuntimeError(\n          `Invalid input pointer: ${inputPtr} (must be >= ${INPUT_BUFFER_START_OFFSET})`,\n        );\n      }\n\n      // 3. Reset heap for fresh evaluation\n      const resetHeapFn = instance.exports.resetHeap as () => void;\n      if (resetHeapFn) {\n        resetHeapFn();\n      }\n\n      // 4. Run evaluation\n      const evaluateFn = instance.exports.evaluate as (ptr: number) => number;\n      if (!evaluateFn) {\n        throw new RuntimeError('evaluate function not exported from WASM module');\n      }\n\n      const outputPtr: number = evaluateFn(inputPtr);\n\n      // 5. Check for runtime errors (schema mismatch, etc.)\n      const getLastErrorFn = instance.exports.getLastError as () => number;\n      if (getLastErrorFn) {\n        const errorCode = getLastErrorFn();\n        if (errorCode !== 0) {\n          throw new RuntimeError(this.getErrorMessage(errorCode), errorCode, { input, outputPtr });\n        }\n      }\n\n      // Verify output pointer is valid\n      // Output pointer validity is verified during unmarshal - we only check it's within\n      // addressable memory here to avoid segfault.\n      if (outputPtr < memory.buffer.byteLength) {\n        // Output pointer should be within a reasonable range\n        // We'll verify the unmarshal works properly\n      }\n\n      // 6. Unmarshal output from WASM memory\n      const output = this.unmarshal(outputPtr, memory);\n\n      return output as O;\n    } finally {\n      // Always clear error state after evaluation, even if an error was thrown.\n      // This prevents stale error state from affecting subsequent evaluations.\n      if (clearLastErrorFn) {\n        clearLastErrorFn();\n      }\n    }\n  }\n\n  /**\n   * Get a human-readable error message for a given error code.\n   *\n   * @param errorCode - The error code from getLastError()\n   * @returns A human-readable error message\n   */\n  private getErrorMessage(errorCode: number): string {\n    // Error codes duplicated from assembly/runtime/errors.ts because WASM cannot export\n    // enum metadata - these must stay synchronized.\n    // NONE = 0, SCHEMA_MISMATCH = 1, NULL_POINTER = 2, INVALID_ACCESS = 3, EVALUATION_ERROR = 4, OUT_OF_MEMORY = 5\n    const errorMessages: Record<number, string> = {\n      0: 'No error',\n      1: 'Schema mismatch: input data does not match expected schema',\n      2: 'Null pointer dereference',\n      3: 'Invalid memory access',\n      4: 'Evaluation error',\n      5: 'Out of memory',\n    };\n\n    return errorMessages[errorCode] ?? `Unknown error code: ${errorCode}`;\n  }\n\n  /**\n   * Get the current WebAssembly memory instance.\n   * This can be useful for debugging or direct memory inspection.\n   *\n   * @returns The WebAssembly.Memory instance (null if not initialized)\n   */\n  getMemory(): WebAssembly.Memory | null {\n    return this.memory;\n  }\n\n  /**\n   * Get the current WebAssembly instance.\n   *\n   * @returns The WebAssembly.Instance instance (null if not initialized)\n   */\n  getInstance(): WebAssembly.Instance | null {\n    return this.instance;\n  }\n\n  /**\n   * Dispose of this CompiledDecision instance.\n   * This clears the WebAssembly instance and allows garbage collection.\n   */\n  dispose(): void {\n    this.instance = null;\n  }\n\n  /**\n   * Get memory usage statistics.\n   *\n   * @returns Object with memory usage information\n   */\n  getMemoryStats(): { current: number; maximum: number; used: number } {\n    // Note: 'used' equals 'current' because WebAssembly.Memory doesn't expose actual heap\n    // usage - tracking used bytes requires instrumentation in AssemblyScript allocator.\n    const currentBytes = this.memory?.buffer.byteLength ?? 0;\n    return {\n      current: currentBytes,\n      maximum: (this.options.maximumMemoryPages ?? DEFAULT_MAX_MEMORY_PAGES) * WASM_PAGE_SIZE_BYTES,\n      used: currentBytes,\n    };\n  }\n\n  /**\n   * Get the input buffer pointer, ensuring sufficient memory is available.\n   *\n   * This method doesn't allocate new buffers on each call - it always returns the\n   * same INPUT_BUFFER_START_OFFSET constant after ensuring the memory can accommodate the\n   * required size. Single-allocation design chosen because: (1) heap is reset between\n   * evaluations so fragmentation isn't an issue, (2) simpler than maintaining a free\n   * list, (3) marshal code controls actual layout in WASM memory. All input data is\n   * marshaled into a single buffer starting at INPUT_BUFFER_START_OFFSET.\n   *\n   * @param required - The required memory size in bytes\n   * @returns The base pointer of the input buffer (always INPUT_BUFFER_START_OFFSET)\n   * @throws {RuntimeError} If memory cannot be grown to accommodate the required size\n   *\n   * @example\n   * ```typescript\n   * const ptr = decision.getInputBuffer(1024); // Ensure 1KB available\n   * ```\n   */\n  getInputBuffer(required: number): number {\n    if (!this.memory) {\n      throw new RuntimeError('Memory not initialized - call evaluate() first', 5);\n    }\n\n    // Ensure enough memory\n    try {\n      ensureMemory(this.memory, required);\n    } catch (error) {\n      throw new RuntimeError(\n        `Memory allocation failed: ${error instanceof Error ? error.message : String(error)}`,\n        5, // OUT_OF_MEMORY error code\n      );\n    }\n\n    // Single-allocation design: return the INPUT_BUFFER_START_OFFSET\n    return INPUT_BUFFER_START_OFFSET;\n  }\n}\n\n/**\n * Create a CompiledDecision instance from a CompilationResult.\n *\n * This is a convenience function that creates the necessary marshal,\n * unmarshal, and validation functions from the generated code.\n *\n * @param result - The compilation result\n * @param validate - Optional validation function (defaults to generated validation code)\n * @returns A CompiledDecision instance ready for evaluation\n *\n * @example\n * ```typescript\n * const result = await compile({\n *   jdm: myJdm,\n *   inputSchema: MyInputSchema,\n *   outputSchema: MyOutputSchema,\n * });\n *\n * const decision = createCompiledDecision(result);\n * const output = await decision.evaluate({ age: 25 });\n * ```\n */\nexport async function createCompiledDecision(\n  result: CompilationResult,\n  validate?: ValidateFn,\n): Promise<CompiledDecision> {\n  // Load the marshal and unmarshal functions from the generated code\n  const { marshal, unmarshal } = loadGeneratedMarshaling(result.marshalCode);\n\n  // Load or use provided validation function\n  const validator = validate ?? (await loadGeneratedValidation(result.validationCode));\n\n  return new CompiledDecision({\n    wasm: result.wasm,\n    schemaHash: result.schemaHash,\n    marshal,\n    unmarshal,\n    validate: validator,\n  });\n}\n\n// Re-export compile-time code generation functions for backward compatibility\nexport { loadGeneratedMarshaling, loadGeneratedValidation } from './runtime-codegen';\n\n/**\n * Re-export types from dependencies\n */\nexport type { TSchema } from '@sinclair/typebox';\n","/**\n * Compile AssemblyScript code to WebAssembly.\n *\n * This module provides the main entry point for WASM compilation with caching.\n * Implementation details are delegated to specialized modules:\n * - virtual-fs.ts: Virtual filesystem for in-memory ASC compilation\n * - asc-compiler.ts: AssemblyScript compiler invocation and configuration\n * - wasm-instantiate.ts: WASM module instantiation and host environment\n */\n\nimport type { CompilerOptions } from './types';\nimport { computeCacheKey, readCacheFromDisk, writeCacheToDisk, isCacheEnabled } from './cache';\nimport { compileAssemblyScriptInternal } from './asc-compiler';\n\n// Re-export for backward compatibility\nexport { instantiateWasm } from './wasm-instantiate';\n\n/**\n * Compile AssemblyScript code to WebAssembly.\n *\n * This function uses the AssemblyScript compiler to generate WASM from\n * the generated AssemblyScript source code using a virtual filesystem.\n *\n * Supports disk-based caching to avoid redundant compilations.\n * Cache is keyed on: AssemblyScript code + runtime libraries + compiler options.\n *\n * **Filesystem Side Effects:**\n * - Compilation may read/write cache files (unless disabled via JDM_ASM_NO_CACHE=1)\n * - If `options.debugOutputPath` is set or `JDM_ASM_DEBUG_OUTPUT` env var is defined,\n *   compilation failures will write debug files to disk (see CompilerOptions.debugOutputPath)\n *\n * @param code - The AssemblyScript source code to compile\n * @param options - Compiler options (optimize, debug, debugOutputPath, etc.)\n * @returns An object with the compiled binary and WAT text\n */\nexport async function compileAssemblyScript(\n  code: string,\n  options: CompilerOptions,\n): Promise<{ binary: Uint8Array; wat: string }> {\n  // Check cache first (unless disabled)\n  if (isCacheEnabled()) {\n    const cacheKey = computeCacheKey(code, options);\n    const cached = readCacheFromDisk(cacheKey);\n    if (cached) {\n      return cached;\n    }\n\n    // Compile and cache the result\n    const result = await compileAssemblyScriptInternal(code, options);\n    writeCacheToDisk(cacheKey, result);\n    return result;\n  }\n\n  // Cache disabled, compile directly\n  return compileAssemblyScriptInternal(code, options);\n}\n","import { type TSchema, Kind } from '@sinclair/typebox';\nimport type { FlattenedLayout } from './types';\nimport { createHash } from 'crypto';\n\n/**\n * Schema field information for memory layout\n */\ninterface SchemaField {\n  schema: TSchema;\n  path: string;\n  flatName: string;\n}\n\n/**\n * Flattens a TypeBox schema to a memory layout.\n *\n * This function processes a schema and produces a flattened representation\n * that can be used for direct memory access in WebAssembly.\n *\n * Memory structure:\n * ┌─────────────────────────────────────────────────────────────┐\n * │ Fixed Fields (numbers, bools, enum indices)                 │\n * │   customer_age: f64 (8 bytes)                               │\n * │   customer_tier: i32 (4 bytes) - enum index                 │\n * ├─────────────────────────────────────────────────────────────┤\n * │ String/Array Pointers (offset, length pairs)                │\n * │   order_items_ptr: i32, order_items_len: i32                │\n * ├─────────────────────────────────────────────────────────────┤\n * │ Variable-length data (UTF-16 strings, array contents)       │\n * └─────────────────────────────────────────────────────────────┘\n *\n * @param schema - The TypeBox schema to flatten\n * @param _prefix - Internal parameter for recursive flattening with dotted paths\n * @returns The flattened memory layout\n */\nexport function flattenSchema(schema: TSchema): FlattenedLayout {\n  const layout: FlattenedLayout = {\n    fields: [],\n  };\n\n  // Collect all fields from the schema\n  const fields: SchemaField[] = collectFields(schema, '');\n\n  // Track current offset for field layout\n  let currentOffset = 0;\n\n  // Process fields: first pass - fixed types\n  for (const field of fields) {\n    const typeInfo = getFieldType(field.schema);\n    if (typeInfo.isFixed) {\n      layout.fields.push({\n        path: field.path,\n        flatName: field.flatName,\n        type: typeInfo.asType,\n        offset: currentOffset,\n        size: typeInfo.size,\n      });\n      currentOffset += typeInfo.size;\n    }\n  }\n\n  // Second pass - variable types (strings, arrays)\n  // These get pointers (2 x i32 = 8 bytes each for offset + length)\n  for (const field of fields) {\n    const typeInfo = getFieldType(field.schema);\n    if (!typeInfo.isFixed) {\n      layout.fields.push({\n        path: field.path,\n        flatName: field.flatName,\n        type: typeInfo.asType,\n        offset: currentOffset,\n        size: -1, // Variable length\n      });\n      currentOffset += 8; // 4 bytes offset + 4 bytes length\n    }\n  }\n\n  return layout;\n}\n\n/**\n * Collect all fields from a schema recursively\n */\nfunction collectFields(schema: TSchema, path: string): SchemaField[] {\n  const fields: SchemaField[] = [];\n\n  const kind = (schema as any)[Kind];\n\n  if (kind === 'Object') {\n    const properties = (schema as any).properties || {};\n    for (const [name, fieldSchema] of Object.entries(properties)) {\n      const fieldPath = path ? `${path}.${name}` : name;\n      const flatName = path ? `${path}_${name}` : name;\n\n      const nestedFields = collectFields(fieldSchema as TSchema, fieldPath);\n      if (nestedFields.length > 0) {\n        fields.push(...nestedFields);\n      } else {\n        fields.push({\n          schema: fieldSchema as TSchema,\n          path: fieldPath,\n          flatName,\n        });\n      }\n    }\n  }\n\n  // For non-objects, return empty array (handled by parent)\n  return fields;\n}\n\n/**\n * Get type information for a schema field\n */\nfunction getFieldType(schema: TSchema): {\n  isFixed: boolean;\n  asType: 'f64' | 'i32' | 'i64' | 'bool' | 'string' | 'array';\n  size: number;\n} {\n  const kind = (schema as any)[Kind];\n\n  switch (kind) {\n    case 'Number':\n      return { isFixed: true, asType: 'f64', size: 8 };\n\n    case 'Integer':\n      return { isFixed: true, asType: 'i32', size: 4 };\n\n    case 'Boolean':\n      // Booleans stored as i32 (4 bytes) to ensure natural alignment and match AssemblyScript's\n      // bool representation\n      return { isFixed: true, asType: 'bool', size: 4 };\n\n    case 'String':\n      return { isFixed: false, asType: 'string', size: -1 };\n\n    case 'Array':\n      return { isFixed: false, asType: 'array', size: -1 };\n\n    case 'Literal':\n      // Literals are stored as i32 indices (for boolean-like or enum-like)\n      return { isFixed: true, asType: 'i32', size: 4 };\n\n    case 'Union':\n      // First, handle unions of Literal types (enum-like) as i32 indices for efficiency\n      const anyOf = (schema as any).anyOf;\n      if (Array.isArray(anyOf) && anyOf.length > 0) {\n        const firstKind = (anyOf[0] as any)[Kind];\n        if (firstKind === 'Literal') {\n          return { isFixed: true, asType: 'i32', size: 4 };\n        }\n      }\n      // Default to string for heterogeneous unions - can represent multiple incompatible types\n      // (e.g., string | number | object)\n      return { isFixed: false, asType: 'string', size: -1 };\n\n    default:\n      // Default to string for unknown types\n      return { isFixed: false, asType: 'string', size: -1 };\n  }\n}\n\n/**\n * Compute a hash of the input and output schemas for runtime validation.\n *\n * This hash is embedded in the compiled WASM module and can be used to\n * verify that the runtime data matches the expected schema.\n *\n * Uses SHA256 to create a canonical hash, then takes the first 8 bytes as u64.\n *\n * @param inputSchema - The input schema\n * @param outputSchema - The output schema\n * @returns A 64-bit hash value\n */\nexport function computeSchemaHash(inputSchema: TSchema, outputSchema: TSchema): bigint {\n  // Create canonical representation with sorted keys\n  const canonical = JSON.stringify(\n    {\n      input: canonicalizeSchema(inputSchema),\n      output: canonicalizeSchema(outputSchema),\n    },\n    null,\n    2,\n  );\n\n  // Compute SHA256 hash\n  const hash = createHash('sha256').update(canonical).digest();\n\n  // Take first 8 bytes as u64 (little-endian)\n  return hash.readBigUInt64LE(0);\n}\n\n/**\n * Convert a schema to a canonical form for hashing by sorting keys and normalizing structure\n */\nfunction canonicalizeSchema(schema: TSchema): unknown {\n  const kind = (schema as any)[Kind];\n\n  if (kind === 'Object') {\n    const properties = (schema as any).properties || {};\n    const canonical: Record<string, unknown> = {};\n    const keys = Object.keys(properties).sort();\n\n    for (const key of keys) {\n      canonical[key] = canonicalizeSchema(properties[key]);\n    }\n\n    return {\n      type: 'object',\n      properties: canonical,\n      required: ((schema as any).required || []).sort(),\n    };\n  }\n\n  if (kind === 'Array') {\n    return {\n      type: 'array',\n      items: canonicalizeSchema((schema as any).items),\n    };\n  }\n\n  if (kind === 'Enum') {\n    return {\n      type: 'enum',\n      values: ((schema as any).anyOf || []).map((val: TSchema) => (val as any).const).sort(),\n    };\n  }\n\n  if (kind === 'Literal') {\n    return {\n      type: 'literal',\n      value: (schema as any).const,\n    };\n  }\n\n  // For primitive types, return a simple representation\n  const primitiveTypes: Record<string, string> = {\n    Number: 'number',\n    Integer: 'integer',\n    String: 'string',\n    Boolean: 'boolean',\n  };\n\n  return primitiveTypes[kind] || kind;\n}\n","// src/compiler/index.ts\nimport type { TSchema } from '@sinclair/typebox';\nimport { parseJDM, type JDMDecision } from './parser';\nimport { compileDecision } from './codegen';\nimport { compileAssemblyScript } from './build';\nimport { flattenSchema, computeSchemaHash } from './schema';\nimport { generateMarshalCode, generateValidationCode } from './marshal-gen';\nimport type {\n  CompilerOptions,\n  CompilationResult,\n  CompilationContext,\n  NoMatchBehavior,\n} from './types';\nimport { readFileSync } from 'fs';\nimport path from 'path';\n\n/**\n * Type guard for Node.js file system errors.\n */\nfunction isFileNotFoundError(error: unknown): boolean {\n  return error !== null && typeof error === 'object' && 'code' in error && error.code === 'ENOENT';\n}\n\n/**\n * Creates a filesystem-based loader for sub-decision JDM files.\n *\n * This loader performs I/O by reading from the filesystem and may throw filesystem errors\n * (e.g., ENOENT for missing files, EACCES for permission denied).\n *\n * Supports both zen-engine compatibility (flat structure in zen-reference/) and organized test\n * structure (nested by feature in sub-decisions/). This dual approach allows us to port\n * zen-engine fixtures without reorganization while providing better organization for our own\n * tests.\n *\n * @param testDataRoot - Optional root directory for test data. Defaults to \"test-data/\" in current working directory.\n * @returns A loader function that reads JDM files from the filesystem\n * @throws Error if file is not found in any search path\n * @throws Error for other filesystem errors (permissions, invalid content, etc.)\n */\nfunction createFilesystemLoader(testDataRoot?: string): (key: string) => JDMDecision {\n  const root = testDataRoot || path.join(process.cwd(), 'test-data');\n  const possiblePaths = [\n    root,\n    path.join(root, 'sub-decisions'),\n    path.join(root, 'sub-decisions/basic'),\n    path.join(root, 'sub-decisions/simple-multi'),\n    path.join(root, 'sub-decisions/complex-multi'),\n    path.join(root, 'sub-decisions/diamond'),\n    path.join(root, 'sub-decisions/error-propagation'),\n    path.join(root, 'zen-reference'),\n  ];\n\n  return (key: string): JDMDecision => {\n    for (const basePath of possiblePaths) {\n      try {\n        const filePath = path.join(basePath, key);\n        const content = readFileSync(filePath, 'utf-8');\n        return parseJDM(content);\n      } catch (error) {\n        // Only try next path for file-not-found errors\n        // Let other errors (parse errors, permission denied) propagate immediately\n        if (isFileNotFoundError(error)) {\n          continue;\n        }\n        throw error;\n      }\n    }\n    throw new Error(\n      `Failed to load sub-decision \"${key}\": not found in any search path (${possiblePaths.join(', ')})`,\n    );\n  };\n}\n\n// Re-export parser, graph, optimizer, runtime, validation, types, and errors\nexport * from './parser';\nexport * from './graph';\nexport * from './types';\nexport * from './errors';\nexport * from './optimizer';\nexport * from './runtime';\nexport * from './runtime-codegen';\n\n// Validation modules - split by concern:\n// - compile-time-validation: Static analysis of JDM structure and references\n// - runtime-validation-codegen: Validation code that executes at runtime\nexport * from './compile-time-validation';\nexport * from './runtime-validation-codegen';\n\n// Backward compatibility: re-export from input-validation (deprecated)\nexport * from './input-validation';\n\n// Export cache utilities for advanced usage\nexport {\n  clearCache,\n  getCacheStats,\n  pruneCache,\n  isCacheEnabled,\n  getCacheDirectory,\n  getCacheHealth,\n} from './cache';\n\n/**\n * Main entry point: Compile JDM to WASM with schema-driven marshaling.\n *\n * @example\n * const result = await compile({\n *   inputSchema: InputSchema,\n *   outputSchema: OutputSchema,\n *   jdm: jdmJson,\n *   optimize: true,\n * });\n */\nexport async function compile(options: {\n  inputSchema: TSchema;\n  outputSchema: TSchema;\n  jdm: string | JDMDecision;\n  optimize?: boolean;\n  debug?: boolean;\n  /** How to handle cases where no rules match in decision tables/switches */\n  noMatchBehavior?: NoMatchBehavior;\n  /** Optional loader function to load sub-decision JDM files */\n  loadDecision?: CompilerOptions['loadDecision'];\n  /** Optional testDataRoot path for default loader to search */\n  testDataRoot?: string;\n}): Promise<CompilationResult> {\n  const opts: CompilerOptions = {\n    optimize: options.optimize ?? true,\n    debug: options.debug ?? false,\n    // Validation disabled during compilation for performance (compile-time checks).\n    // Schema validation is generated as separate code (generateValidationCode()) that\n    // the runtime can call before evaluation.\n    validate: false,\n    noMatchBehavior: options.noMatchBehavior,\n  };\n\n  // Phase 1: Parse and validate JDM\n  const parsed = parseJDM(options.jdm);\n\n  // Phase 2: Flatten schemas to memory layout\n  const inputLayout = flattenSchema(options.inputSchema);\n  const outputLayout = flattenSchema(options.outputSchema);\n\n  // Phase 3: Compute schema hash for runtime validation\n  const schemaHash = computeSchemaHash(options.inputSchema, options.outputSchema);\n\n  // Phase 4: Build compilation context\n  const context: CompilationContext = {\n    jdm: parsed,\n    inputSchema: options.inputSchema,\n    outputSchema: options.outputSchema,\n    inputLayout,\n    outputLayout,\n    schemaHash,\n    options: opts,\n    parseExpression: (expr) => parseStandardExpression(expr),\n    parseUnaryExpression: (expr) => parseUnaryExpressionImpl(expr),\n    getUniqueId: createIdGenerator(),\n    loadDecision: options.loadDecision ?? createFilesystemLoader(options.testDataRoot),\n    // Avoids duplicate compilation when multiple nodes reference same sub-decision\n    compiledSubDecisions: new Map(),\n    // Detects circular references to prevent infinite loops during compilation\n    decisionPath: [],\n    helperFunctions: new Map(),\n  };\n\n  // Phase 5: Generate AssemblyScript code\n  const asCode = compileDecision(parsed, context);\n\n  // Phase 6: Compile to WASM\n  const { binary, wat } = await compileAssemblyScript(asCode, opts);\n\n  // Phase 7: Generate JS marshaling code\n  const marshalCode = generateMarshalCode(inputLayout, outputLayout, schemaHash);\n  const validationCode = generateValidationCode(options.inputSchema);\n\n  return {\n    wasm: binary,\n    schemaHash,\n    marshalCode,\n    validationCode,\n    wat: opts.debug ? wat : undefined,\n    assemblyScript: opts.debug ? asCode : undefined,\n  };\n}\n\nfunction createIdGenerator(): (prefix: string) => string {\n  const counters = new Map<string, number>();\n  return (prefix: string) => {\n    const count = counters.get(prefix) ?? 0;\n    counters.set(prefix, count + 1);\n    return `${prefix}_${count}`;\n  };\n}\n\n// Import parse functions\nimport {\n  parseStandardExpression,\n  parseUnaryExpression as parseUnaryExpressionImpl,\n} from './unary-parser';\n","/**\n * Union type of all expression AST nodes.\n */\nexport type ExpressionAST =\n  | NumberLiteral\n  | StringLiteral\n  | BooleanLiteral\n  | NullLiteral\n  | Identifier\n  | DollarRef\n  | HashRef\n  | BinaryOp\n  | UnaryOp\n  | TernaryOp\n  | MemberAccess\n  | IndexAccess\n  | FunctionCall\n  | Interval\n  | TemplateLiteral\n  | ArrayLiteral\n  | ObjectLiteral;\n\nexport interface NumberLiteral {\n  type: 'NumberLiteral';\n  value: number;\n}\n\nexport interface StringLiteral {\n  type: 'StringLiteral';\n  value: string;\n}\n\nexport interface BooleanLiteral {\n  type: 'BooleanLiteral';\n  value: boolean;\n}\n\nexport interface NullLiteral {\n  type: 'NullLiteral';\n}\n\nexport interface Identifier {\n  type: 'Identifier';\n  name: string;\n}\n\n/**\n * Dollar reference - used in unary mode to refer to the current value.\n * Represents `$` in decision table cell expressions.\n */\nexport interface DollarRef {\n  type: 'DollarRef';\n}\n\n/**\n * Hash reference - used in higher-order functions to refer to current element.\n * Represents `#` in expressions like `filter(items, # > 5)`.\n */\nexport interface HashRef {\n  type: 'HashRef';\n}\n\nexport interface BinaryOp {\n  type: 'BinaryOp';\n  op: BinaryOperator;\n  left: ExpressionAST;\n  right: ExpressionAST;\n}\n\nexport type BinaryOperator =\n  // Arithmetic\n  | '+'\n  | '-'\n  | '*'\n  | '/'\n  | '%'\n  | '^'\n  // Comparison\n  | '=='\n  | '!='\n  | '<'\n  | '>'\n  | '<='\n  | '>='\n  // Logical\n  | 'and'\n  | 'or'\n  | '??'\n  // Membership\n  | 'in'\n  | 'not in';\n\nexport interface UnaryOp {\n  type: 'UnaryOp';\n  op: UnaryOperator;\n  operand: ExpressionAST;\n}\n\nexport type UnaryOperator = 'not' | '-';\n\nexport interface TernaryOp {\n  type: 'TernaryOp';\n  condition: ExpressionAST;\n  consequent: ExpressionAST;\n  alternate: ExpressionAST;\n}\n\nexport interface MemberAccess {\n  type: 'MemberAccess';\n  object: ExpressionAST;\n  property: string;\n}\n\nexport interface IndexAccess {\n  type: 'IndexAccess';\n  object: ExpressionAST;\n  index: ExpressionAST;\n}\n\nexport interface FunctionCall {\n  type: 'FunctionCall';\n  callee: ExpressionAST;\n  args: ExpressionAST[];\n}\n\nexport interface Interval {\n  type: 'Interval';\n  start: ExpressionAST;\n  end: ExpressionAST;\n  startInclusive: boolean;\n  endInclusive: boolean;\n}\n\nexport interface TemplateLiteral {\n  type: 'TemplateLiteral';\n  parts: Array<{ text: string } | { expr: ExpressionAST }>;\n}\n\nexport interface ArrayLiteral {\n  type: 'ArrayLiteral';\n  elements: ExpressionAST[];\n}\n\nexport interface ObjectLiteral {\n  type: 'ObjectLiteral';\n  properties: Array<{ key: string; value: ExpressionAST }>;\n}\n\nexport function isNumberLiteral(node: ExpressionAST): node is NumberLiteral {\n  return node.type === 'NumberLiteral';\n}\n\nexport function isStringLiteral(node: ExpressionAST): node is StringLiteral {\n  return node.type === 'StringLiteral';\n}\n\nexport function isBooleanLiteral(node: ExpressionAST): node is BooleanLiteral {\n  return node.type === 'BooleanLiteral';\n}\n\nexport function isNullLiteral(node: ExpressionAST): node is NullLiteral {\n  return node.type === 'NullLiteral';\n}\n\nexport function isIdentifier(node: ExpressionAST): node is Identifier {\n  return node.type === 'Identifier';\n}\n\nexport function isDollarRef(node: ExpressionAST): node is DollarRef {\n  return node.type === 'DollarRef';\n}\n\nexport function isHashRef(node: ExpressionAST): node is HashRef {\n  return node.type === 'HashRef';\n}\n\nexport function isBinaryOp(node: ExpressionAST): node is BinaryOp {\n  return node.type === 'BinaryOp';\n}\n\nexport function isUnaryOp(node: ExpressionAST): node is UnaryOp {\n  return node.type === 'UnaryOp';\n}\n\nexport function isTernaryOp(node: ExpressionAST): node is TernaryOp {\n  return node.type === 'TernaryOp';\n}\n\nexport function isMemberAccess(node: ExpressionAST): node is MemberAccess {\n  return node.type === 'MemberAccess';\n}\n\nexport function isIndexAccess(node: ExpressionAST): node is IndexAccess {\n  return node.type === 'IndexAccess';\n}\n\nexport function isFunctionCall(node: ExpressionAST): node is FunctionCall {\n  return node.type === 'FunctionCall';\n}\n\nexport function isInterval(node: ExpressionAST): node is Interval {\n  return node.type === 'Interval';\n}\n\nexport function isTemplateLiteral(node: ExpressionAST): node is TemplateLiteral {\n  return node.type === 'TemplateLiteral';\n}\n\nexport function isArrayLiteral(node: ExpressionAST): node is ArrayLiteral {\n  return node.type === 'ArrayLiteral';\n}\n\nexport function isObjectLiteral(node: ExpressionAST): node is ObjectLiteral {\n  return node.type === 'ObjectLiteral';\n}\n","import { createToken, CstParser, Lexer, type IToken } from 'chevrotain';\nimport { CompilationError, ErrorCode, type SourceLocation } from './errors';\n\n// === TOKENS (order matters - longer matches first) ===\n\nconst WhiteSpace = createToken({\n  name: 'WhiteSpace',\n  pattern: /\\s+/,\n  group: Lexer.SKIPPED,\n});\n\nconst DotDot = createToken({ name: 'DotDot', pattern: /\\.\\./ });\nconst Dot = createToken({ name: 'Dot', pattern: /\\./ });\n\nconst Eq = createToken({ name: 'Eq', pattern: /==/ });\nconst NotEq = createToken({ name: 'NotEq', pattern: /!=/ });\nconst EqEq = createToken({ name: 'EqEq', pattern: /===/ });\nconst NotEqEq = createToken({ name: 'NotEqEq', pattern: /!==/ });\nconst LtEq = createToken({ name: 'LtEq', pattern: /<=/ });\nconst GtEq = createToken({ name: 'GtEq', pattern: />=/ });\nconst Lt = createToken({ name: 'Lt', pattern: /</ });\nconst Gt = createToken({ name: 'Gt', pattern: />/ });\n\nconst AndAnd = createToken({ name: 'AndAnd', pattern: /&&/ });\nconst OrOr = createToken({ name: 'OrOr', pattern: /\\|\\|/ });\nconst NotNot = createToken({ name: 'NotNot', pattern: /!/ });\n\n// Keywords use longer_alt to ensure 'and'/'or' are recognized as operators rather than\n// variable names - Chevrotain tries longer_alt tokens first, preventing 'android' from\n// incorrectly tokenizing as 'and' + 'roid'.\nconst Identifier = createToken({ name: 'Identifier', pattern: /[$a-zA-Z_]\\w*/ });\n\nconst And = createToken({ name: 'And', pattern: /and/, longer_alt: Identifier });\nconst Or = createToken({ name: 'Or', pattern: /or/, longer_alt: Identifier });\nconst Not = createToken({ name: 'Not', pattern: /not/, longer_alt: Identifier });\nconst In = createToken({ name: 'In', pattern: /in/, longer_alt: Identifier });\n\nconst True = createToken({ name: 'True', pattern: /true/, longer_alt: Identifier });\nconst False = createToken({ name: 'False', pattern: /false/, longer_alt: Identifier });\nconst Null = createToken({ name: 'Null', pattern: /null/, longer_alt: Identifier });\n\nconst NumberLiteral = createToken({\n  name: 'NumberLiteral',\n  pattern: /\\d[\\d_]*(\\.\\d+)?/,\n});\n\nconst StringLiteral = createToken({\n  name: 'StringLiteral',\n  pattern: /\"([^\"\\\\]|\\\\.)*\"|'([^'\\\\]|\\\\.)*'/,\n});\n\n// Template strings\n// Token order critical: TemplateHead/Middle/Tail must precede TemplateNoSub because Chevrotain matches first token that fits.\n// Without this order, '`foo${x}`' would incorrectly match TemplateNoSub instead of TemplateHead + expr + TemplateTail.\n// TemplateNoSub pattern must explicitly exclude ${ to prevent ambiguity between templates with/without interpolation.\nconst TemplateHead = createToken({\n  name: 'TemplateHead',\n  pattern: /`(?:[^`\\\\$]|\\\\.|\\$(?!\\{))*?\\$\\{/,\n});\nconst TemplateMiddle = createToken({\n  name: 'TemplateMiddle',\n  pattern: /\\}(?:[^`\\\\$]|\\\\.|\\$(?!\\{))*?\\$\\{/,\n});\nconst TemplateTail = createToken({\n  name: 'TemplateTail',\n  pattern: /\\}(?:[^`\\\\$]|\\\\.|\\$(?!\\{))*?`/,\n});\n// TemplateNoSub should NOT match strings that contain ${, so we exclude them explicitly\nconst TemplateNoSub = createToken({\n  name: 'TemplateNoSub',\n  pattern: /`(?:[^`\\\\$]|\\\\.|\\$(?!\\{))*?`/,\n});\n\nconst Hash = createToken({ name: 'Hash', pattern: /#/ }); // Current element in higher-order functions\n// Dollar ($) represents explicit reference in unary mode. Uses longer_alt: Identifier to ensure $-prefixed identifiers like '$myVar'\n// are tokenized as a single Identifier token rather than separate Dollar + Identifier tokens, since Identifier pattern includes '$' prefix.\nconst Dollar = createToken({ name: 'Dollar', pattern: /\\$/, longer_alt: Identifier });\n\n// Operators and delimiters\nconst Plus = createToken({ name: 'Plus', pattern: /\\+/ });\nconst Minus = createToken({ name: 'Minus', pattern: /-/ });\nconst Mult = createToken({ name: 'Mult', pattern: /\\*/ });\nconst Div = createToken({ name: 'Div', pattern: /\\// });\nconst Mod = createToken({ name: 'Mod', pattern: /%/ });\nconst Power = createToken({ name: 'Power', pattern: /\\^/ });\n\nconst LParen = createToken({ name: 'LParen', pattern: /\\(/ });\nconst RParen = createToken({ name: 'RParen', pattern: /\\)/ });\nconst LBracket = createToken({ name: 'LBracket', pattern: /\\[/ });\nconst RBracket = createToken({ name: 'RBracket', pattern: /\\]/ });\n\nconst LBrace = createToken({ name: 'LBrace', pattern: /\\{/ });\nconst RBrace = createToken({ name: 'RBrace', pattern: /\\}/ });\n\nconst Comma = createToken({ name: 'Comma', pattern: /,/ });\nconst Question = createToken({ name: 'Question', pattern: /\\?/, longer_alt: Identifier });\nconst QuestionQuestion = createToken({ name: 'QuestionQuestion', pattern: /\\?\\?/ });\nconst Colon = createToken({ name: 'Colon', pattern: /:/ });\n\nconst allTokens = [\n  WhiteSpace,\n  DotDot,\n  Dot,\n  EqEq,\n  NotEqEq,\n  Eq,\n  NotEq,\n  LtEq,\n  GtEq,\n  Lt,\n  Gt,\n  AndAnd,\n  OrOr,\n  NotNot,\n  And,\n  Or,\n  Not,\n  In,\n  True,\n  False,\n  Null,\n  Plus,\n  Minus,\n  Mult,\n  Div,\n  Mod,\n  Power,\n  LParen,\n  RParen,\n  LBracket,\n  RBracket,\n  LBrace,\n  // Template tokens must come before RBrace so that TemplateTail/TemplateMiddle can match }\n  TemplateHead,\n  TemplateMiddle,\n  TemplateTail,\n  TemplateNoSub,\n  RBrace,\n  Comma,\n  QuestionQuestion,\n  Question,\n  Colon,\n  Hash,\n  Dollar,\n  NumberLiteral,\n  StringLiteral,\n  Identifier,\n];\n\n// === PARSER (precedence via rule layering) ===\n// Precedence (lowest to highest):\n// 1. Ternary: ? :\n// 2. Null coalescing: ??\n// 3. Logical OR: or\n// 4. Logical AND: and\n// 5. Comparison: ==, !=, <, >, <=, >=, in, not in\n// 6. Additive: +, -\n// 7. Multiplicative: *, /, %\n// 8. Power: ^ (RIGHT-ASSOCIATIVE)\n// 9. Unary: not, -\n// 10. Postfix: .property, [index], (call)\n// 11. Primary: literals, identifiers, parentheses\n\nclass ZenExpressionParser extends CstParser {\n  constructor() {\n    super(allTokens);\n    this.performSelfAnalysis();\n  }\n\n  // Entry - ternary (lowest precedence)\n  expression = this.RULE('expression', () => {\n    this.SUBRULE(this.nullCoalescingExpression, { LABEL: 'condition' });\n    this.OPTION(() => {\n      this.CONSUME(Question);\n      this.SUBRULE2(this.expression, { LABEL: 'consequent' });\n      this.CONSUME(Colon);\n      this.SUBRULE3(this.expression, { LABEL: 'alternate' });\n    });\n  });\n\n  nullCoalescingExpression = this.RULE('nullCoalescingExpression', () => {\n    this.SUBRULE(this.orExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.CONSUME(QuestionQuestion);\n      this.SUBRULE2(this.orExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  orExpression = this.RULE('orExpression', () => {\n    this.SUBRULE(this.andExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.OR([{ ALT: () => this.CONSUME(Or) }, { ALT: () => this.CONSUME(OrOr) }]);\n      this.SUBRULE2(this.andExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  andExpression = this.RULE('andExpression', () => {\n    this.SUBRULE(this.comparisonExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.OR([{ ALT: () => this.CONSUME(And) }, { ALT: () => this.CONSUME(AndAnd) }]);\n      this.SUBRULE2(this.comparisonExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  comparisonExpression = this.RULE('comparisonExpression', () => {\n    this.SUBRULE(this.additiveExpression, { LABEL: 'lhs' });\n    this.OPTION(() => {\n      this.OR([\n        { ALT: () => this.CONSUME(Eq) },\n        { ALT: () => this.CONSUME(NotEq) },\n        { ALT: () => this.CONSUME(Lt) },\n        { ALT: () => this.CONSUME(Gt) },\n        { ALT: () => this.CONSUME(LtEq) },\n        { ALT: () => this.CONSUME(GtEq) },\n        { ALT: () => this.CONSUME(In) },\n        {\n          ALT: () => {\n            this.CONSUME(Not);\n            this.CONSUME2(In);\n          },\n        }, // not in\n      ]);\n      this.SUBRULE2(this.additiveExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  additiveExpression = this.RULE('additiveExpression', () => {\n    this.SUBRULE(this.multiplicativeExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.OR([{ ALT: () => this.CONSUME(Plus) }, { ALT: () => this.CONSUME(Minus) }]);\n      this.SUBRULE2(this.multiplicativeExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  multiplicativeExpression = this.RULE('multiplicativeExpression', () => {\n    this.SUBRULE(this.powerExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.OR([\n        { ALT: () => this.CONSUME(Mult) },\n        { ALT: () => this.CONSUME(Div) },\n        { ALT: () => this.CONSUME(Mod) },\n      ]);\n      this.SUBRULE2(this.powerExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  // Power is RIGHT-ASSOCIATIVE to match mathematical convention:\n  //  e.g. 2^3^4 = 2^(3^4) = 2^81, not (2^3)^4 = 8^4 = 4096.\n  // Use self-recursion instead of MANY for right-associativity\n  powerExpression = this.RULE('powerExpression', () => {\n    this.SUBRULE(this.unaryExpression, { LABEL: 'base' });\n    this.OPTION(() => {\n      this.CONSUME(Power);\n      this.SUBRULE(this.powerExpression, { LABEL: 'exponent' }); // Self-recursion!\n    });\n  });\n\n  unaryExpression = this.RULE('unaryExpression', () => {\n    this.OR([\n      {\n        ALT: () => {\n          this.CONSUME(Not);\n          this.SUBRULE(this.unaryExpression, { LABEL: 'operand' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(NotNot);\n          this.SUBRULE2(this.unaryExpression, { LABEL: 'operand' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(Minus);\n          this.SUBRULE3(this.unaryExpression, { LABEL: 'operand' });\n        },\n      },\n      { ALT: () => this.SUBRULE(this.postfixExpression) },\n    ]);\n  });\n\n  // Postfix: .property, [index], (args)\n  postfixExpression = this.RULE('postfixExpression', () => {\n    this.SUBRULE(this.primaryExpression);\n    this.MANY(() => {\n      this.OR([\n        {\n          ALT: () => {\n            this.CONSUME(Dot);\n            this.CONSUME(Identifier, { LABEL: 'property' });\n          },\n        },\n        {\n          ALT: () => {\n            this.CONSUME(LBracket);\n            this.SUBRULE(this.expression, { LABEL: 'index' });\n            this.CONSUME(RBracket);\n          },\n        },\n        {\n          ALT: () => {\n            this.CONSUME(LParen);\n            this.OPTION(() => this.SUBRULE(this.argumentList));\n            this.CONSUME(RParen);\n          },\n        },\n      ]);\n    });\n  });\n\n  primaryExpression = this.RULE('primaryExpression', () => {\n    this.OR([\n      { ALT: () => this.CONSUME(NumberLiteral) },\n      { ALT: () => this.CONSUME(StringLiteral) },\n      { ALT: () => this.SUBRULE(this.templateLiteral) },\n      { ALT: () => this.CONSUME(True) },\n      { ALT: () => this.CONSUME(False) },\n      { ALT: () => this.CONSUME(Null) },\n      { ALT: () => this.CONSUME(Hash) }, // # for current element in higher-order functions\n      { ALT: () => this.CONSUME(Dollar) }, // $ for explicit reference in unary mode\n      { ALT: () => this.CONSUME(Identifier) },\n      // Array literal: [1, 2, 3]\n      {\n        GATE: () => this.isArrayLiteralStart(),\n        ALT: () => this.SUBRULE(this.arrayLiteralExpression),\n      },\n      // Object literal: {key: value, ...}\n      {\n        GATE: () => this.isObjectLiteralStart(),\n        ALT: () => this.SUBRULE(this.objectLiteralExpression),\n      },\n      {\n        ALT: () => {\n          this.CONSUME(LParen);\n          this.SUBRULE(this.expression);\n          this.CONSUME(RParen);\n        },\n      },\n      // Interval: use GATE to check for DotDot lookahead\n      {\n        GATE: () => this.isIntervalStart(),\n        ALT: () => this.SUBRULE(this.intervalExpression),\n      },\n    ]);\n  });\n\n  // Template string: `Hello ${name}, you have ${count} items`\n  templateLiteral = this.RULE('templateLiteral', () => {\n    this.OR([\n      // Simple template with no interpolation\n      { ALT: () => this.CONSUME(TemplateNoSub) },\n      // Template with interpolation\n      {\n        ALT: () => {\n          this.CONSUME(TemplateHead);\n          this.SUBRULE(this.expression, { LABEL: 'expr' });\n          this.MANY(() => {\n            this.CONSUME(TemplateMiddle);\n            this.SUBRULE2(this.expression, { LABEL: 'expr' });\n          });\n          this.CONSUME(TemplateTail);\n        },\n      },\n    ]);\n  });\n\n  // Interval: [a..b] or (a..b) with open/closed variations\n  intervalExpression = this.RULE('intervalExpression', () => {\n    this.OR([\n      { ALT: () => this.CONSUME(LBracket, { LABEL: 'startBracket' }) },\n      { ALT: () => this.CONSUME(LParen, { LABEL: 'startBracket' }) },\n    ]);\n\n    this.SUBRULE(this.expression, { LABEL: 'start' });\n    this.CONSUME(DotDot);\n    this.SUBRULE2(this.expression, { LABEL: 'end' });\n\n    this.OR2([\n      { ALT: () => this.CONSUME(RBracket, { LABEL: 'endBracket' }) },\n      { ALT: () => this.CONSUME(RParen, { LABEL: 'endBracket' }) },\n    ]);\n  });\n\n  // Array literal: [1, 2, 3] or []\n  arrayLiteralExpression = this.RULE('arrayLiteralExpression', () => {\n    this.CONSUME(LBracket);\n    this.OPTION(() => this.SUBRULE(this.argumentList));\n    this.CONSUME(RBracket);\n  });\n\n  // Object literal: {key: value, ...} or {}\n  objectLiteralExpression = this.RULE('objectLiteralExpression', () => {\n    this.CONSUME(LBrace);\n    this.OPTION(() => this.SUBRULE(this.objectPropertyList));\n    this.CONSUME(RBrace);\n  });\n\n  // Object property list for object literals\n  objectPropertyList = this.RULE('objectPropertyList', () => {\n    this.SUBRULE(this.objectProperty, { LABEL: 'prop' });\n    this.MANY(() => {\n      this.CONSUME(Comma);\n      this.SUBRULE2(this.objectProperty, { LABEL: 'prop' });\n    });\n  });\n\n  // Single object property: key: value\n  objectProperty = this.RULE('objectProperty', () => {\n    this.OR([\n      { ALT: () => this.CONSUME(StringLiteral, { LABEL: 'key' }) },\n      { ALT: () => this.CONSUME(Identifier, { LABEL: 'key' }) },\n    ]);\n    this.CONSUME(Colon);\n    this.SUBRULE(this.expression, { LABEL: 'value' });\n  });\n\n  argumentList = this.RULE('argumentList', () => {\n    this.SUBRULE(this.expression, { LABEL: 'arg' });\n    this.MANY(() => {\n      this.CONSUME(Comma);\n      this.SUBRULE2(this.expression, { LABEL: 'arg' });\n    });\n  });\n\n  // Helper: Check if current position starts an array literal\n  // An array literal is [ followed by expressions and commas, then ]\n  // We must distinguish [1,2] from [a..b]. An interval ALWAYS contains .. before closing\n  private isArrayLiteralStart(): boolean {\n    const lookahead = this.LA(1);\n    if (!lookahead || lookahead.tokenType !== LBracket) {\n      return false;\n    }\n\n    // Check if we have .. before a closing bracket (interval)\n    // If yes, this is not an array literal\n    return !this.isIntervalStart();\n  }\n\n  // Helper: Check if current position starts an object literal\n  // An object literal is { followed by key:value pairs and commas, then }\n  private isObjectLiteralStart(): boolean {\n    const lookahead = this.LA(1);\n    if (!lookahead || lookahead.tokenType !== LBrace) {\n      return false;\n    }\n    return true;\n  }\n\n  // Helper: Check if current position starts an interval (lookahead for ..)\n  // An interval is [expr..expr] or (expr..expr)\n  //\n  // We verify that after the start bracket, we'll eventually see .. before a closing bracket\n  // O(n) lookahead required because interval syntax '[1..10]' is ambiguous with array literals\n  // '[1,2,3]' - we must scan ahead to find '..' token to disambiguate, potentially examining\n  // entire token stream for malformed input.\n  private isIntervalStart(): boolean {\n    const lookahead = this.LA(1);\n    if (!lookahead) {\n      return false;\n    }\n    const tokenType = lookahead.tokenType;\n\n    // Only intervals start with [ or ( and must contain .. before closing\n    if (tokenType !== LBracket && tokenType !== LParen) {\n      return false;\n    }\n\n    // Look ahead through tokens to see if we find DotDot before a closing bracket\n    // Note: Chevrotain's LA() returns EOF token (not null) when past end of input\n    let depth = 0;\n    let i = 0;\n    while (true) {\n      const token = this.LA(++i);\n      // Check for end of input - LA() returns EOF token, not null\n      if (!token || token.tokenType.name === 'EOF') {\n        break;\n      }\n\n      const tt = token.tokenType;\n      if (tt === LBracket || tt === LParen || tt === LBrace) {\n        depth++;\n      } else if (tt === RBracket || tt === RParen || tt === RBrace) {\n        if (depth === 0) {\n          // Found end before DotDot - not an interval\n          return false;\n        }\n        depth--;\n      } else if (tt === DotDot) {\n        // Found DotDot before closing - this is an interval!\n        return true;\n      }\n    }\n\n    return false;\n  }\n}\n\nexport const parser = new ZenExpressionParser();\nexport const lexer = new Lexer(allTokens);\n\n/**\n * Parse an expression string and return the CST.\n *\n * @param input - The expression string to parse\n * @param location - Optional source location for error reporting\n * @returns The Concrete Syntax Tree (CST)\n * @throws Error if the parse fails\n */\nexport function parseExpression(input: string, location?: SourceLocation): any {\n  const lexResult = lexer.tokenize(input);\n\n  if (lexResult.errors.length > 0) {\n    throw new CompilationError(\n      `Lexer error: ${lexResult.errors.map((e) => e.message).join(', ')}`,\n      ErrorCode.PARSE_ERROR,\n      location,\n      { expression: input },\n    );\n  }\n\n  parser.input = lexResult.tokens;\n  const cst = parser.expression();\n\n  if (parser.errors.length > 0) {\n    throw new CompilationError(\n      `Parse error: ${parser.errors.map((e) => e.message).join(', ')}`,\n      ErrorCode.PARSE_ERROR,\n      location,\n      { expression: input },\n    );\n  }\n\n  return cst;\n}\n\nexport type { IToken };\n","import { parser } from './expression-parser';\nimport {\n  type ExpressionAST,\n  type StringLiteral,\n  type Interval,\n  type TemplateLiteral,\n  type ArrayLiteral,\n  type ObjectLiteral,\n  type BinaryOperator,\n} from './ast-types';\nimport type { CstNode } from 'chevrotain';\n\nconst BaseCstVisitor = parser.getBaseCstVisitorConstructor();\n\n/**\n * Converts Chevrotain CST to our AST format.\n */\nclass ExpressionAstBuilder extends BaseCstVisitor {\n  constructor() {\n    super();\n    this.validateVisitor();\n  }\n\n  expression(ctx: any): ExpressionAST {\n    const condition = this.visit(ctx.condition);\n\n    if (ctx.Question) {\n      return {\n        type: 'TernaryOp',\n        condition,\n        consequent: this.visit(ctx.consequent),\n        alternate: this.visit(ctx.alternate),\n      };\n    }\n\n    return condition;\n  }\n\n  nullCoalescingExpression(ctx: any): ExpressionAST {\n    let result = this.visit(ctx.lhs);\n\n    if (ctx.rhs) {\n      for (const rhsNode of ctx.rhs) {\n        result = {\n          type: 'BinaryOp',\n          op: '??',\n          left: result,\n          right: this.visit(rhsNode),\n        };\n      }\n    }\n\n    return result;\n  }\n\n  orExpression(ctx: any): ExpressionAST {\n    let result = this.visit(ctx.lhs);\n\n    if (ctx.rhs) {\n      for (const rhsNode of ctx.rhs) {\n        result = {\n          type: 'BinaryOp',\n          op: 'or',\n          left: result,\n          right: this.visit(rhsNode),\n        };\n      }\n    }\n\n    return result;\n  }\n\n  andExpression(ctx: any): ExpressionAST {\n    let result = this.visit(ctx.lhs);\n\n    if (ctx.rhs) {\n      for (const rhsNode of ctx.rhs) {\n        result = {\n          type: 'BinaryOp',\n          op: 'and',\n          left: result,\n          right: this.visit(rhsNode),\n        };\n      }\n    }\n\n    return result;\n  }\n\n  comparisonExpression(ctx: any): ExpressionAST {\n    const lhs = this.visit(ctx.lhs);\n\n    if (!ctx.rhs) {\n      return lhs;\n    }\n\n    // Determine operator\n    let op: BinaryOperator;\n    if (ctx.Eq) {\n      op = '==';\n    } else if (ctx.NotEq) {\n      op = '!=';\n    } else if (ctx.Lt) {\n      op = '<';\n    } else if (ctx.Gt) {\n      op = '>';\n    } else if (ctx.LtEq) {\n      op = '<=';\n    } else if (ctx.GtEq) {\n      op = '>=';\n    } else if (ctx.In) {\n      op = ctx.Not ? 'not in' : 'in';\n    } else {\n      throw new Error('Unknown comparison operator');\n    }\n\n    return {\n      type: 'BinaryOp',\n      op,\n      left: lhs,\n      right: this.visit(ctx.rhs),\n    };\n  }\n\n  additiveExpression(ctx: any): ExpressionAST {\n    return this.buildLeftAssociativeBinaryOp(ctx, ['Plus', 'Minus'], ['+', '-']);\n  }\n\n  multiplicativeExpression(ctx: any): ExpressionAST {\n    return this.buildLeftAssociativeBinaryOp(ctx, ['Mult', 'Div', 'Mod'], ['*', '/', '%']);\n  }\n\n  // Power is right-associative, handled differently via recursion in grammar\n  powerExpression(ctx: any): ExpressionAST {\n    const base = this.visit(ctx.base);\n\n    if (ctx.exponent) {\n      return {\n        type: 'BinaryOp',\n        op: '^',\n        left: base,\n        right: this.visit(ctx.exponent),\n      };\n    }\n\n    return base;\n  }\n\n  unaryExpression(ctx: any): ExpressionAST {\n    if (ctx.Not || ctx.NotNot) {\n      return { type: 'UnaryOp', op: 'not', operand: this.visit(ctx.operand) };\n    }\n    if (ctx.Minus) {\n      return { type: 'UnaryOp', op: '-', operand: this.visit(ctx.operand) };\n    }\n    return this.visit(ctx.postfixExpression);\n  }\n\n  postfixExpression(ctx: any): ExpressionAST {\n    let result = this.visit(ctx.primaryExpression);\n\n    // Collect all postfix operations with their source positions\n    type PostfixOp =\n      | { type: 'member'; offset: number; idx: number }\n      | { type: 'index'; offset: number; idx: number }\n      | { type: 'call'; offset: number; idx: number };\n\n    const ops: PostfixOp[] = [];\n\n    if (ctx.Dot) {\n      for (let i = 0; i < ctx.Dot.length; i++) {\n        ops.push({ type: 'member', offset: ctx.Dot[i].startOffset, idx: i });\n      }\n    }\n\n    if (ctx.LBracket) {\n      for (let i = 0; i < ctx.LBracket.length; i++) {\n        ops.push({ type: 'index', offset: ctx.LBracket[i].startOffset, idx: i });\n      }\n    }\n\n    if (ctx.LParen) {\n      for (let i = 0; i < ctx.LParen.length; i++) {\n        ops.push({ type: 'call', offset: ctx.LParen[i].startOffset, idx: i });\n      }\n    }\n\n    // Sort by source position to apply in correct order: Chevrotain collects each operator\n    // type separately, but the actual evaluation order depends on source position when multiple\n    // operator types can appear.\n    //\n    // We must sort by position to reconstruct left-to-right evaluation order\n    ops.sort((a, b) => a.offset - b.offset);\n\n    // Apply each operation in order\n    for (const op of ops) {\n      if (op.type === 'member') {\n        const prop = ctx.property[op.idx].image;\n        result = { type: 'MemberAccess', object: result, property: prop };\n      } else if (op.type === 'index') {\n        const indexExpr = ctx.index[op.idx];\n        result = { type: 'IndexAccess', object: result, index: this.visit(indexExpr) };\n      } else if (op.type === 'call') {\n        // Check if there's an argumentList for this call\n        const args =\n          ctx.argumentList && ctx.argumentList[op.idx] ? this.visit(ctx.argumentList[op.idx]) : [];\n        result = { type: 'FunctionCall', callee: result, args };\n      }\n    }\n\n    return result;\n  }\n\n  primaryExpression(ctx: any): ExpressionAST {\n    if (ctx.NumberLiteral) {\n      const raw = ctx.NumberLiteral[0].image.replace(/_/g, '');\n      return { type: 'NumberLiteral', value: parseFloat(raw) };\n    }\n    if (ctx.StringLiteral) {\n      const raw = ctx.StringLiteral[0].image;\n      const value = this.unescapeString(raw.slice(1, -1));\n      return { type: 'StringLiteral', value };\n    }\n    if (ctx.True) {\n      return { type: 'BooleanLiteral', value: true };\n    }\n    if (ctx.False) {\n      return { type: 'BooleanLiteral', value: false };\n    }\n    if (ctx.Null) {\n      return { type: 'NullLiteral' };\n    }\n    if (ctx.Hash) {\n      return { type: 'HashRef' };\n    }\n    if (ctx.Dollar) {\n      return { type: 'DollarRef' };\n    }\n    if (ctx.Identifier) {\n      return { type: 'Identifier', name: ctx.Identifier[0].image };\n    }\n    if (ctx.arrayLiteralExpression) {\n      return this.visit(ctx.arrayLiteralExpression);\n    }\n    if (ctx.objectLiteralExpression) {\n      return this.visit(ctx.objectLiteralExpression);\n    }\n    if (ctx.expression) {\n      return this.visit(ctx.expression);\n    }\n    if (ctx.intervalExpression) {\n      return this.visit(ctx.intervalExpression);\n    }\n    if (ctx.templateLiteral) {\n      return this.visit(ctx.templateLiteral);\n    }\n\n    throw new Error('Unknown primary expression');\n  }\n\n  intervalExpression(ctx: any): Interval {\n    const startBracket = ctx.startBracket[0];\n    const endBracket = ctx.endBracket[0];\n\n    return {\n      type: 'Interval',\n      start: this.visit(ctx.start) as ExpressionAST,\n      end: this.visit(ctx.end) as ExpressionAST,\n      startInclusive: startBracket.tokenType.name === 'LBracket',\n      endInclusive: endBracket.tokenType.name === 'RBracket',\n    };\n  }\n\n  arrayLiteralExpression(ctx: any): ArrayLiteral {\n    if (!ctx.argumentList) {\n      return { type: 'ArrayLiteral', elements: [] };\n    }\n    const args = this.visit(ctx.argumentList);\n    return { type: 'ArrayLiteral', elements: args as ExpressionAST[] };\n  }\n\n  objectLiteralExpression(ctx: any): ObjectLiteral {\n    if (!ctx.objectPropertyList) {\n      return { type: 'ObjectLiteral', properties: [] };\n    }\n    const props = this.visit(ctx.objectPropertyList);\n    return {\n      type: 'ObjectLiteral',\n      properties: props as Array<{ key: string; value: ExpressionAST }>,\n    };\n  }\n\n  objectPropertyList(ctx: any): Array<{ key: string; value: ExpressionAST }> {\n    return ctx.prop.map(\n      (propNode: CstNode) => this.visit(propNode) as { key: string; value: ExpressionAST },\n    );\n  }\n\n  objectProperty(ctx: any): { key: string; value: ExpressionAST } {\n    const keyToken = ctx.key[0];\n    const key =\n      keyToken.tokenType.name === 'StringLiteral'\n        ? this.unescapeString(keyToken.image.slice(1, -1))\n        : keyToken.image;\n    const value = this.visit(ctx.value) as ExpressionAST;\n    return { key, value };\n  }\n\n  templateLiteral(ctx: any): TemplateLiteral | StringLiteral {\n    // Handle simple template with no substitution\n    if (ctx.TemplateNoSub) {\n      const raw = ctx.TemplateNoSub[0].image;\n      return { type: 'StringLiteral', value: this.unescapeString(raw.slice(1, -1)) };\n    }\n\n    // Handle template with interpolation\n    const parts: Array<{ text: string } | { expr: ExpressionAST }> = [];\n\n    // Extract text from TemplateHead (remove ` and ${)\n    const headRaw = ctx.TemplateHead[0].image;\n    const headText = this.unescapeString(headRaw.slice(1, -2));\n    if (headText) {\n      parts.push({ text: headText });\n    }\n\n    // Add expressions and middle parts\n    for (let i = 0; i < ctx.expr.length; i++) {\n      parts.push({ expr: this.visit(ctx.expr[i]) as ExpressionAST });\n\n      if (ctx.TemplateMiddle && ctx.TemplateMiddle[i]) {\n        const midRaw = ctx.TemplateMiddle[i].image;\n        const midText = this.unescapeString(midRaw.slice(1, -2));\n        if (midText) {\n          parts.push({ text: midText });\n        }\n      }\n    }\n\n    // Extract text from TemplateTail (remove } and `)\n    const tailRaw = ctx.TemplateTail[0].image;\n    const tailText = this.unescapeString(tailRaw.slice(1, -1));\n    if (tailText) {\n      parts.push({ text: tailText });\n    }\n\n    // Template literals with no interpolation (just text) can be converted to simple string\n    // literals, avoiding runtime template processing overhead.\n    if (parts.every((p) => 'text' in p)) {\n      const combined = parts.map((p) => (p as { text: string }).text).join('');\n      return { type: 'StringLiteral', value: combined };\n    }\n\n    return { type: 'TemplateLiteral', parts };\n  }\n\n  argumentList(ctx: any): ExpressionAST[] {\n    return ctx.arg.map((argNode: CstNode) => this.visit(argNode) as ExpressionAST);\n  }\n\n  /**\n   * Helper to unescape string literals.\n   * Handles basic escape sequences like \\n, \\t, \\\", \\', \\\\, etc.\n   */\n  private unescapeString(s: string): string {\n    return s\n      .replace(/\\\\n/g, '\\n')\n      .replace(/\\\\t/g, '\\t')\n      .replace(/\\\\r/g, '\\r')\n      .replace(/\\\\'/g, \"'\")\n      .replace(/\"/g, '\"')\n      .replace(/\\\\\\\\/g, '\\\\');\n  }\n\n  /**\n   * Helper for left-associative binary operators.\n   * Collects all operator tokens, sorts them by position, and pairs them with RHS operands.\n   */\n  private buildLeftAssociativeBinaryOp(\n    ctx: any,\n    tokenNames: string[],\n    ops: BinaryOperator[],\n  ): ExpressionAST {\n    let result = this.visit(ctx.lhs) as ExpressionAST;\n\n    if (!ctx.rhs) {\n      // No right-hand side: return just the left expression\n      return result;\n    }\n\n    // Collect all operator tokens with their corresponding operator symbol\n    const operatorTokens: Array<{ op: BinaryOperator; offset: number }> = [];\n    for (let j = 0; j < tokenNames.length; j++) {\n      const tokens = ctx[tokenNames[j]];\n      if (tokens) {\n        for (const token of tokens) {\n          operatorTokens.push({ op: ops[j], offset: token.startOffset });\n        }\n      }\n    }\n\n    // Sort operators by their position in the source\n    operatorTokens.sort((a, b) => a.offset - b.offset);\n\n    // Build the expression tree left-to-right\n    for (let i = 0; i < ctx.rhs.length; i++) {\n      const op = operatorTokens[i]?.op;\n      if (!op) {\n        throw new Error(`Operator not found for ${tokenNames.join(', ')}`);\n      }\n\n      result = {\n        type: 'BinaryOp',\n        op,\n        left: result,\n        right: this.visit(ctx.rhs[i]) as ExpressionAST,\n      };\n    }\n\n    return result;\n  }\n}\n\nexport const astBuilder = new ExpressionAstBuilder();\n\n/**\n * Convert a CST (Concrete Syntax Tree) to an AST (Abstract Syntax Tree).\n * CST contains low-level parsing artifacts; AST simplifies structure for compilation\n *\n * @param cst - The CST from the Chevrotain parser\n * @returns The AST node\n */\nexport function cstToAst(cst: CstNode): ExpressionAST {\n  return astBuilder.visit(cst);\n}\n","/**\n * Unary AST transformation utilities.\n *\n * This module provides AST-level transformations specific to unary (decision table)\n * context. These transformations are applied AFTER parsing to convert a standard AST\n * into an AST that reflects the semantic meaning in unary context.\n *\n * Key transformations:\n * - Bare identifiers → string literals (for implicit string matching)\n * - Comparison without LHS → $ comparison (e.g., \"> 100\" → \"$ > 100\")\n * - Multiple comma-separated values → OR chain\n *\n * This separates SEMANTIC transformations from SYNTACTIC parsing, keeping\n * the parser focused solely on syntax-to-AST conversion.\n */\n\nimport type { ExpressionAST, BinaryOperator, BinaryOp } from './ast-types';\n\n/**\n * Convert a bare Identifier node to a StringLiteral node.\n *\n * In decision table cells, unquoted words like \"premium\" are semantic values to match against,\n * not variable references. This prevents errors when authors write intuitive cell values without\n * quotes. This is a key DMN/JDM usability feature.\n *\n * This handles the common JDM/DMN convention where cell values like:\n *   - premium      means match the string \"premium\" (identifier → string)\n *   - \"premium\"    means match the string \"premium\" (already a string)\n *\n * We only convert top-level Identifiers. More complex expressions (member access,\n * function calls, etc.) are left as-is since they likely involve actual variables.\n *\n * @param ast - The AST node that may be an Identifier\n * @returns The AST node, with Identifier converted to StringLiteral if applicable\n */\nexport function convertIdentifierToStringLiteral(ast: ExpressionAST): ExpressionAST {\n  if (ast.type === 'Identifier') {\n    return { type: 'StringLiteral', value: (ast as { type: 'Identifier'; name: string }).name };\n  }\n  return ast;\n}\n\n/**\n * Wrap an AST value in a comparison with DollarRef (the implicit cell input).\n *\n * In unary context, expressions like \"> 100\" implicitly compare against the input value.\n * This function creates the full comparison AST: \"$ <op> <value>\".\n *\n * @param ast - The right-hand side value AST\n * @param op - The comparison operator\n * @returns A BinaryOp AST with DollarRef on the left\n */\nexport function wrapWithDollarComparison(ast: ExpressionAST, op: BinaryOperator): BinaryOp {\n  return {\n    type: 'BinaryOp',\n    op,\n    left: { type: 'DollarRef' },\n    right: ast,\n  };\n}\n\n/**\n * Create an equality comparison with implicit identifier-to-string conversion.\n *\n * This is the default transformation for unary values - they become equality\n * comparisons against the input value ($). For equality/inequality comparisons,\n * bare identifiers are converted to string literals.\n *\n * @param ast - The value to compare against\n * @param op - The equality operator (== or !=)\n * @returns A BinaryOp AST representing the equality comparison\n */\nexport function createEqualityComparison(ast: ExpressionAST, op: '==' | '!='): BinaryOp {\n  const value = convertIdentifierToStringLiteral(ast);\n  return wrapWithDollarComparison(value, op);\n}\n\n/**\n * Create an interval membership check.\n *\n * In unary context, interval notation like \"[1..10]\" becomes \"$ in [1..10]\".\n *\n * @param intervalAst - The interval AST node\n * @returns A BinaryOp AST representing the membership check\n */\nexport function createIntervalCheck(intervalAst: ExpressionAST): BinaryOp {\n  return wrapWithDollarComparison(intervalAst, 'in');\n}\n\n/**\n * Create an array membership check.\n *\n * In unary context, array literals like \"['gold', 'platinum']\" become\n * \"$ in ['gold', 'platinum']\".\n *\n * @param arrayAst - The array literal AST node\n * @returns A BinaryOp AST representing the membership check\n */\nexport function createArrayMembershipCheck(arrayAst: ExpressionAST): BinaryOp {\n  return wrapWithDollarComparison(arrayAst, 'in');\n}\n\n/**\n * Combine multiple expression ASTs into an OR chain.\n *\n * In unary context, comma-separated values represent OR semantics.\n * For example, \"a, b, c\" becomes \"$ == 'a' or $ == 'b' or $ == 'c'\".\n *\n * @param exprs - Array of expression ASTs to combine\n * @returns A single AST representing the OR of all expressions\n */\nexport function combineWithOr(exprs: ExpressionAST[]): ExpressionAST {\n  if (exprs.length === 0) {\n    return { type: 'BooleanLiteral', value: true };\n  }\n  if (exprs.length === 1) {\n    return exprs[0];\n  }\n  return exprs.reduce((acc, expr) => ({\n    type: 'BinaryOp',\n    op: 'or',\n    left: acc,\n    right: expr,\n  }));\n}\n\n/**\n * Combine multiple expression ASTs into an AND chain.\n *\n * Used for compound unary expressions like \">= 13 and < 15\".\n *\n * @param exprs - Array of expression ASTs to combine\n * @returns A single AST representing the AND of all expressions\n */\nexport function combineWithAnd(exprs: ExpressionAST[]): ExpressionAST {\n  if (exprs.length === 0) {\n    return { type: 'BooleanLiteral', value: true };\n  }\n  if (exprs.length === 1) {\n    return exprs[0];\n  }\n  return exprs.reduce((acc, expr) => ({\n    type: 'BinaryOp',\n    op: 'and',\n    left: acc,\n    right: expr,\n  }));\n}\n","/**\n * Unary expression parser for decision table cells.\n *\n * This module provides parsing for unary mode expressions, which are used in\n * decision table cells. The parser is responsible for SYNTACTIC analysis only -\n * converting text to AST nodes. Semantic transformations (like converting\n * identifiers to string literals) are handled by the unary-ast-transforms module.\n *\n * Separation of Concerns:\n * - This module: Tokenization, lexing, parsing (text → AST)\n * - unary-ast-transforms: Semantic transformations (AST → transformed AST)\n * - unary-transform: Dollar reference substitution for compilation (AST → compiled AST)\n */\n\nimport { parser, lexer } from './expression-parser';\nimport { type ExpressionAST, type BinaryOperator } from './ast-types';\nimport { cstToAst } from './cst-visitor';\nimport { CompilationError, ErrorCode, type SourceLocation } from './errors';\nimport {\n  wrapWithDollarComparison,\n  createEqualityComparison,\n  createIntervalCheck,\n  createArrayMembershipCheck,\n  combineWithOr,\n  combineWithAnd,\n} from './unary-ast-transforms';\n\n/**\n * Parse an expression in unary mode (for decision table cells).\n *\n * In DMN/JDM convention, decision table cells contain concise expressions that implicitly\n * compare against the input column value ($). This allows table authors to write \"premium\"\n * instead of \"$ == 'premium'\" or \"> 100\" instead of \"$ > 100\", making tables more readable.\n *\n * Unary mode transformations:\n * - \"admin\"         -> $ == \"admin\"\n * - > 100           -> $ > 100\n * - [1..10]         -> $ in [1..10]\n * - \"a\", \"b\", \"c\"   -> $ == \"a\" or $ == \"b\" or $ == \"c\"\n * - $ > 100         -> $ > 100 (explicit $ disables transformations)\n *\n * @param input - The unary expression to parse\n * @returns The AST node\n */\nexport function parseUnaryExpression(input: string): ExpressionAST {\n  const trimmed = input.trim();\n\n  // Empty cell = always matches\n  if (trimmed === '' || trimmed === '-') {\n    return { type: 'BooleanLiteral', value: true };\n  }\n\n  // Check if expression uses explicit $ - if so, parse as standard expression\n  if (trimmed.includes('$')) {\n    return parseStandardExpression(trimmed);\n  }\n\n  // Check for comma-separated values (OR semantics)\n  // But only if it's not an array literal\n  if (trimmed.includes(',') && !isArrayLiteral(trimmed)) {\n    const parts = splitByComma(trimmed);\n    const comparisons = parts.map((part) => transformUnaryPart(part.trim()));\n    return combineWithOr(comparisons);\n  }\n\n  // Check for compound expressions with 'and' or 'or' that need implicit $ expansion\n  // e.g., \">= 13 and < 15\" should become \"$ >= 13 and $ < 15\"\n  const compoundResult = parseCompoundUnary(trimmed);\n  if (compoundResult) {\n    return compoundResult;\n  }\n\n  return transformUnaryPart(trimmed);\n}\n\n/**\n * Parse a single unary part and apply semantic transformations.\n *\n * This function performs both parsing and transformation in a single step:\n * 1. Parse the input using the standard expression parser\n * 2. Apply unary-context semantic transformations (AST operations)\n *\n * @param input - The unary part to parse\n * @returns The transformed AST node\n */\nfunction transformUnaryPart(input: string): ExpressionAST {\n  // Check for comparison operator at start\n  const comparisonMatch = input.match(/^(==|!=|<=|>=|<|>)\\s*(.+)$/);\n  if (comparisonMatch) {\n    const [, op, valueExpr] = comparisonMatch;\n    const value = parseStandardExpression(valueExpr);\n    // For equality/inequality comparisons, convert bare identifiers to strings\n    if (op === '==' || op === '!=') {\n      return createEqualityComparison(value, op as '==' | '!=');\n    }\n    return wrapWithDollarComparison(value, op as BinaryOperator);\n  }\n\n  // Check for interval notation\n  if (input.match(/^[[].+\\.\\..*[\\])]$/)) {\n    const intervalAst = parseStandardExpression(input);\n    return createIntervalCheck(intervalAst);\n  }\n\n  // Check for array literal - use 'in' for membership\n  // e.g., \"['gold', 'platinum']\" should become \"$ in ['gold', 'platinum']\"\n  if (isArrayLiteral(input)) {\n    const arrayAst = parseStandardExpression(input);\n    return createArrayMembershipCheck(arrayAst);\n  }\n\n  // Default: equality comparison\n  // Convert bare identifiers to string literals for implicit equality\n  const value = parseStandardExpression(input);\n  return createEqualityComparison(value, '==');\n}\n\n/**\n * Parse compound unary expressions that use 'and' or 'or' with implicit $\n * Examples:\n * - \">= 13 and < 15\" -> \"$ >= 13 and $ < 15\"\n * - \"> 0 or == null\" -> \"$ > 0 or $ == null\"\n *\n * @param input - The expression to parse\n * @returns The AST if compound, null otherwise\n */\nfunction parseCompoundUnary(input: string): ExpressionAST | null {\n  // Match patterns like: <op1> <val1> and/or <op2> <val2>\n  // We need to split by ' and ' or ' or ' while preserving quotes and brackets\n  const andParts = splitByLogicalOp(input, 'and');\n  if (andParts.length > 1) {\n    const comparisons = andParts.map((part) => transformUnaryPart(part.trim()));\n    return combineWithAnd(comparisons);\n  }\n\n  const orParts = splitByLogicalOp(input, 'or');\n  if (orParts.length > 1) {\n    const comparisons = orParts.map((part) => transformUnaryPart(part.trim()));\n    return combineWithOr(comparisons);\n  }\n\n  return null;\n}\n\n/**\n * Split input by a logical operator (' and ' or ' or '), respecting quotes and brackets.\n *\n * This is a parsing helper that performs tokenization while respecting nested structures.\n */\nfunction splitByLogicalOp(input: string, op: 'and' | 'or'): string[] {\n  const pattern = ` ${op} `;\n  const parts: string[] = [];\n  let current = '';\n  let depth = 0;\n  let inString = false;\n  let stringChar = '';\n  let i = 0;\n\n  while (i < input.length) {\n    const char = input[i];\n\n    if (inString) {\n      current += char;\n      if (char === stringChar && input[i - 1] !== '\\\\') {\n        inString = false;\n      }\n      i++;\n      continue;\n    }\n\n    if (char === '\"' || char === \"'\") {\n      inString = true;\n      stringChar = char;\n      current += char;\n      i++;\n    } else if (char === '[' || char === '(' || char === '{') {\n      depth++;\n      current += char;\n      i++;\n    } else if (char === ']' || char === ')' || char === '}') {\n      depth--;\n      current += char;\n      i++;\n    } else if (depth === 0 && input.substring(i, i + pattern.length).toLowerCase() === pattern) {\n      parts.push(current);\n      current = '';\n      i += pattern.length;\n    } else {\n      current += char;\n      i++;\n    }\n  }\n\n  if (current) {\n    parts.push(current);\n  }\n  return parts;\n}\n\n/**\n * Check if a string represents an array literal (not an interval).\n *\n * Arrays and intervals both use bracket syntax but have different semantics.\n * Arrays check membership ($ in [1,2,3]), intervals check ranges ($ in [1..10]).\n * Must detect .. to parse correctly.\n */\nfunction isArrayLiteral(input: string): boolean {\n  return input.startsWith('[') && input.endsWith(']') && !input.includes('..');\n}\n\n/**\n * Smart split by comma that respects brackets and strings.\n *\n * This is a parsing helper for tokenizing comma-separated unary values\n * while respecting nested structures.\n *\n * Examples:\n * - \"a, b, c\" -> [\"a\", \"b\", \"c\"]\n * - \"[1, 2], [3, 4]\" -> [\"[1, 2]\", \"[3, 4]\"]\n * - '\"a, b\", \"c, d\"' -> ['\"a, b\"', '\"c, d\"']\n */\nfunction splitByComma(input: string): string[] {\n  const parts: string[] = [];\n  let current = '';\n  let depth = 0;\n  let inString = false;\n  let stringChar = '';\n\n  for (let i = 0; i < input.length; i++) {\n    const char = input[i];\n\n    if (inString) {\n      current += char;\n      // Check if string ends (and handle escaped quotes)\n      if (char === stringChar && input[i - 1] !== '\\\\') {\n        inString = false;\n      }\n      continue;\n    }\n\n    if (char === '\"' || char === \"'\") {\n      inString = true;\n      stringChar = char;\n      current += char;\n    } else if (char === '[' || char === '(') {\n      depth++;\n      current += char;\n    } else if (char === ']' || char === ')') {\n      depth--;\n      current += char;\n    } else if (char === ',' && depth === 0) {\n      parts.push(current);\n      current = '';\n    } else {\n      current += char;\n    }\n  }\n\n  if (current) {\n    parts.push(current);\n  }\n  return parts;\n}\n\n/**\n * Parse a standard (non-unary) expression.\n *\n * This is the core parsing function that converts an expression string to an AST.\n * It uses the Chevrotain lexer and parser defined in expression-parser.ts,\n * then converts the CST to AST using cst-visitor.ts.\n *\n * @param input - The expression string to parse\n * @param location - Optional source location for error reporting\n * @returns The AST node\n */\nexport function parseStandardExpression(input: string, location?: SourceLocation): ExpressionAST {\n  const lexingResult = lexer.tokenize(input);\n\n  if (lexingResult.errors.length > 0) {\n    throw new CompilationError(\n      `Lexer error: ${lexingResult.errors.map((e: any) => e.message).join(', ')}`,\n      ErrorCode.PARSE_ERROR,\n      location,\n      { expression: input },\n    );\n  }\n\n  parser.input = lexingResult.tokens;\n  const cst = parser.expression();\n\n  if (parser.errors.length > 0) {\n    throw new CompilationError(\n      `Parse error: ${parser.errors.map((e: any) => e.message).join(', ')}`,\n      ErrorCode.PARSE_ERROR,\n      location,\n      { expression: input },\n    );\n  }\n\n  return cstToAst(cst);\n}\n","/**\n * Optimization Pipeline for JDM to WebAssembly Compilation\n *\n * This module defines the interface for optimization passes and the runner\n * that applies them sequentially to transform the compiled AST into an\n * optimized form before code generation.\n */\n\nimport { type JDMDecision, type JDMNode, NodeType } from './parser';\nimport {\n  type ExpressionAST,\n  type NumberLiteral,\n  type StringLiteral,\n  type BooleanLiteral,\n  isNumberLiteral,\n  isStringLiteral,\n  isBooleanLiteral,\n  isNullLiteral,\n  isBinaryOp,\n  isUnaryOp,\n  isTernaryOp,\n} from './ast-types';\nimport { parseStandardExpression, parseUnaryExpression } from './unary-parser';\n\n/**\n * Cache for parsed expression ASTs.\n * Maps expression strings to their parsed AST nodes to avoid redundant parsing.\n */\ntype ExpressionCache = Map<string, ExpressionAST>;\n\n/**\n * Compiled AST - the intermediate representation after parsing.\n *\n * JDMDecision structure is simple enough for in-place transformation, avoiding the\n * complexity and memory overhead of building a separate intermediate representation.\n */\nexport type CompiledAST = JDMDecision;\n\n/**\n * Interface for an optimization pass.\n *\n * Each optimization pass receives the compiled AST and returns a\n * potentially modified/optimized AST.\n */\nexport interface OptimizationPass {\n  /** Human-readable name of the optimization pass */\n  name: string;\n\n  /**\n   * Run the optimization pass on the given AST.\n   *\n   * @param ast - The compiled AST to optimize\n   * @returns The optimized AST\n   */\n  run(ast: CompiledAST): CompiledAST;\n}\n\n/**\n * Ordered list of optimization passes.\n *\n * Passes have dependencies - one pass may create opportunities for the next. For example,\n * constant folding might convert \"if (2 > 3)\" to \"if (false)\", then dead code elimination\n * removes the unreachable branch. Running DCE before folding would miss this optimization.\n */\nexport const optimizer: OptimizationPass[] = [\n  { name: 'Constant Folding', run: constantFolding },\n  { name: 'Dead Code Elimination', run: deadCodeElimination },\n  { name: 'Expression Inlining', run: expressionInlining },\n  { name: 'Table Indexing', run: tableIndexing },\n];\n\n/**\n * Run all optimization passes sequentially on the given AST.\n *\n * @param ast - The compiled AST to optimize\n * @returns The fully optimized AST\n */\nexport function runOptimizations(ast: CompiledAST): CompiledAST {\n  let optimized = ast;\n\n  for (const pass of optimizer) {\n    optimized = pass.run(optimized);\n  }\n\n  return optimized;\n}\n\n// ============================================================================\n// Expression Cache Utilities\n// ============================================================================\n\n/**\n * Get the expression cache for a node, creating it if it doesn't exist.\n */\nfunction getExpressionCache(node: JDMNode): ExpressionCache {\n  if (!node.parsedContent) {\n    node.parsedContent = {};\n  }\n  if (!node.parsedContent._cachedExprs) {\n    node.parsedContent._cachedExprs = new Map<string, ExpressionAST>();\n  }\n  return node.parsedContent._cachedExprs as ExpressionCache;\n}\n\n/**\n * Parse an expression with caching.\n * Checks the cache first, and only parses if not found.\n */\nfunction cachedParseUnary(node: JDMNode, expr: string): ExpressionAST {\n  const cache = getExpressionCache(node);\n  const cached = cache.get(expr);\n  if (cached) {\n    return cached;\n  }\n  const parsed = parseUnaryExpression(expr);\n  cache.set(expr, parsed);\n  return parsed;\n}\n\n/**\n * Parse a standard expression with caching.\n * Checks the cache first, and only parses if not found.\n */\nfunction cachedParseStandard(node: JDMNode, expr: string): ExpressionAST {\n  const cache = getExpressionCache(node);\n  const cached = cache.get(expr);\n  if (cached) {\n    return cached;\n  }\n  const parsed = parseStandardExpression(expr);\n  cache.set(expr, parsed);\n  return parsed;\n}\n\n/**\n * Clear the expression cache for a node.\n * Should be called when the node's expressions are modified.\n */\nfunction clearExpressionCache(node: JDMNode): void {\n  if (node.parsedContent && node.parsedContent._cachedExprs) {\n    node.parsedContent._cachedExprs.clear();\n  }\n}\n\n// Export individual optimization passes for testing\nexport { constantFolding, deadCodeElimination, expressionInlining, tableIndexing };\n\n// Export cache utilities for testing\nexport { getExpressionCache, clearExpressionCache };\n\n// ============================================================================\n// Constant Folding\n// ============================================================================\n\n/**\n * Fold constant expressions at compile time.\n *\n * This pass traverses expression ASTs and evaluates them at compile time\n * when possible. Examples:\n *   - Replace (2 + 3) with 5\n *   - Replace true and false with false\n *   - Replace \"hello\" + \" world\" with \"hello world\"\n *\n * @param ast - The compiled AST to optimize\n * @returns The AST with folded constants\n */\nfunction constantFolding(ast: CompiledAST): CompiledAST {\n  // Create a deep copy to avoid mutating the original\n  const optimized = JSON.parse(JSON.stringify(ast)) as JDMDecision;\n\n  // Apply constant folding to each node's expression content\n  optimized.nodes = optimized.nodes.map((node: JDMNode) => foldNodeExpressions(node));\n\n  return optimized;\n}\n\n/**\n * Apply constant folding to expressions within a node.\n */\nfunction foldNodeExpressions(node: JDMNode): JDMNode {\n  if (!node.content) {\n    return node;\n  }\n\n  const content = node.content;\n\n  // Handle decision table nodes\n  if (node.type === NodeType.DECISION_TABLE) {\n    return foldDecisionTableExpressions(node, content);\n  }\n\n  // Handle switch nodes\n  if (node.type === NodeType.SWITCH) {\n    return foldSwitchExpressions(node, content);\n  }\n\n  // Handle expression nodes\n  if (node.type === NodeType.EXPRESSION) {\n    return foldExpressionNode(node, content);\n  }\n\n  return node;\n}\n\n/**\n * Fold expressions in a decision table node.\n */\nfunction foldDecisionTableExpressions(node: JDMNode, content: Record<string, unknown>): JDMNode {\n  const { rules, inputs } = content as { rules: any[]; inputs: any[] };\n  let modified = false;\n\n  // Update each rule's input conditions with folded expressions\n  const foldedRules = rules.map((rule: Record<string, unknown>) => {\n    const foldedRule = { ...rule };\n\n    for (const input of inputs) {\n      const expr = rule[input.id] as string | undefined;\n      if (!expr || expr === '' || expr === '-') {\n        continue;\n      }\n\n      // Parse the expression in unary mode (using cache)\n      try {\n        const ast = cachedParseUnary(node, expr);\n        const folded = foldExpression(ast);\n\n        // If folding succeeded, update the expression string\n        if (folded !== null && isLiteral(folded)) {\n          const newExpr = literalToExprString(folded);\n          if (newExpr !== expr) {\n            foldedRule[input.id] = newExpr;\n            modified = true;\n          }\n        }\n      } catch {\n        // If expression can't be parsed or folded, keep original\n      }\n    }\n\n    return foldedRule;\n  });\n\n  // Clear cache if expressions were modified\n  if (modified) {\n    clearExpressionCache(node);\n  }\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      rules: foldedRules,\n    },\n  };\n}\n\n/**\n * Fold expressions in a switch node.\n */\nfunction foldSwitchExpressions(node: JDMNode, content: any): JDMNode {\n  const { conditions } = content;\n  let modified = false;\n\n  const foldedConditions = conditions.map((condition: any) => {\n    const expr = condition.expression;\n    if (!expr || expr === '') {\n      return condition;\n    }\n\n    try {\n      const ast = cachedParseStandard(node, expr);\n      const folded = foldExpression(ast);\n\n      if (folded !== null && isLiteral(folded)) {\n        const newExpr = literalToExprString(folded);\n        if (newExpr !== expr) {\n          modified = true;\n          return {\n            ...condition,\n            expression: newExpr,\n          };\n        }\n      }\n    } catch {\n      // If expression can't be parsed or folded, keep original\n    }\n\n    return condition;\n  });\n\n  // Clear cache if expressions were modified\n  if (modified) {\n    clearExpressionCache(node);\n  }\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      conditions: foldedConditions,\n    },\n  };\n}\n\n/**\n * Fold expressions in an expression node.\n */\nfunction foldExpressionNode(node: JDMNode, content: any): JDMNode {\n  const expr = content.expression;\n  if (!expr) {\n    return node;\n  }\n\n  try {\n    const ast = cachedParseStandard(node, expr);\n    const folded = foldExpression(ast);\n\n    if (folded !== null && isLiteral(folded)) {\n      const newExpr = literalToExprString(folded);\n      if (newExpr !== expr) {\n        // Clear cache since we're modifying the expression\n        clearExpressionCache(node);\n        return {\n          ...node,\n          content: {\n            ...content,\n            expression: newExpr,\n          },\n        };\n      }\n    }\n  } catch {\n    // If expression can't be parsed or folded, keep original\n  }\n\n  return node;\n}\n\n/**\n * Recursively fold an expression AST.\n * Returns the folded AST node, or null if folding is not possible.\n */\nfunction foldExpression(expr: ExpressionAST): ExpressionAST | null {\n  if (isLiteralExpr(expr)) {\n    return expr;\n  }\n\n  if (isBinaryOp(expr)) {\n    const leftFolded = foldExpression(expr.left);\n    const rightFolded = foldExpression(expr.right);\n\n    // If both sides are literals, try to evaluate at compilation time\n    if (leftFolded && rightFolded && isLiteral(leftFolded) && isLiteral(rightFolded)) {\n      const result = evaluateConstantBinaryOp(expr.op, leftFolded, rightFolded);\n      if (result !== null) {\n        return result;\n      }\n    }\n\n    return {\n      ...expr,\n      left: leftFolded || expr.left,\n      right: rightFolded || expr.right,\n    };\n  }\n\n  if (isUnaryOp(expr)) {\n    const operandFolded = foldExpression(expr.operand);\n\n    if (operandFolded && isLiteral(operandFolded)) {\n      const result = evaluateConstantUnaryOp(expr.op, operandFolded);\n      if (result !== null) {\n        return result;\n      }\n    }\n\n    return {\n      ...expr,\n      operand: operandFolded || expr.operand,\n    };\n  }\n\n  if (isTernaryOp(expr)) {\n    const conditionFolded = foldExpression(expr.condition);\n    const consequentFolded = foldExpression(expr.consequent);\n    const alternateFolded = foldExpression(expr.alternate);\n\n    if (conditionFolded && isLiteral(conditionFolded) && isBooleanLiteral(conditionFolded)) {\n      return conditionFolded.value\n        ? consequentFolded || expr.consequent\n        : alternateFolded || expr.alternate;\n    }\n\n    return {\n      ...expr,\n      condition: conditionFolded || expr.condition,\n      consequent: consequentFolded || expr.consequent,\n      alternate: alternateFolded || expr.alternate,\n    };\n  }\n\n  // Can't fold other expression types (identifiers, function calls, etc.)\n  return null;\n}\n\n/**\n * Check if an expression is a literal value.\n */\nfunction isLiteralExpr(expr: ExpressionAST): boolean {\n  return (\n    isNumberLiteral(expr) || isStringLiteral(expr) || isBooleanLiteral(expr) || isNullLiteral(expr)\n  );\n}\n\n/**\n * Check if a node is a literal.\n */\nfunction isLiteral(\n  node: ExpressionAST | null,\n): node is NumberLiteral | StringLiteral | BooleanLiteral {\n  return node !== null && isLiteralExpr(node);\n}\n\n/**\n * Evaluate a binary operation with constant operands.\n */\nfunction evaluateConstantBinaryOp(\n  op: string,\n  left: NumberLiteral | StringLiteral | BooleanLiteral,\n  right: NumberLiteral | StringLiteral | BooleanLiteral,\n): ExpressionAST | null {\n  // Numeric operations\n  if (isNumberLiteral(left) && isNumberLiteral(right)) {\n    switch (op) {\n      case '+':\n        return { type: 'NumberLiteral', value: left.value + right.value };\n      case '-':\n        return { type: 'NumberLiteral', value: left.value - right.value };\n      case '*':\n        return { type: 'NumberLiteral', value: left.value * right.value };\n      case '/':\n        return { type: 'NumberLiteral', value: left.value / right.value };\n      case '%':\n        return { type: 'NumberLiteral', value: left.value % right.value };\n      case '^':\n        return { type: 'NumberLiteral', value: Math.pow(left.value, right.value) };\n      case '<':\n        return { type: 'BooleanLiteral', value: left.value < right.value };\n      case '>':\n        return { type: 'BooleanLiteral', value: left.value > right.value };\n      case '<=':\n        return { type: 'BooleanLiteral', value: left.value <= right.value };\n      case '>=':\n        return { type: 'BooleanLiteral', value: left.value >= right.value };\n      case '==':\n        return { type: 'BooleanLiteral', value: left.value === right.value };\n      case '!=':\n        return { type: 'BooleanLiteral', value: left.value !== right.value };\n    }\n  }\n\n  // String operations\n  if (isStringLiteral(left) && isStringLiteral(right)) {\n    switch (op) {\n      case '+':\n        return { type: 'StringLiteral', value: left.value + right.value };\n      case '==':\n        return { type: 'BooleanLiteral', value: left.value === right.value };\n      case '!=':\n        return { type: 'BooleanLiteral', value: left.value !== right.value };\n    }\n  }\n\n  // Boolean operations\n  if (isBooleanLiteral(left) && isBooleanLiteral(right)) {\n    switch (op) {\n      case 'and':\n        return { type: 'BooleanLiteral', value: left.value && right.value };\n      case 'or':\n        return { type: 'BooleanLiteral', value: left.value || right.value };\n      case '==':\n        return { type: 'BooleanLiteral', value: left.value === right.value };\n      case '!=':\n        return { type: 'BooleanLiteral', value: left.value !== right.value };\n    }\n  }\n\n  return null;\n}\n\n/**\n * Evaluate a unary operation with a constant operand.\n */\nfunction evaluateConstantUnaryOp(\n  op: string,\n  operand: NumberLiteral | StringLiteral | BooleanLiteral,\n): ExpressionAST | null {\n  if (op === 'not' && isBooleanLiteral(operand)) {\n    return { type: 'BooleanLiteral', value: !operand.value };\n  }\n\n  if (op === '-' && isNumberLiteral(operand)) {\n    return { type: 'NumberLiteral', value: -operand.value };\n  }\n\n  return null;\n}\n\n/**\n * Convert a literal AST node to its string representation.\n */\nfunction literalToExprString(node: NumberLiteral | StringLiteral | BooleanLiteral): string {\n  switch (node.type) {\n    case 'NumberLiteral':\n      return String(node.value);\n    case 'StringLiteral':\n      return `\"${node.value}\"`;\n    case 'BooleanLiteral':\n      return String(node.value);\n  }\n}\n\n// ============================================================================\n// Dead Code Elimination\n// ============================================================================\n\n/**\n * Remove unreachable code.\n *\n * This pass identifies and removes branches that can never be reached.\n * Examples:\n *   - Remove if branches with constant false conditions\n *   - Remove decision table rows with always-false conditions\n *   - Remove decision table rows that can never match after previous rows\n *\n * @param ast - The compiled AST to optimize\n * @returns The AST with dead code removed\n */\nfunction deadCodeElimination(ast: CompiledAST): CompiledAST {\n  const optimized = JSON.parse(JSON.stringify(ast)) as JDMDecision;\n\n  optimized.nodes = optimized.nodes.map((node: JDMNode) => eliminateDeadCodeInNode(node));\n\n  return optimized;\n}\n\n/**\n * Apply dead code elimination to a node.\n */\nfunction eliminateDeadCodeInNode(node: JDMNode): JDMNode {\n  if (!node.content) {\n    return node;\n  }\n\n  const content = node.content;\n\n  if (node.type === NodeType.DECISION_TABLE) {\n    return eliminateDeadCodeInDecisionTable(node, content);\n  }\n\n  if (node.type === NodeType.SWITCH) {\n    return eliminateDeadCodeInSwitch(node, content);\n  }\n\n  return node;\n}\n\n/**\n * Check if a unary expression is always false.\n * In unary mode, \"false\" is equivalent to \"$ == false\".\n */\nfunction isUnaryAlwaysFalse(expr: ExpressionAST): boolean {\n  if (isBinaryOp(expr) && expr.op === '==') {\n    const leftIsDollar = expr.left.type === 'DollarRef';\n    const rightIsFalse = isBooleanLiteral(expr.right) && !expr.right.value;\n    return leftIsDollar && rightIsFalse;\n  }\n\n  if (isBinaryOp(expr) && expr.op === '!=') {\n    const leftIsDollar = expr.left.type === 'DollarRef';\n    const rightIsTrue = isBooleanLiteral(expr.right) && expr.right.value;\n    return leftIsDollar && rightIsTrue;\n  }\n\n  return false;\n}\n\n/**\n * Eliminate dead code in decision table nodes.\n */\nfunction eliminateDeadCodeInSwitch(node: JDMNode, content: any): JDMNode {\n  const { conditions } = content;\n\n  // Filter out conditions that are always false\n  const liveConditions = conditions.filter((condition: any) => {\n    const expr = condition.expression;\n    if (!expr || expr === '') {\n      return true;\n    }\n\n    try {\n      const parsed = cachedParseStandard(node, expr);\n\n      if (isBooleanLiteral(parsed) && !parsed.value) {\n        return false;\n      }\n    } catch {}\n\n    return true;\n  });\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      conditions: liveConditions,\n    },\n  };\n}\n\n/**\n * Eliminate dead code in decision table nodes.\n */\nfunction eliminateDeadCodeInDecisionTable(node: JDMNode, content: any): JDMNode {\n  const { rules, inputs } = content;\n\n  // Filter out rules that have a non-trivial always-false condition\n  const liveRules = rules.filter((rule: any) => {\n    for (const input of inputs) {\n      const expr = rule[input.id];\n      if (!expr || expr === '' || expr === '-') {\n        continue;\n      }\n\n      try {\n        const parsed = cachedParseUnary(node, expr);\n\n        // Check if this is a boolean literal (not common in unary mode, but possible)\n        if (isBooleanLiteral(parsed) && !parsed.value) {\n          return false;\n        }\n\n        // Check if this is a unary expression that's always false\n        // e.g., \"false\" in a decision table cell is interpreted as \"$ == false\"\n        if (isUnaryAlwaysFalse(parsed)) {\n          return false;\n        }\n      } catch {\n        // If we can't parse it, assume the rule is live\n      }\n    }\n\n    return true;\n  });\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      rules: liveRules,\n    },\n  };\n}\n\n// ============================================================================\n// Expression Inlining\n// ============================================================================\n\n/**\n * Inline small expressions.\n *\n * This pass replaces function calls with evaluated results for pure functions.\n * Examples:\n *   - Inline small arithmetic operations in decision table cells\n *   - Pre-evaluate expressions that don't depend on runtime values\n *\n * @param ast - The compiled AST to optimize\n * @returns The AST with inlined expressions\n */\nfunction expressionInlining(ast: CompiledAST): CompiledAST {\n  // Create a deep copy to avoid mutating the original\n  const optimized = JSON.parse(JSON.stringify(ast)) as JDMDecision;\n\n  // Only functions without side effects can be safely evaluated at compile time. Arithmetic\n  // (sum, max, min, abs, floor, ceil, round) and string functions (upper, lower, len) are\n  // pure and deterministic, so their results with constant inputs are predictable.\n  optimized.nodes = optimized.nodes.map((node: JDMNode) => inlineExpressionsInNode(node));\n\n  return optimized;\n}\n\n/**\n * Apply expression inlining to a node.\n */\nfunction inlineExpressionsInNode(node: JDMNode): JDMNode {\n  if (!node.content) {\n    return node;\n  }\n\n  const content = node.content;\n\n  // Handle decision table nodes\n  if (node.type === NodeType.DECISION_TABLE && content && content.rules && content.inputs) {\n    return inlineDecisionTableExpressions(node, content);\n  }\n\n  return node;\n}\n\n/**\n * Inline expressions in decision table nodes.\n */\nfunction inlineDecisionTableExpressions(node: JDMNode, content: any): JDMNode {\n  const { rules, inputs } = content;\n\n  const inlinedRules = rules.map((rule: any) => {\n    const inlinedRule = { ...rule };\n\n    for (const input of inputs) {\n      const expr = rule[input.id];\n      if (!expr || expr === '' || expr === '-') {\n        continue;\n      }\n\n      const inlined = tryInlineExpression(expr);\n      if (inlined !== expr) {\n        inlinedRule[input.id] = inlined;\n      }\n    }\n\n    return inlinedRule;\n  });\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      rules: inlinedRules,\n    },\n  };\n}\n\n/**\n * Try to inline an expression by evaluating simple pure function calls.\n * Returns the inlined expression string, or the original if inlining is not possible.\n */\nfunction tryInlineExpression(expr: string): string {\n  const trimmed = expr.trim();\n\n  // Inline simple arithmetic operations wrapped in function notation\n  // Examples: sum(2, 3) → 5, min(10, 5) → 5, abs(-5) → 5, upper(\"hello\") → \"HELLO\"\n\n  // Match sum(a, b, ...) pattern where all arguments are numeric literals\n  const sumMatch = trimmed.match(/^sum\\((.+)\\)$/i);\n  if (sumMatch) {\n    const args = sumMatch[1].split(',').map((s: string) => s.trim());\n    if (args.every((arg: string) => /^-?\\d+\\.?\\d*$/.test(arg))) {\n      const sum = args.reduce((acc: number, arg: string) => acc + parseFloat(arg), 0);\n      return String(sum);\n    }\n  }\n\n  // Match max(a, b) pattern where both arguments are numeric literals\n  const maxMatch = trimmed.match(/^max\\((.+),(.+)\\)$/i);\n  if (maxMatch) {\n    const [_, arg1, arg2] = maxMatch;\n    const num1 = parseFloat(arg1.trim());\n    const num2 = parseFloat(arg2.trim());\n    if (!isNaN(num1) && !isNaN(num2)) {\n      return String(Math.max(num1, num2));\n    }\n  }\n\n  // Match min(a, b) pattern where both arguments are numeric literals\n  const minMatch = trimmed.match(/^min\\((.+),(.+)\\)$/i);\n  if (minMatch) {\n    const [_, arg1, arg2] = minMatch;\n    const num1 = parseFloat(arg1.trim());\n    const num2 = parseFloat(arg2.trim());\n    if (!isNaN(num1) && !isNaN(num2)) {\n      return String(Math.min(num1, num2));\n    }\n  }\n\n  // Match abs(a) pattern where argument is a numeric literal\n  const absMatch = trimmed.match(/^abs\\((.+)\\)$/i);\n  if (absMatch) {\n    const val = parseFloat(absMatch[1].trim());\n    if (!isNaN(val)) {\n      return String(Math.abs(val));\n    }\n  }\n\n  // Match floor(a) pattern where argument is a numeric literal\n  const floorMatch = trimmed.match(/^floor\\((.+)\\)$/i);\n  if (floorMatch) {\n    const val = parseFloat(floorMatch[1].trim());\n    if (!isNaN(val)) {\n      return String(Math.floor(val));\n    }\n  }\n\n  // Match ceil(a) pattern where argument is a numeric literal\n  const ceilMatch = trimmed.match(/^ceil\\((.+)\\)$/i);\n  if (ceilMatch) {\n    const val = parseFloat(ceilMatch[1].trim());\n    if (!isNaN(val)) {\n      return String(Math.ceil(val));\n    }\n  }\n\n  // Match round(a) pattern where argument is a numeric literal\n  const roundMatch = trimmed.match(/^round\\((.+)\\)$/i);\n  if (roundMatch) {\n    const val = parseFloat(roundMatch[1].trim());\n    if (!isNaN(val)) {\n      return String(Math.round(val));\n    }\n  }\n\n  // Match upper(\"string\") pattern for constant string literals\n  const upperMatch = trimmed.match(/^upper\\(\"(.+)\"\\)$/i);\n  if (upperMatch) {\n    return `\"${upperMatch[1].toUpperCase()}\"`;\n  }\n\n  // Match lower(\"string\") pattern for constant string literals\n  const lowerMatch = trimmed.match(/^lower\\(\"(.+)\"\\)$/i);\n  if (lowerMatch) {\n    return `\"${lowerMatch[1].toLowerCase()}\"`;\n  }\n\n  // Match len(\"string\") pattern for constant string literals\n  const lenMatch = trimmed.match(/^len\\(\"(.*)\"\\)$/i);\n  if (lenMatch) {\n    return String(lenMatch[1].length);\n  }\n\n  // Match len(123) pattern for numeric literals (counting digits excluding sign)\n  const lenNumMatch = trimmed.match(/^len\\(-?\\d+\\.?\\d*\\)$/i);\n  if (lenNumMatch) {\n    const numStr = trimmed.match(/^len\\((.+)\\)$/i)![1].trim();\n    // Count digits ignoring sign and decimal point\n    const digitCount = numStr.replace(/^-/, '').replace('.', '').length;\n    return String(digitCount);\n  }\n\n  return expr;\n}\n\n// ============================================================================\n// Table Indexing\n// ============================================================================\n\n/**\n * Build index structures for efficient table lookup.\n *\n * This pass transforms linear search structures into more efficient alternatives.\n * Examples:\n *   - Convert decision table rows with equality checks to index-based lookup\n *   - Mark tables that are good candidates for switch statement generation\n *\n * Table indexing converts O(n) linear search to O(1) hash lookup when all rules check\n * equality on a single column with unique values - this is common in lookup tables\n * (e.g., pricing tiers by customer type) and can improve evaluation time by 10-100x\n * for large tables.\n *\n * @param ast - The compiled AST to optimize\n * @returns The AST with optimized table lookups\n */\nfunction tableIndexing(ast: CompiledAST): CompiledAST {\n  const optimized = JSON.parse(JSON.stringify(ast)) as JDMDecision;\n\n  optimized.nodes = optimized.nodes.map((node: JDMNode) => indexTableInNode(node));\n\n  return optimized;\n}\n\n/**\n * Apply table indexing to a node.\n */\nfunction indexTableInNode(node: JDMNode): JDMNode {\n  if (!node.content) {\n    return node;\n  }\n\n  const content = node.content;\n\n  if (node.type === NodeType.DECISION_TABLE) {\n    return indexDecisionTable(node, content);\n  }\n\n  return node;\n}\n\n/**\n * Index decision table for efficient lookup.\n *\n * This pass analyzes the decision table to identify patterns that can be\n * optimized, such as equality checks on a single column that could be\n * converted to a switch statement or hash map.\n */\nfunction indexDecisionTable(node: JDMNode, content: any): JDMNode {\n  const { rules, inputs } = content;\n\n  // Analyze each input column to find indexing opportunities\n  const indexedInputs = inputs.map((input: any) => {\n    const inputValues = rules.map((rule: any) => {\n      const expr = rule[input.id];\n      if (!expr || expr === '' || expr === '-') {\n        return null;\n      }\n      return expr.trim();\n    });\n\n    // Check if this column is a good candidate for indexing:\n    // - All values are string or number literals\n    // - No intervals or complex expressions\n    // - No duplicate values\n    const allLiterals = inputValues.every((val: string | null) => {\n      if (!val) {\n        return true;\n      }\n      return /^([\"'])(?:(?=(\\\\?))\\2.)*?\\1$|^-?\\d+\\.?\\d*$/.test(val);\n    });\n\n    const uniqueValues = new Set(inputValues.filter((v: string | null) => v !== null));\n    const hasDuplicates =\n      uniqueValues.size < inputValues.filter((v: string | null) => v !== null).length;\n\n    return {\n      ...input,\n      // Hash-based lookup becomes beneficial with ~10+ unique values, but overhead matters\n      // for small tables. 50 is a practical limit where indexing provides clear wins without\n      // excessive memory for the lookup structure.\n      _indexable: allLiterals && !hasDuplicates && uniqueValues.size > 0 && uniqueValues.size < 50,\n      _uniqueValues: Array.from(uniqueValues),\n    };\n  });\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      inputs: indexedInputs,\n    },\n  };\n}\n","/**\n * Runtime validation code generation for decision models.\n *\n * This module provides functions that generate or perform validation code\n * that executes at runtime. These functions validate actual data against\n * schemas when the decision is evaluated.\n *\n * For compile-time static analysis (checking references exist, etc.),\n * see compile-time-validation.ts.\n */\n\nimport type { FlattenedLayout } from './types';\n\n/**\n * Validation error containing field path, expected type, and actual value.\n */\nexport interface ValidationError {\n  /** The field path (e.g., \"customer.age\") */\n  path: string;\n  /** Error message describing the issue */\n  message: string;\n  /** The expected type */\n  expected?: string;\n  /** The actual value that failed validation */\n  actual?: unknown;\n}\n\n/**\n * Result of runtime validation.\n */\nexport interface ValidationResult {\n  /** Whether validation passed */\n  valid: boolean;\n  /** Array of validation errors (empty if valid) */\n  errors: ValidationError[];\n}\n\n/**\n * Validate runtime input data against the input schema.\n *\n * This function checks that all required input fields from the schema\n * are present in the provided input data AND that they have correct types.\n * It returns a list of validation errors including missing fields and\n * type mismatches.\n *\n * Security note: This validation prevents malformed input with wrong types\n * (string instead of number, object instead of array) from being marshaled\n * to WASM, which could cause runtime errors or unexpected behavior.\n *\n * @param inputData - Runtime input data as a JavaScript object\n * @param inputLayout - Flattened layout from the input schema\n * @returns Array of missing/invalid input field paths (empty if all valid)\n */\nexport function validateRuntimeInputs(\n  inputData: Record<string, any>,\n  inputLayout: FlattenedLayout,\n): string[] {\n  const result = validateRuntimeInputsDetailed(inputData, inputLayout);\n  // Return just the paths for backwards compatibility\n  return result.errors.map((e) => e.path);\n}\n\n/**\n * Validate runtime input data with detailed error information.\n *\n * This function performs comprehensive validation including:\n * - Presence checking: All required fields must be present\n * - Type checking: Values must match expected types\n * - Range checking: Numbers must be finite (not NaN/Infinity unless intended)\n *\n * @param inputData - Runtime input data as a JavaScript object\n * @param inputLayout - Flattened layout from the input schema\n * @returns Detailed validation result with errors\n */\nexport function validateRuntimeInputsDetailed(\n  inputData: Record<string, any>,\n  inputLayout: FlattenedLayout,\n): ValidationResult {\n  const errors: ValidationError[] = [];\n\n  for (const field of inputLayout.fields) {\n    const path = field.path;\n    const parts = path.split('.');\n\n    let current: any = inputData;\n    let exists = true;\n\n    // Navigate to the nested value\n    for (const part of parts) {\n      if (current === null || current === undefined || current[part] === undefined) {\n        exists = false;\n        break;\n      }\n      current = current[part];\n    }\n\n    if (!exists) {\n      errors.push({\n        path,\n        message: 'Required field is missing',\n        expected: field.type,\n        actual: undefined,\n      });\n      continue;\n    }\n\n    // Now check type\n    const typeError = validateFieldType(current, field.type, path);\n    if (typeError) {\n      errors.push(typeError);\n    }\n  }\n\n  return {\n    valid: errors.length === 0,\n    errors,\n  };\n}\n\n/**\n * Validate that a value matches the expected field type.\n *\n * @param value - The actual value to validate\n * @param expectedType - The expected type from the schema\n * @param path - The field path for error reporting\n * @returns ValidationError if type mismatch, null if valid\n */\nfunction validateFieldType(\n  value: unknown,\n  expectedType: 'f64' | 'i32' | 'i64' | 'bool' | 'string' | 'array',\n  path: string,\n): ValidationError | null {\n  const actualType = typeof value;\n\n  switch (expectedType) {\n    case 'f64':\n    case 'i32':\n    case 'i64': {\n      // Check for number type\n      if (actualType !== 'number' && actualType !== 'bigint') {\n        return {\n          path,\n          message: `Expected ${expectedType} (number), got ${actualType}`,\n          expected: expectedType,\n          actual: value,\n        };\n      }\n\n      // For number types, also check for NaN\n      if (actualType === 'number' && Number.isNaN(value)) {\n        return {\n          path,\n          message: `Invalid number: NaN is not allowed`,\n          expected: expectedType,\n          actual: value,\n        };\n      }\n\n      // For integer types, check that the value is actually an integer\n      if (expectedType === 'i32' || expectedType === 'i64') {\n        if (actualType === 'number' && !Number.isInteger(value)) {\n          return {\n            path,\n            message: `Expected integer, got floating-point number`,\n            expected: expectedType,\n            actual: value,\n          };\n        }\n      }\n      break;\n    }\n\n    case 'bool': {\n      if (actualType !== 'boolean') {\n        return {\n          path,\n          message: `Expected boolean, got ${actualType}`,\n          expected: 'boolean',\n          actual: value,\n        };\n      }\n      break;\n    }\n\n    case 'string': {\n      if (actualType !== 'string') {\n        return {\n          path,\n          message: `Expected string, got ${actualType}`,\n          expected: 'string',\n          actual: value,\n        };\n      }\n      break;\n    }\n\n    case 'array': {\n      if (!Array.isArray(value)) {\n        return {\n          path,\n          message: `Expected array, got ${actualType}`,\n          expected: 'array',\n          actual: value,\n        };\n      }\n      break;\n    }\n\n    default: {\n      // Unknown type - this shouldn't happen with a valid schema\n      // but we'll accept any value for forward compatibility\n      break;\n    }\n  }\n\n  return null;\n}\n\n/**\n * Validate runtime output data against the output schema.\n *\n * This function checks that all required output fields from the schema\n * are present in the provided output data AND that they have correct types.\n * It returns a list of validation errors including missing fields and\n * type mismatches.\n *\n * @param outputData - Runtime output data as a JavaScript object\n * @param outputLayout - Flattened layout from the output schema\n * @returns Array of missing/invalid output field paths (empty if all valid)\n */\nexport function validateRuntimeOutputs(\n  outputData: Record<string, any>,\n  outputLayout: FlattenedLayout,\n): string[] {\n  const result = validateRuntimeOutputsDetailed(outputData, outputLayout);\n  return result.errors.map((e) => e.path);\n}\n\n/**\n * Validate runtime output data with detailed error information.\n *\n * This function performs comprehensive validation including:\n * - Presence checking: All required output fields must be present\n * - Type checking: Values must match expected types\n *\n * @param outputData - Runtime output data as a JavaScript object\n * @param outputLayout - Flattened layout from the output schema\n * @returns Detailed validation result with errors\n */\nexport function validateRuntimeOutputsDetailed(\n  outputData: Record<string, any>,\n  outputLayout: FlattenedLayout,\n): ValidationResult {\n  const errors: ValidationError[] = [];\n\n  for (const field of outputLayout.fields) {\n    const path = field.path;\n    const parts = path.split('.');\n\n    // Allows objects to be built incrementally (e.g., output.customer.name and\n    // output.customer.age) instead of requiring the entire object at once.\n    let current: any = outputData;\n    let exists = true;\n\n    for (const part of parts) {\n      if (current === null || current === undefined || current[part] === undefined) {\n        exists = false;\n        break;\n      }\n      current = current[part];\n    }\n\n    if (!exists) {\n      errors.push({\n        path,\n        message: 'Required output field is missing',\n        expected: field.type,\n        actual: undefined,\n      });\n      continue;\n    }\n\n    // Now check type\n    const typeError = validateFieldType(current, field.type, path);\n    if (typeError) {\n      errors.push(typeError);\n    }\n  }\n\n  return {\n    valid: errors.length === 0,\n    errors,\n  };\n}\n"],"mappings":";AAkCO,IAAK,YAAL,kBAAKA,eAAL;AAEL,EAAAA,WAAA,kBAAe;AACf,EAAAA,WAAA,4BAAyB;AACzB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,oBAAiB;AACjB,EAAAA,WAAA,kBAAe;AAGf,EAAAA,WAAA,+BAA4B;AAC5B,EAAAA,WAAA,4BAAyB;AAGzB,EAAAA,WAAA,iBAAc;AACd,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,mBAAgB;AAChB,EAAAA,WAAA,mBAAgB;AAGhB,EAAAA,WAAA,qBAAkB;AAClB,EAAAA,WAAA,oBAAiB;AAtBP,SAAAA;AAAA,GAAA;AA+BL,IAAM,mBAAN,MAAM,0BAAyB,MAAM;AAAA,EAG1C,YACE,SACgB,MACA,UACA,SAChB;AACA,UAAM,OAAO;AAJG;AACA;AACA;AAOhB,QAAI,MAAM,mBAAmB;AAC3B,YAAM,kBAAkB,MAAM,iBAAgB;AAAA,IAChD;AAAA,EACF;AAAA,EAhBS,OAAO;AAAA;AAAA;AAAA;AAAA,EAqBhB,sBAA8B;AAC5B,UAAM,QAAkB,CAAC;AAEzB,QAAI,KAAK,UAAU;AACjB,YAAM,WAAqB,CAAC;AAC5B,UAAI,KAAK,SAAS,UAAU;AAC1B,iBAAS,KAAK,KAAK,SAAS,QAAQ;AAAA,MACtC;AACA,UAAI,KAAK,SAAS,QAAQ;AACxB,iBAAS,KAAK,QAAQ,KAAK,SAAS,MAAM,GAAG;AAAA,MAC/C;AACA,UAAI,KAAK,SAAS,OAAO;AACvB,iBAAS,KAAK,IAAI,KAAK,SAAS,KAAK,EAAE;AAAA,MACzC;AAEA,UAAI,KAAK,SAAS,SAAS,UAAa,KAAK,SAAS,WAAW,QAAW;AAC1E,iBAAS,KAAK,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,MAAM,EAAE;AAAA,MAChE,WAAW,KAAK,SAAS,SAAS,QAAW;AAC3C,iBAAS,KAAK,IAAI,KAAK,SAAS,IAAI,EAAE;AAAA,MACxC,WAAW,KAAK,SAAS,WAAW,QAAW;AAC7C,iBAAS,KAAK,IAAI,KAAK,SAAS,MAAM,EAAE;AAAA,MAC1C;AAEA,UAAI,SAAS,SAAS,GAAG;AACvB,cAAM,KAAK,IAAI,SAAS,KAAK,GAAG,CAAC,GAAG;AAAA,MACtC;AAAA,IACF;AAEA,UAAM,KAAK,IAAI,KAAK,IAAI,GAAG;AAC3B,UAAM,KAAK,KAAK,OAAO;AAEvB,WAAO,MAAM,KAAK,GAAG;AAAA,EACvB;AACF;AAeO,IAAM,iBAAN,MAAqB;AAAA,EAClB,SAA6B,CAAC;AAAA;AAAA;AAAA;AAAA,EAKtC,IAAI,OAA+B;AACjC,SAAK,OAAO,KAAK,KAAK;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,YAAqB;AACnB,WAAO,KAAK,OAAO,SAAS;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,gBAAsB;AACpB,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B;AAAA,IACF;AAEA,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B,YAAM,KAAK,OAAO,CAAC;AAAA,IACrB;AAEA,UAAM,UACJ,GAAG,KAAK,OAAO,MAAM;AAAA,IACrB,KAAK,OACF,IAAI,CAAC,GAAG,MAAM;AACb,YAAM,SAAS,KAAK,IAAI,CAAC,KAAK,EAAE,IAAI;AACpC,YAAM,YAAY,EAAE,oBAAoB;AAGxC,YAAM,OAAO,UAAU,QAAQ,IAAI,EAAE,IAAI,KAAK,EAAE,EAAE,KAAK;AACvD,aAAO,GAAG,MAAM,GAAG,OAAO,OAAO,OAAO,EAAE;AAAA,IAC5C,CAAC,EACA,KAAK,IAAI;AAGd,UAAM,qBAAqB,KAAK,OAAO,CAAC,EAAE;AAC1C,UAAM,IAAI,iBAAiB,SAAS,iCAAuB,kBAAkB;AAAA,EAC/E;AACF;AAKO,SAAS,mBAAmB,OAA2C;AAC5E,SAAO,iBAAiB;AAC1B;AAKO,SAAS,kBAAkB,MAA0B;AAC1D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,SAAS,IAAI;AACjB;AAKO,SAAS,eAAe,MAA0B;AACvD,SAAO,CAAC,6DAAqC,qDAAgC,EAAE,SAAS,IAAI;AAC9F;AAKO,SAAS,kBAAkB,MAA0B;AAC1D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,SAAS,IAAI;AACjB;;;ACjOA,IAAI,wBAAwB,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,MAAM,GAAG,GAAG,IAAI,OAAO,IAAI,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,KAAK,IAAI,GAAG,IAAI,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,KAAK,GAAG,GAAG,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,GAAG,MAAM,GAAG,QAAQ,GAAG;AAGzoC,IAAI,6BAA6B,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,GAAG,KAAK,MAAM,IAAI,MAAM,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,MAAM,GAAG,MAAM,IAAI,GAAG,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,KAAK,MAAM,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,GAAG,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,GAAG,MAAM,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,MAAM,OAAO,IAAI,MAAM,GAAG,KAAK,GAAG,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,KAAK,MAAM,MAAM,GAAG,IAAI;AAGnpE,IAAI,0BAA0B;AAG9B,IAAI,+BAA+B;AASnC,IAAI,gBAAgB;AAAA,EAClB,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,QAAQ;AAAA,EACR,YAAY;AACd;AAIA,IAAI,uBAAuB;AAE3B,IAAI,aAAa;AAAA,EACf,GAAG;AAAA,EACH,WAAW,uBAAuB;AAAA,EAClC,GAAG,uBAAuB;AAC5B;AAEA,IAAI,4BAA4B;AAIhC,IAAI,0BAA0B,IAAI,OAAO,MAAM,+BAA+B,GAAG;AACjF,IAAI,qBAAqB,IAAI,OAAO,MAAM,+BAA+B,0BAA0B,GAAG;AAKtG,SAAS,cAAc,MAAM,KAAK;AAChC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AACtC,WAAO,IAAI,CAAC;AACZ,QAAI,MAAM,MAAM;AAAE,aAAO;AAAA,IAAM;AAC/B,WAAO,IAAI,IAAI,CAAC;AAChB,QAAI,OAAO,MAAM;AAAE,aAAO;AAAA,IAAK;AAAA,EACjC;AACA,SAAO;AACT;AAIA,SAAS,kBAAkB,MAAM,QAAQ;AACvC,MAAI,OAAO,IAAI;AAAE,WAAO,SAAS;AAAA,EAAG;AACpC,MAAI,OAAO,IAAI;AAAE,WAAO;AAAA,EAAK;AAC7B,MAAI,OAAO,IAAI;AAAE,WAAO,SAAS;AAAA,EAAG;AACpC,MAAI,OAAO,KAAK;AAAE,WAAO;AAAA,EAAK;AAC9B,MAAI,QAAQ,OAAQ;AAAE,WAAO,QAAQ,OAAQ,wBAAwB,KAAK,OAAO,aAAa,IAAI,CAAC;AAAA,EAAE;AACrG,MAAI,WAAW,OAAO;AAAE,WAAO;AAAA,EAAM;AACrC,SAAO,cAAc,MAAM,0BAA0B;AACvD;AAIA,SAAS,iBAAiB,MAAM,QAAQ;AACtC,MAAI,OAAO,IAAI;AAAE,WAAO,SAAS;AAAA,EAAG;AACpC,MAAI,OAAO,IAAI;AAAE,WAAO;AAAA,EAAK;AAC7B,MAAI,OAAO,IAAI;AAAE,WAAO;AAAA,EAAM;AAC9B,MAAI,OAAO,IAAI;AAAE,WAAO;AAAA,EAAK;AAC7B,MAAI,OAAO,IAAI;AAAE,WAAO,SAAS;AAAA,EAAG;AACpC,MAAI,OAAO,KAAK;AAAE,WAAO;AAAA,EAAK;AAC9B,MAAI,QAAQ,OAAQ;AAAE,WAAO,QAAQ,OAAQ,mBAAmB,KAAK,OAAO,aAAa,IAAI,CAAC;AAAA,EAAE;AAChG,MAAI,WAAW,OAAO;AAAE,WAAO;AAAA,EAAM;AACrC,SAAO,cAAc,MAAM,0BAA0B,KAAK,cAAc,MAAM,qBAAqB;AACrG;AAyBA,IAAI,YAAY,SAASC,WAAU,OAAO,MAAM;AAC9C,MAAK,SAAS,OAAS,QAAO,CAAC;AAE/B,OAAK,QAAQ;AACb,OAAK,UAAU,KAAK;AACpB,OAAK,aAAa,CAAC,CAAC,KAAK;AACzB,OAAK,aAAa,CAAC,CAAC,KAAK;AACzB,OAAK,SAAS,CAAC,CAAC,KAAK;AACrB,OAAK,WAAW,CAAC,CAAC,KAAK;AACvB,OAAK,SAAS,CAAC,CAAC,KAAK;AACrB,OAAK,UAAU,CAAC,CAAC,KAAK;AACtB,OAAK,QAAQ,KAAK,SAAS;AAC3B,OAAK,gBAAgB;AACvB;AAEA,SAAS,MAAM,MAAM,MAAM;AACzB,SAAO,IAAI,UAAU,MAAM,EAAC,YAAY,MAAM,OAAO,KAAI,CAAC;AAC5D;AACA,IAAI,aAAa,EAAC,YAAY,KAAI;AAAlC,IAAqC,aAAa,EAAC,YAAY,KAAI;AAInE,IAAI,WAAW,CAAC;AAGhB,SAAS,GAAG,MAAM,SAAS;AACzB,MAAK,YAAY,OAAS,WAAU,CAAC;AAErC,UAAQ,UAAU;AAClB,SAAO,SAAS,IAAI,IAAI,IAAI,UAAU,MAAM,OAAO;AACrD;AAEA,IAAI,UAAU;AAAA,EACZ,KAAK,IAAI,UAAU,OAAO,UAAU;AAAA,EACpC,QAAQ,IAAI,UAAU,UAAU,UAAU;AAAA,EAC1C,QAAQ,IAAI,UAAU,UAAU,UAAU;AAAA,EAC1C,MAAM,IAAI,UAAU,QAAQ,UAAU;AAAA,EACtC,WAAW,IAAI,UAAU,aAAa,UAAU;AAAA,EAChD,KAAK,IAAI,UAAU,KAAK;AAAA;AAAA,EAGxB,UAAU,IAAI,UAAU,KAAK,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA,EACjE,UAAU,IAAI,UAAU,GAAG;AAAA,EAC3B,QAAQ,IAAI,UAAU,KAAK,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA,EAC/D,QAAQ,IAAI,UAAU,GAAG;AAAA,EACzB,QAAQ,IAAI,UAAU,KAAK,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA,EAC/D,QAAQ,IAAI,UAAU,GAAG;AAAA,EACzB,OAAO,IAAI,UAAU,KAAK,UAAU;AAAA,EACpC,MAAM,IAAI,UAAU,KAAK,UAAU;AAAA,EACnC,OAAO,IAAI,UAAU,KAAK,UAAU;AAAA,EACpC,KAAK,IAAI,UAAU,GAAG;AAAA,EACtB,UAAU,IAAI,UAAU,KAAK,UAAU;AAAA,EACvC,aAAa,IAAI,UAAU,IAAI;AAAA,EAC/B,OAAO,IAAI,UAAU,MAAM,UAAU;AAAA,EACrC,UAAU,IAAI,UAAU,UAAU;AAAA,EAClC,iBAAiB,IAAI,UAAU,iBAAiB;AAAA,EAChD,UAAU,IAAI,UAAU,OAAO,UAAU;AAAA,EACzC,WAAW,IAAI,UAAU,KAAK,UAAU;AAAA,EACxC,cAAc,IAAI,UAAU,MAAM,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBtE,IAAI,IAAI,UAAU,KAAK,EAAC,YAAY,MAAM,UAAU,KAAI,CAAC;AAAA,EACzD,QAAQ,IAAI,UAAU,MAAM,EAAC,YAAY,MAAM,UAAU,KAAI,CAAC;AAAA,EAC9D,QAAQ,IAAI,UAAU,SAAS,EAAC,QAAQ,MAAM,SAAS,MAAM,YAAY,KAAI,CAAC;AAAA,EAC9E,QAAQ,IAAI,UAAU,OAAO,EAAC,YAAY,MAAM,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EAC/E,WAAW,MAAM,MAAM,CAAC;AAAA,EACxB,YAAY,MAAM,MAAM,CAAC;AAAA,EACzB,WAAW,MAAM,KAAK,CAAC;AAAA,EACvB,YAAY,MAAM,KAAK,CAAC;AAAA,EACxB,YAAY,MAAM,KAAK,CAAC;AAAA,EACxB,UAAU,MAAM,iBAAiB,CAAC;AAAA,EAClC,YAAY,MAAM,aAAa,CAAC;AAAA,EAChC,UAAU,MAAM,aAAa,CAAC;AAAA,EAC9B,SAAS,IAAI,UAAU,OAAO,EAAC,YAAY,MAAM,OAAO,GAAG,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EAC1F,QAAQ,MAAM,KAAK,EAAE;AAAA,EACrB,MAAM,MAAM,KAAK,EAAE;AAAA,EACnB,OAAO,MAAM,KAAK,EAAE;AAAA,EACpB,UAAU,IAAI,UAAU,MAAM,EAAC,YAAY,KAAI,CAAC;AAAA,EAChD,UAAU,MAAM,MAAM,CAAC;AAAA;AAAA,EAGvB,QAAQ,GAAG,OAAO;AAAA,EAClB,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,QAAQ,GAAG,OAAO;AAAA,EAClB,WAAW,GAAG,UAAU;AAAA,EACxB,WAAW,GAAG,UAAU;AAAA,EACxB,UAAU,GAAG,WAAW,UAAU;AAAA,EAClC,KAAK,GAAG,MAAM,EAAC,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EAC9C,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,UAAU,GAAG,SAAS;AAAA,EACtB,MAAM,GAAG,OAAO,EAAC,QAAQ,KAAI,CAAC;AAAA,EAC9B,WAAW,GAAG,YAAY,UAAU;AAAA,EACpC,KAAK,GAAG,IAAI;AAAA,EACZ,SAAS,GAAG,UAAU,UAAU;AAAA,EAChC,SAAS,GAAG,QAAQ;AAAA,EACpB,QAAQ,GAAG,SAAS,UAAU;AAAA,EAC9B,MAAM,GAAG,KAAK;AAAA,EACd,MAAM,GAAG,KAAK;AAAA,EACd,QAAQ,GAAG,OAAO;AAAA,EAClB,QAAQ,GAAG,SAAS,EAAC,QAAQ,KAAI,CAAC;AAAA,EAClC,OAAO,GAAG,MAAM;AAAA,EAChB,MAAM,GAAG,OAAO,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA,EACpD,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,QAAQ,GAAG,SAAS,UAAU;AAAA,EAC9B,QAAQ,GAAG,SAAS,UAAU;AAAA,EAC9B,UAAU,GAAG,WAAW,UAAU;AAAA,EAClC,SAAS,GAAG,QAAQ;AAAA,EACpB,SAAS,GAAG,UAAU,UAAU;AAAA,EAChC,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,QAAQ,GAAG,SAAS,UAAU;AAAA,EAC9B,KAAK,GAAG,MAAM,EAAC,YAAY,MAAM,OAAO,EAAC,CAAC;AAAA,EAC1C,aAAa,GAAG,cAAc,EAAC,YAAY,MAAM,OAAO,EAAC,CAAC;AAAA,EAC1D,SAAS,GAAG,UAAU,EAAC,YAAY,MAAM,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EACxE,OAAO,GAAG,QAAQ,EAAC,YAAY,MAAM,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EACpE,SAAS,GAAG,UAAU,EAAC,YAAY,MAAM,QAAQ,MAAM,YAAY,KAAI,CAAC;AAC1E;AAKA,IAAI,YAAY;AAChB,IAAI,aAAa,IAAI,OAAO,UAAU,QAAQ,GAAG;AAEjD,SAAS,UAAU,MAAM;AACvB,SAAO,SAAS,MAAM,SAAS,MAAM,SAAS,QAAU,SAAS;AACnE;AAEA,SAAS,cAAc,MAAM,MAAM,KAAK;AACtC,MAAK,QAAQ,OAAS,OAAM,KAAK;AAEjC,WAAS,IAAI,MAAM,IAAI,KAAK,KAAK;AAC/B,QAAI,OAAO,KAAK,WAAW,CAAC;AAC5B,QAAI,UAAU,IAAI,GAChB;AAAE,aAAO,IAAI,MAAM,KAAK,SAAS,MAAM,KAAK,WAAW,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI;AAAA,IAAE;AAAA,EACzF;AACA,SAAO;AACT;AAEA,IAAI,qBAAqB;AAEzB,IAAI,iBAAiB;AAErB,IAAI,MAAM,OAAO;AACjB,IAAI,iBAAiB,IAAI;AACzB,IAAI,WAAW,IAAI;AAEnB,IAAI,SAAS,OAAO,WAAW,SAAU,KAAK,UAAU;AAAE,SACxD,eAAe,KAAK,KAAK,QAAQ;AAChC;AAEH,IAAI,UAAU,MAAM,YAAY,SAAU,KAAK;AAAE,SAC/C,SAAS,KAAK,GAAG,MAAM;AACtB;AAEH,IAAI,cAAc,uBAAO,OAAO,IAAI;AAEpC,SAAS,YAAY,OAAO;AAC1B,SAAO,YAAY,KAAK,MAAM,YAAY,KAAK,IAAI,IAAI,OAAO,SAAS,MAAM,QAAQ,MAAM,GAAG,IAAI,IAAI;AACxG;AAEA,SAAS,kBAAkB,MAAM;AAE/B,MAAI,QAAQ,OAAQ;AAAE,WAAO,OAAO,aAAa,IAAI;AAAA,EAAE;AACvD,UAAQ;AACR,SAAO,OAAO,cAAc,QAAQ,MAAM,QAAS,OAAO,QAAQ,KAAM;AAC1E;AAEA,IAAI,gBAAgB;AAKpB,IAAI,WAAW,SAASC,UAAS,MAAM,KAAK;AAC1C,OAAK,OAAO;AACZ,OAAK,SAAS;AAChB;AAEA,SAAS,UAAU,SAAS,SAAS,OAAQ,GAAG;AAC9C,SAAO,IAAI,SAAS,KAAK,MAAM,KAAK,SAAS,CAAC;AAChD;AAEA,IAAI,iBAAiB,SAASC,gBAAe,GAAG,OAAO,KAAK;AAC1D,OAAK,QAAQ;AACb,OAAK,MAAM;AACX,MAAI,EAAE,eAAe,MAAM;AAAE,SAAK,SAAS,EAAE;AAAA,EAAY;AAC3D;AAQA,SAAS,YAAY,OAAOC,SAAQ;AAClC,WAAS,OAAO,GAAG,MAAM,OAAK;AAC5B,QAAI,YAAY,cAAc,OAAO,KAAKA,OAAM;AAChD,QAAI,YAAY,GAAG;AAAE,aAAO,IAAI,SAAS,MAAMA,UAAS,GAAG;AAAA,IAAE;AAC7D,MAAE;AACF,UAAM;AAAA,EACR;AACF;AAKA,IAAI,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOnB,aAAa;AAAA;AAAA;AAAA;AAAA,EAIb,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMZ,qBAAqB;AAAA;AAAA;AAAA,EAGrB,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKjB,eAAe;AAAA;AAAA;AAAA,EAGf,4BAA4B;AAAA;AAAA;AAAA;AAAA,EAI5B,6BAA6B;AAAA;AAAA;AAAA;AAAA,EAI7B,2BAA2B;AAAA;AAAA;AAAA,EAG3B,yBAAyB;AAAA;AAAA;AAAA;AAAA,EAIzB,eAAe;AAAA;AAAA;AAAA;AAAA,EAIf,oBAAoB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKpB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMX,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaT,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASX,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,SAAS;AAAA;AAAA;AAAA,EAGT,YAAY;AAAA;AAAA;AAAA,EAGZ,kBAAkB;AAAA;AAAA;AAAA,EAGlB,gBAAgB;AAClB;AAIA,IAAI,yBAAyB;AAE7B,SAAS,WAAW,MAAM;AACxB,MAAI,UAAU,CAAC;AAEf,WAAS,OAAO,gBACd;AAAE,YAAQ,GAAG,IAAI,QAAQ,OAAO,MAAM,GAAG,IAAI,KAAK,GAAG,IAAI,eAAe,GAAG;AAAA,EAAG;AAEhF,MAAI,QAAQ,gBAAgB,UAAU;AACpC,YAAQ,cAAc;AAAA,EACxB,WAAW,QAAQ,eAAe,MAAM;AACtC,QAAI,CAAC,0BAA0B,OAAO,YAAY,YAAY,QAAQ,MAAM;AAC1E,+BAAyB;AACzB,cAAQ,KAAK,oHAAoH;AAAA,IACnI;AACA,YAAQ,cAAc;AAAA,EACxB,WAAW,QAAQ,eAAe,MAAM;AACtC,YAAQ,eAAe;AAAA,EACzB;AAEA,MAAI,QAAQ,iBAAiB,MAC3B;AAAE,YAAQ,gBAAgB,QAAQ,cAAc;AAAA,EAAG;AAErD,MAAI,CAAC,QAAQ,KAAK,iBAAiB,MACjC;AAAE,YAAQ,gBAAgB,QAAQ,eAAe;AAAA,EAAI;AAEvD,MAAI,QAAQ,QAAQ,OAAO,GAAG;AAC5B,QAAI,SAAS,QAAQ;AACrB,YAAQ,UAAU,SAAU,OAAO;AAAE,aAAO,OAAO,KAAK,KAAK;AAAA,IAAG;AAAA,EAClE;AACA,MAAI,QAAQ,QAAQ,SAAS,GAC3B;AAAE,YAAQ,YAAY,YAAY,SAAS,QAAQ,SAAS;AAAA,EAAG;AAEjE,SAAO;AACT;AAEA,SAAS,YAAY,SAAS,OAAO;AACnC,SAAO,SAAS,OAAO,MAAM,OAAO,KAAK,UAAU,QAAQ;AACzD,QAAI,UAAU;AAAA,MACZ,MAAM,QAAQ,UAAU;AAAA,MACxB,OAAO;AAAA,MACP;AAAA,MACA;AAAA,IACF;AACA,QAAI,QAAQ,WACV;AAAE,cAAQ,MAAM,IAAI,eAAe,MAAM,UAAU,MAAM;AAAA,IAAG;AAC9D,QAAI,QAAQ,QACV;AAAE,cAAQ,QAAQ,CAAC,OAAO,GAAG;AAAA,IAAG;AAClC,UAAM,KAAK,OAAO;AAAA,EACpB;AACF;AAGA,IACI,YAAY;AADhB,IAEI,iBAAiB;AAFrB,IAGI,cAAc;AAHlB,IAII,kBAAkB;AAJtB,IAKI,cAAc;AALlB,IAMI,qBAAqB;AANzB,IAOI,cAAc;AAPlB,IAQI,qBAAqB;AARzB,IASI,2BAA2B;AAT/B,IAUI,yBAAyB;AAV7B,IAWI,YAAY,YAAY,iBAAiB;AAE7C,SAAS,cAAc,OAAO,WAAW;AACvC,SAAO,kBAAkB,QAAQ,cAAc,MAAM,YAAY,kBAAkB;AACrF;AAGA,IACI,YAAY;AADhB,IAEI,WAAW;AAFf,IAGI,eAAe;AAHnB,IAII,gBAAgB;AAJpB,IAKI,oBAAoB;AALxB,IAMI,eAAe;AAEnB,IAAI,SAAS,SAASC,QAAO,SAAS,OAAO,UAAU;AACrD,OAAK,UAAU,UAAU,WAAW,OAAO;AAC3C,OAAK,aAAa,QAAQ;AAC1B,OAAK,WAAW,YAAY,WAAW,QAAQ,eAAe,IAAI,IAAI,QAAQ,eAAe,WAAW,YAAY,CAAC,CAAC;AACtH,MAAI,WAAW;AACf,MAAI,QAAQ,kBAAkB,MAAM;AAClC,eAAW,cAAc,QAAQ,eAAe,IAAI,IAAI,QAAQ,gBAAgB,IAAI,IAAI,CAAC;AACzF,QAAI,QAAQ,eAAe,UAAU;AAAE,kBAAY;AAAA,IAAU;AAAA,EAC/D;AACA,OAAK,gBAAgB,YAAY,QAAQ;AACzC,MAAI,kBAAkB,WAAW,WAAW,MAAM,MAAM,cAAc;AACtE,OAAK,sBAAsB,YAAY,cAAc;AACrD,OAAK,0BAA0B,YAAY,iBAAiB,MAAM,cAAc,UAAU;AAC1F,OAAK,QAAQ,OAAO,KAAK;AAKzB,OAAK,cAAc;AAKnB,MAAI,UAAU;AACZ,SAAK,MAAM;AACX,SAAK,YAAY,KAAK,MAAM,YAAY,MAAM,WAAW,CAAC,IAAI;AAC9D,SAAK,UAAU,KAAK,MAAM,MAAM,GAAG,KAAK,SAAS,EAAE,MAAM,SAAS,EAAE;AAAA,EACtE,OAAO;AACL,SAAK,MAAM,KAAK,YAAY;AAC5B,SAAK,UAAU;AAAA,EACjB;AAIA,OAAK,OAAO,QAAQ;AAEpB,OAAK,QAAQ;AAEb,OAAK,QAAQ,KAAK,MAAM,KAAK;AAG7B,OAAK,WAAW,KAAK,SAAS,KAAK,YAAY;AAG/C,OAAK,gBAAgB,KAAK,kBAAkB;AAC5C,OAAK,eAAe,KAAK,aAAa,KAAK;AAK3C,OAAK,UAAU,KAAK,eAAe;AACnC,OAAK,cAAc;AAGnB,OAAK,WAAW,QAAQ,eAAe;AACvC,OAAK,SAAS,KAAK,YAAY,KAAK,gBAAgB,KAAK,GAAG;AAG5D,OAAK,mBAAmB;AACxB,OAAK,2BAA2B;AAGhC,OAAK,WAAW,KAAK,WAAW,KAAK,gBAAgB;AAErD,OAAK,SAAS,CAAC;AAEf,OAAK,mBAAmB,uBAAO,OAAO,IAAI;AAG1C,MAAI,KAAK,QAAQ,KAAK,QAAQ,iBAAiB,KAAK,MAAM,MAAM,GAAG,CAAC,MAAM,MACxE;AAAE,SAAK,gBAAgB,CAAC;AAAA,EAAG;AAG7B,OAAK,aAAa,CAAC;AACnB,OAAK,WAAW,SAAS;AAGzB,OAAK,cAAc;AAKnB,OAAK,mBAAmB,CAAC;AAC3B;AAEA,IAAI,qBAAqB,EAAE,YAAY,EAAE,cAAc,KAAK,GAAE,aAAa,EAAE,cAAc,KAAK,GAAE,SAAS,EAAE,cAAc,KAAK,GAAE,UAAU,EAAE,cAAc,KAAK,GAAE,YAAY,EAAE,cAAc,KAAK,GAAE,kBAAkB,EAAE,cAAc,KAAK,GAAE,qBAAqB,EAAE,cAAc,KAAK,GAAE,mBAAmB,EAAE,cAAc,KAAK,GAAE,oBAAoB,EAAE,cAAc,KAAK,EAAE;AAEhX,OAAO,UAAU,QAAQ,SAAS,QAAS;AACzC,MAAI,OAAO,KAAK,QAAQ,WAAW,KAAK,UAAU;AAClD,OAAK,UAAU;AACf,SAAO,KAAK,cAAc,IAAI;AAChC;AAEA,mBAAmB,WAAW,MAAM,WAAY;AAAE,UAAQ,KAAK,gBAAgB,EAAE,QAAQ,kBAAkB;AAAE;AAE7G,mBAAmB,YAAY,MAAM,WAAY;AAAE,UAAQ,KAAK,gBAAgB,EAAE,QAAQ,mBAAmB;AAAE;AAE/G,mBAAmB,QAAQ,MAAM,WAAY;AAAE,UAAQ,KAAK,gBAAgB,EAAE,QAAQ,eAAe;AAAE;AAEvG,mBAAmB,SAAS,MAAM,WAAY;AAC5C,WAAS,IAAI,KAAK,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;AACpD,QAAIC,OAAM,KAAK,WAAW,CAAC;AACzB,QAAI,QAAQA,KAAI;AAClB,QAAI,SAAS,2BAA2B,yBAAyB;AAAE,aAAO;AAAA,IAAM;AAChF,QAAI,QAAQ,gBAAgB;AAAE,cAAQ,QAAQ,eAAe;AAAA,IAAE;AAAA,EACjE;AACA,SAAQ,KAAK,YAAY,KAAK,QAAQ,eAAe,MAAO,KAAK,QAAQ;AAC3E;AAEA,mBAAmB,WAAW,MAAM,WAAY;AAC9C,MAAIA,OAAM,KAAK,iBAAiB;AAC9B,MAAI,QAAQA,KAAI;AAClB,UAAQ,QAAQ,eAAe,KAAK,KAAK,QAAQ;AACnD;AAEA,mBAAmB,iBAAiB,MAAM,WAAY;AAAE,UAAQ,KAAK,iBAAiB,EAAE,QAAQ,sBAAsB;AAAE;AAExH,mBAAmB,oBAAoB,MAAM,WAAY;AAAE,SAAO,KAAK,2BAA2B,KAAK,aAAa,CAAC;AAAE;AAEvH,mBAAmB,kBAAkB,MAAM,WAAY;AACrD,WAAS,IAAI,KAAK,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;AACpD,QAAIA,OAAM,KAAK,WAAW,CAAC;AACzB,QAAI,QAAQA,KAAI;AAClB,QAAI,SAAS,2BAA2B,2BAClC,QAAQ,kBAAmB,EAAE,QAAQ,cAAe;AAAE,aAAO;AAAA,IAAK;AAAA,EAC1E;AACA,SAAO;AACT;AAEA,mBAAmB,mBAAmB,MAAM,WAAY;AACtD,UAAQ,KAAK,gBAAgB,EAAE,QAAQ,4BAA4B;AACrE;AAEA,OAAO,SAAS,SAAS,SAAU;AAC/B,MAAI,UAAU,CAAC,GAAG,MAAM,UAAU;AAClC,SAAQ,MAAQ,SAAS,GAAI,IAAI,UAAW,GAAI;AAElD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AAAE,UAAM,QAAQ,CAAC,EAAE,GAAG;AAAA,EAAG;AAClE,SAAO;AACT;AAEA,OAAO,QAAQ,SAASC,OAAO,OAAO,SAAS;AAC7C,SAAO,IAAI,KAAK,SAAS,KAAK,EAAE,MAAM;AACxC;AAEA,OAAO,oBAAoB,SAAS,kBAAmB,OAAO,KAAK,SAAS;AAC1E,MAAIC,UAAS,IAAI,KAAK,SAAS,OAAO,GAAG;AACzC,EAAAA,QAAO,UAAU;AACjB,SAAOA,QAAO,gBAAgB;AAChC;AAEA,OAAO,YAAY,SAAS,UAAW,OAAO,SAAS;AACrD,SAAO,IAAI,KAAK,SAAS,KAAK;AAChC;AAEA,OAAO,iBAAkB,OAAO,WAAW,kBAAmB;AAE9D,IAAI,OAAO,OAAO;AAIlB,IAAI,UAAU;AACd,KAAK,kBAAkB,SAAS,OAAO;AACrC,MAAI,KAAK,QAAQ,cAAc,GAAG;AAAE,WAAO;AAAA,EAAM;AACjD,aAAS;AAEP,mBAAe,YAAY;AAC3B,aAAS,eAAe,KAAK,KAAK,KAAK,EAAE,CAAC,EAAE;AAC5C,QAAI,QAAQ,QAAQ,KAAK,KAAK,MAAM,MAAM,KAAK,CAAC;AAChD,QAAI,CAAC,OAAO;AAAE,aAAO;AAAA,IAAM;AAC3B,SAAK,MAAM,CAAC,KAAK,MAAM,CAAC,OAAO,cAAc;AAC3C,qBAAe,YAAY,QAAQ,MAAM,CAAC,EAAE;AAC5C,UAAI,aAAa,eAAe,KAAK,KAAK,KAAK,GAAG,MAAM,WAAW,QAAQ,WAAW,CAAC,EAAE;AACzF,UAAI,OAAO,KAAK,MAAM,OAAO,GAAG;AAChC,aAAO,SAAS,OAAO,SAAS,OAC7B,UAAU,KAAK,WAAW,CAAC,CAAC,KAC5B,EAAE,sBAAsB,KAAK,IAAI,KAAK,SAAS,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC,MAAM;AAAA,IAC1F;AACA,aAAS,MAAM,CAAC,EAAE;AAGlB,mBAAe,YAAY;AAC3B,aAAS,eAAe,KAAK,KAAK,KAAK,EAAE,CAAC,EAAE;AAC5C,QAAI,KAAK,MAAM,KAAK,MAAM,KACxB;AAAE;AAAA,IAAS;AAAA,EACf;AACF;AAKA,KAAK,MAAM,SAAS,MAAM;AACxB,MAAI,KAAK,SAAS,MAAM;AACtB,SAAK,KAAK;AACV,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAIA,KAAK,eAAe,SAAS,MAAM;AACjC,SAAO,KAAK,SAAS,QAAQ,QAAQ,KAAK,UAAU,QAAQ,CAAC,KAAK;AACpE;AAIA,KAAK,gBAAgB,SAAS,MAAM;AAClC,MAAI,CAAC,KAAK,aAAa,IAAI,GAAG;AAAE,WAAO;AAAA,EAAM;AAC7C,OAAK,KAAK;AACV,SAAO;AACT;AAIA,KAAK,mBAAmB,SAAS,MAAM;AACrC,MAAI,CAAC,KAAK,cAAc,IAAI,GAAG;AAAE,SAAK,WAAW;AAAA,EAAG;AACtD;AAIA,KAAK,qBAAqB,WAAW;AACnC,SAAO,KAAK,SAAS,QAAQ,OAC3B,KAAK,SAAS,QAAQ,UACtB,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC;AAChE;AAEA,KAAK,kBAAkB,WAAW;AAChC,MAAI,KAAK,mBAAmB,GAAG;AAC7B,QAAI,KAAK,QAAQ,qBACf;AAAE,WAAK,QAAQ,oBAAoB,KAAK,YAAY,KAAK,aAAa;AAAA,IAAG;AAC3E,WAAO;AAAA,EACT;AACF;AAKA,KAAK,YAAY,WAAW;AAC1B,MAAI,CAAC,KAAK,IAAI,QAAQ,IAAI,KAAK,CAAC,KAAK,gBAAgB,GAAG;AAAE,SAAK,WAAW;AAAA,EAAG;AAC/E;AAEA,KAAK,qBAAqB,SAAS,SAAS,SAAS;AACnD,MAAI,KAAK,SAAS,SAAS;AACzB,QAAI,KAAK,QAAQ,iBACf;AAAE,WAAK,QAAQ,gBAAgB,KAAK,cAAc,KAAK,eAAe;AAAA,IAAG;AAC3E,QAAI,CAAC,SACH;AAAE,WAAK,KAAK;AAAA,IAAG;AACjB,WAAO;AAAA,EACT;AACF;AAKA,KAAK,SAAS,SAAS,MAAM;AAC3B,OAAK,IAAI,IAAI,KAAK,KAAK,WAAW;AACpC;AAIA,KAAK,aAAa,SAAS,KAAK;AAC9B,OAAK,MAAM,OAAO,OAAO,MAAM,KAAK,OAAO,kBAAkB;AAC/D;AAEA,IAAI,sBAAsB,SAASC,uBAAsB;AACvD,OAAK,kBACL,KAAK,gBACL,KAAK,sBACL,KAAK,oBACL,KAAK,cACH;AACJ;AAEA,KAAK,qBAAqB,SAAS,wBAAwB,UAAU;AACnE,MAAI,CAAC,wBAAwB;AAAE;AAAA,EAAO;AACtC,MAAI,uBAAuB,gBAAgB,IACzC;AAAE,SAAK,iBAAiB,uBAAuB,eAAe,+CAA+C;AAAA,EAAG;AAClH,MAAI,SAAS,WAAW,uBAAuB,sBAAsB,uBAAuB;AAC5F,MAAI,SAAS,IAAI;AAAE,SAAK,iBAAiB,QAAQ,WAAW,wBAAwB,uBAAuB;AAAA,EAAG;AAChH;AAEA,KAAK,wBAAwB,SAAS,wBAAwB,UAAU;AACtE,MAAI,CAAC,wBAAwB;AAAE,WAAO;AAAA,EAAM;AAC5C,MAAI,kBAAkB,uBAAuB;AAC7C,MAAI,cAAc,uBAAuB;AACzC,MAAI,CAAC,UAAU;AAAE,WAAO,mBAAmB,KAAK,eAAe;AAAA,EAAE;AACjE,MAAI,mBAAmB,GACrB;AAAE,SAAK,MAAM,iBAAiB,yEAAyE;AAAA,EAAG;AAC5G,MAAI,eAAe,GACjB;AAAE,SAAK,iBAAiB,aAAa,oCAAoC;AAAA,EAAG;AAChF;AAEA,KAAK,iCAAiC,WAAW;AAC/C,MAAI,KAAK,aAAa,CAAC,KAAK,YAAY,KAAK,WAAW,KAAK,WAC3D;AAAE,SAAK,MAAM,KAAK,UAAU,4CAA4C;AAAA,EAAG;AAC7E,MAAI,KAAK,UACP;AAAE,SAAK,MAAM,KAAK,UAAU,4CAA4C;AAAA,EAAG;AAC/E;AAEA,KAAK,uBAAuB,SAAS,MAAM;AACzC,MAAI,KAAK,SAAS,2BAChB;AAAE,WAAO,KAAK,qBAAqB,KAAK,UAAU;AAAA,EAAE;AACtD,SAAO,KAAK,SAAS,gBAAgB,KAAK,SAAS;AACrD;AAEA,IAAI,OAAO,OAAO;AASlB,KAAK,gBAAgB,SAAS,MAAM;AAClC,MAAI,UAAU,uBAAO,OAAO,IAAI;AAChC,MAAI,CAAC,KAAK,MAAM;AAAE,SAAK,OAAO,CAAC;AAAA,EAAG;AAClC,SAAO,KAAK,SAAS,QAAQ,KAAK;AAChC,QAAI,OAAO,KAAK,eAAe,MAAM,MAAM,OAAO;AAClD,SAAK,KAAK,KAAK,IAAI;AAAA,EACrB;AACA,MAAI,KAAK,UACP;AAAE,aAAS,IAAI,GAAG,OAAO,OAAO,KAAK,KAAK,gBAAgB,GAAG,IAAI,KAAK,QAAQ,KAAK,GACjF;AACE,UAAI,OAAO,KAAK,CAAC;AAEjB,WAAK,iBAAiB,KAAK,iBAAiB,IAAI,EAAE,OAAQ,aAAa,OAAO,kBAAmB;AAAA,IACnG;AAAA,EAAE;AACN,OAAK,uBAAuB,KAAK,IAAI;AACrC,OAAK,KAAK;AACV,OAAK,aAAa,KAAK,QAAQ;AAC/B,SAAO,KAAK,WAAW,MAAM,SAAS;AACxC;AAEA,IAAI,YAAY,EAAC,MAAM,OAAM;AAA7B,IAAgC,cAAc,EAAC,MAAM,SAAQ;AAE7D,KAAK,QAAQ,SAAS,SAAS;AAC7B,MAAI,KAAK,QAAQ,cAAc,KAAK,CAAC,KAAK,aAAa,KAAK,GAAG;AAAE,WAAO;AAAA,EAAM;AAC9E,iBAAe,YAAY,KAAK;AAChC,MAAI,OAAO,eAAe,KAAK,KAAK,KAAK;AACzC,MAAI,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,QAAQ,SAAS,KAAK,MAAM,WAAW,IAAI;AAKzE,MAAI,WAAW,MAAM,WAAW,IAAI;AAAE,WAAO;AAAA,EAAK;AAClD,MAAI,SAAS;AAAE,WAAO;AAAA,EAAM;AAE5B,MAAI,WAAW,OAAO,SAAS,SAAU,SAAS,OAAQ;AAAE,WAAO;AAAA,EAAK;AACxE,MAAI,kBAAkB,QAAQ,IAAI,GAAG;AACnC,QAAI,MAAM,OAAO;AACjB,WAAO,iBAAiB,SAAS,KAAK,MAAM,WAAW,GAAG,GAAG,IAAI,GAAG;AAAE,QAAE;AAAA,IAAK;AAC7E,QAAI,WAAW,MAAM,SAAS,SAAU,SAAS,OAAQ;AAAE,aAAO;AAAA,IAAK;AACvE,QAAI,QAAQ,KAAK,MAAM,MAAM,MAAM,GAAG;AACtC,QAAI,CAAC,0BAA0B,KAAK,KAAK,GAAG;AAAE,aAAO;AAAA,IAAK;AAAA,EAC5D;AACA,SAAO;AACT;AAKA,KAAK,kBAAkB,WAAW;AAChC,MAAI,KAAK,QAAQ,cAAc,KAAK,CAAC,KAAK,aAAa,OAAO,GAC5D;AAAE,WAAO;AAAA,EAAM;AAEjB,iBAAe,YAAY,KAAK;AAChC,MAAI,OAAO,eAAe,KAAK,KAAK,KAAK;AACzC,MAAI,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,QAAQ;AACtC,SAAO,CAAC,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,IAAI,CAAC,KACrD,KAAK,MAAM,MAAM,MAAM,OAAO,CAAC,MAAM,eACpC,OAAO,MAAM,KAAK,MAAM,UACxB,EAAE,iBAAiB,QAAQ,KAAK,MAAM,WAAW,OAAO,CAAC,CAAC,KAAK,QAAQ,SAAU,QAAQ;AAC9F;AAEA,KAAK,iBAAiB,SAAS,cAAc,OAAO;AAClD,MAAI,KAAK,QAAQ,cAAc,MAAM,CAAC,KAAK,aAAa,eAAe,UAAU,OAAO,GACtF;AAAE,WAAO;AAAA,EAAM;AAEjB,iBAAe,YAAY,KAAK;AAChC,MAAI,OAAO,eAAe,KAAK,KAAK,KAAK;AACzC,MAAI,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE;AAE9B,MAAI,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,IAAI,CAAC,GAAG;AAAE,WAAO;AAAA,EAAM;AAErE,MAAI,cAAc;AAChB,QAAI,cAAc,OAAO,GAAe;AACxC,QAAI,KAAK,MAAM,MAAM,MAAM,WAAW,MAAM,WAC1C,gBAAgB,KAAK,MAAM,UAC3B,iBAAiB,QAAQ,KAAK,MAAM,WAAW,WAAW,CAAC,KAC1D,QAAQ,SAAU,QAAQ,OAC3B;AAAE,aAAO;AAAA,IAAM;AAEjB,mBAAe,YAAY;AAC3B,QAAI,iBAAiB,eAAe,KAAK,KAAK,KAAK;AACnD,QAAI,kBAAkB,UAAU,KAAK,KAAK,MAAM,MAAM,aAAa,cAAc,eAAe,CAAC,EAAE,MAAM,CAAC,GAAG;AAAE,aAAO;AAAA,IAAM;AAAA,EAC9H;AAEA,MAAI,OAAO;AACT,QAAI,WAAW,OAAO,GAAY;AAClC,QAAI,KAAK,MAAM,MAAM,MAAM,QAAQ,MAAM,MAAM;AAC7C,UAAI,aAAa,KAAK,MAAM,UACzB,CAAC,iBAAiB,UAAU,KAAK,MAAM,WAAW,QAAQ,CAAC,KAAK,EAAE,UAAU,SAAU,UAAU,QAAU;AAAE,eAAO;AAAA,MAAM;AAAA,IAC9H;AAAA,EACF;AAEA,MAAI,KAAK,KAAK,MAAM,WAAW,IAAI;AACnC,SAAO,kBAAkB,IAAI,IAAI,KAAK,OAAO;AAC/C;AAEA,KAAK,eAAe,SAAS,OAAO;AAClC,SAAO,KAAK,eAAe,MAAM,KAAK;AACxC;AAEA,KAAK,UAAU,SAAS,OAAO;AAC7B,SAAO,KAAK,eAAe,OAAO,KAAK;AACzC;AASA,KAAK,iBAAiB,SAAS,SAAS,UAAU,SAAS;AACzD,MAAI,YAAY,KAAK,MAAM,OAAO,KAAK,UAAU,GAAG;AAEpD,MAAI,KAAK,MAAM,OAAO,GAAG;AACvB,gBAAY,QAAQ;AACpB,WAAO;AAAA,EACT;AAMA,UAAQ,WAAW;AAAA,IACnB,KAAK,QAAQ;AAAA,IAAQ,KAAK,QAAQ;AAAW,aAAO,KAAK,4BAA4B,MAAM,UAAU,OAAO;AAAA,IAC5G,KAAK,QAAQ;AAAW,aAAO,KAAK,uBAAuB,IAAI;AAAA,IAC/D,KAAK,QAAQ;AAAK,aAAO,KAAK,iBAAiB,IAAI;AAAA,IACnD,KAAK,QAAQ;AAAM,aAAO,KAAK,kBAAkB,IAAI;AAAA,IACrD,KAAK,QAAQ;AAIX,UAAK,YAAY,KAAK,UAAU,YAAY,QAAQ,YAAY,YAAa,KAAK,QAAQ,eAAe,GAAG;AAAE,aAAK,WAAW;AAAA,MAAG;AACjI,aAAO,KAAK,uBAAuB,MAAM,OAAO,CAAC,OAAO;AAAA,IAC1D,KAAK,QAAQ;AACX,UAAI,SAAS;AAAE,aAAK,WAAW;AAAA,MAAG;AAClC,aAAO,KAAK,WAAW,MAAM,IAAI;AAAA,IACnC,KAAK,QAAQ;AAAK,aAAO,KAAK,iBAAiB,IAAI;AAAA,IACnD,KAAK,QAAQ;AAAS,aAAO,KAAK,qBAAqB,IAAI;AAAA,IAC3D,KAAK,QAAQ;AAAS,aAAO,KAAK,qBAAqB,IAAI;AAAA,IAC3D,KAAK,QAAQ;AAAQ,aAAO,KAAK,oBAAoB,IAAI;AAAA,IACzD,KAAK,QAAQ;AAAM,aAAO,KAAK,kBAAkB,IAAI;AAAA,IACrD,KAAK,QAAQ;AAAA,IAAQ,KAAK,QAAQ;AAChC,aAAO,QAAQ,KAAK;AACpB,UAAI,WAAW,SAAS,OAAO;AAAE,aAAK,WAAW;AAAA,MAAG;AACpD,aAAO,KAAK,kBAAkB,MAAM,IAAI;AAAA,IAC1C,KAAK,QAAQ;AAAQ,aAAO,KAAK,oBAAoB,IAAI;AAAA,IACzD,KAAK,QAAQ;AAAO,aAAO,KAAK,mBAAmB,IAAI;AAAA,IACvD,KAAK,QAAQ;AAAQ,aAAO,KAAK,WAAW,MAAM,IAAI;AAAA,IACtD,KAAK,QAAQ;AAAM,aAAO,KAAK,oBAAoB,IAAI;AAAA,IACvD,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,UAAI,KAAK,QAAQ,cAAc,MAAM,cAAc,QAAQ,SAAS;AAClE,uBAAe,YAAY,KAAK;AAChC,YAAI,OAAO,eAAe,KAAK,KAAK,KAAK;AACzC,YAAI,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,QAAQ,SAAS,KAAK,MAAM,WAAW,IAAI;AACzE,YAAI,WAAW,MAAM,WAAW,IAC9B;AAAE,iBAAO,KAAK,yBAAyB,MAAM,KAAK,gBAAgB,CAAC;AAAA,QAAE;AAAA,MACzE;AAEA,UAAI,CAAC,KAAK,QAAQ,6BAA6B;AAC7C,YAAI,CAAC,UACH;AAAE,eAAK,MAAM,KAAK,OAAO,wDAAwD;AAAA,QAAG;AACtF,YAAI,CAAC,KAAK,UACR;AAAE,eAAK,MAAM,KAAK,OAAO,iEAAiE;AAAA,QAAG;AAAA,MACjG;AACA,aAAO,cAAc,QAAQ,UAAU,KAAK,YAAY,IAAI,IAAI,KAAK,YAAY,MAAM,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOhG;AACE,UAAI,KAAK,gBAAgB,GAAG;AAC1B,YAAI,SAAS;AAAE,eAAK,WAAW;AAAA,QAAG;AAClC,aAAK,KAAK;AACV,eAAO,KAAK,uBAAuB,MAAM,MAAM,CAAC,OAAO;AAAA,MACzD;AAEA,UAAI,YAAY,KAAK,aAAa,KAAK,IAAI,gBAAgB,KAAK,QAAQ,KAAK,IAAI,UAAU;AAC3F,UAAI,WAAW;AACb,YAAI,YAAY,KAAK,QAAQ,eAAe,UAAU;AACpD,eAAK,MAAM,KAAK,OAAO,+EAA+E;AAAA,QACxG;AACA,YAAI,cAAc,eAAe;AAC/B,cAAI,CAAC,KAAK,UAAU;AAClB,iBAAK,MAAM,KAAK,OAAO,qDAAqD;AAAA,UAC9E;AACA,eAAK,KAAK;AAAA,QACZ;AACA,aAAK,KAAK;AACV,aAAK,SAAS,MAAM,OAAO,SAAS;AACpC,aAAK,UAAU;AACf,eAAO,KAAK,WAAW,MAAM,qBAAqB;AAAA,MACpD;AAEA,UAAI,YAAY,KAAK,OAAO,OAAO,KAAK,gBAAgB;AACxD,UAAI,cAAc,QAAQ,QAAQ,KAAK,SAAS,gBAAgB,KAAK,IAAI,QAAQ,KAAK,GACpF;AAAE,eAAO,KAAK,sBAAsB,MAAM,WAAW,MAAM,OAAO;AAAA,MAAE,OACjE;AAAE,eAAO,KAAK,yBAAyB,MAAM,IAAI;AAAA,MAAE;AAAA,EAC1D;AACF;AAEA,KAAK,8BAA8B,SAAS,MAAM,SAAS;AACzD,MAAI,UAAU,YAAY;AAC1B,OAAK,KAAK;AACV,MAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,KAAK,gBAAgB,GAAG;AAAE,SAAK,QAAQ;AAAA,EAAM,WAClE,KAAK,SAAS,QAAQ,MAAM;AAAE,SAAK,WAAW;AAAA,EAAG,OACrD;AACH,SAAK,QAAQ,KAAK,WAAW;AAC7B,SAAK,UAAU;AAAA,EACjB;AAIA,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,OAAO,QAAQ,EAAE,GAAG;AAClC,QAAI,MAAM,KAAK,OAAO,CAAC;AACvB,QAAI,KAAK,SAAS,QAAQ,IAAI,SAAS,KAAK,MAAM,MAAM;AACtD,UAAI,IAAI,QAAQ,SAAS,WAAW,IAAI,SAAS,SAAS;AAAE;AAAA,MAAM;AAClE,UAAI,KAAK,SAAS,SAAS;AAAE;AAAA,MAAM;AAAA,IACrC;AAAA,EACF;AACA,MAAI,MAAM,KAAK,OAAO,QAAQ;AAAE,SAAK,MAAM,KAAK,OAAO,iBAAiB,OAAO;AAAA,EAAG;AAClF,SAAO,KAAK,WAAW,MAAM,UAAU,mBAAmB,mBAAmB;AAC/E;AAEA,KAAK,yBAAyB,SAAS,MAAM;AAC3C,OAAK,KAAK;AACV,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,mBAAmB;AAClD;AAEA,KAAK,mBAAmB,SAAS,MAAM;AACrC,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,SAAS;AAC1B,OAAK,OAAO,KAAK,eAAe,IAAI;AACpC,OAAK,OAAO,IAAI;AAChB,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,OAAO,KAAK,qBAAqB;AACtC,MAAI,KAAK,QAAQ,eAAe,GAC9B;AAAE,SAAK,IAAI,QAAQ,IAAI;AAAA,EAAG,OAE1B;AAAE,SAAK,UAAU;AAAA,EAAG;AACtB,SAAO,KAAK,WAAW,MAAM,kBAAkB;AACjD;AAUA,KAAK,oBAAoB,SAAS,MAAM;AACtC,OAAK,KAAK;AACV,MAAI,UAAW,KAAK,QAAQ,eAAe,KAAK,KAAK,YAAY,KAAK,cAAc,OAAO,IAAK,KAAK,eAAe;AACpH,OAAK,OAAO,KAAK,SAAS;AAC1B,OAAK,WAAW,CAAC;AACjB,OAAK,OAAO,QAAQ,MAAM;AAC1B,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,QAAI,UAAU,IAAI;AAAE,WAAK,WAAW,OAAO;AAAA,IAAG;AAC9C,WAAO,KAAK,SAAS,MAAM,IAAI;AAAA,EACjC;AACA,MAAI,QAAQ,KAAK,MAAM;AACvB,MAAI,KAAK,SAAS,QAAQ,QAAQ,KAAK,SAAS,QAAQ,UAAU,OAAO;AACvE,QAAI,SAAS,KAAK,UAAU,GAAG,OAAO,QAAQ,QAAQ,KAAK;AAC3D,SAAK,KAAK;AACV,SAAK,SAAS,QAAQ,MAAM,IAAI;AAChC,SAAK,WAAW,QAAQ,qBAAqB;AAC7C,WAAO,KAAK,kBAAkB,MAAM,QAAQ,OAAO;AAAA,EACrD;AACA,MAAI,gBAAgB,KAAK,aAAa,KAAK,GAAG,UAAU;AAExD,MAAI,YAAY,KAAK,QAAQ,IAAI,IAAI,UAAU,KAAK,aAAa,IAAI,IAAI,gBAAgB;AACzF,MAAI,WAAW;AACb,QAAI,SAAS,KAAK,UAAU;AAC5B,SAAK,KAAK;AACV,QAAI,cAAc,eAAe;AAAE,WAAK,KAAK;AAAA,IAAG;AAChD,SAAK,SAAS,QAAQ,MAAM,SAAS;AACrC,SAAK,WAAW,QAAQ,qBAAqB;AAC7C,WAAO,KAAK,kBAAkB,MAAM,QAAQ,OAAO;AAAA,EACrD;AACA,MAAI,cAAc,KAAK;AACvB,MAAI,yBAAyB,IAAI;AACjC,MAAI,UAAU,KAAK;AACnB,MAAI,OAAO,UAAU,KACjB,KAAK,oBAAoB,wBAAwB,OAAO,IACxD,KAAK,gBAAgB,MAAM,sBAAsB;AACrD,MAAI,KAAK,SAAS,QAAQ,QAAQ,UAAU,KAAK,QAAQ,eAAe,KAAK,KAAK,aAAa,IAAI,IAAI;AACrG,QAAI,UAAU,IAAI;AAChB,UAAI,KAAK,SAAS,QAAQ,KAAK;AAAE,aAAK,WAAW,OAAO;AAAA,MAAG;AAC3D,WAAK,QAAQ;AAAA,IACf,WAAW,WAAW,KAAK,QAAQ,eAAe,GAAG;AACnD,UAAI,KAAK,UAAU,WAAW,CAAC,eAAe,KAAK,SAAS,gBAAgB,KAAK,SAAS,SAAS;AAAE,aAAK,WAAW;AAAA,MAAG,WAC/G,KAAK,QAAQ,eAAe,GAAG;AAAE,aAAK,QAAQ;AAAA,MAAO;AAAA,IAChE;AACA,QAAI,iBAAiB,SAAS;AAAE,WAAK,MAAM,KAAK,OAAO,+DAA+D;AAAA,IAAG;AACzH,SAAK,aAAa,MAAM,OAAO,sBAAsB;AACrD,SAAK,iBAAiB,IAAI;AAC1B,WAAO,KAAK,WAAW,MAAM,IAAI;AAAA,EACnC,OAAO;AACL,SAAK,sBAAsB,wBAAwB,IAAI;AAAA,EACzD;AACA,MAAI,UAAU,IAAI;AAAE,SAAK,WAAW,OAAO;AAAA,EAAG;AAC9C,SAAO,KAAK,SAAS,MAAM,IAAI;AACjC;AAGA,KAAK,oBAAoB,SAAS,MAAM,MAAM,SAAS;AACrD,OAAK,KAAK,SAAS,QAAQ,OAAQ,KAAK,QAAQ,eAAe,KAAK,KAAK,aAAa,IAAI,MAAO,KAAK,aAAa,WAAW,GAAG;AAC/H,QAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,UAAI,KAAK,SAAS,QAAQ,KAAK;AAC7B,YAAI,UAAU,IAAI;AAAE,eAAK,WAAW,OAAO;AAAA,QAAG;AAAA,MAChD,OAAO;AAAE,aAAK,QAAQ,UAAU;AAAA,MAAI;AAAA,IACtC;AACA,WAAO,KAAK,WAAW,MAAM,IAAI;AAAA,EACnC;AACA,MAAI,UAAU,IAAI;AAAE,SAAK,WAAW,OAAO;AAAA,EAAG;AAC9C,SAAO,KAAK,SAAS,MAAM,IAAI;AACjC;AAEA,KAAK,yBAAyB,SAAS,MAAM,SAAS,qBAAqB;AACzE,OAAK,KAAK;AACV,SAAO,KAAK,cAAc,MAAM,kBAAkB,sBAAsB,IAAI,yBAAyB,OAAO,OAAO;AACrH;AAEA,KAAK,mBAAmB,SAAS,MAAM;AACrC,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,qBAAqB;AAEtC,OAAK,aAAa,KAAK,eAAe,IAAI;AAC1C,OAAK,YAAY,KAAK,IAAI,QAAQ,KAAK,IAAI,KAAK,eAAe,IAAI,IAAI;AACvE,SAAO,KAAK,WAAW,MAAM,aAAa;AAC5C;AAEA,KAAK,uBAAuB,SAAS,MAAM;AACzC,MAAI,CAAC,KAAK,cAAc,CAAC,KAAK,QAAQ,4BACpC;AAAE,SAAK,MAAM,KAAK,OAAO,8BAA8B;AAAA,EAAG;AAC5D,OAAK,KAAK;AAMV,MAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,KAAK,gBAAgB,GAAG;AAAE,SAAK,WAAW;AAAA,EAAM,OACzE;AAAE,SAAK,WAAW,KAAK,gBAAgB;AAAG,SAAK,UAAU;AAAA,EAAG;AACjE,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,uBAAuB,SAAS,MAAM;AACzC,OAAK,KAAK;AACV,OAAK,eAAe,KAAK,qBAAqB;AAC9C,OAAK,QAAQ,CAAC;AACd,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,OAAO,KAAK,WAAW;AAC5B,OAAK,WAAW,CAAC;AAMjB,MAAI;AACJ,WAAS,aAAa,OAAO,KAAK,SAAS,QAAQ,UAAS;AAC1D,QAAI,KAAK,SAAS,QAAQ,SAAS,KAAK,SAAS,QAAQ,UAAU;AACjE,UAAI,SAAS,KAAK,SAAS,QAAQ;AACnC,UAAI,KAAK;AAAE,aAAK,WAAW,KAAK,YAAY;AAAA,MAAG;AAC/C,WAAK,MAAM,KAAK,MAAM,KAAK,UAAU,CAAC;AACtC,UAAI,aAAa,CAAC;AAClB,WAAK,KAAK;AACV,UAAI,QAAQ;AACV,YAAI,OAAO,KAAK,gBAAgB;AAAA,MAClC,OAAO;AACL,YAAI,YAAY;AAAE,eAAK,iBAAiB,KAAK,cAAc,0BAA0B;AAAA,QAAG;AACxF,qBAAa;AACb,YAAI,OAAO;AAAA,MACb;AACA,WAAK,OAAO,QAAQ,KAAK;AAAA,IAC3B,OAAO;AACL,UAAI,CAAC,KAAK;AAAE,aAAK,WAAW;AAAA,MAAG;AAC/B,UAAI,WAAW,KAAK,KAAK,eAAe,IAAI,CAAC;AAAA,IAC/C;AAAA,EACF;AACA,OAAK,UAAU;AACf,MAAI,KAAK;AAAE,SAAK,WAAW,KAAK,YAAY;AAAA,EAAG;AAC/C,OAAK,KAAK;AACV,OAAK,OAAO,IAAI;AAChB,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,sBAAsB,SAAS,MAAM;AACxC,OAAK,KAAK;AACV,MAAI,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC,GAC9D;AAAE,SAAK,MAAM,KAAK,YAAY,6BAA6B;AAAA,EAAG;AAChE,OAAK,WAAW,KAAK,gBAAgB;AACrC,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,gBAAgB;AAC/C;AAIA,IAAI,UAAU,CAAC;AAEf,KAAK,wBAAwB,WAAW;AACtC,MAAI,QAAQ,KAAK,iBAAiB;AAClC,MAAI,SAAS,MAAM,SAAS;AAC5B,OAAK,WAAW,SAAS,qBAAqB,CAAC;AAC/C,OAAK,iBAAiB,OAAO,SAAS,oBAAoB,YAAY;AACtE,OAAK,OAAO,QAAQ,MAAM;AAE1B,SAAO;AACT;AAEA,KAAK,oBAAoB,SAAS,MAAM;AACtC,OAAK,KAAK;AACV,OAAK,QAAQ,KAAK,WAAW;AAC7B,OAAK,UAAU;AACf,MAAI,KAAK,SAAS,QAAQ,QAAQ;AAChC,QAAI,SAAS,KAAK,UAAU;AAC5B,SAAK,KAAK;AACV,QAAI,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC5B,aAAO,QAAQ,KAAK,sBAAsB;AAAA,IAC5C,OAAO;AACL,UAAI,KAAK,QAAQ,cAAc,IAAI;AAAE,aAAK,WAAW;AAAA,MAAG;AACxD,aAAO,QAAQ;AACf,WAAK,WAAW,CAAC;AAAA,IACnB;AACA,WAAO,OAAO,KAAK,WAAW,KAAK;AACnC,SAAK,UAAU;AACf,SAAK,UAAU,KAAK,WAAW,QAAQ,aAAa;AAAA,EACtD;AACA,OAAK,YAAY,KAAK,IAAI,QAAQ,QAAQ,IAAI,KAAK,WAAW,IAAI;AAClE,MAAI,CAAC,KAAK,WAAW,CAAC,KAAK,WACzB;AAAE,SAAK,MAAM,KAAK,OAAO,iCAAiC;AAAA,EAAG;AAC/D,SAAO,KAAK,WAAW,MAAM,cAAc;AAC7C;AAEA,KAAK,oBAAoB,SAAS,MAAM,MAAM,yBAAyB;AACrE,OAAK,KAAK;AACV,OAAK,SAAS,MAAM,OAAO,MAAM,uBAAuB;AACxD,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,qBAAqB;AACpD;AAEA,KAAK,sBAAsB,SAAS,MAAM;AACxC,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,qBAAqB;AACtC,OAAK,OAAO,KAAK,SAAS;AAC1B,OAAK,OAAO,KAAK,eAAe,OAAO;AACvC,OAAK,OAAO,IAAI;AAChB,SAAO,KAAK,WAAW,MAAM,gBAAgB;AAC/C;AAEA,KAAK,qBAAqB,SAAS,MAAM;AACvC,MAAI,KAAK,QAAQ;AAAE,SAAK,MAAM,KAAK,OAAO,uBAAuB;AAAA,EAAG;AACpE,OAAK,KAAK;AACV,OAAK,SAAS,KAAK,qBAAqB;AACxC,OAAK,OAAO,KAAK,eAAe,MAAM;AACtC,SAAO,KAAK,WAAW,MAAM,eAAe;AAC9C;AAEA,KAAK,sBAAsB,SAAS,MAAM;AACxC,OAAK,KAAK;AACV,SAAO,KAAK,WAAW,MAAM,gBAAgB;AAC/C;AAEA,KAAK,wBAAwB,SAAS,MAAM,WAAW,MAAM,SAAS;AACpE,WAAS,MAAM,GAAG,OAAO,KAAK,QAAQ,MAAM,KAAK,QAAQ,OAAO,GAC9D;AACA,QAAI,QAAQ,KAAK,GAAG;AAEpB,QAAI,MAAM,SAAS,WACjB;AAAE,WAAK,MAAM,KAAK,OAAO,YAAY,YAAY,uBAAuB;AAAA,IAC5E;AAAA,EAAE;AACF,MAAI,OAAO,KAAK,KAAK,SAAS,SAAS,KAAK,SAAS,QAAQ,UAAU,WAAW;AAClF,WAAS,IAAI,KAAK,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AAChD,QAAI,UAAU,KAAK,OAAO,CAAC;AAC3B,QAAI,QAAQ,mBAAmB,KAAK,OAAO;AAEzC,cAAQ,iBAAiB,KAAK;AAC9B,cAAQ,OAAO;AAAA,IACjB,OAAO;AAAE;AAAA,IAAM;AAAA,EACjB;AACA,OAAK,OAAO,KAAK,EAAC,MAAM,WAAW,MAAY,gBAAgB,KAAK,MAAK,CAAC;AAC1E,OAAK,OAAO,KAAK,eAAe,UAAU,QAAQ,QAAQ,OAAO,MAAM,KAAK,UAAU,UAAU,UAAU,OAAO;AACjH,OAAK,OAAO,IAAI;AAChB,OAAK,QAAQ;AACb,SAAO,KAAK,WAAW,MAAM,kBAAkB;AACjD;AAEA,KAAK,2BAA2B,SAAS,MAAM,MAAM;AACnD,OAAK,aAAa;AAClB,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,qBAAqB;AACpD;AAMA,KAAK,aAAa,SAAS,uBAAuB,MAAM,YAAY;AAClE,MAAK,0BAA0B,OAAS,yBAAwB;AAChE,MAAK,SAAS,OAAS,QAAO,KAAK,UAAU;AAE7C,OAAK,OAAO,CAAC;AACb,OAAK,OAAO,QAAQ,MAAM;AAC1B,MAAI,uBAAuB;AAAE,SAAK,WAAW,CAAC;AAAA,EAAG;AACjD,SAAO,KAAK,SAAS,QAAQ,QAAQ;AACnC,QAAI,OAAO,KAAK,eAAe,IAAI;AACnC,SAAK,KAAK,KAAK,IAAI;AAAA,EACrB;AACA,MAAI,YAAY;AAAE,SAAK,SAAS;AAAA,EAAO;AACvC,OAAK,KAAK;AACV,MAAI,uBAAuB;AAAE,SAAK,UAAU;AAAA,EAAG;AAC/C,SAAO,KAAK,WAAW,MAAM,gBAAgB;AAC/C;AAMA,KAAK,WAAW,SAAS,MAAM,MAAM;AACnC,OAAK,OAAO;AACZ,OAAK,OAAO,QAAQ,IAAI;AACxB,OAAK,OAAO,KAAK,SAAS,QAAQ,OAAO,OAAO,KAAK,gBAAgB;AACrE,OAAK,OAAO,QAAQ,IAAI;AACxB,OAAK,SAAS,KAAK,SAAS,QAAQ,SAAS,OAAO,KAAK,gBAAgB;AACzE,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,OAAO,KAAK,eAAe,KAAK;AACrC,OAAK,UAAU;AACf,OAAK,OAAO,IAAI;AAChB,SAAO,KAAK,WAAW,MAAM,cAAc;AAC7C;AAKA,KAAK,aAAa,SAAS,MAAM,MAAM;AACrC,MAAI,UAAU,KAAK,SAAS,QAAQ;AACpC,OAAK,KAAK;AAEV,MACE,KAAK,SAAS,yBACd,KAAK,aAAa,CAAC,EAAE,QAAQ,SAE3B,CAAC,WACD,KAAK,QAAQ,cAAc,KAC3B,KAAK,UACL,KAAK,SAAS,SACd,KAAK,aAAa,CAAC,EAAE,GAAG,SAAS,eAEnC;AACA,SAAK;AAAA,MACH,KAAK;AAAA,OACH,UAAU,WAAW,YAAY;AAAA,IACrC;AAAA,EACF;AACA,OAAK,OAAO;AACZ,OAAK,QAAQ,UAAU,KAAK,gBAAgB,IAAI,KAAK,iBAAiB;AACtE,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,OAAO,KAAK,eAAe,KAAK;AACrC,OAAK,UAAU;AACf,OAAK,OAAO,IAAI;AAChB,SAAO,KAAK,WAAW,MAAM,UAAU,mBAAmB,gBAAgB;AAC5E;AAIA,KAAK,WAAW,SAAS,MAAM,OAAO,MAAM,yBAAyB;AACnE,OAAK,eAAe,CAAC;AACrB,OAAK,OAAO;AACZ,aAAS;AACP,QAAI,OAAO,KAAK,UAAU;AAC1B,SAAK,WAAW,MAAM,IAAI;AAC1B,QAAI,KAAK,IAAI,QAAQ,EAAE,GAAG;AACxB,WAAK,OAAO,KAAK,iBAAiB,KAAK;AAAA,IACzC,WAAW,CAAC,2BAA2B,SAAS,WAAW,EAAE,KAAK,SAAS,QAAQ,OAAQ,KAAK,QAAQ,eAAe,KAAK,KAAK,aAAa,IAAI,IAAK;AACrJ,WAAK,WAAW;AAAA,IAClB,WAAW,CAAC,4BAA4B,SAAS,WAAW,SAAS,kBAAkB,KAAK,QAAQ,eAAe,MAAM,KAAK,SAAS,QAAQ,OAAO,CAAC,KAAK,aAAa,IAAI,GAAG;AAC9K,WAAK,MAAM,KAAK,YAAa,4BAA4B,OAAO,cAAe;AAAA,IACjF,WAAW,CAAC,2BAA2B,KAAK,GAAG,SAAS,gBAAgB,EAAE,UAAU,KAAK,SAAS,QAAQ,OAAO,KAAK,aAAa,IAAI,KAAK;AAC1I,WAAK,MAAM,KAAK,YAAY,0DAA0D;AAAA,IACxF,OAAO;AACL,WAAK,OAAO;AAAA,IACd;AACA,SAAK,aAAa,KAAK,KAAK,WAAW,MAAM,oBAAoB,CAAC;AAClE,QAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,GAAG;AAAE;AAAA,IAAM;AAAA,EACxC;AACA,SAAO;AACT;AAEA,KAAK,aAAa,SAAS,MAAM,MAAM;AACrC,OAAK,KAAK,SAAS,WAAW,SAAS,gBACnC,KAAK,WAAW,IAChB,KAAK,iBAAiB;AAE1B,OAAK,iBAAiB,KAAK,IAAI,SAAS,QAAQ,WAAW,cAAc,KAAK;AAChF;AAEA,IAAI,iBAAiB;AAArB,IAAwB,yBAAyB;AAAjD,IAAoD,mBAAmB;AAMvE,KAAK,gBAAgB,SAAS,MAAM,WAAW,qBAAqB,SAAS,SAAS;AACpF,OAAK,aAAa,IAAI;AACtB,MAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,QAAQ,eAAe,KAAK,CAAC,SAAS;AAC9E,QAAI,KAAK,SAAS,QAAQ,QAAS,YAAY,wBAC7C;AAAE,WAAK,WAAW;AAAA,IAAG;AACvB,SAAK,YAAY,KAAK,IAAI,QAAQ,IAAI;AAAA,EACxC;AACA,MAAI,KAAK,QAAQ,eAAe,GAC9B;AAAE,SAAK,QAAQ,CAAC,CAAC;AAAA,EAAS;AAE5B,MAAI,YAAY,gBAAgB;AAC9B,SAAK,KAAM,YAAY,oBAAqB,KAAK,SAAS,QAAQ,OAAO,OAAO,KAAK,WAAW;AAChG,QAAI,KAAK,MAAM,EAAE,YAAY,yBAK3B;AAAE,WAAK,gBAAgB,KAAK,IAAK,KAAK,UAAU,KAAK,aAAa,KAAK,QAAS,KAAK,sBAAsB,WAAW,eAAe,aAAa;AAAA,IAAG;AAAA,EACzJ;AAEA,MAAI,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU,mBAAmB,KAAK;AACtF,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,OAAK,WAAW,cAAc,KAAK,OAAO,KAAK,SAAS,CAAC;AAEzD,MAAI,EAAE,YAAY,iBAChB;AAAE,SAAK,KAAK,KAAK,SAAS,QAAQ,OAAO,KAAK,WAAW,IAAI;AAAA,EAAM;AAErE,OAAK,oBAAoB,IAAI;AAC7B,OAAK,kBAAkB,MAAM,qBAAqB,OAAO,OAAO;AAEhE,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,SAAO,KAAK,WAAW,MAAO,YAAY,iBAAkB,wBAAwB,oBAAoB;AAC1G;AAEA,KAAK,sBAAsB,SAAS,MAAM;AACxC,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,SAAS,KAAK,iBAAiB,QAAQ,QAAQ,OAAO,KAAK,QAAQ,eAAe,CAAC;AACxF,OAAK,+BAA+B;AACtC;AAKA,KAAK,aAAa,SAAS,MAAM,aAAa;AAC5C,OAAK,KAAK;AAIV,MAAI,YAAY,KAAK;AACrB,OAAK,SAAS;AAEd,OAAK,aAAa,MAAM,WAAW;AACnC,OAAK,gBAAgB,IAAI;AACzB,MAAI,iBAAiB,KAAK,eAAe;AACzC,MAAI,YAAY,KAAK,UAAU;AAC/B,MAAI,iBAAiB;AACrB,YAAU,OAAO,CAAC;AAClB,OAAK,OAAO,QAAQ,MAAM;AAC1B,SAAO,KAAK,SAAS,QAAQ,QAAQ;AACnC,QAAI,UAAU,KAAK,kBAAkB,KAAK,eAAe,IAAI;AAC7D,QAAI,SAAS;AACX,gBAAU,KAAK,KAAK,OAAO;AAC3B,UAAI,QAAQ,SAAS,sBAAsB,QAAQ,SAAS,eAAe;AACzE,YAAI,gBAAgB;AAAE,eAAK,iBAAiB,QAAQ,OAAO,yCAAyC;AAAA,QAAG;AACvG,yBAAiB;AAAA,MACnB,WAAW,QAAQ,OAAO,QAAQ,IAAI,SAAS,uBAAuB,wBAAwB,gBAAgB,OAAO,GAAG;AACtH,aAAK,iBAAiB,QAAQ,IAAI,OAAQ,kBAAmB,QAAQ,IAAI,OAAQ,6BAA8B;AAAA,MACjH;AAAA,IACF;AAAA,EACF;AACA,OAAK,SAAS;AACd,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,WAAW,WAAW,WAAW;AAClD,OAAK,cAAc;AACnB,SAAO,KAAK,WAAW,MAAM,cAAc,qBAAqB,iBAAiB;AACnF;AAEA,KAAK,oBAAoB,SAAS,wBAAwB;AACxD,MAAI,KAAK,IAAI,QAAQ,IAAI,GAAG;AAAE,WAAO;AAAA,EAAK;AAE1C,MAAI,cAAc,KAAK,QAAQ;AAC/B,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,UAAU;AACd,MAAI,cAAc;AAClB,MAAI,UAAU;AACd,MAAI,OAAO;AACX,MAAI,WAAW;AAEf,MAAI,KAAK,cAAc,QAAQ,GAAG;AAEhC,QAAI,eAAe,MAAM,KAAK,IAAI,QAAQ,MAAM,GAAG;AACjD,WAAK,sBAAsB,IAAI;AAC/B,aAAO;AAAA,IACT;AACA,QAAI,KAAK,wBAAwB,KAAK,KAAK,SAAS,QAAQ,MAAM;AAChE,iBAAW;AAAA,IACb,OAAO;AACL,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,OAAK,SAAS;AACd,MAAI,CAAC,WAAW,eAAe,KAAK,KAAK,cAAc,OAAO,GAAG;AAC/D,SAAK,KAAK,wBAAwB,KAAK,KAAK,SAAS,QAAQ,SAAS,CAAC,KAAK,mBAAmB,GAAG;AAChG,gBAAU;AAAA,IACZ,OAAO;AACL,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,MAAI,CAAC,YAAY,eAAe,KAAK,CAAC,YAAY,KAAK,IAAI,QAAQ,IAAI,GAAG;AACxE,kBAAc;AAAA,EAChB;AACA,MAAI,CAAC,WAAW,CAAC,WAAW,CAAC,aAAa;AACxC,QAAI,YAAY,KAAK;AACrB,QAAI,KAAK,cAAc,KAAK,KAAK,KAAK,cAAc,KAAK,GAAG;AAC1D,UAAI,KAAK,wBAAwB,GAAG;AAClC,eAAO;AAAA,MACT,OAAO;AACL,kBAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAGA,MAAI,SAAS;AAGX,SAAK,WAAW;AAChB,SAAK,MAAM,KAAK,YAAY,KAAK,cAAc,KAAK,eAAe;AACnE,SAAK,IAAI,OAAO;AAChB,SAAK,WAAW,KAAK,KAAK,YAAY;AAAA,EACxC,OAAO;AACL,SAAK,sBAAsB,IAAI;AAAA,EACjC;AAGA,MAAI,cAAc,MAAM,KAAK,SAAS,QAAQ,UAAU,SAAS,YAAY,eAAe,SAAS;AACnG,QAAI,gBAAgB,CAAC,KAAK,UAAU,aAAa,MAAM,aAAa;AACpE,QAAI,oBAAoB,iBAAiB;AAEzC,QAAI,iBAAiB,SAAS,UAAU;AAAE,WAAK,MAAM,KAAK,IAAI,OAAO,yCAAyC;AAAA,IAAG;AACjH,SAAK,OAAO,gBAAgB,gBAAgB;AAC5C,SAAK,iBAAiB,MAAM,aAAa,SAAS,iBAAiB;AAAA,EACrE,OAAO;AACL,SAAK,gBAAgB,IAAI;AAAA,EAC3B;AAEA,SAAO;AACT;AAEA,KAAK,0BAA0B,WAAW;AACxC,SACE,KAAK,SAAS,QAAQ,QACtB,KAAK,SAAS,QAAQ,aACtB,KAAK,SAAS,QAAQ,OACtB,KAAK,SAAS,QAAQ,UACtB,KAAK,SAAS,QAAQ,YACtB,KAAK,KAAK;AAEd;AAEA,KAAK,wBAAwB,SAAS,SAAS;AAC7C,MAAI,KAAK,SAAS,QAAQ,WAAW;AACnC,QAAI,KAAK,UAAU,eAAe;AAChC,WAAK,MAAM,KAAK,OAAO,oDAAoD;AAAA,IAC7E;AACA,YAAQ,WAAW;AACnB,YAAQ,MAAM,KAAK,kBAAkB;AAAA,EACvC,OAAO;AACL,SAAK,kBAAkB,OAAO;AAAA,EAChC;AACF;AAEA,KAAK,mBAAmB,SAAS,QAAQ,aAAa,SAAS,mBAAmB;AAEhF,MAAI,MAAM,OAAO;AACjB,MAAI,OAAO,SAAS,eAAe;AACjC,QAAI,aAAa;AAAE,WAAK,MAAM,IAAI,OAAO,kCAAkC;AAAA,IAAG;AAC9E,QAAI,SAAS;AAAE,WAAK,MAAM,IAAI,OAAO,sCAAsC;AAAA,IAAG;AAAA,EAChF,WAAW,OAAO,UAAU,aAAa,QAAQ,WAAW,GAAG;AAC7D,SAAK,MAAM,IAAI,OAAO,wDAAwD;AAAA,EAChF;AAGA,MAAI,QAAQ,OAAO,QAAQ,KAAK,YAAY,aAAa,SAAS,iBAAiB;AAGnF,MAAI,OAAO,SAAS,SAAS,MAAM,OAAO,WAAW,GACnD;AAAE,SAAK,iBAAiB,MAAM,OAAO,8BAA8B;AAAA,EAAG;AACxE,MAAI,OAAO,SAAS,SAAS,MAAM,OAAO,WAAW,GACnD;AAAE,SAAK,iBAAiB,MAAM,OAAO,sCAAsC;AAAA,EAAG;AAChF,MAAI,OAAO,SAAS,SAAS,MAAM,OAAO,CAAC,EAAE,SAAS,eACpD;AAAE,SAAK,iBAAiB,MAAM,OAAO,CAAC,EAAE,OAAO,+BAA+B;AAAA,EAAG;AAEnF,SAAO,KAAK,WAAW,QAAQ,kBAAkB;AACnD;AAEA,KAAK,kBAAkB,SAAS,OAAO;AACrC,MAAI,aAAa,OAAO,aAAa,GAAG;AACtC,SAAK,MAAM,MAAM,IAAI,OAAO,gDAAgD;AAAA,EAC9E,WAAW,MAAM,UAAU,aAAa,OAAO,WAAW,GAAG;AAC3D,SAAK,MAAM,MAAM,IAAI,OAAO,qDAAqD;AAAA,EACnF;AAEA,MAAI,KAAK,IAAI,QAAQ,EAAE,GAAG;AAExB,SAAK,WAAW,yBAAyB,WAAW;AACpD,UAAM,QAAQ,KAAK,iBAAiB;AACpC,SAAK,UAAU;AAAA,EACjB,OAAO;AACL,UAAM,QAAQ;AAAA,EAChB;AACA,OAAK,UAAU;AAEf,SAAO,KAAK,WAAW,OAAO,oBAAoB;AACpD;AAEA,KAAK,wBAAwB,SAAS,MAAM;AAC1C,OAAK,OAAO,CAAC;AAEb,MAAI,YAAY,KAAK;AACrB,OAAK,SAAS,CAAC;AACf,OAAK,WAAW,2BAA2B,WAAW;AACtD,SAAO,KAAK,SAAS,QAAQ,QAAQ;AACnC,QAAI,OAAO,KAAK,eAAe,IAAI;AACnC,SAAK,KAAK,KAAK,IAAI;AAAA,EACrB;AACA,OAAK,KAAK;AACV,OAAK,UAAU;AACf,OAAK,SAAS;AAEd,SAAO,KAAK,WAAW,MAAM,aAAa;AAC5C;AAEA,KAAK,eAAe,SAAS,MAAM,aAAa;AAC9C,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,SAAK,KAAK,KAAK,WAAW;AAC1B,QAAI,aACF;AAAE,WAAK,gBAAgB,KAAK,IAAI,cAAc,KAAK;AAAA,IAAG;AAAA,EAC1D,OAAO;AACL,QAAI,gBAAgB,MAClB;AAAE,WAAK,WAAW;AAAA,IAAG;AACvB,SAAK,KAAK;AAAA,EACZ;AACF;AAEA,KAAK,kBAAkB,SAAS,MAAM;AACpC,OAAK,aAAa,KAAK,IAAI,QAAQ,QAAQ,IAAI,KAAK,oBAAoB,MAAM,KAAK,IAAI;AACzF;AAEA,KAAK,iBAAiB,WAAW;AAC/B,MAAI,UAAU,EAAC,UAAU,uBAAO,OAAO,IAAI,GAAG,MAAM,CAAC,EAAC;AACtD,OAAK,iBAAiB,KAAK,OAAO;AAClC,SAAO,QAAQ;AACjB;AAEA,KAAK,gBAAgB,WAAW;AAC9B,MAAIH,OAAM,KAAK,iBAAiB,IAAI;AACpC,MAAI,WAAWA,KAAI;AACnB,MAAI,OAAOA,KAAI;AACf,MAAI,CAAC,KAAK,QAAQ,oBAAoB;AAAE;AAAA,EAAO;AAC/C,MAAI,MAAM,KAAK,iBAAiB;AAChC,MAAI,SAAS,QAAQ,IAAI,OAAO,KAAK,iBAAiB,MAAM,CAAC;AAC7D,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AACpC,QAAI,KAAK,KAAK,CAAC;AACf,QAAI,CAAC,OAAO,UAAU,GAAG,IAAI,GAAG;AAC9B,UAAI,QAAQ;AACV,eAAO,KAAK,KAAK,EAAE;AAAA,MACrB,OAAO;AACL,aAAK,iBAAiB,GAAG,OAAQ,qBAAsB,GAAG,OAAQ,0CAA2C;AAAA,MAC/G;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,wBAAwB,gBAAgB,SAAS;AACxD,MAAI,OAAO,QAAQ,IAAI;AACvB,MAAI,OAAO,eAAe,IAAI;AAE9B,MAAI,OAAO;AACX,MAAI,QAAQ,SAAS,uBAAuB,QAAQ,SAAS,SAAS,QAAQ,SAAS,QAAQ;AAC7F,YAAQ,QAAQ,SAAS,MAAM,OAAO,QAAQ;AAAA,EAChD;AAGA,MACE,SAAS,UAAU,SAAS,UAC5B,SAAS,UAAU,SAAS,UAC5B,SAAS,UAAU,SAAS,UAC5B,SAAS,UAAU,SAAS,QAC5B;AACA,mBAAe,IAAI,IAAI;AACvB,WAAO;AAAA,EACT,WAAW,CAAC,MAAM;AAChB,mBAAe,IAAI,IAAI;AACvB,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,SAAS,aAAa,MAAM,MAAM;AAChC,MAAI,WAAW,KAAK;AACpB,MAAI,MAAM,KAAK;AACf,SAAO,CAAC,aACN,IAAI,SAAS,gBAAgB,IAAI,SAAS,QAC1C,IAAI,SAAS,aAAa,IAAI,UAAU;AAE5C;AAIA,KAAK,4BAA4B,SAAS,MAAM,SAAS;AACvD,MAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,QAAI,KAAK,cAAc,IAAI,GAAG;AAC5B,WAAK,WAAW,KAAK,sBAAsB;AAC3C,WAAK,YAAY,SAAS,KAAK,UAAU,KAAK,YAAY;AAAA,IAC5D,OAAO;AACL,WAAK,WAAW;AAAA,IAClB;AAAA,EACF;AACA,OAAK,iBAAiB,MAAM;AAC5B,MAAI,KAAK,SAAS,QAAQ,QAAQ;AAAE,SAAK,WAAW;AAAA,EAAG;AACvD,OAAK,SAAS,KAAK,cAAc;AACjC,MAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,SAAK,aAAa,KAAK,gBAAgB;AAAA,EAAG;AAC9C,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,sBAAsB;AACrD;AAEA,KAAK,cAAc,SAAS,MAAM,SAAS;AACzC,OAAK,KAAK;AAEV,MAAI,KAAK,IAAI,QAAQ,IAAI,GAAG;AAC1B,WAAO,KAAK,0BAA0B,MAAM,OAAO;AAAA,EACrD;AACA,MAAI,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC9B,SAAK,YAAY,SAAS,WAAW,KAAK,YAAY;AACtD,SAAK,cAAc,KAAK,8BAA8B;AACtD,WAAO,KAAK,WAAW,MAAM,0BAA0B;AAAA,EACzD;AAEA,MAAI,KAAK,2BAA2B,GAAG;AACrC,SAAK,cAAc,KAAK,uBAAuB,IAAI;AACnD,QAAI,KAAK,YAAY,SAAS,uBAC5B;AAAE,WAAK,oBAAoB,SAAS,KAAK,YAAY,YAAY;AAAA,IAAG,OAEpE;AAAE,WAAK,YAAY,SAAS,KAAK,YAAY,IAAI,KAAK,YAAY,GAAG,KAAK;AAAA,IAAG;AAC/E,SAAK,aAAa,CAAC;AACnB,SAAK,SAAS;AACd,QAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,WAAK,aAAa,CAAC;AAAA,IAAG;AAAA,EAC5B,OAAO;AACL,SAAK,cAAc;AACnB,SAAK,aAAa,KAAK,sBAAsB,OAAO;AACpD,QAAI,KAAK,cAAc,MAAM,GAAG;AAC9B,UAAI,KAAK,SAAS,QAAQ,QAAQ;AAAE,aAAK,WAAW;AAAA,MAAG;AACvD,WAAK,SAAS,KAAK,cAAc;AACjC,UAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,aAAK,aAAa,KAAK,gBAAgB;AAAA,MAAG;AAAA,IAChD,OAAO;AACL,eAAS,IAAI,GAAG,OAAO,KAAK,YAAY,IAAI,KAAK,QAAQ,KAAK,GAAG;AAE/D,YAAI,OAAO,KAAK,CAAC;AAEjB,aAAK,gBAAgB,KAAK,KAAK;AAE/B,aAAK,iBAAiB,KAAK,KAAK;AAEhC,YAAI,KAAK,MAAM,SAAS,WAAW;AACjC,eAAK,MAAM,KAAK,MAAM,OAAO,wEAAwE;AAAA,QACvG;AAAA,MACF;AAEA,WAAK,SAAS;AACd,UAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,aAAK,aAAa,CAAC;AAAA,MAAG;AAAA,IAC5B;AACA,SAAK,UAAU;AAAA,EACjB;AACA,SAAO,KAAK,WAAW,MAAM,wBAAwB;AACvD;AAEA,KAAK,yBAAyB,SAAS,MAAM;AAC3C,SAAO,KAAK,eAAe,IAAI;AACjC;AAEA,KAAK,gCAAgC,WAAW;AAC9C,MAAI;AACJ,MAAI,KAAK,SAAS,QAAQ,cAAc,UAAU,KAAK,gBAAgB,IAAI;AACzE,QAAI,QAAQ,KAAK,UAAU;AAC3B,SAAK,KAAK;AACV,QAAI,SAAS;AAAE,WAAK,KAAK;AAAA,IAAG;AAC5B,WAAO,KAAK,cAAc,OAAO,iBAAiB,kBAAkB,OAAO,OAAO;AAAA,EACpF,WAAW,KAAK,SAAS,QAAQ,QAAQ;AACvC,QAAI,QAAQ,KAAK,UAAU;AAC3B,WAAO,KAAK,WAAW,OAAO,YAAY;AAAA,EAC5C,OAAO;AACL,QAAI,cAAc,KAAK,iBAAiB;AACxC,SAAK,UAAU;AACf,WAAO;AAAA,EACT;AACF;AAEA,KAAK,cAAc,SAAS,SAAS,MAAM,KAAK;AAC9C,MAAI,CAAC,SAAS;AAAE;AAAA,EAAO;AACvB,MAAI,OAAO,SAAS,UAClB;AAAE,WAAO,KAAK,SAAS,eAAe,KAAK,OAAO,KAAK;AAAA,EAAO;AAChE,MAAI,OAAO,SAAS,IAAI,GACtB;AAAE,SAAK,iBAAiB,KAAK,uBAAuB,OAAO,GAAG;AAAA,EAAG;AACnE,UAAQ,IAAI,IAAI;AAClB;AAEA,KAAK,qBAAqB,SAAS,SAAS,KAAK;AAC/C,MAAI,OAAO,IAAI;AACf,MAAI,SAAS,cACX;AAAE,SAAK,YAAY,SAAS,KAAK,IAAI,KAAK;AAAA,EAAG,WACtC,SAAS,iBAChB;AAAE,aAAS,IAAI,GAAG,OAAO,IAAI,YAAY,IAAI,KAAK,QAAQ,KAAK,GAC7D;AACE,UAAI,OAAO,KAAK,CAAC;AAEjB,WAAK,mBAAmB,SAAS,IAAI;AAAA,IACvC;AAAA,EAAE,WACG,SAAS,gBAChB;AAAE,aAAS,MAAM,GAAG,SAAS,IAAI,UAAU,MAAM,OAAO,QAAQ,OAAO,GAAG;AACxE,UAAI,MAAM,OAAO,GAAG;AAElB,UAAI,KAAK;AAAE,aAAK,mBAAmB,SAAS,GAAG;AAAA,MAAG;AAAA,IACtD;AAAA,EAAE,WACK,SAAS,YAChB;AAAE,SAAK,mBAAmB,SAAS,IAAI,KAAK;AAAA,EAAG,WACxC,SAAS,qBAChB;AAAE,SAAK,mBAAmB,SAAS,IAAI,IAAI;AAAA,EAAG,WACvC,SAAS,eAChB;AAAE,SAAK,mBAAmB,SAAS,IAAI,QAAQ;AAAA,EAAG;AACtD;AAEA,KAAK,sBAAsB,SAAS,SAAS,OAAO;AAClD,MAAI,CAAC,SAAS;AAAE;AAAA,EAAO;AACvB,WAAS,IAAI,GAAG,OAAO,OAAO,IAAI,KAAK,QAAQ,KAAK,GAClD;AACA,QAAI,OAAO,KAAK,CAAC;AAEjB,SAAK,mBAAmB,SAAS,KAAK,EAAE;AAAA,EAC1C;AACF;AAEA,KAAK,6BAA6B,WAAW;AAC3C,SAAO,KAAK,KAAK,YAAY,SAC3B,KAAK,KAAK,YAAY,WACtB,KAAK,KAAK,YAAY,WACtB,KAAK,KAAK,YAAY,cACtB,KAAK,MAAM,KACX,KAAK,gBAAgB;AACzB;AAIA,KAAK,uBAAuB,SAAS,SAAS;AAC5C,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,QAAQ,KAAK,sBAAsB;AAExC,OAAK,WAAW,KAAK,cAAc,IAAI,IAAI,KAAK,sBAAsB,IAAI,KAAK;AAC/E,OAAK;AAAA,IACH;AAAA,IACA,KAAK;AAAA,IACL,KAAK,SAAS;AAAA,EAChB;AAEA,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,wBAAwB,SAAS,SAAS;AAC7C,MAAI,QAAQ,CAAC,GAAG,QAAQ;AAExB,OAAK,OAAO,QAAQ,MAAM;AAC1B,SAAO,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAAE;AAAA,MAAM;AAAA,IACvD,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,UAAM,KAAK,KAAK,qBAAqB,OAAO,CAAC;AAAA,EAC/C;AACA,SAAO;AACT;AAIA,KAAK,cAAc,SAAS,MAAM;AAChC,OAAK,KAAK;AAGV,MAAI,KAAK,SAAS,QAAQ,QAAQ;AAChC,SAAK,aAAa;AAClB,SAAK,SAAS,KAAK,cAAc;AAAA,EACnC,OAAO;AACL,SAAK,aAAa,KAAK,sBAAsB;AAC7C,SAAK,iBAAiB,MAAM;AAC5B,SAAK,SAAS,KAAK,SAAS,QAAQ,SAAS,KAAK,cAAc,IAAI,KAAK,WAAW;AAAA,EACtF;AACA,MAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,SAAK,aAAa,KAAK,gBAAgB;AAAA,EAAG;AAC9C,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,mBAAmB;AAClD;AAIA,KAAK,uBAAuB,WAAW;AACrC,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,WAAW,KAAK,sBAAsB;AAE3C,MAAI,KAAK,cAAc,IAAI,GAAG;AAC5B,SAAK,QAAQ,KAAK,WAAW;AAAA,EAC/B,OAAO;AACL,SAAK,gBAAgB,KAAK,QAAQ;AAClC,SAAK,QAAQ,KAAK;AAAA,EACpB;AACA,OAAK,gBAAgB,KAAK,OAAO,YAAY;AAE7C,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,8BAA8B,WAAW;AAE5C,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,QAAQ,KAAK,WAAW;AAC7B,OAAK,gBAAgB,KAAK,OAAO,YAAY;AAC7C,SAAO,KAAK,WAAW,MAAM,wBAAwB;AACvD;AAEA,KAAK,gCAAgC,WAAW;AAC9C,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,OAAK,iBAAiB,IAAI;AAC1B,OAAK,QAAQ,KAAK,WAAW;AAC7B,OAAK,gBAAgB,KAAK,OAAO,YAAY;AAC7C,SAAO,KAAK,WAAW,MAAM,0BAA0B;AACzD;AAEA,KAAK,wBAAwB,WAAW;AACtC,MAAI,QAAQ,CAAC,GAAG,QAAQ;AACxB,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,UAAM,KAAK,KAAK,4BAA4B,CAAC;AAC7C,QAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,GAAG;AAAE,aAAO;AAAA,IAAM;AAAA,EAC/C;AACA,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,UAAM,KAAK,KAAK,8BAA8B,CAAC;AAC/C,WAAO;AAAA,EACT;AACA,OAAK,OAAO,QAAQ,MAAM;AAC1B,SAAO,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAAE;AAAA,MAAM;AAAA,IACvD,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,UAAM,KAAK,KAAK,qBAAqB,CAAC;AAAA,EACxC;AACA,SAAO;AACT;AAEA,KAAK,kBAAkB,WAAW;AAChC,MAAI,QAAQ,CAAC;AACb,MAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,GAAG;AAC5B,WAAO;AAAA,EACT;AACA,OAAK,OAAO,QAAQ,MAAM;AAC1B,MAAI,gBAAgB,CAAC;AACrB,MAAI,QAAQ;AACZ,SAAO,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAAE;AAAA,MAAM;AAAA,IACvD,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,QAAI,OAAO,KAAK,qBAAqB;AACrC,QAAI,UAAU,KAAK,IAAI,SAAS,eAAe,KAAK,IAAI,OAAO,KAAK,IAAI;AACxE,QAAI,OAAO,eAAe,OAAO,GAC/B;AAAE,WAAK,iBAAiB,KAAK,IAAI,OAAO,8BAA8B,UAAU,GAAG;AAAA,IAAG;AACxF,kBAAc,OAAO,IAAI;AACzB,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,SAAO;AACT;AAEA,KAAK,uBAAuB,WAAW;AACrC,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,MAAM,KAAK,SAAS,QAAQ,SAAS,KAAK,cAAc,IAAI,KAAK,WAAW,KAAK,QAAQ,kBAAkB,OAAO;AACvH,OAAK,OAAO,QAAQ,KAAK;AACzB,MAAI,KAAK,SAAS,QAAQ,QAAQ;AAChC,SAAK,WAAW;AAAA,EAClB;AACA,OAAK,QAAQ,KAAK,cAAc;AAChC,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,wBAAwB,WAAW;AACtC,MAAI,KAAK,QAAQ,eAAe,MAAM,KAAK,SAAS,QAAQ,QAAQ;AAClE,QAAI,gBAAgB,KAAK,aAAa,KAAK,KAAK;AAChD,QAAI,cAAc,KAAK,cAAc,KAAK,GAAG;AAC3C,WAAK,MAAM,cAAc,OAAO,iDAAiD;AAAA,IACnF;AACA,WAAO;AAAA,EACT;AACA,SAAO,KAAK,WAAW,IAAI;AAC7B;AAGA,KAAK,yBAAyB,SAAS,YAAY;AACjD,WAAS,IAAI,GAAG,IAAI,WAAW,UAAU,KAAK,qBAAqB,WAAW,CAAC,CAAC,GAAG,EAAE,GAAG;AACtF,eAAW,CAAC,EAAE,YAAY,WAAW,CAAC,EAAE,WAAW,IAAI,MAAM,GAAG,EAAE;AAAA,EACpE;AACF;AACA,KAAK,uBAAuB,SAAS,WAAW;AAC9C,SACE,KAAK,QAAQ,eAAe,KAC5B,UAAU,SAAS,yBACnB,UAAU,WAAW,SAAS,aAC9B,OAAO,UAAU,WAAW,UAAU;AAAA,GAErC,KAAK,MAAM,UAAU,KAAK,MAAM,OAAQ,KAAK,MAAM,UAAU,KAAK,MAAM;AAE7E;AAEA,IAAI,OAAO,OAAO;AAKlB,KAAK,eAAe,SAAS,MAAM,WAAW,wBAAwB;AACpE,MAAI,KAAK,QAAQ,eAAe,KAAK,MAAM;AACzC,YAAQ,KAAK,MAAM;AAAA,MACnB,KAAK;AACH,YAAI,KAAK,WAAW,KAAK,SAAS,SAChC;AAAE,eAAK,MAAM,KAAK,OAAO,2DAA2D;AAAA,QAAG;AACzF;AAAA,MAEF,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH;AAAA,MAEF,KAAK;AACH,aAAK,OAAO;AACZ,YAAI,wBAAwB;AAAE,eAAK,mBAAmB,wBAAwB,IAAI;AAAA,QAAG;AACrF,iBAAS,IAAI,GAAG,OAAO,KAAK,YAAY,IAAI,KAAK,QAAQ,KAAK,GAAG;AAC/D,cAAI,OAAO,KAAK,CAAC;AAEnB,eAAK,aAAa,MAAM,SAAS;AAM/B,cACE,KAAK,SAAS,kBACb,KAAK,SAAS,SAAS,kBAAkB,KAAK,SAAS,SAAS,kBACjE;AACA,iBAAK,MAAM,KAAK,SAAS,OAAO,kBAAkB;AAAA,UACpD;AAAA,QACF;AACA;AAAA,MAEF,KAAK;AAEH,YAAI,KAAK,SAAS,QAAQ;AAAE,eAAK,MAAM,KAAK,IAAI,OAAO,+CAA+C;AAAA,QAAG;AACzG,aAAK,aAAa,KAAK,OAAO,SAAS;AACvC;AAAA,MAEF,KAAK;AACH,aAAK,OAAO;AACZ,YAAI,wBAAwB;AAAE,eAAK,mBAAmB,wBAAwB,IAAI;AAAA,QAAG;AACrF,aAAK,iBAAiB,KAAK,UAAU,SAAS;AAC9C;AAAA,MAEF,KAAK;AACH,aAAK,OAAO;AACZ,aAAK,aAAa,KAAK,UAAU,SAAS;AAC1C,YAAI,KAAK,SAAS,SAAS,qBACzB;AAAE,eAAK,MAAM,KAAK,SAAS,OAAO,2CAA2C;AAAA,QAAG;AAClF;AAAA,MAEF,KAAK;AACH,YAAI,KAAK,aAAa,KAAK;AAAE,eAAK,MAAM,KAAK,KAAK,KAAK,6DAA6D;AAAA,QAAG;AACvH,aAAK,OAAO;AACZ,eAAO,KAAK;AACZ,aAAK,aAAa,KAAK,MAAM,SAAS;AACtC;AAAA,MAEF,KAAK;AACH,aAAK,aAAa,KAAK,YAAY,WAAW,sBAAsB;AACpE;AAAA,MAEF,KAAK;AACH,aAAK,iBAAiB,KAAK,OAAO,mDAAmD;AACrF;AAAA,MAEF,KAAK;AACH,YAAI,CAAC,WAAW;AAAE;AAAA,QAAM;AAAA,MAE1B;AACE,aAAK,MAAM,KAAK,OAAO,qBAAqB;AAAA,IAC9C;AAAA,EACF,WAAW,wBAAwB;AAAE,SAAK,mBAAmB,wBAAwB,IAAI;AAAA,EAAG;AAC5F,SAAO;AACT;AAIA,KAAK,mBAAmB,SAAS,UAAU,WAAW;AACpD,MAAI,MAAM,SAAS;AACnB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,QAAI,MAAM,SAAS,CAAC;AACpB,QAAI,KAAK;AAAE,WAAK,aAAa,KAAK,SAAS;AAAA,IAAG;AAAA,EAChD;AACA,MAAI,KAAK;AACP,QAAI,OAAO,SAAS,MAAM,CAAC;AAC3B,QAAI,KAAK,QAAQ,gBAAgB,KAAK,aAAa,QAAQ,KAAK,SAAS,iBAAiB,KAAK,SAAS,SAAS,cAC/G;AAAE,WAAK,WAAW,KAAK,SAAS,KAAK;AAAA,IAAG;AAAA,EAC5C;AACA,SAAO;AACT;AAIA,KAAK,cAAc,SAAS,wBAAwB;AAClD,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,OAAK,WAAW,KAAK,iBAAiB,OAAO,sBAAsB;AACnE,SAAO,KAAK,WAAW,MAAM,eAAe;AAC9C;AAEA,KAAK,mBAAmB,WAAW;AACjC,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AAGV,MAAI,KAAK,QAAQ,gBAAgB,KAAK,KAAK,SAAS,QAAQ,MAC1D;AAAE,SAAK,WAAW;AAAA,EAAG;AAEvB,OAAK,WAAW,KAAK,iBAAiB;AAEtC,SAAO,KAAK,WAAW,MAAM,aAAa;AAC5C;AAIA,KAAK,mBAAmB,WAAW;AACjC,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,YAAQ,KAAK,MAAM;AAAA,MACnB,KAAK,QAAQ;AACX,YAAI,OAAO,KAAK,UAAU;AAC1B,aAAK,KAAK;AACV,aAAK,WAAW,KAAK,iBAAiB,QAAQ,UAAU,MAAM,IAAI;AAClE,eAAO,KAAK,WAAW,MAAM,cAAc;AAAA,MAE7C,KAAK,QAAQ;AACX,eAAO,KAAK,SAAS,IAAI;AAAA,IAC3B;AAAA,EACF;AACA,SAAO,KAAK,WAAW;AACzB;AAEA,KAAK,mBAAmB,SAAS,OAAO,YAAY,oBAAoB,gBAAgB;AACtF,MAAI,OAAO,CAAC,GAAG,QAAQ;AACvB,SAAO,CAAC,KAAK,IAAI,KAAK,GAAG;AACvB,QAAI,OAAO;AAAE,cAAQ;AAAA,IAAO,OACvB;AAAE,WAAK,OAAO,QAAQ,KAAK;AAAA,IAAG;AACnC,QAAI,cAAc,KAAK,SAAS,QAAQ,OAAO;AAC7C,WAAK,KAAK,IAAI;AAAA,IAChB,WAAW,sBAAsB,KAAK,mBAAmB,KAAK,GAAG;AAC/D;AAAA,IACF,WAAW,KAAK,SAAS,QAAQ,UAAU;AACzC,UAAI,OAAO,KAAK,iBAAiB;AACjC,WAAK,qBAAqB,IAAI;AAC9B,WAAK,KAAK,IAAI;AACd,UAAI,KAAK,SAAS,QAAQ,OAAO;AAAE,aAAK,iBAAiB,KAAK,OAAO,+CAA+C;AAAA,MAAG;AACvH,WAAK,OAAO,KAAK;AACjB;AAAA,IACF,OAAO;AACL,WAAK,KAAK,KAAK,wBAAwB,cAAc,CAAC;AAAA,IACxD;AAAA,EACF;AACA,SAAO;AACT;AAEA,KAAK,0BAA0B,SAAS,gBAAgB;AACtD,MAAI,OAAO,KAAK,kBAAkB,KAAK,OAAO,KAAK,QAAQ;AAC3D,OAAK,qBAAqB,IAAI;AAC9B,SAAO;AACT;AAEA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,SAAO;AACT;AAIA,KAAK,oBAAoB,SAAS,UAAU,UAAU,MAAM;AAC1D,SAAO,QAAQ,KAAK,iBAAiB;AACrC,MAAI,KAAK,QAAQ,cAAc,KAAK,CAAC,KAAK,IAAI,QAAQ,EAAE,GAAG;AAAE,WAAO;AAAA,EAAK;AACzE,MAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,OAAK,OAAO;AACZ,OAAK,QAAQ,KAAK,iBAAiB;AACnC,SAAO,KAAK,WAAW,MAAM,mBAAmB;AAClD;AAkEA,KAAK,kBAAkB,SAAS,MAAM,aAAa,cAAc;AAC/D,MAAK,gBAAgB,OAAS,eAAc;AAE5C,MAAI,SAAS,gBAAgB;AAE7B,UAAQ,KAAK,MAAM;AAAA,IACnB,KAAK;AACH,UAAI,KAAK,UAAU,KAAK,wBAAwB,KAAK,KAAK,IAAI,GAC5D;AAAE,aAAK,iBAAiB,KAAK,QAAQ,SAAS,aAAa,mBAAmB,KAAK,OAAO,iBAAiB;AAAA,MAAG;AAChH,UAAI,QAAQ;AACV,YAAI,gBAAgB,gBAAgB,KAAK,SAAS,OAChD;AAAE,eAAK,iBAAiB,KAAK,OAAO,6CAA6C;AAAA,QAAG;AACtF,YAAI,cAAc;AAChB,cAAI,OAAO,cAAc,KAAK,IAAI,GAChC;AAAE,iBAAK,iBAAiB,KAAK,OAAO,qBAAqB;AAAA,UAAG;AAC9D,uBAAa,KAAK,IAAI,IAAI;AAAA,QAC5B;AACA,YAAI,gBAAgB,cAAc;AAAE,eAAK,YAAY,KAAK,MAAM,aAAa,KAAK,KAAK;AAAA,QAAG;AAAA,MAC5F;AACA;AAAA,IAEF,KAAK;AACH,WAAK,iBAAiB,KAAK,OAAO,mDAAmD;AACrF;AAAA,IAEF,KAAK;AACH,UAAI,QAAQ;AAAE,aAAK,iBAAiB,KAAK,OAAO,2BAA2B;AAAA,MAAG;AAC9E;AAAA,IAEF,KAAK;AACH,UAAI,QAAQ;AAAE,aAAK,iBAAiB,KAAK,OAAO,kCAAkC;AAAA,MAAG;AACrF,aAAO,KAAK,gBAAgB,KAAK,YAAY,aAAa,YAAY;AAAA,IAExE;AACE,WAAK,MAAM,KAAK,QAAQ,SAAS,YAAY,kBAAkB,SAAS;AAAA,EAC1E;AACF;AAEA,KAAK,mBAAmB,SAAS,MAAM,aAAa,cAAc;AAChE,MAAK,gBAAgB,OAAS,eAAc;AAE5C,UAAQ,KAAK,MAAM;AAAA,IACnB,KAAK;AACH,eAAS,IAAI,GAAG,OAAO,KAAK,YAAY,IAAI,KAAK,QAAQ,KAAK,GAAG;AAC/D,YAAI,OAAO,KAAK,CAAC;AAEnB,aAAK,sBAAsB,MAAM,aAAa,YAAY;AAAA,MAC1D;AACA;AAAA,IAEF,KAAK;AACH,eAAS,MAAM,GAAG,SAAS,KAAK,UAAU,MAAM,OAAO,QAAQ,OAAO,GAAG;AACvE,YAAI,OAAO,OAAO,GAAG;AAEvB,YAAI,MAAM;AAAE,eAAK,sBAAsB,MAAM,aAAa,YAAY;AAAA,QAAG;AAAA,MACzE;AACA;AAAA,IAEF;AACE,WAAK,gBAAgB,MAAM,aAAa,YAAY;AAAA,EACtD;AACF;AAEA,KAAK,wBAAwB,SAAS,MAAM,aAAa,cAAc;AACrE,MAAK,gBAAgB,OAAS,eAAc;AAE5C,UAAQ,KAAK,MAAM;AAAA,IACnB,KAAK;AAEH,WAAK,sBAAsB,KAAK,OAAO,aAAa,YAAY;AAChE;AAAA,IAEF,KAAK;AACH,WAAK,iBAAiB,KAAK,MAAM,aAAa,YAAY;AAC1D;AAAA,IAEF,KAAK;AACH,WAAK,iBAAiB,KAAK,UAAU,aAAa,YAAY;AAC9D;AAAA,IAEF;AACE,WAAK,iBAAiB,MAAM,aAAa,YAAY;AAAA,EACvD;AACF;AAOA,IAAI,aAAa,SAASI,YAAW,OAAO,QAAQ,eAAe,UAAU,WAAW;AACtF,OAAK,QAAQ;AACb,OAAK,SAAS,CAAC,CAAC;AAChB,OAAK,gBAAgB,CAAC,CAAC;AACvB,OAAK,WAAW;AAChB,OAAK,YAAY,CAAC,CAAC;AACrB;AAEA,IAAI,QAAQ;AAAA,EACV,QAAQ,IAAI,WAAW,KAAK,KAAK;AAAA,EACjC,QAAQ,IAAI,WAAW,KAAK,IAAI;AAAA,EAChC,QAAQ,IAAI,WAAW,MAAM,KAAK;AAAA,EAClC,QAAQ,IAAI,WAAW,KAAK,KAAK;AAAA,EACjC,QAAQ,IAAI,WAAW,KAAK,IAAI;AAAA,EAChC,QAAQ,IAAI,WAAW,KAAK,MAAM,MAAM,SAAU,GAAG;AAAE,WAAO,EAAE,qBAAqB;AAAA,EAAG,CAAC;AAAA,EACzF,QAAQ,IAAI,WAAW,YAAY,KAAK;AAAA,EACxC,QAAQ,IAAI,WAAW,YAAY,IAAI;AAAA,EACvC,YAAY,IAAI,WAAW,YAAY,MAAM,OAAO,MAAM,IAAI;AAAA,EAC9D,OAAO,IAAI,WAAW,YAAY,OAAO,OAAO,MAAM,IAAI;AAC5D;AAEA,IAAI,OAAO,OAAO;AAElB,KAAK,iBAAiB,WAAW;AAC/B,SAAO,CAAC,MAAM,MAAM;AACtB;AAEA,KAAK,aAAa,WAAW;AAC3B,SAAO,KAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC;AAC7C;AAEA,KAAK,eAAe,SAAS,UAAU;AACrC,MAAI,SAAS,KAAK,WAAW;AAC7B,MAAI,WAAW,MAAM,UAAU,WAAW,MAAM,QAC9C;AAAE,WAAO;AAAA,EAAK;AAChB,MAAI,aAAa,QAAQ,UAAU,WAAW,MAAM,UAAU,WAAW,MAAM,SAC7E;AAAE,WAAO,CAAC,OAAO;AAAA,EAAO;AAK1B,MAAI,aAAa,QAAQ,WAAW,aAAa,QAAQ,QAAQ,KAAK,aACpE;AAAE,WAAO,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC;AAAA,EAAE;AACzE,MAAI,aAAa,QAAQ,SAAS,aAAa,QAAQ,QAAQ,aAAa,QAAQ,OAAO,aAAa,QAAQ,UAAU,aAAa,QAAQ,OAC7I;AAAE,WAAO;AAAA,EAAK;AAChB,MAAI,aAAa,QAAQ,QACvB;AAAE,WAAO,WAAW,MAAM;AAAA,EAAO;AACnC,MAAI,aAAa,QAAQ,QAAQ,aAAa,QAAQ,UAAU,aAAa,QAAQ,MACnF;AAAE,WAAO;AAAA,EAAM;AACjB,SAAO,CAAC,KAAK;AACf;AAEA,KAAK,qBAAqB,WAAW;AACnC,WAAS,IAAI,KAAK,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;AACjD,QAAI,UAAU,KAAK,QAAQ,CAAC;AAC5B,QAAI,QAAQ,UAAU,YACpB;AAAE,aAAO,QAAQ;AAAA,IAAU;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,KAAK,gBAAgB,SAAS,UAAU;AACtC,MAAI,QAAQ,OAAO,KAAK;AACxB,MAAI,KAAK,WAAW,aAAa,QAAQ,KACvC;AAAE,SAAK,cAAc;AAAA,EAAO,WACrB,SAAS,KAAK,eACrB;AAAE,WAAO,KAAK,MAAM,QAAQ;AAAA,EAAG,OAE/B;AAAE,SAAK,cAAc,KAAK;AAAA,EAAY;AAC1C;AAIA,KAAK,kBAAkB,SAAS,UAAU;AACxC,MAAI,KAAK,WAAW,MAAM,UAAU;AAClC,SAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC,IAAI;AAAA,EAC1C;AACF;AAIA,QAAQ,OAAO,gBAAgB,QAAQ,OAAO,gBAAgB,WAAW;AACvE,MAAI,KAAK,QAAQ,WAAW,GAAG;AAC7B,SAAK,cAAc;AACnB;AAAA,EACF;AACA,MAAI,MAAM,KAAK,QAAQ,IAAI;AAC3B,MAAI,QAAQ,MAAM,UAAU,KAAK,WAAW,EAAE,UAAU,YAAY;AAClE,UAAM,KAAK,QAAQ,IAAI;AAAA,EACzB;AACA,OAAK,cAAc,CAAC,IAAI;AAC1B;AAEA,QAAQ,OAAO,gBAAgB,SAAS,UAAU;AAChD,OAAK,QAAQ,KAAK,KAAK,aAAa,QAAQ,IAAI,MAAM,SAAS,MAAM,MAAM;AAC3E,OAAK,cAAc;AACrB;AAEA,QAAQ,aAAa,gBAAgB,WAAW;AAC9C,OAAK,QAAQ,KAAK,MAAM,MAAM;AAC9B,OAAK,cAAc;AACrB;AAEA,QAAQ,OAAO,gBAAgB,SAAS,UAAU;AAChD,MAAI,kBAAkB,aAAa,QAAQ,OAAO,aAAa,QAAQ,QAAQ,aAAa,QAAQ,SAAS,aAAa,QAAQ;AAClI,OAAK,QAAQ,KAAK,kBAAkB,MAAM,SAAS,MAAM,MAAM;AAC/D,OAAK,cAAc;AACrB;AAEA,QAAQ,OAAO,gBAAgB,WAAW;AAE1C;AAEA,QAAQ,UAAU,gBAAgB,QAAQ,OAAO,gBAAgB,SAAS,UAAU;AAClF,MAAI,SAAS,cAAc,aAAa,QAAQ,SAC5C,EAAE,aAAa,QAAQ,QAAQ,KAAK,WAAW,MAAM,MAAM,WAC3D,EAAE,aAAa,QAAQ,WAAW,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC,MAC9F,GAAG,aAAa,QAAQ,SAAS,aAAa,QAAQ,WAAW,KAAK,WAAW,MAAM,MAAM,SAC/F;AAAE,SAAK,QAAQ,KAAK,MAAM,MAAM;AAAA,EAAG,OAEnC;AAAE,SAAK,QAAQ,KAAK,MAAM,MAAM;AAAA,EAAG;AACrC,OAAK,cAAc;AACrB;AAEA,QAAQ,MAAM,gBAAgB,WAAW;AACvC,MAAI,KAAK,WAAW,EAAE,UAAU,YAAY;AAAE,SAAK,QAAQ,IAAI;AAAA,EAAG;AAClE,OAAK,cAAc;AACrB;AAEA,QAAQ,UAAU,gBAAgB,WAAW;AAC3C,MAAI,KAAK,WAAW,MAAM,MAAM,QAC9B;AAAE,SAAK,QAAQ,IAAI;AAAA,EAAG,OAEtB;AAAE,SAAK,QAAQ,KAAK,MAAM,MAAM;AAAA,EAAG;AACrC,OAAK,cAAc;AACrB;AAEA,QAAQ,KAAK,gBAAgB,SAAS,UAAU;AAC9C,MAAI,aAAa,QAAQ,WAAW;AAClC,QAAI,QAAQ,KAAK,QAAQ,SAAS;AAClC,QAAI,KAAK,QAAQ,KAAK,MAAM,MAAM,QAChC;AAAE,WAAK,QAAQ,KAAK,IAAI,MAAM;AAAA,IAAY,OAE1C;AAAE,WAAK,QAAQ,KAAK,IAAI,MAAM;AAAA,IAAO;AAAA,EACzC;AACA,OAAK,cAAc;AACrB;AAEA,QAAQ,KAAK,gBAAgB,SAAS,UAAU;AAC9C,MAAI,UAAU;AACd,MAAI,KAAK,QAAQ,eAAe,KAAK,aAAa,QAAQ,KAAK;AAC7D,QAAI,KAAK,UAAU,QAAQ,CAAC,KAAK,eAC7B,KAAK,UAAU,WAAW,KAAK,mBAAmB,GACpD;AAAE,gBAAU;AAAA,IAAM;AAAA,EACtB;AACA,OAAK,cAAc;AACrB;AAqBA,IAAI,OAAO,OAAO;AAOlB,KAAK,iBAAiB,SAAS,MAAM,UAAU,wBAAwB;AACrE,MAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,iBACjD;AAAE;AAAA,EAAO;AACX,MAAI,KAAK,QAAQ,eAAe,MAAM,KAAK,YAAY,KAAK,UAAU,KAAK,YACzE;AAAE;AAAA,EAAO;AACX,MAAI,MAAM,KAAK;AACf,MAAI;AACJ,UAAQ,IAAI,MAAM;AAAA,IAClB,KAAK;AAAc,aAAO,IAAI;AAAM;AAAA,IACpC,KAAK;AAAW,aAAO,OAAO,IAAI,KAAK;AAAG;AAAA,IAC1C;AAAS;AAAA,EACT;AACA,MAAI,OAAO,KAAK;AAChB,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,QAAI,SAAS,eAAe,SAAS,QAAQ;AAC3C,UAAI,SAAS,OAAO;AAClB,YAAI,wBAAwB;AAC1B,cAAI,uBAAuB,cAAc,GAAG;AAC1C,mCAAuB,cAAc,IAAI;AAAA,UAC3C;AAAA,QACF,OAAO;AACL,eAAK,iBAAiB,IAAI,OAAO,oCAAoC;AAAA,QACvE;AAAA,MACF;AACA,eAAS,QAAQ;AAAA,IACnB;AACA;AAAA,EACF;AACA,SAAO,MAAM;AACb,MAAI,QAAQ,SAAS,IAAI;AACzB,MAAI,OAAO;AACT,QAAI;AACJ,QAAI,SAAS,QAAQ;AACnB,qBAAe,KAAK,UAAU,MAAM,QAAQ,MAAM,OAAO,MAAM;AAAA,IACjE,OAAO;AACL,qBAAe,MAAM,QAAQ,MAAM,IAAI;AAAA,IACzC;AACA,QAAI,cACF;AAAE,WAAK,iBAAiB,IAAI,OAAO,0BAA0B;AAAA,IAAG;AAAA,EACpE,OAAO;AACL,YAAQ,SAAS,IAAI,IAAI;AAAA,MACvB,MAAM;AAAA,MACN,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAAA,EACF;AACA,QAAM,IAAI,IAAI;AAChB;AAiBA,KAAK,kBAAkB,SAAS,SAAS,wBAAwB;AAC/D,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,OAAO,KAAK,iBAAiB,SAAS,sBAAsB;AAChE,MAAI,KAAK,SAAS,QAAQ,OAAO;AAC/B,QAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,SAAK,cAAc,CAAC,IAAI;AACxB,WAAO,KAAK,IAAI,QAAQ,KAAK,GAAG;AAAE,WAAK,YAAY,KAAK,KAAK,iBAAiB,SAAS,sBAAsB,CAAC;AAAA,IAAG;AACjH,WAAO,KAAK,WAAW,MAAM,oBAAoB;AAAA,EACnD;AACA,SAAO;AACT;AAKA,KAAK,mBAAmB,SAAS,SAAS,wBAAwB,gBAAgB;AAChF,MAAI,KAAK,aAAa,OAAO,GAAG;AAC9B,QAAI,KAAK,aAAa;AAAE,aAAO,KAAK,WAAW,OAAO;AAAA,IAAE,OAGnD;AAAE,WAAK,cAAc;AAAA,IAAO;AAAA,EACnC;AAEA,MAAI,yBAAyB,OAAO,iBAAiB,IAAI,mBAAmB,IAAI,iBAAiB;AACjG,MAAI,wBAAwB;AAC1B,qBAAiB,uBAAuB;AACxC,uBAAmB,uBAAuB;AAC1C,qBAAiB,uBAAuB;AACxC,2BAAuB,sBAAsB,uBAAuB,gBAAgB;AAAA,EACtF,OAAO;AACL,6BAAyB,IAAI;AAC7B,6BAAyB;AAAA,EAC3B;AAEA,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAQ,MAAM;AAC9D,SAAK,mBAAmB,KAAK;AAC7B,SAAK,2BAA2B,YAAY;AAAA,EAC9C;AACA,MAAI,OAAO,KAAK,sBAAsB,SAAS,sBAAsB;AACrE,MAAI,gBAAgB;AAAE,WAAO,eAAe,KAAK,MAAM,MAAM,UAAU,QAAQ;AAAA,EAAG;AAClF,MAAI,KAAK,KAAK,UAAU;AACtB,QAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,SAAK,WAAW,KAAK;AACrB,QAAI,KAAK,SAAS,QAAQ,IACxB;AAAE,aAAO,KAAK,aAAa,MAAM,OAAO,sBAAsB;AAAA,IAAG;AACnE,QAAI,CAAC,wBAAwB;AAC3B,6BAAuB,sBAAsB,uBAAuB,gBAAgB,uBAAuB,cAAc;AAAA,IAC3H;AACA,QAAI,uBAAuB,mBAAmB,KAAK,OACjD;AAAE,6BAAuB,kBAAkB;AAAA,IAAI;AACjD,QAAI,KAAK,SAAS,QAAQ,IACxB;AAAE,WAAK,iBAAiB,IAAI;AAAA,IAAG,OAE/B;AAAE,WAAK,gBAAgB,IAAI;AAAA,IAAG;AAChC,SAAK,OAAO;AACZ,SAAK,KAAK;AACV,SAAK,QAAQ,KAAK,iBAAiB,OAAO;AAC1C,QAAI,iBAAiB,IAAI;AAAE,6BAAuB,cAAc;AAAA,IAAgB;AAChF,WAAO,KAAK,WAAW,MAAM,sBAAsB;AAAA,EACrD,OAAO;AACL,QAAI,wBAAwB;AAAE,WAAK,sBAAsB,wBAAwB,IAAI;AAAA,IAAG;AAAA,EAC1F;AACA,MAAI,iBAAiB,IAAI;AAAE,2BAAuB,sBAAsB;AAAA,EAAgB;AACxF,MAAI,mBAAmB,IAAI;AAAE,2BAAuB,gBAAgB;AAAA,EAAkB;AACtF,SAAO;AACT;AAIA,KAAK,wBAAwB,SAAS,SAAS,wBAAwB;AACrE,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,OAAO,KAAK,aAAa,SAAS,sBAAsB;AAC5D,MAAI,KAAK,sBAAsB,sBAAsB,GAAG;AAAE,WAAO;AAAA,EAAK;AACtE,MAAI,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC9B,QAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,SAAK,OAAO;AACZ,SAAK,aAAa,KAAK,iBAAiB;AACxC,SAAK,OAAO,QAAQ,KAAK;AACzB,SAAK,YAAY,KAAK,iBAAiB,OAAO;AAC9C,WAAO,KAAK,WAAW,MAAM,uBAAuB;AAAA,EACtD;AACA,SAAO;AACT;AAIA,KAAK,eAAe,SAAS,SAAS,wBAAwB;AAC5D,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,OAAO,KAAK,gBAAgB,wBAAwB,OAAO,OAAO,OAAO;AAC7E,MAAI,KAAK,sBAAsB,sBAAsB,GAAG;AAAE,WAAO;AAAA,EAAK;AACtE,SAAO,KAAK,UAAU,YAAY,KAAK,SAAS,4BAA4B,OAAO,KAAK,YAAY,MAAM,UAAU,UAAU,IAAI,OAAO;AAC3I;AAQA,KAAK,cAAc,SAAS,MAAM,cAAc,cAAc,SAAS,SAAS;AAC9E,MAAI,OAAO,KAAK,KAAK;AACrB,MAAI,QAAQ,SAAS,CAAC,WAAW,KAAK,SAAS,QAAQ,MAAM;AAC3D,QAAI,OAAO,SAAS;AAClB,UAAI,UAAU,KAAK,SAAS,QAAQ,aAAa,KAAK,SAAS,QAAQ;AACvE,UAAI,WAAW,KAAK,SAAS,QAAQ;AACrC,UAAI,UAAU;AAGZ,eAAO,QAAQ,WAAW;AAAA,MAC5B;AACA,UAAI,KAAK,KAAK;AACd,WAAK,KAAK;AACV,UAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,UAAI,QAAQ,KAAK,YAAY,KAAK,gBAAgB,MAAM,OAAO,OAAO,OAAO,GAAG,UAAU,UAAU,MAAM,OAAO;AACjH,UAAI,OAAO,KAAK,YAAY,cAAc,cAAc,MAAM,OAAO,IAAI,WAAW,QAAQ;AAC5F,UAAK,WAAW,KAAK,SAAS,QAAQ,YAAc,aAAa,KAAK,SAAS,QAAQ,aAAa,KAAK,SAAS,QAAQ,aAAc;AACtI,aAAK,iBAAiB,KAAK,OAAO,0FAA0F;AAAA,MAC9H;AACA,aAAO,KAAK,YAAY,MAAM,cAAc,cAAc,SAAS,OAAO;AAAA,IAC5E;AAAA,EACF;AACA,SAAO;AACT;AAEA,KAAK,cAAc,SAAS,UAAU,UAAU,MAAM,OAAO,IAAI,SAAS;AACxE,MAAI,MAAM,SAAS,qBAAqB;AAAE,SAAK,MAAM,MAAM,OAAO,+DAA+D;AAAA,EAAG;AACpI,MAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,OAAK,OAAO;AACZ,OAAK,WAAW;AAChB,OAAK,QAAQ;AACb,SAAO,KAAK,WAAW,MAAM,UAAU,sBAAsB,kBAAkB;AACjF;AAIA,KAAK,kBAAkB,SAAS,wBAAwB,UAAU,QAAQ,SAAS;AACjF,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK,UAAU;AACrD,MAAI,KAAK,aAAa,OAAO,KAAK,KAAK,UAAU;AAC/C,WAAO,KAAK,WAAW,OAAO;AAC9B,eAAW;AAAA,EACb,WAAW,KAAK,KAAK,QAAQ;AAC3B,QAAI,OAAO,KAAK,UAAU,GAAG,SAAS,KAAK,SAAS,QAAQ;AAC5D,SAAK,WAAW,KAAK;AACrB,SAAK,SAAS;AACd,SAAK,KAAK;AACV,SAAK,WAAW,KAAK,gBAAgB,MAAM,MAAM,QAAQ,OAAO;AAChE,SAAK,sBAAsB,wBAAwB,IAAI;AACvD,QAAI,QAAQ;AAAE,WAAK,gBAAgB,KAAK,QAAQ;AAAA,IAAG,WAC1C,KAAK,UAAU,KAAK,aAAa,YAAY,sBAAsB,KAAK,QAAQ,GACvF;AAAE,WAAK,iBAAiB,KAAK,OAAO,wCAAwC;AAAA,IAAG,WACxE,KAAK,aAAa,YAAY,qBAAqB,KAAK,QAAQ,GACvE;AAAE,WAAK,iBAAiB,KAAK,OAAO,mCAAmC;AAAA,IAAG,OACvE;AAAE,iBAAW;AAAA,IAAM;AACxB,WAAO,KAAK,WAAW,MAAM,SAAS,qBAAqB,iBAAiB;AAAA,EAC9E,WAAW,CAAC,YAAY,KAAK,SAAS,QAAQ,WAAW;AACvD,SAAK,WAAW,KAAK,iBAAiB,WAAW,MAAM,KAAK,QAAQ,oBAAoB;AAAE,WAAK,WAAW;AAAA,IAAG;AAC7G,WAAO,KAAK,kBAAkB;AAE9B,QAAI,KAAK,SAAS,QAAQ,KAAK;AAAE,WAAK,WAAW;AAAA,IAAG;AAAA,EACtD,OAAO;AACL,WAAO,KAAK,oBAAoB,wBAAwB,OAAO;AAC/D,QAAI,KAAK,sBAAsB,sBAAsB,GAAG;AAAE,aAAO;AAAA,IAAK;AACtE,WAAO,KAAK,KAAK,WAAW,CAAC,KAAK,mBAAmB,GAAG;AACtD,UAAI,SAAS,KAAK,YAAY,UAAU,QAAQ;AAChD,aAAO,WAAW,KAAK;AACvB,aAAO,SAAS;AAChB,aAAO,WAAW;AAClB,WAAK,gBAAgB,IAAI;AACzB,WAAK,KAAK;AACV,aAAO,KAAK,WAAW,QAAQ,kBAAkB;AAAA,IACnD;AAAA,EACF;AAEA,MAAI,CAAC,UAAU,KAAK,IAAI,QAAQ,QAAQ,GAAG;AACzC,QAAI,UACF;AAAE,WAAK,WAAW,KAAK,YAAY;AAAA,IAAG,OAEtC;AAAE,aAAO,KAAK,YAAY,UAAU,UAAU,MAAM,KAAK,gBAAgB,MAAM,OAAO,OAAO,OAAO,GAAG,MAAM,KAAK;AAAA,IAAE;AAAA,EACxH,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,SAAS,sBAAsB,MAAM;AACnC,SACE,KAAK,SAAS,gBACd,KAAK,SAAS,6BAA6B,sBAAsB,KAAK,UAAU;AAEpF;AAEA,SAAS,qBAAqB,MAAM;AAClC,SACE,KAAK,SAAS,sBAAsB,KAAK,SAAS,SAAS,uBAC3D,KAAK,SAAS,qBAAqB,qBAAqB,KAAK,UAAU,KACvE,KAAK,SAAS,6BAA6B,qBAAqB,KAAK,UAAU;AAEnF;AAIA,KAAK,sBAAsB,SAAS,wBAAwB,SAAS;AACnE,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,OAAO,KAAK,cAAc,wBAAwB,OAAO;AAC7D,MAAI,KAAK,SAAS,6BAA6B,KAAK,MAAM,MAAM,KAAK,cAAc,KAAK,UAAU,MAAM,KACtG;AAAE,WAAO;AAAA,EAAK;AAChB,MAAI,SAAS,KAAK,gBAAgB,MAAM,UAAU,UAAU,OAAO,OAAO;AAC1E,MAAI,0BAA0B,OAAO,SAAS,oBAAoB;AAChE,QAAI,uBAAuB,uBAAuB,OAAO,OAAO;AAAE,6BAAuB,sBAAsB;AAAA,IAAI;AACnH,QAAI,uBAAuB,qBAAqB,OAAO,OAAO;AAAE,6BAAuB,oBAAoB;AAAA,IAAI;AAC/G,QAAI,uBAAuB,iBAAiB,OAAO,OAAO;AAAE,6BAAuB,gBAAgB;AAAA,IAAI;AAAA,EACzG;AACA,SAAO;AACT;AAEA,KAAK,kBAAkB,SAAS,MAAM,UAAU,UAAU,SAAS,SAAS;AAC1E,MAAI,kBAAkB,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,gBAAgB,KAAK,SAAS,WAC/F,KAAK,eAAe,KAAK,OAAO,CAAC,KAAK,mBAAmB,KAAK,KAAK,MAAM,KAAK,UAAU,KACxF,KAAK,qBAAqB,KAAK;AACnC,MAAI,kBAAkB;AAEtB,SAAO,MAAM;AACX,QAAI,UAAU,KAAK,eAAe,MAAM,UAAU,UAAU,SAAS,iBAAiB,iBAAiB,OAAO;AAE9G,QAAI,QAAQ,UAAU;AAAE,wBAAkB;AAAA,IAAM;AAChD,QAAI,YAAY,QAAQ,QAAQ,SAAS,2BAA2B;AAClE,UAAI,iBAAiB;AACnB,YAAI,YAAY,KAAK,YAAY,UAAU,QAAQ;AACnD,kBAAU,aAAa;AACvB,kBAAU,KAAK,WAAW,WAAW,iBAAiB;AAAA,MACxD;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AACF;AAEA,KAAK,wBAAwB,WAAW;AACtC,SAAO,CAAC,KAAK,mBAAmB,KAAK,KAAK,IAAI,QAAQ,KAAK;AAC7D;AAEA,KAAK,2BAA2B,SAAS,UAAU,UAAU,UAAU,SAAS;AAC9E,SAAO,KAAK,qBAAqB,KAAK,YAAY,UAAU,QAAQ,GAAG,UAAU,MAAM,OAAO;AAChG;AAEA,KAAK,iBAAiB,SAAS,MAAM,UAAU,UAAU,SAAS,iBAAiB,iBAAiB,SAAS;AAC3G,MAAI,oBAAoB,KAAK,QAAQ,eAAe;AACpD,MAAI,WAAW,qBAAqB,KAAK,IAAI,QAAQ,WAAW;AAChE,MAAI,WAAW,UAAU;AAAE,SAAK,MAAM,KAAK,cAAc,kEAAkE;AAAA,EAAG;AAE9H,MAAI,WAAW,KAAK,IAAI,QAAQ,QAAQ;AACxC,MAAI,YAAa,YAAY,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAQ,aAAc,KAAK,IAAI,QAAQ,GAAG,GAAG;AACtH,QAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,SAAK,SAAS;AACd,QAAI,UAAU;AACZ,WAAK,WAAW,KAAK,gBAAgB;AACrC,WAAK,OAAO,QAAQ,QAAQ;AAAA,IAC9B,WAAW,KAAK,SAAS,QAAQ,aAAa,KAAK,SAAS,SAAS;AACnE,WAAK,WAAW,KAAK,kBAAkB;AAAA,IACzC,OAAO;AACL,WAAK,WAAW,KAAK,WAAW,KAAK,QAAQ,kBAAkB,OAAO;AAAA,IACxE;AACA,SAAK,WAAW,CAAC,CAAC;AAClB,QAAI,mBAAmB;AACrB,WAAK,WAAW;AAAA,IAClB;AACA,WAAO,KAAK,WAAW,MAAM,kBAAkB;AAAA,EACjD,WAAW,CAAC,WAAW,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC/C,QAAI,yBAAyB,IAAI,uBAAqB,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU,mBAAmB,KAAK;AACxI,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,gBAAgB;AACrB,QAAI,WAAW,KAAK,cAAc,QAAQ,QAAQ,KAAK,QAAQ,eAAe,GAAG,OAAO,sBAAsB;AAC9G,QAAI,mBAAmB,CAAC,YAAY,KAAK,sBAAsB,GAAG;AAChE,WAAK,mBAAmB,wBAAwB,KAAK;AACrD,WAAK,+BAA+B;AACpC,UAAI,KAAK,gBAAgB,GACvB;AAAE,aAAK,MAAM,KAAK,eAAe,2DAA2D;AAAA,MAAG;AACjG,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,WAAK,gBAAgB;AACrB,aAAO,KAAK,yBAAyB,UAAU,UAAU,UAAU,OAAO;AAAA,IAC5E;AACA,SAAK,sBAAsB,wBAAwB,IAAI;AACvD,SAAK,WAAW,eAAe,KAAK;AACpC,SAAK,WAAW,eAAe,KAAK;AACpC,SAAK,gBAAgB,oBAAoB,KAAK;AAC9C,QAAI,SAAS,KAAK,YAAY,UAAU,QAAQ;AAChD,WAAO,SAAS;AAChB,WAAO,YAAY;AACnB,QAAI,mBAAmB;AACrB,aAAO,WAAW;AAAA,IACpB;AACA,WAAO,KAAK,WAAW,QAAQ,gBAAgB;AAAA,EACjD,WAAW,KAAK,SAAS,QAAQ,WAAW;AAC1C,QAAI,YAAY,iBAAiB;AAC/B,WAAK,MAAM,KAAK,OAAO,2EAA2E;AAAA,IACpG;AACA,QAAI,SAAS,KAAK,YAAY,UAAU,QAAQ;AAChD,WAAO,MAAM;AACb,WAAO,QAAQ,KAAK,cAAc,EAAC,UAAU,KAAI,CAAC;AAClD,WAAO,KAAK,WAAW,QAAQ,0BAA0B;AAAA,EAC3D;AACA,SAAO;AACT;AAOA,KAAK,gBAAgB,SAAS,wBAAwB,SAAS,QAAQ;AAGrE,MAAI,KAAK,SAAS,QAAQ,OAAO;AAAE,SAAK,WAAW;AAAA,EAAG;AAEtD,MAAI,MAAM,aAAa,KAAK,qBAAqB,KAAK;AACtD,UAAQ,KAAK,MAAM;AAAA,IACnB,KAAK,QAAQ;AACX,UAAI,CAAC,KAAK,YACR;AAAE,aAAK,MAAM,KAAK,OAAO,kCAAkC;AAAA,MAAG;AAChE,aAAO,KAAK,UAAU;AACtB,WAAK,KAAK;AACV,UAAI,KAAK,SAAS,QAAQ,UAAU,CAAC,KAAK,kBACxC;AAAE,aAAK,MAAM,KAAK,OAAO,gDAAgD;AAAA,MAAG;AAO9E,UAAI,KAAK,SAAS,QAAQ,OAAO,KAAK,SAAS,QAAQ,YAAY,KAAK,SAAS,QAAQ,QACvF;AAAE,aAAK,WAAW;AAAA,MAAG;AACvB,aAAO,KAAK,WAAW,MAAM,OAAO;AAAA,IAEtC,KAAK,QAAQ;AACX,aAAO,KAAK,UAAU;AACtB,WAAK,KAAK;AACV,aAAO,KAAK,WAAW,MAAM,gBAAgB;AAAA,IAE/C,KAAK,QAAQ;AACX,UAAI,WAAW,KAAK,OAAO,WAAW,KAAK,UAAU,cAAc,KAAK;AACxE,UAAI,KAAK,KAAK,WAAW,KAAK;AAC9B,UAAI,KAAK,QAAQ,eAAe,KAAK,CAAC,eAAe,GAAG,SAAS,WAAW,CAAC,KAAK,mBAAmB,KAAK,KAAK,IAAI,QAAQ,SAAS,GAAG;AACrI,aAAK,gBAAgB,MAAM,MAAM;AACjC,eAAO,KAAK,cAAc,KAAK,YAAY,UAAU,QAAQ,GAAG,GAAG,OAAO,MAAM,OAAO;AAAA,MACzF;AACA,UAAI,cAAc,CAAC,KAAK,mBAAmB,GAAG;AAC5C,YAAI,KAAK,IAAI,QAAQ,KAAK,GACxB;AAAE,iBAAO,KAAK,qBAAqB,KAAK,YAAY,UAAU,QAAQ,GAAG,CAAC,EAAE,GAAG,OAAO,OAAO;AAAA,QAAE;AACjG,YAAI,KAAK,QAAQ,eAAe,KAAK,GAAG,SAAS,WAAW,KAAK,SAAS,QAAQ,QAAQ,CAAC,gBACtF,CAAC,KAAK,4BAA4B,KAAK,UAAU,QAAQ,KAAK,cAAc;AAC/E,eAAK,KAAK,WAAW,KAAK;AAC1B,cAAI,KAAK,mBAAmB,KAAK,CAAC,KAAK,IAAI,QAAQ,KAAK,GACtD;AAAE,iBAAK,WAAW;AAAA,UAAG;AACvB,iBAAO,KAAK,qBAAqB,KAAK,YAAY,UAAU,QAAQ,GAAG,CAAC,EAAE,GAAG,MAAM,OAAO;AAAA,QAC5F;AAAA,MACF;AACA,aAAO;AAAA,IAET,KAAK,QAAQ;AACX,UAAI,QAAQ,KAAK;AACjB,aAAO,KAAK,aAAa,MAAM,KAAK;AACpC,WAAK,QAAQ,EAAC,SAAS,MAAM,SAAS,OAAO,MAAM,MAAK;AACxD,aAAO;AAAA,IAET,KAAK,QAAQ;AAAA,IAAK,KAAK,QAAQ;AAC7B,aAAO,KAAK,aAAa,KAAK,KAAK;AAAA,IAErC,KAAK,QAAQ;AAAA,IAAO,KAAK,QAAQ;AAAA,IAAO,KAAK,QAAQ;AACnD,aAAO,KAAK,UAAU;AACtB,WAAK,QAAQ,KAAK,SAAS,QAAQ,QAAQ,OAAO,KAAK,SAAS,QAAQ;AACxE,WAAK,MAAM,KAAK,KAAK;AACrB,WAAK,KAAK;AACV,aAAO,KAAK,WAAW,MAAM,SAAS;AAAA,IAExC,KAAK,QAAQ;AACX,UAAI,QAAQ,KAAK,OAAO,OAAO,KAAK,mCAAmC,YAAY,OAAO;AAC1F,UAAI,wBAAwB;AAC1B,YAAI,uBAAuB,sBAAsB,KAAK,CAAC,KAAK,qBAAqB,IAAI,GACnF;AAAE,iCAAuB,sBAAsB;AAAA,QAAO;AACxD,YAAI,uBAAuB,oBAAoB,GAC7C;AAAE,iCAAuB,oBAAoB;AAAA,QAAO;AAAA,MACxD;AACA,aAAO;AAAA,IAET,KAAK,QAAQ;AACX,aAAO,KAAK,UAAU;AACtB,WAAK,KAAK;AACV,WAAK,WAAW,KAAK,cAAc,QAAQ,UAAU,MAAM,MAAM,sBAAsB;AACvF,aAAO,KAAK,WAAW,MAAM,iBAAiB;AAAA,IAEhD,KAAK,QAAQ;AACX,WAAK,gBAAgB,MAAM,MAAM;AACjC,aAAO,KAAK,SAAS,OAAO,sBAAsB;AAAA,IAEpD,KAAK,QAAQ;AACX,aAAO,KAAK,UAAU;AACtB,WAAK,KAAK;AACV,aAAO,KAAK,cAAc,MAAM,CAAC;AAAA,IAEnC,KAAK,QAAQ;AACX,aAAO,KAAK,WAAW,KAAK,UAAU,GAAG,KAAK;AAAA,IAEhD,KAAK,QAAQ;AACX,aAAO,KAAK,SAAS;AAAA,IAEvB,KAAK,QAAQ;AACX,aAAO,KAAK,cAAc;AAAA,IAE5B,KAAK,QAAQ;AACX,UAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,eAAO,KAAK,gBAAgB,MAAM;AAAA,MACpC,OAAO;AACL,eAAO,KAAK,WAAW;AAAA,MACzB;AAAA,IAEF;AACE,aAAO,KAAK,qBAAqB;AAAA,EACnC;AACF;AAEA,KAAK,uBAAuB,WAAW;AACrC,OAAK,WAAW;AAClB;AAEA,KAAK,kBAAkB,SAAS,QAAQ;AACtC,MAAI,OAAO,KAAK,UAAU;AAI1B,MAAI,KAAK,aAAa;AAAE,SAAK,iBAAiB,KAAK,OAAO,mCAAmC;AAAA,EAAG;AAChG,OAAK,KAAK;AAEV,MAAI,KAAK,SAAS,QAAQ,UAAU,CAAC,QAAQ;AAC3C,WAAO,KAAK,mBAAmB,IAAI;AAAA,EACrC,WAAW,KAAK,SAAS,QAAQ,KAAK;AACpC,QAAI,OAAO,KAAK,YAAY,KAAK,OAAO,KAAK,OAAO,KAAK,IAAI,KAAK;AAClE,SAAK,OAAO;AACZ,SAAK,OAAO,KAAK,WAAW,MAAM,YAAY;AAC9C,WAAO,KAAK,gBAAgB,IAAI;AAAA,EAClC,OAAO;AACL,SAAK,WAAW;AAAA,EAClB;AACF;AAEA,KAAK,qBAAqB,SAAS,MAAM;AACvC,OAAK,KAAK;AAGV,OAAK,SAAS,KAAK,iBAAiB;AAEpC,MAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,QAAI,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC7B,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,CAAC,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAC5C,aAAK,UAAU,KAAK,iBAAiB;AACrC,YAAI,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC7B,eAAK,OAAO,QAAQ,KAAK;AACzB,cAAI,CAAC,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAC5C,iBAAK,WAAW;AAAA,UAClB;AAAA,QACF;AAAA,MACF,OAAO;AACL,aAAK,UAAU;AAAA,MACjB;AAAA,IACF,OAAO;AACL,WAAK,UAAU;AAAA,IACjB;AAAA,EACF,OAAO;AAEL,QAAI,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC7B,UAAI,WAAW,KAAK;AACpB,UAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,KAAK,IAAI,QAAQ,MAAM,GAAG;AACvD,aAAK,iBAAiB,UAAU,2CAA2C;AAAA,MAC7E,OAAO;AACL,aAAK,WAAW,QAAQ;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAEA,SAAO,KAAK,WAAW,MAAM,kBAAkB;AACjD;AAEA,KAAK,kBAAkB,SAAS,MAAM;AACpC,OAAK,KAAK;AAEV,MAAI,cAAc,KAAK;AACvB,OAAK,WAAW,KAAK,WAAW,IAAI;AAEpC,MAAI,KAAK,SAAS,SAAS,QACzB;AAAE,SAAK,iBAAiB,KAAK,SAAS,OAAO,0DAA0D;AAAA,EAAG;AAC5G,MAAI,aACF;AAAE,SAAK,iBAAiB,KAAK,OAAO,mDAAmD;AAAA,EAAG;AAC5F,MAAI,KAAK,QAAQ,eAAe,YAAY,CAAC,KAAK,QAAQ,6BACxD;AAAE,SAAK,iBAAiB,KAAK,OAAO,2CAA2C;AAAA,EAAG;AAEpF,SAAO,KAAK,WAAW,MAAM,cAAc;AAC7C;AAEA,KAAK,eAAe,SAAS,OAAO;AAClC,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,QAAQ;AACb,OAAK,MAAM,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG;AAChD,MAAI,KAAK,IAAI,WAAW,KAAK,IAAI,SAAS,CAAC,MAAM,KAC/C;AAAE,SAAK,SAAS,KAAK,SAAS,OAAO,KAAK,MAAM,SAAS,IAAI,KAAK,IAAI,MAAM,GAAG,EAAE,EAAE,QAAQ,MAAM,EAAE;AAAA,EAAG;AACxG,OAAK,KAAK;AACV,SAAO,KAAK,WAAW,MAAM,SAAS;AACxC;AAEA,KAAK,uBAAuB,WAAW;AACrC,OAAK,OAAO,QAAQ,MAAM;AAC1B,MAAI,MAAM,KAAK,gBAAgB;AAC/B,OAAK,OAAO,QAAQ,MAAM;AAC1B,SAAO;AACT;AAEA,KAAK,mBAAmB,SAAS,UAAU;AACzC,SAAO,CAAC,KAAK,mBAAmB;AAClC;AAEA,KAAK,qCAAqC,SAAS,YAAY,SAAS;AACtE,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK,UAAU,KAAK,qBAAqB,KAAK,QAAQ,eAAe;AAC3G,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,SAAK,KAAK;AAEV,QAAI,gBAAgB,KAAK,OAAO,gBAAgB,KAAK;AACrD,QAAI,WAAW,CAAC,GAAG,QAAQ,MAAM,cAAc;AAC/C,QAAI,yBAAyB,IAAI,uBAAqB,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU;AAChH,SAAK,WAAW;AAChB,SAAK,WAAW;AAEhB,WAAO,KAAK,SAAS,QAAQ,QAAQ;AACnC,cAAQ,QAAQ,QAAQ,KAAK,OAAO,QAAQ,KAAK;AACjD,UAAI,sBAAsB,KAAK,mBAAmB,QAAQ,QAAQ,IAAI,GAAG;AACvE,sBAAc;AACd;AAAA,MACF,WAAW,KAAK,SAAS,QAAQ,UAAU;AACzC,sBAAc,KAAK;AACnB,iBAAS,KAAK,KAAK,eAAe,KAAK,iBAAiB,CAAC,CAAC;AAC1D,YAAI,KAAK,SAAS,QAAQ,OAAO;AAC/B,eAAK;AAAA,YACH,KAAK;AAAA,YACL;AAAA,UACF;AAAA,QACF;AACA;AAAA,MACF,OAAO;AACL,iBAAS,KAAK,KAAK,iBAAiB,OAAO,wBAAwB,KAAK,cAAc,CAAC;AAAA,MACzF;AAAA,IACF;AACA,QAAI,cAAc,KAAK,YAAY,cAAc,KAAK;AACtD,SAAK,OAAO,QAAQ,MAAM;AAE1B,QAAI,cAAc,KAAK,iBAAiB,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,GAAG;AAC5E,WAAK,mBAAmB,wBAAwB,KAAK;AACrD,WAAK,+BAA+B;AACpC,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,aAAO,KAAK,oBAAoB,UAAU,UAAU,UAAU,OAAO;AAAA,IACvE;AAEA,QAAI,CAAC,SAAS,UAAU,aAAa;AAAE,WAAK,WAAW,KAAK,YAAY;AAAA,IAAG;AAC3E,QAAI,aAAa;AAAE,WAAK,WAAW,WAAW;AAAA,IAAG;AACjD,SAAK,sBAAsB,wBAAwB,IAAI;AACvD,SAAK,WAAW,eAAe,KAAK;AACpC,SAAK,WAAW,eAAe,KAAK;AAEpC,QAAI,SAAS,SAAS,GAAG;AACvB,YAAM,KAAK,YAAY,eAAe,aAAa;AACnD,UAAI,cAAc;AAClB,WAAK,aAAa,KAAK,sBAAsB,aAAa,WAAW;AAAA,IACvE,OAAO;AACL,YAAM,SAAS,CAAC;AAAA,IAClB;AAAA,EACF,OAAO;AACL,UAAM,KAAK,qBAAqB;AAAA,EAClC;AAEA,MAAI,KAAK,QAAQ,gBAAgB;AAC/B,QAAI,MAAM,KAAK,YAAY,UAAU,QAAQ;AAC7C,QAAI,aAAa;AACjB,WAAO,KAAK,WAAW,KAAK,yBAAyB;AAAA,EACvD,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,KAAK,iBAAiB,SAAS,MAAM;AACnC,SAAO;AACT;AAEA,KAAK,sBAAsB,SAAS,UAAU,UAAU,UAAU,SAAS;AACzE,SAAO,KAAK,qBAAqB,KAAK,YAAY,UAAU,QAAQ,GAAG,UAAU,OAAO,OAAO;AACjG;AAQA,IAAI,QAAQ,CAAC;AAEb,KAAK,WAAW,WAAW;AACzB,MAAI,KAAK,aAAa;AAAE,SAAK,iBAAiB,KAAK,OAAO,gCAAgC;AAAA,EAAG;AAC7F,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,MAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,QAAQ,KAAK;AAC9D,QAAI,OAAO,KAAK,YAAY,KAAK,OAAO,KAAK,OAAO,KAAK,IAAI,KAAK;AAClE,SAAK,OAAO;AACZ,SAAK,OAAO,KAAK,WAAW,MAAM,YAAY;AAC9C,SAAK,KAAK;AACV,QAAI,cAAc,KAAK;AACvB,SAAK,WAAW,KAAK,WAAW,IAAI;AACpC,QAAI,KAAK,SAAS,SAAS,UACzB;AAAE,WAAK,iBAAiB,KAAK,SAAS,OAAO,sDAAsD;AAAA,IAAG;AACxG,QAAI,aACF;AAAE,WAAK,iBAAiB,KAAK,OAAO,kDAAkD;AAAA,IAAG;AAC3F,QAAI,CAAC,KAAK,mBACR;AAAE,WAAK,iBAAiB,KAAK,OAAO,mEAAmE;AAAA,IAAG;AAC5G,WAAO,KAAK,WAAW,MAAM,cAAc;AAAA,EAC7C;AACA,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,OAAK,SAAS,KAAK,gBAAgB,KAAK,cAAc,MAAM,OAAO,IAAI,GAAG,UAAU,UAAU,MAAM,KAAK;AACzG,MAAI,KAAK,IAAI,QAAQ,MAAM,GAAG;AAAE,SAAK,YAAY,KAAK,cAAc,QAAQ,QAAQ,KAAK,QAAQ,eAAe,GAAG,KAAK;AAAA,EAAG,OACtH;AAAE,SAAK,YAAY;AAAA,EAAO;AAC/B,SAAO,KAAK,WAAW,MAAM,eAAe;AAC9C;AAIA,KAAK,uBAAuB,SAASJ,MAAK;AACxC,MAAI,WAAWA,KAAI;AAEnB,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,KAAK,SAAS,QAAQ,iBAAiB;AACzC,QAAI,CAAC,UAAU;AACb,WAAK,iBAAiB,KAAK,OAAO,kDAAkD;AAAA,IACtF;AACA,SAAK,QAAQ;AAAA,MACX,KAAK,KAAK,MAAM,QAAQ,UAAU,IAAI;AAAA,MACtC,QAAQ;AAAA,IACV;AAAA,EACF,OAAO;AACL,SAAK,QAAQ;AAAA,MACX,KAAK,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG,EAAE,QAAQ,UAAU,IAAI;AAAA,MAClE,QAAQ,KAAK;AAAA,IACf;AAAA,EACF;AACA,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,SAAS,QAAQ;AAClC,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,gBAAgB,SAASA,MAAK;AACjC,MAAKA,SAAQ,OAAS,CAAAA,OAAM,CAAC;AAC7B,MAAI,WAAWA,KAAI;AAAU,MAAK,aAAa,OAAS,YAAW;AAEnE,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,OAAK,cAAc,CAAC;AACpB,MAAI,SAAS,KAAK,qBAAqB,EAAC,SAAkB,CAAC;AAC3D,OAAK,SAAS,CAAC,MAAM;AACrB,SAAO,CAAC,OAAO,MAAM;AACnB,QAAI,KAAK,SAAS,QAAQ,KAAK;AAAE,WAAK,MAAM,KAAK,KAAK,+BAA+B;AAAA,IAAG;AACxF,SAAK,OAAO,QAAQ,YAAY;AAChC,SAAK,YAAY,KAAK,KAAK,gBAAgB,CAAC;AAC5C,SAAK,OAAO,QAAQ,MAAM;AAC1B,SAAK,OAAO,KAAK,SAAS,KAAK,qBAAqB,EAAC,SAAkB,CAAC,CAAC;AAAA,EAC3E;AACA,OAAK,KAAK;AACV,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,cAAc,SAAS,MAAM;AAChC,SAAO,CAAC,KAAK,YAAY,KAAK,IAAI,SAAS,gBAAgB,KAAK,IAAI,SAAS,YAC1E,KAAK,SAAS,QAAQ,QAAQ,KAAK,SAAS,QAAQ,OAAO,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAQ,YAAY,KAAK,KAAK,WAAY,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,QAAQ,SAC3M,CAAC,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC;AACjE;AAIA,KAAK,WAAW,SAAS,WAAW,wBAAwB;AAC1D,MAAI,OAAO,KAAK,UAAU,GAAG,QAAQ,MAAM,WAAW,CAAC;AACvD,OAAK,aAAa,CAAC;AACnB,OAAK,KAAK;AACV,SAAO,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAAE;AAAA,MAAM;AAAA,IACxF,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,QAAI,OAAO,KAAK,cAAc,WAAW,sBAAsB;AAC/D,QAAI,CAAC,WAAW;AAAE,WAAK,eAAe,MAAM,UAAU,sBAAsB;AAAA,IAAG;AAC/E,SAAK,WAAW,KAAK,IAAI;AAAA,EAC3B;AACA,SAAO,KAAK,WAAW,MAAM,YAAY,kBAAkB,kBAAkB;AAC/E;AAEA,KAAK,gBAAgB,SAAS,WAAW,wBAAwB;AAC/D,MAAI,OAAO,KAAK,UAAU,GAAG,aAAa,SAAS,UAAU;AAC7D,MAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC/D,QAAI,WAAW;AACb,WAAK,WAAW,KAAK,WAAW,KAAK;AACrC,UAAI,KAAK,SAAS,QAAQ,OAAO;AAC/B,aAAK,iBAAiB,KAAK,OAAO,+CAA+C;AAAA,MACnF;AACA,aAAO,KAAK,WAAW,MAAM,aAAa;AAAA,IAC5C;AAEA,SAAK,WAAW,KAAK,iBAAiB,OAAO,sBAAsB;AAEnE,QAAI,KAAK,SAAS,QAAQ,SAAS,0BAA0B,uBAAuB,gBAAgB,GAAG;AACrG,6BAAuB,gBAAgB,KAAK;AAAA,IAC9C;AAEA,WAAO,KAAK,WAAW,MAAM,eAAe;AAAA,EAC9C;AACA,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,SAAK,SAAS;AACd,SAAK,YAAY;AACjB,QAAI,aAAa,wBAAwB;AACvC,iBAAW,KAAK;AAChB,iBAAW,KAAK;AAAA,IAClB;AACA,QAAI,CAAC,WACH;AAAE,oBAAc,KAAK,IAAI,QAAQ,IAAI;AAAA,IAAG;AAAA,EAC5C;AACA,MAAI,cAAc,KAAK;AACvB,OAAK,kBAAkB,IAAI;AAC3B,MAAI,CAAC,aAAa,CAAC,eAAe,KAAK,QAAQ,eAAe,KAAK,CAAC,eAAe,KAAK,YAAY,IAAI,GAAG;AACzG,cAAU;AACV,kBAAc,KAAK,QAAQ,eAAe,KAAK,KAAK,IAAI,QAAQ,IAAI;AACpE,SAAK,kBAAkB,IAAI;AAAA,EAC7B,OAAO;AACL,cAAU;AAAA,EACZ;AACA,OAAK,mBAAmB,MAAM,WAAW,aAAa,SAAS,UAAU,UAAU,wBAAwB,WAAW;AACtH,SAAO,KAAK,WAAW,MAAM,UAAU;AACzC;AAEA,KAAK,oBAAoB,SAAS,MAAM;AACtC,MAAI,OAAO,KAAK,IAAI;AACpB,OAAK,kBAAkB,IAAI;AAC3B,OAAK,QAAQ,KAAK,YAAY,KAAK;AACnC,OAAK,OAAO;AACZ,MAAI,aAAa,KAAK,SAAS,QAAQ,IAAI;AAC3C,MAAI,KAAK,MAAM,OAAO,WAAW,YAAY;AAC3C,QAAI,QAAQ,KAAK,MAAM;AACvB,QAAI,KAAK,SAAS,OAChB;AAAE,WAAK,iBAAiB,OAAO,8BAA8B;AAAA,IAAG,OAEhE;AAAE,WAAK,iBAAiB,OAAO,sCAAsC;AAAA,IAAG;AAAA,EAC5E,OAAO;AACL,QAAI,KAAK,SAAS,SAAS,KAAK,MAAM,OAAO,CAAC,EAAE,SAAS,eACvD;AAAE,WAAK,iBAAiB,KAAK,MAAM,OAAO,CAAC,EAAE,OAAO,+BAA+B;AAAA,IAAG;AAAA,EAC1F;AACF;AAEA,KAAK,qBAAqB,SAAS,MAAM,WAAW,aAAa,SAAS,UAAU,UAAU,wBAAwB,aAAa;AACjI,OAAK,eAAe,YAAY,KAAK,SAAS,QAAQ,OACpD;AAAE,SAAK,WAAW;AAAA,EAAG;AAEvB,MAAI,KAAK,IAAI,QAAQ,KAAK,GAAG;AAC3B,SAAK,QAAQ,YAAY,KAAK,kBAAkB,KAAK,OAAO,KAAK,QAAQ,IAAI,KAAK,iBAAiB,OAAO,sBAAsB;AAChI,SAAK,OAAO;AAAA,EACd,WAAW,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,QAAQ,QAAQ;AACxE,QAAI,WAAW;AAAE,WAAK,WAAW;AAAA,IAAG;AACpC,SAAK,SAAS;AACd,SAAK,QAAQ,KAAK,YAAY,aAAa,OAAO;AAClD,SAAK,OAAO;AAAA,EACd,WAAW,CAAC,aAAa,CAAC,eACf,KAAK,QAAQ,eAAe,KAAK,CAAC,KAAK,YAAY,KAAK,IAAI,SAAS,iBACpE,KAAK,IAAI,SAAS,SAAS,KAAK,IAAI,SAAS,WAC7C,KAAK,SAAS,QAAQ,SAAS,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAQ,KAAK;AACpG,QAAI,eAAe,SAAS;AAAE,WAAK,WAAW;AAAA,IAAG;AACjD,SAAK,kBAAkB,IAAI;AAAA,EAC7B,WAAW,KAAK,QAAQ,eAAe,KAAK,CAAC,KAAK,YAAY,KAAK,IAAI,SAAS,cAAc;AAC5F,QAAI,eAAe,SAAS;AAAE,WAAK,WAAW;AAAA,IAAG;AACjD,SAAK,gBAAgB,KAAK,GAAG;AAC7B,QAAI,KAAK,IAAI,SAAS,WAAW,CAAC,KAAK,eACrC;AAAE,WAAK,gBAAgB;AAAA,IAAU;AACnC,QAAI,WAAW;AACb,WAAK,QAAQ,KAAK,kBAAkB,UAAU,UAAU,KAAK,SAAS,KAAK,GAAG,CAAC;AAAA,IACjF,WAAW,KAAK,SAAS,QAAQ,MAAM,wBAAwB;AAC7D,UAAI,uBAAuB,kBAAkB,GAC3C;AAAE,+BAAuB,kBAAkB,KAAK;AAAA,MAAO;AACzD,WAAK,QAAQ,KAAK,kBAAkB,UAAU,UAAU,KAAK,SAAS,KAAK,GAAG,CAAC;AAAA,IACjF,OAAO;AACL,WAAK,QAAQ,KAAK,SAAS,KAAK,GAAG;AAAA,IACrC;AACA,SAAK,OAAO;AACZ,SAAK,YAAY;AAAA,EACnB,OAAO;AAAE,SAAK,WAAW;AAAA,EAAG;AAC9B;AAEA,KAAK,oBAAoB,SAAS,MAAM;AACtC,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,QAAI,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC9B,WAAK,WAAW;AAChB,WAAK,MAAM,KAAK,iBAAiB;AACjC,WAAK,OAAO,QAAQ,QAAQ;AAC5B,aAAO,KAAK;AAAA,IACd,OAAO;AACL,WAAK,WAAW;AAAA,IAClB;AAAA,EACF;AACA,SAAO,KAAK,MAAM,KAAK,SAAS,QAAQ,OAAO,KAAK,SAAS,QAAQ,SAAS,KAAK,cAAc,IAAI,KAAK,WAAW,KAAK,QAAQ,kBAAkB,OAAO;AAC7J;AAIA,KAAK,eAAe,SAAS,MAAM;AACjC,OAAK,KAAK;AACV,MAAI,KAAK,QAAQ,eAAe,GAAG;AAAE,SAAK,YAAY,KAAK,aAAa;AAAA,EAAO;AAC/E,MAAI,KAAK,QAAQ,eAAe,GAAG;AAAE,SAAK,QAAQ;AAAA,EAAO;AAC3D;AAIA,KAAK,cAAc,SAAS,aAAa,SAAS,kBAAkB;AAClE,MAAI,OAAO,KAAK,UAAU,GAAG,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU,mBAAmB,KAAK;AAE/G,OAAK,aAAa,IAAI;AACtB,MAAI,KAAK,QAAQ,eAAe,GAC9B;AAAE,SAAK,YAAY;AAAA,EAAa;AAClC,MAAI,KAAK,QAAQ,eAAe,GAC9B;AAAE,SAAK,QAAQ,CAAC,CAAC;AAAA,EAAS;AAE5B,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,OAAK,WAAW,cAAc,SAAS,KAAK,SAAS,IAAI,eAAe,mBAAmB,qBAAqB,EAAE;AAElH,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,SAAS,KAAK,iBAAiB,QAAQ,QAAQ,OAAO,KAAK,QAAQ,eAAe,CAAC;AACxF,OAAK,+BAA+B;AACpC,OAAK,kBAAkB,MAAM,OAAO,MAAM,KAAK;AAE/C,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,SAAO,KAAK,WAAW,MAAM,oBAAoB;AACnD;AAIA,KAAK,uBAAuB,SAAS,MAAM,QAAQ,SAAS,SAAS;AACnE,MAAI,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU,mBAAmB,KAAK;AAEtF,OAAK,WAAW,cAAc,SAAS,KAAK,IAAI,WAAW;AAC3D,OAAK,aAAa,IAAI;AACtB,MAAI,KAAK,QAAQ,eAAe,GAAG;AAAE,SAAK,QAAQ,CAAC,CAAC;AAAA,EAAS;AAE7D,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AAErB,OAAK,SAAS,KAAK,iBAAiB,QAAQ,IAAI;AAChD,OAAK,kBAAkB,MAAM,MAAM,OAAO,OAAO;AAEjD,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,SAAO,KAAK,WAAW,MAAM,yBAAyB;AACxD;AAIA,KAAK,oBAAoB,SAAS,MAAM,iBAAiB,UAAU,SAAS;AAC1E,MAAI,eAAe,mBAAmB,KAAK,SAAS,QAAQ;AAC5D,MAAI,YAAY,KAAK,QAAQ,YAAY;AAEzC,MAAI,cAAc;AAChB,SAAK,OAAO,KAAK,iBAAiB,OAAO;AACzC,SAAK,aAAa;AAClB,SAAK,YAAY,MAAM,KAAK;AAAA,EAC9B,OAAO;AACL,QAAI,YAAY,KAAK,QAAQ,eAAe,KAAK,CAAC,KAAK,kBAAkB,KAAK,MAAM;AACpF,QAAI,CAAC,aAAa,WAAW;AAC3B,kBAAY,KAAK,gBAAgB,KAAK,GAAG;AAIzC,UAAI,aAAa,WACf;AAAE,aAAK,iBAAiB,KAAK,OAAO,2EAA2E;AAAA,MAAG;AAAA,IACtH;AAGA,QAAI,YAAY,KAAK;AACrB,SAAK,SAAS,CAAC;AACf,QAAI,WAAW;AAAE,WAAK,SAAS;AAAA,IAAM;AAIrC,SAAK,YAAY,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,mBAAmB,CAAC,YAAY,KAAK,kBAAkB,KAAK,MAAM,CAAC;AAEvH,QAAI,KAAK,UAAU,KAAK,IAAI;AAAE,WAAK,gBAAgB,KAAK,IAAI,YAAY;AAAA,IAAG;AAC3E,SAAK,OAAO,KAAK,WAAW,OAAO,QAAW,aAAa,CAAC,SAAS;AACrE,SAAK,aAAa;AAClB,SAAK,uBAAuB,KAAK,KAAK,IAAI;AAC1C,SAAK,SAAS;AAAA,EAChB;AACA,OAAK,UAAU;AACjB;AAEA,KAAK,oBAAoB,SAAS,QAAQ;AACxC,WAAS,IAAI,GAAG,OAAO,QAAQ,IAAI,KAAK,QAAQ,KAAK,GACnD;AACA,QAAI,QAAQ,KAAK,CAAC;AAElB,QAAI,MAAM,SAAS,cAAc;AAAE,aAAO;AAAA,IAC5C;AAAA,EAAE;AACF,SAAO;AACT;AAKA,KAAK,cAAc,SAAS,MAAM,iBAAiB;AACjD,MAAI,WAAW,uBAAO,OAAO,IAAI;AACjC,WAAS,IAAI,GAAG,OAAO,KAAK,QAAQ,IAAI,KAAK,QAAQ,KAAK,GACxD;AACA,QAAI,QAAQ,KAAK,CAAC;AAElB,SAAK,sBAAsB,OAAO,UAAU,kBAAkB,OAAO,QAAQ;AAAA,EAC/E;AACF;AAQA,KAAK,gBAAgB,SAAS,OAAO,oBAAoB,YAAY,wBAAwB;AAC3F,MAAI,OAAO,CAAC,GAAG,QAAQ;AACvB,SAAO,CAAC,KAAK,IAAI,KAAK,GAAG;AACvB,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,sBAAsB,KAAK,mBAAmB,KAAK,GAAG;AAAE;AAAA,MAAM;AAAA,IACpE,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,QAAI,MAAO;AACX,QAAI,cAAc,KAAK,SAAS,QAAQ,OACtC;AAAE,YAAM;AAAA,IAAM,WACP,KAAK,SAAS,QAAQ,UAAU;AACvC,YAAM,KAAK,YAAY,sBAAsB;AAC7C,UAAI,0BAA0B,KAAK,SAAS,QAAQ,SAAS,uBAAuB,gBAAgB,GAClG;AAAE,+BAAuB,gBAAgB,KAAK;AAAA,MAAO;AAAA,IACzD,OAAO;AACL,YAAM,KAAK,iBAAiB,OAAO,sBAAsB;AAAA,IAC3D;AACA,SAAK,KAAK,GAAG;AAAA,EACf;AACA,SAAO;AACT;AAEA,KAAK,kBAAkB,SAASA,MAAK;AACnC,MAAI,QAAQA,KAAI;AAChB,MAAI,MAAMA,KAAI;AACd,MAAI,OAAOA,KAAI;AAEf,MAAI,KAAK,eAAe,SAAS,SAC/B;AAAE,SAAK,iBAAiB,OAAO,qDAAqD;AAAA,EAAG;AACzF,MAAI,KAAK,WAAW,SAAS,SAC3B;AAAE,SAAK,iBAAiB,OAAO,2DAA2D;AAAA,EAAG;AAC/F,MAAI,EAAE,KAAK,iBAAiB,EAAE,QAAQ,cAAc,SAAS,aAC3D;AAAE,SAAK,iBAAiB,OAAO,mDAAmD;AAAA,EAAG;AACvF,MAAI,KAAK,uBAAuB,SAAS,eAAe,SAAS,UAC/D;AAAE,SAAK,MAAM,OAAQ,gBAAgB,OAAO,uCAAwC;AAAA,EAAG;AACzF,MAAI,KAAK,SAAS,KAAK,IAAI,GACzB;AAAE,SAAK,MAAM,OAAQ,yBAAyB,OAAO,GAAI;AAAA,EAAG;AAC9D,MAAI,KAAK,QAAQ,cAAc,KAC7B,KAAK,MAAM,MAAM,OAAO,GAAG,EAAE,QAAQ,IAAI,MAAM,IAAI;AAAE;AAAA,EAAO;AAC9D,MAAI,KAAK,KAAK,SAAS,KAAK,sBAAsB,KAAK;AACvD,MAAI,GAAG,KAAK,IAAI,GAAG;AACjB,QAAI,CAAC,KAAK,WAAW,SAAS,SAC5B;AAAE,WAAK,iBAAiB,OAAO,sDAAsD;AAAA,IAAG;AAC1F,SAAK,iBAAiB,OAAQ,kBAAkB,OAAO,eAAgB;AAAA,EACzE;AACF;AAMA,KAAK,aAAa,SAAS,SAAS;AAClC,MAAI,OAAO,KAAK,eAAe;AAC/B,OAAK,KAAK,CAAC,CAAC,OAAO;AACnB,OAAK,WAAW,MAAM,YAAY;AAClC,MAAI,CAAC,SAAS;AACZ,SAAK,gBAAgB,IAAI;AACzB,QAAI,KAAK,SAAS,WAAW,CAAC,KAAK,eACjC;AAAE,WAAK,gBAAgB,KAAK;AAAA,IAAO;AAAA,EACvC;AACA,SAAO;AACT;AAEA,KAAK,iBAAiB,WAAW;AAC/B,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,SAAK,OAAO,KAAK;AAAA,EACnB,WAAW,KAAK,KAAK,SAAS;AAC5B,SAAK,OAAO,KAAK,KAAK;AAMtB,SAAK,KAAK,SAAS,WAAW,KAAK,SAAS,gBACzC,KAAK,eAAe,KAAK,eAAe,KAAK,KAAK,MAAM,WAAW,KAAK,YAAY,MAAM,KAAK;AAChG,WAAK,QAAQ,IAAI;AAAA,IACnB;AACA,SAAK,OAAO,QAAQ;AAAA,EACtB,OAAO;AACL,SAAK,WAAW;AAAA,EAClB;AACA,SAAO;AACT;AAEA,KAAK,oBAAoB,WAAW;AAClC,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,KAAK,SAAS,QAAQ,WAAW;AACnC,SAAK,OAAO,KAAK;AAAA,EACnB,OAAO;AACL,SAAK,WAAW;AAAA,EAClB;AACA,OAAK,KAAK;AACV,OAAK,WAAW,MAAM,mBAAmB;AAGzC,MAAI,KAAK,QAAQ,oBAAoB;AACnC,QAAI,KAAK,iBAAiB,WAAW,GAAG;AACtC,WAAK,MAAM,KAAK,OAAQ,qBAAsB,KAAK,OAAQ,0CAA2C;AAAA,IACxG,OAAO;AACL,WAAK,iBAAiB,KAAK,iBAAiB,SAAS,CAAC,EAAE,KAAK,KAAK,IAAI;AAAA,IACxE;AAAA,EACF;AAEA,SAAO;AACT;AAIA,KAAK,aAAa,SAAS,SAAS;AAClC,MAAI,CAAC,KAAK,UAAU;AAAE,SAAK,WAAW,KAAK;AAAA,EAAO;AAElD,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,MAAI,KAAK,SAAS,QAAQ,QAAQ,KAAK,mBAAmB,KAAM,KAAK,SAAS,QAAQ,QAAQ,CAAC,KAAK,KAAK,YAAa;AACpH,SAAK,WAAW;AAChB,SAAK,WAAW;AAAA,EAClB,OAAO;AACL,SAAK,WAAW,KAAK,IAAI,QAAQ,IAAI;AACrC,SAAK,WAAW,KAAK,iBAAiB,OAAO;AAAA,EAC/C;AACA,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,aAAa,SAAS,SAAS;AAClC,MAAI,CAAC,KAAK,UAAU;AAAE,SAAK,WAAW,KAAK;AAAA,EAAO;AAElD,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,OAAK,WAAW,KAAK,gBAAgB,MAAM,MAAM,OAAO,OAAO;AAC/D,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,IAAI,OAAO,OAAO;AAQlB,KAAK,QAAQ,SAAS,KAAK,SAAS;AAClC,MAAI,MAAM,YAAY,KAAK,OAAO,GAAG;AACrC,aAAW,OAAO,IAAI,OAAO,MAAM,IAAI,SAAS;AAChD,MAAI,KAAK,YAAY;AACnB,eAAW,SAAS,KAAK;AAAA,EAC3B;AACA,MAAI,MAAM,IAAI,YAAY,OAAO;AACjC,MAAI,MAAM;AAAK,MAAI,MAAM;AAAK,MAAI,WAAW,KAAK;AAClD,QAAM;AACR;AAEA,KAAK,mBAAmB,KAAK;AAE7B,KAAK,cAAc,WAAW;AAC5B,MAAI,KAAK,QAAQ,WAAW;AAC1B,WAAO,IAAI,SAAS,KAAK,SAAS,KAAK,MAAM,KAAK,SAAS;AAAA,EAC7D;AACF;AAEA,IAAI,OAAO,OAAO;AAElB,IAAI,QAAQ,SAASK,OAAM,OAAO;AAChC,OAAK,QAAQ;AAEb,OAAK,MAAM,CAAC;AAEZ,OAAK,UAAU,CAAC;AAEhB,OAAK,YAAY,CAAC;AACpB;AAIA,KAAK,aAAa,SAAS,OAAO;AAChC,OAAK,WAAW,KAAK,IAAI,MAAM,KAAK,CAAC;AACvC;AAEA,KAAK,YAAY,WAAW;AAC1B,OAAK,WAAW,IAAI;AACtB;AAKA,KAAK,6BAA6B,SAAS,OAAO;AAChD,SAAQ,MAAM,QAAQ,kBAAmB,CAAC,KAAK,YAAa,MAAM,QAAQ;AAC5E;AAEA,KAAK,cAAc,SAAS,MAAM,aAAa,KAAK;AAClD,MAAI,aAAa;AACjB,MAAI,gBAAgB,cAAc;AAChC,QAAI,QAAQ,KAAK,aAAa;AAC9B,iBAAa,MAAM,QAAQ,QAAQ,IAAI,IAAI,MAAM,MAAM,UAAU,QAAQ,IAAI,IAAI,MAAM,MAAM,IAAI,QAAQ,IAAI,IAAI;AACjH,UAAM,QAAQ,KAAK,IAAI;AACvB,QAAI,KAAK,YAAa,MAAM,QAAQ,WAClC;AAAE,aAAO,KAAK,iBAAiB,IAAI;AAAA,IAAG;AAAA,EAC1C,WAAW,gBAAgB,mBAAmB;AAC5C,QAAI,UAAU,KAAK,aAAa;AAChC,YAAQ,QAAQ,KAAK,IAAI;AAAA,EAC3B,WAAW,gBAAgB,eAAe;AACxC,QAAI,UAAU,KAAK,aAAa;AAChC,QAAI,KAAK,qBACP;AAAE,mBAAa,QAAQ,QAAQ,QAAQ,IAAI,IAAI;AAAA,IAAI,OAEnD;AAAE,mBAAa,QAAQ,QAAQ,QAAQ,IAAI,IAAI,MAAM,QAAQ,IAAI,QAAQ,IAAI,IAAI;AAAA,IAAI;AACvF,YAAQ,UAAU,KAAK,IAAI;AAAA,EAC7B,OAAO;AACL,aAAS,IAAI,KAAK,WAAW,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;AACpD,UAAI,UAAU,KAAK,WAAW,CAAC;AAC/B,UAAI,QAAQ,QAAQ,QAAQ,IAAI,IAAI,MAAM,EAAG,QAAQ,QAAQ,sBAAuB,QAAQ,QAAQ,CAAC,MAAM,SACvG,CAAC,KAAK,2BAA2B,OAAO,KAAK,QAAQ,UAAU,QAAQ,IAAI,IAAI,IAAI;AACrF,qBAAa;AACb;AAAA,MACF;AACA,cAAQ,IAAI,KAAK,IAAI;AACrB,UAAI,KAAK,YAAa,QAAQ,QAAQ,WACpC;AAAE,eAAO,KAAK,iBAAiB,IAAI;AAAA,MAAG;AACxC,UAAI,QAAQ,QAAQ,WAAW;AAAE;AAAA,MAAM;AAAA,IACzC;AAAA,EACF;AACA,MAAI,YAAY;AAAE,SAAK,iBAAiB,KAAM,iBAAiB,OAAO,6BAA8B;AAAA,EAAG;AACzG;AAEA,KAAK,mBAAmB,SAAS,IAAI;AAEnC,MAAI,KAAK,WAAW,CAAC,EAAE,QAAQ,QAAQ,GAAG,IAAI,MAAM,MAChD,KAAK,WAAW,CAAC,EAAE,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI;AAClD,SAAK,iBAAiB,GAAG,IAAI,IAAI;AAAA,EACnC;AACF;AAEA,KAAK,eAAe,WAAW;AAC7B,SAAO,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC;AACnD;AAEA,KAAK,kBAAkB,WAAW;AAChC,WAAS,IAAI,KAAK,WAAW,SAAS,KAAI,KAAK;AAC7C,QAAI,QAAQ,KAAK,WAAW,CAAC;AAC7B,QAAI,MAAM,SAAS,YAAY,yBAAyB,2BAA2B;AAAE,aAAO;AAAA,IAAM;AAAA,EACpG;AACF;AAGA,KAAK,mBAAmB,WAAW;AACjC,WAAS,IAAI,KAAK,WAAW,SAAS,KAAI,KAAK;AAC7C,QAAI,QAAQ,KAAK,WAAW,CAAC;AAC7B,QAAI,MAAM,SAAS,YAAY,yBAAyB,6BACpD,EAAE,MAAM,QAAQ,cAAc;AAAE,aAAO;AAAA,IAAM;AAAA,EACnD;AACF;AAEA,IAAI,OAAO,SAASC,MAAKJ,SAAQ,KAAK,KAAK;AACzC,OAAK,OAAO;AACZ,OAAK,QAAQ;AACb,OAAK,MAAM;AACX,MAAIA,QAAO,QAAQ,WACjB;AAAE,SAAK,MAAM,IAAI,eAAeA,SAAQ,GAAG;AAAA,EAAG;AAChD,MAAIA,QAAO,QAAQ,kBACjB;AAAE,SAAK,aAAaA,QAAO,QAAQ;AAAA,EAAkB;AACvD,MAAIA,QAAO,QAAQ,QACjB;AAAE,SAAK,QAAQ,CAAC,KAAK,CAAC;AAAA,EAAG;AAC7B;AAIA,IAAI,OAAO,OAAO;AAElB,KAAK,YAAY,WAAW;AAC1B,SAAO,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,QAAQ;AACjD;AAEA,KAAK,cAAc,SAAS,KAAK,KAAK;AACpC,SAAO,IAAI,KAAK,MAAM,KAAK,GAAG;AAChC;AAIA,SAAS,aAAa,MAAM,MAAM,KAAK,KAAK;AAC1C,OAAK,OAAO;AACZ,OAAK,MAAM;AACX,MAAI,KAAK,QAAQ,WACf;AAAE,SAAK,IAAI,MAAM;AAAA,EAAK;AACxB,MAAI,KAAK,QAAQ,QACf;AAAE,SAAK,MAAM,CAAC,IAAI;AAAA,EAAK;AACzB,SAAO;AACT;AAEA,KAAK,aAAa,SAAS,MAAM,MAAM;AACrC,SAAO,aAAa,KAAK,MAAM,MAAM,MAAM,KAAK,YAAY,KAAK,aAAa;AAChF;AAIA,KAAK,eAAe,SAAS,MAAM,MAAM,KAAK,KAAK;AACjD,SAAO,aAAa,KAAK,MAAM,MAAM,MAAM,KAAK,GAAG;AACrD;AAEA,KAAK,WAAW,SAAS,MAAM;AAC7B,MAAI,UAAU,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,QAAQ;AACtD,WAAS,QAAQ,MAAM;AAAE,YAAQ,IAAI,IAAI,KAAK,IAAI;AAAA,EAAG;AACrD,SAAO;AACT;AAGA,IAAI,6BAA6B;AAOjC,IAAI,wBAAwB;AAC5B,IAAI,yBAAyB,wBAAwB;AACrD,IAAI,yBAAyB;AAC7B,IAAI,yBAAyB,yBAAyB;AACtD,IAAI,yBAAyB;AAC7B,IAAI,yBAAyB;AAE7B,IAAI,0BAA0B;AAAA,EAC5B,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AACN;AAGA,IAAI,kCAAkC;AAEtC,IAAI,mCAAmC;AAAA,EACrC,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AACN;AAGA,IAAI,+BAA+B;AAGnC,IAAI,oBAAoB;AACxB,IAAI,qBAAqB,oBAAoB;AAC7C,IAAI,qBAAqB,qBAAqB;AAC9C,IAAI,qBAAqB,qBAAqB;AAC9C,IAAI,qBAAqB,qBAAqB;AAC9C,IAAI,qBAAqB,qBAAqB,MAAM;AAEpD,IAAI,sBAAsB;AAAA,EACxB,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AACN;AAEA,IAAI,OAAO,CAAC;AACZ,SAAS,iBAAiB,aAAa;AACrC,MAAI,IAAI,KAAK,WAAW,IAAI;AAAA,IAC1B,QAAQ,YAAY,wBAAwB,WAAW,IAAI,MAAM,4BAA4B;AAAA,IAC7F,iBAAiB,YAAY,iCAAiC,WAAW,CAAC;AAAA,IAC1E,WAAW;AAAA,MACT,kBAAkB,YAAY,4BAA4B;AAAA,MAC1D,QAAQ,YAAY,oBAAoB,WAAW,CAAC;AAAA,IACtD;AAAA,EACF;AACA,IAAE,UAAU,oBAAoB,EAAE,UAAU;AAE5C,IAAE,UAAU,KAAK,EAAE,UAAU;AAC7B,IAAE,UAAU,KAAK,EAAE,UAAU;AAC7B,IAAE,UAAU,MAAM,EAAE,UAAU;AAChC;AAEA,KAAS,IAAI,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACnE,gBAAc,KAAK,CAAC;AAExB,mBAAiB,WAAW;AAC9B;AAHM;AADG;AAAO;AAMhB,IAAI,OAAO,OAAO;AAIlB,IAAI,WAAW,SAASK,UAAS,QAAQ,MAAM;AAE7C,OAAK,SAAS;AAEd,OAAK,OAAO,QAAQ;AACtB;AAEA,SAAS,UAAU,gBAAgB,SAAS,cAAe,KAAK;AAG9D,WAAS,OAAO,MAAM,MAAM,OAAO,KAAK,QAAQ;AAC9C,aAAS,QAAQ,KAAK,OAAO,QAAQ,MAAM,QAAQ;AACjD,UAAI,KAAK,SAAS,MAAM,QAAQ,SAAS,OAAO;AAAE,eAAO;AAAA,MAAK;AAAA,IAChE;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,UAAU,UAAU,SAAS,UAAW;AAC/C,SAAO,IAAI,SAAS,KAAK,QAAQ,KAAK,IAAI;AAC5C;AAEA,IAAI,wBAAwB,SAASC,uBAAsBN,SAAQ;AACjE,OAAK,SAASA;AACd,OAAK,aAAa,SAASA,QAAO,QAAQ,eAAe,IAAI,OAAO,OAAOA,QAAO,QAAQ,eAAe,IAAI,MAAM,OAAOA,QAAO,QAAQ,eAAe,KAAK,MAAM,OAAOA,QAAO,QAAQ,eAAe,KAAK,MAAM;AACnN,OAAK,oBAAoB,KAAKA,QAAO,QAAQ,eAAe,KAAK,KAAKA,QAAO,QAAQ,WAAW;AAChG,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,UAAU;AACf,OAAK,UAAU;AACf,OAAK,UAAU;AACf,OAAK,MAAM;AACX,OAAK,eAAe;AACpB,OAAK,kBAAkB;AACvB,OAAK,8BAA8B;AACnC,OAAK,qBAAqB;AAC1B,OAAK,mBAAmB;AACxB,OAAK,aAAa,uBAAO,OAAO,IAAI;AACpC,OAAK,qBAAqB,CAAC;AAC3B,OAAK,WAAW;AAClB;AAEA,sBAAsB,UAAU,QAAQ,SAAS,MAAO,OAAO,SAAS,OAAO;AAC7E,MAAI,cAAc,MAAM,QAAQ,GAAG,MAAM;AACzC,MAAI,UAAU,MAAM,QAAQ,GAAG,MAAM;AACrC,OAAK,QAAQ,QAAQ;AACrB,OAAK,SAAS,UAAU;AACxB,OAAK,QAAQ;AACb,MAAI,eAAe,KAAK,OAAO,QAAQ,eAAe,IAAI;AACxD,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,UAAU;AAAA,EACjB,OAAO;AACL,SAAK,UAAU,WAAW,KAAK,OAAO,QAAQ,eAAe;AAC7D,SAAK,UAAU;AACf,SAAK,UAAU,WAAW,KAAK,OAAO,QAAQ,eAAe;AAAA,EAC/D;AACF;AAEA,sBAAsB,UAAU,QAAQ,SAAS,MAAO,SAAS;AAC/D,OAAK,OAAO,iBAAiB,KAAK,OAAQ,kCAAmC,KAAK,SAAU,QAAQ,OAAQ;AAC9G;AAIA,sBAAsB,UAAU,KAAK,SAAS,GAAI,GAAG,QAAQ;AACzD,MAAK,WAAW,OAAS,UAAS;AAEpC,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,EAAE;AACV,MAAI,KAAK,GAAG;AACV,WAAO;AAAA,EACT;AACA,MAAI,IAAI,EAAE,WAAW,CAAC;AACtB,MAAI,EAAE,UAAU,KAAK,YAAY,KAAK,SAAU,KAAK,SAAU,IAAI,KAAK,GAAG;AACzE,WAAO;AAAA,EACT;AACA,MAAI,OAAO,EAAE,WAAW,IAAI,CAAC;AAC7B,SAAO,QAAQ,SAAU,QAAQ,SAAU,KAAK,MAAM,OAAO,WAAY;AAC3E;AAEA,sBAAsB,UAAU,YAAY,SAAS,UAAW,GAAG,QAAQ;AACvE,MAAK,WAAW,OAAS,UAAS;AAEpC,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,EAAE;AACV,MAAI,KAAK,GAAG;AACV,WAAO;AAAA,EACT;AACA,MAAI,IAAI,EAAE,WAAW,CAAC,GAAG;AACzB,MAAI,EAAE,UAAU,KAAK,YAAY,KAAK,SAAU,KAAK,SAAU,IAAI,KAAK,MACnE,OAAO,EAAE,WAAW,IAAI,CAAC,KAAK,SAAU,OAAO,OAAQ;AAC1D,WAAO,IAAI;AAAA,EACb;AACA,SAAO,IAAI;AACb;AAEA,sBAAsB,UAAU,UAAU,SAAS,QAAS,QAAQ;AAChE,MAAK,WAAW,OAAS,UAAS;AAEpC,SAAO,KAAK,GAAG,KAAK,KAAK,MAAM;AACjC;AAEA,sBAAsB,UAAU,YAAY,SAAS,UAAW,QAAQ;AACpE,MAAK,WAAW,OAAS,UAAS;AAEpC,SAAO,KAAK,GAAG,KAAK,UAAU,KAAK,KAAK,MAAM,GAAG,MAAM;AACzD;AAEA,sBAAsB,UAAU,UAAU,SAAS,QAAS,QAAQ;AAChE,MAAK,WAAW,OAAS,UAAS;AAEpC,OAAK,MAAM,KAAK,UAAU,KAAK,KAAK,MAAM;AAC5C;AAEA,sBAAsB,UAAU,MAAM,SAAS,IAAK,IAAI,QAAQ;AAC5D,MAAK,WAAW,OAAS,UAAS;AAEpC,MAAI,KAAK,QAAQ,MAAM,MAAM,IAAI;AAC/B,SAAK,QAAQ,MAAM;AACnB,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,sBAAsB,UAAU,WAAW,SAAS,SAAU,KAAK,QAAQ;AACvE,MAAK,WAAW,OAAS,UAAS;AAEpC,MAAI,MAAM,KAAK;AACf,WAAS,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK,QAAQ,KAAK,GAAG;AACnD,QAAI,KAAK,KAAK,CAAC;AAEb,QAAIO,WAAU,KAAK,GAAG,KAAK,MAAM;AACnC,QAAIA,aAAY,MAAMA,aAAY,IAAI;AACpC,aAAO;AAAA,IACT;AACA,UAAM,KAAK,UAAU,KAAK,MAAM;AAAA,EAClC;AACA,OAAK,MAAM;AACX,SAAO;AACT;AAQA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,aAAa,MAAM;AACvB,MAAI,QAAQ,MAAM;AAElB,MAAI,IAAI;AACR,MAAI,IAAI;AAER,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,OAAO,MAAM,OAAO,CAAC;AACzB,QAAI,WAAW,QAAQ,IAAI,MAAM,IAAI;AACnC,WAAK,MAAM,MAAM,OAAO,iCAAiC;AAAA,IAC3D;AACA,QAAI,MAAM,QAAQ,MAAM,IAAI,CAAC,IAAI,IAAI;AACnC,WAAK,MAAM,MAAM,OAAO,mCAAmC;AAAA,IAC7D;AACA,QAAI,SAAS,KAAK;AAAE,UAAI;AAAA,IAAM;AAC9B,QAAI,SAAS,KAAK;AAAE,UAAI;AAAA,IAAM;AAAA,EAChC;AACA,MAAI,KAAK,QAAQ,eAAe,MAAM,KAAK,GAAG;AAC5C,SAAK,MAAM,MAAM,OAAO,iCAAiC;AAAA,EAC3D;AACF;AAEA,SAAS,QAAQ,KAAK;AACpB,WAAS,KAAK,KAAK;AAAE,WAAO;AAAA,EAAK;AACjC,SAAO;AACT;AAQA,KAAK,wBAAwB,SAAS,OAAO;AAC3C,OAAK,eAAe,KAAK;AAOzB,MAAI,CAAC,MAAM,WAAW,KAAK,QAAQ,eAAe,KAAK,QAAQ,MAAM,UAAU,GAAG;AAChF,UAAM,UAAU;AAChB,SAAK,eAAe,KAAK;AAAA,EAC3B;AACF;AAGA,KAAK,iBAAiB,SAAS,OAAO;AACpC,QAAM,MAAM;AACZ,QAAM,eAAe;AACrB,QAAM,kBAAkB;AACxB,QAAM,8BAA8B;AACpC,QAAM,qBAAqB;AAC3B,QAAM,mBAAmB;AACzB,QAAM,aAAa,uBAAO,OAAO,IAAI;AACrC,QAAM,mBAAmB,SAAS;AAClC,QAAM,WAAW;AAEjB,OAAK,mBAAmB,KAAK;AAE7B,MAAI,MAAM,QAAQ,MAAM,OAAO,QAAQ;AAErC,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,YAAM,MAAM,eAAe;AAAA,IAC7B;AACA,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AACtD,YAAM,MAAM,0BAA0B;AAAA,IACxC;AAAA,EACF;AACA,MAAI,MAAM,mBAAmB,MAAM,oBAAoB;AACrD,UAAM,MAAM,gBAAgB;AAAA,EAC9B;AACA,WAAS,IAAI,GAAG,OAAO,MAAM,oBAAoB,IAAI,KAAK,QAAQ,KAAK,GAAG;AACxE,QAAI,OAAO,KAAK,CAAC;AAEjB,QAAI,CAAC,MAAM,WAAW,IAAI,GAAG;AAC3B,YAAM,MAAM,kCAAkC;AAAA,IAChD;AAAA,EACF;AACF;AAGA,KAAK,qBAAqB,SAAS,OAAO;AACxC,MAAI,mBAAmB,KAAK,QAAQ,eAAe;AACnD,MAAI,kBAAkB;AAAE,UAAM,WAAW,IAAI,SAAS,MAAM,UAAU,IAAI;AAAA,EAAG;AAC7E,OAAK,mBAAmB,KAAK;AAC7B,SAAO,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC9B,QAAI,kBAAkB;AAAE,YAAM,WAAW,MAAM,SAAS,QAAQ;AAAA,IAAG;AACnE,SAAK,mBAAmB,KAAK;AAAA,EAC/B;AACA,MAAI,kBAAkB;AAAE,UAAM,WAAW,MAAM,SAAS;AAAA,EAAQ;AAGhE,MAAI,KAAK,qBAAqB,OAAO,IAAI,GAAG;AAC1C,UAAM,MAAM,mBAAmB;AAAA,EACjC;AACA,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,UAAM,MAAM,0BAA0B;AAAA,EACxC;AACF;AAGA,KAAK,qBAAqB,SAAS,OAAO;AACxC,SAAO,MAAM,MAAM,MAAM,OAAO,UAAU,KAAK,eAAe,KAAK,GAAG;AAAA,EAAC;AACzE;AAGA,KAAK,iBAAiB,SAAS,OAAO;AACpC,MAAI,KAAK,oBAAoB,KAAK,GAAG;AAInC,QAAI,MAAM,+BAA+B,KAAK,qBAAqB,KAAK,GAAG;AAEzE,UAAI,MAAM,SAAS;AACjB,cAAM,MAAM,oBAAoB;AAAA,MAClC;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,UAAU,KAAK,eAAe,KAAK,IAAI,KAAK,uBAAuB,KAAK,GAAG;AACnF,SAAK,qBAAqB,KAAK;AAC/B,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,QAAQ,MAAM;AAClB,QAAM,8BAA8B;AAGpC,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KAAK,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AACtD,WAAO;AAAA,EACT;AAGA,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AACtD,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AAGA,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KAAK,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AACtD,QAAI,aAAa;AACjB,QAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,mBAAa,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY;AAAA,IACrC;AACA,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AACtD,WAAK,mBAAmB,KAAK;AAC7B,UAAI,CAAC,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,GAAG;AAC5B,cAAM,MAAM,oBAAoB;AAAA,MAClC;AACA,YAAM,8BAA8B,CAAC;AACrC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,MAAM;AACZ,SAAO;AACT;AAGA,KAAK,uBAAuB,SAAS,OAAO,SAAS;AACnD,MAAK,YAAY,OAAS,WAAU;AAEpC,MAAI,KAAK,2BAA2B,OAAO,OAAO,GAAG;AACnD,UAAM;AAAA,MAAI;AAAA;AAAA,IAAY;AACtB,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,6BAA6B,SAAS,OAAO,SAAS;AACzD,SACE,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,KAAK,2BAA2B,OAAO,OAAO;AAElD;AACA,KAAK,6BAA6B,SAAS,OAAO,SAAS;AACzD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,MAAM,GAAG,MAAM;AACnB,QAAI,KAAK,wBAAwB,KAAK,GAAG;AACvC,YAAM,MAAM;AACZ,UAAI,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,KAAK,KAAK,wBAAwB,KAAK,GAAG;AAClE,cAAM,MAAM;AAAA,MACd;AACA,UAAI,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,GAAG;AAE3B,YAAI,QAAQ,MAAM,MAAM,OAAO,CAAC,SAAS;AACvC,gBAAM,MAAM,uCAAuC;AAAA,QACrD;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,MAAM,WAAW,CAAC,SAAS;AAC7B,YAAM,MAAM,uBAAuB;AAAA,IACrC;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,iBAAiB,SAAS,OAAO;AACpC,SACE,KAAK,4BAA4B,KAAK,KACtC,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,KAAK,mCAAmC,KAAK,KAC7C,KAAK,yBAAyB,KAAK,KACnC,KAAK,2BAA2B,KAAK,KACrC,KAAK,yBAAyB,KAAK;AAEvC;AACA,KAAK,qCAAqC,SAAS,OAAO;AACxD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,qBAAqB,KAAK,GAAG;AACpC,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AACA,KAAK,6BAA6B,SAAS,OAAO;AAChD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,UAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,YAAI,eAAe,KAAK,oBAAoB,KAAK;AACjD,YAAI,YAAY,MAAM;AAAA,UAAI;AAAA;AAAA,QAAY;AACtC,YAAI,gBAAgB,WAAW;AAC7B,mBAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC5C,gBAAI,WAAW,aAAa,OAAO,CAAC;AACpC,gBAAI,aAAa,QAAQ,UAAU,IAAI,CAAC,IAAI,IAAI;AAC9C,oBAAM,MAAM,wCAAwC;AAAA,YACtD;AAAA,UACF;AACA,cAAI,WAAW;AACb,gBAAI,kBAAkB,KAAK,oBAAoB,KAAK;AACpD,gBAAI,CAAC,gBAAgB,CAAC,mBAAmB,MAAM,QAAQ,MAAM,IAAc;AACzE,oBAAM,MAAM,sCAAsC;AAAA,YACpD;AACA,qBAAS,MAAM,GAAG,MAAM,gBAAgB,QAAQ,OAAO;AACrD,kBAAI,aAAa,gBAAgB,OAAO,GAAG;AAC3C,kBACE,gBAAgB,QAAQ,YAAY,MAAM,CAAC,IAAI,MAC/C,aAAa,QAAQ,UAAU,IAAI,IACnC;AACA,sBAAM,MAAM,wCAAwC;AAAA,cACtD;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,GAAG;AAC3B,aAAK,mBAAmB,KAAK;AAC7B,YAAI,MAAM;AAAA,UAAI;AAAA;AAAA,QAAY,GAAG;AAC3B,iBAAO;AAAA,QACT;AACA,cAAM,MAAM,oBAAoB;AAAA,MAClC;AAAA,IACF;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AACA,KAAK,2BAA2B,SAAS,OAAO;AAC9C,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,WAAK,sBAAsB,KAAK;AAAA,IAClC,WAAW,MAAM,QAAQ,MAAM,IAAc;AAC3C,YAAM,MAAM,eAAe;AAAA,IAC7B;AACA,SAAK,mBAAmB,KAAK;AAC7B,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,YAAM,sBAAsB;AAC5B,aAAO;AAAA,IACT;AACA,UAAM,MAAM,oBAAoB;AAAA,EAClC;AACA,SAAO;AACT;AAIA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,YAAY;AAChB,MAAI,KAAK;AACT,UAAQ,KAAK,MAAM,QAAQ,OAAO,MAAM,4BAA4B,EAAE,GAAG;AACvE,iBAAa,kBAAkB,EAAE;AACjC,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO;AACT;AAGA,SAAS,4BAA4B,IAAI;AACvC,SAAO,OAAO,OAAgB,OAAO,OAAgB,OAAO;AAC9D;AAGA,KAAK,yBAAyB,SAAS,OAAO;AAC5C,SACE,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,KAAK,mCAAmC,KAAK,KAC7C,KAAK,yBAAyB,KAAK,KACnC,KAAK,2BAA2B,KAAK,KACrC,KAAK,yBAAyB,KAAK,KACnC,KAAK,kCAAkC,KAAK,KAC5C,KAAK,mCAAmC,KAAK;AAEjD;AAGA,KAAK,oCAAoC,SAAS,OAAO;AACvD,MAAI,KAAK,2BAA2B,OAAO,IAAI,GAAG;AAChD,UAAM,MAAM,mBAAmB;AAAA,EACjC;AACA,SAAO;AACT;AAGA,KAAK,4BAA4B,SAAS,OAAO;AAC/C,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,kBAAkB,EAAE,GAAG;AACzB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,SAAS,kBAAkB,IAAI;AAC7B,SACE,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,OAAO,MACP,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,MAAM,OAAgB,MAAM;AAEhC;AAIA,KAAK,8BAA8B,SAAS,OAAO;AACjD,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK;AACT,UAAQ,KAAK,MAAM,QAAQ,OAAO,MAAM,CAAC,kBAAkB,EAAE,GAAG;AAC9D,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,QAAQ;AACvB;AAGA,KAAK,qCAAqC,SAAS,OAAO;AACxD,MAAI,KAAK,MAAM,QAAQ;AACvB,MACE,OAAO,MACP,OAAO,MACP,EAAE,MAAM,MAAgB,MAAM,OAC9B,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,KACP;AACA,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,KAAK,wBAAwB,SAAS,OAAO;AAC3C,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,CAAC,KAAK,oBAAoB,KAAK,GAAG;AAAE,YAAM,MAAM,eAAe;AAAA,IAAG;AACtE,QAAI,mBAAmB,KAAK,QAAQ,eAAe;AACnD,QAAI,QAAQ,MAAM,WAAW,MAAM,eAAe;AAClD,QAAI,OAAO;AACT,UAAI,kBAAkB;AACpB,iBAAS,IAAI,GAAG,OAAO,OAAO,IAAI,KAAK,QAAQ,KAAK,GAAG;AACrD,cAAI,QAAQ,KAAK,CAAC;AAElB,cAAI,CAAC,MAAM,cAAc,MAAM,QAAQ,GACrC;AAAE,kBAAM,MAAM,8BAA8B;AAAA,UAAG;AAAA,QACnD;AAAA,MACF,OAAO;AACL,cAAM,MAAM,8BAA8B;AAAA,MAC5C;AAAA,IACF;AACA,QAAI,kBAAkB;AACpB,OAAC,UAAU,MAAM,WAAW,MAAM,eAAe,IAAI,CAAC,IAAI,KAAK,MAAM,QAAQ;AAAA,IAC/E,OAAO;AACL,YAAM,WAAW,MAAM,eAAe,IAAI;AAAA,IAC5C;AAAA,EACF;AACF;AAKA,KAAK,sBAAsB,SAAS,OAAO;AACzC,QAAM,kBAAkB;AACxB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,+BAA+B,KAAK,KAAK,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AACzE,aAAO;AAAA,IACT;AACA,UAAM,MAAM,4BAA4B;AAAA,EAC1C;AACA,SAAO;AACT;AAMA,KAAK,iCAAiC,SAAS,OAAO;AACpD,QAAM,kBAAkB;AACxB,MAAI,KAAK,gCAAgC,KAAK,GAAG;AAC/C,UAAM,mBAAmB,kBAAkB,MAAM,YAAY;AAC7D,WAAO,KAAK,+BAA+B,KAAK,GAAG;AACjD,YAAM,mBAAmB,kBAAkB,MAAM,YAAY;AAAA,IAC/D;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAOA,KAAK,kCAAkC,SAAS,OAAO;AACrD,MAAI,QAAQ,MAAM;AAClB,MAAI,SAAS,KAAK,QAAQ,eAAe;AACzC,MAAI,KAAK,MAAM,QAAQ,MAAM;AAC7B,QAAM,QAAQ,MAAM;AAEpB,MAAI,OAAO,MAAgB,KAAK,sCAAsC,OAAO,MAAM,GAAG;AACpF,SAAK,MAAM;AAAA,EACb;AACA,MAAI,wBAAwB,EAAE,GAAG;AAC/B,UAAM,eAAe;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,MAAM;AACZ,SAAO;AACT;AACA,SAAS,wBAAwB,IAAI;AACnC,SAAO,kBAAkB,IAAI,IAAI,KAAK,OAAO,MAAgB,OAAO;AACtE;AASA,KAAK,iCAAiC,SAAS,OAAO;AACpD,MAAI,QAAQ,MAAM;AAClB,MAAI,SAAS,KAAK,QAAQ,eAAe;AACzC,MAAI,KAAK,MAAM,QAAQ,MAAM;AAC7B,QAAM,QAAQ,MAAM;AAEpB,MAAI,OAAO,MAAgB,KAAK,sCAAsC,OAAO,MAAM,GAAG;AACpF,SAAK,MAAM;AAAA,EACb;AACA,MAAI,uBAAuB,EAAE,GAAG;AAC9B,UAAM,eAAe;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,MAAM;AACZ,SAAO;AACT;AACA,SAAS,uBAAuB,IAAI;AAClC,SAAO,iBAAiB,IAAI,IAAI,KAAK,OAAO,MAAgB,OAAO,MAAgB,OAAO,QAAuB,OAAO;AAC1H;AAGA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,MACE,KAAK,wBAAwB,KAAK,KAClC,KAAK,+BAA+B,KAAK,KACzC,KAAK,0BAA0B,KAAK,KACnC,MAAM,WAAW,KAAK,qBAAqB,KAAK,GACjD;AACA,WAAO;AAAA,EACT;AACA,MAAI,MAAM,SAAS;AAEjB,QAAI,MAAM,QAAQ,MAAM,IAAc;AACpC,YAAM,MAAM,wBAAwB;AAAA,IACtC;AACA,UAAM,MAAM,gBAAgB;AAAA,EAC9B;AACA,SAAO;AACT;AACA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK,wBAAwB,KAAK,GAAG;AACvC,QAAI,IAAI,MAAM;AACd,QAAI,MAAM,SAAS;AAEjB,UAAI,IAAI,MAAM,kBAAkB;AAC9B,cAAM,mBAAmB;AAAA,MAC3B;AACA,aAAO;AAAA,IACT;AACA,QAAI,KAAK,MAAM,oBAAoB;AACjC,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AACA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,oBAAoB,KAAK,GAAG;AACnC,YAAM,mBAAmB,KAAK,MAAM,eAAe;AACnD,aAAO;AAAA,IACT;AACA,UAAM,MAAM,yBAAyB;AAAA,EACvC;AACA,SAAO;AACT;AAGA,KAAK,4BAA4B,SAAS,OAAO;AAC/C,SACE,KAAK,wBAAwB,KAAK,KAClC,KAAK,yBAAyB,KAAK,KACnC,KAAK,eAAe,KAAK,KACzB,KAAK,4BAA4B,KAAK,KACtC,KAAK,sCAAsC,OAAO,KAAK,KACtD,CAAC,MAAM,WAAW,KAAK,oCAAoC,KAAK,KACjE,KAAK,yBAAyB,KAAK;AAEvC;AACA,KAAK,2BAA2B,SAAS,OAAO;AAC9C,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,wBAAwB,KAAK,GAAG;AACvC,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AACA,KAAK,iBAAiB,SAAS,OAAO;AACpC,MAAI,MAAM,QAAQ,MAAM,MAAgB,CAAC,eAAe,MAAM,UAAU,CAAC,GAAG;AAC1E,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,gBAAgB,EAAE,GAAG;AACvB,UAAM,eAAe,KAAK;AAC1B,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,SAAS,gBAAgB,IAAI;AAC3B,SACG,MAAM,MAAgB,MAAM,MAC5B,MAAM,MAAgB,MAAM;AAEjC;AAGA,KAAK,wCAAwC,SAAS,OAAO,QAAQ;AACnE,MAAK,WAAW,OAAS,UAAS;AAElC,MAAI,QAAQ,MAAM;AAClB,MAAI,UAAU,UAAU,MAAM;AAE9B,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,yBAAyB,OAAO,CAAC,GAAG;AAC3C,UAAI,OAAO,MAAM;AACjB,UAAI,WAAW,QAAQ,SAAU,QAAQ,OAAQ;AAC/C,YAAI,mBAAmB,MAAM;AAC7B,YAAI,MAAM;AAAA,UAAI;AAAA;AAAA,QAAY,KAAK,MAAM;AAAA,UAAI;AAAA;AAAA,QAAY,KAAK,KAAK,yBAAyB,OAAO,CAAC,GAAG;AACjG,cAAI,QAAQ,MAAM;AAClB,cAAI,SAAS,SAAU,SAAS,OAAQ;AACtC,kBAAM,gBAAgB,OAAO,SAAU,QAAS,QAAQ,SAAU;AAClE,mBAAO;AAAA,UACT;AAAA,QACF;AACA,cAAM,MAAM;AACZ,cAAM,eAAe;AAAA,MACvB;AACA,aAAO;AAAA,IACT;AACA,QACE,WACA,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KACtB,KAAK,oBAAoB,KAAK,KAC9B,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KACtB,eAAe,MAAM,YAAY,GACjC;AACA,aAAO;AAAA,IACT;AACA,QAAI,SAAS;AACX,YAAM,MAAM,wBAAwB;AAAA,IACtC;AACA,UAAM,MAAM;AAAA,EACd;AAEA,SAAO;AACT;AACA,SAAS,eAAe,IAAI;AAC1B,SAAO,MAAM,KAAK,MAAM;AAC1B;AAGA,KAAK,2BAA2B,SAAS,OAAO;AAC9C,MAAI,MAAM,SAAS;AACjB,QAAI,KAAK,0BAA0B,KAAK,GAAG;AACzC,aAAO;AAAA,IACT;AACA,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,YAAM,eAAe;AACrB,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,OAAO,OAAiB,CAAC,MAAM,WAAW,OAAO,MAAe;AAClE,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,QAAM,eAAe;AACrB,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,MAAM,MAAgB,MAAM,IAAc;AAC5C,OAAG;AACD,YAAM,eAAe,KAAK,MAAM,gBAAgB,KAAK;AACrD,YAAM,QAAQ;AAAA,IAChB,UAAU,KAAK,MAAM,QAAQ,MAAM,MAAgB,MAAM;AACzD,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAIA,IAAI,cAAc;AAClB,IAAI,YAAY;AAChB,IAAI,gBAAgB;AAGpB,KAAK,iCAAiC,SAAS,OAAO;AACpD,MAAI,KAAK,MAAM,QAAQ;AAEvB,MAAI,uBAAuB,EAAE,GAAG;AAC9B,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AAEA,MAAI,SAAS;AACb,MACE,MAAM,WACN,KAAK,QAAQ,eAAe,OAC1B,SAAS,OAAO,OAAiB,OAAO,MAC1C;AACA,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,QAAI;AACJ,QACE,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,MACrB,SAAS,KAAK,yCAAyC,KAAK,MAC7D,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GACtB;AACA,UAAI,UAAU,WAAW,eAAe;AAAE,cAAM,MAAM,uBAAuB;AAAA,MAAG;AAChF,aAAO;AAAA,IACT;AACA,UAAM,MAAM,uBAAuB;AAAA,EACrC;AAEA,SAAO;AACT;AAEA,SAAS,uBAAuB,IAAI;AAClC,SACE,OAAO,OACP,OAAO,MACP,OAAO,OACP,OAAO,MACP,OAAO,OACP,OAAO;AAEX;AAKA,KAAK,2CAA2C,SAAS,OAAO;AAC9D,MAAI,QAAQ,MAAM;AAGlB,MAAI,KAAK,8BAA8B,KAAK,KAAK,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AACxE,QAAI,OAAO,MAAM;AACjB,QAAI,KAAK,+BAA+B,KAAK,GAAG;AAC9C,UAAI,QAAQ,MAAM;AAClB,WAAK,2CAA2C,OAAO,MAAM,KAAK;AAClE,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,MAAM;AAGZ,MAAI,KAAK,yCAAyC,KAAK,GAAG;AACxD,QAAI,cAAc,MAAM;AACxB,WAAO,KAAK,0CAA0C,OAAO,WAAW;AAAA,EAC1E;AACA,SAAO;AACT;AAEA,KAAK,6CAA6C,SAAS,OAAO,MAAM,OAAO;AAC7E,MAAI,CAAC,OAAO,MAAM,kBAAkB,WAAW,IAAI,GACjD;AAAE,UAAM,MAAM,uBAAuB;AAAA,EAAG;AAC1C,MAAI,CAAC,MAAM,kBAAkB,UAAU,IAAI,EAAE,KAAK,KAAK,GACrD;AAAE,UAAM,MAAM,wBAAwB;AAAA,EAAG;AAC7C;AAEA,KAAK,4CAA4C,SAAS,OAAO,aAAa;AAC5E,MAAI,MAAM,kBAAkB,OAAO,KAAK,WAAW,GAAG;AAAE,WAAO;AAAA,EAAU;AACzE,MAAI,MAAM,WAAW,MAAM,kBAAkB,gBAAgB,KAAK,WAAW,GAAG;AAAE,WAAO;AAAA,EAAc;AACvG,QAAM,MAAM,uBAAuB;AACrC;AAIA,KAAK,gCAAgC,SAAS,OAAO;AACnD,MAAI,KAAK;AACT,QAAM,kBAAkB;AACxB,SAAO,+BAA+B,KAAK,MAAM,QAAQ,CAAC,GAAG;AAC3D,UAAM,mBAAmB,kBAAkB,EAAE;AAC7C,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,oBAAoB;AACnC;AAEA,SAAS,+BAA+B,IAAI;AAC1C,SAAO,gBAAgB,EAAE,KAAK,OAAO;AACvC;AAIA,KAAK,iCAAiC,SAAS,OAAO;AACpD,MAAI,KAAK;AACT,QAAM,kBAAkB;AACxB,SAAO,gCAAgC,KAAK,MAAM,QAAQ,CAAC,GAAG;AAC5D,UAAM,mBAAmB,kBAAkB,EAAE;AAC7C,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,oBAAoB;AACnC;AACA,SAAS,gCAAgC,IAAI;AAC3C,SAAO,+BAA+B,EAAE,KAAK,eAAe,EAAE;AAChE;AAIA,KAAK,2CAA2C,SAAS,OAAO;AAC9D,SAAO,KAAK,+BAA+B,KAAK;AAClD;AAGA,KAAK,2BAA2B,SAAS,OAAO;AAC9C,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,SAAS,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY;AACnC,QAAI,SAAS,KAAK,qBAAqB,KAAK;AAC5C,QAAI,CAAC,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GACzB;AAAE,YAAM,MAAM,8BAA8B;AAAA,IAAG;AACjD,QAAI,UAAU,WAAW,eACvB;AAAE,YAAM,MAAM,6CAA6C;AAAA,IAAG;AAChE,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAIA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,MAAI,MAAM,QAAQ,MAAM,IAAc;AAAE,WAAO;AAAA,EAAU;AACzD,MAAI,MAAM,SAAS;AAAE,WAAO,KAAK,0BAA0B,KAAK;AAAA,EAAE;AAClE,OAAK,2BAA2B,KAAK;AACrC,SAAO;AACT;AAIA,KAAK,6BAA6B,SAAS,OAAO;AAChD,SAAO,KAAK,oBAAoB,KAAK,GAAG;AACtC,QAAI,OAAO,MAAM;AACjB,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,KAAK,oBAAoB,KAAK,GAAG;AAC9D,UAAI,QAAQ,MAAM;AAClB,UAAI,MAAM,YAAY,SAAS,MAAM,UAAU,KAAK;AAClD,cAAM,MAAM,yBAAyB;AAAA,MACvC;AACA,UAAI,SAAS,MAAM,UAAU,MAAM,OAAO,OAAO;AAC/C,cAAM,MAAM,uCAAuC;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AACF;AAIA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,QAAQ,MAAM;AAElB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,sBAAsB,KAAK,GAAG;AACrC,aAAO;AAAA,IACT;AACA,QAAI,MAAM,SAAS;AAEjB,UAAI,OAAO,MAAM,QAAQ;AACzB,UAAI,SAAS,MAAgB,aAAa,IAAI,GAAG;AAC/C,cAAM,MAAM,sBAAsB;AAAA,MACpC;AACA,YAAM,MAAM,gBAAgB;AAAA,IAC9B;AACA,UAAM,MAAM;AAAA,EACd;AAEA,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,OAAO,IAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGA,KAAK,wBAAwB,SAAS,OAAO;AAC3C,MAAI,QAAQ,MAAM;AAElB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,UAAM,eAAe;AACrB,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,WAAW,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC5C,UAAM,eAAe;AACrB,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,MAAM,WAAW,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC7C,QAAI,KAAK,6BAA6B,KAAK,GAAG;AAC5C,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AAEA,SACE,KAAK,+BAA+B,KAAK,KACzC,KAAK,0BAA0B,KAAK;AAExC;AAMA,KAAK,4BAA4B,SAAS,OAAO;AAC/C,MAAI,SAAS,WAAW;AACxB,MAAI,KAAK,wBAAwB,KAAK,EAAG;AAAA,WAAW,YAAY,KAAK,0BAA0B,KAAK,GAAG;AACrG,QAAI,cAAc,eAAe;AAAE,eAAS;AAAA,IAAe;AAE3D,QAAI,QAAQ,MAAM;AAClB,WAAO,MAAM;AAAA,MAAS,CAAC,IAAM,EAAI;AAAA;AAAA,IAAU,GAAG;AAC5C,UACE,MAAM,QAAQ,MAAM,OACnB,YAAY,KAAK,0BAA0B,KAAK,IACjD;AACA,YAAI,cAAc,eAAe;AAAE,mBAAS;AAAA,QAAW;AACvD;AAAA,MACF;AACA,YAAM,MAAM,sCAAsC;AAAA,IACpD;AACA,QAAI,UAAU,MAAM,KAAK;AAAE,aAAO;AAAA,IAAO;AAEzC,WAAO,MAAM;AAAA,MAAS,CAAC,IAAM,EAAI;AAAA;AAAA,IAAU,GAAG;AAC5C,UAAI,KAAK,0BAA0B,KAAK,GAAG;AAAE;AAAA,MAAS;AACtD,YAAM,MAAM,sCAAsC;AAAA,IACpD;AACA,QAAI,UAAU,MAAM,KAAK;AAAE,aAAO;AAAA,IAAO;AAAA,EAC3C,OAAO;AACL,UAAM,MAAM,sCAAsC;AAAA,EACpD;AAEA,aAAS;AACP,QAAI,KAAK,wBAAwB,KAAK,GAAG;AAAE;AAAA,IAAS;AACpD,gBAAY,KAAK,0BAA0B,KAAK;AAChD,QAAI,CAAC,WAAW;AAAE,aAAO;AAAA,IAAO;AAChC,QAAI,cAAc,eAAe;AAAE,eAAS;AAAA,IAAe;AAAA,EAC7D;AACF;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK,4BAA4B,KAAK,GAAG;AAC3C,QAAI,OAAO,MAAM;AACjB,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,KAAK,4BAA4B,KAAK,GAAG;AACtE,UAAI,QAAQ,MAAM;AAClB,UAAI,SAAS,MAAM,UAAU,MAAM,OAAO,OAAO;AAC/C,cAAM,MAAM,uCAAuC;AAAA,MACrD;AACA,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,4BAA4B,SAAS,OAAO;AAC/C,MAAI,KAAK,4BAA4B,KAAK,GAAG;AAAE,WAAO;AAAA,EAAU;AAChE,SAAO,KAAK,iCAAiC,KAAK,KAAK,KAAK,sBAAsB,KAAK;AACzF;AAGA,KAAK,wBAAwB,SAAS,OAAO;AAC3C,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,SAAS,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY;AACnC,QAAI,SAAS,KAAK,qBAAqB,KAAK;AAC5C,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,UAAI,UAAU,WAAW,eAAe;AACtC,cAAM,MAAM,6CAA6C;AAAA,MAC3D;AACA,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,WAAW,KAAK,+BAA+B,KAAK;AACxD,QAAI,UAAU;AACZ,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,mCAAmC,SAAS,OAAO;AACtD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAS,CAAC,IAAM,GAAI;AAAA;AAAA,EAAU,GAAG;AACzC,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,UAAI,SAAS,KAAK,sCAAsC,KAAK;AAC7D,UAAI,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,GAAG;AAC3B,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AAEL,YAAM,MAAM,gBAAgB;AAAA,IAC9B;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,wCAAwC,SAAS,OAAO;AAC3D,MAAI,SAAS,KAAK,mBAAmB,KAAK;AAC1C,SAAO,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC9B,QAAI,KAAK,mBAAmB,KAAK,MAAM,eAAe;AAAE,eAAS;AAAA,IAAe;AAAA,EAClF;AACA,SAAO;AACT;AAIA,KAAK,qBAAqB,SAAS,OAAO;AACxC,MAAI,QAAQ;AACZ,SAAO,KAAK,4BAA4B,KAAK,GAAG;AAAE;AAAA,EAAS;AAC3D,SAAO,UAAU,IAAI,YAAY;AACnC;AAGA,KAAK,8BAA8B,SAAS,OAAO;AACjD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QACE,KAAK,0BAA0B,KAAK,KACpC,KAAK,qCAAqC,KAAK,GAC/C;AACA,aAAO;AAAA,IACT;AACA,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,YAAM,eAAe;AACrB,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AACZ,WAAO;AAAA,EACT;AACA,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,KAAK,KAAK,OAAO,MAAM,UAAU,KAAK,4CAA4C,EAAE,GAAG;AAAE,WAAO;AAAA,EAAM;AAC1G,MAAI,0BAA0B,EAAE,GAAG;AAAE,WAAO;AAAA,EAAM;AAClD,QAAM,QAAQ;AACd,QAAM,eAAe;AACrB,SAAO;AACT;AAGA,SAAS,4CAA4C,IAAI;AACvD,SACE,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,MAAM,MAAgB,MAAM,MAC5B,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,OAAO,MACP,OAAO,MACP,OAAO;AAEX;AAGA,SAAS,0BAA0B,IAAI;AACrC,SACE,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,MAAM,OAAgB,MAAM;AAEhC;AAGA,KAAK,uCAAuC,SAAS,OAAO;AAC1D,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,6BAA6B,EAAE,GAAG;AACpC,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,SAAS,6BAA6B,IAAI;AACxC,SACE,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,OAAO,MACP,OAAO,MACP,OAAO;AAEX;AAGA,KAAK,+BAA+B,SAAS,OAAO;AAClD,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,eAAe,EAAE,KAAK,OAAO,IAAc;AAC7C,UAAM,eAAe,KAAK;AAC1B,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,8BAA8B,SAAS,OAAO;AACjD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,yBAAyB,OAAO,CAAC,GAAG;AAC3C,aAAO;AAAA,IACT;AACA,QAAI,MAAM,SAAS;AACjB,YAAM,MAAM,gBAAgB;AAAA,IAC9B;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK;AACT,QAAM,eAAe;AACrB,SAAO,eAAe,KAAK,MAAM,QAAQ,CAAC,GAAG;AAC3C,UAAM,eAAe,KAAK,MAAM,gBAAgB,KAAK;AACrD,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,QAAQ;AACvB;AACA,SAAS,eAAe,IAAI;AAC1B,SAAO,MAAM,MAAgB,MAAM;AACrC;AAGA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK;AACT,QAAM,eAAe;AACrB,SAAO,WAAW,KAAK,MAAM,QAAQ,CAAC,GAAG;AACvC,UAAM,eAAe,KAAK,MAAM,eAAe,SAAS,EAAE;AAC1D,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,QAAQ;AACvB;AACA,SAAS,WAAW,IAAI;AACtB,SACG,MAAM,MAAgB,MAAM,MAC5B,MAAM,MAAgB,MAAM,MAC5B,MAAM,MAAgB,MAAM;AAEjC;AACA,SAAS,SAAS,IAAI;AACpB,MAAI,MAAM,MAAgB,MAAM,IAAc;AAC5C,WAAO,MAAM,KAAK;AAAA,EACpB;AACA,MAAI,MAAM,MAAgB,MAAM,KAAc;AAC5C,WAAO,MAAM,KAAK;AAAA,EACpB;AACA,SAAO,KAAK;AACd;AAIA,KAAK,sCAAsC,SAAS,OAAO;AACzD,MAAI,KAAK,qBAAqB,KAAK,GAAG;AACpC,QAAI,KAAK,MAAM;AACf,QAAI,KAAK,qBAAqB,KAAK,GAAG;AACpC,UAAI,KAAK,MAAM;AACf,UAAI,MAAM,KAAK,KAAK,qBAAqB,KAAK,GAAG;AAC/C,cAAM,eAAe,KAAK,KAAK,KAAK,IAAI,MAAM;AAAA,MAChD,OAAO;AACL,cAAM,eAAe,KAAK,IAAI;AAAA,MAChC;AAAA,IACF,OAAO;AACL,YAAM,eAAe;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,aAAa,EAAE,GAAG;AACpB,UAAM,eAAe,KAAK;AAC1B,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,QAAM,eAAe;AACrB,SAAO;AACT;AACA,SAAS,aAAa,IAAI;AACxB,SAAO,MAAM,MAAgB,MAAM;AACrC;AAKA,KAAK,2BAA2B,SAAS,OAAO,QAAQ;AACtD,MAAI,QAAQ,MAAM;AAClB,QAAM,eAAe;AACrB,WAAS,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC/B,QAAI,KAAK,MAAM,QAAQ;AACvB,QAAI,CAAC,WAAW,EAAE,GAAG;AACnB,YAAM,MAAM;AACZ,aAAO;AAAA,IACT;AACA,UAAM,eAAe,KAAK,MAAM,eAAe,SAAS,EAAE;AAC1D,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO;AACT;AAMA,IAAI,QAAQ,SAASC,OAAM,GAAG;AAC5B,OAAK,OAAO,EAAE;AACd,OAAK,QAAQ,EAAE;AACf,OAAK,QAAQ,EAAE;AACf,OAAK,MAAM,EAAE;AACb,MAAI,EAAE,QAAQ,WACZ;AAAE,SAAK,MAAM,IAAI,eAAe,GAAG,EAAE,UAAU,EAAE,MAAM;AAAA,EAAG;AAC5D,MAAI,EAAE,QAAQ,QACZ;AAAE,SAAK,QAAQ,CAAC,EAAE,OAAO,EAAE,GAAG;AAAA,EAAG;AACrC;AAIA,IAAI,KAAK,OAAO;AAIhB,GAAG,OAAO,SAAS,+BAA+B;AAChD,MAAI,CAAC,iCAAiC,KAAK,KAAK,WAAW,KAAK,aAC9D;AAAE,SAAK,iBAAiB,KAAK,OAAO,gCAAgC,KAAK,KAAK,OAAO;AAAA,EAAG;AAC1F,MAAI,KAAK,QAAQ,SACf;AAAE,SAAK,QAAQ,QAAQ,IAAI,MAAM,IAAI,CAAC;AAAA,EAAG;AAE3C,OAAK,aAAa,KAAK;AACvB,OAAK,eAAe,KAAK;AACzB,OAAK,gBAAgB,KAAK;AAC1B,OAAK,kBAAkB,KAAK;AAC5B,OAAK,UAAU;AACjB;AAEA,GAAG,WAAW,WAAW;AACvB,OAAK,KAAK;AACV,SAAO,IAAI,MAAM,IAAI;AACvB;AAGA,IAAI,OAAO,WAAW,aACpB;AAAE,KAAG,OAAO,QAAQ,IAAI,WAAW;AACjC,QAAI,WAAW;AAEf,WAAO;AAAA,MACL,MAAM,WAAY;AAChB,YAAI,QAAQ,SAAS,SAAS;AAC9B,eAAO;AAAA,UACL,MAAM,MAAM,SAAS,QAAQ;AAAA,UAC7B,OAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAG;AAQL,GAAG,YAAY,WAAW;AACxB,MAAI,aAAa,KAAK,WAAW;AACjC,MAAI,CAAC,cAAc,CAAC,WAAW,eAAe;AAAE,SAAK,UAAU;AAAA,EAAG;AAElE,OAAK,QAAQ,KAAK;AAClB,MAAI,KAAK,QAAQ,WAAW;AAAE,SAAK,WAAW,KAAK,YAAY;AAAA,EAAG;AAClE,MAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAE,WAAO,KAAK,YAAY,QAAQ,GAAG;AAAA,EAAE;AAE1E,MAAI,WAAW,UAAU;AAAE,WAAO,WAAW,SAAS,IAAI;AAAA,EAAE,OACvD;AAAE,SAAK,UAAU,KAAK,kBAAkB,CAAC;AAAA,EAAG;AACnD;AAEA,GAAG,YAAY,SAAS,MAAM;AAG5B,MAAI,kBAAkB,MAAM,KAAK,QAAQ,eAAe,CAAC,KAAK,SAAS,IACrE;AAAE,WAAO,KAAK,SAAS;AAAA,EAAE;AAE3B,SAAO,KAAK,iBAAiB,IAAI;AACnC;AAEA,GAAG,oBAAoB,WAAW;AAChC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,GAAG;AACzC,MAAI,QAAQ,SAAU,QAAQ,OAAQ;AAAE,WAAO;AAAA,EAAK;AACpD,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,SAAO,QAAQ,SAAU,QAAQ,QAAS,QAAQ,QAAQ,MAAM,OAAO;AACzE;AAEA,GAAG,mBAAmB,WAAW;AAC/B,MAAI,WAAW,KAAK,QAAQ,aAAa,KAAK,YAAY;AAC1D,MAAI,QAAQ,KAAK,KAAK,MAAM,KAAK,MAAM,QAAQ,MAAM,KAAK,OAAO,CAAC;AAClE,MAAI,QAAQ,IAAI;AAAE,SAAK,MAAM,KAAK,MAAM,GAAG,sBAAsB;AAAA,EAAG;AACpE,OAAK,MAAM,MAAM;AACjB,MAAI,KAAK,QAAQ,WAAW;AAC1B,aAAS,YAAa,QAAS,MAAM,QAAQ,YAAY,cAAc,KAAK,OAAO,KAAK,KAAK,GAAG,KAAK,MAAK;AACxG,QAAE,KAAK;AACP,YAAM,KAAK,YAAY;AAAA,IACzB;AAAA,EACF;AACA,MAAI,KAAK,QAAQ,WACf;AAAE,SAAK,QAAQ;AAAA,MAAU;AAAA,MAAM,KAAK,MAAM,MAAM,QAAQ,GAAG,GAAG;AAAA,MAAG;AAAA,MAAO,KAAK;AAAA,MACtD;AAAA,MAAU,KAAK,YAAY;AAAA,IAAC;AAAA,EAAG;AAC1D;AAEA,GAAG,kBAAkB,SAAS,WAAW;AACvC,MAAI,QAAQ,KAAK;AACjB,MAAI,WAAW,KAAK,QAAQ,aAAa,KAAK,YAAY;AAC1D,MAAI,KAAK,KAAK,MAAM,WAAW,KAAK,OAAO,SAAS;AACpD,SAAO,KAAK,MAAM,KAAK,MAAM,UAAU,CAAC,UAAU,EAAE,GAAG;AACrD,SAAK,KAAK,MAAM,WAAW,EAAE,KAAK,GAAG;AAAA,EACvC;AACA,MAAI,KAAK,QAAQ,WACf;AAAE,SAAK,QAAQ;AAAA,MAAU;AAAA,MAAO,KAAK,MAAM,MAAM,QAAQ,WAAW,KAAK,GAAG;AAAA,MAAG;AAAA,MAAO,KAAK;AAAA,MACpE;AAAA,MAAU,KAAK,YAAY;AAAA,IAAC;AAAA,EAAG;AAC1D;AAKA,GAAG,YAAY,WAAW;AACxB,OAAM,QAAO,KAAK,MAAM,KAAK,MAAM,QAAQ;AACzC,QAAI,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACvC,YAAQ,IAAI;AAAA,MACZ,KAAK;AAAA,MAAI,KAAK;AACZ,UAAE,KAAK;AACP;AAAA,MACF,KAAK;AACH,YAAI,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,IAAI;AAC9C,YAAE,KAAK;AAAA,QACT;AAAA,MACF,KAAK;AAAA,MAAI,KAAK;AAAA,MAAM,KAAK;AACvB,UAAE,KAAK;AACP,YAAI,KAAK,QAAQ,WAAW;AAC1B,YAAE,KAAK;AACP,eAAK,YAAY,KAAK;AAAA,QACxB;AACA;AAAA,MACF,KAAK;AACH,gBAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,GAAG;AAAA,UAC7C,KAAK;AACH,iBAAK,iBAAiB;AACtB;AAAA,UACF,KAAK;AACH,iBAAK,gBAAgB,CAAC;AACtB;AAAA,UACF;AACE,kBAAM;AAAA,QACR;AACA;AAAA,MACF;AACE,YAAI,KAAK,KAAK,KAAK,MAAM,MAAM,QAAQ,mBAAmB,KAAK,OAAO,aAAa,EAAE,CAAC,GAAG;AACvF,YAAE,KAAK;AAAA,QACT,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,IACF;AAAA,EACF;AACF;AAOA,GAAG,cAAc,SAAS,MAAM,KAAK;AACnC,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,QAAQ,WAAW;AAAE,SAAK,SAAS,KAAK,YAAY;AAAA,EAAG;AAChE,MAAI,WAAW,KAAK;AACpB,OAAK,OAAO;AACZ,OAAK,QAAQ;AAEb,OAAK,cAAc,QAAQ;AAC7B;AAWA,GAAG,gBAAgB,WAAW;AAC5B,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,QAAQ,MAAM,QAAQ,IAAI;AAAE,WAAO,KAAK,WAAW,IAAI;AAAA,EAAE;AAC7D,MAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC9C,MAAI,KAAK,QAAQ,eAAe,KAAK,SAAS,MAAM,UAAU,IAAI;AAChE,SAAK,OAAO;AACZ,WAAO,KAAK,YAAY,QAAQ,QAAQ;AAAA,EAC1C,OAAO;AACL,MAAE,KAAK;AACP,WAAO,KAAK,YAAY,QAAQ,GAAG;AAAA,EACrC;AACF;AAEA,GAAG,kBAAkB,WAAW;AAC9B,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,KAAK,aAAa;AAAE,MAAE,KAAK;AAAK,WAAO,KAAK,WAAW;AAAA,EAAE;AAC7D,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EAAE;AAC3D,SAAO,KAAK,SAAS,QAAQ,OAAO,CAAC;AACvC;AAEA,GAAG,4BAA4B,SAAS,MAAM;AAC5C,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,OAAO;AACX,MAAI,YAAY,SAAS,KAAK,QAAQ,OAAO,QAAQ;AAGrD,MAAI,KAAK,QAAQ,eAAe,KAAK,SAAS,MAAM,SAAS,IAAI;AAC/D,MAAE;AACF,gBAAY,QAAQ;AACpB,WAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAAA,EAC3C;AAEA,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,OAAO,CAAC;AAAA,EAAE;AAClE,SAAO,KAAK,SAAS,WAAW,IAAI;AACtC;AAEA,GAAG,qBAAqB,SAAS,MAAM;AACrC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,SAAS,MAAM;AACjB,QAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,UAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC9C,UAAI,UAAU,IAAI;AAAE,eAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,MAAE;AAAA,IAC9D;AACA,WAAO,KAAK,SAAS,SAAS,MAAM,QAAQ,YAAY,QAAQ,YAAY,CAAC;AAAA,EAC/E;AACA,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EAAE;AAC3D,SAAO,KAAK,SAAS,SAAS,MAAM,QAAQ,YAAY,QAAQ,YAAY,CAAC;AAC/E;AAEA,GAAG,kBAAkB,WAAW;AAC9B,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EAAE;AAC3D,SAAO,KAAK,SAAS,QAAQ,YAAY,CAAC;AAC5C;AAEA,GAAG,qBAAqB,SAAS,MAAM;AACrC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,SAAS,MAAM;AACjB,QAAI,SAAS,MAAM,CAAC,KAAK,YAAY,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,OACxE,KAAK,eAAe,KAAK,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,GAAG,CAAC,IAAI;AAE1F,WAAK,gBAAgB,CAAC;AACtB,WAAK,UAAU;AACf,aAAO,KAAK,UAAU;AAAA,IACxB;AACA,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EACxC;AACA,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EAAE;AAC3D,SAAO,KAAK,SAAS,QAAQ,SAAS,CAAC;AACzC;AAEA,GAAG,kBAAkB,SAAS,MAAM;AAClC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,OAAO;AACX,MAAI,SAAS,MAAM;AACjB,WAAO,SAAS,MAAM,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,KAAK,IAAI;AACvE,QAAI,KAAK,MAAM,WAAW,KAAK,MAAM,IAAI,MAAM,IAAI;AAAE,aAAO,KAAK,SAAS,QAAQ,QAAQ,OAAO,CAAC;AAAA,IAAE;AACpG,WAAO,KAAK,SAAS,QAAQ,UAAU,IAAI;AAAA,EAC7C;AACA,MAAI,SAAS,MAAM,SAAS,MAAM,CAAC,KAAK,YAAY,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,MACxF,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,IAAI;AAE9C,SAAK,gBAAgB,CAAC;AACtB,SAAK,UAAU;AACf,WAAO,KAAK,UAAU;AAAA,EACxB;AACA,MAAI,SAAS,IAAI;AAAE,WAAO;AAAA,EAAG;AAC7B,SAAO,KAAK,SAAS,QAAQ,YAAY,IAAI;AAC/C;AAEA,GAAG,oBAAoB,SAAS,MAAM;AACpC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,UAAU,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EAAE;AAC9G,MAAI,SAAS,MAAM,SAAS,MAAM,KAAK,QAAQ,eAAe,GAAG;AAC/D,SAAK,OAAO;AACZ,WAAO,KAAK,YAAY,QAAQ,KAAK;AAAA,EACvC;AACA,SAAO,KAAK,SAAS,SAAS,KAAK,QAAQ,KAAK,QAAQ,QAAQ,CAAC;AACnE;AAEA,GAAG,qBAAqB,WAAW;AACjC,MAAI,cAAc,KAAK,QAAQ;AAC/B,MAAI,eAAe,IAAI;AACrB,QAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,QAAI,SAAS,IAAI;AACf,UAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC9C,UAAI,QAAQ,MAAM,QAAQ,IAAI;AAAE,eAAO,KAAK,SAAS,QAAQ,aAAa,CAAC;AAAA,MAAE;AAAA,IAC/E;AACA,QAAI,SAAS,IAAI;AACf,UAAI,eAAe,IAAI;AACrB,YAAI,UAAU,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAChD,YAAI,YAAY,IAAI;AAAE,iBAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,QAAE;AAAA,MAChE;AACA,aAAO,KAAK,SAAS,QAAQ,UAAU,CAAC;AAAA,IAC1C;AAAA,EACF;AACA,SAAO,KAAK,SAAS,QAAQ,UAAU,CAAC;AAC1C;AAEA,GAAG,uBAAuB,WAAW;AACnC,MAAI,cAAc,KAAK,QAAQ;AAC/B,MAAI,OAAO;AACX,MAAI,eAAe,IAAI;AACrB,MAAE,KAAK;AACP,WAAO,KAAK,kBAAkB;AAC9B,QAAI,kBAAkB,MAAM,IAAI,KAAK,SAAS,IAAc;AAC1D,aAAO,KAAK,YAAY,QAAQ,WAAW,KAAK,UAAU,CAAC;AAAA,IAC7D;AAAA,EACF;AAEA,OAAK,MAAM,KAAK,KAAK,2BAA2B,kBAAkB,IAAI,IAAI,GAAG;AAC/E;AAEA,GAAG,mBAAmB,SAAS,MAAM;AACnC,UAAQ,MAAM;AAAA;AAAA;AAAA,IAGd,KAAK;AACH,aAAO,KAAK,cAAc;AAAA;AAAA,IAG5B,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC3D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC3D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,IAAI;AAAA,IACzD,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,KAAK;AAAA,IAC1D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,QAAQ;AAAA,IAC7D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,QAAQ;AAAA,IAC7D,KAAK;AAAK,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC5D,KAAK;AAAK,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC5D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,KAAK;AAAA,IAE1D,KAAK;AACH,UAAI,KAAK,QAAQ,cAAc,GAAG;AAAE;AAAA,MAAM;AAC1C,QAAE,KAAK;AACP,aAAO,KAAK,YAAY,QAAQ,SAAS;AAAA,IAE3C,KAAK;AACH,UAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,UAAI,SAAS,OAAO,SAAS,IAAI;AAAE,eAAO,KAAK,gBAAgB,EAAE;AAAA,MAAE;AACnE,UAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,YAAI,SAAS,OAAO,SAAS,IAAI;AAAE,iBAAO,KAAK,gBAAgB,CAAC;AAAA,QAAE;AAClE,YAAI,SAAS,MAAM,SAAS,IAAI;AAAE,iBAAO,KAAK,gBAAgB,CAAC;AAAA,QAAE;AAAA,MACnE;AAAA;AAAA;AAAA,IAIF,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAC3E,aAAO,KAAK,WAAW,KAAK;AAAA;AAAA,IAG9B,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,WAAW,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAM7B,KAAK;AACH,aAAO,KAAK,gBAAgB;AAAA,IAE9B,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,0BAA0B,IAAI;AAAA,IAE5C,KAAK;AAAA,IAAK,KAAK;AACb,aAAO,KAAK,mBAAmB,IAAI;AAAA,IAErC,KAAK;AACH,aAAO,KAAK,gBAAgB;AAAA,IAE9B,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,mBAAmB,IAAI;AAAA,IAErC,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,gBAAgB,IAAI;AAAA,IAElC,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,kBAAkB,IAAI;AAAA,IAEpC,KAAK;AACH,aAAO,KAAK,mBAAmB;AAAA,IAEjC,KAAK;AACH,aAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,IAExC,KAAK;AACH,aAAO,KAAK,qBAAqB;AAAA,EACnC;AAEA,OAAK,MAAM,KAAK,KAAK,2BAA2B,kBAAkB,IAAI,IAAI,GAAG;AAC/E;AAEA,GAAG,WAAW,SAAS,MAAM,MAAM;AACjC,MAAI,MAAM,KAAK,MAAM,MAAM,KAAK,KAAK,KAAK,MAAM,IAAI;AACpD,OAAK,OAAO;AACZ,SAAO,KAAK,YAAY,MAAM,GAAG;AACnC;AAEA,GAAG,aAAa,WAAW;AACzB,MAAI,SAAS,SAAS,QAAQ,KAAK;AACnC,aAAS;AACP,QAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAE,WAAK,MAAM,OAAO,iCAAiC;AAAA,IAAG;AAC3F,QAAI,KAAK,KAAK,MAAM,OAAO,KAAK,GAAG;AACnC,QAAI,UAAU,KAAK,EAAE,GAAG;AAAE,WAAK,MAAM,OAAO,iCAAiC;AAAA,IAAG;AAChF,QAAI,CAAC,SAAS;AACZ,UAAI,OAAO,KAAK;AAAE,kBAAU;AAAA,MAAM,WACzB,OAAO,OAAO,SAAS;AAAE,kBAAU;AAAA,MAAO,WAC1C,OAAO,OAAO,CAAC,SAAS;AAAE;AAAA,MAAM;AACzC,gBAAU,OAAO;AAAA,IACnB,OAAO;AAAE,gBAAU;AAAA,IAAO;AAC1B,MAAE,KAAK;AAAA,EACT;AACA,MAAI,UAAU,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG;AAC9C,IAAE,KAAK;AACP,MAAI,aAAa,KAAK;AACtB,MAAI,QAAQ,KAAK,UAAU;AAC3B,MAAI,KAAK,aAAa;AAAE,SAAK,WAAW,UAAU;AAAA,EAAG;AAGrD,MAAI,QAAQ,KAAK,gBAAgB,KAAK,cAAc,IAAI,sBAAsB,IAAI;AAClF,QAAM,MAAM,OAAO,SAAS,KAAK;AACjC,OAAK,oBAAoB,KAAK;AAC9B,OAAK,sBAAsB,KAAK;AAGhC,MAAI,QAAQ;AACZ,MAAI;AACF,YAAQ,IAAI,OAAO,SAAS,KAAK;AAAA,EACnC,SAAS,GAAG;AAAA,EAGZ;AAEA,SAAO,KAAK,YAAY,QAAQ,QAAQ,EAAC,SAAkB,OAAc,MAAY,CAAC;AACxF;AAMA,GAAG,UAAU,SAAS,OAAO,KAAK,gCAAgC;AAEhE,MAAI,kBAAkB,KAAK,QAAQ,eAAe,MAAM,QAAQ;AAKhE,MAAI,8BAA8B,kCAAkC,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM;AAExG,MAAI,QAAQ,KAAK,KAAK,QAAQ,GAAG,WAAW;AAC5C,WAAS,IAAI,GAAG,IAAI,OAAO,OAAO,WAAW,KAAK,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,KAAK;AACxE,QAAI,OAAO,KAAK,MAAM,WAAW,KAAK,GAAG,GAAG,MAAO;AAEnD,QAAI,mBAAmB,SAAS,IAAI;AAClC,UAAI,6BAA6B;AAAE,aAAK,iBAAiB,KAAK,KAAK,mEAAmE;AAAA,MAAG;AACzI,UAAI,aAAa,IAAI;AAAE,aAAK,iBAAiB,KAAK,KAAK,kDAAkD;AAAA,MAAG;AAC5G,UAAI,MAAM,GAAG;AAAE,aAAK,iBAAiB,KAAK,KAAK,yDAAyD;AAAA,MAAG;AAC3G,iBAAW;AACX;AAAA,IACF;AAEA,QAAI,QAAQ,IAAI;AAAE,YAAM,OAAO,KAAK;AAAA,IAAI,WAC/B,QAAQ,IAAI;AAAE,YAAM,OAAO,KAAK;AAAA,IAAI,WACpC,QAAQ,MAAM,QAAQ,IAAI;AAAE,YAAM,OAAO;AAAA,IAAI,OACjD;AAAE,YAAM;AAAA,IAAU;AACvB,QAAI,OAAO,OAAO;AAAE;AAAA,IAAM;AAC1B,eAAW;AACX,YAAQ,QAAQ,QAAQ;AAAA,EAC1B;AAEA,MAAI,mBAAmB,aAAa,IAAI;AAAE,SAAK,iBAAiB,KAAK,MAAM,GAAG,wDAAwD;AAAA,EAAG;AACzI,MAAI,KAAK,QAAQ,SAAS,OAAO,QAAQ,KAAK,MAAM,UAAU,KAAK;AAAE,WAAO;AAAA,EAAK;AAEjF,SAAO;AACT;AAEA,SAAS,eAAe,KAAK,6BAA6B;AACxD,MAAI,6BAA6B;AAC/B,WAAO,SAAS,KAAK,CAAC;AAAA,EACxB;AAGA,SAAO,WAAW,IAAI,QAAQ,MAAM,EAAE,CAAC;AACzC;AAEA,SAAS,eAAe,KAAK;AAC3B,MAAI,OAAO,WAAW,YAAY;AAChC,WAAO;AAAA,EACT;AAGA,SAAO,OAAO,IAAI,QAAQ,MAAM,EAAE,CAAC;AACrC;AAEA,GAAG,kBAAkB,SAAS,OAAO;AACnC,MAAI,QAAQ,KAAK;AACjB,OAAK,OAAO;AACZ,MAAI,MAAM,KAAK,QAAQ,KAAK;AAC5B,MAAI,OAAO,MAAM;AAAE,SAAK,MAAM,KAAK,QAAQ,GAAG,8BAA8B,KAAK;AAAA,EAAG;AACpF,MAAI,KAAK,QAAQ,eAAe,MAAM,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM,KAAK;AAC7E,UAAM,eAAe,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG,CAAC;AACtD,MAAE,KAAK;AAAA,EACT,WAAW,kBAAkB,KAAK,kBAAkB,CAAC,GAAG;AAAE,SAAK,MAAM,KAAK,KAAK,kCAAkC;AAAA,EAAG;AACpH,SAAO,KAAK,YAAY,QAAQ,KAAK,GAAG;AAC1C;AAIA,GAAG,aAAa,SAAS,eAAe;AACtC,MAAI,QAAQ,KAAK;AACjB,MAAI,CAAC,iBAAiB,KAAK,QAAQ,IAAI,QAAW,IAAI,MAAM,MAAM;AAAE,SAAK,MAAM,OAAO,gBAAgB;AAAA,EAAG;AACzG,MAAI,QAAQ,KAAK,MAAM,SAAS,KAAK,KAAK,MAAM,WAAW,KAAK,MAAM;AACtE,MAAI,SAAS,KAAK,QAAQ;AAAE,SAAK,MAAM,OAAO,gBAAgB;AAAA,EAAG;AACjE,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,GAAG;AACzC,MAAI,CAAC,SAAS,CAAC,iBAAiB,KAAK,QAAQ,eAAe,MAAM,SAAS,KAAK;AAC9E,QAAI,QAAQ,eAAe,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG,CAAC;AAC5D,MAAE,KAAK;AACP,QAAI,kBAAkB,KAAK,kBAAkB,CAAC,GAAG;AAAE,WAAK,MAAM,KAAK,KAAK,kCAAkC;AAAA,IAAG;AAC7G,WAAO,KAAK,YAAY,QAAQ,KAAK,KAAK;AAAA,EAC5C;AACA,MAAI,SAAS,OAAO,KAAK,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG,CAAC,GAAG;AAAE,YAAQ;AAAA,EAAO;AAC9E,MAAI,SAAS,MAAM,CAAC,OAAO;AACzB,MAAE,KAAK;AACP,SAAK,QAAQ,EAAE;AACf,WAAO,KAAK,MAAM,WAAW,KAAK,GAAG;AAAA,EACvC;AACA,OAAK,SAAS,MAAM,SAAS,QAAQ,CAAC,OAAO;AAC3C,WAAO,KAAK,MAAM,WAAW,EAAE,KAAK,GAAG;AACvC,QAAI,SAAS,MAAM,SAAS,IAAI;AAAE,QAAE,KAAK;AAAA,IAAK;AAC9C,QAAI,KAAK,QAAQ,EAAE,MAAM,MAAM;AAAE,WAAK,MAAM,OAAO,gBAAgB;AAAA,IAAG;AAAA,EACxE;AACA,MAAI,kBAAkB,KAAK,kBAAkB,CAAC,GAAG;AAAE,SAAK,MAAM,KAAK,KAAK,kCAAkC;AAAA,EAAG;AAE7G,MAAI,MAAM,eAAe,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG,GAAG,KAAK;AACjE,SAAO,KAAK,YAAY,QAAQ,KAAK,GAAG;AAC1C;AAIA,GAAG,gBAAgB,WAAW;AAC5B,MAAI,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG,GAAG;AAE1C,MAAI,OAAO,KAAK;AACd,QAAI,KAAK,QAAQ,cAAc,GAAG;AAAE,WAAK,WAAW;AAAA,IAAG;AACvD,QAAI,UAAU,EAAE,KAAK;AACrB,WAAO,KAAK,YAAY,KAAK,MAAM,QAAQ,KAAK,KAAK,GAAG,IAAI,KAAK,GAAG;AACpE,MAAE,KAAK;AACP,QAAI,OAAO,SAAU;AAAE,WAAK,mBAAmB,SAAS,0BAA0B;AAAA,IAAG;AAAA,EACvF,OAAO;AACL,WAAO,KAAK,YAAY,CAAC;AAAA,EAC3B;AACA,SAAO;AACT;AAEA,GAAG,aAAa,SAAS,OAAO;AAC9B,MAAI,MAAM,IAAI,aAAa,EAAE,KAAK;AAClC,aAAS;AACP,QAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAE,WAAK,MAAM,KAAK,OAAO,8BAA8B;AAAA,IAAG;AAC7F,QAAI,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACvC,QAAI,OAAO,OAAO;AAAE;AAAA,IAAM;AAC1B,QAAI,OAAO,IAAI;AACb,aAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC5C,aAAO,KAAK,gBAAgB,KAAK;AACjC,mBAAa,KAAK;AAAA,IACpB,WAAW,OAAO,QAAU,OAAO,MAAQ;AACzC,UAAI,KAAK,QAAQ,cAAc,IAAI;AAAE,aAAK,MAAM,KAAK,OAAO,8BAA8B;AAAA,MAAG;AAC7F,QAAE,KAAK;AACP,UAAI,KAAK,QAAQ,WAAW;AAC1B,aAAK;AACL,aAAK,YAAY,KAAK;AAAA,MACxB;AAAA,IACF,OAAO;AACL,UAAI,UAAU,EAAE,GAAG;AAAE,aAAK,MAAM,KAAK,OAAO,8BAA8B;AAAA,MAAG;AAC7E,QAAE,KAAK;AAAA,IACT;AAAA,EACF;AACA,SAAO,KAAK,MAAM,MAAM,YAAY,KAAK,KAAK;AAC9C,SAAO,KAAK,YAAY,QAAQ,QAAQ,GAAG;AAC7C;AAIA,IAAI,gCAAgC,CAAC;AAErC,GAAG,uBAAuB,WAAW;AACnC,OAAK,oBAAoB;AACzB,MAAI;AACF,SAAK,cAAc;AAAA,EACrB,SAAS,KAAK;AACZ,QAAI,QAAQ,+BAA+B;AACzC,WAAK,yBAAyB;AAAA,IAChC,OAAO;AACL,YAAM;AAAA,IACR;AAAA,EACF;AAEA,OAAK,oBAAoB;AAC3B;AAEA,GAAG,qBAAqB,SAAS,UAAU,SAAS;AAClD,MAAI,KAAK,qBAAqB,KAAK,QAAQ,eAAe,GAAG;AAC3D,UAAM;AAAA,EACR,OAAO;AACL,SAAK,MAAM,UAAU,OAAO;AAAA,EAC9B;AACF;AAEA,GAAG,gBAAgB,WAAW;AAC5B,MAAI,MAAM,IAAI,aAAa,KAAK;AAChC,aAAS;AACP,QAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAE,WAAK,MAAM,KAAK,OAAO,uBAAuB;AAAA,IAAG;AACtF,QAAI,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,MAAM,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,KAAK;AACzE,UAAI,KAAK,QAAQ,KAAK,UAAU,KAAK,SAAS,QAAQ,YAAY,KAAK,SAAS,QAAQ,kBAAkB;AACxG,YAAI,OAAO,IAAI;AACb,eAAK,OAAO;AACZ,iBAAO,KAAK,YAAY,QAAQ,YAAY;AAAA,QAC9C,OAAO;AACL,YAAE,KAAK;AACP,iBAAO,KAAK,YAAY,QAAQ,SAAS;AAAA,QAC3C;AAAA,MACF;AACA,aAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC5C,aAAO,KAAK,YAAY,QAAQ,UAAU,GAAG;AAAA,IAC/C;AACA,QAAI,OAAO,IAAI;AACb,aAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC5C,aAAO,KAAK,gBAAgB,IAAI;AAChC,mBAAa,KAAK;AAAA,IACpB,WAAW,UAAU,EAAE,GAAG;AACxB,aAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC5C,QAAE,KAAK;AACP,cAAQ,IAAI;AAAA,QACZ,KAAK;AACH,cAAI,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM,IAAI;AAAE,cAAE,KAAK;AAAA,UAAK;AAAA,QAC5D,KAAK;AACH,iBAAO;AACP;AAAA,QACF;AACE,iBAAO,OAAO,aAAa,EAAE;AAC7B;AAAA,MACF;AACA,UAAI,KAAK,QAAQ,WAAW;AAC1B,UAAE,KAAK;AACP,aAAK,YAAY,KAAK;AAAA,MACxB;AACA,mBAAa,KAAK;AAAA,IACpB,OAAO;AACL,QAAE,KAAK;AAAA,IACT;AAAA,EACF;AACF;AAGA,GAAG,2BAA2B,WAAW;AACvC,SAAO,KAAK,MAAM,KAAK,MAAM,QAAQ,KAAK,OAAO;AAC/C,YAAQ,KAAK,MAAM,KAAK,GAAG,GAAG;AAAA,MAC9B,KAAK;AACH,UAAE,KAAK;AACP;AAAA,MAEF,KAAK;AACH,YAAI,KAAK,MAAM,KAAK,MAAM,CAAC,MAAM,KAAK;AAAE;AAAA,QAAM;AAAA;AAAA,MAEhD,KAAK;AACH,eAAO,KAAK,YAAY,QAAQ,iBAAiB,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG,CAAC;AAAA,MAEzF,KAAK;AACH,YAAI,KAAK,MAAM,KAAK,MAAM,CAAC,MAAM,MAAM;AAAE,YAAE,KAAK;AAAA,QAAK;AAAA;AAAA,MAEvD,KAAK;AAAA,MAAM,KAAK;AAAA,MAAU,KAAK;AAC7B,UAAE,KAAK;AACP,aAAK,YAAY,KAAK,MAAM;AAC5B;AAAA,IACF;AAAA,EACF;AACA,OAAK,MAAM,KAAK,OAAO,uBAAuB;AAChD;AAIA,GAAG,kBAAkB,SAAS,YAAY;AACxC,MAAI,KAAK,KAAK,MAAM,WAAW,EAAE,KAAK,GAAG;AACzC,IAAE,KAAK;AACP,UAAQ,IAAI;AAAA,IACZ,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAK,aAAO,OAAO,aAAa,KAAK,YAAY,CAAC,CAAC;AAAA;AAAA,IACxD,KAAK;AAAK,aAAO,kBAAkB,KAAK,cAAc,CAAC;AAAA;AAAA,IACvD,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAI,aAAO;AAAA;AAAA,IAChB,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAI,UAAI,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM,IAAI;AAAE,UAAE,KAAK;AAAA,MAAK;AAAA;AAAA,IACnE,KAAK;AACH,UAAI,KAAK,QAAQ,WAAW;AAAE,aAAK,YAAY,KAAK;AAAK,UAAE,KAAK;AAAA,MAAS;AACzE,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,UAAI,KAAK,QAAQ;AACf,aAAK;AAAA,UACH,KAAK,MAAM;AAAA,UACX;AAAA,QACF;AAAA,MACF;AACA,UAAI,YAAY;AACd,YAAI,UAAU,KAAK,MAAM;AAEzB,aAAK;AAAA,UACH;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACE,UAAI,MAAM,MAAM,MAAM,IAAI;AACxB,YAAI,WAAW,KAAK,MAAM,OAAO,KAAK,MAAM,GAAG,CAAC,EAAE,MAAM,SAAS,EAAE,CAAC;AACpE,YAAI,QAAQ,SAAS,UAAU,CAAC;AAChC,YAAI,QAAQ,KAAK;AACf,qBAAW,SAAS,MAAM,GAAG,EAAE;AAC/B,kBAAQ,SAAS,UAAU,CAAC;AAAA,QAC9B;AACA,aAAK,OAAO,SAAS,SAAS;AAC9B,aAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACnC,aAAK,aAAa,OAAO,OAAO,MAAM,OAAO,QAAQ,KAAK,UAAU,aAAa;AAC/E,eAAK;AAAA,YACH,KAAK,MAAM,IAAI,SAAS;AAAA,YACxB,aACI,qCACA;AAAA,UACN;AAAA,QACF;AACA,eAAO,OAAO,aAAa,KAAK;AAAA,MAClC;AACA,UAAI,UAAU,EAAE,GAAG;AAGjB,YAAI,KAAK,QAAQ,WAAW;AAAE,eAAK,YAAY,KAAK;AAAK,YAAE,KAAK;AAAA,QAAS;AACzE,eAAO;AAAA,MACT;AACA,aAAO,OAAO,aAAa,EAAE;AAAA,EAC/B;AACF;AAIA,GAAG,cAAc,SAAS,KAAK;AAC7B,MAAI,UAAU,KAAK;AACnB,MAAI,IAAI,KAAK,QAAQ,IAAI,GAAG;AAC5B,MAAI,MAAM,MAAM;AAAE,SAAK,mBAAmB,SAAS,+BAA+B;AAAA,EAAG;AACrF,SAAO;AACT;AAQA,GAAG,YAAY,WAAW;AACxB,OAAK,cAAc;AACnB,MAAI,OAAO,IAAI,QAAQ,MAAM,aAAa,KAAK;AAC/C,MAAI,SAAS,KAAK,QAAQ,eAAe;AACzC,SAAO,KAAK,MAAM,KAAK,MAAM,QAAQ;AACnC,QAAI,KAAK,KAAK,kBAAkB;AAChC,QAAI,iBAAiB,IAAI,MAAM,GAAG;AAChC,WAAK,OAAO,MAAM,QAAS,IAAI;AAAA,IACjC,WAAW,OAAO,IAAI;AACpB,WAAK,cAAc;AACnB,cAAQ,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC7C,UAAI,WAAW,KAAK;AACpB,UAAI,KAAK,MAAM,WAAW,EAAE,KAAK,GAAG,MAAM,KACxC;AAAE,aAAK,mBAAmB,KAAK,KAAK,2CAA2C;AAAA,MAAG;AACpF,QAAE,KAAK;AACP,UAAI,MAAM,KAAK,cAAc;AAC7B,UAAI,EAAE,QAAQ,oBAAoB,kBAAkB,KAAK,MAAM,GAC7D;AAAE,aAAK,mBAAmB,UAAU,wBAAwB;AAAA,MAAG;AACjE,cAAQ,kBAAkB,GAAG;AAC7B,mBAAa,KAAK;AAAA,IACpB,OAAO;AACL;AAAA,IACF;AACA,YAAQ;AAAA,EACV;AACA,SAAO,OAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AACrD;AAKA,GAAG,WAAW,WAAW;AACvB,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,OAAO,QAAQ;AACnB,MAAI,KAAK,SAAS,KAAK,IAAI,GAAG;AAC5B,WAAO,SAAS,IAAI;AAAA,EACtB;AACA,SAAO,KAAK,YAAY,MAAM,IAAI;AACpC;AAiBA,IAAI,UAAU;AAEd,OAAO,QAAQ;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,cAAc;AAAA,EACd;AAAA,EACA,aAAa;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAQA,SAAST,OAAM,OAAO,SAAS;AAC7B,SAAO,OAAO,MAAM,OAAO,OAAO;AACpC;;;AChkMO,SAAS,WAAW,IAAoB;AAE7C,SAAO,GAAG,QAAQ,kBAAkB,GAAG;AACzC;;;ACiBO,SAAS,sBAAsB,SAAc,UAAmC;AACrF,MAAI,YAAY,QAAQ,YAAY,QAAW;AAC7C,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,YAAY,YAAY,QAAQ,WAAW,QAAW;AAC/D,QAAI,OAAO,QAAQ,WAAW,UAAU;AACtC,YAAM,IAAI;AAAA,QACR;AAAA;AAAA,QAEA,EAAE,GAAG,UAAU,OAAO,iBAAiB;AAAA,MACzC;AAAA,IACF;AACA,WAAO,QAAQ;AAAA,EACjB;AAEA,MAAI,OAAO,YAAY,UAAU;AAC/B,WAAO;AAAA,EACT;AAEA,QAAM,IAAI;AAAA,IACR;AAAA;AAAA,IAEA,EAAE,GAAG,UAAU,OAAO,UAAU;AAAA,EAClC;AACF;AASO,SAAS,kBAAkB,QAAgB,UAAgD;AAChG,QAAM,UAA+B;AAAA,IACnC;AAAA,IACA,YAAY,CAAC;AAAA,EACf;AAEA,MAAI;AAEF,UAAM,MAAMU,OAAW,QAAQ;AAAA,MAC7B,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,2BAA2B;AAAA,IAC7B,CAAC;AAED,YAAQ,MAAM;AAEd,UAAM,eAAe,qBAAqB,GAAG;AAE7C,QAAI,cAAc;AAChB,cAAQ,aAAa,kBAAkB,YAAY;AAAA,IACrD;AAAA,EACF,SAAS,OAAO;AAGd,QAAI,iBAAiB,OAAO;AAC1B,YAAM,IAAI;AAAA,QACR,kCAAkC,MAAM,OAAO;AAAA;AAAA,QAE/C,EAAE,GAAG,UAAU,OAAO,iBAAiB;AAAA,MACzC;AAAA,IACF;AACA,UAAM;AAAA,EACR;AAEA,SAAO;AACT;AAQO,SAAS,qBAAqB,MAIb;AACtB,QAAM,WAA2B,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAExE,MAAI,CAAC,KAAK,SAAS;AACjB,UAAM,IAAI;AAAA,MACR,kBAAkB,KAAK,IAAI,MAAM,KAAK,EAAE;AAAA;AAAA,MAExC,EAAE,GAAG,UAAU,OAAO,UAAU;AAAA,IAClC;AAAA,EACF;AAEA,QAAM,SAAS,sBAAsB,KAAK,SAAS,QAAQ;AAE3D,QAAM,gBAAgB,kBAAkB,QAAQ,QAAQ;AAExD,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,EACF;AACF;AAYA,SAAS,qBAAqB,KAAe;AAC3C,MAAI,CAAC,IAAI,MAAM;AACb,WAAO;AAAA,EACT;AAEA,aAAW,QAAQ,IAAI,MAAM;AAE3B,QAAI,KAAK,SAAS,4BAA4B,KAAK,aAAa;AAC9D,UAAI,KAAK,YAAY,SAAS,uBAAuB;AACnD,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,4BAA4B,KAAK,aAAa;AAC9D,UAAI,KAAK,YAAY,SAAS,uBAAuB;AACnD,cAAM,aAAa,KAAK,YAAY,aAAa,CAAC;AAClD,YAAI,cAAc,WAAW,MAAM;AAEjC,cAAI,WAAW,KAAK,SAAS,2BAA2B;AACtD,mBAAO,WAAW;AAAA,UACpB;AAEA,cAAI,WAAW,KAAK,SAAS,sBAAsB;AACjD,mBAAO,WAAW;AAAA,UACpB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,4BAA4B;AAC5C,UAAI,KAAK,YAAY,SAAS,uBAAuB;AACnD,eAAO,KAAK;AAAA,MACd;AACA,UAAI,KAAK,YAAY,SAAS,2BAA2B;AACvD,eAAO,KAAK;AAAA,MACd;AACA,UAAI,KAAK,YAAY,SAAS,sBAAsB;AAClD,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAAS,kBAAkB,cAA6B;AACtD,MAAI,CAAC,aAAa,UAAU,CAAC,MAAM,QAAQ,aAAa,MAAM,GAAG;AAC/D,WAAO,CAAC;AAAA,EACV;AAEA,SAAO,aAAa,OACjB,IAAI,CAAC,UAAe;AAEnB,QAAI,MAAM,SAAS,cAAc;AAC/B,aAAO,MAAM;AAAA,IACf;AAGA,QAAI,MAAM,SAAS,iBAAiB;AAClC,aAAO,MAAM,WACV,IAAI,CAAC,SAAc,KAAK,KAAK,QAAQ,KAAK,OAAO,IAAI,EACrD,OAAO,OAAO;AAAA,IACnB;AAEA,QAAI,MAAM,SAAS,gBAAgB;AACjC,aAAO,MAAM,SAAS,IAAI,CAAC,SAAc,MAAM,IAAI,EAAE,OAAO,OAAO;AAAA,IACrE;AAEA,WAAO;AAAA,EACT,CAAC,EACA,KAAK,EACL,OAAO,OAAO;AACnB;AAcO,SAAS,oBACd,MAMA,SACQ;AACR,QAAM,cAAc,WAAW,KAAK,EAAE;AAEtC,MAAI,CAAC,KAAK,eAAe;AACvB,UAAM,IAAI;AAAA,MACR,kBAAkB,KAAK,IAAI,MAAM,KAAK,EAAE;AAAA;AAAA,MAExC,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,MAAM,OAAO,gBAAgB;AAAA,IACjE;AAAA,EACF;AAEA,QAAM,EAAE,QAAQ,WAAW,IAAI,KAAK;AAKpC,MAAI,CAAC,QAAQ,iBAAiB;AAC5B,YAAQ,kBAAkB,oBAAI,IAAI;AAAA,EACpC;AACA,UAAQ,gBAAgB,IAAI,aAAa,MAAM;AAI/C,QAAM,aACJ,WAAW,SAAS,IAChB,WACG,IAAI,CAAC,UAAU;AACd,WAAO,SAAS,KAAK,eAAe,KAAK;AAAA,EAC3C,CAAC,EACA,KAAK,IAAI,IACZ;AAEN,QAAM,aACJ,WAAW,SAAS,IAChB;AAAA;AAAA;AAAA,EAGN,WAAW,IAAI,CAAC,UAAU,iBAAiB,KAAK,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,IAE1D;AAAA;AAAA;AAAA;AAUN,SAAO;AAAA,+BACsB,WAAW;AAAA,sBACpB,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,EAI7B,UAAU;AAAA,EACV,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8CAMkC,KAAK,IAAI;AAAA,EACrD,WAAW,SAAS,IAAI,WAAW,IAAI,CAAC,UAAU,sBAAsB,KAAK,MAAM,KAAK,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAO/G;;;ACxTO,IAAK,WAAL,kBAAKC,cAAL;AACL,EAAAA,UAAA,WAAQ;AACR,EAAAA,UAAA,YAAS;AACT,EAAAA,UAAA,oBAAiB;AACjB,EAAAA,UAAA,YAAS;AACT,EAAAA,UAAA,gBAAa;AACb,EAAAA,UAAA,cAAW;AACX,EAAAA,UAAA,cAAW;AAPD,SAAAA;AAAA,GAAA;AA4CL,SAAS,sBAAsB,MAAW,OAAqB;AACpE,QAAM,gBAA0B,CAAC;AAEjC,MAAI,OAAO,KAAK,OAAO,YAAY,KAAK,GAAG,KAAK,MAAM,IAAI;AACxD,kBAAc,KAAK,IAAI;AAAA,EACzB;AAEA,MAAI,OAAO,KAAK,SAAS,UAAU;AACjC,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,MAAI,OAAO,KAAK,SAAS,YAAY,KAAK,KAAK,KAAK,MAAM,IAAI;AAC5D,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,MAAI,cAAc,SAAS,GAAG;AAC5B,UAAM,iBAAiB,KAAK,MAAM,KAAK,QAAQ,YAAY,KAAK;AAChE,UAAM,IAAI;AAAA,MACR,SAAS,cAAc,mCAAmC,cAAc,KAAK,IAAI,CAAC;AAAA;AAAA,MAElF,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAAA,IACzC;AAAA,EACF;AACF;AAOO,SAAS,SAAS,KAA8C;AACrE,QAAM,SAAsB,OAAO,QAAQ,WAAW,KAAK,MAAM,GAAG,IAAI;AAGxE,MAAI,CAAC,OAAO,SAAS,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG;AACjD,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA,EAAE,OAAO,QAAQ;AAAA,IACnB;AAAA,EACF;AAGA,SAAO,MAAM,QAAQ,CAAC,MAAW,UAAkB;AACjD,0BAAsB,MAAM,KAAK;AAAA,EACnC,CAAC;AAID,SAAO,MAAM,QAAQ,CAAC,SAAc;AAClC,QAAI,KAAK,SAAS,+BAAmB;AACnC,UAAI;AACF,aAAK,gBAAgB,qBAAqB,IAAI;AAAA,MAChD,SAAS,OAAO;AACd,YAAI,iBAAiB,kBAAkB;AACrC,gBAAM;AAAA,QACR;AACA,cAAM,IAAI;AAAA,UACR,kCAAkC,KAAK,IAAI,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA;AAAA,UAEvG,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO;AACT;;;AClHA,SAAS,qBAAqB;AAC9B,SAAS,uBAAuB;AAMzB,SAAS,WAAW,KAA4B;AACrD,QAAM,QAAQ,IAAI,cAAgC;AAGlD,QAAM,UAAU,oBAAI,IAAqB;AACzC,aAAW,QAAQ,IAAI,OAAO;AAC5B,UAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B,YAAQ,IAAI,KAAK,IAAI,IAAI;AAAA,EAC3B;AAKA,QAAM,aAAa,oBAAI,IAAY;AAGnC,aAAW,QAAQ,IAAI,OAAO;AAC5B,QAAI,CAAC,QAAQ,IAAI,KAAK,QAAQ,KAAK,CAAC,QAAQ,IAAI,KAAK,QAAQ,GAAG;AAC9D,YAAM,aAAa,QAAQ,IAAI,KAAK,QAAQ;AAC5C,YAAM,aAAa,QAAQ,IAAI,KAAK,QAAQ;AAC5C,YAAM,IAAI;AAAA,QACR,iBAAiB,KAAK,EAAE;AAAA;AAAA,QAExB;AAAA,UACE,QAAQ,KAAK;AAAA,UACb,UAAU,YAAY,QAAQ,YAAY;AAAA,UAC1C,OAAO,CAAC,QAAQ,IAAI,KAAK,QAAQ,IAAI,aAAa;AAAA,QACpD;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,aAAa,KAAK,UAAU;AACnC,YAAM,OAAO,MAAM,kBAAkB,KAAK,QAAQ;AAClD,YAAM,WAA2B,EAAE,QAAQ,KAAK,UAAU,UAAU,KAAK,KAAK;AAC9E,YAAM,IAAI;AAAA,QACR,kCAAkC,KAAK,QAAQ,KAAK,QAAQ,qCAAqC,KAAK,EAAE;AAAA;AAAA,QAExG;AAAA,MACF;AAAA,IACF;AAMA,UAAM,cAAc,GAAG,KAAK,QAAQ,KAAK,KAAK,QAAQ;AACtD,QAAI,CAAC,WAAW,IAAI,WAAW,GAAG;AAChC,YAAM,eAAe,KAAK,IAAI,KAAK,UAAU,KAAK,UAAU,IAAI;AAChE,iBAAW,IAAI,WAAW;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;AAUA,SAAS,cAAc,OAAkC;AACvD,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAAiB,oBAAI,IAAY;AACvC,QAAM,YAAY,oBAAI,IAA2B;AAEjD,WAAS,IAAI,QAAgBC,OAAiC;AAC5D,YAAQ,IAAI,MAAM;AAClB,mBAAe,IAAI,MAAM;AACzB,IAAAA,MAAK,KAAK,MAAM;AAEhB,UAAM,YAAY,MAAM,aAAa,MAAM;AAC3C,eAAW,cAAc,WAAW;AAClC,UAAI,CAAC,QAAQ,IAAI,UAAU,GAAG;AAC5B,kBAAU,IAAI,YAAY,MAAM;AAChC,cAAM,QAAQ,IAAI,YAAYA,KAAI;AAClC,YAAI,OAAO;AACT,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,eAAe,IAAI,UAAU,GAAG;AAIzC,cAAM,aAAaA,MAAK,QAAQ,UAAU;AAC1C,cAAM,QAAQ,CAAC,GAAGA,MAAK,MAAM,UAAU,GAAG,UAAU;AACpD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,mBAAe,OAAO,MAAM;AAC5B,IAAAA,MAAK,IAAI;AACT,WAAO;AAAA,EACT;AAGA,aAAW,UAAU,MAAM,MAAM,GAAG;AAClC,QAAI,CAAC,QAAQ,IAAI,MAAM,GAAG;AACxB,YAAM,QAAQ,IAAI,QAAQ,CAAC,CAAC;AAC5B,UAAI,OAAO;AACT,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,gBAAgB,OAAiB,OAAyB;AACjE,SAAO,MACJ,IAAI,CAAC,WAAW;AACf,UAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,WAAO,KAAK,QAAQ;AAAA,EACtB,CAAC,EACA,KAAK,MAAM;AAChB;AAEO,SAAS,cAAc,OAAuB;AAEnD,QAAM,YAAY,cAAc,KAAK;AACrC,MAAI,WAAW;AACb,UAAM,gBAAgB,gBAAgB,WAAW,KAAK;AACtD,UAAM,IAAI;AAAA,MACR,iCAAiC,aAAa;AAAA;AAAA,MAE9C,EAAE,QAAQ,UAAU,CAAC,GAAG,UAAU,MAAM,kBAAkB,UAAU,CAAC,CAAC,EAAE,KAAK;AAAA,IAC/E;AAAA,EACF;AAGA,QAAM,aAAuB,CAAC;AAC9B,QAAM,cAAwB,CAAC;AAE/B,QAAM,YAAY,CAAC,QAAQ,UAAU;AACnC,QAAI,MAAM,kCAAyB;AACjC,iBAAW,KAAK,MAAM;AAAA,IACxB;AACA,QAAI,MAAM,oCAA0B;AAClC,kBAAY,KAAK,MAAM;AAAA,IACzB;AAAA,EACF,CAAC;AAED,MAAI,WAAW,WAAW,GAAG;AAE3B,UAAM,iBAAiB,WAAW,SAAS,IAAI,MAAM,kBAAkB,WAAW,CAAC,CAAC,IAAI;AACxF,UAAM,IAAI;AAAA,MACR,wCAAwC,WAAW,MAAM;AAAA;AAAA,MAEzD,iBAAiB,EAAE,QAAQ,eAAe,IAAI,UAAU,eAAe,KAAK,IAAI;AAAA,IAClF;AAAA,EACF;AACA,MAAI,YAAY,WAAW,GAAG;AAC5B,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA,EAAE,OAAO,aAAa;AAAA,IACxB;AAAA,EACF;AACF;AAMO,SAAS,mBAAmB,OAA2B;AAC5D,SAAO,gBAAgB,KAAK;AAC9B;AAKO,SAAS,cAAc,OAAiB,QAA2B;AACxE,SAAO,MAAM,YAAY,MAAM,EAAE,IAAI,CAAC,OAAO,MAAM,kBAAkB,EAAE,CAAC;AAC1E;AAKO,SAAS,eAAe,OAAiB,QAA2B;AACzE,SAAO,MAAM,aAAa,MAAM,EAAE,IAAI,CAAC,OAAO,MAAM,kBAAkB,EAAE,CAAC;AAC3E;;;ACtLO,SAAS,iBAAiB,MAAe,UAAkD;AAChG,QAAM,cAAc,WAAW,KAAK,EAAE;AACtC,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAO1C;AAYO,SAAS,kBAAkB,MAAe,UAAkD;AACjG,QAAM,cAAc,WAAW,KAAK,EAAE;AACtC,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoB1C;;;ACJO,IAAM,0BAAN,MAAyD;AAAA,EAC9D,kBAAkB,MAAsB;AACtC,WAAO,YAAY,IAAI;AAAA,EACzB;AAAA,EAEA,mBAA2B;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,iBAAyB;AACvB,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkBC,OAAsB;AAGtC,UAAM,WAAWA,MAAK,MAAM,GAAG;AAC/B,QAAI,SAAS;AACb,eAAW,WAAW,UAAU;AAC9B,eAAS,eAAe,MAAM,MAAM,OAAO;AAAA,IAC7C;AACA,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiBA,OAAsB;AACrC,WAAO,YAAYA,KAAI;AAAA,EACzB;AAAA,EAEA,gBAAwB;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,sBAAuC;AAErC,WAAO;AAAA,EACT;AAAA,EAEA,kBAA0B;AACxB,WAAO;AAAA,EACT;AAAA,EAEA,gBAAwB;AACtB,WAAO;AAAA,EACT;AACF;AAMO,IAAM,6BAAN,MAAM,4BAAsD;AAAA,EACjE,YAAoB,YAAoB,UAAU;AAA9B;AAAA,EAA+B;AAAA,EAEnD,kBAAkB,MAAsB;AACtC,WAAO,YAAY,IAAI;AAAA,EACzB;AAAA,EAEA,mBAA2B;AACzB,WAAO,gBAAgB,KAAK,SAAS;AAAA,EACvC;AAAA,EAEA,iBAAyB;AACvB,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkBA,OAAsB;AAGtC,WAAO,IAAI,KAAK,SAAS,SAASA,KAAI,QAAQ,KAAK,SAAS,SAASA,KAAI;AAAA,EAC3E;AAAA,EAEA,iBAAiBA,OAAsB;AACrC,WAAO,YAAYA,KAAI;AAAA,EACzB;AAAA,EAEA,gBAAwB;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,sBAAuC;AAGrC,WAAO,IAAI,4BAA2B,cAAc;AAAA,EACtD;AAAA,EAEA,kBAA0B;AACxB,WAAO;AAAA,EACT;AAAA,EAEA,gBAAwB;AACtB,WAAO,KAAK,KAAK,SAAS;AAAA,EAC5B;AACF;AAMO,IAAM,wBAAN,MAAuD;AAAA,EAC5D,YACU,SAAiB,aACjB,YAAoB,cAC5B;AAFQ;AACA;AAAA,EACP;AAAA,EAEH,kBAAkB,MAAsB;AACtC,WAAO,GAAG,KAAK,MAAM,SAAS,IAAI;AAAA,EACpC;AAAA,EAEA,mBAA2B;AACzB,WAAO,gBAAgB,KAAK,SAAS;AAAA,EACvC;AAAA,EAEA,iBAAyB;AACvB,WAAO,GAAG,KAAK,MAAM;AAAA,EACvB;AAAA,EAEA,kBAAkBA,OAAsB;AAEtC,WAAO,IAAI,KAAK,SAAS,SAASA,KAAI,QAAQ,KAAK,SAAS,SAASA,KAAI;AAAA,EAC3E;AAAA,EAEA,iBAAiBA,OAAsB;AACrC,WAAO,GAAG,KAAK,MAAM,SAASA,KAAI;AAAA,EACpC;AAAA,EAEA,gBAAwB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,sBAAuC;AAErC,WAAO;AAAA,EACT;AAAA,EAEA,kBAA0B;AACxB,WAAO,KAAK,KAAK,MAAM,cAAc,KAAK,SAAS;AAAA,EACrD;AAAA,EAEA,gBAAwB;AACtB,WAAO,KAAK,KAAK,MAAM,KAAK,KAAK,SAAS;AAAA,EAC5C;AACF;;;ACxJO,SAAS,yBACd,KACA,SACA,UACQ;AACR,UAAQ,IAAI,MAAM;AAAA,IAChB,KAAK;AACH,aAAO,eAAgB,IAAsB,KAAK;AAAA,IAEpD,KAAK;AACH,aAAO,iBAAiB,aAAc,IAAsB,KAAK,CAAC;AAAA,IAEpE,KAAK;AACH,aAAO,cAAe,IAAuB,KAAK;AAAA,IAEpD,KAAK;AACH,aAAO;AAAA,IAET,KAAK;AACH,aAAO,SAAS,kBAAmB,IAAmB,IAAI;AAAA,IAE5D,KAAK;AACH,aAAO,SAAS,iBAAiB;AAAA,IAEnC,KAAK;AACH,aAAO,SAAS,eAAe;AAAA,IAEjC,KAAK,YAAY;AACf,YAAM,MAAM;AACZ,YAAM,OAAO,yBAAyB,IAAI,MAAM,SAAS,QAAQ;AACjE,YAAM,QAAQ,yBAAyB,IAAI,OAAO,SAAS,QAAQ;AACnE,aAAO,0BAA0B,IAAI,IAAI,MAAM,KAAK;AAAA,IACtD;AAAA,IAEA,KAAK,WAAW;AACd,YAAM,MAAM;AACZ,YAAM,UAAU,yBAAyB,IAAI,SAAS,SAAS,QAAQ;AACvE,cAAQ,IAAI,IAAI;AAAA,QACd,KAAK;AACH,iBAAO,gBAAgB,OAAO;AAAA,QAChC,KAAK;AACH,iBAAO,eAAe,OAAO;AAAA,QAC/B;AACE,gBAAM,IAAI,MAAM,2BAA2B,IAAI,EAAE,EAAE;AAAA,MACvD;AAAA,IACF;AAAA,IAEA,KAAK,aAAa;AAChB,YAAM,MAAM;AACZ,YAAM,OAAO,yBAAyB,IAAI,WAAW,SAAS,QAAQ;AACtE,YAAM,OAAO,yBAAyB,IAAI,YAAY,SAAS,QAAQ;AACvE,YAAM,MAAM,yBAAyB,IAAI,WAAW,SAAS,QAAQ;AACrE,aAAO,IAAI,IAAI,eAAe,IAAI,MAAM,GAAG;AAAA,IAC7C;AAAA,IAEA,KAAK,gBAAgB;AACnB,YAAM,KAAK;AAEX,YAAM,aAAa,gBAAgB,EAAE;AACrC,UAAI,YAAY;AACd,eAAO,SAAS,kBAAkB,UAAU;AAAA,MAC9C;AAEA,UAAI,sBAAsB,EAAE,GAAG;AAC7B,cAAM,YAAY,eAAe,EAAE;AACnC,eAAO,SAAS,iBAAiB,SAAS;AAAA,MAC5C;AAEA,YAAM,MAAM,yBAAyB,GAAG,QAAQ,SAAS,QAAQ;AACjE,aAAO,eAAe,GAAG,MAAM,GAAG,QAAQ;AAAA,IAC5C;AAAA,IAEA,KAAK,eAAe;AAClB,YAAM,KAAK;AACX,YAAM,MAAM,yBAAyB,GAAG,QAAQ,SAAS,QAAQ;AACjE,YAAM,MAAM,yBAAyB,GAAG,OAAO,SAAS,QAAQ;AAChE,aAAO,YAAY,GAAG,KAAK,GAAG;AAAA,IAChC;AAAA,IAEA,KAAK,gBAAgB;AACnB,YAAM,KAAK;AACX,UAAI,GAAG,OAAO,SAAS,cAAc;AACnC,cAAM,OAAQ,GAAG,OAAsB;AAGvC,YAAI,SAAS,UAAU;AACrB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,QAAQ;AAAA,QAC/D;AACA,YAAI,SAAS,OAAO;AAClB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,KAAK;AAAA,QAC5D;AACA,YAAI,SAAS,UAAU;AACrB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,QAAQ;AAAA,QAC/D;AACA,YAAI,SAAS,OAAO;AAClB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,KAAK;AAAA,QAC5D;AACA,YAAI,SAAS,QAAQ;AACnB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,MAAM;AAAA,QAC7D;AAGA,cAAM,OAAO,GAAG,KAAK,IAAI,CAAC,QAAQ,yBAAyB,KAAK,SAAS,QAAQ,CAAC;AAClF,cAAM,UAAU,KAAK;AAGrB,YAAI,YAAY,GAAG;AACjB,iBAAO,qBAAqB,IAAI,gBAAgB,KAAK,CAAC,CAAC;AAAA,QACzD,WAAW,YAAY,GAAG;AACxB,iBAAO,qBAAqB,IAAI,gBAAgB,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,QACrE,WAAW,YAAY,GAAG;AACxB,iBAAO,qBAAqB,IAAI,gBAAgB,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,QACjF,OAAO;AACL,iBAAO,qBAAqB,IAAI,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,QACxD;AAAA,MACF;AACA,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AAAA,IAEA,KAAK,YAAY;AACf,YAAM,OAAO;AACb,YAAM,QAAQ,yBAAyB,KAAK,OAAO,SAAS,QAAQ;AACpE,YAAM,MAAM,yBAAyB,KAAK,KAAK,SAAS,QAAQ;AAChE,aAAO,kBAAkB,KAAK,KAAK,GAAG,KAAK,KAAK,cAAc,KAAK,KAAK,YAAY;AAAA,IACtF;AAAA,IAEA,KAAK,gBAAgB;AACnB,YAAM,KAAK;AACX,UAAI,GAAG,SAAS,WAAW,GAAG;AAC5B,eAAO;AAAA,MACT;AACA,YAAM,WAAW,GAAG,SAAS,IAAI,CAAC,MAAM,yBAAyB,GAAG,SAAS,QAAQ,CAAC;AACtF,aAAO,gBAAgB,SAAS,KAAK,IAAI,CAAC;AAAA,IAC5C;AAAA,IAEA,KAAK,iBAAiB;AACpB,YAAM,KAAK;AACX,UAAI,GAAG,WAAW,WAAW,GAAG;AAC9B,eAAO;AAAA,MACT;AAEA,YAAM,gBAAgB,SAAS,oBAAoB;AACnD,YAAM,WAAW,QAAQ,YAAY,QAAQ;AAC7C,YAAM,QAAQ,GAAG,WAAW,IAAI,CAAC,MAAM;AACrC,cAAM,QAAQ,yBAAyB,EAAE,OAAO,SAAS,aAAa;AACtE,eAAO,oBAAoB,EAAE,GAAG,MAAM,KAAK;AAAA,MAC7C,CAAC;AAED,YAAM,aAAa;AAAA,wBACD,QAAQ,gBAAgB,SAAS,gBAAgB,CAAC;AAAA;AAAA,EAExE,MAAM,KAAK,IAAI,CAAC;AAAA;AAAA;AAGZ,cAAQ,gBAAgB,IAAI,gBAAgB,QAAQ,IAAI,UAAU;AAClE,aAAO,gBAAgB,QAAQ,OAAO,SAAS,cAAc,CAAC;AAAA,IAChE;AAAA,IAEA,KAAK,mBAAmB;AACtB,YAAM,KAAK;AACX,YAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS;AACnC,YAAI,UAAU,MAAM;AAClB,iBAAO,IAAI,aAAa,KAAK,IAAI,CAAC;AAAA,QACpC,OAAO;AACL,iBAAO,IAAI,yBAAyB,KAAK,MAAM,SAAS,QAAQ,CAAC;AAAA,QACnE;AAAA,MACF,CAAC;AACD,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO;AAAA,MACT;AACA,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO,gBAAgB,MAAM,CAAC,CAAC;AAAA,MACjC;AACA,aAAO,gBAAgB,MAAM,KAAK,KAAK,CAAC;AAAA,IAC1C;AAAA,IAEA;AACE,YAAM,IAAI,MAAM,gCAAiC,IAAY,IAAI,EAAE;AAAA,EACvE;AACF;AAYA,SAAS,uBACP,KACA,SACA,UACA,QACQ;AACR,QAAM,eAAe,WAAW,WAAW,IAAI;AAC/C,MAAI,IAAI,KAAK,WAAW,cAAc;AACpC,UAAM,IAAI;AAAA,MACR,GAAG,MAAM,uBAAuB,YAAY,mBAAmB,IAAI,KAAK,MAAM;AAAA,IAChF;AAAA,EACF;AAEA,QAAM,YAAY,IAAI,KAAK,CAAC;AAC5B,QAAM,aAAa,IAAI,KAAK,CAAC;AAG7B,QAAM,YAAY,yBAAyB,WAAW,SAAS,QAAQ;AAGvE,QAAM,gBAAgB,SAAS,oBAAoB;AACnD,QAAM,aAAa,yBAAyB,YAAY,SAAS,aAAa;AAE9E,QAAM,WAAW,QAAQ,YAAY,MAAM;AAC3C,QAAM,cAAc,SAAS,gBAAgB;AAC7C,QAAM,YAAY,SAAS,cAAc;AAEzC,MAAI;AAEJ,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,mBAAa;AAAA,wBACK,QAAQ,4BAA4B,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAW7D,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOd;AAAA,IAEF,KAAK;AACH,mBAAa;AAAA,qBACE,QAAQ,4BAA4B,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,qBAW/C,UAAU;AAAA;AAAA;AAAA;AAAA;AAKzB;AAAA,IAEF,KAAK,UAAU;AACb,YAAM,cAAc,IAAI,KAAK,CAAC;AAC9B,YAAM,cAAc,yBAAyB,aAAa,SAAS,QAAQ;AAC3E,mBAAa;AAAA,wBACK,QAAQ,4CAA4C,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAYrE,UAAU;AAAA;AAAA;AAAA;AAAA;AAKtB,cAAQ,gBAAgB,IAAI,gBAAgB,QAAQ,IAAI,UAAU;AAClE,aAAO,gBAAgB,QAAQ,SAAS,SAAS,KAAK,WAAW,GAAG,SAAS;AAAA,IAC/E;AAAA,IAEA,KAAK;AACH,mBAAa;AAAA,qBACE,QAAQ,4BAA4B,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAUzD,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOf;AAAA,IAEF,KAAK;AACH,mBAAa;AAAA,sBACG,QAAQ,4BAA4B,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAU3D,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOd;AAAA,EACJ;AAEA,UAAQ,gBAAgB,IAAI,GAAG,MAAM,UAAU,QAAQ,IAAI,UAAU;AACrE,SAAO,GAAG,MAAM,UAAU,QAAQ,SAAS,SAAS,GAAG,SAAS;AAClE;AAeO,SAAS,0BAA0B,IAAY,MAAc,OAAuB;AACzF,UAAQ,IAAI;AAAA;AAAA,IAEV,KAAK;AACH,aAAO,aAAa,IAAI,KAAK,KAAK;AAAA,IACpC,KAAK;AACH,aAAO,kBAAkB,IAAI,KAAK,KAAK;AAAA,IACzC,KAAK;AACH,aAAO,kBAAkB,IAAI,KAAK,KAAK;AAAA,IACzC,KAAK;AACH,aAAO,gBAAgB,IAAI,KAAK,KAAK;AAAA,IACvC,KAAK;AACH,aAAO,gBAAgB,IAAI,KAAK,KAAK;AAAA,IACvC,KAAK;AACH,aAAO,eAAe,IAAI,KAAK,KAAK;AAAA;AAAA,IAGtC,KAAK;AACH,aAAO,0BAA0B,IAAI,KAAK,KAAK;AAAA,IACjD,KAAK;AACH,aAAO,2BAA2B,IAAI,KAAK,KAAK;AAAA,IAClD,KAAK;AACH,aAAO,4BAA4B,IAAI,KAAK,KAAK;AAAA,IACnD,KAAK;AACH,aAAO,4BAA4B,IAAI,KAAK,KAAK;AAAA,IACnD,KAAK;AACH,aAAO,4BAA4B,IAAI,KAAK,KAAK;AAAA,IACnD,KAAK;AACH,aAAO,4BAA4B,IAAI,KAAK,KAAK;AAAA;AAAA,IAGnD,KAAK;AACH,aAAO,KAAK,IAAI,iBAAiB,KAAK,QAAQ,IAAI;AAAA,IACpD,KAAK;AACH,aAAO,KAAK,IAAI,iBAAiB,IAAI,QAAQ,KAAK;AAAA;AAAA,IAGpD,KAAK;AACH,aAAO,IAAI,IAAI,eAAe,KAAK,MAAM,IAAI;AAAA;AAAA,IAG/C,KAAK;AACH,aAAO,WAAW,IAAI,KAAK,KAAK;AAAA,IAClC,KAAK;AACH,aAAO,uBAAuB,IAAI,KAAK,KAAK;AAAA,IAE9C;AACE,YAAM,IAAI,MAAM,4BAA4B,EAAE,EAAE;AAAA,EACpD;AACF;AASO,SAAS,aAAa,GAAmB;AAC9C,SAAO,EACJ,QAAQ,OAAO,MAAM,EACrB,QAAQ,MAAM,KAAK,EACnB,QAAQ,OAAO,KAAK,EACpB,QAAQ,OAAO,KAAK,EACpB,QAAQ,OAAO,KAAK;AACzB;AAQO,SAAS,gBAAgB,KAAkC;AAChE,MAAI,IAAI,OAAO,SAAS,aAAa;AACnC,WAAO,IAAI;AAAA,EACb;AACA,MAAI,IAAI,OAAO,SAAS,gBAAgB;AACtC,UAAM,aAAa,gBAAgB,IAAI,MAAsB;AAC7D,QAAI,eAAe,MAAM;AACvB,aAAO,GAAG,UAAU,IAAI,IAAI,QAAQ;AAAA,IACtC;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,sBAAsB,KAA4B;AAChE,MAAI,IAAI,OAAO,SAAS,cAAc;AACpC,WAAQ,IAAI,OAAsB,SAAS;AAAA,EAC7C,WAAW,IAAI,OAAO,SAAS,gBAAgB;AAC7C,WAAO,sBAAsB,IAAI,MAAsB;AAAA,EACzD;AACA,SAAO;AACT;AAKO,SAAS,eAAe,KAA2B;AACxD,MAAI,IAAI,OAAO,SAAS,cAAc;AACpC,WAAO,GAAI,IAAI,OAAsB,IAAI,IAAI,IAAI,QAAQ;AAAA,EAC3D,WAAW,IAAI,OAAO,SAAS,gBAAgB;AAC7C,WAAO,GAAG,eAAe,IAAI,MAAsB,CAAC,IAAI,IAAI,QAAQ;AAAA,EACtE;AACA,QAAM,IAAI,MAAM,0CAA0C;AAC5D;AAOA,IAAM,mBAAmB,IAAI,wBAAwB;AAgB9C,SAAS,kBAAkB,KAAoB,SAAqC;AACzF,SAAO,yBAAyB,KAAK,SAAS,gBAAgB;AAChE;;;ACxdO,SAAS,sBACd,MACA,SACoB;AACpB,QAAM,cAAc,KAAK,QAAQ;AACjC,QAAM,cAAc,KAAK,QAAQ,gBAAgB;AACjD,QAAM,aAAa,KAAK,QAAQ;AAChC,QAAM,aAAa,KAAK,QAAQ;AAChC,QAAM,gBAAgB,KAAK,QAAQ;AACnC,QAAM,cAAc,WAAW,KAAK,EAAE;AAItC,MAAI,kBAAkB,QAAQ;AAC5B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAGA,MAAI,YAAY;AACd,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAIA,QAAM,WAAW,IAAI,2BAA2B,QAAQ;AACxD,QAAM,wBAAwB,YAC3B,IAAI,CAAC,SAAS;AACb,QAAI;AACF,YAAM,MAAM,QAAQ,gBAAgB,KAAK,KAAK;AAE9C,YAAM,WAAW,yBAAyB,KAAK,SAAS,QAAQ;AAChE,aAAO,iBAAiB,KAAK,GAAG,MAAM,QAAQ;AAAA,IAChD,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,iCAAiC,KAAK,KAAK,cAAc,KAAK,GAAG,MAAM,CAAC,EAAE;AAAA,IAC5F;AAAA,EACF,CAAC,EACA,KAAK,IAAI;AAEZ,MAAI,aAAa;AACf,WAAO;AAAA,+BACoB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYxC,qBAAqB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKrB;AAEA,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA,EAGxC,qBAAqB;AAAA;AAAA;AAAA;AAAA;AAKvB;AAiBA,SAAS,4BACP,MACA,SACA,aACA,aACA,YACA,YACA,aACoB;AAEpB,QAAM,WAAW,QAAQ,YAAY,YAAY;AAIjD,QAAM,WAAW,IAAI,sBAAsB,aAAa,YAAY;AACpE,QAAM,wBAAwB,YAC3B,IAAI,CAAC,SAAS;AACb,QAAI;AACF,YAAM,MAAM,QAAQ,gBAAgB,KAAK,KAAK;AAE9C,YAAM,WAAW,yBAAyB,KAAK,SAAS,QAAQ;AAChE,aAAO,uBAAuB,KAAK,GAAG,MAAM,QAAQ;AAAA,IACtD,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,iCAAiC,KAAK,KAAK,cAAc,KAAK,GAAG,MAAM,CAAC,EAAE;AAAA,IAC5F;AAAA,EACF,CAAC,EACA,KAAK,IAAI;AAKZ,QAAM,aAAa;AAAA,4BACO,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqClC,qBAAqB;AAAA;AAAA;AAAA;AAKrB,UAAQ,gBAAgB,IAAI,oBAAoB,QAAQ,IAAI,UAAU;AAGtE,MAAI,aAAa;AACf,WAAO;AAAA,+BACoB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8CAWI,UAAU;AAAA,8BAC1B,UAAU;AAAA;AAAA,uEAE+B,cAAc,UAAU;AAAA,0CACrD,QAAQ;AAAA,gBAClC,cAAc,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,EAKtC;AAEA,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA,8CAGI,UAAU;AAAA,8BAC1B,UAAU;AAAA;AAAA,uEAE+B,cAAc,UAAU;AAAA,0CACrD,QAAQ;AAAA,gBAClC,cAAc,UAAU;AAAA;AAAA;AAAA;AAAA;AAKxC;AAiBA,SAAS,0BACP,MACA,SACA,aACA,aACA,YACA,YACA,aACoB;AACpB,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AAGA,QAAM,WAAW,QAAQ,YAAY,UAAU;AAI/C,QAAM,WAAW,IAAI,sBAAsB,WAAW,YAAY;AAClE,QAAM,wBAAwB,YAC3B,IAAI,CAAC,SAAS;AACb,QAAI;AACF,YAAM,MAAM,QAAQ,gBAAgB,KAAK,KAAK;AAE9C,YAAM,WAAW,yBAAyB,KAAK,SAAS,QAAQ;AAChE,aAAO,yBAAyB,KAAK,GAAG,MAAM,QAAQ;AAAA,IACxD,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,iCAAiC,KAAK,KAAK,cAAc,KAAK,GAAG,MAAM,CAAC,EAAE;AAAA,IAC5F;AAAA,EACF,CAAC,EACA,KAAK,IAAI;AAGZ,QAAM,aAAa;AAAA,0BACK,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8ChC,qBAAqB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQrB,UAAQ,gBAAgB,IAAI,kBAAkB,QAAQ,IAAI,UAAU;AAGpE,QAAM,sBAAsB,cAAc;AAG1C,MAAI,aAAa;AACf,WAAO;AAAA,+BACoB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,6CAWG,UAAU;AAAA,8BACzB,UAAU;AAAA;AAAA;AAAA,sCAGF,QAAQ;AAAA;AAAA,mCAEX,mBAAmB;AAAA,gBACtC,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKjC;AAEA,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA,6CAGG,UAAU;AAAA,8BACzB,UAAU;AAAA;AAAA;AAAA,sCAGF,QAAQ;AAAA;AAAA,mCAEX,mBAAmB;AAAA,gBACtC,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAKnC;;;ACxXO,SAAS,yBAAyB,KAAU,eAA4B;AAC7E,MAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;AACnC,WAAO;AAAA,EACT;AAGA,MAAI,IAAI,SAAS,aAAa;AAC5B,WAAO,EAAE,MAAM,cAAc,MAAM,cAAc;AAAA,EACnD;AAGA,QAAM,SAAc,EAAE,MAAM,IAAI,KAAK;AAErC,aAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,QAAI,QAAQ,QAAQ;AAClB;AAAA,IACF;AAEA,UAAM,QAAQ,IAAI,GAAG;AACrB,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,aAAO,GAAG,IAAI,MAAM,IAAI,CAAC,SAAS,yBAAyB,MAAM,aAAa,CAAC;AAAA,IACjF,WAAW,SAAS,OAAO,UAAU,UAAU;AAC7C,aAAO,GAAG,IAAI,yBAAyB,OAAO,aAAa;AAAA,IAC7D,OAAO;AACL,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AAEA,SAAO;AACT;AAaO,SAAS,gCAAgC,KAAU,SAAqC;AAE7F,MAAI,IAAI,SAAS,cAAc;AAC7B,WAAQ,IAAmB;AAAA,EAC7B;AAGA,MAAI,IAAI,SAAS,YAAY;AAC3B,UAAM,OAAO,gCAAgC,IAAI,MAAM,OAAO;AAC9D,UAAM,QAAQ,gCAAgC,IAAI,OAAO,OAAO;AAChE,WAAO,0BAA0B,IAAI,IAAI,MAAM,KAAK;AAAA,EACtD;AAGA,MAAI,IAAI,SAAS,WAAW;AAC1B,UAAM,UAAU,gCAAgC,IAAI,SAAS,OAAO;AACpE,YAAQ,IAAI,IAAI;AAAA,MACd,KAAK;AACH,eAAO,gBAAgB,OAAO;AAAA,MAChC,KAAK;AACH,eAAO,eAAe,OAAO;AAAA,MAC/B;AACE,cAAM,IAAI,MAAM,2BAA2B,IAAI,EAAE,EAAE;AAAA,IACvD;AAAA,EACF;AAGA,MAAI,IAAI,SAAS,gBAAgB;AAC/B,UAAM,SAAS,IAAI;AACnB,QAAI,OAAO,SAAS,cAAc;AAChC,YAAM,OAAO,IAAI,KAAK,IAAI,CAAC,QAAa,gCAAgC,KAAK,OAAO,CAAC;AACrF,YAAM,UAAU,KAAK;AAGrB,UAAI,YAAY,GAAG;AACjB,eAAO,qBAAqB,OAAO,IAAI,gBAAgB,KAAK,CAAC,CAAC;AAAA,MAChE,WAAW,YAAY,GAAG;AACxB,eAAO,qBAAqB,OAAO,IAAI,gBAAgB,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,MAC5E,WAAW,YAAY,GAAG;AACxB,eAAO,qBAAqB,OAAO,IAAI,gBAAgB,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,MACxF,OAAO;AACL,eAAO,qBAAqB,OAAO,IAAI,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC5D;AAGA,MAAI,IAAI,SAAS,gBAAgB;AAC/B,UAAM,MAAM,gCAAgC,IAAI,QAAQ,OAAO;AAC/D,WAAO,eAAe,GAAG,MAAM,IAAI,QAAQ;AAAA,EAC7C;AAGA,MAAI,IAAI,SAAS,eAAe;AAC9B,UAAM,MAAM,gCAAgC,IAAI,QAAQ,OAAO;AAC/D,UAAM,MAAM,gCAAgC,IAAI,OAAO,OAAO;AAC9D,WAAO,YAAY,GAAG,KAAK,GAAG;AAAA,EAChC;AAGA,MAAI,IAAI,SAAS,aAAa;AAC5B,UAAM,OAAO,gCAAgC,IAAI,WAAW,OAAO;AACnE,UAAM,OAAO,gCAAgC,IAAI,YAAY,OAAO;AACpE,UAAM,MAAM,gCAAgC,IAAI,WAAW,OAAO;AAClE,WAAO,IAAI,IAAI,eAAe,IAAI,MAAM,GAAG;AAAA,EAC7C;AAGA,SAAO,kBAAkB,KAAK,OAAO;AACvC;;;ACpHA,SAAS,kBACP,MACA,WACA,OACA,SACQ;AAIR,MAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC,WAAO;AAAA,EACT;AAEA,MAAI;AAMF,QAAI,CAAC,SAAS,UAAU,KAAK;AAE3B,YAAMC,OAAM,QAAQ,gBAAgB,IAAI;AACxC,YAAMC,gBAAe,kBAAkBD,MAAK,OAAO;AACnD,aAAO,GAAGC,aAAY;AAAA,IACxB;AAIA,UAAM,MAAM,QAAQ,qBAAqB,IAAI;AAI7C,UAAM,WAAW,QAAQ,gBAAgB,KAAK;AAC9C,UAAM,gBAAgB,kBAAkB,UAAU,OAAO;AAKzD,UAAM,iBAAiB,yBAAyB,KAAK,aAAa;AAGlE,UAAM,eAAe,gCAAgC,gBAAgB,OAAO;AAG5E,WAAO,GAAG,YAAY;AAAA,EACxB,SAAS,GAAG;AAGV,UAAM,IAAI;AAAA,MACR,+CAA+C,IAAI,gBAAgB,KAAK,MAAM,CAAC;AAAA,IACjF;AAAA,EACF;AACF;AAWA,SAAS,mBACP,OACA,YACA,OACA,SACQ;AAGR,MAAI,CAAC,SAAS,UAAU,OAAO,UAAU,IAAI;AAC3C,WAAO;AAAA,EACT;AAEA,QAAM,kBAAkB,cAAc,IAAI,YAAY;AAItD,QAAM,iBACH,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,KAC3C,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG;AAG9C,QAAM,gBAAgB,iBAAiB,MAAM,MAAM,GAAG,EAAE,IAAI;AAE5D,UAAQ,gBAAgB;AAAA,IACtB,KAAK,cAAc;AAGjB,YAAM,MAAM,QAAQ,gBAAgB,KAAK;AACzC,aAAO,kBAAkB,KAAK,OAAO;AAAA,IACvC;AAAA,IAEA,KAAK;AAAA,IACL,KAAK;AAGH,YAAM,UAAU,cAAc,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AACxE,aAAO,mBAAmB,UAAU;AAAA,IAEtC,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,eAAe,WAAW,KAAK,CAAC;AAAA,IAEzC,KAAK;AAAA,IACL,KAAK;AACH,aAAO,cAAc,MAAM,YAAY,MAAM,MAAM;AAAA,IAErD;AAME,UAAI,gBAAgB;AAElB,cAAM,iBAAiB,cAAc,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AAC/E,eAAO,mBAAmB,iBAAiB;AAAA,MAC7C;AAGA,UAAI,MAAM,YAAY,MAAM,UAAU,MAAM,YAAY,MAAM,SAAS;AACrE,eAAO,cAAc,MAAM,YAAY,MAAM,MAAM;AAAA,MACrD;AAIA,UAAI,uCAAuC,KAAK,KAAK,GAAG;AACtD,eAAO,eAAe,WAAW,KAAK,CAAC;AAAA,MACzC;AAIA,UAAI;AACF,cAAM,MAAM,QAAQ,gBAAgB,KAAK;AACzC,eAAO,kBAAkB,KAAK,OAAO;AAAA,MACvC,SAAS,GAAG;AAGV,cAAM,IAAI;AAAA,UACR,mCAAmC,KAAK,gBAAgB,KAAK,MAAM,CAAC,4DACR,KAAK,WAAW,KAAK;AAAA,QACnF;AAAA,MACF;AAAA,EACJ;AACF;AAaA,SAAS,oBAAoB,MAAc,QAAqD;AAE9F,QAAM,qBAAqB;AAC3B,QAAM,UAAU,KAAK,MAAM,kBAAkB,KAAK,CAAC;AAGnD,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,SAAS,SAAS;AAC3B,WAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAAA,EAChD;AAGA,QAAM,UAAU,oBAAI,IAAoB;AACxC,MAAI,aAAa;AACjB,aAAW,CAACC,UAAS,KAAK,KAAK,QAAQ;AACrC,QAAI,QAAQ,GAAG;AAEb,YAAM,YAAY,SAAS,WAAW,MAAM,CAAC,IAAI,YAAY;AAC7D,cAAQ,IAAIA,UAAS,SAAS;AAAA,IAChC;AAAA,EACF;AAGA,MAAI,QAAQ,SAAS,GAAG;AACtB,WAAO,EAAE,WAAW,IAAI,KAAK;AAAA,EAC/B;AAGA,QAAM,YAAY,MAAM,KAAK,QAAQ,QAAQ,CAAC,EAC3C,IAAI,CAAC,CAACA,UAAS,SAAS,MAAM,SAAS,SAAS,aAAaA,QAAO,GAAG,EACvE,KAAK,IAAI;AAGZ,MAAI,kBAAkB;AACtB,aAAW,CAACA,UAAS,SAAS,KAAK,SAAS;AAE1C,UAAM,iBAAiBA,SAAQ,QAAQ,uBAAuB,MAAM;AACpE,sBAAkB,gBAAgB,QAAQ,IAAI,OAAO,gBAAgB,GAAG,GAAG,SAAS;AAAA,EACtF;AAEA,SAAO,EAAE,WAAW,MAAM,gBAAgB;AAC5C;AAqBO,SAAS,yBACd,MACA,SACoB;AACpB,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB;AAAA,IACjB;AAAA,EACF,IAAI,KAAK;AAGT,QAAM,kBAAkB,wBACtB,QAAQ,QAAQ,mBAAmB,EAAE,MAAM,aAAa;AAG1D,QAAM,eACJ,cAAc,aACd,cAAc,YACd,cAAc,eACd,cAAc,iBACd,cAAc;AAGhB,MAAI;AACJ,MAAI,cAAc;AAChB,wBAAoB;AAAA,EACtB,OAAO;AACL,wBAAoB;AAAA,EACtB;AAGA,QAAM,eAAe,MAClB,IAAI,CAAC,MAAM,QAAQ;AAElB,UAAM,aAAa,OAChB,IAAI,CAAC,UAAU;AACd,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC,eAAO;AAAA,MACT;AACA,aAAO,kBAAkB,MAAM,MAAM,MAAM,MAAM,OAAO,OAAO;AAAA,IACjE,CAAC,EACA,KAAK,MAAM;AAGd,UAAM,oBAAoB,QACvB,IAAI,CAAC,WAAW;AACf,YAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,UAAI,CAAC,SAAS,UAAU,MAAM,UAAU,KAAK;AAC3C,eAAO;AAAA,MACT;AACA,YAAM,WAAW,mBAAmB,OAAO,OAAO,MAAM,OAAO,OAAO,OAAO;AAC7E,aAAO,mBAAmB,OAAO,KAAK,MAAM,QAAQ;AAAA,IACtD,CAAC,EACA,OAAO,OAAO,EACd,KAAK,IAAI;AAGZ,QAAI,cAAc;AAEhB,aAAO;AAAA,QACP,cAAc,MAAM;AAAA;AAAA,EAE1B,iBAAiB;AAAA;AAAA;AAAA,IAGb,OAAO;AAEL,YAAM,kBACJ,QAAQ,IAAI,OAAO,cAAc,MAAM,MAAM,YAAY,cAAc,MAAM;AAC/E,aAAO,GAAG,eAAe;AAAA;AAAA,EAE/B,iBAAiB;AAAA;AAAA;AAAA,IAGb;AAAA,EACF,CAAC,EACA,KAAK,eAAe,OAAO,IAAI;AAGlC,WAAS,yBAAiC;AACxC,UAAM,aAAa;AAKnB,UAAM,0BAA0B;AAAA;AAAA;AAIhC,QAAI,gBAAgB,SAAS,cAAc;AACzC,aAAO,iFAAiF,KAAK,IAAI,YAAY,KAAK,EAAE;AAAA,IAAoC,UAAU;AAAA,IACpK,WAAW,gBAAgB,SAAS,iBAAiB;AACnD,YAAM,eAAe,gBAAgB;AAGrC,UAAI;AACJ,cAAQ,OAAO,cAAc;AAAA,QAC3B,KAAK;AACH,6BAAmB,iBAAiB,OAAO,YAAY,EAAE,QAAQ,MAAM,KAAK,CAAC;AAC7E;AAAA,QACF,KAAK;AACH,6BAAmB,eAAe,YAAY;AAC9C;AAAA,QACF,KAAK;AACH,6BAAmB,cAAc,YAAY;AAC7C;AAAA,QACF;AACE,6BAAmB,iBAAiB,OAAO,YAAY,CAAC;AAAA,MAC5D;AAGA,YAAM,qBAAqB,QACxB,IAAI,CAAC,WAAW;AACf,eAAO,mBAAmB,OAAO,KAAK,MAAM,gBAAgB;AAAA,MAC9D,CAAC,EACA,KAAK,IAAI;AAEZ,YAAM,0BACJ,QAAQ,SAAS,IACb;AAAA,EAA6C,kBAAkB;AAAA,kCAC/D;AAEN,UAAI,cAAc;AAEhB,eAAO;AAAA,EAA6C,kBAAkB;AAAA;AAAA,MACxE,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AAGL,UAAI,eAAe,cAAc,SAAS;AACxC,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAKA,MAAI;AACJ,MAAI,cAAc,aAAa,cAAc,aAAa;AAExD,QAAI,gBAAgB,SAAS,cAAc;AACzC,oBAAc;AAAA;AAAA,EAElB,uBAAuB,CAAC;AAAA;AAAA;AAAA,IAGtB,WAAW,gBAAgB,SAAS,iBAAiB;AACnD,oBAAc;AAAA;AAAA,EAElB,uBAAuB,CAAC;AAAA;AAAA;AAAA,IAGtB,OAAO;AACL,oBAAc;AAAA,IAChB;AAAA,EACF,WAAW,cAAc,UAAU;AACjC,kBAAc;AAAA;AAAA;AAAA;AAAA;AAAA,MAKZ,uBAAuB,CAAC;AAAA;AAAA;AAAA,oFAGsD,KAAK,IAAI,YAAY,KAAK,EAAE;AAAA;AAAA;AAAA,EAG9G,WAAW,cAAc,iBAAiB,cAAc,YAAY;AAClE,QAAI,QAAQ,WAAW,GAAG;AACxB,YAAM,IAAI,MAAM,GAAG,UAAU,YAAY,CAAC,gDAAgD;AAAA,IAC5F;AAEA,UAAM,gBAAgB,QAAQ,CAAC;AAC/B,kBAAc;AAAA;AAAA;AAAA,sCAGoB,cAAc,KAAK;AAAA,sCACnB,cAAc,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBvD,uBAAuB,CAAC;AAAA;AAAA;AAAA,IAItB,cAAc,aACV,qEACA,8BACN;AAAA,EACA,OAAO;AAEL,kBAAc;AAAA;AAAA,MAAmB,uBAAuB,CAAC;AAAA;AAAA,EAC3D;AAEA,QAAM,cAAc,WAAW,KAAK,EAAE;AAGtC,QAAM,kBAAkB;AAAA,+BACK,WAAW;AAAA,IACtC,iBAAiB;AAAA;AAAA,EAEnB,YAAY;AAAA,EACZ,WAAW;AAAA;AAAA;AAMX,MAAI,MAAM,SAAS,KAAK;AACtB,UAAM,EAAE,WAAW,MAAM,cAAc,IAAI,oBAAoB,iBAAiB,KAAK,EAAE;AACvF,QAAI,WAAW;AACb,aAAO,mDAAmD,KAAK,IAAI,MAAM,MAAM,MAAM;AAAA,EACzF,SAAS;AAAA;AAAA,EAET,aAAa;AAAA,IACX;AAAA,EACF;AAEA,SAAO;AACT;;;ACleO,SAAS,6BACdC,OACA,WACA,SAAiB,QACT;AACR,SAAO,kCAAkCA,KAAI;AAAA;AAAA,UAErC,MAAM,YAAY,SAAS;AAAA,UAC3B,MAAM,aAAaA,KAAI;AAAA,UACvB,MAAM,cAAc,MAAM;AAAA;AAAA,QAE5B,MAAM;AAAA,qBACO,MAAM,6BAA6B,MAAM;AAAA,MACxD,MAAM,2BAA2B,MAAM;AAAA;AAAA,MAEvC,MAAM;AAAA,cACE,MAAM,0BAA0B,MAAM;AAAA;AAAA;AAAA,QAG5C,MAAM,cAAc,MAAM;AAAA,aACrB,MAAM,WAAW,MAAM,QAAQ,MAAM,sBAAsB,MAAM;AAAA,YAClE,MAAM,WAAW,MAAM,UAAU,MAAM;AAAA,UACzC,MAAM,gBAAgB,MAAM,aAAa,MAAM,gBAAgB,MAAM;AAAA,QACvE,MAAM,cAAc,MAAM,gBAAgB,MAAM;AAAA;AAAA,cAE1C,MAAM;AAAA,QACZ,MAAM,gBAAgB,MAAM,uBAAuB,MAAM;AAAA,QACzD,MAAM,cAAc,MAAM;AAAA;AAAA;AAAA;AAAA,IAI9B,MAAM,gBAAgB,MAAM,UAAU,MAAM,uBAAuB,MAAM;AAAA;AAE7E;AAkBO,SAAS,6BACd,eACA,SAAiB,SACT;AACR,SAAO;AAAA,MACH,aAAa;AAAA,QACX,MAAM;AAAA,WACH,MAAM,WAAW,MAAM,QAAQ,MAAM,iBAAiB,MAAM;AAAA,UAC7D,MAAM,UAAU,MAAM,SAAS,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,SAKtC,MAAM,2BAA2B,MAAM,mBAAmB,MAAM;AAAA,MACnE,aAAa,QAAQ,MAAM,sBAAsB,MAAM;AAAA;AAAA;AAG7D;AAgBO,SAAS,2BACd,QACA,UACA,MAIQ;AACR,QAAM,cAAc,WAAW,MAAM;AACrC,QAAM,aAAuB,CAAC;AAG9B,aAAW,KAAK,mBAAmB,QAAQ,mBAAmB,WAAW,SAAS;AAElF,MAAI,CAAC,MAAM;AACT,WAAO,WAAW,KAAK,QAAQ;AAAA,EACjC;AAEA,QAAM,aAAa,KAAK,SAAS;AACjC,MAAI,YAAY;AACd,QAAI,CAAC,WAAW,SAAS,GAAG,GAAG;AAC7B,iBAAW,KAAK,YAAY,UAAU,sBAAsB,QAAQ,MAAM;AAAA,IAC5E,OAAO;AACL,iBAAW,KAAK,6BAA6B,YAAY,mBAAmB,QAAQ,IAAI,CAAC;AAAA,IAC3F;AAAA,EACF;AAOA,QAAM,kBACJ,KAAK,SAAS,uBACd,KAAK,SAAS,SAAS,KAAK,CAAC,MAA0B,EAAE,SAAS,EAAE,MAAM,SAAS,GAAG,CAAC;AACzF,QAAM,cACJ,KAAK,SAAS,oBAAoB,KAAK,SAAS,gBAAgB,QAAQ;AAE1E,MAAI,aAAa;AACf,eAAW,KAAK,6BAA6B,QAAQ,CAAC;AAAA,EACxD;AAEA,SAAO,WAAW,KAAK,QAAQ;AACjC;AAiBO,SAAS,6BAA6B,UAA0B;AAGrE,QAAM,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsBvB,SAAO,oCAAoC,QAAQ;AAAA;AAAA,yCAEZ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQvC,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOxB;;;ACzKA,SAAS,eAAe,aAAqB,SAAuC;AAClF,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC/D,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,SAAmB,CAAC;AAC1B,QAAM,QAAQ,CAAC,WAAW;AAE1B,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,YAAY,MAAM,MAAM;AAC9B,QAAI,QAAQ,IAAI,SAAS,GAAG;AAC1B;AAAA,IACF;AACA,YAAQ,IAAI,SAAS;AACrB,WAAO,KAAK,SAAS;AAGrB,UAAM,cAAc,QAAQ,IAAI,SAAS;AAIzC,QAAI,CAAC,aAAa;AAChB;AAAA,IACF;AAIA,QAAI,YAAY,SAAS,cAAc;AACrC;AAAA,IACF;AAGA,UAAM,gBAAgB,QAAQ,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,aAAa,SAAS;AAC9E,eAAW,QAAQ,eAAe;AAChC,YAAM,KAAK,KAAK,QAAQ;AAAA,IAC1B;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,yBACP,eACA,SAC4C;AAC5C,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAE/D,MAAI,cAAc,WAAW,GAAG;AAC9B,WAAO,EAAE,YAAY,IAAI,YAAY,eAAe;AAAA,EACtD;AAGA,QAAM,iBAAiB,cAAc,IAAI,CAAC,WAAW;AACnD,UAAM,OAAO,QAAQ,IAAI,MAAM;AAC/B,UAAM,WAAW,MAAM,QAAQ,WAAW,MAAM;AAChD,WAAO,2BAA2B,QAAQ,UAAU,IAAI;AAAA,EAC1D,CAAC;AAGD,QAAM,aAAa,cAAc,cAAc,SAAS,CAAC;AACzD,QAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,QAAM,eAAe,UAAU,QAAQ,WAAW,UAAU;AAG5D,QAAM,8BACJ,UAAU,SAAS,gBAAgB,UAAU,SAAS,gBAAgB;AAExE,MAAI,6BAA6B;AAE/B,mBAAe,KAAK,6BAA6B,uBAAuB,UAAU,CAAC;AACnF,WAAO;AAAA,MACL,YAAY,eAAe,KAAK,QAAQ;AAAA,MACxC,YAAY;AAAA,IACd;AAAA,EACF;AAEA,SAAO;AAAA,IACL,YAAY,eAAe,KAAK,QAAQ;AAAA,IACxC,YAAY,mBAAmB,YAAY;AAAA,EAC7C;AACF;AA0BO,SAAS,kBAAkB,MAAe,SAAiD;AAChG,QAAM,aAAa,KAAK;AACxB,QAAM;AAAA,IACJ;AAAA,IACA,WAAW;AAAA,IACX,iBAAiB;AAAA,EACnB,IAAI;AAEJ,QAAM,YAAY,gBAAgB;AAGlC,QAAM,kBAAkB,yBACtB,QAAQ,QAAQ,mBAAmB,EAAE,MAAM,aAAa;AAG1D,QAAM,gBACJ,cAAc,aACd,cAAc,eACd,cAAc,iBACd,cAAc;AAEhB,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAK/D,WAAS,oCAA6C;AACpD,QAAI,CAAC,eAAe;AAClB,aAAO;AAAA,IACT;AAEA,eAAW,aAAa,YAAY;AAClC,UAAI,UAAU,cAAc,MAAM,UAAU,UAAU,KAAK,MAAM,IAAI;AACnE;AAAA,MACF;AAGA,YAAM,OAAO,QAAQ,IAAI,MAAM;AAAA,QAC7B,CAAC,MAAM,EAAE,aAAa,KAAK,MAAM,EAAE,iBAAiB,UAAU;AAAA,MAChE;AACA,UAAI,CAAC,MAAM;AACT;AAAA,MACF;AAGA,YAAM,cAAc,eAAe,KAAK,UAAU,OAAO;AACzD,UAAI,YAAY,WAAW,GAAG;AAC5B,eAAO;AAAA,MACT;AAEA,YAAM,aAAa,YAAY,YAAY,SAAS,CAAC;AACrD,YAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,UAAI,CAAC,YAAY,SAAS,SAAS,cAAc;AAC/C,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,mBAAmB,WAAW;AAAA,MAClC,CAAC,MAAM,EAAE,cAAc,MAAM,EAAE,UAAU,KAAK,MAAM;AAAA,IACtD;AACA,QAAI,kBAAkB;AACpB,YAAM,OAAO,QAAQ,IAAI,MAAM;AAAA,QAC7B,CAAC,MAAM,EAAE,aAAa,KAAK,MAAM,EAAE,iBAAiB,iBAAiB;AAAA,MACvE;AACA,UAAI,MAAM;AACR,cAAM,cAAc,eAAe,KAAK,UAAU,OAAO;AACzD,YAAI,YAAY,SAAS,GAAG;AAC1B,gBAAM,aAAa,YAAY,YAAY,SAAS,CAAC;AACrD,gBAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,cAAI,CAAC,YAAY,SAAS,SAAS,cAAc;AAC/C,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,QAAM,4BAA4B,kCAAkC;AAGpE,QAAM,aAAgC,WAAW,IAAI,CAAC,cAAc;AAElE,UAAM,QAAQ,QAAQ,IAAI,MAAM;AAAA,MAC9B,CAAC,SAAS,KAAK,aAAa,KAAK,MAAM,KAAK,iBAAiB,UAAU;AAAA,IACzE;AACA,UAAM,gBAAgB,MAAM,IAAI,CAAC,SAAS,WAAW,KAAK,QAAQ,CAAC;AAEnE,WAAO;AAAA,MACL,IAAI,UAAU;AAAA,MACd,YAAY,UAAU;AAAA,MACtB,OAAO;AAAA;AAAA;AAAA,MAGP,WACE,CAAC,kBAAkB,UAAU,cAAc,MAAM,UAAU,UAAU,KAAK,MAAM;AAAA,IACpF;AAAA,EACF,CAAC;AAID,QAAM,oBAAoB,WAAW,OAAO,CAAC,MAAM,CAAC,EAAE,SAAS;AAC/D,QAAM,cAAc,gBAAgB,SAAY,WAAW,KAAK,CAAC,MAAM,EAAE,SAAS;AAGlF,QAAM,oBAAoB,gBAAgB,sCAAsC;AAGhF,WAAS,yBAAiC;AACxC,QAAI,gBAAgB,SAAS,cAAc;AACzC,aAAO,8EAA8E,KAAK,IAAI,YAAY,KAAK,EAAE;AAAA;AAAA,IACnH,WAAW,gBAAgB,SAAS,iBAAiB;AAEnD,YAAM,eAAe,gBAAgB;AACrC,UAAI;AACJ,cAAQ,OAAO,cAAc;AAAA,QAC3B,KAAK;AACH,6BAAmB,iBAAiB,OAAO,YAAY,EAAE,QAAQ,MAAM,KAAK,CAAC;AAC7E;AAAA,QACF,KAAK;AACH,6BAAmB,eAAe,YAAY;AAC9C;AAAA,QACF,KAAK;AACH,6BAAmB,cAAc,YAAY;AAC7C;AAAA,QACF;AACE,6BAAmB,iBAAiB,OAAO,YAAY,CAAC;AAAA,MAC5D;AAEA,aAAO,gBACH,uBAAuB,gBAAgB,QACvC,UAAU,gBAAgB;AAAA,IAChC,OAAO;AAEL,aAAO;AAAA,IACT;AAAA,EACF;AAGA,WAAS,gCAAwC;AAC/C,QAAI,CAAC,aAAa;AAChB,aAAO,uBAAuB;AAAA,IAChC;AAIA,QAAI,CAAC,YAAY,SAAS,YAAY,MAAM,WAAW,GAAG;AAExD,aAAO,uBAAuB;AAAA,IAChC;AAGA,UAAM,gBAAgB,YAAY,MAAM,CAAC;AAEzC,UAAM,cAAc,QAAQ,IAAI,MAAM;AAAA,MACpC,CAAC,MAAM,EAAE,aAAa,KAAK,MAAM,EAAE,iBAAiB,YAAY;AAAA,IAClE;AACA,UAAM,cAAc,aAAa,YAAY;AAC7C,UAAM,gBAAgB,eAAe,aAAa,OAAO;AAGzD,UAAM,EAAE,YAAAC,aAAY,WAAW,IAAI,yBAAyB,eAAe,OAAO;AAElF,QAAI,eAAe;AACjB,aAAO,OAAOA,WAAU;AAAA,mBAAsB,UAAU;AAAA,IAC1D,OAAO;AACL,aAAO,OAAOA,WAAU;AAAA,aAAgB,UAAU;AAAA,IACpD;AAAA,EACF;AAGA,MAAI;AACJ,MAAI;AAGJ,WAAS,2BAA2B,WAAsC;AACxE,QAAI,CAAC,UAAU,SAAS,UAAU,MAAM,WAAW,GAAG;AACpD,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,OAAO,QAAQ,IAAI,MAAM;AAAA,MAC7B,CAAC,MAAM,EAAE,aAAa,KAAK,MAAM,EAAE,iBAAiB,UAAU;AAAA,IAChE;AACA,UAAM,cAAc,MAAM,YAAY,UAAU,MAAM,CAAC;AACvD,WAAO,eAAe,aAAa,OAAO;AAAA,EAC5C;AAGA,MAAI,kBAAkB,WAAW,GAAG;AAClC,wBAAoB;AACpB,QAAI,eAAe,YAAY,SAAS,YAAY,MAAM,SAAS,GAAG;AAEpE,YAAM,gBAAgB,2BAA2B,WAAW;AAC5D,YAAM,EAAE,YAAAA,aAAY,WAAW,IAAI,yBAAyB,eAAe,OAAO;AAElF,UAAI,eAAe;AACjB,sBAAc;AAAA,IAClBA,WAAU;AAAA,iBACG,UAAU;AAAA;AAAA,MAErB,OAAO;AACL,sBAAc;AAAA,IAClBA,WAAU;AAAA,WACH,UAAU;AAAA,MACf;AAAA,IACF,OAAO;AAEL,oBAAc;AAAA,IAAO,uBAAuB,CAAC;AAAA,IAC/C;AAAA,EACF,OAAO;AAEL,wBAAoB,kBACjB,IAAI,CAAC,WAAW,QAAQ;AAEvB,UAAI;AAEJ,UAAI,UAAU,eAAe,MAAM,UAAU,WAAW,KAAK,MAAM,IAAI;AACrE,uBAAe;AAAA,MACjB,OAAO;AACL,YAAI;AACF,gBAAM,MAAM,QAAQ,gBAAgB,UAAU,UAAU;AAExD,gBAAM,WAAW,kBAAkB,KAAK,OAAO;AAC/C,yBAAe,GAAG,QAAQ;AAAA,QAC5B,QAAQ;AAGN,yBAAe;AAAA,QACjB;AAAA,MACF;AAGA,YAAM,gBAAgB,2BAA2B,SAAS;AAC1D,YAAM,EAAE,YAAAA,aAAY,WAAW,IAAI,yBAAyB,eAAe,OAAO;AAGlF,UAAI,eAAe;AAEjB,YAAI,2BAA2B;AAG7B,gBAAMC,cAAa;AAAA,QAAW,YAAY;AAAA,MAChDD,WAAU;AAAA;AAEJ,iBAAOC;AAAA,QACT;AACA,cAAM,aAAa;AAAA,QAAW,YAAY;AAAA,MAC9CD,WAAU;AAAA,mBACG,UAAU;AAAA;AAEnB,eAAO;AAAA,MACT,OAAO;AAEL,cAAM,SAAS,QAAQ,IAAI,WAAW;AACtC,cAAM,aAAa,GAAG,MAAM,KAAK,YAAY;AAAA,MACjDA,WAAU;AAAA,aACH,UAAU;AAAA;AAEb,eAAO;AAAA,MACT;AAAA,IACF,CAAC,EACA,KAAK,EAAE;AAEV,QAAI,eAAe;AAEjB,UAAI,cAAc,iBAAiB,cAAc,YAAY;AAC3D,YACE,eACA,gBAAgB,SAAS,gBACzB,gBAAgB,SAAS,iBACzB;AACA,wBAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EActB,8BAA8B,CAAC;AAAA;AAAA;AAAA,IAG7B,cAAc,aAAa,uBAAuB,8BAA8B;AAAA,QAC5E,OAAO;AACL,wBAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAcpB,cAAc,aACV,2DACA,8BACN;AAAA,QACM;AAAA,MACF,OAAO;AAEL,YAAI,2BAA2B;AAG7B,cAAI,aAAa;AACf,0BAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcxB,8BAA8B,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAYvB,OAAO;AACL,0BAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAahB;AAAA,QACF,WACE,eACA,gBAAgB,SAAS,gBACzB,gBAAgB,SAAS,iBACzB;AACA,wBAAc;AAAA;AAAA,EAEtB,8BAA8B,CAAC;AAAA;AAAA;AAAA,QAGzB,OAAO;AACL,wBAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF,OAAO;AAEL,UAAI,aAAa;AAGf,sBAAc;AAAA;AAAA;AAAA,EAA4D,8BAA8B,CAAC;AAAA;AAAA,MAC3G,OAAO;AAEL,sBAAc;AAAA;AAAA,MAAmB,uBAAuB,CAAC;AAAA;AAAA,MAC3D;AAAA,IACF;AAAA,EACF;AAEA,QAAM,cAAc,WAAW,KAAK,EAAE;AACtC,SAAO;AAAA,+BACsB,WAAW;AAAA,IACtC,iBAAiB;AAAA;AAAA,IAEjB,iBAAiB,GAAG,WAAW;AAAA;AAAA;AAGnC;;;ACrhBA,SAAS,mBAAmB,QAAwB;AAClD,SAAO,OAAO,WAAW,MAAM,CAAC;AAClC;AAKA,SAAS,8BACP,MACA,SACA,aACA,QACoB;AACpB,QAAM,cAAc,WAAW,KAAK,EAAE;AAGtC,QAAM,QAAQ,WAAW,WAAW;AAGpC,QAAM,kBAAkB,mBAAmB,KAAK;AAGhD,QAAM,UAAU,IAAI,IAAI,YAAY,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAK/D,QAAM,iBAAiB,gBACpB,IAAI,CAAC,WAAW;AACf,UAAM,UAAU,QAAQ,IAAI,MAAM;AAClC,QAAI,CAAC,WAAW,QAAQ,SAAS,gBAAgB,QAAQ,SAAS,aAAa;AAC7E,aAAO;AAAA,IACT;AACA,UAAM,aAAa,SAAS,WAAW,MAAM;AAE7C,WAAO,qBAAqB,QAAQ,IAAI,mBAAmB,UAAU;AAAA,EACvE,CAAC,EACA,OAAO,OAAO,EACd,KAAK,IAAI;AAGZ,QAAM,iBAAiB,gBAAgB,OAAO,CAAC,OAAO;AACpD,UAAM,UAAU,QAAQ,IAAI,EAAE;AAC9B,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,IACT;AACA,WAAO,QAAQ,SAAS,eAAe,QAAQ,SAAS;AAAA,EAC1D,CAAC;AAKD,MAAI;AACJ,MAAI,eAAe,SAAS,GAAG;AAC7B,UAAM,aAAa,eAAe,eAAe,SAAS,CAAC;AAC3D,UAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,iBAAa,kCAAkC,SAAS,IAAI;AAAA,EAC9D,OAAO;AAML,iBAAa;AAAA,EACf;AAEA,SAAO;AAAA,2CACkC,KAAK,EAAE;AAAA,sCACZ,WAAW;AAAA;AAAA,EAE/C,cAAc;AAAA;AAAA;AAAA,EAGd,UAAU;AAAA;AAAA;AAAA;AAAA;AAKZ;AAKA,SAAS,4BACP,MACA,yBACoB;AACpB,QAAM,cAAc,WAAW,KAAK,EAAE;AACtC,QAAM,WAAW,iBAAiB,WAAW;AAE7C,SAAO;AAAA,+CACsC,KAAK,EAAE;AAAA,+BACvB,WAAW;AAAA;AAAA,gCAEV,QAAQ;AAAA,qCACH,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,oCAKT,WAAW;AAAA,uEACwB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4BAMtD,WAAW;AAAA;AAAA;AAAA,iBAGtB,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oDAMY,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4BAQnC,QAAQ;AAAA;AAAA;AAAA,kDAGc,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQ7D;AAgBO,SAAS,oBACd,MACA,SACoB;AAEpB,MAAI,QAAQ,aAAa,SAAS,KAAK,EAAE,GAAG;AAC1C,UAAM,IAAI;AAAA,MACR,mDAAmD,QAAQ,aAAa,KAAK,MAAM,CAAC,OAAO,KAAK,EAAE;AAAA,IACpG;AAAA,EACF;AAGA,QAAM,iBAAiB,KAAK,SAAS;AACrC,MAAI,CAAC,gBAAgB;AACnB,UAAM,IAAI;AAAA,MACR,iBAAiB,KAAK,EAAE;AAAA,IAC1B;AAAA,EACF;AAKA,MAAI;AAGJ,UAAQ,aAAa,KAAK,KAAK,EAAE;AAEjC,MAAI;AAEF,kBAAc,QAAQ,aAAa,cAAc;AAGjD,UAAM,YAAY,YAAY,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW;AACtE,UAAM,cAAc,YAAY,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AAE3E,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,gBAAgB,cAAc,oBAAoB;AAAA,IACpE;AAEA,QAAI,YAAY,WAAW,GAAG;AAC5B,YAAM,IAAI,MAAM,gBAAgB,cAAc,sBAAsB;AAAA,IACtE;AAGA,UAAM,qBAAqB,QAAQ,qBAAqB,IAAI,cAAc;AAC1E,QAAI,oBAAoB;AAEtB,YAAME,eAAc,4BAA4B,MAAM,kBAAkB;AACxE,aAAOA;AAAA,IACT;AAGA,UAAM,SAAS,mBAAmB,KAAK,EAAE;AACzC,UAAM,cAAc,WAAW,KAAK,EAAE;AACtC,UAAM,0BAA0B,uBAAuB,WAAW;AAGlE,YAAQ,qBAAqB,IAAI,gBAAgB,uBAAuB;AAKxE,UAAM,aAAiC;AAAA,MACrC,GAAG;AAAA,MACH,cAAc,CAAC,GAAG,QAAQ,YAAY;AAAA,IACxC;AAGA,QAAI,cAAc;AAClB,eAAW,WAAW,YAAY,OAAO;AACvC,YAAM,WAAW,QAAQ;AAGzB,UAAI,aAAa,cAAc;AAC7B;AAAA,MACF;AAGA,YAAM,eAAe;AAAA,QACnB,GAAG;AAAA,QACH,IAAI,SAAS,QAAQ;AAAA,MACvB;AAGA,cAAQ,UAAU;AAAA,QAChB,KAAK;AACH,yBAAe,iBAAiB,cAAc,OAAO;AACrD;AAAA,QACF,KAAK;AACH,yBAAe,yBAAyB,cAAc,OAAO;AAC7D;AAAA,QACF,KAAK;AACH,yBAAe,kBAAkB,cAAc,OAAO;AACtD;AAAA,QACF,KAAK;AACH,yBAAe,sBAAsB,cAAc,OAAO;AAC1D;AAAA,QACF,KAAK;AACH,yBAAe,oBAAoB,cAAc,OAAO;AACxD;AAAA,QACF,KAAK;AAEH,yBAAe,oBAAoB,cAAc,UAAU;AAC3D;AAAA,QACF;AAEE;AAAA,MACJ;AAAA,IACF;AAGA,UAAM,iBAAiB,8BAA8B,MAAM,SAAS,aAAa,MAAM;AAGvF,UAAM,cAAc,4BAA4B,MAAM,uBAAuB;AAE7E,UAAM,eAAe,cAAc,iBAAiB;AAGpD,WAAO;AAAA,EACT,UAAE;AAEA,UAAM,YAAY,QAAQ,aAAa,QAAQ,KAAK,EAAE;AACtD,QAAI,cAAc,IAAI;AACpB,cAAQ,aAAa,OAAO,WAAW,CAAC;AAAA,IAC1C;AAAA,EACF;AACF;;;ACzQO,SAAS,mBAAmB,KAAiC;AAClE,QAAM,cAAc,oBAAI,IAAY;AACpC,8BAA4B,KAAK,WAAW;AAC5C,SAAO;AACT;AAKA,SAAS,4BAA4B,KAAoB,aAAgC;AACvF,UAAQ,IAAI,MAAM;AAAA,IAChB,KAAK,cAAc;AACjB,YAAM,QAAQ;AACd,kBAAY,IAAI,MAAM,IAAI;AAC1B;AAAA,IACF;AAAA,IAEA,KAAK;AAEH,kCAA6B,IAAY,QAAQ,WAAW;AAE5D;AAAA,IAEF,KAAK;AAEH,kCAA6B,IAAY,QAAQ,WAAW;AAE5D,kCAA6B,IAAY,OAAO,WAAW;AAC3D;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,MAAM,WAAW;AAC1D,kCAA6B,IAAY,OAAO,WAAW;AAC3D;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,SAAS,WAAW;AAC7D;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,WAAW,WAAW;AAC/D,kCAA6B,IAAY,YAAY,WAAW;AAChE,kCAA6B,IAAY,WAAW,WAAW;AAC/D;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,QAAQ,WAAW;AAC5D,iBAAW,OAAQ,IAAY,MAAM;AACnC,oCAA4B,KAAK,WAAW;AAAA,MAC9C;AACA;AAAA,IAEF,KAAK;AACH,iBAAW,WAAY,IAAY,UAAU;AAC3C,oCAA4B,SAAS,WAAW;AAAA,MAClD;AACA;AAAA,IAEF,KAAK;AACH,iBAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAS,IAAY,UAAU,GAAG;AACnE,oCAA4B,OAAwB,WAAW;AAAA,MACjE;AACA;AAAA,IAEF,KAAK;AACH,iBAAW,QAAS,IAAY,OAAO;AACrC,YAAI,OAAO,SAAS,UAAU;AAE5B,sCAA4B,MAAuB,WAAW;AAAA,QAChE;AAAA,MAEF;AACA;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,OAAO,WAAW;AAC3D,kCAA6B,IAAY,KAAK,WAAW;AACzD;AAAA;AAAA,IAGF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAEH;AAAA,IAEF;AACE,YAAM,IAAI,MAAM,0BAA2B,IAAY,IAAI,EAAE;AAAA,EACjE;AACF;AAcO,SAAS,wBACd,uBACA,SACA,UACM;AAEN,QAAM,iBAAiB,oBAAI,IAAY;AAGvC,aAAW,SAAS,QAAQ,YAAY,QAAQ;AAC9C,UAAM,QAAQ,MAAM,KAAK,MAAM,GAAG;AAClC,mBAAe,IAAI,MAAM,CAAC,CAAC;AAG3B,mBAAe,IAAI,MAAM,IAAI;AAAA,EAC/B;AAGA,QAAM,gBAA0B,CAAC;AAEjC,aAAW,cAAc,uBAAuB;AAI9C,QAAI,eAAe,OAAO,eAAe,KAAK;AAC5C;AAAA,IACF;AAGA,QAAI,QAAQ;AAEZ,QAAI,eAAe,IAAI,UAAU,GAAG;AAClC,cAAQ;AAAA,IACV,OAAO;AAEL,iBAAW,YAAY,gBAAgB;AACrC,YAAI,SAAS,WAAW,aAAa,GAAG,GAAG;AACzC,kBAAQ;AACR;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,OAAO;AACV,oBAAc,KAAK,UAAU;AAAA,IAC/B;AAAA,EACF;AAGA,MAAI,cAAc,SAAS,GAAG;AAC5B,UAAM,cAAc,cACjB,KAAK,EACL,IAAI,CAAC,OAAO,IAAI,EAAE,GAAG,EACrB,KAAK,IAAI;AACZ,UAAM,UACJ,cAAc,WAAW,IACrB,oBAAoB,cAAc,CAAC,CAAC,0CACpC,0DAA0D,WAAW;AAE3E,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,OAAO;AAAA,MACT;AAAA,MACA,EAAE,cAAoC;AAAA,IACxC;AAAA,EACF;AACF;AAWO,SAAS,yBACd,SACA,gBACa;AACb,QAAM,kBAAkB,oBAAI,IAAY;AAExC,aAAW,QAAQ,QAAQ,IAAI,OAAO;AACpC,UAAM,WAAW,KAAK;AAEtB,QAAI;AACF,UAAI,aAAa,kBAAkB;AAEjC,cAAM,cAAc,KAAK,QAAQ;AACjC,mBAAW,QAAQ,aAAa;AAC9B,0BAAgB,IAAI,KAAK,GAAG;AAAA,QAC9B;AAAA,MACF,WAAW,aAAa,qBAAqB;AAE3C,cAAM,UAAU,KAAK;AACrB,YAAI,QAAQ,SAAS;AACnB,qBAAW,UAAU,QAAQ,SAAS;AACpC,gBAAI,OAAO,OAAO;AAChB,8BAAgB,IAAI,OAAO,KAAK;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IAGF,SAAS,OAAO;AAEd,UAAI,gBAAgB;AAClB,cAAM,MACJ,iBAAiB,mBACb,QACA,IAAI;AAAA,UACF,mDAAmD,KAAK,QAAQ,KAAK,EAAE,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA;AAAA,UAEnI,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAAA,QACzC;AACN,uBAAe,IAAI,GAAG;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAeO,SAAS,yBACd,iBACA,SACA,UACM;AAEN,QAAM,kBAAkB,oBAAI,IAAY;AAGxC,aAAW,SAAS,QAAQ,aAAa,QAAQ;AAC/C,oBAAgB,IAAI,MAAM,IAAI;AAAA,EAChC;AAGA,QAAM,iBAA2B,CAAC;AAElC,aAAW,UAAU,iBAAiB;AAGpC,QAAI,QAAQ;AAGZ,QAAI,gBAAgB,IAAI,MAAM,GAAG;AAC/B,cAAQ;AAAA,IACV,OAAO;AAGL,iBAAW,YAAY,iBAAiB;AACtC,YAAI,SAAS,WAAW,SAAS,GAAG,GAAG;AACrC,kBAAQ;AACR;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,OAAO;AACV,qBAAe,KAAK,MAAM;AAAA,IAC5B;AAAA,EACF;AAGA,MAAI,eAAe,SAAS,GAAG;AAC7B,UAAM,cAAc,eACjB,KAAK,EACL,IAAI,CAAC,UAAU,IAAI,KAAK,GAAG,EAC3B,KAAK,IAAI;AACZ,UAAM,UACJ,eAAe,WAAW,IACtB,iBAAiB,eAAe,CAAC,CAAC,wEAClC,qFAAqF,WAAW;AAEtG,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,OAAO;AAAA,MACT;AAAA,MACA,EAAE,eAAsC;AAAA,IAC1C;AAAA,EACF;AACF;AAWO,SAAS,4BAA4B,SAAmC;AAC7E,QAAM,iBAAiB,IAAI,eAAe;AAG1C,QAAM,kBAAkB,yBAAyB,SAAS,cAAc;AAGxE,MAAI;AACF,6BAAyB,iBAAiB,OAAO;AAAA,EACnD,SAAS,OAAO;AACd,QAAI,iBAAiB,kBAAkB;AACrC,qBAAe,IAAI,KAAK;AAAA,IAC1B,OAAO;AACL,YAAM;AAAA,IACR;AAAA,EACF;AAGA,iBAAe,cAAc;AAC/B;AAWO,SAAS,2BAA2B,SAAmC;AAC5E,QAAM,iBAAiB,IAAI,eAAe;AAC1C,QAAM,cAAc,QAAQ;AAC5B,QAAM,iBAAiB,oBAAI,IAAY;AAGvC,aAAW,SAAS,YAAY,QAAQ;AACtC,UAAM,QAAQ,MAAM,KAAK,MAAM,GAAG;AAClC,mBAAe,IAAI,MAAM,CAAC,CAAC;AAC3B,mBAAe,IAAI,MAAM,IAAI;AAAA,EAC/B;AAGA,QAAM,iBAAiB,oBAAI,IAAY;AAGvC,QAAM,mBAAmB,CACvB,QACA,UACA,YACA,UACqB;AACrB,QAAI,iBAAiB,kBAAkB;AAErC,UAAI,CAAC,MAAM,UAAU,QAAQ;AAC3B,eAAO,IAAI,iBAAiB,MAAM,SAAS,MAAM,MAAM,EAAE,QAAQ,SAAS,GAAG,MAAM,OAAO;AAAA,MAC5F;AACA,aAAO;AAAA,IACT;AACA,WAAO,IAAI;AAAA,MACT,+BAA+B,UAAU,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA;AAAA,MAErG,EAAE,QAAQ,SAAS;AAAA,IACrB;AAAA,EACF;AAGA,aAAW,QAAQ,QAAQ,IAAI,OAAO;AACpC,UAAM,WAAW,KAAK;AAEtB,QAAI;AACF,UAAI,aAAa,kBAAkB;AAEjC,cAAM,cAAc,KAAK,QAAQ;AACjC,mBAAW,QAAQ,aAAa;AAC9B,cAAI;AACF,kBAAM,MAAM,QAAQ,gBAAgB,KAAK,KAAK;AAC9C,kBAAM,cAAc,mBAAmB,GAAG;AAC1C,uBAAW,MAAM,aAAa;AAC5B,6BAAe,IAAI,EAAE;AAAA,YACvB;AAAA,UACF,SAAS,OAAO;AACd,2BAAe,IAAI,iBAAiB,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,CAAC;AAAA,UAC5E;AAAA,QACF;AAAA,MACF,WAAW,aAAa,qBAAqB;AAE3C,cAAM,UAAU,KAAK;AACrB,YAAI,QAAQ,OAAO;AACjB,qBAAW,QAAQ,QAAQ,OAAO;AAChC,gBAAI,KAAK,OAAO;AACd,yBAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,KAAK,KAA+B,GAAG;AAChF,oBACE,SACA,OAAO,UAAU,YACjB,CAAC,CAAC,QAAQ,SAAS,MAAM,EAAE,SAAS,MAAM,YAAY,CAAC,GACvD;AACA,sBAAI;AACF,0BAAM,MAAM,QAAQ,gBAAgB,KAAK;AACzC,0BAAM,cAAc,mBAAmB,GAAG;AAC1C,+BAAW,MAAM,aAAa;AAC5B,qCAAe,IAAI,EAAE;AAAA,oBACvB;AAAA,kBACF,SAAS,OAAO;AAEd,mCAAe,IAAI,iBAAiB,KAAK,IAAI,KAAK,MAAM,OAAO,KAAK,CAAC;AAAA,kBACvE;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,aAAa,cAAc;AAEpC,cAAM,UAAU,KAAK;AACrB,YAAI,QAAQ,OAAO;AACjB,qBAAW,cAAc,QAAQ,OAAO;AACtC,gBAAI,WAAW,aAAa,WAAW,UAAU,YAAY;AAC3D,kBAAI;AACF,sBAAM,MAAM,QAAQ,gBAAgB,WAAW,UAAU,UAAU;AACnE,sBAAM,cAAc,mBAAmB,GAAG;AAC1C,2BAAW,MAAM,aAAa;AAC5B,iCAAe,IAAI,EAAE;AAAA,gBACvB;AAAA,cACF,SAAS,OAAO;AAEd,+BAAe;AAAA,kBACb,iBAAiB,KAAK,IAAI,KAAK,MAAM,WAAW,UAAU,YAAY,KAAK;AAAA,gBAC7E;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AAEd,YAAM,MACJ,iBAAiB,mBACb,QACA,IAAI;AAAA,QACF,2BAA2B,KAAK,QAAQ,KAAK,EAAE,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA;AAAA,QAE3G,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAAA,MACzC;AACN,qBAAe,IAAI,GAAG;AAAA,IACxB;AAAA,EACF;AAGA,MAAI;AACF,4BAAwB,gBAAgB,OAAO;AAAA,EACjD,SAAS,OAAO;AACd,QAAI,iBAAiB,kBAAkB;AACrC,qBAAe,IAAI,KAAK;AAAA,IAC1B,OAAO;AACL,YAAM;AAAA,IACR;AAAA,EACF;AAGA,iBAAe,cAAc;AAC/B;;;ACleA,SAAS,kBAAkB,OAAyC;AAClE,QAAM,eAAe,oBAAI,IAAsB;AAE/C,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,aAAa,IAAI,KAAK,QAAQ;AAC9C,QAAI,SAAS;AACX,cAAQ,KAAK,KAAK,QAAQ;AAAA,IAC5B,OAAO;AACL,mBAAa,IAAI,KAAK,UAAU,CAAC,KAAK,QAAQ,CAAC;AAAA,IACjD;AAAA,EACF;AAEA,SAAO;AACT;AAiBO,SAAS,wBAAwB,KAA+B;AAErE,QAAM,eAAe,kBAAkB,IAAI,KAAK;AAGhD,QAAM,cAAc,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AACnE,QAAM,sBAAsB,oBAAI,IAAY;AAG5C,QAAM,WAAqB,CAAC;AAC5B,aAAW,cAAc,aAAa;AACpC,UAAM,UAAU,aAAa,IAAI,WAAW,EAAE,KAAK,CAAC;AACpD,eAAW,YAAY,SAAS;AAC9B,UAAI,CAAC,oBAAoB,IAAI,QAAQ,GAAG;AACtC,4BAAoB,IAAI,QAAQ;AAChC,iBAAS,KAAK,QAAQ;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAIA,MAAI,aAAa;AACjB,SAAO,aAAa,SAAS,QAAQ;AACnC,UAAM,YAAY,SAAS,YAAY;AAGvC,UAAM,UAAU,aAAa,IAAI,SAAS,KAAK,CAAC;AAChD,eAAW,YAAY,SAAS;AAC9B,UAAI,CAAC,oBAAoB,IAAI,QAAQ,GAAG;AACtC,4BAAoB,IAAI,QAAQ;AAChC,iBAAS,KAAK,QAAQ;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;AC1EO,SAAS,wBAAwB,MAAwB;AAC9D,MAAI,KAAK,SAAS,qBAAqB;AACrC,WAAO;AAAA,EACT;AACA,QAAM,YAAY,KAAK,SAAS,aAAa;AAC7C,SAAO,CAAC,WAAW,aAAa,eAAe,UAAU,EAAE,SAAS,SAAS;AAC/E;AAyBO,SAAS,iBAAiB,SAAiD;AAChF,QAAM,EAAE,SAAS,eAAe,IAAI;AAIpC,QAAM,cAAc,eAAe,OAAO,CAAC,OAAO;AAChD,UAAM,OAAO,QAAQ,IAAI,EAAE;AAC3B,WAAO,QAAQ,KAAK,SAAS;AAAA,EAC/B,CAAC;AAGD,MAAI,YAAY,SAAS,GAAG;AAE1B,UAAM,mBAAmB,YAAY,YAAY,SAAS,CAAC;AAC3D,WAAO,QAAQ,IAAI,gBAAgB,KAAK;AAAA,EAC1C;AAGA,MAAI,eAAe,SAAS,GAAG;AAC7B,UAAM,aAAa,eAAe,eAAe,SAAS,CAAC;AAC3D,WAAO,QAAQ,IAAI,UAAU,KAAK;AAAA,EACpC;AAEA,SAAO;AACT;AAaO,SAAS,mBAAmB,MAAuB;AAGxD,MAAI,wBAAwB,IAAI,GAAG;AACjC,WAAO,kCAAkC,KAAK,IAAI;AAAA,EACpD;AAQA,QAAM,iBAAiB,KAAK,SAAS,gBAAgB;AACrD,MAAI,gBAAgB;AAClB,WAAO;AAAA,uCAC4B,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoC9C;AAEA,SAAO,kCAAkC,KAAK,IAAI;AACpD;AASO,SAAS,2BACd,eACAC,aACQ;AACR,MAAI,cAAc,OAAO,GAAG;AAE1B,UAAM,eAAe,MAAM,KAAK,aAAa,EAAE,CAAC;AAChD,UAAM,oBAAoBA,YAAW,YAAY;AACjD,WAAO,+BAA+B,iBAAiB;AAAA,EACzD;AACA,SAAO;AACT;;;AChHA,IAAM,0BAA0B,MAAM;AAY/B,SAAS,gBAAgB,KAAkB,SAAiD;AAEjG,QAAM,QAAQ,WAAW,GAAG;AAG5B,QAAM,kBAAkB,mBAAmB,KAAK;AAGhD,MAAI,QAAQ,QAAQ,aAAa,OAAO;AACtC,+BAA2B,OAAO;AAClC,gCAA4B,OAAO;AAAA,EACrC;AAGA,QAAM,UAAU,IAAI,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAGvD,QAAM,eAAe,aAAa,iBAAiB,SAAS,OAAO;AAGnE,QAAM,sBAAsB,MAAM,KAAK,QAAQ,gBAAgB,OAAO,CAAC,EAAE,KAAK,IAAI;AAGlF,QAAM,sBAAsB,wBAAwB,GAAG;AAGvD,QAAM,iBAAiB,uBAAuB,iBAAiB,SAAS,mBAAmB;AAG3F,QAAM,gBAAgB,kBAAkB,GAAG;AAG3C,QAAM,iBAAiB,qBAAqB,iBAAiB,SAAS,mBAAmB;AAGzF,QAAM,aAAa,4BAA4B,SAAS,gBAAgB,aAAa;AAGrF,SAAO,mBAAmB,qBAAqB,cAAc,gBAAgB,UAAU;AACzF;AAKA,SAAS,aACP,iBACA,SACA,SACQ;AACR,MAAI,eAAe;AAEnB,aAAW,UAAU,iBAAiB;AACpC,UAAM,OAAO,QAAQ,IAAI,MAAM;AAC/B,QAAI,CAAC,MAAM;AACT;AAAA,IACF;AAEA,UAAM,WAAW,KAAK;AAEtB,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,wBAAgB,iBAAiB,MAAM,OAAO;AAC9C;AAAA,MACF,KAAK;AACH,wBAAgB,yBAAyB,MAAM,OAAO;AACtD;AAAA,MACF,KAAK;AACH,wBAAgB,kBAAkB,MAAM,OAAO;AAC/C;AAAA,MACF,KAAK;AACH,wBAAgB,oBAAoB,MAAM,OAAO;AACjD;AAAA,MACF,KAAK;AACH,wBAAgB,kBAAkB,MAAM,OAAO;AAC/C;AAAA,MACF,KAAK;AACH,wBAAgB,sBAAsB,MAAM,OAAO;AACnD;AAAA,MACF,KAAK;AACH,wBAAgB,oBAAoB,MAAM,OAAO;AACjD;AAAA,MACF;AAEE;AAAA,IACJ;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,uBACP,iBACA,SACA,qBACQ;AACR,SAAO,gBACJ,IAAI,CAAC,WAAW;AACf,UAAM,OAAO,QAAQ,IAAI,MAAM;AAC/B,QAAI,CAAC,QAAQ,KAAK,SAAS,cAAc;AACvC,aAAO;AAAA,IACT;AAGA,QAAI,oBAAoB,IAAI,MAAM,GAAG;AACnC,aAAO;AAAA,IACT;AAEA,WAAOC,4BAA2B,IAAI;AAAA,EACxC,CAAC,EACA,OAAO,OAAO,EACd,KAAK,IAAI;AACd;AAKA,SAASA,4BAA2B,MAAuB;AACzD,QAAM,cAAc,WAAW,KAAK,EAAE;AAGtC,QAAM,iBAAiB,KAAK,SAAS,gBAAgB;AAGrD,MAAI,OAAO,qBAAqB,KAAK,IAAI,mBAAmB,WAAW;AAIvE,QAAM,aAAa,KAAK,SAAS;AACjC,MAAI,YAAY;AAEd,QAAI,CAAC,WAAW,SAAS,GAAG,GAAG;AAE7B,cAAQ;AAAA,wCAC0B,UAAU;AAAA,aACrC,UAAU,sBAAsB,KAAK,IAAI;AAAA,IAClD,OAAO;AAEL,cAAQ;AAAA,IACV,6BAA6B,YAAY,mBAAmB,KAAK,IAAI,IAAI,CAAC;AAAA,IAC1E;AAAA,EACF;AAIA,MAAI,gBAAgB;AAClB,YAAQ;AAAA,IAAO,6BAA6B,KAAK,IAAI,CAAC;AAAA,EACxD;AAEA,SAAO;AACT;AAKA,SAAS,kBAAkB,KAA+B;AACxD,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,QAAQ,IAAI,OAAO;AAC5B,UAAM,gBAAgB,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,aAAa,KAAK,EAAE;AACpE,QAAI,cAAc,WAAW,GAAG;AAC9B,oBAAc,IAAI,KAAK,EAAE;AAAA,IAC3B;AAAA,EACF;AACA,SAAO;AACT;AAKA,SAAS,qBACP,iBACA,SACA,qBACU;AACV,SAAO,gBAAgB,OAAO,CAAC,OAAO;AACpC,UAAM,OAAO,QAAQ,IAAI,EAAE;AAC3B,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,IACT;AAEA,QAAI,KAAK,SAAS,eAAe,KAAK,SAAS,cAAc;AAC3D,aAAO;AAAA,IACT;AAEA,QAAI,oBAAoB,IAAI,EAAE,GAAG;AAC/B,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAKA,SAAS,4BACP,SACA,gBACA,eACQ;AAER,QAAM,aAAa,iBAAiB;AAAA,IAClC;AAAA,IACA;AAAA,IACA,qBAAqB,oBAAI,IAAI;AAAA;AAAA,EAC/B,CAAC;AAED,MAAI,YAAY;AACd,WAAO,mBAAmB,UAAU;AAAA,EACtC;AAEA,SAAO,2BAA2B,eAAe,UAAU;AAC7D;AAKA,SAAS,mBACP,qBACA,cACA,gBACA,YACQ;AACR,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBP,mBAAmB;AAAA;AAAA,EAEnB,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2BAmBa,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYhD,cAAc;AAAA;AAAA;AAAA,EAGd,UAAU;AAAA;AAAA;AAAA;AAAA;AAKZ;;;ACxVA,SAAS,kBAAkB;AAC3B;AAAA,EACE;AAAA,EACA;AAAA,EACA,gBAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,MAAM,WAAAC,gBAAe;;;AChB9B,SAAS,oBAAoB;AAC7B,SAAS,SAAS,eAAe;AACjC,SAAS,qBAAqB;AAE9B,IAAMC,aAAY,QAAQ,cAAc,YAAY,GAAG,CAAC;AAIxD,SAAS,yBAAiC;AAExC,SAAO,QAAQA,YAAW,MAAM,MAAM,SAAS;AACjD;AAEA,SAAS,YAAY,UAA0B;AAC7C,QAAM,cAAc,uBAAuB;AAC3C,SAAO,aAAa,QAAQ,aAAa,QAAQ,GAAG,OAAO;AAC7D;AAEO,IAAM,iBAAiB,YAAY,WAAW;AAC9C,IAAM,kBAAkB,YAAY,YAAY;AAChD,IAAM,sBAAsB,YAAY,gBAAgB;AACxD,IAAM,iBAAiB,YAAY,WAAW;AAC9C,IAAM,iBAAiB,YAAY,WAAW;AAC9C,IAAM,kBAAkB,YAAY,YAAY;AAChD,IAAM,iBAAiB,YAAY,WAAW;;;ADMrD,IAAI,iBAAyB;AAE7B,SAAS,oBAA4B;AACnC,MAAI,mBAAmB,IAAI;AACzB,QAAI;AAEF,YAAM,cAAc,KAAKC,SAAQ,SAAS,GAAG,MAAM,cAAc;AACjE,YAAM,MAAM,KAAK,MAAMC,cAAa,aAAa,OAAO,CAAC;AACzD,uBAAiB,IAAI,WAAW;AAAA,IAClC,QAAQ;AACN,uBAAiB;AAAA,IACnB;AAAA,EACF;AACA,SAAO;AACT;AAKA,SAAS,cAAsB;AAG7B,QAAM,WAAW,KAAK,QAAQ,IAAI,GAAG,gBAAgB,UAAU,SAAS;AACxE,SAAO;AACT;AAMA,SAAS,iBAAyB;AAChC,QAAM,WAAW,YAAY;AAC7B,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,QAAI;AACF,gBAAU,UAAU,EAAE,WAAW,KAAK,CAAC;AAAA,IACzC,SAAS,OAAO;AACd,YAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACtE,YAAM,IAAI,MAAM,uCAAuC,QAAQ,KAAK,QAAQ,EAAE;AAAA,IAChF;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,gBACd,oBACA,SACQ;AACR,QAAM,OAAO,WAAW,QAAQ;AAGhC,OAAK,OAAO,WAAW,kBAAkB,CAAC;AAAA,CAAI;AAG9C,OAAK,OAAO,YAAY,QAAQ,YAAY,IAAI;AAAA,CAAI;AACpD,OAAK,OAAO,SAAS,QAAQ,SAAS,KAAK;AAAA,CAAI;AAI/C,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,cAAc;AAC1B,OAAK,OAAO,yBAAyB;AACrC,OAAK,OAAO,eAAe;AAC3B,OAAK,OAAO,6BAA6B;AACzC,OAAK,OAAO,mBAAmB;AAC/B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,cAAc;AAC1B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,cAAc;AAC1B,OAAK,OAAO,yBAAyB;AACrC,OAAK,OAAO,eAAe;AAC3B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,cAAc;AAG1B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,kBAAkB;AAG9B,SAAO,KAAK,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACvC;AAeO,SAAS,kBAAkB,UAA8D;AAC9F,QAAM,WAAW,YAAY;AAC7B,QAAM,YAAY,KAAK,UAAU,GAAG,QAAQ,OAAO;AAEnD,MAAI,CAAC,WAAW,SAAS,GAAG;AAC1B,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,UAAUA,cAAa,WAAW,OAAO;AAC/C,UAAM,QAAoB,KAAK,MAAM,OAAO;AAI5C,QAAI,MAAM,YAAY,kBAAkB,GAAG;AAEzC,iBAAW,SAAS;AACpB,aAAO;AAAA,IACT;AAGA,UAAM,SAAS,IAAI,WAAW,OAAO,KAAK,MAAM,QAAQ,QAAQ,CAAC;AACjE,WAAO,EAAE,QAAQ,KAAK,MAAM,IAAI;AAAA,EAClC,SAAS,OAAO;AAEd,QAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAAO;AACzD,YAAM,OAAQ,MAA2B;AAGzC,UAAI,SAAS,UAAU;AACrB,eAAO;AAAA,MACT;AAGA,UAAI,SAAS,YAAY,SAAS,SAAS;AACzC,cAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACtE,gBAAQ;AAAA,UACN,+EAA+E,SAAS;AAAA,EAAK,QAAQ;AAAA,QACvG;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAKA,QAAI;AACF,iBAAW,SAAS;AAAA,IACtB,SAAS,cAAc;AAErB,UAAI,gBAAgB,OAAO,iBAAiB,YAAY,UAAU,cAAc;AAC9E,cAAM,OAAQ,aAAkC;AAChD,YAAI,SAAS,YAAY,SAAS,SAAS;AACzC,kBAAQ;AAAA,YACN,gFAAgF,SAAS;AAAA,UAC3F;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAMO,SAAS,iBACd,UACA,QACM;AACN,MAAI;AACF,UAAM,WAAW,eAAe;AAChC,UAAM,YAAY,KAAK,UAAU,GAAG,QAAQ,OAAO;AAEnD,UAAM,QAAoB;AAAA,MACxB,SAAS,kBAAkB;AAAA,MAC3B,WAAW,KAAK,IAAI;AAAA,MACpB,QAAQ,OAAO,KAAK,OAAO,MAAM,EAAE,SAAS,QAAQ;AAAA,MACpD,KAAK,OAAO;AAAA,IACd;AAEA,kBAAc,WAAW,KAAK,UAAU,KAAK,CAAC;AAAA,EAChD,SAAS,OAAO;AAGd,UAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAGtE,QAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAAO;AACzD,YAAM,OAAQ,MAA2B;AAEzC,UAAI,SAAS,UAAU;AACrB,gBAAQ,KAAK,yDAAyD,QAAQ,EAAE;AAAA,MAClF,WAAW,SAAS,YAAY,SAAS,WAAW,SAAS,SAAS;AACpE,gBAAQ;AAAA,UACN,yFAAyF,QAAQ;AAAA,QACnG;AAAA,MACF,OAAO;AACL,gBAAQ,KAAK,6CAA6C,QAAQ,EAAE;AAAA,MACtE;AAAA,IACF,OAAO;AACL,cAAQ,KAAK,6CAA6C,QAAQ,EAAE;AAAA,IACtE;AAAA,EACF;AACF;AAMO,SAAS,oBAA4B;AAC1C,SAAO,YAAY;AACrB;AAMO,SAAS,iBAYd;AACA,QAAM,UAAU,eAAe;AAC/B,QAAM,YAAY,YAAY;AAC9B,QAAM,kBAAkB,WAAW,SAAS;AAC5C,QAAM,SAAmB,CAAC;AAG1B,MAAI,CAAC,SAAS;AACZ,WAAO,KAAK,6DAA6D;AAAA,EAC3E;AAGA,MAAI,WAAW,CAAC,iBAAiB;AAC/B,WAAO,KAAK,qEAAqE;AAAA,EACnF;AAGA,MAAI,aAAa;AACjB,MAAI,iBAAiB;AACnB,QAAI;AAEF,kBAAY,SAAS;AACrB,mBAAa;AAAA,IACf,SAAS,OAAO;AACd,mBAAa;AACb,aAAO;AAAA,QACL,iDAAiD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,MACzG;AAAA,IACF;AAAA,EACF;AAGA,QAAM,QAAQ,aACV,cAAc,IACd;AAAA,IACE,SAAS;AAAA,IACT,WAAW;AAAA,IACX,aAAa;AAAA,IACb,aAAa;AAAA,EACf;AAEJ,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAKO,SAAS,aAAmB;AACjC,QAAM,WAAW,YAAY;AAC7B,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB;AAAA,EACF;AAEA,QAAM,QAAQ,YAAY,QAAQ;AAClC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,OAAO,GAAG;AAC1B,UAAI;AACF,mBAAW,KAAK,UAAU,IAAI,CAAC;AAAA,MACjC,QAAQ;AAAA,MAAC;AAAA,IACX;AAAA,EACF;AACF;AAKO,SAAS,gBAKd;AACA,QAAM,WAAW,YAAY;AAC7B,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,WAAO,EAAE,SAAS,GAAG,WAAW,GAAG,aAAa,MAAM,aAAa,KAAK;AAAA,EAC1E;AAEA,QAAM,QAAQ,YAAY,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO,CAAC;AACrE,MAAI,YAAY;AAChB,MAAI,cAA6B;AACjC,MAAI,cAA6B;AAEjC,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,SAAS,KAAK,UAAU,IAAI,CAAC;AAC1C,iBAAa,KAAK;AAElB,UAAM,QAAQ,KAAK;AACnB,QAAI,gBAAgB,QAAQ,QAAQ,aAAa;AAC/C,oBAAc;AAAA,IAChB;AACA,QAAI,gBAAgB,QAAQ,QAAQ,aAAa;AAC/C,oBAAc;AAAA,IAChB;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,MAAM,QAAQ,WAAW,aAAa,YAAY;AACtE;AAKO,SAAS,WACd,UAGI,CAAC,GACG;AACR,QAAM,EAAE,aAAa,KAAK,WAAW,IAAI,KAAK,KAAK,KAAK,IAAK,IAAI;AACjE,QAAM,WAAW,YAAY;AAE7B,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,YAAY,QAAQ,EAC/B,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO,CAAC,EACjC,IAAI,CAAC,MAAM;AACV,UAAM,OAAO,SAAS,KAAK,UAAU,CAAC,CAAC;AACvC,WAAO,EAAE,MAAM,GAAG,OAAO,KAAK,QAAQ;AAAA,EACxC,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAEnC,QAAM,MAAM,KAAK,IAAI;AACrB,MAAI,UAAU;AAEd,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,MAAM,MAAM,KAAK;AAGvB,QAAI,KAAK,cAAc,MAAM,UAAU;AACrC,UAAI;AACF,mBAAW,KAAK,UAAU,KAAK,IAAI,CAAC;AACpC;AAAA,MACF,QAAQ;AAAA,MAAC;AAAA,IACX;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,iBAA0B;AACxC,SAAO,QAAQ,IAAI,qBAAqB;AAC1C;;;AExZA,YAAY,QAAQ;AACpB,YAAY,UAAU;;;ACiBf,SAAS,gBAAgB,MAAyB;AACvD,QAAM,YAAuB,oBAAI,IAAI;AACrC,YAAU,IAAI,wBAAwB,IAAI;AAC1C,YAAU,IAAI,yBAAyB,cAAc;AACrD,YAAU,IAAI,0BAA0B,eAAe;AACvD,YAAU,IAAI,8BAA8B,mBAAmB;AAC/D,YAAU,IAAI,yBAAyB,cAAc;AACrD,YAAU,IAAI,yBAAyB,cAAc;AACrD,YAAU,IAAI,0BAA0B,eAAe;AACvD,YAAU,IAAI,yBAAyB,cAAc;AACrD,SAAO;AACT;AAOO,SAAS,6BAA6B,WAAsB;AACjE,SAAO;AAAA,IACL,SAAS,MAAc,SAAgC;AAErD,YAAM,eAAe;AAAA;AAAA,QAEnB;AAAA;AAAA,QAEA,UAAU,GAAG,OAAO,IAAI,IAAI,KAAK;AAAA;AAAA,QAEjC,KAAK,WAAW,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AAAA,MAC1C;AAEA,iBAAW,OAAO,cAAc;AAC9B,cAAM,UAAU,UAAU,IAAI,GAAG;AACjC,YAAI,OAAO,YAAY,UAAU;AAC/B,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,UAAU,MAAcC,OAA2B,SAAuB;AACxE,YAAM,MAAM,UAAU,GAAG,OAAO,IAAI,IAAI,KAAK;AAC7C,gBAAU,IAAI,KAAKA,KAAI;AAAA,IACzB;AAAA,IACA,UAAUC,UAAiB,SAAkC;AAC3D,YAAM,SAAS,UAAU,GAAG,OAAO,IAAIA,QAAO,KAAKA;AACnD,aAAO,CAAC,GAAG,UAAU,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,MAAM,CAAC;AAAA,IACjE;AAAA,EACF;AACF;AAOO,SAAS,qBAAqB,WAGnC;AAEA,QAAM,SAAS,UAAU,IAAI,aAAa,KAAK,UAAU,IAAI,eAAe;AAC5E,QAAM,MAAM,UAAU,IAAI,YAAY,KAAK,UAAU,IAAI,cAAc;AACvE,SAAO;AAAA,IACL,QAAQ,kBAAkB,aAAa,SAAS;AAAA,IAChD,KAAK,OAAO,QAAQ,WAAW,MAAM;AAAA,EACvC;AACF;;;AD7DA,IAAM,+BAA+B;AAMrC,IAAM,oCAAoC;AAI1C,IAAM,8BAA8B;AAEpC,IAAM,0BAA0B;AAIhC,IAAM,6BAA6B;AAEnC,IAAM,yBAAyB;AA+CxB,SAAS,uBAAuB,YAAyC;AAC9E,QAAM,gBAAgB,aAAa;AACnC,QAAM,oBAAoB,aAAa;AAEvC,MAAI;AACJ,MAAI;AAEJ,MAAI,mBAAmB;AAErB,oBAAgB;AAChB,kBAAc;AAAA,EAChB,WAAW,eAAe;AAExB,oBAAgB;AAChB,kBAAc;AAAA,EAChB,OAAO;AAEL,oBAAgB;AAChB,kBAAc;AAAA,EAChB;AAEA,SAAO;AAAA,IACL;AAAA,IACA,oBAAoB,gBAAgB,6BAA6B;AAAA,IACjE,gBAAgB,gBAAgB,yBAAyB;AAAA,IACzD;AAAA,IACA;AAAA,IACA,aAAa,CAAC;AAAA,EAChB;AACF;AAgBA,SAAS,sBACP,MACA,UACA,SAAS,IACM;AAEf,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,EACT;AAEA,MAAI;AAEF,UAAM,SAAY,eAAiB,UAAK,UAAU,gBAAgB,CAAC;AAGnE,UAAM,YAAiB,UAAK,QAAQ,iBAAiB,MAAM,KAAK;AAGhE,IAAG,iBAAc,WAAW,MAAM,EAAE,MAAM,IAAM,CAAC;AAEjD,WAAO;AAAA,EACT,SAAS,OAAO;AAEd,UAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACtE,YAAQ,KAAK,sDAAsD,QAAQ,KAAK,QAAQ,EAAE;AAC1F,WAAO;AAAA,EACT;AACF;AASO,SAAS,kBACd,SACA,UACU;AACV,QAAM,OAAO;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA,IACA,OAAO,SAAS,kBAAkB;AAAA,IAClC;AAAA,IACA,OAAO,SAAS,cAAc;AAAA,EAChC;AAGA,MAAI,SAAS,aAAa;AACxB,SAAK,KAAK,cAAc,YAAY;AAAA,EACtC;AAGA,MAAI,QAAQ,UAAU;AACpB,QAAI,SAAS,gBAAgB,GAAG;AAC9B,WAAK,KAAK,YAAY;AAAA,IACxB;AACA,SAAK,KAAK,mBAAmB,OAAO,SAAS,aAAa,CAAC;AAC3D,SAAK,KAAK,iBAAiB,OAAO,SAAS,WAAW,CAAC;AAAA,EACzD;AAGA,MAAI,QAAQ,OAAO;AACjB,SAAK,KAAK,WAAW,aAAa;AAAA,EACpC;AAGA,MAAI,CAAC,QAAQ,OAAO;AAClB,SAAK,KAAK,YAAY;AAAA,EACxB;AAEA,SAAO;AACT;AAqBA,eAAsB,8BACpB,MACA,SAC8C;AAE9C,QAAM,YAAY,MAAM,OAAO,oBAAoB;AAGnD,QAAM,kBAAkB,QAAQ,mBAAmB,QAAQ,IAAI;AAK/D,QAAM,YAAY,sBAAsB,MAAM,eAAe;AAG7D,QAAM,YAAY,gBAAgB,IAAI;AAGtC,QAAM,WAAW,uBAAuB,KAAK,MAAM;AAGnD,QAAM,eAAe,kBAAkB,SAAS,QAAQ;AAGxD,QAAM,cAAc,6BAA6B,SAAS;AAG1D,MAAI,eAAe;AACnB,QAAM,eAAe,UAAU,mBAAmB,CAAC,UAA+B;AAChF,oBAAgB,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,EAAE,OAAO,KAAK;AAAA,EACpF,CAAC;AAGD,QAAM,EAAE,MAAM,IAAI,MAAM,UAAU,KAAK,cAAc;AAAA,IACnD,GAAG;AAAA,IACH,QAAQ;AAAA,EACV,CAAC;AAGD,MAAI,OAAO;AACT,UAAM,gBAAgB,YAClB;AAAA;AAAA,0BAA+B,SAAS,KACxC;AAEJ,UAAM,IAAI;AAAA,MACR;AAAA,EAAuC,gBAAgB,MAAM,OAAO,GAAG,aAAa;AAAA;AAAA,MAEpF,EAAE,OAAO,iBAAiB;AAAA,MAC1B,EAAE,aAAa;AAAA,IACjB;AAAA,EACF;AAGA,QAAM,SAAS,qBAAqB,SAAS;AAE7C,MAAI,CAAC,OAAO,QAAQ;AAClB,UAAM,oBAAoB,sBAAsB,MAAM,iBAAiB,YAAY;AACnF,mBAAe,gBAAgB;AAC/B,UAAM,QAAQ,CAAC,GAAG,UAAU,KAAK,CAAC,EAAE,KAAK,IAAI;AAE7C,UAAM,gBAAgB,oBAClB;AAAA,0BAA6B,iBAAiB,KAC9C;AAEJ,UAAM,IAAI;AAAA,MACR;AAAA,mBAAiE,YAAY;AAAA,sBAAyB,KAAK,GAAG,aAAa;AAAA;AAAA,MAE3H,EAAE,OAAO,iBAAiB;AAAA,MAC1B,EAAE,cAAc,gBAAgB,MAAM;AAAA,IACxC;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,KAAK,OAAO,OAAO;AAAA,EACrB;AACF;;;AE7RO,SAAS,oBACd,aACA,cACA,YACQ;AACR,QAAM,gBAAgB,KAAK,WAAW,SAAS,EAAE,EAAE,SAAS,IAAI,GAAG,CAAC;AAGpE,QAAM,iBAAiB,YAAY,OAChC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,EAC3B,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,MAAM,CAAC;AACrC,QAAM,kBAAkB,aAAa,OAClC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,EAC3B,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,MAAM,CAAC;AAErC,SAAO;AAAA,+CACsC,aAAa;AAAA,uBACrC,cAAc;AAAA,wBACb,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sBAejB,aAAa;AAAA,2BACR,cAAc;AAAA,4BACb,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA8yB3C;;;AC71BA,SAAuB,YAAY;AAc5B,SAAS,uBAAuB,QAAyB;AAC9D,QAAM,gBAAgB,wBAAwB,QAAQ,MAAM;AAE5D,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBAUU,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAmChC;AASA,SAAS,wBAAwB,QAAiB,UAA0B;AAC1E,QAAM,OAAQ,OAAe,IAAI;AAEjC,UAAQ,MAAM;AAAA,IACZ,KAAK,UAAU;AACb,aAAO,eAAe,QAAQ,QAAQ;AAAA,IACxC;AAAA,IAEA,KAAK,UAAU;AACb,aAAO,kBAAkB,UAAU,UAAU,iBAAiB;AAAA,IAChE;AAAA,IAEA,KAAK,UAAU;AACb,aAAO,kBAAkB,UAAU,UAAU,iBAAiB;AAAA,IAChE;AAAA,IAEA,KAAK,WAAW;AACd,aAAO,GAAG,kBAAkB,UAAU,UAAU,kBAAkB,CAAC;AAAA,UAC/D,QAAQ,qBAAqB,QAAQ,kCAAkC,QAAQ;AAAA,wBACjE,QAAQ,0CAA0C,QAAQ;AAAA;AAAA;AAAA,IAG9E;AAAA,IAEA,KAAK,WAAW;AACd,aAAO,kBAAkB,UAAU,WAAW,kBAAkB;AAAA,IAClE;AAAA,IAEA,KAAK,SAAS;AACZ,aAAO,cAAc,QAAQ,QAAQ;AAAA,IACvC;AAAA,IAEA,KAAK,SAAS;AACZ,aAAO,cAAc,QAAQ,QAAQ;AAAA,IACvC;AAAA,IAEA,KAAK,WAAW;AACd,YAAM,eAAgB,OAAe;AACrC,YAAM,aACJ,OAAO,iBAAiB,WAAW,IAAI,YAAY,MAAM,OAAO,YAAY;AAC9E,YAAM,WAAW,4BAA4B,OAAO,UAAU;AAC9D,aAAO,GAAG,kBAAkB,UAAU,OAAO,cAAc,aAAa,CAAC;AAAA,UACrE,QAAQ,qBAAqB,QAAQ,gBAAgB,QAAQ,QAAQ,UAAU;AAAA,wBACjE,QAAQ,gBAAgB,QAAQ,aAAa,QAAQ;AAAA;AAAA;AAAA,IAGzE;AAAA,IAEA;AAEE,aAAO;AAAA,EACX;AACF;AAKA,SAAS,eAAe,QAAiB,UAA0B;AACjE,QAAM,aAAc,OAAe,cAAc,CAAC;AAClD,QAAM,WAAW,IAAI,IAAK,OAAe,YAAY,CAAC,CAAC;AAEvD,MAAI,OAAO;AAGX,SAAO,IAAI,QAAQ,gBAAgB,QAAQ,4BAA4B,QAAQ,kCAAkC,QAAQ,kBAAkB,QAAQ,yCAAyC,QAAQ;AAGpM,aAAW,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC1D,UAAM,WAAW,GAAG,QAAQ,IAAI,GAAG;AACnC,UAAM,aAAa,SAAS,IAAI,GAAG;AAGnC,QAAI,YAAY;AACd,cAAQ;AAAA,UACJ,QAAQ,qBAAqB,QAAQ;AAAA,wBACvB,QAAQ;AAAA;AAAA;AAAA,IAG5B,OAAO;AAEL,cAAQ;AAAA,UACJ,QAAQ,qBAAqB,QAAQ;AAAA;AAAA,cAEjC,wBAAwB,YAAuB,QAAQ,CAAC;AAAA;AAAA,IAElE;AAGA,QAAI,YAAY;AACd,cAAQ;AAAA,UACJ,QAAQ,qBAAqB,QAAQ;AAAA,cACjC,wBAAwB,YAAuB,QAAQ,CAAC;AAAA;AAAA;AAAA,IAGlE;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,cAAc,QAAiB,UAA0B;AAChE,QAAM,cAAe,OAAe;AAGpC,QAAM,aAAa,iBAAiB,QAAQ;AAG5C,MAAI,aAAa;AACf,UAAM,oBAAoB;AAAA,QACtB,QAAQ;AAAA,4BACY,QAAQ;AAAA,gCACJ,wBAAwB,aAAwB,MAAM,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQnF,WAAO,IAAI,UAAU,MAAM,iBAAiB,gBAAgB,QAAQ,wCAAwC,QAAQ;AAAA,EACtH;AAEA,SAAO,GAAG,UAAU,qBAAqB,QAAQ,wCAAwC,QAAQ;AACnG;AAKA,SAAS,cAAc,QAAiB,UAA0B;AAChE,QAAM,QAAS,OAAe,SAAS,CAAC;AACxC,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO;AAAA,EACT;AAGA,QAAM,aAAa,MAAM,IAAI,CAAC,WAAoB,wBAAwB,QAAQ,QAAQ,CAAC;AAG3F,SAAO,IAAI,QAAQ,qBAAqB,QAAQ;AAAA,QAC1C,WAAW,KAAK,mBAAmB,CAAC;AAAA;AAAA,oBAExB,QAAQ,+DAA+D,QAAQ;AACnG;AAKA,SAAS,kBAAkB,UAAkB,cAAsB,SAAyB;AAC1F,SAAO,IAAI,QAAQ,qBAAqB,QAAQ,uBAAuB,QAAQ,SAAS,YAAY;AAAA,kBACpF,QAAQ,gBAAgB,OAAO,aAAa,QAAQ;AAAA;AAEtE;;;AC1NO,SAAS,wBAAwB,MAGtC;AAMA,QAAM,cAAc,KACjB,QAAQ,mCAAmC,6BAA6B,EACxE,QAAQ,sCAAsC,gCAAgC,EAC9E,QAAQ,+BAA+B,mBAAmB,EAC1D,QAAQ,oCAAoC,wBAAwB,EACpE,QAAQ,qCAAqC,yBAAyB,EACtE,QAAQ,kCAAkC,4BAA4B,EACtE,QAAQ,iCAAiC,2BAA2B,EACpE,QAAQ,iCAAiC,2BAA2B,EACpE,QAAQ,gCAAgC,0BAA0B,EAClE,QAAQ,yCAAyC,mCAAmC;AAGvF,QAAM,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoBnB,QAAM,SAAyE,CAAC;AAEhF,QAAM,UAAU,IAAI;AAAA,IAClB;AAAA,IACA,aACE,cACA;AAAA;AAAA;AAAA;AAAA,EAIJ;AAEA,UAAQ,MAAM;AAEd,MAAI,CAAC,OAAO,gBAAgB,CAAC,OAAO,iBAAiB;AACnD,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA,EAAE,OAAO,cAAc;AAAA,IACzB;AAAA,EACF;AAOA,QAAM,aAAa,OAAO;AAC1B,QAAM,qBAAqB,MAAM;AACjC,QAAM,kBAAkB,MAAM;AAE9B,QAAM,iBAA4B,CAACC,OAAM,WAAW;AAElD,QAAI,OAAO,OAAO,aAAa,iBAAiB;AAC9C,YAAM,cAAc,KAAK,MAAM,kBAAkB,OAAO,OAAO,cAAc,KAAK;AAClF,aAAO,KAAK,WAAW;AAAA,IACzB;AAGA,QAAI,aAAa;AACjB,UAAM,WAAW,CAAC,SAAyB;AACzC,YAAM,MAAM;AACZ,oBAAc;AAEd,UAAI,aAAa,OAAO,OAAO,YAAY;AACzC,cAAM,cAAc,KAAK,MAAM,aAAa,OAAO,OAAO,cAAc,KAAK;AAC7E,eAAO,KAAK,WAAW;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AACA,WAAO,WAAWA,OAAM,QAAQ,QAAQ;AAAA,EAC1C;AAEA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,WAAW,OAAO;AAAA,EACpB;AACF;AAGA,IAAI,qBAA8B;AAQlC,eAAsB,wBAAwB,MAAmC;AAS/E,MAAI,cAAc;AAGlB,QAAM,cAAc;AACpB,gBAAc,YAAY,QAAQ,aAAa,EAAE;AAIjD,gBAAc,YAAY,QAAQ,wCAAwC,IAAI;AAI9E,gBAAc,YAAY,QAAQ,qDAAqD,KAAK;AAI5F,gBAAc,YAAY,QAAQ,yBAAyB,EAAE;AAC7D,gBAAc,YAAY,QAAQ,cAAc,EAAE;AAIlD,gBAAc,YAAY,QAAQ,mBAAmB,OAAO;AAG5D,gBAAc,YAAY,QAAQ,gBAAgB,EAAE;AAGpD,gBAAc,YACX,QAAQ,oCAAoC,wBAAwB,EACpE,QAAQ,mCAAmC,uBAAuB,EAClE,QAAQ,iCAAiC,qBAAqB;AAGjE,MAAI,CAAC,oBAAoB;AACvB,UAAMC,UAAS,MAAM,OAAO,4BAA4B;AACxD,yBAAqBA,QAAO;AAAA,EAC9B;AACA,QAAM,eAAe;AAGrB,QAAM,SAAc,CAAC;AAErB,QAAM,UAAU,IAAI;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,QACI,WAAW;AAAA;AAAA;AAAA,EAGjB;AAEA,UAAQ,cAAc,MAAM;AAE5B,MAAI,CAAC,OAAO,eAAe;AACzB,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA,EAAE,OAAO,iBAAiB;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO,OAAO;AAChB;;;ACxLA,IAAM,uBAAuB;AAY7B,IAAM,2BAA2B;AAYjC,IAAM,4BAA4B;AAK3B,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YACE,SACgB,OAAe,IACf,SAChB;AACA,UAAM,OAAO;AAHG;AACA;AAGhB,SAAK,OAAO;AAAA,EACd;AACF;AAiBO,SAAS,aAAa,QAA4B,UAAwB;AAC/E,QAAMC,WAAU,OAAO,OAAO;AAC9B,MAAI,YAAYA,UAAS;AACvB;AAAA,EACF;AAGA,QAAM,cAAc,KAAK,MAAM,WAAWA,YAAW,oBAAoB;AAGzE,MAAI;AACF,UAAM,WAAW,OAAO,KAAK,WAAW;AACxC,QAAI,WAAW,GAAG;AAChB,YAAM,IAAI,aAAa,4BAA4B,WAAW,UAAU,CAAC;AAAA,IAC3E;AAAA,EACF,SAAS,OAAO;AAEd,QAAI,iBAAiB,cAAc;AACjC,YAAM;AAAA,IACR;AACA,UAAM,IAAI;AAAA,MACR,qCAAqC,QAAQ,mBAChCA,QAAO,gBAAgB,WAAW,mBAC5C,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,MACxD;AAAA;AAAA,IACF;AAAA,EACF;AACF;AAiDO,IAAM,mBAAN,MAAuB;AAAA,EAQ5B,YAAoB,SAAkC;AAAlC;AAKlB,UAAM,SAAS,IAAI;AAAA,MACjB,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,IACf;AACA,SAAK,SAAS,IAAI,YAAY,OAAO,MAAgC;AAErE,SAAK,UAAU,QAAQ;AACvB,SAAK,YAAY,QAAQ;AACzB,SAAK,WAAW,QAAQ;AAAA,EAC1B;AAAA,EAtBQ,WAAwC;AAAA,EACxC,SAAoC;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBR,MAAc,aAA4B;AACxC,QAAI,KAAK,aAAa,MAAM;AAC1B;AAAA,IACF;AAKA,SAAK,WAAW,MAAM,YAAY,YAAY,KAAK,QAAQ;AAAA,MACzD,KAAK;AAAA,QACH,OAAO,MAAM;AACX,gBAAM,IAAI,aAAa,mBAAmB;AAAA,QAC5C;AAAA,QACA,MAAM,MAAM;AACV,iBAAO,KAAK,IAAI;AAAA,QAClB;AAAA,QACA,YAAY,MAAM,KAAK,IAAI;AAAA,MAC7B;AAAA;AAAA,MAEA,OAAO,CAAC;AAAA,IACV,CAAC;AAGD,SAAK,SAAS,KAAK,SAAS,QAAQ;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,SAAmE,OAAsB;AAC7F,UAAM,KAAK,WAAW;AAEtB,QAAI,CAAC,KAAK,YAAY,CAAC,KAAK,QAAQ;AAClC,YAAM,IAAI,aAAa,+BAA+B;AAAA,IACxD;AAGA,UAAM,SAAS,KAAK;AACpB,UAAM,WAAW,KAAK;AAGtB,QAAI,KAAK,UAAU;AACjB,UAAI;AACF,aAAK,SAAS,KAAK;AAAA,MACrB,SAAS,OAAO;AACd,YAAI,iBAAiB,OAAO;AAC1B,gBAAM,IAAI,aAAa,4BAA4B,MAAM,OAAO,IAAI,GAAG,EAAE,MAAM,CAAC;AAAA,QAClF;AACA,cAAM;AAAA,MACR;AAAA,IACF;AAIA,UAAM,mBAAmB,SAAS,QAAQ;AAC1C,QAAI,kBAAkB;AACpB,uBAAiB;AAAA,IACnB;AAEA,QAAI;AAEF,YAAM,WAAmB,KAAK,QAAQ,OAAkC,MAAM;AAG9E,UAAI,WAAW,2BAA2B;AACxC,cAAM,IAAI;AAAA,UACR,0BAA0B,QAAQ,gBAAgB,yBAAyB;AAAA,QAC7E;AAAA,MACF;AAGA,YAAM,cAAc,SAAS,QAAQ;AACrC,UAAI,aAAa;AACf,oBAAY;AAAA,MACd;AAGA,YAAM,aAAa,SAAS,QAAQ;AACpC,UAAI,CAAC,YAAY;AACf,cAAM,IAAI,aAAa,iDAAiD;AAAA,MAC1E;AAEA,YAAM,YAAoB,WAAW,QAAQ;AAG7C,YAAM,iBAAiB,SAAS,QAAQ;AACxC,UAAI,gBAAgB;AAClB,cAAM,YAAY,eAAe;AACjC,YAAI,cAAc,GAAG;AACnB,gBAAM,IAAI,aAAa,KAAK,gBAAgB,SAAS,GAAG,WAAW,EAAE,OAAO,UAAU,CAAC;AAAA,QACzF;AAAA,MACF;AAKA,UAAI,YAAY,OAAO,OAAO,YAAY;AAAA,MAG1C;AAGA,YAAM,SAAS,KAAK,UAAU,WAAW,MAAM;AAE/C,aAAO;AAAA,IACT,UAAE;AAGA,UAAI,kBAAkB;AACpB,yBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,gBAAgB,WAA2B;AAIjD,UAAM,gBAAwC;AAAA,MAC5C,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAEA,WAAO,cAAc,SAAS,KAAK,uBAAuB,SAAS;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAuC;AACrC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAA2C;AACzC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAgB;AACd,SAAK,WAAW;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,iBAAqE;AAGnE,UAAM,eAAe,KAAK,QAAQ,OAAO,cAAc;AACvD,WAAO;AAAA,MACL,SAAS;AAAA,MACT,UAAU,KAAK,QAAQ,sBAAsB,4BAA4B;AAAA,MACzE,MAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,eAAe,UAA0B;AACvC,QAAI,CAAC,KAAK,QAAQ;AAChB,YAAM,IAAI,aAAa,kDAAkD,CAAC;AAAA,IAC5E;AAGA,QAAI;AACF,mBAAa,KAAK,QAAQ,QAAQ;AAAA,IACpC,SAAS,OAAO;AACd,YAAM,IAAI;AAAA,QACR,6BAA6B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,QACnF;AAAA;AAAA,MACF;AAAA,IACF;AAGA,WAAO;AAAA,EACT;AACF;AAwBA,eAAsB,uBACpB,QACA,UAC2B;AAE3B,QAAM,EAAE,SAAS,UAAU,IAAI,wBAAwB,OAAO,WAAW;AAGzE,QAAM,YAAY,YAAa,MAAM,wBAAwB,OAAO,cAAc;AAElF,SAAO,IAAI,iBAAiB;AAAA,IAC1B,MAAM,OAAO;AAAA,IACb,YAAY,OAAO;AAAA,IACnB;AAAA,IACA;AAAA,IACA,UAAU;AAAA,EACZ,CAAC;AACH;;;ACxZA,eAAsB,sBACpB,MACA,SAC8C;AAE9C,MAAI,eAAe,GAAG;AACpB,UAAM,WAAW,gBAAgB,MAAM,OAAO;AAC9C,UAAM,SAAS,kBAAkB,QAAQ;AACzC,QAAI,QAAQ;AACV,aAAO;AAAA,IACT;AAGA,UAAM,SAAS,MAAM,8BAA8B,MAAM,OAAO;AAChE,qBAAiB,UAAU,MAAM;AACjC,WAAO;AAAA,EACT;AAGA,SAAO,8BAA8B,MAAM,OAAO;AACpD;;;ACvDA,SAAuB,QAAAC,aAAY;AAEnC,SAAS,cAAAC,mBAAkB;AAiCpB,SAAS,cAAc,QAAkC;AAC9D,QAAM,SAA0B;AAAA,IAC9B,QAAQ,CAAC;AAAA,EACX;AAGA,QAAM,SAAwB,cAAc,QAAQ,EAAE;AAGtD,MAAI,gBAAgB;AAGpB,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,aAAa,MAAM,MAAM;AAC1C,QAAI,SAAS,SAAS;AACpB,aAAO,OAAO,KAAK;AAAA,QACjB,MAAM,MAAM;AAAA,QACZ,UAAU,MAAM;AAAA,QAChB,MAAM,SAAS;AAAA,QACf,QAAQ;AAAA,QACR,MAAM,SAAS;AAAA,MACjB,CAAC;AACD,uBAAiB,SAAS;AAAA,IAC5B;AAAA,EACF;AAIA,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,aAAa,MAAM,MAAM;AAC1C,QAAI,CAAC,SAAS,SAAS;AACrB,aAAO,OAAO,KAAK;AAAA,QACjB,MAAM,MAAM;AAAA,QACZ,UAAU,MAAM;AAAA,QAChB,MAAM,SAAS;AAAA,QACf,QAAQ;AAAA,QACR,MAAM;AAAA;AAAA,MACR,CAAC;AACD,uBAAiB;AAAA,IACnB;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,cAAc,QAAiBC,OAA6B;AACnE,QAAM,SAAwB,CAAC;AAE/B,QAAM,OAAQ,OAAeF,KAAI;AAEjC,MAAI,SAAS,UAAU;AACrB,UAAM,aAAc,OAAe,cAAc,CAAC;AAClD,eAAW,CAAC,MAAM,WAAW,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC5D,YAAM,YAAYE,QAAO,GAAGA,KAAI,IAAI,IAAI,KAAK;AAC7C,YAAM,WAAWA,QAAO,GAAGA,KAAI,IAAI,IAAI,KAAK;AAE5C,YAAM,eAAe,cAAc,aAAwB,SAAS;AACpE,UAAI,aAAa,SAAS,GAAG;AAC3B,eAAO,KAAK,GAAG,YAAY;AAAA,MAC7B,OAAO;AACL,eAAO,KAAK;AAAA,UACV,QAAQ;AAAA,UACR,MAAM;AAAA,UACN;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,SAAO;AACT;AAKA,SAAS,aAAa,QAIpB;AACA,QAAM,OAAQ,OAAeF,KAAI;AAEjC,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,IAEjD,KAAK;AACH,aAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,IAEjD,KAAK;AAGH,aAAO,EAAE,SAAS,MAAM,QAAQ,QAAQ,MAAM,EAAE;AAAA,IAElD,KAAK;AACH,aAAO,EAAE,SAAS,OAAO,QAAQ,UAAU,MAAM,GAAG;AAAA,IAEtD,KAAK;AACH,aAAO,EAAE,SAAS,OAAO,QAAQ,SAAS,MAAM,GAAG;AAAA,IAErD,KAAK;AAEH,aAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,IAEjD,KAAK;AAEH,YAAM,QAAS,OAAe;AAC9B,UAAI,MAAM,QAAQ,KAAK,KAAK,MAAM,SAAS,GAAG;AAC5C,cAAM,YAAa,MAAM,CAAC,EAAUA,KAAI;AACxC,YAAI,cAAc,WAAW;AAC3B,iBAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,QACjD;AAAA,MACF;AAGA,aAAO,EAAE,SAAS,OAAO,QAAQ,UAAU,MAAM,GAAG;AAAA,IAEtD;AAEE,aAAO,EAAE,SAAS,OAAO,QAAQ,UAAU,MAAM,GAAG;AAAA,EACxD;AACF;AAcO,SAAS,kBAAkB,aAAsB,cAA+B;AAErF,QAAM,YAAY,KAAK;AAAA,IACrB;AAAA,MACE,OAAO,mBAAmB,WAAW;AAAA,MACrC,QAAQ,mBAAmB,YAAY;AAAA,IACzC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAGA,QAAM,OAAOC,YAAW,QAAQ,EAAE,OAAO,SAAS,EAAE,OAAO;AAG3D,SAAO,KAAK,gBAAgB,CAAC;AAC/B;AAKA,SAAS,mBAAmB,QAA0B;AACpD,QAAM,OAAQ,OAAeD,KAAI;AAEjC,MAAI,SAAS,UAAU;AACrB,UAAM,aAAc,OAAe,cAAc,CAAC;AAClD,UAAM,YAAqC,CAAC;AAC5C,UAAM,OAAO,OAAO,KAAK,UAAU,EAAE,KAAK;AAE1C,eAAW,OAAO,MAAM;AACtB,gBAAU,GAAG,IAAI,mBAAmB,WAAW,GAAG,CAAC;AAAA,IACrD;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,WAAY,OAAe,YAAY,CAAC,GAAG,KAAK;AAAA,IAClD;AAAA,EACF;AAEA,MAAI,SAAS,SAAS;AACpB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,mBAAoB,OAAe,KAAK;AAAA,IACjD;AAAA,EACF;AAEA,MAAI,SAAS,QAAQ;AACnB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAU,OAAe,SAAS,CAAC,GAAG,IAAI,CAAC,QAAkB,IAAY,KAAK,EAAE,KAAK;AAAA,IACvF;AAAA,EACF;AAEA,MAAI,SAAS,WAAW;AACtB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAQ,OAAe;AAAA,IACzB;AAAA,EACF;AAGA,QAAM,iBAAyC;AAAA,IAC7C,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,SAAS;AAAA,EACX;AAEA,SAAO,eAAe,IAAI,KAAK;AACjC;;;ACvOA,SAAS,gBAAAG,qBAAoB;AAC7B,OAAOC,WAAU;;;ACsIV,SAAS,gBAAgB,MAA4C;AAC1E,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,gBAAgB,MAA4C;AAC1E,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,iBAAiB,MAA6C;AAC5E,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,cAAc,MAA0C;AACtE,SAAO,KAAK,SAAS;AACvB;AAcO,SAAS,WAAW,MAAuC;AAChE,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,UAAU,MAAsC;AAC9D,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,YAAY,MAAwC;AAClE,SAAO,KAAK,SAAS;AACvB;;;AC1LA,SAAS,aAAa,WAAW,aAA0B;AAK3D,IAAM,aAAa,YAAY;AAAA,EAC7B,MAAM;AAAA,EACN,SAAS;AAAA,EACT,OAAO,MAAM;AACf,CAAC;AAED,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,OAAO,CAAC;AAC9D,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,KAAK,CAAC;AAEtD,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,KAAK,CAAC;AACpD,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,KAAK,CAAC;AAC1D,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,MAAM,CAAC;AACzD,IAAM,UAAU,YAAY,EAAE,MAAM,WAAW,SAAS,MAAM,CAAC;AAC/D,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AACxD,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AACxD,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,IAAI,CAAC;AACnD,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,IAAI,CAAC;AAEnD,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAC5D,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAC1D,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,IAAI,CAAC;AAK3D,IAAM,aAAa,YAAY,EAAE,MAAM,cAAc,SAAS,gBAAgB,CAAC;AAE/E,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,OAAO,YAAY,WAAW,CAAC;AAC/E,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,MAAM,YAAY,WAAW,CAAC;AAC5E,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,OAAO,YAAY,WAAW,CAAC;AAC/E,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,MAAM,YAAY,WAAW,CAAC;AAE5E,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,QAAQ,YAAY,WAAW,CAAC;AAClF,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,SAAS,YAAY,WAAW,CAAC;AACrF,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,QAAQ,YAAY,WAAW,CAAC;AAElF,IAAM,gBAAgB,YAAY;AAAA,EAChC,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,IAAM,gBAAgB,YAAY;AAAA,EAChC,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAMD,IAAM,eAAe,YAAY;AAAA,EAC/B,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AACD,IAAM,iBAAiB,YAAY;AAAA,EACjC,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AACD,IAAM,eAAe,YAAY;AAAA,EAC/B,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,IAAM,gBAAgB,YAAY;AAAA,EAChC,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,IAAI,CAAC;AAGvD,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,MAAM,YAAY,WAAW,CAAC;AAGpF,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AACxD,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,IAAI,CAAC;AACzD,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AACxD,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,KAAK,CAAC;AACtD,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,IAAI,CAAC;AACrD,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,KAAK,CAAC;AAE1D,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAC5D,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAC5D,IAAM,WAAW,YAAY,EAAE,MAAM,YAAY,SAAS,KAAK,CAAC;AAChE,IAAM,WAAW,YAAY,EAAE,MAAM,YAAY,SAAS,KAAK,CAAC;AAEhE,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAC5D,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAE5D,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,IAAI,CAAC;AACzD,IAAM,WAAW,YAAY,EAAE,MAAM,YAAY,SAAS,MAAM,YAAY,WAAW,CAAC;AACxF,IAAM,mBAAmB,YAAY,EAAE,MAAM,oBAAoB,SAAS,OAAO,CAAC;AAClF,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,IAAI,CAAC;AAEzD,IAAM,YAAY;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAgBA,IAAM,sBAAN,cAAkC,UAAU;AAAA,EAC1C,cAAc;AACZ,UAAM,SAAS;AACf,SAAK,oBAAoB;AAAA,EAC3B;AAAA;AAAA,EAGA,aAAa,KAAK,KAAK,cAAc,MAAM;AACzC,SAAK,QAAQ,KAAK,0BAA0B,EAAE,OAAO,YAAY,CAAC;AAClE,SAAK,OAAO,MAAM;AAChB,WAAK,QAAQ,QAAQ;AACrB,WAAK,SAAS,KAAK,YAAY,EAAE,OAAO,aAAa,CAAC;AACtD,WAAK,QAAQ,KAAK;AAClB,WAAK,SAAS,KAAK,YAAY,EAAE,OAAO,YAAY,CAAC;AAAA,IACvD,CAAC;AAAA,EACH,CAAC;AAAA,EAED,2BAA2B,KAAK,KAAK,4BAA4B,MAAM;AACrE,SAAK,QAAQ,KAAK,cAAc,EAAE,OAAO,MAAM,CAAC;AAChD,SAAK,KAAK,MAAM;AACd,WAAK,QAAQ,gBAAgB;AAC7B,WAAK,SAAS,KAAK,cAAc,EAAE,OAAO,MAAM,CAAC;AAAA,IACnD,CAAC;AAAA,EACH,CAAC;AAAA,EAED,eAAe,KAAK,KAAK,gBAAgB,MAAM;AAC7C,SAAK,QAAQ,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;AACjD,SAAK,KAAK,MAAM;AACd,WAAK,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE,GAAG,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE,CAAC,CAAC;AAC5E,WAAK,SAAS,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;AAAA,IACpD,CAAC;AAAA,EACH,CAAC;AAAA,EAED,gBAAgB,KAAK,KAAK,iBAAiB,MAAM;AAC/C,SAAK,QAAQ,KAAK,sBAAsB,EAAE,OAAO,MAAM,CAAC;AACxD,SAAK,KAAK,MAAM;AACd,WAAK,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,QAAQ,GAAG,EAAE,GAAG,EAAE,KAAK,MAAM,KAAK,QAAQ,MAAM,EAAE,CAAC,CAAC;AAC/E,WAAK,SAAS,KAAK,sBAAsB,EAAE,OAAO,MAAM,CAAC;AAAA,IAC3D,CAAC;AAAA,EACH,CAAC;AAAA,EAED,uBAAuB,KAAK,KAAK,wBAAwB,MAAM;AAC7D,SAAK,QAAQ,KAAK,oBAAoB,EAAE,OAAO,MAAM,CAAC;AACtD,SAAK,OAAO,MAAM;AAChB,WAAK,GAAG;AAAA,QACN,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE;AAAA,QAC9B,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,EAAE;AAAA,QACjC,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE;AAAA,QAC9B,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE;AAAA,QAC9B,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,QAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,QAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE;AAAA,QAC9B;AAAA,UACE,KAAK,MAAM;AACT,iBAAK,QAAQ,GAAG;AAChB,iBAAK,SAAS,EAAE;AAAA,UAClB;AAAA,QACF;AAAA;AAAA,MACF,CAAC;AACD,WAAK,SAAS,KAAK,oBAAoB,EAAE,OAAO,MAAM,CAAC;AAAA,IACzD,CAAC;AAAA,EACH,CAAC;AAAA,EAED,qBAAqB,KAAK,KAAK,sBAAsB,MAAM;AACzD,SAAK,QAAQ,KAAK,0BAA0B,EAAE,OAAO,MAAM,CAAC;AAC5D,SAAK,KAAK,MAAM;AACd,WAAK,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE,GAAG,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,EAAE,CAAC,CAAC;AAC/E,WAAK,SAAS,KAAK,0BAA0B,EAAE,OAAO,MAAM,CAAC;AAAA,IAC/D,CAAC;AAAA,EACH,CAAC;AAAA,EAED,2BAA2B,KAAK,KAAK,4BAA4B,MAAM;AACrE,SAAK,QAAQ,KAAK,iBAAiB,EAAE,OAAO,MAAM,CAAC;AACnD,SAAK,KAAK,MAAM;AACd,WAAK,GAAG;AAAA,QACN,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,QAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,GAAG,EAAE;AAAA,QAC/B,EAAE,KAAK,MAAM,KAAK,QAAQ,GAAG,EAAE;AAAA,MACjC,CAAC;AACD,WAAK,SAAS,KAAK,iBAAiB,EAAE,OAAO,MAAM,CAAC;AAAA,IACtD,CAAC;AAAA,EACH,CAAC;AAAA;AAAA;AAAA;AAAA,EAKD,kBAAkB,KAAK,KAAK,mBAAmB,MAAM;AACnD,SAAK,QAAQ,KAAK,iBAAiB,EAAE,OAAO,OAAO,CAAC;AACpD,SAAK,OAAO,MAAM;AAChB,WAAK,QAAQ,KAAK;AAClB,WAAK,QAAQ,KAAK,iBAAiB,EAAE,OAAO,WAAW,CAAC;AAAA,IAC1D,CAAC;AAAA,EACH,CAAC;AAAA,EAED,kBAAkB,KAAK,KAAK,mBAAmB,MAAM;AACnD,SAAK,GAAG;AAAA,MACN;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,GAAG;AAChB,eAAK,QAAQ,KAAK,iBAAiB,EAAE,OAAO,UAAU,CAAC;AAAA,QACzD;AAAA,MACF;AAAA,MACA;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,MAAM;AACnB,eAAK,SAAS,KAAK,iBAAiB,EAAE,OAAO,UAAU,CAAC;AAAA,QAC1D;AAAA,MACF;AAAA,MACA;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,KAAK;AAClB,eAAK,SAAS,KAAK,iBAAiB,EAAE,OAAO,UAAU,CAAC;AAAA,QAC1D;AAAA,MACF;AAAA,MACA,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,iBAAiB,EAAE;AAAA,IACpD,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,oBAAoB,KAAK,KAAK,qBAAqB,MAAM;AACvD,SAAK,QAAQ,KAAK,iBAAiB;AACnC,SAAK,KAAK,MAAM;AACd,WAAK,GAAG;AAAA,QACN;AAAA,UACE,KAAK,MAAM;AACT,iBAAK,QAAQ,GAAG;AAChB,iBAAK,QAAQ,YAAY,EAAE,OAAO,WAAW,CAAC;AAAA,UAChD;AAAA,QACF;AAAA,QACA;AAAA,UACE,KAAK,MAAM;AACT,iBAAK,QAAQ,QAAQ;AACrB,iBAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,QAAQ,CAAC;AAChD,iBAAK,QAAQ,QAAQ;AAAA,UACvB;AAAA,QACF;AAAA,QACA;AAAA,UACE,KAAK,MAAM;AACT,iBAAK,QAAQ,MAAM;AACnB,iBAAK,OAAO,MAAM,KAAK,QAAQ,KAAK,YAAY,CAAC;AACjD,iBAAK,QAAQ,MAAM;AAAA,UACrB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;AAAA,EAED,oBAAoB,KAAK,KAAK,qBAAqB,MAAM;AACvD,SAAK,GAAG;AAAA,MACN,EAAE,KAAK,MAAM,KAAK,QAAQ,aAAa,EAAE;AAAA,MACzC,EAAE,KAAK,MAAM,KAAK,QAAQ,aAAa,EAAE;AAAA,MACzC,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,eAAe,EAAE;AAAA,MAChD,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,MAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,EAAE;AAAA,MACjC,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,MAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA;AAAA,MAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,MAAM,EAAE;AAAA;AAAA,MAClC,EAAE,KAAK,MAAM,KAAK,QAAQ,UAAU,EAAE;AAAA;AAAA,MAEtC;AAAA,QACE,MAAM,MAAM,KAAK,oBAAoB;AAAA,QACrC,KAAK,MAAM,KAAK,QAAQ,KAAK,sBAAsB;AAAA,MACrD;AAAA;AAAA,MAEA;AAAA,QACE,MAAM,MAAM,KAAK,qBAAqB;AAAA,QACtC,KAAK,MAAM,KAAK,QAAQ,KAAK,uBAAuB;AAAA,MACtD;AAAA,MACA;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,MAAM;AACnB,eAAK,QAAQ,KAAK,UAAU;AAC5B,eAAK,QAAQ,MAAM;AAAA,QACrB;AAAA,MACF;AAAA;AAAA,MAEA;AAAA,QACE,MAAM,MAAM,KAAK,gBAAgB;AAAA,QACjC,KAAK,MAAM,KAAK,QAAQ,KAAK,kBAAkB;AAAA,MACjD;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,kBAAkB,KAAK,KAAK,mBAAmB,MAAM;AACnD,SAAK,GAAG;AAAA;AAAA,MAEN,EAAE,KAAK,MAAM,KAAK,QAAQ,aAAa,EAAE;AAAA;AAAA,MAEzC;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,YAAY;AACzB,eAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,OAAO,CAAC;AAC/C,eAAK,KAAK,MAAM;AACd,iBAAK,QAAQ,cAAc;AAC3B,iBAAK,SAAS,KAAK,YAAY,EAAE,OAAO,OAAO,CAAC;AAAA,UAClD,CAAC;AACD,eAAK,QAAQ,YAAY;AAAA,QAC3B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,qBAAqB,KAAK,KAAK,sBAAsB,MAAM;AACzD,SAAK,GAAG;AAAA,MACN,EAAE,KAAK,MAAM,KAAK,QAAQ,UAAU,EAAE,OAAO,eAAe,CAAC,EAAE;AAAA,MAC/D,EAAE,KAAK,MAAM,KAAK,QAAQ,QAAQ,EAAE,OAAO,eAAe,CAAC,EAAE;AAAA,IAC/D,CAAC;AAED,SAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,QAAQ,CAAC;AAChD,SAAK,QAAQ,MAAM;AACnB,SAAK,SAAS,KAAK,YAAY,EAAE,OAAO,MAAM,CAAC;AAE/C,SAAK,IAAI;AAAA,MACP,EAAE,KAAK,MAAM,KAAK,QAAQ,UAAU,EAAE,OAAO,aAAa,CAAC,EAAE;AAAA,MAC7D,EAAE,KAAK,MAAM,KAAK,QAAQ,QAAQ,EAAE,OAAO,aAAa,CAAC,EAAE;AAAA,IAC7D,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,yBAAyB,KAAK,KAAK,0BAA0B,MAAM;AACjE,SAAK,QAAQ,QAAQ;AACrB,SAAK,OAAO,MAAM,KAAK,QAAQ,KAAK,YAAY,CAAC;AACjD,SAAK,QAAQ,QAAQ;AAAA,EACvB,CAAC;AAAA;AAAA,EAGD,0BAA0B,KAAK,KAAK,2BAA2B,MAAM;AACnE,SAAK,QAAQ,MAAM;AACnB,SAAK,OAAO,MAAM,KAAK,QAAQ,KAAK,kBAAkB,CAAC;AACvD,SAAK,QAAQ,MAAM;AAAA,EACrB,CAAC;AAAA;AAAA,EAGD,qBAAqB,KAAK,KAAK,sBAAsB,MAAM;AACzD,SAAK,QAAQ,KAAK,gBAAgB,EAAE,OAAO,OAAO,CAAC;AACnD,SAAK,KAAK,MAAM;AACd,WAAK,QAAQ,KAAK;AAClB,WAAK,SAAS,KAAK,gBAAgB,EAAE,OAAO,OAAO,CAAC;AAAA,IACtD,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,iBAAiB,KAAK,KAAK,kBAAkB,MAAM;AACjD,SAAK,GAAG;AAAA,MACN,EAAE,KAAK,MAAM,KAAK,QAAQ,eAAe,EAAE,OAAO,MAAM,CAAC,EAAE;AAAA,MAC3D,EAAE,KAAK,MAAM,KAAK,QAAQ,YAAY,EAAE,OAAO,MAAM,CAAC,EAAE;AAAA,IAC1D,CAAC;AACD,SAAK,QAAQ,KAAK;AAClB,SAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,QAAQ,CAAC;AAAA,EAClD,CAAC;AAAA,EAED,eAAe,KAAK,KAAK,gBAAgB,MAAM;AAC7C,SAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,MAAM,CAAC;AAC9C,SAAK,KAAK,MAAM;AACd,WAAK,QAAQ,KAAK;AAClB,WAAK,SAAS,KAAK,YAAY,EAAE,OAAO,MAAM,CAAC;AAAA,IACjD,CAAC;AAAA,EACH,CAAC;AAAA;AAAA;AAAA;AAAA,EAKO,sBAA+B;AACrC,UAAMC,aAAY,KAAK,GAAG,CAAC;AAC3B,QAAI,CAACA,cAAaA,WAAU,cAAc,UAAU;AAClD,aAAO;AAAA,IACT;AAIA,WAAO,CAAC,KAAK,gBAAgB;AAAA,EAC/B;AAAA;AAAA;AAAA,EAIQ,uBAAgC;AACtC,UAAMA,aAAY,KAAK,GAAG,CAAC;AAC3B,QAAI,CAACA,cAAaA,WAAU,cAAc,QAAQ;AAChD,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,kBAA2B;AACjC,UAAMA,aAAY,KAAK,GAAG,CAAC;AAC3B,QAAI,CAACA,YAAW;AACd,aAAO;AAAA,IACT;AACA,UAAM,YAAYA,WAAU;AAG5B,QAAI,cAAc,YAAY,cAAc,QAAQ;AAClD,aAAO;AAAA,IACT;AAIA,QAAI,QAAQ;AACZ,QAAI,IAAI;AACR,WAAO,MAAM;AACX,YAAM,QAAQ,KAAK,GAAG,EAAE,CAAC;AAEzB,UAAI,CAAC,SAAS,MAAM,UAAU,SAAS,OAAO;AAC5C;AAAA,MACF;AAEA,YAAM,KAAK,MAAM;AACjB,UAAI,OAAO,YAAY,OAAO,UAAU,OAAO,QAAQ;AACrD;AAAA,MACF,WAAW,OAAO,YAAY,OAAO,UAAU,OAAO,QAAQ;AAC5D,YAAI,UAAU,GAAG;AAEf,iBAAO;AAAA,QACT;AACA;AAAA,MACF,WAAW,OAAO,QAAQ;AAExB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAEO,IAAM,SAAS,IAAI,oBAAoB;AACvC,IAAM,QAAQ,IAAI,MAAM,SAAS;;;ACtexC,IAAM,iBAAiB,OAAO,6BAA6B;AAK3D,IAAM,uBAAN,cAAmC,eAAe;AAAA,EAChD,cAAc;AACZ,UAAM;AACN,SAAK,gBAAgB;AAAA,EACvB;AAAA,EAEA,WAAW,KAAyB;AAClC,UAAM,YAAY,KAAK,MAAM,IAAI,SAAS;AAE1C,QAAI,IAAI,UAAU;AAChB,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,QACA,YAAY,KAAK,MAAM,IAAI,UAAU;AAAA,QACrC,WAAW,KAAK,MAAM,IAAI,SAAS;AAAA,MACrC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,yBAAyB,KAAyB;AAChD,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE/B,QAAI,IAAI,KAAK;AACX,iBAAW,WAAW,IAAI,KAAK;AAC7B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,MAAM,OAAO;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,aAAa,KAAyB;AACpC,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE/B,QAAI,IAAI,KAAK;AACX,iBAAW,WAAW,IAAI,KAAK;AAC7B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,MAAM,OAAO;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,cAAc,KAAyB;AACrC,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE/B,QAAI,IAAI,KAAK;AACX,iBAAW,WAAW,IAAI,KAAK;AAC7B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,MAAM,OAAO;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,qBAAqB,KAAyB;AAC5C,UAAM,MAAM,KAAK,MAAM,IAAI,GAAG;AAE9B,QAAI,CAAC,IAAI,KAAK;AACZ,aAAO;AAAA,IACT;AAGA,QAAI;AACJ,QAAI,IAAI,IAAI;AACV,WAAK;AAAA,IACP,WAAW,IAAI,OAAO;AACpB,WAAK;AAAA,IACP,WAAW,IAAI,IAAI;AACjB,WAAK;AAAA,IACP,WAAW,IAAI,IAAI;AACjB,WAAK;AAAA,IACP,WAAW,IAAI,MAAM;AACnB,WAAK;AAAA,IACP,WAAW,IAAI,MAAM;AACnB,WAAK;AAAA,IACP,WAAW,IAAI,IAAI;AACjB,WAAK,IAAI,MAAM,WAAW;AAAA,IAC5B,OAAO;AACL,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAC/C;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN;AAAA,MACA,MAAM;AAAA,MACN,OAAO,KAAK,MAAM,IAAI,GAAG;AAAA,IAC3B;AAAA,EACF;AAAA,EAEA,mBAAmB,KAAyB;AAC1C,WAAO,KAAK,6BAA6B,KAAK,CAAC,QAAQ,OAAO,GAAG,CAAC,KAAK,GAAG,CAAC;AAAA,EAC7E;AAAA,EAEA,yBAAyB,KAAyB;AAChD,WAAO,KAAK,6BAA6B,KAAK,CAAC,QAAQ,OAAO,KAAK,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC;AAAA,EACvF;AAAA;AAAA,EAGA,gBAAgB,KAAyB;AACvC,UAAM,OAAO,KAAK,MAAM,IAAI,IAAI;AAEhC,QAAI,IAAI,UAAU;AAChB,aAAO;AAAA,QACL,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,OAAO,KAAK,MAAM,IAAI,QAAQ;AAAA,MAChC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,gBAAgB,KAAyB;AACvC,QAAI,IAAI,OAAO,IAAI,QAAQ;AACzB,aAAO,EAAE,MAAM,WAAW,IAAI,OAAO,SAAS,KAAK,MAAM,IAAI,OAAO,EAAE;AAAA,IACxE;AACA,QAAI,IAAI,OAAO;AACb,aAAO,EAAE,MAAM,WAAW,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,OAAO,EAAE;AAAA,IACtE;AACA,WAAO,KAAK,MAAM,IAAI,iBAAiB;AAAA,EACzC;AAAA,EAEA,kBAAkB,KAAyB;AACzC,QAAI,SAAS,KAAK,MAAM,IAAI,iBAAiB;AAQ7C,UAAM,MAAmB,CAAC;AAE1B,QAAI,IAAI,KAAK;AACX,eAAS,IAAI,GAAG,IAAI,IAAI,IAAI,QAAQ,KAAK;AACvC,YAAI,KAAK,EAAE,MAAM,UAAU,QAAQ,IAAI,IAAI,CAAC,EAAE,aAAa,KAAK,EAAE,CAAC;AAAA,MACrE;AAAA,IACF;AAEA,QAAI,IAAI,UAAU;AAChB,eAAS,IAAI,GAAG,IAAI,IAAI,SAAS,QAAQ,KAAK;AAC5C,YAAI,KAAK,EAAE,MAAM,SAAS,QAAQ,IAAI,SAAS,CAAC,EAAE,aAAa,KAAK,EAAE,CAAC;AAAA,MACzE;AAAA,IACF;AAEA,QAAI,IAAI,QAAQ;AACd,eAAS,IAAI,GAAG,IAAI,IAAI,OAAO,QAAQ,KAAK;AAC1C,YAAI,KAAK,EAAE,MAAM,QAAQ,QAAQ,IAAI,OAAO,CAAC,EAAE,aAAa,KAAK,EAAE,CAAC;AAAA,MACtE;AAAA,IACF;AAOA,QAAI,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAGtC,eAAW,MAAM,KAAK;AACpB,UAAI,GAAG,SAAS,UAAU;AACxB,cAAM,OAAO,IAAI,SAAS,GAAG,GAAG,EAAE;AAClC,iBAAS,EAAE,MAAM,gBAAgB,QAAQ,QAAQ,UAAU,KAAK;AAAA,MAClE,WAAW,GAAG,SAAS,SAAS;AAC9B,cAAM,YAAY,IAAI,MAAM,GAAG,GAAG;AAClC,iBAAS,EAAE,MAAM,eAAe,QAAQ,QAAQ,OAAO,KAAK,MAAM,SAAS,EAAE;AAAA,MAC/E,WAAW,GAAG,SAAS,QAAQ;AAE7B,cAAM,OACJ,IAAI,gBAAgB,IAAI,aAAa,GAAG,GAAG,IAAI,KAAK,MAAM,IAAI,aAAa,GAAG,GAAG,CAAC,IAAI,CAAC;AACzF,iBAAS,EAAE,MAAM,gBAAgB,QAAQ,QAAQ,KAAK;AAAA,MACxD;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,KAAyB;AACzC,QAAI,IAAI,eAAe;AACrB,YAAM,MAAM,IAAI,cAAc,CAAC,EAAE,MAAM,QAAQ,MAAM,EAAE;AACvD,aAAO,EAAE,MAAM,iBAAiB,OAAO,WAAW,GAAG,EAAE;AAAA,IACzD;AACA,QAAI,IAAI,eAAe;AACrB,YAAM,MAAM,IAAI,cAAc,CAAC,EAAE;AACjC,YAAM,QAAQ,KAAK,eAAe,IAAI,MAAM,GAAG,EAAE,CAAC;AAClD,aAAO,EAAE,MAAM,iBAAiB,MAAM;AAAA,IACxC;AACA,QAAI,IAAI,MAAM;AACZ,aAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK;AAAA,IAC/C;AACA,QAAI,IAAI,OAAO;AACb,aAAO,EAAE,MAAM,kBAAkB,OAAO,MAAM;AAAA,IAChD;AACA,QAAI,IAAI,MAAM;AACZ,aAAO,EAAE,MAAM,cAAc;AAAA,IAC/B;AACA,QAAI,IAAI,MAAM;AACZ,aAAO,EAAE,MAAM,UAAU;AAAA,IAC3B;AACA,QAAI,IAAI,QAAQ;AACd,aAAO,EAAE,MAAM,YAAY;AAAA,IAC7B;AACA,QAAI,IAAI,YAAY;AAClB,aAAO,EAAE,MAAM,cAAc,MAAM,IAAI,WAAW,CAAC,EAAE,MAAM;AAAA,IAC7D;AACA,QAAI,IAAI,wBAAwB;AAC9B,aAAO,KAAK,MAAM,IAAI,sBAAsB;AAAA,IAC9C;AACA,QAAI,IAAI,yBAAyB;AAC/B,aAAO,KAAK,MAAM,IAAI,uBAAuB;AAAA,IAC/C;AACA,QAAI,IAAI,YAAY;AAClB,aAAO,KAAK,MAAM,IAAI,UAAU;AAAA,IAClC;AACA,QAAI,IAAI,oBAAoB;AAC1B,aAAO,KAAK,MAAM,IAAI,kBAAkB;AAAA,IAC1C;AACA,QAAI,IAAI,iBAAiB;AACvB,aAAO,KAAK,MAAM,IAAI,eAAe;AAAA,IACvC;AAEA,UAAM,IAAI,MAAM,4BAA4B;AAAA,EAC9C;AAAA,EAEA,mBAAmB,KAAoB;AACrC,UAAM,eAAe,IAAI,aAAa,CAAC;AACvC,UAAM,aAAa,IAAI,WAAW,CAAC;AAEnC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,KAAK,MAAM,IAAI,KAAK;AAAA,MAC3B,KAAK,KAAK,MAAM,IAAI,GAAG;AAAA,MACvB,gBAAgB,aAAa,UAAU,SAAS;AAAA,MAChD,cAAc,WAAW,UAAU,SAAS;AAAA,IAC9C;AAAA,EACF;AAAA,EAEA,uBAAuB,KAAwB;AAC7C,QAAI,CAAC,IAAI,cAAc;AACrB,aAAO,EAAE,MAAM,gBAAgB,UAAU,CAAC,EAAE;AAAA,IAC9C;AACA,UAAM,OAAO,KAAK,MAAM,IAAI,YAAY;AACxC,WAAO,EAAE,MAAM,gBAAgB,UAAU,KAAwB;AAAA,EACnE;AAAA,EAEA,wBAAwB,KAAyB;AAC/C,QAAI,CAAC,IAAI,oBAAoB;AAC3B,aAAO,EAAE,MAAM,iBAAiB,YAAY,CAAC,EAAE;AAAA,IACjD;AACA,UAAM,QAAQ,KAAK,MAAM,IAAI,kBAAkB;AAC/C,WAAO;AAAA,MACL,MAAM;AAAA,MACN,YAAY;AAAA,IACd;AAAA,EACF;AAAA,EAEA,mBAAmB,KAAwD;AACzE,WAAO,IAAI,KAAK;AAAA,MACd,CAAC,aAAsB,KAAK,MAAM,QAAQ;AAAA,IAC5C;AAAA,EACF;AAAA,EAEA,eAAe,KAAiD;AAC9D,UAAM,WAAW,IAAI,IAAI,CAAC;AAC1B,UAAM,MACJ,SAAS,UAAU,SAAS,kBACxB,KAAK,eAAe,SAAS,MAAM,MAAM,GAAG,EAAE,CAAC,IAC/C,SAAS;AACf,UAAM,QAAQ,KAAK,MAAM,IAAI,KAAK;AAClC,WAAO,EAAE,KAAK,MAAM;AAAA,EACtB;AAAA,EAEA,gBAAgB,KAA2C;AAEzD,QAAI,IAAI,eAAe;AACrB,YAAM,MAAM,IAAI,cAAc,CAAC,EAAE;AACjC,aAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,eAAe,IAAI,MAAM,GAAG,EAAE,CAAC,EAAE;AAAA,IAC/E;AAGA,UAAM,QAA2D,CAAC;AAGlE,UAAM,UAAU,IAAI,aAAa,CAAC,EAAE;AACpC,UAAM,WAAW,KAAK,eAAe,QAAQ,MAAM,GAAG,EAAE,CAAC;AACzD,QAAI,UAAU;AACZ,YAAM,KAAK,EAAE,MAAM,SAAS,CAAC;AAAA,IAC/B;AAGA,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,QAAQ,KAAK;AACxC,YAAM,KAAK,EAAE,MAAM,KAAK,MAAM,IAAI,KAAK,CAAC,CAAC,EAAmB,CAAC;AAE7D,UAAI,IAAI,kBAAkB,IAAI,eAAe,CAAC,GAAG;AAC/C,cAAM,SAAS,IAAI,eAAe,CAAC,EAAE;AACrC,cAAM,UAAU,KAAK,eAAe,OAAO,MAAM,GAAG,EAAE,CAAC;AACvD,YAAI,SAAS;AACX,gBAAM,KAAK,EAAE,MAAM,QAAQ,CAAC;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAGA,UAAM,UAAU,IAAI,aAAa,CAAC,EAAE;AACpC,UAAM,WAAW,KAAK,eAAe,QAAQ,MAAM,GAAG,EAAE,CAAC;AACzD,QAAI,UAAU;AACZ,YAAM,KAAK,EAAE,MAAM,SAAS,CAAC;AAAA,IAC/B;AAIA,QAAI,MAAM,MAAM,CAAC,MAAM,UAAU,CAAC,GAAG;AACnC,YAAM,WAAW,MAAM,IAAI,CAAC,MAAO,EAAuB,IAAI,EAAE,KAAK,EAAE;AACvE,aAAO,EAAE,MAAM,iBAAiB,OAAO,SAAS;AAAA,IAClD;AAEA,WAAO,EAAE,MAAM,mBAAmB,MAAM;AAAA,EAC1C;AAAA,EAEA,aAAa,KAA2B;AACtC,WAAO,IAAI,IAAI,IAAI,CAAC,YAAqB,KAAK,MAAM,OAAO,CAAkB;AAAA,EAC/E;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAAe,GAAmB;AACxC,WAAO,EACJ,QAAQ,QAAQ,IAAI,EACpB,QAAQ,QAAQ,GAAI,EACpB,QAAQ,QAAQ,IAAI,EACpB,QAAQ,QAAQ,GAAG,EACnB,QAAQ,MAAM,GAAG,EACjB,QAAQ,SAAS,IAAI;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,6BACN,KACA,YACA,KACe;AACf,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE/B,QAAI,CAAC,IAAI,KAAK;AAEZ,aAAO;AAAA,IACT;AAGA,UAAM,iBAAgE,CAAC;AACvE,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,YAAM,SAAS,IAAI,WAAW,CAAC,CAAC;AAChC,UAAI,QAAQ;AACV,mBAAW,SAAS,QAAQ;AAC1B,yBAAe,KAAK,EAAE,IAAI,IAAI,CAAC,GAAG,QAAQ,MAAM,YAAY,CAAC;AAAA,QAC/D;AAAA,MACF;AAAA,IACF;AAGA,mBAAe,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAGjD,aAAS,IAAI,GAAG,IAAI,IAAI,IAAI,QAAQ,KAAK;AACvC,YAAM,KAAK,eAAe,CAAC,GAAG;AAC9B,UAAI,CAAC,IAAI;AACP,cAAM,IAAI,MAAM,0BAA0B,WAAW,KAAK,IAAI,CAAC,EAAE;AAAA,MACnE;AAEA,eAAS;AAAA,QACP,MAAM;AAAA,QACN;AAAA,QACA,MAAM;AAAA,QACN,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,MAC9B;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAEO,IAAM,aAAa,IAAI,qBAAqB;AAS5C,SAAS,SAAS,KAA6B;AACpD,SAAO,WAAW,MAAM,GAAG;AAC7B;;;AC9YO,SAAS,iCAAiC,KAAmC;AAClF,MAAI,IAAI,SAAS,cAAc;AAC7B,WAAO,EAAE,MAAM,iBAAiB,OAAQ,IAA6C,KAAK;AAAA,EAC5F;AACA,SAAO;AACT;AAYO,SAAS,yBAAyB,KAAoB,IAA8B;AACzF,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,MAAM,EAAE,MAAM,YAAY;AAAA,IAC1B,OAAO;AAAA,EACT;AACF;AAaO,SAAS,yBAAyB,KAAoB,IAA2B;AACtF,QAAM,QAAQ,iCAAiC,GAAG;AAClD,SAAO,yBAAyB,OAAO,EAAE;AAC3C;AAUO,SAAS,oBAAoB,aAAsC;AACxE,SAAO,yBAAyB,aAAa,IAAI;AACnD;AAWO,SAAS,2BAA2B,UAAmC;AAC5E,SAAO,yBAAyB,UAAU,IAAI;AAChD;AAWO,SAAS,cAAc,OAAuC;AACnE,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK;AAAA,EAC/C;AACA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,SAAO,MAAM,OAAO,CAAC,KAAK,UAAU;AAAA,IAClC,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,MAAM;AAAA,IACN,OAAO;AAAA,EACT,EAAE;AACJ;AAUO,SAAS,eAAe,OAAuC;AACpE,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK;AAAA,EAC/C;AACA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,SAAO,MAAM,OAAO,CAAC,KAAK,UAAU;AAAA,IAClC,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,MAAM;AAAA,IACN,OAAO;AAAA,EACT,EAAE;AACJ;;;ACvGO,SAAS,qBAAqB,OAA8B;AACjE,QAAM,UAAU,MAAM,KAAK;AAG3B,MAAI,YAAY,MAAM,YAAY,KAAK;AACrC,WAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK;AAAA,EAC/C;AAGA,MAAI,QAAQ,SAAS,GAAG,GAAG;AACzB,WAAO,wBAAwB,OAAO;AAAA,EACxC;AAIA,MAAI,QAAQ,SAAS,GAAG,KAAK,CAAC,eAAe,OAAO,GAAG;AACrD,UAAM,QAAQ,aAAa,OAAO;AAClC,UAAM,cAAc,MAAM,IAAI,CAAC,SAAS,mBAAmB,KAAK,KAAK,CAAC,CAAC;AACvE,WAAO,cAAc,WAAW;AAAA,EAClC;AAIA,QAAM,iBAAiB,mBAAmB,OAAO;AACjD,MAAI,gBAAgB;AAClB,WAAO;AAAA,EACT;AAEA,SAAO,mBAAmB,OAAO;AACnC;AAYA,SAAS,mBAAmB,OAA8B;AAExD,QAAM,kBAAkB,MAAM,MAAM,4BAA4B;AAChE,MAAI,iBAAiB;AACnB,UAAM,CAAC,EAAE,IAAI,SAAS,IAAI;AAC1B,UAAMC,SAAQ,wBAAwB,SAAS;AAE/C,QAAI,OAAO,QAAQ,OAAO,MAAM;AAC9B,aAAO,yBAAyBA,QAAO,EAAiB;AAAA,IAC1D;AACA,WAAO,yBAAyBA,QAAO,EAAoB;AAAA,EAC7D;AAGA,MAAI,MAAM,MAAM,oBAAoB,GAAG;AACrC,UAAM,cAAc,wBAAwB,KAAK;AACjD,WAAO,oBAAoB,WAAW;AAAA,EACxC;AAIA,MAAI,eAAe,KAAK,GAAG;AACzB,UAAM,WAAW,wBAAwB,KAAK;AAC9C,WAAO,2BAA2B,QAAQ;AAAA,EAC5C;AAIA,QAAM,QAAQ,wBAAwB,KAAK;AAC3C,SAAO,yBAAyB,OAAO,IAAI;AAC7C;AAWA,SAAS,mBAAmB,OAAqC;AAG/D,QAAM,WAAW,iBAAiB,OAAO,KAAK;AAC9C,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,cAAc,SAAS,IAAI,CAAC,SAAS,mBAAmB,KAAK,KAAK,CAAC,CAAC;AAC1E,WAAO,eAAe,WAAW;AAAA,EACnC;AAEA,QAAM,UAAU,iBAAiB,OAAO,IAAI;AAC5C,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,cAAc,QAAQ,IAAI,CAAC,SAAS,mBAAmB,KAAK,KAAK,CAAC,CAAC;AACzE,WAAO,cAAc,WAAW;AAAA,EAClC;AAEA,SAAO;AACT;AAOA,SAAS,iBAAiB,OAAe,IAA4B;AACnE,QAAM,UAAU,IAAI,EAAE;AACtB,QAAM,QAAkB,CAAC;AACzB,MAAIC,WAAU;AACd,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,aAAa;AACjB,MAAI,IAAI;AAER,SAAO,IAAI,MAAM,QAAQ;AACvB,UAAM,OAAO,MAAM,CAAC;AAEpB,QAAI,UAAU;AACZ,MAAAA,YAAW;AACX,UAAI,SAAS,cAAc,MAAM,IAAI,CAAC,MAAM,MAAM;AAChD,mBAAW;AAAA,MACb;AACA;AACA;AAAA,IACF;AAEA,QAAI,SAAS,OAAO,SAAS,KAAK;AAChC,iBAAW;AACX,mBAAa;AACb,MAAAA,YAAW;AACX;AAAA,IACF,WAAW,SAAS,OAAO,SAAS,OAAO,SAAS,KAAK;AACvD;AACA,MAAAA,YAAW;AACX;AAAA,IACF,WAAW,SAAS,OAAO,SAAS,OAAO,SAAS,KAAK;AACvD;AACA,MAAAA,YAAW;AACX;AAAA,IACF,WAAW,UAAU,KAAK,MAAM,UAAU,GAAG,IAAI,QAAQ,MAAM,EAAE,YAAY,MAAM,SAAS;AAC1F,YAAM,KAAKA,QAAO;AAClB,MAAAA,WAAU;AACV,WAAK,QAAQ;AAAA,IACf,OAAO;AACL,MAAAA,YAAW;AACX;AAAA,IACF;AAAA,EACF;AAEA,MAAIA,UAAS;AACX,UAAM,KAAKA,QAAO;AAAA,EACpB;AACA,SAAO;AACT;AASA,SAAS,eAAe,OAAwB;AAC9C,SAAO,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI;AAC7E;AAaA,SAAS,aAAa,OAAyB;AAC7C,QAAM,QAAkB,CAAC;AACzB,MAAIA,WAAU;AACd,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,aAAa;AAEjB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,OAAO,MAAM,CAAC;AAEpB,QAAI,UAAU;AACZ,MAAAA,YAAW;AAEX,UAAI,SAAS,cAAc,MAAM,IAAI,CAAC,MAAM,MAAM;AAChD,mBAAW;AAAA,MACb;AACA;AAAA,IACF;AAEA,QAAI,SAAS,OAAO,SAAS,KAAK;AAChC,iBAAW;AACX,mBAAa;AACb,MAAAA,YAAW;AAAA,IACb,WAAW,SAAS,OAAO,SAAS,KAAK;AACvC;AACA,MAAAA,YAAW;AAAA,IACb,WAAW,SAAS,OAAO,SAAS,KAAK;AACvC;AACA,MAAAA,YAAW;AAAA,IACb,WAAW,SAAS,OAAO,UAAU,GAAG;AACtC,YAAM,KAAKA,QAAO;AAClB,MAAAA,WAAU;AAAA,IACZ,OAAO;AACL,MAAAA,YAAW;AAAA,IACb;AAAA,EACF;AAEA,MAAIA,UAAS;AACX,UAAM,KAAKA,QAAO;AAAA,EACpB;AACA,SAAO;AACT;AAaO,SAAS,wBAAwB,OAAe,UAA0C;AAC/F,QAAM,eAAe,MAAM,SAAS,KAAK;AAEzC,MAAI,aAAa,OAAO,SAAS,GAAG;AAClC,UAAM,IAAI;AAAA,MACR,gBAAgB,aAAa,OAAO,IAAI,CAAC,MAAW,EAAE,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA,MAEzE;AAAA,MACA,EAAE,YAAY,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,SAAO,QAAQ,aAAa;AAC5B,QAAM,MAAM,OAAO,WAAW;AAE9B,MAAI,OAAO,OAAO,SAAS,GAAG;AAC5B,UAAM,IAAI;AAAA,MACR,gBAAgB,OAAO,OAAO,IAAI,CAAC,MAAW,EAAE,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA,MAEnE;AAAA,MACA,EAAE,YAAY,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,SAAO,SAAS,GAAG;AACrB;;;AC5OO,IAAM,YAAgC;AAAA,EAC3C,EAAE,MAAM,oBAAoB,KAAK,gBAAgB;AAAA,EACjD,EAAE,MAAM,yBAAyB,KAAK,oBAAoB;AAAA,EAC1D,EAAE,MAAM,uBAAuB,KAAK,mBAAmB;AAAA,EACvD,EAAE,MAAM,kBAAkB,KAAK,cAAc;AAC/C;AAQO,SAAS,iBAAiB,KAA+B;AAC9D,MAAI,YAAY;AAEhB,aAAW,QAAQ,WAAW;AAC5B,gBAAY,KAAK,IAAI,SAAS;AAAA,EAChC;AAEA,SAAO;AACT;AASA,SAAS,mBAAmB,MAAgC;AAC1D,MAAI,CAAC,KAAK,eAAe;AACvB,SAAK,gBAAgB,CAAC;AAAA,EACxB;AACA,MAAI,CAAC,KAAK,cAAc,cAAc;AACpC,SAAK,cAAc,eAAe,oBAAI,IAA2B;AAAA,EACnE;AACA,SAAO,KAAK,cAAc;AAC5B;AAMA,SAAS,iBAAiB,MAAe,MAA6B;AACpE,QAAM,QAAQ,mBAAmB,IAAI;AACrC,QAAM,SAAS,MAAM,IAAI,IAAI;AAC7B,MAAI,QAAQ;AACV,WAAO;AAAA,EACT;AACA,QAAM,SAAS,qBAAqB,IAAI;AACxC,QAAM,IAAI,MAAM,MAAM;AACtB,SAAO;AACT;AAMA,SAAS,oBAAoB,MAAe,MAA6B;AACvE,QAAM,QAAQ,mBAAmB,IAAI;AACrC,QAAM,SAAS,MAAM,IAAI,IAAI;AAC7B,MAAI,QAAQ;AACV,WAAO;AAAA,EACT;AACA,QAAM,SAAS,wBAAwB,IAAI;AAC3C,QAAM,IAAI,MAAM,MAAM;AACtB,SAAO;AACT;AAMA,SAAS,qBAAqB,MAAqB;AACjD,MAAI,KAAK,iBAAiB,KAAK,cAAc,cAAc;AACzD,SAAK,cAAc,aAAa,MAAM;AAAA,EACxC;AACF;AAwBA,SAAS,gBAAgB,KAA+B;AAEtD,QAAM,YAAY,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAGhD,YAAU,QAAQ,UAAU,MAAM,IAAI,CAAC,SAAkB,oBAAoB,IAAI,CAAC;AAElF,SAAO;AACT;AAKA,SAAS,oBAAoB,MAAwB;AACnD,MAAI,CAAC,KAAK,SAAS;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK;AAGrB,MAAI,KAAK,mDAAkC;AACzC,WAAO,6BAA6B,MAAM,OAAO;AAAA,EACnD;AAGA,MAAI,KAAK,oCAA0B;AACjC,WAAO,sBAAsB,MAAM,OAAO;AAAA,EAC5C;AAGA,MAAI,KAAK,4CAA8B;AACrC,WAAO,mBAAmB,MAAM,OAAO;AAAA,EACzC;AAEA,SAAO;AACT;AAKA,SAAS,6BAA6B,MAAe,SAA2C;AAC9F,QAAM,EAAE,OAAO,OAAO,IAAI;AAC1B,MAAI,WAAW;AAGf,QAAM,cAAc,MAAM,IAAI,CAAC,SAAkC;AAC/D,UAAM,aAAa,EAAE,GAAG,KAAK;AAE7B,eAAW,SAAS,QAAQ;AAC1B,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC;AAAA,MACF;AAGA,UAAI;AACF,cAAM,MAAM,iBAAiB,MAAM,IAAI;AACvC,cAAM,SAAS,eAAe,GAAG;AAGjC,YAAI,WAAW,QAAQ,UAAU,MAAM,GAAG;AACxC,gBAAM,UAAU,oBAAoB,MAAM;AAC1C,cAAI,YAAY,MAAM;AACpB,uBAAW,MAAM,EAAE,IAAI;AACvB,uBAAW;AAAA,UACb;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAGD,MAAI,UAAU;AACZ,yBAAqB,IAAI;AAAA,EAC3B;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAKA,SAAS,sBAAsB,MAAe,SAAuB;AACnE,QAAM,EAAE,WAAW,IAAI;AACvB,MAAI,WAAW;AAEf,QAAM,mBAAmB,WAAW,IAAI,CAAC,cAAmB;AAC1D,UAAM,OAAO,UAAU;AACvB,QAAI,CAAC,QAAQ,SAAS,IAAI;AACxB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,MAAM,oBAAoB,MAAM,IAAI;AAC1C,YAAM,SAAS,eAAe,GAAG;AAEjC,UAAI,WAAW,QAAQ,UAAU,MAAM,GAAG;AACxC,cAAM,UAAU,oBAAoB,MAAM;AAC1C,YAAI,YAAY,MAAM;AACpB,qBAAW;AACX,iBAAO;AAAA,YACL,GAAG;AAAA,YACH,YAAY;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,WAAO;AAAA,EACT,CAAC;AAGD,MAAI,UAAU;AACZ,yBAAqB,IAAI;AAAA,EAC3B;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,YAAY;AAAA,IACd;AAAA,EACF;AACF;AAKA,SAAS,mBAAmB,MAAe,SAAuB;AAChE,QAAM,OAAO,QAAQ;AACrB,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,MAAM,oBAAoB,MAAM,IAAI;AAC1C,UAAM,SAAS,eAAe,GAAG;AAEjC,QAAI,WAAW,QAAQ,UAAU,MAAM,GAAG;AACxC,YAAM,UAAU,oBAAoB,MAAM;AAC1C,UAAI,YAAY,MAAM;AAEpB,6BAAqB,IAAI;AACzB,eAAO;AAAA,UACL,GAAG;AAAA,UACH,SAAS;AAAA,YACP,GAAG;AAAA,YACH,YAAY;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AAEA,SAAO;AACT;AAMA,SAAS,eAAe,MAA2C;AACjE,MAAI,cAAc,IAAI,GAAG;AACvB,WAAO;AAAA,EACT;AAEA,MAAI,WAAW,IAAI,GAAG;AACpB,UAAM,aAAa,eAAe,KAAK,IAAI;AAC3C,UAAM,cAAc,eAAe,KAAK,KAAK;AAG7C,QAAI,cAAc,eAAe,UAAU,UAAU,KAAK,UAAU,WAAW,GAAG;AAChF,YAAM,SAAS,yBAAyB,KAAK,IAAI,YAAY,WAAW;AACxE,UAAI,WAAW,MAAM;AACnB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,MAAM,cAAc,KAAK;AAAA,MACzB,OAAO,eAAe,KAAK;AAAA,IAC7B;AAAA,EACF;AAEA,MAAI,UAAU,IAAI,GAAG;AACnB,UAAM,gBAAgB,eAAe,KAAK,OAAO;AAEjD,QAAI,iBAAiB,UAAU,aAAa,GAAG;AAC7C,YAAM,SAAS,wBAAwB,KAAK,IAAI,aAAa;AAC7D,UAAI,WAAW,MAAM;AACnB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,SAAS,iBAAiB,KAAK;AAAA,IACjC;AAAA,EACF;AAEA,MAAI,YAAY,IAAI,GAAG;AACrB,UAAM,kBAAkB,eAAe,KAAK,SAAS;AACrD,UAAM,mBAAmB,eAAe,KAAK,UAAU;AACvD,UAAM,kBAAkB,eAAe,KAAK,SAAS;AAErD,QAAI,mBAAmB,UAAU,eAAe,KAAK,iBAAiB,eAAe,GAAG;AACtF,aAAO,gBAAgB,QACnB,oBAAoB,KAAK,aACzB,mBAAmB,KAAK;AAAA,IAC9B;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,WAAW,mBAAmB,KAAK;AAAA,MACnC,YAAY,oBAAoB,KAAK;AAAA,MACrC,WAAW,mBAAmB,KAAK;AAAA,IACrC;AAAA,EACF;AAGA,SAAO;AACT;AAKA,SAAS,cAAc,MAA8B;AACnD,SACE,gBAAgB,IAAI,KAAK,gBAAgB,IAAI,KAAK,iBAAiB,IAAI,KAAK,cAAc,IAAI;AAElG;AAKA,SAAS,UACP,MACwD;AACxD,SAAO,SAAS,QAAQ,cAAc,IAAI;AAC5C;AAKA,SAAS,yBACP,IACA,MACA,OACsB;AAEtB,MAAI,gBAAgB,IAAI,KAAK,gBAAgB,KAAK,GAAG;AACnD,YAAQ,IAAI;AAAA,MACV,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,IAAI,KAAK,OAAO,MAAM,KAAK,EAAE;AAAA,MAC3E,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MACnE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MACnE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,MAAM;AAAA,MACpE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,MAAM;AAAA,MACpE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,MACrE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,IACvE;AAAA,EACF;AAGA,MAAI,gBAAgB,IAAI,KAAK,gBAAgB,KAAK,GAAG;AACnD,YAAQ,IAAI;AAAA,MACV,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,MACrE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,IACvE;AAAA,EACF;AAGA,MAAI,iBAAiB,IAAI,KAAK,iBAAiB,KAAK,GAAG;AACrD,YAAQ,IAAI;AAAA,MACV,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,MAAM;AAAA,MACpE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,MAAM;AAAA,MACpE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,MACrE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,IACvE;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,wBACP,IACA,SACsB;AACtB,MAAI,OAAO,SAAS,iBAAiB,OAAO,GAAG;AAC7C,WAAO,EAAE,MAAM,kBAAkB,OAAO,CAAC,QAAQ,MAAM;AAAA,EACzD;AAEA,MAAI,OAAO,OAAO,gBAAgB,OAAO,GAAG;AAC1C,WAAO,EAAE,MAAM,iBAAiB,OAAO,CAAC,QAAQ,MAAM;AAAA,EACxD;AAEA,SAAO;AACT;AAKA,SAAS,oBAAoB,MAA8D;AACzF,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,OAAO,KAAK,KAAK;AAAA,IAC1B,KAAK;AACH,aAAO,IAAI,KAAK,KAAK;AAAA,IACvB,KAAK;AACH,aAAO,OAAO,KAAK,KAAK;AAAA,EAC5B;AACF;AAkBA,SAAS,oBAAoB,KAA+B;AAC1D,QAAM,YAAY,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAEhD,YAAU,QAAQ,UAAU,MAAM,IAAI,CAAC,SAAkB,wBAAwB,IAAI,CAAC;AAEtF,SAAO;AACT;AAKA,SAAS,wBAAwB,MAAwB;AACvD,MAAI,CAAC,KAAK,SAAS;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK;AAErB,MAAI,KAAK,mDAAkC;AACzC,WAAO,iCAAiC,MAAM,OAAO;AAAA,EACvD;AAEA,MAAI,KAAK,oCAA0B;AACjC,WAAO,0BAA0B,MAAM,OAAO;AAAA,EAChD;AAEA,SAAO;AACT;AAMA,SAAS,mBAAmB,MAA8B;AACxD,MAAI,WAAW,IAAI,KAAK,KAAK,OAAO,MAAM;AACxC,UAAM,eAAe,KAAK,KAAK,SAAS;AACxC,UAAM,eAAe,iBAAiB,KAAK,KAAK,KAAK,CAAC,KAAK,MAAM;AACjE,WAAO,gBAAgB;AAAA,EACzB;AAEA,MAAI,WAAW,IAAI,KAAK,KAAK,OAAO,MAAM;AACxC,UAAM,eAAe,KAAK,KAAK,SAAS;AACxC,UAAM,cAAc,iBAAiB,KAAK,KAAK,KAAK,KAAK,MAAM;AAC/D,WAAO,gBAAgB;AAAA,EACzB;AAEA,SAAO;AACT;AAKA,SAAS,0BAA0B,MAAe,SAAuB;AACvE,QAAM,EAAE,WAAW,IAAI;AAGvB,QAAM,iBAAiB,WAAW,OAAO,CAAC,cAAmB;AAC3D,UAAM,OAAO,UAAU;AACvB,QAAI,CAAC,QAAQ,SAAS,IAAI;AACxB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,SAAS,oBAAoB,MAAM,IAAI;AAE7C,UAAI,iBAAiB,MAAM,KAAK,CAAC,OAAO,OAAO;AAC7C,eAAO;AAAA,MACT;AAAA,IACF,QAAQ;AAAA,IAAC;AAET,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,YAAY;AAAA,IACd;AAAA,EACF;AACF;AAKA,SAAS,iCAAiC,MAAe,SAAuB;AAC9E,QAAM,EAAE,OAAO,OAAO,IAAI;AAG1B,QAAM,YAAY,MAAM,OAAO,CAAC,SAAc;AAC5C,eAAW,SAAS,QAAQ;AAC1B,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC;AAAA,MACF;AAEA,UAAI;AACF,cAAM,SAAS,iBAAiB,MAAM,IAAI;AAG1C,YAAI,iBAAiB,MAAM,KAAK,CAAC,OAAO,OAAO;AAC7C,iBAAO;AAAA,QACT;AAIA,YAAI,mBAAmB,MAAM,GAAG;AAC9B,iBAAO;AAAA,QACT;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAiBA,SAAS,mBAAmB,KAA+B;AAEzD,QAAM,YAAY,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAKhD,YAAU,QAAQ,UAAU,MAAM,IAAI,CAAC,SAAkB,wBAAwB,IAAI,CAAC;AAEtF,SAAO;AACT;AAKA,SAAS,wBAAwB,MAAwB;AACvD,MAAI,CAAC,KAAK,SAAS;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK;AAGrB,MAAI,KAAK,qDAAoC,WAAW,QAAQ,SAAS,QAAQ,QAAQ;AACvF,WAAO,+BAA+B,MAAM,OAAO;AAAA,EACrD;AAEA,SAAO;AACT;AAKA,SAAS,+BAA+B,MAAe,SAAuB;AAC5E,QAAM,EAAE,OAAO,OAAO,IAAI;AAE1B,QAAM,eAAe,MAAM,IAAI,CAAC,SAAc;AAC5C,UAAM,cAAc,EAAE,GAAG,KAAK;AAE9B,eAAW,SAAS,QAAQ;AAC1B,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC;AAAA,MACF;AAEA,YAAM,UAAU,oBAAoB,IAAI;AACxC,UAAI,YAAY,MAAM;AACpB,oBAAY,MAAM,EAAE,IAAI;AAAA,MAC1B;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAMA,SAAS,oBAAoB,MAAsB;AACjD,QAAM,UAAU,KAAK,KAAK;AAM1B,QAAM,WAAW,QAAQ,MAAM,gBAAgB;AAC/C,MAAI,UAAU;AACZ,UAAM,OAAO,SAAS,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAAC,MAAc,EAAE,KAAK,CAAC;AAC/D,QAAI,KAAK,MAAM,CAAC,QAAgB,gBAAgB,KAAK,GAAG,CAAC,GAAG;AAC1D,YAAM,MAAM,KAAK,OAAO,CAAC,KAAa,QAAgB,MAAM,WAAW,GAAG,GAAG,CAAC;AAC9E,aAAO,OAAO,GAAG;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,MAAM,qBAAqB;AACpD,MAAI,UAAU;AACZ,UAAM,CAAC,GAAG,MAAM,IAAI,IAAI;AACxB,UAAM,OAAO,WAAW,KAAK,KAAK,CAAC;AACnC,UAAM,OAAO,WAAW,KAAK,KAAK,CAAC;AACnC,QAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,GAAG;AAChC,aAAO,OAAO,KAAK,IAAI,MAAM,IAAI,CAAC;AAAA,IACpC;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,MAAM,qBAAqB;AACpD,MAAI,UAAU;AACZ,UAAM,CAAC,GAAG,MAAM,IAAI,IAAI;AACxB,UAAM,OAAO,WAAW,KAAK,KAAK,CAAC;AACnC,UAAM,OAAO,WAAW,KAAK,KAAK,CAAC;AACnC,QAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,GAAG;AAChC,aAAO,OAAO,KAAK,IAAI,MAAM,IAAI,CAAC;AAAA,IACpC;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,MAAM,gBAAgB;AAC/C,MAAI,UAAU;AACZ,UAAM,MAAM,WAAW,SAAS,CAAC,EAAE,KAAK,CAAC;AACzC,QAAI,CAAC,MAAM,GAAG,GAAG;AACf,aAAO,OAAO,KAAK,IAAI,GAAG,CAAC;AAAA,IAC7B;AAAA,EACF;AAGA,QAAM,aAAa,QAAQ,MAAM,kBAAkB;AACnD,MAAI,YAAY;AACd,UAAM,MAAM,WAAW,WAAW,CAAC,EAAE,KAAK,CAAC;AAC3C,QAAI,CAAC,MAAM,GAAG,GAAG;AACf,aAAO,OAAO,KAAK,MAAM,GAAG,CAAC;AAAA,IAC/B;AAAA,EACF;AAGA,QAAM,YAAY,QAAQ,MAAM,iBAAiB;AACjD,MAAI,WAAW;AACb,UAAM,MAAM,WAAW,UAAU,CAAC,EAAE,KAAK,CAAC;AAC1C,QAAI,CAAC,MAAM,GAAG,GAAG;AACf,aAAO,OAAO,KAAK,KAAK,GAAG,CAAC;AAAA,IAC9B;AAAA,EACF;AAGA,QAAM,aAAa,QAAQ,MAAM,kBAAkB;AACnD,MAAI,YAAY;AACd,UAAM,MAAM,WAAW,WAAW,CAAC,EAAE,KAAK,CAAC;AAC3C,QAAI,CAAC,MAAM,GAAG,GAAG;AACf,aAAO,OAAO,KAAK,MAAM,GAAG,CAAC;AAAA,IAC/B;AAAA,EACF;AAGA,QAAM,aAAa,QAAQ,MAAM,oBAAoB;AACrD,MAAI,YAAY;AACd,WAAO,IAAI,WAAW,CAAC,EAAE,YAAY,CAAC;AAAA,EACxC;AAGA,QAAM,aAAa,QAAQ,MAAM,oBAAoB;AACrD,MAAI,YAAY;AACd,WAAO,IAAI,WAAW,CAAC,EAAE,YAAY,CAAC;AAAA,EACxC;AAGA,QAAM,WAAW,QAAQ,MAAM,kBAAkB;AACjD,MAAI,UAAU;AACZ,WAAO,OAAO,SAAS,CAAC,EAAE,MAAM;AAAA,EAClC;AAGA,QAAM,cAAc,QAAQ,MAAM,uBAAuB;AACzD,MAAI,aAAa;AACf,UAAM,SAAS,QAAQ,MAAM,gBAAgB,EAAG,CAAC,EAAE,KAAK;AAExD,UAAM,aAAa,OAAO,QAAQ,MAAM,EAAE,EAAE,QAAQ,KAAK,EAAE,EAAE;AAC7D,WAAO,OAAO,UAAU;AAAA,EAC1B;AAEA,SAAO;AACT;AAsBA,SAAS,cAAc,KAA+B;AACpD,QAAM,YAAY,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAEhD,YAAU,QAAQ,UAAU,MAAM,IAAI,CAAC,SAAkB,iBAAiB,IAAI,CAAC;AAE/E,SAAO;AACT;AAKA,SAAS,iBAAiB,MAAwB;AAChD,MAAI,CAAC,KAAK,SAAS;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK;AAErB,MAAI,KAAK,mDAAkC;AACzC,WAAO,mBAAmB,MAAM,OAAO;AAAA,EACzC;AAEA,SAAO;AACT;AASA,SAAS,mBAAmB,MAAe,SAAuB;AAChE,QAAM,EAAE,OAAO,OAAO,IAAI;AAG1B,QAAM,gBAAgB,OAAO,IAAI,CAAC,UAAe;AAC/C,UAAM,cAAc,MAAM,IAAI,CAAC,SAAc;AAC3C,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC,eAAO;AAAA,MACT;AACA,aAAO,KAAK,KAAK;AAAA,IACnB,CAAC;AAMD,UAAM,cAAc,YAAY,MAAM,CAAC,QAAuB;AAC5D,UAAI,CAAC,KAAK;AACR,eAAO;AAAA,MACT;AACA,aAAO,6CAA6C,KAAK,GAAG;AAAA,IAC9D,CAAC;AAED,UAAM,eAAe,IAAI,IAAI,YAAY,OAAO,CAAC,MAAqB,MAAM,IAAI,CAAC;AACjF,UAAM,gBACJ,aAAa,OAAO,YAAY,OAAO,CAAC,MAAqB,MAAM,IAAI,EAAE;AAE3E,WAAO;AAAA,MACL,GAAG;AAAA;AAAA;AAAA;AAAA,MAIH,YAAY,eAAe,CAAC,iBAAiB,aAAa,OAAO,KAAK,aAAa,OAAO;AAAA,MAC1F,eAAe,MAAM,KAAK,YAAY;AAAA,IACxC;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,QAAQ;AAAA,IACV;AAAA,EACF;AACF;;;AC93BO,SAAS,sBACd,WACA,aACU;AACV,QAAM,SAAS,8BAA8B,WAAW,WAAW;AAEnE,SAAO,OAAO,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI;AACxC;AAcO,SAAS,8BACd,WACA,aACkB;AAClB,QAAM,SAA4B,CAAC;AAEnC,aAAW,SAAS,YAAY,QAAQ;AACtC,UAAMC,QAAO,MAAM;AACnB,UAAM,QAAQA,MAAK,MAAM,GAAG;AAE5B,QAAIC,WAAe;AACnB,QAAI,SAAS;AAGb,eAAW,QAAQ,OAAO;AACxB,UAAIA,aAAY,QAAQA,aAAY,UAAaA,SAAQ,IAAI,MAAM,QAAW;AAC5E,iBAAS;AACT;AAAA,MACF;AACA,MAAAA,WAAUA,SAAQ,IAAI;AAAA,IACxB;AAEA,QAAI,CAAC,QAAQ;AACX,aAAO,KAAK;AAAA,QACV,MAAAD;AAAA,QACA,SAAS;AAAA,QACT,UAAU,MAAM;AAAA,QAChB,QAAQ;AAAA,MACV,CAAC;AACD;AAAA,IACF;AAGA,UAAM,YAAY,kBAAkBC,UAAS,MAAM,MAAMD,KAAI;AAC7D,QAAI,WAAW;AACb,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,OAAO,OAAO,WAAW;AAAA,IACzB;AAAA,EACF;AACF;AAUA,SAAS,kBACP,OACA,cACAA,OACwB;AACxB,QAAM,aAAa,OAAO;AAE1B,UAAQ,cAAc;AAAA,IACpB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK,OAAO;AAEV,UAAI,eAAe,YAAY,eAAe,UAAU;AACtD,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS,YAAY,YAAY,kBAAkB,UAAU;AAAA,UAC7D,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AAGA,UAAI,eAAe,YAAY,OAAO,MAAM,KAAK,GAAG;AAClD,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS;AAAA,UACT,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AAGA,UAAI,iBAAiB,SAAS,iBAAiB,OAAO;AACpD,YAAI,eAAe,YAAY,CAAC,OAAO,UAAU,KAAK,GAAG;AACvD,iBAAO;AAAA,YACL,MAAAA;AAAA,YACA,SAAS;AAAA,YACT,UAAU;AAAA,YACV,QAAQ;AAAA,UACV;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ;AACX,UAAI,eAAe,WAAW;AAC5B,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS,yBAAyB,UAAU;AAAA,UAC5C,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,KAAK,UAAU;AACb,UAAI,eAAe,UAAU;AAC3B,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS,wBAAwB,UAAU;AAAA,UAC3C,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,KAAK,SAAS;AACZ,UAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS,uBAAuB,UAAU;AAAA,UAC1C,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,SAAS;AAGP;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAcO,SAAS,uBACd,YACA,cACU;AACV,QAAM,SAAS,+BAA+B,YAAY,YAAY;AACtE,SAAO,OAAO,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI;AACxC;AAaO,SAAS,+BACd,YACA,cACkB;AAClB,QAAM,SAA4B,CAAC;AAEnC,aAAW,SAAS,aAAa,QAAQ;AACvC,UAAMA,QAAO,MAAM;AACnB,UAAM,QAAQA,MAAK,MAAM,GAAG;AAI5B,QAAIC,WAAe;AACnB,QAAI,SAAS;AAEb,eAAW,QAAQ,OAAO;AACxB,UAAIA,aAAY,QAAQA,aAAY,UAAaA,SAAQ,IAAI,MAAM,QAAW;AAC5E,iBAAS;AACT;AAAA,MACF;AACA,MAAAA,WAAUA,SAAQ,IAAI;AAAA,IACxB;AAEA,QAAI,CAAC,QAAQ;AACX,aAAO,KAAK;AAAA,QACV,MAAAD;AAAA,QACA,SAAS;AAAA,QACT,UAAU,MAAM;AAAA,QAChB,QAAQ;AAAA,MACV,CAAC;AACD;AAAA,IACF;AAGA,UAAM,YAAY,kBAAkBC,UAAS,MAAM,MAAMD,KAAI;AAC7D,QAAI,WAAW;AACb,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,OAAO,OAAO,WAAW;AAAA,IACzB;AAAA,EACF;AACF;;;APlRA,SAAS,oBAAoB,OAAyB;AACpD,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,UAAU,SAAS,MAAM,SAAS;AAC1F;AAkBA,SAAS,uBAAuB,cAAqD;AACnF,QAAM,OAAO,gBAAgBE,MAAK,KAAK,QAAQ,IAAI,GAAG,WAAW;AACjE,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACAA,MAAK,KAAK,MAAM,eAAe;AAAA,IAC/BA,MAAK,KAAK,MAAM,qBAAqB;AAAA,IACrCA,MAAK,KAAK,MAAM,4BAA4B;AAAA,IAC5CA,MAAK,KAAK,MAAM,6BAA6B;AAAA,IAC7CA,MAAK,KAAK,MAAM,uBAAuB;AAAA,IACvCA,MAAK,KAAK,MAAM,iCAAiC;AAAA,IACjDA,MAAK,KAAK,MAAM,eAAe;AAAA,EACjC;AAEA,SAAO,CAAC,QAA6B;AACnC,eAAW,YAAY,eAAe;AACpC,UAAI;AACF,cAAM,WAAWA,MAAK,KAAK,UAAU,GAAG;AACxC,cAAM,UAAUC,cAAa,UAAU,OAAO;AAC9C,eAAO,SAAS,OAAO;AAAA,MACzB,SAAS,OAAO;AAGd,YAAI,oBAAoB,KAAK,GAAG;AAC9B;AAAA,QACF;AACA,cAAM;AAAA,MACR;AAAA,IACF;AACA,UAAM,IAAI;AAAA,MACR,gCAAgC,GAAG,oCAAoC,cAAc,KAAK,IAAI,CAAC;AAAA,IACjG;AAAA,EACF;AACF;AAyCA,eAAsB,QAAQ,SAYC;AAC7B,QAAM,OAAwB;AAAA,IAC5B,UAAU,QAAQ,YAAY;AAAA,IAC9B,OAAO,QAAQ,SAAS;AAAA;AAAA;AAAA;AAAA,IAIxB,UAAU;AAAA,IACV,iBAAiB,QAAQ;AAAA,EAC3B;AAGA,QAAM,SAAS,SAAS,QAAQ,GAAG;AAGnC,QAAM,cAAc,cAAc,QAAQ,WAAW;AACrD,QAAM,eAAe,cAAc,QAAQ,YAAY;AAGvD,QAAM,aAAa,kBAAkB,QAAQ,aAAa,QAAQ,YAAY;AAG9E,QAAM,UAA8B;AAAA,IAClC,KAAK;AAAA,IACL,aAAa,QAAQ;AAAA,IACrB,cAAc,QAAQ;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS;AAAA,IACT,iBAAiB,CAAC,SAAS,wBAAwB,IAAI;AAAA,IACvD,sBAAsB,CAAC,SAAS,qBAAyB,IAAI;AAAA,IAC7D,aAAa,kBAAkB;AAAA,IAC/B,cAAc,QAAQ,gBAAgB,uBAAuB,QAAQ,YAAY;AAAA;AAAA,IAEjF,sBAAsB,oBAAI,IAAI;AAAA;AAAA,IAE9B,cAAc,CAAC;AAAA,IACf,iBAAiB,oBAAI,IAAI;AAAA,EAC3B;AAGA,QAAM,SAAS,gBAAgB,QAAQ,OAAO;AAG9C,QAAM,EAAE,QAAQ,IAAI,IAAI,MAAM,sBAAsB,QAAQ,IAAI;AAGhE,QAAM,cAAc,oBAAoB,aAAa,cAAc,UAAU;AAC7E,QAAM,iBAAiB,uBAAuB,QAAQ,WAAW;AAEjE,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,KAAK,QAAQ,MAAM;AAAA,IACxB,gBAAgB,KAAK,QAAQ,SAAS;AAAA,EACxC;AACF;AAEA,SAAS,oBAAgD;AACvD,QAAM,WAAW,oBAAI,IAAoB;AACzC,SAAO,CAAC,WAAmB;AACzB,UAAM,QAAQ,SAAS,IAAI,MAAM,KAAK;AACtC,aAAS,IAAI,QAAQ,QAAQ,CAAC;AAC9B,WAAO,GAAG,MAAM,IAAI,KAAK;AAAA,EAC3B;AACF;","names":["ErrorCode","TokenType","Position","SourceLocation","offset","Parser","ref","parse","parser","DestructuringErrors","TokContext","Scope","Node","BranchID","RegExpValidationState","current","Token","parse","NodeType","path","path","ast","compiledExpr","literal","path","statements","branchCode","wrapperCode","sanitizeId","generateNodeEvaluationCode","readFileSync","dirname","__dirname","dirname","readFileSync","data","dirname","data","module","current","Kind","createHash","path","readFileSync","path","lookahead","value","current","path","current","path","readFileSync"]}
+{"version":3,"sources":["../src/compiler/errors.ts","../node_modules/acorn/dist/acorn.mjs","../src/compiler/utils.ts","../src/compiler/nodes/function.ts","../src/compiler/parser.ts","../src/compiler/graph.ts","../src/compiler/nodes/input.ts","../src/compiler/nodes/context-resolvers.ts","../src/compiler/nodes/expression-compiler.ts","../src/compiler/nodes/expression.ts","../src/compiler/unary-transform.ts","../src/compiler/nodes/decision-table.ts","../src/compiler/code-generators.ts","../src/compiler/nodes/switch.ts","../src/compiler/nodes/decision.ts","../src/compiler/compile-time-validation.ts","../src/compiler/switch-branch-detection.ts","../src/compiler/result-selection.ts","../src/compiler/orchestrator.ts","../src/compiler/cache.ts","inline-runtime:inline-runtime","../src/compiler/asc-compiler.ts","../src/compiler/virtual-fs.ts","../src/compiler/codegen/js-marshal.ts","../src/compiler/codegen/js-validation.ts","../src/compiler/runtime-codegen.ts","../src/compiler/runtime.ts","../src/compiler/build.ts","../src/compiler/schema.ts","../src/compiler/index.ts","../src/compiler/ast-types.ts","../src/compiler/expression-parser.ts","../src/compiler/cst-visitor.ts","../src/compiler/unary-ast-transforms.ts","../src/compiler/unary-parser.ts","../src/compiler/optimizer.ts","../src/compiler/runtime-validation-codegen.ts"],"sourcesContent":["/**\n * Error handling infrastructure for the JDM compiler.\n *\n * This module provides:\n * - CompilationError: The main error class for all compilation failures\n * - ErrorCode: A comprehensive enumeration of all possible error types\n * - SourceLocation: Detailed location information for error reporting\n * - ErrorCollector: Aggregates non-fatal expression errors for batch reporting\n */\n\n/**\n * Detailed source location for error reporting.\n */\nexport interface SourceLocation {\n  /** ID of the node where the error occurred */\n  nodeId?: string;\n  /** Name of the node where the error occurred */\n  nodeName?: string;\n  /** Field name within the node */\n  field?: string;\n  /** Line number in source JDM */\n  line?: number;\n  /** Column number in source JDM */\n  column?: number;\n}\n\n/**\n * Enumeration of all possible compilation error codes.\n *\n * Errors are categorized into three types:\n * - Structural errors: Critical JDM structure issues that fail compilation immediately\n * - Feature errors: Unsupported features that cannot be handled\n * - Expression errors: Issues in expression parsing that can be collected and reported together\n */\nexport enum ErrorCode {\n  // Structural errors (fail immediately)\n  INVALID_JSON = 'INVALID_JSON',\n  INVALID_NODE_STRUCTURE = 'INVALID_NODE_STRUCTURE',\n  MISSING_INPUT_NODE = 'MISSING_INPUT_NODE',\n  MISSING_OUTPUT_NODE = 'MISSING_OUTPUT_NODE',\n  MULTIPLE_INPUT_NODES = 'MULTIPLE_INPUT_NODES',\n  CYCLE_DETECTED = 'CYCLE_DETECTED',\n  INVALID_EDGE = 'INVALID_EDGE',\n\n  // Feature errors (fail immediately)\n  UNSUPPORTED_FUNCTION_NODE = 'UNSUPPORTED_FUNCTION_NODE',\n  UNSUPPORTED_EXPRESSION = 'UNSUPPORTED_EXPRESSION',\n\n  // Expression errors (collected, reported together)\n  PARSE_ERROR = 'PARSE_ERROR',\n  UNKNOWN_FUNCTION = 'UNKNOWN_FUNCTION',\n  TYPE_MISMATCH = 'TYPE_MISMATCH',\n  UNKNOWN_FIELD = 'UNKNOWN_FIELD',\n\n  // Schema errors\n  SCHEMA_MISMATCH = 'SCHEMA_MISMATCH',\n  INVALID_SCHEMA = 'INVALID_SCHEMA',\n}\n\n/**\n * Custom error class for compilation failures.\n *\n * Provides structured error information including error code, source location,\n * and additional context for debugging.\n */\nexport class CompilationError extends Error {\n  readonly name = 'CompilationError';\n\n  constructor(\n    message: string,\n    public readonly code: ErrorCode,\n    public readonly location?: SourceLocation,\n    public readonly context?: Record<string, unknown>,\n  ) {\n    super(message);\n    // Exclude the CompilationError constructor frame from the stack trace.\n    // Without this, stack traces would include an unhelpful constructor frame,\n    // making it harder to identify the actual error source in compiled code.\n    // Only available on V8-based engines (Node.js, Chrome, Edge).\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, CompilationError);\n    }\n  }\n\n  /**\n   * Get a formatted error message with location information.\n   */\n  getFormattedMessage(): string {\n    const parts: string[] = [];\n\n    if (this.location) {\n      const locParts: string[] = [];\n      if (this.location.nodeName) {\n        locParts.push(this.location.nodeName);\n      }\n      if (this.location.nodeId) {\n        locParts.push(`(id: ${this.location.nodeId})`);\n      }\n      if (this.location.field) {\n        locParts.push(`.${this.location.field}`);\n      }\n      // Combine line and column: @10:5\n      if (this.location.line !== undefined && this.location.column !== undefined) {\n        locParts.push(`@${this.location.line}:${this.location.column}`);\n      } else if (this.location.line !== undefined) {\n        locParts.push(`@${this.location.line}`);\n      } else if (this.location.column !== undefined) {\n        locParts.push(`:${this.location.column}`);\n      }\n\n      if (locParts.length > 0) {\n        parts.push(`[${locParts.join(' ')}]`);\n      }\n    }\n\n    parts.push(`[${this.code}]`);\n    parts.push(this.message);\n\n    return parts.join(' ');\n  }\n}\n\n/**\n * Collector for non-fatal errors during expression parsing.\n *\n * This allows the parser to continue and collect multiple errors rather than\n * failing on the first one, providing a better user experience by reporting\n * all issues at once.\n *\n * @example\n * const collector = new ErrorCollector();\n * collector.add(new CompilationError('Undefined variable', ErrorCode.UNKNOWN_FIELD, { nodeName: 'AgeCheck' }));\n * collector.add(new CompilationError('Type mismatch', ErrorCode.TYPE_MISMATCH, { nodeName: 'AgeCheck' }));\n * collector.throwIfErrors(); // Throws with aggregated message\n */\nexport class ErrorCollector {\n  private errors: CompilationError[] = [];\n\n  /**\n   * Add an error to the collector.\n   */\n  add(error: CompilationError): void {\n    this.errors.push(error);\n  }\n\n  /**\n   * Check if any errors have been collected.\n   */\n  hasErrors(): boolean {\n    return this.errors.length > 0;\n  }\n\n  /**\n   * Throw if there are any collected errors.\n   *\n   * Single errors throw directly to preserve original context and stack trace. Multiple\n   * errors are aggregated into one with numbered list, so developers see all problems at\n   * once instead of fixing issues one-by-one through repeated compile attempts.\n   */\n  throwIfErrors(): void {\n    if (this.errors.length === 0) {\n      return;\n    }\n\n    if (this.errors.length === 1) {\n      throw this.errors[0];\n    }\n\n    const message =\n      `${this.errors.length} compilation errors:\\n` +\n      this.errors\n        .map((e, i) => {\n          const prefix = `  ${i + 1}. ${e.code}`;\n          const formatted = e.getFormattedMessage();\n          // getFormattedMessage() includes [CODE] prefix, but we already show the code in\n          // our numbered list, so strip it to avoid \"1. CODE: [CODE] message\"\n          const rest = formatted.replace(`[${e.code}]`, '').trim();\n          return `${prefix}${rest ? ': ' + rest : ''}`;\n        })\n        .join('\\n');\n\n    // Use the location from the first error as the aggregated error's location\n    const firstErrorLocation = this.errors[0].location;\n    throw new CompilationError(message, ErrorCode.PARSE_ERROR, firstErrorLocation);\n  }\n}\n\n/**\n * Type guard to check if an error is a CompilationError.\n */\nexport function isCompilationError(error: unknown): error is CompilationError {\n  return error instanceof CompilationError;\n}\n\n/**\n * Type guard to check if an error code is a structural error.\n */\nexport function isStructuralError(code: ErrorCode): boolean {\n  return [\n    ErrorCode.INVALID_JSON,\n    ErrorCode.INVALID_NODE_STRUCTURE,\n    ErrorCode.MISSING_INPUT_NODE,\n    ErrorCode.MISSING_OUTPUT_NODE,\n    ErrorCode.MULTIPLE_INPUT_NODES,\n    ErrorCode.CYCLE_DETECTED,\n    ErrorCode.INVALID_EDGE,\n  ].includes(code);\n}\n\n/**\n * Type guard to check if an error code is a feature error.\n */\nexport function isFeatureError(code: ErrorCode): boolean {\n  return [ErrorCode.UNSUPPORTED_FUNCTION_NODE, ErrorCode.UNSUPPORTED_EXPRESSION].includes(code);\n}\n\n/**\n * Type guard to check if an error code is an expression error.\n */\nexport function isExpressionError(code: ErrorCode): boolean {\n  return [\n    ErrorCode.PARSE_ERROR,\n    ErrorCode.UNKNOWN_FUNCTION,\n    ErrorCode.TYPE_MISMATCH,\n    ErrorCode.UNKNOWN_FIELD,\n  ].includes(code);\n}\n","// This file was generated. Do not modify manually!\nvar astralIdentifierCodes = [509, 0, 227, 0, 150, 4, 294, 9, 1368, 2, 2, 1, 6, 3, 41, 2, 5, 0, 166, 1, 574, 3, 9, 9, 7, 9, 32, 4, 318, 1, 80, 3, 71, 10, 50, 3, 123, 2, 54, 14, 32, 10, 3, 1, 11, 3, 46, 10, 8, 0, 46, 9, 7, 2, 37, 13, 2, 9, 6, 1, 45, 0, 13, 2, 49, 13, 9, 3, 2, 11, 83, 11, 7, 0, 3, 0, 158, 11, 6, 9, 7, 3, 56, 1, 2, 6, 3, 1, 3, 2, 10, 0, 11, 1, 3, 6, 4, 4, 68, 8, 2, 0, 3, 0, 2, 3, 2, 4, 2, 0, 15, 1, 83, 17, 10, 9, 5, 0, 82, 19, 13, 9, 214, 6, 3, 8, 28, 1, 83, 16, 16, 9, 82, 12, 9, 9, 7, 19, 58, 14, 5, 9, 243, 14, 166, 9, 71, 5, 2, 1, 3, 3, 2, 0, 2, 1, 13, 9, 120, 6, 3, 6, 4, 0, 29, 9, 41, 6, 2, 3, 9, 0, 10, 10, 47, 15, 343, 9, 54, 7, 2, 7, 17, 9, 57, 21, 2, 13, 123, 5, 4, 0, 2, 1, 2, 6, 2, 0, 9, 9, 49, 4, 2, 1, 2, 4, 9, 9, 330, 3, 10, 1, 2, 0, 49, 6, 4, 4, 14, 10, 5350, 0, 7, 14, 11465, 27, 2343, 9, 87, 9, 39, 4, 60, 6, 26, 9, 535, 9, 470, 0, 2, 54, 8, 3, 82, 0, 12, 1, 19628, 1, 4178, 9, 519, 45, 3, 22, 543, 4, 4, 5, 9, 7, 3, 6, 31, 3, 149, 2, 1418, 49, 513, 54, 5, 49, 9, 0, 15, 0, 23, 4, 2, 14, 1361, 6, 2, 16, 3, 6, 2, 1, 2, 4, 101, 0, 161, 6, 10, 9, 357, 0, 62, 13, 499, 13, 245, 1, 2, 9, 726, 6, 110, 6, 6, 9, 4759, 9, 787719, 239];\n\n// This file was generated. Do not modify manually!\nvar astralIdentifierStartCodes = [0, 11, 2, 25, 2, 18, 2, 1, 2, 14, 3, 13, 35, 122, 70, 52, 268, 28, 4, 48, 48, 31, 14, 29, 6, 37, 11, 29, 3, 35, 5, 7, 2, 4, 43, 157, 19, 35, 5, 35, 5, 39, 9, 51, 13, 10, 2, 14, 2, 6, 2, 1, 2, 10, 2, 14, 2, 6, 2, 1, 4, 51, 13, 310, 10, 21, 11, 7, 25, 5, 2, 41, 2, 8, 70, 5, 3, 0, 2, 43, 2, 1, 4, 0, 3, 22, 11, 22, 10, 30, 66, 18, 2, 1, 11, 21, 11, 25, 71, 55, 7, 1, 65, 0, 16, 3, 2, 2, 2, 28, 43, 28, 4, 28, 36, 7, 2, 27, 28, 53, 11, 21, 11, 18, 14, 17, 111, 72, 56, 50, 14, 50, 14, 35, 39, 27, 10, 22, 251, 41, 7, 1, 17, 2, 60, 28, 11, 0, 9, 21, 43, 17, 47, 20, 28, 22, 13, 52, 58, 1, 3, 0, 14, 44, 33, 24, 27, 35, 30, 0, 3, 0, 9, 34, 4, 0, 13, 47, 15, 3, 22, 0, 2, 0, 36, 17, 2, 24, 20, 1, 64, 6, 2, 0, 2, 3, 2, 14, 2, 9, 8, 46, 39, 7, 3, 1, 3, 21, 2, 6, 2, 1, 2, 4, 4, 0, 19, 0, 13, 4, 31, 9, 2, 0, 3, 0, 2, 37, 2, 0, 26, 0, 2, 0, 45, 52, 19, 3, 21, 2, 31, 47, 21, 1, 2, 0, 185, 46, 42, 3, 37, 47, 21, 0, 60, 42, 14, 0, 72, 26, 38, 6, 186, 43, 117, 63, 32, 7, 3, 0, 3, 7, 2, 1, 2, 23, 16, 0, 2, 0, 95, 7, 3, 38, 17, 0, 2, 0, 29, 0, 11, 39, 8, 0, 22, 0, 12, 45, 20, 0, 19, 72, 200, 32, 32, 8, 2, 36, 18, 0, 50, 29, 113, 6, 2, 1, 2, 37, 22, 0, 26, 5, 2, 1, 2, 31, 15, 0, 328, 18, 16, 0, 2, 12, 2, 33, 125, 0, 80, 921, 103, 110, 18, 195, 2637, 96, 16, 1071, 18, 5, 26, 3994, 6, 582, 6842, 29, 1763, 568, 8, 30, 18, 78, 18, 29, 19, 47, 17, 3, 32, 20, 6, 18, 433, 44, 212, 63, 129, 74, 6, 0, 67, 12, 65, 1, 2, 0, 29, 6135, 9, 1237, 42, 9, 8936, 3, 2, 6, 2, 1, 2, 290, 16, 0, 30, 2, 3, 0, 15, 3, 9, 395, 2309, 106, 6, 12, 4, 8, 8, 9, 5991, 84, 2, 70, 2, 1, 3, 0, 3, 1, 3, 3, 2, 11, 2, 0, 2, 6, 2, 64, 2, 3, 3, 7, 2, 6, 2, 27, 2, 3, 2, 4, 2, 0, 4, 6, 2, 339, 3, 24, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 7, 1845, 30, 7, 5, 262, 61, 147, 44, 11, 6, 17, 0, 322, 29, 19, 43, 485, 27, 229, 29, 3, 0, 496, 6, 2, 3, 2, 1, 2, 14, 2, 196, 60, 67, 8, 0, 1205, 3, 2, 26, 2, 1, 2, 0, 3, 0, 2, 9, 2, 3, 2, 0, 2, 0, 7, 0, 5, 0, 2, 0, 2, 0, 2, 2, 2, 1, 2, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 1, 2, 0, 3, 3, 2, 6, 2, 3, 2, 3, 2, 0, 2, 9, 2, 16, 6, 2, 2, 4, 2, 16, 4421, 42719, 33, 4153, 7, 221, 3, 5761, 15, 7472, 16, 621, 2467, 541, 1507, 4938, 6, 4191];\n\n// This file was generated. Do not modify manually!\nvar nonASCIIidentifierChars = \"\\u200c\\u200d\\xb7\\u0300-\\u036f\\u0387\\u0483-\\u0487\\u0591-\\u05bd\\u05bf\\u05c1\\u05c2\\u05c4\\u05c5\\u05c7\\u0610-\\u061a\\u064b-\\u0669\\u0670\\u06d6-\\u06dc\\u06df-\\u06e4\\u06e7\\u06e8\\u06ea-\\u06ed\\u06f0-\\u06f9\\u0711\\u0730-\\u074a\\u07a6-\\u07b0\\u07c0-\\u07c9\\u07eb-\\u07f3\\u07fd\\u0816-\\u0819\\u081b-\\u0823\\u0825-\\u0827\\u0829-\\u082d\\u0859-\\u085b\\u0897-\\u089f\\u08ca-\\u08e1\\u08e3-\\u0903\\u093a-\\u093c\\u093e-\\u094f\\u0951-\\u0957\\u0962\\u0963\\u0966-\\u096f\\u0981-\\u0983\\u09bc\\u09be-\\u09c4\\u09c7\\u09c8\\u09cb-\\u09cd\\u09d7\\u09e2\\u09e3\\u09e6-\\u09ef\\u09fe\\u0a01-\\u0a03\\u0a3c\\u0a3e-\\u0a42\\u0a47\\u0a48\\u0a4b-\\u0a4d\\u0a51\\u0a66-\\u0a71\\u0a75\\u0a81-\\u0a83\\u0abc\\u0abe-\\u0ac5\\u0ac7-\\u0ac9\\u0acb-\\u0acd\\u0ae2\\u0ae3\\u0ae6-\\u0aef\\u0afa-\\u0aff\\u0b01-\\u0b03\\u0b3c\\u0b3e-\\u0b44\\u0b47\\u0b48\\u0b4b-\\u0b4d\\u0b55-\\u0b57\\u0b62\\u0b63\\u0b66-\\u0b6f\\u0b82\\u0bbe-\\u0bc2\\u0bc6-\\u0bc8\\u0bca-\\u0bcd\\u0bd7\\u0be6-\\u0bef\\u0c00-\\u0c04\\u0c3c\\u0c3e-\\u0c44\\u0c46-\\u0c48\\u0c4a-\\u0c4d\\u0c55\\u0c56\\u0c62\\u0c63\\u0c66-\\u0c6f\\u0c81-\\u0c83\\u0cbc\\u0cbe-\\u0cc4\\u0cc6-\\u0cc8\\u0cca-\\u0ccd\\u0cd5\\u0cd6\\u0ce2\\u0ce3\\u0ce6-\\u0cef\\u0cf3\\u0d00-\\u0d03\\u0d3b\\u0d3c\\u0d3e-\\u0d44\\u0d46-\\u0d48\\u0d4a-\\u0d4d\\u0d57\\u0d62\\u0d63\\u0d66-\\u0d6f\\u0d81-\\u0d83\\u0dca\\u0dcf-\\u0dd4\\u0dd6\\u0dd8-\\u0ddf\\u0de6-\\u0def\\u0df2\\u0df3\\u0e31\\u0e34-\\u0e3a\\u0e47-\\u0e4e\\u0e50-\\u0e59\\u0eb1\\u0eb4-\\u0ebc\\u0ec8-\\u0ece\\u0ed0-\\u0ed9\\u0f18\\u0f19\\u0f20-\\u0f29\\u0f35\\u0f37\\u0f39\\u0f3e\\u0f3f\\u0f71-\\u0f84\\u0f86\\u0f87\\u0f8d-\\u0f97\\u0f99-\\u0fbc\\u0fc6\\u102b-\\u103e\\u1040-\\u1049\\u1056-\\u1059\\u105e-\\u1060\\u1062-\\u1064\\u1067-\\u106d\\u1071-\\u1074\\u1082-\\u108d\\u108f-\\u109d\\u135d-\\u135f\\u1369-\\u1371\\u1712-\\u1715\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17b4-\\u17d3\\u17dd\\u17e0-\\u17e9\\u180b-\\u180d\\u180f-\\u1819\\u18a9\\u1920-\\u192b\\u1930-\\u193b\\u1946-\\u194f\\u19d0-\\u19da\\u1a17-\\u1a1b\\u1a55-\\u1a5e\\u1a60-\\u1a7c\\u1a7f-\\u1a89\\u1a90-\\u1a99\\u1ab0-\\u1abd\\u1abf-\\u1ace\\u1b00-\\u1b04\\u1b34-\\u1b44\\u1b50-\\u1b59\\u1b6b-\\u1b73\\u1b80-\\u1b82\\u1ba1-\\u1bad\\u1bb0-\\u1bb9\\u1be6-\\u1bf3\\u1c24-\\u1c37\\u1c40-\\u1c49\\u1c50-\\u1c59\\u1cd0-\\u1cd2\\u1cd4-\\u1ce8\\u1ced\\u1cf4\\u1cf7-\\u1cf9\\u1dc0-\\u1dff\\u200c\\u200d\\u203f\\u2040\\u2054\\u20d0-\\u20dc\\u20e1\\u20e5-\\u20f0\\u2cef-\\u2cf1\\u2d7f\\u2de0-\\u2dff\\u302a-\\u302f\\u3099\\u309a\\u30fb\\ua620-\\ua629\\ua66f\\ua674-\\ua67d\\ua69e\\ua69f\\ua6f0\\ua6f1\\ua802\\ua806\\ua80b\\ua823-\\ua827\\ua82c\\ua880\\ua881\\ua8b4-\\ua8c5\\ua8d0-\\ua8d9\\ua8e0-\\ua8f1\\ua8ff-\\ua909\\ua926-\\ua92d\\ua947-\\ua953\\ua980-\\ua983\\ua9b3-\\ua9c0\\ua9d0-\\ua9d9\\ua9e5\\ua9f0-\\ua9f9\\uaa29-\\uaa36\\uaa43\\uaa4c\\uaa4d\\uaa50-\\uaa59\\uaa7b-\\uaa7d\\uaab0\\uaab2-\\uaab4\\uaab7\\uaab8\\uaabe\\uaabf\\uaac1\\uaaeb-\\uaaef\\uaaf5\\uaaf6\\uabe3-\\uabea\\uabec\\uabed\\uabf0-\\uabf9\\ufb1e\\ufe00-\\ufe0f\\ufe20-\\ufe2f\\ufe33\\ufe34\\ufe4d-\\ufe4f\\uff10-\\uff19\\uff3f\\uff65\";\n\n// This file was generated. Do not modify manually!\nvar nonASCIIidentifierStartChars = \"\\xaa\\xb5\\xba\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02c1\\u02c6-\\u02d1\\u02e0-\\u02e4\\u02ec\\u02ee\\u0370-\\u0374\\u0376\\u0377\\u037a-\\u037d\\u037f\\u0386\\u0388-\\u038a\\u038c\\u038e-\\u03a1\\u03a3-\\u03f5\\u03f7-\\u0481\\u048a-\\u052f\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05d0-\\u05ea\\u05ef-\\u05f2\\u0620-\\u064a\\u066e\\u066f\\u0671-\\u06d3\\u06d5\\u06e5\\u06e6\\u06ee\\u06ef\\u06fa-\\u06fc\\u06ff\\u0710\\u0712-\\u072f\\u074d-\\u07a5\\u07b1\\u07ca-\\u07ea\\u07f4\\u07f5\\u07fa\\u0800-\\u0815\\u081a\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086a\\u0870-\\u0887\\u0889-\\u088e\\u08a0-\\u08c9\\u0904-\\u0939\\u093d\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098c\\u098f\\u0990\\u0993-\\u09a8\\u09aa-\\u09b0\\u09b2\\u09b6-\\u09b9\\u09bd\\u09ce\\u09dc\\u09dd\\u09df-\\u09e1\\u09f0\\u09f1\\u09fc\\u0a05-\\u0a0a\\u0a0f\\u0a10\\u0a13-\\u0a28\\u0a2a-\\u0a30\\u0a32\\u0a33\\u0a35\\u0a36\\u0a38\\u0a39\\u0a59-\\u0a5c\\u0a5e\\u0a72-\\u0a74\\u0a85-\\u0a8d\\u0a8f-\\u0a91\\u0a93-\\u0aa8\\u0aaa-\\u0ab0\\u0ab2\\u0ab3\\u0ab5-\\u0ab9\\u0abd\\u0ad0\\u0ae0\\u0ae1\\u0af9\\u0b05-\\u0b0c\\u0b0f\\u0b10\\u0b13-\\u0b28\\u0b2a-\\u0b30\\u0b32\\u0b33\\u0b35-\\u0b39\\u0b3d\\u0b5c\\u0b5d\\u0b5f-\\u0b61\\u0b71\\u0b83\\u0b85-\\u0b8a\\u0b8e-\\u0b90\\u0b92-\\u0b95\\u0b99\\u0b9a\\u0b9c\\u0b9e\\u0b9f\\u0ba3\\u0ba4\\u0ba8-\\u0baa\\u0bae-\\u0bb9\\u0bd0\\u0c05-\\u0c0c\\u0c0e-\\u0c10\\u0c12-\\u0c28\\u0c2a-\\u0c39\\u0c3d\\u0c58-\\u0c5a\\u0c5d\\u0c60\\u0c61\\u0c80\\u0c85-\\u0c8c\\u0c8e-\\u0c90\\u0c92-\\u0ca8\\u0caa-\\u0cb3\\u0cb5-\\u0cb9\\u0cbd\\u0cdd\\u0cde\\u0ce0\\u0ce1\\u0cf1\\u0cf2\\u0d04-\\u0d0c\\u0d0e-\\u0d10\\u0d12-\\u0d3a\\u0d3d\\u0d4e\\u0d54-\\u0d56\\u0d5f-\\u0d61\\u0d7a-\\u0d7f\\u0d85-\\u0d96\\u0d9a-\\u0db1\\u0db3-\\u0dbb\\u0dbd\\u0dc0-\\u0dc6\\u0e01-\\u0e30\\u0e32\\u0e33\\u0e40-\\u0e46\\u0e81\\u0e82\\u0e84\\u0e86-\\u0e8a\\u0e8c-\\u0ea3\\u0ea5\\u0ea7-\\u0eb0\\u0eb2\\u0eb3\\u0ebd\\u0ec0-\\u0ec4\\u0ec6\\u0edc-\\u0edf\\u0f00\\u0f40-\\u0f47\\u0f49-\\u0f6c\\u0f88-\\u0f8c\\u1000-\\u102a\\u103f\\u1050-\\u1055\\u105a-\\u105d\\u1061\\u1065\\u1066\\u106e-\\u1070\\u1075-\\u1081\\u108e\\u10a0-\\u10c5\\u10c7\\u10cd\\u10d0-\\u10fa\\u10fc-\\u1248\\u124a-\\u124d\\u1250-\\u1256\\u1258\\u125a-\\u125d\\u1260-\\u1288\\u128a-\\u128d\\u1290-\\u12b0\\u12b2-\\u12b5\\u12b8-\\u12be\\u12c0\\u12c2-\\u12c5\\u12c8-\\u12d6\\u12d8-\\u1310\\u1312-\\u1315\\u1318-\\u135a\\u1380-\\u138f\\u13a0-\\u13f5\\u13f8-\\u13fd\\u1401-\\u166c\\u166f-\\u167f\\u1681-\\u169a\\u16a0-\\u16ea\\u16ee-\\u16f8\\u1700-\\u1711\\u171f-\\u1731\\u1740-\\u1751\\u1760-\\u176c\\u176e-\\u1770\\u1780-\\u17b3\\u17d7\\u17dc\\u1820-\\u1878\\u1880-\\u18a8\\u18aa\\u18b0-\\u18f5\\u1900-\\u191e\\u1950-\\u196d\\u1970-\\u1974\\u1980-\\u19ab\\u19b0-\\u19c9\\u1a00-\\u1a16\\u1a20-\\u1a54\\u1aa7\\u1b05-\\u1b33\\u1b45-\\u1b4c\\u1b83-\\u1ba0\\u1bae\\u1baf\\u1bba-\\u1be5\\u1c00-\\u1c23\\u1c4d-\\u1c4f\\u1c5a-\\u1c7d\\u1c80-\\u1c8a\\u1c90-\\u1cba\\u1cbd-\\u1cbf\\u1ce9-\\u1cec\\u1cee-\\u1cf3\\u1cf5\\u1cf6\\u1cfa\\u1d00-\\u1dbf\\u1e00-\\u1f15\\u1f18-\\u1f1d\\u1f20-\\u1f45\\u1f48-\\u1f4d\\u1f50-\\u1f57\\u1f59\\u1f5b\\u1f5d\\u1f5f-\\u1f7d\\u1f80-\\u1fb4\\u1fb6-\\u1fbc\\u1fbe\\u1fc2-\\u1fc4\\u1fc6-\\u1fcc\\u1fd0-\\u1fd3\\u1fd6-\\u1fdb\\u1fe0-\\u1fec\\u1ff2-\\u1ff4\\u1ff6-\\u1ffc\\u2071\\u207f\\u2090-\\u209c\\u2102\\u2107\\u210a-\\u2113\\u2115\\u2118-\\u211d\\u2124\\u2126\\u2128\\u212a-\\u2139\\u213c-\\u213f\\u2145-\\u2149\\u214e\\u2160-\\u2188\\u2c00-\\u2ce4\\u2ceb-\\u2cee\\u2cf2\\u2cf3\\u2d00-\\u2d25\\u2d27\\u2d2d\\u2d30-\\u2d67\\u2d6f\\u2d80-\\u2d96\\u2da0-\\u2da6\\u2da8-\\u2dae\\u2db0-\\u2db6\\u2db8-\\u2dbe\\u2dc0-\\u2dc6\\u2dc8-\\u2dce\\u2dd0-\\u2dd6\\u2dd8-\\u2dde\\u3005-\\u3007\\u3021-\\u3029\\u3031-\\u3035\\u3038-\\u303c\\u3041-\\u3096\\u309b-\\u309f\\u30a1-\\u30fa\\u30fc-\\u30ff\\u3105-\\u312f\\u3131-\\u318e\\u31a0-\\u31bf\\u31f0-\\u31ff\\u3400-\\u4dbf\\u4e00-\\ua48c\\ua4d0-\\ua4fd\\ua500-\\ua60c\\ua610-\\ua61f\\ua62a\\ua62b\\ua640-\\ua66e\\ua67f-\\ua69d\\ua6a0-\\ua6ef\\ua717-\\ua71f\\ua722-\\ua788\\ua78b-\\ua7cd\\ua7d0\\ua7d1\\ua7d3\\ua7d5-\\ua7dc\\ua7f2-\\ua801\\ua803-\\ua805\\ua807-\\ua80a\\ua80c-\\ua822\\ua840-\\ua873\\ua882-\\ua8b3\\ua8f2-\\ua8f7\\ua8fb\\ua8fd\\ua8fe\\ua90a-\\ua925\\ua930-\\ua946\\ua960-\\ua97c\\ua984-\\ua9b2\\ua9cf\\ua9e0-\\ua9e4\\ua9e6-\\ua9ef\\ua9fa-\\ua9fe\\uaa00-\\uaa28\\uaa40-\\uaa42\\uaa44-\\uaa4b\\uaa60-\\uaa76\\uaa7a\\uaa7e-\\uaaaf\\uaab1\\uaab5\\uaab6\\uaab9-\\uaabd\\uaac0\\uaac2\\uaadb-\\uaadd\\uaae0-\\uaaea\\uaaf2-\\uaaf4\\uab01-\\uab06\\uab09-\\uab0e\\uab11-\\uab16\\uab20-\\uab26\\uab28-\\uab2e\\uab30-\\uab5a\\uab5c-\\uab69\\uab70-\\uabe2\\uac00-\\ud7a3\\ud7b0-\\ud7c6\\ud7cb-\\ud7fb\\uf900-\\ufa6d\\ufa70-\\ufad9\\ufb00-\\ufb06\\ufb13-\\ufb17\\ufb1d\\ufb1f-\\ufb28\\ufb2a-\\ufb36\\ufb38-\\ufb3c\\ufb3e\\ufb40\\ufb41\\ufb43\\ufb44\\ufb46-\\ufbb1\\ufbd3-\\ufd3d\\ufd50-\\ufd8f\\ufd92-\\ufdc7\\ufdf0-\\ufdfb\\ufe70-\\ufe74\\ufe76-\\ufefc\\uff21-\\uff3a\\uff41-\\uff5a\\uff66-\\uffbe\\uffc2-\\uffc7\\uffca-\\uffcf\\uffd2-\\uffd7\\uffda-\\uffdc\";\n\n// These are a run-length and offset encoded representation of the\n// >0xffff code points that are a valid part of identifiers. The\n// offset starts at 0x10000, and each pair of numbers represents an\n// offset to the next range, and then a size of the range.\n\n// Reserved word lists for various dialects of the language\n\nvar reservedWords = {\n  3: \"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile\",\n  5: \"class enum extends super const export import\",\n  6: \"enum\",\n  strict: \"implements interface let package private protected public static yield\",\n  strictBind: \"eval arguments\"\n};\n\n// And the keywords\n\nvar ecma5AndLessKeywords = \"break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this\";\n\nvar keywords$1 = {\n  5: ecma5AndLessKeywords,\n  \"5module\": ecma5AndLessKeywords + \" export import\",\n  6: ecma5AndLessKeywords + \" const class extends export import super\"\n};\n\nvar keywordRelationalOperator = /^in(stanceof)?$/;\n\n// ## Character categories\n\nvar nonASCIIidentifierStart = new RegExp(\"[\" + nonASCIIidentifierStartChars + \"]\");\nvar nonASCIIidentifier = new RegExp(\"[\" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + \"]\");\n\n// This has a complexity linear to the value of the code. The\n// assumption is that looking up astral identifier characters is\n// rare.\nfunction isInAstralSet(code, set) {\n  var pos = 0x10000;\n  for (var i = 0; i < set.length; i += 2) {\n    pos += set[i];\n    if (pos > code) { return false }\n    pos += set[i + 1];\n    if (pos >= code) { return true }\n  }\n  return false\n}\n\n// Test whether a given character code starts an identifier.\n\nfunction isIdentifierStart(code, astral) {\n  if (code < 65) { return code === 36 }\n  if (code < 91) { return true }\n  if (code < 97) { return code === 95 }\n  if (code < 123) { return true }\n  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }\n  if (astral === false) { return false }\n  return isInAstralSet(code, astralIdentifierStartCodes)\n}\n\n// Test whether a given character is part of an identifier.\n\nfunction isIdentifierChar(code, astral) {\n  if (code < 48) { return code === 36 }\n  if (code < 58) { return true }\n  if (code < 65) { return false }\n  if (code < 91) { return true }\n  if (code < 97) { return code === 95 }\n  if (code < 123) { return true }\n  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }\n  if (astral === false) { return false }\n  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)\n}\n\n// ## Token types\n\n// The assignment of fine-grained, information-carrying type objects\n// allows the tokenizer to store the information it has about a\n// token in a way that is very cheap for the parser to look up.\n\n// All token type variables start with an underscore, to make them\n// easy to recognize.\n\n// The `beforeExpr` property is used to disambiguate between regular\n// expressions and divisions. It is set on all token types that can\n// be followed by an expression (thus, a slash after them would be a\n// regular expression).\n//\n// The `startsExpr` property is used to check if the token ends a\n// `yield` expression. It is set on all token types that either can\n// directly start an expression (like a quotation mark) or can\n// continue an expression (like the body of a string).\n//\n// `isLoop` marks a keyword as starting a loop, which is important\n// to know when parsing a label, in order to allow or disallow\n// continue jumps to that label.\n\nvar TokenType = function TokenType(label, conf) {\n  if ( conf === void 0 ) conf = {};\n\n  this.label = label;\n  this.keyword = conf.keyword;\n  this.beforeExpr = !!conf.beforeExpr;\n  this.startsExpr = !!conf.startsExpr;\n  this.isLoop = !!conf.isLoop;\n  this.isAssign = !!conf.isAssign;\n  this.prefix = !!conf.prefix;\n  this.postfix = !!conf.postfix;\n  this.binop = conf.binop || null;\n  this.updateContext = null;\n};\n\nfunction binop(name, prec) {\n  return new TokenType(name, {beforeExpr: true, binop: prec})\n}\nvar beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};\n\n// Map keyword names to token types.\n\nvar keywords = {};\n\n// Succinct definitions of keyword token types\nfunction kw(name, options) {\n  if ( options === void 0 ) options = {};\n\n  options.keyword = name;\n  return keywords[name] = new TokenType(name, options)\n}\n\nvar types$1 = {\n  num: new TokenType(\"num\", startsExpr),\n  regexp: new TokenType(\"regexp\", startsExpr),\n  string: new TokenType(\"string\", startsExpr),\n  name: new TokenType(\"name\", startsExpr),\n  privateId: new TokenType(\"privateId\", startsExpr),\n  eof: new TokenType(\"eof\"),\n\n  // Punctuation token types.\n  bracketL: new TokenType(\"[\", {beforeExpr: true, startsExpr: true}),\n  bracketR: new TokenType(\"]\"),\n  braceL: new TokenType(\"{\", {beforeExpr: true, startsExpr: true}),\n  braceR: new TokenType(\"}\"),\n  parenL: new TokenType(\"(\", {beforeExpr: true, startsExpr: true}),\n  parenR: new TokenType(\")\"),\n  comma: new TokenType(\",\", beforeExpr),\n  semi: new TokenType(\";\", beforeExpr),\n  colon: new TokenType(\":\", beforeExpr),\n  dot: new TokenType(\".\"),\n  question: new TokenType(\"?\", beforeExpr),\n  questionDot: new TokenType(\"?.\"),\n  arrow: new TokenType(\"=>\", beforeExpr),\n  template: new TokenType(\"template\"),\n  invalidTemplate: new TokenType(\"invalidTemplate\"),\n  ellipsis: new TokenType(\"...\", beforeExpr),\n  backQuote: new TokenType(\"`\", startsExpr),\n  dollarBraceL: new TokenType(\"${\", {beforeExpr: true, startsExpr: true}),\n\n  // Operators. These carry several kinds of properties to help the\n  // parser use them properly (the presence of these properties is\n  // what categorizes them as operators).\n  //\n  // `binop`, when present, specifies that this operator is a binary\n  // operator, and will refer to its precedence.\n  //\n  // `prefix` and `postfix` mark the operator as a prefix or postfix\n  // unary operator.\n  //\n  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as\n  // binary operators with a very low precedence, that should result\n  // in AssignmentExpression nodes.\n\n  eq: new TokenType(\"=\", {beforeExpr: true, isAssign: true}),\n  assign: new TokenType(\"_=\", {beforeExpr: true, isAssign: true}),\n  incDec: new TokenType(\"++/--\", {prefix: true, postfix: true, startsExpr: true}),\n  prefix: new TokenType(\"!/~\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  logicalOR: binop(\"||\", 1),\n  logicalAND: binop(\"&&\", 2),\n  bitwiseOR: binop(\"|\", 3),\n  bitwiseXOR: binop(\"^\", 4),\n  bitwiseAND: binop(\"&\", 5),\n  equality: binop(\"==/!=/===/!==\", 6),\n  relational: binop(\"</>/<=/>=\", 7),\n  bitShift: binop(\"<</>>/>>>\", 8),\n  plusMin: new TokenType(\"+/-\", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),\n  modulo: binop(\"%\", 10),\n  star: binop(\"*\", 10),\n  slash: binop(\"/\", 10),\n  starstar: new TokenType(\"**\", {beforeExpr: true}),\n  coalesce: binop(\"??\", 1),\n\n  // Keyword token types.\n  _break: kw(\"break\"),\n  _case: kw(\"case\", beforeExpr),\n  _catch: kw(\"catch\"),\n  _continue: kw(\"continue\"),\n  _debugger: kw(\"debugger\"),\n  _default: kw(\"default\", beforeExpr),\n  _do: kw(\"do\", {isLoop: true, beforeExpr: true}),\n  _else: kw(\"else\", beforeExpr),\n  _finally: kw(\"finally\"),\n  _for: kw(\"for\", {isLoop: true}),\n  _function: kw(\"function\", startsExpr),\n  _if: kw(\"if\"),\n  _return: kw(\"return\", beforeExpr),\n  _switch: kw(\"switch\"),\n  _throw: kw(\"throw\", beforeExpr),\n  _try: kw(\"try\"),\n  _var: kw(\"var\"),\n  _const: kw(\"const\"),\n  _while: kw(\"while\", {isLoop: true}),\n  _with: kw(\"with\"),\n  _new: kw(\"new\", {beforeExpr: true, startsExpr: true}),\n  _this: kw(\"this\", startsExpr),\n  _super: kw(\"super\", startsExpr),\n  _class: kw(\"class\", startsExpr),\n  _extends: kw(\"extends\", beforeExpr),\n  _export: kw(\"export\"),\n  _import: kw(\"import\", startsExpr),\n  _null: kw(\"null\", startsExpr),\n  _true: kw(\"true\", startsExpr),\n  _false: kw(\"false\", startsExpr),\n  _in: kw(\"in\", {beforeExpr: true, binop: 7}),\n  _instanceof: kw(\"instanceof\", {beforeExpr: true, binop: 7}),\n  _typeof: kw(\"typeof\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _void: kw(\"void\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _delete: kw(\"delete\", {beforeExpr: true, prefix: true, startsExpr: true})\n};\n\n// Matches a whole line break (where CRLF is considered a single\n// line break). Used to count lines.\n\nvar lineBreak = /\\r\\n?|\\n|\\u2028|\\u2029/;\nvar lineBreakG = new RegExp(lineBreak.source, \"g\");\n\nfunction isNewLine(code) {\n  return code === 10 || code === 13 || code === 0x2028 || code === 0x2029\n}\n\nfunction nextLineBreak(code, from, end) {\n  if ( end === void 0 ) end = code.length;\n\n  for (var i = from; i < end; i++) {\n    var next = code.charCodeAt(i);\n    if (isNewLine(next))\n      { return i < end - 1 && next === 13 && code.charCodeAt(i + 1) === 10 ? i + 2 : i + 1 }\n  }\n  return -1\n}\n\nvar nonASCIIwhitespace = /[\\u1680\\u2000-\\u200a\\u202f\\u205f\\u3000\\ufeff]/;\n\nvar skipWhiteSpace = /(?:\\s|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/g;\n\nvar ref = Object.prototype;\nvar hasOwnProperty = ref.hasOwnProperty;\nvar toString = ref.toString;\n\nvar hasOwn = Object.hasOwn || (function (obj, propName) { return (\n  hasOwnProperty.call(obj, propName)\n); });\n\nvar isArray = Array.isArray || (function (obj) { return (\n  toString.call(obj) === \"[object Array]\"\n); });\n\nvar regexpCache = Object.create(null);\n\nfunction wordsRegexp(words) {\n  return regexpCache[words] || (regexpCache[words] = new RegExp(\"^(?:\" + words.replace(/ /g, \"|\") + \")$\"))\n}\n\nfunction codePointToString(code) {\n  // UTF-16 Decoding\n  if (code <= 0xFFFF) { return String.fromCharCode(code) }\n  code -= 0x10000;\n  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)\n}\n\nvar loneSurrogate = /(?:[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF])/;\n\n// These are used when `options.locations` is on, for the\n// `startLoc` and `endLoc` properties.\n\nvar Position = function Position(line, col) {\n  this.line = line;\n  this.column = col;\n};\n\nPosition.prototype.offset = function offset (n) {\n  return new Position(this.line, this.column + n)\n};\n\nvar SourceLocation = function SourceLocation(p, start, end) {\n  this.start = start;\n  this.end = end;\n  if (p.sourceFile !== null) { this.source = p.sourceFile; }\n};\n\n// The `getLineInfo` function is mostly useful when the\n// `locations` option is off (for performance reasons) and you\n// want to find the line/column position for a given character\n// offset. `input` should be the code string that the offset refers\n// into.\n\nfunction getLineInfo(input, offset) {\n  for (var line = 1, cur = 0;;) {\n    var nextBreak = nextLineBreak(input, cur, offset);\n    if (nextBreak < 0) { return new Position(line, offset - cur) }\n    ++line;\n    cur = nextBreak;\n  }\n}\n\n// A second argument must be given to configure the parser process.\n// These options are recognized (only `ecmaVersion` is required):\n\nvar defaultOptions = {\n  // `ecmaVersion` indicates the ECMAScript version to parse. Must be\n  // either 3, 5, 6 (or 2015), 7 (2016), 8 (2017), 9 (2018), 10\n  // (2019), 11 (2020), 12 (2021), 13 (2022), 14 (2023), or `\"latest\"`\n  // (the latest version the library supports). This influences\n  // support for strict mode, the set of reserved words, and support\n  // for new syntax features.\n  ecmaVersion: null,\n  // `sourceType` indicates the mode the code should be parsed in.\n  // Can be either `\"script\"` or `\"module\"`. This influences global\n  // strict mode and parsing of `import` and `export` declarations.\n  sourceType: \"script\",\n  // `onInsertedSemicolon` can be a callback that will be called when\n  // a semicolon is automatically inserted. It will be passed the\n  // position of the inserted semicolon as an offset, and if\n  // `locations` is enabled, it is given the location as a `{line,\n  // column}` object as second argument.\n  onInsertedSemicolon: null,\n  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for\n  // trailing commas.\n  onTrailingComma: null,\n  // By default, reserved words are only enforced if ecmaVersion >= 5.\n  // Set `allowReserved` to a boolean value to explicitly turn this on\n  // an off. When this option has the value \"never\", reserved words\n  // and keywords can also not be used as property names.\n  allowReserved: null,\n  // When enabled, a return at the top level is not considered an\n  // error.\n  allowReturnOutsideFunction: false,\n  // When enabled, import/export statements are not constrained to\n  // appearing at the top of the program, and an import.meta expression\n  // in a script isn't considered an error.\n  allowImportExportEverywhere: false,\n  // By default, await identifiers are allowed to appear at the top-level scope only if ecmaVersion >= 2022.\n  // When enabled, await identifiers are allowed to appear at the top-level scope,\n  // but they are still not allowed in non-async functions.\n  allowAwaitOutsideFunction: null,\n  // When enabled, super identifiers are not constrained to\n  // appearing in methods and do not raise an error when they appear elsewhere.\n  allowSuperOutsideMethod: null,\n  // When enabled, hashbang directive in the beginning of file is\n  // allowed and treated as a line comment. Enabled by default when\n  // `ecmaVersion` >= 2023.\n  allowHashBang: false,\n  // By default, the parser will verify that private properties are\n  // only used in places where they are valid and have been declared.\n  // Set this to false to turn such checks off.\n  checkPrivateFields: true,\n  // When `locations` is on, `loc` properties holding objects with\n  // `start` and `end` properties in `{line, column}` form (with\n  // line being 1-based and column 0-based) will be attached to the\n  // nodes.\n  locations: false,\n  // A function can be passed as `onToken` option, which will\n  // cause Acorn to call that function with object in the same\n  // format as tokens returned from `tokenizer().getToken()`. Note\n  // that you are not allowed to call the parser from the\n  // callback—that will corrupt its internal state.\n  onToken: null,\n  // A function can be passed as `onComment` option, which will\n  // cause Acorn to call that function with `(block, text, start,\n  // end)` parameters whenever a comment is skipped. `block` is a\n  // boolean indicating whether this is a block (`/* */`) comment,\n  // `text` is the content of the comment, and `start` and `end` are\n  // character offsets that denote the start and end of the comment.\n  // When the `locations` option is on, two more parameters are\n  // passed, the full `{line, column}` locations of the start and\n  // end of the comments. Note that you are not allowed to call the\n  // parser from the callback—that will corrupt its internal state.\n  // When this option has an array as value, objects representing the\n  // comments are pushed to it.\n  onComment: null,\n  // Nodes have their start and end characters offsets recorded in\n  // `start` and `end` properties (directly on the node, rather than\n  // the `loc` object, which holds line/column data. To also add a\n  // [semi-standardized][range] `range` property holding a `[start,\n  // end]` array with the same numbers, set the `ranges` option to\n  // `true`.\n  //\n  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678\n  ranges: false,\n  // It is possible to parse multiple files into a single AST by\n  // passing the tree produced by parsing the first file as\n  // `program` option in subsequent parses. This will add the\n  // toplevel forms of the parsed file to the `Program` (top) node\n  // of an existing parse tree.\n  program: null,\n  // When `locations` is on, you can pass this to record the source\n  // file in every node's `loc` object.\n  sourceFile: null,\n  // This value, if given, is stored in every node, whether\n  // `locations` is on or off.\n  directSourceFile: null,\n  // When enabled, parenthesized expressions are represented by\n  // (non-standard) ParenthesizedExpression nodes\n  preserveParens: false\n};\n\n// Interpret and default an options object\n\nvar warnedAboutEcmaVersion = false;\n\nfunction getOptions(opts) {\n  var options = {};\n\n  for (var opt in defaultOptions)\n    { options[opt] = opts && hasOwn(opts, opt) ? opts[opt] : defaultOptions[opt]; }\n\n  if (options.ecmaVersion === \"latest\") {\n    options.ecmaVersion = 1e8;\n  } else if (options.ecmaVersion == null) {\n    if (!warnedAboutEcmaVersion && typeof console === \"object\" && console.warn) {\n      warnedAboutEcmaVersion = true;\n      console.warn(\"Since Acorn 8.0.0, options.ecmaVersion is required.\\nDefaulting to 2020, but this will stop working in the future.\");\n    }\n    options.ecmaVersion = 11;\n  } else if (options.ecmaVersion >= 2015) {\n    options.ecmaVersion -= 2009;\n  }\n\n  if (options.allowReserved == null)\n    { options.allowReserved = options.ecmaVersion < 5; }\n\n  if (!opts || opts.allowHashBang == null)\n    { options.allowHashBang = options.ecmaVersion >= 14; }\n\n  if (isArray(options.onToken)) {\n    var tokens = options.onToken;\n    options.onToken = function (token) { return tokens.push(token); };\n  }\n  if (isArray(options.onComment))\n    { options.onComment = pushComment(options, options.onComment); }\n\n  return options\n}\n\nfunction pushComment(options, array) {\n  return function(block, text, start, end, startLoc, endLoc) {\n    var comment = {\n      type: block ? \"Block\" : \"Line\",\n      value: text,\n      start: start,\n      end: end\n    };\n    if (options.locations)\n      { comment.loc = new SourceLocation(this, startLoc, endLoc); }\n    if (options.ranges)\n      { comment.range = [start, end]; }\n    array.push(comment);\n  }\n}\n\n// Each scope gets a bitset that may contain these flags\nvar\n    SCOPE_TOP = 1,\n    SCOPE_FUNCTION = 2,\n    SCOPE_ASYNC = 4,\n    SCOPE_GENERATOR = 8,\n    SCOPE_ARROW = 16,\n    SCOPE_SIMPLE_CATCH = 32,\n    SCOPE_SUPER = 64,\n    SCOPE_DIRECT_SUPER = 128,\n    SCOPE_CLASS_STATIC_BLOCK = 256,\n    SCOPE_CLASS_FIELD_INIT = 512,\n    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION | SCOPE_CLASS_STATIC_BLOCK;\n\nfunction functionFlags(async, generator) {\n  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)\n}\n\n// Used in checkLVal* and declareName to determine the type of a binding\nvar\n    BIND_NONE = 0, // Not a binding\n    BIND_VAR = 1, // Var-style binding\n    BIND_LEXICAL = 2, // Let- or const-style binding\n    BIND_FUNCTION = 3, // Function declaration\n    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding\n    BIND_OUTSIDE = 5; // Special case for function names as bound inside the function\n\nvar Parser = function Parser(options, input, startPos) {\n  this.options = options = getOptions(options);\n  this.sourceFile = options.sourceFile;\n  this.keywords = wordsRegexp(keywords$1[options.ecmaVersion >= 6 ? 6 : options.sourceType === \"module\" ? \"5module\" : 5]);\n  var reserved = \"\";\n  if (options.allowReserved !== true) {\n    reserved = reservedWords[options.ecmaVersion >= 6 ? 6 : options.ecmaVersion === 5 ? 5 : 3];\n    if (options.sourceType === \"module\") { reserved += \" await\"; }\n  }\n  this.reservedWords = wordsRegexp(reserved);\n  var reservedStrict = (reserved ? reserved + \" \" : \"\") + reservedWords.strict;\n  this.reservedWordsStrict = wordsRegexp(reservedStrict);\n  this.reservedWordsStrictBind = wordsRegexp(reservedStrict + \" \" + reservedWords.strictBind);\n  this.input = String(input);\n\n  // Used to signal to callers of `readWord1` whether the word\n  // contained any escape sequences. This is needed because words with\n  // escape sequences must not be interpreted as keywords.\n  this.containsEsc = false;\n\n  // Set up token state\n\n  // The current position of the tokenizer in the input.\n  if (startPos) {\n    this.pos = startPos;\n    this.lineStart = this.input.lastIndexOf(\"\\n\", startPos - 1) + 1;\n    this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;\n  } else {\n    this.pos = this.lineStart = 0;\n    this.curLine = 1;\n  }\n\n  // Properties of the current token:\n  // Its type\n  this.type = types$1.eof;\n  // For tokens that include more information than their type, the value\n  this.value = null;\n  // Its start and end offset\n  this.start = this.end = this.pos;\n  // And, if locations are used, the {line, column} object\n  // corresponding to those offsets\n  this.startLoc = this.endLoc = this.curPosition();\n\n  // Position information for the previous token\n  this.lastTokEndLoc = this.lastTokStartLoc = null;\n  this.lastTokStart = this.lastTokEnd = this.pos;\n\n  // The context stack is used to superficially track syntactic\n  // context to predict whether a regular expression is allowed in a\n  // given position.\n  this.context = this.initialContext();\n  this.exprAllowed = true;\n\n  // Figure out if it's a module code.\n  this.inModule = options.sourceType === \"module\";\n  this.strict = this.inModule || this.strictDirective(this.pos);\n\n  // Used to signify the start of a potential arrow function\n  this.potentialArrowAt = -1;\n  this.potentialArrowInForAwait = false;\n\n  // Positions to delayed-check that yield/await does not exist in default parameters.\n  this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;\n  // Labels in scope.\n  this.labels = [];\n  // Thus-far undefined exports.\n  this.undefinedExports = Object.create(null);\n\n  // If enabled, skip leading hashbang line.\n  if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === \"#!\")\n    { this.skipLineComment(2); }\n\n  // Scope tracking for duplicate variable names (see scope.js)\n  this.scopeStack = [];\n  this.enterScope(SCOPE_TOP);\n\n  // For RegExp validation\n  this.regexpState = null;\n\n  // The stack of private names.\n  // Each element has two properties: 'declared' and 'used'.\n  // When it exited from the outermost class definition, all used private names must be declared.\n  this.privateNameStack = [];\n};\n\nvar prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },canAwait: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true },allowNewDotTarget: { configurable: true },inClassStaticBlock: { configurable: true } };\n\nParser.prototype.parse = function parse () {\n  var node = this.options.program || this.startNode();\n  this.nextToken();\n  return this.parseTopLevel(node)\n};\n\nprototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };\n\nprototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 };\n\nprototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 };\n\nprototypeAccessors.canAwait.get = function () {\n  for (var i = this.scopeStack.length - 1; i >= 0; i--) {\n    var ref = this.scopeStack[i];\n      var flags = ref.flags;\n    if (flags & (SCOPE_CLASS_STATIC_BLOCK | SCOPE_CLASS_FIELD_INIT)) { return false }\n    if (flags & SCOPE_FUNCTION) { return (flags & SCOPE_ASYNC) > 0 }\n  }\n  return (this.inModule && this.options.ecmaVersion >= 13) || this.options.allowAwaitOutsideFunction\n};\n\nprototypeAccessors.allowSuper.get = function () {\n  var ref = this.currentThisScope();\n    var flags = ref.flags;\n  return (flags & SCOPE_SUPER) > 0 || this.options.allowSuperOutsideMethod\n};\n\nprototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };\n\nprototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };\n\nprototypeAccessors.allowNewDotTarget.get = function () {\n  for (var i = this.scopeStack.length - 1; i >= 0; i--) {\n    var ref = this.scopeStack[i];\n      var flags = ref.flags;\n    if (flags & (SCOPE_CLASS_STATIC_BLOCK | SCOPE_CLASS_FIELD_INIT) ||\n        ((flags & SCOPE_FUNCTION) && !(flags & SCOPE_ARROW))) { return true }\n  }\n  return false\n};\n\nprototypeAccessors.inClassStaticBlock.get = function () {\n  return (this.currentVarScope().flags & SCOPE_CLASS_STATIC_BLOCK) > 0\n};\n\nParser.extend = function extend () {\n    var plugins = [], len = arguments.length;\n    while ( len-- ) plugins[ len ] = arguments[ len ];\n\n  var cls = this;\n  for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }\n  return cls\n};\n\nParser.parse = function parse (input, options) {\n  return new this(options, input).parse()\n};\n\nParser.parseExpressionAt = function parseExpressionAt (input, pos, options) {\n  var parser = new this(options, input, pos);\n  parser.nextToken();\n  return parser.parseExpression()\n};\n\nParser.tokenizer = function tokenizer (input, options) {\n  return new this(options, input)\n};\n\nObject.defineProperties( Parser.prototype, prototypeAccessors );\n\nvar pp$9 = Parser.prototype;\n\n// ## Parser utilities\n\nvar literal = /^(?:'((?:\\\\[^]|[^'\\\\])*?)'|\"((?:\\\\[^]|[^\"\\\\])*?)\")/;\npp$9.strictDirective = function(start) {\n  if (this.options.ecmaVersion < 5) { return false }\n  for (;;) {\n    // Try to find string literal.\n    skipWhiteSpace.lastIndex = start;\n    start += skipWhiteSpace.exec(this.input)[0].length;\n    var match = literal.exec(this.input.slice(start));\n    if (!match) { return false }\n    if ((match[1] || match[2]) === \"use strict\") {\n      skipWhiteSpace.lastIndex = start + match[0].length;\n      var spaceAfter = skipWhiteSpace.exec(this.input), end = spaceAfter.index + spaceAfter[0].length;\n      var next = this.input.charAt(end);\n      return next === \";\" || next === \"}\" ||\n        (lineBreak.test(spaceAfter[0]) &&\n         !(/[(`.[+\\-/*%<>=,?^&]/.test(next) || next === \"!\" && this.input.charAt(end + 1) === \"=\"))\n    }\n    start += match[0].length;\n\n    // Skip semicolon, if any.\n    skipWhiteSpace.lastIndex = start;\n    start += skipWhiteSpace.exec(this.input)[0].length;\n    if (this.input[start] === \";\")\n      { start++; }\n  }\n};\n\n// Predicate that tests whether the next token is of the given\n// type, and if yes, consumes it as a side effect.\n\npp$9.eat = function(type) {\n  if (this.type === type) {\n    this.next();\n    return true\n  } else {\n    return false\n  }\n};\n\n// Tests whether parsed token is a contextual keyword.\n\npp$9.isContextual = function(name) {\n  return this.type === types$1.name && this.value === name && !this.containsEsc\n};\n\n// Consumes contextual keyword if possible.\n\npp$9.eatContextual = function(name) {\n  if (!this.isContextual(name)) { return false }\n  this.next();\n  return true\n};\n\n// Asserts that following token is given contextual keyword.\n\npp$9.expectContextual = function(name) {\n  if (!this.eatContextual(name)) { this.unexpected(); }\n};\n\n// Test whether a semicolon can be inserted at the current position.\n\npp$9.canInsertSemicolon = function() {\n  return this.type === types$1.eof ||\n    this.type === types$1.braceR ||\n    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n};\n\npp$9.insertSemicolon = function() {\n  if (this.canInsertSemicolon()) {\n    if (this.options.onInsertedSemicolon)\n      { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }\n    return true\n  }\n};\n\n// Consume a semicolon, or, failing that, see if we are allowed to\n// pretend that there is a semicolon at this position.\n\npp$9.semicolon = function() {\n  if (!this.eat(types$1.semi) && !this.insertSemicolon()) { this.unexpected(); }\n};\n\npp$9.afterTrailingComma = function(tokType, notNext) {\n  if (this.type === tokType) {\n    if (this.options.onTrailingComma)\n      { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }\n    if (!notNext)\n      { this.next(); }\n    return true\n  }\n};\n\n// Expect a token of a given type. If found, consume it, otherwise,\n// raise an unexpected token error.\n\npp$9.expect = function(type) {\n  this.eat(type) || this.unexpected();\n};\n\n// Raise an unexpected token error.\n\npp$9.unexpected = function(pos) {\n  this.raise(pos != null ? pos : this.start, \"Unexpected token\");\n};\n\nvar DestructuringErrors = function DestructuringErrors() {\n  this.shorthandAssign =\n  this.trailingComma =\n  this.parenthesizedAssign =\n  this.parenthesizedBind =\n  this.doubleProto =\n    -1;\n};\n\npp$9.checkPatternErrors = function(refDestructuringErrors, isAssign) {\n  if (!refDestructuringErrors) { return }\n  if (refDestructuringErrors.trailingComma > -1)\n    { this.raiseRecoverable(refDestructuringErrors.trailingComma, \"Comma is not permitted after the rest element\"); }\n  var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;\n  if (parens > -1) { this.raiseRecoverable(parens, isAssign ? \"Assigning to rvalue\" : \"Parenthesized pattern\"); }\n};\n\npp$9.checkExpressionErrors = function(refDestructuringErrors, andThrow) {\n  if (!refDestructuringErrors) { return false }\n  var shorthandAssign = refDestructuringErrors.shorthandAssign;\n  var doubleProto = refDestructuringErrors.doubleProto;\n  if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }\n  if (shorthandAssign >= 0)\n    { this.raise(shorthandAssign, \"Shorthand property assignments are valid only in destructuring patterns\"); }\n  if (doubleProto >= 0)\n    { this.raiseRecoverable(doubleProto, \"Redefinition of __proto__ property\"); }\n};\n\npp$9.checkYieldAwaitInDefaultParams = function() {\n  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))\n    { this.raise(this.yieldPos, \"Yield expression cannot be a default value\"); }\n  if (this.awaitPos)\n    { this.raise(this.awaitPos, \"Await expression cannot be a default value\"); }\n};\n\npp$9.isSimpleAssignTarget = function(expr) {\n  if (expr.type === \"ParenthesizedExpression\")\n    { return this.isSimpleAssignTarget(expr.expression) }\n  return expr.type === \"Identifier\" || expr.type === \"MemberExpression\"\n};\n\nvar pp$8 = Parser.prototype;\n\n// ### Statement parsing\n\n// Parse a program. Initializes the parser, reads any number of\n// statements, and wraps them in a Program node.  Optionally takes a\n// `program` argument.  If present, the statements will be appended\n// to its body instead of creating a new node.\n\npp$8.parseTopLevel = function(node) {\n  var exports = Object.create(null);\n  if (!node.body) { node.body = []; }\n  while (this.type !== types$1.eof) {\n    var stmt = this.parseStatement(null, true, exports);\n    node.body.push(stmt);\n  }\n  if (this.inModule)\n    { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)\n      {\n        var name = list[i];\n\n        this.raiseRecoverable(this.undefinedExports[name].start, (\"Export '\" + name + \"' is not defined\"));\n      } }\n  this.adaptDirectivePrologue(node.body);\n  this.next();\n  node.sourceType = this.options.sourceType;\n  return this.finishNode(node, \"Program\")\n};\n\nvar loopLabel = {kind: \"loop\"}, switchLabel = {kind: \"switch\"};\n\npp$8.isLet = function(context) {\n  if (this.options.ecmaVersion < 6 || !this.isContextual(\"let\")) { return false }\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n  // For ambiguous cases, determine if a LexicalDeclaration (or only a\n  // Statement) is allowed here. If context is not empty then only a Statement\n  // is allowed. However, `let [` is an explicit negative lookahead for\n  // ExpressionStatement, so special-case it first.\n  if (nextCh === 91 || nextCh === 92) { return true } // '[', '\\'\n  if (context) { return false }\n\n  if (nextCh === 123 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true } // '{', astral\n  if (isIdentifierStart(nextCh, true)) {\n    var pos = next + 1;\n    while (isIdentifierChar(nextCh = this.input.charCodeAt(pos), true)) { ++pos; }\n    if (nextCh === 92 || nextCh > 0xd7ff && nextCh < 0xdc00) { return true }\n    var ident = this.input.slice(next, pos);\n    if (!keywordRelationalOperator.test(ident)) { return true }\n  }\n  return false\n};\n\n// check 'async [no LineTerminator here] function'\n// - 'async /*foo*/ function' is OK.\n// - 'async /*\\n*/ function' is invalid.\npp$8.isAsyncFunction = function() {\n  if (this.options.ecmaVersion < 8 || !this.isContextual(\"async\"))\n    { return false }\n\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length, after;\n  return !lineBreak.test(this.input.slice(this.pos, next)) &&\n    this.input.slice(next, next + 8) === \"function\" &&\n    (next + 8 === this.input.length ||\n     !(isIdentifierChar(after = this.input.charCodeAt(next + 8)) || after > 0xd7ff && after < 0xdc00))\n};\n\npp$8.isUsingKeyword = function(isAwaitUsing, isFor) {\n  if (this.options.ecmaVersion < 17 || !this.isContextual(isAwaitUsing ? \"await\" : \"using\"))\n    { return false }\n\n  skipWhiteSpace.lastIndex = this.pos;\n  var skip = skipWhiteSpace.exec(this.input);\n  var next = this.pos + skip[0].length;\n\n  if (lineBreak.test(this.input.slice(this.pos, next))) { return false }\n\n  if (isAwaitUsing) {\n    var awaitEndPos = next + 5 /* await */, after;\n    if (this.input.slice(next, awaitEndPos) !== \"using\" ||\n      awaitEndPos === this.input.length ||\n      isIdentifierChar(after = this.input.charCodeAt(awaitEndPos)) ||\n      (after > 0xd7ff && after < 0xdc00)\n    ) { return false }\n\n    skipWhiteSpace.lastIndex = awaitEndPos;\n    var skipAfterUsing = skipWhiteSpace.exec(this.input);\n    if (skipAfterUsing && lineBreak.test(this.input.slice(awaitEndPos, awaitEndPos + skipAfterUsing[0].length))) { return false }\n  }\n\n  if (isFor) {\n    var ofEndPos = next + 2 /* of */, after$1;\n    if (this.input.slice(next, ofEndPos) === \"of\") {\n      if (ofEndPos === this.input.length ||\n        (!isIdentifierChar(after$1 = this.input.charCodeAt(ofEndPos)) && !(after$1 > 0xd7ff && after$1 < 0xdc00))) { return false }\n    }\n  }\n\n  var ch = this.input.charCodeAt(next);\n  return isIdentifierStart(ch, true) || ch === 92 // '\\'\n};\n\npp$8.isAwaitUsing = function(isFor) {\n  return this.isUsingKeyword(true, isFor)\n};\n\npp$8.isUsing = function(isFor) {\n  return this.isUsingKeyword(false, isFor)\n};\n\n// Parse a single statement.\n//\n// If expecting a statement and finding a slash operator, parse a\n// regular expression literal. This is to handle cases like\n// `if (foo) /blah/.exec(foo)`, where looking at the previous token\n// does not help.\n\npp$8.parseStatement = function(context, topLevel, exports) {\n  var starttype = this.type, node = this.startNode(), kind;\n\n  if (this.isLet(context)) {\n    starttype = types$1._var;\n    kind = \"let\";\n  }\n\n  // Most types of statements are recognized by the keyword they\n  // start with. Many are trivial to parse, some require a bit of\n  // complexity.\n\n  switch (starttype) {\n  case types$1._break: case types$1._continue: return this.parseBreakContinueStatement(node, starttype.keyword)\n  case types$1._debugger: return this.parseDebuggerStatement(node)\n  case types$1._do: return this.parseDoStatement(node)\n  case types$1._for: return this.parseForStatement(node)\n  case types$1._function:\n    // Function as sole body of either an if statement or a labeled statement\n    // works, but not when it is part of a labeled statement that is the sole\n    // body of an if statement.\n    if ((context && (this.strict || context !== \"if\" && context !== \"label\")) && this.options.ecmaVersion >= 6) { this.unexpected(); }\n    return this.parseFunctionStatement(node, false, !context)\n  case types$1._class:\n    if (context) { this.unexpected(); }\n    return this.parseClass(node, true)\n  case types$1._if: return this.parseIfStatement(node)\n  case types$1._return: return this.parseReturnStatement(node)\n  case types$1._switch: return this.parseSwitchStatement(node)\n  case types$1._throw: return this.parseThrowStatement(node)\n  case types$1._try: return this.parseTryStatement(node)\n  case types$1._const: case types$1._var:\n    kind = kind || this.value;\n    if (context && kind !== \"var\") { this.unexpected(); }\n    return this.parseVarStatement(node, kind)\n  case types$1._while: return this.parseWhileStatement(node)\n  case types$1._with: return this.parseWithStatement(node)\n  case types$1.braceL: return this.parseBlock(true, node)\n  case types$1.semi: return this.parseEmptyStatement(node)\n  case types$1._export:\n  case types$1._import:\n    if (this.options.ecmaVersion > 10 && starttype === types$1._import) {\n      skipWhiteSpace.lastIndex = this.pos;\n      var skip = skipWhiteSpace.exec(this.input);\n      var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);\n      if (nextCh === 40 || nextCh === 46) // '(' or '.'\n        { return this.parseExpressionStatement(node, this.parseExpression()) }\n    }\n\n    if (!this.options.allowImportExportEverywhere) {\n      if (!topLevel)\n        { this.raise(this.start, \"'import' and 'export' may only appear at the top level\"); }\n      if (!this.inModule)\n        { this.raise(this.start, \"'import' and 'export' may appear only with 'sourceType: module'\"); }\n    }\n    return starttype === types$1._import ? this.parseImport(node) : this.parseExport(node, exports)\n\n    // If the statement does not start with a statement keyword or a\n    // brace, it's an ExpressionStatement or LabeledStatement. We\n    // simply start parsing an expression, and afterwards, if the\n    // next token is a colon and the expression was a simple\n    // Identifier node, we switch to interpreting it as a label.\n  default:\n    if (this.isAsyncFunction()) {\n      if (context) { this.unexpected(); }\n      this.next();\n      return this.parseFunctionStatement(node, true, !context)\n    }\n\n    var usingKind = this.isAwaitUsing(false) ? \"await using\" : this.isUsing(false) ? \"using\" : null;\n    if (usingKind) {\n      if (topLevel && this.options.sourceType === \"script\") {\n        this.raise(this.start, \"Using declaration cannot appear in the top level when source type is `script`\");\n      }\n      if (usingKind === \"await using\") {\n        if (!this.canAwait) {\n          this.raise(this.start, \"Await using cannot appear outside of async function\");\n        }\n        this.next();\n      }\n      this.next();\n      this.parseVar(node, false, usingKind);\n      this.semicolon();\n      return this.finishNode(node, \"VariableDeclaration\")\n    }\n\n    var maybeName = this.value, expr = this.parseExpression();\n    if (starttype === types$1.name && expr.type === \"Identifier\" && this.eat(types$1.colon))\n      { return this.parseLabeledStatement(node, maybeName, expr, context) }\n    else { return this.parseExpressionStatement(node, expr) }\n  }\n};\n\npp$8.parseBreakContinueStatement = function(node, keyword) {\n  var isBreak = keyword === \"break\";\n  this.next();\n  if (this.eat(types$1.semi) || this.insertSemicolon()) { node.label = null; }\n  else if (this.type !== types$1.name) { this.unexpected(); }\n  else {\n    node.label = this.parseIdent();\n    this.semicolon();\n  }\n\n  // Verify that there is an actual destination to break or\n  // continue to.\n  var i = 0;\n  for (; i < this.labels.length; ++i) {\n    var lab = this.labels[i];\n    if (node.label == null || lab.name === node.label.name) {\n      if (lab.kind != null && (isBreak || lab.kind === \"loop\")) { break }\n      if (node.label && isBreak) { break }\n    }\n  }\n  if (i === this.labels.length) { this.raise(node.start, \"Unsyntactic \" + keyword); }\n  return this.finishNode(node, isBreak ? \"BreakStatement\" : \"ContinueStatement\")\n};\n\npp$8.parseDebuggerStatement = function(node) {\n  this.next();\n  this.semicolon();\n  return this.finishNode(node, \"DebuggerStatement\")\n};\n\npp$8.parseDoStatement = function(node) {\n  this.next();\n  this.labels.push(loopLabel);\n  node.body = this.parseStatement(\"do\");\n  this.labels.pop();\n  this.expect(types$1._while);\n  node.test = this.parseParenExpression();\n  if (this.options.ecmaVersion >= 6)\n    { this.eat(types$1.semi); }\n  else\n    { this.semicolon(); }\n  return this.finishNode(node, \"DoWhileStatement\")\n};\n\n// Disambiguating between a `for` and a `for`/`in` or `for`/`of`\n// loop is non-trivial. Basically, we have to parse the init `var`\n// statement or expression, disallowing the `in` operator (see\n// the second parameter to `parseExpression`), and then check\n// whether the next token is `in` or `of`. When there is no init\n// part (semicolon immediately after the opening parenthesis), it\n// is a regular `for` loop.\n\npp$8.parseForStatement = function(node) {\n  this.next();\n  var awaitAt = (this.options.ecmaVersion >= 9 && this.canAwait && this.eatContextual(\"await\")) ? this.lastTokStart : -1;\n  this.labels.push(loopLabel);\n  this.enterScope(0);\n  this.expect(types$1.parenL);\n  if (this.type === types$1.semi) {\n    if (awaitAt > -1) { this.unexpected(awaitAt); }\n    return this.parseFor(node, null)\n  }\n  var isLet = this.isLet();\n  if (this.type === types$1._var || this.type === types$1._const || isLet) {\n    var init$1 = this.startNode(), kind = isLet ? \"let\" : this.value;\n    this.next();\n    this.parseVar(init$1, true, kind);\n    this.finishNode(init$1, \"VariableDeclaration\");\n    return this.parseForAfterInit(node, init$1, awaitAt)\n  }\n  var startsWithLet = this.isContextual(\"let\"), isForOf = false;\n\n  var usingKind = this.isUsing(true) ? \"using\" : this.isAwaitUsing(true) ? \"await using\" : null;\n  if (usingKind) {\n    var init$2 = this.startNode();\n    this.next();\n    if (usingKind === \"await using\") { this.next(); }\n    this.parseVar(init$2, true, usingKind);\n    this.finishNode(init$2, \"VariableDeclaration\");\n    return this.parseForAfterInit(node, init$2, awaitAt)\n  }\n  var containsEsc = this.containsEsc;\n  var refDestructuringErrors = new DestructuringErrors;\n  var initPos = this.start;\n  var init = awaitAt > -1\n    ? this.parseExprSubscripts(refDestructuringErrors, \"await\")\n    : this.parseExpression(true, refDestructuringErrors);\n  if (this.type === types$1._in || (isForOf = this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) {\n    if (awaitAt > -1) { // implies `ecmaVersion >= 9` (see declaration of awaitAt)\n      if (this.type === types$1._in) { this.unexpected(awaitAt); }\n      node.await = true;\n    } else if (isForOf && this.options.ecmaVersion >= 8) {\n      if (init.start === initPos && !containsEsc && init.type === \"Identifier\" && init.name === \"async\") { this.unexpected(); }\n      else if (this.options.ecmaVersion >= 9) { node.await = false; }\n    }\n    if (startsWithLet && isForOf) { this.raise(init.start, \"The left-hand side of a for-of loop may not start with 'let'.\"); }\n    this.toAssignable(init, false, refDestructuringErrors);\n    this.checkLValPattern(init);\n    return this.parseForIn(node, init)\n  } else {\n    this.checkExpressionErrors(refDestructuringErrors, true);\n  }\n  if (awaitAt > -1) { this.unexpected(awaitAt); }\n  return this.parseFor(node, init)\n};\n\n// Helper method to parse for loop after variable initialization\npp$8.parseForAfterInit = function(node, init, awaitAt) {\n  if ((this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) && init.declarations.length === 1) {\n    if (this.options.ecmaVersion >= 9) {\n      if (this.type === types$1._in) {\n        if (awaitAt > -1) { this.unexpected(awaitAt); }\n      } else { node.await = awaitAt > -1; }\n    }\n    return this.parseForIn(node, init)\n  }\n  if (awaitAt > -1) { this.unexpected(awaitAt); }\n  return this.parseFor(node, init)\n};\n\npp$8.parseFunctionStatement = function(node, isAsync, declarationPosition) {\n  this.next();\n  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)\n};\n\npp$8.parseIfStatement = function(node) {\n  this.next();\n  node.test = this.parseParenExpression();\n  // allow function declarations in branches, but only in non-strict mode\n  node.consequent = this.parseStatement(\"if\");\n  node.alternate = this.eat(types$1._else) ? this.parseStatement(\"if\") : null;\n  return this.finishNode(node, \"IfStatement\")\n};\n\npp$8.parseReturnStatement = function(node) {\n  if (!this.inFunction && !this.options.allowReturnOutsideFunction)\n    { this.raise(this.start, \"'return' outside of function\"); }\n  this.next();\n\n  // In `return` (and `break`/`continue`), the keywords with\n  // optional arguments, we eagerly look for a semicolon or the\n  // possibility to insert one.\n\n  if (this.eat(types$1.semi) || this.insertSemicolon()) { node.argument = null; }\n  else { node.argument = this.parseExpression(); this.semicolon(); }\n  return this.finishNode(node, \"ReturnStatement\")\n};\n\npp$8.parseSwitchStatement = function(node) {\n  this.next();\n  node.discriminant = this.parseParenExpression();\n  node.cases = [];\n  this.expect(types$1.braceL);\n  this.labels.push(switchLabel);\n  this.enterScope(0);\n\n  // Statements under must be grouped (by label) in SwitchCase\n  // nodes. `cur` is used to keep the node that we are currently\n  // adding statements to.\n\n  var cur;\n  for (var sawDefault = false; this.type !== types$1.braceR;) {\n    if (this.type === types$1._case || this.type === types$1._default) {\n      var isCase = this.type === types$1._case;\n      if (cur) { this.finishNode(cur, \"SwitchCase\"); }\n      node.cases.push(cur = this.startNode());\n      cur.consequent = [];\n      this.next();\n      if (isCase) {\n        cur.test = this.parseExpression();\n      } else {\n        if (sawDefault) { this.raiseRecoverable(this.lastTokStart, \"Multiple default clauses\"); }\n        sawDefault = true;\n        cur.test = null;\n      }\n      this.expect(types$1.colon);\n    } else {\n      if (!cur) { this.unexpected(); }\n      cur.consequent.push(this.parseStatement(null));\n    }\n  }\n  this.exitScope();\n  if (cur) { this.finishNode(cur, \"SwitchCase\"); }\n  this.next(); // Closing brace\n  this.labels.pop();\n  return this.finishNode(node, \"SwitchStatement\")\n};\n\npp$8.parseThrowStatement = function(node) {\n  this.next();\n  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))\n    { this.raise(this.lastTokEnd, \"Illegal newline after throw\"); }\n  node.argument = this.parseExpression();\n  this.semicolon();\n  return this.finishNode(node, \"ThrowStatement\")\n};\n\n// Reused empty array added for node fields that are always empty.\n\nvar empty$1 = [];\n\npp$8.parseCatchClauseParam = function() {\n  var param = this.parseBindingAtom();\n  var simple = param.type === \"Identifier\";\n  this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);\n  this.checkLValPattern(param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);\n  this.expect(types$1.parenR);\n\n  return param\n};\n\npp$8.parseTryStatement = function(node) {\n  this.next();\n  node.block = this.parseBlock();\n  node.handler = null;\n  if (this.type === types$1._catch) {\n    var clause = this.startNode();\n    this.next();\n    if (this.eat(types$1.parenL)) {\n      clause.param = this.parseCatchClauseParam();\n    } else {\n      if (this.options.ecmaVersion < 10) { this.unexpected(); }\n      clause.param = null;\n      this.enterScope(0);\n    }\n    clause.body = this.parseBlock(false);\n    this.exitScope();\n    node.handler = this.finishNode(clause, \"CatchClause\");\n  }\n  node.finalizer = this.eat(types$1._finally) ? this.parseBlock() : null;\n  if (!node.handler && !node.finalizer)\n    { this.raise(node.start, \"Missing catch or finally clause\"); }\n  return this.finishNode(node, \"TryStatement\")\n};\n\npp$8.parseVarStatement = function(node, kind, allowMissingInitializer) {\n  this.next();\n  this.parseVar(node, false, kind, allowMissingInitializer);\n  this.semicolon();\n  return this.finishNode(node, \"VariableDeclaration\")\n};\n\npp$8.parseWhileStatement = function(node) {\n  this.next();\n  node.test = this.parseParenExpression();\n  this.labels.push(loopLabel);\n  node.body = this.parseStatement(\"while\");\n  this.labels.pop();\n  return this.finishNode(node, \"WhileStatement\")\n};\n\npp$8.parseWithStatement = function(node) {\n  if (this.strict) { this.raise(this.start, \"'with' in strict mode\"); }\n  this.next();\n  node.object = this.parseParenExpression();\n  node.body = this.parseStatement(\"with\");\n  return this.finishNode(node, \"WithStatement\")\n};\n\npp$8.parseEmptyStatement = function(node) {\n  this.next();\n  return this.finishNode(node, \"EmptyStatement\")\n};\n\npp$8.parseLabeledStatement = function(node, maybeName, expr, context) {\n  for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)\n    {\n    var label = list[i$1];\n\n    if (label.name === maybeName)\n      { this.raise(expr.start, \"Label '\" + maybeName + \"' is already declared\");\n  } }\n  var kind = this.type.isLoop ? \"loop\" : this.type === types$1._switch ? \"switch\" : null;\n  for (var i = this.labels.length - 1; i >= 0; i--) {\n    var label$1 = this.labels[i];\n    if (label$1.statementStart === node.start) {\n      // Update information about previous labels on this node\n      label$1.statementStart = this.start;\n      label$1.kind = kind;\n    } else { break }\n  }\n  this.labels.push({name: maybeName, kind: kind, statementStart: this.start});\n  node.body = this.parseStatement(context ? context.indexOf(\"label\") === -1 ? context + \"label\" : context : \"label\");\n  this.labels.pop();\n  node.label = expr;\n  return this.finishNode(node, \"LabeledStatement\")\n};\n\npp$8.parseExpressionStatement = function(node, expr) {\n  node.expression = expr;\n  this.semicolon();\n  return this.finishNode(node, \"ExpressionStatement\")\n};\n\n// Parse a semicolon-enclosed block of statements, handling `\"use\n// strict\"` declarations when `allowStrict` is true (used for\n// function bodies).\n\npp$8.parseBlock = function(createNewLexicalScope, node, exitStrict) {\n  if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;\n  if ( node === void 0 ) node = this.startNode();\n\n  node.body = [];\n  this.expect(types$1.braceL);\n  if (createNewLexicalScope) { this.enterScope(0); }\n  while (this.type !== types$1.braceR) {\n    var stmt = this.parseStatement(null);\n    node.body.push(stmt);\n  }\n  if (exitStrict) { this.strict = false; }\n  this.next();\n  if (createNewLexicalScope) { this.exitScope(); }\n  return this.finishNode(node, \"BlockStatement\")\n};\n\n// Parse a regular `for` loop. The disambiguation code in\n// `parseStatement` will already have parsed the init statement or\n// expression.\n\npp$8.parseFor = function(node, init) {\n  node.init = init;\n  this.expect(types$1.semi);\n  node.test = this.type === types$1.semi ? null : this.parseExpression();\n  this.expect(types$1.semi);\n  node.update = this.type === types$1.parenR ? null : this.parseExpression();\n  this.expect(types$1.parenR);\n  node.body = this.parseStatement(\"for\");\n  this.exitScope();\n  this.labels.pop();\n  return this.finishNode(node, \"ForStatement\")\n};\n\n// Parse a `for`/`in` and `for`/`of` loop, which are almost\n// same from parser's perspective.\n\npp$8.parseForIn = function(node, init) {\n  var isForIn = this.type === types$1._in;\n  this.next();\n\n  if (\n    init.type === \"VariableDeclaration\" &&\n    init.declarations[0].init != null &&\n    (\n      !isForIn ||\n      this.options.ecmaVersion < 8 ||\n      this.strict ||\n      init.kind !== \"var\" ||\n      init.declarations[0].id.type !== \"Identifier\"\n    )\n  ) {\n    this.raise(\n      init.start,\n      ((isForIn ? \"for-in\" : \"for-of\") + \" loop variable declaration may not have an initializer\")\n    );\n  }\n  node.left = init;\n  node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();\n  this.expect(types$1.parenR);\n  node.body = this.parseStatement(\"for\");\n  this.exitScope();\n  this.labels.pop();\n  return this.finishNode(node, isForIn ? \"ForInStatement\" : \"ForOfStatement\")\n};\n\n// Parse a list of variable declarations.\n\npp$8.parseVar = function(node, isFor, kind, allowMissingInitializer) {\n  node.declarations = [];\n  node.kind = kind;\n  for (;;) {\n    var decl = this.startNode();\n    this.parseVarId(decl, kind);\n    if (this.eat(types$1.eq)) {\n      decl.init = this.parseMaybeAssign(isFor);\n    } else if (!allowMissingInitializer && kind === \"const\" && !(this.type === types$1._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\")))) {\n      this.unexpected();\n    } else if (!allowMissingInitializer && (kind === \"using\" || kind === \"await using\") && this.options.ecmaVersion >= 17 && this.type !== types$1._in && !this.isContextual(\"of\")) {\n      this.raise(this.lastTokEnd, (\"Missing initializer in \" + kind + \" declaration\"));\n    } else if (!allowMissingInitializer && decl.id.type !== \"Identifier\" && !(isFor && (this.type === types$1._in || this.isContextual(\"of\")))) {\n      this.raise(this.lastTokEnd, \"Complex binding patterns require an initialization value\");\n    } else {\n      decl.init = null;\n    }\n    node.declarations.push(this.finishNode(decl, \"VariableDeclarator\"));\n    if (!this.eat(types$1.comma)) { break }\n  }\n  return node\n};\n\npp$8.parseVarId = function(decl, kind) {\n  decl.id = kind === \"using\" || kind === \"await using\"\n    ? this.parseIdent()\n    : this.parseBindingAtom();\n\n  this.checkLValPattern(decl.id, kind === \"var\" ? BIND_VAR : BIND_LEXICAL, false);\n};\n\nvar FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;\n\n// Parse a function declaration or literal (depending on the\n// `statement & FUNC_STATEMENT`).\n\n// Remove `allowExpressionBody` for 7.0.0, as it is only called with false\npp$8.parseFunction = function(node, statement, allowExpressionBody, isAsync, forInit) {\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {\n    if (this.type === types$1.star && (statement & FUNC_HANGING_STATEMENT))\n      { this.unexpected(); }\n    node.generator = this.eat(types$1.star);\n  }\n  if (this.options.ecmaVersion >= 8)\n    { node.async = !!isAsync; }\n\n  if (statement & FUNC_STATEMENT) {\n    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types$1.name ? null : this.parseIdent();\n    if (node.id && !(statement & FUNC_HANGING_STATEMENT))\n      // If it is a regular function declaration in sloppy mode, then it is\n      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding\n      // mode depends on properties of the current scope (see\n      // treatFunctionsAsVar).\n      { this.checkLValSimple(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }\n  }\n\n  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n  this.enterScope(functionFlags(node.async, node.generator));\n\n  if (!(statement & FUNC_STATEMENT))\n    { node.id = this.type === types$1.name ? this.parseIdent() : null; }\n\n  this.parseFunctionParams(node);\n  this.parseFunctionBody(node, allowExpressionBody, false, forInit);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, (statement & FUNC_STATEMENT) ? \"FunctionDeclaration\" : \"FunctionExpression\")\n};\n\npp$8.parseFunctionParams = function(node) {\n  this.expect(types$1.parenL);\n  node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);\n  this.checkYieldAwaitInDefaultParams();\n};\n\n// Parse a class declaration or literal (depending on the\n// `isStatement` parameter).\n\npp$8.parseClass = function(node, isStatement) {\n  this.next();\n\n  // ecma-262 14.6 Class Definitions\n  // A class definition is always strict mode code.\n  var oldStrict = this.strict;\n  this.strict = true;\n\n  this.parseClassId(node, isStatement);\n  this.parseClassSuper(node);\n  var privateNameMap = this.enterClassBody();\n  var classBody = this.startNode();\n  var hadConstructor = false;\n  classBody.body = [];\n  this.expect(types$1.braceL);\n  while (this.type !== types$1.braceR) {\n    var element = this.parseClassElement(node.superClass !== null);\n    if (element) {\n      classBody.body.push(element);\n      if (element.type === \"MethodDefinition\" && element.kind === \"constructor\") {\n        if (hadConstructor) { this.raiseRecoverable(element.start, \"Duplicate constructor in the same class\"); }\n        hadConstructor = true;\n      } else if (element.key && element.key.type === \"PrivateIdentifier\" && isPrivateNameConflicted(privateNameMap, element)) {\n        this.raiseRecoverable(element.key.start, (\"Identifier '#\" + (element.key.name) + \"' has already been declared\"));\n      }\n    }\n  }\n  this.strict = oldStrict;\n  this.next();\n  node.body = this.finishNode(classBody, \"ClassBody\");\n  this.exitClassBody();\n  return this.finishNode(node, isStatement ? \"ClassDeclaration\" : \"ClassExpression\")\n};\n\npp$8.parseClassElement = function(constructorAllowsSuper) {\n  if (this.eat(types$1.semi)) { return null }\n\n  var ecmaVersion = this.options.ecmaVersion;\n  var node = this.startNode();\n  var keyName = \"\";\n  var isGenerator = false;\n  var isAsync = false;\n  var kind = \"method\";\n  var isStatic = false;\n\n  if (this.eatContextual(\"static\")) {\n    // Parse static init block\n    if (ecmaVersion >= 13 && this.eat(types$1.braceL)) {\n      this.parseClassStaticBlock(node);\n      return node\n    }\n    if (this.isClassElementNameStart() || this.type === types$1.star) {\n      isStatic = true;\n    } else {\n      keyName = \"static\";\n    }\n  }\n  node.static = isStatic;\n  if (!keyName && ecmaVersion >= 8 && this.eatContextual(\"async\")) {\n    if ((this.isClassElementNameStart() || this.type === types$1.star) && !this.canInsertSemicolon()) {\n      isAsync = true;\n    } else {\n      keyName = \"async\";\n    }\n  }\n  if (!keyName && (ecmaVersion >= 9 || !isAsync) && this.eat(types$1.star)) {\n    isGenerator = true;\n  }\n  if (!keyName && !isAsync && !isGenerator) {\n    var lastValue = this.value;\n    if (this.eatContextual(\"get\") || this.eatContextual(\"set\")) {\n      if (this.isClassElementNameStart()) {\n        kind = lastValue;\n      } else {\n        keyName = lastValue;\n      }\n    }\n  }\n\n  // Parse element name\n  if (keyName) {\n    // 'async', 'get', 'set', or 'static' were not a keyword contextually.\n    // The last token is any of those. Make it the element name.\n    node.computed = false;\n    node.key = this.startNodeAt(this.lastTokStart, this.lastTokStartLoc);\n    node.key.name = keyName;\n    this.finishNode(node.key, \"Identifier\");\n  } else {\n    this.parseClassElementName(node);\n  }\n\n  // Parse element value\n  if (ecmaVersion < 13 || this.type === types$1.parenL || kind !== \"method\" || isGenerator || isAsync) {\n    var isConstructor = !node.static && checkKeyName(node, \"constructor\");\n    var allowsDirectSuper = isConstructor && constructorAllowsSuper;\n    // Couldn't move this check into the 'parseClassMethod' method for backward compatibility.\n    if (isConstructor && kind !== \"method\") { this.raise(node.key.start, \"Constructor can't have get/set modifier\"); }\n    node.kind = isConstructor ? \"constructor\" : kind;\n    this.parseClassMethod(node, isGenerator, isAsync, allowsDirectSuper);\n  } else {\n    this.parseClassField(node);\n  }\n\n  return node\n};\n\npp$8.isClassElementNameStart = function() {\n  return (\n    this.type === types$1.name ||\n    this.type === types$1.privateId ||\n    this.type === types$1.num ||\n    this.type === types$1.string ||\n    this.type === types$1.bracketL ||\n    this.type.keyword\n  )\n};\n\npp$8.parseClassElementName = function(element) {\n  if (this.type === types$1.privateId) {\n    if (this.value === \"constructor\") {\n      this.raise(this.start, \"Classes can't have an element named '#constructor'\");\n    }\n    element.computed = false;\n    element.key = this.parsePrivateIdent();\n  } else {\n    this.parsePropertyName(element);\n  }\n};\n\npp$8.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {\n  // Check key and flags\n  var key = method.key;\n  if (method.kind === \"constructor\") {\n    if (isGenerator) { this.raise(key.start, \"Constructor can't be a generator\"); }\n    if (isAsync) { this.raise(key.start, \"Constructor can't be an async method\"); }\n  } else if (method.static && checkKeyName(method, \"prototype\")) {\n    this.raise(key.start, \"Classes may not have a static property named prototype\");\n  }\n\n  // Parse value\n  var value = method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);\n\n  // Check value\n  if (method.kind === \"get\" && value.params.length !== 0)\n    { this.raiseRecoverable(value.start, \"getter should have no params\"); }\n  if (method.kind === \"set\" && value.params.length !== 1)\n    { this.raiseRecoverable(value.start, \"setter should have exactly one param\"); }\n  if (method.kind === \"set\" && value.params[0].type === \"RestElement\")\n    { this.raiseRecoverable(value.params[0].start, \"Setter cannot use rest params\"); }\n\n  return this.finishNode(method, \"MethodDefinition\")\n};\n\npp$8.parseClassField = function(field) {\n  if (checkKeyName(field, \"constructor\")) {\n    this.raise(field.key.start, \"Classes can't have a field named 'constructor'\");\n  } else if (field.static && checkKeyName(field, \"prototype\")) {\n    this.raise(field.key.start, \"Classes can't have a static field named 'prototype'\");\n  }\n\n  if (this.eat(types$1.eq)) {\n    // To raise SyntaxError if 'arguments' exists in the initializer.\n    this.enterScope(SCOPE_CLASS_FIELD_INIT | SCOPE_SUPER);\n    field.value = this.parseMaybeAssign();\n    this.exitScope();\n  } else {\n    field.value = null;\n  }\n  this.semicolon();\n\n  return this.finishNode(field, \"PropertyDefinition\")\n};\n\npp$8.parseClassStaticBlock = function(node) {\n  node.body = [];\n\n  var oldLabels = this.labels;\n  this.labels = [];\n  this.enterScope(SCOPE_CLASS_STATIC_BLOCK | SCOPE_SUPER);\n  while (this.type !== types$1.braceR) {\n    var stmt = this.parseStatement(null);\n    node.body.push(stmt);\n  }\n  this.next();\n  this.exitScope();\n  this.labels = oldLabels;\n\n  return this.finishNode(node, \"StaticBlock\")\n};\n\npp$8.parseClassId = function(node, isStatement) {\n  if (this.type === types$1.name) {\n    node.id = this.parseIdent();\n    if (isStatement)\n      { this.checkLValSimple(node.id, BIND_LEXICAL, false); }\n  } else {\n    if (isStatement === true)\n      { this.unexpected(); }\n    node.id = null;\n  }\n};\n\npp$8.parseClassSuper = function(node) {\n  node.superClass = this.eat(types$1._extends) ? this.parseExprSubscripts(null, false) : null;\n};\n\npp$8.enterClassBody = function() {\n  var element = {declared: Object.create(null), used: []};\n  this.privateNameStack.push(element);\n  return element.declared\n};\n\npp$8.exitClassBody = function() {\n  var ref = this.privateNameStack.pop();\n  var declared = ref.declared;\n  var used = ref.used;\n  if (!this.options.checkPrivateFields) { return }\n  var len = this.privateNameStack.length;\n  var parent = len === 0 ? null : this.privateNameStack[len - 1];\n  for (var i = 0; i < used.length; ++i) {\n    var id = used[i];\n    if (!hasOwn(declared, id.name)) {\n      if (parent) {\n        parent.used.push(id);\n      } else {\n        this.raiseRecoverable(id.start, (\"Private field '#\" + (id.name) + \"' must be declared in an enclosing class\"));\n      }\n    }\n  }\n};\n\nfunction isPrivateNameConflicted(privateNameMap, element) {\n  var name = element.key.name;\n  var curr = privateNameMap[name];\n\n  var next = \"true\";\n  if (element.type === \"MethodDefinition\" && (element.kind === \"get\" || element.kind === \"set\")) {\n    next = (element.static ? \"s\" : \"i\") + element.kind;\n  }\n\n  // `class { get #a(){}; static set #a(_){} }` is also conflict.\n  if (\n    curr === \"iget\" && next === \"iset\" ||\n    curr === \"iset\" && next === \"iget\" ||\n    curr === \"sget\" && next === \"sset\" ||\n    curr === \"sset\" && next === \"sget\"\n  ) {\n    privateNameMap[name] = \"true\";\n    return false\n  } else if (!curr) {\n    privateNameMap[name] = next;\n    return false\n  } else {\n    return true\n  }\n}\n\nfunction checkKeyName(node, name) {\n  var computed = node.computed;\n  var key = node.key;\n  return !computed && (\n    key.type === \"Identifier\" && key.name === name ||\n    key.type === \"Literal\" && key.value === name\n  )\n}\n\n// Parses module export declaration.\n\npp$8.parseExportAllDeclaration = function(node, exports) {\n  if (this.options.ecmaVersion >= 11) {\n    if (this.eatContextual(\"as\")) {\n      node.exported = this.parseModuleExportName();\n      this.checkExport(exports, node.exported, this.lastTokStart);\n    } else {\n      node.exported = null;\n    }\n  }\n  this.expectContextual(\"from\");\n  if (this.type !== types$1.string) { this.unexpected(); }\n  node.source = this.parseExprAtom();\n  if (this.options.ecmaVersion >= 16)\n    { node.attributes = this.parseWithClause(); }\n  this.semicolon();\n  return this.finishNode(node, \"ExportAllDeclaration\")\n};\n\npp$8.parseExport = function(node, exports) {\n  this.next();\n  // export * from '...'\n  if (this.eat(types$1.star)) {\n    return this.parseExportAllDeclaration(node, exports)\n  }\n  if (this.eat(types$1._default)) { // export default ...\n    this.checkExport(exports, \"default\", this.lastTokStart);\n    node.declaration = this.parseExportDefaultDeclaration();\n    return this.finishNode(node, \"ExportDefaultDeclaration\")\n  }\n  // export var|const|let|function|class ...\n  if (this.shouldParseExportStatement()) {\n    node.declaration = this.parseExportDeclaration(node);\n    if (node.declaration.type === \"VariableDeclaration\")\n      { this.checkVariableExport(exports, node.declaration.declarations); }\n    else\n      { this.checkExport(exports, node.declaration.id, node.declaration.id.start); }\n    node.specifiers = [];\n    node.source = null;\n    if (this.options.ecmaVersion >= 16)\n      { node.attributes = []; }\n  } else { // export { x, y as z } [from '...']\n    node.declaration = null;\n    node.specifiers = this.parseExportSpecifiers(exports);\n    if (this.eatContextual(\"from\")) {\n      if (this.type !== types$1.string) { this.unexpected(); }\n      node.source = this.parseExprAtom();\n      if (this.options.ecmaVersion >= 16)\n        { node.attributes = this.parseWithClause(); }\n    } else {\n      for (var i = 0, list = node.specifiers; i < list.length; i += 1) {\n        // check for keywords used as local names\n        var spec = list[i];\n\n        this.checkUnreserved(spec.local);\n        // check if export is defined\n        this.checkLocalExport(spec.local);\n\n        if (spec.local.type === \"Literal\") {\n          this.raise(spec.local.start, \"A string literal cannot be used as an exported binding without `from`.\");\n        }\n      }\n\n      node.source = null;\n      if (this.options.ecmaVersion >= 16)\n        { node.attributes = []; }\n    }\n    this.semicolon();\n  }\n  return this.finishNode(node, \"ExportNamedDeclaration\")\n};\n\npp$8.parseExportDeclaration = function(node) {\n  return this.parseStatement(null)\n};\n\npp$8.parseExportDefaultDeclaration = function() {\n  var isAsync;\n  if (this.type === types$1._function || (isAsync = this.isAsyncFunction())) {\n    var fNode = this.startNode();\n    this.next();\n    if (isAsync) { this.next(); }\n    return this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync)\n  } else if (this.type === types$1._class) {\n    var cNode = this.startNode();\n    return this.parseClass(cNode, \"nullableID\")\n  } else {\n    var declaration = this.parseMaybeAssign();\n    this.semicolon();\n    return declaration\n  }\n};\n\npp$8.checkExport = function(exports, name, pos) {\n  if (!exports) { return }\n  if (typeof name !== \"string\")\n    { name = name.type === \"Identifier\" ? name.name : name.value; }\n  if (hasOwn(exports, name))\n    { this.raiseRecoverable(pos, \"Duplicate export '\" + name + \"'\"); }\n  exports[name] = true;\n};\n\npp$8.checkPatternExport = function(exports, pat) {\n  var type = pat.type;\n  if (type === \"Identifier\")\n    { this.checkExport(exports, pat, pat.start); }\n  else if (type === \"ObjectPattern\")\n    { for (var i = 0, list = pat.properties; i < list.length; i += 1)\n      {\n        var prop = list[i];\n\n        this.checkPatternExport(exports, prop);\n      } }\n  else if (type === \"ArrayPattern\")\n    { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {\n      var elt = list$1[i$1];\n\n        if (elt) { this.checkPatternExport(exports, elt); }\n    } }\n  else if (type === \"Property\")\n    { this.checkPatternExport(exports, pat.value); }\n  else if (type === \"AssignmentPattern\")\n    { this.checkPatternExport(exports, pat.left); }\n  else if (type === \"RestElement\")\n    { this.checkPatternExport(exports, pat.argument); }\n};\n\npp$8.checkVariableExport = function(exports, decls) {\n  if (!exports) { return }\n  for (var i = 0, list = decls; i < list.length; i += 1)\n    {\n    var decl = list[i];\n\n    this.checkPatternExport(exports, decl.id);\n  }\n};\n\npp$8.shouldParseExportStatement = function() {\n  return this.type.keyword === \"var\" ||\n    this.type.keyword === \"const\" ||\n    this.type.keyword === \"class\" ||\n    this.type.keyword === \"function\" ||\n    this.isLet() ||\n    this.isAsyncFunction()\n};\n\n// Parses a comma-separated list of module exports.\n\npp$8.parseExportSpecifier = function(exports) {\n  var node = this.startNode();\n  node.local = this.parseModuleExportName();\n\n  node.exported = this.eatContextual(\"as\") ? this.parseModuleExportName() : node.local;\n  this.checkExport(\n    exports,\n    node.exported,\n    node.exported.start\n  );\n\n  return this.finishNode(node, \"ExportSpecifier\")\n};\n\npp$8.parseExportSpecifiers = function(exports) {\n  var nodes = [], first = true;\n  // export { x, y as z } [from '...']\n  this.expect(types$1.braceL);\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    nodes.push(this.parseExportSpecifier(exports));\n  }\n  return nodes\n};\n\n// Parses import declaration.\n\npp$8.parseImport = function(node) {\n  this.next();\n\n  // import '...'\n  if (this.type === types$1.string) {\n    node.specifiers = empty$1;\n    node.source = this.parseExprAtom();\n  } else {\n    node.specifiers = this.parseImportSpecifiers();\n    this.expectContextual(\"from\");\n    node.source = this.type === types$1.string ? this.parseExprAtom() : this.unexpected();\n  }\n  if (this.options.ecmaVersion >= 16)\n    { node.attributes = this.parseWithClause(); }\n  this.semicolon();\n  return this.finishNode(node, \"ImportDeclaration\")\n};\n\n// Parses a comma-separated list of module imports.\n\npp$8.parseImportSpecifier = function() {\n  var node = this.startNode();\n  node.imported = this.parseModuleExportName();\n\n  if (this.eatContextual(\"as\")) {\n    node.local = this.parseIdent();\n  } else {\n    this.checkUnreserved(node.imported);\n    node.local = node.imported;\n  }\n  this.checkLValSimple(node.local, BIND_LEXICAL);\n\n  return this.finishNode(node, \"ImportSpecifier\")\n};\n\npp$8.parseImportDefaultSpecifier = function() {\n  // import defaultObj, { x, y as z } from '...'\n  var node = this.startNode();\n  node.local = this.parseIdent();\n  this.checkLValSimple(node.local, BIND_LEXICAL);\n  return this.finishNode(node, \"ImportDefaultSpecifier\")\n};\n\npp$8.parseImportNamespaceSpecifier = function() {\n  var node = this.startNode();\n  this.next();\n  this.expectContextual(\"as\");\n  node.local = this.parseIdent();\n  this.checkLValSimple(node.local, BIND_LEXICAL);\n  return this.finishNode(node, \"ImportNamespaceSpecifier\")\n};\n\npp$8.parseImportSpecifiers = function() {\n  var nodes = [], first = true;\n  if (this.type === types$1.name) {\n    nodes.push(this.parseImportDefaultSpecifier());\n    if (!this.eat(types$1.comma)) { return nodes }\n  }\n  if (this.type === types$1.star) {\n    nodes.push(this.parseImportNamespaceSpecifier());\n    return nodes\n  }\n  this.expect(types$1.braceL);\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    nodes.push(this.parseImportSpecifier());\n  }\n  return nodes\n};\n\npp$8.parseWithClause = function() {\n  var nodes = [];\n  if (!this.eat(types$1._with)) {\n    return nodes\n  }\n  this.expect(types$1.braceL);\n  var attributeKeys = {};\n  var first = true;\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    var attr = this.parseImportAttribute();\n    var keyName = attr.key.type === \"Identifier\" ? attr.key.name : attr.key.value;\n    if (hasOwn(attributeKeys, keyName))\n      { this.raiseRecoverable(attr.key.start, \"Duplicate attribute key '\" + keyName + \"'\"); }\n    attributeKeys[keyName] = true;\n    nodes.push(attr);\n  }\n  return nodes\n};\n\npp$8.parseImportAttribute = function() {\n  var node = this.startNode();\n  node.key = this.type === types$1.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== \"never\");\n  this.expect(types$1.colon);\n  if (this.type !== types$1.string) {\n    this.unexpected();\n  }\n  node.value = this.parseExprAtom();\n  return this.finishNode(node, \"ImportAttribute\")\n};\n\npp$8.parseModuleExportName = function() {\n  if (this.options.ecmaVersion >= 13 && this.type === types$1.string) {\n    var stringLiteral = this.parseLiteral(this.value);\n    if (loneSurrogate.test(stringLiteral.value)) {\n      this.raise(stringLiteral.start, \"An export name cannot include a lone surrogate.\");\n    }\n    return stringLiteral\n  }\n  return this.parseIdent(true)\n};\n\n// Set `ExpressionStatement#directive` property for directive prologues.\npp$8.adaptDirectivePrologue = function(statements) {\n  for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {\n    statements[i].directive = statements[i].expression.raw.slice(1, -1);\n  }\n};\npp$8.isDirectiveCandidate = function(statement) {\n  return (\n    this.options.ecmaVersion >= 5 &&\n    statement.type === \"ExpressionStatement\" &&\n    statement.expression.type === \"Literal\" &&\n    typeof statement.expression.value === \"string\" &&\n    // Reject parenthesized strings.\n    (this.input[statement.start] === \"\\\"\" || this.input[statement.start] === \"'\")\n  )\n};\n\nvar pp$7 = Parser.prototype;\n\n// Convert existing expression atom to assignable pattern\n// if possible.\n\npp$7.toAssignable = function(node, isBinding, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 6 && node) {\n    switch (node.type) {\n    case \"Identifier\":\n      if (this.inAsync && node.name === \"await\")\n        { this.raise(node.start, \"Cannot use 'await' as identifier inside an async function\"); }\n      break\n\n    case \"ObjectPattern\":\n    case \"ArrayPattern\":\n    case \"AssignmentPattern\":\n    case \"RestElement\":\n      break\n\n    case \"ObjectExpression\":\n      node.type = \"ObjectPattern\";\n      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n      for (var i = 0, list = node.properties; i < list.length; i += 1) {\n        var prop = list[i];\n\n      this.toAssignable(prop, isBinding);\n        // Early error:\n        //   AssignmentRestProperty[Yield, Await] :\n        //     `...` DestructuringAssignmentTarget[Yield, Await]\n        //\n        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.\n        if (\n          prop.type === \"RestElement\" &&\n          (prop.argument.type === \"ArrayPattern\" || prop.argument.type === \"ObjectPattern\")\n        ) {\n          this.raise(prop.argument.start, \"Unexpected token\");\n        }\n      }\n      break\n\n    case \"Property\":\n      // AssignmentProperty has type === \"Property\"\n      if (node.kind !== \"init\") { this.raise(node.key.start, \"Object pattern can't contain getter or setter\"); }\n      this.toAssignable(node.value, isBinding);\n      break\n\n    case \"ArrayExpression\":\n      node.type = \"ArrayPattern\";\n      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n      this.toAssignableList(node.elements, isBinding);\n      break\n\n    case \"SpreadElement\":\n      node.type = \"RestElement\";\n      this.toAssignable(node.argument, isBinding);\n      if (node.argument.type === \"AssignmentPattern\")\n        { this.raise(node.argument.start, \"Rest elements cannot have a default value\"); }\n      break\n\n    case \"AssignmentExpression\":\n      if (node.operator !== \"=\") { this.raise(node.left.end, \"Only '=' operator can be used for specifying default value.\"); }\n      node.type = \"AssignmentPattern\";\n      delete node.operator;\n      this.toAssignable(node.left, isBinding);\n      break\n\n    case \"ParenthesizedExpression\":\n      this.toAssignable(node.expression, isBinding, refDestructuringErrors);\n      break\n\n    case \"ChainExpression\":\n      this.raiseRecoverable(node.start, \"Optional chaining cannot appear in left-hand side\");\n      break\n\n    case \"MemberExpression\":\n      if (!isBinding) { break }\n\n    default:\n      this.raise(node.start, \"Assigning to rvalue\");\n    }\n  } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }\n  return node\n};\n\n// Convert list of expression atoms to binding list.\n\npp$7.toAssignableList = function(exprList, isBinding) {\n  var end = exprList.length;\n  for (var i = 0; i < end; i++) {\n    var elt = exprList[i];\n    if (elt) { this.toAssignable(elt, isBinding); }\n  }\n  if (end) {\n    var last = exprList[end - 1];\n    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === \"RestElement\" && last.argument.type !== \"Identifier\")\n      { this.unexpected(last.argument.start); }\n  }\n  return exprList\n};\n\n// Parses spread element.\n\npp$7.parseSpread = function(refDestructuringErrors) {\n  var node = this.startNode();\n  this.next();\n  node.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n  return this.finishNode(node, \"SpreadElement\")\n};\n\npp$7.parseRestBinding = function() {\n  var node = this.startNode();\n  this.next();\n\n  // RestElement inside of a function parameter must be an identifier\n  if (this.options.ecmaVersion === 6 && this.type !== types$1.name)\n    { this.unexpected(); }\n\n  node.argument = this.parseBindingAtom();\n\n  return this.finishNode(node, \"RestElement\")\n};\n\n// Parses lvalue (assignable) atom.\n\npp$7.parseBindingAtom = function() {\n  if (this.options.ecmaVersion >= 6) {\n    switch (this.type) {\n    case types$1.bracketL:\n      var node = this.startNode();\n      this.next();\n      node.elements = this.parseBindingList(types$1.bracketR, true, true);\n      return this.finishNode(node, \"ArrayPattern\")\n\n    case types$1.braceL:\n      return this.parseObj(true)\n    }\n  }\n  return this.parseIdent()\n};\n\npp$7.parseBindingList = function(close, allowEmpty, allowTrailingComma, allowModifiers) {\n  var elts = [], first = true;\n  while (!this.eat(close)) {\n    if (first) { first = false; }\n    else { this.expect(types$1.comma); }\n    if (allowEmpty && this.type === types$1.comma) {\n      elts.push(null);\n    } else if (allowTrailingComma && this.afterTrailingComma(close)) {\n      break\n    } else if (this.type === types$1.ellipsis) {\n      var rest = this.parseRestBinding();\n      this.parseBindingListItem(rest);\n      elts.push(rest);\n      if (this.type === types$1.comma) { this.raiseRecoverable(this.start, \"Comma is not permitted after the rest element\"); }\n      this.expect(close);\n      break\n    } else {\n      elts.push(this.parseAssignableListItem(allowModifiers));\n    }\n  }\n  return elts\n};\n\npp$7.parseAssignableListItem = function(allowModifiers) {\n  var elem = this.parseMaybeDefault(this.start, this.startLoc);\n  this.parseBindingListItem(elem);\n  return elem\n};\n\npp$7.parseBindingListItem = function(param) {\n  return param\n};\n\n// Parses assignment pattern around given atom if possible.\n\npp$7.parseMaybeDefault = function(startPos, startLoc, left) {\n  left = left || this.parseBindingAtom();\n  if (this.options.ecmaVersion < 6 || !this.eat(types$1.eq)) { return left }\n  var node = this.startNodeAt(startPos, startLoc);\n  node.left = left;\n  node.right = this.parseMaybeAssign();\n  return this.finishNode(node, \"AssignmentPattern\")\n};\n\n// The following three functions all verify that a node is an lvalue —\n// something that can be bound, or assigned to. In order to do so, they perform\n// a variety of checks:\n//\n// - Check that none of the bound/assigned-to identifiers are reserved words.\n// - Record name declarations for bindings in the appropriate scope.\n// - Check duplicate argument names, if checkClashes is set.\n//\n// If a complex binding pattern is encountered (e.g., object and array\n// destructuring), the entire pattern is recursively checked.\n//\n// There are three versions of checkLVal*() appropriate for different\n// circumstances:\n//\n// - checkLValSimple() shall be used if the syntactic construct supports\n//   nothing other than identifiers and member expressions. Parenthesized\n//   expressions are also correctly handled. This is generally appropriate for\n//   constructs for which the spec says\n//\n//   > It is a Syntax Error if AssignmentTargetType of [the production] is not\n//   > simple.\n//\n//   It is also appropriate for checking if an identifier is valid and not\n//   defined elsewhere, like import declarations or function/class identifiers.\n//\n//   Examples where this is used include:\n//     a += …;\n//     import a from '…';\n//   where a is the node to be checked.\n//\n// - checkLValPattern() shall be used if the syntactic construct supports\n//   anything checkLValSimple() supports, as well as object and array\n//   destructuring patterns. This is generally appropriate for constructs for\n//   which the spec says\n//\n//   > It is a Syntax Error if [the production] is neither an ObjectLiteral nor\n//   > an ArrayLiteral and AssignmentTargetType of [the production] is not\n//   > simple.\n//\n//   Examples where this is used include:\n//     (a = …);\n//     const a = …;\n//     try { … } catch (a) { … }\n//   where a is the node to be checked.\n//\n// - checkLValInnerPattern() shall be used if the syntactic construct supports\n//   anything checkLValPattern() supports, as well as default assignment\n//   patterns, rest elements, and other constructs that may appear within an\n//   object or array destructuring pattern.\n//\n//   As a special case, function parameters also use checkLValInnerPattern(),\n//   as they also support defaults and rest constructs.\n//\n// These functions deliberately support both assignment and binding constructs,\n// as the logic for both is exceedingly similar. If the node is the target of\n// an assignment, then bindingType should be set to BIND_NONE. Otherwise, it\n// should be set to the appropriate BIND_* constant, like BIND_VAR or\n// BIND_LEXICAL.\n//\n// If the function is called with a non-BIND_NONE bindingType, then\n// additionally a checkClashes object may be specified to allow checking for\n// duplicate argument names. checkClashes is ignored if the provided construct\n// is an assignment (i.e., bindingType is BIND_NONE).\n\npp$7.checkLValSimple = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  var isBind = bindingType !== BIND_NONE;\n\n  switch (expr.type) {\n  case \"Identifier\":\n    if (this.strict && this.reservedWordsStrictBind.test(expr.name))\n      { this.raiseRecoverable(expr.start, (isBind ? \"Binding \" : \"Assigning to \") + expr.name + \" in strict mode\"); }\n    if (isBind) {\n      if (bindingType === BIND_LEXICAL && expr.name === \"let\")\n        { this.raiseRecoverable(expr.start, \"let is disallowed as a lexically bound name\"); }\n      if (checkClashes) {\n        if (hasOwn(checkClashes, expr.name))\n          { this.raiseRecoverable(expr.start, \"Argument name clash\"); }\n        checkClashes[expr.name] = true;\n      }\n      if (bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }\n    }\n    break\n\n  case \"ChainExpression\":\n    this.raiseRecoverable(expr.start, \"Optional chaining cannot appear in left-hand side\");\n    break\n\n  case \"MemberExpression\":\n    if (isBind) { this.raiseRecoverable(expr.start, \"Binding member expression\"); }\n    break\n\n  case \"ParenthesizedExpression\":\n    if (isBind) { this.raiseRecoverable(expr.start, \"Binding parenthesized expression\"); }\n    return this.checkLValSimple(expr.expression, bindingType, checkClashes)\n\n  default:\n    this.raise(expr.start, (isBind ? \"Binding\" : \"Assigning to\") + \" rvalue\");\n  }\n};\n\npp$7.checkLValPattern = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  switch (expr.type) {\n  case \"ObjectPattern\":\n    for (var i = 0, list = expr.properties; i < list.length; i += 1) {\n      var prop = list[i];\n\n    this.checkLValInnerPattern(prop, bindingType, checkClashes);\n    }\n    break\n\n  case \"ArrayPattern\":\n    for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {\n      var elem = list$1[i$1];\n\n    if (elem) { this.checkLValInnerPattern(elem, bindingType, checkClashes); }\n    }\n    break\n\n  default:\n    this.checkLValSimple(expr, bindingType, checkClashes);\n  }\n};\n\npp$7.checkLValInnerPattern = function(expr, bindingType, checkClashes) {\n  if ( bindingType === void 0 ) bindingType = BIND_NONE;\n\n  switch (expr.type) {\n  case \"Property\":\n    // AssignmentProperty has type === \"Property\"\n    this.checkLValInnerPattern(expr.value, bindingType, checkClashes);\n    break\n\n  case \"AssignmentPattern\":\n    this.checkLValPattern(expr.left, bindingType, checkClashes);\n    break\n\n  case \"RestElement\":\n    this.checkLValPattern(expr.argument, bindingType, checkClashes);\n    break\n\n  default:\n    this.checkLValPattern(expr, bindingType, checkClashes);\n  }\n};\n\n// The algorithm used to determine whether a regexp can appear at a\n// given point in the program is loosely based on sweet.js' approach.\n// See https://github.com/mozilla/sweet.js/wiki/design\n\n\nvar TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {\n  this.token = token;\n  this.isExpr = !!isExpr;\n  this.preserveSpace = !!preserveSpace;\n  this.override = override;\n  this.generator = !!generator;\n};\n\nvar types = {\n  b_stat: new TokContext(\"{\", false),\n  b_expr: new TokContext(\"{\", true),\n  b_tmpl: new TokContext(\"${\", false),\n  p_stat: new TokContext(\"(\", false),\n  p_expr: new TokContext(\"(\", true),\n  q_tmpl: new TokContext(\"`\", true, true, function (p) { return p.tryReadTemplateToken(); }),\n  f_stat: new TokContext(\"function\", false),\n  f_expr: new TokContext(\"function\", true),\n  f_expr_gen: new TokContext(\"function\", true, false, null, true),\n  f_gen: new TokContext(\"function\", false, false, null, true)\n};\n\nvar pp$6 = Parser.prototype;\n\npp$6.initialContext = function() {\n  return [types.b_stat]\n};\n\npp$6.curContext = function() {\n  return this.context[this.context.length - 1]\n};\n\npp$6.braceIsBlock = function(prevType) {\n  var parent = this.curContext();\n  if (parent === types.f_expr || parent === types.f_stat)\n    { return true }\n  if (prevType === types$1.colon && (parent === types.b_stat || parent === types.b_expr))\n    { return !parent.isExpr }\n\n  // The check for `tt.name && exprAllowed` detects whether we are\n  // after a `yield` or `of` construct. See the `updateContext` for\n  // `tt.name`.\n  if (prevType === types$1._return || prevType === types$1.name && this.exprAllowed)\n    { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }\n  if (prevType === types$1._else || prevType === types$1.semi || prevType === types$1.eof || prevType === types$1.parenR || prevType === types$1.arrow)\n    { return true }\n  if (prevType === types$1.braceL)\n    { return parent === types.b_stat }\n  if (prevType === types$1._var || prevType === types$1._const || prevType === types$1.name)\n    { return false }\n  return !this.exprAllowed\n};\n\npp$6.inGeneratorContext = function() {\n  for (var i = this.context.length - 1; i >= 1; i--) {\n    var context = this.context[i];\n    if (context.token === \"function\")\n      { return context.generator }\n  }\n  return false\n};\n\npp$6.updateContext = function(prevType) {\n  var update, type = this.type;\n  if (type.keyword && prevType === types$1.dot)\n    { this.exprAllowed = false; }\n  else if (update = type.updateContext)\n    { update.call(this, prevType); }\n  else\n    { this.exprAllowed = type.beforeExpr; }\n};\n\n// Used to handle edge cases when token context could not be inferred correctly during tokenization phase\n\npp$6.overrideContext = function(tokenCtx) {\n  if (this.curContext() !== tokenCtx) {\n    this.context[this.context.length - 1] = tokenCtx;\n  }\n};\n\n// Token-specific context update code\n\ntypes$1.parenR.updateContext = types$1.braceR.updateContext = function() {\n  if (this.context.length === 1) {\n    this.exprAllowed = true;\n    return\n  }\n  var out = this.context.pop();\n  if (out === types.b_stat && this.curContext().token === \"function\") {\n    out = this.context.pop();\n  }\n  this.exprAllowed = !out.isExpr;\n};\n\ntypes$1.braceL.updateContext = function(prevType) {\n  this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr);\n  this.exprAllowed = true;\n};\n\ntypes$1.dollarBraceL.updateContext = function() {\n  this.context.push(types.b_tmpl);\n  this.exprAllowed = true;\n};\n\ntypes$1.parenL.updateContext = function(prevType) {\n  var statementParens = prevType === types$1._if || prevType === types$1._for || prevType === types$1._with || prevType === types$1._while;\n  this.context.push(statementParens ? types.p_stat : types.p_expr);\n  this.exprAllowed = true;\n};\n\ntypes$1.incDec.updateContext = function() {\n  // tokExprAllowed stays unchanged\n};\n\ntypes$1._function.updateContext = types$1._class.updateContext = function(prevType) {\n  if (prevType.beforeExpr && prevType !== types$1._else &&\n      !(prevType === types$1.semi && this.curContext() !== types.p_stat) &&\n      !(prevType === types$1._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&\n      !((prevType === types$1.colon || prevType === types$1.braceL) && this.curContext() === types.b_stat))\n    { this.context.push(types.f_expr); }\n  else\n    { this.context.push(types.f_stat); }\n  this.exprAllowed = false;\n};\n\ntypes$1.colon.updateContext = function() {\n  if (this.curContext().token === \"function\") { this.context.pop(); }\n  this.exprAllowed = true;\n};\n\ntypes$1.backQuote.updateContext = function() {\n  if (this.curContext() === types.q_tmpl)\n    { this.context.pop(); }\n  else\n    { this.context.push(types.q_tmpl); }\n  this.exprAllowed = false;\n};\n\ntypes$1.star.updateContext = function(prevType) {\n  if (prevType === types$1._function) {\n    var index = this.context.length - 1;\n    if (this.context[index] === types.f_expr)\n      { this.context[index] = types.f_expr_gen; }\n    else\n      { this.context[index] = types.f_gen; }\n  }\n  this.exprAllowed = true;\n};\n\ntypes$1.name.updateContext = function(prevType) {\n  var allowed = false;\n  if (this.options.ecmaVersion >= 6 && prevType !== types$1.dot) {\n    if (this.value === \"of\" && !this.exprAllowed ||\n        this.value === \"yield\" && this.inGeneratorContext())\n      { allowed = true; }\n  }\n  this.exprAllowed = allowed;\n};\n\n// A recursive descent parser operates by defining functions for all\n// syntactic elements, and recursively calling those, each function\n// advancing the input stream and returning an AST node. Precedence\n// of constructs (for example, the fact that `!x[1]` means `!(x[1])`\n// instead of `(!x)[1]` is handled by the fact that the parser\n// function that parses unary prefix operators is called first, and\n// in turn calls the function that parses `[]` subscripts — that\n// way, it'll receive the node for `x[1]` already parsed, and wraps\n// *that* in the unary operator node.\n//\n// Acorn uses an [operator precedence parser][opp] to handle binary\n// operator precedence, because it is much more compact than using\n// the technique outlined above, which uses different, nesting\n// functions to specify precedence, for all of the ten binary\n// precedence levels that JavaScript defines.\n//\n// [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser\n\n\nvar pp$5 = Parser.prototype;\n\n// Check if property name clashes with already added.\n// Object/class getters and setters are not allowed to clash —\n// either with each other or with an init property — and in\n// strict mode, init properties are also not allowed to be repeated.\n\npp$5.checkPropClash = function(prop, propHash, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 9 && prop.type === \"SpreadElement\")\n    { return }\n  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))\n    { return }\n  var key = prop.key;\n  var name;\n  switch (key.type) {\n  case \"Identifier\": name = key.name; break\n  case \"Literal\": name = String(key.value); break\n  default: return\n  }\n  var kind = prop.kind;\n  if (this.options.ecmaVersion >= 6) {\n    if (name === \"__proto__\" && kind === \"init\") {\n      if (propHash.proto) {\n        if (refDestructuringErrors) {\n          if (refDestructuringErrors.doubleProto < 0) {\n            refDestructuringErrors.doubleProto = key.start;\n          }\n        } else {\n          this.raiseRecoverable(key.start, \"Redefinition of __proto__ property\");\n        }\n      }\n      propHash.proto = true;\n    }\n    return\n  }\n  name = \"$\" + name;\n  var other = propHash[name];\n  if (other) {\n    var redefinition;\n    if (kind === \"init\") {\n      redefinition = this.strict && other.init || other.get || other.set;\n    } else {\n      redefinition = other.init || other[kind];\n    }\n    if (redefinition)\n      { this.raiseRecoverable(key.start, \"Redefinition of property\"); }\n  } else {\n    other = propHash[name] = {\n      init: false,\n      get: false,\n      set: false\n    };\n  }\n  other[kind] = true;\n};\n\n// ### Expression parsing\n\n// These nest, from the most general expression type at the top to\n// 'atomic', nondivisible expression types at the bottom. Most of\n// the functions will simply let the function(s) below them parse,\n// and, *if* the syntactic construct they handle is present, wrap\n// the AST node that the inner parser gave them in another node.\n\n// Parse a full expression. The optional arguments are used to\n// forbid the `in` operator (in for loops initalization expressions)\n// and provide reference for storing '=' operator inside shorthand\n// property assignment in contexts where both object expression\n// and object pattern might appear (so it's possible to raise\n// delayed syntax error at correct position).\n\npp$5.parseExpression = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseMaybeAssign(forInit, refDestructuringErrors);\n  if (this.type === types$1.comma) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.expressions = [expr];\n    while (this.eat(types$1.comma)) { node.expressions.push(this.parseMaybeAssign(forInit, refDestructuringErrors)); }\n    return this.finishNode(node, \"SequenceExpression\")\n  }\n  return expr\n};\n\n// Parse an assignment expression. This includes applications of\n// operators like `+=`.\n\npp$5.parseMaybeAssign = function(forInit, refDestructuringErrors, afterLeftParse) {\n  if (this.isContextual(\"yield\")) {\n    if (this.inGenerator) { return this.parseYield(forInit) }\n    // The tokenizer will assume an expression is allowed after\n    // `yield`, but this isn't that kind of yield\n    else { this.exprAllowed = false; }\n  }\n\n  var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldDoubleProto = -1;\n  if (refDestructuringErrors) {\n    oldParenAssign = refDestructuringErrors.parenthesizedAssign;\n    oldTrailingComma = refDestructuringErrors.trailingComma;\n    oldDoubleProto = refDestructuringErrors.doubleProto;\n    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = -1;\n  } else {\n    refDestructuringErrors = new DestructuringErrors;\n    ownDestructuringErrors = true;\n  }\n\n  var startPos = this.start, startLoc = this.startLoc;\n  if (this.type === types$1.parenL || this.type === types$1.name) {\n    this.potentialArrowAt = this.start;\n    this.potentialArrowInForAwait = forInit === \"await\";\n  }\n  var left = this.parseMaybeConditional(forInit, refDestructuringErrors);\n  if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }\n  if (this.type.isAssign) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.operator = this.value;\n    if (this.type === types$1.eq)\n      { left = this.toAssignable(left, false, refDestructuringErrors); }\n    if (!ownDestructuringErrors) {\n      refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.doubleProto = -1;\n    }\n    if (refDestructuringErrors.shorthandAssign >= left.start)\n      { refDestructuringErrors.shorthandAssign = -1; } // reset because shorthand default was used correctly\n    if (this.type === types$1.eq)\n      { this.checkLValPattern(left); }\n    else\n      { this.checkLValSimple(left); }\n    node.left = left;\n    this.next();\n    node.right = this.parseMaybeAssign(forInit);\n    if (oldDoubleProto > -1) { refDestructuringErrors.doubleProto = oldDoubleProto; }\n    return this.finishNode(node, \"AssignmentExpression\")\n  } else {\n    if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }\n  }\n  if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }\n  if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }\n  return left\n};\n\n// Parse a ternary conditional (`?:`) operator.\n\npp$5.parseMaybeConditional = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseExprOps(forInit, refDestructuringErrors);\n  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n  if (this.eat(types$1.question)) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.test = expr;\n    node.consequent = this.parseMaybeAssign();\n    this.expect(types$1.colon);\n    node.alternate = this.parseMaybeAssign(forInit);\n    return this.finishNode(node, \"ConditionalExpression\")\n  }\n  return expr\n};\n\n// Start the precedence parser.\n\npp$5.parseExprOps = function(forInit, refDestructuringErrors) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseMaybeUnary(refDestructuringErrors, false, false, forInit);\n  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n  return expr.start === startPos && expr.type === \"ArrowFunctionExpression\" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, forInit)\n};\n\n// Parse binary operators with the operator precedence parsing\n// algorithm. `left` is the left-hand side of the operator.\n// `minPrec` provides context that allows the function to stop and\n// defer further parser to one of its callers when it encounters an\n// operator that has a lower precedence than the set it is parsing.\n\npp$5.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, forInit) {\n  var prec = this.type.binop;\n  if (prec != null && (!forInit || this.type !== types$1._in)) {\n    if (prec > minPrec) {\n      var logical = this.type === types$1.logicalOR || this.type === types$1.logicalAND;\n      var coalesce = this.type === types$1.coalesce;\n      if (coalesce) {\n        // Handle the precedence of `tt.coalesce` as equal to the range of logical expressions.\n        // In other words, `node.right` shouldn't contain logical expressions in order to check the mixed error.\n        prec = types$1.logicalAND.binop;\n      }\n      var op = this.value;\n      this.next();\n      var startPos = this.start, startLoc = this.startLoc;\n      var right = this.parseExprOp(this.parseMaybeUnary(null, false, false, forInit), startPos, startLoc, prec, forInit);\n      var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical || coalesce);\n      if ((logical && this.type === types$1.coalesce) || (coalesce && (this.type === types$1.logicalOR || this.type === types$1.logicalAND))) {\n        this.raiseRecoverable(this.start, \"Logical expressions and coalesce expressions cannot be mixed. Wrap either by parentheses\");\n      }\n      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, forInit)\n    }\n  }\n  return left\n};\n\npp$5.buildBinary = function(startPos, startLoc, left, right, op, logical) {\n  if (right.type === \"PrivateIdentifier\") { this.raise(right.start, \"Private identifier can only be left side of binary expression\"); }\n  var node = this.startNodeAt(startPos, startLoc);\n  node.left = left;\n  node.operator = op;\n  node.right = right;\n  return this.finishNode(node, logical ? \"LogicalExpression\" : \"BinaryExpression\")\n};\n\n// Parse unary operators, both prefix and postfix.\n\npp$5.parseMaybeUnary = function(refDestructuringErrors, sawUnary, incDec, forInit) {\n  var startPos = this.start, startLoc = this.startLoc, expr;\n  if (this.isContextual(\"await\") && this.canAwait) {\n    expr = this.parseAwait(forInit);\n    sawUnary = true;\n  } else if (this.type.prefix) {\n    var node = this.startNode(), update = this.type === types$1.incDec;\n    node.operator = this.value;\n    node.prefix = true;\n    this.next();\n    node.argument = this.parseMaybeUnary(null, true, update, forInit);\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    if (update) { this.checkLValSimple(node.argument); }\n    else if (this.strict && node.operator === \"delete\" && isLocalVariableAccess(node.argument))\n      { this.raiseRecoverable(node.start, \"Deleting local variable in strict mode\"); }\n    else if (node.operator === \"delete\" && isPrivateFieldAccess(node.argument))\n      { this.raiseRecoverable(node.start, \"Private fields can not be deleted\"); }\n    else { sawUnary = true; }\n    expr = this.finishNode(node, update ? \"UpdateExpression\" : \"UnaryExpression\");\n  } else if (!sawUnary && this.type === types$1.privateId) {\n    if ((forInit || this.privateNameStack.length === 0) && this.options.checkPrivateFields) { this.unexpected(); }\n    expr = this.parsePrivateIdent();\n    // only could be private fields in 'in', such as #x in obj\n    if (this.type !== types$1._in) { this.unexpected(); }\n  } else {\n    expr = this.parseExprSubscripts(refDestructuringErrors, forInit);\n    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }\n    while (this.type.postfix && !this.canInsertSemicolon()) {\n      var node$1 = this.startNodeAt(startPos, startLoc);\n      node$1.operator = this.value;\n      node$1.prefix = false;\n      node$1.argument = expr;\n      this.checkLValSimple(expr);\n      this.next();\n      expr = this.finishNode(node$1, \"UpdateExpression\");\n    }\n  }\n\n  if (!incDec && this.eat(types$1.starstar)) {\n    if (sawUnary)\n      { this.unexpected(this.lastTokStart); }\n    else\n      { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false, false, forInit), \"**\", false) }\n  } else {\n    return expr\n  }\n};\n\nfunction isLocalVariableAccess(node) {\n  return (\n    node.type === \"Identifier\" ||\n    node.type === \"ParenthesizedExpression\" && isLocalVariableAccess(node.expression)\n  )\n}\n\nfunction isPrivateFieldAccess(node) {\n  return (\n    node.type === \"MemberExpression\" && node.property.type === \"PrivateIdentifier\" ||\n    node.type === \"ChainExpression\" && isPrivateFieldAccess(node.expression) ||\n    node.type === \"ParenthesizedExpression\" && isPrivateFieldAccess(node.expression)\n  )\n}\n\n// Parse call, dot, and `[]`-subscript expressions.\n\npp$5.parseExprSubscripts = function(refDestructuringErrors, forInit) {\n  var startPos = this.start, startLoc = this.startLoc;\n  var expr = this.parseExprAtom(refDestructuringErrors, forInit);\n  if (expr.type === \"ArrowFunctionExpression\" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== \")\")\n    { return expr }\n  var result = this.parseSubscripts(expr, startPos, startLoc, false, forInit);\n  if (refDestructuringErrors && result.type === \"MemberExpression\") {\n    if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }\n    if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }\n    if (refDestructuringErrors.trailingComma >= result.start) { refDestructuringErrors.trailingComma = -1; }\n  }\n  return result\n};\n\npp$5.parseSubscripts = function(base, startPos, startLoc, noCalls, forInit) {\n  var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === \"Identifier\" && base.name === \"async\" &&\n      this.lastTokEnd === base.end && !this.canInsertSemicolon() && base.end - base.start === 5 &&\n      this.potentialArrowAt === base.start;\n  var optionalChained = false;\n\n  while (true) {\n    var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit);\n\n    if (element.optional) { optionalChained = true; }\n    if (element === base || element.type === \"ArrowFunctionExpression\") {\n      if (optionalChained) {\n        var chainNode = this.startNodeAt(startPos, startLoc);\n        chainNode.expression = element;\n        element = this.finishNode(chainNode, \"ChainExpression\");\n      }\n      return element\n    }\n\n    base = element;\n  }\n};\n\npp$5.shouldParseAsyncArrow = function() {\n  return !this.canInsertSemicolon() && this.eat(types$1.arrow)\n};\n\npp$5.parseSubscriptAsyncArrow = function(startPos, startLoc, exprList, forInit) {\n  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true, forInit)\n};\n\npp$5.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow, optionalChained, forInit) {\n  var optionalSupported = this.options.ecmaVersion >= 11;\n  var optional = optionalSupported && this.eat(types$1.questionDot);\n  if (noCalls && optional) { this.raise(this.lastTokStart, \"Optional chaining cannot appear in the callee of new expressions\"); }\n\n  var computed = this.eat(types$1.bracketL);\n  if (computed || (optional && this.type !== types$1.parenL && this.type !== types$1.backQuote) || this.eat(types$1.dot)) {\n    var node = this.startNodeAt(startPos, startLoc);\n    node.object = base;\n    if (computed) {\n      node.property = this.parseExpression();\n      this.expect(types$1.bracketR);\n    } else if (this.type === types$1.privateId && base.type !== \"Super\") {\n      node.property = this.parsePrivateIdent();\n    } else {\n      node.property = this.parseIdent(this.options.allowReserved !== \"never\");\n    }\n    node.computed = !!computed;\n    if (optionalSupported) {\n      node.optional = optional;\n    }\n    base = this.finishNode(node, \"MemberExpression\");\n  } else if (!noCalls && this.eat(types$1.parenL)) {\n    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    this.awaitIdentPos = 0;\n    var exprList = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);\n    if (maybeAsyncArrow && !optional && this.shouldParseAsyncArrow()) {\n      this.checkPatternErrors(refDestructuringErrors, false);\n      this.checkYieldAwaitInDefaultParams();\n      if (this.awaitIdentPos > 0)\n        { this.raise(this.awaitIdentPos, \"Cannot use 'await' as identifier inside an async function\"); }\n      this.yieldPos = oldYieldPos;\n      this.awaitPos = oldAwaitPos;\n      this.awaitIdentPos = oldAwaitIdentPos;\n      return this.parseSubscriptAsyncArrow(startPos, startLoc, exprList, forInit)\n    }\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    this.yieldPos = oldYieldPos || this.yieldPos;\n    this.awaitPos = oldAwaitPos || this.awaitPos;\n    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;\n    var node$1 = this.startNodeAt(startPos, startLoc);\n    node$1.callee = base;\n    node$1.arguments = exprList;\n    if (optionalSupported) {\n      node$1.optional = optional;\n    }\n    base = this.finishNode(node$1, \"CallExpression\");\n  } else if (this.type === types$1.backQuote) {\n    if (optional || optionalChained) {\n      this.raise(this.start, \"Optional chaining cannot appear in the tag of tagged template expressions\");\n    }\n    var node$2 = this.startNodeAt(startPos, startLoc);\n    node$2.tag = base;\n    node$2.quasi = this.parseTemplate({isTagged: true});\n    base = this.finishNode(node$2, \"TaggedTemplateExpression\");\n  }\n  return base\n};\n\n// Parse an atomic expression — either a single token that is an\n// expression, an expression started by a keyword like `function` or\n// `new`, or an expression wrapped in punctuation like `()`, `[]`,\n// or `{}`.\n\npp$5.parseExprAtom = function(refDestructuringErrors, forInit, forNew) {\n  // If a division operator appears in an expression position, the\n  // tokenizer got confused, and we force it to read a regexp instead.\n  if (this.type === types$1.slash) { this.readRegexp(); }\n\n  var node, canBeArrow = this.potentialArrowAt === this.start;\n  switch (this.type) {\n  case types$1._super:\n    if (!this.allowSuper)\n      { this.raise(this.start, \"'super' keyword outside a method\"); }\n    node = this.startNode();\n    this.next();\n    if (this.type === types$1.parenL && !this.allowDirectSuper)\n      { this.raise(node.start, \"super() call outside constructor of a subclass\"); }\n    // The `super` keyword can appear at below:\n    // SuperProperty:\n    //     super [ Expression ]\n    //     super . IdentifierName\n    // SuperCall:\n    //     super ( Arguments )\n    if (this.type !== types$1.dot && this.type !== types$1.bracketL && this.type !== types$1.parenL)\n      { this.unexpected(); }\n    return this.finishNode(node, \"Super\")\n\n  case types$1._this:\n    node = this.startNode();\n    this.next();\n    return this.finishNode(node, \"ThisExpression\")\n\n  case types$1.name:\n    var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;\n    var id = this.parseIdent(false);\n    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === \"async\" && !this.canInsertSemicolon() && this.eat(types$1._function)) {\n      this.overrideContext(types.f_expr);\n      return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true, forInit)\n    }\n    if (canBeArrow && !this.canInsertSemicolon()) {\n      if (this.eat(types$1.arrow))\n        { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false, forInit) }\n      if (this.options.ecmaVersion >= 8 && id.name === \"async\" && this.type === types$1.name && !containsEsc &&\n          (!this.potentialArrowInForAwait || this.value !== \"of\" || this.containsEsc)) {\n        id = this.parseIdent(false);\n        if (this.canInsertSemicolon() || !this.eat(types$1.arrow))\n          { this.unexpected(); }\n        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true, forInit)\n      }\n    }\n    return id\n\n  case types$1.regexp:\n    var value = this.value;\n    node = this.parseLiteral(value.value);\n    node.regex = {pattern: value.pattern, flags: value.flags};\n    return node\n\n  case types$1.num: case types$1.string:\n    return this.parseLiteral(this.value)\n\n  case types$1._null: case types$1._true: case types$1._false:\n    node = this.startNode();\n    node.value = this.type === types$1._null ? null : this.type === types$1._true;\n    node.raw = this.type.keyword;\n    this.next();\n    return this.finishNode(node, \"Literal\")\n\n  case types$1.parenL:\n    var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow, forInit);\n    if (refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))\n        { refDestructuringErrors.parenthesizedAssign = start; }\n      if (refDestructuringErrors.parenthesizedBind < 0)\n        { refDestructuringErrors.parenthesizedBind = start; }\n    }\n    return expr\n\n  case types$1.bracketL:\n    node = this.startNode();\n    this.next();\n    node.elements = this.parseExprList(types$1.bracketR, true, true, refDestructuringErrors);\n    return this.finishNode(node, \"ArrayExpression\")\n\n  case types$1.braceL:\n    this.overrideContext(types.b_expr);\n    return this.parseObj(false, refDestructuringErrors)\n\n  case types$1._function:\n    node = this.startNode();\n    this.next();\n    return this.parseFunction(node, 0)\n\n  case types$1._class:\n    return this.parseClass(this.startNode(), false)\n\n  case types$1._new:\n    return this.parseNew()\n\n  case types$1.backQuote:\n    return this.parseTemplate()\n\n  case types$1._import:\n    if (this.options.ecmaVersion >= 11) {\n      return this.parseExprImport(forNew)\n    } else {\n      return this.unexpected()\n    }\n\n  default:\n    return this.parseExprAtomDefault()\n  }\n};\n\npp$5.parseExprAtomDefault = function() {\n  this.unexpected();\n};\n\npp$5.parseExprImport = function(forNew) {\n  var node = this.startNode();\n\n  // Consume `import` as an identifier for `import.meta`.\n  // Because `this.parseIdent(true)` doesn't check escape sequences, it needs the check of `this.containsEsc`.\n  if (this.containsEsc) { this.raiseRecoverable(this.start, \"Escape sequence in keyword import\"); }\n  this.next();\n\n  if (this.type === types$1.parenL && !forNew) {\n    return this.parseDynamicImport(node)\n  } else if (this.type === types$1.dot) {\n    var meta = this.startNodeAt(node.start, node.loc && node.loc.start);\n    meta.name = \"import\";\n    node.meta = this.finishNode(meta, \"Identifier\");\n    return this.parseImportMeta(node)\n  } else {\n    this.unexpected();\n  }\n};\n\npp$5.parseDynamicImport = function(node) {\n  this.next(); // skip `(`\n\n  // Parse node.source.\n  node.source = this.parseMaybeAssign();\n\n  if (this.options.ecmaVersion >= 16) {\n    if (!this.eat(types$1.parenR)) {\n      this.expect(types$1.comma);\n      if (!this.afterTrailingComma(types$1.parenR)) {\n        node.options = this.parseMaybeAssign();\n        if (!this.eat(types$1.parenR)) {\n          this.expect(types$1.comma);\n          if (!this.afterTrailingComma(types$1.parenR)) {\n            this.unexpected();\n          }\n        }\n      } else {\n        node.options = null;\n      }\n    } else {\n      node.options = null;\n    }\n  } else {\n    // Verify ending.\n    if (!this.eat(types$1.parenR)) {\n      var errorPos = this.start;\n      if (this.eat(types$1.comma) && this.eat(types$1.parenR)) {\n        this.raiseRecoverable(errorPos, \"Trailing comma is not allowed in import()\");\n      } else {\n        this.unexpected(errorPos);\n      }\n    }\n  }\n\n  return this.finishNode(node, \"ImportExpression\")\n};\n\npp$5.parseImportMeta = function(node) {\n  this.next(); // skip `.`\n\n  var containsEsc = this.containsEsc;\n  node.property = this.parseIdent(true);\n\n  if (node.property.name !== \"meta\")\n    { this.raiseRecoverable(node.property.start, \"The only valid meta property for import is 'import.meta'\"); }\n  if (containsEsc)\n    { this.raiseRecoverable(node.start, \"'import.meta' must not contain escaped characters\"); }\n  if (this.options.sourceType !== \"module\" && !this.options.allowImportExportEverywhere)\n    { this.raiseRecoverable(node.start, \"Cannot use 'import.meta' outside a module\"); }\n\n  return this.finishNode(node, \"MetaProperty\")\n};\n\npp$5.parseLiteral = function(value) {\n  var node = this.startNode();\n  node.value = value;\n  node.raw = this.input.slice(this.start, this.end);\n  if (node.raw.charCodeAt(node.raw.length - 1) === 110)\n    { node.bigint = node.value != null ? node.value.toString() : node.raw.slice(0, -1).replace(/_/g, \"\"); }\n  this.next();\n  return this.finishNode(node, \"Literal\")\n};\n\npp$5.parseParenExpression = function() {\n  this.expect(types$1.parenL);\n  var val = this.parseExpression();\n  this.expect(types$1.parenR);\n  return val\n};\n\npp$5.shouldParseArrow = function(exprList) {\n  return !this.canInsertSemicolon()\n};\n\npp$5.parseParenAndDistinguishExpression = function(canBeArrow, forInit) {\n  var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;\n  if (this.options.ecmaVersion >= 6) {\n    this.next();\n\n    var innerStartPos = this.start, innerStartLoc = this.startLoc;\n    var exprList = [], first = true, lastIsComma = false;\n    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;\n    this.yieldPos = 0;\n    this.awaitPos = 0;\n    // Do not save awaitIdentPos to allow checking awaits nested in parameters\n    while (this.type !== types$1.parenR) {\n      first ? first = false : this.expect(types$1.comma);\n      if (allowTrailingComma && this.afterTrailingComma(types$1.parenR, true)) {\n        lastIsComma = true;\n        break\n      } else if (this.type === types$1.ellipsis) {\n        spreadStart = this.start;\n        exprList.push(this.parseParenItem(this.parseRestBinding()));\n        if (this.type === types$1.comma) {\n          this.raiseRecoverable(\n            this.start,\n            \"Comma is not permitted after the rest element\"\n          );\n        }\n        break\n      } else {\n        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));\n      }\n    }\n    var innerEndPos = this.lastTokEnd, innerEndLoc = this.lastTokEndLoc;\n    this.expect(types$1.parenR);\n\n    if (canBeArrow && this.shouldParseArrow(exprList) && this.eat(types$1.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false);\n      this.checkYieldAwaitInDefaultParams();\n      this.yieldPos = oldYieldPos;\n      this.awaitPos = oldAwaitPos;\n      return this.parseParenArrowList(startPos, startLoc, exprList, forInit)\n    }\n\n    if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }\n    if (spreadStart) { this.unexpected(spreadStart); }\n    this.checkExpressionErrors(refDestructuringErrors, true);\n    this.yieldPos = oldYieldPos || this.yieldPos;\n    this.awaitPos = oldAwaitPos || this.awaitPos;\n\n    if (exprList.length > 1) {\n      val = this.startNodeAt(innerStartPos, innerStartLoc);\n      val.expressions = exprList;\n      this.finishNodeAt(val, \"SequenceExpression\", innerEndPos, innerEndLoc);\n    } else {\n      val = exprList[0];\n    }\n  } else {\n    val = this.parseParenExpression();\n  }\n\n  if (this.options.preserveParens) {\n    var par = this.startNodeAt(startPos, startLoc);\n    par.expression = val;\n    return this.finishNode(par, \"ParenthesizedExpression\")\n  } else {\n    return val\n  }\n};\n\npp$5.parseParenItem = function(item) {\n  return item\n};\n\npp$5.parseParenArrowList = function(startPos, startLoc, exprList, forInit) {\n  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, false, forInit)\n};\n\n// New's precedence is slightly tricky. It must allow its argument to\n// be a `[]` or dot subscript expression, but not a call — at least,\n// not without wrapping it in parentheses. Thus, it uses the noCalls\n// argument to parseSubscripts to prevent it from consuming the\n// argument list.\n\nvar empty = [];\n\npp$5.parseNew = function() {\n  if (this.containsEsc) { this.raiseRecoverable(this.start, \"Escape sequence in keyword new\"); }\n  var node = this.startNode();\n  this.next();\n  if (this.options.ecmaVersion >= 6 && this.type === types$1.dot) {\n    var meta = this.startNodeAt(node.start, node.loc && node.loc.start);\n    meta.name = \"new\";\n    node.meta = this.finishNode(meta, \"Identifier\");\n    this.next();\n    var containsEsc = this.containsEsc;\n    node.property = this.parseIdent(true);\n    if (node.property.name !== \"target\")\n      { this.raiseRecoverable(node.property.start, \"The only valid meta property for new is 'new.target'\"); }\n    if (containsEsc)\n      { this.raiseRecoverable(node.start, \"'new.target' must not contain escaped characters\"); }\n    if (!this.allowNewDotTarget)\n      { this.raiseRecoverable(node.start, \"'new.target' can only be used in functions and class static block\"); }\n    return this.finishNode(node, \"MetaProperty\")\n  }\n  var startPos = this.start, startLoc = this.startLoc;\n  node.callee = this.parseSubscripts(this.parseExprAtom(null, false, true), startPos, startLoc, true, false);\n  if (this.eat(types$1.parenL)) { node.arguments = this.parseExprList(types$1.parenR, this.options.ecmaVersion >= 8, false); }\n  else { node.arguments = empty; }\n  return this.finishNode(node, \"NewExpression\")\n};\n\n// Parse template expression.\n\npp$5.parseTemplateElement = function(ref) {\n  var isTagged = ref.isTagged;\n\n  var elem = this.startNode();\n  if (this.type === types$1.invalidTemplate) {\n    if (!isTagged) {\n      this.raiseRecoverable(this.start, \"Bad escape sequence in untagged template literal\");\n    }\n    elem.value = {\n      raw: this.value.replace(/\\r\\n?/g, \"\\n\"),\n      cooked: null\n    };\n  } else {\n    elem.value = {\n      raw: this.input.slice(this.start, this.end).replace(/\\r\\n?/g, \"\\n\"),\n      cooked: this.value\n    };\n  }\n  this.next();\n  elem.tail = this.type === types$1.backQuote;\n  return this.finishNode(elem, \"TemplateElement\")\n};\n\npp$5.parseTemplate = function(ref) {\n  if ( ref === void 0 ) ref = {};\n  var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;\n\n  var node = this.startNode();\n  this.next();\n  node.expressions = [];\n  var curElt = this.parseTemplateElement({isTagged: isTagged});\n  node.quasis = [curElt];\n  while (!curElt.tail) {\n    if (this.type === types$1.eof) { this.raise(this.pos, \"Unterminated template literal\"); }\n    this.expect(types$1.dollarBraceL);\n    node.expressions.push(this.parseExpression());\n    this.expect(types$1.braceR);\n    node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));\n  }\n  this.next();\n  return this.finishNode(node, \"TemplateLiteral\")\n};\n\npp$5.isAsyncProp = function(prop) {\n  return !prop.computed && prop.key.type === \"Identifier\" && prop.key.name === \"async\" &&\n    (this.type === types$1.name || this.type === types$1.num || this.type === types$1.string || this.type === types$1.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types$1.star)) &&\n    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n};\n\n// Parse an object literal or binding pattern.\n\npp$5.parseObj = function(isPattern, refDestructuringErrors) {\n  var node = this.startNode(), first = true, propHash = {};\n  node.properties = [];\n  this.next();\n  while (!this.eat(types$1.braceR)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (this.options.ecmaVersion >= 5 && this.afterTrailingComma(types$1.braceR)) { break }\n    } else { first = false; }\n\n    var prop = this.parseProperty(isPattern, refDestructuringErrors);\n    if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }\n    node.properties.push(prop);\n  }\n  return this.finishNode(node, isPattern ? \"ObjectPattern\" : \"ObjectExpression\")\n};\n\npp$5.parseProperty = function(isPattern, refDestructuringErrors) {\n  var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;\n  if (this.options.ecmaVersion >= 9 && this.eat(types$1.ellipsis)) {\n    if (isPattern) {\n      prop.argument = this.parseIdent(false);\n      if (this.type === types$1.comma) {\n        this.raiseRecoverable(this.start, \"Comma is not permitted after the rest element\");\n      }\n      return this.finishNode(prop, \"RestElement\")\n    }\n    // Parse argument.\n    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);\n    // To disallow trailing comma via `this.toAssignable()`.\n    if (this.type === types$1.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {\n      refDestructuringErrors.trailingComma = this.start;\n    }\n    // Finish\n    return this.finishNode(prop, \"SpreadElement\")\n  }\n  if (this.options.ecmaVersion >= 6) {\n    prop.method = false;\n    prop.shorthand = false;\n    if (isPattern || refDestructuringErrors) {\n      startPos = this.start;\n      startLoc = this.startLoc;\n    }\n    if (!isPattern)\n      { isGenerator = this.eat(types$1.star); }\n  }\n  var containsEsc = this.containsEsc;\n  this.parsePropertyName(prop);\n  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {\n    isAsync = true;\n    isGenerator = this.options.ecmaVersion >= 9 && this.eat(types$1.star);\n    this.parsePropertyName(prop);\n  } else {\n    isAsync = false;\n  }\n  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);\n  return this.finishNode(prop, \"Property\")\n};\n\npp$5.parseGetterSetter = function(prop) {\n  var kind = prop.key.name;\n  this.parsePropertyName(prop);\n  prop.value = this.parseMethod(false);\n  prop.kind = kind;\n  var paramCount = prop.kind === \"get\" ? 0 : 1;\n  if (prop.value.params.length !== paramCount) {\n    var start = prop.value.start;\n    if (prop.kind === \"get\")\n      { this.raiseRecoverable(start, \"getter should have no params\"); }\n    else\n      { this.raiseRecoverable(start, \"setter should have exactly one param\"); }\n  } else {\n    if (prop.kind === \"set\" && prop.value.params[0].type === \"RestElement\")\n      { this.raiseRecoverable(prop.value.params[0].start, \"Setter cannot use rest params\"); }\n  }\n};\n\npp$5.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {\n  if ((isGenerator || isAsync) && this.type === types$1.colon)\n    { this.unexpected(); }\n\n  if (this.eat(types$1.colon)) {\n    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);\n    prop.kind = \"init\";\n  } else if (this.options.ecmaVersion >= 6 && this.type === types$1.parenL) {\n    if (isPattern) { this.unexpected(); }\n    prop.method = true;\n    prop.value = this.parseMethod(isGenerator, isAsync);\n    prop.kind = \"init\";\n  } else if (!isPattern && !containsEsc &&\n             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === \"Identifier\" &&\n             (prop.key.name === \"get\" || prop.key.name === \"set\") &&\n             (this.type !== types$1.comma && this.type !== types$1.braceR && this.type !== types$1.eq)) {\n    if (isGenerator || isAsync) { this.unexpected(); }\n    this.parseGetterSetter(prop);\n  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === \"Identifier\") {\n    if (isGenerator || isAsync) { this.unexpected(); }\n    this.checkUnreserved(prop.key);\n    if (prop.key.name === \"await\" && !this.awaitIdentPos)\n      { this.awaitIdentPos = startPos; }\n    if (isPattern) {\n      prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));\n    } else if (this.type === types$1.eq && refDestructuringErrors) {\n      if (refDestructuringErrors.shorthandAssign < 0)\n        { refDestructuringErrors.shorthandAssign = this.start; }\n      prop.value = this.parseMaybeDefault(startPos, startLoc, this.copyNode(prop.key));\n    } else {\n      prop.value = this.copyNode(prop.key);\n    }\n    prop.kind = \"init\";\n    prop.shorthand = true;\n  } else { this.unexpected(); }\n};\n\npp$5.parsePropertyName = function(prop) {\n  if (this.options.ecmaVersion >= 6) {\n    if (this.eat(types$1.bracketL)) {\n      prop.computed = true;\n      prop.key = this.parseMaybeAssign();\n      this.expect(types$1.bracketR);\n      return prop.key\n    } else {\n      prop.computed = false;\n    }\n  }\n  return prop.key = this.type === types$1.num || this.type === types$1.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== \"never\")\n};\n\n// Initialize empty function node.\n\npp$5.initFunction = function(node) {\n  node.id = null;\n  if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }\n  if (this.options.ecmaVersion >= 8) { node.async = false; }\n};\n\n// Parse object or class method.\n\npp$5.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {\n  var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 6)\n    { node.generator = isGenerator; }\n  if (this.options.ecmaVersion >= 8)\n    { node.async = !!isAsync; }\n\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));\n\n  this.expect(types$1.parenL);\n  node.params = this.parseBindingList(types$1.parenR, false, this.options.ecmaVersion >= 8);\n  this.checkYieldAwaitInDefaultParams();\n  this.parseFunctionBody(node, false, true, false);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, \"FunctionExpression\")\n};\n\n// Parse arrow function expression with given parameters.\n\npp$5.parseArrowExpression = function(node, params, isAsync, forInit) {\n  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;\n\n  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);\n  this.initFunction(node);\n  if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }\n\n  this.yieldPos = 0;\n  this.awaitPos = 0;\n  this.awaitIdentPos = 0;\n\n  node.params = this.toAssignableList(params, true);\n  this.parseFunctionBody(node, true, false, forInit);\n\n  this.yieldPos = oldYieldPos;\n  this.awaitPos = oldAwaitPos;\n  this.awaitIdentPos = oldAwaitIdentPos;\n  return this.finishNode(node, \"ArrowFunctionExpression\")\n};\n\n// Parse function body and check parameters.\n\npp$5.parseFunctionBody = function(node, isArrowFunction, isMethod, forInit) {\n  var isExpression = isArrowFunction && this.type !== types$1.braceL;\n  var oldStrict = this.strict, useStrict = false;\n\n  if (isExpression) {\n    node.body = this.parseMaybeAssign(forInit);\n    node.expression = true;\n    this.checkParams(node, false);\n  } else {\n    var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);\n    if (!oldStrict || nonSimple) {\n      useStrict = this.strictDirective(this.end);\n      // If this is a strict mode function, verify that argument names\n      // are not repeated, and it does not try to bind the words `eval`\n      // or `arguments`.\n      if (useStrict && nonSimple)\n        { this.raiseRecoverable(node.start, \"Illegal 'use strict' directive in function with non-simple parameter list\"); }\n    }\n    // Start a new scope with regard to labels and the `inFunction`\n    // flag (restore them to their old value afterwards).\n    var oldLabels = this.labels;\n    this.labels = [];\n    if (useStrict) { this.strict = true; }\n\n    // Add the params to varDeclaredNames to ensure that an error is thrown\n    // if a let/const declaration in the function clashes with one of the params.\n    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));\n    // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'\n    if (this.strict && node.id) { this.checkLValSimple(node.id, BIND_OUTSIDE); }\n    node.body = this.parseBlock(false, undefined, useStrict && !oldStrict);\n    node.expression = false;\n    this.adaptDirectivePrologue(node.body.body);\n    this.labels = oldLabels;\n  }\n  this.exitScope();\n};\n\npp$5.isSimpleParamList = function(params) {\n  for (var i = 0, list = params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    if (param.type !== \"Identifier\") { return false\n  } }\n  return true\n};\n\n// Checks function params for various disallowed patterns such as using \"eval\"\n// or \"arguments\" and duplicate parameters.\n\npp$5.checkParams = function(node, allowDuplicates) {\n  var nameHash = Object.create(null);\n  for (var i = 0, list = node.params; i < list.length; i += 1)\n    {\n    var param = list[i];\n\n    this.checkLValInnerPattern(param, BIND_VAR, allowDuplicates ? null : nameHash);\n  }\n};\n\n// Parses a comma-separated list of expressions, and returns them as\n// an array. `close` is the token type that ends the list, and\n// `allowEmpty` can be turned on to allow subsequent commas with\n// nothing in between them to be parsed as `null` (which is needed\n// for array literals).\n\npp$5.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {\n  var elts = [], first = true;\n  while (!this.eat(close)) {\n    if (!first) {\n      this.expect(types$1.comma);\n      if (allowTrailingComma && this.afterTrailingComma(close)) { break }\n    } else { first = false; }\n\n    var elt = (void 0);\n    if (allowEmpty && this.type === types$1.comma)\n      { elt = null; }\n    else if (this.type === types$1.ellipsis) {\n      elt = this.parseSpread(refDestructuringErrors);\n      if (refDestructuringErrors && this.type === types$1.comma && refDestructuringErrors.trailingComma < 0)\n        { refDestructuringErrors.trailingComma = this.start; }\n    } else {\n      elt = this.parseMaybeAssign(false, refDestructuringErrors);\n    }\n    elts.push(elt);\n  }\n  return elts\n};\n\npp$5.checkUnreserved = function(ref) {\n  var start = ref.start;\n  var end = ref.end;\n  var name = ref.name;\n\n  if (this.inGenerator && name === \"yield\")\n    { this.raiseRecoverable(start, \"Cannot use 'yield' as identifier inside a generator\"); }\n  if (this.inAsync && name === \"await\")\n    { this.raiseRecoverable(start, \"Cannot use 'await' as identifier inside an async function\"); }\n  if (!(this.currentThisScope().flags & SCOPE_VAR) && name === \"arguments\")\n    { this.raiseRecoverable(start, \"Cannot use 'arguments' in class field initializer\"); }\n  if (this.inClassStaticBlock && (name === \"arguments\" || name === \"await\"))\n    { this.raise(start, (\"Cannot use \" + name + \" in class static initialization block\")); }\n  if (this.keywords.test(name))\n    { this.raise(start, (\"Unexpected keyword '\" + name + \"'\")); }\n  if (this.options.ecmaVersion < 6 &&\n    this.input.slice(start, end).indexOf(\"\\\\\") !== -1) { return }\n  var re = this.strict ? this.reservedWordsStrict : this.reservedWords;\n  if (re.test(name)) {\n    if (!this.inAsync && name === \"await\")\n      { this.raiseRecoverable(start, \"Cannot use keyword 'await' outside an async function\"); }\n    this.raiseRecoverable(start, (\"The keyword '\" + name + \"' is reserved\"));\n  }\n};\n\n// Parse the next token as an identifier. If `liberal` is true (used\n// when parsing properties), it will also convert keywords into\n// identifiers.\n\npp$5.parseIdent = function(liberal) {\n  var node = this.parseIdentNode();\n  this.next(!!liberal);\n  this.finishNode(node, \"Identifier\");\n  if (!liberal) {\n    this.checkUnreserved(node);\n    if (node.name === \"await\" && !this.awaitIdentPos)\n      { this.awaitIdentPos = node.start; }\n  }\n  return node\n};\n\npp$5.parseIdentNode = function() {\n  var node = this.startNode();\n  if (this.type === types$1.name) {\n    node.name = this.value;\n  } else if (this.type.keyword) {\n    node.name = this.type.keyword;\n\n    // To fix https://github.com/acornjs/acorn/issues/575\n    // `class` and `function` keywords push new context into this.context.\n    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.\n    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword\n    if ((node.name === \"class\" || node.name === \"function\") &&\n      (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {\n      this.context.pop();\n    }\n    this.type = types$1.name;\n  } else {\n    this.unexpected();\n  }\n  return node\n};\n\npp$5.parsePrivateIdent = function() {\n  var node = this.startNode();\n  if (this.type === types$1.privateId) {\n    node.name = this.value;\n  } else {\n    this.unexpected();\n  }\n  this.next();\n  this.finishNode(node, \"PrivateIdentifier\");\n\n  // For validating existence\n  if (this.options.checkPrivateFields) {\n    if (this.privateNameStack.length === 0) {\n      this.raise(node.start, (\"Private field '#\" + (node.name) + \"' must be declared in an enclosing class\"));\n    } else {\n      this.privateNameStack[this.privateNameStack.length - 1].used.push(node);\n    }\n  }\n\n  return node\n};\n\n// Parses yield expression inside generator.\n\npp$5.parseYield = function(forInit) {\n  if (!this.yieldPos) { this.yieldPos = this.start; }\n\n  var node = this.startNode();\n  this.next();\n  if (this.type === types$1.semi || this.canInsertSemicolon() || (this.type !== types$1.star && !this.type.startsExpr)) {\n    node.delegate = false;\n    node.argument = null;\n  } else {\n    node.delegate = this.eat(types$1.star);\n    node.argument = this.parseMaybeAssign(forInit);\n  }\n  return this.finishNode(node, \"YieldExpression\")\n};\n\npp$5.parseAwait = function(forInit) {\n  if (!this.awaitPos) { this.awaitPos = this.start; }\n\n  var node = this.startNode();\n  this.next();\n  node.argument = this.parseMaybeUnary(null, true, false, forInit);\n  return this.finishNode(node, \"AwaitExpression\")\n};\n\nvar pp$4 = Parser.prototype;\n\n// This function is used to raise exceptions on parse errors. It\n// takes an offset integer (into the current `input`) to indicate\n// the location of the error, attaches the position to the end\n// of the error message, and then raises a `SyntaxError` with that\n// message.\n\npp$4.raise = function(pos, message) {\n  var loc = getLineInfo(this.input, pos);\n  message += \" (\" + loc.line + \":\" + loc.column + \")\";\n  if (this.sourceFile) {\n    message += \" in \" + this.sourceFile;\n  }\n  var err = new SyntaxError(message);\n  err.pos = pos; err.loc = loc; err.raisedAt = this.pos;\n  throw err\n};\n\npp$4.raiseRecoverable = pp$4.raise;\n\npp$4.curPosition = function() {\n  if (this.options.locations) {\n    return new Position(this.curLine, this.pos - this.lineStart)\n  }\n};\n\nvar pp$3 = Parser.prototype;\n\nvar Scope = function Scope(flags) {\n  this.flags = flags;\n  // A list of var-declared names in the current lexical scope\n  this.var = [];\n  // A list of lexically-declared names in the current lexical scope\n  this.lexical = [];\n  // A list of lexically-declared FunctionDeclaration names in the current lexical scope\n  this.functions = [];\n};\n\n// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.\n\npp$3.enterScope = function(flags) {\n  this.scopeStack.push(new Scope(flags));\n};\n\npp$3.exitScope = function() {\n  this.scopeStack.pop();\n};\n\n// The spec says:\n// > At the top level of a function, or script, function declarations are\n// > treated like var declarations rather than like lexical declarations.\npp$3.treatFunctionsAsVarInScope = function(scope) {\n  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)\n};\n\npp$3.declareName = function(name, bindingType, pos) {\n  var redeclared = false;\n  if (bindingType === BIND_LEXICAL) {\n    var scope = this.currentScope();\n    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;\n    scope.lexical.push(name);\n    if (this.inModule && (scope.flags & SCOPE_TOP))\n      { delete this.undefinedExports[name]; }\n  } else if (bindingType === BIND_SIMPLE_CATCH) {\n    var scope$1 = this.currentScope();\n    scope$1.lexical.push(name);\n  } else if (bindingType === BIND_FUNCTION) {\n    var scope$2 = this.currentScope();\n    if (this.treatFunctionsAsVar)\n      { redeclared = scope$2.lexical.indexOf(name) > -1; }\n    else\n      { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }\n    scope$2.functions.push(name);\n  } else {\n    for (var i = this.scopeStack.length - 1; i >= 0; --i) {\n      var scope$3 = this.scopeStack[i];\n      if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||\n          !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {\n        redeclared = true;\n        break\n      }\n      scope$3.var.push(name);\n      if (this.inModule && (scope$3.flags & SCOPE_TOP))\n        { delete this.undefinedExports[name]; }\n      if (scope$3.flags & SCOPE_VAR) { break }\n    }\n  }\n  if (redeclared) { this.raiseRecoverable(pos, (\"Identifier '\" + name + \"' has already been declared\")); }\n};\n\npp$3.checkLocalExport = function(id) {\n  // scope.functions must be empty as Module code is always strict.\n  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&\n      this.scopeStack[0].var.indexOf(id.name) === -1) {\n    this.undefinedExports[id.name] = id;\n  }\n};\n\npp$3.currentScope = function() {\n  return this.scopeStack[this.scopeStack.length - 1]\n};\n\npp$3.currentVarScope = function() {\n  for (var i = this.scopeStack.length - 1;; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.flags & (SCOPE_VAR | SCOPE_CLASS_FIELD_INIT | SCOPE_CLASS_STATIC_BLOCK)) { return scope }\n  }\n};\n\n// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.\npp$3.currentThisScope = function() {\n  for (var i = this.scopeStack.length - 1;; i--) {\n    var scope = this.scopeStack[i];\n    if (scope.flags & (SCOPE_VAR | SCOPE_CLASS_FIELD_INIT | SCOPE_CLASS_STATIC_BLOCK) &&\n        !(scope.flags & SCOPE_ARROW)) { return scope }\n  }\n};\n\nvar Node = function Node(parser, pos, loc) {\n  this.type = \"\";\n  this.start = pos;\n  this.end = 0;\n  if (parser.options.locations)\n    { this.loc = new SourceLocation(parser, loc); }\n  if (parser.options.directSourceFile)\n    { this.sourceFile = parser.options.directSourceFile; }\n  if (parser.options.ranges)\n    { this.range = [pos, 0]; }\n};\n\n// Start an AST node, attaching a start offset.\n\nvar pp$2 = Parser.prototype;\n\npp$2.startNode = function() {\n  return new Node(this, this.start, this.startLoc)\n};\n\npp$2.startNodeAt = function(pos, loc) {\n  return new Node(this, pos, loc)\n};\n\n// Finish an AST node, adding `type` and `end` properties.\n\nfunction finishNodeAt(node, type, pos, loc) {\n  node.type = type;\n  node.end = pos;\n  if (this.options.locations)\n    { node.loc.end = loc; }\n  if (this.options.ranges)\n    { node.range[1] = pos; }\n  return node\n}\n\npp$2.finishNode = function(node, type) {\n  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)\n};\n\n// Finish node at given position\n\npp$2.finishNodeAt = function(node, type, pos, loc) {\n  return finishNodeAt.call(this, node, type, pos, loc)\n};\n\npp$2.copyNode = function(node) {\n  var newNode = new Node(this, node.start, this.startLoc);\n  for (var prop in node) { newNode[prop] = node[prop]; }\n  return newNode\n};\n\n// This file was generated by \"bin/generate-unicode-script-values.js\". Do not modify manually!\nvar scriptValuesAddedInUnicode = \"Gara Garay Gukh Gurung_Khema Hrkt Katakana_Or_Hiragana Kawi Kirat_Rai Krai Nag_Mundari Nagm Ol_Onal Onao Sunu Sunuwar Todhri Todr Tulu_Tigalari Tutg Unknown Zzzz\";\n\n// This file contains Unicode properties extracted from the ECMAScript specification.\n// The lists are extracted like so:\n// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)\n\n// #table-binary-unicode-properties\nvar ecma9BinaryProperties = \"ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS\";\nvar ecma10BinaryProperties = ecma9BinaryProperties + \" Extended_Pictographic\";\nvar ecma11BinaryProperties = ecma10BinaryProperties;\nvar ecma12BinaryProperties = ecma11BinaryProperties + \" EBase EComp EMod EPres ExtPict\";\nvar ecma13BinaryProperties = ecma12BinaryProperties;\nvar ecma14BinaryProperties = ecma13BinaryProperties;\n\nvar unicodeBinaryProperties = {\n  9: ecma9BinaryProperties,\n  10: ecma10BinaryProperties,\n  11: ecma11BinaryProperties,\n  12: ecma12BinaryProperties,\n  13: ecma13BinaryProperties,\n  14: ecma14BinaryProperties\n};\n\n// #table-binary-unicode-properties-of-strings\nvar ecma14BinaryPropertiesOfStrings = \"Basic_Emoji Emoji_Keycap_Sequence RGI_Emoji_Modifier_Sequence RGI_Emoji_Flag_Sequence RGI_Emoji_Tag_Sequence RGI_Emoji_ZWJ_Sequence RGI_Emoji\";\n\nvar unicodeBinaryPropertiesOfStrings = {\n  9: \"\",\n  10: \"\",\n  11: \"\",\n  12: \"\",\n  13: \"\",\n  14: ecma14BinaryPropertiesOfStrings\n};\n\n// #table-unicode-general-category-values\nvar unicodeGeneralCategoryValues = \"Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu\";\n\n// #table-unicode-script-values\nvar ecma9ScriptValues = \"Adlam Adlm Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb\";\nvar ecma10ScriptValues = ecma9ScriptValues + \" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd\";\nvar ecma11ScriptValues = ecma10ScriptValues + \" Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho\";\nvar ecma12ScriptValues = ecma11ScriptValues + \" Chorasmian Chrs Diak Dives_Akuru Khitan_Small_Script Kits Yezi Yezidi\";\nvar ecma13ScriptValues = ecma12ScriptValues + \" Cypro_Minoan Cpmn Old_Uyghur Ougr Tangsa Tnsa Toto Vithkuqi Vith\";\nvar ecma14ScriptValues = ecma13ScriptValues + \" \" + scriptValuesAddedInUnicode;\n\nvar unicodeScriptValues = {\n  9: ecma9ScriptValues,\n  10: ecma10ScriptValues,\n  11: ecma11ScriptValues,\n  12: ecma12ScriptValues,\n  13: ecma13ScriptValues,\n  14: ecma14ScriptValues\n};\n\nvar data = {};\nfunction buildUnicodeData(ecmaVersion) {\n  var d = data[ecmaVersion] = {\n    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + \" \" + unicodeGeneralCategoryValues),\n    binaryOfStrings: wordsRegexp(unicodeBinaryPropertiesOfStrings[ecmaVersion]),\n    nonBinary: {\n      General_Category: wordsRegexp(unicodeGeneralCategoryValues),\n      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])\n    }\n  };\n  d.nonBinary.Script_Extensions = d.nonBinary.Script;\n\n  d.nonBinary.gc = d.nonBinary.General_Category;\n  d.nonBinary.sc = d.nonBinary.Script;\n  d.nonBinary.scx = d.nonBinary.Script_Extensions;\n}\n\nfor (var i = 0, list = [9, 10, 11, 12, 13, 14]; i < list.length; i += 1) {\n  var ecmaVersion = list[i];\n\n  buildUnicodeData(ecmaVersion);\n}\n\nvar pp$1 = Parser.prototype;\n\n// Track disjunction structure to determine whether a duplicate\n// capture group name is allowed because it is in a separate branch.\nvar BranchID = function BranchID(parent, base) {\n  // Parent disjunction branch\n  this.parent = parent;\n  // Identifies this set of sibling branches\n  this.base = base || this;\n};\n\nBranchID.prototype.separatedFrom = function separatedFrom (alt) {\n  // A branch is separate from another branch if they or any of\n  // their parents are siblings in a given disjunction\n  for (var self = this; self; self = self.parent) {\n    for (var other = alt; other; other = other.parent) {\n      if (self.base === other.base && self !== other) { return true }\n    }\n  }\n  return false\n};\n\nBranchID.prototype.sibling = function sibling () {\n  return new BranchID(this.parent, this.base)\n};\n\nvar RegExpValidationState = function RegExpValidationState(parser) {\n  this.parser = parser;\n  this.validFlags = \"gim\" + (parser.options.ecmaVersion >= 6 ? \"uy\" : \"\") + (parser.options.ecmaVersion >= 9 ? \"s\" : \"\") + (parser.options.ecmaVersion >= 13 ? \"d\" : \"\") + (parser.options.ecmaVersion >= 15 ? \"v\" : \"\");\n  this.unicodeProperties = data[parser.options.ecmaVersion >= 14 ? 14 : parser.options.ecmaVersion];\n  this.source = \"\";\n  this.flags = \"\";\n  this.start = 0;\n  this.switchU = false;\n  this.switchV = false;\n  this.switchN = false;\n  this.pos = 0;\n  this.lastIntValue = 0;\n  this.lastStringValue = \"\";\n  this.lastAssertionIsQuantifiable = false;\n  this.numCapturingParens = 0;\n  this.maxBackReference = 0;\n  this.groupNames = Object.create(null);\n  this.backReferenceNames = [];\n  this.branchID = null;\n};\n\nRegExpValidationState.prototype.reset = function reset (start, pattern, flags) {\n  var unicodeSets = flags.indexOf(\"v\") !== -1;\n  var unicode = flags.indexOf(\"u\") !== -1;\n  this.start = start | 0;\n  this.source = pattern + \"\";\n  this.flags = flags;\n  if (unicodeSets && this.parser.options.ecmaVersion >= 15) {\n    this.switchU = true;\n    this.switchV = true;\n    this.switchN = true;\n  } else {\n    this.switchU = unicode && this.parser.options.ecmaVersion >= 6;\n    this.switchV = false;\n    this.switchN = unicode && this.parser.options.ecmaVersion >= 9;\n  }\n};\n\nRegExpValidationState.prototype.raise = function raise (message) {\n  this.parser.raiseRecoverable(this.start, (\"Invalid regular expression: /\" + (this.source) + \"/: \" + message));\n};\n\n// If u flag is given, this returns the code point at the index (it combines a surrogate pair).\n// Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).\nRegExpValidationState.prototype.at = function at (i, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var s = this.source;\n  var l = s.length;\n  if (i >= l) {\n    return -1\n  }\n  var c = s.charCodeAt(i);\n  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {\n    return c\n  }\n  var next = s.charCodeAt(i + 1);\n  return next >= 0xDC00 && next <= 0xDFFF ? (c << 10) + next - 0x35FDC00 : c\n};\n\nRegExpValidationState.prototype.nextIndex = function nextIndex (i, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var s = this.source;\n  var l = s.length;\n  if (i >= l) {\n    return l\n  }\n  var c = s.charCodeAt(i), next;\n  if (!(forceU || this.switchU) || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l ||\n      (next = s.charCodeAt(i + 1)) < 0xDC00 || next > 0xDFFF) {\n    return i + 1\n  }\n  return i + 2\n};\n\nRegExpValidationState.prototype.current = function current (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  return this.at(this.pos, forceU)\n};\n\nRegExpValidationState.prototype.lookahead = function lookahead (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  return this.at(this.nextIndex(this.pos, forceU), forceU)\n};\n\nRegExpValidationState.prototype.advance = function advance (forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  this.pos = this.nextIndex(this.pos, forceU);\n};\n\nRegExpValidationState.prototype.eat = function eat (ch, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  if (this.current(forceU) === ch) {\n    this.advance(forceU);\n    return true\n  }\n  return false\n};\n\nRegExpValidationState.prototype.eatChars = function eatChars (chs, forceU) {\n    if ( forceU === void 0 ) forceU = false;\n\n  var pos = this.pos;\n  for (var i = 0, list = chs; i < list.length; i += 1) {\n    var ch = list[i];\n\n      var current = this.at(pos, forceU);\n    if (current === -1 || current !== ch) {\n      return false\n    }\n    pos = this.nextIndex(pos, forceU);\n  }\n  this.pos = pos;\n  return true\n};\n\n/**\n * Validate the flags part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp$1.validateRegExpFlags = function(state) {\n  var validFlags = state.validFlags;\n  var flags = state.flags;\n\n  var u = false;\n  var v = false;\n\n  for (var i = 0; i < flags.length; i++) {\n    var flag = flags.charAt(i);\n    if (validFlags.indexOf(flag) === -1) {\n      this.raise(state.start, \"Invalid regular expression flag\");\n    }\n    if (flags.indexOf(flag, i + 1) > -1) {\n      this.raise(state.start, \"Duplicate regular expression flag\");\n    }\n    if (flag === \"u\") { u = true; }\n    if (flag === \"v\") { v = true; }\n  }\n  if (this.options.ecmaVersion >= 15 && u && v) {\n    this.raise(state.start, \"Invalid regular expression flag\");\n  }\n};\n\nfunction hasProp(obj) {\n  for (var _ in obj) { return true }\n  return false\n}\n\n/**\n * Validate the pattern part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp$1.validateRegExpPattern = function(state) {\n  this.regexp_pattern(state);\n\n  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of\n  // parsing contains a |GroupName|, reparse with the goal symbol\n  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*\n  // exception if _P_ did not conform to the grammar, if any elements of _P_\n  // were not matched by the parse, or if any Early Error conditions exist.\n  if (!state.switchN && this.options.ecmaVersion >= 9 && hasProp(state.groupNames)) {\n    state.switchN = true;\n    this.regexp_pattern(state);\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern\npp$1.regexp_pattern = function(state) {\n  state.pos = 0;\n  state.lastIntValue = 0;\n  state.lastStringValue = \"\";\n  state.lastAssertionIsQuantifiable = false;\n  state.numCapturingParens = 0;\n  state.maxBackReference = 0;\n  state.groupNames = Object.create(null);\n  state.backReferenceNames.length = 0;\n  state.branchID = null;\n\n  this.regexp_disjunction(state);\n\n  if (state.pos !== state.source.length) {\n    // Make the same messages as V8.\n    if (state.eat(0x29 /* ) */)) {\n      state.raise(\"Unmatched ')'\");\n    }\n    if (state.eat(0x5D /* ] */) || state.eat(0x7D /* } */)) {\n      state.raise(\"Lone quantifier brackets\");\n    }\n  }\n  if (state.maxBackReference > state.numCapturingParens) {\n    state.raise(\"Invalid escape\");\n  }\n  for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {\n    var name = list[i];\n\n    if (!state.groupNames[name]) {\n      state.raise(\"Invalid named capture referenced\");\n    }\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction\npp$1.regexp_disjunction = function(state) {\n  var trackDisjunction = this.options.ecmaVersion >= 16;\n  if (trackDisjunction) { state.branchID = new BranchID(state.branchID, null); }\n  this.regexp_alternative(state);\n  while (state.eat(0x7C /* | */)) {\n    if (trackDisjunction) { state.branchID = state.branchID.sibling(); }\n    this.regexp_alternative(state);\n  }\n  if (trackDisjunction) { state.branchID = state.branchID.parent; }\n\n  // Make the same message as V8.\n  if (this.regexp_eatQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\");\n  }\n  if (state.eat(0x7B /* { */)) {\n    state.raise(\"Lone quantifier brackets\");\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative\npp$1.regexp_alternative = function(state) {\n  while (state.pos < state.source.length && this.regexp_eatTerm(state)) {}\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term\npp$1.regexp_eatTerm = function(state) {\n  if (this.regexp_eatAssertion(state)) {\n    // Handle `QuantifiableAssertion Quantifier` alternative.\n    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion\n    // is a QuantifiableAssertion.\n    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {\n      // Make the same message as V8.\n      if (state.switchU) {\n        state.raise(\"Invalid quantifier\");\n      }\n    }\n    return true\n  }\n\n  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {\n    this.regexp_eatQuantifier(state);\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion\npp$1.regexp_eatAssertion = function(state) {\n  var start = state.pos;\n  state.lastAssertionIsQuantifiable = false;\n\n  // ^, $\n  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {\n    return true\n  }\n\n  // \\b \\B\n  if (state.eat(0x5C /* \\ */)) {\n    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {\n      return true\n    }\n    state.pos = start;\n  }\n\n  // Lookahead / Lookbehind\n  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {\n    var lookbehind = false;\n    if (this.options.ecmaVersion >= 9) {\n      lookbehind = state.eat(0x3C /* < */);\n    }\n    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {\n      this.regexp_disjunction(state);\n      if (!state.eat(0x29 /* ) */)) {\n        state.raise(\"Unterminated group\");\n      }\n      state.lastAssertionIsQuantifiable = !lookbehind;\n      return true\n    }\n  }\n\n  state.pos = start;\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier\npp$1.regexp_eatQuantifier = function(state, noError) {\n  if ( noError === void 0 ) noError = false;\n\n  if (this.regexp_eatQuantifierPrefix(state, noError)) {\n    state.eat(0x3F /* ? */);\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix\npp$1.regexp_eatQuantifierPrefix = function(state, noError) {\n  return (\n    state.eat(0x2A /* * */) ||\n    state.eat(0x2B /* + */) ||\n    state.eat(0x3F /* ? */) ||\n    this.regexp_eatBracedQuantifier(state, noError)\n  )\n};\npp$1.regexp_eatBracedQuantifier = function(state, noError) {\n  var start = state.pos;\n  if (state.eat(0x7B /* { */)) {\n    var min = 0, max = -1;\n    if (this.regexp_eatDecimalDigits(state)) {\n      min = state.lastIntValue;\n      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {\n        max = state.lastIntValue;\n      }\n      if (state.eat(0x7D /* } */)) {\n        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term\n        if (max !== -1 && max < min && !noError) {\n          state.raise(\"numbers out of order in {} quantifier\");\n        }\n        return true\n      }\n    }\n    if (state.switchU && !noError) {\n      state.raise(\"Incomplete quantifier\");\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom\npp$1.regexp_eatAtom = function(state) {\n  return (\n    this.regexp_eatPatternCharacters(state) ||\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state)\n  )\n};\npp$1.regexp_eatReverseSolidusAtomEscape = function(state) {\n  var start = state.pos;\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatAtomEscape(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatUncapturingGroup = function(state) {\n  var start = state.pos;\n  if (state.eat(0x28 /* ( */)) {\n    if (state.eat(0x3F /* ? */)) {\n      if (this.options.ecmaVersion >= 16) {\n        var addModifiers = this.regexp_eatModifiers(state);\n        var hasHyphen = state.eat(0x2D /* - */);\n        if (addModifiers || hasHyphen) {\n          for (var i = 0; i < addModifiers.length; i++) {\n            var modifier = addModifiers.charAt(i);\n            if (addModifiers.indexOf(modifier, i + 1) > -1) {\n              state.raise(\"Duplicate regular expression modifiers\");\n            }\n          }\n          if (hasHyphen) {\n            var removeModifiers = this.regexp_eatModifiers(state);\n            if (!addModifiers && !removeModifiers && state.current() === 0x3A /* : */) {\n              state.raise(\"Invalid regular expression modifiers\");\n            }\n            for (var i$1 = 0; i$1 < removeModifiers.length; i$1++) {\n              var modifier$1 = removeModifiers.charAt(i$1);\n              if (\n                removeModifiers.indexOf(modifier$1, i$1 + 1) > -1 ||\n                addModifiers.indexOf(modifier$1) > -1\n              ) {\n                state.raise(\"Duplicate regular expression modifiers\");\n              }\n            }\n          }\n        }\n      }\n      if (state.eat(0x3A /* : */)) {\n        this.regexp_disjunction(state);\n        if (state.eat(0x29 /* ) */)) {\n          return true\n        }\n        state.raise(\"Unterminated group\");\n      }\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatCapturingGroup = function(state) {\n  if (state.eat(0x28 /* ( */)) {\n    if (this.options.ecmaVersion >= 9) {\n      this.regexp_groupSpecifier(state);\n    } else if (state.current() === 0x3F /* ? */) {\n      state.raise(\"Invalid group\");\n    }\n    this.regexp_disjunction(state);\n    if (state.eat(0x29 /* ) */)) {\n      state.numCapturingParens += 1;\n      return true\n    }\n    state.raise(\"Unterminated group\");\n  }\n  return false\n};\n// RegularExpressionModifiers ::\n//   [empty]\n//   RegularExpressionModifiers RegularExpressionModifier\npp$1.regexp_eatModifiers = function(state) {\n  var modifiers = \"\";\n  var ch = 0;\n  while ((ch = state.current()) !== -1 && isRegularExpressionModifier(ch)) {\n    modifiers += codePointToString(ch);\n    state.advance();\n  }\n  return modifiers\n};\n// RegularExpressionModifier :: one of\n//   `i` `m` `s`\nfunction isRegularExpressionModifier(ch) {\n  return ch === 0x69 /* i */ || ch === 0x6d /* m */ || ch === 0x73 /* s */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom\npp$1.regexp_eatExtendedAtom = function(state) {\n  return (\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state) ||\n    this.regexp_eatInvalidBracedQuantifier(state) ||\n    this.regexp_eatExtendedPatternCharacter(state)\n  )\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier\npp$1.regexp_eatInvalidBracedQuantifier = function(state) {\n  if (this.regexp_eatBracedQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter\npp$1.regexp_eatSyntaxCharacter = function(state) {\n  var ch = state.current();\n  if (isSyntaxCharacter(ch)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n  return false\n};\nfunction isSyntaxCharacter(ch) {\n  return (\n    ch === 0x24 /* $ */ ||\n    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||\n    ch === 0x2E /* . */ ||\n    ch === 0x3F /* ? */ ||\n    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||\n    ch >= 0x7B /* { */ && ch <= 0x7D /* } */\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter\n// But eat eager.\npp$1.regexp_eatPatternCharacters = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {\n    state.advance();\n  }\n  return state.pos !== start\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter\npp$1.regexp_eatExtendedPatternCharacter = function(state) {\n  var ch = state.current();\n  if (\n    ch !== -1 &&\n    ch !== 0x24 /* $ */ &&\n    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&\n    ch !== 0x2E /* . */ &&\n    ch !== 0x3F /* ? */ &&\n    ch !== 0x5B /* [ */ &&\n    ch !== 0x5E /* ^ */ &&\n    ch !== 0x7C /* | */\n  ) {\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// GroupSpecifier ::\n//   [empty]\n//   `?` GroupName\npp$1.regexp_groupSpecifier = function(state) {\n  if (state.eat(0x3F /* ? */)) {\n    if (!this.regexp_eatGroupName(state)) { state.raise(\"Invalid group\"); }\n    var trackDisjunction = this.options.ecmaVersion >= 16;\n    var known = state.groupNames[state.lastStringValue];\n    if (known) {\n      if (trackDisjunction) {\n        for (var i = 0, list = known; i < list.length; i += 1) {\n          var altID = list[i];\n\n          if (!altID.separatedFrom(state.branchID))\n            { state.raise(\"Duplicate capture group name\"); }\n        }\n      } else {\n        state.raise(\"Duplicate capture group name\");\n      }\n    }\n    if (trackDisjunction) {\n      (known || (state.groupNames[state.lastStringValue] = [])).push(state.branchID);\n    } else {\n      state.groupNames[state.lastStringValue] = true;\n    }\n  }\n};\n\n// GroupName ::\n//   `<` RegExpIdentifierName `>`\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$1.regexp_eatGroupName = function(state) {\n  state.lastStringValue = \"\";\n  if (state.eat(0x3C /* < */)) {\n    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {\n      return true\n    }\n    state.raise(\"Invalid capture group name\");\n  }\n  return false\n};\n\n// RegExpIdentifierName ::\n//   RegExpIdentifierStart\n//   RegExpIdentifierName RegExpIdentifierPart\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp$1.regexp_eatRegExpIdentifierName = function(state) {\n  state.lastStringValue = \"\";\n  if (this.regexp_eatRegExpIdentifierStart(state)) {\n    state.lastStringValue += codePointToString(state.lastIntValue);\n    while (this.regexp_eatRegExpIdentifierPart(state)) {\n      state.lastStringValue += codePointToString(state.lastIntValue);\n    }\n    return true\n  }\n  return false\n};\n\n// RegExpIdentifierStart ::\n//   UnicodeIDStart\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\npp$1.regexp_eatRegExpIdentifierStart = function(state) {\n  var start = state.pos;\n  var forceU = this.options.ecmaVersion >= 11;\n  var ch = state.current(forceU);\n  state.advance(forceU);\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {\n    ch = state.lastIntValue;\n  }\n  if (isRegExpIdentifierStart(ch)) {\n    state.lastIntValue = ch;\n    return true\n  }\n\n  state.pos = start;\n  return false\n};\nfunction isRegExpIdentifierStart(ch) {\n  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */\n}\n\n// RegExpIdentifierPart ::\n//   UnicodeIDContinue\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[+U]\n//   <ZWNJ>\n//   <ZWJ>\npp$1.regexp_eatRegExpIdentifierPart = function(state) {\n  var start = state.pos;\n  var forceU = this.options.ecmaVersion >= 11;\n  var ch = state.current(forceU);\n  state.advance(forceU);\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state, forceU)) {\n    ch = state.lastIntValue;\n  }\n  if (isRegExpIdentifierPart(ch)) {\n    state.lastIntValue = ch;\n    return true\n  }\n\n  state.pos = start;\n  return false\n};\nfunction isRegExpIdentifierPart(ch) {\n  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape\npp$1.regexp_eatAtomEscape = function(state) {\n  if (\n    this.regexp_eatBackReference(state) ||\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state) ||\n    (state.switchN && this.regexp_eatKGroupName(state))\n  ) {\n    return true\n  }\n  if (state.switchU) {\n    // Make the same message as V8.\n    if (state.current() === 0x63 /* c */) {\n      state.raise(\"Invalid unicode escape\");\n    }\n    state.raise(\"Invalid escape\");\n  }\n  return false\n};\npp$1.regexp_eatBackReference = function(state) {\n  var start = state.pos;\n  if (this.regexp_eatDecimalEscape(state)) {\n    var n = state.lastIntValue;\n    if (state.switchU) {\n      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape\n      if (n > state.maxBackReference) {\n        state.maxBackReference = n;\n      }\n      return true\n    }\n    if (n <= state.numCapturingParens) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatKGroupName = function(state) {\n  if (state.eat(0x6B /* k */)) {\n    if (this.regexp_eatGroupName(state)) {\n      state.backReferenceNames.push(state.lastStringValue);\n      return true\n    }\n    state.raise(\"Invalid named reference\");\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape\npp$1.regexp_eatCharacterEscape = function(state) {\n  return (\n    this.regexp_eatControlEscape(state) ||\n    this.regexp_eatCControlLetter(state) ||\n    this.regexp_eatZero(state) ||\n    this.regexp_eatHexEscapeSequence(state) ||\n    this.regexp_eatRegExpUnicodeEscapeSequence(state, false) ||\n    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||\n    this.regexp_eatIdentityEscape(state)\n  )\n};\npp$1.regexp_eatCControlLetter = function(state) {\n  var start = state.pos;\n  if (state.eat(0x63 /* c */)) {\n    if (this.regexp_eatControlLetter(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\npp$1.regexp_eatZero = function(state) {\n  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {\n    state.lastIntValue = 0;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape\npp$1.regexp_eatControlEscape = function(state) {\n  var ch = state.current();\n  if (ch === 0x74 /* t */) {\n    state.lastIntValue = 0x09; /* \\t */\n    state.advance();\n    return true\n  }\n  if (ch === 0x6E /* n */) {\n    state.lastIntValue = 0x0A; /* \\n */\n    state.advance();\n    return true\n  }\n  if (ch === 0x76 /* v */) {\n    state.lastIntValue = 0x0B; /* \\v */\n    state.advance();\n    return true\n  }\n  if (ch === 0x66 /* f */) {\n    state.lastIntValue = 0x0C; /* \\f */\n    state.advance();\n    return true\n  }\n  if (ch === 0x72 /* r */) {\n    state.lastIntValue = 0x0D; /* \\r */\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter\npp$1.regexp_eatControlLetter = function(state) {\n  var ch = state.current();\n  if (isControlLetter(ch)) {\n    state.lastIntValue = ch % 0x20;\n    state.advance();\n    return true\n  }\n  return false\n};\nfunction isControlLetter(ch) {\n  return (\n    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence\npp$1.regexp_eatRegExpUnicodeEscapeSequence = function(state, forceU) {\n  if ( forceU === void 0 ) forceU = false;\n\n  var start = state.pos;\n  var switchU = forceU || state.switchU;\n\n  if (state.eat(0x75 /* u */)) {\n    if (this.regexp_eatFixedHexDigits(state, 4)) {\n      var lead = state.lastIntValue;\n      if (switchU && lead >= 0xD800 && lead <= 0xDBFF) {\n        var leadSurrogateEnd = state.pos;\n        if (state.eat(0x5C /* \\ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {\n          var trail = state.lastIntValue;\n          if (trail >= 0xDC00 && trail <= 0xDFFF) {\n            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;\n            return true\n          }\n        }\n        state.pos = leadSurrogateEnd;\n        state.lastIntValue = lead;\n      }\n      return true\n    }\n    if (\n      switchU &&\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatHexDigits(state) &&\n      state.eat(0x7D /* } */) &&\n      isValidUnicode(state.lastIntValue)\n    ) {\n      return true\n    }\n    if (switchU) {\n      state.raise(\"Invalid unicode escape\");\n    }\n    state.pos = start;\n  }\n\n  return false\n};\nfunction isValidUnicode(ch) {\n  return ch >= 0 && ch <= 0x10FFFF\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape\npp$1.regexp_eatIdentityEscape = function(state) {\n  if (state.switchU) {\n    if (this.regexp_eatSyntaxCharacter(state)) {\n      return true\n    }\n    if (state.eat(0x2F /* / */)) {\n      state.lastIntValue = 0x2F; /* / */\n      return true\n    }\n    return false\n  }\n\n  var ch = state.current();\n  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape\npp$1.regexp_eatDecimalEscape = function(state) {\n  state.lastIntValue = 0;\n  var ch = state.current();\n  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {\n    do {\n      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);\n      state.advance();\n    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)\n    return true\n  }\n  return false\n};\n\n// Return values used by character set parsing methods, needed to\n// forbid negation of sets that can match strings.\nvar CharSetNone = 0; // Nothing parsed\nvar CharSetOk = 1; // Construct parsed, cannot contain strings\nvar CharSetString = 2; // Construct parsed, can contain strings\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape\npp$1.regexp_eatCharacterClassEscape = function(state) {\n  var ch = state.current();\n\n  if (isCharacterClassEscape(ch)) {\n    state.lastIntValue = -1;\n    state.advance();\n    return CharSetOk\n  }\n\n  var negate = false;\n  if (\n    state.switchU &&\n    this.options.ecmaVersion >= 9 &&\n    ((negate = ch === 0x50 /* P */) || ch === 0x70 /* p */)\n  ) {\n    state.lastIntValue = -1;\n    state.advance();\n    var result;\n    if (\n      state.eat(0x7B /* { */) &&\n      (result = this.regexp_eatUnicodePropertyValueExpression(state)) &&\n      state.eat(0x7D /* } */)\n    ) {\n      if (negate && result === CharSetString) { state.raise(\"Invalid property name\"); }\n      return result\n    }\n    state.raise(\"Invalid property name\");\n  }\n\n  return CharSetNone\n};\n\nfunction isCharacterClassEscape(ch) {\n  return (\n    ch === 0x64 /* d */ ||\n    ch === 0x44 /* D */ ||\n    ch === 0x73 /* s */ ||\n    ch === 0x53 /* S */ ||\n    ch === 0x77 /* w */ ||\n    ch === 0x57 /* W */\n  )\n}\n\n// UnicodePropertyValueExpression ::\n//   UnicodePropertyName `=` UnicodePropertyValue\n//   LoneUnicodePropertyNameOrValue\npp$1.regexp_eatUnicodePropertyValueExpression = function(state) {\n  var start = state.pos;\n\n  // UnicodePropertyName `=` UnicodePropertyValue\n  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {\n    var name = state.lastStringValue;\n    if (this.regexp_eatUnicodePropertyValue(state)) {\n      var value = state.lastStringValue;\n      this.regexp_validateUnicodePropertyNameAndValue(state, name, value);\n      return CharSetOk\n    }\n  }\n  state.pos = start;\n\n  // LoneUnicodePropertyNameOrValue\n  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {\n    var nameOrValue = state.lastStringValue;\n    return this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue)\n  }\n  return CharSetNone\n};\n\npp$1.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {\n  if (!hasOwn(state.unicodeProperties.nonBinary, name))\n    { state.raise(\"Invalid property name\"); }\n  if (!state.unicodeProperties.nonBinary[name].test(value))\n    { state.raise(\"Invalid property value\"); }\n};\n\npp$1.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {\n  if (state.unicodeProperties.binary.test(nameOrValue)) { return CharSetOk }\n  if (state.switchV && state.unicodeProperties.binaryOfStrings.test(nameOrValue)) { return CharSetString }\n  state.raise(\"Invalid property name\");\n};\n\n// UnicodePropertyName ::\n//   UnicodePropertyNameCharacters\npp$1.regexp_eatUnicodePropertyName = function(state) {\n  var ch = 0;\n  state.lastStringValue = \"\";\n  while (isUnicodePropertyNameCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch);\n    state.advance();\n  }\n  return state.lastStringValue !== \"\"\n};\n\nfunction isUnicodePropertyNameCharacter(ch) {\n  return isControlLetter(ch) || ch === 0x5F /* _ */\n}\n\n// UnicodePropertyValue ::\n//   UnicodePropertyValueCharacters\npp$1.regexp_eatUnicodePropertyValue = function(state) {\n  var ch = 0;\n  state.lastStringValue = \"\";\n  while (isUnicodePropertyValueCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch);\n    state.advance();\n  }\n  return state.lastStringValue !== \"\"\n};\nfunction isUnicodePropertyValueCharacter(ch) {\n  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)\n}\n\n// LoneUnicodePropertyNameOrValue ::\n//   UnicodePropertyValueCharacters\npp$1.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {\n  return this.regexp_eatUnicodePropertyValue(state)\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass\npp$1.regexp_eatCharacterClass = function(state) {\n  if (state.eat(0x5B /* [ */)) {\n    var negate = state.eat(0x5E /* ^ */);\n    var result = this.regexp_classContents(state);\n    if (!state.eat(0x5D /* ] */))\n      { state.raise(\"Unterminated character class\"); }\n    if (negate && result === CharSetString)\n      { state.raise(\"Negated character class may contain strings\"); }\n    return true\n  }\n  return false\n};\n\n// https://tc39.es/ecma262/#prod-ClassContents\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges\npp$1.regexp_classContents = function(state) {\n  if (state.current() === 0x5D /* ] */) { return CharSetOk }\n  if (state.switchV) { return this.regexp_classSetExpression(state) }\n  this.regexp_nonEmptyClassRanges(state);\n  return CharSetOk\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash\npp$1.regexp_nonEmptyClassRanges = function(state) {\n  while (this.regexp_eatClassAtom(state)) {\n    var left = state.lastIntValue;\n    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {\n      var right = state.lastIntValue;\n      if (state.switchU && (left === -1 || right === -1)) {\n        state.raise(\"Invalid character class\");\n      }\n      if (left !== -1 && right !== -1 && left > right) {\n        state.raise(\"Range out of order in character class\");\n      }\n    }\n  }\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash\npp$1.regexp_eatClassAtom = function(state) {\n  var start = state.pos;\n\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatClassEscape(state)) {\n      return true\n    }\n    if (state.switchU) {\n      // Make the same message as V8.\n      var ch$1 = state.current();\n      if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {\n        state.raise(\"Invalid class escape\");\n      }\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n\n  var ch = state.current();\n  if (ch !== 0x5D /* ] */) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape\npp$1.regexp_eatClassEscape = function(state) {\n  var start = state.pos;\n\n  if (state.eat(0x62 /* b */)) {\n    state.lastIntValue = 0x08; /* <BS> */\n    return true\n  }\n\n  if (state.switchU && state.eat(0x2D /* - */)) {\n    state.lastIntValue = 0x2D; /* - */\n    return true\n  }\n\n  if (!state.switchU && state.eat(0x63 /* c */)) {\n    if (this.regexp_eatClassControlLetter(state)) {\n      return true\n    }\n    state.pos = start;\n  }\n\n  return (\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state)\n  )\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetExpression\n// https://tc39.es/ecma262/#prod-ClassUnion\n// https://tc39.es/ecma262/#prod-ClassIntersection\n// https://tc39.es/ecma262/#prod-ClassSubtraction\npp$1.regexp_classSetExpression = function(state) {\n  var result = CharSetOk, subResult;\n  if (this.regexp_eatClassSetRange(state)) ; else if (subResult = this.regexp_eatClassSetOperand(state)) {\n    if (subResult === CharSetString) { result = CharSetString; }\n    // https://tc39.es/ecma262/#prod-ClassIntersection\n    var start = state.pos;\n    while (state.eatChars([0x26, 0x26] /* && */)) {\n      if (\n        state.current() !== 0x26 /* & */ &&\n        (subResult = this.regexp_eatClassSetOperand(state))\n      ) {\n        if (subResult !== CharSetString) { result = CharSetOk; }\n        continue\n      }\n      state.raise(\"Invalid character in character class\");\n    }\n    if (start !== state.pos) { return result }\n    // https://tc39.es/ecma262/#prod-ClassSubtraction\n    while (state.eatChars([0x2D, 0x2D] /* -- */)) {\n      if (this.regexp_eatClassSetOperand(state)) { continue }\n      state.raise(\"Invalid character in character class\");\n    }\n    if (start !== state.pos) { return result }\n  } else {\n    state.raise(\"Invalid character in character class\");\n  }\n  // https://tc39.es/ecma262/#prod-ClassUnion\n  for (;;) {\n    if (this.regexp_eatClassSetRange(state)) { continue }\n    subResult = this.regexp_eatClassSetOperand(state);\n    if (!subResult) { return result }\n    if (subResult === CharSetString) { result = CharSetString; }\n  }\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetRange\npp$1.regexp_eatClassSetRange = function(state) {\n  var start = state.pos;\n  if (this.regexp_eatClassSetCharacter(state)) {\n    var left = state.lastIntValue;\n    if (state.eat(0x2D /* - */) && this.regexp_eatClassSetCharacter(state)) {\n      var right = state.lastIntValue;\n      if (left !== -1 && right !== -1 && left > right) {\n        state.raise(\"Range out of order in character class\");\n      }\n      return true\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetOperand\npp$1.regexp_eatClassSetOperand = function(state) {\n  if (this.regexp_eatClassSetCharacter(state)) { return CharSetOk }\n  return this.regexp_eatClassStringDisjunction(state) || this.regexp_eatNestedClass(state)\n};\n\n// https://tc39.es/ecma262/#prod-NestedClass\npp$1.regexp_eatNestedClass = function(state) {\n  var start = state.pos;\n  if (state.eat(0x5B /* [ */)) {\n    var negate = state.eat(0x5E /* ^ */);\n    var result = this.regexp_classContents(state);\n    if (state.eat(0x5D /* ] */)) {\n      if (negate && result === CharSetString) {\n        state.raise(\"Negated character class may contain strings\");\n      }\n      return result\n    }\n    state.pos = start;\n  }\n  if (state.eat(0x5C /* \\ */)) {\n    var result$1 = this.regexp_eatCharacterClassEscape(state);\n    if (result$1) {\n      return result$1\n    }\n    state.pos = start;\n  }\n  return null\n};\n\n// https://tc39.es/ecma262/#prod-ClassStringDisjunction\npp$1.regexp_eatClassStringDisjunction = function(state) {\n  var start = state.pos;\n  if (state.eatChars([0x5C, 0x71] /* \\q */)) {\n    if (state.eat(0x7B /* { */)) {\n      var result = this.regexp_classStringDisjunctionContents(state);\n      if (state.eat(0x7D /* } */)) {\n        return result\n      }\n    } else {\n      // Make the same message as V8.\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n  return null\n};\n\n// https://tc39.es/ecma262/#prod-ClassStringDisjunctionContents\npp$1.regexp_classStringDisjunctionContents = function(state) {\n  var result = this.regexp_classString(state);\n  while (state.eat(0x7C /* | */)) {\n    if (this.regexp_classString(state) === CharSetString) { result = CharSetString; }\n  }\n  return result\n};\n\n// https://tc39.es/ecma262/#prod-ClassString\n// https://tc39.es/ecma262/#prod-NonEmptyClassString\npp$1.regexp_classString = function(state) {\n  var count = 0;\n  while (this.regexp_eatClassSetCharacter(state)) { count++; }\n  return count === 1 ? CharSetOk : CharSetString\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetCharacter\npp$1.regexp_eatClassSetCharacter = function(state) {\n  var start = state.pos;\n  if (state.eat(0x5C /* \\ */)) {\n    if (\n      this.regexp_eatCharacterEscape(state) ||\n      this.regexp_eatClassSetReservedPunctuator(state)\n    ) {\n      return true\n    }\n    if (state.eat(0x62 /* b */)) {\n      state.lastIntValue = 0x08; /* <BS> */\n      return true\n    }\n    state.pos = start;\n    return false\n  }\n  var ch = state.current();\n  if (ch < 0 || ch === state.lookahead() && isClassSetReservedDoublePunctuatorCharacter(ch)) { return false }\n  if (isClassSetSyntaxCharacter(ch)) { return false }\n  state.advance();\n  state.lastIntValue = ch;\n  return true\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetReservedDoublePunctuator\nfunction isClassSetReservedDoublePunctuatorCharacter(ch) {\n  return (\n    ch === 0x21 /* ! */ ||\n    ch >= 0x23 /* # */ && ch <= 0x26 /* & */ ||\n    ch >= 0x2A /* * */ && ch <= 0x2C /* , */ ||\n    ch === 0x2E /* . */ ||\n    ch >= 0x3A /* : */ && ch <= 0x40 /* @ */ ||\n    ch === 0x5E /* ^ */ ||\n    ch === 0x60 /* ` */ ||\n    ch === 0x7E /* ~ */\n  )\n}\n\n// https://tc39.es/ecma262/#prod-ClassSetSyntaxCharacter\nfunction isClassSetSyntaxCharacter(ch) {\n  return (\n    ch === 0x28 /* ( */ ||\n    ch === 0x29 /* ) */ ||\n    ch === 0x2D /* - */ ||\n    ch === 0x2F /* / */ ||\n    ch >= 0x5B /* [ */ && ch <= 0x5D /* ] */ ||\n    ch >= 0x7B /* { */ && ch <= 0x7D /* } */\n  )\n}\n\n// https://tc39.es/ecma262/#prod-ClassSetReservedPunctuator\npp$1.regexp_eatClassSetReservedPunctuator = function(state) {\n  var ch = state.current();\n  if (isClassSetReservedPunctuator(ch)) {\n    state.lastIntValue = ch;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://tc39.es/ecma262/#prod-ClassSetReservedPunctuator\nfunction isClassSetReservedPunctuator(ch) {\n  return (\n    ch === 0x21 /* ! */ ||\n    ch === 0x23 /* # */ ||\n    ch === 0x25 /* % */ ||\n    ch === 0x26 /* & */ ||\n    ch === 0x2C /* , */ ||\n    ch === 0x2D /* - */ ||\n    ch >= 0x3A /* : */ && ch <= 0x3E /* > */ ||\n    ch === 0x40 /* @ */ ||\n    ch === 0x60 /* ` */ ||\n    ch === 0x7E /* ~ */\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter\npp$1.regexp_eatClassControlLetter = function(state) {\n  var ch = state.current();\n  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {\n    state.lastIntValue = ch % 0x20;\n    state.advance();\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$1.regexp_eatHexEscapeSequence = function(state) {\n  var start = state.pos;\n  if (state.eat(0x78 /* x */)) {\n    if (this.regexp_eatFixedHexDigits(state, 2)) {\n      return true\n    }\n    if (state.switchU) {\n      state.raise(\"Invalid escape\");\n    }\n    state.pos = start;\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits\npp$1.regexp_eatDecimalDigits = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  state.lastIntValue = 0;\n  while (isDecimalDigit(ch = state.current())) {\n    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);\n    state.advance();\n  }\n  return state.pos !== start\n};\nfunction isDecimalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits\npp$1.regexp_eatHexDigits = function(state) {\n  var start = state.pos;\n  var ch = 0;\n  state.lastIntValue = 0;\n  while (isHexDigit(ch = state.current())) {\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n    state.advance();\n  }\n  return state.pos !== start\n};\nfunction isHexDigit(ch) {\n  return (\n    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||\n    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)\n  )\n}\nfunction hexToInt(ch) {\n  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {\n    return 10 + (ch - 0x41 /* A */)\n  }\n  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {\n    return 10 + (ch - 0x61 /* a */)\n  }\n  return ch - 0x30 /* 0 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence\n// Allows only 0-377(octal) i.e. 0-255(decimal).\npp$1.regexp_eatLegacyOctalEscapeSequence = function(state) {\n  if (this.regexp_eatOctalDigit(state)) {\n    var n1 = state.lastIntValue;\n    if (this.regexp_eatOctalDigit(state)) {\n      var n2 = state.lastIntValue;\n      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {\n        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;\n      } else {\n        state.lastIntValue = n1 * 8 + n2;\n      }\n    } else {\n      state.lastIntValue = n1;\n    }\n    return true\n  }\n  return false\n};\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit\npp$1.regexp_eatOctalDigit = function(state) {\n  var ch = state.current();\n  if (isOctalDigit(ch)) {\n    state.lastIntValue = ch - 0x30; /* 0 */\n    state.advance();\n    return true\n  }\n  state.lastIntValue = 0;\n  return false\n};\nfunction isOctalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit\n// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp$1.regexp_eatFixedHexDigits = function(state, length) {\n  var start = state.pos;\n  state.lastIntValue = 0;\n  for (var i = 0; i < length; ++i) {\n    var ch = state.current();\n    if (!isHexDigit(ch)) {\n      state.pos = start;\n      return false\n    }\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);\n    state.advance();\n  }\n  return true\n};\n\n// Object type used to represent tokens. Note that normally, tokens\n// simply exist as properties on the parser object. This is only\n// used for the onToken callback and the external tokenizer.\n\nvar Token = function Token(p) {\n  this.type = p.type;\n  this.value = p.value;\n  this.start = p.start;\n  this.end = p.end;\n  if (p.options.locations)\n    { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }\n  if (p.options.ranges)\n    { this.range = [p.start, p.end]; }\n};\n\n// ## Tokenizer\n\nvar pp = Parser.prototype;\n\n// Move to the next token\n\npp.next = function(ignoreEscapeSequenceInKeyword) {\n  if (!ignoreEscapeSequenceInKeyword && this.type.keyword && this.containsEsc)\n    { this.raiseRecoverable(this.start, \"Escape sequence in keyword \" + this.type.keyword); }\n  if (this.options.onToken)\n    { this.options.onToken(new Token(this)); }\n\n  this.lastTokEnd = this.end;\n  this.lastTokStart = this.start;\n  this.lastTokEndLoc = this.endLoc;\n  this.lastTokStartLoc = this.startLoc;\n  this.nextToken();\n};\n\npp.getToken = function() {\n  this.next();\n  return new Token(this)\n};\n\n// If we're in an ES6 environment, make parsers iterable\nif (typeof Symbol !== \"undefined\")\n  { pp[Symbol.iterator] = function() {\n    var this$1$1 = this;\n\n    return {\n      next: function () {\n        var token = this$1$1.getToken();\n        return {\n          done: token.type === types$1.eof,\n          value: token\n        }\n      }\n    }\n  }; }\n\n// Toggle strict mode. Re-reads the next number or string to please\n// pedantic tests (`\"use strict\"; 010;` should fail).\n\n// Read a single token, updating the parser object's token-related\n// properties.\n\npp.nextToken = function() {\n  var curContext = this.curContext();\n  if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }\n\n  this.start = this.pos;\n  if (this.options.locations) { this.startLoc = this.curPosition(); }\n  if (this.pos >= this.input.length) { return this.finishToken(types$1.eof) }\n\n  if (curContext.override) { return curContext.override(this) }\n  else { this.readToken(this.fullCharCodeAtPos()); }\n};\n\npp.readToken = function(code) {\n  // Identifier or keyword. '\\uXXXX' sequences are allowed in\n  // identifiers, so '\\' also dispatches to that.\n  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\\' */)\n    { return this.readWord() }\n\n  return this.getTokenFromCode(code)\n};\n\npp.fullCharCodeAtPos = function() {\n  var code = this.input.charCodeAt(this.pos);\n  if (code <= 0xd7ff || code >= 0xdc00) { return code }\n  var next = this.input.charCodeAt(this.pos + 1);\n  return next <= 0xdbff || next >= 0xe000 ? code : (code << 10) + next - 0x35fdc00\n};\n\npp.skipBlockComment = function() {\n  var startLoc = this.options.onComment && this.curPosition();\n  var start = this.pos, end = this.input.indexOf(\"*/\", this.pos += 2);\n  if (end === -1) { this.raise(this.pos - 2, \"Unterminated comment\"); }\n  this.pos = end + 2;\n  if (this.options.locations) {\n    for (var nextBreak = (void 0), pos = start; (nextBreak = nextLineBreak(this.input, pos, this.pos)) > -1;) {\n      ++this.curLine;\n      pos = this.lineStart = nextBreak;\n    }\n  }\n  if (this.options.onComment)\n    { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,\n                           startLoc, this.curPosition()); }\n};\n\npp.skipLineComment = function(startSkip) {\n  var start = this.pos;\n  var startLoc = this.options.onComment && this.curPosition();\n  var ch = this.input.charCodeAt(this.pos += startSkip);\n  while (this.pos < this.input.length && !isNewLine(ch)) {\n    ch = this.input.charCodeAt(++this.pos);\n  }\n  if (this.options.onComment)\n    { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,\n                           startLoc, this.curPosition()); }\n};\n\n// Called at the start of the parse and after every token. Skips\n// whitespace and comments, and.\n\npp.skipSpace = function() {\n  loop: while (this.pos < this.input.length) {\n    var ch = this.input.charCodeAt(this.pos);\n    switch (ch) {\n    case 32: case 160: // ' '\n      ++this.pos;\n      break\n    case 13:\n      if (this.input.charCodeAt(this.pos + 1) === 10) {\n        ++this.pos;\n      }\n    case 10: case 8232: case 8233:\n      ++this.pos;\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n      break\n    case 47: // '/'\n      switch (this.input.charCodeAt(this.pos + 1)) {\n      case 42: // '*'\n        this.skipBlockComment();\n        break\n      case 47:\n        this.skipLineComment(2);\n        break\n      default:\n        break loop\n      }\n      break\n    default:\n      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {\n        ++this.pos;\n      } else {\n        break loop\n      }\n    }\n  }\n};\n\n// Called at the end of every token. Sets `end`, `val`, and\n// maintains `context` and `exprAllowed`, and skips the space after\n// the token, so that the next one's `start` will point at the\n// right position.\n\npp.finishToken = function(type, val) {\n  this.end = this.pos;\n  if (this.options.locations) { this.endLoc = this.curPosition(); }\n  var prevType = this.type;\n  this.type = type;\n  this.value = val;\n\n  this.updateContext(prevType);\n};\n\n// ### Token reading\n\n// This is the function that is called to fetch the next token. It\n// is somewhat obscure, because it works in character codes rather\n// than characters, and because operator parsing has been inlined\n// into it.\n//\n// All in the name of speed.\n//\npp.readToken_dot = function() {\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next >= 48 && next <= 57) { return this.readNumber(true) }\n  var next2 = this.input.charCodeAt(this.pos + 2);\n  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'\n    this.pos += 3;\n    return this.finishToken(types$1.ellipsis)\n  } else {\n    ++this.pos;\n    return this.finishToken(types$1.dot)\n  }\n};\n\npp.readToken_slash = function() { // '/'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.slash, 1)\n};\n\npp.readToken_mult_modulo_exp = function(code) { // '%*'\n  var next = this.input.charCodeAt(this.pos + 1);\n  var size = 1;\n  var tokentype = code === 42 ? types$1.star : types$1.modulo;\n\n  // exponentiation operator ** and **=\n  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {\n    ++size;\n    tokentype = types$1.starstar;\n    next = this.input.charCodeAt(this.pos + 2);\n  }\n\n  if (next === 61) { return this.finishOp(types$1.assign, size + 1) }\n  return this.finishOp(tokentype, size)\n};\n\npp.readToken_pipe_amp = function(code) { // '|&'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === code) {\n    if (this.options.ecmaVersion >= 12) {\n      var next2 = this.input.charCodeAt(this.pos + 2);\n      if (next2 === 61) { return this.finishOp(types$1.assign, 3) }\n    }\n    return this.finishOp(code === 124 ? types$1.logicalOR : types$1.logicalAND, 2)\n  }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(code === 124 ? types$1.bitwiseOR : types$1.bitwiseAND, 1)\n};\n\npp.readToken_caret = function() { // '^'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.bitwiseXOR, 1)\n};\n\npp.readToken_plus_min = function(code) { // '+-'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === code) {\n    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&\n        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {\n      // A `-->` line comment\n      this.skipLineComment(3);\n      this.skipSpace();\n      return this.nextToken()\n    }\n    return this.finishOp(types$1.incDec, 2)\n  }\n  if (next === 61) { return this.finishOp(types$1.assign, 2) }\n  return this.finishOp(types$1.plusMin, 1)\n};\n\npp.readToken_lt_gt = function(code) { // '<>'\n  var next = this.input.charCodeAt(this.pos + 1);\n  var size = 1;\n  if (next === code) {\n    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;\n    if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types$1.assign, size + 1) }\n    return this.finishOp(types$1.bitShift, size)\n  }\n  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&\n      this.input.charCodeAt(this.pos + 3) === 45) {\n    // `<!--`, an XML-style comment that should be interpreted as a line comment\n    this.skipLineComment(4);\n    this.skipSpace();\n    return this.nextToken()\n  }\n  if (next === 61) { size = 2; }\n  return this.finishOp(types$1.relational, size)\n};\n\npp.readToken_eq_excl = function(code) { // '=!'\n  var next = this.input.charCodeAt(this.pos + 1);\n  if (next === 61) { return this.finishOp(types$1.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }\n  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'\n    this.pos += 2;\n    return this.finishToken(types$1.arrow)\n  }\n  return this.finishOp(code === 61 ? types$1.eq : types$1.prefix, 1)\n};\n\npp.readToken_question = function() { // '?'\n  var ecmaVersion = this.options.ecmaVersion;\n  if (ecmaVersion >= 11) {\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 46) {\n      var next2 = this.input.charCodeAt(this.pos + 2);\n      if (next2 < 48 || next2 > 57) { return this.finishOp(types$1.questionDot, 2) }\n    }\n    if (next === 63) {\n      if (ecmaVersion >= 12) {\n        var next2$1 = this.input.charCodeAt(this.pos + 2);\n        if (next2$1 === 61) { return this.finishOp(types$1.assign, 3) }\n      }\n      return this.finishOp(types$1.coalesce, 2)\n    }\n  }\n  return this.finishOp(types$1.question, 1)\n};\n\npp.readToken_numberSign = function() { // '#'\n  var ecmaVersion = this.options.ecmaVersion;\n  var code = 35; // '#'\n  if (ecmaVersion >= 13) {\n    ++this.pos;\n    code = this.fullCharCodeAtPos();\n    if (isIdentifierStart(code, true) || code === 92 /* '\\' */) {\n      return this.finishToken(types$1.privateId, this.readWord1())\n    }\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString(code) + \"'\");\n};\n\npp.getTokenFromCode = function(code) {\n  switch (code) {\n  // The interpretation of a dot depends on whether it is followed\n  // by a digit or another two dots.\n  case 46: // '.'\n    return this.readToken_dot()\n\n  // Punctuation tokens.\n  case 40: ++this.pos; return this.finishToken(types$1.parenL)\n  case 41: ++this.pos; return this.finishToken(types$1.parenR)\n  case 59: ++this.pos; return this.finishToken(types$1.semi)\n  case 44: ++this.pos; return this.finishToken(types$1.comma)\n  case 91: ++this.pos; return this.finishToken(types$1.bracketL)\n  case 93: ++this.pos; return this.finishToken(types$1.bracketR)\n  case 123: ++this.pos; return this.finishToken(types$1.braceL)\n  case 125: ++this.pos; return this.finishToken(types$1.braceR)\n  case 58: ++this.pos; return this.finishToken(types$1.colon)\n\n  case 96: // '`'\n    if (this.options.ecmaVersion < 6) { break }\n    ++this.pos;\n    return this.finishToken(types$1.backQuote)\n\n  case 48: // '0'\n    var next = this.input.charCodeAt(this.pos + 1);\n    if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number\n    if (this.options.ecmaVersion >= 6) {\n      if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number\n      if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number\n    }\n\n  // Anything else beginning with a digit is an integer, octal\n  // number, or float.\n  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9\n    return this.readNumber(false)\n\n  // Quotes produce strings.\n  case 34: case 39: // '\"', \"'\"\n    return this.readString(code)\n\n  // Operators are parsed inline in tiny state machines. '=' (61) is\n  // often referred to. `finishOp` simply skips the amount of\n  // characters it is given as second argument, and returns a token\n  // of the type given by its first argument.\n  case 47: // '/'\n    return this.readToken_slash()\n\n  case 37: case 42: // '%*'\n    return this.readToken_mult_modulo_exp(code)\n\n  case 124: case 38: // '|&'\n    return this.readToken_pipe_amp(code)\n\n  case 94: // '^'\n    return this.readToken_caret()\n\n  case 43: case 45: // '+-'\n    return this.readToken_plus_min(code)\n\n  case 60: case 62: // '<>'\n    return this.readToken_lt_gt(code)\n\n  case 61: case 33: // '=!'\n    return this.readToken_eq_excl(code)\n\n  case 63: // '?'\n    return this.readToken_question()\n\n  case 126: // '~'\n    return this.finishOp(types$1.prefix, 1)\n\n  case 35: // '#'\n    return this.readToken_numberSign()\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString(code) + \"'\");\n};\n\npp.finishOp = function(type, size) {\n  var str = this.input.slice(this.pos, this.pos + size);\n  this.pos += size;\n  return this.finishToken(type, str)\n};\n\npp.readRegexp = function() {\n  var escaped, inClass, start = this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(start, \"Unterminated regular expression\"); }\n    var ch = this.input.charAt(this.pos);\n    if (lineBreak.test(ch)) { this.raise(start, \"Unterminated regular expression\"); }\n    if (!escaped) {\n      if (ch === \"[\") { inClass = true; }\n      else if (ch === \"]\" && inClass) { inClass = false; }\n      else if (ch === \"/\" && !inClass) { break }\n      escaped = ch === \"\\\\\";\n    } else { escaped = false; }\n    ++this.pos;\n  }\n  var pattern = this.input.slice(start, this.pos);\n  ++this.pos;\n  var flagsStart = this.pos;\n  var flags = this.readWord1();\n  if (this.containsEsc) { this.unexpected(flagsStart); }\n\n  // Validate pattern\n  var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));\n  state.reset(start, pattern, flags);\n  this.validateRegExpFlags(state);\n  this.validateRegExpPattern(state);\n\n  // Create Literal#value property value.\n  var value = null;\n  try {\n    value = new RegExp(pattern, flags);\n  } catch (e) {\n    // ESTree requires null if it failed to instantiate RegExp object.\n    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral\n  }\n\n  return this.finishToken(types$1.regexp, {pattern: pattern, flags: flags, value: value})\n};\n\n// Read an integer in the given radix. Return null if zero digits\n// were read, the integer value otherwise. When `len` is given, this\n// will return `null` unless the integer has exactly `len` digits.\n\npp.readInt = function(radix, len, maybeLegacyOctalNumericLiteral) {\n  // `len` is used for character escape sequences. In that case, disallow separators.\n  var allowSeparators = this.options.ecmaVersion >= 12 && len === undefined;\n\n  // `maybeLegacyOctalNumericLiteral` is true if it doesn't have prefix (0x,0o,0b)\n  // and isn't fraction part nor exponent part. In that case, if the first digit\n  // is zero then disallow separators.\n  var isLegacyOctalNumericLiteral = maybeLegacyOctalNumericLiteral && this.input.charCodeAt(this.pos) === 48;\n\n  var start = this.pos, total = 0, lastCode = 0;\n  for (var i = 0, e = len == null ? Infinity : len; i < e; ++i, ++this.pos) {\n    var code = this.input.charCodeAt(this.pos), val = (void 0);\n\n    if (allowSeparators && code === 95) {\n      if (isLegacyOctalNumericLiteral) { this.raiseRecoverable(this.pos, \"Numeric separator is not allowed in legacy octal numeric literals\"); }\n      if (lastCode === 95) { this.raiseRecoverable(this.pos, \"Numeric separator must be exactly one underscore\"); }\n      if (i === 0) { this.raiseRecoverable(this.pos, \"Numeric separator is not allowed at the first of digits\"); }\n      lastCode = code;\n      continue\n    }\n\n    if (code >= 97) { val = code - 97 + 10; } // a\n    else if (code >= 65) { val = code - 65 + 10; } // A\n    else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9\n    else { val = Infinity; }\n    if (val >= radix) { break }\n    lastCode = code;\n    total = total * radix + val;\n  }\n\n  if (allowSeparators && lastCode === 95) { this.raiseRecoverable(this.pos - 1, \"Numeric separator is not allowed at the last of digits\"); }\n  if (this.pos === start || len != null && this.pos - start !== len) { return null }\n\n  return total\n};\n\nfunction stringToNumber(str, isLegacyOctalNumericLiteral) {\n  if (isLegacyOctalNumericLiteral) {\n    return parseInt(str, 8)\n  }\n\n  // `parseFloat(value)` stops parsing at the first numeric separator then returns a wrong value.\n  return parseFloat(str.replace(/_/g, \"\"))\n}\n\nfunction stringToBigInt(str) {\n  if (typeof BigInt !== \"function\") {\n    return null\n  }\n\n  // `BigInt(value)` throws syntax error if the string contains numeric separators.\n  return BigInt(str.replace(/_/g, \"\"))\n}\n\npp.readRadixNumber = function(radix) {\n  var start = this.pos;\n  this.pos += 2; // 0x\n  var val = this.readInt(radix);\n  if (val == null) { this.raise(this.start + 2, \"Expected number in radix \" + radix); }\n  if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {\n    val = stringToBigInt(this.input.slice(start, this.pos));\n    ++this.pos;\n  } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n  return this.finishToken(types$1.num, val)\n};\n\n// Read an integer, octal integer, or floating-point number.\n\npp.readNumber = function(startsWithDot) {\n  var start = this.pos;\n  if (!startsWithDot && this.readInt(10, undefined, true) === null) { this.raise(start, \"Invalid number\"); }\n  var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;\n  if (octal && this.strict) { this.raise(start, \"Invalid number\"); }\n  var next = this.input.charCodeAt(this.pos);\n  if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {\n    var val$1 = stringToBigInt(this.input.slice(start, this.pos));\n    ++this.pos;\n    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n    return this.finishToken(types$1.num, val$1)\n  }\n  if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }\n  if (next === 46 && !octal) { // '.'\n    ++this.pos;\n    this.readInt(10);\n    next = this.input.charCodeAt(this.pos);\n  }\n  if ((next === 69 || next === 101) && !octal) { // 'eE'\n    next = this.input.charCodeAt(++this.pos);\n    if (next === 43 || next === 45) { ++this.pos; } // '+-'\n    if (this.readInt(10) === null) { this.raise(start, \"Invalid number\"); }\n  }\n  if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, \"Identifier directly after number\"); }\n\n  var val = stringToNumber(this.input.slice(start, this.pos), octal);\n  return this.finishToken(types$1.num, val)\n};\n\n// Read a string value, interpreting backslash-escapes.\n\npp.readCodePoint = function() {\n  var ch = this.input.charCodeAt(this.pos), code;\n\n  if (ch === 123) { // '{'\n    if (this.options.ecmaVersion < 6) { this.unexpected(); }\n    var codePos = ++this.pos;\n    code = this.readHexChar(this.input.indexOf(\"}\", this.pos) - this.pos);\n    ++this.pos;\n    if (code > 0x10FFFF) { this.invalidStringToken(codePos, \"Code point out of bounds\"); }\n  } else {\n    code = this.readHexChar(4);\n  }\n  return code\n};\n\npp.readString = function(quote) {\n  var out = \"\", chunkStart = ++this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(this.start, \"Unterminated string constant\"); }\n    var ch = this.input.charCodeAt(this.pos);\n    if (ch === quote) { break }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos);\n      out += this.readEscapedChar(false);\n      chunkStart = this.pos;\n    } else if (ch === 0x2028 || ch === 0x2029) {\n      if (this.options.ecmaVersion < 10) { this.raise(this.start, \"Unterminated string constant\"); }\n      ++this.pos;\n      if (this.options.locations) {\n        this.curLine++;\n        this.lineStart = this.pos;\n      }\n    } else {\n      if (isNewLine(ch)) { this.raise(this.start, \"Unterminated string constant\"); }\n      ++this.pos;\n    }\n  }\n  out += this.input.slice(chunkStart, this.pos++);\n  return this.finishToken(types$1.string, out)\n};\n\n// Reads template string tokens.\n\nvar INVALID_TEMPLATE_ESCAPE_ERROR = {};\n\npp.tryReadTemplateToken = function() {\n  this.inTemplateElement = true;\n  try {\n    this.readTmplToken();\n  } catch (err) {\n    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {\n      this.readInvalidTemplateToken();\n    } else {\n      throw err\n    }\n  }\n\n  this.inTemplateElement = false;\n};\n\npp.invalidStringToken = function(position, message) {\n  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {\n    throw INVALID_TEMPLATE_ESCAPE_ERROR\n  } else {\n    this.raise(position, message);\n  }\n};\n\npp.readTmplToken = function() {\n  var out = \"\", chunkStart = this.pos;\n  for (;;) {\n    if (this.pos >= this.input.length) { this.raise(this.start, \"Unterminated template\"); }\n    var ch = this.input.charCodeAt(this.pos);\n    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'\n      if (this.pos === this.start && (this.type === types$1.template || this.type === types$1.invalidTemplate)) {\n        if (ch === 36) {\n          this.pos += 2;\n          return this.finishToken(types$1.dollarBraceL)\n        } else {\n          ++this.pos;\n          return this.finishToken(types$1.backQuote)\n        }\n      }\n      out += this.input.slice(chunkStart, this.pos);\n      return this.finishToken(types$1.template, out)\n    }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos);\n      out += this.readEscapedChar(true);\n      chunkStart = this.pos;\n    } else if (isNewLine(ch)) {\n      out += this.input.slice(chunkStart, this.pos);\n      ++this.pos;\n      switch (ch) {\n      case 13:\n        if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }\n      case 10:\n        out += \"\\n\";\n        break\n      default:\n        out += String.fromCharCode(ch);\n        break\n      }\n      if (this.options.locations) {\n        ++this.curLine;\n        this.lineStart = this.pos;\n      }\n      chunkStart = this.pos;\n    } else {\n      ++this.pos;\n    }\n  }\n};\n\n// Reads a template token to search for the end, without validating any escape sequences\npp.readInvalidTemplateToken = function() {\n  for (; this.pos < this.input.length; this.pos++) {\n    switch (this.input[this.pos]) {\n    case \"\\\\\":\n      ++this.pos;\n      break\n\n    case \"$\":\n      if (this.input[this.pos + 1] !== \"{\") { break }\n      // fall through\n    case \"`\":\n      return this.finishToken(types$1.invalidTemplate, this.input.slice(this.start, this.pos))\n\n    case \"\\r\":\n      if (this.input[this.pos + 1] === \"\\n\") { ++this.pos; }\n      // fall through\n    case \"\\n\": case \"\\u2028\": case \"\\u2029\":\n      ++this.curLine;\n      this.lineStart = this.pos + 1;\n      break\n    }\n  }\n  this.raise(this.start, \"Unterminated template\");\n};\n\n// Used to read escaped characters\n\npp.readEscapedChar = function(inTemplate) {\n  var ch = this.input.charCodeAt(++this.pos);\n  ++this.pos;\n  switch (ch) {\n  case 110: return \"\\n\" // 'n' -> '\\n'\n  case 114: return \"\\r\" // 'r' -> '\\r'\n  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'\n  case 117: return codePointToString(this.readCodePoint()) // 'u'\n  case 116: return \"\\t\" // 't' -> '\\t'\n  case 98: return \"\\b\" // 'b' -> '\\b'\n  case 118: return \"\\u000b\" // 'v' -> '\\u000b'\n  case 102: return \"\\f\" // 'f' -> '\\f'\n  case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\\r\\n'\n  case 10: // ' \\n'\n    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }\n    return \"\"\n  case 56:\n  case 57:\n    if (this.strict) {\n      this.invalidStringToken(\n        this.pos - 1,\n        \"Invalid escape sequence\"\n      );\n    }\n    if (inTemplate) {\n      var codePos = this.pos - 1;\n\n      this.invalidStringToken(\n        codePos,\n        \"Invalid escape sequence in template string\"\n      );\n    }\n  default:\n    if (ch >= 48 && ch <= 55) {\n      var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];\n      var octal = parseInt(octalStr, 8);\n      if (octal > 255) {\n        octalStr = octalStr.slice(0, -1);\n        octal = parseInt(octalStr, 8);\n      }\n      this.pos += octalStr.length - 1;\n      ch = this.input.charCodeAt(this.pos);\n      if ((octalStr !== \"0\" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {\n        this.invalidStringToken(\n          this.pos - 1 - octalStr.length,\n          inTemplate\n            ? \"Octal literal in template string\"\n            : \"Octal literal in strict mode\"\n        );\n      }\n      return String.fromCharCode(octal)\n    }\n    if (isNewLine(ch)) {\n      // Unicode new line characters after \\ get removed from output in both\n      // template literals and strings\n      if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }\n      return \"\"\n    }\n    return String.fromCharCode(ch)\n  }\n};\n\n// Used to read character escape sequences ('\\x', '\\u', '\\U').\n\npp.readHexChar = function(len) {\n  var codePos = this.pos;\n  var n = this.readInt(16, len);\n  if (n === null) { this.invalidStringToken(codePos, \"Bad character escape sequence\"); }\n  return n\n};\n\n// Read an identifier, and return it as a string. Sets `this.containsEsc`\n// to whether the word contained a '\\u' escape.\n//\n// Incrementally adds only escaped chars, adding other chunks as-is\n// as a micro-optimization.\n\npp.readWord1 = function() {\n  this.containsEsc = false;\n  var word = \"\", first = true, chunkStart = this.pos;\n  var astral = this.options.ecmaVersion >= 6;\n  while (this.pos < this.input.length) {\n    var ch = this.fullCharCodeAtPos();\n    if (isIdentifierChar(ch, astral)) {\n      this.pos += ch <= 0xffff ? 1 : 2;\n    } else if (ch === 92) { // \"\\\"\n      this.containsEsc = true;\n      word += this.input.slice(chunkStart, this.pos);\n      var escStart = this.pos;\n      if (this.input.charCodeAt(++this.pos) !== 117) // \"u\"\n        { this.invalidStringToken(this.pos, \"Expecting Unicode escape sequence \\\\uXXXX\"); }\n      ++this.pos;\n      var esc = this.readCodePoint();\n      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))\n        { this.invalidStringToken(escStart, \"Invalid Unicode escape\"); }\n      word += codePointToString(esc);\n      chunkStart = this.pos;\n    } else {\n      break\n    }\n    first = false;\n  }\n  return word + this.input.slice(chunkStart, this.pos)\n};\n\n// Read an identifier or keyword token. Will check for reserved\n// words when necessary.\n\npp.readWord = function() {\n  var word = this.readWord1();\n  var type = types$1.name;\n  if (this.keywords.test(word)) {\n    type = keywords[word];\n  }\n  return this.finishToken(type, word)\n};\n\n// Acorn is a tiny, fast JavaScript parser written in JavaScript.\n//\n// Acorn was written by Marijn Haverbeke, Ingvar Stepanyan, and\n// various contributors and released under an MIT license.\n//\n// Git repositories for Acorn are available at\n//\n//     http://marijnhaverbeke.nl/git/acorn\n//     https://github.com/acornjs/acorn.git\n//\n// Please use the [github bug tracker][ghbt] to report issues.\n//\n// [ghbt]: https://github.com/acornjs/acorn/issues\n\n\nvar version = \"8.15.0\";\n\nParser.acorn = {\n  Parser: Parser,\n  version: version,\n  defaultOptions: defaultOptions,\n  Position: Position,\n  SourceLocation: SourceLocation,\n  getLineInfo: getLineInfo,\n  Node: Node,\n  TokenType: TokenType,\n  tokTypes: types$1,\n  keywordTypes: keywords,\n  TokContext: TokContext,\n  tokContexts: types,\n  isIdentifierChar: isIdentifierChar,\n  isIdentifierStart: isIdentifierStart,\n  Token: Token,\n  isNewLine: isNewLine,\n  lineBreak: lineBreak,\n  lineBreakG: lineBreakG,\n  nonASCIIwhitespace: nonASCIIwhitespace\n};\n\n// The main exported interface (under `self.acorn` when in the\n// browser) is a `parse` function that takes a code string and returns\n// an abstract syntax tree as specified by the [ESTree spec][estree].\n//\n// [estree]: https://github.com/estree/estree\n\nfunction parse(input, options) {\n  return Parser.parse(input, options)\n}\n\n// This function tries to parse a single expression at a given\n// offset in a string. Useful for parsing mixed-language formats\n// that embed JavaScript expressions.\n\nfunction parseExpressionAt(input, pos, options) {\n  return Parser.parseExpressionAt(input, pos, options)\n}\n\n// Acorn is organized as a tokenizer and a recursive-descent parser.\n// The `tokenizer` export provides an interface to the tokenizer.\n\nfunction tokenizer(input, options) {\n  return Parser.tokenizer(input, options)\n}\n\nexport { Node, Parser, Position, SourceLocation, TokContext, Token, TokenType, defaultOptions, getLineInfo, isIdentifierChar, isIdentifierStart, isNewLine, keywords as keywordTypes, lineBreak, lineBreakG, nonASCIIwhitespace, parse, parseExpressionAt, types as tokContexts, types$1 as tokTypes, tokenizer, version };\n","/**\n * Sanitize an ID for use as an AssemblyScript identifier.\n * Replaces hyphens and other special characters with underscores.\n *\n * @param id - The ID to sanitize\n * @returns A valid AssemblyScript identifier\n */\nexport function sanitizeId(id: string): string {\n  // Replace hyphens and other non-alphanumeric characters (except underscores) with underscores\n  return id.replace(/[^a-zA-Z0-9_]/g, '_');\n}\n\n/**\n * Convert a node name to a camelCase key.\n * Used for wrapping decision table outputs with the node name.\n * Example: \"RiskFactors\" -> \"riskFactors\", \"DiscountRules\" -> \"discountRules\"\n *\n * @param name - The node name to convert\n * @returns A camelCase key\n */\nexport function nodeNameToKey(name: string): string {\n  if (!name || name.length === 0) {\n    return name;\n  }\n  // Lowercase the first character\n  return name.charAt(0).toLowerCase() + name.slice(1);\n}\n","import type { CompilationContext } from '../types';\nimport { CompilationError, ErrorCode, type SourceLocation } from '../errors';\nimport { parse as parseAcorn } from 'acorn';\nimport { sanitizeId } from '../utils';\n\n/**\n * Function node content interface\n */\nexport interface FunctionNodeContent {\n  /** The JavaScript source code for the function */\n  source: string;\n  /** Parsed AST of the function body */\n  ast?: any;\n  /** Extracted function parameters */\n  parameters: string[];\n}\n\n/**\n * Extract the source code from a function node content field.\n *\n * Handles both legacy format (plain string) and v2 format (object with source property).\n * TODO: Verify if legacy format still exists in fixtures, update comment accordingly\n *\n * @param content - The content field from a function node\n * @param location - Optional source location for error reporting\n * @returns The JavaScript source code string\n */\nexport function extractFunctionSource(content: any, location?: SourceLocation): string {\n  if (content === null || content === undefined) {\n    throw new CompilationError(\n      'Function node content is missing',\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      location,\n    );\n  }\n\n  if (typeof content === 'object' && content.source !== undefined) {\n    if (typeof content.source !== 'string') {\n      throw new CompilationError(\n        'Function node content.source must be a string',\n        ErrorCode.INVALID_NODE_STRUCTURE,\n        { ...location, field: 'content.source' },\n      );\n    }\n    return content.source;\n  }\n\n  if (typeof content === 'string') {\n    return content;\n  }\n\n  throw new CompilationError(\n    'Function node content must be either a string or an object with a source property',\n    ErrorCode.INVALID_NODE_STRUCTURE,\n    { ...location, field: 'content' },\n  );\n}\n\n/**\n * Parse JavaScript function code to extract parameters and body.\n *\n * @param source - The JavaScript source code string\n * @param location - Optional source location for error reporting\n * @returns A FunctionNodeContent with extracted information\n */\nexport function parseFunctionCode(source: string, location?: SourceLocation): FunctionNodeContent {\n  const content: FunctionNodeContent = {\n    source,\n    parameters: [],\n  };\n\n  try {\n    // Parse the source code using Acorn.\n    const ast = parseAcorn(source, {\n      ecmaVersion: 'latest',\n      sourceType: 'module',\n      allowAwaitOutsideFunction: true,\n    });\n\n    content.ast = ast;\n\n    const functionNode = findExportedFunction(ast);\n\n    if (functionNode) {\n      content.parameters = extractParameters(functionNode);\n    }\n  } catch (error) {\n    // Parse errors in function code should fail compilation immediately with clear error\n    // messages, rather than deferring to runtime where the error context would be lost.\n    if (error instanceof Error) {\n      throw new CompilationError(\n        `Failed to parse function code: ${error.message}`,\n        ErrorCode.PARSE_ERROR,\n        { ...location, field: 'content.source' },\n      );\n    }\n    throw error;\n  }\n\n  return content;\n}\n\n/**\n * Validate a function node's content structure.\n *\n * @param node - The JDM function node to validate\n * @returns Extracted and validated function node content\n */\nexport function validateFunctionNode(node: {\n  id: string;\n  name: string;\n  content?: any;\n}): FunctionNodeContent {\n  const location: SourceLocation = { nodeId: node.id, nodeName: node.name };\n\n  if (!node.content) {\n    throw new CompilationError(\n      `Function node \"${node.name}\" (${node.id}) is missing required content field`,\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { ...location, field: 'content' },\n    );\n  }\n\n  const source = extractFunctionSource(node.content, location);\n\n  const parsedContent = parseFunctionCode(source, location);\n\n  return {\n    ...parsedContent,\n    source,\n  };\n}\n\n/**\n * Find an exported function in the AST.\n *\n * Looks for patterns like:\n * - `export const handler = (input) => { ... }`\n * - `export function handler(input) { ... }`\n *\n * @param ast - The parsed AST\n * @returns The function declaration or expression, or null if not found\n */\nfunction findExportedFunction(ast: any): any {\n  if (!ast.body) {\n    return null;\n  }\n\n  for (const node of ast.body) {\n    // Pattern: export function name(...) { ... }\n    if (node.type === 'ExportNamedDeclaration' && node.declaration) {\n      if (node.declaration.type === 'FunctionDeclaration') {\n        return node.declaration;\n      }\n    }\n\n    // Pattern: export const/let/var name = (input) => { ... }\n    if (node.type === 'ExportNamedDeclaration' && node.declaration) {\n      if (node.declaration.type === 'VariableDeclaration') {\n        const declarator = node.declaration.declarations[0];\n        if (declarator && declarator.init) {\n          // Arrow function: (input) => { ... }\n          if (declarator.init.type === 'ArrowFunctionExpression') {\n            return declarator.init;\n          }\n          // Regular function: function(input) { ... }\n          if (declarator.init.type === 'FunctionExpression') {\n            return declarator.init;\n          }\n        }\n      }\n    }\n\n    // Pattern: export default ...) => { ... }\n    if (node.type === 'ExportDefaultDeclaration') {\n      if (node.declaration.type === 'FunctionDeclaration') {\n        return node.declaration;\n      }\n      if (node.declaration.type === 'ArrowFunctionExpression') {\n        return node.declaration;\n      }\n      if (node.declaration.type === 'FunctionExpression') {\n        return node.declaration;\n      }\n    }\n  }\n\n  return null;\n}\n\n/**\n * Extract parameter names from a function AST node.\n *\n * @param functionNode - The function AST node\n * @returns Array of parameter names\n */\nfunction extractParameters(functionNode: any): string[] {\n  if (!functionNode.params || !Array.isArray(functionNode.params)) {\n    return [];\n  }\n\n  return functionNode.params\n    .map((param: any) => {\n      // Simple identifier: input\n      if (param.type === 'Identifier') {\n        return param.name;\n      }\n\n      // Destructuring: { input, context } or [input, context]\n      if (param.type === 'ObjectPattern') {\n        return param.properties\n          .map((prop: any) => prop.key?.name || prop.value?.name)\n          .filter(Boolean);\n      }\n\n      if (param.type === 'ArrayPattern') {\n        return param.elements.map((elem: any) => elem?.name).filter(Boolean);\n      }\n\n      return null;\n    })\n    .flat()\n    .filter(Boolean) as string[];\n}\n\n/**\n * Compile a function node to AssemblyScript code.\n *\n * This function generates AssemblyScript code that:\n * 1. Reads input parameters from the context\n * 2. Calls the JavaScript bridge function to execute the user's function\n * 3. Converts the return value to the Value type\n *\n * @param node - The JDM function node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code for evaluating the function node\n */\nexport function compileFunctionNode(\n  node: {\n    id: string;\n    name: string;\n    content?: any;\n    parsedContent?: FunctionNodeContent;\n  },\n  context: CompilationContext,\n): string {\n  const sanitizedId = sanitizeId(node.id);\n\n  if (!node.parsedContent) {\n    throw new CompilationError(\n      `Function node \"${node.name}\" (${node.id}) has not been parsed`,\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { nodeId: node.id, nodeName: node.name, field: 'parsedContent' },\n    );\n  }\n\n  const { source, parameters } = node.parsedContent;\n\n  // Store the function source in the compilation context for later retrieval.\n  // Function sources must be kept separate from runtime context data to avoid naming conflicts\n  // and ensure proper scoping. The prefix prevents collisions with user-defined fields.\n  if (!context.functionSources) {\n    context.functionSources = new Map();\n  }\n  context.functionSources.set(sanitizedId, source);\n\n  // Generate parameter reading and marshaling code\n  // Parameters need to be collected into an array for the bridge call\n  const paramReads =\n    parameters.length > 0\n      ? parameters\n          .map((param) => {\n            return `  let ${param} = ctx.get(\"${param}\");`;\n          })\n          .join('\\n')\n      : '';\n\n  const paramArray =\n    parameters.length > 0\n      ? `\n  // Create parameter array for JavaScript bridge\n  let params = new Array<Value>(0);\n${parameters.map((param) => `  params.push(${param});`).join('\\n')}\n`\n      : `\n  // No parameters\n  let params = new Array<Value>(0);\n`;\n\n  // Generate the main evaluateNode function\n  // TODO: Mock execution returns a placeholder result for testing purposes.\n  // This allows the compiler to generate valid code and tests to run while the JavaScript\n  // function execution bridge is not yet implemented. This will be replaced with actual\n  // JavaScript bridge functionality in a future phase\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  // Function node: ${node.name}\n  // This node would execute JavaScript code and return the result\n  // For now, we return a mock result to allow compilation and testing\n\n${paramReads}\n${paramArray}\n  // Mock result: return an object indicating function execution\n  // This is a placeholder - actual JavaScript execution will be implemented\n  // via a JavaScript bridge in the runtime\n  let mockResult = new Map<string, Value>();\n  mockResult.set(\"_isFunctionNode\", Value.Bool(true));\n  mockResult.set(\"_nodeName\", Value.String(\"${node.name}\"));\n${parameters.length > 0 ? parameters.map((param) => `  mockResult.set(\"_${param}\", ${param});`).join('\\n') : ''}\n  mockResult.set(\"_output\", Value.String(\"Function execution not yet implemented\"));\n  \n  let result = Value.Object(mockResult);\n\n  return result;\n}`;\n}\n","import { CompilationError, ErrorCode } from './errors';\nimport { validateFunctionNode } from './nodes/function';\n\nexport enum NodeType {\n  INPUT = 'inputNode',\n  OUTPUT = 'outputNode',\n  DECISION_TABLE = 'decisionTableNode',\n  SWITCH = 'switchNode',\n  EXPRESSION = 'expressionNode',\n  DECISION = 'decisionNode',\n  FUNCTION = 'functionNode',\n}\n\nexport interface JDMNode {\n  id: string;\n  type: NodeType;\n  name: string;\n  position: { x: number; y: number };\n  content?: any;\n  parsedContent?: any;\n}\n\nexport interface JDMEdge {\n  id: string;\n  type: string;\n  sourceId: string;\n  targetId: string;\n  /** Optional source handle for nodes with multiple outputs (e.g., switch statements) */\n  sourceHandle?: string;\n}\n\nexport interface JDMDecision {\n  nodes: JDMNode[];\n  edges: JDMEdge[];\n  metadata?: any;\n}\n\n/**\n * Validate that a node has all required fields.\n *\n * All JDM nodes must have: id, name, and type.\n * Validating early provides clear error messages before processing.\n *\n * @param node - The node to validate\n * @param index - The index of the node in the nodes array (for error reporting)\n * @throws CompilationError if required fields are missing\n */\nexport function validateNodeStructure(node: any, index: number): void {\n  const missingFields: string[] = [];\n\n  if (typeof node.id !== 'string' || node.id.trim() === '') {\n    missingFields.push('id');\n  }\n\n  if (typeof node.name !== 'string') {\n    missingFields.push('name');\n  }\n\n  if (typeof node.type !== 'string' || node.type.trim() === '') {\n    missingFields.push('type');\n  }\n\n  if (missingFields.length > 0) {\n    const nodeIdentifier = node.id || node.name || `at index ${index}`;\n    throw new CompilationError(\n      `Node \"${nodeIdentifier}\" is missing required field(s): ${missingFields.join(', ')}`,\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { nodeId: node.id, nodeName: node.name },\n    );\n  }\n}\n\n/**\n * Parse and validate JDM JSON.\n * Function nodes have complex internal structure that needs schema validation and transformation.\n * Validating early provides better error messages and catches issues before expensive compilation steps.\n */\nexport function parseJDM(jdm: string | JDMDecision | any): JDMDecision {\n  const parsed: JDMDecision = typeof jdm === 'string' ? JSON.parse(jdm) : jdm;\n\n  // Validate basic structure before processing\n  if (!parsed.nodes || !Array.isArray(parsed.nodes)) {\n    throw new CompilationError(\n      \"Invalid JDM: missing or invalid 'nodes' array\",\n      ErrorCode.INVALID_JSON,\n      { field: 'nodes' },\n    );\n  }\n\n  // Validate each node has required fields before any processing\n  parsed.nodes.forEach((node: any, index: number) => {\n    validateNodeStructure(node, index);\n  });\n\n  // Function nodes have rich content structure (parameters, return type, expressions) requiring special\n  // parsing. Other node types have simpler content handled during codegen.\n  parsed.nodes.forEach((node: any) => {\n    if (node.type === NodeType.FUNCTION) {\n      try {\n        node.parsedContent = validateFunctionNode(node);\n      } catch (error) {\n        if (error instanceof CompilationError) {\n          throw error;\n        }\n        throw new CompilationError(\n          `Failed to parse function node \"${node.name}\": ${error instanceof Error ? error.message : String(error)}`,\n          ErrorCode.INVALID_NODE_STRUCTURE,\n          { nodeId: node.id, nodeName: node.name },\n        );\n      }\n    }\n  });\n\n  return parsed;\n}\n","import { DirectedGraph } from 'graphology';\nimport { topologicalSort } from 'graphology-dag';\nimport { type JDMNode, type JDMEdge, type JDMDecision, NodeType } from './parser';\nimport { CompilationError, ErrorCode, type SourceLocation } from './errors';\n\nexport type JDMGraph = DirectedGraph<JDMNode, JDMEdge>;\n\nexport function buildGraph(jdm: JDMDecision): JDMGraph {\n  const graph = new DirectedGraph<JDMNode, JDMEdge>();\n\n  // Map provides O(1) lookups for edge validation and node existence checks\n  const nodeMap = new Map<string, JDMNode>();\n  for (const node of jdm.nodes) {\n    graph.addNode(node.id, node);\n    nodeMap.set(node.id, node);\n  }\n\n  // Switch nodes can have multiple edges to same target (different cases/handles pointing to\n  // same node), but topological sort only needs one edge per source→target pair to establish\n  // ordering dependencies.\n  const addedEdges = new Set<string>();\n\n  // Add edges and check for self-references\n  for (const edge of jdm.edges) {\n    if (!nodeMap.has(edge.sourceId) || !nodeMap.has(edge.targetId)) {\n      const sourceNode = nodeMap.get(edge.sourceId);\n      const targetNode = nodeMap.get(edge.targetId);\n      throw new CompilationError(\n        `Invalid edge \"${edge.id}\": references non-existent node`,\n        ErrorCode.INVALID_EDGE,\n        {\n          nodeId: edge.sourceId,\n          nodeName: sourceNode?.name ?? targetNode?.name,\n          field: !nodeMap.has(edge.sourceId) ? 'sourceId' : 'targetId',\n        },\n      );\n    }\n\n    // Check for self-references (edge where source equals target)\n    if (edge.sourceId === edge.targetId) {\n      const node = graph.getNodeAttributes(edge.sourceId);\n      const location: SourceLocation = { nodeId: edge.sourceId, nodeName: node.name };\n      throw new CompilationError(\n        `Self-reference detected: node \"${node.name || edge.sourceId}\" references itself through edge \"${edge.id}\"`,\n        ErrorCode.CYCLE_DETECTED,\n        location,\n      );\n    }\n\n    // For topological ordering, we only need one edge between any two nodes.\n    // Switch nodes may have multiple edges to the same target (via different handles).\n    // We track the edge pair to avoid duplicates while preserving all edges in jdm.edges\n    // for the switch node compilation to use.\n    const edgePairKey = `${edge.sourceId}->${edge.targetId}`;\n    if (!addedEdges.has(edgePairKey)) {\n      graph.addEdgeWithKey(edge.id, edge.sourceId, edge.targetId, edge);\n      addedEdges.add(edgePairKey);\n    }\n  }\n\n  return graph;\n}\n\n/**\n * Find a cycle path in the graph using DFS. Graphology's cycle detection only returns a boolean,\n * but we need the actual cycle path to provide better error messages showing the problematic node\n * sequence to users.\n *\n * @param graph - The graph to search\n * @returns Array of node IDs representing the cycle, or null if no cycle\n */\nfunction findCyclePath(graph: JDMGraph): string[] | null {\n  const visited = new Set<string>();\n  const recursionStack = new Set<string>();\n  const parentMap = new Map<string, string | null>();\n\n  function dfs(nodeId: string, path: string[]): string[] | null {\n    visited.add(nodeId);\n    recursionStack.add(nodeId);\n    path.push(nodeId);\n\n    const neighbors = graph.outNeighbors(nodeId);\n    for (const neighborId of neighbors) {\n      if (!visited.has(neighborId)) {\n        parentMap.set(neighborId, nodeId);\n        const cycle = dfs(neighborId, path);\n        if (cycle) {\n          return cycle;\n        }\n      } else if (recursionStack.has(neighborId)) {\n        // Found a back edge - reconstruct the cycle path\n        // Path contains full traversal, but cycle only starts where we revisit a node.\n        // Slicing gives just the cycle portion (e.g., A→B→C→B extracts B→C→B).\n        const startIndex = path.indexOf(neighborId);\n        const cycle = [...path.slice(startIndex), neighborId];\n        return cycle;\n      }\n    }\n\n    recursionStack.delete(nodeId);\n    path.pop();\n    return null;\n  }\n\n  // Start DFS from each unvisited node\n  for (const nodeId of graph.nodes()) {\n    if (!visited.has(nodeId)) {\n      const cycle = dfs(nodeId, []);\n      if (cycle) {\n        return cycle;\n      }\n    }\n  }\n\n  return null;\n}\n\n/**\n * Format a cycle path as a readable string.\n *\n * @param cycle - Array of node IDs representing a cycle\n * @param graph - The graph to get node names from\n * @returns Formatted string like \"Node1 -> Node2 -> Node3 -> Node1\"\n */\nfunction formatCyclePath(cycle: string[], graph: JDMGraph): string {\n  return cycle\n    .map((nodeId) => {\n      const node = graph.getNodeAttributes(nodeId);\n      return node.name || nodeId;\n    })\n    .join(' -> ');\n}\n\nexport function validateGraph(graph: JDMGraph): void {\n  // Check for cycles using DFS to find the actual cycle path\n  const cyclePath = findCyclePath(graph);\n  if (cyclePath) {\n    const formattedPath = formatCyclePath(cyclePath, graph);\n    throw new CompilationError(\n      `Circular dependency detected: ${formattedPath}`,\n      ErrorCode.CYCLE_DETECTED,\n      { nodeId: cyclePath[0], nodeName: graph.getNodeAttributes(cyclePath[0]).name },\n    );\n  }\n\n  // Check for single input node\n  const inputNodes: string[] = [];\n  const outputNodes: string[] = [];\n\n  graph.forEachNode((nodeId, attrs) => {\n    if (attrs.type === NodeType.INPUT) {\n      inputNodes.push(nodeId);\n    }\n    if (attrs.type === NodeType.OUTPUT) {\n      outputNodes.push(nodeId);\n    }\n  });\n\n  if (inputNodes.length !== 1) {\n    // If there are multiple input nodes, include the first one in the location\n    const firstInputNode = inputNodes.length > 0 ? graph.getNodeAttributes(inputNodes[0]) : null;\n    throw new CompilationError(\n      `Expected exactly 1 input node, found ${inputNodes.length}`,\n      ErrorCode.MULTIPLE_INPUT_NODES,\n      firstInputNode ? { nodeId: firstInputNode.id, nodeName: firstInputNode.name } : undefined,\n    );\n  }\n  if (outputNodes.length === 0) {\n    throw new CompilationError(\n      'Expected at least 1 output node, found 0',\n      ErrorCode.MISSING_OUTPUT_NODE,\n      { field: 'outputNode' },\n    );\n  }\n}\n\n/**\n * Get nodes in topological order for evaluation.\n * This ensures dependencies are evaluated before dependents.\n */\nexport function getEvaluationOrder(graph: JDMGraph): string[] {\n  return topologicalSort(graph);\n}\n\n/**\n * Get all nodes that feed into a given node.\n */\nexport function getInputNodes(graph: JDMGraph, nodeId: string): JDMNode[] {\n  return graph.inNeighbors(nodeId).map((id) => graph.getNodeAttributes(id));\n}\n\n/**\n * Get all nodes that a given node feeds into.\n */\nexport function getOutputNodes(graph: JDMGraph, nodeId: string): JDMNode[] {\n  return graph.outNeighbors(nodeId).map((id) => graph.getNodeAttributes(id));\n}\n","import type { JDMNode } from '../parser';\nimport type { CompilationContext, AssemblyScriptCode } from '../types';\nimport { sanitizeId } from '../utils';\n\n/**\n * Compile an input node.\n *\n * Input nodes serve as entry points for the decision model and simply\n * pass through the context data.\n *\n * @param node - The JDM input node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileInputNode(node: JDMNode, _context: CompilationContext): AssemblyScriptCode {\n  const sanitizedId = sanitizeId(node.id);\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  // Input nodes are markers - they trigger evaluation but don't produce output.\n  // Null is used as a semantic marker meaning \"input processed, no output to add\".\n  // This distinguishes from actual output values while avoiding undefined/error states.\n  return Value.Null();\n}\n`;\n}\n\n/**\n * Compile an output node.\n *\n * Output nodes mark the end of the decision model and return the final result.\n * They return the accumulated context data from passThrough nodes.\n *\n * @param node - The JDM output node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileOutputNode(node: JDMNode, _context: CompilationContext): AssemblyScriptCode {\n  const sanitizedId = sanitizeId(node.id);\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  // Output nodes return the accumulated context data (passThrough values)\n  // Build result from all non-internal context entries\n  let __finalResult = new Map<string, Value>();\n  const __ctxKeys = ctx.data.keys();\n  for (let __i = 0; __i < __ctxKeys.length; __i++) {\n    const __key = __ctxKeys[__i];\n    // $-prefixed keys are internal namespaces ($nodes, $)\n    // # is iteration variable\n    // acc is reduce accumulator\n    // None should appear in final output - only actual output fields.\n    if (!__key.startsWith(\"$\") && __key !== \"#\" && __key !== \"acc\") {\n      // AssemblyScript has no Map.filter(), so we must iterate and conditionally add keys.\n      // This is more verbose but necessary given AS limitations.\n      __finalResult.set(__key, ctx.data.get(__key));\n    }\n  }\n  return Value.Object(__finalResult);\n}\n`;\n}\n","// ============================================================================\n// Context Resolver Strategy Pattern\n// ============================================================================\n//\n// The ContextResolver interface provides a strategy for resolving identifiers\n// and dollar references in different compilation contexts. This replaces three\n// separate compilation functions with a single unified function plus small\n// strategy implementations.\n//\n// Three modes:\n// 1. Standard: $ -> ctx.get(\"$\"), identifiers -> ctx.get(\"name\")\n// 2. LocalDollar: $ -> Value.Object(dollarVar), identifiers -> ctx.get(\"name\")\n// 3. Scoped: $ -> Value.Object(resultVar), identifiers -> scopedCtx.get(\"name\")\n\n/**\n * Strategy interface for resolving context references during expression compilation.\n *\n * Different compilation contexts require different resolutions:\n * - In standard expressions, $ refers to the global context\n * - In expression nodes, $ refers to the local result object being built\n * - In scoped expressions (inputField), identifiers resolve from a scoped context\n */\nexport interface ContextResolver {\n  /** Resolve an identifier reference (e.g., \"firstName\") */\n  resolveIdentifier(name: string): string;\n\n  /** Resolve a $ reference */\n  resolveDollarRef(): string;\n\n  /** Resolve a # reference (current element in higher-order functions) */\n  resolveHashRef(): string;\n\n  /** Resolve a member access path rooted at $ (e.g., \"$.foo.bar\" returns \"foo.bar\") */\n  resolveDollarPath(path: string): string;\n\n  /** Resolve a $nodes.X.Y path */\n  resolveNodesPath(path: string): string;\n\n  /** Get the context variable name for use in helper functions */\n  getContextVar(): string;\n\n  /** Create a child resolver for use inside helper functions (e.g., object literals) */\n  createChildResolver(): ContextResolver;\n\n  /** Get extra parameters for generated helper function signatures */\n  getHelperParams(): string;\n\n  /** Get extra arguments for calls to generated helper functions */\n  getHelperArgs(): string;\n}\n\n/**\n * Standard context resolver: $ and identifiers resolve from the global context.\n * Used in switch conditions, decision tables, and other standard expressions.\n */\nexport class StandardContextResolver implements ContextResolver {\n  resolveIdentifier(name: string): string {\n    return `ctx.get(\"${name}\")`;\n  }\n\n  resolveDollarRef(): string {\n    return `ctx.get(\"$\")`;\n  }\n\n  resolveHashRef(): string {\n    return `ctx.get(\"#\")`;\n  }\n\n  resolveDollarPath(path: string): string {\n    // In standard mode, $.foo.bar -> getProperty(ctx.get(\"$\"), \"foo\", \"bar\")\n    // Actually use nested getProperty calls for each segment\n    const segments = path.split('.');\n    let result = `ctx.get(\"$\")`;\n    for (const segment of segments) {\n      result = `getProperty(${result}, \"${segment}\")`;\n    }\n    return result;\n  }\n\n  resolveNodesPath(path: string): string {\n    return `ctx.get(\"${path}\")`;\n  }\n\n  getContextVar(): string {\n    return 'ctx';\n  }\n\n  createChildResolver(): ContextResolver {\n    // Child is same as parent in standard mode\n    return this;\n  }\n\n  getHelperParams(): string {\n    return '';\n  }\n\n  getHelperArgs(): string {\n    return '';\n  }\n}\n\n/**\n * Local dollar resolver: $ refers to a local Map variable (e.g., \"result\").\n * Used in expression nodes where $ references the output being built.\n */\nexport class LocalDollarContextResolver implements ContextResolver {\n  constructor(private dollarVar: string = 'result') {}\n\n  resolveIdentifier(name: string): string {\n    return `ctx.get(\"${name}\")`;\n  }\n\n  resolveDollarRef(): string {\n    return `Value.Object(${this.dollarVar})`;\n  }\n\n  resolveHashRef(): string {\n    return `ctx.get(\"#\")`;\n  }\n\n  resolveDollarPath(path: string): string {\n    // $.foo.bar looks up \"foo.bar\" as a flat key in the local result map\n    // Expression nodes store keys like \"eligibility.specialOffers\" as flat strings\n    return `(${this.dollarVar}.has(\"${path}\") ? ${this.dollarVar}.get(\"${path}\") : Value.Null())`;\n  }\n\n  resolveNodesPath(path: string): string {\n    return `ctx.get(\"${path}\")`;\n  }\n\n  getContextVar(): string {\n    return 'ctx';\n  }\n\n  createChildResolver(): ContextResolver {\n    // Child resolver references 'parentResult' to maintain access to outer scope\n    // Example: {a: 5, nested: {b: $.a}} - nested object's $.a refers to outer result\n    return new LocalDollarContextResolver('parentResult');\n  }\n\n  getHelperParams(): string {\n    return ', parentResult: Map<string, Value>';\n  }\n\n  getHelperArgs(): string {\n    return `, ${this.dollarVar}`;\n  }\n}\n\n/**\n * Scoped context resolver: identifiers resolve from a scoped context variable.\n * Used for inputField scoping and loop mode where a subset of the context is available.\n */\nexport class ScopedContextResolver implements ContextResolver {\n  constructor(\n    private ctxVar: string = 'scopedCtx',\n    private resultVar: string = 'itemResult',\n  ) {}\n\n  resolveIdentifier(name: string): string {\n    return `${this.ctxVar}.get(\"${name}\")`;\n  }\n\n  resolveDollarRef(): string {\n    return `Value.Object(${this.resultVar})`;\n  }\n\n  resolveHashRef(): string {\n    return `${this.ctxVar}.get(\"#\")`;\n  }\n\n  resolveDollarPath(path: string): string {\n    // $.foo looks up \"foo\" in the local result variable\n    return `(${this.resultVar}.has(\"${path}\") ? ${this.resultVar}.get(\"${path}\") : Value.Null())`;\n  }\n\n  resolveNodesPath(path: string): string {\n    return `${this.ctxVar}.get(\"${path}\")`;\n  }\n\n  getContextVar(): string {\n    return this.ctxVar;\n  }\n\n  createChildResolver(): ContextResolver {\n    // In scoped context, child keeps the same context var and result var\n    return this;\n  }\n\n  getHelperParams(): string {\n    return `, ${this.ctxVar}: Context, ${this.resultVar}: Map<string, Value>`;\n  }\n\n  getHelperArgs(): string {\n    return `, ${this.ctxVar}, ${this.resultVar}`;\n  }\n}\n","// ============================================================================\n// Expression AST Compiler\n// ============================================================================\n//\n// This module provides the core expression compilation functionality for\n// transforming expression ASTs into AssemblyScript code. It uses the\n// ContextResolver strategy pattern to handle different compilation contexts.\n\nimport type {\n  ExpressionAST,\n  BinaryOp,\n  UnaryOp,\n  NumberLiteral,\n  StringLiteral,\n  BooleanLiteral,\n  Identifier,\n  TernaryOp,\n  MemberAccess,\n  IndexAccess,\n  FunctionCall,\n  Interval,\n  TemplateLiteral,\n  ArrayLiteral,\n  ObjectLiteral,\n} from '../ast-types';\nimport type { CompilationContext } from '../types';\nimport type { ContextResolver } from './context-resolvers';\nimport { StandardContextResolver } from './context-resolvers';\n\n// ============================================================================\n// Unified Expression Compiler\n// ============================================================================\n\n/**\n * Compile an expression AST using the provided context resolver strategy.\n *\n * This is the single unified implementation that handles all expression compilation.\n * The resolver parameter determines how identifiers, $, and # are resolved.\n *\n * @param ast - The AST node to compile\n * @param context - The compilation context\n * @param resolver - The context resolution strategy\n * @returns AssemblyScript code string that produces a Value\n */\nexport function compileExpressionUnified(\n  ast: ExpressionAST,\n  context: CompilationContext,\n  resolver: ContextResolver,\n): string {\n  switch (ast.type) {\n    case 'NumberLiteral':\n      return `Value.Float(${(ast as NumberLiteral).value})`;\n\n    case 'StringLiteral':\n      return `Value.String(\"${escapeString((ast as StringLiteral).value)}\")`;\n\n    case 'BooleanLiteral':\n      return `Value.Bool(${(ast as BooleanLiteral).value})`;\n\n    case 'NullLiteral':\n      return `Value.Null()`;\n\n    case 'Identifier':\n      return resolver.resolveIdentifier((ast as Identifier).name);\n\n    case 'DollarRef':\n      return resolver.resolveDollarRef();\n\n    case 'HashRef':\n      return resolver.resolveHashRef();\n\n    case 'BinaryOp': {\n      const bop = ast as BinaryOp;\n      const left = compileExpressionUnified(bop.left, context, resolver);\n      const right = compileExpressionUnified(bop.right, context, resolver);\n      return compileBinaryOpWithValues(bop.op, left, right);\n    }\n\n    case 'UnaryOp': {\n      const uop = ast as UnaryOp;\n      const operand = compileExpressionUnified(uop.operand, context, resolver);\n      switch (uop.op) {\n        case 'not':\n          return `Value.Bool(!(${operand}).asBool())`;\n        case '-':\n          return `negateValue(${operand})`;\n        default:\n          throw new Error(`Unknown unary operator: ${uop.op}`);\n      }\n    }\n\n    case 'TernaryOp': {\n      const top = ast as TernaryOp;\n      const cond = compileExpressionUnified(top.condition, context, resolver);\n      const cons = compileExpressionUnified(top.consequent, context, resolver);\n      const alt = compileExpressionUnified(top.alternate, context, resolver);\n      return `(${cond}.asBool() ? ${cons} : ${alt})`;\n    }\n\n    case 'MemberAccess': {\n      const ma = ast as MemberAccess;\n      // Handle $.property.subproperty - look up in appropriate context\n      const dollarPath = buildDollarPath(ma);\n      if (dollarPath) {\n        return resolver.resolveDollarPath(dollarPath);\n      }\n      // Check if this is a $nodes reference\n      if (checkIsNodesReference(ma)) {\n        const nodesPath = buildNodesPath(ma);\n        return resolver.resolveNodesPath(nodesPath);\n      }\n      // For other member access, use getProperty helper\n      const obj = compileExpressionUnified(ma.object, context, resolver);\n      return `getProperty(${obj}, \"${ma.property}\")`;\n    }\n\n    case 'IndexAccess': {\n      const ia = ast as IndexAccess;\n      const arr = compileExpressionUnified(ia.object, context, resolver);\n      const idx = compileExpressionUnified(ia.index, context, resolver);\n      return `getIndex(${arr}, ${idx})`;\n    }\n\n    case 'FunctionCall': {\n      const fc = ast as FunctionCall;\n      if (fc.callee.type === 'Identifier') {\n        const name = (fc.callee as Identifier).name;\n\n        // Higher-order functions need special handling\n        if (name === 'filter') {\n          return compileHigherOrderCall(fc, context, resolver, 'filter');\n        }\n        if (name === 'map') {\n          return compileHigherOrderCall(fc, context, resolver, 'map');\n        }\n        if (name === 'reduce') {\n          return compileHigherOrderCall(fc, context, resolver, 'reduce');\n        }\n        if (name === 'all') {\n          return compileHigherOrderCall(fc, context, resolver, 'all');\n        }\n        if (name === 'some') {\n          return compileHigherOrderCall(fc, context, resolver, 'some');\n        }\n\n        // Regular function call\n        const args = fc.args.map((arg) => compileExpressionUnified(arg, context, resolver));\n        const numArgs = args.length;\n\n        // AssemblyScript requires typed array constructors\n        if (numArgs === 1) {\n          return `evaluateFunction(\"${name}\", makeArgs1(${args[0]}))`;\n        } else if (numArgs === 2) {\n          return `evaluateFunction(\"${name}\", makeArgs2(${args[0]}, ${args[1]}))`;\n        } else if (numArgs === 3) {\n          return `evaluateFunction(\"${name}\", makeArgs3(${args[0]}, ${args[1]}, ${args[2]}))`;\n        } else {\n          return `evaluateFunction(\"${name}\", [${args.join(', ')}])`;\n        }\n      }\n      throw new Error('Only direct function calls are supported');\n    }\n\n    case 'Interval': {\n      const intv = ast as Interval;\n      const start = compileExpressionUnified(intv.start, context, resolver);\n      const end = compileExpressionUnified(intv.end, context, resolver);\n      return `createInterval(${start}, ${end}, ${intv.startInclusive}, ${intv.endInclusive})`;\n    }\n\n    case 'ArrayLiteral': {\n      const al = ast as ArrayLiteral;\n      if (al.elements.length === 0) {\n        return 'Value.Array(new Array<Value>(0))';\n      }\n      const elements = al.elements.map((e) => compileExpressionUnified(e, context, resolver));\n      return `Value.Array([${elements.join(', ')}])`;\n    }\n\n    case 'ObjectLiteral': {\n      const ol = ast as ObjectLiteral;\n      if (ol.properties.length === 0) {\n        return 'Value.Object(new Map<string, Value>())';\n      }\n      // Generate a helper function for object construction\n      const childResolver = resolver.createChildResolver();\n      const helperId = context.getUniqueId('object');\n      const props = ol.properties.map((p) => {\n        const value = compileExpressionUnified(p.value, context, childResolver);\n        return `  objResult.set(\"${p.key}\", ${value});`;\n      });\n\n      const helperCode = `\nfunction objectHelper_${helperId}(ctx: Context${resolver.getHelperParams()}): Value {\n  const objResult = new Map<string, Value>();\n${props.join('\\n')}\n  return Value.Object(objResult);\n}`;\n      context.helperFunctions.set(`objectHelper_${helperId}`, helperCode);\n      return `objectHelper_${helperId}(ctx${resolver.getHelperArgs()})`;\n    }\n\n    case 'TemplateLiteral': {\n      const tl = ast as TemplateLiteral;\n      const parts = tl.parts.map((part) => {\n        if ('text' in part) {\n          return `\"${escapeString(part.text)}\"`;\n        } else {\n          return `(${compileExpressionUnified(part.expr, context, resolver)}).asString()`;\n        }\n      });\n      if (parts.length === 0) {\n        return 'Value.String(\"\")';\n      }\n      if (parts.length === 1) {\n        return `Value.String(${parts[0]})`;\n      }\n      return `Value.String(${parts.join(' + ')})`;\n    }\n\n    default:\n      throw new Error(`Unsupported expression type: ${(ast as any).type}`);\n  }\n}\n\n// ============================================================================\n// Higher-Order Function Compilation\n// ============================================================================\n\n/**\n * Compile a higher-order function call (filter, map, reduce, all, some).\n *\n * These functions iterate over arrays and need helper functions that set # for each element.\n * The resolver's child resolver is used inside the helper to maintain proper scoping.\n */\nfunction compileHigherOrderCall(\n  ast: FunctionCall,\n  context: CompilationContext,\n  resolver: ContextResolver,\n  fnName: 'filter' | 'map' | 'reduce' | 'all' | 'some',\n): string {\n  const expectedArgs = fnName === 'reduce' ? 3 : 2;\n  if (ast.args.length !== expectedArgs) {\n    throw new Error(\n      `${fnName}() requires exactly ${expectedArgs} arguments, got ${ast.args.length}`,\n    );\n  }\n\n  const arrayExpr = ast.args[0];\n  const lambdaExpr = ast.args[1];\n\n  // Compile array expression with current resolver\n  const arrayCode = compileExpressionUnified(arrayExpr, context, resolver);\n\n  // Use child resolver for lambda (maintains access to outer scope)\n  const childResolver = resolver.createChildResolver();\n  const lambdaCode = compileExpressionUnified(lambdaExpr, context, childResolver);\n\n  const helperId = context.getUniqueId(fnName);\n  const extraParams = resolver.getHelperParams();\n  const extraArgs = resolver.getHelperArgs();\n\n  let helperCode: string;\n\n  switch (fnName) {\n    case 'filter':\n      helperCode = `\nfunction filterHelper_${helperId}(ctx: Context, arr: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return Value.Array(new Array<Value>(0));\n  }\n\n  const inputArr = arr.asArray();\n  const filterResult = new Array<Value>(0);\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    if (${lambdaCode}.asBool()) {\n      filterResult.push(element);\n    }\n  }\n\n  return Value.Array(filterResult);\n}`;\n      break;\n\n    case 'map':\n      helperCode = `\nfunction mapHelper_${helperId}(ctx: Context, arr: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return Value.Array(new Array<Value>(0));\n  }\n\n  const inputArr = arr.asArray();\n  const mapResult = new Array<Value>(0);\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    mapResult.push(${lambdaCode});\n  }\n\n  return Value.Array(mapResult);\n}`;\n      break;\n\n    case 'reduce': {\n      const initialExpr = ast.args[2];\n      const initialCode = compileExpressionUnified(initialExpr, context, resolver);\n      helperCode = `\nfunction reduceHelper_${helperId}(ctx: Context, arr: Value, initAcc: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return initAcc;\n  }\n\n  const inputArr = arr.asArray();\n  let reduceAcc = initAcc;\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    ctx.set(\"acc\", reduceAcc);\n    reduceAcc = ${lambdaCode};\n  }\n\n  return reduceAcc;\n}`;\n      context.helperFunctions.set(`reduceHelper_${helperId}`, helperCode);\n      return `reduceHelper_${helperId}(ctx, ${arrayCode}, ${initialCode}${extraArgs})`;\n    }\n\n    case 'all':\n      helperCode = `\nfunction allHelper_${helperId}(ctx: Context, arr: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return Value.Bool(false);\n  }\n\n  const inputArr = arr.asArray();\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    if (!${lambdaCode}.asBool()) {\n      return Value.Bool(false);\n    }\n  }\n\n  return Value.Bool(true);\n}`;\n      break;\n\n    case 'some':\n      helperCode = `\nfunction someHelper_${helperId}(ctx: Context, arr: Value${extraParams}): Value {\n  if (!arr.isArray()) {\n    return Value.Bool(false);\n  }\n\n  const inputArr = arr.asArray();\n\n  for (let i = 0; i < inputArr.length; i++) {\n    const element = inputArr[i];\n    ctx.set(\"#\", element);\n    if (${lambdaCode}.asBool()) {\n      return Value.Bool(true);\n    }\n  }\n\n  return Value.Bool(false);\n}`;\n      break;\n  }\n\n  context.helperFunctions.set(`${fnName}Helper_${helperId}`, helperCode);\n  return `${fnName}Helper_${helperId}(ctx, ${arrayCode}${extraArgs})`;\n}\n\n// ============================================================================\n// Binary Operator Compilation\n// ============================================================================\n\n/**\n * Helper to compile binary operations with pre-compiled left and right values.\n * This is the single source of truth for all binary operator code generation.\n *\n * @param op - The operator string (e.g., \"+\", \"-\", \"==\", \"and\", etc.)\n * @param left - Pre-compiled code string for the left operand\n * @param right - Pre-compiled code string for the right operand\n * @returns AssemblyScript code string for the binary operation\n */\nexport function compileBinaryOpWithValues(op: string, left: string, right: string): string {\n  switch (op) {\n    // Arithmetic\n    case '+':\n      return `addValues(${left}, ${right})`;\n    case '-':\n      return `subtractValues(${left}, ${right})`;\n    case '*':\n      return `multiplyValues(${left}, ${right})`;\n    case '/':\n      return `divideValues(${left}, ${right})`;\n    case '%':\n      return `moduloValues(${left}, ${right})`;\n    case '^':\n      return `powerValues(${left}, ${right})`;\n\n    // Comparison\n    case '==':\n      return `Value.Bool(valuesEqual(${left}, ${right}))`;\n    case '!=':\n      return `Value.Bool(!valuesEqual(${left}, ${right}))`;\n    case '<':\n      return `Value.Bool(compareValues(${left}, ${right}) < 0)`;\n    case '>':\n      return `Value.Bool(compareValues(${left}, ${right}) > 0)`;\n    case '<=':\n      return `Value.Bool(compareValues(${left}, ${right}) <= 0)`;\n    case '>=':\n      return `Value.Bool(compareValues(${left}, ${right}) >= 0)`;\n\n    // Logical\n    case 'and':\n      return `((${left}).asBool() ? (${right}) : (${left}))`;\n    case 'or':\n      return `((${left}).asBool() ? (${left}) : (${right}))`;\n\n    // Null coalescing\n    case '??':\n      return `(${left}.isNull() ? ${right} : ${left})`;\n\n    // Membership\n    case 'in':\n      return `valueIn(${left}, ${right})`;\n    case 'not in':\n      return `Value.Bool(!valueIn(${left}, ${right}).asBool())`;\n\n    default:\n      throw new Error(`Unknown binary operator: ${op}`);\n  }\n}\n\n// ============================================================================\n// Utility Functions\n// ============================================================================\n\n/**\n * Escape a string for use in AssemblyScript string literals.\n */\nexport function escapeString(s: string): string {\n  return s\n    .replace(/\\\\/g, '\\\\\\\\')\n    .replace(/\"/g, '\\\\\"')\n    .replace(/\\n/g, '\\\\n')\n    .replace(/\\r/g, '\\\\r')\n    .replace(/\\t/g, '\\\\t');\n}\n\n/**\n * Build the full dotted path for a $-rooted member access chain.\n * Returns null if the path is not rooted at $.\n *\n * Example: $.eligibility.specialOffers -> \"eligibility.specialOffers\"\n */\nexport function buildDollarPath(ast: MemberAccess): string | null {\n  if (ast.object.type === 'DollarRef') {\n    return ast.property;\n  }\n  if (ast.object.type === 'MemberAccess') {\n    const parentPath = buildDollarPath(ast.object as MemberAccess);\n    if (parentPath !== null) {\n      return `${parentPath}.${ast.property}`;\n    }\n  }\n  return null;\n}\n\n/**\n * Check if a member access chain is rooted at the '$nodes' identifier.\n */\nexport function checkIsNodesReference(ast: MemberAccess): boolean {\n  if (ast.object.type === 'Identifier') {\n    return (ast.object as Identifier).name === '$nodes';\n  } else if (ast.object.type === 'MemberAccess') {\n    return checkIsNodesReference(ast.object as MemberAccess);\n  }\n  return false;\n}\n\n/**\n * Build the full dotted path for a $nodes-rooted member access chain.\n */\nexport function buildNodesPath(ast: MemberAccess): string {\n  if (ast.object.type === 'Identifier') {\n    return `${(ast.object as Identifier).name}.${ast.property}`;\n  } else if (ast.object.type === 'MemberAccess') {\n    return `${buildNodesPath(ast.object as MemberAccess)}.${ast.property}`;\n  }\n  throw new Error('Invalid object type for $nodes reference');\n}\n\n// ============================================================================\n// Convenience Functions\n// ============================================================================\n\n// Singleton instance for standard context compilation\nconst standardResolver = new StandardContextResolver();\n\n/**\n * Compile an AST node to AssemblyScript code using standard context resolution.\n *\n * This is a convenience function that uses StandardContextResolver, where:\n * - $ references resolve to ctx.get(\"$\")\n * - Identifiers resolve to ctx.get(\"name\")\n *\n * For specialized compilation contexts (expression nodes with local $, scoped contexts),\n * use compileExpressionUnified directly with the appropriate resolver.\n *\n * @param ast - The AST node to compile\n * @param context - The compilation context\n * @returns AssemblyScript code string that produces a Value\n */\nexport function compileExpression(ast: ExpressionAST, context: CompilationContext): string {\n  return compileExpressionUnified(ast, context, standardResolver);\n}\n","// ============================================================================\n// Expression Node Compilation\n// ============================================================================\n//\n// This module provides compilation functionality for JDM expression nodes.\n// Expression nodes contain key-value pairs where values are expression strings.\n//\n// For the core expression AST compilation, see expression-compiler.ts.\n// For context resolution strategies, see context-resolvers.ts.\n\nimport type { CompilationContext, AssemblyScriptCode } from '../types';\nimport type { JDMNode } from '../parser';\nimport { sanitizeId } from '../utils';\nimport { LocalDollarContextResolver, ScopedContextResolver } from './context-resolvers';\nimport { compileExpressionUnified } from './expression-compiler';\n\n// Re-export commonly used items for backwards compatibility\nexport type { ContextResolver } from './context-resolvers';\nexport {\n  StandardContextResolver,\n  LocalDollarContextResolver,\n  ScopedContextResolver,\n} from './context-resolvers';\n\nexport {\n  compileExpressionUnified,\n  compileBinaryOpWithValues,\n  compileExpression,\n  escapeString,\n  buildDollarPath,\n  checkIsNodesReference,\n  buildNodesPath,\n} from './expression-compiler';\n\n/**\n * Compile an expression node.\n *\n * Expression nodes can contain one or more key-value pairs where\n * each value is an expression string that needs to be compiled.\n *\n * In expression nodes, the $ symbol refers to the local result object\n * being built, allowing later expressions to reference earlier ones.\n * For example: { \"a\": \"5\", \"b\": \"$.a + 10\" } - $.a references the 'a' computed above.\n *\n * Additional features:\n * - inputField: Specifies a sub-object path to use as the evaluation scope\n * - outputPath: Specifies the context path where the results will be stored\n * - executionMode: \"loop\" - Iterates over an array at inputField path\n *\n * @param node - The JDM expression node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileExpressionNode(\n  node: JDMNode,\n  context: CompilationContext,\n): AssemblyScriptCode {\n  const expressions = node.content.expressions as Array<{ key: string; value: string }>;\n  const passThrough = node.content.passThrough === true;\n  const inputField = node.content.inputField as string | undefined;\n  const outputPath = node.content.outputPath as string | undefined;\n  const executionMode = node.content.executionMode as string | undefined;\n  const sanitizedId = sanitizeId(node.id);\n\n  // Loop mode: iterates over array at inputField, evaluating expressions for each element\n  // Used when executionMode === \"loop\" to transform array items in place\n  if (executionMode === 'loop') {\n    return compileLoopExpressionNode(\n      node,\n      context,\n      expressions,\n      passThrough,\n      inputField,\n      outputPath,\n      sanitizedId,\n    );\n  }\n\n  // If inputField is specified, generate scoped evaluation code\n  if (inputField) {\n    return compileScopedExpressionNode(\n      node,\n      context,\n      expressions,\n      passThrough,\n      inputField,\n      outputPath,\n      sanitizedId,\n    );\n  }\n\n  // Standard mode: evaluates expressions in global context without inputField scoping\n  // Used when no inputField is specified - expressions resolve variables from root context\n  const resolver = new LocalDollarContextResolver('result');\n  const expressionAssignments = expressions\n    .map((expr) => {\n      try {\n        const ast = context.parseExpression(expr.value);\n        // Compile with $ resolved to local result variable using unified compiler\n        const compiled = compileExpressionUnified(ast, context, resolver);\n        return `  result.set(\"${expr.key}\", ${compiled});`;\n      } catch (e) {\n        throw new Error(`Failed to compile expression \"${expr.value}\" for key \"${expr.key}\": ${e}`);\n      }\n    })\n    .join('\\n');\n\n  if (passThrough) {\n    return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Copy all context values to preserve workflow state and allow referencing prior node results\n  // passThrough=true ensures downstream nodes can access both input data and intermediate results\n  const keys = ctx.data.keys();\n  for (let i = 0; i < keys.length; i++) {\n    const key = keys[i];\n    const value = ctx.data.get(key);\n    result.set(key, value);\n  }\n\n${expressionAssignments}\n\n  return Value.Object(result);\n}\n`;\n  }\n\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n  \n${expressionAssignments}\n  \n  return Value.Object(result);\n}\n`;\n}\n\n/**\n * Compile an expression node with inputField scoping.\n *\n * When inputField is specified (e.g., \"customer\"), expressions are evaluated\n * with the sub-object as the scope. So `firstName` resolves to `customer.firstName`.\n *\n * @param node - The JDM expression node\n * @param context - The compilation context\n * @param expressions - Array of key-value expression pairs\n * @param passThrough - Whether to pass through context values\n * @param inputField - The path to the input field (e.g., \"customer\")\n * @param outputPath - The path to store the output (e.g., \"customer\")\n * @param sanitizedId - Sanitized node ID\n * @returns Generated AssemblyScript code\n */\nfunction compileScopedExpressionNode(\n  node: JDMNode,\n  context: CompilationContext,\n  expressions: Array<{ key: string; value: string }>,\n  passThrough: boolean,\n  inputField: string,\n  outputPath: string | undefined,\n  sanitizedId: string,\n): AssemblyScriptCode {\n  // Generate unique helper to avoid name collisions in multi-node compilation\n  const helperId = context.getUniqueId('scopedExpr');\n\n  // Scoped evaluation: creates a temporary context where inputField object properties become top-level identifiers\n  // Enables expressions like \"firstName\" to resolve to \"customer.firstName\" when inputField=\"customer\"\n  const resolver = new ScopedContextResolver('scopedCtx', 'itemResult');\n  const expressionAssignments = expressions\n    .map((expr) => {\n      try {\n        const ast = context.parseExpression(expr.value);\n        // Use unified compiler with scoped context resolver\n        const compiled = compileExpressionUnified(ast, context, resolver);\n        return `    itemResult.set(\"${expr.key}\", ${compiled});`;\n      } catch (e) {\n        throw new Error(`Failed to compile expression \"${expr.value}\" for key \"${expr.key}\": ${e}`);\n      }\n    })\n    .join('\\n');\n\n  // Generate the helper function for scoped evaluation\n  // Can't use Context constructor directly - AssemblyScript Context requires specific initialization\n  // that's tied to the WASM module's memory management, so we use ScopedContext wrapper instead\n  const helperCode = `\nfunction scopedExprHelper_${helperId}(ctx: Context, inputObj: Value): Value {\n  // Build result starting with input object fields (for passThrough behavior)\n  const itemResult = new Map<string, Value>();\n  if (inputObj.isObject()) {\n    const inputMap = inputObj.asObject();\n    const inputKeys = inputMap.keys();\n    for (let i = 0; i < inputKeys.length; i++) {\n      const key = inputKeys[i];\n      itemResult.set(key, inputMap.get(key));\n    }\n  }\n  \n  // Two-layer context enables variable shadowing: inputField properties take precedence over parent context\n  // Allows \"status\" in inputField to shadow global \"status\" while preserving access to non-shadowed globals\n  const scopedData = new Map<string, Value>();\n  \n  // Copy parent context data first\n  const parentKeys = ctx.data.keys();\n  for (let i = 0; i < parentKeys.length; i++) {\n    const key = parentKeys[i];\n    scopedData.set(key, ctx.data.get(key));\n  }\n  \n  // Override with fields from the input object (inputField scope)\n  if (inputObj.isObject()) {\n    const inputMap = inputObj.asObject();\n    const inputKeys = inputMap.keys();\n    for (let i = 0; i < inputKeys.length; i++) {\n      const key = inputKeys[i];\n      scopedData.set(key, inputMap.get(key));\n    }\n  }\n  \n  // Create a scoped context wrapper for expression evaluation\n  const scopedCtx = new ScopedContext(scopedData);\n  \n  // Evaluate expressions in the scoped context\n${expressionAssignments}\n  \n  return Value.Object(itemResult);\n}`;\n\n  context.helperFunctions.set(`scopedExprHelper_${helperId}`, helperCode);\n\n  // Generate the main function that extracts inputField and calls the helper\n  if (passThrough) {\n    return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Pass through all context values (input + intermediate results)\n  const keys = ctx.data.keys();\n  for (let i = 0; i < keys.length; i++) {\n    const key = keys[i];\n    const value = ctx.data.get(key);\n    result.set(key, value);\n  }\n\n  // Get input object from inputField path: ${inputField}\n  const inputObj = ctx.get(\"${inputField}\");\n  \n  // Evaluate expressions in scoped context and store at outputPath: ${outputPath || inputField}\n  const scopedResult = scopedExprHelper_${helperId}(ctx, inputObj);\n  result.set(\"${outputPath || inputField}\", scopedResult);\n\n  return Value.Object(result);\n}\n`;\n  }\n\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Get input object from inputField path: ${inputField}\n  const inputObj = ctx.get(\"${inputField}\");\n  \n  // Evaluate expressions in scoped context and store at outputPath: ${outputPath || inputField}\n  const scopedResult = scopedExprHelper_${helperId}(ctx, inputObj);\n  result.set(\"${outputPath || inputField}\", scopedResult);\n\n  return Value.Object(result);\n}\n`;\n}\n\n/**\n * Compile an expression node with executionMode: \"loop\".\n *\n * When executionMode is \"loop\", expressions are evaluated for each item\n * in the array at inputField path. Each item gets the computed fields added.\n *\n * @param node - The JDM expression node\n * @param context - The compilation context\n * @param expressions - Array of key-value expression pairs\n * @param passThrough - Whether to pass through context values\n * @param inputField - The path to the input array (e.g., \"cart.items\")\n * @param outputPath - The path to store the output array (e.g., \"cart.items\")\n * @param sanitizedId - Sanitized node ID\n * @returns Generated AssemblyScript code\n */\nfunction compileLoopExpressionNode(\n  node: JDMNode,\n  context: CompilationContext,\n  expressions: Array<{ key: string; value: string }>,\n  passThrough: boolean,\n  inputField: string | undefined,\n  outputPath: string | undefined,\n  sanitizedId: string,\n): AssemblyScriptCode {\n  if (!inputField) {\n    throw new Error(`executionMode: \"loop\" requires inputField to be specified`);\n  }\n\n  // Generate a unique helper function for loop evaluation\n  const helperId = context.getUniqueId('loopExpr');\n\n  // Each iteration gets its own scoped context to isolate variables and prevent data leakage between iterations\n  // Ensures expressions like \"price * quantity\" use current item's values, not previous iteration's\n  const resolver = new ScopedContextResolver('itemCtx', 'itemResult');\n  const expressionAssignments = expressions\n    .map((expr) => {\n      try {\n        const ast = context.parseExpression(expr.value);\n        // Use unified compiler with scoped context resolver for array item\n        const compiled = compileExpressionUnified(ast, context, resolver);\n        return `      itemResult.set(\"${expr.key}\", ${compiled});`;\n      } catch (e) {\n        throw new Error(`Failed to compile expression \"${expr.value}\" for key \"${expr.key}\": ${e}`);\n      }\n    })\n    .join('\\n');\n\n  // Generate the helper function for loop evaluation\n  const helperCode = `\nfunction loopExprHelper_${helperId}(ctx: Context, inputArr: Value): Value {\n  if (!inputArr.isArray()) {\n    return Value.Array(new Array<Value>(0));\n  }\n  \n  const items = inputArr.asArray();\n  const resultItems = new Array<Value>(0);\n  \n  for (let i = 0; i < items.length; i++) {\n    const item = items[i];\n    \n    // Build result item starting with existing fields\n    const itemResult = new Map<string, Value>();\n    if (item.isObject()) {\n      const itemMap = item.asObject();\n      const itemKeys = itemMap.keys();\n      for (let j = 0; j < itemKeys.length; j++) {\n        const key = itemKeys[j];\n        itemResult.set(key, itemMap.get(key));\n      }\n    }\n    \n    // Create a scoped data map that combines parent context with item fields\n    const scopedData = new Map<string, Value>();\n    \n    // Copy parent context data first\n    const parentKeys = ctx.data.keys();\n    for (let j = 0; j < parentKeys.length; j++) {\n      const key = parentKeys[j];\n      scopedData.set(key, ctx.data.get(key));\n    }\n    \n    // Override with fields from the current item\n    if (item.isObject()) {\n      const itemMap = item.asObject();\n      const itemKeys = itemMap.keys();\n      for (let j = 0; j < itemKeys.length; j++) {\n        const key = itemKeys[j];\n        scopedData.set(key, itemMap.get(key));\n      }\n    }\n    \n    // Create a scoped context for expression evaluation\n    const itemCtx = new ScopedContext(scopedData);\n    \n    // Evaluate expressions for this item\n${expressionAssignments}\n    \n    resultItems.push(Value.Object(itemResult));\n  }\n  \n  return Value.Array(resultItems);\n}`;\n\n  context.helperFunctions.set(`loopExprHelper_${helperId}`, helperCode);\n\n  // Determine output path - use outputPath if specified, otherwise inputField\n  const effectiveOutputPath = outputPath || inputField;\n\n  // Generate the main function that extracts inputField array and calls the helper\n  if (passThrough) {\n    return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Pass through all context values (input + intermediate results)\n  const keys = ctx.data.keys();\n  for (let i = 0; i < keys.length; i++) {\n    const key = keys[i];\n    const value = ctx.data.get(key);\n    result.set(key, value);\n  }\n\n  // Get input array from inputField path: ${inputField}\n  const inputArr = ctx.get(\"${inputField}\");\n  \n  // Evaluate expressions for each item in the array\n  const loopResult = loopExprHelper_${helperId}(ctx, inputArr);\n  \n  // Store result at outputPath: ${effectiveOutputPath}\n  result.set(\"${effectiveOutputPath}\", loopResult);\n\n  return Value.Object(result);\n}\n`;\n  }\n\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  let result = new Map<string, Value>();\n\n  // Get input array from inputField path: ${inputField}\n  const inputArr = ctx.get(\"${inputField}\");\n  \n  // Evaluate expressions for each item in the array\n  const loopResult = loopExprHelper_${helperId}(ctx, inputArr);\n  \n  // Store result at outputPath: ${effectiveOutputPath}\n  result.set(\"${effectiveOutputPath}\", loopResult);\n\n  return Value.Object(result);\n}\n`;\n}\n","/**\n * Unary expression transformation utilities for decision table compilation.\n *\n * In decision tables, expressions are evaluated in a \"unary\" context where\n * the $ symbol is automatically bound to the input field's value. Since\n * AssemblyScript doesn't support closures, we transform the AST to replace\n * DollarRef nodes with pre-compiled code.\n *\n * This module provides:\n * - InlineCode: A marker type for pre-compiled code in ASTs\n * - replaceDollarRefWithCode: AST transformer for dollar reference substitution\n * - compileExpressionWithInlineCode: Compiler that handles InlineCode nodes\n */\n\nimport type { CompilationContext } from './types';\nimport { compileExpression, compileBinaryOpWithValues } from './nodes/expression';\n\n/**\n * Special marker type for inline code that should be inserted directly.\n *\n * Used when AST transformation requires embedding already-compiled code.\n * For example, when compiling \"$ > 100\" where $ refers to a field value,\n * we replace the DollarRef node with an InlineCode node containing the\n * pre-compiled field access code.\n */\nexport interface InlineCode {\n  type: 'InlineCode';\n  code: string;\n}\n\n/**\n * Recursively replace DollarRef nodes in an AST with InlineCode nodes\n * containing the pre-compiled field expression.\n *\n * This transformation enables unary expression compilation in AssemblyScript\n * by substituting $ references with actual field access code at compile time.\n *\n * @param ast - The AST node to transform\n * @param compiledField - The pre-compiled code for the field value\n * @returns The transformed AST with InlineCode nodes instead of DollarRef\n *\n * @example\n * // Original AST for \"$ > 100\":\n * // { type: \"BinaryOp\", op: \">\", left: { type: \"DollarRef\" }, right: { type: \"NumberLiteral\", value: 100 } }\n * //\n * // After transformation with compiledField = 'ctx.get(\"creditScore\")':\n * // { type: \"BinaryOp\", op: \">\", left: { type: \"InlineCode\", code: 'ctx.get(\"creditScore\")' }, right: { type: \"NumberLiteral\", value: 100 } }\n */\nexport function replaceDollarRefWithCode(ast: any, compiledField: string): any {\n  if (!ast || typeof ast !== 'object') {\n    return ast;\n  }\n\n  // If this is a DollarRef, replace it with InlineCode containing the compiled field\n  if (ast.type === 'DollarRef') {\n    return { type: 'InlineCode', code: compiledField } as InlineCode;\n  }\n\n  // Recursively transform child nodes\n  const result: any = { type: ast.type };\n\n  for (const key of Object.keys(ast)) {\n    if (key === 'type') {\n      continue;\n    }\n\n    const value = ast[key];\n    if (Array.isArray(value)) {\n      result[key] = value.map((item) => replaceDollarRefWithCode(item, compiledField));\n    } else if (value && typeof value === 'object') {\n      result[key] = replaceDollarRefWithCode(value, compiledField);\n    } else {\n      result[key] = value;\n    }\n  }\n\n  return result;\n}\n\n/**\n * Compile an AST that may contain InlineCode nodes.\n *\n * This compiler extends the standard expression compiler to handle InlineCode\n * nodes, which contain pre-compiled code that should be inserted directly.\n * It's used after replaceDollarRefWithCode to compile the transformed AST.\n *\n * @param ast - The AST node to compile (may contain InlineCode nodes)\n * @param context - The compilation context\n * @returns Compiled AssemblyScript code string\n */\nexport function compileExpressionWithInlineCode(ast: any, context: CompilationContext): string {\n  // Handle InlineCode nodes specially - just return the pre-compiled code\n  if (ast.type === 'InlineCode') {\n    return (ast as InlineCode).code;\n  }\n\n  // For nodes with binary operations\n  if (ast.type === 'BinaryOp') {\n    const left = compileExpressionWithInlineCode(ast.left, context);\n    const right = compileExpressionWithInlineCode(ast.right, context);\n    return compileBinaryOpWithValues(ast.op, left, right);\n  }\n\n  // For unary operations\n  if (ast.type === 'UnaryOp') {\n    const operand = compileExpressionWithInlineCode(ast.operand, context);\n    switch (ast.op) {\n      case 'not':\n        return `Value.Bool(!(${operand}).asBool())`;\n      case '-':\n        return `negateValue(${operand})`;\n      default:\n        throw new Error(`Unknown unary operator: ${ast.op}`);\n    }\n  }\n\n  // For function calls, compile args recursively to handle InlineCode\n  if (ast.type === 'FunctionCall') {\n    const callee = ast.callee;\n    if (callee.type === 'Identifier') {\n      const args = ast.args.map((arg: any) => compileExpressionWithInlineCode(arg, context));\n      const numArgs = args.length;\n\n      // Use helper functions to create argument arrays\n      if (numArgs === 1) {\n        return `evaluateFunction(\"${callee.name}\", makeArgs1(${args[0]}))`;\n      } else if (numArgs === 2) {\n        return `evaluateFunction(\"${callee.name}\", makeArgs2(${args[0]}, ${args[1]}))`;\n      } else if (numArgs === 3) {\n        return `evaluateFunction(\"${callee.name}\", makeArgs3(${args[0]}, ${args[1]}, ${args[2]}))`;\n      } else {\n        return `evaluateFunction(\"${callee.name}\", [${args.join(', ')}])`;\n      }\n    }\n    throw new Error('Only direct function calls are supported');\n  }\n\n  // For member access\n  if (ast.type === 'MemberAccess') {\n    const obj = compileExpressionWithInlineCode(ast.object, context);\n    return `getProperty(${obj}, \"${ast.property}\")`;\n  }\n\n  // For index access\n  if (ast.type === 'IndexAccess') {\n    const obj = compileExpressionWithInlineCode(ast.object, context);\n    const idx = compileExpressionWithInlineCode(ast.index, context);\n    return `getIndex(${obj}, ${idx})`;\n  }\n\n  // For ternary operations\n  if (ast.type === 'TernaryOp') {\n    const cond = compileExpressionWithInlineCode(ast.condition, context);\n    const cons = compileExpressionWithInlineCode(ast.consequent, context);\n    const alt = compileExpressionWithInlineCode(ast.alternate, context);\n    return `(${cond}.asBool() ? ${cons} : ${alt})`;\n  }\n\n  // For other node types, delegate to standard compileExpression\n  return compileExpression(ast, context);\n}\n","import type { JDMNode } from '../parser';\nimport type { CompilationContext, AssemblyScriptCode, NoMatchBehavior } from '../types';\nimport { sanitizeId } from '../utils';\nimport { compileExpression } from './expression';\nimport { replaceDollarRefWithCode, compileExpressionWithInlineCode } from '../unary-transform';\n\n/**\n * Decision table content structure.\n */\ninterface DecisionTableContent {\n  rules: any[];\n  inputs: any[];\n  outputs: any[];\n  hitPolicy: 'first' | 'collect' | 'unique' | 'ruleOrder' | 'outputOrder' | 'priority';\n  /** Override the global no-match behavior for this table */\n  noMatchBehavior?: NoMatchBehavior;\n  /** Whether to pass through input values to output */\n  passThrough?: boolean;\n}\n\n/**\n * Compile a comparison expression for a decision table condition.\n *\n * In decision tables, expressions are evaluated in a \"unary\" context where\n * the $ symbol is automatically bound to the input field's value.\n *\n * For example:\n * - \"> 100\" becomes \"$ > 100\" with $ bound to the input field\n * - \"admin\" becomes \"$ == admin\" (equality check)\n * - \"[1..10]\" becomes \"$ in [1..10]\" (range check)\n *\n * The field parameter can be either:\n * - A simple field name like \"creditScore\" → ctx.get(\"creditScore\")\n * - An expression like \"date(order.createdAt)\" → needs to be parsed and evaluated\n *\n * Since AssemblyScript doesn't support closures, we transform the AST\n * to replace DollarRef nodes with the compiled field expression.\n *\n * @param expr - The raw expression string\n * @param inputType - The type of the input field\n * @param field - The field expression to compare against\n * @param context - The compilation context\n * @returns Compiled AssemblyScript code for the comparison\n */\nfunction compileComparison(\n  expr: string,\n  inputType: string,\n  field: string | undefined,\n  context: CompilationContext,\n): string {\n  // Handle empty expressions or unset values. Empty cells mean \"any value matches\" for\n  // that column. This is flexible (allows partial rule specification) but can be dangerous\n  // (typos become wildcards). Following DMN/JDM convention where blank = don't care.\n  if (!expr || expr === '' || expr === '-') {\n    return 'true';\n  }\n\n  try {\n    // When input field is \"$\", the cell contains a full boolean expression rather than a\n    // unary comparison:\n    //   e.g., \"age > 18 and tier == 'gold'\"\n    // This allows complex conditions that span multiple input values in a single cell, useful\n    // for cross-column logic.\n    if (!field || field === '$') {\n      // Parse and compile the expression directly as a standard expression\n      const ast = context.parseExpression(expr);\n      const compiledExpr = compileExpression(ast, context);\n      return `${compiledExpr}.asBool()`;\n    }\n\n    // Parse the expression using unary parser for decision table cells\n    // This transforms expressions like \"> 100\" into AST representing \"$ > 100\"\n    const ast = context.parseUnaryExpression(expr);\n\n    // Compile the field expression to get the value to compare against\n    // The field can be a simple name like \"creditScore\" or an expression like \"date(order.createdAt)\"\n    const fieldAst = context.parseExpression(field);\n    const compiledField = compileExpression(fieldAst, context);\n\n    // Transform the AST to replace DollarRef nodes with the compiled field expression\n    // AssemblyScript doesn't support closures, so we can't create a function context\n    // where $ refers to the field value. Instead, we do direct AST substitution.\n    const transformedAst = replaceDollarRefWithCode(ast, compiledField);\n\n    // Compile the transformed AST to AssemblyScript code\n    const compiledExpr = compileExpressionWithInlineCode(transformedAst, context);\n\n    // Return the compiled expression wrapped in .asBool() for the condition\n    return `${compiledExpr}.asBool()`;\n  } catch (e) {\n    // If parsing fails, log the error and return false (no match)\n    // This prevents compilation failures from breaking the entire decision\n    throw new Error(\n      `Failed to compile decision table condition \"${expr}\" for field \"${field}\": ${e}`,\n    );\n  }\n}\n\n/**\n * Compile an output value for a decision table result.\n *\n * @param value - The raw value string\n * @param outputType - The type of the output field\n * @param field - The field name being set\n * @param context - The compilation context\n * @returns Compiled AssemblyScript code for the value\n */\nfunction compileOutputValue(\n  value: string,\n  outputType: string,\n  field: string,\n  context: CompilationContext,\n): string {\n  // Handle empty/unset values: in multi-output tables, rules may set some outputs but not others.\n  // Empty cells mean \"this rule doesn't provide a value for this output field\", allowing sparse tables.\n  if (!value || value === '-' || value === '') {\n    return '';\n  }\n\n  const normalizedType = (outputType || '').toLowerCase();\n\n  // Check if value is a quoted string literal ('value' or \"value\")\n  // In JDM format, string literals are often wrapped in single quotes\n  const isQuotedString =\n    (value.startsWith(\"'\") && value.endsWith(\"'\")) ||\n    (value.startsWith('\"') && value.endsWith('\"'));\n\n  // Strip outer quotes if present for string literal values\n  const unquotedValue = isQuotedString ? value.slice(1, -1) : value;\n\n  switch (normalizedType) {\n    case 'expression': {\n      // For expression type, parse and compile the value as an expression\n      // This allows output values to reference context variables or perform calculations\n      const ast = context.parseExpression(value);\n      return compileExpression(ast, context);\n    }\n\n    case 'string':\n    case 'text':\n      // Input values may have quotes that need escaping for the generated AS code. Must escape\n      // both backslashes (for escape sequences) and double quotes (for string delimiters).\n      const escaped = unquotedValue.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n      return 'Value.String(\"' + escaped + '\")';\n\n    case 'number':\n    case 'integer':\n    case 'decimal':\n    case 'double':\n      return `Value.Float(${parseFloat(value)})`;\n\n    case 'boolean':\n    case 'bool':\n      return `Value.Bool(${value.toLowerCase() === 'true'})`;\n\n    default:\n      // For untyped values, infer type through a cascade:\n      // 1. Quoted strings → string literal\n      // 2. \"true\"/\"false\" → boolean\n      // 3. Numeric format → number\n      // 4. Otherwise → try parsing as expression, fallback to string literal\n      if (isQuotedString) {\n        // Value is a string literal - use the unquoted value\n        const defaultEscaped = unquotedValue.replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n        return 'Value.String(\"' + defaultEscaped + '\")';\n      }\n\n      // Check if it's a boolean\n      if (value.toLowerCase() === 'true' || value.toLowerCase() === 'false') {\n        return `Value.Bool(${value.toLowerCase() === 'true'})`;\n      }\n\n      // Check if it's a number (use regex to handle trailing zeros like \"0.10\")\n      // The regex matches integer, decimal, and scientific notation formats\n      if (/^-?(\\d+\\.?\\d*|\\.\\d+)([eE][+-]?\\d+)?$/.test(value)) {\n        return `Value.Float(${parseFloat(value)})`;\n      }\n\n      // For unquoted non-literal values, treat as an expression\n      // This handles cases like \"basicEligibility.reason\" or \"totalScore * 1.5\"\n      try {\n        const ast = context.parseExpression(value);\n        return compileExpression(ast, context);\n      } catch (e) {\n        // Throw error instead of silently falling back to string literal\n        // This prevents type errors and typos from being silently converted to strings\n        throw new Error(\n          `Failed to compile output value \"${value}\" for field \"${field}\": ${e}. ` +\n            `If you intended a literal string, wrap it in quotes: '\"${value}\"' or \"'${value}'\"`,\n        );\n      }\n  }\n}\n\n/**\n * Extract string literals from compiled code and generate hoisted constants.\n * This optimization avoids repeated string allocations in large decision tables.\n *\n * Hoisting string literals to module-level constants prevents repeated allocations\n * that can exhaust WASM memory during table evaluation.\n *\n * @param code - The compiled code containing Value.String(...) calls\n * @param nodeId - Unique identifier for this node (used in constant names)\n * @returns Object with hoisted constants code and transformed code\n */\nfunction hoistStringLiterals(code: string, nodeId: string): { constants: string; code: string } {\n  // Find all Value.String(\"...\") patterns\n  const stringLiteralRegex = /Value\\.String\\(\"([^\"\\\\]|\\\\.)*\"\\)/g;\n  const matches = code.match(stringLiteralRegex) || [];\n\n  // Count occurrences\n  const counts = new Map<string, number>();\n  for (const match of matches) {\n    counts.set(match, (counts.get(match) || 0) + 1);\n  }\n\n  // Only hoist strings that appear more than once\n  const toHoist = new Map<string, string>();\n  let constIndex = 0;\n  for (const [literal, count] of counts) {\n    if (count > 1) {\n      // Extract the string content for naming\n      const constName = `__str_${sanitizeId(nodeId)}_${constIndex++}`;\n      toHoist.set(literal, constName);\n    }\n  }\n\n  // If nothing to hoist, return original\n  if (toHoist.size === 0) {\n    return { constants: '', code };\n  }\n\n  // Generate constant declarations\n  const constants = Array.from(toHoist.entries())\n    .map(([literal, constName]) => `const ${constName}: Value = ${literal};`)\n    .join('\\n');\n\n  // Replace literals with constant references\n  let transformedCode = code;\n  for (const [literal, constName] of toHoist) {\n    // Need to escape regex special chars in the literal\n    const escapedLiteral = literal.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n    transformedCode = transformedCode.replace(new RegExp(escapedLiteral, 'g'), constName);\n  }\n\n  return { constants, code: transformedCode };\n}\n\n/**\n * Compile a decision table node.\n *\n * Generates if/else chains for decision table evaluation, supporting:\n * - FIRST hit policy: Returns the first matching rule's output\n * - COLLECT hit policy: Aggregates all matching rules' outputs\n * - UNIQUE hit policy: Returns output if exactly one rule matches\n * - RULE ORDER hit policy: Returns all matching rules' outputs in rule order\n * - OUTPUT ORDER hit policy: Returns all matching rules sorted by output priority\n * - PRIORITY hit policy: Returns only the highest-priority matching rule\n *\n * For large decision tables (many rules with repeated string literals),\n * string literals are hoisted to module-level constants to avoid\n * repeated allocations that can exhaust memory.\n *\n * @param node - The JDM decision table node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileDecisionTableNode(\n  node: JDMNode,\n  context: CompilationContext,\n): AssemblyScriptCode {\n  const {\n    rules,\n    inputs,\n    outputs,\n    hitPolicy,\n    noMatchBehavior: tableNoMatchBehavior,\n    passThrough,\n  } = node.content as DecisionTableContent;\n\n  // Determine the effective no-match behavior (table-level overrides global)\n  const noMatchBehavior = tableNoMatchBehavior ??\n    context.options.noMatchBehavior ?? { type: 'returnNull' };\n\n  // Unique and priority need to evaluate all rules before making a decision\n  const isCollectAll =\n    hitPolicy === 'collect' ||\n    hitPolicy === 'unique' ||\n    hitPolicy === 'ruleOrder' ||\n    hitPolicy === 'outputOrder' ||\n    hitPolicy === 'priority';\n\n  // Generate the result declaration based on hit policy\n  let resultDeclaration: string;\n  if (isCollectAll) {\n    resultDeclaration = 'let results = new Array<Value>();';\n  } else {\n    resultDeclaration = '';\n  }\n\n  // Generate the rule evaluation branches\n  const ruleBranches = rules\n    .map((rule, idx) => {\n      // Compile all input conditions for this rule\n      const conditions = inputs\n        .map((input) => {\n          const expr = rule[input.id];\n          if (!expr || expr === '' || expr === '-') {\n            return 'true';\n          }\n          return compileComparison(expr, input.type, input.field, context);\n        })\n        .join(' && ');\n\n      // Compile all output values for this rule\n      const resultAssignments = outputs\n        .map((output) => {\n          const value = rule[output.id];\n          if (!value || value === '' || value === '-') {\n            return '';\n          }\n          const compiled = compileOutputValue(value, output.type, output.field, context);\n          return `    result.set(\"${output.field}\", ${compiled});`;\n        })\n        .filter(Boolean)\n        .join('\\n');\n\n      // Generate the conditional expression and action\n      if (isCollectAll) {\n        // For collect-mode hit policies, evaluate all rules independently\n        return `\n  if (${conditions || 'true'}) {\n    let result = new Map<string, Value>();\n${resultAssignments}\n    results.push(Value.Object(result));\n  }`;\n      } else {\n        // For FIRST hit policy, use if/else if chain\n        const conditionalExpr =\n          idx === 0 ? `if (${conditions || 'true'})` : `else if (${conditions || 'true'})`;\n        return `${conditionalExpr} {\n    let result = new Map<string, Value>();\n${resultAssignments}\n    return Value.Object(result);\n  }`;\n      }\n    })\n    .join(isCollectAll ? '\\n' : '\\n');\n\n  // Generate the no-match handler based on the effective behavior\n  function generateNoMatchHandler(): string {\n    const returnNull = 'return Value.Null();';\n\n    // We need to signal to the caller that no rules matched but the table has passThrough enabled,\n    // so it should return accumulated context. We can't directly access the outer context here, so\n    // we return a marker object that the caller detects and handles.\n    const returnPassthroughSignal = `let __pt = new Map<string, Value>();\n    __pt.set(\"__passthrough\", Value.Bool(true));\n    return Value.Object(__pt);`;\n\n    if (noMatchBehavior.type === 'throwError') {\n      return `SetLastErrorWithMessage(RuntimeErrorCode.EVALUATION_ERROR, \"Decision table \\\\\"${node.name}\\\\\" (id: ${node.id}): No matching rules found\");\\n  ${returnNull}`;\n    } else if (noMatchBehavior.type === 'returnDefault') {\n      const defaultValue = noMatchBehavior.value;\n\n      // Generate the default value as a Value based on its JavaScript type\n      let defaultValueCode: string;\n      switch (typeof defaultValue) {\n        case 'string':\n          defaultValueCode = `Value.String(\"${String(defaultValue).replace(/\"/g, '\\\\\"')}\")`;\n          break;\n        case 'number':\n          defaultValueCode = `Value.Float(${defaultValue})`;\n          break;\n        case 'boolean':\n          defaultValueCode = `Value.Bool(${defaultValue})`;\n          break;\n        default:\n          defaultValueCode = `Value.String(\"${String(defaultValue)}\")`;\n      }\n\n      // Assign the default value to each output field\n      const defaultAssignments = outputs\n        .map((output) => {\n          return `    result.set(\"${output.field}\", ${defaultValueCode});`;\n        })\n        .join('\\n');\n\n      const defaultAssignmentSingle =\n        outputs.length > 0\n          ? `  let result = new Map<string, Value>();\\n${defaultAssignments}\\n  return Value.Object(result);`\n          : returnNull;\n\n      if (isCollectAll) {\n        // For collect-mode policies, return array with default result\n        return `  let result = new Map<string, Value>();\\n${defaultAssignments}\\n  return Value.Array([Value.Object(result)]);`;\n      } else {\n        return defaultAssignmentSingle;\n      }\n    } else {\n      // Default: returnNull\n      // But for FIRST hit policy with passThrough, signal to use accumulated context\n      if (passThrough && hitPolicy === 'first') {\n        return returnPassthroughSignal;\n      }\n      return returnNull;\n    }\n  }\n\n  // Generate the final return statement based on hit policy\n  // COLLECT-style policies return arrays directly (not wrapped in object)\n  // The node name keying is handled by codegen.ts when storing in context\n  let finalReturn: string;\n  if (hitPolicy === 'collect' || hitPolicy === 'ruleOrder') {\n    // For collect policies no-match handling\n    if (noMatchBehavior.type === 'throwError') {\n      finalReturn = `\n  if (results.length == 0) {\n${generateNoMatchHandler()}\n  }\n  return Value.Array(results);`;\n    } else if (noMatchBehavior.type === 'returnDefault') {\n      finalReturn = `\n  if (results.length == 0) {\n${generateNoMatchHandler()}\n  }\n  return Value.Array(results);`;\n    } else {\n      finalReturn = `return Value.Array(results);`;\n    }\n  } else if (hitPolicy === 'unique') {\n    finalReturn = `\n  // Validate exactly one match\n  if (results.length == 1) {\n    return results[0];\n  } else if (results.length == 0) {\n    ${generateNoMatchHandler()}\n  } else {\n    // Multiple matches - this violates UNIQUE constraint\n    SetLastErrorWithMessage(RuntimeErrorCode.EVALUATION_ERROR, \"Decision table \\\\\"${node.name}\\\\\" (id: ${node.id}): Multiple rules matched but UNIQUE hit policy requires exactly one match\");\n    return Value.Null();\n  }`;\n  } else if (hitPolicy === 'outputOrder' || hitPolicy === 'priority') {\n    if (outputs.length === 0) {\n      throw new Error(`${hitPolicy.toUpperCase()} hit policy requires at least one output field`);\n    }\n\n    const primaryOutput = outputs[0];\n    finalReturn = `\n  // Sort by output value (descending priority), with rule order as tie-breaker\n  results.sort((a: Value, b: Value): i32 => {\n    let aOutput = a.asObject().get(\"${primaryOutput.field}\");\n    let bOutput = b.asObject().get(\"${primaryOutput.field}\");\n\n    // Compare the primary output values\n    let cmp = compareValues(aOutput, bOutput);\n\n    // If outputs are equal, maintain rule order (lower index = higher priority)\n    if (cmp == 0) {\n      return 1; // already in rule order, so keep it\n    }\n\n    // Return results in descending order of output priority\n    // Higher output values come first\n    return cmp < 0 ? 1 : -1;\n  });\n\n  if (results.length == 0) {\n${generateNoMatchHandler()}\n  }\n\n  ${\n    hitPolicy === 'priority'\n      ? '// Return only the highest-priority result\\n  return results[0];'\n      : 'return Value.Array(results);'\n  }`;\n  } else {\n    // Default case - FIRST hit policy\n    finalReturn = `\\n  else {\\n    ${generateNoMatchHandler()}\\n  }`;\n  }\n\n  const sanitizedId = sanitizeId(node.id);\n\n  // Build the raw function body\n  const rawFunctionBody = `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  ${resultDeclaration}\n\n${ruleBranches}\n${finalReturn}\n}\n`;\n\n  // For large decision tables, hoist repeated string literals to module-level constants\n  // This prevents memory exhaustion from repeated Value.String() allocations\n  if (rules.length > 100) {\n    const { constants, code: optimizedBody } = hoistStringLiterals(rawFunctionBody, node.id);\n    if (constants) {\n      return `// Hoisted string constants for decision table \"${node.name}\" (${rules.length} rules)\n${constants}\n\n${optimizedBody}`;\n    }\n  }\n\n  return rawFunctionBody;\n}\n","/**\n * Code generation helpers for shared AssemblyScript code patterns.\n *\n * These helpers generate AssemblyScript code strings that can be used across\n * different compiler modules to avoid duplication.\n */\n\nimport { sanitizeId } from './utils';\n\n/**\n * Generate AssemblyScript code to assign a value to a nested path in the context.\n *\n * This handles dotted paths like \"cart.items.total\" by navigating/creating the\n * necessary object hierarchy in the context. The algorithm:\n * 1. Splits the path by \".\"\n * 2. Gets or creates the root object from context\n * 3. Navigates/creates intermediate objects for each part\n * 4. Sets the final value at the leaf\n *\n * @param path - The dotted path string (e.g., \"cart.items.total\")\n * @param valueExpr - The AssemblyScript expression for the value to assign\n * @param prefix - Optional prefix for generated variable names to avoid collisions (default: \"__np\")\n * @returns AssemblyScript code string that performs the nested assignment\n */\nexport function generateNestedPathAssignment(\n  path: string,\n  valueExpr: string,\n  prefix: string = '__np',\n): string {\n  return `// Store value at nested path: ${path}\n{\n  const ${prefix}_value = ${valueExpr};\n  const ${prefix}_parts = \"${path}\".split(\".\");\n  const ${prefix}_rootKey = ${prefix}_parts[0];\n  // Get or create the root object\n  let ${prefix}_rootObj: Map<string, Value>;\n  if (ctx.data.has(${prefix}_rootKey) && ctx.data.get(${prefix}_rootKey).isObject()) {\n    ${prefix}_rootObj = ctx.data.get(${prefix}_rootKey).asObject();\n  } else {\n    ${prefix}_rootObj = new Map<string, Value>();\n    ctx.set(${prefix}_rootKey, Value.Object(${prefix}_rootObj));\n  }\n  // Navigate/create nested objects for intermediate parts\n  let ${prefix}_current = ${prefix}_rootObj;\n  for (let ${prefix}_j = 1; ${prefix}_j < ${prefix}_parts.length - 1; ${prefix}_j++) {\n    const ${prefix}_part = ${prefix}_parts[${prefix}_j];\n    if (${prefix}_current.has(${prefix}_part) && ${prefix}_current.get(${prefix}_part).isObject()) {\n      ${prefix}_current = ${prefix}_current.get(${prefix}_part).asObject();\n    } else {\n      const ${prefix}_newObj = new Map<string, Value>();\n      ${prefix}_current.set(${prefix}_part, Value.Object(${prefix}_newObj));\n      ${prefix}_current = ${prefix}_newObj;\n    }\n  }\n  // Set the final value at the leaf of the path\n  ${prefix}_current.set(${prefix}_parts[${prefix}_parts.length - 1], ${prefix}_value);\n}`;\n}\n\n/**\n * Generate AssemblyScript code to build a final result from accumulated context.\n *\n * This extracts all user-facing keys from the context (excluding internal namespaces)\n * and builds a Map suitable for returning as a Value.Object result.\n *\n * The generated code:\n * 1. Creates a new Map for the result\n * 2. Iterates over all keys in ctx.data\n * 3. Filters out internal keys ($*, #, acc)\n * 4. Copies remaining keys to the result map\n *\n * @param resultVarName - The name of the variable to store the result in\n * @param prefix - Optional prefix for loop variables to avoid collisions (default: \"__bfr\")\n * @returns AssemblyScript code string that builds the result map\n */\nexport function generateBuildFinalResultCode(\n  resultVarName: string,\n  prefix: string = '__bfr',\n): string {\n  return `// Build final result from accumulated context\nlet ${resultVarName} = new Map<string, Value>();\nconst ${prefix}_keys = ctx.data.keys();\nfor (let ${prefix}_i = 0; ${prefix}_i < ${prefix}_keys.length; ${prefix}_i++) {\n  const ${prefix}_key = ${prefix}_keys[${prefix}_i];\n  // $nodes/$ are internal namespaces\n  // # is iteration variable,\n  // acc is accumulator\n  // None should appear in final output, only actual output field names\n  if (!${prefix}_key.startsWith(\"$\") && ${prefix}_key !== \"#\" && ${prefix}_key !== \"acc\") {\n    ${resultVarName}.set(${prefix}_key, ctx.data.get(${prefix}_key));\n  }\n}`;\n}\n\n/**\n * Generate AssemblyScript code to evaluate a single node and handle its outputPath and passThrough settings.\n *\n * This is the standard node evaluation pattern used across the codebase. It:\n * 1. Calls the node's evaluateNode function\n * 2. Stores the result in $nodes.<nodeName>\n * 3. Handles outputPath if specified (storing result at the given path)\n * 4. Handles passThrough merge if the node is configured for it\n *\n * @param nodeId - The raw node ID\n * @param nodeName - The name of the node (for context storage)\n * @param node - The JDM node definition (optional, for outputPath/passThrough handling)\n * @returns AssemblyScript code string that evaluates the node\n */\nexport function generateNodeEvaluationCode(\n  nodeId: string,\n  nodeName: string,\n  node?: {\n    type?: string;\n    content?: { outputPath?: string; passThrough?: boolean; outputs?: Array<{ field?: string }> };\n  },\n): string {\n  const sanitizedId = sanitizeId(nodeId);\n  const statements: string[] = [];\n\n  // Call the node's evaluateNode function and store result\n  statements.push(`ctx.set(\"$nodes.${nodeName}\", evaluateNode_${sanitizedId}(ctx));`);\n\n  if (!node) {\n    return statements.join('\\n    ');\n  }\n\n  const outputPath = node.content?.outputPath;\n  if (outputPath) {\n    if (!outputPath.includes('.')) {\n      statements.push(`ctx.set(\"${outputPath}\", ctx.get(\"$nodes.${nodeName}\"));`);\n    } else {\n      statements.push(generateNestedPathAssignment(outputPath, `ctx.get(\"$nodes.${nodeName}\")`));\n    }\n  }\n\n  // Determine if we should merge node results into context\n  // Expression nodes compute values meant for the output, so their results should flow\n  // through to the final result regardless of passThrough setting. Decision tables with\n  // dotted output fields (e.g., \"flag.turnover\") similarly need merging to build nested\n  // output structures.\n  const hasOutputFields =\n    node.type === 'decisionTableNode' &&\n    node.content?.outputs?.some((o: { field?: string }) => o.field && o.field.includes('.'));\n  const shouldMerge =\n    node.type === 'expressionNode' || node.content?.passThrough === true || hasOutputFields;\n\n  if (shouldMerge) {\n    statements.push(generatePassThroughMergeCode(nodeName));\n  }\n\n  return statements.join('\\n    ');\n}\n\n/**\n * Generate AssemblyScript code to merge passThrough node results into the context.\n *\n * This handles both simple keys (e.g., \"status\") and nested paths (e.g., \"evaluation.score\").\n * For nested paths, it navigates/creates the necessary object hierarchy in the context.\n *\n * The generated code:\n * 1. Gets the node result from `$nodes.<nodeName>`\n * 2. Iterates over all keys in the result\n * 3. For simple keys, sets them directly in the context\n * 4. For nested paths, navigates/creates intermediate objects and sets the leaf value\n *\n * @param nodeName - The name of the node whose results should be merged\n * @returns AssemblyScript code string that performs the merge\n */\nexport function generatePassThroughMergeCode(nodeName: string): string {\n  // Generate the nested path assignment code for use inside the loop\n  // We use a special prefix \"__pt\" to avoid collisions with other generated code\n  const nestedPathCode = `const __pt_parts = __key.split(\".\");\n        const __pt_rootKey = __pt_parts[0];\n        let __pt_rootObj: Map<string, Value>;\n        if (ctx.data.has(__pt_rootKey) && ctx.data.get(__pt_rootKey).isObject()) {\n          __pt_rootObj = ctx.data.get(__pt_rootKey).asObject();\n        } else {\n          __pt_rootObj = new Map<string, Value>();\n          ctx.set(__pt_rootKey, Value.Object(__pt_rootObj));\n        }\n        let __pt_current = __pt_rootObj;\n        for (let __pt_j = 1; __pt_j < __pt_parts.length - 1; __pt_j++) {\n          const __pt_part = __pt_parts[__pt_j];\n          if (__pt_current.has(__pt_part) && __pt_current.get(__pt_part).isObject()) {\n            __pt_current = __pt_current.get(__pt_part).asObject();\n          } else {\n            const __pt_newObj = new Map<string, Value>();\n            __pt_current.set(__pt_part, Value.Object(__pt_newObj));\n            __pt_current = __pt_newObj;\n          }\n        }\n        __pt_current.set(__pt_parts[__pt_parts.length - 1], __value);`;\n\n  return `// Merge passThrough results for ${nodeName}\n{\n  const __nodeResult = ctx.get(\"$nodes.${nodeName}\");\n  if (__nodeResult.isObject()) {\n    const __resultMap = __nodeResult.asObject();\n    const __keys = __resultMap.keys();\n    for (let __i = 0; __i < __keys.length; __i++) {\n      const __key = __keys[__i];\n      const __value = __resultMap.get(__key);\n      if (__key.includes(\".\")) {\n        ${nestedPathCode}\n      } else {\n        ctx.set(__key, __value);\n      }\n    }\n  }\n}`;\n}\n","import type { JDMNode } from '../parser';\nimport type { CompilationContext, AssemblyScriptCode, NoMatchBehavior } from '../types';\nimport { compileExpression } from './expression';\nimport { sanitizeId } from '../utils';\nimport { generateNodeEvaluationCode, generateBuildFinalResultCode } from '../code-generators';\n\n/**\n * Switch statement definition (from JDM format).\n */\ninterface SwitchStatement {\n  id: string;\n  condition: string; // Empty string means default case\n}\n\n/**\n * Switch node content structure (from JDM format).\n */\ninterface JDMNodeContent {\n  statements: SwitchStatement[];\n  hitPolicy?: 'first' | 'collect' | 'unique' | 'ruleOrder' | 'outputOrder' | 'priority';\n  /** Override the global no-match behavior for this switch */\n  noMatchBehavior?: NoMatchBehavior;\n}\n\n/**\n * Internal switch condition definition.\n */\ninterface SwitchCondition {\n  id: string;\n  expression: string;\n  nodes: string[];\n  isDefault: boolean;\n}\n\n/**\n * Get all nodes reachable from a starting node via BFS, stopping at switch nodes.\n *\n * Each switch evaluates its own branches independently. If we traversed into nested\n * switches, we'd incorrectly include nodes that should be conditionally evaluated by\n * the nested switch, not unconditionally evaluated by the parent branch.\n */\nfunction getBranchNodes(startNodeId: string, context: CompilationContext): string[] {\n  const nodeMap = new Map(context.jdm.nodes.map((n) => [n.id, n]));\n  const visited = new Set<string>();\n  const result: string[] = [];\n  const queue = [startNodeId];\n\n  while (queue.length > 0) {\n    const currentId = queue.shift()!;\n    if (visited.has(currentId)) {\n      continue;\n    }\n    visited.add(currentId);\n    result.push(currentId);\n\n    // Get the current node\n    const currentNode = nodeMap.get(currentId);\n\n    // If node not found in context, just include it and stop traversal\n    // (this handles test mocks that don't define all nodes)\n    if (!currentNode) {\n      continue;\n    }\n\n    // If this is a switch node, don't traverse its outgoing edges\n    // The switch will handle its own branches when it's evaluated\n    if (currentNode.type === 'switchNode') {\n      continue;\n    }\n\n    // Find outgoing edges from this node\n    const outgoingEdges = context.jdm.edges.filter((e) => e.sourceId === currentId);\n    for (const edge of outgoingEdges) {\n      queue.push(edge.targetId);\n    }\n  }\n\n  return result;\n}\n\n/**\n * Generate inline code to evaluate an entire branch (all nodes in sequence).\n * Returns the statements and a final result expression.\n *\n * Uses shared node evaluation infrastructure (generateNodeEvaluationCode) to ensure\n * consistent handling of outputPath and passThrough across the codebase.\n */\nfunction generateBranchEvaluation(\n  branchNodeIds: string[],\n  context: CompilationContext,\n): { statements: string; resultExpr: string } {\n  const nodeMap = new Map(context.jdm.nodes.map((n) => [n.id, n]));\n\n  if (branchNodeIds.length === 0) {\n    return { statements: '', resultExpr: 'Value.Null()' };\n  }\n\n  // Generate evaluation code for each node using shared helper\n  const evalStatements = branchNodeIds.map((nodeId) => {\n    const node = nodeMap.get(nodeId);\n    const nodeName = node?.name || sanitizeId(nodeId);\n    return generateNodeEvaluationCode(nodeId, nodeName, node);\n  });\n\n  // Determine result expression based on the last node's type\n  const lastNodeId = branchNodeIds[branchNodeIds.length - 1];\n  const lastNode = nodeMap.get(lastNodeId);\n  const lastNodeName = lastNode?.name || sanitizeId(lastNodeId);\n\n  // For output nodes or nodes with passThrough, build result from accumulated context\n  const shouldUseAccumulatedContext =\n    lastNode?.type === 'outputNode' || lastNode?.content?.passThrough === true;\n\n  if (shouldUseAccumulatedContext) {\n    // Use shared helper to build final result from context\n    evalStatements.push(generateBuildFinalResultCode('__branchFinalResult', '__branch'));\n    return {\n      statements: evalStatements.join('\\n    '),\n      resultExpr: 'Value.Object(__branchFinalResult)',\n    };\n  }\n\n  return {\n    statements: evalStatements.join('\\n    '),\n    resultExpr: `ctx.get(\"$nodes.${lastNodeName}\")`,\n  };\n}\n\n/**\n * Compile a switch node.\n *\n * Generates conditional chains (switch-like logic) for evaluating multiple\n * conditions and routing to the appropriate target nodes.\n *\n * Supports:\n * - FIRST hit policy: Returns the first matching condition's result\n * - COLLECT hit policy: Aggregates all matching conditions' results\n * - RULE ORDER hit policy: Returns all matching conditions' results in order\n * - UNIQUE hit policy: Returns result if exactly one condition matches\n * - OUTPUT ORDER hit policy: Returns all matching conditions' results sorted by value\n * - PRIORITY hit policy: Returns only the highest-priority matching condition's result\n *\n * Default Cases:\n * - A statement with an empty condition string acts as the default case\n * - When no conditions match, the default case is evaluated (if provided)\n * - Default case has access to the full input context\n * - If no default case is provided, the configured no-match behavior applies\n *\n * @param node - The JDM switch node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileSwitchNode(node: JDMNode, context: CompilationContext): AssemblyScriptCode {\n  const jdmContent = node.content as JDMNodeContent;\n  const {\n    statements,\n    hitPolicy: jdmHitPolicy,\n    noMatchBehavior: switchNoMatchBehavior,\n  } = jdmContent;\n\n  const hitPolicy = jdmHitPolicy ?? 'first';\n\n  // Determine the effective no-match behavior (node-level overrides global)\n  const noMatchBehavior = switchNoMatchBehavior ??\n    context.options.noMatchBehavior ?? { type: 'returnNull' };\n\n  // RULE ORDER, COLLECT, OUTPUT ORDER, and PRIORITY all use array collection mode\n  const isCollectMode =\n    hitPolicy === 'collect' ||\n    hitPolicy === 'ruleOrder' ||\n    hitPolicy === 'outputOrder' ||\n    hitPolicy === 'priority';\n\n  const nodeMap = new Map(context.jdm.nodes.map((n) => [n.id, n]));\n\n  // In collect mode, if all branches terminate at output nodes, we can merge their results into\n  // a single object instead of returning an array. This allows collect-mode switches to build\n  // structured outputs progressively, avoiding unnecessary nesting.\n  function checkAllBranchesTerminateAtOutput(): boolean {\n    if (!isCollectMode) {\n      return false;\n    }\n\n    for (const statement of statements) {\n      if (statement.condition === '' || statement.condition.trim() === '') {\n        continue;\n      } // Skip default\n\n      // Find target edge for this statement\n      const edge = context.jdm.edges.find(\n        (e) => e.sourceId === node.id && e.sourceHandle === statement.id,\n      );\n      if (!edge) {\n        continue;\n      }\n\n      // Get the terminal node(s) for this branch\n      const branchNodes = getBranchNodes(edge.targetId, context);\n      if (branchNodes.length === 0) {\n        return false;\n      }\n\n      const lastNodeId = branchNodes[branchNodes.length - 1];\n      const lastNode = nodeMap.get(lastNodeId);\n      if (!lastNode || lastNode.type !== 'outputNode') {\n        return false;\n      }\n    }\n\n    // Also check default case if exists\n    const defaultStatement = statements.find(\n      (s) => s.condition === '' || s.condition.trim() === '',\n    );\n    if (defaultStatement) {\n      const edge = context.jdm.edges.find(\n        (e) => e.sourceId === node.id && e.sourceHandle === defaultStatement.id,\n      );\n      if (edge) {\n        const branchNodes = getBranchNodes(edge.targetId, context);\n        if (branchNodes.length > 0) {\n          const lastNodeId = branchNodes[branchNodes.length - 1];\n          const lastNode = nodeMap.get(lastNodeId);\n          if (!lastNode || lastNode.type !== 'outputNode') {\n            return false;\n          }\n        }\n      }\n    }\n\n    return true;\n  }\n\n  const shouldMergeCollectResults = checkAllBranchesTerminateAtOutput();\n\n  // Transform JDM statements to internal conditions format\n  const conditions: SwitchCondition[] = statements.map((statement) => {\n    // Find target nodes for this statement by looking for edges with this statement as sourceHandle\n    const edges = context.jdm.edges.filter(\n      (edge) => edge.sourceId === node.id && edge.sourceHandle === statement.id,\n    );\n    const targetNodeIds = edges.map((edge) => sanitizeId(edge.targetId));\n\n    return {\n      id: statement.id,\n      expression: statement.condition,\n      nodes: targetNodeIds,\n      // In collect mode, all matching conditions execute (empty = always match).\n      // In first mode, execution stops at first match, so empty condition acts as fallback \"default\" case.\n      isDefault:\n        !isCollectMode && (statement.condition === '' || statement.condition.trim() === ''),\n    };\n  });\n\n  // Separate regular conditions from default case\n  // In collect mode, there are no defaults - empty conditions are just \"always true\"\n  const regularConditions = conditions.filter((c) => !c.isDefault);\n  const defaultCase = isCollectMode ? undefined : conditions.find((c) => c.isDefault);\n\n  // Generate the result declaration based on hit policy\n  const resultDeclaration = isCollectMode ? 'let results = new Array<Value>();' : '';\n\n  // Generate the no-match handler based on the effective behavior\n  function generateNoMatchHandler(): string {\n    if (noMatchBehavior.type === 'throwError') {\n      return `SetLastErrorWithMessage(RuntimeErrorCode.EVALUATION_ERROR, \"Switch node \\\\\"${node.name}\\\\\" (id: ${node.id}): No matching condition found\");\\n  return Value.Null();`;\n    } else if (noMatchBehavior.type === 'returnDefault') {\n      // Generate the default value as a Value\n      const defaultValue = noMatchBehavior.value;\n      let defaultValueCode: string;\n      switch (typeof defaultValue) {\n        case 'string':\n          defaultValueCode = `Value.String(\"${String(defaultValue).replace(/\"/g, '\\\\\"')}\")`;\n          break;\n        case 'number':\n          defaultValueCode = `Value.Float(${defaultValue})`;\n          break;\n        case 'boolean':\n          defaultValueCode = `Value.Bool(${defaultValue})`;\n          break;\n        default:\n          defaultValueCode = `Value.String(\"${String(defaultValue)}\")`;\n      }\n\n      return isCollectMode\n        ? `return Value.Array([${defaultValueCode}]);`\n        : `return ${defaultValueCode};`;\n    } else {\n      // Default: returnNull\n      return 'return Value.Null();';\n    }\n  }\n\n  // Helper function to generate code that evaluates the default case (entire branch)\n  function generateDefaultCaseEvaluation(): string {\n    if (!defaultCase) {\n      return generateNoMatchHandler();\n    }\n\n    // Get the first node ID for the default case\n    // If no target node is connected to the default case, use no-match behavior\n    if (!defaultCase.nodes || defaultCase.nodes.length === 0) {\n      // Default case exists but has no target - treat as no-match\n      return generateNoMatchHandler();\n    }\n\n    // Get all nodes in this branch (from target to end)\n    const branchStartId = defaultCase.nodes[0]; // Use raw ID, not sanitized\n    // Find the raw ID from the edge\n    const defaultEdge = context.jdm.edges.find(\n      (e) => e.sourceId === node.id && e.sourceHandle === defaultCase.id,\n    );\n    const rawTargetId = defaultEdge?.targetId || branchStartId;\n    const branchNodeIds = getBranchNodes(rawTargetId, context);\n\n    // Generate code to evaluate the entire branch\n    const { statements, resultExpr } = generateBranchEvaluation(branchNodeIds, context);\n\n    if (isCollectMode) {\n      return `    ${statements}\\n    results.push(${resultExpr});`;\n    } else {\n      return `    ${statements}\\n    return ${resultExpr};`;\n    }\n  }\n\n  // Generate the conditional branches for each condition (excluding default)\n  let conditionBranches: string;\n  let finalReturn: string;\n\n  // Helper to get branch nodes for a condition\n  function getBranchNodesForCondition(condition: SwitchCondition): string[] {\n    if (!condition.nodes || condition.nodes.length === 0) {\n      return [];\n    }\n\n    // Find the edge for this condition to get the raw target ID\n    const edge = context.jdm.edges.find(\n      (e) => e.sourceId === node.id && e.sourceHandle === condition.id,\n    );\n    const rawTargetId = edge?.targetId || condition.nodes[0];\n    return getBranchNodes(rawTargetId, context);\n  }\n\n  // Handle the case where there are no regular conditions but there is a default case\n  if (regularConditions.length === 0) {\n    conditionBranches = '';\n    if (defaultCase && defaultCase.nodes && defaultCase.nodes.length > 0) {\n      // Only default case exists with a target - evaluate the entire branch\n      const branchNodeIds = getBranchNodesForCondition(defaultCase);\n      const { statements, resultExpr } = generateBranchEvaluation(branchNodeIds, context);\n\n      if (isCollectMode) {\n        finalReturn = `\n  ${statements}\n  results.push(${resultExpr});\n  return Value.Array(results);`;\n      } else {\n        finalReturn = `\n  ${statements}\n  return ${resultExpr};`;\n      }\n    } else {\n      // No conditions and no default case (or default with no target) - use no-match behavior\n      finalReturn = `\\n  ${generateNoMatchHandler()}`;\n    }\n  } else {\n    // Generate the conditional branches for each condition (excluding default)\n    conditionBranches = regularConditions\n      .map((condition, idx) => {\n        // Parse and compile the condition expression\n        let compiledExpr: string;\n        // Empty condition means \"always true\" (especially in collect mode)\n        if (condition.expression === '' || condition.expression.trim() === '') {\n          compiledExpr = 'true';\n        } else {\n          try {\n            const ast = context.parseExpression(condition.expression);\n            // Get the conditional value (expects a boolean result)\n            const exprCode = compileExpression(ast, context);\n            compiledExpr = `${exprCode}.asBool()`;\n          } catch {\n            // If parsing fails, provide a comment indicating the issue\n            // Can fail if expression syntax is invalid (checked at compile time)\n            compiledExpr = '/* ERROR: Could not parse expression */ false';\n          }\n        }\n\n        // Get all nodes in this branch (from target to end)\n        const branchNodeIds = getBranchNodesForCondition(condition);\n        const { statements, resultExpr } = generateBranchEvaluation(branchNodeIds, context);\n\n        // Generate the conditional branch\n        if (isCollectMode) {\n          // For collect-mode hit policies, evaluate all conditions independently\n          if (shouldMergeCollectResults) {\n            // When all branches terminate at output nodes, just evaluate (don't collect)\n            // The context accumulates all results which get merged at the end\n            const branchCode = `\\n  if (${compiledExpr}) {\n    ${statements}\n  }`;\n            return branchCode;\n          }\n          const branchCode = `\\n  if (${compiledExpr}) {\n    ${statements}\n    results.push(${resultExpr});\n  }`;\n          return branchCode;\n        } else {\n          // For FIRST hit policy, use if/else if chain (short-circuit on first match)\n          const prefix = idx === 0 ? '\\n  if' : '\\n  else if';\n          const branchCode = `${prefix} (${compiledExpr}) {\n    ${statements}\n    return ${resultExpr};\n  }`;\n          return branchCode;\n        }\n      })\n      .join('');\n\n    if (isCollectMode) {\n      // For OUTPUT ORDER and PRIORITY, sort the results by value (descending)\n      if (hitPolicy === 'outputOrder' || hitPolicy === 'priority') {\n        if (\n          defaultCase ||\n          noMatchBehavior.type === 'throwError' ||\n          noMatchBehavior.type === 'returnDefault'\n        ) {\n          finalReturn = `\n  // Sort by value (descending priority), with rule order as tie-breaker\n  // compareValues returns: -1 if a < b, 0 if equal, 1 if a > b\n  // For descending order (higher priority first): return inverted comparison\n  // Tie-breaker: when equal, return 1 to maintain original rule order (stable sort)\n  results.sort((a: Value, b: Value): i32 => {\n    let cmp = compareValues(a, b);\n    if (cmp == 0) {\n      return 1;\n    }\n    return cmp < 0 ? 1 : -1;\n  });\n\n  if (results.length == 0) {\n${generateDefaultCaseEvaluation()}\n  }\n\n  ${hitPolicy === 'priority' ? 'return results[0];' : 'return Value.Array(results);'}`;\n        } else {\n          finalReturn = `\n  // Sort by value (descending priority), with rule order as tie-breaker\n  // compareValues returns: -1 if a < b, 0 if equal, 1 if a > b\n  // For descending order (higher priority first): return inverted comparison\n  // Tie-breaker: when equal, return 1 to maintain original rule order (stable sort)\n  results.sort((a: Value, b: Value): i32 => {\n    let cmp = compareValues(a, b);\n    if (cmp == 0) {\n      return 1;\n    }\n    return cmp < 0 ? 1 : -1;\n  });\n\n  ${\n    hitPolicy === 'priority'\n      ? 'return results.length > 0 ? results[0] : Value.Null();'\n      : 'return Value.Array(results);'\n  }`;\n        }\n      } else {\n        // Collect or rule order without sorting\n        if (shouldMergeCollectResults) {\n          // When merging results, return the accumulated context (excluding input keys)\n          // First check if any branch was evaluated, if not run default\n          if (defaultCase) {\n            finalReturn = `\n  // Build merged result from accumulated context (excluding input keys)\n  // Runtime variables: $=context root, #=current array element, acc=reduce accumulator\n  let __mergedResult = new Map<string, Value>();\n  const __mergedCtxKeys = ctx.data.keys();\n  for (let __mergedI = 0; __mergedI < __mergedCtxKeys.length; __mergedI++) {\n    const __mergedKey = __mergedCtxKeys[__mergedI];\n    // Skip internal entries, special variables, and input keys\n    if (!__mergedKey.startsWith(\"$\") && __mergedKey !== \"#\" && __mergedKey !== \"acc\" && !ctx.inputKeys.has(__mergedKey)) {\n      __mergedResult.set(__mergedKey, ctx.data.get(__mergedKey));\n    }\n  }\n  // If no output was produced, run default case\n  if (__mergedResult.size == 0) {\n${generateDefaultCaseEvaluation()}\n    // Rebuild result after default case\n    __mergedResult = new Map<string, Value>();\n    const __afterDefaultKeys = ctx.data.keys();\n    for (let __afterI = 0; __afterI < __afterDefaultKeys.length; __afterI++) {\n      const __afterKey = __afterDefaultKeys[__afterI];\n      if (!__afterKey.startsWith(\"$\") && __afterKey !== \"#\" && __afterKey !== \"acc\" && !ctx.inputKeys.has(__afterKey)) {\n        __mergedResult.set(__afterKey, ctx.data.get(__afterKey));\n      }\n    }\n  }\n  return Value.Object(__mergedResult);`;\n          } else {\n            finalReturn = `\n  // Build merged result from accumulated context (excluding input keys)\n  // Runtime variables: $=context root, #=current array element, acc=reduce accumulator\n  let __mergedResult = new Map<string, Value>();\n  const __mergedCtxKeys = ctx.data.keys();\n  for (let __mergedI = 0; __mergedI < __mergedCtxKeys.length; __mergedI++) {\n    const __mergedKey = __mergedCtxKeys[__mergedI];\n    // Skip internal entries, special variables, and input keys\n    if (!__mergedKey.startsWith(\"$\") && __mergedKey !== \"#\" && __mergedKey !== \"acc\" && !ctx.inputKeys.has(__mergedKey)) {\n      __mergedResult.set(__mergedKey, ctx.data.get(__mergedKey));\n    }\n  }\n  return Value.Object(__mergedResult);`;\n          }\n        } else if (\n          defaultCase ||\n          noMatchBehavior.type === 'throwError' ||\n          noMatchBehavior.type === 'returnDefault'\n        ) {\n          finalReturn = `\n  if (results.length == 0) {\n${generateDefaultCaseEvaluation()}\n  }\n  return Value.Array(results);`;\n        } else {\n          finalReturn = '\\n  return Value.Array(results);';\n        }\n      }\n    } else {\n      // Non-collect mode (FIRST, PRIORITY)\n      if (defaultCase) {\n        // Use else block to evaluate default case\n        // Last branch already has closing brace, so just add else block\n        finalReturn = `\\n  else {\\n    // Default case - no conditions matched\\n${generateDefaultCaseEvaluation()}\\n  }`;\n      } else {\n        // Use else block for no-match handling\n        finalReturn = `\\n  else {\\n    ${generateNoMatchHandler()}\\n  }`;\n      }\n    }\n  }\n\n  const sanitizedId = sanitizeId(node.id);\n  return `\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  ${resultDeclaration}\n\n  ${conditionBranches}${finalReturn}\n}\n`;\n}\n","import type { JDMNode, JDMDecision } from '../parser';\nimport type { CompilationContext, AssemblyScriptCode } from '../types';\nimport { sanitizeId } from '../utils';\nimport { compileDecisionTableNode } from './decision-table';\nimport { compileSwitchNode } from './switch';\nimport { compileInputNode } from './input';\nimport { compileExpressionNode } from './expression';\nimport { compileFunctionNode } from './function';\nimport { buildGraph, getEvaluationOrder } from '../graph';\n\n/**\n * Generate a unique prefix for sub-decision node IDs to avoid naming conflicts.\n */\nfunction decisionNodePrefix(nodeId: string): string {\n  return `sub_${sanitizeId(nodeId)}_`;\n}\n\n/**\n * Generate the sub-decision entry point function that contains the actual evaluation logic.\n */\nfunction generateSubDecisionEntryPoint(\n  node: JDMNode,\n  context: CompilationContext,\n  subDecision: JDMDecision,\n  prefix: string,\n): AssemblyScriptCode {\n  const sanitizedId = sanitizeId(node.id);\n\n  // Build the sub-decision graph and get evaluation order\n  const graph = buildGraph(subDecision);\n  // Catches circular sub-decision references at compile time for better error messages and\n  // fail-fast behavior, rather than discovering cycles at runtime with stack overflow.\n  const evaluationOrder = getEvaluationOrder(graph);\n\n  // Create a node lookup for quick access\n  const nodeMap = new Map(subDecision.nodes.map((n) => [n.id, n]));\n\n  // Generate evaluation code for each node in topological order\n  // Skip output nodes - they mark graph termination but don't perform computation\n  // Skip input nodes (input just passes context through)\n  const evaluationCode = evaluationOrder\n    .map((nodeId) => {\n      const subNode = nodeMap.get(nodeId);\n      if (!subNode || subNode.type === 'outputNode' || subNode.type === 'inputNode') {\n        return '';\n      }\n      const prefixedId = prefix + sanitizeId(nodeId);\n      // Store node result in context under $nodes.<nodeName>\n      return `  ctx.set(\"$nodes.${subNode.name}\", evaluateNode_${prefixedId}(ctx));`;\n    })\n    .filter(Boolean)\n    .join('\\n');\n\n  // Find the last non-input, non-output node that was evaluated to return its result\n  const evaluatedNodes = evaluationOrder.filter((id) => {\n    const subNode = nodeMap.get(id);\n    if (!subNode) {\n      return false;\n    }\n    return subNode.type !== 'inputNode' && subNode.type !== 'outputNode';\n  });\n\n  // Determine what to return:\n  // - If there are evaluated nodes, return the last one's result\n  // - Otherwise, return an empty object for passthrough graphs\n  let resultCode: string;\n  if (evaluatedNodes.length > 0) {\n    const lastNodeId = evaluatedNodes[evaluatedNodes.length - 1];\n    const lastNode = nodeMap.get(lastNodeId)!;\n    resultCode = `  let result = ctx.get(\"$nodes.${lastNode.name}\");`;\n  } else {\n    // For passthrough graphs (input->output with no intermediate nodes),\n    // return an empty object to indicate \"no transformation\"\n    //\n    // Can't return ctx.toValue: Returning ctx as-is would create circular reference when the\n    // result is merged back into parent context. Empty object signals \"pass through unchanged\".\n    resultCode = `  let result = Value.Object(new Map<string, Value>());`;\n  }\n\n  return `\n// Sub-decision entry point function for ${node.id}\nexport function evaluateSubDecision_${sanitizedId}(ctx: Context): Value {\n  // Evaluate the sub-decision graph\n${evaluationCode}\n\n  // Get the final result\n${resultCode}\n\n  return result;\n}\n`;\n}\n\n/**\n * Generate a wrapper function that handles caching, recursion detection, and delegates to the sub-decision entry point.\n */\nfunction generateDecisionNodeWrapper(\n  node: JDMNode,\n  subDecisionFunctionName: string,\n): AssemblyScriptCode {\n  const sanitizedId = sanitizeId(node.id);\n  const cacheKey = `\"evaluateNode_${sanitizedId}\"`;\n\n  return `\n// Wrapper function to evaluate sub-decision ${node.id}\nexport function evaluateNode_${sanitizedId}(ctx: Context): Value {\n  // Check cache first to avoid redundant evaluation\n  if (ctx.decisionResults.has(${cacheKey})) {\n    return ctx.decisionResults.get(${cacheKey});\n  }\n\n  // Compile-time detection catches static cycles, but runtime detection is needed for dynamic\n  // sub-decision loading or conditional recursion based on input data.\n  if (ctx.decisionStack.includes(\"${sanitizedId}\")) {\n    const recursionPath = ctx.decisionStack.join(' -> ') + ' -> ' + \"${sanitizedId}\";\n    SetLastError(RuntimeErrorCode.EVALUATION_ERROR);\n    return Value.Null();\n  }\n\n  // Add to decision stack before evaluation\n  ctx.decisionStack.push(\"${sanitizedId}\");\n\n  // Evaluate the sub-decision\n  let result = ${subDecisionFunctionName}(ctx);\n\n  // Check for errors from sub-decision evaluation\n  if (hasError()) {\n    // Error occurred in sub-decision - propagate it up\n    // Remove from decision stack\n    const stackIndex = ctx.decisionStack.indexOf(\"${sanitizedId}\");\n    if (stackIndex >= 0) {\n      ctx.decisionStack.splice(stackIndex, 1);\n    }\n    return Value.Null();\n  }\n\n  // Store result in cache\n  ctx.decisionResults.set(${cacheKey}, result);\n\n  // Remove from decision stack after evaluation\n  const stackIndex = ctx.decisionStack.indexOf(\"${sanitizedId}\");\n  if (stackIndex >= 0) {\n    ctx.decisionStack.splice(stackIndex, 1);\n  }\n\n  return result;\n}\n`;\n}\n\n/**\n * Compile a sub-decision node.\n *\n * Sub-decision nodes allow a decision to call another decision as part of its\n * evaluation. This function generates code that:\n * 1. Loads the referenced sub-decision JDM\n * 2. Recursively compiles all nodes in the sub-decision\n * 3. Creates a wrapper function to invoke the sub-decision\n * 4. Returns the code for both the wrapper and the sub-decision logic\n *\n * @param node - The JDM sub-decision node\n * @param context - The compilation context\n * @returns Generated AssemblyScript code for the sub-decision\n */\nexport function compileDecisionNode(\n  node: JDMNode,\n  context: CompilationContext,\n): AssemblyScriptCode {\n  // Check for cycles in the decision graph\n  if (context.decisionPath.includes(node.id)) {\n    throw new Error(\n      `Circular dependency detected in decision graph: ${context.decisionPath.join(' -> ')} -> ${node.id}`,\n    );\n  }\n\n  // Extract the sub-decision reference key from the decision node content\n  const subDecisionKey = node.content?.key;\n  if (!subDecisionKey) {\n    throw new Error(\n      `Decision node ${node.id} has no content.key - cannot determine which decision to call`,\n    );\n  }\n\n  // Check if this sub-decision JDM has already been loaded (caching the parsed JDM)\n  // We don't cache the generated code because each reference needs its own function names\n  // But we can cache the parsed JDM to avoid re-parsing\n  let subDecision: JDMDecision;\n\n  // Add to decision path for cycle detection\n  context.decisionPath.push(node.id);\n\n  try {\n    // Load the sub-decision JDM using the loader\n    subDecision = context.loadDecision(subDecisionKey);\n\n    // Find the input and output nodes in the sub-decision\n    const inputNode = subDecision.nodes.find((n) => n.type === 'inputNode');\n    const outputNodes = subDecision.nodes.filter((n) => n.type === 'outputNode');\n\n    if (!inputNode) {\n      throw new Error(`Sub-decision ${subDecisionKey} has no input node`);\n    }\n\n    if (outputNodes.length === 0) {\n      throw new Error(`Sub-decision ${subDecisionKey} has no output nodes`);\n    }\n\n    // Check if this sub-decision has already been compiled (for caching)\n    const cachedFunctionName = context.compiledSubDecisions.get(subDecisionKey);\n    if (cachedFunctionName) {\n      // Sub-decision was already compiled, just generate a wrapper that calls the cached entry point\n      const wrapperCode = generateDecisionNodeWrapper(node, cachedFunctionName);\n      return wrapperCode;\n    }\n\n    // Add unique prefix to sub-decision node IDs to avoid conflicts\n    const prefix = decisionNodePrefix(node.id);\n    const sanitizedId = sanitizeId(node.id);\n    const subDecisionFunctionName = `evaluateSubDecision_${sanitizedId}`;\n\n    // Cache the entry point function name for reuse\n    context.compiledSubDecisions.set(subDecisionKey, subDecisionFunctionName);\n\n    // Create a modified context for recursive compilation. Sub-decisions need isolated compilation\n    // state (separate decision path, separate compiled cache) to avoid conflicts with parent decision\n    // while sharing global settings.\n    const subContext: CompilationContext = {\n      ...context,\n      decisionPath: [...context.decisionPath],\n    };\n\n    // Compile each node in the sub-decision\n    let subCompiled = '';\n    for (const subNode of subDecision.nodes) {\n      const nodeType = subNode.type;\n\n      // Skip output nodes - they're just markers\n      if (nodeType === 'outputNode') {\n        continue;\n      }\n\n      // Create a prefixed version of the node to avoid ID conflicts\n      const prefixedNode = {\n        ...subNode,\n        id: prefix + subNode.id,\n      };\n\n      // Compile the node based on its type\n      switch (nodeType) {\n        case 'inputNode':\n          subCompiled += compileInputNode(prefixedNode, context);\n          break;\n        case 'decisionTableNode':\n          subCompiled += compileDecisionTableNode(prefixedNode, context);\n          break;\n        case 'switchNode':\n          subCompiled += compileSwitchNode(prefixedNode, context);\n          break;\n        case 'expressionNode':\n          subCompiled += compileExpressionNode(prefixedNode, context);\n          break;\n        case 'functionNode':\n          subCompiled += compileFunctionNode(prefixedNode, context);\n          break;\n        case 'decisionNode':\n          // Recursive sub-decision\n          subCompiled += compileDecisionNode(prefixedNode, subContext);\n          break;\n        default:\n          // Output nodes don't need compilation\n          break;\n      }\n    }\n\n    // Generate the sub-decision entry point function\n    const entryPointCode = generateSubDecisionEntryPoint(node, context, subDecision, prefix);\n\n    // Generate the wrapper function that handles caching, recursion detection, and delegates\n    const wrapperCode = generateDecisionNodeWrapper(node, subDecisionFunctionName);\n\n    const completeCode = wrapperCode + entryPointCode + subCompiled;\n\n    // Return the complete code (wrapper + entry point + sub-decision node functions)\n    return completeCode;\n  } finally {\n    // Remove from decision path (backtracking)\n    const pathIndex = context.decisionPath.indexOf(node.id);\n    if (pathIndex !== -1) {\n      context.decisionPath.splice(pathIndex, 1);\n    }\n  }\n}\n","/**\n * Compile-time validation for decision models.\n *\n * This module provides functions to perform static analysis of JDM structure\n * and references at compile time. These checks detect missing references,\n * undeclared identifiers, and unassigned outputs before code generation.\n *\n * These functions operate on ASTs and CompilationContext - they do NOT\n * execute at runtime. For runtime data validation, see runtime-validation-codegen.ts.\n */\n\nimport type { ExpressionAST, Identifier } from './ast-types';\nimport { CompilationError, ErrorCode, ErrorCollector, type SourceLocation } from './errors';\nimport type { CompilationContext } from './types';\n\n/**\n * Collect all identifier references from an expression AST.\n *\n * This function walks the AST and collects all variable/field references\n * that need to be resolved from the context. It handles:\n * - Simple identifiers: `age`, `name`\n * - Member access: `customer.age`, `order.items[0].price`\n *\n * @param ast - The expression AST to analyze\n * @returns Set of all identifier names referenced in the expression\n */\nexport function collectIdentifiers(ast: ExpressionAST): Set<string> {\n  const identifiers = new Set<string>();\n  collectIdentifiersRecursive(ast, identifiers);\n  return identifiers;\n}\n\n/**\n * Recursively collect identifiers from an AST node.\n */\nfunction collectIdentifiersRecursive(ast: ExpressionAST, identifiers: Set<string>): void {\n  switch (ast.type) {\n    case 'Identifier': {\n      const ident = ast as Identifier;\n      identifiers.add(ident.name);\n      break;\n    }\n\n    case 'MemberAccess':\n      // For member access like `customer.age`, we need to track the base object `customer`\n      collectIdentifiersRecursive((ast as any).object, identifiers);\n      // The property name is a literal, not an identifier\n      break;\n\n    case 'IndexAccess':\n      // For index access like `items[0]`, we need the base object\n      collectIdentifiersRecursive((ast as any).object, identifiers);\n      // The index is an expression that may contain identifiers\n      collectIdentifiersRecursive((ast as any).index, identifiers);\n      break;\n\n    case 'BinaryOp':\n      collectIdentifiersRecursive((ast as any).left, identifiers);\n      collectIdentifiersRecursive((ast as any).right, identifiers);\n      break;\n\n    case 'UnaryOp':\n      collectIdentifiersRecursive((ast as any).operand, identifiers);\n      break;\n\n    case 'TernaryOp':\n      collectIdentifiersRecursive((ast as any).condition, identifiers);\n      collectIdentifiersRecursive((ast as any).consequent, identifiers);\n      collectIdentifiersRecursive((ast as any).alternate, identifiers);\n      break;\n\n    case 'FunctionCall':\n      collectIdentifiersRecursive((ast as any).callee, identifiers);\n      for (const arg of (ast as any).args) {\n        collectIdentifiersRecursive(arg, identifiers);\n      }\n      break;\n\n    case 'ArrayLiteral':\n      for (const element of (ast as any).elements) {\n        collectIdentifiersRecursive(element, identifiers);\n      }\n      break;\n\n    case 'ObjectLiteral':\n      for (const [_key, value] of Object.entries((ast as any).properties)) {\n        collectIdentifiersRecursive(value as ExpressionAST, identifiers);\n      }\n      break;\n\n    case 'TemplateLiteral':\n      for (const part of (ast as any).parts) {\n        if (typeof part === 'object') {\n          // It's an expression\n          collectIdentifiersRecursive(part as ExpressionAST, identifiers);\n        }\n        // String literals are ignored\n      }\n      break;\n\n    case 'Interval':\n      collectIdentifiersRecursive((ast as any).start, identifiers);\n      collectIdentifiersRecursive((ast as any).end, identifiers);\n      break;\n\n    // Literals don't reference identifiers\n    case 'NumberLiteral':\n    case 'StringLiteral':\n    case 'BooleanLiteral':\n    case 'NullLiteral':\n    case 'DollarRef':\n    case 'HashRef':\n      // No identifiers to collect\n      break;\n\n    default:\n      throw new Error(`Unknown AST node type: ${(ast as any).type}`);\n  }\n}\n\n/**\n * Validate that all referenced identifiers exist in the input schema.\n *\n * This function checks that all input references in expressions are declared\n * in the input schema. It builds a set of expected input fields from the\n * flattened layout and compares it against the identifiers used in expressions.\n *\n * @param referencedIdentifiers - Set of identifiers used in expressions\n * @param context - The compilation context containing the input schema\n * @param location - Source location for error reporting\n * @throws CompilationError if any referenced input is not declared\n */\nexport function validateInputReferences(\n  referencedIdentifiers: Set<string>,\n  context: CompilationContext,\n  location?: SourceLocation,\n): void {\n  // Build a set of all expected input fields from the flattened layout\n  const expectedInputs = new Set<string>();\n\n  // Add all top-level fields (e.g., \"age\", \"name\", \"customer\")\n  for (const field of context.inputLayout.fields) {\n    const parts = field.path.split('.');\n    expectedInputs.add(parts[0]); // Add the top-level field name\n\n    // Also add the full path for cases like \"customer.age\"\n    expectedInputs.add(field.path);\n  }\n\n  // Check each referenced identifier\n  const missingInputs: string[] = [];\n\n  for (const identifier of referencedIdentifiers) {\n    // $ is the unary context variable in decision table cells, # is the iteration variable\n    // in higher-order functions (map, filter, etc.). Both are implicit and don't need schema\n    // declaration.\n    if (identifier === '$' || identifier === '#') {\n      continue;\n    }\n\n    // Check if this identifier is declared\n    let found = false;\n    // Check exact match first\n    if (expectedInputs.has(identifier)) {\n      found = true;\n    } else {\n      // Check if it's a prefix match (e.g., \"customer\" matches \"customer.age\")\n      for (const expected of expectedInputs) {\n        if (expected.startsWith(identifier + '.')) {\n          found = true;\n          break;\n        }\n      }\n    }\n\n    if (!found) {\n      missingInputs.push(identifier);\n    }\n  }\n\n  // If we found missing inputs, throw an error\n  if (missingInputs.length > 0) {\n    const missingList = missingInputs\n      .sort()\n      .map((id) => `\"${id}\"`)\n      .join(', ');\n    const message =\n      missingInputs.length === 1\n        ? `Input reference \"${missingInputs[0]}\" is not declared in the input schema`\n        : `Input references are not declared in the input schema: ${missingList}`;\n\n    throw new CompilationError(\n      message,\n      ErrorCode.UNKNOWN_FIELD,\n      {\n        ...location,\n        field: 'inputs',\n      },\n      { missingInputs: missingInputs as any },\n    );\n  }\n}\n\n/**\n * Collect all output assignments from a decision.\n *\n * This function walks through all nodes in the decision and collects\n * the output paths that are assigned by expression nodes and decision table nodes.\n *\n * @param context - The compilation context\n * @returns Set of all output paths assigned by the decision\n */\nexport function collectOutputAssignments(\n  context: CompilationContext,\n  errorCollector?: ErrorCollector,\n): Set<string> {\n  const assignedOutputs = new Set<string>();\n\n  for (const node of context.jdm.nodes) {\n    const nodeType = node.type;\n\n    try {\n      if (nodeType === 'expressionNode') {\n        // Collect output assignments from expression nodes\n        const expressions = node.content.expressions as Array<{ key: string; value: string }>;\n        for (const expr of expressions) {\n          assignedOutputs.add(expr.key);\n        }\n      } else if (nodeType === 'decisionTableNode') {\n        // Collect output fields from decision table nodes\n        const content = node.content as any;\n        if (content.outputs) {\n          for (const output of content.outputs) {\n            if (output.field) {\n              assignedOutputs.add(output.field);\n            }\n          }\n        }\n      }\n      // Switch nodes and sub-decision nodes delegate to other nodes which will be processed\n      // separately, so their outputs will be collected from those target nodes.\n    } catch (error) {\n      // Collect errors for batch reporting rather than swallowing them silently\n      if (errorCollector) {\n        const err =\n          error instanceof CompilationError\n            ? error\n            : new CompilationError(\n                `Failed to collect output assignments from node \"${node.name || node.id}\": ${error instanceof Error ? error.message : String(error)}`,\n                ErrorCode.PARSE_ERROR,\n                { nodeId: node.id, nodeName: node.name },\n              );\n        errorCollector.add(err);\n      }\n    }\n  }\n\n  return assignedOutputs;\n}\n\n/**\n * Validate that all expected outputs from the schema are assigned.\n *\n * This function checks that all output fields defined in the output schema\n * are actually assigned by the decision logic. It builds a set of expected\n * output fields from the flattened layout and compares it against the\n * outputs that are assigned by expression nodes and decision table nodes.\n *\n * @param assignedOutputs - Set of output paths assigned by the decision\n * @param context - The compilation context containing the output schema\n * @param location - Source location for error reporting\n * @throws CompilationError if any expected output is not assigned\n */\nexport function validateOutputReferences(\n  assignedOutputs: Set<string>,\n  context: CompilationContext,\n  location?: SourceLocation,\n): void {\n  // Build a set of all expected output fields from the flattened layout\n  const expectedOutputs = new Set<string>();\n\n  // Add all output fields from the layout\n  for (const field of context.outputLayout.fields) {\n    expectedOutputs.add(field.path);\n  }\n\n  // Check each expected output\n  const missingOutputs: string[] = [];\n\n  for (const output of expectedOutputs) {\n    // Prefix matching handles nested object assignment - if schema expects \"customer\" but decision\n    // assigns \"customer.name\" and \"customer.age\", those partial assignments satisfy the requirement\n    let found = false;\n\n    // Check exact match\n    if (assignedOutputs.has(output)) {\n      found = true;\n    } else {\n      // Check if any assigned output is a nested field of the expected output\n      // e.g., if \"customer\" is expected and \"customer.name\" is assigned\n      for (const assigned of assignedOutputs) {\n        if (assigned.startsWith(output + '.')) {\n          found = true;\n          break;\n        }\n      }\n    }\n\n    if (!found) {\n      missingOutputs.push(output);\n    }\n  }\n\n  // If we found missing outputs, throw an error\n  if (missingOutputs.length > 0) {\n    const missingList = missingOutputs\n      .sort()\n      .map((field) => `\"${field}\"`)\n      .join(', ');\n    const message =\n      missingOutputs.length === 1\n        ? `Output field \"${missingOutputs[0]}\" is declared in the output schema but not assigned by the decision`\n        : `Output fields are declared in the output schema but not assigned by the decision: ${missingList}`;\n\n    throw new CompilationError(\n      message,\n      ErrorCode.UNKNOWN_FIELD,\n      {\n        ...location,\n        field: 'outputs',\n      },\n      { missingOutputs: missingOutputs as any },\n    );\n  }\n}\n\n/**\n * Validate output assignments for all nodes in a decision.\n *\n * This is a convenience function that validates that all expected outputs\n * from the output schema are actually assigned by the decision logic.\n *\n * @param context - The compilation context\n * @throws CompilationError if any expected output is not assigned or if errors occur during collection\n */\nexport function validateAllOutputReferences(context: CompilationContext): void {\n  const errorCollector = new ErrorCollector();\n\n  // Collect all output assignments, gathering any errors\n  const assignedOutputs = collectOutputAssignments(context, errorCollector);\n\n  // Validate that all expected outputs are assigned\n  try {\n    validateOutputReferences(assignedOutputs, context);\n  } catch (error) {\n    if (error instanceof CompilationError) {\n      errorCollector.add(error);\n    } else {\n      throw error;\n    }\n  }\n\n  // Throw all collected errors (parse errors + validation errors)\n  errorCollector.throwIfErrors();\n}\n\n/**\n * Validate input references for all expression nodes in a decision.\n *\n * This is a convenience function that validates all expressions in the decision\n * at once, collecting all errors before throwing.\n *\n * @param context - The compilation context\n * @throws CompilationError if any expression references an undeclared input or contains parse errors\n */\nexport function validateAllInputReferences(context: CompilationContext): void {\n  const errorCollector = new ErrorCollector();\n  const inputLayout = context.inputLayout;\n  const expectedInputs = new Set<string>();\n\n  // Build set of expected inputs\n  for (const field of inputLayout.fields) {\n    const parts = field.path.split('.');\n    expectedInputs.add(parts[0]);\n    expectedInputs.add(field.path);\n  }\n\n  // Collect all references and validate them\n  const allIdentifiers = new Set<string>();\n\n  // Helper to create a parse error with location context\n  const createParseError = (\n    nodeId: string,\n    nodeName: string | undefined,\n    expression: string,\n    error: unknown,\n  ): CompilationError => {\n    if (error instanceof CompilationError) {\n      // Preserve original error but add node context if missing\n      if (!error.location?.nodeId) {\n        return new CompilationError(error.message, error.code, { nodeId, nodeName }, error.context);\n      }\n      return error;\n    }\n    return new CompilationError(\n      `Failed to parse expression \"${expression}\": ${error instanceof Error ? error.message : String(error)}`,\n      ErrorCode.PARSE_ERROR,\n      { nodeId, nodeName },\n    );\n  };\n\n  // Process all nodes that contain expressions\n  for (const node of context.jdm.nodes) {\n    const nodeType = node.type;\n\n    try {\n      if (nodeType === 'expressionNode') {\n        // Collect identifiers from all expressions in the node\n        const expressions = node.content.expressions as Array<{ key: string; value: string }>;\n        for (const expr of expressions) {\n          try {\n            const ast = context.parseExpression(expr.value);\n            const identifiers = collectIdentifiers(ast);\n            for (const id of identifiers) {\n              allIdentifiers.add(id);\n            }\n          } catch (error) {\n            errorCollector.add(createParseError(node.id, node.name, expr.value, error));\n          }\n        }\n      } else if (nodeType === 'decisionTableNode') {\n        // Collect identifiers from decision table conditions\n        const content = node.content as any;\n        if (content.rules) {\n          for (const rule of content.rules) {\n            if (rule.input) {\n              for (const [_key, value] of Object.entries(rule.input as Record<string, string>)) {\n                if (\n                  value &&\n                  typeof value === 'string' &&\n                  !['true', 'false', 'null'].includes(value.toLowerCase())\n                ) {\n                  try {\n                    const ast = context.parseExpression(value);\n                    const identifiers = collectIdentifiers(ast);\n                    for (const id of identifiers) {\n                      allIdentifiers.add(id);\n                    }\n                  } catch (error) {\n                    // Collect parse errors for batch reporting\n                    errorCollector.add(createParseError(node.id, node.name, value, error));\n                  }\n                }\n              }\n            }\n          }\n        }\n      } else if (nodeType === 'switchNode') {\n        // Collect identifiers from switch conditions\n        const content = node.content as any;\n        if (content.cases) {\n          for (const switchCase of content.cases) {\n            if (switchCase.condition && switchCase.condition.expression) {\n              try {\n                const ast = context.parseExpression(switchCase.condition.expression);\n                const identifiers = collectIdentifiers(ast);\n                for (const id of identifiers) {\n                  allIdentifiers.add(id);\n                }\n              } catch (error) {\n                // Collect parse errors for batch reporting\n                errorCollector.add(\n                  createParseError(node.id, node.name, switchCase.condition.expression, error),\n                );\n              }\n            }\n          }\n        }\n      }\n    } catch (error) {\n      // Collect errors from node processing for batch reporting\n      const err =\n        error instanceof CompilationError\n          ? error\n          : new CompilationError(\n              `Failed to process node \"${node.name || node.id}\": ${error instanceof Error ? error.message : String(error)}`,\n              ErrorCode.PARSE_ERROR,\n              { nodeId: node.id, nodeName: node.name },\n            );\n      errorCollector.add(err);\n    }\n  }\n\n  // Validate all collected identifiers\n  try {\n    validateInputReferences(allIdentifiers, context);\n  } catch (error) {\n    if (error instanceof CompilationError) {\n      errorCollector.add(error);\n    } else {\n      throw error;\n    }\n  }\n\n  // Throw all collected errors (parse errors + validation errors)\n  errorCollector.throwIfErrors();\n}\n","/**\n * Switch branch detection algorithm for JDM decisions.\n *\n * This module identifies nodes that are exclusively reachable through switch node branches.\n * These nodes are marked as \"switchBranchTargets\" and should be skipped during the main\n * evaluation loop because the switch node evaluates them inline when taking a branch.\n *\n * WHY: Prevent double-evaluation - switch nodes evaluate branches inline, so downstream\n * nodes must be skipped in the main evaluation loop to avoid executing them twice.\n *\n * OPTIMIZATION: Uses a single forward traversal through the graph to mark all nodes\n * reachable from switch branches. This is O(n + m) instead of O(s × b × (n + m))\n * where s = switches, b = branches, n = nodes, m = edges.\n */\n\nimport type { JDMDecision, JDMEdge } from './parser';\n\n/**\n * Build an adjacency map for fast edge lookups.\n * Maps each source node ID to an array of target node IDs.\n *\n * @param edges - All edges in the decision graph\n * @returns Map from source node ID to array of target node IDs\n */\nfunction buildAdjacencyMap(edges: JDMEdge[]): Map<string, string[]> {\n  const adjacencyMap = new Map<string, string[]>();\n\n  for (const edge of edges) {\n    const targets = adjacencyMap.get(edge.sourceId);\n    if (targets) {\n      targets.push(edge.targetId);\n    } else {\n      adjacencyMap.set(edge.sourceId, [edge.targetId]);\n    }\n  }\n\n  return adjacencyMap;\n}\n\n/**\n * Find all nodes that are exclusively reachable through switch node branches.\n *\n * Optimized algorithm:\n * 1. Build adjacency map once for O(1) edge lookups\n * 2. Identify all direct targets of switch nodes\n * 3. Use BFS with efficient queue operations to traverse from all switch targets\n * 4. Marks all nodes reachable from switch branches in a single traversal\n *\n * Time complexity: O(n + m) where n = nodes, m = edges\n * Space complexity: O(n + m) for adjacency map and visited set\n *\n * @param jdm - The parsed JDM decision\n * @returns Set of node IDs that are switch branch targets\n */\nexport function findSwitchBranchTargets(jdm: JDMDecision): Set<string> {\n  // Build adjacency map once for O(1) lookups instead of O(m) filtering\n  const adjacencyMap = buildAdjacencyMap(jdm.edges);\n\n  // Find all direct targets of switch nodes\n  const switchNodes = jdm.nodes.filter((n) => n.type === 'switchNode');\n  const switchBranchTargets = new Set<string>();\n\n  // Collect all direct switch targets to start BFS from\n  const bfsQueue: string[] = [];\n  for (const switchNode of switchNodes) {\n    const targets = adjacencyMap.get(switchNode.id) || [];\n    for (const targetId of targets) {\n      if (!switchBranchTargets.has(targetId)) {\n        switchBranchTargets.add(targetId);\n        bfsQueue.push(targetId);\n      }\n    }\n  }\n\n  // Single BFS traversal from all switch targets\n  // Use index-based iteration instead of shift() to avoid O(n) array operations\n  let queueIndex = 0;\n  while (queueIndex < bfsQueue.length) {\n    const currentId = bfsQueue[queueIndex++];\n\n    // Get all outgoing edges using O(1) map lookup\n    const targets = adjacencyMap.get(currentId) || [];\n    for (const targetId of targets) {\n      if (!switchBranchTargets.has(targetId)) {\n        switchBranchTargets.add(targetId);\n        bfsQueue.push(targetId);\n      }\n    }\n  }\n\n  return switchBranchTargets;\n}\n","/**\n * Result selection logic for JDM decisions.\n *\n * This module determines how to compute the final result from the evaluation order.\n * It handles different scenarios:\n * - Switch nodes that route to different branches\n * - Decision tables with collect-style hit policies\n * - PassThrough nodes that accumulate context\n * - Regular nodes that return their result directly\n */\n\nimport type { JDMNode } from './parser';\n\n/**\n * Check if a decision table node uses a collect-style hit policy.\n * Collect-style policies return arrays and need to be wrapped in an object with the node name as key.\n */\nexport function isCollectStyleHitPolicy(node: JDMNode): boolean {\n  if (node.type !== 'decisionTableNode') {\n    return false;\n  }\n  const hitPolicy = node.content?.hitPolicy || 'first';\n  return ['collect', 'ruleOrder', 'outputOrder', 'priority'].includes(hitPolicy);\n}\n\n/**\n * Options for result code generation.\n */\nexport interface ResultSelectionOptions {\n  /** Map of node IDs to JDMNode objects */\n  nodeMap: Map<string, JDMNode>;\n  /** Ordered list of node IDs that were actually evaluated (not skipped) */\n  evaluatedNodes: string[];\n  /** Set of node IDs that are switch branch targets (skipped in main loop) */\n  switchBranchTargets: Set<string>;\n}\n\n/**\n * Determine which node's result should be used as the final output.\n *\n * Priority order:\n * 1. If there's a switch node, use its result (it handles routing)\n * 2. Otherwise, use the last non-input, non-output node result\n * 3. Fallback to output node or null\n *\n * @param options - The selection options\n * @returns The node to use for the final result, or null if fallback needed\n */\nexport function selectResultNode(options: ResultSelectionOptions): JDMNode | null {\n  const { nodeMap, evaluatedNodes } = options;\n\n  // Check if there's a switch node that routes to different branches\n  // Only switch nodes truly route - decision tables in a linear flow are NOT routing nodes\n  const switchNodes = evaluatedNodes.filter((id) => {\n    const node = nodeMap.get(id);\n    return node && node.type === 'switchNode';\n  });\n\n  // When there are switch nodes, use the switch result since it handles branch evaluation\n  if (switchNodes.length > 0) {\n    // Use the last switch node's result (it handles branch routing to terminal nodes)\n    const lastSwitchNodeId = switchNodes[switchNodes.length - 1];\n    return nodeMap.get(lastSwitchNodeId) || null;\n  }\n\n  // Use the last evaluated node\n  if (evaluatedNodes.length > 0) {\n    const lastNodeId = evaluatedNodes[evaluatedNodes.length - 1];\n    return nodeMap.get(lastNodeId) || null;\n  }\n\n  return null;\n}\n\n/**\n * Generate AssemblyScript code to extract the final result from a node.\n *\n * Handles:\n * - Collect-style hit policies (return array directly)\n * - PassThrough nodes (return accumulated context)\n * - Regular nodes (return node result directly)\n *\n * @param node - The node to generate result code for\n * @returns AssemblyScript code string\n */\nexport function generateResultCode(node: JDMNode): string {\n  // COLLECT-style hit policies return arrays directly (not wrapped in an object with the\n  // node name as key) to match zen-engine behavior where the array IS the result\n  if (isCollectStyleHitPolicy(node)) {\n    return `  let result = ctx.get(\"$nodes.${node.name}\");`;\n  }\n\n  // If the node has passThrough enabled, return the accumulated context\n  // This includes all values from previous nodes that were merged via passThrough\n  //\n  // Both 'no match with passThrough' and 'valid result' return Objects, so we use\n  // the __passthrough marker a marker to distinguish these cases while maintaining\n  // type safety.\n  const hasPassThrough = node.content?.passThrough === true;\n  if (hasPassThrough) {\n    return `  // Check node result for passThrough handling\n  let __nodeResult = ctx.get(\"$nodes.${node.name}\");\n  let result: Value;\n  \n  // Check if this is a \"passthrough signal\" (no match with passThrough enabled)\n  if (!__nodeResult.isNull() && __nodeResult.isObject()) {\n    let __obj = __nodeResult.asObject();\n    if (__obj.has(\"__passthrough\") && __obj.get(\"__passthrough\").asBool()) {\n      // Node signaled to use passthrough - return accumulated context\n      let __finalResult = new Map<string, Value>();\n      const __ctxKeys = ctx.data.keys();\n      for (let __i = 0; __i < __ctxKeys.length; __i++) {\n        const __key = __ctxKeys[__i];\n        if (!__key.startsWith(\"$\") && __key !== \"#\" && __key !== \"acc\") {\n          __finalResult.set(__key, ctx.data.get(__key));\n        }\n      }\n      result = Value.Object(__finalResult);\n    } else {\n      // Valid result - build from accumulated context (passThrough merges input with output)\n      let __finalResult = new Map<string, Value>();\n      const __ctxKeys = ctx.data.keys();\n      for (let __i = 0; __i < __ctxKeys.length; __i++) {\n        const __key = __ctxKeys[__i];\n        if (!__key.startsWith(\"$\") && __key !== \"#\" && __key !== \"acc\") {\n          __finalResult.set(__key, ctx.data.get(__key));\n        }\n      }\n      result = Value.Object(__finalResult);\n    }\n  } else if (__nodeResult.isNull()) {\n    // Node returned null (error case) - return null, don't passthrough\n    result = Value.Null();\n  } else {\n    // Non-object result - return as-is\n    result = __nodeResult;\n  }`;\n  }\n\n  return `  let result = ctx.get(\"$nodes.${node.name}\");`;\n}\n\n/**\n * Generate fallback result code when no suitable node is found.\n *\n * @param outputNodeIds - Set of output node IDs\n * @param sanitizeId - Function to sanitize node IDs for code generation\n * @returns AssemblyScript code string\n */\nexport function generateFallbackResultCode(\n  outputNodeIds: Set<string>,\n  sanitizeId: (id: string) => string,\n): string {\n  if (outputNodeIds.size > 0) {\n    // Fallback: evaluate output node if no other nodes were evaluated\n    const outputNodeId = Array.from(outputNodeIds)[0];\n    const sanitizedOutputId = sanitizeId(outputNodeId);\n    return `  let result = evaluateNode_${sanitizedOutputId}(ctx);`;\n  }\n  return '  let result = Value.Null();';\n}\n","/**\n * Main compilation orchestrator for JDM decisions.\n *\n * This module coordinates the compilation pipeline, bringing together:\n * - Graph building and topological ordering\n * - Node compilation\n * - Switch branch detection\n * - Result selection\n * - Memory layout code generation\n *\n * The orchestrator itself does minimal work - it delegates to specialized modules\n * for each concern.\n */\n\nimport type { JDMDecision, JDMNode } from './parser';\nimport type { CompilationContext, AssemblyScriptCode } from './types';\nimport { buildGraph, getEvaluationOrder } from './graph';\nimport { compileInputNode, compileOutputNode } from './nodes/input';\nimport { compileDecisionTableNode } from './nodes/decision-table';\nimport { compileSwitchNode } from './nodes/switch';\nimport { compileDecisionNode } from './nodes/decision';\nimport { compileExpressionNode } from './nodes/expression';\nimport { compileFunctionNode } from './nodes/function';\nimport { sanitizeId } from './utils';\nimport { validateAllInputReferences, validateAllOutputReferences } from './compile-time-validation';\nimport { generatePassThroughMergeCode, generateNestedPathAssignment } from './code-generators';\nimport { findSwitchBranchTargets } from './switch-branch-detection';\nimport {\n  selectResultNode,\n  generateResultCode,\n  generateFallbackResultCode,\n} from './result-selection';\n\n// ============================================================================\n// Memory Layout Constants\n// ============================================================================\n\n/**\n * Custom heap start offset in bytes (512KB).\n *\n * The custom heap starts at 512KB to avoid conflicts with:\n * 1. AssemblyScript's internal runtime heap (~50KB - ~192KB)\n * 2. Host-written input buffer region (192KB - 512KB, up to 320KB)\n *\n * This ensures clear separation of memory regions and prevents\n * the AS runtime from interfering with our custom heap allocator.\n * Host must grow memory to at least 768KB to use this layout.\n */\nconst CUSTOM_HEAP_START_BYTES = 512 * 1024;\n\n/**\n * Compile a JDM decision to AssemblyScript code.\n *\n * This function orchestrates compilation of all nodes in the decision graph\n * and generates the complete AssemblyScript module.\n *\n * @param jdm - The parsed JDM decision\n * @param context - The compilation context\n * @returns Generated AssemblyScript code\n */\nexport function compileDecision(jdm: JDMDecision, context: CompilationContext): AssemblyScriptCode {\n  // Build the graph\n  const graph = buildGraph(jdm);\n\n  // Get nodes in topological order to ensure dependencies are compiled before dependents\n  const evaluationOrder = getEvaluationOrder(graph);\n\n  // Validate references if enabled\n  if (context.options.validate !== false) {\n    validateAllInputReferences(context);\n    validateAllOutputReferences(context);\n  }\n\n  // Create a node lookup for quick access\n  const nodeMap = new Map(jdm.nodes.map((n) => [n.id, n]));\n\n  // Compile each node based on its type\n  const compiledCode = compileNodes(evaluationOrder, nodeMap, context);\n\n  // Generate helper functions for higher-order operations\n  const helperFunctionsCode = Array.from(context.helperFunctions.values()).join('\\n');\n\n  // Find nodes that are switch branch targets (should be skipped in main evaluation)\n  const switchBranchTargets = findSwitchBranchTargets(jdm);\n\n  // Generate evaluation code for each node in topological order\n  const evaluationCode = generateEvaluationCode(evaluationOrder, nodeMap, switchBranchTargets);\n\n  // Find output nodes (nodes with no outgoing edges)\n  const outputNodeIds = findOutputNodeIds(jdm);\n\n  // Find evaluated nodes (excluding input, output, and switch branch targets)\n  const evaluatedNodes = filterEvaluatedNodes(evaluationOrder, nodeMap, switchBranchTargets);\n\n  // Generate result selection code\n  const resultCode = generateResultSelectionCode(nodeMap, evaluatedNodes, outputNodeIds);\n\n  // Generate the complete AssemblyScript module\n  return generateModuleCode(helperFunctionsCode, compiledCode, evaluationCode, resultCode);\n}\n\n/**\n * Compile all nodes in evaluation order.\n */\nfunction compileNodes(\n  evaluationOrder: string[],\n  nodeMap: Map<string, JDMNode>,\n  context: CompilationContext,\n): string {\n  let compiledCode = '';\n\n  for (const nodeId of evaluationOrder) {\n    const node = nodeMap.get(nodeId);\n    if (!node) {\n      continue;\n    }\n\n    const nodeType = node.type;\n\n    switch (nodeType) {\n      case 'inputNode':\n        compiledCode += compileInputNode(node, context);\n        break;\n      case 'decisionTableNode':\n        compiledCode += compileDecisionTableNode(node, context);\n        break;\n      case 'switchNode':\n        compiledCode += compileSwitchNode(node, context);\n        break;\n      case 'decisionNode':\n        compiledCode += compileDecisionNode(node, context);\n        break;\n      case 'outputNode':\n        compiledCode += compileOutputNode(node, context);\n        break;\n      case 'expressionNode':\n        compiledCode += compileExpressionNode(node, context);\n        break;\n      case 'functionNode':\n        compiledCode += compileFunctionNode(node, context);\n        break;\n      default:\n        // Unknown node type - skip\n        break;\n    }\n  }\n\n  return compiledCode;\n}\n\n/**\n * Generate evaluation code for each node in topological order.\n * Skips output nodes and switch branch targets.\n */\nfunction generateEvaluationCode(\n  evaluationOrder: string[],\n  nodeMap: Map<string, JDMNode>,\n  switchBranchTargets: Set<string>,\n): string {\n  return evaluationOrder\n    .map((nodeId) => {\n      const node = nodeMap.get(nodeId);\n      if (!node || node.type === 'outputNode') {\n        return '';\n      }\n\n      // Skip nodes that are switch branch targets - they'll be evaluated by the switch\n      if (switchBranchTargets.has(nodeId)) {\n        return '';\n      }\n\n      return generateNodeEvaluationCode(node);\n    })\n    .filter(Boolean)\n    .join('\\n');\n}\n\n/**\n * Generate evaluation code for a single node.\n */\nfunction generateNodeEvaluationCode(node: JDMNode): string {\n  const sanitizedId = sanitizeId(node.id);\n\n  // Check if this node has passThrough enabled (decision tables and expression nodes)\n  const hasPassThrough = node.content?.passThrough === true;\n\n  // Store node result in context under $nodes.<nodeName>\n  let code = `  ctx.set(\"$nodes.${node.name}\", evaluateNode_${sanitizedId}(ctx));`;\n\n  // Handle outputPath - if specified, store the result at the given path\n  // This is used for collect-style decision tables to place array results at a nested path\n  const outputPath = node.content?.outputPath;\n  if (outputPath) {\n    // Check if it's a simple (non-nested) path or a nested path\n    if (!outputPath.includes('.')) {\n      // Simple path - just set directly in context\n      code += `\n  // Store node output at outputPath: ${outputPath} (simple path)\n  ctx.set(\"${outputPath}\", ctx.get(\"$nodes.${node.name}\"));`;\n    } else {\n      // Nested path - use shared helper to generate nested object structure\n      code += `\n  ${generateNestedPathAssignment(outputPath, `ctx.get(\"$nodes.${node.name}\")`)}`;\n    }\n  }\n\n  // If passThrough is enabled, merge the node's output properties back into the context\n  // This allows subsequent nodes to access the computed values directly\n  if (hasPassThrough) {\n    code += `\\n  ${generatePassThroughMergeCode(node.name)}`;\n  }\n\n  return code;\n}\n\n/**\n * Find output node IDs (nodes with no outgoing edges).\n */\nfunction findOutputNodeIds(jdm: JDMDecision): Set<string> {\n  const outputNodeIds = new Set<string>();\n  for (const node of jdm.nodes) {\n    const outgoingEdges = jdm.edges.filter((e) => e.sourceId === node.id);\n    if (outgoingEdges.length === 0) {\n      outputNodeIds.add(node.id);\n    }\n  }\n  return outputNodeIds;\n}\n\n/**\n * Filter evaluation order to get only nodes that were actually evaluated.\n */\nfunction filterEvaluatedNodes(\n  evaluationOrder: string[],\n  nodeMap: Map<string, JDMNode>,\n  switchBranchTargets: Set<string>,\n): string[] {\n  return evaluationOrder.filter((id) => {\n    const node = nodeMap.get(id);\n    if (!node) {\n      return false;\n    }\n    // Exclude input and output nodes\n    if (node.type === 'inputNode' || node.type === 'outputNode') {\n      return false;\n    }\n    // Exclude switch branch targets - they're evaluated by the switch\n    if (switchBranchTargets.has(id)) {\n      return false;\n    }\n    return true;\n  });\n}\n\n/**\n * Generate code to select and extract the final result.\n */\nfunction generateResultSelectionCode(\n  nodeMap: Map<string, JDMNode>,\n  evaluatedNodes: string[],\n  outputNodeIds: Set<string>,\n): string {\n  // Use the result-selection module to determine which node's result to use\n  const resultNode = selectResultNode({\n    nodeMap,\n    evaluatedNodes,\n    switchBranchTargets: new Set(), // Already filtered out\n  });\n\n  if (resultNode) {\n    return generateResultCode(resultNode);\n  }\n\n  return generateFallbackResultCode(outputNodeIds, sanitizeId);\n}\n\n/**\n * Generate the complete AssemblyScript module code.\n */\nfunction generateModuleCode(\n  helperFunctionsCode: string,\n  compiledCode: string,\n  evaluationCode: string,\n  resultCode: string,\n): string {\n  return `\nimport { Value } from './values';\nimport { Context, ScopedContext } from './context';\nimport {\n  addValues,\n  subtractValues,\n  multiplyValues,\n  divideValues,\n  moduloValues,\n  powerValues,\n  negateValue,\n  valuesEqual,\n  compareValues,\n  getProperty,\n  getIndex,\n  valueIn,\n  createInterval,\n  evaluateFunction,\n  makeArgs1,\n  makeArgs2,\n  makeArgs3\n} from './expressions';\nimport { SetLastError, SetLastErrorWithMessage, hasError, RuntimeErrorCode, initializeMemoryLayout, resetHeap } from './memory';\nimport { readValueMap, writeValue } from './arrays';\n\n${helperFunctionsCode}\n\n${compiledCode}\n\n// Main entry point for the compiled decision\n// Input: pointer to input data in WASM memory (serialized Map<string, Value>)\n// Returns: pointer to output data in WASM memory (serialized Value)\nexport function evaluate(inputPtr: usize): usize {\n  // Initialize memory layout for custom heap (used for output marshaling)\n  // Memory regions (from 0):\n  // +--------------------------+\n  // | Static data              | 0 - ~50KB (AS's __heap_base)\n  // +--------------------------+\n  // | AS runtime heap          | ~50KB - ~192KB (grows upward during evaluation)\n  // +--------------------------+\n  // | Input data buffer        | 192KB - 512KB (written by host, up to 320KB)\n  // +--------------------------+\n  // | Custom heap (ours)       | 512KB - (used for writeValue/marshaling)\n  // +--------------------------+\n  // The custom heap starts at 512KB to avoid conflicts with AS's internal heap\n  // and the host-written input buffer. Host must grow memory to at least 768KB.\n  initializeMemoryLayout(${CUSTOM_HEAP_START_BYTES}, 0);\n\n  // Reset heap for fresh evaluation\n  resetHeap();\n\n  // Read input from memory\n  let input = readValueMap(inputPtr);\n\n  // Create context with input data\n  let ctx = new Context(input);\n\n  // Evaluate the decision graph in topological order\n${evaluationCode}\n\n  // Get the final result\n${resultCode}\n  // Write result to output memory and return pointer\n  return writeValue(result);\n}\n`;\n}\n","/**\n * Caches compiled WASM modules keyed by source code + runtime + compiler options.\n * WASM compilation via AssemblyScript is expensive (~250ms per decision), so caching\n * identical compilations significantly improves the speed of iterative development\n * and testing.\n */\n\nimport { createHash } from 'crypto';\nimport {\n  existsSync,\n  mkdirSync,\n  readFileSync,\n  writeFileSync,\n  readdirSync,\n  statSync,\n  unlinkSync,\n} from 'fs';\nimport { join, dirname } from 'path';\n\n// Import runtime source strings to include in cache key\nimport {\n  RUNTIME_VALUES,\n  RUNTIME_CONTEXT,\n  RUNTIME_EXPRESSIONS,\n  RUNTIME_TABLES,\n  RUNTIME_MEMORY,\n  RUNTIME_STRINGS,\n  RUNTIME_ARRAYS,\n} from './runtime/index';\n\n// Package version - included in cache key to invalidate cache across compiler versions\nlet packageVersion: string = '';\n\nfunction getPackageVersion(): string {\n  if (packageVersion === '') {\n    try {\n      // Try to find package.json from this file's location\n      const packagePath = join(dirname(__dirname), '..', 'package.json');\n      const pkg = JSON.parse(readFileSync(packagePath, 'utf-8'));\n      packageVersion = pkg.version || 'unknown';\n    } catch {\n      packageVersion = 'unknown';\n    }\n  }\n  return packageVersion;\n}\n\n/**\n * Cache directory location\n */\nfunction getCacheDir(): string {\n  // Use node_modules/.cache/jdm-asm for caching\n  // This is a common convention and gets cleaned up with node_modules\n  const cacheDir = join(process.cwd(), 'node_modules', '.cache', 'jdm-asm');\n  return cacheDir;\n}\n\n/**\n * Ensure the cache directory exists\n * @throws Error if directory creation fails\n */\nfunction ensureCacheDir(): string {\n  const cacheDir = getCacheDir();\n  if (!existsSync(cacheDir)) {\n    try {\n      mkdirSync(cacheDir, { recursive: true });\n    } catch (error) {\n      const errorMsg = error instanceof Error ? error.message : String(error);\n      throw new Error(`Failed to create cache directory at ${cacheDir}: ${errorMsg}`);\n    }\n  }\n  return cacheDir;\n}\n\n/**\n * Compute a stable hash for cache key.\n */\nexport function computeCacheKey(\n  assemblyScriptCode: string,\n  options: { optimize?: boolean; debug?: boolean },\n): string {\n  const hash = createHash('sha256');\n\n  // Include package version\n  hash.update(`version:${getPackageVersion()}\\n`);\n\n  // Include compiler options\n  hash.update(`optimize:${options.optimize ?? true}\\n`);\n  hash.update(`debug:${options.debug ?? false}\\n`);\n\n  // Include all runtime source files: runtime code changes affect WASM output, so\n  // must be part of cache key\n  hash.update('---RUNTIME_VALUES---\\n');\n  hash.update(RUNTIME_VALUES);\n  hash.update('---RUNTIME_CONTEXT---\\n');\n  hash.update(RUNTIME_CONTEXT);\n  hash.update('---RUNTIME_EXPRESSIONS---\\n');\n  hash.update(RUNTIME_EXPRESSIONS);\n  hash.update('---RUNTIME_TABLES---\\n');\n  hash.update(RUNTIME_TABLES);\n  hash.update('---RUNTIME_MEMORY---\\n');\n  hash.update(RUNTIME_MEMORY);\n  hash.update('---RUNTIME_STRINGS---\\n');\n  hash.update(RUNTIME_STRINGS);\n  hash.update('---RUNTIME_ARRAYS---\\n');\n  hash.update(RUNTIME_ARRAYS);\n\n  // Include the generated AssemblyScript code\n  hash.update('---ASSEMBLYSCRIPT---\\n');\n  hash.update(assemblyScriptCode);\n\n  // Return first 32 characters of hex digest (128 bits - sufficient for cache key)\n  return hash.digest('hex').slice(0, 32);\n}\n\n/**\n * Cache entry format\n */\ninterface CacheEntry {\n  version: string;\n  timestamp: number;\n  binary: string; // Base64 encoded WASM binary\n  wat: string;\n}\n\n/**\n * Read cached WASM compilation result from disk if available\n */\nexport function readCacheFromDisk(cacheKey: string): { binary: Uint8Array; wat: string } | null {\n  const cacheDir = getCacheDir();\n  const cachePath = join(cacheDir, `${cacheKey}.json`);\n\n  if (!existsSync(cachePath)) {\n    return null;\n  }\n\n  try {\n    const content = readFileSync(cachePath, 'utf-8');\n    const entry: CacheEntry = JSON.parse(content);\n\n    // Version changes invalidate cache to prevent incompatible compiled code from being used\n    // when the compiler implementation changes between releases\n    if (entry.version !== getPackageVersion()) {\n      // Version mismatch, invalidate\n      unlinkSync(cachePath);\n      return null;\n    }\n\n    // Decode binary from base64\n    const binary = new Uint8Array(Buffer.from(entry.binary, 'base64'));\n    return { binary, wat: entry.wat };\n  } catch (error) {\n    // Distinguish between different error types for better diagnostics\n    if (error && typeof error === 'object' && 'code' in error) {\n      const code = (error as { code: string }).code;\n\n      // ENOENT (file not found) is benign - cache miss\n      if (code === 'ENOENT') {\n        return null;\n      }\n\n      // EACCES/EPERM (permission denied) should warn the user\n      if (code === 'EACCES' || code === 'EPERM') {\n        const errorMsg = error instanceof Error ? error.message : String(error);\n        console.warn(\n          `[jdm-asm] Warning: Cache file exists but cannot be read due to permissions: ${cachePath}\\n${errorMsg}`,\n        );\n        return null;\n      }\n    }\n\n    // Cache corruption or other errors are benign since we can regenerate the result.\n    // Failing fast would hurt UX when cache is just a performance optimization, not critical.\n    // Try to clean up corrupted cache file\n    try {\n      unlinkSync(cachePath);\n    } catch (cleanupError) {\n      // If we can't delete it, just warn (might be permission issue)\n      if (cleanupError && typeof cleanupError === 'object' && 'code' in cleanupError) {\n        const code = (cleanupError as { code: string }).code;\n        if (code === 'EACCES' || code === 'EPERM') {\n          console.warn(\n            `[jdm-asm] Warning: Cannot clean up corrupted cache file (permission denied): ${cachePath}`,\n          );\n        }\n      }\n    }\n    return null;\n  }\n}\n\n/**\n * Write compilation result to disk cache\n * Failures are logged as warnings but do not throw since caching is optional\n */\nexport function writeCacheToDisk(\n  cacheKey: string,\n  result: { binary: Uint8Array; wat: string },\n): void {\n  try {\n    const cacheDir = ensureCacheDir();\n    const cachePath = join(cacheDir, `${cacheKey}.json`);\n\n    const entry: CacheEntry = {\n      version: getPackageVersion(),\n      timestamp: Date.now(),\n      binary: Buffer.from(result.binary).toString('base64'),\n      wat: result.wat,\n    };\n\n    writeFileSync(cachePath, JSON.stringify(entry));\n  } catch (error) {\n    // Cache write failures should not break compilation since caching is a performance\n    // optimization, not a requirement. Warn the user so they know cache isn't working.\n    const errorMsg = error instanceof Error ? error.message : String(error);\n\n    // Provide more specific guidance for common errors\n    if (error && typeof error === 'object' && 'code' in error) {\n      const code = (error as { code: string }).code;\n\n      if (code === 'ENOSPC') {\n        console.warn(`[jdm-asm] Warning: Failed to write cache (disk full): ${errorMsg}`);\n      } else if (code === 'EACCES' || code === 'EPERM' || code === 'EROFS') {\n        console.warn(\n          `[jdm-asm] Warning: Failed to write cache (permission denied or read-only filesystem): ${errorMsg}`,\n        );\n      } else {\n        console.warn(`[jdm-asm] Warning: Failed to write cache: ${errorMsg}`);\n      }\n    } else {\n      console.warn(`[jdm-asm] Warning: Failed to write cache: ${errorMsg}`);\n    }\n  }\n}\n\n/**\n * Get the cache directory path\n * Exposes where compiled WASM modules are stored on disk\n */\nexport function getCacheDirectory(): string {\n  return getCacheDir();\n}\n\n/**\n * Get cache health diagnostics\n * Returns information about cache status, any issues, and recent operations\n */\nexport function getCacheHealth(): {\n  enabled: boolean;\n  directory: string;\n  directoryExists: boolean;\n  accessible: boolean;\n  stats: {\n    entries: number;\n    totalSize: number;\n    oldestEntry: number | null;\n    newestEntry: number | null;\n  };\n  issues: string[];\n} {\n  const enabled = isCacheEnabled();\n  const directory = getCacheDir();\n  const directoryExists = existsSync(directory);\n  const issues: string[] = [];\n\n  // Check if cache is disabled\n  if (!enabled) {\n    issues.push('Cache is disabled via JDM_ASM_NO_CACHE environment variable');\n  }\n\n  // Check if directory exists\n  if (enabled && !directoryExists) {\n    issues.push('Cache directory does not exist yet (will be created on first write)');\n  }\n\n  // Check if directory is accessible\n  let accessible = false;\n  if (directoryExists) {\n    try {\n      // Try to read the directory to check accessibility\n      readdirSync(directory);\n      accessible = true;\n    } catch (error) {\n      accessible = false;\n      issues.push(\n        `Cache directory exists but is not accessible: ${error instanceof Error ? error.message : String(error)}`,\n      );\n    }\n  }\n\n  // Get cache stats if accessible\n  const stats = accessible\n    ? getCacheStats()\n    : {\n        entries: 0,\n        totalSize: 0,\n        oldestEntry: null,\n        newestEntry: null,\n      };\n\n  return {\n    enabled,\n    directory,\n    directoryExists,\n    accessible,\n    stats,\n    issues,\n  };\n}\n\n/**\n * Clear the entire cache\n */\nexport function clearCache(): void {\n  const cacheDir = getCacheDir();\n  if (!existsSync(cacheDir)) {\n    return;\n  }\n\n  const files = readdirSync(cacheDir);\n  for (const file of files) {\n    if (file.endsWith('.json')) {\n      try {\n        unlinkSync(join(cacheDir, file));\n      } catch {}\n    }\n  }\n}\n\n/**\n * Get cache statistics\n */\nexport function getCacheStats(): {\n  entries: number;\n  totalSize: number;\n  oldestEntry: number | null;\n  newestEntry: number | null;\n} {\n  const cacheDir = getCacheDir();\n  if (!existsSync(cacheDir)) {\n    return { entries: 0, totalSize: 0, oldestEntry: null, newestEntry: null };\n  }\n\n  const files = readdirSync(cacheDir).filter((f) => f.endsWith('.json'));\n  let totalSize = 0;\n  let oldestEntry: number | null = null;\n  let newestEntry: number | null = null;\n\n  for (const file of files) {\n    const stat = statSync(join(cacheDir, file));\n    totalSize += stat.size;\n\n    const mtime = stat.mtimeMs;\n    if (oldestEntry === null || mtime < oldestEntry) {\n      oldestEntry = mtime;\n    }\n    if (newestEntry === null || mtime > newestEntry) {\n      newestEntry = mtime;\n    }\n  }\n\n  return { entries: files.length, totalSize, oldestEntry, newestEntry };\n}\n\n/**\n * Prune old cache entries (keep most recent N entries or entries younger than maxAge)\n */\nexport function pruneCache(\n  options: {\n    maxEntries?: number;\n    maxAgeMs?: number;\n  } = {},\n): number {\n  const { maxEntries = 100, maxAgeMs = 7 * 24 * 60 * 60 * 1000 } = options; // Default: 100 entries, 7 days\n  const cacheDir = getCacheDir();\n\n  if (!existsSync(cacheDir)) {\n    return 0;\n  }\n\n  const files = readdirSync(cacheDir)\n    .filter((f) => f.endsWith('.json'))\n    .map((f) => {\n      const stat = statSync(join(cacheDir, f));\n      return { name: f, mtime: stat.mtimeMs };\n    })\n    .sort((a, b) => b.mtime - a.mtime); // Sort by newest first\n\n  const now = Date.now();\n  let removed = 0;\n\n  for (let i = 0; i < files.length; i++) {\n    const file = files[i];\n    const age = now - file.mtime;\n\n    // Remove if exceeds max entries or max age\n    if (i >= maxEntries || age > maxAgeMs) {\n      try {\n        unlinkSync(join(cacheDir, file.name));\n        removed++;\n      } catch {}\n    }\n  }\n\n  return removed;\n}\n\n/**\n * Check if caching is enabled\n * Can be disabled via JDM_ASM_NO_CACHE=1 environment variable\n */\nexport function isCacheEnabled(): boolean {\n  return process.env.JDM_ASM_NO_CACHE !== '1';\n}\n","export const RUNTIME_VALUES = \"// assembly/runtime/values.ts\\n// Type tags for runtime type checking\\nexport const TYPE_NULL: i32 = 0;\\nexport const TYPE_BOOL: i32 = 1;\\nexport const TYPE_INT: i32 = 2;\\nexport const TYPE_FLOAT: i32 = 3;\\nexport const TYPE_STRING: i32 = 4;\\nexport const TYPE_ARRAY: i32 = 5;\\nexport const TYPE_OBJECT: i32 = 6;\\n\\n// Pre-allocated singleton values for frequently used immutable types.\\n// This avoids allocations in hot paths for null/boolean/small integer/common float values.\\nlet _nullSingleton: Value | null = null;\\nlet _trueSingleton: Value | null = null;\\nlet _falseSingleton: Value | null = null;\\nlet _emptyStringSingleton: Value | null = null;\\nlet _zeroFloatSingleton: Value | null = null;\\nlet _oneFloatSingleton: Value | null = null;\\n\\n// Cache for small integers (-1 to 10) - covers common array indices, loop counters, etc.\\n// Using 12-element array: index 0 = -1, index 1 = 0, ..., index 11 = 10\\nconst SMALL_INT_CACHE_MIN: i64 = -1;\\nconst SMALL_INT_CACHE_MAX: i64 = 10;\\nconst SMALL_INT_CACHE_SIZE: i32 = 12;\\nlet _smallIntCache: StaticArray<Value | null> | null = null;\\n\\n/**\\n * Tagged union for dynamic JSON-like values.\\n * Only one field is valid based on the `type` tag.\\n */\\nexport class Value {\\n  type: i32 = TYPE_NULL;\\n  boolVal: bool = false;\\n  intVal: i64 = 0;\\n  floatVal: f64 = 0.0;\\n  stringVal: string | null = null;\\n  arrayVal: Array<Value> | null = null;\\n  objectVal: Map<string, Value> | null = null;\\n\\n  static Null(): Value {\\n    // Return singleton null value to avoid allocations\\n    if (_nullSingleton === null) {\\n      const v = new Value();\\n      v.type = TYPE_NULL;\\n      _nullSingleton = v;\\n    }\\n    return _nullSingleton!;\\n  }\\n\\n  static Bool(val: bool): Value {\\n    // Return singleton boolean values to avoid allocations\\n    if (val) {\\n      if (_trueSingleton === null) {\\n        const v = new Value();\\n        v.type = TYPE_BOOL;\\n        v.boolVal = true;\\n        _trueSingleton = v;\\n      }\\n      return _trueSingleton!;\\n    } else {\\n      if (_falseSingleton === null) {\\n        const v = new Value();\\n        v.type = TYPE_BOOL;\\n        v.boolVal = false;\\n        _falseSingleton = v;\\n      }\\n      return _falseSingleton!;\\n    }\\n  }\\n\\n  static Int(val: i64): Value {\\n    // Fast path for common small integers to avoid allocations\\n    if (val >= SMALL_INT_CACHE_MIN && val <= SMALL_INT_CACHE_MAX) {\\n      if (_smallIntCache === null) {\\n        _smallIntCache = new StaticArray<Value | null>(SMALL_INT_CACHE_SIZE);\\n      }\\n      const idx = <i32>(val - SMALL_INT_CACHE_MIN);\\n      if (unchecked(_smallIntCache![idx]) === null) {\\n        const v = new Value();\\n        v.type = TYPE_INT;\\n        v.intVal = val;\\n        unchecked((_smallIntCache![idx] = v));\\n      }\\n      return unchecked(_smallIntCache![idx])!;\\n    }\\n    const v = new Value();\\n    v.type = TYPE_INT;\\n    v.intVal = val;\\n    return v;\\n  }\\n\\n  static Float(val: f64): Value {\\n    // Fast path for common float values (0.0, 1.0) to avoid allocations\\n    if (val == 0.0) {\\n      if (_zeroFloatSingleton === null) {\\n        const v = new Value();\\n        v.type = TYPE_FLOAT;\\n        v.floatVal = 0.0;\\n        _zeroFloatSingleton = v;\\n      }\\n      return _zeroFloatSingleton!;\\n    }\\n    if (val == 1.0) {\\n      if (_oneFloatSingleton === null) {\\n        const v = new Value();\\n        v.type = TYPE_FLOAT;\\n        v.floatVal = 1.0;\\n        _oneFloatSingleton = v;\\n      }\\n      return _oneFloatSingleton!;\\n    }\\n    const v = new Value();\\n    v.type = TYPE_FLOAT;\\n    v.floatVal = val;\\n    return v;\\n  }\\n\\n  static String(val: string): Value {\\n    // Fast path for empty string to avoid allocations\\n    if (val.length == 0) {\\n      if (_emptyStringSingleton === null) {\\n        const v = new Value();\\n        v.type = TYPE_STRING;\\n        v.stringVal = '';\\n        _emptyStringSingleton = v;\\n      }\\n      return _emptyStringSingleton!;\\n    }\\n    const v = new Value();\\n    v.type = TYPE_STRING;\\n    v.stringVal = val;\\n    return v;\\n  }\\n\\n  static Array(val: Array<Value>): Value {\\n    const v = new Value();\\n    v.type = TYPE_ARRAY;\\n    v.arrayVal = val;\\n    return v;\\n  }\\n\\n  static Object(val: Map<string, Value>): Value {\\n    const v = new Value();\\n    v.type = TYPE_OBJECT;\\n    v.objectVal = val;\\n    return v;\\n  }\\n\\n  // Type checking\\n  isNull(): bool {\\n    return this.type == TYPE_NULL;\\n  }\\n  isBool(): bool {\\n    return this.type == TYPE_BOOL;\\n  }\\n  isNumber(): bool {\\n    return this.type == TYPE_INT || this.type == TYPE_FLOAT;\\n  }\\n  isString(): bool {\\n    return this.type == TYPE_STRING;\\n  }\\n  isArray(): bool {\\n    return this.type == TYPE_ARRAY;\\n  }\\n  isObject(): bool {\\n    return this.type == TYPE_OBJECT;\\n  }\\n\\n  // Returning defaults (0, false, \\\"\\\") instead of throwing errors provides more\\n  // forgiving evaluation semantics matching JavaScript's type coercion behavior.\\n  asBool(): bool {\\n    return this.type == TYPE_BOOL ? this.boolVal : false;\\n  }\\n  asInt(): i64 {\\n    return this.type == TYPE_INT ? this.intVal : 0;\\n  }\\n  asFloat(): f64 {\\n    if (this.type == TYPE_FLOAT) return this.floatVal;\\n    if (this.type == TYPE_INT) return <f64>this.intVal;\\n    return 0.0;\\n  }\\n  asString(): string {\\n    // Convert value to string representation\\n    if (this.type == TYPE_STRING && this.stringVal != null) return this.stringVal!;\\n    if (this.type == TYPE_NULL) return '';\\n    if (this.type == TYPE_BOOL) return this.boolVal ? 'true' : 'false';\\n    if (this.type == TYPE_INT) return this.intVal.toString();\\n    if (this.type == TYPE_FLOAT) {\\n      // JavaScript developers expect \\\"3\\\" not \\\"3.0\\\" for integer-valued floats. We check if\\n      // the float is exactly representable as i64 (no fractional part, within range) and\\n      // format as integer in that case. Otherwise use AS's default float formatting.\\n      const f = this.floatVal;\\n      // Check if it's an integer\\n      if (f == <f64>(<i64>f) && f >= <f64>i64.MIN_VALUE && f <= <f64>i64.MAX_VALUE) {\\n        return (<i64>f).toString();\\n      }\\n      return f.toString();\\n    }\\n    return '';\\n  }\\n  asArray(): Array<Value> {\\n    return this.arrayVal != null ? this.arrayVal! : new Array<Value>();\\n  }\\n  asObject(): Map<string, Value> {\\n    return this.objectVal != null ? this.objectVal! : new Map<string, Value>();\\n  }\\n}\\n\\nexport type Result = Map<string, Value>;\\n\";\nexport const RUNTIME_CONTEXT = \"// assembly/runtime/context.ts (AssemblyScript)\\nimport { Value, TYPE_OBJECT } from './values';\\n\\n/**\\n * Stores cached path resolution metadata to avoid redundant string splitting\\n * and prefix matching on frequently-accessed paths.\\n */\\nclass PathResolutionCache {\\n  // Cache entry: stores the matched prefix key, its length, and the split parts for a given path\\n  prefixKey: string;\\n  prefixLen: i32;\\n  parts: string[];\\n\\n  constructor(prefixKey: string, prefixLen: i32, parts: string[]) {\\n    this.prefixKey = prefixKey;\\n    this.prefixLen = prefixLen;\\n    this.parts = parts;\\n  }\\n}\\n\\n/**\\n * Resolves a potentially dotted path against a data map with caching support.\\n *\\n * Keys like \\\"$nodes.expression2\\\" are stored as literal strings with dots in them,\\n * not as nested objects. This function handles both cases:\\n * 1. Exact key match (e.g., \\\"$nodes.expression2\\\")\\n * 2. Nested path (e.g., \\\"$nodes.expression2.L1\\\" where \\\"$nodes.expression2\\\" is a key\\n *    and \\\"L1\\\" is a property inside the object stored at that key)\\n *\\n * The algorithm finds the longest matching prefix in the data map, then navigates\\n * any remaining path segments through nested object properties.\\n *\\n * Performance: Uses an optional cache to avoid redundant path splitting and prefix\\n * matching for frequently-accessed paths within a single evaluation.\\n */\\nexport function resolvePathInData(\\n  data: Map<string, Value>,\\n  path: string,\\n  cache: Map<string, PathResolutionCache> | null = null,\\n): Value {\\n  // Check for exact key match first\\n  if (data.has(path)) {\\n    return data.get(path);\\n  }\\n\\n  // If no dot, the key doesn't exist\\n  if (!path.includes('.')) {\\n    return Value.Null();\\n  }\\n\\n  // Check cache if available\\n  let matchedPrefixLen: i32 = 0;\\n  let prefixKey: string = '';\\n  let parts: string[];\\n\\n  if (cache !== null && cache.has(path)) {\\n    // Cache hit - use cached resolution metadata AND cached parts array\\n    const cached = cache.get(path);\\n    prefixKey = cached.prefixKey;\\n    matchedPrefixLen = cached.prefixLen;\\n    parts = cached.parts;\\n  } else {\\n    // Cache miss - perform full path resolution\\n    parts = path.split('.');\\n\\n    // Try progressively longer prefixes to find a matching key\\n    // e.g., for \\\"$nodes.expression2.L1\\\", try:\\n    //   1. \\\"$nodes\\\" (no match)\\n    //   2. \\\"$nodes.expression2\\\" (match! then access .L1 inside)\\n    let currentPrefix = '';\\n    for (let i = 0; i < parts.length; i++) {\\n      if (i > 0) currentPrefix += '.';\\n      currentPrefix += parts[i];\\n      if (data.has(currentPrefix)) {\\n        matchedPrefixLen = i + 1;\\n        prefixKey = currentPrefix;\\n      }\\n    }\\n\\n    // Store in cache if available (including the parts array to avoid future splits)\\n    if (cache !== null) {\\n      cache.set(path, new PathResolutionCache(prefixKey, matchedPrefixLen, parts));\\n    }\\n  }\\n\\n  // If no prefix matched, path doesn't exist\\n  if (matchedPrefixLen == 0) {\\n    return Value.Null();\\n  }\\n\\n  // Get the value at the matched prefix\\n  let current = data.get(prefixKey);\\n\\n  // Navigate remaining parts as object properties\\n  for (let i = matchedPrefixLen; i < parts.length; i++) {\\n    if (!current.isObject()) return Value.Null();\\n    const obj = current.asObject();\\n    const key = parts[i];\\n    if (!obj.has(key)) return Value.Null();\\n    current = obj.get(key);\\n  }\\n  return current;\\n}\\n\\nexport class Context {\\n  data: Map<string, Value>;\\n  // Cache for decision node results to avoid redundant evaluation. Caching prevents\\n  // exponential evaluation time for DAG structures where multiple nodes reference\\n  // the same upstream computation.\\n  decisionResults: Map<string, Value>;\\n  // Stack to track currently evaluating decisions for recursion detection\\n  decisionStack: string[];\\n  // When merging results, we need to know which keys are original inputs (should be\\n  // preserved) vs computed outputs (may be overwritten). This prevents input shadowing.\\n  inputKeys: Set<string>;\\n  // Cache for path resolution to avoid redundant string splitting and prefix matching.\\n  // For decisions with many field accesses (e.g., 100-rule decision table with 5 inputs\\n  // per rule = 500 path lookups), this eliminates most splitting overhead.\\n  pathCache: Map<string, PathResolutionCache>;\\n\\n  constructor(input: Map<string, Value>) {\\n    this.data = input;\\n    this.decisionResults = new Map<string, Value>();\\n    this.decisionStack = new Array<string>();\\n    this.pathCache = new Map<string, PathResolutionCache>();\\n    // Store original input keys\\n    this.inputKeys = new Set<string>();\\n    const keys = input.keys();\\n    for (let i = 0; i < keys.length; i++) {\\n      this.inputKeys.add(keys[i]);\\n    }\\n  }\\n\\n  // Unlike JS Map which returns undefined for missing keys, AS Map.get() throws.\\n  // We must check has() first or handle dots carefully to avoid runtime errors.\\n  get(path: string): Value {\\n    return resolvePathInData(this.data, path, this.pathCache);\\n  }\\n\\n  set(path: string, value: Value): void {\\n    this.data.set(path, value);\\n  }\\n\\n  // Merge another result into this context (for passthrough mode)\\n  merge(other: Map<string, Value>): void {\\n    const keys = other.keys();\\n    for (let i = 0; i < keys.length; i++) {\\n      const key = keys[i];\\n      this.data.set(key, other.get(key));\\n    }\\n  }\\n\\n  // Convert the context data to a Value (for passthrough sub-decisions)\\n  toValue(): Value {\\n    return Value.Object(this.data);\\n  }\\n}\\n\\n/**\\n * ScopedContext is a lightweight context wrapper for scoped expression evaluation.\\n * Scoped evaluation (loops, sub-object navigation) needs simple Map-based get/set\\n * without decision caching/recursion tracking. Separate class avoids polluting\\n * Context with unnecessary state and provides clearer semantics.\\n *\\n * Used for:\\n * - inputField scoping (expressions evaluated within a sub-object scope)\\n * - executionMode: \\\"loop\\\" (expressions evaluated for each array item)\\n *\\n * Performance: Includes path caching for loop-mode expressions where the same paths\\n * are accessed repeatedly across array items.\\n */\\nexport class ScopedContext {\\n  data: Map<string, Value>;\\n  // Path resolution cache for frequently-accessed paths in loops\\n  pathCache: Map<string, PathResolutionCache>;\\n\\n  constructor(data: Map<string, Value>) {\\n    this.data = data;\\n    this.pathCache = new Map<string, PathResolutionCache>();\\n  }\\n\\n  get(path: string): Value {\\n    return resolvePathInData(this.data, path, this.pathCache);\\n  }\\n\\n  set(path: string, value: Value): void {\\n    this.data.set(path, value);\\n  }\\n}\\n\";\nexport const RUNTIME_EXPRESSIONS = \"// assembly/runtime/expressions.ts (AssemblyScript)\\nimport { Value, TYPE_ARRAY, TYPE_STRING, TYPE_FLOAT, TYPE_INT, TYPE_BOOL } from './values';\\n\\n/**\\n * Helper function to create an argument array.\\n * AssemblyScript doesn't support true variadic functions or rest parameters, so we provide\\n * fixed-arity helpers (makeArgs1, makeArgs2, makeArgs3) for common function arities.\\n *\\n * These use thread-local reusable arrays to avoid allocations in hot paths.\\n * Since WASM evaluation is single-threaded, reusing arrays is safe.\\n */\\n\\n// Reusable argument arrays - lazily initialized\\nlet _args1: Array<Value> | null = null;\\nlet _args2: Array<Value> | null = null;\\nlet _args3: Array<Value> | null = null;\\n\\nexport function makeArgs(a: Value, b: Value, c: Value = Value.Null()): Array<Value> {\\n  if (_args3 === null) {\\n    _args3 = new Array<Value>(3);\\n  }\\n  unchecked((_args3![0] = a));\\n  unchecked((_args3![1] = b));\\n  unchecked((_args3![2] = c));\\n  return _args3!;\\n}\\n\\nexport function makeArgs1(a: Value): Array<Value> {\\n  if (_args1 === null) {\\n    _args1 = new Array<Value>(1);\\n  }\\n  unchecked((_args1![0] = a));\\n  return _args1!;\\n}\\n\\nexport function makeArgs2(a: Value, b: Value): Array<Value> {\\n  if (_args2 === null) {\\n    _args2 = new Array<Value>(2);\\n  }\\n  unchecked((_args2![0] = a));\\n  unchecked((_args2![1] = b));\\n  return _args2!;\\n}\\n\\nexport function makeArgs3(a: Value, b: Value, c: Value): Array<Value> {\\n  if (_args3 === null) {\\n    _args3 = new Array<Value>(3);\\n  }\\n  unchecked((_args3![0] = a));\\n  unchecked((_args3![1] = b));\\n  unchecked((_args3![2] = c));\\n  return _args3!;\\n}\\n\\n// Type alias for function handlers\\ntype FunctionHandler = (args: Array<Value>) => Value;\\n\\n// Global function registry - Map provides O(1) lookup instead of O(n) if-else chain\\nconst functionRegistry = new Map<string, FunctionHandler>();\\n\\n/**\\n * Initialize the function registry with all built-in functions.\\n * This is called once at module initialization.\\n */\\nfunction initializeFunctionRegistry(): void {\\n  // Array functions\\n  functionRegistry.set('sum', (args: Array<Value>): Value => sumArray(args[0]));\\n  functionRegistry.set('avg', (args: Array<Value>): Value => avgArray(args[0]));\\n  functionRegistry.set('min', (args: Array<Value>): Value => minArray(args[0]));\\n  functionRegistry.set('max', (args: Array<Value>): Value => maxArray(args[0]));\\n  functionRegistry.set('sort', (args: Array<Value>): Value => sortArray(args[0]));\\n\\n  // Flatten has two aliases\\n  const flatHandler = (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    return flatArray(args[0], arg1);\\n  };\\n  functionRegistry.set('flat', flatHandler);\\n  functionRegistry.set('flatten', flatHandler);\\n\\n  // Count/length has two aliases\\n  const lengthHandler = (args: Array<Value>): Value => lengthOf(args[0]);\\n  functionRegistry.set('count', lengthHandler);\\n  functionRegistry.set('len', lengthHandler);\\n\\n  functionRegistry.set('contains', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    return containsValue(args[0], arg1);\\n  });\\n\\n  // Type conversion functions\\n  functionRegistry.set('number', (args: Array<Value>): Value => numberValue(args[0]));\\n  functionRegistry.set('string', (args: Array<Value>): Value => stringValue(args[0]));\\n\\n  // Math functions\\n  functionRegistry.set('abs', (args: Array<Value>): Value => absValue(args[0]));\\n  functionRegistry.set('floor', (args: Array<Value>): Value => floorValue(args[0]));\\n  functionRegistry.set('ceil', (args: Array<Value>): Value => ceilValue(args[0]));\\n  functionRegistry.set('round', (args: Array<Value>): Value => roundValue(args[0]));\\n\\n  // String functions\\n  functionRegistry.set('upper', (args: Array<Value>): Value => upperString(args[0]));\\n  functionRegistry.set('lower', (args: Array<Value>): Value => lowerString(args[0]));\\n  functionRegistry.set('trim', (args: Array<Value>): Value => trimString(args[0]));\\n\\n  functionRegistry.set('substring', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    const arg2 = args.length >= 3 ? args[2] : Value.Null();\\n    return substringString(args[0], arg1, arg2);\\n  });\\n\\n  functionRegistry.set('indexOf', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    const arg2 = args.length >= 3 ? args[2] : Value.Null();\\n    return indexOfString(args[0], arg1, arg2.isNull() ? Value.Int(<i64>0) : arg2);\\n  });\\n\\n  functionRegistry.set('startsWith', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    return startsWithString(args[0], arg1);\\n  });\\n\\n  functionRegistry.set('endsWith', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    return endsWithString(args[0], arg1);\\n  });\\n\\n  functionRegistry.set('split', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    return splitString(args[0], arg1);\\n  });\\n\\n  functionRegistry.set('join', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    return joinArray(args[0], arg1);\\n  });\\n\\n  functionRegistry.set('replace', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    const arg2 = args.length >= 3 ? args[2] : Value.Null();\\n    return replaceString(args[0], arg1, arg2);\\n  });\\n\\n  functionRegistry.set('replaceAll', (args: Array<Value>): Value => {\\n    const arg1 = args.length >= 2 ? args[1] : Value.Null();\\n    const arg2 = args.length >= 3 ? args[2] : Value.Null();\\n    return replaceAllString(args[0], arg1, arg2);\\n  });\\n\\n  // Date/time functions\\n  functionRegistry.set('date', (args: Array<Value>): Value => parseDate(args[0]));\\n\\n  // now() returns 0 because WASM doesn't have direct access to system time in a sandboxed way.\\n  // To get the current timestamp, use date(\\\"now\\\") instead, which uses Date.now().\\n  functionRegistry.set('now', (args: Array<Value>): Value => Value.Float(0));\\n\\n  functionRegistry.set('time', (args: Array<Value>): Value => parseTime(args[0]));\\n  functionRegistry.set('duration', (args: Array<Value>): Value => parseDuration(args[0]));\\n\\n  // Object functions\\n  functionRegistry.set('values', (args: Array<Value>): Value => objectValues(args[0]));\\n  functionRegistry.set('keys', (args: Array<Value>): Value => objectKeys(args[0]));\\n}\\n\\n// Initialize the registry immediately\\ninitializeFunctionRegistry();\\n\\n/**\\n * Evaluate built-in functions.\\n * All inputs and outputs use the Value tagged union.\\n *\\n * Uses a Map-based registry for O(1) function lookup instead of O(n) if-else chain.\\n */\\nexport function evaluateFunction(name: string, args: Array<Value>): Value {\\n  // Safety check for args array\\n  if (args == null || args.length == 0) return Value.Null();\\n\\n  // Look up handler in the registry\\n  if (functionRegistry.has(name)) {\\n    const handler = functionRegistry.get(name);\\n    return handler(args);\\n  }\\n\\n  // Unknown function - return null\\n  return Value.Null();\\n}\\n\\n// === Object Functions ===\\n\\n/**\\n * Get all values from an object as an array.\\n * If the input is not an object, returns an empty array.\\n */\\nexport function objectValues(val: Value): Value {\\n  if (!val.isObject()) return Value.Array(new Array<Value>(0));\\n  const obj = val.asObject();\\n  const keys = obj.keys();\\n  const result = new Array<Value>(keys.length);\\n  for (let i = 0; i < keys.length; i++) {\\n    unchecked((result[i] = obj.get(unchecked(keys[i]))));\\n  }\\n  return Value.Array(result);\\n}\\n\\n/**\\n * Get all keys from an object as an array of strings.\\n * If the input is not an object, returns an empty array.\\n */\\nexport function objectKeys(val: Value): Value {\\n  if (!val.isObject()) return Value.Array(new Array<Value>(0));\\n  const obj = val.asObject();\\n  const keys = obj.keys();\\n  const result = new Array<Value>(keys.length);\\n  for (let i = 0; i < keys.length; i++) {\\n    unchecked((result[i] = Value.String(unchecked(keys[i]))));\\n  }\\n  return Value.Array(result);\\n}\\n\\n// === Array Functions ===\\n\\nexport function sumArray(val: Value): Value {\\n  if (!val.isArray()) return Value.Float(0.0);\\n  const arr = val.asArray();\\n  let total: f64 = 0.0;\\n  for (let i = 0; i < arr.length; i++) {\\n    total += unchecked(arr[i]).asFloat();\\n  }\\n  return Value.Float(total);\\n}\\n\\nexport function minArray(val: Value): Value {\\n  if (!val.isArray()) return Value.Null();\\n  const arr = val.asArray();\\n  if (arr.length == 0) return Value.Null();\\n  let min = arr[0].asFloat();\\n  for (let i = 1; i < arr.length; i++) {\\n    const v = unchecked(arr[i]).asFloat();\\n    if (v < min) min = v;\\n  }\\n  return Value.Float(min);\\n}\\n\\nexport function maxArray(val: Value): Value {\\n  if (!val.isArray()) return Value.Null();\\n  const arr = val.asArray();\\n  if (arr.length == 0) return Value.Null();\\n  let max = arr[0].asFloat();\\n  for (let i = 1; i < arr.length; i++) {\\n    const v = unchecked(arr[i]).asFloat();\\n    if (v > max) max = v;\\n  }\\n  return Value.Float(max);\\n}\\n\\nexport function avgArray(val: Value): Value {\\n  if (!val.isArray()) return Value.Null();\\n  const arr = val.asArray();\\n  if (arr.length == 0) return Value.Null();\\n  let total: f64 = 0.0;\\n  for (let i = 0; i < arr.length; i++) {\\n    total += unchecked(arr[i]).asFloat();\\n  }\\n  return Value.Float(total / <f64>arr.length);\\n}\\n\\n/**\\n * Sort an array in ascending order.\\n *\\n * Supports sorting numbers and strings in ascending order.\\n * Creates and returns a new sorted array without modifying the original.\\n *\\n * Parameters:\\n * - val: The array value to sort\\n *\\n * Behavior:\\n * - Numbers: sorted in ascending numeric order\\n * - Strings: sorted in lexicographic (ASCII) order\\n * - Empty arrays: returns a new empty array\\n * - Non-array inputs: returns null\\n *\\n * Examples:\\n * - sortArray([3, 1, 2]) -> [1, 2, 3]\\n * - sortArray([\\\"c\\\", \\\"a\\\", \\\"b\\\"]) -> [\\\"a\\\", \\\"b\\\", \\\"c\\\"]\\n * - sortArray([]) -> []\\n *\\n * @param val - The array value to sort\\n * @returns A new sorted array, or null for invalid input\\n */\\nexport function sortArray(val: Value): Value {\\n  if (!val.isArray()) return Value.Null();\\n  const arr = val.asArray();\\n\\n  // Create a copy of the array to avoid mutating the original\\n  const sorted = new Array<Value>(arr.length);\\n  for (let i = 0; i < arr.length; i++) {\\n    unchecked((sorted[i] = unchecked(arr[i])));\\n  }\\n\\n  // Sort the copy using the compareValues function\\n  sorted.sort((a: Value, b: Value): i32 => compareValues(a, b));\\n\\n  return Value.Array(sorted);\\n}\\n\\n/**\\n * Flatten nested arrays into a single-level array.\\n *\\n * Parameters:\\n * - val: The array value to flatten\\n * - depthVal: Optional depth (default: 1). Specifies how many levels deep to flatten.\\n *\\n * Behavior:\\n * - If depth is 0, returns a shallow copy of the array\\n * - Flattens arrays recursively up to the specified depth\\n * - Empty arrays are returned as empty arrays\\n * - Non-array inputs return null\\n *\\n * Examples:\\n * - flatArray([[1, 2], [3, 4]]) -> [1, 2, 3, 4] (depth 1)\\n * - flatArray([1, [2, [3]]]) -> [1, 2, [3]] (depth 1)\\n * - flatArray([1, [2, [3]]], 2) -> [1, 2, 3] (depth 2)\\n * - flatArray([1, 2, 3]) -> [1, 2, 3] (no nesting, shallow copy)\\n * - flatArray([]) -> [] (empty array)\\n * - flatArray([[1], [2]], 0) -> [[1], [2]] (depth 0, no flattening)\\n *\\n * @param val - The array value to flatten\\n * @param depthVal - Optional depth for flattening (default: 1)\\n * @returns A new flattened array, or null for invalid input\\n */\\nexport function flatArray(val: Value, depthVal: Value = Value.Int(<i64>1)): Value {\\n  if (!val.isArray()) return Value.Null();\\n  const arr = val.asArray();\\n\\n  // Parse depth parameter matches JavaScript Array.flat() default behavior, which\\n  // flattens one level deep unless specified otherwise. Most common use case.\\n  let depth: i32 = 1;\\n  if (!depthVal.isNull() && depthVal.isNumber()) {\\n    depth = <i32>depthVal.asFloat(); // Use asFloat() since numbers may come as floats\\n    // Clamp depth to non-negative values\\n    if (depth < 0) depth = 1;\\n  }\\n\\n  // Use a simple iterative approach that maintains order\\n  let result = new Array<Value>();\\n  flattenRecursive(arr, depth, result);\\n  return Value.Array(result);\\n}\\n\\n// Helper function for flatArray\\nfunction flattenRecursive(arr: Array<Value>, currentDepth: i32, result: Array<Value>): void {\\n  for (let i = 0; i < arr.length; i++) {\\n    const element = unchecked(arr[i]);\\n    if (element.isArray() && currentDepth > 0) {\\n      // Recursively flatten nested array\\n      flattenRecursive(element.asArray(), currentDepth - 1, result);\\n    } else {\\n      // Add element to results\\n      result.push(element);\\n    }\\n  }\\n}\\n\\nexport function lengthOf(val: Value): Value {\\n  if (val.isArray()) {\\n    return Value.Int(<i64>val.asArray().length);\\n  }\\n  if (val.isString()) {\\n    return Value.Int(<i64>val.asString().length);\\n  }\\n  return Value.Int(0);\\n}\\n\\n/**\\n * Check if a value contains a subvalue.\\n *\\n * For strings: checks if the string contains a given substring.\\n * For arrays: checks if the array contains the given value.\\n *\\n * Parameters:\\n * - container: The string or array to search in\\n * - needle: The substring or value to search for\\n *\\n * Behavior:\\n * - If container is a string, checks if it contains the substring\\n * - If container is an array, checks if any element equals the needle\\n * - For strings, returns null if either argument is not a string\\n * - For arrays, always returns a boolean\\n *\\n * String Examples:\\n * - contains(\\\"hello world\\\", \\\"world\\\") → true\\n * - contains(\\\"hello world\\\", \\\"xyz\\\") → false\\n * - contains(\\\"abc\\\", \\\"abc\\\") → true\\n * - contains(\\\"hello\\\", \\\"\\\") → true (empty string is always contained)\\n * - contains(\\\"\\\", \\\"\\\") → true\\n * - contains(\\\"\\\", \\\"x\\\") → false\\n * - contains(\\\"Hello\\\", \\\"hello\\\") → false (case-sensitive)\\n * - contains(\\\"hello\\\", 123) → null (needle not a string)\\n * - contains(123, \\\"hello\\\") → null (container not a string)\\n *\\n * Array Examples:\\n * - contains([1, 2, 3], 2) → true\\n * - contains([1, 2, 3], 4) → false\\n * - contains([\\\"a\\\"], \\\"a\\\") → true\\n * - contains(123, 1) → false\\n *\\n * @param container - The string or array to search in\\n * @param needle - The substring or value to search for\\n * @returns true if contained, false if not, or null for invalid string arguments\\n */\\nexport function containsValue(container: Value, needle: Value): Value {\\n  // Handle string containment\\n  if (container.isString()) {\\n    if (!needle.isString()) return Value.Null();\\n    const str = container.asString();\\n    const search = needle.asString();\\n    // Use indexOf to check containment (returns -1 if not found)\\n    const index = str.indexOf(search);\\n    return Value.Bool(index >= 0);\\n  }\\n\\n  // Handle array containment (original behavior)\\n  if (!container.isArray()) return Value.Bool(false);\\n  const arr = container.asArray();\\n  for (let i = 0; i < arr.length; i++) {\\n    if (valuesEqual(unchecked(arr[i]), needle)) return Value.Bool(true);\\n  }\\n  return Value.Bool(false);\\n}\\n\\n// === Date/Time Functions ===\\n\\n/**\\n * Parse a date string into a numeric timestamp.\\n *\\n * Supports ISO 8601 date format: YYYY-MM-DD or YYYY-MM-DDTHH:MM:SS[Z|+/-HH:MM]\\n * Returns Unix timestamp in seconds since epoch (1970-01-01 00:00:00 UTC).\\n * This matches zen-engine's behavior and allows date arithmetic operations.\\n *\\n * Examples:\\n * - date(\\\"2025-03-20T10:30:00Z\\\") → 1742466600 (seconds since epoch)\\n * - date(\\\"1970-01-01\\\") → 0\\n * - date(\\\"1970-01-01T00:00:00Z\\\") → 0\\n *\\n * @param val - A string value containing a date\\n * @returns A float Value representing seconds since epoch, or Null for invalid input\\n */\\nexport function parseDate(val: Value): Value {\\n  if (!val.isString()) return Value.Null();\\n\\n  const str = val.asString();\\n\\n  // Handle special 'now' keyword - returns Unix timestamp in seconds\\n  // Using Date.now() which returns milliseconds, convert to seconds\\n  if (str == 'now') {\\n    return Value.Float(<f64>Date.now() / 1000.0);\\n  }\\n\\n  // Fast path for simple YYYY-MM-DD format (10 characters)\\n  // This avoids string allocations from split() and substring() for common cases\\n  if (str.length == 10) {\\n    // Check dash positions at indices 4 and 7\\n    const dashPos1 = unchecked(<i32>str.charCodeAt(4));\\n    const dashPos2 = unchecked(<i32>str.charCodeAt(7));\\n    if (dashPos1 == 45 && dashPos2 == 45) {\\n      // Hyphen is ASCII 45, digits start at ASCII 48\\n      // Parse year, month, day directly without split()\\n      const year =\\n        unchecked(<i32>str.charCodeAt(0) - 48) * 1000 +\\n        unchecked(<i32>str.charCodeAt(1) - 48) * 100 +\\n        unchecked(<i32>str.charCodeAt(2) - 48) * 10 +\\n        unchecked(<i32>str.charCodeAt(3) - 48);\\n      const month =\\n        unchecked(<i32>str.charCodeAt(5) - 48) * 10 + unchecked(<i32>str.charCodeAt(6) - 48);\\n      const day =\\n        unchecked(<i32>str.charCodeAt(8) - 48) * 10 + unchecked(<i32>str.charCodeAt(9) - 48);\\n\\n      // Validate ranges\\n      if (year >= 0 && month >= 1 && month <= 12 && day >= 1 && day <= 31) {\\n        const daysSinceEpoch = calculateDaysSinceEpoch(year, month, day);\\n        return Value.Float(<f64>daysSinceEpoch * 86400.0);\\n      }\\n    }\\n  }\\n\\n  // Parse ISO 8601 date format: YYYY-MM-DD\\n  // Also handle datetime format: YYYY-MM-DDTHH:MM:SS[Z|+/-HH:MM]\\n  let dateStr = str;\\n  let timeStr = '';\\n  let tzOffsetSeconds: i32 = 0; // Timezone offset in seconds (positive = ahead of UTC)\\n\\n  const tIndex = str.indexOf('T');\\n  if (tIndex >= 0) {\\n    dateStr = str.substring(0, tIndex);\\n    let timePart = str.substring(tIndex + 1);\\n\\n    // Handle timezone: Z, +HH:MM, -HH:MM\\n    const zIndex = timePart.indexOf('Z');\\n    if (zIndex >= 0) {\\n      timeStr = timePart.substring(0, zIndex);\\n      tzOffsetSeconds = 0; // UTC\\n    } else {\\n      const plusIndex = timePart.indexOf('+');\\n      const minusIndex = timePart.indexOf('-');\\n      // Find timezone offset (look for +/- after the time part, not in middle of time)\\n      let tzStartIndex = -1;\\n      if (plusIndex >= 5) {\\n        // At least HH:MM before timezone\\n        tzStartIndex = plusIndex;\\n      } else if (minusIndex >= 5) {\\n        tzStartIndex = minusIndex;\\n      }\\n\\n      if (tzStartIndex >= 0) {\\n        timeStr = timePart.substring(0, tzStartIndex);\\n        const tzStr = timePart.substring(tzStartIndex);\\n        // Parse timezone offset (+/-HH:MM or +/-HH)\\n        const isNegative = tzStr.charAt(0) == '-';\\n        const tzParts = tzStr.substring(1).split(':');\\n        if (tzParts.length >= 1) {\\n          const tzHours = parseIntValue(tzParts[0]);\\n          const tzMinutes = tzParts.length >= 2 ? parseIntValue(tzParts[1]) : 0;\\n          if (tzHours >= 0 && tzMinutes >= 0) {\\n            tzOffsetSeconds = tzHours * 3600 + tzMinutes * 60;\\n            if (isNegative) tzOffsetSeconds = -tzOffsetSeconds;\\n          }\\n        }\\n      } else {\\n        timeStr = timePart;\\n      }\\n    }\\n  }\\n\\n  // Split date by dash\\n  const parts = dateStr.split('-');\\n  if (parts.length < 3) return Value.Null();\\n\\n  // Parse year, month, day\\n  const year = parseIntValue(parts[0]);\\n  const month = parseIntValue(parts[1]);\\n  const day = parseIntValue(parts[2]);\\n\\n  if (year < 0 || month < 1 || month > 12 || day < 1 || day > 31) {\\n    return Value.Null();\\n  }\\n\\n  // Calculate days since epoch\\n  const daysSinceEpoch = calculateDaysSinceEpoch(year, month, day);\\n\\n  // Parse time if present (HH:MM:SS or HH:MM)\\n  let hours: i32 = 0;\\n  let minutes: i32 = 0;\\n  let seconds: i32 = 0;\\n\\n  if (timeStr.length > 0) {\\n    const timeParts = timeStr.split(':');\\n    if (timeParts.length >= 2) {\\n      hours = parseIntValue(timeParts[0]);\\n      minutes = parseIntValue(timeParts[1]);\\n      if (timeParts.length >= 3) {\\n        // Handle fractional seconds (e.g., \\\"10:30:00.123\\\")\\n        const secStr = timeParts[2];\\n        const dotIndex = secStr.indexOf('.');\\n        if (dotIndex >= 0) {\\n          seconds = parseIntValue(secStr.substring(0, dotIndex));\\n        } else {\\n          seconds = parseIntValue(secStr);\\n        }\\n      }\\n    }\\n    if (hours < 0 || hours > 23 || minutes < 0 || minutes > 59 || seconds < 0 || seconds > 59) {\\n      // Invalid time - use 0\\n      hours = 0;\\n      minutes = 0;\\n      seconds = 0;\\n    }\\n  }\\n\\n  // Calculate total seconds since epoch\\n  // daysSinceEpoch * 86400 + hours * 3600 + minutes * 60 + seconds - tzOffsetSeconds\\n  // We subtract tzOffsetSeconds to convert local time to UTC\\n  const totalSeconds: f64 =\\n    <f64>daysSinceEpoch * 86400.0 +\\n    <f64>hours * 3600.0 +\\n    <f64>minutes * 60.0 +\\n    <f64>seconds -\\n    <f64>tzOffsetSeconds;\\n\\n  return Value.Float(totalSeconds);\\n}\\n\\n/**\\n * Parse a time string into a numeric value.\\n *\\n * Supports format: HH:MM:SS or HH:MM\\n * Returns the number of seconds since midnight.\\n *\\n * @param val - A string value containing a time\\n * @returns A float Value representing seconds since midnight\\n */\\nexport function parseTime(val: Value): Value {\\n  if (!val.isString()) return Value.Null();\\n\\n  const str = val.asString();\\n  const parts = str.split(':');\\n\\n  if (parts.length < 2) return Value.Null();\\n\\n  const hours = parseIntValue(parts[0]);\\n  const minutes = parseIntValue(parts[1]);\\n  const seconds = parts.length >= 3 ? parseIntValue(parts[2]) : 0;\\n\\n  if (hours < 0 || hours > 23 || minutes < 0 || minutes > 59 || seconds < 0 || seconds > 59) {\\n    return Value.Null();\\n  }\\n\\n  const totalSeconds = hours * 3600 + minutes * 60 + seconds;\\n  return Value.Float(<f64>totalSeconds);\\n}\\n\\n/**\\n * Parse a duration string into a numeric value.\\n *\\n * Supports ISO 8601 duration format: P[n]Y[n]M[n]DT[n]H[n]M[n]S\\n * Also supports simple formats like \\\"30d\\\", \\\"24h\\\", \\\"60m\\\", \\\"3600s\\\"\\n *\\n * @param val - A string value containing a duration\\n * @returns A float Value representing duration in seconds\\n */\\nexport function parseDuration(val: Value): Value {\\n  if (!val.isString()) return Value.Null();\\n\\n  const str = val.asString();\\n\\n  // Handle simple formats: \\\"30d\\\", \\\"24h\\\", \\\"60m\\\", \\\"3600s\\\"\\n  if (str.length > 1) {\\n    const unit = str.charAt(str.length - 1);\\n    const numStr = str.substring(0, str.length - 1);\\n    const num = parseFloatValue(numStr);\\n\\n    if (num >= 0) {\\n      if (unit == 's') return Value.Float(num);\\n      if (unit == 'm') return Value.Float(num * 60);\\n      if (unit == 'h') return Value.Float(num * 3600);\\n      if (unit == 'd') return Value.Float(num * 86400);\\n    }\\n  }\\n\\n  // Full ISO 8601 duration format (P[n]Y[n]M[n]DT[n]H[n]M[n]S) not yet supported\\n  return Value.Null();\\n}\\n\\n/**\\n * Parse a string to an integer value.\\n */\\nfunction parseIntValue(str: string): i32 {\\n  let result: i32 = 0;\\n  let negative = false;\\n  let i = 0;\\n\\n  // Handle leading whitespace\\n  while (i < str.length && str.charCodeAt(i) == 32) {\\n    i++;\\n  }\\n\\n  // Handle negative sign\\n  if (i < str.length && str.charCodeAt(i) == 45) {\\n    // '-'\\n    negative = true;\\n    i++;\\n  }\\n\\n  // Parse digits\\n  let hasDigits = false;\\n  while (i < str.length) {\\n    const c = str.charCodeAt(i);\\n    if (c >= 48 && c <= 57) {\\n      // '0'-'9'\\n      result = result * 10 + (c - 48);\\n      hasDigits = true;\\n      i++;\\n    } else {\\n      break;\\n    }\\n  }\\n\\n  // AssemblyScript doesn't have optional types or Result<T,E>, so we use -1 as sentinel\\n  // value for parse errors. Callers check for negative values to detect failures.\\n  if (!hasDigits) return -1;\\n\\n  return negative ? -result : result;\\n}\\n\\n/**\\n * Parse a string to a float value.\\n * Returns NaN for invalid input.\\n */\\nfunction parseFloatValue(str: string): f64 {\\n  return parseFloat(str);\\n}\\n\\n/**\\n * Calculate days since Unix epoch (1970-01-01).\\n * Uses a simplified algorithm that handles leap years.\\n */\\nfunction calculateDaysSinceEpoch(year: i32, month: i32, day: i32): i32 {\\n  // Days in each month (non-leap year)\\n  const daysInMonth: i32[] = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\\n\\n  // Calculate days from years\\n  let days: i32 = 0;\\n\\n  // Calculate years from 1970 to target year\\n  if (year >= 1970) {\\n    for (let y = 1970; y < year; y++) {\\n      days += isLeapYear(y) ? 366 : 365;\\n    }\\n  } else {\\n    for (let y = year; y < 1970; y++) {\\n      days -= isLeapYear(y) ? 366 : 365;\\n    }\\n  }\\n\\n  // Add days from months\\n  for (let m = 1; m < month; m++) {\\n    days += unchecked(daysInMonth[m - 1]);\\n    // Add leap day for February in leap years\\n    if (m == 2 && isLeapYear(year)) {\\n      days += 1;\\n    }\\n  }\\n\\n  // Add days\\n  days += day - 1; // day 1 is the first day, so subtract 1\\n\\n  return days;\\n}\\n\\n/**\\n * Check if a year is a leap year.\\n */\\nfunction isLeapYear(year: i32): bool {\\n  return (year % 4 == 0 && year % 100 != 0) || year % 400 == 0;\\n}\\n\\n// === Math Functions ===\\n\\nexport function absValue(val: Value): Value {\\n  if (val.isNumber()) {\\n    const n = val.asFloat();\\n    return Value.Float(n < 0 ? -n : n);\\n  }\\n  return Value.Null();\\n}\\n\\nexport function floorValue(val: Value): Value {\\n  if (val.isNumber()) {\\n    return Value.Float(Math.floor(val.asFloat()));\\n  }\\n  return Value.Null();\\n}\\n\\nexport function ceilValue(val: Value): Value {\\n  if (val.isNumber()) {\\n    return Value.Float(Math.ceil(val.asFloat()));\\n  }\\n  return Value.Null();\\n}\\n\\nexport function roundValue(val: Value): Value {\\n  if (val.isNumber()) {\\n    return Value.Float(Math.round(val.asFloat()));\\n  }\\n  return Value.Null();\\n}\\n\\n// === String Functions ===\\n\\n/**\\n * Convert a string to uppercase.\\n *\\n * Non-alphabetic characters (numbers, symbols, spaces) remain unchanged.\\n * If the input is not a string, returns null.\\n *\\n * Examples:\\n * - upper(\\\"hello\\\") → \\\"HELLO\\\"\\n * - upper(\\\"Hello World\\\") → \\\"HELLO WORLD\\\"\\n * - upper(\\\"123abc\\\") → \\\"123ABC\\\"\\n * - upper(\\\"!@#\\\") → \\\"!@#\\\"\\n * - upper(123) → null\\n * - upper(null) → null\\n *\\n * @param val - The value to convert to uppercase\\n * @returns The uppercase string, or null if input is not a string\\n */\\nexport function upperString(val: Value): Value {\\n  if (!val.isString()) return Value.Null();\\n  const str = val.asString();\\n  return Value.String(str.toUpperCase());\\n}\\n\\n/**\\n * Convert a string to lowercase.\\n *\\n * Non-alphabetic characters (numbers, symbols, spaces) remain unchanged.\\n * If the input is not a string, returns null.\\n *\\n * Examples:\\n * - lower(\\\"HELLO\\\") → \\\"hello\\\"\\n * - lower(\\\"Hello World\\\") → \\\"hello world\\\"\\n * - lower(\\\"123ABC\\\") → \\\"123abc\\\"\\n * - lower(\\\"!@#\\\") → \\\"!@#\\\"\\n * - lower(123) → null\\n * - lower(null) → null\\n *\\n * @param val - The value to convert to lowercase\\n * @returns The lowercase string, or null if input is not a string\\n */\\nexport function lowerString(val: Value): Value {\\n  if (!val.isString()) return Value.Null();\\n  const str = val.asString();\\n  return Value.String(str.toLowerCase());\\n}\\n\\n/**\\n * Remove leading and trailing whitespace from a string.\\n *\\n * Whitespace includes spaces, tabs, newlines, and other whitespace characters.\\n * If the input is not a string, returns null.\\n *\\n * Examples:\\n * - trim(\\\"  hello  \\\") → \\\"hello\\\"\\n * - trim(\\\"\\\\t\\\\nhello\\\\n\\\\t\\\") → \\\"hello\\\"\\n * - trim(\\\"hello\\\") → \\\"hello\\\" (no change)\\n * - trim(\\\"  hello world  \\\") → \\\"hello world\\\"\\n * - trim(\\\"\\\") → \\\"\\\" (empty string)\\n * - trim(\\\"   \\\") → \\\"\\\" (only whitespace)\\n * - trim(123) → null\\n * - trim(null) → null\\n *\\n * @param val - The value to trim whitespace from\\n * @returns The trimmed string, or null if input is not a string\\n */\\nexport function trimString(val: Value): Value {\\n  if (!val.isString()) return Value.Null();\\n  const str = val.asString();\\n  return Value.String(str.trim());\\n}\\n\\n/**\\n * Extract a portion of a string.\\n *\\n * Returns a substring starting at the specified index and optionally\\n * ending at the specified index (or length).\\n *\\n * Parameters:\\n * - str: The input string\\n * - start: The starting index (0-based, inclusive)\\n * - endOrLength: Optional end index (exclusive) or length. If omitted,\\n *       extracts from start to the end of the string.\\n *\\n * Behavior:\\n * - If start is negative, it's treated as an offset from the end of the string\\n * - If start < 0, it's clamped to 0 (empty prefix)\\n * - If start >= str.length, returns empty string\\n * - If endOrLength is omitted or null, extracts to end of string\\n * - If endOrLength is negative, it's treated as an offset from the end\\n * - If endOrLength > str.length, it's clamped to str.length\\n * - If endOrLength <= start, returns empty string\\n *\\n * Examples:\\n * - substring(\\\"hello\\\", 0, 2) → \\\"he\\\"\\n * - substring(\\\"hello\\\", 1, 3) → \\\"el\\\"\\n * - substring(\\\"hello\\\", 2) → \\\"llo\\\"\\n * - substring(\\\"hello\\\", 0) → \\\"hello\\\"\\n * - substring(\\\"hello\\\", 0, 5) → \\\"hello\\\"\\n * - substring(\\\"hello\\\", 0, 10) → \\\"hello\\\" (clamped to end)\\n * - substring(\\\"hello\\\", 3, 5) → \\\"lo\\\"\\n * - substring(\\\"hello\\\", -3) → \\\"llo\\\" (from end)\\n * - substring(\\\"hello\\\", 0, -2) → \\\"hel\\\" (from end)\\n * - substring(\\\"hello\\\", 10) → \\\"\\\" (start beyond length)\\n * - substring(\\\"\\\", 0, 5) → \\\"\\\" (empty string)\\n * - substring(123, 0, 2) → null (not a string)\\n * - substring(null, 0, 2) → null (not a string)\\n *\\n * @param strVal - The string value to extract from\\n * @param startVal - The starting index\\n * @param endOrLengthVal - Optional end index (exclusive) or length\\n * @returns The substring, or null if input is not a string\\n */\\nexport function substringString(strVal: Value, startVal: Value, endOrLengthVal: Value): Value {\\n  if (!strVal.isString()) return Value.Null();\\n  const str = strVal.asString();\\n  const len = str.length;\\n\\n  if (len == 0) return Value.String('');\\n\\n  // Parse start index - use asFloat() to handle both Int and Float types\\n  let start: i32 = 0;\\n  if (startVal.isNumber()) {\\n    start = <i32>startVal.asFloat();\\n  }\\n\\n  // Handle negative start (offset from end)\\n  if (start < 0) {\\n    start = len + start;\\n    if (start < 0) start = 0; // Clamp to 0\\n  }\\n\\n  // Handle start beyond length\\n  if (start >= len) {\\n    return Value.String('');\\n  }\\n\\n  // Parse end index if provided\\n  let hasEnd = !endOrLengthVal.isNull();\\n  let end: i32 = len; // Default to end of string\\n\\n  if (hasEnd && endOrLengthVal.isNumber()) {\\n    end = <i32>endOrLengthVal.asFloat();\\n\\n    // Handle negative end (offset from end)\\n    if (end < 0) {\\n      end = len + end;\\n      if (end < 0) end = 0;\\n    }\\n\\n    // Clamp end to string length\\n    if (end > len) end = len;\\n\\n    // Ensure end >= start\\n    if (end < start) end = start;\\n  }\\n\\n  // Extract substring\\n  return Value.String(str.substring(start, end));\\n}\\n\\n/**\\n * Find the index of the first occurrence of a substring.\\n *\\n * Returns the index of the first occurrence of the search string,\\n * starting from the specified position. Returns -1 if not found.\\n *\\n * Parameters:\\n * - str: The string to search in\\n * - searchVal: The substring to search for\\n * - startVal: Optional starting position (default: 0)\\n *\\n * Behavior:\\n * - If the source string is not a string, returns null\\n * - If the search value is not a string, returns null\\n * - If start is negative or omitted, defaults to 0\\n * - If start > str.length, returns -1 (not found)\\n * - If search string is empty, returns the start position\\n * - Returns -1 if the substring is not found\\n *\\n * Examples:\\n * - indexOf(\\\"hello\\\", \\\"l\\\") → 2\\n * - indexOf(\\\"hello\\\", \\\"x\\\") → -1\\n * - indexOf(\\\"hello\\\", \\\"l\\\", 3) → 3\\n * - indexOf(\\\"hello\\\", \\\"ll\\\") → 2\\n * - indexOf(\\\"hello\\\", \\\"lo\\\", 0) → 3\\n * - indexOf(\\\"hello\\\", \\\"\\\") → 0 (empty search string)\\n * - indexOf(\\\"hello\\\", \\\"o\\\", 5) → -1 (start at end)\\n * - indexOf(\\\"hello\\\", \\\"o\\\", 10) → -1 (start beyond length)\\n * - indexOf(\\\"\\\", \\\"x\\\") → -1 (empty source)\\n * - indexOf(\\\"\\\", \\\"\\\") → 0 (both empty)\\n * - indexOf(123, \\\"1\\\") → null (not a string)\\n *\\n * @param strVal - The string value to search in\\n * @param searchVal - The substring value to search for\\n * @param startVal - Optional starting position\\n * @returns The index of the first occurrence, or -1 if not found, or null if inputs are not strings\\n */\\nexport function indexOfString(strVal: Value, searchVal: Value, startVal: Value): Value {\\n  if (!strVal.isString() || !searchVal.isString()) return Value.Null();\\n  const str = strVal.asString();\\n  const search = searchVal.asString();\\n\\n  // Parse start index\\n  let start: i32 = 0;\\n  if (!startVal.isNull() && startVal.isNumber()) {\\n    start = <i32>startVal.asFloat();\\n  }\\n\\n  // Handle negative start\\n  if (start < 0) {\\n    start = 0;\\n  }\\n\\n  // Special case: empty search string (matches JavaScript behavior)\\n  // When searching for empty string, return the start position clamped to string length\\n  if (search.length == 0) {\\n    const len = <i32>str.length;\\n    if (start >= len) {\\n      return Value.Int(<i64>len);\\n    }\\n    return Value.Int(<i64>start);\\n  }\\n\\n  // AssemblyScript's indexOf returns -1 for not found\\n  const index = str.indexOf(search, start);\\n  return Value.Int(<i64>index);\\n}\\n\\n/**\\n * Check if a string starts with a given prefix.\\n *\\n * Returns true if the string begins with the specified prefix, false otherwise.\\n *\\n * Parameters:\\n * - str: The string to check\\n * - prefix: The prefix to look for\\n *\\n * Behavior:\\n * - If either input is not a string, returns null\\n * - If the prefix is an empty string, returns true\\n * - Case-sensitive comparison\\n *\\n * Examples:\\n * - startsWith(\\\"hello\\\", \\\"he\\\") → true\\n * - startsWith(\\\"hello\\\", \\\"lo\\\") → false\\n * - startsWith(\\\"hello\\\", \\\"hello\\\") → true\\n * - startsWith(\\\"hello\\\", \\\"hello world\\\") → false (prefix longer than string)\\n * - startsWith(\\\"\\\", \\\"\\\") → true (empty strings)\\n * - startsWith(\\\"hello\\\", \\\"\\\") → true (empty prefix)\\n * - startsWith(\\\"\\\", \\\"he\\\") → false (prefix longer than empty string)\\n * - startsWith(\\\"Hello\\\", \\\"he\\\") → false (case-sensitive)\\n * - startsWith(123, \\\"1\\\") → null (not a string)\\n * - startsWith(null, \\\"he\\\") → null (not a string)\\n *\\n * @param strVal - The string value to check\\n * @param prefixVal - The prefix value to look for\\n * @returns true if the string starts with the prefix, false otherwise, or null if inputs are not strings\\n */\\nexport function startsWithString(strVal: Value, prefixVal: Value): Value {\\n  if (!strVal.isString() || !prefixVal.isString()) return Value.Null();\\n  const str = strVal.asString();\\n  const prefix = prefixVal.asString();\\n\\n  // AssemblyScript's startsWith returns a bool\\n  const result = str.startsWith(prefix);\\n  return Value.Bool(result);\\n}\\n\\n/**\\n * Check if a string ends with a given suffix.\\n *\\n * Returns true if the string ends with the specified suffix, false otherwise.\\n *\\n * Parameters:\\n * - str: The string to check\\n * - suffix: The suffix to look for\\n *\\n * Behavior:\\n * - If either input is not a string, returns null\\n * - If the suffix is an empty string, returns true\\n * - Case-sensitive comparison\\n *\\n * Examples:\\n * - endsWith(\\\"hello\\\", \\\"lo\\\") → true\\n * - endsWith(\\\"hello\\\", \\\"he\\\") → false\\n * - endsWith(\\\"hello\\\", \\\"hello\\\") → true\\n * - endsWith(\\\"hello\\\", \\\"hello world\\\") → false (suffix longer than string)\\n * - endsWith(\\\"\\\", \\\"\\\") → true (empty strings)\\n * - endsWith(\\\"hello\\\", \\\"\\\") → true (empty suffix)\\n * - endsWith(\\\"\\\", \\\"lo\\\") → false (suffix longer than empty string)\\n * - endsWith(\\\"Hello\\\", \\\"LO\\\") → false (case-sensitive)\\n * - endsWith(123, \\\"1\\\") → null (not a string)\\n * - endsWith(null, \\\"lo\\\") → null (not a string)\\n *\\n * @param strVal - The string value to check\\n * @param suffixVal - The suffix value to look for\\n * @returns true if the string ends with the suffix, false otherwise, or null if inputs are not strings\\n */\\nexport function endsWithString(strVal: Value, suffixVal: Value): Value {\\n  if (!strVal.isString() || !suffixVal.isString()) return Value.Null();\\n  const str = strVal.asString();\\n  const suffix = suffixVal.asString();\\n\\n  // AssemblyScript's endsWith returns a bool\\n  const result = str.endsWith(suffix);\\n  return Value.Bool(result);\\n}\\n\\n/**\\n * Split a string into an array based on a delimiter.\\n *\\n * Returns an array of substrings by dividing the input string at each\\n * occurrence of the specified delimiter.\\n *\\n * Parameters:\\n * - str: The string to split\\n * - delimiter: The delimiter to split on\\n *\\n * Behavior:\\n * - If the input string is not a string, returns null\\n * - If the delimiter is not a string, returns null\\n * - If the delimiter is an empty string, returns an array of individual characters\\n * - If the string and delimiter are both empty, returns an array with one empty string\\n * - If the delimiter is not found, returns an array with the original string\\n *\\n * Examples:\\n * - split(\\\"a,b,c\\\", \\\",\\\") → [\\\"a\\\", \\\"b\\\", \\\"c\\\"]\\n * - split(\\\"hello\\\", \\\"\\\") → [\\\"h\\\", \\\"e\\\", \\\"l\\\", \\\"l\\\", \\\"o\\\"]\\n * - split(\\\"a-b-c\\\", \\\"-\\\") → [\\\"a\\\", \\\"b\\\", \\\"c\\\"]\\n * - split(\\\"word\\\", \\\"x\\\") → [\\\"word\\\"]\\n * - split(\\\"\\\", \\\",\\\") → [\\\"\\\"]\\n * - split(\\\"\\\", \\\"\\\") → [\\\"\\\"] (special case: empty string splits into array with one empty string)\\n * - split(\\\"a,,b\\\", \\\",\\\") → [\\\"a\\\", \\\"\\\", \\\"b\\\"] (preserves empty segments)\\n * - split(null, \\\",\\\") → null\\n * - split(\\\"hello\\\", null) → null\\n * - split(\\\"hello\\\", 123) → null\\n *\\n * @param strVal - The string value to split\\n * @param delimiterVal - The delimiter value to split on\\n * @returns An array of strings, or null if inputs are invalid\\n */\\nexport function splitString(strVal: Value, delimiterVal: Value): Value {\\n  if (!strVal.isString() || !delimiterVal.isString()) return Value.Null();\\n  const str = strVal.asString();\\n  const delimiter = delimiterVal.asString();\\n\\n  const parts = str.split(delimiter);\\n\\n  // Convert string array to Value array\\n  const result = new Array<Value>(parts.length);\\n  for (let i = 0; i < parts.length; i++) {\\n    unchecked((result[i] = Value.String(unchecked(parts[i]))));\\n  }\\n\\n  return Value.Array(result);\\n}\\n\\n/**\\n * Join array elements into a string with a separator.\\n *\\n * Returns a string that concatenates all elements of the array,\\n * separated by the specified delimiter.\\n *\\n * Parameters:\\n * - arr: The array to join\\n * - delimiter: The delimiter to insert between elements\\n *\\n * Behavior:\\n * - If the input is not an array, returns null\\n * - If the delimiter is not a string, returns null\\n * - If the array is empty, returns an empty string\\n * - Each array element is converted to its string representation\\n * - The delimiter is placed between each adjacent element, not at the start or end\\n *\\n * Examples:\\n * - join([\\\"a\\\", \\\"b\\\", \\\"c\\\"], \\\"-\\\") → \\\"a-b-c\\\"\\n * - join([\\\"hello\\\", \\\"world\\\"], \\\" \\\") → \\\"hello world\\\"\\n * - join([\\\"a\\\"], \\\",\\\") → \\\"a\\\"\\n * - join([], \\\",\\\") → \\\"\\\"\\n * - join([1, 2, 3], \\\"-\\\") → \\\"1-2-3\\\" (numbers converted to strings)\\n * - join([true, false], \\\" \\\") → \\\"true false\\\" (booleans converted to strings)\\n * - join([\\\"a\\\", null, \\\"b\\\"], \\\"-\\\") → \\\"a-null-b\\\" (null converted to \\\"null\\\")\\n * - join(null, \\\",\\\") → null\\n * - join([\\\"a\\\"], null) → null\\n * - join([\\\"a\\\"], 123) → null\\n *\\n * @param arrVal - The array value to join\\n * @param delimiterVal - The delimiter to insert between elements\\n * @returns The concatenated string, or null if inputs are invalid\\n */\\nexport function joinArray(arrVal: Value, delimiterVal: Value): Value {\\n  if (!arrVal.isArray() || !delimiterVal.isString()) return Value.Null();\\n  const arr = arrVal.asArray();\\n  const delimiter = delimiterVal.asString();\\n\\n  // Handle empty array\\n  if (arr.length == 0) {\\n    return Value.String('');\\n  }\\n\\n  // Build the result string\\n  let result: string = '';\\n  for (let i = 0; i < arr.length; i++) {\\n    // Append delimiter if not first element\\n    if (i > 0) {\\n      result += delimiter;\\n    }\\n    // Convert value to string and append\\n    result += valueToString(unchecked(arr[i]));\\n  }\\n\\n  return Value.String(result);\\n}\\n\\n/**\\n * Convert a string value to a number.\\n *\\n * Parses a string containing a numeric value and returns it as a float.\\n * Supports decimal numbers and negative numbers.\\n *\\n * Parameters:\\n * - val: The value to convert to a number (must be a string)\\n *\\n * Behavior:\\n * - If input is not a string, returns null\\n * - If string cannot be parsed as a number, returns NaN\\n * - Returns f64 (float) for all numeric values\\n *\\n * Examples:\\n * - number(\\\"123\\\") → 123.0\\n * - number(\\\"3.14\\\") → 3.14\\n * - number(\\\"-42\\\") → -42.0\\n * - number(\\\"0.5\\\") → 0.5\\n * - number(\\\"not a number\\\") → NaN\\n * - number(null) → null\\n * - number(123) → null (not a string)\\n *\\n * @param val - The value to convert to a number\\n * @returns The numeric value as a float, or null if input is not a string\\n */\\nexport function numberValue(val: Value): Value {\\n  if (val.isString()) {\\n    const str = val.asString();\\n    // Parse the string using the same logic as parseIntValue\\n    let result: i64 = 0;\\n    let negative = false;\\n    let i = 0;\\n\\n    // Handle leading whitespace\\n    while (i < str.length && str.charCodeAt(i) == 32) {\\n      i++;\\n    }\\n\\n    // Handle negative sign\\n    if (i < str.length && str.charCodeAt(i) == 45) {\\n      // '-'\\n      negative = true;\\n      i++;\\n    }\\n\\n    // Parse digits\\n    let hasDigits = false;\\n    while (i < str.length) {\\n      const c = str.charCodeAt(i);\\n      if (c >= 48 && c <= 57) {\\n        // '0'-'9'\\n        result = result * 10 + (c - 48);\\n        hasDigits = true;\\n        i++;\\n      } else {\\n        break;\\n      }\\n    }\\n\\n    if (!hasDigits) return Value.Null();\\n\\n    const finalResult = negative ? -result : result;\\n    return Value.Float(<f64>finalResult);\\n  } else if (val.isNumber()) {\\n    return val;\\n  } else if (val.isBool()) {\\n    return val.asBool() ? Value.Float(1.0) : Value.Float(0.0);\\n  }\\n  return Value.Null();\\n}\\n\\n/**\\n * Convert any value to a string.\\n *\\n * Converts the input value to its string representation.\\n *\\n * Parameters:\\n * - val: Any value to convert to string\\n *\\n * Behavior:\\n * - Boolean: \\\"true\\\" or \\\"false\\\"\\n * - Number: numeric string representation\\n * - String: returned as-is\\n * - Null: null (returns null, not the string \\\"null\\\")\\n * - Array/Object: \\\"[object]\\\"\\n *\\n * Examples:\\n * - string(42) → \\\"42\\\"\\n * - string(3.14) → \\\"3.14\\\"\\n * - string(true) → \\\"true\\\"\\n * - string(false) → \\\"false\\\"\\n * - string(\\\"hello\\\") → \\\"hello\\\"\\n * - string(null) → null\\n *\\n * @param val - The value to convert to a string\\n * @returns The string representation, or null if input is null\\n */\\nexport function stringValue(val: Value): Value {\\n  if (val.isNull()) {\\n    return Value.Null();\\n  }\\n  if (val.isBool()) {\\n    return Value.String(val.asBool() ? 'true' : 'false');\\n  }\\n  if (val.isNumber()) {\\n    // Converting to string matches JavaScript String() coercion for consistency with JS engines.\\n    // Integers print without decimals (3 not 3.0), floats use AS toString() formatting.\\n    if (val.type == TYPE_INT) {\\n      return Value.String(val.intVal.toString());\\n    }\\n    const f = val.asFloat();\\n    // Check if it's a whole number by testing if remainder is 0\\n    if (f % 1.0 == 0.0) {\\n      return Value.String(i64(<i64>f).toString());\\n    }\\n    return Value.String(f.toString());\\n  }\\n  if (val.isString()) {\\n    return val;\\n  }\\n  // Arrays and objects fall back to a placeholder\\n  return Value.String('[object]');\\n}\\n\\n/**\\n * Replace the first occurrence of a substring with another string.\\n *\\n * Returns a new string where the first occurrence of the search string\\n * is replaced by the replacement string.\\n *\\n * Parameters:\\n * - str: The string to modify\\n * - search: The substring to search for\\n * - replacement: The string to replace with\\n *\\n * Behavior:\\n * - If the source string is not a string, returns null\\n * - If the search value is not a string, returns null\\n * - If the replacement value is not a string, returns null\\n * - If the search string is empty, the replacement is inserted at the beginning\\n * - If the search string is not found, returns the original string unchanged\\n * - Only the first occurrence is replaced\\n *\\n * Examples:\\n * - replace(\\\"hello\\\", \\\"l\\\", \\\"L\\\") → \\\"heLlo\\\"\\n * - replace(\\\"hello\\\", \\\"lo\\\", \\\"LO\\\") → \\\"heLLO\\\"\\n * - replace(\\\"hello\\\", \\\"x\\\", \\\"X\\\") → \\\"hello\\\" (not found, unchanged)\\n * - replace(\\\"hello hello\\\", \\\"l\\\", \\\"L\\\") → \\\"heLlo hello\\\" (only first occurrence)\\n * - replace(\\\"hello\\\", \\\"\\\", \\\"X\\\") → \\\"Xhello\\\" (empty search, insert at start)\\n * - replace(\\\"\\\", \\\"x\\\", \\\"X\\\") → \\\"\\\" (empty source, no match)\\n * - replace(null, \\\"l\\\", \\\"L\\\") → null (not a string)\\n * - replace(\\\"hello\\\", null, \\\"L\\\") → null (not a string)\\n * - replace(\\\"hello\\\", \\\"l\\\", null) → null (not a string)\\n *\\n * @param strVal - The string value to modify\\n * @param searchVal - The substring value to search for\\n * @param replacementVal - The replacement string value\\n * @returns The modified string with first occurrence replaced, or null if inputs are invalid\\n */\\nexport function replaceString(strVal: Value, searchVal: Value, replacementVal: Value): Value {\\n  if (!strVal.isString() || !searchVal.isString() || !replacementVal.isString())\\n    return Value.Null();\\n  const str = strVal.asString();\\n  const search = searchVal.asString();\\n  const replacement = replacementVal.asString();\\n\\n  // AssemblyScript's replace() replaces all occurrences by default\\n  // We need to replace only the first occurrence, so we use indexOf and string concatenation\\n  const index = str.indexOf(search);\\n\\n  // Search string not found - return original string\\n  if (index < 0) {\\n    return Value.String(str);\\n  }\\n\\n  // Build result: prefix + replacement + suffix\\n  const prefix = str.substring(0, index);\\n  const suffix = str.substring(index + search.length);\\n  return Value.String(prefix + replacement + suffix);\\n}\\n\\n/**\\n * Replace all occurrences of a substring with another string.\\n *\\n * Returns a new string where all occurrences of the search string\\n * are replaced by the replacement string.\\n *\\n * Parameters:\\n * - str: The string to modify\\n * - search: The substring to search for\\n * - replacement: The string to replace with\\n *\\n * Behavior:\\n * - If the source string is not a string, returns null\\n * - If the search value is not a string, returns null\\n * - If the replacement value is not a string, returns null\\n * - If the search string is empty, the replacement is inserted between each character\\n * - If the search string is not found, returns the original string unchanged\\n * - All occurrences are replaced\\n *\\n * Examples:\\n * - replaceAll(\\\"hello\\\", \\\"l\\\", \\\"L\\\") → \\\"heLLo\\\"\\n * - replaceAll(\\\"hello hello\\\", \\\"l\\\", \\\"L\\\") → \\\"heLLo heLLo\\\"\\n * - replaceAll(\\\"hello\\\", \\\"lo\\\", \\\"LO\\\") → \\\"heLLO\\\"\\n * - replaceAll(\\\"hello\\\", \\\"x\\\", \\\"X\\\") → \\\"hello\\\" (not found, unchanged)\\n * - replaceAll(\\\"hello\\\", \\\"\\\", \\\"X\\\") → \\\"XhXeXlXlXoX\\\" (empty search, insert between chars)\\n * - replaceAll(\\\"\\\", \\\"x\\\", \\\"X\\\") → \\\"\\\" (empty source, no match)\\n * - replaceAll(null, \\\"l\\\", \\\"L\\\") → null (not a string)\\n * - replaceAll(\\\"hello\\\", null, \\\"L\\\") → null (not a string)\\n * - replaceAll(\\\"hello\\\", \\\"l\\\", null) → null (not a string)\\n *\\n * @param strVal - The string value to modify\\n * @param searchVal - The substring value to search for\\n * @param replacementVal - The replacement string value\\n * @returns The modified string with all occurrences replaced, or null if inputs are invalid\\n */\\nexport function replaceAllString(strVal: Value, searchVal: Value, replacementVal: Value): Value {\\n  if (!strVal.isString() || !searchVal.isString() || !replacementVal.isString())\\n    return Value.Null();\\n  let str = strVal.asString();\\n  const search = searchVal.asString();\\n  const replacement = replacementVal.asString();\\n\\n  // Handle empty search string - insert replacement between each character\\n  if (search.length == 0) {\\n    let result = replacement;\\n    for (let i = 0; i < str.length; i++) {\\n      result += str.charAt(i) + replacement;\\n    }\\n    return Value.String(result);\\n  }\\n\\n  // Use split and join for O(n) complexity instead of quadratic substring approach\\n  const parts = str.split(search);\\n  return Value.String(parts.join(replacement));\\n}\\n\\n// === Value Type Conversion ===\\n\\n/**\\n * Convert a Value to its string representation.\\n *\\n * This follows JavaScript's String() conversion rules:\\n * - Number: converted using JS toString()\\n * - Boolean: \\\"true\\\" or \\\"false\\\"\\n * - String: returned as-is\\n * - Null: \\\"null\\\"\\n *\\n * @param val - The value to convert\\n * @returns The string representation\\n */\\nfunction valueToString(val: Value): string {\\n  if (val.isNull()) {\\n    return 'null';\\n  }\\n  if (val.isBool()) {\\n    return val.asBool() ? 'true' : 'false';\\n  }\\n  if (val.isNumber()) {\\n    // Converting to string matches JavaScript String() coercion for consistency with JS engines.\\n    // Integers print without decimals (3 not 3.0), floats use AS toString() formatting.\\n    if (val.type == TYPE_INT) {\\n      return val.intVal.toString();\\n    }\\n    const f = val.asFloat();\\n    // Check if it's a whole number by testing if remainder is 0\\n    if (f % 1.0 == 0.0) {\\n      return i64(<i64>f).toString();\\n    }\\n    return f.toString();\\n  }\\n  if (val.isString()) {\\n    return val.asString();\\n  }\\n  // Arrays and objects fall back to a placeholder\\n  return '[object]';\\n}\\n\\n// === Comparison Helpers ===\\n\\nexport function valuesEqual(a: Value, b: Value): bool {\\n  if (a.type != b.type) {\\n    // Allow int/float comparison\\n    if (a.isNumber() && b.isNumber()) {\\n      return a.asFloat() == b.asFloat();\\n    }\\n    return false;\\n  }\\n  if (a.isBool()) return a.boolVal == b.boolVal;\\n  if (a.type == TYPE_INT) return a.intVal == b.intVal;\\n  if (a.type == TYPE_FLOAT) return a.floatVal == b.floatVal;\\n  if (a.isString()) return a.asString() == b.asString();\\n  if (a.isNull()) return true; // null == null\\n  return false; // Arrays/objects: reference equality not supported\\n}\\n\\n/**\\n * Compare two values for ordering.\\n *\\n * Returns:\\n * - Negative number if a < b\\n * - Zero if a == b\\n * - Positive number if a > b\\n *\\n * Comparison rules:\\n * - Strings: Lexicographic comparison using UTF-16 code units (case-sensitive)\\n * - Numbers: Numeric comparison (int and float are comparable)\\n * - Booleans: false < true\\n * - Null: Treated as less than all other values\\n * - Mixed types: Comparisons between incompatible types return 0 (not recommended)\\n *\\n * Examples:\\n * - compareValues(String(\\\"apple\\\"), String(\\\"banana\\\")) → negative\\n * - compareValues(String(\\\"zebra\\\"), String(\\\"apple\\\")) → positive\\n * - compareValues(String(\\\"abc\\\"), String(\\\"abc\\\")) → 0\\n * - compareValues(Float(3.14), Float(2.71)) → positive\\n * - compareValues(Bool(false), Bool(true)) → negative\\n *\\n * @param a - The left operand to compare\\n * @param b - The right operand to compare\\n * @returns Comparison result (-1, 0, or 1)\\n */\\nexport function compareValues(a: Value, b: Value): i32 {\\n  // Handle null - null is less than all other values\\n  if (a.isNull()) return b.isNull() ? 0 : -1;\\n  if (b.isNull()) return 1;\\n\\n  // Allow int/float comparison for numbers\\n  if (a.isNumber() && b.isNumber()) {\\n    const aNum = a.asFloat();\\n    const bNum = b.asFloat();\\n    if (aNum < bNum) return -1;\\n    if (aNum > bNum) return 1;\\n    return 0;\\n  }\\n\\n  // String comparison - lexicographic, case-sensitive\\n  if (a.isString() && b.isString()) {\\n    const aStr = a.asString();\\n    const bStr = b.asString();\\n    if (aStr < bStr) return -1;\\n    if (aStr > bStr) return 1;\\n    return 0;\\n  }\\n\\n  // Boolean comparison\\n  if (a.isBool() && b.isBool()) {\\n    const aBool = a.asBool();\\n    const bBool = b.asBool();\\n    if (!aBool && bBool) return -1;\\n    if (aBool && !bBool) return 1;\\n    return 0;\\n  }\\n\\n  // Mixed types or unsupported types - treat as equal (but probably shouldn't happen)\\n  return 0;\\n}\\n\\n// === Arithmetic Operators ===\\n\\n/**\\n * Add two values, supporting both numeric addition and string concatenation.\\n *\\n * Type coercion rules:\\n * - If either operand is a string, both are converted to strings and concatenated\\n * - Otherwise, both operands are treated as numbers and added together\\n *\\n * Examples:\\n * - \\\"hello\\\" + \\\" \\\" + \\\"world\\\" → \\\"hello world\\\"\\n * - \\\"count: \\\" + 5 → \\\"count: 5\\\"\\n * - 1 + 2 → 3\\n * - true + false → 1 (true=1, false=0, numeric addition)\\n * - null + 5 → 5 (null=0, numeric addition)\\n * - \\\"prefix\\\" + null → \\\"prefixnull\\\" (string concatenation)\\n *\\n * @param a - The left operand\\n * @param b - The right operand\\n * @returns The sum or concatenation result\\n */\\nexport function addValues(a: Value, b: Value): Value {\\n  // String concatenation takes priority over numeric addition\\n  // If either operand is a string, concatenate both as strings\\n  if (a.isString() || b.isString()) {\\n    const leftStr = a.isString() ? a.asString() : valueToString(a);\\n    const rightStr = b.isString() ? b.asString() : valueToString(b);\\n    return Value.String(leftStr + rightStr);\\n  }\\n\\n  // Numeric addition\\n  const aNum = a.isNumber() ? a.asFloat() : a.isBool() ? (a.asBool() ? 1.0 : 0.0) : 0.0;\\n  const bNum = b.isNumber() ? b.asFloat() : b.isBool() ? (b.asBool() ? 1.0 : 0.0) : 0.0;\\n  return Value.Float(aNum + bNum);\\n}\\n\\nexport function subtractValues(a: Value, b: Value): Value {\\n  if (!a.isNumber() || !b.isNumber()) return Value.Null();\\n  const aVal = a.asFloat();\\n  const bVal = b.asFloat();\\n  return Value.Float(aVal - bVal);\\n}\\n\\nexport function multiplyValues(a: Value, b: Value): Value {\\n  if (!a.isNumber() || !b.isNumber()) return Value.Null();\\n  const aVal = a.asFloat();\\n  const bVal = b.asFloat();\\n  return Value.Float(aVal * bVal);\\n}\\n\\nexport function divideValues(a: Value, b: Value): Value {\\n  if (!a.isNumber() || !b.isNumber()) return Value.Null();\\n  const aVal = a.asFloat();\\n  const bVal = b.asFloat();\\n  if (bVal == 0) return Value.Null(); // Division by zero\\n  return Value.Float(aVal / bVal);\\n}\\n\\nexport function moduloValues(a: Value, b: Value): Value {\\n  if (!a.isNumber() || !b.isNumber()) return Value.Null();\\n  const aVal = a.asFloat();\\n  const bVal = b.asFloat();\\n  if (bVal == 0) return Value.Null(); // Division by zero\\n  // Use fmod for floating point modulo\\n  const result = aVal - Math.trunc(aVal / bVal) * bVal;\\n  return Value.Float(result);\\n}\\n\\nexport function powerValues(a: Value, b: Value): Value {\\n  if (!a.isNumber() || !b.isNumber()) return Value.Null();\\n  const aVal = a.asFloat();\\n  const bVal = b.asFloat();\\n  const result = Math.pow(aVal, bVal);\\n  return Value.Float(result);\\n}\\n\\nexport function negateValue(a: Value): Value {\\n  if (!a.isNumber()) return Value.Null();\\n  const n = a.asFloat();\\n  return Value.Float(-n);\\n}\\n\\n/**\\n * Get a property from an object Value.\\n *\\n * @param obj - The Value to get the property from (should be an object)\\n * @param property - The property name to get\\n * @returns The Value of the property, or Null if not found or obj is null/not an object\\n */\\nexport function getProperty(obj: Value, property: string): Value {\\n  if (obj.isNull()) return Value.Null();\\n  if (!obj.isObject()) return Value.Null();\\n\\n  const map = obj.asObject();\\n  if (map.has(property)) {\\n    return map.get(property);\\n  }\\n  return Value.Null();\\n}\\n\\n/**\\n * Get an element from an array at the specified index.\\n *\\n * @param arr - The Value to get the element from (should be an array)\\n * @param idx - The index to get (must be a number Value)\\n * @returns The Value at the index, or Null if out of bounds or arr is null/not an array\\n */\\nexport function getIndex(arr: Value, idx: Value): Value {\\n  if (arr.isNull()) return Value.Null();\\n  if (idx.isNull()) return Value.Null();\\n\\n  // Handle object access with string keys (e.g., baseCosts[\\\"FastTrack\\\"])\\n  if (arr.isObject()) {\\n    if (idx.isString()) {\\n      const obj = arr.asObject();\\n      const key = idx.asString();\\n      if (obj.has(key)) {\\n        return obj.get(key);\\n      }\\n      return Value.Null();\\n    }\\n    // If idx is a number, convert to string for object key lookup\\n    // This handles cases like obj[0] where obj is {\\\"0\\\": value}\\n    const keyStr = idx.asString();\\n    const obj = arr.asObject();\\n    if (obj.has(keyStr)) {\\n      return obj.get(keyStr);\\n    }\\n    return Value.Null();\\n  }\\n\\n  if (!arr.isArray()) return Value.Null();\\n\\n  const array = arr.asArray();\\n  const index = idx.asFloat();\\n\\n  // Handle negative indices (from end of array)\\n  let actualIndex = <i32>index;\\n  if (actualIndex < 0) {\\n    actualIndex = <i32>(array.length + actualIndex);\\n  }\\n\\n  // Check bounds\\n  if (actualIndex < 0 || actualIndex >= array.length) {\\n    return Value.Null();\\n  }\\n\\n  return array[actualIndex];\\n}\\n\\n/**\\n * Create an interval object for range checking.\\n *\\n * @param start - Start value of the interval\\n * @param end - End value of the interval\\n * @param startInclusive - Whether the start is inclusive (true) or exclusive (false)\\n * @param endInclusive - Whether the end is inclusive (true) or exclusive (false)\\n * @returns An object representing the interval\\n */\\nexport function createInterval(\\n  start: Value,\\n  end: Value,\\n  startInclusive: bool,\\n  endInclusive: bool,\\n): Value {\\n  const intervalMap = new Map<string, Value>();\\n  intervalMap.set('__isInterval', Value.Bool(true));\\n  intervalMap.set('start', start);\\n  intervalMap.set('end', end);\\n  intervalMap.set('startInclusive', Value.Bool(startInclusive));\\n  intervalMap.set('endInclusive', Value.Bool(endInclusive));\\n  return Value.Object(intervalMap);\\n}\\n\\n/**\\n * Check if a value is within an interval.\\n *\\n * @param needle - The value to check\\n * @param interval - The interval object created by createInterval\\n * @returns true if the value is within the interval, false otherwise\\n */\\nfunction valueInInterval(needle: Value, interval: Value): bool {\\n  if (!interval.isObject()) return false;\\n\\n  const intervalObj = interval.asObject();\\n\\n  // Check if this is actually an interval object\\n  if (!intervalObj.has('__isInterval')) return false;\\n\\n  const start = intervalObj.get('start');\\n  const end = intervalObj.get('end');\\n  const startInclusive = intervalObj.get('startInclusive').asBool();\\n  const endInclusive = intervalObj.get('endInclusive').asBool();\\n\\n  const cmpStart = compareValues(needle, start);\\n  const cmpEnd = compareValues(needle, end);\\n\\n  // Check start boundary\\n  let passesStart: bool;\\n  if (startInclusive) {\\n    passesStart = cmpStart >= 0;\\n  } else {\\n    passesStart = cmpStart > 0;\\n  }\\n\\n  // Check end boundary\\n  let passesEnd: bool;\\n  if (endInclusive) {\\n    passesEnd = cmpEnd <= 0;\\n  } else {\\n    passesEnd = cmpEnd < 0;\\n  }\\n\\n  return passesStart && passesEnd;\\n}\\n\\n/**\\n * Check if a value is in an array, a substring is in a string, or a value is in an interval.\\n * For arrays: checks if the exact value exists in the array\\n * For strings: checks if the needle string is a substring of the haystack\\n * For intervals: checks if the value is within the range\\n *\\n * @param needle - The Value or string to search for\\n * @param haystack - The Value to search in (should be an array, string, or interval)\\n * @returns true if found, false otherwise\\n */\\nexport function valueIn(needle: Value, haystack: Value): Value {\\n  if (needle.isNull() || haystack.isNull()) return Value.Bool(false);\\n\\n  // Check if haystack is an interval\\n  if (haystack.isObject()) {\\n    const obj = haystack.asObject();\\n    if (obj.has('__isInterval')) {\\n      return Value.Bool(valueInInterval(needle, haystack));\\n    }\\n  }\\n\\n  // Check if haystack is an array\\n  if (haystack.isArray()) {\\n    const array = haystack.asArray();\\n    for (let i = 0; i < array.length; i++) {\\n      if (valuesEqual(needle, unchecked(array[i]))) {\\n        return Value.Bool(true);\\n      }\\n    }\\n    return Value.Bool(false);\\n  }\\n\\n  // Check if haystack is a string\\n  if (haystack.isString() && needle.isString()) {\\n    const hayStr = haystack.asString();\\n    const needStr = needle.asString();\\n    if (hayStr.indexOf(needStr) >= 0) {\\n      return Value.Bool(true);\\n    }\\n    return Value.Bool(false);\\n  }\\n\\n  return Value.Bool(false);\\n}\\n\";\nexport const RUNTIME_TABLES = \"// assembly/runtime/tables.ts (AssemblyScript)\\nimport { Value } from './values';\\nimport { Context } from './context';\\nimport { valuesEqual } from './expressions';\\n\\n/**\\n * Condition for decision table row evaluation.\\n * Uses Value tagged union consistently.\\n */\\nexport class Condition {\\n  field: string;\\n  op: string;\\n  value: Value;\\n\\n  constructor(field: string, op: string, value: Value) {\\n    this.field = field;\\n    this.op = op;\\n    this.value = value;\\n  }\\n\\n  evaluate(ctx: Context): bool {\\n    const actual = ctx.get(this.field);\\n    const expected = this.value;\\n\\n    // Handle null cases\\n    if (actual.isNull()) {\\n      if (this.op == '==' && expected.isNull()) return true;\\n      if (this.op == '!=' && !expected.isNull()) return true;\\n      return false;\\n    }\\n\\n    // Numeric comparisons\\n    if (actual.isNumber() && expected.isNumber()) {\\n      const a = actual.asFloat();\\n      const e = expected.asFloat();\\n\\n      if (this.op == '==') return a == e;\\n      if (this.op == '!=') return a != e;\\n      if (this.op == '<') return a < e;\\n      if (this.op == '<=') return a <= e;\\n      if (this.op == '>') return a > e;\\n      if (this.op == '>=') return a >= e;\\n    }\\n\\n    // String comparisons\\n    if (actual.isString() && expected.isString()) {\\n      const a = actual.asString();\\n      const e = expected.asString();\\n\\n      if (this.op == '==') return a == e;\\n      if (this.op == '!=') return a != e;\\n      // Lexicographic comparison for strings\\n      if (this.op == '<') return a < e;\\n      if (this.op == '<=') return a <= e;\\n      if (this.op == '>') return a > e;\\n      if (this.op == '>=') return a >= e;\\n    }\\n\\n    // Boolean equality\\n    if (actual.isBool() && expected.isBool()) {\\n      if (this.op == '==') return actual.boolVal == expected.boolVal;\\n      if (this.op == '!=') return actual.boolVal != expected.boolVal;\\n    }\\n\\n    // Generic equality via valuesEqual\\n    if (this.op == '==') return valuesEqual(actual, expected);\\n    if (this.op == '!=') return !valuesEqual(actual, expected);\\n\\n    return false;\\n  }\\n}\\n\\n/**\\n * Check if a value is within an interval (range).\\n * Supports open/closed boundaries: [a..b], (a..b), [a..b), (a..b]\\n */\\nexport function inInterval(\\n  val: Value,\\n  start: Value,\\n  end: Value,\\n  startInclusive: bool,\\n  endInclusive: bool,\\n): bool {\\n  if (!val.isNumber() || !start.isNumber() || !end.isNumber()) {\\n    return false;\\n  }\\n\\n  const v = val.asFloat();\\n  const s = start.asFloat();\\n  const e = end.asFloat();\\n\\n  const aboveStart = startInclusive ? v >= s : v > s;\\n  const belowEnd = endInclusive ? v <= e : v < e;\\n\\n  return aboveStart && belowEnd;\\n}\\n\";\nexport const RUNTIME_MEMORY = \"// assembly/runtime/memory.ts (AssemblyScript)\\n// Memory layout and management utilities for WASM linear memory\\n\\nimport { writeString } from './strings';\\n\\n// ============================================================================\\n// Memory Layout Constants\\n// ============================================================================\\n\\n// Reserved space for null pointer trap (first 4 bytes)\\n// Accessing address 0 should trap, catching null/nullish pointer bugs\\nexport const NULL_POINTER_TRAP_SIZE: usize = 4;\\n\\n// Fixed memory region offsets\\nexport const INPUT_BUFFER_START: usize = NULL_POINTER_TRAP_SIZE; // 0x0004\\n\\n// Schema-specific field layouts require different buffer sizes. Computing sizes at\\n// compile time based on actual schema ensures optimal memory usage per decision.\\nexport let INPUT_BUFFER_SIZE: usize = 0;\\n\\n// Variable-length input data starts after the fixed input buffer\\nexport let INPUT_VAR_START: usize = 0;\\n\\n// Output buffer follows input variable data\\nexport let OUTPUT_START: usize = 0;\\n\\n// Computed at compilation time based on input/output schema field sizes\\nexport let OUTPUT_BUFFER_SIZE: usize = 0;\\n\\n// Variable-length output data starts after the fixed output buffer\\nexport let OUTPUT_VAR_START: usize = 0;\\n\\n// Runtime heap for intermediate values (temporary arrays, string concat buffers, etc.)\\nexport let HEAP_START: usize = 0;\\n\\n// ============================================================================\\n// Header Constants\\n// ============================================================================\\n\\n// Schema hash size in bytes\\nexport const SCHEMA_HASH_SIZE: usize = 8;\\n\\n// String descriptor format: [offset (4 bytes)] [length (4 bytes)]\\nexport const STRING_DESC_SIZE: usize = 8;\\n\\n// Array descriptor format: [offset (4 bytes)] [length (4 bytes)]\\nexport const ARRAY_DESC_SIZE: usize = 8;\\n\\n// ============================================================================\\n// Memory Allocation\\n// ============================================================================\\n\\n// Decision evaluation is single-pass (no GC needed), and most allocations are temporary\\n// (freed after result is marshaled). Linear bump allocator is fast and simple.\\nlet heapPointer: usize = 0;\\n\\n/**\\n * Initialize memory layout.\\n *\\n * This function must be called once at startup with the computed sizes\\n * for the input and output buffers based on the schema.\\n *\\n * @param inputFixedSize - Size of fixed input fields in bytes\\n * @param outputFixedSize - Size of fixed output fields in bytes\\n */\\nexport function initializeMemoryLayout(inputFixedSize: usize, outputFixedSize: usize): void {\\n  INPUT_BUFFER_SIZE = inputFixedSize;\\n  INPUT_VAR_START = INPUT_BUFFER_START + inputFixedSize;\\n\\n  OUTPUT_BUFFER_SIZE = outputFixedSize;\\n  OUTPUT_START = INPUT_VAR_START; // Output follows input variable data\\n  OUTPUT_VAR_START = OUTPUT_START + outputFixedSize;\\n\\n  HEAP_START = OUTPUT_VAR_START; // Heap follows output variable data\\n  heapPointer = HEAP_START; // Reset heap pointer\\n}\\n\\n/**\\n * Get the current memory layout info.\\n *\\n * @returns Object with all memory region offsets and sizes\\n */\\nexport function getMemoryLayout(): MemoryLayout {\\n  return new MemoryLayout(\\n    NULL_POINTER_TRAP_SIZE,\\n    INPUT_BUFFER_START,\\n    INPUT_BUFFER_SIZE,\\n    INPUT_VAR_START,\\n    OUTPUT_START,\\n    OUTPUT_BUFFER_SIZE,\\n    OUTPUT_VAR_START,\\n    HEAP_START,\\n  );\\n}\\n\\n/**\\n * Memory layout information structure.\\n */\\nexport class MemoryLayout {\\n  nullPointerTrapSize: usize;\\n  inputBufferStart: usize;\\n  inputBufferSize: usize;\\n  inputVarStart: usize;\\n  outputStart: usize;\\n  outputBufferSize: usize;\\n  outputVarStart: usize;\\n  heapStart: usize;\\n\\n  constructor(\\n    nullPointerTrapSize: usize,\\n    inputBufferStart: usize,\\n    inputBufferSize: usize,\\n    inputVarStart: usize,\\n    outputStart: usize,\\n    outputBufferSize: usize,\\n    outputVarStart: usize,\\n    heapStart: usize,\\n  ) {\\n    this.nullPointerTrapSize = nullPointerTrapSize;\\n    this.inputBufferStart = inputBufferStart;\\n    this.inputBufferSize = inputBufferSize;\\n    this.inputVarStart = inputVarStart;\\n    this.outputStart = outputStart;\\n    this.outputBufferSize = outputBufferSize;\\n    this.outputVarStart = outputVarStart;\\n    this.heapStart = heapStart;\\n  }\\n}\\n\\n// ============================================================================\\n// Simple Linear Heap Allocator\\n// ============================================================================\\n\\n/**\\n * Allocate memory from the runtime heap.\\n *\\n * A simple linear allocator - memory is never freed during a single evaluation.\\n * Suitable for short-lived operations like decision table evaluation.\\n *\\n * Memory is never freed during a single evaluation because:\\n * (1) evaluations are short-lived (milliseconds),\\n * (2) heap is reset between evaluations, and\\n * (3) avoiding free list management simplifies allocator and improves performance.\\n *\\n * @param size - Number of bytes to allocate (must be > 0)\\n * @returns Pointer to allocated memory\\n * @throws Calls abort() on OUT_OF_MEMORY - this is a critical error that halts execution\\n */\\nexport function heapAlloc(size: usize): usize {\\n  if (size == 0) return 0;\\n\\n  // Get current memory size in bytes (1 page = 64KB = 65536 bytes)\\n  const memorySize: usize = (<usize>memory.size()) << 16;\\n\\n  // Align the heap pointer to 8-byte boundary\\n  const alignedPtr = alignPtr(heapPointer, 8);\\n\\n  // Check for overflow when computing aligned pointer\\n  // If alignedPtr wrapped around (became smaller than heapPointer), we've overflowed\\n  if (alignedPtr < heapPointer) {\\n    SetLastError(RuntimeErrorCode.OUT_OF_MEMORY);\\n    return 0;\\n  }\\n\\n  // Check for overflow when computing new heap pointer\\n  // If newHeapPointer would wrap around, we've overflowed\\n  const maxAllowedSize = memorySize - alignedPtr;\\n  if (size > maxAllowedSize) {\\n    SetLastError(RuntimeErrorCode.OUT_OF_MEMORY);\\n    return 0;\\n  }\\n\\n  const newHeapPointer = alignedPtr + size;\\n\\n  // Bounds check: ensure new heap pointer doesn't exceed memory\\n  if (newHeapPointer > memorySize) {\\n    SetLastError(RuntimeErrorCode.OUT_OF_MEMORY);\\n    return 0;\\n  }\\n\\n  // All checks passed, update heap pointer and return allocation\\n  heapPointer = newHeapPointer;\\n  return alignedPtr;\\n}\\n\\n/**\\n * Get the current heap pointer (next allocation will start here).\\n *\\n * @returns Current heap pointer address\\n */\\nexport function getHeapPointer(): usize {\\n  return heapPointer;\\n}\\n\\n/**\\n * Reset the heap pointer to the start of the heap region.\\n *\\n * This allows reusing heap memory for multiple evaluations.\\n */\\nexport function resetHeap(): void {\\n  heapPointer = HEAP_START;\\n}\\n\\n/**\\n * Save the current heap pointer state.\\n *\\n * @returns Current heap pointer address\\n */\\nexport function saveHeapPointer(): usize {\\n  return heapPointer;\\n}\\n\\n/**\\n * Restore the heap pointer to a previously saved state.\\n *\\n * @param saved - Saved heap pointer address from saveHeapPointer()\\n */\\nexport function restoreHeapPointer(saved: usize): usize {\\n  const old = heapPointer;\\n  heapPointer = saved;\\n  return old;\\n}\\n\\n// ============================================================================\\n// Pointer Utilities\\n// ============================================================================\\n\\n/**\\n * Align a pointer to the specified alignment boundary.\\n *\\n * @param ptr - Pointer to align\\n * @param alignment - Alignment boundary (must be a power of 2)\\n * @returns Aligned pointer\\n */\\nexport function alignPtr(ptr: usize, alignment: usize): usize {\\n  return (ptr + alignment - 1) & ~(alignment - 1);\\n}\\n\\n/**\\n * Check if a pointer is null (0).\\n *\\n * @param ptr - Pointer to check\\n * @returns true if pointer is 0, false otherwise\\n */\\nexport function isNullPtr(ptr: usize): bool {\\n  return ptr == 0;\\n}\\n\\n/**\\n * Check if a pointer is valid (non-null and aligned).\\n *\\n * @param ptr - Pointer to check\\n * @param alignment - Required alignment (default: 4 bytes)\\n * @returns true if pointer is valid, false otherwise\\n */\\nexport function isValidPtr(ptr: usize, alignment: usize = 4): bool {\\n  if (ptr == 0) return false;\\n  return (ptr & (alignment - 1)) == 0;\\n}\\n\\n// ============================================================================\\n// Buffer Access Helpers\\n// ============================================================================\\n\\n/**\\n * Get the pointer to a schema hash field.\\n *\\n * @param basePtr - Base pointer of the buffer\\n * @returns Pointer to the schema hash field\\n */\\nexport function getSchemaHashPtr(basePtr: usize): usize {\\n  return basePtr;\\n}\\n\\n/**\\n * Read a schema hash from a buffer.\\n *\\n * @param basePtr - Base pointer of the buffer\\n * @returns Schema hash as u64\\n */\\nexport function readSchemaHash(basePtr: usize): u64 {\\n  return load<u64>(basePtr);\\n}\\n\\n/**\\n * Write a schema hash to a buffer.\\n *\\n * @param basePtr - Base pointer of the buffer\\n * @param hash - Schema hash to write\\n */\\nexport function writeSchemaHash(basePtr: usize, hash: u64): void {\\n  store<u64>(basePtr, hash);\\n}\\n\\n/**\\n * Get the pointer to a field in a fixed-size buffer.\\n *\\n * @param bufferPtr - Base pointer of the buffer\\n * @param fieldOffset - Offset of the field from the buffer start\\n * @returns Pointer to the field\\n */\\nexport function getFieldPtr(bufferPtr: usize, fieldOffset: usize): usize {\\n  return bufferPtr + fieldOffset;\\n}\\n\\n// ============================================================================\\n// String Descriptor Helpers\\n// ============================================================================\\n\\n/**\\n * Get the offset and length components of a string descriptor.\\n *\\n * String descriptor format: [offset (4 bytes)] [length (4 bytes)]\\n *\\n * @param descPtr - Pointer to the string descriptor\\n * @returns Object with offset and length\\n */\\nexport function readStringDesc(descPtr: usize): StringDesc {\\n  return new StringDesc(load<u32>(descPtr), load<u32>(descPtr + 4));\\n}\\n\\n/**\\n * Write a string descriptor.\\n *\\n * @param descPtr - Pointer to the string descriptor\\n * @param offset - Offset to the string data\\n * @param length - Length of the string data\\n */\\nexport function writeStringDesc(descPtr: usize, offset: u32, length: u32): void {\\n  store<u32>(descPtr, offset);\\n  store<u32>(descPtr + 4, length);\\n}\\n\\n/**\\n * String descriptor structure.\\n */\\nexport class StringDesc {\\n  offset: u32;\\n  length: u32;\\n\\n  constructor(offset: u32, length: u32) {\\n    this.offset = offset;\\n    this.length = length;\\n  }\\n\\n  isEmpty(): bool {\\n    return this.length == 0;\\n  }\\n}\\n\\n// ============================================================================\\n// Array Descriptor Helpers\\n// ============================================================================\\n\\n/**\\n * Get the offset and length components of an array descriptor.\\n *\\n * Array descriptor format: [offset (4 bytes)] [length (4 bytes)]\\n *\\n * @param descPtr - Pointer to the array descriptor\\n * @returns Object with offset and length\\n */\\nexport function readArrayDesc(descPtr: usize): ArrayDesc {\\n  return new ArrayDesc(load<u32>(descPtr), load<u32>(descPtr + 4));\\n}\\n\\n/**\\n * Write an array descriptor.\\n *\\n * @param descPtr - Pointer to the array descriptor\\n * @param offset - Offset to the array data\\n * @param length - Number of elements in the array\\n */\\nexport function writeArrayDesc(descPtr: usize, offset: u32, length: u32): void {\\n  store<u32>(descPtr, offset);\\n  store<u32>(descPtr + 4, length);\\n}\\n\\n/**\\n * Array descriptor structure.\\n */\\nexport class ArrayDesc {\\n  offset: u32;\\n  length: u32;\\n\\n  constructor(offset: u32, length: u32) {\\n    this.offset = offset;\\n    this.length = length;\\n  }\\n\\n  isEmpty(): bool {\\n    return this.length == 0;\\n  }\\n}\\n\\n// ============================================================================\\n// Runtime Error Handling\\n// ============================================================================\\n\\n// Error codes for runtime failures\\nexport enum RuntimeErrorCode {\\n  NONE = 0,\\n  SCHEMA_MISMATCH = 1,\\n  NULL_POINTER = 2,\\n  INVALID_ACCESS = 3,\\n  EVALUATION_ERROR = 4,\\n  OUT_OF_MEMORY = 5,\\n}\\n\\n// Last error that occurred during evaluation\\nlet lastErrorCode: RuntimeErrorCode = RuntimeErrorCode.NONE;\\n\\n// Optional error message (allocated on heap for variable-length messages)\\nlet errorMessagePtr: usize = 0;\\n\\n/**\\n * Check if an error code represents a critical error that should abort execution.\\n *\\n * Critical errors are unrecoverable conditions where continuing execution would\\n * likely lead to memory corruption, crashes, or incorrect results. These errors\\n * call abort() to immediately halt the WASM module.\\n *\\n * Critical errors:\\n * - OUT_OF_MEMORY: Memory allocation failed; continuing could corrupt state\\n * - NULL_POINTER: Null pointer dereference; memory safety violation\\n * - INVALID_ACCESS: Invalid memory access; memory safety violation\\n *\\n * Non-critical errors (set flag, caller must check hasError()):\\n * - SCHEMA_MISMATCH: Input doesn't match schema; recoverable\\n * - EVALUATION_ERROR: Logic error in decision evaluation; recoverable\\n *\\n * @param code - The error code to check\\n * @returns true if the error is critical and should abort\\n */\\nexport function isCriticalError(code: RuntimeErrorCode): bool {\\n  return (\\n    code === RuntimeErrorCode.OUT_OF_MEMORY ||\\n    code === RuntimeErrorCode.NULL_POINTER ||\\n    code === RuntimeErrorCode.INVALID_ACCESS\\n  );\\n}\\n\\n/**\\n * Get the last error code that occurred during evaluation.\\n *\\n * @returns The last error code\\n */\\nexport function getLastError(): RuntimeErrorCode {\\n  return lastErrorCode;\\n}\\n\\n/**\\n * Set the last error code and optional message.\\n *\\n * For critical errors (OUT_OF_MEMORY, NULL_POINTER, INVALID_ACCESS), this function\\n * calls abort() to immediately halt execution. Critical errors indicate unrecoverable\\n * conditions where continuing would lead to memory corruption or undefined behavior.\\n *\\n * For non-critical errors (SCHEMA_MISMATCH, EVALUATION_ERROR), callers MUST check\\n * hasError() after operations that can fail and handle the error appropriately.\\n * Failure to check error state may result in incorrect evaluation results.\\n *\\n * @param code - The error code\\n * @param message - Optional error message (allocated on heap)\\n */\\nexport function SetLastError(code: RuntimeErrorCode, message: usize = 0): void {\\n  lastErrorCode = code;\\n  errorMessagePtr = message;\\n\\n  // Critical errors abort immediately to prevent corrupted state propagation\\n  if (isCriticalError(code)) {\\n    abort();\\n  }\\n}\\n\\n/**\\n * Clear the last error (reset to NONE).\\n */\\nexport function clearLastError(): void {\\n  lastErrorCode = RuntimeErrorCode.NONE;\\n  errorMessagePtr = 0;\\n}\\n\\n/**\\n * Set an error with a string message.\\n *\\n * This is a convenience function that combines SetLastError() with writeString().\\n * The error message is allocated on the heap and will be freed by the next error.\\n *\\n * For critical errors (OUT_OF_MEMORY, NULL_POINTER, INVALID_ACCESS), this function\\n * will call abort() after setting the error, immediately halting execution.\\n *\\n * For non-critical errors (SCHEMA_MISMATCH, EVALUATION_ERROR), callers MUST check\\n * hasError() after operations that can fail.\\n *\\n * @param code - The error code\\n * @param message - The error message string\\n */\\nexport function SetLastErrorWithMessage(code: RuntimeErrorCode, message: string): void {\\n  const messagePtr = writeString(message);\\n  SetLastError(code, messagePtr);\\n}\\n\\n/**\\n * Get the pointer to the error message.\\n *\\n * @returns Pointer to error message (0 if no message)\\n */\\nexport function getErrorMessagePtr(): usize {\\n  return errorMessagePtr;\\n}\\n\\n/**\\n * Check if an error occurred.\\n *\\n * Callers MUST check this function after operations that can set non-critical errors\\n * (SCHEMA_MISMATCH, EVALUATION_ERROR). Critical errors (OUT_OF_MEMORY, NULL_POINTER,\\n * INVALID_ACCESS) abort immediately and never reach this check.\\n *\\n * Example usage:\\n * ```assemblyscript\\n * let result = someOperationThatCanFail();\\n * if (hasError()) {\\n *   // Handle error - return early, propagate error, etc.\\n *   return Value.Null();\\n * }\\n * // Continue with valid result\\n * ```\\n *\\n * @returns true if a non-critical error occurred, false otherwise\\n */\\nexport function hasError(): bool {\\n  return lastErrorCode !== RuntimeErrorCode.NONE;\\n}\\n\\n// ============================================================================\\n// Memory Validation Helpers\\n// ============================================================================\\n\\n/**\\n * Check if a pointer is within the valid memory range.\\n *\\n * This is a basic check that can help catch out-of-bounds accesses.\\n * Note: In production, you may want to disable these checks for performance.\\n *\\n * @param ptr - Pointer to check\\n * @param size - Size of the region to check\\n * @return true if pointer is within valid range, false otherwise\\n */\\nexport function isValidMemoryRange(ptr: usize, size: usize): bool {\\n  if (ptr == 0) return false;\\n\\n  // Get current memory size (AssemblyScript runtime provides this)\\n  const memorySize: usize = memory.size() << 16; // 1 page = 64KB\\n\\n  return ptr + size <= memorySize;\\n}\\n\\n/**\\n * Check if a pointer is within the input buffer region.\\n *\\n * @param ptr - Pointer to check\\n * @return true if pointer is within input buffer, false otherwise\\n */\\nexport function isWithinInputBuffer(ptr: usize): bool {\\n  return ptr >= INPUT_BUFFER_START && ptr < INPUT_VAR_START;\\n}\\n\\n/**\\n * Check if a pointer is within the input variable data region.\\n *\\n * @param ptr - Pointer to check\\n * @return true if pointer is within input variable data, false otherwise\\n */\\nexport function isWithinInputVar(ptr: usize): bool {\\n  return ptr >= INPUT_VAR_START && ptr < OUTPUT_START;\\n}\\n\\n/**\\n * Check if a pointer is within the output buffer region.\\n *\\n * @param ptr - Pointer to check\\n * @return true if pointer is within output buffer, false otherwise\\n */\\nexport function isWithinOutputBuffer(ptr: usize): bool {\\n  return ptr >= OUTPUT_START && ptr < OUTPUT_VAR_START;\\n}\\n\\n/**\\n * Check if a pointer is within the output variable data region.\\n *\\n * @param ptr - Pointer to check\\n * @return true if pointer is within output variable data, false otherwise\\n */\\nexport function isWithinOutputVar(ptr: usize): bool {\\n  return ptr >= OUTPUT_VAR_START && ptr < HEAP_START;\\n}\\n\\n/**\\n * Check if a pointer is within the heap region.\\n *\\n * @param ptr - Pointer to check\\n * @return true if pointer is within heap, false otherwise\\n */\\nexport function isWithinHeap(ptr: usize): bool {\\n  return ptr >= HEAP_START;\\n}\\n\";\nexport const RUNTIME_STRINGS = \"// assembly/runtime/strings.ts (AssemblyScript)\\n// UTF-16 string handling for WASM linear memory\\n\\nimport { heapAlloc } from './memory';\\n\\n// ============================================================================\\n// String Memory Format\\n// ============================================================================\\n\\n/**\\n * String memory layout: [length: u32][utf16 chars...]\\n *\\n * We use a length-prefixed format; this allows O(1) length checks and efficient substring\\n * operations without scanning for null terminators. Also matches AssemblyScript's native\\n * string representation. The first 4 bytes contain the length (number of UTF-16 code units).\\n * Following that are the UTF-16 code units, each 2 bytes.\\n */\\n\\n// ============================================================================\\n// String Constants\\n// ============================================================================\\n\\n/**\\n * Size of the length field header in bytes.\\n */\\nexport const STRING_LENGTH_SIZE: usize = 4;\\n\\n/**\\n * Size of each UTF-16 code unit in bytes.\\n */\\nexport const UTF16_CODE_UNIT_SIZE: usize = 2;\\n\\n/**\\n * Minimum string length to use bulk memory operations.\\n * For strings shorter than this, character-by-character writes are used\\n * as the setup overhead dominates. For longer strings, bulk operations\\n * provide significant performance benefits.\\n */\\nconst MIN_BULK_COPY_STRING_LENGTH: usize = 32;\\n\\n// ============================================================================\\n// String Writing\\n// ============================================================================\\n\\n/**\\n * Write a string to memory and return its pointer.\\n *\\n * Memory is allocated from the runtime heap using heapAlloc().\\n * The memory is aligned to 4 bytes for efficient access.\\n *\\n * @param s - The string to write to memory\\n * @returns Pointer to the allocated string data, or 0 if allocation failed\\n */\\nexport function writeString(s: string): usize {\\n  const len: usize = <usize>s.length;\\n\\n  // Calculate total size: length field (4 bytes) + UTF-16 characters (2 bytes each)\\n  const totalSize = STRING_LENGTH_SIZE + len * UTF16_CODE_UNIT_SIZE;\\n\\n  // Four-byte alignment ensures proper alignment for u32 loads/stores, avoiding unaligned access\\n  // penalties on some architectures. WASM requires aligned memory access for multi-byte types.\\n  // Allocate memory from heap\\n  const ptr = heapAlloc(totalSize);\\n\\n  // Return 0 if allocation failed\\n  if (ptr == 0) {\\n    return 0;\\n  }\\n\\n  // Write length (number of UTF-16 code units)\\n  store<u32>(ptr, len);\\n\\n  // Handle empty string case (len == 0)\\n  if (len == 0) {\\n    return ptr;\\n  }\\n\\n  // For long strings, use bulk memory copy for better performance.\\n  // AssemblyScript strings are internally UTF-16, matching our memory format.\\n  if (len >= MIN_BULK_COPY_STRING_LENGTH) {\\n    // Get pointer to the string's internal UTF-16 data\\n    const srcPtr = changetype<usize>(s);\\n    // Copy the UTF-16 data directly\\n    memory.copy(ptr + STRING_LENGTH_SIZE, srcPtr, len * UTF16_CODE_UNIT_SIZE);\\n  } else {\\n    // For short strings, character-by-character writes avoid bulk operation overhead\\n    for (let i: usize = 0; i < len; i++) {\\n      const codeUnit: u16 = unchecked(<u16>s.charCodeAt(<i32>i));\\n      store<u16>(ptr + STRING_LENGTH_SIZE + i * UTF16_CODE_UNIT_SIZE, codeUnit);\\n    }\\n  }\\n\\n  return ptr;\\n}\\n\\n// ============================================================================\\n// String Reading\\n// ============================================================================\\n\\n/**\\n * Read a string from memory.\\n *\\n * @param ptr - Pointer to the string data in memory\\n * @returns The read string, or empty string if pointer is null\\n */\\nexport function readString(ptr: usize): string {\\n  // Return empty string for null pointer\\n  if (ptr == 0) {\\n    return '';\\n  }\\n\\n  // Read length (number of UTF-16 code units)\\n  const len: usize = <usize>load<u32>(ptr);\\n\\n  // Handle empty string case\\n  if (len == 0) {\\n    return '';\\n  }\\n\\n  // Use bulk memory read for O(n) performance instead of O(n²) string concatenation.\\n  // String.UTF16.decodeUnsafe reads UTF-16 data directly from memory in a single allocation,\\n  // avoiding the repeated string allocations that occur with character-by-character concatenation.\\n  return String.UTF16.decodeUnsafe(ptr + STRING_LENGTH_SIZE, len * UTF16_CODE_UNIT_SIZE);\\n}\\n\\n// ============================================================================\\n// String Utility Functions\\n// ============================================================================\\n\\n/**\\n * Calculate the size in bytes needed to store a string in memory.\\n *\\n * @param len - The length of the string (number of UTF-16 code units)\\n * @returns The total size in bytes including the length header\\n */\\nexport function getStringSize(len: usize): usize {\\n  return STRING_LENGTH_SIZE + len * UTF16_CODE_UNIT_SIZE;\\n}\\n\\n/**\\n * Calculate the length of a string from its pointer in memory.\\n *\\n * @param ptr - Pointer to the string data in memory\\n * @returns The length of the string (number of UTF-16 code units), or 0 if null\\n */\\nexport function getStringLength(ptr: usize): usize {\\n  if (ptr == 0) {\\n    return 0;\\n  }\\n  return load<u32>(ptr);\\n}\\n\\n/**\\n * Check if a string pointer points to an empty string.\\n *\\n * @param ptr - Pointer to the string data in memory\\n * @returns true if the string is empty or pointer is null, false otherwise\\n */\\nexport function isStringEmpty(ptr: usize): bool {\\n  if (ptr == 0) {\\n    return true;\\n  }\\n  return load<u32>(ptr) == 0;\\n}\\n\\n/**\\n * Compare two strings in memory.\\n *\\n * @param ptr1 - Pointer to the first string\\n * @param ptr2 - Pointer to the second string\\n * @returns true if the strings are equal, false otherwise\\n */\\nexport function stringsEqual(ptr1: usize, ptr2: usize): bool {\\n  // If both are null, they're equal\\n  if (ptr1 == 0 && ptr2 == 0) {\\n    return true;\\n  }\\n\\n  // If only one is null, they're not equal\\n  if (ptr1 == 0 || ptr2 == 0) {\\n    return false;\\n  }\\n\\n  // Compare lengths\\n  const len1 = load<u32>(ptr1);\\n  const len2 = load<u32>(ptr2);\\n\\n  if (len1 != len2) {\\n    return false;\\n  }\\n\\n  // Compare each UTF-16 code unit\\n  for (let i: usize = 0; i < <usize>len1; i++) {\\n    const offset = STRING_LENGTH_SIZE + i * UTF16_CODE_UNIT_SIZE;\\n    const char1 = load<u16>(ptr1 + offset);\\n    const char2 = load<u16>(ptr2 + offset);\\n    if (char1 != char2) {\\n      return false;\\n    }\\n  }\\n\\n  return true;\\n}\\n\\n/**\\n * Calculate a simple hash of a string in memory.\\n *\\n * This can be used for quick comparisons or deduplication.\\n * Uses a simple polynomial rolling hash algorithm.\\n *\\n * @param ptr - Pointer to the string data in memory\\n * @returns A hash value for the string (0 if null)\\n */\\nexport function hashString(ptr: usize): u32 {\\n  if (ptr == 0) {\\n    return 0;\\n  }\\n\\n  const len: usize = <usize>load<u32>(ptr);\\n  let hash: u32 = 5381;\\n\\n  for (let i: usize = 0; i < len; i++) {\\n    const charCode = load<u16>(ptr + STRING_LENGTH_SIZE + i * UTF16_CODE_UNIT_SIZE);\\n    hash = unchecked((hash << 5) + hash + unchecked(charCode)); // hash * 33 + charCode\\n  }\\n\\n  return hash;\\n}\\n\\n/**\\n * Copy a string within memory.\\n *\\n * Creates a new copy of the string at a new location in the heap.\\n *\\n * @param srcPtr - Pointer to the source string\\n * @returns Pointer to the newly allocated copy, or 0 if allocation failed\\n */\\nexport function copyString(srcPtr: usize): usize {\\n  if (srcPtr == 0) {\\n    return 0;\\n  }\\n\\n  // Get the length of the source string\\n  const len: usize = <usize>load<u32>(srcPtr);\\n\\n  // Calculate total size\\n  const totalSize = STRING_LENGTH_SIZE + len * UTF16_CODE_UNIT_SIZE;\\n\\n  // Allocate new memory\\n  const dstPtr = heapAlloc(totalSize);\\n\\n  if (dstPtr == 0) {\\n    return 0;\\n  }\\n\\n  // Copy the entire string data (length header + UTF-16 code units)\\n  memory.copy(dstPtr, srcPtr, totalSize);\\n\\n  return dstPtr;\\n}\\n\";\nexport const RUNTIME_ARRAYS = \"// assembly/runtime/arrays.ts (AssemblyScript)\\n// Array handling for WASM linear memory\\n\\nimport { heapAlloc } from './memory';\\nimport { writeString, readString } from './strings';\\nimport {\\n  Value,\\n  TYPE_NULL,\\n  TYPE_BOOL,\\n  TYPE_INT,\\n  TYPE_FLOAT,\\n  TYPE_STRING,\\n  TYPE_ARRAY,\\n  TYPE_OBJECT,\\n} from './values';\\n\\n// ============================================================================\\n// Array Constants\\n// ============================================================================\\n\\n/**\\n * Size of the length field header in bytes for arrays.\\n */\\nexport const ARRAY_LENGTH_SIZE: usize = 4;\\n\\n/**\\n * Size of each F64 element in bytes.\\n */\\nexport const F64_ELEMENT_SIZE: usize = 8;\\n\\n/**\\n * Size of each element pointer (usize) in bytes for generic arrays.\\n */\\nexport const ELEMENT_PTR_SIZE: usize = 4;\\n\\n/**\\n * Size of the type tag field in bytes for serialized Values.\\n */\\nexport const VALUE_TYPE_SIZE: usize = 4;\\n\\n/**\\n * Size of the bool field in bytes for serialized Values.\\n */\\nexport const VALUE_BOOL_SIZE: usize = 1;\\n\\n/**\\n * Size of the int field in bytes for serialized Values.\\n */\\nexport const VALUE_INT_SIZE: usize = 8;\\n\\n/**\\n * Size of the float field in bytes for serialized Values.\\n */\\nexport const VALUE_FLOAT_SIZE: usize = 8;\\n\\n/**\\n * Size of the pointer field in bytes for serialized Values (string, array, object).\\n */\\nexport const VALUE_PTR_SIZE: usize = 4;\\n\\n// ============================================================================\\n// F64 Array Handling\\n// ============================================================================\\n\\n/**\\n * Write a numeric array (Array<f64>) to memory.\\n *\\n * The array is stored in the format: [length: u32][f64 elements...]\\n *\\n * Memory is allocated from the runtime heap using heapAlloc().\\n * The memory is aligned to 8 bytes for efficient access.\\n *\\n * @param arr - The array to write to memory\\n * @returns Pointer to the allocated array data, or 0 if allocation failed\\n */\\nexport function writeF64Array(arr: Array<f64>): usize {\\n  const len = <u32>arr.length;\\n\\n  // Calculate total size: length field (4 bytes) + f64 elements (8 bytes each)\\n  const totalSize = ARRAY_LENGTH_SIZE + <usize>len * F64_ELEMENT_SIZE;\\n\\n  // Allocate memory from heap\\n  const ptr = heapAlloc(totalSize);\\n\\n  // Return 0 if allocation failed\\n  if (ptr == 0) {\\n    return 0;\\n  }\\n\\n  // Write length\\n  store<u32>(ptr, len);\\n\\n  // Write each f64 element\\n  for (let i: u32 = 0; i < len; i++) {\\n    store<f64>(ptr + ARRAY_LENGTH_SIZE + <usize>i * F64_ELEMENT_SIZE, arr[i]);\\n  }\\n\\n  return ptr;\\n}\\n\\n/**\\n * Read a numeric array (Array<f64>) from memory.\\n *\\n * The array must be stored in the format: [length: u32][f64 elements...]\\n *\\n * @param ptr - Pointer to the array data in memory\\n * @returns The read array, or empty array if pointer is null\\n */\\nexport function readF64Array(ptr: usize): Array<f64> {\\n  // Return empty array for null pointer\\n  if (ptr == 0) {\\n    return new Array<f64>();\\n  }\\n\\n  // Read length\\n  const len = load<u32>(ptr);\\n\\n  // Create array and populate it\\n  const result = new Array<f64>(len);\\n  for (let i: u32 = 0; i < len; i++) {\\n    result[i] = load<f64>(ptr + ARRAY_LENGTH_SIZE + <usize>i * F64_ELEMENT_SIZE);\\n  }\\n\\n  return result;\\n}\\n\\n/**\\n * Calculate the size in bytes needed to store an F64 array in memory.\\n *\\n * @param len - The length of the array\\n * @returns The total size in bytes including the length header\\n */\\nexport function getF64ArraySize(len: usize): usize {\\n  return ARRAY_LENGTH_SIZE + len * F64_ELEMENT_SIZE;\\n}\\n\\n// ============================================================================\\n// Value Serialization\\n// ============================================================================\\n\\n/**\\n * Write a Value to memory and return its pointer.\\n *\\n * For complex types (string/array/object), storing the actual data inline would make\\n * Value structs variable-sized and unpredictable. Storing pointers provides fixed-size\\n * Values (predictable offsets) while allowing arbitrary complex data on the heap.\\n *\\n * The Value is stored in the format: [type: u32][value_data...]\\n *\\n * For primitive types (bool, int, float), value_data is the actual value.\\n * For complex types (string, array, object), value_data is a pointer to the data.\\n *\\n * Memory is allocated from the runtime heap using heapAlloc().\\n *\\n * @param v - The Value to write to memory\\n * @returns Pointer to the allocated Value data, or 0 if allocation failed\\n */\\nexport function writeValue(v: Value): usize {\\n  const type = v.type;\\n\\n  if (type == TYPE_NULL) {\\n    // For null, just write the type tag\\n    const ptr = heapAlloc(VALUE_TYPE_SIZE);\\n    if (ptr == 0) return 0;\\n    store<u32>(ptr, type);\\n    return ptr;\\n  } else if (type == TYPE_BOOL) {\\n    // Format: [type: u32][bool: u8]\\n    const ptr = heapAlloc(VALUE_TYPE_SIZE + VALUE_BOOL_SIZE);\\n    if (ptr == 0) return 0;\\n    store<u32>(ptr, type);\\n    store<u8>(ptr + VALUE_TYPE_SIZE, v.boolVal ? 1 : 0);\\n    return ptr;\\n  } else if (type == TYPE_INT) {\\n    // Format: [type: u32][int: i64]\\n    const ptr = heapAlloc(VALUE_TYPE_SIZE + VALUE_INT_SIZE);\\n    if (ptr == 0) return 0;\\n    store<u32>(ptr, type);\\n    store<i64>(ptr + VALUE_TYPE_SIZE, v.intVal);\\n    return ptr;\\n  } else if (type == TYPE_FLOAT) {\\n    // Format: [type: u32][float: f64]\\n    const ptr = heapAlloc(VALUE_TYPE_SIZE + VALUE_FLOAT_SIZE);\\n    if (ptr == 0) return 0;\\n    store<u32>(ptr, type);\\n    store<f64>(ptr + VALUE_TYPE_SIZE, v.floatVal);\\n    return ptr;\\n  } else if (type == TYPE_STRING) {\\n    // Format: [type: u32][stringPtr: u32]\\n    const ptr = heapAlloc(VALUE_TYPE_SIZE + VALUE_PTR_SIZE);\\n    if (ptr == 0) return 0;\\n    store<u32>(ptr, type);\\n    const stringVal = v.stringVal != null ? v.stringVal! : '';\\n    const stringPtr = writeString(stringVal);\\n    store<u32>(ptr + VALUE_TYPE_SIZE, stringPtr);\\n    return ptr;\\n  } else if (type == TYPE_ARRAY) {\\n    // Format: [type: u32][arrayPtr: u32]\\n    const ptr = heapAlloc(VALUE_TYPE_SIZE + VALUE_PTR_SIZE);\\n    if (ptr == 0) return 0;\\n    store<u32>(ptr, type);\\n    const arrayVal = v.arrayVal != null ? v.arrayVal! : new Array<Value>();\\n    const arrayPtr = writeValueArray(arrayVal);\\n    store<u32>(ptr + VALUE_TYPE_SIZE, arrayPtr);\\n    return ptr;\\n  } else if (type == TYPE_OBJECT) {\\n    // Format: [type: u32][objectPtr: u32]\\n    const ptr = heapAlloc(VALUE_TYPE_SIZE + VALUE_PTR_SIZE);\\n    if (ptr == 0) return 0;\\n    store<u32>(ptr, type);\\n    const objectVal = v.objectVal != null ? v.objectVal! : new Map<string, Value>();\\n    const objectPtr = writeValueMap(objectVal);\\n    store<u32>(ptr + VALUE_TYPE_SIZE, objectPtr);\\n    return ptr;\\n  }\\n\\n  return 0; // Unknown type\\n}\\n\\n/**\\n * Read a Value from memory.\\n *\\n * The Value must be stored in the format: [type: u32][value_data...]\\n *\\n * @param ptr - Pointer to the Value data in memory\\n * @returns The read Value, or null if pointer is invalid\\n */\\nexport function readValue(ptr: usize): Value {\\n  // Return null for null pointer\\n  if (ptr == 0) {\\n    return Value.Null();\\n  }\\n\\n  // Read type\\n  const type = load<u32>(ptr);\\n\\n  if (type == TYPE_NULL) {\\n    return Value.Null();\\n  } else if (type == TYPE_BOOL) {\\n    const boolVal = load<u8>(ptr + VALUE_TYPE_SIZE) != 0;\\n    return Value.Bool(boolVal);\\n  } else if (type == TYPE_INT) {\\n    const intVal = load<i64>(ptr + VALUE_TYPE_SIZE);\\n    return Value.Int(intVal);\\n  } else if (type == TYPE_FLOAT) {\\n    const floatVal = load<f64>(ptr + VALUE_TYPE_SIZE);\\n    return Value.Float(floatVal);\\n  } else if (type == TYPE_STRING) {\\n    const stringPtr = load<u32>(ptr + VALUE_TYPE_SIZE);\\n    const stringVal = readString(stringPtr);\\n    return Value.String(stringVal);\\n  } else if (type == TYPE_ARRAY) {\\n    const arrayPtr = load<u32>(ptr + VALUE_TYPE_SIZE);\\n    const arrayVal = readValueArray(arrayPtr);\\n    return Value.Array(arrayVal);\\n  } else if (type == TYPE_OBJECT) {\\n    const objectPtr = load<u32>(ptr + VALUE_TYPE_SIZE);\\n    const objectVal = readValueMap(objectPtr);\\n    return Value.Object(objectVal);\\n  }\\n\\n  return Value.Null(); // Unknown type\\n}\\n\\n// ============================================================================\\n// Value Array Handling\\n// ============================================================================\\n\\n// Format marker for flat numeric arrays (high bit set in length field)\\nconst FLAT_ARRAY_MARKER: u32 = 0x80000000;\\n\\n/**\\n * Detect if an array contains only floats/ints (homogeneous numeric array).\\n *\\n * @param arr - The array to check\\n * @returns true if all elements are TYPE_FLOAT or TYPE_INT, false otherwise\\n */\\nfunction isHomogeneousNumericArray(arr: Array<Value>): bool {\\n  const len = arr.length;\\n  if (len == 0) return false;\\n\\n  for (let i = 0; i < len; i++) {\\n    const type = arr[i].type;\\n    if (type != TYPE_FLOAT && type != TYPE_INT) {\\n      return false;\\n    }\\n  }\\n  return true;\\n}\\n\\n/**\\n * Write a homogeneous numeric array in flat format.\\n *\\n * Format: [length | FLAT_ARRAY_MARKER: u32][f64 elements...]\\n *\\n * The high bit of the length field is set to indicate flat format.\\n * This specialized format avoids individual Value allocations and type tags,\\n * reducing memory overhead and fragmentation significantly.\\n *\\n * @param arr - The array to write (must be homogeneous numeric)\\n * @returns Pointer to the allocated array data, or 0 if allocation failed\\n */\\nfunction writeHomogeneousNumericArray(arr: Array<Value>): usize {\\n  const len = <u32>arr.length;\\n\\n  // Calculate total size: length with marker (4) + f64 elements (8 each)\\n  const totalSize = ARRAY_LENGTH_SIZE + <usize>len * F64_ELEMENT_SIZE;\\n\\n  // Single allocation for entire array\\n  const ptr = heapAlloc(totalSize);\\n  if (ptr == 0) return 0;\\n\\n  // Write length with high bit set to indicate flat format\\n  store<u32>(ptr, len | FLAT_ARRAY_MARKER);\\n\\n  // Write all numeric values as f64 directly (no Value wrapping)\\n  for (let i: u32 = 0; i < len; i++) {\\n    const val = arr[i];\\n    const numVal = val.type == TYPE_FLOAT ? val.floatVal : <f64>val.intVal;\\n    store<f64>(ptr + ARRAY_LENGTH_SIZE + <usize>i * F64_ELEMENT_SIZE, numVal);\\n  }\\n\\n  return ptr;\\n}\\n\\n/**\\n * Read a homogeneous numeric array from flat format.\\n *\\n * Format: [length | FLAT_ARRAY_MARKER: u32][f64 elements...]\\n *\\n * @param ptr - Pointer to the array data in memory\\n * @param len - The actual length (without the marker bit)\\n * @returns The read array of Value objects\\n */\\nfunction readHomogeneousNumericArray(ptr: usize, len: u32): Array<Value> {\\n  const result = new Array<Value>(len);\\n\\n  // Read all f64 values and wrap them as Value.Float\\n  for (let i: u32 = 0; i < len; i++) {\\n    const numVal = load<f64>(ptr + ARRAY_LENGTH_SIZE + <usize>i * F64_ELEMENT_SIZE);\\n    result[i] = Value.Float(numVal);\\n  }\\n\\n  return result;\\n}\\n\\n/**\\n * Write a Value array to memory.\\n *\\n * The array is stored in one of two formats:\\n *\\n * 1. Flat numeric format (for homogeneous numeric arrays):\\n *    [length | FLAT_ARRAY_MARKER: u32][f64 elements...]\\n *\\n * 2. Generic format (for mixed-type arrays):\\n *    [length: u32][Value pointers...]\\n *\\n * Homogeneous numeric arrays are detected and serialized using a flat format\\n * that eliminates per-element allocations and type tags, significantly reducing\\n * memory overhead (from ~16+ bytes per element to 8 bytes) and fragmentation.\\n * The flat format is indicated by setting the high bit of the length field.\\n *\\n * Memory is allocated from the runtime heap using heapAlloc().\\n *\\n * @param arr - The array to write to memory\\n * @returns Pointer to the allocated array data, or 0 if allocation failed\\n */\\nexport function writeValueArray(arr: Array<Value>): usize {\\n  const len = <u32>arr.length;\\n\\n  // Empty array (generic format)\\n  if (len == 0) {\\n    const ptr = heapAlloc(ARRAY_LENGTH_SIZE);\\n    if (ptr == 0) return 0;\\n    store<u32>(ptr, 0);\\n    return ptr;\\n  }\\n\\n  // Optimization: detect homogeneous numeric arrays and use flat format\\n  if (isHomogeneousNumericArray(arr)) {\\n    return writeHomogeneousNumericArray(arr);\\n  }\\n\\n  // Generic path: mixed-type array\\n  // Format: [length: u32][Value pointers...]\\n  const totalSize = ARRAY_LENGTH_SIZE + <usize>len * ELEMENT_PTR_SIZE;\\n\\n  const ptr = heapAlloc(totalSize);\\n  if (ptr == 0) return 0;\\n\\n  store<u32>(ptr, len);\\n\\n  // Write each Value pointer\\n  for (let i: u32 = 0; i < len; i++) {\\n    const valuePtr = writeValue(arr[i]);\\n    store<u32>(ptr + ARRAY_LENGTH_SIZE + <usize>i * ELEMENT_PTR_SIZE, valuePtr);\\n  }\\n\\n  return ptr;\\n}\\n\\n/**\\n * Read a Value array from memory.\\n *\\n * Handles both flat numeric format and generic format:\\n *\\n * 1. Flat numeric format: [length | FLAT_ARRAY_MARKER: u32][f64 elements...]\\n * 2. Generic format: [length: u32][Value pointers...]\\n *\\n * The format is detected by checking if the high bit of the length is set.\\n *\\n * @param ptr - Pointer to the array data in memory\\n * @returns The read array, or empty array if pointer is null\\n */\\nexport function readValueArray(ptr: usize): Array<Value> {\\n  // Return empty array for null pointer\\n  if (ptr == 0) {\\n    return new Array<Value>();\\n  }\\n\\n  // Read length (with potential marker bit)\\n  const lengthField = load<u32>(ptr);\\n\\n  // Check if this is a flat numeric array (high bit set)\\n  if ((lengthField & FLAT_ARRAY_MARKER) != 0) {\\n    // Flat numeric format - extract actual length\\n    const len = lengthField & ~FLAT_ARRAY_MARKER;\\n    return readHomogeneousNumericArray(ptr, len);\\n  }\\n\\n  // Generic format - length is used as-is\\n  const len = lengthField;\\n\\n  // Empty array\\n  if (len == 0) {\\n    return new Array<Value>();\\n  }\\n\\n  // Read array of Value pointers\\n  const result = new Array<Value>(len);\\n  for (let i: u32 = 0; i < len; i++) {\\n    const valuePtr = load<u32>(ptr + ARRAY_LENGTH_SIZE + <usize>i * ELEMENT_PTR_SIZE);\\n    result[i] = readValue(valuePtr);\\n  }\\n\\n  return result;\\n}\\n\\n/**\\n * Calculate the size in bytes needed to store a Value array in memory.\\n *\\n * Note: This calculates the size for the generic format.\\n * For flat numeric arrays, the actual size may be different.\\n *\\n * @param len - The length of the array\\n * @returns The total size in bytes including the length header (but not the individual Values)\\n */\\nexport function getValueArraySize(len: usize): usize {\\n  return ARRAY_LENGTH_SIZE + len * ELEMENT_PTR_SIZE;\\n}\\n\\n// ============================================================================\\n// Value Map (Object) Handling\\n// ============================================================================\\n\\n/**\\n * Write a Value map to memory.\\n *\\n * The map is stored in the format: [length: u32][keyPtr1: u32][valuePtr1: u32][keyPtr2: u32][valuePtr2: u32]...\\n *\\n * Keys are always strings and written to memory separately using writeString().\\n * Values are serialized using writeValue() separately.\\n *\\n * Memory is allocated from the runtime heap using heapAlloc().\\n *\\n * JavaScript object property order is insertion-ordered (ES2015+), so we must preserve\\n * order when serializing to match JS semantics and ensure deterministic output.\\n *\\n * @param map - The map to write to memory\\n * @returns Pointer to the allocated map data, or 0 if allocation failed\\n */\\nexport function writeValueMap(map: Map<string, Value>): usize {\\n  const len = <u32>map.size;\\n\\n  // Calculate total size: length field (4 bytes) + key/value pairs (8 bytes each)\\n  const totalSize = ARRAY_LENGTH_SIZE + <usize>len * 2 * ELEMENT_PTR_SIZE;\\n\\n  // Allocate memory from heap\\n  const ptr = heapAlloc(totalSize);\\n\\n  // Return 0 if allocation failed\\n  if (ptr == 0) {\\n    return 0;\\n  }\\n\\n  // Write length\\n  store<u32>(ptr, len);\\n\\n  // Get keys and write each key/value pair\\n  const keys = map.keys();\\n  for (let i: u32 = 0; i < <u32>keys.length; i++) {\\n    const key = keys[i];\\n    const offset = ptr + ARRAY_LENGTH_SIZE + <usize>i * 2 * ELEMENT_PTR_SIZE;\\n\\n    // Write key pointer\\n    const keyPtr = writeString(key);\\n    store<u32>(offset, keyPtr);\\n\\n    // Write value pointer\\n    const valuePtr = writeValue(map.get(key));\\n    store<u32>(offset + ELEMENT_PTR_SIZE, valuePtr);\\n  }\\n\\n  return ptr;\\n}\\n\\n/**\\n * Read a Value map from memory.\\n *\\n * The map must be stored in the format: [length: u32][keyPtr1: u32][valuePtr1: u32][keyPtr2: u32][valuePtr2: u32]...\\n *\\n * @param ptr - Pointer to the map data in memory\\n * @returns The read map, or empty map if pointer is null\\n */\\nexport function readValueMap(ptr: usize): Map<string, Value> {\\n  // Return empty map for null pointer\\n  if (ptr == 0) {\\n    return new Map<string, Value>();\\n  }\\n\\n  // Read length\\n  const len = load<u32>(ptr);\\n\\n  // Create map and populate it\\n  const result = new Map<string, Value>();\\n  for (let i: u32 = 0; i < len; i++) {\\n    const keyPtr = load<u32>(ptr + ARRAY_LENGTH_SIZE + <usize>i * 2 * ELEMENT_PTR_SIZE);\\n    const valuePtr = load<u32>(\\n      ptr + ARRAY_LENGTH_SIZE + <usize>i * 2 * ELEMENT_PTR_SIZE + ELEMENT_PTR_SIZE,\\n    );\\n\\n    const key = readString(keyPtr);\\n    const value = readValue(valuePtr);\\n\\n    result.set(key, value);\\n  }\\n\\n  return result;\\n}\\n\\n// ============================================================================\\n// Array Utility Functions\\n// ============================================================================\\n\\n/**\\n * Calculate the length of an array from its pointer in memory.\\n *\\n * @param ptr - Pointer to the array data in memory\\n * @returns The length of the array, or 0 if null\\n */\\nexport function getArrayLength(ptr: usize): usize {\\n  if (ptr == 0) {\\n    return 0;\\n  }\\n  return load<u32>(ptr);\\n}\\n\\n/**\\n * Check if an array pointer points to an empty array.\\n *\\n * @param ptr - Pointer to the array data in memory\\n * @returns true if the array is empty or pointer is null, false otherwise\\n */\\nexport function isArrayEmpty(ptr: usize): bool {\\n  if (ptr == 0) {\\n    return true;\\n  }\\n  return load<u32>(ptr) == 0;\\n}\\n\";","/**\n * AssemblyScript compilation to WebAssembly.\n * Handles compiler invocation, optimization levels, and memory configuration.\n */\n\nimport * as fs from 'fs';\nimport * as path from 'path';\nimport type { CompilerOptions } from './types';\nimport { CompilationError, ErrorCode } from './errors';\nimport { createVirtualFS, createASCFileSystemCallbacks, getCompilationOutput } from './virtual-fs';\n\n// ============================================================================\n// Compilation Thresholds and Memory Constants\n// ============================================================================\n\n/**\n * Threshold for determining if a module is \"large\" (40KB of source code).\n *\n * Empirically determined based on decision table compilation patterns:\n * - Tables with 1000+ rules generate >40KB of code\n * - These create deeply nested if/else chains that stress the optimizer\n * - Larger modules need more initial memory to avoid runtime growth overhead\n *\n * Large modules require:\n * 1. More initial memory pages (16 vs 4) for string allocations\n * 2. Lower optimization level (O2 vs O3) to avoid stack overflow in Binaryen\n * 3. Skipping WAT generation to avoid O(n²) memory complexity\n */\nconst LARGE_MODULE_THRESHOLD_BYTES = 40000;\n\n/**\n * Threshold for \"very large\" modules (1MB of source code).\n * These modules skip optimization entirely to avoid Binaryen crashes.\n */\nconst VERY_LARGE_MODULE_THRESHOLD_BYTES = 1_000_000;\n\n// Normal module memory configuration (for modules < 40KB)\n/** Initial memory pages for normal modules (256KB total) */\nconst NORMAL_MODULE_INITIAL_PAGES = 4;\n/** Maximum memory pages for normal modules (1MB total) */\nconst NORMAL_MODULE_MAX_PAGES = 16;\n\n// Large module memory configuration (for modules >= 40KB)\n/** Initial memory pages for large modules (1MB total) */\nconst LARGE_MODULE_INITIAL_PAGES = 16;\n/** Maximum memory pages for large modules (16MB total) */\nconst LARGE_MODULE_MAX_PAGES = 256;\n\n/**\n * Compilation settings based on code size.\n * Large modules need different optimization and memory settings.\n */\nexport interface CompilationSettings {\n  /** Whether the module is considered large (>40KB) */\n  isLargeModule: boolean;\n  /** Initial WebAssembly memory pages (64KB each) */\n  initialMemoryPages: number;\n  /** Maximum WebAssembly memory pages */\n  maxMemoryPages: number;\n  /** Binaryen optimization level (0-3) */\n  optimizeLevel: number;\n  /** Binaryen shrink level (0-2) */\n  shrinkLevel: number;\n  /** Whether to generate WAT text format */\n  generateWat: boolean;\n}\n\n/**\n * Determine compilation settings based on code size.\n *\n * Memory pages are 64KB each (WASM_PAGE_SIZE_BYTES). Large modules need more\n * initial memory to avoid runtime allocation overhead during string operations\n * and table lookups.\n * - Normal modules: NORMAL_MODULE_INITIAL_PAGES (256KB), max NORMAL_MODULE_MAX_PAGES (1MB)\n * - Large modules: LARGE_MODULE_INITIAL_PAGES (1MB), max LARGE_MODULE_MAX_PAGES (16MB)\n *\n * Large modules (>LARGE_MODULE_THRESHOLD_BYTES) need more memory because:\n *  (1) decision tables generate many string allocations during lookup,\n *  (2) each string requires heap allocation at runtime, and\n *  (3) insufficient initial memory causes frequent growth operations which are slow.\n *\n * Optimization levels scaled by module size because:\n *  (1) Binaryen's optimizer recursively traverses deeply nested if/else chains,\n *  (2) decision tables with 1000+ rules create nesting depth that exceeds stack limits at O3,\n *  (3) O2 uses iterative algorithms that handle deep nesting,\n *  (4) very large modules (>1MB) disable optimization entirely to avoid 10+ minute compile times.\n *\n * WAT generation skipped for large modules because Binaryen's text emitter has O(n²)\n * memory complexity and crashes with OOM on modules >LARGE_MODULE_THRESHOLD_BYTES source.\n *\n * @param codeLength - Length of the AssemblyScript source code\n * @returns Compilation settings appropriate for the code size\n */\nexport function getCompilationSettings(codeLength: number): CompilationSettings {\n  const isLargeModule = codeLength > LARGE_MODULE_THRESHOLD_BYTES;\n  const isVeryLargeModule = codeLength > VERY_LARGE_MODULE_THRESHOLD_BYTES;\n\n  let optimizeLevel: number;\n  let shrinkLevel: number;\n\n  if (isVeryLargeModule) {\n    // Very large module (>1MB source) - skip optimization to avoid Binaryen crash\n    optimizeLevel = 0;\n    shrinkLevel = 0;\n  } else if (isLargeModule) {\n    // Medium-large module (40KB-1MB) - use moderate optimization\n    optimizeLevel = 2;\n    shrinkLevel = 1;\n  } else {\n    // Small module (<40KB) - use full optimization\n    optimizeLevel = 3;\n    shrinkLevel = 2;\n  }\n\n  return {\n    isLargeModule,\n    initialMemoryPages: isLargeModule ? LARGE_MODULE_INITIAL_PAGES : NORMAL_MODULE_INITIAL_PAGES,\n    maxMemoryPages: isLargeModule ? LARGE_MODULE_MAX_PAGES : NORMAL_MODULE_MAX_PAGES,\n    optimizeLevel,\n    shrinkLevel,\n    generateWat: !isLargeModule,\n  };\n}\n\n/**\n * Create a secure temporary debug file with restricted permissions.\n *\n * Creates a temporary directory with a random name and writes the code to a file\n * with 0o600 permissions (owner read/write only).\n *\n * This function only writes files if a debug output path is provided via options\n * or the JDM_ASM_DEBUG_OUTPUT environment variable.\n *\n * @param code - The code content to write\n * @param basePath - Base directory for debug output (from options or env var)\n * @param suffix - Optional suffix for the filename (e.g., \"-no-binary\")\n * @returns Path to the created debug file, or null if debug output is disabled or write fails\n */\nfunction createSecureDebugFile(\n  code: string,\n  basePath: string | undefined,\n  suffix = '',\n): string | null {\n  // Only write debug files if explicitly requested\n  if (!basePath) {\n    return null;\n  }\n\n  try {\n    // Create a secure temporary directory with random name\n    const tmpDir = fs.mkdtempSync(path.join(basePath, 'jdm-asm-debug-'));\n\n    // Create debug file path\n    const debugFile = path.join(tmpDir, `assembly-debug${suffix}.ts`);\n\n    // Write file with restricted permissions (owner read/write only)\n    fs.writeFileSync(debugFile, code, { mode: 0o600 });\n\n    return debugFile;\n  } catch (error) {\n    // Debug output is best-effort: warn but don't break compilation\n    const errorMsg = error instanceof Error ? error.message : String(error);\n    console.warn(`[jdm-asm] Warning: Failed to write debug output to ${basePath}: ${errorMsg}`);\n    return null;\n  }\n}\n\n/**\n * Build compiler arguments based on options and settings.\n *\n * @param options - User-provided compiler options\n * @param settings - Size-based compilation settings\n * @returns Array of command-line arguments for the ASC compiler\n */\nexport function buildCompilerArgs(\n  options: CompilerOptions,\n  settings: CompilationSettings,\n): string[] {\n  const args = [\n    'src/runtime/index.ts',\n    '--outFile',\n    'output.wasm',\n    '--runtime',\n    'incremental', // Use incremental GC runtime for memory reuse across evaluations\n    '--exportRuntime', // Export __new, __pin, __collect, etc.\n    '--initialMemory',\n    String(settings.initialMemoryPages),\n    '--maximumMemory',\n    String(settings.maxMemoryPages),\n  ];\n\n  // Only generate WAT for smaller modules (large ones crash Binaryen's text emitter)\n  if (settings.generateWat) {\n    args.push('--textFile', 'output.wat');\n  }\n\n  // Add optimization flags if requested\n  if (options.optimize) {\n    if (settings.optimizeLevel > 0) {\n      args.push('--optimize');\n    }\n    args.push('--optimizeLevel', String(settings.optimizeLevel));\n    args.push('--shrinkLevel', String(settings.shrinkLevel));\n  }\n\n  // Add debug flags if requested\n  if (options.debug) {\n    args.push('--debug', '--sourceMap');\n  }\n\n  // Disable assertions in production (non-debug) mode\n  if (!options.debug) {\n    args.push('--noAssert');\n  }\n\n  return args;\n}\n\n/**\n * Compile AssemblyScript code to WebAssembly.\n *\n * This function uses the AssemblyScript compiler to generate WASM from\n * the generated AssemblyScript source code using a virtual filesystem.\n *\n * **Filesystem Side Effects:**\n * If `options.debugOutputPath` is set or the `JDM_ASM_DEBUG_OUTPUT` environment\n * variable is defined, compilation failures will write the generated AssemblyScript\n * code to disk for debugging. Files are written to secure temporary directories\n * with restricted permissions (0o600) and are NOT automatically cleaned up.\n *\n * Note: This is the internal compilation function without caching.\n * Use compileAssemblyScript() from build.ts for cached compilation.\n *\n * @param code - The AssemblyScript source code to compile\n * @param options - Compiler options (optimize, debug, debugOutputPath, etc.)\n * @returns An object with the compiled binary and WAT text\n */\nexport async function compileAssemblyScriptInternal(\n  code: string,\n  options: CompilerOptions,\n): Promise<{ binary: Uint8Array; wat: string }> {\n  // Import the AssemblyScript compiler\n  const ascModule = await import('assemblyscript/asc');\n\n  // Determine debug output path: explicit option takes precedence over environment variable\n  const debugOutputPath = options.debugOutputPath ?? process.env.JDM_ASM_DEBUG_OUTPUT;\n\n  // Save generated code before compilation so it's available for debugging even if\n  // compilation crashes the process (Binaryen can segfault on malformed input).\n  // Only write if debug output is explicitly enabled.\n  const debugFile = createSecureDebugFile(code, debugOutputPath);\n\n  // Set up virtual filesystem\n  const virtualFS = createVirtualFS(code);\n\n  // Get size-based compilation settings\n  const settings = getCompilationSettings(code.length);\n\n  // Build compiler arguments\n  const compilerArgs = buildCompilerArgs(options, settings);\n\n  // Get filesystem callbacks for ASC\n  const fsCallbacks = createASCFileSystemCallbacks(virtualFS);\n\n  // Create an in-memory stderr stream\n  let stderrOutput = '';\n  const stderrStream = ascModule.createMemoryStream((chunk: Uint8Array | string) => {\n    stderrOutput += typeof chunk === 'string' ? chunk : new TextDecoder().decode(chunk);\n  });\n\n  // Compile using the asc compiler with virtual filesystem\n  const { error } = await ascModule.main(compilerArgs, {\n    ...fsCallbacks,\n    stderr: stderrStream,\n  });\n\n  // Check for compilation errors\n  if (error) {\n    const debugFileInfo = debugFile\n      ? `\\n\\nGenerated code saved to ${debugFile}`\n      : '\\n\\n(Set debugOutputPath option or JDM_ASM_DEBUG_OUTPUT env var to save generated code for debugging)';\n\n    throw new CompilationError(\n      `AssemblyScript compilation failed:\\n${stderrOutput || error.message}${debugFileInfo}`,\n      ErrorCode.PARSE_ERROR,\n      { field: 'assemblyScript' },\n      { stderrOutput },\n    );\n  }\n\n  // Get output from virtual filesystem\n  const output = getCompilationOutput(virtualFS);\n\n  if (!output.binary) {\n    const noBinaryDebugFile = createSecureDebugFile(code, debugOutputPath, '-no-binary');\n    stderrOutput = stderrOutput || '(no stderr output)';\n    const files = [...virtualFS.keys()].join(', ');\n\n    const debugFileInfo = noBinaryDebugFile\n      ? `\\nGenerated code saved to ${noBinaryDebugFile}`\n      : '\\n(Set debugOutputPath option or JDM_ASM_DEBUG_OUTPUT env var to save generated code for debugging)';\n\n    throw new CompilationError(\n      `Compilation produced no WASM binary output.\\nCompiler stderr: ${stderrOutput}\\nFiles in virtualFS: ${files}${debugFileInfo}`,\n      ErrorCode.PARSE_ERROR,\n      { field: 'assemblyScript' },\n      { stderrOutput, virtualFSFiles: files },\n    );\n  }\n\n  return {\n    binary: output.binary,\n    wat: output.wat ?? '',\n  };\n}\n","/**\n * Virtual filesystem for in-memory AssemblyScript compilation.\n * Manages file mappings for the ASC compiler.\n */\n\nimport {\n  RUNTIME_VALUES,\n  RUNTIME_CONTEXT,\n  RUNTIME_EXPRESSIONS,\n  RUNTIME_TABLES,\n  RUNTIME_MEMORY,\n  RUNTIME_STRINGS,\n  RUNTIME_ARRAYS,\n} from './runtime/index';\n\n/** VirtualFS stores files as string or Uint8Array content */\nexport type VirtualFS = Map<string, string | Uint8Array>;\n\n/**\n * Create a virtual filesystem with runtime libraries and user code.\n * @param code - User's AssemblyScript code to compile\n * @returns Configured virtual filesystem\n */\nexport function createVirtualFS(code: string): VirtualFS {\n  const virtualFS: VirtualFS = new Map();\n  virtualFS.set('src/runtime/index.ts', code);\n  virtualFS.set('src/runtime/values.ts', RUNTIME_VALUES);\n  virtualFS.set('src/runtime/context.ts', RUNTIME_CONTEXT);\n  virtualFS.set('src/runtime/expressions.ts', RUNTIME_EXPRESSIONS);\n  virtualFS.set('src/runtime/tables.ts', RUNTIME_TABLES);\n  virtualFS.set('src/runtime/memory.ts', RUNTIME_MEMORY);\n  virtualFS.set('src/runtime/strings.ts', RUNTIME_STRINGS);\n  virtualFS.set('src/runtime/arrays.ts', RUNTIME_ARRAYS);\n  return virtualFS;\n}\n\n/**\n * Create ASC-compatible file system callbacks.\n * @param virtualFS - The virtual filesystem to use\n * @returns Object with readFile, writeFile, listFiles functions for ASC compiler\n */\nexport function createASCFileSystemCallbacks(virtualFS: VirtualFS) {\n  return {\n    readFile(name: string, baseDir: string): string | null {\n      // Try multiple path variations to find the file\n      const possibleKeys = [\n        // 'src/runtime/index.ts'\n        name,\n        // './src/runtime/index.ts' or 'src/runtime/index.ts'\n        baseDir ? `${baseDir}/${name}` : name,\n        // Remove leading ./\n        name.startsWith('./') ? name.slice(2) : name,\n      ];\n\n      for (const key of possibleKeys) {\n        const content = virtualFS.get(key);\n        if (typeof content === 'string') {\n          return content;\n        }\n      }\n      return null;\n    },\n    writeFile(name: string, data: Uint8Array | string, baseDir: string): void {\n      const key = baseDir ? `${baseDir}/${name}` : name;\n      virtualFS.set(key, data);\n    },\n    listFiles(dirname: string, baseDir: string): string[] | null {\n      const prefix = baseDir ? `${baseDir}/${dirname}` : dirname;\n      return [...virtualFS.keys()].filter((f) => f.startsWith(prefix));\n    },\n  };\n}\n\n/**\n * Get output files from virtual filesystem after compilation.\n * @param virtualFS - The virtual filesystem\n * @returns Object with binary and wat files (may be undefined if not present)\n */\nexport function getCompilationOutput(virtualFS: VirtualFS): {\n  binary: Uint8Array | undefined;\n  wat: string | undefined;\n} {\n  // The compiler writes to ./output.wasm (with ./ prefix)\n  const binary = virtualFS.get('output.wasm') || virtualFS.get('./output.wasm');\n  const wat = virtualFS.get('output.wat') || virtualFS.get('./output.wat');\n  return {\n    binary: binary instanceof Uint8Array ? binary : undefined,\n    wat: typeof wat === 'string' ? wat : undefined,\n  };\n}\n","/**\n * JavaScript Marshaling Code Generation\n *\n * This module generates JavaScript code for serializing JavaScript objects to\n * WebAssembly memory and deserializing results back. The generated code handles:\n *\n * - Input marshaling: Converting JS objects to WASM memory format\n * - Output unmarshaling: Converting WASM memory back to JS objects\n * - Size calculation: Computing memory requirements for marshaling\n * - Type-tagged value encoding: Writing values with type tags for dynamic typing\n *\n * The generated code operates on DataView for cross-endian compatibility and\n * handles both fixed-size types (numbers, booleans) and variable-length types\n * (strings, arrays, objects).\n */\n\nimport type { FlattenedLayout } from '../types';\n\n/**\n * Generate JavaScript marshaling code.\n *\n * This function generates the JavaScript code that will serialize\n * JavaScript objects to WebAssembly memory and deserialize results back.\n *\n * @param inputLayout - The flattened input schema layout\n * @param outputLayout - The flattened output schema layout\n * @param schemaHash - The schema hash for runtime validation\n * @returns Generated JavaScript marshaling code as a string\n */\nexport function generateMarshalCode(\n  inputLayout: FlattenedLayout,\n  outputLayout: FlattenedLayout,\n  schemaHash: bigint,\n): string {\n  const schemaHashHex = `0x${schemaHash.toString(16).padStart(16, '0')}`;\n\n  // Calculate fixed sizes (sum of all fixed-size fields)\n  const inputFixedSize = inputLayout.fields\n    .filter((f) => f.size !== -1)\n    .reduce((sum, f) => sum + f.size, 0);\n  const outputFixedSize = outputLayout.fields\n    .filter((f) => f.size !== -1)\n    .reduce((sum, f) => sum + f.size, 0);\n\n  return `\n// Generated marshaling code for schema hash ${schemaHashHex}\n// Input fixed size: ${inputFixedSize} bytes\n// Output fixed size: ${outputFixedSize} bytes\n\n// Type tags for marshaling (must match AssemblyScript runtime/Values.ts)\n// All type tags are stored as 4-byte u32\nconst TAG_NULL = 0;\nconst TAG_BOOLEAN = 1;\nconst TAG_INT = 2;\nconst TAG_FLOAT = 3;\nconst TAG_STRING = 4;\nconst TAG_ARRAY = 5;\nconst TAG_OBJECT = 6;\n\n// Size of type tag in bytes (must match VALUE_TYPE_SIZE in AssemblyScript)\nconst TAG_SIZE = 4;\n\nconst SCHEMA_HASH = ${schemaHashHex}n;\nconst INPUT_FIXED_SIZE = ${inputFixedSize};\nconst OUTPUT_FIXED_SIZE = ${outputFixedSize};\n\n/**\n * Marshal JavaScript input object to WebAssembly memory as a ValueMap.\n *\n * The WASM runtime expects input as a ValueMap: [length: u32][keyPtr1: u32][valuePtr1: u32]...\n * where keys are raw UTF-16 strings and values are tagged Value structures.\n *\n * @param data - The input JavaScript object\n * @param memory - WebAssembly Memory instance\n * @param allocate - Function to allocate memory: (size: number) => number\n * @returns Pointer to marshaled ValueMap in WASM memory\n */\nexport function marshalInput(data, memory, allocate) {\n  const view = new DataView(memory.buffer);\n  const entries = Object.entries(data);\n  const length = entries.length;\n\n  // Calculate total size needed for ValueMap\n  // Format: [length: u32][keyPtr1: u32][valuePtr1: u32]...[key data...][value data...]\n  let totalSize = 4 + length * 8; // map header + key/value pointer pairs\n\n  // Calculate size for keys (raw strings) and values (tagged)\n  for (let i = 0; i < length; i++) {\n    const [key, value] = entries[i];\n    // Key: raw UTF-16 string [length: u32][utf16 chars...]\n    totalSize += 4 + key.length * 2;\n    // Value: tagged value\n    totalSize += calculateValueSize(value);\n  }\n\n  // Allocate memory\n  const ptr = allocate(totalSize);\n\n  // Write map length\n  view.setUint32(ptr, length, true);\n\n  // Current offset for variable data (after map structure)\n  let currentOffset = ptr + 4 + length * 8;\n\n  // Write each key/value pair\n  let ptrOffset = ptr + 4;\n  for (let i = 0; i < length; i++) {\n    const [key, value] = entries[i];\n\n    // Write key as raw string (not tagged): [length: u32][utf16 chars...]\n    const keyPtr = currentOffset;\n    view.setUint32(keyPtr, key.length, true);\n    for (let j = 0; j < key.length; j++) {\n      view.setUint16(keyPtr + 4 + j * 2, key.charCodeAt(j), true);\n    }\n    currentOffset += 4 + key.length * 2;\n\n    // Write value (tagged)\n    const valuePtr = currentOffset;\n    currentOffset += writeValue(value, view, valuePtr);\n\n    // Write pointers to map structure\n    view.setUint32(ptrOffset, keyPtr, true);\n    view.setUint32(ptrOffset + 4, valuePtr, true);\n    ptrOffset += 8;\n  }\n\n  return ptr;\n}\n\n/**\n * Unmarshal WebAssembly memory to JavaScript output object.\n * @param ptr - Pointer to output data in WASM memory\n * @param memory - WebAssembly Memory instance\n * @returns The output JavaScript object\n */\nexport function unmarshalOutput(ptr, memory) {\n  const view = new DataView(memory.buffer);\n\n  // Output is written using writeValue() which writes a tagged Value\n  // Use readValue() to read it back generically\n  const output = readValue(view, ptr);\n  \n  // Convert flat dotted keys to nested objects.\n  // Decision tables with passThrough emit flat keys like 'features.prioritySupport'\n  // which must be restructured into nested objects for JavaScript consumption.\n  // e.g., {\"features.prioritySupport\": true} -> {\"features\": {\"prioritySupport\": true}}\n  return unflattenObject(output);\n}\n\n/**\n * Convert flat dotted keys to nested objects.\n * Recursively processes objects and arrays.\n * \n * @param value - The value to unflatten\n * @returns The unflattened value\n */\nfunction unflattenObject(value) {\n  if (value === null || value === undefined) {\n    return value;\n  }\n  \n  if (Array.isArray(value)) {\n    return value.map(item => unflattenObject(item));\n  }\n  \n  if (typeof value !== 'object') {\n    return value;\n  }\n  \n  const result = {};\n  \n  for (const [key, val] of Object.entries(value)) {\n    // Recursively unflatten the value first\n    const unflattenedVal = unflattenObject(val);\n    \n    if (key.includes('.')) {\n      // Split the key and create nested structure\n      const parts = key.split('.');\n      let current = result;\n      \n      for (let i = 0; i < parts.length - 1; i++) {\n        const part = parts[i];\n        if (!(part in current)) {\n          current[part] = {};\n        } else if (typeof current[part] !== 'object' || current[part] === null) {\n          // Conflicts where both 'a' and 'a.b' exist can occur from multiple decision\n          // table rules. Nested structure takes precedence to preserve data hierarchy.\n          current[part] = {};\n        }\n        current = current[part];\n      }\n      \n      current[parts[parts.length - 1]] = unflattenedVal;\n    } else {\n      // No dot in key - check if we already have a nested object from a dotted key\n      if (key in result && typeof result[key] === 'object' && result[key] !== null && typeof unflattenedVal === 'object' && unflattenedVal !== null) {\n        // Merge the objects\n        Object.assign(result[key], unflattenedVal);\n      } else {\n        result[key] = unflattenedVal;\n      }\n    }\n  }\n  \n  return result;\n}\n\n/**\n * Calculate the total memory size needed for marshaling the input as a ValueMap.\n *\n * Format: [length: u32][keyPtr1: u32][valuePtr1: u32]...[key data...][value data...]\n */\nfunction calculateInputSize(data) {\n  const entries = Object.entries(data);\n  const length = entries.length;\n\n  // Map header + key/value pointer pairs\n  let size = 4 + length * 8;\n\n  // Add size for keys (raw strings) and values (tagged)\n  for (let i = 0; i < length; i++) {\n    const [key, value] = entries[i];\n    // Key: raw UTF-16 string [length: u32][utf16 chars...]\n    size += 4 + key.length * 2;\n    // Value: tagged value\n    size += calculateValueSize(value);\n  }\n\n  return size;\n}\n\n/**\n * Write null value with type tag.\n *\n * Format: [tag: u32]\n *\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written (4 bytes for tag)\n */\nfunction writeNull(view, offset) {\n  // Write tag\n  view.setUint32(offset, TAG_NULL, true);\n  return TAG_SIZE; // tag only\n}\n\n/**\n * Write boolean value with type tag.\n *\n * Format: [tag: u32][value: u8]\n *\n * @param value - The boolean value to write\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written (5 bytes: tag + value)\n */\nfunction writeBoolean(value, view, offset) {\n  // Write tag\n  view.setUint32(offset, TAG_BOOLEAN, true);\n  // Write boolean value as 1 byte (0 or 1)\n  view.setUint8(offset + TAG_SIZE, value ? 1 : 0);\n  return TAG_SIZE + 1; // tag + value\n}\n\n/**\n * Write float (number) value with type tag.\n *\n * Format: [tag: u32][value: f64]\n *\n * Handles all JavaScript number types including:\n * - Regular numbers (0, -0, integers, floats)\n * - Special values (NaN, Infinity, -Infinity)\n *\n * @param value - The number value to write\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written (12 bytes: 4-byte tag + 8-byte f64)\n */\nfunction writeFloat(value, view, offset) {\n  // Write tag\n  view.setUint32(offset, TAG_FLOAT, true);\n  // Write number as f64 (little-endian)\n  view.setFloat64(offset + TAG_SIZE, value, true);\n  return TAG_SIZE + 8; // tag + f64\n}\n\n/**\n * Read a float value from memory.\n *\n * Format: [tag: u32][value: f64]\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded number value (as integer if it's a whole number)\n * @throws {Error} If type tag is not TAG_FLOAT\n */\nfunction readFloat(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_FLOAT) {\n    throw new Error(\\`Expected float tag (\\${TAG_FLOAT}), got \\${tag}\\`);\n  }\n  // Read number as f64 (little-endian)\n  const value = view.getFloat64(offset + TAG_SIZE, true);\n  // Return as integer if it's a whole number (for cleaner JSON output)\n  if (Number.isInteger(value)) {\n    return value;\n  }\n  return value;\n}\n\n/**\n * Write a UTF-16 string to memory with type tag.\n *\n * Format: [tag: u32][pointer: u32] - pointer points to string data\n * String data format: [length: u32][utf16 code units...]\n *\n * The pointer in the Value structure points immediately after the Value structure\n * itself (at offset + 8), where the string data begins.\n *\n * Uses UTF-16 encoding to match AssemblyScript's native string format.\n *\n * @param str - The string to write\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written (tag + pointer + string data)\n */\nfunction writeString(str, view, offset) {\n  const len = str.length;\n  // Write tag\n  view.setUint32(offset, TAG_STRING, true);\n  // String data starts right after the Value structure (tag + pointer = 8 bytes)\n  const stringDataPtr = offset + TAG_SIZE + 4;\n  // Write pointer to string data\n  view.setUint32(offset + TAG_SIZE, stringDataPtr, true);\n  // Write string data: [length: u32][utf16 code units...]\n  view.setUint32(stringDataPtr, len, true);\n  for (let i = 0; i < len; i++) {\n    view.setUint16(stringDataPtr + 4 + i * 2, str.charCodeAt(i), true);\n  }\n  // Total: tag (4) + pointer (4) + length (4) + utf16 data (len * 2)\n  return 8 + 4 + len * 2;\n}\n\n/**\n * Read null value with type tag.\n *\n * Format: [tag: u32]\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns null value\n * @throws {Error} If type tag is not TAG_NULL\n */\nfunction readNull(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_NULL) {\n    throw new Error(\\`Expected null tag (\\${TAG_NULL}), got \\${tag}\\`);\n  }\n  return null;\n}\n\n/**\n * Read boolean value with type tag.\n *\n * Format: [tag: u32][value: u8]\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded boolean value\n * @throws {Error} If type tag is not TAG_BOOLEAN\n */\nfunction readBoolean(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_BOOLEAN) {\n    throw new Error(\\`Expected boolean tag (\\${TAG_BOOLEAN}), got \\${tag}\\`);\n  }\n  // Read boolean value and convert to boolean\n  const value = view.getUint8(offset + TAG_SIZE);\n  return value !== 0;\n}\n\n/**\n * Read an integer value from memory with type tag.\n *\n * Format: [tag: u32][value: i64]\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded integer value\n * @throws {Error} If type tag is not TAG_INT\n */\nfunction readInt(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_INT) {\n    throw new Error(\\`Expected int tag (\\${TAG_INT}), got \\${tag}\\`);\n  }\n  // Read i64 value (little-endian)\n  // JavaScript DataView doesn't have getBigInt64 in older versions, so use two 32-bit reads\n  const low = view.getUint32(offset + TAG_SIZE, true);\n  const high = view.getInt32(offset + TAG_SIZE + 4, true);\n  // Combine to form a 64-bit signed integer\n  // For values that fit in Number, this works fine\n  const value = low + high * 0x100000000;\n  return value;\n}\n\n/**\n * Read a UTF-16 string from memory with type tag.\n *\n * WASM Format: [tag: u32=4][stringPtr: u32]\n * String data at stringPtr: [length: u32][utf16 chars...]\n *\n * FORMAT DIFFERENCE: This reads the canonical WASM representation using pointers\n * and UTF-16 encoding (AssemblyScript's native string format), while writeString()\n * uses an inlined UTF-8 format for simplicity. Both are valid Value representations.\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded string\n * @throws {Error} If type tag is not TAG_STRING\n */\nfunction readString(view, offset) {\n  // Read and verify tag\n  const tag = view.getUint32(offset, true);\n  if (tag !== TAG_STRING) {\n    throw new Error(\\`Expected string tag (\\${TAG_STRING}), got \\${tag}\\`);\n  }\n  // Read pointer to string data\n  const stringPtr = view.getUint32(offset + TAG_SIZE, true);\n  \n  // Read string data from the pointer\n  if (stringPtr === 0) return '';\n  \n  const length = view.getUint32(stringPtr, true);\n  if (length === 0) return '';\n  \n  // Read UTF-16 code units and convert to string\n  let result = '';\n  for (let i = 0; i < length; i++) {\n    const codeUnit = view.getUint16(stringPtr + 4 + i * 2, true);\n    result += String.fromCharCode(codeUnit);\n  }\n  \n  return result;\n}\n\n/**\n * Marshal a primitive value to memory with automatic type detection.\n *\n * Supports null, boolean, number, and string types.\n *\n * @param value - The value to write (null, boolean, number, or string)\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written\n * @throws {Error} If value type is not supported\n */\nfunction writePrimitive(value, view, offset) {\n  if (value === null) {\n    return writeNull(view, offset);\n  } else if (typeof value === 'boolean') {\n    return writeBoolean(value, view, offset);\n  } else if (typeof value === 'number') {\n    return writeFloat(value, view, offset);\n  } else if (typeof value === 'string') {\n    return writeString(value, view, offset);\n  } else {\n    throw new Error('Unsupported type for marshaling: ' + typeof value);\n  }\n}\n\n/**\n * Read a primitive value from memory with type detection.\n *\n * Reads the type tag and dispatches to the appropriate read function.\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded value (null, boolean, number, or string)\n * @throws {Error} If type tag is not recognized\n */\nfunction readPrimitive(view, offset) {\n  const tag = view.getUint32(offset, true);\n  switch (tag) {\n    case TAG_NULL:\n      return readNull(view, offset);\n    case TAG_BOOLEAN:\n      return readBoolean(view, offset);\n    case TAG_INT:\n      return readInt(view, offset);\n    case TAG_FLOAT:\n      return readFloat(view, offset);\n    case TAG_STRING:\n      return readString(view, offset);\n    default:\n      throw new Error('Unexpected type tag: ' + tag);\n  }\n}\n\n/**\n * Marshal an object to memory.\n * Returns the total bytes written for the object.\n *\n * Format: [tag: u32][propertyCount: u32][key1: tagged string][value1: tagged][key2: tagged string][value2: tagged]...\n *\n * Keys are written as tagged strings, followed by tagged values.\n * Property order is preserved for deterministic serialization using Object.entries.\n *\n * @param obj - The object to marshal\n * @param view - DataView for writing\n * @param writeOffset - Offset to write the object at\n * @returns Total bytes written\n */\nfunction writeObject(obj, view, writeOffset) {\n  const startOffset = writeOffset;\n  let offset = writeOffset;\n\n  // Write tag\n  view.setUint32(offset, TAG_OBJECT, true);\n  offset += TAG_SIZE;\n\n  // Get properties in order\n  const entries = Object.entries(obj);\n  const propCount = entries.length;\n\n  // Write property count\n  view.setUint32(offset, propCount, true);\n  offset += 4;\n\n  // Write each (key, value) pair\n  for (let i = 0; i < propCount; i++) {\n    const [key, value] = entries[i];\n\n    // Write key as tagged string (keys are tagged with TAG_STRING)\n    offset += writeString(key, view, offset);\n\n    // Write value (tagged)\n    offset += writeValue(value, view, offset);\n  }\n\n  return offset - startOffset;\n}\n\n/**\n * Marshal a value to memory with automatic type detection.\n *\n * Supports null, boolean, number, string, array, and object types.\n * This is the top-level value marshaling function that dispatches to\n * the appropriate type-specific function.\n *\n * @param value - The value to write\n * @param view - DataView for writing\n * @param offset - Offset to write at\n * @returns Total bytes written\n * @throws {Error} If value type is not supported\n */\nfunction writeValue(value, view, offset) {\n  if (value === null || value === undefined) {\n    return writeNull(view, offset);\n  } else if (typeof value === 'boolean') {\n    return writeBoolean(value, view, offset);\n  } else if (typeof value === 'number') {\n    return writeFloat(value, view, offset);\n  } else if (typeof value === 'string') {\n    return writeString(value, view, offset);\n  } else if (Array.isArray(value)) {\n    return writeArray(value, view, 0, offset);\n  } else if (typeof value === 'object') {\n    return writeObject(value, view, offset);\n  } else {\n    throw new Error('Unsupported type for marshaling: ' + typeof value);\n  }\n}\n\n/**\n * Read an object from memory.\n *\n * WASM Format: Value.Object has: [type: u32=6][objectPtr: u32]\n * objectPtr points to Map structure: [propCount: u32][keyPtr1: u32][valuePtr1: u32][keyPtr2: u32][valuePtr2: u32]...\n * Key pointers point to UTF-16 string data\n * Value pointers point to heap-allocated tagged values.\n *\n * @param view - DataView for reading\n * @param offset - Offset to the Value.Object structure (NOT objectPtr)\n * @returns The unmarshaled object\n */\nfunction readObject(view, offset) {\n  // Two cases:\n  // 1. If offset has TAG_OBJECT (6), it's a Value.Object structure: [type: u32][objectPtr: u32]\n  // 2. Otherwise, offset might already point to the Map structure directly\n\n  const tag = view.getUint32(offset, true);\n  let objectPtr;\n\n  if (tag === TAG_OBJECT) {\n    // Case 1: Value.Object structure, read pointer to Map\n    objectPtr = view.getUint32(offset + 4, true);\n  } else {\n    // Case 2: offset point directly to Map structure\n    objectPtr = offset;\n  }\n\n  const result = {};\n  if (objectPtr !== 0) {\n    // Read property count from map structure\n    const propCount = view.getUint32(objectPtr, true);\n    let mapOffset = objectPtr + 4;\n\n    for (let i = 0; i < propCount; i++) {\n      // Read key pointer and value pointer\n      const keyPtr = view.getUint32(mapOffset, true);\n      const valuePtr = view.getUint32(mapOffset + 4, true);\n      mapOffset += 8;\n\n      // Read key (raw UTF-16 string data at keyPtr: [length: u32][utf16 chars...])\n      const keyLen = view.getUint32(keyPtr, true);\n      let key = '';\n      for (let j = 0; j < keyLen; j++) {\n        const codeUnit = view.getUint16(keyPtr + 4 + j * 2, true);\n        key += String.fromCharCode(codeUnit);\n      }\n\n      // Read value (tagged value at valuePtr)\n      const value = readValue(view, valuePtr);\n\n      result[key] = value;\n    }\n  }\n\n  return result;\n}\n\n/**\n * Calculate the size in bytes of a tagged value at the given offset.\n *\n * @param view - DataView for reading\n * @param offset - Offset to calculate size from\n * @returns Total bytes the value occupies\n * @throws {Error} If type tag is not recognized\n */\nfunction getValueSize(view, offset) {\n  const tag = view.getUint32(offset, true);\n\n  switch (tag) {\n    case TAG_NULL:\n      return TAG_SIZE;\n    case TAG_BOOLEAN:\n      return TAG_SIZE + 1;\n    case TAG_INT:\n      return TAG_SIZE + 8;\n    case TAG_FLOAT:\n      return TAG_SIZE + 8;\n    case TAG_STRING: {\n      const strLen = view.getUint32(offset + TAG_SIZE, true);\n      return TAG_SIZE + 4 + strLen;\n    }\n    case TAG_ARRAY: {\n      const arrLen = view.getUint32(offset + TAG_SIZE, true);\n      let size = TAG_SIZE + 4; // tag + length\n      let elemOffset = offset + TAG_SIZE + 4;\n      for (let i = 0; i < arrLen; i++) {\n        const elemSize = getValueSize(view, elemOffset);\n        size += elemSize;\n        elemOffset += elemSize;\n      }\n      return size;\n    }\n    case TAG_OBJECT: {\n      const propCount = view.getUint32(offset + TAG_SIZE, true);\n      let size = TAG_SIZE + 4; // tag + property count\n      let propOffset = offset + TAG_SIZE + 4;\n      for (let i = 0; i < propCount; i++) {\n        // Skip key (tagged string)\n        const keySize = getValueSize(view, propOffset);\n        size += keySize;\n        propOffset += keySize;\n\n        // Skip value (tagged value)\n        const valSize = getValueSize(view, propOffset);\n        size += valSize;\n        propOffset += valSize;\n      }\n      return size;\n    }\n    default:\n      throw new Error('Unexpected type tag: ' + tag);\n  }\n}\n\n/**\n * Read a value from memory with type detection.\n *\n * Reads the type tag and dispatches to the appropriate read function.\n *\n * @param view - DataView for reading\n * @param offset - Offset to read from\n * @returns The decoded value\n * @throws {Error} If type tag is not recognized\n */\nfunction readValue(view, offset) {\n  const tag = view.getUint32(offset, true);\n  switch (tag) {\n    case TAG_NULL:\n      return readNull(view, offset);\n    case TAG_BOOLEAN:\n      return readBoolean(view, offset);\n    case TAG_INT:\n      return readInt(view, offset);\n    case TAG_FLOAT:\n      return readFloat(view, offset);\n    case TAG_STRING:\n      return readString(view, offset);\n    case TAG_ARRAY:\n      return readArray(view, offset);\n    case TAG_OBJECT:\n      return readObject(view, offset);\n    default:\n      throw new Error('Unexpected type tag: ' + tag);\n  }\n}\n\n/**\n * Marshal an array to memory.\n * Returns the total bytes written for the array.\n *\n * Format: [tag: u32][length: u32][tagged elements...]\n *\n * @param arr - The array to marshal\n * @param view - DataView for writing\n * @param ptr - Base pointer (unused, kept for API compatibility)\n * @param writeOffset - Offset to write the array at\n * @returns Total bytes written\n */\nfunction writeArray(arr, view, ptr, writeOffset) {\n  const startOffset = writeOffset;\n  let offset = writeOffset;\n\n  // Write tag\n  view.setUint32(offset, TAG_ARRAY, true);\n  offset += TAG_SIZE;\n\n  // Write length\n  view.setUint32(offset, arr.length, true);\n  offset += 4;\n\n  // Write elements recursively\n  for (let i = 0; i < arr.length; i++) {\n    const value = arr[i];\n    offset += writeValue(value, view, offset);\n  }\n\n  return offset - startOffset;\n}\n\n/**\n * Calculate the size needed to marshal an object.\n *\n * Format: [tag: byte][propertyCount: u32][key1: tagged string][value1: tagged][key2: tagged string][value2: tagged]...\n *\n * @param obj - The object to calculate size for\n * @returns Total bytes needed for the object\n */\nfunction calculateObjectSize(obj) {\n  let size = 5; // tag (1 byte) + property count (4 bytes)\n\n  const entries = Object.entries(obj);\n  for (let i = 0; i < entries.length; i++) {\n    const [key, value] = entries[i];\n    // Key: tagged string (tag: 4 + pointer: 4 + length: 4 + UTF-16 data: 2 bytes per code unit)\n    size += 8 + 4 + key.length * 2;\n    // Value: calculate size of tagged value\n    size += calculateValueSize(value);\n  }\n\n  return size;\n}\n\n/**\n * Calculate the size needed to marshal a value.\n *\n * @param value - The value to calculate size for\n * @returns Total bytes needed for the value\n */\nfunction calculateValueSize(value) {\n  if (value === null || value === undefined) {\n    return 1;\n  } else if (typeof value === 'boolean') {\n    return 2;\n  } else if (typeof value === 'number') {\n    return 9;\n  } else if (typeof value === 'string') {\n    // tag (4) + pointer (4) + length (4) + UTF-16 data (2 bytes per code unit)\n    return 8 + 4 + value.length * 2;\n  } else if (Array.isArray(value)) {\n    let size = 5;\n    for (let i = 0; i < value.length; i++) {\n      size += calculateValueSize(value[i]);\n    }\n    return size;\n  } else if (typeof value === 'object') {\n    return calculateObjectSize(value);\n  } else {\n    throw new Error('Unsupported type for marshaling: ' + typeof value);\n  }\n}\n\n/**\n * Read an array from memory.\n *\n * WASM Format: Value.Array has: [type: u32=5][arrayPtr: u32]\n * arrayPtr points to array structure: [length: u32][elementPtr1: u32][elementPtr2: u32]...\n * Each elementPtr points to a tagged Value structure\n *\n * @param view - DataView for reading\n * @param offset - Offset to the Value.Array structure (NOT arrayPtr)\n * @returns The unmarshaled array\n */\nfunction readArray(view, offset) {\n  // Two cases:\n  // 1. If offset has TAG_ARRAY (5), it's a Value.Array structure: [type: u32][arrayPtr: u32]\n  // 2. Otherwise, offset might already point to the array structure directly\n\n  const tag = view.getUint32(offset, true);\n  let arrayPtr;\n\n  if (tag === TAG_ARRAY) {\n    // Case 1: Value.Array structure, read pointer to array data\n    arrayPtr = view.getUint32(offset + 4, true);\n  } else {\n    // Case 2: offset points directly to array structure\n    arrayPtr = offset;\n  }\n\n  // Validate arrayPtr is within bounds\n  if (arrayPtr === 0 || arrayPtr >= view.byteLength) {\n    return [];\n  }\n\n  // Read length field (may have high bit set for flat format)\n  const lengthField = view.getUint32(arrayPtr, true);\n  const FLAT_ARRAY_MARKER = 0x80000000;\n\n  // Check if this is a flat numeric array (high bit set)\n  if ((lengthField & FLAT_ARRAY_MARKER) !== 0) {\n    // Flat numeric format: [length | marker: u32][f64 elements...]\n    const length = lengthField & ~FLAT_ARRAY_MARKER;\n    const result = [];\n    for (let i = 0; i < length; i++) {\n      const value = view.getFloat64(arrayPtr + 4 + i * 8, true);\n      result.push(value);\n    }\n    return result;\n  }\n\n  // Generic format: [length: u32][Value pointers...]\n  const length = lengthField;\n\n  // Read element pointers and dereference them\n  const result = [];\n  for (let i = 0; i < length; i++) {\n    const elemPtr = view.getUint32(arrayPtr + 4 + i * 4, true);\n    // Skip invalid pointers\n    if (elemPtr === 0 || elemPtr >= view.byteLength) {\n      result.push(null);\n      continue;\n    }\n    const value = readValue(view, elemPtr);\n    result.push(value);\n  }\n\n  return result;\n}\n`;\n}\n\n/**\n * Generate the unmarshal function body.\n *\n * This function is currently unused but kept for potential future use with alternative\n * marshaling strategies. It generates code to read fixed-layout structs directly,\n * which could be more efficient than the current generic Value-based approach.\n *\n * @param layout - The flattened schema layout\n * @param _prefix - Unused parameter (reserved for potential future use with prefixed field names)\n * @returns Generated JavaScript code for unmarshaling\n */\nexport function _generateUnmarshalBody(layout: FlattenedLayout, _prefix: string): string {\n  const lines: string[] = [];\n\n  lines.push('  const output = {};');\n  lines.push('');\n\n  // Build nested object structure\n  const paths = buildNestedPaths(layout.fields);\n  lines.push(...paths);\n\n  lines.push('');\n\n  // Read fixed fields\n  for (const field of layout.fields) {\n    if (field.type === 'string' || field.type === 'array') {\n      // Skip - handled in variable section\n      continue;\n    } else if (field.type === 'bool') {\n      lines.push('  // ' + field.path);\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = view.getUint32(readOffset + ${field.offset}, true) !== 0;`,\n      );\n    } else if (field.type === 'i64') {\n      lines.push('  // ' + field.path);\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = Number(view.getBigInt64(readOffset + ${field.offset}, true));`,\n      );\n    } else {\n      lines.push('  // ' + field.path);\n      const valueGetter = field.type === 'f64' ? 'getFloat64' : 'getInt32';\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = view.${valueGetter}(readOffset + ${field.offset}, true);`,\n      );\n    }\n  }\n\n  // Read variable-length data\n  for (const field of layout.fields) {\n    if (field.type === 'string') {\n      lines.push('');\n      lines.push('  // ' + field.path);\n      lines.push(\n        `  const ${field.flatName}_ptr = view.getUint32(readOffset + ${field.offset}, true);`,\n      );\n      lines.push(\n        `  const ${field.flatName}_len = view.getUint32(readOffset + ${field.offset} + 4, true);`,\n      );\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = ${field.flatName}_len > 0 ? readString(view, ${field.flatName}_ptr) : '';`,\n      );\n    } else if (field.type === 'array') {\n      lines.push('');\n      lines.push('  // ' + field.path);\n      lines.push(\n        `  const ${field.flatName}_ptr = view.getUint32(readOffset + ${field.offset}, true);`,\n      );\n      lines.push(\n        `  const ${field.flatName}_len = view.getUint32(readOffset + ${field.offset} + 4, true);`,\n      );\n      lines.push(\n        `  output${field.path\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = readArray(view, ${field.flatName}_ptr);`,\n      );\n    }\n  }\n\n  return lines.join('\\n');\n}\n\n/**\n * Build nested object initialization code\n */\nfunction buildNestedPaths(fields: Array<{ path: string }>): string[] {\n  const paths: string[] = [];\n  const nestedObjects = new Set<string>();\n\n  for (const field of fields) {\n    const parts = field.path.split('.');\n    for (let i = 0; i < parts.length - 1; i++) {\n      const prefix = parts.slice(0, i + 1).join('.');\n      if (!nestedObjects.has(prefix)) {\n        nestedObjects.add(prefix);\n        const code = `  output${prefix\n          .split('.')\n          .map((p) => `['${p}']`)\n          .join('')} = {};`;\n        paths.push(code);\n      }\n    }\n  }\n\n  // Deduplicate and sort\n  return Array.from(new Set(paths));\n}\n","/**\n * JavaScript Validation Code Generation\n *\n * This module generates JavaScript code for validating input data against\n * TypeBox schemas before marshaling. The generated code performs:\n *\n * - Type checking for primitives (string, number, boolean)\n * - Required field validation\n * - Nested object validation\n * - Array element validation\n * - Union type validation\n * - Literal value validation\n *\n * The generated validators are standalone JavaScript code that doesn't\n * require runtime schema compilation, making validation fast and predictable.\n */\n\nimport { type TSchema, Kind } from '@sinclair/typebox';\n\n/**\n * Generate JavaScript validation code.\n *\n * This function generates JavaScript code that validates input data\n * against the TypeBox schema before marshaling.\n *\n * Generates custom validation code that checks types and required fields\n * without requiring runtime schema compilation.\n *\n * @param schema - The TypeBox schema to validate against\n * @returns Generated validation code as a string\n */\nexport function generateValidationCode(schema: TSchema): string {\n  const validatorCode = generateSchemaValidator(schema, 'data');\n\n  return `// Generated validation code for TypeBox schema\n\n/**\n * Validate input data against the schema.\n * Throws an error if validation fails.\n *\n * @param data - The input data to validate\n * @throws {ValidationError} If validation fails\n */\nexport function validateInput(data) {\n  const errors = ${validatorCode};\n  if (errors.length > 0) {\n    throw new ValidationError('Invalid input data', errors);\n  }\n}\n\n/**\n * Custom error class for validation errors\n */\nexport class ValidationError extends Error {\n  constructor(message, errors) {\n    const errorList = errors\n      .map((e, i) => '[' + (i + 1) + '] ' + e.path + ': ' + e.message)\n      .join('\\\\n  ');\n    super(message + ':\\\\n  ' + errorList);\n    this.name = 'ValidationError';\n    this.errors = errors;\n  }\n}\n\n/**\n * Safely validate input without throwing.\n *\n * @param data - The input data to validate\n * @returns true if valid, false otherwise\n */\nexport function checkInput(data) {\n  try {\n    validateInput(data);\n    return true;\n  } catch {\n    return false;\n  }\n}\n`;\n}\n\n/**\n * Generate validation code for a given schema.\n *\n * @param schema - The TypeBox schema to generate validation for\n * @param dataPath - JavaScript expression for accessing the data at this level\n * @returns JavaScript code that returns an array of error objects\n */\nfunction generateSchemaValidator(schema: TSchema, dataPath: string): string {\n  const kind = (schema as any)[Kind];\n\n  switch (kind) {\n    case 'Object': {\n      return validateObject(schema, dataPath);\n    }\n\n    case 'String': {\n      return validatePrimitive(dataPath, 'string', 'Expected string');\n    }\n\n    case 'Number': {\n      return validatePrimitive(dataPath, 'number', 'Expected number');\n    }\n\n    case 'Integer': {\n      return `${validatePrimitive(dataPath, 'number', 'Expected integer')}.concat(\n        ${dataPath} !== undefined && ${dataPath} !== null && !Number.isInteger(${dataPath})\n          ? [{ path: '${dataPath}', message: 'Expected integer', value: ${dataPath} }]\n          : []\n      )`;\n    }\n\n    case 'Boolean': {\n      return validatePrimitive(dataPath, 'boolean', 'Expected boolean');\n    }\n\n    case 'Array': {\n      return validateArray(schema, dataPath);\n    }\n\n    case 'Union': {\n      return validateUnion(schema, dataPath);\n    }\n\n    case 'Literal': {\n      const literalValue = (schema as any).const;\n      const literalStr =\n        typeof literalValue === 'string' ? `'${literalValue}'` : String(literalValue);\n      const message2 = 'Expected literal value ' + String(literalStr);\n      return `${validatePrimitive(dataPath, typeof literalValue, '${message2}')}.concat(\n        ${dataPath} !== undefined && ${dataPath} !== null && ${dataPath} !== ${literalStr}\n          ? [{ path: '${dataPath}', message: '${message2}', value: ${dataPath} }]\n          : []\n      )`;\n    }\n\n    default:\n      // Unknown type - accept anything\n      return '[]';\n  }\n}\n\n/**\n * Generate validation for object schema.\n */\nfunction validateObject(schema: TSchema, dataPath: string): string {\n  const properties = (schema as any).properties || {};\n  const required = new Set((schema as any).required || []);\n\n  let code = `[]`;\n\n  // Check if data is an object\n  code = `(${dataPath} === null || ${dataPath} === undefined || typeof ${dataPath} !== 'object' || Array.isArray(${dataPath})) ? [{ path: '${dataPath}', message: 'Expected object', value: ${dataPath} }] : []`;\n\n  // Check each property\n  for (const [key, propSchema] of Object.entries(properties)) {\n    const propPath = `${dataPath}.${key}`;\n    const isRequired = required.has(key);\n\n    // Check if required field is present\n    if (isRequired) {\n      code += `.concat(\n        ${propPath} === undefined || ${propPath} === null\n          ? [{ path: '${propPath}', message: 'Required field is missing', value: undefined }]\n          : []\n      )`;\n    } else {\n      // Skip validation if optional field is missing\n      code += `.concat(\n        ${propPath} === undefined || ${propPath} === null\n          ? []\n          : ${generateSchemaValidator(propSchema as TSchema, propPath)}\n      )`;\n    }\n\n    // Validate the field if present\n    if (isRequired) {\n      code += `.concat(\n        ${propPath} !== undefined && ${propPath} !== null\n          ? ${generateSchemaValidator(propSchema as TSchema, propPath)}\n          : []\n      )`;\n    }\n  }\n\n  return code;\n}\n\n/**\n * Generate validation for array schema.\n */\nfunction validateArray(schema: TSchema, dataPath: string): string {\n  const itemsSchema = (schema as any).items;\n\n  // Check if data is an array\n  const arrayCheck = `Array.isArray(${dataPath})`;\n\n  // Validate array elements\n  if (itemsSchema) {\n    const elementValidation = `\n      ${dataPath}.reduce((errs, item, idx) => {\n        const itemPath = '${dataPath}[' + idx + ']';\n        const elementErrors = ${generateSchemaValidator(itemsSchema as TSchema, 'item')};\n        return errs.concat(elementErrors.map(e => ({\n          ...e,\n          path: itemPath\n        })));\n      }, [])\n    `;\n\n    return `(${arrayCheck} ? ${elementValidation} : [{ path: '${dataPath}', message: 'Expected array', value: ${dataPath} }])`;\n  }\n\n  return `${arrayCheck} ? [] : [{ path: '${dataPath}', message: 'Expected array', value: ${dataPath} }]`;\n}\n\n/**\n * Generate validation for union schema.\n */\nfunction validateUnion(schema: TSchema, dataPath: string): string {\n  const anyOf = (schema as any).anyOf || [];\n  if (anyOf.length === 0) {\n    return '[]';\n  }\n\n  // Generate validators for each option\n  const validators = anyOf.map((option: TSchema) => generateSchemaValidator(option, dataPath));\n\n  // Check if at least one option passes\n  return `(${dataPath} === undefined || ${dataPath} === null) ? []\n    : ${validators.join('.length === 0 || ')}.length === 0\n      ? []\n      : [{ path: '${dataPath}', message: 'Value does not match any allowed type', value: ${dataPath} }]`;\n}\n\n/**\n * Generate validation for primitive types.\n */\nfunction validatePrimitive(dataPath: string, expectedType: string, message: string): string {\n  return `(${dataPath} === undefined || ${dataPath} === null || typeof ${dataPath} !== '${expectedType}')\n    ? [{ path: '${dataPath}', message: '${message}', value: ${dataPath} }]\n    : []`;\n}\n","// src/compiler/runtime-codegen.ts\n// Compile-time code generation utilities for loading generated marshaling and validation code\n\nimport { CompilationError, ErrorCode } from './errors';\n\n/**\n * Type definitions for marshal and unmarshal functions.\n */\nexport type MarshalFn = (data: Record<string, unknown>, memory: WebAssembly.Memory) => number;\n\nexport type UnmarshalFn = (ptr: number, memory: WebAssembly.Memory) => Record<string, unknown>;\n\nexport type ValidateFn = (data: unknown) => void;\n\n/**\n * Load generated marshaling code as executable functions.\n *\n * @internal This function uses Function constructor to execute generated code.\n * The code is generated by the compiler and is trusted, but users should be\n * aware that this executes arbitrary JavaScript in the current context.\n *\n * @param code - The generated marshaling code\n * @returns Object with marshal and unmarshal functions\n */\nexport function loadGeneratedMarshaling(code: string): {\n  marshal: MarshalFn;\n  unmarshal: UnmarshalFn;\n} {\n  // Create a function from the generated code\n\n  // We use string replacement instead of ES module loading because: (1) generated code\n  // uses ES6 exports which Function() doesn't support, (2) avoiding eval() for security,\n  // (3) provides isolated scope for generated code. Convert export syntax to regular functions.\n  const cleanedCode = code\n    .replace(/^export function marshalInput/gm, 'function marshalInputHelper')\n    .replace(/^export function unmarshalOutput/gm, 'function unmarshalOutputHelper')\n    .replace(/^export const SCHEMA_HASH/gm, 'const SCHEMA_HASH')\n    .replace(/^export const INPUT_FIXED_SIZE/gm, 'const INPUT_FIXED_SIZE')\n    .replace(/^export const OUTPUT_FIXED_SIZE/gm, 'const OUTPUT_FIXED_SIZE')\n    .replace(/^export function writeString/gm, 'function writeStringHelper')\n    .replace(/^export function readString/gm, 'function readStringHelper')\n    .replace(/^export function writeArray/gm, 'function writeArrayHelper')\n    .replace(/^export function readArray/gm, 'function readArrayHelper')\n    .replace(/^export function calculateInputSize/gm, 'function calculateInputSizeHelper');\n\n  // Helper function to extract nested values\n  const helperCode = `\n    function getNestedValue(obj, path) {\n      const parts = path.split('.');\n      let current = obj;\n      for (const part of parts) {\n        if (current == null) return undefined;\n        if (typeof current !== 'object') return undefined;\n        current = current[part];\n      }\n      return current;\n    }\n  `;\n\n  // Type for the raw 3-argument marshal function\n  type RawMarshalFn = (\n    data: Record<string, unknown>,\n    memory: WebAssembly.Memory,\n    allocate: (size: number) => number,\n  ) => number;\n\n  const module: { marshalInput?: RawMarshalFn; unmarshalOutput?: UnmarshalFn } = {};\n\n  const setupFn = new Function(\n    'module',\n    helperCode +\n      cleanedCode +\n      `\n      module.marshalInput = marshalInputHelper;\n      module.unmarshalOutput = unmarshalOutputHelper;\n    `,\n  );\n\n  setupFn(module);\n\n  if (!module.marshalInput || !module.unmarshalOutput) {\n    throw new CompilationError(\n      'Generated marshaling code did not export required functions',\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { field: 'marshalCode' },\n    );\n  }\n\n  // Create a 2-argument wrapper that provides an internal allocator\n  // The allocator starts at 192KB to avoid collision with:\n  //   - AssemblyScript static data (0 - ~50KB)\n  //   - AssemblyScript runtime heap (~50KB - ~192KB, grows during evaluation)\n  // This matches the memory layout expected by the WASM module.\n  const rawMarshal = module.marshalInput;\n  const INPUT_BUFFER_START = 192 * 1024; // 192KB\n  const REQUIRED_MEMORY = 768 * 1024; // 768KB minimum to fit input + output buffers\n\n  const wrappedMarshal: MarshalFn = (data, memory) => {\n    // Ensure memory is large enough for the expected layout\n    if (memory.buffer.byteLength < REQUIRED_MEMORY) {\n      const pagesNeeded = Math.ceil((REQUIRED_MEMORY - memory.buffer.byteLength) / 65536);\n      memory.grow(pagesNeeded);\n    }\n\n    // Simple bump allocator starting at 192KB (after AS runtime heap region)\n    let heapOffset = INPUT_BUFFER_START;\n    const allocate = (size: number): number => {\n      const ptr = heapOffset;\n      heapOffset += size;\n      // Grow memory if needed\n      if (heapOffset > memory.buffer.byteLength) {\n        const pagesNeeded = Math.ceil((heapOffset - memory.buffer.byteLength) / 65536);\n        memory.grow(pagesNeeded);\n      }\n      return ptr;\n    };\n    return rawMarshal(data, memory, allocate);\n  };\n\n  return {\n    marshal: wrappedMarshal,\n    unmarshal: module.unmarshalOutput,\n  };\n}\n\n// Cache TypeCompiler to avoid repeated dynamic imports\nlet cachedTypeCompiler: unknown = null;\n\n/**\n * Load generated validation code as executable function.\n *\n * @param code - The generated validation code\n * @returns Validation function\n */\nexport async function loadGeneratedValidation(code: string): Promise<ValidateFn> {\n  // The generated validation code uses ES6 import/export syntax and TypeScript syntax\n  // We need to:\n  // 1. Strip import statements\n  // 2. Strip TypeScript type annotations\n  // 3. Convert exports to regular function/class definitions\n  // 4. Pass TypeCompiler as a dependency\n  // 5. Return the validateInput function\n\n  let cleanedCode = code;\n\n  // Remove import statements\n  const importRegex = /^import\\s+.*from\\s+['\"].*['\"];?\\s*$/gm;\n  cleanedCode = cleanedCode.replace(importRegex, '');\n\n  // Strip TypeScript parameter type annotations\n  // Matches: function foo(param: Type, other: Type)\n  cleanedCode = cleanedCode.replace(/(\\w+)\\s*:\\s*\\w+(?:<[^>]+>)?(?=[,)])/g, '$1');\n\n  // Strip TypeScript \"asserts\" return type annotations\n  // Matches: ): asserts data is Type {\n  cleanedCode = cleanedCode.replace(/\\):\\s+asserts\\s+\\w+\\s+is\\s+\\w+\\s*(<[^>]+>)?\\s*\\{/g, ') {');\n\n  // Strip TypeScript class property modifiers\n  // Matches: public readonly errors: Type {\n  cleanedCode = cleanedCode.replace(/public\\s+readonly\\s+/g, '');\n  cleanedCode = cleanedCode.replace(/public\\s+/g, '');\n\n  // Strip generic type annotations from Array\n  // Matches: Array<{...}> and Array<Type>\n  cleanedCode = cleanedCode.replace(/Array<([^>]+)>/g, 'Array');\n\n  // Strip TSchema type reference (from @sinclair/typebox)\n  cleanedCode = cleanedCode.replace(/:\\s*TSchema/g, '');\n\n  // Convert exports to regular definitions\n  cleanedCode = cleanedCode\n    .replace(/^export function validateInput/gm, 'function validateInput')\n    .replace(/^export class ValidationError/gm, 'class ValidationError')\n    .replace(/^export function checkInput/gm, 'function checkInput');\n\n  // Import TypeCompiler dynamically (cached for performance)\n  if (!cachedTypeCompiler) {\n    const module = await import('@sinclair/typebox/compiler');\n    cachedTypeCompiler = module.TypeCompiler;\n  }\n  const TypeCompiler = cachedTypeCompiler;\n\n  // Create a module object to hold the validator (no type annotation for Function context)\n  const module: any = {};\n\n  const setupFn = new Function(\n    'TypeCompiler',\n    'module',\n    `\n      ${cleanedCode}\n      module.validateInput = validateInput;\n    `,\n  );\n\n  setupFn(TypeCompiler, module);\n\n  if (!module.validateInput) {\n    throw new CompilationError(\n      'Generated validation code did not export validateInput function',\n      ErrorCode.INVALID_NODE_STRUCTURE,\n      { field: 'validationCode' },\n    );\n  }\n\n  return module.validateInput;\n}\n\n/**\n * Re-export validation code generation functions from marshal-gen\n */\nexport { generateValidationCode } from './marshal-gen';\n","// src/compiler/runtime.ts\n// Runtime execution support for evaluating compiled JDM decisions\n\nimport type { CompilationResult } from './types';\nimport {\n  loadGeneratedMarshaling,\n  loadGeneratedValidation,\n  type MarshalFn,\n  type UnmarshalFn,\n  type ValidateFn,\n} from './runtime-codegen';\n\n// ============================================================================\n// Memory Constants\n// ============================================================================\n\n/**\n * WebAssembly page size in bytes (64KB).\n * This is a fixed constant defined by the WebAssembly specification.\n * Used to calculate memory requirements and convert between pages and bytes.\n */\nconst WASM_PAGE_SIZE_BYTES = 65536;\n\n/**\n * Default maximum memory pages for compiled decisions (256 pages = 16MB).\n *\n * This limit balances:\n * 1. Allowing large decision tables with many rules\n * 2. Preventing unbounded memory growth\n * 3. Browser compatibility (most browsers support at least 32MB per WASM instance)\n *\n * Can be overridden via CompiledDecisionOptions.maximumMemoryPages.\n */\nconst DEFAULT_MAX_MEMORY_PAGES = 256;\n\n/**\n * Input buffer start offset in bytes (after null pointer trap).\n *\n * Must match INPUT_BUFFER_START in src/runtime/memory.ts (which equals\n * NULL_POINTER_TRAP_SIZE = 4 bytes). This ensures correct memory layout\n * coordination between JavaScript marshaling and WASM memory access.\n *\n * The first 4 bytes are reserved as a null pointer trap zone - accessing\n * address 0 will read/write this trap zone, helping catch null pointer bugs.\n */\nconst INPUT_BUFFER_START_OFFSET = 4;\n\n/**\n * Error type for runtime evaluation errors.\n */\nexport class RuntimeError extends Error {\n  constructor(\n    message: string,\n    public readonly code: number = -1,\n    public readonly context?: Record<string, unknown>,\n  ) {\n    super(message);\n    this.name = 'RuntimeError';\n  }\n}\n\n/**\n * Ensure WASM memory is large enough for the required size.\n *\n * This function checks if the current memory buffer is large enough\n * and grows it by 64KB pages if needed.\n *\n * @param memory - The WebAssembly.Memory instance\n * @param required - The required memory size in bytes\n * @throws {RuntimeError} If memory cannot be grown (e.g., exceeds maximum)\n *\n * @example\n * ```typescript\n * ensureMemory(memory, 131072); // Ensure at least 128KB is available\n * ```\n */\nexport function ensureMemory(memory: WebAssembly.Memory, required: number): void {\n  const current = memory.buffer.byteLength;\n  if (required <= current) {\n    return; // Already have enough memory\n  }\n\n  // Calculate how many pages to grow\n  const pagesNeeded = Math.ceil((required - current) / WASM_PAGE_SIZE_BYTES);\n\n  // Attempt to grow memory\n  try {\n    const oldPages = memory.grow(pagesNeeded);\n    if (oldPages < 0) {\n      throw new RuntimeError(`Failed to grow memory by ${pagesNeeded} pages`, 5); // OUT_OF_MEMORY\n    }\n  } catch (error) {\n    // Re-throw RuntimeError as-is\n    if (error instanceof RuntimeError) {\n      throw error;\n    }\n    throw new RuntimeError(\n      `Cannot grow WASM memory: required ${required} bytes, ` +\n        `current ${current} bytes, need ${pagesNeeded} more pages. ` +\n        (error instanceof Error ? error.message : String(error)),\n      5, // OUT_OF_MEMORY\n    );\n  }\n}\n\n// Re-export type definitions from runtime-codegen for backward compatibility\nexport type { MarshalFn, UnmarshalFn, ValidateFn } from './runtime-codegen';\n\n/**\n * Options for creating a CompiledDecision instance.\n */\nexport interface CompiledDecisionOptions {\n  /** The compiled WASM binary */\n  wasm: Uint8Array;\n  /** Schema hash for validation */\n  schemaHash: bigint;\n  /** Function to marshal input to WASM memory */\n  marshal: MarshalFn;\n  /** Function to unmarshal output from WASM memory */\n  unmarshal: UnmarshalFn;\n  /** Function to validate input against schema */\n  validate?: ValidateFn;\n  /** Initial memory size in pages (default: 1 page = 64KB) */\n  initialMemoryPages?: number;\n  /** Maximum memory pages (default: DEFAULT_MAX_MEMORY_PAGES = 256 pages = 16MB) */\n  maximumMemoryPages?: number;\n}\n\n/**\n * A compiled JDM decision ready for evaluation.\n *\n * This class manages the lifecycle of evaluating a compiled decision:\n * 1. Validates input against schema (fail fast with good error)\n * 2. Marshals input to WASM memory\n * 3. Resets heap for fresh evaluation\n * 4. Runs evaluation\n * 5. Checks for runtime errors (schema mismatch, etc.)\n * 6. Unmarshals output from WASM memory\n *\n * @example\n * ```typescript\n * const decision = new CompiledDecision({\n *   wasm: compilationResult.wasm,\n *   schemaHash: compilationResult.schemaHash,\n *   marshal: marshalInput,\n *   unmarshal: unmarshalOutput,\n *   validate: validateInput,\n * });\n *\n * const output = await decision.evaluate({ age: 25, name: 'Alice' });\n * ```\n */\nexport class CompiledDecision {\n  private instance: WebAssembly.Instance | null = null;\n  private memory: WebAssembly.Memory | null = null;\n  private module: WebAssembly.Module;\n  private marshal: MarshalFn;\n  private unmarshal: UnmarshalFn;\n  private validate?: ValidateFn;\n\n  constructor(private options: CompiledDecisionOptions) {\n    // WebAssembly.Module requires an ArrayBuffer starting at offset 0, but Uint8Array may\n    // be a view into a larger buffer at a non-zero offset, which would cause Module\n    // construction to fail. Create a proper Uint8Array view that the Module constructor\n    // can safely access, ensuring we only pass the exact bytes of the WASM binary.\n    const buffer = new Uint8Array(\n      options.wasm.buffer,\n      options.wasm.byteOffset,\n      options.wasm.byteLength,\n    );\n    this.module = new WebAssembly.Module(buffer as unknown as ArrayBuffer);\n\n    this.marshal = options.marshal;\n    this.unmarshal = options.unmarshal;\n    this.validate = options.validate;\n  }\n\n  /**\n   * Initialize the WebAssembly instance.\n   * This is done lazily on first evaluation, or can be called explicitly.\n   */\n  private async initialize(): Promise<void> {\n    if (this.instance !== null) {\n      return;\n    }\n\n    // Don't provide memory via import - let the WASM module use its own exported memory.\n    // AssemblyScript's incremental GC runtime requires specific memory initialization\n    // that only works correctly with the module's own memory.\n    this.instance = await WebAssembly.instantiate(this.module, {\n      env: {\n        abort: () => {\n          throw new RuntimeError('WASM abort called');\n        },\n        seed: () => {\n          return Date.now();\n        },\n        'Date.now': () => Date.now(),\n      },\n      // Empty index module provided for AssemblyScript compatibility\n      index: {},\n    });\n\n    // Get memory from the WASM module's exports\n    this.memory = this.instance.exports.memory as WebAssembly.Memory;\n  }\n\n  /**\n   * Evaluate the decision with the given input.\n   *\n   * @param input - The input data to evaluate\n   * @returns The output of the decision evaluation\n   * @throws {RuntimeError} If evaluation fails\n   * @throws {ValidationError} If input validation fails (if validate is provided)\n   */\n  async evaluate<I = Record<string, unknown>, O = Record<string, unknown>>(input: I): Promise<O> {\n    await this.initialize();\n\n    if (!this.instance || !this.memory) {\n      throw new RuntimeError('WASM instance not initialized');\n    }\n\n    // Local references to avoid null checks in the hot path\n    const memory = this.memory;\n    const instance = this.instance;\n\n    // 1. Validate input against schema (fail fast with good error)\n    if (this.validate) {\n      try {\n        this.validate(input);\n      } catch (error) {\n        if (error instanceof Error) {\n          throw new RuntimeError(`Input validation failed: ${error.message}`, 1, { input });\n        }\n        throw error;\n      }\n    }\n\n    // Clear any stale error state from previous evaluations before starting new evaluation.\n    // This ensures each evaluation starts with a clean slate.\n    const clearLastErrorFn = instance.exports.clearLastError as () => void;\n    if (clearLastErrorFn) {\n      clearLastErrorFn();\n    }\n\n    try {\n      // 2. Marshal input to WASM memory\n      const inputPtr: number = this.marshal(input as Record<string, unknown>, memory);\n\n      // Verify input pointer is valid\n      if (inputPtr < INPUT_BUFFER_START_OFFSET) {\n        throw new RuntimeError(\n          `Invalid input pointer: ${inputPtr} (must be >= ${INPUT_BUFFER_START_OFFSET})`,\n        );\n      }\n\n      // 3. Reset heap for fresh evaluation\n      const resetHeapFn = instance.exports.resetHeap as () => void;\n      if (resetHeapFn) {\n        resetHeapFn();\n      }\n\n      // 4. Run evaluation\n      const evaluateFn = instance.exports.evaluate as (ptr: number) => number;\n      if (!evaluateFn) {\n        throw new RuntimeError('evaluate function not exported from WASM module');\n      }\n\n      const outputPtr: number = evaluateFn(inputPtr);\n\n      // 5. Check for runtime errors (schema mismatch, etc.)\n      const getLastErrorFn = instance.exports.getLastError as () => number;\n      if (getLastErrorFn) {\n        const errorCode = getLastErrorFn();\n        if (errorCode !== 0) {\n          throw new RuntimeError(this.getErrorMessage(errorCode), errorCode, { input, outputPtr });\n        }\n      }\n\n      // Verify output pointer is valid\n      // Output pointer validity is verified during unmarshal - we only check it's within\n      // addressable memory here to avoid segfault.\n      if (outputPtr < memory.buffer.byteLength) {\n        // Output pointer should be within a reasonable range\n        // We'll verify the unmarshal works properly\n      }\n\n      // 6. Unmarshal output from WASM memory\n      const output = this.unmarshal(outputPtr, memory);\n\n      return output as O;\n    } finally {\n      // Always clear error state after evaluation, even if an error was thrown.\n      // This prevents stale error state from affecting subsequent evaluations.\n      if (clearLastErrorFn) {\n        clearLastErrorFn();\n      }\n    }\n  }\n\n  /**\n   * Get a human-readable error message for a given error code.\n   *\n   * @param errorCode - The error code from getLastError()\n   * @returns A human-readable error message\n   */\n  private getErrorMessage(errorCode: number): string {\n    // Error codes duplicated from assembly/runtime/errors.ts because WASM cannot export\n    // enum metadata - these must stay synchronized.\n    // NONE = 0, SCHEMA_MISMATCH = 1, NULL_POINTER = 2, INVALID_ACCESS = 3, EVALUATION_ERROR = 4, OUT_OF_MEMORY = 5\n    const errorMessages: Record<number, string> = {\n      0: 'No error',\n      1: 'Schema mismatch: input data does not match expected schema',\n      2: 'Null pointer dereference',\n      3: 'Invalid memory access',\n      4: 'Evaluation error',\n      5: 'Out of memory',\n    };\n\n    return errorMessages[errorCode] ?? `Unknown error code: ${errorCode}`;\n  }\n\n  /**\n   * Get the current WebAssembly memory instance.\n   * This can be useful for debugging or direct memory inspection.\n   *\n   * @returns The WebAssembly.Memory instance (null if not initialized)\n   */\n  getMemory(): WebAssembly.Memory | null {\n    return this.memory;\n  }\n\n  /**\n   * Get the current WebAssembly instance.\n   *\n   * @returns The WebAssembly.Instance instance (null if not initialized)\n   */\n  getInstance(): WebAssembly.Instance | null {\n    return this.instance;\n  }\n\n  /**\n   * Dispose of this CompiledDecision instance.\n   * This clears the WebAssembly instance and allows garbage collection.\n   */\n  dispose(): void {\n    this.instance = null;\n  }\n\n  /**\n   * Get memory usage statistics.\n   *\n   * @returns Object with memory usage information\n   */\n  getMemoryStats(): { current: number; maximum: number; used: number } {\n    // Note: 'used' equals 'current' because WebAssembly.Memory doesn't expose actual heap\n    // usage - tracking used bytes requires instrumentation in AssemblyScript allocator.\n    const currentBytes = this.memory?.buffer.byteLength ?? 0;\n    return {\n      current: currentBytes,\n      maximum: (this.options.maximumMemoryPages ?? DEFAULT_MAX_MEMORY_PAGES) * WASM_PAGE_SIZE_BYTES,\n      used: currentBytes,\n    };\n  }\n\n  /**\n   * Get the input buffer pointer, ensuring sufficient memory is available.\n   *\n   * This method doesn't allocate new buffers on each call - it always returns the\n   * same INPUT_BUFFER_START_OFFSET constant after ensuring the memory can accommodate the\n   * required size. Single-allocation design chosen because: (1) heap is reset between\n   * evaluations so fragmentation isn't an issue, (2) simpler than maintaining a free\n   * list, (3) marshal code controls actual layout in WASM memory. All input data is\n   * marshaled into a single buffer starting at INPUT_BUFFER_START_OFFSET.\n   *\n   * @param required - The required memory size in bytes\n   * @returns The base pointer of the input buffer (always INPUT_BUFFER_START_OFFSET)\n   * @throws {RuntimeError} If memory cannot be grown to accommodate the required size\n   *\n   * @example\n   * ```typescript\n   * const ptr = decision.getInputBuffer(1024); // Ensure 1KB available\n   * ```\n   */\n  getInputBuffer(required: number): number {\n    if (!this.memory) {\n      throw new RuntimeError('Memory not initialized - call evaluate() first', 5);\n    }\n\n    // Ensure enough memory\n    try {\n      ensureMemory(this.memory, required);\n    } catch (error) {\n      throw new RuntimeError(\n        `Memory allocation failed: ${error instanceof Error ? error.message : String(error)}`,\n        5, // OUT_OF_MEMORY error code\n      );\n    }\n\n    // Single-allocation design: return the INPUT_BUFFER_START_OFFSET\n    return INPUT_BUFFER_START_OFFSET;\n  }\n}\n\n/**\n * Create a CompiledDecision instance from a CompilationResult.\n *\n * This is a convenience function that creates the necessary marshal,\n * unmarshal, and validation functions from the generated code.\n *\n * @param result - The compilation result\n * @param validate - Optional validation function (defaults to generated validation code)\n * @returns A CompiledDecision instance ready for evaluation\n *\n * @example\n * ```typescript\n * const result = await compile({\n *   jdm: myJdm,\n *   inputSchema: MyInputSchema,\n *   outputSchema: MyOutputSchema,\n * });\n *\n * const decision = createCompiledDecision(result);\n * const output = await decision.evaluate({ age: 25 });\n * ```\n */\nexport async function createCompiledDecision(\n  result: CompilationResult,\n  validate?: ValidateFn,\n): Promise<CompiledDecision> {\n  // Load the marshal and unmarshal functions from the generated code\n  const { marshal, unmarshal } = loadGeneratedMarshaling(result.marshalCode);\n\n  // Load or use provided validation function\n  const validator = validate ?? (await loadGeneratedValidation(result.validationCode));\n\n  return new CompiledDecision({\n    wasm: result.wasm,\n    schemaHash: result.schemaHash,\n    marshal,\n    unmarshal,\n    validate: validator,\n  });\n}\n\n// Re-export compile-time code generation functions for backward compatibility\nexport { loadGeneratedMarshaling, loadGeneratedValidation } from './runtime-codegen';\n\n/**\n * Re-export types from dependencies\n */\nexport type { TSchema } from '@sinclair/typebox';\n","/**\n * Compile AssemblyScript code to WebAssembly.\n *\n * This module provides the main entry point for WASM compilation with caching.\n * Implementation details are delegated to specialized modules:\n * - virtual-fs.ts: Virtual filesystem for in-memory ASC compilation\n * - asc-compiler.ts: AssemblyScript compiler invocation and configuration\n * - wasm-instantiate.ts: WASM module instantiation and host environment\n */\n\nimport type { CompilerOptions } from './types';\nimport { computeCacheKey, readCacheFromDisk, writeCacheToDisk, isCacheEnabled } from './cache';\nimport { compileAssemblyScriptInternal } from './asc-compiler';\n\n// Re-export for backward compatibility\nexport { instantiateWasm } from './wasm-instantiate';\n\n/**\n * Compile AssemblyScript code to WebAssembly.\n *\n * This function uses the AssemblyScript compiler to generate WASM from\n * the generated AssemblyScript source code using a virtual filesystem.\n *\n * Supports disk-based caching to avoid redundant compilations.\n * Cache is keyed on: AssemblyScript code + runtime libraries + compiler options.\n *\n * **Filesystem Side Effects:**\n * - Compilation may read/write cache files (unless disabled via JDM_ASM_NO_CACHE=1)\n * - If `options.debugOutputPath` is set or `JDM_ASM_DEBUG_OUTPUT` env var is defined,\n *   compilation failures will write debug files to disk (see CompilerOptions.debugOutputPath)\n *\n * @param code - The AssemblyScript source code to compile\n * @param options - Compiler options (optimize, debug, debugOutputPath, etc.)\n * @returns An object with the compiled binary and WAT text\n */\nexport async function compileAssemblyScript(\n  code: string,\n  options: CompilerOptions,\n): Promise<{ binary: Uint8Array; wat: string }> {\n  // Check cache first (unless disabled)\n  if (isCacheEnabled()) {\n    const cacheKey = computeCacheKey(code, options);\n    const cached = readCacheFromDisk(cacheKey);\n    if (cached) {\n      return cached;\n    }\n\n    // Compile and cache the result\n    const result = await compileAssemblyScriptInternal(code, options);\n    writeCacheToDisk(cacheKey, result);\n    return result;\n  }\n\n  // Cache disabled, compile directly\n  return compileAssemblyScriptInternal(code, options);\n}\n","import { type TSchema, Kind } from '@sinclair/typebox';\nimport type { FlattenedLayout } from './types';\nimport { createHash } from 'crypto';\n\n/**\n * Schema field information for memory layout\n */\ninterface SchemaField {\n  schema: TSchema;\n  path: string;\n  flatName: string;\n}\n\n/**\n * Flattens a TypeBox schema to a memory layout.\n *\n * This function processes a schema and produces a flattened representation\n * that can be used for direct memory access in WebAssembly.\n *\n * Memory structure:\n * ┌─────────────────────────────────────────────────────────────┐\n * │ Fixed Fields (numbers, bools, enum indices)                 │\n * │   customer_age: f64 (8 bytes)                               │\n * │   customer_tier: i32 (4 bytes) - enum index                 │\n * ├─────────────────────────────────────────────────────────────┤\n * │ String/Array Pointers (offset, length pairs)                │\n * │   order_items_ptr: i32, order_items_len: i32                │\n * ├─────────────────────────────────────────────────────────────┤\n * │ Variable-length data (UTF-16 strings, array contents)       │\n * └─────────────────────────────────────────────────────────────┘\n *\n * @param schema - The TypeBox schema to flatten\n * @param _prefix - Internal parameter for recursive flattening with dotted paths\n * @returns The flattened memory layout\n */\nexport function flattenSchema(schema: TSchema): FlattenedLayout {\n  const layout: FlattenedLayout = {\n    fields: [],\n  };\n\n  // Collect all fields from the schema\n  const fields: SchemaField[] = collectFields(schema, '');\n\n  // Track current offset for field layout\n  let currentOffset = 0;\n\n  // Process fields: first pass - fixed types\n  for (const field of fields) {\n    const typeInfo = getFieldType(field.schema);\n    if (typeInfo.isFixed) {\n      layout.fields.push({\n        path: field.path,\n        flatName: field.flatName,\n        type: typeInfo.asType,\n        offset: currentOffset,\n        size: typeInfo.size,\n      });\n      currentOffset += typeInfo.size;\n    }\n  }\n\n  // Second pass - variable types (strings, arrays)\n  // These get pointers (2 x i32 = 8 bytes each for offset + length)\n  for (const field of fields) {\n    const typeInfo = getFieldType(field.schema);\n    if (!typeInfo.isFixed) {\n      layout.fields.push({\n        path: field.path,\n        flatName: field.flatName,\n        type: typeInfo.asType,\n        offset: currentOffset,\n        size: -1, // Variable length\n      });\n      currentOffset += 8; // 4 bytes offset + 4 bytes length\n    }\n  }\n\n  return layout;\n}\n\n/**\n * Collect all fields from a schema recursively\n */\nfunction collectFields(schema: TSchema, path: string): SchemaField[] {\n  const fields: SchemaField[] = [];\n\n  const kind = (schema as any)[Kind];\n\n  if (kind === 'Object') {\n    const properties = (schema as any).properties || {};\n    for (const [name, fieldSchema] of Object.entries(properties)) {\n      const fieldPath = path ? `${path}.${name}` : name;\n      const flatName = path ? `${path}_${name}` : name;\n\n      const nestedFields = collectFields(fieldSchema as TSchema, fieldPath);\n      if (nestedFields.length > 0) {\n        fields.push(...nestedFields);\n      } else {\n        fields.push({\n          schema: fieldSchema as TSchema,\n          path: fieldPath,\n          flatName,\n        });\n      }\n    }\n  }\n\n  // For non-objects, return empty array (handled by parent)\n  return fields;\n}\n\n/**\n * Get type information for a schema field\n */\nfunction getFieldType(schema: TSchema): {\n  isFixed: boolean;\n  asType: 'f64' | 'i32' | 'i64' | 'bool' | 'string' | 'array';\n  size: number;\n} {\n  const kind = (schema as any)[Kind];\n\n  switch (kind) {\n    case 'Number':\n      return { isFixed: true, asType: 'f64', size: 8 };\n\n    case 'Integer':\n      return { isFixed: true, asType: 'i32', size: 4 };\n\n    case 'Boolean':\n      // Booleans stored as i32 (4 bytes) to ensure natural alignment and match AssemblyScript's\n      // bool representation\n      return { isFixed: true, asType: 'bool', size: 4 };\n\n    case 'String':\n      return { isFixed: false, asType: 'string', size: -1 };\n\n    case 'Array':\n      return { isFixed: false, asType: 'array', size: -1 };\n\n    case 'Literal':\n      // Literals are stored as i32 indices (for boolean-like or enum-like)\n      return { isFixed: true, asType: 'i32', size: 4 };\n\n    case 'Union':\n      // First, handle unions of Literal types (enum-like) as i32 indices for efficiency\n      const anyOf = (schema as any).anyOf;\n      if (Array.isArray(anyOf) && anyOf.length > 0) {\n        const firstKind = (anyOf[0] as any)[Kind];\n        if (firstKind === 'Literal') {\n          return { isFixed: true, asType: 'i32', size: 4 };\n        }\n      }\n      // Default to string for heterogeneous unions - can represent multiple incompatible types\n      // (e.g., string | number | object)\n      return { isFixed: false, asType: 'string', size: -1 };\n\n    default:\n      // Default to string for unknown types\n      return { isFixed: false, asType: 'string', size: -1 };\n  }\n}\n\n/**\n * Compute a hash of the input and output schemas for runtime validation.\n *\n * This hash is embedded in the compiled WASM module and can be used to\n * verify that the runtime data matches the expected schema.\n *\n * Uses SHA256 to create a canonical hash, then takes the first 8 bytes as u64.\n *\n * @param inputSchema - The input schema\n * @param outputSchema - The output schema\n * @returns A 64-bit hash value\n */\nexport function computeSchemaHash(inputSchema: TSchema, outputSchema: TSchema): bigint {\n  // Create canonical representation with sorted keys\n  const canonical = JSON.stringify(\n    {\n      input: canonicalizeSchema(inputSchema),\n      output: canonicalizeSchema(outputSchema),\n    },\n    null,\n    2,\n  );\n\n  // Compute SHA256 hash\n  const hash = createHash('sha256').update(canonical).digest();\n\n  // Take first 8 bytes as u64 (little-endian)\n  return hash.readBigUInt64LE(0);\n}\n\n/**\n * Convert a schema to a canonical form for hashing by sorting keys and normalizing structure\n */\nfunction canonicalizeSchema(schema: TSchema): unknown {\n  const kind = (schema as any)[Kind];\n\n  if (kind === 'Object') {\n    const properties = (schema as any).properties || {};\n    const canonical: Record<string, unknown> = {};\n    const keys = Object.keys(properties).sort();\n\n    for (const key of keys) {\n      canonical[key] = canonicalizeSchema(properties[key]);\n    }\n\n    return {\n      type: 'object',\n      properties: canonical,\n      required: ((schema as any).required || []).sort(),\n    };\n  }\n\n  if (kind === 'Array') {\n    return {\n      type: 'array',\n      items: canonicalizeSchema((schema as any).items),\n    };\n  }\n\n  if (kind === 'Enum') {\n    return {\n      type: 'enum',\n      values: ((schema as any).anyOf || []).map((val: TSchema) => (val as any).const).sort(),\n    };\n  }\n\n  if (kind === 'Literal') {\n    return {\n      type: 'literal',\n      value: (schema as any).const,\n    };\n  }\n\n  // For primitive types, return a simple representation\n  const primitiveTypes: Record<string, string> = {\n    Number: 'number',\n    Integer: 'integer',\n    String: 'string',\n    Boolean: 'boolean',\n  };\n\n  return primitiveTypes[kind] || kind;\n}\n","// src/compiler/index.ts\nimport type { TSchema } from '@sinclair/typebox';\nimport { parseJDM, type JDMDecision } from './parser';\nimport { compileDecision } from './codegen';\nimport { compileAssemblyScript } from './build';\nimport { flattenSchema, computeSchemaHash } from './schema';\nimport { generateMarshalCode, generateValidationCode } from './marshal-gen';\nimport type {\n  CompilerOptions,\n  CompilationResult,\n  CompilationContext,\n  NoMatchBehavior,\n} from './types';\nimport { readFileSync } from 'fs';\nimport path from 'path';\n\n/**\n * Type guard for Node.js file system errors.\n */\nfunction isFileNotFoundError(error: unknown): boolean {\n  return error !== null && typeof error === 'object' && 'code' in error && error.code === 'ENOENT';\n}\n\n/**\n * Creates a filesystem-based loader for sub-decision JDM files.\n *\n * This loader performs I/O by reading from the filesystem and may throw filesystem errors\n * (e.g., ENOENT for missing files, EACCES for permission denied).\n *\n * Supports both zen-engine compatibility (flat structure in zen-reference/) and organized test\n * structure (nested by feature in sub-decisions/). This dual approach allows us to port\n * zen-engine fixtures without reorganization while providing better organization for our own\n * tests.\n *\n * @param testDataRoot - Optional root directory for test data. Defaults to \"test-data/\" in current working directory.\n * @returns A loader function that reads JDM files from the filesystem\n * @throws Error if file is not found in any search path\n * @throws Error for other filesystem errors (permissions, invalid content, etc.)\n */\nfunction createFilesystemLoader(testDataRoot?: string): (key: string) => JDMDecision {\n  const root = testDataRoot || path.join(process.cwd(), 'test-data');\n  const possiblePaths = [\n    root,\n    path.join(root, 'sub-decisions'),\n    path.join(root, 'sub-decisions/basic'),\n    path.join(root, 'sub-decisions/simple-multi'),\n    path.join(root, 'sub-decisions/complex-multi'),\n    path.join(root, 'sub-decisions/diamond'),\n    path.join(root, 'sub-decisions/error-propagation'),\n    path.join(root, 'zen-reference'),\n  ];\n\n  return (key: string): JDMDecision => {\n    for (const basePath of possiblePaths) {\n      try {\n        const filePath = path.join(basePath, key);\n        const content = readFileSync(filePath, 'utf-8');\n        return parseJDM(content);\n      } catch (error) {\n        // Only try next path for file-not-found errors\n        // Let other errors (parse errors, permission denied) propagate immediately\n        if (isFileNotFoundError(error)) {\n          continue;\n        }\n        throw error;\n      }\n    }\n    throw new Error(\n      `Failed to load sub-decision \"${key}\": not found in any search path (${possiblePaths.join(', ')})`,\n    );\n  };\n}\n\n// Re-export parser, graph, optimizer, runtime, validation, types, and errors\nexport * from './parser';\nexport * from './graph';\nexport * from './types';\nexport * from './errors';\nexport * from './optimizer';\nexport * from './runtime';\nexport * from './runtime-codegen';\n\n// Validation modules - split by concern:\n// - compile-time-validation: Static analysis of JDM structure and references\n// - runtime-validation-codegen: Validation code that executes at runtime\nexport * from './compile-time-validation';\nexport * from './runtime-validation-codegen';\n\n// Backward compatibility: re-export from input-validation (deprecated)\nexport * from './input-validation';\n\n// Export cache utilities for advanced usage\nexport {\n  clearCache,\n  getCacheStats,\n  pruneCache,\n  isCacheEnabled,\n  getCacheDirectory,\n  getCacheHealth,\n} from './cache';\n\n/**\n * Main entry point: Compile JDM to WASM with schema-driven marshaling.\n *\n * @example\n * const result = await compile({\n *   inputSchema: InputSchema,\n *   outputSchema: OutputSchema,\n *   jdm: jdmJson,\n *   optimize: true,\n * });\n */\nexport async function compile(options: {\n  inputSchema: TSchema;\n  outputSchema: TSchema;\n  jdm: string | JDMDecision;\n  optimize?: boolean;\n  debug?: boolean;\n  /** How to handle cases where no rules match in decision tables/switches */\n  noMatchBehavior?: NoMatchBehavior;\n  /** Optional loader function to load sub-decision JDM files */\n  loadDecision?: CompilerOptions['loadDecision'];\n  /** Optional testDataRoot path for default loader to search */\n  testDataRoot?: string;\n}): Promise<CompilationResult> {\n  const opts: CompilerOptions = {\n    optimize: options.optimize ?? true,\n    debug: options.debug ?? false,\n    // Validation disabled during compilation for performance (compile-time checks).\n    // Schema validation is generated as separate code (generateValidationCode()) that\n    // the runtime can call before evaluation.\n    validate: false,\n    noMatchBehavior: options.noMatchBehavior,\n  };\n\n  // Phase 1: Parse and validate JDM\n  const parsed = parseJDM(options.jdm);\n\n  // Phase 2: Flatten schemas to memory layout\n  const inputLayout = flattenSchema(options.inputSchema);\n  const outputLayout = flattenSchema(options.outputSchema);\n\n  // Phase 3: Compute schema hash for runtime validation\n  const schemaHash = computeSchemaHash(options.inputSchema, options.outputSchema);\n\n  // Phase 4: Build compilation context\n  const context: CompilationContext = {\n    jdm: parsed,\n    inputSchema: options.inputSchema,\n    outputSchema: options.outputSchema,\n    inputLayout,\n    outputLayout,\n    schemaHash,\n    options: opts,\n    parseExpression: (expr) => parseStandardExpression(expr),\n    parseUnaryExpression: (expr) => parseUnaryExpressionImpl(expr),\n    getUniqueId: createIdGenerator(),\n    loadDecision: options.loadDecision ?? createFilesystemLoader(options.testDataRoot),\n    // Avoids duplicate compilation when multiple nodes reference same sub-decision\n    compiledSubDecisions: new Map(),\n    // Detects circular references to prevent infinite loops during compilation\n    decisionPath: [],\n    helperFunctions: new Map(),\n  };\n\n  // Phase 5: Generate AssemblyScript code\n  const asCode = compileDecision(parsed, context);\n\n  // Phase 6: Compile to WASM\n  const { binary, wat } = await compileAssemblyScript(asCode, opts);\n\n  // Phase 7: Generate JS marshaling code\n  const marshalCode = generateMarshalCode(inputLayout, outputLayout, schemaHash);\n  const validationCode = generateValidationCode(options.inputSchema);\n\n  return {\n    wasm: binary,\n    schemaHash,\n    marshalCode,\n    validationCode,\n    wat: opts.debug ? wat : undefined,\n    assemblyScript: opts.debug ? asCode : undefined,\n  };\n}\n\nfunction createIdGenerator(): (prefix: string) => string {\n  const counters = new Map<string, number>();\n  return (prefix: string) => {\n    const count = counters.get(prefix) ?? 0;\n    counters.set(prefix, count + 1);\n    return `${prefix}_${count}`;\n  };\n}\n\n// Import parse functions\nimport {\n  parseStandardExpression,\n  parseUnaryExpression as parseUnaryExpressionImpl,\n} from './unary-parser';\n","/**\n * Union type of all expression AST nodes.\n */\nexport type ExpressionAST =\n  | NumberLiteral\n  | StringLiteral\n  | BooleanLiteral\n  | NullLiteral\n  | Identifier\n  | DollarRef\n  | HashRef\n  | BinaryOp\n  | UnaryOp\n  | TernaryOp\n  | MemberAccess\n  | IndexAccess\n  | FunctionCall\n  | Interval\n  | TemplateLiteral\n  | ArrayLiteral\n  | ObjectLiteral;\n\nexport interface NumberLiteral {\n  type: 'NumberLiteral';\n  value: number;\n}\n\nexport interface StringLiteral {\n  type: 'StringLiteral';\n  value: string;\n}\n\nexport interface BooleanLiteral {\n  type: 'BooleanLiteral';\n  value: boolean;\n}\n\nexport interface NullLiteral {\n  type: 'NullLiteral';\n}\n\nexport interface Identifier {\n  type: 'Identifier';\n  name: string;\n}\n\n/**\n * Dollar reference - used in unary mode to refer to the current value.\n * Represents `$` in decision table cell expressions.\n */\nexport interface DollarRef {\n  type: 'DollarRef';\n}\n\n/**\n * Hash reference - used in higher-order functions to refer to current element.\n * Represents `#` in expressions like `filter(items, # > 5)`.\n */\nexport interface HashRef {\n  type: 'HashRef';\n}\n\nexport interface BinaryOp {\n  type: 'BinaryOp';\n  op: BinaryOperator;\n  left: ExpressionAST;\n  right: ExpressionAST;\n}\n\nexport type BinaryOperator =\n  // Arithmetic\n  | '+'\n  | '-'\n  | '*'\n  | '/'\n  | '%'\n  | '^'\n  // Comparison\n  | '=='\n  | '!='\n  | '<'\n  | '>'\n  | '<='\n  | '>='\n  // Logical\n  | 'and'\n  | 'or'\n  | '??'\n  // Membership\n  | 'in'\n  | 'not in';\n\nexport interface UnaryOp {\n  type: 'UnaryOp';\n  op: UnaryOperator;\n  operand: ExpressionAST;\n}\n\nexport type UnaryOperator = 'not' | '-';\n\nexport interface TernaryOp {\n  type: 'TernaryOp';\n  condition: ExpressionAST;\n  consequent: ExpressionAST;\n  alternate: ExpressionAST;\n}\n\nexport interface MemberAccess {\n  type: 'MemberAccess';\n  object: ExpressionAST;\n  property: string;\n}\n\nexport interface IndexAccess {\n  type: 'IndexAccess';\n  object: ExpressionAST;\n  index: ExpressionAST;\n}\n\nexport interface FunctionCall {\n  type: 'FunctionCall';\n  callee: ExpressionAST;\n  args: ExpressionAST[];\n}\n\nexport interface Interval {\n  type: 'Interval';\n  start: ExpressionAST;\n  end: ExpressionAST;\n  startInclusive: boolean;\n  endInclusive: boolean;\n}\n\nexport interface TemplateLiteral {\n  type: 'TemplateLiteral';\n  parts: Array<{ text: string } | { expr: ExpressionAST }>;\n}\n\nexport interface ArrayLiteral {\n  type: 'ArrayLiteral';\n  elements: ExpressionAST[];\n}\n\nexport interface ObjectLiteral {\n  type: 'ObjectLiteral';\n  properties: Array<{ key: string; value: ExpressionAST }>;\n}\n\nexport function isNumberLiteral(node: ExpressionAST): node is NumberLiteral {\n  return node.type === 'NumberLiteral';\n}\n\nexport function isStringLiteral(node: ExpressionAST): node is StringLiteral {\n  return node.type === 'StringLiteral';\n}\n\nexport function isBooleanLiteral(node: ExpressionAST): node is BooleanLiteral {\n  return node.type === 'BooleanLiteral';\n}\n\nexport function isNullLiteral(node: ExpressionAST): node is NullLiteral {\n  return node.type === 'NullLiteral';\n}\n\nexport function isIdentifier(node: ExpressionAST): node is Identifier {\n  return node.type === 'Identifier';\n}\n\nexport function isDollarRef(node: ExpressionAST): node is DollarRef {\n  return node.type === 'DollarRef';\n}\n\nexport function isHashRef(node: ExpressionAST): node is HashRef {\n  return node.type === 'HashRef';\n}\n\nexport function isBinaryOp(node: ExpressionAST): node is BinaryOp {\n  return node.type === 'BinaryOp';\n}\n\nexport function isUnaryOp(node: ExpressionAST): node is UnaryOp {\n  return node.type === 'UnaryOp';\n}\n\nexport function isTernaryOp(node: ExpressionAST): node is TernaryOp {\n  return node.type === 'TernaryOp';\n}\n\nexport function isMemberAccess(node: ExpressionAST): node is MemberAccess {\n  return node.type === 'MemberAccess';\n}\n\nexport function isIndexAccess(node: ExpressionAST): node is IndexAccess {\n  return node.type === 'IndexAccess';\n}\n\nexport function isFunctionCall(node: ExpressionAST): node is FunctionCall {\n  return node.type === 'FunctionCall';\n}\n\nexport function isInterval(node: ExpressionAST): node is Interval {\n  return node.type === 'Interval';\n}\n\nexport function isTemplateLiteral(node: ExpressionAST): node is TemplateLiteral {\n  return node.type === 'TemplateLiteral';\n}\n\nexport function isArrayLiteral(node: ExpressionAST): node is ArrayLiteral {\n  return node.type === 'ArrayLiteral';\n}\n\nexport function isObjectLiteral(node: ExpressionAST): node is ObjectLiteral {\n  return node.type === 'ObjectLiteral';\n}\n","import { createToken, CstParser, Lexer, type IToken } from 'chevrotain';\nimport { CompilationError, ErrorCode, type SourceLocation } from './errors';\n\n// === TOKENS (order matters - longer matches first) ===\n\nconst WhiteSpace = createToken({\n  name: 'WhiteSpace',\n  pattern: /\\s+/,\n  group: Lexer.SKIPPED,\n});\n\nconst DotDot = createToken({ name: 'DotDot', pattern: /\\.\\./ });\nconst Dot = createToken({ name: 'Dot', pattern: /\\./ });\n\nconst Eq = createToken({ name: 'Eq', pattern: /==/ });\nconst NotEq = createToken({ name: 'NotEq', pattern: /!=/ });\nconst EqEq = createToken({ name: 'EqEq', pattern: /===/ });\nconst NotEqEq = createToken({ name: 'NotEqEq', pattern: /!==/ });\nconst LtEq = createToken({ name: 'LtEq', pattern: /<=/ });\nconst GtEq = createToken({ name: 'GtEq', pattern: />=/ });\nconst Lt = createToken({ name: 'Lt', pattern: /</ });\nconst Gt = createToken({ name: 'Gt', pattern: />/ });\n\nconst AndAnd = createToken({ name: 'AndAnd', pattern: /&&/ });\nconst OrOr = createToken({ name: 'OrOr', pattern: /\\|\\|/ });\nconst NotNot = createToken({ name: 'NotNot', pattern: /!/ });\n\n// Keywords use longer_alt to ensure 'and'/'or' are recognized as operators rather than\n// variable names - Chevrotain tries longer_alt tokens first, preventing 'android' from\n// incorrectly tokenizing as 'and' + 'roid'.\nconst Identifier = createToken({ name: 'Identifier', pattern: /[$a-zA-Z_]\\w*/ });\n\nconst And = createToken({ name: 'And', pattern: /and/, longer_alt: Identifier });\nconst Or = createToken({ name: 'Or', pattern: /or/, longer_alt: Identifier });\nconst Not = createToken({ name: 'Not', pattern: /not/, longer_alt: Identifier });\nconst In = createToken({ name: 'In', pattern: /in/, longer_alt: Identifier });\n\nconst True = createToken({ name: 'True', pattern: /true/, longer_alt: Identifier });\nconst False = createToken({ name: 'False', pattern: /false/, longer_alt: Identifier });\nconst Null = createToken({ name: 'Null', pattern: /null/, longer_alt: Identifier });\n\nconst NumberLiteral = createToken({\n  name: 'NumberLiteral',\n  pattern: /\\d[\\d_]*(\\.\\d+)?/,\n});\n\nconst StringLiteral = createToken({\n  name: 'StringLiteral',\n  pattern: /\"([^\"\\\\]|\\\\.)*\"|'([^'\\\\]|\\\\.)*'/,\n});\n\n// Template strings\n// Token order critical: TemplateHead/Middle/Tail must precede TemplateNoSub because Chevrotain matches first token that fits.\n// Without this order, '`foo${x}`' would incorrectly match TemplateNoSub instead of TemplateHead + expr + TemplateTail.\n// TemplateNoSub pattern must explicitly exclude ${ to prevent ambiguity between templates with/without interpolation.\nconst TemplateHead = createToken({\n  name: 'TemplateHead',\n  pattern: /`(?:[^`\\\\$]|\\\\.|\\$(?!\\{))*?\\$\\{/,\n});\nconst TemplateMiddle = createToken({\n  name: 'TemplateMiddle',\n  pattern: /\\}(?:[^`\\\\$]|\\\\.|\\$(?!\\{))*?\\$\\{/,\n});\nconst TemplateTail = createToken({\n  name: 'TemplateTail',\n  pattern: /\\}(?:[^`\\\\$]|\\\\.|\\$(?!\\{))*?`/,\n});\n// TemplateNoSub should NOT match strings that contain ${, so we exclude them explicitly\nconst TemplateNoSub = createToken({\n  name: 'TemplateNoSub',\n  pattern: /`(?:[^`\\\\$]|\\\\.|\\$(?!\\{))*?`/,\n});\n\nconst Hash = createToken({ name: 'Hash', pattern: /#/ }); // Current element in higher-order functions\n// Dollar ($) represents explicit reference in unary mode. Uses longer_alt: Identifier to ensure $-prefixed identifiers like '$myVar'\n// are tokenized as a single Identifier token rather than separate Dollar + Identifier tokens, since Identifier pattern includes '$' prefix.\nconst Dollar = createToken({ name: 'Dollar', pattern: /\\$/, longer_alt: Identifier });\n\n// Operators and delimiters\nconst Plus = createToken({ name: 'Plus', pattern: /\\+/ });\nconst Minus = createToken({ name: 'Minus', pattern: /-/ });\nconst Mult = createToken({ name: 'Mult', pattern: /\\*/ });\nconst Div = createToken({ name: 'Div', pattern: /\\// });\nconst Mod = createToken({ name: 'Mod', pattern: /%/ });\nconst Power = createToken({ name: 'Power', pattern: /\\^/ });\n\nconst LParen = createToken({ name: 'LParen', pattern: /\\(/ });\nconst RParen = createToken({ name: 'RParen', pattern: /\\)/ });\nconst LBracket = createToken({ name: 'LBracket', pattern: /\\[/ });\nconst RBracket = createToken({ name: 'RBracket', pattern: /\\]/ });\n\nconst LBrace = createToken({ name: 'LBrace', pattern: /\\{/ });\nconst RBrace = createToken({ name: 'RBrace', pattern: /\\}/ });\n\nconst Comma = createToken({ name: 'Comma', pattern: /,/ });\nconst Question = createToken({ name: 'Question', pattern: /\\?/, longer_alt: Identifier });\nconst QuestionQuestion = createToken({ name: 'QuestionQuestion', pattern: /\\?\\?/ });\nconst Colon = createToken({ name: 'Colon', pattern: /:/ });\n\nconst allTokens = [\n  WhiteSpace,\n  DotDot,\n  Dot,\n  EqEq,\n  NotEqEq,\n  Eq,\n  NotEq,\n  LtEq,\n  GtEq,\n  Lt,\n  Gt,\n  AndAnd,\n  OrOr,\n  NotNot,\n  And,\n  Or,\n  Not,\n  In,\n  True,\n  False,\n  Null,\n  Plus,\n  Minus,\n  Mult,\n  Div,\n  Mod,\n  Power,\n  LParen,\n  RParen,\n  LBracket,\n  RBracket,\n  LBrace,\n  // Template tokens must come before RBrace so that TemplateTail/TemplateMiddle can match }\n  TemplateHead,\n  TemplateMiddle,\n  TemplateTail,\n  TemplateNoSub,\n  RBrace,\n  Comma,\n  QuestionQuestion,\n  Question,\n  Colon,\n  Hash,\n  Dollar,\n  NumberLiteral,\n  StringLiteral,\n  Identifier,\n];\n\n// === PARSER (precedence via rule layering) ===\n// Precedence (lowest to highest):\n// 1. Ternary: ? :\n// 2. Null coalescing: ??\n// 3. Logical OR: or\n// 4. Logical AND: and\n// 5. Comparison: ==, !=, <, >, <=, >=, in, not in\n// 6. Additive: +, -\n// 7. Multiplicative: *, /, %\n// 8. Power: ^ (RIGHT-ASSOCIATIVE)\n// 9. Unary: not, -\n// 10. Postfix: .property, [index], (call)\n// 11. Primary: literals, identifiers, parentheses\n\nclass ZenExpressionParser extends CstParser {\n  constructor() {\n    super(allTokens);\n    this.performSelfAnalysis();\n  }\n\n  // Entry - ternary (lowest precedence)\n  expression = this.RULE('expression', () => {\n    this.SUBRULE(this.nullCoalescingExpression, { LABEL: 'condition' });\n    this.OPTION(() => {\n      this.CONSUME(Question);\n      this.SUBRULE2(this.expression, { LABEL: 'consequent' });\n      this.CONSUME(Colon);\n      this.SUBRULE3(this.expression, { LABEL: 'alternate' });\n    });\n  });\n\n  nullCoalescingExpression = this.RULE('nullCoalescingExpression', () => {\n    this.SUBRULE(this.orExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.CONSUME(QuestionQuestion);\n      this.SUBRULE2(this.orExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  orExpression = this.RULE('orExpression', () => {\n    this.SUBRULE(this.andExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.OR([{ ALT: () => this.CONSUME(Or) }, { ALT: () => this.CONSUME(OrOr) }]);\n      this.SUBRULE2(this.andExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  andExpression = this.RULE('andExpression', () => {\n    this.SUBRULE(this.comparisonExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.OR([{ ALT: () => this.CONSUME(And) }, { ALT: () => this.CONSUME(AndAnd) }]);\n      this.SUBRULE2(this.comparisonExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  comparisonExpression = this.RULE('comparisonExpression', () => {\n    this.SUBRULE(this.additiveExpression, { LABEL: 'lhs' });\n    this.OPTION(() => {\n      this.OR([\n        { ALT: () => this.CONSUME(Eq) },\n        { ALT: () => this.CONSUME(NotEq) },\n        { ALT: () => this.CONSUME(Lt) },\n        { ALT: () => this.CONSUME(Gt) },\n        { ALT: () => this.CONSUME(LtEq) },\n        { ALT: () => this.CONSUME(GtEq) },\n        { ALT: () => this.CONSUME(In) },\n        {\n          ALT: () => {\n            this.CONSUME(Not);\n            this.CONSUME2(In);\n          },\n        }, // not in\n      ]);\n      this.SUBRULE2(this.additiveExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  additiveExpression = this.RULE('additiveExpression', () => {\n    this.SUBRULE(this.multiplicativeExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.OR([{ ALT: () => this.CONSUME(Plus) }, { ALT: () => this.CONSUME(Minus) }]);\n      this.SUBRULE2(this.multiplicativeExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  multiplicativeExpression = this.RULE('multiplicativeExpression', () => {\n    this.SUBRULE(this.powerExpression, { LABEL: 'lhs' });\n    this.MANY(() => {\n      this.OR([\n        { ALT: () => this.CONSUME(Mult) },\n        { ALT: () => this.CONSUME(Div) },\n        { ALT: () => this.CONSUME(Mod) },\n      ]);\n      this.SUBRULE2(this.powerExpression, { LABEL: 'rhs' });\n    });\n  });\n\n  // Power is RIGHT-ASSOCIATIVE to match mathematical convention:\n  //  e.g. 2^3^4 = 2^(3^4) = 2^81, not (2^3)^4 = 8^4 = 4096.\n  // Use self-recursion instead of MANY for right-associativity\n  powerExpression = this.RULE('powerExpression', () => {\n    this.SUBRULE(this.unaryExpression, { LABEL: 'base' });\n    this.OPTION(() => {\n      this.CONSUME(Power);\n      this.SUBRULE(this.powerExpression, { LABEL: 'exponent' }); // Self-recursion!\n    });\n  });\n\n  unaryExpression = this.RULE('unaryExpression', () => {\n    this.OR([\n      {\n        ALT: () => {\n          this.CONSUME(Not);\n          this.SUBRULE(this.unaryExpression, { LABEL: 'operand' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(NotNot);\n          this.SUBRULE2(this.unaryExpression, { LABEL: 'operand' });\n        },\n      },\n      {\n        ALT: () => {\n          this.CONSUME(Minus);\n          this.SUBRULE3(this.unaryExpression, { LABEL: 'operand' });\n        },\n      },\n      { ALT: () => this.SUBRULE(this.postfixExpression) },\n    ]);\n  });\n\n  // Postfix: .property, [index], (args)\n  postfixExpression = this.RULE('postfixExpression', () => {\n    this.SUBRULE(this.primaryExpression);\n    this.MANY(() => {\n      this.OR([\n        {\n          ALT: () => {\n            this.CONSUME(Dot);\n            this.CONSUME(Identifier, { LABEL: 'property' });\n          },\n        },\n        {\n          ALT: () => {\n            this.CONSUME(LBracket);\n            this.SUBRULE(this.expression, { LABEL: 'index' });\n            this.CONSUME(RBracket);\n          },\n        },\n        {\n          ALT: () => {\n            this.CONSUME(LParen);\n            this.OPTION(() => this.SUBRULE(this.argumentList));\n            this.CONSUME(RParen);\n          },\n        },\n      ]);\n    });\n  });\n\n  primaryExpression = this.RULE('primaryExpression', () => {\n    this.OR([\n      { ALT: () => this.CONSUME(NumberLiteral) },\n      { ALT: () => this.CONSUME(StringLiteral) },\n      { ALT: () => this.SUBRULE(this.templateLiteral) },\n      { ALT: () => this.CONSUME(True) },\n      { ALT: () => this.CONSUME(False) },\n      { ALT: () => this.CONSUME(Null) },\n      { ALT: () => this.CONSUME(Hash) }, // # for current element in higher-order functions\n      { ALT: () => this.CONSUME(Dollar) }, // $ for explicit reference in unary mode\n      { ALT: () => this.CONSUME(Identifier) },\n      // Array literal: [1, 2, 3]\n      {\n        GATE: () => this.isArrayLiteralStart(),\n        ALT: () => this.SUBRULE(this.arrayLiteralExpression),\n      },\n      // Object literal: {key: value, ...}\n      {\n        GATE: () => this.isObjectLiteralStart(),\n        ALT: () => this.SUBRULE(this.objectLiteralExpression),\n      },\n      {\n        ALT: () => {\n          this.CONSUME(LParen);\n          this.SUBRULE(this.expression);\n          this.CONSUME(RParen);\n        },\n      },\n      // Interval: use GATE to check for DotDot lookahead\n      {\n        GATE: () => this.isIntervalStart(),\n        ALT: () => this.SUBRULE(this.intervalExpression),\n      },\n    ]);\n  });\n\n  // Template string: `Hello ${name}, you have ${count} items`\n  templateLiteral = this.RULE('templateLiteral', () => {\n    this.OR([\n      // Simple template with no interpolation\n      { ALT: () => this.CONSUME(TemplateNoSub) },\n      // Template with interpolation\n      {\n        ALT: () => {\n          this.CONSUME(TemplateHead);\n          this.SUBRULE(this.expression, { LABEL: 'expr' });\n          this.MANY(() => {\n            this.CONSUME(TemplateMiddle);\n            this.SUBRULE2(this.expression, { LABEL: 'expr' });\n          });\n          this.CONSUME(TemplateTail);\n        },\n      },\n    ]);\n  });\n\n  // Interval: [a..b] or (a..b) with open/closed variations\n  intervalExpression = this.RULE('intervalExpression', () => {\n    this.OR([\n      { ALT: () => this.CONSUME(LBracket, { LABEL: 'startBracket' }) },\n      { ALT: () => this.CONSUME(LParen, { LABEL: 'startBracket' }) },\n    ]);\n\n    this.SUBRULE(this.expression, { LABEL: 'start' });\n    this.CONSUME(DotDot);\n    this.SUBRULE2(this.expression, { LABEL: 'end' });\n\n    this.OR2([\n      { ALT: () => this.CONSUME(RBracket, { LABEL: 'endBracket' }) },\n      { ALT: () => this.CONSUME(RParen, { LABEL: 'endBracket' }) },\n    ]);\n  });\n\n  // Array literal: [1, 2, 3] or []\n  arrayLiteralExpression = this.RULE('arrayLiteralExpression', () => {\n    this.CONSUME(LBracket);\n    this.OPTION(() => this.SUBRULE(this.argumentList));\n    this.CONSUME(RBracket);\n  });\n\n  // Object literal: {key: value, ...} or {}\n  objectLiteralExpression = this.RULE('objectLiteralExpression', () => {\n    this.CONSUME(LBrace);\n    this.OPTION(() => this.SUBRULE(this.objectPropertyList));\n    this.CONSUME(RBrace);\n  });\n\n  // Object property list for object literals\n  objectPropertyList = this.RULE('objectPropertyList', () => {\n    this.SUBRULE(this.objectProperty, { LABEL: 'prop' });\n    this.MANY(() => {\n      this.CONSUME(Comma);\n      this.SUBRULE2(this.objectProperty, { LABEL: 'prop' });\n    });\n  });\n\n  // Single object property: key: value\n  objectProperty = this.RULE('objectProperty', () => {\n    this.OR([\n      { ALT: () => this.CONSUME(StringLiteral, { LABEL: 'key' }) },\n      { ALT: () => this.CONSUME(Identifier, { LABEL: 'key' }) },\n    ]);\n    this.CONSUME(Colon);\n    this.SUBRULE(this.expression, { LABEL: 'value' });\n  });\n\n  argumentList = this.RULE('argumentList', () => {\n    this.SUBRULE(this.expression, { LABEL: 'arg' });\n    this.MANY(() => {\n      this.CONSUME(Comma);\n      this.SUBRULE2(this.expression, { LABEL: 'arg' });\n    });\n  });\n\n  // Helper: Check if current position starts an array literal\n  // An array literal is [ followed by expressions and commas, then ]\n  // We must distinguish [1,2] from [a..b]. An interval ALWAYS contains .. before closing\n  private isArrayLiteralStart(): boolean {\n    const lookahead = this.LA(1);\n    if (!lookahead || lookahead.tokenType !== LBracket) {\n      return false;\n    }\n\n    // Check if we have .. before a closing bracket (interval)\n    // If yes, this is not an array literal\n    return !this.isIntervalStart();\n  }\n\n  // Helper: Check if current position starts an object literal\n  // An object literal is { followed by key:value pairs and commas, then }\n  private isObjectLiteralStart(): boolean {\n    const lookahead = this.LA(1);\n    if (!lookahead || lookahead.tokenType !== LBrace) {\n      return false;\n    }\n    return true;\n  }\n\n  // Helper: Check if current position starts an interval (lookahead for ..)\n  // An interval is [expr..expr] or (expr..expr)\n  //\n  // We verify that after the start bracket, we'll eventually see .. before a closing bracket\n  // O(n) lookahead required because interval syntax '[1..10]' is ambiguous with array literals\n  // '[1,2,3]' - we must scan ahead to find '..' token to disambiguate, potentially examining\n  // entire token stream for malformed input.\n  private isIntervalStart(): boolean {\n    const lookahead = this.LA(1);\n    if (!lookahead) {\n      return false;\n    }\n    const tokenType = lookahead.tokenType;\n\n    // Only intervals start with [ or ( and must contain .. before closing\n    if (tokenType !== LBracket && tokenType !== LParen) {\n      return false;\n    }\n\n    // Look ahead through tokens to see if we find DotDot before a closing bracket\n    // Note: Chevrotain's LA() returns EOF token (not null) when past end of input\n    let depth = 0;\n    let i = 0;\n    while (true) {\n      const token = this.LA(++i);\n      // Check for end of input - LA() returns EOF token, not null\n      if (!token || token.tokenType.name === 'EOF') {\n        break;\n      }\n\n      const tt = token.tokenType;\n      if (tt === LBracket || tt === LParen || tt === LBrace) {\n        depth++;\n      } else if (tt === RBracket || tt === RParen || tt === RBrace) {\n        if (depth === 0) {\n          // Found end before DotDot - not an interval\n          return false;\n        }\n        depth--;\n      } else if (tt === DotDot) {\n        // Found DotDot before closing - this is an interval!\n        return true;\n      }\n    }\n\n    return false;\n  }\n}\n\nexport const parser = new ZenExpressionParser();\nexport const lexer = new Lexer(allTokens);\n\n/**\n * Parse an expression string and return the CST.\n *\n * @param input - The expression string to parse\n * @param location - Optional source location for error reporting\n * @returns The Concrete Syntax Tree (CST)\n * @throws Error if the parse fails\n */\nexport function parseExpression(input: string, location?: SourceLocation): any {\n  const lexResult = lexer.tokenize(input);\n\n  if (lexResult.errors.length > 0) {\n    throw new CompilationError(\n      `Lexer error: ${lexResult.errors.map((e) => e.message).join(', ')}`,\n      ErrorCode.PARSE_ERROR,\n      location,\n      { expression: input },\n    );\n  }\n\n  parser.input = lexResult.tokens;\n  const cst = parser.expression();\n\n  if (parser.errors.length > 0) {\n    throw new CompilationError(\n      `Parse error: ${parser.errors.map((e) => e.message).join(', ')}`,\n      ErrorCode.PARSE_ERROR,\n      location,\n      { expression: input },\n    );\n  }\n\n  return cst;\n}\n\nexport type { IToken };\n","import { parser } from './expression-parser';\nimport {\n  type ExpressionAST,\n  type StringLiteral,\n  type Interval,\n  type TemplateLiteral,\n  type ArrayLiteral,\n  type ObjectLiteral,\n  type BinaryOperator,\n} from './ast-types';\nimport type { CstNode } from 'chevrotain';\n\nconst BaseCstVisitor = parser.getBaseCstVisitorConstructor();\n\n/**\n * Converts Chevrotain CST to our AST format.\n */\nclass ExpressionAstBuilder extends BaseCstVisitor {\n  constructor() {\n    super();\n    this.validateVisitor();\n  }\n\n  expression(ctx: any): ExpressionAST {\n    const condition = this.visit(ctx.condition);\n\n    if (ctx.Question) {\n      return {\n        type: 'TernaryOp',\n        condition,\n        consequent: this.visit(ctx.consequent),\n        alternate: this.visit(ctx.alternate),\n      };\n    }\n\n    return condition;\n  }\n\n  nullCoalescingExpression(ctx: any): ExpressionAST {\n    let result = this.visit(ctx.lhs);\n\n    if (ctx.rhs) {\n      for (const rhsNode of ctx.rhs) {\n        result = {\n          type: 'BinaryOp',\n          op: '??',\n          left: result,\n          right: this.visit(rhsNode),\n        };\n      }\n    }\n\n    return result;\n  }\n\n  orExpression(ctx: any): ExpressionAST {\n    let result = this.visit(ctx.lhs);\n\n    if (ctx.rhs) {\n      for (const rhsNode of ctx.rhs) {\n        result = {\n          type: 'BinaryOp',\n          op: 'or',\n          left: result,\n          right: this.visit(rhsNode),\n        };\n      }\n    }\n\n    return result;\n  }\n\n  andExpression(ctx: any): ExpressionAST {\n    let result = this.visit(ctx.lhs);\n\n    if (ctx.rhs) {\n      for (const rhsNode of ctx.rhs) {\n        result = {\n          type: 'BinaryOp',\n          op: 'and',\n          left: result,\n          right: this.visit(rhsNode),\n        };\n      }\n    }\n\n    return result;\n  }\n\n  comparisonExpression(ctx: any): ExpressionAST {\n    const lhs = this.visit(ctx.lhs);\n\n    if (!ctx.rhs) {\n      return lhs;\n    }\n\n    // Determine operator\n    let op: BinaryOperator;\n    if (ctx.Eq) {\n      op = '==';\n    } else if (ctx.NotEq) {\n      op = '!=';\n    } else if (ctx.Lt) {\n      op = '<';\n    } else if (ctx.Gt) {\n      op = '>';\n    } else if (ctx.LtEq) {\n      op = '<=';\n    } else if (ctx.GtEq) {\n      op = '>=';\n    } else if (ctx.In) {\n      op = ctx.Not ? 'not in' : 'in';\n    } else {\n      throw new Error('Unknown comparison operator');\n    }\n\n    return {\n      type: 'BinaryOp',\n      op,\n      left: lhs,\n      right: this.visit(ctx.rhs),\n    };\n  }\n\n  additiveExpression(ctx: any): ExpressionAST {\n    return this.buildLeftAssociativeBinaryOp(ctx, ['Plus', 'Minus'], ['+', '-']);\n  }\n\n  multiplicativeExpression(ctx: any): ExpressionAST {\n    return this.buildLeftAssociativeBinaryOp(ctx, ['Mult', 'Div', 'Mod'], ['*', '/', '%']);\n  }\n\n  // Power is right-associative, handled differently via recursion in grammar\n  powerExpression(ctx: any): ExpressionAST {\n    const base = this.visit(ctx.base);\n\n    if (ctx.exponent) {\n      return {\n        type: 'BinaryOp',\n        op: '^',\n        left: base,\n        right: this.visit(ctx.exponent),\n      };\n    }\n\n    return base;\n  }\n\n  unaryExpression(ctx: any): ExpressionAST {\n    if (ctx.Not || ctx.NotNot) {\n      return { type: 'UnaryOp', op: 'not', operand: this.visit(ctx.operand) };\n    }\n    if (ctx.Minus) {\n      return { type: 'UnaryOp', op: '-', operand: this.visit(ctx.operand) };\n    }\n    return this.visit(ctx.postfixExpression);\n  }\n\n  postfixExpression(ctx: any): ExpressionAST {\n    let result = this.visit(ctx.primaryExpression);\n\n    // Collect all postfix operations with their source positions\n    type PostfixOp =\n      | { type: 'member'; offset: number; idx: number }\n      | { type: 'index'; offset: number; idx: number }\n      | { type: 'call'; offset: number; idx: number };\n\n    const ops: PostfixOp[] = [];\n\n    if (ctx.Dot) {\n      for (let i = 0; i < ctx.Dot.length; i++) {\n        ops.push({ type: 'member', offset: ctx.Dot[i].startOffset, idx: i });\n      }\n    }\n\n    if (ctx.LBracket) {\n      for (let i = 0; i < ctx.LBracket.length; i++) {\n        ops.push({ type: 'index', offset: ctx.LBracket[i].startOffset, idx: i });\n      }\n    }\n\n    if (ctx.LParen) {\n      for (let i = 0; i < ctx.LParen.length; i++) {\n        ops.push({ type: 'call', offset: ctx.LParen[i].startOffset, idx: i });\n      }\n    }\n\n    // Sort by source position to apply in correct order: Chevrotain collects each operator\n    // type separately, but the actual evaluation order depends on source position when multiple\n    // operator types can appear.\n    //\n    // We must sort by position to reconstruct left-to-right evaluation order\n    ops.sort((a, b) => a.offset - b.offset);\n\n    // Apply each operation in order\n    for (const op of ops) {\n      if (op.type === 'member') {\n        const prop = ctx.property[op.idx].image;\n        result = { type: 'MemberAccess', object: result, property: prop };\n      } else if (op.type === 'index') {\n        const indexExpr = ctx.index[op.idx];\n        result = { type: 'IndexAccess', object: result, index: this.visit(indexExpr) };\n      } else if (op.type === 'call') {\n        // Check if there's an argumentList for this call\n        const args =\n          ctx.argumentList && ctx.argumentList[op.idx] ? this.visit(ctx.argumentList[op.idx]) : [];\n        result = { type: 'FunctionCall', callee: result, args };\n      }\n    }\n\n    return result;\n  }\n\n  primaryExpression(ctx: any): ExpressionAST {\n    if (ctx.NumberLiteral) {\n      const raw = ctx.NumberLiteral[0].image.replace(/_/g, '');\n      return { type: 'NumberLiteral', value: parseFloat(raw) };\n    }\n    if (ctx.StringLiteral) {\n      const raw = ctx.StringLiteral[0].image;\n      const value = this.unescapeString(raw.slice(1, -1));\n      return { type: 'StringLiteral', value };\n    }\n    if (ctx.True) {\n      return { type: 'BooleanLiteral', value: true };\n    }\n    if (ctx.False) {\n      return { type: 'BooleanLiteral', value: false };\n    }\n    if (ctx.Null) {\n      return { type: 'NullLiteral' };\n    }\n    if (ctx.Hash) {\n      return { type: 'HashRef' };\n    }\n    if (ctx.Dollar) {\n      return { type: 'DollarRef' };\n    }\n    if (ctx.Identifier) {\n      return { type: 'Identifier', name: ctx.Identifier[0].image };\n    }\n    if (ctx.arrayLiteralExpression) {\n      return this.visit(ctx.arrayLiteralExpression);\n    }\n    if (ctx.objectLiteralExpression) {\n      return this.visit(ctx.objectLiteralExpression);\n    }\n    if (ctx.expression) {\n      return this.visit(ctx.expression);\n    }\n    if (ctx.intervalExpression) {\n      return this.visit(ctx.intervalExpression);\n    }\n    if (ctx.templateLiteral) {\n      return this.visit(ctx.templateLiteral);\n    }\n\n    throw new Error('Unknown primary expression');\n  }\n\n  intervalExpression(ctx: any): Interval {\n    const startBracket = ctx.startBracket[0];\n    const endBracket = ctx.endBracket[0];\n\n    return {\n      type: 'Interval',\n      start: this.visit(ctx.start) as ExpressionAST,\n      end: this.visit(ctx.end) as ExpressionAST,\n      startInclusive: startBracket.tokenType.name === 'LBracket',\n      endInclusive: endBracket.tokenType.name === 'RBracket',\n    };\n  }\n\n  arrayLiteralExpression(ctx: any): ArrayLiteral {\n    if (!ctx.argumentList) {\n      return { type: 'ArrayLiteral', elements: [] };\n    }\n    const args = this.visit(ctx.argumentList);\n    return { type: 'ArrayLiteral', elements: args as ExpressionAST[] };\n  }\n\n  objectLiteralExpression(ctx: any): ObjectLiteral {\n    if (!ctx.objectPropertyList) {\n      return { type: 'ObjectLiteral', properties: [] };\n    }\n    const props = this.visit(ctx.objectPropertyList);\n    return {\n      type: 'ObjectLiteral',\n      properties: props as Array<{ key: string; value: ExpressionAST }>,\n    };\n  }\n\n  objectPropertyList(ctx: any): Array<{ key: string; value: ExpressionAST }> {\n    return ctx.prop.map(\n      (propNode: CstNode) => this.visit(propNode) as { key: string; value: ExpressionAST },\n    );\n  }\n\n  objectProperty(ctx: any): { key: string; value: ExpressionAST } {\n    const keyToken = ctx.key[0];\n    const key =\n      keyToken.tokenType.name === 'StringLiteral'\n        ? this.unescapeString(keyToken.image.slice(1, -1))\n        : keyToken.image;\n    const value = this.visit(ctx.value) as ExpressionAST;\n    return { key, value };\n  }\n\n  templateLiteral(ctx: any): TemplateLiteral | StringLiteral {\n    // Handle simple template with no substitution\n    if (ctx.TemplateNoSub) {\n      const raw = ctx.TemplateNoSub[0].image;\n      return { type: 'StringLiteral', value: this.unescapeString(raw.slice(1, -1)) };\n    }\n\n    // Handle template with interpolation\n    const parts: Array<{ text: string } | { expr: ExpressionAST }> = [];\n\n    // Extract text from TemplateHead (remove ` and ${)\n    const headRaw = ctx.TemplateHead[0].image;\n    const headText = this.unescapeString(headRaw.slice(1, -2));\n    if (headText) {\n      parts.push({ text: headText });\n    }\n\n    // Add expressions and middle parts\n    for (let i = 0; i < ctx.expr.length; i++) {\n      parts.push({ expr: this.visit(ctx.expr[i]) as ExpressionAST });\n\n      if (ctx.TemplateMiddle && ctx.TemplateMiddle[i]) {\n        const midRaw = ctx.TemplateMiddle[i].image;\n        const midText = this.unescapeString(midRaw.slice(1, -2));\n        if (midText) {\n          parts.push({ text: midText });\n        }\n      }\n    }\n\n    // Extract text from TemplateTail (remove } and `)\n    const tailRaw = ctx.TemplateTail[0].image;\n    const tailText = this.unescapeString(tailRaw.slice(1, -1));\n    if (tailText) {\n      parts.push({ text: tailText });\n    }\n\n    // Template literals with no interpolation (just text) can be converted to simple string\n    // literals, avoiding runtime template processing overhead.\n    if (parts.every((p) => 'text' in p)) {\n      const combined = parts.map((p) => (p as { text: string }).text).join('');\n      return { type: 'StringLiteral', value: combined };\n    }\n\n    return { type: 'TemplateLiteral', parts };\n  }\n\n  argumentList(ctx: any): ExpressionAST[] {\n    return ctx.arg.map((argNode: CstNode) => this.visit(argNode) as ExpressionAST);\n  }\n\n  /**\n   * Helper to unescape string literals.\n   * Handles basic escape sequences like \\n, \\t, \\\", \\', \\\\, etc.\n   */\n  private unescapeString(s: string): string {\n    return s\n      .replace(/\\\\n/g, '\\n')\n      .replace(/\\\\t/g, '\\t')\n      .replace(/\\\\r/g, '\\r')\n      .replace(/\\\\'/g, \"'\")\n      .replace(/\"/g, '\"')\n      .replace(/\\\\\\\\/g, '\\\\');\n  }\n\n  /**\n   * Helper for left-associative binary operators.\n   * Collects all operator tokens, sorts them by position, and pairs them with RHS operands.\n   */\n  private buildLeftAssociativeBinaryOp(\n    ctx: any,\n    tokenNames: string[],\n    ops: BinaryOperator[],\n  ): ExpressionAST {\n    let result = this.visit(ctx.lhs) as ExpressionAST;\n\n    if (!ctx.rhs) {\n      // No right-hand side: return just the left expression\n      return result;\n    }\n\n    // Collect all operator tokens with their corresponding operator symbol\n    const operatorTokens: Array<{ op: BinaryOperator; offset: number }> = [];\n    for (let j = 0; j < tokenNames.length; j++) {\n      const tokens = ctx[tokenNames[j]];\n      if (tokens) {\n        for (const token of tokens) {\n          operatorTokens.push({ op: ops[j], offset: token.startOffset });\n        }\n      }\n    }\n\n    // Sort operators by their position in the source\n    operatorTokens.sort((a, b) => a.offset - b.offset);\n\n    // Build the expression tree left-to-right\n    for (let i = 0; i < ctx.rhs.length; i++) {\n      const op = operatorTokens[i]?.op;\n      if (!op) {\n        throw new Error(`Operator not found for ${tokenNames.join(', ')}`);\n      }\n\n      result = {\n        type: 'BinaryOp',\n        op,\n        left: result,\n        right: this.visit(ctx.rhs[i]) as ExpressionAST,\n      };\n    }\n\n    return result;\n  }\n}\n\nexport const astBuilder = new ExpressionAstBuilder();\n\n/**\n * Convert a CST (Concrete Syntax Tree) to an AST (Abstract Syntax Tree).\n * CST contains low-level parsing artifacts; AST simplifies structure for compilation\n *\n * @param cst - The CST from the Chevrotain parser\n * @returns The AST node\n */\nexport function cstToAst(cst: CstNode): ExpressionAST {\n  return astBuilder.visit(cst);\n}\n","/**\n * Unary AST transformation utilities.\n *\n * This module provides AST-level transformations specific to unary (decision table)\n * context. These transformations are applied AFTER parsing to convert a standard AST\n * into an AST that reflects the semantic meaning in unary context.\n *\n * Key transformations:\n * - Bare identifiers → string literals (for implicit string matching)\n * - Comparison without LHS → $ comparison (e.g., \"> 100\" → \"$ > 100\")\n * - Multiple comma-separated values → OR chain\n *\n * This separates SEMANTIC transformations from SYNTACTIC parsing, keeping\n * the parser focused solely on syntax-to-AST conversion.\n */\n\nimport type { ExpressionAST, BinaryOperator, BinaryOp } from './ast-types';\n\n/**\n * Convert a bare Identifier node to a StringLiteral node.\n *\n * In decision table cells, unquoted words like \"premium\" are semantic values to match against,\n * not variable references. This prevents errors when authors write intuitive cell values without\n * quotes. This is a key DMN/JDM usability feature.\n *\n * This handles the common JDM/DMN convention where cell values like:\n *   - premium      means match the string \"premium\" (identifier → string)\n *   - \"premium\"    means match the string \"premium\" (already a string)\n *\n * We only convert top-level Identifiers. More complex expressions (member access,\n * function calls, etc.) are left as-is since they likely involve actual variables.\n *\n * @param ast - The AST node that may be an Identifier\n * @returns The AST node, with Identifier converted to StringLiteral if applicable\n */\nexport function convertIdentifierToStringLiteral(ast: ExpressionAST): ExpressionAST {\n  if (ast.type === 'Identifier') {\n    return { type: 'StringLiteral', value: (ast as { type: 'Identifier'; name: string }).name };\n  }\n  return ast;\n}\n\n/**\n * Wrap an AST value in a comparison with DollarRef (the implicit cell input).\n *\n * In unary context, expressions like \"> 100\" implicitly compare against the input value.\n * This function creates the full comparison AST: \"$ <op> <value>\".\n *\n * @param ast - The right-hand side value AST\n * @param op - The comparison operator\n * @returns A BinaryOp AST with DollarRef on the left\n */\nexport function wrapWithDollarComparison(ast: ExpressionAST, op: BinaryOperator): BinaryOp {\n  return {\n    type: 'BinaryOp',\n    op,\n    left: { type: 'DollarRef' },\n    right: ast,\n  };\n}\n\n/**\n * Create an equality comparison with implicit identifier-to-string conversion.\n *\n * This is the default transformation for unary values - they become equality\n * comparisons against the input value ($). For equality/inequality comparisons,\n * bare identifiers are converted to string literals.\n *\n * @param ast - The value to compare against\n * @param op - The equality operator (== or !=)\n * @returns A BinaryOp AST representing the equality comparison\n */\nexport function createEqualityComparison(ast: ExpressionAST, op: '==' | '!='): BinaryOp {\n  const value = convertIdentifierToStringLiteral(ast);\n  return wrapWithDollarComparison(value, op);\n}\n\n/**\n * Create an interval membership check.\n *\n * In unary context, interval notation like \"[1..10]\" becomes \"$ in [1..10]\".\n *\n * @param intervalAst - The interval AST node\n * @returns A BinaryOp AST representing the membership check\n */\nexport function createIntervalCheck(intervalAst: ExpressionAST): BinaryOp {\n  return wrapWithDollarComparison(intervalAst, 'in');\n}\n\n/**\n * Create an array membership check.\n *\n * In unary context, array literals like \"['gold', 'platinum']\" become\n * \"$ in ['gold', 'platinum']\".\n *\n * @param arrayAst - The array literal AST node\n * @returns A BinaryOp AST representing the membership check\n */\nexport function createArrayMembershipCheck(arrayAst: ExpressionAST): BinaryOp {\n  return wrapWithDollarComparison(arrayAst, 'in');\n}\n\n/**\n * Combine multiple expression ASTs into an OR chain.\n *\n * In unary context, comma-separated values represent OR semantics.\n * For example, \"a, b, c\" becomes \"$ == 'a' or $ == 'b' or $ == 'c'\".\n *\n * @param exprs - Array of expression ASTs to combine\n * @returns A single AST representing the OR of all expressions\n */\nexport function combineWithOr(exprs: ExpressionAST[]): ExpressionAST {\n  if (exprs.length === 0) {\n    return { type: 'BooleanLiteral', value: true };\n  }\n  if (exprs.length === 1) {\n    return exprs[0];\n  }\n  return exprs.reduce((acc, expr) => ({\n    type: 'BinaryOp',\n    op: 'or',\n    left: acc,\n    right: expr,\n  }));\n}\n\n/**\n * Combine multiple expression ASTs into an AND chain.\n *\n * Used for compound unary expressions like \">= 13 and < 15\".\n *\n * @param exprs - Array of expression ASTs to combine\n * @returns A single AST representing the AND of all expressions\n */\nexport function combineWithAnd(exprs: ExpressionAST[]): ExpressionAST {\n  if (exprs.length === 0) {\n    return { type: 'BooleanLiteral', value: true };\n  }\n  if (exprs.length === 1) {\n    return exprs[0];\n  }\n  return exprs.reduce((acc, expr) => ({\n    type: 'BinaryOp',\n    op: 'and',\n    left: acc,\n    right: expr,\n  }));\n}\n","/**\n * Unary expression parser for decision table cells.\n *\n * This module provides parsing for unary mode expressions, which are used in\n * decision table cells. The parser is responsible for SYNTACTIC analysis only -\n * converting text to AST nodes. Semantic transformations (like converting\n * identifiers to string literals) are handled by the unary-ast-transforms module.\n *\n * Separation of Concerns:\n * - This module: Tokenization, lexing, parsing (text → AST)\n * - unary-ast-transforms: Semantic transformations (AST → transformed AST)\n * - unary-transform: Dollar reference substitution for compilation (AST → compiled AST)\n */\n\nimport { parser, lexer } from './expression-parser';\nimport { type ExpressionAST, type BinaryOperator } from './ast-types';\nimport { cstToAst } from './cst-visitor';\nimport { CompilationError, ErrorCode, type SourceLocation } from './errors';\nimport {\n  wrapWithDollarComparison,\n  createEqualityComparison,\n  createIntervalCheck,\n  createArrayMembershipCheck,\n  combineWithOr,\n  combineWithAnd,\n} from './unary-ast-transforms';\n\n/**\n * Parse an expression in unary mode (for decision table cells).\n *\n * In DMN/JDM convention, decision table cells contain concise expressions that implicitly\n * compare against the input column value ($). This allows table authors to write \"premium\"\n * instead of \"$ == 'premium'\" or \"> 100\" instead of \"$ > 100\", making tables more readable.\n *\n * Unary mode transformations:\n * - \"admin\"         -> $ == \"admin\"\n * - > 100           -> $ > 100\n * - [1..10]         -> $ in [1..10]\n * - \"a\", \"b\", \"c\"   -> $ == \"a\" or $ == \"b\" or $ == \"c\"\n * - $ > 100         -> $ > 100 (explicit $ disables transformations)\n *\n * @param input - The unary expression to parse\n * @returns The AST node\n */\nexport function parseUnaryExpression(input: string): ExpressionAST {\n  const trimmed = input.trim();\n\n  // Empty cell = always matches\n  if (trimmed === '' || trimmed === '-') {\n    return { type: 'BooleanLiteral', value: true };\n  }\n\n  // Check if expression uses explicit $ - if so, parse as standard expression\n  if (trimmed.includes('$')) {\n    return parseStandardExpression(trimmed);\n  }\n\n  // Check for comma-separated values (OR semantics)\n  // But only if it's not an array literal\n  if (trimmed.includes(',') && !isArrayLiteral(trimmed)) {\n    const parts = splitByComma(trimmed);\n    const comparisons = parts.map((part) => transformUnaryPart(part.trim()));\n    return combineWithOr(comparisons);\n  }\n\n  // Check for compound expressions with 'and' or 'or' that need implicit $ expansion\n  // e.g., \">= 13 and < 15\" should become \"$ >= 13 and $ < 15\"\n  const compoundResult = parseCompoundUnary(trimmed);\n  if (compoundResult) {\n    return compoundResult;\n  }\n\n  return transformUnaryPart(trimmed);\n}\n\n/**\n * Parse a single unary part and apply semantic transformations.\n *\n * This function performs both parsing and transformation in a single step:\n * 1. Parse the input using the standard expression parser\n * 2. Apply unary-context semantic transformations (AST operations)\n *\n * @param input - The unary part to parse\n * @returns The transformed AST node\n */\nfunction transformUnaryPart(input: string): ExpressionAST {\n  // Check for comparison operator at start\n  const comparisonMatch = input.match(/^(==|!=|<=|>=|<|>)\\s*(.+)$/);\n  if (comparisonMatch) {\n    const [, op, valueExpr] = comparisonMatch;\n    const value = parseStandardExpression(valueExpr);\n    // For equality/inequality comparisons, convert bare identifiers to strings\n    if (op === '==' || op === '!=') {\n      return createEqualityComparison(value, op as '==' | '!=');\n    }\n    return wrapWithDollarComparison(value, op as BinaryOperator);\n  }\n\n  // Check for interval notation\n  if (input.match(/^[[].+\\.\\..*[\\])]$/)) {\n    const intervalAst = parseStandardExpression(input);\n    return createIntervalCheck(intervalAst);\n  }\n\n  // Check for array literal - use 'in' for membership\n  // e.g., \"['gold', 'platinum']\" should become \"$ in ['gold', 'platinum']\"\n  if (isArrayLiteral(input)) {\n    const arrayAst = parseStandardExpression(input);\n    return createArrayMembershipCheck(arrayAst);\n  }\n\n  // Default: equality comparison\n  // Convert bare identifiers to string literals for implicit equality\n  const value = parseStandardExpression(input);\n  return createEqualityComparison(value, '==');\n}\n\n/**\n * Parse compound unary expressions that use 'and' or 'or' with implicit $\n * Examples:\n * - \">= 13 and < 15\" -> \"$ >= 13 and $ < 15\"\n * - \"> 0 or == null\" -> \"$ > 0 or $ == null\"\n *\n * @param input - The expression to parse\n * @returns The AST if compound, null otherwise\n */\nfunction parseCompoundUnary(input: string): ExpressionAST | null {\n  // Match patterns like: <op1> <val1> and/or <op2> <val2>\n  // We need to split by ' and ' or ' or ' while preserving quotes and brackets\n  const andParts = splitByLogicalOp(input, 'and');\n  if (andParts.length > 1) {\n    const comparisons = andParts.map((part) => transformUnaryPart(part.trim()));\n    return combineWithAnd(comparisons);\n  }\n\n  const orParts = splitByLogicalOp(input, 'or');\n  if (orParts.length > 1) {\n    const comparisons = orParts.map((part) => transformUnaryPart(part.trim()));\n    return combineWithOr(comparisons);\n  }\n\n  return null;\n}\n\n/**\n * Split input by a logical operator (' and ' or ' or '), respecting quotes and brackets.\n *\n * This is a parsing helper that performs tokenization while respecting nested structures.\n */\nfunction splitByLogicalOp(input: string, op: 'and' | 'or'): string[] {\n  const pattern = ` ${op} `;\n  const parts: string[] = [];\n  let current = '';\n  let depth = 0;\n  let inString = false;\n  let stringChar = '';\n  let i = 0;\n\n  while (i < input.length) {\n    const char = input[i];\n\n    if (inString) {\n      current += char;\n      if (char === stringChar && input[i - 1] !== '\\\\') {\n        inString = false;\n      }\n      i++;\n      continue;\n    }\n\n    if (char === '\"' || char === \"'\") {\n      inString = true;\n      stringChar = char;\n      current += char;\n      i++;\n    } else if (char === '[' || char === '(' || char === '{') {\n      depth++;\n      current += char;\n      i++;\n    } else if (char === ']' || char === ')' || char === '}') {\n      depth--;\n      current += char;\n      i++;\n    } else if (depth === 0 && input.substring(i, i + pattern.length).toLowerCase() === pattern) {\n      parts.push(current);\n      current = '';\n      i += pattern.length;\n    } else {\n      current += char;\n      i++;\n    }\n  }\n\n  if (current) {\n    parts.push(current);\n  }\n  return parts;\n}\n\n/**\n * Check if a string represents an array literal (not an interval).\n *\n * Arrays and intervals both use bracket syntax but have different semantics.\n * Arrays check membership ($ in [1,2,3]), intervals check ranges ($ in [1..10]).\n * Must detect .. to parse correctly.\n */\nfunction isArrayLiteral(input: string): boolean {\n  return input.startsWith('[') && input.endsWith(']') && !input.includes('..');\n}\n\n/**\n * Smart split by comma that respects brackets and strings.\n *\n * This is a parsing helper for tokenizing comma-separated unary values\n * while respecting nested structures.\n *\n * Examples:\n * - \"a, b, c\" -> [\"a\", \"b\", \"c\"]\n * - \"[1, 2], [3, 4]\" -> [\"[1, 2]\", \"[3, 4]\"]\n * - '\"a, b\", \"c, d\"' -> ['\"a, b\"', '\"c, d\"']\n */\nfunction splitByComma(input: string): string[] {\n  const parts: string[] = [];\n  let current = '';\n  let depth = 0;\n  let inString = false;\n  let stringChar = '';\n\n  for (let i = 0; i < input.length; i++) {\n    const char = input[i];\n\n    if (inString) {\n      current += char;\n      // Check if string ends (and handle escaped quotes)\n      if (char === stringChar && input[i - 1] !== '\\\\') {\n        inString = false;\n      }\n      continue;\n    }\n\n    if (char === '\"' || char === \"'\") {\n      inString = true;\n      stringChar = char;\n      current += char;\n    } else if (char === '[' || char === '(') {\n      depth++;\n      current += char;\n    } else if (char === ']' || char === ')') {\n      depth--;\n      current += char;\n    } else if (char === ',' && depth === 0) {\n      parts.push(current);\n      current = '';\n    } else {\n      current += char;\n    }\n  }\n\n  if (current) {\n    parts.push(current);\n  }\n  return parts;\n}\n\n/**\n * Parse a standard (non-unary) expression.\n *\n * This is the core parsing function that converts an expression string to an AST.\n * It uses the Chevrotain lexer and parser defined in expression-parser.ts,\n * then converts the CST to AST using cst-visitor.ts.\n *\n * @param input - The expression string to parse\n * @param location - Optional source location for error reporting\n * @returns The AST node\n */\nexport function parseStandardExpression(input: string, location?: SourceLocation): ExpressionAST {\n  const lexingResult = lexer.tokenize(input);\n\n  if (lexingResult.errors.length > 0) {\n    throw new CompilationError(\n      `Lexer error: ${lexingResult.errors.map((e: any) => e.message).join(', ')}`,\n      ErrorCode.PARSE_ERROR,\n      location,\n      { expression: input },\n    );\n  }\n\n  parser.input = lexingResult.tokens;\n  const cst = parser.expression();\n\n  if (parser.errors.length > 0) {\n    throw new CompilationError(\n      `Parse error: ${parser.errors.map((e: any) => e.message).join(', ')}`,\n      ErrorCode.PARSE_ERROR,\n      location,\n      { expression: input },\n    );\n  }\n\n  return cstToAst(cst);\n}\n","/**\n * Optimization Pipeline for JDM to WebAssembly Compilation\n *\n * This module defines the interface for optimization passes and the runner\n * that applies them sequentially to transform the compiled AST into an\n * optimized form before code generation.\n */\n\nimport { type JDMDecision, type JDMNode, NodeType } from './parser';\nimport {\n  type ExpressionAST,\n  type NumberLiteral,\n  type StringLiteral,\n  type BooleanLiteral,\n  isNumberLiteral,\n  isStringLiteral,\n  isBooleanLiteral,\n  isNullLiteral,\n  isBinaryOp,\n  isUnaryOp,\n  isTernaryOp,\n} from './ast-types';\nimport { parseStandardExpression, parseUnaryExpression } from './unary-parser';\n\n/**\n * Cache for parsed expression ASTs.\n * Maps expression strings to their parsed AST nodes to avoid redundant parsing.\n */\ntype ExpressionCache = Map<string, ExpressionAST>;\n\n/**\n * Compiled AST - the intermediate representation after parsing.\n *\n * JDMDecision structure is simple enough for in-place transformation, avoiding the\n * complexity and memory overhead of building a separate intermediate representation.\n */\nexport type CompiledAST = JDMDecision;\n\n/**\n * Interface for an optimization pass.\n *\n * Each optimization pass receives the compiled AST and returns a\n * potentially modified/optimized AST.\n */\nexport interface OptimizationPass {\n  /** Human-readable name of the optimization pass */\n  name: string;\n\n  /**\n   * Run the optimization pass on the given AST.\n   *\n   * @param ast - The compiled AST to optimize\n   * @returns The optimized AST\n   */\n  run(ast: CompiledAST): CompiledAST;\n}\n\n/**\n * Ordered list of optimization passes.\n *\n * Passes have dependencies - one pass may create opportunities for the next. For example,\n * constant folding might convert \"if (2 > 3)\" to \"if (false)\", then dead code elimination\n * removes the unreachable branch. Running DCE before folding would miss this optimization.\n */\nexport const optimizer: OptimizationPass[] = [\n  { name: 'Constant Folding', run: constantFolding },\n  { name: 'Dead Code Elimination', run: deadCodeElimination },\n  { name: 'Expression Inlining', run: expressionInlining },\n  { name: 'Table Indexing', run: tableIndexing },\n];\n\n/**\n * Run all optimization passes sequentially on the given AST.\n *\n * @param ast - The compiled AST to optimize\n * @returns The fully optimized AST\n */\nexport function runOptimizations(ast: CompiledAST): CompiledAST {\n  let optimized = ast;\n\n  for (const pass of optimizer) {\n    optimized = pass.run(optimized);\n  }\n\n  return optimized;\n}\n\n// ============================================================================\n// Expression Cache Utilities\n// ============================================================================\n\n/**\n * Get the expression cache for a node, creating it if it doesn't exist.\n */\nfunction getExpressionCache(node: JDMNode): ExpressionCache {\n  if (!node.parsedContent) {\n    node.parsedContent = {};\n  }\n  if (!node.parsedContent._cachedExprs) {\n    node.parsedContent._cachedExprs = new Map<string, ExpressionAST>();\n  }\n  return node.parsedContent._cachedExprs as ExpressionCache;\n}\n\n/**\n * Parse an expression with caching.\n * Checks the cache first, and only parses if not found.\n */\nfunction cachedParseUnary(node: JDMNode, expr: string): ExpressionAST {\n  const cache = getExpressionCache(node);\n  const cached = cache.get(expr);\n  if (cached) {\n    return cached;\n  }\n  const parsed = parseUnaryExpression(expr);\n  cache.set(expr, parsed);\n  return parsed;\n}\n\n/**\n * Parse a standard expression with caching.\n * Checks the cache first, and only parses if not found.\n */\nfunction cachedParseStandard(node: JDMNode, expr: string): ExpressionAST {\n  const cache = getExpressionCache(node);\n  const cached = cache.get(expr);\n  if (cached) {\n    return cached;\n  }\n  const parsed = parseStandardExpression(expr);\n  cache.set(expr, parsed);\n  return parsed;\n}\n\n/**\n * Clear the expression cache for a node.\n * Should be called when the node's expressions are modified.\n */\nfunction clearExpressionCache(node: JDMNode): void {\n  if (node.parsedContent && node.parsedContent._cachedExprs) {\n    node.parsedContent._cachedExprs.clear();\n  }\n}\n\n// Export individual optimization passes for testing\nexport { constantFolding, deadCodeElimination, expressionInlining, tableIndexing };\n\n// Export cache utilities for testing\nexport { getExpressionCache, clearExpressionCache };\n\n// ============================================================================\n// Constant Folding\n// ============================================================================\n\n/**\n * Fold constant expressions at compile time.\n *\n * This pass traverses expression ASTs and evaluates them at compile time\n * when possible. Examples:\n *   - Replace (2 + 3) with 5\n *   - Replace true and false with false\n *   - Replace \"hello\" + \" world\" with \"hello world\"\n *\n * @param ast - The compiled AST to optimize\n * @returns The AST with folded constants\n */\nfunction constantFolding(ast: CompiledAST): CompiledAST {\n  // Create a deep copy to avoid mutating the original\n  const optimized = JSON.parse(JSON.stringify(ast)) as JDMDecision;\n\n  // Apply constant folding to each node's expression content\n  optimized.nodes = optimized.nodes.map((node: JDMNode) => foldNodeExpressions(node));\n\n  return optimized;\n}\n\n/**\n * Apply constant folding to expressions within a node.\n */\nfunction foldNodeExpressions(node: JDMNode): JDMNode {\n  if (!node.content) {\n    return node;\n  }\n\n  const content = node.content;\n\n  // Handle decision table nodes\n  if (node.type === NodeType.DECISION_TABLE) {\n    return foldDecisionTableExpressions(node, content);\n  }\n\n  // Handle switch nodes\n  if (node.type === NodeType.SWITCH) {\n    return foldSwitchExpressions(node, content);\n  }\n\n  // Handle expression nodes\n  if (node.type === NodeType.EXPRESSION) {\n    return foldExpressionNode(node, content);\n  }\n\n  return node;\n}\n\n/**\n * Fold expressions in a decision table node.\n */\nfunction foldDecisionTableExpressions(node: JDMNode, content: Record<string, unknown>): JDMNode {\n  const { rules, inputs } = content as { rules: any[]; inputs: any[] };\n  let modified = false;\n\n  // Update each rule's input conditions with folded expressions\n  const foldedRules = rules.map((rule: Record<string, unknown>) => {\n    const foldedRule = { ...rule };\n\n    for (const input of inputs) {\n      const expr = rule[input.id] as string | undefined;\n      if (!expr || expr === '' || expr === '-') {\n        continue;\n      }\n\n      // Parse the expression in unary mode (using cache)\n      try {\n        const ast = cachedParseUnary(node, expr);\n        const folded = foldExpression(ast);\n\n        // If folding succeeded, update the expression string\n        if (folded !== null && isLiteral(folded)) {\n          const newExpr = literalToExprString(folded);\n          if (newExpr !== expr) {\n            foldedRule[input.id] = newExpr;\n            modified = true;\n          }\n        }\n      } catch {\n        // If expression can't be parsed or folded, keep original\n      }\n    }\n\n    return foldedRule;\n  });\n\n  // Clear cache if expressions were modified\n  if (modified) {\n    clearExpressionCache(node);\n  }\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      rules: foldedRules,\n    },\n  };\n}\n\n/**\n * Fold expressions in a switch node.\n */\nfunction foldSwitchExpressions(node: JDMNode, content: any): JDMNode {\n  const { conditions } = content;\n  let modified = false;\n\n  const foldedConditions = conditions.map((condition: any) => {\n    const expr = condition.expression;\n    if (!expr || expr === '') {\n      return condition;\n    }\n\n    try {\n      const ast = cachedParseStandard(node, expr);\n      const folded = foldExpression(ast);\n\n      if (folded !== null && isLiteral(folded)) {\n        const newExpr = literalToExprString(folded);\n        if (newExpr !== expr) {\n          modified = true;\n          return {\n            ...condition,\n            expression: newExpr,\n          };\n        }\n      }\n    } catch {\n      // If expression can't be parsed or folded, keep original\n    }\n\n    return condition;\n  });\n\n  // Clear cache if expressions were modified\n  if (modified) {\n    clearExpressionCache(node);\n  }\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      conditions: foldedConditions,\n    },\n  };\n}\n\n/**\n * Fold expressions in an expression node.\n */\nfunction foldExpressionNode(node: JDMNode, content: any): JDMNode {\n  const expr = content.expression;\n  if (!expr) {\n    return node;\n  }\n\n  try {\n    const ast = cachedParseStandard(node, expr);\n    const folded = foldExpression(ast);\n\n    if (folded !== null && isLiteral(folded)) {\n      const newExpr = literalToExprString(folded);\n      if (newExpr !== expr) {\n        // Clear cache since we're modifying the expression\n        clearExpressionCache(node);\n        return {\n          ...node,\n          content: {\n            ...content,\n            expression: newExpr,\n          },\n        };\n      }\n    }\n  } catch {\n    // If expression can't be parsed or folded, keep original\n  }\n\n  return node;\n}\n\n/**\n * Recursively fold an expression AST.\n * Returns the folded AST node, or null if folding is not possible.\n */\nfunction foldExpression(expr: ExpressionAST): ExpressionAST | null {\n  if (isLiteralExpr(expr)) {\n    return expr;\n  }\n\n  if (isBinaryOp(expr)) {\n    const leftFolded = foldExpression(expr.left);\n    const rightFolded = foldExpression(expr.right);\n\n    // If both sides are literals, try to evaluate at compilation time\n    if (leftFolded && rightFolded && isLiteral(leftFolded) && isLiteral(rightFolded)) {\n      const result = evaluateConstantBinaryOp(expr.op, leftFolded, rightFolded);\n      if (result !== null) {\n        return result;\n      }\n    }\n\n    return {\n      ...expr,\n      left: leftFolded || expr.left,\n      right: rightFolded || expr.right,\n    };\n  }\n\n  if (isUnaryOp(expr)) {\n    const operandFolded = foldExpression(expr.operand);\n\n    if (operandFolded && isLiteral(operandFolded)) {\n      const result = evaluateConstantUnaryOp(expr.op, operandFolded);\n      if (result !== null) {\n        return result;\n      }\n    }\n\n    return {\n      ...expr,\n      operand: operandFolded || expr.operand,\n    };\n  }\n\n  if (isTernaryOp(expr)) {\n    const conditionFolded = foldExpression(expr.condition);\n    const consequentFolded = foldExpression(expr.consequent);\n    const alternateFolded = foldExpression(expr.alternate);\n\n    if (conditionFolded && isLiteral(conditionFolded) && isBooleanLiteral(conditionFolded)) {\n      return conditionFolded.value\n        ? consequentFolded || expr.consequent\n        : alternateFolded || expr.alternate;\n    }\n\n    return {\n      ...expr,\n      condition: conditionFolded || expr.condition,\n      consequent: consequentFolded || expr.consequent,\n      alternate: alternateFolded || expr.alternate,\n    };\n  }\n\n  // Can't fold other expression types (identifiers, function calls, etc.)\n  return null;\n}\n\n/**\n * Check if an expression is a literal value.\n */\nfunction isLiteralExpr(expr: ExpressionAST): boolean {\n  return (\n    isNumberLiteral(expr) || isStringLiteral(expr) || isBooleanLiteral(expr) || isNullLiteral(expr)\n  );\n}\n\n/**\n * Check if a node is a literal.\n */\nfunction isLiteral(\n  node: ExpressionAST | null,\n): node is NumberLiteral | StringLiteral | BooleanLiteral {\n  return node !== null && isLiteralExpr(node);\n}\n\n/**\n * Evaluate a binary operation with constant operands.\n */\nfunction evaluateConstantBinaryOp(\n  op: string,\n  left: NumberLiteral | StringLiteral | BooleanLiteral,\n  right: NumberLiteral | StringLiteral | BooleanLiteral,\n): ExpressionAST | null {\n  // Numeric operations\n  if (isNumberLiteral(left) && isNumberLiteral(right)) {\n    switch (op) {\n      case '+':\n        return { type: 'NumberLiteral', value: left.value + right.value };\n      case '-':\n        return { type: 'NumberLiteral', value: left.value - right.value };\n      case '*':\n        return { type: 'NumberLiteral', value: left.value * right.value };\n      case '/':\n        return { type: 'NumberLiteral', value: left.value / right.value };\n      case '%':\n        return { type: 'NumberLiteral', value: left.value % right.value };\n      case '^':\n        return { type: 'NumberLiteral', value: Math.pow(left.value, right.value) };\n      case '<':\n        return { type: 'BooleanLiteral', value: left.value < right.value };\n      case '>':\n        return { type: 'BooleanLiteral', value: left.value > right.value };\n      case '<=':\n        return { type: 'BooleanLiteral', value: left.value <= right.value };\n      case '>=':\n        return { type: 'BooleanLiteral', value: left.value >= right.value };\n      case '==':\n        return { type: 'BooleanLiteral', value: left.value === right.value };\n      case '!=':\n        return { type: 'BooleanLiteral', value: left.value !== right.value };\n    }\n  }\n\n  // String operations\n  if (isStringLiteral(left) && isStringLiteral(right)) {\n    switch (op) {\n      case '+':\n        return { type: 'StringLiteral', value: left.value + right.value };\n      case '==':\n        return { type: 'BooleanLiteral', value: left.value === right.value };\n      case '!=':\n        return { type: 'BooleanLiteral', value: left.value !== right.value };\n    }\n  }\n\n  // Boolean operations\n  if (isBooleanLiteral(left) && isBooleanLiteral(right)) {\n    switch (op) {\n      case 'and':\n        return { type: 'BooleanLiteral', value: left.value && right.value };\n      case 'or':\n        return { type: 'BooleanLiteral', value: left.value || right.value };\n      case '==':\n        return { type: 'BooleanLiteral', value: left.value === right.value };\n      case '!=':\n        return { type: 'BooleanLiteral', value: left.value !== right.value };\n    }\n  }\n\n  return null;\n}\n\n/**\n * Evaluate a unary operation with a constant operand.\n */\nfunction evaluateConstantUnaryOp(\n  op: string,\n  operand: NumberLiteral | StringLiteral | BooleanLiteral,\n): ExpressionAST | null {\n  if (op === 'not' && isBooleanLiteral(operand)) {\n    return { type: 'BooleanLiteral', value: !operand.value };\n  }\n\n  if (op === '-' && isNumberLiteral(operand)) {\n    return { type: 'NumberLiteral', value: -operand.value };\n  }\n\n  return null;\n}\n\n/**\n * Convert a literal AST node to its string representation.\n */\nfunction literalToExprString(node: NumberLiteral | StringLiteral | BooleanLiteral): string {\n  switch (node.type) {\n    case 'NumberLiteral':\n      return String(node.value);\n    case 'StringLiteral':\n      return `\"${node.value}\"`;\n    case 'BooleanLiteral':\n      return String(node.value);\n  }\n}\n\n// ============================================================================\n// Dead Code Elimination\n// ============================================================================\n\n/**\n * Remove unreachable code.\n *\n * This pass identifies and removes branches that can never be reached.\n * Examples:\n *   - Remove if branches with constant false conditions\n *   - Remove decision table rows with always-false conditions\n *   - Remove decision table rows that can never match after previous rows\n *\n * @param ast - The compiled AST to optimize\n * @returns The AST with dead code removed\n */\nfunction deadCodeElimination(ast: CompiledAST): CompiledAST {\n  const optimized = JSON.parse(JSON.stringify(ast)) as JDMDecision;\n\n  optimized.nodes = optimized.nodes.map((node: JDMNode) => eliminateDeadCodeInNode(node));\n\n  return optimized;\n}\n\n/**\n * Apply dead code elimination to a node.\n */\nfunction eliminateDeadCodeInNode(node: JDMNode): JDMNode {\n  if (!node.content) {\n    return node;\n  }\n\n  const content = node.content;\n\n  if (node.type === NodeType.DECISION_TABLE) {\n    return eliminateDeadCodeInDecisionTable(node, content);\n  }\n\n  if (node.type === NodeType.SWITCH) {\n    return eliminateDeadCodeInSwitch(node, content);\n  }\n\n  return node;\n}\n\n/**\n * Check if a unary expression is always false.\n * In unary mode, \"false\" is equivalent to \"$ == false\".\n */\nfunction isUnaryAlwaysFalse(expr: ExpressionAST): boolean {\n  if (isBinaryOp(expr) && expr.op === '==') {\n    const leftIsDollar = expr.left.type === 'DollarRef';\n    const rightIsFalse = isBooleanLiteral(expr.right) && !expr.right.value;\n    return leftIsDollar && rightIsFalse;\n  }\n\n  if (isBinaryOp(expr) && expr.op === '!=') {\n    const leftIsDollar = expr.left.type === 'DollarRef';\n    const rightIsTrue = isBooleanLiteral(expr.right) && expr.right.value;\n    return leftIsDollar && rightIsTrue;\n  }\n\n  return false;\n}\n\n/**\n * Eliminate dead code in decision table nodes.\n */\nfunction eliminateDeadCodeInSwitch(node: JDMNode, content: any): JDMNode {\n  const { conditions } = content;\n\n  // Filter out conditions that are always false\n  const liveConditions = conditions.filter((condition: any) => {\n    const expr = condition.expression;\n    if (!expr || expr === '') {\n      return true;\n    }\n\n    try {\n      const parsed = cachedParseStandard(node, expr);\n\n      if (isBooleanLiteral(parsed) && !parsed.value) {\n        return false;\n      }\n    } catch {}\n\n    return true;\n  });\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      conditions: liveConditions,\n    },\n  };\n}\n\n/**\n * Eliminate dead code in decision table nodes.\n */\nfunction eliminateDeadCodeInDecisionTable(node: JDMNode, content: any): JDMNode {\n  const { rules, inputs } = content;\n\n  // Filter out rules that have a non-trivial always-false condition\n  const liveRules = rules.filter((rule: any) => {\n    for (const input of inputs) {\n      const expr = rule[input.id];\n      if (!expr || expr === '' || expr === '-') {\n        continue;\n      }\n\n      try {\n        const parsed = cachedParseUnary(node, expr);\n\n        // Check if this is a boolean literal (not common in unary mode, but possible)\n        if (isBooleanLiteral(parsed) && !parsed.value) {\n          return false;\n        }\n\n        // Check if this is a unary expression that's always false\n        // e.g., \"false\" in a decision table cell is interpreted as \"$ == false\"\n        if (isUnaryAlwaysFalse(parsed)) {\n          return false;\n        }\n      } catch {\n        // If we can't parse it, assume the rule is live\n      }\n    }\n\n    return true;\n  });\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      rules: liveRules,\n    },\n  };\n}\n\n// ============================================================================\n// Expression Inlining\n// ============================================================================\n\n/**\n * Inline small expressions.\n *\n * This pass replaces function calls with evaluated results for pure functions.\n * Examples:\n *   - Inline small arithmetic operations in decision table cells\n *   - Pre-evaluate expressions that don't depend on runtime values\n *\n * @param ast - The compiled AST to optimize\n * @returns The AST with inlined expressions\n */\nfunction expressionInlining(ast: CompiledAST): CompiledAST {\n  // Create a deep copy to avoid mutating the original\n  const optimized = JSON.parse(JSON.stringify(ast)) as JDMDecision;\n\n  // Only functions without side effects can be safely evaluated at compile time. Arithmetic\n  // (sum, max, min, abs, floor, ceil, round) and string functions (upper, lower, len) are\n  // pure and deterministic, so their results with constant inputs are predictable.\n  optimized.nodes = optimized.nodes.map((node: JDMNode) => inlineExpressionsInNode(node));\n\n  return optimized;\n}\n\n/**\n * Apply expression inlining to a node.\n */\nfunction inlineExpressionsInNode(node: JDMNode): JDMNode {\n  if (!node.content) {\n    return node;\n  }\n\n  const content = node.content;\n\n  // Handle decision table nodes\n  if (node.type === NodeType.DECISION_TABLE && content && content.rules && content.inputs) {\n    return inlineDecisionTableExpressions(node, content);\n  }\n\n  return node;\n}\n\n/**\n * Inline expressions in decision table nodes.\n */\nfunction inlineDecisionTableExpressions(node: JDMNode, content: any): JDMNode {\n  const { rules, inputs } = content;\n\n  const inlinedRules = rules.map((rule: any) => {\n    const inlinedRule = { ...rule };\n\n    for (const input of inputs) {\n      const expr = rule[input.id];\n      if (!expr || expr === '' || expr === '-') {\n        continue;\n      }\n\n      const inlined = tryInlineExpression(expr);\n      if (inlined !== expr) {\n        inlinedRule[input.id] = inlined;\n      }\n    }\n\n    return inlinedRule;\n  });\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      rules: inlinedRules,\n    },\n  };\n}\n\n/**\n * Try to inline an expression by evaluating simple pure function calls.\n * Returns the inlined expression string, or the original if inlining is not possible.\n */\nfunction tryInlineExpression(expr: string): string {\n  const trimmed = expr.trim();\n\n  // Inline simple arithmetic operations wrapped in function notation\n  // Examples: sum(2, 3) → 5, min(10, 5) → 5, abs(-5) → 5, upper(\"hello\") → \"HELLO\"\n\n  // Match sum(a, b, ...) pattern where all arguments are numeric literals\n  const sumMatch = trimmed.match(/^sum\\((.+)\\)$/i);\n  if (sumMatch) {\n    const args = sumMatch[1].split(',').map((s: string) => s.trim());\n    if (args.every((arg: string) => /^-?\\d+\\.?\\d*$/.test(arg))) {\n      const sum = args.reduce((acc: number, arg: string) => acc + parseFloat(arg), 0);\n      return String(sum);\n    }\n  }\n\n  // Match max(a, b) pattern where both arguments are numeric literals\n  const maxMatch = trimmed.match(/^max\\((.+),(.+)\\)$/i);\n  if (maxMatch) {\n    const [_, arg1, arg2] = maxMatch;\n    const num1 = parseFloat(arg1.trim());\n    const num2 = parseFloat(arg2.trim());\n    if (!isNaN(num1) && !isNaN(num2)) {\n      return String(Math.max(num1, num2));\n    }\n  }\n\n  // Match min(a, b) pattern where both arguments are numeric literals\n  const minMatch = trimmed.match(/^min\\((.+),(.+)\\)$/i);\n  if (minMatch) {\n    const [_, arg1, arg2] = minMatch;\n    const num1 = parseFloat(arg1.trim());\n    const num2 = parseFloat(arg2.trim());\n    if (!isNaN(num1) && !isNaN(num2)) {\n      return String(Math.min(num1, num2));\n    }\n  }\n\n  // Match abs(a) pattern where argument is a numeric literal\n  const absMatch = trimmed.match(/^abs\\((.+)\\)$/i);\n  if (absMatch) {\n    const val = parseFloat(absMatch[1].trim());\n    if (!isNaN(val)) {\n      return String(Math.abs(val));\n    }\n  }\n\n  // Match floor(a) pattern where argument is a numeric literal\n  const floorMatch = trimmed.match(/^floor\\((.+)\\)$/i);\n  if (floorMatch) {\n    const val = parseFloat(floorMatch[1].trim());\n    if (!isNaN(val)) {\n      return String(Math.floor(val));\n    }\n  }\n\n  // Match ceil(a) pattern where argument is a numeric literal\n  const ceilMatch = trimmed.match(/^ceil\\((.+)\\)$/i);\n  if (ceilMatch) {\n    const val = parseFloat(ceilMatch[1].trim());\n    if (!isNaN(val)) {\n      return String(Math.ceil(val));\n    }\n  }\n\n  // Match round(a) pattern where argument is a numeric literal\n  const roundMatch = trimmed.match(/^round\\((.+)\\)$/i);\n  if (roundMatch) {\n    const val = parseFloat(roundMatch[1].trim());\n    if (!isNaN(val)) {\n      return String(Math.round(val));\n    }\n  }\n\n  // Match upper(\"string\") pattern for constant string literals\n  const upperMatch = trimmed.match(/^upper\\(\"(.+)\"\\)$/i);\n  if (upperMatch) {\n    return `\"${upperMatch[1].toUpperCase()}\"`;\n  }\n\n  // Match lower(\"string\") pattern for constant string literals\n  const lowerMatch = trimmed.match(/^lower\\(\"(.+)\"\\)$/i);\n  if (lowerMatch) {\n    return `\"${lowerMatch[1].toLowerCase()}\"`;\n  }\n\n  // Match len(\"string\") pattern for constant string literals\n  const lenMatch = trimmed.match(/^len\\(\"(.*)\"\\)$/i);\n  if (lenMatch) {\n    return String(lenMatch[1].length);\n  }\n\n  // Match len(123) pattern for numeric literals (counting digits excluding sign)\n  const lenNumMatch = trimmed.match(/^len\\(-?\\d+\\.?\\d*\\)$/i);\n  if (lenNumMatch) {\n    const numStr = trimmed.match(/^len\\((.+)\\)$/i)![1].trim();\n    // Count digits ignoring sign and decimal point\n    const digitCount = numStr.replace(/^-/, '').replace('.', '').length;\n    return String(digitCount);\n  }\n\n  return expr;\n}\n\n// ============================================================================\n// Table Indexing\n// ============================================================================\n\n/**\n * Build index structures for efficient table lookup.\n *\n * This pass transforms linear search structures into more efficient alternatives.\n * Examples:\n *   - Convert decision table rows with equality checks to index-based lookup\n *   - Mark tables that are good candidates for switch statement generation\n *\n * Table indexing converts O(n) linear search to O(1) hash lookup when all rules check\n * equality on a single column with unique values - this is common in lookup tables\n * (e.g., pricing tiers by customer type) and can improve evaluation time by 10-100x\n * for large tables.\n *\n * @param ast - The compiled AST to optimize\n * @returns The AST with optimized table lookups\n */\nfunction tableIndexing(ast: CompiledAST): CompiledAST {\n  const optimized = JSON.parse(JSON.stringify(ast)) as JDMDecision;\n\n  optimized.nodes = optimized.nodes.map((node: JDMNode) => indexTableInNode(node));\n\n  return optimized;\n}\n\n/**\n * Apply table indexing to a node.\n */\nfunction indexTableInNode(node: JDMNode): JDMNode {\n  if (!node.content) {\n    return node;\n  }\n\n  const content = node.content;\n\n  if (node.type === NodeType.DECISION_TABLE) {\n    return indexDecisionTable(node, content);\n  }\n\n  return node;\n}\n\n/**\n * Index decision table for efficient lookup.\n *\n * This pass analyzes the decision table to identify patterns that can be\n * optimized, such as equality checks on a single column that could be\n * converted to a switch statement or hash map.\n */\nfunction indexDecisionTable(node: JDMNode, content: any): JDMNode {\n  const { rules, inputs } = content;\n\n  // Analyze each input column to find indexing opportunities\n  const indexedInputs = inputs.map((input: any) => {\n    const inputValues = rules.map((rule: any) => {\n      const expr = rule[input.id];\n      if (!expr || expr === '' || expr === '-') {\n        return null;\n      }\n      return expr.trim();\n    });\n\n    // Check if this column is a good candidate for indexing:\n    // - All values are string or number literals\n    // - No intervals or complex expressions\n    // - No duplicate values\n    const allLiterals = inputValues.every((val: string | null) => {\n      if (!val) {\n        return true;\n      }\n      return /^([\"'])(?:(?=(\\\\?))\\2.)*?\\1$|^-?\\d+\\.?\\d*$/.test(val);\n    });\n\n    const uniqueValues = new Set(inputValues.filter((v: string | null) => v !== null));\n    const hasDuplicates =\n      uniqueValues.size < inputValues.filter((v: string | null) => v !== null).length;\n\n    return {\n      ...input,\n      // Hash-based lookup becomes beneficial with ~10+ unique values, but overhead matters\n      // for small tables. 50 is a practical limit where indexing provides clear wins without\n      // excessive memory for the lookup structure.\n      _indexable: allLiterals && !hasDuplicates && uniqueValues.size > 0 && uniqueValues.size < 50,\n      _uniqueValues: Array.from(uniqueValues),\n    };\n  });\n\n  return {\n    ...node,\n    content: {\n      ...content,\n      inputs: indexedInputs,\n    },\n  };\n}\n","/**\n * Runtime validation code generation for decision models.\n *\n * This module provides functions that generate or perform validation code\n * that executes at runtime. These functions validate actual data against\n * schemas when the decision is evaluated.\n *\n * For compile-time static analysis (checking references exist, etc.),\n * see compile-time-validation.ts.\n */\n\nimport type { FlattenedLayout } from './types';\n\n/**\n * Validation error containing field path, expected type, and actual value.\n */\nexport interface ValidationError {\n  /** The field path (e.g., \"customer.age\") */\n  path: string;\n  /** Error message describing the issue */\n  message: string;\n  /** The expected type */\n  expected?: string;\n  /** The actual value that failed validation */\n  actual?: unknown;\n}\n\n/**\n * Result of runtime validation.\n */\nexport interface ValidationResult {\n  /** Whether validation passed */\n  valid: boolean;\n  /** Array of validation errors (empty if valid) */\n  errors: ValidationError[];\n}\n\n/**\n * Validate runtime input data against the input schema.\n *\n * This function checks that all required input fields from the schema\n * are present in the provided input data AND that they have correct types.\n * It returns a list of validation errors including missing fields and\n * type mismatches.\n *\n * Security note: This validation prevents malformed input with wrong types\n * (string instead of number, object instead of array) from being marshaled\n * to WASM, which could cause runtime errors or unexpected behavior.\n *\n * @param inputData - Runtime input data as a JavaScript object\n * @param inputLayout - Flattened layout from the input schema\n * @returns Array of missing/invalid input field paths (empty if all valid)\n */\nexport function validateRuntimeInputs(\n  inputData: Record<string, any>,\n  inputLayout: FlattenedLayout,\n): string[] {\n  const result = validateRuntimeInputsDetailed(inputData, inputLayout);\n  // Return just the paths for backwards compatibility\n  return result.errors.map((e) => e.path);\n}\n\n/**\n * Validate runtime input data with detailed error information.\n *\n * This function performs comprehensive validation including:\n * - Presence checking: All required fields must be present\n * - Type checking: Values must match expected types\n * - Range checking: Numbers must be finite (not NaN/Infinity unless intended)\n *\n * @param inputData - Runtime input data as a JavaScript object\n * @param inputLayout - Flattened layout from the input schema\n * @returns Detailed validation result with errors\n */\nexport function validateRuntimeInputsDetailed(\n  inputData: Record<string, any>,\n  inputLayout: FlattenedLayout,\n): ValidationResult {\n  const errors: ValidationError[] = [];\n\n  for (const field of inputLayout.fields) {\n    const path = field.path;\n    const parts = path.split('.');\n\n    let current: any = inputData;\n    let exists = true;\n\n    // Navigate to the nested value\n    for (const part of parts) {\n      if (current === null || current === undefined || current[part] === undefined) {\n        exists = false;\n        break;\n      }\n      current = current[part];\n    }\n\n    if (!exists) {\n      errors.push({\n        path,\n        message: 'Required field is missing',\n        expected: field.type,\n        actual: undefined,\n      });\n      continue;\n    }\n\n    // Now check type\n    const typeError = validateFieldType(current, field.type, path);\n    if (typeError) {\n      errors.push(typeError);\n    }\n  }\n\n  return {\n    valid: errors.length === 0,\n    errors,\n  };\n}\n\n/**\n * Validate that a value matches the expected field type.\n *\n * @param value - The actual value to validate\n * @param expectedType - The expected type from the schema\n * @param path - The field path for error reporting\n * @returns ValidationError if type mismatch, null if valid\n */\nfunction validateFieldType(\n  value: unknown,\n  expectedType: 'f64' | 'i32' | 'i64' | 'bool' | 'string' | 'array',\n  path: string,\n): ValidationError | null {\n  const actualType = typeof value;\n\n  switch (expectedType) {\n    case 'f64':\n    case 'i32':\n    case 'i64': {\n      // Check for number type\n      if (actualType !== 'number' && actualType !== 'bigint') {\n        return {\n          path,\n          message: `Expected ${expectedType} (number), got ${actualType}`,\n          expected: expectedType,\n          actual: value,\n        };\n      }\n\n      // For number types, also check for NaN\n      if (actualType === 'number' && Number.isNaN(value)) {\n        return {\n          path,\n          message: `Invalid number: NaN is not allowed`,\n          expected: expectedType,\n          actual: value,\n        };\n      }\n\n      // For integer types, check that the value is actually an integer\n      if (expectedType === 'i32' || expectedType === 'i64') {\n        if (actualType === 'number' && !Number.isInteger(value)) {\n          return {\n            path,\n            message: `Expected integer, got floating-point number`,\n            expected: expectedType,\n            actual: value,\n          };\n        }\n      }\n      break;\n    }\n\n    case 'bool': {\n      if (actualType !== 'boolean') {\n        return {\n          path,\n          message: `Expected boolean, got ${actualType}`,\n          expected: 'boolean',\n          actual: value,\n        };\n      }\n      break;\n    }\n\n    case 'string': {\n      if (actualType !== 'string') {\n        return {\n          path,\n          message: `Expected string, got ${actualType}`,\n          expected: 'string',\n          actual: value,\n        };\n      }\n      break;\n    }\n\n    case 'array': {\n      if (!Array.isArray(value)) {\n        return {\n          path,\n          message: `Expected array, got ${actualType}`,\n          expected: 'array',\n          actual: value,\n        };\n      }\n      break;\n    }\n\n    default: {\n      // Unknown type - this shouldn't happen with a valid schema\n      // but we'll accept any value for forward compatibility\n      break;\n    }\n  }\n\n  return null;\n}\n\n/**\n * Validate runtime output data against the output schema.\n *\n * This function checks that all required output fields from the schema\n * are present in the provided output data AND that they have correct types.\n * It returns a list of validation errors including missing fields and\n * type mismatches.\n *\n * @param outputData - Runtime output data as a JavaScript object\n * @param outputLayout - Flattened layout from the output schema\n * @returns Array of missing/invalid output field paths (empty if all valid)\n */\nexport function validateRuntimeOutputs(\n  outputData: Record<string, any>,\n  outputLayout: FlattenedLayout,\n): string[] {\n  const result = validateRuntimeOutputsDetailed(outputData, outputLayout);\n  return result.errors.map((e) => e.path);\n}\n\n/**\n * Validate runtime output data with detailed error information.\n *\n * This function performs comprehensive validation including:\n * - Presence checking: All required output fields must be present\n * - Type checking: Values must match expected types\n *\n * @param outputData - Runtime output data as a JavaScript object\n * @param outputLayout - Flattened layout from the output schema\n * @returns Detailed validation result with errors\n */\nexport function validateRuntimeOutputsDetailed(\n  outputData: Record<string, any>,\n  outputLayout: FlattenedLayout,\n): ValidationResult {\n  const errors: ValidationError[] = [];\n\n  for (const field of outputLayout.fields) {\n    const path = field.path;\n    const parts = path.split('.');\n\n    // Allows objects to be built incrementally (e.g., output.customer.name and\n    // output.customer.age) instead of requiring the entire object at once.\n    let current: any = outputData;\n    let exists = true;\n\n    for (const part of parts) {\n      if (current === null || current === undefined || current[part] === undefined) {\n        exists = false;\n        break;\n      }\n      current = current[part];\n    }\n\n    if (!exists) {\n      errors.push({\n        path,\n        message: 'Required output field is missing',\n        expected: field.type,\n        actual: undefined,\n      });\n      continue;\n    }\n\n    // Now check type\n    const typeError = validateFieldType(current, field.type, path);\n    if (typeError) {\n      errors.push(typeError);\n    }\n  }\n\n  return {\n    valid: errors.length === 0,\n    errors,\n  };\n}\n"],"mappings":";AAkCO,IAAK,YAAL,kBAAKA,eAAL;AAEL,EAAAA,WAAA,kBAAe;AACf,EAAAA,WAAA,4BAAyB;AACzB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,oBAAiB;AACjB,EAAAA,WAAA,kBAAe;AAGf,EAAAA,WAAA,+BAA4B;AAC5B,EAAAA,WAAA,4BAAyB;AAGzB,EAAAA,WAAA,iBAAc;AACd,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,mBAAgB;AAChB,EAAAA,WAAA,mBAAgB;AAGhB,EAAAA,WAAA,qBAAkB;AAClB,EAAAA,WAAA,oBAAiB;AAtBP,SAAAA;AAAA,GAAA;AA+BL,IAAM,mBAAN,MAAM,0BAAyB,MAAM;AAAA,EAG1C,YACE,SACgB,MACA,UACA,SAChB;AACA,UAAM,OAAO;AAJG;AACA;AACA;AAOhB,QAAI,MAAM,mBAAmB;AAC3B,YAAM,kBAAkB,MAAM,iBAAgB;AAAA,IAChD;AAAA,EACF;AAAA,EAhBS,OAAO;AAAA;AAAA;AAAA;AAAA,EAqBhB,sBAA8B;AAC5B,UAAM,QAAkB,CAAC;AAEzB,QAAI,KAAK,UAAU;AACjB,YAAM,WAAqB,CAAC;AAC5B,UAAI,KAAK,SAAS,UAAU;AAC1B,iBAAS,KAAK,KAAK,SAAS,QAAQ;AAAA,MACtC;AACA,UAAI,KAAK,SAAS,QAAQ;AACxB,iBAAS,KAAK,QAAQ,KAAK,SAAS,MAAM,GAAG;AAAA,MAC/C;AACA,UAAI,KAAK,SAAS,OAAO;AACvB,iBAAS,KAAK,IAAI,KAAK,SAAS,KAAK,EAAE;AAAA,MACzC;AAEA,UAAI,KAAK,SAAS,SAAS,UAAa,KAAK,SAAS,WAAW,QAAW;AAC1E,iBAAS,KAAK,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,MAAM,EAAE;AAAA,MAChE,WAAW,KAAK,SAAS,SAAS,QAAW;AAC3C,iBAAS,KAAK,IAAI,KAAK,SAAS,IAAI,EAAE;AAAA,MACxC,WAAW,KAAK,SAAS,WAAW,QAAW;AAC7C,iBAAS,KAAK,IAAI,KAAK,SAAS,MAAM,EAAE;AAAA,MAC1C;AAEA,UAAI,SAAS,SAAS,GAAG;AACvB,cAAM,KAAK,IAAI,SAAS,KAAK,GAAG,CAAC,GAAG;AAAA,MACtC;AAAA,IACF;AAEA,UAAM,KAAK,IAAI,KAAK,IAAI,GAAG;AAC3B,UAAM,KAAK,KAAK,OAAO;AAEvB,WAAO,MAAM,KAAK,GAAG;AAAA,EACvB;AACF;AAeO,IAAM,iBAAN,MAAqB;AAAA,EAClB,SAA6B,CAAC;AAAA;AAAA;AAAA;AAAA,EAKtC,IAAI,OAA+B;AACjC,SAAK,OAAO,KAAK,KAAK;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,YAAqB;AACnB,WAAO,KAAK,OAAO,SAAS;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,gBAAsB;AACpB,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B;AAAA,IACF;AAEA,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B,YAAM,KAAK,OAAO,CAAC;AAAA,IACrB;AAEA,UAAM,UACJ,GAAG,KAAK,OAAO,MAAM;AAAA,IACrB,KAAK,OACF,IAAI,CAAC,GAAG,MAAM;AACb,YAAM,SAAS,KAAK,IAAI,CAAC,KAAK,EAAE,IAAI;AACpC,YAAM,YAAY,EAAE,oBAAoB;AAGxC,YAAM,OAAO,UAAU,QAAQ,IAAI,EAAE,IAAI,KAAK,EAAE,EAAE,KAAK;AACvD,aAAO,GAAG,MAAM,GAAG,OAAO,OAAO,OAAO,EAAE;AAAA,IAC5C,CAAC,EACA,KAAK,IAAI;AAGd,UAAM,qBAAqB,KAAK,OAAO,CAAC,EAAE;AAC1C,UAAM,IAAI,iBAAiB,SAAS,iCAAuB,kBAAkB;AAAA,EAC/E;AACF;AAKO,SAAS,mBAAmB,OAA2C;AAC5E,SAAO,iBAAiB;AAC1B;AAKO,SAAS,kBAAkB,MAA0B;AAC1D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,SAAS,IAAI;AACjB;AAKO,SAAS,eAAe,MAA0B;AACvD,SAAO,CAAC,6DAAqC,qDAAgC,EAAE,SAAS,IAAI;AAC9F;AAKO,SAAS,kBAAkB,MAA0B;AAC1D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,SAAS,IAAI;AACjB;;;ACjOA,IAAI,wBAAwB,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,MAAM,GAAG,GAAG,IAAI,OAAO,IAAI,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,KAAK,IAAI,GAAG,IAAI,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,KAAK,GAAG,GAAG,GAAG,KAAK,GAAG,KAAK,GAAG,GAAG,GAAG,MAAM,GAAG,QAAQ,GAAG;AAGzoC,IAAI,6BAA6B,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,GAAG,KAAK,MAAM,IAAI,MAAM,KAAK,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,MAAM,GAAG,MAAM,IAAI,GAAG,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,KAAK,MAAM,KAAK,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,GAAG,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,GAAG,MAAM,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,MAAM,OAAO,IAAI,MAAM,GAAG,KAAK,GAAG,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM,KAAK,MAAM,MAAM,GAAG,IAAI;AAGnpE,IAAI,0BAA0B;AAG9B,IAAI,+BAA+B;AASnC,IAAI,gBAAgB;AAAA,EAClB,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,QAAQ;AAAA,EACR,YAAY;AACd;AAIA,IAAI,uBAAuB;AAE3B,IAAI,aAAa;AAAA,EACf,GAAG;AAAA,EACH,WAAW,uBAAuB;AAAA,EAClC,GAAG,uBAAuB;AAC5B;AAEA,IAAI,4BAA4B;AAIhC,IAAI,0BAA0B,IAAI,OAAO,MAAM,+BAA+B,GAAG;AACjF,IAAI,qBAAqB,IAAI,OAAO,MAAM,+BAA+B,0BAA0B,GAAG;AAKtG,SAAS,cAAc,MAAM,KAAK;AAChC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AACtC,WAAO,IAAI,CAAC;AACZ,QAAI,MAAM,MAAM;AAAE,aAAO;AAAA,IAAM;AAC/B,WAAO,IAAI,IAAI,CAAC;AAChB,QAAI,OAAO,MAAM;AAAE,aAAO;AAAA,IAAK;AAAA,EACjC;AACA,SAAO;AACT;AAIA,SAAS,kBAAkB,MAAM,QAAQ;AACvC,MAAI,OAAO,IAAI;AAAE,WAAO,SAAS;AAAA,EAAG;AACpC,MAAI,OAAO,IAAI;AAAE,WAAO;AAAA,EAAK;AAC7B,MAAI,OAAO,IAAI;AAAE,WAAO,SAAS;AAAA,EAAG;AACpC,MAAI,OAAO,KAAK;AAAE,WAAO;AAAA,EAAK;AAC9B,MAAI,QAAQ,OAAQ;AAAE,WAAO,QAAQ,OAAQ,wBAAwB,KAAK,OAAO,aAAa,IAAI,CAAC;AAAA,EAAE;AACrG,MAAI,WAAW,OAAO;AAAE,WAAO;AAAA,EAAM;AACrC,SAAO,cAAc,MAAM,0BAA0B;AACvD;AAIA,SAAS,iBAAiB,MAAM,QAAQ;AACtC,MAAI,OAAO,IAAI;AAAE,WAAO,SAAS;AAAA,EAAG;AACpC,MAAI,OAAO,IAAI;AAAE,WAAO;AAAA,EAAK;AAC7B,MAAI,OAAO,IAAI;AAAE,WAAO;AAAA,EAAM;AAC9B,MAAI,OAAO,IAAI;AAAE,WAAO;AAAA,EAAK;AAC7B,MAAI,OAAO,IAAI;AAAE,WAAO,SAAS;AAAA,EAAG;AACpC,MAAI,OAAO,KAAK;AAAE,WAAO;AAAA,EAAK;AAC9B,MAAI,QAAQ,OAAQ;AAAE,WAAO,QAAQ,OAAQ,mBAAmB,KAAK,OAAO,aAAa,IAAI,CAAC;AAAA,EAAE;AAChG,MAAI,WAAW,OAAO;AAAE,WAAO;AAAA,EAAM;AACrC,SAAO,cAAc,MAAM,0BAA0B,KAAK,cAAc,MAAM,qBAAqB;AACrG;AAyBA,IAAI,YAAY,SAASC,WAAU,OAAO,MAAM;AAC9C,MAAK,SAAS,OAAS,QAAO,CAAC;AAE/B,OAAK,QAAQ;AACb,OAAK,UAAU,KAAK;AACpB,OAAK,aAAa,CAAC,CAAC,KAAK;AACzB,OAAK,aAAa,CAAC,CAAC,KAAK;AACzB,OAAK,SAAS,CAAC,CAAC,KAAK;AACrB,OAAK,WAAW,CAAC,CAAC,KAAK;AACvB,OAAK,SAAS,CAAC,CAAC,KAAK;AACrB,OAAK,UAAU,CAAC,CAAC,KAAK;AACtB,OAAK,QAAQ,KAAK,SAAS;AAC3B,OAAK,gBAAgB;AACvB;AAEA,SAAS,MAAM,MAAM,MAAM;AACzB,SAAO,IAAI,UAAU,MAAM,EAAC,YAAY,MAAM,OAAO,KAAI,CAAC;AAC5D;AACA,IAAI,aAAa,EAAC,YAAY,KAAI;AAAlC,IAAqC,aAAa,EAAC,YAAY,KAAI;AAInE,IAAI,WAAW,CAAC;AAGhB,SAAS,GAAG,MAAM,SAAS;AACzB,MAAK,YAAY,OAAS,WAAU,CAAC;AAErC,UAAQ,UAAU;AAClB,SAAO,SAAS,IAAI,IAAI,IAAI,UAAU,MAAM,OAAO;AACrD;AAEA,IAAI,UAAU;AAAA,EACZ,KAAK,IAAI,UAAU,OAAO,UAAU;AAAA,EACpC,QAAQ,IAAI,UAAU,UAAU,UAAU;AAAA,EAC1C,QAAQ,IAAI,UAAU,UAAU,UAAU;AAAA,EAC1C,MAAM,IAAI,UAAU,QAAQ,UAAU;AAAA,EACtC,WAAW,IAAI,UAAU,aAAa,UAAU;AAAA,EAChD,KAAK,IAAI,UAAU,KAAK;AAAA;AAAA,EAGxB,UAAU,IAAI,UAAU,KAAK,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA,EACjE,UAAU,IAAI,UAAU,GAAG;AAAA,EAC3B,QAAQ,IAAI,UAAU,KAAK,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA,EAC/D,QAAQ,IAAI,UAAU,GAAG;AAAA,EACzB,QAAQ,IAAI,UAAU,KAAK,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA,EAC/D,QAAQ,IAAI,UAAU,GAAG;AAAA,EACzB,OAAO,IAAI,UAAU,KAAK,UAAU;AAAA,EACpC,MAAM,IAAI,UAAU,KAAK,UAAU;AAAA,EACnC,OAAO,IAAI,UAAU,KAAK,UAAU;AAAA,EACpC,KAAK,IAAI,UAAU,GAAG;AAAA,EACtB,UAAU,IAAI,UAAU,KAAK,UAAU;AAAA,EACvC,aAAa,IAAI,UAAU,IAAI;AAAA,EAC/B,OAAO,IAAI,UAAU,MAAM,UAAU;AAAA,EACrC,UAAU,IAAI,UAAU,UAAU;AAAA,EAClC,iBAAiB,IAAI,UAAU,iBAAiB;AAAA,EAChD,UAAU,IAAI,UAAU,OAAO,UAAU;AAAA,EACzC,WAAW,IAAI,UAAU,KAAK,UAAU;AAAA,EACxC,cAAc,IAAI,UAAU,MAAM,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBtE,IAAI,IAAI,UAAU,KAAK,EAAC,YAAY,MAAM,UAAU,KAAI,CAAC;AAAA,EACzD,QAAQ,IAAI,UAAU,MAAM,EAAC,YAAY,MAAM,UAAU,KAAI,CAAC;AAAA,EAC9D,QAAQ,IAAI,UAAU,SAAS,EAAC,QAAQ,MAAM,SAAS,MAAM,YAAY,KAAI,CAAC;AAAA,EAC9E,QAAQ,IAAI,UAAU,OAAO,EAAC,YAAY,MAAM,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EAC/E,WAAW,MAAM,MAAM,CAAC;AAAA,EACxB,YAAY,MAAM,MAAM,CAAC;AAAA,EACzB,WAAW,MAAM,KAAK,CAAC;AAAA,EACvB,YAAY,MAAM,KAAK,CAAC;AAAA,EACxB,YAAY,MAAM,KAAK,CAAC;AAAA,EACxB,UAAU,MAAM,iBAAiB,CAAC;AAAA,EAClC,YAAY,MAAM,aAAa,CAAC;AAAA,EAChC,UAAU,MAAM,aAAa,CAAC;AAAA,EAC9B,SAAS,IAAI,UAAU,OAAO,EAAC,YAAY,MAAM,OAAO,GAAG,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EAC1F,QAAQ,MAAM,KAAK,EAAE;AAAA,EACrB,MAAM,MAAM,KAAK,EAAE;AAAA,EACnB,OAAO,MAAM,KAAK,EAAE;AAAA,EACpB,UAAU,IAAI,UAAU,MAAM,EAAC,YAAY,KAAI,CAAC;AAAA,EAChD,UAAU,MAAM,MAAM,CAAC;AAAA;AAAA,EAGvB,QAAQ,GAAG,OAAO;AAAA,EAClB,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,QAAQ,GAAG,OAAO;AAAA,EAClB,WAAW,GAAG,UAAU;AAAA,EACxB,WAAW,GAAG,UAAU;AAAA,EACxB,UAAU,GAAG,WAAW,UAAU;AAAA,EAClC,KAAK,GAAG,MAAM,EAAC,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EAC9C,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,UAAU,GAAG,SAAS;AAAA,EACtB,MAAM,GAAG,OAAO,EAAC,QAAQ,KAAI,CAAC;AAAA,EAC9B,WAAW,GAAG,YAAY,UAAU;AAAA,EACpC,KAAK,GAAG,IAAI;AAAA,EACZ,SAAS,GAAG,UAAU,UAAU;AAAA,EAChC,SAAS,GAAG,QAAQ;AAAA,EACpB,QAAQ,GAAG,SAAS,UAAU;AAAA,EAC9B,MAAM,GAAG,KAAK;AAAA,EACd,MAAM,GAAG,KAAK;AAAA,EACd,QAAQ,GAAG,OAAO;AAAA,EAClB,QAAQ,GAAG,SAAS,EAAC,QAAQ,KAAI,CAAC;AAAA,EAClC,OAAO,GAAG,MAAM;AAAA,EAChB,MAAM,GAAG,OAAO,EAAC,YAAY,MAAM,YAAY,KAAI,CAAC;AAAA,EACpD,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,QAAQ,GAAG,SAAS,UAAU;AAAA,EAC9B,QAAQ,GAAG,SAAS,UAAU;AAAA,EAC9B,UAAU,GAAG,WAAW,UAAU;AAAA,EAClC,SAAS,GAAG,QAAQ;AAAA,EACpB,SAAS,GAAG,UAAU,UAAU;AAAA,EAChC,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,OAAO,GAAG,QAAQ,UAAU;AAAA,EAC5B,QAAQ,GAAG,SAAS,UAAU;AAAA,EAC9B,KAAK,GAAG,MAAM,EAAC,YAAY,MAAM,OAAO,EAAC,CAAC;AAAA,EAC1C,aAAa,GAAG,cAAc,EAAC,YAAY,MAAM,OAAO,EAAC,CAAC;AAAA,EAC1D,SAAS,GAAG,UAAU,EAAC,YAAY,MAAM,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EACxE,OAAO,GAAG,QAAQ,EAAC,YAAY,MAAM,QAAQ,MAAM,YAAY,KAAI,CAAC;AAAA,EACpE,SAAS,GAAG,UAAU,EAAC,YAAY,MAAM,QAAQ,MAAM,YAAY,KAAI,CAAC;AAC1E;AAKA,IAAI,YAAY;AAChB,IAAI,aAAa,IAAI,OAAO,UAAU,QAAQ,GAAG;AAEjD,SAAS,UAAU,MAAM;AACvB,SAAO,SAAS,MAAM,SAAS,MAAM,SAAS,QAAU,SAAS;AACnE;AAEA,SAAS,cAAc,MAAM,MAAM,KAAK;AACtC,MAAK,QAAQ,OAAS,OAAM,KAAK;AAEjC,WAAS,IAAI,MAAM,IAAI,KAAK,KAAK;AAC/B,QAAI,OAAO,KAAK,WAAW,CAAC;AAC5B,QAAI,UAAU,IAAI,GAChB;AAAE,aAAO,IAAI,MAAM,KAAK,SAAS,MAAM,KAAK,WAAW,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI;AAAA,IAAE;AAAA,EACzF;AACA,SAAO;AACT;AAEA,IAAI,qBAAqB;AAEzB,IAAI,iBAAiB;AAErB,IAAI,MAAM,OAAO;AACjB,IAAI,iBAAiB,IAAI;AACzB,IAAI,WAAW,IAAI;AAEnB,IAAI,SAAS,OAAO,WAAW,SAAU,KAAK,UAAU;AAAE,SACxD,eAAe,KAAK,KAAK,QAAQ;AAChC;AAEH,IAAI,UAAU,MAAM,YAAY,SAAU,KAAK;AAAE,SAC/C,SAAS,KAAK,GAAG,MAAM;AACtB;AAEH,IAAI,cAAc,uBAAO,OAAO,IAAI;AAEpC,SAAS,YAAY,OAAO;AAC1B,SAAO,YAAY,KAAK,MAAM,YAAY,KAAK,IAAI,IAAI,OAAO,SAAS,MAAM,QAAQ,MAAM,GAAG,IAAI,IAAI;AACxG;AAEA,SAAS,kBAAkB,MAAM;AAE/B,MAAI,QAAQ,OAAQ;AAAE,WAAO,OAAO,aAAa,IAAI;AAAA,EAAE;AACvD,UAAQ;AACR,SAAO,OAAO,cAAc,QAAQ,MAAM,QAAS,OAAO,QAAQ,KAAM;AAC1E;AAEA,IAAI,gBAAgB;AAKpB,IAAI,WAAW,SAASC,UAAS,MAAM,KAAK;AAC1C,OAAK,OAAO;AACZ,OAAK,SAAS;AAChB;AAEA,SAAS,UAAU,SAAS,SAAS,OAAQ,GAAG;AAC9C,SAAO,IAAI,SAAS,KAAK,MAAM,KAAK,SAAS,CAAC;AAChD;AAEA,IAAI,iBAAiB,SAASC,gBAAe,GAAG,OAAO,KAAK;AAC1D,OAAK,QAAQ;AACb,OAAK,MAAM;AACX,MAAI,EAAE,eAAe,MAAM;AAAE,SAAK,SAAS,EAAE;AAAA,EAAY;AAC3D;AAQA,SAAS,YAAY,OAAOC,SAAQ;AAClC,WAAS,OAAO,GAAG,MAAM,OAAK;AAC5B,QAAI,YAAY,cAAc,OAAO,KAAKA,OAAM;AAChD,QAAI,YAAY,GAAG;AAAE,aAAO,IAAI,SAAS,MAAMA,UAAS,GAAG;AAAA,IAAE;AAC7D,MAAE;AACF,UAAM;AAAA,EACR;AACF;AAKA,IAAI,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOnB,aAAa;AAAA;AAAA;AAAA;AAAA,EAIb,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMZ,qBAAqB;AAAA;AAAA;AAAA,EAGrB,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKjB,eAAe;AAAA;AAAA;AAAA,EAGf,4BAA4B;AAAA;AAAA;AAAA;AAAA,EAI5B,6BAA6B;AAAA;AAAA;AAAA;AAAA,EAI7B,2BAA2B;AAAA;AAAA;AAAA,EAG3B,yBAAyB;AAAA;AAAA;AAAA;AAAA,EAIzB,eAAe;AAAA;AAAA;AAAA;AAAA,EAIf,oBAAoB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKpB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMX,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaT,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASX,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMR,SAAS;AAAA;AAAA;AAAA,EAGT,YAAY;AAAA;AAAA;AAAA,EAGZ,kBAAkB;AAAA;AAAA;AAAA,EAGlB,gBAAgB;AAClB;AAIA,IAAI,yBAAyB;AAE7B,SAAS,WAAW,MAAM;AACxB,MAAI,UAAU,CAAC;AAEf,WAAS,OAAO,gBACd;AAAE,YAAQ,GAAG,IAAI,QAAQ,OAAO,MAAM,GAAG,IAAI,KAAK,GAAG,IAAI,eAAe,GAAG;AAAA,EAAG;AAEhF,MAAI,QAAQ,gBAAgB,UAAU;AACpC,YAAQ,cAAc;AAAA,EACxB,WAAW,QAAQ,eAAe,MAAM;AACtC,QAAI,CAAC,0BAA0B,OAAO,YAAY,YAAY,QAAQ,MAAM;AAC1E,+BAAyB;AACzB,cAAQ,KAAK,oHAAoH;AAAA,IACnI;AACA,YAAQ,cAAc;AAAA,EACxB,WAAW,QAAQ,eAAe,MAAM;AACtC,YAAQ,eAAe;AAAA,EACzB;AAEA,MAAI,QAAQ,iBAAiB,MAC3B;AAAE,YAAQ,gBAAgB,QAAQ,cAAc;AAAA,EAAG;AAErD,MAAI,CAAC,QAAQ,KAAK,iBAAiB,MACjC;AAAE,YAAQ,gBAAgB,QAAQ,eAAe;AAAA,EAAI;AAEvD,MAAI,QAAQ,QAAQ,OAAO,GAAG;AAC5B,QAAI,SAAS,QAAQ;AACrB,YAAQ,UAAU,SAAU,OAAO;AAAE,aAAO,OAAO,KAAK,KAAK;AAAA,IAAG;AAAA,EAClE;AACA,MAAI,QAAQ,QAAQ,SAAS,GAC3B;AAAE,YAAQ,YAAY,YAAY,SAAS,QAAQ,SAAS;AAAA,EAAG;AAEjE,SAAO;AACT;AAEA,SAAS,YAAY,SAAS,OAAO;AACnC,SAAO,SAAS,OAAO,MAAM,OAAO,KAAK,UAAU,QAAQ;AACzD,QAAI,UAAU;AAAA,MACZ,MAAM,QAAQ,UAAU;AAAA,MACxB,OAAO;AAAA,MACP;AAAA,MACA;AAAA,IACF;AACA,QAAI,QAAQ,WACV;AAAE,cAAQ,MAAM,IAAI,eAAe,MAAM,UAAU,MAAM;AAAA,IAAG;AAC9D,QAAI,QAAQ,QACV;AAAE,cAAQ,QAAQ,CAAC,OAAO,GAAG;AAAA,IAAG;AAClC,UAAM,KAAK,OAAO;AAAA,EACpB;AACF;AAGA,IACI,YAAY;AADhB,IAEI,iBAAiB;AAFrB,IAGI,cAAc;AAHlB,IAII,kBAAkB;AAJtB,IAKI,cAAc;AALlB,IAMI,qBAAqB;AANzB,IAOI,cAAc;AAPlB,IAQI,qBAAqB;AARzB,IASI,2BAA2B;AAT/B,IAUI,yBAAyB;AAV7B,IAWI,YAAY,YAAY,iBAAiB;AAE7C,SAAS,cAAc,OAAO,WAAW;AACvC,SAAO,kBAAkB,QAAQ,cAAc,MAAM,YAAY,kBAAkB;AACrF;AAGA,IACI,YAAY;AADhB,IAEI,WAAW;AAFf,IAGI,eAAe;AAHnB,IAII,gBAAgB;AAJpB,IAKI,oBAAoB;AALxB,IAMI,eAAe;AAEnB,IAAI,SAAS,SAASC,QAAO,SAAS,OAAO,UAAU;AACrD,OAAK,UAAU,UAAU,WAAW,OAAO;AAC3C,OAAK,aAAa,QAAQ;AAC1B,OAAK,WAAW,YAAY,WAAW,QAAQ,eAAe,IAAI,IAAI,QAAQ,eAAe,WAAW,YAAY,CAAC,CAAC;AACtH,MAAI,WAAW;AACf,MAAI,QAAQ,kBAAkB,MAAM;AAClC,eAAW,cAAc,QAAQ,eAAe,IAAI,IAAI,QAAQ,gBAAgB,IAAI,IAAI,CAAC;AACzF,QAAI,QAAQ,eAAe,UAAU;AAAE,kBAAY;AAAA,IAAU;AAAA,EAC/D;AACA,OAAK,gBAAgB,YAAY,QAAQ;AACzC,MAAI,kBAAkB,WAAW,WAAW,MAAM,MAAM,cAAc;AACtE,OAAK,sBAAsB,YAAY,cAAc;AACrD,OAAK,0BAA0B,YAAY,iBAAiB,MAAM,cAAc,UAAU;AAC1F,OAAK,QAAQ,OAAO,KAAK;AAKzB,OAAK,cAAc;AAKnB,MAAI,UAAU;AACZ,SAAK,MAAM;AACX,SAAK,YAAY,KAAK,MAAM,YAAY,MAAM,WAAW,CAAC,IAAI;AAC9D,SAAK,UAAU,KAAK,MAAM,MAAM,GAAG,KAAK,SAAS,EAAE,MAAM,SAAS,EAAE;AAAA,EACtE,OAAO;AACL,SAAK,MAAM,KAAK,YAAY;AAC5B,SAAK,UAAU;AAAA,EACjB;AAIA,OAAK,OAAO,QAAQ;AAEpB,OAAK,QAAQ;AAEb,OAAK,QAAQ,KAAK,MAAM,KAAK;AAG7B,OAAK,WAAW,KAAK,SAAS,KAAK,YAAY;AAG/C,OAAK,gBAAgB,KAAK,kBAAkB;AAC5C,OAAK,eAAe,KAAK,aAAa,KAAK;AAK3C,OAAK,UAAU,KAAK,eAAe;AACnC,OAAK,cAAc;AAGnB,OAAK,WAAW,QAAQ,eAAe;AACvC,OAAK,SAAS,KAAK,YAAY,KAAK,gBAAgB,KAAK,GAAG;AAG5D,OAAK,mBAAmB;AACxB,OAAK,2BAA2B;AAGhC,OAAK,WAAW,KAAK,WAAW,KAAK,gBAAgB;AAErD,OAAK,SAAS,CAAC;AAEf,OAAK,mBAAmB,uBAAO,OAAO,IAAI;AAG1C,MAAI,KAAK,QAAQ,KAAK,QAAQ,iBAAiB,KAAK,MAAM,MAAM,GAAG,CAAC,MAAM,MACxE;AAAE,SAAK,gBAAgB,CAAC;AAAA,EAAG;AAG7B,OAAK,aAAa,CAAC;AACnB,OAAK,WAAW,SAAS;AAGzB,OAAK,cAAc;AAKnB,OAAK,mBAAmB,CAAC;AAC3B;AAEA,IAAI,qBAAqB,EAAE,YAAY,EAAE,cAAc,KAAK,GAAE,aAAa,EAAE,cAAc,KAAK,GAAE,SAAS,EAAE,cAAc,KAAK,GAAE,UAAU,EAAE,cAAc,KAAK,GAAE,YAAY,EAAE,cAAc,KAAK,GAAE,kBAAkB,EAAE,cAAc,KAAK,GAAE,qBAAqB,EAAE,cAAc,KAAK,GAAE,mBAAmB,EAAE,cAAc,KAAK,GAAE,oBAAoB,EAAE,cAAc,KAAK,EAAE;AAEhX,OAAO,UAAU,QAAQ,SAAS,QAAS;AACzC,MAAI,OAAO,KAAK,QAAQ,WAAW,KAAK,UAAU;AAClD,OAAK,UAAU;AACf,SAAO,KAAK,cAAc,IAAI;AAChC;AAEA,mBAAmB,WAAW,MAAM,WAAY;AAAE,UAAQ,KAAK,gBAAgB,EAAE,QAAQ,kBAAkB;AAAE;AAE7G,mBAAmB,YAAY,MAAM,WAAY;AAAE,UAAQ,KAAK,gBAAgB,EAAE,QAAQ,mBAAmB;AAAE;AAE/G,mBAAmB,QAAQ,MAAM,WAAY;AAAE,UAAQ,KAAK,gBAAgB,EAAE,QAAQ,eAAe;AAAE;AAEvG,mBAAmB,SAAS,MAAM,WAAY;AAC5C,WAAS,IAAI,KAAK,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;AACpD,QAAIC,OAAM,KAAK,WAAW,CAAC;AACzB,QAAI,QAAQA,KAAI;AAClB,QAAI,SAAS,2BAA2B,yBAAyB;AAAE,aAAO;AAAA,IAAM;AAChF,QAAI,QAAQ,gBAAgB;AAAE,cAAQ,QAAQ,eAAe;AAAA,IAAE;AAAA,EACjE;AACA,SAAQ,KAAK,YAAY,KAAK,QAAQ,eAAe,MAAO,KAAK,QAAQ;AAC3E;AAEA,mBAAmB,WAAW,MAAM,WAAY;AAC9C,MAAIA,OAAM,KAAK,iBAAiB;AAC9B,MAAI,QAAQA,KAAI;AAClB,UAAQ,QAAQ,eAAe,KAAK,KAAK,QAAQ;AACnD;AAEA,mBAAmB,iBAAiB,MAAM,WAAY;AAAE,UAAQ,KAAK,iBAAiB,EAAE,QAAQ,sBAAsB;AAAE;AAExH,mBAAmB,oBAAoB,MAAM,WAAY;AAAE,SAAO,KAAK,2BAA2B,KAAK,aAAa,CAAC;AAAE;AAEvH,mBAAmB,kBAAkB,MAAM,WAAY;AACrD,WAAS,IAAI,KAAK,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;AACpD,QAAIA,OAAM,KAAK,WAAW,CAAC;AACzB,QAAI,QAAQA,KAAI;AAClB,QAAI,SAAS,2BAA2B,2BAClC,QAAQ,kBAAmB,EAAE,QAAQ,cAAe;AAAE,aAAO;AAAA,IAAK;AAAA,EAC1E;AACA,SAAO;AACT;AAEA,mBAAmB,mBAAmB,MAAM,WAAY;AACtD,UAAQ,KAAK,gBAAgB,EAAE,QAAQ,4BAA4B;AACrE;AAEA,OAAO,SAAS,SAAS,SAAU;AAC/B,MAAI,UAAU,CAAC,GAAG,MAAM,UAAU;AAClC,SAAQ,MAAQ,SAAS,GAAI,IAAI,UAAW,GAAI;AAElD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AAAE,UAAM,QAAQ,CAAC,EAAE,GAAG;AAAA,EAAG;AAClE,SAAO;AACT;AAEA,OAAO,QAAQ,SAASC,OAAO,OAAO,SAAS;AAC7C,SAAO,IAAI,KAAK,SAAS,KAAK,EAAE,MAAM;AACxC;AAEA,OAAO,oBAAoB,SAAS,kBAAmB,OAAO,KAAK,SAAS;AAC1E,MAAIC,UAAS,IAAI,KAAK,SAAS,OAAO,GAAG;AACzC,EAAAA,QAAO,UAAU;AACjB,SAAOA,QAAO,gBAAgB;AAChC;AAEA,OAAO,YAAY,SAAS,UAAW,OAAO,SAAS;AACrD,SAAO,IAAI,KAAK,SAAS,KAAK;AAChC;AAEA,OAAO,iBAAkB,OAAO,WAAW,kBAAmB;AAE9D,IAAI,OAAO,OAAO;AAIlB,IAAI,UAAU;AACd,KAAK,kBAAkB,SAAS,OAAO;AACrC,MAAI,KAAK,QAAQ,cAAc,GAAG;AAAE,WAAO;AAAA,EAAM;AACjD,aAAS;AAEP,mBAAe,YAAY;AAC3B,aAAS,eAAe,KAAK,KAAK,KAAK,EAAE,CAAC,EAAE;AAC5C,QAAI,QAAQ,QAAQ,KAAK,KAAK,MAAM,MAAM,KAAK,CAAC;AAChD,QAAI,CAAC,OAAO;AAAE,aAAO;AAAA,IAAM;AAC3B,SAAK,MAAM,CAAC,KAAK,MAAM,CAAC,OAAO,cAAc;AAC3C,qBAAe,YAAY,QAAQ,MAAM,CAAC,EAAE;AAC5C,UAAI,aAAa,eAAe,KAAK,KAAK,KAAK,GAAG,MAAM,WAAW,QAAQ,WAAW,CAAC,EAAE;AACzF,UAAI,OAAO,KAAK,MAAM,OAAO,GAAG;AAChC,aAAO,SAAS,OAAO,SAAS,OAC7B,UAAU,KAAK,WAAW,CAAC,CAAC,KAC5B,EAAE,sBAAsB,KAAK,IAAI,KAAK,SAAS,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC,MAAM;AAAA,IAC1F;AACA,aAAS,MAAM,CAAC,EAAE;AAGlB,mBAAe,YAAY;AAC3B,aAAS,eAAe,KAAK,KAAK,KAAK,EAAE,CAAC,EAAE;AAC5C,QAAI,KAAK,MAAM,KAAK,MAAM,KACxB;AAAE;AAAA,IAAS;AAAA,EACf;AACF;AAKA,KAAK,MAAM,SAAS,MAAM;AACxB,MAAI,KAAK,SAAS,MAAM;AACtB,SAAK,KAAK;AACV,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAIA,KAAK,eAAe,SAAS,MAAM;AACjC,SAAO,KAAK,SAAS,QAAQ,QAAQ,KAAK,UAAU,QAAQ,CAAC,KAAK;AACpE;AAIA,KAAK,gBAAgB,SAAS,MAAM;AAClC,MAAI,CAAC,KAAK,aAAa,IAAI,GAAG;AAAE,WAAO;AAAA,EAAM;AAC7C,OAAK,KAAK;AACV,SAAO;AACT;AAIA,KAAK,mBAAmB,SAAS,MAAM;AACrC,MAAI,CAAC,KAAK,cAAc,IAAI,GAAG;AAAE,SAAK,WAAW;AAAA,EAAG;AACtD;AAIA,KAAK,qBAAqB,WAAW;AACnC,SAAO,KAAK,SAAS,QAAQ,OAC3B,KAAK,SAAS,QAAQ,UACtB,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC;AAChE;AAEA,KAAK,kBAAkB,WAAW;AAChC,MAAI,KAAK,mBAAmB,GAAG;AAC7B,QAAI,KAAK,QAAQ,qBACf;AAAE,WAAK,QAAQ,oBAAoB,KAAK,YAAY,KAAK,aAAa;AAAA,IAAG;AAC3E,WAAO;AAAA,EACT;AACF;AAKA,KAAK,YAAY,WAAW;AAC1B,MAAI,CAAC,KAAK,IAAI,QAAQ,IAAI,KAAK,CAAC,KAAK,gBAAgB,GAAG;AAAE,SAAK,WAAW;AAAA,EAAG;AAC/E;AAEA,KAAK,qBAAqB,SAAS,SAAS,SAAS;AACnD,MAAI,KAAK,SAAS,SAAS;AACzB,QAAI,KAAK,QAAQ,iBACf;AAAE,WAAK,QAAQ,gBAAgB,KAAK,cAAc,KAAK,eAAe;AAAA,IAAG;AAC3E,QAAI,CAAC,SACH;AAAE,WAAK,KAAK;AAAA,IAAG;AACjB,WAAO;AAAA,EACT;AACF;AAKA,KAAK,SAAS,SAAS,MAAM;AAC3B,OAAK,IAAI,IAAI,KAAK,KAAK,WAAW;AACpC;AAIA,KAAK,aAAa,SAAS,KAAK;AAC9B,OAAK,MAAM,OAAO,OAAO,MAAM,KAAK,OAAO,kBAAkB;AAC/D;AAEA,IAAI,sBAAsB,SAASC,uBAAsB;AACvD,OAAK,kBACL,KAAK,gBACL,KAAK,sBACL,KAAK,oBACL,KAAK,cACH;AACJ;AAEA,KAAK,qBAAqB,SAAS,wBAAwB,UAAU;AACnE,MAAI,CAAC,wBAAwB;AAAE;AAAA,EAAO;AACtC,MAAI,uBAAuB,gBAAgB,IACzC;AAAE,SAAK,iBAAiB,uBAAuB,eAAe,+CAA+C;AAAA,EAAG;AAClH,MAAI,SAAS,WAAW,uBAAuB,sBAAsB,uBAAuB;AAC5F,MAAI,SAAS,IAAI;AAAE,SAAK,iBAAiB,QAAQ,WAAW,wBAAwB,uBAAuB;AAAA,EAAG;AAChH;AAEA,KAAK,wBAAwB,SAAS,wBAAwB,UAAU;AACtE,MAAI,CAAC,wBAAwB;AAAE,WAAO;AAAA,EAAM;AAC5C,MAAI,kBAAkB,uBAAuB;AAC7C,MAAI,cAAc,uBAAuB;AACzC,MAAI,CAAC,UAAU;AAAE,WAAO,mBAAmB,KAAK,eAAe;AAAA,EAAE;AACjE,MAAI,mBAAmB,GACrB;AAAE,SAAK,MAAM,iBAAiB,yEAAyE;AAAA,EAAG;AAC5G,MAAI,eAAe,GACjB;AAAE,SAAK,iBAAiB,aAAa,oCAAoC;AAAA,EAAG;AAChF;AAEA,KAAK,iCAAiC,WAAW;AAC/C,MAAI,KAAK,aAAa,CAAC,KAAK,YAAY,KAAK,WAAW,KAAK,WAC3D;AAAE,SAAK,MAAM,KAAK,UAAU,4CAA4C;AAAA,EAAG;AAC7E,MAAI,KAAK,UACP;AAAE,SAAK,MAAM,KAAK,UAAU,4CAA4C;AAAA,EAAG;AAC/E;AAEA,KAAK,uBAAuB,SAAS,MAAM;AACzC,MAAI,KAAK,SAAS,2BAChB;AAAE,WAAO,KAAK,qBAAqB,KAAK,UAAU;AAAA,EAAE;AACtD,SAAO,KAAK,SAAS,gBAAgB,KAAK,SAAS;AACrD;AAEA,IAAI,OAAO,OAAO;AASlB,KAAK,gBAAgB,SAAS,MAAM;AAClC,MAAI,UAAU,uBAAO,OAAO,IAAI;AAChC,MAAI,CAAC,KAAK,MAAM;AAAE,SAAK,OAAO,CAAC;AAAA,EAAG;AAClC,SAAO,KAAK,SAAS,QAAQ,KAAK;AAChC,QAAI,OAAO,KAAK,eAAe,MAAM,MAAM,OAAO;AAClD,SAAK,KAAK,KAAK,IAAI;AAAA,EACrB;AACA,MAAI,KAAK,UACP;AAAE,aAAS,IAAI,GAAG,OAAO,OAAO,KAAK,KAAK,gBAAgB,GAAG,IAAI,KAAK,QAAQ,KAAK,GACjF;AACE,UAAI,OAAO,KAAK,CAAC;AAEjB,WAAK,iBAAiB,KAAK,iBAAiB,IAAI,EAAE,OAAQ,aAAa,OAAO,kBAAmB;AAAA,IACnG;AAAA,EAAE;AACN,OAAK,uBAAuB,KAAK,IAAI;AACrC,OAAK,KAAK;AACV,OAAK,aAAa,KAAK,QAAQ;AAC/B,SAAO,KAAK,WAAW,MAAM,SAAS;AACxC;AAEA,IAAI,YAAY,EAAC,MAAM,OAAM;AAA7B,IAAgC,cAAc,EAAC,MAAM,SAAQ;AAE7D,KAAK,QAAQ,SAAS,SAAS;AAC7B,MAAI,KAAK,QAAQ,cAAc,KAAK,CAAC,KAAK,aAAa,KAAK,GAAG;AAAE,WAAO;AAAA,EAAM;AAC9E,iBAAe,YAAY,KAAK;AAChC,MAAI,OAAO,eAAe,KAAK,KAAK,KAAK;AACzC,MAAI,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,QAAQ,SAAS,KAAK,MAAM,WAAW,IAAI;AAKzE,MAAI,WAAW,MAAM,WAAW,IAAI;AAAE,WAAO;AAAA,EAAK;AAClD,MAAI,SAAS;AAAE,WAAO;AAAA,EAAM;AAE5B,MAAI,WAAW,OAAO,SAAS,SAAU,SAAS,OAAQ;AAAE,WAAO;AAAA,EAAK;AACxE,MAAI,kBAAkB,QAAQ,IAAI,GAAG;AACnC,QAAI,MAAM,OAAO;AACjB,WAAO,iBAAiB,SAAS,KAAK,MAAM,WAAW,GAAG,GAAG,IAAI,GAAG;AAAE,QAAE;AAAA,IAAK;AAC7E,QAAI,WAAW,MAAM,SAAS,SAAU,SAAS,OAAQ;AAAE,aAAO;AAAA,IAAK;AACvE,QAAI,QAAQ,KAAK,MAAM,MAAM,MAAM,GAAG;AACtC,QAAI,CAAC,0BAA0B,KAAK,KAAK,GAAG;AAAE,aAAO;AAAA,IAAK;AAAA,EAC5D;AACA,SAAO;AACT;AAKA,KAAK,kBAAkB,WAAW;AAChC,MAAI,KAAK,QAAQ,cAAc,KAAK,CAAC,KAAK,aAAa,OAAO,GAC5D;AAAE,WAAO;AAAA,EAAM;AAEjB,iBAAe,YAAY,KAAK;AAChC,MAAI,OAAO,eAAe,KAAK,KAAK,KAAK;AACzC,MAAI,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,QAAQ;AACtC,SAAO,CAAC,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,IAAI,CAAC,KACrD,KAAK,MAAM,MAAM,MAAM,OAAO,CAAC,MAAM,eACpC,OAAO,MAAM,KAAK,MAAM,UACxB,EAAE,iBAAiB,QAAQ,KAAK,MAAM,WAAW,OAAO,CAAC,CAAC,KAAK,QAAQ,SAAU,QAAQ;AAC9F;AAEA,KAAK,iBAAiB,SAAS,cAAc,OAAO;AAClD,MAAI,KAAK,QAAQ,cAAc,MAAM,CAAC,KAAK,aAAa,eAAe,UAAU,OAAO,GACtF;AAAE,WAAO;AAAA,EAAM;AAEjB,iBAAe,YAAY,KAAK;AAChC,MAAI,OAAO,eAAe,KAAK,KAAK,KAAK;AACzC,MAAI,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE;AAE9B,MAAI,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,IAAI,CAAC,GAAG;AAAE,WAAO;AAAA,EAAM;AAErE,MAAI,cAAc;AAChB,QAAI,cAAc,OAAO,GAAe;AACxC,QAAI,KAAK,MAAM,MAAM,MAAM,WAAW,MAAM,WAC1C,gBAAgB,KAAK,MAAM,UAC3B,iBAAiB,QAAQ,KAAK,MAAM,WAAW,WAAW,CAAC,KAC1D,QAAQ,SAAU,QAAQ,OAC3B;AAAE,aAAO;AAAA,IAAM;AAEjB,mBAAe,YAAY;AAC3B,QAAI,iBAAiB,eAAe,KAAK,KAAK,KAAK;AACnD,QAAI,kBAAkB,UAAU,KAAK,KAAK,MAAM,MAAM,aAAa,cAAc,eAAe,CAAC,EAAE,MAAM,CAAC,GAAG;AAAE,aAAO;AAAA,IAAM;AAAA,EAC9H;AAEA,MAAI,OAAO;AACT,QAAI,WAAW,OAAO,GAAY;AAClC,QAAI,KAAK,MAAM,MAAM,MAAM,QAAQ,MAAM,MAAM;AAC7C,UAAI,aAAa,KAAK,MAAM,UACzB,CAAC,iBAAiB,UAAU,KAAK,MAAM,WAAW,QAAQ,CAAC,KAAK,EAAE,UAAU,SAAU,UAAU,QAAU;AAAE,eAAO;AAAA,MAAM;AAAA,IAC9H;AAAA,EACF;AAEA,MAAI,KAAK,KAAK,MAAM,WAAW,IAAI;AACnC,SAAO,kBAAkB,IAAI,IAAI,KAAK,OAAO;AAC/C;AAEA,KAAK,eAAe,SAAS,OAAO;AAClC,SAAO,KAAK,eAAe,MAAM,KAAK;AACxC;AAEA,KAAK,UAAU,SAAS,OAAO;AAC7B,SAAO,KAAK,eAAe,OAAO,KAAK;AACzC;AASA,KAAK,iBAAiB,SAAS,SAAS,UAAU,SAAS;AACzD,MAAI,YAAY,KAAK,MAAM,OAAO,KAAK,UAAU,GAAG;AAEpD,MAAI,KAAK,MAAM,OAAO,GAAG;AACvB,gBAAY,QAAQ;AACpB,WAAO;AAAA,EACT;AAMA,UAAQ,WAAW;AAAA,IACnB,KAAK,QAAQ;AAAA,IAAQ,KAAK,QAAQ;AAAW,aAAO,KAAK,4BAA4B,MAAM,UAAU,OAAO;AAAA,IAC5G,KAAK,QAAQ;AAAW,aAAO,KAAK,uBAAuB,IAAI;AAAA,IAC/D,KAAK,QAAQ;AAAK,aAAO,KAAK,iBAAiB,IAAI;AAAA,IACnD,KAAK,QAAQ;AAAM,aAAO,KAAK,kBAAkB,IAAI;AAAA,IACrD,KAAK,QAAQ;AAIX,UAAK,YAAY,KAAK,UAAU,YAAY,QAAQ,YAAY,YAAa,KAAK,QAAQ,eAAe,GAAG;AAAE,aAAK,WAAW;AAAA,MAAG;AACjI,aAAO,KAAK,uBAAuB,MAAM,OAAO,CAAC,OAAO;AAAA,IAC1D,KAAK,QAAQ;AACX,UAAI,SAAS;AAAE,aAAK,WAAW;AAAA,MAAG;AAClC,aAAO,KAAK,WAAW,MAAM,IAAI;AAAA,IACnC,KAAK,QAAQ;AAAK,aAAO,KAAK,iBAAiB,IAAI;AAAA,IACnD,KAAK,QAAQ;AAAS,aAAO,KAAK,qBAAqB,IAAI;AAAA,IAC3D,KAAK,QAAQ;AAAS,aAAO,KAAK,qBAAqB,IAAI;AAAA,IAC3D,KAAK,QAAQ;AAAQ,aAAO,KAAK,oBAAoB,IAAI;AAAA,IACzD,KAAK,QAAQ;AAAM,aAAO,KAAK,kBAAkB,IAAI;AAAA,IACrD,KAAK,QAAQ;AAAA,IAAQ,KAAK,QAAQ;AAChC,aAAO,QAAQ,KAAK;AACpB,UAAI,WAAW,SAAS,OAAO;AAAE,aAAK,WAAW;AAAA,MAAG;AACpD,aAAO,KAAK,kBAAkB,MAAM,IAAI;AAAA,IAC1C,KAAK,QAAQ;AAAQ,aAAO,KAAK,oBAAoB,IAAI;AAAA,IACzD,KAAK,QAAQ;AAAO,aAAO,KAAK,mBAAmB,IAAI;AAAA,IACvD,KAAK,QAAQ;AAAQ,aAAO,KAAK,WAAW,MAAM,IAAI;AAAA,IACtD,KAAK,QAAQ;AAAM,aAAO,KAAK,oBAAoB,IAAI;AAAA,IACvD,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,UAAI,KAAK,QAAQ,cAAc,MAAM,cAAc,QAAQ,SAAS;AAClE,uBAAe,YAAY,KAAK;AAChC,YAAI,OAAO,eAAe,KAAK,KAAK,KAAK;AACzC,YAAI,OAAO,KAAK,MAAM,KAAK,CAAC,EAAE,QAAQ,SAAS,KAAK,MAAM,WAAW,IAAI;AACzE,YAAI,WAAW,MAAM,WAAW,IAC9B;AAAE,iBAAO,KAAK,yBAAyB,MAAM,KAAK,gBAAgB,CAAC;AAAA,QAAE;AAAA,MACzE;AAEA,UAAI,CAAC,KAAK,QAAQ,6BAA6B;AAC7C,YAAI,CAAC,UACH;AAAE,eAAK,MAAM,KAAK,OAAO,wDAAwD;AAAA,QAAG;AACtF,YAAI,CAAC,KAAK,UACR;AAAE,eAAK,MAAM,KAAK,OAAO,iEAAiE;AAAA,QAAG;AAAA,MACjG;AACA,aAAO,cAAc,QAAQ,UAAU,KAAK,YAAY,IAAI,IAAI,KAAK,YAAY,MAAM,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOhG;AACE,UAAI,KAAK,gBAAgB,GAAG;AAC1B,YAAI,SAAS;AAAE,eAAK,WAAW;AAAA,QAAG;AAClC,aAAK,KAAK;AACV,eAAO,KAAK,uBAAuB,MAAM,MAAM,CAAC,OAAO;AAAA,MACzD;AAEA,UAAI,YAAY,KAAK,aAAa,KAAK,IAAI,gBAAgB,KAAK,QAAQ,KAAK,IAAI,UAAU;AAC3F,UAAI,WAAW;AACb,YAAI,YAAY,KAAK,QAAQ,eAAe,UAAU;AACpD,eAAK,MAAM,KAAK,OAAO,+EAA+E;AAAA,QACxG;AACA,YAAI,cAAc,eAAe;AAC/B,cAAI,CAAC,KAAK,UAAU;AAClB,iBAAK,MAAM,KAAK,OAAO,qDAAqD;AAAA,UAC9E;AACA,eAAK,KAAK;AAAA,QACZ;AACA,aAAK,KAAK;AACV,aAAK,SAAS,MAAM,OAAO,SAAS;AACpC,aAAK,UAAU;AACf,eAAO,KAAK,WAAW,MAAM,qBAAqB;AAAA,MACpD;AAEA,UAAI,YAAY,KAAK,OAAO,OAAO,KAAK,gBAAgB;AACxD,UAAI,cAAc,QAAQ,QAAQ,KAAK,SAAS,gBAAgB,KAAK,IAAI,QAAQ,KAAK,GACpF;AAAE,eAAO,KAAK,sBAAsB,MAAM,WAAW,MAAM,OAAO;AAAA,MAAE,OACjE;AAAE,eAAO,KAAK,yBAAyB,MAAM,IAAI;AAAA,MAAE;AAAA,EAC1D;AACF;AAEA,KAAK,8BAA8B,SAAS,MAAM,SAAS;AACzD,MAAI,UAAU,YAAY;AAC1B,OAAK,KAAK;AACV,MAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,KAAK,gBAAgB,GAAG;AAAE,SAAK,QAAQ;AAAA,EAAM,WAClE,KAAK,SAAS,QAAQ,MAAM;AAAE,SAAK,WAAW;AAAA,EAAG,OACrD;AACH,SAAK,QAAQ,KAAK,WAAW;AAC7B,SAAK,UAAU;AAAA,EACjB;AAIA,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,OAAO,QAAQ,EAAE,GAAG;AAClC,QAAI,MAAM,KAAK,OAAO,CAAC;AACvB,QAAI,KAAK,SAAS,QAAQ,IAAI,SAAS,KAAK,MAAM,MAAM;AACtD,UAAI,IAAI,QAAQ,SAAS,WAAW,IAAI,SAAS,SAAS;AAAE;AAAA,MAAM;AAClE,UAAI,KAAK,SAAS,SAAS;AAAE;AAAA,MAAM;AAAA,IACrC;AAAA,EACF;AACA,MAAI,MAAM,KAAK,OAAO,QAAQ;AAAE,SAAK,MAAM,KAAK,OAAO,iBAAiB,OAAO;AAAA,EAAG;AAClF,SAAO,KAAK,WAAW,MAAM,UAAU,mBAAmB,mBAAmB;AAC/E;AAEA,KAAK,yBAAyB,SAAS,MAAM;AAC3C,OAAK,KAAK;AACV,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,mBAAmB;AAClD;AAEA,KAAK,mBAAmB,SAAS,MAAM;AACrC,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,SAAS;AAC1B,OAAK,OAAO,KAAK,eAAe,IAAI;AACpC,OAAK,OAAO,IAAI;AAChB,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,OAAO,KAAK,qBAAqB;AACtC,MAAI,KAAK,QAAQ,eAAe,GAC9B;AAAE,SAAK,IAAI,QAAQ,IAAI;AAAA,EAAG,OAE1B;AAAE,SAAK,UAAU;AAAA,EAAG;AACtB,SAAO,KAAK,WAAW,MAAM,kBAAkB;AACjD;AAUA,KAAK,oBAAoB,SAAS,MAAM;AACtC,OAAK,KAAK;AACV,MAAI,UAAW,KAAK,QAAQ,eAAe,KAAK,KAAK,YAAY,KAAK,cAAc,OAAO,IAAK,KAAK,eAAe;AACpH,OAAK,OAAO,KAAK,SAAS;AAC1B,OAAK,WAAW,CAAC;AACjB,OAAK,OAAO,QAAQ,MAAM;AAC1B,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,QAAI,UAAU,IAAI;AAAE,WAAK,WAAW,OAAO;AAAA,IAAG;AAC9C,WAAO,KAAK,SAAS,MAAM,IAAI;AAAA,EACjC;AACA,MAAI,QAAQ,KAAK,MAAM;AACvB,MAAI,KAAK,SAAS,QAAQ,QAAQ,KAAK,SAAS,QAAQ,UAAU,OAAO;AACvE,QAAI,SAAS,KAAK,UAAU,GAAG,OAAO,QAAQ,QAAQ,KAAK;AAC3D,SAAK,KAAK;AACV,SAAK,SAAS,QAAQ,MAAM,IAAI;AAChC,SAAK,WAAW,QAAQ,qBAAqB;AAC7C,WAAO,KAAK,kBAAkB,MAAM,QAAQ,OAAO;AAAA,EACrD;AACA,MAAI,gBAAgB,KAAK,aAAa,KAAK,GAAG,UAAU;AAExD,MAAI,YAAY,KAAK,QAAQ,IAAI,IAAI,UAAU,KAAK,aAAa,IAAI,IAAI,gBAAgB;AACzF,MAAI,WAAW;AACb,QAAI,SAAS,KAAK,UAAU;AAC5B,SAAK,KAAK;AACV,QAAI,cAAc,eAAe;AAAE,WAAK,KAAK;AAAA,IAAG;AAChD,SAAK,SAAS,QAAQ,MAAM,SAAS;AACrC,SAAK,WAAW,QAAQ,qBAAqB;AAC7C,WAAO,KAAK,kBAAkB,MAAM,QAAQ,OAAO;AAAA,EACrD;AACA,MAAI,cAAc,KAAK;AACvB,MAAI,yBAAyB,IAAI;AACjC,MAAI,UAAU,KAAK;AACnB,MAAI,OAAO,UAAU,KACjB,KAAK,oBAAoB,wBAAwB,OAAO,IACxD,KAAK,gBAAgB,MAAM,sBAAsB;AACrD,MAAI,KAAK,SAAS,QAAQ,QAAQ,UAAU,KAAK,QAAQ,eAAe,KAAK,KAAK,aAAa,IAAI,IAAI;AACrG,QAAI,UAAU,IAAI;AAChB,UAAI,KAAK,SAAS,QAAQ,KAAK;AAAE,aAAK,WAAW,OAAO;AAAA,MAAG;AAC3D,WAAK,QAAQ;AAAA,IACf,WAAW,WAAW,KAAK,QAAQ,eAAe,GAAG;AACnD,UAAI,KAAK,UAAU,WAAW,CAAC,eAAe,KAAK,SAAS,gBAAgB,KAAK,SAAS,SAAS;AAAE,aAAK,WAAW;AAAA,MAAG,WAC/G,KAAK,QAAQ,eAAe,GAAG;AAAE,aAAK,QAAQ;AAAA,MAAO;AAAA,IAChE;AACA,QAAI,iBAAiB,SAAS;AAAE,WAAK,MAAM,KAAK,OAAO,+DAA+D;AAAA,IAAG;AACzH,SAAK,aAAa,MAAM,OAAO,sBAAsB;AACrD,SAAK,iBAAiB,IAAI;AAC1B,WAAO,KAAK,WAAW,MAAM,IAAI;AAAA,EACnC,OAAO;AACL,SAAK,sBAAsB,wBAAwB,IAAI;AAAA,EACzD;AACA,MAAI,UAAU,IAAI;AAAE,SAAK,WAAW,OAAO;AAAA,EAAG;AAC9C,SAAO,KAAK,SAAS,MAAM,IAAI;AACjC;AAGA,KAAK,oBAAoB,SAAS,MAAM,MAAM,SAAS;AACrD,OAAK,KAAK,SAAS,QAAQ,OAAQ,KAAK,QAAQ,eAAe,KAAK,KAAK,aAAa,IAAI,MAAO,KAAK,aAAa,WAAW,GAAG;AAC/H,QAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,UAAI,KAAK,SAAS,QAAQ,KAAK;AAC7B,YAAI,UAAU,IAAI;AAAE,eAAK,WAAW,OAAO;AAAA,QAAG;AAAA,MAChD,OAAO;AAAE,aAAK,QAAQ,UAAU;AAAA,MAAI;AAAA,IACtC;AACA,WAAO,KAAK,WAAW,MAAM,IAAI;AAAA,EACnC;AACA,MAAI,UAAU,IAAI;AAAE,SAAK,WAAW,OAAO;AAAA,EAAG;AAC9C,SAAO,KAAK,SAAS,MAAM,IAAI;AACjC;AAEA,KAAK,yBAAyB,SAAS,MAAM,SAAS,qBAAqB;AACzE,OAAK,KAAK;AACV,SAAO,KAAK,cAAc,MAAM,kBAAkB,sBAAsB,IAAI,yBAAyB,OAAO,OAAO;AACrH;AAEA,KAAK,mBAAmB,SAAS,MAAM;AACrC,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,qBAAqB;AAEtC,OAAK,aAAa,KAAK,eAAe,IAAI;AAC1C,OAAK,YAAY,KAAK,IAAI,QAAQ,KAAK,IAAI,KAAK,eAAe,IAAI,IAAI;AACvE,SAAO,KAAK,WAAW,MAAM,aAAa;AAC5C;AAEA,KAAK,uBAAuB,SAAS,MAAM;AACzC,MAAI,CAAC,KAAK,cAAc,CAAC,KAAK,QAAQ,4BACpC;AAAE,SAAK,MAAM,KAAK,OAAO,8BAA8B;AAAA,EAAG;AAC5D,OAAK,KAAK;AAMV,MAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,KAAK,gBAAgB,GAAG;AAAE,SAAK,WAAW;AAAA,EAAM,OACzE;AAAE,SAAK,WAAW,KAAK,gBAAgB;AAAG,SAAK,UAAU;AAAA,EAAG;AACjE,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,uBAAuB,SAAS,MAAM;AACzC,OAAK,KAAK;AACV,OAAK,eAAe,KAAK,qBAAqB;AAC9C,OAAK,QAAQ,CAAC;AACd,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,OAAO,KAAK,WAAW;AAC5B,OAAK,WAAW,CAAC;AAMjB,MAAI;AACJ,WAAS,aAAa,OAAO,KAAK,SAAS,QAAQ,UAAS;AAC1D,QAAI,KAAK,SAAS,QAAQ,SAAS,KAAK,SAAS,QAAQ,UAAU;AACjE,UAAI,SAAS,KAAK,SAAS,QAAQ;AACnC,UAAI,KAAK;AAAE,aAAK,WAAW,KAAK,YAAY;AAAA,MAAG;AAC/C,WAAK,MAAM,KAAK,MAAM,KAAK,UAAU,CAAC;AACtC,UAAI,aAAa,CAAC;AAClB,WAAK,KAAK;AACV,UAAI,QAAQ;AACV,YAAI,OAAO,KAAK,gBAAgB;AAAA,MAClC,OAAO;AACL,YAAI,YAAY;AAAE,eAAK,iBAAiB,KAAK,cAAc,0BAA0B;AAAA,QAAG;AACxF,qBAAa;AACb,YAAI,OAAO;AAAA,MACb;AACA,WAAK,OAAO,QAAQ,KAAK;AAAA,IAC3B,OAAO;AACL,UAAI,CAAC,KAAK;AAAE,aAAK,WAAW;AAAA,MAAG;AAC/B,UAAI,WAAW,KAAK,KAAK,eAAe,IAAI,CAAC;AAAA,IAC/C;AAAA,EACF;AACA,OAAK,UAAU;AACf,MAAI,KAAK;AAAE,SAAK,WAAW,KAAK,YAAY;AAAA,EAAG;AAC/C,OAAK,KAAK;AACV,OAAK,OAAO,IAAI;AAChB,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,sBAAsB,SAAS,MAAM;AACxC,OAAK,KAAK;AACV,MAAI,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC,GAC9D;AAAE,SAAK,MAAM,KAAK,YAAY,6BAA6B;AAAA,EAAG;AAChE,OAAK,WAAW,KAAK,gBAAgB;AACrC,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,gBAAgB;AAC/C;AAIA,IAAI,UAAU,CAAC;AAEf,KAAK,wBAAwB,WAAW;AACtC,MAAI,QAAQ,KAAK,iBAAiB;AAClC,MAAI,SAAS,MAAM,SAAS;AAC5B,OAAK,WAAW,SAAS,qBAAqB,CAAC;AAC/C,OAAK,iBAAiB,OAAO,SAAS,oBAAoB,YAAY;AACtE,OAAK,OAAO,QAAQ,MAAM;AAE1B,SAAO;AACT;AAEA,KAAK,oBAAoB,SAAS,MAAM;AACtC,OAAK,KAAK;AACV,OAAK,QAAQ,KAAK,WAAW;AAC7B,OAAK,UAAU;AACf,MAAI,KAAK,SAAS,QAAQ,QAAQ;AAChC,QAAI,SAAS,KAAK,UAAU;AAC5B,SAAK,KAAK;AACV,QAAI,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC5B,aAAO,QAAQ,KAAK,sBAAsB;AAAA,IAC5C,OAAO;AACL,UAAI,KAAK,QAAQ,cAAc,IAAI;AAAE,aAAK,WAAW;AAAA,MAAG;AACxD,aAAO,QAAQ;AACf,WAAK,WAAW,CAAC;AAAA,IACnB;AACA,WAAO,OAAO,KAAK,WAAW,KAAK;AACnC,SAAK,UAAU;AACf,SAAK,UAAU,KAAK,WAAW,QAAQ,aAAa;AAAA,EACtD;AACA,OAAK,YAAY,KAAK,IAAI,QAAQ,QAAQ,IAAI,KAAK,WAAW,IAAI;AAClE,MAAI,CAAC,KAAK,WAAW,CAAC,KAAK,WACzB;AAAE,SAAK,MAAM,KAAK,OAAO,iCAAiC;AAAA,EAAG;AAC/D,SAAO,KAAK,WAAW,MAAM,cAAc;AAC7C;AAEA,KAAK,oBAAoB,SAAS,MAAM,MAAM,yBAAyB;AACrE,OAAK,KAAK;AACV,OAAK,SAAS,MAAM,OAAO,MAAM,uBAAuB;AACxD,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,qBAAqB;AACpD;AAEA,KAAK,sBAAsB,SAAS,MAAM;AACxC,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,qBAAqB;AACtC,OAAK,OAAO,KAAK,SAAS;AAC1B,OAAK,OAAO,KAAK,eAAe,OAAO;AACvC,OAAK,OAAO,IAAI;AAChB,SAAO,KAAK,WAAW,MAAM,gBAAgB;AAC/C;AAEA,KAAK,qBAAqB,SAAS,MAAM;AACvC,MAAI,KAAK,QAAQ;AAAE,SAAK,MAAM,KAAK,OAAO,uBAAuB;AAAA,EAAG;AACpE,OAAK,KAAK;AACV,OAAK,SAAS,KAAK,qBAAqB;AACxC,OAAK,OAAO,KAAK,eAAe,MAAM;AACtC,SAAO,KAAK,WAAW,MAAM,eAAe;AAC9C;AAEA,KAAK,sBAAsB,SAAS,MAAM;AACxC,OAAK,KAAK;AACV,SAAO,KAAK,WAAW,MAAM,gBAAgB;AAC/C;AAEA,KAAK,wBAAwB,SAAS,MAAM,WAAW,MAAM,SAAS;AACpE,WAAS,MAAM,GAAG,OAAO,KAAK,QAAQ,MAAM,KAAK,QAAQ,OAAO,GAC9D;AACA,QAAI,QAAQ,KAAK,GAAG;AAEpB,QAAI,MAAM,SAAS,WACjB;AAAE,WAAK,MAAM,KAAK,OAAO,YAAY,YAAY,uBAAuB;AAAA,IAC5E;AAAA,EAAE;AACF,MAAI,OAAO,KAAK,KAAK,SAAS,SAAS,KAAK,SAAS,QAAQ,UAAU,WAAW;AAClF,WAAS,IAAI,KAAK,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AAChD,QAAI,UAAU,KAAK,OAAO,CAAC;AAC3B,QAAI,QAAQ,mBAAmB,KAAK,OAAO;AAEzC,cAAQ,iBAAiB,KAAK;AAC9B,cAAQ,OAAO;AAAA,IACjB,OAAO;AAAE;AAAA,IAAM;AAAA,EACjB;AACA,OAAK,OAAO,KAAK,EAAC,MAAM,WAAW,MAAY,gBAAgB,KAAK,MAAK,CAAC;AAC1E,OAAK,OAAO,KAAK,eAAe,UAAU,QAAQ,QAAQ,OAAO,MAAM,KAAK,UAAU,UAAU,UAAU,OAAO;AACjH,OAAK,OAAO,IAAI;AAChB,OAAK,QAAQ;AACb,SAAO,KAAK,WAAW,MAAM,kBAAkB;AACjD;AAEA,KAAK,2BAA2B,SAAS,MAAM,MAAM;AACnD,OAAK,aAAa;AAClB,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,qBAAqB;AACpD;AAMA,KAAK,aAAa,SAAS,uBAAuB,MAAM,YAAY;AAClE,MAAK,0BAA0B,OAAS,yBAAwB;AAChE,MAAK,SAAS,OAAS,QAAO,KAAK,UAAU;AAE7C,OAAK,OAAO,CAAC;AACb,OAAK,OAAO,QAAQ,MAAM;AAC1B,MAAI,uBAAuB;AAAE,SAAK,WAAW,CAAC;AAAA,EAAG;AACjD,SAAO,KAAK,SAAS,QAAQ,QAAQ;AACnC,QAAI,OAAO,KAAK,eAAe,IAAI;AACnC,SAAK,KAAK,KAAK,IAAI;AAAA,EACrB;AACA,MAAI,YAAY;AAAE,SAAK,SAAS;AAAA,EAAO;AACvC,OAAK,KAAK;AACV,MAAI,uBAAuB;AAAE,SAAK,UAAU;AAAA,EAAG;AAC/C,SAAO,KAAK,WAAW,MAAM,gBAAgB;AAC/C;AAMA,KAAK,WAAW,SAAS,MAAM,MAAM;AACnC,OAAK,OAAO;AACZ,OAAK,OAAO,QAAQ,IAAI;AACxB,OAAK,OAAO,KAAK,SAAS,QAAQ,OAAO,OAAO,KAAK,gBAAgB;AACrE,OAAK,OAAO,QAAQ,IAAI;AACxB,OAAK,SAAS,KAAK,SAAS,QAAQ,SAAS,OAAO,KAAK,gBAAgB;AACzE,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,OAAO,KAAK,eAAe,KAAK;AACrC,OAAK,UAAU;AACf,OAAK,OAAO,IAAI;AAChB,SAAO,KAAK,WAAW,MAAM,cAAc;AAC7C;AAKA,KAAK,aAAa,SAAS,MAAM,MAAM;AACrC,MAAI,UAAU,KAAK,SAAS,QAAQ;AACpC,OAAK,KAAK;AAEV,MACE,KAAK,SAAS,yBACd,KAAK,aAAa,CAAC,EAAE,QAAQ,SAE3B,CAAC,WACD,KAAK,QAAQ,cAAc,KAC3B,KAAK,UACL,KAAK,SAAS,SACd,KAAK,aAAa,CAAC,EAAE,GAAG,SAAS,eAEnC;AACA,SAAK;AAAA,MACH,KAAK;AAAA,OACH,UAAU,WAAW,YAAY;AAAA,IACrC;AAAA,EACF;AACA,OAAK,OAAO;AACZ,OAAK,QAAQ,UAAU,KAAK,gBAAgB,IAAI,KAAK,iBAAiB;AACtE,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,OAAO,KAAK,eAAe,KAAK;AACrC,OAAK,UAAU;AACf,OAAK,OAAO,IAAI;AAChB,SAAO,KAAK,WAAW,MAAM,UAAU,mBAAmB,gBAAgB;AAC5E;AAIA,KAAK,WAAW,SAAS,MAAM,OAAO,MAAM,yBAAyB;AACnE,OAAK,eAAe,CAAC;AACrB,OAAK,OAAO;AACZ,aAAS;AACP,QAAI,OAAO,KAAK,UAAU;AAC1B,SAAK,WAAW,MAAM,IAAI;AAC1B,QAAI,KAAK,IAAI,QAAQ,EAAE,GAAG;AACxB,WAAK,OAAO,KAAK,iBAAiB,KAAK;AAAA,IACzC,WAAW,CAAC,2BAA2B,SAAS,WAAW,EAAE,KAAK,SAAS,QAAQ,OAAQ,KAAK,QAAQ,eAAe,KAAK,KAAK,aAAa,IAAI,IAAK;AACrJ,WAAK,WAAW;AAAA,IAClB,WAAW,CAAC,4BAA4B,SAAS,WAAW,SAAS,kBAAkB,KAAK,QAAQ,eAAe,MAAM,KAAK,SAAS,QAAQ,OAAO,CAAC,KAAK,aAAa,IAAI,GAAG;AAC9K,WAAK,MAAM,KAAK,YAAa,4BAA4B,OAAO,cAAe;AAAA,IACjF,WAAW,CAAC,2BAA2B,KAAK,GAAG,SAAS,gBAAgB,EAAE,UAAU,KAAK,SAAS,QAAQ,OAAO,KAAK,aAAa,IAAI,KAAK;AAC1I,WAAK,MAAM,KAAK,YAAY,0DAA0D;AAAA,IACxF,OAAO;AACL,WAAK,OAAO;AAAA,IACd;AACA,SAAK,aAAa,KAAK,KAAK,WAAW,MAAM,oBAAoB,CAAC;AAClE,QAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,GAAG;AAAE;AAAA,IAAM;AAAA,EACxC;AACA,SAAO;AACT;AAEA,KAAK,aAAa,SAAS,MAAM,MAAM;AACrC,OAAK,KAAK,SAAS,WAAW,SAAS,gBACnC,KAAK,WAAW,IAChB,KAAK,iBAAiB;AAE1B,OAAK,iBAAiB,KAAK,IAAI,SAAS,QAAQ,WAAW,cAAc,KAAK;AAChF;AAEA,IAAI,iBAAiB;AAArB,IAAwB,yBAAyB;AAAjD,IAAoD,mBAAmB;AAMvE,KAAK,gBAAgB,SAAS,MAAM,WAAW,qBAAqB,SAAS,SAAS;AACpF,OAAK,aAAa,IAAI;AACtB,MAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,QAAQ,eAAe,KAAK,CAAC,SAAS;AAC9E,QAAI,KAAK,SAAS,QAAQ,QAAS,YAAY,wBAC7C;AAAE,WAAK,WAAW;AAAA,IAAG;AACvB,SAAK,YAAY,KAAK,IAAI,QAAQ,IAAI;AAAA,EACxC;AACA,MAAI,KAAK,QAAQ,eAAe,GAC9B;AAAE,SAAK,QAAQ,CAAC,CAAC;AAAA,EAAS;AAE5B,MAAI,YAAY,gBAAgB;AAC9B,SAAK,KAAM,YAAY,oBAAqB,KAAK,SAAS,QAAQ,OAAO,OAAO,KAAK,WAAW;AAChG,QAAI,KAAK,MAAM,EAAE,YAAY,yBAK3B;AAAE,WAAK,gBAAgB,KAAK,IAAK,KAAK,UAAU,KAAK,aAAa,KAAK,QAAS,KAAK,sBAAsB,WAAW,eAAe,aAAa;AAAA,IAAG;AAAA,EACzJ;AAEA,MAAI,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU,mBAAmB,KAAK;AACtF,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,OAAK,WAAW,cAAc,KAAK,OAAO,KAAK,SAAS,CAAC;AAEzD,MAAI,EAAE,YAAY,iBAChB;AAAE,SAAK,KAAK,KAAK,SAAS,QAAQ,OAAO,KAAK,WAAW,IAAI;AAAA,EAAM;AAErE,OAAK,oBAAoB,IAAI;AAC7B,OAAK,kBAAkB,MAAM,qBAAqB,OAAO,OAAO;AAEhE,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,SAAO,KAAK,WAAW,MAAO,YAAY,iBAAkB,wBAAwB,oBAAoB;AAC1G;AAEA,KAAK,sBAAsB,SAAS,MAAM;AACxC,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,SAAS,KAAK,iBAAiB,QAAQ,QAAQ,OAAO,KAAK,QAAQ,eAAe,CAAC;AACxF,OAAK,+BAA+B;AACtC;AAKA,KAAK,aAAa,SAAS,MAAM,aAAa;AAC5C,OAAK,KAAK;AAIV,MAAI,YAAY,KAAK;AACrB,OAAK,SAAS;AAEd,OAAK,aAAa,MAAM,WAAW;AACnC,OAAK,gBAAgB,IAAI;AACzB,MAAI,iBAAiB,KAAK,eAAe;AACzC,MAAI,YAAY,KAAK,UAAU;AAC/B,MAAI,iBAAiB;AACrB,YAAU,OAAO,CAAC;AAClB,OAAK,OAAO,QAAQ,MAAM;AAC1B,SAAO,KAAK,SAAS,QAAQ,QAAQ;AACnC,QAAI,UAAU,KAAK,kBAAkB,KAAK,eAAe,IAAI;AAC7D,QAAI,SAAS;AACX,gBAAU,KAAK,KAAK,OAAO;AAC3B,UAAI,QAAQ,SAAS,sBAAsB,QAAQ,SAAS,eAAe;AACzE,YAAI,gBAAgB;AAAE,eAAK,iBAAiB,QAAQ,OAAO,yCAAyC;AAAA,QAAG;AACvG,yBAAiB;AAAA,MACnB,WAAW,QAAQ,OAAO,QAAQ,IAAI,SAAS,uBAAuB,wBAAwB,gBAAgB,OAAO,GAAG;AACtH,aAAK,iBAAiB,QAAQ,IAAI,OAAQ,kBAAmB,QAAQ,IAAI,OAAQ,6BAA8B;AAAA,MACjH;AAAA,IACF;AAAA,EACF;AACA,OAAK,SAAS;AACd,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,WAAW,WAAW,WAAW;AAClD,OAAK,cAAc;AACnB,SAAO,KAAK,WAAW,MAAM,cAAc,qBAAqB,iBAAiB;AACnF;AAEA,KAAK,oBAAoB,SAAS,wBAAwB;AACxD,MAAI,KAAK,IAAI,QAAQ,IAAI,GAAG;AAAE,WAAO;AAAA,EAAK;AAE1C,MAAI,cAAc,KAAK,QAAQ;AAC/B,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,UAAU;AACd,MAAI,cAAc;AAClB,MAAI,UAAU;AACd,MAAI,OAAO;AACX,MAAI,WAAW;AAEf,MAAI,KAAK,cAAc,QAAQ,GAAG;AAEhC,QAAI,eAAe,MAAM,KAAK,IAAI,QAAQ,MAAM,GAAG;AACjD,WAAK,sBAAsB,IAAI;AAC/B,aAAO;AAAA,IACT;AACA,QAAI,KAAK,wBAAwB,KAAK,KAAK,SAAS,QAAQ,MAAM;AAChE,iBAAW;AAAA,IACb,OAAO;AACL,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,OAAK,SAAS;AACd,MAAI,CAAC,WAAW,eAAe,KAAK,KAAK,cAAc,OAAO,GAAG;AAC/D,SAAK,KAAK,wBAAwB,KAAK,KAAK,SAAS,QAAQ,SAAS,CAAC,KAAK,mBAAmB,GAAG;AAChG,gBAAU;AAAA,IACZ,OAAO;AACL,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,MAAI,CAAC,YAAY,eAAe,KAAK,CAAC,YAAY,KAAK,IAAI,QAAQ,IAAI,GAAG;AACxE,kBAAc;AAAA,EAChB;AACA,MAAI,CAAC,WAAW,CAAC,WAAW,CAAC,aAAa;AACxC,QAAI,YAAY,KAAK;AACrB,QAAI,KAAK,cAAc,KAAK,KAAK,KAAK,cAAc,KAAK,GAAG;AAC1D,UAAI,KAAK,wBAAwB,GAAG;AAClC,eAAO;AAAA,MACT,OAAO;AACL,kBAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAGA,MAAI,SAAS;AAGX,SAAK,WAAW;AAChB,SAAK,MAAM,KAAK,YAAY,KAAK,cAAc,KAAK,eAAe;AACnE,SAAK,IAAI,OAAO;AAChB,SAAK,WAAW,KAAK,KAAK,YAAY;AAAA,EACxC,OAAO;AACL,SAAK,sBAAsB,IAAI;AAAA,EACjC;AAGA,MAAI,cAAc,MAAM,KAAK,SAAS,QAAQ,UAAU,SAAS,YAAY,eAAe,SAAS;AACnG,QAAI,gBAAgB,CAAC,KAAK,UAAU,aAAa,MAAM,aAAa;AACpE,QAAI,oBAAoB,iBAAiB;AAEzC,QAAI,iBAAiB,SAAS,UAAU;AAAE,WAAK,MAAM,KAAK,IAAI,OAAO,yCAAyC;AAAA,IAAG;AACjH,SAAK,OAAO,gBAAgB,gBAAgB;AAC5C,SAAK,iBAAiB,MAAM,aAAa,SAAS,iBAAiB;AAAA,EACrE,OAAO;AACL,SAAK,gBAAgB,IAAI;AAAA,EAC3B;AAEA,SAAO;AACT;AAEA,KAAK,0BAA0B,WAAW;AACxC,SACE,KAAK,SAAS,QAAQ,QACtB,KAAK,SAAS,QAAQ,aACtB,KAAK,SAAS,QAAQ,OACtB,KAAK,SAAS,QAAQ,UACtB,KAAK,SAAS,QAAQ,YACtB,KAAK,KAAK;AAEd;AAEA,KAAK,wBAAwB,SAAS,SAAS;AAC7C,MAAI,KAAK,SAAS,QAAQ,WAAW;AACnC,QAAI,KAAK,UAAU,eAAe;AAChC,WAAK,MAAM,KAAK,OAAO,oDAAoD;AAAA,IAC7E;AACA,YAAQ,WAAW;AACnB,YAAQ,MAAM,KAAK,kBAAkB;AAAA,EACvC,OAAO;AACL,SAAK,kBAAkB,OAAO;AAAA,EAChC;AACF;AAEA,KAAK,mBAAmB,SAAS,QAAQ,aAAa,SAAS,mBAAmB;AAEhF,MAAI,MAAM,OAAO;AACjB,MAAI,OAAO,SAAS,eAAe;AACjC,QAAI,aAAa;AAAE,WAAK,MAAM,IAAI,OAAO,kCAAkC;AAAA,IAAG;AAC9E,QAAI,SAAS;AAAE,WAAK,MAAM,IAAI,OAAO,sCAAsC;AAAA,IAAG;AAAA,EAChF,WAAW,OAAO,UAAU,aAAa,QAAQ,WAAW,GAAG;AAC7D,SAAK,MAAM,IAAI,OAAO,wDAAwD;AAAA,EAChF;AAGA,MAAI,QAAQ,OAAO,QAAQ,KAAK,YAAY,aAAa,SAAS,iBAAiB;AAGnF,MAAI,OAAO,SAAS,SAAS,MAAM,OAAO,WAAW,GACnD;AAAE,SAAK,iBAAiB,MAAM,OAAO,8BAA8B;AAAA,EAAG;AACxE,MAAI,OAAO,SAAS,SAAS,MAAM,OAAO,WAAW,GACnD;AAAE,SAAK,iBAAiB,MAAM,OAAO,sCAAsC;AAAA,EAAG;AAChF,MAAI,OAAO,SAAS,SAAS,MAAM,OAAO,CAAC,EAAE,SAAS,eACpD;AAAE,SAAK,iBAAiB,MAAM,OAAO,CAAC,EAAE,OAAO,+BAA+B;AAAA,EAAG;AAEnF,SAAO,KAAK,WAAW,QAAQ,kBAAkB;AACnD;AAEA,KAAK,kBAAkB,SAAS,OAAO;AACrC,MAAI,aAAa,OAAO,aAAa,GAAG;AACtC,SAAK,MAAM,MAAM,IAAI,OAAO,gDAAgD;AAAA,EAC9E,WAAW,MAAM,UAAU,aAAa,OAAO,WAAW,GAAG;AAC3D,SAAK,MAAM,MAAM,IAAI,OAAO,qDAAqD;AAAA,EACnF;AAEA,MAAI,KAAK,IAAI,QAAQ,EAAE,GAAG;AAExB,SAAK,WAAW,yBAAyB,WAAW;AACpD,UAAM,QAAQ,KAAK,iBAAiB;AACpC,SAAK,UAAU;AAAA,EACjB,OAAO;AACL,UAAM,QAAQ;AAAA,EAChB;AACA,OAAK,UAAU;AAEf,SAAO,KAAK,WAAW,OAAO,oBAAoB;AACpD;AAEA,KAAK,wBAAwB,SAAS,MAAM;AAC1C,OAAK,OAAO,CAAC;AAEb,MAAI,YAAY,KAAK;AACrB,OAAK,SAAS,CAAC;AACf,OAAK,WAAW,2BAA2B,WAAW;AACtD,SAAO,KAAK,SAAS,QAAQ,QAAQ;AACnC,QAAI,OAAO,KAAK,eAAe,IAAI;AACnC,SAAK,KAAK,KAAK,IAAI;AAAA,EACrB;AACA,OAAK,KAAK;AACV,OAAK,UAAU;AACf,OAAK,SAAS;AAEd,SAAO,KAAK,WAAW,MAAM,aAAa;AAC5C;AAEA,KAAK,eAAe,SAAS,MAAM,aAAa;AAC9C,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,SAAK,KAAK,KAAK,WAAW;AAC1B,QAAI,aACF;AAAE,WAAK,gBAAgB,KAAK,IAAI,cAAc,KAAK;AAAA,IAAG;AAAA,EAC1D,OAAO;AACL,QAAI,gBAAgB,MAClB;AAAE,WAAK,WAAW;AAAA,IAAG;AACvB,SAAK,KAAK;AAAA,EACZ;AACF;AAEA,KAAK,kBAAkB,SAAS,MAAM;AACpC,OAAK,aAAa,KAAK,IAAI,QAAQ,QAAQ,IAAI,KAAK,oBAAoB,MAAM,KAAK,IAAI;AACzF;AAEA,KAAK,iBAAiB,WAAW;AAC/B,MAAI,UAAU,EAAC,UAAU,uBAAO,OAAO,IAAI,GAAG,MAAM,CAAC,EAAC;AACtD,OAAK,iBAAiB,KAAK,OAAO;AAClC,SAAO,QAAQ;AACjB;AAEA,KAAK,gBAAgB,WAAW;AAC9B,MAAIH,OAAM,KAAK,iBAAiB,IAAI;AACpC,MAAI,WAAWA,KAAI;AACnB,MAAI,OAAOA,KAAI;AACf,MAAI,CAAC,KAAK,QAAQ,oBAAoB;AAAE;AAAA,EAAO;AAC/C,MAAI,MAAM,KAAK,iBAAiB;AAChC,MAAI,SAAS,QAAQ,IAAI,OAAO,KAAK,iBAAiB,MAAM,CAAC;AAC7D,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AACpC,QAAI,KAAK,KAAK,CAAC;AACf,QAAI,CAAC,OAAO,UAAU,GAAG,IAAI,GAAG;AAC9B,UAAI,QAAQ;AACV,eAAO,KAAK,KAAK,EAAE;AAAA,MACrB,OAAO;AACL,aAAK,iBAAiB,GAAG,OAAQ,qBAAsB,GAAG,OAAQ,0CAA2C;AAAA,MAC/G;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,wBAAwB,gBAAgB,SAAS;AACxD,MAAI,OAAO,QAAQ,IAAI;AACvB,MAAI,OAAO,eAAe,IAAI;AAE9B,MAAI,OAAO;AACX,MAAI,QAAQ,SAAS,uBAAuB,QAAQ,SAAS,SAAS,QAAQ,SAAS,QAAQ;AAC7F,YAAQ,QAAQ,SAAS,MAAM,OAAO,QAAQ;AAAA,EAChD;AAGA,MACE,SAAS,UAAU,SAAS,UAC5B,SAAS,UAAU,SAAS,UAC5B,SAAS,UAAU,SAAS,UAC5B,SAAS,UAAU,SAAS,QAC5B;AACA,mBAAe,IAAI,IAAI;AACvB,WAAO;AAAA,EACT,WAAW,CAAC,MAAM;AAChB,mBAAe,IAAI,IAAI;AACvB,WAAO;AAAA,EACT,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,SAAS,aAAa,MAAM,MAAM;AAChC,MAAI,WAAW,KAAK;AACpB,MAAI,MAAM,KAAK;AACf,SAAO,CAAC,aACN,IAAI,SAAS,gBAAgB,IAAI,SAAS,QAC1C,IAAI,SAAS,aAAa,IAAI,UAAU;AAE5C;AAIA,KAAK,4BAA4B,SAAS,MAAM,SAAS;AACvD,MAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,QAAI,KAAK,cAAc,IAAI,GAAG;AAC5B,WAAK,WAAW,KAAK,sBAAsB;AAC3C,WAAK,YAAY,SAAS,KAAK,UAAU,KAAK,YAAY;AAAA,IAC5D,OAAO;AACL,WAAK,WAAW;AAAA,IAClB;AAAA,EACF;AACA,OAAK,iBAAiB,MAAM;AAC5B,MAAI,KAAK,SAAS,QAAQ,QAAQ;AAAE,SAAK,WAAW;AAAA,EAAG;AACvD,OAAK,SAAS,KAAK,cAAc;AACjC,MAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,SAAK,aAAa,KAAK,gBAAgB;AAAA,EAAG;AAC9C,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,sBAAsB;AACrD;AAEA,KAAK,cAAc,SAAS,MAAM,SAAS;AACzC,OAAK,KAAK;AAEV,MAAI,KAAK,IAAI,QAAQ,IAAI,GAAG;AAC1B,WAAO,KAAK,0BAA0B,MAAM,OAAO;AAAA,EACrD;AACA,MAAI,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC9B,SAAK,YAAY,SAAS,WAAW,KAAK,YAAY;AACtD,SAAK,cAAc,KAAK,8BAA8B;AACtD,WAAO,KAAK,WAAW,MAAM,0BAA0B;AAAA,EACzD;AAEA,MAAI,KAAK,2BAA2B,GAAG;AACrC,SAAK,cAAc,KAAK,uBAAuB,IAAI;AACnD,QAAI,KAAK,YAAY,SAAS,uBAC5B;AAAE,WAAK,oBAAoB,SAAS,KAAK,YAAY,YAAY;AAAA,IAAG,OAEpE;AAAE,WAAK,YAAY,SAAS,KAAK,YAAY,IAAI,KAAK,YAAY,GAAG,KAAK;AAAA,IAAG;AAC/E,SAAK,aAAa,CAAC;AACnB,SAAK,SAAS;AACd,QAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,WAAK,aAAa,CAAC;AAAA,IAAG;AAAA,EAC5B,OAAO;AACL,SAAK,cAAc;AACnB,SAAK,aAAa,KAAK,sBAAsB,OAAO;AACpD,QAAI,KAAK,cAAc,MAAM,GAAG;AAC9B,UAAI,KAAK,SAAS,QAAQ,QAAQ;AAAE,aAAK,WAAW;AAAA,MAAG;AACvD,WAAK,SAAS,KAAK,cAAc;AACjC,UAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,aAAK,aAAa,KAAK,gBAAgB;AAAA,MAAG;AAAA,IAChD,OAAO;AACL,eAAS,IAAI,GAAG,OAAO,KAAK,YAAY,IAAI,KAAK,QAAQ,KAAK,GAAG;AAE/D,YAAI,OAAO,KAAK,CAAC;AAEjB,aAAK,gBAAgB,KAAK,KAAK;AAE/B,aAAK,iBAAiB,KAAK,KAAK;AAEhC,YAAI,KAAK,MAAM,SAAS,WAAW;AACjC,eAAK,MAAM,KAAK,MAAM,OAAO,wEAAwE;AAAA,QACvG;AAAA,MACF;AAEA,WAAK,SAAS;AACd,UAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,aAAK,aAAa,CAAC;AAAA,MAAG;AAAA,IAC5B;AACA,SAAK,UAAU;AAAA,EACjB;AACA,SAAO,KAAK,WAAW,MAAM,wBAAwB;AACvD;AAEA,KAAK,yBAAyB,SAAS,MAAM;AAC3C,SAAO,KAAK,eAAe,IAAI;AACjC;AAEA,KAAK,gCAAgC,WAAW;AAC9C,MAAI;AACJ,MAAI,KAAK,SAAS,QAAQ,cAAc,UAAU,KAAK,gBAAgB,IAAI;AACzE,QAAI,QAAQ,KAAK,UAAU;AAC3B,SAAK,KAAK;AACV,QAAI,SAAS;AAAE,WAAK,KAAK;AAAA,IAAG;AAC5B,WAAO,KAAK,cAAc,OAAO,iBAAiB,kBAAkB,OAAO,OAAO;AAAA,EACpF,WAAW,KAAK,SAAS,QAAQ,QAAQ;AACvC,QAAI,QAAQ,KAAK,UAAU;AAC3B,WAAO,KAAK,WAAW,OAAO,YAAY;AAAA,EAC5C,OAAO;AACL,QAAI,cAAc,KAAK,iBAAiB;AACxC,SAAK,UAAU;AACf,WAAO;AAAA,EACT;AACF;AAEA,KAAK,cAAc,SAAS,SAAS,MAAM,KAAK;AAC9C,MAAI,CAAC,SAAS;AAAE;AAAA,EAAO;AACvB,MAAI,OAAO,SAAS,UAClB;AAAE,WAAO,KAAK,SAAS,eAAe,KAAK,OAAO,KAAK;AAAA,EAAO;AAChE,MAAI,OAAO,SAAS,IAAI,GACtB;AAAE,SAAK,iBAAiB,KAAK,uBAAuB,OAAO,GAAG;AAAA,EAAG;AACnE,UAAQ,IAAI,IAAI;AAClB;AAEA,KAAK,qBAAqB,SAAS,SAAS,KAAK;AAC/C,MAAI,OAAO,IAAI;AACf,MAAI,SAAS,cACX;AAAE,SAAK,YAAY,SAAS,KAAK,IAAI,KAAK;AAAA,EAAG,WACtC,SAAS,iBAChB;AAAE,aAAS,IAAI,GAAG,OAAO,IAAI,YAAY,IAAI,KAAK,QAAQ,KAAK,GAC7D;AACE,UAAI,OAAO,KAAK,CAAC;AAEjB,WAAK,mBAAmB,SAAS,IAAI;AAAA,IACvC;AAAA,EAAE,WACG,SAAS,gBAChB;AAAE,aAAS,MAAM,GAAG,SAAS,IAAI,UAAU,MAAM,OAAO,QAAQ,OAAO,GAAG;AACxE,UAAI,MAAM,OAAO,GAAG;AAElB,UAAI,KAAK;AAAE,aAAK,mBAAmB,SAAS,GAAG;AAAA,MAAG;AAAA,IACtD;AAAA,EAAE,WACK,SAAS,YAChB;AAAE,SAAK,mBAAmB,SAAS,IAAI,KAAK;AAAA,EAAG,WACxC,SAAS,qBAChB;AAAE,SAAK,mBAAmB,SAAS,IAAI,IAAI;AAAA,EAAG,WACvC,SAAS,eAChB;AAAE,SAAK,mBAAmB,SAAS,IAAI,QAAQ;AAAA,EAAG;AACtD;AAEA,KAAK,sBAAsB,SAAS,SAAS,OAAO;AAClD,MAAI,CAAC,SAAS;AAAE;AAAA,EAAO;AACvB,WAAS,IAAI,GAAG,OAAO,OAAO,IAAI,KAAK,QAAQ,KAAK,GAClD;AACA,QAAI,OAAO,KAAK,CAAC;AAEjB,SAAK,mBAAmB,SAAS,KAAK,EAAE;AAAA,EAC1C;AACF;AAEA,KAAK,6BAA6B,WAAW;AAC3C,SAAO,KAAK,KAAK,YAAY,SAC3B,KAAK,KAAK,YAAY,WACtB,KAAK,KAAK,YAAY,WACtB,KAAK,KAAK,YAAY,cACtB,KAAK,MAAM,KACX,KAAK,gBAAgB;AACzB;AAIA,KAAK,uBAAuB,SAAS,SAAS;AAC5C,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,QAAQ,KAAK,sBAAsB;AAExC,OAAK,WAAW,KAAK,cAAc,IAAI,IAAI,KAAK,sBAAsB,IAAI,KAAK;AAC/E,OAAK;AAAA,IACH;AAAA,IACA,KAAK;AAAA,IACL,KAAK,SAAS;AAAA,EAChB;AAEA,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,wBAAwB,SAAS,SAAS;AAC7C,MAAI,QAAQ,CAAC,GAAG,QAAQ;AAExB,OAAK,OAAO,QAAQ,MAAM;AAC1B,SAAO,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAAE;AAAA,MAAM;AAAA,IACvD,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,UAAM,KAAK,KAAK,qBAAqB,OAAO,CAAC;AAAA,EAC/C;AACA,SAAO;AACT;AAIA,KAAK,cAAc,SAAS,MAAM;AAChC,OAAK,KAAK;AAGV,MAAI,KAAK,SAAS,QAAQ,QAAQ;AAChC,SAAK,aAAa;AAClB,SAAK,SAAS,KAAK,cAAc;AAAA,EACnC,OAAO;AACL,SAAK,aAAa,KAAK,sBAAsB;AAC7C,SAAK,iBAAiB,MAAM;AAC5B,SAAK,SAAS,KAAK,SAAS,QAAQ,SAAS,KAAK,cAAc,IAAI,KAAK,WAAW;AAAA,EACtF;AACA,MAAI,KAAK,QAAQ,eAAe,IAC9B;AAAE,SAAK,aAAa,KAAK,gBAAgB;AAAA,EAAG;AAC9C,OAAK,UAAU;AACf,SAAO,KAAK,WAAW,MAAM,mBAAmB;AAClD;AAIA,KAAK,uBAAuB,WAAW;AACrC,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,WAAW,KAAK,sBAAsB;AAE3C,MAAI,KAAK,cAAc,IAAI,GAAG;AAC5B,SAAK,QAAQ,KAAK,WAAW;AAAA,EAC/B,OAAO;AACL,SAAK,gBAAgB,KAAK,QAAQ;AAClC,SAAK,QAAQ,KAAK;AAAA,EACpB;AACA,OAAK,gBAAgB,KAAK,OAAO,YAAY;AAE7C,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,8BAA8B,WAAW;AAE5C,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,QAAQ,KAAK,WAAW;AAC7B,OAAK,gBAAgB,KAAK,OAAO,YAAY;AAC7C,SAAO,KAAK,WAAW,MAAM,wBAAwB;AACvD;AAEA,KAAK,gCAAgC,WAAW;AAC9C,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,OAAK,iBAAiB,IAAI;AAC1B,OAAK,QAAQ,KAAK,WAAW;AAC7B,OAAK,gBAAgB,KAAK,OAAO,YAAY;AAC7C,SAAO,KAAK,WAAW,MAAM,0BAA0B;AACzD;AAEA,KAAK,wBAAwB,WAAW;AACtC,MAAI,QAAQ,CAAC,GAAG,QAAQ;AACxB,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,UAAM,KAAK,KAAK,4BAA4B,CAAC;AAC7C,QAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,GAAG;AAAE,aAAO;AAAA,IAAM;AAAA,EAC/C;AACA,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,UAAM,KAAK,KAAK,8BAA8B,CAAC;AAC/C,WAAO;AAAA,EACT;AACA,OAAK,OAAO,QAAQ,MAAM;AAC1B,SAAO,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAAE;AAAA,MAAM;AAAA,IACvD,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,UAAM,KAAK,KAAK,qBAAqB,CAAC;AAAA,EACxC;AACA,SAAO;AACT;AAEA,KAAK,kBAAkB,WAAW;AAChC,MAAI,QAAQ,CAAC;AACb,MAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,GAAG;AAC5B,WAAO;AAAA,EACT;AACA,OAAK,OAAO,QAAQ,MAAM;AAC1B,MAAI,gBAAgB,CAAC;AACrB,MAAI,QAAQ;AACZ,SAAO,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAAE;AAAA,MAAM;AAAA,IACvD,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,QAAI,OAAO,KAAK,qBAAqB;AACrC,QAAI,UAAU,KAAK,IAAI,SAAS,eAAe,KAAK,IAAI,OAAO,KAAK,IAAI;AACxE,QAAI,OAAO,eAAe,OAAO,GAC/B;AAAE,WAAK,iBAAiB,KAAK,IAAI,OAAO,8BAA8B,UAAU,GAAG;AAAA,IAAG;AACxF,kBAAc,OAAO,IAAI;AACzB,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,SAAO;AACT;AAEA,KAAK,uBAAuB,WAAW;AACrC,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,MAAM,KAAK,SAAS,QAAQ,SAAS,KAAK,cAAc,IAAI,KAAK,WAAW,KAAK,QAAQ,kBAAkB,OAAO;AACvH,OAAK,OAAO,QAAQ,KAAK;AACzB,MAAI,KAAK,SAAS,QAAQ,QAAQ;AAChC,SAAK,WAAW;AAAA,EAClB;AACA,OAAK,QAAQ,KAAK,cAAc;AAChC,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,wBAAwB,WAAW;AACtC,MAAI,KAAK,QAAQ,eAAe,MAAM,KAAK,SAAS,QAAQ,QAAQ;AAClE,QAAI,gBAAgB,KAAK,aAAa,KAAK,KAAK;AAChD,QAAI,cAAc,KAAK,cAAc,KAAK,GAAG;AAC3C,WAAK,MAAM,cAAc,OAAO,iDAAiD;AAAA,IACnF;AACA,WAAO;AAAA,EACT;AACA,SAAO,KAAK,WAAW,IAAI;AAC7B;AAGA,KAAK,yBAAyB,SAAS,YAAY;AACjD,WAAS,IAAI,GAAG,IAAI,WAAW,UAAU,KAAK,qBAAqB,WAAW,CAAC,CAAC,GAAG,EAAE,GAAG;AACtF,eAAW,CAAC,EAAE,YAAY,WAAW,CAAC,EAAE,WAAW,IAAI,MAAM,GAAG,EAAE;AAAA,EACpE;AACF;AACA,KAAK,uBAAuB,SAAS,WAAW;AAC9C,SACE,KAAK,QAAQ,eAAe,KAC5B,UAAU,SAAS,yBACnB,UAAU,WAAW,SAAS,aAC9B,OAAO,UAAU,WAAW,UAAU;AAAA,GAErC,KAAK,MAAM,UAAU,KAAK,MAAM,OAAQ,KAAK,MAAM,UAAU,KAAK,MAAM;AAE7E;AAEA,IAAI,OAAO,OAAO;AAKlB,KAAK,eAAe,SAAS,MAAM,WAAW,wBAAwB;AACpE,MAAI,KAAK,QAAQ,eAAe,KAAK,MAAM;AACzC,YAAQ,KAAK,MAAM;AAAA,MACnB,KAAK;AACH,YAAI,KAAK,WAAW,KAAK,SAAS,SAChC;AAAE,eAAK,MAAM,KAAK,OAAO,2DAA2D;AAAA,QAAG;AACzF;AAAA,MAEF,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH;AAAA,MAEF,KAAK;AACH,aAAK,OAAO;AACZ,YAAI,wBAAwB;AAAE,eAAK,mBAAmB,wBAAwB,IAAI;AAAA,QAAG;AACrF,iBAAS,IAAI,GAAG,OAAO,KAAK,YAAY,IAAI,KAAK,QAAQ,KAAK,GAAG;AAC/D,cAAI,OAAO,KAAK,CAAC;AAEnB,eAAK,aAAa,MAAM,SAAS;AAM/B,cACE,KAAK,SAAS,kBACb,KAAK,SAAS,SAAS,kBAAkB,KAAK,SAAS,SAAS,kBACjE;AACA,iBAAK,MAAM,KAAK,SAAS,OAAO,kBAAkB;AAAA,UACpD;AAAA,QACF;AACA;AAAA,MAEF,KAAK;AAEH,YAAI,KAAK,SAAS,QAAQ;AAAE,eAAK,MAAM,KAAK,IAAI,OAAO,+CAA+C;AAAA,QAAG;AACzG,aAAK,aAAa,KAAK,OAAO,SAAS;AACvC;AAAA,MAEF,KAAK;AACH,aAAK,OAAO;AACZ,YAAI,wBAAwB;AAAE,eAAK,mBAAmB,wBAAwB,IAAI;AAAA,QAAG;AACrF,aAAK,iBAAiB,KAAK,UAAU,SAAS;AAC9C;AAAA,MAEF,KAAK;AACH,aAAK,OAAO;AACZ,aAAK,aAAa,KAAK,UAAU,SAAS;AAC1C,YAAI,KAAK,SAAS,SAAS,qBACzB;AAAE,eAAK,MAAM,KAAK,SAAS,OAAO,2CAA2C;AAAA,QAAG;AAClF;AAAA,MAEF,KAAK;AACH,YAAI,KAAK,aAAa,KAAK;AAAE,eAAK,MAAM,KAAK,KAAK,KAAK,6DAA6D;AAAA,QAAG;AACvH,aAAK,OAAO;AACZ,eAAO,KAAK;AACZ,aAAK,aAAa,KAAK,MAAM,SAAS;AACtC;AAAA,MAEF,KAAK;AACH,aAAK,aAAa,KAAK,YAAY,WAAW,sBAAsB;AACpE;AAAA,MAEF,KAAK;AACH,aAAK,iBAAiB,KAAK,OAAO,mDAAmD;AACrF;AAAA,MAEF,KAAK;AACH,YAAI,CAAC,WAAW;AAAE;AAAA,QAAM;AAAA,MAE1B;AACE,aAAK,MAAM,KAAK,OAAO,qBAAqB;AAAA,IAC9C;AAAA,EACF,WAAW,wBAAwB;AAAE,SAAK,mBAAmB,wBAAwB,IAAI;AAAA,EAAG;AAC5F,SAAO;AACT;AAIA,KAAK,mBAAmB,SAAS,UAAU,WAAW;AACpD,MAAI,MAAM,SAAS;AACnB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,QAAI,MAAM,SAAS,CAAC;AACpB,QAAI,KAAK;AAAE,WAAK,aAAa,KAAK,SAAS;AAAA,IAAG;AAAA,EAChD;AACA,MAAI,KAAK;AACP,QAAI,OAAO,SAAS,MAAM,CAAC;AAC3B,QAAI,KAAK,QAAQ,gBAAgB,KAAK,aAAa,QAAQ,KAAK,SAAS,iBAAiB,KAAK,SAAS,SAAS,cAC/G;AAAE,WAAK,WAAW,KAAK,SAAS,KAAK;AAAA,IAAG;AAAA,EAC5C;AACA,SAAO;AACT;AAIA,KAAK,cAAc,SAAS,wBAAwB;AAClD,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,OAAK,WAAW,KAAK,iBAAiB,OAAO,sBAAsB;AACnE,SAAO,KAAK,WAAW,MAAM,eAAe;AAC9C;AAEA,KAAK,mBAAmB,WAAW;AACjC,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AAGV,MAAI,KAAK,QAAQ,gBAAgB,KAAK,KAAK,SAAS,QAAQ,MAC1D;AAAE,SAAK,WAAW;AAAA,EAAG;AAEvB,OAAK,WAAW,KAAK,iBAAiB;AAEtC,SAAO,KAAK,WAAW,MAAM,aAAa;AAC5C;AAIA,KAAK,mBAAmB,WAAW;AACjC,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,YAAQ,KAAK,MAAM;AAAA,MACnB,KAAK,QAAQ;AACX,YAAI,OAAO,KAAK,UAAU;AAC1B,aAAK,KAAK;AACV,aAAK,WAAW,KAAK,iBAAiB,QAAQ,UAAU,MAAM,IAAI;AAClE,eAAO,KAAK,WAAW,MAAM,cAAc;AAAA,MAE7C,KAAK,QAAQ;AACX,eAAO,KAAK,SAAS,IAAI;AAAA,IAC3B;AAAA,EACF;AACA,SAAO,KAAK,WAAW;AACzB;AAEA,KAAK,mBAAmB,SAAS,OAAO,YAAY,oBAAoB,gBAAgB;AACtF,MAAI,OAAO,CAAC,GAAG,QAAQ;AACvB,SAAO,CAAC,KAAK,IAAI,KAAK,GAAG;AACvB,QAAI,OAAO;AAAE,cAAQ;AAAA,IAAO,OACvB;AAAE,WAAK,OAAO,QAAQ,KAAK;AAAA,IAAG;AACnC,QAAI,cAAc,KAAK,SAAS,QAAQ,OAAO;AAC7C,WAAK,KAAK,IAAI;AAAA,IAChB,WAAW,sBAAsB,KAAK,mBAAmB,KAAK,GAAG;AAC/D;AAAA,IACF,WAAW,KAAK,SAAS,QAAQ,UAAU;AACzC,UAAI,OAAO,KAAK,iBAAiB;AACjC,WAAK,qBAAqB,IAAI;AAC9B,WAAK,KAAK,IAAI;AACd,UAAI,KAAK,SAAS,QAAQ,OAAO;AAAE,aAAK,iBAAiB,KAAK,OAAO,+CAA+C;AAAA,MAAG;AACvH,WAAK,OAAO,KAAK;AACjB;AAAA,IACF,OAAO;AACL,WAAK,KAAK,KAAK,wBAAwB,cAAc,CAAC;AAAA,IACxD;AAAA,EACF;AACA,SAAO;AACT;AAEA,KAAK,0BAA0B,SAAS,gBAAgB;AACtD,MAAI,OAAO,KAAK,kBAAkB,KAAK,OAAO,KAAK,QAAQ;AAC3D,OAAK,qBAAqB,IAAI;AAC9B,SAAO;AACT;AAEA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,SAAO;AACT;AAIA,KAAK,oBAAoB,SAAS,UAAU,UAAU,MAAM;AAC1D,SAAO,QAAQ,KAAK,iBAAiB;AACrC,MAAI,KAAK,QAAQ,cAAc,KAAK,CAAC,KAAK,IAAI,QAAQ,EAAE,GAAG;AAAE,WAAO;AAAA,EAAK;AACzE,MAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,OAAK,OAAO;AACZ,OAAK,QAAQ,KAAK,iBAAiB;AACnC,SAAO,KAAK,WAAW,MAAM,mBAAmB;AAClD;AAkEA,KAAK,kBAAkB,SAAS,MAAM,aAAa,cAAc;AAC/D,MAAK,gBAAgB,OAAS,eAAc;AAE5C,MAAI,SAAS,gBAAgB;AAE7B,UAAQ,KAAK,MAAM;AAAA,IACnB,KAAK;AACH,UAAI,KAAK,UAAU,KAAK,wBAAwB,KAAK,KAAK,IAAI,GAC5D;AAAE,aAAK,iBAAiB,KAAK,QAAQ,SAAS,aAAa,mBAAmB,KAAK,OAAO,iBAAiB;AAAA,MAAG;AAChH,UAAI,QAAQ;AACV,YAAI,gBAAgB,gBAAgB,KAAK,SAAS,OAChD;AAAE,eAAK,iBAAiB,KAAK,OAAO,6CAA6C;AAAA,QAAG;AACtF,YAAI,cAAc;AAChB,cAAI,OAAO,cAAc,KAAK,IAAI,GAChC;AAAE,iBAAK,iBAAiB,KAAK,OAAO,qBAAqB;AAAA,UAAG;AAC9D,uBAAa,KAAK,IAAI,IAAI;AAAA,QAC5B;AACA,YAAI,gBAAgB,cAAc;AAAE,eAAK,YAAY,KAAK,MAAM,aAAa,KAAK,KAAK;AAAA,QAAG;AAAA,MAC5F;AACA;AAAA,IAEF,KAAK;AACH,WAAK,iBAAiB,KAAK,OAAO,mDAAmD;AACrF;AAAA,IAEF,KAAK;AACH,UAAI,QAAQ;AAAE,aAAK,iBAAiB,KAAK,OAAO,2BAA2B;AAAA,MAAG;AAC9E;AAAA,IAEF,KAAK;AACH,UAAI,QAAQ;AAAE,aAAK,iBAAiB,KAAK,OAAO,kCAAkC;AAAA,MAAG;AACrF,aAAO,KAAK,gBAAgB,KAAK,YAAY,aAAa,YAAY;AAAA,IAExE;AACE,WAAK,MAAM,KAAK,QAAQ,SAAS,YAAY,kBAAkB,SAAS;AAAA,EAC1E;AACF;AAEA,KAAK,mBAAmB,SAAS,MAAM,aAAa,cAAc;AAChE,MAAK,gBAAgB,OAAS,eAAc;AAE5C,UAAQ,KAAK,MAAM;AAAA,IACnB,KAAK;AACH,eAAS,IAAI,GAAG,OAAO,KAAK,YAAY,IAAI,KAAK,QAAQ,KAAK,GAAG;AAC/D,YAAI,OAAO,KAAK,CAAC;AAEnB,aAAK,sBAAsB,MAAM,aAAa,YAAY;AAAA,MAC1D;AACA;AAAA,IAEF,KAAK;AACH,eAAS,MAAM,GAAG,SAAS,KAAK,UAAU,MAAM,OAAO,QAAQ,OAAO,GAAG;AACvE,YAAI,OAAO,OAAO,GAAG;AAEvB,YAAI,MAAM;AAAE,eAAK,sBAAsB,MAAM,aAAa,YAAY;AAAA,QAAG;AAAA,MACzE;AACA;AAAA,IAEF;AACE,WAAK,gBAAgB,MAAM,aAAa,YAAY;AAAA,EACtD;AACF;AAEA,KAAK,wBAAwB,SAAS,MAAM,aAAa,cAAc;AACrE,MAAK,gBAAgB,OAAS,eAAc;AAE5C,UAAQ,KAAK,MAAM;AAAA,IACnB,KAAK;AAEH,WAAK,sBAAsB,KAAK,OAAO,aAAa,YAAY;AAChE;AAAA,IAEF,KAAK;AACH,WAAK,iBAAiB,KAAK,MAAM,aAAa,YAAY;AAC1D;AAAA,IAEF,KAAK;AACH,WAAK,iBAAiB,KAAK,UAAU,aAAa,YAAY;AAC9D;AAAA,IAEF;AACE,WAAK,iBAAiB,MAAM,aAAa,YAAY;AAAA,EACvD;AACF;AAOA,IAAI,aAAa,SAASI,YAAW,OAAO,QAAQ,eAAe,UAAU,WAAW;AACtF,OAAK,QAAQ;AACb,OAAK,SAAS,CAAC,CAAC;AAChB,OAAK,gBAAgB,CAAC,CAAC;AACvB,OAAK,WAAW;AAChB,OAAK,YAAY,CAAC,CAAC;AACrB;AAEA,IAAI,QAAQ;AAAA,EACV,QAAQ,IAAI,WAAW,KAAK,KAAK;AAAA,EACjC,QAAQ,IAAI,WAAW,KAAK,IAAI;AAAA,EAChC,QAAQ,IAAI,WAAW,MAAM,KAAK;AAAA,EAClC,QAAQ,IAAI,WAAW,KAAK,KAAK;AAAA,EACjC,QAAQ,IAAI,WAAW,KAAK,IAAI;AAAA,EAChC,QAAQ,IAAI,WAAW,KAAK,MAAM,MAAM,SAAU,GAAG;AAAE,WAAO,EAAE,qBAAqB;AAAA,EAAG,CAAC;AAAA,EACzF,QAAQ,IAAI,WAAW,YAAY,KAAK;AAAA,EACxC,QAAQ,IAAI,WAAW,YAAY,IAAI;AAAA,EACvC,YAAY,IAAI,WAAW,YAAY,MAAM,OAAO,MAAM,IAAI;AAAA,EAC9D,OAAO,IAAI,WAAW,YAAY,OAAO,OAAO,MAAM,IAAI;AAC5D;AAEA,IAAI,OAAO,OAAO;AAElB,KAAK,iBAAiB,WAAW;AAC/B,SAAO,CAAC,MAAM,MAAM;AACtB;AAEA,KAAK,aAAa,WAAW;AAC3B,SAAO,KAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC;AAC7C;AAEA,KAAK,eAAe,SAAS,UAAU;AACrC,MAAI,SAAS,KAAK,WAAW;AAC7B,MAAI,WAAW,MAAM,UAAU,WAAW,MAAM,QAC9C;AAAE,WAAO;AAAA,EAAK;AAChB,MAAI,aAAa,QAAQ,UAAU,WAAW,MAAM,UAAU,WAAW,MAAM,SAC7E;AAAE,WAAO,CAAC,OAAO;AAAA,EAAO;AAK1B,MAAI,aAAa,QAAQ,WAAW,aAAa,QAAQ,QAAQ,KAAK,aACpE;AAAE,WAAO,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC;AAAA,EAAE;AACzE,MAAI,aAAa,QAAQ,SAAS,aAAa,QAAQ,QAAQ,aAAa,QAAQ,OAAO,aAAa,QAAQ,UAAU,aAAa,QAAQ,OAC7I;AAAE,WAAO;AAAA,EAAK;AAChB,MAAI,aAAa,QAAQ,QACvB;AAAE,WAAO,WAAW,MAAM;AAAA,EAAO;AACnC,MAAI,aAAa,QAAQ,QAAQ,aAAa,QAAQ,UAAU,aAAa,QAAQ,MACnF;AAAE,WAAO;AAAA,EAAM;AACjB,SAAO,CAAC,KAAK;AACf;AAEA,KAAK,qBAAqB,WAAW;AACnC,WAAS,IAAI,KAAK,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;AACjD,QAAI,UAAU,KAAK,QAAQ,CAAC;AAC5B,QAAI,QAAQ,UAAU,YACpB;AAAE,aAAO,QAAQ;AAAA,IAAU;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,KAAK,gBAAgB,SAAS,UAAU;AACtC,MAAI,QAAQ,OAAO,KAAK;AACxB,MAAI,KAAK,WAAW,aAAa,QAAQ,KACvC;AAAE,SAAK,cAAc;AAAA,EAAO,WACrB,SAAS,KAAK,eACrB;AAAE,WAAO,KAAK,MAAM,QAAQ;AAAA,EAAG,OAE/B;AAAE,SAAK,cAAc,KAAK;AAAA,EAAY;AAC1C;AAIA,KAAK,kBAAkB,SAAS,UAAU;AACxC,MAAI,KAAK,WAAW,MAAM,UAAU;AAClC,SAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC,IAAI;AAAA,EAC1C;AACF;AAIA,QAAQ,OAAO,gBAAgB,QAAQ,OAAO,gBAAgB,WAAW;AACvE,MAAI,KAAK,QAAQ,WAAW,GAAG;AAC7B,SAAK,cAAc;AACnB;AAAA,EACF;AACA,MAAI,MAAM,KAAK,QAAQ,IAAI;AAC3B,MAAI,QAAQ,MAAM,UAAU,KAAK,WAAW,EAAE,UAAU,YAAY;AAClE,UAAM,KAAK,QAAQ,IAAI;AAAA,EACzB;AACA,OAAK,cAAc,CAAC,IAAI;AAC1B;AAEA,QAAQ,OAAO,gBAAgB,SAAS,UAAU;AAChD,OAAK,QAAQ,KAAK,KAAK,aAAa,QAAQ,IAAI,MAAM,SAAS,MAAM,MAAM;AAC3E,OAAK,cAAc;AACrB;AAEA,QAAQ,aAAa,gBAAgB,WAAW;AAC9C,OAAK,QAAQ,KAAK,MAAM,MAAM;AAC9B,OAAK,cAAc;AACrB;AAEA,QAAQ,OAAO,gBAAgB,SAAS,UAAU;AAChD,MAAI,kBAAkB,aAAa,QAAQ,OAAO,aAAa,QAAQ,QAAQ,aAAa,QAAQ,SAAS,aAAa,QAAQ;AAClI,OAAK,QAAQ,KAAK,kBAAkB,MAAM,SAAS,MAAM,MAAM;AAC/D,OAAK,cAAc;AACrB;AAEA,QAAQ,OAAO,gBAAgB,WAAW;AAE1C;AAEA,QAAQ,UAAU,gBAAgB,QAAQ,OAAO,gBAAgB,SAAS,UAAU;AAClF,MAAI,SAAS,cAAc,aAAa,QAAQ,SAC5C,EAAE,aAAa,QAAQ,QAAQ,KAAK,WAAW,MAAM,MAAM,WAC3D,EAAE,aAAa,QAAQ,WAAW,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC,MAC9F,GAAG,aAAa,QAAQ,SAAS,aAAa,QAAQ,WAAW,KAAK,WAAW,MAAM,MAAM,SAC/F;AAAE,SAAK,QAAQ,KAAK,MAAM,MAAM;AAAA,EAAG,OAEnC;AAAE,SAAK,QAAQ,KAAK,MAAM,MAAM;AAAA,EAAG;AACrC,OAAK,cAAc;AACrB;AAEA,QAAQ,MAAM,gBAAgB,WAAW;AACvC,MAAI,KAAK,WAAW,EAAE,UAAU,YAAY;AAAE,SAAK,QAAQ,IAAI;AAAA,EAAG;AAClE,OAAK,cAAc;AACrB;AAEA,QAAQ,UAAU,gBAAgB,WAAW;AAC3C,MAAI,KAAK,WAAW,MAAM,MAAM,QAC9B;AAAE,SAAK,QAAQ,IAAI;AAAA,EAAG,OAEtB;AAAE,SAAK,QAAQ,KAAK,MAAM,MAAM;AAAA,EAAG;AACrC,OAAK,cAAc;AACrB;AAEA,QAAQ,KAAK,gBAAgB,SAAS,UAAU;AAC9C,MAAI,aAAa,QAAQ,WAAW;AAClC,QAAI,QAAQ,KAAK,QAAQ,SAAS;AAClC,QAAI,KAAK,QAAQ,KAAK,MAAM,MAAM,QAChC;AAAE,WAAK,QAAQ,KAAK,IAAI,MAAM;AAAA,IAAY,OAE1C;AAAE,WAAK,QAAQ,KAAK,IAAI,MAAM;AAAA,IAAO;AAAA,EACzC;AACA,OAAK,cAAc;AACrB;AAEA,QAAQ,KAAK,gBAAgB,SAAS,UAAU;AAC9C,MAAI,UAAU;AACd,MAAI,KAAK,QAAQ,eAAe,KAAK,aAAa,QAAQ,KAAK;AAC7D,QAAI,KAAK,UAAU,QAAQ,CAAC,KAAK,eAC7B,KAAK,UAAU,WAAW,KAAK,mBAAmB,GACpD;AAAE,gBAAU;AAAA,IAAM;AAAA,EACtB;AACA,OAAK,cAAc;AACrB;AAqBA,IAAI,OAAO,OAAO;AAOlB,KAAK,iBAAiB,SAAS,MAAM,UAAU,wBAAwB;AACrE,MAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,iBACjD;AAAE;AAAA,EAAO;AACX,MAAI,KAAK,QAAQ,eAAe,MAAM,KAAK,YAAY,KAAK,UAAU,KAAK,YACzE;AAAE;AAAA,EAAO;AACX,MAAI,MAAM,KAAK;AACf,MAAI;AACJ,UAAQ,IAAI,MAAM;AAAA,IAClB,KAAK;AAAc,aAAO,IAAI;AAAM;AAAA,IACpC,KAAK;AAAW,aAAO,OAAO,IAAI,KAAK;AAAG;AAAA,IAC1C;AAAS;AAAA,EACT;AACA,MAAI,OAAO,KAAK;AAChB,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,QAAI,SAAS,eAAe,SAAS,QAAQ;AAC3C,UAAI,SAAS,OAAO;AAClB,YAAI,wBAAwB;AAC1B,cAAI,uBAAuB,cAAc,GAAG;AAC1C,mCAAuB,cAAc,IAAI;AAAA,UAC3C;AAAA,QACF,OAAO;AACL,eAAK,iBAAiB,IAAI,OAAO,oCAAoC;AAAA,QACvE;AAAA,MACF;AACA,eAAS,QAAQ;AAAA,IACnB;AACA;AAAA,EACF;AACA,SAAO,MAAM;AACb,MAAI,QAAQ,SAAS,IAAI;AACzB,MAAI,OAAO;AACT,QAAI;AACJ,QAAI,SAAS,QAAQ;AACnB,qBAAe,KAAK,UAAU,MAAM,QAAQ,MAAM,OAAO,MAAM;AAAA,IACjE,OAAO;AACL,qBAAe,MAAM,QAAQ,MAAM,IAAI;AAAA,IACzC;AACA,QAAI,cACF;AAAE,WAAK,iBAAiB,IAAI,OAAO,0BAA0B;AAAA,IAAG;AAAA,EACpE,OAAO;AACL,YAAQ,SAAS,IAAI,IAAI;AAAA,MACvB,MAAM;AAAA,MACN,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAAA,EACF;AACA,QAAM,IAAI,IAAI;AAChB;AAiBA,KAAK,kBAAkB,SAAS,SAAS,wBAAwB;AAC/D,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,OAAO,KAAK,iBAAiB,SAAS,sBAAsB;AAChE,MAAI,KAAK,SAAS,QAAQ,OAAO;AAC/B,QAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,SAAK,cAAc,CAAC,IAAI;AACxB,WAAO,KAAK,IAAI,QAAQ,KAAK,GAAG;AAAE,WAAK,YAAY,KAAK,KAAK,iBAAiB,SAAS,sBAAsB,CAAC;AAAA,IAAG;AACjH,WAAO,KAAK,WAAW,MAAM,oBAAoB;AAAA,EACnD;AACA,SAAO;AACT;AAKA,KAAK,mBAAmB,SAAS,SAAS,wBAAwB,gBAAgB;AAChF,MAAI,KAAK,aAAa,OAAO,GAAG;AAC9B,QAAI,KAAK,aAAa;AAAE,aAAO,KAAK,WAAW,OAAO;AAAA,IAAE,OAGnD;AAAE,WAAK,cAAc;AAAA,IAAO;AAAA,EACnC;AAEA,MAAI,yBAAyB,OAAO,iBAAiB,IAAI,mBAAmB,IAAI,iBAAiB;AACjG,MAAI,wBAAwB;AAC1B,qBAAiB,uBAAuB;AACxC,uBAAmB,uBAAuB;AAC1C,qBAAiB,uBAAuB;AACxC,2BAAuB,sBAAsB,uBAAuB,gBAAgB;AAAA,EACtF,OAAO;AACL,6BAAyB,IAAI;AAC7B,6BAAyB;AAAA,EAC3B;AAEA,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAQ,MAAM;AAC9D,SAAK,mBAAmB,KAAK;AAC7B,SAAK,2BAA2B,YAAY;AAAA,EAC9C;AACA,MAAI,OAAO,KAAK,sBAAsB,SAAS,sBAAsB;AACrE,MAAI,gBAAgB;AAAE,WAAO,eAAe,KAAK,MAAM,MAAM,UAAU,QAAQ;AAAA,EAAG;AAClF,MAAI,KAAK,KAAK,UAAU;AACtB,QAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,SAAK,WAAW,KAAK;AACrB,QAAI,KAAK,SAAS,QAAQ,IACxB;AAAE,aAAO,KAAK,aAAa,MAAM,OAAO,sBAAsB;AAAA,IAAG;AACnE,QAAI,CAAC,wBAAwB;AAC3B,6BAAuB,sBAAsB,uBAAuB,gBAAgB,uBAAuB,cAAc;AAAA,IAC3H;AACA,QAAI,uBAAuB,mBAAmB,KAAK,OACjD;AAAE,6BAAuB,kBAAkB;AAAA,IAAI;AACjD,QAAI,KAAK,SAAS,QAAQ,IACxB;AAAE,WAAK,iBAAiB,IAAI;AAAA,IAAG,OAE/B;AAAE,WAAK,gBAAgB,IAAI;AAAA,IAAG;AAChC,SAAK,OAAO;AACZ,SAAK,KAAK;AACV,SAAK,QAAQ,KAAK,iBAAiB,OAAO;AAC1C,QAAI,iBAAiB,IAAI;AAAE,6BAAuB,cAAc;AAAA,IAAgB;AAChF,WAAO,KAAK,WAAW,MAAM,sBAAsB;AAAA,EACrD,OAAO;AACL,QAAI,wBAAwB;AAAE,WAAK,sBAAsB,wBAAwB,IAAI;AAAA,IAAG;AAAA,EAC1F;AACA,MAAI,iBAAiB,IAAI;AAAE,2BAAuB,sBAAsB;AAAA,EAAgB;AACxF,MAAI,mBAAmB,IAAI;AAAE,2BAAuB,gBAAgB;AAAA,EAAkB;AACtF,SAAO;AACT;AAIA,KAAK,wBAAwB,SAAS,SAAS,wBAAwB;AACrE,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,OAAO,KAAK,aAAa,SAAS,sBAAsB;AAC5D,MAAI,KAAK,sBAAsB,sBAAsB,GAAG;AAAE,WAAO;AAAA,EAAK;AACtE,MAAI,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC9B,QAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,SAAK,OAAO;AACZ,SAAK,aAAa,KAAK,iBAAiB;AACxC,SAAK,OAAO,QAAQ,KAAK;AACzB,SAAK,YAAY,KAAK,iBAAiB,OAAO;AAC9C,WAAO,KAAK,WAAW,MAAM,uBAAuB;AAAA,EACtD;AACA,SAAO;AACT;AAIA,KAAK,eAAe,SAAS,SAAS,wBAAwB;AAC5D,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,OAAO,KAAK,gBAAgB,wBAAwB,OAAO,OAAO,OAAO;AAC7E,MAAI,KAAK,sBAAsB,sBAAsB,GAAG;AAAE,WAAO;AAAA,EAAK;AACtE,SAAO,KAAK,UAAU,YAAY,KAAK,SAAS,4BAA4B,OAAO,KAAK,YAAY,MAAM,UAAU,UAAU,IAAI,OAAO;AAC3I;AAQA,KAAK,cAAc,SAAS,MAAM,cAAc,cAAc,SAAS,SAAS;AAC9E,MAAI,OAAO,KAAK,KAAK;AACrB,MAAI,QAAQ,SAAS,CAAC,WAAW,KAAK,SAAS,QAAQ,MAAM;AAC3D,QAAI,OAAO,SAAS;AAClB,UAAI,UAAU,KAAK,SAAS,QAAQ,aAAa,KAAK,SAAS,QAAQ;AACvE,UAAI,WAAW,KAAK,SAAS,QAAQ;AACrC,UAAI,UAAU;AAGZ,eAAO,QAAQ,WAAW;AAAA,MAC5B;AACA,UAAI,KAAK,KAAK;AACd,WAAK,KAAK;AACV,UAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,UAAI,QAAQ,KAAK,YAAY,KAAK,gBAAgB,MAAM,OAAO,OAAO,OAAO,GAAG,UAAU,UAAU,MAAM,OAAO;AACjH,UAAI,OAAO,KAAK,YAAY,cAAc,cAAc,MAAM,OAAO,IAAI,WAAW,QAAQ;AAC5F,UAAK,WAAW,KAAK,SAAS,QAAQ,YAAc,aAAa,KAAK,SAAS,QAAQ,aAAa,KAAK,SAAS,QAAQ,aAAc;AACtI,aAAK,iBAAiB,KAAK,OAAO,0FAA0F;AAAA,MAC9H;AACA,aAAO,KAAK,YAAY,MAAM,cAAc,cAAc,SAAS,OAAO;AAAA,IAC5E;AAAA,EACF;AACA,SAAO;AACT;AAEA,KAAK,cAAc,SAAS,UAAU,UAAU,MAAM,OAAO,IAAI,SAAS;AACxE,MAAI,MAAM,SAAS,qBAAqB;AAAE,SAAK,MAAM,MAAM,OAAO,+DAA+D;AAAA,EAAG;AACpI,MAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,OAAK,OAAO;AACZ,OAAK,WAAW;AAChB,OAAK,QAAQ;AACb,SAAO,KAAK,WAAW,MAAM,UAAU,sBAAsB,kBAAkB;AACjF;AAIA,KAAK,kBAAkB,SAAS,wBAAwB,UAAU,QAAQ,SAAS;AACjF,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK,UAAU;AACrD,MAAI,KAAK,aAAa,OAAO,KAAK,KAAK,UAAU;AAC/C,WAAO,KAAK,WAAW,OAAO;AAC9B,eAAW;AAAA,EACb,WAAW,KAAK,KAAK,QAAQ;AAC3B,QAAI,OAAO,KAAK,UAAU,GAAG,SAAS,KAAK,SAAS,QAAQ;AAC5D,SAAK,WAAW,KAAK;AACrB,SAAK,SAAS;AACd,SAAK,KAAK;AACV,SAAK,WAAW,KAAK,gBAAgB,MAAM,MAAM,QAAQ,OAAO;AAChE,SAAK,sBAAsB,wBAAwB,IAAI;AACvD,QAAI,QAAQ;AAAE,WAAK,gBAAgB,KAAK,QAAQ;AAAA,IAAG,WAC1C,KAAK,UAAU,KAAK,aAAa,YAAY,sBAAsB,KAAK,QAAQ,GACvF;AAAE,WAAK,iBAAiB,KAAK,OAAO,wCAAwC;AAAA,IAAG,WACxE,KAAK,aAAa,YAAY,qBAAqB,KAAK,QAAQ,GACvE;AAAE,WAAK,iBAAiB,KAAK,OAAO,mCAAmC;AAAA,IAAG,OACvE;AAAE,iBAAW;AAAA,IAAM;AACxB,WAAO,KAAK,WAAW,MAAM,SAAS,qBAAqB,iBAAiB;AAAA,EAC9E,WAAW,CAAC,YAAY,KAAK,SAAS,QAAQ,WAAW;AACvD,SAAK,WAAW,KAAK,iBAAiB,WAAW,MAAM,KAAK,QAAQ,oBAAoB;AAAE,WAAK,WAAW;AAAA,IAAG;AAC7G,WAAO,KAAK,kBAAkB;AAE9B,QAAI,KAAK,SAAS,QAAQ,KAAK;AAAE,WAAK,WAAW;AAAA,IAAG;AAAA,EACtD,OAAO;AACL,WAAO,KAAK,oBAAoB,wBAAwB,OAAO;AAC/D,QAAI,KAAK,sBAAsB,sBAAsB,GAAG;AAAE,aAAO;AAAA,IAAK;AACtE,WAAO,KAAK,KAAK,WAAW,CAAC,KAAK,mBAAmB,GAAG;AACtD,UAAI,SAAS,KAAK,YAAY,UAAU,QAAQ;AAChD,aAAO,WAAW,KAAK;AACvB,aAAO,SAAS;AAChB,aAAO,WAAW;AAClB,WAAK,gBAAgB,IAAI;AACzB,WAAK,KAAK;AACV,aAAO,KAAK,WAAW,QAAQ,kBAAkB;AAAA,IACnD;AAAA,EACF;AAEA,MAAI,CAAC,UAAU,KAAK,IAAI,QAAQ,QAAQ,GAAG;AACzC,QAAI,UACF;AAAE,WAAK,WAAW,KAAK,YAAY;AAAA,IAAG,OAEtC;AAAE,aAAO,KAAK,YAAY,UAAU,UAAU,MAAM,KAAK,gBAAgB,MAAM,OAAO,OAAO,OAAO,GAAG,MAAM,KAAK;AAAA,IAAE;AAAA,EACxH,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,SAAS,sBAAsB,MAAM;AACnC,SACE,KAAK,SAAS,gBACd,KAAK,SAAS,6BAA6B,sBAAsB,KAAK,UAAU;AAEpF;AAEA,SAAS,qBAAqB,MAAM;AAClC,SACE,KAAK,SAAS,sBAAsB,KAAK,SAAS,SAAS,uBAC3D,KAAK,SAAS,qBAAqB,qBAAqB,KAAK,UAAU,KACvE,KAAK,SAAS,6BAA6B,qBAAqB,KAAK,UAAU;AAEnF;AAIA,KAAK,sBAAsB,SAAS,wBAAwB,SAAS;AACnE,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,MAAI,OAAO,KAAK,cAAc,wBAAwB,OAAO;AAC7D,MAAI,KAAK,SAAS,6BAA6B,KAAK,MAAM,MAAM,KAAK,cAAc,KAAK,UAAU,MAAM,KACtG;AAAE,WAAO;AAAA,EAAK;AAChB,MAAI,SAAS,KAAK,gBAAgB,MAAM,UAAU,UAAU,OAAO,OAAO;AAC1E,MAAI,0BAA0B,OAAO,SAAS,oBAAoB;AAChE,QAAI,uBAAuB,uBAAuB,OAAO,OAAO;AAAE,6BAAuB,sBAAsB;AAAA,IAAI;AACnH,QAAI,uBAAuB,qBAAqB,OAAO,OAAO;AAAE,6BAAuB,oBAAoB;AAAA,IAAI;AAC/G,QAAI,uBAAuB,iBAAiB,OAAO,OAAO;AAAE,6BAAuB,gBAAgB;AAAA,IAAI;AAAA,EACzG;AACA,SAAO;AACT;AAEA,KAAK,kBAAkB,SAAS,MAAM,UAAU,UAAU,SAAS,SAAS;AAC1E,MAAI,kBAAkB,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,gBAAgB,KAAK,SAAS,WAC/F,KAAK,eAAe,KAAK,OAAO,CAAC,KAAK,mBAAmB,KAAK,KAAK,MAAM,KAAK,UAAU,KACxF,KAAK,qBAAqB,KAAK;AACnC,MAAI,kBAAkB;AAEtB,SAAO,MAAM;AACX,QAAI,UAAU,KAAK,eAAe,MAAM,UAAU,UAAU,SAAS,iBAAiB,iBAAiB,OAAO;AAE9G,QAAI,QAAQ,UAAU;AAAE,wBAAkB;AAAA,IAAM;AAChD,QAAI,YAAY,QAAQ,QAAQ,SAAS,2BAA2B;AAClE,UAAI,iBAAiB;AACnB,YAAI,YAAY,KAAK,YAAY,UAAU,QAAQ;AACnD,kBAAU,aAAa;AACvB,kBAAU,KAAK,WAAW,WAAW,iBAAiB;AAAA,MACxD;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AACF;AAEA,KAAK,wBAAwB,WAAW;AACtC,SAAO,CAAC,KAAK,mBAAmB,KAAK,KAAK,IAAI,QAAQ,KAAK;AAC7D;AAEA,KAAK,2BAA2B,SAAS,UAAU,UAAU,UAAU,SAAS;AAC9E,SAAO,KAAK,qBAAqB,KAAK,YAAY,UAAU,QAAQ,GAAG,UAAU,MAAM,OAAO;AAChG;AAEA,KAAK,iBAAiB,SAAS,MAAM,UAAU,UAAU,SAAS,iBAAiB,iBAAiB,SAAS;AAC3G,MAAI,oBAAoB,KAAK,QAAQ,eAAe;AACpD,MAAI,WAAW,qBAAqB,KAAK,IAAI,QAAQ,WAAW;AAChE,MAAI,WAAW,UAAU;AAAE,SAAK,MAAM,KAAK,cAAc,kEAAkE;AAAA,EAAG;AAE9H,MAAI,WAAW,KAAK,IAAI,QAAQ,QAAQ;AACxC,MAAI,YAAa,YAAY,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAQ,aAAc,KAAK,IAAI,QAAQ,GAAG,GAAG;AACtH,QAAI,OAAO,KAAK,YAAY,UAAU,QAAQ;AAC9C,SAAK,SAAS;AACd,QAAI,UAAU;AACZ,WAAK,WAAW,KAAK,gBAAgB;AACrC,WAAK,OAAO,QAAQ,QAAQ;AAAA,IAC9B,WAAW,KAAK,SAAS,QAAQ,aAAa,KAAK,SAAS,SAAS;AACnE,WAAK,WAAW,KAAK,kBAAkB;AAAA,IACzC,OAAO;AACL,WAAK,WAAW,KAAK,WAAW,KAAK,QAAQ,kBAAkB,OAAO;AAAA,IACxE;AACA,SAAK,WAAW,CAAC,CAAC;AAClB,QAAI,mBAAmB;AACrB,WAAK,WAAW;AAAA,IAClB;AACA,WAAO,KAAK,WAAW,MAAM,kBAAkB;AAAA,EACjD,WAAW,CAAC,WAAW,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC/C,QAAI,yBAAyB,IAAI,uBAAqB,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU,mBAAmB,KAAK;AACxI,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,gBAAgB;AACrB,QAAI,WAAW,KAAK,cAAc,QAAQ,QAAQ,KAAK,QAAQ,eAAe,GAAG,OAAO,sBAAsB;AAC9G,QAAI,mBAAmB,CAAC,YAAY,KAAK,sBAAsB,GAAG;AAChE,WAAK,mBAAmB,wBAAwB,KAAK;AACrD,WAAK,+BAA+B;AACpC,UAAI,KAAK,gBAAgB,GACvB;AAAE,aAAK,MAAM,KAAK,eAAe,2DAA2D;AAAA,MAAG;AACjG,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,WAAK,gBAAgB;AACrB,aAAO,KAAK,yBAAyB,UAAU,UAAU,UAAU,OAAO;AAAA,IAC5E;AACA,SAAK,sBAAsB,wBAAwB,IAAI;AACvD,SAAK,WAAW,eAAe,KAAK;AACpC,SAAK,WAAW,eAAe,KAAK;AACpC,SAAK,gBAAgB,oBAAoB,KAAK;AAC9C,QAAI,SAAS,KAAK,YAAY,UAAU,QAAQ;AAChD,WAAO,SAAS;AAChB,WAAO,YAAY;AACnB,QAAI,mBAAmB;AACrB,aAAO,WAAW;AAAA,IACpB;AACA,WAAO,KAAK,WAAW,QAAQ,gBAAgB;AAAA,EACjD,WAAW,KAAK,SAAS,QAAQ,WAAW;AAC1C,QAAI,YAAY,iBAAiB;AAC/B,WAAK,MAAM,KAAK,OAAO,2EAA2E;AAAA,IACpG;AACA,QAAI,SAAS,KAAK,YAAY,UAAU,QAAQ;AAChD,WAAO,MAAM;AACb,WAAO,QAAQ,KAAK,cAAc,EAAC,UAAU,KAAI,CAAC;AAClD,WAAO,KAAK,WAAW,QAAQ,0BAA0B;AAAA,EAC3D;AACA,SAAO;AACT;AAOA,KAAK,gBAAgB,SAAS,wBAAwB,SAAS,QAAQ;AAGrE,MAAI,KAAK,SAAS,QAAQ,OAAO;AAAE,SAAK,WAAW;AAAA,EAAG;AAEtD,MAAI,MAAM,aAAa,KAAK,qBAAqB,KAAK;AACtD,UAAQ,KAAK,MAAM;AAAA,IACnB,KAAK,QAAQ;AACX,UAAI,CAAC,KAAK,YACR;AAAE,aAAK,MAAM,KAAK,OAAO,kCAAkC;AAAA,MAAG;AAChE,aAAO,KAAK,UAAU;AACtB,WAAK,KAAK;AACV,UAAI,KAAK,SAAS,QAAQ,UAAU,CAAC,KAAK,kBACxC;AAAE,aAAK,MAAM,KAAK,OAAO,gDAAgD;AAAA,MAAG;AAO9E,UAAI,KAAK,SAAS,QAAQ,OAAO,KAAK,SAAS,QAAQ,YAAY,KAAK,SAAS,QAAQ,QACvF;AAAE,aAAK,WAAW;AAAA,MAAG;AACvB,aAAO,KAAK,WAAW,MAAM,OAAO;AAAA,IAEtC,KAAK,QAAQ;AACX,aAAO,KAAK,UAAU;AACtB,WAAK,KAAK;AACV,aAAO,KAAK,WAAW,MAAM,gBAAgB;AAAA,IAE/C,KAAK,QAAQ;AACX,UAAI,WAAW,KAAK,OAAO,WAAW,KAAK,UAAU,cAAc,KAAK;AACxE,UAAI,KAAK,KAAK,WAAW,KAAK;AAC9B,UAAI,KAAK,QAAQ,eAAe,KAAK,CAAC,eAAe,GAAG,SAAS,WAAW,CAAC,KAAK,mBAAmB,KAAK,KAAK,IAAI,QAAQ,SAAS,GAAG;AACrI,aAAK,gBAAgB,MAAM,MAAM;AACjC,eAAO,KAAK,cAAc,KAAK,YAAY,UAAU,QAAQ,GAAG,GAAG,OAAO,MAAM,OAAO;AAAA,MACzF;AACA,UAAI,cAAc,CAAC,KAAK,mBAAmB,GAAG;AAC5C,YAAI,KAAK,IAAI,QAAQ,KAAK,GACxB;AAAE,iBAAO,KAAK,qBAAqB,KAAK,YAAY,UAAU,QAAQ,GAAG,CAAC,EAAE,GAAG,OAAO,OAAO;AAAA,QAAE;AACjG,YAAI,KAAK,QAAQ,eAAe,KAAK,GAAG,SAAS,WAAW,KAAK,SAAS,QAAQ,QAAQ,CAAC,gBACtF,CAAC,KAAK,4BAA4B,KAAK,UAAU,QAAQ,KAAK,cAAc;AAC/E,eAAK,KAAK,WAAW,KAAK;AAC1B,cAAI,KAAK,mBAAmB,KAAK,CAAC,KAAK,IAAI,QAAQ,KAAK,GACtD;AAAE,iBAAK,WAAW;AAAA,UAAG;AACvB,iBAAO,KAAK,qBAAqB,KAAK,YAAY,UAAU,QAAQ,GAAG,CAAC,EAAE,GAAG,MAAM,OAAO;AAAA,QAC5F;AAAA,MACF;AACA,aAAO;AAAA,IAET,KAAK,QAAQ;AACX,UAAI,QAAQ,KAAK;AACjB,aAAO,KAAK,aAAa,MAAM,KAAK;AACpC,WAAK,QAAQ,EAAC,SAAS,MAAM,SAAS,OAAO,MAAM,MAAK;AACxD,aAAO;AAAA,IAET,KAAK,QAAQ;AAAA,IAAK,KAAK,QAAQ;AAC7B,aAAO,KAAK,aAAa,KAAK,KAAK;AAAA,IAErC,KAAK,QAAQ;AAAA,IAAO,KAAK,QAAQ;AAAA,IAAO,KAAK,QAAQ;AACnD,aAAO,KAAK,UAAU;AACtB,WAAK,QAAQ,KAAK,SAAS,QAAQ,QAAQ,OAAO,KAAK,SAAS,QAAQ;AACxE,WAAK,MAAM,KAAK,KAAK;AACrB,WAAK,KAAK;AACV,aAAO,KAAK,WAAW,MAAM,SAAS;AAAA,IAExC,KAAK,QAAQ;AACX,UAAI,QAAQ,KAAK,OAAO,OAAO,KAAK,mCAAmC,YAAY,OAAO;AAC1F,UAAI,wBAAwB;AAC1B,YAAI,uBAAuB,sBAAsB,KAAK,CAAC,KAAK,qBAAqB,IAAI,GACnF;AAAE,iCAAuB,sBAAsB;AAAA,QAAO;AACxD,YAAI,uBAAuB,oBAAoB,GAC7C;AAAE,iCAAuB,oBAAoB;AAAA,QAAO;AAAA,MACxD;AACA,aAAO;AAAA,IAET,KAAK,QAAQ;AACX,aAAO,KAAK,UAAU;AACtB,WAAK,KAAK;AACV,WAAK,WAAW,KAAK,cAAc,QAAQ,UAAU,MAAM,MAAM,sBAAsB;AACvF,aAAO,KAAK,WAAW,MAAM,iBAAiB;AAAA,IAEhD,KAAK,QAAQ;AACX,WAAK,gBAAgB,MAAM,MAAM;AACjC,aAAO,KAAK,SAAS,OAAO,sBAAsB;AAAA,IAEpD,KAAK,QAAQ;AACX,aAAO,KAAK,UAAU;AACtB,WAAK,KAAK;AACV,aAAO,KAAK,cAAc,MAAM,CAAC;AAAA,IAEnC,KAAK,QAAQ;AACX,aAAO,KAAK,WAAW,KAAK,UAAU,GAAG,KAAK;AAAA,IAEhD,KAAK,QAAQ;AACX,aAAO,KAAK,SAAS;AAAA,IAEvB,KAAK,QAAQ;AACX,aAAO,KAAK,cAAc;AAAA,IAE5B,KAAK,QAAQ;AACX,UAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,eAAO,KAAK,gBAAgB,MAAM;AAAA,MACpC,OAAO;AACL,eAAO,KAAK,WAAW;AAAA,MACzB;AAAA,IAEF;AACE,aAAO,KAAK,qBAAqB;AAAA,EACnC;AACF;AAEA,KAAK,uBAAuB,WAAW;AACrC,OAAK,WAAW;AAClB;AAEA,KAAK,kBAAkB,SAAS,QAAQ;AACtC,MAAI,OAAO,KAAK,UAAU;AAI1B,MAAI,KAAK,aAAa;AAAE,SAAK,iBAAiB,KAAK,OAAO,mCAAmC;AAAA,EAAG;AAChG,OAAK,KAAK;AAEV,MAAI,KAAK,SAAS,QAAQ,UAAU,CAAC,QAAQ;AAC3C,WAAO,KAAK,mBAAmB,IAAI;AAAA,EACrC,WAAW,KAAK,SAAS,QAAQ,KAAK;AACpC,QAAI,OAAO,KAAK,YAAY,KAAK,OAAO,KAAK,OAAO,KAAK,IAAI,KAAK;AAClE,SAAK,OAAO;AACZ,SAAK,OAAO,KAAK,WAAW,MAAM,YAAY;AAC9C,WAAO,KAAK,gBAAgB,IAAI;AAAA,EAClC,OAAO;AACL,SAAK,WAAW;AAAA,EAClB;AACF;AAEA,KAAK,qBAAqB,SAAS,MAAM;AACvC,OAAK,KAAK;AAGV,OAAK,SAAS,KAAK,iBAAiB;AAEpC,MAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,QAAI,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC7B,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,CAAC,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAC5C,aAAK,UAAU,KAAK,iBAAiB;AACrC,YAAI,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC7B,eAAK,OAAO,QAAQ,KAAK;AACzB,cAAI,CAAC,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAC5C,iBAAK,WAAW;AAAA,UAClB;AAAA,QACF;AAAA,MACF,OAAO;AACL,aAAK,UAAU;AAAA,MACjB;AAAA,IACF,OAAO;AACL,WAAK,UAAU;AAAA,IACjB;AAAA,EACF,OAAO;AAEL,QAAI,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAC7B,UAAI,WAAW,KAAK;AACpB,UAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,KAAK,IAAI,QAAQ,MAAM,GAAG;AACvD,aAAK,iBAAiB,UAAU,2CAA2C;AAAA,MAC7E,OAAO;AACL,aAAK,WAAW,QAAQ;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAEA,SAAO,KAAK,WAAW,MAAM,kBAAkB;AACjD;AAEA,KAAK,kBAAkB,SAAS,MAAM;AACpC,OAAK,KAAK;AAEV,MAAI,cAAc,KAAK;AACvB,OAAK,WAAW,KAAK,WAAW,IAAI;AAEpC,MAAI,KAAK,SAAS,SAAS,QACzB;AAAE,SAAK,iBAAiB,KAAK,SAAS,OAAO,0DAA0D;AAAA,EAAG;AAC5G,MAAI,aACF;AAAE,SAAK,iBAAiB,KAAK,OAAO,mDAAmD;AAAA,EAAG;AAC5F,MAAI,KAAK,QAAQ,eAAe,YAAY,CAAC,KAAK,QAAQ,6BACxD;AAAE,SAAK,iBAAiB,KAAK,OAAO,2CAA2C;AAAA,EAAG;AAEpF,SAAO,KAAK,WAAW,MAAM,cAAc;AAC7C;AAEA,KAAK,eAAe,SAAS,OAAO;AAClC,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,QAAQ;AACb,OAAK,MAAM,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG;AAChD,MAAI,KAAK,IAAI,WAAW,KAAK,IAAI,SAAS,CAAC,MAAM,KAC/C;AAAE,SAAK,SAAS,KAAK,SAAS,OAAO,KAAK,MAAM,SAAS,IAAI,KAAK,IAAI,MAAM,GAAG,EAAE,EAAE,QAAQ,MAAM,EAAE;AAAA,EAAG;AACxG,OAAK,KAAK;AACV,SAAO,KAAK,WAAW,MAAM,SAAS;AACxC;AAEA,KAAK,uBAAuB,WAAW;AACrC,OAAK,OAAO,QAAQ,MAAM;AAC1B,MAAI,MAAM,KAAK,gBAAgB;AAC/B,OAAK,OAAO,QAAQ,MAAM;AAC1B,SAAO;AACT;AAEA,KAAK,mBAAmB,SAAS,UAAU;AACzC,SAAO,CAAC,KAAK,mBAAmB;AAClC;AAEA,KAAK,qCAAqC,SAAS,YAAY,SAAS;AACtE,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK,UAAU,KAAK,qBAAqB,KAAK,QAAQ,eAAe;AAC3G,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,SAAK,KAAK;AAEV,QAAI,gBAAgB,KAAK,OAAO,gBAAgB,KAAK;AACrD,QAAI,WAAW,CAAC,GAAG,QAAQ,MAAM,cAAc;AAC/C,QAAI,yBAAyB,IAAI,uBAAqB,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU;AAChH,SAAK,WAAW;AAChB,SAAK,WAAW;AAEhB,WAAO,KAAK,SAAS,QAAQ,QAAQ;AACnC,cAAQ,QAAQ,QAAQ,KAAK,OAAO,QAAQ,KAAK;AACjD,UAAI,sBAAsB,KAAK,mBAAmB,QAAQ,QAAQ,IAAI,GAAG;AACvE,sBAAc;AACd;AAAA,MACF,WAAW,KAAK,SAAS,QAAQ,UAAU;AACzC,sBAAc,KAAK;AACnB,iBAAS,KAAK,KAAK,eAAe,KAAK,iBAAiB,CAAC,CAAC;AAC1D,YAAI,KAAK,SAAS,QAAQ,OAAO;AAC/B,eAAK;AAAA,YACH,KAAK;AAAA,YACL;AAAA,UACF;AAAA,QACF;AACA;AAAA,MACF,OAAO;AACL,iBAAS,KAAK,KAAK,iBAAiB,OAAO,wBAAwB,KAAK,cAAc,CAAC;AAAA,MACzF;AAAA,IACF;AACA,QAAI,cAAc,KAAK,YAAY,cAAc,KAAK;AACtD,SAAK,OAAO,QAAQ,MAAM;AAE1B,QAAI,cAAc,KAAK,iBAAiB,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,GAAG;AAC5E,WAAK,mBAAmB,wBAAwB,KAAK;AACrD,WAAK,+BAA+B;AACpC,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,aAAO,KAAK,oBAAoB,UAAU,UAAU,UAAU,OAAO;AAAA,IACvE;AAEA,QAAI,CAAC,SAAS,UAAU,aAAa;AAAE,WAAK,WAAW,KAAK,YAAY;AAAA,IAAG;AAC3E,QAAI,aAAa;AAAE,WAAK,WAAW,WAAW;AAAA,IAAG;AACjD,SAAK,sBAAsB,wBAAwB,IAAI;AACvD,SAAK,WAAW,eAAe,KAAK;AACpC,SAAK,WAAW,eAAe,KAAK;AAEpC,QAAI,SAAS,SAAS,GAAG;AACvB,YAAM,KAAK,YAAY,eAAe,aAAa;AACnD,UAAI,cAAc;AAClB,WAAK,aAAa,KAAK,sBAAsB,aAAa,WAAW;AAAA,IACvE,OAAO;AACL,YAAM,SAAS,CAAC;AAAA,IAClB;AAAA,EACF,OAAO;AACL,UAAM,KAAK,qBAAqB;AAAA,EAClC;AAEA,MAAI,KAAK,QAAQ,gBAAgB;AAC/B,QAAI,MAAM,KAAK,YAAY,UAAU,QAAQ;AAC7C,QAAI,aAAa;AACjB,WAAO,KAAK,WAAW,KAAK,yBAAyB;AAAA,EACvD,OAAO;AACL,WAAO;AAAA,EACT;AACF;AAEA,KAAK,iBAAiB,SAAS,MAAM;AACnC,SAAO;AACT;AAEA,KAAK,sBAAsB,SAAS,UAAU,UAAU,UAAU,SAAS;AACzE,SAAO,KAAK,qBAAqB,KAAK,YAAY,UAAU,QAAQ,GAAG,UAAU,OAAO,OAAO;AACjG;AAQA,IAAI,QAAQ,CAAC;AAEb,KAAK,WAAW,WAAW;AACzB,MAAI,KAAK,aAAa;AAAE,SAAK,iBAAiB,KAAK,OAAO,gCAAgC;AAAA,EAAG;AAC7F,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,MAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,QAAQ,KAAK;AAC9D,QAAI,OAAO,KAAK,YAAY,KAAK,OAAO,KAAK,OAAO,KAAK,IAAI,KAAK;AAClE,SAAK,OAAO;AACZ,SAAK,OAAO,KAAK,WAAW,MAAM,YAAY;AAC9C,SAAK,KAAK;AACV,QAAI,cAAc,KAAK;AACvB,SAAK,WAAW,KAAK,WAAW,IAAI;AACpC,QAAI,KAAK,SAAS,SAAS,UACzB;AAAE,WAAK,iBAAiB,KAAK,SAAS,OAAO,sDAAsD;AAAA,IAAG;AACxG,QAAI,aACF;AAAE,WAAK,iBAAiB,KAAK,OAAO,kDAAkD;AAAA,IAAG;AAC3F,QAAI,CAAC,KAAK,mBACR;AAAE,WAAK,iBAAiB,KAAK,OAAO,mEAAmE;AAAA,IAAG;AAC5G,WAAO,KAAK,WAAW,MAAM,cAAc;AAAA,EAC7C;AACA,MAAI,WAAW,KAAK,OAAO,WAAW,KAAK;AAC3C,OAAK,SAAS,KAAK,gBAAgB,KAAK,cAAc,MAAM,OAAO,IAAI,GAAG,UAAU,UAAU,MAAM,KAAK;AACzG,MAAI,KAAK,IAAI,QAAQ,MAAM,GAAG;AAAE,SAAK,YAAY,KAAK,cAAc,QAAQ,QAAQ,KAAK,QAAQ,eAAe,GAAG,KAAK;AAAA,EAAG,OACtH;AAAE,SAAK,YAAY;AAAA,EAAO;AAC/B,SAAO,KAAK,WAAW,MAAM,eAAe;AAC9C;AAIA,KAAK,uBAAuB,SAASJ,MAAK;AACxC,MAAI,WAAWA,KAAI;AAEnB,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,KAAK,SAAS,QAAQ,iBAAiB;AACzC,QAAI,CAAC,UAAU;AACb,WAAK,iBAAiB,KAAK,OAAO,kDAAkD;AAAA,IACtF;AACA,SAAK,QAAQ;AAAA,MACX,KAAK,KAAK,MAAM,QAAQ,UAAU,IAAI;AAAA,MACtC,QAAQ;AAAA,IACV;AAAA,EACF,OAAO;AACL,SAAK,QAAQ;AAAA,MACX,KAAK,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG,EAAE,QAAQ,UAAU,IAAI;AAAA,MAClE,QAAQ,KAAK;AAAA,IACf;AAAA,EACF;AACA,OAAK,KAAK;AACV,OAAK,OAAO,KAAK,SAAS,QAAQ;AAClC,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,gBAAgB,SAASA,MAAK;AACjC,MAAKA,SAAQ,OAAS,CAAAA,OAAM,CAAC;AAC7B,MAAI,WAAWA,KAAI;AAAU,MAAK,aAAa,OAAS,YAAW;AAEnE,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,OAAK,cAAc,CAAC;AACpB,MAAI,SAAS,KAAK,qBAAqB,EAAC,SAAkB,CAAC;AAC3D,OAAK,SAAS,CAAC,MAAM;AACrB,SAAO,CAAC,OAAO,MAAM;AACnB,QAAI,KAAK,SAAS,QAAQ,KAAK;AAAE,WAAK,MAAM,KAAK,KAAK,+BAA+B;AAAA,IAAG;AACxF,SAAK,OAAO,QAAQ,YAAY;AAChC,SAAK,YAAY,KAAK,KAAK,gBAAgB,CAAC;AAC5C,SAAK,OAAO,QAAQ,MAAM;AAC1B,SAAK,OAAO,KAAK,SAAS,KAAK,qBAAqB,EAAC,SAAkB,CAAC,CAAC;AAAA,EAC3E;AACA,OAAK,KAAK;AACV,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,cAAc,SAAS,MAAM;AAChC,SAAO,CAAC,KAAK,YAAY,KAAK,IAAI,SAAS,gBAAgB,KAAK,IAAI,SAAS,YAC1E,KAAK,SAAS,QAAQ,QAAQ,KAAK,SAAS,QAAQ,OAAO,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAQ,YAAY,KAAK,KAAK,WAAY,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,QAAQ,SAC3M,CAAC,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,KAAK,CAAC;AACjE;AAIA,KAAK,WAAW,SAAS,WAAW,wBAAwB;AAC1D,MAAI,OAAO,KAAK,UAAU,GAAG,QAAQ,MAAM,WAAW,CAAC;AACvD,OAAK,aAAa,CAAC;AACnB,OAAK,KAAK;AACV,SAAO,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG;AAChC,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,mBAAmB,QAAQ,MAAM,GAAG;AAAE;AAAA,MAAM;AAAA,IACxF,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,QAAI,OAAO,KAAK,cAAc,WAAW,sBAAsB;AAC/D,QAAI,CAAC,WAAW;AAAE,WAAK,eAAe,MAAM,UAAU,sBAAsB;AAAA,IAAG;AAC/E,SAAK,WAAW,KAAK,IAAI;AAAA,EAC3B;AACA,SAAO,KAAK,WAAW,MAAM,YAAY,kBAAkB,kBAAkB;AAC/E;AAEA,KAAK,gBAAgB,SAAS,WAAW,wBAAwB;AAC/D,MAAI,OAAO,KAAK,UAAU,GAAG,aAAa,SAAS,UAAU;AAC7D,MAAI,KAAK,QAAQ,eAAe,KAAK,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC/D,QAAI,WAAW;AACb,WAAK,WAAW,KAAK,WAAW,KAAK;AACrC,UAAI,KAAK,SAAS,QAAQ,OAAO;AAC/B,aAAK,iBAAiB,KAAK,OAAO,+CAA+C;AAAA,MACnF;AACA,aAAO,KAAK,WAAW,MAAM,aAAa;AAAA,IAC5C;AAEA,SAAK,WAAW,KAAK,iBAAiB,OAAO,sBAAsB;AAEnE,QAAI,KAAK,SAAS,QAAQ,SAAS,0BAA0B,uBAAuB,gBAAgB,GAAG;AACrG,6BAAuB,gBAAgB,KAAK;AAAA,IAC9C;AAEA,WAAO,KAAK,WAAW,MAAM,eAAe;AAAA,EAC9C;AACA,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,SAAK,SAAS;AACd,SAAK,YAAY;AACjB,QAAI,aAAa,wBAAwB;AACvC,iBAAW,KAAK;AAChB,iBAAW,KAAK;AAAA,IAClB;AACA,QAAI,CAAC,WACH;AAAE,oBAAc,KAAK,IAAI,QAAQ,IAAI;AAAA,IAAG;AAAA,EAC5C;AACA,MAAI,cAAc,KAAK;AACvB,OAAK,kBAAkB,IAAI;AAC3B,MAAI,CAAC,aAAa,CAAC,eAAe,KAAK,QAAQ,eAAe,KAAK,CAAC,eAAe,KAAK,YAAY,IAAI,GAAG;AACzG,cAAU;AACV,kBAAc,KAAK,QAAQ,eAAe,KAAK,KAAK,IAAI,QAAQ,IAAI;AACpE,SAAK,kBAAkB,IAAI;AAAA,EAC7B,OAAO;AACL,cAAU;AAAA,EACZ;AACA,OAAK,mBAAmB,MAAM,WAAW,aAAa,SAAS,UAAU,UAAU,wBAAwB,WAAW;AACtH,SAAO,KAAK,WAAW,MAAM,UAAU;AACzC;AAEA,KAAK,oBAAoB,SAAS,MAAM;AACtC,MAAI,OAAO,KAAK,IAAI;AACpB,OAAK,kBAAkB,IAAI;AAC3B,OAAK,QAAQ,KAAK,YAAY,KAAK;AACnC,OAAK,OAAO;AACZ,MAAI,aAAa,KAAK,SAAS,QAAQ,IAAI;AAC3C,MAAI,KAAK,MAAM,OAAO,WAAW,YAAY;AAC3C,QAAI,QAAQ,KAAK,MAAM;AACvB,QAAI,KAAK,SAAS,OAChB;AAAE,WAAK,iBAAiB,OAAO,8BAA8B;AAAA,IAAG,OAEhE;AAAE,WAAK,iBAAiB,OAAO,sCAAsC;AAAA,IAAG;AAAA,EAC5E,OAAO;AACL,QAAI,KAAK,SAAS,SAAS,KAAK,MAAM,OAAO,CAAC,EAAE,SAAS,eACvD;AAAE,WAAK,iBAAiB,KAAK,MAAM,OAAO,CAAC,EAAE,OAAO,+BAA+B;AAAA,IAAG;AAAA,EAC1F;AACF;AAEA,KAAK,qBAAqB,SAAS,MAAM,WAAW,aAAa,SAAS,UAAU,UAAU,wBAAwB,aAAa;AACjI,OAAK,eAAe,YAAY,KAAK,SAAS,QAAQ,OACpD;AAAE,SAAK,WAAW;AAAA,EAAG;AAEvB,MAAI,KAAK,IAAI,QAAQ,KAAK,GAAG;AAC3B,SAAK,QAAQ,YAAY,KAAK,kBAAkB,KAAK,OAAO,KAAK,QAAQ,IAAI,KAAK,iBAAiB,OAAO,sBAAsB;AAChI,SAAK,OAAO;AAAA,EACd,WAAW,KAAK,QAAQ,eAAe,KAAK,KAAK,SAAS,QAAQ,QAAQ;AACxE,QAAI,WAAW;AAAE,WAAK,WAAW;AAAA,IAAG;AACpC,SAAK,SAAS;AACd,SAAK,QAAQ,KAAK,YAAY,aAAa,OAAO;AAClD,SAAK,OAAO;AAAA,EACd,WAAW,CAAC,aAAa,CAAC,eACf,KAAK,QAAQ,eAAe,KAAK,CAAC,KAAK,YAAY,KAAK,IAAI,SAAS,iBACpE,KAAK,IAAI,SAAS,SAAS,KAAK,IAAI,SAAS,WAC7C,KAAK,SAAS,QAAQ,SAAS,KAAK,SAAS,QAAQ,UAAU,KAAK,SAAS,QAAQ,KAAK;AACpG,QAAI,eAAe,SAAS;AAAE,WAAK,WAAW;AAAA,IAAG;AACjD,SAAK,kBAAkB,IAAI;AAAA,EAC7B,WAAW,KAAK,QAAQ,eAAe,KAAK,CAAC,KAAK,YAAY,KAAK,IAAI,SAAS,cAAc;AAC5F,QAAI,eAAe,SAAS;AAAE,WAAK,WAAW;AAAA,IAAG;AACjD,SAAK,gBAAgB,KAAK,GAAG;AAC7B,QAAI,KAAK,IAAI,SAAS,WAAW,CAAC,KAAK,eACrC;AAAE,WAAK,gBAAgB;AAAA,IAAU;AACnC,QAAI,WAAW;AACb,WAAK,QAAQ,KAAK,kBAAkB,UAAU,UAAU,KAAK,SAAS,KAAK,GAAG,CAAC;AAAA,IACjF,WAAW,KAAK,SAAS,QAAQ,MAAM,wBAAwB;AAC7D,UAAI,uBAAuB,kBAAkB,GAC3C;AAAE,+BAAuB,kBAAkB,KAAK;AAAA,MAAO;AACzD,WAAK,QAAQ,KAAK,kBAAkB,UAAU,UAAU,KAAK,SAAS,KAAK,GAAG,CAAC;AAAA,IACjF,OAAO;AACL,WAAK,QAAQ,KAAK,SAAS,KAAK,GAAG;AAAA,IACrC;AACA,SAAK,OAAO;AACZ,SAAK,YAAY;AAAA,EACnB,OAAO;AAAE,SAAK,WAAW;AAAA,EAAG;AAC9B;AAEA,KAAK,oBAAoB,SAAS,MAAM;AACtC,MAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,QAAI,KAAK,IAAI,QAAQ,QAAQ,GAAG;AAC9B,WAAK,WAAW;AAChB,WAAK,MAAM,KAAK,iBAAiB;AACjC,WAAK,OAAO,QAAQ,QAAQ;AAC5B,aAAO,KAAK;AAAA,IACd,OAAO;AACL,WAAK,WAAW;AAAA,IAClB;AAAA,EACF;AACA,SAAO,KAAK,MAAM,KAAK,SAAS,QAAQ,OAAO,KAAK,SAAS,QAAQ,SAAS,KAAK,cAAc,IAAI,KAAK,WAAW,KAAK,QAAQ,kBAAkB,OAAO;AAC7J;AAIA,KAAK,eAAe,SAAS,MAAM;AACjC,OAAK,KAAK;AACV,MAAI,KAAK,QAAQ,eAAe,GAAG;AAAE,SAAK,YAAY,KAAK,aAAa;AAAA,EAAO;AAC/E,MAAI,KAAK,QAAQ,eAAe,GAAG;AAAE,SAAK,QAAQ;AAAA,EAAO;AAC3D;AAIA,KAAK,cAAc,SAAS,aAAa,SAAS,kBAAkB;AAClE,MAAI,OAAO,KAAK,UAAU,GAAG,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU,mBAAmB,KAAK;AAE/G,OAAK,aAAa,IAAI;AACtB,MAAI,KAAK,QAAQ,eAAe,GAC9B;AAAE,SAAK,YAAY;AAAA,EAAa;AAClC,MAAI,KAAK,QAAQ,eAAe,GAC9B;AAAE,SAAK,QAAQ,CAAC,CAAC;AAAA,EAAS;AAE5B,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,OAAK,WAAW,cAAc,SAAS,KAAK,SAAS,IAAI,eAAe,mBAAmB,qBAAqB,EAAE;AAElH,OAAK,OAAO,QAAQ,MAAM;AAC1B,OAAK,SAAS,KAAK,iBAAiB,QAAQ,QAAQ,OAAO,KAAK,QAAQ,eAAe,CAAC;AACxF,OAAK,+BAA+B;AACpC,OAAK,kBAAkB,MAAM,OAAO,MAAM,KAAK;AAE/C,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,SAAO,KAAK,WAAW,MAAM,oBAAoB;AACnD;AAIA,KAAK,uBAAuB,SAAS,MAAM,QAAQ,SAAS,SAAS;AACnE,MAAI,cAAc,KAAK,UAAU,cAAc,KAAK,UAAU,mBAAmB,KAAK;AAEtF,OAAK,WAAW,cAAc,SAAS,KAAK,IAAI,WAAW;AAC3D,OAAK,aAAa,IAAI;AACtB,MAAI,KAAK,QAAQ,eAAe,GAAG;AAAE,SAAK,QAAQ,CAAC,CAAC;AAAA,EAAS;AAE7D,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AAErB,OAAK,SAAS,KAAK,iBAAiB,QAAQ,IAAI;AAChD,OAAK,kBAAkB,MAAM,MAAM,OAAO,OAAO;AAEjD,OAAK,WAAW;AAChB,OAAK,WAAW;AAChB,OAAK,gBAAgB;AACrB,SAAO,KAAK,WAAW,MAAM,yBAAyB;AACxD;AAIA,KAAK,oBAAoB,SAAS,MAAM,iBAAiB,UAAU,SAAS;AAC1E,MAAI,eAAe,mBAAmB,KAAK,SAAS,QAAQ;AAC5D,MAAI,YAAY,KAAK,QAAQ,YAAY;AAEzC,MAAI,cAAc;AAChB,SAAK,OAAO,KAAK,iBAAiB,OAAO;AACzC,SAAK,aAAa;AAClB,SAAK,YAAY,MAAM,KAAK;AAAA,EAC9B,OAAO;AACL,QAAI,YAAY,KAAK,QAAQ,eAAe,KAAK,CAAC,KAAK,kBAAkB,KAAK,MAAM;AACpF,QAAI,CAAC,aAAa,WAAW;AAC3B,kBAAY,KAAK,gBAAgB,KAAK,GAAG;AAIzC,UAAI,aAAa,WACf;AAAE,aAAK,iBAAiB,KAAK,OAAO,2EAA2E;AAAA,MAAG;AAAA,IACtH;AAGA,QAAI,YAAY,KAAK;AACrB,SAAK,SAAS,CAAC;AACf,QAAI,WAAW;AAAE,WAAK,SAAS;AAAA,IAAM;AAIrC,SAAK,YAAY,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,mBAAmB,CAAC,YAAY,KAAK,kBAAkB,KAAK,MAAM,CAAC;AAEvH,QAAI,KAAK,UAAU,KAAK,IAAI;AAAE,WAAK,gBAAgB,KAAK,IAAI,YAAY;AAAA,IAAG;AAC3E,SAAK,OAAO,KAAK,WAAW,OAAO,QAAW,aAAa,CAAC,SAAS;AACrE,SAAK,aAAa;AAClB,SAAK,uBAAuB,KAAK,KAAK,IAAI;AAC1C,SAAK,SAAS;AAAA,EAChB;AACA,OAAK,UAAU;AACjB;AAEA,KAAK,oBAAoB,SAAS,QAAQ;AACxC,WAAS,IAAI,GAAG,OAAO,QAAQ,IAAI,KAAK,QAAQ,KAAK,GACnD;AACA,QAAI,QAAQ,KAAK,CAAC;AAElB,QAAI,MAAM,SAAS,cAAc;AAAE,aAAO;AAAA,IAC5C;AAAA,EAAE;AACF,SAAO;AACT;AAKA,KAAK,cAAc,SAAS,MAAM,iBAAiB;AACjD,MAAI,WAAW,uBAAO,OAAO,IAAI;AACjC,WAAS,IAAI,GAAG,OAAO,KAAK,QAAQ,IAAI,KAAK,QAAQ,KAAK,GACxD;AACA,QAAI,QAAQ,KAAK,CAAC;AAElB,SAAK,sBAAsB,OAAO,UAAU,kBAAkB,OAAO,QAAQ;AAAA,EAC/E;AACF;AAQA,KAAK,gBAAgB,SAAS,OAAO,oBAAoB,YAAY,wBAAwB;AAC3F,MAAI,OAAO,CAAC,GAAG,QAAQ;AACvB,SAAO,CAAC,KAAK,IAAI,KAAK,GAAG;AACvB,QAAI,CAAC,OAAO;AACV,WAAK,OAAO,QAAQ,KAAK;AACzB,UAAI,sBAAsB,KAAK,mBAAmB,KAAK,GAAG;AAAE;AAAA,MAAM;AAAA,IACpE,OAAO;AAAE,cAAQ;AAAA,IAAO;AAExB,QAAI,MAAO;AACX,QAAI,cAAc,KAAK,SAAS,QAAQ,OACtC;AAAE,YAAM;AAAA,IAAM,WACP,KAAK,SAAS,QAAQ,UAAU;AACvC,YAAM,KAAK,YAAY,sBAAsB;AAC7C,UAAI,0BAA0B,KAAK,SAAS,QAAQ,SAAS,uBAAuB,gBAAgB,GAClG;AAAE,+BAAuB,gBAAgB,KAAK;AAAA,MAAO;AAAA,IACzD,OAAO;AACL,YAAM,KAAK,iBAAiB,OAAO,sBAAsB;AAAA,IAC3D;AACA,SAAK,KAAK,GAAG;AAAA,EACf;AACA,SAAO;AACT;AAEA,KAAK,kBAAkB,SAASA,MAAK;AACnC,MAAI,QAAQA,KAAI;AAChB,MAAI,MAAMA,KAAI;AACd,MAAI,OAAOA,KAAI;AAEf,MAAI,KAAK,eAAe,SAAS,SAC/B;AAAE,SAAK,iBAAiB,OAAO,qDAAqD;AAAA,EAAG;AACzF,MAAI,KAAK,WAAW,SAAS,SAC3B;AAAE,SAAK,iBAAiB,OAAO,2DAA2D;AAAA,EAAG;AAC/F,MAAI,EAAE,KAAK,iBAAiB,EAAE,QAAQ,cAAc,SAAS,aAC3D;AAAE,SAAK,iBAAiB,OAAO,mDAAmD;AAAA,EAAG;AACvF,MAAI,KAAK,uBAAuB,SAAS,eAAe,SAAS,UAC/D;AAAE,SAAK,MAAM,OAAQ,gBAAgB,OAAO,uCAAwC;AAAA,EAAG;AACzF,MAAI,KAAK,SAAS,KAAK,IAAI,GACzB;AAAE,SAAK,MAAM,OAAQ,yBAAyB,OAAO,GAAI;AAAA,EAAG;AAC9D,MAAI,KAAK,QAAQ,cAAc,KAC7B,KAAK,MAAM,MAAM,OAAO,GAAG,EAAE,QAAQ,IAAI,MAAM,IAAI;AAAE;AAAA,EAAO;AAC9D,MAAI,KAAK,KAAK,SAAS,KAAK,sBAAsB,KAAK;AACvD,MAAI,GAAG,KAAK,IAAI,GAAG;AACjB,QAAI,CAAC,KAAK,WAAW,SAAS,SAC5B;AAAE,WAAK,iBAAiB,OAAO,sDAAsD;AAAA,IAAG;AAC1F,SAAK,iBAAiB,OAAQ,kBAAkB,OAAO,eAAgB;AAAA,EACzE;AACF;AAMA,KAAK,aAAa,SAAS,SAAS;AAClC,MAAI,OAAO,KAAK,eAAe;AAC/B,OAAK,KAAK,CAAC,CAAC,OAAO;AACnB,OAAK,WAAW,MAAM,YAAY;AAClC,MAAI,CAAC,SAAS;AACZ,SAAK,gBAAgB,IAAI;AACzB,QAAI,KAAK,SAAS,WAAW,CAAC,KAAK,eACjC;AAAE,WAAK,gBAAgB,KAAK;AAAA,IAAO;AAAA,EACvC;AACA,SAAO;AACT;AAEA,KAAK,iBAAiB,WAAW;AAC/B,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,KAAK,SAAS,QAAQ,MAAM;AAC9B,SAAK,OAAO,KAAK;AAAA,EACnB,WAAW,KAAK,KAAK,SAAS;AAC5B,SAAK,OAAO,KAAK,KAAK;AAMtB,SAAK,KAAK,SAAS,WAAW,KAAK,SAAS,gBACzC,KAAK,eAAe,KAAK,eAAe,KAAK,KAAK,MAAM,WAAW,KAAK,YAAY,MAAM,KAAK;AAChG,WAAK,QAAQ,IAAI;AAAA,IACnB;AACA,SAAK,OAAO,QAAQ;AAAA,EACtB,OAAO;AACL,SAAK,WAAW;AAAA,EAClB;AACA,SAAO;AACT;AAEA,KAAK,oBAAoB,WAAW;AAClC,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,KAAK,SAAS,QAAQ,WAAW;AACnC,SAAK,OAAO,KAAK;AAAA,EACnB,OAAO;AACL,SAAK,WAAW;AAAA,EAClB;AACA,OAAK,KAAK;AACV,OAAK,WAAW,MAAM,mBAAmB;AAGzC,MAAI,KAAK,QAAQ,oBAAoB;AACnC,QAAI,KAAK,iBAAiB,WAAW,GAAG;AACtC,WAAK,MAAM,KAAK,OAAQ,qBAAsB,KAAK,OAAQ,0CAA2C;AAAA,IACxG,OAAO;AACL,WAAK,iBAAiB,KAAK,iBAAiB,SAAS,CAAC,EAAE,KAAK,KAAK,IAAI;AAAA,IACxE;AAAA,EACF;AAEA,SAAO;AACT;AAIA,KAAK,aAAa,SAAS,SAAS;AAClC,MAAI,CAAC,KAAK,UAAU;AAAE,SAAK,WAAW,KAAK;AAAA,EAAO;AAElD,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,MAAI,KAAK,SAAS,QAAQ,QAAQ,KAAK,mBAAmB,KAAM,KAAK,SAAS,QAAQ,QAAQ,CAAC,KAAK,KAAK,YAAa;AACpH,SAAK,WAAW;AAChB,SAAK,WAAW;AAAA,EAClB,OAAO;AACL,SAAK,WAAW,KAAK,IAAI,QAAQ,IAAI;AACrC,SAAK,WAAW,KAAK,iBAAiB,OAAO;AAAA,EAC/C;AACA,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,KAAK,aAAa,SAAS,SAAS;AAClC,MAAI,CAAC,KAAK,UAAU;AAAE,SAAK,WAAW,KAAK;AAAA,EAAO;AAElD,MAAI,OAAO,KAAK,UAAU;AAC1B,OAAK,KAAK;AACV,OAAK,WAAW,KAAK,gBAAgB,MAAM,MAAM,OAAO,OAAO;AAC/D,SAAO,KAAK,WAAW,MAAM,iBAAiB;AAChD;AAEA,IAAI,OAAO,OAAO;AAQlB,KAAK,QAAQ,SAAS,KAAK,SAAS;AAClC,MAAI,MAAM,YAAY,KAAK,OAAO,GAAG;AACrC,aAAW,OAAO,IAAI,OAAO,MAAM,IAAI,SAAS;AAChD,MAAI,KAAK,YAAY;AACnB,eAAW,SAAS,KAAK;AAAA,EAC3B;AACA,MAAI,MAAM,IAAI,YAAY,OAAO;AACjC,MAAI,MAAM;AAAK,MAAI,MAAM;AAAK,MAAI,WAAW,KAAK;AAClD,QAAM;AACR;AAEA,KAAK,mBAAmB,KAAK;AAE7B,KAAK,cAAc,WAAW;AAC5B,MAAI,KAAK,QAAQ,WAAW;AAC1B,WAAO,IAAI,SAAS,KAAK,SAAS,KAAK,MAAM,KAAK,SAAS;AAAA,EAC7D;AACF;AAEA,IAAI,OAAO,OAAO;AAElB,IAAI,QAAQ,SAASK,OAAM,OAAO;AAChC,OAAK,QAAQ;AAEb,OAAK,MAAM,CAAC;AAEZ,OAAK,UAAU,CAAC;AAEhB,OAAK,YAAY,CAAC;AACpB;AAIA,KAAK,aAAa,SAAS,OAAO;AAChC,OAAK,WAAW,KAAK,IAAI,MAAM,KAAK,CAAC;AACvC;AAEA,KAAK,YAAY,WAAW;AAC1B,OAAK,WAAW,IAAI;AACtB;AAKA,KAAK,6BAA6B,SAAS,OAAO;AAChD,SAAQ,MAAM,QAAQ,kBAAmB,CAAC,KAAK,YAAa,MAAM,QAAQ;AAC5E;AAEA,KAAK,cAAc,SAAS,MAAM,aAAa,KAAK;AAClD,MAAI,aAAa;AACjB,MAAI,gBAAgB,cAAc;AAChC,QAAI,QAAQ,KAAK,aAAa;AAC9B,iBAAa,MAAM,QAAQ,QAAQ,IAAI,IAAI,MAAM,MAAM,UAAU,QAAQ,IAAI,IAAI,MAAM,MAAM,IAAI,QAAQ,IAAI,IAAI;AACjH,UAAM,QAAQ,KAAK,IAAI;AACvB,QAAI,KAAK,YAAa,MAAM,QAAQ,WAClC;AAAE,aAAO,KAAK,iBAAiB,IAAI;AAAA,IAAG;AAAA,EAC1C,WAAW,gBAAgB,mBAAmB;AAC5C,QAAI,UAAU,KAAK,aAAa;AAChC,YAAQ,QAAQ,KAAK,IAAI;AAAA,EAC3B,WAAW,gBAAgB,eAAe;AACxC,QAAI,UAAU,KAAK,aAAa;AAChC,QAAI,KAAK,qBACP;AAAE,mBAAa,QAAQ,QAAQ,QAAQ,IAAI,IAAI;AAAA,IAAI,OAEnD;AAAE,mBAAa,QAAQ,QAAQ,QAAQ,IAAI,IAAI,MAAM,QAAQ,IAAI,QAAQ,IAAI,IAAI;AAAA,IAAI;AACvF,YAAQ,UAAU,KAAK,IAAI;AAAA,EAC7B,OAAO;AACL,aAAS,IAAI,KAAK,WAAW,SAAS,GAAG,KAAK,GAAG,EAAE,GAAG;AACpD,UAAI,UAAU,KAAK,WAAW,CAAC;AAC/B,UAAI,QAAQ,QAAQ,QAAQ,IAAI,IAAI,MAAM,EAAG,QAAQ,QAAQ,sBAAuB,QAAQ,QAAQ,CAAC,MAAM,SACvG,CAAC,KAAK,2BAA2B,OAAO,KAAK,QAAQ,UAAU,QAAQ,IAAI,IAAI,IAAI;AACrF,qBAAa;AACb;AAAA,MACF;AACA,cAAQ,IAAI,KAAK,IAAI;AACrB,UAAI,KAAK,YAAa,QAAQ,QAAQ,WACpC;AAAE,eAAO,KAAK,iBAAiB,IAAI;AAAA,MAAG;AACxC,UAAI,QAAQ,QAAQ,WAAW;AAAE;AAAA,MAAM;AAAA,IACzC;AAAA,EACF;AACA,MAAI,YAAY;AAAE,SAAK,iBAAiB,KAAM,iBAAiB,OAAO,6BAA8B;AAAA,EAAG;AACzG;AAEA,KAAK,mBAAmB,SAAS,IAAI;AAEnC,MAAI,KAAK,WAAW,CAAC,EAAE,QAAQ,QAAQ,GAAG,IAAI,MAAM,MAChD,KAAK,WAAW,CAAC,EAAE,IAAI,QAAQ,GAAG,IAAI,MAAM,IAAI;AAClD,SAAK,iBAAiB,GAAG,IAAI,IAAI;AAAA,EACnC;AACF;AAEA,KAAK,eAAe,WAAW;AAC7B,SAAO,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC;AACnD;AAEA,KAAK,kBAAkB,WAAW;AAChC,WAAS,IAAI,KAAK,WAAW,SAAS,KAAI,KAAK;AAC7C,QAAI,QAAQ,KAAK,WAAW,CAAC;AAC7B,QAAI,MAAM,SAAS,YAAY,yBAAyB,2BAA2B;AAAE,aAAO;AAAA,IAAM;AAAA,EACpG;AACF;AAGA,KAAK,mBAAmB,WAAW;AACjC,WAAS,IAAI,KAAK,WAAW,SAAS,KAAI,KAAK;AAC7C,QAAI,QAAQ,KAAK,WAAW,CAAC;AAC7B,QAAI,MAAM,SAAS,YAAY,yBAAyB,6BACpD,EAAE,MAAM,QAAQ,cAAc;AAAE,aAAO;AAAA,IAAM;AAAA,EACnD;AACF;AAEA,IAAI,OAAO,SAASC,MAAKJ,SAAQ,KAAK,KAAK;AACzC,OAAK,OAAO;AACZ,OAAK,QAAQ;AACb,OAAK,MAAM;AACX,MAAIA,QAAO,QAAQ,WACjB;AAAE,SAAK,MAAM,IAAI,eAAeA,SAAQ,GAAG;AAAA,EAAG;AAChD,MAAIA,QAAO,QAAQ,kBACjB;AAAE,SAAK,aAAaA,QAAO,QAAQ;AAAA,EAAkB;AACvD,MAAIA,QAAO,QAAQ,QACjB;AAAE,SAAK,QAAQ,CAAC,KAAK,CAAC;AAAA,EAAG;AAC7B;AAIA,IAAI,OAAO,OAAO;AAElB,KAAK,YAAY,WAAW;AAC1B,SAAO,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,QAAQ;AACjD;AAEA,KAAK,cAAc,SAAS,KAAK,KAAK;AACpC,SAAO,IAAI,KAAK,MAAM,KAAK,GAAG;AAChC;AAIA,SAAS,aAAa,MAAM,MAAM,KAAK,KAAK;AAC1C,OAAK,OAAO;AACZ,OAAK,MAAM;AACX,MAAI,KAAK,QAAQ,WACf;AAAE,SAAK,IAAI,MAAM;AAAA,EAAK;AACxB,MAAI,KAAK,QAAQ,QACf;AAAE,SAAK,MAAM,CAAC,IAAI;AAAA,EAAK;AACzB,SAAO;AACT;AAEA,KAAK,aAAa,SAAS,MAAM,MAAM;AACrC,SAAO,aAAa,KAAK,MAAM,MAAM,MAAM,KAAK,YAAY,KAAK,aAAa;AAChF;AAIA,KAAK,eAAe,SAAS,MAAM,MAAM,KAAK,KAAK;AACjD,SAAO,aAAa,KAAK,MAAM,MAAM,MAAM,KAAK,GAAG;AACrD;AAEA,KAAK,WAAW,SAAS,MAAM;AAC7B,MAAI,UAAU,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,QAAQ;AACtD,WAAS,QAAQ,MAAM;AAAE,YAAQ,IAAI,IAAI,KAAK,IAAI;AAAA,EAAG;AACrD,SAAO;AACT;AAGA,IAAI,6BAA6B;AAOjC,IAAI,wBAAwB;AAC5B,IAAI,yBAAyB,wBAAwB;AACrD,IAAI,yBAAyB;AAC7B,IAAI,yBAAyB,yBAAyB;AACtD,IAAI,yBAAyB;AAC7B,IAAI,yBAAyB;AAE7B,IAAI,0BAA0B;AAAA,EAC5B,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AACN;AAGA,IAAI,kCAAkC;AAEtC,IAAI,mCAAmC;AAAA,EACrC,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AACN;AAGA,IAAI,+BAA+B;AAGnC,IAAI,oBAAoB;AACxB,IAAI,qBAAqB,oBAAoB;AAC7C,IAAI,qBAAqB,qBAAqB;AAC9C,IAAI,qBAAqB,qBAAqB;AAC9C,IAAI,qBAAqB,qBAAqB;AAC9C,IAAI,qBAAqB,qBAAqB,MAAM;AAEpD,IAAI,sBAAsB;AAAA,EACxB,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AACN;AAEA,IAAI,OAAO,CAAC;AACZ,SAAS,iBAAiB,aAAa;AACrC,MAAI,IAAI,KAAK,WAAW,IAAI;AAAA,IAC1B,QAAQ,YAAY,wBAAwB,WAAW,IAAI,MAAM,4BAA4B;AAAA,IAC7F,iBAAiB,YAAY,iCAAiC,WAAW,CAAC;AAAA,IAC1E,WAAW;AAAA,MACT,kBAAkB,YAAY,4BAA4B;AAAA,MAC1D,QAAQ,YAAY,oBAAoB,WAAW,CAAC;AAAA,IACtD;AAAA,EACF;AACA,IAAE,UAAU,oBAAoB,EAAE,UAAU;AAE5C,IAAE,UAAU,KAAK,EAAE,UAAU;AAC7B,IAAE,UAAU,KAAK,EAAE,UAAU;AAC7B,IAAE,UAAU,MAAM,EAAE,UAAU;AAChC;AAEA,KAAS,IAAI,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACnE,gBAAc,KAAK,CAAC;AAExB,mBAAiB,WAAW;AAC9B;AAHM;AADG;AAAO;AAMhB,IAAI,OAAO,OAAO;AAIlB,IAAI,WAAW,SAASK,UAAS,QAAQ,MAAM;AAE7C,OAAK,SAAS;AAEd,OAAK,OAAO,QAAQ;AACtB;AAEA,SAAS,UAAU,gBAAgB,SAAS,cAAe,KAAK;AAG9D,WAAS,OAAO,MAAM,MAAM,OAAO,KAAK,QAAQ;AAC9C,aAAS,QAAQ,KAAK,OAAO,QAAQ,MAAM,QAAQ;AACjD,UAAI,KAAK,SAAS,MAAM,QAAQ,SAAS,OAAO;AAAE,eAAO;AAAA,MAAK;AAAA,IAChE;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,UAAU,UAAU,SAAS,UAAW;AAC/C,SAAO,IAAI,SAAS,KAAK,QAAQ,KAAK,IAAI;AAC5C;AAEA,IAAI,wBAAwB,SAASC,uBAAsBN,SAAQ;AACjE,OAAK,SAASA;AACd,OAAK,aAAa,SAASA,QAAO,QAAQ,eAAe,IAAI,OAAO,OAAOA,QAAO,QAAQ,eAAe,IAAI,MAAM,OAAOA,QAAO,QAAQ,eAAe,KAAK,MAAM,OAAOA,QAAO,QAAQ,eAAe,KAAK,MAAM;AACnN,OAAK,oBAAoB,KAAKA,QAAO,QAAQ,eAAe,KAAK,KAAKA,QAAO,QAAQ,WAAW;AAChG,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,UAAU;AACf,OAAK,UAAU;AACf,OAAK,UAAU;AACf,OAAK,MAAM;AACX,OAAK,eAAe;AACpB,OAAK,kBAAkB;AACvB,OAAK,8BAA8B;AACnC,OAAK,qBAAqB;AAC1B,OAAK,mBAAmB;AACxB,OAAK,aAAa,uBAAO,OAAO,IAAI;AACpC,OAAK,qBAAqB,CAAC;AAC3B,OAAK,WAAW;AAClB;AAEA,sBAAsB,UAAU,QAAQ,SAAS,MAAO,OAAO,SAAS,OAAO;AAC7E,MAAI,cAAc,MAAM,QAAQ,GAAG,MAAM;AACzC,MAAI,UAAU,MAAM,QAAQ,GAAG,MAAM;AACrC,OAAK,QAAQ,QAAQ;AACrB,OAAK,SAAS,UAAU;AACxB,OAAK,QAAQ;AACb,MAAI,eAAe,KAAK,OAAO,QAAQ,eAAe,IAAI;AACxD,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,UAAU;AAAA,EACjB,OAAO;AACL,SAAK,UAAU,WAAW,KAAK,OAAO,QAAQ,eAAe;AAC7D,SAAK,UAAU;AACf,SAAK,UAAU,WAAW,KAAK,OAAO,QAAQ,eAAe;AAAA,EAC/D;AACF;AAEA,sBAAsB,UAAU,QAAQ,SAAS,MAAO,SAAS;AAC/D,OAAK,OAAO,iBAAiB,KAAK,OAAQ,kCAAmC,KAAK,SAAU,QAAQ,OAAQ;AAC9G;AAIA,sBAAsB,UAAU,KAAK,SAAS,GAAI,GAAG,QAAQ;AACzD,MAAK,WAAW,OAAS,UAAS;AAEpC,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,EAAE;AACV,MAAI,KAAK,GAAG;AACV,WAAO;AAAA,EACT;AACA,MAAI,IAAI,EAAE,WAAW,CAAC;AACtB,MAAI,EAAE,UAAU,KAAK,YAAY,KAAK,SAAU,KAAK,SAAU,IAAI,KAAK,GAAG;AACzE,WAAO;AAAA,EACT;AACA,MAAI,OAAO,EAAE,WAAW,IAAI,CAAC;AAC7B,SAAO,QAAQ,SAAU,QAAQ,SAAU,KAAK,MAAM,OAAO,WAAY;AAC3E;AAEA,sBAAsB,UAAU,YAAY,SAAS,UAAW,GAAG,QAAQ;AACvE,MAAK,WAAW,OAAS,UAAS;AAEpC,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,EAAE;AACV,MAAI,KAAK,GAAG;AACV,WAAO;AAAA,EACT;AACA,MAAI,IAAI,EAAE,WAAW,CAAC,GAAG;AACzB,MAAI,EAAE,UAAU,KAAK,YAAY,KAAK,SAAU,KAAK,SAAU,IAAI,KAAK,MACnE,OAAO,EAAE,WAAW,IAAI,CAAC,KAAK,SAAU,OAAO,OAAQ;AAC1D,WAAO,IAAI;AAAA,EACb;AACA,SAAO,IAAI;AACb;AAEA,sBAAsB,UAAU,UAAU,SAAS,QAAS,QAAQ;AAChE,MAAK,WAAW,OAAS,UAAS;AAEpC,SAAO,KAAK,GAAG,KAAK,KAAK,MAAM;AACjC;AAEA,sBAAsB,UAAU,YAAY,SAAS,UAAW,QAAQ;AACpE,MAAK,WAAW,OAAS,UAAS;AAEpC,SAAO,KAAK,GAAG,KAAK,UAAU,KAAK,KAAK,MAAM,GAAG,MAAM;AACzD;AAEA,sBAAsB,UAAU,UAAU,SAAS,QAAS,QAAQ;AAChE,MAAK,WAAW,OAAS,UAAS;AAEpC,OAAK,MAAM,KAAK,UAAU,KAAK,KAAK,MAAM;AAC5C;AAEA,sBAAsB,UAAU,MAAM,SAAS,IAAK,IAAI,QAAQ;AAC5D,MAAK,WAAW,OAAS,UAAS;AAEpC,MAAI,KAAK,QAAQ,MAAM,MAAM,IAAI;AAC/B,SAAK,QAAQ,MAAM;AACnB,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,sBAAsB,UAAU,WAAW,SAAS,SAAU,KAAK,QAAQ;AACvE,MAAK,WAAW,OAAS,UAAS;AAEpC,MAAI,MAAM,KAAK;AACf,WAAS,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK,QAAQ,KAAK,GAAG;AACnD,QAAI,KAAK,KAAK,CAAC;AAEb,QAAIO,WAAU,KAAK,GAAG,KAAK,MAAM;AACnC,QAAIA,aAAY,MAAMA,aAAY,IAAI;AACpC,aAAO;AAAA,IACT;AACA,UAAM,KAAK,UAAU,KAAK,MAAM;AAAA,EAClC;AACA,OAAK,MAAM;AACX,SAAO;AACT;AAQA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,aAAa,MAAM;AACvB,MAAI,QAAQ,MAAM;AAElB,MAAI,IAAI;AACR,MAAI,IAAI;AAER,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,OAAO,MAAM,OAAO,CAAC;AACzB,QAAI,WAAW,QAAQ,IAAI,MAAM,IAAI;AACnC,WAAK,MAAM,MAAM,OAAO,iCAAiC;AAAA,IAC3D;AACA,QAAI,MAAM,QAAQ,MAAM,IAAI,CAAC,IAAI,IAAI;AACnC,WAAK,MAAM,MAAM,OAAO,mCAAmC;AAAA,IAC7D;AACA,QAAI,SAAS,KAAK;AAAE,UAAI;AAAA,IAAM;AAC9B,QAAI,SAAS,KAAK;AAAE,UAAI;AAAA,IAAM;AAAA,EAChC;AACA,MAAI,KAAK,QAAQ,eAAe,MAAM,KAAK,GAAG;AAC5C,SAAK,MAAM,MAAM,OAAO,iCAAiC;AAAA,EAC3D;AACF;AAEA,SAAS,QAAQ,KAAK;AACpB,WAAS,KAAK,KAAK;AAAE,WAAO;AAAA,EAAK;AACjC,SAAO;AACT;AAQA,KAAK,wBAAwB,SAAS,OAAO;AAC3C,OAAK,eAAe,KAAK;AAOzB,MAAI,CAAC,MAAM,WAAW,KAAK,QAAQ,eAAe,KAAK,QAAQ,MAAM,UAAU,GAAG;AAChF,UAAM,UAAU;AAChB,SAAK,eAAe,KAAK;AAAA,EAC3B;AACF;AAGA,KAAK,iBAAiB,SAAS,OAAO;AACpC,QAAM,MAAM;AACZ,QAAM,eAAe;AACrB,QAAM,kBAAkB;AACxB,QAAM,8BAA8B;AACpC,QAAM,qBAAqB;AAC3B,QAAM,mBAAmB;AACzB,QAAM,aAAa,uBAAO,OAAO,IAAI;AACrC,QAAM,mBAAmB,SAAS;AAClC,QAAM,WAAW;AAEjB,OAAK,mBAAmB,KAAK;AAE7B,MAAI,MAAM,QAAQ,MAAM,OAAO,QAAQ;AAErC,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,YAAM,MAAM,eAAe;AAAA,IAC7B;AACA,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AACtD,YAAM,MAAM,0BAA0B;AAAA,IACxC;AAAA,EACF;AACA,MAAI,MAAM,mBAAmB,MAAM,oBAAoB;AACrD,UAAM,MAAM,gBAAgB;AAAA,EAC9B;AACA,WAAS,IAAI,GAAG,OAAO,MAAM,oBAAoB,IAAI,KAAK,QAAQ,KAAK,GAAG;AACxE,QAAI,OAAO,KAAK,CAAC;AAEjB,QAAI,CAAC,MAAM,WAAW,IAAI,GAAG;AAC3B,YAAM,MAAM,kCAAkC;AAAA,IAChD;AAAA,EACF;AACF;AAGA,KAAK,qBAAqB,SAAS,OAAO;AACxC,MAAI,mBAAmB,KAAK,QAAQ,eAAe;AACnD,MAAI,kBAAkB;AAAE,UAAM,WAAW,IAAI,SAAS,MAAM,UAAU,IAAI;AAAA,EAAG;AAC7E,OAAK,mBAAmB,KAAK;AAC7B,SAAO,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC9B,QAAI,kBAAkB;AAAE,YAAM,WAAW,MAAM,SAAS,QAAQ;AAAA,IAAG;AACnE,SAAK,mBAAmB,KAAK;AAAA,EAC/B;AACA,MAAI,kBAAkB;AAAE,UAAM,WAAW,MAAM,SAAS;AAAA,EAAQ;AAGhE,MAAI,KAAK,qBAAqB,OAAO,IAAI,GAAG;AAC1C,UAAM,MAAM,mBAAmB;AAAA,EACjC;AACA,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,UAAM,MAAM,0BAA0B;AAAA,EACxC;AACF;AAGA,KAAK,qBAAqB,SAAS,OAAO;AACxC,SAAO,MAAM,MAAM,MAAM,OAAO,UAAU,KAAK,eAAe,KAAK,GAAG;AAAA,EAAC;AACzE;AAGA,KAAK,iBAAiB,SAAS,OAAO;AACpC,MAAI,KAAK,oBAAoB,KAAK,GAAG;AAInC,QAAI,MAAM,+BAA+B,KAAK,qBAAqB,KAAK,GAAG;AAEzE,UAAI,MAAM,SAAS;AACjB,cAAM,MAAM,oBAAoB;AAAA,MAClC;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,UAAU,KAAK,eAAe,KAAK,IAAI,KAAK,uBAAuB,KAAK,GAAG;AACnF,SAAK,qBAAqB,KAAK;AAC/B,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,QAAQ,MAAM;AAClB,QAAM,8BAA8B;AAGpC,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KAAK,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AACtD,WAAO;AAAA,EACT;AAGA,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AACtD,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AAGA,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KAAK,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AACtD,QAAI,aAAa;AACjB,QAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,mBAAa,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY;AAAA,IACrC;AACA,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AACtD,WAAK,mBAAmB,KAAK;AAC7B,UAAI,CAAC,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,GAAG;AAC5B,cAAM,MAAM,oBAAoB;AAAA,MAClC;AACA,YAAM,8BAA8B,CAAC;AACrC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,MAAM;AACZ,SAAO;AACT;AAGA,KAAK,uBAAuB,SAAS,OAAO,SAAS;AACnD,MAAK,YAAY,OAAS,WAAU;AAEpC,MAAI,KAAK,2BAA2B,OAAO,OAAO,GAAG;AACnD,UAAM;AAAA,MAAI;AAAA;AAAA,IAAY;AACtB,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,6BAA6B,SAAS,OAAO,SAAS;AACzD,SACE,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,KAAK,2BAA2B,OAAO,OAAO;AAElD;AACA,KAAK,6BAA6B,SAAS,OAAO,SAAS;AACzD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,MAAM,GAAG,MAAM;AACnB,QAAI,KAAK,wBAAwB,KAAK,GAAG;AACvC,YAAM,MAAM;AACZ,UAAI,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,KAAK,KAAK,wBAAwB,KAAK,GAAG;AAClE,cAAM,MAAM;AAAA,MACd;AACA,UAAI,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,GAAG;AAE3B,YAAI,QAAQ,MAAM,MAAM,OAAO,CAAC,SAAS;AACvC,gBAAM,MAAM,uCAAuC;AAAA,QACrD;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,MAAM,WAAW,CAAC,SAAS;AAC7B,YAAM,MAAM,uBAAuB;AAAA,IACrC;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,iBAAiB,SAAS,OAAO;AACpC,SACE,KAAK,4BAA4B,KAAK,KACtC,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,KAAK,mCAAmC,KAAK,KAC7C,KAAK,yBAAyB,KAAK,KACnC,KAAK,2BAA2B,KAAK,KACrC,KAAK,yBAAyB,KAAK;AAEvC;AACA,KAAK,qCAAqC,SAAS,OAAO;AACxD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,qBAAqB,KAAK,GAAG;AACpC,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AACA,KAAK,6BAA6B,SAAS,OAAO;AAChD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,UAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,YAAI,eAAe,KAAK,oBAAoB,KAAK;AACjD,YAAI,YAAY,MAAM;AAAA,UAAI;AAAA;AAAA,QAAY;AACtC,YAAI,gBAAgB,WAAW;AAC7B,mBAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC5C,gBAAI,WAAW,aAAa,OAAO,CAAC;AACpC,gBAAI,aAAa,QAAQ,UAAU,IAAI,CAAC,IAAI,IAAI;AAC9C,oBAAM,MAAM,wCAAwC;AAAA,YACtD;AAAA,UACF;AACA,cAAI,WAAW;AACb,gBAAI,kBAAkB,KAAK,oBAAoB,KAAK;AACpD,gBAAI,CAAC,gBAAgB,CAAC,mBAAmB,MAAM,QAAQ,MAAM,IAAc;AACzE,oBAAM,MAAM,sCAAsC;AAAA,YACpD;AACA,qBAAS,MAAM,GAAG,MAAM,gBAAgB,QAAQ,OAAO;AACrD,kBAAI,aAAa,gBAAgB,OAAO,GAAG;AAC3C,kBACE,gBAAgB,QAAQ,YAAY,MAAM,CAAC,IAAI,MAC/C,aAAa,QAAQ,UAAU,IAAI,IACnC;AACA,sBAAM,MAAM,wCAAwC;AAAA,cACtD;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,GAAG;AAC3B,aAAK,mBAAmB,KAAK;AAC7B,YAAI,MAAM;AAAA,UAAI;AAAA;AAAA,QAAY,GAAG;AAC3B,iBAAO;AAAA,QACT;AACA,cAAM,MAAM,oBAAoB;AAAA,MAClC;AAAA,IACF;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AACA,KAAK,2BAA2B,SAAS,OAAO;AAC9C,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,WAAK,sBAAsB,KAAK;AAAA,IAClC,WAAW,MAAM,QAAQ,MAAM,IAAc;AAC3C,YAAM,MAAM,eAAe;AAAA,IAC7B;AACA,SAAK,mBAAmB,KAAK;AAC7B,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,YAAM,sBAAsB;AAC5B,aAAO;AAAA,IACT;AACA,UAAM,MAAM,oBAAoB;AAAA,EAClC;AACA,SAAO;AACT;AAIA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,YAAY;AAChB,MAAI,KAAK;AACT,UAAQ,KAAK,MAAM,QAAQ,OAAO,MAAM,4BAA4B,EAAE,GAAG;AACvE,iBAAa,kBAAkB,EAAE;AACjC,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO;AACT;AAGA,SAAS,4BAA4B,IAAI;AACvC,SAAO,OAAO,OAAgB,OAAO,OAAgB,OAAO;AAC9D;AAGA,KAAK,yBAAyB,SAAS,OAAO;AAC5C,SACE,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,KACtB,KAAK,mCAAmC,KAAK,KAC7C,KAAK,yBAAyB,KAAK,KACnC,KAAK,2BAA2B,KAAK,KACrC,KAAK,yBAAyB,KAAK,KACnC,KAAK,kCAAkC,KAAK,KAC5C,KAAK,mCAAmC,KAAK;AAEjD;AAGA,KAAK,oCAAoC,SAAS,OAAO;AACvD,MAAI,KAAK,2BAA2B,OAAO,IAAI,GAAG;AAChD,UAAM,MAAM,mBAAmB;AAAA,EACjC;AACA,SAAO;AACT;AAGA,KAAK,4BAA4B,SAAS,OAAO;AAC/C,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,kBAAkB,EAAE,GAAG;AACzB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,SAAS,kBAAkB,IAAI;AAC7B,SACE,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,OAAO,MACP,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,MAAM,OAAgB,MAAM;AAEhC;AAIA,KAAK,8BAA8B,SAAS,OAAO;AACjD,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK;AACT,UAAQ,KAAK,MAAM,QAAQ,OAAO,MAAM,CAAC,kBAAkB,EAAE,GAAG;AAC9D,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,QAAQ;AACvB;AAGA,KAAK,qCAAqC,SAAS,OAAO;AACxD,MAAI,KAAK,MAAM,QAAQ;AACvB,MACE,OAAO,MACP,OAAO,MACP,EAAE,MAAM,MAAgB,MAAM,OAC9B,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,KACP;AACA,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,KAAK,wBAAwB,SAAS,OAAO;AAC3C,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,CAAC,KAAK,oBAAoB,KAAK,GAAG;AAAE,YAAM,MAAM,eAAe;AAAA,IAAG;AACtE,QAAI,mBAAmB,KAAK,QAAQ,eAAe;AACnD,QAAI,QAAQ,MAAM,WAAW,MAAM,eAAe;AAClD,QAAI,OAAO;AACT,UAAI,kBAAkB;AACpB,iBAAS,IAAI,GAAG,OAAO,OAAO,IAAI,KAAK,QAAQ,KAAK,GAAG;AACrD,cAAI,QAAQ,KAAK,CAAC;AAElB,cAAI,CAAC,MAAM,cAAc,MAAM,QAAQ,GACrC;AAAE,kBAAM,MAAM,8BAA8B;AAAA,UAAG;AAAA,QACnD;AAAA,MACF,OAAO;AACL,cAAM,MAAM,8BAA8B;AAAA,MAC5C;AAAA,IACF;AACA,QAAI,kBAAkB;AACpB,OAAC,UAAU,MAAM,WAAW,MAAM,eAAe,IAAI,CAAC,IAAI,KAAK,MAAM,QAAQ;AAAA,IAC/E,OAAO;AACL,YAAM,WAAW,MAAM,eAAe,IAAI;AAAA,IAC5C;AAAA,EACF;AACF;AAKA,KAAK,sBAAsB,SAAS,OAAO;AACzC,QAAM,kBAAkB;AACxB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,+BAA+B,KAAK,KAAK,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AACzE,aAAO;AAAA,IACT;AACA,UAAM,MAAM,4BAA4B;AAAA,EAC1C;AACA,SAAO;AACT;AAMA,KAAK,iCAAiC,SAAS,OAAO;AACpD,QAAM,kBAAkB;AACxB,MAAI,KAAK,gCAAgC,KAAK,GAAG;AAC/C,UAAM,mBAAmB,kBAAkB,MAAM,YAAY;AAC7D,WAAO,KAAK,+BAA+B,KAAK,GAAG;AACjD,YAAM,mBAAmB,kBAAkB,MAAM,YAAY;AAAA,IAC/D;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAOA,KAAK,kCAAkC,SAAS,OAAO;AACrD,MAAI,QAAQ,MAAM;AAClB,MAAI,SAAS,KAAK,QAAQ,eAAe;AACzC,MAAI,KAAK,MAAM,QAAQ,MAAM;AAC7B,QAAM,QAAQ,MAAM;AAEpB,MAAI,OAAO,MAAgB,KAAK,sCAAsC,OAAO,MAAM,GAAG;AACpF,SAAK,MAAM;AAAA,EACb;AACA,MAAI,wBAAwB,EAAE,GAAG;AAC/B,UAAM,eAAe;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,MAAM;AACZ,SAAO;AACT;AACA,SAAS,wBAAwB,IAAI;AACnC,SAAO,kBAAkB,IAAI,IAAI,KAAK,OAAO,MAAgB,OAAO;AACtE;AASA,KAAK,iCAAiC,SAAS,OAAO;AACpD,MAAI,QAAQ,MAAM;AAClB,MAAI,SAAS,KAAK,QAAQ,eAAe;AACzC,MAAI,KAAK,MAAM,QAAQ,MAAM;AAC7B,QAAM,QAAQ,MAAM;AAEpB,MAAI,OAAO,MAAgB,KAAK,sCAAsC,OAAO,MAAM,GAAG;AACpF,SAAK,MAAM;AAAA,EACb;AACA,MAAI,uBAAuB,EAAE,GAAG;AAC9B,UAAM,eAAe;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,MAAM;AACZ,SAAO;AACT;AACA,SAAS,uBAAuB,IAAI;AAClC,SAAO,iBAAiB,IAAI,IAAI,KAAK,OAAO,MAAgB,OAAO,MAAgB,OAAO,QAAuB,OAAO;AAC1H;AAGA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,MACE,KAAK,wBAAwB,KAAK,KAClC,KAAK,+BAA+B,KAAK,KACzC,KAAK,0BAA0B,KAAK,KACnC,MAAM,WAAW,KAAK,qBAAqB,KAAK,GACjD;AACA,WAAO;AAAA,EACT;AACA,MAAI,MAAM,SAAS;AAEjB,QAAI,MAAM,QAAQ,MAAM,IAAc;AACpC,YAAM,MAAM,wBAAwB;AAAA,IACtC;AACA,UAAM,MAAM,gBAAgB;AAAA,EAC9B;AACA,SAAO;AACT;AACA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK,wBAAwB,KAAK,GAAG;AACvC,QAAI,IAAI,MAAM;AACd,QAAI,MAAM,SAAS;AAEjB,UAAI,IAAI,MAAM,kBAAkB;AAC9B,cAAM,mBAAmB;AAAA,MAC3B;AACA,aAAO;AAAA,IACT;AACA,QAAI,KAAK,MAAM,oBAAoB;AACjC,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AACA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,oBAAoB,KAAK,GAAG;AACnC,YAAM,mBAAmB,KAAK,MAAM,eAAe;AACnD,aAAO;AAAA,IACT;AACA,UAAM,MAAM,yBAAyB;AAAA,EACvC;AACA,SAAO;AACT;AAGA,KAAK,4BAA4B,SAAS,OAAO;AAC/C,SACE,KAAK,wBAAwB,KAAK,KAClC,KAAK,yBAAyB,KAAK,KACnC,KAAK,eAAe,KAAK,KACzB,KAAK,4BAA4B,KAAK,KACtC,KAAK,sCAAsC,OAAO,KAAK,KACtD,CAAC,MAAM,WAAW,KAAK,oCAAoC,KAAK,KACjE,KAAK,yBAAyB,KAAK;AAEvC;AACA,KAAK,2BAA2B,SAAS,OAAO;AAC9C,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,wBAAwB,KAAK,GAAG;AACvC,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AACA,KAAK,iBAAiB,SAAS,OAAO;AACpC,MAAI,MAAM,QAAQ,MAAM,MAAgB,CAAC,eAAe,MAAM,UAAU,CAAC,GAAG;AAC1E,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,gBAAgB,EAAE,GAAG;AACvB,UAAM,eAAe,KAAK;AAC1B,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,SAAS,gBAAgB,IAAI;AAC3B,SACG,MAAM,MAAgB,MAAM,MAC5B,MAAM,MAAgB,MAAM;AAEjC;AAGA,KAAK,wCAAwC,SAAS,OAAO,QAAQ;AACnE,MAAK,WAAW,OAAS,UAAS;AAElC,MAAI,QAAQ,MAAM;AAClB,MAAI,UAAU,UAAU,MAAM;AAE9B,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,yBAAyB,OAAO,CAAC,GAAG;AAC3C,UAAI,OAAO,MAAM;AACjB,UAAI,WAAW,QAAQ,SAAU,QAAQ,OAAQ;AAC/C,YAAI,mBAAmB,MAAM;AAC7B,YAAI,MAAM;AAAA,UAAI;AAAA;AAAA,QAAY,KAAK,MAAM;AAAA,UAAI;AAAA;AAAA,QAAY,KAAK,KAAK,yBAAyB,OAAO,CAAC,GAAG;AACjG,cAAI,QAAQ,MAAM;AAClB,cAAI,SAAS,SAAU,SAAS,OAAQ;AACtC,kBAAM,gBAAgB,OAAO,SAAU,QAAS,QAAQ,SAAU;AAClE,mBAAO;AAAA,UACT;AAAA,QACF;AACA,cAAM,MAAM;AACZ,cAAM,eAAe;AAAA,MACvB;AACA,aAAO;AAAA,IACT;AACA,QACE,WACA,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KACtB,KAAK,oBAAoB,KAAK,KAC9B,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KACtB,eAAe,MAAM,YAAY,GACjC;AACA,aAAO;AAAA,IACT;AACA,QAAI,SAAS;AACX,YAAM,MAAM,wBAAwB;AAAA,IACtC;AACA,UAAM,MAAM;AAAA,EACd;AAEA,SAAO;AACT;AACA,SAAS,eAAe,IAAI;AAC1B,SAAO,MAAM,KAAK,MAAM;AAC1B;AAGA,KAAK,2BAA2B,SAAS,OAAO;AAC9C,MAAI,MAAM,SAAS;AACjB,QAAI,KAAK,0BAA0B,KAAK,GAAG;AACzC,aAAO;AAAA,IACT;AACA,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,YAAM,eAAe;AACrB,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,OAAO,OAAiB,CAAC,MAAM,WAAW,OAAO,MAAe;AAClE,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,QAAM,eAAe;AACrB,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,MAAM,MAAgB,MAAM,IAAc;AAC5C,OAAG;AACD,YAAM,eAAe,KAAK,MAAM,gBAAgB,KAAK;AACrD,YAAM,QAAQ;AAAA,IAChB,UAAU,KAAK,MAAM,QAAQ,MAAM,MAAgB,MAAM;AACzD,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAIA,IAAI,cAAc;AAClB,IAAI,YAAY;AAChB,IAAI,gBAAgB;AAGpB,KAAK,iCAAiC,SAAS,OAAO;AACpD,MAAI,KAAK,MAAM,QAAQ;AAEvB,MAAI,uBAAuB,EAAE,GAAG;AAC9B,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AAEA,MAAI,SAAS;AACb,MACE,MAAM,WACN,KAAK,QAAQ,eAAe,OAC1B,SAAS,OAAO,OAAiB,OAAO,MAC1C;AACA,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,QAAI;AACJ,QACE,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,MACrB,SAAS,KAAK,yCAAyC,KAAK,MAC7D,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GACtB;AACA,UAAI,UAAU,WAAW,eAAe;AAAE,cAAM,MAAM,uBAAuB;AAAA,MAAG;AAChF,aAAO;AAAA,IACT;AACA,UAAM,MAAM,uBAAuB;AAAA,EACrC;AAEA,SAAO;AACT;AAEA,SAAS,uBAAuB,IAAI;AAClC,SACE,OAAO,OACP,OAAO,MACP,OAAO,OACP,OAAO,MACP,OAAO,OACP,OAAO;AAEX;AAKA,KAAK,2CAA2C,SAAS,OAAO;AAC9D,MAAI,QAAQ,MAAM;AAGlB,MAAI,KAAK,8BAA8B,KAAK,KAAK,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AACxE,QAAI,OAAO,MAAM;AACjB,QAAI,KAAK,+BAA+B,KAAK,GAAG;AAC9C,UAAI,QAAQ,MAAM;AAClB,WAAK,2CAA2C,OAAO,MAAM,KAAK;AAClE,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,MAAM;AAGZ,MAAI,KAAK,yCAAyC,KAAK,GAAG;AACxD,QAAI,cAAc,MAAM;AACxB,WAAO,KAAK,0CAA0C,OAAO,WAAW;AAAA,EAC1E;AACA,SAAO;AACT;AAEA,KAAK,6CAA6C,SAAS,OAAO,MAAM,OAAO;AAC7E,MAAI,CAAC,OAAO,MAAM,kBAAkB,WAAW,IAAI,GACjD;AAAE,UAAM,MAAM,uBAAuB;AAAA,EAAG;AAC1C,MAAI,CAAC,MAAM,kBAAkB,UAAU,IAAI,EAAE,KAAK,KAAK,GACrD;AAAE,UAAM,MAAM,wBAAwB;AAAA,EAAG;AAC7C;AAEA,KAAK,4CAA4C,SAAS,OAAO,aAAa;AAC5E,MAAI,MAAM,kBAAkB,OAAO,KAAK,WAAW,GAAG;AAAE,WAAO;AAAA,EAAU;AACzE,MAAI,MAAM,WAAW,MAAM,kBAAkB,gBAAgB,KAAK,WAAW,GAAG;AAAE,WAAO;AAAA,EAAc;AACvG,QAAM,MAAM,uBAAuB;AACrC;AAIA,KAAK,gCAAgC,SAAS,OAAO;AACnD,MAAI,KAAK;AACT,QAAM,kBAAkB;AACxB,SAAO,+BAA+B,KAAK,MAAM,QAAQ,CAAC,GAAG;AAC3D,UAAM,mBAAmB,kBAAkB,EAAE;AAC7C,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,oBAAoB;AACnC;AAEA,SAAS,+BAA+B,IAAI;AAC1C,SAAO,gBAAgB,EAAE,KAAK,OAAO;AACvC;AAIA,KAAK,iCAAiC,SAAS,OAAO;AACpD,MAAI,KAAK;AACT,QAAM,kBAAkB;AACxB,SAAO,gCAAgC,KAAK,MAAM,QAAQ,CAAC,GAAG;AAC5D,UAAM,mBAAmB,kBAAkB,EAAE;AAC7C,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,oBAAoB;AACnC;AACA,SAAS,gCAAgC,IAAI;AAC3C,SAAO,+BAA+B,EAAE,KAAK,eAAe,EAAE;AAChE;AAIA,KAAK,2CAA2C,SAAS,OAAO;AAC9D,SAAO,KAAK,+BAA+B,KAAK;AAClD;AAGA,KAAK,2BAA2B,SAAS,OAAO;AAC9C,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,SAAS,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY;AACnC,QAAI,SAAS,KAAK,qBAAqB,KAAK;AAC5C,QAAI,CAAC,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GACzB;AAAE,YAAM,MAAM,8BAA8B;AAAA,IAAG;AACjD,QAAI,UAAU,WAAW,eACvB;AAAE,YAAM,MAAM,6CAA6C;AAAA,IAAG;AAChE,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAIA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,MAAI,MAAM,QAAQ,MAAM,IAAc;AAAE,WAAO;AAAA,EAAU;AACzD,MAAI,MAAM,SAAS;AAAE,WAAO,KAAK,0BAA0B,KAAK;AAAA,EAAE;AAClE,OAAK,2BAA2B,KAAK;AACrC,SAAO;AACT;AAIA,KAAK,6BAA6B,SAAS,OAAO;AAChD,SAAO,KAAK,oBAAoB,KAAK,GAAG;AACtC,QAAI,OAAO,MAAM;AACjB,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,KAAK,oBAAoB,KAAK,GAAG;AAC9D,UAAI,QAAQ,MAAM;AAClB,UAAI,MAAM,YAAY,SAAS,MAAM,UAAU,KAAK;AAClD,cAAM,MAAM,yBAAyB;AAAA,MACvC;AACA,UAAI,SAAS,MAAM,UAAU,MAAM,OAAO,OAAO;AAC/C,cAAM,MAAM,uCAAuC;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AACF;AAIA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,QAAQ,MAAM;AAElB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,sBAAsB,KAAK,GAAG;AACrC,aAAO;AAAA,IACT;AACA,QAAI,MAAM,SAAS;AAEjB,UAAI,OAAO,MAAM,QAAQ;AACzB,UAAI,SAAS,MAAgB,aAAa,IAAI,GAAG;AAC/C,cAAM,MAAM,sBAAsB;AAAA,MACpC;AACA,YAAM,MAAM,gBAAgB;AAAA,IAC9B;AACA,UAAM,MAAM;AAAA,EACd;AAEA,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,OAAO,IAAc;AACvB,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGA,KAAK,wBAAwB,SAAS,OAAO;AAC3C,MAAI,QAAQ,MAAM;AAElB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,UAAM,eAAe;AACrB,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,WAAW,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC5C,UAAM,eAAe;AACrB,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,MAAM,WAAW,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC7C,QAAI,KAAK,6BAA6B,KAAK,GAAG;AAC5C,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AAEA,SACE,KAAK,+BAA+B,KAAK,KACzC,KAAK,0BAA0B,KAAK;AAExC;AAMA,KAAK,4BAA4B,SAAS,OAAO;AAC/C,MAAI,SAAS,WAAW;AACxB,MAAI,KAAK,wBAAwB,KAAK,EAAG;AAAA,WAAW,YAAY,KAAK,0BAA0B,KAAK,GAAG;AACrG,QAAI,cAAc,eAAe;AAAE,eAAS;AAAA,IAAe;AAE3D,QAAI,QAAQ,MAAM;AAClB,WAAO,MAAM;AAAA,MAAS,CAAC,IAAM,EAAI;AAAA;AAAA,IAAU,GAAG;AAC5C,UACE,MAAM,QAAQ,MAAM,OACnB,YAAY,KAAK,0BAA0B,KAAK,IACjD;AACA,YAAI,cAAc,eAAe;AAAE,mBAAS;AAAA,QAAW;AACvD;AAAA,MACF;AACA,YAAM,MAAM,sCAAsC;AAAA,IACpD;AACA,QAAI,UAAU,MAAM,KAAK;AAAE,aAAO;AAAA,IAAO;AAEzC,WAAO,MAAM;AAAA,MAAS,CAAC,IAAM,EAAI;AAAA;AAAA,IAAU,GAAG;AAC5C,UAAI,KAAK,0BAA0B,KAAK,GAAG;AAAE;AAAA,MAAS;AACtD,YAAM,MAAM,sCAAsC;AAAA,IACpD;AACA,QAAI,UAAU,MAAM,KAAK;AAAE,aAAO;AAAA,IAAO;AAAA,EAC3C,OAAO;AACL,UAAM,MAAM,sCAAsC;AAAA,EACpD;AAEA,aAAS;AACP,QAAI,KAAK,wBAAwB,KAAK,GAAG;AAAE;AAAA,IAAS;AACpD,gBAAY,KAAK,0BAA0B,KAAK;AAChD,QAAI,CAAC,WAAW;AAAE,aAAO;AAAA,IAAO;AAChC,QAAI,cAAc,eAAe;AAAE,eAAS;AAAA,IAAe;AAAA,EAC7D;AACF;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK,4BAA4B,KAAK,GAAG;AAC3C,QAAI,OAAO,MAAM;AACjB,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,KAAK,KAAK,4BAA4B,KAAK,GAAG;AACtE,UAAI,QAAQ,MAAM;AAClB,UAAI,SAAS,MAAM,UAAU,MAAM,OAAO,OAAO;AAC/C,cAAM,MAAM,uCAAuC;AAAA,MACrD;AACA,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,4BAA4B,SAAS,OAAO;AAC/C,MAAI,KAAK,4BAA4B,KAAK,GAAG;AAAE,WAAO;AAAA,EAAU;AAChE,SAAO,KAAK,iCAAiC,KAAK,KAAK,KAAK,sBAAsB,KAAK;AACzF;AAGA,KAAK,wBAAwB,SAAS,OAAO;AAC3C,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,SAAS,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY;AACnC,QAAI,SAAS,KAAK,qBAAqB,KAAK;AAC5C,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,UAAI,UAAU,WAAW,eAAe;AACtC,cAAM,MAAM,6CAA6C;AAAA,MAC3D;AACA,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,WAAW,KAAK,+BAA+B,KAAK;AACxD,QAAI,UAAU;AACZ,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,mCAAmC,SAAS,OAAO;AACtD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAS,CAAC,IAAM,GAAI;AAAA;AAAA,EAAU,GAAG;AACzC,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,UAAI,SAAS,KAAK,sCAAsC,KAAK;AAC7D,UAAI,MAAM;AAAA,QAAI;AAAA;AAAA,MAAY,GAAG;AAC3B,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AAEL,YAAM,MAAM,gBAAgB;AAAA,IAC9B;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,wCAAwC,SAAS,OAAO;AAC3D,MAAI,SAAS,KAAK,mBAAmB,KAAK;AAC1C,SAAO,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC9B,QAAI,KAAK,mBAAmB,KAAK,MAAM,eAAe;AAAE,eAAS;AAAA,IAAe;AAAA,EAClF;AACA,SAAO;AACT;AAIA,KAAK,qBAAqB,SAAS,OAAO;AACxC,MAAI,QAAQ;AACZ,SAAO,KAAK,4BAA4B,KAAK,GAAG;AAAE;AAAA,EAAS;AAC3D,SAAO,UAAU,IAAI,YAAY;AACnC;AAGA,KAAK,8BAA8B,SAAS,OAAO;AACjD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QACE,KAAK,0BAA0B,KAAK,KACpC,KAAK,qCAAqC,KAAK,GAC/C;AACA,aAAO;AAAA,IACT;AACA,QAAI,MAAM;AAAA,MAAI;AAAA;AAAA,IAAY,GAAG;AAC3B,YAAM,eAAe;AACrB,aAAO;AAAA,IACT;AACA,UAAM,MAAM;AACZ,WAAO;AAAA,EACT;AACA,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,KAAK,KAAK,OAAO,MAAM,UAAU,KAAK,4CAA4C,EAAE,GAAG;AAAE,WAAO;AAAA,EAAM;AAC1G,MAAI,0BAA0B,EAAE,GAAG;AAAE,WAAO;AAAA,EAAM;AAClD,QAAM,QAAQ;AACd,QAAM,eAAe;AACrB,SAAO;AACT;AAGA,SAAS,4CAA4C,IAAI;AACvD,SACE,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,MAAM,MAAgB,MAAM,MAC5B,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,OAAO,MACP,OAAO,MACP,OAAO;AAEX;AAGA,SAAS,0BAA0B,IAAI;AACrC,SACE,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,MAAM,OAAgB,MAAM;AAEhC;AAGA,KAAK,uCAAuC,SAAS,OAAO;AAC1D,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,6BAA6B,EAAE,GAAG;AACpC,UAAM,eAAe;AACrB,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,SAAS,6BAA6B,IAAI;AACxC,SACE,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,OAAO,MACP,MAAM,MAAgB,MAAM,MAC5B,OAAO,MACP,OAAO,MACP,OAAO;AAEX;AAGA,KAAK,+BAA+B,SAAS,OAAO;AAClD,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,eAAe,EAAE,KAAK,OAAO,IAAc;AAC7C,UAAM,eAAe,KAAK;AAC1B,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,8BAA8B,SAAS,OAAO;AACjD,MAAI,QAAQ,MAAM;AAClB,MAAI,MAAM;AAAA,IAAI;AAAA;AAAA,EAAY,GAAG;AAC3B,QAAI,KAAK,yBAAyB,OAAO,CAAC,GAAG;AAC3C,aAAO;AAAA,IACT;AACA,QAAI,MAAM,SAAS;AACjB,YAAM,MAAM,gBAAgB;AAAA,IAC9B;AACA,UAAM,MAAM;AAAA,EACd;AACA,SAAO;AACT;AAGA,KAAK,0BAA0B,SAAS,OAAO;AAC7C,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK;AACT,QAAM,eAAe;AACrB,SAAO,eAAe,KAAK,MAAM,QAAQ,CAAC,GAAG;AAC3C,UAAM,eAAe,KAAK,MAAM,gBAAgB,KAAK;AACrD,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,QAAQ;AACvB;AACA,SAAS,eAAe,IAAI;AAC1B,SAAO,MAAM,MAAgB,MAAM;AACrC;AAGA,KAAK,sBAAsB,SAAS,OAAO;AACzC,MAAI,QAAQ,MAAM;AAClB,MAAI,KAAK;AACT,QAAM,eAAe;AACrB,SAAO,WAAW,KAAK,MAAM,QAAQ,CAAC,GAAG;AACvC,UAAM,eAAe,KAAK,MAAM,eAAe,SAAS,EAAE;AAC1D,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO,MAAM,QAAQ;AACvB;AACA,SAAS,WAAW,IAAI;AACtB,SACG,MAAM,MAAgB,MAAM,MAC5B,MAAM,MAAgB,MAAM,MAC5B,MAAM,MAAgB,MAAM;AAEjC;AACA,SAAS,SAAS,IAAI;AACpB,MAAI,MAAM,MAAgB,MAAM,IAAc;AAC5C,WAAO,MAAM,KAAK;AAAA,EACpB;AACA,MAAI,MAAM,MAAgB,MAAM,KAAc;AAC5C,WAAO,MAAM,KAAK;AAAA,EACpB;AACA,SAAO,KAAK;AACd;AAIA,KAAK,sCAAsC,SAAS,OAAO;AACzD,MAAI,KAAK,qBAAqB,KAAK,GAAG;AACpC,QAAI,KAAK,MAAM;AACf,QAAI,KAAK,qBAAqB,KAAK,GAAG;AACpC,UAAI,KAAK,MAAM;AACf,UAAI,MAAM,KAAK,KAAK,qBAAqB,KAAK,GAAG;AAC/C,cAAM,eAAe,KAAK,KAAK,KAAK,IAAI,MAAM;AAAA,MAChD,OAAO;AACL,cAAM,eAAe,KAAK,IAAI;AAAA,MAChC;AAAA,IACF,OAAO;AACL,YAAM,eAAe;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGA,KAAK,uBAAuB,SAAS,OAAO;AAC1C,MAAI,KAAK,MAAM,QAAQ;AACvB,MAAI,aAAa,EAAE,GAAG;AACpB,UAAM,eAAe,KAAK;AAC1B,UAAM,QAAQ;AACd,WAAO;AAAA,EACT;AACA,QAAM,eAAe;AACrB,SAAO;AACT;AACA,SAAS,aAAa,IAAI;AACxB,SAAO,MAAM,MAAgB,MAAM;AACrC;AAKA,KAAK,2BAA2B,SAAS,OAAO,QAAQ;AACtD,MAAI,QAAQ,MAAM;AAClB,QAAM,eAAe;AACrB,WAAS,IAAI,GAAG,IAAI,QAAQ,EAAE,GAAG;AAC/B,QAAI,KAAK,MAAM,QAAQ;AACvB,QAAI,CAAC,WAAW,EAAE,GAAG;AACnB,YAAM,MAAM;AACZ,aAAO;AAAA,IACT;AACA,UAAM,eAAe,KAAK,MAAM,eAAe,SAAS,EAAE;AAC1D,UAAM,QAAQ;AAAA,EAChB;AACA,SAAO;AACT;AAMA,IAAI,QAAQ,SAASC,OAAM,GAAG;AAC5B,OAAK,OAAO,EAAE;AACd,OAAK,QAAQ,EAAE;AACf,OAAK,QAAQ,EAAE;AACf,OAAK,MAAM,EAAE;AACb,MAAI,EAAE,QAAQ,WACZ;AAAE,SAAK,MAAM,IAAI,eAAe,GAAG,EAAE,UAAU,EAAE,MAAM;AAAA,EAAG;AAC5D,MAAI,EAAE,QAAQ,QACZ;AAAE,SAAK,QAAQ,CAAC,EAAE,OAAO,EAAE,GAAG;AAAA,EAAG;AACrC;AAIA,IAAI,KAAK,OAAO;AAIhB,GAAG,OAAO,SAAS,+BAA+B;AAChD,MAAI,CAAC,iCAAiC,KAAK,KAAK,WAAW,KAAK,aAC9D;AAAE,SAAK,iBAAiB,KAAK,OAAO,gCAAgC,KAAK,KAAK,OAAO;AAAA,EAAG;AAC1F,MAAI,KAAK,QAAQ,SACf;AAAE,SAAK,QAAQ,QAAQ,IAAI,MAAM,IAAI,CAAC;AAAA,EAAG;AAE3C,OAAK,aAAa,KAAK;AACvB,OAAK,eAAe,KAAK;AACzB,OAAK,gBAAgB,KAAK;AAC1B,OAAK,kBAAkB,KAAK;AAC5B,OAAK,UAAU;AACjB;AAEA,GAAG,WAAW,WAAW;AACvB,OAAK,KAAK;AACV,SAAO,IAAI,MAAM,IAAI;AACvB;AAGA,IAAI,OAAO,WAAW,aACpB;AAAE,KAAG,OAAO,QAAQ,IAAI,WAAW;AACjC,QAAI,WAAW;AAEf,WAAO;AAAA,MACL,MAAM,WAAY;AAChB,YAAI,QAAQ,SAAS,SAAS;AAC9B,eAAO;AAAA,UACL,MAAM,MAAM,SAAS,QAAQ;AAAA,UAC7B,OAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAG;AAQL,GAAG,YAAY,WAAW;AACxB,MAAI,aAAa,KAAK,WAAW;AACjC,MAAI,CAAC,cAAc,CAAC,WAAW,eAAe;AAAE,SAAK,UAAU;AAAA,EAAG;AAElE,OAAK,QAAQ,KAAK;AAClB,MAAI,KAAK,QAAQ,WAAW;AAAE,SAAK,WAAW,KAAK,YAAY;AAAA,EAAG;AAClE,MAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAE,WAAO,KAAK,YAAY,QAAQ,GAAG;AAAA,EAAE;AAE1E,MAAI,WAAW,UAAU;AAAE,WAAO,WAAW,SAAS,IAAI;AAAA,EAAE,OACvD;AAAE,SAAK,UAAU,KAAK,kBAAkB,CAAC;AAAA,EAAG;AACnD;AAEA,GAAG,YAAY,SAAS,MAAM;AAG5B,MAAI,kBAAkB,MAAM,KAAK,QAAQ,eAAe,CAAC,KAAK,SAAS,IACrE;AAAE,WAAO,KAAK,SAAS;AAAA,EAAE;AAE3B,SAAO,KAAK,iBAAiB,IAAI;AACnC;AAEA,GAAG,oBAAoB,WAAW;AAChC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,GAAG;AACzC,MAAI,QAAQ,SAAU,QAAQ,OAAQ;AAAE,WAAO;AAAA,EAAK;AACpD,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,SAAO,QAAQ,SAAU,QAAQ,QAAS,QAAQ,QAAQ,MAAM,OAAO;AACzE;AAEA,GAAG,mBAAmB,WAAW;AAC/B,MAAI,WAAW,KAAK,QAAQ,aAAa,KAAK,YAAY;AAC1D,MAAI,QAAQ,KAAK,KAAK,MAAM,KAAK,MAAM,QAAQ,MAAM,KAAK,OAAO,CAAC;AAClE,MAAI,QAAQ,IAAI;AAAE,SAAK,MAAM,KAAK,MAAM,GAAG,sBAAsB;AAAA,EAAG;AACpE,OAAK,MAAM,MAAM;AACjB,MAAI,KAAK,QAAQ,WAAW;AAC1B,aAAS,YAAa,QAAS,MAAM,QAAQ,YAAY,cAAc,KAAK,OAAO,KAAK,KAAK,GAAG,KAAK,MAAK;AACxG,QAAE,KAAK;AACP,YAAM,KAAK,YAAY;AAAA,IACzB;AAAA,EACF;AACA,MAAI,KAAK,QAAQ,WACf;AAAE,SAAK,QAAQ;AAAA,MAAU;AAAA,MAAM,KAAK,MAAM,MAAM,QAAQ,GAAG,GAAG;AAAA,MAAG;AAAA,MAAO,KAAK;AAAA,MACtD;AAAA,MAAU,KAAK,YAAY;AAAA,IAAC;AAAA,EAAG;AAC1D;AAEA,GAAG,kBAAkB,SAAS,WAAW;AACvC,MAAI,QAAQ,KAAK;AACjB,MAAI,WAAW,KAAK,QAAQ,aAAa,KAAK,YAAY;AAC1D,MAAI,KAAK,KAAK,MAAM,WAAW,KAAK,OAAO,SAAS;AACpD,SAAO,KAAK,MAAM,KAAK,MAAM,UAAU,CAAC,UAAU,EAAE,GAAG;AACrD,SAAK,KAAK,MAAM,WAAW,EAAE,KAAK,GAAG;AAAA,EACvC;AACA,MAAI,KAAK,QAAQ,WACf;AAAE,SAAK,QAAQ;AAAA,MAAU;AAAA,MAAO,KAAK,MAAM,MAAM,QAAQ,WAAW,KAAK,GAAG;AAAA,MAAG;AAAA,MAAO,KAAK;AAAA,MACpE;AAAA,MAAU,KAAK,YAAY;AAAA,IAAC;AAAA,EAAG;AAC1D;AAKA,GAAG,YAAY,WAAW;AACxB,OAAM,QAAO,KAAK,MAAM,KAAK,MAAM,QAAQ;AACzC,QAAI,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACvC,YAAQ,IAAI;AAAA,MACZ,KAAK;AAAA,MAAI,KAAK;AACZ,UAAE,KAAK;AACP;AAAA,MACF,KAAK;AACH,YAAI,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,IAAI;AAC9C,YAAE,KAAK;AAAA,QACT;AAAA,MACF,KAAK;AAAA,MAAI,KAAK;AAAA,MAAM,KAAK;AACvB,UAAE,KAAK;AACP,YAAI,KAAK,QAAQ,WAAW;AAC1B,YAAE,KAAK;AACP,eAAK,YAAY,KAAK;AAAA,QACxB;AACA;AAAA,MACF,KAAK;AACH,gBAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,GAAG;AAAA,UAC7C,KAAK;AACH,iBAAK,iBAAiB;AACtB;AAAA,UACF,KAAK;AACH,iBAAK,gBAAgB,CAAC;AACtB;AAAA,UACF;AACE,kBAAM;AAAA,QACR;AACA;AAAA,MACF;AACE,YAAI,KAAK,KAAK,KAAK,MAAM,MAAM,QAAQ,mBAAmB,KAAK,OAAO,aAAa,EAAE,CAAC,GAAG;AACvF,YAAE,KAAK;AAAA,QACT,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,IACF;AAAA,EACF;AACF;AAOA,GAAG,cAAc,SAAS,MAAM,KAAK;AACnC,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,QAAQ,WAAW;AAAE,SAAK,SAAS,KAAK,YAAY;AAAA,EAAG;AAChE,MAAI,WAAW,KAAK;AACpB,OAAK,OAAO;AACZ,OAAK,QAAQ;AAEb,OAAK,cAAc,QAAQ;AAC7B;AAWA,GAAG,gBAAgB,WAAW;AAC5B,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,QAAQ,MAAM,QAAQ,IAAI;AAAE,WAAO,KAAK,WAAW,IAAI;AAAA,EAAE;AAC7D,MAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC9C,MAAI,KAAK,QAAQ,eAAe,KAAK,SAAS,MAAM,UAAU,IAAI;AAChE,SAAK,OAAO;AACZ,WAAO,KAAK,YAAY,QAAQ,QAAQ;AAAA,EAC1C,OAAO;AACL,MAAE,KAAK;AACP,WAAO,KAAK,YAAY,QAAQ,GAAG;AAAA,EACrC;AACF;AAEA,GAAG,kBAAkB,WAAW;AAC9B,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,KAAK,aAAa;AAAE,MAAE,KAAK;AAAK,WAAO,KAAK,WAAW;AAAA,EAAE;AAC7D,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EAAE;AAC3D,SAAO,KAAK,SAAS,QAAQ,OAAO,CAAC;AACvC;AAEA,GAAG,4BAA4B,SAAS,MAAM;AAC5C,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,OAAO;AACX,MAAI,YAAY,SAAS,KAAK,QAAQ,OAAO,QAAQ;AAGrD,MAAI,KAAK,QAAQ,eAAe,KAAK,SAAS,MAAM,SAAS,IAAI;AAC/D,MAAE;AACF,gBAAY,QAAQ;AACpB,WAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAAA,EAC3C;AAEA,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,OAAO,CAAC;AAAA,EAAE;AAClE,SAAO,KAAK,SAAS,WAAW,IAAI;AACtC;AAEA,GAAG,qBAAqB,SAAS,MAAM;AACrC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,SAAS,MAAM;AACjB,QAAI,KAAK,QAAQ,eAAe,IAAI;AAClC,UAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC9C,UAAI,UAAU,IAAI;AAAE,eAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,MAAE;AAAA,IAC9D;AACA,WAAO,KAAK,SAAS,SAAS,MAAM,QAAQ,YAAY,QAAQ,YAAY,CAAC;AAAA,EAC/E;AACA,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EAAE;AAC3D,SAAO,KAAK,SAAS,SAAS,MAAM,QAAQ,YAAY,QAAQ,YAAY,CAAC;AAC/E;AAEA,GAAG,kBAAkB,WAAW;AAC9B,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EAAE;AAC3D,SAAO,KAAK,SAAS,QAAQ,YAAY,CAAC;AAC5C;AAEA,GAAG,qBAAqB,SAAS,MAAM;AACrC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,SAAS,MAAM;AACjB,QAAI,SAAS,MAAM,CAAC,KAAK,YAAY,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,OACxE,KAAK,eAAe,KAAK,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,YAAY,KAAK,GAAG,CAAC,IAAI;AAE1F,WAAK,gBAAgB,CAAC;AACtB,WAAK,UAAU;AACf,aAAO,KAAK,UAAU;AAAA,IACxB;AACA,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EACxC;AACA,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,EAAE;AAC3D,SAAO,KAAK,SAAS,QAAQ,SAAS,CAAC;AACzC;AAEA,GAAG,kBAAkB,SAAS,MAAM;AAClC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,OAAO;AACX,MAAI,SAAS,MAAM;AACjB,WAAO,SAAS,MAAM,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,KAAK,IAAI;AACvE,QAAI,KAAK,MAAM,WAAW,KAAK,MAAM,IAAI,MAAM,IAAI;AAAE,aAAO,KAAK,SAAS,QAAQ,QAAQ,OAAO,CAAC;AAAA,IAAE;AACpG,WAAO,KAAK,SAAS,QAAQ,UAAU,IAAI;AAAA,EAC7C;AACA,MAAI,SAAS,MAAM,SAAS,MAAM,CAAC,KAAK,YAAY,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,MACxF,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,IAAI;AAE9C,SAAK,gBAAgB,CAAC;AACtB,SAAK,UAAU;AACf,WAAO,KAAK,UAAU;AAAA,EACxB;AACA,MAAI,SAAS,IAAI;AAAE,WAAO;AAAA,EAAG;AAC7B,SAAO,KAAK,SAAS,QAAQ,YAAY,IAAI;AAC/C;AAEA,GAAG,oBAAoB,SAAS,MAAM;AACpC,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,MAAI,SAAS,IAAI;AAAE,WAAO,KAAK,SAAS,QAAQ,UAAU,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EAAE;AAC9G,MAAI,SAAS,MAAM,SAAS,MAAM,KAAK,QAAQ,eAAe,GAAG;AAC/D,SAAK,OAAO;AACZ,WAAO,KAAK,YAAY,QAAQ,KAAK;AAAA,EACvC;AACA,SAAO,KAAK,SAAS,SAAS,KAAK,QAAQ,KAAK,QAAQ,QAAQ,CAAC;AACnE;AAEA,GAAG,qBAAqB,WAAW;AACjC,MAAI,cAAc,KAAK,QAAQ;AAC/B,MAAI,eAAe,IAAI;AACrB,QAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,QAAI,SAAS,IAAI;AACf,UAAI,QAAQ,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC9C,UAAI,QAAQ,MAAM,QAAQ,IAAI;AAAE,eAAO,KAAK,SAAS,QAAQ,aAAa,CAAC;AAAA,MAAE;AAAA,IAC/E;AACA,QAAI,SAAS,IAAI;AACf,UAAI,eAAe,IAAI;AACrB,YAAI,UAAU,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAChD,YAAI,YAAY,IAAI;AAAE,iBAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,QAAE;AAAA,MAChE;AACA,aAAO,KAAK,SAAS,QAAQ,UAAU,CAAC;AAAA,IAC1C;AAAA,EACF;AACA,SAAO,KAAK,SAAS,QAAQ,UAAU,CAAC;AAC1C;AAEA,GAAG,uBAAuB,WAAW;AACnC,MAAI,cAAc,KAAK,QAAQ;AAC/B,MAAI,OAAO;AACX,MAAI,eAAe,IAAI;AACrB,MAAE,KAAK;AACP,WAAO,KAAK,kBAAkB;AAC9B,QAAI,kBAAkB,MAAM,IAAI,KAAK,SAAS,IAAc;AAC1D,aAAO,KAAK,YAAY,QAAQ,WAAW,KAAK,UAAU,CAAC;AAAA,IAC7D;AAAA,EACF;AAEA,OAAK,MAAM,KAAK,KAAK,2BAA2B,kBAAkB,IAAI,IAAI,GAAG;AAC/E;AAEA,GAAG,mBAAmB,SAAS,MAAM;AACnC,UAAQ,MAAM;AAAA;AAAA;AAAA,IAGd,KAAK;AACH,aAAO,KAAK,cAAc;AAAA;AAAA,IAG5B,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC3D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC3D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,IAAI;AAAA,IACzD,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,KAAK;AAAA,IAC1D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,QAAQ;AAAA,IAC7D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,QAAQ;AAAA,IAC7D,KAAK;AAAK,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC5D,KAAK;AAAK,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,MAAM;AAAA,IAC5D,KAAK;AAAI,QAAE,KAAK;AAAK,aAAO,KAAK,YAAY,QAAQ,KAAK;AAAA,IAE1D,KAAK;AACH,UAAI,KAAK,QAAQ,cAAc,GAAG;AAAE;AAAA,MAAM;AAC1C,QAAE,KAAK;AACP,aAAO,KAAK,YAAY,QAAQ,SAAS;AAAA,IAE3C,KAAK;AACH,UAAI,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC;AAC7C,UAAI,SAAS,OAAO,SAAS,IAAI;AAAE,eAAO,KAAK,gBAAgB,EAAE;AAAA,MAAE;AACnE,UAAI,KAAK,QAAQ,eAAe,GAAG;AACjC,YAAI,SAAS,OAAO,SAAS,IAAI;AAAE,iBAAO,KAAK,gBAAgB,CAAC;AAAA,QAAE;AAClE,YAAI,SAAS,MAAM,SAAS,IAAI;AAAE,iBAAO,KAAK,gBAAgB,CAAC;AAAA,QAAE;AAAA,MACnE;AAAA;AAAA;AAAA,IAIF,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAAA,IAAI,KAAK;AAC3E,aAAO,KAAK,WAAW,KAAK;AAAA;AAAA,IAG9B,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,WAAW,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAM7B,KAAK;AACH,aAAO,KAAK,gBAAgB;AAAA,IAE9B,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,0BAA0B,IAAI;AAAA,IAE5C,KAAK;AAAA,IAAK,KAAK;AACb,aAAO,KAAK,mBAAmB,IAAI;AAAA,IAErC,KAAK;AACH,aAAO,KAAK,gBAAgB;AAAA,IAE9B,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,mBAAmB,IAAI;AAAA,IAErC,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,gBAAgB,IAAI;AAAA,IAElC,KAAK;AAAA,IAAI,KAAK;AACZ,aAAO,KAAK,kBAAkB,IAAI;AAAA,IAEpC,KAAK;AACH,aAAO,KAAK,mBAAmB;AAAA,IAEjC,KAAK;AACH,aAAO,KAAK,SAAS,QAAQ,QAAQ,CAAC;AAAA,IAExC,KAAK;AACH,aAAO,KAAK,qBAAqB;AAAA,EACnC;AAEA,OAAK,MAAM,KAAK,KAAK,2BAA2B,kBAAkB,IAAI,IAAI,GAAG;AAC/E;AAEA,GAAG,WAAW,SAAS,MAAM,MAAM;AACjC,MAAI,MAAM,KAAK,MAAM,MAAM,KAAK,KAAK,KAAK,MAAM,IAAI;AACpD,OAAK,OAAO;AACZ,SAAO,KAAK,YAAY,MAAM,GAAG;AACnC;AAEA,GAAG,aAAa,WAAW;AACzB,MAAI,SAAS,SAAS,QAAQ,KAAK;AACnC,aAAS;AACP,QAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAE,WAAK,MAAM,OAAO,iCAAiC;AAAA,IAAG;AAC3F,QAAI,KAAK,KAAK,MAAM,OAAO,KAAK,GAAG;AACnC,QAAI,UAAU,KAAK,EAAE,GAAG;AAAE,WAAK,MAAM,OAAO,iCAAiC;AAAA,IAAG;AAChF,QAAI,CAAC,SAAS;AACZ,UAAI,OAAO,KAAK;AAAE,kBAAU;AAAA,MAAM,WACzB,OAAO,OAAO,SAAS;AAAE,kBAAU;AAAA,MAAO,WAC1C,OAAO,OAAO,CAAC,SAAS;AAAE;AAAA,MAAM;AACzC,gBAAU,OAAO;AAAA,IACnB,OAAO;AAAE,gBAAU;AAAA,IAAO;AAC1B,MAAE,KAAK;AAAA,EACT;AACA,MAAI,UAAU,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG;AAC9C,IAAE,KAAK;AACP,MAAI,aAAa,KAAK;AACtB,MAAI,QAAQ,KAAK,UAAU;AAC3B,MAAI,KAAK,aAAa;AAAE,SAAK,WAAW,UAAU;AAAA,EAAG;AAGrD,MAAI,QAAQ,KAAK,gBAAgB,KAAK,cAAc,IAAI,sBAAsB,IAAI;AAClF,QAAM,MAAM,OAAO,SAAS,KAAK;AACjC,OAAK,oBAAoB,KAAK;AAC9B,OAAK,sBAAsB,KAAK;AAGhC,MAAI,QAAQ;AACZ,MAAI;AACF,YAAQ,IAAI,OAAO,SAAS,KAAK;AAAA,EACnC,SAAS,GAAG;AAAA,EAGZ;AAEA,SAAO,KAAK,YAAY,QAAQ,QAAQ,EAAC,SAAkB,OAAc,MAAY,CAAC;AACxF;AAMA,GAAG,UAAU,SAAS,OAAO,KAAK,gCAAgC;AAEhE,MAAI,kBAAkB,KAAK,QAAQ,eAAe,MAAM,QAAQ;AAKhE,MAAI,8BAA8B,kCAAkC,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM;AAExG,MAAI,QAAQ,KAAK,KAAK,QAAQ,GAAG,WAAW;AAC5C,WAAS,IAAI,GAAG,IAAI,OAAO,OAAO,WAAW,KAAK,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,KAAK;AACxE,QAAI,OAAO,KAAK,MAAM,WAAW,KAAK,GAAG,GAAG,MAAO;AAEnD,QAAI,mBAAmB,SAAS,IAAI;AAClC,UAAI,6BAA6B;AAAE,aAAK,iBAAiB,KAAK,KAAK,mEAAmE;AAAA,MAAG;AACzI,UAAI,aAAa,IAAI;AAAE,aAAK,iBAAiB,KAAK,KAAK,kDAAkD;AAAA,MAAG;AAC5G,UAAI,MAAM,GAAG;AAAE,aAAK,iBAAiB,KAAK,KAAK,yDAAyD;AAAA,MAAG;AAC3G,iBAAW;AACX;AAAA,IACF;AAEA,QAAI,QAAQ,IAAI;AAAE,YAAM,OAAO,KAAK;AAAA,IAAI,WAC/B,QAAQ,IAAI;AAAE,YAAM,OAAO,KAAK;AAAA,IAAI,WACpC,QAAQ,MAAM,QAAQ,IAAI;AAAE,YAAM,OAAO;AAAA,IAAI,OACjD;AAAE,YAAM;AAAA,IAAU;AACvB,QAAI,OAAO,OAAO;AAAE;AAAA,IAAM;AAC1B,eAAW;AACX,YAAQ,QAAQ,QAAQ;AAAA,EAC1B;AAEA,MAAI,mBAAmB,aAAa,IAAI;AAAE,SAAK,iBAAiB,KAAK,MAAM,GAAG,wDAAwD;AAAA,EAAG;AACzI,MAAI,KAAK,QAAQ,SAAS,OAAO,QAAQ,KAAK,MAAM,UAAU,KAAK;AAAE,WAAO;AAAA,EAAK;AAEjF,SAAO;AACT;AAEA,SAAS,eAAe,KAAK,6BAA6B;AACxD,MAAI,6BAA6B;AAC/B,WAAO,SAAS,KAAK,CAAC;AAAA,EACxB;AAGA,SAAO,WAAW,IAAI,QAAQ,MAAM,EAAE,CAAC;AACzC;AAEA,SAAS,eAAe,KAAK;AAC3B,MAAI,OAAO,WAAW,YAAY;AAChC,WAAO;AAAA,EACT;AAGA,SAAO,OAAO,IAAI,QAAQ,MAAM,EAAE,CAAC;AACrC;AAEA,GAAG,kBAAkB,SAAS,OAAO;AACnC,MAAI,QAAQ,KAAK;AACjB,OAAK,OAAO;AACZ,MAAI,MAAM,KAAK,QAAQ,KAAK;AAC5B,MAAI,OAAO,MAAM;AAAE,SAAK,MAAM,KAAK,QAAQ,GAAG,8BAA8B,KAAK;AAAA,EAAG;AACpF,MAAI,KAAK,QAAQ,eAAe,MAAM,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM,KAAK;AAC7E,UAAM,eAAe,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG,CAAC;AACtD,MAAE,KAAK;AAAA,EACT,WAAW,kBAAkB,KAAK,kBAAkB,CAAC,GAAG;AAAE,SAAK,MAAM,KAAK,KAAK,kCAAkC;AAAA,EAAG;AACpH,SAAO,KAAK,YAAY,QAAQ,KAAK,GAAG;AAC1C;AAIA,GAAG,aAAa,SAAS,eAAe;AACtC,MAAI,QAAQ,KAAK;AACjB,MAAI,CAAC,iBAAiB,KAAK,QAAQ,IAAI,QAAW,IAAI,MAAM,MAAM;AAAE,SAAK,MAAM,OAAO,gBAAgB;AAAA,EAAG;AACzG,MAAI,QAAQ,KAAK,MAAM,SAAS,KAAK,KAAK,MAAM,WAAW,KAAK,MAAM;AACtE,MAAI,SAAS,KAAK,QAAQ;AAAE,SAAK,MAAM,OAAO,gBAAgB;AAAA,EAAG;AACjE,MAAI,OAAO,KAAK,MAAM,WAAW,KAAK,GAAG;AACzC,MAAI,CAAC,SAAS,CAAC,iBAAiB,KAAK,QAAQ,eAAe,MAAM,SAAS,KAAK;AAC9E,QAAI,QAAQ,eAAe,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG,CAAC;AAC5D,MAAE,KAAK;AACP,QAAI,kBAAkB,KAAK,kBAAkB,CAAC,GAAG;AAAE,WAAK,MAAM,KAAK,KAAK,kCAAkC;AAAA,IAAG;AAC7G,WAAO,KAAK,YAAY,QAAQ,KAAK,KAAK;AAAA,EAC5C;AACA,MAAI,SAAS,OAAO,KAAK,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG,CAAC,GAAG;AAAE,YAAQ;AAAA,EAAO;AAC9E,MAAI,SAAS,MAAM,CAAC,OAAO;AACzB,MAAE,KAAK;AACP,SAAK,QAAQ,EAAE;AACf,WAAO,KAAK,MAAM,WAAW,KAAK,GAAG;AAAA,EACvC;AACA,OAAK,SAAS,MAAM,SAAS,QAAQ,CAAC,OAAO;AAC3C,WAAO,KAAK,MAAM,WAAW,EAAE,KAAK,GAAG;AACvC,QAAI,SAAS,MAAM,SAAS,IAAI;AAAE,QAAE,KAAK;AAAA,IAAK;AAC9C,QAAI,KAAK,QAAQ,EAAE,MAAM,MAAM;AAAE,WAAK,MAAM,OAAO,gBAAgB;AAAA,IAAG;AAAA,EACxE;AACA,MAAI,kBAAkB,KAAK,kBAAkB,CAAC,GAAG;AAAE,SAAK,MAAM,KAAK,KAAK,kCAAkC;AAAA,EAAG;AAE7G,MAAI,MAAM,eAAe,KAAK,MAAM,MAAM,OAAO,KAAK,GAAG,GAAG,KAAK;AACjE,SAAO,KAAK,YAAY,QAAQ,KAAK,GAAG;AAC1C;AAIA,GAAG,gBAAgB,WAAW;AAC5B,MAAI,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG,GAAG;AAE1C,MAAI,OAAO,KAAK;AACd,QAAI,KAAK,QAAQ,cAAc,GAAG;AAAE,WAAK,WAAW;AAAA,IAAG;AACvD,QAAI,UAAU,EAAE,KAAK;AACrB,WAAO,KAAK,YAAY,KAAK,MAAM,QAAQ,KAAK,KAAK,GAAG,IAAI,KAAK,GAAG;AACpE,MAAE,KAAK;AACP,QAAI,OAAO,SAAU;AAAE,WAAK,mBAAmB,SAAS,0BAA0B;AAAA,IAAG;AAAA,EACvF,OAAO;AACL,WAAO,KAAK,YAAY,CAAC;AAAA,EAC3B;AACA,SAAO;AACT;AAEA,GAAG,aAAa,SAAS,OAAO;AAC9B,MAAI,MAAM,IAAI,aAAa,EAAE,KAAK;AAClC,aAAS;AACP,QAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAE,WAAK,MAAM,KAAK,OAAO,8BAA8B;AAAA,IAAG;AAC7F,QAAI,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACvC,QAAI,OAAO,OAAO;AAAE;AAAA,IAAM;AAC1B,QAAI,OAAO,IAAI;AACb,aAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC5C,aAAO,KAAK,gBAAgB,KAAK;AACjC,mBAAa,KAAK;AAAA,IACpB,WAAW,OAAO,QAAU,OAAO,MAAQ;AACzC,UAAI,KAAK,QAAQ,cAAc,IAAI;AAAE,aAAK,MAAM,KAAK,OAAO,8BAA8B;AAAA,MAAG;AAC7F,QAAE,KAAK;AACP,UAAI,KAAK,QAAQ,WAAW;AAC1B,aAAK;AACL,aAAK,YAAY,KAAK;AAAA,MACxB;AAAA,IACF,OAAO;AACL,UAAI,UAAU,EAAE,GAAG;AAAE,aAAK,MAAM,KAAK,OAAO,8BAA8B;AAAA,MAAG;AAC7E,QAAE,KAAK;AAAA,IACT;AAAA,EACF;AACA,SAAO,KAAK,MAAM,MAAM,YAAY,KAAK,KAAK;AAC9C,SAAO,KAAK,YAAY,QAAQ,QAAQ,GAAG;AAC7C;AAIA,IAAI,gCAAgC,CAAC;AAErC,GAAG,uBAAuB,WAAW;AACnC,OAAK,oBAAoB;AACzB,MAAI;AACF,SAAK,cAAc;AAAA,EACrB,SAAS,KAAK;AACZ,QAAI,QAAQ,+BAA+B;AACzC,WAAK,yBAAyB;AAAA,IAChC,OAAO;AACL,YAAM;AAAA,IACR;AAAA,EACF;AAEA,OAAK,oBAAoB;AAC3B;AAEA,GAAG,qBAAqB,SAAS,UAAU,SAAS;AAClD,MAAI,KAAK,qBAAqB,KAAK,QAAQ,eAAe,GAAG;AAC3D,UAAM;AAAA,EACR,OAAO;AACL,SAAK,MAAM,UAAU,OAAO;AAAA,EAC9B;AACF;AAEA,GAAG,gBAAgB,WAAW;AAC5B,MAAI,MAAM,IAAI,aAAa,KAAK;AAChC,aAAS;AACP,QAAI,KAAK,OAAO,KAAK,MAAM,QAAQ;AAAE,WAAK,MAAM,KAAK,OAAO,uBAAuB;AAAA,IAAG;AACtF,QAAI,KAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,MAAM,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,KAAK;AACzE,UAAI,KAAK,QAAQ,KAAK,UAAU,KAAK,SAAS,QAAQ,YAAY,KAAK,SAAS,QAAQ,kBAAkB;AACxG,YAAI,OAAO,IAAI;AACb,eAAK,OAAO;AACZ,iBAAO,KAAK,YAAY,QAAQ,YAAY;AAAA,QAC9C,OAAO;AACL,YAAE,KAAK;AACP,iBAAO,KAAK,YAAY,QAAQ,SAAS;AAAA,QAC3C;AAAA,MACF;AACA,aAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC5C,aAAO,KAAK,YAAY,QAAQ,UAAU,GAAG;AAAA,IAC/C;AACA,QAAI,OAAO,IAAI;AACb,aAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC5C,aAAO,KAAK,gBAAgB,IAAI;AAChC,mBAAa,KAAK;AAAA,IACpB,WAAW,UAAU,EAAE,GAAG;AACxB,aAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC5C,QAAE,KAAK;AACP,cAAQ,IAAI;AAAA,QACZ,KAAK;AACH,cAAI,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM,IAAI;AAAE,cAAE,KAAK;AAAA,UAAK;AAAA,QAC5D,KAAK;AACH,iBAAO;AACP;AAAA,QACF;AACE,iBAAO,OAAO,aAAa,EAAE;AAC7B;AAAA,MACF;AACA,UAAI,KAAK,QAAQ,WAAW;AAC1B,UAAE,KAAK;AACP,aAAK,YAAY,KAAK;AAAA,MACxB;AACA,mBAAa,KAAK;AAAA,IACpB,OAAO;AACL,QAAE,KAAK;AAAA,IACT;AAAA,EACF;AACF;AAGA,GAAG,2BAA2B,WAAW;AACvC,SAAO,KAAK,MAAM,KAAK,MAAM,QAAQ,KAAK,OAAO;AAC/C,YAAQ,KAAK,MAAM,KAAK,GAAG,GAAG;AAAA,MAC9B,KAAK;AACH,UAAE,KAAK;AACP;AAAA,MAEF,KAAK;AACH,YAAI,KAAK,MAAM,KAAK,MAAM,CAAC,MAAM,KAAK;AAAE;AAAA,QAAM;AAAA;AAAA,MAEhD,KAAK;AACH,eAAO,KAAK,YAAY,QAAQ,iBAAiB,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK,GAAG,CAAC;AAAA,MAEzF,KAAK;AACH,YAAI,KAAK,MAAM,KAAK,MAAM,CAAC,MAAM,MAAM;AAAE,YAAE,KAAK;AAAA,QAAK;AAAA;AAAA,MAEvD,KAAK;AAAA,MAAM,KAAK;AAAA,MAAU,KAAK;AAC7B,UAAE,KAAK;AACP,aAAK,YAAY,KAAK,MAAM;AAC5B;AAAA,IACF;AAAA,EACF;AACA,OAAK,MAAM,KAAK,OAAO,uBAAuB;AAChD;AAIA,GAAG,kBAAkB,SAAS,YAAY;AACxC,MAAI,KAAK,KAAK,MAAM,WAAW,EAAE,KAAK,GAAG;AACzC,IAAE,KAAK;AACP,UAAQ,IAAI;AAAA,IACZ,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAK,aAAO,OAAO,aAAa,KAAK,YAAY,CAAC,CAAC;AAAA;AAAA,IACxD,KAAK;AAAK,aAAO,kBAAkB,KAAK,cAAc,CAAC;AAAA;AAAA,IACvD,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAI,aAAO;AAAA;AAAA,IAChB,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAK,aAAO;AAAA;AAAA,IACjB,KAAK;AAAI,UAAI,KAAK,MAAM,WAAW,KAAK,GAAG,MAAM,IAAI;AAAE,UAAE,KAAK;AAAA,MAAK;AAAA;AAAA,IACnE,KAAK;AACH,UAAI,KAAK,QAAQ,WAAW;AAAE,aAAK,YAAY,KAAK;AAAK,UAAE,KAAK;AAAA,MAAS;AACzE,aAAO;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AACH,UAAI,KAAK,QAAQ;AACf,aAAK;AAAA,UACH,KAAK,MAAM;AAAA,UACX;AAAA,QACF;AAAA,MACF;AACA,UAAI,YAAY;AACd,YAAI,UAAU,KAAK,MAAM;AAEzB,aAAK;AAAA,UACH;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACE,UAAI,MAAM,MAAM,MAAM,IAAI;AACxB,YAAI,WAAW,KAAK,MAAM,OAAO,KAAK,MAAM,GAAG,CAAC,EAAE,MAAM,SAAS,EAAE,CAAC;AACpE,YAAI,QAAQ,SAAS,UAAU,CAAC;AAChC,YAAI,QAAQ,KAAK;AACf,qBAAW,SAAS,MAAM,GAAG,EAAE;AAC/B,kBAAQ,SAAS,UAAU,CAAC;AAAA,QAC9B;AACA,aAAK,OAAO,SAAS,SAAS;AAC9B,aAAK,KAAK,MAAM,WAAW,KAAK,GAAG;AACnC,aAAK,aAAa,OAAO,OAAO,MAAM,OAAO,QAAQ,KAAK,UAAU,aAAa;AAC/E,eAAK;AAAA,YACH,KAAK,MAAM,IAAI,SAAS;AAAA,YACxB,aACI,qCACA;AAAA,UACN;AAAA,QACF;AACA,eAAO,OAAO,aAAa,KAAK;AAAA,MAClC;AACA,UAAI,UAAU,EAAE,GAAG;AAGjB,YAAI,KAAK,QAAQ,WAAW;AAAE,eAAK,YAAY,KAAK;AAAK,YAAE,KAAK;AAAA,QAAS;AACzE,eAAO;AAAA,MACT;AACA,aAAO,OAAO,aAAa,EAAE;AAAA,EAC/B;AACF;AAIA,GAAG,cAAc,SAAS,KAAK;AAC7B,MAAI,UAAU,KAAK;AACnB,MAAI,IAAI,KAAK,QAAQ,IAAI,GAAG;AAC5B,MAAI,MAAM,MAAM;AAAE,SAAK,mBAAmB,SAAS,+BAA+B;AAAA,EAAG;AACrF,SAAO;AACT;AAQA,GAAG,YAAY,WAAW;AACxB,OAAK,cAAc;AACnB,MAAI,OAAO,IAAI,QAAQ,MAAM,aAAa,KAAK;AAC/C,MAAI,SAAS,KAAK,QAAQ,eAAe;AACzC,SAAO,KAAK,MAAM,KAAK,MAAM,QAAQ;AACnC,QAAI,KAAK,KAAK,kBAAkB;AAChC,QAAI,iBAAiB,IAAI,MAAM,GAAG;AAChC,WAAK,OAAO,MAAM,QAAS,IAAI;AAAA,IACjC,WAAW,OAAO,IAAI;AACpB,WAAK,cAAc;AACnB,cAAQ,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AAC7C,UAAI,WAAW,KAAK;AACpB,UAAI,KAAK,MAAM,WAAW,EAAE,KAAK,GAAG,MAAM,KACxC;AAAE,aAAK,mBAAmB,KAAK,KAAK,2CAA2C;AAAA,MAAG;AACpF,QAAE,KAAK;AACP,UAAI,MAAM,KAAK,cAAc;AAC7B,UAAI,EAAE,QAAQ,oBAAoB,kBAAkB,KAAK,MAAM,GAC7D;AAAE,aAAK,mBAAmB,UAAU,wBAAwB;AAAA,MAAG;AACjE,cAAQ,kBAAkB,GAAG;AAC7B,mBAAa,KAAK;AAAA,IACpB,OAAO;AACL;AAAA,IACF;AACA,YAAQ;AAAA,EACV;AACA,SAAO,OAAO,KAAK,MAAM,MAAM,YAAY,KAAK,GAAG;AACrD;AAKA,GAAG,WAAW,WAAW;AACvB,MAAI,OAAO,KAAK,UAAU;AAC1B,MAAI,OAAO,QAAQ;AACnB,MAAI,KAAK,SAAS,KAAK,IAAI,GAAG;AAC5B,WAAO,SAAS,IAAI;AAAA,EACtB;AACA,SAAO,KAAK,YAAY,MAAM,IAAI;AACpC;AAiBA,IAAI,UAAU;AAEd,OAAO,QAAQ;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,cAAc;AAAA,EACd;AAAA,EACA,aAAa;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAQA,SAAST,OAAM,OAAO,SAAS;AAC7B,SAAO,OAAO,MAAM,OAAO,OAAO;AACpC;;;AChkMO,SAAS,WAAW,IAAoB;AAE7C,SAAO,GAAG,QAAQ,kBAAkB,GAAG;AACzC;;;ACiBO,SAAS,sBAAsB,SAAc,UAAmC;AACrF,MAAI,YAAY,QAAQ,YAAY,QAAW;AAC7C,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,YAAY,YAAY,QAAQ,WAAW,QAAW;AAC/D,QAAI,OAAO,QAAQ,WAAW,UAAU;AACtC,YAAM,IAAI;AAAA,QACR;AAAA;AAAA,QAEA,EAAE,GAAG,UAAU,OAAO,iBAAiB;AAAA,MACzC;AAAA,IACF;AACA,WAAO,QAAQ;AAAA,EACjB;AAEA,MAAI,OAAO,YAAY,UAAU;AAC/B,WAAO;AAAA,EACT;AAEA,QAAM,IAAI;AAAA,IACR;AAAA;AAAA,IAEA,EAAE,GAAG,UAAU,OAAO,UAAU;AAAA,EAClC;AACF;AASO,SAAS,kBAAkB,QAAgB,UAAgD;AAChG,QAAM,UAA+B;AAAA,IACnC;AAAA,IACA,YAAY,CAAC;AAAA,EACf;AAEA,MAAI;AAEF,UAAM,MAAMU,OAAW,QAAQ;AAAA,MAC7B,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,2BAA2B;AAAA,IAC7B,CAAC;AAED,YAAQ,MAAM;AAEd,UAAM,eAAe,qBAAqB,GAAG;AAE7C,QAAI,cAAc;AAChB,cAAQ,aAAa,kBAAkB,YAAY;AAAA,IACrD;AAAA,EACF,SAAS,OAAO;AAGd,QAAI,iBAAiB,OAAO;AAC1B,YAAM,IAAI;AAAA,QACR,kCAAkC,MAAM,OAAO;AAAA;AAAA,QAE/C,EAAE,GAAG,UAAU,OAAO,iBAAiB;AAAA,MACzC;AAAA,IACF;AACA,UAAM;AAAA,EACR;AAEA,SAAO;AACT;AAQO,SAAS,qBAAqB,MAIb;AACtB,QAAM,WAA2B,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAExE,MAAI,CAAC,KAAK,SAAS;AACjB,UAAM,IAAI;AAAA,MACR,kBAAkB,KAAK,IAAI,MAAM,KAAK,EAAE;AAAA;AAAA,MAExC,EAAE,GAAG,UAAU,OAAO,UAAU;AAAA,IAClC;AAAA,EACF;AAEA,QAAM,SAAS,sBAAsB,KAAK,SAAS,QAAQ;AAE3D,QAAM,gBAAgB,kBAAkB,QAAQ,QAAQ;AAExD,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,EACF;AACF;AAYA,SAAS,qBAAqB,KAAe;AAC3C,MAAI,CAAC,IAAI,MAAM;AACb,WAAO;AAAA,EACT;AAEA,aAAW,QAAQ,IAAI,MAAM;AAE3B,QAAI,KAAK,SAAS,4BAA4B,KAAK,aAAa;AAC9D,UAAI,KAAK,YAAY,SAAS,uBAAuB;AACnD,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,4BAA4B,KAAK,aAAa;AAC9D,UAAI,KAAK,YAAY,SAAS,uBAAuB;AACnD,cAAM,aAAa,KAAK,YAAY,aAAa,CAAC;AAClD,YAAI,cAAc,WAAW,MAAM;AAEjC,cAAI,WAAW,KAAK,SAAS,2BAA2B;AACtD,mBAAO,WAAW;AAAA,UACpB;AAEA,cAAI,WAAW,KAAK,SAAS,sBAAsB;AACjD,mBAAO,WAAW;AAAA,UACpB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,4BAA4B;AAC5C,UAAI,KAAK,YAAY,SAAS,uBAAuB;AACnD,eAAO,KAAK;AAAA,MACd;AACA,UAAI,KAAK,YAAY,SAAS,2BAA2B;AACvD,eAAO,KAAK;AAAA,MACd;AACA,UAAI,KAAK,YAAY,SAAS,sBAAsB;AAClD,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAAS,kBAAkB,cAA6B;AACtD,MAAI,CAAC,aAAa,UAAU,CAAC,MAAM,QAAQ,aAAa,MAAM,GAAG;AAC/D,WAAO,CAAC;AAAA,EACV;AAEA,SAAO,aAAa,OACjB,IAAI,CAAC,UAAe;AAEnB,QAAI,MAAM,SAAS,cAAc;AAC/B,aAAO,MAAM;AAAA,IACf;AAGA,QAAI,MAAM,SAAS,iBAAiB;AAClC,aAAO,MAAM,WACV,IAAI,CAAC,SAAc,KAAK,KAAK,QAAQ,KAAK,OAAO,IAAI,EACrD,OAAO,OAAO;AAAA,IACnB;AAEA,QAAI,MAAM,SAAS,gBAAgB;AACjC,aAAO,MAAM,SAAS,IAAI,CAAC,SAAc,MAAM,IAAI,EAAE,OAAO,OAAO;AAAA,IACrE;AAEA,WAAO;AAAA,EACT,CAAC,EACA,KAAK,EACL,OAAO,OAAO;AACnB;AAcO,SAAS,oBACd,MAMA,SACQ;AACR,QAAM,cAAc,WAAW,KAAK,EAAE;AAEtC,MAAI,CAAC,KAAK,eAAe;AACvB,UAAM,IAAI;AAAA,MACR,kBAAkB,KAAK,IAAI,MAAM,KAAK,EAAE;AAAA;AAAA,MAExC,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,MAAM,OAAO,gBAAgB;AAAA,IACjE;AAAA,EACF;AAEA,QAAM,EAAE,QAAQ,WAAW,IAAI,KAAK;AAKpC,MAAI,CAAC,QAAQ,iBAAiB;AAC5B,YAAQ,kBAAkB,oBAAI,IAAI;AAAA,EACpC;AACA,UAAQ,gBAAgB,IAAI,aAAa,MAAM;AAI/C,QAAM,aACJ,WAAW,SAAS,IAChB,WACG,IAAI,CAAC,UAAU;AACd,WAAO,SAAS,KAAK,eAAe,KAAK;AAAA,EAC3C,CAAC,EACA,KAAK,IAAI,IACZ;AAEN,QAAM,aACJ,WAAW,SAAS,IAChB;AAAA;AAAA;AAAA,EAGN,WAAW,IAAI,CAAC,UAAU,iBAAiB,KAAK,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,IAE1D;AAAA;AAAA;AAAA;AAUN,SAAO;AAAA,+BACsB,WAAW;AAAA,sBACpB,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA,EAI7B,UAAU;AAAA,EACV,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8CAMkC,KAAK,IAAI;AAAA,EACrD,WAAW,SAAS,IAAI,WAAW,IAAI,CAAC,UAAU,sBAAsB,KAAK,MAAM,KAAK,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAO/G;;;ACxTO,IAAK,WAAL,kBAAKC,cAAL;AACL,EAAAA,UAAA,WAAQ;AACR,EAAAA,UAAA,YAAS;AACT,EAAAA,UAAA,oBAAiB;AACjB,EAAAA,UAAA,YAAS;AACT,EAAAA,UAAA,gBAAa;AACb,EAAAA,UAAA,cAAW;AACX,EAAAA,UAAA,cAAW;AAPD,SAAAA;AAAA,GAAA;AA4CL,SAAS,sBAAsB,MAAW,OAAqB;AACpE,QAAM,gBAA0B,CAAC;AAEjC,MAAI,OAAO,KAAK,OAAO,YAAY,KAAK,GAAG,KAAK,MAAM,IAAI;AACxD,kBAAc,KAAK,IAAI;AAAA,EACzB;AAEA,MAAI,OAAO,KAAK,SAAS,UAAU;AACjC,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,MAAI,OAAO,KAAK,SAAS,YAAY,KAAK,KAAK,KAAK,MAAM,IAAI;AAC5D,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,MAAI,cAAc,SAAS,GAAG;AAC5B,UAAM,iBAAiB,KAAK,MAAM,KAAK,QAAQ,YAAY,KAAK;AAChE,UAAM,IAAI;AAAA,MACR,SAAS,cAAc,mCAAmC,cAAc,KAAK,IAAI,CAAC;AAAA;AAAA,MAElF,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAAA,IACzC;AAAA,EACF;AACF;AAOO,SAAS,SAAS,KAA8C;AACrE,QAAM,SAAsB,OAAO,QAAQ,WAAW,KAAK,MAAM,GAAG,IAAI;AAGxE,MAAI,CAAC,OAAO,SAAS,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG;AACjD,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA,EAAE,OAAO,QAAQ;AAAA,IACnB;AAAA,EACF;AAGA,SAAO,MAAM,QAAQ,CAAC,MAAW,UAAkB;AACjD,0BAAsB,MAAM,KAAK;AAAA,EACnC,CAAC;AAID,SAAO,MAAM,QAAQ,CAAC,SAAc;AAClC,QAAI,KAAK,SAAS,+BAAmB;AACnC,UAAI;AACF,aAAK,gBAAgB,qBAAqB,IAAI;AAAA,MAChD,SAAS,OAAO;AACd,YAAI,iBAAiB,kBAAkB;AACrC,gBAAM;AAAA,QACR;AACA,cAAM,IAAI;AAAA,UACR,kCAAkC,KAAK,IAAI,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA;AAAA,UAEvG,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO;AACT;;;AClHA,SAAS,qBAAqB;AAC9B,SAAS,uBAAuB;AAMzB,SAAS,WAAW,KAA4B;AACrD,QAAM,QAAQ,IAAI,cAAgC;AAGlD,QAAM,UAAU,oBAAI,IAAqB;AACzC,aAAW,QAAQ,IAAI,OAAO;AAC5B,UAAM,QAAQ,KAAK,IAAI,IAAI;AAC3B,YAAQ,IAAI,KAAK,IAAI,IAAI;AAAA,EAC3B;AAKA,QAAM,aAAa,oBAAI,IAAY;AAGnC,aAAW,QAAQ,IAAI,OAAO;AAC5B,QAAI,CAAC,QAAQ,IAAI,KAAK,QAAQ,KAAK,CAAC,QAAQ,IAAI,KAAK,QAAQ,GAAG;AAC9D,YAAM,aAAa,QAAQ,IAAI,KAAK,QAAQ;AAC5C,YAAM,aAAa,QAAQ,IAAI,KAAK,QAAQ;AAC5C,YAAM,IAAI;AAAA,QACR,iBAAiB,KAAK,EAAE;AAAA;AAAA,QAExB;AAAA,UACE,QAAQ,KAAK;AAAA,UACb,UAAU,YAAY,QAAQ,YAAY;AAAA,UAC1C,OAAO,CAAC,QAAQ,IAAI,KAAK,QAAQ,IAAI,aAAa;AAAA,QACpD;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,aAAa,KAAK,UAAU;AACnC,YAAM,OAAO,MAAM,kBAAkB,KAAK,QAAQ;AAClD,YAAM,WAA2B,EAAE,QAAQ,KAAK,UAAU,UAAU,KAAK,KAAK;AAC9E,YAAM,IAAI;AAAA,QACR,kCAAkC,KAAK,QAAQ,KAAK,QAAQ,qCAAqC,KAAK,EAAE;AAAA;AAAA,QAExG;AAAA,MACF;AAAA,IACF;AAMA,UAAM,cAAc,GAAG,KAAK,QAAQ,KAAK,KAAK,QAAQ;AACtD,QAAI,CAAC,WAAW,IAAI,WAAW,GAAG;AAChC,YAAM,eAAe,KAAK,IAAI,KAAK,UAAU,KAAK,UAAU,IAAI;AAChE,iBAAW,IAAI,WAAW;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;AAUA,SAAS,cAAc,OAAkC;AACvD,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAAiB,oBAAI,IAAY;AACvC,QAAM,YAAY,oBAAI,IAA2B;AAEjD,WAAS,IAAI,QAAgBC,OAAiC;AAC5D,YAAQ,IAAI,MAAM;AAClB,mBAAe,IAAI,MAAM;AACzB,IAAAA,MAAK,KAAK,MAAM;AAEhB,UAAM,YAAY,MAAM,aAAa,MAAM;AAC3C,eAAW,cAAc,WAAW;AAClC,UAAI,CAAC,QAAQ,IAAI,UAAU,GAAG;AAC5B,kBAAU,IAAI,YAAY,MAAM;AAChC,cAAM,QAAQ,IAAI,YAAYA,KAAI;AAClC,YAAI,OAAO;AACT,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,eAAe,IAAI,UAAU,GAAG;AAIzC,cAAM,aAAaA,MAAK,QAAQ,UAAU;AAC1C,cAAM,QAAQ,CAAC,GAAGA,MAAK,MAAM,UAAU,GAAG,UAAU;AACpD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,mBAAe,OAAO,MAAM;AAC5B,IAAAA,MAAK,IAAI;AACT,WAAO;AAAA,EACT;AAGA,aAAW,UAAU,MAAM,MAAM,GAAG;AAClC,QAAI,CAAC,QAAQ,IAAI,MAAM,GAAG;AACxB,YAAM,QAAQ,IAAI,QAAQ,CAAC,CAAC;AAC5B,UAAI,OAAO;AACT,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,gBAAgB,OAAiB,OAAyB;AACjE,SAAO,MACJ,IAAI,CAAC,WAAW;AACf,UAAM,OAAO,MAAM,kBAAkB,MAAM;AAC3C,WAAO,KAAK,QAAQ;AAAA,EACtB,CAAC,EACA,KAAK,MAAM;AAChB;AAEO,SAAS,cAAc,OAAuB;AAEnD,QAAM,YAAY,cAAc,KAAK;AACrC,MAAI,WAAW;AACb,UAAM,gBAAgB,gBAAgB,WAAW,KAAK;AACtD,UAAM,IAAI;AAAA,MACR,iCAAiC,aAAa;AAAA;AAAA,MAE9C,EAAE,QAAQ,UAAU,CAAC,GAAG,UAAU,MAAM,kBAAkB,UAAU,CAAC,CAAC,EAAE,KAAK;AAAA,IAC/E;AAAA,EACF;AAGA,QAAM,aAAuB,CAAC;AAC9B,QAAM,cAAwB,CAAC;AAE/B,QAAM,YAAY,CAAC,QAAQ,UAAU;AACnC,QAAI,MAAM,kCAAyB;AACjC,iBAAW,KAAK,MAAM;AAAA,IACxB;AACA,QAAI,MAAM,oCAA0B;AAClC,kBAAY,KAAK,MAAM;AAAA,IACzB;AAAA,EACF,CAAC;AAED,MAAI,WAAW,WAAW,GAAG;AAE3B,UAAM,iBAAiB,WAAW,SAAS,IAAI,MAAM,kBAAkB,WAAW,CAAC,CAAC,IAAI;AACxF,UAAM,IAAI;AAAA,MACR,wCAAwC,WAAW,MAAM;AAAA;AAAA,MAEzD,iBAAiB,EAAE,QAAQ,eAAe,IAAI,UAAU,eAAe,KAAK,IAAI;AAAA,IAClF;AAAA,EACF;AACA,MAAI,YAAY,WAAW,GAAG;AAC5B,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA,EAAE,OAAO,aAAa;AAAA,IACxB;AAAA,EACF;AACF;AAMO,SAAS,mBAAmB,OAA2B;AAC5D,SAAO,gBAAgB,KAAK;AAC9B;AAKO,SAAS,cAAc,OAAiB,QAA2B;AACxE,SAAO,MAAM,YAAY,MAAM,EAAE,IAAI,CAAC,OAAO,MAAM,kBAAkB,EAAE,CAAC;AAC1E;AAKO,SAAS,eAAe,OAAiB,QAA2B;AACzE,SAAO,MAAM,aAAa,MAAM,EAAE,IAAI,CAAC,OAAO,MAAM,kBAAkB,EAAE,CAAC;AAC3E;;;ACtLO,SAAS,iBAAiB,MAAe,UAAkD;AAChG,QAAM,cAAc,WAAW,KAAK,EAAE;AACtC,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAO1C;AAYO,SAAS,kBAAkB,MAAe,UAAkD;AACjG,QAAM,cAAc,WAAW,KAAK,EAAE;AACtC,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoB1C;;;ACJO,IAAM,0BAAN,MAAyD;AAAA,EAC9D,kBAAkB,MAAsB;AACtC,WAAO,YAAY,IAAI;AAAA,EACzB;AAAA,EAEA,mBAA2B;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,iBAAyB;AACvB,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkBC,OAAsB;AAGtC,UAAM,WAAWA,MAAK,MAAM,GAAG;AAC/B,QAAI,SAAS;AACb,eAAW,WAAW,UAAU;AAC9B,eAAS,eAAe,MAAM,MAAM,OAAO;AAAA,IAC7C;AACA,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiBA,OAAsB;AACrC,WAAO,YAAYA,KAAI;AAAA,EACzB;AAAA,EAEA,gBAAwB;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,sBAAuC;AAErC,WAAO;AAAA,EACT;AAAA,EAEA,kBAA0B;AACxB,WAAO;AAAA,EACT;AAAA,EAEA,gBAAwB;AACtB,WAAO;AAAA,EACT;AACF;AAMO,IAAM,6BAAN,MAAM,4BAAsD;AAAA,EACjE,YAAoB,YAAoB,UAAU;AAA9B;AAAA,EAA+B;AAAA,EAEnD,kBAAkB,MAAsB;AACtC,WAAO,YAAY,IAAI;AAAA,EACzB;AAAA,EAEA,mBAA2B;AACzB,WAAO,gBAAgB,KAAK,SAAS;AAAA,EACvC;AAAA,EAEA,iBAAyB;AACvB,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkBA,OAAsB;AAGtC,WAAO,IAAI,KAAK,SAAS,SAASA,KAAI,QAAQ,KAAK,SAAS,SAASA,KAAI;AAAA,EAC3E;AAAA,EAEA,iBAAiBA,OAAsB;AACrC,WAAO,YAAYA,KAAI;AAAA,EACzB;AAAA,EAEA,gBAAwB;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,sBAAuC;AAGrC,WAAO,IAAI,4BAA2B,cAAc;AAAA,EACtD;AAAA,EAEA,kBAA0B;AACxB,WAAO;AAAA,EACT;AAAA,EAEA,gBAAwB;AACtB,WAAO,KAAK,KAAK,SAAS;AAAA,EAC5B;AACF;AAMO,IAAM,wBAAN,MAAuD;AAAA,EAC5D,YACU,SAAiB,aACjB,YAAoB,cAC5B;AAFQ;AACA;AAAA,EACP;AAAA,EAEH,kBAAkB,MAAsB;AACtC,WAAO,GAAG,KAAK,MAAM,SAAS,IAAI;AAAA,EACpC;AAAA,EAEA,mBAA2B;AACzB,WAAO,gBAAgB,KAAK,SAAS;AAAA,EACvC;AAAA,EAEA,iBAAyB;AACvB,WAAO,GAAG,KAAK,MAAM;AAAA,EACvB;AAAA,EAEA,kBAAkBA,OAAsB;AAEtC,WAAO,IAAI,KAAK,SAAS,SAASA,KAAI,QAAQ,KAAK,SAAS,SAASA,KAAI;AAAA,EAC3E;AAAA,EAEA,iBAAiBA,OAAsB;AACrC,WAAO,GAAG,KAAK,MAAM,SAASA,KAAI;AAAA,EACpC;AAAA,EAEA,gBAAwB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,sBAAuC;AAErC,WAAO;AAAA,EACT;AAAA,EAEA,kBAA0B;AACxB,WAAO,KAAK,KAAK,MAAM,cAAc,KAAK,SAAS;AAAA,EACrD;AAAA,EAEA,gBAAwB;AACtB,WAAO,KAAK,KAAK,MAAM,KAAK,KAAK,SAAS;AAAA,EAC5C;AACF;;;ACxJO,SAAS,yBACd,KACA,SACA,UACQ;AACR,UAAQ,IAAI,MAAM;AAAA,IAChB,KAAK;AACH,aAAO,eAAgB,IAAsB,KAAK;AAAA,IAEpD,KAAK;AACH,aAAO,iBAAiB,aAAc,IAAsB,KAAK,CAAC;AAAA,IAEpE,KAAK;AACH,aAAO,cAAe,IAAuB,KAAK;AAAA,IAEpD,KAAK;AACH,aAAO;AAAA,IAET,KAAK;AACH,aAAO,SAAS,kBAAmB,IAAmB,IAAI;AAAA,IAE5D,KAAK;AACH,aAAO,SAAS,iBAAiB;AAAA,IAEnC,KAAK;AACH,aAAO,SAAS,eAAe;AAAA,IAEjC,KAAK,YAAY;AACf,YAAM,MAAM;AACZ,YAAM,OAAO,yBAAyB,IAAI,MAAM,SAAS,QAAQ;AACjE,YAAM,QAAQ,yBAAyB,IAAI,OAAO,SAAS,QAAQ;AACnE,aAAO,0BAA0B,IAAI,IAAI,MAAM,KAAK;AAAA,IACtD;AAAA,IAEA,KAAK,WAAW;AACd,YAAM,MAAM;AACZ,YAAM,UAAU,yBAAyB,IAAI,SAAS,SAAS,QAAQ;AACvE,cAAQ,IAAI,IAAI;AAAA,QACd,KAAK;AACH,iBAAO,gBAAgB,OAAO;AAAA,QAChC,KAAK;AACH,iBAAO,eAAe,OAAO;AAAA,QAC/B;AACE,gBAAM,IAAI,MAAM,2BAA2B,IAAI,EAAE,EAAE;AAAA,MACvD;AAAA,IACF;AAAA,IAEA,KAAK,aAAa;AAChB,YAAM,MAAM;AACZ,YAAM,OAAO,yBAAyB,IAAI,WAAW,SAAS,QAAQ;AACtE,YAAM,OAAO,yBAAyB,IAAI,YAAY,SAAS,QAAQ;AACvE,YAAM,MAAM,yBAAyB,IAAI,WAAW,SAAS,QAAQ;AACrE,aAAO,IAAI,IAAI,eAAe,IAAI,MAAM,GAAG;AAAA,IAC7C;AAAA,IAEA,KAAK,gBAAgB;AACnB,YAAM,KAAK;AAEX,YAAM,aAAa,gBAAgB,EAAE;AACrC,UAAI,YAAY;AACd,eAAO,SAAS,kBAAkB,UAAU;AAAA,MAC9C;AAEA,UAAI,sBAAsB,EAAE,GAAG;AAC7B,cAAM,YAAY,eAAe,EAAE;AACnC,eAAO,SAAS,iBAAiB,SAAS;AAAA,MAC5C;AAEA,YAAM,MAAM,yBAAyB,GAAG,QAAQ,SAAS,QAAQ;AACjE,aAAO,eAAe,GAAG,MAAM,GAAG,QAAQ;AAAA,IAC5C;AAAA,IAEA,KAAK,eAAe;AAClB,YAAM,KAAK;AACX,YAAM,MAAM,yBAAyB,GAAG,QAAQ,SAAS,QAAQ;AACjE,YAAM,MAAM,yBAAyB,GAAG,OAAO,SAAS,QAAQ;AAChE,aAAO,YAAY,GAAG,KAAK,GAAG;AAAA,IAChC;AAAA,IAEA,KAAK,gBAAgB;AACnB,YAAM,KAAK;AACX,UAAI,GAAG,OAAO,SAAS,cAAc;AACnC,cAAM,OAAQ,GAAG,OAAsB;AAGvC,YAAI,SAAS,UAAU;AACrB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,QAAQ;AAAA,QAC/D;AACA,YAAI,SAAS,OAAO;AAClB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,KAAK;AAAA,QAC5D;AACA,YAAI,SAAS,UAAU;AACrB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,QAAQ;AAAA,QAC/D;AACA,YAAI,SAAS,OAAO;AAClB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,KAAK;AAAA,QAC5D;AACA,YAAI,SAAS,QAAQ;AACnB,iBAAO,uBAAuB,IAAI,SAAS,UAAU,MAAM;AAAA,QAC7D;AAGA,cAAM,OAAO,GAAG,KAAK,IAAI,CAAC,QAAQ,yBAAyB,KAAK,SAAS,QAAQ,CAAC;AAClF,cAAM,UAAU,KAAK;AAGrB,YAAI,YAAY,GAAG;AACjB,iBAAO,qBAAqB,IAAI,gBAAgB,KAAK,CAAC,CAAC;AAAA,QACzD,WAAW,YAAY,GAAG;AACxB,iBAAO,qBAAqB,IAAI,gBAAgB,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,QACrE,WAAW,YAAY,GAAG;AACxB,iBAAO,qBAAqB,IAAI,gBAAgB,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,QACjF,OAAO;AACL,iBAAO,qBAAqB,IAAI,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,QACxD;AAAA,MACF;AACA,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AAAA,IAEA,KAAK,YAAY;AACf,YAAM,OAAO;AACb,YAAM,QAAQ,yBAAyB,KAAK,OAAO,SAAS,QAAQ;AACpE,YAAM,MAAM,yBAAyB,KAAK,KAAK,SAAS,QAAQ;AAChE,aAAO,kBAAkB,KAAK,KAAK,GAAG,KAAK,KAAK,cAAc,KAAK,KAAK,YAAY;AAAA,IACtF;AAAA,IAEA,KAAK,gBAAgB;AACnB,YAAM,KAAK;AACX,UAAI,GAAG,SAAS,WAAW,GAAG;AAC5B,eAAO;AAAA,MACT;AACA,YAAM,WAAW,GAAG,SAAS,IAAI,CAAC,MAAM,yBAAyB,GAAG,SAAS,QAAQ,CAAC;AACtF,aAAO,gBAAgB,SAAS,KAAK,IAAI,CAAC;AAAA,IAC5C;AAAA,IAEA,KAAK,iBAAiB;AACpB,YAAM,KAAK;AACX,UAAI,GAAG,WAAW,WAAW,GAAG;AAC9B,eAAO;AAAA,MACT;AAEA,YAAM,gBAAgB,SAAS,oBAAoB;AACnD,YAAM,WAAW,QAAQ,YAAY,QAAQ;AAC7C,YAAM,QAAQ,GAAG,WAAW,IAAI,CAAC,MAAM;AACrC,cAAM,QAAQ,yBAAyB,EAAE,OAAO,SAAS,aAAa;AACtE,eAAO,oBAAoB,EAAE,GAAG,MAAM,KAAK;AAAA,MAC7C,CAAC;AAED,YAAM,aAAa;AAAA,wBACD,QAAQ,gBAAgB,SAAS,gBAAgB,CAAC;AAAA;AAAA,EAExE,MAAM,KAAK,IAAI,CAAC;AAAA;AAAA;AAGZ,cAAQ,gBAAgB,IAAI,gBAAgB,QAAQ,IAAI,UAAU;AAClE,aAAO,gBAAgB,QAAQ,OAAO,SAAS,cAAc,CAAC;AAAA,IAChE;AAAA,IAEA,KAAK,mBAAmB;AACtB,YAAM,KAAK;AACX,YAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS;AACnC,YAAI,UAAU,MAAM;AAClB,iBAAO,IAAI,aAAa,KAAK,IAAI,CAAC;AAAA,QACpC,OAAO;AACL,iBAAO,IAAI,yBAAyB,KAAK,MAAM,SAAS,QAAQ,CAAC;AAAA,QACnE;AAAA,MACF,CAAC;AACD,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO;AAAA,MACT;AACA,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO,gBAAgB,MAAM,CAAC,CAAC;AAAA,MACjC;AACA,aAAO,gBAAgB,MAAM,KAAK,KAAK,CAAC;AAAA,IAC1C;AAAA,IAEA;AACE,YAAM,IAAI,MAAM,gCAAiC,IAAY,IAAI,EAAE;AAAA,EACvE;AACF;AAYA,SAAS,uBACP,KACA,SACA,UACA,QACQ;AACR,QAAM,eAAe,WAAW,WAAW,IAAI;AAC/C,MAAI,IAAI,KAAK,WAAW,cAAc;AACpC,UAAM,IAAI;AAAA,MACR,GAAG,MAAM,uBAAuB,YAAY,mBAAmB,IAAI,KAAK,MAAM;AAAA,IAChF;AAAA,EACF;AAEA,QAAM,YAAY,IAAI,KAAK,CAAC;AAC5B,QAAM,aAAa,IAAI,KAAK,CAAC;AAG7B,QAAM,YAAY,yBAAyB,WAAW,SAAS,QAAQ;AAGvE,QAAM,gBAAgB,SAAS,oBAAoB;AACnD,QAAM,aAAa,yBAAyB,YAAY,SAAS,aAAa;AAE9E,QAAM,WAAW,QAAQ,YAAY,MAAM;AAC3C,QAAM,cAAc,SAAS,gBAAgB;AAC7C,QAAM,YAAY,SAAS,cAAc;AAEzC,MAAI;AAEJ,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,mBAAa;AAAA,wBACK,QAAQ,4BAA4B,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAW7D,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOd;AAAA,IAEF,KAAK;AACH,mBAAa;AAAA,qBACE,QAAQ,4BAA4B,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,qBAW/C,UAAU;AAAA;AAAA;AAAA;AAAA;AAKzB;AAAA,IAEF,KAAK,UAAU;AACb,YAAM,cAAc,IAAI,KAAK,CAAC;AAC9B,YAAM,cAAc,yBAAyB,aAAa,SAAS,QAAQ;AAC3E,mBAAa;AAAA,wBACK,QAAQ,4CAA4C,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAYrE,UAAU;AAAA;AAAA;AAAA;AAAA;AAKtB,cAAQ,gBAAgB,IAAI,gBAAgB,QAAQ,IAAI,UAAU;AAClE,aAAO,gBAAgB,QAAQ,SAAS,SAAS,KAAK,WAAW,GAAG,SAAS;AAAA,IAC/E;AAAA,IAEA,KAAK;AACH,mBAAa;AAAA,qBACE,QAAQ,4BAA4B,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAUzD,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOf;AAAA,IAEF,KAAK;AACH,mBAAa;AAAA,sBACG,QAAQ,4BAA4B,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAU3D,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOd;AAAA,EACJ;AAEA,UAAQ,gBAAgB,IAAI,GAAG,MAAM,UAAU,QAAQ,IAAI,UAAU;AACrE,SAAO,GAAG,MAAM,UAAU,QAAQ,SAAS,SAAS,GAAG,SAAS;AAClE;AAeO,SAAS,0BAA0B,IAAY,MAAc,OAAuB;AACzF,UAAQ,IAAI;AAAA;AAAA,IAEV,KAAK;AACH,aAAO,aAAa,IAAI,KAAK,KAAK;AAAA,IACpC,KAAK;AACH,aAAO,kBAAkB,IAAI,KAAK,KAAK;AAAA,IACzC,KAAK;AACH,aAAO,kBAAkB,IAAI,KAAK,KAAK;AAAA,IACzC,KAAK;AACH,aAAO,gBAAgB,IAAI,KAAK,KAAK;AAAA,IACvC,KAAK;AACH,aAAO,gBAAgB,IAAI,KAAK,KAAK;AAAA,IACvC,KAAK;AACH,aAAO,eAAe,IAAI,KAAK,KAAK;AAAA;AAAA,IAGtC,KAAK;AACH,aAAO,0BAA0B,IAAI,KAAK,KAAK;AAAA,IACjD,KAAK;AACH,aAAO,2BAA2B,IAAI,KAAK,KAAK;AAAA,IAClD,KAAK;AACH,aAAO,4BAA4B,IAAI,KAAK,KAAK;AAAA,IACnD,KAAK;AACH,aAAO,4BAA4B,IAAI,KAAK,KAAK;AAAA,IACnD,KAAK;AACH,aAAO,4BAA4B,IAAI,KAAK,KAAK;AAAA,IACnD,KAAK;AACH,aAAO,4BAA4B,IAAI,KAAK,KAAK;AAAA;AAAA,IAGnD,KAAK;AACH,aAAO,KAAK,IAAI,iBAAiB,KAAK,QAAQ,IAAI;AAAA,IACpD,KAAK;AACH,aAAO,KAAK,IAAI,iBAAiB,IAAI,QAAQ,KAAK;AAAA;AAAA,IAGpD,KAAK;AACH,aAAO,IAAI,IAAI,eAAe,KAAK,MAAM,IAAI;AAAA;AAAA,IAG/C,KAAK;AACH,aAAO,WAAW,IAAI,KAAK,KAAK;AAAA,IAClC,KAAK;AACH,aAAO,uBAAuB,IAAI,KAAK,KAAK;AAAA,IAE9C;AACE,YAAM,IAAI,MAAM,4BAA4B,EAAE,EAAE;AAAA,EACpD;AACF;AASO,SAAS,aAAa,GAAmB;AAC9C,SAAO,EACJ,QAAQ,OAAO,MAAM,EACrB,QAAQ,MAAM,KAAK,EACnB,QAAQ,OAAO,KAAK,EACpB,QAAQ,OAAO,KAAK,EACpB,QAAQ,OAAO,KAAK;AACzB;AAQO,SAAS,gBAAgB,KAAkC;AAChE,MAAI,IAAI,OAAO,SAAS,aAAa;AACnC,WAAO,IAAI;AAAA,EACb;AACA,MAAI,IAAI,OAAO,SAAS,gBAAgB;AACtC,UAAM,aAAa,gBAAgB,IAAI,MAAsB;AAC7D,QAAI,eAAe,MAAM;AACvB,aAAO,GAAG,UAAU,IAAI,IAAI,QAAQ;AAAA,IACtC;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,sBAAsB,KAA4B;AAChE,MAAI,IAAI,OAAO,SAAS,cAAc;AACpC,WAAQ,IAAI,OAAsB,SAAS;AAAA,EAC7C,WAAW,IAAI,OAAO,SAAS,gBAAgB;AAC7C,WAAO,sBAAsB,IAAI,MAAsB;AAAA,EACzD;AACA,SAAO;AACT;AAKO,SAAS,eAAe,KAA2B;AACxD,MAAI,IAAI,OAAO,SAAS,cAAc;AACpC,WAAO,GAAI,IAAI,OAAsB,IAAI,IAAI,IAAI,QAAQ;AAAA,EAC3D,WAAW,IAAI,OAAO,SAAS,gBAAgB;AAC7C,WAAO,GAAG,eAAe,IAAI,MAAsB,CAAC,IAAI,IAAI,QAAQ;AAAA,EACtE;AACA,QAAM,IAAI,MAAM,0CAA0C;AAC5D;AAOA,IAAM,mBAAmB,IAAI,wBAAwB;AAgB9C,SAAS,kBAAkB,KAAoB,SAAqC;AACzF,SAAO,yBAAyB,KAAK,SAAS,gBAAgB;AAChE;;;ACxdO,SAAS,sBACd,MACA,SACoB;AACpB,QAAM,cAAc,KAAK,QAAQ;AACjC,QAAM,cAAc,KAAK,QAAQ,gBAAgB;AACjD,QAAM,aAAa,KAAK,QAAQ;AAChC,QAAM,aAAa,KAAK,QAAQ;AAChC,QAAM,gBAAgB,KAAK,QAAQ;AACnC,QAAM,cAAc,WAAW,KAAK,EAAE;AAItC,MAAI,kBAAkB,QAAQ;AAC5B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAGA,MAAI,YAAY;AACd,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAIA,QAAM,WAAW,IAAI,2BAA2B,QAAQ;AACxD,QAAM,wBAAwB,YAC3B,IAAI,CAAC,SAAS;AACb,QAAI;AACF,YAAM,MAAM,QAAQ,gBAAgB,KAAK,KAAK;AAE9C,YAAM,WAAW,yBAAyB,KAAK,SAAS,QAAQ;AAChE,aAAO,iBAAiB,KAAK,GAAG,MAAM,QAAQ;AAAA,IAChD,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,iCAAiC,KAAK,KAAK,cAAc,KAAK,GAAG,MAAM,CAAC,EAAE;AAAA,IAC5F;AAAA,EACF,CAAC,EACA,KAAK,IAAI;AAEZ,MAAI,aAAa;AACf,WAAO;AAAA,+BACoB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYxC,qBAAqB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKrB;AAEA,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA,EAGxC,qBAAqB;AAAA;AAAA;AAAA;AAAA;AAKvB;AAiBA,SAAS,4BACP,MACA,SACA,aACA,aACA,YACA,YACA,aACoB;AAEpB,QAAM,WAAW,QAAQ,YAAY,YAAY;AAIjD,QAAM,WAAW,IAAI,sBAAsB,aAAa,YAAY;AACpE,QAAM,wBAAwB,YAC3B,IAAI,CAAC,SAAS;AACb,QAAI;AACF,YAAM,MAAM,QAAQ,gBAAgB,KAAK,KAAK;AAE9C,YAAM,WAAW,yBAAyB,KAAK,SAAS,QAAQ;AAChE,aAAO,uBAAuB,KAAK,GAAG,MAAM,QAAQ;AAAA,IACtD,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,iCAAiC,KAAK,KAAK,cAAc,KAAK,GAAG,MAAM,CAAC,EAAE;AAAA,IAC5F;AAAA,EACF,CAAC,EACA,KAAK,IAAI;AAKZ,QAAM,aAAa;AAAA,4BACO,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqClC,qBAAqB;AAAA;AAAA;AAAA;AAKrB,UAAQ,gBAAgB,IAAI,oBAAoB,QAAQ,IAAI,UAAU;AAGtE,MAAI,aAAa;AACf,WAAO;AAAA,+BACoB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8CAWI,UAAU;AAAA,8BAC1B,UAAU;AAAA;AAAA,uEAE+B,cAAc,UAAU;AAAA,0CACrD,QAAQ;AAAA,gBAClC,cAAc,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,EAKtC;AAEA,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA,8CAGI,UAAU;AAAA,8BAC1B,UAAU;AAAA;AAAA,uEAE+B,cAAc,UAAU;AAAA,0CACrD,QAAQ;AAAA,gBAClC,cAAc,UAAU;AAAA;AAAA;AAAA;AAAA;AAKxC;AAiBA,SAAS,0BACP,MACA,SACA,aACA,aACA,YACA,YACA,aACoB;AACpB,MAAI,CAAC,YAAY;AACf,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AAGA,QAAM,WAAW,QAAQ,YAAY,UAAU;AAI/C,QAAM,WAAW,IAAI,sBAAsB,WAAW,YAAY;AAClE,QAAM,wBAAwB,YAC3B,IAAI,CAAC,SAAS;AACb,QAAI;AACF,YAAM,MAAM,QAAQ,gBAAgB,KAAK,KAAK;AAE9C,YAAM,WAAW,yBAAyB,KAAK,SAAS,QAAQ;AAChE,aAAO,yBAAyB,KAAK,GAAG,MAAM,QAAQ;AAAA,IACxD,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,iCAAiC,KAAK,KAAK,cAAc,KAAK,GAAG,MAAM,CAAC,EAAE;AAAA,IAC5F;AAAA,EACF,CAAC,EACA,KAAK,IAAI;AAGZ,QAAM,aAAa;AAAA,0BACK,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8ChC,qBAAqB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQrB,UAAQ,gBAAgB,IAAI,kBAAkB,QAAQ,IAAI,UAAU;AAGpE,QAAM,sBAAsB,cAAc;AAG1C,MAAI,aAAa;AACf,WAAO;AAAA,+BACoB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,6CAWG,UAAU;AAAA,8BACzB,UAAU;AAAA;AAAA;AAAA,sCAGF,QAAQ;AAAA;AAAA,mCAEX,mBAAmB;AAAA,gBACtC,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKjC;AAEA,SAAO;AAAA,+BACsB,WAAW;AAAA;AAAA;AAAA,6CAGG,UAAU;AAAA,8BACzB,UAAU;AAAA;AAAA;AAAA,sCAGF,QAAQ;AAAA;AAAA,mCAEX,mBAAmB;AAAA,gBACtC,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAKnC;;;ACxXO,SAAS,yBAAyB,KAAU,eAA4B;AAC7E,MAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;AACnC,WAAO;AAAA,EACT;AAGA,MAAI,IAAI,SAAS,aAAa;AAC5B,WAAO,EAAE,MAAM,cAAc,MAAM,cAAc;AAAA,EACnD;AAGA,QAAM,SAAc,EAAE,MAAM,IAAI,KAAK;AAErC,aAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,QAAI,QAAQ,QAAQ;AAClB;AAAA,IACF;AAEA,UAAM,QAAQ,IAAI,GAAG;AACrB,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,aAAO,GAAG,IAAI,MAAM,IAAI,CAAC,SAAS,yBAAyB,MAAM,aAAa,CAAC;AAAA,IACjF,WAAW,SAAS,OAAO,UAAU,UAAU;AAC7C,aAAO,GAAG,IAAI,yBAAyB,OAAO,aAAa;AAAA,IAC7D,OAAO;AACL,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AAEA,SAAO;AACT;AAaO,SAAS,gCAAgC,KAAU,SAAqC;AAE7F,MAAI,IAAI,SAAS,cAAc;AAC7B,WAAQ,IAAmB;AAAA,EAC7B;AAGA,MAAI,IAAI,SAAS,YAAY;AAC3B,UAAM,OAAO,gCAAgC,IAAI,MAAM,OAAO;AAC9D,UAAM,QAAQ,gCAAgC,IAAI,OAAO,OAAO;AAChE,WAAO,0BAA0B,IAAI,IAAI,MAAM,KAAK;AAAA,EACtD;AAGA,MAAI,IAAI,SAAS,WAAW;AAC1B,UAAM,UAAU,gCAAgC,IAAI,SAAS,OAAO;AACpE,YAAQ,IAAI,IAAI;AAAA,MACd,KAAK;AACH,eAAO,gBAAgB,OAAO;AAAA,MAChC,KAAK;AACH,eAAO,eAAe,OAAO;AAAA,MAC/B;AACE,cAAM,IAAI,MAAM,2BAA2B,IAAI,EAAE,EAAE;AAAA,IACvD;AAAA,EACF;AAGA,MAAI,IAAI,SAAS,gBAAgB;AAC/B,UAAM,SAAS,IAAI;AACnB,QAAI,OAAO,SAAS,cAAc;AAChC,YAAM,OAAO,IAAI,KAAK,IAAI,CAAC,QAAa,gCAAgC,KAAK,OAAO,CAAC;AACrF,YAAM,UAAU,KAAK;AAGrB,UAAI,YAAY,GAAG;AACjB,eAAO,qBAAqB,OAAO,IAAI,gBAAgB,KAAK,CAAC,CAAC;AAAA,MAChE,WAAW,YAAY,GAAG;AACxB,eAAO,qBAAqB,OAAO,IAAI,gBAAgB,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,MAC5E,WAAW,YAAY,GAAG;AACxB,eAAO,qBAAqB,OAAO,IAAI,gBAAgB,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,MACxF,OAAO;AACL,eAAO,qBAAqB,OAAO,IAAI,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC5D;AAGA,MAAI,IAAI,SAAS,gBAAgB;AAC/B,UAAM,MAAM,gCAAgC,IAAI,QAAQ,OAAO;AAC/D,WAAO,eAAe,GAAG,MAAM,IAAI,QAAQ;AAAA,EAC7C;AAGA,MAAI,IAAI,SAAS,eAAe;AAC9B,UAAM,MAAM,gCAAgC,IAAI,QAAQ,OAAO;AAC/D,UAAM,MAAM,gCAAgC,IAAI,OAAO,OAAO;AAC9D,WAAO,YAAY,GAAG,KAAK,GAAG;AAAA,EAChC;AAGA,MAAI,IAAI,SAAS,aAAa;AAC5B,UAAM,OAAO,gCAAgC,IAAI,WAAW,OAAO;AACnE,UAAM,OAAO,gCAAgC,IAAI,YAAY,OAAO;AACpE,UAAM,MAAM,gCAAgC,IAAI,WAAW,OAAO;AAClE,WAAO,IAAI,IAAI,eAAe,IAAI,MAAM,GAAG;AAAA,EAC7C;AAGA,SAAO,kBAAkB,KAAK,OAAO;AACvC;;;ACpHA,SAAS,kBACP,MACA,WACA,OACA,SACQ;AAIR,MAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC,WAAO;AAAA,EACT;AAEA,MAAI;AAMF,QAAI,CAAC,SAAS,UAAU,KAAK;AAE3B,YAAMC,OAAM,QAAQ,gBAAgB,IAAI;AACxC,YAAMC,gBAAe,kBAAkBD,MAAK,OAAO;AACnD,aAAO,GAAGC,aAAY;AAAA,IACxB;AAIA,UAAM,MAAM,QAAQ,qBAAqB,IAAI;AAI7C,UAAM,WAAW,QAAQ,gBAAgB,KAAK;AAC9C,UAAM,gBAAgB,kBAAkB,UAAU,OAAO;AAKzD,UAAM,iBAAiB,yBAAyB,KAAK,aAAa;AAGlE,UAAM,eAAe,gCAAgC,gBAAgB,OAAO;AAG5E,WAAO,GAAG,YAAY;AAAA,EACxB,SAAS,GAAG;AAGV,UAAM,IAAI;AAAA,MACR,+CAA+C,IAAI,gBAAgB,KAAK,MAAM,CAAC;AAAA,IACjF;AAAA,EACF;AACF;AAWA,SAAS,mBACP,OACA,YACA,OACA,SACQ;AAGR,MAAI,CAAC,SAAS,UAAU,OAAO,UAAU,IAAI;AAC3C,WAAO;AAAA,EACT;AAEA,QAAM,kBAAkB,cAAc,IAAI,YAAY;AAItD,QAAM,iBACH,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,KAC3C,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG;AAG9C,QAAM,gBAAgB,iBAAiB,MAAM,MAAM,GAAG,EAAE,IAAI;AAE5D,UAAQ,gBAAgB;AAAA,IACtB,KAAK,cAAc;AAGjB,YAAM,MAAM,QAAQ,gBAAgB,KAAK;AACzC,aAAO,kBAAkB,KAAK,OAAO;AAAA,IACvC;AAAA,IAEA,KAAK;AAAA,IACL,KAAK;AAGH,YAAM,UAAU,cAAc,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AACxE,aAAO,mBAAmB,UAAU;AAAA,IAEtC,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,eAAe,WAAW,KAAK,CAAC;AAAA,IAEzC,KAAK;AAAA,IACL,KAAK;AACH,aAAO,cAAc,MAAM,YAAY,MAAM,MAAM;AAAA,IAErD;AAME,UAAI,gBAAgB;AAElB,cAAM,iBAAiB,cAAc,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AAC/E,eAAO,mBAAmB,iBAAiB;AAAA,MAC7C;AAGA,UAAI,MAAM,YAAY,MAAM,UAAU,MAAM,YAAY,MAAM,SAAS;AACrE,eAAO,cAAc,MAAM,YAAY,MAAM,MAAM;AAAA,MACrD;AAIA,UAAI,uCAAuC,KAAK,KAAK,GAAG;AACtD,eAAO,eAAe,WAAW,KAAK,CAAC;AAAA,MACzC;AAIA,UAAI;AACF,cAAM,MAAM,QAAQ,gBAAgB,KAAK;AACzC,eAAO,kBAAkB,KAAK,OAAO;AAAA,MACvC,SAAS,GAAG;AAGV,cAAM,IAAI;AAAA,UACR,mCAAmC,KAAK,gBAAgB,KAAK,MAAM,CAAC,4DACR,KAAK,WAAW,KAAK;AAAA,QACnF;AAAA,MACF;AAAA,EACJ;AACF;AAaA,SAAS,oBAAoB,MAAc,QAAqD;AAE9F,QAAM,qBAAqB;AAC3B,QAAM,UAAU,KAAK,MAAM,kBAAkB,KAAK,CAAC;AAGnD,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,SAAS,SAAS;AAC3B,WAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAAA,EAChD;AAGA,QAAM,UAAU,oBAAI,IAAoB;AACxC,MAAI,aAAa;AACjB,aAAW,CAACC,UAAS,KAAK,KAAK,QAAQ;AACrC,QAAI,QAAQ,GAAG;AAEb,YAAM,YAAY,SAAS,WAAW,MAAM,CAAC,IAAI,YAAY;AAC7D,cAAQ,IAAIA,UAAS,SAAS;AAAA,IAChC;AAAA,EACF;AAGA,MAAI,QAAQ,SAAS,GAAG;AACtB,WAAO,EAAE,WAAW,IAAI,KAAK;AAAA,EAC/B;AAGA,QAAM,YAAY,MAAM,KAAK,QAAQ,QAAQ,CAAC,EAC3C,IAAI,CAAC,CAACA,UAAS,SAAS,MAAM,SAAS,SAAS,aAAaA,QAAO,GAAG,EACvE,KAAK,IAAI;AAGZ,MAAI,kBAAkB;AACtB,aAAW,CAACA,UAAS,SAAS,KAAK,SAAS;AAE1C,UAAM,iBAAiBA,SAAQ,QAAQ,uBAAuB,MAAM;AACpE,sBAAkB,gBAAgB,QAAQ,IAAI,OAAO,gBAAgB,GAAG,GAAG,SAAS;AAAA,EACtF;AAEA,SAAO,EAAE,WAAW,MAAM,gBAAgB;AAC5C;AAqBO,SAAS,yBACd,MACA,SACoB;AACpB,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB;AAAA,IACjB;AAAA,EACF,IAAI,KAAK;AAGT,QAAM,kBAAkB,wBACtB,QAAQ,QAAQ,mBAAmB,EAAE,MAAM,aAAa;AAG1D,QAAM,eACJ,cAAc,aACd,cAAc,YACd,cAAc,eACd,cAAc,iBACd,cAAc;AAGhB,MAAI;AACJ,MAAI,cAAc;AAChB,wBAAoB;AAAA,EACtB,OAAO;AACL,wBAAoB;AAAA,EACtB;AAGA,QAAM,eAAe,MAClB,IAAI,CAAC,MAAM,QAAQ;AAElB,UAAM,aAAa,OAChB,IAAI,CAAC,UAAU;AACd,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC,eAAO;AAAA,MACT;AACA,aAAO,kBAAkB,MAAM,MAAM,MAAM,MAAM,OAAO,OAAO;AAAA,IACjE,CAAC,EACA,KAAK,MAAM;AAGd,UAAM,oBAAoB,QACvB,IAAI,CAAC,WAAW;AACf,YAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,UAAI,CAAC,SAAS,UAAU,MAAM,UAAU,KAAK;AAC3C,eAAO;AAAA,MACT;AACA,YAAM,WAAW,mBAAmB,OAAO,OAAO,MAAM,OAAO,OAAO,OAAO;AAC7E,aAAO,mBAAmB,OAAO,KAAK,MAAM,QAAQ;AAAA,IACtD,CAAC,EACA,OAAO,OAAO,EACd,KAAK,IAAI;AAGZ,QAAI,cAAc;AAEhB,aAAO;AAAA,QACP,cAAc,MAAM;AAAA;AAAA,EAE1B,iBAAiB;AAAA;AAAA;AAAA,IAGb,OAAO;AAEL,YAAM,kBACJ,QAAQ,IAAI,OAAO,cAAc,MAAM,MAAM,YAAY,cAAc,MAAM;AAC/E,aAAO,GAAG,eAAe;AAAA;AAAA,EAE/B,iBAAiB;AAAA;AAAA;AAAA,IAGb;AAAA,EACF,CAAC,EACA,KAAK,eAAe,OAAO,IAAI;AAGlC,WAAS,yBAAiC;AACxC,UAAM,aAAa;AAKnB,UAAM,0BAA0B;AAAA;AAAA;AAIhC,QAAI,gBAAgB,SAAS,cAAc;AACzC,aAAO,iFAAiF,KAAK,IAAI,YAAY,KAAK,EAAE;AAAA,IAAoC,UAAU;AAAA,IACpK,WAAW,gBAAgB,SAAS,iBAAiB;AACnD,YAAM,eAAe,gBAAgB;AAGrC,UAAI;AACJ,cAAQ,OAAO,cAAc;AAAA,QAC3B,KAAK;AACH,6BAAmB,iBAAiB,OAAO,YAAY,EAAE,QAAQ,MAAM,KAAK,CAAC;AAC7E;AAAA,QACF,KAAK;AACH,6BAAmB,eAAe,YAAY;AAC9C;AAAA,QACF,KAAK;AACH,6BAAmB,cAAc,YAAY;AAC7C;AAAA,QACF;AACE,6BAAmB,iBAAiB,OAAO,YAAY,CAAC;AAAA,MAC5D;AAGA,YAAM,qBAAqB,QACxB,IAAI,CAAC,WAAW;AACf,eAAO,mBAAmB,OAAO,KAAK,MAAM,gBAAgB;AAAA,MAC9D,CAAC,EACA,KAAK,IAAI;AAEZ,YAAM,0BACJ,QAAQ,SAAS,IACb;AAAA,EAA6C,kBAAkB;AAAA,kCAC/D;AAEN,UAAI,cAAc;AAEhB,eAAO;AAAA,EAA6C,kBAAkB;AAAA;AAAA,MACxE,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AAGL,UAAI,eAAe,cAAc,SAAS;AACxC,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAKA,MAAI;AACJ,MAAI,cAAc,aAAa,cAAc,aAAa;AAExD,QAAI,gBAAgB,SAAS,cAAc;AACzC,oBAAc;AAAA;AAAA,EAElB,uBAAuB,CAAC;AAAA;AAAA;AAAA,IAGtB,WAAW,gBAAgB,SAAS,iBAAiB;AACnD,oBAAc;AAAA;AAAA,EAElB,uBAAuB,CAAC;AAAA;AAAA;AAAA,IAGtB,OAAO;AACL,oBAAc;AAAA,IAChB;AAAA,EACF,WAAW,cAAc,UAAU;AACjC,kBAAc;AAAA;AAAA;AAAA;AAAA;AAAA,MAKZ,uBAAuB,CAAC;AAAA;AAAA;AAAA,oFAGsD,KAAK,IAAI,YAAY,KAAK,EAAE;AAAA;AAAA;AAAA,EAG9G,WAAW,cAAc,iBAAiB,cAAc,YAAY;AAClE,QAAI,QAAQ,WAAW,GAAG;AACxB,YAAM,IAAI,MAAM,GAAG,UAAU,YAAY,CAAC,gDAAgD;AAAA,IAC5F;AAEA,UAAM,gBAAgB,QAAQ,CAAC;AAC/B,kBAAc;AAAA;AAAA;AAAA,sCAGoB,cAAc,KAAK;AAAA,sCACnB,cAAc,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBvD,uBAAuB,CAAC;AAAA;AAAA;AAAA,IAItB,cAAc,aACV,qEACA,8BACN;AAAA,EACA,OAAO;AAEL,kBAAc;AAAA;AAAA,MAAmB,uBAAuB,CAAC;AAAA;AAAA,EAC3D;AAEA,QAAM,cAAc,WAAW,KAAK,EAAE;AAGtC,QAAM,kBAAkB;AAAA,+BACK,WAAW;AAAA,IACtC,iBAAiB;AAAA;AAAA,EAEnB,YAAY;AAAA,EACZ,WAAW;AAAA;AAAA;AAMX,MAAI,MAAM,SAAS,KAAK;AACtB,UAAM,EAAE,WAAW,MAAM,cAAc,IAAI,oBAAoB,iBAAiB,KAAK,EAAE;AACvF,QAAI,WAAW;AACb,aAAO,mDAAmD,KAAK,IAAI,MAAM,MAAM,MAAM;AAAA,EACzF,SAAS;AAAA;AAAA,EAET,aAAa;AAAA,IACX;AAAA,EACF;AAEA,SAAO;AACT;;;ACleO,SAAS,6BACdC,OACA,WACA,SAAiB,QACT;AACR,SAAO,kCAAkCA,KAAI;AAAA;AAAA,UAErC,MAAM,YAAY,SAAS;AAAA,UAC3B,MAAM,aAAaA,KAAI;AAAA,UACvB,MAAM,cAAc,MAAM;AAAA;AAAA,QAE5B,MAAM;AAAA,qBACO,MAAM,6BAA6B,MAAM;AAAA,MACxD,MAAM,2BAA2B,MAAM;AAAA;AAAA,MAEvC,MAAM;AAAA,cACE,MAAM,0BAA0B,MAAM;AAAA;AAAA;AAAA,QAG5C,MAAM,cAAc,MAAM;AAAA,aACrB,MAAM,WAAW,MAAM,QAAQ,MAAM,sBAAsB,MAAM;AAAA,YAClE,MAAM,WAAW,MAAM,UAAU,MAAM;AAAA,UACzC,MAAM,gBAAgB,MAAM,aAAa,MAAM,gBAAgB,MAAM;AAAA,QACvE,MAAM,cAAc,MAAM,gBAAgB,MAAM;AAAA;AAAA,cAE1C,MAAM;AAAA,QACZ,MAAM,gBAAgB,MAAM,uBAAuB,MAAM;AAAA,QACzD,MAAM,cAAc,MAAM;AAAA;AAAA;AAAA;AAAA,IAI9B,MAAM,gBAAgB,MAAM,UAAU,MAAM,uBAAuB,MAAM;AAAA;AAE7E;AAkBO,SAAS,6BACd,eACA,SAAiB,SACT;AACR,SAAO;AAAA,MACH,aAAa;AAAA,QACX,MAAM;AAAA,WACH,MAAM,WAAW,MAAM,QAAQ,MAAM,iBAAiB,MAAM;AAAA,UAC7D,MAAM,UAAU,MAAM,SAAS,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,SAKtC,MAAM,2BAA2B,MAAM,mBAAmB,MAAM;AAAA,MACnE,aAAa,QAAQ,MAAM,sBAAsB,MAAM;AAAA;AAAA;AAG7D;AAgBO,SAAS,2BACd,QACA,UACA,MAIQ;AACR,QAAM,cAAc,WAAW,MAAM;AACrC,QAAM,aAAuB,CAAC;AAG9B,aAAW,KAAK,mBAAmB,QAAQ,mBAAmB,WAAW,SAAS;AAElF,MAAI,CAAC,MAAM;AACT,WAAO,WAAW,KAAK,QAAQ;AAAA,EACjC;AAEA,QAAM,aAAa,KAAK,SAAS;AACjC,MAAI,YAAY;AACd,QAAI,CAAC,WAAW,SAAS,GAAG,GAAG;AAC7B,iBAAW,KAAK,YAAY,UAAU,sBAAsB,QAAQ,MAAM;AAAA,IAC5E,OAAO;AACL,iBAAW,KAAK,6BAA6B,YAAY,mBAAmB,QAAQ,IAAI,CAAC;AAAA,IAC3F;AAAA,EACF;AAOA,QAAM,kBACJ,KAAK,SAAS,uBACd,KAAK,SAAS,SAAS,KAAK,CAAC,MAA0B,EAAE,SAAS,EAAE,MAAM,SAAS,GAAG,CAAC;AACzF,QAAM,cACJ,KAAK,SAAS,oBAAoB,KAAK,SAAS,gBAAgB,QAAQ;AAE1E,MAAI,aAAa;AACf,eAAW,KAAK,6BAA6B,QAAQ,CAAC;AAAA,EACxD;AAEA,SAAO,WAAW,KAAK,QAAQ;AACjC;AAiBO,SAAS,6BAA6B,UAA0B;AAGrE,QAAM,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsBvB,SAAO,oCAAoC,QAAQ;AAAA;AAAA,yCAEZ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQvC,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOxB;;;ACzKA,SAAS,eAAe,aAAqB,SAAuC;AAClF,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC/D,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,SAAmB,CAAC;AAC1B,QAAM,QAAQ,CAAC,WAAW;AAE1B,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,YAAY,MAAM,MAAM;AAC9B,QAAI,QAAQ,IAAI,SAAS,GAAG;AAC1B;AAAA,IACF;AACA,YAAQ,IAAI,SAAS;AACrB,WAAO,KAAK,SAAS;AAGrB,UAAM,cAAc,QAAQ,IAAI,SAAS;AAIzC,QAAI,CAAC,aAAa;AAChB;AAAA,IACF;AAIA,QAAI,YAAY,SAAS,cAAc;AACrC;AAAA,IACF;AAGA,UAAM,gBAAgB,QAAQ,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,aAAa,SAAS;AAC9E,eAAW,QAAQ,eAAe;AAChC,YAAM,KAAK,KAAK,QAAQ;AAAA,IAC1B;AAAA,EACF;AAEA,SAAO;AACT;AASA,SAAS,yBACP,eACA,SAC4C;AAC5C,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAE/D,MAAI,cAAc,WAAW,GAAG;AAC9B,WAAO,EAAE,YAAY,IAAI,YAAY,eAAe;AAAA,EACtD;AAGA,QAAM,iBAAiB,cAAc,IAAI,CAAC,WAAW;AACnD,UAAM,OAAO,QAAQ,IAAI,MAAM;AAC/B,UAAM,WAAW,MAAM,QAAQ,WAAW,MAAM;AAChD,WAAO,2BAA2B,QAAQ,UAAU,IAAI;AAAA,EAC1D,CAAC;AAGD,QAAM,aAAa,cAAc,cAAc,SAAS,CAAC;AACzD,QAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,QAAM,eAAe,UAAU,QAAQ,WAAW,UAAU;AAG5D,QAAM,8BACJ,UAAU,SAAS,gBAAgB,UAAU,SAAS,gBAAgB;AAExE,MAAI,6BAA6B;AAE/B,mBAAe,KAAK,6BAA6B,uBAAuB,UAAU,CAAC;AACnF,WAAO;AAAA,MACL,YAAY,eAAe,KAAK,QAAQ;AAAA,MACxC,YAAY;AAAA,IACd;AAAA,EACF;AAEA,SAAO;AAAA,IACL,YAAY,eAAe,KAAK,QAAQ;AAAA,IACxC,YAAY,mBAAmB,YAAY;AAAA,EAC7C;AACF;AA0BO,SAAS,kBAAkB,MAAe,SAAiD;AAChG,QAAM,aAAa,KAAK;AACxB,QAAM;AAAA,IACJ;AAAA,IACA,WAAW;AAAA,IACX,iBAAiB;AAAA,EACnB,IAAI;AAEJ,QAAM,YAAY,gBAAgB;AAGlC,QAAM,kBAAkB,yBACtB,QAAQ,QAAQ,mBAAmB,EAAE,MAAM,aAAa;AAG1D,QAAM,gBACJ,cAAc,aACd,cAAc,eACd,cAAc,iBACd,cAAc;AAEhB,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAK/D,WAAS,oCAA6C;AACpD,QAAI,CAAC,eAAe;AAClB,aAAO;AAAA,IACT;AAEA,eAAW,aAAa,YAAY;AAClC,UAAI,UAAU,cAAc,MAAM,UAAU,UAAU,KAAK,MAAM,IAAI;AACnE;AAAA,MACF;AAGA,YAAM,OAAO,QAAQ,IAAI,MAAM;AAAA,QAC7B,CAAC,MAAM,EAAE,aAAa,KAAK,MAAM,EAAE,iBAAiB,UAAU;AAAA,MAChE;AACA,UAAI,CAAC,MAAM;AACT;AAAA,MACF;AAGA,YAAM,cAAc,eAAe,KAAK,UAAU,OAAO;AACzD,UAAI,YAAY,WAAW,GAAG;AAC5B,eAAO;AAAA,MACT;AAEA,YAAM,aAAa,YAAY,YAAY,SAAS,CAAC;AACrD,YAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,UAAI,CAAC,YAAY,SAAS,SAAS,cAAc;AAC/C,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,mBAAmB,WAAW;AAAA,MAClC,CAAC,MAAM,EAAE,cAAc,MAAM,EAAE,UAAU,KAAK,MAAM;AAAA,IACtD;AACA,QAAI,kBAAkB;AACpB,YAAM,OAAO,QAAQ,IAAI,MAAM;AAAA,QAC7B,CAAC,MAAM,EAAE,aAAa,KAAK,MAAM,EAAE,iBAAiB,iBAAiB;AAAA,MACvE;AACA,UAAI,MAAM;AACR,cAAM,cAAc,eAAe,KAAK,UAAU,OAAO;AACzD,YAAI,YAAY,SAAS,GAAG;AAC1B,gBAAM,aAAa,YAAY,YAAY,SAAS,CAAC;AACrD,gBAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,cAAI,CAAC,YAAY,SAAS,SAAS,cAAc;AAC/C,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,QAAM,4BAA4B,kCAAkC;AAGpE,QAAM,aAAgC,WAAW,IAAI,CAAC,cAAc;AAElE,UAAM,QAAQ,QAAQ,IAAI,MAAM;AAAA,MAC9B,CAAC,SAAS,KAAK,aAAa,KAAK,MAAM,KAAK,iBAAiB,UAAU;AAAA,IACzE;AACA,UAAM,gBAAgB,MAAM,IAAI,CAAC,SAAS,WAAW,KAAK,QAAQ,CAAC;AAEnE,WAAO;AAAA,MACL,IAAI,UAAU;AAAA,MACd,YAAY,UAAU;AAAA,MACtB,OAAO;AAAA;AAAA;AAAA,MAGP,WACE,CAAC,kBAAkB,UAAU,cAAc,MAAM,UAAU,UAAU,KAAK,MAAM;AAAA,IACpF;AAAA,EACF,CAAC;AAID,QAAM,oBAAoB,WAAW,OAAO,CAAC,MAAM,CAAC,EAAE,SAAS;AAC/D,QAAM,cAAc,gBAAgB,SAAY,WAAW,KAAK,CAAC,MAAM,EAAE,SAAS;AAGlF,QAAM,oBAAoB,gBAAgB,sCAAsC;AAGhF,WAAS,yBAAiC;AACxC,QAAI,gBAAgB,SAAS,cAAc;AACzC,aAAO,8EAA8E,KAAK,IAAI,YAAY,KAAK,EAAE;AAAA;AAAA,IACnH,WAAW,gBAAgB,SAAS,iBAAiB;AAEnD,YAAM,eAAe,gBAAgB;AACrC,UAAI;AACJ,cAAQ,OAAO,cAAc;AAAA,QAC3B,KAAK;AACH,6BAAmB,iBAAiB,OAAO,YAAY,EAAE,QAAQ,MAAM,KAAK,CAAC;AAC7E;AAAA,QACF,KAAK;AACH,6BAAmB,eAAe,YAAY;AAC9C;AAAA,QACF,KAAK;AACH,6BAAmB,cAAc,YAAY;AAC7C;AAAA,QACF;AACE,6BAAmB,iBAAiB,OAAO,YAAY,CAAC;AAAA,MAC5D;AAEA,aAAO,gBACH,uBAAuB,gBAAgB,QACvC,UAAU,gBAAgB;AAAA,IAChC,OAAO;AAEL,aAAO;AAAA,IACT;AAAA,EACF;AAGA,WAAS,gCAAwC;AAC/C,QAAI,CAAC,aAAa;AAChB,aAAO,uBAAuB;AAAA,IAChC;AAIA,QAAI,CAAC,YAAY,SAAS,YAAY,MAAM,WAAW,GAAG;AAExD,aAAO,uBAAuB;AAAA,IAChC;AAGA,UAAM,gBAAgB,YAAY,MAAM,CAAC;AAEzC,UAAM,cAAc,QAAQ,IAAI,MAAM;AAAA,MACpC,CAAC,MAAM,EAAE,aAAa,KAAK,MAAM,EAAE,iBAAiB,YAAY;AAAA,IAClE;AACA,UAAM,cAAc,aAAa,YAAY;AAC7C,UAAM,gBAAgB,eAAe,aAAa,OAAO;AAGzD,UAAM,EAAE,YAAAC,aAAY,WAAW,IAAI,yBAAyB,eAAe,OAAO;AAElF,QAAI,eAAe;AACjB,aAAO,OAAOA,WAAU;AAAA,mBAAsB,UAAU;AAAA,IAC1D,OAAO;AACL,aAAO,OAAOA,WAAU;AAAA,aAAgB,UAAU;AAAA,IACpD;AAAA,EACF;AAGA,MAAI;AACJ,MAAI;AAGJ,WAAS,2BAA2B,WAAsC;AACxE,QAAI,CAAC,UAAU,SAAS,UAAU,MAAM,WAAW,GAAG;AACpD,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,OAAO,QAAQ,IAAI,MAAM;AAAA,MAC7B,CAAC,MAAM,EAAE,aAAa,KAAK,MAAM,EAAE,iBAAiB,UAAU;AAAA,IAChE;AACA,UAAM,cAAc,MAAM,YAAY,UAAU,MAAM,CAAC;AACvD,WAAO,eAAe,aAAa,OAAO;AAAA,EAC5C;AAGA,MAAI,kBAAkB,WAAW,GAAG;AAClC,wBAAoB;AACpB,QAAI,eAAe,YAAY,SAAS,YAAY,MAAM,SAAS,GAAG;AAEpE,YAAM,gBAAgB,2BAA2B,WAAW;AAC5D,YAAM,EAAE,YAAAA,aAAY,WAAW,IAAI,yBAAyB,eAAe,OAAO;AAElF,UAAI,eAAe;AACjB,sBAAc;AAAA,IAClBA,WAAU;AAAA,iBACG,UAAU;AAAA;AAAA,MAErB,OAAO;AACL,sBAAc;AAAA,IAClBA,WAAU;AAAA,WACH,UAAU;AAAA,MACf;AAAA,IACF,OAAO;AAEL,oBAAc;AAAA,IAAO,uBAAuB,CAAC;AAAA,IAC/C;AAAA,EACF,OAAO;AAEL,wBAAoB,kBACjB,IAAI,CAAC,WAAW,QAAQ;AAEvB,UAAI;AAEJ,UAAI,UAAU,eAAe,MAAM,UAAU,WAAW,KAAK,MAAM,IAAI;AACrE,uBAAe;AAAA,MACjB,OAAO;AACL,YAAI;AACF,gBAAM,MAAM,QAAQ,gBAAgB,UAAU,UAAU;AAExD,gBAAM,WAAW,kBAAkB,KAAK,OAAO;AAC/C,yBAAe,GAAG,QAAQ;AAAA,QAC5B,QAAQ;AAGN,yBAAe;AAAA,QACjB;AAAA,MACF;AAGA,YAAM,gBAAgB,2BAA2B,SAAS;AAC1D,YAAM,EAAE,YAAAA,aAAY,WAAW,IAAI,yBAAyB,eAAe,OAAO;AAGlF,UAAI,eAAe;AAEjB,YAAI,2BAA2B;AAG7B,gBAAMC,cAAa;AAAA,QAAW,YAAY;AAAA,MAChDD,WAAU;AAAA;AAEJ,iBAAOC;AAAA,QACT;AACA,cAAM,aAAa;AAAA,QAAW,YAAY;AAAA,MAC9CD,WAAU;AAAA,mBACG,UAAU;AAAA;AAEnB,eAAO;AAAA,MACT,OAAO;AAEL,cAAM,SAAS,QAAQ,IAAI,WAAW;AACtC,cAAM,aAAa,GAAG,MAAM,KAAK,YAAY;AAAA,MACjDA,WAAU;AAAA,aACH,UAAU;AAAA;AAEb,eAAO;AAAA,MACT;AAAA,IACF,CAAC,EACA,KAAK,EAAE;AAEV,QAAI,eAAe;AAEjB,UAAI,cAAc,iBAAiB,cAAc,YAAY;AAC3D,YACE,eACA,gBAAgB,SAAS,gBACzB,gBAAgB,SAAS,iBACzB;AACA,wBAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EActB,8BAA8B,CAAC;AAAA;AAAA;AAAA,IAG7B,cAAc,aAAa,uBAAuB,8BAA8B;AAAA,QAC5E,OAAO;AACL,wBAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAcpB,cAAc,aACV,2DACA,8BACN;AAAA,QACM;AAAA,MACF,OAAO;AAEL,YAAI,2BAA2B;AAG7B,cAAI,aAAa;AACf,0BAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcxB,8BAA8B,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAYvB,OAAO;AACL,0BAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAahB;AAAA,QACF,WACE,eACA,gBAAgB,SAAS,gBACzB,gBAAgB,SAAS,iBACzB;AACA,wBAAc;AAAA;AAAA,EAEtB,8BAA8B,CAAC;AAAA;AAAA;AAAA,QAGzB,OAAO;AACL,wBAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF,OAAO;AAEL,UAAI,aAAa;AAGf,sBAAc;AAAA;AAAA;AAAA,EAA4D,8BAA8B,CAAC;AAAA;AAAA,MAC3G,OAAO;AAEL,sBAAc;AAAA;AAAA,MAAmB,uBAAuB,CAAC;AAAA;AAAA,MAC3D;AAAA,IACF;AAAA,EACF;AAEA,QAAM,cAAc,WAAW,KAAK,EAAE;AACtC,SAAO;AAAA,+BACsB,WAAW;AAAA,IACtC,iBAAiB;AAAA;AAAA,IAEjB,iBAAiB,GAAG,WAAW;AAAA;AAAA;AAGnC;;;ACrhBA,SAAS,mBAAmB,QAAwB;AAClD,SAAO,OAAO,WAAW,MAAM,CAAC;AAClC;AAKA,SAAS,8BACP,MACA,SACA,aACA,QACoB;AACpB,QAAM,cAAc,WAAW,KAAK,EAAE;AAGtC,QAAM,QAAQ,WAAW,WAAW;AAGpC,QAAM,kBAAkB,mBAAmB,KAAK;AAGhD,QAAM,UAAU,IAAI,IAAI,YAAY,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAK/D,QAAM,iBAAiB,gBACpB,IAAI,CAAC,WAAW;AACf,UAAM,UAAU,QAAQ,IAAI,MAAM;AAClC,QAAI,CAAC,WAAW,QAAQ,SAAS,gBAAgB,QAAQ,SAAS,aAAa;AAC7E,aAAO;AAAA,IACT;AACA,UAAM,aAAa,SAAS,WAAW,MAAM;AAE7C,WAAO,qBAAqB,QAAQ,IAAI,mBAAmB,UAAU;AAAA,EACvE,CAAC,EACA,OAAO,OAAO,EACd,KAAK,IAAI;AAGZ,QAAM,iBAAiB,gBAAgB,OAAO,CAAC,OAAO;AACpD,UAAM,UAAU,QAAQ,IAAI,EAAE;AAC9B,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,IACT;AACA,WAAO,QAAQ,SAAS,eAAe,QAAQ,SAAS;AAAA,EAC1D,CAAC;AAKD,MAAI;AACJ,MAAI,eAAe,SAAS,GAAG;AAC7B,UAAM,aAAa,eAAe,eAAe,SAAS,CAAC;AAC3D,UAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,iBAAa,kCAAkC,SAAS,IAAI;AAAA,EAC9D,OAAO;AAML,iBAAa;AAAA,EACf;AAEA,SAAO;AAAA,2CACkC,KAAK,EAAE;AAAA,sCACZ,WAAW;AAAA;AAAA,EAE/C,cAAc;AAAA;AAAA;AAAA,EAGd,UAAU;AAAA;AAAA;AAAA;AAAA;AAKZ;AAKA,SAAS,4BACP,MACA,yBACoB;AACpB,QAAM,cAAc,WAAW,KAAK,EAAE;AACtC,QAAM,WAAW,iBAAiB,WAAW;AAE7C,SAAO;AAAA,+CACsC,KAAK,EAAE;AAAA,+BACvB,WAAW;AAAA;AAAA,gCAEV,QAAQ;AAAA,qCACH,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,oCAKT,WAAW;AAAA,uEACwB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4BAMtD,WAAW;AAAA;AAAA;AAAA,iBAGtB,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oDAMY,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,4BAQnC,QAAQ;AAAA;AAAA;AAAA,kDAGc,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQ7D;AAgBO,SAAS,oBACd,MACA,SACoB;AAEpB,MAAI,QAAQ,aAAa,SAAS,KAAK,EAAE,GAAG;AAC1C,UAAM,IAAI;AAAA,MACR,mDAAmD,QAAQ,aAAa,KAAK,MAAM,CAAC,OAAO,KAAK,EAAE;AAAA,IACpG;AAAA,EACF;AAGA,QAAM,iBAAiB,KAAK,SAAS;AACrC,MAAI,CAAC,gBAAgB;AACnB,UAAM,IAAI;AAAA,MACR,iBAAiB,KAAK,EAAE;AAAA,IAC1B;AAAA,EACF;AAKA,MAAI;AAGJ,UAAQ,aAAa,KAAK,KAAK,EAAE;AAEjC,MAAI;AAEF,kBAAc,QAAQ,aAAa,cAAc;AAGjD,UAAM,YAAY,YAAY,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW;AACtE,UAAM,cAAc,YAAY,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AAE3E,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,gBAAgB,cAAc,oBAAoB;AAAA,IACpE;AAEA,QAAI,YAAY,WAAW,GAAG;AAC5B,YAAM,IAAI,MAAM,gBAAgB,cAAc,sBAAsB;AAAA,IACtE;AAGA,UAAM,qBAAqB,QAAQ,qBAAqB,IAAI,cAAc;AAC1E,QAAI,oBAAoB;AAEtB,YAAME,eAAc,4BAA4B,MAAM,kBAAkB;AACxE,aAAOA;AAAA,IACT;AAGA,UAAM,SAAS,mBAAmB,KAAK,EAAE;AACzC,UAAM,cAAc,WAAW,KAAK,EAAE;AACtC,UAAM,0BAA0B,uBAAuB,WAAW;AAGlE,YAAQ,qBAAqB,IAAI,gBAAgB,uBAAuB;AAKxE,UAAM,aAAiC;AAAA,MACrC,GAAG;AAAA,MACH,cAAc,CAAC,GAAG,QAAQ,YAAY;AAAA,IACxC;AAGA,QAAI,cAAc;AAClB,eAAW,WAAW,YAAY,OAAO;AACvC,YAAM,WAAW,QAAQ;AAGzB,UAAI,aAAa,cAAc;AAC7B;AAAA,MACF;AAGA,YAAM,eAAe;AAAA,QACnB,GAAG;AAAA,QACH,IAAI,SAAS,QAAQ;AAAA,MACvB;AAGA,cAAQ,UAAU;AAAA,QAChB,KAAK;AACH,yBAAe,iBAAiB,cAAc,OAAO;AACrD;AAAA,QACF,KAAK;AACH,yBAAe,yBAAyB,cAAc,OAAO;AAC7D;AAAA,QACF,KAAK;AACH,yBAAe,kBAAkB,cAAc,OAAO;AACtD;AAAA,QACF,KAAK;AACH,yBAAe,sBAAsB,cAAc,OAAO;AAC1D;AAAA,QACF,KAAK;AACH,yBAAe,oBAAoB,cAAc,OAAO;AACxD;AAAA,QACF,KAAK;AAEH,yBAAe,oBAAoB,cAAc,UAAU;AAC3D;AAAA,QACF;AAEE;AAAA,MACJ;AAAA,IACF;AAGA,UAAM,iBAAiB,8BAA8B,MAAM,SAAS,aAAa,MAAM;AAGvF,UAAM,cAAc,4BAA4B,MAAM,uBAAuB;AAE7E,UAAM,eAAe,cAAc,iBAAiB;AAGpD,WAAO;AAAA,EACT,UAAE;AAEA,UAAM,YAAY,QAAQ,aAAa,QAAQ,KAAK,EAAE;AACtD,QAAI,cAAc,IAAI;AACpB,cAAQ,aAAa,OAAO,WAAW,CAAC;AAAA,IAC1C;AAAA,EACF;AACF;;;ACzQO,SAAS,mBAAmB,KAAiC;AAClE,QAAM,cAAc,oBAAI,IAAY;AACpC,8BAA4B,KAAK,WAAW;AAC5C,SAAO;AACT;AAKA,SAAS,4BAA4B,KAAoB,aAAgC;AACvF,UAAQ,IAAI,MAAM;AAAA,IAChB,KAAK,cAAc;AACjB,YAAM,QAAQ;AACd,kBAAY,IAAI,MAAM,IAAI;AAC1B;AAAA,IACF;AAAA,IAEA,KAAK;AAEH,kCAA6B,IAAY,QAAQ,WAAW;AAE5D;AAAA,IAEF,KAAK;AAEH,kCAA6B,IAAY,QAAQ,WAAW;AAE5D,kCAA6B,IAAY,OAAO,WAAW;AAC3D;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,MAAM,WAAW;AAC1D,kCAA6B,IAAY,OAAO,WAAW;AAC3D;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,SAAS,WAAW;AAC7D;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,WAAW,WAAW;AAC/D,kCAA6B,IAAY,YAAY,WAAW;AAChE,kCAA6B,IAAY,WAAW,WAAW;AAC/D;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,QAAQ,WAAW;AAC5D,iBAAW,OAAQ,IAAY,MAAM;AACnC,oCAA4B,KAAK,WAAW;AAAA,MAC9C;AACA;AAAA,IAEF,KAAK;AACH,iBAAW,WAAY,IAAY,UAAU;AAC3C,oCAA4B,SAAS,WAAW;AAAA,MAClD;AACA;AAAA,IAEF,KAAK;AACH,iBAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAS,IAAY,UAAU,GAAG;AACnE,oCAA4B,OAAwB,WAAW;AAAA,MACjE;AACA;AAAA,IAEF,KAAK;AACH,iBAAW,QAAS,IAAY,OAAO;AACrC,YAAI,OAAO,SAAS,UAAU;AAE5B,sCAA4B,MAAuB,WAAW;AAAA,QAChE;AAAA,MAEF;AACA;AAAA,IAEF,KAAK;AACH,kCAA6B,IAAY,OAAO,WAAW;AAC3D,kCAA6B,IAAY,KAAK,WAAW;AACzD;AAAA;AAAA,IAGF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAEH;AAAA,IAEF;AACE,YAAM,IAAI,MAAM,0BAA2B,IAAY,IAAI,EAAE;AAAA,EACjE;AACF;AAcO,SAAS,wBACd,uBACA,SACA,UACM;AAEN,QAAM,iBAAiB,oBAAI,IAAY;AAGvC,aAAW,SAAS,QAAQ,YAAY,QAAQ;AAC9C,UAAM,QAAQ,MAAM,KAAK,MAAM,GAAG;AAClC,mBAAe,IAAI,MAAM,CAAC,CAAC;AAG3B,mBAAe,IAAI,MAAM,IAAI;AAAA,EAC/B;AAGA,QAAM,gBAA0B,CAAC;AAEjC,aAAW,cAAc,uBAAuB;AAI9C,QAAI,eAAe,OAAO,eAAe,KAAK;AAC5C;AAAA,IACF;AAGA,QAAI,QAAQ;AAEZ,QAAI,eAAe,IAAI,UAAU,GAAG;AAClC,cAAQ;AAAA,IACV,OAAO;AAEL,iBAAW,YAAY,gBAAgB;AACrC,YAAI,SAAS,WAAW,aAAa,GAAG,GAAG;AACzC,kBAAQ;AACR;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,OAAO;AACV,oBAAc,KAAK,UAAU;AAAA,IAC/B;AAAA,EACF;AAGA,MAAI,cAAc,SAAS,GAAG;AAC5B,UAAM,cAAc,cACjB,KAAK,EACL,IAAI,CAAC,OAAO,IAAI,EAAE,GAAG,EACrB,KAAK,IAAI;AACZ,UAAM,UACJ,cAAc,WAAW,IACrB,oBAAoB,cAAc,CAAC,CAAC,0CACpC,0DAA0D,WAAW;AAE3E,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,OAAO;AAAA,MACT;AAAA,MACA,EAAE,cAAoC;AAAA,IACxC;AAAA,EACF;AACF;AAWO,SAAS,yBACd,SACA,gBACa;AACb,QAAM,kBAAkB,oBAAI,IAAY;AAExC,aAAW,QAAQ,QAAQ,IAAI,OAAO;AACpC,UAAM,WAAW,KAAK;AAEtB,QAAI;AACF,UAAI,aAAa,kBAAkB;AAEjC,cAAM,cAAc,KAAK,QAAQ;AACjC,mBAAW,QAAQ,aAAa;AAC9B,0BAAgB,IAAI,KAAK,GAAG;AAAA,QAC9B;AAAA,MACF,WAAW,aAAa,qBAAqB;AAE3C,cAAM,UAAU,KAAK;AACrB,YAAI,QAAQ,SAAS;AACnB,qBAAW,UAAU,QAAQ,SAAS;AACpC,gBAAI,OAAO,OAAO;AAChB,8BAAgB,IAAI,OAAO,KAAK;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IAGF,SAAS,OAAO;AAEd,UAAI,gBAAgB;AAClB,cAAM,MACJ,iBAAiB,mBACb,QACA,IAAI;AAAA,UACF,mDAAmD,KAAK,QAAQ,KAAK,EAAE,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA;AAAA,UAEnI,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAAA,QACzC;AACN,uBAAe,IAAI,GAAG;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAeO,SAAS,yBACd,iBACA,SACA,UACM;AAEN,QAAM,kBAAkB,oBAAI,IAAY;AAGxC,aAAW,SAAS,QAAQ,aAAa,QAAQ;AAC/C,oBAAgB,IAAI,MAAM,IAAI;AAAA,EAChC;AAGA,QAAM,iBAA2B,CAAC;AAElC,aAAW,UAAU,iBAAiB;AAGpC,QAAI,QAAQ;AAGZ,QAAI,gBAAgB,IAAI,MAAM,GAAG;AAC/B,cAAQ;AAAA,IACV,OAAO;AAGL,iBAAW,YAAY,iBAAiB;AACtC,YAAI,SAAS,WAAW,SAAS,GAAG,GAAG;AACrC,kBAAQ;AACR;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,OAAO;AACV,qBAAe,KAAK,MAAM;AAAA,IAC5B;AAAA,EACF;AAGA,MAAI,eAAe,SAAS,GAAG;AAC7B,UAAM,cAAc,eACjB,KAAK,EACL,IAAI,CAAC,UAAU,IAAI,KAAK,GAAG,EAC3B,KAAK,IAAI;AACZ,UAAM,UACJ,eAAe,WAAW,IACtB,iBAAiB,eAAe,CAAC,CAAC,wEAClC,qFAAqF,WAAW;AAEtG,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,OAAO;AAAA,MACT;AAAA,MACA,EAAE,eAAsC;AAAA,IAC1C;AAAA,EACF;AACF;AAWO,SAAS,4BAA4B,SAAmC;AAC7E,QAAM,iBAAiB,IAAI,eAAe;AAG1C,QAAM,kBAAkB,yBAAyB,SAAS,cAAc;AAGxE,MAAI;AACF,6BAAyB,iBAAiB,OAAO;AAAA,EACnD,SAAS,OAAO;AACd,QAAI,iBAAiB,kBAAkB;AACrC,qBAAe,IAAI,KAAK;AAAA,IAC1B,OAAO;AACL,YAAM;AAAA,IACR;AAAA,EACF;AAGA,iBAAe,cAAc;AAC/B;AAWO,SAAS,2BAA2B,SAAmC;AAC5E,QAAM,iBAAiB,IAAI,eAAe;AAC1C,QAAM,cAAc,QAAQ;AAC5B,QAAM,iBAAiB,oBAAI,IAAY;AAGvC,aAAW,SAAS,YAAY,QAAQ;AACtC,UAAM,QAAQ,MAAM,KAAK,MAAM,GAAG;AAClC,mBAAe,IAAI,MAAM,CAAC,CAAC;AAC3B,mBAAe,IAAI,MAAM,IAAI;AAAA,EAC/B;AAGA,QAAM,iBAAiB,oBAAI,IAAY;AAGvC,QAAM,mBAAmB,CACvB,QACA,UACA,YACA,UACqB;AACrB,QAAI,iBAAiB,kBAAkB;AAErC,UAAI,CAAC,MAAM,UAAU,QAAQ;AAC3B,eAAO,IAAI,iBAAiB,MAAM,SAAS,MAAM,MAAM,EAAE,QAAQ,SAAS,GAAG,MAAM,OAAO;AAAA,MAC5F;AACA,aAAO;AAAA,IACT;AACA,WAAO,IAAI;AAAA,MACT,+BAA+B,UAAU,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA;AAAA,MAErG,EAAE,QAAQ,SAAS;AAAA,IACrB;AAAA,EACF;AAGA,aAAW,QAAQ,QAAQ,IAAI,OAAO;AACpC,UAAM,WAAW,KAAK;AAEtB,QAAI;AACF,UAAI,aAAa,kBAAkB;AAEjC,cAAM,cAAc,KAAK,QAAQ;AACjC,mBAAW,QAAQ,aAAa;AAC9B,cAAI;AACF,kBAAM,MAAM,QAAQ,gBAAgB,KAAK,KAAK;AAC9C,kBAAM,cAAc,mBAAmB,GAAG;AAC1C,uBAAW,MAAM,aAAa;AAC5B,6BAAe,IAAI,EAAE;AAAA,YACvB;AAAA,UACF,SAAS,OAAO;AACd,2BAAe,IAAI,iBAAiB,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,CAAC;AAAA,UAC5E;AAAA,QACF;AAAA,MACF,WAAW,aAAa,qBAAqB;AAE3C,cAAM,UAAU,KAAK;AACrB,YAAI,QAAQ,OAAO;AACjB,qBAAW,QAAQ,QAAQ,OAAO;AAChC,gBAAI,KAAK,OAAO;AACd,yBAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,KAAK,KAA+B,GAAG;AAChF,oBACE,SACA,OAAO,UAAU,YACjB,CAAC,CAAC,QAAQ,SAAS,MAAM,EAAE,SAAS,MAAM,YAAY,CAAC,GACvD;AACA,sBAAI;AACF,0BAAM,MAAM,QAAQ,gBAAgB,KAAK;AACzC,0BAAM,cAAc,mBAAmB,GAAG;AAC1C,+BAAW,MAAM,aAAa;AAC5B,qCAAe,IAAI,EAAE;AAAA,oBACvB;AAAA,kBACF,SAAS,OAAO;AAEd,mCAAe,IAAI,iBAAiB,KAAK,IAAI,KAAK,MAAM,OAAO,KAAK,CAAC;AAAA,kBACvE;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF,WAAW,aAAa,cAAc;AAEpC,cAAM,UAAU,KAAK;AACrB,YAAI,QAAQ,OAAO;AACjB,qBAAW,cAAc,QAAQ,OAAO;AACtC,gBAAI,WAAW,aAAa,WAAW,UAAU,YAAY;AAC3D,kBAAI;AACF,sBAAM,MAAM,QAAQ,gBAAgB,WAAW,UAAU,UAAU;AACnE,sBAAM,cAAc,mBAAmB,GAAG;AAC1C,2BAAW,MAAM,aAAa;AAC5B,iCAAe,IAAI,EAAE;AAAA,gBACvB;AAAA,cACF,SAAS,OAAO;AAEd,+BAAe;AAAA,kBACb,iBAAiB,KAAK,IAAI,KAAK,MAAM,WAAW,UAAU,YAAY,KAAK;AAAA,gBAC7E;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AAEd,YAAM,MACJ,iBAAiB,mBACb,QACA,IAAI;AAAA,QACF,2BAA2B,KAAK,QAAQ,KAAK,EAAE,MAAM,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA;AAAA,QAE3G,EAAE,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK;AAAA,MACzC;AACN,qBAAe,IAAI,GAAG;AAAA,IACxB;AAAA,EACF;AAGA,MAAI;AACF,4BAAwB,gBAAgB,OAAO;AAAA,EACjD,SAAS,OAAO;AACd,QAAI,iBAAiB,kBAAkB;AACrC,qBAAe,IAAI,KAAK;AAAA,IAC1B,OAAO;AACL,YAAM;AAAA,IACR;AAAA,EACF;AAGA,iBAAe,cAAc;AAC/B;;;ACleA,SAAS,kBAAkB,OAAyC;AAClE,QAAM,eAAe,oBAAI,IAAsB;AAE/C,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,aAAa,IAAI,KAAK,QAAQ;AAC9C,QAAI,SAAS;AACX,cAAQ,KAAK,KAAK,QAAQ;AAAA,IAC5B,OAAO;AACL,mBAAa,IAAI,KAAK,UAAU,CAAC,KAAK,QAAQ,CAAC;AAAA,IACjD;AAAA,EACF;AAEA,SAAO;AACT;AAiBO,SAAS,wBAAwB,KAA+B;AAErE,QAAM,eAAe,kBAAkB,IAAI,KAAK;AAGhD,QAAM,cAAc,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AACnE,QAAM,sBAAsB,oBAAI,IAAY;AAG5C,QAAM,WAAqB,CAAC;AAC5B,aAAW,cAAc,aAAa;AACpC,UAAM,UAAU,aAAa,IAAI,WAAW,EAAE,KAAK,CAAC;AACpD,eAAW,YAAY,SAAS;AAC9B,UAAI,CAAC,oBAAoB,IAAI,QAAQ,GAAG;AACtC,4BAAoB,IAAI,QAAQ;AAChC,iBAAS,KAAK,QAAQ;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAIA,MAAI,aAAa;AACjB,SAAO,aAAa,SAAS,QAAQ;AACnC,UAAM,YAAY,SAAS,YAAY;AAGvC,UAAM,UAAU,aAAa,IAAI,SAAS,KAAK,CAAC;AAChD,eAAW,YAAY,SAAS;AAC9B,UAAI,CAAC,oBAAoB,IAAI,QAAQ,GAAG;AACtC,4BAAoB,IAAI,QAAQ;AAChC,iBAAS,KAAK,QAAQ;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;AC1EO,SAAS,wBAAwB,MAAwB;AAC9D,MAAI,KAAK,SAAS,qBAAqB;AACrC,WAAO;AAAA,EACT;AACA,QAAM,YAAY,KAAK,SAAS,aAAa;AAC7C,SAAO,CAAC,WAAW,aAAa,eAAe,UAAU,EAAE,SAAS,SAAS;AAC/E;AAyBO,SAAS,iBAAiB,SAAiD;AAChF,QAAM,EAAE,SAAS,eAAe,IAAI;AAIpC,QAAM,cAAc,eAAe,OAAO,CAAC,OAAO;AAChD,UAAM,OAAO,QAAQ,IAAI,EAAE;AAC3B,WAAO,QAAQ,KAAK,SAAS;AAAA,EAC/B,CAAC;AAGD,MAAI,YAAY,SAAS,GAAG;AAE1B,UAAM,mBAAmB,YAAY,YAAY,SAAS,CAAC;AAC3D,WAAO,QAAQ,IAAI,gBAAgB,KAAK;AAAA,EAC1C;AAGA,MAAI,eAAe,SAAS,GAAG;AAC7B,UAAM,aAAa,eAAe,eAAe,SAAS,CAAC;AAC3D,WAAO,QAAQ,IAAI,UAAU,KAAK;AAAA,EACpC;AAEA,SAAO;AACT;AAaO,SAAS,mBAAmB,MAAuB;AAGxD,MAAI,wBAAwB,IAAI,GAAG;AACjC,WAAO,kCAAkC,KAAK,IAAI;AAAA,EACpD;AAQA,QAAM,iBAAiB,KAAK,SAAS,gBAAgB;AACrD,MAAI,gBAAgB;AAClB,WAAO;AAAA,uCAC4B,KAAK,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoC9C;AAEA,SAAO,kCAAkC,KAAK,IAAI;AACpD;AASO,SAAS,2BACd,eACAC,aACQ;AACR,MAAI,cAAc,OAAO,GAAG;AAE1B,UAAM,eAAe,MAAM,KAAK,aAAa,EAAE,CAAC;AAChD,UAAM,oBAAoBA,YAAW,YAAY;AACjD,WAAO,+BAA+B,iBAAiB;AAAA,EACzD;AACA,SAAO;AACT;;;AChHA,IAAM,0BAA0B,MAAM;AAY/B,SAAS,gBAAgB,KAAkB,SAAiD;AAEjG,QAAM,QAAQ,WAAW,GAAG;AAG5B,QAAM,kBAAkB,mBAAmB,KAAK;AAGhD,MAAI,QAAQ,QAAQ,aAAa,OAAO;AACtC,+BAA2B,OAAO;AAClC,gCAA4B,OAAO;AAAA,EACrC;AAGA,QAAM,UAAU,IAAI,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAGvD,QAAM,eAAe,aAAa,iBAAiB,SAAS,OAAO;AAGnE,QAAM,sBAAsB,MAAM,KAAK,QAAQ,gBAAgB,OAAO,CAAC,EAAE,KAAK,IAAI;AAGlF,QAAM,sBAAsB,wBAAwB,GAAG;AAGvD,QAAM,iBAAiB,uBAAuB,iBAAiB,SAAS,mBAAmB;AAG3F,QAAM,gBAAgB,kBAAkB,GAAG;AAG3C,QAAM,iBAAiB,qBAAqB,iBAAiB,SAAS,mBAAmB;AAGzF,QAAM,aAAa,4BAA4B,SAAS,gBAAgB,aAAa;AAGrF,SAAO,mBAAmB,qBAAqB,cAAc,gBAAgB,UAAU;AACzF;AAKA,SAAS,aACP,iBACA,SACA,SACQ;AACR,MAAI,eAAe;AAEnB,aAAW,UAAU,iBAAiB;AACpC,UAAM,OAAO,QAAQ,IAAI,MAAM;AAC/B,QAAI,CAAC,MAAM;AACT;AAAA,IACF;AAEA,UAAM,WAAW,KAAK;AAEtB,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,wBAAgB,iBAAiB,MAAM,OAAO;AAC9C;AAAA,MACF,KAAK;AACH,wBAAgB,yBAAyB,MAAM,OAAO;AACtD;AAAA,MACF,KAAK;AACH,wBAAgB,kBAAkB,MAAM,OAAO;AAC/C;AAAA,MACF,KAAK;AACH,wBAAgB,oBAAoB,MAAM,OAAO;AACjD;AAAA,MACF,KAAK;AACH,wBAAgB,kBAAkB,MAAM,OAAO;AAC/C;AAAA,MACF,KAAK;AACH,wBAAgB,sBAAsB,MAAM,OAAO;AACnD;AAAA,MACF,KAAK;AACH,wBAAgB,oBAAoB,MAAM,OAAO;AACjD;AAAA,MACF;AAEE;AAAA,IACJ;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,uBACP,iBACA,SACA,qBACQ;AACR,SAAO,gBACJ,IAAI,CAAC,WAAW;AACf,UAAM,OAAO,QAAQ,IAAI,MAAM;AAC/B,QAAI,CAAC,QAAQ,KAAK,SAAS,cAAc;AACvC,aAAO;AAAA,IACT;AAGA,QAAI,oBAAoB,IAAI,MAAM,GAAG;AACnC,aAAO;AAAA,IACT;AAEA,WAAOC,4BAA2B,IAAI;AAAA,EACxC,CAAC,EACA,OAAO,OAAO,EACd,KAAK,IAAI;AACd;AAKA,SAASA,4BAA2B,MAAuB;AACzD,QAAM,cAAc,WAAW,KAAK,EAAE;AAGtC,QAAM,iBAAiB,KAAK,SAAS,gBAAgB;AAGrD,MAAI,OAAO,qBAAqB,KAAK,IAAI,mBAAmB,WAAW;AAIvE,QAAM,aAAa,KAAK,SAAS;AACjC,MAAI,YAAY;AAEd,QAAI,CAAC,WAAW,SAAS,GAAG,GAAG;AAE7B,cAAQ;AAAA,wCAC0B,UAAU;AAAA,aACrC,UAAU,sBAAsB,KAAK,IAAI;AAAA,IAClD,OAAO;AAEL,cAAQ;AAAA,IACV,6BAA6B,YAAY,mBAAmB,KAAK,IAAI,IAAI,CAAC;AAAA,IAC1E;AAAA,EACF;AAIA,MAAI,gBAAgB;AAClB,YAAQ;AAAA,IAAO,6BAA6B,KAAK,IAAI,CAAC;AAAA,EACxD;AAEA,SAAO;AACT;AAKA,SAAS,kBAAkB,KAA+B;AACxD,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,QAAQ,IAAI,OAAO;AAC5B,UAAM,gBAAgB,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,aAAa,KAAK,EAAE;AACpE,QAAI,cAAc,WAAW,GAAG;AAC9B,oBAAc,IAAI,KAAK,EAAE;AAAA,IAC3B;AAAA,EACF;AACA,SAAO;AACT;AAKA,SAAS,qBACP,iBACA,SACA,qBACU;AACV,SAAO,gBAAgB,OAAO,CAAC,OAAO;AACpC,UAAM,OAAO,QAAQ,IAAI,EAAE;AAC3B,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,IACT;AAEA,QAAI,KAAK,SAAS,eAAe,KAAK,SAAS,cAAc;AAC3D,aAAO;AAAA,IACT;AAEA,QAAI,oBAAoB,IAAI,EAAE,GAAG;AAC/B,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAKA,SAAS,4BACP,SACA,gBACA,eACQ;AAER,QAAM,aAAa,iBAAiB;AAAA,IAClC;AAAA,IACA;AAAA,IACA,qBAAqB,oBAAI,IAAI;AAAA;AAAA,EAC/B,CAAC;AAED,MAAI,YAAY;AACd,WAAO,mBAAmB,UAAU;AAAA,EACtC;AAEA,SAAO,2BAA2B,eAAe,UAAU;AAC7D;AAKA,SAAS,mBACP,qBACA,cACA,gBACA,YACQ;AACR,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBP,mBAAmB;AAAA;AAAA,EAEnB,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2BAmBa,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYhD,cAAc;AAAA;AAAA;AAAA,EAGd,UAAU;AAAA;AAAA;AAAA;AAAA;AAKZ;;;ACxVA,SAAS,kBAAkB;AAC3B;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,MAAM,eAAe;;;ACjBvB,IAAM,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACvB,IAAM,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACxB,IAAM,sBAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAC5B,IAAM,iBAAiB;AACvB,IAAM,iBAAiB;AACvB,IAAM,kBAAkB;AACxB,IAAM,iBAAiB;;;ADyB9B,IAAI,iBAAyB;AAE7B,SAAS,oBAA4B;AACnC,MAAI,mBAAmB,IAAI;AACzB,QAAI;AAEF,YAAM,cAAc,KAAK,QAAQ,SAAS,GAAG,MAAM,cAAc;AACjE,YAAM,MAAM,KAAK,MAAM,aAAa,aAAa,OAAO,CAAC;AACzD,uBAAiB,IAAI,WAAW;AAAA,IAClC,QAAQ;AACN,uBAAiB;AAAA,IACnB;AAAA,EACF;AACA,SAAO;AACT;AAKA,SAAS,cAAsB;AAG7B,QAAM,WAAW,KAAK,QAAQ,IAAI,GAAG,gBAAgB,UAAU,SAAS;AACxE,SAAO;AACT;AAMA,SAAS,iBAAyB;AAChC,QAAM,WAAW,YAAY;AAC7B,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,QAAI;AACF,gBAAU,UAAU,EAAE,WAAW,KAAK,CAAC;AAAA,IACzC,SAAS,OAAO;AACd,YAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACtE,YAAM,IAAI,MAAM,uCAAuC,QAAQ,KAAK,QAAQ,EAAE;AAAA,IAChF;AAAA,EACF;AACA,SAAO;AACT;AAKO,SAAS,gBACd,oBACA,SACQ;AACR,QAAM,OAAO,WAAW,QAAQ;AAGhC,OAAK,OAAO,WAAW,kBAAkB,CAAC;AAAA,CAAI;AAG9C,OAAK,OAAO,YAAY,QAAQ,YAAY,IAAI;AAAA,CAAI;AACpD,OAAK,OAAO,SAAS,QAAQ,SAAS,KAAK;AAAA,CAAI;AAI/C,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,cAAc;AAC1B,OAAK,OAAO,yBAAyB;AACrC,OAAK,OAAO,eAAe;AAC3B,OAAK,OAAO,6BAA6B;AACzC,OAAK,OAAO,mBAAmB;AAC/B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,cAAc;AAC1B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,cAAc;AAC1B,OAAK,OAAO,yBAAyB;AACrC,OAAK,OAAO,eAAe;AAC3B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,cAAc;AAG1B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,kBAAkB;AAG9B,SAAO,KAAK,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACvC;AAeO,SAAS,kBAAkB,UAA8D;AAC9F,QAAM,WAAW,YAAY;AAC7B,QAAM,YAAY,KAAK,UAAU,GAAG,QAAQ,OAAO;AAEnD,MAAI,CAAC,WAAW,SAAS,GAAG;AAC1B,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,UAAU,aAAa,WAAW,OAAO;AAC/C,UAAM,QAAoB,KAAK,MAAM,OAAO;AAI5C,QAAI,MAAM,YAAY,kBAAkB,GAAG;AAEzC,iBAAW,SAAS;AACpB,aAAO;AAAA,IACT;AAGA,UAAM,SAAS,IAAI,WAAW,OAAO,KAAK,MAAM,QAAQ,QAAQ,CAAC;AACjE,WAAO,EAAE,QAAQ,KAAK,MAAM,IAAI;AAAA,EAClC,SAAS,OAAO;AAEd,QAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAAO;AACzD,YAAM,OAAQ,MAA2B;AAGzC,UAAI,SAAS,UAAU;AACrB,eAAO;AAAA,MACT;AAGA,UAAI,SAAS,YAAY,SAAS,SAAS;AACzC,cAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACtE,gBAAQ;AAAA,UACN,+EAA+E,SAAS;AAAA,EAAK,QAAQ;AAAA,QACvG;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAKA,QAAI;AACF,iBAAW,SAAS;AAAA,IACtB,SAAS,cAAc;AAErB,UAAI,gBAAgB,OAAO,iBAAiB,YAAY,UAAU,cAAc;AAC9E,cAAM,OAAQ,aAAkC;AAChD,YAAI,SAAS,YAAY,SAAS,SAAS;AACzC,kBAAQ;AAAA,YACN,gFAAgF,SAAS;AAAA,UAC3F;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAMO,SAAS,iBACd,UACA,QACM;AACN,MAAI;AACF,UAAM,WAAW,eAAe;AAChC,UAAM,YAAY,KAAK,UAAU,GAAG,QAAQ,OAAO;AAEnD,UAAM,QAAoB;AAAA,MACxB,SAAS,kBAAkB;AAAA,MAC3B,WAAW,KAAK,IAAI;AAAA,MACpB,QAAQ,OAAO,KAAK,OAAO,MAAM,EAAE,SAAS,QAAQ;AAAA,MACpD,KAAK,OAAO;AAAA,IACd;AAEA,kBAAc,WAAW,KAAK,UAAU,KAAK,CAAC;AAAA,EAChD,SAAS,OAAO;AAGd,UAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAGtE,QAAI,SAAS,OAAO,UAAU,YAAY,UAAU,OAAO;AACzD,YAAM,OAAQ,MAA2B;AAEzC,UAAI,SAAS,UAAU;AACrB,gBAAQ,KAAK,yDAAyD,QAAQ,EAAE;AAAA,MAClF,WAAW,SAAS,YAAY,SAAS,WAAW,SAAS,SAAS;AACpE,gBAAQ;AAAA,UACN,yFAAyF,QAAQ;AAAA,QACnG;AAAA,MACF,OAAO;AACL,gBAAQ,KAAK,6CAA6C,QAAQ,EAAE;AAAA,MACtE;AAAA,IACF,OAAO;AACL,cAAQ,KAAK,6CAA6C,QAAQ,EAAE;AAAA,IACtE;AAAA,EACF;AACF;AAMO,SAAS,oBAA4B;AAC1C,SAAO,YAAY;AACrB;AAMO,SAAS,iBAYd;AACA,QAAM,UAAU,eAAe;AAC/B,QAAM,YAAY,YAAY;AAC9B,QAAM,kBAAkB,WAAW,SAAS;AAC5C,QAAM,SAAmB,CAAC;AAG1B,MAAI,CAAC,SAAS;AACZ,WAAO,KAAK,6DAA6D;AAAA,EAC3E;AAGA,MAAI,WAAW,CAAC,iBAAiB;AAC/B,WAAO,KAAK,qEAAqE;AAAA,EACnF;AAGA,MAAI,aAAa;AACjB,MAAI,iBAAiB;AACnB,QAAI;AAEF,kBAAY,SAAS;AACrB,mBAAa;AAAA,IACf,SAAS,OAAO;AACd,mBAAa;AACb,aAAO;AAAA,QACL,iDAAiD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,MACzG;AAAA,IACF;AAAA,EACF;AAGA,QAAM,QAAQ,aACV,cAAc,IACd;AAAA,IACE,SAAS;AAAA,IACT,WAAW;AAAA,IACX,aAAa;AAAA,IACb,aAAa;AAAA,EACf;AAEJ,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAKO,SAAS,aAAmB;AACjC,QAAM,WAAW,YAAY;AAC7B,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB;AAAA,EACF;AAEA,QAAM,QAAQ,YAAY,QAAQ;AAClC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,OAAO,GAAG;AAC1B,UAAI;AACF,mBAAW,KAAK,UAAU,IAAI,CAAC;AAAA,MACjC,QAAQ;AAAA,MAAC;AAAA,IACX;AAAA,EACF;AACF;AAKO,SAAS,gBAKd;AACA,QAAM,WAAW,YAAY;AAC7B,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,WAAO,EAAE,SAAS,GAAG,WAAW,GAAG,aAAa,MAAM,aAAa,KAAK;AAAA,EAC1E;AAEA,QAAM,QAAQ,YAAY,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO,CAAC;AACrE,MAAI,YAAY;AAChB,MAAI,cAA6B;AACjC,MAAI,cAA6B;AAEjC,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,SAAS,KAAK,UAAU,IAAI,CAAC;AAC1C,iBAAa,KAAK;AAElB,UAAM,QAAQ,KAAK;AACnB,QAAI,gBAAgB,QAAQ,QAAQ,aAAa;AAC/C,oBAAc;AAAA,IAChB;AACA,QAAI,gBAAgB,QAAQ,QAAQ,aAAa;AAC/C,oBAAc;AAAA,IAChB;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,MAAM,QAAQ,WAAW,aAAa,YAAY;AACtE;AAKO,SAAS,WACd,UAGI,CAAC,GACG;AACR,QAAM,EAAE,aAAa,KAAK,WAAW,IAAI,KAAK,KAAK,KAAK,IAAK,IAAI;AACjE,QAAM,WAAW,YAAY;AAE7B,MAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,YAAY,QAAQ,EAC/B,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO,CAAC,EACjC,IAAI,CAAC,MAAM;AACV,UAAM,OAAO,SAAS,KAAK,UAAU,CAAC,CAAC;AACvC,WAAO,EAAE,MAAM,GAAG,OAAO,KAAK,QAAQ;AAAA,EACxC,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAEnC,QAAM,MAAM,KAAK,IAAI;AACrB,MAAI,UAAU;AAEd,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,MAAM,MAAM,KAAK;AAGvB,QAAI,KAAK,cAAc,MAAM,UAAU;AACrC,UAAI;AACF,mBAAW,KAAK,UAAU,KAAK,IAAI,CAAC;AACpC;AAAA,MACF,QAAQ;AAAA,MAAC;AAAA,IACX;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,iBAA0B;AACxC,SAAO,QAAQ,IAAI,qBAAqB;AAC1C;;;AExZA,YAAY,QAAQ;AACpB,YAAY,UAAU;;;ACiBf,SAAS,gBAAgB,MAAyB;AACvD,QAAM,YAAuB,oBAAI,IAAI;AACrC,YAAU,IAAI,wBAAwB,IAAI;AAC1C,YAAU,IAAI,yBAAyB,cAAc;AACrD,YAAU,IAAI,0BAA0B,eAAe;AACvD,YAAU,IAAI,8BAA8B,mBAAmB;AAC/D,YAAU,IAAI,yBAAyB,cAAc;AACrD,YAAU,IAAI,yBAAyB,cAAc;AACrD,YAAU,IAAI,0BAA0B,eAAe;AACvD,YAAU,IAAI,yBAAyB,cAAc;AACrD,SAAO;AACT;AAOO,SAAS,6BAA6B,WAAsB;AACjE,SAAO;AAAA,IACL,SAAS,MAAc,SAAgC;AAErD,YAAM,eAAe;AAAA;AAAA,QAEnB;AAAA;AAAA,QAEA,UAAU,GAAG,OAAO,IAAI,IAAI,KAAK;AAAA;AAAA,QAEjC,KAAK,WAAW,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI;AAAA,MAC1C;AAEA,iBAAW,OAAO,cAAc;AAC9B,cAAM,UAAU,UAAU,IAAI,GAAG;AACjC,YAAI,OAAO,YAAY,UAAU;AAC/B,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,UAAU,MAAcC,OAA2B,SAAuB;AACxE,YAAM,MAAM,UAAU,GAAG,OAAO,IAAI,IAAI,KAAK;AAC7C,gBAAU,IAAI,KAAKA,KAAI;AAAA,IACzB;AAAA,IACA,UAAUC,UAAiB,SAAkC;AAC3D,YAAM,SAAS,UAAU,GAAG,OAAO,IAAIA,QAAO,KAAKA;AACnD,aAAO,CAAC,GAAG,UAAU,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,MAAM,CAAC;AAAA,IACjE;AAAA,EACF;AACF;AAOO,SAAS,qBAAqB,WAGnC;AAEA,QAAM,SAAS,UAAU,IAAI,aAAa,KAAK,UAAU,IAAI,eAAe;AAC5E,QAAM,MAAM,UAAU,IAAI,YAAY,KAAK,UAAU,IAAI,cAAc;AACvE,SAAO;AAAA,IACL,QAAQ,kBAAkB,aAAa,SAAS;AAAA,IAChD,KAAK,OAAO,QAAQ,WAAW,MAAM;AAAA,EACvC;AACF;;;AD7DA,IAAM,+BAA+B;AAMrC,IAAM,oCAAoC;AAI1C,IAAM,8BAA8B;AAEpC,IAAM,0BAA0B;AAIhC,IAAM,6BAA6B;AAEnC,IAAM,yBAAyB;AA+CxB,SAAS,uBAAuB,YAAyC;AAC9E,QAAM,gBAAgB,aAAa;AACnC,QAAM,oBAAoB,aAAa;AAEvC,MAAI;AACJ,MAAI;AAEJ,MAAI,mBAAmB;AAErB,oBAAgB;AAChB,kBAAc;AAAA,EAChB,WAAW,eAAe;AAExB,oBAAgB;AAChB,kBAAc;AAAA,EAChB,OAAO;AAEL,oBAAgB;AAChB,kBAAc;AAAA,EAChB;AAEA,SAAO;AAAA,IACL;AAAA,IACA,oBAAoB,gBAAgB,6BAA6B;AAAA,IACjE,gBAAgB,gBAAgB,yBAAyB;AAAA,IACzD;AAAA,IACA;AAAA,IACA,aAAa,CAAC;AAAA,EAChB;AACF;AAgBA,SAAS,sBACP,MACA,UACA,SAAS,IACM;AAEf,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,EACT;AAEA,MAAI;AAEF,UAAM,SAAY,eAAiB,UAAK,UAAU,gBAAgB,CAAC;AAGnE,UAAM,YAAiB,UAAK,QAAQ,iBAAiB,MAAM,KAAK;AAGhE,IAAG,iBAAc,WAAW,MAAM,EAAE,MAAM,IAAM,CAAC;AAEjD,WAAO;AAAA,EACT,SAAS,OAAO;AAEd,UAAM,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACtE,YAAQ,KAAK,sDAAsD,QAAQ,KAAK,QAAQ,EAAE;AAC1F,WAAO;AAAA,EACT;AACF;AASO,SAAS,kBACd,SACA,UACU;AACV,QAAM,OAAO;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA,IACA,OAAO,SAAS,kBAAkB;AAAA,IAClC;AAAA,IACA,OAAO,SAAS,cAAc;AAAA,EAChC;AAGA,MAAI,SAAS,aAAa;AACxB,SAAK,KAAK,cAAc,YAAY;AAAA,EACtC;AAGA,MAAI,QAAQ,UAAU;AACpB,QAAI,SAAS,gBAAgB,GAAG;AAC9B,WAAK,KAAK,YAAY;AAAA,IACxB;AACA,SAAK,KAAK,mBAAmB,OAAO,SAAS,aAAa,CAAC;AAC3D,SAAK,KAAK,iBAAiB,OAAO,SAAS,WAAW,CAAC;AAAA,EACzD;AAGA,MAAI,QAAQ,OAAO;AACjB,SAAK,KAAK,WAAW,aAAa;AAAA,EACpC;AAGA,MAAI,CAAC,QAAQ,OAAO;AAClB,SAAK,KAAK,YAAY;AAAA,EACxB;AAEA,SAAO;AACT;AAqBA,eAAsB,8BACpB,MACA,SAC8C;AAE9C,QAAM,YAAY,MAAM,OAAO,oBAAoB;AAGnD,QAAM,kBAAkB,QAAQ,mBAAmB,QAAQ,IAAI;AAK/D,QAAM,YAAY,sBAAsB,MAAM,eAAe;AAG7D,QAAM,YAAY,gBAAgB,IAAI;AAGtC,QAAM,WAAW,uBAAuB,KAAK,MAAM;AAGnD,QAAM,eAAe,kBAAkB,SAAS,QAAQ;AAGxD,QAAM,cAAc,6BAA6B,SAAS;AAG1D,MAAI,eAAe;AACnB,QAAM,eAAe,UAAU,mBAAmB,CAAC,UAA+B;AAChF,oBAAgB,OAAO,UAAU,WAAW,QAAQ,IAAI,YAAY,EAAE,OAAO,KAAK;AAAA,EACpF,CAAC;AAGD,QAAM,EAAE,MAAM,IAAI,MAAM,UAAU,KAAK,cAAc;AAAA,IACnD,GAAG;AAAA,IACH,QAAQ;AAAA,EACV,CAAC;AAGD,MAAI,OAAO;AACT,UAAM,gBAAgB,YAClB;AAAA;AAAA,0BAA+B,SAAS,KACxC;AAEJ,UAAM,IAAI;AAAA,MACR;AAAA,EAAuC,gBAAgB,MAAM,OAAO,GAAG,aAAa;AAAA;AAAA,MAEpF,EAAE,OAAO,iBAAiB;AAAA,MAC1B,EAAE,aAAa;AAAA,IACjB;AAAA,EACF;AAGA,QAAM,SAAS,qBAAqB,SAAS;AAE7C,MAAI,CAAC,OAAO,QAAQ;AAClB,UAAM,oBAAoB,sBAAsB,MAAM,iBAAiB,YAAY;AACnF,mBAAe,gBAAgB;AAC/B,UAAM,QAAQ,CAAC,GAAG,UAAU,KAAK,CAAC,EAAE,KAAK,IAAI;AAE7C,UAAM,gBAAgB,oBAClB;AAAA,0BAA6B,iBAAiB,KAC9C;AAEJ,UAAM,IAAI;AAAA,MACR;AAAA,mBAAiE,YAAY;AAAA,sBAAyB,KAAK,GAAG,aAAa;AAAA;AAAA,MAE3H,EAAE,OAAO,iBAAiB;AAAA,MAC1B,EAAE,cAAc,gBAAgB,MAAM;AAAA,IACxC;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,KAAK,OAAO,OAAO;AAAA,EACrB;AACF;;;AE7RO,SAAS,oBACd,aACA,cACA,YACQ;AACR,QAAM,gBAAgB,KAAK,WAAW,SAAS,EAAE,EAAE,SAAS,IAAI,GAAG,CAAC;AAGpE,QAAM,iBAAiB,YAAY,OAChC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,EAC3B,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,MAAM,CAAC;AACrC,QAAM,kBAAkB,aAAa,OAClC,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,EAC3B,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,MAAM,CAAC;AAErC,SAAO;AAAA,+CACsC,aAAa;AAAA,uBACrC,cAAc;AAAA,wBACb,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sBAejB,aAAa;AAAA,2BACR,cAAc;AAAA,4BACb,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA8yB3C;;;AC71BA,SAAuB,YAAY;AAc5B,SAAS,uBAAuB,QAAyB;AAC9D,QAAM,gBAAgB,wBAAwB,QAAQ,MAAM;AAE5D,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBAUU,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAmChC;AASA,SAAS,wBAAwB,QAAiB,UAA0B;AAC1E,QAAM,OAAQ,OAAe,IAAI;AAEjC,UAAQ,MAAM;AAAA,IACZ,KAAK,UAAU;AACb,aAAO,eAAe,QAAQ,QAAQ;AAAA,IACxC;AAAA,IAEA,KAAK,UAAU;AACb,aAAO,kBAAkB,UAAU,UAAU,iBAAiB;AAAA,IAChE;AAAA,IAEA,KAAK,UAAU;AACb,aAAO,kBAAkB,UAAU,UAAU,iBAAiB;AAAA,IAChE;AAAA,IAEA,KAAK,WAAW;AACd,aAAO,GAAG,kBAAkB,UAAU,UAAU,kBAAkB,CAAC;AAAA,UAC/D,QAAQ,qBAAqB,QAAQ,kCAAkC,QAAQ;AAAA,wBACjE,QAAQ,0CAA0C,QAAQ;AAAA;AAAA;AAAA,IAG9E;AAAA,IAEA,KAAK,WAAW;AACd,aAAO,kBAAkB,UAAU,WAAW,kBAAkB;AAAA,IAClE;AAAA,IAEA,KAAK,SAAS;AACZ,aAAO,cAAc,QAAQ,QAAQ;AAAA,IACvC;AAAA,IAEA,KAAK,SAAS;AACZ,aAAO,cAAc,QAAQ,QAAQ;AAAA,IACvC;AAAA,IAEA,KAAK,WAAW;AACd,YAAM,eAAgB,OAAe;AACrC,YAAM,aACJ,OAAO,iBAAiB,WAAW,IAAI,YAAY,MAAM,OAAO,YAAY;AAC9E,YAAM,WAAW,4BAA4B,OAAO,UAAU;AAC9D,aAAO,GAAG,kBAAkB,UAAU,OAAO,cAAc,aAAa,CAAC;AAAA,UACrE,QAAQ,qBAAqB,QAAQ,gBAAgB,QAAQ,QAAQ,UAAU;AAAA,wBACjE,QAAQ,gBAAgB,QAAQ,aAAa,QAAQ;AAAA;AAAA;AAAA,IAGzE;AAAA,IAEA;AAEE,aAAO;AAAA,EACX;AACF;AAKA,SAAS,eAAe,QAAiB,UAA0B;AACjE,QAAM,aAAc,OAAe,cAAc,CAAC;AAClD,QAAM,WAAW,IAAI,IAAK,OAAe,YAAY,CAAC,CAAC;AAEvD,MAAI,OAAO;AAGX,SAAO,IAAI,QAAQ,gBAAgB,QAAQ,4BAA4B,QAAQ,kCAAkC,QAAQ,kBAAkB,QAAQ,yCAAyC,QAAQ;AAGpM,aAAW,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC1D,UAAM,WAAW,GAAG,QAAQ,IAAI,GAAG;AACnC,UAAM,aAAa,SAAS,IAAI,GAAG;AAGnC,QAAI,YAAY;AACd,cAAQ;AAAA,UACJ,QAAQ,qBAAqB,QAAQ;AAAA,wBACvB,QAAQ;AAAA;AAAA;AAAA,IAG5B,OAAO;AAEL,cAAQ;AAAA,UACJ,QAAQ,qBAAqB,QAAQ;AAAA;AAAA,cAEjC,wBAAwB,YAAuB,QAAQ,CAAC;AAAA;AAAA,IAElE;AAGA,QAAI,YAAY;AACd,cAAQ;AAAA,UACJ,QAAQ,qBAAqB,QAAQ;AAAA,cACjC,wBAAwB,YAAuB,QAAQ,CAAC;AAAA;AAAA;AAAA,IAGlE;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,cAAc,QAAiB,UAA0B;AAChE,QAAM,cAAe,OAAe;AAGpC,QAAM,aAAa,iBAAiB,QAAQ;AAG5C,MAAI,aAAa;AACf,UAAM,oBAAoB;AAAA,QACtB,QAAQ;AAAA,4BACY,QAAQ;AAAA,gCACJ,wBAAwB,aAAwB,MAAM,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQnF,WAAO,IAAI,UAAU,MAAM,iBAAiB,gBAAgB,QAAQ,wCAAwC,QAAQ;AAAA,EACtH;AAEA,SAAO,GAAG,UAAU,qBAAqB,QAAQ,wCAAwC,QAAQ;AACnG;AAKA,SAAS,cAAc,QAAiB,UAA0B;AAChE,QAAM,QAAS,OAAe,SAAS,CAAC;AACxC,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO;AAAA,EACT;AAGA,QAAM,aAAa,MAAM,IAAI,CAAC,WAAoB,wBAAwB,QAAQ,QAAQ,CAAC;AAG3F,SAAO,IAAI,QAAQ,qBAAqB,QAAQ;AAAA,QAC1C,WAAW,KAAK,mBAAmB,CAAC;AAAA;AAAA,oBAExB,QAAQ,+DAA+D,QAAQ;AACnG;AAKA,SAAS,kBAAkB,UAAkB,cAAsB,SAAyB;AAC1F,SAAO,IAAI,QAAQ,qBAAqB,QAAQ,uBAAuB,QAAQ,SAAS,YAAY;AAAA,kBACpF,QAAQ,gBAAgB,OAAO,aAAa,QAAQ;AAAA;AAEtE;;;AC1NO,SAAS,wBAAwB,MAGtC;AAMA,QAAM,cAAc,KACjB,QAAQ,mCAAmC,6BAA6B,EACxE,QAAQ,sCAAsC,gCAAgC,EAC9E,QAAQ,+BAA+B,mBAAmB,EAC1D,QAAQ,oCAAoC,wBAAwB,EACpE,QAAQ,qCAAqC,yBAAyB,EACtE,QAAQ,kCAAkC,4BAA4B,EACtE,QAAQ,iCAAiC,2BAA2B,EACpE,QAAQ,iCAAiC,2BAA2B,EACpE,QAAQ,gCAAgC,0BAA0B,EAClE,QAAQ,yCAAyC,mCAAmC;AAGvF,QAAM,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoBnB,QAAM,SAAyE,CAAC;AAEhF,QAAM,UAAU,IAAI;AAAA,IAClB;AAAA,IACA,aACE,cACA;AAAA;AAAA;AAAA;AAAA,EAIJ;AAEA,UAAQ,MAAM;AAEd,MAAI,CAAC,OAAO,gBAAgB,CAAC,OAAO,iBAAiB;AACnD,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA,EAAE,OAAO,cAAc;AAAA,IACzB;AAAA,EACF;AAOA,QAAM,aAAa,OAAO;AAC1B,QAAM,qBAAqB,MAAM;AACjC,QAAM,kBAAkB,MAAM;AAE9B,QAAM,iBAA4B,CAACC,OAAM,WAAW;AAElD,QAAI,OAAO,OAAO,aAAa,iBAAiB;AAC9C,YAAM,cAAc,KAAK,MAAM,kBAAkB,OAAO,OAAO,cAAc,KAAK;AAClF,aAAO,KAAK,WAAW;AAAA,IACzB;AAGA,QAAI,aAAa;AACjB,UAAM,WAAW,CAAC,SAAyB;AACzC,YAAM,MAAM;AACZ,oBAAc;AAEd,UAAI,aAAa,OAAO,OAAO,YAAY;AACzC,cAAM,cAAc,KAAK,MAAM,aAAa,OAAO,OAAO,cAAc,KAAK;AAC7E,eAAO,KAAK,WAAW;AAAA,MACzB;AACA,aAAO;AAAA,IACT;AACA,WAAO,WAAWA,OAAM,QAAQ,QAAQ;AAAA,EAC1C;AAEA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,WAAW,OAAO;AAAA,EACpB;AACF;AAGA,IAAI,qBAA8B;AAQlC,eAAsB,wBAAwB,MAAmC;AAS/E,MAAI,cAAc;AAGlB,QAAM,cAAc;AACpB,gBAAc,YAAY,QAAQ,aAAa,EAAE;AAIjD,gBAAc,YAAY,QAAQ,wCAAwC,IAAI;AAI9E,gBAAc,YAAY,QAAQ,qDAAqD,KAAK;AAI5F,gBAAc,YAAY,QAAQ,yBAAyB,EAAE;AAC7D,gBAAc,YAAY,QAAQ,cAAc,EAAE;AAIlD,gBAAc,YAAY,QAAQ,mBAAmB,OAAO;AAG5D,gBAAc,YAAY,QAAQ,gBAAgB,EAAE;AAGpD,gBAAc,YACX,QAAQ,oCAAoC,wBAAwB,EACpE,QAAQ,mCAAmC,uBAAuB,EAClE,QAAQ,iCAAiC,qBAAqB;AAGjE,MAAI,CAAC,oBAAoB;AACvB,UAAMC,UAAS,MAAM,OAAO,4BAA4B;AACxD,yBAAqBA,QAAO;AAAA,EAC9B;AACA,QAAM,eAAe;AAGrB,QAAM,SAAc,CAAC;AAErB,QAAM,UAAU,IAAI;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,QACI,WAAW;AAAA;AAAA;AAAA,EAGjB;AAEA,UAAQ,cAAc,MAAM;AAE5B,MAAI,CAAC,OAAO,eAAe;AACzB,UAAM,IAAI;AAAA,MACR;AAAA;AAAA,MAEA,EAAE,OAAO,iBAAiB;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO,OAAO;AAChB;;;ACxLA,IAAM,uBAAuB;AAY7B,IAAM,2BAA2B;AAYjC,IAAM,4BAA4B;AAK3B,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YACE,SACgB,OAAe,IACf,SAChB;AACA,UAAM,OAAO;AAHG;AACA;AAGhB,SAAK,OAAO;AAAA,EACd;AACF;AAiBO,SAAS,aAAa,QAA4B,UAAwB;AAC/E,QAAMC,WAAU,OAAO,OAAO;AAC9B,MAAI,YAAYA,UAAS;AACvB;AAAA,EACF;AAGA,QAAM,cAAc,KAAK,MAAM,WAAWA,YAAW,oBAAoB;AAGzE,MAAI;AACF,UAAM,WAAW,OAAO,KAAK,WAAW;AACxC,QAAI,WAAW,GAAG;AAChB,YAAM,IAAI,aAAa,4BAA4B,WAAW,UAAU,CAAC;AAAA,IAC3E;AAAA,EACF,SAAS,OAAO;AAEd,QAAI,iBAAiB,cAAc;AACjC,YAAM;AAAA,IACR;AACA,UAAM,IAAI;AAAA,MACR,qCAAqC,QAAQ,mBAChCA,QAAO,gBAAgB,WAAW,mBAC5C,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,MACxD;AAAA;AAAA,IACF;AAAA,EACF;AACF;AAiDO,IAAM,mBAAN,MAAuB;AAAA,EAQ5B,YAAoB,SAAkC;AAAlC;AAKlB,UAAM,SAAS,IAAI;AAAA,MACjB,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,IACf;AACA,SAAK,SAAS,IAAI,YAAY,OAAO,MAAgC;AAErE,SAAK,UAAU,QAAQ;AACvB,SAAK,YAAY,QAAQ;AACzB,SAAK,WAAW,QAAQ;AAAA,EAC1B;AAAA,EAtBQ,WAAwC;AAAA,EACxC,SAAoC;AAAA,EACpC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBR,MAAc,aAA4B;AACxC,QAAI,KAAK,aAAa,MAAM;AAC1B;AAAA,IACF;AAKA,SAAK,WAAW,MAAM,YAAY,YAAY,KAAK,QAAQ;AAAA,MACzD,KAAK;AAAA,QACH,OAAO,MAAM;AACX,gBAAM,IAAI,aAAa,mBAAmB;AAAA,QAC5C;AAAA,QACA,MAAM,MAAM;AACV,iBAAO,KAAK,IAAI;AAAA,QAClB;AAAA,QACA,YAAY,MAAM,KAAK,IAAI;AAAA,MAC7B;AAAA;AAAA,MAEA,OAAO,CAAC;AAAA,IACV,CAAC;AAGD,SAAK,SAAS,KAAK,SAAS,QAAQ;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,SAAmE,OAAsB;AAC7F,UAAM,KAAK,WAAW;AAEtB,QAAI,CAAC,KAAK,YAAY,CAAC,KAAK,QAAQ;AAClC,YAAM,IAAI,aAAa,+BAA+B;AAAA,IACxD;AAGA,UAAM,SAAS,KAAK;AACpB,UAAM,WAAW,KAAK;AAGtB,QAAI,KAAK,UAAU;AACjB,UAAI;AACF,aAAK,SAAS,KAAK;AAAA,MACrB,SAAS,OAAO;AACd,YAAI,iBAAiB,OAAO;AAC1B,gBAAM,IAAI,aAAa,4BAA4B,MAAM,OAAO,IAAI,GAAG,EAAE,MAAM,CAAC;AAAA,QAClF;AACA,cAAM;AAAA,MACR;AAAA,IACF;AAIA,UAAM,mBAAmB,SAAS,QAAQ;AAC1C,QAAI,kBAAkB;AACpB,uBAAiB;AAAA,IACnB;AAEA,QAAI;AAEF,YAAM,WAAmB,KAAK,QAAQ,OAAkC,MAAM;AAG9E,UAAI,WAAW,2BAA2B;AACxC,cAAM,IAAI;AAAA,UACR,0BAA0B,QAAQ,gBAAgB,yBAAyB;AAAA,QAC7E;AAAA,MACF;AAGA,YAAM,cAAc,SAAS,QAAQ;AACrC,UAAI,aAAa;AACf,oBAAY;AAAA,MACd;AAGA,YAAM,aAAa,SAAS,QAAQ;AACpC,UAAI,CAAC,YAAY;AACf,cAAM,IAAI,aAAa,iDAAiD;AAAA,MAC1E;AAEA,YAAM,YAAoB,WAAW,QAAQ;AAG7C,YAAM,iBAAiB,SAAS,QAAQ;AACxC,UAAI,gBAAgB;AAClB,cAAM,YAAY,eAAe;AACjC,YAAI,cAAc,GAAG;AACnB,gBAAM,IAAI,aAAa,KAAK,gBAAgB,SAAS,GAAG,WAAW,EAAE,OAAO,UAAU,CAAC;AAAA,QACzF;AAAA,MACF;AAKA,UAAI,YAAY,OAAO,OAAO,YAAY;AAAA,MAG1C;AAGA,YAAM,SAAS,KAAK,UAAU,WAAW,MAAM;AAE/C,aAAO;AAAA,IACT,UAAE;AAGA,UAAI,kBAAkB;AACpB,yBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,gBAAgB,WAA2B;AAIjD,UAAM,gBAAwC;AAAA,MAC5C,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAEA,WAAO,cAAc,SAAS,KAAK,uBAAuB,SAAS;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAAuC;AACrC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAA2C;AACzC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAgB;AACd,SAAK,WAAW;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,iBAAqE;AAGnE,UAAM,eAAe,KAAK,QAAQ,OAAO,cAAc;AACvD,WAAO;AAAA,MACL,SAAS;AAAA,MACT,UAAU,KAAK,QAAQ,sBAAsB,4BAA4B;AAAA,MACzE,MAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,eAAe,UAA0B;AACvC,QAAI,CAAC,KAAK,QAAQ;AAChB,YAAM,IAAI,aAAa,kDAAkD,CAAC;AAAA,IAC5E;AAGA,QAAI;AACF,mBAAa,KAAK,QAAQ,QAAQ;AAAA,IACpC,SAAS,OAAO;AACd,YAAM,IAAI;AAAA,QACR,6BAA6B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,QACnF;AAAA;AAAA,MACF;AAAA,IACF;AAGA,WAAO;AAAA,EACT;AACF;AAwBA,eAAsB,uBACpB,QACA,UAC2B;AAE3B,QAAM,EAAE,SAAS,UAAU,IAAI,wBAAwB,OAAO,WAAW;AAGzE,QAAM,YAAY,YAAa,MAAM,wBAAwB,OAAO,cAAc;AAElF,SAAO,IAAI,iBAAiB;AAAA,IAC1B,MAAM,OAAO;AAAA,IACb,YAAY,OAAO;AAAA,IACnB;AAAA,IACA;AAAA,IACA,UAAU;AAAA,EACZ,CAAC;AACH;;;ACxZA,eAAsB,sBACpB,MACA,SAC8C;AAE9C,MAAI,eAAe,GAAG;AACpB,UAAM,WAAW,gBAAgB,MAAM,OAAO;AAC9C,UAAM,SAAS,kBAAkB,QAAQ;AACzC,QAAI,QAAQ;AACV,aAAO;AAAA,IACT;AAGA,UAAM,SAAS,MAAM,8BAA8B,MAAM,OAAO;AAChE,qBAAiB,UAAU,MAAM;AACjC,WAAO;AAAA,EACT;AAGA,SAAO,8BAA8B,MAAM,OAAO;AACpD;;;ACvDA,SAAuB,QAAAC,aAAY;AAEnC,SAAS,cAAAC,mBAAkB;AAiCpB,SAAS,cAAc,QAAkC;AAC9D,QAAM,SAA0B;AAAA,IAC9B,QAAQ,CAAC;AAAA,EACX;AAGA,QAAM,SAAwB,cAAc,QAAQ,EAAE;AAGtD,MAAI,gBAAgB;AAGpB,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,aAAa,MAAM,MAAM;AAC1C,QAAI,SAAS,SAAS;AACpB,aAAO,OAAO,KAAK;AAAA,QACjB,MAAM,MAAM;AAAA,QACZ,UAAU,MAAM;AAAA,QAChB,MAAM,SAAS;AAAA,QACf,QAAQ;AAAA,QACR,MAAM,SAAS;AAAA,MACjB,CAAC;AACD,uBAAiB,SAAS;AAAA,IAC5B;AAAA,EACF;AAIA,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,aAAa,MAAM,MAAM;AAC1C,QAAI,CAAC,SAAS,SAAS;AACrB,aAAO,OAAO,KAAK;AAAA,QACjB,MAAM,MAAM;AAAA,QACZ,UAAU,MAAM;AAAA,QAChB,MAAM,SAAS;AAAA,QACf,QAAQ;AAAA,QACR,MAAM;AAAA;AAAA,MACR,CAAC;AACD,uBAAiB;AAAA,IACnB;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,cAAc,QAAiBC,OAA6B;AACnE,QAAM,SAAwB,CAAC;AAE/B,QAAM,OAAQ,OAAeF,KAAI;AAEjC,MAAI,SAAS,UAAU;AACrB,UAAM,aAAc,OAAe,cAAc,CAAC;AAClD,eAAW,CAAC,MAAM,WAAW,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC5D,YAAM,YAAYE,QAAO,GAAGA,KAAI,IAAI,IAAI,KAAK;AAC7C,YAAM,WAAWA,QAAO,GAAGA,KAAI,IAAI,IAAI,KAAK;AAE5C,YAAM,eAAe,cAAc,aAAwB,SAAS;AACpE,UAAI,aAAa,SAAS,GAAG;AAC3B,eAAO,KAAK,GAAG,YAAY;AAAA,MAC7B,OAAO;AACL,eAAO,KAAK;AAAA,UACV,QAAQ;AAAA,UACR,MAAM;AAAA,UACN;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,SAAO;AACT;AAKA,SAAS,aAAa,QAIpB;AACA,QAAM,OAAQ,OAAeF,KAAI;AAEjC,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,IAEjD,KAAK;AACH,aAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,IAEjD,KAAK;AAGH,aAAO,EAAE,SAAS,MAAM,QAAQ,QAAQ,MAAM,EAAE;AAAA,IAElD,KAAK;AACH,aAAO,EAAE,SAAS,OAAO,QAAQ,UAAU,MAAM,GAAG;AAAA,IAEtD,KAAK;AACH,aAAO,EAAE,SAAS,OAAO,QAAQ,SAAS,MAAM,GAAG;AAAA,IAErD,KAAK;AAEH,aAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,IAEjD,KAAK;AAEH,YAAM,QAAS,OAAe;AAC9B,UAAI,MAAM,QAAQ,KAAK,KAAK,MAAM,SAAS,GAAG;AAC5C,cAAM,YAAa,MAAM,CAAC,EAAUA,KAAI;AACxC,YAAI,cAAc,WAAW;AAC3B,iBAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,MAAM,EAAE;AAAA,QACjD;AAAA,MACF;AAGA,aAAO,EAAE,SAAS,OAAO,QAAQ,UAAU,MAAM,GAAG;AAAA,IAEtD;AAEE,aAAO,EAAE,SAAS,OAAO,QAAQ,UAAU,MAAM,GAAG;AAAA,EACxD;AACF;AAcO,SAAS,kBAAkB,aAAsB,cAA+B;AAErF,QAAM,YAAY,KAAK;AAAA,IACrB;AAAA,MACE,OAAO,mBAAmB,WAAW;AAAA,MACrC,QAAQ,mBAAmB,YAAY;AAAA,IACzC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAGA,QAAM,OAAOC,YAAW,QAAQ,EAAE,OAAO,SAAS,EAAE,OAAO;AAG3D,SAAO,KAAK,gBAAgB,CAAC;AAC/B;AAKA,SAAS,mBAAmB,QAA0B;AACpD,QAAM,OAAQ,OAAeD,KAAI;AAEjC,MAAI,SAAS,UAAU;AACrB,UAAM,aAAc,OAAe,cAAc,CAAC;AAClD,UAAM,YAAqC,CAAC;AAC5C,UAAM,OAAO,OAAO,KAAK,UAAU,EAAE,KAAK;AAE1C,eAAW,OAAO,MAAM;AACtB,gBAAU,GAAG,IAAI,mBAAmB,WAAW,GAAG,CAAC;AAAA,IACrD;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,WAAY,OAAe,YAAY,CAAC,GAAG,KAAK;AAAA,IAClD;AAAA,EACF;AAEA,MAAI,SAAS,SAAS;AACpB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,mBAAoB,OAAe,KAAK;AAAA,IACjD;AAAA,EACF;AAEA,MAAI,SAAS,QAAQ;AACnB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAU,OAAe,SAAS,CAAC,GAAG,IAAI,CAAC,QAAkB,IAAY,KAAK,EAAE,KAAK;AAAA,IACvF;AAAA,EACF;AAEA,MAAI,SAAS,WAAW;AACtB,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAQ,OAAe;AAAA,IACzB;AAAA,EACF;AAGA,QAAM,iBAAyC;AAAA,IAC7C,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,SAAS;AAAA,EACX;AAEA,SAAO,eAAe,IAAI,KAAK;AACjC;;;ACvOA,SAAS,gBAAAG,qBAAoB;AAC7B,OAAOC,WAAU;;;ACsIV,SAAS,gBAAgB,MAA4C;AAC1E,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,gBAAgB,MAA4C;AAC1E,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,iBAAiB,MAA6C;AAC5E,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,cAAc,MAA0C;AACtE,SAAO,KAAK,SAAS;AACvB;AAcO,SAAS,WAAW,MAAuC;AAChE,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,UAAU,MAAsC;AAC9D,SAAO,KAAK,SAAS;AACvB;AAEO,SAAS,YAAY,MAAwC;AAClE,SAAO,KAAK,SAAS;AACvB;;;AC1LA,SAAS,aAAa,WAAW,aAA0B;AAK3D,IAAM,aAAa,YAAY;AAAA,EAC7B,MAAM;AAAA,EACN,SAAS;AAAA,EACT,OAAO,MAAM;AACf,CAAC;AAED,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,OAAO,CAAC;AAC9D,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,KAAK,CAAC;AAEtD,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,KAAK,CAAC;AACpD,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,KAAK,CAAC;AAC1D,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,MAAM,CAAC;AACzD,IAAM,UAAU,YAAY,EAAE,MAAM,WAAW,SAAS,MAAM,CAAC;AAC/D,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AACxD,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AACxD,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,IAAI,CAAC;AACnD,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,IAAI,CAAC;AAEnD,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAC5D,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAC1D,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,IAAI,CAAC;AAK3D,IAAM,aAAa,YAAY,EAAE,MAAM,cAAc,SAAS,gBAAgB,CAAC;AAE/E,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,OAAO,YAAY,WAAW,CAAC;AAC/E,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,MAAM,YAAY,WAAW,CAAC;AAC5E,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,OAAO,YAAY,WAAW,CAAC;AAC/E,IAAM,KAAK,YAAY,EAAE,MAAM,MAAM,SAAS,MAAM,YAAY,WAAW,CAAC;AAE5E,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,QAAQ,YAAY,WAAW,CAAC;AAClF,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,SAAS,YAAY,WAAW,CAAC;AACrF,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,QAAQ,YAAY,WAAW,CAAC;AAElF,IAAM,gBAAgB,YAAY;AAAA,EAChC,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,IAAM,gBAAgB,YAAY;AAAA,EAChC,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAMD,IAAM,eAAe,YAAY;AAAA,EAC/B,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AACD,IAAM,iBAAiB,YAAY;AAAA,EACjC,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AACD,IAAM,eAAe,YAAY;AAAA,EAC/B,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,IAAM,gBAAgB,YAAY;AAAA,EAChC,MAAM;AAAA,EACN,SAAS;AACX,CAAC;AAED,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,IAAI,CAAC;AAGvD,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,MAAM,YAAY,WAAW,CAAC;AAGpF,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AACxD,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,IAAI,CAAC;AACzD,IAAM,OAAO,YAAY,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AACxD,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,KAAK,CAAC;AACtD,IAAM,MAAM,YAAY,EAAE,MAAM,OAAO,SAAS,IAAI,CAAC;AACrD,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,KAAK,CAAC;AAE1D,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAC5D,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAC5D,IAAM,WAAW,YAAY,EAAE,MAAM,YAAY,SAAS,KAAK,CAAC;AAChE,IAAM,WAAW,YAAY,EAAE,MAAM,YAAY,SAAS,KAAK,CAAC;AAEhE,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAC5D,IAAM,SAAS,YAAY,EAAE,MAAM,UAAU,SAAS,KAAK,CAAC;AAE5D,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,IAAI,CAAC;AACzD,IAAM,WAAW,YAAY,EAAE,MAAM,YAAY,SAAS,MAAM,YAAY,WAAW,CAAC;AACxF,IAAM,mBAAmB,YAAY,EAAE,MAAM,oBAAoB,SAAS,OAAO,CAAC;AAClF,IAAM,QAAQ,YAAY,EAAE,MAAM,SAAS,SAAS,IAAI,CAAC;AAEzD,IAAM,YAAY;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAgBA,IAAM,sBAAN,cAAkC,UAAU;AAAA,EAC1C,cAAc;AACZ,UAAM,SAAS;AACf,SAAK,oBAAoB;AAAA,EAC3B;AAAA;AAAA,EAGA,aAAa,KAAK,KAAK,cAAc,MAAM;AACzC,SAAK,QAAQ,KAAK,0BAA0B,EAAE,OAAO,YAAY,CAAC;AAClE,SAAK,OAAO,MAAM;AAChB,WAAK,QAAQ,QAAQ;AACrB,WAAK,SAAS,KAAK,YAAY,EAAE,OAAO,aAAa,CAAC;AACtD,WAAK,QAAQ,KAAK;AAClB,WAAK,SAAS,KAAK,YAAY,EAAE,OAAO,YAAY,CAAC;AAAA,IACvD,CAAC;AAAA,EACH,CAAC;AAAA,EAED,2BAA2B,KAAK,KAAK,4BAA4B,MAAM;AACrE,SAAK,QAAQ,KAAK,cAAc,EAAE,OAAO,MAAM,CAAC;AAChD,SAAK,KAAK,MAAM;AACd,WAAK,QAAQ,gBAAgB;AAC7B,WAAK,SAAS,KAAK,cAAc,EAAE,OAAO,MAAM,CAAC;AAAA,IACnD,CAAC;AAAA,EACH,CAAC;AAAA,EAED,eAAe,KAAK,KAAK,gBAAgB,MAAM;AAC7C,SAAK,QAAQ,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;AACjD,SAAK,KAAK,MAAM;AACd,WAAK,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE,GAAG,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE,CAAC,CAAC;AAC5E,WAAK,SAAS,KAAK,eAAe,EAAE,OAAO,MAAM,CAAC;AAAA,IACpD,CAAC;AAAA,EACH,CAAC;AAAA,EAED,gBAAgB,KAAK,KAAK,iBAAiB,MAAM;AAC/C,SAAK,QAAQ,KAAK,sBAAsB,EAAE,OAAO,MAAM,CAAC;AACxD,SAAK,KAAK,MAAM;AACd,WAAK,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,QAAQ,GAAG,EAAE,GAAG,EAAE,KAAK,MAAM,KAAK,QAAQ,MAAM,EAAE,CAAC,CAAC;AAC/E,WAAK,SAAS,KAAK,sBAAsB,EAAE,OAAO,MAAM,CAAC;AAAA,IAC3D,CAAC;AAAA,EACH,CAAC;AAAA,EAED,uBAAuB,KAAK,KAAK,wBAAwB,MAAM;AAC7D,SAAK,QAAQ,KAAK,oBAAoB,EAAE,OAAO,MAAM,CAAC;AACtD,SAAK,OAAO,MAAM;AAChB,WAAK,GAAG;AAAA,QACN,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE;AAAA,QAC9B,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,EAAE;AAAA,QACjC,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE;AAAA,QAC9B,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE;AAAA,QAC9B,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,QAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,QAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,EAAE,EAAE;AAAA,QAC9B;AAAA,UACE,KAAK,MAAM;AACT,iBAAK,QAAQ,GAAG;AAChB,iBAAK,SAAS,EAAE;AAAA,UAClB;AAAA,QACF;AAAA;AAAA,MACF,CAAC;AACD,WAAK,SAAS,KAAK,oBAAoB,EAAE,OAAO,MAAM,CAAC;AAAA,IACzD,CAAC;AAAA,EACH,CAAC;AAAA,EAED,qBAAqB,KAAK,KAAK,sBAAsB,MAAM;AACzD,SAAK,QAAQ,KAAK,0BAA0B,EAAE,OAAO,MAAM,CAAC;AAC5D,SAAK,KAAK,MAAM;AACd,WAAK,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE,GAAG,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,EAAE,CAAC,CAAC;AAC/E,WAAK,SAAS,KAAK,0BAA0B,EAAE,OAAO,MAAM,CAAC;AAAA,IAC/D,CAAC;AAAA,EACH,CAAC;AAAA,EAED,2BAA2B,KAAK,KAAK,4BAA4B,MAAM;AACrE,SAAK,QAAQ,KAAK,iBAAiB,EAAE,OAAO,MAAM,CAAC;AACnD,SAAK,KAAK,MAAM;AACd,WAAK,GAAG;AAAA,QACN,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,QAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,GAAG,EAAE;AAAA,QAC/B,EAAE,KAAK,MAAM,KAAK,QAAQ,GAAG,EAAE;AAAA,MACjC,CAAC;AACD,WAAK,SAAS,KAAK,iBAAiB,EAAE,OAAO,MAAM,CAAC;AAAA,IACtD,CAAC;AAAA,EACH,CAAC;AAAA;AAAA;AAAA;AAAA,EAKD,kBAAkB,KAAK,KAAK,mBAAmB,MAAM;AACnD,SAAK,QAAQ,KAAK,iBAAiB,EAAE,OAAO,OAAO,CAAC;AACpD,SAAK,OAAO,MAAM;AAChB,WAAK,QAAQ,KAAK;AAClB,WAAK,QAAQ,KAAK,iBAAiB,EAAE,OAAO,WAAW,CAAC;AAAA,IAC1D,CAAC;AAAA,EACH,CAAC;AAAA,EAED,kBAAkB,KAAK,KAAK,mBAAmB,MAAM;AACnD,SAAK,GAAG;AAAA,MACN;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,GAAG;AAChB,eAAK,QAAQ,KAAK,iBAAiB,EAAE,OAAO,UAAU,CAAC;AAAA,QACzD;AAAA,MACF;AAAA,MACA;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,MAAM;AACnB,eAAK,SAAS,KAAK,iBAAiB,EAAE,OAAO,UAAU,CAAC;AAAA,QAC1D;AAAA,MACF;AAAA,MACA;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,KAAK;AAClB,eAAK,SAAS,KAAK,iBAAiB,EAAE,OAAO,UAAU,CAAC;AAAA,QAC1D;AAAA,MACF;AAAA,MACA,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,iBAAiB,EAAE;AAAA,IACpD,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,oBAAoB,KAAK,KAAK,qBAAqB,MAAM;AACvD,SAAK,QAAQ,KAAK,iBAAiB;AACnC,SAAK,KAAK,MAAM;AACd,WAAK,GAAG;AAAA,QACN;AAAA,UACE,KAAK,MAAM;AACT,iBAAK,QAAQ,GAAG;AAChB,iBAAK,QAAQ,YAAY,EAAE,OAAO,WAAW,CAAC;AAAA,UAChD;AAAA,QACF;AAAA,QACA;AAAA,UACE,KAAK,MAAM;AACT,iBAAK,QAAQ,QAAQ;AACrB,iBAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,QAAQ,CAAC;AAChD,iBAAK,QAAQ,QAAQ;AAAA,UACvB;AAAA,QACF;AAAA,QACA;AAAA,UACE,KAAK,MAAM;AACT,iBAAK,QAAQ,MAAM;AACnB,iBAAK,OAAO,MAAM,KAAK,QAAQ,KAAK,YAAY,CAAC;AACjD,iBAAK,QAAQ,MAAM;AAAA,UACrB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;AAAA,EAED,oBAAoB,KAAK,KAAK,qBAAqB,MAAM;AACvD,SAAK,GAAG;AAAA,MACN,EAAE,KAAK,MAAM,KAAK,QAAQ,aAAa,EAAE;AAAA,MACzC,EAAE,KAAK,MAAM,KAAK,QAAQ,aAAa,EAAE;AAAA,MACzC,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,eAAe,EAAE;AAAA,MAChD,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,MAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,EAAE;AAAA,MACjC,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA,MAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,IAAI,EAAE;AAAA;AAAA,MAChC,EAAE,KAAK,MAAM,KAAK,QAAQ,MAAM,EAAE;AAAA;AAAA,MAClC,EAAE,KAAK,MAAM,KAAK,QAAQ,UAAU,EAAE;AAAA;AAAA,MAEtC;AAAA,QACE,MAAM,MAAM,KAAK,oBAAoB;AAAA,QACrC,KAAK,MAAM,KAAK,QAAQ,KAAK,sBAAsB;AAAA,MACrD;AAAA;AAAA,MAEA;AAAA,QACE,MAAM,MAAM,KAAK,qBAAqB;AAAA,QACtC,KAAK,MAAM,KAAK,QAAQ,KAAK,uBAAuB;AAAA,MACtD;AAAA,MACA;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,MAAM;AACnB,eAAK,QAAQ,KAAK,UAAU;AAC5B,eAAK,QAAQ,MAAM;AAAA,QACrB;AAAA,MACF;AAAA;AAAA,MAEA;AAAA,QACE,MAAM,MAAM,KAAK,gBAAgB;AAAA,QACjC,KAAK,MAAM,KAAK,QAAQ,KAAK,kBAAkB;AAAA,MACjD;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,kBAAkB,KAAK,KAAK,mBAAmB,MAAM;AACnD,SAAK,GAAG;AAAA;AAAA,MAEN,EAAE,KAAK,MAAM,KAAK,QAAQ,aAAa,EAAE;AAAA;AAAA,MAEzC;AAAA,QACE,KAAK,MAAM;AACT,eAAK,QAAQ,YAAY;AACzB,eAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,OAAO,CAAC;AAC/C,eAAK,KAAK,MAAM;AACd,iBAAK,QAAQ,cAAc;AAC3B,iBAAK,SAAS,KAAK,YAAY,EAAE,OAAO,OAAO,CAAC;AAAA,UAClD,CAAC;AACD,eAAK,QAAQ,YAAY;AAAA,QAC3B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,qBAAqB,KAAK,KAAK,sBAAsB,MAAM;AACzD,SAAK,GAAG;AAAA,MACN,EAAE,KAAK,MAAM,KAAK,QAAQ,UAAU,EAAE,OAAO,eAAe,CAAC,EAAE;AAAA,MAC/D,EAAE,KAAK,MAAM,KAAK,QAAQ,QAAQ,EAAE,OAAO,eAAe,CAAC,EAAE;AAAA,IAC/D,CAAC;AAED,SAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,QAAQ,CAAC;AAChD,SAAK,QAAQ,MAAM;AACnB,SAAK,SAAS,KAAK,YAAY,EAAE,OAAO,MAAM,CAAC;AAE/C,SAAK,IAAI;AAAA,MACP,EAAE,KAAK,MAAM,KAAK,QAAQ,UAAU,EAAE,OAAO,aAAa,CAAC,EAAE;AAAA,MAC7D,EAAE,KAAK,MAAM,KAAK,QAAQ,QAAQ,EAAE,OAAO,aAAa,CAAC,EAAE;AAAA,IAC7D,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,yBAAyB,KAAK,KAAK,0BAA0B,MAAM;AACjE,SAAK,QAAQ,QAAQ;AACrB,SAAK,OAAO,MAAM,KAAK,QAAQ,KAAK,YAAY,CAAC;AACjD,SAAK,QAAQ,QAAQ;AAAA,EACvB,CAAC;AAAA;AAAA,EAGD,0BAA0B,KAAK,KAAK,2BAA2B,MAAM;AACnE,SAAK,QAAQ,MAAM;AACnB,SAAK,OAAO,MAAM,KAAK,QAAQ,KAAK,kBAAkB,CAAC;AACvD,SAAK,QAAQ,MAAM;AAAA,EACrB,CAAC;AAAA;AAAA,EAGD,qBAAqB,KAAK,KAAK,sBAAsB,MAAM;AACzD,SAAK,QAAQ,KAAK,gBAAgB,EAAE,OAAO,OAAO,CAAC;AACnD,SAAK,KAAK,MAAM;AACd,WAAK,QAAQ,KAAK;AAClB,WAAK,SAAS,KAAK,gBAAgB,EAAE,OAAO,OAAO,CAAC;AAAA,IACtD,CAAC;AAAA,EACH,CAAC;AAAA;AAAA,EAGD,iBAAiB,KAAK,KAAK,kBAAkB,MAAM;AACjD,SAAK,GAAG;AAAA,MACN,EAAE,KAAK,MAAM,KAAK,QAAQ,eAAe,EAAE,OAAO,MAAM,CAAC,EAAE;AAAA,MAC3D,EAAE,KAAK,MAAM,KAAK,QAAQ,YAAY,EAAE,OAAO,MAAM,CAAC,EAAE;AAAA,IAC1D,CAAC;AACD,SAAK,QAAQ,KAAK;AAClB,SAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,QAAQ,CAAC;AAAA,EAClD,CAAC;AAAA,EAED,eAAe,KAAK,KAAK,gBAAgB,MAAM;AAC7C,SAAK,QAAQ,KAAK,YAAY,EAAE,OAAO,MAAM,CAAC;AAC9C,SAAK,KAAK,MAAM;AACd,WAAK,QAAQ,KAAK;AAClB,WAAK,SAAS,KAAK,YAAY,EAAE,OAAO,MAAM,CAAC;AAAA,IACjD,CAAC;AAAA,EACH,CAAC;AAAA;AAAA;AAAA;AAAA,EAKO,sBAA+B;AACrC,UAAMC,aAAY,KAAK,GAAG,CAAC;AAC3B,QAAI,CAACA,cAAaA,WAAU,cAAc,UAAU;AAClD,aAAO;AAAA,IACT;AAIA,WAAO,CAAC,KAAK,gBAAgB;AAAA,EAC/B;AAAA;AAAA;AAAA,EAIQ,uBAAgC;AACtC,UAAMA,aAAY,KAAK,GAAG,CAAC;AAC3B,QAAI,CAACA,cAAaA,WAAU,cAAc,QAAQ;AAChD,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,kBAA2B;AACjC,UAAMA,aAAY,KAAK,GAAG,CAAC;AAC3B,QAAI,CAACA,YAAW;AACd,aAAO;AAAA,IACT;AACA,UAAM,YAAYA,WAAU;AAG5B,QAAI,cAAc,YAAY,cAAc,QAAQ;AAClD,aAAO;AAAA,IACT;AAIA,QAAI,QAAQ;AACZ,QAAI,IAAI;AACR,WAAO,MAAM;AACX,YAAM,QAAQ,KAAK,GAAG,EAAE,CAAC;AAEzB,UAAI,CAAC,SAAS,MAAM,UAAU,SAAS,OAAO;AAC5C;AAAA,MACF;AAEA,YAAM,KAAK,MAAM;AACjB,UAAI,OAAO,YAAY,OAAO,UAAU,OAAO,QAAQ;AACrD;AAAA,MACF,WAAW,OAAO,YAAY,OAAO,UAAU,OAAO,QAAQ;AAC5D,YAAI,UAAU,GAAG;AAEf,iBAAO;AAAA,QACT;AACA;AAAA,MACF,WAAW,OAAO,QAAQ;AAExB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAEO,IAAM,SAAS,IAAI,oBAAoB;AACvC,IAAM,QAAQ,IAAI,MAAM,SAAS;;;ACtexC,IAAM,iBAAiB,OAAO,6BAA6B;AAK3D,IAAM,uBAAN,cAAmC,eAAe;AAAA,EAChD,cAAc;AACZ,UAAM;AACN,SAAK,gBAAgB;AAAA,EACvB;AAAA,EAEA,WAAW,KAAyB;AAClC,UAAM,YAAY,KAAK,MAAM,IAAI,SAAS;AAE1C,QAAI,IAAI,UAAU;AAChB,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,QACA,YAAY,KAAK,MAAM,IAAI,UAAU;AAAA,QACrC,WAAW,KAAK,MAAM,IAAI,SAAS;AAAA,MACrC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,yBAAyB,KAAyB;AAChD,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE/B,QAAI,IAAI,KAAK;AACX,iBAAW,WAAW,IAAI,KAAK;AAC7B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,MAAM,OAAO;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,aAAa,KAAyB;AACpC,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE/B,QAAI,IAAI,KAAK;AACX,iBAAW,WAAW,IAAI,KAAK;AAC7B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,MAAM,OAAO;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,cAAc,KAAyB;AACrC,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE/B,QAAI,IAAI,KAAK;AACX,iBAAW,WAAW,IAAI,KAAK;AAC7B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,IAAI;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,MAAM,OAAO;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,qBAAqB,KAAyB;AAC5C,UAAM,MAAM,KAAK,MAAM,IAAI,GAAG;AAE9B,QAAI,CAAC,IAAI,KAAK;AACZ,aAAO;AAAA,IACT;AAGA,QAAI;AACJ,QAAI,IAAI,IAAI;AACV,WAAK;AAAA,IACP,WAAW,IAAI,OAAO;AACpB,WAAK;AAAA,IACP,WAAW,IAAI,IAAI;AACjB,WAAK;AAAA,IACP,WAAW,IAAI,IAAI;AACjB,WAAK;AAAA,IACP,WAAW,IAAI,MAAM;AACnB,WAAK;AAAA,IACP,WAAW,IAAI,MAAM;AACnB,WAAK;AAAA,IACP,WAAW,IAAI,IAAI;AACjB,WAAK,IAAI,MAAM,WAAW;AAAA,IAC5B,OAAO;AACL,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAC/C;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN;AAAA,MACA,MAAM;AAAA,MACN,OAAO,KAAK,MAAM,IAAI,GAAG;AAAA,IAC3B;AAAA,EACF;AAAA,EAEA,mBAAmB,KAAyB;AAC1C,WAAO,KAAK,6BAA6B,KAAK,CAAC,QAAQ,OAAO,GAAG,CAAC,KAAK,GAAG,CAAC;AAAA,EAC7E;AAAA,EAEA,yBAAyB,KAAyB;AAChD,WAAO,KAAK,6BAA6B,KAAK,CAAC,QAAQ,OAAO,KAAK,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC;AAAA,EACvF;AAAA;AAAA,EAGA,gBAAgB,KAAyB;AACvC,UAAM,OAAO,KAAK,MAAM,IAAI,IAAI;AAEhC,QAAI,IAAI,UAAU;AAChB,aAAO;AAAA,QACL,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,OAAO,KAAK,MAAM,IAAI,QAAQ;AAAA,MAChC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,gBAAgB,KAAyB;AACvC,QAAI,IAAI,OAAO,IAAI,QAAQ;AACzB,aAAO,EAAE,MAAM,WAAW,IAAI,OAAO,SAAS,KAAK,MAAM,IAAI,OAAO,EAAE;AAAA,IACxE;AACA,QAAI,IAAI,OAAO;AACb,aAAO,EAAE,MAAM,WAAW,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,OAAO,EAAE;AAAA,IACtE;AACA,WAAO,KAAK,MAAM,IAAI,iBAAiB;AAAA,EACzC;AAAA,EAEA,kBAAkB,KAAyB;AACzC,QAAI,SAAS,KAAK,MAAM,IAAI,iBAAiB;AAQ7C,UAAM,MAAmB,CAAC;AAE1B,QAAI,IAAI,KAAK;AACX,eAAS,IAAI,GAAG,IAAI,IAAI,IAAI,QAAQ,KAAK;AACvC,YAAI,KAAK,EAAE,MAAM,UAAU,QAAQ,IAAI,IAAI,CAAC,EAAE,aAAa,KAAK,EAAE,CAAC;AAAA,MACrE;AAAA,IACF;AAEA,QAAI,IAAI,UAAU;AAChB,eAAS,IAAI,GAAG,IAAI,IAAI,SAAS,QAAQ,KAAK;AAC5C,YAAI,KAAK,EAAE,MAAM,SAAS,QAAQ,IAAI,SAAS,CAAC,EAAE,aAAa,KAAK,EAAE,CAAC;AAAA,MACzE;AAAA,IACF;AAEA,QAAI,IAAI,QAAQ;AACd,eAAS,IAAI,GAAG,IAAI,IAAI,OAAO,QAAQ,KAAK;AAC1C,YAAI,KAAK,EAAE,MAAM,QAAQ,QAAQ,IAAI,OAAO,CAAC,EAAE,aAAa,KAAK,EAAE,CAAC;AAAA,MACtE;AAAA,IACF;AAOA,QAAI,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAGtC,eAAW,MAAM,KAAK;AACpB,UAAI,GAAG,SAAS,UAAU;AACxB,cAAM,OAAO,IAAI,SAAS,GAAG,GAAG,EAAE;AAClC,iBAAS,EAAE,MAAM,gBAAgB,QAAQ,QAAQ,UAAU,KAAK;AAAA,MAClE,WAAW,GAAG,SAAS,SAAS;AAC9B,cAAM,YAAY,IAAI,MAAM,GAAG,GAAG;AAClC,iBAAS,EAAE,MAAM,eAAe,QAAQ,QAAQ,OAAO,KAAK,MAAM,SAAS,EAAE;AAAA,MAC/E,WAAW,GAAG,SAAS,QAAQ;AAE7B,cAAM,OACJ,IAAI,gBAAgB,IAAI,aAAa,GAAG,GAAG,IAAI,KAAK,MAAM,IAAI,aAAa,GAAG,GAAG,CAAC,IAAI,CAAC;AACzF,iBAAS,EAAE,MAAM,gBAAgB,QAAQ,QAAQ,KAAK;AAAA,MACxD;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,kBAAkB,KAAyB;AACzC,QAAI,IAAI,eAAe;AACrB,YAAM,MAAM,IAAI,cAAc,CAAC,EAAE,MAAM,QAAQ,MAAM,EAAE;AACvD,aAAO,EAAE,MAAM,iBAAiB,OAAO,WAAW,GAAG,EAAE;AAAA,IACzD;AACA,QAAI,IAAI,eAAe;AACrB,YAAM,MAAM,IAAI,cAAc,CAAC,EAAE;AACjC,YAAM,QAAQ,KAAK,eAAe,IAAI,MAAM,GAAG,EAAE,CAAC;AAClD,aAAO,EAAE,MAAM,iBAAiB,MAAM;AAAA,IACxC;AACA,QAAI,IAAI,MAAM;AACZ,aAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK;AAAA,IAC/C;AACA,QAAI,IAAI,OAAO;AACb,aAAO,EAAE,MAAM,kBAAkB,OAAO,MAAM;AAAA,IAChD;AACA,QAAI,IAAI,MAAM;AACZ,aAAO,EAAE,MAAM,cAAc;AAAA,IAC/B;AACA,QAAI,IAAI,MAAM;AACZ,aAAO,EAAE,MAAM,UAAU;AAAA,IAC3B;AACA,QAAI,IAAI,QAAQ;AACd,aAAO,EAAE,MAAM,YAAY;AAAA,IAC7B;AACA,QAAI,IAAI,YAAY;AAClB,aAAO,EAAE,MAAM,cAAc,MAAM,IAAI,WAAW,CAAC,EAAE,MAAM;AAAA,IAC7D;AACA,QAAI,IAAI,wBAAwB;AAC9B,aAAO,KAAK,MAAM,IAAI,sBAAsB;AAAA,IAC9C;AACA,QAAI,IAAI,yBAAyB;AAC/B,aAAO,KAAK,MAAM,IAAI,uBAAuB;AAAA,IAC/C;AACA,QAAI,IAAI,YAAY;AAClB,aAAO,KAAK,MAAM,IAAI,UAAU;AAAA,IAClC;AACA,QAAI,IAAI,oBAAoB;AAC1B,aAAO,KAAK,MAAM,IAAI,kBAAkB;AAAA,IAC1C;AACA,QAAI,IAAI,iBAAiB;AACvB,aAAO,KAAK,MAAM,IAAI,eAAe;AAAA,IACvC;AAEA,UAAM,IAAI,MAAM,4BAA4B;AAAA,EAC9C;AAAA,EAEA,mBAAmB,KAAoB;AACrC,UAAM,eAAe,IAAI,aAAa,CAAC;AACvC,UAAM,aAAa,IAAI,WAAW,CAAC;AAEnC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO,KAAK,MAAM,IAAI,KAAK;AAAA,MAC3B,KAAK,KAAK,MAAM,IAAI,GAAG;AAAA,MACvB,gBAAgB,aAAa,UAAU,SAAS;AAAA,MAChD,cAAc,WAAW,UAAU,SAAS;AAAA,IAC9C;AAAA,EACF;AAAA,EAEA,uBAAuB,KAAwB;AAC7C,QAAI,CAAC,IAAI,cAAc;AACrB,aAAO,EAAE,MAAM,gBAAgB,UAAU,CAAC,EAAE;AAAA,IAC9C;AACA,UAAM,OAAO,KAAK,MAAM,IAAI,YAAY;AACxC,WAAO,EAAE,MAAM,gBAAgB,UAAU,KAAwB;AAAA,EACnE;AAAA,EAEA,wBAAwB,KAAyB;AAC/C,QAAI,CAAC,IAAI,oBAAoB;AAC3B,aAAO,EAAE,MAAM,iBAAiB,YAAY,CAAC,EAAE;AAAA,IACjD;AACA,UAAM,QAAQ,KAAK,MAAM,IAAI,kBAAkB;AAC/C,WAAO;AAAA,MACL,MAAM;AAAA,MACN,YAAY;AAAA,IACd;AAAA,EACF;AAAA,EAEA,mBAAmB,KAAwD;AACzE,WAAO,IAAI,KAAK;AAAA,MACd,CAAC,aAAsB,KAAK,MAAM,QAAQ;AAAA,IAC5C;AAAA,EACF;AAAA,EAEA,eAAe,KAAiD;AAC9D,UAAM,WAAW,IAAI,IAAI,CAAC;AAC1B,UAAM,MACJ,SAAS,UAAU,SAAS,kBACxB,KAAK,eAAe,SAAS,MAAM,MAAM,GAAG,EAAE,CAAC,IAC/C,SAAS;AACf,UAAM,QAAQ,KAAK,MAAM,IAAI,KAAK;AAClC,WAAO,EAAE,KAAK,MAAM;AAAA,EACtB;AAAA,EAEA,gBAAgB,KAA2C;AAEzD,QAAI,IAAI,eAAe;AACrB,YAAM,MAAM,IAAI,cAAc,CAAC,EAAE;AACjC,aAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,eAAe,IAAI,MAAM,GAAG,EAAE,CAAC,EAAE;AAAA,IAC/E;AAGA,UAAM,QAA2D,CAAC;AAGlE,UAAM,UAAU,IAAI,aAAa,CAAC,EAAE;AACpC,UAAM,WAAW,KAAK,eAAe,QAAQ,MAAM,GAAG,EAAE,CAAC;AACzD,QAAI,UAAU;AACZ,YAAM,KAAK,EAAE,MAAM,SAAS,CAAC;AAAA,IAC/B;AAGA,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,QAAQ,KAAK;AACxC,YAAM,KAAK,EAAE,MAAM,KAAK,MAAM,IAAI,KAAK,CAAC,CAAC,EAAmB,CAAC;AAE7D,UAAI,IAAI,kBAAkB,IAAI,eAAe,CAAC,GAAG;AAC/C,cAAM,SAAS,IAAI,eAAe,CAAC,EAAE;AACrC,cAAM,UAAU,KAAK,eAAe,OAAO,MAAM,GAAG,EAAE,CAAC;AACvD,YAAI,SAAS;AACX,gBAAM,KAAK,EAAE,MAAM,QAAQ,CAAC;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAGA,UAAM,UAAU,IAAI,aAAa,CAAC,EAAE;AACpC,UAAM,WAAW,KAAK,eAAe,QAAQ,MAAM,GAAG,EAAE,CAAC;AACzD,QAAI,UAAU;AACZ,YAAM,KAAK,EAAE,MAAM,SAAS,CAAC;AAAA,IAC/B;AAIA,QAAI,MAAM,MAAM,CAAC,MAAM,UAAU,CAAC,GAAG;AACnC,YAAM,WAAW,MAAM,IAAI,CAAC,MAAO,EAAuB,IAAI,EAAE,KAAK,EAAE;AACvE,aAAO,EAAE,MAAM,iBAAiB,OAAO,SAAS;AAAA,IAClD;AAEA,WAAO,EAAE,MAAM,mBAAmB,MAAM;AAAA,EAC1C;AAAA,EAEA,aAAa,KAA2B;AACtC,WAAO,IAAI,IAAI,IAAI,CAAC,YAAqB,KAAK,MAAM,OAAO,CAAkB;AAAA,EAC/E;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAAe,GAAmB;AACxC,WAAO,EACJ,QAAQ,QAAQ,IAAI,EACpB,QAAQ,QAAQ,GAAI,EACpB,QAAQ,QAAQ,IAAI,EACpB,QAAQ,QAAQ,GAAG,EACnB,QAAQ,MAAM,GAAG,EACjB,QAAQ,SAAS,IAAI;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,6BACN,KACA,YACA,KACe;AACf,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE/B,QAAI,CAAC,IAAI,KAAK;AAEZ,aAAO;AAAA,IACT;AAGA,UAAM,iBAAgE,CAAC;AACvE,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,YAAM,SAAS,IAAI,WAAW,CAAC,CAAC;AAChC,UAAI,QAAQ;AACV,mBAAW,SAAS,QAAQ;AAC1B,yBAAe,KAAK,EAAE,IAAI,IAAI,CAAC,GAAG,QAAQ,MAAM,YAAY,CAAC;AAAA,QAC/D;AAAA,MACF;AAAA,IACF;AAGA,mBAAe,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAGjD,aAAS,IAAI,GAAG,IAAI,IAAI,IAAI,QAAQ,KAAK;AACvC,YAAM,KAAK,eAAe,CAAC,GAAG;AAC9B,UAAI,CAAC,IAAI;AACP,cAAM,IAAI,MAAM,0BAA0B,WAAW,KAAK,IAAI,CAAC,EAAE;AAAA,MACnE;AAEA,eAAS;AAAA,QACP,MAAM;AAAA,QACN;AAAA,QACA,MAAM;AAAA,QACN,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,MAC9B;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAEO,IAAM,aAAa,IAAI,qBAAqB;AAS5C,SAAS,SAAS,KAA6B;AACpD,SAAO,WAAW,MAAM,GAAG;AAC7B;;;AC9YO,SAAS,iCAAiC,KAAmC;AAClF,MAAI,IAAI,SAAS,cAAc;AAC7B,WAAO,EAAE,MAAM,iBAAiB,OAAQ,IAA6C,KAAK;AAAA,EAC5F;AACA,SAAO;AACT;AAYO,SAAS,yBAAyB,KAAoB,IAA8B;AACzF,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,MAAM,EAAE,MAAM,YAAY;AAAA,IAC1B,OAAO;AAAA,EACT;AACF;AAaO,SAAS,yBAAyB,KAAoB,IAA2B;AACtF,QAAM,QAAQ,iCAAiC,GAAG;AAClD,SAAO,yBAAyB,OAAO,EAAE;AAC3C;AAUO,SAAS,oBAAoB,aAAsC;AACxE,SAAO,yBAAyB,aAAa,IAAI;AACnD;AAWO,SAAS,2BAA2B,UAAmC;AAC5E,SAAO,yBAAyB,UAAU,IAAI;AAChD;AAWO,SAAS,cAAc,OAAuC;AACnE,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK;AAAA,EAC/C;AACA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,SAAO,MAAM,OAAO,CAAC,KAAK,UAAU;AAAA,IAClC,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,MAAM;AAAA,IACN,OAAO;AAAA,EACT,EAAE;AACJ;AAUO,SAAS,eAAe,OAAuC;AACpE,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK;AAAA,EAC/C;AACA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,SAAO,MAAM,OAAO,CAAC,KAAK,UAAU;AAAA,IAClC,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,MAAM;AAAA,IACN,OAAO;AAAA,EACT,EAAE;AACJ;;;ACvGO,SAAS,qBAAqB,OAA8B;AACjE,QAAM,UAAU,MAAM,KAAK;AAG3B,MAAI,YAAY,MAAM,YAAY,KAAK;AACrC,WAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK;AAAA,EAC/C;AAGA,MAAI,QAAQ,SAAS,GAAG,GAAG;AACzB,WAAO,wBAAwB,OAAO;AAAA,EACxC;AAIA,MAAI,QAAQ,SAAS,GAAG,KAAK,CAAC,eAAe,OAAO,GAAG;AACrD,UAAM,QAAQ,aAAa,OAAO;AAClC,UAAM,cAAc,MAAM,IAAI,CAAC,SAAS,mBAAmB,KAAK,KAAK,CAAC,CAAC;AACvE,WAAO,cAAc,WAAW;AAAA,EAClC;AAIA,QAAM,iBAAiB,mBAAmB,OAAO;AACjD,MAAI,gBAAgB;AAClB,WAAO;AAAA,EACT;AAEA,SAAO,mBAAmB,OAAO;AACnC;AAYA,SAAS,mBAAmB,OAA8B;AAExD,QAAM,kBAAkB,MAAM,MAAM,4BAA4B;AAChE,MAAI,iBAAiB;AACnB,UAAM,CAAC,EAAE,IAAI,SAAS,IAAI;AAC1B,UAAMC,SAAQ,wBAAwB,SAAS;AAE/C,QAAI,OAAO,QAAQ,OAAO,MAAM;AAC9B,aAAO,yBAAyBA,QAAO,EAAiB;AAAA,IAC1D;AACA,WAAO,yBAAyBA,QAAO,EAAoB;AAAA,EAC7D;AAGA,MAAI,MAAM,MAAM,oBAAoB,GAAG;AACrC,UAAM,cAAc,wBAAwB,KAAK;AACjD,WAAO,oBAAoB,WAAW;AAAA,EACxC;AAIA,MAAI,eAAe,KAAK,GAAG;AACzB,UAAM,WAAW,wBAAwB,KAAK;AAC9C,WAAO,2BAA2B,QAAQ;AAAA,EAC5C;AAIA,QAAM,QAAQ,wBAAwB,KAAK;AAC3C,SAAO,yBAAyB,OAAO,IAAI;AAC7C;AAWA,SAAS,mBAAmB,OAAqC;AAG/D,QAAM,WAAW,iBAAiB,OAAO,KAAK;AAC9C,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,cAAc,SAAS,IAAI,CAAC,SAAS,mBAAmB,KAAK,KAAK,CAAC,CAAC;AAC1E,WAAO,eAAe,WAAW;AAAA,EACnC;AAEA,QAAM,UAAU,iBAAiB,OAAO,IAAI;AAC5C,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,cAAc,QAAQ,IAAI,CAAC,SAAS,mBAAmB,KAAK,KAAK,CAAC,CAAC;AACzE,WAAO,cAAc,WAAW;AAAA,EAClC;AAEA,SAAO;AACT;AAOA,SAAS,iBAAiB,OAAe,IAA4B;AACnE,QAAM,UAAU,IAAI,EAAE;AACtB,QAAM,QAAkB,CAAC;AACzB,MAAIC,WAAU;AACd,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,aAAa;AACjB,MAAI,IAAI;AAER,SAAO,IAAI,MAAM,QAAQ;AACvB,UAAM,OAAO,MAAM,CAAC;AAEpB,QAAI,UAAU;AACZ,MAAAA,YAAW;AACX,UAAI,SAAS,cAAc,MAAM,IAAI,CAAC,MAAM,MAAM;AAChD,mBAAW;AAAA,MACb;AACA;AACA;AAAA,IACF;AAEA,QAAI,SAAS,OAAO,SAAS,KAAK;AAChC,iBAAW;AACX,mBAAa;AACb,MAAAA,YAAW;AACX;AAAA,IACF,WAAW,SAAS,OAAO,SAAS,OAAO,SAAS,KAAK;AACvD;AACA,MAAAA,YAAW;AACX;AAAA,IACF,WAAW,SAAS,OAAO,SAAS,OAAO,SAAS,KAAK;AACvD;AACA,MAAAA,YAAW;AACX;AAAA,IACF,WAAW,UAAU,KAAK,MAAM,UAAU,GAAG,IAAI,QAAQ,MAAM,EAAE,YAAY,MAAM,SAAS;AAC1F,YAAM,KAAKA,QAAO;AAClB,MAAAA,WAAU;AACV,WAAK,QAAQ;AAAA,IACf,OAAO;AACL,MAAAA,YAAW;AACX;AAAA,IACF;AAAA,EACF;AAEA,MAAIA,UAAS;AACX,UAAM,KAAKA,QAAO;AAAA,EACpB;AACA,SAAO;AACT;AASA,SAAS,eAAe,OAAwB;AAC9C,SAAO,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI;AAC7E;AAaA,SAAS,aAAa,OAAyB;AAC7C,QAAM,QAAkB,CAAC;AACzB,MAAIA,WAAU;AACd,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,aAAa;AAEjB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,OAAO,MAAM,CAAC;AAEpB,QAAI,UAAU;AACZ,MAAAA,YAAW;AAEX,UAAI,SAAS,cAAc,MAAM,IAAI,CAAC,MAAM,MAAM;AAChD,mBAAW;AAAA,MACb;AACA;AAAA,IACF;AAEA,QAAI,SAAS,OAAO,SAAS,KAAK;AAChC,iBAAW;AACX,mBAAa;AACb,MAAAA,YAAW;AAAA,IACb,WAAW,SAAS,OAAO,SAAS,KAAK;AACvC;AACA,MAAAA,YAAW;AAAA,IACb,WAAW,SAAS,OAAO,SAAS,KAAK;AACvC;AACA,MAAAA,YAAW;AAAA,IACb,WAAW,SAAS,OAAO,UAAU,GAAG;AACtC,YAAM,KAAKA,QAAO;AAClB,MAAAA,WAAU;AAAA,IACZ,OAAO;AACL,MAAAA,YAAW;AAAA,IACb;AAAA,EACF;AAEA,MAAIA,UAAS;AACX,UAAM,KAAKA,QAAO;AAAA,EACpB;AACA,SAAO;AACT;AAaO,SAAS,wBAAwB,OAAe,UAA0C;AAC/F,QAAM,eAAe,MAAM,SAAS,KAAK;AAEzC,MAAI,aAAa,OAAO,SAAS,GAAG;AAClC,UAAM,IAAI;AAAA,MACR,gBAAgB,aAAa,OAAO,IAAI,CAAC,MAAW,EAAE,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA,MAEzE;AAAA,MACA,EAAE,YAAY,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,SAAO,QAAQ,aAAa;AAC5B,QAAM,MAAM,OAAO,WAAW;AAE9B,MAAI,OAAO,OAAO,SAAS,GAAG;AAC5B,UAAM,IAAI;AAAA,MACR,gBAAgB,OAAO,OAAO,IAAI,CAAC,MAAW,EAAE,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA,MAEnE;AAAA,MACA,EAAE,YAAY,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,SAAO,SAAS,GAAG;AACrB;;;AC5OO,IAAM,YAAgC;AAAA,EAC3C,EAAE,MAAM,oBAAoB,KAAK,gBAAgB;AAAA,EACjD,EAAE,MAAM,yBAAyB,KAAK,oBAAoB;AAAA,EAC1D,EAAE,MAAM,uBAAuB,KAAK,mBAAmB;AAAA,EACvD,EAAE,MAAM,kBAAkB,KAAK,cAAc;AAC/C;AAQO,SAAS,iBAAiB,KAA+B;AAC9D,MAAI,YAAY;AAEhB,aAAW,QAAQ,WAAW;AAC5B,gBAAY,KAAK,IAAI,SAAS;AAAA,EAChC;AAEA,SAAO;AACT;AASA,SAAS,mBAAmB,MAAgC;AAC1D,MAAI,CAAC,KAAK,eAAe;AACvB,SAAK,gBAAgB,CAAC;AAAA,EACxB;AACA,MAAI,CAAC,KAAK,cAAc,cAAc;AACpC,SAAK,cAAc,eAAe,oBAAI,IAA2B;AAAA,EACnE;AACA,SAAO,KAAK,cAAc;AAC5B;AAMA,SAAS,iBAAiB,MAAe,MAA6B;AACpE,QAAM,QAAQ,mBAAmB,IAAI;AACrC,QAAM,SAAS,MAAM,IAAI,IAAI;AAC7B,MAAI,QAAQ;AACV,WAAO;AAAA,EACT;AACA,QAAM,SAAS,qBAAqB,IAAI;AACxC,QAAM,IAAI,MAAM,MAAM;AACtB,SAAO;AACT;AAMA,SAAS,oBAAoB,MAAe,MAA6B;AACvE,QAAM,QAAQ,mBAAmB,IAAI;AACrC,QAAM,SAAS,MAAM,IAAI,IAAI;AAC7B,MAAI,QAAQ;AACV,WAAO;AAAA,EACT;AACA,QAAM,SAAS,wBAAwB,IAAI;AAC3C,QAAM,IAAI,MAAM,MAAM;AACtB,SAAO;AACT;AAMA,SAAS,qBAAqB,MAAqB;AACjD,MAAI,KAAK,iBAAiB,KAAK,cAAc,cAAc;AACzD,SAAK,cAAc,aAAa,MAAM;AAAA,EACxC;AACF;AAwBA,SAAS,gBAAgB,KAA+B;AAEtD,QAAM,YAAY,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAGhD,YAAU,QAAQ,UAAU,MAAM,IAAI,CAAC,SAAkB,oBAAoB,IAAI,CAAC;AAElF,SAAO;AACT;AAKA,SAAS,oBAAoB,MAAwB;AACnD,MAAI,CAAC,KAAK,SAAS;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK;AAGrB,MAAI,KAAK,mDAAkC;AACzC,WAAO,6BAA6B,MAAM,OAAO;AAAA,EACnD;AAGA,MAAI,KAAK,oCAA0B;AACjC,WAAO,sBAAsB,MAAM,OAAO;AAAA,EAC5C;AAGA,MAAI,KAAK,4CAA8B;AACrC,WAAO,mBAAmB,MAAM,OAAO;AAAA,EACzC;AAEA,SAAO;AACT;AAKA,SAAS,6BAA6B,MAAe,SAA2C;AAC9F,QAAM,EAAE,OAAO,OAAO,IAAI;AAC1B,MAAI,WAAW;AAGf,QAAM,cAAc,MAAM,IAAI,CAAC,SAAkC;AAC/D,UAAM,aAAa,EAAE,GAAG,KAAK;AAE7B,eAAW,SAAS,QAAQ;AAC1B,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC;AAAA,MACF;AAGA,UAAI;AACF,cAAM,MAAM,iBAAiB,MAAM,IAAI;AACvC,cAAM,SAAS,eAAe,GAAG;AAGjC,YAAI,WAAW,QAAQ,UAAU,MAAM,GAAG;AACxC,gBAAM,UAAU,oBAAoB,MAAM;AAC1C,cAAI,YAAY,MAAM;AACpB,uBAAW,MAAM,EAAE,IAAI;AACvB,uBAAW;AAAA,UACb;AAAA,QACF;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAGD,MAAI,UAAU;AACZ,yBAAqB,IAAI;AAAA,EAC3B;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAKA,SAAS,sBAAsB,MAAe,SAAuB;AACnE,QAAM,EAAE,WAAW,IAAI;AACvB,MAAI,WAAW;AAEf,QAAM,mBAAmB,WAAW,IAAI,CAAC,cAAmB;AAC1D,UAAM,OAAO,UAAU;AACvB,QAAI,CAAC,QAAQ,SAAS,IAAI;AACxB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,MAAM,oBAAoB,MAAM,IAAI;AAC1C,YAAM,SAAS,eAAe,GAAG;AAEjC,UAAI,WAAW,QAAQ,UAAU,MAAM,GAAG;AACxC,cAAM,UAAU,oBAAoB,MAAM;AAC1C,YAAI,YAAY,MAAM;AACpB,qBAAW;AACX,iBAAO;AAAA,YACL,GAAG;AAAA,YACH,YAAY;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,WAAO;AAAA,EACT,CAAC;AAGD,MAAI,UAAU;AACZ,yBAAqB,IAAI;AAAA,EAC3B;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,YAAY;AAAA,IACd;AAAA,EACF;AACF;AAKA,SAAS,mBAAmB,MAAe,SAAuB;AAChE,QAAM,OAAO,QAAQ;AACrB,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,MAAM,oBAAoB,MAAM,IAAI;AAC1C,UAAM,SAAS,eAAe,GAAG;AAEjC,QAAI,WAAW,QAAQ,UAAU,MAAM,GAAG;AACxC,YAAM,UAAU,oBAAoB,MAAM;AAC1C,UAAI,YAAY,MAAM;AAEpB,6BAAqB,IAAI;AACzB,eAAO;AAAA,UACL,GAAG;AAAA,UACH,SAAS;AAAA,YACP,GAAG;AAAA,YACH,YAAY;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AAEA,SAAO;AACT;AAMA,SAAS,eAAe,MAA2C;AACjE,MAAI,cAAc,IAAI,GAAG;AACvB,WAAO;AAAA,EACT;AAEA,MAAI,WAAW,IAAI,GAAG;AACpB,UAAM,aAAa,eAAe,KAAK,IAAI;AAC3C,UAAM,cAAc,eAAe,KAAK,KAAK;AAG7C,QAAI,cAAc,eAAe,UAAU,UAAU,KAAK,UAAU,WAAW,GAAG;AAChF,YAAM,SAAS,yBAAyB,KAAK,IAAI,YAAY,WAAW;AACxE,UAAI,WAAW,MAAM;AACnB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,MAAM,cAAc,KAAK;AAAA,MACzB,OAAO,eAAe,KAAK;AAAA,IAC7B;AAAA,EACF;AAEA,MAAI,UAAU,IAAI,GAAG;AACnB,UAAM,gBAAgB,eAAe,KAAK,OAAO;AAEjD,QAAI,iBAAiB,UAAU,aAAa,GAAG;AAC7C,YAAM,SAAS,wBAAwB,KAAK,IAAI,aAAa;AAC7D,UAAI,WAAW,MAAM;AACnB,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,SAAS,iBAAiB,KAAK;AAAA,IACjC;AAAA,EACF;AAEA,MAAI,YAAY,IAAI,GAAG;AACrB,UAAM,kBAAkB,eAAe,KAAK,SAAS;AACrD,UAAM,mBAAmB,eAAe,KAAK,UAAU;AACvD,UAAM,kBAAkB,eAAe,KAAK,SAAS;AAErD,QAAI,mBAAmB,UAAU,eAAe,KAAK,iBAAiB,eAAe,GAAG;AACtF,aAAO,gBAAgB,QACnB,oBAAoB,KAAK,aACzB,mBAAmB,KAAK;AAAA,IAC9B;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,WAAW,mBAAmB,KAAK;AAAA,MACnC,YAAY,oBAAoB,KAAK;AAAA,MACrC,WAAW,mBAAmB,KAAK;AAAA,IACrC;AAAA,EACF;AAGA,SAAO;AACT;AAKA,SAAS,cAAc,MAA8B;AACnD,SACE,gBAAgB,IAAI,KAAK,gBAAgB,IAAI,KAAK,iBAAiB,IAAI,KAAK,cAAc,IAAI;AAElG;AAKA,SAAS,UACP,MACwD;AACxD,SAAO,SAAS,QAAQ,cAAc,IAAI;AAC5C;AAKA,SAAS,yBACP,IACA,MACA,OACsB;AAEtB,MAAI,gBAAgB,IAAI,KAAK,gBAAgB,KAAK,GAAG;AACnD,YAAQ,IAAI;AAAA,MACV,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,IAAI,KAAK,OAAO,MAAM,KAAK,EAAE;AAAA,MAC3E,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MACnE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MACnE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,MAAM;AAAA,MACpE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,MAAM;AAAA,MACpE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,MACrE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,IACvE;AAAA,EACF;AAGA,MAAI,gBAAgB,IAAI,KAAK,gBAAgB,KAAK,GAAG;AACnD,YAAQ,IAAI;AAAA,MACV,KAAK;AACH,eAAO,EAAE,MAAM,iBAAiB,OAAO,KAAK,QAAQ,MAAM,MAAM;AAAA,MAClE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,MACrE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,IACvE;AAAA,EACF;AAGA,MAAI,iBAAiB,IAAI,KAAK,iBAAiB,KAAK,GAAG;AACrD,YAAQ,IAAI;AAAA,MACV,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,MAAM;AAAA,MACpE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,MAAM;AAAA,MACpE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,MACrE,KAAK;AACH,eAAO,EAAE,MAAM,kBAAkB,OAAO,KAAK,UAAU,MAAM,MAAM;AAAA,IACvE;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,wBACP,IACA,SACsB;AACtB,MAAI,OAAO,SAAS,iBAAiB,OAAO,GAAG;AAC7C,WAAO,EAAE,MAAM,kBAAkB,OAAO,CAAC,QAAQ,MAAM;AAAA,EACzD;AAEA,MAAI,OAAO,OAAO,gBAAgB,OAAO,GAAG;AAC1C,WAAO,EAAE,MAAM,iBAAiB,OAAO,CAAC,QAAQ,MAAM;AAAA,EACxD;AAEA,SAAO;AACT;AAKA,SAAS,oBAAoB,MAA8D;AACzF,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,OAAO,KAAK,KAAK;AAAA,IAC1B,KAAK;AACH,aAAO,IAAI,KAAK,KAAK;AAAA,IACvB,KAAK;AACH,aAAO,OAAO,KAAK,KAAK;AAAA,EAC5B;AACF;AAkBA,SAAS,oBAAoB,KAA+B;AAC1D,QAAM,YAAY,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAEhD,YAAU,QAAQ,UAAU,MAAM,IAAI,CAAC,SAAkB,wBAAwB,IAAI,CAAC;AAEtF,SAAO;AACT;AAKA,SAAS,wBAAwB,MAAwB;AACvD,MAAI,CAAC,KAAK,SAAS;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK;AAErB,MAAI,KAAK,mDAAkC;AACzC,WAAO,iCAAiC,MAAM,OAAO;AAAA,EACvD;AAEA,MAAI,KAAK,oCAA0B;AACjC,WAAO,0BAA0B,MAAM,OAAO;AAAA,EAChD;AAEA,SAAO;AACT;AAMA,SAAS,mBAAmB,MAA8B;AACxD,MAAI,WAAW,IAAI,KAAK,KAAK,OAAO,MAAM;AACxC,UAAM,eAAe,KAAK,KAAK,SAAS;AACxC,UAAM,eAAe,iBAAiB,KAAK,KAAK,KAAK,CAAC,KAAK,MAAM;AACjE,WAAO,gBAAgB;AAAA,EACzB;AAEA,MAAI,WAAW,IAAI,KAAK,KAAK,OAAO,MAAM;AACxC,UAAM,eAAe,KAAK,KAAK,SAAS;AACxC,UAAM,cAAc,iBAAiB,KAAK,KAAK,KAAK,KAAK,MAAM;AAC/D,WAAO,gBAAgB;AAAA,EACzB;AAEA,SAAO;AACT;AAKA,SAAS,0BAA0B,MAAe,SAAuB;AACvE,QAAM,EAAE,WAAW,IAAI;AAGvB,QAAM,iBAAiB,WAAW,OAAO,CAAC,cAAmB;AAC3D,UAAM,OAAO,UAAU;AACvB,QAAI,CAAC,QAAQ,SAAS,IAAI;AACxB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,SAAS,oBAAoB,MAAM,IAAI;AAE7C,UAAI,iBAAiB,MAAM,KAAK,CAAC,OAAO,OAAO;AAC7C,eAAO;AAAA,MACT;AAAA,IACF,QAAQ;AAAA,IAAC;AAET,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,YAAY;AAAA,IACd;AAAA,EACF;AACF;AAKA,SAAS,iCAAiC,MAAe,SAAuB;AAC9E,QAAM,EAAE,OAAO,OAAO,IAAI;AAG1B,QAAM,YAAY,MAAM,OAAO,CAAC,SAAc;AAC5C,eAAW,SAAS,QAAQ;AAC1B,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC;AAAA,MACF;AAEA,UAAI;AACF,cAAM,SAAS,iBAAiB,MAAM,IAAI;AAG1C,YAAI,iBAAiB,MAAM,KAAK,CAAC,OAAO,OAAO;AAC7C,iBAAO;AAAA,QACT;AAIA,YAAI,mBAAmB,MAAM,GAAG;AAC9B,iBAAO;AAAA,QACT;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAiBA,SAAS,mBAAmB,KAA+B;AAEzD,QAAM,YAAY,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAKhD,YAAU,QAAQ,UAAU,MAAM,IAAI,CAAC,SAAkB,wBAAwB,IAAI,CAAC;AAEtF,SAAO;AACT;AAKA,SAAS,wBAAwB,MAAwB;AACvD,MAAI,CAAC,KAAK,SAAS;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK;AAGrB,MAAI,KAAK,qDAAoC,WAAW,QAAQ,SAAS,QAAQ,QAAQ;AACvF,WAAO,+BAA+B,MAAM,OAAO;AAAA,EACrD;AAEA,SAAO;AACT;AAKA,SAAS,+BAA+B,MAAe,SAAuB;AAC5E,QAAM,EAAE,OAAO,OAAO,IAAI;AAE1B,QAAM,eAAe,MAAM,IAAI,CAAC,SAAc;AAC5C,UAAM,cAAc,EAAE,GAAG,KAAK;AAE9B,eAAW,SAAS,QAAQ;AAC1B,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC;AAAA,MACF;AAEA,YAAM,UAAU,oBAAoB,IAAI;AACxC,UAAI,YAAY,MAAM;AACpB,oBAAY,MAAM,EAAE,IAAI;AAAA,MAC1B;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,OAAO;AAAA,IACT;AAAA,EACF;AACF;AAMA,SAAS,oBAAoB,MAAsB;AACjD,QAAM,UAAU,KAAK,KAAK;AAM1B,QAAM,WAAW,QAAQ,MAAM,gBAAgB;AAC/C,MAAI,UAAU;AACZ,UAAM,OAAO,SAAS,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAAC,MAAc,EAAE,KAAK,CAAC;AAC/D,QAAI,KAAK,MAAM,CAAC,QAAgB,gBAAgB,KAAK,GAAG,CAAC,GAAG;AAC1D,YAAM,MAAM,KAAK,OAAO,CAAC,KAAa,QAAgB,MAAM,WAAW,GAAG,GAAG,CAAC;AAC9E,aAAO,OAAO,GAAG;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,MAAM,qBAAqB;AACpD,MAAI,UAAU;AACZ,UAAM,CAAC,GAAG,MAAM,IAAI,IAAI;AACxB,UAAM,OAAO,WAAW,KAAK,KAAK,CAAC;AACnC,UAAM,OAAO,WAAW,KAAK,KAAK,CAAC;AACnC,QAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,GAAG;AAChC,aAAO,OAAO,KAAK,IAAI,MAAM,IAAI,CAAC;AAAA,IACpC;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,MAAM,qBAAqB;AACpD,MAAI,UAAU;AACZ,UAAM,CAAC,GAAG,MAAM,IAAI,IAAI;AACxB,UAAM,OAAO,WAAW,KAAK,KAAK,CAAC;AACnC,UAAM,OAAO,WAAW,KAAK,KAAK,CAAC;AACnC,QAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,GAAG;AAChC,aAAO,OAAO,KAAK,IAAI,MAAM,IAAI,CAAC;AAAA,IACpC;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,MAAM,gBAAgB;AAC/C,MAAI,UAAU;AACZ,UAAM,MAAM,WAAW,SAAS,CAAC,EAAE,KAAK,CAAC;AACzC,QAAI,CAAC,MAAM,GAAG,GAAG;AACf,aAAO,OAAO,KAAK,IAAI,GAAG,CAAC;AAAA,IAC7B;AAAA,EACF;AAGA,QAAM,aAAa,QAAQ,MAAM,kBAAkB;AACnD,MAAI,YAAY;AACd,UAAM,MAAM,WAAW,WAAW,CAAC,EAAE,KAAK,CAAC;AAC3C,QAAI,CAAC,MAAM,GAAG,GAAG;AACf,aAAO,OAAO,KAAK,MAAM,GAAG,CAAC;AAAA,IAC/B;AAAA,EACF;AAGA,QAAM,YAAY,QAAQ,MAAM,iBAAiB;AACjD,MAAI,WAAW;AACb,UAAM,MAAM,WAAW,UAAU,CAAC,EAAE,KAAK,CAAC;AAC1C,QAAI,CAAC,MAAM,GAAG,GAAG;AACf,aAAO,OAAO,KAAK,KAAK,GAAG,CAAC;AAAA,IAC9B;AAAA,EACF;AAGA,QAAM,aAAa,QAAQ,MAAM,kBAAkB;AACnD,MAAI,YAAY;AACd,UAAM,MAAM,WAAW,WAAW,CAAC,EAAE,KAAK,CAAC;AAC3C,QAAI,CAAC,MAAM,GAAG,GAAG;AACf,aAAO,OAAO,KAAK,MAAM,GAAG,CAAC;AAAA,IAC/B;AAAA,EACF;AAGA,QAAM,aAAa,QAAQ,MAAM,oBAAoB;AACrD,MAAI,YAAY;AACd,WAAO,IAAI,WAAW,CAAC,EAAE,YAAY,CAAC;AAAA,EACxC;AAGA,QAAM,aAAa,QAAQ,MAAM,oBAAoB;AACrD,MAAI,YAAY;AACd,WAAO,IAAI,WAAW,CAAC,EAAE,YAAY,CAAC;AAAA,EACxC;AAGA,QAAM,WAAW,QAAQ,MAAM,kBAAkB;AACjD,MAAI,UAAU;AACZ,WAAO,OAAO,SAAS,CAAC,EAAE,MAAM;AAAA,EAClC;AAGA,QAAM,cAAc,QAAQ,MAAM,uBAAuB;AACzD,MAAI,aAAa;AACf,UAAM,SAAS,QAAQ,MAAM,gBAAgB,EAAG,CAAC,EAAE,KAAK;AAExD,UAAM,aAAa,OAAO,QAAQ,MAAM,EAAE,EAAE,QAAQ,KAAK,EAAE,EAAE;AAC7D,WAAO,OAAO,UAAU;AAAA,EAC1B;AAEA,SAAO;AACT;AAsBA,SAAS,cAAc,KAA+B;AACpD,QAAM,YAAY,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAEhD,YAAU,QAAQ,UAAU,MAAM,IAAI,CAAC,SAAkB,iBAAiB,IAAI,CAAC;AAE/E,SAAO;AACT;AAKA,SAAS,iBAAiB,MAAwB;AAChD,MAAI,CAAC,KAAK,SAAS;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK;AAErB,MAAI,KAAK,mDAAkC;AACzC,WAAO,mBAAmB,MAAM,OAAO;AAAA,EACzC;AAEA,SAAO;AACT;AASA,SAAS,mBAAmB,MAAe,SAAuB;AAChE,QAAM,EAAE,OAAO,OAAO,IAAI;AAG1B,QAAM,gBAAgB,OAAO,IAAI,CAAC,UAAe;AAC/C,UAAM,cAAc,MAAM,IAAI,CAAC,SAAc;AAC3C,YAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,UAAI,CAAC,QAAQ,SAAS,MAAM,SAAS,KAAK;AACxC,eAAO;AAAA,MACT;AACA,aAAO,KAAK,KAAK;AAAA,IACnB,CAAC;AAMD,UAAM,cAAc,YAAY,MAAM,CAAC,QAAuB;AAC5D,UAAI,CAAC,KAAK;AACR,eAAO;AAAA,MACT;AACA,aAAO,6CAA6C,KAAK,GAAG;AAAA,IAC9D,CAAC;AAED,UAAM,eAAe,IAAI,IAAI,YAAY,OAAO,CAAC,MAAqB,MAAM,IAAI,CAAC;AACjF,UAAM,gBACJ,aAAa,OAAO,YAAY,OAAO,CAAC,MAAqB,MAAM,IAAI,EAAE;AAE3E,WAAO;AAAA,MACL,GAAG;AAAA;AAAA;AAAA;AAAA,MAIH,YAAY,eAAe,CAAC,iBAAiB,aAAa,OAAO,KAAK,aAAa,OAAO;AAAA,MAC1F,eAAe,MAAM,KAAK,YAAY;AAAA,IACxC;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,SAAS;AAAA,MACP,GAAG;AAAA,MACH,QAAQ;AAAA,IACV;AAAA,EACF;AACF;;;AC93BO,SAAS,sBACd,WACA,aACU;AACV,QAAM,SAAS,8BAA8B,WAAW,WAAW;AAEnE,SAAO,OAAO,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI;AACxC;AAcO,SAAS,8BACd,WACA,aACkB;AAClB,QAAM,SAA4B,CAAC;AAEnC,aAAW,SAAS,YAAY,QAAQ;AACtC,UAAMC,QAAO,MAAM;AACnB,UAAM,QAAQA,MAAK,MAAM,GAAG;AAE5B,QAAIC,WAAe;AACnB,QAAI,SAAS;AAGb,eAAW,QAAQ,OAAO;AACxB,UAAIA,aAAY,QAAQA,aAAY,UAAaA,SAAQ,IAAI,MAAM,QAAW;AAC5E,iBAAS;AACT;AAAA,MACF;AACA,MAAAA,WAAUA,SAAQ,IAAI;AAAA,IACxB;AAEA,QAAI,CAAC,QAAQ;AACX,aAAO,KAAK;AAAA,QACV,MAAAD;AAAA,QACA,SAAS;AAAA,QACT,UAAU,MAAM;AAAA,QAChB,QAAQ;AAAA,MACV,CAAC;AACD;AAAA,IACF;AAGA,UAAM,YAAY,kBAAkBC,UAAS,MAAM,MAAMD,KAAI;AAC7D,QAAI,WAAW;AACb,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,OAAO,OAAO,WAAW;AAAA,IACzB;AAAA,EACF;AACF;AAUA,SAAS,kBACP,OACA,cACAA,OACwB;AACxB,QAAM,aAAa,OAAO;AAE1B,UAAQ,cAAc;AAAA,IACpB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK,OAAO;AAEV,UAAI,eAAe,YAAY,eAAe,UAAU;AACtD,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS,YAAY,YAAY,kBAAkB,UAAU;AAAA,UAC7D,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AAGA,UAAI,eAAe,YAAY,OAAO,MAAM,KAAK,GAAG;AAClD,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS;AAAA,UACT,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AAGA,UAAI,iBAAiB,SAAS,iBAAiB,OAAO;AACpD,YAAI,eAAe,YAAY,CAAC,OAAO,UAAU,KAAK,GAAG;AACvD,iBAAO;AAAA,YACL,MAAAA;AAAA,YACA,SAAS;AAAA,YACT,UAAU;AAAA,YACV,QAAQ;AAAA,UACV;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ;AACX,UAAI,eAAe,WAAW;AAC5B,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS,yBAAyB,UAAU;AAAA,UAC5C,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,KAAK,UAAU;AACb,UAAI,eAAe,UAAU;AAC3B,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS,wBAAwB,UAAU;AAAA,UAC3C,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,KAAK,SAAS;AACZ,UAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,eAAO;AAAA,UACL,MAAAA;AAAA,UACA,SAAS,uBAAuB,UAAU;AAAA,UAC1C,UAAU;AAAA,UACV,QAAQ;AAAA,QACV;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,SAAS;AAGP;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAcO,SAAS,uBACd,YACA,cACU;AACV,QAAM,SAAS,+BAA+B,YAAY,YAAY;AACtE,SAAO,OAAO,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI;AACxC;AAaO,SAAS,+BACd,YACA,cACkB;AAClB,QAAM,SAA4B,CAAC;AAEnC,aAAW,SAAS,aAAa,QAAQ;AACvC,UAAMA,QAAO,MAAM;AACnB,UAAM,QAAQA,MAAK,MAAM,GAAG;AAI5B,QAAIC,WAAe;AACnB,QAAI,SAAS;AAEb,eAAW,QAAQ,OAAO;AACxB,UAAIA,aAAY,QAAQA,aAAY,UAAaA,SAAQ,IAAI,MAAM,QAAW;AAC5E,iBAAS;AACT;AAAA,MACF;AACA,MAAAA,WAAUA,SAAQ,IAAI;AAAA,IACxB;AAEA,QAAI,CAAC,QAAQ;AACX,aAAO,KAAK;AAAA,QACV,MAAAD;AAAA,QACA,SAAS;AAAA,QACT,UAAU,MAAM;AAAA,QAChB,QAAQ;AAAA,MACV,CAAC;AACD;AAAA,IACF;AAGA,UAAM,YAAY,kBAAkBC,UAAS,MAAM,MAAMD,KAAI;AAC7D,QAAI,WAAW;AACb,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,OAAO,OAAO,WAAW;AAAA,IACzB;AAAA,EACF;AACF;;;APlRA,SAAS,oBAAoB,OAAyB;AACpD,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,UAAU,SAAS,MAAM,SAAS;AAC1F;AAkBA,SAAS,uBAAuB,cAAqD;AACnF,QAAM,OAAO,gBAAgBE,MAAK,KAAK,QAAQ,IAAI,GAAG,WAAW;AACjE,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACAA,MAAK,KAAK,MAAM,eAAe;AAAA,IAC/BA,MAAK,KAAK,MAAM,qBAAqB;AAAA,IACrCA,MAAK,KAAK,MAAM,4BAA4B;AAAA,IAC5CA,MAAK,KAAK,MAAM,6BAA6B;AAAA,IAC7CA,MAAK,KAAK,MAAM,uBAAuB;AAAA,IACvCA,MAAK,KAAK,MAAM,iCAAiC;AAAA,IACjDA,MAAK,KAAK,MAAM,eAAe;AAAA,EACjC;AAEA,SAAO,CAAC,QAA6B;AACnC,eAAW,YAAY,eAAe;AACpC,UAAI;AACF,cAAM,WAAWA,MAAK,KAAK,UAAU,GAAG;AACxC,cAAM,UAAUC,cAAa,UAAU,OAAO;AAC9C,eAAO,SAAS,OAAO;AAAA,MACzB,SAAS,OAAO;AAGd,YAAI,oBAAoB,KAAK,GAAG;AAC9B;AAAA,QACF;AACA,cAAM;AAAA,MACR;AAAA,IACF;AACA,UAAM,IAAI;AAAA,MACR,gCAAgC,GAAG,oCAAoC,cAAc,KAAK,IAAI,CAAC;AAAA,IACjG;AAAA,EACF;AACF;AAyCA,eAAsB,QAAQ,SAYC;AAC7B,QAAM,OAAwB;AAAA,IAC5B,UAAU,QAAQ,YAAY;AAAA,IAC9B,OAAO,QAAQ,SAAS;AAAA;AAAA;AAAA;AAAA,IAIxB,UAAU;AAAA,IACV,iBAAiB,QAAQ;AAAA,EAC3B;AAGA,QAAM,SAAS,SAAS,QAAQ,GAAG;AAGnC,QAAM,cAAc,cAAc,QAAQ,WAAW;AACrD,QAAM,eAAe,cAAc,QAAQ,YAAY;AAGvD,QAAM,aAAa,kBAAkB,QAAQ,aAAa,QAAQ,YAAY;AAG9E,QAAM,UAA8B;AAAA,IAClC,KAAK;AAAA,IACL,aAAa,QAAQ;AAAA,IACrB,cAAc,QAAQ;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS;AAAA,IACT,iBAAiB,CAAC,SAAS,wBAAwB,IAAI;AAAA,IACvD,sBAAsB,CAAC,SAAS,qBAAyB,IAAI;AAAA,IAC7D,aAAa,kBAAkB;AAAA,IAC/B,cAAc,QAAQ,gBAAgB,uBAAuB,QAAQ,YAAY;AAAA;AAAA,IAEjF,sBAAsB,oBAAI,IAAI;AAAA;AAAA,IAE9B,cAAc,CAAC;AAAA,IACf,iBAAiB,oBAAI,IAAI;AAAA,EAC3B;AAGA,QAAM,SAAS,gBAAgB,QAAQ,OAAO;AAG9C,QAAM,EAAE,QAAQ,IAAI,IAAI,MAAM,sBAAsB,QAAQ,IAAI;AAGhE,QAAM,cAAc,oBAAoB,aAAa,cAAc,UAAU;AAC7E,QAAM,iBAAiB,uBAAuB,QAAQ,WAAW;AAEjE,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,KAAK,QAAQ,MAAM;AAAA,IACxB,gBAAgB,KAAK,QAAQ,SAAS;AAAA,EACxC;AACF;AAEA,SAAS,oBAAgD;AACvD,QAAM,WAAW,oBAAI,IAAoB;AACzC,SAAO,CAAC,WAAmB;AACzB,UAAM,QAAQ,SAAS,IAAI,MAAM,KAAK;AACtC,aAAS,IAAI,QAAQ,QAAQ,CAAC;AAC9B,WAAO,GAAG,MAAM,IAAI,KAAK;AAAA,EAC3B;AACF;","names":["ErrorCode","TokenType","Position","SourceLocation","offset","Parser","ref","parse","parser","DestructuringErrors","TokContext","Scope","Node","BranchID","RegExpValidationState","current","Token","parse","NodeType","path","path","ast","compiledExpr","literal","path","statements","branchCode","wrapperCode","sanitizeId","generateNodeEvaluationCode","data","dirname","data","module","current","Kind","createHash","path","readFileSync","path","lookahead","value","current","path","current","path","readFileSync"]}