bonsai-js 1.0.0 → 1.2.0

package/dist/features.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"features.mjs","names":[],"sources":["../src/features.ts"],"sourcesContent":["/**\n * Explaining and partial evaluation: the program features the main entry\n * point adds to every environment. `bonsai-js/lite` leaves them out, so a\n * bundle that only checks and evaluates does not carry them.\n */\nimport { analyze, type Analysis, type CallPlan } from './check/checker.js'\nimport { compileProgram, type CompiledProgram } from './compile/compiler.js'\nimport { escaping, isOwn, raised } from './runtime/attribution.js'\nimport { BonsaiRuntimeError, type BonsaiError } from './errors.js'\nimport { describeMismatch, type Out, type ValidationBudget } from './functions/define.js'\nimport {\n  EVALUATE_OPTION_KEYS,\n  contextOf,\n  evaluationLimits,\n  hostDataFailure,\n  invalidContext,\n  isValidDate,\n  validationBudget,\n  type EvaluateOptions,\n  type ExplainOptions,\n  type Explanation,\n  type Features,\n  type ProgramCore,\n  type ProgramFeatures,\n} from './environment.js'\nimport {\n  forTranslation,\n  partiallyEvaluate,\n  residualTexts,\n  type PartialOptions,\n  type PartialResult,\n} from './partial.js'\nimport { isStackOverflow, tooDeep } from './runtime/overflow.js'\nimport { State } from './runtime/state.js'\nimport {\n  DEFAULT_MAX_ITERATIONS,\n  DEFAULT_MAX_TRACE_NODES,\n  SNAPSHOT_ENTRIES,\n  Tracer,\n  freezeAll,\n  reasonsOf,\n  renderTrace,\n  snapshot,\n  snapshotTrace,\n  type ExplanationJSON,\n  type Parts,\n} from './runtime/trace.js'\nimport { isMap, keyListCost } from './runtime/values.js'\nimport { forEachChild, type CallNode, type Node } from './syntax/ast.js'\nimport { BLOCKED_NAMES, isName } from './syntax/lexer.js'\nimport type { Type } from './types.js'\n\n/** Subtrees compiled for partial evaluation, in nodes, kept per program: this times its own. */\nconst SUBTREE_CACHE_FACTOR = 2\n\nconst EXPLAIN_OPTION_KEYS: ReadonlySet<string> = new Set([\n  ...EVALUATE_OPTION_KEYS,\n  'maxIterations',\n  'maxTraceNodes',\n  'exhaustive',\n])\n\ninterface ExplainSettings {\n  readonly maxIterations: number\n  readonly maxNodes: number\n  readonly exhaustive: boolean\n  /** The evaluation options among them, validated by evaluationLimits. */\n  readonly evaluate: EvaluateOptions | undefined\n}\n\n/** Reads explain options once, with the same TypeError/RangeError rules as evaluate's. */\nfunction explainSettings(options: unknown): ExplainSettings {\n  if (options === undefined) {\n    return {\n      maxIterations: DEFAULT_MAX_ITERATIONS,\n      maxNodes: DEFAULT_MAX_TRACE_NODES,\n      exhaustive: false,\n      evaluate: undefined,\n    }\n  }\n  if (typeof options !== 'object' || options === null || Array.isArray(options))\n    throw new TypeError('Explain options must be an object')\n  let copy: Record<string, unknown>\n  try {\n    copy = { ...(options as Record<string, unknown>) }\n  } catch {\n    throw new TypeError('Explain options could not be read')\n  }\n  for (const key of Object.keys(copy)) {\n    if (!EXPLAIN_OPTION_KEYS.has(key)) {\n      throw new TypeError(\n        `Unknown explain option key \"${key}\" (expected one of: ${[...EXPLAIN_OPTION_KEYS].join(', ')})`,\n      )\n    }\n  }\n  const count = (name: string, fallback: number): number => {\n    const value = copy[name]\n    if (value === undefined) return fallback\n    if (typeof value !== 'number') throw new TypeError(`Explain option \"${name}\" must be a number`)\n    if (!Number.isSafeInteger(value) || value < 0)\n      throw new RangeError(`Explain option \"${name}\" must be a non-negative integer`)\n    return value\n  }\n  if (copy.exhaustive !== undefined && typeof copy.exhaustive !== 'boolean')\n    throw new TypeError('Explain option \"exhaustive\" must be a boolean')\n  const {\n    maxIterations: _iterations,\n    maxTraceNodes: _nodes,\n    exhaustive: _exhaustive,\n    ...evaluate\n  } = copy\n  return {\n    maxIterations: count('maxIterations', DEFAULT_MAX_ITERATIONS),\n    maxNodes: count('maxTraceNodes', DEFAULT_MAX_TRACE_NODES),\n    exhaustive: copy.exhaustive === true,\n    evaluate,\n  }\n}\n\nconst PARTIAL_OPTION_KEYS: ReadonlySet<string> = new Set([\n  'unknown',\n  'callHostFunctions',\n  'now',\n  'maxSteps',\n  'timeout',\n  'signal',\n])\n/** A variable name, then field names as reads spell them: none empty or blocked. */\nconst isPath = (path: unknown): boolean => {\n  if (typeof path !== 'string') return false\n  const [name, ...fields] = path.split('.')\n  return isName(name) && fields.every((field) => field !== '' && !BLOCKED_NAMES.has(field))\n}\n\n/** Reads partial() options once, with the same TypeError rules as the other options. */\nfunction partialOptions(options: unknown): PartialOptions {\n  if (options === undefined) return {}\n  if (typeof options !== 'object' || options === null || Array.isArray(options))\n    throw new TypeError('Partial options must be an object')\n  let copy: Record<string, unknown>\n  try {\n    copy = { ...(options as Record<string, unknown>) }\n    if (Array.isArray(copy.unknown)) copy.unknown = [...(copy.unknown as unknown[])]\n  } catch {\n    throw new TypeError('Partial options could not be read')\n  }\n  for (const key of Object.keys(copy)) {\n    if (!PARTIAL_OPTION_KEYS.has(key)) {\n      throw new TypeError(\n        `Unknown partial option key \"${key}\" (expected one of: ${[...PARTIAL_OPTION_KEYS].join(', ')})`,\n      )\n    }\n  }\n  const unknown = copy.unknown\n  if (unknown !== undefined && (!Array.isArray(unknown) || !unknown.every(isPath)))\n    throw new TypeError('Partial option \"unknown\" must be a list of variable names or dotted paths')\n  if (copy.callHostFunctions !== undefined && typeof copy.callHostFunctions !== 'boolean')\n    throw new TypeError('Partial option \"callHostFunctions\" must be a boolean')\n  if (copy.now !== undefined && !isValidDate(copy.now))\n    throw new TypeError('Partial option \"now\" must be a valid Date')\n  return copy\n}\n\n/** Paths listed as unknown, as a tree of segments: `whole` marks a listed path. */\ninterface UnknownTree {\n  whole: boolean\n  readonly next: Map<string, UnknownTree>\n}\n\nfunction unknownTree(paths: readonly string[]): UnknownTree {\n  const root: UnknownTree = { whole: false, next: new Map() }\n  for (const path of paths) {\n    let node = root\n    for (const segment of path.split('.')) {\n      let child = node.next.get(segment)\n      if (child === undefined) node.next.set(segment, (child = { whole: false, next: new Map() }))\n      node = child\n    }\n    node.whole = true\n  }\n  return root\n}\n\n/**\n * Why `value` does not conform to `type`, leaving out the parts of it under\n * listed unknown paths (`skip`): those are incomplete by design. Everything\n * else is checked as evaluation checks a context.\n */\nfunction describeKnown(\n  value: unknown,\n  type: Type,\n  path: string,\n  skip: UnknownTree | undefined,\n  budget: ValidationBudget,\n): string | undefined {\n  if (skip === undefined) return describeMismatch(value, type, path, budget)\n  if (skip.whole) return undefined\n  if (type.kind === 'union') {\n    let first: string | undefined\n    for (const member of type.types) {\n      const problem = describeKnown(value, member, path, skip, budget)\n      if (problem === undefined) return undefined\n      first ??= problem\n    }\n    return first\n  }\n  const actual = value === undefined ? null : value\n  if (type.kind !== 'map' || !isMap(actual)) return describeMismatch(value, type, path, budget)\n  if (--budget.remaining < 0) budget.onExhausted('steps')\n  for (const [key, fieldType] of Object.entries(type.fields)) {\n    const field = Object.hasOwn(actual, key) ? actual[key] : null\n    const problem = describeKnown(field, fieldType, `${path}.${key}`, skip.next.get(key), budget)\n    if (problem !== undefined) return problem\n  }\n  if (type.rest === undefined) return undefined\n  const keys = Object.keys(actual)\n  budget.remaining -= keyListCost(keys.length)\n  if (budget.remaining < 0) budget.onExhausted('steps')\n  for (const key of keys) {\n    // As evaluation's validation: keys the language never reads, or that hold undefined, are not data.\n    if (Object.hasOwn(type.fields, key) || BLOCKED_NAMES.has(key) || actual[key] === undefined)\n      continue\n    const problem = describeKnown(\n      actual[key],\n      type.rest,\n      `${path}.${key}`,\n      skip.next.get(key),\n      budget,\n    )\n    if (problem !== undefined) return problem\n  }\n  return undefined\n}\n\nfunction programFeatures<Ctx, R>(core: ProgramCore<R>): ProgramFeatures<Ctx, R> {\n  const {\n    source,\n    analysis,\n    expect,\n    settings,\n    checkEnv,\n    compileOptions,\n    residualOf,\n    prepare,\n    checked,\n    settle,\n  } = core\n\n  let traceSync: CompiledProgram | undefined\n  let traceAsync: CompiledProgram | undefined\n\n  function explanation(\n    tracer: Tracer,\n    outcome: { ok: true; value: R } | { ok: false; error: BonsaiError },\n  ): Explanation<R> {\n    const trace = tracer.finish()\n    // A result refused after the run (a promise-like value, a failed `expect`\n    // check) is the whole expression's failure: marked on the root.\n    if (!outcome.ok && trace.evaluated && trace.error === undefined) {\n      trace.error = { code: outcome.error.code, message: outcome.error.message }\n      delete trace.value\n    }\n    const truncated = tracer.truncated\n    // Every rendering of this explanation lists a map's keys once, however it is sliced.\n    const { listings } = tracer\n    // Taken once, the first time any part is serialized: one budget for the\n    // whole snapshot, however often a value recurs or the traces are sliced.\n    let json: ExplanationJSON | undefined\n    const parts: Parts = new WeakMap()\n    const toJSON = (): ExplanationJSON => {\n      if (json !== undefined) return json\n      const budget = { left: SNAPSHOT_ENTRIES, keys: listings }\n      const result = outcome.ok\n        ? { ok: true as const, value: snapshot(outcome.value, budget) }\n        : { ok: false as const, error: outcome.error.toJSON() }\n      // Frozen: every serialization (and every part of it) is this same snapshot.\n      return (json = freezeAll({\n        ...result,\n        truncated,\n        trace: snapshotTrace(trace, budget, parts),\n      }))\n    }\n    tracer.parts = () => (toJSON(), parts)\n    return Object.freeze({\n      ...outcome,\n      trace,\n      truncated,\n      reasons: () => reasonsOf(trace, listings),\n      toString: () => renderTrace(trace, truncated, listings),\n      toJSON,\n    })\n  }\n\n  function failure(error: unknown): { ok: false; error: BonsaiError } {\n    return { ok: false, error: escaping(hostDataFailure(error, source)) }\n  }\n\n  // A residual's nodes keep the original's offsets (or none, for known\n  // values), so their text comes from the printed residual instead: mapped\n  // once, the first time the residual is explained.\n  let residualText: ReadonlyMap<Node, string> | undefined\n  const residualTextMap = (printed: string): ReadonlyMap<Node, string> =>\n    (residualText ??= residualTexts(analysis.root, printed, {\n      maxSourceLength: Math.max(settings.parseLimits.maxSourceLength, printed.length),\n      // Printing adds parentheses (and unary minus for negative literals).\n      maxDepth: settings.parseLimits.maxDepth * 4,\n      maxNodes: settings.parseLimits.maxNodes * 4,\n    }))\n  const textOfResidual =\n    residualOf === undefined\n      ? undefined\n      : (node: Node): string => residualTextMap(residualOf.source).get(node) ?? ''\n\n  function tracerFor(explain: ExplainSettings): Tracer {\n    return new Tracer(\n      source,\n      analysis.root,\n      explain.maxIterations,\n      explain.maxNodes,\n      explain.exhaustive,\n      textOfResidual,\n    )\n  }\n\n  /** With `promised`, a thenable result fails as evaluate() fails it (see settle). */\n  function explainSync(\n    context: unknown,\n    options: ExplainOptions | undefined,\n    promised = false,\n  ): Explanation<R> {\n    const explain = explainSettings(options)\n    if (analysis.async) {\n      return explanation(\n        tracerFor(explain),\n        failure(\n          raised(\n            new BonsaiRuntimeError(\n              'ASYNC_IN_SYNC',\n              'This expression calls an async function; use explain() instead of explainSync()',\n              { source },\n            ),\n          ),\n        ),\n      )\n    }\n    const code = (traceSync ??= compileProgram(analysis, 'sync', {\n      ...compileOptions,\n      trace: true,\n    }))\n    const limits = evaluationLimits(explain.evaluate, settings)\n    const ctx = contextOf(context)\n    const state = new State(settings.runtimeLimits, settings.clock)\n    // A residual's text is mapped once per residual, work its partial()\n    // already charged, so explaining costs the steps evaluating does.\n    let tracer: Tracer | undefined\n    try {\n      prepare(state, ctx, limits, code.localCount)\n      tracer = tracerFor(explain)\n      state.tracer = tracer\n      const value = code.run(state) as R\n      checked(value, state)\n      state.checkTime()\n      if (promised) settle(value)\n      return explanation(tracer, { ok: true, value })\n    } catch (error) {\n      return explanation(tracer ?? tracerFor(explain), failure(error))\n    } finally {\n      state.release()\n    }\n  }\n\n  async function explainAsync(\n    context: unknown,\n    options: ExplainOptions | undefined,\n  ): Promise<Explanation<R>> {\n    if (!analysis.async) return explainSync(context, options, true)\n    const explain = explainSettings(options)\n    const code = (traceAsync ??= compileProgram(analysis, 'async', {\n      ...compileOptions,\n      trace: true,\n    }))\n    const limits = evaluationLimits(explain.evaluate, settings)\n    const ctx = contextOf(context)\n    const state = new State(settings.runtimeLimits, settings.clock)\n    let tracer: Tracer | undefined\n    try {\n      prepare(state, ctx, limits, code.localCount)\n      tracer = tracerFor(explain)\n      state.tracer = tracer\n      const value = ((await code.run(state)) as Out).v as R\n      // In evaluate()'s order: the expected type, the deadline, then a promise-like value.\n      checked(value, state)\n      state.checkTime()\n      settle(value)\n      return explanation(tracer, { ok: true, value })\n    } catch (error) {\n      return explanation(tracer ?? tracerFor(explain), failure(error))\n    } finally {\n      state.release()\n    }\n  }\n\n  // Each call the original program checked, by its source span and name. A\n  // residual keeps the spans of the calls it copies, so it can run each one\n  // with the overloads the original chose from the declared types: checking\n  // the residual again would see other types (a known branch removed, an\n  // open environment) and could pick another overload.\n  let callsBySpan: Map<string, CallPlan | null> | undefined\n  const callKey = (call: CallNode): string => `${call.start}:${call.end}:${call.name}`\n\n  function originalPlans(\n    compiled: Node,\n    checkedCalls: ReadonlyMap<CallNode, CallPlan>,\n  ): ReadonlyMap<CallNode, CallPlan> {\n    if (callsBySpan === undefined) {\n      callsBySpan = new Map()\n      for (const [call, plan] of analysis.calls) {\n        const key = callKey(call)\n        // Two calls with one span cannot be told apart; neither is reused.\n        callsBySpan.set(key, callsBySpan.has(key) ? null : plan)\n      }\n    }\n    const bySpan = callsBySpan\n    const plans = new Map(checkedCalls)\n    const visit = (node: Node): void => {\n      if (node.type === 'Call') {\n        const plan = bySpan.get(callKey(node))\n        if (plan !== undefined && plan !== null) plans.set(node, plan)\n      }\n      forEachChild(node, visit)\n    }\n    visit(compiled)\n    return plans\n  }\n\n  // Sub-trees compiled on their own for partial evaluation, by free locals.\n  // Which subtrees are closed depends on the data, so the cache holds at most\n  // a few times the program's own nodes, and starts over when full.\n  let subtrees = new Map<Node, Map<string, CompiledProgram>>()\n  let subtreeNodes = 0\n\n  function partial(\n    known: Record<string, unknown>,\n    rawOptions: unknown,\n    translation = false,\n  ): PartialResult<Ctx, R> {\n    const options = partialOptions(rawOptions)\n    // One budget for the whole partial evaluation, validated as evaluation's is.\n    const limits = evaluationLimits(\n      { maxSteps: options.maxSteps, timeout: options.timeout, signal: options.signal },\n      settings,\n    )\n    const context = contextOf(known)\n    const now = options.now\n    const state = new State(settings.runtimeLimits, now === undefined ? settings.clock : () => now)\n    state.reset(context, source, 0, limits.maxSteps, limits.timeout, limits.signal)\n    try {\n      // Known variables are validated as evaluation validates them, all but\n      // the parts under listed unknown paths (incomplete by design): all the\n      // data a residual has folded in is checked here, once.\n      if (settings.validateContext && settings.variables !== undefined) {\n        const variables = settings.variables\n        const skip = unknownTree(options.unknown ?? [])\n        try {\n          const budget = validationBudget(source, {\n            maxDepth: settings.runtimeLimits.maxValueDepth,\n            maxSteps: limits.maxSteps,\n            timeout: limits.timeout,\n          })\n          for (const [name, type] of Object.entries(variables)) {\n            if (!Object.hasOwn(context, name)) continue\n            const problem = describeKnown(context[name], type, name, skip.next.get(name), budget)\n            invalidContext(problem, source)\n          }\n        } catch (error) {\n          // Validation only reads the known data, so any other failure is the host's.\n          if (!isOwn(error)) throw hostDataFailure(error, source)\n          if (error instanceof BonsaiRuntimeError) return { status: 'error', error }\n          throw error\n        }\n      }\n      const result = partiallyEvaluate<R>(\n        {\n          analysis,\n          hostKind: (name) => {\n            const def = settings.host.get(name)\n            return def === undefined\n              ? undefined\n              : { async: def.async === true, call: def.call === true }\n          },\n          charge: (steps = 1) => {\n            state.charge(steps)\n          },\n          checkTime: () => {\n            state.checkTime()\n          },\n          listLimit: (length, at) => {\n            state.listLimit(length, at)\n          },\n          // Translation reads the residual tree, never its printed source.\n          maxSourceLength: translation ? Infinity : settings.parseLimits.maxSourceLength,\n          readKnown: (read) => {\n            try {\n              return read()\n            } catch (error) {\n              throw hostDataFailure(error, source)\n            }\n          },\n          evaluate: (node, locals, size, total) => {\n            const key = locals.map(([name]) => name).join('\\u0000')\n            let code = subtrees.get(node)?.get(key)\n            if (code === undefined) {\n              if (subtreeNodes + size > SUBTREE_CACHE_FACTOR * total) {\n                subtrees = new Map()\n                subtreeNodes = 0\n              }\n              code = compileProgram({ ...analysis, root: node }, 'sync', {\n                locals: locals.map(([name]) => name),\n              })\n              let byLocals = subtrees.get(node)\n              if (byLocals === undefined) subtrees.set(node, (byLocals = new Map()))\n              byLocals.set(key, code)\n              subtreeNodes += size\n            }\n            state.ensureLocals(code.localCount)\n            locals.forEach(([, value], slot) => {\n              state.locals[slot] = value\n            })\n            try {\n              return code.run(state)\n            } catch (error) {\n              throw hostDataFailure(error, source)\n            }\n          },\n          evaluateFolded: (node, origin, locals) => {\n            const plan = origin.type === 'Call' ? analysis.calls.get(origin) : undefined\n            const code = compileProgram(\n              {\n                ...analysis,\n                root: node,\n                calls: plan === undefined ? new Map() : new Map([[node as CallNode, plan]]),\n              },\n              'sync',\n              { locals: locals.map(([name]) => name) },\n            )\n            state.ensureLocals(code.localCount)\n            locals.forEach(([, value], slot) => {\n              state.locals[slot] = value\n            })\n            try {\n              return code.run(state)\n            } catch (error) {\n              throw hostDataFailure(error, source)\n            }\n          },\n          compileResidual: (\n            residual,\n            bindings,\n            residualSource,\n            readsContext,\n            knownRoots,\n            dependsOn,\n          ) => {\n            // The original expression passed the checker; inlining known\n            // values can make a failing branch statically visible, and that\n            // failure must happen at run time, as it would have, so findings\n            // here do not stop compilation. Analyzed as a tree (not\n            // re-parsed), so the printer's parentheses cannot push it past\n            // the parse depth limit.\n            const reanalyzed: Analysis = analyze(\n              residual,\n              { ...checkEnv, variables: undefined, strict: false },\n              { expected: expect },\n            )\n            return core.residual(\n              // The plans go on the calls of the tree that is compiled: the\n              // analysis root, where implicit lambdas are explicit nodes.\n              { ...reanalyzed, calls: originalPlans(reanalyzed.root, reanalyzed.calls) },\n              new Map(Object.entries(bindings)),\n              {\n                source: residualSource,\n                readsContext,\n                knownRoots,\n                dependsOn,\n                shapes: state.shapes,\n              },\n            )\n          },\n        },\n        context,\n        options,\n      )\n      // A decided result still has to match `expect`, as evaluation would check it.\n      if (result.status === 'value') {\n        try {\n          checked(result.value, state)\n        } catch (error) {\n          // Checking reads the value, which can be host data.\n          if (!isOwn(error)) throw hostDataFailure(error, source)\n          if (error instanceof BonsaiRuntimeError) return { status: 'error', error }\n          throw error\n        }\n      }\n      // The residual accepts any object at run time; its parameter is typed by this program's context.\n      return result as PartialResult<Ctx, R>\n    } catch (error) {\n      // Host data is read through readKnown, evaluate, and the checks above,\n      // which report its failures as HOST_ERROR; anything else is a failure\n      // of the engine itself, not of the caller's data, so it is not relabeled.\n      if (isStackOverflow(error)) throw tooDeep(source, error)\n      throw error\n    } finally {\n      state.release()\n    }\n  }\n\n  return {\n    explainSync,\n    explainAsync,\n    partial(program, known, options) {\n      const translation = forTranslation(program)\n      let result: PartialResult<Ctx, R>\n      try {\n        result = partial(known as Record<string, unknown>, options, translation)\n      } catch (error) {\n        throw escaping(error)\n      }\n      if (result.status === 'error') escaping(result.error)\n      return Object.freeze(result)\n    },\n  }\n}\n\n/** Explaining and partial evaluation, for the main entry point's environments. */\nexport const explainAndPartial: Features = { program: programFeatures }\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAqDA,MAAM,uBAAuB;AAE7B,MAAM,sCAA2C,IAAI,IAAI;CACvD,GAAG;CACH;CACA;CACA;AACF,CAAC;;AAWD,SAAS,gBAAgB,SAAmC;CAC1D,IAAI,YAAY,KAAA,GACd,OAAO;EACL,eAAA;EACA,UAAU;EACV,YAAY;EACZ,UAAU,KAAA;CACZ;CAEF,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,MAAM,QAAQ,OAAO,GAC1E,MAAM,IAAI,UAAU,mCAAmC;CACzD,IAAI;CACJ,IAAI;EACF,OAAO,EAAE,GAAI,QAAoC;CACnD,QAAQ;EACN,MAAM,IAAI,UAAU,mCAAmC;CACzD;CACA,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAChC,IAAI,CAAC,oBAAoB,IAAI,GAAG,GAC9B,MAAM,IAAI,UACR,+BAA+B,IAAI,sBAAsB,CAAC,GAAG,mBAAmB,CAAC,CAAC,KAAK,IAAI,EAAE,EAC/F;CAGJ,MAAM,SAAS,MAAc,aAA6B;EACxD,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,IAAI,OAAO,UAAU,UAAU,MAAM,IAAI,UAAU,mBAAmB,KAAK,mBAAmB;EAC9F,IAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAC1C,MAAM,IAAI,WAAW,mBAAmB,KAAK,iCAAiC;EAChF,OAAO;CACT;CACA,IAAI,KAAK,eAAe,KAAA,KAAa,OAAO,KAAK,eAAe,WAC9D,MAAM,IAAI,UAAU,iDAA+C;CACrE,MAAM,EACJ,eAAe,aACf,eAAe,QACf,YAAY,aACZ,GAAG,aACD;CACJ,OAAO;EACL,eAAe,MAAM,iBAAA,EAAuC;EAC5D,UAAU,MAAM,iBAAiB,uBAAuB;EACxD,YAAY,KAAK,eAAe;EAChC;CACF;AACF;AAEA,MAAM,sCAA2C,IAAI,IAAI;CACvD;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AAED,MAAM,UAAU,SAA2B;CACzC,IAAI,OAAO,SAAS,UAAU,OAAO;CACrC,MAAM,CAAC,MAAM,GAAG,UAAU,KAAK,MAAM,GAAG;CACxC,OAAO,OAAO,IAAI,KAAK,OAAO,OAAO,UAAU,UAAU,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC;AAC1F;;AAGA,SAAS,eAAe,SAAkC;CACxD,IAAI,YAAY,KAAA,GAAW,OAAO,CAAC;CACnC,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,MAAM,QAAQ,OAAO,GAC1E,MAAM,IAAI,UAAU,mCAAmC;CACzD,IAAI;CACJ,IAAI;EACF,OAAO,EAAE,GAAI,QAAoC;EACjD,IAAI,MAAM,QAAQ,KAAK,OAAO,GAAG,KAAK,UAAU,CAAC,GAAI,KAAK,OAAqB;CACjF,QAAQ;EACN,MAAM,IAAI,UAAU,mCAAmC;CACzD;CACA,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAChC,IAAI,CAAC,oBAAoB,IAAI,GAAG,GAC9B,MAAM,IAAI,UACR,+BAA+B,IAAI,sBAAsB,CAAC,GAAG,mBAAmB,CAAC,CAAC,KAAK,IAAI,EAAE,EAC/F;CAGJ,MAAM,UAAU,KAAK;CACrB,IAAI,YAAY,KAAA,MAAc,CAAC,MAAM,QAAQ,OAAO,KAAK,CAAC,QAAQ,MAAM,MAAM,IAC5E,MAAM,IAAI,UAAU,6EAA2E;CACjG,IAAI,KAAK,sBAAsB,KAAA,KAAa,OAAO,KAAK,sBAAsB,WAC5E,MAAM,IAAI,UAAU,wDAAsD;CAC5E,IAAI,KAAK,QAAQ,KAAA,KAAa,CAAC,YAAY,KAAK,GAAG,GACjD,MAAM,IAAI,UAAU,6CAA2C;CACjE,OAAO;AACT;AAQA,SAAS,YAAY,OAAuC;CAC1D,MAAM,OAAoB;EAAE,OAAO;EAAO,sBAAM,IAAI,IAAI;CAAE;CAC1D,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,OAAO;EACX,KAAK,MAAM,WAAW,KAAK,MAAM,GAAG,GAAG;GACrC,IAAI,QAAQ,KAAK,KAAK,IAAI,OAAO;GACjC,IAAI,UAAU,KAAA,GAAW,KAAK,KAAK,IAAI,SAAU,QAAQ;IAAE,OAAO;IAAO,sBAAM,IAAI,IAAI;GAAE,CAAE;GAC3F,OAAO;EACT;EACA,KAAK,QAAQ;CACf;CACA,OAAO;AACT;;;;;;AAOA,SAAS,cACP,OACA,MACA,MACA,MACA,QACoB;CACpB,IAAI,SAAS,KAAA,GAAW,OAAO,iBAAiB,OAAO,MAAM,MAAM,MAAM;CACzE,IAAI,KAAK,OAAO,OAAO,KAAA;CACvB,IAAI,KAAK,SAAS,SAAS;EACzB,IAAI;EACJ,KAAK,MAAM,UAAU,KAAK,OAAO;GAC/B,MAAM,UAAU,cAAc,OAAO,QAAQ,MAAM,MAAM,MAAM;GAC/D,IAAI,YAAY,KAAA,GAAW,OAAO,KAAA;GAClC,UAAU;EACZ;EACA,OAAO;CACT;CACA,MAAM,SAAS,UAAU,KAAA,IAAY,OAAO;CAC5C,IAAI,KAAK,SAAS,SAAS,CAAC,MAAM,MAAM,GAAG,OAAO,iBAAiB,OAAO,MAAM,MAAM,MAAM;CAC5F,IAAI,EAAE,OAAO,YAAY,GAAG,OAAO,YAAY,OAAO;CACtD,KAAK,MAAM,CAAC,KAAK,cAAc,OAAO,QAAQ,KAAK,MAAM,GAAG;EAE1D,MAAM,UAAU,cADF,OAAO,OAAO,QAAQ,GAAG,IAAI,OAAO,OAAO,MACpB,WAAW,GAAG,KAAK,GAAG,OAAO,KAAK,KAAK,IAAI,GAAG,GAAG,MAAM;EAC5F,IAAI,YAAY,KAAA,GAAW,OAAO;CACpC;CACA,IAAI,KAAK,SAAS,KAAA,GAAW,OAAO,KAAA;CACpC,MAAM,OAAO,OAAO,KAAK,MAAM;CAC/B,OAAO,aAAa,YAAY,KAAK,MAAM;CAC3C,IAAI,OAAO,YAAY,GAAG,OAAO,YAAY,OAAO;CACpD,KAAK,MAAM,OAAO,MAAM;EAEtB,IAAI,OAAO,OAAO,KAAK,QAAQ,GAAG,KAAK,cAAc,IAAI,GAAG,KAAK,OAAO,SAAS,KAAA,GAC/E;EACF,MAAM,UAAU,cACd,OAAO,MACP,KAAK,MACL,GAAG,KAAK,GAAG,OACX,KAAK,KAAK,IAAI,GAAG,GACjB,MACF;EACA,IAAI,YAAY,KAAA,GAAW,OAAO;CACpC;AAEF;AAEA,SAAS,gBAAwB,MAA+C;CAC9E,MAAM,EACJ,QACA,UACA,QACA,UACA,UACA,gBACA,YACA,SACA,SACA,WACE;CAEJ,IAAI;CACJ,IAAI;CAEJ,SAAS,YACP,QACA,SACgB;EAChB,MAAM,QAAQ,OAAO,OAAO;EAG5B,IAAI,CAAC,QAAQ,MAAM,MAAM,aAAa,MAAM,UAAU,KAAA,GAAW;GAC/D,MAAM,QAAQ;IAAE,MAAM,QAAQ,MAAM;IAAM,SAAS,QAAQ,MAAM;GAAQ;GACzE,OAAO,MAAM;EACf;EACA,MAAM,YAAY,OAAO;EAEzB,MAAM,EAAE,aAAa;EAGrB,IAAI;EACJ,MAAM,wBAAe,IAAI,QAAQ;EACjC,MAAM,eAAgC;GACpC,IAAI,SAAS,KAAA,GAAW,OAAO;GAC/B,MAAM,SAAS;IAAE,MAAM;IAAkB,MAAM;GAAS;GACxD,MAAM,SAAS,QAAQ,KACnB;IAAE,IAAI;IAAe,OAAO,SAAS,QAAQ,OAAO,MAAM;GAAE,IAC5D;IAAE,IAAI;IAAgB,OAAO,QAAQ,MAAM,OAAO;GAAE;GAExD,OAAQ,OAAO,UAAU;IACvB,GAAG;IACH;IACA,OAAO,cAAc,OAAO,QAAQ,KAAK;GAC3C,CAAC;EACH;EACA,OAAO,eAAe,OAAO,GAAG;EAChC,OAAO,OAAO,OAAO;GACnB,GAAG;GACH;GACA;GACA,eAAe,UAAU,OAAO,QAAQ;GACxC,gBAAgB,YAAY,OAAO,WAAW,QAAQ;GACtD;EACF,CAAC;CACH;CAEA,SAAS,QAAQ,OAAmD;EAClE,OAAO;GAAE,IAAI;GAAO,OAAO,SAAS,gBAAgB,OAAO,MAAM,CAAC;EAAE;CACtE;CAKA,IAAI;CACJ,MAAM,mBAAmB,YACtB,iBAAiB,cAAc,SAAS,MAAM,SAAS;EACtD,iBAAiB,KAAK,IAAI,SAAS,YAAY,iBAAiB,QAAQ,MAAM;EAE9E,UAAU,SAAS,YAAY,WAAW;EAC1C,UAAU,SAAS,YAAY,WAAW;CAC5C,CAAC;CACH,MAAM,iBACJ,eAAe,KAAA,IACX,KAAA,KACC,SAAuB,gBAAgB,WAAW,MAAM,CAAC,CAAC,IAAI,IAAI,KAAK;CAE9E,SAAS,UAAU,SAAkC;EACnD,OAAO,IAAI,OACT,QACA,SAAS,MACT,QAAQ,eACR,QAAQ,UACR,QAAQ,YACR,cACF;CACF;;CAGA,SAAS,YACP,SACA,SACA,WAAW,OACK;EAChB,MAAM,UAAU,gBAAgB,OAAO;EACvC,IAAI,SAAS,OACX,OAAO,YACL,UAAU,OAAO,GACjB,QACE,OACE,IAAI,mBACF,iBACA,mFACA,EAAE,OAAO,CACX,CACF,CACF,CACF;EAEF,MAAM,OAAQ,cAAc,eAAe,UAAU,QAAQ;GAC3D,GAAG;GACH,OAAO;EACT,CAAC;EACD,MAAM,SAAS,iBAAiB,QAAQ,UAAU,QAAQ;EAC1D,MAAM,MAAM,UAAU,OAAO;EAC7B,MAAM,QAAQ,IAAI,MAAM,SAAS,eAAe,SAAS,KAAK;EAG9D,IAAI;EACJ,IAAI;GACF,QAAQ,OAAO,KAAK,QAAQ,KAAK,UAAU;GAC3C,SAAS,UAAU,OAAO;GAC1B,MAAM,SAAS;GACf,MAAM,QAAQ,KAAK,IAAI,KAAK;GAC5B,QAAQ,OAAO,KAAK;GACpB,MAAM,UAAU;GAChB,IAAI,UAAU,OAAO,KAAK;GAC1B,OAAO,YAAY,QAAQ;IAAE,IAAI;IAAM;GAAM,CAAC;EAChD,SAAS,OAAO;GACd,OAAO,YAAY,UAAU,UAAU,OAAO,GAAG,QAAQ,KAAK,CAAC;EACjE,UAAU;GACR,MAAM,QAAQ;EAChB;CACF;CAEA,eAAe,aACb,SACA,SACyB;EACzB,IAAI,CAAC,SAAS,OAAO,OAAO,YAAY,SAAS,SAAS,IAAI;EAC9D,MAAM,UAAU,gBAAgB,OAAO;EACvC,MAAM,OAAQ,eAAe,eAAe,UAAU,SAAS;GAC7D,GAAG;GACH,OAAO;EACT,CAAC;EACD,MAAM,SAAS,iBAAiB,QAAQ,UAAU,QAAQ;EAC1D,MAAM,MAAM,UAAU,OAAO;EAC7B,MAAM,QAAQ,IAAI,MAAM,SAAS,eAAe,SAAS,KAAK;EAC9D,IAAI;EACJ,IAAI;GACF,QAAQ,OAAO,KAAK,QAAQ,KAAK,UAAU;GAC3C,SAAS,UAAU,OAAO;GAC1B,MAAM,SAAS;GACf,MAAM,SAAU,MAAM,KAAK,IAAI,KAAK,EAAA,CAAW;GAE/C,QAAQ,OAAO,KAAK;GACpB,MAAM,UAAU;GAChB,OAAO,KAAK;GACZ,OAAO,YAAY,QAAQ;IAAE,IAAI;IAAM;GAAM,CAAC;EAChD,SAAS,OAAO;GACd,OAAO,YAAY,UAAU,UAAU,OAAO,GAAG,QAAQ,KAAK,CAAC;EACjE,UAAU;GACR,MAAM,QAAQ;EAChB;CACF;CAOA,IAAI;CACJ,MAAM,WAAW,SAA2B,GAAG,KAAK,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK;CAE9E,SAAS,cACP,UACA,cACiC;EACjC,IAAI,gBAAgB,KAAA,GAAW;GAC7B,8BAAc,IAAI,IAAI;GACtB,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS,OAAO;IACzC,MAAM,MAAM,QAAQ,IAAI;IAExB,YAAY,IAAI,KAAK,YAAY,IAAI,GAAG,IAAI,OAAO,IAAI;GACzD;EACF;EACA,MAAM,SAAS;EACf,MAAM,QAAQ,IAAI,IAAI,YAAY;EAClC,MAAM,SAAS,SAAqB;GAClC,IAAI,KAAK,SAAS,QAAQ;IACxB,MAAM,OAAO,OAAO,IAAI,QAAQ,IAAI,CAAC;IACrC,IAAI,SAAS,KAAA,KAAa,SAAS,MAAM,MAAM,IAAI,MAAM,IAAI;GAC/D;GACA,aAAa,MAAM,KAAK;EAC1B;EACA,MAAM,QAAQ;EACd,OAAO;CACT;CAKA,IAAI,2BAAW,IAAI,IAAwC;CAC3D,IAAI,eAAe;CAEnB,SAAS,QACP,OACA,YACA,cAAc,OACS;EACvB,MAAM,UAAU,eAAe,UAAU;EAEzC,MAAM,SAAS,iBACb;GAAE,UAAU,QAAQ;GAAU,SAAS,QAAQ;GAAS,QAAQ,QAAQ;EAAO,GAC/E,QACF;EACA,MAAM,UAAU,UAAU,KAAK;EAC/B,MAAM,MAAM,QAAQ;EACpB,MAAM,QAAQ,IAAI,MAAM,SAAS,eAAe,QAAQ,KAAA,IAAY,SAAS,cAAc,GAAG;EAC9F,MAAM,MAAM,SAAS,QAAQ,GAAG,OAAO,UAAU,OAAO,SAAS,OAAO,MAAM;EAC9E,IAAI;GAIF,IAAI,SAAS,mBAAmB,SAAS,cAAc,KAAA,GAAW;IAChE,MAAM,YAAY,SAAS;IAC3B,MAAM,OAAO,YAAY,QAAQ,WAAW,CAAC,CAAC;IAC9C,IAAI;KACF,MAAM,SAAS,iBAAiB,QAAQ;MACtC,UAAU,SAAS,cAAc;MACjC,UAAU,OAAO;MACjB,SAAS,OAAO;KAClB,CAAC;KACD,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,SAAS,GAAG;MACpD,IAAI,CAAC,OAAO,OAAO,SAAS,IAAI,GAAG;MACnC,MAAM,UAAU,cAAc,QAAQ,OAAO,MAAM,MAAM,KAAK,KAAK,IAAI,IAAI,GAAG,MAAM;MACpF,eAAe,SAAS,MAAM;KAChC;IACF,SAAS,OAAO;KAEd,IAAI,CAAC,MAAM,KAAK,GAAG,MAAM,gBAAgB,OAAO,MAAM;KACtD,IAAI,iBAAiB,oBAAoB,OAAO;MAAE,QAAQ;MAAS;KAAM;KACzE,MAAM;IACR;GACF;GACA,MAAM,SAAS,kBACb;IACE;IACA,WAAW,SAAS;KAClB,MAAM,MAAM,SAAS,KAAK,IAAI,IAAI;KAClC,OAAO,QAAQ,KAAA,IACX,KAAA,IACA;MAAE,OAAO,IAAI,UAAU;MAAM,MAAM,IAAI,SAAS;KAAK;IAC3D;IACA,SAAS,QAAQ,MAAM;KACrB,MAAM,OAAO,KAAK;IACpB;IACA,iBAAiB;KACf,MAAM,UAAU;IAClB;IACA,YAAY,QAAQ,OAAO;KACzB,MAAM,UAAU,QAAQ,EAAE;IAC5B;IAEA,iBAAiB,cAAc,WAAW,SAAS,YAAY;IAC/D,YAAY,SAAS;KACnB,IAAI;MACF,OAAO,KAAK;KACd,SAAS,OAAO;MACd,MAAM,gBAAgB,OAAO,MAAM;KACrC;IACF;IACA,WAAW,MAAM,QAAQ,MAAM,UAAU;KACvC,MAAM,MAAM,OAAO,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,KAAK,IAAQ;KACtD,IAAI,OAAO,SAAS,IAAI,IAAI,CAAC,EAAE,IAAI,GAAG;KACtC,IAAI,SAAS,KAAA,GAAW;MACtB,IAAI,eAAe,OAAO,uBAAuB,OAAO;OACtD,2BAAW,IAAI,IAAI;OACnB,eAAe;MACjB;MACA,OAAO,eAAe;OAAE,GAAG;OAAU,MAAM;MAAK,GAAG,QAAQ,EACzD,QAAQ,OAAO,KAAK,CAAC,UAAU,IAAI,EACrC,CAAC;MACD,IAAI,WAAW,SAAS,IAAI,IAAI;MAChC,IAAI,aAAa,KAAA,GAAW,SAAS,IAAI,MAAO,2BAAW,IAAI,IAAI,CAAE;MACrE,SAAS,IAAI,KAAK,IAAI;MACtB,gBAAgB;KAClB;KACA,MAAM,aAAa,KAAK,UAAU;KAClC,OAAO,SAAS,GAAG,QAAQ,SAAS;MAClC,MAAM,OAAO,QAAQ;KACvB,CAAC;KACD,IAAI;MACF,OAAO,KAAK,IAAI,KAAK;KACvB,SAAS,OAAO;MACd,MAAM,gBAAgB,OAAO,MAAM;KACrC;IACF;IACA,iBAAiB,MAAM,QAAQ,WAAW;KACxC,MAAM,OAAO,OAAO,SAAS,SAAS,SAAS,MAAM,IAAI,MAAM,IAAI,KAAA;KACnE,MAAM,OAAO,eACX;MACE,GAAG;MACH,MAAM;MACN,OAAO,SAAS,KAAA,oBAAY,IAAI,IAAI,oBAAI,IAAI,IAAI,CAAC,CAAC,MAAkB,IAAI,CAAC,CAAC;KAC5E,GACA,QACA,EAAE,QAAQ,OAAO,KAAK,CAAC,UAAU,IAAI,EAAE,CACzC;KACA,MAAM,aAAa,KAAK,UAAU;KAClC,OAAO,SAAS,GAAG,QAAQ,SAAS;MAClC,MAAM,OAAO,QAAQ;KACvB,CAAC;KACD,IAAI;MACF,OAAO,KAAK,IAAI,KAAK;KACvB,SAAS,OAAO;MACd,MAAM,gBAAgB,OAAO,MAAM;KACrC;IACF;IACA,kBACE,UACA,UACA,gBACA,cACA,YACA,cACG;KAOH,MAAM,aAAuB,QAC3B,UACA;MAAE,GAAG;MAAU,WAAW,KAAA;MAAW,QAAQ;KAAM,GACnD,EAAE,UAAU,OAAO,CACrB;KACA,OAAO,KAAK,SAGV;MAAE,GAAG;MAAY,OAAO,cAAc,WAAW,MAAM,WAAW,KAAK;KAAE,GACzE,IAAI,IAAI,OAAO,QAAQ,QAAQ,CAAC,GAChC;MACE,QAAQ;MACR;MACA;MACA;MACA,QAAQ,MAAM;KAChB,CACF;IACF;GACF,GACA,SACA,OACF;GAEA,IAAI,OAAO,WAAW,SACpB,IAAI;IACF,QAAQ,OAAO,OAAO,KAAK;GAC7B,SAAS,OAAO;IAEd,IAAI,CAAC,MAAM,KAAK,GAAG,MAAM,gBAAgB,OAAO,MAAM;IACtD,IAAI,iBAAiB,oBAAoB,OAAO;KAAE,QAAQ;KAAS;IAAM;IACzE,MAAM;GACR;GAGF,OAAO;EACT,SAAS,OAAO;GAId,IAAI,gBAAgB,KAAK,GAAG,MAAM,QAAQ,QAAQ,KAAK;GACvD,MAAM;EACR,UAAU;GACR,MAAM,QAAQ;EAChB;CACF;CAEA,OAAO;EACL;EACA;EACA,QAAQ,SAAS,OAAO,SAAS;GAC/B,MAAM,cAAc,eAAe,OAAO;GAC1C,IAAI;GACJ,IAAI;IACF,SAAS,QAAQ,OAAkC,SAAS,WAAW;GACzE,SAAS,OAAO;IACd,MAAM,SAAS,KAAK;GACtB;GACA,IAAI,OAAO,WAAW,SAAS,SAAS,OAAO,KAAK;GACpD,OAAO,OAAO,OAAO,MAAM;EAC7B;CACF;AACF;;AAGA,MAAa,oBAA8B,EAAE,SAAS,gBAAgB"}
+{"version":3,"file":"features.mjs","names":[],"sources":["../src/features.ts"],"sourcesContent":["/**\n * Explaining and partial evaluation: the program features the main entry\n * point adds to every environment. `bonsai-js/lite` leaves them out, so a\n * bundle that only checks and evaluates does not carry them.\n */\nimport { analyze, type Analysis, type CallPlan } from './check/checker.js'\nimport { compileProgram, type CompiledProgram } from './compile/compiler.js'\nimport { escaping, isOwn, raised } from './runtime/attribution.js'\nimport { BonsaiRuntimeError, type BonsaiError } from './errors.js'\nimport { describeMismatch, type Out, type ValidationBudget } from './functions/define.js'\nimport {\n  EVALUATE_OPTION_KEYS,\n  contextOf,\n  evaluationLimits,\n  hostDataFailure,\n  invalidContext,\n  isValidDate,\n  validationBudget,\n} from './program.js'\nimport {\n  type EvaluateOptions,\n  type ExplainOptions,\n  type Explanation,\n  type Features,\n  type ProgramCore,\n  type ProgramFeatures,\n} from './environment.js'\nimport {\n  forTranslation,\n  partiallyEvaluate,\n  residualTexts,\n  type PartialOptions,\n  type PartialResult,\n} from './partial.js'\nimport { isStackOverflow, tooDeep } from './runtime/overflow.js'\nimport { State } from './runtime/state.js'\nimport {\n  DEFAULT_MAX_ITERATIONS,\n  DEFAULT_MAX_TRACE_NODES,\n  SNAPSHOT_ENTRIES,\n  Tracer,\n  freezeAll,\n  reasonsOf,\n  renderTrace,\n  snapshot,\n  snapshotTrace,\n  type ExplanationJSON,\n  type Parts,\n} from './runtime/trace.js'\nimport { isMap, keyListCost } from './runtime/values.js'\nimport { forEachChild, type CallNode, type Node } from './syntax/ast.js'\nimport { BLOCKED_NAMES, isName } from './syntax/lexer.js'\nimport type { Type } from './types.js'\n\n/** Subtrees compiled for partial evaluation, in nodes, kept per program: this times its own. */\nconst SUBTREE_CACHE_FACTOR = 2\n\nconst EXPLAIN_OPTION_KEYS: ReadonlySet<string> = new Set([\n  ...EVALUATE_OPTION_KEYS,\n  'maxIterations',\n  'maxTraceNodes',\n  'exhaustive',\n])\n\ninterface ExplainSettings {\n  readonly maxIterations: number\n  readonly maxNodes: number\n  readonly exhaustive: boolean\n  /** The evaluation options among them, validated by evaluationLimits. */\n  readonly evaluate: EvaluateOptions | undefined\n}\n\n/** Reads explain options once, with the same TypeError/RangeError rules as evaluate's. */\nfunction explainSettings(options: unknown): ExplainSettings {\n  if (options === undefined) {\n    return {\n      maxIterations: DEFAULT_MAX_ITERATIONS,\n      maxNodes: DEFAULT_MAX_TRACE_NODES,\n      exhaustive: false,\n      evaluate: undefined,\n    }\n  }\n  if (typeof options !== 'object' || options === null || Array.isArray(options))\n    throw new TypeError('Explain options must be an object')\n  let copy: Record<string, unknown>\n  try {\n    copy = { ...(options as Record<string, unknown>) }\n  } catch {\n    throw new TypeError('Explain options could not be read')\n  }\n  for (const key of Object.keys(copy)) {\n    if (!EXPLAIN_OPTION_KEYS.has(key)) {\n      throw new TypeError(\n        `Unknown explain option key \"${key}\" (expected one of: ${[...EXPLAIN_OPTION_KEYS].join(', ')})`,\n      )\n    }\n  }\n  const count = (name: string, fallback: number): number => {\n    const value = copy[name]\n    if (value === undefined) return fallback\n    if (typeof value !== 'number') throw new TypeError(`Explain option \"${name}\" must be a number`)\n    if (!Number.isSafeInteger(value) || value < 0)\n      throw new RangeError(`Explain option \"${name}\" must be a non-negative integer`)\n    return value\n  }\n  if (copy.exhaustive !== undefined && typeof copy.exhaustive !== 'boolean')\n    throw new TypeError('Explain option \"exhaustive\" must be a boolean')\n  const {\n    maxIterations: _iterations,\n    maxTraceNodes: _nodes,\n    exhaustive: _exhaustive,\n    ...evaluate\n  } = copy\n  return {\n    maxIterations: count('maxIterations', DEFAULT_MAX_ITERATIONS),\n    maxNodes: count('maxTraceNodes', DEFAULT_MAX_TRACE_NODES),\n    exhaustive: copy.exhaustive === true,\n    evaluate,\n  }\n}\n\nconst PARTIAL_OPTION_KEYS: ReadonlySet<string> = new Set([\n  'unknown',\n  'callHostFunctions',\n  'now',\n  'maxSteps',\n  'timeout',\n  'signal',\n])\n/** A variable name, then field names as reads spell them: none empty or blocked. */\nconst isPath = (path: unknown): boolean => {\n  if (typeof path !== 'string') return false\n  const [name, ...fields] = path.split('.')\n  return isName(name) && fields.every((field) => field !== '' && !BLOCKED_NAMES.has(field))\n}\n\n/** Reads partial() options once, with the same TypeError rules as the other options. */\nfunction partialOptions(options: unknown): PartialOptions {\n  if (options === undefined) return {}\n  if (typeof options !== 'object' || options === null || Array.isArray(options))\n    throw new TypeError('Partial options must be an object')\n  let copy: Record<string, unknown>\n  try {\n    copy = { ...(options as Record<string, unknown>) }\n    if (Array.isArray(copy.unknown)) copy.unknown = [...(copy.unknown as unknown[])]\n  } catch {\n    throw new TypeError('Partial options could not be read')\n  }\n  for (const key of Object.keys(copy)) {\n    if (!PARTIAL_OPTION_KEYS.has(key)) {\n      throw new TypeError(\n        `Unknown partial option key \"${key}\" (expected one of: ${[...PARTIAL_OPTION_KEYS].join(', ')})`,\n      )\n    }\n  }\n  const unknown = copy.unknown\n  if (unknown !== undefined && (!Array.isArray(unknown) || !unknown.every(isPath)))\n    throw new TypeError('Partial option \"unknown\" must be a list of variable names or dotted paths')\n  if (copy.callHostFunctions !== undefined && typeof copy.callHostFunctions !== 'boolean')\n    throw new TypeError('Partial option \"callHostFunctions\" must be a boolean')\n  if (copy.now !== undefined && !isValidDate(copy.now))\n    throw new TypeError('Partial option \"now\" must be a valid Date')\n  return copy\n}\n\n/** Paths listed as unknown, as a tree of segments: `whole` marks a listed path. */\ninterface UnknownTree {\n  whole: boolean\n  readonly next: Map<string, UnknownTree>\n}\n\nfunction unknownTree(paths: readonly string[]): UnknownTree {\n  const root: UnknownTree = { whole: false, next: new Map() }\n  for (const path of paths) {\n    let node = root\n    for (const segment of path.split('.')) {\n      let child = node.next.get(segment)\n      if (child === undefined) node.next.set(segment, (child = { whole: false, next: new Map() }))\n      node = child\n    }\n    node.whole = true\n  }\n  return root\n}\n\n/**\n * Why `value` does not conform to `type`, leaving out the parts of it under\n * listed unknown paths (`skip`): those are incomplete by design. Everything\n * else is checked as evaluation checks a context.\n */\nfunction describeKnown(\n  value: unknown,\n  type: Type,\n  path: string,\n  skip: UnknownTree | undefined,\n  budget: ValidationBudget,\n): string | undefined {\n  if (skip === undefined) return describeMismatch(value, type, path, budget)\n  if (skip.whole) return undefined\n  if (type.kind === 'union') {\n    let first: string | undefined\n    for (const member of type.types) {\n      const problem = describeKnown(value, member, path, skip, budget)\n      if (problem === undefined) return undefined\n      first ??= problem\n    }\n    return first\n  }\n  const actual = value === undefined ? null : value\n  if (type.kind !== 'map' || !isMap(actual)) return describeMismatch(value, type, path, budget)\n  if (--budget.remaining < 0) budget.onExhausted('steps')\n  for (const [key, fieldType] of Object.entries(type.fields)) {\n    const field = Object.hasOwn(actual, key) ? actual[key] : null\n    const problem = describeKnown(field, fieldType, `${path}.${key}`, skip.next.get(key), budget)\n    if (problem !== undefined) return problem\n  }\n  if (type.rest === undefined) return undefined\n  const keys = Object.keys(actual)\n  budget.remaining -= keyListCost(keys.length)\n  if (budget.remaining < 0) budget.onExhausted('steps')\n  for (const key of keys) {\n    // As evaluation's validation: keys the language never reads, or that hold undefined, are not data.\n    if (Object.hasOwn(type.fields, key) || BLOCKED_NAMES.has(key) || actual[key] === undefined)\n      continue\n    const problem = describeKnown(\n      actual[key],\n      type.rest,\n      `${path}.${key}`,\n      skip.next.get(key),\n      budget,\n    )\n    if (problem !== undefined) return problem\n  }\n  return undefined\n}\n\nfunction programFeatures<Ctx, R>(core: ProgramCore<R>): ProgramFeatures<Ctx, R> {\n  const {\n    source,\n    analysis,\n    expect,\n    settings,\n    checkEnv,\n    compileOptions,\n    residualOf,\n    prepare,\n    checked,\n    settle,\n  } = core\n\n  let traceSync: CompiledProgram | undefined\n  let traceAsync: CompiledProgram | undefined\n\n  function explanation(\n    tracer: Tracer,\n    outcome: { ok: true; value: R } | { ok: false; error: BonsaiError },\n  ): Explanation<R> {\n    const trace = tracer.finish()\n    // A result refused after the run (a promise-like value, a failed `expect`\n    // check) is the whole expression's failure: marked on the root.\n    if (!outcome.ok && trace.evaluated && trace.error === undefined) {\n      trace.error = { code: outcome.error.code, message: outcome.error.message }\n      delete trace.value\n    }\n    const truncated = tracer.truncated\n    // Every rendering of this explanation lists a map's keys once, however it is sliced.\n    const { listings } = tracer\n    // Taken once, the first time any part is serialized: one budget for the\n    // whole snapshot, however often a value recurs or the traces are sliced.\n    let json: ExplanationJSON | undefined\n    const parts: Parts = new WeakMap()\n    const toJSON = (): ExplanationJSON => {\n      if (json !== undefined) return json\n      const budget = { left: SNAPSHOT_ENTRIES, keys: listings }\n      const result = outcome.ok\n        ? { ok: true as const, value: snapshot(outcome.value, budget) }\n        : { ok: false as const, error: outcome.error.toJSON() }\n      // Frozen: every serialization (and every part of it) is this same snapshot.\n      return (json = freezeAll({\n        ...result,\n        truncated,\n        trace: snapshotTrace(trace, budget, parts),\n      }))\n    }\n    tracer.parts = () => (toJSON(), parts)\n    return Object.freeze({\n      ...outcome,\n      trace,\n      truncated,\n      reasons: () => reasonsOf(trace, listings),\n      toString: () => renderTrace(trace, truncated, listings),\n      toJSON,\n    })\n  }\n\n  function failure(error: unknown): { ok: false; error: BonsaiError } {\n    return { ok: false, error: escaping(hostDataFailure(error, source)) }\n  }\n\n  // A residual's nodes keep the original's offsets (or none, for known\n  // values), so their text comes from the printed residual instead: mapped\n  // once, the first time the residual is explained.\n  let residualText: ReadonlyMap<Node, string> | undefined\n  const residualTextMap = (printed: string): ReadonlyMap<Node, string> =>\n    (residualText ??= residualTexts(analysis.root, printed, {\n      maxSourceLength: Math.max(settings.parseLimits.maxSourceLength, printed.length),\n      // Printing adds parentheses (and unary minus for negative literals).\n      maxDepth: settings.parseLimits.maxDepth * 4,\n      maxNodes: settings.parseLimits.maxNodes * 4,\n    }))\n  const textOfResidual =\n    residualOf === undefined\n      ? undefined\n      : (node: Node): string => residualTextMap(residualOf.source).get(node) ?? ''\n\n  function tracerFor(explain: ExplainSettings): Tracer {\n    return new Tracer(\n      source,\n      analysis.root,\n      explain.maxIterations,\n      explain.maxNodes,\n      explain.exhaustive,\n      textOfResidual,\n    )\n  }\n\n  /** With `promised`, a thenable result fails as evaluate() fails it (see settle). */\n  function explainSync(\n    context: unknown,\n    options: ExplainOptions | undefined,\n    promised = false,\n  ): Explanation<R> {\n    const explain = explainSettings(options)\n    if (analysis.async) {\n      return explanation(\n        tracerFor(explain),\n        failure(\n          raised(\n            new BonsaiRuntimeError(\n              'ASYNC_IN_SYNC',\n              'This expression calls an async function; use explain() instead of explainSync()',\n              { source },\n            ),\n          ),\n        ),\n      )\n    }\n    const code = (traceSync ??= compileProgram(analysis, 'sync', {\n      ...compileOptions,\n      trace: true,\n    }))\n    const limits = evaluationLimits(explain.evaluate, settings)\n    const ctx = contextOf(context)\n    const state = new State(settings.runtimeLimits, settings.clock)\n    // A residual's text is mapped once per residual, work its partial()\n    // already charged, so explaining costs the steps evaluating does.\n    let tracer: Tracer | undefined\n    try {\n      prepare(state, ctx, limits, code.localCount)\n      tracer = tracerFor(explain)\n      state.tracer = tracer\n      const value = code.run(state) as R\n      checked(value, state)\n      state.checkTime()\n      if (promised) settle(value)\n      return explanation(tracer, { ok: true, value })\n    } catch (error) {\n      return explanation(tracer ?? tracerFor(explain), failure(error))\n    } finally {\n      state.release()\n    }\n  }\n\n  async function explainAsync(\n    context: unknown,\n    options: ExplainOptions | undefined,\n  ): Promise<Explanation<R>> {\n    if (!analysis.async) return explainSync(context, options, true)\n    const explain = explainSettings(options)\n    const code = (traceAsync ??= compileProgram(analysis, 'async', {\n      ...compileOptions,\n      trace: true,\n    }))\n    const limits = evaluationLimits(explain.evaluate, settings)\n    const ctx = contextOf(context)\n    const state = new State(settings.runtimeLimits, settings.clock)\n    let tracer: Tracer | undefined\n    try {\n      prepare(state, ctx, limits, code.localCount)\n      tracer = tracerFor(explain)\n      state.tracer = tracer\n      const value = ((await code.run(state)) as Out).v as R\n      // In evaluate()'s order: the expected type, the deadline, then a promise-like value.\n      checked(value, state)\n      state.checkTime()\n      settle(value)\n      return explanation(tracer, { ok: true, value })\n    } catch (error) {\n      return explanation(tracer ?? tracerFor(explain), failure(error))\n    } finally {\n      state.release()\n    }\n  }\n\n  // Each call the original program checked, by its source span and name. A\n  // residual keeps the spans of the calls it copies, so it can run each one\n  // with the overloads the original chose from the declared types: checking\n  // the residual again would see other types (a known branch removed, an\n  // open environment) and could pick another overload.\n  let callsBySpan: Map<string, CallPlan | null> | undefined\n  const callKey = (call: CallNode): string => `${call.start}:${call.end}:${call.name}`\n\n  function originalPlans(\n    compiled: Node,\n    checkedCalls: ReadonlyMap<CallNode, CallPlan>,\n  ): ReadonlyMap<CallNode, CallPlan> {\n    if (callsBySpan === undefined) {\n      callsBySpan = new Map()\n      for (const [call, plan] of analysis.calls) {\n        const key = callKey(call)\n        // Two calls with one span cannot be told apart; neither is reused.\n        callsBySpan.set(key, callsBySpan.has(key) ? null : plan)\n      }\n    }\n    const bySpan = callsBySpan\n    const plans = new Map(checkedCalls)\n    const visit = (node: Node): void => {\n      if (node.type === 'Call') {\n        const plan = bySpan.get(callKey(node))\n        if (plan !== undefined && plan !== null) plans.set(node, plan)\n      }\n      forEachChild(node, visit)\n    }\n    visit(compiled)\n    return plans\n  }\n\n  // Sub-trees compiled on their own for partial evaluation, by free locals.\n  // Which subtrees are closed depends on the data, so the cache holds at most\n  // a few times the program's own nodes, and starts over when full.\n  let subtrees = new Map<Node, Map<string, CompiledProgram>>()\n  let subtreeNodes = 0\n\n  function partial(\n    known: Record<string, unknown>,\n    rawOptions: unknown,\n    translation = false,\n  ): PartialResult<Ctx, R> {\n    const options = partialOptions(rawOptions)\n    // One budget for the whole partial evaluation, validated as evaluation's is.\n    const limits = evaluationLimits(\n      { maxSteps: options.maxSteps, timeout: options.timeout, signal: options.signal },\n      settings,\n    )\n    const context = contextOf(known)\n    const now = options.now\n    const state = new State(settings.runtimeLimits, now === undefined ? settings.clock : () => now)\n    state.reset(context, source, 0, limits.maxSteps, limits.timeout, limits.signal)\n    try {\n      // Known variables are validated as evaluation validates them, all but\n      // the parts under listed unknown paths (incomplete by design): all the\n      // data a residual has folded in is checked here, once.\n      if (settings.validateContext && settings.variables !== undefined) {\n        const variables = settings.variables\n        const skip = unknownTree(options.unknown ?? [])\n        try {\n          const budget = validationBudget(source, {\n            maxDepth: settings.runtimeLimits.maxValueDepth,\n            maxSteps: limits.maxSteps,\n            timeout: limits.timeout,\n          })\n          for (const [name, type] of Object.entries(variables)) {\n            if (!Object.hasOwn(context, name)) continue\n            const problem = describeKnown(context[name], type, name, skip.next.get(name), budget)\n            invalidContext(problem, source)\n          }\n        } catch (error) {\n          // Validation only reads the known data, so any other failure is the host's.\n          if (!isOwn(error)) throw hostDataFailure(error, source)\n          if (error instanceof BonsaiRuntimeError) return { status: 'error', error }\n          throw error\n        }\n      }\n      const result = partiallyEvaluate<R>(\n        {\n          analysis,\n          hostKind: (name) => {\n            const def = settings.host.get(name)\n            return def === undefined\n              ? undefined\n              : { async: def.async === true, call: def.call === true }\n          },\n          charge: (steps = 1) => {\n            state.charge(steps)\n          },\n          checkTime: () => {\n            state.checkTime()\n          },\n          listLimit: (length, at) => {\n            state.listLimit(length, at)\n          },\n          // Translation reads the residual tree, never its printed source.\n          maxSourceLength: translation ? Infinity : settings.parseLimits.maxSourceLength,\n          readKnown: (read) => {\n            try {\n              return read()\n            } catch (error) {\n              throw hostDataFailure(error, source)\n            }\n          },\n          evaluate: (node, locals, size, total) => {\n            const key = locals.map(([name]) => name).join('\\u0000')\n            let code = subtrees.get(node)?.get(key)\n            if (code === undefined) {\n              if (subtreeNodes + size > SUBTREE_CACHE_FACTOR * total) {\n                subtrees = new Map()\n                subtreeNodes = 0\n              }\n              code = compileProgram({ ...analysis, root: node }, 'sync', {\n                locals: locals.map(([name]) => name),\n              })\n              let byLocals = subtrees.get(node)\n              if (byLocals === undefined) subtrees.set(node, (byLocals = new Map()))\n              byLocals.set(key, code)\n              subtreeNodes += size\n            }\n            state.ensureLocals(code.localCount)\n            locals.forEach(([, value], slot) => {\n              state.locals[slot] = value\n            })\n            try {\n              return code.run(state)\n            } catch (error) {\n              throw hostDataFailure(error, source)\n            }\n          },\n          evaluateFolded: (node, origin, locals) => {\n            const plan = origin.type === 'Call' ? analysis.calls.get(origin) : undefined\n            const code = compileProgram(\n              {\n                ...analysis,\n                root: node,\n                calls: plan === undefined ? new Map() : new Map([[node as CallNode, plan]]),\n              },\n              'sync',\n              { locals: locals.map(([name]) => name) },\n            )\n            state.ensureLocals(code.localCount)\n            locals.forEach(([, value], slot) => {\n              state.locals[slot] = value\n            })\n            try {\n              return code.run(state)\n            } catch (error) {\n              throw hostDataFailure(error, source)\n            }\n          },\n          compileResidual: (\n            residual,\n            bindings,\n            residualSource,\n            readsContext,\n            knownRoots,\n            dependsOn,\n          ) => {\n            // The original expression passed the checker; inlining known\n            // values can make a failing branch statically visible, and that\n            // failure must happen at run time, as it would have, so findings\n            // here do not stop compilation. Analyzed as a tree (not\n            // re-parsed), so the printer's parentheses cannot push it past\n            // the parse depth limit.\n            const reanalyzed: Analysis = analyze(\n              residual,\n              { ...checkEnv, variables: undefined, strict: false },\n              { expected: expect },\n            )\n            return core.residual(\n              // The plans go on the calls of the tree that is compiled: the\n              // analysis root, where implicit lambdas are explicit nodes.\n              { ...reanalyzed, calls: originalPlans(reanalyzed.root, reanalyzed.calls) },\n              new Map(Object.entries(bindings)),\n              {\n                source: residualSource,\n                readsContext,\n                knownRoots,\n                dependsOn,\n                shapes: state.shapes,\n              },\n            )\n          },\n        },\n        context,\n        options,\n      )\n      // A decided result still has to match `expect`, as evaluation would check it.\n      if (result.status === 'value') {\n        try {\n          checked(result.value, state)\n        } catch (error) {\n          // Checking reads the value, which can be host data.\n          if (!isOwn(error)) throw hostDataFailure(error, source)\n          if (error instanceof BonsaiRuntimeError) return { status: 'error', error }\n          throw error\n        }\n      }\n      // The residual accepts any object at run time; its parameter is typed by this program's context.\n      return result as PartialResult<Ctx, R>\n    } catch (error) {\n      // Host data is read through readKnown, evaluate, and the checks above,\n      // which report its failures as HOST_ERROR; anything else is a failure\n      // of the engine itself, not of the caller's data, so it is not relabeled.\n      if (isStackOverflow(error)) throw tooDeep(source, error)\n      throw error\n    } finally {\n      state.release()\n    }\n  }\n\n  return {\n    explainSync,\n    explainAsync,\n    partial(program, known, options) {\n      const translation = forTranslation(program)\n      let result: PartialResult<Ctx, R>\n      try {\n        result = partial(known as Record<string, unknown>, options, translation)\n      } catch (error) {\n        throw escaping(error)\n      }\n      if (result.status === 'error') escaping(result.error)\n      return Object.freeze(result)\n    },\n  }\n}\n\n/** Explaining and partial evaluation, for the main entry point's environments. */\nexport const explainAndPartial: Features = { program: programFeatures }\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAuDA,MAAM,uBAAuB;AAE7B,MAAM,sCAA2C,IAAI,IAAI;CACvD,GAAG;CACH;CACA;CACA;AACF,CAAC;;AAWD,SAAS,gBAAgB,SAAmC;CAC1D,IAAI,YAAY,KAAA,GACd,OAAO;EACL,eAAA;EACA,UAAU;EACV,YAAY;EACZ,UAAU,KAAA;CACZ;CAEF,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,MAAM,QAAQ,OAAO,GAC1E,MAAM,IAAI,UAAU,mCAAmC;CACzD,IAAI;CACJ,IAAI;EACF,OAAO,EAAE,GAAI,QAAoC;CACnD,QAAQ;EACN,MAAM,IAAI,UAAU,mCAAmC;CACzD;CACA,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAChC,IAAI,CAAC,oBAAoB,IAAI,GAAG,GAC9B,MAAM,IAAI,UACR,+BAA+B,IAAI,sBAAsB,CAAC,GAAG,mBAAmB,CAAC,CAAC,KAAK,IAAI,EAAE,EAC/F;CAGJ,MAAM,SAAS,MAAc,aAA6B;EACxD,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,IAAI,OAAO,UAAU,UAAU,MAAM,IAAI,UAAU,mBAAmB,KAAK,mBAAmB;EAC9F,IAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAC1C,MAAM,IAAI,WAAW,mBAAmB,KAAK,iCAAiC;EAChF,OAAO;CACT;CACA,IAAI,KAAK,eAAe,KAAA,KAAa,OAAO,KAAK,eAAe,WAC9D,MAAM,IAAI,UAAU,iDAA+C;CACrE,MAAM,EACJ,eAAe,aACf,eAAe,QACf,YAAY,aACZ,GAAG,aACD;CACJ,OAAO;EACL,eAAe,MAAM,iBAAA,EAAuC;EAC5D,UAAU,MAAM,iBAAiB,uBAAuB;EACxD,YAAY,KAAK,eAAe;EAChC;CACF;AACF;AAEA,MAAM,sCAA2C,IAAI,IAAI;CACvD;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AAED,MAAM,UAAU,SAA2B;CACzC,IAAI,OAAO,SAAS,UAAU,OAAO;CACrC,MAAM,CAAC,MAAM,GAAG,UAAU,KAAK,MAAM,GAAG;CACxC,OAAO,OAAO,IAAI,KAAK,OAAO,OAAO,UAAU,UAAU,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC;AAC1F;;AAGA,SAAS,eAAe,SAAkC;CACxD,IAAI,YAAY,KAAA,GAAW,OAAO,CAAC;CACnC,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,MAAM,QAAQ,OAAO,GAC1E,MAAM,IAAI,UAAU,mCAAmC;CACzD,IAAI;CACJ,IAAI;EACF,OAAO,EAAE,GAAI,QAAoC;EACjD,IAAI,MAAM,QAAQ,KAAK,OAAO,GAAG,KAAK,UAAU,CAAC,GAAI,KAAK,OAAqB;CACjF,QAAQ;EACN,MAAM,IAAI,UAAU,mCAAmC;CACzD;CACA,KAAK,MAAM,OAAO,OAAO,KAAK,IAAI,GAChC,IAAI,CAAC,oBAAoB,IAAI,GAAG,GAC9B,MAAM,IAAI,UACR,+BAA+B,IAAI,sBAAsB,CAAC,GAAG,mBAAmB,CAAC,CAAC,KAAK,IAAI,EAAE,EAC/F;CAGJ,MAAM,UAAU,KAAK;CACrB,IAAI,YAAY,KAAA,MAAc,CAAC,MAAM,QAAQ,OAAO,KAAK,CAAC,QAAQ,MAAM,MAAM,IAC5E,MAAM,IAAI,UAAU,6EAA2E;CACjG,IAAI,KAAK,sBAAsB,KAAA,KAAa,OAAO,KAAK,sBAAsB,WAC5E,MAAM,IAAI,UAAU,wDAAsD;CAC5E,IAAI,KAAK,QAAQ,KAAA,KAAa,CAAC,YAAY,KAAK,GAAG,GACjD,MAAM,IAAI,UAAU,6CAA2C;CACjE,OAAO;AACT;AAQA,SAAS,YAAY,OAAuC;CAC1D,MAAM,OAAoB;EAAE,OAAO;EAAO,sBAAM,IAAI,IAAI;CAAE;CAC1D,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,OAAO;EACX,KAAK,MAAM,WAAW,KAAK,MAAM,GAAG,GAAG;GACrC,IAAI,QAAQ,KAAK,KAAK,IAAI,OAAO;GACjC,IAAI,UAAU,KAAA,GAAW,KAAK,KAAK,IAAI,SAAU,QAAQ;IAAE,OAAO;IAAO,sBAAM,IAAI,IAAI;GAAE,CAAE;GAC3F,OAAO;EACT;EACA,KAAK,QAAQ;CACf;CACA,OAAO;AACT;;;;;;AAOA,SAAS,cACP,OACA,MACA,MACA,MACA,QACoB;CACpB,IAAI,SAAS,KAAA,GAAW,OAAO,iBAAiB,OAAO,MAAM,MAAM,MAAM;CACzE,IAAI,KAAK,OAAO,OAAO,KAAA;CACvB,IAAI,KAAK,SAAS,SAAS;EACzB,IAAI;EACJ,KAAK,MAAM,UAAU,KAAK,OAAO;GAC/B,MAAM,UAAU,cAAc,OAAO,QAAQ,MAAM,MAAM,MAAM;GAC/D,IAAI,YAAY,KAAA,GAAW,OAAO,KAAA;GAClC,UAAU;EACZ;EACA,OAAO;CACT;CACA,MAAM,SAAS,UAAU,KAAA,IAAY,OAAO;CAC5C,IAAI,KAAK,SAAS,SAAS,CAAC,MAAM,MAAM,GAAG,OAAO,iBAAiB,OAAO,MAAM,MAAM,MAAM;CAC5F,IAAI,EAAE,OAAO,YAAY,GAAG,OAAO,YAAY,OAAO;CACtD,KAAK,MAAM,CAAC,KAAK,cAAc,OAAO,QAAQ,KAAK,MAAM,GAAG;EAE1D,MAAM,UAAU,cADF,OAAO,OAAO,QAAQ,GAAG,IAAI,OAAO,OAAO,MACpB,WAAW,GAAG,KAAK,GAAG,OAAO,KAAK,KAAK,IAAI,GAAG,GAAG,MAAM;EAC5F,IAAI,YAAY,KAAA,GAAW,OAAO;CACpC;CACA,IAAI,KAAK,SAAS,KAAA,GAAW,OAAO,KAAA;CACpC,MAAM,OAAO,OAAO,KAAK,MAAM;CAC/B,OAAO,aAAa,YAAY,KAAK,MAAM;CAC3C,IAAI,OAAO,YAAY,GAAG,OAAO,YAAY,OAAO;CACpD,KAAK,MAAM,OAAO,MAAM;EAEtB,IAAI,OAAO,OAAO,KAAK,QAAQ,GAAG,KAAK,cAAc,IAAI,GAAG,KAAK,OAAO,SAAS,KAAA,GAC/E;EACF,MAAM,UAAU,cACd,OAAO,MACP,KAAK,MACL,GAAG,KAAK,GAAG,OACX,KAAK,KAAK,IAAI,GAAG,GACjB,MACF;EACA,IAAI,YAAY,KAAA,GAAW,OAAO;CACpC;AAEF;AAEA,SAAS,gBAAwB,MAA+C;CAC9E,MAAM,EACJ,QACA,UACA,QACA,UACA,UACA,gBACA,YACA,SACA,SACA,WACE;CAEJ,IAAI;CACJ,IAAI;CAEJ,SAAS,YACP,QACA,SACgB;EAChB,MAAM,QAAQ,OAAO,OAAO;EAG5B,IAAI,CAAC,QAAQ,MAAM,MAAM,aAAa,MAAM,UAAU,KAAA,GAAW;GAC/D,MAAM,QAAQ;IAAE,MAAM,QAAQ,MAAM;IAAM,SAAS,QAAQ,MAAM;GAAQ;GACzE,OAAO,MAAM;EACf;EACA,MAAM,YAAY,OAAO;EAEzB,MAAM,EAAE,aAAa;EAGrB,IAAI;EACJ,MAAM,wBAAe,IAAI,QAAQ;EACjC,MAAM,eAAgC;GACpC,IAAI,SAAS,KAAA,GAAW,OAAO;GAC/B,MAAM,SAAS;IAAE,MAAM;IAAkB,MAAM;GAAS;GACxD,MAAM,SAAS,QAAQ,KACnB;IAAE,IAAI;IAAe,OAAO,SAAS,QAAQ,OAAO,MAAM;GAAE,IAC5D;IAAE,IAAI;IAAgB,OAAO,QAAQ,MAAM,OAAO;GAAE;GAExD,OAAQ,OAAO,UAAU;IACvB,GAAG;IACH;IACA,OAAO,cAAc,OAAO,QAAQ,KAAK;GAC3C,CAAC;EACH;EACA,OAAO,eAAe,OAAO,GAAG;EAChC,OAAO,OAAO,OAAO;GACnB,GAAG;GACH;GACA;GACA,eAAe,UAAU,OAAO,QAAQ;GACxC,gBAAgB,YAAY,OAAO,WAAW,QAAQ;GACtD;EACF,CAAC;CACH;CAEA,SAAS,QAAQ,OAAmD;EAClE,OAAO;GAAE,IAAI;GAAO,OAAO,SAAS,gBAAgB,OAAO,MAAM,CAAC;EAAE;CACtE;CAKA,IAAI;CACJ,MAAM,mBAAmB,YACtB,iBAAiB,cAAc,SAAS,MAAM,SAAS;EACtD,iBAAiB,KAAK,IAAI,SAAS,YAAY,iBAAiB,QAAQ,MAAM;EAE9E,UAAU,SAAS,YAAY,WAAW;EAC1C,UAAU,SAAS,YAAY,WAAW;CAC5C,CAAC;CACH,MAAM,iBACJ,eAAe,KAAA,IACX,KAAA,KACC,SAAuB,gBAAgB,WAAW,MAAM,CAAC,CAAC,IAAI,IAAI,KAAK;CAE9E,SAAS,UAAU,SAAkC;EACnD,OAAO,IAAI,OACT,QACA,SAAS,MACT,QAAQ,eACR,QAAQ,UACR,QAAQ,YACR,cACF;CACF;;CAGA,SAAS,YACP,SACA,SACA,WAAW,OACK;EAChB,MAAM,UAAU,gBAAgB,OAAO;EACvC,IAAI,SAAS,OACX,OAAO,YACL,UAAU,OAAO,GACjB,QACE,OACE,IAAI,mBACF,iBACA,mFACA,EAAE,OAAO,CACX,CACF,CACF,CACF;EAEF,MAAM,OAAQ,cAAc,eAAe,UAAU,QAAQ;GAC3D,GAAG;GACH,OAAO;EACT,CAAC;EACD,MAAM,SAAS,iBAAiB,QAAQ,UAAU,QAAQ;EAC1D,MAAM,MAAM,UAAU,OAAO;EAC7B,MAAM,QAAQ,IAAI,MAAM,SAAS,eAAe,SAAS,KAAK;EAG9D,IAAI;EACJ,IAAI;GACF,QAAQ,OAAO,KAAK,QAAQ,KAAK,UAAU;GAC3C,SAAS,UAAU,OAAO;GAC1B,MAAM,SAAS;GACf,MAAM,QAAQ,KAAK,IAAI,KAAK;GAC5B,QAAQ,OAAO,KAAK;GACpB,MAAM,UAAU;GAChB,IAAI,UAAU,OAAO,KAAK;GAC1B,OAAO,YAAY,QAAQ;IAAE,IAAI;IAAM;GAAM,CAAC;EAChD,SAAS,OAAO;GACd,OAAO,YAAY,UAAU,UAAU,OAAO,GAAG,QAAQ,KAAK,CAAC;EACjE,UAAU;GACR,MAAM,QAAQ;EAChB;CACF;CAEA,eAAe,aACb,SACA,SACyB;EACzB,IAAI,CAAC,SAAS,OAAO,OAAO,YAAY,SAAS,SAAS,IAAI;EAC9D,MAAM,UAAU,gBAAgB,OAAO;EACvC,MAAM,OAAQ,eAAe,eAAe,UAAU,SAAS;GAC7D,GAAG;GACH,OAAO;EACT,CAAC;EACD,MAAM,SAAS,iBAAiB,QAAQ,UAAU,QAAQ;EAC1D,MAAM,MAAM,UAAU,OAAO;EAC7B,MAAM,QAAQ,IAAI,MAAM,SAAS,eAAe,SAAS,KAAK;EAC9D,IAAI;EACJ,IAAI;GACF,QAAQ,OAAO,KAAK,QAAQ,KAAK,UAAU;GAC3C,SAAS,UAAU,OAAO;GAC1B,MAAM,SAAS;GACf,MAAM,SAAU,MAAM,KAAK,IAAI,KAAK,EAAA,CAAW;GAE/C,QAAQ,OAAO,KAAK;GACpB,MAAM,UAAU;GAChB,OAAO,KAAK;GACZ,OAAO,YAAY,QAAQ;IAAE,IAAI;IAAM;GAAM,CAAC;EAChD,SAAS,OAAO;GACd,OAAO,YAAY,UAAU,UAAU,OAAO,GAAG,QAAQ,KAAK,CAAC;EACjE,UAAU;GACR,MAAM,QAAQ;EAChB;CACF;CAOA,IAAI;CACJ,MAAM,WAAW,SAA2B,GAAG,KAAK,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK;CAE9E,SAAS,cACP,UACA,cACiC;EACjC,IAAI,gBAAgB,KAAA,GAAW;GAC7B,8BAAc,IAAI,IAAI;GACtB,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS,OAAO;IACzC,MAAM,MAAM,QAAQ,IAAI;IAExB,YAAY,IAAI,KAAK,YAAY,IAAI,GAAG,IAAI,OAAO,IAAI;GACzD;EACF;EACA,MAAM,SAAS;EACf,MAAM,QAAQ,IAAI,IAAI,YAAY;EAClC,MAAM,SAAS,SAAqB;GAClC,IAAI,KAAK,SAAS,QAAQ;IACxB,MAAM,OAAO,OAAO,IAAI,QAAQ,IAAI,CAAC;IACrC,IAAI,SAAS,KAAA,KAAa,SAAS,MAAM,MAAM,IAAI,MAAM,IAAI;GAC/D;GACA,aAAa,MAAM,KAAK;EAC1B;EACA,MAAM,QAAQ;EACd,OAAO;CACT;CAKA,IAAI,2BAAW,IAAI,IAAwC;CAC3D,IAAI,eAAe;CAEnB,SAAS,QACP,OACA,YACA,cAAc,OACS;EACvB,MAAM,UAAU,eAAe,UAAU;EAEzC,MAAM,SAAS,iBACb;GAAE,UAAU,QAAQ;GAAU,SAAS,QAAQ;GAAS,QAAQ,QAAQ;EAAO,GAC/E,QACF;EACA,MAAM,UAAU,UAAU,KAAK;EAC/B,MAAM,MAAM,QAAQ;EACpB,MAAM,QAAQ,IAAI,MAAM,SAAS,eAAe,QAAQ,KAAA,IAAY,SAAS,cAAc,GAAG;EAC9F,MAAM,MAAM,SAAS,QAAQ,GAAG,OAAO,UAAU,OAAO,SAAS,OAAO,MAAM;EAC9E,IAAI;GAIF,IAAI,SAAS,mBAAmB,SAAS,cAAc,KAAA,GAAW;IAChE,MAAM,YAAY,SAAS;IAC3B,MAAM,OAAO,YAAY,QAAQ,WAAW,CAAC,CAAC;IAC9C,IAAI;KACF,MAAM,SAAS,iBAAiB,QAAQ;MACtC,UAAU,SAAS,cAAc;MACjC,UAAU,OAAO;MACjB,SAAS,OAAO;KAClB,CAAC;KACD,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,SAAS,GAAG;MACpD,IAAI,CAAC,OAAO,OAAO,SAAS,IAAI,GAAG;MACnC,MAAM,UAAU,cAAc,QAAQ,OAAO,MAAM,MAAM,KAAK,KAAK,IAAI,IAAI,GAAG,MAAM;MACpF,eAAe,SAAS,MAAM;KAChC;IACF,SAAS,OAAO;KAEd,IAAI,CAAC,MAAM,KAAK,GAAG,MAAM,gBAAgB,OAAO,MAAM;KACtD,IAAI,iBAAiB,oBAAoB,OAAO;MAAE,QAAQ;MAAS;KAAM;KACzE,MAAM;IACR;GACF;GACA,MAAM,SAAS,kBACb;IACE;IACA,WAAW,SAAS;KAClB,MAAM,MAAM,SAAS,KAAK,IAAI,IAAI;KAClC,OAAO,QAAQ,KAAA,IACX,KAAA,IACA;MAAE,OAAO,IAAI,UAAU;MAAM,MAAM,IAAI,SAAS;KAAK;IAC3D;IACA,SAAS,QAAQ,MAAM;KACrB,MAAM,OAAO,KAAK;IACpB;IACA,iBAAiB;KACf,MAAM,UAAU;IAClB;IACA,YAAY,QAAQ,OAAO;KACzB,MAAM,UAAU,QAAQ,EAAE;IAC5B;IAEA,iBAAiB,cAAc,WAAW,SAAS,YAAY;IAC/D,YAAY,SAAS;KACnB,IAAI;MACF,OAAO,KAAK;KACd,SAAS,OAAO;MACd,MAAM,gBAAgB,OAAO,MAAM;KACrC;IACF;IACA,WAAW,MAAM,QAAQ,MAAM,UAAU;KACvC,MAAM,MAAM,OAAO,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,KAAK,IAAQ;KACtD,IAAI,OAAO,SAAS,IAAI,IAAI,CAAC,EAAE,IAAI,GAAG;KACtC,IAAI,SAAS,KAAA,GAAW;MACtB,IAAI,eAAe,OAAO,uBAAuB,OAAO;OACtD,2BAAW,IAAI,IAAI;OACnB,eAAe;MACjB;MACA,OAAO,eAAe;OAAE,GAAG;OAAU,MAAM;MAAK,GAAG,QAAQ,EACzD,QAAQ,OAAO,KAAK,CAAC,UAAU,IAAI,EACrC,CAAC;MACD,IAAI,WAAW,SAAS,IAAI,IAAI;MAChC,IAAI,aAAa,KAAA,GAAW,SAAS,IAAI,MAAO,2BAAW,IAAI,IAAI,CAAE;MACrE,SAAS,IAAI,KAAK,IAAI;MACtB,gBAAgB;KAClB;KACA,MAAM,aAAa,KAAK,UAAU;KAClC,OAAO,SAAS,GAAG,QAAQ,SAAS;MAClC,MAAM,OAAO,QAAQ;KACvB,CAAC;KACD,IAAI;MACF,OAAO,KAAK,IAAI,KAAK;KACvB,SAAS,OAAO;MACd,MAAM,gBAAgB,OAAO,MAAM;KACrC;IACF;IACA,iBAAiB,MAAM,QAAQ,WAAW;KACxC,MAAM,OAAO,OAAO,SAAS,SAAS,SAAS,MAAM,IAAI,MAAM,IAAI,KAAA;KACnE,MAAM,OAAO,eACX;MACE,GAAG;MACH,MAAM;MACN,OAAO,SAAS,KAAA,oBAAY,IAAI,IAAI,oBAAI,IAAI,IAAI,CAAC,CAAC,MAAkB,IAAI,CAAC,CAAC;KAC5E,GACA,QACA,EAAE,QAAQ,OAAO,KAAK,CAAC,UAAU,IAAI,EAAE,CACzC;KACA,MAAM,aAAa,KAAK,UAAU;KAClC,OAAO,SAAS,GAAG,QAAQ,SAAS;MAClC,MAAM,OAAO,QAAQ;KACvB,CAAC;KACD,IAAI;MACF,OAAO,KAAK,IAAI,KAAK;KACvB,SAAS,OAAO;MACd,MAAM,gBAAgB,OAAO,MAAM;KACrC;IACF;IACA,kBACE,UACA,UACA,gBACA,cACA,YACA,cACG;KAOH,MAAM,aAAuB,QAC3B,UACA;MAAE,GAAG;MAAU,WAAW,KAAA;MAAW,QAAQ;KAAM,GACnD,EAAE,UAAU,OAAO,CACrB;KACA,OAAO,KAAK,SAGV;MAAE,GAAG;MAAY,OAAO,cAAc,WAAW,MAAM,WAAW,KAAK;KAAE,GACzE,IAAI,IAAI,OAAO,QAAQ,QAAQ,CAAC,GAChC;MACE,QAAQ;MACR;MACA;MACA;MACA,QAAQ,MAAM;KAChB,CACF;IACF;GACF,GACA,SACA,OACF;GAEA,IAAI,OAAO,WAAW,SACpB,IAAI;IACF,QAAQ,OAAO,OAAO,KAAK;GAC7B,SAAS,OAAO;IAEd,IAAI,CAAC,MAAM,KAAK,GAAG,MAAM,gBAAgB,OAAO,MAAM;IACtD,IAAI,iBAAiB,oBAAoB,OAAO;KAAE,QAAQ;KAAS;IAAM;IACzE,MAAM;GACR;GAGF,OAAO;EACT,SAAS,OAAO;GAId,IAAI,gBAAgB,KAAK,GAAG,MAAM,QAAQ,QAAQ,KAAK;GACvD,MAAM;EACR,UAAU;GACR,MAAM,QAAQ;EAChB;CACF;CAEA,OAAO;EACL;EACA;EACA,QAAQ,SAAS,OAAO,SAAS;GAC/B,MAAM,cAAc,eAAe,OAAO;GAC1C,IAAI;GACJ,IAAI;IACF,SAAS,QAAQ,OAAkC,SAAS,WAAW;GACzE,SAAS,OAAO;IACd,MAAM,SAAS,KAAK;GACtB;GACA,IAAI,OAAO,WAAW,SAAS,SAAS,OAAO,KAAK;GACpD,OAAO,OAAO,OAAO,MAAM;EAC7B;CACF;AACF;;AAGA,MAAa,oBAA8B,EAAE,SAAS,gBAAgB"}