@cuxt/sandboxjs 0.1.1 → 0.1.4

package/dist/Sandbox.min.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Sandbox.min.js","sources":["../src/utils.ts","../src/executor.ts","../src/unraw.ts","../src/parser.ts","../src/eval.ts","../src/SandboxExec.ts","../src/Sandbox.ts"],"sourcesContent":["// Reusable AsyncFunction constructor reference\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 { IEvalContext } from './eval';\nimport { Change, Unknown } from './executor';\nimport { IConstants, IExecutionTree, Lisp, LispItem } from './parser';\nimport SandboxExec from './SandboxExec';\n\nexport type replacementCallback = (obj: any, isStaticAccess: boolean) => any;\n\nexport interface IOptionParams {\n  audit?: boolean;\n  forbidFunctionCalls?: boolean;\n  forbidFunctionCreation?: boolean;\n  prototypeReplacements?: Map<Function, replacementCallback>;\n  prototypeWhitelist?: Map<Function, Set<string>>;\n  globals?: IGlobals;\n  executionQuota?: bigint;\n  haltOnSandboxError?: boolean;\n}\n\nexport interface IOptions {\n  audit: boolean;\n  forbidFunctionCalls: boolean;\n  forbidFunctionCreation: boolean;\n  prototypeReplacements: Map<Function, replacementCallback>;\n  prototypeWhitelist: Map<Function, Set<string>>;\n  globals: IGlobals;\n  executionQuota?: bigint;\n  haltOnSandboxError?: boolean;\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  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}\n\nexport type SubscriptionSubject = object;\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}\ninterface SandboxGlobalConstructor {\n  new (globals: IGlobals): ISandboxGlobal;\n}\n\nexport const SandboxGlobal = function SandboxGlobal(this: ISandboxGlobal, globals: IGlobals) {\n  for (const i in globals) {\n    this[i] = globals[i];\n  }\n} as any as SandboxGlobalConstructor;\n\nexport type IGlobals = ISandboxGlobal;\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\nexport function createContext(sandbox: SandboxExec, options: IOptions): IContext {\n  const sandboxGlobal = new SandboxGlobal(options.globals);\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    options,\n    globalScope: new Scope(null, options.globals, sandboxGlobal),\n    sandboxGlobal,\n    ticks: { ticks: 0n, tickLimit: options.executionQuota },\n    sandboxedFunctions: new WeakSet<Function>(),\n  };\n  context.prototypeWhitelist.set(Object.getPrototypeOf([][Symbol.iterator]()) as object, 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) => 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    evals.set(Function, func);\n    evals.set(AsyncFunction, asyncFunc);\n    evals.set(GeneratorFunction, func);\n    evals.set(AsyncGeneratorFunction, asyncFunc);\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 [key, value] of evals) {\n      sandbox.context.prototypeWhitelist.set(value.prototype, new Set());\n      sandbox.context.prototypeWhitelist.set(key.prototype, new Set());\n    }\n  }\n  return execContext;\n}\n\nexport 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\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 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}\n\nexport class Scope {\n  parent: Scope | null;\n  const: { [key: string]: true } = {};\n  let: { [key: string]: true } = {};\n  var: { [key: string]: true } = {};\n  globals: { [key: string]: true };\n  allVars: { [key: string]: unknown } & object;\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): Prop {\n    const isThis = key === 'this';\n    const scope = this.getWhereValScope(key, isThis);\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    return new Prop(scope.allVars, key, key in scope.const, key in scope.globals, true);\n  }\n\n  set(key: string, val: unknown) {\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);\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): Scope | null {\n    if (isThis) {\n      if (this.functionThis !== undefined) {\n        return this;\n      } else {\n        return this.parent?.getWhereValScope(key, isThis) || null;\n      }\n    }\n    if (key in this.allVars && !(key in {} && !hasOwnProperty(this.allVars, key))) {\n      return this;\n    }\n    return this.parent?.getWhereValScope(key, isThis) || null;\n  }\n\n  getWhereVarScope(key: string, localScope = false): Scope {\n    if (key in this.allVars && !(key in {} && !hasOwnProperty(this.allVars, key))) {\n      return this;\n    }\n    if (this.parent === null || localScope || this.functionThis !== undefined) {\n      return this;\n    }\n    return this.parent.getWhereVarScope(key, localScope);\n  }\n\n  declare(key: string, type: VarType, value: unknown = undefined, isGlobal = false): 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);\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) {\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    existingScope.allVars[key] = value;\n\n    return new Prop(this.allVars, key, type === VarType.const, isGlobal, true);\n  }\n}\n\nexport interface IScope {\n  [key: string]: any;\n}\n\nexport class FunctionScope implements IScope {}\n\nexport class LocalScope implements IScope {}\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\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\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  Block,\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\n  LispEnumSize,\n}\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  ) {}\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    return (ctx as any)[this.prop] as T;\n  }\n}\n\nexport function hasOwnProperty(obj: unknown, prop: PropertyKey): boolean {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n","import { LispItem, Lisp, IRegEx, SwitchCase } from './parser.js';\nimport {\n  CodeString,\n  hasOwnProperty,\n  IAuditReport,\n  IExecContext,\n  IScope,\n  isLisp,\n  LispType,\n  LocalScope,\n  Prop,\n  SandboxExecutionQuotaExceededError,\n  SandboxError,\n  SandboxExecutionTreeError,\n  Scope,\n  Ticks,\n  VarType,\n  SandboxCapabilityError,\n  SandboxAccessError,\n} from './utils.js';\n\nexport type Done<T = any> = (err?: any, res?: T | typeof optional) => void;\n\nexport class ExecReturn<T> {\n  constructor(\n    public auditReport: IAuditReport | undefined,\n    public result: T,\n    public returned: boolean,\n    public breakLoop = false,\n    public continueLoop = false,\n  ) {}\n}\n\nexport type Unknown = undefined | null | Record<string | number, unknown>;\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 optional = {};\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) {\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      );\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      );\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) {\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      );\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      );\n      return res.result;\n    };\n  }\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}\nconst 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: string | 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 If {\n  constructor(\n    public t: Lisp,\n    public f: Lisp,\n  ) {}\n}\n\nconst literalRegex = /(\\$\\$)*(\\$)?\\${(\\d+)}/g;\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>>();\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\nconst prorptyKeyTypes = ['string', 'number', 'symbol'];\n\nfunction isPropertyKey(val: unknown): val is PropertyKey {\n  return prorptyKeyTypes.includes(typeof val);\n}\n\nfunction hasPossibleProperties(val: unknown): val is {} {\n  return val !== null && val !== undefined;\n}\n\naddOps<unknown, PropertyKey>(LispType.Prop, ({ done, a, b, obj, context, scope }) => {\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);\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 ? (prop.context as any)[prop.prop] : undefined;\n    const p = getGlobalProp(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        const replace = context.ctx.options.prototypeReplacements.get(a);\n        if (replace) {\n          done(undefined, new Prop(replace(a, true), b));\n          return;\n        }\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    // Fast path: check own properties of `a` first (handles static methods like Body.json)\n    if (hasOwnProperty(a, b)) {\n      const replace = context.ctx.options.prototypeReplacements.get(a as Function);\n      if (replace) {\n        done(undefined, new Prop(replace(a as object, true), b));\n        return;\n      }\n      if (context.ctx.sandboxedFunctions.has(a as Function)) {\n        done(undefined, new Prop(a, b, false, false));\n        return;\n      }\n      // Check if constructor or any ancestor is whitelisted\n      let ctorProt: {} | null = (a as Function).prototype;\n      while (ctorProt !== null) {\n        const whitelist = context.ctx.prototypeWhitelist.get(ctorProt as Function);\n        if (whitelist && (!whitelist.size || whitelist.has(b))) {\n          done(undefined, new Prop(a, b, false, false));\n          return;\n        }\n        ctorProt = Object.getPrototypeOf(ctorProt);\n      }\n      if (typeof a === 'function') {\n        // Constructor not whitelisted, throw\n        throw new SandboxAccessError(\n          `Method or property access not permitted: ${(a as Function).name}.${b.toString()}`,\n        );\n      }\n    }\n\n    let prot: {} = a;\n    while ((prot = Object.getPrototypeOf(prot))) {\n      if (hasOwnProperty(prot, b) || b === '__proto__') {\n        const replace = context.ctx.options.prototypeReplacements.get(prot.constructor);\n        if (replace) {\n          done(undefined, new Prop(replace(a, false), b));\n          return;\n        }\n        if (context.ctx.sandboxedFunctions.has(prot.constructor)) {\n          break;\n        }\n        // Check if this constructor or any ancestor in its prototype chain is whitelisted\n        let ctorProt: {} | null = prot.constructor;\n        let whitelisted = false;\n        while (ctorProt !== null) {\n          const whitelist = context.ctx.prototypeWhitelist.get(ctorProt as Function);\n          if (whitelist && (!whitelist.size || whitelist.has(b))) {\n            whitelisted = true;\n            break;\n          }\n          ctorProt = Object.getPrototypeOf(ctorProt);\n        }\n        if (whitelisted) {\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  const val = a[b as keyof typeof a] as unknown;\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  }\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 = getGlobalProp(val, context, new Prop(a, b, false, false));\n  if (p) {\n    done(undefined, p);\n    return;\n  }\n\n  const g =\n    (obj instanceof Prop && obj.isGlobal) ||\n    (typeof a === 'function' && !context.ctx.sandboxedFunctions.has(a)) ||\n    context.ctx.globalsWhitelist.has(a);\n\n  done(undefined, new Prop(a, b, false, g, false));\n});\n\nfunction getGlobalProp(val: unknown, context: IExecContext, prop?: Prop) {\n  if (!val) return;\n  const isFunc = typeof val === 'function';\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  const evl = isFunc && context.evals.get(val as Function);\n  if (evl) {\n    return new Prop(\n      {\n        [p]: evl,\n      },\n      p,\n      prop?.isConst || false,\n      true,\n      prop?.isVariable || false,\n    );\n  }\n}\n\nfunction sanitizeArray<T>(val: T, context: IExecContext, cache = new WeakSet<object>()): T {\n  if (!Array.isArray(val)) return val;\n  if (cache.has(val)) return val;\n  cache.add(val);\n  for (let i = 0; i < val.length; i++) {\n    const item = val[i];\n    if (item === globalThis) {\n      val[i] = context.ctx.sandboxGlobal;\n    } else if (typeof item === 'function') {\n      const replacement = context.evals.get(item);\n      if (replacement) {\n        val[i] = replacement;\n      }\n    } else {\n      sanitizeArray(item, context, cache);\n    }\n  }\n  return val;\n}\n\naddOps<unknown, Lisp[], any>(LispType.Call, ({ done, a, b, obj, context }) => {\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 = b\n    .map((item) => {\n      if (item instanceof SpreadArray) {\n        return [...item.item];\n      } else {\n        return [item];\n      }\n    })\n    .flat()\n    .map((item) => valueOrProp(item, context));\n\n  if (typeof obj === 'function') {\n    const evl = context.evals.get(obj);\n    let ret = evl ? evl(obj, ...vals) : obj(...vals);\n    ret = getGlobalProp(ret, context) || ret;\n    sanitizeArray(ret, context);\n    // If the function returns a Promise, await it before signaling completion.\n    // Without this, `done(undefined, promise)` resolves the outer await immediately,\n    // but the Promise itself is still pending — causing async ops to be skipped.\n    if (ret != null && typeof ret.then === 'function') {\n      ret.then(\n        (resolved: unknown) => { done(undefined, resolved); },\n        (err: unknown) => { done(err); }\n      );\n    } else {\n      done(undefined, ret);\n    }\n    return;\n  }\n  if (obj.context[obj.prop] === JSON.stringify && context.getSubscriptions.size) {\n    const cache = new Set<any>();\n    const recurse = (x: unknown) => {\n      if (!x || !(typeof x === 'object') || cache.has(x)) return;\n      cache.add(x);\n      for (const y of Object.keys(x) as (keyof typeof x)[]) {\n        context.getSubscriptions.forEach((cb) => cb(x, y));\n        recurse(x[y]);\n      }\n    };\n    recurse(vals[0]);\n  }\n\n  if (\n    obj.context instanceof Array &&\n    arrayChange.has(obj.context[obj.prop]) &&\n    (context.changeSubscriptions.get(obj.context) ||\n      context.changeSubscriptionsGlobal.get(obj.context))\n  ) {\n    let change: Change;\n    let changed = false;\n    if (obj.prop === 'push') {\n      change = {\n        type: 'push',\n        added: vals,\n      };\n      changed = !!vals.length;\n    } else if (obj.prop === 'pop') {\n      change = {\n        type: 'pop',\n        removed: obj.context.slice(-1),\n      };\n      changed = !!change.removed.length;\n    } else if (obj.prop === 'shift') {\n      change = {\n        type: 'shift',\n        removed: obj.context.slice(0, 1),\n      };\n      changed = !!change.removed.length;\n    } else if (obj.prop === 'unshift') {\n      change = {\n        type: 'unshift',\n        added: vals,\n      };\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      context.changeSubscriptions.get(obj.context)?.forEach((cb) => cb(change));\n      context.changeSubscriptionsGlobal.get(obj.context)?.forEach((cb) => cb(change));\n    }\n  }\n  obj.get(context);\n  const evl = context.evals.get(obj.context[obj.prop] as any);\n  let ret = evl ? evl(obj.context[obj.prop], ...vals) : (obj.context[obj.prop](...vals) as unknown);\n  ret = getGlobalProp(ret, context) || ret;\n  sanitizeArray(ret, context);\n  done(undefined, ret);\n});\n\naddOps<unknown, KeyVal[]>(LispType.CreateObject, ({ done, b }) => {\n  let res = {} as any;\n  for (const item of b) {\n    if (item.key instanceof SpreadObject) {\n      res = { ...res, ...item.key.item };\n    } else {\n      res[item.key] = item.val;\n    }\n  }\n  done(undefined, res);\n});\n\naddOps<string, LispItem>(LispType.KeyVal, ({ done, a, b }) => done(undefined, new KeyVal(a, b)));\n\naddOps<unknown, Lisp[]>(LispType.CreateArray, ({ done, b, context }) => {\n  const items = b\n    .map((item) => {\n      if (item instanceof SpreadArray) {\n        return [...item.item];\n      } else {\n        return [item];\n      }\n    })\n    .flat()\n    .map((item) => valueOrProp(item, context));\n  done(undefined, items);\n});\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, string>(LispType.Number, ({ done, b }) =>\n  done(undefined, Number(b.replace(/_/g, ''))),\n);\naddOps<unknown, string>(LispType.BigInt, ({ done, b }) =>\n  done(undefined, BigInt(b.replace(/_/g, ''))),\n);\naddOps<unknown, string>(LispType.StringIndex, ({ done, b, context }) =>\n  done(undefined, context.constants.strings[parseInt(b)]),\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    done(undefined, new RegExp(reg.regex, reg.flags));\n  }\n});\n\naddOps<unknown, string>(LispType.LiteralIndex, ({ exec, done, ticks, b, context, scope }) => {\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[]>(ticks, found, scope, context, (...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    done(\n      undefined,\n      name.replace(/(\\\\\\\\)*(\\\\)?\\${(\\d+)}/g, (match, $$, $, num) => {\n        if ($) return match;\n        const res = reses[num];\n        return ($$ ? $$ : '') + `${valueOrProp(res, context)}`;\n      }),\n    );\n  });\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\naddOps<unknown, unknown>(LispType.Not, ({ done, b }) => done(undefined, !b));\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<unknown, unknown, Prop<any>, Prop<any>>(\n  LispType.Assign,\n  ({ done, b, obj, context, scope, bobj }) => {\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');\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);\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    done(undefined, (obj.context[obj.prop] = b));\n  },\n);\n\naddOps<unknown, unknown, Prop<any>>(LispType.AddEquals, ({ done, b, obj, context }) => {\n  assignCheck(obj, context);\n  done(undefined, (obj.context[obj.prop] += b));\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\naddOps<number, number>(LispType.LargerThan, ({ done, a, b }) => done(undefined, a > b));\naddOps<number, number>(LispType.SmallerThan, ({ done, a, b }) => done(undefined, a < b));\naddOps<number, number>(LispType.LargerEqualThan, ({ done, a, b }) => done(undefined, a >= b));\naddOps<number, number>(LispType.SmallerEqualThan, ({ done, a, b }) => done(undefined, a <= b));\naddOps<number, number>(LispType.Equal, ({ done, a, b }) => done(undefined, a == b));\naddOps<number, number>(LispType.StrictEqual, ({ done, a, b }) => done(undefined, a === b));\naddOps<number, number>(LispType.NotEqual, ({ done, a, b }) => done(undefined, a != b));\naddOps<number, number>(LispType.StrictNotEqual, ({ done, a, b }) => done(undefined, a !== b));\naddOps<number, number>(LispType.And, ({ done, a, b }) => done(undefined, a && b));\naddOps<number, number>(LispType.Or, ({ done, a, b }) => done(undefined, a || b));\naddOps<number, number>(LispType.NullishCoalescing, ({ done, a, b }) => done(undefined, a ?? b));\naddOps<number, number>(LispType.BitAnd, ({ done, a, b }) => done(undefined, a & b));\naddOps<number, number>(LispType.BitOr, ({ done, a, b }) => done(undefined, a | b));\naddOps<number, number>(LispType.Plus, ({ done, a, b }) => done(undefined, a + b));\naddOps<number, number>(LispType.Minus, ({ done, a, b }) => done(undefined, a - b));\naddOps<number, number>(LispType.Positive, ({ done, b }) => done(undefined, +b));\naddOps<number, number>(LispType.Negative, ({ done, b }) => done(undefined, -b));\naddOps<number, number>(LispType.Divide, ({ done, a, b }) => done(undefined, a / b));\naddOps<number, number>(LispType.Power, ({ done, a, b }) => done(undefined, a ** b));\naddOps<number, number>(LispType.BitNegate, ({ done, a, b }) => done(undefined, a ^ b));\naddOps<number, number>(LispType.Multiply, ({ done, a, b }) => done(undefined, a * b));\naddOps<number, number>(LispType.Modulus, ({ done, a, b }) => done(undefined, a % b));\naddOps<number, number>(LispType.BitShiftLeft, ({ done, a, b }) => done(undefined, a << b));\naddOps<number, number>(LispType.BitShiftRight, ({ done, a, b }) => done(undefined, a >> b));\naddOps<number, number>(LispType.BitUnsignedShiftRight, ({ done, a, b }) =>\n  done(undefined, a >>> b),\n);\naddOps<unknown, LispItem>(LispType.Typeof, ({ exec, done, ticks, b, context, scope }) => {\n  exec(ticks, b, scope, context, (e, prop) => {\n    done(undefined, typeof valueOrProp(prop, context));\n  });\n});\n\naddOps<unknown, { new (): unknown }>(LispType.Instanceof, ({ done, a, b }) =>\n  done(undefined, a instanceof b),\n);\naddOps<string, {}>(LispType.In, ({ done, a, b }) => done(undefined, a in b));\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.Return, ({ done, b }) => done(undefined, b));\n\naddOps<string, unknown, unknown, Prop>(LispType.Var, ({ done, a, b, scope, bobj }) => {\n  done(undefined, scope.declare(a, VarType.var, b, bobj?.isGlobal || false));\n});\n\naddOps<string, unknown, unknown, Prop>(LispType.Let, ({ done, a, b, scope, bobj }) => {\n  done(undefined, scope.declare(a, VarType.let, b, bobj?.isGlobal || false));\n});\n\naddOps<string, unknown, unknown, Prop>(LispType.Const, ({ done, a, b, scope, bobj }) => {\n  done(undefined, scope.declare(a, VarType.const, b, bobj?.isGlobal || false));\n});\n\naddOps<string[], Lisp[], Lisp>(\n  LispType.ArrowFunction,\n  ({ done, ticks, a, b, obj, context, scope }) => {\n    a = [...a];\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    if (a.shift()) {\n      done(undefined, createFunctionAsync(a, b, ticks, context, scope));\n    } else {\n      done(undefined, createFunction(a, b, ticks, context, scope));\n    }\n  },\n);\n\naddOps<(string | LispType)[], Lisp[], Lisp>(\n  LispType.Function,\n  ({ done, ticks, a, b, obj, context, scope }) => {\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 isAsync = a.shift();\n    const name = a.shift() as string;\n    let func;\n    if (isAsync === LispType.True) {\n      func = createFunctionAsync(a as string[], b, ticks, context, scope, name);\n    } else {\n      func = createFunction(a as string[], b, ticks, context, scope, name);\n    }\n    if (name) {\n      scope.declare(name, VarType.var, func);\n    }\n    done(undefined, func);\n  },\n);\n\naddOps<(string | LispType)[], Lisp[], Lisp>(\n  LispType.InlineFunction,\n  ({ done, ticks, a, b, obj, context, scope }) => {\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 isAsync = a.shift();\n    const name = a.shift() as string;\n    if (name) {\n      scope = new Scope(scope, {});\n    }\n    let func;\n    if (isAsync === LispType.True) {\n      func = createFunctionAsync(a as string[], b, ticks, context, scope, name);\n    } else {\n      func = createFunction(a as string[], b, ticks, context, scope, name);\n    }\n    if (name) {\n      scope.declare(name, VarType.let, func);\n    }\n    done(undefined, func);\n  },\n);\n\naddOps<Lisp[], Lisp[]>(LispType.Loop, ({ exec, done, ticks, a, b, context, scope }) => {\n  const [checkFirst, startInternal, getIterator, startStep, step, condition, beforeStep] = a;\n  let loop = true;\n  const loopScope = new Scope(scope, {});\n  const internalVars = {\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) => exec(ticks, startStep, loopScope, context, d));\n      internalVars['$$obj'] =\n        (ad = asyncDone((d) => exec(ticks, getIterator, loopScope, context, d))).isInstant === true\n          ? ad.instant\n          : (await ad.p).result;\n      ad = asyncDone((d) => exec(ticks, startInternal, interalScope, context, d));\n      if (checkFirst)\n        loop =\n          (ad = asyncDone((d) => exec(ticks, condition, interalScope, context, d))).isInstant ===\n          true\n            ? ad.instant\n            : (await ad.p).result;\n      while (loop) {\n        const innerLoopVars = {};\n        ad = asyncDone((d) =>\n          exec(ticks, beforeStep, new Scope(interalScope, innerLoopVars), context, d),\n        );\n        ad.isInstant === true ? ad.instant : (await ad.p).result;\n        const res = await executeTreeAsync(\n          ticks,\n          context,\n          b,\n          [new Scope(loopScope, innerLoopVars)],\n          'loop',\n        );\n        if (res instanceof ExecReturn && res.returned) {\n          done(undefined, res);\n          return;\n        }\n        if (res instanceof ExecReturn && res.breakLoop) {\n          break;\n        }\n        ad = asyncDone((d) => exec(ticks, step, interalScope, context, d));\n        loop =\n          (ad = asyncDone((d) => exec(ticks, condition, interalScope, context, d))).isInstant ===\n          true\n            ? ad.instant\n            : (await ad.p).result;\n      }\n      done();\n    })().catch(done);\n  } else {\n    syncDone((d) => exec(ticks, startStep, loopScope, context, d));\n    internalVars['$$obj'] = syncDone((d) => exec(ticks, getIterator, loopScope, context, d)).result;\n    syncDone((d) => exec(ticks, startInternal, interalScope, context, d));\n    if (checkFirst) loop = syncDone((d) => exec(ticks, condition, interalScope, context, d)).result;\n    while (loop) {\n      const innerLoopVars = {};\n      syncDone((d) => exec(ticks, beforeStep, new Scope(interalScope, innerLoopVars), context, d));\n      const res = executeTree(ticks, context, b, [new Scope(loopScope, innerLoopVars)], 'loop');\n      if (res instanceof ExecReturn && res.returned) {\n        done(undefined, res);\n        return;\n      }\n      if (res instanceof ExecReturn && res.breakLoop) {\n        break;\n      }\n      syncDone((d) => exec(ticks, step, interalScope, context, d));\n      loop = syncDone((d) => exec(ticks, condition, interalScope, context, d)).result;\n    }\n    done();\n  }\n});\n\naddOps<LispItem, LispItem>(LispType.LoopAction, ({ done, a, context, inLoopOrSwitch }) => {\n  if ((inLoopOrSwitch === 'switch' && a === 'continue') || !inLoopOrSwitch) {\n    throw new TypeError('Illegal ' + a + ' statement');\n  }\n  done(\n    undefined,\n    new ExecReturn(context.ctx.auditReport, undefined, false, a === 'break', a === 'continue'),\n  );\n});\n\naddOps<LispItem, If>(LispType.If, ({ exec, done, ticks, a, b, context, scope, inLoopOrSwitch }) => {\n  exec(ticks, valueOrProp(a, context) ? b.t : b.f, scope, context, done, inLoopOrSwitch);\n});\n\naddOps<LispItem, If>(LispType.InlineIf, ({ exec, done, ticks, a, b, context, scope }) => {\n  exec(ticks, valueOrProp(a, context) ? b.t : b.f, scope, context, done, undefined);\n});\n\naddOps<Lisp, Lisp>(LispType.InlineIfCase, ({ done, a, b }) => done(undefined, new If(a, b)));\naddOps<Lisp, Lisp>(LispType.IfCase, ({ done, a, b }) => done(undefined, new If(a, b)));\n\naddOps<LispItem, SwitchCase[]>(LispType.Switch, ({ exec, done, ticks, a, b, context, scope }) => {\n  exec(ticks, a, scope, context, (...args: unknown[]) => {\n    if (args.length === 1) {\n      done(args[0]);\n      return;\n    }\n    let toTest = args[1];\n    toTest = valueOrProp(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              valueOrProp(\n                syncDone((d) => exec(ticks, caseItem[1], scope, context, d)).result,\n                context,\n              ))\n        ) {\n          if (!caseItem[2]) continue;\n          res = executeTree(ticks, context, caseItem[2], [scope], 'switch');\n          if (res.breakLoop) break;\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                valueOrProp(\n                  (ad = asyncDone((d) => exec(ticks, caseItem[1], scope, context, d))).isInstant ===\n                    true\n                    ? ad.instant\n                    : (await ad.p).result,\n                  context,\n                ))\n          ) {\n            if (!caseItem[2]) continue;\n            res = await executeTreeAsync(ticks, context, caseItem[2], [scope], 'switch');\n            if (res.breakLoop) break;\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});\n\naddOps<Lisp[], [string, Lisp[], Lisp[]]>(\n  LispType.Try,\n  ({ exec, done, ticks, a, b, context, scope, inLoopOrSwitch }) => {\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              inLoopOrSwitch,\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        // 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            inLoopOrSwitch,\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      inLoopOrSwitch,\n    );\n  },\n);\n\naddOps(LispType.Void, ({ done }) => {\n  done();\n});\naddOps<new (...args: unknown[]) => unknown, unknown[]>(LispType.New, ({ done, a, b, context }) => {\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  done(undefined, new a(...b));\n});\n\naddOps(LispType.Throw, ({ done, b }) => {\n  done(b);\n});\naddOps<unknown[]>(LispType.Expression, ({ done, a }) => done(undefined, a.pop()));\naddOps(LispType.None, ({ done }) => done());\n\nfunction valueOrProp(a: unknown, context: IExecContext): unknown {\n  if (a instanceof Prop) return a.get(context);\n  if (a === optional) return undefined;\n  return a;\n}\n\nexport function execMany(\n  ticks: Ticks,\n  exec: Execution,\n  tree: Lisp[],\n  done: Done,\n  scope: Scope,\n  context: IExecContext,\n  inLoopOrSwitch?: string,\n) {\n  if (exec === execSync) {\n    _execManySync(ticks, tree, done, scope, context, inLoopOrSwitch);\n  } else {\n    _execManyAsync(ticks, tree, done, scope, context, inLoopOrSwitch).catch(done);\n  }\n}\n\nfunction _execManySync(\n  ticks: Ticks,\n  tree: Lisp[],\n  done: Done,\n  scope: Scope,\n  context: IExecContext,\n  inLoopOrSwitch?: string,\n) {\n  const ret: any[] = [];\n  for (let i = 0; i < tree.length; i++) {\n    let res = syncDone((d) => execSync(ticks, tree[i], scope, context, d, inLoopOrSwitch)).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  inLoopOrSwitch?: string,\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) => execAsync(ticks, tree[i], scope, context, d, inLoopOrSwitch)))\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\ntype Execution = <T = any>(\n  ticks: Ticks,\n  tree: LispItem,\n  scope: Scope,\n  context: IExecContext,\n  done: Done<T>,\n  inLoopOrSwitch?: string,\n) => void;\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  inLoopOrSwitch?: string,\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 (!_execNoneRecurse(ticks, tree, scope, context, done, true, inLoopOrSwitch) && isLisp(tree)) {\n    let op = tree[0];\n    let obj;\n    try {\n      let ad: AsyncDoneRet;\n      obj =\n        (ad = asyncDone((d) => execAsync(ticks, tree[1], scope, context, d, inLoopOrSwitch)))\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) => execAsync(ticks, tree[2], scope, context, d, inLoopOrSwitch)))\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      inLoopOrSwitch,\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  inLoopOrSwitch?: string,\n) {\n  if (!_execNoneRecurse(ticks, tree, scope, context, done, false, inLoopOrSwitch) && isLisp(tree)) {\n    let op = tree[0];\n    let obj = syncDone((d) => execSync(ticks, tree[1], scope, context, d, inLoopOrSwitch)).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) => execSync(ticks, tree[2], scope, context, d, inLoopOrSwitch)).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      inLoopOrSwitch,\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  inLoopOrSwitch?: string;\n};\n\nfunction checkHaltExpectedTicks(\n  params: OpsCallbackParams<any, any, any, any>,\n  expectTicks = 0,\n): boolean {\n  const sandbox = params.context.ctx.sandbox;\n  const options = params.context.ctx.options;\n  const { ticks, scope, context, done, op } = params;\n  if (sandbox.halted) {\n    const sub = sandbox.subscribeResume(() => {\n      sub.unsubscribe();\n      try {\n        const o = ops.get(op);\n        if (!o) {\n          done(new SyntaxError('Unknown operator: ' + op));\n          return;\n        }\n        o(params);\n      } catch (err) {\n        if (options.haltOnSandboxError && err instanceof SandboxError) {\n          const sub = sandbox.subscribeResume(() => {\n            sub.unsubscribe();\n            done(err);\n          });\n          sandbox.haltExecution({\n            error: err as Error,\n            ticks,\n            scope,\n            context,\n          });\n        } else {\n          done(err);\n        }\n      }\n    });\n    return true;\n  } else if (ticks.tickLimit && ticks.tickLimit <= ticks.ticks + BigInt(expectTicks)) {\n    const sub = sandbox.subscribeResume(() => {\n      sub.unsubscribe();\n      try {\n        const o = ops.get(op);\n        if (!o) {\n          done(new SyntaxError('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            error: err as Error,\n            ticks,\n            scope,\n            context,\n          });\n        } else {\n          done(err);\n        }\n      }\n    });\n    const error = new SandboxExecutionQuotaExceededError('Execution quota exceeded');\n    sandbox.haltExecution({\n      error,\n      ticks,\n      scope: scope,\n      context,\n    });\n    return true;\n  }\n  return false;\n}\n\nfunction performOp(params: OpsCallbackParams<any, any, any, any>) {\n  const { done, op, ticks, context, scope } = params;\n  ticks.ticks++;\n  const sandbox = context.ctx.sandbox;\n\n  if (checkHaltExpectedTicks(params)) {\n    return;\n  }\n\n  try {\n    const o = ops.get(op);\n    if (!o) {\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        error: err as Error,\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.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  inLoopOrSwitch?: string,\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(ticks, exec, tree as Lisp[], done, scope, context, inLoopOrSwitch);\n    }\n  } else if (!isLisp(tree)) {\n    done(undefined, tree);\n  } else if (tree[0] === LispType.Block) {\n    execMany(ticks, exec, tree[1] as Lisp[], done, scope, context, inLoopOrSwitch);\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 valueOrProp(args[1], context)) as any);\n            } catch (err) {\n              done(err);\n            }\n        },\n        inLoopOrSwitch,\n      ).catch(done);\n    } else {\n      done(new SandboxCapabilityError('Async/await is not permitted'));\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      inLoopOrSwitch,\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  inLoopOrSwitch?: string,\n): ExecReturn<T> {\n  return syncDone((done) =>\n    executeTreeWithDone(execSync, done, ticks, context, executionTree, scopes, inLoopOrSwitch),\n  ).result;\n}\n\nexport async function executeTreeAsync<T>(\n  ticks: Ticks,\n  context: IExecContext,\n  executionTree: Lisp[],\n  scopes: IScope[] = [],\n  inLoopOrSwitch?: string,\n): Promise<ExecReturn<T>> {\n  let ad: AsyncDoneRet;\n  return (ad = asyncDone((done) =>\n    executeTreeWithDone(execAsync, done, ticks, context, executionTree, scopes, inLoopOrSwitch),\n  )).isInstant === true\n    ? ad.instant\n    : (await ad.p).result;\n}\n\nfunction executeTreeWithDone(\n  exec: Execution,\n  done: Done,\n  ticks: Ticks,\n  context: IExecContext,\n  executionTree: Lisp[],\n  scopes: IScope[] = [],\n  inLoopOrSwitch?: string,\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(done, ticks, context, executionTree, scope, inLoopOrSwitch);\n  } else {\n    _executeWithDoneAsync(done, ticks, context, executionTree, scope, inLoopOrSwitch).catch(done);\n  }\n}\n\nfunction _executeWithDoneSync(\n  done: Done,\n  ticks: Ticks,\n  context: IExecContext,\n  executionTree: Lisp[],\n  scope: Scope,\n  inLoopOrSwitch?: string,\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        inLoopOrSwitch,\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  inLoopOrSwitch?: string,\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        inLoopOrSwitch,\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","/**\r\n * Parse a string as a base-16 number. This is more strict than `parseInt` as it\r\n * will not allow any other characters, including (for example) \"+\", \"-\", and\r\n * \".\".\r\n * @param hex A string containing a hexadecimal number.\r\n * @returns The parsed integer, or `NaN` if the string is not a valid hex\r\n * number.\r\n */\r\nfunction parseHexToInt(hex: string): number {\r\n  const isOnlyHexChars = !hex.match(/[^a-f0-9]/i);\r\n  return isOnlyHexChars ? parseInt(hex, 16) : NaN;\r\n}\r\n\r\n/**\r\n * Check the validity and length of a hexadecimal code and optionally enforces\r\n * a specific number of hex digits.\r\n * @param hex The string to validate and parse.\r\n * @param errorName The name of the error message to throw a `SyntaxError` with\r\n * if `hex` is invalid. This is used to index `errorMessages`.\r\n * @param enforcedLength If provided, will throw an error if `hex` is not\r\n * exactly this many characters.\r\n * @returns The parsed hex number as a normal number.\r\n * @throws {SyntaxError} If the code is not valid.\r\n */\r\nfunction validateAndParseHex(hex: string, errorName: string, enforcedLength?: number): number {\r\n  const parsedHex = parseHexToInt(hex);\r\n  if (Number.isNaN(parsedHex) || (enforcedLength !== undefined && enforcedLength !== hex.length)) {\r\n    throw new SyntaxError(errorName + ': ' + hex);\r\n  }\r\n  return parsedHex;\r\n}\r\n\r\n/**\r\n * Parse a two-digit hexadecimal character escape code.\r\n * @param code The two-digit hexadecimal number that represents the character to\r\n * output.\r\n * @returns The single character represented by the code.\r\n * @throws {SyntaxError} If the code is not valid hex or is not the right\r\n * length.\r\n */\r\nfunction parseHexadecimalCode(code: string): string {\r\n  const parsedCode = validateAndParseHex(code, 'Malformed Hexadecimal', 2);\r\n  return String.fromCharCode(parsedCode);\r\n}\r\n\r\n/**\r\n * Parse a four-digit Unicode character escape code.\r\n * @param code The four-digit unicode number that represents the character to\r\n * output.\r\n * @param surrogateCode Optional four-digit unicode surrogate that represents\r\n * the other half of the character to output.\r\n * @returns The single character represented by the code.\r\n * @throws {SyntaxError} If the codes are not valid hex or are not the right\r\n * length.\r\n */\r\nfunction parseUnicodeCode(code: string, surrogateCode?: string): string {\r\n  const parsedCode = validateAndParseHex(code, 'Malformed Unicode', 4);\r\n\r\n  if (surrogateCode !== undefined) {\r\n    const parsedSurrogateCode = validateAndParseHex(surrogateCode, 'Malformed Unicode', 4);\r\n    return String.fromCharCode(parsedCode, parsedSurrogateCode);\r\n  }\r\n\r\n  return String.fromCharCode(parsedCode);\r\n}\r\n\r\n/**\r\n * Test if the text is surrounded by curly braces (`{}`).\r\n * @param text Text to check.\r\n * @returns `true` if the text is in the form `{*}`.\r\n */\r\nfunction isCurlyBraced(text: string): boolean {\r\n  return text.charAt(0) === '{' && text.charAt(text.length - 1) === '}';\r\n}\r\n\r\n/**\r\n * Parse a Unicode code point character escape code.\r\n * @param codePoint A unicode escape code point, including the surrounding curly\r\n * braces.\r\n * @returns The single character represented by the code.\r\n * @throws {SyntaxError} If the code is not valid hex or does not have the\r\n * surrounding curly braces.\r\n */\r\nfunction parseUnicodeCodePointCode(codePoint: string): string {\r\n  if (!isCurlyBraced(codePoint)) {\r\n    throw new SyntaxError('Malformed Unicode: +' + codePoint);\r\n  }\r\n  const withoutBraces = codePoint.slice(1, -1);\r\n  const parsedCode = validateAndParseHex(withoutBraces, 'Malformed Unicode');\r\n\r\n  try {\r\n    return String.fromCodePoint(parsedCode);\r\n  } catch (err) {\r\n    throw err instanceof RangeError ? new SyntaxError('Code Point Limit:' + parsedCode) : err;\r\n  }\r\n}\r\n\r\n/**\r\n * Map of unescaped letters to their corresponding special JS escape characters.\r\n * Intentionally does not include characters that map to themselves like \"\\'\".\r\n */\r\nconst singleCharacterEscapes = new Map<string, string>([\r\n  ['b', '\\b'],\r\n  ['f', '\\f'],\r\n  ['n', '\\n'],\r\n  ['r', '\\r'],\r\n  ['t', '\\t'],\r\n  ['v', '\\v'],\r\n  ['0', '\\0'],\r\n]);\r\n\r\n/**\r\n * Parse a single character escape sequence and return the matching character.\r\n * If none is matched, defaults to `code`.\r\n * @param code A single character code.\r\n */\r\nfunction parseSingleCharacterCode(code: string): string {\r\n  return singleCharacterEscapes.get(code) || code;\r\n}\r\n\r\n/**\r\n * Matches every escape sequence possible, including invalid ones.\r\n *\r\n * All capture groups (described below) are unique (only one will match), except\r\n * for 4, which can only potentially match if 3 does.\r\n *\r\n * **Capture Groups:**\r\n * 0. A single backslash\r\n * 1. Hexadecimal code\r\n * 2. Unicode code point code with surrounding curly braces\r\n * 3. Unicode escape code with surrogate\r\n * 4. Surrogate code\r\n * 5. Unicode escape code without surrogate\r\n * 6. Octal code _NOTE: includes \"0\"._\r\n * 7. A single character (will never be \\, x, u, or 0-3)\r\n */\r\nconst escapeMatch =\r\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;\r\n\r\n/**\r\n * Replace raw escape character strings with their escape characters.\r\n * @param raw A string where escape characters are represented as raw string\r\n * values like `\\'` rather than `'`.\r\n * @param allowOctals If `true`, will process the now-deprecated octal escape\r\n * sequences (ie, `\\111`).\r\n * @returns The processed string, with escape characters replaced by their\r\n * respective actual Unicode characters.\r\n */\r\nexport function unraw(raw: string): string {\r\n  return raw.replace(\r\n    escapeMatch,\r\n    function (\r\n      _,\r\n      backslash?: string,\r\n      hex?: string,\r\n      codePoint?: string,\r\n      unicodeWithSurrogate?: string,\r\n      surrogate?: string,\r\n      unicode?: string,\r\n      octal?: string,\r\n      singleCharacter?: string,\r\n    ): string {\r\n      // Compare groups to undefined because empty strings mean different errors\r\n      // Otherwise, `\\u` would fail the same as `\\` which is wrong.\r\n      if (backslash !== undefined) {\r\n        return '\\\\';\r\n      }\r\n      if (hex !== undefined) {\r\n        return parseHexadecimalCode(hex);\r\n      }\r\n      if (codePoint !== undefined) {\r\n        return parseUnicodeCodePointCode(codePoint);\r\n      }\r\n      if (unicodeWithSurrogate !== undefined) {\r\n        return parseUnicodeCode(unicodeWithSurrogate, surrogate);\r\n      }\r\n      if (unicode !== undefined) {\r\n        return parseUnicodeCode(unicode);\r\n      }\r\n      if (octal === '0') {\r\n        return '\\0';\r\n      }\r\n      if (octal !== undefined) {\r\n        throw new SyntaxError('Octal Deprecation: ' + octal);\r\n      }\r\n      if (singleCharacter !== undefined) {\r\n        return parseSingleCharacterCode(singleCharacter);\r\n      }\r\n      throw new SyntaxError('End of string');\r\n    },\r\n  );\r\n}\r\nexport default unraw;\r\n","import unraw from './unraw.js';\r\nimport { CodeString, isLisp, LispType, reservedWords } from './utils.js';\r\n\r\nexport type DefineLisp<\r\n  op extends LispType,\r\n  a extends LispItem | LispItem,\r\n  b extends LispItem | LispItem,\r\n> = [op, a, b];\r\n\r\nexport type ExtractLispOp<L> = L extends DefineLisp<infer i, any, any> ? i : never;\r\nexport type ExtractLispA<L> = L extends DefineLisp<any, infer i, any> ? i : never;\r\nexport type ExtractLispB<L> = L extends DefineLisp<any, any, infer i> ? i : never;\r\n\r\nexport type LispItemSingle = LispType.None | LispType.True | string | Lisp;\r\nexport type LispItem = LispItemSingle | LispItemSingle[];\r\nexport type Lisp = [LispType, LispItem, LispItem];\r\n\r\nfunction createLisp<L extends Lisp>(obj: {\r\n  op: ExtractLispOp<L>;\r\n  a: ExtractLispA<L>;\r\n  b: ExtractLispB<L>;\r\n}) {\r\n  return [obj.op, obj.a, obj.b] as L;\r\n}\r\n\r\nconst NullLisp = createLisp<None>({ op: LispType.None, a: LispType.None, b: LispType.None });\r\n\r\nexport type Literal = DefineLisp<LispType.Literal, string, Lisp[]> & { tempJsStrings?: string[] };\r\nexport type If = DefineLisp<LispType.If, Lisp, IfCase>;\r\nexport type InlineIf = DefineLisp<LispType.InlineIf, Lisp, InlineIfCase>;\r\nexport type IfCase = DefineLisp<LispType.IfCase, Lisp[], Lisp[]>;\r\nexport type InlineIfCase = DefineLisp<LispType.InlineIfCase, Lisp, Lisp>;\r\nexport type KeyVal = DefineLisp<LispType.KeyVal, string | Lisp, Lisp>;\r\nexport type SpreadObject = DefineLisp<LispType.SpreadObject, LispType.None, Lisp>;\r\nexport type SpreadArray = DefineLisp<LispType.SpreadArray, LispType.None, Lisp>;\r\nexport type ArrayProp = DefineLisp<LispType.ArrayProp, Lisp, Lisp>;\r\nexport type Prop = DefineLisp<LispType.Prop, Lisp, string | Lisp>;\r\nexport type PropOptional = DefineLisp<LispType.PropOptional, Lisp, Lisp[]>;\r\nexport type Call = DefineLisp<LispType.Call, Lisp, Lisp[]>;\r\nexport type CallOptional = DefineLisp<LispType.CallOptional, Lisp, Lisp[]>;\r\nexport type CreateArray = DefineLisp<LispType.CreateArray, Lisp, Lisp[]>;\r\nexport type CreateObject = DefineLisp<LispType.CreateObject, Lisp, Lisp[]>;\r\nexport type Group = DefineLisp<LispType.Group, Lisp, Lisp[]>;\r\nexport type Inverse = DefineLisp<LispType.Inverse, Lisp, Lisp>;\r\nexport type Not = DefineLisp<LispType.Not, Lisp, Lisp>;\r\nexport type Negative = DefineLisp<LispType.Negative, Lisp, Lisp>;\r\nexport type Positive = DefineLisp<LispType.Positive, Lisp, Lisp>;\r\nexport type Typeof = DefineLisp<LispType.Typeof, Lisp, Lisp>;\r\nexport type Delete = DefineLisp<LispType.Delete, Lisp, Lisp>;\r\nexport type IncrementBefore = DefineLisp<LispType.IncrementBefore, Lisp, LispType.None>;\r\nexport type IncrementAfter = DefineLisp<LispType.IncrementAfter, Lisp, LispType.None>;\r\nexport type DecrementBefore = DefineLisp<LispType.DecrementBefore, Lisp, LispType.None>;\r\nexport type DecrementAfter = DefineLisp<LispType.DecrementAfter, Lisp, LispType.None>;\r\n\r\nexport type And = DefineLisp<LispType.And, Lisp, Lisp>;\r\nexport type Or = DefineLisp<LispType.Or, Lisp, Lisp>;\r\nexport type NullishCoalescing = DefineLisp<LispType.NullishCoalescing, Lisp, Lisp>;\r\nexport type Instanceof = DefineLisp<LispType.Instanceof, Lisp, Lisp>;\r\nexport type In = DefineLisp<LispType.In, Lisp, Lisp>;\r\nexport type Assigns = DefineLisp<LispType.Assign, Lisp, Lisp>;\r\nexport type SubractEquals = DefineLisp<LispType.SubractEquals, Lisp, Lisp>;\r\nexport type AddEquals = DefineLisp<LispType.AddEquals, Lisp, Lisp>;\r\nexport type DivideEquals = DefineLisp<LispType.DivideEquals, Lisp, Lisp>;\r\nexport type PowerEquals = DefineLisp<LispType.PowerEquals, Lisp, Lisp>;\r\nexport type MultiplyEquals = DefineLisp<LispType.MultiplyEquals, Lisp, Lisp>;\r\nexport type ModulusEquals = DefineLisp<LispType.ModulusEquals, Lisp, Lisp>;\r\nexport type BitNegateEquals = DefineLisp<LispType.BitNegateEquals, Lisp, Lisp>;\r\nexport type BitAndEquals = DefineLisp<LispType.BitAndEquals, Lisp, Lisp>;\r\nexport type BitOrEquals = DefineLisp<LispType.BitOrEquals, Lisp, Lisp>;\r\nexport type UnsignedShiftRightEquals = DefineLisp<LispType.UnsignedShiftRightEquals, Lisp, Lisp>;\r\nexport type ShiftLeftEquals = DefineLisp<LispType.ShiftLeftEquals, Lisp, Lisp>;\r\nexport type ShiftRightEquals = DefineLisp<LispType.ShiftRightEquals, Lisp, Lisp>;\r\nexport type AndEquals = DefineLisp<LispType.AndEquals, Lisp, Lisp>;\r\nexport type OrEquals = DefineLisp<LispType.OrEquals, Lisp, Lisp>;\r\nexport type NullishCoalescingEquals = DefineLisp<LispType.NullishCoalescingEquals, Lisp, Lisp>;\r\n\r\nexport type BitAnd = DefineLisp<LispType.BitAnd, Lisp, Lisp>;\r\nexport type BitOr = DefineLisp<LispType.BitOr, Lisp, Lisp>;\r\nexport type BitNegate = DefineLisp<LispType.BitNegate, Lisp, Lisp>;\r\nexport type BitShiftLeft = DefineLisp<LispType.BitShiftLeft, Lisp, Lisp>;\r\nexport type BitShiftRight = DefineLisp<LispType.BitShiftRight, Lisp, Lisp>;\r\nexport type BitUnsignedShiftRight = DefineLisp<LispType.BitUnsignedShiftRight, Lisp, Lisp>;\r\nexport type SmallerEqualThan = DefineLisp<LispType.SmallerEqualThan, Lisp, Lisp>;\r\nexport type LargerEqualThan = DefineLisp<LispType.LargerEqualThan, Lisp, Lisp>;\r\nexport type SmallerThan = DefineLisp<LispType.SmallerThan, Lisp, Lisp>;\r\nexport type LargerThan = DefineLisp<LispType.LargerThan, Lisp, Lisp>;\r\nexport type StrictNotEqual = DefineLisp<LispType.StrictNotEqual, Lisp, Lisp>;\r\nexport type NotEqual = DefineLisp<LispType.NotEqual, Lisp, Lisp>;\r\nexport type StrictEqual = DefineLisp<LispType.StrictEqual, Lisp, Lisp>;\r\nexport type Equal = DefineLisp<LispType.Equal, Lisp, Lisp>;\r\nexport type Plus = DefineLisp<LispType.Plus, Lisp, Lisp>;\r\nexport type Minus = DefineLisp<LispType.Minus, Lisp, Lisp>;\r\nexport type Divide = DefineLisp<LispType.Divide, Lisp, Lisp>;\r\nexport type Power = DefineLisp<LispType.Power, Lisp, Lisp>;\r\nexport type Multiply = DefineLisp<LispType.Multiply, Lisp, Lisp>;\r\nexport type Modulus = DefineLisp<LispType.Modulus, Lisp, Lisp>;\r\n\r\nexport type Block = DefineLisp<LispType.Block, Lisp[], LispType.None>;\r\nexport type Expression = DefineLisp<LispType.Expression, Lisp[], LispType.None>;\r\nexport type Return = DefineLisp<LispType.Return, LispType.None, Lisp>;\r\nexport type Throw = DefineLisp<LispType.Throw, LispType.None, Lisp>;\r\nexport type Switch = DefineLisp<LispType.Switch, Lisp, SwitchCase[]>;\r\nexport type SwitchCase = DefineLisp<LispType.SwitchCase, LispType.None | Lisp, Lisp[]>;\r\nexport type Var = DefineLisp<LispType.Var, string, Lisp | LispType.None>;\r\nexport type Let = DefineLisp<LispType.Let, string, Lisp | LispType.None>;\r\nexport type Const = DefineLisp<LispType.Const, string, Lisp | LispType.None>;\r\n\r\nexport type Number = DefineLisp<LispType.Number, LispType.None, string>;\r\nexport type BigInt = DefineLisp<LispType.BigInt, LispType.None, string>;\r\nexport type GlobalSymbol = DefineLisp<LispType.GlobalSymbol, LispType.None, string>;\r\nexport type LiteralIndex = DefineLisp<LispType.LiteralIndex, LispType.None, string>;\r\nexport type StringIndex = DefineLisp<LispType.StringIndex, LispType.None, string>;\r\nexport type RegexIndex = DefineLisp<LispType.RegexIndex, LispType.None, string>;\r\n\r\nexport type Function = DefineLisp<\r\n  LispType.Function,\r\n  (string | LispType.None | LispType.True)[],\r\n  string | Lisp[]\r\n>;\r\nexport type InlineFunction = DefineLisp<LispType.InlineFunction, string[], string | Lisp[]>;\r\nexport type ArrowFunction = DefineLisp<LispType.ArrowFunction, string[], string | Lisp[]>;\r\nexport type Loop = DefineLisp<LispType.Loop, LispItem, Lisp[]>;\r\nexport type LoopAction = DefineLisp<LispType.LoopAction, string, LispType.None>;\r\nexport type Try = DefineLisp<LispType.Try, Lisp[], LispItem>;\r\n\r\nexport type Void = DefineLisp<LispType.Void, Lisp, LispType.None>;\r\nexport type Await = DefineLisp<LispType.Await, Lisp, LispType.None>;\r\nexport type New = DefineLisp<LispType.New, Lisp, Lisp[]>;\r\nexport type None = DefineLisp<LispType.None, LispType.None, LispType.None>;\r\n\r\nexport type LispFamily =\r\n  | Literal\r\n  | If\r\n  | InlineIf\r\n  | IfCase\r\n  | InlineIfCase\r\n  | KeyVal\r\n  | SpreadObject\r\n  | SpreadArray\r\n  | ArrayProp\r\n  | Prop\r\n  | PropOptional\r\n  | Call\r\n  | CallOptional\r\n  | CreateArray\r\n  | CreateObject\r\n  | Group\r\n  | Inverse\r\n  | Not\r\n  | Negative\r\n  | Positive\r\n  | Typeof\r\n  | Delete\r\n  | IncrementBefore\r\n  | IncrementAfter\r\n  | DecrementBefore\r\n  | DecrementAfter\r\n  | And\r\n  | Or\r\n  | NullishCoalescing\r\n  | Instanceof\r\n  | In\r\n  | Assigns\r\n  | SubractEquals\r\n  | AddEquals\r\n  | DivideEquals\r\n  | PowerEquals\r\n  | MultiplyEquals\r\n  | ModulusEquals\r\n  | BitNegateEquals\r\n  | BitAndEquals\r\n  | BitOrEquals\r\n  | UnsignedShiftRightEquals\r\n  | ShiftLeftEquals\r\n  | ShiftRightEquals\r\n  | AndEquals\r\n  | OrEquals\r\n  | NullishCoalescingEquals\r\n  | BitAnd\r\n  | BitOr\r\n  | BitNegate\r\n  | BitShiftLeft\r\n  | BitShiftRight\r\n  | BitUnsignedShiftRight\r\n  | SmallerEqualThan\r\n  | LargerEqualThan\r\n  | SmallerThan\r\n  | LargerThan\r\n  | StrictNotEqual\r\n  | NotEqual\r\n  | StrictEqual\r\n  | Equal\r\n  | Plus\r\n  | Minus\r\n  | Divide\r\n  | Power\r\n  | Multiply\r\n  | Modulus\r\n  | Block\r\n  | Expression\r\n  | Return\r\n  | Throw\r\n  | Switch\r\n  | SwitchCase\r\n  | Var\r\n  | Let\r\n  | Const\r\n  | Number\r\n  | BigInt\r\n  | GlobalSymbol\r\n  | LiteralIndex\r\n  | StringIndex\r\n  | RegexIndex\r\n  | Function\r\n  | InlineFunction\r\n  | ArrowFunction\r\n  | Loop\r\n  | LoopAction\r\n  | Try\r\n  | Void\r\n  | Await\r\n  | New\r\n  | None;\r\n\r\nexport interface IRegEx {\r\n  regex: string;\r\n  flags: string;\r\n  length: number;\r\n}\r\n\r\nexport interface IConstants {\r\n  strings: string[];\r\n  literals: Literal[];\r\n  regexes: IRegEx[];\r\n  eager: boolean;\r\n}\r\n\r\nexport interface IExecutionTree {\r\n  tree: Lisp[];\r\n  constants: IConstants;\r\n}\r\n\r\ntype LispCallback<T> = (\r\n  strings: IConstants,\r\n  type: T,\r\n  part: CodeString,\r\n  res: string[],\r\n  expect: string,\r\n  ctx: { lispTree: Lisp },\r\n) => any;\r\nconst lispTypes: Map<string, LispCallback<string>> = new Map();\r\n\r\nexport class ParseError extends Error {\r\n  constructor(\r\n    message: string,\r\n    public code: string,\r\n  ) {\r\n    super(message + ': ' + code.substring(0, 40));\r\n  }\r\n}\r\n\r\nlet lastType: CodeString | string;\r\nlet lastPart: CodeString | string;\r\nlet lastLastPart: CodeString | string;\r\nlet lastLastLastPart: CodeString | string;\r\nlet lastLastLastLastPart: CodeString | string;\r\n\r\nconst inlineIfElse = /^:/;\r\nconst elseIf = /^else(?![\\w$])/;\r\nconst ifElse = /^if(?![\\w$])/;\r\nconst space = /^\\s/;\r\n\r\nexport const expectTypes = {\r\n  splitter: {\r\n    types: {\r\n      power: /^(\\*\\*)(?!=)/,\r\n      opHigh: /^(\\/|\\*(?!\\*)|%)(?!=)/,\r\n      op: /^(\\+(?!(\\+))|-(?!(-)))(?!=)/,\r\n      comparitor: /^(<=|>=|<(?!<)|>(?!>)|!==|!=(?!=)|===|==)/,\r\n      bitwiseShift: /^(<<|>>(?!>)|>>>)(?!=)/,\r\n      bitwiseAnd: /^(&(?!&))(?!=)/,\r\n      bitwiseXor: /^(\\^)(?!=)/,\r\n      bitwiseOr: /^(\\|(?!\\|))(?!=)/,\r\n      boolOpAnd: /^(&&)(?!=)/,\r\n      boolOpOr: /^(\\|\\|(?!=)|instanceof(?![\\w$])|in(?![\\w$]))/,\r\n      nullishCoalescing: /^\\?\\?(?!=)/,\r\n    },\r\n    next: ['modifier', 'value', 'prop', 'incrementerBefore'],\r\n  },\r\n  inlineIf: {\r\n    types: {\r\n      inlineIf: /^\\?(?!\\.(?!\\d))/,\r\n    },\r\n    next: ['expEnd'],\r\n  },\r\n  assignment: {\r\n    types: {\r\n      assignModify: /^(-=|\\+=|\\/=|\\*\\*=|\\*=|%=|\\^=|&=|\\|=|>>>=|>>=|<<=|&&=|\\|\\|=|\\?\\?=)/,\r\n      assign: /^(=)(?!=)/,\r\n    },\r\n    next: ['modifier', 'value', 'prop', 'incrementerBefore'],\r\n  },\r\n  incrementerBefore: {\r\n    types: { incrementerBefore: /^(\\+\\+|--)/ },\r\n    next: ['prop'],\r\n  },\r\n  expEdge: {\r\n    types: {\r\n      call: /^(\\?\\.)?[(]/,\r\n      incrementerAfter: /^(\\+\\+|--)/,\r\n      taggedTemplate: /^`(\\d+)`/,\r\n    },\r\n    next: ['splitter', 'expEdge', 'dot', 'inlineIf', 'expEnd'],\r\n  },\r\n  modifier: {\r\n    types: {\r\n      not: /^!/,\r\n      inverse: /^~/,\r\n      negative: /^-(?!-)/,\r\n      positive: /^\\+(?!\\+)/,\r\n      typeof: /^typeof(?![\\w$])/,\r\n      delete: /^delete(?![\\w$])/,\r\n    },\r\n    next: ['modifier', 'value', 'prop', 'incrementerBefore'],\r\n  },\r\n  dot: {\r\n    types: {\r\n      arrayProp: /^(\\?\\.)?\\[/,\r\n      dot: /^(\\?)?\\.(?=\\s*[a-zA-Z$_])/,\r\n    },\r\n    next: ['splitter', 'assignment', 'expEdge', 'dot', 'inlineIf', 'expEnd'],\r\n  },\r\n  prop: {\r\n    types: {\r\n      prop: /^[a-zA-Z$_][a-zA-Z\\d$_]*/,\r\n    },\r\n    next: ['splitter', 'assignment', 'expEdge', 'dot', 'inlineIf', 'expEnd'],\r\n  },\r\n  value: {\r\n    types: {\r\n      createObject: /^\\{/,\r\n      createArray: /^\\[/,\r\n      number:\r\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,\r\n      string: /^\"(\\d+)\"/,\r\n      literal: /^`(\\d+)`/,\r\n      regex: /^\\/(\\d+)\\/r(?![\\w$])/,\r\n      boolean: /^(true|false)(?![\\w$])/,\r\n      null: /^null(?![\\w$])/,\r\n      und: /^undefined(?![\\w$])/,\r\n      arrowFunctionSingle: /^(async\\s+)?([a-zA-Z$_][a-zA-Z\\d$_]*)\\s*=>\\s*({)?/,\r\n      arrowFunction:\r\n        /^(async\\s*)?\\(\\s*((\\.\\.\\.)?\\s*[a-zA-Z$_][a-zA-Z\\d$_]*(\\s*,\\s*(\\.\\.\\.)?\\s*[a-zA-Z$_][a-zA-Z\\d$_]*)*)?\\s*\\)\\s*=>\\s*({)?/,\r\n      inlineFunction:\r\n        /^(async\\s+)?function(\\s*[a-zA-Z$_][a-zA-Z\\d$_]*)?\\s*\\(\\s*((\\.\\.\\.)?\\s*[a-zA-Z$_][a-zA-Z\\d$_]*(\\s*,\\s*(\\.\\.\\.)?\\s*[a-zA-Z$_][a-zA-Z\\d$_]*)*)?\\s*\\)\\s*{/,\r\n      group: /^\\(/,\r\n      NaN: /^NaN(?![\\w$])/,\r\n      Infinity: /^Infinity(?![\\w$])/,\r\n      void: /^void(?![\\w$])\\s*/,\r\n      await: /^await(?![\\w$])\\s*/,\r\n      new: /^new(?![\\w$])\\s*/,\r\n    },\r\n    next: ['splitter', 'expEdge', 'dot', 'inlineIf', 'expEnd'],\r\n  },\r\n  initialize: {\r\n    types: {\r\n      initialize: /^(var|let|const)\\s+([a-zA-Z$_][a-zA-Z\\d$_]*)\\s*(=)?/,\r\n      return: /^return(?![\\w$])/,\r\n      throw: /^throw(?![\\w$])\\s*/,\r\n    },\r\n    next: ['modifier', 'value', 'prop', 'incrementerBefore', 'expEnd'],\r\n  },\r\n  spreadObject: {\r\n    types: {\r\n      spreadObject: /^\\.\\.\\./,\r\n    },\r\n    next: ['value', 'prop'],\r\n  },\r\n  spreadArray: {\r\n    types: {\r\n      spreadArray: /^\\.\\.\\./,\r\n    },\r\n    next: ['value', 'prop'],\r\n  },\r\n  expEnd: { types: {}, next: [] },\r\n  expFunction: {\r\n    types: {\r\n      function:\r\n        /^(async\\s+)?function(\\s*[a-zA-Z$_][a-zA-Z\\d$_]*)\\s*\\(\\s*((\\.\\.\\.)?\\s*[a-zA-Z$_][a-zA-Z\\d$_]*(\\s*,\\s*(\\.\\.\\.)?\\s*[a-zA-Z$_][a-zA-Z\\d$_]*)*)?\\s*\\)\\s*{/,\r\n    },\r\n    next: ['expEdge', 'expEnd'],\r\n  },\r\n  expSingle: {\r\n    types: {\r\n      for: /^(([a-zA-Z$_][\\w$]*)\\s*:)?\\s*for\\s*\\(/,\r\n      do: /^(([a-zA-Z$_][\\w$]*)\\s*:)?\\s*do(?![\\w$])\\s*(\\{)?/,\r\n      while: /^(([a-zA-Z$_][\\w$]*)\\s*:)?\\s*while\\s*\\(/,\r\n      loopAction: /^(break|continue)(?![\\w$])\\s*([a-zA-Z$_][\\w$]*)?/,\r\n      if: /^((([a-zA-Z$_][\\w$]*)\\s*:)?\\s*)if\\s*\\(/,\r\n      try: /^try\\s*{/,\r\n      block: /^{/,\r\n      switch: /^(([a-zA-Z$_][\\w$]*)\\s*:)?\\s*switch\\s*\\(/,\r\n    },\r\n    next: ['expEnd'],\r\n  },\r\n} as Record<string, { types: Record<string, RegExp>; next: string[] }>;\r\n\r\nconst closings = {\r\n  '(': ')',\r\n  '[': ']',\r\n  '{': '}',\r\n  \"'\": \"'\",\r\n  '\"': '\"',\r\n  '`': '`',\r\n} as Record<string, string>;\r\n\r\nexport function testMultiple(str: string, tests: RegExp[]) {\r\n  let found: RegExpExecArray | null = null;\r\n  for (let i = 0; i < tests.length; i++) {\r\n    const test = tests[i];\r\n    found = test.exec(str);\r\n    if (found) break;\r\n  }\r\n  return found;\r\n}\r\n\r\nconst emptyString = new CodeString('');\r\n\r\nconst okFirstChars = /^[+\\-~ !]/;\r\nconst aNumber = expectTypes.value.types.number;\r\nconst wordReg = /^((if|for|else|while|do|function)(?![\\w$])|[\\w$]+)/;\r\nconst semiColon = /^;/;\r\nconst insertedSemicolons: WeakMap<{ str: string }, Array<number>> = new WeakMap();\r\nconst quoteCache: WeakMap<{ str: string }, Map<number, number>> = new WeakMap();\r\nexport interface restDetails {\r\n  oneliner?: boolean;\r\n  words?: string[];\r\n  lastWord?: string;\r\n  lastAnyWord?: string;\r\n  regRes?: RegExpExecArray;\r\n  bodyContentAfterKeyword?: boolean;\r\n}\r\nexport function restOfExp(\r\n  constants: IConstants,\r\n  part: CodeString,\r\n  tests?: RegExp[],\r\n  quote?: string,\r\n  firstOpening?: string,\r\n  closingsTests?: RegExp[],\r\n  details: restDetails = {},\r\n): CodeString {\r\n  if (!part.length) {\r\n    return part;\r\n  }\r\n  details.words = details.words || [];\r\n  let isStart = true;\r\n  tests = tests || [];\r\n  const hasSemiTest = tests.includes(semiColon);\r\n  if (hasSemiTest) {\r\n    tests = tests.filter((a) => a !== semiColon);\r\n  }\r\n  const insertedSemis = insertedSemicolons.get(part.ref) || [];\r\n  const cache = quoteCache.get(part.ref) || new Map<number, number>();\r\n  quoteCache.set(part.ref, cache);\r\n  if (quote && cache.has(part.start - 1)) {\r\n    return part.substring(0, cache.get(part.start - 1)! - part.start);\r\n  }\r\n  let escape = false;\r\n  let done = false;\r\n  let lastChar = '';\r\n  let isOneLiner = false;\r\n  let i;\r\n  let lastInertedSemi = false;\r\n  let seenKeyword = false;\r\n  let skipNextWord = false;\r\n  for (i = 0; i < part.length && !done; i++) {\r\n    let char = part.char(i)!;\r\n    if (quote === '\"' || quote === \"'\" || quote === '`') {\r\n      if (quote === '`' && char === '$' && part.char(i + 1) === '{' && !escape) {\r\n        const skip = restOfExp(constants, part.substring(i + 2), [], '{');\r\n        i += skip.length + 2;\r\n      } else if (char === quote && !escape) {\r\n        return part.substring(0, i);\r\n      }\r\n      escape = !escape && char === '\\\\';\r\n    } else if (closings[char]) {\r\n      if (!lastInertedSemi && insertedSemis[i + part.start]) {\r\n        lastInertedSemi = true;\r\n        if (hasSemiTest) {\r\n          break;\r\n        }\r\n        i--;\r\n        lastChar = ';';\r\n        continue;\r\n      }\r\n      if (isOneLiner && char === '{') {\r\n        isOneLiner = false;\r\n      }\r\n      if (char === firstOpening) {\r\n        done = true;\r\n        break;\r\n      } else {\r\n        const skip = restOfExp(constants, part.substring(i + 1), [], char);\r\n        cache.set(skip.start - 1, skip.end);\r\n        i += skip.length + 1;\r\n        isStart = false;\r\n        if (closingsTests) {\r\n          const sub = part.substring(i);\r\n          let found: RegExpExecArray | null;\r\n          if ((found = testMultiple(sub.toString(), closingsTests))) {\r\n            details.regRes = found;\r\n            done = true;\r\n          }\r\n        }\r\n      }\r\n    } else if (!quote) {\r\n      let sub = part.substring(i).toString();\r\n      let foundWord: RegExpExecArray | null;\r\n      let foundNumber: RegExpExecArray | null;\r\n      if (closingsTests) {\r\n        let found: RegExpExecArray | null;\r\n        if ((found = testMultiple(sub, closingsTests))) {\r\n          details.regRes = found;\r\n          i++;\r\n          done = true;\r\n          break;\r\n        }\r\n      }\r\n      if ((foundNumber = aNumber.exec(sub))) {\r\n        i += foundNumber[0].length - 1;\r\n        sub = part.substring(i).toString();\r\n        if (closingsTests) {\r\n          let found: RegExpExecArray | null;\r\n          if ((found = testMultiple(sub, closingsTests))) {\r\n            details.regRes = found;\r\n            i++;\r\n            done = true;\r\n            break;\r\n          }\r\n        }\r\n      } else if (lastChar != char) {\r\n        let found: [string] | RegExpExecArray | null = null;\r\n        if (char === ';' || (insertedSemis[i + part.start] && !isStart && !lastInertedSemi)) {\r\n          if (hasSemiTest) {\r\n            found = [';'];\r\n          } else if (insertedSemis[i + part.start]) {\r\n            lastInertedSemi = true;\r\n            i--;\r\n            lastChar = ';';\r\n            continue;\r\n          }\r\n          char = sub = ';';\r\n        } else {\r\n          lastInertedSemi = false;\r\n        }\r\n        if (!found) {\r\n          found = testMultiple(sub, tests);\r\n        }\r\n        if (found) {\r\n          done = true;\r\n        }\r\n        if (!done && (foundWord = wordReg.exec(sub))) {\r\n          isOneLiner = true;\r\n          if (foundWord[2]) {\r\n            seenKeyword = true;\r\n            skipNextWord = true;\r\n          } else if (seenKeyword) {\r\n            if (skipNextWord) {\r\n              skipNextWord = false;\r\n            } else {\r\n              details.bodyContentAfterKeyword = true;\r\n            }\r\n          }\r\n          if (foundWord[0].length > 1) {\r\n            details.words.push(foundWord[1]);\r\n            details.lastAnyWord = foundWord[1];\r\n            if (foundWord[2]) {\r\n              details.lastWord = foundWord[2];\r\n            }\r\n          }\r\n          if (foundWord[0].length > 2) {\r\n            i += foundWord[0].length - 2;\r\n          }\r\n        }\r\n      }\r\n      if (isStart) {\r\n        if (okFirstChars.test(sub)) {\r\n          done = false;\r\n        } else {\r\n          isStart = false;\r\n        }\r\n      }\r\n      if (done) break;\r\n    } else if (char === closings[quote]) {\r\n      return part.substring(0, i);\r\n    }\r\n    lastChar = char;\r\n  }\r\n  if (quote) {\r\n    throw new SyntaxError(\"Unclosed '\" + quote + \"'\");\r\n  }\r\n  if (details) {\r\n    details.oneliner = isOneLiner;\r\n  }\r\n  return part.substring(0, i);\r\n}\r\nrestOfExp.next = ['splitter', 'expEnd', 'inlineIf'];\r\n\r\nconst startingExecpted = [\r\n  'initialize',\r\n  'expSingle',\r\n  'expFunction',\r\n  'value',\r\n  'modifier',\r\n  'prop',\r\n  'incrementerBefore',\r\n  'expEnd',\r\n];\r\n\r\nexport const setLispType = <T extends readonly string[]>(types: T, fn: LispCallback<T[number]>) => {\r\n  types.forEach((type) => {\r\n    lispTypes.set(type, fn);\r\n  });\r\n};\r\n\r\nconst closingsCreate: { [type: string]: RegExp } = {\r\n  createArray: /^\\]/,\r\n  createObject: /^\\}/,\r\n  group: /^\\)/,\r\n  arrayProp: /^\\]/,\r\n  call: /^\\)/,\r\n};\r\n\r\nconst typesCreate = {\r\n  createArray: LispType.CreateArray,\r\n  createObject: LispType.CreateObject,\r\n  group: LispType.Group,\r\n  arrayProp: LispType.ArrayProp,\r\n  call: LispType.Call,\r\n  prop: LispType.Prop,\r\n  '?prop': LispType.PropOptional,\r\n  '?call': LispType.CallOptional,\r\n} as any;\r\n\r\nsetLispType(\r\n  ['createArray', 'createObject', 'group', 'arrayProp', 'call'] as const,\r\n  (constants, type, part, res, expect, ctx) => {\r\n    let extract = emptyString;\r\n    const arg: CodeString[] = [];\r\n    let end = false;\r\n    let i = res[0].length;\r\n    const start = i;\r\n    while (i < part.length && !end) {\r\n      extract = restOfExp(constants, part.substring(i), [closingsCreate[type], /^,/]);\r\n      i += extract.length;\r\n      if (extract.trim().length) {\r\n        arg.push(extract);\r\n      }\r\n      if (part.char(i) !== ',') {\r\n        end = true;\r\n      } else {\r\n        i++;\r\n      }\r\n    }\r\n    const next = ['value', 'modifier', 'prop', 'incrementerBefore', 'expEnd'];\r\n    let l: Lisp | Lisp[];\r\n\r\n    let funcFound: RegExpExecArray | null;\r\n    switch (type) {\r\n      case 'group':\r\n      case 'arrayProp':\r\n        l = lispifyExpr(constants, part.substring(start, i));\r\n        break;\r\n      case 'call':\r\n      case 'createArray':\r\n        // @TODO: support 'empty' values\r\n        l = arg.map((e) => lispify(constants, e, [...next, 'spreadArray']));\r\n        break;\r\n      case 'createObject':\r\n        l = arg.map((str) => {\r\n          str = str.trimStart();\r\n          let value: Lisp;\r\n          let key: string | Lisp = '';\r\n          funcFound = expectTypes.expFunction.types.function.exec('function ' + str);\r\n          if (funcFound) {\r\n            key = funcFound[2].trimStart();\r\n            value = lispify(\r\n              constants,\r\n              new CodeString('function ' + str.toString().replace(key, '')),\r\n            );\r\n          } else {\r\n            const extract = restOfExp(constants, str, [/^:/]);\r\n            key = lispify(constants, extract, [...next, 'spreadObject']) as Prop;\r\n\r\n            // Check if this is a spread object\r\n            if (isLisp(key) && key[0] === LispType.SpreadObject) {\r\n              // For spread objects, there's no separate value\r\n              value = NullLisp;\r\n            } else {\r\n              // Extract the property name from Prop if needed\r\n              if (key[0] === LispType.Prop) {\r\n                key = (key as Prop)[2];\r\n              }\r\n\r\n              // Check if there's a colon (property with value) or not (property shorthand)\r\n              if (str.length > extract.length && str.char(extract.length) === ':') {\r\n                // Property with explicit value: {key: value}\r\n                value = lispify(constants, str.substring(extract.length + 1));\r\n              } else {\r\n                // Property shorthand: {key} is equivalent to {key: key}\r\n                // Parse the key name as a variable reference\r\n                value = lispify(constants, extract, next);\r\n              }\r\n            }\r\n          }\r\n          return createLisp<KeyVal>({\r\n            op: LispType.KeyVal,\r\n            a: key,\r\n            b: value,\r\n          });\r\n        });\r\n        break;\r\n    }\r\n    const lisptype = (\r\n      type === 'arrayProp'\r\n        ? res[1]\r\n          ? LispType.PropOptional\r\n          : LispType.Prop\r\n        : type === 'call'\r\n          ? res[1]\r\n            ? LispType.CallOptional\r\n            : LispType.Call\r\n          : typesCreate[type]\r\n    ) as (typeof typesCreate)[keyof typeof typesCreate];\r\n    ctx.lispTree = lispify(\r\n      constants,\r\n      part.substring(i + 1),\r\n      expectTypes[expect].next,\r\n      createLisp<\r\n        ArrayProp | Prop | Call | CreateObject | CreateArray | Group | PropOptional | CallOptional\r\n      >({\r\n        op: lisptype,\r\n        a: ctx.lispTree,\r\n        b: l,\r\n      }),\r\n    );\r\n  },\r\n);\r\n\r\nconst modifierTypes = {\r\n  inverse: LispType.Inverse,\r\n  not: LispType.Not,\r\n  positive: LispType.Positive,\r\n  negative: LispType.Negative,\r\n  typeof: LispType.Typeof,\r\n  delete: LispType.Delete,\r\n} as const;\r\n\r\nsetLispType(\r\n  ['inverse', 'not', 'negative', 'positive', 'typeof', 'delete'] as const,\r\n  (constants, type, part, res, expect, ctx) => {\r\n    const extract = restOfExp(constants, part.substring(res[0].length), [/^([^\\s.?\\w$]|\\?[^.])/]);\r\n\r\n    // Check if the extracted expression contains an exponentiation operator at the top level\r\n    // ECMAScript disallows unary operators before ** without parentheses\r\n    const remainingAfterOperand = part.substring(extract.length + res[0].length);\r\n    const remainingStr = remainingAfterOperand.trim().toString();\r\n    if (remainingStr.startsWith('**')) {\r\n      throw new SyntaxError(\r\n        'Unary operator used immediately before exponentiation expression. Parenthesis must be used to disambiguate operator precedence',\r\n      );\r\n    }\r\n\r\n    ctx.lispTree = lispify(\r\n      constants,\r\n      part.substring(extract.length + res[0].length),\r\n      restOfExp.next,\r\n      createLisp<Inverse | Not | Negative | Positive | Typeof | Delete>({\r\n        op: modifierTypes[type],\r\n        a: ctx.lispTree,\r\n        b: lispify(constants, extract, expectTypes[expect].next),\r\n      }),\r\n    );\r\n  },\r\n);\r\n\r\nsetLispType(['taggedTemplate'] as const, (constants, type, part, res, expect, ctx) => {\r\n  // Tagged template: func`template`\r\n  // Build a call with the literal strings array and interpolated values\r\n  const literalIndex = res[1];\r\n  const literal = constants.literals[parseInt(literalIndex)];\r\n  const [, templateStr, jsExprs] = literal;\r\n\r\n  // Extract the string parts and expression parts\r\n  const stringParts: string[] = [];\r\n  const expressions: Lisp[] = [];\r\n  let currentStr = '';\r\n  let i = 0;\r\n\r\n  while (i < templateStr.length) {\r\n    if (templateStr.substring(i, i + 2) === '${') {\r\n      // Look ahead to check if this is a valid placeholder: ${digits}\r\n      let j = i + 2;\r\n      let exprIndex = '';\r\n      let isValidPlaceholder = false;\r\n\r\n      // Extract potential index and check for closing '}'\r\n      while (j < templateStr.length && templateStr[j] !== '}') {\r\n        exprIndex += templateStr[j];\r\n        j++;\r\n      }\r\n\r\n      // Check if we found a closing '}' and the content is numeric\r\n      if (j < templateStr.length && templateStr[j] === '}' && /^\\d+$/.test(exprIndex)) {\r\n        isValidPlaceholder = true;\r\n      }\r\n\r\n      if (isValidPlaceholder) {\r\n        // Valid placeholder - add current string and the expression\r\n        stringParts.push(currentStr);\r\n        currentStr = '';\r\n        expressions.push(jsExprs[parseInt(exprIndex)]);\r\n        i = j + 1; // skip past the '}'\r\n      } else {\r\n        // Not a valid placeholder - treat as literal text\r\n        currentStr += templateStr[i];\r\n        i++;\r\n      }\r\n    } else {\r\n      currentStr += templateStr[i];\r\n      i++;\r\n    }\r\n  }\r\n  stringParts.push(currentStr);\r\n\r\n  // Create array of string literals\r\n  const stringsArray = stringParts.map((str) =>\r\n    createLisp<StringIndex>({\r\n      op: LispType.StringIndex,\r\n      a: LispType.None,\r\n      b: String(constants.strings.push(str) - 1),\r\n    }),\r\n  );\r\n\r\n  // Create the strings array\r\n  const stringsArrayLisp = createLisp<CreateArray>({\r\n    op: LispType.CreateArray,\r\n    a: createLisp({\r\n      op: LispType.None,\r\n      a: LispType.None,\r\n      b: LispType.None,\r\n    }),\r\n    b: stringsArray,\r\n  });\r\n\r\n  // Create call with tag function\r\n  ctx.lispTree = lispify(\r\n    constants,\r\n    part.substring(res[0].length),\r\n    expectTypes[expect].next,\r\n    createLisp<Call>({\r\n      op: LispType.Call,\r\n      a: ctx.lispTree,\r\n      b: [stringsArrayLisp, ...expressions],\r\n    }),\r\n  );\r\n});\r\n\r\nconst incrementTypes = {\r\n  '++$': LispType.IncrementBefore,\r\n  '--$': LispType.DecrementBefore,\r\n  '$++': LispType.IncrementAfter,\r\n  '$--': LispType.DecrementAfter,\r\n} as any;\r\n\r\nsetLispType(['incrementerBefore'] as const, (constants, type, part, res, expect, ctx) => {\r\n  const extract = restOfExp(constants, part.substring(2), [/^[^\\s.\\w$]/]);\r\n  ctx.lispTree = lispify(\r\n    constants,\r\n    part.substring(extract.length + 2),\r\n    restOfExp.next,\r\n    createLisp<IncrementBefore | DecrementBefore>({\r\n      op: incrementTypes[res[0] + '$'],\r\n      a: lispify(constants, extract, expectTypes[expect].next),\r\n      b: LispType.None,\r\n    }),\r\n  );\r\n});\r\n\r\nsetLispType(['incrementerAfter'] as const, (constants, type, part, res, expect, ctx) => {\r\n  ctx.lispTree = lispify(\r\n    constants,\r\n    part.substring(res[0].length),\r\n    expectTypes[expect].next,\r\n    createLisp<IncrementAfter | DecrementAfter>({\r\n      op: incrementTypes['$' + res[0]],\r\n      a: ctx.lispTree,\r\n      b: LispType.None,\r\n    }),\r\n  );\r\n});\r\n\r\nconst adderTypes = {\r\n  '&&': LispType.And,\r\n  '||': LispType.Or,\r\n  '??': LispType.NullishCoalescing,\r\n  instanceof: LispType.Instanceof,\r\n  in: LispType.In,\r\n  '=': LispType.Assign,\r\n  '-=': LispType.SubractEquals,\r\n  '+=': LispType.AddEquals,\r\n  '/=': LispType.DivideEquals,\r\n  '**=': LispType.PowerEquals,\r\n  '*=': LispType.MultiplyEquals,\r\n  '%=': LispType.ModulusEquals,\r\n  '^=': LispType.BitNegateEquals,\r\n  '&=': LispType.BitAndEquals,\r\n  '|=': LispType.BitOrEquals,\r\n  '>>>=': LispType.UnsignedShiftRightEquals,\r\n  '<<=': LispType.ShiftLeftEquals,\r\n  '>>=': LispType.ShiftRightEquals,\r\n  '&&=': LispType.AndEquals,\r\n  '||=': LispType.OrEquals,\r\n  '??=': LispType.NullishCoalescingEquals,\r\n} as any;\r\n\r\nsetLispType(\r\n  ['assign', 'assignModify', 'nullishCoalescing'] as const,\r\n  (constants, type, part, res, expect, ctx) => {\r\n    ctx.lispTree = createLisp<\r\n      | NullishCoalescing\r\n      | Assigns\r\n      | SubractEquals\r\n      | AddEquals\r\n      | DivideEquals\r\n      | PowerEquals\r\n      | MultiplyEquals\r\n      | ModulusEquals\r\n      | BitNegateEquals\r\n      | BitAndEquals\r\n      | BitOrEquals\r\n      | UnsignedShiftRightEquals\r\n      | ShiftLeftEquals\r\n      | ShiftRightEquals\r\n      | AndEquals\r\n      | OrEquals\r\n      | NullishCoalescingEquals\r\n    >({\r\n      op: adderTypes[res[0]],\r\n      a: ctx.lispTree,\r\n      b: lispify(constants, part.substring(res[0].length), expectTypes[expect].next),\r\n    });\r\n  },\r\n);\r\n\r\nconst opTypes = {\r\n  '&': LispType.BitAnd,\r\n  '|': LispType.BitOr,\r\n  '^': LispType.BitNegate,\r\n  '<<': LispType.BitShiftLeft,\r\n  '>>': LispType.BitShiftRight,\r\n  '>>>': LispType.BitUnsignedShiftRight,\r\n  '<=': LispType.SmallerEqualThan,\r\n  '>=': LispType.LargerEqualThan,\r\n  '<': LispType.SmallerThan,\r\n  '>': LispType.LargerThan,\r\n  '!==': LispType.StrictNotEqual,\r\n  '!=': LispType.NotEqual,\r\n  '===': LispType.StrictEqual,\r\n  '==': LispType.Equal,\r\n  '+': LispType.Plus,\r\n  '-': LispType.Minus,\r\n  '/': LispType.Divide,\r\n  '**': LispType.Power,\r\n  '*': LispType.Multiply,\r\n  '%': LispType.Modulus,\r\n  '&&': LispType.And,\r\n  '||': LispType.Or,\r\n  instanceof: LispType.Instanceof,\r\n  in: LispType.In,\r\n} as any;\r\n\r\n// Combined handler for all binary operators with configurable precedence\r\nsetLispType(\r\n  [\r\n    'power',\r\n    'opHigh',\r\n    'op',\r\n    'comparitor',\r\n    'bitwiseShift',\r\n    'bitwiseAnd',\r\n    'bitwiseXor',\r\n    'bitwiseOr',\r\n    'boolOpAnd',\r\n    'boolOpOr',\r\n  ] as const,\r\n  (constants, type, part, res, expect, ctx) => {\r\n    const next = [expectTypes.inlineIf.types.inlineIf, inlineIfElse];\r\n    switch (type) {\r\n      case 'power':\r\n        // Right-associative: don't include power in next\r\n        break;\r\n      case 'opHigh':\r\n        // opHigh should NOT stop at power - let it be consumed by the right operand\r\n        next.push(expectTypes.splitter.types.opHigh);\r\n      case 'op':\r\n        next.push(expectTypes.splitter.types.op);\r\n      case 'comparitor':\r\n        next.push(expectTypes.splitter.types.comparitor);\r\n      case 'bitwiseShift':\r\n        next.push(expectTypes.splitter.types.bitwiseShift);\r\n      case 'bitwiseAnd':\r\n        next.push(expectTypes.splitter.types.bitwiseAnd);\r\n      case 'bitwiseXor':\r\n        next.push(expectTypes.splitter.types.bitwiseXor);\r\n      case 'bitwiseOr':\r\n        next.push(expectTypes.splitter.types.bitwiseOr);\r\n      case 'boolOpAnd':\r\n        next.push(expectTypes.splitter.types.boolOpAnd);\r\n      case 'boolOpOr':\r\n        next.push(expectTypes.splitter.types.boolOpOr);\r\n    }\r\n    const extract = restOfExp(constants, part.substring(res[0].length), next);\r\n    ctx.lispTree = lispify(\r\n      constants,\r\n      part.substring(extract.length + res[0].length),\r\n      restOfExp.next,\r\n      createLisp<\r\n        | BitAnd\r\n        | BitOr\r\n        | BitNegate\r\n        | BitShiftLeft\r\n        | BitShiftRight\r\n        | BitUnsignedShiftRight\r\n        | SmallerEqualThan\r\n        | LargerEqualThan\r\n        | SmallerThan\r\n        | LargerThan\r\n        | StrictNotEqual\r\n        | NotEqual\r\n        | StrictEqual\r\n        | Equal\r\n        | Plus\r\n        | Minus\r\n        | Divide\r\n        | Power\r\n        | Multiply\r\n        | Modulus\r\n        | And\r\n        | Or\r\n        | Instanceof\r\n        | In\r\n      >({\r\n        op: opTypes[res[0]],\r\n        a: ctx.lispTree,\r\n        b: lispify(constants, extract, expectTypes[expect].next),\r\n      }),\r\n    );\r\n  },\r\n);\r\n\r\nsetLispType(['inlineIf'] as const, (constants, type, part, res, expect, ctx) => {\r\n  let found = false;\r\n  const extract = part.substring(0, 0);\r\n  let quoteCount = 1;\r\n  while (!found && extract.length < part.length) {\r\n    extract.end = restOfExp(constants, part.substring(extract.length + 1), [\r\n      expectTypes.inlineIf.types.inlineIf,\r\n      inlineIfElse,\r\n    ]).end;\r\n    if (part.char(extract.length) === '?') {\r\n      quoteCount++;\r\n    } else {\r\n      quoteCount--;\r\n    }\r\n    if (!quoteCount) {\r\n      found = true;\r\n    }\r\n  }\r\n  extract.start = part.start + 1;\r\n  ctx.lispTree = createLisp<InlineIf>({\r\n    op: LispType.InlineIf,\r\n    a: ctx.lispTree,\r\n    b: createLisp<InlineIfCase>({\r\n      op: LispType.InlineIfCase,\r\n      a: lispifyExpr(constants, extract),\r\n      b: lispifyExpr(constants, part.substring(res[0].length + extract.length + 1)),\r\n    }),\r\n  });\r\n});\r\n\r\nfunction extractIfElse(constants: IConstants, part: CodeString) {\r\n  let count = 0;\r\n  let found = part.substring(0, 0);\r\n  let foundElse = emptyString;\r\n  let foundTrue: CodeString | undefined;\r\n  let first = true;\r\n  let elseReg: RegExpExecArray | null;\r\n  let details: restDetails = {};\r\n  while (\r\n    (found = restOfExp(\r\n      constants,\r\n      part.substring(found.end - part.start),\r\n      [elseIf, ifElse, semiColon],\r\n      undefined,\r\n      undefined,\r\n      undefined,\r\n      details,\r\n    )).length ||\r\n    first\r\n  ) {\r\n    first = false;\r\n    const f = part.substring(found.end - part.start).toString();\r\n\r\n    if (f.startsWith('if')) {\r\n      found.end++;\r\n      count++;\r\n    } else if (f.startsWith('else')) {\r\n      foundTrue = part.substring(0, found.end - part.start);\r\n      found.end++;\r\n      count--;\r\n      if (!count) {\r\n        found.end--;\r\n      }\r\n    } else if ((elseReg = /^;?\\s*else(?![\\w$])/.exec(f))) {\r\n      foundTrue = part.substring(0, found.end - part.start);\r\n      found.end += elseReg[0].length - 1;\r\n      count--;\r\n      if (!count) {\r\n        found.end -= elseReg[0].length - 1;\r\n      }\r\n    } else {\r\n      foundTrue = foundElse.length ? foundTrue : part.substring(0, found.end - part.start);\r\n      break;\r\n    }\r\n    if (!count) {\r\n      const ie = extractIfElse(\r\n        constants,\r\n        part.substring(found.end - part.start + (/^;?\\s*else(?![\\w$])/.exec(f)?.[0].length || 0)),\r\n      );\r\n      foundElse = ie.all;\r\n      break;\r\n    }\r\n    details = {};\r\n  }\r\n  foundTrue = foundTrue || part.substring(0, found.end - part.start);\r\n  return {\r\n    all: part.substring(0, Math.max(foundTrue.end, foundElse.end) - part.start),\r\n    true: foundTrue,\r\n    false: foundElse,\r\n  };\r\n}\r\n\r\nsetLispType(['if'] as const, (constants, type, part, res, expect, ctx) => {\r\n  let condition = restOfExp(constants, part.substring(res[0].length), [], '(');\r\n  const ie = extractIfElse(constants, part.substring(res[1].length));\r\n  const startTrue = res[0].length - res[1].length + condition.length + 1;\r\n\r\n  let trueBlock = ie.true.substring(startTrue);\r\n  let elseBlock = ie.false;\r\n\r\n  condition = condition.trim();\r\n  trueBlock = trueBlock.trim();\r\n  elseBlock = elseBlock.trim();\r\n\r\n  if (trueBlock.char(0) === '{') trueBlock = trueBlock.slice(1, -1);\r\n  if (elseBlock.char(0) === '{') elseBlock = elseBlock.slice(1, -1);\r\n  ctx.lispTree = createLisp<If>({\r\n    op: LispType.If,\r\n    a: lispifyExpr(constants, condition),\r\n    b: createLisp<IfCase>({\r\n      op: LispType.IfCase,\r\n      a: lispifyBlock(trueBlock, constants),\r\n      b: lispifyBlock(elseBlock, constants),\r\n    }),\r\n  });\r\n});\r\n\r\nsetLispType(['switch'] as const, (constants, type, part, res, expect, ctx) => {\r\n  const test = restOfExp(constants, part.substring(res[0].length), [], '(');\r\n  let start = part.toString().indexOf('{', res[0].length + test.length + 1);\r\n  if (start === -1) throw new SyntaxError('Invalid switch');\r\n  let statement = insertSemicolons(\r\n    constants,\r\n    restOfExp(constants, part.substring(start + 1), [], '{'),\r\n  );\r\n  let caseFound: RegExpExecArray | null;\r\n  const caseTest = /^\\s*(case\\s|default)\\s*/;\r\n  const cases: SwitchCase[] = [];\r\n  let defaultFound = false;\r\n  while ((caseFound = caseTest.exec(statement.toString()))) {\r\n    if (caseFound[1] === 'default') {\r\n      if (defaultFound) throw new SyntaxError('Only one default switch case allowed');\r\n      defaultFound = true;\r\n    }\r\n    const cond = restOfExp(constants, statement.substring(caseFound[0].length), [/^:/]);\r\n    let found = emptyString;\r\n    let i = (start = caseFound[0].length + cond.length + 1);\r\n    const bracketFound = /^\\s*\\{/.exec(statement.substring(i).toString());\r\n    let exprs: Lisp[] = [];\r\n    if (bracketFound) {\r\n      i += bracketFound[0].length;\r\n      found = restOfExp(constants, statement.substring(i), [], '{');\r\n      i += found.length + 1;\r\n      exprs = lispifyBlock(found, constants);\r\n    } else {\r\n      const notEmpty = restOfExp(constants, statement.substring(i), [caseTest]);\r\n      if (!notEmpty.trim().length) {\r\n        exprs = [];\r\n        i += notEmpty.length;\r\n      } else {\r\n        while ((found = restOfExp(constants, statement.substring(i), [semiColon])).length) {\r\n          i += found.length + (statement.char(i + found.length) === ';' ? 1 : 0);\r\n          if (caseTest.test(statement.substring(i).toString())) {\r\n            break;\r\n          }\r\n        }\r\n        exprs = lispifyBlock(statement.substring(start, found.end - statement.start), constants);\r\n      }\r\n    }\r\n    statement = statement.substring(i);\r\n    cases.push(\r\n      createLisp<SwitchCase>({\r\n        op: LispType.SwitchCase,\r\n        a: caseFound[1] === 'default' ? LispType.None : lispifyExpr(constants, cond),\r\n        b: exprs,\r\n      }),\r\n    );\r\n  }\r\n  ctx.lispTree = createLisp<Switch>({\r\n    op: LispType.Switch,\r\n    a: lispifyExpr(constants, test),\r\n    b: cases,\r\n  });\r\n});\r\n\r\nsetLispType(['dot', 'prop'] as const, (constants, type, part, res, expect, ctx) => {\r\n  let prop = res[0];\r\n  let index = res[0].length;\r\n  let op = 'prop';\r\n  if (type === 'dot') {\r\n    if (res[1]) {\r\n      op = '?prop';\r\n    }\r\n    const matches = part.substring(res[0].length).toString().match(expectTypes.prop.types.prop);\r\n    if (matches && matches.length) {\r\n      prop = matches[0];\r\n      index = prop.length + res[0].length;\r\n    } else {\r\n      throw new SyntaxError('Hanging dot');\r\n    }\r\n  } else {\r\n    if (reservedWords.has(prop) && prop !== 'this') {\r\n      throw new SyntaxError(`Unexpected token '${prop}'`);\r\n    }\r\n  }\r\n  ctx.lispTree = lispify(\r\n    constants,\r\n    part.substring(index),\r\n    expectTypes[expect].next,\r\n    createLisp<Prop | PropOptional>({\r\n      op: typesCreate[op],\r\n      a: ctx.lispTree,\r\n      b: prop,\r\n    }),\r\n  );\r\n});\r\n\r\nsetLispType(['spreadArray', 'spreadObject'] as const, (constants, type, part, res, expect, ctx) => {\r\n  ctx.lispTree = createLisp<SpreadArray | SpreadObject>({\r\n    op: type === 'spreadArray' ? LispType.SpreadArray : LispType.SpreadObject,\r\n    a: LispType.None,\r\n    b: lispify(constants, part.substring(res[0].length), expectTypes[expect].next),\r\n  });\r\n});\r\n\r\nsetLispType(['return', 'throw'] as const, (constants, type, part, res, expect, ctx) => {\r\n  ctx.lispTree = createLisp<Return | Throw>({\r\n    op: type === 'return' ? LispType.Return : LispType.Throw,\r\n    a: LispType.None,\r\n    b: lispifyExpr(constants, part.substring(res[0].length)),\r\n  });\r\n});\r\n\r\nsetLispType(\r\n  ['number', 'boolean', 'null', 'und', 'NaN', 'Infinity'] as const,\r\n  (constants, type, part, res, expect, ctx) => {\r\n    ctx.lispTree = lispify(\r\n      constants,\r\n      part.substring(res[0].length),\r\n      expectTypes[expect].next,\r\n      createLisp<Number | BigInt | GlobalSymbol>({\r\n        op:\r\n          type === 'number' ? (res[12] ? LispType.BigInt : LispType.Number) : LispType.GlobalSymbol,\r\n        a: LispType.None,\r\n        b: res[12] ? res[1] : res[0],\r\n      }),\r\n    );\r\n  },\r\n);\r\n\r\nsetLispType(['string', 'literal', 'regex'] as const, (constants, type, part, res, expect, ctx) => {\r\n  ctx.lispTree = lispify(\r\n    constants,\r\n    part.substring(res[0].length),\r\n    expectTypes[expect].next,\r\n    createLisp<StringIndex | LiteralIndex | RegexIndex>({\r\n      op:\r\n        type === 'string'\r\n          ? LispType.StringIndex\r\n          : type === 'literal'\r\n            ? LispType.LiteralIndex\r\n            : LispType.RegexIndex,\r\n      a: LispType.None,\r\n      b: res[1],\r\n    }),\r\n  );\r\n});\r\n\r\nsetLispType(['initialize'] as const, (constants, type, part, res, expect, ctx) => {\r\n  const lt = res[1] === 'var' ? LispType.Var : res[1] === 'let' ? LispType.Let : LispType.Const;\r\n  if (!res[3]) {\r\n    ctx.lispTree = lispify(\r\n      constants,\r\n      part.substring(res[0].length),\r\n      expectTypes[expect].next,\r\n      createLisp<Var | Let | Const>({\r\n        op: lt,\r\n        a: res[2],\r\n        b: LispType.None,\r\n      }),\r\n    );\r\n  } else {\r\n    ctx.lispTree = createLisp<Var | Let | Const>({\r\n      op: lt,\r\n      a: res[2],\r\n      b: lispify(constants, part.substring(res[0].length), expectTypes[expect].next),\r\n    });\r\n  }\r\n});\r\n\r\nsetLispType(\r\n  ['function', 'inlineFunction', 'arrowFunction', 'arrowFunctionSingle'] as const,\r\n  (constants, type, part, res, expect, ctx) => {\r\n    const isArrow = type !== 'function' && type !== 'inlineFunction';\r\n    const isReturn = isArrow && !res[res.length - 1];\r\n    const argPos = isArrow ? 2 : 3;\r\n    const isAsync = res[1] ? LispType.True : LispType.None;\r\n    const args: string[] = res[argPos] ? res[argPos].replace(/\\s+/g, '').split(/,/g) : [];\r\n    if (!isArrow) {\r\n      args.unshift((res[2] || '').trimStart());\r\n    }\r\n    let ended = false;\r\n    args.forEach((arg: string) => {\r\n      if (ended) throw new SyntaxError('Rest parameter must be last formal parameter');\r\n      if (arg.startsWith('...')) ended = true;\r\n    });\r\n    const f = restOfExp(\r\n      constants,\r\n      part.substring(res[0].length),\r\n      !isReturn ? [/^}/] : [/^[,)}\\]]/, semiColon],\r\n    );\r\n    const func = isReturn ? 'return ' + f : f.toString();\r\n    args.forEach((arg: string) => {\r\n      if (reservedWords.has(arg.replace(/^\\.\\.\\./, ''))) {\r\n        throw new SyntaxError(`Unexpected token '${arg}'`);\r\n      }\r\n    });\r\n    ctx.lispTree = lispify(\r\n      constants,\r\n      part.substring(res[0].length + func.length + 1),\r\n      expectTypes[expect].next,\r\n      createLisp<Function | InlineFunction | ArrowFunction>({\r\n        op: isArrow\r\n          ? LispType.ArrowFunction\r\n          : type === 'function'\r\n            ? LispType.Function\r\n            : LispType.InlineFunction,\r\n        a: [isAsync, ...args],\r\n        b: constants.eager ? lispifyFunction(new CodeString(func), constants) : func,\r\n      }),\r\n    );\r\n  },\r\n);\r\n\r\nconst iteratorRegex = /^((let|var|const)\\s+)?\\s*([a-zA-Z$_][a-zA-Z\\d$_]*)\\s+(in|of)(?![\\w$])/;\r\nsetLispType(['for', 'do', 'while'] as const, (constants, type, part, res, expect, ctx) => {\r\n  let i = 0;\r\n  let startStep: LispItem = LispType.True;\r\n  let startInternal: Lisp[] = [];\r\n  let getIterator: Lisp | LispType.None = LispType.None;\r\n  let beforeStep: LispItem = LispType.None;\r\n  let checkFirst = LispType.True;\r\n  let condition: LispItem;\r\n  let step: LispItem = LispType.True;\r\n  let body: CodeString;\r\n  switch (type) {\r\n    case 'while': {\r\n      i = part.toString().indexOf('(') + 1;\r\n      const extract = restOfExp(constants, part.substring(i), [], '(');\r\n      condition = lispifyReturnExpr(constants, extract);\r\n      body = restOfExp(constants, part.substring(i + extract.length + 1)).trim();\r\n      if (body.char(0) === '{') body = body.slice(1, -1);\r\n      break;\r\n    }\r\n    case 'for': {\r\n      i = part.toString().indexOf('(') + 1;\r\n      const args: CodeString[] = [];\r\n      let extract2 = emptyString;\r\n      for (let k = 0; k < 3; k++) {\r\n        extract2 = restOfExp(constants, part.substring(i), [/^[;)]/]);\r\n        args.push(extract2.trim());\r\n        i += extract2.length + 1;\r\n        if (part.char(i - 1) === ')') break;\r\n      }\r\n      let iterator: RegExpExecArray | null;\r\n      if (args.length === 1 && (iterator = iteratorRegex.exec(args[0].toString()))) {\r\n        if (iterator[4] === 'of') {\r\n          ((getIterator = lispifyReturnExpr(constants, args[0].substring(iterator[0].length))),\r\n            (startInternal = [ofStart2, ofStart3]));\r\n          condition = ofCondition;\r\n          step = ofStep;\r\n          beforeStep = lispify(\r\n            constants,\r\n            new CodeString((iterator[1] || 'let ') + iterator[3] + ' = $$next.value'),\r\n            ['initialize'],\r\n          );\r\n        } else {\r\n          ((getIterator = lispifyReturnExpr(constants, args[0].substring(iterator[0].length))),\r\n            (startInternal = [inStart2, inStart3]));\r\n          step = inStep;\r\n          condition = inCondition;\r\n          beforeStep = lispify(\r\n            constants,\r\n            new CodeString((iterator[1] || 'let ') + iterator[3] + ' = $$keys[$$keyIndex]'),\r\n            ['initialize'],\r\n          );\r\n        }\r\n      } else if (args.length === 3) {\r\n        startStep = lispifyExpr(constants, args.shift()!, startingExecpted);\r\n        condition = lispifyReturnExpr(constants, args.shift()!);\r\n        step = lispifyExpr(constants, args.shift()!);\r\n      } else {\r\n        throw new SyntaxError('Invalid for loop definition');\r\n      }\r\n      body = restOfExp(constants, part.substring(i)).trim();\r\n      if (body.char(0) === '{') body = body.slice(1, -1);\r\n\r\n      break;\r\n    }\r\n    case 'do': {\r\n      checkFirst = LispType.None;\r\n      const isBlock = !!res[3];\r\n      body = restOfExp(constants, part.substring(res[0].length), isBlock ? [/^\\}/] : [semiColon]);\r\n      condition = lispifyReturnExpr(\r\n        constants,\r\n        restOfExp(\r\n          constants,\r\n          part.substring(part.toString().indexOf('(', res[0].length + body.length) + 1),\r\n          [],\r\n          '(',\r\n        ),\r\n      );\r\n      break;\r\n    }\r\n  }\r\n  const a = [\r\n    checkFirst,\r\n    startInternal,\r\n    getIterator,\r\n    startStep,\r\n    step,\r\n    condition,\r\n    beforeStep,\r\n  ] as LispItem;\r\n  ctx.lispTree = createLisp<Loop>({\r\n    op: LispType.Loop,\r\n    a,\r\n    b: lispifyBlock(body, constants),\r\n  });\r\n});\r\n\r\nsetLispType(['block'] as const, (constants, type, part, res, expect, ctx) => {\r\n  ctx.lispTree = createLisp<Block>({\r\n    op: LispType.Block,\r\n    a: lispifyBlock(restOfExp(constants, part.substring(1), [], '{'), constants),\r\n    b: LispType.None,\r\n  });\r\n});\r\n\r\nsetLispType(['loopAction'] as const, (constants, type, part, res, expect, ctx) => {\r\n  ctx.lispTree = createLisp<LoopAction>({\r\n    op: LispType.LoopAction,\r\n    a: res[1],\r\n    b: LispType.None,\r\n  });\r\n});\r\n\r\nconst catchReg = /^\\s*(catch\\s*(\\(\\s*([a-zA-Z$_][a-zA-Z\\d$_]*)\\s*\\))?|finally)\\s*\\{/;\r\nsetLispType(['try'] as const, (constants, type, part, res, expect, ctx) => {\r\n  const body = restOfExp(constants, part.substring(res[0].length), [], '{');\r\n  let catchRes = catchReg.exec(part.substring(res[0].length + body.length + 1).toString());\r\n  let finallyBody;\r\n  let exception = '';\r\n  let catchBody;\r\n  let offset = 0;\r\n  if (catchRes![1].startsWith('catch')) {\r\n    catchRes = catchReg.exec(part.substring(res[0].length + body.length + 1).toString());\r\n    exception = catchRes![3] || ''; // Use group 3 for the identifier, or empty string if optional catch binding\r\n    catchBody = restOfExp(\r\n      constants,\r\n      part.substring(res[0].length + body.length + 1 + catchRes![0].length),\r\n      [],\r\n      '{',\r\n    );\r\n    offset = res[0].length + body.length + 1 + catchRes![0].length + catchBody.length + 1;\r\n    if (\r\n      (catchRes = catchReg.exec(part.substring(offset).toString())) &&\r\n      catchRes[1].startsWith('finally')\r\n    ) {\r\n      finallyBody = restOfExp(constants, part.substring(offset + catchRes[0].length), [], '{');\r\n    }\r\n  } else {\r\n    finallyBody = restOfExp(\r\n      constants,\r\n      part.substring(res[0].length + body.length + 1 + catchRes![0].length),\r\n      [],\r\n      '{',\r\n    );\r\n  }\r\n  const b = [\r\n    exception,\r\n    lispifyBlock(insertSemicolons(constants, catchBody || emptyString), constants),\r\n    lispifyBlock(insertSemicolons(constants, finallyBody || emptyString), constants),\r\n  ] as LispItem;\r\n  ctx.lispTree = createLisp<Try>({\r\n    op: LispType.Try,\r\n    a: lispifyBlock(insertSemicolons(constants, body), constants),\r\n    b,\r\n  });\r\n});\r\n\r\nsetLispType(['void', 'await'] as const, (constants, type, part, res, expect, ctx) => {\r\n  const extract = restOfExp(constants, part.substring(res[0].length), [/^([^\\s.?\\w$]|\\?[^.])/]);\r\n  ctx.lispTree = lispify(\r\n    constants,\r\n    part.substring(res[0].length + extract.length),\r\n    expectTypes[expect].next,\r\n    createLisp<Void | Await>({\r\n      op: type === 'void' ? LispType.Void : LispType.Await,\r\n      a: lispify(constants, extract),\r\n      b: LispType.None,\r\n    }),\r\n  );\r\n});\r\n\r\nsetLispType(['new'] as const, (constants, type, part, res, expect, ctx) => {\r\n  let i = res[0].length;\r\n  const obj = restOfExp(constants, part.substring(i), [], undefined, '(');\r\n  i += obj.length + 1;\r\n  const args: CodeString[] = [];\r\n  if (part.char(i - 1) === '(') {\r\n    const argsString = restOfExp(constants, part.substring(i), [], '(');\r\n    i += argsString.length + 1;\r\n    let found: CodeString;\r\n    let j = 0;\r\n    while ((found = restOfExp(constants, argsString.substring(j), [/^,/])).length) {\r\n      j += found.length + 1;\r\n      args.push(found.trim());\r\n    }\r\n  }\r\n  ctx.lispTree = lispify(\r\n    constants,\r\n    part.substring(i),\r\n    expectTypes.expEdge.next,\r\n    createLisp({\r\n      op: LispType.New,\r\n      a: lispify(constants, obj, expectTypes.initialize.next),\r\n      b: args.map((arg) => lispify(constants, arg, expectTypes.initialize.next)),\r\n    }),\r\n  );\r\n});\r\n\r\nconst ofStart2 = lispify(\r\n  undefined as any,\r\n  new CodeString('let $$iterator = $$obj[Symbol.iterator]()'),\r\n  ['initialize'],\r\n);\r\nconst ofStart3 = lispify(undefined as any, new CodeString('let $$next = $$iterator.next()'), [\r\n  'initialize',\r\n]);\r\nconst ofCondition = lispify(undefined as any, new CodeString('return !$$next.done'), [\r\n  'initialize',\r\n]);\r\nconst ofStep = lispify(undefined as any, new CodeString('$$next = $$iterator.next()'));\r\nconst inStart2 = lispify(undefined as any, new CodeString('let $$keys = Object.keys($$obj)'), [\r\n  'initialize',\r\n]);\r\nconst inStart3 = lispify(undefined as any, new CodeString('let $$keyIndex = 0'), ['initialize']);\r\nconst inStep = lispify(undefined as any, new CodeString('$$keyIndex++'));\r\nconst inCondition = lispify(undefined as any, new CodeString('return $$keyIndex < $$keys.length'), [\r\n  'initialize',\r\n]);\r\n\r\nfunction lispify(\r\n  constants: IConstants,\r\n  part: CodeString,\r\n  expected?: readonly string[],\r\n  lispTree?: Lisp,\r\n  topLevel = false,\r\n): Lisp {\r\n  lispTree = lispTree || NullLisp;\r\n  expected = expected || expectTypes.initialize.next;\r\n  if (part === undefined) return lispTree;\r\n\r\n  part = part.trimStart();\r\n  const str = part.toString();\r\n  if (!part.length && !expected.includes('expEnd')) {\r\n    throw new SyntaxError('Unexpected end of expression');\r\n  }\r\n  if (!part.length) return lispTree;\r\n\r\n  const ctx = { lispTree: lispTree };\r\n\r\n  let res: any;\r\n  for (const expect of expected) {\r\n    if (expect === 'expEnd') {\r\n      continue;\r\n    }\r\n    for (const type in expectTypes[expect].types) {\r\n      if (type === 'expEnd') {\r\n        continue;\r\n      }\r\n      if ((res = expectTypes[expect].types[type].exec(str))) {\r\n        lastType = type;\r\n        lastLastLastLastPart = lastLastLastPart;\r\n        lastLastLastPart = lastLastPart;\r\n        lastLastPart = lastPart;\r\n        lastPart = part;\r\n        try {\r\n          lispTypes.get(type)?.(constants, type, part, res, expect, ctx);\r\n        } catch (e) {\r\n          if (topLevel && e instanceof SyntaxError) {\r\n            throw new ParseError(e.message, str);\r\n          }\r\n          throw e;\r\n        }\r\n        break;\r\n      }\r\n    }\r\n    if (res) break;\r\n  }\r\n\r\n  if (!res && part.length) {\r\n    if (topLevel) {\r\n      throw new ParseError(`Unexpected token after ${lastType}: ${part.char(0)}`, str);\r\n    }\r\n    throw new SyntaxError(`Unexpected token after ${lastType}: ${part.char(0)}`);\r\n  }\r\n  return ctx.lispTree;\r\n}\r\n\r\nconst startingExpectedWithoutSingle = startingExecpted.filter((r) => r !== 'expSingle');\r\n\r\nfunction lispifyExpr(constants: IConstants, str: CodeString, expected?: readonly string[]): Lisp {\r\n  if (!str.trimStart().length) return NullLisp;\r\n  const subExpressions: CodeString[] = [];\r\n  let sub: CodeString;\r\n  let pos = 0;\r\n  expected = expected || expectTypes.initialize.next;\r\n  if (expected.includes('expSingle')) {\r\n    if (testMultiple(str.toString(), Object.values(expectTypes.expSingle.types))) {\r\n      return lispify(constants, str, ['expSingle'], undefined, true);\r\n    }\r\n  }\r\n  if (expected === startingExecpted) expected = startingExpectedWithoutSingle;\r\n  while ((sub = restOfExp(constants, str.substring(pos), [/^,/])).length) {\r\n    subExpressions.push(sub.trimStart());\r\n    pos += sub.length + 1;\r\n  }\r\n  if (subExpressions.length === 1) {\r\n    return lispify(constants, str, expected, undefined, true);\r\n  }\r\n  if (expected.includes('initialize')) {\r\n    const defined = expectTypes.initialize.types.initialize.exec(subExpressions[0].toString());\r\n    if (defined) {\r\n      return createLisp<Block>({\r\n        op: LispType.Block,\r\n        a: subExpressions.map((str, i) =>\r\n          lispify(\r\n            constants,\r\n            i ? new CodeString(defined![1] + ' ' + str) : str,\r\n            ['initialize'],\r\n            undefined,\r\n            true,\r\n          ),\r\n        ),\r\n        b: LispType.None,\r\n      });\r\n    } else if (expectTypes.initialize.types.return.exec(subExpressions[0].toString())) {\r\n      return lispify(constants, str, expected, undefined, true);\r\n    }\r\n  }\r\n  const exprs = subExpressions.map((str) => lispify(constants, str, expected, undefined, true));\r\n  return createLisp<Expression>({ op: LispType.Expression, a: exprs, b: LispType.None });\r\n}\r\n\r\nexport function lispifyReturnExpr(constants: IConstants, str: CodeString) {\r\n  return createLisp<Return>({\r\n    op: LispType.Return,\r\n    a: LispType.None,\r\n    b: lispifyExpr(constants, str),\r\n  });\r\n}\r\n\r\nexport function lispifyBlock(str: CodeString, constants: IConstants, expression = false): Lisp[] {\r\n  str = insertSemicolons(constants, str);\r\n  if (!str.trim().length) return [];\r\n  const parts: CodeString[] = [];\r\n  let part: CodeString;\r\n  let pos = 0;\r\n  let start = 0;\r\n  let details: restDetails = {};\r\n  let skipped = false;\r\n  let isInserted = false;\r\n  while (\r\n    (part = restOfExp(\r\n      constants,\r\n      str.substring(pos),\r\n      [semiColon],\r\n      undefined,\r\n      undefined,\r\n      undefined,\r\n      details,\r\n    )).length\r\n  ) {\r\n    isInserted = !!(str.char(pos + part.length) && str.char(pos + part.length) !== ';');\r\n    pos += part.length + (isInserted ? 0 : 1);\r\n    if (/^\\s*else(?![\\w$])/.test(str.substring(pos).toString())) {\r\n      skipped = true;\r\n    } else if (\r\n      details['words']?.includes('do') &&\r\n      /^\\s*while(?![\\w$])/.test(str.substring(pos).toString())\r\n    ) {\r\n      skipped = true;\r\n    } else {\r\n      skipped = false;\r\n      parts.push(str.substring(start, pos - (isInserted ? 0 : 1)));\r\n      start = pos;\r\n    }\r\n    details = {};\r\n    if (expression) break;\r\n  }\r\n  if (skipped) {\r\n    parts.push(str.substring(start, pos - (isInserted ? 0 : 1)));\r\n  }\r\n  return parts\r\n    .map((str) => str.trimStart())\r\n    .filter((str) => str.length)\r\n    .map((str) => {\r\n      return lispifyExpr(constants, str.trimStart(), startingExecpted);\r\n    });\r\n}\r\n\r\nexport function lispifyFunction(\r\n  str: CodeString,\r\n  constants: IConstants,\r\n  expression = false,\r\n): Lisp[] {\r\n  if (!str.trim().length) return [];\r\n  const tree = lispifyBlock(str, constants, expression);\r\n  hoist(tree);\r\n  return tree;\r\n}\r\n\r\nfunction hoist(item: LispItem, res: Lisp[] = []): boolean {\r\n  if (isLisp(item)) {\r\n    if (!isLisp<LispFamily>(item)) return false;\r\n    const [op, a, b] = item;\r\n    if (\r\n      op === LispType.Try ||\r\n      op === LispType.If ||\r\n      op === LispType.Loop ||\r\n      op === LispType.Switch\r\n    ) {\r\n      hoist(a, res);\r\n      hoist(b, res);\r\n    } else if (op === LispType.Var) {\r\n      res.push(createLisp({ op: LispType.Var, a: a, b: LispType.None }));\r\n    } else if (op === LispType.Function && a[1]) {\r\n      res.push(item);\r\n      return true;\r\n    }\r\n  } else if (Array.isArray(item)) {\r\n    const rep: LispItemSingle[] = [];\r\n    for (const it of item) {\r\n      if (!hoist(it, res)) {\r\n        rep.push(it);\r\n      }\r\n    }\r\n    if (rep.length !== item.length) {\r\n      item.length = 0;\r\n      item.push(...res, ...rep);\r\n    }\r\n  }\r\n  return false;\r\n}\r\n\r\nconst closingsNoInsertion = /^(\\})\\s*(catch|finally|else|while|instanceof)(?![\\w$])/;\r\n//  \\w|)|] \\n \\w = 2                                  // \\} \\w|\\{ = 5\r\nconst colonsRegex = /^((([\\w$\\])\"'`]|\\+\\+|--)\\s*\\r?\\n\\s*([\\w$+\\-!~]))|(\\}\\s*[\\w$!~+\\-{(\"'`]))/;\r\n\r\n// if () \\w \\n; \\w              == \\w \\n \\w    | last === if             a\r\n// if () { }; \\w                == \\} ^else    | last === if             b\r\n// if () \\w \\n; else \\n \\w \\n;  == \\w \\n \\w    | last === else           a\r\n// if () {} else {}; \\w         == \\} \\w       | last === else           b\r\n// while () \\n \\w \\n; \\w        == \\w \\n \\w    | last === while          a\r\n// while () { }; \\w             == \\} \\w       | last === while          b\r\n// do \\w \\n; while (); \\w       == \\w \\n while | last === do             a\r\n// do { } while (); \\w          == \\) \\w       | last === while          c\r\n// try {} catch () {}; \\w       == \\} \\w       | last === catch|finally  b\r\n// \\w \\n; \\w                    == \\w \\n \\w    | last === none           a\r\n// cb() \\n \\w                   == \\) \\n \\w    | last === none           a\r\n// obj[a] \\n \\w                 == \\] \\n \\w    | last === none           a\r\n// {} {}                        == \\} \\{       | last === none           b\r\n\r\nexport function insertSemicolons(constants: IConstants, str: CodeString): CodeString {\r\n  let rest = str;\r\n  let sub = emptyString;\r\n  let details: restDetails = {};\r\n  let pendingDoWhile = false;\r\n  const inserted = insertedSemicolons.get(str.ref) || new Array(str.ref.str.length);\r\n  while (\r\n    (sub = restOfExp(constants, rest, [], undefined, undefined, [colonsRegex], details)).length\r\n  ) {\r\n    let valid = false;\r\n    let part = sub;\r\n    let edge = sub.length;\r\n    if (details.regRes) {\r\n      valid = true;\r\n      const [, , a, , , b] = details.regRes;\r\n      edge = details.regRes[3] === '++' || details.regRes[3] === '--' ? sub.length + 1 : sub.length;\r\n      part = rest.substring(0, edge);\r\n      if (b) {\r\n        const res = closingsNoInsertion.exec(rest.substring(sub.length - 1).toString());\r\n        if (res) {\r\n          if (res[2] === 'while') {\r\n            if (details.lastWord === 'do') {\r\n              valid = false;\r\n              pendingDoWhile = true;\r\n            } else {\r\n              valid = true;\r\n            }\r\n          } else {\r\n            valid = false;\r\n          }\r\n        } else if (\r\n          details.lastWord === 'function' &&\r\n          details.regRes[5][0] === '}' &&\r\n          details.regRes[5].slice(-1) === '('\r\n        ) {\r\n          valid = false;\r\n        }\r\n      } else if (a) {\r\n        if (pendingDoWhile && details.lastWord === 'while') {\r\n          valid = true;\r\n          pendingDoWhile = false;\r\n        } else if (\r\n          details.lastWord === 'if' ||\r\n          details.lastWord === 'while' ||\r\n          details.lastWord === 'for' ||\r\n          details.lastWord === 'else'\r\n        ) {\r\n          valid = !!details.bodyContentAfterKeyword;\r\n        }\r\n      }\r\n    }\r\n    if (valid) {\r\n      inserted[part.end] = true;\r\n    }\r\n    rest = rest.substring(edge);\r\n    details = {};\r\n  }\r\n  insertedSemicolons.set(str.ref, inserted);\r\n  return str;\r\n}\r\n\r\nexport function checkRegex(str: string): IRegEx | null {\r\n  let i = 1;\r\n  let escape = false;\r\n  let done = false;\r\n  let cancel = false;\r\n  while (i < str.length && !done && !cancel) {\r\n    done = str[i] === '/' && !escape;\r\n    escape = str[i] === '\\\\' && !escape;\r\n    cancel = str[i] === '\\n';\r\n    i++;\r\n  }\r\n  const after = str.substring(i);\r\n  cancel = cancel || !done || /^\\s*\\d/.test(after);\r\n  if (cancel) return null;\r\n  const flags = /^[a-z]*/.exec(after);\r\n  if (/^\\s+[\\w$]/.test(str.substring(i + flags![0].length))) {\r\n    return null;\r\n  }\r\n  return {\r\n    regex: str.substring(1, i - 1),\r\n    flags: (flags && flags[0]) || '',\r\n    length: i + ((flags && flags[0].length) || 0),\r\n  };\r\n}\r\n\r\nconst notDivide = /(typeof|delete|instanceof|return|in|of|throw|new|void|do|if)$/;\r\nconst possibleDivide = /^([\\w$\\])]|\\+\\+|--)[\\s/]/;\r\nexport function extractConstants(\r\n  constants: IConstants,\r\n  str: string,\r\n  currentEnclosure = '',\r\n): { str: string; length: number } {\r\n  let quote;\r\n  let extract: (string | number)[] = [];\r\n  let escape = false;\r\n  let regexFound: IRegEx | null;\r\n  let comment = '';\r\n  let commentStart = -1;\r\n  let currJs: string[] = [];\r\n  let char = '';\r\n  const strRes: (string | number)[] = [];\r\n  const enclosures: string[] = [];\r\n  let isPossibleDivide: RegExpExecArray | null = null;\r\n  let i = 0;\r\n  for (i = 0; i < str.length; i++) {\r\n    char = str[i];\r\n    if (comment) {\r\n      if (char === comment) {\r\n        if (comment === '*' && str[i + 1] === '/') {\r\n          comment = '';\r\n          i++;\r\n        } else if (comment === '\\n') {\r\n          comment = '';\r\n          strRes.push('\\n');\r\n        }\r\n      }\r\n    } else {\r\n      if (escape) {\r\n        escape = false;\r\n        extract.push(char);\r\n        continue;\r\n      }\r\n\r\n      if (quote) {\r\n        if (quote === '`' && char === '$' && str[i + 1] === '{') {\r\n          const skip = extractConstants(constants, str.substring(i + 2), '{');\r\n          currJs.push(skip.str);\r\n          extract.push('${', currJs.length - 1, `}`);\r\n          i += skip.length + 2;\r\n        } else if (quote === char) {\r\n          if (quote === '`') {\r\n            const li = createLisp<Literal>({\r\n              op: LispType.Literal,\r\n              a: unraw(extract.join('')),\r\n              b: [],\r\n            });\r\n            li.tempJsStrings = currJs;\r\n            constants.literals.push(li);\r\n            strRes.push(`\\``, constants.literals.length - 1, `\\``);\r\n          } else {\r\n            constants.strings.push(unraw(extract.join('')));\r\n            strRes.push(`\"`, constants.strings.length - 1, `\"`);\r\n          }\r\n          quote = null;\r\n          extract = [];\r\n        } else {\r\n          extract.push(char);\r\n        }\r\n      } else {\r\n        if (char === \"'\" || char === '\"' || char === '`') {\r\n          currJs = [];\r\n          quote = char;\r\n        } else if (closings[currentEnclosure] === char && !enclosures.length) {\r\n          return { str: strRes.join(''), length: i };\r\n        } else if (closings[char]) {\r\n          enclosures.push(char);\r\n          strRes.push(char);\r\n        } else if (closings[enclosures[enclosures.length - 1]] === char) {\r\n          enclosures.pop();\r\n          strRes.push(char);\r\n        } else if (char === '/' && (str[i + 1] === '*' || str[i + 1] === '/')) {\r\n          comment = str[i + 1] === '*' ? '*' : '\\n';\r\n          commentStart = i;\r\n        } else if (\r\n          char === '/' &&\r\n          !isPossibleDivide &&\r\n          (regexFound = checkRegex(str.substring(i)))\r\n        ) {\r\n          constants.regexes.push(regexFound);\r\n          strRes.push(`/`, constants.regexes.length - 1, `/r`);\r\n          i += regexFound.length - 1;\r\n        } else {\r\n          strRes.push(char);\r\n        }\r\n\r\n        if (!isPossibleDivide || !space.test(char)) {\r\n          if ((isPossibleDivide = possibleDivide.exec(str.substring(i)))) {\r\n            if (notDivide.test(str.substring(0, i + isPossibleDivide[1].length))) {\r\n              isPossibleDivide = null;\r\n            }\r\n          }\r\n        }\r\n      }\r\n      escape = !!(quote && char === '\\\\');\r\n    }\r\n  }\r\n\r\n  if (comment) {\r\n    if (comment === '*') {\r\n      throw new SyntaxError(`Unclosed comment '/*': ${str.substring(commentStart)}`);\r\n    }\r\n  }\r\n  return { str: strRes.join(''), length: i };\r\n}\r\n\r\nexport default function parse(code: string, eager = false, expression = false): IExecutionTree {\r\n  if (typeof code !== 'string') throw new ParseError(`Cannot parse ${code}`, code);\r\n  let str = ' ' + code;\r\n  const constants: IConstants = { strings: [], literals: [], regexes: [], eager };\r\n  str = extractConstants(constants, str).str;\r\n\r\n  for (const l of constants.literals) {\r\n    l[2] = l.tempJsStrings!.map((js: string) => lispifyExpr(constants, new CodeString(js)));\r\n    delete l.tempJsStrings;\r\n  }\r\n  return { tree: lispifyFunction(new CodeString(str), constants, expression), constants };\r\n}\r\n","import { createFunction, createFunctionAsync } from './executor.js';\r\nimport parse, { Lisp, lispifyFunction } from './parser.js';\r\nimport { IExecContext, LispType, Ticks } from './utils.js';\r\n\r\nexport interface IEvalContext {\r\n  sandboxFunction: typeof sandboxFunction;\r\n  sandboxAsyncFunction: typeof sandboxAsyncFunction;\r\n  sandboxedEval: (func: SandboxFunction, context: IExecContext) => SandboxEval;\r\n  sandboxedSetTimeout: typeof sandboxedSetTimeout;\r\n  sandboxedSetInterval: typeof sandboxedSetInterval;\r\n  sandboxedClearTimeout: typeof sandboxedClearTimeout;\r\n  sandboxedClearInterval: typeof sandboxedClearInterval;\r\n  lispifyFunction: typeof lispifyFunction;\r\n}\r\nexport type SandboxFunction = (code: string, ...args: string[]) => () => unknown;\r\nexport type SandboxEval = (code: string) => unknown;\r\nexport type SandboxSetTimeout = (\r\n  handler: TimerHandler,\r\n  timeout?: number,\r\n  ...args: unknown[]\r\n) => any;\r\nexport type SandboxSetInterval = (\r\n  handler: TimerHandler,\r\n  timeout?: number,\r\n  ...args: unknown[]\r\n) => any;\r\nexport type SandboxClearTimeout = (handle: number) => void;\r\nexport type SandboxClearInterval = (handle: number) => void;\r\n\r\nexport function createEvalContext(): IEvalContext {\r\n  return {\r\n    sandboxFunction,\r\n    sandboxAsyncFunction,\r\n    sandboxedEval,\r\n    sandboxedSetTimeout,\r\n    sandboxedSetInterval,\r\n    sandboxedClearTimeout,\r\n    sandboxedClearInterval,\r\n    lispifyFunction,\r\n  };\r\n}\r\n\r\nfunction SB() {}\r\nexport function sandboxFunction(context: IExecContext): SandboxFunction {\r\n  SandboxFunction.prototype = SB.prototype;\r\n  return SandboxFunction;\r\n  function SandboxFunction(...params: string[]) {\r\n    const code = params.pop() || '';\r\n    const parsed = parse(code);\r\n    return createFunction(\r\n      params,\r\n      parsed.tree,\r\n      context.ctx.ticks,\r\n      {\r\n        ...context,\r\n        constants: parsed.constants,\r\n        tree: parsed.tree,\r\n      },\r\n      undefined,\r\n      'anonymous',\r\n    );\r\n  }\r\n}\r\n\r\nexport type SandboxAsyncFunction = (code: string, ...args: string[]) => () => Promise<unknown>;\r\nfunction SAF() {}\r\nexport function sandboxAsyncFunction(context: IExecContext): SandboxAsyncFunction {\r\n  SandboxAsyncFunction.prototype = SAF.prototype;\r\n  return SandboxAsyncFunction;\r\n  function SandboxAsyncFunction(...params: string[]) {\r\n    const code = params.pop() || '';\r\n    const parsed = parse(code);\r\n    return createFunctionAsync(\r\n      params,\r\n      parsed.tree,\r\n      context.ctx.ticks,\r\n      {\r\n        ...context,\r\n        constants: parsed.constants,\r\n        tree: parsed.tree,\r\n      },\r\n      undefined,\r\n      'anonymous',\r\n    );\r\n  }\r\n}\r\n\r\nfunction SE() {}\r\nexport function sandboxedEval(func: SandboxFunction, context: IExecContext): SandboxEval {\r\n  sandboxEval.prototype = SE.prototype;\r\n  return sandboxEval;\r\n  function sandboxEval(code: string) {\r\n    // Parse the code and wrap last statement in return for completion value\r\n    const parsed = parse(code);\r\n    const tree = wrapLastStatementInReturn(parsed.tree);\r\n    // Create and execute function with modified tree\r\n    return createFunction(\r\n      [],\r\n      tree,\r\n      context.ctx.ticks,\r\n      {\r\n        ...context,\r\n        constants: parsed.constants,\r\n        tree,\r\n      },\r\n      undefined,\r\n      'anonymous',\r\n    )();\r\n  }\r\n}\r\n\r\nfunction wrapLastStatementInReturn(tree: Lisp[]): Lisp[] {\r\n  if (tree.length === 0) return tree;\r\n  const newTree = [...tree];\r\n  const lastIndex = newTree.length - 1;\r\n  const lastStmt = newTree[lastIndex];\r\n\r\n  // Only wrap if it's not already a return or throw\r\n  if (Array.isArray(lastStmt) && lastStmt.length >= 1) {\r\n    const op = lastStmt[0];\r\n\r\n    // Don't wrap Return (8) or Throw (47) - they already control flow\r\n    if (op === LispType.Return || op === LispType.Throw) {\r\n      return newTree;\r\n    }\r\n\r\n    // List of statement types that should have undefined completion value\r\n    // These match JavaScript semantics where declarations and control structures\r\n    // don't produce a completion value\r\n    const statementTypes = [\r\n      LispType.Let, // 3\r\n      LispType.Const, // 4\r\n      LispType.Var, // 35\r\n      LispType.Function, // 38\r\n      LispType.If, // 14\r\n      LispType.Loop, // 39\r\n      LispType.Try, // 40\r\n      LispType.Switch, // 41\r\n      LispType.Block, // 43\r\n      LispType.Expression, // 44\r\n    ];\r\n\r\n    // If the last statement is a declaration or control structure,\r\n    // don't wrap it (it will naturally return undefined)\r\n    if (statementTypes.includes(op)) {\r\n      return newTree;\r\n    }\r\n\r\n    // For all other types (expressions, operators, etc.),\r\n    // wrap in return to capture the completion value\r\n    newTree[lastIndex] = [LispType.Return, LispType.None, lastStmt];\r\n  }\r\n\r\n  return newTree;\r\n}\r\n\r\nfunction sST() {}\r\nexport function sandboxedSetTimeout(\r\n  func: SandboxFunction,\r\n  context: IExecContext,\r\n): SandboxSetTimeout {\r\n  sandboxSetTimeout.prototype = sST.prototype;\r\n  return sandboxSetTimeout;\r\n  function sandboxSetTimeout(handler: TimerHandler, timeout?: number, ...args: unknown[]) {\r\n    const sandbox = context.ctx.sandbox;\r\n    const exec = (...a: any[]) => {\r\n      const h = typeof handler === 'string' ? func(handler) : handler;\r\n      haltsub.unsubscribe();\r\n      contsub.unsubscribe();\r\n      sandbox.setTimeoutHandles.delete(sandBoxhandle);\r\n      return h(...a);\r\n    };\r\n\r\n    const sandBoxhandle = ++sandbox.timeoutHandleCounter;\r\n\r\n    let start = Date.now();\r\n    let handle: number = setTimeout(exec, timeout, ...args);\r\n\r\n    let elapsed = 0;\r\n    const haltsub = sandbox.subscribeHalt(() => {\r\n      elapsed = Date.now() - start + elapsed;\r\n      clearTimeout(handle);\r\n    });\r\n    const contsub = sandbox.subscribeResume(() => {\r\n      start = Date.now();\r\n      const remaining = Math.floor((timeout || 0) - elapsed);\r\n      handle = setTimeout(exec, remaining, ...args);\r\n      sandbox.setTimeoutHandles.set(sandBoxhandle, {\r\n        handle,\r\n        haltsub,\r\n        contsub,\r\n      });\r\n    });\r\n    sandbox.setTimeoutHandles.set(sandBoxhandle, {\r\n      handle,\r\n      haltsub,\r\n      contsub,\r\n    });\r\n    return sandBoxhandle;\r\n  }\r\n}\r\n\r\nfunction sCT() {}\r\nexport function sandboxedClearTimeout(context: IExecContext): SandboxClearTimeout {\r\n  sandboxClearTimeout.prototype = sCT.prototype;\r\n  return sandboxClearTimeout;\r\n  function sandboxClearTimeout(handle: number) {\r\n    const sandbox = context.ctx.sandbox;\r\n    const timeoutHandle = sandbox.setTimeoutHandles.get(handle);\r\n    if (timeoutHandle) {\r\n      clearTimeout(timeoutHandle.handle);\r\n      timeoutHandle.haltsub.unsubscribe();\r\n      timeoutHandle.contsub.unsubscribe();\r\n      sandbox.setTimeoutHandles.delete(handle);\r\n    }\r\n  }\r\n}\r\nfunction sCI() {}\r\nexport function sandboxedClearInterval(context: IExecContext): SandboxClearInterval {\r\n  sandboxClearInterval.prototype = sCI.prototype;\r\n  return sandboxClearInterval;\r\n  function sandboxClearInterval(handle: number) {\r\n    const sandbox = context.ctx.sandbox;\r\n    const intervalHandle = sandbox.setIntervalHandles.get(handle);\r\n    if (intervalHandle) {\r\n      clearInterval(intervalHandle.handle);\r\n      intervalHandle.haltsub.unsubscribe();\r\n      intervalHandle.contsub.unsubscribe();\r\n      sandbox.setIntervalHandles.delete(handle);\r\n    }\r\n  }\r\n}\r\n\r\nfunction sSI() {}\r\nexport function sandboxedSetInterval(\r\n  func: SandboxFunction,\r\n  context: IExecContext,\r\n): SandboxSetInterval {\r\n  sandboxSetInterval.prototype = sSI.prototype;\r\n  return sandboxSetInterval;\r\n  function sandboxSetInterval(\r\n    handler: TimerHandler,\r\n    timeout: number | undefined,\r\n    ...args: unknown[]\r\n  ) {\r\n    const sandbox = context.ctx.sandbox;\r\n    const h = typeof handler === 'string' ? func(handler) : handler;\r\n    const exec = (...a: any[]) => {\r\n      start = Date.now();\r\n      elapsed = 0;\r\n      return h(...a);\r\n    };\r\n\r\n    const sandBoxhandle = ++sandbox.timeoutHandleCounter;\r\n\r\n    let start = Date.now();\r\n    let handle: number = setInterval(exec, timeout, ...args);\r\n\r\n    let elapsed = 0;\r\n    const haltsub = sandbox.subscribeHalt(() => {\r\n      elapsed = Date.now() - start + elapsed;\r\n      clearInterval(handle);\r\n    });\r\n    const contsub = sandbox.subscribeResume(() => {\r\n      start = Date.now();\r\n      handle = setTimeout(\r\n        () => {\r\n          start = Date.now();\r\n          elapsed = 0;\r\n          handle = setInterval(exec, timeout, ...args);\r\n          exec(...args);\r\n        },\r\n        Math.floor((timeout || 0) - elapsed),\r\n        ...args,\r\n      );\r\n      handlObj.handle = handle;\r\n    });\r\n\r\n    const handlObj = {\r\n      handle,\r\n      haltsub,\r\n      contsub,\r\n    };\r\n    sandbox.setIntervalHandles.set(sandBoxhandle, handlObj);\r\n    return sandBoxhandle;\r\n  }\r\n}\r\n","import { IEvalContext } from './eval.js';\nimport { Change, ExecReturn, executeTree, executeTreeAsync } from './executor.js';\nimport {\n  createContext,\n  IContext,\n  IExecContext,\n  IGlobals,\n  IOptionParams,\n  IOptions,\n  IScope,\n  replacementCallback,\n  SandboxExecutionQuotaExceededError,\n  SandboxGlobal,\n  Scope,\n  SubscriptionSubject,\n  Ticks,\n} from './utils.js';\n\nexport {\n  IOptions,\n  IContext,\n  IExecContext,\n  LocalScope,\n  SandboxExecutionTreeError,\n  SandboxCapabilityError,\n  SandboxAccessError,\n  SandboxError,\n} from './utils.js';\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 default 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<\n    (args?: { error: Error; ticks: Ticks; scope: Scope; context: IExecContext }) => void\n  > = 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        prototypeWhitelist: SandboxExec.SAFE_PROTOTYPES,\n        prototypeReplacements: new Map<new () => any, replacementCallback>(),\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_PROTOTYPES(): Map<any, Set<string>> {\n    const protos = [\n      SandboxGlobal,\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(\n    cb: (args?: { error: Error; ticks: Ticks; scope: Scope; context: IExecContext }) => void,\n  ) {\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?: { error: Error; ticks: Ticks; scope: Scope; context: IExecContext }) {\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 (this.context.ticks.tickLimit && this.context.ticks.ticks >= this.context.ticks.tickLimit) {\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);\n  }\n\n  executeTreeAsync<T>(context: IExecContext, scopes: IScope[] = []): Promise<ExecReturn<T>> {\n    return executeTreeAsync(context.ctx.ticks, context, context.tree, scopes);\n  }\n}\n","import { createExecContext, IExecContext, IOptionParams, IScope } from './utils.js';\r\nimport { createEvalContext } from './eval.js';\r\nimport { ExecReturn } from './executor.js';\r\nimport parse from './parser.js';\r\nimport SandboxExec from './SandboxExec.js';\r\nexport {\r\n  LocalScope,\r\n  SandboxExecutionTreeError,\r\n  SandboxCapabilityError,\r\n  SandboxAccessError,\r\n  SandboxError,\r\n} from './utils.js';\r\n\r\nexport default class Sandbox extends SandboxExec {\r\n  constructor(options?: IOptionParams) {\r\n    super(options, createEvalContext());\r\n  }\r\n\r\n  static audit<T>(code: string, scopes: IScope[] = []): ExecReturn<T> {\r\n    const globals: Record<string, unknown> = {};\r\n    for (const i of Object.getOwnPropertyNames(globalThis) as [keyof typeof globalThis]) {\r\n      globals[i] = globalThis[i];\r\n    }\r\n    const sandbox = new SandboxExec({\r\n      globals,\r\n      audit: true,\r\n    });\r\n    return sandbox.executeTree(\r\n      createExecContext(sandbox, parse(code, true), createEvalContext()),\r\n      scopes,\r\n    );\r\n  }\r\n\r\n  static parse(code: string) {\r\n    return parse(code);\r\n  }\r\n\r\n  compile<T>(\r\n    code: string,\r\n    optimize = false,\r\n  ): (...scopes: IScope[]) => { context: IExecContext; run: () => T } {\r\n    const parsed = parse(code, optimize);\r\n    const exec = (...scopes: IScope[]) => {\r\n      const context = createExecContext(this, parsed, this.evalContext);\r\n      return { context, run: () => this.executeTree<T>(context, [...scopes]).result };\r\n    };\r\n    return exec;\r\n  }\r\n\r\n  compileAsync<T>(\r\n    code: string,\r\n    optimize = false,\r\n  ): (...scopes: IScope[]) => { context: IExecContext; run: () => Promise<T> } {\r\n    const parsed = parse(code, optimize);\r\n    const exec = (...scopes: IScope[]) => {\r\n      const context = createExecContext(this, parsed, this.evalContext);\r\n      return {\r\n        context,\r\n        run: () => this.executeTreeAsync<T>(context, [...scopes]).then((ret) => ret.result),\r\n      };\r\n    };\r\n    return exec;\r\n  }\r\n\r\n  compileExpression<T>(\r\n    code: string,\r\n    optimize = false,\r\n  ): (...scopes: IScope[]) => { context: IExecContext; run: () => T } {\r\n    const parsed = parse(code, optimize, true);\r\n    const exec = (...scopes: IScope[]) => {\r\n      const context = createExecContext(this, parsed, this.evalContext);\r\n      return { context, run: () => this.executeTree<T>(context, [...scopes]).result };\r\n    };\r\n    return exec;\r\n  }\r\n\r\n  compileExpressionAsync<T>(\r\n    code: string,\r\n    optimize = false,\r\n  ): (...scopes: IScope[]) => { context: IExecContext; run: () => Promise<T> } {\r\n    const parsed = parse(code, optimize, true);\r\n    const exec = (...scopes: IScope[]) => {\r\n      const context = createExecContext(this, parsed, this.evalContext);\r\n      return {\r\n        context,\r\n        run: () => this.executeTreeAsync<T>(context, [...scopes]).then((ret) => ret.result),\r\n      };\r\n    };\r\n    return exec;\r\n  }\r\n}\r\n"],"names":["AsyncFunction","Object","getPrototypeOf","async","constructor","GeneratorFunction","AsyncGeneratorFunction","SandboxGlobal","globals","i","this","ExecContext","ctx","constants","tree","getSubscriptions","setSubscriptions","changeSubscriptions","setSubscriptionsGlobal","changeSubscriptionsGlobal","evals","registerSandboxFunction","allowJit","evalContext","createContext","sandbox","options","sandboxGlobal","context","globalsWhitelist","Set","values","prototypeWhitelist","Map","map","a","prototype","globalScope","Scope","ticks","tickLimit","executionQuota","sandboxedFunctions","WeakSet","set","Symbol","iterator","Response","Request","Headers","FormData","Blob","URLSearchParams","AbortController","ReadableStream","TransformStream","WritableStream","TextEncoder","TextDecoder","createExecContext","executionTree","execContext","WeakMap","fn","sandboxFunctions","func","sandboxFunction","asyncFunc","sandboxAsyncFunction","Function","eval","sandboxedEval","setTimeout","sandboxedSetTimeout","setInterval","sandboxedSetInterval","clearTimeout","sandboxedClearTimeout","clearInterval","sandboxedClearInterval","key","value","CodeString","str","ref","start","end","length","substring","undefined","code","len","char","toString","trimStart","found","exec","slice","trim","valueOf","keysOnly","obj","ret","assign","reservedWords","parent","vars","functionThis","const","let","var","isFuncScope","allVars","get","isThis","scope","getWhereValScope","Prop","val","SyntaxError","has","prop","ReferenceError","TypeError","isConst","isGlobal","SandboxError","hasOwnProperty","getWhereVarScope","localScope","declare","type","existingScope","LocalScope","Error","SandboxExecutionQuotaExceededError","SandboxExecutionTreeError","SandboxCapabilityError","SandboxAccessError","isLisp","item","Array","isArray","isVariable","forEach","cb","call","ExecReturn","auditReport","result","returned","breakLoop","continueLoop","optional","generateArgs","argNames","args","arg","startsWith","createFunction","parsed","name","forbidFunctionCreation","executeTree","add","createFunctionAsync","Promise","executeTreeAsync","assignCheck","op","arrayChange","push","pop","shift","unshift","splice","reverse","sort","copyWithin","KeyVal","SpreadObject","SpreadArray","If","t","f","literalRegex","ops","addOps","prorptyKeyTypes","isPropertyKey","includes","hasPossibleProperties","getGlobalProp","isFunc","p","globalThis","evl","sanitizeArray","cache","replacement","valueOrProp","execMany","done","inLoopOrSwitch","execSync","_execManySync","_execManyAsync","catch","res","syncDone","d","ad","asyncDone","execAsync","isInstant","instant","e","callback","resolve","reject","err","error","doneOriginal","_execNoneRecurse","bobj","b","performOp","checkHaltExpectedTicks","params","expectTicks","halted","sub","subscribeResume","unsubscribe","o","haltOnSandboxError","haltExecution","BigInt","audit","globalsAccess","prototypeAccess","prot","whitelist","replace","prototypeReplacements","size","ctorProt","whitelisted","g","forbidFunctionCalls","vals","flat","then","resolved","JSON","stringify","recurse","x","y","keys","change","changed","added","removed","startIndex","deleteCount","Math","min","endIndex","NaN","Infinity","Number","strings","parseInt","reg","regexes","RegExp","regex","flags","literals","js","resnums","reses","processed","num","match","$$","$","s","_a","_b","lispifyFunction","isAsync","checkFirst","startInternal","getIterator","startStep","step","condition","beforeStep","loop","loopScope","internalVars","$$obj","interalScope","innerLoopVars","toTest","isTrue","caseItem","exception","catchBody","finallyBody","executeTreeWithDone","tryArgs","tryHadError","tryError","tryResult","executeFinallyAndComplete","hadError","errorOrResult","finallyArgs","finallyHadError","finallyResult","sc","catchArgs","catchHadError","catchErrorOrResult","unexecTypes","scopes","_executeWithDoneSync","_executeWithDoneAsync","current","parseHexToInt","hex","validateAndParseHex","errorName","enforcedLength","parsedHex","isNaN","parseHexadecimalCode","parsedCode","String","fromCharCode","parseUnicodeCode","surrogateCode","parsedSurrogateCode","isCurlyBraced","text","charAt","parseUnicodeCodePointCode","codePoint","fromCodePoint","RangeError","singleCharacterEscapes","parseSingleCharacterCode","escapeMatch","unraw","raw","_","backslash","unicodeWithSurrogate","surrogate","unicode","octal","singleCharacter","createLisp","NullLisp","lispTypes","ParseError","message","super","lastType","inlineIfElse","elseIf","ifElse","space","expectTypes","splitter","types","power","opHigh","comparitor","bitwiseShift","bitwiseAnd","bitwiseXor","bitwiseOr","boolOpAnd","boolOpOr","nullishCoalescing","next","inlineIf","assignment","assignModify","incrementerBefore","expEdge","incrementerAfter","taggedTemplate","modifier","not","inverse","negative","positive","typeof","delete","dot","arrayProp","createObject","createArray","number","string","literal","boolean","null","und","arrowFunctionSingle","arrowFunction","inlineFunction","group","void","await","new","initialize","return","throw","spreadObject","spreadArray","expEnd","expFunction","function","expSingle","for","do","while","loopAction","if","try","block","switch","closings","testMultiple","tests","emptyString","okFirstChars","aNumber","wordReg","semiColon","insertedSemicolons","quoteCache","restOfExp","part","quote","firstOpening","closingsTests","details","words","isStart","hasSemiTest","filter","insertedSemis","escape","lastChar","isOneLiner","lastInertedSemi","seenKeyword","skipNextWord","skip","regRes","foundWord","foundNumber","bodyContentAfterKeyword","lastAnyWord","lastWord","test","oneliner","startingExecpted","setLispType","closingsCreate","typesCreate","expect","extract","l","funcFound","lispifyExpr","lispify","lisptype","lispTree","modifierTypes","literalIndex","templateStr","jsExprs","stringParts","expressions","currentStr","j","exprIndex","isValidPlaceholder","stringsArray","stringsArrayLisp","incrementTypes","adderTypes","instanceof","in","opTypes","extractIfElse","foundTrue","elseReg","count","foundElse","first","all","max","true","false","quoteCount","ie","startTrue","trueBlock","elseBlock","lispifyBlock","indexOf","caseFound","statement","insertSemicolons","caseTest","cases","defaultFound","cond","bracketFound","exprs","notEmpty","index","matches","lt","isArrow","isReturn","argPos","split","ended","eager","iteratorRegex","body","lispifyReturnExpr","extract2","k","ofStart2","ofStart3","ofCondition","ofStep","inStart2","inStart3","inStep","inCondition","isBlock","catchReg","catchRes","offset","argsString","expected","topLevel","startingExpectedWithoutSingle","r","subExpressions","pos","defined","expression","parts","skipped","isInserted","hoist","rep","it","closingsNoInsertion","colonsRegex","rest","pendingDoWhile","inserted","valid","edge","checkRegex","cancel","after","notDivide","possibleDivide","extractConstants","currentEnclosure","regexFound","comment","commentStart","currJs","strRes","enclosures","isPossibleDivide","li","join","tempJsStrings","parse","createEvalContext","SB","SandboxFunction","SAF","SandboxAsyncFunction","SE","sandboxEval","wrapLastStatementInReturn","newTree","lastIndex","lastStmt","sST","sandboxSetTimeout","handler","timeout","h","haltsub","contsub","setTimeoutHandles","sandBoxhandle","timeoutHandleCounter","Date","now","handle","elapsed","subscribeHalt","remaining","floor","sCT","sandboxClearTimeout","timeoutHandle","sCI","sandboxClearInterval","intervalHandle","setIntervalHandles","sSI","sandboxSetInterval","handlObj","subscribeSet","names","callbacks","changeCbs","SandboxExec","haltSubscriptions","resumeSubscriptions","opt","SAFE_GLOBALS","SAFE_PROTOTYPES","console","debug","info","log","table","warn","isFinite","parseFloat","decodeURI","decodeURIComponent","encodeURI","encodeURIComponent","unescape","Boolean","EvalError","URIError","Int8Array","Uint8Array","Uint8ClampedArray","Int16Array","Uint16Array","Int32Array","Uint32Array","Float32Array","Float64Array","Intl","protos","proto","subscribeGet","subscribeSetGlobal","haltContext","resumeExecution","getContext","Sandbox","getOwnPropertyNames","compile","optimize","run","compileAsync","compileExpression","compileExpressionAsync"],"mappings":"AACO,MAAMA,cAA0BC,OAAOC,eAAeC,iBAAmB,GAAGC,YACtEC,kBAA8BJ,OAAOC,eAAe,YAAc,GAAGE,YACrEE,uBAAmCL,OAAOC,eACrDC,kBAAoB,GACpBC,YA8EWG,cAAgB,SAA6CC,GACxE,IAAK,MAAMC,KAAKD,EACdE,KAAKD,GAAKD,EAAQC,EAEtB,QAIaE,YACX,WAAAP,CACSQ,EACAC,EACAC,EACAC,EACAC,EAIAC,EACAC,EAIAC,EAIAC,EACAC,EACAC,EACAC,GApBAb,KAAAE,IAAAA,EACAF,KAAAG,UAAAA,EACAH,KAAAI,KAAAA,EACAJ,KAAAK,iBAAAA,EACAL,KAAAM,iBAAAA,EAIAN,KAAAO,oBAAAA,EACAP,KAAAQ,uBAAAA,EAIAR,KAAAS,0BAAAA,EAIAT,KAAAU,MAAAA,EACAV,KAAAW,wBAAAA,EACAX,KAAAY,SAAAA,EACAZ,KAAAa,YAAAA,CACN,EAGC,SAAUC,cAAcC,EAAsBC,GAClD,MAAMC,EAAgB,IAAIpB,cAAcmB,EAAQlB,SAC1CoB,EAAoB,CACxBH,QAASA,EACTI,iBAAkB,IAAIC,IAAI7B,OAAO8B,OAAOL,EAAQlB,UAChDwB,mBAAoB,IAAIC,IAAI,IAAIP,EAAQM,oBAAoBE,IAAKC,GAAM,CAACA,EAAE,GAAGC,UAAWD,EAAE,MAC1FT,UACAW,YAAa,IAAIC,MAAM,KAAMZ,EAAQlB,QAASmB,GAC9CA,gBACAY,MAAO,CAAEA,MAAO,GAAIC,UAAWd,EAAQe,gBACvCC,mBAAoB,IAAIC,SAyB1B,OAvBAf,EAAQI,mBAAmBY,IAAI3C,OAAOC,eAAe,GAAG2C,OAAOC,aAAwB,IAAIhB,KAEnE,oBAAbiB,UACTnB,EAAQI,mBAAmBY,IAAIG,SAASX,UAAW,IAAIN,KAClC,oBAAZkB,SAAyBpB,EAAQI,mBAAmBY,IAAII,QAAQZ,UAAW,IAAIN,KACnE,oBAAZmB,SAAyBrB,EAAQI,mBAAmBY,IAAIK,QAAQb,UAAW,IAAIN,KAClE,oBAAboB,UACTtB,EAAQI,mBAAmBY,IAAIM,SAASd,UAAW,IAAIN,KACrC,oBAATqB,MAAsBvB,EAAQI,mBAAmBY,IAAIO,KAAKf,UAAW,IAAIN,KACrD,oBAApBsB,iBACTxB,EAAQI,mBAAmBY,IAAIQ,gBAAgBhB,UAAW,IAAIN,KACjC,oBAApBuB,iBACTzB,EAAQI,mBAAmBY,IAAIS,gBAAgBjB,UAAW,IAAIN,KAClC,oBAAnBwB,gBACT1B,EAAQI,mBAAmBY,IAAIU,eAAelB,UAAW,IAAIN,KAChC,oBAApByB,iBACT3B,EAAQI,mBAAmBY,IAAIW,gBAAgBnB,UAAW,IAAIN,KAClC,oBAAnB0B,gBACT5B,EAAQI,mBAAmBY,IAAIY,eAAepB,UAAW,IAAIN,KACpC,oBAAhB2B,aACT7B,EAAQI,mBAAmBY,IAAIa,YAAYrB,UAAW,IAAIN,KACjC,oBAAhB4B,aACT9B,EAAQI,mBAAmBY,IAAIc,YAAYtB,UAAW,IAAIN,KACrDF,CACT,UAEgB+B,kBACdlC,QASAmC,cACArC,aAEA,MAAMH,MAAQ,IAAIa,IACZ4B,YAA4B,IAAIlD,YACpCc,QAAQG,QACRgC,cAAc/C,UACd+C,cAAc9C,KACd,IAAIgB,IACJ,IAAIgC,QACJ,IAAIA,QACJrC,QAAQT,iBACRS,QAAQR,oBACRG,MACC2C,GAAOtC,QAAQuC,iBAAiBpB,IAAImB,EAAIF,eACvCtC,YACFA,aAEF,GAAIA,YAAa,CACf,MAAM0C,KAAO1C,YAAY2C,gBAAgBL,aACnCM,UAAY5C,YAAY6C,qBAAqBP,aACnDzC,MAAMwB,IAAIyB,SAAUJ,MACpB7C,MAAMwB,IAAI5C,cAAemE,WACzB/C,MAAMwB,IAAIvC,kBAAmB4D,MAC7B7C,MAAMwB,IAAItC,uBAAwB6D,WAClC/C,MAAMwB,IAAI0B,KAAM/C,YAAYgD,cAAcN,KAAMJ,cAChDzC,MAAMwB,IAAI4B,WAAYjD,YAAYkD,oBAAoBR,KAAMJ,cAC5DzC,MAAMwB,IAAI8B,YAAanD,YAAYoD,qBAAqBV,KAAMJ,cAC9DzC,MAAMwB,IAAIgC,aAAcrD,YAAYsD,sBAAsBhB,cAC1DzC,MAAMwB,IAAIkC,cAAevD,YAAYwD,uBAAuBlB,cAE5D,IAAK,MAAOmB,EAAKC,KAAU7D,MACzBK,QAAQG,QAAQI,mBAAmBY,IAAIqC,EAAM7C,UAAW,IAAIN,KAC5DL,QAAQG,QAAQI,mBAAmBY,IAAIoC,EAAI5C,UAAW,IAAIN,IAE9D,CACA,OAAO+B,WACT,OAEaqB,WAIX,WAAA9E,CAAY+E,GACVzE,KAAK0E,IAAM,CAAED,IAAK,IACdA,aAAeD,YACjBxE,KAAK0E,IAAMD,EAAIC,IACf1E,KAAK2E,MAAQF,EAAIE,MACjB3E,KAAK4E,IAAMH,EAAIG,MAEf5E,KAAK0E,IAAID,IAAMA,EACfzE,KAAK2E,MAAQ,EACb3E,KAAK4E,IAAMH,EAAII,OAEnB,CAEA,SAAAC,CAAUH,EAAeC,GACvB,IAAK5E,KAAK6E,OAAQ,OAAO7E,MACzB2E,EAAQ3E,KAAK2E,MAAQA,GACT,IACVA,EAAQ,GAENA,EAAQ3E,KAAK4E,MACfD,EAAQ3E,KAAK4E,MAEfA,OAAcG,IAARH,EAAoB5E,KAAK4E,IAAM5E,KAAK2E,MAAQC,GACxC,IACRA,EAAM,GAEJA,EAAM5E,KAAK4E,MACbA,EAAM5E,KAAK4E,KAEb,MAAMI,EAAO,IAAIR,WAAWxE,MAG5B,OAFAgF,EAAKL,MAAQA,EACbK,EAAKJ,IAAMA,EACJI,CACT,CAEA,UAAIH,GACF,MAAMI,EAAMjF,KAAK4E,IAAM5E,KAAK2E,MAC5B,OAAOM,EAAM,EAAI,EAAIA,CACvB,CAEA,IAAAC,CAAKnF,GACH,GAAIC,KAAK2E,QAAU3E,KAAK4E,IACxB,OAAO5E,KAAK0E,IAAID,IAAIzE,KAAK2E,MAAQ5E,EACnC,CAEA,QAAAoF,GACE,OAAOnF,KAAK0E,IAAID,IAAIK,UAAU9E,KAAK2E,MAAO3E,KAAK4E,IACjD,CAEA,SAAAQ,GACE,MAAMC,EAAQ,OAAOC,KAAKtF,KAAKmF,YACzBH,EAAO,IAAIR,WAAWxE,MAI5B,OAHIqF,IACFL,EAAKL,OAASU,EAAM,GAAGR,QAElBG,CACT,CAEA,KAAAO,CAAMZ,EAAeC,GAiBnB,OAhBID,EAAQ,IACVA,EAAQ3E,KAAK4E,IAAM5E,KAAK2E,MAAQA,GAE9BA,EAAQ,IACVA,EAAQ,QAEEI,IAARH,IACFA,EAAM5E,KAAK4E,IAAM5E,KAAK2E,OAGpBC,EAAM,IACRA,EAAM5E,KAAK4E,IAAM5E,KAAK2E,MAAQC,GAE5BA,EAAM,IACRA,EAAM,GAED5E,KAAK8E,UAAUH,EAAOC,EAC/B,CAEA,IAAAY,GACE,MAAMR,EAAOhF,KAAKoF,YACZC,EAAQ,OAAOC,KAAKN,EAAKG,YAI/B,OAHIE,IACFL,EAAKJ,KAAOS,EAAM,GAAGR,QAEhBG,CACT,CAEA,OAAAS,GACE,OAAOzF,KAAKmF,UACd,EAGF,SAASO,SAASC,GAChB,MAAMC,EAA4BrG,OAAOsG,OAAO,CAAA,EAAIF,GACpD,IAAK,MAAMrB,KAAOsB,EAChBA,EAAItB,IAAO,EAEb,OAAOsB,CACT,CAEO,MAAME,cAAgB,IAAI1E,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,eASWQ,MAQX,WAAAlC,CAAYqG,EAAsBC,EAAO,CAAA,EAAIC,GAN7CjG,KAAAkG,MAAiC,CAAA,EACjClG,KAAAmG,IAA+B,CAAA,EAC/BnG,KAAAoG,IAA+B,CAAA,EAK7B,MAAMC,OAA+BtB,IAAjBkB,GAAyC,OAAXF,EAClD/F,KAAK+F,OAASA,EACd/F,KAAKsG,QAAUN,EACfhG,KAAKmG,IAAME,EAAcrG,KAAKmG,IAAMT,SAASM,GAC7ChG,KAAKoG,IAAMC,EAAcX,SAASM,GAAQhG,KAAKoG,IAC/CpG,KAAKF,QAAqB,OAAXiG,EAAkBL,SAASM,GAAQ,CAAA,EAClDhG,KAAKiG,aAAeA,CACtB,CAEA,GAAAM,CAAIjC,GACF,MAAMkC,EAAiB,SAARlC,EACTmC,EAAQzG,KAAK0G,iBAAiBpC,EAAKkC,GACzC,OAAIC,GAASD,EACJ,IAAIG,KAAK,CAAE3G,KAAMyG,EAAMR,cAAgB3B,GAAK,GAAO,GAAO,GAE9DmC,EAGE,IAAIE,KAAKF,EAAMH,QAAShC,EAAKA,KAAOmC,EAAMP,MAAO5B,KAAOmC,EAAM3G,SAAS,GAFrE,IAAI6G,UAAK5B,EAAWT,EAG/B,CAEA,GAAApC,CAAIoC,EAAasC,GACf,GAAY,SAARtC,EAAgB,MAAM,IAAIuC,YAAY,6BAC1C,GAAIf,cAAcgB,IAAIxC,GAAM,MAAM,IAAIuC,YAAY,sBAAwBvC,EAAM,KAChF,MAAMyC,EAAO/G,KAAKuG,IAAIjC,GACtB,QAAqBS,IAAjBgC,EAAK7F,QACP,MAAM,IAAI8F,eAAe,aAAa1C,wBAExC,GAAqB,OAAjByC,EAAK7F,QACP,MAAM,IAAI+F,UAAU,4CAA4C3C,OAElE,GAAIyC,EAAKG,QACP,MAAM,IAAID,UAAU,mCAEtB,GAAIF,EAAKI,SACP,MAAM,IAAIC,aAAa,oCAAoC9C,MAG7D,OADCyC,EAAK7F,QAAgB6F,EAAKA,MAAQH,EAC5BG,CACT,CAEA,gBAAAL,CAAiBpC,EAAakC,GAC5B,OAAIA,OACwBzB,IAAtB/E,KAAKiG,aACAjG,KAEAA,KAAK+F,QAAQW,iBAAiBpC,EAAKkC,IAAW,OAGrDlC,KAAOtE,KAAKsG,UAAahC,IAAO,CAAA,IAAO+C,eAAerH,KAAKsG,QAAShC,GAGjEtE,KAAK+F,QAAQW,iBAAiBpC,EAAKkC,IAAW,KAF5CxG,IAGX,CAEA,gBAAAsH,CAAiBhD,EAAaiD,GAAa,GACzC,QAAIjD,KAAOtE,KAAKsG,UAAahC,IAAO,CAAA,IAAO+C,eAAerH,KAAKsG,QAAShC,GAGpD,OAAhBtE,KAAK+F,QAAmBwB,QAAoCxC,IAAtB/E,KAAKiG,aACtCjG,KAEFA,KAAK+F,OAAOuB,iBAAiBhD,EAAKiD,GALhCvH,IAMX,CAEA,OAAAwH,CAAQlD,EAAamD,EAAelD,OAAiBQ,EAAWoC,GAAW,GACzE,GAAY,SAAR7C,EAAgB,MAAM,IAAIuC,YAAY,6BAC1C,GAAIf,cAAcgB,IAAIxC,GAAM,MAAM,IAAIuC,YAAY,sBAAwBvC,EAAM,KAChF,MAAMoD,EAAgB1H,KAAKsH,iBAAiBhD,EAAS,QAAJmD,GACjD,GAAQ,QAAJA,EAAsB,CACxB,GAAIC,EAActB,IAAI9B,GAOpB,OANAoD,EAAcpB,QAAQhC,GAAOC,EACxB4C,EAGHO,EAAc5H,QAAQwE,IAAO,SAFtBoD,EAAc5H,QAAQwE,GAIxB,IAAIqC,KAAKe,EAAcpB,QAAShC,GAAK,EAAOoD,EAAc5H,QAAQwE,IAAM,GAC1E,GAAIA,KAAOoD,EAAcpB,QAC9B,MAAM,IAAIO,YAAY,eAAevC,+BAEzC,CACA,GAAIA,KAAOoD,EAAcpB,QACvB,MAAM,IAAIO,YAAY,eAAevC,gCASvC,OANI6C,IACFO,EAAc5H,QAAQwE,IAAO,GAE/BoD,EAAcD,GAAMnD,IAAO,EAC3BoD,EAAcpB,QAAQhC,GAAOC,EAEtB,IAAIoC,KAAK3G,KAAKsG,QAAShC,YAAKmD,EAAwBN,GAAU,EACvE,QASWQ,YAEP,MAAOP,qBAAqBQ,OAE5B,MAAOC,2CAA2CT,cAElD,MAAOU,kCAAkCV,cAEzC,MAAOW,+BAA+BX,cAEtC,MAAOY,2BAA2BZ,cAElC,SAAUa,OAAiCC,GAC/C,OACEC,MAAMC,QAAQF,IACK,iBAAZA,EAAK,IACL,IAAPA,EAAK,IACE,KAAPA,EAAK,EAET,OAoGavB,KACX,WAAAjH,CACSwB,EACA6F,EACAG,GAAU,EACVC,GAAW,EACXkB,GAAa,GAJbrI,KAAAkB,QAAAA,EACAlB,KAAA+G,KAAAA,EACA/G,KAAAkH,QAAAA,EACAlH,KAAAmH,SAAAA,EACAnH,KAAAqI,WAAAA,CACN,CAEH,GAAA9B,CAAiBrF,GACf,MAAMhB,EAAMF,KAAKkB,QACjB,QAAY6D,IAAR7E,EAAmB,MAAM,IAAI8G,eAAe,GAAGhH,KAAK+G,KAAK5B,6BAC7D,GAAY,OAARjF,EACF,MAAM,IAAI+G,UAAU,6CAA6CjH,KAAK+G,KAAK5B,gBAE7E,OADAjE,EAAQb,iBAAiBiI,QAASC,GAAOA,EAAGrI,EAAKF,KAAK+G,KAAK5B,aACnDjF,EAAYF,KAAK+G,KAC3B,EAGI,SAAUM,eAAe1B,EAAcoB,GAC3C,OAAOxH,OAAOmC,UAAU2F,eAAemB,KAAK7C,EAAKoB,EACnD,OCxkBa0B,WACX,WAAA/I,CACSgJ,EACAC,EACAC,EACAC,GAAY,EACZC,GAAe,GAJf9I,KAAA0I,YAAAA,EACA1I,KAAA2I,OAAAA,EACA3I,KAAA4I,SAAAA,EACA5I,KAAA6I,UAAAA,EACA7I,KAAA8I,aAAAA,CACN,EAgFL,MAAMC,SAAW,CAAA,EAEjB,SAASC,aAAaC,EAAoBC,GACxC,MAAMlD,EAAgC,CAAA,EAQtC,OAPAiD,EAASX,QAAQ,CAACa,EAAKpJ,KACjBoJ,EAAIC,WAAW,OACjBpD,EAAKmD,EAAIrE,UAAU,IAAMoE,EAAK3D,MAAMxF,GAEpCiG,EAAKmD,GAAOD,EAAKnJ,KAGdiG,CACT,CAEM,SAAUqD,eACdJ,EACAK,EACAzH,EACAX,EACAuF,EACA8C,GAEA,GAAIrI,EAAQhB,IAAIc,QAAQwI,uBACtB,MAAM,IAAIzB,uBAAuB,kCAEnC,IAAIxE,EA0BJ,OAxBEA,OADWwB,IAATwE,EACK,IAAIL,KACT,MAAMlD,EAAOgD,aAAaC,EAAUC,GAOpC,OANYO,YACV5H,EACAX,EACAoI,OACUvE,IAAV0B,EAAsB,GAAK,CAAC,IAAI7E,MAAM6E,EAAOT,KAEpC2C,QAGN,YAA2CO,GAChD,MAAMlD,EAAOgD,aAAaC,EAAUC,GAOpC,OANYO,YACV5H,EACAX,EACAoI,OACUvE,IAAV0B,EAAsB,GAAK,CAAC,IAAI7E,MAAM6E,EAAOT,EAAMhG,QAE1C2I,MACb,EAEFzH,EAAQP,wBAAwB4C,GAChCrC,EAAQhB,IAAI8B,mBAAmB0H,IAAInG,GAC5BA,CACT,CAEM,SAAUoG,oBACdV,EACAK,EACAzH,EACAX,EACAuF,EACA8C,GAEA,GAAIrI,EAAQhB,IAAIc,QAAQwI,uBACtB,MAAM,IAAIzB,uBAAuB,kCAEnC,IAAK7G,EAAQhB,IAAIoB,oBAAoBwF,IAAI8C,QAAQlI,WAC/C,MAAM,IAAIqG,uBAAuB,6BAEnC,IAAIxE,EA0BJ,OAxBEA,OADWwB,IAATwE,EACK9J,SAAUyJ,KACf,MAAMlD,EAAOgD,aAAaC,EAAUC,GAOpC,aANkBW,iBAChBhI,EACAX,EACAoI,OACUvE,IAAV0B,EAAsB,GAAK,CAAC,IAAI7E,MAAM6E,EAAOT,MAEpC2C,QAGNlJ,kBAAiDyJ,GACtD,MAAMlD,EAAOgD,aAAaC,EAAUC,GAOpC,aANkBW,iBAChBhI,EACAX,EACAoI,OACUvE,IAAV0B,EAAsB,GAAK,CAAC,IAAI7E,MAAM6E,EAAOT,EAAMhG,SAE1C2I,MACb,EAEFzH,EAAQP,wBAAwB4C,GAChCrC,EAAQhB,IAAI8B,mBAAmB0H,IAAInG,GAC5BA,CACT,CAEM,SAAUuG,YAAYnE,EAAWzE,EAAuB6I,EAAK,UACjE,QAAoBhF,IAAhBY,EAAIzE,QACN,MAAM,IAAI8F,eAAe,UAAU+C,yBAErC,GAAIpE,EAAIuB,QACN,MAAM,IAAID,UAAU,oCAEtB,GAAItB,EAAIwB,SACN,MAAM,IAAIa,mBACR,UAAU+B,eAAgBpE,EAAIoB,KAAK5B,kCAGvC,GAAoB,OAAhBQ,EAAIzE,QACN,MAAM,IAAI+F,UAAU,iCAEtB,GAC4C,mBAAlCtB,EAAIzE,QAAgByE,EAAIoB,QAC/BM,eAAe1B,EAAIzE,QAASyE,EAAIoB,MAEjC,MAAM,IAAIiB,mBACR,gCAAgCrC,EAAIoB,KAAK5B,2BAGlC,WAAP4E,EACE1C,eAAe1B,EAAIzE,QAASyE,EAAIoB,QAClC7F,EAAQX,oBACLgG,IAAIZ,EAAIzE,UACPoH,QAASC,GAAOA,EAAG,CAAEd,KAAM,SAAUV,KAAMpB,EAAIoB,KAAK5B,cACxDjE,EAAQT,0BACL8F,IAAIZ,EAAIzE,UACPoH,QAASC,GAAOA,EAAG,CAAEd,KAAM,SAAUV,KAAMpB,EAAIoB,KAAK5B,eAEjDkC,eAAe1B,EAAIzE,QAASyE,EAAIoB,OACzC7F,EAAQZ,iBACLiG,IAAIZ,EAAIzE,UACPqF,IAAIZ,EAAIoB,KAAK5B,aACbmD,QAASC,GACTA,EAAG,CACDd,KAAM,aAGZvG,EAAQV,uBACL+F,IAAIZ,EAAIzE,UACPqF,IAAIZ,EAAIoB,KAAK5B,aACbmD,QAASC,GACTA,EAAG,CACDd,KAAM,eAIZvG,EAAQX,oBACLgG,IAAIZ,EAAIzE,UACPoH,QAASC,GAAOA,EAAG,CAAEd,KAAM,SAAUV,KAAMpB,EAAIoB,KAAK5B,cACxDjE,EAAQT,0BACL8F,IAAIZ,EAAIzE,UACPoH,QAASC,GAAOA,EAAG,CAAEd,KAAM,SAAUV,KAAMpB,EAAIoB,KAAK5B,cAE5D,CACA,MAAM6E,YAAc,IAAI5I,IAAI,CAC1B,GAAG6I,KACH,GAAGC,IACH,GAAGC,MACH,GAAGC,QACH,GAAGC,OACH,GAAGC,QACH,GAAGC,KACH,GAAGC,mBAGQC,OACX,WAAA/K,CACS4E,EACAsC,GADA5G,KAAAsE,IAAAA,EACAtE,KAAA4G,IAAAA,CACN,QAGQ8D,aACX,WAAAhL,CAAmBwI,GAAAlI,KAAAkI,KAAAA,CAAmC,QAG3CyC,YACX,WAAAjL,CAAmBwI,GAAAlI,KAAAkI,KAAAA,CAAkB,QAG1B0C,GACX,WAAAlL,CACSmL,EACAC,GADA9K,KAAA6K,EAAAA,EACA7K,KAAA8K,EAAAA,CACN,EAGL,MAAMC,aAAe,yBAGRC,IAAM,IAAIzJ,IACjB,SAAU0J,OACdxD,EACAc,GAEAyC,IAAI9I,IAAIuF,EAAMc,EAChB,CAEA,MAAM2C,gBAAkB,CAAC,SAAU,SAAU,UAE7C,SAASC,cAAcvE,GACrB,OAAOsE,gBAAgBE,gBAAgBxE,EACzC,CAEA,SAASyE,sBAAsBzE,GAC7B,OAAOA,OACT,CA+JA,SAAS0E,cAAc1E,EAAc1F,EAAuB6F,GAC1D,IAAKH,EAAK,OACV,MAAM2E,EAAwB,mBAAR3E,EAClBA,aAAeD,OACZI,IACHA,EAAOH,GAETA,EAAMA,EAAIL,IAAIrF,IAEhB,MAAMsK,EAAIzE,GAAMA,MAAQ,OACxB,GAAIH,IAAQ6E,WACV,OAAO,IAAI9E,KACT,CACE6E,CAACA,GAAItK,EAAQhB,IAAIe,eAEnBuK,EACAzE,GAAMG,UAAW,GACjB,EACAH,GAAMsB,aAAc,GAGxB,MAAMqD,EAAMH,GAAUrK,EAAQR,MAAM6F,IAAIK,GACxC,OAAI8E,EACK,IAAI/E,KACT,CACE6E,CAACA,GAAIE,GAEPF,EACAzE,GAAMG,UAAW,GACjB,EACAH,GAAMsB,aAAc,QARxB,CAWF,CAEA,SAASsD,cAAiB/E,EAAQ1F,EAAuB0K,EAAQ,IAAI3J,SACnE,IAAKkG,MAAMC,QAAQxB,GAAM,OAAOA,EAChC,GAAIgF,EAAM9E,IAAIF,GAAM,OAAOA,EAC3BgF,EAAMlC,IAAI9C,GACV,IAAK,IAAI7G,EAAI,EAAGA,EAAI6G,EAAI/B,OAAQ9E,IAAK,CACnC,MAAMmI,EAAOtB,EAAI7G,GACjB,GAAImI,IAASuD,WACX7E,EAAI7G,GAAKmB,EAAQhB,IAAIe,mBAChB,GAAoB,mBAATiH,EAAqB,CACrC,MAAM2D,EAAc3K,EAAQR,MAAM6F,IAAI2B,GAClC2D,IACFjF,EAAI7G,GAAK8L,EAEb,MACEF,cAAczD,EAAMhH,EAAS0K,EAEjC,CACA,OAAOhF,CACT,CAuyBA,SAASkF,YAAYrK,EAAYP,GAC/B,OAAIO,aAAakF,KAAalF,EAAE8E,IAAIrF,GAChCO,IAAMsH,SACHtH,OADP,CAEF,CAEM,SAAUsK,SACdlK,EACAyD,EACAlF,EACA4L,EACAvF,EACAvF,EACA+K,GAEI3G,IAAS4G,SACXC,cAActK,EAAOzB,EAAM4L,EAAMvF,EAAOvF,EAAS+K,GAEjDG,eAAevK,EAAOzB,EAAM4L,EAAMvF,EAAOvF,EAAS+K,GAAgBI,MAAML,EAE5E,CAEA,SAASG,cACPtK,EACAzB,EACA4L,EACAvF,EACAvF,EACA+K,GAEA,MAAMrG,EAAa,GACnB,IAAK,IAAI7F,EAAI,EAAGA,EAAIK,EAAKyE,OAAQ9E,IAAK,CACpC,IAAIuM,EAAMC,SAAUC,GAAMN,SAASrK,EAAOzB,EAAKL,GAAI0G,EAAOvF,EAASsL,EAAGP,IAAiBtD,OACvF,GAAI2D,aAAe7D,aAAe6D,EAAI1D,UAAY0D,EAAIzD,WAAayD,EAAIxD,cAErE,YADAkD,OAAKjH,EAAWuH,GAGlB,GAAIrE,OAAO7H,EAAKL,KAAiB,IAAVK,EAAKL,GAAG,GAE7B,YADAiM,OAAKjH,EAAW,IAAI0D,WAAWvH,EAAQhB,IAAIwI,YAAa4D,GAAK,IAG/D1G,EAAIqE,KAAKqC,EACX,CACAN,OAAKjH,EAAWa,EAClB,CAEAnG,eAAe2M,eACbvK,EACAzB,EACA4L,EACAvF,EACAvF,EACA+K,GAEA,MAAMrG,EAAa,GACnB,IAAK,IAAI7F,EAAI,EAAGA,EAAIK,EAAKyE,OAAQ9E,IAAK,CACpC,IAAIuM,EACJ,IACE,IAAIG,EACJH,GAEmB,KADhBG,EAAKC,UAAWF,GAAMG,UAAU9K,EAAOzB,EAAKL,GAAI0G,EAAOvF,EAASsL,EAAGP,KACjEW,UACCH,EAAGI,eACIJ,EAAGjB,GAAG7C,MACrB,CAAE,MAAOmE,GAEP,YADAd,EAAKc,EAEP,CACA,GAAIR,aAAe7D,aAAe6D,EAAI1D,UAAY0D,EAAIzD,WAAayD,EAAIxD,cAErE,YADAkD,OAAKjH,EAAWuH,GAGlB,GAAIrE,OAAO7H,EAAKL,KAAiB,IAAVK,EAAKL,GAAG,GAE7B,YADAiM,OAAKjH,EAAW,IAAI0D,WAAWvH,EAAQhB,IAAIwI,YAAa4D,GAAK,IAG/D1G,EAAIqE,KAAKqC,EACX,CACAN,OAAKjH,EAAWa,EAClB,CAiBM,SAAU8G,UAAUK,GACxB,IACIF,EADAD,GAAY,EAEhB,MAAMpB,EAAI,IAAI5B,QAAa,CAACoD,EAASC,KACnCF,EAAS,IAAI7D,KACS,IAAhBA,EAAKrE,OAAcoI,EAAO/D,EAAK,KAEjC0D,GAAY,EACZC,EAAU3D,EAAK,GACf8D,EAAQ,CAAErE,OAAQO,EAAK,UAI7B,MAAO,CACL0D,YACAC,UACArB,IAEJ,CAEM,SAAUe,SAASQ,GACvB,IAAIpE,EACAuE,EAKJ,GAJAH,EAAS,IAAI7D,KACXgE,EAAsB,IAAhBhE,EAAKrE,OAAe,CAAEsI,MAAOjE,EAAK,SAAOnE,EAC/C4D,EAASO,EAAK,KAEZgE,EAAK,MAAMA,EAAIC,MACnB,MAAO,CAAExE,SACX,CAEOlJ,eAAekN,UACpB9K,EACAzB,EACAqG,EACAvF,EACAkM,EACAnB,GAEA,IAAID,EAAgBoB,EACpB,MAAM5B,EAAI,IAAI5B,QAAeoD,IAC3BhB,EAAO,IAAI9C,KACTkE,KAAgBlE,GAChB8D,OAGJ,IAAKK,iBAAiBxL,EAAOzB,EAAMqG,EAAOvF,EAAS8K,GAAM,EAAMC,IAAmBhE,OAAO7H,GAAO,CAC9F,IACIuF,EADAoE,EAAK3J,EAAK,GAEd,IACE,IAAIqM,EACJ9G,GAEmB,KADhB8G,EAAKC,UAAWF,GAAMG,UAAU9K,EAAOzB,EAAK,GAAIqG,EAAOvF,EAASsL,EAAGP,KACjEW,UACCH,EAAGI,eACIJ,EAAGjB,GAAG7C,MACrB,CAAE,MAAOmE,GAEP,YADAd,EAAKc,EAEP,CACA,IA2BIQ,EA3BA7L,EAAIkE,EACR,IACElE,EAAIkE,aAAegB,KAAOhB,EAAIY,IAAIrF,GAAWyE,CAC/C,CAAE,MAAOmH,GAEP,YADAd,EAAKc,EAEP,CACA,GAAM,KAAF/C,GAAkC,KAAFA,EAA8B,CAChE,GAAItI,QAEF,YADAuK,OAAKjH,EAAWgE,UAGlBgB,EAAO,KAAFA,EAA8B,GACrC,CACA,GAAItI,IAAMsH,SAAU,CAClB,GAAM,IAAFgB,GAA0B,IAAFA,EAE1B,YADAiC,OAAKjH,EAAWtD,GAGhBA,OAAIsD,CAER,CAEA,GAAM,KAAFgF,SAAqCtI,EAEvC,YADAuK,OAAKjH,EAAWtD,GAIlB,IACE,IAAIgL,EACJa,GAEmB,KADhBb,EAAKC,UAAWF,GAAMG,UAAU9K,EAAOzB,EAAK,GAAIqG,EAAOvF,EAASsL,EAAGP,KACjEW,UACCH,EAAGI,eACIJ,EAAGjB,GAAG7C,MACrB,CAAE,MAAOmE,GAEP,YADAd,EAAKc,EAEP,CACA,IAAIS,EAAID,EACR,IACEC,EAAID,aAAgB3G,KAAO2G,EAAK/G,IAAIrF,GAAWoM,CACjD,CAAE,MAAOR,GAEP,YADAd,EAAKc,EAEP,CACIS,IAAMxE,WACRwE,OAAIxI,GAENyI,UAAU,CACRzD,KACAzE,KAAMqH,UACNX,OACAnK,QACAJ,IACA8L,IACA5H,MACAzE,UACAuF,QACA6G,OACArB,iBACA7L,QAEJ,OACMoL,CACR,CAEM,SAAUU,SACdrK,EACAzB,EACAqG,EACAvF,EACA8K,EACAC,GAEA,IAAKoB,iBAAiBxL,EAAOzB,EAAMqG,EAAOvF,EAAS8K,GAAM,EAAOC,IAAmBhE,OAAO7H,GAAO,CAC/F,IAAI2J,EAAK3J,EAAK,GACVuF,EAAM4G,SAAUC,GAAMN,SAASrK,EAAOzB,EAAK,GAAIqG,EAAOvF,EAASsL,EAAGP,IAAiBtD,OACnFlH,EAAIkE,aAAegB,KAAOhB,EAAIY,IAAIrF,GAAWyE,EACjD,GAAM,KAAFoE,GAAkC,KAAFA,EAA8B,CAChE,GAAItI,QAEF,YADAuK,OAAKjH,EAAWgE,UAGlBgB,EAAO,KAAFA,EAA8B,GACrC,CACA,GAAItI,IAAMsH,SAAU,CAClB,GAAM,IAAFgB,GAA0B,IAAFA,EAE1B,YADAiC,OAAKjH,EAAWtD,GAGhBA,OAAIsD,CAER,CAEA,GAAM,KAAFgF,SAAqCtI,EAEvC,YADAuK,OAAKjH,EAAWtD,GAGlB,IAAI6L,EAAOf,SAAUC,GAAMN,SAASrK,EAAOzB,EAAK,GAAIqG,EAAOvF,EAASsL,EAAGP,IAAiBtD,OACpF4E,EAAID,aAAgB3G,KAAO2G,EAAK/G,IAAIrF,GAAWoM,EAC/CC,IAAMxE,WACRwE,OAAIxI,GAENyI,UAAU,CACRzD,KACAzE,KAAM4G,SACNF,OACAnK,QACAJ,IACA8L,IACA5H,MACAzE,UACAuF,QACA6G,OACArB,iBACA7L,QAEJ,CACF,CAiBA,SAASqN,uBACPC,EACAC,EAAc,GAEd,MAAM5M,EAAU2M,EAAOxM,QAAQhB,IAAIa,QAC7BC,EAAU0M,EAAOxM,QAAQhB,IAAIc,SAC7Ba,MAAEA,EAAK4E,MAAEA,EAAKvF,QAAEA,EAAO8K,KAAEA,EAAIjC,GAAEA,GAAO2D,EAC5C,GAAI3M,EAAQ6M,OAAQ,CAClB,MAAMC,EAAM9M,EAAQ+M,gBAAgB,KAClCD,EAAIE,cACJ,IACE,MAAMC,EAAIhD,IAAIzE,IAAIwD,GAClB,IAAKiE,EAEH,YADAhC,EAAK,IAAInF,YAAY,qBAAuBkD,IAG9CiE,EAAEN,EACJ,CAAE,MAAOR,GACP,GAAIlM,EAAQiN,oBAAsBf,aAAe9F,aAAc,CAC7D,MAAMyG,EAAM9M,EAAQ+M,gBAAgB,KAClCD,EAAIE,cACJ/B,EAAKkB,KAEPnM,EAAQmN,cAAc,CACpBf,MAAOD,EACPrL,QACA4E,QACAvF,WAEJ,MACE8K,EAAKkB,EAET,IAEF,OAAO,CACT,CAAO,GAAIrL,EAAMC,WAAaD,EAAMC,WAAaD,EAAMA,MAAQsM,OAAOR,GAAc,CAClF,MAAME,EAAM9M,EAAQ+M,gBAAgB,KAClCD,EAAIE,cACJ,IACE,MAAMC,EAAIhD,IAAIzE,IAAIwD,GAClB,IAAKiE,EAEH,YADAhC,EAAK,IAAInF,YAAY,qBAAuBkD,IAG9CiE,EAAEN,EACJ,CAAE,MAAOR,GACP,GAAIhM,EAAQhB,IAAIc,QAAQiN,oBAAsBf,aAAe9F,aAAc,CACzE,MAAMyG,EAAM9M,EAAQ+M,gBAAgB,KAClCD,EAAIE,cACJ/B,EAAKkB,KAEPnM,EAAQmN,cAAc,CACpBf,MAAOD,EACPrL,QACA4E,QACAvF,WAEJ,MACE8K,EAAKkB,EAET,IAEIC,EAAQ,IAAItF,mCAAmC,4BAOrD,OANA9G,EAAQmN,cAAc,CACpBf,QACAtL,QACA4E,MAAOA,EACPvF,aAEK,CACT,CACA,OAAO,CACT,CAEA,SAASsM,UAAUE,GACjB,MAAM1B,KAAEA,EAAIjC,GAAEA,EAAElI,MAAEA,EAAKX,QAAEA,EAAOuF,MAAEA,GAAUiH,EAC5C7L,EAAMA,QACN,MAAMd,EAAUG,EAAQhB,IAAIa,QAE5B,IAAI0M,uBAAuBC,GAI3B,IACE,MAAMM,EAAIhD,IAAIzE,IAAIwD,GAClB,IAAKiE,EAEH,YADAhC,EAAK,IAAIlE,0BAA0B,qBAAuBiC,IAG5DiE,EAAEN,EACJ,CAAE,MAAOR,GACP,GAAIhM,EAAQhB,IAAIc,QAAQiN,oBAAsBf,aAAe9F,aAAc,CACzE,MAAMyG,EAAM9M,EAAQ+M,gBAAgB,KAClCD,EAAIE,cACJ/B,EAAKkB,KAEPnM,EAAQmN,cAAc,CACpBf,MAAOD,EACPrL,QACA4E,QACAvF,WAEJ,MACE8K,EAAKkB,EAET,CACF,CAv4CAjC,SAA4C,EAAGe,OAAMvK,IAAG8L,IAAG5H,MAAKzE,UAASuF,YACvE,GAAU,OAANhF,EACF,MAAM,IAAIwF,UAAU,4CAA4CsG,GAAGpI,gBAOrE,GAJKgG,cAAcoC,KACjBA,EAAI,GAAGA,UAGCxI,IAANtD,QAA2BsD,IAARY,GAAkC,iBAAN4H,EAAgB,CAEjE,MAAMxG,EAAON,EAAMF,IAAIgH,GACnBxG,EAAK7F,UAAYA,EAAQhB,IAAIe,eAC3BC,EAAQhB,IAAIc,QAAQoN,OACtBlN,EAAQhB,IAAIwI,aAAa2F,cAAc3E,IAAI6D,GAO/C,YADAvB,OAAKjH,EAFKuG,cADEvE,EAAK7F,QAAW6F,EAAK7F,QAAgB6F,EAAKA,WAAQhC,EACjC7D,EAAS6F,IAASA,EAIjD,CAAO,QAAUhC,IAANtD,EACT,MAAM,IAAIwF,UAAU,iDAAiDsG,EAAEpI,gBAGzE,IAAKkG,sBAAsB5J,GAEzB,YADAuK,OAAKjH,EAAW,IAAI4B,UAAK5B,EAAWwI,IAItC,MAAMe,EAA+B,mBAAN7M,IAAqB4F,eAAe5F,EAAG8L,GAEtE,GAAIrM,EAAQhB,IAAIc,QAAQoN,OAASE,EAAiB,CAChD,IAAIC,EAAWhP,OAAOC,eAAeiC,GACrC,GACM4F,eAAekH,EAAMhB,KAErBrM,EAAQhB,IAAIwI,cACXxH,EAAQhB,IAAIwI,YAAY4F,gBAAgBC,EAAK7O,YAAY6J,QAE1DrI,EAAQhB,IAAIwI,YAAY4F,gBAAgBC,EAAK7O,YAAY6J,MAAQ,IAAInI,KAEvEF,EAAQhB,IAAIwI,aAAa4F,gBAAgBC,EAAK7O,YAAY6J,MAAMG,IAAI6D,UAE9DgB,EAAOhP,OAAOC,eAAe+O,GACzC,CAEA,GAAID,EAAiB,CACnB,GAAiB,mBAAN7M,GACL4F,eAAe5F,EAAG8L,GAAI,CACxB,MAAMiB,EAAYtN,EAAQhB,IAAIoB,mBAAmBiF,IAAI9E,EAAEC,WACjD+M,EAAUvN,EAAQhB,IAAIc,QAAQ0N,sBAAsBnI,IAAI9E,GAC9D,GAAIgN,EAEF,YADAzC,OAAKjH,EAAW,IAAI4B,KAAK8H,EAAQhN,GAAG,GAAO8L,IAG7C,KACIiB,GAAeA,EAAUG,OAAQH,EAAU1H,IAAIyG,MAChDrM,EAAQhB,IAAI8B,mBAAmB8E,IAAIrF,GAEpC,MAAM,IAAIuG,mBACR,mDAAmDvG,EAAE8H,QAAQgE,EAAEpI,aAGrE,CAIF,GAAIkC,eAAe5F,EAAG8L,GAAI,CACxB,MAAMkB,EAAUvN,EAAQhB,IAAIc,QAAQ0N,sBAAsBnI,IAAI9E,GAC9D,GAAIgN,EAEF,YADAzC,OAAKjH,EAAW,IAAI4B,KAAK8H,EAAQhN,GAAa,GAAO8L,IAGvD,GAAIrM,EAAQhB,IAAI8B,mBAAmB8E,IAAIrF,GAErC,YADAuK,OAAKjH,EAAW,IAAI4B,KAAKlF,EAAG8L,GAAG,GAAO,IAIxC,IAAIqB,EAAuBnN,EAAeC,UAC1C,KAAoB,OAAbkN,GAAmB,CACxB,MAAMJ,EAAYtN,EAAQhB,IAAIoB,mBAAmBiF,IAAIqI,GACrD,GAAIJ,KAAeA,EAAUG,MAAQH,EAAU1H,IAAIyG,IAEjD,YADAvB,OAAKjH,EAAW,IAAI4B,KAAKlF,EAAG8L,GAAG,GAAO,IAGxCqB,EAAWrP,OAAOC,eAAeoP,EACnC,CACA,GAAiB,mBAANnN,EAET,MAAM,IAAIuG,mBACR,4CAA6CvG,EAAe8H,QAAQgE,EAAEpI,aAG5E,CAEA,IAAIoJ,EAAW9M,EACf,KAAQ8M,EAAOhP,OAAOC,eAAe+O,IACnC,GAAIlH,eAAekH,EAAMhB,IAAY,cAANA,EAAmB,CAChD,MAAMkB,EAAUvN,EAAQhB,IAAIc,QAAQ0N,sBAAsBnI,IAAIgI,EAAK7O,aACnE,GAAI+O,EAEF,YADAzC,OAAKjH,EAAW,IAAI4B,KAAK8H,EAAQhN,GAAG,GAAQ8L,IAG9C,GAAIrM,EAAQhB,IAAI8B,mBAAmB8E,IAAIyH,EAAK7O,aAC1C,MAGF,IAAIkP,EAAsBL,EAAK7O,YAC3BmP,GAAc,EAClB,KAAoB,OAAbD,GAAmB,CACxB,MAAMJ,EAAYtN,EAAQhB,IAAIoB,mBAAmBiF,IAAIqI,GACrD,GAAIJ,KAAeA,EAAUG,MAAQH,EAAU1H,IAAIyG,IAAK,CACtDsB,GAAc,EACd,KACF,CACAD,EAAWrP,OAAOC,eAAeoP,EACnC,CACA,GAAIC,EACF,MAEF,GAAU,cAANtB,EACF,MAAM,IAAIvF,mBAAmB,yDAE/B,MAAM,IAAIA,mBACR,4CAA4CuG,EAAK7O,YAAY6J,QAAQgE,EAAEpI,aAE3E,CAEJ,CAEA,MAAMyB,EAAMnF,EAAE8L,GACd,GAAiB,mBAAN9L,GACC,cAAN8L,IAAsBrM,EAAQhB,IAAI8B,mBAAmB8E,IAAIrF,GAC3D,MAAM,IAAIuG,mBAAmB,yDAIjC,GAAU,cAANuF,IAAsBrM,EAAQhB,IAAI8B,mBAAmB8E,IAAIF,GAAKlH,aAChE,MAAM,IAAIsI,mBAAmB,yDAG/B,MAAMwD,EAAIF,cAAc1E,EAAK1F,EAAS,IAAIyF,KAAKlF,EAAG8L,GAAG,GAAO,IAC5D,GAAI/B,EAEF,YADAQ,OAAKjH,EAAWyG,GAIlB,MAAMsD,EACHnJ,aAAegB,MAAQhB,EAAIwB,UACd,mBAAN1F,IAAqBP,EAAQhB,IAAI8B,mBAAmB8E,IAAIrF,IAChEP,EAAQhB,IAAIiB,iBAAiB2F,IAAIrF,GAEnCuK,OAAKjH,EAAW,IAAI4B,KAAKlF,EAAG8L,GAAG,EAAOuB,GAAG,MA0D3C7D,OAAM,EAAsC,EAAGe,OAAMvK,IAAG8L,IAAG5H,MAAKzE,cAC9D,GAAIA,EAAQhB,IAAIc,QAAQ+N,oBACtB,MAAM,IAAIhH,uBAAuB,wCACnC,GAAiB,mBAANtG,EACT,MAAM,IAAIwF,UACR,GAAwB,iBAAdtB,GAAKoB,KAAoB,SAAWpB,GAAKoB,0BAGvD,MAAMiI,EAAOzB,EACV/L,IAAK0G,GACAA,aAAgByC,YACX,IAAIzC,EAAKA,MAET,CAACA,IAGX+G,OACAzN,IAAK0G,GAAS4D,YAAY5D,EAAMhH,IAEnC,GAAmB,mBAARyE,EAAoB,CAC7B,MAAM+F,EAAMxK,EAAQR,MAAM6F,IAAIZ,GAC9B,IAAIC,EAAM8F,EAAMA,EAAI/F,KAAQqJ,GAAQrJ,KAAOqJ,GAc3C,OAbApJ,EAAM0F,cAAc1F,EAAK1E,IAAY0E,EACrC+F,cAAc/F,EAAK1E,QAIR,MAAP0E,GAAmC,mBAAbA,EAAIsJ,KAC5BtJ,EAAIsJ,KACDC,IAAwBnD,OAAKjH,EAAWoK,IACxCjC,IAAmBlB,EAAKkB,KAG3BlB,OAAKjH,EAAWa,GAGpB,CACA,GAAID,EAAIzE,QAAQyE,EAAIoB,QAAUqI,KAAKC,WAAanO,EAAQb,iBAAiBsO,KAAM,CAC7E,MAAM/C,EAAQ,IAAIxK,IACZkO,EAAWC,IACf,GAAKA,GAAoB,iBAANA,IAAmB3D,EAAM9E,IAAIyI,GAAhD,CACA3D,EAAMlC,IAAI6F,GACV,IAAK,MAAMC,KAAKjQ,OAAOkQ,KAAKF,GAC1BrO,EAAQb,iBAAiBiI,QAASC,GAAOA,EAAGgH,EAAGC,IAC/CF,EAAQC,EAAEC,GAJwC,GAOtDF,EAAQN,EAAK,GACf,CAEA,GACErJ,EAAIzE,mBAAmBiH,OACvB6B,YAAYlD,IAAInB,EAAIzE,QAAQyE,EAAIoB,SAC/B7F,EAAQX,oBAAoBgG,IAAIZ,EAAIzE,UACnCA,EAAQT,0BAA0B8F,IAAIZ,EAAIzE,UAC5C,CACA,IAAIwO,EACAC,GAAU,EACd,GAAiB,SAAbhK,EAAIoB,KACN2I,EAAS,CACPjI,KAAM,OACNmI,MAAOZ,GAETW,IAAYX,EAAKnK,YACZ,GAAiB,QAAbc,EAAIoB,KACb2I,EAAS,CACPjI,KAAM,MACNoI,QAASlK,EAAIzE,QAAQqE,OAAM,IAE7BoK,IAAYD,EAAOG,QAAQhL,YACtB,GAAiB,UAAbc,EAAIoB,KACb2I,EAAS,CACPjI,KAAM,QACNoI,QAASlK,EAAIzE,QAAQqE,MAAM,EAAG,IAEhCoK,IAAYD,EAAOG,QAAQhL,YACtB,GAAiB,YAAbc,EAAIoB,KACb2I,EAAS,CACPjI,KAAM,UACNmI,MAAOZ,GAETW,IAAYX,EAAKnK,YACZ,GAAiB,WAAbc,EAAIoB,KACb2I,EAAS,CACPjI,KAAM,SACNqI,WAAYd,EAAK,GACjBe,iBAAyBhL,IAAZiK,EAAK,GAAmBrJ,EAAIzE,QAAQ2D,OAASmK,EAAK,GAC/DY,MAAOZ,EAAKzJ,MAAM,GAClBsK,QAASlK,EAAIzE,QAAQqE,MACnByJ,EAAK,QACOjK,IAAZiK,EAAK,QAAmBjK,EAAaiK,EAAK,GAAiBA,EAAK,KAGpEW,IAAYD,EAAOE,MAAM/K,UAAY6K,EAAOG,QAAQhL,YAC/C,GAAiB,YAAbc,EAAIoB,MAAmC,SAAbpB,EAAIoB,KACvC2I,EAAS,CAAEjI,KAAM9B,EAAIoB,MACrB4I,IAAYhK,EAAIzE,QAAQ2D,YACnB,GAAiB,eAAbc,EAAIoB,KAAuB,CACpC,MAAM9B,OACQF,IAAZiK,EAAK,GACDrJ,EAAIzE,QAAQ2D,OAAUmK,EAAK,GAC3BgB,KAAKC,IAAItK,EAAIzE,QAAQ2D,OAASmK,EAAK,GAAiBA,EAAK,IAC/DU,EAAS,CACPjI,KAAM,aACNqI,WAAYd,EAAK,GACjBkB,SAAWlB,EAAK,GAAgB/J,EAChC2K,MAAOjK,EAAIzE,QAAQqE,MAAMyJ,EAAK,GAAeA,EAAK,GAAgB/J,GAClE4K,QAASlK,EAAIzE,QAAQqE,MAAMyJ,EAAK,GAAeA,EAAK,GAAgB/J,IAEtE0K,IAAYD,EAAOE,MAAM/K,UAAY6K,EAAOG,QAAQhL,MACtD,CACI8K,IACFzO,EAAQX,oBAAoBgG,IAAIZ,EAAIzE,UAAUoH,QAASC,GAAOA,EAAGmH,IACjExO,EAAQT,0BAA0B8F,IAAIZ,EAAIzE,UAAUoH,QAASC,GAAOA,EAAGmH,IAE3E,CACA/J,EAAIY,IAAIrF,GACR,MAAMwK,EAAMxK,EAAQR,MAAM6F,IAAIZ,EAAIzE,QAAQyE,EAAIoB,OAC9C,IAAInB,EAAM8F,EAAMA,EAAI/F,EAAIzE,QAAQyE,EAAIoB,SAAUiI,GAASrJ,EAAIzE,QAAQyE,EAAIoB,SAASiI,GAChFpJ,EAAM0F,cAAc1F,EAAK1E,IAAY0E,EACrC+F,cAAc/F,EAAK1E,GACnB8K,OAAKjH,EAAWa,KAGlBqF,OAAM,GAA2C,EAAGe,OAAMuB,QACxD,IAAIjB,EAAM,CAAA,EACV,IAAK,MAAMpE,KAAQqF,EACbrF,EAAK5D,eAAeoG,aACtB4B,EAAM,IAAKA,KAAQpE,EAAK5D,IAAI4D,MAE5BoE,EAAIpE,EAAK5D,KAAO4D,EAAKtB,IAGzBoF,OAAKjH,EAAWuH,KAGlBrB,OAAM,EAAoC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAW,IAAI0F,OAAOhJ,EAAG8L,KAE5FtC,OAAM,GAAwC,EAAGe,OAAMuB,IAAGrM,cAWxD8K,OAAKjH,EAVSwI,EACX/L,IAAK0G,GACAA,aAAgByC,YACX,IAAIzC,EAAKA,MAET,CAACA,IAGX+G,OACAzN,IAAK0G,GAAS4D,YAAY5D,EAAMhH,OAIrC+J,UAAyC,EAAGe,OAAMuB,OAAQvB,OAAKjH,EAAWwI,IAE1EtC,OAAM,GAAyC,EAAGe,OAAMuB,QACtD,OAAQA,GACN,IAAK,OACH,OAAOvB,OAAKjH,GAAW,GACzB,IAAK,QACH,OAAOiH,OAAKjH,GAAW,GACzB,IAAK,OACH,OAAOiH,OAAKjH,EAAW,MACzB,IAAK,YACH,OAAOiH,OAAKjH,OAAWA,GACzB,IAAK,MACH,OAAOiH,OAAKjH,EAAWoL,KACzB,IAAK,WACH,OAAOnE,OAAKjH,EAAWqL,KAE3BpE,EAAK,IAAIpE,MAAM,mBAAqB2F,MAGtCtC,OAAM,EAAmC,EAAGe,OAAMuB,OAChDvB,OAAKjH,EAAWsL,OAAO9C,EAAEkB,QAAQ,KAAM,OAEzCxD,OAAM,GAAmC,EAAGe,OAAMuB,OAChDvB,OAAKjH,EAAWoJ,OAAOZ,EAAEkB,QAAQ,KAAM,OAEzCxD,OAAM,EAAwC,EAAGe,OAAMuB,IAAGrM,aACxD8K,OAAKjH,EAAW7D,EAAQf,UAAUmQ,QAAQC,SAAShD,MAGrDtC,OAAM,GAAuC,EAAGe,OAAMuB,IAAGrM,cACvD,MAAMsP,EAActP,EAAQf,UAAUsQ,QAAQF,SAAShD,IACvD,IAAKrM,EAAQhB,IAAIiB,iBAAiB2F,IAAI4J,QACpC,MAAM,IAAI3I,uBAAuB,uBAEjCiE,OAAKjH,EAAW,IAAI2L,OAAOF,EAAIG,MAAOH,EAAII,UAI9C3F,UAA+C,EAAG3F,OAAM0G,OAAMnK,QAAO0L,IAAGrM,UAASuF,YAC/E,MAAMyB,EAAOhH,EAAQf,UAAU0Q,SAASN,SAAShD,KAC3C,CAAGhE,EAAMuH,GAAM5I,EACf7C,EAAgB,GACtB,IAAIyF,EACJ,MAAMiG,EAAoB,GAC1B,KAAQjG,EAAIC,aAAazF,KAAKiE,IACvBuB,EAAE,KACLzF,EAAM4E,KAAK6G,EAAGP,SAASzF,EAAE,GAAI,MAC7BiG,EAAQ9G,KAAKa,EAAE,KAInBxF,EAAgBzD,EAAOwD,EAAOoB,EAAOvF,EAAS,IAAIgI,KAChD,MAAM8H,EAAiC,CAAA,EACvC,GAAoB,IAAhB9H,EAAKrE,OAEP,YADAmH,EAAK9C,EAAK,IAGZ,MAAM+H,EAAY/H,EAAK,GACvB,IAAK,MAAMnJ,KAAKR,OAAOkQ,KAAKwB,GAA2C,CACrE,MAAMC,EAAMH,EAAQhR,GACpBiR,EAAME,GAAOD,EAAWlR,EAC1B,CACAiM,OACEjH,EACAwE,EAAKkF,QAAQ,yBAA0B,CAAC0C,EAAOC,EAAIC,EAAGH,KACpD,GAAIG,EAAG,OAAOF,EAEd,OAAQC,GAAU,IAAM,GAAGtF,YADfkF,EAAME,GAC0BhQ,YAMpD+J,OAAM,GAA2C,EAAGe,OAAMuB,QACxDvB,OAAKjH,EAAW,IAAI4F,YAAY4C,MAGlCtC,OAAM,GAA0D,EAAGe,OAAMuB,QACvEvB,OAAKjH,EAAW,IAAI2F,aAAa6C,MAGnCtC,UAAuC,EAAGe,OAAMuB,OAAQvB,OAAKjH,GAAYwI,IACzEtC,UAA0C,EAAGe,OAAMuB,OAAQvB,OAAKjH,GAAYwI,IAE5EtC,OAAM,GAAwD,EAAGe,OAAMrG,MAAKzE,cAC1E4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,IAAaY,EAAIzE,QAAQyE,EAAIoB,SAGpCkE,OAAM,GAAuD,EAAGe,OAAMrG,MAAKzE,cACzE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAWY,EAAIzE,QAAQyE,EAAIoB,WAGlCkE,OAAM,GAAwD,EAAGe,OAAMrG,MAAKzE,cAC1E4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,IAAaY,EAAIzE,QAAQyE,EAAIoB,SAGpCkE,OAAM,GAAuD,EAAGe,OAAMrG,MAAKzE,cACzE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAWY,EAAIzE,QAAQyE,EAAIoB,WAGlCkE,SAEE,EAAGe,OAAMuB,IAAG5H,MAAKzE,UAASuF,QAAO6G,WAG/B,GAFAxD,YAAYnE,EAAKzE,GACjByE,EAAIwB,SAAWmG,GAAMnG,WAAY,EAC7BxB,EAAI0C,WAAY,CAClB,MAAMiJ,EAAI7K,EAAMC,iBAAiBf,EAAIoB,KAA6B,SAAbpB,EAAIoB,MACzD,GAAU,OAANuK,EACF,MAAM,IAAItK,eAAe,yCAAyCrB,EAAIoB,KAAK5B,eAS7E,OAPAmM,EAAEpP,IAAIyD,EAAIoB,KAAgBwG,GACtB5H,EAAIwB,SACNmK,EAAExR,QAAQ6F,EAAIoB,KAAK5B,aAAc,SAE1BmM,EAAExR,QAAQ6F,EAAIoB,KAAK5B,iBAE5B6G,OAAKjH,EAAWwI,EAElB,CACAvB,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,MAAQwG,KAI7CtC,OAAM,GAAkD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cACvE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,OAASwG,KAG5CtC,OAAM,GAAqD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cAC1E4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,OAASwG,KAG5CtC,OAAM,GAAoD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cACzE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,OAASwG,KAG5CtC,OAAM,GAAsD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cAC3E4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,OAASwG,KAG5CtC,OAAM,GAAmD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cACxE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,QAAUwG,KAG7CtC,OAAM,GAAqD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cAC1E4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,OAASwG,KAG5CtC,OAAM,GAAuD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cAC5E4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,OAASwG,KAG5CtC,OAAM,GAAoD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cACzE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,OAASwG,KAG5CtC,OAAM,GAAmD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cACxE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,OAASwG,KAG5CtC,OAAM,GAAuD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cAC5E4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,QAAUwG,KAG7CtC,OAAM,GAAwD,EAAGe,OAAMuB,IAAG5H,MAAKzE,cAC7E4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,QAAUwG,KAG7CtC,OAAM,GAEJ,EAAGe,OAAMuB,IAAG5H,MAAKzE,cACf4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,EAAYY,EAAIzE,QAAQyE,EAAIoB,SAAWwG,KAIhDtC,OAAM,GAAkD,EAAGe,OAAMuB,IAAG5H,MAAKzE,sBACvE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,GAAWwM,EAAC5L,EAAIzE,SAAOsQ,EAAC7L,EAAIoB,QAAIwK,EAAAC,GAAMjE,MAG7CtC,OAAM,GAAiD,EAAGe,OAAMuB,IAAG5H,MAAKzE,sBACtE4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,GAAWwM,EAAC5L,EAAIzE,SAAOsQ,EAAC7L,EAAIoB,QAAIwK,EAAAC,GAAMjE,MAG7CtC,OAAM,GAEJ,EAAGe,OAAMuB,IAAG5H,MAAKzE,sBACf4I,YAAYnE,EAAKzE,GACjB8K,OAAKjH,GAAWwM,EAAC5L,EAAIzE,SAAOsQ,EAAC7L,EAAIoB,QAAIwK,EAAAC,GAAMjE,MAI/CtC,OAAM,GAAsC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IACpFtC,OAAM,GAAuC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IACrFtC,OAAM,GAA2C,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IAC1FtC,OAAM,GAA4C,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IAC3FtC,OAAM,GAAiC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IAChFtC,OAAM,GAAuC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,IAAM8L,IACvFtC,OAAM,GAAoC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IACnFtC,OAAM,GAA0C,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,IAAM8L,IAC1FtC,OAAM,GAA+B,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IAC9EtC,OAAM,GAA8B,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IAC7EtC,OAAM,GAA6C,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IAC5FtC,OAAM,GAAkC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IAChFtC,OAAM,GAAiC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IAC/EtC,OAAM,GAAgC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IAC9EtC,OAAM,GAAiC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IAC/EtC,UAA0C,EAAGe,OAAMuB,OAAQvB,OAAKjH,GAAYwI,IAC5EtC,UAA0C,EAAGe,OAAMuB,OAAQvB,OAAKjH,GAAYwI,IAC5EtC,OAAM,GAAkC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IAChFtC,OAAM,GAAiC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IAChFtC,OAAM,GAAqC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IACnFtC,OAAM,GAAoC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IAClFtC,OAAM,GAAmC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,EAAI8L,IACjFtC,OAAM,GAAwC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IACvFtC,OAAM,GAAyC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,GAAK8L,IACxFtC,OAAM,GAAiD,EAAGe,OAAMvK,IAAG8L,OACjEvB,OAAKjH,EAAWtD,IAAM8L,IAExBtC,UAA2C,EAAG3F,OAAM0G,OAAMnK,QAAO0L,IAAGrM,UAASuF,YAC3EnB,EAAKzD,EAAO0L,EAAG9G,EAAOvF,EAAS,CAAC4L,EAAG/F,KACjCiF,OAAKjH,SAAkB+G,YAAY/E,EAAM7F,QAI7C+J,OAAM,GAAoD,EAAGe,OAAMvK,IAAG8L,OACpEvB,OAAKjH,EAAWtD,aAAa8L,IAE/BtC,OAAM,GAA0B,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAWtD,KAAK8L,IAEzEtC,OAAM,GAAoC,EAAGe,OAAM9K,UAASoM,WACpDA,aAAgB3G,MAItBmD,YAAYwD,EAAMpM,EAAS,UACvBoM,EAAKjF,WACP2D,OAAKjH,GAAW,GAGlBiH,OAAKjH,SAAmBuI,EAAKpM,UAAkBoM,EAAKvG,QARlDiF,OAAKjH,GAAW,KAWpBkG,SAAwB,EAAGe,OAAMuB,OAAQvB,OAAKjH,EAAWwI,IAEzDtC,OAAM,GAA+C,EAAGe,OAAMvK,IAAG8L,IAAG9G,QAAO6G,WACzEtB,OAAKjH,EAAW0B,EAAMe,QAAQ/F,EAAC,MAAe8L,EAAGD,GAAMnG,WAAY,MAGrE8D,OAAM,EAA+C,EAAGe,OAAMvK,IAAG8L,IAAG9G,QAAO6G,WACzEtB,OAAKjH,EAAW0B,EAAMe,QAAQ/F,EAAC,MAAe8L,EAAGD,GAAMnG,WAAY,MAGrE8D,OAAM,EAAiD,EAAGe,OAAMvK,IAAG8L,IAAG9G,QAAO6G,WAC3EtB,OAAKjH,EAAW0B,EAAMe,QAAQ/F,EAAC,QAAiB8L,EAAGD,GAAMnG,WAAY,MAGvE8D,UAEE,EAAGe,OAAMnK,QAAOJ,IAAG8L,IAAG5H,MAAKzE,UAASuF,YAElC,GADAhF,EAAI,IAAIA,GACc,iBAAXkE,EAAI,IAAmBA,EAAI,aAAcnB,WAAY,CAC9D,IAAItD,EAAQN,WAAYM,EAAQL,YAG9B,MAAM,IAAIkH,uBAAuB,8CAFjCpC,EAAI,GAAK4H,EAAIrM,EAAQL,YAAY4Q,gBAAgB,IAAIjN,WAAWmB,EAAI,IAAKzE,EAAQf,UAIrF,CACIsB,EAAE0I,QACJ6B,OAAKjH,EAAW4E,oBAAoBlI,EAAG8L,EAAG1L,EAAOX,EAASuF,IAE1DuF,OAAKjH,EAAWsE,eAAe5H,EAAG8L,EAAG1L,EAAOX,EAASuF,MAK3DwE,UAEE,EAAGe,OAAMnK,QAAOJ,IAAG8L,IAAG5H,MAAKzE,UAASuF,YAClC,GAAsB,iBAAXd,EAAI,IAAmBA,EAAI,aAAcnB,WAAY,CAC9D,IAAItD,EAAQN,WAAYM,EAAQL,YAG9B,MAAM,IAAIkH,uBAAuB,8CAFjCpC,EAAI,GAAK4H,EAAIrM,EAAQL,YAAY4Q,gBAAgB,IAAIjN,WAAWmB,EAAI,IAAKzE,EAAQf,UAIrF,CACA,MAAMuR,EAAUjQ,EAAE0I,QACZZ,EAAO9H,EAAE0I,QACf,IAAI5G,EAEFA,EADS,KAAPmO,EACK/H,oBAAoBlI,EAAe8L,EAAG1L,EAAOX,EAASuF,EAAO8C,GAE7DF,eAAe5H,EAAe8L,EAAG1L,EAAOX,EAASuF,EAAO8C,GAE7DA,GACF9C,EAAMe,QAAQ+B,EAAI,MAAehG,GAEnCyI,OAAKjH,EAAWxB,KAIpB0H,UAEE,EAAGe,OAAMnK,QAAOJ,IAAG8L,IAAG5H,MAAKzE,UAASuF,YAClC,GAAsB,iBAAXd,EAAI,IAAmBA,EAAI,aAAcnB,WAAY,CAC9D,IAAItD,EAAQN,WAAYM,EAAQL,YAG9B,MAAM,IAAIkH,uBAAuB,8CAFjCpC,EAAI,GAAK4H,EAAIrM,EAAQL,YAAY4Q,gBAAgB,IAAIjN,WAAWmB,EAAI,IAAKzE,EAAQf,UAIrF,CACA,MAAMuR,EAAUjQ,EAAE0I,QACZZ,EAAO9H,EAAE0I,QAIf,IAAI5G,EAHAgG,IACF9C,EAAQ,IAAI7E,MAAM6E,EAAO,KAIzBlD,EADS,KAAPmO,EACK/H,oBAAoBlI,EAAe8L,EAAG1L,EAAOX,EAASuF,EAAO8C,GAE7DF,eAAe5H,EAAe8L,EAAG1L,EAAOX,EAASuF,EAAO8C,GAE7DA,GACF9C,EAAMe,QAAQ+B,EAAI,MAAehG,GAEnCyI,OAAKjH,EAAWxB,KAIpB0H,UAAsC,EAAG3F,OAAM0G,OAAMnK,QAAOJ,IAAG8L,IAAGrM,UAASuF,YACzE,MAAOkL,EAAYC,EAAeC,EAAaC,EAAWC,EAAMC,EAAWC,GAAcxQ,EACzF,IAAIyQ,GAAO,EACX,MAAMC,EAAY,IAAIvQ,MAAM6E,EAAO,CAAA,GAC7B2L,EAAe,CACnBC,WAAOtN,GAEHuN,EAAe,IAAI1Q,MAAMuQ,EAAWC,GAC1C,GAAI9M,IAASqH,UACX,WACE,IAAIF,EAaJ,IAZAA,EAAKC,UAAWF,GAAMlH,EAAKzD,EAAOiQ,EAAWK,EAAWjR,EAASsL,IACjE4F,EAAoB,OACqE,KAAtF3F,EAAKC,UAAWF,GAAMlH,EAAKzD,EAAOgQ,EAAaM,EAAWjR,EAASsL,KAAKI,UACrEH,EAAGI,eACIJ,EAAGjB,GAAG7C,OACnB8D,EAAKC,UAAWF,GAAMlH,EAAKzD,EAAO+P,EAAeU,EAAcpR,EAASsL,IACpEmF,IACFO,GAEE,KADCzF,EAAKC,UAAWF,GAAMlH,EAAKzD,EAAOmQ,EAAWM,EAAcpR,EAASsL,KAAKI,UAEtEH,EAAGI,eACIJ,EAAGjB,GAAG7C,QACduJ,GAAM,CACX,MAAMK,EAAgB,CAAA,EACtB9F,EAAKC,UAAWF,GACdlH,EAAKzD,EAAOoQ,EAAY,IAAIrQ,MAAM0Q,EAAcC,GAAgBrR,EAASsL,KAE1D,IAAjBC,EAAGG,UAAqBH,EAAGI,eAAiBJ,EAAGjB,GAAG7C,OAClD,MAAM2D,QAAYzC,iBAChBhI,EACAX,EACAqM,EACA,CAAC,IAAI3L,MAAMuQ,EAAWI,IACtB,QAEF,GAAIjG,aAAe7D,YAAc6D,EAAI1D,SAEnC,YADAoD,OAAKjH,EAAWuH,GAGlB,GAAIA,aAAe7D,YAAc6D,EAAIzD,UACnC,MAEF4D,EAAKC,UAAWF,GAAMlH,EAAKzD,EAAOkQ,EAAMO,EAAcpR,EAASsL,IAC/D0F,GAEE,KADCzF,EAAKC,UAAWF,GAAMlH,EAAKzD,EAAOmQ,EAAWM,EAAcpR,EAASsL,KAAKI,UAEtEH,EAAGI,eACIJ,EAAGjB,GAAG7C,MACrB,CACAqD,GACD,EA1CD,GA0CKK,MAAML,OACN,CAKL,IAJAO,SAAUC,GAAMlH,EAAKzD,EAAOiQ,EAAWK,EAAWjR,EAASsL,IAC3D4F,EAAoB,MAAI7F,SAAUC,GAAMlH,EAAKzD,EAAOgQ,EAAaM,EAAWjR,EAASsL,IAAI7D,OACzF4D,SAAUC,GAAMlH,EAAKzD,EAAO+P,EAAeU,EAAcpR,EAASsL,IAC9DmF,IAAYO,EAAO3F,SAAUC,GAAMlH,EAAKzD,EAAOmQ,EAAWM,EAAcpR,EAASsL,IAAI7D,QAClFuJ,GAAM,CACX,MAAMK,EAAgB,CAAA,EACtBhG,SAAUC,GAAMlH,EAAKzD,EAAOoQ,EAAY,IAAIrQ,MAAM0Q,EAAcC,GAAgBrR,EAASsL,IACzF,MAAMF,EAAM7C,YAAY5H,EAAOX,EAASqM,EAAG,CAAC,IAAI3L,MAAMuQ,EAAWI,IAAiB,QAClF,GAAIjG,aAAe7D,YAAc6D,EAAI1D,SAEnC,YADAoD,OAAKjH,EAAWuH,GAGlB,GAAIA,aAAe7D,YAAc6D,EAAIzD,UACnC,MAEF0D,SAAUC,GAAMlH,EAAKzD,EAAOkQ,EAAMO,EAAcpR,EAASsL,IACzD0F,EAAO3F,SAAUC,GAAMlH,EAAKzD,EAAOmQ,EAAWM,EAAcpR,EAASsL,IAAI7D,MAC3E,CACAqD,GACF,IAGFf,OAAM,GAA0C,EAAGe,OAAMvK,IAAGP,UAAS+K,qBACnE,GAAwB,WAAnBA,GAAqC,aAANxK,IAAsBwK,EACxD,MAAM,IAAIhF,UAAU,WAAaxF,EAAI,cAEvCuK,OACEjH,EACA,IAAI0D,WAAWvH,EAAQhB,IAAIwI,iBAAa3D,GAAW,EAAa,UAANtD,EAAqB,aAANA,MAI7EwJ,OAAM,GAA4B,EAAG3F,OAAM0G,OAAMnK,QAAOJ,IAAG8L,IAAGrM,UAASuF,QAAOwF,qBAC5E3G,EAAKzD,EAAOiK,YAAYrK,EAAGP,GAAWqM,EAAE1C,EAAI0C,EAAEzC,EAAGrE,EAAOvF,EAAS8K,EAAMC,KAGzEhB,UAAwC,EAAG3F,OAAM0G,OAAMnK,QAAOJ,IAAG8L,IAAGrM,UAASuF,YAC3EnB,EAAKzD,EAAOiK,YAAYrK,EAAGP,GAAWqM,EAAE1C,EAAI0C,EAAEzC,EAAGrE,EAAOvF,EAAS8K,OAAMjH,KAGzEkG,OAAM,GAAoC,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAW,IAAI6F,GAAGnJ,EAAG8L,KACxFtC,OAAM,GAA8B,EAAGe,OAAMvK,IAAG8L,OAAQvB,OAAKjH,EAAW,IAAI6F,GAAGnJ,EAAG8L,KAElFtC,UAAgD,EAAG3F,OAAM0G,OAAMnK,QAAOJ,IAAG8L,IAAGrM,UAASuF,YACnFnB,EAAKzD,EAAOJ,EAAGgF,EAAOvF,EAAS,IAAIgI,KACjC,GAAoB,IAAhBA,EAAKrE,OAEP,YADAmH,EAAK9C,EAAK,IAGZ,IAAIsJ,EAAStJ,EAAK,GAElB,GADAsJ,EAAS1G,YAAY0G,EAAQtR,GACzBoE,IAAS4G,SAAU,CACrB,IAAII,EACAmG,GAAS,EACb,IAAK,MAAMC,KAAYnF,EACrB,GACEkF,IACCA,GACEC,EAAS,IACVF,IACE1G,YACES,SAAUC,GAAMlH,EAAKzD,EAAO6Q,EAAS,GAAIjM,EAAOvF,EAASsL,IAAI7D,OAC7DzH,IAEN,CACA,IAAKwR,EAAS,GAAI,SAElB,GADApG,EAAM7C,YAAY5H,EAAOX,EAASwR,EAAS,GAAI,CAACjM,GAAQ,UACpD6F,EAAIzD,UAAW,MACnB,GAAIyD,EAAI1D,SAEN,YADAoD,OAAKjH,EAAWuH,GAGlB,IAAKoG,EAAS,GAEZ,KAEJ,CAEF1G,GACF,KACE,WACE,IAAIM,EACAmG,GAAS,EACb,IAAK,MAAMC,KAAYnF,EAAG,CACxB,IAAId,EACJ,GACEgG,IACCA,GACEC,EAAS,IACVF,IACE1G,aAEI,KADDW,EAAKC,UAAWF,GAAMlH,EAAKzD,EAAO6Q,EAAS,GAAIjM,EAAOvF,EAASsL,KAAKI,UAEjEH,EAAGI,eACIJ,EAAGjB,GAAG7C,OACjBzH,IAEN,CACA,IAAKwR,EAAS,GAAI,SAElB,GADApG,QAAYzC,iBAAiBhI,EAAOX,EAASwR,EAAS,GAAI,CAACjM,GAAQ,UAC/D6F,EAAIzD,UAAW,MACnB,GAAIyD,EAAI1D,SAEN,YADAoD,OAAKjH,EAAWuH,GAGlB,IAAKoG,EAAS,GAEZ,KAEJ,CACF,CACA1G,GACD,EAhCD,GAgCKK,MAAML,OAKjBf,OAAM,GAEJ,EAAG3F,OAAM0G,OAAMnK,QAAOJ,IAAG8L,IAAGrM,UAASuF,QAAOwF,qBAC1C,MAAO0G,EAAWC,EAAWC,GAAetF,EAG5CuF,oBACExN,EACA,IAAIyN,KACF,MAAMC,EAAiC,IAAnBD,EAAQlO,OACtBoO,EAAWD,EAAcD,EAAQ,QAAKhO,EACtCmO,GAAaF,GAAeD,EAAQlO,OAAS,EAAIkO,EAAQ,QAAKhO,EAG9DoO,EAA4B,CAACC,EAAmBC,KAChDR,GAAeA,EAAYhO,OAAS,EAEtCiO,oBACExN,EACA,IAAIgO,KACF,MAAMC,EAAyC,IAAvBD,EAAYzO,OAC9B2O,GACHD,GAAmBD,EAAYzO,OAAS,EAAIyO,EAAY,QAAKvO,EAG5DwO,EACFvH,EAAKsH,EAAY,IAMjBE,aAAyB/K,aACxB+K,EAAc5K,UAAY4K,EAAc3K,WAAa2K,EAAc1K,cAEpEkD,OAAKjH,EAAWyO,GAKdJ,EACFpH,EAAKqH,GACIA,aAAyB5K,aAGhC4K,EAAczK,UACdyK,EAAcxK,WACdwK,EAAcvK,cAEdkD,OAAKjH,EAAWsO,GAOlBrH,KAGJnK,EACAX,EACA2R,EACA,CAAC,IAAIjR,MAAM6E,EAAO,CAAA,IAClBwF,GAIEmH,EACFpH,EAAKqH,GACIA,aAAyB5K,aAE9B4K,EAAczK,UAAYyK,EAAcxK,WAAawK,EAAcvK,cACrEkD,OAAKjH,EAAWsO,GAMlBrH,KAMN,GAAIgH,GAAeJ,GAAaA,EAAU/N,OAAS,EAAG,CACpD,MAAM4O,EAA8B,CAAA,EAChCd,IAAWc,EAAGd,GAAaM,GAE/BH,oBACExN,EACA,IAAIoO,KACF,MAAMC,EAAqC,IAArBD,EAAU7O,OAC1B+O,EAAqBD,EACvBD,EAAU,GACVA,EAAU7O,OAAS,EACjB6O,EAAU,QACV3O,EAGNoO,EAA0BQ,EAAeC,IAE3C/R,EACAX,EACA0R,EACA,CAAC,IAAIhR,MAAM6E,EAAOgN,IAClBxH,EAEJ,MAEEkH,EAA0BH,EAAaA,EAAcC,EAAWC,IAGpErR,EACAX,EACAO,EACA,CAAC,IAAIG,MAAM6E,IACXwF,KAKNhB,UAAsB,EAAGe,WACvBA,MAEFf,OAAM,GAA+D,EAAGe,OAAMvK,IAAG8L,IAAGrM,cAClF,IAAKA,EAAQhB,IAAIiB,iBAAiB2F,IAAIrF,KAAOP,EAAQhB,IAAI8B,mBAAmB8E,IAAIrF,GAC9E,MAAM,IAAIuG,mBAAmB,oCAAoCvG,EAAE/B,YAAY6J,QAEjFyC,OAAKjH,EAAW,IAAItD,KAAK8L,MAG3BtC,OAAM,GAAiB,EAAGe,OAAMuB,QAC9BvB,EAAKuB,KAEPtC,OAAM,GAAiC,EAAGe,OAAMvK,OAAQuK,OAAKjH,EAAWtD,EAAEyI,QAC1Ee,OAAM,EAAgB,EAAGe,UAAWA,KAkZpC,MAAM6H,YAAc,IAAIzS,IAAI,8BAY5B,SAASiM,iBACPxL,EACAzB,EACAqG,EACAvF,EACA8K,EACA0F,EACAzF,GAEA,MAAM3G,EAAOoM,EAAU/E,UAAYT,SACnC,GAAI9L,aAAgBuG,KAClBqF,OAAKjH,EAAW3E,EAAKmG,IAAIrF,SACpB,GAAId,IAAS2I,SAClBiD,SACK,GAAI7D,MAAMC,QAAQhI,KAAU6H,OAAO7H,GAC7B,IAAPA,EAAK,GACP4L,IAEAD,SAASlK,EAAOyD,EAAMlF,EAAgB4L,EAAMvF,EAAOvF,EAAS+K,QAEzD,GAAKhE,OAAO7H,GAEZ,GAAW,KAAPA,EAAK,GACd2L,SAASlK,EAAOyD,EAAMlF,EAAK,GAAc4L,EAAMvF,EAAOvF,EAAS+K,QAC1D,GAAW,KAAP7L,EAAK,GACTsR,EAEMxQ,EAAQhB,IAAIoB,oBAAoBwF,IAAI8C,QAAQlI,WACrDiL,UACE9K,EACAzB,EAAK,GACLqG,EACAvF,EACAzB,SAAUyJ,KACR,GAAoB,IAAhBA,EAAKrE,OAAcmH,EAAK9C,EAAK,SAE/B,IACE8C,OAAKjH,QAAkB+G,YAAY5C,EAAK,GAAIhI,GAC9C,CAAE,MAAOgM,GACPlB,EAAKkB,EACP,GAEJjB,GACAI,MAAML,GAERA,EAAK,IAAIjE,uBAAuB,iCAnBhCiE,EAAK,IAAInF,YAAY,8DAqBlB,KAAIgN,YAAY/M,IAAI1G,EAAK,IAgB9B,OAAO,EAfPoN,UAAU,CACRzD,GAAI3J,EAAK,GACTkF,OACA0G,OACAnK,QACAJ,EAAGrB,EAAK,GACRmN,EAAGnN,EAAK,GACRuF,IAAKvF,EACLA,OACAc,UACAuF,QACA6G,UAAMvI,EACNkH,kBAIJ,MA3CED,OAAKjH,EAAW3E,GA4ClB,OAAO,CACT,CACM,SAAUqJ,YACd5H,EACAX,EACAgC,EACA4Q,EAAmB,GACnB7H,GAEA,OAAOM,SAAUP,GACf8G,oBAAoB5G,SAAUF,EAAMnK,EAAOX,EAASgC,EAAe4Q,EAAQ7H,IAC3EtD,MACJ,CAEOlJ,eAAeoK,iBACpBhI,EACAX,EACAgC,EACA4Q,EAAmB,GACnB7H,GAEA,IAAIQ,EACJ,OAEiB,KAFTA,EAAKC,UAAWV,GACtB8G,oBAAoBnG,UAAWX,EAAMnK,EAAOX,EAASgC,EAAe4Q,EAAQ7H,KAC3EW,UACCH,EAAGI,eACIJ,EAAGjB,GAAG7C,MACnB,CAEA,SAASmK,oBACPxN,EACA0G,EACAnK,EACAX,EACAgC,EACA4Q,EAAmB,GACnB7H,GAEA,IAAK/I,EAEH,YADA8I,IAGF,KAAM9I,aAAyBiF,OAC7B,MAAM,IAAItB,YAAY,sBAExB,IACIyK,EADA7K,EAAQvF,EAAQhB,IAAIyB,YAExB,KAAQ2P,EAAIwC,EAAO3J,SACA,iBAANmH,IAET7K,EADE6K,aAAa1P,MACP0P,EAEA,IAAI1P,MAAM6E,EAAO6K,EAAGA,aAAa3J,gBAAa5C,EAAY,OAGlE7D,EAAQhB,IAAIc,QAAQoN,QAAUlN,EAAQhB,IAAIwI,cAC5CxH,EAAQhB,IAAIwI,YAAc,CACxB2F,cAAe,IAAIjN,IACnBkN,gBAAiB,CAAA,IAGjBhJ,IAAS4G,SACX6H,qBAAqB/H,EAAMnK,EAAOX,EAASgC,EAAeuD,EAAOwF,GAEjE+H,sBAAsBhI,EAAMnK,EAAOX,EAASgC,EAAeuD,EAAOwF,GAAgBI,MAAML,EAE5F,CAEA,SAAS+H,qBACP/H,EACAnK,EACAX,EACAgC,EACAuD,EACAwF,GAEA,KAAM/I,aAAyBiF,OAAQ,MAAM,IAAItB,YAAY,sBAC7D,IAAI9G,EAAI,EACR,IAAKA,EAAI,EAAGA,EAAImD,EAAc2B,OAAQ9E,IAAK,CACzC,IAAIuM,EACAY,EACJ,MAAM+G,EAAU/Q,EAAcnD,GAC9B,IACEmM,SACErK,EACAoS,EACAxN,EACAvF,EACA,IAAIgI,KACkB,IAAhBA,EAAKrE,OAAcqI,EAAM,CAAEC,MAAOjE,EAAK,IACtCoD,EAAMpD,EAAK,IAElB+C,EAEJ,CAAE,MAAOa,GACPI,EAAM,CAAEC,MAAOL,EACjB,CACA,GAAII,EAEF,YADAlB,EAAKkB,EAAIC,OAGX,GAAIb,aAAe7D,WAEjB,YADAuD,OAAKjH,EAAWuH,GAGlB,GAAIrE,OAAOgM,IAAsB,IAAVA,EAAQ,GAE7B,YADAjI,OAAKjH,EAAW,IAAI0D,WAAWvH,EAAQhB,IAAIwI,YAAa4D,GAAK,GAGjE,CACAN,OAAKjH,EAAW,IAAI0D,WAAWvH,EAAQhB,IAAIwI,iBAAa3D,GAAW,GACrE,CAEAtF,eAAeuU,sBACbhI,EACAnK,EACAX,EACAgC,EACAuD,EACAwF,GAEA,KAAM/I,aAAyBiF,OAAQ,MAAM,IAAItB,YAAY,sBAC7D,IAAI9G,EAAI,EACR,IAAKA,EAAI,EAAGA,EAAImD,EAAc2B,OAAQ9E,IAAK,CACzC,IAAIuM,EACAY,EACJ,MAAM+G,EAAU/Q,EAAcnD,GAC9B,UACQ4M,UACJ9K,EACAoS,EACAxN,EACAvF,EACA,IAAIgI,KACkB,IAAhBA,EAAKrE,OAAcqI,EAAM,CAAEC,MAAOjE,EAAK,IACtCoD,EAAMpD,EAAK,IAElB+C,EAEJ,CAAE,MAAOa,GACPI,EAAM,CAAEC,MAAOL,EACjB,CACA,GAAII,EAEF,YADAlB,EAAKkB,EAAIC,OAGX,GAAIb,aAAe7D,WAEjB,YADAuD,OAAKjH,EAAWuH,GAGlB,GAAIrE,OAAOgM,IAAsB,IAAVA,EAAQ,GAE7B,YADAjI,OAAKjH,EAAW,IAAI0D,WAAWvH,EAAQhB,IAAIwI,YAAa4D,GAAK,GAGjE,CACAN,OAAKjH,EAAW,IAAI0D,WAAWvH,EAAQhB,IAAIwI,iBAAa3D,GAAW,GACrE,CCz6DA,SAASmP,cAAcC,GAErB,OADwBA,EAAIhD,MAAM,cACVZ,SAAS4D,EAAK,IAAMhE,GAC9C,CAaA,SAASiE,oBAAoBD,EAAaE,EAAmBC,GAC3D,MAAMC,EAAYL,cAAcC,GAChC,GAAI9D,OAAOmE,MAAMD,SAAkCxP,IAAnBuP,GAAgCA,IAAmBH,EAAItP,OACrF,MAAM,IAAIgC,YAAYwN,EAAY,KAAOF,GAE3C,OAAOI,CACT,CAUA,SAASE,qBAAqBzP,GAC5B,MAAM0P,EAAaN,oBAAoBpP,EAAM,wBAAyB,GACtE,OAAO2P,OAAOC,aAAaF,EAC7B,CAYA,SAASG,iBAAiB7P,EAAc8P,GACtC,MAAMJ,EAAaN,oBAAoBpP,EAAM,oBAAqB,GAElE,QAAsBD,IAAlB+P,EAA6B,CAC/B,MAAMC,EAAsBX,oBAAoBU,EAAe,oBAAqB,GACpF,OAAOH,OAAOC,aAAaF,EAAYK,EACzC,CAEA,OAAOJ,OAAOC,aAAaF,EAC7B,CAOA,SAASM,cAAcC,GACrB,MAA0B,MAAnBA,EAAKC,OAAO,IAA+C,MAAjCD,EAAKC,OAAOD,EAAKpQ,OAAS,EAC7D,CAUA,SAASsQ,0BAA0BC,GACjC,IAAKJ,cAAcI,GACjB,MAAM,IAAIvO,YAAY,uBAAyBuO,GAEjD,MACMV,EAAaN,oBADGgB,EAAU7P,MAAM,GAAG,GACa,qBAEtD,IACE,OAAOoP,OAAOU,cAAcX,EAC9B,CAAE,MAAOxH,GACP,MAAMA,aAAeoI,WAAa,IAAIzO,YAAY,oBAAsB6N,GAAcxH,CACxF,CACF,CAMA,MAAMqI,uBAAyB,IAAIhU,IAAoB,CACrD,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,MACN,CAAC,IAAK,QAQR,SAASiU,yBAAyBxQ,GAChC,OAAOuQ,uBAAuBhP,IAAIvB,IAASA,CAC7C,CAkBA,MAAMyQ,YACJ,yHAWI,SAAUC,MAAMC,GACpB,OAAOA,EAAIlH,QACTgH,YACA,SACEG,EACAC,EACA1B,EACAiB,EACAU,EACAC,EACAC,EACAC,EACAC,GAIA,QAAkBnR,IAAd8Q,EACF,MAAO,KAET,QAAY9Q,IAARoP,EACF,OAAOM,qBAAqBN,GAE9B,QAAkBpP,IAAdqQ,EACF,OAAOD,0BAA0BC,GAEnC,QAA6BrQ,IAAzB+Q,EACF,OAAOjB,iBAAiBiB,EAAsBC,GAEhD,QAAgBhR,IAAZiR,EACF,OAAOnB,iBAAiBmB,GAE1B,GAAc,MAAVC,EACF,MAAO,KAET,QAAclR,IAAVkR,EACF,MAAM,IAAIpP,YAAY,sBAAwBoP,GAEhD,QAAwBlR,IAApBmR,EACF,OAAOV,yBAAyBU,GAElC,MAAM,IAAIrP,YAAY,gBACxB,EAEJ,CC9KA,SAASsP,WAA2BxQ,GAKlC,MAAO,CAACA,EAAIoE,GAAIpE,EAAIlE,EAAGkE,EAAI4H,EAC7B,CAEA,MAAM6I,SAAWD,WAAiB,CAAEpM,GAAE,EAAiBtI,IAAkB8L,EAAC,IAiOpE8I,UAA+C,IAAI9U,IAEnD,MAAO+U,mBAAmB1O,MAC9B,WAAAlI,CACE6W,EACOvR,GAEPwR,MAAMD,EAAU,KAAOvR,EAAKF,UAAU,EAAG,KAFlC9E,KAAAgF,KAAAA,CAGT,EAGF,IAAIyR,SAMJ,MAAMC,aAAe,KACfC,OAAS,iBACTC,OAAS,eACTC,MAAQ,MAEDC,YAAc,CACzBC,SAAU,CACRC,MAAO,CACLC,MAAO,eACPC,OAAQ,wBACRnN,GAAI,8BACJoN,WAAY,4CACZC,aAAc,yBACdC,WAAY,iBACZC,WAAY,aACZC,UAAW,mBACXC,UAAW,aACXC,SAAU,+CACVC,kBAAmB,cAErBC,KAAM,CAAC,WAAY,QAAS,OAAQ,sBAEtCC,SAAU,CACRZ,MAAO,CACLY,SAAU,mBAEZD,KAAM,CAAC,WAETE,WAAY,CACVb,MAAO,CACLc,aAAc,qEACdjS,OAAQ,aAEV8R,KAAM,CAAC,WAAY,QAAS,OAAQ,sBAEtCI,kBAAmB,CACjBf,MAAO,CAAEe,kBAAmB,cAC5BJ,KAAM,CAAC,SAETK,QAAS,CACPhB,MAAO,CACLxO,KAAM,cACNyP,iBAAkB,aAClBC,eAAgB,YAElBP,KAAM,CAAC,WAAY,UAAW,MAAO,WAAY,WAEnDQ,SAAU,CACRnB,MAAO,CACLoB,IAAK,KACLC,QAAS,KACTC,SAAU,UACVC,SAAU,YACVC,OAAQ,mBACRC,OAAQ,oBAEVd,KAAM,CAAC,WAAY,QAAS,OAAQ,sBAEtCe,IAAK,CACH1B,MAAO,CACL2B,UAAW,aACXD,IAAK,6BAEPf,KAAM,CAAC,WAAY,aAAc,UAAW,MAAO,WAAY,WAEjE5Q,KAAM,CACJiQ,MAAO,CACLjQ,KAAM,4BAER4Q,KAAM,CAAC,WAAY,aAAc,UAAW,MAAO,WAAY,WAEjEpT,MAAO,CACLyS,MAAO,CACL4B,aAAc,MACdC,YAAa,MACbC,OACE,uIACFC,OAAQ,WACRC,QAAS,WACTrI,MAAO,uBACPsI,QAAS,yBACTC,KAAM,iBACNC,IAAK,sBACLC,oBAAqB,oDACrBC,cACE,wHACFC,eACE,wJACFC,MAAO,MACPpJ,IAAK,gBACLC,SAAU,qBACVoJ,KAAM,oBACNC,MAAO,qBACPC,IAAK,oBAEP/B,KAAM,CAAC,WAAY,UAAW,MAAO,WAAY,WAEnDgC,WAAY,CACV3C,MAAO,CACL2C,WAAY,sDACZC,OAAQ,mBACRC,MAAO,sBAETlC,KAAM,CAAC,WAAY,QAAS,OAAQ,oBAAqB,WAE3DmC,aAAc,CACZ9C,MAAO,CACL8C,aAAc,WAEhBnC,KAAM,CAAC,QAAS,SAElBoC,YAAa,CACX/C,MAAO,CACL+C,YAAa,WAEfpC,KAAM,CAAC,QAAS,SAElBqC,OAAQ,CAAEhD,MAAO,GAAIW,KAAM,IAC3BsC,YAAa,CACXjD,MAAO,CACLkD,SACE,wJAEJvC,KAAM,CAAC,UAAW,WAEpBwC,UAAW,CACTnD,MAAO,CACLoD,IAAK,wCACLC,GAAI,mDACJC,MAAO,0CACPC,WAAY,mDACZC,GAAI,yCACJC,IAAK,WACLC,MAAO,KACPC,OAAQ,4CAEVhD,KAAM,CAAC,YAILiD,SAAW,CACf,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,KAGD,SAAUC,aAAapW,EAAaqW,GACxC,IAAIzV,EAAgC,KACpC,IAAK,IAAItF,EAAI,EAAGA,EAAI+a,EAAMjW,OAAQ9E,IAAK,CAGrC,GADAsF,EADayV,EAAM/a,GACNuF,KAAKb,GACdY,EAAO,KACb,CACA,OAAOA,CACT,CAEA,MAAM0V,YAAc,IAAIvW,WAAW,IAE7BwW,aAAe,YACfC,QAAUnE,YAAYvS,MAAMyS,MAAM8B,OAClCoC,QAAU,qDACVC,UAAY,KACZC,mBAA8D,IAAIhY,QAClEiY,WAA4D,IAAIjY,iBAStDkY,UACdnb,EACAob,EACAT,EACAU,EACAC,EACAC,EACAC,EAAuB,IAEvB,IAAKJ,EAAK1W,OACR,OAAO0W,EAETI,EAAQC,MAAQD,EAAQC,OAAS,GACjC,IAAIC,GAAU,EAEd,MAAMC,GADNhB,EAAQA,GAAS,IACS1P,SAAS+P,WAC/BW,IACFhB,EAAQA,EAAMiB,OAAQta,GAAMA,IAAM0Z,YAEpC,MAAMa,EAAgBZ,mBAAmB7U,IAAIgV,EAAK7W,MAAQ,GACpDkH,EAAQyP,WAAW9U,IAAIgV,EAAK7W,MAAQ,IAAInD,IAE9C,GADA8Z,WAAWnZ,IAAIqZ,EAAK7W,IAAKkH,GACrB4P,GAAS5P,EAAM9E,IAAIyU,EAAK5W,MAAQ,GAClC,OAAO4W,EAAKzW,UAAU,EAAG8G,EAAMrF,IAAIgV,EAAK5W,MAAQ,GAAM4W,EAAK5W,OAE7D,IAII5E,EAJAkc,GAAS,EACTjQ,GAAO,EACPkQ,EAAW,GACXC,GAAa,EAEbC,GAAkB,EAClBC,GAAc,EACdC,GAAe,EACnB,IAAKvc,EAAI,EAAGA,EAAIwb,EAAK1W,SAAWmH,EAAMjM,IAAK,CACzC,IAAImF,EAAOqW,EAAKrW,KAAKnF,GACrB,GAAc,MAAVyb,GAA2B,MAAVA,GAA2B,MAAVA,EAAe,CACnD,GAAc,MAAVA,GAA0B,MAATtW,GAAqC,MAArBqW,EAAKrW,KAAKnF,EAAI,IAAekc,GAG3D,GAAI/W,IAASsW,IAAUS,EAC5B,OAAOV,EAAKzW,UAAU,EAAG/E,OAJ+C,CAExEA,GADaub,UAAUnb,EAAWob,EAAKzW,UAAU/E,EAAI,GAAI,GAAI,KACnD8E,OAAS,CACrB,CAGAoX,GAAUA,GAAmB,OAAT/W,CACtB,MAAO,GAAI0V,SAAS1V,GAAO,CACzB,IAAKkX,GAAmBJ,EAAcjc,EAAIwb,EAAK5W,OAAQ,CAErD,GADAyX,GAAkB,EACdN,EACF,MAEF/b,IACAmc,EAAW,IACX,QACF,CAIA,GAHIC,GAAuB,MAATjX,IAChBiX,GAAa,GAEXjX,IAASuW,EAAc,CACzBzP,GAAO,EACP,KACF,CAAO,CACL,MAAMuQ,EAAOjB,UAAUnb,EAAWob,EAAKzW,UAAU/E,EAAI,GAAI,GAAImF,GAI7D,GAHA0G,EAAM1J,IAAIqa,EAAK5X,MAAQ,EAAG4X,EAAK3X,KAC/B7E,GAAKwc,EAAK1X,OAAS,EACnBgX,GAAU,EACNH,EAAe,CAEjB,IAAIrW,GACCA,EAAQwV,aAFDU,EAAKzW,UAAU/E,GAEGoF,WAAYuW,MACxCC,EAAQa,OAASnX,EACjB2G,GAAO,EAEX,CACF,CACF,MAAO,GAAKwP,GA8EL,GAAItW,IAAS0V,SAASY,GAC3B,OAAOD,EAAKzW,UAAU,EAAG/E,OA/ER,CACjB,IACI0c,EACAC,EAFA7O,EAAM0N,EAAKzW,UAAU/E,GAAGoF,WAG5B,GAAIuW,EAAe,CACjB,IAAIrW,EACJ,GAAKA,EAAQwV,aAAahN,EAAK6N,GAAiB,CAC9CC,EAAQa,OAASnX,EACjBtF,IACAiM,GAAO,EACP,KACF,CACF,CACA,GAAK0Q,EAAczB,QAAQ3V,KAAKuI,IAG9B,GAFA9N,GAAK2c,EAAY,GAAG7X,OAAS,EAC7BgJ,EAAM0N,EAAKzW,UAAU/E,GAAGoF,WACpBuW,EAAe,CACjB,IAAIrW,EACJ,GAAKA,EAAQwV,aAAahN,EAAK6N,GAAiB,CAC9CC,EAAQa,OAASnX,EACjBtF,IACAiM,GAAO,EACP,KACF,CACF,OACK,GAAIkQ,GAAYhX,EAAM,CAC3B,IAAIG,EAA2C,KAC/C,GAAa,MAATH,GAAiB8W,EAAcjc,EAAIwb,EAAK5W,SAAWkX,IAAYO,EAAkB,CACnF,GAAIN,EACFzW,EAAQ,CAAC,UACJ,GAAI2W,EAAcjc,EAAIwb,EAAK5W,OAAQ,CACxCyX,GAAkB,EAClBrc,IACAmc,EAAW,IACX,QACF,CACAhX,EAAO2I,EAAM,GACf,MACEuO,GAAkB,EAEf/W,IACHA,EAAQwV,aAAahN,EAAKiN,IAExBzV,IACF2G,GAAO,IAEJA,IAASyQ,EAAYvB,QAAQ5V,KAAKuI,MACrCsO,GAAa,EACTM,EAAU,IACZJ,GAAc,EACdC,GAAe,GACND,IACLC,EACFA,GAAe,EAEfX,EAAQgB,yBAA0B,GAGlCF,EAAU,GAAG5X,OAAS,IACxB8W,EAAQC,MAAM3R,KAAKwS,EAAU,IAC7Bd,EAAQiB,YAAcH,EAAU,GAC5BA,EAAU,KACZd,EAAQkB,SAAWJ,EAAU,KAG7BA,EAAU,GAAG5X,OAAS,IACxB9E,GAAK0c,EAAU,GAAG5X,OAAS,GAGjC,CAQA,GAPIgX,IACEb,aAAa8B,KAAKjP,GACpB7B,GAAO,EAEP6P,GAAU,GAGV7P,EAAM,KACZ,CAGAkQ,EAAWhX,CACb,CACA,GAAIsW,EACF,MAAM,IAAI3U,YAAY,aAAe2U,EAAQ,KAK/C,OAHIG,IACFA,EAAQoB,SAAWZ,GAEdZ,EAAKzW,UAAU,EAAG/E,EAC3B,CACAub,UAAU3D,KAAO,CAAC,WAAY,SAAU,YAExC,MAAMqF,iBAAmB,CACvB,aACA,YACA,cACA,QACA,WACA,OACA,oBACA,UAGWC,YAAc,CAA8BjG,EAAU3T,KACjE2T,EAAM1O,QAASb,IACb4O,UAAUnU,IAAIuF,EAAMpE,MAIlB6Z,eAA6C,CACjDrE,YAAa,MACbD,aAAc,MACdW,MAAO,MACPZ,UAAW,MACXnQ,KAAM,OAGF2U,YAAc,CAClBtE,YAAW,GACXD,aAAY,GACZW,MAAK,GACLZ,UAAS,GACTnQ,KAAI,EACJzB,KAAI,EACJ,QAAO,GACP,QAAO,IAGTkW,YACE,CAAC,cAAe,eAAgB,QAAS,YAAa,QACtD,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACnC,IAAImd,EAAUtC,YACd,MAAM5R,EAAoB,GAC1B,IAAIvE,GAAM,EACN7E,EAAIuM,EAAI,GAAGzH,OACf,MAAMF,EAAQ5E,EACd,KAAOA,EAAIwb,EAAK1W,SAAWD,GACzByY,EAAU/B,UAAUnb,EAAWob,EAAKzW,UAAU/E,GAAI,CAACmd,eAAezV,GAAO,OACzE1H,GAAKsd,EAAQxY,OACTwY,EAAQ7X,OAAOX,QACjBsE,EAAIc,KAAKoT,GAEU,MAAjB9B,EAAKrW,KAAKnF,GACZ6E,GAAM,EAEN7E,IAGJ,MAAM4X,EAAO,CAAC,QAAS,WAAY,OAAQ,oBAAqB,UAChE,IAAI2F,EAEAC,EACJ,OAAQ9V,GACN,IAAK,QACL,IAAK,YACH6V,EAAIE,YAAYrd,EAAWob,EAAKzW,UAAUH,EAAO5E,IACjD,MACF,IAAK,OACL,IAAK,cAEHud,EAAInU,EAAI3H,IAAKsL,GAAM2Q,QAAQtd,EAAW2M,EAAG,IAAI6K,EAAM,iBACnD,MACF,IAAK,eACH2F,EAAInU,EAAI3H,IAAKiD,IAEX,IAAIF,EADJE,EAAMA,EAAIW,YAEV,IAAId,EAAqB,GAEzB,GADAiZ,EAAYzG,YAAYmD,YAAYjD,MAAMkD,SAAS5U,KAAK,YAAcb,GAClE8Y,EACFjZ,EAAMiZ,EAAU,GAAGnY,YACnBb,EAAQkZ,QACNtd,EACA,IAAIqE,WAAW,YAAcC,EAAIU,WAAWsJ,QAAQnK,EAAK,UAEtD,CACL,MAAM+Y,EAAU/B,UAAUnb,EAAWsE,EAAK,CAAC,OAC3CH,EAAMmZ,QAAQtd,EAAWkd,EAAS,IAAI1F,EAAM,iBAGxC1P,OAAO3D,IAAc,KAANA,EAAI,GAErBC,EAAQ6R,UAGE,IAAN9R,EAAI,KACNA,EAAOA,EAAa,IAMpBC,EAFEE,EAAII,OAASwY,EAAQxY,QAAuC,MAA7BJ,EAAIS,KAAKmY,EAAQxY,QAE1C4Y,QAAQtd,EAAWsE,EAAIK,UAAUuY,EAAQxY,OAAS,IAIlD4Y,QAAQtd,EAAWkd,EAAS1F,GAG1C,CACA,OAAOxB,WAAmB,CACxBpM,GAAE,EACFtI,EAAG6C,EACHiJ,EAAGhJ,MAKX,MAAMmZ,EACK,cAATjW,EACI6E,EAAI,GACH,GACA,EACQ,SAAT7E,EACE6E,EAAI,GACH,GACA,EACD6Q,YAAY1V,GAEpBvH,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAU/E,EAAI,GACnB+W,YAAYsG,GAAQzF,KACpBxB,WAEE,CACApM,GAAI2T,EACJjc,EAAGvB,EAAIyd,SACPpQ,EAAG+P,OAMX,MAAMM,cAAgB,CACpBvF,QAAO,GACPD,IAAG,GACHG,SAAQ,GACRD,SAAQ,GACRE,OAAM,GACNC,OAAM,IAGRwE,YACE,CAAC,UAAW,MAAO,WAAY,WAAY,SAAU,UACrD,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACnC,MAAMmd,EAAU/B,UAAUnb,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAAS,CAAC,yBAMrE,GAF8B0W,EAAKzW,UAAUuY,EAAQxY,OAASyH,EAAI,GAAGzH,QAC1BW,OAAOL,WACjCiE,WAAW,MAC1B,MAAM,IAAIvC,YACR,kIAIJ3G,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUuY,EAAQxY,OAASyH,EAAI,GAAGzH,QACvCyW,UAAU3D,KACVxB,WAAkE,CAChEpM,GAAI6T,cAAcnW,GAClBhG,EAAGvB,EAAIyd,SACPpQ,EAAGkQ,QAAQtd,EAAWkd,EAASvG,YAAYsG,GAAQzF,WAM3DsF,YAAY,CAAC,kBAA4B,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KAG5E,MAAM2d,EAAevR,EAAI,GACnB0M,EAAU7Y,EAAU0Q,SAASN,SAASsN,KACtC,CAAGC,EAAaC,GAAW/E,EAG3BgF,EAAwB,GACxBC,EAAsB,GAC5B,IAAIC,EAAa,GACbne,EAAI,EAER,KAAOA,EAAI+d,EAAYjZ,QACrB,GAAwC,OAApCiZ,EAAYhZ,UAAU/E,EAAGA,EAAI,GAAa,CAE5C,IAAIoe,EAAIpe,EAAI,EACRqe,EAAY,GACZC,GAAqB,EAGzB,KAAOF,EAAIL,EAAYjZ,QAA6B,MAAnBiZ,EAAYK,IAC3CC,GAAaN,EAAYK,GACzBA,IAIEA,EAAIL,EAAYjZ,QAA6B,MAAnBiZ,EAAYK,IAAc,QAAQrB,KAAKsB,KACnEC,GAAqB,GAGnBA,GAEFL,EAAY/T,KAAKiU,GACjBA,EAAa,GACbD,EAAYhU,KAAK8T,EAAQxN,SAAS6N,KAClCre,EAAIoe,EAAI,IAGRD,GAAcJ,EAAY/d,GAC1BA,IAEJ,MACEme,GAAcJ,EAAY/d,GAC1BA,IAGJie,EAAY/T,KAAKiU,GAGjB,MAAMI,EAAeN,EAAYxc,IAAKiD,GACpC0R,WAAwB,CACtBpM,GAAE,EACFtI,EAAC,EACD8L,EAAGoH,OAAOxU,EAAUmQ,QAAQrG,KAAKxF,GAAO,MAKtC8Z,EAAmBpI,WAAwB,CAC/CpM,GAAE,GACFtI,EAAG0U,WAAW,CACZpM,GAAE,EACFtI,EAAC,EACD8L,EAAC,IAEHA,EAAG+Q,IAILpe,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,QACtBiS,YAAYsG,GAAQzF,KACpBxB,WAAiB,CACfpM,GAAE,EACFtI,EAAGvB,EAAIyd,SACPpQ,EAAG,CAACgR,KAAqBN,QAK/B,MAAMO,eAAiB,CACrB,MAAK,GACL,MAAK,GACL,MAAK,GACL,MAAK,IAGPvB,YAAY,CAAC,qBAA+B,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KAC/E,MAAMmd,EAAU/B,UAAUnb,EAAWob,EAAKzW,UAAU,GAAI,CAAC,eACzD5E,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUuY,EAAQxY,OAAS,GAChCyW,UAAU3D,KACVxB,WAA8C,CAC5CpM,GAAIyU,eAAelS,EAAI,GAAK,KAC5B7K,EAAGgc,QAAQtd,EAAWkd,EAASvG,YAAYsG,GAAQzF,MACnDpK,EAAC,OAKP0P,YAAY,CAAC,oBAA8B,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KAC9EA,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,QACtBiS,YAAYsG,GAAQzF,KACpBxB,WAA4C,CAC1CpM,GAAIyU,eAAe,IAAMlS,EAAI,IAC7B7K,EAAGvB,EAAIyd,SACPpQ,EAAC,OAKP,MAAMkR,WAAa,CACjB,KAAI,GACJ,KAAI,GACJ,KAAI,GACJC,WAAU,GACVC,GAAE,GACF,IAAG,EACH,KAAI,GACJ,KAAI,GACJ,KAAI,GACJ,MAAK,GACL,KAAI,GACJ,KAAI,GACJ,KAAI,GACJ,KAAI,GACJ,KAAI,GACJ,OAAM,GACN,MAAK,GACL,MAAK,GACL,MAAK,GACL,MAAK,GACL,MAAK,IAGP1B,YACE,CAAC,SAAU,eAAgB,qBAC3B,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACnCA,EAAIyd,SAAWxH,WAkBb,CACApM,GAAI0U,WAAWnS,EAAI,IACnB7K,EAAGvB,EAAIyd,SACPpQ,EAAGkQ,QAAQtd,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAASiS,YAAYsG,GAAQzF,UAK/E,MAAMiH,QAAU,CACd,IAAG,GACH,IAAG,GACH,IAAG,GACH,KAAI,GACJ,KAAI,GACJ,MAAK,GACL,KAAI,GACJ,KAAI,GACJ,IAAG,GACH,IAAG,GACH,MAAK,GACL,KAAI,GACJ,MAAK,GACL,KAAI,GACJ,IAAG,GACH,IAAG,GACH,IAAG,GACH,KAAI,GACJ,IAAG,GACH,IAAG,GACH,KAAI,GACJ,KAAI,GACJF,WAAU,GACVC,GAAE,IAgHJ,SAASE,cAAc1e,EAAuBob,GAC5C,IAGIuD,EAEAC,EALAC,EAAQ,EACR3Z,EAAQkW,EAAKzW,UAAU,EAAG,GAC1Bma,EAAYlE,YAEZmE,GAAQ,EAERvD,EAAuB,CAAA,EAC3B,MACGtW,EAAQiW,UACPnb,EACAob,EAAKzW,UAAUO,EAAMT,IAAM2W,EAAK5W,OAChC,CAACgS,OAAQC,OAAQuE,gBACjBpW,OACAA,OACAA,EACA4W,IACC9W,QACHqa,GACA,CACAA,GAAQ,EACR,MAAMpU,EAAIyQ,EAAKzW,UAAUO,EAAMT,IAAM2W,EAAK5W,OAAOQ,WAEjD,GAAI2F,EAAE1B,WAAW,MACf/D,EAAMT,MACNoa,SACK,GAAIlU,EAAE1B,WAAW,QACtB0V,EAAYvD,EAAKzW,UAAU,EAAGO,EAAMT,IAAM2W,EAAK5W,OAC/CU,EAAMT,MACNoa,IACKA,GACH3Z,EAAMT,UAEH,MAAKma,EAAU,sBAAsBzZ,KAAKwF,IAO1C,CACLgU,EAAYG,EAAUpa,OAASia,EAAYvD,EAAKzW,UAAU,EAAGO,EAAMT,IAAM2W,EAAK5W,OAC9E,KACF,CATEma,EAAYvD,EAAKzW,UAAU,EAAGO,EAAMT,IAAM2W,EAAK5W,OAC/CU,EAAMT,KAAOma,EAAQ,GAAGla,OAAS,EACjCma,IACKA,IACH3Z,EAAMT,KAAOma,EAAQ,GAAGla,OAAS,EAKrC,CACA,IAAKma,EAAO,CAKVC,EAJWJ,cACT1e,EACAob,EAAKzW,UAAUO,EAAMT,IAAM2W,EAAK5W,OAAS,sBAAsBW,KAAKwF,KAAK,GAAGjG,QAAU,KAEzEsa,IACf,KACF,CACAxD,EAAU,CAAA,CACZ,CAEA,OADAmD,EAAYA,GAAavD,EAAKzW,UAAU,EAAGO,EAAMT,IAAM2W,EAAK5W,OACrD,CACLwa,IAAK5D,EAAKzW,UAAU,EAAGkL,KAAKoP,IAAIN,EAAUla,IAAKqa,EAAUra,KAAO2W,EAAK5W,OACrE0a,KAAMP,EACNQ,MAAOL,EAEX,CAxKAhC,YACE,CACE,QACA,SACA,KACA,aACA,eACA,aACA,aACA,YACA,YACA,YAEF,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACnC,MAAMyX,EAAO,CAACb,YAAYc,SAASZ,MAAMY,SAAUlB,cACnD,OAAQjP,GACN,IAAK,QAEH,MACF,IAAK,SAEHkQ,EAAK1N,KAAK6M,YAAYC,SAASC,MAAME,QACvC,IAAK,KACHS,EAAK1N,KAAK6M,YAAYC,SAASC,MAAMjN,IACvC,IAAK,aACH4N,EAAK1N,KAAK6M,YAAYC,SAASC,MAAMG,YACvC,IAAK,eACHQ,EAAK1N,KAAK6M,YAAYC,SAASC,MAAMI,cACvC,IAAK,aACHO,EAAK1N,KAAK6M,YAAYC,SAASC,MAAMK,YACvC,IAAK,aACHM,EAAK1N,KAAK6M,YAAYC,SAASC,MAAMM,YACvC,IAAK,YACHK,EAAK1N,KAAK6M,YAAYC,SAASC,MAAMO,WACvC,IAAK,YACHI,EAAK1N,KAAK6M,YAAYC,SAASC,MAAMQ,WACvC,IAAK,WACHG,EAAK1N,KAAK6M,YAAYC,SAASC,MAAMS,UAEzC,MAAM4F,EAAU/B,UAAUnb,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAAS8S,GACpEzX,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUuY,EAAQxY,OAASyH,EAAI,GAAGzH,QACvCyW,UAAU3D,KACVxB,WAyBE,CACApM,GAAI6U,QAAQtS,EAAI,IAChB7K,EAAGvB,EAAIyd,SACPpQ,EAAGkQ,QAAQtd,EAAWkd,EAASvG,YAAYsG,GAAQzF,WAM3DsF,YAAY,CAAC,YAAsB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACtE,IAAImF,GAAQ,EACZ,MAAMgY,EAAU9B,EAAKzW,UAAU,EAAG,GAClC,IAAIya,EAAa,EACjB,MAAQla,GAASgY,EAAQxY,OAAS0W,EAAK1W,QACrCwY,EAAQzY,IAAM0W,UAAUnb,EAAWob,EAAKzW,UAAUuY,EAAQxY,OAAS,GAAI,CACrEiS,YAAYc,SAASZ,MAAMY,SAC3BlB,eACC9R,IAC+B,MAA9B2W,EAAKrW,KAAKmY,EAAQxY,QACpB0a,IAEAA,IAEGA,IACHla,GAAQ,GAGZgY,EAAQ1Y,MAAQ4W,EAAK5W,MAAQ,EAC7BzE,EAAIyd,SAAWxH,WAAqB,CAClCpM,GAAE,GACFtI,EAAGvB,EAAIyd,SACPpQ,EAAG4I,WAAyB,CAC1BpM,GAAE,GACFtI,EAAG+b,YAAYrd,EAAWkd,GAC1B9P,EAAGiQ,YAAYrd,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,OAASwY,EAAQxY,OAAS,UAmEhFoY,YAAY,CAAC,MAAgB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KAChE,IAAI8R,EAAYsJ,UAAUnb,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAAS,GAAI,KACxE,MAAM2a,EAAKX,cAAc1e,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,SACpD4a,EAAYnT,EAAI,GAAGzH,OAASyH,EAAI,GAAGzH,OAASmN,EAAUnN,OAAS,EAErE,IAAI6a,EAAYF,EAAGH,KAAKva,UAAU2a,GAC9BE,EAAYH,EAAGF,MAEnBtN,EAAYA,EAAUxM,OACtBka,EAAYA,EAAUla,OACtBma,EAAYA,EAAUna,OAEI,MAAtBka,EAAUxa,KAAK,KAAYwa,EAAYA,EAAUna,MAAM,GAAG,IACpC,MAAtBoa,EAAUza,KAAK,KAAYya,EAAYA,EAAUpa,MAAM,GAAG,IAC9DrF,EAAIyd,SAAWxH,WAAe,CAC5BpM,GAAE,GACFtI,EAAG+b,YAAYrd,EAAW6R,GAC1BzE,EAAG4I,WAAmB,CACpBpM,GAAE,GACFtI,EAAGme,aAAaF,EAAWvf,GAC3BoN,EAAGqS,aAAaD,EAAWxf,SAKjC8c,YAAY,CAAC,UAAoB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACpE,MAAM4c,EAAOxB,UAAUnb,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAAS,GAAI,KACrE,IAAIF,EAAQ4W,EAAKpW,WAAW0a,QAAQ,IAAKvT,EAAI,GAAGzH,OAASiY,EAAKjY,OAAS,GACvE,IAAc,IAAVF,EAAc,MAAM,IAAIkC,YAAY,kBACxC,IAIIiZ,EAJAC,EAAYC,iBACd7f,EACAmb,UAAUnb,EAAWob,EAAKzW,UAAUH,EAAQ,GAAI,GAAI,MAGtD,MAAMsb,EAAW,0BACXC,EAAsB,GAC5B,IAAIC,GAAe,EACnB,KAAQL,EAAYG,EAAS3a,KAAKya,EAAU5a,aAAc,CACxD,GAAqB,YAAjB2a,EAAU,GAAkB,CAC9B,GAAIK,EAAc,MAAM,IAAItZ,YAAY,wCACxCsZ,GAAe,CACjB,CACA,MAAMC,EAAO9E,UAAUnb,EAAW4f,EAAUjb,UAAUgb,EAAU,GAAGjb,QAAS,CAAC,OAC7E,IAAIQ,EAAQ0V,YACRhb,EAAK4E,EAAQmb,EAAU,GAAGjb,OAASub,EAAKvb,OAAS,EACrD,MAAMwb,EAAe,SAAS/a,KAAKya,EAAUjb,UAAU/E,GAAGoF,YAC1D,IAAImb,EAAgB,GACpB,GAAID,EACFtgB,GAAKsgB,EAAa,GAAGxb,OACrBQ,EAAQiW,UAAUnb,EAAW4f,EAAUjb,UAAU/E,GAAI,GAAI,KACzDA,GAAKsF,EAAMR,OAAS,EACpByb,EAAQV,aAAava,EAAOlF,OACvB,CACL,MAAMogB,EAAWjF,UAAUnb,EAAW4f,EAAUjb,UAAU/E,GAAI,CAACkgB,IAC/D,GAAKM,EAAS/a,OAAOX,OAGd,CACL,MAAQQ,EAAQiW,UAAUnb,EAAW4f,EAAUjb,UAAU/E,GAAI,CAACob,aAAatW,SACzE9E,GAAKsF,EAAMR,QAA+C,MAArCkb,EAAU7a,KAAKnF,EAAIsF,EAAMR,QAAkB,EAAI,IAChEob,EAASnD,KAAKiD,EAAUjb,UAAU/E,GAAGoF,eAI3Cmb,EAAQV,aAAaG,EAAUjb,UAAUH,EAAOU,EAAMT,IAAMmb,EAAUpb,OAAQxE,EAChF,MAVEmgB,EAAQ,GACRvgB,GAAKwgB,EAAS1b,MAUlB,CACAkb,EAAYA,EAAUjb,UAAU/E,GAChCmgB,EAAMjW,KACJkM,WAAuB,CACrBpM,GAAE,GACFtI,EAAoB,YAAjBqe,EAAU,GAAkB,EAAiBtC,YAAYrd,EAAWigB,GACvE7S,EAAG+S,IAGT,CACApgB,EAAIyd,SAAWxH,WAAmB,CAChCpM,GAAE,GACFtI,EAAG+b,YAAYrd,EAAW2c,GAC1BvP,EAAG2S,MAIPjD,YAAY,CAAC,MAAO,QAAkB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACzE,IAAI6G,EAAOuF,EAAI,GACXkU,EAAQlU,EAAI,GAAGzH,OACfkF,EAAK,OACT,GAAa,QAATtC,EAAgB,CACd6E,EAAI,KACNvC,EAAK,SAEP,MAAM0W,EAAUlF,EAAKzW,UAAUwH,EAAI,GAAGzH,QAAQM,WAAWgM,MAAM2F,YAAY/P,KAAKiQ,MAAMjQ,MACtF,IAAI0Z,IAAWA,EAAQ5b,OAIrB,MAAM,IAAIgC,YAAY,eAHtBE,EAAO0Z,EAAQ,GACfD,EAAQzZ,EAAKlC,OAASyH,EAAI,GAAGzH,MAIjC,MACE,GAAIiB,cAAcgB,IAAIC,IAAkB,SAATA,EAC7B,MAAM,IAAIF,YAAY,qBAAqBE,MAG/C7G,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAU0b,GACf1J,YAAYsG,GAAQzF,KACpBxB,WAAgC,CAC9BpM,GAAIoT,YAAYpT,GAChBtI,EAAGvB,EAAIyd,SACPpQ,EAAGxG,OAKTkW,YAAY,CAAC,cAAe,gBAA0B,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACzFA,EAAIyd,SAAWxH,WAAuC,CACpDpM,GAAa,gBAATtC,EAAwB,GAAuB,GACnDhG,EAAC,EACD8L,EAAGkQ,QAAQtd,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAASiS,YAAYsG,GAAQzF,UAI7EsF,YAAY,CAAC,SAAU,SAAmB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KAC7EA,EAAIyd,SAAWxH,WAA2B,CACxCpM,GAAa,WAATtC,EAAmB,EAAkB,GACzChG,EAAC,EACD8L,EAAGiQ,YAAYrd,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,aAIpDoY,YACE,CAAC,SAAU,UAAW,OAAQ,MAAO,MAAO,YAC5C,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACnCA,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,QACtBiS,YAAYsG,GAAQzF,KACpBxB,WAA2C,CACzCpM,GACW,WAATtC,EAAqB6E,EAAI,IAAK,KAAqC,GACrE7K,EAAC,EACD8L,EAAGjB,EAAI,IAAMA,EAAI,GAAKA,EAAI,QAMlC2Q,YAAY,CAAC,SAAU,UAAW,SAAmB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACxFA,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,QACtBiS,YAAYsG,GAAQzF,KACpBxB,WAAoD,CAClDpM,GACW,WAATtC,EACG,EACU,YAATA,EACC,GACA,GACPhG,EAAC,EACD8L,EAAGjB,EAAI,QAKb2Q,YAAY,CAAC,cAAwB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACxE,MAAMwgB,EAAgB,QAAXpU,EAAI,GAAc,GAA2B,QAAXA,EAAI,GAAc,EAAe,EACzEA,EAAI,GAYPpM,EAAIyd,SAAWxH,WAA8B,CAC3CpM,GAAI2W,EACJjf,EAAG6K,EAAI,GACPiB,EAAGkQ,QAAQtd,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAASiS,YAAYsG,GAAQzF,QAd3EzX,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,QACtBiS,YAAYsG,GAAQzF,KACpBxB,WAA8B,CAC5BpM,GAAI2W,EACJjf,EAAG6K,EAAI,GACPiB,EAAC,OAYT0P,YACE,CAAC,WAAY,iBAAkB,gBAAiB,uBAChD,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACnC,MAAMygB,EAAmB,aAATlZ,GAAgC,mBAATA,EACjCmZ,EAAWD,IAAYrU,EAAIA,EAAIzH,OAAS,GACxCgc,EAASF,EAAU,EAAI,EACvBjP,EAAUpF,EAAI,GAAI,GAAgB,EAClCpD,EAAiBoD,EAAIuU,GAAUvU,EAAIuU,GAAQpS,QAAQ,OAAQ,IAAIqS,MAAM,MAAQ,GAC9EH,GACHzX,EAAKkB,SAASkC,EAAI,IAAM,IAAIlH,aAE9B,IAAI2b,GAAQ,EACZ7X,EAAKZ,QAASa,IACZ,GAAI4X,EAAO,MAAM,IAAIla,YAAY,gDAC7BsC,EAAIC,WAAW,SAAQ2X,GAAQ,KAErC,MAAMjW,EAAIwQ,UACRnb,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,QACrB+b,EAAoB,CAAC,WAAYzF,WAAtB,CAAC,OAET5X,EAAOqd,EAAW,UAAY9V,EAAIA,EAAE3F,WAC1C+D,EAAKZ,QAASa,IACZ,GAAIrD,cAAcgB,IAAIqC,EAAIsF,QAAQ,UAAW,KAC3C,MAAM,IAAI5H,YAAY,qBAAqBsC,QAG/CjJ,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,OAAStB,EAAKsB,OAAS,GAC7CiS,YAAYsG,GAAQzF,KACpBxB,WAAsD,CACpDpM,GAAI4W,EACD,GACU,aAATlZ,EACC,GACA,GACLhG,EAAG,CAACiQ,KAAYxI,GAChBqE,EAAGpN,EAAU6gB,MAAQvP,gBAAgB,IAAIjN,WAAWjB,GAAOpD,GAAaoD,OAMhF,MAAM0d,cAAgB,wEACtBhE,YAAY,CAAC,MAAO,KAAM,SAAmB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KAChF,IAMI8R,EAEAkP,EARAnhB,EAAI,EACJ+R,KACAF,EAAwB,GACxBC,IACAI,IACAN,KAEAI,KAEJ,OAAQtK,GACN,IAAK,QAAS,CACZ1H,EAAIwb,EAAKpW,WAAW0a,QAAQ,KAAO,EACnC,MAAMxC,EAAU/B,UAAUnb,EAAWob,EAAKzW,UAAU/E,GAAI,GAAI,KAC5DiS,EAAYmP,kBAAkBhhB,EAAWkd,GACzC6D,EAAO5F,UAAUnb,EAAWob,EAAKzW,UAAU/E,EAAIsd,EAAQxY,OAAS,IAAIW,OAC/C,MAAjB0b,EAAKhc,KAAK,KAAYgc,EAAOA,EAAK3b,MAAM,GAAG,IAC/C,KACF,CACA,IAAK,MAAO,CACVxF,EAAIwb,EAAKpW,WAAW0a,QAAQ,KAAO,EACnC,MAAM3W,EAAqB,GAC3B,IAOI9G,EAPAgf,EAAWrG,YACf,IAAK,IAAIsG,EAAI,EAAGA,EAAI,IAClBD,EAAW9F,UAAUnb,EAAWob,EAAKzW,UAAU/E,GAAI,CAAC,UACpDmJ,EAAKe,KAAKmX,EAAS5b,QACnBzF,GAAKqhB,EAASvc,OAAS,EACE,MAArB0W,EAAKrW,KAAKnF,EAAI,IAJGshB,KAOvB,GAAoB,IAAhBnY,EAAKrE,SAAiBzC,EAAW6e,cAAc3b,KAAK4D,EAAK,GAAG/D,aAC1C,OAAhB/C,EAAS,IACTyP,EAAcsP,kBAAkBhhB,EAAW+I,EAAK,GAAGpE,UAAU1C,EAAS,GAAGyC,SACxE+M,EAAgB,CAAC0P,SAAUC,UAC9BvP,EAAYwP,YACZzP,EAAO0P,OACPxP,EAAawL,QACXtd,EACA,IAAIqE,YAAYpC,EAAS,IAAM,QAAUA,EAAS,GAAK,mBACvD,CAAC,iBAGDyP,EAAcsP,kBAAkBhhB,EAAW+I,EAAK,GAAGpE,UAAU1C,EAAS,GAAGyC,SACxE+M,EAAgB,CAAC8P,SAAUC,UAC9B5P,EAAO6P,OACP5P,EAAY6P,YACZ5P,EAAawL,QACXtd,EACA,IAAIqE,YAAYpC,EAAS,IAAM,QAAUA,EAAS,GAAK,yBACvD,CAAC,oBAGA,IAAoB,IAAhB8G,EAAKrE,OAKd,MAAM,IAAIgC,YAAY,+BAJtBiL,EAAY0L,YAAYrd,EAAW+I,EAAKiB,QAAU6S,kBAClDhL,EAAYmP,kBAAkBhhB,EAAW+I,EAAKiB,SAC9C4H,EAAOyL,YAAYrd,EAAW+I,EAAKiB,QAGrC,CACA+W,EAAO5F,UAAUnb,EAAWob,EAAKzW,UAAU/E,IAAIyF,OAC1B,MAAjB0b,EAAKhc,KAAK,KAAYgc,EAAOA,EAAK3b,MAAM,GAAG,IAE/C,KACF,CACA,IAAK,KAAM,CACToM,IACA,MAAMmQ,IAAYxV,EAAI,GACtB4U,EAAO5F,UAAUnb,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAASid,EAAU,CAAC,OAAS,CAAC3G,YAChFnJ,EAAYmP,kBACVhhB,EACAmb,UACEnb,EACAob,EAAKzW,UAAUyW,EAAKpW,WAAW0a,QAAQ,IAAKvT,EAAI,GAAGzH,OAASqc,EAAKrc,QAAU,GAC3E,GACA,MAGJ,KACF,EAEF,MAAMpD,EAAI,CACRkQ,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEF/R,EAAIyd,SAAWxH,WAAiB,CAC9BpM,GAAE,GACFtI,IACA8L,EAAGqS,aAAasB,EAAM/gB,OAI1B8c,YAAY,CAAC,SAAmB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACnEA,EAAIyd,SAAWxH,WAAkB,CAC/BpM,GAAE,GACFtI,EAAGme,aAAatE,UAAUnb,EAAWob,EAAKzW,UAAU,GAAI,GAAI,KAAM3E,GAClEoN,EAAC,MAIL0P,YAAY,CAAC,cAAwB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACxEA,EAAIyd,SAAWxH,WAAuB,CACpCpM,GAAE,GACFtI,EAAG6K,EAAI,GACPiB,EAAC,MAIL,MAAMwU,SAAW,oEACjB9E,YAAY,CAAC,OAAiB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACjE,MAAMghB,EAAO5F,UAAUnb,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAAS,GAAI,KACrE,IACIgO,EAEAD,EAHAoP,EAAWD,SAASzc,KAAKiW,EAAKzW,UAAUwH,EAAI,GAAGzH,OAASqc,EAAKrc,OAAS,GAAGM,YAEzEwN,EAAY,GAEZsP,EAAS,EACTD,EAAU,GAAG5Y,WAAW,UAC1B4Y,EAAWD,SAASzc,KAAKiW,EAAKzW,UAAUwH,EAAI,GAAGzH,OAASqc,EAAKrc,OAAS,GAAGM,YACzEwN,EAAYqP,EAAU,IAAM,GAC5BpP,EAAY0I,UACVnb,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,OAASqc,EAAKrc,OAAS,EAAImd,EAAU,GAAGnd,QAC9D,GACA,KAEFod,EAAS3V,EAAI,GAAGzH,OAASqc,EAAKrc,OAAS,EAAImd,EAAU,GAAGnd,OAAS+N,EAAU/N,OAAS,GAEjFmd,EAAWD,SAASzc,KAAKiW,EAAKzW,UAAUmd,GAAQ9c,cACjD6c,EAAS,GAAG5Y,WAAW,aAEvByJ,EAAcyI,UAAUnb,EAAWob,EAAKzW,UAAUmd,EAASD,EAAS,GAAGnd,QAAS,GAAI,OAGtFgO,EAAcyI,UACZnb,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,OAASqc,EAAKrc,OAAS,EAAImd,EAAU,GAAGnd,QAC9D,GACA,KAGJ,MAAM0I,EAAI,CACRoF,EACAiN,aAAaI,iBAAiB7f,EAAWyS,GAAamI,aAAc5a,GACpEyf,aAAaI,iBAAiB7f,EAAW0S,GAAekI,aAAc5a,IAExED,EAAIyd,SAAWxH,WAAgB,CAC7BpM,GAAE,GACFtI,EAAGme,aAAaI,iBAAiB7f,EAAW+gB,GAAO/gB,GACnDoN,QAIJ0P,YAAY,CAAC,OAAQ,SAAmB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KAC3E,MAAMmd,EAAU/B,UAAUnb,EAAWob,EAAKzW,UAAUwH,EAAI,GAAGzH,QAAS,CAAC,yBACrE3E,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAUwH,EAAI,GAAGzH,OAASwY,EAAQxY,QACvCiS,YAAYsG,GAAQzF,KACpBxB,WAAyB,CACvBpM,GAAa,SAATtC,EAAiB,GAAgB,GACrChG,EAAGgc,QAAQtd,EAAWkd,GACtB9P,EAAC,OAKP0P,YAAY,CAAC,OAAiB,CAAC9c,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,KACjE,IAAIH,EAAIuM,EAAI,GAAGzH,OACf,MAAMc,EAAM2V,UAAUnb,EAAWob,EAAKzW,UAAU/E,GAAI,QAAIgF,EAAW,KACnEhF,GAAK4F,EAAId,OAAS,EAClB,MAAMqE,EAAqB,GAC3B,GAAyB,MAArBqS,EAAKrW,KAAKnF,EAAI,GAAY,CAC5B,MAAMmiB,EAAa5G,UAAUnb,EAAWob,EAAKzW,UAAU/E,GAAI,GAAI,KAE/D,IAAIsF,EADJtF,GAAKmiB,EAAWrd,OAAS,EAEzB,IAAIsZ,EAAI,EACR,MAAQ9Y,EAAQiW,UAAUnb,EAAW+hB,EAAWpd,UAAUqZ,GAAI,CAAC,QAAQtZ,QACrEsZ,GAAK9Y,EAAMR,OAAS,EACpBqE,EAAKe,KAAK5E,EAAMG,OAEpB,CACAtF,EAAIyd,SAAWF,QACbtd,EACAob,EAAKzW,UAAU/E,GACf+W,YAAYkB,QAAQL,KACpBxB,WAAW,CACTpM,GAAE,GACFtI,EAAGgc,QAAQtd,EAAWwF,EAAKmR,YAAY6C,WAAWhC,MAClDpK,EAAGrE,EAAK1H,IAAK2H,GAAQsU,QAAQtd,EAAWgJ,EAAK2N,YAAY6C,WAAWhC,YAK1E,MAAM2J,SAAW7D,aACf1Y,EACA,IAAIP,WAAW,6CACf,CAAC,eAEG+c,SAAW9D,aAAQ1Y,EAAkB,IAAIP,WAAW,kCAAmC,CAC3F,eAEIgd,YAAc/D,aAAQ1Y,EAAkB,IAAIP,WAAW,uBAAwB,CACnF,eAEIid,OAAShE,aAAQ1Y,EAAkB,IAAIP,WAAW,+BAClDkd,SAAWjE,aAAQ1Y,EAAkB,IAAIP,WAAW,mCAAoC,CAC5F,eAEImd,SAAWlE,aAAQ1Y,EAAkB,IAAIP,WAAW,sBAAuB,CAAC,eAC5Eod,OAASnE,aAAQ1Y,EAAkB,IAAIP,WAAW,iBAClDqd,YAAcpE,aAAQ1Y,EAAkB,IAAIP,WAAW,qCAAsC,CACjG,eAGF,SAASiZ,QACPtd,EACAob,EACA4G,EACAxE,EACAyE,GAAW,GAIX,GAFAzE,EAAWA,GAAYvH,SACvB+L,EAAWA,GAAYrL,YAAY6C,WAAWhC,UACjC5S,IAATwW,EAAoB,OAAOoC,EAG/B,MAAMlZ,GADN8W,EAAOA,EAAKnW,aACKD,WACjB,IAAKoW,EAAK1W,SAAWsd,EAAS/W,SAAS,UACrC,MAAM,IAAIvE,YAAY,gCAExB,IAAK0U,EAAK1W,OAAQ,OAAO8Y,EAEzB,MAAMzd,EAAM,CAAEyd,SAAUA,GAExB,IAAIrR,EACJ,IAAK,MAAM8Q,KAAU+E,EACnB,GAAe,WAAX/E,EAAJ,CAGA,IAAK,MAAM3V,KAAQqP,YAAYsG,GAAQpG,MACrC,GAAa,WAATvP,IAGC6E,EAAMwK,YAAYsG,GAAQpG,MAAMvP,GAAMnC,KAAKb,IAAO,CACrDgS,SAAWhP,EAKX,IACE4O,UAAU9P,IAAIkB,EAAd4O,GAAsBlW,EAAWsH,EAAM8T,EAAMjP,EAAK8Q,EAAQld,EAC5D,CAAE,MAAO4M,GACP,GAAIsV,GAAYtV,aAAajG,YAC3B,MAAM,IAAIyP,WAAWxJ,EAAEyJ,QAAS9R,GAElC,MAAMqI,CACR,CACA,KACF,CAEF,GAAIR,EAAK,KAtBT,CAyBF,IAAKA,GAAOiP,EAAK1W,OAAQ,CACvB,GAAIud,EACF,MAAM,IAAI9L,WAAW,0BAA0BG,aAAa8E,EAAKrW,KAAK,KAAMT,GAE9E,MAAM,IAAIoC,YAAY,0BAA0B4P,aAAa8E,EAAKrW,KAAK,KACzE,CACA,OAAOhF,EAAIyd,QACb,CAEA,MAAM0E,8BAAgCrF,iBAAiBjB,OAAQuG,GAAY,cAANA,GAErE,SAAS9E,YAAYrd,EAAuBsE,EAAiB0d,GAC3D,IAAK1d,EAAIW,YAAYP,OAAQ,OAAOuR,SACpC,MAAMmM,EAA+B,GACrC,IAAI1U,EACA2U,EAAM,EAEV,IADAL,EAAWA,GAAYrL,YAAY6C,WAAWhC,MACjCvM,SAAS,cAChByP,aAAapW,EAAIU,WAAY5F,OAAO8B,OAAOyV,YAAYqD,UAAUnD,QACnE,OAAOyG,QAAQtd,EAAWsE,EAAK,CAAC,kBAAcM,GAAW,GAI7D,IADIod,IAAanF,mBAAkBmF,EAAWE,gCACtCxU,EAAMyN,UAAUnb,EAAWsE,EAAIK,UAAU0d,GAAM,CAAC,QAAQ3d,QAC9D0d,EAAetY,KAAK4D,EAAIzI,aACxBod,GAAO3U,EAAIhJ,OAAS,EAEtB,GAA8B,IAA1B0d,EAAe1d,OACjB,OAAO4Y,QAAQtd,EAAWsE,EAAK0d,OAAUpd,GAAW,GAEtD,GAAIod,EAAS/W,SAAS,cAAe,CACnC,MAAMqX,EAAU3L,YAAY6C,WAAW3C,MAAM2C,WAAWrU,KAAKid,EAAe,GAAGpd,YAC/E,GAAIsd,EACF,OAAOtM,WAAkB,CACvBpM,GAAE,GACFtI,EAAG8gB,EAAe/gB,IAAI,CAACiD,EAAK1E,IAC1B0d,QACEtd,EACAJ,EAAI,IAAIyE,WAAWie,EAAS,GAAK,IAAMhe,GAAOA,EAC9C,CAAC,mBACDM,GACA,IAGJwI,EAAC,IAEE,GAAIuJ,YAAY6C,WAAW3C,MAAM4C,OAAOtU,KAAKid,EAAe,GAAGpd,YACpE,OAAOsY,QAAQtd,EAAWsE,EAAK0d,OAAUpd,GAAW,EAExD,CACA,MAAMub,EAAQiC,EAAe/gB,IAAKiD,GAAQgZ,QAAQtd,EAAWsE,EAAK0d,OAAUpd,GAAW,IACvF,OAAOoR,WAAuB,CAAEpM,MAAyBtI,EAAG6e,EAAO/S,EAAC,GACtE,CAEM,SAAU4T,kBAAkBhhB,EAAuBsE,GACvD,OAAO0R,WAAmB,CACxBpM,GAAE,EACFtI,EAAC,EACD8L,EAAGiQ,YAAYrd,EAAWsE,IAE9B,CAEM,SAAUmb,aAAanb,EAAiBtE,EAAuBuiB,GAAa,GAEhF,KADAje,EAAMub,iBAAiB7f,EAAWsE,IACzBe,OAAOX,OAAQ,MAAO,GAC/B,MAAM8d,EAAsB,GAC5B,IAAIpH,EACAiH,EAAM,EACN7d,EAAQ,EACRgX,EAAuB,CAAA,EACvBiH,GAAU,EACVC,GAAa,EACjB,MACGtH,EAAOD,UACNnb,EACAsE,EAAIK,UAAU0d,GACd,CAACrH,gBACDpW,OACAA,OACAA,EACA4W,IACC9W,SAEHge,KAAgBpe,EAAIS,KAAKsd,EAAMjH,EAAK1W,SAA2C,MAAhCJ,EAAIS,KAAKsd,EAAMjH,EAAK1W,SACnE2d,GAAOjH,EAAK1W,QAAUge,EAAa,EAAI,GACnC,oBAAoB/F,KAAKrY,EAAIK,UAAU0d,GAAKrd,aAG9CwW,EAAe,OAAGvQ,SAAS,OAC3B,qBAAqB0R,KAAKrY,EAAIK,UAAU0d,GAAKrd,YAH7Cyd,GAAU,GAOVA,GAAU,EACVD,EAAM1Y,KAAKxF,EAAIK,UAAUH,EAAO6d,GAAOK,EAAa,EAAI,KACxDle,EAAQ6d,GAEV7G,EAAU,CAAA,GACN+G,KAKN,OAHIE,GACFD,EAAM1Y,KAAKxF,EAAIK,UAAUH,EAAO6d,GAAOK,EAAa,EAAI,KAEnDF,EACJnhB,IAAKiD,GAAQA,EAAIW,aACjB2W,OAAQtX,GAAQA,EAAII,QACpBrD,IAAKiD,GACG+Y,YAAYrd,EAAWsE,EAAIW,YAAa4X,kBAErD,CAEM,SAAUvL,gBACdhN,EACAtE,EACAuiB,GAAa,GAEb,IAAKje,EAAIe,OAAOX,OAAQ,MAAO,GAC/B,MAAMzE,EAAOwf,aAAanb,EAAKtE,EAAWuiB,GAE1C,OADAI,MAAM1iB,GACCA,CACT,CAEA,SAAS0iB,MAAM5a,EAAgBoE,EAAc,IAC3C,GAAIrE,OAAOC,GAAO,CAChB,IAAKD,OAAmBC,GAAO,OAAO,EACtC,MAAO6B,EAAItI,EAAG8L,GAAKrF,EACnB,GACI,KAAF6B,GACE,KAAFA,GACE,KAAFA,GACE,KAAFA,EAEA+Y,MAAMrhB,EAAG6K,GACTwW,MAAMvV,EAAGjB,QACJ,GAAM,KAAFvC,EACTuC,EAAIrC,KAAKkM,WAAW,CAAEpM,GAAE,GAAgBtI,EAAGA,EAAG8L,YACzC,QAAIxD,GAA4BtI,EAAE,GAEvC,OADA6K,EAAIrC,KAAK/B,IACF,CAEX,MAAO,GAAIC,MAAMC,QAAQF,GAAO,CAC9B,MAAM6a,EAAwB,GAC9B,IAAK,MAAMC,KAAM9a,EACV4a,MAAME,EAAI1W,IACbyW,EAAI9Y,KAAK+Y,GAGTD,EAAIle,SAAWqD,EAAKrD,SACtBqD,EAAKrD,OAAS,EACdqD,EAAK+B,QAAQqC,KAAQyW,GAEzB,CACA,OAAO,CACT,CAEA,MAAME,oBAAsB,yDAEtBC,YAAc,2EAgBd,SAAUlD,iBAAiB7f,EAAuBsE,GACtD,IAAI0e,EAAO1e,EACPoJ,EAAMkN,YACNY,EAAuB,CAAA,EACvByH,GAAiB,EACrB,MAAMC,EAAWjI,mBAAmB7U,IAAI9B,EAAIC,MAAQ,IAAIyD,MAAM1D,EAAIC,IAAID,IAAII,QAC1E,MACGgJ,EAAMyN,UAAUnb,EAAWgjB,EAAM,QAAIpe,OAAWA,EAAW,CAACme,aAAcvH,IAAU9W,QACrF,CACA,IAAIye,GAAQ,EACR/H,EAAO1N,EACP0V,EAAO1V,EAAIhJ,OACf,GAAI8W,EAAQa,OAAQ,CAClB8G,GAAQ,EACR,QAAW7hB,EAAC,CAAA,CAAM8L,GAAKoO,EAAQa,OAG/B,GAFA+G,EAA6B,OAAtB5H,EAAQa,OAAO,IAAqC,OAAtBb,EAAQa,OAAO,GAAc3O,EAAIhJ,OAAS,EAAIgJ,EAAIhJ,OACvF0W,EAAO4H,EAAKre,UAAU,EAAGye,GACrBhW,EAAG,CACL,MAAMjB,EAAM2W,oBAAoB3d,KAAK6d,EAAKre,UAAU+I,EAAIhJ,OAAS,GAAGM,YAChEmH,EACa,UAAXA,EAAI,GACmB,OAArBqP,EAAQkB,UACVyG,GAAQ,EACRF,GAAiB,GAEjBE,GAAQ,EAGVA,GAAQ,EAGW,aAArB3H,EAAQkB,UACiB,MAAzBlB,EAAQa,OAAO,GAAG,IACc,MAAhCb,EAAQa,OAAO,GAAGjX,OAAM,KAExB+d,GAAQ,EAEZ,MAAW7hB,IACL2hB,GAAuC,UAArBzH,EAAQkB,UAC5ByG,GAAQ,EACRF,GAAiB,GAEI,OAArBzH,EAAQkB,UACa,UAArBlB,EAAQkB,UACa,QAArBlB,EAAQkB,UACa,SAArBlB,EAAQkB,WAERyG,IAAU3H,EAAQgB,yBAGxB,CACI2G,IACFD,EAAS9H,EAAK3W,MAAO,GAEvBue,EAAOA,EAAKre,UAAUye,GACtB5H,EAAU,CAAA,CACZ,CAEA,OADAP,mBAAmBlZ,IAAIuC,EAAIC,IAAK2e,GACzB5e,CACT,CAEM,SAAU+e,WAAW/e,GACzB,IAAI1E,EAAI,EACJkc,GAAS,EACTjQ,GAAO,EACPyX,GAAS,EACb,KAAO1jB,EAAI0E,EAAII,SAAWmH,IAASyX,GACjCzX,EAAkB,MAAXvH,EAAI1E,KAAekc,EAC1BA,EAAoB,OAAXxX,EAAI1E,KAAgBkc,EAC7BwH,EAAoB,OAAXhf,EAAI1E,GACbA,IAEF,MAAM2jB,EAAQjf,EAAIK,UAAU/E,GAE5B,GADA0jB,EAASA,IAAWzX,GAAQ,SAAS8Q,KAAK4G,GACtCD,EAAQ,OAAO,KACnB,MAAM7S,EAAQ,UAAUtL,KAAKoe,GAC7B,MAAI,YAAY5G,KAAKrY,EAAIK,UAAU/E,EAAI6Q,EAAO,GAAG/L,SACxC,KAEF,CACL8L,MAAOlM,EAAIK,UAAU,EAAG/E,EAAI,GAC5B6Q,MAAQA,GAASA,EAAM,IAAO,GAC9B/L,OAAQ9E,GAAM6Q,GAASA,EAAM,GAAG/L,QAAW,GAE/C,CAEA,MAAM8e,UAAY,gEACZC,eAAiB,2BACjB,SAAUC,iBACd1jB,EACAsE,EACAqf,EAAmB,IAEnB,IAAItI,EAGAuI,EAFA1G,EAA+B,GAC/BpB,GAAS,EAET+H,EAAU,GACVC,GAAe,EACfC,EAAmB,GACnBhf,EAAO,GACX,MAAMif,EAA8B,GAC9BC,EAAuB,GAC7B,IAAIC,EAA2C,KAC3CtkB,EAAI,EACR,IAAKA,EAAI,EAAGA,EAAI0E,EAAII,OAAQ9E,IAE1B,GADAmF,EAAOT,EAAI1E,GACPikB,EACE9e,IAAS8e,IACK,MAAZA,GAAkC,MAAfvf,EAAI1E,EAAI,IAC7BikB,EAAU,GACVjkB,KACqB,OAAZikB,IACTA,EAAU,GACVG,EAAOla,KAAK,YAGX,CACL,GAAIgS,EAAQ,CACVA,GAAS,EACToB,EAAQpT,KAAK/E,GACb,QACF,CAEA,GAAIsW,EACF,GAAc,MAAVA,GAA0B,MAATtW,GAA+B,MAAfT,EAAI1E,EAAI,GAAY,CACvD,MAAMwc,EAAOsH,iBAAiB1jB,EAAWsE,EAAIK,UAAU/E,EAAI,GAAI,KAC/DmkB,EAAOja,KAAKsS,EAAK9X,KACjB4Y,EAAQpT,KAAK,KAAMia,EAAOrf,OAAS,EAAG,KACtC9E,GAAKwc,EAAK1X,OAAS,CACrB,MAAO,GAAI2W,IAAUtW,EAAM,CACzB,GAAc,MAAVsW,EAAe,CACjB,MAAM8I,EAAKnO,WAAoB,CAC7BpM,GAAE,GACFtI,EAAGiU,MAAM2H,EAAQkH,KAAK,KACtBhX,EAAG,KAEL+W,EAAGE,cAAgBN,EACnB/jB,EAAU0Q,SAAS5G,KAAKqa,GACxBH,EAAOla,KAAK,IAAM9J,EAAU0Q,SAAShM,OAAS,EAAG,IACnD,MACE1E,EAAUmQ,QAAQrG,KAAKyL,MAAM2H,EAAQkH,KAAK,MAC1CJ,EAAOla,KAAK,IAAK9J,EAAUmQ,QAAQzL,OAAS,EAAG,KAEjD2W,EAAQ,KACR6B,EAAU,EACZ,MACEA,EAAQpT,KAAK/E,OAEV,CACL,GAAa,MAATA,GAAyB,MAATA,GAAyB,MAATA,EAClCgf,EAAS,GACT1I,EAAQtW,MACH,IAAI0V,SAASkJ,KAAsB5e,IAASkf,EAAWvf,OAC5D,MAAO,CAAEJ,IAAK0f,EAAOI,KAAK,IAAK1f,OAAQ9E,GAC9B6a,SAAS1V,IAClBkf,EAAWna,KAAK/E,GAChBif,EAAOla,KAAK/E,IACH0V,SAASwJ,EAAWA,EAAWvf,OAAS,MAAQK,GACzDkf,EAAWla,MACXia,EAAOla,KAAK/E,IACM,MAATA,GAAgC,MAAfT,EAAI1E,EAAI,IAA6B,MAAf0E,EAAI1E,EAAI,GAI/C,MAATmF,IACCmf,IACAN,EAAaP,WAAW/e,EAAIK,UAAU/E,MAEvCI,EAAUsQ,QAAQxG,KAAK8Z,GACvBI,EAAOla,KAAK,IAAK9J,EAAUsQ,QAAQ5L,OAAS,EAAG,MAC/C9E,GAAKgkB,EAAWlf,OAAS,GAEzBsf,EAAOla,KAAK/E,IAXZ8e,EAAyB,MAAfvf,EAAI1E,EAAI,GAAa,IAAM,KACrCkkB,EAAelkB,EAWjB,CAEKskB,GAAqBxN,MAAMiG,KAAK5X,KAC9Bmf,EAAmBT,eAAete,KAAKb,EAAIK,UAAU/E,MACpD4jB,UAAU7G,KAAKrY,EAAIK,UAAU,EAAG/E,EAAIskB,EAAiB,GAAGxf,WAC1Dwf,EAAmB,KAI3B,CACApI,KAAYT,GAAkB,OAATtW,EACvB,CAGF,GAAI8e,GACc,MAAZA,EACF,MAAM,IAAInd,YAAY,0BAA0BpC,EAAIK,UAAUmf,MAGlE,MAAO,CAAExf,IAAK0f,EAAOI,KAAK,IAAK1f,OAAQ9E,EACzC,CAEc,SAAU0kB,MAAMzf,EAAcgc,GAAQ,EAAO0B,GAAa,GACtE,GAAoB,iBAAT1d,EAAmB,MAAM,IAAIsR,WAAW,gBAAgBtR,IAAQA,GAC3E,IAAIP,EAAM,IAAMO,EAChB,MAAM7E,EAAwB,CAAEmQ,QAAS,GAAIO,SAAU,GAAIJ,QAAS,GAAIuQ,SACxEvc,EAAMof,iBAAiB1jB,EAAWsE,GAAKA,IAEvC,IAAK,MAAM6Y,KAAKnd,EAAU0Q,SACxByM,EAAE,GAAKA,EAAEkH,cAAehjB,IAAKsP,GAAe0M,YAAYrd,EAAW,IAAIqE,WAAWsM,YAC3EwM,EAAEkH,cAEX,MAAO,CAAEpkB,KAAMqR,gBAAgB,IAAIjN,WAAWC,GAAMtE,EAAWuiB,GAAaviB,YAC9E,UCp9DgBukB,oBACd,MAAO,CACLlhB,gCACAE,0CACAG,4BACAE,wCACAE,0CACAE,4CACAE,8CACAoN,gCAEJ,CAEA,SAASkT,KAAM,CACT,SAAUnhB,gBAAgBtC,GAE9B,OADA0jB,gBAAgBljB,UAAYijB,GAAGjjB,UACxBkjB,gBACP,SAASA,mBAAmBlX,GAC1B,MACMpE,EAASmb,MADF/W,EAAOxD,OAAS,IAE7B,OAAOb,eACLqE,EACApE,EAAOlJ,KACPc,EAAQhB,IAAI2B,MACZ,IACKX,EACHf,UAAWmJ,EAAOnJ,UAClBC,KAAMkJ,EAAOlJ,WAEf2E,EACA,YAEJ,CACF,CAGA,SAAS8f,MAAO,CACV,SAAUnhB,qBAAqBxC,GAEnC,OADA4jB,EAAqBpjB,UAAYmjB,IAAInjB,UAC9BojB,EACP,SAASA,KAAwBpX,GAC/B,MACMpE,EAASmb,MADF/W,EAAOxD,OAAS,IAE7B,OAAOP,oBACL+D,EACApE,EAAOlJ,KACPc,EAAQhB,IAAI2B,MACZ,IACKX,EACHf,UAAWmJ,EAAOnJ,UAClBC,KAAMkJ,EAAOlJ,WAEf2E,EACA,YAEJ,CACF,CAEA,SAASggB,KAAM,CACT,SAAUlhB,cAAcN,EAAuBrC,GAEnD,OADA8jB,EAAYtjB,UAAYqjB,GAAGrjB,UACpBsjB,EACP,SAASA,EAAYhgB,GAEnB,MAAMsE,EAASmb,MAAMzf,GACf5E,EAAO6kB,0BAA0B3b,EAAOlJ,MAE9C,OAAOiJ,eACL,GACAjJ,EACAc,EAAQhB,IAAI2B,MACZ,IACKX,EACHf,UAAWmJ,EAAOnJ,UAClBC,aAEF2E,EACA,YAVKsE,EAYT,CACF,CAEA,SAAS4b,0BAA0B7kB,GACjC,GAAoB,IAAhBA,EAAKyE,OAAc,OAAOzE,EAC9B,MAAM8kB,EAAU,IAAI9kB,GACd+kB,EAAYD,EAAQrgB,OAAS,EAC7BugB,EAAWF,EAAQC,GAGzB,GAAIhd,MAAMC,QAAQgd,IAAaA,EAASvgB,QAAU,EAAG,CACnD,MAAMkF,EAAKqb,EAAS,GAGpB,GAAM,IAAFrb,GAA4B,KAAFA,EAC5B,OAAOmb,EAqBT,GAfuB,8BAeJ9Z,SAASrB,GAC1B,OAAOmb,EAKTA,EAAQC,GAAa,CAAA,EAAA,EAAiCC,EACxD,CAEA,OAAOF,CACT,CAEA,SAASG,MAAO,CACV,SAAUthB,oBACdR,EACArC,GAGA,OADAokB,EAAkB5jB,UAAY2jB,IAAI3jB,UAC3B4jB,EACP,SAASA,EAAkBC,EAAuBC,KAAqBtc,GACrE,MAAMnI,EAAUG,EAAQhB,IAAIa,QACtBuE,EAAO,IAAI7D,KACf,MAAMgkB,EAAuB,iBAAZF,EAAuBhiB,EAAKgiB,GAAWA,EAIxD,OAHAG,EAAQ3X,cACR4X,EAAQ5X,cACRhN,EAAQ6kB,kBAAkBnN,OAAOoN,GAC1BJ,KAAKhkB,IAGRokB,IAAkB9kB,EAAQ+kB,qBAEhC,IAAInhB,EAAQohB,KAAKC,MACbC,EAAiBniB,WAAWwB,EAAMkgB,KAAYtc,GAE9Cgd,EAAU,EACd,MAAMR,EAAU3kB,EAAQolB,cAAc,KACpCD,EAAUH,KAAKC,MAAQrhB,EAAQuhB,EAC/BhiB,aAAa+hB,KAETN,EAAU5kB,EAAQ+M,gBAAgB,KACtCnJ,EAAQohB,KAAKC,MACb,MAAMI,EAAYpW,KAAKqW,OAAOb,GAAW,GAAKU,GAC9CD,EAASniB,WAAWwB,EAAM8gB,KAAcld,GACxCnI,EAAQ6kB,kBAAkB1jB,IAAI2jB,EAAe,CAC3CI,SACAP,UACAC,cAQJ,OALA5kB,EAAQ6kB,kBAAkB1jB,IAAI2jB,EAAe,CAC3CI,SACAP,UACAC,YAEKE,CACT,CACF,CAEA,SAASS,MAAO,CACV,SAAUniB,sBAAsBjD,GAEpC,OADAqlB,EAAoB7kB,UAAY4kB,IAAI5kB,UAC7B6kB,EACP,SAASA,EAAoBN,GAC3B,MAAMllB,EAAUG,EAAQhB,IAAIa,QACtBylB,EAAgBzlB,EAAQ6kB,kBAAkBrf,IAAI0f,GAChDO,IACFtiB,aAAasiB,EAAcP,QAC3BO,EAAcd,QAAQ3X,cACtByY,EAAcb,QAAQ5X,cACtBhN,EAAQ6kB,kBAAkBnN,OAAOwN,GAErC,CACF,CACA,SAASQ,MAAO,CACV,SAAUpiB,uBAAuBnD,GAErC,OADAwlB,EAAqBhlB,UAAY+kB,IAAI/kB,UAC9BglB,EACP,SAASA,EAAqBT,GAC5B,MAAMllB,EAAUG,EAAQhB,IAAIa,QACtB4lB,EAAiB5lB,EAAQ6lB,mBAAmBrgB,IAAI0f,GAClDU,IACFviB,cAAcuiB,EAAeV,QAC7BU,EAAejB,QAAQ3X,cACvB4Y,EAAehB,QAAQ5X,cACvBhN,EAAQ6lB,mBAAmBnO,OAAOwN,GAEtC,CACF,CAEA,SAASY,MAAO,CACV,SAAU5iB,qBACdV,EACArC,GAGA,OADA4lB,EAAmBplB,UAAYmlB,IAAInlB,UAC5BolB,EACP,SAASA,EACPvB,EACAC,KACGtc,GAEH,MAAMnI,EAAUG,EAAQhB,IAAIa,QACtB0kB,EAAuB,iBAAZF,EAAuBhiB,EAAKgiB,GAAWA,EAClDjgB,EAAO,IAAI7D,KACfkD,EAAQohB,KAAKC,MACbE,EAAU,EACHT,KAAKhkB,IAGRokB,IAAkB9kB,EAAQ+kB,qBAEhC,IAAInhB,EAAQohB,KAAKC,MACbC,EAAiBjiB,YAAYsB,EAAMkgB,KAAYtc,GAE/Cgd,EAAU,EACd,MAAMR,EAAU3kB,EAAQolB,cAAc,KACpCD,EAAUH,KAAKC,MAAQrhB,EAAQuhB,EAC/B9hB,cAAc6hB,KAEVN,EAAU5kB,EAAQ+M,gBAAgB,KACtCnJ,EAAQohB,KAAKC,MACbC,EAASniB,WACP,KACEa,EAAQohB,KAAKC,MACbE,EAAU,EACVD,EAASjiB,YAAYsB,EAAMkgB,KAAYtc,GACvC5D,KAAQ4D,IAEV8G,KAAKqW,OAAOb,GAAW,GAAKU,MACzBhd,GAEL6d,EAASd,OAASA,IAGdc,EAAW,CACfd,SACAP,UACAC,WAGF,OADA5kB,EAAQ6lB,mBAAmB1kB,IAAI2jB,EAAekB,GACvClB,CACT,CACF,CCjQA,SAASmB,aACPrhB,EACA4D,EACAwD,EACA7L,GAQA,MAAM+lB,EACJ/lB,EAAQZ,iBAAiBiG,IAAIZ,IAAQ,IAAIpE,IAC3CL,EAAQZ,iBAAiB4B,IAAIyD,EAAKshB,GAClC,MAAMC,EAAYD,EAAM1gB,IAAIgD,IAAS,IAAInI,IAGzC,IAAI+lB,EAFJF,EAAM/kB,IAAIqH,EAAM2d,GAChBA,EAAUxd,IAAIqD,GAEd,MAAMnG,EAAOjB,EAAY4D,GAMzB,OALI3C,aAAerH,SACjB4nB,EAAYjmB,EAAQX,oBAAoBgG,IAAIK,IAAQ,IAAIxF,IACxD+lB,EAAUzd,IAAIqD,GACd7L,EAAQX,oBAAoB2B,IAAI0E,EAAKugB,IAEhC,CACLpZ,YAAa,KACXmZ,EAAUzO,OAAO1L,GACjBoa,GAAW1O,OAAO1L,IAGxB,CAEc,MAAOqa,YAiCnB,WAAA1nB,CACEsB,EACOH,GAAAb,KAAAa,YAAAA,EAjCOb,KAAAM,iBAGZ,IAAI8C,QACQpD,KAAAO,oBAGZ,IAAI6C,QACQpD,KAAAsD,iBAAoD,IAAIF,QAChEpD,KAAAqnB,kBAEJ,IAAIjmB,IACApB,KAAAsnB,oBAAuC,IAAIlmB,IAC5CpB,KAAA4N,QAAS,EAChB5N,KAAA8lB,qBAAuB,EACP9lB,KAAA4lB,kBAAoB,IAAIrkB,IAQxBvB,KAAA4mB,mBAAqB,IAAIrlB,IAYvC,MAAMgmB,EAAgBhoB,OAAOsG,OAC3B,CACEuI,OAAO,EACPW,qBAAqB,EACrBvF,wBAAwB,EACxB1J,QAASsnB,YAAYI,aACrBlmB,mBAAoB8lB,YAAYK,gBAChC/Y,sBAAuB,IAAInN,KAE7BP,GAAW,CAAA,GAEbhB,KAAKkB,QAAUJ,cAAcd,KAAMunB,EACrC,CAEA,uBAAWC,GACT,MAAO,CACL/b,sBACA9H,kBACAC,UACA8jB,QAAS,CACPC,MAAOD,QAAQC,MACfxa,MAAOua,QAAQva,MACfya,KAAMF,QAAQE,KACdC,IAAKH,QAAQG,IACbC,MAAOJ,QAAQI,MACfC,KAAML,QAAQK,MAEhBC,kBACAxT,YACAyT,sBACA1X,kBACA2X,oBACAC,sCACAC,oBACAC,sCACApM,cACAqM,kBACAC,gBACAlY,cACAlC,cACAwG,cACApV,cACA4I,YACAhG,cACAyF,YACA4gB,oBACAlT,sBACAtO,8BACAH,wBACAI,oBACAwhB,kBACAC,oBACAC,sBACAC,oCACAC,sBACAC,wBACAC,sBACAC,wBACAC,0BACAC,0BACA3nB,QACAH,QACAgC,gBACAnB,gBACA2H,gBACAuf,UACA/Z,UACAY,UACA+V,UACArV,cAEJ,CAEA,0BAAW+W,GACT,MAAM2B,EAAS,CACbvpB,cACA8D,SACA4kB,QACAlY,OACAlC,OACAwG,OACAoR,KACAne,MACAO,MACAugB,UACAC,WACAC,kBACAC,WACAC,YACAC,WACAC,YACAC,aACAC,aACA3nB,IACAH,IACAgC,QACAnB,QACA2H,QACAzH,OACA4jB,KACArV,OAEArO,SACAC,QACAC,QACAC,UAEIhB,EAAM,IAAID,IAuBhB,OAtBA6nB,EAAO9gB,QAAS+gB,IACd7nB,EAAIU,IAAImnB,EAAO,IAAIjoB,OAErBI,EAAIU,IACF3C,OACA,IAAI6B,IAAI,CACN,cACA,OACA,UACA,cACA,sBACA,KACA,OACA,iBACA,gBACA,uBACA,iBACA,WACA,UACA,YAGGI,CACT,CAEA,YAAA8nB,CACEvc,EACA7L,GAGA,OADAA,EAAQb,iBAAiBqJ,IAAIqD,GACtB,CAAEgB,YAAa,IAAM7M,EAAQb,iBAAiBoY,OAAO1L,GAC9D,CAEA,YAAAia,CACErhB,EACA4D,EACAwD,EACA7L,GAEA,OAAO8lB,aAAarhB,EAAK4D,EAAMwD,EAAU7L,EAC3C,CAEA,kBAAAqoB,CACE5jB,EACA4D,EACAwD,GAEA,OAAOia,aAAarhB,EAAK4D,EAAMwD,EAAU/M,KAC3C,CAEA,aAAAmmB,CACE5d,GAGA,OADAvI,KAAKqnB,kBAAkB3d,IAAInB,GACpB,CACLwF,YAAa,KACX/N,KAAKqnB,kBAAkB5O,OAAOlQ,IAGpC,CACA,eAAAuF,CAAgBvF,GAEd,OADAvI,KAAKsnB,oBAAoB5d,IAAInB,GACtB,CACLwF,YAAa,KACX/N,KAAKsnB,oBAAoB7O,OAAOlQ,IAGtC,CAEA,aAAA2F,CAAcsb,GACZ,IAAIxpB,KAAK4N,OAAT,CACA5N,KAAK4N,QAAS,EACd,IAAK,MAAMrF,KAAMvI,KAAKqnB,kBACpB9e,EAAGihB,EAHY,CAKnB,CAEA,eAAAC,GACE,GAAKzpB,KAAK4N,OAAV,CACA,GAAI5N,KAAKkB,QAAQW,MAAMC,WAAa9B,KAAKkB,QAAQW,MAAMA,OAAS7B,KAAKkB,QAAQW,MAAMC,UACjF,MAAM,IAAI+F,mCAAmC,gDAE/C7H,KAAK4N,QAAS,EACd,IAAK,MAAMrF,KAAMvI,KAAKsnB,oBACpB/e,GANgB,CAQpB,CAEA,UAAAmhB,CAAWrmB,GACT,OAAOrD,KAAKsD,iBAAiBiD,IAAIlD,EACnC,CAEA,WAAAoG,CAAevI,EAAuB4S,EAAmB,IACvD,OAAOrK,YAAYvI,EAAQhB,IAAI2B,MAAOX,EAASA,EAAQd,KAAM0T,EAC/D,CAEA,gBAAAjK,CAAoB3I,EAAuB4S,EAAmB,IAC5D,OAAOjK,iBAAiB3I,EAAQhB,IAAI2B,MAAOX,EAASA,EAAQd,KAAM0T,EACpE,ECpSY,MAAO6V,gBAAgBvC,YACnC,WAAA1nB,CAAYsB,GACVwV,MAAMxV,EAAS0jB,oBACjB,CAEA,YAAOtW,CAASpJ,EAAc8O,EAAmB,IAC/C,MAAMhU,EAAmC,CAAA,EACzC,IAAK,MAAMC,KAAKR,OAAOqqB,oBAAoBne,YACzC3L,EAAQC,GAAK0L,WAAW1L,GAE1B,MAAMgB,EAAU,IAAIqmB,YAAY,CAC9BtnB,UACAsO,OAAO,IAET,OAAOrN,EAAQ0I,YACbxG,kBAAkBlC,EAAS0jB,MAAMzf,GAAM,GAAO0f,qBAC9C5Q,EAEJ,CAEA,YAAO2Q,CAAMzf,GACX,OAAOyf,MAAMzf,EACf,CAEA,OAAA6kB,CACE7kB,EACA8kB,GAAW,GAEX,MAAMxgB,EAASmb,MAAMzf,EAAM8kB,GAK3B,MAJa,IAAIhW,KACf,MAAM5S,EAAU+B,kBAAkBjD,KAAMsJ,EAAQtJ,KAAKa,aACrD,MAAO,CAAEK,UAAS6oB,IAAK,IAAM/pB,KAAKyJ,YAAevI,EAAS,IAAI4S,IAASnL,QAG3E,CAEA,YAAAqhB,CACEhlB,EACA8kB,GAAW,GAEX,MAAMxgB,EAASmb,MAAMzf,EAAM8kB,GAQ3B,MAPa,IAAIhW,KACf,MAAM5S,EAAU+B,kBAAkBjD,KAAMsJ,EAAQtJ,KAAKa,aACrD,MAAO,CACLK,UACA6oB,IAAK,IAAM/pB,KAAK6J,iBAAoB3I,EAAS,IAAI4S,IAAS5E,KAAMtJ,GAAQA,EAAI+C,SAIlF,CAEA,iBAAAshB,CACEjlB,EACA8kB,GAAW,GAEX,MAAMxgB,EAASmb,MAAMzf,EAAM8kB,GAAU,GAKrC,MAJa,IAAIhW,KACf,MAAM5S,EAAU+B,kBAAkBjD,KAAMsJ,EAAQtJ,KAAKa,aACrD,MAAO,CAAEK,UAAS6oB,IAAK,IAAM/pB,KAAKyJ,YAAevI,EAAS,IAAI4S,IAASnL,QAG3E,CAEA,sBAAAuhB,CACEllB,EACA8kB,GAAW,GAEX,MAAMxgB,EAASmb,MAAMzf,EAAM8kB,GAAU,GAQrC,MAPa,IAAIhW,KACf,MAAM5S,EAAU+B,kBAAkBjD,KAAMsJ,EAAQtJ,KAAKa,aACrD,MAAO,CACLK,UACA6oB,IAAK,IAAM/pB,KAAK6J,iBAAoB3I,EAAS,IAAI4S,IAAS5E,KAAMtJ,GAAQA,EAAI+C,SAIlF"}