@cuxt/sandboxjs 0.1.0 → 0.1.3

package/dist/umd/Sandbox.min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Sandbox.min.js","names":[],"sources":["../../src/utils/unraw.ts","../../src/utils/errors.ts","../../src/utils/CodeString.ts","../../src/utils/types.ts","../../src/utils/functionReplacements.ts","../../src/utils/Prop.ts","../../src/utils/Scope.ts","../../src/utils/ExecContext.ts","../../src/executor/opsRegistry.ts","../../src/executor/ops/prop.ts","../../src/executor/ops/call.ts","../../src/executor/ops/object.ts","../../src/executor/ops/literals.ts","../../src/executor/ops/unary.ts","../../src/executor/ops/assignment.ts","../../src/executor/ops/comparison.ts","../../src/executor/ops/variables.ts","../../src/executor/ops/misc.ts","../../src/executor/ops/functions.ts","../../src/executor/ops/control.ts","../../src/executor/executorUtils.ts","../../src/parser/lispTypes/conditionals.ts","../../src/parser/lispTypes/control.ts","../../src/parser/lispTypes/declarations.ts","../../src/parser/lispTypes/operators.ts","../../src/parser/lispTypes/structures.ts","../../src/parser/lispTypes/values.ts","../../src/parser/lispTypes/index.ts","../../src/parser/parserUtils.ts","../../src/eval/index.ts","../../src/SandboxExec.ts","../../src/Sandbox.ts"],"sourcesContent":["/**\n * Parse a string as a base-16 number. This is more strict than `parseInt` as it\n * will not allow any other characters, including (for example) \"+\", \"-\", and\n * \".\".\n * @param hex A string containing a hexadecimal number.\n * @returns The parsed integer, or `NaN` if the string is not a valid hex\n * number.\n */\nfunction parseHexToInt(hex: string): number {\n  const isOnlyHexChars = !hex.match(/[^a-f0-9]/i);\n  return isOnlyHexChars ? parseInt(hex, 16) : NaN;\n}\n\n/**\n * Check the validity and length of a hexadecimal code and optionally enforces\n * a specific number of hex digits.\n * @param hex The string to validate and parse.\n * @param errorName The name of the error message to throw a `SyntaxError` with\n * if `hex` is invalid. This is used to index `errorMessages`.\n * @param enforcedLength If provided, will throw an error if `hex` is not\n * exactly this many characters.\n * @returns The parsed hex number as a normal number.\n * @throws {SyntaxError} If the code is not valid.\n */\nfunction validateAndParseHex(hex: string, errorName: string, enforcedLength?: number): number {\n  const parsedHex = parseHexToInt(hex);\n  if (Number.isNaN(parsedHex) || (enforcedLength !== undefined && enforcedLength !== hex.length)) {\n    throw new SyntaxError(errorName + ': ' + hex);\n  }\n  return parsedHex;\n}\n\n/**\n * Parse a two-digit hexadecimal character escape code.\n * @param code The two-digit hexadecimal number that represents the character to\n * output.\n * @returns The single character represented by the code.\n * @throws {SyntaxError} If the code is not valid hex or is not the right\n * length.\n */\nfunction parseHexadecimalCode(code: string): string {\n  const parsedCode = validateAndParseHex(code, 'Malformed Hexadecimal', 2);\n  return String.fromCharCode(parsedCode);\n}\n\n/**\n * Parse a four-digit Unicode character escape code.\n * @param code The four-digit unicode number that represents the character to\n * output.\n * @param surrogateCode Optional four-digit unicode surrogate that represents\n * the other half of the character to output.\n * @returns The single character represented by the code.\n * @throws {SyntaxError} If the codes are not valid hex or are not the right\n * length.\n */\nfunction parseUnicodeCode(code: string, surrogateCode?: string): string {\n  const parsedCode = validateAndParseHex(code, 'Malformed Unicode', 4);\n\n  if (surrogateCode !== undefined) {\n    const parsedSurrogateCode = validateAndParseHex(surrogateCode, 'Malformed Unicode', 4);\n    return String.fromCharCode(parsedCode, parsedSurrogateCode);\n  }\n\n  return String.fromCharCode(parsedCode);\n}\n\n/**\n * Test if the text is surrounded by curly braces (`{}`).\n * @param text Text to check.\n * @returns `true` if the text is in the form `{*}`.\n */\nfunction isCurlyBraced(text: string): boolean {\n  return text.charAt(0) === '{' && text.charAt(text.length - 1) === '}';\n}\n\n/**\n * Parse a Unicode code point character escape code.\n * @param codePoint A unicode escape code point, including the surrounding curly\n * braces.\n * @returns The single character represented by the code.\n * @throws {SyntaxError} If the code is not valid hex or does not have the\n * surrounding curly braces.\n */\nfunction parseUnicodeCodePointCode(codePoint: string): string {\n  if (!isCurlyBraced(codePoint)) {\n    throw new SyntaxError('Malformed Unicode: +' + codePoint);\n  }\n  const withoutBraces = codePoint.slice(1, -1);\n  const parsedCode = validateAndParseHex(withoutBraces, 'Malformed Unicode');\n\n  try {\n    return String.fromCodePoint(parsedCode);\n  } catch (err) {\n    throw err instanceof RangeError ? new SyntaxError('Code Point Limit:' + parsedCode) : err;\n  }\n}\n\n/**\n * Map of unescaped letters to their corresponding special JS escape characters.\n * Intentionally does not include characters that map to themselves like \"\\'\".\n */\nconst singleCharacterEscapes = new Map<string, string>([\n  ['b', '\\b'],\n  ['f', '\\f'],\n  ['n', '\\n'],\n  ['r', '\\r'],\n  ['t', '\\t'],\n  ['v', '\\v'],\n  ['0', '\\0'],\n]);\n\n/**\n * Parse a single character escape sequence and return the matching character.\n * If none is matched, defaults to `code`.\n * @param code A single character code.\n */\nfunction parseSingleCharacterCode(code: string): string {\n  return singleCharacterEscapes.get(code) || code;\n}\n\n/**\n * Matches every escape sequence possible, including invalid ones.\n *\n * All capture groups (described below) are unique (only one will match), except\n * for 4, which can only potentially match if 3 does.\n *\n * **Capture Groups:**\n * 0. A single backslash\n * 1. Hexadecimal code\n * 2. Unicode code point code with surrounding curly braces\n * 3. Unicode escape code with surrogate\n * 4. Surrogate code\n * 5. Unicode escape code without surrogate\n * 6. Octal code _NOTE: includes \"0\"._\n * 7. A single character (will never be \\, x, u, or 0-3)\n */\nconst escapeMatch =\n  /\\\\(?:(\\\\)|x([\\s\\S]{0,2})|u(\\{[^}]*\\}?)|u([\\s\\S]{4})\\\\u([^{][\\s\\S]{0,3})|u([\\s\\S]{0,4})|([0-3]?[0-7]{1,2})|([\\s\\S])|$)/g;\n\n/**\n * Replace raw escape character strings with their escape characters.\n * @param raw A string where escape characters are represented as raw string\n * values like `\\'` rather than `'`.\n * @param allowOctals If `true`, will process the now-deprecated octal escape\n * sequences (ie, `\\111`).\n * @returns The processed string, with escape characters replaced by their\n * respective actual Unicode characters.\n */\nexport function unraw(raw: string): string {\n  return raw.replace(\n    escapeMatch,\n    function (\n      _,\n      backslash?: string,\n      hex?: string,\n      codePoint?: string,\n      unicodeWithSurrogate?: string,\n      surrogate?: string,\n      unicode?: string,\n      octal?: string,\n      singleCharacter?: string,\n    ): string {\n      // Compare groups to undefined because empty strings mean different errors\n      // Otherwise, `\\u` would fail the same as `\\` which is wrong.\n      if (backslash !== undefined) {\n        return '\\\\';\n      }\n      if (hex !== undefined) {\n        return parseHexadecimalCode(hex);\n      }\n      if (codePoint !== undefined) {\n        return parseUnicodeCodePointCode(codePoint);\n      }\n      if (unicodeWithSurrogate !== undefined) {\n        return parseUnicodeCode(unicodeWithSurrogate, surrogate);\n      }\n      if (unicode !== undefined) {\n        return parseUnicodeCode(unicode);\n      }\n      if (octal === '0') {\n        return '\\0';\n      }\n      if (octal !== undefined) {\n        throw new SyntaxError('Octal Deprecation: ' + octal);\n      }\n      if (singleCharacter !== undefined) {\n        return parseSingleCharacterCode(singleCharacter);\n      }\n      throw new SyntaxError('End of string');\n    },\n  );\n}\nexport default unraw;\n","import { IExecContext, IScope } from './types';\n\nexport class SandboxError extends Error {}\n\nexport class SandboxExecutionQuotaExceededError extends SandboxError {}\n\nexport class SandboxExecutionTreeError extends SandboxError {}\n\nexport class SandboxCapabilityError extends SandboxError {}\n\nexport class SandboxAccessError extends SandboxError {}\n","export class CodeString {\n  start: number;\n  end: number;\n  ref: { str: string };\n  constructor(str: string | CodeString) {\n    this.ref = { str: '' };\n    if (str instanceof CodeString) {\n      this.ref = str.ref;\n      this.start = str.start;\n      this.end = str.end;\n    } else {\n      this.ref.str = str;\n      this.start = 0;\n      this.end = str.length;\n    }\n  }\n\n  substring(start: number, end?: number): CodeString {\n    if (!this.length) return this;\n    start = this.start + start;\n    if (start < 0) {\n      start = 0;\n    }\n    if (start > this.end) {\n      start = this.end;\n    }\n    end = end === undefined ? this.end : this.start + end;\n    if (end < 0) {\n      end = 0;\n    }\n    if (end > this.end) {\n      end = this.end;\n    }\n    const code = new CodeString(this);\n    code.start = start;\n    code.end = end;\n    return code;\n  }\n\n  get length() {\n    const len = this.end - this.start;\n    return len < 0 ? 0 : len;\n  }\n\n  char(i: number) {\n    if (this.start === this.end) return undefined;\n    return this.ref.str[this.start + i];\n  }\n\n  toString() {\n    return this.ref.str.substring(this.start, this.end);\n  }\n\n  trimStart() {\n    const found = /^\\s+/.exec(this.toString());\n    const code = new CodeString(this);\n    if (found) {\n      code.start += found[0].length;\n    }\n    return code;\n  }\n\n  slice(start: number, end?: number) {\n    if (start < 0) {\n      start = this.end - this.start + start;\n    }\n    if (start < 0) {\n      start = 0;\n    }\n    if (end === undefined) {\n      end = this.end - this.start;\n    }\n\n    if (end < 0) {\n      end = this.end - this.start + end;\n    }\n    if (end < 0) {\n      end = 0;\n    }\n    return this.substring(start, end);\n  }\n\n  trim() {\n    const code = this.trimStart();\n    const found = /\\s+$/.exec(code.toString());\n    if (found) {\n      code.end -= found[0].length;\n    }\n    return code;\n  }\n\n  valueOf() {\n    return this.toString();\n  }\n}\n","// Reusable AsyncFunction constructor references\nexport const AsyncFunction: Function = Object.getPrototypeOf(async function () {}).constructor;\nexport const GeneratorFunction: Function = Object.getPrototypeOf(function* () {}).constructor;\nexport const AsyncGeneratorFunction: Function = Object.getPrototypeOf(\n  async function* () {},\n).constructor;\n\nimport type { IEvalContext } from '../eval';\nimport type { Change } from '../executor';\nimport type { IExecutionTree } from '../parser';\nimport type SandboxExec from '../SandboxExec';\nimport type { Scope } from './Scope';\n\nexport interface IOptionParams {\n  audit?: boolean;\n  forbidFunctionCalls?: boolean;\n  forbidFunctionCreation?: boolean;\n  prototypeWhitelist?: Map<Function, Set<string>>;\n  globals?: IGlobals;\n  symbolWhitelist?: ISymbolWhitelist;\n  executionQuota?: bigint;\n  nonBlocking?: boolean;\n  haltOnSandboxError?: boolean;\n  maxParserRecursionDepth?: number;\n  /**\n   * Additional function replacements to merge with the built-in tick-checking replacements.\n   * Maps a native function to a factory that receives the IContext and returns the replacement.\n   * When sandboxed code accesses a property that returns a mapped function, the factory is\n   * called once per context and the result is cached and returned instead.\n   */\n  functionReplacements?: Map<Function, (ctx: IContext) => Function>;\n}\n\nexport interface IOptions {\n  audit: boolean;\n  forbidFunctionCalls: boolean;\n  forbidFunctionCreation: boolean;\n  prototypeWhitelist: Map<Function, Set<PropertyKey>>;\n  globals: IGlobals;\n  symbolWhitelist: ISymbolWhitelist;\n  executionQuota?: bigint;\n  haltOnSandboxError?: boolean;\n  maxParserRecursionDepth: number;\n  nonBlocking: boolean;\n  functionReplacements: Map<\n    Function,\n    (ctx: IExecContext, builtInReplacement?: Function) => Function\n  >;\n}\n\nexport interface IContext {\n  sandbox: SandboxExec;\n  globalScope: Scope;\n  sandboxGlobal: ISandboxGlobal;\n  globalsWhitelist: Set<any>;\n  prototypeWhitelist: Map<any, Set<PropertyKey>>;\n  sandboxedFunctions: WeakSet<Function>;\n  sandboxSymbols: SandboxSymbolContext;\n  options: IOptions;\n  auditReport?: IAuditReport;\n  ticks: Ticks;\n}\n\nexport interface IAuditReport {\n  globalsAccess: Set<unknown>;\n  prototypeAccess: { [name: string]: Set<PropertyKey> };\n}\n\nexport interface Ticks {\n  ticks: bigint;\n  tickLimit?: bigint;\n  nextYield?: bigint;\n}\n\nexport type SubscriptionSubject = object;\n\nexport type HaltContext =\n  | {\n      type: 'error';\n      error: Error;\n      ticks: Ticks;\n      scope: Scope;\n      context: IExecContext;\n    }\n  | {\n      type: 'manual';\n      error?: never;\n      ticks?: never;\n      scope?: never;\n      context?: never;\n    }\n  | {\n      type: 'yield';\n      error?: never;\n      ticks?: never;\n      scope?: never;\n      context?: never;\n    };\n\nexport interface IExecContext extends IExecutionTree {\n  ctx: IContext;\n  getSubscriptions: Set<(obj: SubscriptionSubject, name: string) => void>;\n  setSubscriptions: WeakMap<SubscriptionSubject, Map<string, Set<(modification: Change) => void>>>;\n  changeSubscriptions: WeakMap<SubscriptionSubject, Set<(modification: Change) => void>>;\n  setSubscriptionsGlobal: WeakMap<\n    SubscriptionSubject,\n    Map<string, Set<(modification: Change) => void>>\n  >;\n  changeSubscriptionsGlobal: WeakMap<SubscriptionSubject, Set<(modification: Change) => void>>;\n  registerSandboxFunction: (fn: (...args: any[]) => any) => void;\n  evals: Map<Function, Function>;\n  allowJit: boolean;\n  evalContext?: IEvalContext;\n}\n\nexport interface ISandboxGlobal {\n  [key: string]: unknown;\n}\n\nexport interface ISymbolWhitelist {\n  [key: string]: symbol;\n}\n\nexport interface SandboxSymbolContext {\n  ctor?: Function;\n  registry: Map<string, symbol>;\n  reverseRegistry: Map<symbol, string>;\n  whitelist: ISymbolWhitelist;\n}\n\nexport type IGlobals = ISandboxGlobal;\n\nexport interface IScope {\n  [key: string]: any;\n}\n\nexport const NON_BLOCKING_THRESHOLD = 50_000n;\n\nexport const reservedWords = new Set([\n  'await',\n  'break',\n  'case',\n  'catch',\n  'class',\n  'const',\n  'continue',\n  'debugger',\n  'default',\n  'delete',\n  'do',\n  'else',\n  'enum',\n  'export',\n  'extends',\n  'false',\n  'finally',\n  'for',\n  'function',\n  'if',\n  'implements',\n  'import',\n  'in',\n  'instanceof',\n  'let',\n  'new',\n  'null',\n  'return',\n  'super',\n  'switch',\n  'this',\n  'throw',\n  'true',\n  'try',\n  'typeof',\n  'var',\n  'void',\n  'while',\n  'with',\n]);\n\nexport const enum VarType {\n  let = 'let',\n  const = 'const',\n  var = 'var',\n  internal = 'internal',\n}\n\nexport const enum LispType {\n  None,\n  Prop,\n  StringIndex,\n  Let,\n  Const,\n  Call,\n  KeyVal,\n  Number,\n  Return,\n  Assign,\n  InlineFunction,\n  ArrowFunction,\n  CreateArray,\n  If,\n  IfCase,\n  InlineIf,\n  InlineIfCase,\n  SpreadObject,\n  SpreadArray,\n  ArrayProp,\n  PropOptional,\n  CallOptional,\n  CreateObject,\n  Group,\n  Not,\n  IncrementBefore,\n  IncrementAfter,\n  DecrementBefore,\n  DecrementAfter,\n  And,\n  Or,\n  StrictNotEqual,\n  StrictEqual,\n  Plus,\n  Var,\n  GlobalSymbol,\n  Literal,\n  Function,\n  Loop,\n  Try,\n  Switch,\n  SwitchCase,\n  InternalBlock,\n  Expression,\n  Await,\n  New,\n  Throw,\n  Minus,\n  Divide,\n  Power,\n  Multiply,\n  Modulus,\n  Equal,\n  NotEqual,\n  SmallerEqualThan,\n  LargerEqualThan,\n  SmallerThan,\n  LargerThan,\n  Negative,\n  Positive,\n  Typeof,\n  Delete,\n  Instanceof,\n  In,\n  Inverse,\n  SubractEquals,\n  AddEquals,\n  DivideEquals,\n  PowerEquals,\n  MultiplyEquals,\n  ModulusEquals,\n  BitNegateEquals,\n  BitAndEquals,\n  BitOrEquals,\n  UnsignedShiftRightEquals,\n  ShiftRightEquals,\n  ShiftLeftEquals,\n  BitAnd,\n  BitOr,\n  BitNegate,\n  BitShiftLeft,\n  BitShiftRight,\n  BitUnsignedShiftRight,\n  BigInt,\n  LiteralIndex,\n  RegexIndex,\n  LoopAction,\n  Void,\n  True,\n  NullishCoalescing,\n  AndEquals,\n  OrEquals,\n  NullishCoalescingEquals,\n  Block,\n  Labeled,\n  Internal,\n  Yield,\n  YieldDelegate,\n  Hole,\n\n  LispEnumSize,\n}\n","import type { IContext, IExecContext } from './types';\nimport { SandboxExecutionQuotaExceededError } from './errors';\n\n/**\n * Checks if adding `expectTicks` would exceed the tick limit, and throws SandboxExecutionQuotaExceededError\n * (which bypasses user try/catch) if so. Otherwise increments the tick counter.\n */\nexport function checkTicksAndThrow(ctx: IExecContext, expectTicks: bigint): void {\n  const { ticks } = ctx.ctx;\n  if (ticks.tickLimit !== undefined && ticks.tickLimit <= ticks.ticks + expectTicks) {\n    throw new SandboxExecutionQuotaExceededError('Execution quota exceeded');\n  }\n  ticks.ticks += expectTicks;\n}\n\n// ---------------------------------------------------------------------------\n// TypedArray shared prototype detection (mirrors call.ts)\n// ---------------------------------------------------------------------------\n\nconst _typedArrayCtors = [\n  Int8Array,\n  Uint8Array,\n  Uint8ClampedArray,\n  Int16Array,\n  Uint16Array,\n  Int32Array,\n  Uint32Array,\n  Float32Array,\n  Float64Array,\n];\nexport const typedArrayProtos = new Set(\n  _typedArrayCtors.map((T) => Object.getPrototypeOf(T.prototype) as any),\n);\n\nfunction isTypedArray(obj: unknown): obj is { length: number } {\n  return (\n    ArrayBuffer.isView(obj) &&\n    !(obj instanceof DataView) &&\n    typedArrayProtos.has(Object.getPrototypeOf(Object.getPrototypeOf(obj)))\n  );\n}\n\n// ---------------------------------------------------------------------------\n// Helpers to build replacements\n// ---------------------------------------------------------------------------\n\ntype Factory = (ctx: IExecContext) => Function;\n\nfunction makeReplacement(\n  original: Function,\n  getTicks: (thisArg: unknown, args: unknown[]) => bigint,\n): Factory {\n  return (ctx: IExecContext) =>\n    function (this: unknown, ...args: unknown[]) {\n      checkTicksAndThrow(ctx, getTicks(this, args));\n      return (original as any).apply(this, args);\n    };\n}\n\n// ---------------------------------------------------------------------------\n// Array replacements\n// ---------------------------------------------------------------------------\n\nconst arr: any[] = [];\nconst arrProto = Array.prototype as any;\n\nfunction arrayTicks(\n  complexity: 'one' | 'n' | 'nlogn' | 'arrs',\n  original: Function,\n): (thisArg: unknown, args: unknown[]) => bigint {\n  return (thisArg, args) => {\n    if (!Array.isArray(thisArg)) return 0n;\n    const n = BigInt(thisArg.length);\n    switch (complexity) {\n      case 'one':\n        return 1n;\n      case 'n':\n        return n;\n      case 'nlogn':\n        return thisArg.length <= 1 ? 1n : n * BigInt(Math.round(Math.log2(thisArg.length)));\n      case 'arrs': {\n        let ticks = 0n;\n        const maxDepth = original === arr.flat ? (typeof args[0] === 'number' ? args[0] : 1) : 1;\n        const recurse = (a: unknown[], depth = 0) => {\n          ticks += BigInt(a.length);\n          if (depth >= maxDepth) return;\n          for (const item of a) {\n            if (Array.isArray(item)) recurse(item, depth + 1);\n          }\n        };\n        recurse(thisArg);\n        return ticks;\n      }\n    }\n  };\n}\n\nconst arrayReplacementDefs: [Function, 'one' | 'n' | 'nlogn' | 'arrs'][] = [\n  // O(1)\n  [arr.push, 'one'],\n  [arr.pop, 'one'],\n  [arrProto.at, 'one'],\n  // O(n)\n  [arr.fill, 'n'],\n  [arr.includes, 'n'],\n  [arr.indexOf, 'n'],\n  [arr.lastIndexOf, 'n'],\n  [arr.find, 'n'],\n  [arr.findIndex, 'n'],\n  [arrProto.findLast, 'n'],\n  [arrProto.findLastIndex, 'n'],\n  [arr.forEach, 'n'],\n  [arr.map, 'n'],\n  [arr.filter, 'n'],\n  [arr.reduce, 'n'],\n  [arr.reduceRight, 'n'],\n  [arr.every, 'n'],\n  [arr.some, 'n'],\n  [arr.join, 'n'],\n  [arr.reverse, 'n'],\n  [arr.shift, 'n'],\n  [arr.unshift, 'n'],\n  [arr.splice, 'n'],\n  [arr.slice, 'n'],\n  [arr.copyWithin, 'n'],\n  [arr.entries, 'n'],\n  [arr.keys, 'n'],\n  [arr.values, 'n'],\n  [arrProto.toReversed, 'n'],\n  [arrProto.toSpliced, 'n'],\n  [arrProto.with, 'n'],\n  [arr.toString, 'n'],\n  [arr.toLocaleString, 'n'],\n  // O(n log n)\n  [arr.sort, 'nlogn'],\n  [arrProto.toSorted, 'nlogn'],\n  // O(n) across arrays\n  [arr.flat, 'arrs'],\n  [arr.flatMap, 'arrs'],\n  [arr.concat, 'arrs'],\n];\n\n// ---------------------------------------------------------------------------\n// String replacements\n// ---------------------------------------------------------------------------\n\nconst str = '';\nconst strProto = String.prototype as any;\n\nfunction stringTicks(complexity: 'one' | 'n'): (thisArg: unknown, _args: unknown[]) => bigint {\n  return (thisArg) => {\n    if (typeof thisArg !== 'string') return 0n;\n    return complexity === 'one' ? 1n : BigInt(thisArg.length);\n  };\n}\n\nconst stringReplacementDefs: [Function, 'one' | 'n'][] = [\n  // O(1)\n  [str.charAt, 'one'],\n  [str.charCodeAt, 'one'],\n  [str.codePointAt, 'one'],\n  [strProto.at, 'one'],\n  // O(n)\n  [str.indexOf, 'n'],\n  [str.lastIndexOf, 'n'],\n  [str.includes, 'n'],\n  [str.startsWith, 'n'],\n  [str.endsWith, 'n'],\n  [str.slice, 'n'],\n  [str.substring, 'n'],\n  [str.padStart, 'n'],\n  [str.padEnd, 'n'],\n  [str.repeat, 'n'],\n  [str.split, 'n'],\n  [str.replace, 'n'],\n  [strProto.replaceAll, 'n'],\n  [str.match, 'n'],\n  [str.matchAll, 'n'],\n  [str.search, 'n'],\n  [str.trim, 'n'],\n  [str.trimStart, 'n'],\n  [str.trimEnd, 'n'],\n  [str.toLowerCase, 'n'],\n  [str.toUpperCase, 'n'],\n  [str.toLocaleLowerCase, 'n'],\n  [str.toLocaleUpperCase, 'n'],\n  [str.normalize, 'n'],\n  [str.concat, 'n'],\n  [str.toString, 'n'],\n  [str.valueOf, 'n'],\n];\n\n// ---------------------------------------------------------------------------\n// Map replacements\n// ---------------------------------------------------------------------------\n\nconst _map = new Map<never, never>();\n\nconst mapReplacementDefs: [Function, 'one' | 'n'][] = [\n  [_map.get, 'one'],\n  [_map.set, 'one'],\n  [_map.has, 'one'],\n  [_map.delete, 'one'],\n  [_map.keys, 'n'],\n  [_map.values, 'n'],\n  [_map.entries, 'n'],\n  [_map.forEach, 'n'],\n  [_map.clear, 'n'],\n];\n\nfunction mapTicks(complexity: 'one' | 'n'): (thisArg: unknown, _args: unknown[]) => bigint {\n  return (thisArg) => {\n    if (!(thisArg instanceof Map)) return 0n;\n    return complexity === 'one' ? 1n : BigInt(thisArg.size);\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Set replacements\n// ---------------------------------------------------------------------------\n\nconst _set = new Set<never>();\n\nconst setReplacementDefs: [Function, 'one' | 'n'][] = [\n  [_set.add, 'one'],\n  [_set.has, 'one'],\n  [_set.delete, 'one'],\n  [_set.values, 'n'],\n  [_set.keys, 'n'],\n  [_set.entries, 'n'],\n  [_set.forEach, 'n'],\n  [_set.clear, 'n'],\n];\n\nfunction setTicks(complexity: 'one' | 'n'): (thisArg: unknown, _args: unknown[]) => bigint {\n  return (thisArg) => {\n    if (!(thisArg instanceof Set)) return 0n;\n    return complexity === 'one' ? 1n : BigInt(thisArg.size);\n  };\n}\n\n// ---------------------------------------------------------------------------\n// TypedArray replacements\n// ---------------------------------------------------------------------------\n\nconst typedArrayReplacementDefs: [Function, 'one' | 'n' | 'nlogn'][] = [];\nfor (const proto of typedArrayProtos) {\n  if (proto.at) typedArrayReplacementDefs.push([proto.at, 'one']);\n  if (proto.set) typedArrayReplacementDefs.push([proto.set, 'one']);\n  const nMethods = [\n    'fill',\n    'find',\n    'findIndex',\n    'findLast',\n    'findLastIndex',\n    'includes',\n    'indexOf',\n    'lastIndexOf',\n    'forEach',\n    'map',\n    'filter',\n    'reduce',\n    'reduceRight',\n    'every',\n    'some',\n    'join',\n    'reverse',\n    'slice',\n    'subarray',\n    'copyWithin',\n    'entries',\n    'keys',\n    'values',\n    'toReversed',\n    'with',\n    'toString',\n    'toLocaleString',\n  ] as const;\n  for (const m of nMethods) {\n    if (proto[m]) typedArrayReplacementDefs.push([proto[m], 'n']);\n  }\n  if (proto.sort) typedArrayReplacementDefs.push([proto.sort, 'nlogn']);\n  if (proto.toSorted) typedArrayReplacementDefs.push([proto.toSorted, 'nlogn']);\n}\n\nfunction typedArrayTicks(\n  complexity: 'one' | 'n' | 'nlogn',\n): (thisArg: unknown, _args: unknown[]) => bigint {\n  return (thisArg) => {\n    if (!isTypedArray(thisArg)) return 0n;\n    const n = BigInt(thisArg.length);\n    switch (complexity) {\n      case 'one':\n        return 1n;\n      case 'n':\n        return n;\n      case 'nlogn':\n        return (thisArg as any).length <= 1\n          ? 1n\n          : n * BigInt(Math.round(Math.log2((thisArg as any).length)));\n    }\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Math replacements\n// ---------------------------------------------------------------------------\n\nconst mathReplacementDefs: [Function][] = [[Math.max], [Math.min], [Math.hypot]];\n\n// ---------------------------------------------------------------------------\n// JSON replacements\n// ---------------------------------------------------------------------------\n\n// (JSON.stringify with subscription traversal is handled separately in LispType.Call)\n\n// ---------------------------------------------------------------------------\n// RegExp replacements\n// ---------------------------------------------------------------------------\n\nconst _re = /x/;\n\nconst regexpReplacementDefs: Function[] = [\n  _re.exec,\n  _re.test,\n  (_re as any)[Symbol.match],\n  (_re as any)[Symbol.matchAll],\n  (_re as any)[Symbol.replace],\n  (_re as any)[Symbol.search],\n  (_re as any)[Symbol.split],\n];\n\n// ---------------------------------------------------------------------------\n// Promise replacements\n// ---------------------------------------------------------------------------\n\nconst promiseReplacementDefs: Function[] = [\n  Promise.all,\n  Promise.allSettled,\n  Promise.race,\n  ...(typeof (Promise as any).any === 'function' ? [(Promise as any).any] : []),\n];\n\n// ---------------------------------------------------------------------------\n// Object replacements\n// ---------------------------------------------------------------------------\n\nconst objectReplacementDefs: [Function, 'one' | 'n'][] = [\n  [Object.prototype.hasOwnProperty, 'one'],\n  [Object.prototype.propertyIsEnumerable, 'one'],\n  [Object.prototype.isPrototypeOf, 'one'],\n  [Object.create, 'one'],\n  [Object.getPrototypeOf, 'one'],\n  [Object.setPrototypeOf, 'one'],\n  [Object.is, 'one'],\n  [Object.defineProperty, 'one'],\n  [Object.getOwnPropertyDescriptor, 'one'],\n  [Object.isExtensible, 'one'],\n  [Object.preventExtensions, 'one'],\n  [Object.keys, 'n'],\n  [Object.values, 'n'],\n  [Object.entries, 'n'],\n  [Object.assign, 'n'],\n  [Object.fromEntries, 'n'],\n  [Object.getOwnPropertyNames, 'n'],\n  [Object.getOwnPropertySymbols, 'n'],\n  [Object.getOwnPropertyDescriptors, 'n'],\n  [Object.freeze, 'n'],\n  [Object.seal, 'n'],\n  [Object.isFrozen, 'n'],\n  [Object.isSealed, 'n'],\n];\n\nfunction objectTicks(\n  complexity: 'one' | 'n',\n  isStatic: boolean,\n): (thisArg: unknown, args: unknown[]) => bigint {\n  return (thisArg, args) => {\n    if (complexity === 'one') return 1n;\n    const target = isStatic ? args[0] : thisArg;\n    if (target !== null && typeof target === 'object')\n      return BigInt(Object.keys(target as object).length);\n    return 1n;\n  };\n}\n\n// Static Object methods whose tick count is based on args[0] key count\nconst staticObjectMethods = new Set<Function>([\n  Object.keys,\n  Object.values,\n  Object.entries,\n  Object.assign,\n  Object.fromEntries,\n  Object.getOwnPropertyNames,\n  Object.getOwnPropertySymbols,\n  Object.getOwnPropertyDescriptors,\n  Object.freeze,\n  Object.seal,\n  Object.isFrozen,\n  Object.isSealed,\n]);\n\n// ---------------------------------------------------------------------------\n// Array.from / Array.fromAsync\n// ---------------------------------------------------------------------------\n\n// ---------------------------------------------------------------------------\n// Build the default replacements map\n// ---------------------------------------------------------------------------\n\nexport const DEFAULT_FUNCTION_REPLACEMENTS = new Map<Function, Factory>();\nexport const THIS_DEPENDENT_FUNCTION_REPLACEMENTS = new Set<Function>();\n\n// Array\nfor (const [original, complexity] of arrayReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, arrayTicks(complexity, original)),\n  );\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// String\nfor (const [original, complexity] of stringReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, stringTicks(complexity)));\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// Map\nfor (const [original, complexity] of mapReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, mapTicks(complexity)));\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// Set\nfor (const [original, complexity] of setReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(original, makeReplacement(original, setTicks(complexity)));\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// TypedArray\nfor (const [original, complexity] of typedArrayReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, typedArrayTicks(complexity)),\n  );\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// Math — O(n) on arg count\nfor (const [original] of mathReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, (_thisArg, args) => BigInt(args.length)),\n  );\n}\n\n// JSON — O(n) on string/object size\nfor (const original of [JSON.parse, JSON.stringify]) {\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, (_thisArg, args) => {\n      const target = args[0];\n      if (typeof target === 'string') return BigInt(target.length);\n      if (target !== null && typeof target === 'object')\n        return BigInt(Object.keys(target as object).length);\n      return 1n;\n    }),\n  );\n}\n\n// RegExp — O(n) on input string length\nfor (const original of regexpReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, (_thisArg, args) => {\n      const input = args[0];\n      return typeof input === 'string' ? BigInt(input.length) : 1n;\n    }),\n  );\n  THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n}\n\n// Promise.all/allSettled/race/any — O(n) on iterable length\nfor (const original of promiseReplacementDefs) {\n  if (!original) continue;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, (_thisArg, args) => {\n      const iterable = args[0];\n      return Array.isArray(iterable) ? BigInt(iterable.length) : 0n;\n    }),\n  );\n}\n\n// Object static & instance methods\nfor (const [original, complexity] of objectReplacementDefs) {\n  if (!original) continue;\n  const isStatic = staticObjectMethods.has(original);\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    original,\n    makeReplacement(original, objectTicks(complexity, isStatic)),\n  );\n  if (!isStatic) {\n    THIS_DEPENDENT_FUNCTION_REPLACEMENTS.add(original);\n  }\n}\n\n// Array.from — O(n) on source length\nif (Array.from) {\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    Array.from,\n    makeReplacement(Array.from, (_thisArg, args) => {\n      const source = args[0];\n      if (source != null && typeof (source as any).length === 'number')\n        return BigInt((source as any).length);\n      return 0n;\n    }),\n  );\n}\n\n// Array.fromAsync — O(n) on source length (if available)\nif (typeof (Array as any).fromAsync === 'function') {\n  const fromAsync = (Array as any).fromAsync as Function;\n  DEFAULT_FUNCTION_REPLACEMENTS.set(\n    fromAsync,\n    makeReplacement(fromAsync, (_thisArg, args) => {\n      const source = args[0];\n      if (source != null && typeof (source as any).length === 'number')\n        return BigInt((source as any).length);\n      return 0n;\n    }),\n  );\n}\n","import type { IExecContext } from './types';\nimport { THIS_DEPENDENT_FUNCTION_REPLACEMENTS } from './functionReplacements';\n\nconst boundFunctionCache = new WeakMap<Function, WeakMap<object, Function>>();\nconst replacementReceiver = new WeakMap<Function, object>();\n\nexport class Prop<T = unknown> {\n  constructor(\n    public context: T,\n    public prop: PropertyKey,\n    public isConst = false,\n    public isGlobal = false,\n    public isVariable = false,\n    public isInternal = false,\n  ) {}\n\n  get<T = unknown>(context: IExecContext): T {\n    const ctx = this.context;\n    if (ctx === undefined) throw new ReferenceError(`${this.prop.toString()} is not defined`);\n    if (ctx === null)\n      throw new TypeError(`Cannot read properties of null, (reading '${this.prop.toString()}')`);\n    context.getSubscriptions.forEach((cb) => cb(ctx, this.prop.toString()));\n    const val = (ctx as any)[this.prop];\n    return getReplacementValue(val, context, ctx) as T;\n  }\n}\n\nexport function hasOwnProperty(obj: unknown, prop: PropertyKey): boolean {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nexport function getReplacementReceiver(fn: Function) {\n  return replacementReceiver.get(fn);\n}\n\nexport function resolveSandboxProp(val: unknown, context: IExecContext, prop?: Prop) {\n  if (!val) return;\n  if (val instanceof Prop) {\n    if (!prop) {\n      prop = val;\n    }\n    val = val.get(context);\n  }\n  const p = prop?.prop || 'prop';\n  if (val === globalThis) {\n    return new Prop(\n      {\n        [p]: context.ctx.sandboxGlobal,\n      },\n      p,\n      prop?.isConst || false,\n      false,\n      prop?.isVariable || false,\n    );\n  }\n  if (prop && !prop.isVariable) {\n    return;\n  }\n  const replacement = getReplacementValue(val, context, prop?.context);\n  if (replacement !== val) {\n    return new Prop(\n      { [p]: replacement },\n      p,\n      prop?.isConst || false,\n      prop?.isGlobal || false,\n      prop?.isVariable || false,\n    );\n  }\n}\n\nfunction getReplacementValue(val: unknown, context: IExecContext, bindContext?: unknown) {\n  if (typeof val !== 'function') {\n    return val;\n  }\n  const replacement = context.evals.get(val as Function);\n  if (replacement === undefined) {\n    return val;\n  }\n  if (!shouldBindReplacement(val as Function, bindContext, context)) {\n    return replacement;\n  }\n  return bindReplacement(replacement, bindContext as object, val as Function, context);\n}\n\nfunction shouldBindReplacement(original: Function, bindContext: unknown, context: IExecContext) {\n  return (\n    THIS_DEPENDENT_FUNCTION_REPLACEMENTS.has(original) &&\n    bindContext !== null &&\n    (typeof bindContext === 'object' || typeof bindContext === 'function') &&\n    bindContext !== context.ctx.sandboxGlobal &&\n    !context.ctx.globalsWhitelist.has(bindContext)\n  );\n}\n\nfunction bindReplacement(\n  replacement: Function,\n  bindContext: object,\n  original: Function,\n  context: IExecContext,\n) {\n  let cache = boundFunctionCache.get(replacement);\n  if (!cache) {\n    cache = new WeakMap<object, Function>();\n    boundFunctionCache.set(replacement, cache);\n  }\n\n  let bound = cache.get(bindContext);\n  if (bound) {\n    return bound;\n  }\n\n  bound = function (this: unknown, ...args: unknown[]) {\n    return replacement.apply(this, args);\n  };\n\n  redefineFunctionMetadata(bound, original);\n  context.ctx.sandboxedFunctions.add(bound);\n  replacementReceiver.set(bound, bindContext);\n  cache.set(bindContext, bound);\n  return bound;\n}\n\nfunction redefineFunctionMetadata(\n  target: Function,\n  source: Function,\n  overrides: Partial<Record<'name' | 'length', string | number>> = {},\n) {\n  for (const key of ['name', 'length'] as const) {\n    const descriptor = Object.getOwnPropertyDescriptor(source, key);\n    if (descriptor?.configurable) {\n      Object.defineProperty(target, key, {\n        ...descriptor,\n        value: overrides[key] ?? source[key],\n      });\n    }\n  }\n}\n","import { reservedWords, VarType } from './types';\nimport { Prop, resolveSandboxProp, hasOwnProperty } from './Prop';\nimport { SandboxError } from './errors';\nimport type { IExecContext, IScope } from './types';\n\nfunction keysOnly(obj: unknown): Record<string, true> {\n  const ret: Record<string, true> = Object.assign({}, obj);\n  for (const key in ret) {\n    ret[key] = true;\n  }\n  return ret;\n}\n\nexport type Unknown = undefined | null | Record<string | number, unknown>;\n\nexport class Scope {\n  parent: Scope | null;\n  const: { [key: string]: true } = {};\n  let: { [key: string]: true } = {};\n  var: { [key: string]: true } = {};\n  internal: { [key: string]: true } = {};\n  globals: { [key: string]: true };\n  allVars: { [key: string]: unknown } & object;\n  internalVars: { [key: string]: unknown } = {};\n  functionThis?: Unknown;\n  constructor(parent: Scope | null, vars = {}, functionThis?: Unknown) {\n    const isFuncScope = functionThis !== undefined || parent === null;\n    this.parent = parent;\n    this.allVars = vars;\n    this.let = isFuncScope ? this.let : keysOnly(vars);\n    this.var = isFuncScope ? keysOnly(vars) : this.var;\n    this.globals = parent === null ? keysOnly(vars) : {};\n    this.functionThis = functionThis;\n  }\n\n  get(key: string, internal: boolean): Prop {\n    const isThis = key === 'this';\n    const scope = this.getWhereValScope(key, isThis, internal);\n    if (scope && isThis) {\n      return new Prop({ this: scope.functionThis }, key, false, false, true);\n    }\n    if (!scope) {\n      return new Prop(undefined, key);\n    }\n    if (internal && scope.internalVars[key]) {\n      return new Prop(scope.internalVars, key, false, false, true, true);\n    }\n    return new Prop(\n      scope.allVars,\n      key,\n      hasOwnProperty(scope.const, key),\n      hasOwnProperty(scope.globals, key),\n      true,\n    );\n  }\n\n  set(key: string, val: unknown, internal: boolean) {\n    if (key === 'this') throw new SyntaxError('\"this\" cannot be assigned');\n    if (reservedWords.has(key)) throw new SyntaxError(\"Unexepected token '\" + key + \"'\");\n    const prop = this.get(key, internal);\n    if (prop.context === undefined) {\n      throw new ReferenceError(`Variable '${key}' was not declared.`);\n    }\n    if (prop.context === null) {\n      throw new TypeError(`Cannot set properties of null, (setting '${key}')`);\n    }\n    if (prop.isConst) {\n      throw new TypeError(`Assignment to constant variable`);\n    }\n    if (prop.isGlobal) {\n      throw new SandboxError(`Cannot override global variable '${key}'`);\n    }\n    (prop.context as any)[prop.prop] = val;\n    return prop;\n  }\n\n  getWhereValScope(key: string, isThis: boolean, internal: boolean): Scope | null {\n    let scope: Scope = this;\n    if (isThis) {\n      do {\n        if (scope.functionThis !== undefined) return scope;\n        scope = scope.parent!;\n      } while (scope !== null);\n      return null;\n    }\n    do {\n      if (\n        internal &&\n        key in scope.internalVars &&\n        !(key in {} && !hasOwnProperty(scope.internalVars, key))\n      ) {\n        return scope;\n      }\n      if (key in scope.allVars && !(key in {} && !hasOwnProperty(scope.allVars, key))) {\n        return scope;\n      }\n      scope = scope.parent!;\n    } while (scope !== null);\n    return null;\n  }\n\n  getWhereVarScope(key: string, localScope: boolean, internal: boolean): Scope {\n    let scope: Scope = this;\n    do {\n      if (\n        internal &&\n        key in scope.internalVars &&\n        !(key in {} && !hasOwnProperty(scope.internalVars, key))\n      ) {\n        return scope;\n      }\n      if (key in scope.allVars && !(key in {} && !hasOwnProperty(scope.allVars, key))) {\n        return scope;\n      }\n      if (scope.parent === null || localScope || scope.functionThis !== undefined) {\n        return scope;\n      }\n      scope = scope.parent!;\n    } while (scope !== null);\n    return scope;\n  }\n\n  declare(key: string, type: VarType, value: unknown, isGlobal: boolean, internal: boolean): Prop {\n    if (key === 'this') throw new SyntaxError('\"this\" cannot be declared');\n    if (reservedWords.has(key)) throw new SyntaxError(\"Unexepected token '\" + key + \"'\");\n    const existingScope = this.getWhereVarScope(key, type !== VarType.var, internal);\n    if (type === VarType.var) {\n      if (existingScope.var[key]) {\n        existingScope.allVars[key] = value;\n        if (!isGlobal) {\n          delete existingScope.globals[key];\n        } else {\n          existingScope.globals[key] = true;\n        }\n        return new Prop(existingScope.allVars, key, false, existingScope.globals[key], true);\n      } else if (key in existingScope.allVars) {\n        throw new SyntaxError(`Identifier '${key}' has already been declared`);\n      }\n    }\n    if (key in existingScope.allVars || key in existingScope.internalVars) {\n      throw new SyntaxError(`Identifier '${key}' has already been declared`);\n    }\n\n    if (isGlobal) {\n      existingScope.globals[key] = true;\n    }\n    existingScope[type][key] = true;\n    if (type === VarType.internal) {\n      existingScope.internalVars[key] = value;\n    } else {\n      existingScope.allVars[key] = value;\n    }\n\n    return new Prop(\n      type === VarType.internal ? this.internalVars : this.allVars,\n      key,\n      type === VarType.const,\n      isGlobal,\n      true,\n      type === VarType.internal,\n    );\n  }\n}\n\nexport class FunctionScope implements IScope {}\n\nexport class LocalScope implements IScope {}\n\nexport const optional = {};\n\nexport class DelayedSynchronousResult {\n  readonly result: unknown;\n  constructor(cb: () => unknown) {\n    this.result = cb();\n  }\n}\n\nexport function delaySynchronousResult(cb: () => Promise<unknown>) {\n  return new DelayedSynchronousResult(cb);\n}\n\nexport function sanitizeProp(\n  value: unknown,\n  context: IExecContext,\n  cache = new WeakSet<object>(),\n): unknown {\n  if (value === null || (typeof value !== 'object' && typeof value !== 'function')) return value;\n\n  value = resolveSandboxProp(value, context) || value;\n\n  if (value instanceof Prop) {\n    value = value.get(context);\n  }\n\n  if (value === optional) {\n    return undefined;\n  }\n\n  return value;\n}\n\nexport function sanitizeScope(scope: IScope, context: IExecContext, cache = new WeakSet<object>()) {\n  if (cache.has(scope)) return;\n  cache.add(scope);\n  for (const key in scope) {\n    const val = scope[key];\n    if (val !== null && typeof val === 'object') {\n      sanitizeScope(val, context, cache);\n    }\n    scope[key] = sanitizeProp(val, context);\n  }\n}\n\nexport function sanitizeScopes(\n  scopes: IScope[],\n  context: IExecContext,\n  cache = new WeakSet<object>(),\n) {\n  for (const scope of scopes) {\n    sanitizeScope(scope, context, cache);\n  }\n}\n","import type { IEvalContext } from '../eval';\nimport type { Change } from '../executor';\nimport { DEFAULT_FUNCTION_REPLACEMENTS } from './functionReplacements';\nimport type { IConstants, IExecutionTree, Lisp, LispItem } from '../parser';\nimport type SandboxExec from '../SandboxExec';\nimport {\n  AsyncFunction,\n  GeneratorFunction,\n  AsyncGeneratorFunction,\n  NON_BLOCKING_THRESHOLD,\n  LispType,\n  type IContext,\n  type IExecContext,\n  type IOptions,\n  type ISymbolWhitelist,\n  type ISandboxGlobal,\n  type SandboxSymbolContext,\n  type SubscriptionSubject,\n} from './types';\nimport { Scope } from './Scope';\nimport { hasOwnProperty } from './Prop';\n\nexport class ExecContext implements IExecContext {\n  constructor(\n    public ctx: IContext,\n    public constants: IConstants,\n    public tree: Lisp[],\n    public getSubscriptions: Set<(obj: SubscriptionSubject, name: string) => void>,\n    public setSubscriptions: WeakMap<\n      SubscriptionSubject,\n      Map<string, Set<(modification: Change) => void>>\n    >,\n    public changeSubscriptions: WeakMap<SubscriptionSubject, Set<(modification: Change) => void>>,\n    public setSubscriptionsGlobal: WeakMap<\n      SubscriptionSubject,\n      Map<string, Set<(modification: Change) => void>>\n    >,\n    public changeSubscriptionsGlobal: WeakMap<\n      SubscriptionSubject,\n      Set<(modification: Change) => void>\n    >,\n    public evals: Map<any, any>,\n    public registerSandboxFunction: (fn: (...args: any[]) => any) => void,\n    public allowJit: boolean,\n    public evalContext?: IEvalContext,\n  ) {}\n}\n\nfunction createSandboxSymbolContext(symbolWhitelist: ISymbolWhitelist): SandboxSymbolContext {\n  return {\n    registry: new Map<string, symbol>(),\n    reverseRegistry: new Map<symbol, string>(),\n    whitelist: { ...symbolWhitelist },\n  };\n}\n\nconst RESERVED_SYMBOL_PROPERTIES = new Set(['length', 'name', 'prototype', 'for', 'keyFor']);\n\nfunction copyWhitelistedSymbols(target: Function, symbolWhitelist: ISymbolWhitelist) {\n  for (const [key, value] of Object.entries(symbolWhitelist)) {\n    if (RESERVED_SYMBOL_PROPERTIES.has(key)) continue;\n    const descriptor = Object.getOwnPropertyDescriptor(Symbol, key);\n    if (descriptor) {\n      Object.defineProperty(target, key, descriptor);\n    }\n  }\n}\n\nexport function getSandboxSymbolCtor(symbols: SandboxSymbolContext) {\n  if (symbols.ctor) {\n    return symbols.ctor;\n  }\n\n  function SandboxSymbol(this: unknown, description?: unknown) {\n    if (new.target) {\n      throw new TypeError('Symbol is not a constructor');\n    }\n    return Symbol(description === undefined ? undefined : String(description));\n  }\n\n  copyWhitelistedSymbols(SandboxSymbol, symbols.whitelist);\n  Object.defineProperties(SandboxSymbol, {\n    prototype: {\n      value: Symbol.prototype,\n      enumerable: false,\n      configurable: false,\n      writable: false,\n    },\n    for: {\n      value(key: unknown) {\n        const stringKey = String(key);\n        let symbol = symbols.registry.get(stringKey);\n        if (!symbol) {\n          symbol = Symbol(stringKey);\n          symbols.registry.set(stringKey, symbol);\n          symbols.reverseRegistry.set(symbol, stringKey);\n        }\n        return symbol;\n      },\n      enumerable: false,\n      configurable: true,\n      writable: true,\n    },\n    keyFor: {\n      value(symbol: unknown) {\n        return typeof symbol === 'symbol' ? symbols.reverseRegistry.get(symbol) : undefined;\n      },\n      enumerable: false,\n      configurable: true,\n      writable: true,\n    },\n  });\n\n  symbols.ctor = SandboxSymbol;\n  return SandboxSymbol;\n}\n\nfunction SandboxGlobal() {}\ninterface SandboxGlobalConstructor {\n  new (): ISandboxGlobal;\n}\nexport function sandboxedGlobal(globals: ISandboxGlobal): SandboxGlobalConstructor {\n  SG.prototype = SandboxGlobal.prototype;\n  return SG as unknown as SandboxGlobalConstructor;\n  function SG(this: ISandboxGlobal) {\n    for (const i in globals) {\n      this[i] = globals[i];\n    }\n  }\n}\n\nexport function createContext(sandbox: SandboxExec, options: IOptions): IContext {\n  const sandboxSymbols = createSandboxSymbolContext(options.symbolWhitelist);\n  const SandboxGlobal = sandboxedGlobal(options.globals);\n  const sandboxGlobal = new SandboxGlobal();\n  const context: IContext = {\n    sandbox: sandbox,\n    globalsWhitelist: new Set(Object.values(options.globals)),\n    prototypeWhitelist: new Map([...options.prototypeWhitelist].map((a) => [a[0].prototype, a[1]])),\n    sandboxSymbols,\n    options,\n    globalScope: new Scope(null, sandboxGlobal, sandboxGlobal),\n    sandboxGlobal,\n    ticks: {\n      ticks: 0n,\n      tickLimit: options.executionQuota,\n      nextYield: options.nonBlocking ? NON_BLOCKING_THRESHOLD : undefined,\n    },\n    sandboxedFunctions: new WeakSet<Function>(),\n  };\n  context.prototypeWhitelist.set(Object.getPrototypeOf(sandboxGlobal), new Set());\n  context.prototypeWhitelist.set(Object.getPrototypeOf([][Symbol.iterator]()) as object, new Set());\n  // Whitelist Generator and AsyncGenerator prototype chains\n  const genProto = Object.getPrototypeOf((function* () {})());\n  context.prototypeWhitelist.set(Object.getPrototypeOf(genProto), new Set());\n  const asyncGenProto = Object.getPrototypeOf((async function* () {})());\n  context.prototypeWhitelist.set(Object.getPrototypeOf(asyncGenProto), new Set());\n  // Fetch API 构造函数本身（静态方法如 Response.json）也加白名单\n  if (typeof Response !== 'undefined')\n    context.prototypeWhitelist.set(Response.prototype, new Set());\n  if (typeof Request !== 'undefined') context.prototypeWhitelist.set(Request.prototype, new Set());\n  if (typeof Headers !== 'undefined') context.prototypeWhitelist.set(Headers.prototype, new Set());\n  if (typeof FormData !== 'undefined')\n    context.prototypeWhitelist.set(FormData.prototype, new Set());\n  if (typeof Blob !== 'undefined') context.prototypeWhitelist.set(Blob.prototype, new Set());\n  if (typeof URLSearchParams !== 'undefined')\n    context.prototypeWhitelist.set(URLSearchParams.prototype, new Set());\n  if (typeof AbortController !== 'undefined')\n    context.prototypeWhitelist.set(AbortController.prototype, new Set());\n  if (typeof ReadableStream !== 'undefined')\n    context.prototypeWhitelist.set(ReadableStream.prototype, new Set());\n  if (typeof TransformStream !== 'undefined')\n    context.prototypeWhitelist.set(TransformStream.prototype, new Set());\n  if (typeof WritableStream !== 'undefined')\n    context.prototypeWhitelist.set(WritableStream.prototype, new Set());\n  if (typeof TextEncoder !== 'undefined')\n    context.prototypeWhitelist.set(TextEncoder.prototype, new Set());\n  if (typeof TextDecoder !== 'undefined')\n    context.prototypeWhitelist.set(TextDecoder.prototype, new Set());\n  return context;\n}\n\nexport function createExecContext(\n  sandbox: {\n    readonly setSubscriptions: WeakMap<\n      SubscriptionSubject,\n      Map<string, Set<(modification: Change) => void>>\n    >;\n    readonly changeSubscriptions: WeakMap<SubscriptionSubject, Set<(modification: Change) => void>>;\n    readonly sandboxFunctions: WeakMap<(...args: any[]) => any, IExecContext>;\n    readonly context: IContext;\n  },\n  executionTree: IExecutionTree,\n  evalContext?: IEvalContext,\n): IExecContext {\n  const evals = new Map();\n  const execContext: IExecContext = new ExecContext(\n    sandbox.context,\n    executionTree.constants,\n    executionTree.tree,\n    new Set<(obj: SubscriptionSubject, name: string) => void>(),\n    new WeakMap<SubscriptionSubject, Map<string, Set<(modification: Change) => void>>>(),\n    new WeakMap<SubscriptionSubject, Set<(modification: Change) => void>>(),\n    sandbox.setSubscriptions,\n    sandbox.changeSubscriptions,\n    evals,\n    (fn: any) => sandbox.sandboxFunctions.set(fn, execContext),\n    !!evalContext,\n    evalContext,\n  );\n  if (evalContext) {\n    const func = evalContext.sandboxFunction(execContext);\n    const asyncFunc = evalContext.sandboxAsyncFunction(execContext);\n    const genFunc = evalContext.sandboxGeneratorFunction(execContext);\n    const asyncGenFunc = evalContext.sandboxAsyncGeneratorFunction(execContext);\n    const sandboxSymbol = evalContext.sandboxedSymbol(execContext);\n    evals.set(Function, func);\n    evals.set(AsyncFunction, asyncFunc);\n    evals.set(GeneratorFunction, genFunc);\n    evals.set(AsyncGeneratorFunction, asyncGenFunc);\n    evals.set(Symbol, sandboxSymbol);\n    evals.set(eval, evalContext.sandboxedEval(func, execContext));\n    evals.set(setTimeout, evalContext.sandboxedSetTimeout(func, execContext));\n    evals.set(setInterval, evalContext.sandboxedSetInterval(func, execContext));\n    evals.set(clearTimeout, evalContext.sandboxedClearTimeout(execContext));\n    evals.set(clearInterval, evalContext.sandboxedClearInterval(execContext));\n\n    for (const [original, factory] of DEFAULT_FUNCTION_REPLACEMENTS) {\n      evals.set(original, factory(execContext));\n    }\n\n    for (const [original, factory] of sandbox.context.options.functionReplacements) {\n      evals.set(original, factory(execContext, evals.get(original)));\n    }\n\n    const ptwl = sandbox.context.prototypeWhitelist;\n\n    for (const [key, value] of evals) {\n      if (!ptwl.has(key.prototype)) {\n        ptwl.set(key.prototype, new Set());\n      }\n      if (!ptwl.has(value.prototype)) {\n        ptwl.set(value.prototype, ptwl.get(key.prototype) || new Set());\n      }\n      if (sandbox.context.globalsWhitelist.has(key)) {\n        sandbox.context.globalsWhitelist.add(value);\n      }\n      if (hasOwnProperty(sandbox.context.sandboxGlobal, key.name)) {\n        sandbox.context.sandboxGlobal[key.name] = value;\n      }\n    }\n    if (sandbox.context.sandboxGlobal.globalThis) {\n      sandbox.context.sandboxGlobal.globalThis = sandbox.context.sandboxGlobal;\n    }\n  }\n  return execContext;\n}\n\nexport function isLisp<Type extends Lisp = Lisp>(item: LispItem | LispItem): item is Type {\n  return (\n    Array.isArray(item) &&\n    typeof item[0] === 'number' &&\n    item[0] !== LispType.None &&\n    item[0] !== LispType.True\n  );\n}\n","/**\n * Ops registry — kept separate from executorUtils.ts so that ops/*.ts files\n * can import addOps without creating a circular initialization problem.\n *\n * executorUtils.ts imports from here; ops/*.ts imports from here too.\n * No imports from executorUtils.ts allowed in this file.\n */\nimport { LispType } from '../utils';\nimport type { LispItem } from '../parser';\nimport type { IExecContext, Ticks } from '../utils';\nimport type { Scope } from '../utils';\nimport type { YieldValue, Done } from './executorUtils';\n\nexport type ControlFlowAction = 'break' | 'continue';\n\nexport interface ControlFlowTarget {\n  label?: string;\n  acceptsBreak: boolean;\n  acceptsContinue: boolean;\n  acceptsUnlabeledBreak: boolean;\n  acceptsUnlabeledContinue: boolean;\n}\n\nexport type ControlFlowTargets = readonly ControlFlowTarget[] | undefined;\n\nexport type Execution = <T = any>(\n  ticks: Ticks,\n  tree: LispItem,\n  scope: Scope,\n  context: IExecContext,\n  done: Done<T>,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n) => void;\n\nexport type OpsCallbackParams<a, b, obj, bobj> = {\n  op: LispType;\n  exec: Execution;\n  a: a;\n  b: b;\n  obj: obj;\n  bobj: bobj;\n  ticks: Ticks;\n  tree: LispItem;\n  scope: Scope;\n  context: IExecContext;\n  done: Done;\n  statementLabels: ControlFlowTargets;\n  internal: boolean;\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined;\n};\n\ntype OpCallback<a, b, obj, bobj> = (params: OpsCallbackParams<a, b, obj, bobj>) => void;\n\nexport const ops = new Map<LispType, OpCallback<any, any, any, any>>();\n\nexport function addOps<a = unknown, b = unknown, obj = unknown, bobj = unknown>(\n  type: LispType,\n  cb: OpCallback<a, b, obj, bobj>,\n) {\n  ops.set(type, cb);\n}\n","import { addOps, hasPossibleProperties, isPropertyKey } from '../executorUtils';\nimport {\n  LispType,\n  Prop,\n  SandboxAccessError,\n  resolveSandboxProp,\n  hasOwnProperty,\n} from '../../utils';\n\naddOps<unknown, PropertyKey>(LispType.Prop, ({ done, a, b, obj, context, scope, internal }) => {\n  if (a === null) {\n    throw new TypeError(`Cannot read properties of null (reading '${b?.toString()}')`);\n  }\n\n  if (!isPropertyKey(b)) {\n    b = `${b}`;\n  }\n\n  if (a === undefined && obj === undefined && typeof b === 'string') {\n    // is variable access\n    const prop = scope.get(b, internal);\n    if (prop.context === undefined) {\n      throw new ReferenceError(`${b} is not defined`);\n    }\n    if (prop.context === context.ctx.sandboxGlobal) {\n      if (context.ctx.options.audit) {\n        context.ctx.auditReport?.globalsAccess.add(b);\n      }\n    }\n    const val = (prop.context as any)[prop.prop];\n    const p = resolveSandboxProp(val, context, prop) || prop;\n\n    done(undefined, p);\n    return;\n  } else if (a === undefined) {\n    throw new TypeError(`Cannot read properties of undefined (reading '${b.toString()}')`);\n  }\n\n  if (!hasPossibleProperties(a)) {\n    done(undefined, new Prop(undefined, b));\n    return;\n  }\n\n  const prototypeAccess = typeof a === 'function' || !hasOwnProperty(a, b);\n\n  if (context.ctx.options.audit && prototypeAccess) {\n    let prot: {} = Object.getPrototypeOf(a);\n    do {\n      if (hasOwnProperty(prot, b)) {\n        if (\n          context.ctx.auditReport &&\n          !context.ctx.auditReport.prototypeAccess[prot.constructor.name]\n        ) {\n          context.ctx.auditReport.prototypeAccess[prot.constructor.name] = new Set();\n        }\n        context.ctx.auditReport?.prototypeAccess[prot.constructor.name].add(b);\n      }\n    } while ((prot = Object.getPrototypeOf(prot)));\n  }\n\n  if (prototypeAccess) {\n    if (typeof a === 'function') {\n      if (hasOwnProperty(a, b)) {\n        const whitelist = context.ctx.prototypeWhitelist.get(a.prototype);\n        if (\n          !(whitelist && (!whitelist.size || whitelist.has(b))) &&\n          !context.ctx.sandboxedFunctions.has(a)\n        ) {\n          throw new SandboxAccessError(\n            `Static method or property access not permitted: ${a.name}.${b.toString()}`,\n          );\n        }\n      }\n    }\n\n    let prot: {} = a;\n    while ((prot = Object.getPrototypeOf(prot))) {\n      if (hasOwnProperty(prot, b) || b === '__proto__') {\n        const whitelist = context.ctx.prototypeWhitelist.get(prot);\n        if (\n          (whitelist && (!whitelist.size || whitelist.has(b))) ||\n          context.ctx.sandboxedFunctions.has(prot.constructor)\n        ) {\n          break;\n        }\n        if (b === '__proto__') {\n          throw new SandboxAccessError(`Access to prototype of global object is not permitted`);\n        }\n        throw new SandboxAccessError(\n          `Method or property access not permitted: ${prot.constructor.name}.${b.toString()}`,\n        );\n      }\n    }\n  }\n\n  if (typeof a === 'function') {\n    if (b === 'prototype' && !context.ctx.sandboxedFunctions.has(a)) {\n      throw new SandboxAccessError(`Access to prototype of global object is not permitted`);\n    }\n    if (['caller', 'callee', 'arguments'].includes(b as string)) {\n      throw new SandboxAccessError(`Access to '${b as string}' property is not permitted`);\n    }\n  }\n  const val = a[b as keyof typeof a] as unknown;\n\n  if (b === '__proto__' && !context.ctx.sandboxedFunctions.has(val?.constructor as any)) {\n    throw new SandboxAccessError(`Access to prototype of global object is not permitted`);\n  }\n\n  const p = resolveSandboxProp(val, context, new Prop(a, b, false, false));\n  if (p) {\n    done(undefined, p);\n    return;\n  }\n\n  const isSandboxGlobal = a === context.ctx.sandboxGlobal;\n  const g =\n    (!isSandboxGlobal && obj instanceof Prop && obj.isGlobal) ||\n    (typeof a === 'function' && !context.ctx.sandboxedFunctions.has(a)) ||\n    context.ctx.globalsWhitelist.has(a) ||\n    (isSandboxGlobal &&\n      typeof b === 'string' &&\n      hasOwnProperty(context.ctx.globalScope.globals, b));\n\n  done(undefined, new Prop(a, b, false, g, false));\n});\n\naddOps<unknown, string>(LispType.StringIndex, ({ done, b, context }) =>\n  done(undefined, context.constants.strings[parseInt(b)]),\n);\n","import { addOps, arrayChange, Change, checkHaltExpectedTicks, SpreadArray } from '../executorUtils';\nimport {\n  checkTicksAndThrow,\n  typedArrayProtos as _typedArrayProtos,\n} from '../../utils/functionReplacements';\nimport type { Lisp } from '../../parser';\nimport {\n  DelayedSynchronousResult,\n  getReplacementReceiver,\n  LispType,\n  SandboxAccessError,\n  SandboxCapabilityError,\n  sanitizeProp,\n} from '../../utils';\n\naddOps<unknown, Lisp[], any>(LispType.Call, (params) => {\n  const { done, a, b, obj, context } = params;\n  if (context.ctx.options.forbidFunctionCalls)\n    throw new SandboxCapabilityError('Function invocations are not allowed');\n  if (typeof a !== 'function') {\n    throw new TypeError(\n      `${typeof obj?.prop === 'symbol' ? 'Symbol' : obj?.prop} is not a function`,\n    );\n  }\n  const vals = new Array<unknown>(b.length);\n  let valsLen = 0;\n  for (let i = 0; i < b.length; i++) {\n    const item = b[i];\n    if (item instanceof SpreadArray) {\n      const expanded = Array.isArray(item.item) ? item.item : [...(item.item as Iterable<unknown>)];\n      if (checkHaltExpectedTicks(params, BigInt(expanded.length))) return;\n      for (let j = 0; j < expanded.length; j++)\n        vals[valsLen++] = sanitizeProp(expanded[j], context);\n    } else {\n      vals[valsLen++] = sanitizeProp(item, context);\n    }\n  }\n  vals.length = valsLen;\n\n  if (a === String) {\n    const result = String(vals[0]);\n    checkTicksAndThrow(context, BigInt(result.length));\n    done(undefined, result);\n    return;\n  }\n\n  if (typeof obj === 'function') {\n    // Direct function call (not a method): obj is the function itself\n    const evl = context.evals.get(obj);\n    const receiver = getReplacementReceiver(obj);\n    let ret = evl\n      ? evl(obj, ...vals)\n      : receiver === undefined\n        ? obj(...vals)\n        : obj.call(receiver, ...vals);\n    ret = sanitizeProp(ret, context);\n    if (ret !== null && typeof ret === 'object' && ret instanceof DelayedSynchronousResult) {\n      Promise.resolve(ret.result).then(\n        (res) => done(undefined, res),\n        (err) => done(err),\n      );\n    } else {\n      done(undefined, ret);\n    }\n    return;\n  }\n\n  // Method call: obj is a Prop. `a` is already the replacement (from Prop.get()).\n  // The original function is still accessible via obj.context[obj.prop] for subscription checks.\n  const originalFn: unknown = obj.context[obj.prop];\n\n  if (originalFn === JSON.stringify && context.getSubscriptions.size) {\n    const cache = new WeakSet<any>();\n    let ticks = 0n;\n    const recurse = (x: unknown) => {\n      if (!x || !(typeof x === 'object') || cache.has(x)) return;\n      cache.add(x);\n      const keys = Object.keys(x) as (keyof typeof x)[];\n      ticks += BigInt(keys.length);\n      for (const y of keys) {\n        context.getSubscriptions.forEach((cb) => cb(x, y));\n        recurse(x[y]);\n      }\n    };\n    recurse(vals[0]);\n    checkTicksAndThrow(context, ticks);\n  }\n\n  if (\n    obj.context instanceof Array &&\n    arrayChange.has(originalFn as any) &&\n    (context.changeSubscriptions.get(obj.context) ||\n      context.changeSubscriptionsGlobal.get(obj.context))\n  ) {\n    let change: Change = undefined!;\n    let changed = false;\n    if (obj.prop === 'push') {\n      change = { type: 'push', added: vals };\n      changed = !!vals.length;\n    } else if (obj.prop === 'pop') {\n      change = { type: 'pop', removed: obj.context.slice(-1) };\n      changed = !!change.removed.length;\n    } else if (obj.prop === 'shift') {\n      change = { type: 'shift', removed: obj.context.slice(0, 1) };\n      changed = !!change.removed.length;\n    } else if (obj.prop === 'unshift') {\n      change = { type: 'unshift', added: vals };\n      changed = !!vals.length;\n    } else if (obj.prop === 'splice') {\n      change = {\n        type: 'splice',\n        startIndex: vals[0] as number,\n        deleteCount: vals[1] === undefined ? obj.context.length : vals[1],\n        added: vals.slice(2),\n        removed: obj.context.slice(\n          vals[0],\n          vals[1] === undefined ? undefined : (vals[0] as number) + (vals[1] as number),\n        ),\n      };\n      changed = !!change.added.length || !!change.removed.length;\n    } else if (obj.prop === 'reverse' || obj.prop === 'sort') {\n      change = { type: obj.prop };\n      changed = !!obj.context.length;\n    } else if (obj.prop === 'copyWithin') {\n      const len =\n        vals[2] === undefined\n          ? obj.context.length - (vals[1] as number)\n          : Math.min(obj.context.length, (vals[2] as number) - (vals[1] as number));\n      change = {\n        type: 'copyWithin',\n        startIndex: vals[0] as number,\n        endIndex: (vals[0] as number) + len,\n        added: obj.context.slice(vals[1] as number, (vals[1] as number) + len),\n        removed: obj.context.slice(vals[0] as number, (vals[0] as number) + len),\n      };\n      changed = !!change.added.length || !!change.removed.length;\n    }\n    if (changed) {\n      const subs = context.changeSubscriptions.get(obj.context);\n      if (subs !== undefined) for (const cb of subs) cb(change);\n      const subsG = context.changeSubscriptionsGlobal.get(obj.context);\n      if (subsG !== undefined) for (const cb of subsG) cb(change);\n    }\n  }\n\n  // Trigger get-subscriptions, then call via `a` (which may be a replacement from evals).\n  // Sandboxed wrappers for globals (Function, eval, etc.) must be called without `this`;\n  // tick-checking replacements must be called with `this`.\n  obj.get(context);\n  const evl = context.evals.get(originalFn as Function);\n  const receiver = getReplacementReceiver(originalFn as Function);\n  const thisArg = obj.isVariable && receiver !== undefined ? receiver : obj.context;\n  let ret = evl ? evl.call(thisArg, ...vals) : (a as Function).call(thisArg, ...vals);\n  ret = sanitizeProp(ret, context);\n  if (ret !== null && typeof ret === 'object' && ret instanceof DelayedSynchronousResult) {\n    Promise.resolve(ret.result).then(\n      (res) => done(undefined, res),\n      (err) => done(err),\n    );\n  } else {\n    done(undefined, ret);\n  }\n});\n\naddOps<new (...args: unknown[]) => void, unknown[]>(LispType.New, (params) => {\n  const { done, a, b, context } = params;\n  if (!context.ctx.globalsWhitelist.has(a) && !context.ctx.sandboxedFunctions.has(a)) {\n    throw new SandboxAccessError(`Object construction not allowed: ${a.constructor.name}`);\n  }\n  const vals = b.map((item) => sanitizeProp(item, context));\n  const replacement = context.evals.get(a);\n  if (replacement) {\n    const ret = new (replacement as new (...args: unknown[]) => unknown)(...vals);\n    done(undefined, ret);\n    return;\n  }\n  const expectedTicks = getNewTicks(a, vals);\n  if (expectedTicks > 0n && checkHaltExpectedTicks(params, expectedTicks)) return;\n  const ret = new a(...vals);\n  done(undefined, ret);\n});\n\nfunction getNewTicks(ctor: Function, args: unknown[]): bigint {\n  // new Array(n) or new TypedArray(n) — allocates n elements\n  if (ctor === Array) {\n    const n = args[0];\n    if (typeof n === 'number' && args.length === 1) return BigInt(n);\n    return BigInt(args.length);\n  }\n  if (_typedArrayProtos.has(Object.getPrototypeOf(ctor.prototype))) {\n    const n = args[0];\n    if (typeof n === 'number') return BigInt(n);\n    if (Array.isArray(n) || ArrayBuffer.isView(n)) return BigInt((n as ArrayLike<unknown>).length);\n    return 0n;\n  }\n  // new Map(iterable) or new Set(iterable) — O(n) of iterable length\n  if (ctor === Map || ctor === Set) {\n    const iterable = args[0];\n    if (Array.isArray(iterable)) return BigInt(iterable.length);\n    return 0n;\n  }\n  // new String(s) or new RegExp(pattern) — O(n) of string length\n  if (ctor === String || ctor === RegExp) {\n    const s = args[0];\n    if (typeof s === 'string') return BigInt(s.length);\n    return 0n;\n  }\n  return 0n;\n}\n","import {\n  addOps,\n  checkHaltExpectedTicks,\n  SpreadArray,\n  SpreadObject,\n  KeyVal,\n  ArrayHole,\n} from '../executorUtils';\nimport type { Lisp, LispItem } from '../../parser';\nimport { LispType, sanitizeProp } from '../../utils';\n\naddOps<unknown, KeyVal[]>(LispType.CreateObject, (params) => {\n  const { done, b } = params;\n  let res = {} as any;\n  for (const item of b) {\n    if (item.key instanceof SpreadObject) {\n      const keys = Object.keys(item.key.item);\n      if (checkHaltExpectedTicks(params, BigInt(keys.length))) return;\n      res = { ...res, ...item.key.item };\n    } else {\n      res[item.key] = item.val;\n    }\n  }\n  done(undefined, res);\n});\n\naddOps<PropertyKey, LispItem>(LispType.KeyVal, ({ done, a, b }) =>\n  done(undefined, new KeyVal(a, b)),\n);\n\naddOps<unknown, Lisp[]>(LispType.CreateArray, (params) => {\n  const { done, b, context } = params;\n  const items: unknown[] = [];\n  for (const item of b) {\n    if (item instanceof SpreadArray) {\n      const expanded = Array.isArray(item.item) ? item.item : [...(item.item as Iterable<unknown>)];\n      if (checkHaltExpectedTicks(params, BigInt(expanded.length))) return;\n      for (const v of expanded) items.push(sanitizeProp(v, context));\n    } else if (item instanceof ArrayHole) {\n      items.length++;\n    } else {\n      items.push(sanitizeProp(item, context));\n    }\n  }\n  done(undefined, items);\n});\n\naddOps(LispType.Hole, ({ done }) => done(undefined, new ArrayHole()));\n\naddOps<unknown, unknown>(LispType.Group, ({ done, b }) => done(undefined, b));\n\naddOps<unknown, string>(LispType.GlobalSymbol, ({ done, b }) => {\n  switch (b) {\n    case 'true':\n      return done(undefined, true);\n    case 'false':\n      return done(undefined, false);\n    case 'null':\n      return done(undefined, null);\n    case 'undefined':\n      return done(undefined, undefined);\n    case 'NaN':\n      return done(undefined, NaN);\n    case 'Infinity':\n      return done(undefined, Infinity);\n  }\n  done(new Error('Unknown symbol: ' + b));\n});\n\naddOps<unknown, unknown[]>(LispType.SpreadArray, ({ done, b }) => {\n  done(undefined, new SpreadArray(b));\n});\n\naddOps<unknown, Record<string, unknown>>(LispType.SpreadObject, ({ done, b }) => {\n  done(undefined, new SpreadObject(b));\n});\n","import { addOps, literalRegex, checkHaltExpectedTicks } from '../executorUtils';\nimport type { Lisp, IRegEx } from '../../parser';\nimport { LispType, SandboxCapabilityError, sanitizeProp } from '../../utils';\n\naddOps<unknown, string>(LispType.Number, ({ done, b }) =>\n  done(undefined, Number(b.replace(/_/g, ''))),\n);\n\naddOps<unknown, string>(LispType.BigInt, ({ done, b }) =>\n  done(undefined, BigInt(b.replace(/_/g, ''))),\n);\n\naddOps<unknown, string>(LispType.RegexIndex, ({ done, b, context }) => {\n  const reg: IRegEx = context.constants.regexes[parseInt(b)];\n  if (!context.ctx.globalsWhitelist.has(RegExp)) {\n    throw new SandboxCapabilityError('Regex not permitted');\n  } else {\n    const RegExpCtor =\n      (context.evals.get(RegExp) as\n        | (new (pattern: string, flags?: string) => unknown)\n        | undefined) ?? RegExp;\n    done(undefined, new RegExpCtor(reg.regex, reg.flags));\n  }\n});\n\naddOps<unknown, string>(LispType.LiteralIndex, (params) => {\n  const { exec, done, ticks, b, context, scope, internal, generatorYield } = params;\n  const item = context.constants.literals[parseInt(b)];\n  const [, name, js] = item;\n  const found: Lisp[] = [];\n  let f: RegExpExecArray | null;\n  const resnums: string[] = [];\n  while ((f = literalRegex.exec(name))) {\n    if (!f[2]) {\n      found.push(js[parseInt(f[3], 10)]);\n      resnums.push(f[3]);\n    }\n  }\n\n  exec<unknown[]>(\n    ticks,\n    found,\n    scope,\n    context,\n    (...args: unknown[]) => {\n      const reses: Record<string, unknown> = {};\n      if (args.length === 1) {\n        done(args[0]);\n        return;\n      }\n      const processed = args[1];\n      for (const i of Object.keys(processed!) as (keyof typeof processed)[]) {\n        const num = resnums[i];\n        reses[num] = processed![i];\n      }\n      const result = name.replace(/(\\\\\\\\)*(\\\\)?\\${(\\d+)}/g, (match, $$, $, num) => {\n        if ($) return match;\n        const res = reses[num];\n        return ($$ ? $$ : '') + `${sanitizeProp(res, context)}`;\n      });\n      if (checkHaltExpectedTicks(params, BigInt(result.length))) return;\n      done(undefined, result);\n    },\n    undefined,\n    internal,\n    generatorYield,\n  );\n});\n","import { addOps, assignCheck } from '../executorUtils';\nimport type { LispItem } from '../../parser';\nimport { LispType, Prop, sanitizeProp } from '../../utils';\n\naddOps<unknown, unknown>(LispType.Not, ({ done, b }) => done(undefined, !b));\n\naddOps<unknown, number>(LispType.Inverse, ({ done, b }) => done(undefined, ~b));\n\naddOps<unknown, unknown, Prop<any>>(LispType.IncrementBefore, ({ done, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, ++obj.context[obj.prop]);\n});\n\naddOps<unknown, unknown, Prop<any>>(LispType.IncrementAfter, ({ done, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, obj.context[obj.prop]++);\n});\n\naddOps<unknown, unknown, Prop<any>>(LispType.DecrementBefore, ({ done, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, --obj.context[obj.prop]);\n});\n\naddOps<unknown, unknown, Prop<any>>(LispType.DecrementAfter, ({ done, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, obj.context[obj.prop]--);\n});\n\naddOps<number, number>(LispType.Positive, ({ done, b }) => done(undefined, +b));\n\naddOps<number, number>(LispType.Negative, ({ done, b }) => done(undefined, -b));\n\naddOps<unknown, LispItem>(\n  LispType.Typeof,\n  ({ exec, done, ticks, b, context, scope, internal, generatorYield }) => {\n    exec(\n      ticks,\n      b,\n      scope,\n      context,\n      (e, prop) => {\n        done(undefined, typeof sanitizeProp(prop, context));\n      },\n      undefined,\n      internal,\n      generatorYield,\n    );\n  },\n);\n\naddOps<unknown, unknown>(LispType.Delete, ({ done, context, bobj }) => {\n  if (!(bobj instanceof Prop)) {\n    done(undefined, true);\n    return;\n  }\n  assignCheck(bobj, context, 'delete');\n  if (bobj.isVariable) {\n    done(undefined, false);\n    return;\n  }\n  done(undefined, delete (bobj.context as any)?.[bobj.prop]);\n});\n\naddOps(LispType.Void, ({ done }) => {\n  done();\n});\n","import { addOps, assignCheck, checkHaltExpectedTicks } from '../executorUtils';\nimport { LispType, Prop } from '../../utils';\n\naddOps<unknown, unknown, Prop<any>, Prop<any>>(LispType.Assign, (params) => {\n  const { done, b, obj, context, scope, bobj, internal } = params;\n  assignCheck(obj, context);\n  obj.isGlobal = bobj?.isGlobal || false;\n  if (obj.isVariable) {\n    const s = scope.getWhereValScope(obj.prop as string, obj.prop === 'this', internal);\n    if (s === null) {\n      throw new ReferenceError(`Cannot assign to undeclared variable '${obj.prop.toString()}'`);\n    }\n    s.set(obj.prop as string, b, internal);\n    if (obj.isGlobal) {\n      s.globals[obj.prop.toString()] = true;\n    } else {\n      delete s.globals[obj.prop.toString()];\n    }\n    done(undefined, b);\n    return;\n  }\n  if (obj.prop === 'length' && Array.isArray(obj.context) && typeof b === 'number') {\n    const delta = BigInt(Math.abs(b - obj.context.length));\n    if (delta > 0n && checkHaltExpectedTicks(params, delta)) return;\n  }\n  done(undefined, (obj.context[obj.prop] = b));\n});\n\naddOps<unknown, unknown, Prop<any>>(LispType.AddEquals, (params) => {\n  const { done, b, obj, context } = params;\n  assignCheck(obj, context);\n  const result = (obj.context[obj.prop] as any) + (b as any);\n  if (typeof result === 'string' && checkHaltExpectedTicks(params, BigInt(result.length))) return;\n  done(undefined, (obj.context[obj.prop] = result));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.SubractEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] -= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.DivideEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] /= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.MultiplyEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] *= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.PowerEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] **= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.ModulusEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] %= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.BitNegateEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] ^= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.BitAndEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] &= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.BitOrEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] |= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.ShiftLeftEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] <<= b));\n});\n\naddOps<unknown, number, Prop<any>>(LispType.ShiftRightEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] >>= b));\n});\n\naddOps<unknown, number, Prop<any>>(\n  LispType.UnsignedShiftRightEquals,\n  ({ done, b, obj, context }) => {\n    assignCheck(obj, context);\n    done(undefined, (obj.context[obj.prop] >>>= b));\n  },\n);\n\naddOps<unknown, unknown, Prop<any>>(LispType.AndEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] &&= b));\n});\n\naddOps<unknown, unknown, Prop<any>>(LispType.OrEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] ||= b));\n});\n\naddOps<unknown, unknown, Prop<any>>(\n  LispType.NullishCoalescingEquals,\n  ({ done, b, obj, context }) => {\n    assignCheck(obj, context);\n    done(undefined, (obj.context[obj.prop] ??= b));\n  },\n);\n","import { addOps, checkHaltExpectedTicks } from '../executorUtils';\nimport { LispType } from '../../utils';\n\naddOps<number, number>(LispType.LargerThan, ({ done, a, b }) => done(undefined, a > b));\n\naddOps<number, number>(LispType.SmallerThan, ({ done, a, b }) => done(undefined, a < b));\n\naddOps<number, number>(LispType.LargerEqualThan, ({ done, a, b }) => done(undefined, a >= b));\n\naddOps<number, number>(LispType.SmallerEqualThan, ({ done, a, b }) => done(undefined, a <= b));\n\naddOps<number, number>(LispType.Equal, ({ done, a, b }) => done(undefined, a == b));\n\naddOps<number, number>(LispType.StrictEqual, ({ done, a, b }) => done(undefined, a === b));\n\naddOps<number, number>(LispType.NotEqual, ({ done, a, b }) => done(undefined, a != b));\n\naddOps<number, number>(LispType.StrictNotEqual, ({ done, a, b }) => done(undefined, a !== b));\n\naddOps<number, number>(LispType.And, ({ done, a, b }) => done(undefined, a && b));\n\naddOps<number, number>(LispType.Or, ({ done, a, b }) => done(undefined, a || b));\n\naddOps<number, number>(LispType.NullishCoalescing, ({ done, a, b }) => done(undefined, a ?? b));\n\naddOps<number, number>(LispType.BitAnd, ({ done, a, b }) => done(undefined, a & b));\n\naddOps<number, number>(LispType.BitOr, ({ done, a, b }) => done(undefined, a | b));\n\naddOps<number, number>(LispType.Plus, (params) => {\n  const { done, a, b } = params;\n  const result = (a as any) + (b as any);\n  if (typeof result === 'string' && checkHaltExpectedTicks(params, BigInt(result.length))) return;\n  done(undefined, result);\n});\n\naddOps<number, number>(LispType.Minus, ({ done, a, b }) => done(undefined, a - b));\n\naddOps<number, number>(LispType.Divide, ({ done, a, b }) => done(undefined, a / b));\n\naddOps<number, number>(LispType.Power, ({ done, a, b }) => done(undefined, a ** b));\n\naddOps<number, number>(LispType.BitNegate, ({ done, a, b }) => done(undefined, a ^ b));\n\naddOps<number, number>(LispType.Multiply, ({ done, a, b }) => done(undefined, a * b));\n\naddOps<number, number>(LispType.Modulus, ({ done, a, b }) => done(undefined, a % b));\n\naddOps<number, number>(LispType.BitShiftLeft, ({ done, a, b }) => done(undefined, a << b));\n\naddOps<number, number>(LispType.BitShiftRight, ({ done, a, b }) => done(undefined, a >> b));\n\naddOps<number, number>(LispType.BitUnsignedShiftRight, ({ done, a, b }) =>\n  done(undefined, a >>> b),\n);\n\naddOps<unknown, { new (): unknown }>(LispType.Instanceof, ({ done, a, b }) =>\n  done(undefined, a instanceof b),\n);\n\naddOps<string, {}>(LispType.In, ({ done, a, b }) => done(undefined, a in b));\n","import { addOps } from '../executorUtils';\nimport { LispType, Prop, VarType } from '../../utils';\n\naddOps(LispType.Return, ({ done, b }) => done(undefined, b));\n\naddOps<string, unknown, unknown, Prop>(LispType.Var, ({ done, a, b, scope, bobj, internal }) => {\n  done(undefined, scope.declare(a, VarType.var, b, bobj?.isGlobal || false, internal));\n});\n\naddOps<string, unknown, unknown, Prop>(LispType.Let, ({ done, a, b, scope, bobj, internal }) => {\n  done(undefined, scope.declare(a, VarType.let, b, bobj?.isGlobal || false, internal));\n});\n\naddOps<string, unknown, unknown, Prop>(LispType.Const, ({ done, a, b, scope, bobj, internal }) => {\n  done(undefined, scope.declare(a, VarType.const, b, bobj?.isGlobal || false, internal));\n});\n","import {\n  addOps,\n  findControlFlowTarget,\n  ExecReturn,\n  normalizeStatementLabel,\n} from '../executorUtils';\nimport type { ControlFlowAction } from '../executorUtils';\nimport type { LispItem, StatementLabel } from '../../parser';\nimport { LispType, Prop, VarType, SandboxCapabilityError } from '../../utils';\n\naddOps<string, unknown, unknown, Prop>(\n  LispType.Internal,\n  ({ done, a, b, scope, bobj, internal }) => {\n    if (!internal) {\n      throw new SandboxCapabilityError('Internal variables are not accessible');\n    }\n    done(undefined, scope.declare(a, VarType.internal, b, bobj?.isGlobal || false, internal));\n  },\n);\n\naddOps<LispItem, StatementLabel>(\n  LispType.LoopAction,\n  ({ done, a, b, context, statementLabels }) => {\n    const label = normalizeStatementLabel(b);\n    const target = findControlFlowTarget(statementLabels, a as ControlFlowAction, label);\n    if (target === null) {\n      throw new TypeError('Illegal continue statement');\n    }\n    if (!target) {\n      throw new TypeError(label ? `Undefined label '${label}'` : 'Illegal ' + a + ' statement');\n    }\n    done(\n      undefined,\n      new ExecReturn(context.ctx.auditReport, undefined, false, {\n        type: a as ControlFlowAction,\n        label,\n      }),\n    );\n  },\n);\n\naddOps(LispType.Throw, ({ done, b }) => {\n  done(b);\n});\n\naddOps(LispType.None, ({ done }) => done());\n","import {\n  addOps,\n  createAsyncGeneratorFunction,\n  createFunction,\n  createFunctionAsync,\n  createGeneratorFunction,\n} from '../executorUtils';\nimport type { Lisp } from '../../parser';\nimport { LispType, SandboxCapabilityError, CodeString, Scope, VarType } from '../../utils';\n\naddOps<string[], Lisp[], Lisp>(\n  LispType.ArrowFunction,\n  ({ done, ticks, a, b, obj, context, scope, internal }) => {\n    if (typeof obj[2] === 'string' || obj[2] instanceof CodeString) {\n      if (context.allowJit && context.evalContext) {\n        obj[2] = b = context.evalContext.lispifyFunction(new CodeString(obj[2]), context.constants);\n      } else {\n        throw new SandboxCapabilityError('Unevaluated code detected, JIT not allowed');\n      }\n    }\n    const argNames = a.slice(1);\n    if (a[0]) {\n      done(undefined, createFunctionAsync(argNames, b, ticks, context, scope, undefined, internal));\n    } else {\n      done(undefined, createFunction(argNames, b, ticks, context, scope, undefined, internal));\n    }\n  },\n);\n\naddOps<(string | LispType)[], Lisp[], Lisp>(\n  LispType.Function,\n  ({ done, ticks, a, b, obj, context, scope, internal }) => {\n    if (typeof obj[2] === 'string' || obj[2] instanceof CodeString) {\n      if (context.allowJit && context.evalContext) {\n        obj[2] = b = context.evalContext.lispifyFunction(\n          new CodeString(obj[2]),\n          context.constants,\n          false,\n          {\n            generatorDepth: a[1] === LispType.True ? 1 : 0,\n            asyncDepth: a[0] === LispType.True ? 1 : 0,\n            lispDepth: 0,\n          },\n        );\n      } else {\n        throw new SandboxCapabilityError('Unevaluated code detected, JIT not allowed');\n      }\n    }\n    const isAsync = a[0];\n    const isGenerator = a[1];\n    const name = a[2] as string;\n    const argNames = a.slice(3) as string[];\n    let func;\n    if (isAsync === LispType.True && isGenerator === LispType.True) {\n      func = createAsyncGeneratorFunction(argNames, b, ticks, context, scope, name, internal);\n    } else if (isGenerator === LispType.True) {\n      func = createGeneratorFunction(argNames, b, ticks, context, scope, name, internal);\n    } else if (isAsync === LispType.True) {\n      func = createFunctionAsync(argNames, b, ticks, context, scope, name, internal);\n    } else {\n      func = createFunction(argNames, b, ticks, context, scope, name, internal);\n    }\n    if (name) {\n      scope.declare(name, VarType.var, func, false, internal);\n    }\n    done(undefined, func);\n  },\n);\n\naddOps<(string | LispType)[], Lisp[], Lisp>(\n  LispType.InlineFunction,\n  ({ done, ticks, a, b, obj, context, scope, internal }) => {\n    if (typeof obj[2] === 'string' || obj[2] instanceof CodeString) {\n      if (context.allowJit && context.evalContext) {\n        obj[2] = b = context.evalContext.lispifyFunction(\n          new CodeString(obj[2]),\n          context.constants,\n          false,\n          {\n            generatorDepth: a[1] === LispType.True ? 1 : 0,\n            asyncDepth: a[0] === LispType.True ? 1 : 0,\n            lispDepth: 0,\n          },\n        );\n      } else {\n        throw new SandboxCapabilityError('Unevaluated code detected, JIT not allowed');\n      }\n    }\n    const isAsync = a[0];\n    const isGenerator = a[1];\n    const name = a[2] as string;\n    const argNames = a.slice(3) as string[];\n    if (name) {\n      scope = new Scope(scope, {});\n    }\n    let func;\n    if (isAsync === LispType.True && isGenerator === LispType.True) {\n      func = createAsyncGeneratorFunction(argNames, b, ticks, context, scope, name, internal);\n    } else if (isGenerator === LispType.True) {\n      func = createGeneratorFunction(argNames, b, ticks, context, scope, name, internal);\n    } else if (isAsync === LispType.True) {\n      func = createFunctionAsync(argNames, b, ticks, context, scope, name, internal);\n    } else {\n      func = createFunction(argNames, b, ticks, context, scope, name, internal);\n    }\n    if (name) {\n      scope.declare(name, VarType.let, func, false, internal);\n    }\n    done(undefined, func);\n  },\n);\n","import {\n  addOps,\n  execAsync,\n  execSync,\n  asyncDone,\n  executeTreeWithDone,\n  normalizeStatementLabels,\n  addControlFlowTargets,\n  createLoopTarget,\n  createSwitchTarget,\n  createLabeledStatementTarget,\n  matchesControlFlowTarget,\n  If,\n  ExecReturn,\n  executeTreeAsync,\n  syncDone,\n  executeTree,\n  normalizeStatementLabel,\n  addControlFlowTarget,\n} from '../executorUtils';\nimport type { AsyncDoneRet } from '../executorUtils';\nimport type { Lisp, LispItem, StatementLabel, SwitchCase } from '../../parser';\nimport { LispType, Scope, SandboxError, sanitizeProp } from '../../utils';\n\naddOps<Lisp[], Lisp[]>(\n  LispType.Loop,\n  ({ exec, done, ticks, a, b, context, scope, statementLabels, internal, generatorYield }) => {\n    const [\n      checkFirst,\n      startInternal,\n      getIterator,\n      startStep,\n      step,\n      condition,\n      beforeStep,\n      isForAwait,\n      label,\n    ] = a;\n    const loopStatementTargets = [\n      ...normalizeStatementLabels(label).map((loopLabel) => createLoopTarget(loopLabel, false)),\n      createLoopTarget(),\n    ];\n    const loopTargets = addControlFlowTargets(statementLabels, loopStatementTargets);\n    if ((isForAwait as unknown as LispType) === LispType.True && exec !== execAsync) {\n      done(new SyntaxError('for-await-of loops are only allowed inside async functions'));\n      return;\n    }\n    let loop = true;\n    const loopScope = new Scope(scope, {});\n    const internalVars: Record<string, unknown> = {\n      $$obj: undefined,\n    };\n    const interalScope = new Scope(loopScope, internalVars);\n    if (exec === execAsync) {\n      (async () => {\n        let ad: AsyncDoneRet;\n        ad = asyncDone((d) =>\n          exec(ticks, startStep, loopScope, context, d, undefined, internal, generatorYield),\n        );\n        internalVars['$$obj'] =\n          (ad = asyncDone((d) =>\n            exec(ticks, getIterator, loopScope, context, d, undefined, internal, generatorYield),\n          )).isInstant === true\n            ? ad.instant\n            : (await ad.p).result;\n        // for-await-of: override $$obj with the correct async iterator\n        if ((isForAwait as unknown as LispType) === LispType.True) {\n          const obj = internalVars['$$obj'] as any;\n          internalVars['$$obj'] = obj[Symbol.asyncIterator]\n            ? obj[Symbol.asyncIterator]()\n            : obj[Symbol.iterator]\n              ? obj[Symbol.iterator]()\n              : obj;\n        }\n        ad = asyncDone((d) =>\n          exec(ticks, startInternal, interalScope, context, d, undefined, internal, generatorYield),\n        );\n        // for-await-of: await the $$next promise after startInternal sets it\n        if ((isForAwait as unknown as LispType) === LispType.True) {\n          internalVars['$$next'] = await internalVars['$$next'];\n        }\n        if (checkFirst)\n          loop =\n            (ad = asyncDone((d) =>\n              exec(ticks, condition, interalScope, context, d, undefined, internal, generatorYield),\n            )).isInstant === true\n              ? ad.instant\n              : (await ad.p).result;\n        while (loop) {\n          const innerLoopVars = {};\n          const iterScope = new Scope(interalScope, innerLoopVars);\n          ad = asyncDone((d) =>\n            exec(ticks, beforeStep, iterScope, context, d, undefined, internal, generatorYield),\n          );\n          ad.isInstant === true ? ad.instant : (await ad.p).result;\n          const res = await executeTreeAsync(\n            ticks,\n            context,\n            b,\n            [iterScope],\n            loopTargets,\n            internal,\n            generatorYield,\n          );\n          if (res instanceof ExecReturn && res.returned) {\n            done(undefined, res);\n            return;\n          }\n          if (res instanceof ExecReturn && res.controlFlow) {\n            if (\n              !loopStatementTargets.some((target) =>\n                matchesControlFlowTarget(res.controlFlow!, target),\n              )\n            ) {\n              done(undefined, res);\n              return;\n            }\n            if (res.breakLoop) {\n              break;\n            }\n          }\n          ad = asyncDone((d) =>\n            exec(ticks, step, interalScope, context, d, undefined, internal, generatorYield),\n          );\n          // for-await-of: await the $$next promise after step updates it\n          if ((isForAwait as unknown as LispType) === LispType.True) {\n            internalVars['$$next'] = await internalVars['$$next'];\n          }\n          loop =\n            (ad = asyncDone((d) =>\n              exec(ticks, condition, interalScope, context, d, undefined, internal, generatorYield),\n            )).isInstant === true\n              ? ad.instant\n              : (await ad.p).result;\n        }\n        done();\n      })().catch(done);\n    } else {\n      syncDone((d) =>\n        exec(ticks, startStep, loopScope, context, d, undefined, internal, generatorYield),\n      );\n      internalVars['$$obj'] = syncDone((d) =>\n        exec(ticks, getIterator, loopScope, context, d, undefined, internal, generatorYield),\n      ).result;\n      syncDone((d) =>\n        exec(ticks, startInternal, interalScope, context, d, undefined, internal, generatorYield),\n      );\n      if (checkFirst)\n        loop = syncDone((d) =>\n          exec(ticks, condition, interalScope, context, d, undefined, internal, generatorYield),\n        ).result;\n      while (loop) {\n        const innerLoopVars = {};\n        const iterScope = new Scope(interalScope, innerLoopVars);\n        syncDone((d) =>\n          exec(ticks, beforeStep, iterScope, context, d, undefined, internal, generatorYield),\n        );\n        const res = executeTree(\n          ticks,\n          context,\n          b,\n          [iterScope],\n          loopTargets,\n          internal,\n          generatorYield,\n        );\n        if (res instanceof ExecReturn && res.returned) {\n          done(undefined, res);\n          return;\n        }\n        if (res instanceof ExecReturn && res.controlFlow) {\n          if (\n            !loopStatementTargets.some((target) =>\n              matchesControlFlowTarget(res.controlFlow!, target),\n            )\n          ) {\n            done(undefined, res);\n            return;\n          }\n          if (res.breakLoop) {\n            break;\n          }\n        }\n        syncDone((d) =>\n          exec(ticks, step, interalScope, context, d, undefined, internal, generatorYield),\n        );\n        loop = syncDone((d) =>\n          exec(ticks, condition, interalScope, context, d, undefined, internal, generatorYield),\n        ).result;\n      }\n      done();\n    }\n  },\n);\n\naddOps<LispItem, If>(\n  LispType.If,\n  ({ exec, done, ticks, a, b, context, scope, statementLabels, internal, generatorYield }) => {\n    exec(\n      ticks,\n      sanitizeProp(a, context) ? b.t : b.f,\n      scope,\n      context,\n      done,\n      statementLabels,\n      internal,\n      generatorYield,\n    );\n  },\n);\n\naddOps<LispItem, If>(\n  LispType.InlineIf,\n  ({ exec, done, ticks, a, b, context, scope, internal, generatorYield }) => {\n    exec(\n      ticks,\n      sanitizeProp(a, context) ? b.t : b.f,\n      scope,\n      context,\n      done,\n      undefined,\n      internal,\n      generatorYield,\n    );\n  },\n);\n\naddOps<Lisp, Lisp>(LispType.InlineIfCase, ({ done, a, b }) => done(undefined, new If(a, b)));\n\naddOps<Lisp, Lisp>(LispType.IfCase, ({ done, a, b }) => done(undefined, new If(a, b)));\n\naddOps<StatementLabel, Lisp>(\n  LispType.Labeled,\n  ({ exec, done, ticks, a, b, context, scope, statementLabels, internal, generatorYield }) => {\n    const target = createLabeledStatementTarget(normalizeStatementLabel(a));\n    exec(\n      ticks,\n      b,\n      scope,\n      context,\n      (...args: unknown[]) => {\n        if (args.length === 1) {\n          done(args[0]);\n          return;\n        }\n        const res = args[1];\n        if (res instanceof ExecReturn && res.controlFlow && target) {\n          if (matchesControlFlowTarget(res.controlFlow, target)) {\n            done();\n            return;\n          }\n        }\n        done(undefined, res as any);\n      },\n      addControlFlowTarget(statementLabels, target),\n      internal,\n      generatorYield,\n    );\n  },\n);\n\naddOps<LispItem, SwitchCase[]>(\n  LispType.Switch,\n  ({ exec, done, ticks, a, b, context, scope, statementLabels, internal, generatorYield }) => {\n    const switchTarget = createSwitchTarget();\n    const switchTargets = addControlFlowTarget(statementLabels, switchTarget);\n    exec(\n      ticks,\n      a,\n      scope,\n      context,\n      (...args: unknown[]) => {\n        if (args.length === 1) {\n          done(args[0]);\n          return;\n        }\n        let toTest = args[1];\n        toTest = sanitizeProp(toTest, context);\n        if (exec === execSync) {\n          let res: ExecReturn<unknown>;\n          let isTrue = false;\n          for (const caseItem of b) {\n            if (\n              isTrue ||\n              (isTrue =\n                !caseItem[1] ||\n                toTest ===\n                  sanitizeProp(\n                    syncDone((d) =>\n                      exec(\n                        ticks,\n                        caseItem[1],\n                        scope,\n                        context,\n                        d,\n                        undefined,\n                        internal,\n                        generatorYield,\n                      ),\n                    ).result,\n                    context,\n                  ))\n            ) {\n              if (!caseItem[2]) continue;\n              res = executeTree(\n                ticks,\n                context,\n                caseItem[2],\n                [scope],\n                switchTargets,\n                internal,\n                generatorYield,\n              );\n              if (res.controlFlow) {\n                if (!matchesControlFlowTarget(res.controlFlow, switchTarget)) {\n                  done(undefined, res);\n                  return;\n                }\n                if (res.breakLoop) break;\n              }\n              if (res.returned) {\n                done(undefined, res);\n                return;\n              }\n              if (!caseItem[1]) {\n                // default case\n                break;\n              }\n            }\n          }\n          done();\n        } else {\n          (async () => {\n            let res: ExecReturn<unknown>;\n            let isTrue = false;\n            for (const caseItem of b) {\n              let ad: AsyncDoneRet;\n              if (\n                isTrue ||\n                (isTrue =\n                  !caseItem[1] ||\n                  toTest ===\n                    sanitizeProp(\n                      (ad = asyncDone((d) =>\n                        exec(\n                          ticks,\n                          caseItem[1],\n                          scope,\n                          context,\n                          d,\n                          undefined,\n                          internal,\n                          generatorYield,\n                        ),\n                      )).isInstant === true\n                        ? ad.instant\n                        : (await ad.p).result,\n                      context,\n                    ))\n              ) {\n                if (!caseItem[2]) continue;\n                res = await executeTreeAsync(\n                  ticks,\n                  context,\n                  caseItem[2],\n                  [scope],\n                  switchTargets,\n                  internal,\n                  generatorYield,\n                );\n                if (res.controlFlow) {\n                  if (!matchesControlFlowTarget(res.controlFlow, switchTarget)) {\n                    done(undefined, res);\n                    return;\n                  }\n                  if (res.breakLoop) break;\n                }\n                if (res.returned) {\n                  done(undefined, res);\n                  return;\n                }\n                if (!caseItem[1]) {\n                  // default case\n                  break;\n                }\n              }\n            }\n            done();\n          })().catch(done);\n        }\n      },\n      undefined,\n      internal,\n      generatorYield,\n    );\n  },\n);\n\naddOps<Lisp[], [string, Lisp[], Lisp[]]>(\n  LispType.Try,\n  ({ exec, done, ticks, a, b, context, scope, statementLabels, internal, generatorYield }) => {\n    const [exception, catchBody, finallyBody] = b;\n\n    // Execute try block\n    executeTreeWithDone(\n      exec,\n      (...tryArgs: unknown[]) => {\n        const tryHadError = tryArgs.length === 1;\n        const tryError = tryHadError ? tryArgs[0] : undefined;\n        const tryResult = !tryHadError && tryArgs.length > 1 ? tryArgs[1] : undefined;\n\n        // Handler to execute finally and complete\n        const executeFinallyAndComplete = (hadError: boolean, errorOrResult: unknown) => {\n          if (finallyBody && finallyBody.length > 0) {\n            // Execute finally block\n            executeTreeWithDone(\n              exec,\n              (...finallyArgs: unknown[]) => {\n                const finallyHadError = finallyArgs.length === 1;\n                const finallyResult =\n                  !finallyHadError && finallyArgs.length > 1 ? finallyArgs[1] : undefined;\n\n                // If finally throws an error, it overrides everything\n                if (finallyHadError) {\n                  done(finallyArgs[0]);\n                  return;\n                }\n\n                // If finally has a control flow statement (return/break/continue), it overrides everything\n                if (\n                  finallyResult instanceof ExecReturn &&\n                  (finallyResult.returned || finallyResult.breakLoop || finallyResult.continueLoop)\n                ) {\n                  done(undefined, finallyResult);\n                  return;\n                }\n\n                // Otherwise, return the original try/catch result/error\n                if (hadError) {\n                  done(errorOrResult);\n                } else if (errorOrResult instanceof ExecReturn) {\n                  // If try/catch returned or has some other control flow, pass that through\n                  if (\n                    errorOrResult.returned ||\n                    errorOrResult.breakLoop ||\n                    errorOrResult.continueLoop\n                  ) {\n                    done(undefined, errorOrResult);\n                  } else {\n                    // Normal completion - don't return a value\n                    done();\n                  }\n                } else {\n                  // Try/catch completed normally, just signal completion with no return value\n                  done();\n                }\n              },\n              ticks,\n              context,\n              finallyBody,\n              [new Scope(scope, {})],\n              statementLabels,\n              internal,\n              generatorYield,\n            );\n          } else {\n            // No finally block, just return result/error\n            if (hadError) {\n              done(errorOrResult);\n            } else if (errorOrResult instanceof ExecReturn) {\n              // If try/catch returned or has some other control flow, pass that through\n              if (errorOrResult.returned || errorOrResult.breakLoop || errorOrResult.continueLoop) {\n                done(undefined, errorOrResult);\n              } else {\n                // Normal completion - don't return a value\n                done();\n              }\n            } else {\n              done();\n            }\n          }\n        };\n\n        // SandboxErrors bypass both catch and finally — propagate immediately.\n        if (tryHadError && tryError instanceof SandboxError) {\n          done(tryError);\n          return;\n        }\n\n        // If try had an error and there's a catch block, execute catch.\n        if (tryHadError && catchBody && catchBody.length > 0) {\n          const sc: Record<string, unknown> = {};\n          if (exception) sc[exception] = tryError;\n\n          executeTreeWithDone(\n            exec,\n            (...catchArgs: unknown[]) => {\n              const catchHadError = catchArgs.length === 1;\n              const catchErrorOrResult = catchHadError\n                ? catchArgs[0]\n                : catchArgs.length > 1\n                  ? catchArgs[1]\n                  : undefined;\n\n              // Execute finally with catch result\n              executeFinallyAndComplete(catchHadError, catchErrorOrResult);\n            },\n            ticks,\n            context,\n            catchBody,\n            [new Scope(scope, sc)],\n            statementLabels,\n            internal,\n            generatorYield,\n          );\n        } else {\n          // No catch or no error, execute finally with try result\n          executeFinallyAndComplete(tryHadError, tryHadError ? tryError : tryResult);\n        }\n      },\n      ticks,\n      context,\n      a,\n      [new Scope(scope)],\n      statementLabels,\n      internal,\n      generatorYield,\n    );\n  },\n);\n\naddOps<unknown[]>(LispType.Expression, ({ done, a }) => done(undefined, a.pop()));\n","import type { LispItem, Lisp, StatementLabel } from '../parser';\nimport {\n  hasOwnProperty,\n  isLisp,\n  LispType,\n  LocalScope,\n  Prop,\n  SandboxExecutionQuotaExceededError,\n  SandboxError,\n  SandboxExecutionTreeError,\n  Scope,\n  GeneratorFunction,\n  AsyncGeneratorFunction,\n  SandboxCapabilityError,\n  SandboxAccessError,\n  NON_BLOCKING_THRESHOLD,\n  sanitizeProp,\n  Unknown,\n} from '../utils';\nimport { IAuditReport, IExecContext, IScope, optional, Ticks } from '../utils';\n\nexport type Done<T = any> = (err?: any, res?: T | typeof optional) => void;\n\nexport type ControlFlowAction = 'break' | 'continue';\n\nexport interface ControlFlowSignal {\n  type: ControlFlowAction;\n  label?: string;\n}\n\ninterface ControlFlowTarget {\n  label?: string;\n  acceptsBreak: boolean;\n  acceptsContinue: boolean;\n  acceptsUnlabeledBreak: boolean;\n  acceptsUnlabeledContinue: boolean;\n}\n\nexport type ControlFlowTargets = readonly ControlFlowTarget[] | undefined;\n\nexport class ExecReturn<T> {\n  constructor(\n    public auditReport: IAuditReport | undefined,\n    public result: T,\n    public returned: boolean,\n    public controlFlow?: ControlFlowSignal,\n  ) {}\n\n  get breakLoop() {\n    return this.controlFlow?.type === 'break';\n  }\n\n  get continueLoop() {\n    return this.controlFlow?.type === 'continue';\n  }\n}\n\nexport interface IChange {\n  type: string;\n}\n\nexport interface ICreate extends IChange {\n  type: 'create';\n  prop: number | string;\n}\n\nexport interface IReplace extends IChange {\n  type: 'replace';\n}\n\nexport interface IDelete extends IChange {\n  type: 'delete';\n  prop: number | string;\n}\n\nexport interface IReverse extends IChange {\n  type: 'reverse';\n}\n\nexport interface ISort extends IChange {\n  type: 'sort';\n}\n\nexport interface IPush extends IChange {\n  type: 'push';\n  added: unknown[];\n}\n\nexport interface IPop extends IChange {\n  type: 'pop';\n  removed: unknown[];\n}\n\nexport interface IShift extends IChange {\n  type: 'shift';\n  removed: unknown[];\n}\n\nexport interface IUnShift extends IChange {\n  type: 'unshift';\n  added: unknown[];\n}\n\nexport interface ISplice extends IChange {\n  type: 'splice';\n  startIndex: number;\n  deleteCount: number;\n  added: unknown[];\n  removed: unknown[];\n}\n\nexport interface ICopyWithin extends IChange {\n  type: 'copyWithin';\n  startIndex: number;\n  endIndex: number;\n  added: unknown[];\n  removed: unknown[];\n}\n\nexport type Change =\n  | ICreate\n  | IReplace\n  | IDelete\n  | IReverse\n  | ISort\n  | IPush\n  | IPop\n  | IUnShift\n  | IShift\n  | ISplice\n  | ICopyWithin;\n\nconst emptyControlFlowTargets: readonly ControlFlowTarget[] = [];\n\nexport function normalizeStatementLabel(label: StatementLabel | undefined) {\n  return label === undefined || label === LispType.None ? undefined : label;\n}\n\nexport function normalizeStatementLabels(label: LispItem | StatementLabel | undefined) {\n  if (label === undefined || label === LispType.None) return [] as string[];\n  if (Array.isArray(label) && !isLisp(label)) {\n    return label.filter((item): item is string => typeof item === 'string');\n  }\n  return [label as string];\n}\n\nexport function createLoopTarget(label?: string, acceptsUnlabeled = true): ControlFlowTarget {\n  return {\n    label,\n    acceptsBreak: true,\n    acceptsContinue: true,\n    acceptsUnlabeledBreak: acceptsUnlabeled,\n    acceptsUnlabeledContinue: acceptsUnlabeled,\n  };\n}\n\nexport function createSwitchTarget(label?: string): ControlFlowTarget {\n  return {\n    label,\n    acceptsBreak: true,\n    acceptsContinue: false,\n    acceptsUnlabeledBreak: true,\n    acceptsUnlabeledContinue: false,\n  };\n}\n\nexport function createLabeledStatementTarget(label?: string): ControlFlowTarget | undefined {\n  if (!label) return undefined;\n  return {\n    label,\n    acceptsBreak: true,\n    acceptsContinue: false,\n    acceptsUnlabeledBreak: false,\n    acceptsUnlabeledContinue: false,\n  };\n}\n\nexport function addControlFlowTarget(\n  controlFlowTargets: ControlFlowTargets,\n  target?: ControlFlowTarget,\n): ControlFlowTargets {\n  if (!target) return controlFlowTargets;\n  return [...(controlFlowTargets || emptyControlFlowTargets), target];\n}\n\nexport function addControlFlowTargets(\n  controlFlowTargets: ControlFlowTargets,\n  targets: ControlFlowTarget[],\n): ControlFlowTargets {\n  return targets.reduce(\n    (currentTargets, target) => addControlFlowTarget(currentTargets, target),\n    controlFlowTargets,\n  );\n}\n\nexport function matchesControlFlowTarget(signal: ControlFlowSignal, target: ControlFlowTarget) {\n  if (signal.type === 'continue') {\n    if (!target.acceptsContinue) return false;\n    return signal.label ? target.label === signal.label : target.acceptsUnlabeledContinue;\n  }\n  if (!target.acceptsBreak) return false;\n  return signal.label ? target.label === signal.label : target.acceptsUnlabeledBreak;\n}\n\nexport function findControlFlowTarget(\n  controlFlowTargets: ControlFlowTargets,\n  type: ControlFlowAction,\n  label?: string,\n) {\n  if (!controlFlowTargets) return undefined;\n  for (let i = controlFlowTargets.length - 1; i >= 0; i--) {\n    const target = controlFlowTargets[i];\n    if (label) {\n      if (target.label !== label) continue;\n      if (type === 'continue' ? target.acceptsContinue : target.acceptsBreak) {\n        return target;\n      }\n      return null;\n    }\n    if (type === 'continue' ? target.acceptsUnlabeledContinue : target.acceptsUnlabeledBreak) {\n      return target;\n    }\n  }\n  return undefined;\n}\n\nfunction generateArgs(argNames: string[], args: unknown[]) {\n  const vars: Record<string, unknown> = {};\n  argNames.forEach((arg, i) => {\n    if (arg.startsWith('...')) {\n      vars[arg.substring(3)] = args.slice(i);\n    } else {\n      vars[arg] = args[i];\n    }\n  });\n  return vars;\n}\n\nexport function createFunction(\n  argNames: string[],\n  parsed: Lisp[],\n  ticks: Ticks,\n  context: IExecContext,\n  scope?: Scope,\n  name?: string,\n  internal = false,\n) {\n  if (context.ctx.options.forbidFunctionCreation) {\n    throw new SandboxCapabilityError('Function creation is forbidden');\n  }\n  let func;\n  if (name === undefined) {\n    func = (...args: unknown[]) => {\n      const vars = generateArgs(argNames, args);\n      const res = executeTree(\n        ticks,\n        context,\n        parsed,\n        scope === undefined ? [] : [new Scope(scope, vars)],\n        undefined,\n        internal,\n      );\n      return res.result;\n    };\n  } else {\n    func = function sandboxedObject(this: Unknown, ...args: unknown[]) {\n      const vars = generateArgs(argNames, args);\n      const res = executeTree(\n        ticks,\n        context,\n        parsed,\n        scope === undefined ? [] : [new Scope(scope, vars, this)],\n        undefined,\n        internal,\n      );\n      return res.result;\n    };\n  }\n  context.registerSandboxFunction(func);\n  context.ctx.sandboxedFunctions.add(func);\n  return func;\n}\n\nexport function createFunctionAsync(\n  argNames: string[],\n  parsed: Lisp[],\n  ticks: Ticks,\n  context: IExecContext,\n  scope?: Scope,\n  name?: string,\n  internal = false,\n) {\n  if (context.ctx.options.forbidFunctionCreation) {\n    throw new SandboxCapabilityError('Function creation is forbidden');\n  }\n  if (!context.ctx.prototypeWhitelist?.has(Promise.prototype)) {\n    throw new SandboxCapabilityError('Async/await not permitted');\n  }\n  let func;\n  if (name === undefined) {\n    func = async (...args: unknown[]) => {\n      const vars = generateArgs(argNames, args);\n      const res = await executeTreeAsync(\n        ticks,\n        context,\n        parsed,\n        scope === undefined ? [] : [new Scope(scope, vars)],\n        undefined,\n        internal,\n      );\n      return res.result;\n    };\n  } else {\n    func = async function sandboxedObject(this: Unknown, ...args: unknown[]) {\n      const vars = generateArgs(argNames, args);\n      const res = await executeTreeAsync(\n        ticks,\n        context,\n        parsed,\n        scope === undefined ? [] : [new Scope(scope, vars, this)],\n        undefined,\n        internal,\n      );\n      return res.result;\n    };\n  }\n  context.registerSandboxFunction(func);\n  context.ctx.sandboxedFunctions.add(func);\n  return func;\n}\n\n// Sentinel class used to communicate yield values from the executor back to the generator.\nexport class YieldValue {\n  constructor(\n    public value: unknown,\n    public delegate: boolean,\n  ) {}\n}\n\n// Unique sentinel thrown by captureYieldFn in executeGenBody's default case when a new\n// synchronous yield is encountered. Propagates through the call stack back to the restart loop.\nconst syncYieldPauseSentinel = Symbol('syncYieldPause');\n\nfunction asIterableIterator(value: unknown): Iterator<unknown> & Iterable<unknown> {\n  const iterator =\n    (value as { [Symbol.iterator]?: () => Iterator<unknown> })?.[Symbol.iterator]?.() ??\n    (value as Iterator<unknown>);\n\n  if (!iterator || typeof iterator.next !== 'function') {\n    throw new TypeError('yield* target is not iterable');\n  }\n\n  if (typeof (iterator as Iterator<unknown> & Iterable<unknown>)[Symbol.iterator] === 'function') {\n    return iterator as Iterator<unknown> & Iterable<unknown>;\n  }\n\n  return {\n    next: iterator.next.bind(iterator),\n    throw: iterator.throw?.bind(iterator),\n    return: iterator.return?.bind(iterator),\n    [Symbol.iterator]() {\n      return this;\n    },\n  };\n}\n\nfunction asAsyncIterableIterator(value: unknown): AsyncIterator<unknown> & AsyncIterable<unknown> {\n  const asyncIterator = (value as { [Symbol.asyncIterator]?: () => AsyncIterator<unknown> })?.[\n    Symbol.asyncIterator\n  ]?.();\n\n  if (asyncIterator) {\n    return {\n      next: asyncIterator.next.bind(asyncIterator),\n      throw: asyncIterator.throw?.bind(asyncIterator),\n      return: asyncIterator.return?.bind(asyncIterator),\n      [Symbol.asyncIterator]() {\n        return this;\n      },\n    };\n  }\n\n  const iterator = asIterableIterator(value);\n  return {\n    async next(nextValue?: unknown) {\n      return iterator.next(nextValue);\n    },\n    async throw(err?: unknown) {\n      if (typeof iterator.throw === 'function') {\n        return iterator.throw(err);\n      }\n      throw err;\n    },\n    async return(valueToReturn?: unknown) {\n      if (typeof iterator.return === 'function') {\n        return iterator.return(valueToReturn);\n      }\n      return { value: valueToReturn, done: true };\n    },\n    [Symbol.asyncIterator]() {\n      return this;\n    },\n  };\n}\n\n// executeGenBody: a native generator that lazily executes a generator function body.\n// It handles compound control-flow nodes (statements, if, loop, try, yield) with yield*\n// recursion, and falls back to the existing execSync for all leaf expressions.\n// Only used by createGeneratorFunction — nothing else in the executor is changed.\nfunction* executeGenBody(\n  ticks: Ticks,\n  tree: Lisp | Lisp[],\n  scope: Scope,\n  context: IExecContext,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n): Generator<unknown, ExecReturn<unknown> | unknown, unknown> {\n  // ── Statement list ──────────────────────────────────────────────────────────\n  if (!isLisp(tree as Lisp) && Array.isArray(tree)) {\n    const stmts = tree as Lisp[];\n    if (stmts.length === 0 || (stmts[0] as unknown) === LispType.None) {\n      return new ExecReturn(context.ctx.auditReport, undefined, false);\n    }\n    for (const stmt of stmts) {\n      const res = (yield* executeGenBody(\n        ticks,\n        stmt,\n        scope,\n        context,\n        statementLabels,\n        internal,\n      )) as ExecReturn<unknown>;\n      if (res instanceof ExecReturn && (res.returned || res.controlFlow)) return res;\n      // Mirror _executeWithDoneSync: wrap the result of a return statement\n      if (isLisp(stmt) && (stmt as Lisp)[0] === LispType.Return) {\n        return new ExecReturn(context.ctx.auditReport, res.result, true);\n      }\n    }\n    return new ExecReturn(context.ctx.auditReport, undefined, false);\n  }\n\n  const [op, a, b] = tree as Lisp;\n\n  switch (op) {\n    // ── yield expr ────────────────────────────────────────────────────────────\n    case LispType.Yield: {\n      const valResult = (yield* executeGenBody(\n        ticks,\n        a as Lisp,\n        scope,\n        context,\n        statementLabels,\n        internal,\n      )) as ExecReturn<unknown>;\n      const sanitized = sanitizeProp(valResult.result, context);\n      const injected: unknown = yield sanitized; // ← real pause point\n      return new ExecReturn(context.ctx.auditReport, injected, false);\n    }\n\n    // ── yield* expr ───────────────────────────────────────────────────────────\n    case LispType.YieldDelegate: {\n      const iterResult = (yield* executeGenBody(\n        ticks,\n        a as Lisp,\n        scope,\n        context,\n        statementLabels,\n        internal,\n      )) as ExecReturn<unknown>;\n      const delegatee = sanitizeProp(iterResult.result, context);\n      const result: unknown = yield* asIterableIterator(delegatee);\n      return new ExecReturn(context.ctx.auditReport, result, false);\n    }\n\n    // ── if / else ─────────────────────────────────────────────────────────────\n    // LispType.If is NOT in unexecTypes — its `a` is the raw condition Lisp,\n    // `b` is the raw IfCase node that evaluates to an If object with .t/.f.\n    case LispType.If: {\n      const condResult = (yield* executeGenBody(\n        ticks,\n        a as Lisp,\n        scope,\n        context,\n        statementLabels,\n        internal,\n      )) as ExecReturn<unknown>;\n      const ifCase = syncDone((d) =>\n        execSync(ticks, b as Lisp, scope, context, d, statementLabels, internal, undefined),\n      ).result as If;\n      const branch = sanitizeProp(condResult.result, context) ? ifCase.t : ifCase.f;\n      if (branch) {\n        return (yield* executeGenBody(\n          ticks,\n          branch,\n          scope,\n          context,\n          statementLabels,\n          internal,\n        )) as ExecReturn<unknown>;\n      }\n      return new ExecReturn(context.ctx.auditReport, undefined, false);\n    }\n\n    // ── loops (while / for / for-of / for-in / do-while) ─────────────────────\n    // Mirror the sync path of the existing Loop handler (executor.ts ~1421-1475)\n    // but replace `executeTree(b, ...)` with `yield*`.\n    case LispType.Loop: {\n      const [\n        checkFirst,\n        startInternal,\n        getIterator,\n        startStep,\n        step,\n        condition,\n        beforeStep,\n        isForAwait,\n        label,\n      ] = a as Lisp[];\n      if ((isForAwait as unknown as LispType) === LispType.True) {\n        throw new SyntaxError('for-await-of loops are only allowed inside async functions');\n      }\n      const loopStatementTargets = [\n        ...normalizeStatementLabels(label).map((loopLabel) => createLoopTarget(loopLabel, false)),\n        createLoopTarget(),\n      ];\n      const loopTargets = addControlFlowTargets(statementLabels, loopStatementTargets);\n      const loopScope = new Scope(scope, {});\n      const internalVars: Record<string, unknown> = { $$obj: undefined };\n      const interalScope = new Scope(loopScope, internalVars);\n\n      syncDone((d) =>\n        execSync(ticks, startStep, loopScope, context, d, undefined, internal, undefined),\n      );\n      internalVars['$$obj'] = syncDone((d) =>\n        execSync(ticks, getIterator, loopScope, context, d, undefined, internal, undefined),\n      ).result;\n      syncDone((d) =>\n        execSync(ticks, startInternal, interalScope, context, d, undefined, internal, undefined),\n      );\n\n      let loop: unknown = true;\n      if (checkFirst) {\n        loop = syncDone((d) =>\n          execSync(ticks, condition, interalScope, context, d, undefined, internal, undefined),\n        ).result;\n      }\n\n      while (loop) {\n        const iterScope = new Scope(interalScope, {});\n        syncDone((d) =>\n          execSync(ticks, beforeStep, iterScope, context, d, undefined, internal, undefined),\n        );\n\n        const res = (yield* executeGenBody(\n          ticks,\n          b as Lisp[],\n          iterScope,\n          context,\n          loopTargets,\n          internal,\n        )) as ExecReturn<unknown>;\n\n        if (res.returned) return res;\n        if (res.controlFlow) {\n          if (!loopStatementTargets.some((t) => matchesControlFlowTarget(res.controlFlow!, t))) {\n            return res; // break/continue targeting an outer labeled loop\n          }\n          if (res.breakLoop) break;\n          // continueLoop: fall through to step + condition check\n        }\n        syncDone((d) =>\n          execSync(ticks, step, interalScope, context, d, undefined, internal, undefined),\n        );\n        loop = syncDone((d) =>\n          execSync(ticks, condition, interalScope, context, d, undefined, internal, undefined),\n        ).result;\n      }\n      return new ExecReturn(context.ctx.auditReport, undefined, false);\n    }\n\n    // ── try / catch / finally ─────────────────────────────────────────────────\n    // Using real native try/catch/finally gives us correct gen.throw() and\n    // gen.return() semantics for free (the native generator machinery handles them).\n    case LispType.Try: {\n      const [exception, catchBody, finallyBody] = b as [string, Lisp[], Lisp[]];\n      let result!: ExecReturn<unknown>;\n      let finalOverride: ExecReturn<unknown> | undefined;\n      try {\n        result = (yield* executeGenBody(\n          ticks,\n          a as Lisp[],\n          scope,\n          context,\n          statementLabels,\n          internal,\n        )) as ExecReturn<unknown>;\n      } catch (e) {\n        if (exception && catchBody?.length > 0) {\n          const catchScope = new Scope(scope, { [exception]: e });\n          result = (yield* executeGenBody(\n            ticks,\n            catchBody,\n            catchScope,\n            context,\n            statementLabels,\n            internal,\n          )) as ExecReturn<unknown>;\n        } else {\n          throw e;\n        }\n      } finally {\n        if (finallyBody?.length > 0) {\n          const fr = (yield* executeGenBody(\n            ticks,\n            finallyBody,\n            scope,\n            context,\n            statementLabels,\n            internal,\n          )) as ExecReturn<unknown>;\n          // finally control flow (return/break/continue) overrides everything\n          if (fr.returned || fr.controlFlow) {\n            finalOverride = fr;\n          }\n        }\n      }\n      if (finalOverride) return finalOverride;\n      return result;\n    }\n\n    // ── labeled statement ─────────────────────────────────────────────────────\n    case LispType.Labeled: {\n      const target = createLabeledStatementTarget(normalizeStatementLabel(a as StatementLabel));\n      const newTargets = addControlFlowTargets(statementLabels, target ? [target] : []);\n      const res = (yield* executeGenBody(\n        ticks,\n        b as Lisp,\n        scope,\n        context,\n        newTargets,\n        internal,\n      )) as ExecReturn<unknown>;\n      if (res.controlFlow && target && matchesControlFlowTarget(res.controlFlow, target)) {\n        return new ExecReturn(context.ctx.auditReport, res.result, false);\n      }\n      return res;\n    }\n\n    // ── everything else ───────────────────────────────────────────────────────\n    // Arithmetic, property access, function calls, assignments, etc. are\n    // delegated to execSync. However, a yield expression may be nested inside\n    // a non-unexecType node (e.g. `const x = yield 1`). In that case the\n    // existing sync yield handler throws syncYieldPauseSentinel. We restart\n    // execSync from scratch on each such pause, skipping already-completed\n    // yields by immediately calling their continuation with the stored result.\n    default: {\n      let completedYields = 0;\n      const yieldResults: unknown[] = [];\n      while (true) {\n        let currentYieldIdx = 0;\n        let capturedValue: unknown = undefined;\n        let capturedDelegate = false;\n        let yielded = false;\n        const captureYieldFn = (yv: YieldValue, continueDone?: Done) => {\n          if (currentYieldIdx < completedYields) {\n            // This yield already happened in a prior iteration; fast-forward.\n            continueDone!(undefined, yieldResults[currentYieldIdx]);\n            currentYieldIdx++;\n            return;\n          }\n          // New yield: capture the value and pause.\n          capturedValue = yv.value;\n          capturedDelegate = yv.delegate;\n          yielded = true;\n          currentYieldIdx++;\n          throw syncYieldPauseSentinel;\n        };\n        try {\n          const result = syncDone((d) =>\n            execSync(\n              ticks,\n              tree as Lisp,\n              scope,\n              context,\n              d,\n              statementLabels,\n              internal,\n              captureYieldFn,\n            ),\n          ).result;\n          if (result instanceof ExecReturn) return result;\n          return new ExecReturn(context.ctx.auditReport, result, false);\n        } catch (e) {\n          if (!yielded || e !== syncYieldPauseSentinel) throw e;\n          const resumedValue: unknown = capturedDelegate\n            ? yield* asIterableIterator(capturedValue)\n            : yield capturedValue;\n          yieldResults.push(resumedValue);\n          completedYields++;\n        }\n      }\n    }\n  }\n}\n\nexport function createGeneratorFunction(\n  argNames: string[],\n  parsed: Lisp[],\n  ticks: Ticks,\n  context: IExecContext,\n  scope?: Scope,\n  name?: string,\n  internal = false,\n) {\n  if (context.ctx.options.forbidFunctionCreation) {\n    throw new SandboxCapabilityError('Function creation is forbidden');\n  }\n  const makeGen = (thisArg: Unknown, args: unknown[]) => {\n    const vars = generateArgs(argNames, args);\n    const genScope =\n      scope === undefined ? new Scope(null, vars, thisArg) : new Scope(scope, vars, thisArg);\n\n    const executionGen = executeGenBody(ticks, parsed, genScope, context, undefined, internal);\n    let isDone = false;\n\n    function drive(action: () => IteratorResult<unknown>): IteratorResult<unknown> {\n      if (isDone) return { value: undefined, done: true };\n      try {\n        const r = action();\n        if (r.done) {\n          isDone = true;\n          return {\n            value: r.value instanceof ExecReturn ? r.value.result : r.value,\n            done: true,\n          };\n        }\n        return { value: r.value, done: false };\n      } catch (e) {\n        isDone = true;\n        throw e;\n      }\n    }\n\n    const iterator: Iterator<unknown> & Iterable<unknown> = {\n      next(value?: unknown) {\n        return drive(() => executionGen.next(value));\n      },\n      return(value?: unknown) {\n        return drive(() => executionGen.return(value));\n      },\n      throw(err?: unknown) {\n        return drive(() => executionGen.throw(err));\n      },\n      [Symbol.iterator]() {\n        return this;\n      },\n    };\n    return iterator;\n  };\n  const func = function sandboxedObject(this: Unknown, ...args: unknown[]) {\n    return makeGen(this, args);\n  };\n  Object.setPrototypeOf(func, GeneratorFunction.prototype);\n  context.registerSandboxFunction(func);\n  context.ctx.sandboxedFunctions.add(func);\n  return func;\n}\n\nexport function createAsyncGeneratorFunction(\n  argNames: string[],\n  parsed: Lisp[],\n  ticks: Ticks,\n  context: IExecContext,\n  scope?: Scope,\n  name?: string,\n  internal = false,\n) {\n  if (context.ctx.options.forbidFunctionCreation) {\n    throw new SandboxCapabilityError('Function creation is forbidden');\n  }\n  if (!context.ctx.prototypeWhitelist?.has(Promise.prototype)) {\n    throw new SandboxCapabilityError('Async/await not permitted');\n  }\n  const makeGen = (thisArg: Unknown, args: unknown[]) => {\n    const vars = generateArgs(argNames, args);\n    const genScope =\n      scope === undefined ? [new Scope(null, vars, thisArg)] : [new Scope(scope, vars, thisArg)];\n    return (async function* sandboxedAsyncGenerator(): AsyncGenerator<unknown, unknown, unknown> {\n      const yieldQueue: Array<{ yieldValue: YieldValue; continueDone?: Done }> = [];\n      let resolveYield: (() => void) | null = null;\n      const yieldFn = (yv: YieldValue, continueDone?: Done) => {\n        yieldQueue.push({ yieldValue: yv, continueDone });\n        if (resolveYield) {\n          resolveYield();\n          resolveYield = null;\n        }\n      };\n      const bodyPromise = executeTreeAsync(\n        ticks,\n        context,\n        parsed,\n        genScope,\n        undefined,\n        internal,\n        yieldFn,\n      );\n      let bodyDone = false;\n      let bodyResult: ExecReturn<unknown> | undefined;\n      let bodyError: unknown;\n      bodyPromise.then(\n        (r) => {\n          bodyDone = true;\n          bodyResult = r;\n          resolveYield?.();\n        },\n        (e) => {\n          bodyDone = true;\n          bodyError = e;\n          resolveYield?.();\n        },\n      );\n      while (true) {\n        if (yieldQueue.length === 0 && !bodyDone) {\n          await new Promise<void>((res) => {\n            resolveYield = res;\n          });\n        }\n        while (yieldQueue.length > 0) {\n          const { yieldValue, continueDone } = yieldQueue.shift()!;\n          try {\n            const resumedValue = yieldValue.delegate\n              ? yield* asAsyncIterableIterator(yieldValue.value)\n              : yield yieldValue.value;\n            continueDone?.(undefined, resumedValue);\n          } catch (err) {\n            continueDone?.(err);\n          }\n        }\n        if (bodyDone) break;\n      }\n      if (bodyError !== undefined) throw bodyError;\n      return bodyResult?.result;\n    })();\n  };\n  const func = function sandboxedObject(this: Unknown, ...args: unknown[]) {\n    return makeGen(this, args) as unknown as AsyncGenerator;\n  };\n  Object.setPrototypeOf(func, AsyncGeneratorFunction.prototype);\n  context.registerSandboxFunction(func);\n  context.ctx.sandboxedFunctions.add(func);\n  return func;\n}\n\nexport function assignCheck(obj: Prop, context: IExecContext, op = 'assign') {\n  if (obj.context === undefined) {\n    throw new ReferenceError(`Cannot ${op} value to undefined.`);\n  }\n  if (obj.isConst) {\n    throw new TypeError(`Assignment to constant variable.`);\n  }\n  if (obj.isGlobal) {\n    throw new SandboxAccessError(\n      `Cannot ${op} property '${obj.prop.toString()}' of a global object`,\n    );\n  }\n  if (obj.context === null) {\n    throw new TypeError('Cannot set properties of null');\n  }\n  if (\n    typeof (obj.context as any)[obj.prop] === 'function' &&\n    !hasOwnProperty(obj.context, obj.prop)\n  ) {\n    throw new SandboxAccessError(\n      `Override prototype property '${obj.prop.toString()}' not allowed`,\n    );\n  }\n  if (op === 'delete') {\n    if (hasOwnProperty(obj.context, obj.prop)) {\n      context.changeSubscriptions\n        .get(obj.context)\n        ?.forEach((cb) => cb({ type: 'delete', prop: obj.prop.toString() }));\n      context.changeSubscriptionsGlobal\n        .get(obj.context)\n        ?.forEach((cb) => cb({ type: 'delete', prop: obj.prop.toString() }));\n    }\n  } else if (hasOwnProperty(obj.context, obj.prop)) {\n    context.setSubscriptions\n      .get(obj.context)\n      ?.get(obj.prop.toString())\n      ?.forEach((cb) =>\n        cb({\n          type: 'replace',\n        }),\n      );\n    context.setSubscriptionsGlobal\n      .get(obj.context)\n      ?.get(obj.prop.toString())\n      ?.forEach((cb) =>\n        cb({\n          type: 'replace',\n        }),\n      );\n  } else {\n    context.changeSubscriptions\n      .get(obj.context)\n      ?.forEach((cb) => cb({ type: 'create', prop: obj.prop.toString() }));\n    context.changeSubscriptionsGlobal\n      .get(obj.context)\n      ?.forEach((cb) => cb({ type: 'create', prop: obj.prop.toString() }));\n  }\n}\nexport const arrayChange = new Set([\n  [].push,\n  [].pop,\n  [].shift,\n  [].unshift,\n  [].splice,\n  [].reverse,\n  [].sort,\n  [].copyWithin,\n]);\n\nexport class KeyVal {\n  constructor(\n    public key: PropertyKey | SpreadObject,\n    public val: unknown,\n  ) {}\n}\n\nexport class SpreadObject {\n  constructor(public item: { [key: string]: unknown }) {}\n}\n\nexport class SpreadArray {\n  constructor(public item: unknown[]) {}\n}\n\nexport class ArrayHole {}\n\nexport class If {\n  constructor(\n    public t: Lisp,\n    public f: Lisp,\n    public label?: string,\n  ) {}\n}\n\nexport const literalRegex = /(\\$\\$)*(\\$)?\\${(\\d+)}/g;\n\nexport { ops, addOps } from './opsRegistry';\nimport { ops, Execution } from './opsRegistry';\n\nexport const prorptyKeyTypes = ['string', 'number', 'symbol'];\n\nexport function isPropertyKey(val: unknown): val is PropertyKey {\n  return prorptyKeyTypes.includes(typeof val);\n}\n\nexport function hasPossibleProperties(val: unknown): val is {} {\n  return val !== null && val !== undefined;\n}\n\nimport './ops/index';\n\nexport function execMany(\n  ticks: Ticks,\n  exec: Execution,\n  tree: Lisp[],\n  done: Done,\n  scope: Scope,\n  context: IExecContext,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n) {\n  if (exec === execSync) {\n    _execManySync(ticks, tree, done, scope, context, statementLabels, internal, generatorYield);\n  } else {\n    _execManyAsync(\n      ticks,\n      tree,\n      done,\n      scope,\n      context,\n      statementLabels,\n      internal,\n      generatorYield,\n    ).catch(done);\n  }\n}\n\nfunction _execManySync(\n  ticks: Ticks,\n  tree: Lisp[],\n  done: Done,\n  scope: Scope,\n  context: IExecContext,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n) {\n  const ret: any[] = [];\n  for (let i = 0; i < tree.length; i++) {\n    let res = syncDone((d) =>\n      execSync(ticks, tree[i], scope, context, d, statementLabels, internal, generatorYield),\n    ).result;\n    if (res instanceof ExecReturn && (res.returned || res.breakLoop || res.continueLoop)) {\n      done(undefined, res);\n      return;\n    }\n    if (isLisp(tree[i]) && tree[i][0] === LispType.Return) {\n      done(undefined, new ExecReturn(context.ctx.auditReport, res, true));\n      return;\n    }\n    ret.push(res);\n  }\n  done(undefined, ret);\n}\n\nasync function _execManyAsync(\n  ticks: Ticks,\n  tree: Lisp[],\n  done: Done,\n  scope: Scope,\n  context: IExecContext,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n) {\n  const ret: any[] = [];\n  for (let i = 0; i < tree.length; i++) {\n    let res;\n    try {\n      let ad: AsyncDoneRet;\n      res =\n        (ad = asyncDone((d) =>\n          execAsync(ticks, tree[i], scope, context, d, statementLabels, internal, generatorYield),\n        )).isInstant === true\n          ? ad.instant\n          : (await ad.p).result;\n    } catch (e) {\n      done(e);\n      return;\n    }\n    if (res instanceof ExecReturn && (res.returned || res.breakLoop || res.continueLoop)) {\n      done(undefined, res);\n      return;\n    }\n    if (isLisp(tree[i]) && tree[i][0] === LispType.Return) {\n      done(undefined, new ExecReturn(context.ctx.auditReport, res, true));\n      return;\n    }\n    ret.push(res);\n  }\n  done(undefined, ret);\n}\n\nexport interface AsyncDoneRet {\n  isInstant: boolean;\n  instant: any;\n  p: Promise<{ result: any }>;\n}\n\nexport function asyncDone(callback: (done: Done) => void): AsyncDoneRet {\n  let isInstant = false;\n  let instant: unknown;\n  const p = new Promise<any>((resolve, reject) => {\n    callback((...args: unknown[]) => {\n      if (args.length === 1) reject(args[0]);\n      else {\n        isInstant = true;\n        instant = args[1];\n        resolve({ result: args[1] });\n      }\n    });\n  });\n  return {\n    isInstant,\n    instant,\n    p,\n  };\n}\n\nexport function syncDone(callback: (done: Done) => void): { result: any } {\n  let result;\n  let err: { error: unknown } | undefined;\n  callback((...args: unknown[]) => {\n    err = args.length === 1 ? { error: args[0] } : undefined;\n    result = args[1];\n  });\n  if (err) throw err.error;\n  return { result };\n}\n\nexport async function execAsync<T = any>(\n  ticks: Ticks,\n  tree: LispItem,\n  scope: Scope,\n  context: IExecContext,\n  doneOriginal: Done<T>,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n): Promise<void> {\n  let done: Done<T> = doneOriginal;\n  const p = new Promise<void>((resolve) => {\n    done = (...args: unknown[]) => {\n      doneOriginal(...args);\n      resolve();\n    };\n  });\n  if (\n    !_execNoneRecurse(\n      ticks,\n      tree,\n      scope,\n      context,\n      done,\n      true,\n      statementLabels,\n      internal,\n      generatorYield,\n    ) &&\n    isLisp(tree)\n  ) {\n    let op = tree[0];\n    let obj;\n    try {\n      let ad: AsyncDoneRet;\n      obj =\n        (ad = asyncDone((d) =>\n          execAsync(ticks, tree[1], scope, context, d, statementLabels, internal, generatorYield),\n        )).isInstant === true\n          ? ad.instant\n          : (await ad.p).result;\n    } catch (e) {\n      done(e);\n      return;\n    }\n    let a = obj;\n    try {\n      a = obj instanceof Prop ? obj.get(context) : obj;\n    } catch (e) {\n      done(e);\n      return;\n    }\n    if (op === LispType.PropOptional || op === LispType.CallOptional) {\n      if (a === undefined || a === null) {\n        done(undefined, optional);\n        return;\n      }\n      op = op === LispType.PropOptional ? LispType.Prop : LispType.Call;\n    }\n    if (a === optional) {\n      if (op === LispType.Prop || op === LispType.Call) {\n        done(undefined, a);\n        return;\n      } else {\n        a = undefined;\n      }\n    }\n    // Short-circuit for nullish coalescing: if a is not null/undefined, return a without evaluating b\n    if (op === LispType.NullishCoalescing && a !== undefined && a !== null) {\n      done(undefined, a);\n      return;\n    }\n    let bobj;\n    try {\n      let ad: AsyncDoneRet;\n      bobj =\n        (ad = asyncDone((d) =>\n          execAsync(ticks, tree[2], scope, context, d, statementLabels, internal, generatorYield),\n        )).isInstant === true\n          ? ad.instant\n          : (await ad.p).result;\n    } catch (e) {\n      done(e);\n      return;\n    }\n    let b = bobj;\n    try {\n      b = bobj instanceof Prop ? bobj.get(context) : bobj;\n    } catch (e) {\n      done(e);\n      return;\n    }\n    if (b === optional) {\n      b = undefined;\n    }\n    performOp({\n      op,\n      exec: execAsync,\n      done,\n      ticks,\n      a,\n      b,\n      obj,\n      context,\n      scope,\n      bobj,\n      statementLabels,\n      internal,\n      generatorYield,\n      tree,\n    });\n  }\n  await p;\n}\n\nexport function execSync<T = any>(\n  ticks: Ticks,\n  tree: LispItem,\n  scope: Scope,\n  context: IExecContext,\n  done: Done<T>,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n) {\n  if (\n    !_execNoneRecurse(\n      ticks,\n      tree,\n      scope,\n      context,\n      done,\n      false,\n      statementLabels,\n      internal,\n      generatorYield,\n    ) &&\n    isLisp(tree)\n  ) {\n    let op = tree[0];\n    let obj = syncDone((d) =>\n      execSync(ticks, tree[1], scope, context, d, statementLabels, internal, generatorYield),\n    ).result;\n    let a = obj instanceof Prop ? obj.get(context) : obj;\n    if (op === LispType.PropOptional || op === LispType.CallOptional) {\n      if (a === undefined || a === null) {\n        done(undefined, optional);\n        return;\n      }\n      op = op === LispType.PropOptional ? LispType.Prop : LispType.Call;\n    }\n    if (a === optional) {\n      if (op === LispType.Prop || op === LispType.Call) {\n        done(undefined, a);\n        return;\n      } else {\n        a = undefined;\n      }\n    }\n    // Short-circuit for nullish coalescing: if a is not null/undefined, return a without evaluating b\n    if (op === LispType.NullishCoalescing && a !== undefined && a !== null) {\n      done(undefined, a);\n      return;\n    }\n    let bobj = syncDone((d) =>\n      execSync(ticks, tree[2], scope, context, d, statementLabels, internal, generatorYield),\n    ).result;\n    let b = bobj instanceof Prop ? bobj.get(context) : bobj;\n    if (b === optional) {\n      b = undefined;\n    }\n    performOp({\n      op,\n      exec: execSync,\n      done,\n      ticks,\n      a,\n      b,\n      obj,\n      context,\n      scope,\n      bobj,\n      statementLabels,\n      internal,\n      generatorYield,\n      tree,\n    });\n  }\n}\n\ntype OpsCallbackParams<a, b, obj, bobj> = {\n  op: LispType;\n  exec: Execution;\n  a: a;\n  b: b;\n  obj: obj;\n  bobj: bobj;\n  ticks: Ticks;\n  tree: LispItem;\n  scope: Scope;\n  context: IExecContext;\n  done: Done;\n  statementLabels: ControlFlowTargets;\n  internal: boolean;\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined;\n};\n\nexport function checkHaltExpectedTicks(\n  params: OpsCallbackParams<any, any, any, any>,\n  expectTicks = 0n,\n): boolean {\n  const sandbox = params.context.ctx.sandbox;\n  const { ticks, scope, context } = params;\n  if (sandbox.halted) {\n    const sub = sandbox.subscribeResume(() => {\n      sub.unsubscribe();\n      performOp(params, false);\n    });\n    return true;\n  } else if (ticks.tickLimit !== undefined && ticks.tickLimit <= ticks.ticks + expectTicks) {\n    const error = new SandboxExecutionQuotaExceededError('Execution quota exceeded');\n    if (context.ctx.options.haltOnSandboxError) {\n      const sub = sandbox.subscribeResume(() => {\n        sub.unsubscribe();\n        performOp(params);\n      });\n      sandbox.haltExecution({\n        type: 'error',\n        error,\n        ticks,\n        scope,\n        context,\n      });\n    } else {\n      params.done(error);\n    }\n    return true;\n  } else if (ticks.nextYield && ticks.ticks > ticks.nextYield) {\n    const sub = sandbox.subscribeResume(() => {\n      sub.unsubscribe();\n      performOp(params, false);\n    });\n    ticks.nextYield += NON_BLOCKING_THRESHOLD;\n    sandbox.haltExecution({ type: 'yield' });\n    setTimeout(() => sandbox.resumeExecution());\n    return true;\n  }\n  ticks.ticks += expectTicks;\n  return false;\n}\n\nfunction performOp(params: OpsCallbackParams<any, any, any, any>, count = true) {\n  const { done, op, ticks, context, scope } = params;\n  if (count) {\n    ticks.ticks++;\n  }\n  const sandbox = context.ctx.sandbox;\n\n  try {\n    if (checkHaltExpectedTicks(params)) {\n      return;\n    }\n    const o = ops.get(op);\n    if (o === undefined) {\n      done(new SandboxExecutionTreeError('Unknown operator: ' + op));\n      return;\n    }\n    o(params);\n  } catch (err) {\n    if (context.ctx.options.haltOnSandboxError && err instanceof SandboxError) {\n      const sub = sandbox.subscribeResume(() => {\n        sub.unsubscribe();\n        done(err);\n      });\n      sandbox.haltExecution({\n        type: 'error',\n        error: err,\n        ticks,\n        scope,\n        context,\n      });\n    } else {\n      done(err);\n    }\n  }\n}\n\nconst unexecTypes = new Set([\n  LispType.ArrowFunction,\n  LispType.Function,\n  LispType.InlineFunction,\n  LispType.Loop,\n  LispType.Try,\n  LispType.Switch,\n  LispType.IfCase,\n  LispType.InlineIfCase,\n  LispType.Labeled,\n  LispType.Typeof,\n]);\n\nfunction _execNoneRecurse<T = any>(\n  ticks: Ticks,\n  tree: LispItem,\n  scope: Scope,\n  context: IExecContext,\n  done: Done<T>,\n  isAsync: boolean,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n): boolean {\n  const exec = isAsync ? execAsync : execSync;\n  if (tree instanceof Prop) {\n    done(undefined, tree.get(context));\n  } else if (tree === optional) {\n    done();\n  } else if (Array.isArray(tree) && !isLisp(tree)) {\n    if (tree[0] === LispType.None) {\n      done();\n    } else {\n      execMany(\n        ticks,\n        exec,\n        tree as Lisp[],\n        done,\n        scope,\n        context,\n        statementLabels,\n        internal,\n        generatorYield,\n      );\n    }\n  } else if (!isLisp(tree)) {\n    done(undefined, tree);\n  } else if (tree[0] === LispType.Block) {\n    execMany(\n      ticks,\n      exec,\n      tree[1] as Lisp[],\n      done,\n      new Scope(scope),\n      context,\n      statementLabels,\n      internal,\n      generatorYield,\n    );\n  } else if (tree[0] === LispType.InternalBlock) {\n    execMany(\n      ticks,\n      exec,\n      tree[1] as Lisp[],\n      done,\n      scope,\n      context,\n      statementLabels,\n      true,\n      generatorYield,\n    );\n  } else if (tree[0] === LispType.Await) {\n    if (!isAsync) {\n      done(new SyntaxError(\"Illegal use of 'await', must be inside async function\"));\n    } else if (context.ctx.prototypeWhitelist?.has(Promise.prototype)) {\n      execAsync(\n        ticks,\n        tree[1],\n        scope,\n        context,\n        async (...args: unknown[]) => {\n          if (args.length === 1) done(args[0]);\n          else\n            try {\n              done(undefined, (await sanitizeProp(args[1], context)) as any);\n            } catch (err) {\n              done(err);\n            }\n        },\n        statementLabels,\n        internal,\n        generatorYield,\n      ).catch(done);\n    } else {\n      done(new SandboxCapabilityError('Async/await is not permitted'));\n    }\n  } else if (tree[0] === LispType.Yield || tree[0] === LispType.YieldDelegate) {\n    const yieldFn = generatorYield;\n    if (!yieldFn) {\n      done(new SyntaxError(\"Illegal use of 'yield', must be inside a generator function\"));\n      return true;\n    }\n    const isDelegate = tree[0] === LispType.YieldDelegate;\n    if (isAsync) {\n      execAsync(\n        ticks,\n        tree[1],\n        scope,\n        context,\n        async (...args: unknown[]) => {\n          if (args.length === 1) {\n            done(args[0]);\n            return;\n          }\n          try {\n            const val = await sanitizeProp(args[1], context);\n            yieldFn(new YieldValue(val, isDelegate), done);\n          } catch (err) {\n            done(err);\n          }\n        },\n        statementLabels,\n        internal,\n        generatorYield,\n      ).catch(done);\n    } else {\n      try {\n        const val = syncDone((d) =>\n          execSync(ticks, tree[1], scope, context, d, statementLabels, internal, generatorYield),\n        ).result;\n        const sanitized = sanitizeProp(val, context);\n        // Pass `done` as second arg so the yieldFn can call it with the injected value.\n        // For capture-mode yieldFns (executeGenBody default case), this enables the restart loop.\n        // For plain yieldFns (eager mode), done? is ignored and done() is called below.\n        yieldFn(new YieldValue(sanitized, isDelegate), done);\n        // If yieldFn did not call done (it threw syncYieldPauseSentinel instead), we fall through\n        // to the catch which re-throws the sentinel. Otherwise yieldFn called done itself.\n      } catch (err) {\n        if (err === syncYieldPauseSentinel) throw err; // propagate pause up to restart loop\n        done(err);\n      }\n    }\n  } else if (unexecTypes.has(tree[0])) {\n    performOp({\n      op: tree[0],\n      exec,\n      done,\n      ticks,\n      a: tree[1],\n      b: tree[2],\n      obj: tree,\n      tree,\n      context,\n      scope,\n      bobj: undefined,\n      statementLabels,\n      internal,\n      generatorYield,\n    });\n  } else {\n    return false;\n  }\n  return true;\n}\nexport function executeTree<T>(\n  ticks: Ticks,\n  context: IExecContext,\n  executionTree: Lisp[],\n  scopes: IScope[] = [],\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield?: ((yv: YieldValue, done?: Done) => void) | undefined,\n): ExecReturn<T> {\n  return syncDone((done) =>\n    executeTreeWithDone(\n      execSync,\n      done,\n      ticks,\n      context,\n      executionTree,\n      scopes,\n      statementLabels,\n      internal,\n      generatorYield,\n    ),\n  ).result;\n}\n\nexport async function executeTreeAsync<T>(\n  ticks: Ticks,\n  context: IExecContext,\n  executionTree: Lisp[],\n  scopes: IScope[] = [],\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield?: ((yv: YieldValue, done?: Done) => void) | undefined,\n): Promise<ExecReturn<T>> {\n  let ad: AsyncDoneRet;\n  return (ad = asyncDone((done) =>\n    executeTreeWithDone(\n      execAsync,\n      done,\n      ticks,\n      context,\n      executionTree,\n      scopes,\n      statementLabels,\n      internal,\n      generatorYield,\n    ),\n  )).isInstant === true\n    ? ad.instant\n    : (await ad.p).result;\n}\n\nexport function executeTreeWithDone(\n  exec: Execution,\n  done: Done,\n  ticks: Ticks,\n  context: IExecContext,\n  executionTree: Lisp[],\n  scopes: IScope[] = [],\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield?: ((yv: YieldValue, done?: Done) => void) | undefined,\n) {\n  if (!executionTree) {\n    done();\n    return;\n  }\n  if (!(executionTree instanceof Array)) {\n    throw new SyntaxError('Bad execution tree');\n  }\n  let scope = context.ctx.globalScope;\n  let s;\n  while ((s = scopes.shift())) {\n    if (typeof s !== 'object') continue;\n    if (s instanceof Scope) {\n      scope = s;\n    } else {\n      scope = new Scope(scope, s, s instanceof LocalScope ? undefined : null);\n    }\n  }\n  if (context.ctx.options.audit && !context.ctx.auditReport) {\n    context.ctx.auditReport = {\n      globalsAccess: new Set(),\n      prototypeAccess: {},\n    };\n  }\n  if (exec === execSync) {\n    _executeWithDoneSync(\n      done,\n      ticks,\n      context,\n      executionTree,\n      scope,\n      statementLabels,\n      internal,\n      generatorYield,\n    );\n  } else {\n    _executeWithDoneAsync(\n      done,\n      ticks,\n      context,\n      executionTree,\n      scope,\n      statementLabels,\n      internal,\n      generatorYield,\n    ).catch(done);\n  }\n}\n\nfunction _executeWithDoneSync(\n  done: Done,\n  ticks: Ticks,\n  context: IExecContext,\n  executionTree: Lisp[],\n  scope: Scope,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n) {\n  if (!(executionTree instanceof Array)) throw new SyntaxError('Bad execution tree');\n  let i = 0;\n  for (i = 0; i < executionTree.length; i++) {\n    let res: unknown;\n    let err: { error: unknown } | undefined;\n    const current = executionTree[i];\n    try {\n      execSync(\n        ticks,\n        current,\n        scope,\n        context,\n        (...args: unknown[]) => {\n          if (args.length === 1) err = { error: args[0] };\n          else res = args[1];\n        },\n        statementLabels,\n        internal,\n        generatorYield,\n      );\n    } catch (e) {\n      err = { error: e };\n    }\n    if (err) {\n      done(err.error);\n      return;\n    }\n    if (res instanceof ExecReturn) {\n      done(undefined, res);\n      return;\n    }\n    if (isLisp(current) && current[0] === LispType.Return) {\n      done(undefined, new ExecReturn(context.ctx.auditReport, res, true));\n      return;\n    }\n  }\n  done(undefined, new ExecReturn(context.ctx.auditReport, undefined, false));\n}\n\nasync function _executeWithDoneAsync(\n  done: Done,\n  ticks: Ticks,\n  context: IExecContext,\n  executionTree: Lisp[],\n  scope: Scope,\n  statementLabels: ControlFlowTargets,\n  internal: boolean,\n  generatorYield: ((yv: YieldValue, done?: Done) => void) | undefined,\n) {\n  if (!(executionTree instanceof Array)) throw new SyntaxError('Bad execution tree');\n  let i = 0;\n  for (i = 0; i < executionTree.length; i++) {\n    let res: unknown;\n    let err: { error: unknown } | undefined;\n    const current = executionTree[i];\n    try {\n      await execAsync(\n        ticks,\n        current,\n        scope,\n        context,\n        (...args: unknown[]) => {\n          if (args.length === 1) err = { error: args[0] };\n          else res = args[1];\n        },\n        statementLabels,\n        internal,\n        generatorYield,\n      );\n    } catch (e) {\n      err = { error: e };\n    }\n    if (err) {\n      done(err.error);\n      return;\n    }\n    if (res instanceof ExecReturn) {\n      done(undefined, res);\n      return;\n    }\n    if (isLisp(current) && current[0] === LispType.Return) {\n      done(undefined, new ExecReturn(context.ctx.auditReport, res, true));\n      return;\n    }\n  }\n  done(undefined, new ExecReturn(context.ctx.auditReport, undefined, false));\n}\n","import { CodeString, LispType, SandboxCapabilityError } from '../../utils';\nimport type { IConstants, IfLisp, IfCase, Lisp, Switch, SwitchCase } from '../lisp';\nimport type { RegisterLispTypesDeps } from './shared';\n\nexport function registerConditionalLispTypes({\n  createLisp,\n  emptyString,\n  extractStatementLabels,\n  insertSemicolons,\n  lispifyBlock,\n  lispifyExpr,\n  restOfExp,\n  semiColon,\n  setLispType,\n  wrapLabeledStatement,\n}: RegisterLispTypesDeps) {\n  const inlineIfElse = /^:/;\n  const elseIf = /^else(?![\\w$])/;\n  const ifElse = /^if(?![\\w$])/;\n\n  function extractIfElse(constants: IConstants, part: CodeString, depth = 0) {\n    if (depth > constants.maxDepth) {\n      throw new SandboxCapabilityError('Maximum expression depth exceeded');\n    }\n    let count = 0;\n    let found = part.substring(0, 0);\n    let foundElse = emptyString;\n    let foundTrue: CodeString | undefined;\n    let first = true;\n    let elseReg: RegExpExecArray | null;\n    let details: any = {};\n    while (\n      (found = restOfExp(\n        constants,\n        part.substring(found.end - part.start),\n        [elseIf, ifElse, semiColon],\n        undefined,\n        undefined,\n        undefined,\n        details,\n      )).length ||\n      first\n    ) {\n      first = false;\n      const f = part.substring(found.end - part.start).toString();\n\n      if (f.startsWith('if')) {\n        found.end++;\n        count++;\n      } else if (f.startsWith('else')) {\n        foundTrue = part.substring(0, found.end - part.start);\n        found.end++;\n        count--;\n        if (!count) {\n          found.end--;\n        }\n      } else if ((elseReg = /^;?\\s*else(?![\\w$])/.exec(f))) {\n        foundTrue = part.substring(0, found.end - part.start);\n        found.end += elseReg[0].length - 1;\n        count--;\n        if (!count) {\n          found.end -= elseReg[0].length - 1;\n        }\n      } else {\n        foundTrue = foundElse.length ? foundTrue : part.substring(0, found.end - part.start);\n        break;\n      }\n      if (!count) {\n        const ie = extractIfElse(\n          constants,\n          part.substring(found.end - part.start + (/^;?\\s*else(?![\\w$])/.exec(f)?.[0].length || 0)),\n          depth + 1,\n        );\n        foundElse = ie.all;\n        break;\n      }\n      details = {};\n    }\n    foundTrue = foundTrue || part.substring(0, found.end - part.start);\n    return {\n      all: part.substring(0, Math.max(foundTrue.end, foundElse.end) - part.start),\n      true: foundTrue,\n      false: foundElse,\n    };\n  }\n\n  setLispType(['if'] as const, (ctx) => {\n    const { constants, part, res } = ctx;\n    const labels = extractStatementLabels(res[1]);\n    let condition = restOfExp(constants, part.substring(res[0].length), [], '(');\n    const ie = extractIfElse(constants, part.substring(res[1].length));\n    const startTrue = res[0].length - res[1].length + condition.length + 1;\n\n    let trueBlock = ie.true.substring(startTrue);\n    let elseBlock = ie.false;\n\n    condition = condition.trim();\n    trueBlock = trueBlock.trim();\n    elseBlock = elseBlock.trim();\n\n    if (!trueBlock.length || /^else(?![\\w$])/.test(trueBlock.toString())) {\n      throw new SyntaxError('Unexpected token');\n    }\n    if (trueBlock.char(0) === '{') trueBlock = trueBlock.slice(1, -1);\n    if (elseBlock.char(0) === '{') elseBlock = elseBlock.slice(1, -1);\n    ctx.lispTree = wrapLabeledStatement(\n      labels,\n      createLisp<IfLisp>({\n        op: LispType.If,\n        a: lispifyExpr(constants, condition, undefined, ctx),\n        b: createLisp<IfCase>({\n          op: LispType.IfCase,\n          a: lispifyBlock(trueBlock, constants, false, ctx),\n          b: lispifyBlock(elseBlock, constants, false, ctx),\n        }),\n      }),\n    ) as Lisp;\n  });\n\n  setLispType(['switch'] as const, (ctx) => {\n    const { constants, part, res } = ctx;\n    const labels = extractStatementLabels(res[1]);\n    const test = restOfExp(constants, part.substring(res[0].length), [], '(');\n    let start = part.toString().indexOf('{', res[0].length + test.length + 1);\n    if (start === -1) throw new SyntaxError('Invalid switch');\n    let statement = insertSemicolons(\n      constants,\n      restOfExp(constants, part.substring(start + 1), [], '{'),\n    );\n    let caseFound: RegExpExecArray | null;\n    const caseTest = /^\\s*(case\\s|default)\\s*/;\n    const caseNoTestReg = /^\\s*case\\s*:/;\n    const cases: SwitchCase[] = [];\n    let defaultFound = false;\n    while (\n      (caseFound = caseTest.exec(statement.toString())) ||\n      caseNoTestReg.test(statement.toString())\n    ) {\n      if (!caseFound) {\n        throw new SyntaxError('Unexpected end of expression');\n      }\n      if (caseFound[1] === 'default') {\n        if (defaultFound) throw new SyntaxError('Only one default switch case allowed');\n        defaultFound = true;\n      }\n      const cond = restOfExp(constants, statement.substring(caseFound[0].length), [/^:/]);\n      if (caseFound[1] !== 'default' && !cond.trimStart().length) {\n        throw new SyntaxError('Unexpected end of expression');\n      }\n      let found = emptyString;\n      let i = (start = caseFound[0].length + cond.length + 1);\n      const bracketFound = /^\\s*\\{/.exec(statement.substring(i).toString());\n      let exprs: Lisp[] = [];\n      if (bracketFound) {\n        i += bracketFound[0].length;\n        found = restOfExp(constants, statement.substring(i), [], '{');\n        i += found.length + 1;\n        exprs = lispifyBlock(found, constants, false, ctx);\n      } else {\n        const notEmpty = restOfExp(constants, statement.substring(i), [caseTest]);\n        if (!notEmpty.trim().length) {\n          exprs = [];\n          i += notEmpty.length;\n        } else {\n          while ((found = restOfExp(constants, statement.substring(i), [semiColon])).length) {\n            i += found.length + (statement.char(i + found.length) === ';' ? 1 : 0);\n            if (caseTest.test(statement.substring(i).toString())) {\n              break;\n            }\n          }\n          exprs = lispifyBlock(\n            statement.substring(start, found.end - statement.start),\n            constants,\n            false,\n            ctx,\n          );\n        }\n      }\n      statement = statement.substring(i);\n      cases.push(\n        createLisp<SwitchCase>({\n          op: LispType.SwitchCase,\n          a:\n            caseFound[1] === 'default'\n              ? LispType.None\n              : lispifyExpr(constants, cond, undefined, ctx),\n          b: exprs,\n        }),\n      );\n    }\n    ctx.lispTree = wrapLabeledStatement(\n      labels,\n      createLisp<Switch>({\n        op: LispType.Switch,\n        a: lispifyExpr(constants, test, undefined, ctx),\n        b: cases,\n      }),\n    ) as Lisp;\n  });\n\n  void inlineIfElse;\n}\n","import { CodeString, LispType } from '../../utils';\nimport type {\n  Block,\n  InternalCode,\n  Lisp,\n  LispItem,\n  Loop,\n  LoopAction,\n  StatementLabel,\n  Try,\n} from '../lisp';\nimport type { RegisterLispTypesDeps } from './shared';\n\nexport function registerControlLispTypes({\n  ParseError,\n  createLisp,\n  emptyString,\n  expandDestructure,\n  extractStatementLabels,\n  insertSemicolons,\n  lispify,\n  lispifyBlock,\n  lispifyExpr,\n  lispifyReturnExpr,\n  restOfExp,\n  semiColon,\n  setLispType,\n  startingExecpted,\n  wrapLabeledStatement,\n}: RegisterLispTypesDeps) {\n  const iteratorRegex =\n    /^((let|var|const|internal)\\s+)?\\s*([a-zA-Z$_][a-zA-Z\\d$_]*)\\s+(in|of)(?![\\w$])/;\n  const iteratorDestructureRegex = /^((let|var|const|internal)\\s+)\\s*([[{])/;\n\n  const ofStart2 = lispify(\n    { maxDepth: 10 } as any,\n    new CodeString('let $$iterator = $$obj[Symbol.iterator]()'),\n    ['initialize'],\n  );\n  const ofStart3 = lispify(\n    { maxDepth: 10 } as any,\n    new CodeString('let $$next = $$iterator.next()'),\n    ['initialize'],\n  );\n  const ofCondition = lispify({ maxDepth: 10 } as any, new CodeString('return !$$next.done'), [\n    'initialize',\n  ]);\n  const ofStep = lispify({ maxDepth: 10 } as any, new CodeString('$$next = $$iterator.next()'));\n  const asyncOfStart2 = lispify({ maxDepth: 10 } as any, new CodeString('let $$iterator = $$obj'), [\n    'initialize',\n  ]);\n  const asyncOfStart3 = lispify(\n    { maxDepth: 10 } as any,\n    new CodeString('let $$next = $$iterator.next()'),\n    ['initialize'],\n  );\n  const asyncOfStep = lispify(\n    { maxDepth: 10 } as any,\n    new CodeString('$$next = $$iterator.next()'),\n  );\n  const inStart2 = lispify(\n    { maxDepth: 10 } as any,\n    new CodeString('let $$keys = Object.keys($$obj)'),\n    ['initialize'],\n  );\n  const inStart3 = lispify({ maxDepth: 10 } as any, new CodeString('let $$keyIndex = 0'), [\n    'initialize',\n  ]);\n  const inStep = lispify({ maxDepth: 10 } as any, new CodeString('$$keyIndex++'));\n  const inCondition = lispify(\n    { maxDepth: 10 } as any,\n    new CodeString('return $$keyIndex < $$keys.length'),\n    ['initialize'],\n  );\n\n  setLispType(['for', 'do', 'while'] as const, (ctx) => {\n    const { constants, type, part, res } = ctx;\n    const labels = extractStatementLabels(res[1]);\n    let i = 0;\n    let startStep: LispItem = LispType.True;\n    let startInternal: Lisp[] = [];\n    let getIterator: Lisp | LispType.None = LispType.None;\n    let beforeStep: LispItem = LispType.None;\n    let checkFirst = LispType.True;\n    let condition: LispItem;\n    let step: LispItem = LispType.True;\n    let body: CodeString;\n    const isForAwait: LispItem = type === 'for' && res[2] ? LispType.True : LispType.None;\n    switch (type) {\n      case 'while': {\n        i = part.toString().indexOf('(') + 1;\n        const extract = restOfExp(constants, part.substring(i), [], '(');\n        if (!extract.trimStart().length) {\n          throw new SyntaxError('Unexpected end of expression');\n        }\n        condition = lispifyReturnExpr(constants, extract);\n        body = restOfExp(constants, part.substring(i + extract.length + 1)).trim();\n        if (body.char(0) === '{') body = body.slice(1, -1);\n        break;\n      }\n      case 'for': {\n        i = part.toString().indexOf('(') + 1;\n        const args: CodeString[] = [];\n        let extract2 = emptyString;\n        for (let k = 0; k < 3; k++) {\n          extract2 = restOfExp(constants, part.substring(i), [/^[;)]/]);\n          args.push(extract2.trim());\n          i += extract2.length + 1;\n          if (part.char(i - 1) === ')') break;\n        }\n        let iterator: RegExpExecArray | null;\n        let iteratorDestructure: RegExpExecArray | null;\n        if (args.length === 1 && (iterator = iteratorRegex.exec(args[0].toString()))) {\n          const iterableExpr = args[0].substring(iterator[0].length);\n          if (!iterableExpr.trimStart().length) {\n            throw new SyntaxError('Unexpected end of expression');\n          }\n          if (iterator[4] === 'of') {\n            getIterator = lispifyReturnExpr(constants, iterableExpr);\n            startInternal = isForAwait ? [asyncOfStart2, asyncOfStart3] : [ofStart2, ofStart3];\n            condition = ofCondition;\n            step = isForAwait ? asyncOfStep : ofStep;\n            beforeStep = lispify(\n              constants,\n              new CodeString((iterator[1] || 'let ') + iterator[3] + ' = $$next.value'),\n              ['initialize'],\n            );\n          } else {\n            if (isForAwait) {\n              throw new SyntaxError(\"Unexpected token 'in'\");\n            }\n            getIterator = lispifyReturnExpr(constants, iterableExpr);\n            startInternal = [inStart2, inStart3];\n            step = inStep;\n            condition = inCondition;\n            beforeStep = lispify(\n              constants,\n              new CodeString((iterator[1] || 'let ') + iterator[3] + ' = $$keys[$$keyIndex]'),\n              ['initialize'],\n            );\n          }\n        } else if (\n          args.length === 1 &&\n          (iteratorDestructure = iteratorDestructureRegex.exec(args[0].toString()))\n        ) {\n          const keyword = iteratorDestructure[1].trim();\n          const openBracket = iteratorDestructure[3];\n          const closeBracket = openBracket === '[' ? ']' : '}';\n          const keywordPrefixLen = iteratorDestructure[0].length - 1;\n          const patternContent = restOfExp(\n            constants,\n            args[0].substring(keywordPrefixLen + 1),\n            [],\n            openBracket,\n          );\n          const patternStr = openBracket + patternContent.toString() + closeBracket;\n          const afterClose = args[0]\n            .substring(keywordPrefixLen + 1 + patternContent.length + 1)\n            .trimStart();\n          const inOfMatch = /^(in|of)(?![\\w$])\\s*/.exec(afterClose.toString());\n          if (!inOfMatch) throw new SyntaxError('Invalid for loop definition');\n          const inOf = inOfMatch[1];\n          const iterExpr = afterClose.substring(inOfMatch[0].length);\n          if (!iterExpr.trimStart().length) {\n            throw new SyntaxError('Unexpected end of expression');\n          }\n          const tempVarName = '$$_fv';\n          if (inOf === 'of') {\n            getIterator = lispifyReturnExpr(constants, iterExpr);\n            startInternal = isForAwait ? [asyncOfStart2, asyncOfStart3] : [ofStart2, ofStart3];\n            condition = ofCondition;\n            step = isForAwait ? asyncOfStep : ofStep;\n            const expandedCode = expandDestructure(keyword, patternStr, tempVarName);\n            const stmts = lispifyBlock(new CodeString(expandedCode), constants, false, ctx);\n            beforeStep = createLisp<InternalCode>({\n              op: LispType.InternalBlock,\n              a: [\n                lispify(constants, new CodeString(`${keyword} ${tempVarName} = $$next.value`), [\n                  'initialize',\n                ]),\n                ...stmts,\n              ],\n              b: LispType.None,\n            });\n          } else {\n            getIterator = lispifyReturnExpr(constants, iterExpr);\n            startInternal = [inStart2, inStart3];\n            step = inStep;\n            condition = inCondition;\n            const expandedCode = expandDestructure(keyword, patternStr, tempVarName);\n            const stmts = lispifyBlock(new CodeString(expandedCode), constants, false, ctx);\n            beforeStep = createLisp<InternalCode>({\n              op: LispType.InternalBlock,\n              a: [\n                lispify(\n                  constants,\n                  new CodeString(`${keyword} ${tempVarName} = $$keys[$$keyIndex]`),\n                  ['initialize'],\n                ),\n                ...stmts,\n              ],\n              b: LispType.None,\n            });\n          }\n        } else if (args.length === 3) {\n          const [startArg, conditionArg, stepArg] = args;\n          if (startArg.length) {\n            startStep = lispifyExpr(constants, startArg, startingExecpted, ctx);\n          }\n          condition = conditionArg.length\n            ? lispifyReturnExpr(constants, conditionArg)\n            : LispType.True;\n          if (stepArg.length) {\n            step = lispifyExpr(constants, stepArg, undefined, ctx);\n          }\n        } else {\n          throw new SyntaxError('Invalid for loop definition');\n        }\n        body = restOfExp(constants, part.substring(i)).trim();\n        if (body.char(0) === '{') body = body.slice(1, -1);\n        break;\n      }\n      case 'do': {\n        checkFirst = LispType.None;\n        const isBlock = !!res[2];\n        body = restOfExp(constants, part.substring(res[0].length), isBlock ? [/^\\}/] : [semiColon]);\n        condition = lispifyReturnExpr(\n          constants,\n          restOfExp(\n            constants,\n            part.substring(part.toString().indexOf('(', res[0].length + body.length) + 1),\n            [],\n            '(',\n          ),\n        );\n        break;\n      }\n    }\n    const a = [\n      checkFirst,\n      startInternal,\n      getIterator,\n      startStep,\n      step,\n      condition,\n      beforeStep,\n      isForAwait,\n      labels,\n    ] as LispItem;\n    ctx.lispTree = createLisp<Loop>({\n      op: LispType.Loop,\n      a,\n      b: lispifyBlock(body, constants, false, ctx),\n    });\n  });\n\n  setLispType(['block'] as const, (ctx) => {\n    const { constants, part, res } = ctx;\n    const labels = extractStatementLabels(res[1]);\n    ctx.lispTree = wrapLabeledStatement(\n      labels,\n      createLisp<Block>({\n        op: LispType.Block,\n        a: lispifyBlock(\n          restOfExp(constants, part.substring(res[0].length), [], '{'),\n          constants,\n          false,\n          ctx,\n        ),\n        b: LispType.None,\n      }),\n    ) as Lisp;\n  });\n\n  setLispType(['loopAction'] as const, (ctx) => {\n    const { part, res } = ctx;\n    const remaining = part.substring(res[0].length).trimStart();\n    if (remaining.length && !res[2]) {\n      throw new SyntaxError(`Unexpected token '${remaining.char(0)}'`);\n    }\n    ctx.lispTree = createLisp<LoopAction>({\n      op: LispType.LoopAction,\n      a: res[1],\n      b: (res[2] || LispType.None) as StatementLabel,\n    });\n  });\n\n  const catchReg = /^\\s*(catch\\s*(\\(\\s*([a-zA-Z$_][a-zA-Z\\d$_]*)\\s*\\))?|finally)\\s*\\{/;\n  const catchEmptyBindingReg = /^\\s*catch\\s*\\(\\s*\\)/;\n  const catchReservedBindingReg =\n    /^\\s*catch\\s*\\(\\s*(break|case|catch|continue|debugger|default|delete|do|else|finally|for|function|if|in|instanceof|new|return|switch|this|throw|try|typeof|var|void|while|with|class|const|enum|export|extends|implements|import|interface|let|package|private|protected|public|static|super|yield|await)\\s*\\)/;\n  const finallyKeywordReg = /^\\s*finally\\b/;\n\n  setLispType(['try'] as const, (ctx) => {\n    const { constants, part, res } = ctx;\n    const body = restOfExp(constants, part.substring(res[0].length), [], '{');\n    const afterBody = part.substring(res[0].length + body.length + 1).toString();\n\n    if (catchEmptyBindingReg.test(afterBody)) {\n      throw new ParseError(\"Unexpected token ')'\", part.toString());\n    }\n\n    const reservedMatch = catchReservedBindingReg.exec(afterBody);\n    if (reservedMatch) {\n      throw new ParseError(`Unexpected token '${reservedMatch[1]}'`, part.toString());\n    }\n\n    const finallyMatch = finallyKeywordReg.exec(afterBody);\n    if (finallyMatch && !/^\\s*\\{/.test(afterBody.substring(finallyMatch[0].length))) {\n      throw new ParseError('Unexpected token', part.toString());\n    }\n\n    let catchRes = catchReg.exec(afterBody);\n    let finallyBody;\n    let exception = '';\n    let catchBody;\n    let offset = 0;\n\n    if (!catchRes) {\n      throw new ParseError('Missing catch or finally after try', part.toString());\n    }\n\n    if (catchRes[1].startsWith('catch')) {\n      catchRes = catchReg.exec(part.substring(res[0].length + body.length + 1).toString());\n      exception = catchRes![3] || '';\n      catchBody = restOfExp(\n        constants,\n        part.substring(res[0].length + body.length + 1 + catchRes![0].length),\n        [],\n        '{',\n      );\n      offset = res[0].length + body.length + 1 + catchRes![0].length + catchBody.length + 1;\n      if (\n        (catchRes = catchReg.exec(part.substring(offset).toString())) &&\n        catchRes[1].startsWith('finally')\n      ) {\n        finallyBody = restOfExp(constants, part.substring(offset + catchRes[0].length), [], '{');\n      }\n    } else {\n      finallyBody = restOfExp(\n        constants,\n        part.substring(res[0].length + body.length + 1 + catchRes![0].length),\n        [],\n        '{',\n      );\n    }\n    const b = [\n      exception,\n      lispifyBlock(insertSemicolons(constants, catchBody || emptyString), constants, false, ctx),\n      lispifyBlock(insertSemicolons(constants, finallyBody || emptyString), constants, false, ctx),\n    ] as LispItem;\n    ctx.lispTree = wrapLabeledStatement(\n      extractStatementLabels(res[1]),\n      createLisp<Try>({\n        op: LispType.Try,\n        a: lispifyBlock(insertSemicolons(constants, body), constants, false, ctx),\n        b,\n      }),\n    ) as Lisp;\n  });\n}\n","import { CodeString, LispType, reservedWords } from '../../utils';\nimport type {\n  ArrowFunction,\n  Const,\n  Function as FunctionLisp,\n  InlineFunction,\n  Internal,\n  InternalCode,\n  Let,\n  Var,\n} from '../lisp';\nimport type { RegisterLispTypesDeps } from './shared';\n\nexport function registerDeclarationLispTypes({\n  createLisp,\n  expectTypes,\n  expandDestructure,\n  expandFunctionParamDestructure,\n  lispify,\n  lispifyBlock,\n  lispifyFunction,\n  restOfExp,\n  semiColon,\n  setLispType,\n  splitByCommasDestructure,\n}: RegisterLispTypesDeps) {\n  setLispType(['initializeDestructure'] as const, (ctx) => {\n    const { constants, part, res } = ctx;\n    const keyword = res[1] as string;\n    const openBracket = res[2] as string;\n    const closeBracket = openBracket === '[' ? ']' : '}';\n\n    const patternContent = restOfExp(constants, part.substring(res[0].length), [], openBracket);\n    const patternStr = openBracket + patternContent.toString() + closeBracket;\n\n    const afterClose = part.substring(res[0].length + patternContent.length + 1).trimStart();\n    if (!afterClose.length || afterClose.char(0) !== '=') {\n      throw new SyntaxError('Destructuring declaration requires an initializer');\n    }\n\n    const rhsCode = restOfExp(constants, afterClose.substring(1).trimStart(), [semiColon]);\n    const rhsStr = rhsCode.toString();\n    const expandedCode = expandDestructure(keyword, patternStr, rhsStr);\n    const stmts = lispifyBlock(new CodeString(expandedCode), constants, false, ctx);\n\n    ctx.lispTree = createLisp<InternalCode>({\n      op: LispType.InternalBlock,\n      a: stmts,\n      b: LispType.None,\n    });\n  });\n\n  setLispType(['initialize'] as const, (ctx) => {\n    const { constants, part, res, expect } = ctx;\n    const lt =\n      res[1] === 'var'\n        ? LispType.Var\n        : res[1] === 'let'\n          ? LispType.Let\n          : res[1] === 'const'\n            ? LispType.Const\n            : LispType.Internal;\n    if (!res[3]) {\n      ctx.lispTree = lispify(\n        constants,\n        part.substring(res[0].length),\n        expectTypes[expect].next,\n        createLisp<Var | Let | Const | Internal>({\n          op: lt,\n          a: res[2],\n          b: LispType.None,\n        }),\n        false,\n        ctx,\n      );\n    } else {\n      const initExpr = part.substring(res[0].length);\n      if (!initExpr.trimStart().length) {\n        throw new SyntaxError('Unexpected end of expression');\n      }\n      ctx.lispTree = createLisp<Var | Let | Const | Internal>({\n        op: lt,\n        a: res[2],\n        b: lispify(constants, initExpr, expectTypes[expect].next, undefined, false, ctx),\n      });\n    }\n  });\n\n  setLispType(\n    ['function', 'inlineFunction', 'arrowFunction', 'arrowFunctionSingle'] as const,\n    (ctx) => {\n      const { constants, type, part, res, expect, generatorDepth, asyncDepth } = ctx;\n      const isArrow = type !== 'function' && type !== 'inlineFunction';\n      const isReturn = isArrow && !res[res.length - 1];\n      const isGenerator =\n        !isArrow && res[2] && res[2].trimStart().startsWith('*') ? LispType.True : LispType.None;\n      const isAsync = res[1] ? LispType.True : LispType.None;\n      let rawArgStr: string;\n      let bodyOffset: number;\n      if (type === 'function' || type === 'inlineFunction') {\n        const argsCode = restOfExp(constants, part.substring(res[0].length), [], '(');\n        rawArgStr = argsCode.toString().trim();\n        bodyOffset = res[0].length + argsCode.length + 1;\n        const afterParen = part.substring(bodyOffset).trimStart();\n        bodyOffset = part.length - afterParen.length + 1;\n      } else {\n        rawArgStr = res[2] ?? '';\n        bodyOffset = 0;\n      }\n      const rawArgs: string[] = rawArgStr\n        ? splitByCommasDestructure(rawArgStr)\n            .map((a) => a.trim())\n            .filter(Boolean)\n        : [];\n      const args: string[] = [...rawArgs];\n      if (!isArrow) {\n        args.unshift((res[3] || '').trimStart());\n      }\n      let ended = false;\n      args.forEach((arg: string) => {\n        if (ended) throw new SyntaxError('Rest parameter must be last formal parameter');\n        if (arg.startsWith('...')) ended = true;\n      });\n      const f = restOfExp(\n        constants,\n        isArrow ? part.substring(res[0].length) : part.substring(bodyOffset),\n        !isReturn ? [/^}/] : [/^[,)}\\]]/, semiColon],\n      );\n      let funcBody = isReturn ? 'return ' + f : f.toString();\n      const funcArgs = isArrow ? args : args.slice(1);\n      const expanded = expandFunctionParamDestructure(funcArgs, funcBody);\n      const finalArgs = isArrow ? expanded.args : [args[0], ...expanded.args];\n      funcBody = expanded.body;\n      finalArgs.forEach((arg: string) => {\n        if (reservedWords.has(arg.replace(/^\\.\\.\\./, ''))) {\n          throw new SyntaxError(`Unexpected token '${arg}'`);\n        }\n      });\n      const afterFunc = isArrow ? res[0].length + f.length + 1 : bodyOffset + f.length + 1;\n      ctx.lispTree = lispify(\n        constants,\n        part.substring(afterFunc),\n        expectTypes[expect].next,\n        createLisp<FunctionLisp | InlineFunction | ArrowFunction>({\n          op: isArrow\n            ? LispType.ArrowFunction\n            : type === 'function'\n              ? LispType.Function\n              : LispType.InlineFunction,\n          a: isArrow ? [isAsync, ...finalArgs] : [isAsync, isGenerator, ...finalArgs],\n          b: constants.eager\n            ? lispifyFunction(\n                new CodeString(funcBody),\n                constants,\n                false,\n                isArrow\n                  ? { generatorDepth: 0, asyncDepth: 0, lispDepth: 0 }\n                  : {\n                      generatorDepth: isGenerator === LispType.True ? generatorDepth + 1 : 0,\n                      asyncDepth: isAsync === LispType.True ? asyncDepth + 1 : 0,\n                      lispDepth: 0,\n                    },\n              )\n            : funcBody,\n        }),\n        false,\n        ctx,\n      );\n    },\n  );\n}\n","import { CodeString, isLisp, LispType } from '../../utils';\nimport type {\n  AddEquals,\n  And,\n  AndEquals,\n  Assigns,\n  BigInt as BigIntLisp,\n  BitAnd,\n  BitAndEquals,\n  BitNegate,\n  BitNegateEquals,\n  BitOr,\n  BitOrEquals,\n  BitShiftLeft,\n  BitShiftRight,\n  BitUnsignedShiftRight,\n  Call,\n  CreateArray,\n  DecrementAfter,\n  DecrementBefore,\n  Delete,\n  Divide,\n  DivideEquals,\n  Equal,\n  GlobalSymbol,\n  In,\n  IncrementAfter,\n  IncrementBefore,\n  InlineIf,\n  InlineIfCase,\n  Instanceof,\n  InternalCode,\n  Inverse,\n  LargerEqualThan,\n  LargerThan,\n  Lisp,\n  Minus,\n  Modulus,\n  ModulusEquals,\n  Multiply,\n  MultiplyEquals,\n  Negative,\n  Not,\n  NotEqual,\n  NullishCoalescing,\n  NullishCoalescingEquals,\n  Number as NumberLisp,\n  Or,\n  OrEquals,\n  Plus,\n  Positive,\n  Power,\n  PowerEquals,\n  ShiftLeftEquals,\n  ShiftRightEquals,\n  SmallerEqualThan,\n  SmallerThan,\n  StrictEqual,\n  StrictNotEqual,\n  StringIndex,\n  SubractEquals,\n  Typeof,\n  UnsignedShiftRightEquals,\n} from '../lisp';\nimport type { RegisterLispTypesDeps } from './shared';\n\nexport function registerOperatorLispTypes({\n  createLisp,\n  expandDestructure,\n  expectTypes,\n  getDestructurePatternSource,\n  lispifyBlock,\n  restOfExp,\n  lispify,\n  lispifyExpr,\n  setLispType,\n}: RegisterLispTypesDeps) {\n  const inlineIfElse = /^:/;\n\n  const modifierTypes = {\n    inverse: LispType.Inverse,\n    not: LispType.Not,\n    positive: LispType.Positive,\n    negative: LispType.Negative,\n    typeof: LispType.Typeof,\n    delete: LispType.Delete,\n  } as const;\n\n  setLispType(['inverse', 'not', 'negative', 'positive', 'typeof', 'delete'] as const, (ctx) => {\n    const { constants, type, part, res, expect } = ctx;\n    const extract = restOfExp(constants, part.substring(res[0].length), [/^([^\\s.?\\w$]|\\?[^.])/]);\n    const remainingAfterOperand = part.substring(extract.length + res[0].length);\n    const remainingStr = remainingAfterOperand.trim().toString();\n    if (remainingStr.startsWith('**')) {\n      throw new SyntaxError(\n        'Unary operator used immediately before exponentiation expression. Parenthesis must be used to disambiguate operator precedence',\n      );\n    }\n\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(extract.length + res[0].length),\n      restOfExp.next,\n      createLisp<Inverse | Not | Negative | Positive | Typeof | Delete>({\n        op: modifierTypes[type],\n        a: ctx.lispTree,\n        b: lispify(constants, extract, expectTypes[expect].next),\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  setLispType(['taggedTemplate'] as const, (ctx) => {\n    const { constants, part, res, expect } = ctx;\n    const literalIndex = res[1];\n    const literal = constants.literals[parseInt(literalIndex)];\n    const [, templateStr, jsExprs] = literal;\n    const stringParts: string[] = [];\n    const expressions: Lisp[] = [];\n    let currentStr = '';\n    let i = 0;\n\n    while (i < templateStr.length) {\n      if (templateStr.substring(i, i + 2) === '${') {\n        let j = i + 2;\n        let exprIndex = '';\n        let isValidPlaceholder = false;\n        while (j < templateStr.length && templateStr[j] !== '}') {\n          exprIndex += templateStr[j];\n          j++;\n        }\n        if (j < templateStr.length && templateStr[j] === '}' && /^\\d+$/.test(exprIndex)) {\n          isValidPlaceholder = true;\n        }\n\n        if (isValidPlaceholder) {\n          stringParts.push(currentStr);\n          currentStr = '';\n          expressions.push(jsExprs[parseInt(exprIndex)]);\n          i = j + 1;\n        } else {\n          currentStr += templateStr[i];\n          i++;\n        }\n      } else {\n        currentStr += templateStr[i];\n        i++;\n      }\n    }\n    stringParts.push(currentStr);\n\n    const stringsArray = stringParts.map((str) =>\n      createLisp<StringIndex>({\n        op: LispType.StringIndex,\n        a: LispType.None,\n        b: String(constants.strings.push(str) - 1),\n      }),\n    );\n\n    const stringsArrayLisp = createLisp<CreateArray>({\n      op: LispType.CreateArray,\n      a: createLisp({\n        op: LispType.None,\n        a: LispType.None,\n        b: LispType.None,\n      }),\n      b: stringsArray,\n    });\n\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(res[0].length),\n      expectTypes[expect].next,\n      createLisp<Call>({\n        op: LispType.Call,\n        a: ctx.lispTree,\n        b: [stringsArrayLisp, ...expressions],\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  const incrementTypes = {\n    '++$': LispType.IncrementBefore,\n    '--$': LispType.DecrementBefore,\n    '$++': LispType.IncrementAfter,\n    '$--': LispType.DecrementAfter,\n  } as any;\n\n  setLispType(['incrementerBefore'] as const, (ctx) => {\n    const { constants, part, res } = ctx;\n    const extract = restOfExp(constants, part.substring(2), [/^[^\\s.\\w$]/]);\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(extract.length + 2),\n      restOfExp.next,\n      createLisp<IncrementBefore | DecrementBefore>({\n        op: incrementTypes[res[0] + '$'],\n        a: lispify(constants, extract, expectTypes.incrementerBefore.next),\n        b: LispType.None,\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  setLispType(['incrementerAfter'] as const, (ctx) => {\n    const { constants, part, res, expect } = ctx;\n    if (\n      ctx.lispTree[0] === LispType.Number ||\n      ctx.lispTree[0] === LispType.BigInt ||\n      ctx.lispTree[0] === LispType.GlobalSymbol ||\n      ctx.lispTree[0] === LispType.StringIndex ||\n      ctx.lispTree[0] === LispType.LiteralIndex ||\n      ctx.lispTree[0] === LispType.RegexIndex\n    ) {\n      throw new SyntaxError('Invalid left-hand side expression in postfix operation');\n    }\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(res[0].length),\n      expectTypes[expect].next,\n      createLisp<IncrementAfter | DecrementAfter>({\n        op: incrementTypes['$' + res[0]],\n        a: ctx.lispTree,\n        b: LispType.None,\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  const adderTypes = {\n    '&&': LispType.And,\n    '||': LispType.Or,\n    '??': LispType.NullishCoalescing,\n    instanceof: LispType.Instanceof,\n    in: LispType.In,\n    '=': LispType.Assign,\n    '-=': LispType.SubractEquals,\n    '+=': LispType.AddEquals,\n    '/=': LispType.DivideEquals,\n    '**=': LispType.PowerEquals,\n    '*=': LispType.MultiplyEquals,\n    '%=': LispType.ModulusEquals,\n    '^=': LispType.BitNegateEquals,\n    '&=': LispType.BitAndEquals,\n    '|=': LispType.BitOrEquals,\n    '>>>=': LispType.UnsignedShiftRightEquals,\n    '<<=': LispType.ShiftLeftEquals,\n    '>>=': LispType.ShiftRightEquals,\n    '&&=': LispType.AndEquals,\n    '||=': LispType.OrEquals,\n    '??=': LispType.NullishCoalescingEquals,\n  } as any;\n\n  setLispType(['assign', 'assignModify', 'nullishCoalescing'] as const, (ctx) => {\n    const { constants, type, part, res } = ctx;\n    if (\n      type !== 'nullishCoalescing' &&\n      isLisp(ctx.lispTree) &&\n      (ctx.lispTree[0] === LispType.PropOptional || ctx.lispTree[0] === LispType.CallOptional)\n    ) {\n      throw new SyntaxError('Invalid left-hand side in assignment');\n    }\n    if (res[0] === '=') {\n      const patternStr = getDestructurePatternSource(ctx.lispTree);\n      if (patternStr) {\n        const rhsStr = part.substring(res[0].length).toString();\n        const tempName = `$$_da${Math.random().toString(36).slice(2)}`;\n        const expandedCode = `internal ${tempName} = (${rhsStr}); ${expandDestructure('', patternStr, tempName)}; ${tempName}`;\n        ctx.lispTree = createLisp<InternalCode>({\n          op: LispType.InternalBlock,\n          a: lispifyBlock(new CodeString(expandedCode), constants, false, ctx),\n          b: LispType.None,\n        });\n        return;\n      }\n    }\n    ctx.lispTree = createLisp<\n      | NullishCoalescing\n      | Assigns\n      | SubractEquals\n      | AddEquals\n      | DivideEquals\n      | PowerEquals\n      | MultiplyEquals\n      | ModulusEquals\n      | BitNegateEquals\n      | BitAndEquals\n      | BitOrEquals\n      | UnsignedShiftRightEquals\n      | ShiftLeftEquals\n      | ShiftRightEquals\n      | AndEquals\n      | OrEquals\n      | NullishCoalescingEquals\n    >({\n      op: adderTypes[res[0]],\n      a: ctx.lispTree,\n      b: lispify(\n        constants,\n        part.substring(res[0].length),\n        expectTypes.assignment.next,\n        undefined,\n        false,\n        { ...ctx, lispDepth: ctx.lispDepth + 1 },\n      ),\n    });\n  });\n\n  const opTypes = {\n    '&': LispType.BitAnd,\n    '|': LispType.BitOr,\n    '^': LispType.BitNegate,\n    '<<': LispType.BitShiftLeft,\n    '>>': LispType.BitShiftRight,\n    '>>>': LispType.BitUnsignedShiftRight,\n    '<=': LispType.SmallerEqualThan,\n    '>=': LispType.LargerEqualThan,\n    '<': LispType.SmallerThan,\n    '>': LispType.LargerThan,\n    '!==': LispType.StrictNotEqual,\n    '!=': LispType.NotEqual,\n    '===': LispType.StrictEqual,\n    '==': LispType.Equal,\n    '+': LispType.Plus,\n    '-': LispType.Minus,\n    '/': LispType.Divide,\n    '**': LispType.Power,\n    '*': LispType.Multiply,\n    '%': LispType.Modulus,\n    '&&': LispType.And,\n    '||': LispType.Or,\n    instanceof: LispType.Instanceof,\n    in: LispType.In,\n  } as any;\n\n  setLispType(\n    [\n      'power',\n      'opHigh',\n      'op',\n      'comparitor',\n      'bitwiseShift',\n      'bitwiseAnd',\n      'bitwiseXor',\n      'bitwiseOr',\n      'boolOpAnd',\n      'boolOpOr',\n    ] as const,\n    (ctx) => {\n      const { constants, type, part, res } = ctx;\n      const next = [expectTypes.inlineIf.types.inlineIf, inlineIfElse];\n      switch (type) {\n        case 'power':\n          break;\n        case 'opHigh':\n          next.push(expectTypes.splitter.types.opHigh);\n        case 'op':\n          next.push(expectTypes.splitter.types.op);\n        case 'comparitor':\n          next.push(expectTypes.splitter.types.comparitor);\n        case 'bitwiseShift':\n          next.push(expectTypes.splitter.types.bitwiseShift);\n        case 'bitwiseAnd':\n          next.push(expectTypes.splitter.types.bitwiseAnd);\n        case 'bitwiseXor':\n          next.push(expectTypes.splitter.types.bitwiseXor);\n        case 'bitwiseOr':\n          next.push(expectTypes.splitter.types.bitwiseOr);\n        case 'boolOpAnd':\n          next.push(expectTypes.splitter.types.boolOpAnd);\n        case 'boolOpOr':\n          next.push(expectTypes.splitter.types.boolOpOr);\n      }\n      const extract = restOfExp(constants, part.substring(res[0].length), next);\n      ctx.lispTree = lispify(\n        constants,\n        part.substring(extract.length + res[0].length),\n        restOfExp.next,\n        createLisp<\n          | BitAnd\n          | BitOr\n          | BitNegate\n          | BitShiftLeft\n          | BitShiftRight\n          | BitUnsignedShiftRight\n          | SmallerEqualThan\n          | LargerEqualThan\n          | SmallerThan\n          | LargerThan\n          | StrictNotEqual\n          | NotEqual\n          | StrictEqual\n          | Equal\n          | Plus\n          | Minus\n          | Divide\n          | Power\n          | Multiply\n          | Modulus\n          | And\n          | Or\n          | Instanceof\n          | In\n        >({\n          op: opTypes[res[0]],\n          a: ctx.lispTree,\n          b: lispify(constants, extract, expectTypes.splitter.next),\n        }),\n        false,\n        ctx,\n      );\n    },\n  );\n\n  setLispType(['inlineIf'] as const, (ctx) => {\n    const { constants, part, res } = ctx;\n    let found = false;\n    const extract = part.substring(0, 0);\n    let quoteCount = 1;\n    while (!found && extract.length < part.length) {\n      extract.end = restOfExp(constants, part.substring(extract.length + 1), [\n        expectTypes.inlineIf.types.inlineIf,\n        inlineIfElse,\n      ]).end;\n      if (part.char(extract.length) === '?') {\n        quoteCount++;\n      } else {\n        quoteCount--;\n      }\n      if (!quoteCount) {\n        found = true;\n      }\n    }\n    extract.start = part.start + 1;\n    const falseExpr = part.substring(res[0].length + extract.length + 1);\n    if (!falseExpr.trimStart().length) {\n      throw new SyntaxError('Unexpected end of expression');\n    }\n    ctx.lispTree = createLisp<InlineIf>({\n      op: LispType.InlineIf,\n      a: ctx.lispTree,\n      b: createLisp<InlineIfCase>({\n        op: LispType.InlineIfCase,\n        a: lispifyExpr(constants, extract, undefined, { ...ctx, lispDepth: ctx.lispDepth + 1 }),\n        b: lispifyExpr(constants, falseExpr, undefined, { ...ctx, lispDepth: ctx.lispDepth + 1 }),\n      }),\n    });\n  });\n}\n","import { CodeString, isLisp, LispType, reservedWords } from '../../utils';\nimport type {\n  ArrayProp,\n  Call,\n  CallOptional,\n  CreateArray,\n  CreateObject,\n  Group,\n  InternalCode,\n  KeyValLisp,\n  Lisp,\n  PropLisp,\n  PropOptional,\n  SpreadArrayLisp,\n  SpreadObjectLisp,\n} from '../lisp';\nimport type { RegisterLispTypesDeps } from './shared';\n\nexport function registerStructureLispTypes({\n  NullLisp,\n  createLisp,\n  emptyString,\n  expectTypes,\n  expandDestructure,\n  findPatternEndIdx,\n  lispify,\n  lispifyBlock,\n  lispifyExpr,\n  restOfExp,\n  setLispType,\n}: RegisterLispTypesDeps) {\n  type LispWithSource = Lisp & { source?: string };\n\n  const closingsCreate: { [type: string]: RegExp } = {\n    createArray: /^\\]/,\n    createObject: /^\\}/,\n    group: /^\\)/,\n    arrayProp: /^\\]/,\n    call: /^\\)/,\n  };\n\n  const typesCreate = {\n    createArray: LispType.CreateArray,\n    createObject: LispType.CreateObject,\n    group: LispType.Group,\n    arrayProp: LispType.ArrayProp,\n    call: LispType.Call,\n    prop: LispType.Prop,\n    '?prop': LispType.PropOptional,\n    '?call': LispType.CallOptional,\n  } as any;\n\n  setLispType(['createArray', 'createObject', 'group', 'arrayProp', 'call'] as const, (ctx) => {\n    const { constants, type, part, res, expect } = ctx;\n    let extract = emptyString;\n    const arg: CodeString[] = [];\n    const argIsHole: boolean[] = [];\n    let end = false;\n    let i = res[0].length;\n    const start = i;\n    while (i < part.length && !end) {\n      extract = restOfExp(constants, part.substring(i), [closingsCreate[type], /^,/]);\n      i += extract.length;\n      if (extract.trim().length) {\n        arg.push(extract);\n        argIsHole.push(false);\n      } else if (type === 'createArray' && part.char(i) === ',') {\n        arg.push(extract);\n        argIsHole.push(true);\n      }\n      if (part.char(i) !== ',') {\n        end = true;\n      } else {\n        if (!extract.trim().length && type === 'call') {\n          throw new SyntaxError('Unexpected end of expression');\n        }\n        if (!extract.trim().length && type === 'createObject') {\n          throw new SyntaxError('Unexpected token ,');\n        }\n        i++;\n      }\n    }\n    const next =\n      type === 'createArray' || type === 'createObject' || type === 'group'\n        ? ['value', 'modifier', 'prop', 'incrementerBefore', 'assignment', 'expEnd']\n        : ['value', 'modifier', 'prop', 'incrementerBefore', 'expEnd'];\n    let l: Lisp | Lisp[];\n\n    let funcFound: RegExpExecArray | null;\n    switch (type) {\n      case 'group': {\n        const groupContent = part.substring(start, i).trim();\n        const groupContentStr = groupContent.toString();\n        if (groupContentStr.startsWith('{') || groupContentStr.startsWith('[')) {\n          const patternEnd = findPatternEndIdx(groupContentStr);\n          const patternStr = groupContentStr.slice(0, patternEnd).trim();\n          const afterPattern = groupContentStr.slice(patternEnd).trimStart();\n          if (afterPattern.startsWith('=')) {\n            const rhsStr = afterPattern.slice(1).trim();\n            const tempName = `$$_da${Math.random().toString(36).slice(2)}`;\n            const expandedCode = `internal ${tempName} = (${rhsStr}); ${expandDestructure('', patternStr, tempName)}; ${tempName}`;\n            l = createLisp<InternalCode>({\n              op: LispType.InternalBlock,\n              a: lispifyBlock(new CodeString(expandedCode), constants, false, ctx),\n              b: LispType.None,\n            });\n            break;\n          }\n        }\n      }\n      case 'arrayProp': {\n        const arrayPropExpr = part.substring(start, i);\n        if (!arrayPropExpr.trimStart().length) {\n          throw new SyntaxError('Unexpected end of expression');\n        }\n        l = lispifyExpr(constants, arrayPropExpr, undefined, {\n          ...ctx,\n          lispDepth: ctx.lispDepth + 1,\n        });\n        break;\n      }\n      case 'call':\n        l = arg.map((e) => lispify(constants, e, [...next, 'spreadArray'], undefined, false, ctx));\n        break;\n      case 'createArray':\n        l = arg.map((e, idx) =>\n          argIsHole[idx]\n            ? createLisp({ op: LispType.Hole, a: LispType.None, b: LispType.None })\n            : lispify(constants, e, [...next, 'spreadArray'], undefined, false, ctx),\n        );\n        break;\n      case 'createObject':\n        l = arg.map((str) => {\n          str = str.trimStart();\n          let value: Lisp;\n          let key: string | Lisp = '';\n          if (str.char(0) === '[') {\n            const innerExpr = restOfExp(constants, str.substring(1), [], '[');\n            const afterBracket = str.substring(1 + innerExpr.length + 1).trimStart();\n            key = lispify(constants, innerExpr, next);\n            if (afterBracket.length > 0 && afterBracket.char(0) === ':') {\n              value = lispify(constants, afterBracket.substring(1));\n            } else if (afterBracket.length > 0 && afterBracket.char(0) === '(') {\n              value = lispify(constants, new CodeString('function' + afterBracket.toString()));\n            } else {\n              throw new SyntaxError('Unexpected token in computed property');\n            }\n            return createLisp<KeyValLisp>({\n              op: LispType.KeyVal,\n              a: key,\n              b: value,\n            });\n          }\n          funcFound = expectTypes.expFunction.types.function.exec('function ' + str);\n          if (funcFound) {\n            key = funcFound[3].trimStart();\n            value = lispify(\n              constants,\n              new CodeString('function ' + str.toString().replace(key, '')),\n            );\n          } else {\n            const extract = restOfExp(constants, str, [/^:/]);\n            key = lispify(constants, extract, [...next, 'spreadObject']) as PropLisp;\n\n            if (isLisp(key) && key[0] === LispType.SpreadObject) {\n              value = NullLisp;\n            } else {\n              if (key[0] === LispType.Prop) {\n                key = (key as PropLisp)[2];\n              }\n\n              if (str.length > extract.length && str.char(extract.length) === ':') {\n                value = lispify(constants, str.substring(extract.length + 1));\n              } else {\n                value = lispify(constants, extract, next);\n              }\n            }\n          }\n          return createLisp<KeyValLisp>({\n            op: LispType.KeyVal,\n            a: key,\n            b: value,\n          });\n        });\n        break;\n    }\n    const lisptype = (\n      type === 'arrayProp'\n        ? res[1]\n          ? LispType.PropOptional\n          : LispType.Prop\n        : type === 'call'\n          ? res[1]\n            ? LispType.CallOptional\n            : LispType.Call\n          : typesCreate[type]\n    ) as (typeof typesCreate)[keyof typeof typesCreate];\n    const currentTree = createLisp<\n      ArrayProp | PropLisp | Call | CreateObject | CreateArray | Group | PropOptional | CallOptional\n    >({\n      op: lisptype,\n      a: ctx.lispTree,\n      b: l,\n    }) as LispWithSource;\n    if (\n      lisptype === LispType.Group ||\n      lisptype === LispType.CreateArray ||\n      lisptype === LispType.CreateObject\n    ) {\n      currentTree.source = part.substring(start, i).toString();\n    }\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(i + 1),\n      expectTypes[expect].next,\n      currentTree,\n      false,\n      ctx,\n    );\n  });\n\n  setLispType(['dot', 'prop'] as const, (ctx) => {\n    const { constants, type, part, res, expect } = ctx;\n    let prop = res[0];\n    let index = res[0].length;\n    let op = 'prop';\n    if (type === 'dot') {\n      if (res[1]) {\n        op = '?prop';\n      }\n      const matches = part.substring(res[0].length).toString().match(expectTypes.prop.types.prop);\n      if (matches && matches.length) {\n        prop = matches[0];\n        index = prop.length + res[0].length;\n      } else {\n        throw new SyntaxError('Hanging dot');\n      }\n    } else if (reservedWords.has(prop) && prop !== 'this') {\n      throw new SyntaxError(`Unexpected token '${prop}'`);\n    }\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(index),\n      expectTypes[expect].next,\n      createLisp<PropLisp | PropOptional>({\n        op: typesCreate[op],\n        a: ctx.lispTree,\n        b: prop,\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  setLispType(['spreadArray', 'spreadObject'] as const, (ctx) => {\n    const { constants, type, part, res, expect } = ctx;\n    ctx.lispTree = createLisp<SpreadArrayLisp | SpreadObjectLisp>({\n      op: type === 'spreadArray' ? LispType.SpreadArray : LispType.SpreadObject,\n      a: LispType.None,\n      b: lispify(constants, part.substring(res[0].length), expectTypes[expect].next),\n    });\n  });\n}\n","import { LispType } from '../../utils';\nimport type {\n  Await,\n  BigInt as BigIntLisp,\n  GlobalSymbol,\n  LiteralIndex,\n  Number as NumberLisp,\n  RegexIndex,\n  Return,\n  StringIndex,\n  Throw,\n  Void,\n  Yield,\n  YieldDelegate,\n} from '../lisp';\nimport type { RegisterLispTypesDeps } from './shared';\n\nexport function registerValueLispTypes({\n  createLisp,\n  expectTypes,\n  lispify,\n  lispifyExpr,\n  restOfExp,\n  semiColon,\n  setLispType,\n}: RegisterLispTypesDeps) {\n  setLispType(['return', 'throw'] as const, (ctx) => {\n    const { constants, type, part, res } = ctx;\n    const expr = part.substring(res[0].length);\n    if (type === 'throw' && !expr.trimStart().length) {\n      throw new SyntaxError('Unexpected end of expression');\n    }\n    ctx.lispTree = createLisp<Return | Throw>({\n      op: type === 'return' ? LispType.Return : LispType.Throw,\n      a: LispType.None,\n      b: lispifyExpr(constants, expr, undefined, ctx),\n    });\n  });\n\n  setLispType(['number', 'boolean', 'null', 'und', 'NaN', 'Infinity'] as const, (ctx) => {\n    const { constants, type, part, res, expect } = ctx;\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(res[0].length),\n      expectTypes[expect].next,\n      createLisp<NumberLisp | BigIntLisp | GlobalSymbol>({\n        op:\n          type === 'number' ? (res[12] ? LispType.BigInt : LispType.Number) : LispType.GlobalSymbol,\n        a: LispType.None,\n        b: res[12] ? res[1] : res[0],\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  setLispType(['string', 'literal', 'regex'] as const, (ctx) => {\n    const { constants, type, part, res, expect } = ctx;\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(res[0].length),\n      expectTypes[expect].next,\n      createLisp<StringIndex | LiteralIndex | RegexIndex>({\n        op:\n          type === 'string'\n            ? LispType.StringIndex\n            : type === 'literal'\n              ? LispType.LiteralIndex\n              : LispType.RegexIndex,\n        a: LispType.None,\n        b: res[1],\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  setLispType(['void', 'await'] as const, (ctx) => {\n    const { constants, type, part, res, expect } = ctx;\n    const extract = restOfExp(constants, part.substring(res[0].length), [/^([^\\s.?\\w$]|\\?[^.])/]);\n    if (!extract.trimStart().length) {\n      throw new SyntaxError('Unexpected end of expression');\n    }\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(res[0].length + extract.length),\n      expectTypes[expect].next,\n      createLisp<Void | Await>({\n        op: type === 'void' ? LispType.Void : LispType.Await,\n        a: lispify(constants, extract),\n        b: LispType.None,\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  setLispType(['yield'] as const, (ctx) => {\n    const { constants, part, res, expect, generatorDepth } = ctx;\n    if (generatorDepth === 0) {\n      throw new SyntaxError('Unexpected token');\n    }\n    const isDelegate = res[0].trimEnd().endsWith('*');\n    const extract = restOfExp(constants, part.substring(res[0].length), [/^([^\\s.?\\w$]|\\?[^.])/]);\n    if (isDelegate && !extract.trimStart().length) {\n      throw new SyntaxError('Unexpected end of expression');\n    }\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(res[0].length + extract.length),\n      expectTypes[expect].next,\n      createLisp<Yield | YieldDelegate>({\n        op: isDelegate ? LispType.YieldDelegate : LispType.Yield,\n        a: lispify(constants, extract),\n        b: LispType.None,\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  setLispType(['new'] as const, (ctx) => {\n    const { constants, part, res } = ctx;\n    let i = res[0].length;\n    const obj = restOfExp(constants, part.substring(i), [], undefined, '(');\n    if (!obj.trimStart().length) {\n      throw new SyntaxError('Unexpected end of expression');\n    }\n    i += obj.length + 1;\n    const args = [];\n    if (part.char(i - 1) === '(') {\n      const argsString = restOfExp(constants, part.substring(i), [], '(');\n      i += argsString.length + 1;\n      let found;\n      let j = 0;\n      while ((found = restOfExp(constants, argsString.substring(j), [/^,/])).length) {\n        j += found.length + 1;\n        args.push(found.trim());\n      }\n    }\n    ctx.lispTree = lispify(\n      constants,\n      part.substring(i),\n      expectTypes.expEdge.next,\n      createLisp({\n        op: LispType.New,\n        a: lispify(constants, obj, expectTypes.initialize.next),\n        b: args.map((arg) => lispify(constants, arg, expectTypes.initialize.next)),\n      }),\n      false,\n      ctx,\n    );\n  });\n\n  void semiColon;\n}\n","import type { RegisterLispTypesDeps } from './shared';\nimport { registerConditionalLispTypes } from './conditionals';\nimport { registerControlLispTypes } from './control';\nimport { registerDeclarationLispTypes } from './declarations';\nimport { registerOperatorLispTypes } from './operators';\nimport { registerStructureLispTypes } from './structures';\nimport { registerValueLispTypes } from './values';\n\nexport function registerLispTypes(deps: RegisterLispTypesDeps) {\n  registerStructureLispTypes(deps);\n  registerOperatorLispTypes(deps);\n  registerConditionalLispTypes(deps);\n  registerValueLispTypes(deps);\n  registerDeclarationLispTypes(deps);\n  registerControlLispTypes(deps);\n}\n\nexport type { RegisterLispTypesDeps } from './shared';\n","import { unraw } from '../utils/unraw';\nimport { CodeString, isLisp, LispType, SandboxCapabilityError } from '../utils';\nimport { registerLispTypes } from './lispTypes';\nimport type {\n  Expression,\n  ExtractLispA,\n  ExtractLispB,\n  ExtractLispOp,\n  IConstants,\n  IExecutionTree,\n  IRegEx,\n  InternalCode,\n  Labeled,\n  Lisp,\n  LispCallback,\n  LispCallbackCtx,\n  LispDepthCtx,\n  LispFamily,\n  LispItem,\n  LispItemSingle,\n  Literal,\n  None,\n  Return,\n} from './lisp';\n\ntype LispWithSource = Lisp & { source?: string };\n\nfunction createLisp<L extends Lisp>(obj: {\n  op: ExtractLispOp<L>;\n  a: ExtractLispA<L>;\n  b: ExtractLispB<L>;\n}) {\n  return [obj.op, obj.a, obj.b] as L;\n}\n\nconst NullLisp = createLisp<None>({ op: LispType.None, a: LispType.None, b: LispType.None });\n\nconst statementLabelRegex = /([a-zA-Z$_][\\w$]*)\\s*:/g;\n\nfunction extractStatementLabels(prefix = '') {\n  return [...prefix.matchAll(statementLabelRegex)].map((match) => match[1]);\n}\n\nfunction wrapLabeledStatement<T extends Lisp>(labels: string[], statement: T): Lisp {\n  return labels.reduceRight(\n    (current, label) =>\n      createLisp<Labeled>({\n        op: LispType.Labeled,\n        a: label,\n        b: current,\n      }),\n    statement as Lisp,\n  );\n}\n\nconst lispTypes: Map<string, LispCallback<string>> = new Map();\n\nexport class ParseError extends Error {\n  constructor(\n    message: string,\n    public code: string,\n  ) {\n    super(message + ': ' + code.substring(0, 40));\n  }\n}\n\nlet lastType: CodeString | string;\nlet lastPart: CodeString | string;\nlet lastLastPart: CodeString | string;\nlet lastLastLastPart: CodeString | string;\nlet lastLastLastLastPart: CodeString | string;\n\nconst inlineIfElse = /^:/;\nconst elseIf = /^else(?![\\w$])/;\nconst ifElse = /^if(?![\\w$])/;\nconst space = /^\\s/;\n\nexport const expectTypes = {\n  splitter: {\n    types: {\n      power: /^(\\*\\*)(?!=)/,\n      opHigh: /^(\\/|\\*(?!\\*)|%)(?!=)/,\n      op: /^(\\+(?!(\\+))|-(?!(-)))(?!=)/,\n      comparitor: /^(<=|>=|<(?!<)|>(?!>)|!==|!=(?!=)|===|==)/,\n      bitwiseShift: /^(<<|>>(?!>)|>>>)(?!=)/,\n      bitwiseAnd: /^(&(?!&))(?!=)/,\n      bitwiseXor: /^(\\^)(?!=)/,\n      bitwiseOr: /^(\\|(?!\\|))(?!=)/,\n      boolOpAnd: /^(&&)(?!=)/,\n      boolOpOr: /^(\\|\\|(?!=)|instanceof(?![\\w$])|in(?![\\w$]))/,\n      nullishCoalescing: /^\\?\\?(?!=)/,\n    },\n    next: ['modifier', 'value', 'prop', 'incrementerBefore'],\n  },\n  inlineIf: {\n    types: {\n      inlineIf: /^\\?(?!\\.(?!\\d))/,\n    },\n    next: ['expEnd'],\n  },\n  assignment: {\n    types: {\n      assignModify: /^(-=|\\+=|\\/=|\\*\\*=|\\*=|%=|\\^=|&=|\\|=|>>>=|>>=|<<=|&&=|\\|\\|=|\\?\\?=)/,\n      assign: /^(=)(?!=)/,\n    },\n    next: ['modifier', 'value', 'prop', 'incrementerBefore'],\n  },\n  incrementerBefore: {\n    types: { incrementerBefore: /^(\\+\\+|--)/ },\n    next: ['prop'],\n  },\n  expEdge: {\n    types: {\n      call: /^(\\?\\.)?[(]/,\n      incrementerAfter: /^(\\+\\+|--)/,\n      taggedTemplate: /^`(\\d+)`/,\n    },\n    next: ['splitter', 'assignment', 'expEdge', 'dot', 'inlineIf', 'expEnd'],\n  },\n  modifier: {\n    types: {\n      not: /^!/,\n      inverse: /^~/,\n      negative: /^-(?!-)/,\n      positive: /^\\+(?!\\+)/,\n      typeof: /^typeof(?![\\w$])/,\n      delete: /^delete(?![\\w$])/,\n    },\n    next: ['modifier', 'value', 'prop', 'incrementerBefore'],\n  },\n  dot: {\n    types: {\n      arrayProp: /^(\\?\\.)?\\[/,\n      dot: /^(\\?)?\\.(?=\\s*[a-zA-Z$_])/,\n    },\n    next: ['splitter', 'assignment', 'expEdge', 'dot', 'inlineIf', 'expEnd'],\n  },\n  prop: {\n    types: {\n      prop: /^[a-zA-Z$_][a-zA-Z\\d$_]*/,\n    },\n    next: ['splitter', 'assignment', 'expEdge', 'dot', 'inlineIf', 'expEnd'],\n  },\n  value: {\n    types: {\n      createObject: /^\\{/,\n      createArray: /^\\[/,\n      number:\n        /^(0b[01]+(_[01]+)*|0o[0-7]+(_[0-7]+)*|0x[\\da-f]+(_[\\da-f]+)*|(\\d+(_\\d+)*(\\.\\d+(_\\d+)*)?|\\.\\d+(_\\d+)*))(e[+-]?\\d+(_\\d+)*)?(n)?(?!\\d)/i,\n      string: /^\"(\\d+)\"/,\n      literal: /^`(\\d+)`/,\n      regex: /^\\/(\\d+)\\/r(?![\\w$])/,\n      boolean: /^(true|false)(?![\\w$])/,\n      null: /^null(?![\\w$])/,\n      und: /^undefined(?![\\w$])/,\n      arrowFunctionSingle: /^(async\\s+)?([a-zA-Z$_][a-zA-Z\\d$_]*)\\s*=>\\s*({)?/,\n      arrowFunction: /^(async\\s*)?\\(\\s*([^)(]*?)\\s*\\)\\s*=>\\s*({)?/,\n      inlineFunction: /^(async\\s+)?function(\\*\\s*|\\s*)([a-zA-Z$_][a-zA-Z\\d$_]*)?\\s*\\(\\s*/,\n      yield: /^yield\\*(?![\\w$])\\s*|^yield(?![\\w$])\\s*/,\n      group: /^\\(/,\n      NaN: /^NaN(?![\\w$])/,\n      Infinity: /^Infinity(?![\\w$])/,\n      void: /^void(?![\\w$])\\s*/,\n      await: /^await(?![\\w$])\\s*/,\n      new: /^new(?![\\w$])\\s*/,\n    },\n    next: ['splitter', 'expEdge', 'dot', 'inlineIf', 'expEnd'],\n  },\n  initialize: {\n    types: {\n      initializeDestructure: /^(var|let|const|internal)\\s+([{[])/,\n      initialize: /^(var|let|const|internal)\\s+([a-zA-Z$_][a-zA-Z\\d$_]*)\\s*(=)?/,\n      return: /^return(?![\\w$])/,\n      throw: /^throw(?![\\w$])\\s*/,\n    },\n    next: ['modifier', 'value', 'prop', 'incrementerBefore', 'expEnd'],\n  },\n  spreadObject: {\n    types: {\n      spreadObject: /^\\.\\.\\./,\n    },\n    next: ['value', 'prop'],\n  },\n  spreadArray: {\n    types: {\n      spreadArray: /^\\.\\.\\./,\n    },\n    next: ['value', 'prop'],\n  },\n  expEnd: { types: {}, next: [] },\n  expFunction: {\n    types: {\n      function: /^(async\\s+)?function(\\*\\s*|\\s+)([a-zA-Z$_][a-zA-Z\\d$_]*)\\s*\\(\\s*/,\n    },\n    next: ['expEdge', 'expEnd'],\n  },\n  expSingle: {\n    types: {\n      for: /^((?:[a-zA-Z$_][\\w$]*\\s*:\\s*)*)\\s*for(\\s+await)?\\s*\\(/,\n      do: /^((?:[a-zA-Z$_][\\w$]*\\s*:\\s*)*)\\s*do(?![\\w$])\\s*(\\{)?/,\n      while: /^((?:[a-zA-Z$_][\\w$]*\\s*:\\s*)*)\\s*while\\s*\\(/,\n      loopAction: /^(break|continue)(?![\\w$])\\s*([a-zA-Z$_][\\w$]*)?/,\n      if: /^((?:[a-zA-Z$_][\\w$]*\\s*:\\s*)*)\\s*if\\s*\\(/,\n      try: /^((?:[a-zA-Z$_][\\w$]*\\s*:\\s*)*)\\s*try\\s*{/,\n      block: /^((?:[a-zA-Z$_][\\w$]*\\s*:\\s*)*)\\s*{/,\n      switch: /^((?:[a-zA-Z$_][\\w$]*\\s*:\\s*)*)\\s*switch\\s*\\(/,\n    },\n    next: ['expEnd'],\n  },\n} as Record<string, { types: Record<string, RegExp>; next: string[] }>;\n\nconst closings = {\n  '(': ')',\n  '[': ']',\n  '{': '}',\n  \"'\": \"'\",\n  '\"': '\"',\n  '`': '`',\n} as Record<string, string>;\n\nexport function testMultiple(str: string, tests: RegExp[]) {\n  let found: RegExpExecArray | null = null;\n  for (let i = 0; i < tests.length; i++) {\n    const test = tests[i];\n    found = test.exec(str);\n    if (found) break;\n  }\n  return found;\n}\n\nconst emptyString = new CodeString('');\n\nconst okFirstChars = /^[+\\-~ !]/;\nconst aNumber = expectTypes.value.types.number;\nconst wordReg = /^((if|for|else|while|do|function)(?![\\w$])|[\\w$]+)/;\nconst semiColon = /^;/;\nconst insertedSemicolons: WeakMap<{ str: string }, Array<number>> = new WeakMap();\nconst quoteCache: WeakMap<{ str: string }, Map<number, number>> = new WeakMap();\nexport interface restDetails {\n  oneliner?: boolean;\n  words?: string[];\n  lastWord?: string;\n  lastAnyWord?: string;\n  regRes?: RegExpExecArray;\n  bodyContentAfterKeyword?: boolean;\n}\nexport function restOfExp(\n  constants: IConstants,\n  part: CodeString,\n  tests?: RegExp[],\n  quote?: string,\n  firstOpening?: string,\n  closingsTests?: RegExp[],\n  details: restDetails = {},\n  depth = 0,\n): CodeString {\n  if (!part.length) {\n    return part;\n  }\n  if (depth > constants.maxDepth) {\n    throw new SandboxCapabilityError('Maximum expression depth exceeded');\n  }\n  details.words = details.words || [];\n  let isStart = true;\n  tests = tests || [];\n  const hasSemiTest = tests.includes(semiColon);\n  if (hasSemiTest) {\n    tests = tests.filter((a) => a !== semiColon);\n  }\n  const insertedSemis = insertedSemicolons.get(part.ref) || [];\n  const cache = quoteCache.get(part.ref) || new Map<number, number>();\n  quoteCache.set(part.ref, cache);\n  if (quote && cache.has(part.start - 1)) {\n    return part.substring(0, cache.get(part.start - 1)! - part.start);\n  }\n  let escape = false;\n  let done = false;\n  let lastChar = '';\n  let isOneLiner = false;\n  let i;\n  let lastInertedSemi = false;\n  let seenKeyword = false;\n  let skipNextWord = false;\n  for (i = 0; i < part.length && !done; i++) {\n    let char = part.char(i)!;\n    if (quote === '\"' || quote === \"'\" || quote === '`') {\n      if (quote === '`' && char === '$' && part.char(i + 1) === '{' && !escape) {\n        const skip = restOfExp(\n          constants,\n          part.substring(i + 2),\n          [],\n          '{',\n          undefined,\n          undefined,\n          {},\n          depth + 1,\n        );\n        i += skip.length + 2;\n      } else if (char === quote && !escape) {\n        return part.substring(0, i);\n      }\n      escape = !escape && char === '\\\\';\n    } else if (closings[char]) {\n      if (!lastInertedSemi && insertedSemis[i + part.start]) {\n        lastInertedSemi = true;\n        if (hasSemiTest) {\n          break;\n        }\n        i--;\n        lastChar = ';';\n        continue;\n      }\n      if (isOneLiner && char === '{') {\n        isOneLiner = false;\n      }\n      if (char === firstOpening) {\n        done = true;\n        break;\n      } else {\n        const skip = restOfExp(\n          constants,\n          part.substring(i + 1),\n          [],\n          char,\n          undefined,\n          undefined,\n          {},\n          depth + 1,\n        );\n        cache.set(skip.start - 1, skip.end);\n        i += skip.length + 1;\n        isStart = false;\n        if (closingsTests) {\n          const sub = part.substring(i);\n          let found: RegExpExecArray | null;\n          if ((found = testMultiple(sub.toString(), closingsTests))) {\n            details.regRes = found;\n            done = true;\n          }\n        }\n      }\n    } else if (!quote) {\n      let sub = part.substring(i).toString();\n      let foundWord: RegExpExecArray | null;\n      let foundNumber: RegExpExecArray | null;\n      if (closingsTests) {\n        let found: RegExpExecArray | null;\n        if ((found = testMultiple(sub, closingsTests))) {\n          details.regRes = found;\n          i++;\n          done = true;\n          break;\n        }\n      }\n      if ((foundNumber = aNumber.exec(sub))) {\n        i += foundNumber[0].length - 1;\n        sub = part.substring(i).toString();\n        if (closingsTests) {\n          let found: RegExpExecArray | null;\n          if ((found = testMultiple(sub, closingsTests))) {\n            details.regRes = found;\n            i++;\n            done = true;\n            break;\n          }\n        }\n      } else if (lastChar != char) {\n        let found: [string] | RegExpExecArray | null = null;\n        if (char === ';' || (insertedSemis[i + part.start] && !isStart && !lastInertedSemi)) {\n          if (hasSemiTest) {\n            found = [';'];\n          } else if (insertedSemis[i + part.start]) {\n            lastInertedSemi = true;\n            i--;\n            lastChar = ';';\n            continue;\n          }\n          char = sub = ';';\n        } else {\n          lastInertedSemi = false;\n        }\n        if (!found) {\n          found = testMultiple(sub, tests);\n        }\n        if (found) {\n          done = true;\n        }\n        if (!done && (foundWord = wordReg.exec(sub))) {\n          isOneLiner = true;\n          if (foundWord[2]) {\n            seenKeyword = true;\n            skipNextWord = true;\n          } else if (seenKeyword) {\n            if (skipNextWord) {\n              skipNextWord = false;\n            } else {\n              details.bodyContentAfterKeyword = true;\n            }\n          }\n          if (foundWord[0].length > 1) {\n            details.words.push(foundWord[1]);\n            details.lastAnyWord = foundWord[1];\n            if (foundWord[2]) {\n              details.lastWord = foundWord[2];\n            }\n          }\n          if (foundWord[0].length > 2) {\n            i += foundWord[0].length - 2;\n          }\n        }\n      }\n      if (isStart) {\n        if (okFirstChars.test(sub)) {\n          done = false;\n        } else {\n          isStart = false;\n        }\n      }\n      if (done) break;\n    } else if (char === closings[quote]) {\n      return part.substring(0, i);\n    }\n    lastChar = char;\n  }\n  if (quote) {\n    throw new SyntaxError(\"Unclosed '\" + quote + \"'\");\n  }\n  if (details) {\n    details.oneliner = isOneLiner;\n  }\n  return part.substring(0, i);\n}\nrestOfExp.next = ['splitter', 'expEnd', 'inlineIf'];\n\nconst startingExecpted = [\n  'initialize',\n  'expSingle',\n  'expFunction',\n  'value',\n  'modifier',\n  'prop',\n  'incrementerBefore',\n  'expEnd',\n];\n\nexport const setLispType = <T extends readonly string[]>(types: T, fn: LispCallback<T[number]>) => {\n  types.forEach((type) => {\n    lispTypes.set(type, fn);\n  });\n};\n\nregisterLispTypes({\n  NullLisp,\n  ParseError,\n  createLisp,\n  emptyString,\n  expectTypes,\n  expandDestructure,\n  expandFunctionParamDestructure,\n  extractStatementLabels,\n  findPatternEndIdx,\n  getDestructurePatternSource,\n  insertSemicolons,\n  lispify,\n  lispifyBlock,\n  lispifyExpr,\n  lispifyFunction,\n  lispifyReturnExpr,\n  restOfExp,\n  semiColon,\n  setLispType,\n  splitByCommasDestructure,\n  startingExecpted,\n  wrapLabeledStatement,\n});\n\nfunction splitByCommasDestructure(s: string): string[] {\n  const parts: string[] = [];\n  let depth = 0;\n  let cur = '';\n  for (let i = 0; i < s.length; i++) {\n    const c = s[i];\n    if (c === '[' || c === '{' || c === '(') depth++;\n    else if (c === ']' || c === '}' || c === ')') depth--;\n    if (c === ',' && depth === 0) {\n      parts.push(cur);\n      cur = '';\n    } else {\n      cur += c;\n    }\n  }\n  parts.push(cur);\n  return parts;\n}\n\nfunction findFirstAtTopLevel(s: string, ch: string): number {\n  let depth = 0;\n  for (let i = 0; i < s.length; i++) {\n    const c = s[i];\n    if (c === '[' || c === '{' || c === '(') depth++;\n    else if (c === ']' || c === '}' || c === ')') depth--;\n    if (c === ch && depth === 0) return i;\n  }\n  return -1;\n}\n\nfunction findPatternEndIdx(s: string): number {\n  let depth = 0;\n  for (let i = 0; i < s.length; i++) {\n    const c = s[i];\n    if (c === '[' || c === '{') depth++;\n    else if (c === ']' || c === '}') {\n      depth--;\n      if (depth === 0) return i + 1;\n    }\n  }\n  return s.length;\n}\n\nconst validIdentifier = /^[a-zA-Z$_][a-zA-Z\\d$_]*$/;\nfunction assertIdentifier(name: string): string {\n  if (!validIdentifier.test(name)) throw new SyntaxError(`Invalid destructuring target: '${name}'`);\n  return name;\n}\n\nfunction expandDestructure(keyword: string, patternStr: string, rhsStr: string): string {\n  const stmts: string[] = [];\n\n  function genTemp(): string {\n    return `$$_d${Math.random().toString(36).slice(2)}`;\n  }\n\n  function processPattern(pattern: string, src: string) {\n    pattern = pattern.trim();\n    if (pattern.startsWith('[')) {\n      processArrayPattern(pattern.slice(1, -1), src);\n    } else if (pattern.startsWith('{')) {\n      processObjectPattern(pattern.slice(1, -1), src);\n    }\n  }\n\n  function processArrayPattern(content: string, src: string) {\n    const elements = splitByCommasDestructure(content);\n    for (let i = 0; i < elements.length; i++) {\n      const elem = elements[i].trim();\n      if (!elem) continue;\n\n      if (elem.startsWith('...')) {\n        const rest = elem.slice(3).trim();\n        if (rest.startsWith('[') || rest.startsWith('{')) {\n          const t = genTemp();\n          stmts.push(`internal ${t} = ${src}.slice(${i})`);\n          processPattern(rest, t);\n        } else {\n          stmts.push(`${keyword} ${assertIdentifier(rest)} = ${src}.slice(${i})`);\n        }\n        break;\n      }\n\n      const eqIdx = findFirstAtTopLevel(elem, '=');\n      const target = eqIdx !== -1 ? elem.slice(0, eqIdx).trim() : elem.trim();\n      const defaultVal = eqIdx !== -1 ? elem.slice(eqIdx + 1).trim() : undefined;\n\n      if (target.startsWith('[') || target.startsWith('{')) {\n        const t = genTemp();\n        stmts.push(\n          defaultVal !== undefined\n            ? `internal ${t} = ${src}[${i}] !== undefined ? ${src}[${i}] : (${defaultVal})`\n            : `internal ${t} = ${src}[${i}]`,\n        );\n        processPattern(target, t);\n      } else {\n        stmts.push(\n          defaultVal !== undefined\n            ? `${keyword} ${assertIdentifier(target)} = ${src}[${i}] !== undefined ? ${src}[${i}] : (${defaultVal})`\n            : `${keyword} ${assertIdentifier(target)} = ${src}[${i}]`,\n        );\n      }\n    }\n  }\n\n  function processObjectPattern(content: string, src: string) {\n    const props = splitByCommasDestructure(content);\n    const usedKeys: string[] = [];\n\n    for (const prop of props) {\n      const p = prop.trim();\n      if (!p) continue;\n\n      if (p.startsWith('...')) {\n        // Check that rest is the last element\n        const restIdx = props.indexOf(prop);\n        const hasMore = props.slice(restIdx + 1).some((pp) => pp.trim().length > 0);\n        if (hasMore) {\n          throw new SyntaxError('Rest element must be last element');\n        }\n        const rest = p.slice(3).trim();\n        const exclTemp = genTemp();\n        const keyTemp = genTemp();\n        const resTemp = genTemp();\n        const exclEntries = usedKeys.map((k) => `${assertIdentifier(k)}:1`).join(',');\n        stmts.push(`internal ${exclTemp} = {${exclEntries}}`);\n        stmts.push(`internal ${resTemp} = {}`);\n        stmts.push(\n          `for (internal ${keyTemp} in ${src}) { if (!(${keyTemp} in ${exclTemp})) { ${resTemp}[${keyTemp}] = ${src}[${keyTemp}] } }`,\n        );\n        if (rest.startsWith('[') || rest.startsWith('{')) {\n          processPattern(rest, resTemp);\n        } else {\n          stmts.push(`${keyword} ${assertIdentifier(rest)} = ${resTemp}`);\n        }\n        break;\n      }\n\n      if (p.startsWith('[')) {\n        // Computed property name: [expr]: target\n        let closeBracket = -1;\n        let depth = 1;\n        for (let ci = 1; ci < p.length; ci++) {\n          if (p[ci] === '[') depth++;\n          else if (p[ci] === ']') {\n            depth--;\n            if (depth === 0) {\n              closeBracket = ci;\n              break;\n            }\n          }\n        }\n        if (closeBracket !== -1) {\n          const computedExpr = p.slice(1, closeBracket);\n          const after = p.slice(closeBracket + 1).trim();\n          if (after.startsWith(':')) {\n            const valueStr = after.slice(1).trim();\n            const accessor = `${src}[${computedExpr}]`;\n            const eqIdx = findFirstAtTopLevel(valueStr, '=');\n            const tgt =\n              eqIdx !== -1 && !valueStr.slice(0, eqIdx).trim().match(/^[[{]/)\n                ? valueStr.slice(0, eqIdx).trim()\n                : valueStr.trim();\n            const defVal =\n              eqIdx !== -1 && !valueStr.slice(0, eqIdx).trim().match(/^[[{]/)\n                ? valueStr.slice(eqIdx + 1).trim()\n                : undefined;\n            if (tgt.startsWith('[') || tgt.startsWith('{')) {\n              const t = genTemp();\n              stmts.push(\n                defVal !== undefined\n                  ? `internal ${t} = ${accessor} !== undefined ? ${accessor} : (${defVal})`\n                  : `internal ${t} = ${accessor}`,\n              );\n              processPattern(tgt, t);\n            } else {\n              stmts.push(\n                defVal !== undefined\n                  ? `${keyword} ${assertIdentifier(tgt)} = ${accessor} !== undefined ? ${accessor} : (${defVal})`\n                  : `${keyword} ${assertIdentifier(tgt)} = ${accessor}`,\n              );\n            }\n          }\n        }\n        continue;\n      }\n\n      const colonIdx = findFirstAtTopLevel(p, ':');\n      if (colonIdx !== -1) {\n        const key = assertIdentifier(p.slice(0, colonIdx).trim());\n        const valueStr = p.slice(colonIdx + 1).trim();\n        usedKeys.push(key);\n        const accessor = `${src}.${key}`;\n        const eqIdx = findFirstAtTopLevel(valueStr, '=');\n        const beforeEq = eqIdx !== -1 ? valueStr.slice(0, eqIdx).trim() : valueStr.trim();\n        const isNestedPattern = beforeEq.startsWith('[') || beforeEq.startsWith('{');\n        const tgt = isNestedPattern ? valueStr.trim() : beforeEq;\n        const defVal =\n          !isNestedPattern && eqIdx !== -1 ? valueStr.slice(eqIdx + 1).trim() : undefined;\n\n        if (tgt.startsWith('[') || tgt.startsWith('{')) {\n          const patEnd = findPatternEndIdx(tgt);\n          const finalPattern = tgt.slice(0, patEnd);\n          const afterPat = tgt.slice(patEnd).trim();\n          const nestedDef = afterPat.startsWith('=') ? afterPat.slice(1).trim() : undefined;\n          const t = genTemp();\n          stmts.push(\n            nestedDef !== undefined\n              ? `internal ${t} = ${accessor} !== undefined ? ${accessor} : (${nestedDef})`\n              : `internal ${t} = ${accessor}`,\n          );\n          processPattern(finalPattern, t);\n        } else {\n          stmts.push(\n            defVal !== undefined\n              ? `${keyword} ${assertIdentifier(tgt)} = ${accessor} !== undefined ? ${accessor} : (${defVal})`\n              : `${keyword} ${assertIdentifier(tgt)} = ${accessor}`,\n          );\n        }\n        continue;\n      }\n\n      const eqIdx = findFirstAtTopLevel(p, '=');\n      if (eqIdx !== -1) {\n        const name = assertIdentifier(p.slice(0, eqIdx).trim());\n        const defaultVal = p.slice(eqIdx + 1).trim();\n        usedKeys.push(name);\n        stmts.push(\n          `${keyword} ${name} = ${src}.${name} !== undefined ? ${src}.${name} : (${defaultVal})`,\n        );\n      } else {\n        assertIdentifier(p);\n        usedKeys.push(p);\n        stmts.push(`${keyword} ${p} = ${src}.${p}`);\n      }\n    }\n  }\n\n  const rootTemp = genTemp();\n  stmts.unshift(`var ${rootTemp} = (${rhsStr})`);\n  processPattern(patternStr, rootTemp);\n  return stmts.join('; ');\n}\n\nfunction getDestructurePatternSource(tree: LispItem): string | null {\n  if (!isLisp(tree)) return null;\n  const source = (tree as LispWithSource).source?.trim();\n  if (source && (source.startsWith('[') || source.startsWith('{'))) {\n    return source;\n  }\n  if (tree[0] === LispType.Group) {\n    return getDestructurePatternSource(tree[2]);\n  }\n  return null;\n}\n\nfunction expandFunctionParamDestructure(\n  args: string[],\n  funcBody: string,\n): { args: string[]; body: string } {\n  const injected: string[] = [];\n  const newArgs = args.map((arg, i) => {\n    const a = arg.trim();\n    if (a.startsWith('[') || a.startsWith('{')) {\n      const tempName = `$$_p${i}`;\n      // Check for a parameter default: {pattern} = defaultVal or [pattern] = defaultVal\n      const patEnd = findPatternEndIdx(a);\n      const patternOnly = a.slice(0, patEnd);\n      const afterPat = a.slice(patEnd).trim();\n      if (afterPat.startsWith('=')) {\n        const defaultVal = afterPat.slice(1).trim();\n        // Use temp var that applies the default, then destructure from it\n        injected.push(\n          expandDestructure(\n            'const',\n            patternOnly,\n            `${tempName} !== undefined ? ${tempName} : (${defaultVal})`,\n          ),\n        );\n      } else {\n        injected.push(expandDestructure('const', patternOnly, tempName));\n      }\n      return tempName;\n    }\n    // Handle simple default: a = defaultVal or ...rest (no default)\n    const eqIdx = findFirstAtTopLevel(a, '=');\n    if (eqIdx !== -1 && !a.startsWith('...')) {\n      const paramName = a.slice(0, eqIdx).trim();\n      const defaultVal = a.slice(eqIdx + 1).trim();\n      injected.push(`if (${paramName} === undefined) ${paramName} = (${defaultVal})`);\n      return paramName;\n    }\n    return a;\n  });\n  if (injected.length === 0) return { args: newArgs, body: funcBody };\n  return { args: newArgs, body: injected.join('; ') + '; ' + funcBody };\n}\n\nfunction lispify(\n  constants: IConstants,\n  part: CodeString,\n  expected?: readonly string[],\n  lispTree?: Lisp,\n  topLevel = false,\n  depthCtx: LispDepthCtx = { generatorDepth: 0, asyncDepth: 0, lispDepth: 0 },\n): Lisp {\n  if (depthCtx.lispDepth > constants.maxDepth) {\n    throw new SandboxCapabilityError('Maximum expression depth exceeded');\n  }\n  const { generatorDepth, asyncDepth, lispDepth } = depthCtx;\n  lispTree = lispTree || NullLisp;\n  expected = expected || expectTypes.initialize.next;\n  if (part === undefined) return lispTree;\n\n  part = part.trimStart();\n  const str = part.toString();\n  if (!part.length && !expected.includes('expEnd')) {\n    throw new SyntaxError('Unexpected end of expression');\n  }\n  if (!part.length) return lispTree;\n\n  const ctx: LispCallbackCtx = {\n    constants,\n    type: '',\n    part,\n    res: [],\n    expect: '',\n    lispTree,\n    generatorDepth,\n    asyncDepth,\n    lispDepth,\n  };\n\n  let res: any;\n  for (const expect of expected) {\n    if (expect === 'expEnd') {\n      continue;\n    }\n    for (const type in expectTypes[expect].types) {\n      if (type === 'expEnd') {\n        continue;\n      }\n      if ((res = expectTypes[expect].types[type].exec(str))) {\n        lastType = type;\n        lastLastLastLastPart = lastLastLastPart;\n        lastLastLastPart = lastLastPart;\n        lastLastPart = lastPart;\n        lastPart = part;\n        ctx.type = type;\n        ctx.part = part;\n        ctx.res = res;\n        ctx.expect = expect;\n        try {\n          lispTypes.get(type)?.(ctx as LispCallbackCtx & { type: string });\n        } catch (e) {\n          if (topLevel && e instanceof SyntaxError) {\n            throw new ParseError(e.message, str);\n          }\n          throw e;\n        }\n        break;\n      }\n    }\n    if (res) break;\n  }\n\n  if (!res && part.length) {\n    if (topLevel) {\n      throw new ParseError(`Unexpected token after ${lastType}: ${part.char(0)}`, str);\n    }\n    throw new SyntaxError(`Unexpected token after ${lastType}: ${part.char(0)}`);\n  }\n  return ctx.lispTree;\n}\n\nconst startingExpectedWithoutSingle = startingExecpted.filter((r) => r !== 'expSingle');\n\nfunction lispifyExpr(\n  constants: IConstants,\n  str: CodeString,\n  expected?: readonly string[],\n  depthCtx: LispDepthCtx = { generatorDepth: 0, asyncDepth: 0, lispDepth: 0 },\n): Lisp {\n  if (depthCtx.lispDepth > constants.maxDepth) {\n    throw new SandboxCapabilityError('Maximum expression depth exceeded');\n  }\n  if (!str.trimStart().length) return NullLisp;\n  const subExpressions: CodeString[] = [];\n  let sub: CodeString;\n  let pos = 0;\n  expected = expected || expectTypes.initialize.next;\n  if (expected.includes('expSingle')) {\n    if (testMultiple(str.toString(), Object.values(expectTypes.expSingle.types))) {\n      return lispify(constants, str, ['expSingle'], undefined, true, depthCtx);\n    }\n  }\n  if (expected === startingExecpted) expected = startingExpectedWithoutSingle;\n  while ((sub = restOfExp(constants, str.substring(pos), [/^,/])).length) {\n    subExpressions.push(sub.trimStart());\n    pos += sub.length + 1;\n  }\n  if (subExpressions.length === 1) {\n    return lispify(constants, str, expected, undefined, true, depthCtx);\n  }\n  if (expected.includes('initialize')) {\n    const defined = expectTypes.initialize.types.initialize.exec(subExpressions[0].toString());\n    if (defined) {\n      return createLisp<InternalCode>({\n        op: LispType.InternalBlock,\n        a: subExpressions.map((str, i) =>\n          lispify(\n            constants,\n            i ? new CodeString(defined![1] + ' ' + str) : str,\n            ['initialize'],\n            undefined,\n            true,\n            depthCtx,\n          ),\n        ),\n        b: LispType.None,\n      });\n    } else if (expectTypes.initialize.types.return.exec(subExpressions[0].toString())) {\n      return lispify(constants, str, expected, undefined, true, depthCtx);\n    }\n  }\n  const exprs = subExpressions.map((str) =>\n    lispify(constants, str, expected, undefined, true, depthCtx),\n  );\n  return createLisp<Expression>({ op: LispType.Expression, a: exprs, b: LispType.None });\n}\n\nexport function lispifyReturnExpr(constants: IConstants, str: CodeString) {\n  return createLisp<Return>({\n    op: LispType.Return,\n    a: LispType.None,\n    b: lispifyExpr(constants, str),\n  });\n}\n\nexport function lispifyBlock(\n  str: CodeString,\n  constants: IConstants,\n  expression = false,\n  depthCtx: LispDepthCtx = { generatorDepth: 0, asyncDepth: 0, lispDepth: 0 },\n): Lisp[] {\n  str = insertSemicolons(constants, str);\n  if (!str.trim().length) return [];\n  const parts: CodeString[] = [];\n  let part: CodeString;\n  let pos = 0;\n  let start = 0;\n  let details: restDetails = {};\n  let skipped = false;\n  let isInserted = false;\n  while (\n    (part = restOfExp(\n      constants,\n      str.substring(pos),\n      [semiColon],\n      undefined,\n      undefined,\n      undefined,\n      details,\n    )).length\n  ) {\n    isInserted = !!(str.char(pos + part.length) && str.char(pos + part.length) !== ';');\n    pos += part.length + (isInserted ? 0 : 1);\n    if (/^\\s*else(?![\\w$])/.test(str.substring(pos).toString())) {\n      skipped = true;\n    } else if (\n      details['words']?.includes('do') &&\n      /^\\s*while(?![\\w$])/.test(str.substring(pos).toString())\n    ) {\n      skipped = true;\n    } else {\n      skipped = false;\n      parts.push(str.substring(start, pos - (isInserted ? 0 : 1)));\n      start = pos;\n    }\n    details = {};\n    if (expression) break;\n  }\n  if (skipped) {\n    parts.push(str.substring(start, pos - (isInserted ? 0 : 1)));\n  }\n  return parts\n    .map((str) => str.trimStart())\n    .filter((str) => str.length)\n    .map((str) => {\n      return lispifyExpr(constants, str.trimStart(), startingExecpted, depthCtx);\n    });\n}\n\nexport function lispifyFunction(\n  str: CodeString,\n  constants: IConstants,\n  expression = false,\n  depthCtx: LispDepthCtx = { generatorDepth: 0, asyncDepth: 0, lispDepth: 0 },\n): Lisp[] {\n  if (!str.trim().length) return [];\n  const tree = lispifyBlock(str, constants, expression, depthCtx);\n  hoist(tree);\n  return tree;\n}\n\nfunction hoist(item: LispItem, res: Lisp[] = []): boolean {\n  if (isLisp(item)) {\n    if (!isLisp<LispFamily>(item)) return false;\n    const [op, a, b] = item;\n    if (\n      op === LispType.Labeled ||\n      op === LispType.Try ||\n      op === LispType.If ||\n      op === LispType.Loop ||\n      op === LispType.Switch\n    ) {\n      hoist(a, res);\n      hoist(b, res);\n    } else if (op === LispType.Var) {\n      res.push(createLisp({ op: LispType.Var, a: a, b: LispType.None }));\n    } else if (op === LispType.Function && a[2]) {\n      res.push(item);\n      return true;\n    }\n  } else if (Array.isArray(item)) {\n    const rep: LispItemSingle[] = [];\n    for (const it of item) {\n      if (!hoist(it, res)) {\n        rep.push(it);\n      }\n    }\n    if (rep.length !== item.length) {\n      item.length = 0;\n      item.push(...res, ...rep);\n    }\n  }\n  return false;\n}\n\nconst closingsNoInsertion = /^(\\})\\s*(catch|finally|else|while|instanceof)(?![\\w$])/;\n//  \\w|)|] \\n \\w = 2                                  // \\} \\w|\\{ = 5\nconst colonsRegex = /^((([\\w$\\])\"'`]|\\+\\+|--)\\s*\\r?\\n\\s*([\\w$+\\-!~]))|(\\}\\s*[\\w$!~+\\-{(\"'`]))/;\n\n// if () \\w \\n; \\w              == \\w \\n \\w    | last === if             a\n// if () { }; \\w                == \\} ^else    | last === if             b\n// if () \\w \\n; else \\n \\w \\n;  == \\w \\n \\w    | last === else           a\n// if () {} else {}; \\w         == \\} \\w       | last === else           b\n// while () \\n \\w \\n; \\w        == \\w \\n \\w    | last === while          a\n// while () { }; \\w             == \\} \\w       | last === while          b\n// do \\w \\n; while (); \\w       == \\w \\n while | last === do             a\n// do { } while (); \\w          == \\) \\w       | last === while          c\n// try {} catch () {}; \\w       == \\} \\w       | last === catch|finally  b\n// \\w \\n; \\w                    == \\w \\n \\w    | last === none           a\n// cb() \\n \\w                   == \\) \\n \\w    | last === none           a\n// obj[a] \\n \\w                 == \\] \\n \\w    | last === none           a\n// {} {}                        == \\} \\{       | last === none           b\n\nexport function insertSemicolons(constants: IConstants, str: CodeString): CodeString {\n  let rest = str;\n  let sub = emptyString;\n  let details: restDetails = {};\n  let pendingDoWhile = false;\n  const inserted = insertedSemicolons.get(str.ref) || new Array(str.ref.str.length);\n  while (\n    (sub = restOfExp(constants, rest, [], undefined, undefined, [colonsRegex], details)).length\n  ) {\n    let valid = false;\n    let part = sub;\n    let edge = sub.length;\n    if (details.regRes) {\n      valid = true;\n      const [, , a, , , b] = details.regRes;\n      edge = details.regRes[3] === '++' || details.regRes[3] === '--' ? sub.length + 1 : sub.length;\n      part = rest.substring(0, edge);\n      if (b) {\n        const res = closingsNoInsertion.exec(rest.substring(sub.length - 1).toString());\n        if (res) {\n          if (res[2] === 'while') {\n            if (details.lastWord === 'do') {\n              valid = false;\n              pendingDoWhile = true;\n            } else {\n              valid = true;\n            }\n          } else {\n            valid = false;\n          }\n        } else if (\n          details.lastWord === 'function' &&\n          details.regRes[5][0] === '}' &&\n          details.regRes[5].slice(-1) === '('\n        ) {\n          valid = false;\n        }\n      } else if (a) {\n        if (pendingDoWhile && details.lastWord === 'while') {\n          valid = true;\n          pendingDoWhile = false;\n        } else if (\n          details.lastWord === 'if' ||\n          details.lastWord === 'while' ||\n          details.lastWord === 'for' ||\n          details.lastWord === 'else'\n        ) {\n          valid = !!details.bodyContentAfterKeyword;\n        }\n      }\n    }\n    if (valid) {\n      inserted[part.end] = true;\n    }\n    rest = rest.substring(edge);\n    details = {};\n  }\n  insertedSemicolons.set(str.ref, inserted);\n  return str;\n}\n\nexport function checkRegex(str: string): IRegEx | null {\n  let i = 1;\n  let escape = false;\n  let done = false;\n  let cancel = false;\n  while (i < str.length && !done && !cancel) {\n    done = str[i] === '/' && !escape;\n    escape = str[i] === '\\\\' && !escape;\n    cancel = str[i] === '\\n';\n    i++;\n  }\n  const after = str.substring(i);\n  cancel = cancel || !done || /^\\s*\\d/.test(after);\n  if (cancel) return null;\n  const flags = /^[a-z]*/.exec(after);\n  if (/^\\s+[\\w$]/.test(str.substring(i + flags![0].length))) {\n    return null;\n  }\n  const regexPattern = str.substring(1, i - 1);\n  const regexFlags = (flags && flags[0]) || '';\n  try {\n    new RegExp(regexPattern, regexFlags);\n  } catch (e) {\n    if (e instanceof SyntaxError) throw e;\n  }\n  return {\n    regex: regexPattern,\n    flags: regexFlags,\n    length: i + ((flags && flags[0].length) || 0),\n  };\n}\n\nconst notDivide = /(typeof|delete|instanceof|return|in|of|throw|new|void|do|if)$/;\nconst possibleDivide = /^([\\w$\\])]|\\+\\+|--)[\\s/]/;\nexport function extractConstants(\n  constants: IConstants,\n  str: string,\n  currentEnclosure = '',\n  depth = 0,\n): { str: string; length: number } {\n  if (depth > constants.maxDepth) {\n    throw new SandboxCapabilityError('Maximum expression depth exceeded');\n  }\n  let quote;\n  let extract: (string | number)[] = [];\n  let escape = false;\n  let regexFound: IRegEx | null;\n  let comment = '';\n  let commentStart = -1;\n  let currJs: string[] = [];\n  let char = '';\n  const strRes: (string | number)[] = [];\n  const enclosures: string[] = [];\n  let isPossibleDivide: RegExpExecArray | null = null;\n  let i = 0;\n  for (i = 0; i < str.length; i++) {\n    char = str[i];\n    if (comment) {\n      if (char === comment) {\n        if (comment === '*' && str[i + 1] === '/') {\n          comment = '';\n          i++;\n        } else if (comment === '\\n') {\n          comment = '';\n          strRes.push('\\n');\n        }\n      }\n    } else {\n      if (escape) {\n        escape = false;\n        extract.push(char);\n        continue;\n      }\n\n      if (quote) {\n        if (quote === '`' && char === '$' && str[i + 1] === '{') {\n          const skip = extractConstants(constants, str.substring(i + 2), '{', depth + 1);\n          if (!skip.str.trim().length) {\n            throw new SyntaxError('Unexpected end of expression');\n          }\n          currJs.push(skip.str);\n          extract.push('${', currJs.length - 1, `}`);\n          i += skip.length + 2;\n        } else if (quote === char) {\n          if (quote === '`') {\n            const li = createLisp<Literal>({\n              op: LispType.Literal,\n              a: unraw(extract.join('')),\n              b: [],\n            });\n            li.tempJsStrings = currJs;\n            constants.literals.push(li);\n            strRes.push(`\\``, constants.literals.length - 1, `\\``);\n          } else {\n            constants.strings.push(unraw(extract.join('')));\n            strRes.push(`\"`, constants.strings.length - 1, `\"`);\n          }\n          quote = null;\n          extract = [];\n        } else {\n          extract.push(char);\n        }\n      } else {\n        if (char === \"'\" || char === '\"' || char === '`') {\n          currJs = [];\n          quote = char;\n        } else if (closings[currentEnclosure] === char && !enclosures.length) {\n          return { str: strRes.join(''), length: i };\n        } else if (closings[char]) {\n          enclosures.push(char);\n          strRes.push(char);\n        } else if (closings[enclosures[enclosures.length - 1]] === char) {\n          enclosures.pop();\n          strRes.push(char);\n        } else if (char === '/' && (str[i + 1] === '*' || str[i + 1] === '/')) {\n          comment = str[i + 1] === '*' ? '*' : '\\n';\n          commentStart = i;\n        } else if (\n          char === '/' &&\n          !isPossibleDivide &&\n          (regexFound = checkRegex(str.substring(i)))\n        ) {\n          constants.regexes.push(regexFound);\n          strRes.push(`/`, constants.regexes.length - 1, `/r`);\n          i += regexFound.length - 1;\n        } else {\n          strRes.push(char);\n        }\n\n        if (!isPossibleDivide || !space.test(char)) {\n          if ((isPossibleDivide = possibleDivide.exec(str.substring(i)))) {\n            if (notDivide.test(str.substring(0, i + isPossibleDivide[1].length))) {\n              isPossibleDivide = null;\n            }\n          }\n        }\n      }\n      escape = !!(quote && char === '\\\\');\n    }\n  }\n\n  if (quote) {\n    throw new SyntaxError(`Unclosed '${quote}'`);\n  }\n  if (comment) {\n    if (comment === '*') {\n      throw new SyntaxError(`Unclosed comment '/*': ${str.substring(commentStart)}`);\n    }\n  }\n  return { str: strRes.join(''), length: i };\n}\n\nexport default function parse(\n  code: string,\n  eager = false,\n  expression = false,\n  maxParserRecursionDepth = 256,\n): IExecutionTree {\n  if (typeof code !== 'string') throw new ParseError(`Cannot parse ${code}`, String(code));\n  let str = ' ' + code;\n  const constants: IConstants = {\n    strings: [],\n    literals: [],\n    regexes: [],\n    eager,\n    maxDepth: maxParserRecursionDepth,\n  };\n  str = extractConstants(constants, str).str;\n\n  for (const l of constants.literals) {\n    l[2] = l.tempJsStrings!.map((js: string) => lispifyExpr(constants, new CodeString(js)));\n    delete l.tempJsStrings;\n  }\n  return { tree: lispifyFunction(new CodeString(str), constants, expression), constants };\n}\n","import {\n  createAsyncGeneratorFunction,\n  createFunction,\n  createFunctionAsync,\n  createGeneratorFunction,\n} from '../executor';\nimport parse, { lispifyFunction } from '../parser';\nimport type { Lisp } from '../parser';\nimport { getSandboxSymbolCtor, LispType } from '../utils';\nimport type { IExecContext } from '../utils';\n\nexport interface IEvalContext {\n  sandboxFunction: typeof sandboxFunction;\n  sandboxAsyncFunction: typeof sandboxAsyncFunction;\n  sandboxGeneratorFunction: typeof sandboxGeneratorFunction;\n  sandboxAsyncGeneratorFunction: typeof sandboxAsyncGeneratorFunction;\n  sandboxedSymbol: typeof sandboxedSymbol;\n  sandboxedEval: (func: SandboxFunction, context: IExecContext) => SandboxEval;\n  sandboxedSetTimeout: typeof sandboxedSetTimeout;\n  sandboxedSetInterval: typeof sandboxedSetInterval;\n  sandboxedClearTimeout: typeof sandboxedClearTimeout;\n  sandboxedClearInterval: typeof sandboxedClearInterval;\n  lispifyFunction: typeof lispifyFunction;\n}\nexport type SandboxFunction = (code: string, ...args: string[]) => () => unknown;\nexport type SandboxEval = (code: string) => unknown;\nexport type SandboxSetTimeout = (\n  handler: TimerHandler,\n  timeout?: number,\n  ...args: unknown[]\n) => any;\nexport type SandboxSetInterval = (\n  handler: TimerHandler,\n  timeout?: number,\n  ...args: unknown[]\n) => any;\nexport type SandboxClearTimeout = (handle: number) => void;\nexport type SandboxClearInterval = (handle: number) => void;\n\nexport function createEvalContext(): IEvalContext {\n  return {\n    sandboxFunction,\n    sandboxAsyncFunction,\n    sandboxGeneratorFunction,\n    sandboxAsyncGeneratorFunction,\n    sandboxedSymbol,\n    sandboxedEval,\n    sandboxedSetTimeout,\n    sandboxedSetInterval,\n    sandboxedClearTimeout,\n    sandboxedClearInterval,\n    lispifyFunction,\n  };\n}\n\nexport function sandboxedSymbol(context: IExecContext) {\n  return getSandboxSymbolCtor(context.ctx.sandboxSymbols);\n}\n\nfunction SB() {}\nexport function sandboxFunction(context: IExecContext): SandboxFunction {\n  SandboxFunction.prototype = SB.prototype;\n  return SandboxFunction;\n  function SandboxFunction(...params: string[]) {\n    const code = params.pop() || '';\n    const parsed = parse(code, false, false, context.ctx.options.maxParserRecursionDepth);\n    return createFunction(\n      params,\n      parsed.tree,\n      context.ctx.ticks,\n      {\n        ...context,\n        constants: parsed.constants,\n        tree: parsed.tree,\n      },\n      undefined,\n      'anonymous',\n    );\n  }\n}\n\nexport type SandboxAsyncFunction = (code: string, ...args: string[]) => () => Promise<unknown>;\nfunction SAF() {}\nexport function sandboxAsyncFunction(context: IExecContext): SandboxAsyncFunction {\n  SandboxAsyncFunction.prototype = SAF.prototype;\n  return SandboxAsyncFunction;\n  function SandboxAsyncFunction(...params: string[]) {\n    const code = params.pop() || '';\n    const parsed = parse(code, false, false, context.ctx.options.maxParserRecursionDepth);\n    return createFunctionAsync(\n      params,\n      parsed.tree,\n      context.ctx.ticks,\n      {\n        ...context,\n        constants: parsed.constants,\n        tree: parsed.tree,\n      },\n      undefined,\n      'anonymous',\n    );\n  }\n}\n\nexport type SandboxGeneratorFunction = (\n  code: string,\n  ...args: string[]\n) => () => Iterator<unknown> & Iterable<unknown>;\nfunction SGF() {}\nexport function sandboxGeneratorFunction(context: IExecContext): SandboxGeneratorFunction {\n  SandboxGeneratorFunction.prototype = SGF.prototype;\n  return SandboxGeneratorFunction;\n  function SandboxGeneratorFunction(...params: string[]) {\n    const code = params.pop() || '';\n    const parsed = parse(code, false, false, context.ctx.options.maxParserRecursionDepth);\n    return createGeneratorFunction(\n      params,\n      parsed.tree,\n      context.ctx.ticks,\n      {\n        ...context,\n        constants: parsed.constants,\n        tree: parsed.tree,\n      },\n      undefined,\n      'anonymous',\n    );\n  }\n}\n\nexport type SandboxAsyncGeneratorFunction = (\n  code: string,\n  ...args: string[]\n) => () => AsyncGenerator<unknown, unknown, unknown>;\nfunction SAGF() {}\nexport function sandboxAsyncGeneratorFunction(\n  context: IExecContext,\n): SandboxAsyncGeneratorFunction {\n  SandboxAsyncGeneratorFunction.prototype = SAGF.prototype;\n  return SandboxAsyncGeneratorFunction;\n  function SandboxAsyncGeneratorFunction(...params: string[]) {\n    const code = params.pop() || '';\n    const parsed = parse(code, false, false, context.ctx.options.maxParserRecursionDepth);\n    return createAsyncGeneratorFunction(\n      params,\n      parsed.tree,\n      context.ctx.ticks,\n      {\n        ...context,\n        constants: parsed.constants,\n        tree: parsed.tree,\n      },\n      undefined,\n      'anonymous',\n    );\n  }\n}\n\nfunction SE() {}\nexport function sandboxedEval(func: SandboxFunction, context: IExecContext): SandboxEval {\n  sandboxEval.prototype = SE.prototype;\n  return sandboxEval;\n  function sandboxEval(code: string) {\n    // Parse the code and wrap last statement in return for completion value\n    const parsed = parse(code, false, false, context.ctx.options.maxParserRecursionDepth);\n    const tree = wrapLastStatementInReturn(parsed.tree);\n    // Create and execute function with modified tree\n    return createFunction(\n      [],\n      tree,\n      context.ctx.ticks,\n      {\n        ...context,\n        constants: parsed.constants,\n        tree,\n      },\n      undefined,\n      'anonymous',\n    )();\n  }\n}\n\nfunction wrapLastStatementInReturn(tree: Lisp[]): Lisp[] {\n  if (tree.length === 0) return tree;\n  const newTree = [...tree];\n  const lastIndex = newTree.length - 1;\n  const lastStmt = newTree[lastIndex];\n\n  // Only wrap if it's not already a return or throw\n  if (Array.isArray(lastStmt) && lastStmt.length >= 1) {\n    const op = lastStmt[0];\n\n    // Don't wrap Return (8) or Throw (47) - they already control flow\n    if (op === LispType.Return || op === LispType.Throw) {\n      return newTree;\n    }\n\n    // List of statement types that should have undefined completion value\n    // These match JavaScript semantics where declarations and control structures\n    // don't produce a completion value\n    const statementTypes = [\n      LispType.Let, // 3\n      LispType.Const, // 4\n      LispType.Var, // 35\n      LispType.Function, // 38\n      LispType.If, // 14\n      LispType.Loop, // 39\n      LispType.Try, // 40\n      LispType.Switch, // 41\n      LispType.InternalBlock, // 43\n      LispType.Expression, // 44\n    ];\n\n    // If the last statement is a declaration or control structure,\n    // don't wrap it (it will naturally return undefined)\n    if (statementTypes.includes(op)) {\n      return newTree;\n    }\n\n    // For all other types (expressions, operators, etc.),\n    // wrap in return to capture the completion value\n    newTree[lastIndex] = [LispType.Return, LispType.None, lastStmt];\n  }\n\n  return newTree;\n}\n\nfunction sST() {}\nexport function sandboxedSetTimeout(\n  func: SandboxFunction,\n  context: IExecContext,\n): SandboxSetTimeout {\n  sandboxSetTimeout.prototype = sST.prototype;\n  return sandboxSetTimeout;\n  function sandboxSetTimeout(handler: TimerHandler, timeout?: number, ...args: unknown[]) {\n    const sandbox = context.ctx.sandbox;\n    const exec = (...a: any[]) => {\n      const h = typeof handler === 'string' ? func(handler) : handler;\n      haltsub.unsubscribe();\n      contsub.unsubscribe();\n      sandbox.setTimeoutHandles.delete(sandBoxhandle);\n      return h(...a);\n    };\n\n    const sandBoxhandle = ++sandbox.timeoutHandleCounter;\n\n    let start = Date.now();\n    let handle: number = setTimeout(exec, timeout, ...args);\n\n    let elapsed = 0;\n    const haltsub = sandbox.subscribeHalt(() => {\n      elapsed = Date.now() - start + elapsed;\n      clearTimeout(handle);\n    });\n    const contsub = sandbox.subscribeResume(() => {\n      start = Date.now();\n      const remaining = Math.floor((timeout || 0) - elapsed);\n      handle = setTimeout(exec, remaining, ...args);\n      sandbox.setTimeoutHandles.set(sandBoxhandle, {\n        handle,\n        haltsub,\n        contsub,\n      });\n    });\n    sandbox.setTimeoutHandles.set(sandBoxhandle, {\n      handle,\n      haltsub,\n      contsub,\n    });\n    return sandBoxhandle;\n  }\n}\n\nfunction sCT() {}\nexport function sandboxedClearTimeout(context: IExecContext): SandboxClearTimeout {\n  sandboxClearTimeout.prototype = sCT.prototype;\n  return sandboxClearTimeout;\n  function sandboxClearTimeout(handle: number) {\n    const sandbox = context.ctx.sandbox;\n    const timeoutHandle = sandbox.setTimeoutHandles.get(handle);\n    if (timeoutHandle) {\n      clearTimeout(timeoutHandle.handle);\n      timeoutHandle.haltsub.unsubscribe();\n      timeoutHandle.contsub.unsubscribe();\n      sandbox.setTimeoutHandles.delete(handle);\n    }\n  }\n}\nfunction sCI() {}\nexport function sandboxedClearInterval(context: IExecContext): SandboxClearInterval {\n  sandboxClearInterval.prototype = sCI.prototype;\n  return sandboxClearInterval;\n  function sandboxClearInterval(handle: number) {\n    const sandbox = context.ctx.sandbox;\n    const intervalHandle = sandbox.setIntervalHandles.get(handle);\n    if (intervalHandle) {\n      clearInterval(intervalHandle.handle);\n      clearTimeout(intervalHandle.handle);\n      intervalHandle.haltsub.unsubscribe();\n      intervalHandle.contsub.unsubscribe();\n      sandbox.setIntervalHandles.delete(handle);\n    }\n  }\n}\n\nfunction sSI() {}\nexport function sandboxedSetInterval(\n  func: SandboxFunction,\n  context: IExecContext,\n): SandboxSetInterval {\n  sandboxSetInterval.prototype = sSI.prototype;\n  return sandboxSetInterval;\n  function sandboxSetInterval(\n    handler: TimerHandler,\n    timeout: number | undefined,\n    ...args: unknown[]\n  ) {\n    const sandbox = context.ctx.sandbox;\n    const h = typeof handler === 'string' ? func(handler) : handler;\n    const exec = (...a: any[]) => {\n      start = Date.now();\n      elapsed = 0;\n      return h(...a);\n    };\n\n    const sandBoxhandle = ++sandbox.timeoutHandleCounter;\n\n    let start = Date.now();\n    let handle: number = setInterval(exec, timeout, ...args);\n\n    let elapsed = 0;\n    const haltsub = sandbox.subscribeHalt(() => {\n      elapsed = Date.now() - start + elapsed;\n      clearInterval(handle);\n      clearTimeout(handle);\n    });\n    const contsub = sandbox.subscribeResume(() => {\n      start = Date.now();\n      handle = setTimeout(\n        () => {\n          start = Date.now();\n          elapsed = 0;\n          handle = setInterval(exec, timeout, ...args);\n          handlObj.handle = handle;\n          exec(...args);\n        },\n        Math.floor((timeout || 0) - elapsed),\n        ...args,\n      );\n      handlObj.handle = handle;\n    });\n\n    const handlObj = {\n      handle,\n      haltsub,\n      contsub,\n    };\n    sandbox.setIntervalHandles.set(sandBoxhandle, handlObj);\n    return sandBoxhandle;\n  }\n}\n","import type { IEvalContext } from './eval';\nimport { Change, ExecReturn, executeTree, executeTreeAsync } from './executor';\nimport { createContext, SandboxExecutionQuotaExceededError } from './utils';\nimport type {\n  IContext,\n  IExecContext,\n  IGlobals,\n  IOptionParams,\n  IOptions,\n  IScope,\n  ISymbolWhitelist,\n  SubscriptionSubject,\n  HaltContext,\n} from './utils';\n\nfunction subscribeSet(\n  obj: object,\n  name: string,\n  callback: (modification: Change) => void,\n  context: {\n    setSubscriptions: WeakMap<\n      SubscriptionSubject,\n      Map<string, Set<(modification: Change) => void>>\n    >;\n    changeSubscriptions: WeakMap<SubscriptionSubject, Set<(modification: Change) => void>>;\n  },\n): { unsubscribe: () => void } {\n  const names =\n    context.setSubscriptions.get(obj) || new Map<string, Set<(modification: Change) => void>>();\n  context.setSubscriptions.set(obj, names);\n  const callbacks = names.get(name) || new Set();\n  names.set(name, callbacks);\n  callbacks.add(callback);\n  let changeCbs: Set<(modification: Change) => void>;\n  const val = (obj as any)[name] as unknown;\n  if (val instanceof Object) {\n    changeCbs = context.changeSubscriptions.get(val) || new Set();\n    changeCbs.add(callback);\n    context.changeSubscriptions.set(val, changeCbs);\n  }\n  return {\n    unsubscribe: () => {\n      callbacks.delete(callback);\n      changeCbs?.delete(callback);\n    },\n  };\n}\n\nexport class SandboxExec {\n  public readonly context: IContext;\n  public readonly setSubscriptions: WeakMap<\n    SubscriptionSubject,\n    Map<string, Set<(modification: Change) => void>>\n  > = new WeakMap();\n  public readonly changeSubscriptions: WeakMap<\n    SubscriptionSubject,\n    Set<(modification: Change) => void>\n  > = new WeakMap();\n  public readonly sandboxFunctions: WeakMap<Function, IExecContext> = new WeakMap();\n  private haltSubscriptions: Set<(context: HaltContext) => void> = new Set();\n  private resumeSubscriptions: Set<() => void> = new Set();\n  public halted = false;\n  timeoutHandleCounter = 0;\n  public readonly setTimeoutHandles = new Map<\n    number,\n    {\n      handle: number;\n      haltsub: { unsubscribe: () => void };\n      contsub: { unsubscribe: () => void };\n    }\n  >();\n  public readonly setIntervalHandles = new Map<\n    number,\n    {\n      handle: number;\n      haltsub: { unsubscribe: () => void };\n      contsub: { unsubscribe: () => void };\n    }\n  >();\n  constructor(\n    options?: IOptionParams,\n    public evalContext?: IEvalContext,\n  ) {\n    const opt: IOptions = Object.assign(\n      {\n        audit: false,\n        forbidFunctionCalls: false,\n        forbidFunctionCreation: false,\n        globals: SandboxExec.SAFE_GLOBALS,\n        symbolWhitelist: SandboxExec.SAFE_SYMBOLS,\n        prototypeWhitelist: SandboxExec.SAFE_PROTOTYPES,\n        maxParserRecursionDepth: 256,\n        nonBlocking: false,\n        functionReplacements: new Map<\n          Function,\n          (ctx: IExecContext, builtInReplacement?: Function) => Function\n        >(),\n      },\n      options || {},\n    );\n    this.context = createContext(this, opt);\n  }\n\n  static get SAFE_GLOBALS(): IGlobals {\n    return {\n      globalThis,\n      Function,\n      eval,\n      console: {\n        debug: console.debug,\n        error: console.error,\n        info: console.info,\n        log: console.log,\n        table: console.table,\n        warn: console.warn,\n      },\n      isFinite,\n      isNaN,\n      parseFloat,\n      parseInt,\n      decodeURI,\n      decodeURIComponent,\n      encodeURI,\n      encodeURIComponent,\n      escape,\n      unescape,\n      Boolean,\n      Number,\n      BigInt,\n      String,\n      Object,\n      Array,\n      Symbol,\n      Error,\n      EvalError,\n      RangeError,\n      ReferenceError,\n      SyntaxError,\n      TypeError,\n      URIError,\n      Int8Array,\n      Uint8Array,\n      Uint8ClampedArray,\n      Int16Array,\n      Uint16Array,\n      Int32Array,\n      Uint32Array,\n      Float32Array,\n      Float64Array,\n      Map,\n      Set,\n      WeakMap,\n      WeakSet,\n      Promise,\n      Intl,\n      JSON,\n      Math,\n      Date,\n      RegExp,\n    };\n  }\n\n  static get SAFE_SYMBOLS(): ISymbolWhitelist {\n    const safeSymbols: ISymbolWhitelist = {};\n    for (const key of [\n      'asyncIterator',\n      'iterator',\n      'match',\n      'matchAll',\n      'replace',\n      'search',\n      'split',\n    ]) {\n      const value = (Symbol as unknown as Record<string, symbol | undefined>)[key];\n      if (typeof value === 'symbol') {\n        safeSymbols[key] = value;\n      }\n    }\n    return safeSymbols;\n  }\n\n  static get SAFE_PROTOTYPES(): Map<any, Set<string>> {\n    const protos = [\n      Function,\n      Boolean,\n      Number,\n      BigInt,\n      String,\n      Date,\n      Error,\n      Array,\n      Int8Array,\n      Uint8Array,\n      Uint8ClampedArray,\n      Int16Array,\n      Uint16Array,\n      Int32Array,\n      Uint32Array,\n      Float32Array,\n      Float64Array,\n      Map,\n      Set,\n      WeakMap,\n      WeakSet,\n      Promise,\n      Symbol,\n      Date,\n      RegExp,\n      // Fetch API\n      Response,\n      Request,\n      Headers,\n      FormData,\n    ];\n    const map = new Map<any, Set<string>>();\n    protos.forEach((proto) => {\n      map.set(proto, new Set());\n    });\n    map.set(\n      Object,\n      new Set([\n        'constructor',\n        'name',\n        'entries',\n        'fromEntries',\n        'getOwnPropertyNames',\n        'is',\n        'keys',\n        'hasOwnProperty',\n        'isPrototypeOf',\n        'propertyIsEnumerable',\n        'toLocaleString',\n        'toString',\n        'valueOf',\n        'values',\n      ]),\n    );\n    return map;\n  }\n\n  subscribeGet(\n    callback: (obj: SubscriptionSubject, name: string) => void,\n    context: IExecContext,\n  ): { unsubscribe: () => void } {\n    context.getSubscriptions.add(callback);\n    return { unsubscribe: () => context.getSubscriptions.delete(callback) };\n  }\n\n  subscribeSet(\n    obj: object,\n    name: string,\n    callback: (modification: Change) => void,\n    context: SandboxExec | IExecContext,\n  ): { unsubscribe: () => void } {\n    return subscribeSet(obj, name, callback, context);\n  }\n\n  subscribeSetGlobal(\n    obj: SubscriptionSubject,\n    name: string,\n    callback: (modification: Change) => void,\n  ): { unsubscribe: () => void } {\n    return subscribeSet(obj, name, callback, this);\n  }\n\n  subscribeHalt(cb: (context: HaltContext) => void) {\n    this.haltSubscriptions.add(cb);\n    return {\n      unsubscribe: () => {\n        this.haltSubscriptions.delete(cb);\n      },\n    };\n  }\n  subscribeResume(cb: () => void) {\n    this.resumeSubscriptions.add(cb);\n    return {\n      unsubscribe: () => {\n        this.resumeSubscriptions.delete(cb);\n      },\n    };\n  }\n\n  haltExecution(haltContext: HaltContext = { type: 'manual' }) {\n    if (this.halted) return;\n    this.halted = true;\n    for (const cb of this.haltSubscriptions) {\n      cb(haltContext);\n    }\n  }\n\n  resumeExecution() {\n    if (!this.halted) return;\n    if (\n      this.context.ticks.tickLimit !== undefined &&\n      this.context.ticks.ticks >= this.context.ticks.tickLimit\n    ) {\n      throw new SandboxExecutionQuotaExceededError('Cannot resume execution: tick limit exceeded');\n    }\n    this.halted = false;\n    for (const cb of this.resumeSubscriptions) {\n      cb();\n    }\n  }\n\n  getContext(fn: (...args: any[]) => any) {\n    return this.sandboxFunctions.get(fn);\n  }\n\n  executeTree<T>(context: IExecContext, scopes: IScope[] = []): ExecReturn<T> {\n    return executeTree(context.ctx.ticks, context, context.tree, scopes, undefined, false);\n  }\n\n  executeTreeAsync<T>(context: IExecContext, scopes: IScope[] = []): Promise<ExecReturn<T>> {\n    return executeTreeAsync(context.ctx.ticks, context, context.tree, scopes, undefined, false);\n  }\n}\n\nexport default SandboxExec;\n","import { AsyncFunction, createExecContext, SandboxCapabilityError, sanitizeScopes } from './utils';\nimport type { IExecContext, IOptionParams, IScope } from './utils';\nimport { createEvalContext } from './eval';\nimport { ExecReturn } from './executor';\nimport parse from './parser';\nimport SandboxExec from './SandboxExec';\nexport { ParseError } from './parser';\nexport {\n  LocalScope,\n  SandboxExecutionTreeError,\n  SandboxCapabilityError,\n  SandboxAccessError,\n  SandboxExecutionQuotaExceededError,\n  SandboxError,\n  delaySynchronousResult,\n} from './utils';\n\nexport type * from './utils';\nexport type * from './parser';\nexport type * from './executor';\nexport type * from './eval';\n\nexport class Sandbox extends SandboxExec {\n  constructor(options?: IOptionParams) {\n    super(options, createEvalContext());\n  }\n\n  static audit<T>(code: string, scopes: IScope[] = []): ExecReturn<T> {\n    const globals: Record<string, unknown> = {};\n    for (const i of Object.getOwnPropertyNames(globalThis) as [keyof typeof globalThis]) {\n      globals[i] = globalThis[i];\n    }\n    const sandbox = new SandboxExec({\n      globals,\n      audit: true,\n    });\n    return sandbox.executeTree(\n      createExecContext(\n        sandbox,\n        parse(code, true, false, sandbox.context.options.maxParserRecursionDepth),\n        createEvalContext(),\n      ),\n      scopes,\n    );\n  }\n\n  static parse(code: string) {\n    return parse(code, true);\n  }\n\n  get Function() {\n    const context = createExecContext(\n      this,\n      {\n        tree: [],\n        constants: {\n          strings: [],\n          eager: true,\n          literals: [],\n          maxDepth: this.context.options.maxParserRecursionDepth,\n          regexes: [],\n        },\n      },\n      this.evalContext,\n    );\n    return context.evals.get(Function)!;\n  }\n\n  get AsyncFunction() {\n    const context = createExecContext(\n      this,\n      {\n        tree: [],\n        constants: {\n          strings: [],\n          eager: true,\n          literals: [],\n          maxDepth: this.context.options.maxParserRecursionDepth,\n          regexes: [],\n        },\n      },\n      this.evalContext,\n    );\n    return context.evals.get(AsyncFunction)!;\n  }\n\n  get eval() {\n    const context = createExecContext(\n      this,\n      {\n        tree: [],\n        constants: {\n          strings: [],\n          eager: true,\n          literals: [],\n          maxDepth: this.context.options.maxParserRecursionDepth,\n          regexes: [],\n        },\n      },\n      this.evalContext,\n    );\n    return context.evals.get(eval)!;\n  }\n\n  compile<T>(\n    code: string,\n    optimize = false,\n  ): (...scopes: IScope[]) => { context: IExecContext; run: () => T } {\n    if (this.context.options.nonBlocking)\n      throw new SandboxCapabilityError(\n        'Non-blocking mode is enabled, use Sandbox.compileAsync() instead.',\n      );\n    const parsed = parse(code, optimize, false, this.context.options.maxParserRecursionDepth);\n    const context = createExecContext(this, parsed, this.evalContext);\n    const exec = (...scopes: IScope[]) => {\n      sanitizeScopes(scopes, context);\n      return { context, run: () => this.executeTree<T>(context, [...scopes]).result };\n    };\n    return exec;\n  }\n\n  compileAsync<T>(\n    code: string,\n    optimize = false,\n  ): (...scopes: IScope[]) => { context: IExecContext; run: () => Promise<T> } {\n    const parsed = parse(code, optimize, false, this.context.options.maxParserRecursionDepth);\n    const context = createExecContext(this, parsed, this.evalContext);\n    const exec = (...scopes: IScope[]) => {\n      sanitizeScopes(scopes, context);\n      return {\n        context,\n        run: () => this.executeTreeAsync<T>(context, [...scopes]).then((ret) => ret.result),\n      };\n    };\n    return exec;\n  }\n\n  compileExpression<T>(\n    code: string,\n    optimize = false,\n  ): (...scopes: IScope[]) => { context: IExecContext; run: () => T } {\n    const parsed = parse(code, optimize, true, this.context.options.maxParserRecursionDepth);\n    const context = createExecContext(this, parsed, this.evalContext);\n    const exec = (...scopes: IScope[]) => {\n      sanitizeScopes(scopes, context);\n      return { context, run: () => this.executeTree<T>(context, [...scopes]).result };\n    };\n    return exec;\n  }\n\n  compileExpressionAsync<T>(\n    code: string,\n    optimize = false,\n  ): (...scopes: IScope[]) => { context: IExecContext; run: () => Promise<T> } {\n    const parsed = parse(code, optimize, true, this.context.options.maxParserRecursionDepth);\n    const context = createExecContext(this, parsed, this.evalContext);\n    const exec = (...scopes: IScope[]) => {\n      return {\n        context,\n        run: () => this.executeTreeAsync<T>(context, [...scopes]).then((ret) => ret.result),\n      };\n    };\n    return exec;\n  }\n}\n\nexport default Sandbox;\n"],"mappings":"uOAQA,SAAS,cAAc,GAErB,OADwB,EAAI,MAAM,cACU,IAApB,SAAS,EAAK,IAcxC,SAAS,oBAAoB,EAAa,EAAmB,GAC3D,MAAM,EAAY,cAAc,GAChC,GAAI,OAAO,MAAM,SAAkC,IAAnB,GAAgC,IAAmB,EAAI,OACrF,MAAM,IAAI,YAAY,EAAY,KAAO,GAE3C,OAAO,EAWT,SAAS,qBAAqB,GAC5B,MAAM,EAAa,oBAAoB,EAAM,wBAAyB,GACtE,OAAO,OAAO,aAAa,GAa7B,SAAS,iBAAiB,EAAc,GACtC,MAAM,EAAa,oBAAoB,EAAM,oBAAqB,GAElE,QAAsB,IAAlB,EAA6B,CAC/B,MAAM,EAAsB,oBAAoB,EAAe,oBAAqB,GACpF,OAAO,OAAO,aAAa,EAAY,GAGzC,OAAO,OAAO,aAAa,GAQ7B,SAAS,cAAc,GACrB,MAA0B,MAAnB,EAAK,OAAO,IAA+C,MAAjC,EAAK,OAAO,EAAK,OAAS,GAW7D,SAAS,0BAA0B,GACjC,IAAK,cAAc,GACjB,MAAM,IAAI,YAAY,uBAAyB,GAGjD,MAAM,EAAa,oBADG,EAAU,MAAM,GAAG,GACa,qBAEtD,IACE,OAAO,OAAO,cAAc,SACrB,GACP,MAAM,aAAe,WAAa,IAAI,YAAY,oBAAsB,GAAc,kGAQ1F,IAAM,uBAAyB,IAAI,IAAoB,CACrD,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,QAQR,SAAS,yBAAyB,GAChC,OAAO,uBAAuB,IAAI,IAAS,EAmB7C,IAAM,YACJ,yHAWF,SAAgB,MAAM,GACpB,OAAO,EAAI,QACT,YACA,SACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAIA,QAAkB,IAAd,EACF,MAAO,KAET,QAAY,IAAR,EACF,OAAO,qBAAqB,GAE9B,QAAkB,IAAd,EACF,OAAO,0BAA0B,GAEnC,QAA6B,IAAzB,EACF,OAAO,iBAAiB,EAAsB,GAEhD,QAAgB,IAAZ,EACF,OAAO,iBAAiB,GAE1B,GAAc,MAAV,EACF,MAAO,KAET,QAAc,IAAV,EACF,MAAM,IAAI,YAAY,sBAAwB,GAEhD,QAAwB,IAApB,EACF,OAAO,yBAAyB,GAElC,MAAM,IAAI,YAAY,mBC1L5B,IAAa,aAAb,cAAkC,QAErB,mCAAb,cAAwD,eAE3C,0BAAb,cAA+C,eAElC,uBAAb,cAA4C,eAE/B,mBAAb,cAAwC,eCV3B,WAAb,MAAa,EAIX,WAAA,CAAY,GACV,KAAK,IAAM,CAAE,IAAK,IACd,aAAe,GACjB,KAAK,IAAM,EAAI,IACf,KAAK,MAAQ,EAAI,MACjB,KAAK,IAAM,EAAI,MAEf,KAAK,IAAI,IAAM,EACf,KAAK,MAAQ,EACb,KAAK,IAAM,EAAI,QAInB,SAAA,CAAU,EAAe,GACvB,IAAK,KAAK,OAAQ,OAAO,MACzB,EAAQ,KAAK,MAAQ,GACT,IACV,EAAQ,GAEN,EAAQ,KAAK,MACf,EAAQ,KAAK,MAEf,OAAc,IAAR,EAAoB,KAAK,IAAM,KAAK,MAAQ,GACxC,IACR,EAAM,GAEJ,EAAM,KAAK,MACb,EAAM,KAAK,KAEb,MAAM,EAAO,IAAI,EAAW,MAG5B,OAFA,EAAK,MAAQ,EACb,EAAK,IAAM,EACJ,EAGT,UAAI,GACF,MAAM,EAAM,KAAK,IAAM,KAAK,MAC5B,OAAO,EAAM,EAAI,EAAI,EAGvB,IAAA,CAAK,GACH,GAAI,KAAK,QAAU,KAAK,IACxB,OAAO,KAAK,IAAI,IAAI,KAAK,MAAQ,GAGnC,QAAA,GACE,OAAO,KAAK,IAAI,IAAI,UAAU,KAAK,MAAO,KAAK,KAGjD,SAAA,GACE,MAAM,EAAQ,OAAO,KAAK,KAAK,YACzB,EAAO,IAAI,EAAW,MAI5B,OAHI,IACF,EAAK,OAAS,EAAM,GAAG,QAElB,EAGT,KAAA,CAAM,EAAe,GAiBnB,OAhBI,EAAQ,IACV,EAAQ,KAAK,IAAM,KAAK,MAAQ,GAE9B,EAAQ,IACV,EAAQ,QAEE,IAAR,IACF,EAAM,KAAK,IAAM,KAAK,OAGpB,EAAM,IACR,EAAM,KAAK,IAAM,KAAK,MAAQ,GAE5B,EAAM,IACR,EAAM,GAED,KAAK,UAAU,EAAO,GAG/B,IAAA,GACE,MAAM,EAAO,KAAK,YACZ,EAAQ,OAAO,KAAK,EAAK,YAI/B,OAHI,IACF,EAAK,KAAO,EAAM,GAAG,QAEhB,EAGT,OAAA,GACE,OAAO,KAAK,aC3FH,cAA0B,OAAO,eAAe,iBAAkB,GAAI,YACtE,kBAA8B,OAAO,eAAe,YAAa,GAAI,YACrE,uBAAmC,OAAO,eACrD,kBAAmB,GACnB,YAmIW,uBAAyB,OAEzB,cAAgB,IAAI,IAAI,CACnC,QACA,QACA,OACA,QACA,QACA,QACA,WACA,WACA,UACA,SACA,KACA,OACA,OACA,SACA,UACA,QACA,UACA,MACA,WACA,KACA,aACA,SACA,KACA,aACA,MACA,MACA,OACA,SACA,QACA,SACA,OACA,QACA,OACA,MACA,SACA,MACA,OACA,QACA,SAGgB,QAAX,SAAA,UACL,EAAA,IAAA,MACA,EAAA,MAAA,QACA,EAAA,IAAA,MACA,EAAA,SAAA,aAJK,KAOW,SAAX,SAAA,UACL,EAAA,EAAA,KAAA,GAAA,OACA,EAAA,EAAA,KAAA,GAAA,OACA,EAAA,EAAA,YAAA,GAAA,cACA,EAAA,EAAA,IAAA,GAAA,MACA,EAAA,EAAA,MAAA,GAAA,QACA,EAAA,EAAA,KAAA,GAAA,OACA,EAAA,EAAA,OAAA,GAAA,SACA,EAAA,EAAA,OAAA,GAAA,SACA,EAAA,EAAA,OAAA,GAAA,SACA,EAAA,EAAA,OAAA,GAAA,SACA,EAAA,EAAA,eAAA,IAAA,iBACA,EAAA,EAAA,cAAA,IAAA,gBACA,EAAA,EAAA,YAAA,IAAA,cACA,EAAA,EAAA,GAAA,IAAA,KACA,EAAA,EAAA,OAAA,IAAA,SACA,EAAA,EAAA,SAAA,IAAA,WACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,YAAA,IAAA,cACA,EAAA,EAAA,UAAA,IAAA,YACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,IAAA,IAAA,MACA,EAAA,EAAA,gBAAA,IAAA,kBACA,EAAA,EAAA,eAAA,IAAA,iBACA,EAAA,EAAA,gBAAA,IAAA,kBACA,EAAA,EAAA,eAAA,IAAA,iBACA,EAAA,EAAA,IAAA,IAAA,MACA,EAAA,EAAA,GAAA,IAAA,KACA,EAAA,EAAA,eAAA,IAAA,iBACA,EAAA,EAAA,YAAA,IAAA,cACA,EAAA,EAAA,KAAA,IAAA,OACA,EAAA,EAAA,IAAA,IAAA,MACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,QAAA,IAAA,UACA,EAAA,EAAA,SAAA,IAAA,WACA,EAAA,EAAA,KAAA,IAAA,OACA,EAAA,EAAA,IAAA,IAAA,MACA,EAAA,EAAA,OAAA,IAAA,SACA,EAAA,EAAA,WAAA,IAAA,aACA,EAAA,EAAA,cAAA,IAAA,gBACA,EAAA,EAAA,WAAA,IAAA,aACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,IAAA,IAAA,MACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,OAAA,IAAA,SACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,SAAA,IAAA,WACA,EAAA,EAAA,QAAA,IAAA,UACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,SAAA,IAAA,WACA,EAAA,EAAA,iBAAA,IAAA,mBACA,EAAA,EAAA,gBAAA,IAAA,kBACA,EAAA,EAAA,YAAA,IAAA,cACA,EAAA,EAAA,WAAA,IAAA,aACA,EAAA,EAAA,SAAA,IAAA,WACA,EAAA,EAAA,SAAA,IAAA,WACA,EAAA,EAAA,OAAA,IAAA,SACA,EAAA,EAAA,OAAA,IAAA,SACA,EAAA,EAAA,WAAA,IAAA,aACA,EAAA,EAAA,GAAA,IAAA,KACA,EAAA,EAAA,QAAA,IAAA,UACA,EAAA,EAAA,cAAA,IAAA,gBACA,EAAA,EAAA,UAAA,IAAA,YACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,YAAA,IAAA,cACA,EAAA,EAAA,eAAA,IAAA,iBACA,EAAA,EAAA,cAAA,IAAA,gBACA,EAAA,EAAA,gBAAA,IAAA,kBACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,YAAA,IAAA,cACA,EAAA,EAAA,yBAAA,IAAA,2BACA,EAAA,EAAA,iBAAA,IAAA,mBACA,EAAA,EAAA,gBAAA,IAAA,kBACA,EAAA,EAAA,OAAA,IAAA,SACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,UAAA,IAAA,YACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,cAAA,IAAA,gBACA,EAAA,EAAA,sBAAA,IAAA,wBACA,EAAA,EAAA,OAAA,IAAA,SACA,EAAA,EAAA,aAAA,IAAA,eACA,EAAA,EAAA,WAAA,IAAA,aACA,EAAA,EAAA,WAAA,IAAA,aACA,EAAA,EAAA,KAAA,IAAA,OACA,EAAA,EAAA,KAAA,IAAA,OACA,EAAA,EAAA,kBAAA,IAAA,oBACA,EAAA,EAAA,UAAA,IAAA,YACA,EAAA,EAAA,SAAA,IAAA,WACA,EAAA,EAAA,wBAAA,IAAA,0BACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,QAAA,IAAA,UACA,EAAA,EAAA,SAAA,IAAA,WACA,EAAA,EAAA,MAAA,IAAA,QACA,EAAA,EAAA,cAAA,IAAA,gBACA,EAAA,EAAA,KAAA,IAAA,OAEA,EAAA,EAAA,aAAA,IAAA,iBArGK,KCpLP,SAAgB,mBAAmB,EAAmB,GACpD,MAAM,MAAE,GAAU,EAAI,IACtB,QAAwB,IAApB,EAAM,WAA2B,EAAM,WAAa,EAAM,MAAQ,EACpE,MAAM,IAAI,mCAAmC,4BAE/C,EAAM,OAAS,EAOjB,IAAM,iBAAmB,CACvB,UACA,WACA,kBACA,WACA,YACA,WACA,YACA,aACA,cAEW,iBAAmB,IAAI,IAClC,iBAAiB,IAAK,GAAM,OAAO,eAAe,EAAE,aAGtD,SAAS,aAAa,GACpB,OACE,YAAY,OAAO,MACjB,aAAe,WACjB,iBAAiB,IAAI,OAAO,eAAe,OAAO,eAAe,KAUrE,SAAS,gBACP,EACA,GAEA,OAAQ,GACN,YAA4B,GAE1B,OADA,mBAAmB,EAAK,EAAS,KAAM,IAC/B,EAAiB,MAAM,KAAM,IAQ3C,IAAM,IAAa,GACb,SAAW,MAAM,UAEvB,SAAS,WACP,EACA,GAEA,MAAA,CAAQ,EAAS,KACf,IAAK,MAAM,QAAQ,GAAU,OAAO,GACpC,MAAM,EAAI,OAAO,EAAQ,QACzB,OAAQ,GACN,IAAK,MACH,OAAO,GACT,IAAK,IACH,OAAO,EACT,IAAK,QACH,OAAO,EAAQ,QAAU,EAAI,GAAK,EAAI,OAAO,KAAK,MAAM,KAAK,KAAK,EAAQ,UAC5E,IAAK,OAAQ,CACX,IAAI,EAAQ,GACZ,MAAM,EAAW,IAAa,IAAI,MAA2B,iBAAZ,EAAK,GAAkB,EAAK,GAAU,EACjF,EAAA,CAAW,EAAc,EAAQ,KAErC,GADA,GAAS,OAAO,EAAE,UACd,GAAS,GACb,IAAK,MAAM,KAAQ,EACb,MAAM,QAAQ,IAAO,EAAQ,EAAM,EAAQ,IAInD,OADA,EAAQ,GACD,KAMf,IAAM,qBAAqE,CAEzE,CAAC,IAAI,KAAM,OACX,CAAC,IAAI,IAAK,OACV,CAAC,SAAS,GAAI,OAEd,CAAC,IAAI,KAAM,KACX,CAAC,IAAI,SAAU,KACf,CAAC,IAAI,QAAS,KACd,CAAC,IAAI,YAAa,KAClB,CAAC,IAAI,KAAM,KACX,CAAC,IAAI,UAAW,KAChB,CAAC,SAAS,SAAU,KACpB,CAAC,SAAS,cAAe,KACzB,CAAC,IAAI,QAAS,KACd,CAAC,IAAI,IAAK,KACV,CAAC,IAAI,OAAQ,KACb,CAAC,IAAI,OAAQ,KACb,CAAC,IAAI,YAAa,KAClB,CAAC,IAAI,MAAO,KACZ,CAAC,IAAI,KAAM,KACX,CAAC,IAAI,KAAM,KACX,CAAC,IAAI,QAAS,KACd,CAAC,IAAI,MAAO,KACZ,CAAC,IAAI,QAAS,KACd,CAAC,IAAI,OAAQ,KACb,CAAC,IAAI,MAAO,KACZ,CAAC,IAAI,WAAY,KACjB,CAAC,IAAI,QAAS,KACd,CAAC,IAAI,KAAM,KACX,CAAC,IAAI,OAAQ,KACb,CAAC,SAAS,WAAY,KACtB,CAAC,SAAS,UAAW,KACrB,CAAC,SAAS,KAAM,KAChB,CAAC,IAAI,SAAU,KACf,CAAC,IAAI,eAAgB,KAErB,CAAC,IAAI,KAAM,SACX,CAAC,SAAS,SAAU,SAEpB,CAAC,IAAI,KAAM,QACX,CAAC,IAAI,QAAS,QACd,CAAC,IAAI,OAAQ,SAOT,IAAM,GACN,SAAW,OAAO,UAExB,SAAS,YAAY,GACnB,OAAQ,GACiB,iBAAZ,EAA6B,GAClB,QAAf,EAAuB,GAAK,OAAO,EAAQ,QAItD,IAAM,sBAAmD,CAEvD,CAAC,IAAI,OAAQ,OACb,CAAC,IAAI,WAAY,OACjB,CAAC,IAAI,YAAa,OAClB,CAAC,SAAS,GAAI,OAEd,CAAC,IAAI,QAAS,KACd,CAAC,IAAI,YAAa,KAClB,CAAC,IAAI,SAAU,KACf,CAAC,IAAI,WAAY,KACjB,CAAC,IAAI,SAAU,KACf,CAAC,IAAI,MAAO,KACZ,CAAC,IAAI,UAAW,KAChB,CAAC,IAAI,SAAU,KACf,CAAC,IAAI,OAAQ,KACb,CAAC,IAAI,OAAQ,KACb,CAAC,IAAI,MAAO,KACZ,CAAC,IAAI,QAAS,KACd,CAAC,SAAS,WAAY,KACtB,CAAC,IAAI,MAAO,KACZ,CAAC,IAAI,SAAU,KACf,CAAC,IAAI,OAAQ,KACb,CAAC,IAAI,KAAM,KACX,CAAC,IAAI,UAAW,KAChB,CAAC,IAAI,QAAS,KACd,CAAC,IAAI,YAAa,KAClB,CAAC,IAAI,YAAa,KAClB,CAAC,IAAI,kBAAmB,KACxB,CAAC,IAAI,kBAAmB,KACxB,CAAC,IAAI,UAAW,KAChB,CAAC,IAAI,OAAQ,KACb,CAAC,IAAI,SAAU,KACf,CAAC,IAAI,QAAS,MAOV,KAAO,IAAI,IAEX,mBAAgD,CACpD,CAAC,KAAK,IAAK,OACX,CAAC,KAAK,IAAK,OACX,CAAC,KAAK,IAAK,OACX,CAAC,KAAK,OAAQ,OACd,CAAC,KAAK,KAAM,KACZ,CAAC,KAAK,OAAQ,KACd,CAAC,KAAK,QAAS,KACf,CAAC,KAAK,QAAS,KACf,CAAC,KAAK,MAAO,MAGf,SAAS,SAAS,GAChB,OAAQ,GACA,aAAmB,IACH,QAAf,EAAuB,GAAK,OAAO,EAAQ,MADZ,GAS1C,IAAM,KAAO,IAAI,IAEX,mBAAgD,CACpD,CAAC,KAAK,IAAK,OACX,CAAC,KAAK,IAAK,OACX,CAAC,KAAK,OAAQ,OACd,CAAC,KAAK,OAAQ,KACd,CAAC,KAAK,KAAM,KACZ,CAAC,KAAK,QAAS,KACf,CAAC,KAAK,QAAS,KACf,CAAC,KAAK,MAAO,MAGf,SAAS,SAAS,GAChB,OAAQ,GACA,aAAmB,IACH,QAAf,EAAuB,GAAK,OAAO,EAAQ,MADZ,GAS1C,IAAM,0BAAiE,GACvE,IAAK,MAAM,KAAS,iBAAkB,CAChC,EAAM,IAAI,0BAA0B,KAAK,CAAC,EAAM,GAAI,QACpD,EAAM,KAAK,0BAA0B,KAAK,CAAC,EAAM,IAAK,QA8B1D,IAAK,MAAM,IA7BM,CACf,OACA,OACA,YACA,WACA,gBACA,WACA,UACA,cACA,UACA,MACA,SACA,SACA,cACA,QACA,OACA,OACA,UACA,QACA,WACA,aACA,UACA,OACA,SACA,aACA,OACA,WACA,kBAGI,EAAM,IAAI,0BAA0B,KAAK,CAAC,EAAM,GAAI,MAEtD,EAAM,MAAM,0BAA0B,KAAK,CAAC,EAAM,KAAM,UACxD,EAAM,UAAU,0BAA0B,KAAK,CAAC,EAAM,SAAU,UAGtE,SAAS,gBACP,GAEA,OAAQ,IACN,IAAK,aAAa,GAAU,OAAO,GACnC,MAAM,EAAI,OAAO,EAAQ,QACzB,OAAQ,GACN,IAAK,MACH,OAAO,GACT,IAAK,IACH,OAAO,EACT,IAAK,QACH,OAAQ,EAAgB,QAAU,EAC9B,GACA,EAAI,OAAO,KAAK,MAAM,KAAK,KAAM,EAAgB,YAS7D,IAAM,oBAAoC,CAAC,CAAC,KAAK,KAAM,CAAC,KAAK,KAAM,CAAC,KAAK,QAYnE,IAAM,IAEN,sBAAoC,CACxC,IAAI,KACJ,IAAI,KACH,IAAY,OAAO,OACnB,IAAY,OAAO,UACnB,IAAY,OAAO,SACnB,IAAY,OAAO,QACnB,IAAY,OAAO,QAOhB,uBAAqC,CACzC,QAAQ,IACR,QAAQ,WACR,QAAQ,QAC4B,mBAAxB,QAAgB,IAAqB,CAAE,QAAgB,KAAO,IAOtE,sBAAmD,CACvD,CAAC,OAAO,UAAU,eAAgB,OAClC,CAAC,OAAO,UAAU,qBAAsB,OACxC,CAAC,OAAO,UAAU,cAAe,OACjC,CAAC,OAAO,OAAQ,OAChB,CAAC,OAAO,eAAgB,OACxB,CAAC,OAAO,eAAgB,OACxB,CAAC,OAAO,GAAI,OACZ,CAAC,OAAO,eAAgB,OACxB,CAAC,OAAO,yBAA0B,OAClC,CAAC,OAAO,aAAc,OACtB,CAAC,OAAO,kBAAmB,OAC3B,CAAC,OAAO,KAAM,KACd,CAAC,OAAO,OAAQ,KAChB,CAAC,OAAO,QAAS,KACjB,CAAC,OAAO,OAAQ,KAChB,CAAC,OAAO,YAAa,KACrB,CAAC,OAAO,oBAAqB,KAC7B,CAAC,OAAO,sBAAuB,KAC/B,CAAC,OAAO,0BAA2B,KACnC,CAAC,OAAO,OAAQ,KAChB,CAAC,OAAO,KAAM,KACd,CAAC,OAAO,SAAU,KAClB,CAAC,OAAO,SAAU,MAGpB,SAAS,YACP,EACA,GAEA,MAAA,CAAQ,EAAS,KACf,GAAmB,QAAf,EAAsB,OAAO,GACjC,MAAM,EAAS,EAAW,EAAK,GAAK,EACpC,OAAe,OAAX,GAAqC,iBAAX,EACrB,OAAO,OAAO,KAAK,GAAkB,QACvC,IAKX,IAAM,oBAAsB,IAAI,IAAc,CAC5C,OAAO,KACP,OAAO,OACP,OAAO,QACP,OAAO,OACP,OAAO,YACP,OAAO,oBACP,OAAO,sBACP,OAAO,0BACP,OAAO,OACP,OAAO,KACP,OAAO,SACP,OAAO,WAWI,8BAAgC,IAAI,IACpC,qCAAuC,IAAI,IAGxD,IAAK,MAAO,EAAU,KAAe,qBAC9B,IACL,8BAA8B,IAC5B,EACA,gBAAgB,EAAU,WAAW,EAAY,KAEnD,qCAAqC,IAAI,IAI3C,IAAK,MAAO,EAAU,KAAe,sBAC9B,IACL,8BAA8B,IAAI,EAAU,gBAAgB,EAAU,YAAY,KAClF,qCAAqC,IAAI,IAI3C,IAAK,MAAO,EAAU,KAAe,mBAC9B,IACL,8BAA8B,IAAI,EAAU,gBAAgB,EAAU,SAAS,KAC/E,qCAAqC,IAAI,IAI3C,IAAK,MAAO,EAAU,KAAe,mBAC9B,IACL,8BAA8B,IAAI,EAAU,gBAAgB,EAAU,SAAS,KAC/E,qCAAqC,IAAI,IAI3C,IAAK,MAAO,EAAU,KAAe,0BAC9B,IACL,8BAA8B,IAC5B,EACA,gBAAgB,EAAU,gBAAgB,KAE5C,qCAAqC,IAAI,IAI3C,IAAK,MAAO,KAAa,oBAClB,GACL,8BAA8B,IAC5B,EACA,gBAAgB,EAAA,CAAW,EAAU,IAAS,OAAO,EAAK,UAK9D,IAAK,MAAM,IAAY,CAAC,KAAK,MAAO,KAAK,WACvC,8BAA8B,IAC5B,EACA,gBAAgB,EAAA,CAAW,EAAU,KACnC,MAAM,EAAS,EAAK,GACpB,MAAsB,iBAAX,EAA4B,OAAO,EAAO,QACtC,OAAX,GAAqC,iBAAX,EACrB,OAAO,OAAO,KAAK,GAAkB,QACvC,MAMb,IAAK,MAAM,KAAY,sBAChB,IACL,8BAA8B,IAC5B,EACA,gBAAgB,EAAA,CAAW,EAAU,KACnC,MAAM,EAAQ,EAAK,GACnB,MAAwB,iBAAV,EAAqB,OAAO,EAAM,QAAU,MAG9D,qCAAqC,IAAI,IAI3C,IAAK,MAAM,KAAY,uBAChB,GACL,8BAA8B,IAC5B,EACA,gBAAgB,EAAA,CAAW,EAAU,KACnC,MAAM,EAAW,EAAK,GACtB,OAAO,MAAM,QAAQ,GAAY,OAAO,EAAS,QAAU,MAMjE,IAAK,MAAO,EAAU,KAAe,sBAAuB,CAC1D,IAAK,EAAU,SACf,MAAM,EAAW,oBAAoB,IAAI,GACzC,8BAA8B,IAC5B,EACA,gBAAgB,EAAU,YAAY,EAAY,KAE/C,GACH,qCAAqC,IAAI,GAkB7C,GAbI,MAAM,MACR,8BAA8B,IAC5B,MAAM,KACN,gBAAgB,MAAM,KAAA,CAAO,EAAU,KACrC,MAAM,EAAS,EAAK,GACpB,OAAc,MAAV,GAAoD,iBAA1B,EAAe,OACpC,OAAQ,EAAe,QACzB,MAM2B,mBAA5B,MAAc,UAA0B,CAClD,MAAM,EAAa,MAAc,UACjC,8BAA8B,IAC5B,EACA,gBAAgB,EAAA,CAAY,EAAU,KACpC,MAAM,EAAS,EAAK,GACpB,OAAc,MAAV,GAAoD,iBAA1B,EAAe,OACpC,OAAQ,EAAe,QACzB,MCthBb,IAAM,mBAAqB,IAAI,QACzB,oBAAsB,IAAI,QAEnB,KAAb,MACE,WAAA,CACE,EACA,EACA,GAAiB,EACjB,GAAkB,EAClB,GAAoB,EACpB,GAAoB,GALb,KAAA,QAAA,EACA,KAAA,KAAA,EACA,KAAA,QAAA,EACA,KAAA,SAAA,EACA,KAAA,WAAA,EACA,KAAA,WAAA,EAGT,GAAA,CAAiB,GACf,MAAM,EAAM,KAAK,QACjB,QAAY,IAAR,EAAmB,MAAM,IAAI,eAAe,GAAG,KAAK,KAAK,6BAC7D,GAAY,OAAR,EACF,MAAM,IAAI,UAAU,6CAA6C,KAAK,KAAK,gBAC7E,EAAQ,iBAAiB,QAAS,GAAO,EAAG,EAAK,KAAK,KAAK,aAE3D,OAAO,oBADM,EAAY,KAAK,MACE,EAAS,KAI7C,SAAgB,eAAe,EAAc,GAC3C,OAAO,OAAO,UAAU,eAAe,KAAK,EAAK,GAGnD,SAAgB,uBAAuB,GACrC,OAAO,oBAAoB,IAAI,GAGjC,SAAgB,mBAAmB,EAAc,EAAuB,GACtE,IAAK,EAAK,OACN,aAAe,OACZ,IACH,EAAO,GAET,EAAM,EAAI,IAAI,IAEhB,MAAM,EAAI,GAAM,MAAQ,OACxB,GAAI,IAAQ,WACV,OAAO,IAAI,KACT,CAAA,CACG,GAAI,EAAQ,IAAI,eAEnB,EACA,GAAM,UAAW,GACjB,EACA,GAAM,aAAc,GAGxB,GAAI,IAAS,EAAK,WAChB,OAEF,MAAM,EAAc,oBAAoB,EAAK,EAAS,GAAM,SAC5D,OAAI,IAAgB,EACX,IAAI,KACT,CAAA,CAAG,GAAI,GACP,EACA,GAAM,UAAW,EACjB,GAAM,WAAY,EAClB,GAAM,aAAc,QANxB,EAWF,SAAS,oBAAoB,EAAc,EAAuB,GAChE,GAAmB,mBAAR,EACT,OAAO,EAET,MAAM,EAAc,EAAQ,MAAM,IAAI,GACtC,YAAoB,IAAhB,EACK,EAEJ,sBAAsB,EAAiB,EAAa,GAGlD,gBAAgB,EAAa,EAAuB,EAAiB,GAFnE,EAKX,SAAS,sBAAsB,EAAoB,EAAsB,GACvE,OACE,qCAAqC,IAAI,IACzB,OAAhB,IACwB,iBAAhB,GAAmD,mBAAhB,IAC3C,IAAgB,EAAQ,IAAI,gBAC3B,EAAQ,IAAI,iBAAiB,IAAI,GAItC,SAAS,gBACP,EACA,EACA,EACA,GAEA,IAAI,EAAQ,mBAAmB,IAAI,GAC9B,IACH,EAAQ,IAAI,QACZ,mBAAmB,IAAI,EAAa,IAGtC,IAAI,EAAQ,EAAM,IAAI,GACtB,OAAI,IAIJ,EAAQ,YAA4B,GAClC,OAAO,EAAY,MAAM,KAAM,IAGjC,yBAAyB,EAAO,GAChC,EAAQ,IAAI,mBAAmB,IAAI,GACnC,oBAAoB,IAAI,EAAO,GAC/B,EAAM,IAAI,EAAa,GAChB,GAGT,SAAS,yBACP,EACA,EACA,EAAiE,CAAA,GAEjE,IAAK,MAAM,IAAO,CAAC,OAAQ,UAAoB,CAC7C,MAAM,EAAa,OAAO,yBAAyB,EAAQ,GACvD,GAAY,cACd,OAAO,eAAe,EAAQ,EAAK,IAC9B,EACH,MAAO,EAAU,IAAQ,EAAO,MC/HxC,SAAS,SAAS,GAChB,MAAM,EAA4B,OAAO,OAAO,CAAA,EAAI,GACpD,IAAK,MAAM,KAAO,EAChB,EAAI,IAAO,EAEb,OAAO,EAKT,IAAa,MAAb,MAUE,WAAA,CAAY,EAAsB,EAAO,CAAA,EAAI,cARZ,CAAA,WACF,CAAA,WACA,CAAA,gBACK,CAAA,oBAGO,CAAA,EAGzC,MAAM,OAA+B,IAAjB,GAAyC,OAAX,EAClD,KAAK,OAAS,EACd,KAAK,QAAU,EACf,KAAK,IAAM,EAAc,KAAK,IAAM,SAAS,GAC7C,KAAK,IAAM,EAAc,SAAS,GAAQ,KAAK,IAC/C,KAAK,QAAqB,OAAX,EAAkB,SAAS,GAAQ,CAAA,EAClD,KAAK,aAAe,EAGtB,GAAA,CAAI,EAAa,GACf,MAAM,EAAiB,SAAR,EACT,EAAQ,KAAK,iBAAiB,EAAK,EAAQ,GACjD,OAAI,GAAS,EACJ,IAAI,KAAK,CAAE,KAAM,EAAM,cAAgB,GAAK,GAAO,GAAO,GAE9D,EAGD,GAAY,EAAM,aAAa,GAC1B,IAAI,KAAK,EAAM,aAAc,GAAK,GAAO,GAAO,GAAM,GAExD,IAAI,KACT,EAAM,QACN,EACA,eAAe,EAAM,MAAO,GAC5B,eAAe,EAAM,QAAS,IAC9B,GAVO,IAAI,UAAK,EAAW,GAc/B,GAAA,CAAI,EAAa,EAAc,GAC7B,GAAY,SAAR,EAAgB,MAAM,IAAI,YAAY,6BAC1C,GAAI,cAAc,IAAI,GAAM,MAAM,IAAI,YAAY,sBAAwB,EAAM,KAChF,MAAM,EAAO,KAAK,IAAI,EAAK,GAC3B,QAAqB,IAAjB,EAAK,QACP,MAAM,IAAI,eAAe,aAAa,wBAExC,GAAqB,OAAjB,EAAK,QACP,MAAM,IAAI,UAAU,4CAA4C,OAElE,GAAI,EAAK,QACP,MAAM,IAAI,UAAU,mCAEtB,GAAI,EAAK,SACP,MAAM,IAAI,aAAa,oCAAoC,MAG7D,OADC,EAAK,QAAgB,EAAK,MAAQ,EAC5B,EAGT,gBAAA,CAAiB,EAAa,EAAiB,GAC7C,IAAI,EAAe,KACnB,GAAI,EAAQ,CACV,EAAG,CACD,QAA2B,IAAvB,EAAM,aAA4B,OAAO,EAC7C,EAAQ,EAAM,aACG,OAAV,GACT,OAAO,KAET,EAAG,CACD,GACE,GACA,KAAO,EAAM,iBACX,IAAO,CAAA,IAAO,eAAe,EAAM,aAAc,IAEnD,OAAO,EAET,GAAI,KAAO,EAAM,YAAa,IAAO,CAAA,IAAO,eAAe,EAAM,QAAS,IACxE,OAAO,EAET,EAAQ,EAAM,aACG,OAAV,GACT,OAAO,KAGT,gBAAA,CAAiB,EAAa,EAAqB,GACjD,IAAI,EAAe,KACnB,EAAG,CACD,GACE,GACA,KAAO,EAAM,iBACX,IAAO,CAAA,IAAO,eAAe,EAAM,aAAc,IAEnD,OAAO,EAET,GAAI,KAAO,EAAM,YAAa,IAAO,CAAA,IAAO,eAAe,EAAM,QAAS,IACxE,OAAO,EAET,GAAqB,OAAjB,EAAM,QAAmB,QAAqC,IAAvB,EAAM,aAC/C,OAAO,EAET,EAAQ,EAAM,aACG,OAAV,GACT,OAAO,EAGT,OAAA,CAAQ,EAAa,EAAe,EAAgB,EAAmB,GACrE,GAAY,SAAR,EAAgB,MAAM,IAAI,YAAY,6BAC1C,GAAI,cAAc,IAAI,GAAM,MAAM,IAAI,YAAY,sBAAwB,EAAM,KAChF,MAAM,EAAgB,KAAK,iBAAiB,EAAK,IAAS,QAAQ,IAAK,GACvE,GAAI,IAAS,QAAQ,IACnB,IAAI,EAAc,IAAI,GAOpB,OANA,EAAc,QAAQ,GAAO,EACxB,EAGH,EAAc,QAAQ,IAAO,SAFtB,EAAc,QAAQ,GAIxB,IAAI,KAAK,EAAc,QAAS,GAAK,EAAO,EAAc,QAAQ,IAAM,MACtE,KAAO,EAAc,QAC9B,MAAM,IAAI,YAAY,eAAe,gCAGzC,GAAI,KAAO,EAAc,SAAW,KAAO,EAAc,aACvD,MAAM,IAAI,YAAY,eAAe,gCAavC,OAVI,IACF,EAAc,QAAQ,IAAO,GAE/B,EAAc,GAAM,IAAO,EACvB,IAAS,QAAQ,SACnB,EAAc,aAAa,GAAO,EAElC,EAAc,QAAQ,GAAO,EAGxB,IAAI,KACT,IAAS,QAAQ,SAAW,KAAK,aAAe,KAAK,QACrD,EACA,IAAS,QAAQ,MACjB,GACA,EACA,IAAS,QAAQ,YAOV,WAAb,QAEa,SAAW,CAAA,EAEX,yBAAb,MAEE,WAAA,CAAY,GACV,KAAK,OAAS,MAIlB,SAAgB,uBAAuB,GACrC,OAAO,IAAI,yBAAyB,GAGtC,SAAgB,aACd,EACA,EACA,EAAQ,IAAI,SAEZ,OAAc,OAAV,GAAoC,iBAAV,GAAuC,mBAAV,EAA8B,IAEzF,EAAQ,mBAAmB,EAAO,IAAY,aAEzB,OACnB,EAAQ,EAAM,IAAI,IAGhB,IAAU,SAIP,OAJP,GAOF,SAAgB,cAAc,EAAe,EAAuB,EAAQ,IAAI,SAC9E,IAAI,EAAM,IAAI,GAAd,CACA,EAAM,IAAI,GACV,IAAK,MAAM,KAAO,EAAO,CACvB,MAAM,EAAM,EAAM,GACN,OAAR,GAA+B,iBAAR,GACzB,cAAc,EAAK,EAAS,GAE9B,EAAM,GAAO,aAAa,EAAK,GAPX,EAWxB,SAAgB,eACd,EACA,EACA,EAAQ,IAAI,SAEZ,IAAK,MAAM,KAAS,EAClB,cAAc,EAAO,EAAS,GCrMlC,IAAa,YAAb,MACE,WAAA,CACE,EACA,EACA,EACA,EACA,EAIA,EACA,EAIA,EAIA,EACA,EACA,EACA,GApBO,KAAA,IAAA,EACA,KAAA,UAAA,EACA,KAAA,KAAA,EACA,KAAA,iBAAA,EACA,KAAA,iBAAA,EAIA,KAAA,oBAAA,EACA,KAAA,uBAAA,EAIA,KAAA,0BAAA,EAIA,KAAA,MAAA,EACA,KAAA,wBAAA,EACA,KAAA,SAAA,EACA,KAAA,YAAA,IAIX,SAAS,2BAA2B,GAClC,MAAO,CACL,SAAU,IAAI,IACd,gBAAiB,IAAI,IACrB,UAAW,IAAK,IAIpB,IAAM,2BAA6B,IAAI,IAAI,CAAC,SAAU,OAAQ,YAAa,MAAO,WAElF,SAAS,uBAAuB,EAAkB,GAChD,IAAK,MAAO,EAAK,KAAU,OAAO,QAAQ,GAAkB,CAC1D,GAAI,2BAA2B,IAAI,GAAM,SACzC,MAAM,EAAa,OAAO,yBAAyB,OAAQ,GACvD,GACF,OAAO,eAAe,EAAQ,EAAK,IAKzC,SAAgB,qBAAqB,GACnC,GAAI,EAAQ,KACV,OAAO,EAAQ,KAGjB,SAAS,cAA6B,GACpC,cACE,MAAM,IAAI,UAAU,+BAEtB,OAAO,YAAuB,IAAhB,OAA4B,EAAY,OAAO,IAqC/D,OAlCA,uBAAuB,cAAe,EAAQ,WAC9C,OAAO,iBAAiB,cAAe,CACrC,UAAW,CACT,MAAO,OAAO,UACd,YAAY,EACZ,cAAc,EACd,UAAU,GAEZ,IAAK,CACH,KAAA,CAAM,GACJ,MAAM,EAAY,OAAO,GACzB,IAAI,EAAS,EAAQ,SAAS,IAAI,GAMlC,OALK,IACH,EAAS,OAAO,GAChB,EAAQ,SAAS,IAAI,EAAW,GAChC,EAAQ,gBAAgB,IAAI,EAAQ,IAE/B,GAET,YAAY,EACZ,cAAc,EACd,UAAU,GAEZ,OAAQ,CACN,MAAM,GACqB,iBAAX,EAAsB,EAAQ,gBAAgB,IAAI,QAAU,EAE5E,YAAY,EACZ,cAAc,EACd,UAAU,KAId,EAAQ,KAAO,cACR,cAGT,SAAS,gBAAgB,CAIzB,SAAgB,gBAAgB,GAE9B,OADA,EAAG,UAAY,cAAc,UACtB,EACP,SAAS,IACP,IAAK,MAAM,KAAK,EACd,KAAK,GAAK,EAAQ,IAKxB,SAAgB,cAAc,EAAsB,GAClD,MAAM,EAAiB,2BAA2B,EAAQ,iBAEpD,EAAgB,IADA,gBAAgB,EAAQ,UAExC,EAAoB,CACf,UACT,iBAAkB,IAAI,IAAI,OAAO,OAAO,EAAQ,UAChD,mBAAoB,IAAI,IAAI,IAAI,EAAQ,oBAAoB,IAAK,GAAM,CAAC,EAAE,GAAG,UAAW,EAAE,MAC1F,iBACA,UACA,YAAa,IAAI,MAAM,KAAM,EAAe,GAC5C,gBACA,MAAO,CACL,MAAO,GACP,UAAW,EAAQ,eACnB,UAAW,EAAQ,YAAc,4BAAyB,GAE5D,mBAAoB,IAAI,SAE1B,EAAQ,mBAAmB,IAAI,OAAO,eAAe,GAAgB,IAAI,KACzE,EAAQ,mBAAmB,IAAI,OAAO,eAAe,GAAG,OAAO,aAAwB,IAAI,KAE3F,MAAM,EAAW,OAAO,eAAA,YAA6B,CAA7B,IACxB,EAAQ,mBAAmB,IAAI,OAAO,eAAe,GAAW,IAAI,KACpE,MAAM,EAAgB,OAAO,eAAA,kBAAmC,CAAnC,IAwB7B,OAvBA,EAAQ,mBAAmB,IAAI,OAAO,eAAe,GAAgB,IAAI,KAEjD,oBAAb,UACT,EAAQ,mBAAmB,IAAI,SAAS,UAAW,IAAI,KAClC,oBAAZ,SAAyB,EAAQ,mBAAmB,IAAI,QAAQ,UAAW,IAAI,KACnE,oBAAZ,SAAyB,EAAQ,mBAAmB,IAAI,QAAQ,UAAW,IAAI,KAClE,oBAAb,UACT,EAAQ,mBAAmB,IAAI,SAAS,UAAW,IAAI,KACrC,oBAAT,MAAsB,EAAQ,mBAAmB,IAAI,KAAK,UAAW,IAAI,KACrD,oBAApB,iBACT,EAAQ,mBAAmB,IAAI,gBAAgB,UAAW,IAAI,KACjC,oBAApB,iBACT,EAAQ,mBAAmB,IAAI,gBAAgB,UAAW,IAAI,KAClC,oBAAnB,gBACT,EAAQ,mBAAmB,IAAI,eAAe,UAAW,IAAI,KAChC,oBAApB,iBACT,EAAQ,mBAAmB,IAAI,gBAAgB,UAAW,IAAI,KAClC,oBAAnB,gBACT,EAAQ,mBAAmB,IAAI,eAAe,UAAW,IAAI,KACpC,oBAAhB,aACT,EAAQ,mBAAmB,IAAI,YAAY,UAAW,IAAI,KACjC,oBAAhB,aACT,EAAQ,mBAAmB,IAAI,YAAY,UAAW,IAAI,KACrD,EAGT,SAAgB,kBACd,QASA,cACA,aAEA,MAAM,MAAQ,IAAI,IACZ,YAA4B,IAAI,YACpC,QAAQ,QACR,cAAc,UACd,cAAc,KACd,IAAI,IACJ,IAAI,QACJ,IAAI,QACJ,QAAQ,iBACR,QAAQ,oBACR,MACC,GAAY,QAAQ,iBAAiB,IAAI,EAAI,eAC5C,YACF,aAEF,GAAI,YAAa,CACf,MAAM,KAAO,YAAY,gBAAgB,aACnC,UAAY,YAAY,qBAAqB,aAC7C,QAAU,YAAY,yBAAyB,aAC/C,aAAe,YAAY,8BAA8B,aACzD,cAAgB,YAAY,gBAAgB,aAClD,MAAM,IAAI,SAAU,MACpB,MAAM,IAAI,cAAe,WACzB,MAAM,IAAI,kBAAmB,SAC7B,MAAM,IAAI,uBAAwB,cAClC,MAAM,IAAI,OAAQ,eAClB,MAAM,IAAI,KAAM,YAAY,cAAc,KAAM,cAChD,MAAM,IAAI,WAAY,YAAY,oBAAoB,KAAM,cAC5D,MAAM,IAAI,YAAa,YAAY,qBAAqB,KAAM,cAC9D,MAAM,IAAI,aAAc,YAAY,sBAAsB,cAC1D,MAAM,IAAI,cAAe,YAAY,uBAAuB,cAE5D,IAAK,MAAO,EAAU,KAAY,8BAChC,MAAM,IAAI,EAAU,EAAQ,cAG9B,IAAK,MAAO,EAAU,KAAY,QAAQ,QAAQ,QAAQ,qBACxD,MAAM,IAAI,EAAU,EAAQ,YAAa,MAAM,IAAI,KAGrD,MAAM,KAAO,QAAQ,QAAQ,mBAE7B,IAAK,MAAO,EAAK,KAAU,MACpB,KAAK,IAAI,EAAI,YAChB,KAAK,IAAI,EAAI,UAAW,IAAI,KAEzB,KAAK,IAAI,EAAM,YAClB,KAAK,IAAI,EAAM,UAAW,KAAK,IAAI,EAAI,YAAc,IAAI,KAEvD,QAAQ,QAAQ,iBAAiB,IAAI,IACvC,QAAQ,QAAQ,iBAAiB,IAAI,GAEnC,eAAe,QAAQ,QAAQ,cAAe,EAAI,QACpD,QAAQ,QAAQ,cAAc,EAAI,MAAQ,GAG1C,QAAQ,QAAQ,cAAc,aAChC,QAAQ,QAAQ,cAAc,WAAa,QAAQ,QAAQ,eAG/D,OAAO,YAGT,SAAgB,OAAiC,GAC/C,OACE,MAAM,QAAQ,IACK,iBAAZ,EAAK,IACZ,EAAK,KAAO,SAAS,MACrB,EAAK,KAAO,SAAS,KChNzB,IAAa,IAAM,IAAI,IAEvB,SAAgB,OACd,EACA,GAEA,IAAI,IAAI,EAAM,GEyHhB,SAAS,YAAY,EAAgB,GAEnC,GAAI,IAAS,MAAO,CAClB,MAAM,EAAI,EAAK,GACf,MAAiB,iBAAN,GAAkC,IAAhB,EAAK,OAAqB,OAAO,GACvD,OAAO,EAAK,QAErB,GAAI,iBAAkB,IAAI,OAAO,eAAe,EAAK,YAAa,CAChE,MAAM,EAAI,EAAK,GACf,MAAiB,iBAAN,EAAuB,OAAO,GACrC,MAAM,QAAQ,IAAM,YAAY,OAAO,GAAW,OAAQ,EAAyB,QAChF,GAGT,GAAI,IAAS,KAAO,IAAS,IAAK,CAChC,MAAM,EAAW,EAAK,GACtB,OAAI,MAAM,QAAQ,GAAkB,OAAO,EAAS,QAC7C,GAGT,GAAI,IAAS,QAAU,IAAS,OAAQ,CACtC,MAAM,EAAI,EAAK,GACf,MAAiB,iBAAN,EAAuB,OAAO,EAAE,QACpC,GAET,OAAO,GDtMT,OAA6B,SAAS,KAAA,EAAS,OAAM,IAAG,IAAG,MAAK,UAAS,QAAO,eAC9E,GAAU,OAAN,EACF,MAAM,IAAI,UAAU,4CAA4C,GAAG,gBAOrE,GAJK,cAAc,KACjB,EAAI,GAAG,UAGC,IAAN,QAA2B,IAAR,GAAkC,iBAAN,EAAgB,CAEjE,MAAM,EAAO,EAAM,IAAI,EAAG,GAC1B,QAAqB,IAAjB,EAAK,QACP,MAAM,IAAI,eAAe,GAAG,oBAE1B,EAAK,UAAY,EAAQ,IAAI,eAC3B,EAAQ,IAAI,QAAQ,OACtB,EAAQ,IAAI,aAAa,cAAc,IAAI,GAO/C,YADA,OAAK,EAFK,mBADG,EAAK,QAAgB,EAAK,MACL,EAAS,IAAS,WAIrC,IAAN,EACT,MAAM,IAAI,UAAU,iDAAiD,EAAE,gBAGzE,IAAK,sBAAsB,GAEzB,YADA,OAAK,EAAW,IAAI,UAAK,EAAW,IAItC,MAAM,EAA+B,mBAAN,IAAqB,eAAe,EAAG,GAEtE,GAAI,EAAQ,IAAI,QAAQ,OAAS,EAAiB,CAChD,IAAI,EAAW,OAAO,eAAe,GACrC,GACM,eAAe,EAAM,KAErB,EAAQ,IAAI,cACX,EAAQ,IAAI,YAAY,gBAAgB,EAAK,YAAY,QAE1D,EAAQ,IAAI,YAAY,gBAAgB,EAAK,YAAY,MAAQ,IAAI,KAEvE,EAAQ,IAAI,aAAa,gBAAgB,EAAK,YAAY,MAAM,IAAI,UAE9D,EAAO,OAAO,eAAe,IAGzC,GAAI,EAAiB,CACnB,GAAiB,mBAAN,GACL,eAAe,EAAG,GAAI,CACxB,MAAM,EAAY,EAAQ,IAAI,mBAAmB,IAAI,EAAE,WACvD,KACI,GAAe,EAAU,OAAQ,EAAU,IAAI,MAChD,EAAQ,IAAI,mBAAmB,IAAI,GAEpC,MAAM,IAAI,mBACR,mDAAmD,EAAE,QAAQ,EAAE,cAMvE,IAAI,EAAW,EACf,KAAQ,EAAO,OAAO,eAAe,OAC/B,eAAe,EAAM,IAAY,cAAN,EAAmB,CAChD,MAAM,EAAY,EAAQ,IAAI,mBAAmB,IAAI,GACrD,GACG,KAAe,EAAU,MAAQ,EAAU,IAAI,KAChD,EAAQ,IAAI,mBAAmB,IAAI,EAAK,aAExC,MAEF,GAAU,cAAN,EACF,MAAM,IAAI,mBAAmB,yDAE/B,MAAM,IAAI,mBACR,4CAA4C,EAAK,YAAY,QAAQ,EAAE,eAM/E,GAAiB,mBAAN,EAAkB,CAC3B,GAAU,cAAN,IAAsB,EAAQ,IAAI,mBAAmB,IAAI,GAC3D,MAAM,IAAI,mBAAmB,yDAE/B,GAAI,CAAC,SAAU,SAAU,aAAa,SAAS,GAC7C,MAAM,IAAI,mBAAmB,cAAc,gCAG/C,MAAM,EAAM,EAAE,GAEd,GAAU,cAAN,IAAsB,EAAQ,IAAI,mBAAmB,IAAI,GAAK,aAChE,MAAM,IAAI,mBAAmB,yDAG/B,MAAM,EAAI,mBAAmB,EAAK,EAAS,IAAI,KAAK,EAAG,GAAG,GAAO,IACjE,GAAI,EAEF,YADA,OAAK,EAAW,GAIlB,MAAM,EAAkB,IAAM,EAAQ,IAAI,cACpC,GACF,GAAmB,aAAe,MAAQ,EAAI,UAClC,mBAAN,IAAqB,EAAQ,IAAI,mBAAmB,IAAI,IAChE,EAAQ,IAAI,iBAAiB,IAAI,IAChC,GACc,iBAAN,GACP,eAAe,EAAQ,IAAI,YAAY,QAAS,GAEpD,OAAK,EAAW,IAAI,KAAK,EAAG,GAAG,EAAO,GAAG,MAG3C,OAAwB,SAAS,YAAA,EAAgB,OAAM,IAAG,aACxD,OAAK,EAAW,EAAQ,UAAU,QAAQ,SAAS,MCjHrD,OAA6B,SAAS,KAAO,IAC3C,MAAM,KAAE,EAAA,EAAM,EAAA,EAAG,EAAA,IAAG,EAAA,QAAK,GAAY,EACrC,GAAI,EAAQ,IAAI,QAAQ,oBACtB,MAAM,IAAI,uBAAuB,wCACnC,GAAiB,mBAAN,EACT,MAAM,IAAI,UACR,GAAwB,iBAAd,GAAK,KAAoB,SAAW,GAAK,0BAGvD,MAAM,EAAO,IAAI,MAAe,EAAE,QAClC,IAAI,EAAU,EACd,IAAK,IAAI,EAAI,EAAG,EAAI,EAAE,OAAQ,IAAK,CACjC,MAAM,EAAO,EAAE,GACf,GAAI,aAAgB,YAAa,CAC/B,MAAM,EAAW,MAAM,QAAQ,EAAK,MAAQ,EAAK,KAAO,IAAK,EAAK,MAClE,GAAI,uBAAuB,EAAQ,OAAO,EAAS,SAAU,OAC7D,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,OAAQ,IACnC,EAAK,KAAa,aAAa,EAAS,GAAI,QAE9C,EAAK,KAAa,aAAa,EAAM,GAKzC,GAFA,EAAK,OAAS,EAEV,IAAM,OAAQ,CAChB,MAAM,EAAS,OAAO,EAAK,IAG3B,OAFA,mBAAmB,EAAS,OAAO,EAAO,cAC1C,OAAK,EAAW,GAIlB,GAAmB,mBAAR,EAAoB,CAE7B,MAAM,EAAM,EAAQ,MAAM,IAAI,GACxB,EAAW,uBAAuB,GACxC,IAAI,EAAM,EACN,EAAI,KAAQ,QACC,IAAb,EACE,KAAO,GACP,EAAI,KAAK,KAAa,GAU5B,OATA,EAAM,aAAa,EAAK,QACZ,OAAR,GAA+B,iBAAR,GAAoB,aAAe,yBAC5D,QAAQ,QAAQ,EAAI,QAAQ,KACzB,GAAQ,OAAK,EAAW,GACxB,GAAQ,EAAK,IAGhB,OAAK,EAAW,IAOpB,MAAM,EAAsB,EAAI,QAAQ,EAAI,MAE5C,GAAI,IAAe,KAAK,WAAa,EAAQ,iBAAiB,KAAM,CAClE,MAAM,EAAQ,IAAI,QAClB,IAAI,EAAQ,GACZ,MAAM,EAAW,IACf,IAAK,GAAoB,iBAAN,GAAmB,EAAM,IAAI,GAAI,OACpD,EAAM,IAAI,GACV,MAAM,EAAO,OAAO,KAAK,GACzB,GAAS,OAAO,EAAK,QACrB,IAAK,MAAM,KAAK,EACd,EAAQ,iBAAiB,QAAS,GAAO,EAAG,EAAG,IAC/C,EAAQ,EAAE,KAGd,EAAQ,EAAK,IACb,mBAAmB,EAAS,GAG9B,GACE,EAAI,mBAAmB,OACvB,YAAY,IAAI,KACf,EAAQ,oBAAoB,IAAI,EAAI,UACnC,EAAQ,0BAA0B,IAAI,EAAI,UAC5C,CACA,IAAI,EACA,GAAU,EACd,GAAiB,SAAb,EAAI,KACN,EAAS,CAAE,KAAM,OAAQ,MAAO,GAChC,IAAY,EAAK,eACK,QAAb,EAAI,KACb,EAAS,CAAE,KAAM,MAAO,QAAS,EAAI,QAAQ,OAAM,IACnD,IAAY,EAAO,QAAQ,eACL,UAAb,EAAI,KACb,EAAS,CAAE,KAAM,QAAS,QAAS,EAAI,QAAQ,MAAM,EAAG,IACxD,IAAY,EAAO,QAAQ,eACL,YAAb,EAAI,KACb,EAAS,CAAE,KAAM,UAAW,MAAO,GACnC,IAAY,EAAK,eACK,WAAb,EAAI,KACb,EAAS,CACP,KAAM,SACN,WAAY,EAAK,GACjB,iBAAyB,IAAZ,EAAK,GAAmB,EAAI,QAAQ,OAAS,EAAK,GAC/D,MAAO,EAAK,MAAM,GAClB,QAAS,EAAI,QAAQ,MACnB,EAAK,QACO,IAAZ,EAAK,QAAmB,EAAa,EAAK,GAAiB,EAAK,KAGpE,IAAY,EAAO,MAAM,UAAY,EAAO,QAAQ,eAC9B,YAAb,EAAI,MAAmC,SAAb,EAAI,KACvC,EAAS,CAAE,KAAM,EAAI,MACrB,IAAY,EAAI,QAAQ,eACF,eAAb,EAAI,KAAuB,CACpC,MAAM,OACQ,IAAZ,EAAK,GACD,EAAI,QAAQ,OAAU,EAAK,GAC3B,KAAK,IAAI,EAAI,QAAQ,OAAS,EAAK,GAAiB,EAAK,IAC/D,EAAS,CACP,KAAM,aACN,WAAY,EAAK,GACjB,SAAW,EAAK,GAAgB,EAChC,MAAO,EAAI,QAAQ,MAAM,EAAK,GAAe,EAAK,GAAgB,GAClE,QAAS,EAAI,QAAQ,MAAM,EAAK,GAAe,EAAK,GAAgB,IAEtE,IAAY,EAAO,MAAM,UAAY,EAAO,QAAQ,OAEtD,GAAI,EAAS,CACX,MAAM,EAAO,EAAQ,oBAAoB,IAAI,EAAI,SACjD,QAAa,IAAT,EAAoB,IAAK,MAAM,KAAM,EAAM,EAAG,GAClD,MAAM,EAAQ,EAAQ,0BAA0B,IAAI,EAAI,SACxD,QAAc,IAAV,EAAqB,IAAK,MAAM,KAAM,EAAO,EAAG,IAOxD,EAAI,IAAI,GACR,MAAM,EAAM,EAAQ,MAAM,IAAI,GACxB,EAAW,uBAAuB,GAClC,EAAU,EAAI,iBAA2B,IAAb,EAAyB,EAAW,EAAI,QAC1E,IAAI,EAAM,EAAM,EAAI,KAAK,KAAY,GAAS,EAAe,KAAK,KAAY,GAC9E,EAAM,aAAa,EAAK,GACZ,OAAR,GAA+B,iBAAR,GAAoB,aAAe,yBAC5D,QAAQ,QAAQ,EAAI,QAAQ,KACzB,GAAQ,OAAK,EAAW,GACxB,GAAQ,EAAK,IAGhB,OAAK,EAAW,KAIpB,OAAoD,SAAS,IAAM,IACjE,MAAM,KAAE,EAAA,EAAM,EAAA,EAAG,EAAA,QAAG,GAAY,EAChC,IAAK,EAAQ,IAAI,iBAAiB,IAAI,KAAO,EAAQ,IAAI,mBAAmB,IAAI,GAC9E,MAAM,IAAI,mBAAmB,oCAAoC,EAAE,YAAY,QAEjF,MAAM,EAAO,EAAE,IAAK,GAAS,aAAa,EAAM,IAC1C,EAAc,EAAQ,MAAM,IAAI,GACtC,GAAI,EAGF,YADA,OAAK,EADO,IAAK,KAAuD,IAI1E,MAAM,EAAgB,YAAY,EAAG,GACjC,EAAgB,IAAM,uBAAuB,EAAQ,IAEzD,OAAK,EADO,IAAI,KAAK,MCvKvB,OAA0B,SAAS,aAAe,IAChD,MAAM,KAAE,EAAA,EAAM,GAAM,EACpB,IAAI,EAAM,CAAA,EACV,IAAK,MAAM,KAAQ,EACjB,GAAI,EAAK,eAAe,aAAc,CACpC,MAAM,EAAO,OAAO,KAAK,EAAK,IAAI,MAClC,GAAI,uBAAuB,EAAQ,OAAO,EAAK,SAAU,OACzD,EAAM,IAAK,KAAQ,EAAK,IAAI,WAE5B,EAAI,EAAK,KAAO,EAAK,IAGzB,OAAK,EAAW,KAGlB,OAA8B,SAAS,OAAA,EAAW,OAAM,IAAG,OACzD,OAAK,EAAW,IAAI,OAAO,EAAG,KAGhC,OAAwB,SAAS,YAAc,IAC7C,MAAM,KAAE,EAAA,EAAM,EAAA,QAAG,GAAY,EACvB,EAAmB,GACzB,IAAK,MAAM,KAAQ,EACjB,GAAI,aAAgB,YAAa,CAC/B,MAAM,EAAW,MAAM,QAAQ,EAAK,MAAQ,EAAK,KAAO,IAAK,EAAK,MAClE,GAAI,uBAAuB,EAAQ,OAAO,EAAS,SAAU,OAC7D,IAAK,MAAM,KAAK,EAAU,EAAM,KAAK,aAAa,EAAG,SAC5C,aAAgB,UACzB,EAAM,SAEN,EAAM,KAAK,aAAa,EAAM,IAGlC,OAAK,EAAW,KAGlB,OAAO,SAAS,KAAA,EAAS,UAAW,OAAK,EAAW,IAAI,YAExD,OAAyB,SAAS,MAAA,EAAU,OAAM,OAAQ,OAAK,EAAW,IAE1E,OAAwB,SAAS,aAAA,EAAiB,OAAM,QACtD,OAAQ,GACN,IAAK,OACH,OAAO,OAAK,GAAW,GACzB,IAAK,QACH,OAAO,OAAK,GAAW,GACzB,IAAK,OACH,OAAO,OAAK,EAAW,MACzB,IAAK,YACH,OAAO,OAAK,OAAW,GACzB,IAAK,MACH,OAAO,OAAK,EAAW,KACzB,IAAK,WACH,OAAO,OAAK,EAAW,KAE3B,EAAK,IAAI,MAAM,mBAAqB,MAGtC,OAA2B,SAAS,YAAA,EAAgB,OAAM,QACxD,OAAK,EAAW,IAAI,YAAY,MAGlC,OAAyC,SAAS,aAAA,EAAiB,OAAM,QACvE,OAAK,EAAW,IAAI,aAAa,MCtEnC,OAAwB,SAAS,OAAA,EAAW,OAAM,OAChD,OAAK,EAAW,OAAO,EAAE,QAAQ,KAAM,OAGzC,OAAwB,SAAS,OAAA,EAAW,OAAM,OAChD,OAAK,EAAW,OAAO,EAAE,QAAQ,KAAM,OAGzC,OAAwB,SAAS,WAAA,EAAe,OAAM,IAAG,cACvD,MAAM,EAAc,EAAQ,UAAU,QAAQ,SAAS,IACvD,IAAK,EAAQ,IAAI,iBAAiB,IAAI,QACpC,MAAM,IAAI,uBAAuB,uBAMjC,OAAK,EAAW,IAHb,EAAQ,MAAM,IAAI,SAED,QACW,EAAI,MAAO,EAAI,UAIlD,OAAwB,SAAS,aAAe,IAC9C,MAAM,KAAE,EAAA,KAAM,EAAA,MAAM,EAAA,EAAO,EAAA,QAAG,EAAA,MAAS,EAAA,SAAO,EAAA,eAAU,GAAmB,GAErE,CAAG,EAAM,GADF,EAAQ,UAAU,SAAS,SAAS,IAE3C,EAAgB,GACtB,IAAI,EACJ,MAAM,EAAoB,GAC1B,KAAQ,EAAI,aAAa,KAAK,IACvB,EAAE,KACL,EAAM,KAAK,EAAG,SAAS,EAAE,GAAI,MAC7B,EAAQ,KAAK,EAAE,KAInB,EACE,EACA,EACA,EACA,EAAA,IACI,KACF,MAAM,EAAiC,CAAA,EACvC,GAAoB,IAAhB,EAAK,OAEP,YADA,EAAK,EAAK,IAGZ,MAAM,EAAY,EAAK,GACvB,IAAK,MAAM,KAAK,OAAO,KAAK,GAA2C,CACrE,MAAM,EAAM,EAAQ,GACpB,EAAM,GAAO,EAAW,GAE1B,MAAM,EAAS,EAAK,QAAQ,yBAAA,CAA2B,EAAO,EAAI,EAAG,KACnE,GAAI,EAAG,OAAO,EAEd,OAAQ,GAAU,IAAM,GAAG,aADf,EAAM,GAC2B,OAE3C,uBAAuB,EAAQ,OAAO,EAAO,UACjD,OAAK,EAAW,SAElB,EACA,EACA,KC7DJ,OAAyB,SAAS,IAAA,EAAQ,OAAM,OAAQ,OAAK,GAAY,IAEzE,OAAwB,SAAS,QAAA,EAAY,OAAM,OAAQ,OAAK,GAAY,IAE5E,OAAoC,SAAS,gBAAA,EAAoB,OAAM,MAAK,cAC1E,YAAY,EAAK,GACjB,OAAK,IAAa,EAAI,QAAQ,EAAI,SAGpC,OAAoC,SAAS,eAAA,EAAmB,OAAM,MAAK,cACzE,YAAY,EAAK,GACjB,OAAK,EAAW,EAAI,QAAQ,EAAI,WAGlC,OAAoC,SAAS,gBAAA,EAAoB,OAAM,MAAK,cAC1E,YAAY,EAAK,GACjB,OAAK,IAAa,EAAI,QAAQ,EAAI,SAGpC,OAAoC,SAAS,eAAA,EAAmB,OAAM,MAAK,cACzE,YAAY,EAAK,GACjB,OAAK,EAAW,EAAI,QAAQ,EAAI,WAGlC,OAAuB,SAAS,SAAA,EAAa,OAAM,OAAQ,OAAK,GAAY,IAE5E,OAAuB,SAAS,SAAA,EAAa,OAAM,OAAQ,OAAK,GAAY,IAE5E,OACE,SAAS,OAAA,EACN,OAAM,OAAM,QAAO,IAAG,UAAS,QAAO,WAAU,qBACjD,EACE,EACA,EACA,EACA,EAAA,CACC,EAAG,KACF,OAAK,SAAkB,aAAa,EAAM,UAE5C,EACA,EACA,KAKN,OAAyB,SAAS,OAAA,EAAW,OAAM,UAAS,WACpD,aAAgB,MAItB,YAAY,EAAM,EAAS,UACvB,EAAK,WACP,OAAK,GAAW,GAGlB,OAAK,SAAmB,EAAK,UAAkB,EAAK,QARlD,OAAK,GAAW,KAWpB,OAAO,SAAS,KAAA,EAAS,WACvB,MC7DF,OAA+C,SAAS,OAAS,IAC/D,MAAM,KAAE,EAAA,EAAM,EAAA,IAAG,EAAA,QAAK,EAAA,MAAS,EAAA,KAAO,EAAA,SAAM,GAAa,EAGzD,GAFA,YAAY,EAAK,GACjB,EAAI,SAAW,GAAM,WAAY,EAC7B,EAAI,WAAY,CAClB,MAAM,EAAI,EAAM,iBAAiB,EAAI,KAA6B,SAAb,EAAI,KAAiB,GAC1E,GAAU,OAAN,EACF,MAAM,IAAI,eAAe,yCAAyC,EAAI,KAAK,eAS7E,OAPA,EAAE,IAAI,EAAI,KAAgB,EAAG,GACzB,EAAI,SACN,EAAE,QAAQ,EAAI,KAAK,aAAc,SAE1B,EAAE,QAAQ,EAAI,KAAK,iBAE5B,OAAK,EAAW,GAGlB,GAAiB,WAAb,EAAI,MAAqB,MAAM,QAAQ,EAAI,UAAyB,iBAAN,EAAgB,CAChF,MAAM,EAAQ,OAAO,KAAK,IAAI,EAAI,EAAI,QAAQ,SAC9C,GAAI,EAAQ,IAAM,uBAAuB,EAAQ,GAAQ,OAE3D,OAAK,EAAY,EAAI,QAAQ,EAAI,MAAQ,KAG3C,OAAoC,SAAS,UAAY,IACvD,MAAM,KAAE,EAAA,EAAM,EAAA,IAAG,EAAA,QAAK,GAAY,EAClC,YAAY,EAAK,GACjB,MAAM,EAAU,EAAI,QAAQ,EAAI,MAAiB,EAC3B,iBAAX,GAAuB,uBAAuB,EAAQ,OAAO,EAAO,UAC/E,OAAK,EAAY,EAAI,QAAQ,EAAI,MAAQ,KAG3C,OAAmC,SAAS,cAAA,EAAkB,OAAM,IAAG,MAAK,cAC1E,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,OAAS,KAG5C,OAAmC,SAAS,aAAA,EAAiB,OAAM,IAAG,MAAK,cACzE,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,OAAS,KAG5C,OAAmC,SAAS,eAAA,EAAmB,OAAM,IAAG,MAAK,cAC3E,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,OAAS,KAG5C,OAAmC,SAAS,YAAA,EAAgB,OAAM,IAAG,MAAK,cACxE,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,QAAU,KAG7C,OAAmC,SAAS,cAAA,EAAkB,OAAM,IAAG,MAAK,cAC1E,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,OAAS,KAG5C,OAAmC,SAAS,gBAAA,EAAoB,OAAM,IAAG,MAAK,cAC5E,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,OAAS,KAG5C,OAAmC,SAAS,aAAA,EAAiB,OAAM,IAAG,MAAK,cACzE,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,OAAS,KAG5C,OAAmC,SAAS,YAAA,EAAgB,OAAM,IAAG,MAAK,cACxE,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,OAAS,KAG5C,OAAmC,SAAS,gBAAA,EAAoB,OAAM,IAAG,MAAK,cAC5E,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,QAAU,KAG7C,OAAmC,SAAS,iBAAA,EAAqB,OAAM,IAAG,MAAK,cAC7E,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,QAAU,KAG7C,OACE,SAAS,yBAAA,EACN,OAAM,IAAG,MAAK,cACf,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,SAAW,KAIhD,OAAoC,SAAS,UAAA,EAAc,OAAM,IAAG,MAAK,cACvE,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,QAAU,KAG7C,OAAoC,SAAS,SAAA,EAAa,OAAM,IAAG,MAAK,cACtE,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,QAAU,KAG7C,OACE,SAAS,wBAAA,EACN,OAAM,IAAG,MAAK,cACf,YAAY,EAAK,GACjB,OAAK,EAAY,EAAI,QAAQ,EAAI,QAAU,KCzG/C,OAAuB,SAAS,WAAA,EAAe,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAEpF,OAAuB,SAAS,YAAA,EAAgB,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAErF,OAAuB,SAAS,gBAAA,EAAoB,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAE1F,OAAuB,SAAS,iBAAA,EAAqB,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAE3F,OAAuB,SAAS,MAAA,EAAU,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAEhF,OAAuB,SAAS,YAAA,EAAgB,OAAM,IAAG,OAAQ,OAAK,EAAW,IAAM,IAEvF,OAAuB,SAAS,SAAA,EAAa,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAEnF,OAAuB,SAAS,eAAA,EAAmB,OAAM,IAAG,OAAQ,OAAK,EAAW,IAAM,IAE1F,OAAuB,SAAS,IAAA,EAAQ,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAE9E,OAAuB,SAAS,GAAA,EAAO,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAE7E,OAAuB,SAAS,kBAAA,EAAsB,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAE5F,OAAuB,SAAS,OAAA,EAAW,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAEhF,OAAuB,SAAS,MAAA,EAAU,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAE/E,OAAuB,SAAS,KAAO,IACrC,MAAM,KAAE,EAAA,EAAM,EAAA,EAAG,GAAM,EACjB,EAAU,EAAa,EACP,iBAAX,GAAuB,uBAAuB,EAAQ,OAAO,EAAO,UAC/E,OAAK,EAAW,KAGlB,OAAuB,SAAS,MAAA,EAAU,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAE/E,OAAuB,SAAS,OAAA,EAAW,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAEhF,OAAuB,SAAS,MAAA,EAAU,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAEhF,OAAuB,SAAS,UAAA,EAAc,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAEnF,OAAuB,SAAS,SAAA,EAAa,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAElF,OAAuB,SAAS,QAAA,EAAY,OAAM,IAAG,OAAQ,OAAK,EAAW,EAAI,IAEjF,OAAuB,SAAS,aAAA,EAAiB,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAEvF,OAAuB,SAAS,cAAA,EAAkB,OAAM,IAAG,OAAQ,OAAK,EAAW,GAAK,IAExF,OAAuB,SAAS,sBAAA,EAA0B,OAAM,IAAG,OACjE,OAAK,EAAW,IAAM,IAGxB,OAAqC,SAAS,WAAA,EAAe,OAAM,IAAG,OACpE,OAAK,EAAW,aAAa,IAG/B,OAAmB,SAAS,GAAA,EAAO,OAAM,IAAG,OAAQ,OAAK,EAAW,KAAK,ICzDzE,OAAO,SAAS,OAAA,EAAW,OAAM,OAAQ,OAAK,EAAW,IAEzD,OAAuC,SAAS,IAAA,EAAQ,OAAM,IAAG,IAAG,QAAO,OAAM,eAC/E,OAAK,EAAW,EAAM,QAAQ,EAAG,QAAQ,IAAK,EAAG,GAAM,WAAY,EAAO,MAG5E,OAAuC,SAAS,IAAA,EAAQ,OAAM,IAAG,IAAG,QAAO,OAAM,eAC/E,OAAK,EAAW,EAAM,QAAQ,EAAG,QAAQ,IAAK,EAAG,GAAM,WAAY,EAAO,MAG5E,OAAuC,SAAS,MAAA,EAAU,OAAM,IAAG,IAAG,QAAO,OAAM,eACjF,OAAK,EAAW,EAAM,QAAQ,EAAG,QAAQ,MAAO,EAAG,GAAM,WAAY,EAAO,MCJ9E,OACE,SAAS,SAAA,EACN,OAAM,IAAG,IAAG,QAAO,OAAM,eAC1B,IAAK,EACH,MAAM,IAAI,uBAAuB,yCAEnC,OAAK,EAAW,EAAM,QAAQ,EAAG,QAAQ,SAAU,EAAG,GAAM,WAAY,EAAO,MAInF,OACE,SAAS,WAAA,EACN,OAAM,IAAG,IAAG,UAAS,sBACtB,MAAM,EAAQ,wBAAwB,GAChC,EAAS,sBAAsB,EAAiB,EAAwB,GAC9E,GAAe,OAAX,EACF,MAAM,IAAI,UAAU,8BAEtB,IAAK,EACH,MAAM,IAAI,UAAU,EAAQ,oBAAoB,KAAW,WAAa,EAAI,cAE9E,OACE,EACA,IAAI,WAAW,EAAQ,IAAI,iBAAa,GAAW,EAAO,CACxD,KAAM,EACN,aAMR,OAAO,SAAS,MAAA,EAAU,OAAM,QAC9B,EAAK,KAGP,OAAO,SAAS,KAAA,EAAS,UAAW,KCnCpC,OACE,SAAS,cAAA,EACN,OAAM,QAAO,IAAG,IAAG,MAAK,UAAS,QAAO,eACzC,GAAsB,iBAAX,EAAI,IAAmB,EAAI,aAAc,WAClD,KAAI,EAAQ,WAAY,EAAQ,YAG9B,MAAM,IAAI,uBAAuB,8CAFjC,EAAI,GAAK,EAAI,EAAQ,YAAY,gBAAgB,IAAI,WAAW,EAAI,IAAK,EAAQ,UAEH,CAGlF,MAAM,EAAW,EAAE,MAAM,GACrB,EAAE,GACJ,OAAK,EAAW,oBAAoB,EAAU,EAAG,EAAO,EAAS,OAAO,EAAW,IAEnF,OAAK,EAAW,eAAe,EAAU,EAAG,EAAO,EAAS,OAAO,EAAW,MAKpF,OACE,SAAS,SAAA,EACN,OAAM,QAAO,IAAG,IAAG,MAAK,UAAS,QAAO,eACzC,GAAsB,iBAAX,EAAI,IAAmB,EAAI,aAAc,WAClD,KAAI,EAAQ,WAAY,EAAQ,YAY9B,MAAM,IAAI,uBAAuB,8CAXjC,EAAI,GAAK,EAAI,EAAQ,YAAY,gBAC/B,IAAI,WAAW,EAAI,IACnB,EAAQ,WACR,EACA,CACE,eAAgB,EAAE,KAAO,SAAS,KAAO,EAAI,EAC7C,WAAY,EAAE,KAAO,SAAS,KAAO,EAAI,EACzC,UAAW,GAI+D,CAGlF,MAAM,EAAU,EAAE,GACZ,EAAc,EAAE,GAChB,EAAO,EAAE,GACT,EAAW,EAAE,MAAM,GACzB,IAAI,EAEF,EADE,IAAY,SAAS,MAAQ,IAAgB,SAAS,KACjD,6BAA6B,EAAU,EAAG,EAAO,EAAS,EAAO,EAAM,GACrE,IAAgB,SAAS,KAC3B,wBAAwB,EAAU,EAAG,EAAO,EAAS,EAAO,EAAM,GAChE,IAAY,SAAS,KACvB,oBAAoB,EAAU,EAAG,EAAO,EAAS,EAAO,EAAM,GAE9D,eAAe,EAAU,EAAG,EAAO,EAAS,EAAO,EAAM,GAE9D,GACF,EAAM,QAAQ,EAAM,QAAQ,IAAK,GAAM,EAAO,GAEhD,OAAK,EAAW,KAIpB,OACE,SAAS,eAAA,EACN,OAAM,QAAO,IAAG,IAAG,MAAK,UAAS,QAAO,eACzC,GAAsB,iBAAX,EAAI,IAAmB,EAAI,aAAc,WAClD,KAAI,EAAQ,WAAY,EAAQ,YAY9B,MAAM,IAAI,uBAAuB,8CAXjC,EAAI,GAAK,EAAI,EAAQ,YAAY,gBAC/B,IAAI,WAAW,EAAI,IACnB,EAAQ,WACR,EACA,CACE,eAAgB,EAAE,KAAO,SAAS,KAAO,EAAI,EAC7C,WAAY,EAAE,KAAO,SAAS,KAAO,EAAI,EACzC,UAAW,GAI+D,CAGlF,MAAM,EAAU,EAAE,GACZ,EAAc,EAAE,GAChB,EAAO,EAAE,GACT,EAAW,EAAE,MAAM,GAIzB,IAAI,EAHA,IACF,EAAQ,IAAI,MAAM,EAAO,CAAA,IAIzB,EADE,IAAY,SAAS,MAAQ,IAAgB,SAAS,KACjD,6BAA6B,EAAU,EAAG,EAAO,EAAS,EAAO,EAAM,GACrE,IAAgB,SAAS,KAC3B,wBAAwB,EAAU,EAAG,EAAO,EAAS,EAAO,EAAM,GAChE,IAAY,SAAS,KACvB,oBAAoB,EAAU,EAAG,EAAO,EAAS,EAAO,EAAM,GAE9D,eAAe,EAAU,EAAG,EAAO,EAAS,EAAO,EAAM,GAE9D,GACF,EAAM,QAAQ,EAAM,QAAQ,IAAK,GAAM,EAAO,GAEhD,OAAK,EAAW,KCpFpB,OACE,SAAS,KAAA,EACN,OAAM,OAAM,QAAO,IAAG,IAAG,UAAS,QAAO,kBAAiB,WAAU,qBACrE,MACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACE,EACE,EAAuB,IACxB,yBAAyB,GAAO,IAAK,GAAc,iBAAiB,GAAW,IAClF,oBAEI,EAAc,sBAAsB,EAAiB,GAC3D,GAAK,IAAuC,SAAS,MAAQ,IAAS,UAEpE,YADA,EAAK,IAAI,YAAY,+DAGvB,IAAI,GAAO,EACX,MAAM,EAAY,IAAI,MAAM,EAAO,CAAA,GAC7B,EAAwC,CAC5C,WAAO,GAEH,EAAe,IAAI,MAAM,EAAW,GAC1C,GAAI,IAAS,UACX,WACE,IAAI,EAWJ,GAVA,EAAK,UAAW,GACd,EAAK,EAAO,EAAW,EAAW,EAAS,OAAG,EAAW,EAAU,IAErE,EAAa,OAGM,KAFhB,EAAK,UAAW,GACf,EAAK,EAAO,EAAa,EAAW,EAAS,OAAG,EAAW,EAAU,KACpE,UACC,EAAG,eACI,EAAG,GAAG,OAEd,IAAuC,SAAS,KAAM,CACzD,MAAM,EAAM,EAAa,MACzB,EAAa,MAAW,EAAI,OAAO,eAC/B,EAAI,OAAO,iBACX,EAAI,OAAO,UACT,EAAI,OAAO,YACX,EAgBR,IAdA,EAAK,UAAW,GACd,EAAK,EAAO,EAAe,EAAc,EAAS,OAAG,EAAW,EAAU,IAGvE,IAAuC,SAAS,OACnD,EAAa,aAAkB,EAAa,QAE1C,IACF,GAGmB,KAFhB,EAAK,UAAW,GACf,EAAK,EAAO,EAAW,EAAc,EAAS,OAAG,EAAW,EAAU,KACrE,UACC,EAAG,eACI,EAAG,GAAG,QACd,GAAM,CAEX,MAAM,EAAY,IAAI,MAAM,EADN,CAAA,GAEtB,EAAK,UAAW,GACd,EAAK,EAAO,EAAY,EAAW,EAAS,OAAG,EAAW,EAAU,KAErD,IAAjB,EAAG,UAAqB,EAAG,eAAiB,EAAG,GAAG,OAClD,MAAM,QAAY,iBAChB,EACA,EACA,EACA,CAAC,GACD,EACA,EACA,GAEF,GAAI,aAAe,YAAc,EAAI,SAEnC,YADA,OAAK,EAAW,GAGlB,GAAI,aAAe,YAAc,EAAI,YAAa,CAChD,IACG,EAAqB,KAAM,GAC1B,yBAAyB,EAAI,YAAc,IAI7C,YADA,OAAK,EAAW,GAGlB,GAAI,EAAI,UACN,MAGJ,EAAK,UAAW,GACd,EAAK,EAAO,EAAM,EAAc,EAAS,OAAG,EAAW,EAAU,IAG9D,IAAuC,SAAS,OACnD,EAAa,aAAkB,EAAa,QAE9C,GAGmB,KAFhB,EAAK,UAAW,GACf,EAAK,EAAO,EAAW,EAAc,EAAS,OAAG,EAAW,EAAU,KACrE,UACC,EAAG,eACI,EAAG,GAAG,OAErB,KAjFF,GAkFK,MAAM,OACN,CAcL,IAbA,SAAU,GACR,EAAK,EAAO,EAAW,EAAW,EAAS,OAAG,EAAW,EAAU,IAErE,EAAa,MAAW,SAAU,GAChC,EAAK,EAAO,EAAa,EAAW,EAAS,OAAG,EAAW,EAAU,IACrE,OACF,SAAU,GACR,EAAK,EAAO,EAAe,EAAc,EAAS,OAAG,EAAW,EAAU,IAExE,IACF,EAAO,SAAU,GACf,EAAK,EAAO,EAAW,EAAc,EAAS,OAAG,EAAW,EAAU,IACtE,QACG,GAAM,CAEX,MAAM,EAAY,IAAI,MAAM,EADN,CAAA,GAEtB,SAAU,GACR,EAAK,EAAO,EAAY,EAAW,EAAS,OAAG,EAAW,EAAU,IAEtE,MAAM,EAAM,YACV,EACA,EACA,EACA,CAAC,GACD,EACA,EACA,GAEF,GAAI,aAAe,YAAc,EAAI,SAEnC,YADA,OAAK,EAAW,GAGlB,GAAI,aAAe,YAAc,EAAI,YAAa,CAChD,IACG,EAAqB,KAAM,GAC1B,yBAAyB,EAAI,YAAc,IAI7C,YADA,OAAK,EAAW,GAGlB,GAAI,EAAI,UACN,MAGJ,SAAU,GACR,EAAK,EAAO,EAAM,EAAc,EAAS,OAAG,EAAW,EAAU,IAEnE,EAAO,SAAU,GACf,EAAK,EAAO,EAAW,EAAc,EAAS,OAAG,EAAW,EAAU,IACtE,OAEJ,OAKN,OACE,SAAS,GAAA,EACN,OAAM,OAAM,QAAO,IAAG,IAAG,UAAS,QAAO,kBAAiB,WAAU,qBACrE,EACE,EACA,aAAa,EAAG,GAAW,EAAE,EAAI,EAAE,EACnC,EACA,EACA,EACA,EACA,EACA,KAKN,OACE,SAAS,SAAA,EACN,OAAM,OAAM,QAAO,IAAG,IAAG,UAAS,QAAO,WAAU,qBACpD,EACE,EACA,aAAa,EAAG,GAAW,EAAE,EAAI,EAAE,EACnC,EACA,EACA,OACA,EACA,EACA,KAKN,OAAmB,SAAS,aAAA,EAAiB,OAAM,IAAG,OAAQ,OAAK,EAAW,IAAI,GAAG,EAAG,KAExF,OAAmB,SAAS,OAAA,EAAW,OAAM,IAAG,OAAQ,OAAK,EAAW,IAAI,GAAG,EAAG,KAElF,OACE,SAAS,QAAA,EACN,OAAM,OAAM,QAAO,IAAG,IAAG,UAAS,QAAO,kBAAiB,WAAU,qBACrE,MAAM,EAAS,6BAA6B,wBAAwB,IACpE,EACE,EACA,EACA,EACA,EAAA,IACI,KACF,GAAoB,IAAhB,EAAK,OAEP,YADA,EAAK,EAAK,IAGZ,MAAM,EAAM,EAAK,GACb,aAAe,YAAc,EAAI,aAAe,GAC9C,yBAAyB,EAAI,YAAa,GAC5C,IAIJ,OAAK,EAAW,IAElB,qBAAqB,EAAiB,GACtC,EACA,KAKN,OACE,SAAS,OAAA,EACN,OAAM,OAAM,QAAO,IAAG,IAAG,UAAS,QAAO,kBAAiB,WAAU,qBACrE,MAAM,EAAe,qBACf,EAAgB,qBAAqB,EAAiB,GAC5D,EACE,EACA,EACA,EACA,EAAA,IACI,KACF,GAAoB,IAAhB,EAAK,OAEP,YADA,EAAK,EAAK,IAGZ,IAAI,EAAS,EAAK,GAElB,GADA,EAAS,aAAa,EAAQ,GAC1B,IAAS,SAAU,CACrB,IAAI,EACA,GAAS,EACb,IAAK,MAAM,KAAY,EACrB,GACE,IACC,GACE,EAAS,IACV,IACE,aACE,SAAU,GACR,EACE,EACA,EAAS,GACT,EACA,EACA,OACA,EACA,EACA,IAEF,OACF,IAEN,CACA,IAAK,EAAS,GAAI,SAUlB,GATA,EAAM,YACJ,EACA,EACA,EAAS,GACT,CAAC,GACD,EACA,EACA,GAEE,EAAI,YAAa,CACnB,IAAK,yBAAyB,EAAI,YAAa,GAE7C,YADA,OAAK,EAAW,GAGlB,GAAI,EAAI,UAAW,MAErB,GAAI,EAAI,SAEN,YADA,OAAK,EAAW,GAGlB,IAAK,EAAS,GAEZ,MAIN,QAEA,WACE,IAAI,EACA,GAAS,EACb,IAAK,MAAM,KAAY,EAAG,CACxB,IAAI,EACJ,GACE,IACC,GACE,EAAS,IACV,IACE,cAYmB,KAXhB,EAAK,UAAW,GACf,EACE,EACA,EAAS,GACT,EACA,EACA,OACA,EACA,EACA,KAED,UACC,EAAG,eACI,EAAG,GAAG,OACjB,IAEN,CACA,IAAK,EAAS,GAAI,SAUlB,GATA,QAAY,iBACV,EACA,EACA,EAAS,GACT,CAAC,GACD,EACA,EACA,GAEE,EAAI,YAAa,CACnB,IAAK,yBAAyB,EAAI,YAAa,GAE7C,YADA,OAAK,EAAW,GAGlB,GAAI,EAAI,UAAW,MAErB,GAAI,EAAI,SAEN,YADA,OAAK,EAAW,GAGlB,IAAK,EAAS,GAEZ,OAIN,KAvDF,GAwDK,MAAM,SAGf,EACA,EACA,KAKN,OACE,SAAS,IAAA,EACN,OAAM,OAAM,QAAO,IAAG,IAAG,UAAS,QAAO,kBAAiB,WAAU,qBACrE,MAAO,EAAW,EAAW,GAAe,EAG5C,oBACE,EAAA,IACI,KACF,MAAM,EAAiC,IAAnB,EAAQ,OACtB,EAAW,EAAc,EAAQ,QAAK,EACtC,GAAa,GAAe,EAAQ,OAAS,EAAI,EAAQ,QAAK,EAG9D,EAAA,CAA6B,EAAmB,KAChD,GAAe,EAAY,OAAS,EAEtC,oBACE,EAAA,IACI,KACF,MAAM,EAAyC,IAAvB,EAAY,OAC9B,GACH,GAAmB,EAAY,OAAS,EAAI,EAAY,QAAK,EAG5D,EACF,EAAK,EAAY,IAMjB,aAAyB,aACxB,EAAc,UAAY,EAAc,WAAa,EAAc,cAEpE,OAAK,EAAW,GAKd,EACF,EAAK,GACI,aAAyB,aAGhC,EAAc,UACd,EAAc,WACd,EAAc,cAEd,OAAK,EAAW,GAOlB,KAGJ,EACA,EACA,EACA,CAAC,IAAI,MAAM,EAAO,CAAA,IAClB,EACA,EACA,GAIE,EACF,EAAK,GACI,aAAyB,aAE9B,EAAc,UAAY,EAAc,WAAa,EAAc,cACrE,OAAK,EAAW,GAMlB,KAMN,GAAI,GAAe,aAAoB,aACrC,EAAK,QAKP,GAAI,GAAe,GAAa,EAAU,OAAS,EAAG,CACpD,MAAM,EAA8B,CAAA,EAChC,IAAW,EAAG,GAAa,GAE/B,oBACE,EAAA,IACI,KACF,MAAM,EAAqC,IAArB,EAAU,OAQhC,EAA0B,EAPC,EACvB,EAAU,GACV,EAAU,OAAS,EACjB,EAAU,QACV,IAKR,EACA,EACA,EACA,CAAC,IAAI,MAAM,EAAO,IAClB,EACA,EACA,QAIF,EAA0B,EAAa,EAAc,EAAW,IAGpE,EACA,EACA,EACA,CAAC,IAAI,MAAM,IACX,EACA,EACA,KAKN,OAAkB,SAAS,WAAA,EAAe,OAAM,OAAQ,OAAK,EAAW,EAAE,QC3e1E,IAAa,WAAb,MACE,WAAA,CACE,EACA,EACA,EACA,GAHO,KAAA,YAAA,EACA,KAAA,OAAA,EACA,KAAA,SAAA,EACA,KAAA,YAAA,EAGT,aAAI,GACF,MAAkC,UAA3B,KAAK,aAAa,KAG3B,gBAAI,GACF,MAAkC,aAA3B,KAAK,aAAa,OA+EvB,wBAAwD,GAE9D,SAAgB,wBAAwB,GACtC,YAAiB,IAAV,GAAuB,IAAU,SAAS,UAAO,EAAY,EAGtE,SAAgB,yBAAyB,GACvC,YAAc,IAAV,GAAuB,IAAU,SAAS,KAAa,GACvD,MAAM,QAAQ,KAAW,OAAO,GAC3B,EAAM,OAAQ,GAAyC,iBAAT,GAEhD,CAAC,GAGV,SAAgB,iBAAiB,EAAgB,GAAmB,GAClE,MAAO,CACL,QACA,cAAc,EACd,iBAAiB,EACjB,sBAAuB,EACvB,yBAA0B,GAI9B,SAAgB,mBAAmB,GACjC,MAAO,CACL,QACA,cAAc,EACd,iBAAiB,EACjB,uBAAuB,EACvB,0BAA0B,GAI9B,SAAgB,6BAA6B,GAC3C,GAAK,EACL,MAAO,CACL,QACA,cAAc,EACd,iBAAiB,EACjB,uBAAuB,EACvB,0BAA0B,GAI9B,SAAgB,qBACd,EACA,GAEA,OAAK,EACE,IAAK,GAAsB,wBAA0B,GADxC,EAItB,SAAgB,sBACd,EACA,GAEA,OAAO,EAAQ,OAAA,CACZ,EAAgB,IAAW,qBAAqB,EAAgB,GACjE,GAIJ,SAAgB,yBAAyB,EAA2B,GAClE,MAAoB,aAAhB,EAAO,OACJ,EAAO,kBACL,EAAO,MAAQ,EAAO,QAAU,EAAO,MAAQ,EAAO,4BAE1D,EAAO,eACL,EAAO,MAAQ,EAAO,QAAU,EAAO,MAAQ,EAAO,uBAG/D,SAAgB,sBACd,EACA,EACA,GAEA,GAAK,EACL,IAAK,IAAI,EAAI,EAAmB,OAAS,EAAG,GAAK,EAAG,IAAK,CACvD,MAAM,EAAS,EAAmB,GAClC,GAAI,EAAO,CACT,GAAI,EAAO,QAAU,EAAO,SAC5B,OAAa,aAAT,EAAsB,EAAO,gBAAkB,EAAO,cACjD,EAEF,KAET,GAAa,aAAT,EAAsB,EAAO,yBAA2B,EAAO,sBACjE,OAAO,GAMb,SAAS,aAAa,EAAoB,GACxC,MAAM,EAAgC,CAAA,EAQtC,OAPA,EAAS,QAAA,CAAS,EAAK,KACjB,EAAI,WAAW,OACjB,EAAK,EAAI,UAAU,IAAM,EAAK,MAAM,GAEpC,EAAK,GAAO,EAAK,KAGd,EAGT,SAAgB,eACd,EACA,EACA,EACA,EACA,EACA,EACA,GAAW,GAEX,GAAI,EAAQ,IAAI,QAAQ,uBACtB,MAAM,IAAI,uBAAuB,kCAEnC,IAAI,EA8BJ,OA5BE,OADW,IAAT,EACF,IAAW,KACT,MAAM,EAAO,aAAa,EAAU,GASpC,OARY,YACV,EACA,EACA,OACU,IAAV,EAAsB,GAAK,CAAC,IAAI,MAAM,EAAO,SAC7C,EACA,GAES,QAGN,YAA2C,GAChD,MAAM,EAAO,aAAa,EAAU,GASpC,OARY,YACV,EACA,EACA,OACU,IAAV,EAAsB,GAAK,CAAC,IAAI,MAAM,EAAO,EAAM,YACnD,EACA,GAES,QAGf,EAAQ,wBAAwB,GAChC,EAAQ,IAAI,mBAAmB,IAAI,GAC5B,EAGT,SAAgB,oBACd,EACA,EACA,EACA,EACA,EACA,EACA,GAAW,GAEX,GAAI,EAAQ,IAAI,QAAQ,uBACtB,MAAM,IAAI,uBAAuB,kCAEnC,IAAK,EAAQ,IAAI,oBAAoB,IAAI,QAAQ,WAC/C,MAAM,IAAI,uBAAuB,6BAEnC,IAAI,EA8BJ,OA5BE,OADW,IAAT,EACK,SAAU,KACf,MAAM,EAAO,aAAa,EAAU,GASpC,aARkB,iBAChB,EACA,EACA,OACU,IAAV,EAAsB,GAAK,CAAC,IAAI,MAAM,EAAO,SAC7C,EACA,IAES,QAGN,kBAAiD,GACtD,MAAM,EAAO,aAAa,EAAU,GASpC,aARkB,iBAChB,EACA,EACA,OACU,IAAV,EAAsB,GAAK,CAAC,IAAI,MAAM,EAAO,EAAM,YACnD,EACA,IAES,QAGf,EAAQ,wBAAwB,GAChC,EAAQ,IAAI,mBAAmB,IAAI,GAC5B,EAIT,IAAa,WAAb,MACE,WAAA,CACE,EACA,GADO,KAAA,MAAA,EACA,KAAA,SAAA,IAML,uBAAyB,OAAO,kBAEtC,SAAS,mBAAmB,GAC1B,MAAM,EACH,IAA4D,OAAO,eACnE,EAEH,IAAK,GAAqC,mBAAlB,EAAS,KAC/B,MAAM,IAAI,UAAU,iCAGtB,MAAoF,mBAAxE,EAAmD,OAAO,UAC7D,EAGF,CACL,KAAM,EAAS,KAAK,KAAK,GACzB,MAAO,EAAS,OAAO,KAAK,GAC5B,OAAQ,EAAS,QAAQ,KAAK,GAC9B,CAAC,OAAO,YACN,OAAO,OAKb,SAAS,wBAAwB,GAC/B,MAAM,EAAiB,IACrB,OAAO,mBAGT,GAAI,EACF,MAAO,CACL,KAAM,EAAc,KAAK,KAAK,GAC9B,MAAO,EAAc,OAAO,KAAK,GACjC,OAAQ,EAAc,QAAQ,KAAK,GACnC,CAAC,OAAO,iBACN,OAAO,OAKb,MAAM,EAAW,mBAAmB,GACpC,MAAO,CACL,KAAM,MAAK,GACF,EAAS,KAAK,GAEvB,WAAM,CAAM,GACV,GAA8B,mBAAnB,EAAS,MAClB,OAAO,EAAS,MAAM,GAExB,MAAM,GAER,OAAM,MAAO,GACoB,mBAApB,EAAS,OACX,EAAS,OAAO,GAElB,CAAE,MAAO,EAAe,MAAM,GAEvC,CAAC,OAAO,iBACN,OAAO,OASb,SAAU,eACR,EACA,EACA,EACA,EACA,EACA,GAGA,IAAK,OAAO,IAAiB,MAAM,QAAQ,GAAO,CAChD,MAAM,EAAQ,EACd,GAAqB,IAAjB,EAAM,QAAiB,EAAM,KAAmB,SAAS,KAC3D,OAAO,IAAI,WAAW,EAAQ,IAAI,iBAAa,GAAW,GAE5D,IAAK,MAAM,KAAQ,EAAO,CACxB,MAAM,QAAc,eAClB,EACA,EACA,EACA,EACA,EACA,GAEF,GAAI,aAAe,aAAe,EAAI,UAAY,EAAI,aAAc,OAAO,EAE3E,GAAI,OAAO,IAAU,EAAc,KAAO,SAAS,OACjD,OAAO,IAAI,WAAW,EAAQ,IAAI,YAAa,EAAI,QAAQ,GAG/D,OAAO,IAAI,WAAW,EAAQ,IAAI,iBAAa,GAAW,GAG5D,MAAO,EAAI,EAAG,GAAK,EAEnB,OAAQ,GAEN,KAAK,SAAS,MAAO,CAUnB,MAAM,QADY,oBARQ,eACxB,EACA,EACA,EACA,EACA,EACA,IAEuC,OAAQ,GAEjD,OAAO,IAAI,WAAW,EAAQ,IAAI,YAAa,GAAU,GAI3D,KAAK,SAAS,cAAe,CAU3B,MAAM,QAAyB,mBADb,oBARS,eACzB,EACA,EACA,EACA,EACA,EACA,IAEwC,OAAQ,IAElD,OAAO,IAAI,WAAW,EAAQ,IAAI,YAAa,GAAQ,GAMzD,KAAK,SAAS,GAAI,CAChB,MAAM,QAAqB,eACzB,EACA,EACA,EACA,EACA,EACA,GAEI,EAAS,SAAU,GACvB,SAAS,EAAO,EAAW,EAAO,EAAS,EAAG,EAAiB,OAAU,IACzE,OACI,EAAS,aAAa,EAAW,OAAQ,GAAW,EAAO,EAAI,EAAO,EAC5E,OAAI,QACa,eACb,EACA,EACA,EACA,EACA,EACA,GAGG,IAAI,WAAW,EAAQ,IAAI,iBAAa,GAAW,GAM5D,KAAK,SAAS,KAAM,CAClB,MACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACE,EACJ,GAAK,IAAuC,SAAS,KACnD,MAAM,IAAI,YAAY,8DAExB,MAAM,EAAuB,IACxB,yBAAyB,GAAO,IAAK,GAAc,iBAAiB,GAAW,IAClF,oBAEI,EAAc,sBAAsB,EAAiB,GACrD,EAAY,IAAI,MAAM,EAAO,CAAA,GAC7B,EAAwC,CAAE,WAAO,GACjD,EAAe,IAAI,MAAM,EAAW,GAE1C,SAAU,GACR,SAAS,EAAO,EAAW,EAAW,EAAS,OAAG,EAAW,OAAU,IAEzE,EAAa,MAAW,SAAU,GAChC,SAAS,EAAO,EAAa,EAAW,EAAS,OAAG,EAAW,OAAU,IACzE,OACF,SAAU,GACR,SAAS,EAAO,EAAe,EAAc,EAAS,OAAG,EAAW,OAAU,IAGhF,IAAI,GAAgB,EAOpB,IANI,IACF,EAAO,SAAU,GACf,SAAS,EAAO,EAAW,EAAc,EAAS,OAAG,EAAW,OAAU,IAC1E,QAGG,GAAM,CACX,MAAM,EAAY,IAAI,MAAM,EAAc,CAAA,GAC1C,SAAU,GACR,SAAS,EAAO,EAAY,EAAW,EAAS,OAAG,EAAW,OAAU,IAG1E,MAAM,QAAc,eAClB,EACA,EACA,EACA,EACA,EACA,GAGF,GAAI,EAAI,SAAU,OAAO,EACzB,GAAI,EAAI,YAAa,CACnB,IAAK,EAAqB,KAAM,GAAM,yBAAyB,EAAI,YAAc,IAC/E,OAAO,EAET,GAAI,EAAI,UAAW,MAGrB,SAAU,GACR,SAAS,EAAO,EAAM,EAAc,EAAS,OAAG,EAAW,OAAU,IAEvE,EAAO,SAAU,GACf,SAAS,EAAO,EAAW,EAAc,EAAS,OAAG,EAAW,OAAU,IAC1E,OAEJ,OAAO,IAAI,WAAW,EAAQ,IAAI,iBAAa,GAAW,GAM5D,KAAK,SAAS,IAAK,CACjB,MAAO,EAAW,EAAW,GAAe,EAC5C,IAAI,EACA,EACJ,IACE,QAAiB,eACf,EACA,EACA,EACA,EACA,EACA,SAEK,GACP,KAAI,GAAa,GAAW,OAAS,GAWnC,MAAM,EATN,QAAiB,eACf,EACA,EAHiB,IAAI,MAAM,EAAO,CAAA,CAAG,GAAY,IAKjD,EACA,EACA,WAMJ,GAAI,GAAa,OAAS,EAAG,CAC3B,MAAM,QAAa,eACjB,EACA,EACA,EACA,EACA,EACA,IAGE,EAAG,UAAY,EAAG,eACpB,EAAgB,IAItB,OAAI,GACG,EAIT,KAAK,SAAS,QAAS,CACrB,MAAM,EAAS,6BAA6B,wBAAwB,IAE9D,QAAc,eAClB,EACA,EACA,EACA,EALiB,sBAAsB,EAAiB,EAAS,CAAC,GAAU,IAO5E,GAEF,OAAI,EAAI,aAAe,GAAU,yBAAyB,EAAI,YAAa,GAClE,IAAI,WAAW,EAAQ,IAAI,YAAa,EAAI,QAAQ,GAEtD,EAUT,QAAS,CACP,IAAI,EAAkB,EACtB,MAAM,EAA0B,GAChC,OAAa,CACX,IACI,EADA,EAAkB,EAElB,GAAmB,EACnB,GAAU,EACd,MAAM,EAAA,CAAkB,EAAgB,KACtC,GAAI,EAAkB,EAIpB,OAFA,OAAc,EAAW,EAAa,SACtC,IAQF,MAJA,EAAgB,EAAG,MACnB,EAAmB,EAAG,SACtB,GAAU,EACV,IACM,wBAER,IACE,MAAM,EAAS,SAAU,GACvB,SACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IAEF,OACF,OAAI,aAAkB,WAAmB,EAClC,IAAI,WAAW,EAAQ,IAAI,YAAa,GAAQ,SAChD,GACP,IAAK,GAAW,IAAM,uBAAwB,MAAM,EACpD,MAAM,EAAwB,QACnB,mBAAmB,SACpB,EACV,EAAa,KAAK,GAClB,QAOV,SAAgB,wBACd,EACA,EACA,EACA,EACA,EACA,EACA,GAAW,GAEX,GAAI,EAAQ,IAAI,QAAQ,uBACtB,MAAM,IAAI,uBAAuB,kCAEnC,MAAM,EAAA,CAAW,EAAkB,KACjC,MAAM,EAAO,aAAa,EAAU,GAI9B,EAAe,eAAe,EAAO,EAFnB,IAAI,WAAhB,IAAV,EAAgC,KAAiC,EAA3B,EAAM,GAEe,OAAS,EAAW,GACjF,IAAI,GAAS,EAEb,SAAS,EAAM,GACb,GAAI,EAAQ,MAAO,CAAE,WAAO,EAAW,MAAM,GAC7C,IACE,MAAM,EAAI,IACV,OAAI,EAAE,MACJ,GAAS,EACF,CACL,MAAO,EAAE,iBAAiB,WAAa,EAAE,MAAM,OAAS,EAAE,MAC1D,MAAM,IAGH,CAAE,MAAO,EAAE,MAAO,MAAM,SACxB,GAEP,MADA,GAAS,EACH,GAkBV,MAdwD,CACtD,KAAK,GACI,EAAA,IAAY,EAAa,KAAK,IAEvC,OAAO,GACE,EAAA,IAAY,EAAa,OAAO,IAEzC,MAAM,GACG,EAAA,IAAY,EAAa,MAAM,IAExC,CAAC,OAAO,YACN,OAAO,QAKP,EAAO,YAA2C,GACtD,OAAO,EAAQ,KAAM,IAKvB,OAHA,OAAO,eAAe,EAAM,kBAAkB,WAC9C,EAAQ,wBAAwB,GAChC,EAAQ,IAAI,mBAAmB,IAAI,GAC5B,EAGT,SAAgB,6BACd,EACA,EACA,EACA,EACA,EACA,EACA,GAAW,GAEX,GAAI,EAAQ,IAAI,QAAQ,uBACtB,MAAM,IAAI,uBAAuB,kCAEnC,IAAK,EAAQ,IAAI,oBAAoB,IAAI,QAAQ,WAC/C,MAAM,IAAI,uBAAuB,6BAEnC,MA6DM,EAAO,YAA2C,GACtD,MA9DI,EAAW,EAAkB,KACjC,MAAM,EAAO,aAAa,EAAU,GAC9B,OACM,IAAV,EAAsB,CAAC,IAAI,MAAM,KAAM,EAAM,IAAY,CAAC,IAAI,MAAM,EAAO,EAAM,IACnF,OAAA,kBACE,MAAM,EAAqE,GAC3E,IAAI,EAAoC,KACxC,MAOM,EAAc,iBAClB,EACA,EACA,EACA,OACA,EACA,EAbI,CAAW,EAAgB,KAC/B,EAAW,KAAK,CAAE,WAAY,EAAI,iBAC9B,IACF,IACA,EAAe,QAYnB,IACI,EACA,EAFA,GAAW,EAef,IAZA,EAAY,KACT,IACC,GAAW,EACX,EAAa,EACb,OAED,IACC,GAAW,EACX,EAAY,EACZ,UAGS,CAMX,IAL0B,IAAtB,EAAW,QAAiB,SACxB,IAAI,QAAe,IACvB,EAAe,IAGZ,EAAW,OAAS,GAAG,CAC5B,MAAM,WAAE,EAAA,aAAY,GAAiB,EAAW,QAChD,IACE,MAAM,EAAe,EAAW,eACrB,wBAAwB,EAAW,aACpC,EAAW,MACrB,SAAe,EAAW,SACnB,GACP,IAAe,IAGnB,GAAI,EAAU,MAEhB,QAAkB,IAAd,EAAyB,MAAM,EACnC,OAAO,GAAY,OAtDrB,IA0DO,CAAQ,KAAM,IAKvB,OAHA,OAAO,eAAe,EAAM,uBAAuB,WACnD,EAAQ,wBAAwB,GAChC,EAAQ,IAAI,mBAAmB,IAAI,GAC5B,EAGT,SAAgB,YAAY,EAAW,EAAuB,EAAK,UACjE,QAAoB,IAAhB,EAAI,QACN,MAAM,IAAI,eAAe,UAAU,yBAErC,GAAI,EAAI,QACN,MAAM,IAAI,UAAU,oCAEtB,GAAI,EAAI,SACN,MAAM,IAAI,mBACR,UAAU,eAAgB,EAAI,KAAK,kCAGvC,GAAoB,OAAhB,EAAI,QACN,MAAM,IAAI,UAAU,iCAEtB,GAC4C,mBAAlC,EAAI,QAAgB,EAAI,QAC/B,eAAe,EAAI,QAAS,EAAI,MAEjC,MAAM,IAAI,mBACR,gCAAgC,EAAI,KAAK,2BAGlC,WAAP,EACE,eAAe,EAAI,QAAS,EAAI,QAClC,EAAQ,oBACL,IAAI,EAAI,UACP,QAAS,GAAO,EAAG,CAAE,KAAM,SAAU,KAAM,EAAI,KAAK,cACxD,EAAQ,0BACL,IAAI,EAAI,UACP,QAAS,GAAO,EAAG,CAAE,KAAM,SAAU,KAAM,EAAI,KAAK,eAEjD,eAAe,EAAI,QAAS,EAAI,OACzC,EAAQ,iBACL,IAAI,EAAI,UACP,IAAI,EAAI,KAAK,aACb,QAAS,GACT,EAAG,CACD,KAAM,aAGZ,EAAQ,uBACL,IAAI,EAAI,UACP,IAAI,EAAI,KAAK,aACb,QAAS,GACT,EAAG,CACD,KAAM,eAIZ,EAAQ,oBACL,IAAI,EAAI,UACP,QAAS,GAAO,EAAG,CAAE,KAAM,SAAU,KAAM,EAAI,KAAK,cACxD,EAAQ,0BACL,IAAI,EAAI,UACP,QAAS,GAAO,EAAG,CAAE,KAAM,SAAU,KAAM,EAAI,KAAK,eAG5D,IAAa,YAAc,IAAI,IAAI,CACjC,GAAG,KACH,GAAG,IACH,GAAG,MACH,GAAG,QACH,GAAG,OACH,GAAG,QACH,GAAG,KACH,GAAG,aAGQ,OAAb,MACE,WAAA,CACE,EACA,GADO,KAAA,IAAA,EACA,KAAA,IAAA,IAIE,aAAb,MACE,WAAA,CAAY,GAAO,KAAA,KAAA,IAGR,YAAb,MACE,WAAA,CAAY,GAAO,KAAA,KAAA,IAGR,UAAb,QAEa,GAAb,MACE,WAAA,CACE,EACA,EACA,GAFO,KAAA,EAAA,EACA,KAAA,EAAA,EACA,KAAA,MAAA,IAIE,aAAe,yBAKf,gBAAkB,CAAC,SAAU,SAAU,UAEpD,SAAgB,cAAc,GAC5B,OAAO,gBAAgB,gBAAgB,GAGzC,SAAgB,sBAAsB,GACpC,OAAO,QAKT,SAAgB,SACd,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEI,IAAS,SACX,cAAc,EAAO,EAAM,EAAM,EAAO,EAAS,EAAiB,EAAU,GAE5E,eACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,MAAM,GAIZ,SAAS,cACP,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEA,MAAM,EAAa,GACnB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CACpC,IAAI,EAAM,SAAU,GAClB,SAAS,EAAO,EAAK,GAAI,EAAO,EAAS,EAAG,EAAiB,EAAU,IACvE,OACF,GAAI,aAAe,aAAe,EAAI,UAAY,EAAI,WAAa,EAAI,cAErE,YADA,OAAK,EAAW,GAGlB,GAAI,OAAO,EAAK,KAAO,EAAK,GAAG,KAAO,SAAS,OAE7C,YADA,OAAK,EAAW,IAAI,WAAW,EAAQ,IAAI,YAAa,GAAK,IAG/D,EAAI,KAAK,GAEX,OAAK,EAAW,GAGlB,eAAe,eACb,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEA,MAAM,EAAa,GACnB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CACpC,IAAI,EACJ,IACE,IAAI,EACJ,GAGmB,KAFhB,EAAK,UAAW,GACf,UAAU,EAAO,EAAK,GAAI,EAAO,EAAS,EAAG,EAAiB,EAAU,KACvE,UACC,EAAG,eACI,EAAG,GAAG,aACZ,GAEP,YADA,EAAK,GAGP,GAAI,aAAe,aAAe,EAAI,UAAY,EAAI,WAAa,EAAI,cAErE,YADA,OAAK,EAAW,GAGlB,GAAI,OAAO,EAAK,KAAO,EAAK,GAAG,KAAO,SAAS,OAE7C,YADA,OAAK,EAAW,IAAI,WAAW,EAAQ,IAAI,YAAa,GAAK,IAG/D,EAAI,KAAK,GAEX,OAAK,EAAW,GASlB,SAAgB,UAAU,GACxB,IACI,EADA,GAAY,EAEhB,MAAM,EAAI,IAAI,QAAA,CAAc,EAAS,KACnC,EAAA,IAAa,KACS,IAAhB,EAAK,OAAc,EAAO,EAAK,KAEjC,GAAY,EACZ,EAAU,EAAK,GACf,EAAQ,CAAE,OAAQ,EAAK,UAI7B,MAAO,CACL,YACA,UACA,KAIJ,SAAgB,SAAS,GACvB,IAAI,EACA,EAKJ,GAJA,EAAA,IAAa,KACX,EAAsB,IAAhB,EAAK,OAAe,CAAE,MAAO,EAAK,SAAO,EAC/C,EAAS,EAAK,KAEZ,EAAK,MAAM,EAAI,MACnB,MAAO,CAAE,UAGX,eAAsB,UACpB,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEA,IAAI,EAAgB,EACpB,MAAM,EAAI,IAAI,QAAe,IAC3B,EAAA,IAAW,KACT,KAAgB,GAChB,OAGJ,IACG,iBACC,EACA,EACA,EACA,EACA,GACA,EACA,EACA,EACA,IAEF,OAAO,GACP,CACA,IACI,EADA,EAAK,EAAK,GAEd,IACE,IAAI,EACJ,GAGmB,KAFhB,EAAK,UAAW,GACf,UAAU,EAAO,EAAK,GAAI,EAAO,EAAS,EAAG,EAAiB,EAAU,KACvE,UACC,EAAG,eACI,EAAG,GAAG,aACZ,GAEP,YADA,EAAK,GAGP,IA2BI,EA3BA,EAAI,EACR,IACE,EAAI,aAAe,KAAO,EAAI,IAAI,GAAW,QACtC,GAEP,YADA,EAAK,GAGP,GAAI,IAAO,SAAS,cAAgB,IAAO,SAAS,aAAc,CAChE,GAAI,QAEF,YADA,OAAK,EAAW,UAGlB,EAAK,IAAO,SAAS,aAAe,SAAS,KAAO,SAAS,KAE/D,GAAI,IAAM,SACR,IAAI,IAAO,SAAS,MAAQ,IAAO,SAAS,KAE1C,YADA,OAAK,EAAW,GAGhB,OAAI,CAAA,CAIR,GAAI,IAAO,SAAS,mBAAhB,MAAqC,EAEvC,YADA,OAAK,EAAW,GAIlB,IACE,IAAI,EACJ,GAGmB,KAFhB,EAAK,UAAW,GACf,UAAU,EAAO,EAAK,GAAI,EAAO,EAAS,EAAG,EAAiB,EAAU,KACvE,UACC,EAAG,eACI,EAAG,GAAG,aACZ,GAEP,YADA,EAAK,GAGP,IAAI,EAAI,EACR,IACE,EAAI,aAAgB,KAAO,EAAK,IAAI,GAAW,QACxC,GAEP,YADA,EAAK,GAGH,IAAM,WACR,OAAI,GAEN,UAAU,CACR,KACA,KAAM,UACN,OACA,QACA,IACA,IACA,MACA,UACA,QACA,OACA,kBACA,WACA,iBACA,eAGE,EAGR,SAAgB,SACd,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEA,IACG,iBACC,EACA,EACA,EACA,EACA,GACA,EACA,EACA,EACA,IAEF,OAAO,GACP,CACA,IAAI,EAAK,EAAK,GACV,EAAM,SAAU,GAClB,SAAS,EAAO,EAAK,GAAI,EAAO,EAAS,EAAG,EAAiB,EAAU,IACvE,OACE,EAAI,aAAe,KAAO,EAAI,IAAI,GAAW,EACjD,GAAI,IAAO,SAAS,cAAgB,IAAO,SAAS,aAAc,CAChE,GAAI,QAEF,YADA,OAAK,EAAW,UAGlB,EAAK,IAAO,SAAS,aAAe,SAAS,KAAO,SAAS,KAE/D,GAAI,IAAM,SACR,IAAI,IAAO,SAAS,MAAQ,IAAO,SAAS,KAE1C,YADA,OAAK,EAAW,GAGhB,OAAI,CAAA,CAIR,GAAI,IAAO,SAAS,mBAAhB,MAAqC,EAEvC,YADA,OAAK,EAAW,GAGlB,IAAI,EAAO,SAAU,GACnB,SAAS,EAAO,EAAK,GAAI,EAAO,EAAS,EAAG,EAAiB,EAAU,IACvE,OACE,EAAI,aAAgB,KAAO,EAAK,IAAI,GAAW,EAC/C,IAAM,WACR,OAAI,GAEN,UAAU,CACR,KACA,KAAM,SACN,OACA,QACA,IACA,IACA,MACA,UACA,QACA,OACA,kBACA,WACA,iBACA,UAsBN,SAAgB,uBACd,EACA,EAAc,IAEd,MAAM,EAAU,EAAO,QAAQ,IAAI,SAC7B,MAAE,EAAA,MAAO,EAAA,QAAO,GAAY,EAClC,GAAI,EAAQ,OAAQ,CAClB,MAAM,EAAM,EAAQ,gBAAA,KAClB,EAAI,cACJ,UAAU,GAAQ,KAEpB,OAAO,UACsB,IAApB,EAAM,WAA2B,EAAM,WAAa,EAAM,MAAQ,EAAa,CACxF,MAAM,EAAQ,IAAI,mCAAmC,4BACrD,GAAI,EAAQ,IAAI,QAAQ,mBAAoB,CAC1C,MAAM,EAAM,EAAQ,gBAAA,KAClB,EAAI,cACJ,UAAU,KAEZ,EAAQ,cAAc,CACpB,KAAM,QACN,QACA,QACA,QACA,iBAGF,EAAO,KAAK,GAEd,OAAO,KACE,EAAM,WAAa,EAAM,MAAQ,EAAM,UAAW,CAC3D,MAAM,EAAM,EAAQ,gBAAA,KAClB,EAAI,cACJ,UAAU,GAAQ,KAKpB,OAHA,EAAM,WAAa,uBACnB,EAAQ,cAAc,CAAE,KAAM,UAC9B,WAAA,IAAiB,EAAQ,oBAClB,EAGT,OADA,EAAM,OAAS,GACR,EAGT,SAAS,UAAU,EAA+C,GAAQ,GACxE,MAAM,KAAE,EAAA,GAAM,EAAA,MAAI,EAAA,QAAO,EAAA,MAAS,GAAU,EACxC,GACF,EAAM,QAER,MAAM,EAAU,EAAQ,IAAI,QAE5B,IACE,GAAI,uBAAuB,GACzB,OAEF,MAAM,EAAI,IAAI,IAAI,GAClB,QAAU,IAAN,EAEF,YADA,EAAK,IAAI,0BAA0B,qBAAuB,IAG5D,EAAE,SACK,GACP,GAAI,EAAQ,IAAI,QAAQ,oBAAsB,aAAe,aAAc,CACzE,MAAM,EAAM,EAAQ,gBAAA,KAClB,EAAI,cACJ,EAAK,KAEP,EAAQ,cAAc,CACpB,KAAM,QACN,MAAO,EACP,QACA,QACA,iBAGF,EAAK,IAKX,IAAM,YAAc,IAAI,IAAI,CAC1B,SAAS,cACT,SAAS,SACT,SAAS,eACT,SAAS,KACT,SAAS,IACT,SAAS,OACT,SAAS,OACT,SAAS,aACT,SAAS,QACT,SAAS,SAGX,SAAS,iBACP,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEA,MAAM,EAAO,EAAU,UAAY,SACnC,GAAI,aAAgB,KAClB,OAAK,EAAW,EAAK,IAAI,YAChB,IAAS,SAClB,YACS,MAAM,QAAQ,KAAU,OAAO,GACpC,EAAK,KAAO,SAAS,KACvB,IAEA,SACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,WAGM,OAAO,MAER,EAAK,KAAO,SAAS,MAC9B,SACE,EACA,EACA,EAAK,GACL,EACA,IAAI,MAAM,GACV,EACA,EACA,EACA,WAEO,EAAK,KAAO,SAAS,cAC9B,SACE,EACA,EACA,EAAK,GACL,EACA,EACA,EACA,GACA,EACA,WAEO,EAAK,KAAO,SAAS,MACzB,EAEM,EAAQ,IAAI,oBAAoB,IAAI,QAAQ,WACrD,UACE,EACA,EAAK,GACL,EACA,EACA,SAAU,KACR,GAAoB,IAAhB,EAAK,OAAc,EAAK,EAAK,SAE/B,IACE,OAAK,QAAkB,aAAa,EAAK,GAAI,UACtC,GACP,EAAK,KAGX,EACA,EACA,GACA,MAAM,GAER,EAAK,IAAI,uBAAuB,iCArBhC,EAAK,IAAI,YAAY,kEAuBd,EAAK,KAAO,SAAS,OAAS,EAAK,KAAO,SAAS,cAAe,CAC3E,MAAM,EAAU,EAChB,IAAK,EAEH,OADA,EAAK,IAAI,YAAY,iEACd,EAET,MAAM,EAAa,EAAK,KAAO,SAAS,cACxC,GAAI,EACF,UACE,EACA,EAAK,GACL,EACA,EACA,SAAU,KACR,GAAoB,IAAhB,EAAK,OAIT,IAEE,EAAQ,IAAI,iBADM,aAAa,EAAK,GAAI,GACZ,GAAa,SAClC,GACP,EAAK,QAPL,EAAK,EAAK,KAUd,EACA,EACA,GACA,MAAM,QAER,IACE,MAAM,EAAM,SAAU,GACpB,SAAS,EAAO,EAAK,GAAI,EAAO,EAAS,EAAG,EAAiB,EAAU,IACvE,OAKF,EAAQ,IAAI,WAJM,aAAa,EAAK,GAIF,GAAa,SAGxC,GACP,GAAI,IAAQ,uBAAwB,MAAM,EAC1C,EAAK,aAGA,YAAY,IAAI,EAAK,IAkB9B,OAAO,EAjBP,UAAU,CACR,GAAI,EAAK,GACT,OACA,OACA,QACA,EAAG,EAAK,GACR,EAAG,EAAK,GACR,IAAK,EACL,OACA,UACA,QACA,UAAM,EACN,kBACA,WACA,kBAGK,MAlHP,OAAK,EAAW,GAoHlB,OAAO,EAET,SAAgB,YACd,EACA,EACA,EACA,EAAmB,GACnB,EACA,EACA,GAEA,OAAO,SAAU,GACf,oBACE,SACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IAEF,OAGJ,eAAsB,iBACpB,EACA,EACA,EACA,EAAmB,GACnB,EACA,EACA,GAEA,IAAI,EACJ,OAYiB,KAZT,EAAK,UAAW,GACtB,oBACE,UACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,KAED,UACC,EAAG,eACI,EAAG,GAAG,OAGnB,SAAgB,oBACd,EACA,EACA,EACA,EACA,EACA,EAAmB,GACnB,EACA,EACA,GAEA,IAAK,EAEH,YADA,IAGF,KAAM,aAAyB,OAC7B,MAAM,IAAI,YAAY,sBAExB,IACI,EADA,EAAQ,EAAQ,IAAI,YAExB,KAAQ,EAAI,EAAO,SACA,iBAAN,IAET,EADE,aAAa,MACP,EAEA,IAAI,MAAM,EAAO,EAAG,aAAa,gBAAa,EAAY,OAGlE,EAAQ,IAAI,QAAQ,QAAU,EAAQ,IAAI,cAC5C,EAAQ,IAAI,YAAc,CACxB,cAAe,IAAI,IACnB,gBAAiB,CAAA,IAGjB,IAAS,SACX,qBACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAGF,sBACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,MAAM,GAIZ,SAAS,qBACP,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEA,KAAM,aAAyB,OAAQ,MAAM,IAAI,YAAY,sBAC7D,IAAI,EAAI,EACR,IAAK,EAAI,EAAG,EAAI,EAAc,OAAQ,IAAK,CACzC,IAAI,EACA,EACJ,MAAM,EAAU,EAAc,GAC9B,IACE,SACE,EACA,EACA,EACA,EAAA,IACI,KACkB,IAAhB,EAAK,OAAc,EAAM,CAAE,MAAO,EAAK,IACtC,EAAM,EAAK,IAElB,EACA,EACA,SAEK,GACP,EAAM,CAAE,MAAO,GAEjB,GAAI,EAEF,YADA,EAAK,EAAI,OAGX,GAAI,aAAe,WAEjB,YADA,OAAK,EAAW,GAGlB,GAAI,OAAO,IAAY,EAAQ,KAAO,SAAS,OAE7C,YADA,OAAK,EAAW,IAAI,WAAW,EAAQ,IAAI,YAAa,GAAK,IAIjE,OAAK,EAAW,IAAI,WAAW,EAAQ,IAAI,iBAAa,GAAW,IAGrE,eAAe,sBACb,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEA,KAAM,aAAyB,OAAQ,MAAM,IAAI,YAAY,sBAC7D,IAAI,EAAI,EACR,IAAK,EAAI,EAAG,EAAI,EAAc,OAAQ,IAAK,CACzC,IAAI,EACA,EACJ,MAAM,EAAU,EAAc,GAC9B,UACQ,UACJ,EACA,EACA,EACA,EAAA,IACI,KACkB,IAAhB,EAAK,OAAc,EAAM,CAAE,MAAO,EAAK,IACtC,EAAM,EAAK,IAElB,EACA,EACA,SAEK,GACP,EAAM,CAAE,MAAO,GAEjB,GAAI,EAEF,YADA,EAAK,EAAI,OAGX,GAAI,aAAe,WAEjB,YADA,OAAK,EAAW,GAGlB,GAAI,OAAO,IAAY,EAAQ,KAAO,SAAS,OAE7C,YADA,OAAK,EAAW,IAAI,WAAW,EAAQ,IAAI,YAAa,GAAK,IAIjE,OAAK,EAAW,IAAI,WAAW,EAAQ,IAAI,iBAAa,GAAW,ICltDrE,SAAgB,8BAA6B,WAC3C,EAAA,YACA,EAAA,uBACA,EAAA,iBACA,EAAA,aACA,EAAA,YACA,EAAA,UACA,EAAA,UACA,EAAA,YACA,EAAA,qBACA,IAGA,MAAM,EAAS,iBACT,EAAS,eAEf,SAAS,EAAc,EAAuB,EAAkB,EAAQ,GACtE,GAAI,EAAQ,EAAU,SACpB,MAAM,IAAI,uBAAuB,qCAEnC,IAGI,EAEA,EALA,EAAQ,EACR,EAAQ,EAAK,UAAU,EAAG,GAC1B,EAAY,EAEZ,GAAQ,EAER,EAAe,CAAA,EACnB,MACG,EAAQ,EACP,EACA,EAAK,UAAU,EAAM,IAAM,EAAK,OAChC,CAAC,EAAQ,EAAQ,QACjB,OACA,OACA,EACA,IACC,QACH,GACA,CACA,GAAQ,EACR,MAAM,EAAI,EAAK,UAAU,EAAM,IAAM,EAAK,OAAO,WAEjD,GAAI,EAAE,WAAW,MACf,EAAM,MACN,YACS,EAAE,WAAW,QACtB,EAAY,EAAK,UAAU,EAAG,EAAM,IAAM,EAAK,OAC/C,EAAM,MACN,IACK,GACH,EAAM,gBAEE,EAAU,sBAAsB,KAAK,IAO1C,CACL,EAAY,EAAU,OAAS,EAAY,EAAK,UAAU,EAAG,EAAM,IAAM,EAAK,OAC9E,MARA,EAAY,EAAK,UAAU,EAAG,EAAM,IAAM,EAAK,OAC/C,EAAM,KAAO,EAAQ,GAAG,OAAS,EACjC,IACK,IACH,EAAM,KAAO,EAAQ,GAAG,OAAS,GAMrC,IAAK,EAAO,CAMV,EALW,EACT,EACA,EAAK,UAAU,EAAM,IAAM,EAAK,OAAS,sBAAsB,KAAK,KAAK,GAAG,QAAU,IACtF,EAAQ,GAEK,IACf,MAEF,EAAU,CAAA,EAGZ,OADA,EAAY,GAAa,EAAK,UAAU,EAAG,EAAM,IAAM,EAAK,OACrD,CACL,IAAK,EAAK,UAAU,EAAG,KAAK,IAAI,EAAU,IAAK,EAAU,KAAO,EAAK,OACrE,KAAM,EACN,MAAO,GAIX,EAAY,CAAC,MAAiB,IAC5B,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,GAAQ,EAC3B,EAAS,EAAuB,EAAI,IAC1C,IAAI,EAAY,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,GAAI,KACxE,MAAM,EAAK,EAAc,EAAW,EAAK,UAAU,EAAI,GAAG,SACpD,EAAY,EAAI,GAAG,OAAS,EAAI,GAAG,OAAS,EAAU,OAAS,EAErE,IAAI,EAAY,EAAG,KAAK,UAAU,GAC9B,EAAY,EAAG,MAMnB,GAJA,EAAY,EAAU,OACtB,EAAY,EAAU,OACtB,EAAY,EAAU,QAEjB,EAAU,QAAU,iBAAiB,KAAK,EAAU,YACvD,MAAM,IAAI,YAAY,oBAEE,MAAtB,EAAU,KAAK,KAAY,EAAY,EAAU,MAAM,GAAG,IACpC,MAAtB,EAAU,KAAK,KAAY,EAAY,EAAU,MAAM,GAAG,IAC9D,EAAI,SAAW,EACb,EACA,EAAmB,CACjB,GAAI,SAAS,GACb,EAAG,EAAY,EAAW,OAAW,EAAW,GAChD,EAAG,EAAmB,CACpB,GAAI,SAAS,OACb,EAAG,EAAa,EAAW,GAAW,EAAO,GAC7C,EAAG,EAAa,EAAW,GAAW,EAAO,UAMrD,EAAY,CAAC,UAAqB,IAChC,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,GAAQ,EAC3B,EAAS,EAAuB,EAAI,IACpC,EAAO,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,GAAI,KACrE,IAAI,EAAQ,EAAK,WAAW,QAAQ,IAAK,EAAI,GAAG,OAAS,EAAK,OAAS,GACvE,IAAc,IAAV,EAAc,MAAM,IAAI,YAAY,kBACxC,IAII,EAJA,EAAY,EACd,EACA,EAAU,EAAW,EAAK,UAAU,EAAQ,GAAI,GAAI,MAGtD,MAAM,EAAW,0BACX,EAAgB,eAChB,EAAsB,GAC5B,IAAI,GAAe,EACnB,MACG,EAAY,EAAS,KAAK,EAAU,cACrC,EAAc,KAAK,EAAU,aAC7B,CACA,IAAK,EACH,MAAM,IAAI,YAAY,gCAExB,GAAqB,YAAjB,EAAU,GAAkB,CAC9B,GAAI,EAAc,MAAM,IAAI,YAAY,wCACxC,GAAe,EAEjB,MAAM,EAAO,EAAU,EAAW,EAAU,UAAU,EAAU,GAAG,QAAS,CAAC,OAC7E,GAAqB,YAAjB,EAAU,KAAqB,EAAK,YAAY,OAClD,MAAM,IAAI,YAAY,gCAExB,IAAI,EAAQ,EACR,EAAK,EAAQ,EAAU,GAAG,OAAS,EAAK,OAAS,EACrD,MAAM,EAAe,SAAS,KAAK,EAAU,UAAU,GAAG,YAC1D,IAAI,EAAgB,GACpB,GAAI,EACF,GAAK,EAAa,GAAG,OACrB,EAAQ,EAAU,EAAW,EAAU,UAAU,GAAI,GAAI,KACzD,GAAK,EAAM,OAAS,EACpB,EAAQ,EAAa,EAAO,GAAW,EAAO,OACzC,CACL,MAAM,EAAW,EAAU,EAAW,EAAU,UAAU,GAAI,CAAC,IAC/D,GAAK,EAAS,OAAO,OAGd,CACL,MAAQ,EAAQ,EAAU,EAAW,EAAU,UAAU,GAAI,CAAC,KAAa,SACzE,GAAK,EAAM,QAA+C,MAArC,EAAU,KAAK,EAAI,EAAM,QAAkB,EAAI,IAChE,EAAS,KAAK,EAAU,UAAU,GAAG,eAI3C,EAAQ,EACN,EAAU,UAAU,EAAO,EAAM,IAAM,EAAU,OACjD,GACA,EACA,QAbF,EAAQ,GACR,GAAK,EAAS,OAgBlB,EAAY,EAAU,UAAU,GAChC,EAAM,KACJ,EAAuB,CACrB,GAAI,SAAS,WACb,EACmB,YAAjB,EAAU,GACN,SAAS,KACT,EAAY,EAAW,OAAM,EAAW,GAC9C,EAAG,KAIT,EAAI,SAAW,EACb,EACA,EAAmB,CACjB,GAAI,SAAS,OACb,EAAG,EAAY,EAAW,OAAM,EAAW,GAC3C,EAAG,OCtLX,SAAgB,0BAAyB,WACvC,EAAA,WACA,EAAA,YACA,EAAA,kBACA,EAAA,uBACA,EAAA,iBACA,EAAA,QACA,EAAA,aACA,EAAA,YACA,EAAA,kBACA,EAAA,UACA,EAAA,UACA,EAAA,YACA,EAAA,iBACA,EAAA,qBACA,IAEA,MAAM,EACJ,iFACI,EAA2B,0CAE3B,EAAW,EACf,CAAE,SAAU,IACZ,IAAI,WAAW,6CACf,CAAC,eAEG,EAAW,EACf,CAAE,SAAU,IACZ,IAAI,WAAW,kCACf,CAAC,eAEG,EAAc,EAAQ,CAAE,SAAU,IAAa,IAAI,WAAW,uBAAwB,CAC1F,eAEI,EAAS,EAAQ,CAAE,SAAU,IAAa,IAAI,WAAW,+BACzD,EAAgB,EAAQ,CAAE,SAAU,IAAa,IAAI,WAAW,0BAA2B,CAC/F,eAEI,EAAgB,EACpB,CAAE,SAAU,IACZ,IAAI,WAAW,kCACf,CAAC,eAEG,EAAc,EAClB,CAAE,SAAU,IACZ,IAAI,WAAW,+BAEX,EAAW,EACf,CAAE,SAAU,IACZ,IAAI,WAAW,mCACf,CAAC,eAEG,EAAW,EAAQ,CAAE,SAAU,IAAa,IAAI,WAAW,sBAAuB,CACtF,eAEI,EAAS,EAAQ,CAAE,SAAU,IAAa,IAAI,WAAW,iBACzD,EAAc,EAClB,CAAE,SAAU,IACZ,IAAI,WAAW,qCACf,CAAC,eAGH,EAAY,CAAC,MAAO,KAAM,SAAoB,IAC5C,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,GAAQ,EACjC,EAAS,EAAuB,EAAI,IAC1C,IAMI,EAEA,EARA,EAAI,EACJ,EAAsB,SAAS,KAC/B,EAAwB,GACxB,EAAoC,SAAS,KAC7C,EAAuB,SAAS,KAChC,EAAa,SAAS,KAEtB,EAAiB,SAAS,KAE9B,MAAM,EAAgC,QAAT,GAAkB,EAAI,GAAK,SAAS,KAAO,SAAS,KACjF,OAAQ,GACN,IAAK,QAAS,CACZ,EAAI,EAAK,WAAW,QAAQ,KAAO,EACnC,MAAM,EAAU,EAAU,EAAW,EAAK,UAAU,GAAI,GAAI,KAC5D,IAAK,EAAQ,YAAY,OACvB,MAAM,IAAI,YAAY,gCAExB,EAAY,EAAkB,EAAW,GACzC,EAAO,EAAU,EAAW,EAAK,UAAU,EAAI,EAAQ,OAAS,IAAI,OAC/C,MAAjB,EAAK,KAAK,KAAY,EAAO,EAAK,MAAM,GAAG,IAC/C,MAEF,IAAK,MAAO,CACV,EAAI,EAAK,WAAW,QAAQ,KAAO,EACnC,MAAM,EAAqB,GAC3B,IAOI,EACA,EARA,EAAW,EACf,IAAK,IAAI,EAAI,EAAG,EAAI,IAClB,EAAW,EAAU,EAAW,EAAK,UAAU,GAAI,CAAC,UACpD,EAAK,KAAK,EAAS,QACnB,GAAK,EAAS,OAAS,EACE,MAArB,EAAK,KAAK,EAAI,IAJG,KAQvB,GAAoB,IAAhB,EAAK,SAAiB,EAAW,EAAc,KAAK,EAAK,GAAG,aAAc,CAC5E,MAAM,EAAe,EAAK,GAAG,UAAU,EAAS,GAAG,QACnD,IAAK,EAAa,YAAY,OAC5B,MAAM,IAAI,YAAY,gCAExB,GAAoB,OAAhB,EAAS,GACX,EAAc,EAAkB,EAAW,GAC3C,EAAgB,EAAa,CAAC,EAAe,GAAiB,CAAC,EAAU,GACzE,EAAY,EACZ,EAAO,EAAa,EAAc,EAClC,EAAa,EACX,EACA,IAAI,YAAY,EAAS,IAAM,QAAU,EAAS,GAAK,mBACvD,CAAC,mBAEE,CACL,GAAI,EACF,MAAM,IAAI,YAAY,yBAExB,EAAc,EAAkB,EAAW,GAC3C,EAAgB,CAAC,EAAU,GAC3B,EAAO,EACP,EAAY,EACZ,EAAa,EACX,EACA,IAAI,YAAY,EAAS,IAAM,QAAU,EAAS,GAAK,yBACvD,CAAC,wBAIW,IAAhB,EAAK,SACJ,EAAsB,EAAyB,KAAK,EAAK,GAAG,aAC7D,CACA,MAAM,EAAU,EAAoB,GAAG,OACjC,EAAc,EAAoB,GAClC,EAA+B,MAAhB,EAAsB,IAAM,IAC3C,EAAmB,EAAoB,GAAG,OAAS,EACnD,EAAiB,EACrB,EACA,EAAK,GAAG,UAAU,EAAmB,GACrC,GACA,GAEI,EAAa,EAAc,EAAe,WAAa,EACvD,EAAa,EAAK,GACrB,UAAU,EAAmB,EAAI,EAAe,OAAS,GACzD,YACG,EAAY,uBAAuB,KAAK,EAAW,YACzD,IAAK,EAAW,MAAM,IAAI,YAAY,+BACtC,MAAM,EAAO,EAAU,GACjB,EAAW,EAAW,UAAU,EAAU,GAAG,QACnD,IAAK,EAAS,YAAY,OACxB,MAAM,IAAI,YAAY,gCAExB,MAAM,EAAc,QACpB,GAAa,OAAT,EAAe,CACjB,EAAc,EAAkB,EAAW,GAC3C,EAAgB,EAAa,CAAC,EAAe,GAAiB,CAAC,EAAU,GACzE,EAAY,EACZ,EAAO,EAAa,EAAc,EAElC,MAAM,EAAQ,EAAa,IAAI,WADV,EAAkB,EAAS,EAAY,IACH,GAAW,EAAO,GAC3E,EAAa,EAAyB,CACpC,GAAI,SAAS,cACb,EAAG,CACD,EAAQ,EAAW,IAAI,WAAW,GAAG,KAAW,oBAA+B,CAC7E,kBAEC,GAEL,EAAG,SAAS,WAET,CACL,EAAc,EAAkB,EAAW,GAC3C,EAAgB,CAAC,EAAU,GAC3B,EAAO,EACP,EAAY,EAEZ,MAAM,EAAQ,EAAa,IAAI,WADV,EAAkB,EAAS,EAAY,IACH,GAAW,EAAO,GAC3E,EAAa,EAAyB,CACpC,GAAI,SAAS,cACb,EAAG,CACD,EACE,EACA,IAAI,WAAW,GAAG,KAAW,0BAC7B,CAAC,kBAEA,GAEL,EAAG,SAAS,gBAGS,IAAhB,EAAK,OAYd,MAAM,IAAI,YAAY,+BAZM,CAC5B,MAAO,EAAU,EAAc,GAAW,EACtC,EAAS,SACX,EAAY,EAAY,EAAW,EAAU,EAAkB,IAEjE,EAAY,EAAa,OACrB,EAAkB,EAAW,GAC7B,SAAS,KACT,EAAQ,SACV,EAAO,EAAY,EAAW,OAAS,EAAW,IAGA,CAEtD,EAAO,EAAU,EAAW,EAAK,UAAU,IAAI,OAC1B,MAAjB,EAAK,KAAK,KAAY,EAAO,EAAK,MAAM,GAAG,IAC/C,MAEF,IAAK,KAAM,CACT,EAAa,SAAS,KACtB,MAAM,IAAY,EAAI,GACtB,EAAO,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,EAAU,CAAC,OAAS,CAAC,IAChF,EAAY,EACV,EACA,EACE,EACA,EAAK,UAAU,EAAK,WAAW,QAAQ,IAAK,EAAI,GAAG,OAAS,EAAK,QAAU,GAC3E,GACA,MAGJ,OAGJ,MAAM,EAAI,CACR,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEF,EAAI,SAAW,EAAiB,CAC9B,GAAI,SAAS,KACb,IACA,EAAG,EAAa,EAAM,GAAW,EAAO,OAI5C,EAAY,CAAC,SAAoB,IAC/B,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,GAAQ,EAEjC,EAAI,SAAW,EADA,EAAuB,EAAI,IAGxC,EAAkB,CAChB,GAAI,SAAS,MACb,EAAG,EACD,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,GAAI,KACxD,GACA,EACA,GAEF,EAAG,SAAS,UAKlB,EAAY,CAAC,cAAyB,IACpC,MAAM,KAAE,EAAA,IAAM,GAAQ,EAChB,EAAY,EAAK,UAAU,EAAI,GAAG,QAAQ,YAChD,GAAI,EAAU,SAAW,EAAI,GAC3B,MAAM,IAAI,YAAY,qBAAqB,EAAU,KAAK,OAE5D,EAAI,SAAW,EAAuB,CACpC,GAAI,SAAS,WACb,EAAG,EAAI,GACP,EAAI,EAAI,IAAM,SAAS,SAI3B,MAAM,EAAW,oEACX,EAAuB,sBACvB,EACJ,gTACI,EAAoB,gBAE1B,EAAY,CAAC,OAAkB,IAC7B,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,GAAQ,EAC3B,EAAO,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,GAAI,KAC/D,EAAY,EAAK,UAAU,EAAI,GAAG,OAAS,EAAK,OAAS,GAAG,WAElE,GAAI,EAAqB,KAAK,GAC5B,MAAM,IAAI,EAAW,uBAAwB,EAAK,YAGpD,MAAM,EAAgB,EAAwB,KAAK,GACnD,GAAI,EACF,MAAM,IAAI,EAAW,qBAAqB,EAAc,MAAO,EAAK,YAGtE,MAAM,EAAe,EAAkB,KAAK,GAC5C,GAAI,IAAiB,SAAS,KAAK,EAAU,UAAU,EAAa,GAAG,SACrE,MAAM,IAAI,EAAW,mBAAoB,EAAK,YAGhD,IACI,EAEA,EAHA,EAAW,EAAS,KAAK,GAEzB,EAAY,GAEZ,EAAS,EAEb,IAAK,EACH,MAAM,IAAI,EAAW,qCAAsC,EAAK,YAG9D,EAAS,GAAG,WAAW,UACzB,EAAW,EAAS,KAAK,EAAK,UAAU,EAAI,GAAG,OAAS,EAAK,OAAS,GAAG,YACzE,EAAY,EAAU,IAAM,GAC5B,EAAY,EACV,EACA,EAAK,UAAU,EAAI,GAAG,OAAS,EAAK,OAAS,EAAI,EAAU,GAAG,QAC9D,GACA,KAEF,EAAS,EAAI,GAAG,OAAS,EAAK,OAAS,EAAI,EAAU,GAAG,OAAS,EAAU,OAAS,GAEjF,EAAW,EAAS,KAAK,EAAK,UAAU,GAAQ,cACjD,EAAS,GAAG,WAAW,aAEvB,EAAc,EAAU,EAAW,EAAK,UAAU,EAAS,EAAS,GAAG,QAAS,GAAI,OAGtF,EAAc,EACZ,EACA,EAAK,UAAU,EAAI,GAAG,OAAS,EAAK,OAAS,EAAI,EAAU,GAAG,QAC9D,GACA,KAGJ,MAAM,EAAI,CACR,EACA,EAAa,EAAiB,EAAW,GAAa,GAAc,GAAW,EAAO,GACtF,EAAa,EAAiB,EAAW,GAAe,GAAc,GAAW,EAAO,IAE1F,EAAI,SAAW,EACb,EAAuB,EAAI,IAC3B,EAAgB,CACd,GAAI,SAAS,IACb,EAAG,EAAa,EAAiB,EAAW,GAAO,GAAW,EAAO,GACrE,SCvVR,SAAgB,8BAA6B,WAC3C,EAAA,YACA,EAAA,kBACA,EAAA,+BACA,EAAA,QACA,EAAA,aACA,EAAA,gBACA,EAAA,UACA,EAAA,UACA,EAAA,YACA,EAAA,yBACA,IAEA,EAAY,CAAC,yBAAoC,IAC/C,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,GAAQ,EAC3B,EAAU,EAAI,GACd,EAAc,EAAI,GAClB,EAA+B,MAAhB,EAAsB,IAAM,IAE3C,EAAiB,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,GAAI,GACzE,EAAa,EAAc,EAAe,WAAa,EAEvD,EAAa,EAAK,UAAU,EAAI,GAAG,OAAS,EAAe,OAAS,GAAG,YAC7E,IAAK,EAAW,QAAiC,MAAvB,EAAW,KAAK,GACxC,MAAM,IAAI,YAAY,qDAMxB,MAAM,EAAQ,EAAa,IAAI,WADV,EAAkB,EAAS,EAFhC,EAAU,EAAW,EAAW,UAAU,GAAG,YAAa,CAAC,IACpD,aAEkC,GAAW,EAAO,GAE3E,EAAI,SAAW,EAAyB,CACtC,GAAI,SAAS,cACb,EAAG,EACH,EAAG,SAAS,SAIhB,EAAY,CAAC,cAAyB,IACpC,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,EAAA,OAAK,GAAW,EACnC,EACO,QAAX,EAAI,GACA,SAAS,IACE,QAAX,EAAI,GACF,SAAS,IACE,UAAX,EAAI,GACF,SAAS,MACT,SAAS,SACnB,GAAK,EAAI,GAaF,CACL,MAAM,EAAW,EAAK,UAAU,EAAI,GAAG,QACvC,IAAK,EAAS,YAAY,OACxB,MAAM,IAAI,YAAY,gCAExB,EAAI,SAAW,EAAyC,CACtD,GAAI,EACJ,EAAG,EAAI,GACP,EAAG,EAAQ,EAAW,EAAU,EAAY,GAAQ,UAAM,GAAW,EAAO,UApB9E,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAI,GAAG,QACtB,EAAY,GAAQ,KACpB,EAAyC,CACvC,GAAI,EACJ,EAAG,EAAI,GACP,EAAG,SAAS,QAEd,EACA,KAeN,EACE,CAAC,WAAY,iBAAkB,gBAAiB,uBAC/C,IACC,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,EAAA,OAAK,EAAA,eAAQ,EAAA,WAAgB,GAAe,EACrE,EAAmB,aAAT,GAAgC,mBAAT,EACjC,EAAW,IAAY,EAAI,EAAI,OAAS,GACxC,GACH,GAAW,EAAI,IAAM,EAAI,GAAG,YAAY,WAAW,KAAO,SAAS,KAAO,SAAS,KAChF,EAAU,EAAI,GAAK,SAAS,KAAO,SAAS,KAClD,IAAI,EACA,EACJ,GAAa,aAAT,GAAgC,mBAAT,EAA2B,CACpD,MAAM,EAAW,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,GAAI,KACzE,EAAY,EAAS,WAAW,OAChC,EAAa,EAAI,GAAG,OAAS,EAAS,OAAS,EAC/C,MAAM,EAAa,EAAK,UAAU,GAAY,YAC9C,EAAa,EAAK,OAAS,EAAW,OAAS,OAE/C,EAAY,EAAI,IAAM,GACtB,EAAa,EAOf,MAAM,EAAiB,IALG,EACtB,EAAyB,GACtB,IAAK,GAAM,EAAE,QACb,OAAO,SACV,IAEC,GACH,EAAK,SAAS,EAAI,IAAM,IAAI,aAE9B,IAAI,GAAQ,EACZ,EAAK,QAAS,IACZ,GAAI,EAAO,MAAM,IAAI,YAAY,gDAC7B,EAAI,WAAW,SAAQ,GAAQ,KAErC,MAAM,EAAI,EACR,EACA,EAAU,EAAK,UAAU,EAAI,GAAG,QAAU,EAAK,UAAU,GACxD,EAAoB,CAAC,WAAY,GAAtB,CAAC,OAEf,IAAI,EAAW,EAAW,UAAY,EAAI,EAAE,WAE5C,MAAM,EAAW,EADA,EAAU,EAAO,EAAK,MAAM,GACa,GACpD,EAAY,EAAU,EAAS,KAAO,CAAC,EAAK,MAAO,EAAS,MAClE,EAAW,EAAS,KACpB,EAAU,QAAS,IACjB,GAAI,cAAc,IAAI,EAAI,QAAQ,UAAW,KAC3C,MAAM,IAAI,YAAY,qBAAqB,QAG/C,MAAM,EAAY,EAAU,EAAI,GAAG,OAAS,EAAE,OAAS,EAAI,EAAa,EAAE,OAAS,EACnF,EAAI,SAAW,EACb,EACA,EAAK,UAAU,GACf,EAAY,GAAQ,KACpB,EAA0D,CACxD,GAAI,EACA,SAAS,cACA,aAAT,EACE,SAAS,SACT,SAAS,eACf,EAAG,EAAU,CAAC,KAAY,GAAa,CAAC,EAAS,KAAgB,GACjE,EAAG,EAAU,MACT,EACE,IAAI,WAAW,GACf,GACA,EACA,EACI,CAAE,eAAgB,EAAG,WAAY,EAAG,UAAW,GAC/C,CACE,eAAgB,IAAgB,SAAS,KAAO,EAAiB,EAAI,EACrE,WAAY,IAAY,SAAS,KAAO,EAAa,EAAI,EACzD,UAAW,IAGnB,KAEN,EACA,KCpGR,SAAgB,2BAA0B,WACxC,EAAA,kBACA,EAAA,YACA,EAAA,4BACA,EAAA,aACA,EAAA,UACA,EAAA,QACA,EAAA,YACA,EAAA,YACA,IAEA,MAAM,EAAe,KAEf,EAAgB,CACpB,QAAS,SAAS,QAClB,IAAK,SAAS,IACd,SAAU,SAAS,SACnB,SAAU,SAAS,SACnB,OAAQ,SAAS,OACjB,OAAQ,SAAS,QAGnB,EAAY,CAAC,UAAW,MAAO,WAAY,WAAY,SAAU,UAAqB,IACpF,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,EAAA,OAAK,GAAW,EACzC,EAAU,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,CAAC,yBAGrE,GAF8B,EAAK,UAAU,EAAQ,OAAS,EAAI,GAAG,QAC1B,OAAO,WACjC,WAAW,MAC1B,MAAM,IAAI,YACR,kIAIJ,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAQ,OAAS,EAAI,GAAG,QACvC,EAAU,KACV,EAAkE,CAChE,GAAI,EAAc,GAClB,EAAG,EAAI,SACP,EAAG,EAAQ,EAAW,EAAS,EAAY,GAAQ,SAErD,EACA,KAIJ,EAAY,CAAC,kBAA6B,IACxC,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,EAAA,OAAK,GAAW,EACnC,EAAe,EAAI,IAEnB,CAAG,EAAa,GADN,EAAU,SAAS,SAAS,IAEtC,EAAwB,GACxB,EAAsB,GAC5B,IAAI,EAAa,GACb,EAAI,EAER,KAAO,EAAI,EAAY,WACmB,OAApC,EAAY,UAAU,EAAG,EAAI,GAAa,CAC5C,IAAI,EAAI,EAAI,EACR,EAAY,GACZ,GAAqB,EACzB,KAAO,EAAI,EAAY,QAA6B,MAAnB,EAAY,IAC3C,GAAa,EAAY,GACzB,IAEE,EAAI,EAAY,QAA6B,MAAnB,EAAY,IAAc,QAAQ,KAAK,KACnE,GAAqB,GAGnB,GACF,EAAY,KAAK,GACjB,EAAa,GACb,EAAY,KAAK,EAAQ,SAAS,KAClC,EAAI,EAAI,IAER,GAAc,EAAY,GAC1B,UAGF,GAAc,EAAY,GAC1B,IAGJ,EAAY,KAAK,GAEjB,MAAM,EAAe,EAAY,IAAK,GACpC,EAAwB,CACtB,GAAI,SAAS,YACb,EAAG,SAAS,KACZ,EAAG,OAAO,EAAU,QAAQ,KAAK,GAAO,MAItC,EAAmB,EAAwB,CAC/C,GAAI,SAAS,YACb,EAAG,EAAW,CACZ,GAAI,SAAS,KACb,EAAG,SAAS,KACZ,EAAG,SAAS,OAEd,EAAG,IAGL,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAI,GAAG,QACtB,EAAY,GAAQ,KACpB,EAAiB,CACf,GAAI,SAAS,KACb,EAAG,EAAI,SACP,EAAG,CAAC,KAAqB,MAE3B,EACA,KAIJ,MAAM,EAAiB,CACrB,MAAO,SAAS,gBAChB,MAAO,SAAS,gBAChB,MAAO,SAAS,eAChB,MAAO,SAAS,gBAGlB,EAAY,CAAC,qBAAgC,IAC3C,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,GAAQ,EAC3B,EAAU,EAAU,EAAW,EAAK,UAAU,GAAI,CAAC,eACzD,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAQ,OAAS,GAChC,EAAU,KACV,EAA8C,CAC5C,GAAI,EAAe,EAAI,GAAK,KAC5B,EAAG,EAAQ,EAAW,EAAS,EAAY,kBAAkB,MAC7D,EAAG,SAAS,QAEd,EACA,KAIJ,EAAY,CAAC,oBAA+B,IAC1C,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,EAAA,OAAK,GAAW,EACzC,GACE,EAAI,SAAS,KAAO,SAAS,QAC7B,EAAI,SAAS,KAAO,SAAS,QAC7B,EAAI,SAAS,KAAO,SAAS,cAC7B,EAAI,SAAS,KAAO,SAAS,aAC7B,EAAI,SAAS,KAAO,SAAS,cAC7B,EAAI,SAAS,KAAO,SAAS,WAE7B,MAAM,IAAI,YAAY,0DAExB,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAI,GAAG,QACtB,EAAY,GAAQ,KACpB,EAA4C,CAC1C,GAAI,EAAe,IAAM,EAAI,IAC7B,EAAG,EAAI,SACP,EAAG,SAAS,QAEd,EACA,KAIJ,MAAM,EAAa,CACjB,KAAM,SAAS,IACf,KAAM,SAAS,GACf,KAAM,SAAS,kBACf,WAAY,SAAS,WACrB,GAAI,SAAS,GACb,IAAK,SAAS,OACd,KAAM,SAAS,cACf,KAAM,SAAS,UACf,KAAM,SAAS,aACf,MAAO,SAAS,YAChB,KAAM,SAAS,eACf,KAAM,SAAS,cACf,KAAM,SAAS,gBACf,KAAM,SAAS,aACf,KAAM,SAAS,YACf,OAAQ,SAAS,yBACjB,MAAO,SAAS,gBAChB,MAAO,SAAS,iBAChB,MAAO,SAAS,UAChB,MAAO,SAAS,SAChB,MAAO,SAAS,yBAGlB,EAAY,CAAC,SAAU,eAAgB,qBAAgC,IACrE,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,GAAQ,EACvC,GACW,sBAAT,GACA,OAAO,EAAI,YACV,EAAI,SAAS,KAAO,SAAS,cAAgB,EAAI,SAAS,KAAO,SAAS,cAE3E,MAAM,IAAI,YAAY,wCAExB,GAAe,MAAX,EAAI,GAAY,CAClB,MAAM,EAAa,EAA4B,EAAI,UACnD,GAAI,EAAY,CACd,MAAM,EAAS,EAAK,UAAU,EAAI,GAAG,QAAQ,WACvC,EAAW,QAAQ,KAAK,SAAS,SAAS,IAAI,MAAM,KACpD,EAAe,YAAY,QAAe,OAAY,EAAkB,GAAI,EAAY,OAAc,IAM5G,YALA,EAAI,SAAW,EAAyB,CACtC,GAAI,SAAS,cACb,EAAG,EAAa,IAAI,WAAW,GAAe,GAAW,EAAO,GAChE,EAAG,SAAS,SAKlB,EAAI,SAAW,EAkBb,CACA,GAAI,EAAW,EAAI,IACnB,EAAG,EAAI,SACP,EAAG,EACD,EACA,EAAK,UAAU,EAAI,GAAG,QACtB,EAAY,WAAW,UACvB,GACA,EACA,IAAK,EAAK,UAAW,EAAI,UAAY,QAK3C,MAAM,EAAU,CACd,IAAK,SAAS,OACd,IAAK,SAAS,MACd,IAAK,SAAS,UACd,KAAM,SAAS,aACf,KAAM,SAAS,cACf,MAAO,SAAS,sBAChB,KAAM,SAAS,iBACf,KAAM,SAAS,gBACf,IAAK,SAAS,YACd,IAAK,SAAS,WACd,MAAO,SAAS,eAChB,KAAM,SAAS,SACf,MAAO,SAAS,YAChB,KAAM,SAAS,MACf,IAAK,SAAS,KACd,IAAK,SAAS,MACd,IAAK,SAAS,OACd,KAAM,SAAS,MACf,IAAK,SAAS,SACd,IAAK,SAAS,QACd,KAAM,SAAS,IACf,KAAM,SAAS,GACf,WAAY,SAAS,WACrB,GAAI,SAAS,IAGf,EACE,CACE,QACA,SACA,KACA,aACA,eACA,aACA,aACA,YACA,YACA,YAED,IACC,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,GAAQ,EACjC,EAAO,CAAC,EAAY,SAAS,MAAM,SAAU,GACnD,OAAQ,GACN,IAAK,QACH,MACF,IAAK,SACH,EAAK,KAAK,EAAY,SAAS,MAAM,QACvC,IAAK,KACH,EAAK,KAAK,EAAY,SAAS,MAAM,IACvC,IAAK,aACH,EAAK,KAAK,EAAY,SAAS,MAAM,YACvC,IAAK,eACH,EAAK,KAAK,EAAY,SAAS,MAAM,cACvC,IAAK,aACH,EAAK,KAAK,EAAY,SAAS,MAAM,YACvC,IAAK,aACH,EAAK,KAAK,EAAY,SAAS,MAAM,YACvC,IAAK,YACH,EAAK,KAAK,EAAY,SAAS,MAAM,WACvC,IAAK,YACH,EAAK,KAAK,EAAY,SAAS,MAAM,WACvC,IAAK,WACH,EAAK,KAAK,EAAY,SAAS,MAAM,UAEzC,MAAM,EAAU,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,GACpE,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAQ,OAAS,EAAI,GAAG,QACvC,EAAU,KACV,EAyBE,CACA,GAAI,EAAQ,EAAI,IAChB,EAAG,EAAI,SACP,EAAG,EAAQ,EAAW,EAAS,EAAY,SAAS,SAEtD,EACA,KAKN,EAAY,CAAC,YAAuB,IAClC,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,GAAQ,EACjC,IAAI,GAAQ,EACZ,MAAM,EAAU,EAAK,UAAU,EAAG,GAClC,IAAI,EAAa,EACjB,MAAQ,GAAS,EAAQ,OAAS,EAAK,QACrC,EAAQ,IAAM,EAAU,EAAW,EAAK,UAAU,EAAQ,OAAS,GAAI,CACrE,EAAY,SAAS,MAAM,SAC3B,IACC,IAC+B,MAA9B,EAAK,KAAK,EAAQ,QACpB,IAEA,IAEG,IACH,GAAQ,GAGZ,EAAQ,MAAQ,EAAK,MAAQ,EAC7B,MAAM,EAAY,EAAK,UAAU,EAAI,GAAG,OAAS,EAAQ,OAAS,GAClE,IAAK,EAAU,YAAY,OACzB,MAAM,IAAI,YAAY,gCAExB,EAAI,SAAW,EAAqB,CAClC,GAAI,SAAS,SACb,EAAG,EAAI,SACP,EAAG,EAAyB,CAC1B,GAAI,SAAS,aACb,EAAG,EAAY,EAAW,OAAS,EAAW,IAAK,EAAK,UAAW,EAAI,UAAY,IACnF,EAAG,EAAY,EAAW,OAAW,EAAW,IAAK,EAAK,UAAW,EAAI,UAAY,UC/a7F,SAAgB,4BAA2B,SACzC,EAAA,WACA,EAAA,YACA,EAAA,YACA,EAAA,kBACA,EAAA,kBACA,EAAA,QACA,EAAA,aACA,EAAA,YACA,EAAA,UACA,EAAA,YACA,IAIA,MAAM,EAA6C,CACjD,YAAa,MACb,aAAc,MACd,MAAO,MACP,UAAW,MACX,KAAM,OAGF,EAAc,CAClB,YAAa,SAAS,YACtB,aAAc,SAAS,aACvB,MAAO,SAAS,MAChB,UAAW,SAAS,UACpB,KAAM,SAAS,KACf,KAAM,SAAS,KACf,QAAS,SAAS,aAClB,QAAS,SAAS,cAGpB,EAAY,CAAC,cAAe,eAAgB,QAAS,YAAa,QAAmB,IACnF,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,EAAA,OAAK,GAAW,EAC/C,IAAI,EAAU,EACd,MAAM,EAAoB,GACpB,EAAuB,GAC7B,IAAI,GAAM,EACN,EAAI,EAAI,GAAG,OACf,MAAM,EAAQ,EACd,KAAO,EAAI,EAAK,SAAW,GAUzB,GATA,EAAU,EAAU,EAAW,EAAK,UAAU,GAAI,CAAC,EAAe,GAAO,OACzE,GAAK,EAAQ,OACT,EAAQ,OAAO,QACjB,EAAI,KAAK,GACT,EAAU,MAAK,IACG,gBAAT,GAA2C,MAAjB,EAAK,KAAK,KAC7C,EAAI,KAAK,GACT,EAAU,MAAK,IAEI,MAAjB,EAAK,KAAK,GACZ,GAAM,MACD,CACL,IAAK,EAAQ,OAAO,QAAmB,SAAT,EAC5B,MAAM,IAAI,YAAY,gCAExB,IAAK,EAAQ,OAAO,QAAmB,iBAAT,EAC5B,MAAM,IAAI,YAAY,sBAExB,IAGJ,MAAM,EACK,gBAAT,GAAmC,iBAAT,GAAoC,UAAT,EACjD,CAAC,QAAS,WAAY,OAAQ,oBAAqB,aAAc,UACjE,CAAC,QAAS,WAAY,OAAQ,oBAAqB,UACzD,IAAI,EAEA,EACJ,OAAQ,GACN,IAAK,QAAS,CAEZ,MAAM,EADe,EAAK,UAAU,EAAO,GAAG,OACT,WACrC,GAAI,EAAgB,WAAW,MAAQ,EAAgB,WAAW,KAAM,CACtE,MAAM,EAAa,EAAkB,GAC/B,EAAa,EAAgB,MAAM,EAAG,GAAY,OAClD,EAAe,EAAgB,MAAM,GAAY,YACvD,GAAI,EAAa,WAAW,KAAM,CAChC,MAAM,EAAS,EAAa,MAAM,GAAG,OAC/B,EAAW,QAAQ,KAAK,SAAS,SAAS,IAAI,MAAM,KACpD,EAAe,YAAY,QAAe,OAAY,EAAkB,GAAI,EAAY,OAAc,IAC5G,EAAI,EAAyB,CAC3B,GAAI,SAAS,cACb,EAAG,EAAa,IAAI,WAAW,GAAe,GAAW,EAAO,GAChE,EAAG,SAAS,OAEd,QAIN,IAAK,YAAa,CAChB,MAAM,EAAgB,EAAK,UAAU,EAAO,GAC5C,IAAK,EAAc,YAAY,OAC7B,MAAM,IAAI,YAAY,gCAExB,EAAI,EAAY,EAAW,OAAe,EAAW,IAChD,EACH,UAAW,EAAI,UAAY,IAE7B,MAEF,IAAK,OACH,EAAI,EAAI,IAAK,GAAM,EAAQ,EAAW,EAAG,IAAI,EAAM,oBAAgB,GAAW,EAAO,IACrF,MACF,IAAK,cACH,EAAI,EAAI,IAAA,CAAK,EAAG,IACd,EAAU,GACN,EAAW,CAAE,GAAI,SAAS,KAAM,EAAG,SAAS,KAAM,EAAG,SAAS,OAC9D,EAAQ,EAAW,EAAG,IAAI,EAAM,oBAAgB,GAAW,EAAO,IAExE,MACF,IAAK,eACH,EAAI,EAAI,IAAK,IAEX,IAAI,EACA,EAAqB,GACzB,GAAoB,OAHpB,EAAM,EAAI,aAGF,KAAK,GAAY,CACvB,MAAM,EAAY,EAAU,EAAW,EAAI,UAAU,GAAI,GAAI,KACvD,EAAe,EAAI,UAAU,EAAI,EAAU,OAAS,GAAG,YAE7D,GADA,EAAM,EAAQ,EAAW,EAAW,GAChC,EAAa,OAAS,GAA8B,MAAzB,EAAa,KAAK,GAC/C,EAAQ,EAAQ,EAAW,EAAa,UAAU,cACzC,EAAa,OAAS,GAA8B,MAAzB,EAAa,KAAK,IAGtD,MAAM,IAAI,YAAY,yCAFtB,EAAQ,EAAQ,EAAW,IAAI,WAAW,WAAa,EAAa,YAEN,CAEhE,OAAO,EAAuB,CAC5B,GAAI,SAAS,OACb,EAAG,EACH,EAAG,IAIP,GADA,EAAY,EAAY,YAAY,MAAM,SAAS,KAAK,YAAc,GAClE,EACF,EAAM,EAAU,GAAG,YACnB,EAAQ,EACN,EACA,IAAI,WAAW,YAAc,EAAI,WAAW,QAAQ,EAAK,UAEtD,CACL,MAAM,EAAU,EAAU,EAAW,EAAK,CAAC,OAC3C,EAAM,EAAQ,EAAW,EAAS,IAAI,EAAM,iBAExC,OAAO,IAAQ,EAAI,KAAO,SAAS,aACrC,EAAQ,GAEJ,EAAI,KAAO,SAAS,OACtB,EAAO,EAAiB,IAIxB,EADE,EAAI,OAAS,EAAQ,QAAuC,MAA7B,EAAI,KAAK,EAAQ,QAC1C,EAAQ,EAAW,EAAI,UAAU,EAAQ,OAAS,IAElD,EAAQ,EAAW,EAAS,IAI1C,OAAO,EAAuB,CAC5B,GAAI,SAAS,OACb,EAAG,EACH,EAAG,MAKX,MAAM,EACK,cAAT,EACI,EAAI,GACF,SAAS,aACT,SAAS,KACF,SAAT,EACE,EAAI,GACF,SAAS,aACT,SAAS,KACX,EAAY,GAEd,EAAc,EAElB,CACA,GAAI,EACJ,EAAG,EAAI,SACP,EAAG,IAGH,IAAa,SAAS,OACtB,IAAa,SAAS,aACtB,IAAa,SAAS,eAEtB,EAAY,OAAS,EAAK,UAAU,EAAO,GAAG,YAEhD,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAI,GACnB,EAAY,GAAQ,KACpB,GACA,EACA,KAIJ,EAAY,CAAC,MAAO,QAAmB,IACrC,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,EAAA,OAAK,GAAW,EAC/C,IAAI,EAAO,EAAI,GACX,EAAQ,EAAI,GAAG,OACf,EAAK,OACT,GAAa,QAAT,EAAgB,CACd,EAAI,KACN,EAAK,SAEP,MAAM,EAAU,EAAK,UAAU,EAAI,GAAG,QAAQ,WAAW,MAAM,EAAY,KAAK,MAAM,MACtF,IAAI,IAAW,EAAQ,OAIrB,MAAM,IAAI,YAAY,eAHtB,EAAO,EAAQ,GACf,EAAQ,EAAK,OAAS,EAAI,GAAG,eAItB,cAAc,IAAI,IAAkB,SAAT,EACpC,MAAM,IAAI,YAAY,qBAAqB,MAE7C,EAAI,SAAW,EACb,EACA,EAAK,UAAU,GACf,EAAY,GAAQ,KACpB,EAAoC,CAClC,GAAI,EAAY,GAChB,EAAG,EAAI,SACP,EAAG,KAEL,EACA,KAIJ,EAAY,CAAC,cAAe,gBAA2B,IACrD,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,EAAA,OAAK,GAAW,EAC/C,EAAI,SAAW,EAA+C,CAC5D,GAAa,gBAAT,EAAyB,SAAS,YAAc,SAAS,aAC7D,EAAG,SAAS,KACZ,EAAG,EAAQ,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,EAAY,GAAQ,UClP/E,SAAgB,wBAAuB,WACrC,EAAA,YACA,EAAA,QACA,EAAA,YACA,EAAA,UACA,EAAA,UACA,EAAA,YACA,IAEA,EAAY,CAAC,SAAU,SAAoB,IACzC,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,GAAQ,EACjC,EAAO,EAAK,UAAU,EAAI,GAAG,QACnC,GAAa,UAAT,IAAqB,EAAK,YAAY,OACxC,MAAM,IAAI,YAAY,gCAExB,EAAI,SAAW,EAA2B,CACxC,GAAa,WAAT,EAAoB,SAAS,OAAS,SAAS,MACnD,EAAG,SAAS,KACZ,EAAG,EAAY,EAAW,OAAM,EAAW,OAI/C,EAAY,CAAC,SAAU,UAAW,OAAQ,MAAO,MAAO,YAAuB,IAC7E,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,EAAA,OAAK,GAAW,EAC/C,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAI,GAAG,QACtB,EAAY,GAAQ,KACpB,EAAmD,CACjD,GACW,WAAT,EAAqB,EAAI,IAAM,SAAS,OAAS,SAAS,OAAU,SAAS,aAC/E,EAAG,SAAS,KACZ,EAAG,EAAI,IAAM,EAAI,GAAK,EAAI,MAE5B,EACA,KAIJ,EAAY,CAAC,SAAU,UAAW,SAAoB,IACpD,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,EAAA,OAAK,GAAW,EAC/C,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAI,GAAG,QACtB,EAAY,GAAQ,KACpB,EAAoD,CAClD,GACW,WAAT,EACI,SAAS,YACA,YAAT,EACE,SAAS,aACT,SAAS,WACjB,EAAG,SAAS,KACZ,EAAG,EAAI,MAET,EACA,KAIJ,EAAY,CAAC,OAAQ,SAAoB,IACvC,MAAM,UAAE,EAAA,KAAW,EAAA,KAAM,EAAA,IAAM,EAAA,OAAK,GAAW,EACzC,EAAU,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,CAAC,yBACrE,IAAK,EAAQ,YAAY,OACvB,MAAM,IAAI,YAAY,gCAExB,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAI,GAAG,OAAS,EAAQ,QACvC,EAAY,GAAQ,KACpB,EAAyB,CACvB,GAAa,SAAT,EAAkB,SAAS,KAAO,SAAS,MAC/C,EAAG,EAAQ,EAAW,GACtB,EAAG,SAAS,QAEd,EACA,KAIJ,EAAY,CAAC,SAAoB,IAC/B,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,EAAA,OAAK,EAAA,eAAQ,GAAmB,EACzD,GAAuB,IAAnB,EACF,MAAM,IAAI,YAAY,oBAExB,MAAM,EAAa,EAAI,GAAG,UAAU,SAAS,KACvC,EAAU,EAAU,EAAW,EAAK,UAAU,EAAI,GAAG,QAAS,CAAC,yBACrE,GAAI,IAAe,EAAQ,YAAY,OACrC,MAAM,IAAI,YAAY,gCAExB,EAAI,SAAW,EACb,EACA,EAAK,UAAU,EAAI,GAAG,OAAS,EAAQ,QACvC,EAAY,GAAQ,KACpB,EAAkC,CAChC,GAAI,EAAa,SAAS,cAAgB,SAAS,MACnD,EAAG,EAAQ,EAAW,GACtB,EAAG,SAAS,QAEd,EACA,KAIJ,EAAY,CAAC,OAAkB,IAC7B,MAAM,UAAE,EAAA,KAAW,EAAA,IAAM,GAAQ,EACjC,IAAI,EAAI,EAAI,GAAG,OACf,MAAM,EAAM,EAAU,EAAW,EAAK,UAAU,GAAI,QAAI,EAAW,KACnE,IAAK,EAAI,YAAY,OACnB,MAAM,IAAI,YAAY,gCAExB,GAAK,EAAI,OAAS,EAClB,MAAM,EAAO,GACb,GAAyB,MAArB,EAAK,KAAK,EAAI,GAAY,CAC5B,MAAM,EAAa,EAAU,EAAW,EAAK,UAAU,GAAI,GAAI,KAE/D,IAAI,EADJ,GAAK,EAAW,OAAS,EAEzB,IAAI,EAAI,EACR,MAAQ,EAAQ,EAAU,EAAW,EAAW,UAAU,GAAI,CAAC,QAAQ,QACrE,GAAK,EAAM,OAAS,EACpB,EAAK,KAAK,EAAM,QAGpB,EAAI,SAAW,EACb,EACA,EAAK,UAAU,GACf,EAAY,QAAQ,KACpB,EAAW,CACT,GAAI,SAAS,IACb,EAAG,EAAQ,EAAW,EAAK,EAAY,WAAW,MAClD,EAAG,EAAK,IAAK,GAAQ,EAAQ,EAAW,EAAK,EAAY,WAAW,UAEtE,EACA,KC9IN,SAAgB,kBAAkB,GAChC,2BAA2B,GAC3B,0BAA0B,GAC1B,6BAA6B,GAC7B,uBAAuB,GACvB,6BAA6B,GAC7B,yBAAyB,GCa3B,SAAS,WAA2B,GAKlC,MAAO,CAAC,EAAI,GAAI,EAAI,EAAG,EAAI,GAG7B,IAAM,SAAW,WAAiB,CAAE,GAAI,SAAS,KAAM,EAAG,SAAS,KAAM,EAAG,SAAS,OAE/E,oBAAsB,0BAE5B,SAAS,uBAAuB,EAAS,IACvC,MAAO,IAAI,EAAO,SAAS,sBAAsB,IAAK,GAAU,EAAM,IAGxE,SAAS,qBAAqC,EAAkB,GAC9D,OAAO,EAAO,YAAA,CACX,EAAS,IACR,WAAoB,CAClB,GAAI,SAAS,QACb,EAAG,EACH,EAAG,IAEP,GAIJ,IAAM,UAA+C,IAAI,IAE5C,WAAb,cAAgC,MAC9B,WAAA,CACE,EACA,GAEA,MAAM,EAAU,KAAO,EAAK,UAAU,EAAG,KAFlC,KAAA,KAAA,IAMP,SASE,MAAQ,MAED,YAAc,CACzB,SAAU,CACR,MAAO,CACL,MAAO,eACP,OAAQ,wBACR,GAAI,8BACJ,WAAY,4CACZ,aAAc,yBACd,WAAY,iBACZ,WAAY,aACZ,UAAW,mBACX,UAAW,aACX,SAAU,+CACV,kBAAmB,cAErB,KAAM,CAAC,WAAY,QAAS,OAAQ,sBAEtC,SAAU,CACR,MAAO,CACL,SAAU,mBAEZ,KAAM,CAAC,WAET,WAAY,CACV,MAAO,CACL,aAAc,qEACd,OAAQ,aAEV,KAAM,CAAC,WAAY,QAAS,OAAQ,sBAEtC,kBAAmB,CACjB,MAAO,CAAE,kBAAmB,cAC5B,KAAM,CAAC,SAET,QAAS,CACP,MAAO,CACL,KAAM,cACN,iBAAkB,aAClB,eAAgB,YAElB,KAAM,CAAC,WAAY,aAAc,UAAW,MAAO,WAAY,WAEjE,SAAU,CACR,MAAO,CACL,IAAK,KACL,QAAS,KACT,SAAU,UACV,SAAU,YACV,OAAQ,mBACR,OAAQ,oBAEV,KAAM,CAAC,WAAY,QAAS,OAAQ,sBAEtC,IAAK,CACH,MAAO,CACL,UAAW,aACX,IAAK,6BAEP,KAAM,CAAC,WAAY,aAAc,UAAW,MAAO,WAAY,WAEjE,KAAM,CACJ,MAAO,CACL,KAAM,4BAER,KAAM,CAAC,WAAY,aAAc,UAAW,MAAO,WAAY,WAEjE,MAAO,CACL,MAAO,CACL,aAAc,MACd,YAAa,MACb,OACE,uIACF,OAAQ,WACR,QAAS,WACT,MAAO,uBACP,QAAS,yBACT,KAAM,iBACN,IAAK,sBACL,oBAAqB,oDACrB,cAAe,8CACf,eAAgB,oEAChB,MAAO,0CACP,MAAO,MACP,IAAK,gBACL,SAAU,qBACV,KAAM,oBACN,MAAO,qBACP,IAAK,oBAEP,KAAM,CAAC,WAAY,UAAW,MAAO,WAAY,WAEnD,WAAY,CACV,MAAO,CACL,sBAAuB,qCACvB,WAAY,+DACZ,OAAQ,mBACR,MAAO,sBAET,KAAM,CAAC,WAAY,QAAS,OAAQ,oBAAqB,WAE3D,aAAc,CACZ,MAAO,CACL,aAAc,WAEhB,KAAM,CAAC,QAAS,SAElB,YAAa,CACX,MAAO,CACL,YAAa,WAEf,KAAM,CAAC,QAAS,SAElB,OAAQ,CAAE,MAAO,CAAA,EAAI,KAAM,IAC3B,YAAa,CACX,MAAO,CACL,SAAU,oEAEZ,KAAM,CAAC,UAAW,WAEpB,UAAW,CACT,MAAO,CACL,IAAK,wDACL,GAAI,wDACJ,MAAO,+CACP,WAAY,mDACZ,GAAI,4CACJ,IAAK,4CACL,MAAO,sCACP,OAAQ,iDAEV,KAAM,CAAC,YAIL,SAAW,CACf,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,KAGP,SAAgB,aAAa,EAAa,GACxC,IAAI,EAAgC,KACpC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,SAExB,EADa,EAAM,GACN,KAAK,IACd,GAH4B,KAKlC,OAAO,EAGT,IAAM,YAAc,IAAI,WAAW,IAE7B,aAAe,YACf,QAAU,YAAY,MAAM,MAAM,OAClC,QAAU,qDACV,UAAY,KACZ,mBAA8D,IAAI,QAClE,WAA4D,IAAI,QAStE,SAAgB,UACd,EACA,EACA,EACA,EACA,EACA,EACA,EAAuB,CAAA,EACvB,EAAQ,GAER,IAAK,EAAK,OACR,OAAO,EAET,GAAI,EAAQ,EAAU,SACpB,MAAM,IAAI,uBAAuB,qCAEnC,EAAQ,MAAQ,EAAQ,OAAS,GACjC,IAAI,GAAU,EAEd,MAAM,GADN,EAAQ,GAAS,IACS,SAAS,WAC/B,IACF,EAAQ,EAAM,OAAQ,GAAM,IAAM,YAEpC,MAAM,EAAgB,mBAAmB,IAAI,EAAK,MAAQ,GACpD,EAAQ,WAAW,IAAI,EAAK,MAAQ,IAAI,IAE9C,GADA,WAAW,IAAI,EAAK,IAAK,GACrB,GAAS,EAAM,IAAI,EAAK,MAAQ,GAClC,OAAO,EAAK,UAAU,EAAG,EAAM,IAAI,EAAK,MAAQ,GAAM,EAAK,OAE7D,IAII,EAJA,GAAS,EACT,GAAO,EACP,EAAW,GACX,GAAa,EAEb,GAAkB,EAClB,GAAc,EACd,GAAe,EACnB,IAAK,EAAI,EAAG,EAAI,EAAK,SAAW,EAAM,IAAK,CACzC,IAAI,EAAO,EAAK,KAAK,GACrB,GAAc,MAAV,GAA2B,MAAV,GAA2B,MAAV,EAAe,CACnD,GAAc,MAAV,GAA0B,MAAT,GAAqC,MAArB,EAAK,KAAK,EAAI,IAAe,MAYvD,IAAS,IAAU,EAC5B,OAAO,EAAK,UAAU,EAAG,OAb+C,CAWxE,GAVa,UACX,EACA,EAAK,UAAU,EAAI,GACnB,GACA,SACA,OACA,EACA,CAAA,EACA,EAAQ,GAEA,OAAS,EAIrB,GAAU,GAAmB,OAAT,UACX,SAAS,GAAO,CACzB,IAAK,GAAmB,EAAc,EAAI,EAAK,OAAQ,CAErD,GADA,GAAkB,EACd,EACF,MAEF,IACA,EAAW,IACX,SAKF,GAHI,GAAuB,MAAT,IAChB,GAAa,GAEX,IAAS,EAAc,CACzB,GAAO,EACP,MACK,CACL,MAAM,EAAO,UACX,EACA,EAAK,UAAU,EAAI,GACnB,GACA,OACA,OACA,EACA,CAAA,EACA,EAAQ,GAKV,GAHA,EAAM,IAAI,EAAK,MAAQ,EAAG,EAAK,KAC/B,GAAK,EAAK,OAAS,EACnB,GAAU,EACN,EAAe,CAEjB,IAAI,GACC,EAAQ,aAFD,EAAK,UAAU,GAEG,WAAY,MACxC,EAAQ,OAAS,EACjB,GAAO,aAIH,MA8ED,IAAS,SAAS,GAC3B,OAAO,EAAK,UAAU,EAAG,OA/ER,CACjB,IACI,EACA,EAFA,EAAM,EAAK,UAAU,GAAG,WAG5B,GAAI,EAAe,CACjB,IAAI,EACJ,GAAK,EAAQ,aAAa,EAAK,GAAiB,CAC9C,EAAQ,OAAS,EACjB,IACA,GAAO,EACP,OAGJ,GAAK,EAAc,QAAQ,KAAK,IAG9B,GAFA,GAAK,EAAY,GAAG,OAAS,EAC7B,EAAM,EAAK,UAAU,GAAG,WACpB,EAAe,CACjB,IAAI,EACJ,GAAK,EAAQ,aAAa,EAAK,GAAiB,CAC9C,EAAQ,OAAS,EACjB,IACA,GAAO,EACP,gBAGK,GAAY,EAAM,CAC3B,IAAI,EAA2C,KAC/C,GAAa,MAAT,GAAiB,EAAc,EAAI,EAAK,SAAW,IAAY,EAAkB,CACnF,GAAI,EACF,EAAQ,CAAC,aACA,EAAc,EAAI,EAAK,OAAQ,CACxC,GAAkB,EAClB,IACA,EAAW,IACX,SAEF,EAAO,EAAM,SAEb,GAAkB,EAEf,IACH,EAAQ,aAAa,EAAK,IAExB,IACF,GAAO,IAEJ,IAAS,EAAY,QAAQ,KAAK,MACrC,GAAa,EACT,EAAU,IACZ,GAAc,EACd,GAAe,GACN,IACL,EACF,GAAe,EAEf,EAAQ,yBAA0B,GAGlC,EAAU,GAAG,OAAS,IACxB,EAAQ,MAAM,KAAK,EAAU,IAC7B,EAAQ,YAAc,EAAU,GAC5B,EAAU,KACZ,EAAQ,SAAW,EAAU,KAG7B,EAAU,GAAG,OAAS,IACxB,GAAK,EAAU,GAAG,OAAS,IAWjC,GAPI,IACE,aAAa,KAAK,GACpB,GAAO,EAEP,GAAU,GAGV,EAAM,MAIZ,EAAW,EAEb,GAAI,EACF,MAAM,IAAI,YAAY,aAAe,EAAQ,KAK/C,OAHI,IACF,EAAQ,SAAW,GAEd,EAAK,UAAU,EAAG,GAE3B,UAAU,KAAO,CAAC,WAAY,SAAU,YAExC,IAAM,iBAAmB,CACvB,aACA,YACA,cACA,QACA,WACA,OACA,oBACA,UAGW,YAAA,CAA4C,EAAU,KACjE,EAAM,QAAS,IACb,UAAU,IAAI,EAAM,MA6BxB,SAAS,yBAAyB,GAChC,MAAM,EAAkB,GACxB,IAAI,EAAQ,EACR,EAAM,GACV,IAAK,IAAI,EAAI,EAAG,EAAI,EAAE,OAAQ,IAAK,CACjC,MAAM,EAAI,EAAE,GACF,MAAN,GAAmB,MAAN,GAAmB,MAAN,EAAW,IAC1B,MAAN,GAAmB,MAAN,GAAmB,MAAN,GAAW,IACpC,MAAN,GAAuB,IAAV,GACf,EAAM,KAAK,GACX,EAAM,IAEN,GAAO,EAIX,OADA,EAAM,KAAK,GACJ,EAGT,SAAS,oBAAoB,EAAW,GACtC,IAAI,EAAQ,EACZ,IAAK,IAAI,EAAI,EAAG,EAAI,EAAE,OAAQ,IAAK,CACjC,MAAM,EAAI,EAAE,GAGZ,GAFU,MAAN,GAAmB,MAAN,GAAmB,MAAN,EAAW,IAC1B,MAAN,GAAmB,MAAN,GAAmB,MAAN,GAAW,IAC1C,IAAM,GAAgB,IAAV,EAAa,OAAO,EAEtC,OAAO,EAGT,SAAS,kBAAkB,GACzB,IAAI,EAAQ,EACZ,IAAK,IAAI,EAAI,EAAG,EAAI,EAAE,OAAQ,IAAK,CACjC,MAAM,EAAI,EAAE,GACZ,GAAU,MAAN,GAAmB,MAAN,EAAW,aACb,MAAN,GAAmB,MAAN,KACpB,IACc,IAAV,GAAa,OAAO,EAAI,EAGhC,OAAO,EAAE,OAjEX,kBAAkB,CAChB,kBACA,sBACA,sBACA,wBACA,wBACA,oCACA,8DACA,8CACA,oCACA,wDACA,kCACA,gBACA,0BACA,wBACA,gCACA,oCACA,oBACA,oBACA,wBACA,kDACA,kCACA,4CA8CF,IAAM,gBAAkB,4BACxB,SAAS,iBAAiB,GACxB,IAAK,gBAAgB,KAAK,GAAO,MAAM,IAAI,YAAY,kCAAkC,MACzF,OAAO,EAGT,SAAS,kBAAkB,EAAiB,EAAoB,GAC9D,MAAM,EAAkB,GAExB,SAAS,IACP,MAAO,OAAO,KAAK,SAAS,SAAS,IAAI,MAAM,KAGjD,SAAS,EAAe,EAAiB,IACvC,EAAU,EAAQ,QACN,WAAW,KAOzB,SAA6B,EAAiB,GAC5C,MAAM,EAAW,yBAAyB,GAC1C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,OAAQ,IAAK,CACxC,MAAM,EAAO,EAAS,GAAG,OACzB,IAAK,EAAM,SAEX,GAAI,EAAK,WAAW,OAAQ,CAC1B,MAAM,EAAO,EAAK,MAAM,GAAG,OAC3B,GAAI,EAAK,WAAW,MAAQ,EAAK,WAAW,KAAM,CAChD,MAAM,EAAI,IACV,EAAM,KAAK,YAAY,OAAO,WAAa,MAC3C,EAAe,EAAM,QAErB,EAAM,KAAK,GAAG,KAAW,iBAAiB,QAAW,WAAa,MAEpE,MAGF,MAAM,EAAQ,oBAAoB,EAAM,KAClC,GAAmB,IAAV,EAAe,EAAK,MAAM,EAAG,GAAO,OAAS,EAAK,OAC3D,GAAuB,IAAV,EAAe,EAAK,MAAM,EAAQ,GAAG,YAAS,EAEjE,GAAI,EAAO,WAAW,MAAQ,EAAO,WAAW,KAAM,CACpD,MAAM,EAAI,IACV,EAAM,UACW,IAAf,EACI,YAAY,OAAO,KAAO,sBAAsB,KAAO,SAAS,KAChE,YAAY,OAAO,KAAO,MAEhC,EAAe,EAAQ,QAEvB,EAAM,UACW,IAAf,EACI,GAAG,KAAW,iBAAiB,QAAa,KAAO,sBAAsB,KAAO,SAAS,KACzF,GAAG,KAAW,iBAAiB,QAAa,KAAO,OAxC3D,CAAoB,EAAQ,MAAM,GAAG,GAAK,GACjC,EAAQ,WAAW,MA6ChC,SAA8B,EAAiB,GAC7C,MAAM,EAAQ,yBAAyB,GACjC,EAAqB,GAE3B,IAAK,MAAM,KAAQ,EAAO,CACxB,MAAM,EAAI,EAAK,OACf,IAAK,EAAG,SAER,GAAI,EAAE,WAAW,OAAQ,CAEvB,MAAM,EAAU,EAAM,QAAQ,GAE9B,GADgB,EAAM,MAAM,EAAU,GAAG,KAAM,GAAO,EAAG,OAAO,OAAS,GAEvE,MAAM,IAAI,YAAY,qCAExB,MAAM,EAAO,EAAE,MAAM,GAAG,OAClB,EAAW,IACX,EAAU,IACV,EAAU,IACV,EAAc,EAAS,IAAK,GAAM,GAAG,iBAAiB,QAAQ,KAAK,KACzE,EAAM,KAAK,YAAY,QAAe,MACtC,EAAM,KAAK,YAAY,UACvB,EAAM,KACJ,iBAAiB,QAAc,cAAgB,QAAc,SAAgB,KAAW,QAAc,KAAO,UAE3G,EAAK,WAAW,MAAQ,EAAK,WAAW,KAC1C,EAAe,EAAM,GAErB,EAAM,KAAK,GAAG,KAAW,iBAAiB,QAAW,KAEvD,MAGF,GAAI,EAAE,WAAW,KAAM,CAErB,IAAI,GAAe,EACf,EAAQ,EACZ,IAAK,IAAI,EAAK,EAAG,EAAK,EAAE,OAAQ,IAC9B,GAAc,MAAV,EAAE,GAAa,YACA,MAAV,EAAE,KACT,IACc,IAAV,GAAa,CACf,EAAe,EACf,MAIN,IAAqB,IAAjB,EAAqB,CACvB,MAAM,EAAe,EAAE,MAAM,EAAG,GAC1B,EAAQ,EAAE,MAAM,EAAe,GAAG,OACxC,GAAI,EAAM,WAAW,KAAM,CACzB,MAAM,EAAW,EAAM,MAAM,GAAG,OAC1B,EAAW,GAAG,KAAO,KACrB,EAAQ,oBAAoB,EAAU,KACtC,GACM,IAAV,GAAiB,EAAS,MAAM,EAAG,GAAO,OAAO,MAAM,SAEnD,EAAS,OADT,EAAS,MAAM,EAAG,GAAO,OAEzB,GACM,IAAV,GAAiB,EAAS,MAAM,EAAG,GAAO,OAAO,MAAM,cAEnD,EADA,EAAS,MAAM,EAAQ,GAAG,OAEhC,GAAI,EAAI,WAAW,MAAQ,EAAI,WAAW,KAAM,CAC9C,MAAM,EAAI,IACV,EAAM,UACO,IAAX,EACI,YAAY,OAAO,qBAA4B,QAAe,KAC9D,YAAY,OAAO,KAEzB,EAAe,EAAK,QAEpB,EAAM,UACO,IAAX,EACI,GAAG,KAAW,iBAAiB,QAAU,qBAA4B,QAAe,KACpF,GAAG,KAAW,iBAAiB,QAAU,MAKrD,SAGF,MAAM,EAAW,oBAAoB,EAAG,KACxC,IAAiB,IAAb,EAAiB,CACnB,MAAM,EAAM,iBAAiB,EAAE,MAAM,EAAG,GAAU,QAC5C,EAAW,EAAE,MAAM,EAAW,GAAG,OACvC,EAAS,KAAK,GACd,MAAM,EAAW,GAAG,KAAO,IACrB,EAAQ,oBAAoB,EAAU,KACtC,GAAqB,IAAV,EAAe,EAAS,MAAM,EAAG,GAAO,OAAS,EAAS,OACrE,EAAkB,EAAS,WAAW,MAAQ,EAAS,WAAW,KAClE,EAAM,EAAkB,EAAS,OAAS,EAC1C,EACH,IAA6B,IAAV,OAAkD,EAAnC,EAAS,MAAM,EAAQ,GAAG,OAE/D,GAAI,EAAI,WAAW,MAAQ,EAAI,WAAW,KAAM,CAC9C,MAAM,EAAS,kBAAkB,GAC3B,EAAe,EAAI,MAAM,EAAG,GAC5B,EAAW,EAAI,MAAM,GAAQ,OAC7B,EAAY,EAAS,WAAW,KAAO,EAAS,MAAM,GAAG,YAAS,EAClE,EAAI,IACV,EAAM,UACU,IAAd,EACI,YAAY,OAAO,qBAA4B,QAAe,KAC9D,YAAY,OAAO,KAEzB,EAAe,EAAc,QAE7B,EAAM,UACO,IAAX,EACI,GAAG,KAAW,iBAAiB,QAAU,qBAA4B,QAAe,KACpF,GAAG,KAAW,iBAAiB,QAAU,KAGjD,SAGF,MAAM,EAAQ,oBAAoB,EAAG,KACrC,IAAc,IAAV,EAAc,CAChB,MAAM,EAAO,iBAAiB,EAAE,MAAM,EAAG,GAAO,QAC1C,EAAa,EAAE,MAAM,EAAQ,GAAG,OACtC,EAAS,KAAK,GACd,EAAM,KACJ,GAAG,KAAW,OAAU,KAAO,qBAAwB,KAAO,QAAW,WAG3E,iBAAiB,GACjB,EAAS,KAAK,GACd,EAAM,KAAK,GAAG,KAAW,OAAO,KAAO,MA5KzC,CAAqB,EAAQ,MAAM,GAAG,GAAK,GAiL/C,MAAM,EAAW,IAGjB,OAFA,EAAM,QAAQ,OAAO,QAAe,MACpC,EAAe,EAAY,GACpB,EAAM,KAAK,MAGpB,SAAS,4BAA4B,GACnC,IAAK,OAAO,GAAO,OAAO,KAC1B,MAAM,EAAU,EAAwB,QAAQ,OAChD,OAAI,IAAW,EAAO,WAAW,MAAQ,EAAO,WAAW,MAClD,EAEL,EAAK,KAAO,SAAS,MAChB,4BAA4B,EAAK,IAEnC,KAGT,SAAS,+BACP,EACA,GAEA,MAAM,EAAqB,GACrB,EAAU,EAAK,IAAA,CAAK,EAAK,KAC7B,MAAM,EAAI,EAAI,OACd,GAAI,EAAE,WAAW,MAAQ,EAAE,WAAW,KAAM,CAC1C,MAAM,EAAW,OAAO,IAElB,EAAS,kBAAkB,GAC3B,EAAc,EAAE,MAAM,EAAG,GACzB,EAAW,EAAE,MAAM,GAAQ,OACjC,GAAI,EAAS,WAAW,KAAM,CAC5B,MAAM,EAAa,EAAS,MAAM,GAAG,OAErC,EAAS,KACP,kBACE,QACA,EACA,GAAG,qBAA4B,QAAe,YAIlD,EAAS,KAAK,kBAAkB,QAAS,EAAa,IAExD,OAAO,EAGT,MAAM,EAAQ,oBAAoB,EAAG,KACrC,IAAc,IAAV,IAAiB,EAAE,WAAW,OAAQ,CACxC,MAAM,EAAY,EAAE,MAAM,EAAG,GAAO,OAC9B,EAAa,EAAE,MAAM,EAAQ,GAAG,OAEtC,OADA,EAAS,KAAK,OAAO,oBAA4B,QAAgB,MAC1D,EAET,OAAO,IAET,OAAwB,IAApB,EAAS,OAAqB,CAAE,KAAM,EAAS,KAAM,GAClD,CAAE,KAAM,EAAS,KAAM,EAAS,KAAK,MAAQ,KAAO,GAG7D,SAAS,QACP,EACA,EACA,EACA,EACA,GAAW,EACX,EAAyB,CAAE,eAAgB,EAAG,WAAY,EAAG,UAAW,IAExE,GAAI,EAAS,UAAY,EAAU,SACjC,MAAM,IAAI,uBAAuB,qCAEnC,MAAM,eAAE,EAAA,WAAgB,EAAA,UAAY,GAAc,EAGlD,GAFA,EAAW,GAAY,SACvB,EAAW,GAAY,YAAY,WAAW,UACjC,IAAT,EAAoB,OAAO,EAG/B,MAAM,GADN,EAAO,EAAK,aACK,WACjB,IAAK,EAAK,SAAW,EAAS,SAAS,UACrC,MAAM,IAAI,YAAY,gCAExB,IAAK,EAAK,OAAQ,OAAO,EAEzB,MAAM,EAAuB,CAC3B,YACA,KAAM,GACN,OACA,IAAK,GACL,OAAQ,GACR,WACA,iBACA,aACA,aAGF,IAAI,EACJ,IAAK,MAAM,KAAU,EACnB,GAAe,WAAX,EAAJ,CAGA,IAAK,MAAM,KAAQ,YAAY,GAAQ,MACrC,GAAa,WAAT,IAGC,EAAM,YAAY,GAAQ,MAAM,GAAM,KAAK,IAAO,CACrD,SAAW,EAKX,EAAI,KAAO,EACX,EAAI,KAAO,EACX,EAAI,IAAM,EACV,EAAI,OAAS,EACb,IACE,UAAU,IAAI,EAAd,GAAsB,SACf,GACP,GAAI,GAAY,aAAa,YAC3B,MAAM,IAAI,WAAW,EAAE,QAAS,GAElC,MAAM,EAER,MAGJ,GAAI,EAAK,KA3BP,CA8BJ,IAAK,GAAO,EAAK,OAAQ,CACvB,GAAI,EACF,MAAM,IAAI,WAAW,0BAA0B,aAAa,EAAK,KAAK,KAAM,GAE9E,MAAM,IAAI,YAAY,0BAA0B,aAAa,EAAK,KAAK,MAEzE,OAAO,EAAI,SAGb,IAAM,8BAAgC,iBAAiB,OAAQ,GAAY,cAAN,GAErE,SAAS,YACP,EACA,EACA,EACA,EAAyB,CAAE,eAAgB,EAAG,WAAY,EAAG,UAAW,IAExE,GAAI,EAAS,UAAY,EAAU,SACjC,MAAM,IAAI,uBAAuB,qCAEnC,IAAK,EAAI,YAAY,OAAQ,OAAO,SACpC,MAAM,EAA+B,GACrC,IAAI,EACA,EAAM,EAEV,IADA,EAAW,GAAY,YAAY,WAAW,MACjC,SAAS,cAChB,aAAa,EAAI,WAAY,OAAO,OAAO,YAAY,UAAU,QACnE,OAAO,QAAQ,EAAW,EAAK,CAAC,kBAAc,GAAW,EAAM,GAInE,IADI,IAAa,mBAAkB,EAAW,gCACtC,EAAM,UAAU,EAAW,EAAI,UAAU,GAAM,CAAC,QAAQ,QAC9D,EAAe,KAAK,EAAI,aACxB,GAAO,EAAI,OAAS,EAEtB,GAA8B,IAA1B,EAAe,OACjB,OAAO,QAAQ,EAAW,EAAK,OAAU,GAAW,EAAM,GAE5D,GAAI,EAAS,SAAS,cAAe,CACnC,MAAM,EAAU,YAAY,WAAW,MAAM,WAAW,KAAK,EAAe,GAAG,YAC/E,GAAI,EACF,OAAO,WAAyB,CAC9B,GAAI,SAAS,cACb,EAAG,EAAe,IAAA,CAAK,EAAK,IAC1B,QACE,EACA,EAAI,IAAI,WAAW,EAAS,GAAK,IAAM,GAAO,EAC9C,CAAC,mBACD,GACA,EACA,IAGJ,EAAG,SAAS,UAEL,YAAY,WAAW,MAAM,OAAO,KAAK,EAAe,GAAG,YACpE,OAAO,QAAQ,EAAW,EAAK,OAAU,GAAW,EAAM,GAG9D,MAAM,EAAQ,EAAe,IAAK,GAChC,QAAQ,EAAW,EAAK,OAAU,GAAW,EAAM,IAErD,OAAO,WAAuB,CAAE,GAAI,SAAS,WAAY,EAAG,EAAO,EAAG,SAAS,OAGjF,SAAgB,kBAAkB,EAAuB,GACvD,OAAO,WAAmB,CACxB,GAAI,SAAS,OACb,EAAG,SAAS,KACZ,EAAG,YAAY,EAAW,KAI9B,SAAgB,aACd,EACA,EACA,GAAa,EACb,EAAyB,CAAE,eAAgB,EAAG,WAAY,EAAG,UAAW,IAGxE,KADA,EAAM,iBAAiB,EAAW,IACzB,OAAO,OAAQ,MAAO,GAC/B,MAAM,EAAsB,GAC5B,IAAI,EACA,EAAM,EACN,EAAQ,EACR,EAAuB,CAAA,EACvB,GAAU,EACV,GAAa,EACjB,MACG,EAAO,UACN,EACA,EAAI,UAAU,GACd,CAAC,gBACD,OACA,OACA,EACA,IACC,SAEH,KAAgB,EAAI,KAAK,EAAM,EAAK,SAA2C,MAAhC,EAAI,KAAK,EAAM,EAAK,SACnE,GAAO,EAAK,QAAU,EAAa,EAAI,GACnC,oBAAoB,KAAK,EAAI,UAAU,GAAK,aAG9C,EAAQ,OAAU,SAAS,OAC3B,qBAAqB,KAAK,EAAI,UAAU,GAAK,YAH7C,GAAU,GAOV,GAAU,EACV,EAAM,KAAK,EAAI,UAAU,EAAO,GAAO,EAAa,EAAI,KACxD,EAAQ,GAEV,EAAU,CAAA,GACN,KAKN,OAHI,GACF,EAAM,KAAK,EAAI,UAAU,EAAO,GAAO,EAAa,EAAI,KAEnD,EACJ,IAAK,GAAQ,EAAI,aACjB,OAAQ,GAAQ,EAAI,QACpB,IAAK,GACG,YAAY,EAAW,EAAI,YAAa,iBAAkB,IAIvE,SAAgB,gBACd,EACA,EACA,GAAa,EACb,EAAyB,CAAE,eAAgB,EAAG,WAAY,EAAG,UAAW,IAExE,IAAK,EAAI,OAAO,OAAQ,MAAO,GAC/B,MAAM,EAAO,aAAa,EAAK,EAAW,EAAY,GAEtD,OADA,MAAM,GACC,EAGT,SAAS,MAAM,EAAgB,EAAc,IAC3C,GAAI,OAAO,GAAO,CAChB,IAAK,OAAmB,GAAO,OAAO,EACtC,MAAO,EAAI,EAAG,GAAK,EACnB,GACE,IAAO,SAAS,SAChB,IAAO,SAAS,KAChB,IAAO,SAAS,IAChB,IAAO,SAAS,MAChB,IAAO,SAAS,OAEhB,MAAM,EAAG,GACT,MAAM,EAAG,WACA,IAAO,SAAS,IACzB,EAAI,KAAK,WAAW,CAAE,GAAI,SAAS,IAAQ,IAAG,EAAG,SAAS,gBACjD,IAAO,SAAS,UAAY,EAAE,GAEvC,OADA,EAAI,KAAK,IACF,UAEA,MAAM,QAAQ,GAAO,CAC9B,MAAM,EAAwB,GAC9B,IAAK,MAAM,KAAM,EACV,MAAM,EAAI,IACb,EAAI,KAAK,GAGT,EAAI,SAAW,EAAK,SACtB,EAAK,OAAS,EACd,EAAK,QAAQ,KAAQ,IAGzB,OAAO,EAGT,IAAM,oBAAsB,yDAEtB,YAAc,2EAgBpB,SAAgB,iBAAiB,EAAuB,GACtD,IAAI,EAAO,EACP,EAAM,YACN,EAAuB,CAAA,EACvB,GAAiB,EACrB,MAAM,EAAW,mBAAmB,IAAI,EAAI,MAAQ,IAAI,MAAM,EAAI,IAAI,IAAI,QAC1E,MACG,EAAM,UAAU,EAAW,EAAM,QAAI,OAAW,EAAW,CAAC,aAAc,IAAU,QACrF,CACA,IAAI,GAAQ,EACR,EAAO,EACP,EAAO,EAAI,OACf,GAAI,EAAQ,OAAQ,CAClB,GAAQ,EACR,MAAM,CAAA,CAAK,EAAA,CAAA,CAAO,GAAK,EAAQ,OAG/B,GAFA,EAA6B,OAAtB,EAAQ,OAAO,IAAqC,OAAtB,EAAQ,OAAO,GAAc,EAAI,OAAS,EAAI,EAAI,OACvF,EAAO,EAAK,UAAU,EAAG,GACrB,EAAG,CACL,MAAM,EAAM,oBAAoB,KAAK,EAAK,UAAU,EAAI,OAAS,GAAG,YAChE,EACa,UAAX,EAAI,GACmB,OAArB,EAAQ,UACV,GAAQ,EACR,GAAiB,GAEjB,GAAQ,EAGV,GAAQ,EAGW,aAArB,EAAQ,UACiB,MAAzB,EAAQ,OAAO,GAAG,IACc,MAAhC,EAAQ,OAAO,GAAG,OAAM,KAExB,GAAQ,QAED,IACL,GAAuC,UAArB,EAAQ,UAC5B,GAAQ,EACR,GAAiB,GAEI,OAArB,EAAQ,UACa,UAArB,EAAQ,UACa,QAArB,EAAQ,UACa,SAArB,EAAQ,WAER,IAAU,EAAQ,0BAIpB,IACF,EAAS,EAAK,MAAO,GAEvB,EAAO,EAAK,UAAU,GACtB,EAAU,CAAA,EAGZ,OADA,mBAAmB,IAAI,EAAI,IAAK,GACzB,EAGT,SAAgB,WAAW,GACzB,IAAI,EAAI,EACJ,GAAS,EACT,GAAO,EACP,GAAS,EACb,KAAO,EAAI,EAAI,SAAW,IAAS,GACjC,EAAkB,MAAX,EAAI,KAAe,EAC1B,EAAoB,OAAX,EAAI,KAAgB,EAC7B,EAAoB,OAAX,EAAI,GACb,IAEF,MAAM,EAAQ,EAAI,UAAU,GAE5B,GADA,EAAS,IAAW,GAAQ,SAAS,KAAK,GACtC,EAAQ,OAAO,KACnB,MAAM,EAAQ,UAAU,KAAK,GAC7B,GAAI,YAAY,KAAK,EAAI,UAAU,EAAI,EAAO,GAAG,SAC/C,OAAO,KAET,MAAM,EAAe,EAAI,UAAU,EAAG,EAAI,GACpC,EAAc,GAAS,EAAM,IAAO,GAC1C,IACE,IAAI,OAAO,EAAc,SAClB,GACP,GAAI,aAAa,YAAa,MAAM,EAEtC,MAAO,CACL,MAAO,EACP,MAAO,EACP,OAAQ,GAAM,GAAS,EAAM,GAAG,QAAW,IAI/C,IAAM,UAAY,gEACZ,eAAiB,2BACvB,SAAgB,iBACd,EACA,EACA,EAAmB,GACnB,EAAQ,GAER,GAAI,EAAQ,EAAU,SACpB,MAAM,IAAI,uBAAuB,qCAEnC,IAAI,EAGA,EAFA,EAA+B,GAC/B,GAAS,EAET,EAAU,GACV,GAAe,EACf,EAAmB,GACnB,EAAO,GACX,MAAM,EAA8B,GAC9B,EAAuB,GAC7B,IAAI,EAA2C,KAC3C,EAAI,EACR,IAAK,EAAI,EAAG,EAAI,EAAI,OAAQ,IAE1B,GADA,EAAO,EAAI,GACP,EACE,IAAS,IACK,MAAZ,GAAkC,MAAf,EAAI,EAAI,IAC7B,EAAU,GACV,KACqB,OAAZ,IACT,EAAU,GACV,EAAO,KAAK,YAGX,CACL,GAAI,EAAQ,CACV,GAAS,EACT,EAAQ,KAAK,GACb,SAGF,GAAI,EACF,GAAc,MAAV,GAA0B,MAAT,GAA+B,MAAf,EAAI,EAAI,GAAY,CACvD,MAAM,EAAO,iBAAiB,EAAW,EAAI,UAAU,EAAI,GAAI,IAAK,EAAQ,GAC5E,IAAK,EAAK,IAAI,OAAO,OACnB,MAAM,IAAI,YAAY,gCAExB,EAAO,KAAK,EAAK,KACjB,EAAQ,KAAK,KAAM,EAAO,OAAS,EAAG,KACtC,GAAK,EAAK,OAAS,UACV,IAAU,EAAM,CACzB,GAAc,MAAV,EAAe,CACjB,MAAM,EAAK,WAAoB,CAC7B,GAAI,SAAS,QACb,EAAG,MAAM,EAAQ,KAAK,KACtB,EAAG,KAEL,EAAG,cAAgB,EACnB,EAAU,SAAS,KAAK,GACxB,EAAO,KAAK,IAAM,EAAU,SAAS,OAAS,EAAG,UAEjD,EAAU,QAAQ,KAAK,MAAM,EAAQ,KAAK,MAC1C,EAAO,KAAK,IAAK,EAAU,QAAQ,OAAS,EAAG,KAEjD,EAAQ,KACR,EAAU,QAEV,EAAQ,KAAK,OAEV,CACL,GAAa,MAAT,GAAyB,MAAT,GAAyB,MAAT,EAClC,EAAS,GACT,EAAQ,UACC,SAAS,KAAsB,IAAS,EAAW,OAC5D,MAAO,CAAE,IAAK,EAAO,KAAK,IAAK,OAAQ,GAC9B,SAAS,IAClB,EAAW,KAAK,GAChB,EAAO,KAAK,IACH,SAAS,EAAW,EAAW,OAAS,MAAQ,GACzD,EAAW,MACX,EAAO,KAAK,IACM,MAAT,GAAgC,MAAf,EAAI,EAAI,IAA6B,MAAf,EAAI,EAAI,GAI/C,MAAT,IACC,IACA,EAAa,WAAW,EAAI,UAAU,MAEvC,EAAU,QAAQ,KAAK,GACvB,EAAO,KAAK,IAAK,EAAU,QAAQ,OAAS,EAAG,MAC/C,GAAK,EAAW,OAAS,GAEzB,EAAO,KAAK,IAXZ,EAAyB,MAAf,EAAI,EAAI,GAAa,IAAM,KACrC,EAAe,EAUE,CAGd,GAAqB,MAAM,KAAK,KAC9B,EAAmB,eAAe,KAAK,EAAI,UAAU,MACpD,UAAU,KAAK,EAAI,UAAU,EAAG,EAAI,EAAiB,GAAG,WAC1D,EAAmB,MAK3B,KAAY,GAAkB,OAAT,GAIzB,GAAI,EACF,MAAM,IAAI,YAAY,aAAa,MAErC,GAAI,GACc,MAAZ,EACF,MAAM,IAAI,YAAY,0BAA0B,EAAI,UAAU,MAGlE,MAAO,CAAE,IAAK,EAAO,KAAK,IAAK,OAAQ,GAGzC,SAAwB,MACtB,EACA,GAAQ,EACR,GAAa,EACb,EAA0B,KAE1B,GAAoB,iBAAT,EAAmB,MAAM,IAAI,WAAW,gBAAgB,IAAQ,OAAO,IAClF,IAAI,EAAM,IAAM,EAChB,MAAM,EAAwB,CAC5B,QAAS,GACT,SAAU,GACV,QAAS,GACT,QACA,SAAU,GAEZ,EAAM,iBAAiB,EAAW,GAAK,IAEvC,IAAK,MAAM,KAAK,EAAU,SACxB,EAAE,GAAK,EAAE,cAAe,IAAK,GAAe,YAAY,EAAW,IAAI,WAAW,YAC3E,EAAE,cAEX,MAAO,CAAE,KAAM,gBAAgB,IAAI,WAAW,GAAM,EAAW,GAAa,aC5sC9E,SAAgB,oBACd,MAAO,CACL,gCACA,0CACA,kDACA,4DACA,gCACA,4BACA,wCACA,0CACA,4CACA,8CACA,iCAIJ,SAAgB,gBAAgB,GAC9B,OAAO,qBAAqB,EAAQ,IAAI,gBAG1C,SAAS,KAAK,CACd,SAAgB,gBAAgB,GAE9B,OADA,gBAAgB,UAAY,GAAG,UACxB,gBACP,SAAS,mBAAmB,GAE1B,MAAM,EAAS,MADF,EAAO,OAAS,IACF,GAAO,EAAO,EAAQ,IAAI,QAAQ,yBAC7D,OAAO,eACL,EACA,EAAO,KACP,EAAQ,IAAI,MACZ,IACK,EACH,UAAW,EAAO,UAClB,KAAM,EAAO,WAEf,EACA,cAMN,SAAS,MAAM,CACf,SAAgB,qBAAqB,GAEnC,OADA,qBAAqB,UAAY,IAAI,UAC9B,qBACP,SAAS,wBAAwB,GAE/B,MAAM,EAAS,MADF,EAAO,OAAS,IACF,GAAO,EAAO,EAAQ,IAAI,QAAQ,yBAC7D,OAAO,oBACL,EACA,EAAO,KACP,EAAQ,IAAI,MACZ,IACK,EACH,UAAW,EAAO,UAClB,KAAM,EAAO,WAEf,EACA,cASN,SAAS,MAAM,CACf,SAAgB,yBAAyB,GAEvC,OADA,yBAAyB,UAAY,IAAI,UAClC,yBACP,SAAS,4BAA4B,GAEnC,MAAM,EAAS,MADF,EAAO,OAAS,IACF,GAAO,EAAO,EAAQ,IAAI,QAAQ,yBAC7D,OAAO,wBACL,EACA,EAAO,KACP,EAAQ,IAAI,MACZ,IACK,EACH,UAAW,EAAO,UAClB,KAAM,EAAO,WAEf,EACA,cASN,SAAS,OAAO,CAChB,SAAgB,8BACd,GAGA,OADA,8BAA8B,UAAY,KAAK,UACxC,8BACP,SAAS,iCAAiC,GAExC,MAAM,EAAS,MADF,EAAO,OAAS,IACF,GAAO,EAAO,EAAQ,IAAI,QAAQ,yBAC7D,OAAO,6BACL,EACA,EAAO,KACP,EAAQ,IAAI,MACZ,IACK,EACH,UAAW,EAAO,UAClB,KAAM,EAAO,WAEf,EACA,cAKN,SAAS,KAAK,CACd,SAAgB,cAAc,EAAuB,GAEnD,OADA,EAAY,UAAY,GAAG,UACpB,EACP,SAAS,EAAY,GAEnB,MAAM,EAAS,MAAM,GAAM,GAAO,EAAO,EAAQ,IAAI,QAAQ,yBACvD,EAAO,0BAA0B,EAAO,MAE9C,OAAO,eACL,GACA,EACA,EAAQ,IAAI,MACZ,IACK,EACH,UAAW,EAAO,UAClB,aAEF,EACA,YAVK,IAeX,SAAS,0BAA0B,GACjC,GAAoB,IAAhB,EAAK,OAAc,OAAO,EAC9B,MAAM,EAAU,IAAI,GACd,EAAY,EAAQ,OAAS,EAC7B,EAAW,EAAQ,GAGzB,GAAI,MAAM,QAAQ,IAAa,EAAS,QAAU,EAAG,CACnD,MAAM,EAAK,EAAS,GAGpB,GAAI,IAAO,SAAS,QAAU,IAAO,SAAS,MAC5C,OAAO,EAqBT,GAfuB,CACrB,SAAS,IACT,SAAS,MACT,SAAS,IACT,SAAS,SACT,SAAS,GACT,SAAS,KACT,SAAS,IACT,SAAS,OACT,SAAS,cACT,SAAS,YAKQ,SAAS,GAC1B,OAAO,EAKT,EAAQ,GAAa,CAAC,SAAS,OAAQ,SAAS,KAAM,GAGxD,OAAO,EAGT,SAAS,MAAM,CACf,SAAgB,oBACd,EACA,GAGA,OADA,EAAkB,UAAY,IAAI,UAC3B,EACP,SAAS,EAAkB,EAAuB,KAAqB,GACrE,MAAM,EAAU,EAAQ,IAAI,QACtB,EAAA,IAAW,KACf,MAAM,EAAuB,iBAAZ,EAAuB,EAAK,GAAW,EAIxD,OAHA,EAAQ,cACR,EAAQ,cACR,EAAQ,kBAAkB,OAAO,GAC1B,KAAK,IAGR,IAAkB,EAAQ,qBAEhC,IAAI,EAAQ,KAAK,MACb,EAAiB,WAAW,EAAM,KAAY,GAE9C,EAAU,EACd,MAAM,EAAU,EAAQ,cAAA,KACtB,EAAU,KAAK,MAAQ,EAAQ,EAC/B,aAAa,KAET,EAAU,EAAQ,gBAAA,KACtB,EAAQ,KAAK,MACb,MAAM,EAAY,KAAK,OAAO,GAAW,GAAK,GAC9C,EAAS,WAAW,EAAM,KAAc,GACxC,EAAQ,kBAAkB,IAAI,EAAe,CAC3C,SACA,UACA,cAQJ,OALA,EAAQ,kBAAkB,IAAI,EAAe,CAC3C,SACA,UACA,YAEK,GAIX,SAAS,MAAM,CACf,SAAgB,sBAAsB,GAEpC,OADA,EAAoB,UAAY,IAAI,UAC7B,EACP,SAAS,EAAoB,GAC3B,MAAM,EAAU,EAAQ,IAAI,QACtB,EAAgB,EAAQ,kBAAkB,IAAI,GAChD,IACF,aAAa,EAAc,QAC3B,EAAc,QAAQ,cACtB,EAAc,QAAQ,cACtB,EAAQ,kBAAkB,OAAO,KAIvC,SAAS,MAAM,CACf,SAAgB,uBAAuB,GAErC,OADA,EAAqB,UAAY,IAAI,UAC9B,EACP,SAAS,EAAqB,GAC5B,MAAM,EAAU,EAAQ,IAAI,QACtB,EAAiB,EAAQ,mBAAmB,IAAI,GAClD,IACF,cAAc,EAAe,QAC7B,aAAa,EAAe,QAC5B,EAAe,QAAQ,cACvB,EAAe,QAAQ,cACvB,EAAQ,mBAAmB,OAAO,KAKxC,SAAS,MAAM,CACf,SAAgB,qBACd,EACA,GAGA,OADA,EAAmB,UAAY,IAAI,UAC5B,EACP,SAAS,EACP,EACA,KACG,GAEH,MAAM,EAAU,EAAQ,IAAI,QACtB,EAAuB,iBAAZ,EAAuB,EAAK,GAAW,EAClD,EAAA,IAAW,KACf,EAAQ,KAAK,MACb,EAAU,EACH,KAAK,IAGR,IAAkB,EAAQ,qBAEhC,IAAI,EAAQ,KAAK,MACb,EAAiB,YAAY,EAAM,KAAY,GAE/C,EAAU,EACd,MAAM,EAAU,EAAQ,cAAA,KACtB,EAAU,KAAK,MAAQ,EAAQ,EAC/B,cAAc,GACd,aAAa,KAET,EAAU,EAAQ,gBAAA,KACtB,EAAQ,KAAK,MACb,EAAS,WAAA,KAEL,EAAQ,KAAK,MACb,EAAU,EACV,EAAS,YAAY,EAAM,KAAY,GACvC,EAAS,OAAS,EAClB,KAAQ,IAEV,KAAK,OAAO,GAAW,GAAK,MACzB,GAEL,EAAS,OAAS,IAGd,EAAW,CACf,SACA,UACA,WAGF,OADA,EAAQ,mBAAmB,IAAI,EAAe,GACvC,GCvVX,SAAS,aACP,EACA,EACA,EACA,GAQA,MAAM,EACJ,EAAQ,iBAAiB,IAAI,IAAQ,IAAI,IAC3C,EAAQ,iBAAiB,IAAI,EAAK,GAClC,MAAM,EAAY,EAAM,IAAI,IAAS,IAAI,IAGzC,IAAI,EAFJ,EAAM,IAAI,EAAM,GAChB,EAAU,IAAI,GAEd,MAAM,EAAO,EAAY,GAMzB,OALI,aAAe,SACjB,EAAY,EAAQ,oBAAoB,IAAI,IAAQ,IAAI,IACxD,EAAU,IAAI,GACd,EAAQ,oBAAoB,IAAI,EAAK,IAEhC,CACL,YAAA,KACE,EAAU,OAAO,GACjB,GAAW,OAAO,KAKxB,IAAa,YAAb,MAAa,EA+BX,WAAA,CACE,EACA,GAAO,KAAA,YAAA,wBA5BL,IAAI,iCAIJ,IAAI,8BAC4D,IAAI,+BACP,IAAI,6BACtB,IAAI,iBACnC,4BACO,yBACa,IAAI,4BAQH,IAAI,IAYvC,MAAM,EAAgB,OAAO,OAC3B,CACE,OAAO,EACP,qBAAqB,EACrB,wBAAwB,EACxB,QAAS,EAAY,aACrB,gBAAiB,EAAY,aAC7B,mBAAoB,EAAY,gBAChC,wBAAyB,IACzB,aAAa,EACb,qBAAsB,IAAI,KAK5B,GAAW,CAAA,GAEb,KAAK,QAAU,cAAc,KAAM,GAGrC,uBAAW,GACT,MAAO,CACL,sBACA,kBACA,UACA,QAAS,CACP,MAAO,QAAQ,MACf,MAAO,QAAQ,MACf,KAAM,QAAQ,KACd,IAAK,QAAQ,IACb,MAAO,QAAQ,MACf,KAAM,QAAQ,MAEhB,kBACA,YACA,sBACA,kBACA,oBACA,sCACA,oBACA,sCACA,cACA,kBACA,gBACA,cACA,cACA,cACA,cACA,YACA,cACA,YACA,oBACA,sBACA,8BACA,wBACA,oBACA,kBACA,oBACA,sBACA,oCACA,sBACA,wBACA,sBACA,wBACA,0BACA,0BACA,QACA,QACA,gBACA,gBACA,gBACA,UACA,UACA,UACA,UACA,eAIJ,uBAAW,GACT,MAAM,EAAgC,CAAA,EACtC,IAAK,MAAM,IAAO,CAChB,gBACA,WACA,QACA,WACA,UACA,SACA,SACC,CACD,MAAM,EAAS,OAAyD,GACnD,iBAAV,IACT,EAAY,GAAO,GAGvB,OAAO,EAGT,0BAAW,GACT,MAAM,EAAS,CACb,SACA,QACA,OACA,OACA,OACA,KACA,MACA,MACA,UACA,WACA,kBACA,WACA,YACA,WACA,YACA,aACA,aACA,IACA,IACA,QACA,QACA,QACA,OACA,KACA,OAEA,SACA,QACA,QACA,UAEI,EAAM,IAAI,IAuBhB,OAtBA,EAAO,QAAS,IACd,EAAI,IAAI,EAAO,IAAI,OAErB,EAAI,IACF,OACA,IAAI,IAAI,CACN,cACA,OACA,UACA,cACA,sBACA,KACA,OACA,iBACA,gBACA,uBACA,iBACA,WACA,UACA,YAGG,EAGT,YAAA,CACE,EACA,GAGA,OADA,EAAQ,iBAAiB,IAAI,GACtB,CAAE,YAAA,IAAmB,EAAQ,iBAAiB,OAAO,IAG9D,YAAA,CACE,EACA,EACA,EACA,GAEA,OAAO,aAAa,EAAK,EAAM,EAAU,GAG3C,kBAAA,CACE,EACA,EACA,GAEA,OAAO,aAAa,EAAK,EAAM,EAAU,MAG3C,aAAA,CAAc,GAEZ,OADA,KAAK,kBAAkB,IAAI,GACpB,CACL,YAAA,KACE,KAAK,kBAAkB,OAAO,KAIpC,eAAA,CAAgB,GAEd,OADA,KAAK,oBAAoB,IAAI,GACtB,CACL,YAAA,KACE,KAAK,oBAAoB,OAAO,KAKtC,aAAA,CAAc,EAA2B,CAAE,KAAM,WAC/C,IAAI,KAAK,OAAT,CACA,KAAK,QAAS,EACd,IAAK,MAAM,KAAM,KAAK,kBACpB,EAAG,EAHY,EAOnB,eAAA,GACE,GAAK,KAAK,OAAV,CACA,QACmC,IAAjC,KAAK,QAAQ,MAAM,WACnB,KAAK,QAAQ,MAAM,OAAS,KAAK,QAAQ,MAAM,UAE/C,MAAM,IAAI,mCAAmC,gDAE/C,KAAK,QAAS,EACd,IAAK,MAAM,KAAM,KAAK,oBACpB,GATgB,EAapB,UAAA,CAAW,GACT,OAAO,KAAK,iBAAiB,IAAI,GAGnC,WAAA,CAAe,EAAuB,EAAmB,IACvD,OAAO,YAAY,EAAQ,IAAI,MAAO,EAAS,EAAQ,KAAM,OAAQ,GAAW,GAGlF,gBAAA,CAAoB,EAAuB,EAAmB,IAC5D,OAAO,iBAAiB,EAAQ,IAAI,MAAO,EAAS,EAAQ,KAAM,OAAQ,GAAW,KCnS5E,QAAb,cAA6B,YAC3B,WAAA,CAAY,GACV,MAAM,EAAS,qBAGjB,YAAO,CAAS,EAAc,EAAmB,IAC/C,MAAM,EAAmC,CAAA,EACzC,IAAK,MAAM,KAAK,OAAO,oBAAoB,YACzC,EAAQ,GAAK,WAAW,GAE1B,MAAM,EAAU,IAAI,YAAY,CAC9B,UACA,OAAO,IAET,OAAO,EAAQ,YACb,kBACE,EACA,MAAM,GAAM,GAAM,EAAO,EAAQ,QAAQ,QAAQ,yBACjD,qBAEF,GAIJ,YAAO,CAAM,GACX,OAAO,MAAM,GAAM,GAGrB,YAAI,GAeF,OAdgB,kBACd,KACA,CACE,KAAM,GACN,UAAW,CACT,QAAS,GACT,OAAO,EACP,SAAU,GACV,SAAU,KAAK,QAAQ,QAAQ,wBAC/B,QAAS,KAGb,KAAK,aAEQ,MAAM,IAAI,UAG3B,iBAAI,GAeF,OAdgB,kBACd,KACA,CACE,KAAM,GACN,UAAW,CACT,QAAS,GACT,OAAO,EACP,SAAU,GACV,SAAU,KAAK,QAAQ,QAAQ,wBAC/B,QAAS,KAGb,KAAK,aAEQ,MAAM,IAAI,eAG3B,QAAI,GAeF,OAdgB,kBACd,KACA,CACE,KAAM,GACN,UAAW,CACT,QAAS,GACT,OAAO,EACP,SAAU,GACV,SAAU,KAAK,QAAQ,QAAQ,wBAC/B,QAAS,KAGb,KAAK,aAEQ,MAAM,IAAI,MAG3B,OAAA,CACE,EACA,GAAW,GAEX,GAAI,KAAK,QAAQ,QAAQ,YACvB,MAAM,IAAI,uBACR,qEAEJ,MACM,EAAU,kBAAkB,KADnB,MAAM,EAAM,GAAU,EAAO,KAAK,QAAQ,QAAQ,yBACjB,KAAK,aAKrD,MAJM,IAAW,KACf,eAAe,EAAQ,GAChB,CAAE,UAAS,IAAA,IAAW,KAAK,YAAe,EAAS,IAAI,IAAS,SAK3E,YAAA,CACE,EACA,GAAW,GAEX,MACM,EAAU,kBAAkB,KADnB,MAAM,EAAM,GAAU,EAAO,KAAK,QAAQ,QAAQ,yBACjB,KAAK,aAQrD,MAPM,IAAW,KACf,eAAe,EAAQ,GAChB,CACL,UACA,IAAA,IAAW,KAAK,iBAAoB,EAAS,IAAI,IAAS,KAAM,GAAQ,EAAI,UAMlF,iBAAA,CACE,EACA,GAAW,GAEX,MACM,EAAU,kBAAkB,KADnB,MAAM,EAAM,GAAU,EAAM,KAAK,QAAQ,QAAQ,yBAChB,KAAK,aAKrD,MAJM,IAAW,KACf,eAAe,EAAQ,GAChB,CAAE,UAAS,IAAA,IAAW,KAAK,YAAe,EAAS,IAAI,IAAS,SAK3E,sBAAA,CACE,EACA,GAAW,GAEX,MACM,EAAU,kBAAkB,KADnB,MAAM,EAAM,GAAU,EAAM,KAAK,QAAQ,QAAQ,yBAChB,KAAK,aAOrD,MANM,IAAW,KACR,CACL,UACA,IAAA,IAAW,KAAK,iBAAoB,EAAS,IAAI,IAAS,KAAM,GAAQ,EAAI"}