fascicle 0.12.0 → 0.12.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +70 -0
- package/README.md +15 -5
- package/dist/adapters.d.ts +1 -1
- package/dist/agents.d.ts +11 -2
- package/dist/agents.js +63 -20
- package/dist/agents.js.map +1 -1
- package/dist/bin/fascicle-viewer.js +2 -2
- package/dist/{core-BkB2l1-e.js → core-DDRhHu5P.js} +235 -56
- package/dist/core-DDRhHu5P.js.map +1 -0
- package/dist/engine-b4ZH8esY.js +7317 -0
- package/dist/engine-b4ZH8esY.js.map +1 -0
- package/dist/index.d.ts +158 -159
- package/dist/index.js +289 -7797
- package/dist/index.js.map +1 -1
- package/dist/{invoke-JkzNf7-Y.js → invoke-CyKNhvBw.js} +3 -3
- package/dist/{invoke-JkzNf7-Y.js.map → invoke-CyKNhvBw.js.map} +1 -1
- package/dist/mcp.d.ts +2 -2
- package/dist/mcp.js +1 -1
- package/dist/otel.d.ts +1 -1
- package/dist/static/viewer.html +2 -1
- package/dist/stdio.d.ts +1 -1
- package/dist/stdio.js +1 -1
- package/dist/testing.d.ts +66 -15
- package/dist/testing.js +199 -34
- package/dist/testing.js.map +1 -1
- package/dist/trajectory-cSLNlHzh.d.ts +114 -0
- package/dist/{types-CVdTBXE_.d.ts → types-BqUY6nRX.d.ts} +14 -2
- package/dist/{types-4l54cexm.d.ts → types-CXBB4aIM.d.ts} +8 -4
- package/dist/ui.d.ts +2 -2
- package/dist/viewer.d.ts +117 -0
- package/dist/viewer.js +658 -0
- package/dist/viewer.js.map +1 -0
- package/package.json +22 -9
- package/dist/core-BkB2l1-e.js.map +0 -1
- package/dist/leading_system-BVtGMweY.js +0 -307
- package/dist/leading_system-BVtGMweY.js.map +0 -1
package/dist/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","names":["throw_if_aborted","throw_if_aborted","e","is_record","round6","read_string","read_number","DEFAULT_BASE_URL","consume_sse_response","SUPPORTED","SUPPORTED","to_user_content","to_assistant_message","SUPPORTED","SUPPORTED","DEFAULT_BASE_URL","SUPPORTED","SUPPORTED","SUPPORTED","SUPPORTED","SUPPORTED","SUPPORTED","node_spawn","sum_usage","assemble_result","is_plain_object","assign_if_present","fs_watch"],"sources":["../src/schema/errors.ts","../src/schema/json_schema.ts","../src/composites/adversarial.ts","../src/composites/consensus.ts","../src/composites/ensemble.ts","../src/composites/ensemble_step.ts","../src/composites/improve.ts","../src/composites/learn.ts","../src/composites/tournament.ts","../src/composites/errors.ts","../src/composites/bench.ts","../src/composites/judges.ts","../src/composites/regression.ts","../src/engine/pricing.ts","../src/engine/retry.ts","../src/engine/providers/native_shared.ts","../src/engine/providers/sse_native.ts","../src/engine/providers/anthropic_native.ts","../src/engine/providers/anthropic.ts","../src/engine/providers/openai_compatible_native.ts","../src/engine/providers/openai.ts","../src/engine/providers/google.ts","../src/engine/providers/ollama_native.ts","../src/engine/providers/ollama.ts","../src/engine/providers/lmstudio.ts","../src/engine/providers/openrouter.ts","../src/engine/providers/bedrock.ts","../src/engine/providers/claude_cli/constants.ts","../src/engine/providers/claude_cli/auth.ts","../src/engine/providers/claude_cli/argv.ts","../src/engine/providers/claude_cli/sandbox.ts","../src/engine/providers/claude_cli/spawn.ts","../src/engine/providers/claude_cli/stream_parse.ts","../src/engine/providers/claude_cli/cost.ts","../src/engine/providers/claude_cli/stream_result.ts","../src/engine/schema.ts","../src/engine/trajectory.ts","../src/engine/providers/claude_cli/adapter.ts","../src/engine/providers/registry.ts","../src/engine/merge_defaults.ts","../src/engine/streaming.ts","../src/engine/usage.ts","../src/engine/tool_call_salvage.ts","../src/engine/tool_loop.ts","../src/engine/generate.ts","../src/engine/create_engine.ts","../src/model_call.ts","../src/forward_standard_env.ts","../src/viewer/broadcast.ts","../src/viewer/server.ts","../src/viewer/tail.ts","../src/viewer/start_viewer.ts","../src/viewer/cli.ts"],"sourcesContent":["/**\n * The one error this zone raises.\n *\n * It lives here rather than in core's taxonomy because core imports this zone,\n * and reaching back for an error class would close a cycle.\n */\n\nexport class schema_not_convertible_error extends Error {\n // Part of the published discriminant surface: consumers switch on `kind`\n // outside this repo, so the field has no in-repo production reader.\n // fallow-ignore-next-line unused-class-member\n readonly kind = 'schema_not_convertible_error' as const;\n readonly vendor: string;\n constructor(vendor: string, message?: string) {\n super(\n message ??\n `schema vendor '${vendor}' does not implement Standard JSON Schema, so it cannot be sent to a model as JSON Schema`,\n )\n this.name = 'schema_not_convertible_error'\n this.vendor = vendor\n }\n}\n","/**\n * JSON Schema emission for schemas that reach a model.\n *\n * Standard JSON Schema exposes two directions, `input` and `output`. A tool\n * definition describes what the model should *produce*, so fascicle emits the\n * input direction: a field with a default is one the model may omit, and\n * saying otherwise asks it to supply a value the schema already supplies.\n *\n * The input direction alone is too loose, though. A vendor describes what it\n * will accept, and accepting unknown keys is the common default (zod's\n * `z.object` strips them, ArkType ignores them), so nothing in the emitted\n * schema stops a model inventing one. `close_objects` supplies that guard,\n * which is also what the strict and constrained-decode modes require. The AI\n * SDK composes the same two halves for every `kind: 'ai_sdk'` provider, so\n * this is what the majority of fascicle's transports already send.\n */\n\nimport { schema_not_convertible_error } from './errors.js'\nimport type { JsonSchemaOptions, ToolSchema } from './types.js'\n\nconst DEFAULT_TARGET = 'draft-2020-12'\n\n/**\n * Emit JSON Schema for `schema`, targeting draft-2020-12 unless told otherwise.\n *\n * `target` is passed explicitly on every call because the spec makes it a\n * required argument of the converter, even where a vendor tolerates its\n * omission. A vendor that implements Standard Schema but not Standard JSON\n * Schema raises `schema_not_convertible_error` naming itself, so the message\n * says which library to swap rather than just that something failed.\n */\nexport function to_json_schema(\n schema: ToolSchema,\n options: JsonSchemaOptions = {},\n): Record<string, unknown> {\n const props = schema['~standard']\n if (typeof props.jsonSchema?.input !== 'function') {\n throw new schema_not_convertible_error(props.vendor)\n }\n const json = close_objects(props.jsonSchema.input({ target: options.target ?? DEFAULT_TARGET }))\n return options.strip_meta === true ? strip_meta_keys(json) : json\n}\n\n/** Keys whose value is a bag of nested schemas, one per name. */\nconst SCHEMA_BAGS = ['properties', 'patternProperties', '$defs', 'definitions']\n\n/** Keys whose value is a nested schema, or a list of them. */\nconst SCHEMA_SLOTS = [\n 'items',\n 'additionalItems',\n 'additionalProperties',\n 'propertyNames',\n 'not',\n 'anyOf',\n 'allOf',\n 'oneOf',\n 'prefixItems',\n]\n\n/**\n * Add `additionalProperties: false` to every object node that does not already\n * constrain it, so the model is told which keys exist rather than left to\n * invent them.\n *\n * Two restraints keep this from asserting more than the vendor did. An\n * existing `additionalProperties` is never overwritten, so a deliberately open\n * schema (zod's `looseObject`, a `record`'s value schema, a server that\n * published `true`) stays open. And a node is only closed if it declares\n * `properties`: a bare `{ type: 'object' }` is how a freeform payload is\n * described, most visibly by an MCP server, and closing it would forbid every\n * key rather than constrain the listed ones. Every zod object emits\n * `properties`, `z.object({})` included, so the guard costs nothing there.\n *\n * The tree is rebuilt rather than mutated. The spec does not promise a fresh\n * object per call, and a vendor handing back a cached one would be corrupted\n * by an in-place stamp. Recursion terminates on any schema: a self-referential\n * schema emits `$ref`, which is a string, not a nested node.\n */\nfunction close_objects(node: Record<string, unknown>): Record<string, unknown> {\n const closed = close_nested(node)\n return needs_closing(closed) ? { ...closed, additionalProperties: false } : closed\n}\n\n/** Rebuild `node` with every schema it holds closed, leaving its own keys alone. */\nfunction close_nested(node: Record<string, unknown>): Record<string, unknown> {\n const closed: Record<string, unknown> = { ...node }\n for (const key of SCHEMA_BAGS) {\n const bag = closed[key]\n if (is_node(bag)) closed[key] = close_bag(bag)\n }\n for (const key of SCHEMA_SLOTS) {\n if (key in closed) closed[key] = close_value(closed[key])\n }\n return closed\n}\n\n/** Rebuild a name-to-schema bag with each of its schemas closed. */\nfunction close_bag(bag: Record<string, unknown>): Record<string, unknown> {\n const closed: Record<string, unknown> = {}\n for (const [name, value] of Object.entries(bag)) closed[name] = close_value(value)\n return closed\n}\n\n/** Recurse into a schema or a list of them, leaving anything else alone. */\nfunction close_value(value: unknown): unknown {\n if (Array.isArray(value)) return value.map(close_value)\n return is_node(value) ? close_objects(value) : value\n}\n\n/** True for an object node listing its keys but not saying whether more are allowed. */\nfunction needs_closing(node: Record<string, unknown>): boolean {\n if ('additionalProperties' in node || !('properties' in node)) return false\n const type = node['type']\n return type === 'object' || (Array.isArray(type) && type.includes('object'))\n}\n\n/** A JSON Schema node, as opposed to a boolean schema, a list, or a scalar. */\nfunction is_node(value: unknown): value is Record<string, unknown> {\n return typeof value === 'object' && value !== null && !Array.isArray(value)\n}\n\n/**\n * Drop the top-level `$schema` and `$id` keys.\n *\n * `claude --json-schema` rejects both, and the field constraints alone drive\n * constrained decode, so the CLI adapter asks for a stripped emission.\n */\nfunction strip_meta_keys(json: Record<string, unknown>): Record<string, unknown> {\n const { $schema: _schema, $id: _id, ...rest } = json\n return rest\n}\n","/**\n * adversarial: build-and-critique loop.\n *\n * This file is the canonical example of how a user-built composite is\n * structured: the entire implementation is a composition of core\n * primitives. Read it as documentation.\n */\n\nimport { compose, loop, scope, stash, step, use } from '#core'\nimport type { Step } from '#core'\n\nexport type AdversarialBuildInput<input, candidate> = {\n readonly input: input\n readonly prior?: candidate\n readonly critique?: string\n}\n\nexport type AdversarialCritiqueResult = { readonly notes: string } & Record<string, unknown>\n\nexport type AdversarialResult<candidate> = {\n readonly candidate: candidate\n readonly converged: boolean\n readonly rounds: number\n}\n\nexport type AdversarialConfig<input, candidate, projected = AdversarialResult<candidate>> = {\n readonly name?: string\n readonly build: Step<AdversarialBuildInput<input, candidate>, candidate>\n readonly critique: Step<candidate, AdversarialCritiqueResult>\n readonly accept: (critique_result: AdversarialCritiqueResult) => boolean\n readonly max_rounds: number\n readonly project?: (r: AdversarialResult<candidate>) => projected\n}\n\ntype AdversarialState<input, candidate> = {\n readonly input: input\n readonly candidate?: candidate\n readonly critique_notes?: string\n readonly last_critique?: AdversarialCritiqueResult\n}\n\n/**\n * Projects loop state into the build step's input.\n *\n * Omits `prior` and `critique` until they exist, so the first round's build\n * sees only the original input and later rounds see what came before.\n */\nfunction build_input_from_state<i, c>(\n s: AdversarialState<i, c>,\n): AdversarialBuildInput<i, c> {\n if (s.candidate === undefined) return { input: s.input }\n if (s.critique_notes === undefined) return { input: s.input, prior: s.candidate }\n return { input: s.input, prior: s.candidate, critique: s.critique_notes }\n}\n\n/**\n * Builds a Step that runs up to `max_rounds` iterations of build ->\n * critique -> accept.\n *\n * Each round builds a candidate (receiving the prior candidate and critique\n * notes when available), critiques it, then checks `accept(critique_result)`.\n * Returns `{ candidate, converged, rounds }`. Does not throw on\n * non-convergence; `converged: false` reports it instead. `project` maps\n * that envelope into the step's output (e.g. `(r) => r.candidate`); omitted,\n * the envelope itself is the output.\n *\n * Implemented as a `compose`d `loop` whose body builds a new candidate and\n * whose guard runs the critique step and checks `accept`. State is threaded\n * through `scope`/`stash`/`use` so the build and critique steps remain\n * unmodified user-supplied `Step` values.\n */\nexport function adversarial<input, candidate, projected = AdversarialResult<candidate>>(\n config: AdversarialConfig<input, candidate, projected>,\n): Step<input, projected> {\n const { build, critique, accept, max_rounds } = config\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: AdversarialResult<candidate>) => r as unknown as projected)\n\n type S = AdversarialState<input, candidate>\n\n const body: Step<S, S> = scope([\n stash('state', step('snapshot', (s: S) => s)),\n step('to_build_input', (s: S) => build_input_from_state(s)),\n build,\n use(['state'], (vars, candidate: candidate) => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars['state'] as S\n return { ...prior, candidate }\n }),\n ])\n\n const guard: Step<S, { stop: boolean; state: S }> = scope([\n stash('state', step('snapshot', (s: S) => s)),\n step('extract_candidate', (s: S) => {\n if (s.candidate === undefined) {\n throw new Error('adversarial: guard reached without a candidate')\n }\n return s.candidate\n }),\n critique,\n use(['state'], (vars, critique_result: AdversarialCritiqueResult) => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars['state'] as S\n return {\n stop: accept(critique_result),\n state: {\n ...prior,\n last_critique: critique_result,\n critique_notes: critique_result.notes,\n },\n }\n }),\n ])\n\n const inner = loop<input, S, projected>({\n init: (input) => ({ input }),\n body,\n guard,\n finish: (s, { converged, rounds }) => {\n if (s.candidate === undefined) {\n throw new Error('adversarial: finished without a candidate')\n }\n return project({ candidate: s.candidate, converged, rounds })\n },\n max_rounds,\n })\n\n return compose(config.name ?? 'adversarial', inner)\n}\n","/**\n * consensus: run-until-agreement composite over concurrent members.\n */\n\nimport { compose, loop, parallel, scope, stash, step, use } from '#core'\nimport type { Step } from '#core'\n\nexport type ConsensusConfig<i, o, projected = ConsensusResult<o>> = {\n readonly name?: string\n readonly members: Record<string, Step<i, o>>\n readonly agree: (results: Record<string, o>) => boolean\n readonly max_rounds: number\n readonly project?: (r: ConsensusResult<o>) => projected\n}\n\nexport type ConsensusResult<o> = {\n readonly result: Record<string, o>\n readonly converged: boolean\n}\n\ntype ConsensusState<i, o> = {\n readonly input: i\n readonly results: Record<string, o>\n}\n\n/**\n * Builds a Step that runs every member concurrently with the same input\n * until `agree(results)` accepts a round.\n *\n * On agreement, returns the round's results with `converged: true`.\n * Otherwise re-runs all members up to `max_rounds` times and returns the\n * last results with `converged: false` if no agreement is reached.\n * `project` maps the `{ result, converged }` envelope into the step's output\n * (e.g. `(r) => r.converged`); omitted, the envelope itself is the output.\n *\n * Implemented as a `compose`d `loop` whose body runs `parallel(members)` and\n * whose guard evaluates `agree`. State carries the original input alongside\n * the most recent results so each round receives the same input.\n */\nexport function consensus<i, o, projected = ConsensusResult<o>>(\n config: ConsensusConfig<i, o, projected>,\n): Step<i, projected> {\n const { members, agree, max_rounds } = config\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: ConsensusResult<o>) => r as unknown as projected)\n\n type S = ConsensusState<i, o>\n\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const round_step = parallel(members) as Step<i, Record<string, o>>\n\n const body: Step<S, S> = scope([\n stash('state', step('snapshot', (s: S) => s)),\n step('extract_input', (s: S) => s.input),\n round_step,\n use(['state'], (vars, results: Record<string, o>) => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars['state'] as S\n return { ...prior, results }\n }),\n ])\n\n const guard: Step<S, { stop: boolean; state: S }> = step('agree', (s: S) => ({\n stop: agree(s.results),\n state: s,\n }))\n\n const inner = loop<i, S, projected>({\n init: (input) => ({ input, results: {} }),\n body,\n guard,\n finish: (s, { converged }) => project({ result: s.results, converged }),\n max_rounds,\n })\n\n return compose(config.name ?? 'consensus', inner)\n}\n","/**\n * ensemble: N-of-M pick-best with a plain-function scorer.\n */\n\nimport { compose, parallel, sequence, step } from '#core'\nimport type { Step } from '#core'\n\nexport type EnsembleConfig<i, o, projected = EnsembleResult<o>> = {\n readonly name?: string\n readonly members: Record<string, Step<i, o>>\n readonly score: (result: o, member_id: string) => number | Promise<number>\n readonly select?: 'max' | 'min'\n readonly project?: (r: EnsembleResult<o>) => projected\n}\n\nexport type EnsembleResult<o> = {\n readonly winner: o\n readonly scores: Record<string, number>\n}\n\n/**\n * Builds a Step that runs every member concurrently with the same input,\n * scores each result, and returns the winner plus the complete score map.\n *\n * `select` picks the highest (`'max'`, the default) or lowest (`'min'`)\n * score. Tie-breaking is \"any tied result is acceptable\": the first member\n * (in `members` key order) holding the best score wins. `project` maps the\n * `{ winner, scores }` envelope into the step's output (e.g. `(r) =>\n * r.winner`); omitted, the envelope itself is the output.\n *\n * Implemented as a `compose`d `sequence` of `parallel(members)` followed by\n * a single picking step. Cancellation, fan-out, and abort propagation come\n * from `parallel`'s own contract.\n */\nexport function ensemble<i, o, projected = EnsembleResult<o>>(\n config: EnsembleConfig<i, o, projected>,\n): Step<i, projected> {\n const select: 'max' | 'min' = config.select ?? 'max'\n const score_fn = config.score\n const keys = Object.keys(config.members)\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: EnsembleResult<o>) => r as unknown as projected)\n\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const fan_out = parallel(config.members) as Step<i, Record<string, o>>\n\n const pick = step('pick_winner', async (results: Record<string, o>) => {\n const scores: Record<string, number> = {}\n for (const k of keys) {\n const value = results[k]\n if (value === undefined) continue\n scores[k] = await score_fn(value, k)\n }\n \n let winner_key: string | undefined = undefined\n let winner_score: number | undefined = undefined\n for (const k of keys) {\n const current = scores[k]\n if (current === undefined) continue\n if (winner_score === undefined) {\n winner_key = k\n winner_score = current\n continue\n }\n const better = select === 'max' ? current > winner_score : current < winner_score\n if (better) {\n winner_key = k\n winner_score = current\n }\n }\n \n if (winner_key === undefined) {\n throw new Error('ensemble: no members produced a result')\n }\n const winner = results[winner_key]\n if (winner === undefined) {\n throw new Error('ensemble: winner missing from results')\n }\n return project({ winner, scores })\n })\n\n const inner = sequence([fan_out, pick])\n\n return compose(config.name ?? 'ensemble', inner)\n}\n","/**\n * ensemble_step: N-of-M pick-best with a Step-based scorer.\n */\n\nimport { compose, map, parallel, scope, stash, step, use } from '#core'\nimport type { Step } from '#core'\n\nexport type EnsembleStepConfig<i, o, ranked, projected = EnsembleStepResult<o, ranked>> = {\n readonly name?: string\n readonly members: Record<string, Step<i, o>>\n readonly score: Step<o, ranked>\n readonly rank_by: (r: ranked) => number\n readonly select?: 'max' | 'min'\n readonly project?: (r: EnsembleStepResult<o, ranked>) => projected\n}\n\nexport type EnsembleStepResult<o, ranked> = {\n readonly winner_id: string\n readonly winner: o\n readonly winner_scored: ranked\n readonly scored: Record<string, ranked>\n}\n\n// Scope variable keys, underscore-prefixed to avoid colliding with any\n// stashes a user-supplied step might set in the same scope chain.\nconst RESULTS_KEY = '__ensemble_step_results'\nconst ITEM_KEY = '__ensemble_step_item'\n\ntype Pair<o> = { readonly id: string; readonly value: o }\ntype ScoredPair<ranked> = { readonly id: string; readonly scored: ranked }\n\n/**\n * Builds a Step that runs every member concurrently, scores each result via\n * a scoring `Step`, and returns the best-ranking winner.\n *\n * Sibling of `ensemble` for the case where scoring is itself a `Step` (e.g.\n * a separate model call, a sub-flow, anything that wants its own trajectory\n * span and abort routing). The `score` step is dispatched once per member\n * result; `rank_by` projects a number out of the structured scored output;\n * `select` picks the highest (`'max'`, default) or lowest (`'min'`) rank.\n *\n * The result carries `winner_scored`, the structured output from the round's\n * scoring run preserved verbatim, so callers never pay to re-score the\n * winner. `scored` holds the structured score for every member. `project`\n * maps that envelope into the step's output (e.g. `(r) => r.winner`);\n * omitted, the envelope itself is the output.\n *\n * Implemented as a `compose`d `scope` over (`stash(parallel(members))` ->\n * `to_pairs` -> `map(score per result, threading id)` -> `use` to pick the\n * winner). Cancellation, fan-out, and abort propagation come from the\n * underlying `parallel` and `map` contracts.\n */\nexport function ensemble_step<i, o, ranked, projected = EnsembleStepResult<o, ranked>>(\n config: EnsembleStepConfig<i, o, ranked, projected>,\n): Step<i, projected> {\n const { members, score, rank_by } = config\n const select: 'max' | 'min' = config.select ?? 'max'\n const keys = Object.keys(members)\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: EnsembleStepResult<o, ranked>) => r as unknown as projected)\n\n if (keys.length === 0) {\n throw new Error('ensemble_step: at least one member required')\n }\n\n const fan_out = parallel(members)\n\n const score_one = scope([\n stash(ITEM_KEY, step('ensemble_step_item_snapshot', (item: Pair<o>) => item)),\n step('ensemble_step_extract_value', (item: Pair<o>) => item.value),\n score,\n use([ITEM_KEY], (vars, scored: ranked): ScoredPair<ranked> => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const item = vars[ITEM_KEY] as Pair<o>\n return { id: item.id, scored }\n }),\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n ]) as Step<Pair<o>, ScoredPair<ranked>>\n\n const to_pairs = step(\n 'ensemble_step_to_pairs',\n (results: Record<string, o>): ReadonlyArray<Pair<o>> => {\n const out: Pair<o>[] = []\n for (const id of keys) {\n if (id in results) {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n out.push({ id, value: results[id] as o })\n }\n }\n return out\n },\n )\n\n const score_each = map<ReadonlyArray<Pair<o>>, Pair<o>, ScoredPair<ranked>>({\n items: (pairs) => pairs,\n do: score_one,\n })\n\n const pick = use(\n [RESULTS_KEY],\n (vars, scored_pairs: ReadonlyArray<ScoredPair<ranked>>): projected => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const results = vars[RESULTS_KEY] as Record<string, o>\n const scored: Record<string, ranked> = {}\n let winner_id: string | undefined\n let winner_rank: number | undefined\n let winner_scored: ranked | undefined\n for (const pair of scored_pairs) {\n scored[pair.id] = pair.scored\n const rank = rank_by(pair.scored)\n const better =\n winner_rank === undefined\n ? true\n : select === 'max'\n ? rank > winner_rank\n : rank < winner_rank\n if (better) {\n winner_id = pair.id\n winner_rank = rank\n winner_scored = pair.scored\n }\n }\n if (winner_id === undefined || winner_scored === undefined) {\n throw new Error('ensemble_step: no members produced a result')\n }\n const winner = results[winner_id]\n if (winner === undefined) {\n throw new Error('ensemble_step: winner missing from results')\n }\n return project({ winner_id, winner, winner_scored, scored })\n },\n )\n\n const inner = scope([\n stash(RESULTS_KEY, fan_out),\n to_pairs,\n score_each,\n pick,\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n ]) as Step<i, projected>\n\n return compose(config.name ?? 'ensemble_step', inner)\n}\n","/**\n * improve: bounded online self-improvement loop.\n *\n * The *online* counterpart to `learn`: where `learn` reflects on recorded\n * trajectories offline, `improve` runs a propose/score loop live inside a\n * single run. The amplify example is a domain-specific consumer of this\n * same pattern (filesystem mutation, test-suite gates, subprocess\n * research); `improve` strips those opinions out so any domain can plug in\n * its own `propose` and `score` steps.\n */\n\nimport { compose, loop, scope, step, stash, use } from '#core'\nimport type { Step } from '#core'\nimport { ensemble_step } from './ensemble_step.js'\n\nexport type Candidate<c> = {\n readonly content: c\n readonly proposer_id: string\n readonly rationale?: string\n}\n\nexport type ScoredCandidate<c> = {\n readonly candidate: Candidate<c>\n readonly score: number\n readonly accepted: boolean\n readonly reason?: string\n}\n\nexport type Lesson = {\n readonly round: number\n readonly proposer_id: string\n readonly reason: string\n}\n\nexport type ImproveRoundInput<c> = {\n readonly parent: c\n readonly parent_score: number\n readonly round: number\n readonly lessons: ReadonlyArray<Lesson>\n}\n\nexport type ImproveBudget = {\n readonly max_rounds: number\n readonly max_wallclock_ms?: number\n readonly patience: number\n}\n\nexport type ImproveConfig<i, c, projected = ImproveResult<c>> = {\n readonly name?: string\n readonly seed: Step<i, { readonly content: c; readonly score: number }>\n readonly propose: Step<ImproveRoundInput<c>, Candidate<c>>\n readonly score: Step<Candidate<c>, ScoredCandidate<c>>\n readonly budget: ImproveBudget\n readonly epsilon?: number\n readonly proposers_per_round?: number\n readonly lessons_capacity?: number\n readonly project?: (r: ImproveResult<c>) => projected\n}\n\nexport type HistoryEntry<c> = {\n readonly round: number\n readonly winner: ScoredCandidate<c>\n readonly accepted: boolean\n}\n\nexport type ImproveResult<c> = {\n readonly best: { readonly content: c; readonly score: number }\n readonly rounds_used: number\n readonly stopped_by: 'budget' | 'plateau'\n readonly history: ReadonlyArray<HistoryEntry<c>>\n}\n\n// Scope variable key for the pre-round state snapshot, underscore-prefixed\n// to avoid colliding with stashes set by user-supplied steps.\nconst PRIOR_KEY = '__improve_prior'\n\ntype ImproveState<c> = {\n readonly parent: c\n readonly parent_score: number\n readonly round: number\n readonly rounds_since_progress: number\n readonly started_at_ms: number\n readonly history: ReadonlyArray<HistoryEntry<c>>\n readonly lessons: ReadonlyArray<Lesson>\n readonly stopped_by?: 'budget' | 'plateau'\n}\n\n/**\n * Builds a Step that runs a round-bounded loop threading a `parent`\n * candidate through repeated propose -> score -> accept/reject cycles.\n *\n * Acceptance requires both a hard gate (`scored.accepted`) and an\n * epsilon-improvement test (`scored.score > parent_score + epsilon`).\n * Rejected rounds with a `reason` feed a bounded lessons list back into the\n * next round's input. Plateau detection stops the loop early when no\n * progress has been made for `patience` rounds; an optional wall-clock\n * budget caps total runtime. `project` maps the result envelope into the\n * step's output (e.g. `(r) => r.best.content`); omitted, the envelope\n * itself is the output.\n *\n * Implemented as a `compose`d `scope` of (seed) -> (init state) -> (loop) ->\n * (unwrap). The loop body is itself a small `scope` that snapshots prior\n * state, builds a round input, dispatches the proposers + scorer via\n * `ensemble_step`, and merges the outcome back into state via `use`.\n * State threading is the entire job.\n */\nexport function improve<i, c, projected = ImproveResult<c>>(\n config: ImproveConfig<i, c, projected>,\n): Step<i, projected> {\n const { seed, propose, score, budget } = config\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: ImproveResult<c>) => r as unknown as projected)\n const epsilon = config.epsilon ?? 0\n const proposers_per_round = Math.max(1, config.proposers_per_round ?? 1)\n const lessons_capacity = Math.max(0, config.lessons_capacity ?? 5)\n const { max_rounds, max_wallclock_ms, patience } = budget\n\n const proposers: Record<string, Step<ImproveRoundInput<c>, Candidate<c>>> = {}\n for (let i = 0; i < proposers_per_round; i += 1) {\n proposers[`p${String(i)}`] = propose\n }\n\n const round_ensemble = ensemble_step<\n ImproveRoundInput<c>,\n Candidate<c>,\n ScoredCandidate<c>\n >({\n name: 'improve_round',\n members: proposers,\n score,\n rank_by: (s) => s.score,\n })\n\n type RoundResult = {\n readonly winner_id: string\n readonly winner: Candidate<c>\n readonly winner_scored: ScoredCandidate<c>\n readonly scored: Record<string, ScoredCandidate<c>>\n }\n\n const project_round = use(\n [PRIOR_KEY],\n (vars, ensemble_result: RoundResult, ctx): ScoredCandidate<c> => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars[PRIOR_KEY] as ImproveState<c>\n const round = prior.round + 1\n for (const slot_id of Object.keys(ensemble_result.scored)) {\n const scored = ensemble_result.scored[slot_id]\n if (scored === undefined) continue\n ctx.trajectory.record({\n kind: 'improve.candidate',\n round,\n proposer_id: slot_id,\n score: scored.score,\n accepted: scored.accepted,\n ...(scored.reason === undefined ? {} : { reason: scored.reason }),\n })\n }\n const w = ensemble_result.winner_scored\n return {\n ...w,\n candidate: { ...w.candidate, proposer_id: ensemble_result.winner_id },\n }\n },\n )\n\n const init_state = step(\n 'improve_init_state',\n (seed_result: { content: c; score: number }): ImproveState<c> => ({\n parent: seed_result.content,\n parent_score: seed_result.score,\n round: 0,\n rounds_since_progress: 0,\n started_at_ms: Date.now(),\n history: [],\n lessons: [],\n }),\n )\n\n const to_round_input = step(\n 'improve_to_round_input',\n (s: ImproveState<c>, ctx): ImproveRoundInput<c> => {\n const round = s.round + 1\n ctx.trajectory.record({\n kind: 'improve.round_start',\n round,\n parent_score: s.parent_score,\n lessons_count: s.lessons.length,\n })\n return {\n parent: s.parent,\n parent_score: s.parent_score,\n round,\n lessons: s.lessons,\n }\n },\n )\n\n const merge_outcome = use(\n [PRIOR_KEY],\n (vars, scored: ScoredCandidate<c>, ctx): ImproveState<c> => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars[PRIOR_KEY] as ImproveState<c>\n const next_round = prior.round + 1\n const better = scored.score > prior.parent_score + epsilon\n const accepted = scored.accepted && better\n const next_lessons = !accepted && scored.reason !== undefined\n ? [\n ...prior.lessons,\n {\n round: next_round,\n proposer_id: scored.candidate.proposer_id,\n reason: scored.reason,\n },\n ].slice(-lessons_capacity)\n : prior.lessons\n ctx.trajectory.record({\n kind: accepted ? 'improve.accept' : 'improve.reject',\n round: next_round,\n proposer_id: scored.candidate.proposer_id,\n score: scored.score,\n prior_score: prior.parent_score,\n ...(accepted ? { delta: scored.score - prior.parent_score } : {}),\n ...(scored.reason === undefined ? {} : { reason: scored.reason }),\n })\n return {\n parent: accepted ? scored.candidate.content : prior.parent,\n parent_score: accepted ? scored.score : prior.parent_score,\n round: next_round,\n rounds_since_progress: accepted ? 0 : prior.rounds_since_progress + 1,\n started_at_ms: prior.started_at_ms,\n history: [\n ...prior.history,\n { round: next_round, winner: scored, accepted },\n ],\n lessons: next_lessons,\n }\n },\n )\n\n const body = scope([\n stash(PRIOR_KEY, step('improve_snapshot', (s: ImproveState<c>) => s)),\n to_round_input,\n round_ensemble,\n project_round,\n merge_outcome,\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n ]) as Step<ImproveState<c>, ImproveState<c>>\n\n const guard = step(\n 'improve_guard',\n (s: ImproveState<c>): { stop: boolean; state: ImproveState<c> } => {\n if (s.rounds_since_progress >= patience) {\n return { stop: true, state: { ...s, stopped_by: 'plateau' } }\n }\n if (\n max_wallclock_ms !== undefined &&\n Date.now() - s.started_at_ms >= max_wallclock_ms\n ) {\n return { stop: true, state: { ...s, stopped_by: 'budget' } }\n }\n return { stop: false, state: s }\n },\n )\n\n const round_loop = loop<ImproveState<c>, ImproveState<c>, ImproveResult<c>>({\n init: (s) => s,\n body,\n guard,\n finish: (s): ImproveResult<c> => ({\n best: { content: s.parent, score: s.parent_score },\n rounds_used: s.round,\n stopped_by: s.stopped_by ?? 'budget',\n history: s.history,\n }),\n max_rounds,\n })\n\n const record_stop = step(\n 'improve_stop',\n (result: ImproveResult<c>, ctx): projected => {\n ctx.trajectory.record({\n kind: 'improve.stop',\n stopped_by: result.stopped_by,\n rounds_used: result.rounds_used,\n final_score: result.best.score,\n })\n return project(result)\n },\n )\n\n const inner = scope([\n seed,\n init_state,\n round_loop,\n record_stop,\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n ]) as Step<i, projected>\n\n return compose(config.name ?? 'improve', inner)\n}\n","/**\n * learn: offline self-improvement composer.\n *\n * `learn({ flow, source, analyzer })` reads recorded trajectory events from\n * past runs of `flow`, hands them to a user-supplied `analyzer` step alongside\n * `describe(flow)`, and returns the analyzer's proposals plus summary metadata\n * (events considered, distinct run ids).\n *\n * The amplify example is the *online* counterpart of this pattern: propose →\n * score → accept/reject inside a single run. `learn` is the *offline*\n * counterpart: reflect on what already happened across one or many recorded\n * runs without an evaluator in the loop.\n *\n * Implemented as a `compose`d `scope` of (compute meta) → (build LearnInput) →\n * (analyzer) → (wrap result with meta). No engine dependency; the analyzer\n * decides how to use the events.\n *\n * Three source kinds: `events` (in-memory), `paths` (explicit JSONL files),\n * `dir` (recursive *.jsonl walk). File reads honor `ctx.abort` at file-level\n * granularity; malformed lines are skipped and surface as `learn.parse_error`\n * trajectory events with 1-indexed line offsets. When `max_events` clips the\n * filtered set, a `learn.truncated` event records `available`, `kept`, and the\n * configured cap.\n */\n\nimport { readFile, readdir } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport {\n aborted_error,\n compose,\n describe,\n parse_trajectory_event,\n scope,\n stash,\n step,\n use,\n} from '#core'\nimport type { AnyStep, RunContext, Step, TrajectoryEvent } from '#core'\n\nexport type TrajectorySource =\n | { readonly kind: 'events'; readonly events: ReadonlyArray<TrajectoryEvent> }\n | { readonly kind: 'paths'; readonly paths: ReadonlyArray<string> }\n | { readonly kind: 'dir'; readonly dir: string }\n\nexport type LearnInput = {\n readonly flow_description: string\n readonly events: ReadonlyArray<TrajectoryEvent>\n readonly prior?: unknown\n}\n\nexport type Improvement = {\n readonly target: string\n readonly kind: 'prompt' | 'config' | 'structure' | 'note'\n readonly rationale: string\n readonly suggestion: string\n}\n\nexport type LearnConfig<i extends LearnInput, o> = {\n readonly name?: string\n readonly flow: AnyStep\n readonly source: TrajectorySource\n readonly analyzer: Step<i, o>\n readonly filter?: (event: TrajectoryEvent) => boolean\n readonly max_events?: number\n}\n\nexport type LearnResult<o> = {\n readonly proposals: o\n readonly events_considered: number\n readonly run_ids: ReadonlyArray<string>\n}\n\nconst DEFAULT_MAX_EVENTS = 10_000\nconst META_KEY = '__learn_meta'\n\ntype LearnMeta = {\n readonly events_considered: number\n readonly run_ids: ReadonlyArray<string>\n}\n\ntype MetaPlus = LearnMeta & {\n readonly events: ReadonlyArray<TrajectoryEvent>\n readonly prior: unknown\n}\n\n/**\n * Recursively collect every `.jsonl` file path under a directory.\n */\nasync function walk_jsonl(dir: string): Promise<string[]> {\n const out: string[] = []\n const entries = await readdir(dir, { withFileTypes: true })\n for (const entry of entries) {\n const full = join(dir, entry.name)\n if (entry.isDirectory()) {\n out.push(...(await walk_jsonl(full)))\n } else if (entry.isFile() && entry.name.endsWith('.jsonl')) {\n out.push(full)\n }\n }\n return out\n}\n\n/**\n * Parse one JSONL file into validated trajectory events.\n *\n * Malformed JSON lines and lines that fail schema validation are skipped,\n * each recorded as a `learn.parse_error` event with a 1-indexed line number,\n * so a single corrupt line never sinks an analysis run.\n */\nasync function read_jsonl(file_path: string, ctx: RunContext): Promise<TrajectoryEvent[]> {\n const content = await readFile(file_path, 'utf8')\n const lines = content.split('\\n')\n const events: TrajectoryEvent[] = []\n for (let i = 0; i < lines.length; i += 1) {\n const raw = lines[i]\n if (raw === undefined || raw.trim() === '') continue\n let parsed: unknown\n try {\n parsed = JSON.parse(raw)\n } catch {\n ctx.trajectory.record({ kind: 'learn.parse_error', path: file_path, line: i + 1 })\n continue\n }\n const result = parse_trajectory_event(parsed)\n if (result.success) {\n events.push(result.data)\n } else {\n ctx.trajectory.record({ kind: 'learn.parse_error', path: file_path, line: i + 1 })\n }\n }\n return events\n}\n\n/**\n * Throw the abort reason (wrapped in `aborted_error` if needed) when the run\n * has been cancelled.\n */\nfunction throw_if_aborted(ctx: RunContext): void {\n if (!ctx.abort.aborted) return\n const reason = ctx.abort.reason\n if (reason instanceof aborted_error) throw reason\n throw new aborted_error('aborted', reason === undefined ? {} : { reason })\n}\n\n/**\n * Materialize a `TrajectorySource` into an event array.\n *\n * `dir` sources walk recursively and sort paths for deterministic order.\n * File-backed sources check `ctx.abort` between files, so cancellation lands\n * at file-level granularity.\n */\nasync function resolve_events(\n source: TrajectorySource,\n ctx: RunContext,\n): Promise<ReadonlyArray<TrajectoryEvent>> {\n if (source.kind === 'events') return source.events\n\n const file_paths =\n source.kind === 'paths' ? [...source.paths] : (await walk_jsonl(source.dir)).toSorted()\n\n const all: TrajectoryEvent[] = []\n for (const p of file_paths) {\n throw_if_aborted(ctx)\n const events = await read_jsonl(p, ctx)\n all.push(...events)\n }\n return all\n}\n\n/**\n * List the distinct `run_id` values in the events, in first-seen order.\n */\nfunction collect_run_ids(events: ReadonlyArray<TrajectoryEvent>): ReadonlyArray<string> {\n const seen = new Set<string>()\n const out: string[] = []\n for (const event of events) {\n const id = event['run_id']\n if (typeof id === 'string' && !seen.has(id)) {\n seen.add(id)\n out.push(id)\n }\n }\n return out\n}\n\n/**\n * Build the offline self-improvement step.\n *\n * Composes a scope that resolves and caps the recorded events, builds the\n * `LearnInput` (including `describe(flow)`), runs the user's analyzer, and\n * wraps its proposals with the stashed meta (event count, run ids) into a\n * `LearnResult`.\n */\nexport function learn<i extends LearnInput, o>(\n config: LearnConfig<i, o>,\n): Step<unknown, LearnResult<o>> {\n const { flow, source, analyzer, filter } = config\n const max = config.max_events ?? DEFAULT_MAX_EVENTS\n\n const compute_meta = step(\n 'learn_compute_meta',\n async (prior: unknown, ctx): Promise<MetaPlus> => {\n const all = await resolve_events(source, ctx)\n const filtered = filter ? all.filter(filter) : all\n const truncated = filtered.length > max\n const capped = truncated ? filtered.slice(0, max) : filtered\n if (truncated) {\n ctx.trajectory.record({\n kind: 'learn.truncated',\n available: filtered.length,\n kept: capped.length,\n max_events: max,\n })\n }\n return {\n events_considered: capped.length,\n run_ids: collect_run_ids(capped),\n events: capped,\n prior,\n }\n },\n )\n\n const build_input = step(\n 'learn_build_input',\n (meta: MetaPlus): LearnInput => ({\n flow_description: describe(flow),\n events: meta.events,\n prior: meta.prior,\n }),\n )\n\n const wrap_result = use(\n [META_KEY],\n (vars, proposals: o, ctx): LearnResult<o> => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const meta = vars[META_KEY] as LearnMeta\n ctx.trajectory.record({\n kind: 'learn.summary',\n events_considered: meta.events_considered,\n run_ids: meta.run_ids,\n })\n return {\n proposals,\n events_considered: meta.events_considered,\n run_ids: meta.run_ids,\n }\n },\n )\n\n const inner = scope([\n stash(META_KEY, compute_meta),\n build_input,\n analyzer,\n wrap_result,\n ])\n\n return compose(config.name ?? 'learn', inner)\n}\n","/**\n * tournament: pairwise bracket.\n *\n * `tournament({ members, compare })` runs every member, then pairs them off\n * in a single-elimination bracket. `compare(a, b)` returns which result\n * advances. An odd member count yields one bye per affected round. Returns\n * `{ winner, bracket }` where `bracket` lists every match record.\n *\n * Implemented as a `compose`d `sequence` of `parallel(members)` followed\n * by a single bracket-reduction step. Cancellation, fan-out, and abort\n * propagation come from `parallel`'s contract; the bracket step only runs\n * after all members settle.\n */\n\nimport { compose, parallel, sequence, step } from '#core'\nimport type { Step } from '#core'\n\nexport type BracketRecord = {\n readonly round: number\n readonly a_id: string\n readonly b_id: string\n readonly winner_id: string\n}\n\nexport type TournamentConfig<i, o, projected = TournamentResult<o>> = {\n readonly name?: string\n readonly members: Record<string, Step<i, o>>\n readonly compare: (a: o, b: o) => Promise<'a' | 'b'> | 'a' | 'b'\n readonly project?: (r: TournamentResult<o>) => projected\n}\n\nexport type TournamentResult<o> = {\n readonly winner: o\n readonly bracket: ReadonlyArray<BracketRecord>\n}\n\n/**\n * Build a single-elimination bracket step over named members.\n *\n * All members run concurrently via `parallel`; the bracket step then reduces\n * survivors round by round with `compare`, recording every match. Requires at\n * least one member so a winner always exists. `project` maps the `{ winner,\n * bracket }` envelope into the step's output (e.g. `(r) => r.winner`);\n * omitted, the envelope itself is the output.\n */\nexport function tournament<i, o, projected = TournamentResult<o>>(\n config: TournamentConfig<i, o, projected>,\n): Step<i, projected> {\n const compare_fn = config.compare\n const keys = Object.keys(config.members)\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: TournamentResult<o>) => r as unknown as projected)\n\n if (keys.length === 0) {\n throw new Error('tournament: at least one member required')\n }\n\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const fan_out = parallel(config.members) as Step<i, Record<string, o>>\n\n const bracket_step = step('bracket', async (results: Record<string, o>) => {\n let current: string[] = [...keys]\n const bracket: BracketRecord[] = []\n let round = 0\n\n while (current.length > 1) {\n round += 1\n current = await play_round(current, results, compare_fn, round, bracket)\n }\n\n return project({ winner: winner_of(current, results), bracket })\n })\n\n const inner = sequence([fan_out, bracket_step])\n\n return compose(config.name ?? 'tournament', inner)\n}\n\n/**\n * Plays one bracket round: pairs survivors two at a time, comparing each pair\n * and recording a `BracketRecord`, and returns the ids advancing. An unpaired\n * trailing survivor takes a bye. Every paired id must have a settled result.\n */\nasync function play_round<o>(\n current: ReadonlyArray<string>,\n results: Record<string, o>,\n compare: (a: o, b: o) => Promise<'a' | 'b'> | 'a' | 'b',\n round: number,\n bracket: BracketRecord[],\n): Promise<string[]> {\n const next_round: string[] = []\n for (let i = 0; i < current.length; i += 2) {\n const a_id = current[i]\n const b_id = current[i + 1]\n if (a_id === undefined) continue\n if (b_id === undefined) {\n next_round.push(a_id)\n continue\n }\n const a_val = results[a_id]\n const b_val = results[b_id]\n if (a_val === undefined || b_val === undefined) {\n throw new Error('tournament: missing result for match')\n }\n const pick = await compare(a_val, b_val)\n const winner_id = pick === 'a' ? a_id : b_id\n bracket.push({ round, a_id, b_id, winner_id })\n next_round.push(winner_id)\n }\n return next_round\n}\n\n/**\n * Extracts the tournament winner from the single surviving id, throwing when\n * no survivor remains or its result is missing.\n */\nfunction winner_of<o>(current: ReadonlyArray<string>, results: Record<string, o>): o {\n const final_id = current[0]\n if (final_id === undefined) {\n throw new Error('tournament: no winner')\n }\n const winner = results[final_id]\n if (winner === undefined) {\n throw new Error('tournament: winner missing from results')\n }\n return winner\n}\n","/**\n * Typed errors for the composites layer.\n *\n * Listed alongside src/core/errors.ts, src/engine/errors.ts, and\n * src/mcp/errors.ts in the `no-class` rule ignores: `instanceof` branching is\n * how a caller tells a benched flow's usage error apart from a case failure.\n */\n\nexport class bench_suspend_error extends Error {\n readonly kind = 'bench_suspend_error' as const;\n readonly case_id: string;\n readonly suspend_id: string;\n constructor(case_id: string, suspend_id: string, message?: string) {\n super(\n message ??\n `bench: case ${case_id} suspended at ${suspend_id}; bench cannot resume a suspended flow`,\n )\n this.name = 'bench_suspend_error'\n this.case_id = case_id\n this.suspend_id = suspend_id\n }\n}\n","/**\n * bench: run a flow against a fixture set, score each result, return a report.\n *\n * Online counterpart to `learn`: where `learn` reflects on past trajectories\n * after the fact, `bench` runs the flow live against fresh cases and judges\n * each output.\n */\n\nimport { mkdir } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport { aborted_error, run, suspended_error } from '#core'\nimport type { Step, TrajectoryEvent, TrajectoryLogger } from '#core'\nimport { filesystem_logger, http_logger, tee_logger } from '#adapters'\nimport { bench_suspend_error } from './errors.js'\n\nexport type Score = { readonly score: number; readonly reason?: string }\n\nexport type BenchCase<I> = {\n readonly id: string\n readonly input: I\n readonly meta?: Readonly<Record<string, unknown>>\n}\n\nexport type JudgeArgs<I, O> = {\n readonly input: I\n readonly output: O\n readonly meta?: Readonly<Record<string, unknown>>\n}\n\nexport type Judge<I, O, S = Score> = Step<JudgeArgs<I, O>, S | undefined>\n\nexport type CaseResult<I = unknown, O = unknown, S = Score> = {\n readonly case_id: string\n readonly ok: boolean\n readonly output?: O\n readonly error?: string\n readonly scores: Record<string, S>\n readonly duration_ms: number\n readonly cost_usd: number\n readonly trajectory_path?: string\n readonly _input?: I\n}\n\nexport type BenchSummary = {\n readonly pass_rate: number\n readonly mean_scores: Record<string, number>\n readonly total_duration_ms: number\n readonly total_cost_usd: number\n readonly mean_cost_usd: number\n}\n\nexport type BenchReport<I = unknown, O = unknown, S = Score> = {\n readonly flow_name: string\n readonly run_id: string\n readonly cases: ReadonlyArray<CaseResult<I, O, S>>\n readonly summary: BenchSummary\n}\n\nexport type BenchOptions = {\n readonly concurrency?: number\n readonly on_case?: (result: CaseResult) => void\n readonly trajectory_dir?: string\n readonly live_url?: string\n readonly run_id?: string\n readonly install_signal_handlers?: boolean\n readonly abort?: AbortSignal\n}\n\n/**\n * Runs `flow` against every case, judges each output, and produces a\n * `BenchReport` you can compare against a committed baseline via\n * `regression_compare`.\n *\n * Each case becomes one `run(flow, case.input, ...)`. Per-case observability:\n * - `trajectory_dir` writes `${dir}/${case.id}.jsonl` via `filesystem_logger`\n * - `live_url` POSTs each event via `http_logger` to a viewer's /api/ingest\n * - both can be combined; bench tees them with an internal cost tracker\n *\n * Cost is tracked per-case in-process by intercepting `kind: 'cost'` events\n * on the trajectory pipeline, so the cost number matches what would be on\n * disk even when no `trajectory_dir` is set.\n *\n * Judges run as Steps after each case, with the same trajectory logger so\n * judge spans land in the case's trajectory file (or push). A judge that\n * throws or returns undefined abstains: the entry is omitted from\n * `case.scores` and the case does not contribute to that judge's mean.\n *\n * Control-flow signals are not case failures and never reach a `CaseResult`.\n * `abort` forwards to every per-case `run` and is re-checked before each case\n * is claimed, so cancelling rejects the whole bench rather than returning a\n * report that silently covers fewer cases than it was given. A\n * `suspended_error` from an approval gate rejects with `bench_suspend_error`:\n * `bench` has no resume path, so a suspend is a usage error, not a zero score.\n */\nexport async function bench<I, O, S = Score>(\n flow: Step<I, O>,\n cases: ReadonlyArray<BenchCase<I>>,\n judges: Record<string, Judge<I, O, S>>,\n options: BenchOptions = {},\n): Promise<BenchReport<I, O, S>> {\n const run_id = options.run_id ?? `bench-${String(Date.now())}-${random_suffix()}`\n const flow_name = describe_flow_name(flow)\n const concurrency = resolve_concurrency(options.concurrency, cases.length)\n const install_signal_handlers = options.install_signal_handlers ?? false\n const run_options = options.abort === undefined ? {} : { abort: options.abort }\n\n throw_if_aborted(options.abort)\n\n if (options.trajectory_dir !== undefined) {\n await mkdir(options.trajectory_dir, { recursive: true })\n }\n\n const judge_entries = Object.entries(judges)\n\n const run_one = async (bc: BenchCase<I>): Promise<CaseResult<I, O, S>> => {\n const { trajectory_path, case_logger, cost_tracker } = build_case_logging(options, bc.id)\n const ctx: CaseRunContext = { case_logger, install_signal_handlers, run_options }\n\n const start = Date.now()\n let output: O | undefined\n let error: string | undefined\n let ok = false\n try {\n output = await run(flow, bc.input, {\n trajectory: case_logger,\n install_signal_handlers,\n ...run_options,\n })\n ok = true\n } catch (err) {\n rethrow_control_flow(err, bc.id)\n error = err instanceof Error ? err.message : String(err)\n ok = false\n }\n\n const scores: Record<string, S> =\n ok && output !== undefined\n ? await run_judges(judge_entries, build_judge_input(bc, output), ctx, bc.id)\n : {}\n\n const duration_ms = Date.now() - start\n const result: CaseResult<I, O, S> = {\n case_id: bc.id,\n ok,\n ...(output !== undefined ? { output } : {}),\n ...(error !== undefined ? { error } : {}),\n scores,\n duration_ms,\n cost_usd: cost_tracker.total(),\n ...(trajectory_path !== undefined ? { trajectory_path } : {}),\n }\n if (options.on_case) {\n // The on_case callback receives the lossy-typed shape: bench's S is\n // generic but the callback hook is a single concrete signature.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n options.on_case(result as unknown as CaseResult)\n }\n return result\n }\n\n const cases_out = await run_with_concurrency(cases, concurrency, run_one, options.abort)\n\n // An abort that fires while every case is already in flight has no queue to\n // halt, and a flow that never checks `ctx.abort` finishes regardless. Both\n // would otherwise yield a full report for a cancelled run.\n throw_if_aborted(options.abort)\n\n const summary = summarize(cases_out, judge_entries.map(([n]) => n))\n\n return {\n flow_name,\n run_id,\n cases: cases_out,\n summary,\n }\n}\n\n/**\n * Per-case run context shared by the flow run and every judge run: the tee'd\n * trajectory logger, the signal-handler flag, and the optional abort forward.\n */\ntype CaseRunContext = {\n readonly case_logger: TrajectoryLogger\n readonly install_signal_handlers: boolean\n readonly run_options: { readonly abort?: AbortSignal }\n}\n\n/**\n * Builds the per-case trajectory pipeline: an optional filesystem sink when\n * `trajectory_dir` is set, an optional HTTP sink when `live_url` is set, and\n * always an in-process cost tracker, all tee'd together. Returns the resolved\n * trajectory path (undefined when no dir is set) alongside the logger and\n * tracker.\n */\nfunction build_case_logging(\n options: BenchOptions,\n case_id: string,\n): {\n readonly trajectory_path: string | undefined\n readonly case_logger: TrajectoryLogger\n readonly cost_tracker: ReturnType<typeof create_cost_tracker>\n} {\n const trajectory_path =\n options.trajectory_dir === undefined\n ? undefined\n : join(options.trajectory_dir, `${case_id}.jsonl`)\n const sinks: TrajectoryLogger[] = []\n if (trajectory_path !== undefined) {\n sinks.push(filesystem_logger({ output_path: trajectory_path }))\n }\n if (options.live_url !== undefined) {\n sinks.push(http_logger({ url: options.live_url }))\n }\n const cost_tracker = create_cost_tracker()\n const case_logger: TrajectoryLogger =\n sinks.length === 0 ? cost_tracker.logger : tee_logger(...sinks, cost_tracker.logger)\n return { trajectory_path, case_logger, cost_tracker }\n}\n\n/**\n * Assembles the judge input triple, including `meta` only when the case\n * carries it so the optional field stays absent rather than `undefined`.\n */\nfunction build_judge_input<I, O>(bc: BenchCase<I>, output: O): JudgeArgs<I, O> {\n return bc.meta === undefined\n ? { input: bc.input, output }\n : { input: bc.input, output, meta: bc.meta }\n}\n\n/**\n * Runs each judge as a Step over the case's input/output, collecting the\n * normalized scores. A judge that throws a control-flow signal rethrows via\n * `rethrow_control_flow`; any other throw, or an abstaining `undefined`,\n * omits that judge from the scores rather than failing the case.\n */\nasync function run_judges<I, O, S>(\n judge_entries: ReadonlyArray<readonly [string, Judge<I, O, S>]>,\n judge_input: JudgeArgs<I, O>,\n ctx: CaseRunContext,\n case_id: string,\n): Promise<Record<string, S>> {\n const scores: Record<string, S> = {}\n for (const [name, judge] of judge_entries) {\n let raw: unknown\n try {\n // oxlint-disable-next-line no-await-in-loop\n raw = await run(judge, judge_input, {\n trajectory: ctx.case_logger,\n install_signal_handlers: ctx.install_signal_handlers,\n ...ctx.run_options,\n })\n } catch (err) {\n rethrow_control_flow(err, case_id)\n continue\n }\n const normalized = normalize_score(raw)\n if (normalized === undefined) continue\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n scores[name] = normalized as S\n }\n return scores\n}\n\n/**\n * Rethrows the control-flow signals that must never become a `CaseResult`.\n *\n * An `aborted_error` cancels the whole bench: a report claiming every\n * remaining case failed is worse than no report. A `suspended_error` becomes\n * `bench_suspend_error` naming the case, because `bench` cannot resume an\n * approval gate and scoring the paused case as a failure corrupts the\n * benchmark. Anything else returns, and the caller records it as a failure.\n */\nfunction rethrow_control_flow(err: unknown, case_id: string): void {\n if (err instanceof aborted_error) throw err\n if (err instanceof suspended_error) throw new bench_suspend_error(case_id, err.suspend_id)\n}\n\n/**\n * Rejects once `signal` has fired, so an abort stops the bench claiming\n * further cases instead of running the queue to completion.\n *\n * Mirrors core's abort shape: an `Error` reason propagates verbatim, anything\n * else is wrapped, so a caller aborting with its own `aborted_error` sees that\n * instance rather than a copy.\n */\nfunction throw_if_aborted(signal: AbortSignal | undefined): void {\n if (signal?.aborted !== true) return\n const reason: unknown = signal.reason\n throw reason instanceof Error ? reason : new aborted_error('aborted', { reason })\n}\n\n/**\n * Aggregates per-case results into the report summary.\n *\n * A judge's mean only averages the cases where that judge produced a score;\n * abstained cases do not drag the mean down, and a judge that never scored\n * is omitted from `mean_scores` entirely.\n */\nfunction summarize<I, O, S>(\n cases: ReadonlyArray<CaseResult<I, O, S>>,\n judge_names: ReadonlyArray<string>,\n): BenchSummary {\n const total_duration_ms = cases.reduce((acc, c) => acc + c.duration_ms, 0)\n const total_cost_usd = cases.reduce((acc, c) => acc + c.cost_usd, 0)\n const ok_count = cases.filter((c) => c.ok).length\n const pass_rate = cases.length === 0 ? 0 : ok_count / cases.length\n const mean_cost_usd = cases.length === 0 ? 0 : total_cost_usd / cases.length\n\n const mean_scores: Record<string, number> = {}\n for (const name of judge_names) {\n let sum = 0\n let count = 0\n for (const c of cases) {\n const n = score_value_of(c.scores[name])\n if (n === undefined) continue\n sum += n\n count += 1\n }\n if (count > 0) mean_scores[name] = sum / count\n }\n\n return {\n pass_rate,\n mean_scores,\n total_duration_ms,\n total_cost_usd,\n mean_cost_usd,\n }\n}\n\n/**\n * Coerces a raw judge return value into a `Score`.\n *\n * Accepts a bare finite number or an object with a finite numeric `score`\n * and optional string `reason`. Anything else (including NaN/Infinity, or a\n * non-string `reason`, which is dropped) normalizes toward `undefined` or a\n * reason-less score; `undefined` means the judge abstained.\n */\nexport function normalize_score(raw: unknown): Score | undefined {\n if (raw === undefined || raw === null) return undefined\n if (typeof raw === 'number') {\n return Number.isFinite(raw) ? { score: raw } : undefined\n }\n if (typeof raw === 'object' && 'score' in raw) {\n const r = raw as { score: unknown; reason?: unknown }\n if (typeof r.score !== 'number' || !Number.isFinite(r.score)) return undefined\n if (r.reason !== undefined && typeof r.reason !== 'string') {\n return { score: r.score }\n }\n return r.reason === undefined ? { score: r.score } : { score: r.score, reason: r.reason }\n }\n return undefined\n}\n\n/**\n * Extracts the numeric value from a score-shaped entry, tolerating both bare\n * numbers and `{ score }` objects since `S` is caller-defined.\n */\nfunction score_value_of(s: unknown): number | undefined {\n if (s === undefined || s === null) return undefined\n if (typeof s === 'number') return Number.isFinite(s) ? s : undefined\n if (typeof s === 'object' && 'score' in s) {\n const raw = (s as Record<string, unknown>)['score']\n return typeof raw === 'number' && Number.isFinite(raw) ? raw : undefined\n }\n return undefined\n}\n\n/**\n * Builds a minimal `TrajectoryLogger` that ignores everything except\n * `kind: 'cost'` events and accumulates their `total_usd` into a running\n * total, read back via `total()` after the case finishes.\n */\nfunction create_cost_tracker(): {\n readonly logger: TrajectoryLogger\n readonly total: () => number\n} {\n let total = 0\n return {\n total: () => total,\n logger: {\n record: (event: TrajectoryEvent) => {\n if (event.kind !== 'cost') return\n const e: Record<string, unknown> = event\n const value = e['total_usd']\n if (typeof value === 'number' && Number.isFinite(value)) total += value\n },\n start_span: (name) => `cost-tracker:${name}`,\n end_span: () => {},\n },\n }\n}\n\n/**\n * Runs `fn` over `items` with at most `limit` calls in flight, preserving\n * input order in the results.\n *\n * Uses a shared-index worker pool: each of the `limit` workers claims the\n * next unclaimed index and writes its result into that slot, so completion\n * order never reorders the output.\n *\n * `abort` is re-checked before each claim, so a signal that fires mid-run\n * halts scheduling at the queue rather than only cancelling work already in\n * flight. The full fan-out path has no queue to halt: every item is already\n * running, so the caller re-checks the signal before reading the results.\n */\nasync function run_with_concurrency<t, r>(\n items: ReadonlyArray<t>,\n limit: number,\n fn: (item: t) => Promise<r>,\n abort?: AbortSignal,\n): Promise<r[]> {\n if (items.length === 0) return []\n if (limit >= items.length) {\n return Promise.all(items.map((it) => fn(it)))\n }\n const results: r[] = Array.from({ length: items.length })\n let next = 0\n const worker = async (): Promise<void> => {\n while (true) {\n throw_if_aborted(abort)\n const idx = next\n next += 1\n if (idx >= items.length) return\n const item = items[idx]\n if (item === undefined) continue\n // oxlint-disable-next-line no-await-in-loop\n results[idx] = await fn(item)\n }\n }\n const workers: Promise<void>[] = []\n for (let i = 0; i < limit; i += 1) workers.push(worker())\n await Promise.all(workers)\n return results\n}\n\n/**\n * Clamps the requested concurrency to a positive integer, defaulting to full\n * fan-out (one worker per case) when unset or invalid.\n */\nfunction resolve_concurrency(value: number | undefined, n_cases: number): number {\n if (value === undefined) return Math.max(1, n_cases)\n if (!Number.isFinite(value) || value <= 0) return Math.max(1, n_cases)\n return Math.max(1, Math.floor(value))\n}\n\n/**\n * Picks a human-readable name for the report: the flow's `display_name`\n * config when set, else its step id or kind.\n */\nfunction describe_flow_name<I, O>(flow: Step<I, O>): string {\n const display = flow.config?.['display_name']\n if (typeof display === 'string' && display.length > 0) return display\n return flow.id ?? flow.kind ?? 'flow'\n}\n\n/**\n * Short random base36 suffix to keep default run ids unique across\n * same-millisecond starts.\n */\nfunction random_suffix(): string {\n return Math.random().toString(36).slice(2, 8)\n}\n","/**\n * Stock judges for `bench`.\n *\n * A `Judge<I, O, S>` is a `Step<{ input, output, meta }, S>`: just a step\n * that scores a flow's input/output/metadata triple. Returning `undefined`\n * (or throwing) means the judge abstains; bench records the absence as a\n * missing key in `case.scores` and excludes the case from that judge's\n * `mean_scores` denominator.\n *\n * judge_equals: strict equality vs. `meta.expected`\n * judge_with: wrap a user-supplied scoring function\n * judge_llm: prompt a model + parse the rubric score out of the reply\n *\n * `judge_llm` is engine-agnostic: callers pass their already-configured\n * model_call step (`Step<string, string>`), which keeps composites decoupled\n * from engine. The user-facing wiring lives in their own code.\n */\n\nimport { compose, sequence, step } from '#core'\nimport type { Step } from '#core'\nimport { normalize_score } from './bench.js'\nimport type { Judge, JudgeArgs, Score } from './bench.js'\n\n/**\n * Narrows an unknown value to a plain string-keyed record (non-null object,\n * not an array).\n */\nexport function is_record(v: unknown): v is Record<string, unknown> {\n return v !== null && typeof v === 'object' && !Array.isArray(v)\n}\n\n/**\n * Structural equality over JSON-shaped values: primitives by `===`, arrays\n * element-wise, records key-by-key with sorted keys. Anything else (class\n * instances, functions) only compares equal by reference.\n */\nexport function deep_equal(a: unknown, b: unknown): boolean {\n if (a === b) return true\n // null, primitives, and array/record mismatches all fall through to the\n // Array.isArray and is_record guards below, so no separate null/typeof\n // pre-checks are needed.\n if (Array.isArray(a) || Array.isArray(b)) return arrays_equal(a, b)\n if (!is_record(a) || !is_record(b)) return false\n return records_equal(a, b)\n}\n\n/**\n * Element-wise deep equality once at least one side is an array: both must be\n * arrays of the same length with every index equal.\n */\nfunction arrays_equal(a: unknown, b: unknown): boolean {\n if (!Array.isArray(a) || !Array.isArray(b)) return false\n if (a.length !== b.length) return false\n for (let i = 0; i < a.length; i += 1) {\n if (!deep_equal(a[i], b[i])) return false\n }\n return true\n}\n\n/**\n * Key-by-key deep equality over two records: same sorted key sets, and each\n * value deep-equal under the shared key.\n */\nfunction records_equal(a: Record<string, unknown>, b: Record<string, unknown>): boolean {\n const ak = Object.keys(a).toSorted()\n const bk = Object.keys(b).toSorted()\n if (ak.length !== bk.length) return false\n for (let i = 0; i < ak.length; i += 1) {\n const ka = ak[i]\n const kb = bk[i]\n if (ka === undefined || kb === undefined || ka !== kb) return false\n if (!deep_equal(a[ka], b[kb])) return false\n }\n return true\n}\n\n/**\n * Judge that scores 1 when the output deep-equals `meta.expected`, 0\n * otherwise. Abstains when the case has no `meta` or no `expected` key.\n */\nexport function judge_equals<O>(): Judge<unknown, O> {\n return step('judge_equals', (args: JudgeArgs<unknown, O>): Score | undefined => {\n if (args.meta === undefined) return undefined\n if (!('expected' in args.meta)) return undefined\n const expected = args.meta['expected']\n const matches = deep_equal(args.output, expected)\n return { score: matches ? 1 : 0, reason: matches ? 'match' : 'mismatch' }\n })\n}\n\nexport type JudgeWithFn<I, O> = (\n args: JudgeArgs<I, O>,\n) => number | Score | undefined | Promise<number | Score | undefined>\n\n/**\n * Wraps a plain scoring function as a Judge. The function may return a bare\n * number, a `Score`, or `undefined` to abstain; the result is normalized\n * via `normalize_score`.\n */\nexport function judge_with<I, O>(fn: JudgeWithFn<I, O>): Judge<I, O> {\n return step('judge_with', async (args: JudgeArgs<I, O>): Promise<Score | undefined> => {\n const raw = await fn(args)\n return normalize_score(raw)\n })\n}\n\nexport type JudgeLlmConfig = {\n readonly model: Step<string, string>\n readonly rubric: string\n readonly scale?: { readonly min: number; readonly max: number }\n}\n\n/**\n * Judge that prompts a model with a rubric and parses the score out of the\n * reply.\n *\n * Built as a three-step sequence: render the rubric prompt, run the\n * caller-supplied model step, parse the JSON score from the reply. An\n * unparseable reply makes the judge abstain rather than fail the case.\n */\nexport function judge_llm<I, O>(config: JudgeLlmConfig): Judge<I, O> {\n const scale = config.scale ?? { min: 0, max: 1 }\n const build_prompt = step('judge_llm_build_prompt', (args: JudgeArgs<I, O>): string =>\n render_prompt(config.rubric, scale, args),\n )\n const parse = step('judge_llm_parse', (reply: string): Score | undefined =>\n parse_score(reply, scale),\n )\n const inner = sequence([build_prompt, config.model, parse])\n return compose('judge_llm', inner)\n}\n\n/**\n * Renders the evaluator prompt: rubric, required JSON reply shape with the\n * score scale, and the case's input/output serialized as JSON.\n */\nexport function render_prompt<I, O>(\n rubric: string,\n scale: { min: number; max: number },\n args: JudgeArgs<I, O>,\n): string {\n return [\n `You are an evaluator. Score the model output against the rubric below.`,\n ``,\n `Rubric:`,\n rubric,\n ``,\n `Return a single line of JSON with exactly two keys: {\"score\": <number ${String(scale.min)}..${String(scale.max)}>, \"reason\": \"<short>\"}.`,\n `Do not include prose outside the JSON.`,\n ``,\n `Input:`,\n JSON.stringify(args.input),\n ``,\n `Output:`,\n JSON.stringify(args.output),\n ].join('\\n')\n}\n\n/**\n * Parses a model reply into a `Score`, or `undefined` (abstain) when no\n * valid JSON object with a finite numeric `score` can be extracted.\n *\n * Tolerates prose around the JSON via `extract_json_object` and clamps the\n * score into the configured scale rather than rejecting out-of-range values.\n */\nexport function parse_score(\n reply: string,\n scale: { min: number; max: number },\n): Score | undefined {\n const trimmed = reply.trim()\n const candidate = extract_json_object(trimmed)\n if (candidate === undefined) return undefined\n let parsed: unknown\n try {\n parsed = JSON.parse(candidate)\n } catch {\n return undefined\n }\n if (!is_record(parsed)) return undefined\n const raw_score = parsed['score']\n if (typeof raw_score !== 'number' || !Number.isFinite(raw_score)) return undefined\n const clamped = Math.max(scale.min, Math.min(scale.max, raw_score))\n const raw_reason = parsed['reason']\n const reason = typeof raw_reason === 'string' ? raw_reason : undefined\n return reason === undefined ? { score: clamped } : { score: clamped, reason }\n}\n\n/**\n * Pulls the outermost `{...}` slice out of a reply that may wrap the JSON\n * in prose or code fences. Returns the text as-is when it already starts\n * with `{`.\n */\nexport function extract_json_object(text: string): string | undefined {\n if (text.startsWith('{')) return text\n const start = text.indexOf('{')\n const end = text.lastIndexOf('}')\n if (start === -1 || end === -1 || end < start) return undefined\n return text.slice(start, end + 1)\n}\n","/**\n * regression_compare: diff two BenchReports for regressions.\n *\n * The contract: given a `current` report and a `baseline` report, produce a\n * `RegressionReport` whose `ok` flag is false when any tracked metric got\n * worse beyond a threshold. The function does NOT short-circuit on first\n * failure; every metric and every per-case delta is computed so callers can\n * print or assert against the whole report.\n *\n * Tracked metrics:\n * - pass_rate (any drop is a regression by default)\n * - mean_scores.<name> (per judge; any drop is a regression by default)\n * - total_cost_usd (a relative cost increase above cost_threshold\n * counts as a regression; default 10%)\n *\n * Baselines are plain JSON, written via `write_baseline` and read via\n * `read_baseline`. They live wherever the caller decides, typically\n * `bench/<flow>/baseline.json` checked into git.\n */\n\nimport { mkdir, readFile, writeFile } from 'node:fs/promises'\nimport { dirname } from 'node:path'\nimport type { BenchReport, CaseResult } from './bench.js'\n\nexport type RegressionDelta = {\n readonly metric: string\n readonly baseline: number\n readonly current: number\n readonly delta: number\n readonly is_regression: boolean\n}\n\nexport type PerCaseDelta = {\n readonly case_id: string\n readonly baseline?: CaseResult\n readonly current?: CaseResult\n readonly score_deltas: Record<string, number>\n readonly cost_delta: number\n readonly is_regression: boolean\n}\n\nexport type RegressionReport = {\n readonly ok: boolean\n readonly deltas: ReadonlyArray<RegressionDelta>\n readonly per_case: ReadonlyArray<PerCaseDelta>\n}\n\nexport type RegressionCompareOptions = {\n readonly score_threshold?: number\n readonly cost_threshold?: number\n}\n\n/**\n * Diff a current `BenchReport` against a baseline.\n *\n * Compares `pass_rate`, each judge's mean score, and total cost, then every\n * individual case. Score metrics regress on any drop beyond\n * `score_threshold` (default 0); cost regresses on a relative increase above\n * `cost_threshold` (default 10%).\n */\nexport function regression_compare(\n current: BenchReport,\n baseline: BenchReport,\n options: RegressionCompareOptions = {},\n): RegressionReport {\n const score_threshold = options.score_threshold ?? 0\n const cost_threshold = options.cost_threshold ?? 0.1\n\n const deltas: RegressionDelta[] = []\n\n const pass_delta = current.summary.pass_rate - baseline.summary.pass_rate\n deltas.push({\n metric: 'pass_rate',\n baseline: baseline.summary.pass_rate,\n current: current.summary.pass_rate,\n delta: pass_delta,\n is_regression: pass_delta < -score_threshold,\n })\n\n const judge_names = collect_judge_names(current, baseline)\n for (const name of judge_names) {\n const c = current.summary.mean_scores[name] ?? 0\n const b = baseline.summary.mean_scores[name] ?? 0\n const d = c - b\n deltas.push({\n metric: `mean_scores.${name}`,\n baseline: b,\n current: c,\n delta: d,\n is_regression: d < -score_threshold,\n })\n }\n\n const cb = baseline.summary.total_cost_usd\n const cc = current.summary.total_cost_usd\n const cost_delta = cc - cb\n const cost_ratio = cb === 0 ? (cc > 0 ? Infinity : 0) : cost_delta / cb\n deltas.push({\n metric: 'total_cost_usd',\n baseline: cb,\n current: cc,\n delta: cost_delta,\n is_regression: cost_ratio > cost_threshold,\n })\n\n const per_case = compute_per_case(current, baseline, score_threshold, cost_threshold)\n const ok = !deltas.some((d) => d.is_regression) && !per_case.some((c) => c.is_regression)\n\n return { ok, deltas, per_case }\n}\n\n/**\n * Compute per-case deltas across the union of case ids in both reports.\n *\n * Cases present on only one side still appear (missing side scores count as\n * 0). A case regresses when a judge score drops beyond the threshold, its\n * cost rises beyond the relative threshold, or it flips from ok to failing.\n */\nfunction compute_per_case(\n current: BenchReport,\n baseline: BenchReport,\n score_threshold: number,\n cost_threshold: number,\n): PerCaseDelta[] {\n const by_id_current = index_by_case_id(current.cases)\n const by_id_baseline = index_by_case_id(baseline.cases)\n const all_ids = new Set<string>([...by_id_current.keys(), ...by_id_baseline.keys()])\n\n const out: PerCaseDelta[] = []\n for (const id of all_ids) {\n const c = by_id_current.get(id)\n const b = by_id_baseline.get(id)\n const { score_deltas, any_regression } = compute_score_deltas(c, b, score_threshold)\n const { cost_delta, is_regression: cost_regression } = compute_cost_regression(\n c,\n b,\n cost_threshold,\n )\n const ok_regression = b?.ok === true && c?.ok !== true\n out.push({\n case_id: id,\n ...(b !== undefined ? { baseline: b } : {}),\n ...(c !== undefined ? { current: c } : {}),\n score_deltas,\n cost_delta,\n is_regression: any_regression || cost_regression || ok_regression,\n })\n }\n return out\n}\n\n/**\n * Compute per-judge score deltas for one case pair across the union of judge\n * names on both sides (a missing side scores 0), flagging a regression when\n * any judge's score drops beyond the threshold.\n */\nfunction compute_score_deltas(\n c: CaseResult | undefined,\n b: CaseResult | undefined,\n score_threshold: number,\n): { score_deltas: Record<string, number>; any_regression: boolean } {\n const score_deltas: Record<string, number> = {}\n let any_regression = false\n const judge_names = new Set<string>([\n ...Object.keys(c?.scores ?? {}),\n ...Object.keys(b?.scores ?? {}),\n ])\n for (const name of judge_names) {\n const delta = score_value(c?.scores[name]) - score_value(b?.scores[name])\n score_deltas[name] = delta\n if (delta < -score_threshold) any_regression = true\n }\n return { score_deltas, any_regression }\n}\n\n/**\n * Compute the cost delta for one case pair and whether it regressed. With a\n * positive baseline cost, a relative rise beyond `cost_threshold` regresses;\n * with a zero baseline, any positive current cost regresses (unless the\n * threshold is Infinity). A missing side counts as 0.\n */\nfunction compute_cost_regression(\n c: CaseResult | undefined,\n b: CaseResult | undefined,\n cost_threshold: number,\n): { cost_delta: number; is_regression: boolean } {\n const baseline_cost = b?.cost_usd ?? 0\n const current_cost = c?.cost_usd ?? 0\n const cost_delta = current_cost - baseline_cost\n const is_regression =\n baseline_cost > 0\n ? cost_delta / baseline_cost > cost_threshold\n : current_cost > 0 && baseline_cost === 0 && cost_threshold < Infinity\n return { cost_delta, is_regression }\n}\n\n/**\n * Extract a finite numeric score from a raw score entry.\n *\n * Accepts a bare number or an object with a numeric `score` field; anything\n * else (missing, NaN, non-numeric) counts as 0 so deltas stay well-defined.\n */\nfunction score_value(s: unknown): number {\n if (s === undefined || s === null) return 0\n if (typeof s === 'number') return Number.isFinite(s) ? s : 0\n if (typeof s === 'object' && 'score' in s) {\n const v = (s as Record<string, unknown>)['score']\n return typeof v === 'number' && Number.isFinite(v) ? v : 0\n }\n return 0\n}\n\n/**\n * Index case results by their `case_id` for pairwise lookup.\n */\nfunction index_by_case_id<I, O, S>(\n cases: ReadonlyArray<CaseResult<I, O, S>>,\n): Map<string, CaseResult<I, O, S>> {\n const m = new Map<string, CaseResult<I, O, S>>()\n for (const c of cases) m.set(c.case_id, c)\n return m\n}\n\n/**\n * Union the judge names appearing in either report, sorted for stable output.\n */\nfunction collect_judge_names(a: BenchReport, b: BenchReport): string[] {\n const names = new Set<string>([\n ...Object.keys(a.summary.mean_scores),\n ...Object.keys(b.summary.mean_scores),\n ])\n return [...names].toSorted()\n}\n\n/**\n * Read and validate a baseline `BenchReport` from a JSON file.\n *\n * Validation is structural (required fields present), so a hand-edited or\n * truncated baseline fails loudly with the offending path in the message.\n */\nexport async function read_baseline(path: string): Promise<BenchReport> {\n const text = await readFile(path, 'utf8')\n const parsed: unknown = JSON.parse(text)\n validate_report(parsed, path)\n return parsed\n}\n\n/**\n * Write a `BenchReport` as pretty-printed JSON, creating parent directories.\n */\nexport async function write_baseline(path: string, report: BenchReport): Promise<void> {\n await mkdir(dirname(path), { recursive: true })\n await writeFile(path, `${JSON.stringify(report, null, 2)}\\n`, 'utf8')\n}\n\n/**\n * Assert that parsed JSON has the structural shape of a `BenchReport`.\n */\nfunction validate_report(value: unknown, path: string): asserts value is BenchReport {\n if (value === null || typeof value !== 'object') {\n throw new Error(`baseline at ${path} is not an object`)\n }\n const v = value as Partial<BenchReport>\n if (typeof v.flow_name !== 'string' || typeof v.run_id !== 'string') {\n throw new Error(`baseline at ${path} missing flow_name/run_id`)\n }\n if (!Array.isArray(v.cases) || typeof v.summary !== 'object' || v.summary === null) {\n throw new Error(`baseline at ${path} missing cases/summary`)\n }\n}\n","/**\n * Pricing table and cost computation.\n *\n * DEFAULT_PRICING is frozen at module load. Per-engine overrides flow through\n * engine config or register_price; the defaults are never mutated.\n *\n * Cost math formula:\n * input_usd = (input_tokens - cached - cache_write) * input_per_million / 1e6\n * cached_input_usd = cached * (cached_per_million ?? input_per_million) / 1e6\n * cache_write_usd = cache_write * (cache_write_per_million ?? input_per_million) / 1e6\n * reasoning_usd = reasoning * (reasoning_per_million ?? output_per_million) / 1e6\n * output_usd = (output_tokens - reasoning) * output_per_million / 1e6\n *\n * If reasoning_per_million is absent (the common case), reasoning tokens are\n * billed at the output rate and rolled into output_usd rather than surfacing\n * reasoning_usd separately.\n *\n * Fields on CostBreakdown are omitted (not zeroed) when the corresponding\n * usage field was 0 across the whole call. compute_cost is called per turn,\n * so it reports the fields that saw usage in THIS turn. The top-level\n * aggregation stage decides which fields to omit on the aggregated\n * CostBreakdown.\n */\n\nimport type { CostBreakdown, Pricing, PricingTable, UsageTotals } from './types.js'\n\nexport const FREE_PROVIDERS: ReadonlySet<string> = new Set(['ollama', 'lmstudio'])\n\nexport const DEFAULT_PRICING: PricingTable = Object.freeze({\n 'anthropic:claude-opus-4-8': {\n input_per_million: 5.0,\n output_per_million: 25.0,\n cached_input_per_million: 0.5,\n cache_write_per_million: 6.25,\n },\n 'anthropic:claude-opus-4-7': {\n input_per_million: 5.0,\n output_per_million: 25.0,\n cached_input_per_million: 0.5,\n cache_write_per_million: 6.25,\n },\n 'anthropic:claude-opus-4-6': {\n input_per_million: 5.0,\n output_per_million: 25.0,\n cached_input_per_million: 0.5,\n cache_write_per_million: 6.25,\n },\n 'anthropic:claude-sonnet-4-6': {\n input_per_million: 3.0,\n output_per_million: 15.0,\n cached_input_per_million: 0.3,\n cache_write_per_million: 3.75,\n },\n 'anthropic:claude-haiku-4-5': {\n input_per_million: 1.0,\n output_per_million: 5.0,\n cached_input_per_million: 0.1,\n cache_write_per_million: 1.25,\n },\n\n 'openai:gpt-4o': {\n input_per_million: 2.5,\n output_per_million: 10.0,\n cached_input_per_million: 1.25,\n },\n 'openai:gpt-4o-mini': {\n input_per_million: 0.15,\n output_per_million: 0.6,\n cached_input_per_million: 0.075,\n },\n\n 'google:gemini-2.5-pro': { input_per_million: 1.25, output_per_million: 5.0 },\n 'google:gemini-2.5-flash': { input_per_million: 0.075, output_per_million: 0.3 },\n})\n\n/**\n * Build the `provider:model_id` key used to look up a pricing table entry.\n */\nexport function pricing_key(provider: string, model_id: string): string {\n return `${provider}:${model_id}`\n}\n\n/**\n * Round a dollar amount to 6 decimal places.\n *\n * Per-token rates produce long floating-point tails; 6 places keeps\n * sub-cent precision without leaking binary rounding noise into reports.\n */\nfunction round6(value: number): number {\n return Math.round(value * 1e6) / 1e6\n}\n\n/**\n * The breakdown for a turn whose model has no pricing entry.\n *\n * Free providers (ollama, lmstudio) still report an all-zero, estimated\n * breakdown; a priced provider missing a table entry returns undefined so the\n * caller can surface a `pricing_missing` event instead of a fake zero.\n */\nfunction missing_pricing_breakdown(provider: string): CostBreakdown | undefined {\n if (!FREE_PROVIDERS.has(provider)) return undefined\n return {\n total_usd: 0,\n input_usd: 0,\n output_usd: 0,\n currency: 'USD',\n is_estimate: true,\n }\n}\n\n/**\n * Split reasoning tokens between a surfaced `reasoning_usd` field and the\n * output total.\n *\n * With a dedicated `reasoning_per_million` rate the reasoning cost is surfaced\n * separately and left out of output; without one it rolls into output at the\n * output rate. Absent reasoning tokens leave output untouched and surface\n * nothing.\n */\nfunction apply_reasoning_cost(\n plain_output_usd_raw: number,\n reasoning: number,\n has_reasoning_rate: boolean,\n reasoning_usd_raw: number,\n): { output_usd_raw: number; surface_reasoning_usd: number | undefined } {\n if (reasoning > 0) {\n if (has_reasoning_rate) {\n return { output_usd_raw: plain_output_usd_raw, surface_reasoning_usd: round6(reasoning_usd_raw) }\n }\n return {\n output_usd_raw: plain_output_usd_raw + reasoning_usd_raw,\n surface_reasoning_usd: undefined,\n }\n }\n return { output_usd_raw: plain_output_usd_raw, surface_reasoning_usd: undefined }\n}\n\n/**\n * Compute a CostBreakdown for a single turn's usage.\n *\n * Returns undefined when pricing is absent AND the provider is not free. Free\n * providers (ollama, lmstudio) return an all-zero breakdown even with no\n * pricing entry. Callers are responsible for deduplicating pricing_missing\n * trajectory events across turns within a single generate call.\n *\n * Fields are omitted (not zeroed) when the corresponding usage is 0 for the\n * input call.\n */\nexport function compute_cost(\n usage: UsageTotals,\n pricing: Pricing | undefined,\n provider: string,\n): CostBreakdown | undefined {\n if (pricing === undefined) return missing_pricing_breakdown(provider)\n\n const cached = usage.cached_input_tokens ?? 0\n const cache_write = usage.cache_write_tokens ?? 0\n const reasoning = usage.reasoning_tokens ?? 0\n\n const fresh_input = Math.max(0, usage.input_tokens - cached - cache_write)\n const cached_rate = pricing.cached_input_per_million ?? pricing.input_per_million\n const cache_write_rate = pricing.cache_write_per_million ?? pricing.input_per_million\n const reasoning_rate = pricing.reasoning_per_million ?? pricing.output_per_million\n\n const input_usd_raw = (fresh_input * pricing.input_per_million) / 1e6\n const cached_usd_raw = (cached * cached_rate) / 1e6\n const cache_write_usd_raw = (cache_write * cache_write_rate) / 1e6\n const reasoning_usd_raw = (reasoning * reasoning_rate) / 1e6\n const plain_output_tokens = Math.max(0, usage.output_tokens - reasoning)\n const plain_output_usd_raw = (plain_output_tokens * pricing.output_per_million) / 1e6\n\n const { output_usd_raw, surface_reasoning_usd } = apply_reasoning_cost(\n plain_output_usd_raw,\n reasoning,\n pricing.reasoning_per_million !== undefined,\n reasoning_usd_raw,\n )\n\n const total_raw =\n input_usd_raw +\n cached_usd_raw +\n cache_write_usd_raw +\n (surface_reasoning_usd !== undefined ? reasoning_usd_raw : 0) +\n output_usd_raw\n\n const breakdown: CostBreakdown = {\n total_usd: round6(total_raw),\n input_usd: round6(input_usd_raw),\n output_usd: round6(output_usd_raw),\n currency: 'USD',\n is_estimate: true,\n }\n if (cached > 0) breakdown.cached_input_usd = round6(cached_usd_raw)\n if (cache_write > 0) breakdown.cache_write_usd = round6(cache_write_usd_raw)\n if (surface_reasoning_usd !== undefined) breakdown.reasoning_usd = surface_reasoning_usd\n return breakdown\n}\n","/**\n * Retry policy for provider-side failures.\n *\n * Narrow scope: retries 429 rate limits, provider 5xx errors, network\n * errors, and engine turn-timeout expiry (`turn_timeout_ms` throws a typed\n * timeout that the shared classifier treats as retryable). Composition-layer\n * retry wraps the whole generate call; this module retries a single provider\n * call between tool-loop turns.\n *\n * Once a streaming response has delivered a chunk, the caller must not retry\n * it: this helper is never wrapped around a streaming call past its first\n * chunk, and the orchestrator enforces that boundary.\n */\n\nimport type { RetryFailureKind, RetryPolicy } from './types.js'\nimport { aborted_error, provider_error, rate_limit_error } from './errors.js'\nimport { compute_backoff, wait_with_abort } from '#policy'\nimport type { BackoffPolicy } from '#policy'\n\nexport const DEFAULT_RETRY: RetryPolicy = {\n max_attempts: 3,\n initial_delay_ms: 500,\n max_delay_ms: 30_000,\n retry_on: ['rate_limit', 'provider_5xx', 'network', 'timeout'],\n}\n\ntype RetryableError =\n | { kind: 'rate_limit'; retry_after_ms?: number; status?: number; message?: string }\n | { kind: 'provider_5xx'; status?: number; body?: string; message?: string }\n | { kind: 'network'; message?: string }\n | { kind: 'timeout'; message?: string }\n\n/**\n * Parse an HTTP `Retry-After` header value into a millisecond delay.\n *\n * Accepts both forms the header allows: a plain integer or decimal number of\n * seconds, and an HTTP-date. Returns `undefined` for anything else (missing,\n * blank, or unparseable).\n */\nexport function parse_retry_after(value: string | null | undefined): number | undefined {\n if (value === null || value === undefined) return undefined\n const trimmed = value.trim()\n if (trimmed.length === 0) return undefined\n if (/^\\d+(\\.\\d+)?$/.test(trimmed)) {\n return Math.max(0, Math.floor(Number(trimmed) * 1000))\n }\n const parsed = Date.parse(trimmed)\n if (Number.isNaN(parsed)) return undefined\n return Math.max(0, parsed - Date.now())\n}\n\n/**\n * Check whether `policy` allows retrying a failure of the given `kind`.\n */\nfunction is_retryable(kind: RetryFailureKind, policy: RetryPolicy): boolean {\n return policy.retry_on.includes(kind)\n}\n\n/**\n * Map an abort reason onto the error this layer rejects with, always wrapping\n * so an abort can only ever surface as `aborted_error` with the caller's\n * reason attached.\n *\n * The engine's convention, and the opposite of core's propagate-verbatim rule.\n * Two things depend on the wrap. A bare `controller.abort()` sets\n * `signal.reason` to a `DOMException`, which is an `Error` on Node, so\n * propagating would leak a non-fascicle error out of a boundary documented as\n * throwing `aborted_error`. And the engine's other abort sites (`generate`,\n * `tool_loop`, the adapters) wrap in order to attach `step_index` and\n * `tool_call_in_flight`, which only the construction site knows; propagating\n * would discard them. Wrapping a reason that is already an `aborted_error`\n * nests one inside the other, which is the accepted cost of that contract.\n */\nfunction to_abort_error(reason: unknown): Error {\n return new aborted_error('aborted', { reason })\n}\n\n/**\n * Build the `rate_limit_error` thrown when 429 retries exhaust. Prefers the\n * failing attempt's own `Retry-After`, falling back to the most recent one a\n * prior attempt carried (`last_rate_limit_after`).\n */\nfunction build_rate_limit_error(\n retryable: Extract<RetryableError, { kind: 'rate_limit' }>,\n attempt: number,\n last_rate_limit_after: number | undefined,\n): rate_limit_error {\n const metadata: { attempts: number; retry_after_ms?: number; status?: number } = {\n attempts: attempt,\n }\n if (retryable.retry_after_ms !== undefined) metadata.retry_after_ms = retryable.retry_after_ms\n else if (last_rate_limit_after !== undefined) metadata.retry_after_ms = last_rate_limit_after\n if (retryable.status !== undefined) metadata.status = retryable.status\n return new rate_limit_error(\n retryable.message ?? `rate limited after ${attempt} attempts`,\n metadata,\n )\n}\n\n/**\n * Build the `provider_error` thrown when 5xx/network/timeout retries exhaust.\n * Timeout collapses onto the `network` cause; only 5xx carries status/body.\n */\nfunction build_provider_error(\n retryable: Exclude<RetryableError, { kind: 'rate_limit' }>,\n attempt: number,\n): provider_error {\n const cause_kind = retryable.kind === 'provider_5xx' ? 'provider_5xx' : 'network'\n const metadata: { status?: number; body?: string; cause_kind: typeof cause_kind } = {\n cause_kind,\n }\n if (retryable.kind === 'provider_5xx') {\n if (retryable.status !== undefined) metadata.status = retryable.status\n if (retryable.body !== undefined) metadata.body = retryable.body\n }\n return new provider_error(\n retryable.message ?? `${retryable.kind} after ${attempt} attempts`,\n metadata,\n )\n}\n\n/**\n * Map an exhausted retryable failure onto the error this layer rejects with:\n * `rate_limit_error` for 429s, `provider_error` for everything else.\n */\nfunction build_exhaustion_error(\n retryable: RetryableError,\n attempt: number,\n last_rate_limit_after: number | undefined,\n): Error {\n if (retryable.kind === 'rate_limit') {\n return build_rate_limit_error(retryable, attempt, last_rate_limit_after)\n }\n return build_provider_error(retryable, attempt)\n}\n\n/**\n * Compute the pre-retry backoff for `attempt`. A rate-limit `Retry-After`\n * outranks the local cap (`Math.max`), so a server instruction longer than\n * `max_delay_ms` is honored; the honored value is returned so the caller can\n * carry it onto a later failure that omits its own.\n */\nfunction next_backoff(\n retryable: RetryableError,\n backoff_policy: BackoffPolicy,\n attempt: number,\n): { delay: number; retry_after_ms?: number } {\n const delay = compute_backoff(backoff_policy, attempt - 1)\n if (retryable.kind === 'rate_limit' && retryable.retry_after_ms !== undefined) {\n return { delay: Math.max(delay, retryable.retry_after_ms), retry_after_ms: retryable.retry_after_ms }\n }\n return { delay }\n}\n\n/**\n * Retry `fn` under `policy`. `fn` must throw a RetryableError-shaped object to\n * trigger retry; any other thrown value short-circuits as a permanent failure.\n *\n * An aborted `abort` signal interrupts a pending backoff wait and throws\n * `aborted_error`. Returns the value from the last successful `fn()` call. On\n * exhaustion, throws `rate_limit_error` (for 429s) or `provider_error` (for\n * 5xx/network/timeout).\n */\nexport async function retry_with_policy<t>(\n fn: (attempt: number) => Promise<t>,\n policy: RetryPolicy = DEFAULT_RETRY,\n abort?: AbortSignal,\n): Promise<t> {\n const backoff_policy: BackoffPolicy = {\n initial_delay_ms: policy.initial_delay_ms,\n max_delay_ms: policy.max_delay_ms,\n jitter: true,\n }\n const signal = abort ?? new AbortController().signal\n let attempt = 0\n let last_rate_limit_after: number | undefined\n while (true) {\n if (abort?.aborted === true) {\n throw to_abort_error(abort.reason)\n }\n try {\n return await fn(attempt)\n } catch (err: unknown) {\n const retryable = classify_retryable(err)\n if (retryable === undefined || !is_retryable(retryable.kind, policy)) throw err\n attempt += 1\n if (attempt >= policy.max_attempts) {\n throw build_exhaustion_error(retryable, attempt, last_rate_limit_after)\n }\n const backoff = next_backoff(retryable, backoff_policy, attempt)\n last_rate_limit_after = backoff.retry_after_ms ?? last_rate_limit_after\n await wait_with_abort(backoff.delay, signal, to_abort_error)\n }\n }\n}\n\n/**\n * Read `key` off `err` and return it only if the value is a string.\n */\nfunction read_string(err: object, key: string): string | undefined {\n const value: unknown = Reflect.get(err, key)\n return typeof value === 'string' ? value : undefined\n}\n\n/**\n * Read `key` off `err` and return it only if the value is a number.\n */\nfunction read_number(err: object, key: string): number | undefined {\n const value: unknown = Reflect.get(err, key)\n return typeof value === 'number' ? value : undefined\n}\n\n/**\n * Assemble the `rate_limit` retryable shape, copying the optional\n * `retry_after_ms`, `status`, and `message` fields when each is present.\n */\nfunction build_retryable_rate_limit(err: object): RetryableError {\n const base: RetryableError = { kind: 'rate_limit' }\n const retry_after = read_number(err, 'retry_after_ms')\n if (retry_after !== undefined) base.retry_after_ms = retry_after\n const status = read_number(err, 'status')\n if (status !== undefined) base.status = status\n const message = read_string(err, 'message')\n if (message !== undefined) base.message = message\n return base\n}\n\n/**\n * Assemble the `provider_5xx` retryable shape, copying the optional `status`,\n * `body`, and `message` fields when each is present.\n */\nfunction build_retryable_5xx(err: object): RetryableError {\n const base: RetryableError = { kind: 'provider_5xx' }\n const status = read_number(err, 'status')\n if (status !== undefined) base.status = status\n const body = read_string(err, 'body')\n if (body !== undefined) base.body = body\n const message = read_string(err, 'message')\n if (message !== undefined) base.message = message\n return base\n}\n\n/**\n * Assemble a `network` or `timeout` retryable shape, copying the optional\n * `message` when present.\n */\nfunction build_retryable_signal(err: object, kind: 'network' | 'timeout'): RetryableError {\n const base: RetryableError = { kind }\n const message = read_string(err, 'message')\n if (message !== undefined) base.message = message\n return base\n}\n\n/**\n * Classify a thrown value into a `RetryableError`, or `undefined` if it\n * does not carry one of the recognized retryable `kind`s.\n *\n * Providers throw plain objects tagged with `kind` (set by\n * `classify_provider_error` in generate.ts); this reads that shape back out\n * field by field rather than trusting it wholesale.\n */\nfunction classify_retryable(err: unknown): RetryableError | undefined {\n if (err === null || typeof err !== 'object') return undefined\n const kind = read_string(err, 'kind')\n if (kind === 'rate_limit') return build_retryable_rate_limit(err)\n if (kind === 'provider_5xx') return build_retryable_5xx(err)\n if (kind === 'network' || kind === 'timeout') return build_retryable_signal(err, kind)\n return undefined\n}\n","/**\n * Shared plumbing for the native (raw-HTTP) provider adapters.\n *\n * Everything here is wire-neutral: how a turn travels HTTP (POST, non-2xx\n * mapping, stream-vs-JSON dispatch), how streamed bytes become framed\n * payloads, and the engine-message folds the 1:1 wires share. Each adapter\n * keeps what is genuinely its own dialect (request bodies, response parsers,\n * stream aggregators) and delegates the rest here, so the three adapters\n * cannot drift apart on retry classification or stream draining. This module\n * imports nothing from `ai` or `@ai-sdk/*` and nothing from the adapters, so\n * every adapter can import it cycle-free.\n */\n\nimport type {\n AssistantContentPart,\n Message,\n ProviderInit,\n StreamChunk,\n TurnRequest,\n TurnResult,\n UserContentPart,\n} from '../types.js'\nimport { provider_auth_error, provider_error } from '../errors.js'\n\n/**\n * The message under a JSON error envelope's `error` key, or undefined when\n * the shape carries none worth surfacing.\n */\nfunction error_field_message(parsed: unknown): string | undefined {\n // Stryker disable next-line ConditionalExpression,LogicalOperator: the\n // caller's try/catch already funnels every non-object parse to the raw\n // snippet, so this guard only narrows unknown -> object for Reflect.get;\n // forcing it either way throws-and-catches to the same fallback (equivalent).\n if (parsed === null || typeof parsed !== 'object') return undefined\n const error: unknown = Reflect.get(parsed, 'error')\n if (typeof error === 'string' && error.length > 0) return error\n // Stryker disable next-line ConditionalExpression,LogicalOperator: same as\n // above -- a non-object error still reaches the raw-snippet fallback via the\n // catch or the message-not-a-string check, so both boundaries are equivalent.\n if (error === null || typeof error !== 'object') return undefined\n const message: unknown = Reflect.get(error, 'message')\n return typeof message === 'string' && message.length > 0 ? message : undefined\n}\n\n/**\n * Pull a human-readable message out of a non-2xx body. The native wires share\n * one envelope family: Anthropic sends `{ type: 'error', error: { message } }`,\n * OpenAI-style wires send `{ error: { message } }`, and Ollama sends\n * `{ error: \"message\" }` (with the nested shape appearing behind proxies), so\n * one parser accepts a string or a `{ message }` object under `error` and\n * falls back to the raw body, truncated to 300 chars.\n */\nfunction extract_error_message(body: string): string {\n if (body.length === 0) return '(empty body)'\n let message: string | undefined\n try {\n message = error_field_message(JSON.parse(body))\n } catch {\n // Not JSON; fall through to the raw snippet.\n }\n if (message !== undefined) return message\n return body.length > 300 ? `${body.slice(0, 300)}...` : body\n}\n\n/**\n * Map a non-2xx response to what the engine's retry stack expects: 401\n * becomes a typed provider_auth_error, 429/5xx keep `status` +\n * `responseHeaders` so classify_provider_error marks them retryable\n * (rate_limit honoring retry-after, provider_5xx), and any other 4xx is a\n * permanent provider_error that surfaces as-is.\n */\nasync function response_error(response: Response, provider: string): Promise<Error> {\n let body = ''\n try {\n body = await response.text()\n } catch {\n // Body is best-effort detail; classification needs only the status.\n }\n const detail = extract_error_message(body)\n const status = response.status\n if (status === 401) {\n return new provider_auth_error(\n provider,\n `${provider} authentication failed (401): ${detail}`,\n )\n }\n if (status === 429 || status >= 500) {\n const retry_after = response.headers.get('retry-after')\n return Object.assign(\n new Error(`${provider} API error ${status}: ${detail}`),\n { status },\n retry_after !== null ? { responseHeaders: { 'retry-after': retry_after } } : {},\n )\n }\n return new provider_error(`${provider} API error ${status}: ${detail}`, { status, body })\n}\n\n/**\n * A user abort surfaces as the fetch/reader AbortError; retry_turn converts\n * it via its own signal check, so it is rethrown untouched. Everything else\n * is a transport failure wrapped in the `kind: 'network'` shape the shared\n * classify_provider_error marks retryable.\n */\nfunction rethrow_network_failure(err: unknown, abort: AbortSignal, provider: string): never {\n if (abort.aborted) throw err\n const detail = err instanceof Error ? err.message : String(err)\n throw Object.assign(new Error(`${provider} native: network failure: ${detail}`), {\n kind: 'network',\n })\n}\n\n/**\n * Run one native turn over HTTP: POST the dialect's body, map a non-2xx to\n * the retry stack's shapes, and hand the response to the dialect's stream or\n * JSON consumer. `build_body` is called inside the network try/catch on\n * purpose: that is where each adapter historically built its body, so a\n * mapper throw keeps surfacing through the same path it always did.\n */\nexport async function invoke_http_turn(\n req: TurnRequest,\n provider: string,\n request: {\n url: string\n headers: Record<string, string>\n build_body: () => Record<string, unknown>\n },\n consume: {\n stream: (response: Response) => Promise<TurnResult>\n parse: (payload: unknown) => TurnResult\n },\n): Promise<TurnResult> {\n let response: Response\n try {\n response = await fetch(request.url, {\n method: 'POST',\n headers: request.headers,\n body: JSON.stringify(request.build_body()),\n signal: req.abort,\n })\n } catch (err: unknown) {\n rethrow_network_failure(err, req.abort, provider)\n }\n if (!response.ok) throw await response_error(response, provider)\n if (req.stream) return consume.stream(response)\n const payload: unknown = await response.json()\n return consume.parse(payload)\n}\n\n/**\n * Drain a streaming response: decode bytes, reassemble framed payloads (SSE\n * events or NDJSON lines), and feed them to the dialect's aggregator, which\n * dispatches chunks through req.dispatch_chunk as they arrive. Transport\n * failures mid-read wrap as network errors; aggregator throws (malformed\n * frames, mid-stream error events, a rejecting on_chunk) pass through\n * untouched, with the reader cancelled so the connection is released.\n */\nexport async function consume_framed_stream(\n response: Response,\n req: TurnRequest,\n provider: string,\n framing: { push: (text: string) => string[]; flush: () => string[] },\n create_aggregator: (dispatch: (chunk: StreamChunk) => Promise<void>) => {\n handle: (data: string) => Promise<void>\n complete: () => TurnResult\n },\n): Promise<TurnResult> {\n const body = response.body\n if (body === null) {\n throw new provider_error(`${provider} native: streaming response has no body`)\n }\n const aggregator = create_aggregator(req.dispatch_chunk ?? (async (): Promise<void> => {}))\n const reader = body.getReader()\n const text_decoder = new TextDecoder()\n\n const next_bytes = async (): Promise<Uint8Array | undefined> => {\n let step: Awaited<ReturnType<typeof reader.read>>\n try {\n step = await reader.read()\n } catch (err: unknown) {\n rethrow_network_failure(err, req.abort, provider)\n }\n return step.done ? undefined : step.value\n }\n\n // Sequential awaits are the contract here: chunk order is an engine\n // invariant and each frame mutates aggregator state, so no parallelism.\n try {\n while (true) {\n const bytes = await next_bytes()\n if (bytes === undefined) break\n for (const data of framing.push(text_decoder.decode(bytes, { stream: true }))) {\n await aggregator.handle(data)\n }\n }\n } finally {\n // Frees the connection when an error exits the loop early; a no-op on a\n // fully drained stream.\n void reader.cancel().catch(() => {})\n }\n const tail = [...framing.push(text_decoder.decode()), ...framing.flush()]\n for (const data of tail) {\n await aggregator.handle(data)\n }\n return aggregator.complete()\n}\n\n/**\n * Incremental newline framing shared by the SSE and NDJSON decoders: buffer\n * decoded text across arbitrary chunk boundaries, hand each completed line\n * (CR trimmed) to `handle_line`, and on flush hand over an unterminated tail\n * line, then `on_flush` for state a decoder holds across lines (an SSE event\n * never closed by a blank line).\n */\nexport function create_line_splitter(\n handle_line: (line: string, out: string[]) => void,\n on_flush?: (out: string[]) => void,\n): { push: (text: string) => string[]; flush: () => string[] } {\n let buffer = ''\n\n const take_line = (raw: string, out: string[]): void => {\n handle_line(raw.endsWith('\\r') ? raw.slice(0, -1) : raw, out)\n }\n\n return {\n push(text: string): string[] {\n buffer += text\n const out: string[] = []\n let newline = buffer.indexOf('\\n')\n while (newline >= 0) {\n take_line(buffer.slice(0, newline), out)\n buffer = buffer.slice(newline + 1)\n newline = buffer.indexOf('\\n')\n }\n return out\n },\n flush(): string[] {\n const out: string[] = []\n if (buffer.length > 0) take_line(buffer, out)\n buffer = ''\n on_flush?.(out)\n return out\n },\n }\n}\n\n/**\n * Decode a tool call's wire `arguments` string into the engine's input value:\n * non-empty JSON parses (bad JSON is a provider_error naming the tool), and\n * an absent or empty value means `{}`, the shape some servers send for\n * no-argument calls. The Ollama wire's structured-object arguments are its\n * caller's business before this runs.\n */\nexport function parse_tool_call_arguments(\n raw_args: unknown,\n provider: string,\n tool_name: string,\n): unknown {\n if (typeof raw_args === 'string' && raw_args.length > 0) {\n try {\n return JSON.parse(raw_args)\n } catch {\n throw new provider_error(\n `${provider} native: tool_calls arguments for ${tool_name} is not valid JSON`,\n )\n }\n }\n return {}\n}\n\n/**\n * Fold engine messages into a wire's message array by role. Serves the wires\n * whose messages map 1:1 in place (chat/completions, Ollama's /api/chat); the\n * Messages API's system-hoisting and role-merging rules live in its own\n * mapper instead.\n */\nexport function map_messages_by_role<m>(\n messages: ReadonlyArray<Message>,\n wire: {\n system: (content: string) => m\n user: (content: string | UserContentPart[]) => m\n assistant: (content: string | AssistantContentPart[]) => m\n tool: (message: Extract<Message, { role: 'tool' }>) => m\n },\n): m[] {\n const out: m[] = []\n for (const message of messages) {\n switch (message.role) {\n case 'system':\n out.push(wire.system(message.content))\n break\n case 'user':\n out.push(wire.user(message.content))\n break\n case 'assistant':\n out.push(wire.assistant(message.content))\n break\n case 'tool':\n out.push(wire.tool(message))\n break\n }\n }\n return out\n}\n\n/**\n * Partition assistant content parts into the text runs and tool calls the\n * wire mappers serialize separately.\n */\nexport function split_assistant_parts(parts: ReadonlyArray<AssistantContentPart>): {\n texts: string[]\n tool_parts: Array<Extract<AssistantContentPart, { type: 'tool_call' }>>\n} {\n const texts: string[] = []\n const tool_parts: Array<Extract<AssistantContentPart, { type: 'tool_call' }>> = []\n for (const part of parts) {\n if (part.type === 'text') texts.push(part.text)\n else tool_parts.push(part)\n }\n return { texts, tool_parts }\n}\n\n/**\n * Read the api_key and base_url every OpenAI-compatible dialect starts from:\n * a missing or non-string api_key becomes '' (the core's empty-key guard owns\n * the throw), and an absent base_url falls back to the dialect's default.\n */\nexport function read_dialect_init(\n init: ProviderInit,\n default_base_url: string,\n): { api_key: string; base_url: string } {\n return {\n api_key: typeof init.api_key === 'string' ? init.api_key : '',\n base_url:\n typeof init.base_url === 'string' && init.base_url.length > 0\n ? init.base_url\n : default_base_url,\n }\n}\n","/**\n * Incremental SSE decoder shared by the native (raw-HTTP) provider adapters.\n */\nimport { create_line_splitter } from './native_shared.js'\n\n/**\n * Wire-neutral framing only: push() takes decoded text as it arrives off the\n * wire (any chunk boundary, including mid-line) and returns the data payloads\n * of every event completed by that chunk; flush() drains an event left open\n * when the stream ends without a trailing blank line. Only `data:` fields\n * matter to the streams fascicle consumes (the Messages API repeats the\n * event type inside the JSON payload and the Chat Completions stream sends\n * nothing but data frames), so `event:`/`id:`/`retry:` fields and `:`\n * comments are dropped. Multi-line data joins with '\\n' per the SSE spec.\n */\nexport function create_sse_decoder(): {\n push: (text: string) => string[]\n flush: () => string[]\n} {\n let data_lines: string[] = []\n\n const close_event = (out: string[]): void => {\n if (data_lines.length > 0) {\n out.push(data_lines.join('\\n'))\n data_lines = []\n }\n }\n\n return create_line_splitter(\n (line, out) => {\n if (line.length === 0) {\n close_event(out)\n return\n }\n if (line.startsWith(':')) return\n if (line.startsWith('data:')) {\n const value = line.slice(5)\n data_lines.push(value.startsWith(' ') ? value.slice(1) : value)\n }\n },\n close_event,\n )\n}\n","/**\n * Native Anthropic provider adapter (raw HTTP).\n *\n * Talks to the Messages API directly over global fetch with zero `ai` /\n * `@ai-sdk/*` in its module graph. It owns request/response mapping only:\n * generate.ts wraps invoke_turn in retry + classification + abort, so\n * failures are thrown in shapes the shared classify_provider_error already\n * understands (`status` + `responseHeaders` for HTTP transients,\n * `kind: 'network'` for transport failures) instead of being re-classified\n * or retried here.\n *\n * Selected via `transport: 'native'` on the anthropic provider init. The\n * adapter name stays 'anthropic' so DEFAULT_PRICING keys and UsageTotals\n * fields keep working across transports. Schema requests ride the engine's\n * prompt + parse + repair loop, so `TurnRequest.schema` is intentionally\n * unread. Streaming hand-rolls the SSE parse; the aggregator rebuilds the\n * non-stream payload shape and feeds it through the same\n * parse_messages_response, so streamed and non-streamed results are equal by\n * construction rather than by parallel code paths.\n */\n\nimport { to_json_schema } from '#schema'\nimport type {\n AssistantContentPart,\n EffortLevel,\n FinishReason,\n Message,\n ProviderInit,\n StreamChunk,\n Tool,\n TurnRequest,\n TurnResult,\n UsageTotals,\n UserContentPart,\n} from '../types.js'\nimport {\n engine_config_error,\n provider_capability_error,\n provider_error,\n} from '../errors.js'\nimport { consume_framed_stream, invoke_http_turn } from './native_shared.js'\nimport { create_sse_decoder } from './sse_native.js'\nimport type { NativeProviderAdapter, ProviderCapability } from './types.js'\n\n/**\n * Effort level to extended-thinking budget tokens. Lives here (not in\n * anthropic.ts) because both transports map effort from this table and the\n * ai_sdk factory already imports this module for transport dispatch; the\n * reverse import would be a cycle.\n */\nexport const ANTHROPIC_THINKING_BUDGETS: Record<EffortLevel, number> = {\n none: 0,\n low: 1024,\n medium: 5000,\n high: 20000,\n xhigh: 32000,\n max: 64000,\n}\n\nconst ANTHROPIC_VERSION = '2023-06-01'\n\n/**\n * Matches the @ai-sdk/anthropic baseURL convention (origin + /v1) so a\n * base_url configured for the ai_sdk transport keeps pointing at the same\n * place when the transport flips to native.\n */\nconst DEFAULT_BASE_URL = 'https://api.anthropic.com/v1'\n\n/**\n * The Messages API requires max_tokens on every request. When extended\n * thinking is enabled the budget counts against max_tokens, so the default\n * rides on top of the thinking budget rather than being swallowed by it.\n */\nconst DEFAULT_MAX_TOKENS = 4096\n\ntype AnthropicContentBlock =\n | { type: 'text'; text: string }\n | { type: 'tool_use'; id: string; name: string; input: unknown }\n | { type: 'tool_result'; tool_use_id: string; content: string }\n\nexport type AnthropicMessage = {\n role: 'user' | 'assistant'\n content: AnthropicContentBlock[]\n}\n\n/**\n * Wrap non-blank text in a single text block; blank text maps to no blocks,\n * since the API rejects empty text blocks.\n */\nfunction text_blocks(text: string): AnthropicContentBlock[] {\n return text.trim().length > 0 ? [{ type: 'text', text }] : []\n}\n\n/**\n * Map user message content to Messages-API text blocks, dropping empty text\n * (the API rejects empty blocks). Image parts throw a capability error: they\n * are not mapped on this transport.\n */\nfunction to_user_blocks(content: string | UserContentPart[]): AnthropicContentBlock[] {\n if (typeof content === 'string') return text_blocks(content)\n const blocks: AnthropicContentBlock[] = []\n for (const part of content) {\n if (part.type === 'image') {\n throw new provider_capability_error(\n 'anthropic',\n 'image_input',\n \"image parts are not mapped on the native transport; use transport: 'ai_sdk'\",\n )\n }\n blocks.push(...text_blocks(part.text))\n }\n return blocks\n}\n\n/**\n * Map assistant message content to Messages-API blocks: text parts become\n * text blocks (empties dropped), tool-call parts become tool_use blocks.\n */\nfunction to_assistant_blocks(\n content: string | AssistantContentPart[],\n): AnthropicContentBlock[] {\n if (typeof content === 'string') return text_blocks(content)\n const blocks: AnthropicContentBlock[] = []\n for (const part of content) {\n if (part.type === 'text') {\n blocks.push(...text_blocks(part.text))\n } else {\n blocks.push({ type: 'tool_use', id: part.id, name: part.name, input: part.input })\n }\n }\n return blocks\n}\n\n/**\n * Map fascicle Message[] to Messages-API shape: leading system messages hoist\n * to the top-level `system` string, tool messages become `tool_result` blocks\n * on a user turn, and empty text blocks are dropped (the API rejects them).\n * generate.ts already hoists leading system into TurnRequest.system, so the\n * hoist here only fires when the adapter is driven directly.\n */\nexport function to_anthropic_messages(messages: ReadonlyArray<Message>): {\n system: string | undefined\n messages: AnthropicMessage[]\n} {\n const system_parts: string[] = []\n const out: AnthropicMessage[] = []\n\n const push_blocks = (role: 'user' | 'assistant', blocks: AnthropicContentBlock[]): void => {\n if (blocks.length === 0) return\n const last = out[out.length - 1]\n // The Messages API requires alternating roles; consecutive same-role\n // entries (parallel tool results, or a tool result followed by user\n // text) merge into one message.\n if (last?.role === role) {\n last.content.push(...blocks)\n return\n }\n out.push({ role, content: blocks })\n }\n\n for (const message of messages) {\n switch (message.role) {\n case 'system': {\n if (out.length > 0) {\n throw new provider_capability_error(\n 'anthropic',\n 'mid_conversation_system_messages',\n 'the Messages API accepts system text only before the first user/assistant turn',\n )\n }\n system_parts.push(message.content)\n break\n }\n case 'user': {\n push_blocks('user', to_user_blocks(message.content))\n break\n }\n case 'assistant': {\n push_blocks('assistant', to_assistant_blocks(message.content))\n break\n }\n case 'tool': {\n push_blocks('user', [\n { type: 'tool_result', tool_use_id: message.tool_call_id, content: message.content },\n ])\n break\n }\n }\n }\n\n return {\n system: system_parts.length > 0 ? system_parts.join('\\n\\n') : undefined,\n messages: out,\n }\n}\n\n/**\n * Map fascicle tool definitions to the Messages-API tool shape, converting\n * each input schema to JSON Schema.\n */\nexport function to_anthropic_tools(\n tools: ReadonlyArray<Tool>,\n): Array<{ name: string; description: string; input_schema: unknown }> {\n return tools.map((tool) => ({\n name: tool.name,\n description: tool.description,\n input_schema: to_json_schema(tool.input_schema),\n }))\n}\n\n/**\n * Build the Messages-API request body for one turn: mapped messages and\n * tools, the effort-derived thinking block, the required max_tokens default,\n * and the `provider_options.anthropic` wire passthrough merged last.\n */\nexport function build_messages_body(req: TurnRequest): Record<string, unknown> {\n const { system: hoisted_system, messages } = to_anthropic_messages(req.messages)\n const system_parts = [req.system, hoisted_system].filter(\n (s): s is string => typeof s === 'string' && s.length > 0,\n )\n const budget = ANTHROPIC_THINKING_BUDGETS[req.effort]\n const thinking_enabled = budget > 0\n\n const body: Record<string, unknown> = {\n model: req.model_id,\n messages,\n max_tokens:\n req.max_tokens ?? (thinking_enabled ? budget + DEFAULT_MAX_TOKENS : DEFAULT_MAX_TOKENS),\n }\n if (system_parts.length > 0) body['system'] = system_parts.join('\\n\\n')\n if (req.tools.length > 0) body['tools'] = to_anthropic_tools(req.tools)\n if (req.stream) body['stream'] = true\n if (thinking_enabled) {\n body['thinking'] = { type: 'enabled', budget_tokens: budget }\n } else {\n // The API rejects temperature/top_p alongside extended thinking, so\n // sampling params apply only when thinking is off (parity with the\n // @ai-sdk/anthropic backend, which strips them the same way). The inner\n // guards already gate each key, so the branch is a plain else rather than\n // a redundant `else if` on the same two conditions.\n if (req.temperature !== undefined) body['temperature'] = req.temperature\n if (req.top_p !== undefined) body['top_p'] = req.top_p\n }\n // provider_options.anthropic is raw wire-format passthrough (snake_case\n // Messages-API keys, not the ai_sdk transport's camelCase spellings),\n // shallow-merged last so an explicit user key beats every derived field:\n // the effort-derived thinking block, the max_tokens default, sampling\n // params. The adapter does not reconcile interactions the API rejects\n // (e.g. a passthrough temperature alongside thinking); wire keys are the\n // user asserting they know the wire.\n const passthrough = req.provider_options?.['anthropic']\n // Stryker disable next-line ConditionalExpression: spreading an undefined\n // passthrough is a no-op, so forcing the merge branch ({ ...body, ...undefined })\n // deep-equals this fast-path return; only the merge branch is observable.\n return passthrough === undefined ? body : { ...body, ...passthrough }\n}\n\n/**\n * Map the Messages-API stop_reason to the engine's FinishReason.\n */\nexport function map_anthropic_stop_reason(raw: unknown): FinishReason {\n switch (raw) {\n case 'tool_use':\n return 'tool_calls'\n case 'max_tokens':\n case 'model_context_window_exceeded':\n return 'length'\n case 'refusal':\n return 'content_filter'\n // end_turn, stop_sequence, pause_turn, and anything unrecognized all\n // mean \"the model stopped on its own\".\n default:\n return 'stop'\n }\n}\n\n/**\n * Map the Messages-API usage object to UsageTotals.\n *\n * The API reports input_tokens EXCLUSIVE of cache reads and writes, while\n * compute_cost subtracts both back out of UsageTotals.input_tokens to price\n * the fresh remainder. So the inclusive total is the sum of all three; a\n * straight copy would silently under-count input cost on cached calls.\n */\nexport function map_anthropic_usage(raw: unknown): UsageTotals {\n if (raw === null || typeof raw !== 'object') {\n return { input_tokens: 0, output_tokens: 0 }\n }\n const read = (key: string): number | undefined => {\n const value: unknown = Reflect.get(raw, key)\n return typeof value === 'number' ? value : undefined\n }\n const cache_read = read('cache_read_input_tokens')\n const cache_write = read('cache_creation_input_tokens')\n const totals: UsageTotals = {\n input_tokens: (read('input_tokens') ?? 0) + (cache_read ?? 0) + (cache_write ?? 0),\n output_tokens: read('output_tokens') ?? 0,\n }\n if (cache_read !== undefined) totals.cached_input_tokens = cache_read\n if (cache_write !== undefined) totals.cache_write_tokens = cache_write\n return totals\n}\n\n/**\n * Read the id and name a tool_use block must carry, throwing a\n * provider_error naming `where` the malformed block appeared.\n */\nfunction read_tool_use_identity(block: object, where: string): { id: string; name: string } {\n const id: unknown = Reflect.get(block, 'id')\n const name: unknown = Reflect.get(block, 'name')\n if (typeof id !== 'string' || typeof name !== 'string') {\n throw new provider_error(`anthropic native: malformed tool_use block in ${where}`)\n }\n return { id, name }\n}\n\n/**\n * Fold one response `content` block into the text/tool_call accumulators.\n * Text blocks append their string; tool_use blocks contribute a call whose id\n * and name are validated by read_tool_use_identity; thinking /\n * redacted_thinking blocks have no TurnResult field and are skipped.\n */\nfunction push_content_block(\n block: unknown,\n text_parts: string[],\n tool_calls: Array<{ id: string; name: string; input: unknown }>,\n): void {\n if (block === null || typeof block !== 'object') return\n const type: unknown = Reflect.get(block, 'type')\n if (type === 'text') {\n const text: unknown = Reflect.get(block, 'text')\n if (typeof text === 'string') text_parts.push(text)\n return\n }\n if (type === 'tool_use') {\n const { id, name } = read_tool_use_identity(block, 'response content')\n tool_calls.push({ id, name, input: Reflect.get(block, 'input') })\n }\n}\n\n/**\n * Walk a response payload's `content` array into the flat text and tool_call\n * lists a TurnResult carries. A non-array `content` yields empty lists,\n * matching a payload that carried no content blocks.\n */\nfunction collect_content_blocks(content: unknown): {\n text_parts: string[]\n tool_calls: Array<{ id: string; name: string; input: unknown }>\n} {\n const text_parts: string[] = []\n const tool_calls: Array<{ id: string; name: string; input: unknown }> = []\n if (Array.isArray(content)) {\n for (const block of content) push_content_block(block, text_parts, tool_calls)\n }\n return { text_parts, tool_calls }\n}\n\n/**\n * Parse a non-stream Messages-API response payload into a TurnResult. The\n * stream aggregator rebuilds this same payload shape and feeds it here too,\n * so both paths share one parser.\n */\nexport function parse_messages_response(payload: unknown): TurnResult {\n if (payload === null || typeof payload !== 'object') {\n throw new provider_error('anthropic native: response payload is not a JSON object')\n }\n const { text_parts, tool_calls } = collect_content_blocks(Reflect.get(payload, 'content'))\n return {\n text: text_parts.join(''),\n tool_calls,\n finish_reason: map_anthropic_stop_reason(Reflect.get(payload, 'stop_reason')),\n usage: map_anthropic_usage(Reflect.get(payload, 'usage')),\n }\n}\n\n/**\n * Mid-stream `error` events reuse the HTTP status classification:\n * overloaded_error is the SSE analog of a 529, api_error of a 500, and\n * rate_limit_error of a 429, so classify_provider_error sees the transients\n * it already retries. Anything else is a permanent provider_error. Whether a\n * retry actually happens stays retry_turn's call: once chunks have streamed\n * it refuses, exactly as on the ai_sdk path.\n */\nfunction stream_event_error(event: object): Error {\n const error: unknown = Reflect.get(event, 'error')\n let error_type = 'unknown'\n let message = '(no message)'\n if (error !== null && typeof error === 'object') {\n const raw_type: unknown = Reflect.get(error, 'type')\n if (typeof raw_type === 'string' && raw_type.length > 0) error_type = raw_type\n const raw_message: unknown = Reflect.get(error, 'message')\n if (typeof raw_message === 'string' && raw_message.length > 0) message = raw_message\n }\n const detail = `anthropic stream error (${error_type}): ${message}`\n let status: number | undefined\n if (error_type === 'overloaded_error') status = 529\n else if (error_type === 'api_error') status = 500\n else if (error_type === 'rate_limit_error') status = 429\n if (status !== undefined) return Object.assign(new Error(detail), { status })\n return new provider_error(detail)\n}\n\n/**\n * Read the `index` field every stream event carries, identifying which\n * content block (text or tool_use) the event applies to.\n */\nfunction read_block_index(event: object): number {\n const index: unknown = Reflect.get(event, 'index')\n if (typeof index !== 'number') {\n throw new provider_error('anthropic native: stream event is missing its block index')\n }\n return index\n}\n\n/**\n * Consume parsed Messages-stream events, dispatching StreamChunks as they\n * arrive and rebuilding the non-stream response payload as it goes: text\n * deltas accumulate into synthetic text blocks, tool_use input arrives as raw\n * JSON text (input_json_delta) held per open block and parsed at\n * content_block_stop. complete() feeds the synthetic payload through\n * parse_messages_response, which is what makes the streamed TurnResult equal\n * the non-streamed one by construction. A stream that ends without\n * message_stop is truncated output, so complete() fails loud instead of\n * returning a partial turn.\n */\nfunction create_stream_aggregator(\n step_index: number,\n dispatch: (chunk: StreamChunk) => Promise<void>,\n): {\n handle: (data: string) => Promise<void>\n complete: () => TurnResult\n} {\n type SyntheticToolUse = { type: 'tool_use'; id: string; name: string; input: unknown }\n // Stryker disable next-line ArrayDeclaration: a seeded initial element is dropped by\n // parse_messages_response's block guard, so a non-empty content array is unobservable.\n const content: Array<{ type: 'text'; text: string } | SyntheticToolUse> = []\n const open_text = new Map<number, { type: 'text'; text: string }>()\n const open_tools = new Map<number, { block: SyntheticToolUse; json: string }>()\n const usage: Record<string, number> = {}\n let stop_reason: string | undefined\n let stopped = false\n\n // message_delta usage (cumulative output_tokens) overlays message_start\n // usage (input + cache fields); nested non-numeric containers are skipped.\n const merge_usage = (raw: unknown): void => {\n if (raw === null || typeof raw !== 'object') return\n for (const [key, value] of Object.entries(raw)) {\n if (typeof value === 'number') usage[key] = value\n }\n }\n\n const on_block_start = async (event: object): Promise<void> => {\n const index = read_block_index(event)\n const block: unknown = Reflect.get(event, 'content_block')\n if (block === null || typeof block !== 'object') return\n const type: unknown = Reflect.get(block, 'type')\n if (type === 'text') {\n const initial: unknown = Reflect.get(block, 'text')\n const synthetic = {\n type: 'text' as const,\n text: typeof initial === 'string' ? initial : '',\n }\n content.push(synthetic)\n open_text.set(index, synthetic)\n return\n }\n if (type === 'tool_use') {\n const { id, name } = read_tool_use_identity(block, 'stream')\n const synthetic: SyntheticToolUse = {\n type: 'tool_use',\n id,\n name,\n input: Reflect.get(block, 'input') ?? {},\n }\n content.push(synthetic)\n open_tools.set(index, { block: synthetic, json: '' })\n await dispatch({ kind: 'tool_call_start', id, name, step_index })\n }\n // thinking / redacted_thinking blocks carry no TurnResult state; their\n // deltas dispatch reasoning chunks directly.\n }\n\n const on_block_delta = async (event: object): Promise<void> => {\n const index = read_block_index(event)\n const delta: unknown = Reflect.get(event, 'delta')\n if (delta === null || typeof delta !== 'object') return\n const type: unknown = Reflect.get(delta, 'type')\n if (type === 'text_delta') {\n const text: unknown = Reflect.get(delta, 'text')\n const open = open_text.get(index)\n if (typeof text !== 'string' || open === undefined) return\n open.text += text\n await dispatch({ kind: 'text', text, step_index })\n return\n }\n if (type === 'thinking_delta') {\n const thinking: unknown = Reflect.get(delta, 'thinking')\n if (typeof thinking === 'string') {\n await dispatch({ kind: 'reasoning', text: thinking, step_index })\n }\n return\n }\n if (type === 'input_json_delta') {\n const partial: unknown = Reflect.get(delta, 'partial_json')\n const open = open_tools.get(index)\n if (typeof partial !== 'string' || open === undefined) return\n open.json += partial\n await dispatch({\n kind: 'tool_call_input_delta',\n id: open.block.id,\n delta: partial,\n step_index,\n })\n }\n // signature_delta and future delta kinds have no engine chunk; dropped.\n }\n\n const on_block_stop = async (event: object): Promise<void> => {\n const index = read_block_index(event)\n const open = open_tools.get(index)\n open_text.delete(index)\n if (open === undefined) return\n open_tools.delete(index)\n if (open.json.length > 0) {\n try {\n open.block.input = JSON.parse(open.json)\n } catch {\n throw new provider_error(\n `anthropic native: tool_use input for ${open.block.name} is not valid JSON`,\n )\n }\n }\n await dispatch({\n kind: 'tool_call_end',\n id: open.block.id,\n input: open.block.input,\n step_index,\n })\n }\n\n return {\n async handle(data: string): Promise<void> {\n let event: unknown\n try {\n event = JSON.parse(data)\n } catch {\n throw new provider_error('anthropic native: stream event is not valid JSON')\n }\n if (event === null || typeof event !== 'object') return\n switch (Reflect.get(event, 'type')) {\n case 'message_start': {\n const message: unknown = Reflect.get(event, 'message')\n if (message !== null && typeof message === 'object') {\n merge_usage(Reflect.get(message, 'usage'))\n }\n break\n }\n case 'content_block_start':\n await on_block_start(event)\n break\n case 'content_block_delta':\n await on_block_delta(event)\n break\n case 'content_block_stop':\n await on_block_stop(event)\n break\n case 'message_delta': {\n const delta: unknown = Reflect.get(event, 'delta')\n if (delta !== null && typeof delta === 'object') {\n const raw: unknown = Reflect.get(delta, 'stop_reason')\n if (typeof raw === 'string') stop_reason = raw\n }\n merge_usage(Reflect.get(event, 'usage'))\n break\n }\n case 'message_stop':\n stopped = true\n await dispatch({\n kind: 'step_finish',\n step_index,\n finish_reason: map_anthropic_stop_reason(stop_reason),\n usage: map_anthropic_usage(usage),\n })\n break\n case 'error':\n throw stream_event_error(event)\n // ping and unrecognized future event types are dropped on purpose.\n default:\n break\n }\n },\n complete(): TurnResult {\n if (!stopped) {\n throw new provider_error(\n 'anthropic native: stream ended before message_stop; the result would be truncated',\n )\n }\n return parse_messages_response({ content, stop_reason, usage })\n },\n }\n}\n\n/**\n * Drain a streaming Messages response through the shared framed-stream\n * consumer: SSE framing feeding the aggregator, which dispatches chunks\n * through req.dispatch_chunk as they arrive.\n */\nasync function consume_sse_response(response: Response, req: TurnRequest): Promise<TurnResult> {\n return consume_framed_stream(response, req, 'anthropic', create_sse_decoder(), (dispatch) =>\n create_stream_aggregator(req.step_index, dispatch),\n )\n}\n\n// 'structured_output' is intentionally absent: schema requests ride the\n// prompt + parse + repair loop instead of constrained decoding. Image parts\n// are unmapped on this transport.\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n 'reasoning',\n])\n\n/**\n * Build the native Anthropic adapter: validates the required api_key,\n * normalizes base_url, and wires invoke_turn to POST /messages directly\n * (streamed or not) through the mappers above.\n */\nexport const create_anthropic_native_adapter = (\n init: ProviderInit,\n): NativeProviderAdapter => {\n const api_key = typeof init.api_key === 'string' ? init.api_key : ''\n if (api_key.length === 0) {\n throw new engine_config_error(\n 'anthropic provider requires a non-empty api_key',\n 'anthropic',\n )\n }\n const base_url = (\n typeof init.base_url === 'string' && init.base_url.length > 0\n ? init.base_url\n : DEFAULT_BASE_URL\n ).replace(/\\/+$/, '')\n\n return {\n kind: 'native',\n name: 'anthropic',\n async invoke_turn(req: TurnRequest): Promise<TurnResult> {\n return invoke_http_turn(\n req,\n 'anthropic',\n {\n url: `${base_url}/messages`,\n headers: {\n 'content-type': 'application/json',\n 'x-api-key': api_key,\n 'anthropic-version': ANTHROPIC_VERSION,\n },\n build_body: () => build_messages_body(req),\n },\n {\n stream: (response) => consume_sse_response(response, req),\n parse: parse_messages_response,\n },\n )\n },\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * Anthropic provider adapter.\n *\n * Dispatches on `transport`: the default 'ai_sdk' backend wraps\n * @ai-sdk/anthropic as an optional peer; 'native' returns the raw-HTTP\n * adapter from anthropic_native.ts. Effort levels map to extended-thinking\n * budget tokens.\n */\n\nimport type { EffortLevel, ProviderInit, UsageTotals } from '../types.js'\nimport {\n default_normalize_usage,\n load_optional_peer,\n resolve_transport,\n type AiSdkProviderAdapter,\n type EffortTranslation,\n type ProviderAdapter,\n type ProviderCapability,\n type RawProviderUsage,\n} from './types.js'\nimport {\n ANTHROPIC_THINKING_BUDGETS,\n create_anthropic_native_adapter,\n} from './anthropic_native.js'\nimport { engine_config_error } from '../errors.js'\n\ntype AnthropicSdk = {\n createAnthropic: (config: {\n apiKey?: string\n baseURL?: string\n }) => (model_id: string) => unknown\n}\n\n/**\n * Map an effort level to Anthropic's extended-thinking provider options.\n *\n * A zero budget (which is what `none` maps to) sends no thinking config at all\n * rather than an explicit \"disabled\" value, so non-reasoning models see a plain\n * request.\n */\nexport function translate_anthropic_effort(effort: EffortLevel): EffortTranslation {\n const budget = ANTHROPIC_THINKING_BUDGETS[effort]\n if (budget === 0) {\n return { provider_options: {}, effort_ignored: false }\n }\n return {\n provider_options: {\n anthropic: {\n // @ai-sdk/anthropic reads `budgetTokens` (camelCase) and maps it to the\n // API's `budget_tokens`. Passing snake_case here is silently stripped by\n // the provider's zod schema, so the budget never reaches the wire.\n thinking: { type: 'enabled', budgetTokens: budget },\n },\n },\n effort_ignored: false,\n }\n}\n\n/**\n * Normalize Anthropic usage via the shared default mapper; the AI SDK already\n * reports cache and reasoning tokens in the fields the default reads.\n */\nexport function normalize_anthropic_usage(raw: RawProviderUsage | undefined): UsageTotals {\n return default_normalize_usage(raw)\n}\n\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n 'image_input',\n 'reasoning',\n])\n\n/**\n * Build the Anthropic adapter, dispatching on `init.transport`: 'native' for\n * the raw-HTTP Messages API adapter, otherwise the AI SDK wrapper.\n */\nexport const create_anthropic_adapter = (init: ProviderInit): ProviderAdapter => {\n if (resolve_transport(init, 'anthropic') === 'native') {\n return create_anthropic_native_adapter(init)\n }\n return create_anthropic_ai_sdk_adapter(init)\n}\n\n/**\n * Build the AI SDK-backed Anthropic adapter. Requires a non-empty api_key at\n * construction; @ai-sdk/anthropic itself loads lazily on first build_model so\n * the peer is only required when a model is actually used.\n */\nconst create_anthropic_ai_sdk_adapter = (init: ProviderInit): AiSdkProviderAdapter => {\n const api_key = typeof init.api_key === 'string' ? init.api_key : ''\n if (api_key.length === 0) {\n throw new engine_config_error(\n 'anthropic provider requires a non-empty api_key',\n 'anthropic',\n )\n }\n const base_url = typeof init.base_url === 'string' ? init.base_url : undefined\n\n return {\n kind: 'ai_sdk',\n name: 'anthropic',\n async build_model(model_id: string): Promise<unknown> {\n const sdk = await load_optional_peer<AnthropicSdk>('@ai-sdk/anthropic')\n const config: { apiKey: string; baseURL?: string } = { apiKey: api_key }\n if (base_url !== undefined) config.baseURL = base_url\n const provider = sdk.createAnthropic(config)\n return provider(model_id)\n },\n translate_effort: translate_anthropic_effort,\n normalize_usage: normalize_anthropic_usage,\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * OpenAI-compatible native core: one `chat/completions` implementation\n * talking raw HTTP, shared by every OpenAI-compatible provider.\n *\n * Parameterized by a dialect config: base_url, auth strategy, extra headers,\n * stream-usage behavior, token-limit field name, and usage tolerance. The\n * `openai`, `openrouter`, and `lmstudio` factories each build a dialect and\n * share this core; pointing base_url at any compat server (including\n * Ollama's /v1) rides the same path.\n *\n * This module imports nothing from `ai` or `@ai-sdk/*`. The adapter owns\n * request/response mapping only: generate.ts wraps invoke_turn in retry +\n * classification + abort, so failures are thrown in shapes the shared\n * classify_provider_error already understands (`status` + `responseHeaders`\n * for HTTP transients, `kind: 'network'` for transport failures), never\n * retried here. Schema requests ride the engine's prompt + parse + repair\n * loop, so `TurnRequest.schema` is intentionally unread. Streaming hand-rolls\n * the SSE parse (`data:` lines, the literal `[DONE]` terminator, index-keyed\n * tool_call delta accumulation); the aggregator rebuilds the non-stream\n * payload shape and feeds it through the same parse_chat_completion, so\n * streamed and non-streamed results are equal by construction rather than by\n * parallel code paths.\n */\n\nimport { to_json_schema } from '#schema'\nimport type {\n AssistantContentPart,\n EffortLevel,\n FinishReason,\n Message,\n StreamChunk,\n Tool,\n TurnRequest,\n TurnResult,\n UsageTotals,\n UserContentPart,\n} from '../types.js'\nimport {\n engine_config_error,\n provider_capability_error,\n provider_error,\n} from '../errors.js'\nimport {\n consume_framed_stream,\n invoke_http_turn,\n map_messages_by_role,\n parse_tool_call_arguments,\n split_assistant_parts,\n} from './native_shared.js'\nimport { create_sse_decoder } from './sse_native.js'\nimport type { NativeProviderAdapter, ProviderCapability } from './types.js'\n\n/**\n * Per-dialect wire knobs. `name` is the provider name the adapter reports\n * and the `provider_options` key it reads, kept stable across transports so\n * pricing keys and usage fields carry over. `tolerant_usage` marks backends\n * whose usage may be absent or approximate (lmstudio, ollama-compat): the\n * mapper returns zeroed totals instead of throwing.\n */\nexport type OpenAICompatibleDialect = {\n readonly name: string\n readonly base_url: string\n readonly auth: { kind: 'bearer'; api_key: string } | { kind: 'none' }\n readonly extra_headers?: Readonly<Record<string, string>>\n readonly token_limit_field: 'max_tokens' | 'max_completion_tokens'\n readonly stream_include_usage: boolean\n readonly tolerant_usage: boolean\n}\n\n/**\n * The wire enum is `low | medium | high` only, so `xhigh` and `max` clamp to\n * `high`, the same clamp as the ai_sdk transport's `reasoningEffort`. `none`\n * omits the field entirely. Non-reasoning models ignore the field\n * server-side; the adapter does not model-sniff.\n */\nconst OPENAI_COMPATIBLE_REASONING_EFFORT: Record<\n Exclude<EffortLevel, 'none'>,\n 'low' | 'medium' | 'high'\n> = {\n low: 'low',\n medium: 'medium',\n high: 'high',\n xhigh: 'high',\n max: 'high',\n}\n\ntype ChatToolCall = {\n id: string\n type: 'function'\n function: { name: string; arguments: string }\n}\n\nexport type ChatMessage =\n | { role: 'system'; content: string }\n | { role: 'user'; content: string | Array<{ type: 'text'; text: string }> }\n | { role: 'assistant'; content: string | null; tool_calls?: ChatToolCall[] }\n | { role: 'tool'; tool_call_id: string; content: string }\n\n/**\n * Map user message content to this wire's shape (a string, or an array of\n * text parts). Image parts throw a capability error: they are not mapped on\n * the native transport.\n */\nfunction to_user_content(\n content: string | UserContentPart[],\n provider: string,\n): string | Array<{ type: 'text'; text: string }> {\n if (typeof content === 'string') return content\n const parts: Array<{ type: 'text'; text: string }> = []\n for (const part of content) {\n if (part.type === 'image') {\n throw new provider_capability_error(\n provider,\n 'image_input',\n \"image parts are not mapped on the native transport; use transport: 'ai_sdk'\",\n )\n }\n if (part.text.trim().length > 0) parts.push({ type: 'text', text: part.text })\n }\n return parts.length > 0 ? parts : ''\n}\n\n/**\n * Map assistant message content to Chat Completions shape: text parts join\n * into `content`, and tool-call parts become `tool_calls` entries with\n * JSON-stringified arguments.\n */\nfunction to_assistant_message(content: string | AssistantContentPart[]): ChatMessage {\n if (typeof content === 'string') return { role: 'assistant', content }\n const { texts, tool_parts } = split_assistant_parts(content)\n const tool_calls: ChatToolCall[] = tool_parts.map((part) => ({\n id: part.id,\n type: 'function',\n function: { name: part.name, arguments: JSON.stringify(part.input) },\n }))\n const text = texts.join('')\n // A tool-call turn with no prose sends content: null, the shape the API\n // itself produces; an all-text turn keeps its (possibly empty) string.\n const message: ChatMessage = {\n role: 'assistant',\n content: text.length > 0 || tool_calls.length === 0 ? text : null,\n }\n if (tool_calls.length > 0) message.tool_calls = tool_calls\n return message\n}\n\n/**\n * Map fascicle Message[] to Chat Completions shape. Unlike the Messages API\n * there is no top-level system field or role-alternation constraint: system\n * messages map in place at any position, and tool results are first-class\n * `tool` role messages keyed by tool_call_id.\n */\nexport function to_chat_messages(\n messages: ReadonlyArray<Message>,\n provider: string,\n): ChatMessage[] {\n return map_messages_by_role<ChatMessage>(messages, {\n system: (content) => ({ role: 'system', content }),\n user: (content) => ({ role: 'user', content: to_user_content(content, provider) }),\n assistant: to_assistant_message,\n tool: (message) => ({\n role: 'tool',\n tool_call_id: message.tool_call_id,\n content: message.content,\n }),\n })\n}\n\n/**\n * Map fascicle Tool[] to the Chat Completions function-tool shape,\n * converting each input schema to JSON Schema.\n */\nexport function to_chat_tools(tools: ReadonlyArray<Tool>): Array<{\n type: 'function'\n function: { name: string; description: string; parameters: unknown }\n}> {\n return tools.map((tool) => ({\n type: 'function',\n function: {\n name: tool.name,\n description: tool.description,\n parameters: to_json_schema(tool.input_schema),\n },\n }))\n}\n\n/**\n * Build the Chat Completions request body for one turn: mapped messages and\n * tools, the token-limit field named per dialect, sampling params, the\n * effort-derived reasoning_effort, and the dialect's\n * `provider_options.<name>` wire passthrough merged last.\n */\nexport function build_chat_completions_body(\n req: TurnRequest,\n dialect: OpenAICompatibleDialect,\n): Record<string, unknown> {\n const messages: ChatMessage[] = []\n if (req.system !== undefined && req.system.length > 0) {\n messages.push({ role: 'system', content: req.system })\n }\n messages.push(...to_chat_messages(req.messages, dialect.name))\n\n const body: Record<string, unknown> = {\n model: req.model_id,\n messages,\n }\n if (req.tools.length > 0) body['tools'] = to_chat_tools(req.tools)\n if (req.max_tokens !== undefined) body[dialect.token_limit_field] = req.max_tokens\n if (req.temperature !== undefined) body['temperature'] = req.temperature\n if (req.top_p !== undefined) body['top_p'] = req.top_p\n if (req.effort !== 'none') {\n body['reasoning_effort'] = OPENAI_COMPATIBLE_REASONING_EFFORT[req.effort]\n }\n if (req.stream) {\n body['stream'] = true\n // Usage arrives on the final pre-DONE chunk only when asked for; local\n // backends that ignore the flag fall under tolerant_usage.\n if (dialect.stream_include_usage) body['stream_options'] = { include_usage: true }\n }\n // provider_options.<name> is raw wire-format passthrough (snake_case\n // chat/completions keys), shallow-merged last so an explicit user key beats\n // every derived field: the effort-derived reasoning_effort, the token\n // limit, sampling params. Wire keys are the user asserting they know the\n // wire; the adapter does not reconcile interactions the API rejects.\n const passthrough = req.provider_options?.[dialect.name]\n return passthrough === undefined ? body : { ...body, ...passthrough }\n}\n\n/**\n * Map the Chat Completions finish_reason to the engine's FinishReason.\n */\nexport function map_chat_finish_reason(raw: unknown): FinishReason {\n switch (raw) {\n case 'tool_calls':\n return 'tool_calls'\n case 'length':\n return 'length'\n case 'content_filter':\n return 'content_filter'\n // stop and anything unrecognized both mean \"the model stopped on its own\".\n default:\n return 'stop'\n }\n}\n\n/**\n * Read a numeric field from a usage object, or undefined if absent or not a\n * number.\n */\nfunction read_number(source: object, key: string): number | undefined {\n const value: unknown = Reflect.get(source, key)\n return typeof value === 'number' ? value : undefined\n}\n\n/**\n * Map the Chat Completions usage object to UsageTotals. prompt_tokens is\n * already INCLUSIVE of cached tokens on this API, unlike Anthropic's\n * exclusive accounting, so a straight copy is correct; compute_cost\n * subtracts the cached portion back out. There is no cache-write concept on\n * this wire. A missing usage object throws under a strict dialect (a hosted\n * API omitting usage is a broken response) and zeroes under a tolerant one.\n */\nexport function map_chat_usage(raw: unknown, dialect: OpenAICompatibleDialect): UsageTotals {\n if (raw === null || typeof raw !== 'object') {\n if (dialect.tolerant_usage) return { input_tokens: 0, output_tokens: 0 }\n throw new provider_error(\n `${dialect.name} native: response is missing its usage object`,\n )\n }\n const totals: UsageTotals = {\n input_tokens: read_number(raw, 'prompt_tokens') ?? 0,\n output_tokens: read_number(raw, 'completion_tokens') ?? 0,\n }\n const prompt_details: unknown = Reflect.get(raw, 'prompt_tokens_details')\n if (prompt_details !== null && typeof prompt_details === 'object') {\n const cached = read_number(prompt_details, 'cached_tokens')\n if (cached !== undefined) totals.cached_input_tokens = cached\n }\n const completion_details: unknown = Reflect.get(raw, 'completion_tokens_details')\n if (completion_details !== null && typeof completion_details === 'object') {\n const reasoning = read_number(completion_details, 'reasoning_tokens')\n if (reasoning !== undefined) totals.reasoning_tokens = reasoning\n }\n return totals\n}\n\n/**\n * Parse one Chat Completions tool_calls entry into the engine's tool-call\n * shape, throwing a provider_error if the entry is missing id, function\n * name, or valid JSON arguments.\n */\nfunction parse_tool_call(raw: unknown, provider: string): TurnResult['tool_calls'][number] {\n if (raw === null || typeof raw !== 'object') {\n throw new provider_error(`${provider} native: malformed tool_calls entry in response`)\n }\n const id: unknown = Reflect.get(raw, 'id')\n const fn: unknown = Reflect.get(raw, 'function')\n if (typeof id !== 'string' || fn === null || typeof fn !== 'object') {\n throw new provider_error(`${provider} native: malformed tool_calls entry in response`)\n }\n const name: unknown = Reflect.get(fn, 'name')\n if (typeof name !== 'string') {\n throw new provider_error(`${provider} native: malformed tool_calls entry in response`)\n }\n // arguments is a JSON string on this wire.\n const input = parse_tool_call_arguments(Reflect.get(fn, 'arguments'), provider, name)\n return { id, name, input }\n}\n\n/**\n * The one response parser every path feeds: non-stream parses the payload\n * directly, and the streaming aggregator (next step) rebuilds this same\n * payload shape from deltas before calling it.\n */\nexport function parse_chat_completion(\n payload: unknown,\n dialect: OpenAICompatibleDialect,\n): TurnResult {\n if (payload === null || typeof payload !== 'object') {\n throw new provider_error(\n `${dialect.name} native: response payload is not a JSON object`,\n )\n }\n const choices: unknown = Reflect.get(payload, 'choices')\n const choice: unknown = Array.isArray(choices) ? choices[0] : undefined\n if (choice === null || choice === undefined || typeof choice !== 'object') {\n throw new provider_error(`${dialect.name} native: response has no choices`)\n }\n const message: unknown = Reflect.get(choice, 'message')\n if (message === null || typeof message !== 'object') {\n throw new provider_error(`${dialect.name} native: response choice has no message`)\n }\n const content: unknown = Reflect.get(message, 'content')\n const raw_tool_calls: unknown = Reflect.get(message, 'tool_calls')\n const tool_calls = Array.isArray(raw_tool_calls)\n ? raw_tool_calls.map((entry) => parse_tool_call(entry, dialect.name))\n : []\n return {\n text: typeof content === 'string' ? content : '',\n tool_calls,\n finish_reason: map_chat_finish_reason(Reflect.get(choice, 'finish_reason')),\n usage: map_chat_usage(Reflect.get(payload, 'usage'), dialect),\n }\n}\n\n/**\n * Consume Chat Completions stream frames (the JSON payload of each SSE\n * `data:` line, plus the literal `[DONE]` terminator), dispatching\n * StreamChunks as they arrive and rebuilding the non-stream payload as it\n * goes: `delta.content` accumulates into the message text, and\n * `delta.tool_calls[]` entries accumulate `function.arguments` string deltas\n * keyed by their `index` field. A tool call closes (parsed input dispatched)\n * when the choice's finish_reason frame arrives, or at `[DONE]` for servers\n * that never send one. Usage rides the final pre-DONE frame\n * (stream_options.include_usage); a stream that ends without `[DONE]` is\n * truncated output, so complete() fails loud instead of returning a partial\n * turn. complete() feeds the synthetic payload through parse_chat_completion,\n * which is what makes the streamed TurnResult equal the non-streamed one by\n * construction.\n */\nexport function create_chat_stream_aggregator(\n dialect: OpenAICompatibleDialect,\n step_index: number,\n dispatch: (chunk: StreamChunk) => Promise<void>,\n): {\n handle_data: (data: string) => Promise<void>\n complete: () => TurnResult\n} {\n type OpenToolCall = {\n index: number\n id: string\n name: string\n arguments: string\n closed: boolean\n }\n let text = ''\n const tool_calls: OpenToolCall[] = []\n const by_index = new Map<number, OpenToolCall>()\n let finish_reason: string | undefined\n let usage: unknown\n let done = false\n\n const in_index_order = (): OpenToolCall[] =>\n tool_calls.toSorted((a, b) => a.index - b.index)\n\n const close_tool_calls = async (): Promise<void> => {\n for (const call of in_index_order()) {\n if (call.closed) continue\n call.closed = true\n // parse_tool_call applies the same argument rules as the non-stream\n // path ('' means '{}', bad JSON is a provider_error naming the tool).\n const { input } = parse_tool_call(\n { id: call.id, function: { name: call.name, arguments: call.arguments } },\n dialect.name,\n )\n // oxlint-disable-next-line no-await-in-loop\n await dispatch({ kind: 'tool_call_end', id: call.id, input, step_index })\n }\n }\n\n const on_tool_call_delta = async (entry: unknown): Promise<void> => {\n if (entry === null || typeof entry !== 'object') {\n throw new provider_error(\n `${dialect.name} native: malformed tool_calls delta in stream`,\n )\n }\n const index: unknown = Reflect.get(entry, 'index')\n if (typeof index !== 'number') {\n throw new provider_error(\n `${dialect.name} native: stream tool_calls delta is missing its index`,\n )\n }\n const fn: unknown = Reflect.get(entry, 'function')\n let call = by_index.get(index)\n if (call === undefined) {\n const id: unknown = Reflect.get(entry, 'id')\n const name: unknown =\n fn !== null && typeof fn === 'object' ? Reflect.get(fn, 'name') : undefined\n if (typeof id !== 'string' || typeof name !== 'string') {\n throw new provider_error(\n `${dialect.name} native: stream tool_calls delta opened without id and name`,\n )\n }\n call = { index, id, name, arguments: '', closed: false }\n by_index.set(index, call)\n tool_calls.push(call)\n await dispatch({ kind: 'tool_call_start', id, name, step_index })\n }\n if (fn === null || typeof fn !== 'object') return\n const args: unknown = Reflect.get(fn, 'arguments')\n if (typeof args === 'string' && args.length > 0) {\n call.arguments += args\n await dispatch({\n kind: 'tool_call_input_delta',\n id: call.id,\n delta: args,\n step_index,\n })\n }\n }\n\n const on_choice = async (choice: object): Promise<void> => {\n const delta: unknown = Reflect.get(choice, 'delta')\n if (delta !== null && typeof delta === 'object') {\n const content: unknown = Reflect.get(delta, 'content')\n if (typeof content === 'string' && content.length > 0) {\n text += content\n await dispatch({ kind: 'text', text: content, step_index })\n }\n const raw_calls: unknown = Reflect.get(delta, 'tool_calls')\n if (Array.isArray(raw_calls)) {\n for (const entry of raw_calls) {\n // oxlint-disable-next-line no-await-in-loop\n await on_tool_call_delta(entry)\n }\n }\n }\n const raw_finish: unknown = Reflect.get(choice, 'finish_reason')\n if (typeof raw_finish === 'string') {\n finish_reason = raw_finish\n // The finish frame is the wire's word that every argument delta has\n // arrived, so open tool calls close here, before the usage frame.\n await close_tool_calls()\n }\n }\n\n return {\n async handle_data(data: string): Promise<void> {\n if (data === '[DONE]') {\n if (done) return\n done = true\n // Covers servers that omit the finish_reason frame; a no-op after one.\n await close_tool_calls()\n await dispatch({\n kind: 'step_finish',\n step_index,\n finish_reason: map_chat_finish_reason(finish_reason),\n usage: map_chat_usage(usage, dialect),\n })\n return\n }\n let frame: unknown\n try {\n frame = JSON.parse(data)\n } catch {\n throw new provider_error(`${dialect.name} native: stream frame is not valid JSON`)\n }\n if (frame === null || typeof frame !== 'object') return\n const raw_usage: unknown = Reflect.get(frame, 'usage')\n if (raw_usage !== null && typeof raw_usage === 'object') usage = raw_usage\n const choices: unknown = Reflect.get(frame, 'choices')\n const choice: unknown = Array.isArray(choices) ? choices[0] : undefined\n if (choice !== null && choice !== undefined && typeof choice === 'object') {\n await on_choice(choice)\n }\n },\n complete(): TurnResult {\n if (!done) {\n throw new provider_error(\n `${dialect.name} native: stream ended before [DONE]; the result would be truncated`,\n )\n }\n const ordered = in_index_order()\n const message: Record<string, unknown> = {\n role: 'assistant',\n content: text.length > 0 || ordered.length === 0 ? text : null,\n }\n if (ordered.length > 0) {\n message['tool_calls'] = ordered.map((call) => ({\n id: call.id,\n type: 'function',\n function: { name: call.name, arguments: call.arguments },\n }))\n }\n return parse_chat_completion(\n { choices: [{ index: 0, message, finish_reason: finish_reason ?? null }], usage },\n dialect,\n )\n },\n }\n}\n\n/**\n * Drain a streaming chat/completions response through the shared\n * framed-stream consumer: SSE framing feeding the aggregator, which\n * dispatches chunks through req.dispatch_chunk as they arrive. The\n * aggregator's `handle_data` name is part of its exported API, so it is\n * adapted to the consumer's `handle` shape here rather than renamed.\n */\nasync function consume_sse_response(\n response: Response,\n req: TurnRequest,\n dialect: OpenAICompatibleDialect,\n): Promise<TurnResult> {\n return consume_framed_stream(response, req, dialect.name, create_sse_decoder(), (dispatch) => {\n const aggregator = create_chat_stream_aggregator(dialect, req.step_index, dispatch)\n return { handle: aggregator.handle_data, complete: aggregator.complete }\n })\n}\n\n// 'structured_output' is intentionally absent (schema rides the prompt +\n// parse + repair loop); image parts are unmapped on this transport.\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n 'reasoning',\n])\n\n/**\n * Build a native OpenAI-compatible adapter from a dialect: validates the\n * dialect's api_key when auth is `bearer`, normalizes base_url, and wires\n * invoke_turn to POST /chat/completions directly (streamed or not) through\n * the mappers above.\n */\nexport const create_openai_compatible_adapter = (\n dialect: OpenAICompatibleDialect,\n): NativeProviderAdapter => {\n if (dialect.auth.kind === 'bearer' && dialect.auth.api_key.length === 0) {\n throw new engine_config_error(\n `${dialect.name} provider requires a non-empty api_key`,\n dialect.name,\n )\n }\n const base_url = dialect.base_url.replace(/\\/+$/, '')\n const headers: Record<string, string> = {\n 'content-type': 'application/json',\n ...dialect.extra_headers,\n }\n if (dialect.auth.kind === 'bearer') {\n headers['authorization'] = `Bearer ${dialect.auth.api_key}`\n }\n\n return {\n kind: 'native',\n name: dialect.name,\n async invoke_turn(req: TurnRequest): Promise<TurnResult> {\n return invoke_http_turn(\n req,\n dialect.name,\n {\n url: `${base_url}/chat/completions`,\n headers,\n build_body: () => build_chat_completions_body(req, dialect),\n },\n {\n stream: (response) => consume_sse_response(response, req, dialect),\n parse: (payload) => parse_chat_completion(payload, dialect),\n },\n )\n },\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * OpenAI provider adapter.\n *\n * Dispatches on `transport`: the default 'ai_sdk' backend wraps\n * @ai-sdk/openai as an optional peer; 'native' builds the openai dialect of\n * the shared OpenAI-compatible core, with Bearer auth, an\n * OpenAI-Organization header, `max_completion_tokens`, and\n * `reasoning_effort`. Effort maps to the o-series `reasoning_effort` string.\n * Non-reasoning models silently ignore the effort field (providers without\n * reasoning support drop it; signaling is model-specific and handled by the\n * orchestrator via the `effort_ignored` flag).\n */\n\nimport type { EffortLevel, ProviderInit, UsageTotals } from '../types.js'\nimport {\n default_normalize_usage,\n load_optional_peer,\n resolve_transport,\n type AiSdkProviderAdapter,\n type EffortTranslation,\n type NativeProviderAdapter,\n type ProviderAdapter,\n type ProviderCapability,\n type RawProviderUsage,\n} from './types.js'\nimport { read_dialect_init } from './native_shared.js'\nimport {\n create_openai_compatible_adapter,\n type OpenAICompatibleDialect,\n} from './openai_compatible_native.js'\nimport { engine_config_error } from '../errors.js'\n\ntype OpenaiSdk = {\n createOpenAI: (config: {\n apiKey?: string\n baseURL?: string\n organization?: string\n }) => (model_id: string) => unknown\n}\n\n// OpenAI's reasoning effort enum is `low | medium | high` only.\n// `xhigh` and `max` clamp to `high` until OpenAI exposes more levels.\nconst OPENAI_REASONING_EFFORT: Record<Exclude<EffortLevel, 'none'>, string> = {\n low: 'low',\n medium: 'medium',\n high: 'high',\n xhigh: 'high',\n max: 'high',\n}\n\n/**\n * Map an EffortLevel to OpenAI's `reasoningEffort` provider option.\n */\nexport function translate_openai_effort(effort: EffortLevel): EffortTranslation {\n if (effort === 'none') {\n return { provider_options: {}, effort_ignored: false }\n }\n return {\n provider_options: {\n openai: { reasoningEffort: OPENAI_REASONING_EFFORT[effort] },\n },\n effort_ignored: false,\n }\n}\n\n/**\n * Normalize OpenAI's raw usage payload into UsageTotals.\n */\nexport function normalize_openai_usage(raw: RawProviderUsage | undefined): UsageTotals {\n return default_normalize_usage(raw)\n}\n\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n 'image_input',\n 'reasoning',\n])\n\n/**\n * OpenAI's default API origin, matching the @ai-sdk/openai baseURL convention\n * (origin + /v1) so a base_url configured for the ai_sdk transport keeps\n * pointing at the same place when the transport flips to native.\n */\nconst DEFAULT_BASE_URL = 'https://api.openai.com/v1'\n\n/**\n * Build the OpenAI adapter, picking the native or ai_sdk backend per the\n * resolved `transport`.\n */\nexport const create_openai_adapter = (init: ProviderInit): ProviderAdapter => {\n if (resolve_transport(init, 'openai') === 'native') {\n return create_openai_native_adapter(init)\n }\n return create_openai_ai_sdk_adapter(init)\n}\n\n/**\n * Build the openai dialect and hand it to the shared OpenAI-compatible core:\n * Bearer auth, an optional OpenAI-Organization header, the\n * `max_completion_tokens` token-limit field, and strict usage (a hosted API\n * omitting usage is a broken response, not a local-runtime quirk). The\n * empty-api_key guard rides on the core, which throws the same\n * `openai provider requires a non-empty api_key` engine_config_error.\n */\nconst create_openai_native_adapter = (init: ProviderInit): NativeProviderAdapter => {\n const { api_key, base_url } = read_dialect_init(init, DEFAULT_BASE_URL)\n const organization = typeof init['organization'] === 'string' ? init['organization'] : undefined\n const dialect: OpenAICompatibleDialect = {\n name: 'openai',\n base_url,\n auth: { kind: 'bearer', api_key },\n token_limit_field: 'max_completion_tokens',\n stream_include_usage: true,\n tolerant_usage: false,\n ...(organization !== undefined\n ? { extra_headers: { 'OpenAI-Organization': organization } }\n : {}),\n }\n return create_openai_compatible_adapter(dialect)\n}\n\n/**\n * Build the OpenAI ai_sdk adapter: validates the required api_key and lazily\n * loads @ai-sdk/openai to build models.\n */\nconst create_openai_ai_sdk_adapter = (init: ProviderInit): AiSdkProviderAdapter => {\n const api_key = typeof init.api_key === 'string' ? init.api_key : ''\n if (api_key.length === 0) {\n throw new engine_config_error(\n 'openai provider requires a non-empty api_key',\n 'openai',\n )\n }\n const base_url = typeof init.base_url === 'string' ? init.base_url : undefined\n const organization = typeof init['organization'] === 'string' ? init['organization'] : undefined\n\n return {\n kind: 'ai_sdk',\n name: 'openai',\n async build_model(model_id: string): Promise<unknown> {\n const sdk = await load_optional_peer<OpenaiSdk>('@ai-sdk/openai')\n const config: { apiKey: string; baseURL?: string; organization?: string } = {\n apiKey: api_key,\n }\n if (base_url !== undefined) config.baseURL = base_url\n if (organization !== undefined) config.organization = organization\n const provider = sdk.createOpenAI(config)\n return provider(model_id)\n },\n translate_effort: translate_openai_effort,\n normalize_usage: normalize_openai_usage,\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * Google Gemini provider adapter.\n *\n * Wraps @ai-sdk/google as an optional peer. Effort maps to the\n * `thinking_budget` provider option.\n */\n\nimport type { EffortLevel, ProviderInit, UsageTotals } from '../types.js'\nimport {\n default_normalize_usage,\n load_optional_peer,\n type AiSdkProviderAdapter,\n type EffortTranslation,\n type ProviderCapability,\n type RawProviderUsage,\n} from './types.js'\nimport { engine_config_error } from '../errors.js'\n\ntype GoogleSdk = {\n createGoogleGenerativeAI: (config: {\n apiKey?: string\n baseURL?: string\n }) => (model_id: string) => unknown\n}\n\n// @ai-sdk/google's `thinkingConfig.thinkingBudget` is a token count (number),\n// not an enum: passing a string fails the provider's zod validation. Gemini 2.5\n// Pro accepts up to 32768 thinking tokens; lighter models clamp the high end.\n// `none` omits thinkingConfig entirely (see translate_google_effort).\nconst GOOGLE_THINKING_BUDGET: Record<Exclude<EffortLevel, 'none'>, number> = {\n low: 1024,\n medium: 8192,\n high: 24576,\n xhigh: 32768,\n max: 32768,\n}\n\n/**\n * Map an EffortLevel to Google's `thinkingConfig.thinkingBudget` provider\n * option.\n */\nexport function translate_google_effort(effort: EffortLevel): EffortTranslation {\n if (effort === 'none') {\n return { provider_options: {}, effort_ignored: false }\n }\n return {\n provider_options: {\n google: { thinkingConfig: { thinkingBudget: GOOGLE_THINKING_BUDGET[effort] } },\n },\n effort_ignored: false,\n }\n}\n\n/**\n * Normalize Google's raw usage payload into UsageTotals.\n */\nexport function normalize_google_usage(raw: RawProviderUsage | undefined): UsageTotals {\n // Google never reports cache-write tokens, and `default_normalize_usage` only\n // sets that field when the raw payload carries it, so the default is exact.\n return default_normalize_usage(raw)\n}\n\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n 'image_input',\n 'reasoning',\n])\n\n/**\n * Build the Google ai_sdk adapter: validates the required api_key and lazily\n * loads @ai-sdk/google to build models.\n */\nexport const create_google_adapter = (init: ProviderInit): AiSdkProviderAdapter => {\n const api_key = typeof init.api_key === 'string' ? init.api_key : ''\n if (api_key.length === 0) {\n throw new engine_config_error(\n 'google provider requires a non-empty api_key',\n 'google',\n )\n }\n const base_url = typeof init.base_url === 'string' ? init.base_url : undefined\n\n return {\n kind: 'ai_sdk',\n name: 'google',\n async build_model(model_id: string): Promise<unknown> {\n const sdk = await load_optional_peer<GoogleSdk>('@ai-sdk/google')\n const config: { apiKey: string; baseURL?: string } = { apiKey: api_key }\n if (base_url !== undefined) config.baseURL = base_url\n const provider = sdk.createGoogleGenerativeAI(config)\n return provider(model_id)\n },\n translate_effort: translate_google_effort,\n normalize_usage: normalize_google_usage,\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * Ollama native adapter, talking raw HTTP to the daemon's own /api/chat\n * endpoint.\n *\n * Deliberately not the OpenAI-compatible core: the OpenAI-compatible tail is\n * already served by pointing the `openai` provider's base_url at Ollama's\n * /v1, while this endpoint exposes what that compat layer hides: `options`\n * (num_predict, temperature, top_p, and every other runtime knob),\n * `keep_alive`, and `think`, all reachable raw through\n * `provider_options.ollama`. The wire is its own dialect too:\n * newline-delimited JSON frames rather than SSE, tool-call `arguments` as\n * objects rather than JSON strings, no tool-call ids (the adapter\n * synthesizes deterministic ones), and tool results keyed by `tool_name`\n * rather than a call id.\n *\n * This module imports nothing from `ai` or `@ai-sdk/*`. The adapter owns\n * request/response mapping only: generate.ts wraps invoke_turn in retry +\n * classification + abort, so failures are thrown in the shapes the shared\n * classify_provider_error already understands (`status` + `responseHeaders`\n * for HTTP transients, `kind: 'network'` for transport failures), never\n * retried here. Schema requests ride the engine's prompt + parse + repair\n * loop, so `TurnRequest.schema` is intentionally unread; effort is ignored\n * entirely, since thinking is opt-in via `provider_options.ollama.think`.\n * Usage is always tolerant: a local daemon that omits eval counts zeroes the\n * totals instead of throwing. The NDJSON aggregator rebuilds the non-stream\n * payload shape and feeds it through the same parse_ollama_chat, so streamed\n * and non-streamed results are equal by construction.\n */\n\nimport type {\n AssistantContentPart,\n FinishReason,\n Message,\n StreamChunk,\n TurnRequest,\n TurnResult,\n UsageTotals,\n UserContentPart,\n} from '../types.js'\nimport {\n engine_config_error,\n provider_capability_error,\n provider_error,\n} from '../errors.js'\nimport {\n consume_framed_stream,\n create_line_splitter,\n invoke_http_turn,\n map_messages_by_role,\n parse_tool_call_arguments,\n split_assistant_parts,\n} from './native_shared.js'\nimport { to_chat_tools } from './openai_compatible_native.js'\nimport type { NativeProviderAdapter, ProviderCapability } from './types.js'\nimport type { ProviderInit } from '../types.js'\n\ntype OllamaToolCall = {\n function: { name: string; arguments: unknown }\n}\n\nexport type OllamaChatMessage =\n | { role: 'system'; content: string }\n | { role: 'user'; content: string }\n | { role: 'assistant'; content: string; tool_calls?: OllamaToolCall[] }\n | { role: 'tool'; content: string; tool_name: string }\n\n/**\n * Map user message content to a plain string, the shape this wire expects\n * (no part-array support). Image parts throw a capability error: they are\n * not mapped on the native transport.\n */\nfunction to_user_content(content: string | UserContentPart[]): string {\n if (typeof content === 'string') return content\n const parts: string[] = []\n for (const part of content) {\n if (part.type === 'image') {\n throw new provider_capability_error(\n 'ollama',\n 'image_input',\n \"image parts are not mapped on the native transport; use transport: 'ai_sdk'\",\n )\n }\n if (part.text.trim().length > 0) parts.push(part.text)\n }\n // Message content is a plain string on this wire (no part array), so\n // multi-part user content flattens with newlines between parts.\n return parts.join('\\n')\n}\n\n/**\n * Map assistant message content to this wire's message shape: text parts\n * join into `content`, and tool-call parts become `tool_calls` entries with\n * structured (not JSON-string) arguments.\n */\nfunction to_assistant_message(content: string | AssistantContentPart[]): OllamaChatMessage {\n if (typeof content === 'string') return { role: 'assistant', content }\n const { texts, tool_parts } = split_assistant_parts(content)\n const message: OllamaChatMessage = { role: 'assistant', content: texts.join('') }\n if (tool_parts.length > 0) {\n // arguments is a structured object on this wire, not a JSON string, and\n // the API has no id field on tool calls, so the part's id is dropped\n // here and re-synthesized deterministically when a response is parsed.\n message.tool_calls = tool_parts.map((part) => ({\n function: { name: part.name, arguments: part.input },\n }))\n }\n return message\n}\n\n/**\n * Map fascicle Message[] to the /api/chat shape. System messages map in place\n * (no top-level system field); tool results are `tool` role messages keyed by\n * `tool_name`, since this wire has no tool_call_id to round-trip.\n */\nexport function to_ollama_messages(messages: ReadonlyArray<Message>): OllamaChatMessage[] {\n return map_messages_by_role<OllamaChatMessage>(messages, {\n system: (content) => ({ role: 'system', content }),\n user: (content) => ({ role: 'user', content: to_user_content(content) }),\n assistant: to_assistant_message,\n tool: (message) => ({ role: 'tool', tool_name: message.name, content: message.content }),\n })\n}\n\n/**\n * Build the /api/chat request body for one turn: mapped messages and tools,\n * sampling params under the `options` bag, and the `provider_options.ollama`\n * wire passthrough merged last.\n */\nexport function build_ollama_chat_body(req: TurnRequest): Record<string, unknown> {\n const messages: OllamaChatMessage[] = []\n if (req.system !== undefined && req.system.length > 0) {\n messages.push({ role: 'system', content: req.system })\n }\n messages.push(...to_ollama_messages(req.messages))\n\n const body: Record<string, unknown> = {\n model: req.model_id,\n messages,\n // /api/chat streams by default, so the flag is always explicit: a\n // non-stream call that omits it would get NDJSON back.\n stream: req.stream,\n }\n // Tool definitions use the OpenAI function shape verbatim on this endpoint.\n if (req.tools.length > 0) body['tools'] = to_chat_tools(req.tools)\n // Sampling params live under the runtime's `options` bag, not at the top\n // level. Effort is intentionally unread: there is no reasoning_effort on\n // this wire, and `think` is opt-in via provider_options.ollama.\n const options: Record<string, unknown> = {}\n if (req.max_tokens !== undefined) options['num_predict'] = req.max_tokens\n if (req.temperature !== undefined) options['temperature'] = req.temperature\n if (req.top_p !== undefined) options['top_p'] = req.top_p\n if (Object.keys(options).length > 0) body['options'] = options\n // provider_options.ollama is raw wire-format passthrough (think, keep_alive,\n // format, options, ...), shallow-merged last so an explicit user key beats\n // every derived field. Shallow means a passthrough `options` object\n // replaces the engine-derived one wholesale rather than merging into it.\n const passthrough = req.provider_options?.['ollama']\n return passthrough === undefined ? body : { ...body, ...passthrough }\n}\n\n/**\n * Map the daemon's done_reason, plus whether the turn produced tool calls,\n * to the engine's FinishReason. The presence of tool calls wins, since the\n * wire reports done_reason 'stop' on a tool-call turn too, then `length`;\n * everything else ('stop', 'load', or absent) means the model stopped on its\n * own.\n */\nexport function map_ollama_finish_reason(raw: unknown, has_tool_calls: boolean): FinishReason {\n if (has_tool_calls) return 'tool_calls'\n return raw === 'length' ? 'length' : 'stop'\n}\n\n/**\n * Map the daemon's usage fields to UsageTotals: prompt_eval_count becomes\n * input_tokens, eval_count becomes output_tokens; no cache or reasoning\n * fields exist on this wire. Counts are always tolerant: a local daemon that\n * omits them (or a mid-stream frame, which never carries them) zeroes the\n * totals instead of throwing.\n */\nexport function map_ollama_usage(payload: unknown): UsageTotals {\n if (payload === null || typeof payload !== 'object') {\n return { input_tokens: 0, output_tokens: 0 }\n }\n const prompt: unknown = Reflect.get(payload, 'prompt_eval_count')\n const evaluated: unknown = Reflect.get(payload, 'eval_count')\n return {\n input_tokens: typeof prompt === 'number' ? prompt : 0,\n output_tokens: typeof evaluated === 'number' ? evaluated : 0,\n }\n}\n\n/**\n * This wire sends no tool-call id, so one is synthesized from the step index\n * and the call's ordinal within the turn: deterministic, so the streamed and\n * non-streamed parses of the same turn agree, and unique across steps so\n * transcript tool results stay unambiguous. A wire id is preferred if a\n * future daemon version starts sending one.\n */\nfunction parse_ollama_tool_call(\n raw: unknown,\n ordinal: number,\n step_index: number,\n): TurnResult['tool_calls'][number] {\n if (raw === null || typeof raw !== 'object') {\n throw new provider_error('ollama native: malformed tool_calls entry in response')\n }\n const fn: unknown = Reflect.get(raw, 'function')\n if (fn === null || typeof fn !== 'object') {\n throw new provider_error('ollama native: malformed tool_calls entry in response')\n }\n const name: unknown = Reflect.get(fn, 'name')\n if (typeof name !== 'string') {\n throw new provider_error('ollama native: malformed tool_calls entry in response')\n }\n const wire_id: unknown = Reflect.get(raw, 'id')\n const id = typeof wire_id === 'string' && wire_id.length > 0\n ? wire_id\n : `ollama_call_${step_index}_${ordinal}`\n // arguments is a structured object on this wire; a string is tolerated as\n // JSON for compat-shaped proxies ('' meaning '{}', like the OpenAI wire).\n const raw_args: unknown = Reflect.get(fn, 'arguments')\n const input: unknown =\n raw_args !== null && typeof raw_args === 'object'\n ? raw_args\n : parse_tool_call_arguments(raw_args, 'ollama', name)\n return { id, name, input }\n}\n\n/**\n * The one response parser every path feeds: non-stream parses the payload\n * directly, and the NDJSON aggregator rebuilds this same payload shape from\n * its frames before calling it.\n */\nexport function parse_ollama_chat(payload: unknown, step_index: number): TurnResult {\n if (payload === null || typeof payload !== 'object') {\n throw new provider_error('ollama native: response payload is not a JSON object')\n }\n const message: unknown = Reflect.get(payload, 'message')\n if (message === null || message === undefined || typeof message !== 'object') {\n throw new provider_error('ollama native: response has no message')\n }\n const content: unknown = Reflect.get(message, 'content')\n const raw_tool_calls: unknown = Reflect.get(message, 'tool_calls')\n const tool_calls = Array.isArray(raw_tool_calls)\n ? raw_tool_calls.map((entry, ordinal) => parse_ollama_tool_call(entry, ordinal, step_index))\n : []\n return {\n text: typeof content === 'string' ? content : '',\n tool_calls,\n finish_reason: map_ollama_finish_reason(\n Reflect.get(payload, 'done_reason'),\n tool_calls.length > 0,\n ),\n usage: map_ollama_usage(payload),\n }\n}\n\n/**\n * Incremental NDJSON framing: push() takes decoded text at any chunk\n * boundary (including mid-line) and returns the complete lines it finished\n * (blank lines dropped; JSON parsing is the aggregator's job); flush() drains\n * a final line left open when the stream ends without a trailing newline.\n */\nexport function create_ndjson_decoder(): {\n push: (text: string) => string[]\n flush: () => string[]\n} {\n return create_line_splitter((line, out) => {\n if (line.trim().length > 0) out.push(line)\n })\n}\n\n/**\n * Consume /api/chat NDJSON frames, dispatching StreamChunks as they arrive\n * and rebuilding the non-stream payload as it goes: `message.content`\n * accumulates into the turn text, and `message.tool_calls` entries arrive\n * whole per frame, since arguments are complete objects on this wire, so\n * each call dispatches tool_call_start then tool_call_end with no input\n * deltas between. The `done: true` frame carries done_reason and the eval\n * counts and closes the turn (step_finish); frames after it are ignored. A\n * stream that ends without one is truncated output, so complete() fails\n * loud instead of returning a partial turn. complete() feeds the synthetic\n * payload through parse_ollama_chat, which is what makes the streamed\n * TurnResult equal the non-streamed one by construction.\n */\nfunction create_ollama_stream_aggregator(\n step_index: number,\n dispatch: (chunk: StreamChunk) => Promise<void>,\n): {\n handle: (line: string) => Promise<void>\n complete: () => TurnResult\n} {\n let text = ''\n const tool_calls: Array<TurnResult['tool_calls'][number]> = []\n let done = false\n let done_reason: unknown\n let usage: UsageTotals = { input_tokens: 0, output_tokens: 0 }\n\n const on_message = async (message: object): Promise<void> => {\n const content: unknown = Reflect.get(message, 'content')\n if (typeof content === 'string' && content.length > 0) {\n text += content\n await dispatch({ kind: 'text', text: content, step_index })\n }\n const raw_calls: unknown = Reflect.get(message, 'tool_calls')\n if (!Array.isArray(raw_calls)) return\n for (const entry of raw_calls) {\n const call = parse_ollama_tool_call(entry, tool_calls.length, step_index)\n tool_calls.push(call)\n // oxlint-disable-next-line no-await-in-loop\n await dispatch({ kind: 'tool_call_start', id: call.id, name: call.name, step_index })\n // oxlint-disable-next-line no-await-in-loop\n await dispatch({ kind: 'tool_call_end', id: call.id, input: call.input, step_index })\n }\n }\n\n return {\n async handle(line: string): Promise<void> {\n if (done) return\n let frame: unknown\n try {\n frame = JSON.parse(line)\n } catch {\n throw new provider_error('ollama native: stream frame is not valid JSON')\n }\n if (frame === null || typeof frame !== 'object') return\n const message: unknown = Reflect.get(frame, 'message')\n if (message !== null && message !== undefined && typeof message === 'object') {\n await on_message(message)\n }\n if (Reflect.get(frame, 'done') === true) {\n done = true\n done_reason = Reflect.get(frame, 'done_reason')\n usage = map_ollama_usage(frame)\n await dispatch({\n kind: 'step_finish',\n step_index,\n finish_reason: map_ollama_finish_reason(done_reason, tool_calls.length > 0),\n usage,\n })\n }\n },\n complete(): TurnResult {\n if (!done) {\n throw new provider_error(\n 'ollama native: stream ended before its done frame; the result would be truncated',\n )\n }\n const message: Record<string, unknown> = { role: 'assistant', content: text }\n if (tool_calls.length > 0) {\n // Rebuilt entries carry the synthesized ids, which the parser prefers\n // over re-synthesizing, so streamed ids match the dispatched chunks.\n message['tool_calls'] = tool_calls.map((call) => ({\n id: call.id,\n function: { name: call.name, arguments: call.input },\n }))\n }\n return parse_ollama_chat(\n {\n message,\n done: true,\n done_reason: done_reason ?? null,\n prompt_eval_count: usage.input_tokens,\n eval_count: usage.output_tokens,\n },\n step_index,\n )\n },\n }\n}\n\n/**\n * Drain a streaming /api/chat response through the shared framed-stream\n * consumer: NDJSON framing feeding the aggregator, which dispatches chunks\n * through req.dispatch_chunk as they arrive.\n */\nasync function consume_ndjson_response(response: Response, req: TurnRequest): Promise<TurnResult> {\n return consume_framed_stream(response, req, 'ollama', create_ndjson_decoder(), (dispatch) =>\n create_ollama_stream_aggregator(req.step_index, dispatch),\n )\n}\n\n// 'structured_output' is intentionally absent: schema rides the prompt +\n// parse + repair loop, parity with native Anthropic, though the daemon's\n// `format` field stays reachable via provider_options.ollama.format.\n// 'reasoning' is absent because effort is ignored on this wire; image parts\n// are unmapped on this transport.\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n])\n\n/**\n * Build the native Ollama adapter: validates the required base_url and wires\n * invoke_turn to POST /api/chat directly (streamed or not) through the\n * mappers above.\n */\nexport const create_ollama_native_adapter = (init: ProviderInit): NativeProviderAdapter => {\n const raw_base_url = typeof init.base_url === 'string' ? init.base_url : ''\n if (raw_base_url.length === 0) {\n throw new engine_config_error('ollama provider requires a non-empty base_url', 'ollama')\n }\n // base_url is the daemon root (http://localhost:11434), the same value the\n // ai_sdk transport takes, so flipping transports never means re-pointing it.\n const base_url = raw_base_url.replace(/\\/+$/, '')\n\n return {\n kind: 'native',\n name: 'ollama',\n async invoke_turn(req: TurnRequest): Promise<TurnResult> {\n return invoke_http_turn(\n req,\n 'ollama',\n {\n url: `${base_url}/api/chat`,\n headers: { 'content-type': 'application/json' },\n build_body: () => build_ollama_chat_body(req),\n },\n {\n stream: (response) => consume_ndjson_response(response, req),\n parse: (payload) => parse_ollama_chat(payload, req.step_index),\n },\n )\n },\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * Ollama local-provider adapter.\n *\n * Dispatches on `transport`: the default 'ai_sdk' backend wraps\n * ai-sdk-ollama as an optional peer; 'native' talks to the daemon's own\n * /api/chat endpoint over its NDJSON wire. The OpenAI-compatible tail is\n * served instead by pointing the `openai` provider's base_url at Ollama's\n * /v1. No API key; base_url is the daemon root and is required on both\n * transports. Ollama does not support reasoning effort: the ai_sdk branch\n * drops the field and records `effort_ignored`; the native branch ignores it\n * entirely (thinking is opt-in via provider_options.ollama.think). Ollama\n * does not emit the image_input capability.\n */\n\nimport type { EffortLevel, ProviderInit } from '../types.js'\nimport {\n load_optional_peer,\n normalize_local_usage,\n resolve_transport,\n type AiSdkProviderAdapter,\n type EffortTranslation,\n type ProviderAdapter,\n type ProviderCapability,\n} from './types.js'\nimport { create_ollama_native_adapter } from './ollama_native.js'\nimport { engine_config_error } from '../errors.js'\n\ntype OllamaSdk = {\n createOllama: (config: { baseURL?: string }) => (model_id: string) => unknown\n}\n\n/**\n * Ollama has no reasoning-effort control on this transport, so every\n * non-`none` level is reported as ignored and no provider option is emitted.\n */\nexport function translate_ollama_effort(effort: EffortLevel): EffortTranslation {\n const ignored = effort !== 'none'\n return { provider_options: {}, effort_ignored: ignored }\n}\n\n/**\n * Normalize Ollama's raw usage payload into UsageTotals: the shared\n * local-backend mapper, since Ollama never reports cache or reasoning\n * tokens.\n */\nexport const normalize_ollama_usage = normalize_local_usage\n\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n // Ollama supports native constrained decoding via its `format` field, which\n // ai-sdk-ollama maps from the AI SDK responseFormat. The text-extraction\n // path is unreliable for local models, so prefer the constrained decode.\n 'structured_output',\n])\n\n/**\n * Build the Ollama adapter, picking the native or ai_sdk backend per the\n * resolved `transport`.\n */\nexport const create_ollama_adapter = (init: ProviderInit): ProviderAdapter => {\n if (resolve_transport(init, 'ollama') === 'native') {\n return create_ollama_native_adapter(init)\n }\n return create_ollama_ai_sdk_adapter(init)\n}\n\n/**\n * Build the Ollama ai_sdk adapter: validates the required base_url and\n * lazily loads ai-sdk-ollama to build models.\n */\nconst create_ollama_ai_sdk_adapter = (init: ProviderInit): AiSdkProviderAdapter => {\n const base_url = typeof init.base_url === 'string' ? init.base_url : ''\n if (base_url.length === 0) {\n throw new engine_config_error(\n 'ollama provider requires a non-empty base_url',\n 'ollama',\n )\n }\n\n return {\n kind: 'ai_sdk',\n name: 'ollama',\n async build_model(model_id: string): Promise<unknown> {\n const sdk = await load_optional_peer<OllamaSdk>('ai-sdk-ollama')\n const provider = sdk.createOllama({ baseURL: base_url })\n return provider(model_id)\n },\n translate_effort: translate_ollama_effort,\n normalize_usage: normalize_ollama_usage,\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * LM Studio provider adapter.\n *\n * Dispatches on `transport`: the default 'ai_sdk' backend wraps\n * @ai-sdk/openai-compatible as an optional peer; 'native' builds the lmstudio\n * dialect of the shared OpenAI-compatible core, with no auth, `max_tokens` as\n * the token-limit field, and tolerant usage, since a local server that omits\n * or approximates token counts is a fact of local-first running, not a broken\n * response. LM Studio exposes an OpenAI-compatible local server; base_url is\n * required on both transports. No reasoning support.\n */\n\nimport type { EffortLevel, ProviderInit } from '../types.js'\nimport {\n load_optional_peer,\n normalize_local_usage,\n resolve_transport,\n type AiSdkProviderAdapter,\n type EffortTranslation,\n type NativeProviderAdapter,\n type ProviderAdapter,\n type ProviderCapability,\n} from './types.js'\nimport {\n create_openai_compatible_adapter,\n type OpenAICompatibleDialect,\n} from './openai_compatible_native.js'\nimport { engine_config_error } from '../errors.js'\n\ntype OpenaiCompatibleSdk = {\n createOpenAICompatible: (config: {\n name: string\n baseURL: string\n apiKey?: string\n includeUsage?: boolean\n }) => (model_id: string) => unknown\n}\n\n/**\n * LM Studio has no reasoning-effort control, so every non-`none` level is\n * reported as ignored and no provider option is emitted.\n */\nexport function translate_lmstudio_effort(effort: EffortLevel): EffortTranslation {\n const ignored = effort !== 'none'\n return { provider_options: {}, effort_ignored: ignored }\n}\n\n/**\n * Normalize LM Studio's raw usage payload into UsageTotals: the shared\n * local-backend mapper, since LM Studio never reports cache or reasoning\n * tokens.\n */\nexport const normalize_lmstudio_usage = normalize_local_usage\n\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n // LM Studio's OpenAI-compatible server supports native constrained decoding\n // via a json_schema response format, surfaced through the AI SDK\n // responseFormat. Prefer it over the unreliable text-extraction path.\n 'structured_output',\n])\n\n/**\n * Build the LM Studio adapter, picking the native or ai_sdk backend per the\n * resolved `transport`.\n */\nexport const create_lmstudio_adapter = (init: ProviderInit): ProviderAdapter => {\n if (resolve_transport(init, 'lmstudio') === 'native') {\n return create_lmstudio_native_adapter(init)\n }\n return create_lmstudio_ai_sdk_adapter(init)\n}\n\n/**\n * Build the lmstudio dialect and hand it to the shared OpenAI-compatible\n * core: no auth, the `max_tokens` token-limit field, and tolerant usage. The\n * base_url guard mirrors the ai_sdk branch; the core has no api_key to check\n * under `auth: { kind: 'none' }`.\n */\nconst create_lmstudio_native_adapter = (init: ProviderInit): NativeProviderAdapter => {\n const base_url = typeof init.base_url === 'string' ? init.base_url : ''\n if (base_url.length === 0) {\n throw new engine_config_error(\n 'lmstudio provider requires a non-empty base_url',\n 'lmstudio',\n )\n }\n const dialect: OpenAICompatibleDialect = {\n name: 'lmstudio',\n base_url,\n auth: { kind: 'none' },\n token_limit_field: 'max_tokens',\n stream_include_usage: true,\n tolerant_usage: true,\n }\n return create_openai_compatible_adapter(dialect)\n}\n\n/**\n * Build the LM Studio ai_sdk adapter: validates the required base_url and\n * lazily loads @ai-sdk/openai-compatible to build models.\n */\nconst create_lmstudio_ai_sdk_adapter = (init: ProviderInit): AiSdkProviderAdapter => {\n const base_url = typeof init.base_url === 'string' ? init.base_url : ''\n if (base_url.length === 0) {\n throw new engine_config_error(\n 'lmstudio provider requires a non-empty base_url',\n 'lmstudio',\n )\n }\n\n return {\n kind: 'ai_sdk',\n name: 'lmstudio',\n async build_model(model_id: string): Promise<unknown> {\n const sdk = await load_optional_peer<OpenaiCompatibleSdk>('@ai-sdk/openai-compatible')\n // Without includeUsage the OpenAI streaming protocol omits usage from\n // SSE responses entirely (stream_options.include_usage), so streamed\n // calls would report zero tokens on spec-strict servers.\n const provider = sdk.createOpenAICompatible({\n name: 'lmstudio',\n baseURL: base_url,\n includeUsage: true,\n })\n return provider(model_id)\n },\n translate_effort: translate_lmstudio_effort,\n normalize_usage: normalize_lmstudio_usage,\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * OpenRouter provider adapter.\n *\n * Dispatches on `transport`: the default 'ai_sdk' backend wraps\n * @openrouter/ai-sdk-provider as an optional peer; 'native' builds the\n * openrouter dialect of the shared OpenAI-compatible core, with Bearer auth\n * plus the optional `HTTP-Referer`/`X-Title` attribution headers,\n * `max_tokens` as the token-limit field, and strict usage (a hosted\n * aggregator omitting usage is a broken response, not a local-runtime\n * quirk).\n *\n * Reasoning effort support varies per upstream model; OpenRouter itself\n * forwards the `reasoning` provider option. The ai_sdk backend translates\n * effort to the OpenRouter `reasoning.effort` shape; the native core maps it\n * to the flat `reasoning_effort` field. Effort_ignored is false so that the\n * orchestrator does not emit effort_ignored indiscriminately; upstream\n * models that don't support reasoning drop the field themselves.\n */\n\nimport type { EffortLevel, ProviderInit, UsageTotals } from '../types.js'\nimport {\n default_normalize_usage,\n load_optional_peer,\n resolve_transport,\n type AiSdkProviderAdapter,\n type EffortTranslation,\n type NativeProviderAdapter,\n type ProviderAdapter,\n type ProviderCapability,\n type RawProviderUsage,\n} from './types.js'\nimport { read_dialect_init } from './native_shared.js'\nimport {\n create_openai_compatible_adapter,\n type OpenAICompatibleDialect,\n} from './openai_compatible_native.js'\nimport { engine_config_error } from '../errors.js'\n\ntype OpenrouterSdk = {\n createOpenRouter: (config: {\n apiKey?: string\n baseURL?: string\n extraBody?: Record<string, unknown>\n headers?: Record<string, string>\n }) => (model_id: string) => unknown\n}\n\n/**\n * Map an EffortLevel to OpenRouter's `reasoning.effort` provider option.\n *\n * OpenRouter forwards the effort string verbatim to the upstream model.\n * `low`/`medium`/`high` work everywhere; `xhigh`/`max` flow through but only\n * the upstream model decides what they mean. Models that don't recognize\n * the value drop it silently.\n */\nexport function translate_openrouter_effort(effort: EffortLevel): EffortTranslation {\n if (effort === 'none') return { provider_options: {}, effort_ignored: false }\n return {\n provider_options: {\n openrouter: { reasoning: { effort } },\n },\n effort_ignored: false,\n }\n}\n\n/**\n * Normalize OpenRouter's raw usage payload into UsageTotals.\n */\nexport function normalize_openrouter_usage(raw: RawProviderUsage | undefined): UsageTotals {\n return default_normalize_usage(raw)\n}\n\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n 'image_input',\n 'reasoning',\n])\n\n/**\n * OpenRouter's default API origin, matching the @openrouter/ai-sdk-provider\n * baseURL convention so a base_url configured for the ai_sdk transport keeps\n * pointing at the same place when the transport flips to native.\n */\nconst DEFAULT_BASE_URL = 'https://openrouter.ai/api/v1'\n\n/**\n * Build the OpenRouter adapter, picking the native or ai_sdk backend per the\n * resolved `transport`.\n */\nexport const create_openrouter_adapter = (init: ProviderInit): ProviderAdapter => {\n if (resolve_transport(init, 'openrouter') === 'native') {\n return create_openrouter_native_adapter(init)\n }\n return create_openrouter_ai_sdk_adapter(init)\n}\n\n/**\n * Build the openrouter dialect and hand it to the shared OpenAI-compatible\n * core: Bearer auth, the optional `HTTP-Referer`/`X-Title` attribution\n * headers, the `max_tokens` token-limit field, and strict usage. The\n * empty-api_key guard rides on the core, which throws the same\n * `openrouter provider requires a non-empty api_key` engine_config_error.\n */\nconst create_openrouter_native_adapter = (init: ProviderInit): NativeProviderAdapter => {\n const { api_key, base_url } = read_dialect_init(init, DEFAULT_BASE_URL)\n const http_referer = typeof init['http_referer'] === 'string' ? init['http_referer'] : undefined\n const x_title = typeof init['x_title'] === 'string' ? init['x_title'] : undefined\n const extra_headers: Record<string, string> = {}\n if (http_referer !== undefined) extra_headers['HTTP-Referer'] = http_referer\n if (x_title !== undefined) extra_headers['X-Title'] = x_title\n const dialect: OpenAICompatibleDialect = {\n name: 'openrouter',\n base_url,\n auth: { kind: 'bearer', api_key },\n token_limit_field: 'max_tokens',\n stream_include_usage: true,\n tolerant_usage: false,\n ...(Object.keys(extra_headers).length > 0 ? { extra_headers } : {}),\n }\n return create_openai_compatible_adapter(dialect)\n}\n\n/**\n * Build the OpenRouter ai_sdk adapter: validates the required api_key and\n * lazily loads @openrouter/ai-sdk-provider to build models.\n */\nconst create_openrouter_ai_sdk_adapter = (init: ProviderInit): AiSdkProviderAdapter => {\n const api_key = typeof init.api_key === 'string' ? init.api_key : ''\n if (api_key.length === 0) {\n throw new engine_config_error(\n 'openrouter provider requires a non-empty api_key',\n 'openrouter',\n )\n }\n const base_url = typeof init.base_url === 'string' ? init.base_url : undefined\n const http_referer = typeof init['http_referer'] === 'string' ? init['http_referer'] : undefined\n const x_title = typeof init['x_title'] === 'string' ? init['x_title'] : undefined\n\n return {\n kind: 'ai_sdk',\n name: 'openrouter',\n async build_model(model_id: string): Promise<unknown> {\n const sdk = await load_optional_peer<OpenrouterSdk>('@openrouter/ai-sdk-provider')\n const headers: Record<string, string> = {}\n if (http_referer !== undefined) headers['HTTP-Referer'] = http_referer\n if (x_title !== undefined) headers['X-Title'] = x_title\n const config: {\n apiKey: string\n baseURL?: string\n headers?: Record<string, string>\n } = { apiKey: api_key }\n if (base_url !== undefined) config.baseURL = base_url\n if (Object.keys(headers).length > 0) config.headers = headers\n const provider = sdk.createOpenRouter(config)\n return provider(model_id)\n },\n translate_effort: translate_openrouter_effort,\n normalize_usage: normalize_openrouter_usage,\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * AWS Bedrock provider adapter.\n *\n * Wraps @ai-sdk/amazon-bedrock as an optional peer. `region` is required under\n * every auth mode; credentials are optional. The auth ladder, highest first:\n *\n * 1. `api_key` — Bedrock bearer token. Swaps the SDK's whole fetch function, so\n * it wins over every SigV4 mode below and short-circuits their resolution.\n * 2. Explicit SigV4 fields — `access_key_id` / `secret_access_key` /\n * `session_token`. Any one of them present means the caller is driving\n * credentials, so no dynamic source is attached.\n * 3. A dynamic source — `use_credential_chain: true` (fascicle loads\n * @aws-sdk/credential-providers and attaches `fromNodeProviderChain()`) or a\n * caller-supplied `credential_provider` function. Supplying both is an\n * `engine_config_error`: they are two answers to one question, not a\n * fallback pair.\n * 4. Nothing — the SDK reads `AWS_ACCESS_KEY_ID` / `AWS_SECRET_ACCESS_KEY` from\n * the environment and throws if they are absent. Note this is *not* the AWS\n * credential chain: the SDK never reads `~/.aws/credentials`, so a profile\n * without exported env vars needs mode 3.\n *\n * Effort maps to the Anthropic extended-thinking budget, emitted under the\n * bedrock `reasoningConfig` provider option; models that do not support\n * reasoning drop the field upstream.\n *\n * Guardrails ride `provider_options.bedrock.guardrailConfig`, which the peer\n * rest-spreads into the top level of the Converse command (an undocumented seam,\n * pinned by bedrock_guardrail_wire.test.ts). With `trace: 'enabled'` the\n * assessment comes back on `provider_reported.bedrock.trace`, which is the only\n * in-process evidence that a guardrail whose PII action is `NONE` ran at all:\n * that action detects and reports without rewriting, so the output is identical\n * whether such a guardrail is attached or absent.\n */\n\nimport type { BedrockCredentialProvider, EffortLevel, ProviderInit, UsageTotals } from '../types.js'\nimport {\n default_normalize_usage,\n load_optional_peer,\n type AiSdkProviderAdapter,\n type EffortTranslation,\n type ProviderCapability,\n type RawProviderUsage,\n} from './types.js'\nimport { engine_config_error } from '../errors.js'\n\ntype BedrockSdk = {\n createAmazonBedrock: (config: {\n region?: string\n accessKeyId?: string\n secretAccessKey?: string\n sessionToken?: string\n apiKey?: string\n baseURL?: string\n credentialProvider?: BedrockCredentialProvider\n }) => (model_id: string) => unknown\n}\n\n// `fromNodeProviderChain()` returns a *memoized* provider: it caches resolved\n// credentials and refreshes them on expiry. The SDK calls `credentialProvider`\n// once per request, so the chain is built once per adapter and reused, never\n// rebuilt inside build_model.\ntype CredentialProvidersSdk = {\n fromNodeProviderChain: () => BedrockCredentialProvider\n}\n\n// Bedrock hosts Anthropic Claude models; reasoning maps to the same\n// extended-thinking budget the anthropic adapter uses, emitted under the bedrock\n// provider option. Budgets stay within Bedrock's 1024..64000 window.\nconst BEDROCK_THINKING_BUDGETS: Record<EffortLevel, number> = {\n none: 0,\n low: 1024,\n medium: 5000,\n high: 20000,\n xhigh: 32000,\n max: 64000,\n}\n\n/**\n * Map an EffortLevel to the Bedrock `reasoningConfig` provider option.\n */\nexport function translate_bedrock_effort(effort: EffortLevel): EffortTranslation {\n // `none` is the only level with a 0 budget, so the budget alone decides\n // whether reasoning is requested.\n const budget = BEDROCK_THINKING_BUDGETS[effort]\n if (budget === 0) {\n return { provider_options: {}, effort_ignored: false }\n }\n return {\n provider_options: {\n bedrock: {\n reasoningConfig: { type: 'enabled', budgetTokens: budget },\n },\n },\n effort_ignored: false,\n }\n}\n\n/**\n * Normalize Bedrock's raw usage payload into UsageTotals.\n */\nexport function normalize_bedrock_usage(raw: RawProviderUsage | undefined): UsageTotals {\n return default_normalize_usage(raw)\n}\n\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n 'image_input',\n 'reasoning',\n])\n\ntype BedrockConfig = Parameters<BedrockSdk['createAmazonBedrock']>[0]\n\n/** Read a config field only when it is a string, so junk values stay unset. */\nfunction read_string(init: ProviderInit, key: string): string | undefined {\n const value = init[key]\n return typeof value === 'string' ? value : undefined\n}\n\n/** The static credential fields the SDK accepts, mapped from snake_case init. */\ntype StaticCredentials = {\n readonly region: string\n readonly api_key: string | undefined\n readonly access_key_id: string | undefined\n readonly secret_access_key: string | undefined\n readonly session_token: string | undefined\n readonly base_url: string | undefined\n}\n\n/** Pull the static fields off init, rejecting a missing or non-string region. */\nfunction read_static_credentials(init: ProviderInit): StaticCredentials {\n const region = read_string(init, 'region') ?? ''\n if (region.length === 0) {\n throw new engine_config_error('bedrock provider requires a non-empty region', 'bedrock')\n }\n return {\n region,\n api_key: read_string(init, 'api_key'),\n access_key_id: read_string(init, 'access_key_id'),\n secret_access_key: read_string(init, 'secret_access_key'),\n session_token: read_string(init, 'session_token'),\n base_url: read_string(init, 'base_url'),\n }\n}\n\ntype DynamicSource =\n | { readonly kind: 'chain' }\n | { readonly kind: 'explicit', readonly provider: BedrockCredentialProvider }\n\n/** True when the caller is already supplying credentials in any static form. */\nfunction has_static_credentials(statics: StaticCredentials): boolean {\n return (\n statics.api_key !== undefined\n || statics.access_key_id !== undefined\n || statics.secret_access_key !== undefined\n || statics.session_token !== undefined\n )\n}\n\n/**\n * Pick the dynamic credential source, or none. A bearer token or any explicit\n * SigV4 field short-circuits it: attaching a provider anyway would either\n * override the caller's keys (the SDK prefers `credentialProvider` over\n * `accessKeyId`) or force the optional @aws-sdk/credential-providers peer on\n * bearer-token users who never need it. The conflict check runs first, since\n * naming two dynamic sources is a mistake whatever else is set.\n */\nfunction resolve_dynamic_source(\n init: ProviderInit,\n statics: StaticCredentials,\n): DynamicSource | undefined {\n const use_chain = init['use_credential_chain'] === true\n const raw = init['credential_provider']\n // eslint-disable-next-line typescript-eslint/no-unsafe-type-assertion\n const provider = typeof raw === 'function' ? (raw as BedrockCredentialProvider) : undefined\n if (use_chain && provider !== undefined) {\n throw new engine_config_error(\n 'bedrock provider accepts use_credential_chain or credential_provider, not both',\n 'bedrock',\n )\n }\n if (has_static_credentials(statics)) return undefined\n if (provider !== undefined) return { kind: 'explicit', provider }\n return use_chain ? { kind: 'chain' } : undefined\n}\n\n/**\n * Build the camelCase config the SDK expects, assigning only fields that are\n * set so the object carries no `undefined` entries. The SDK reads either shape\n * identically; the tests assert on key presence, which is the cheaper signal\n * that a credential really was omitted rather than silently resolved.\n */\nfunction to_sdk_config(\n statics: StaticCredentials,\n credential_provider: BedrockCredentialProvider | undefined,\n): BedrockConfig {\n const config: BedrockConfig = { region: statics.region }\n if (statics.api_key !== undefined) config.apiKey = statics.api_key\n if (statics.access_key_id !== undefined) config.accessKeyId = statics.access_key_id\n if (statics.secret_access_key !== undefined) config.secretAccessKey = statics.secret_access_key\n if (statics.session_token !== undefined) config.sessionToken = statics.session_token\n if (statics.base_url !== undefined) config.baseURL = statics.base_url\n if (credential_provider !== undefined) config.credentialProvider = credential_provider\n return config\n}\n\n/**\n * Build the Bedrock ai_sdk adapter: validates the required region, resolves\n * the chosen auth mode (bearer token, explicit SigV4 keys, or a dynamic\n * credential source), and lazily loads @ai-sdk/amazon-bedrock to build models.\n * See the module docstring for the full precedence ladder.\n */\nexport const create_bedrock_adapter = (init: ProviderInit): AiSdkProviderAdapter => {\n const statics = read_static_credentials(init)\n const dynamic_source = resolve_dynamic_source(init, statics)\n\n let chain: BedrockCredentialProvider | undefined\n async function resolve_credential_provider(): Promise<BedrockCredentialProvider | undefined> {\n if (dynamic_source === undefined) return undefined\n if (dynamic_source.kind === 'explicit') return dynamic_source.provider\n chain ??= (\n await load_optional_peer<CredentialProvidersSdk>('@aws-sdk/credential-providers')\n ).fromNodeProviderChain()\n return chain\n }\n\n return {\n kind: 'ai_sdk',\n name: 'bedrock',\n async build_model(model_id: string): Promise<unknown> {\n const sdk = await load_optional_peer<BedrockSdk>('@ai-sdk/amazon-bedrock')\n const provider = sdk.createAmazonBedrock(\n to_sdk_config(statics, await resolve_credential_provider()),\n )\n return provider(model_id)\n },\n translate_effort: translate_bedrock_effort,\n normalize_usage: normalize_bedrock_usage,\n supports: (capability) => SUPPORTED.has(capability),\n }\n}\n","/**\n * Frozen constants for the claude_cli provider: startup and idle defaults,\n * the escalation window, cost decomposition multipliers, and the auth\n * failure pattern list.\n *\n * Arrays are Object.freeze-d at module load so downstream code cannot mutate\n * them.\n */\n\nexport const CLI_BINARY_DEFAULT = 'claude'\n\nexport const DEFAULT_STARTUP_TIMEOUT_MS = 120_000\n\nexport const DEFAULT_STALL_TIMEOUT_MS = 300_000\n\nexport const SIGKILL_ESCALATION_MS = 2000\n\nexport const CACHE_READ_MULTIPLIER = 0.1\n\nexport const CACHE_WRITE_MULTIPLIER = 1.25\n\nexport const CLI_AUTH_ERROR_PATTERNS: ReadonlyArray<string> = Object.freeze([\n 'authentication',\n 'unauthorized',\n 'forbidden',\n 'oauth token has expired',\n 'invalid_api_key',\n])\n\nexport const DEFAULT_SETTING_SOURCES: ReadonlyArray<'user' | 'project' | 'local'> =\n Object.freeze(['project', 'local'])\n","/**\n * Authentication enforcement for the claude_cli adapter.\n *\n * Composes the subprocess environment from provider config and call-level\n * overrides, validates that `auth_mode: 'api_key'` has a key to use, and\n * recognizes CLI stderr auth failures so they can be surfaced as\n * `provider_auth_error` instead of a generic exit-code error.\n */\n\nimport { engine_config_error } from '../../errors.js'\nimport type { AuthMode, ClaudeCliProviderConfig } from './types.js'\nimport { CLI_AUTH_ERROR_PATTERNS } from './constants.js'\n\n/**\n * Standard env keys forwarded from process.env so the spawn target\n * (greywall/bwrap on PATH, then `claude`) can be resolved and run.\n *\n * Mirrors `STANDARD_KEYS` in `src/forward_standard_env.ts`. Keep the two\n * lists in sync; engine cannot import from fascicle (the umbrella depends\n * on engine, not the other way).\n */\nconst STANDARD_ENV_KEYS = [\n 'PATH',\n 'HOME',\n 'SHELL',\n 'USER',\n 'LOGNAME',\n 'LANG',\n 'TMPDIR',\n] as const\n\n/**\n * Throw `engine_config_error` synchronously when `auth_mode: 'api_key'` is\n * set without a non-empty `api_key`.\n *\n * Runs at adapter construction time so a misconfigured provider fails\n * fast, before any CLI subprocess is spawned.\n */\nexport function validate_auth_config(config: ClaudeCliProviderConfig): void {\n const auth_mode = config.auth_mode ?? 'auto'\n if (auth_mode === 'api_key') {\n const api_key = typeof config.api_key === 'string' ? config.api_key : ''\n if (api_key.length === 0) {\n throw new engine_config_error(\n 'api_key is required for auth_mode: api_key',\n 'claude_cli',\n )\n }\n }\n}\n\n/**\n * Copy the string-valued entries of `source` onto `target`, dropping any\n * `undefined` slot (the shape `process.env` and caller overrides both carry).\n */\nfunction copy_string_entries(\n target: Record<string, string>,\n source: Record<string, string | undefined>,\n): void {\n for (const [key, value] of Object.entries(source)) {\n if (typeof value === 'string') target[key] = value\n }\n}\n\n/**\n * Seed the base subprocess env before caller overrides and the auth scrub.\n *\n * `inherit_env: false` starts from an empty env. Otherwise `'oauth'` inherits\n * the full `process.env` (the CLI needs HOME plus session-specific vars to\n * reach the logged-in session); every other mode inherits only the standard\n * keys needed to resolve the sandbox wrapper and the claude binary on PATH.\n */\nfunction seed_base_env(\n config: ClaudeCliProviderConfig,\n auth_mode: AuthMode,\n): Record<string, string> {\n const env: Record<string, string> = {}\n if (config.inherit_env === false) return env\n if (auth_mode === 'oauth') {\n copy_string_entries(env, process.env)\n return env\n }\n for (const key of STANDARD_ENV_KEYS) {\n const value = process.env[key]\n if (typeof value === 'string') env[key] = value\n }\n return env\n}\n\n/**\n * Apply the auth-mode scrub last, after base and caller env are merged, so\n * nothing can re-introduce `ANTHROPIC_API_KEY` under `'oauth'`. `'api_key'`\n * forces the configured key (empty string when absent); `'auto'` forwards a\n * non-empty configured key and otherwise leaves the inherited env untouched.\n */\nfunction apply_auth_key(\n env: Record<string, string>,\n config: ClaudeCliProviderConfig,\n auth_mode: AuthMode,\n): void {\n if (auth_mode === 'oauth') {\n delete env['ANTHROPIC_API_KEY']\n return\n }\n if (auth_mode === 'api_key') {\n env['ANTHROPIC_API_KEY'] = typeof config.api_key === 'string' ? config.api_key : ''\n return\n }\n if (typeof config.api_key === 'string' && config.api_key.length > 0) {\n env['ANTHROPIC_API_KEY'] = config.api_key\n }\n}\n\n/**\n * Compose the subprocess environment for one claude CLI invocation.\n *\n * Regardless of `auth_mode`, seeds the standard process-env keys (PATH,\n * HOME, SHELL, USER, LOGNAME, LANG, TMPDIR) by default so the spawned\n * subprocess can locate the sandbox wrapper (greywall/bwrap) and the\n * claude binary on PATH. Set `inherit_env: false` on the provider config to\n * opt out and start from an empty env instead.\n *\n * Under `auth_mode: 'oauth'` the full `process.env` is inherited instead\n * of just the standard keys, because the CLI needs HOME plus\n * session-specific vars to reach the already-logged-in OAuth session. The\n * auth-mode scrub runs last, after config and caller overrides are merged\n * in, so nothing can re-introduce `ANTHROPIC_API_KEY` under `'oauth'`.\n */\nexport function build_env(\n config: ClaudeCliProviderConfig,\n caller_env: Record<string, string> | undefined,\n auth_mode: AuthMode,\n): Record<string, string> {\n const env = seed_base_env(config, auth_mode)\n if (caller_env !== undefined) copy_string_entries(env, caller_env)\n apply_auth_key(env, config, auth_mode)\n return env\n}\n\n/**\n * Check whether captured CLI stderr looks like an auth failure.\n *\n * Matches case-insensitively against the frozen `CLI_AUTH_ERROR_PATTERNS`\n * list; used to turn a nonzero CLI exit into `provider_auth_error` instead\n * of a generic `claude_cli_error`.\n */\nexport function stderr_is_auth_failure(stderr: string): boolean {\n if (stderr.length === 0) return false\n const lower = stderr.toLowerCase()\n for (const pattern of CLI_AUTH_ERROR_PATTERNS) {\n if (lower.includes(pattern.toLowerCase())) return true\n }\n return false\n}\n","/**\n * Argv builder for the claude CLI invocation.\n *\n * Every option value is a separate argv element; option names are never\n * string-interpolated with values. The returned array is a readonly frozen\n * copy; mutation would indicate a caller bug.\n */\n\nimport type { ClaudeCliCallOptions, ClaudeCliProviderConfig } from './types.js'\nimport { DEFAULT_SETTING_SOURCES } from './constants.js'\n\nexport type BuildArgvInput = {\n readonly model_id: string\n readonly provider_config: ClaudeCliProviderConfig\n readonly call_opts: ClaudeCliCallOptions\n readonly merged_allowed_tools: ReadonlyArray<string>\n readonly merged_system: string\n readonly compiled_schema?: string\n}\n\n/**\n * Assemble the full argv array for one `claude` CLI invocation.\n *\n * Always runs the CLI in non-interactive, streaming JSON mode (`-p\n * --output-format stream-json --verbose`) so the adapter can parse events\n * line by line. Flags are appended in a fixed order; `--resume` is only\n * added when a session id is present, and `--append-system-prompt` only\n * when there's a non-empty merged system prompt.\n */\nexport function build_cli_argv(input: BuildArgvInput): ReadonlyArray<string> {\n const args: string[] = []\n args.push('-p')\n args.push('--output-format', 'stream-json')\n args.push('--model', input.model_id)\n args.push('--verbose')\n\n const setting_sources =\n input.provider_config.setting_sources ?? DEFAULT_SETTING_SOURCES\n args.push('--setting-sources', setting_sources.join(','))\n\n for (const tool of input.merged_allowed_tools) {\n args.push('--allowedTools', tool)\n }\n\n if (typeof input.call_opts.session_id === 'string' && input.call_opts.session_id.length > 0) {\n args.push('--resume', input.call_opts.session_id)\n }\n\n if (input.call_opts.agents !== undefined) {\n args.push('--agents', JSON.stringify(input.call_opts.agents))\n }\n\n const plugin_dirs = input.provider_config.plugin_dirs ?? []\n for (const dir of plugin_dirs) {\n args.push('--plugin-dir', dir)\n }\n\n if (typeof input.compiled_schema === 'string' && input.compiled_schema.length > 0) {\n args.push('--json-schema', input.compiled_schema)\n }\n\n if (input.merged_system.length > 0) {\n args.push('--append-system-prompt', input.merged_system)\n }\n\n const extra_args = input.call_opts.extra_args ?? []\n for (const s of extra_args) {\n args.push(s)\n }\n\n return Object.freeze(args)\n}\n\n/**\n * Join the caller's `system` prompt and the `append_system_prompt` call\n * option into the single string passed to `--append-system-prompt`.\n *\n * Empty or undefined parts are dropped; when both parts are present they're\n * separated by a blank line.\n */\nexport function merge_system(\n opts_system: string | undefined,\n append: string | undefined,\n): string {\n const parts: string[] = []\n if (typeof opts_system === 'string' && opts_system.length > 0) parts.push(opts_system)\n if (typeof append === 'string' && append.length > 0) parts.push(append)\n return parts.join('\\n\\n')\n}\n\n/**\n * Merge the caller's `allowed_tools` allowlist with the tool names derived\n * from `opts.tools`, de-duplicating while preserving first-seen order.\n */\nexport function merge_allowed_tools(\n call_allowlist: ReadonlyArray<string> | undefined,\n tool_names: ReadonlyArray<string>,\n): ReadonlyArray<string> {\n const seen = new Set<string>()\n const merged: string[] = []\n const push_unique = (name: string): void => {\n if (seen.has(name)) return\n seen.add(name)\n merged.push(name)\n }\n if (call_allowlist !== undefined) {\n for (const t of call_allowlist) push_unique(t)\n }\n for (const n of tool_names) push_unique(n)\n return merged\n}\n","/**\n * Sandbox wrapper for the claude_cli adapter.\n *\n * Builds the `{ spawn_cmd, prefix_args }` pair for bwrap and greywall. When\n * no sandbox is configured, returns `{ spawn_cmd: binary, prefix_args: [] }`;\n * the caller then concatenates prefix_args before the CLI argv.\n *\n * Both wrappers allow the binary to execute while restricting network reach\n * to the allowlist and write access to additional paths on top of the\n * sandbox's default-read-only filesystem.\n *\n * greywall 0.3+ removed the `--allow-host` and `--rw` flags; policy now\n * lives in a JSON settings file passed via `--settings <path>`. Schema is\n * documented in `greywall --help`:\n *\n * {\n * \"network\": { \"allowHosts\": [...] },\n * \"filesystem\": { \"allowWrite\": [...] }\n * }\n *\n * `filesystem.allowWrite` is honored directly; `network.allowHosts` is\n * preserved for documentation/forward-compat (greywall ignores unknown\n * fields and host-level allowlisting is currently enforced at the\n * greyproxy layer).\n */\n\nimport { mkdtempSync, writeFileSync } from 'node:fs'\nimport { tmpdir } from 'node:os'\nimport { join } from 'node:path'\n\nimport type { SandboxProviderConfig } from './types.js'\n\nexport type SandboxPlan = {\n readonly spawn_cmd: string\n readonly prefix_args: ReadonlyArray<string>\n}\n\n/**\n * Pick the sandbox wrapper (if any) and build its wrapping argv.\n *\n * Returns the unwrapped binary with no prefix args when `sandbox` is\n * undefined.\n */\nexport function build_sandbox_plan(\n binary: string,\n sandbox: SandboxProviderConfig | undefined,\n): SandboxPlan {\n if (sandbox === undefined) {\n return { spawn_cmd: binary, prefix_args: [] }\n }\n if (sandbox.kind === 'bwrap') {\n return { spawn_cmd: 'bwrap', prefix_args: build_bwrap_args(binary, sandbox) }\n }\n return { spawn_cmd: 'greywall', prefix_args: build_greywall_args(binary, sandbox) }\n}\n\n/**\n * Build the `bwrap` argv prefix that sandboxes the claude binary.\n *\n * Read-only binds the base OS directories, mounts fresh `/proc`, `/dev`,\n * and a tmpfs `/tmp`, and unshares the user/pid/ipc/uts/cgroup namespaces\n * so the child can't see or touch the host outside what's explicitly bound\n * in. Network access is off (`--unshare-net`) unless a non-empty\n * `network_allowlist` is given.\n */\nfunction build_bwrap_args(\n binary: string,\n sandbox: Extract<SandboxProviderConfig, { kind: 'bwrap' }>,\n): ReadonlyArray<string> {\n const args: string[] = []\n args.push('--ro-bind', '/usr', '/usr')\n args.push('--ro-bind', '/bin', '/bin')\n args.push('--ro-bind', '/lib', '/lib')\n args.push('--ro-bind-try', '/lib64', '/lib64')\n args.push('--ro-bind-try', '/etc/resolv.conf', '/etc/resolv.conf')\n args.push('--proc', '/proc')\n args.push('--dev', '/dev')\n args.push('--tmpfs', '/tmp')\n args.push('--unshare-user')\n args.push('--unshare-pid')\n args.push('--unshare-ipc')\n args.push('--unshare-uts')\n args.push('--unshare-cgroup-try')\n args.push('--die-with-parent')\n\n const allowlist = sandbox.network_allowlist ?? []\n if (allowlist.length > 0) {\n args.push('--share-net')\n for (const host of allowlist) {\n args.push('--setenv', 'CLAUDE_CLI_NET_ALLOW', host)\n }\n } else {\n // Empty or absent allowlist means network-off. Without an explicit\n // --unshare-net, bwrap leaves the child in the host network namespace, so\n // the documented \"network-off\" guarantee (docs/cli.md) would be a no-op.\n args.push('--unshare-net')\n }\n\n const write_paths = sandbox.additional_write_paths ?? []\n for (const p of write_paths) {\n args.push('--bind', p, p)\n }\n\n args.push('--')\n args.push(binary)\n return args\n}\n\n/**\n * Build the greywall argv prefix: `--settings <path> -- <binary>`.\n *\n * Uses `sandbox.settings_path` directly when the caller supplied one;\n * otherwise writes a fresh settings file derived from\n * `network_allowlist`/`additional_write_paths`.\n */\nfunction build_greywall_args(\n binary: string,\n sandbox: Extract<SandboxProviderConfig, { kind: 'greywall' }>,\n): ReadonlyArray<string> {\n const settings_path = sandbox.settings_path ?? write_greywall_settings(sandbox)\n return ['--settings', settings_path, '--', binary]\n}\n\n/**\n * Write a greywall JSON settings file for one sandboxed run to a fresh\n * temp directory and return its path.\n */\nfunction write_greywall_settings(\n sandbox: Extract<SandboxProviderConfig, { kind: 'greywall' }>,\n): string {\n const dir = mkdtempSync(join(tmpdir(), `fascicle-greywall-${process.pid}-`))\n const path = join(dir, 'greywall.json')\n const payload = {\n network: { allowHosts: [...(sandbox.network_allowlist ?? [])] },\n filesystem: { allowWrite: [...(sandbox.additional_write_paths ?? [])] },\n }\n writeFileSync(path, JSON.stringify(payload, null, 2), 'utf8')\n return path\n}\n","/**\n * Subprocess lifecycle for the claude_cli adapter.\n *\n * The factory exposes:\n * - `live_children`: a closure-captured Set<ChildProcess> per\n * adapter-factory call; no state is shared at module scope, so two\n * factory invocations track two independent sets of children.\n * - `spawn_cli(...)`: spawns the child with { detached: true, stdio: [...],\n * env, cwd, shell: false }; arms startup + stall timers; escalates\n * SIGTERM to SIGKILL on signal; removes the child from the live set on\n * close.\n * - `dispose_all()`: sends SIGTERM then SIGKILL to every live child and\n * awaits every close.\n *\n * A single process-wide `exit` handler synchronously SIGKILLs every live\n * child across every spawn registry, so a crashing or exiting host process\n * doesn't leak subprocesses. The handler is installed once per Node\n * process and iterates a registry of adapter live-sets.\n *\n * `node:child_process` imports are confined to this directory (enforced by\n * rules/no-child-process-outside-claude-cli.yml). The spawn call passes\n * `shell: false` via argv array form; no value is string-interpolated into\n * argv.\n */\n\nimport { spawn as node_spawn, type ChildProcess } from 'node:child_process'\nimport { aborted_error, claude_cli_error } from '../../errors.js'\nimport { SIGKILL_ESCALATION_MS } from './constants.js'\n\nexport type SpawnArgs = {\n readonly cmd: string\n readonly argv: ReadonlyArray<string>\n readonly env: Record<string, string>\n readonly cwd?: string\n readonly stdin: string\n readonly startup_timeout_ms: number\n readonly stall_timeout_ms: number\n readonly abort?: AbortSignal\n}\n\nexport type SpawnCloseOutcome = {\n readonly code: number | null\n readonly signal: NodeJS.Signals | null\n readonly stderr: string\n}\n\nexport type SpawnSession = {\n readonly child: ChildProcess\n readonly stdout_lines: AsyncIterable<string>\n readonly wait_close: () => Promise<SpawnCloseOutcome>\n readonly request_terminate: (reason: 'abort' | 'disposed' | 'timeout') => void\n}\n\ntype ChildRegistry = Set<ChildProcess>\n\nconst ALL_REGISTRIES: Set<ChildRegistry> = new Set()\nlet exit_handler_installed = false\n\n/**\n * Install the process-wide `exit` handler that SIGKILLs every live child\n * across every spawn registry. Calling this more than once is a no-op.\n *\n * Children are spawned with `detached: true`, which makes each one the\n * leader of its own process group; signaling `-child.pid` (a negative pid)\n * targets the whole group instead of just the direct child, so any\n * grandchildren the CLI itself spawned die too.\n */\nfunction install_exit_handler_once(): void {\n if (exit_handler_installed) return\n exit_handler_installed = true\n const handler = (): void => {\n for (const reg of ALL_REGISTRIES) {\n for (const child of reg) {\n if (child.pid === undefined || child.exitCode !== null) continue\n try {\n process.kill(-child.pid, 'SIGKILL')\n } catch {\n // already exited, or signal failed; nothing more we can do synchronously\n }\n }\n }\n }\n process.on('exit', handler)\n}\n\nexport type SpawnRuntime = {\n readonly live_children: ChildRegistry\n readonly spawn_cli: (args: SpawnArgs) => Promise<SpawnSession>\n readonly dispose_all: () => Promise<void>\n}\n\n/**\n * Build a `SpawnRuntime`: a per-adapter-instance registry of live children\n * plus the `spawn_cli`/`dispose_all` operations that manage them.\n *\n * Registers `live_children` in the module-wide `ALL_REGISTRIES` set so the\n * process `exit` handler installed by `install_exit_handler_once` can find\n * and kill this runtime's children too.\n */\nexport function create_spawn_runtime(): SpawnRuntime {\n const live_children: ChildRegistry = new Set()\n ALL_REGISTRIES.add(live_children)\n install_exit_handler_once()\n\n const spawn_cli = async (args: SpawnArgs): Promise<SpawnSession> => {\n if (args.abort?.aborted === true) {\n throw new aborted_error('aborted', { reason: args.abort.reason })\n }\n \n let child: ChildProcess\n try {\n const spawn_opts: Parameters<typeof node_spawn>[2] = {\n stdio: ['pipe', 'pipe', 'pipe'],\n detached: true,\n env: args.env,\n shell: false,\n }\n if (args.cwd !== undefined) spawn_opts.cwd = args.cwd\n child = node_spawn(args.cmd, [...args.argv], spawn_opts)\n } catch (err: unknown) {\n const message = err instanceof Error ? err.message : String(err)\n throw new claude_cli_error('binary_not_found', `failed to spawn '${args.cmd}': ${message}`)\n }\n \n live_children.add(child)\n \n let spawn_error: Error | undefined\n let startup_error: claude_cli_error | undefined\n let stall_error: claude_cli_error | undefined\n let terminate_reason: 'abort' | 'disposed' | 'timeout' | undefined\n let startup_timer: NodeJS.Timeout | undefined\n let stall_timer: NodeJS.Timeout | undefined\n let sigkill_timer: NodeJS.Timeout | undefined\n let first_stdout_byte_seen = false\n \n const capture: { stderr: string } = { stderr: '' }\n child.stderr?.on('data', (buf: Buffer) => {\n capture.stderr += buf.toString('utf8')\n })\n child.on('error', (err) => {\n spawn_error = err\n })\n \n const clear_all_timers = (): void => {\n // clearTimeout is a no-op on undefined, so the timers need no guards.\n clearTimeout(startup_timer)\n clearTimeout(stall_timer)\n clearTimeout(sigkill_timer)\n startup_timer = undefined\n stall_timer = undefined\n sigkill_timer = undefined\n }\n \n const send_signal = (signal: NodeJS.Signals): void => {\n if (child.pid === undefined || child.exitCode !== null) return\n try {\n process.kill(-child.pid, signal)\n } catch {\n // child already exited, or kill failed; ignore\n }\n }\n \n const escalate = (reason: 'abort' | 'disposed' | 'timeout'): void => {\n if (terminate_reason !== undefined) return\n terminate_reason = reason\n send_signal('SIGTERM')\n sigkill_timer = setTimeout(() => {\n send_signal('SIGKILL')\n }, SIGKILL_ESCALATION_MS)\n }\n \n if (args.startup_timeout_ms > 0) {\n startup_timer = setTimeout(() => {\n if (first_stdout_byte_seen) return\n startup_error = new claude_cli_error(\n 'startup_timeout',\n `no stdout within ${String(args.startup_timeout_ms)}ms`,\n )\n escalate('timeout')\n }, args.startup_timeout_ms)\n }\n \n const arm_stall_timer = (): void => {\n if (args.stall_timeout_ms <= 0) return\n // clearTimeout no-ops on undefined; the previous stall timer (if any)\n // is replaced on every byte to reset the quiet-period window.\n clearTimeout(stall_timer)\n stall_timer = setTimeout(() => {\n stall_error = new claude_cli_error(\n 'stall_timeout',\n `no stdout for ${String(args.stall_timeout_ms)}ms`,\n )\n escalate('timeout')\n }, args.stall_timeout_ms)\n }\n \n const abort_listener = (): void => {\n escalate('abort')\n }\n if (args.abort !== undefined) {\n if (args.abort.aborted) abort_listener()\n else args.abort.addEventListener('abort', abort_listener, { once: true })\n }\n \n const close_promise = new Promise<SpawnCloseOutcome>((resolve) => {\n child.on('close', (code, signal) => {\n clear_all_timers()\n live_children.delete(child)\n if (args.abort !== undefined) {\n args.abort.removeEventListener('abort', abort_listener)\n }\n resolve({ code, signal, stderr: capture.stderr })\n })\n })\n \n const stdin = child.stdin\n if (stdin !== null) {\n stdin.on('error', () => {\n // CLI may close stdin before we finish writing; swallow.\n })\n stdin.write(args.stdin)\n stdin.end()\n }\n \n const stdout_lines = build_stdout_lines(child, () => {\n if (!first_stdout_byte_seen) {\n first_stdout_byte_seen = true\n if (startup_timer !== undefined) {\n clearTimeout(startup_timer)\n startup_timer = undefined\n }\n }\n arm_stall_timer()\n })\n \n return {\n child,\n stdout_lines,\n wait_close: async () => {\n const outcome = await close_promise\n if (spawn_error !== undefined) {\n const message = spawn_error.message\n throw new claude_cli_error('binary_not_found', message)\n }\n if (startup_error !== undefined) throw startup_error\n if (stall_error !== undefined) throw stall_error\n if (terminate_reason === 'abort') {\n throw new aborted_error('aborted', { reason: args.abort?.reason })\n }\n if (terminate_reason === 'disposed') {\n throw new aborted_error('engine disposed', { reason: 'engine_disposed' })\n }\n return outcome\n },\n request_terminate: (reason) => escalate(reason),\n }\n }\n\n const dispose_all = async (): Promise<void> => {\n const pending: Promise<void>[] = []\n for (const child of live_children) {\n pending.push(\n new Promise<void>((resolve) => {\n if (child.exitCode !== null) {\n resolve()\n return\n }\n child.once('close', () => resolve())\n if (child.pid !== undefined) {\n try {\n process.kill(-child.pid, 'SIGTERM')\n } catch {\n // child already exited or signal failed; ignore\n }\n setTimeout(() => {\n if (child.exitCode === null && child.pid !== undefined) {\n try {\n process.kill(-child.pid, 'SIGKILL')\n } catch {\n // ignore\n }\n }\n }, SIGKILL_ESCALATION_MS)\n }\n }),\n )\n }\n await Promise.all(pending)\n ALL_REGISTRIES.delete(live_children)\n }\n\n return { live_children, spawn_cli, dispose_all }\n}\n\n/**\n * Turn a child process's stdout into an async iterable of complete lines.\n *\n * Buffers partial output across `data` events and yields only on `\\n`\n * boundaries; on `end`, flushes a trailing line that has no terminator.\n * Calls `on_data` on every chunk, before buffering, so the caller can reset\n * startup/stall timers on any byte of output rather than only on line\n * boundaries.\n */\nasync function* build_stdout_lines(\n child: ChildProcess,\n on_data: () => void,\n): AsyncIterable<string> {\n const stdout = child.stdout\n if (stdout === null) return\n let buffer = ''\n let ended = false\n const queue: string[] = []\n let resolver: (() => void) | undefined\n const wake = (): void => {\n const r = resolver\n if (r !== undefined) {\n resolver = undefined\n r()\n }\n }\n stdout.setEncoding('utf8')\n stdout.on('data', (chunk: string) => {\n on_data()\n buffer += chunk\n let nl = buffer.indexOf('\\n')\n while (nl !== -1) {\n queue.push(buffer.slice(0, nl))\n buffer = buffer.slice(nl + 1)\n nl = buffer.indexOf('\\n')\n }\n wake()\n })\n stdout.on('end', () => {\n if (buffer.length > 0) {\n queue.push(buffer)\n buffer = ''\n }\n ended = true\n wake()\n })\n stdout.on('error', () => {\n ended = true\n wake()\n })\n while (true) {\n if (queue.length > 0) {\n const next = queue.shift()\n if (next !== undefined) yield next\n continue\n }\n if (ended) return\n await new Promise<void>((r) => {\n resolver = r\n })\n }\n}\n","/**\n * JSON-lines stream parser for the claude CLI stdout.\n *\n * The CLI (run with `--output-format stream-json`) writes one JSON event per\n * line: `system` (session init), `assistant` (model output), `user` (tool\n * results echoed back into the conversation), `result` (the single terminal\n * event carrying totals), and `rate_limit_event` (informational rate-limit\n * budget report). The parser is a line-buffered state machine with minimal\n * state:\n * - buffered partial line\n * - last-seen event type (assistant | user/tool_result | system | result);\n * an `assistant` event that follows a user/tool_result marks a turn\n * boundary and increments `step_index`\n * - current `step_index`\n *\n * Malformed JSON records `{ kind: 'cli_parse_error', line }` to trajectory\n * and skips; unknown event types record `{ kind: 'cli_unknown_event', raw }`\n * and skip. Neither ever throws.\n *\n * Event shapes are validated by hand-written type guards. `as_event` is the\n * discriminated gate over the recognized CLI event types: a value must be a\n * non-array object whose `type` names a known event, and that event's own\n * fields must type-check, or the whole line is rejected as `cli_unknown_event`.\n * This mirrors the strictness of the `z.discriminatedUnion` it replaced: an\n * optional field carrying the wrong type rejects the event, unknown keys ride\n * along unused, and a sub-object (`usage`, `rate_limit_info`) is validated field\n * by field. Per-entry content arrays are the one deliberately permissive layer:\n * `as_assistant_part` / `as_user_part` recognize a single entry at a time and\n * the collector drops the ones that don't match, so a content type a future CLI\n * emits never rejects the surrounding event.\n */\n\nimport type { TrajectoryLogger } from '#core'\nimport type { StreamChunk, UsageTotals } from '../../types.js'\n\ntype CliUsageRaw = {\n input_tokens?: number\n output_tokens?: number\n cache_read_input_tokens?: number\n cache_creation_input_tokens?: number\n}\n\ntype CliTextPart = { type: 'text'; text: string }\ntype CliToolUsePart = { type: 'tool_use'; id: string; name: string; input: unknown }\ntype CliAssistantContent = CliTextPart | CliToolUsePart\n\ntype CliUserContent = {\n type: 'tool_result'\n tool_use_id: string\n content?: unknown\n is_error?: boolean\n}\n\ntype CliSystemEvent = {\n type: 'system'\n subtype?: string\n session_id?: string\n model?: string\n}\n\ntype CliAssistantEvent = {\n type: 'assistant'\n message: { content: CliAssistantContent[] }\n}\n\ntype CliUserEvent = {\n type: 'user'\n message: { content: CliUserContent[] }\n}\n\ntype CliResultEvent = {\n type: 'result'\n subtype?: string\n session_id?: string\n total_cost_usd?: number\n duration_ms?: number\n is_error?: boolean\n usage?: CliUsageRaw\n result?: string\n}\n\ntype CliRateLimitInfo = {\n status?: string\n resetsAt?: number\n rateLimitType?: string\n overageStatus?: string\n overageResetsAt?: number\n isUsingOverage?: boolean\n}\n\ntype CliRateLimitEvent = {\n type: 'rate_limit_event'\n rate_limit_info?: CliRateLimitInfo\n session_id?: string\n}\n\ntype CliEvent =\n | CliSystemEvent\n | CliAssistantEvent\n | CliUserEvent\n | CliResultEvent\n | CliRateLimitEvent\n\n/** A non-null, non-array object: the shape every CLI event and sub-object takes. */\nfunction is_record(value: unknown): value is Record<string, unknown> {\n return typeof value === 'object' && value !== null && !Array.isArray(value)\n}\n\n/** `key` is absent (or `undefined`), or holds a string. */\nfunction opt_string(rec: Record<string, unknown>, key: string): boolean {\n const value = rec[key]\n return value === undefined || typeof value === 'string'\n}\n\n/** `key` is absent (or `undefined`), or holds a number. */\nfunction opt_number(rec: Record<string, unknown>, key: string): boolean {\n const value = rec[key]\n return value === undefined || typeof value === 'number'\n}\n\n/** `key` is absent (or `undefined`), or holds a boolean. */\nfunction opt_boolean(rec: Record<string, unknown>, key: string): boolean {\n const value = rec[key]\n return value === undefined || typeof value === 'boolean'\n}\n\n/**\n * The optional `usage` sub-object of a `result` event. Absent is fine; a present\n * value must be an object whose known token counts are numbers when given. A\n * `null`, an array, or a mistyped count rejects the event.\n */\nfunction is_valid_usage(value: unknown): boolean {\n if (value === undefined) return true\n if (!is_record(value)) return false\n return (\n opt_number(value, 'input_tokens') &&\n opt_number(value, 'output_tokens') &&\n opt_number(value, 'cache_read_input_tokens') &&\n opt_number(value, 'cache_creation_input_tokens')\n )\n}\n\n/**\n * The optional `rate_limit_info` sub-object of a `rate_limit_event`, under the\n * same rule as usage: absent is fine, a present value is validated field by\n * field or the event is rejected.\n */\nfunction is_valid_rate_limit_info(value: unknown): boolean {\n if (value === undefined) return true\n if (!is_record(value)) return false\n return (\n opt_string(value, 'status') &&\n opt_number(value, 'resetsAt') &&\n opt_string(value, 'rateLimitType') &&\n opt_string(value, 'overageStatus') &&\n opt_number(value, 'overageResetsAt') &&\n opt_boolean(value, 'isUsingOverage')\n )\n}\n\n/**\n * Recognize one `assistant` content entry, or `undefined` for anything\n * unrecognized. `text` needs a string `text`; `tool_use` needs string `id` and\n * `name` and carries its opaque `input` through (absent `input` becomes\n * `undefined`, one deliberate tolerance the old `z.unknown()` did not grant).\n * Callers drop the `undefined` results, so an unknown entry type never rejects\n * the surrounding event.\n */\nfunction as_assistant_part(value: unknown): CliAssistantContent | undefined {\n if (!is_record(value)) return undefined\n if (value['type'] === 'text') {\n const text = value['text']\n return typeof text === 'string' ? { type: 'text', text } : undefined\n }\n if (value['type'] === 'tool_use') {\n const id = value['id']\n const name = value['name']\n if (typeof id !== 'string') return undefined\n if (typeof name !== 'string') return undefined\n return { type: 'tool_use', id, name, input: value['input'] }\n }\n return undefined\n}\n\n/**\n * Recognize one `user` content entry as a tool result, or `undefined`. Requires\n * a string `tool_use_id`; `is_error` must be boolean when present, and a present\n * `content` of any shape is carried through. Callers drop the `undefined`\n * results.\n */\nfunction as_user_part(value: unknown): CliUserContent | undefined {\n if (!is_record(value)) return undefined\n if (value['type'] !== 'tool_result') return undefined\n const tool_use_id = value['tool_use_id']\n if (typeof tool_use_id !== 'string') return undefined\n if (!opt_boolean(value, 'is_error')) return undefined\n const part: CliUserContent = { type: 'tool_result', tool_use_id }\n if ('content' in value) part.content = value['content']\n const is_error = value['is_error']\n if (typeof is_error === 'boolean') part.is_error = is_error\n return part\n}\n\n/**\n * Collect the valid parts of an `assistant`/`user` content array. Returns\n * `undefined` (rejecting the event) when `value` is not an array; otherwise maps\n * each entry through `recognize` and keeps the ones it accepts.\n */\nfunction collect_parts<T>(\n value: unknown,\n recognize: (entry: unknown) => T | undefined,\n): T[] | undefined {\n if (!Array.isArray(value)) return undefined\n const parts: T[] = []\n for (const entry of value) {\n const part = recognize(entry)\n if (part !== undefined) parts.push(part)\n }\n return parts\n}\n\n/** A `system` event whose optional metadata fields type-check. */\nfunction is_system_event(raw: Record<string, unknown>): raw is CliSystemEvent {\n return (\n opt_string(raw, 'subtype') &&\n opt_string(raw, 'session_id') &&\n opt_string(raw, 'model')\n )\n}\n\n/** A `result` event whose optional fields and `usage` sub-object type-check. */\nfunction is_result_event(raw: Record<string, unknown>): raw is CliResultEvent {\n return (\n opt_string(raw, 'subtype') &&\n opt_string(raw, 'session_id') &&\n opt_number(raw, 'total_cost_usd') &&\n opt_number(raw, 'duration_ms') &&\n opt_boolean(raw, 'is_error') &&\n is_valid_usage(raw['usage']) &&\n opt_string(raw, 'result')\n )\n}\n\n/** A `rate_limit_event` whose `rate_limit_info` sub-object and `session_id` type-check. */\nfunction is_rate_limit_event(raw: Record<string, unknown>): raw is CliRateLimitEvent {\n return is_valid_rate_limit_info(raw['rate_limit_info']) && opt_string(raw, 'session_id')\n}\n\n/**\n * Recognize a pass-through event in place: hand the original object back (extra\n * keys and all, since nothing downstream reads them) when `recognize` accepts\n * it, or `undefined` to reject. Narrowing keeps this cast-free.\n */\nfunction gate<T extends CliEvent>(\n raw: Record<string, unknown>,\n recognize: (value: Record<string, unknown>) => value is T,\n): T | undefined {\n return recognize(raw) ? raw : undefined\n}\n\n/**\n * Normalize an `assistant` event: its `message` must be an object and its\n * `content` an array, whose recognized parts are kept and the rest dropped.\n */\nfunction as_assistant_event(raw: Record<string, unknown>): CliEvent | undefined {\n const message = raw['message']\n if (!is_record(message)) return undefined\n const content = collect_parts(message['content'], as_assistant_part)\n return content === undefined ? undefined : { type: 'assistant', message: { content } }\n}\n\n/** Normalize a `user` event, under the same rule as `as_assistant_event`. */\nfunction as_user_event(raw: Record<string, unknown>): CliEvent | undefined {\n const message = raw['message']\n if (!is_record(message)) return undefined\n const content = collect_parts(message['content'], as_user_part)\n return content === undefined ? undefined : { type: 'user', message: { content } }\n}\n\n/**\n * The wire gate: validate a parsed JSON value against the recognized CLI event\n * shapes, returning the typed event or `undefined` on any mismatch.\n *\n * `assistant` and `user` are normalized (their content arrays are filtered down\n * to the recognized parts); the pass-through events are recognized in place, so\n * unknown keys survive but are never read.\n */\nfunction as_event(raw: unknown): CliEvent | undefined {\n if (!is_record(raw)) return undefined\n switch (raw['type']) {\n case 'system':\n return gate(raw, is_system_event)\n case 'assistant':\n return as_assistant_event(raw)\n case 'user':\n return as_user_event(raw)\n case 'result':\n return gate(raw, is_result_event)\n case 'rate_limit_event':\n return gate(raw, is_rate_limit_event)\n default:\n return undefined\n }\n}\n\nexport type TurnCollected = {\n readonly step_index: number\n readonly text: string\n readonly tool_calls: ReadonlyArray<{ id: string; name: string; input: unknown }>\n readonly tool_results: ReadonlyArray<{\n id: string\n output?: unknown\n error?: { message: string }\n }>\n readonly usage: UsageTotals\n}\n\nexport type ParsedStream = {\n readonly session_id?: string\n readonly total_cost_usd?: number\n readonly duration_ms?: number\n readonly final_text: string\n readonly final_usage: UsageTotals\n readonly turns: ReadonlyArray<TurnCollected>\n readonly is_error: boolean\n readonly received_result: boolean\n}\n\ntype ParserState = {\n buffer: string\n last_event_type: 'assistant' | 'user_tool_result' | 'system' | 'result' | 'none'\n current_step_index: number\n session_id?: string\n total_cost_usd?: number\n duration_ms?: number\n final_text: string\n final_usage: UsageTotals\n turns: TurnCollected[]\n turn_text: string\n turn_tool_calls: Array<{ id: string; name: string; input: unknown }>\n turn_tool_results: Array<{\n id: string\n output?: unknown\n error?: { message: string }\n }>\n turn_usage: UsageTotals\n is_error: boolean\n received_result: boolean\n}\n\n/**\n * Build a fresh, empty `ParserState` for one CLI invocation.\n */\nexport function create_parser_state(): ParserState {\n return {\n buffer: '',\n last_event_type: 'none',\n current_step_index: 0,\n final_text: '',\n final_usage: { input_tokens: 0, output_tokens: 0 },\n turns: [],\n turn_text: '',\n turn_tool_calls: [],\n turn_tool_results: [],\n turn_usage: { input_tokens: 0, output_tokens: 0 },\n is_error: false,\n received_result: false,\n }\n}\n\n/**\n * Convert the CLI's raw usage fields to fascicle's `UsageTotals` shape.\n *\n * `cache_read_input_tokens` maps to `cached_input_tokens` and\n * `cache_creation_input_tokens` maps to `cache_write_tokens`; both are\n * omitted when the CLI didn't report them.\n */\nfunction map_usage(raw: CliUsageRaw | undefined): UsageTotals {\n if (raw === undefined) return { input_tokens: 0, output_tokens: 0 }\n const out: UsageTotals = {\n input_tokens: typeof raw.input_tokens === 'number' ? raw.input_tokens : 0,\n output_tokens: typeof raw.output_tokens === 'number' ? raw.output_tokens : 0,\n }\n if (typeof raw.cache_read_input_tokens === 'number') {\n out.cached_input_tokens = raw.cache_read_input_tokens\n }\n if (typeof raw.cache_creation_input_tokens === 'number') {\n out.cache_write_tokens = raw.cache_creation_input_tokens\n }\n return out\n}\n\n/**\n * Record a line that failed to parse as JSON to the trajectory logger.\n */\nfunction record_parse_error(\n trajectory: TrajectoryLogger | undefined,\n line: string,\n): void {\n trajectory?.record({ kind: 'cli_parse_error', line })\n}\n\n/**\n * Record a parsed-but-unrecognized CLI event to the trajectory logger.\n */\nfunction record_unknown_event(\n trajectory: TrajectoryLogger | undefined,\n raw: unknown,\n): void {\n trajectory?.record({ kind: 'cli_unknown_event', raw })\n}\n\n/**\n * Record the CLI's `system` (session init) event to the trajectory logger.\n */\nfunction record_session_started(\n trajectory: TrajectoryLogger | undefined,\n session_id: string | undefined,\n model: string | undefined,\n): void {\n trajectory?.record({ kind: 'cli_session_started', session_id, model })\n}\n\n/**\n * Record a `rate_limit_event` to the trajectory logger.\n */\nfunction record_rate_limit(\n trajectory: TrajectoryLogger | undefined,\n event: Extract<CliEvent, { type: 'rate_limit_event' }>,\n): void {\n const info = event.rate_limit_info\n trajectory?.record({\n kind: 'cli_rate_limit_event',\n session_id: event.session_id,\n status: info?.status,\n rate_limit_type: info?.rateLimitType,\n resets_at: info?.resetsAt,\n overage_status: info?.overageStatus,\n overage_resets_at: info?.overageResetsAt,\n is_using_overage: info?.isUsingOverage,\n })\n}\n\n/**\n * Push the in-progress turn onto `state.turns` and reset the per-turn\n * accumulators for the next turn.\n */\nfunction flush_turn(state: ParserState): void {\n state.turns.push({\n step_index: state.current_step_index,\n text: state.turn_text,\n tool_calls: state.turn_tool_calls.slice(),\n tool_results: state.turn_tool_results.slice(),\n usage: { ...state.turn_usage },\n })\n state.turn_text = ''\n state.turn_tool_calls = []\n state.turn_tool_results = []\n state.turn_usage = { input_tokens: 0, output_tokens: 0 }\n}\n\n/**\n * Append a `StreamChunk` to the output array and, if the caller passed an\n * `on_chunk` dispatcher, await its delivery too.\n */\nasync function emit_chunk(\n chunks: StreamChunk[],\n dispatch: ((chunk: StreamChunk) => Promise<void>) | undefined,\n chunk: StreamChunk,\n): Promise<void> {\n chunks.push(chunk)\n if (dispatch !== undefined) await dispatch(chunk)\n}\n\n/**\n * Handle one `assistant` event: emit `text`, `tool_call_start`, and\n * `tool_call_end` chunks for its content and accumulate them onto the\n * current turn.\n *\n * An `assistant` event that follows a `user`/tool-result event marks a new\n * turn boundary: it first emits a synthetic `step_finish` chunk for the\n * turn that just ended, flushes that turn onto `state.turns`, and advances\n * `current_step_index`.\n */\nasync function handle_assistant(\n state: ParserState,\n event: Extract<CliEvent, { type: 'assistant' }>,\n chunks: StreamChunk[],\n dispatch: ((chunk: StreamChunk) => Promise<void>) | undefined,\n): Promise<void> {\n if (state.last_event_type === 'user_tool_result') {\n const usage = { ...state.turn_usage }\n await emit_chunk(chunks, dispatch, {\n kind: 'step_finish',\n step_index: state.current_step_index,\n finish_reason: 'tool_calls',\n usage,\n })\n flush_turn(state)\n state.current_step_index += 1\n }\n\n for (const part of event.message.content) {\n if (part.type === 'text') {\n state.turn_text += part.text\n state.final_text += part.text\n await emit_chunk(chunks, dispatch, {\n kind: 'text',\n text: part.text,\n step_index: state.current_step_index,\n })\n continue\n }\n state.turn_tool_calls.push({ id: part.id, name: part.name, input: part.input })\n await emit_chunk(chunks, dispatch, {\n kind: 'tool_call_start',\n id: part.id,\n name: part.name,\n step_index: state.current_step_index,\n })\n await emit_chunk(chunks, dispatch, {\n kind: 'tool_call_end',\n id: part.id,\n input: part.input,\n step_index: state.current_step_index,\n })\n }\n state.last_event_type = 'assistant'\n}\n\n/**\n * Handle one `user` event: emit a `tool_result` chunk for each tool result\n * in its content and accumulate them onto the current turn.\n */\nasync function handle_user(\n state: ParserState,\n event: Extract<CliEvent, { type: 'user' }>,\n chunks: StreamChunk[],\n dispatch: ((chunk: StreamChunk) => Promise<void>) | undefined,\n): Promise<void> {\n for (const part of event.message.content) {\n if (part.type !== 'tool_result') continue\n const is_err = part.is_error === true\n const stream_chunk: StreamChunk = {\n kind: 'tool_result',\n id: part.tool_use_id,\n step_index: state.current_step_index,\n }\n if (is_err) {\n const content_str =\n typeof part.content === 'string' ? part.content : JSON.stringify(part.content)\n stream_chunk.error = { message: content_str }\n state.turn_tool_results.push({\n id: part.tool_use_id,\n error: { message: content_str },\n })\n } else {\n stream_chunk.output = part.content\n state.turn_tool_results.push({ id: part.tool_use_id, output: part.content })\n }\n await emit_chunk(chunks, dispatch, stream_chunk)\n }\n state.last_event_type = 'user_tool_result'\n}\n\n/**\n * Handle the terminal `result` event: capture the call's session id, cost,\n * duration, and final usage, flush the last in-progress turn, and emit the\n * closing `finish` chunk.\n *\n * Falls back to `event.result` for `final_text` only when no assistant\n * text was collected during the stream.\n */\nasync function handle_result(\n state: ParserState,\n event: Extract<CliEvent, { type: 'result' }>,\n chunks: StreamChunk[],\n dispatch: ((chunk: StreamChunk) => Promise<void>) | undefined,\n): Promise<void> {\n state.received_result = true\n if (typeof event.session_id === 'string') state.session_id = event.session_id\n if (typeof event.total_cost_usd === 'number') state.total_cost_usd = event.total_cost_usd\n if (typeof event.duration_ms === 'number') state.duration_ms = event.duration_ms\n if (event.is_error === true) state.is_error = true\n const usage = map_usage(event.usage)\n state.final_usage = usage\n state.turn_usage = { ...usage }\n if (typeof event.result === 'string' && event.result.length > 0) {\n if (state.final_text.length === 0) state.final_text = event.result\n }\n flush_turn(state)\n state.last_event_type = 'result'\n await emit_chunk(chunks, dispatch, {\n kind: 'finish',\n finish_reason: 'stop',\n usage,\n })\n}\n\n/**\n * Dispatch one validated `CliEvent` to its type-specific handler.\n */\nasync function handle_event(\n state: ParserState,\n event: CliEvent,\n chunks: StreamChunk[],\n dispatch: ((chunk: StreamChunk) => Promise<void>) | undefined,\n trajectory: TrajectoryLogger | undefined,\n): Promise<void> {\n switch (event.type) {\n case 'system':\n record_session_started(trajectory, event.session_id, event.model)\n if (typeof event.session_id === 'string' && state.session_id === undefined) {\n state.session_id = event.session_id\n }\n state.last_event_type = 'system'\n return\n case 'assistant':\n await handle_assistant(state, event, chunks, dispatch)\n return\n case 'user':\n await handle_user(state, event, chunks, dispatch)\n return\n case 'result':\n await handle_result(state, event, chunks, dispatch)\n return\n case 'rate_limit_event':\n record_rate_limit(trajectory, event)\n return\n }\n}\n\n/**\n * Parse and handle one line of CLI stdout.\n *\n * Blank lines are skipped. Lines that aren't valid JSON, or that don't\n * match any known event shape, are recorded to the trajectory logger and\n * otherwise ignored; this function never throws.\n */\nasync function consume_line(\n state: ParserState,\n line: string,\n chunks: StreamChunk[],\n dispatch: ((chunk: StreamChunk) => Promise<void>) | undefined,\n trajectory: TrajectoryLogger | undefined,\n): Promise<void> {\n const trimmed = line.trim()\n if (trimmed.length === 0) return\n let parsed: unknown\n try {\n parsed = JSON.parse(trimmed)\n } catch {\n record_parse_error(trajectory, line)\n return\n }\n const event = as_event(parsed)\n if (event === undefined) {\n record_unknown_event(trajectory, parsed)\n return\n }\n await handle_event(state, event, chunks, dispatch, trajectory)\n}\n\n/**\n * Append raw stdout text to the parser's line buffer and consume every\n * complete line it now contains.\n *\n * Any trailing partial line (no `\\n` yet) stays buffered for the next\n * call.\n */\nexport async function feed_chunk(\n state: ParserState,\n chunk: string,\n chunks: StreamChunk[],\n dispatch: ((chunk: StreamChunk) => Promise<void>) | undefined,\n trajectory: TrajectoryLogger | undefined,\n): Promise<void> {\n state.buffer += chunk\n let nl_index = state.buffer.indexOf('\\n')\n while (nl_index !== -1) {\n const line = state.buffer.slice(0, nl_index)\n state.buffer = state.buffer.slice(nl_index + 1)\n await consume_line(state, line, chunks, dispatch, trajectory)\n nl_index = state.buffer.indexOf('\\n')\n }\n}\n\n/**\n * Consume a final buffered line that has no trailing newline.\n *\n * `feed_chunk` only parses complete `\\n`-terminated lines, so a trailing\n * unterminated fragment stays in the buffer until the caller knows the\n * stream has actually ended. Call this once, after the last `feed_chunk`,\n * to parse that fragment as one last line.\n */\nexport async function flush_remaining(\n state: ParserState,\n chunks: StreamChunk[],\n dispatch: ((chunk: StreamChunk) => Promise<void>) | undefined,\n trajectory: TrajectoryLogger | undefined,\n): Promise<void> {\n if (state.buffer.length === 0) return\n const line = state.buffer\n state.buffer = ''\n await consume_line(state, line, chunks, dispatch, trajectory)\n}\n\n/**\n * Take an immutable copy of the parser state's accumulated results as a\n * `ParsedStream`.\n */\nexport function snapshot(state: ParserState): ParsedStream {\n const base: {\n final_text: string\n final_usage: UsageTotals\n turns: ReadonlyArray<TurnCollected>\n is_error: boolean\n received_result: boolean\n session_id?: string\n total_cost_usd?: number\n duration_ms?: number\n } = {\n final_text: state.final_text,\n final_usage: { ...state.final_usage },\n turns: state.turns.slice(),\n is_error: state.is_error,\n received_result: state.received_result,\n }\n if (state.session_id !== undefined) base.session_id = state.session_id\n if (state.total_cost_usd !== undefined) base.total_cost_usd = state.total_cost_usd\n if (state.duration_ms !== undefined) base.duration_ms = state.duration_ms\n return base\n}\n","/**\n * Cost decomposition from the CLI's reported `total_cost_usd`.\n *\n * The CLI reports a single total_cost_usd and per-turn usage; it does not\n * break cost down by component or by turn. This module synthesizes a\n * component split by computing an implied per-million-token rate from the\n * total and allocating that rate to each token component, weighted by\n * `CACHE_READ_MULTIPLIER` and `CACHE_WRITE_MULTIPLIER`.\n *\n * Per-turn allocation splits `total_cost_usd` across turns proportional to\n * each turn's output tokens. Sum equality is preserved exactly by giving\n * any floating-point rounding remainder to the last turn.\n */\n\nimport type { CostBreakdown, UsageTotals } from '../../types.js'\nimport { CACHE_READ_MULTIPLIER, CACHE_WRITE_MULTIPLIER } from './constants.js'\n\n/**\n * Split a single `total_cost_usd` figure into an input/output cost\n * breakdown, weighted by token counts.\n *\n * Cache-read and cache-write tokens are cheaper and pricier respectively\n * than base input tokens, so they're weighted by `CACHE_READ_MULTIPLIER`\n * and `CACHE_WRITE_MULTIPLIER` before the total is distributed\n * proportionally across all weighted components. Returns an all-zero\n * estimate when there's no usage or no cost to distribute.\n */\nexport function decompose_total_cost(\n total_cost_usd: number,\n usage: UsageTotals,\n): CostBreakdown {\n const input = Math.max(0, usage.input_tokens)\n const output = Math.max(0, usage.output_tokens)\n const cached = Math.max(0, usage.cached_input_tokens ?? 0)\n const cache_write = Math.max(0, usage.cache_write_tokens ?? 0)\n\n const base_input = Math.max(0, input - cached - cache_write)\n\n const input_weight = base_input\n const output_weight = output\n const cached_weight = cached * CACHE_READ_MULTIPLIER\n const cache_write_weight = cache_write * CACHE_WRITE_MULTIPLIER\n\n const total_weight = input_weight + output_weight + cached_weight + cache_write_weight\n\n if (total_weight === 0 || total_cost_usd === 0) {\n return {\n total_usd: total_cost_usd,\n input_usd: 0,\n output_usd: 0,\n currency: 'USD',\n is_estimate: true,\n }\n }\n\n const input_usd = (total_cost_usd * input_weight) / total_weight\n const output_usd = (total_cost_usd * output_weight) / total_weight\n const cached_usd_raw = (total_cost_usd * cached_weight) / total_weight\n const cache_write_usd_raw = (total_cost_usd * cache_write_weight) / total_weight\n\n const breakdown: CostBreakdown = {\n total_usd: total_cost_usd,\n input_usd,\n output_usd,\n currency: 'USD',\n is_estimate: true,\n }\n if (cached > 0) breakdown.cached_input_usd = cached_usd_raw\n if (cache_write > 0) breakdown.cache_write_usd = cache_write_usd_raw\n return breakdown\n}\n\nexport type TurnUsage = {\n readonly output_tokens: number\n readonly usage: UsageTotals\n}\n\n/**\n * Split `total_cost_usd` into a per-turn total for each turn, proportional to\n * its output tokens, falling back to an equal split when every turn reports\n * zero output (the proportional weights would otherwise all be zero). The last\n * turn absorbs the floating-point rounding remainder so the shares sum exactly\n * to `total_cost_usd`. Caller guarantees a non-empty `turns`.\n */\nfunction split_total_across_turns(\n total_cost_usd: number,\n turns: ReadonlyArray<TurnUsage>,\n): number[] {\n const total_output = turns.reduce((sum, t) => sum + Math.max(0, t.output_tokens), 0)\n const per_turn = turns.map((t) =>\n total_output === 0\n ? total_cost_usd / turns.length\n : total_cost_usd * (Math.max(0, t.output_tokens) / total_output),\n )\n\n const assigned = per_turn.reduce((a, b) => a + b, 0)\n const last_index = turns.length - 1\n per_turn[last_index] = (per_turn[last_index] ?? 0) + (total_cost_usd - assigned)\n return per_turn\n}\n\n/**\n * Split a call's total cost across its turns, proportional to each turn's\n * output tokens, then decompose each turn's share into a `CostBreakdown`.\n *\n * Falls back to an equal split when every turn reports zero output tokens\n * (the proportional weights would otherwise all be zero). The last turn\n * absorbs the floating-point rounding remainder so the per-turn totals sum\n * exactly to `total_cost_usd`.\n */\nexport function allocate_cost_across_turns(\n total_cost_usd: number,\n turns: ReadonlyArray<TurnUsage>,\n): ReadonlyArray<CostBreakdown> {\n if (turns.length === 0) return []\n const per_turn = split_total_across_turns(total_cost_usd, turns)\n return turns.map((t, i) => decompose_total_cost(per_turn[i] ?? 0, t.usage))\n}\n","/**\n * Build a GenerateResult from a parsed CLI stream.\n *\n * Given a completed ParsedStream and the call's resolved model, this module\n * synthesizes:\n * - per-turn StepRecord entries with output-weighted cost\n * - aggregate GenerateResult with CLI-reported total_cost_usd\n * - provider_reported.claude_cli with session_id + duration_ms\n *\n * When no turns were collected (a `result` event arrived without any\n * assistant messages), the adapter synthesizes a single step whose text\n * equals the `result.result` field and whose usage equals the top-level\n * usage.\n */\n\nimport type { ToolSchema } from '#schema'\nimport type {\n ResolvedModel,\n CostBreakdown,\n FinishReason,\n GenerateResult,\n StepRecord,\n ToolCallRecord,\n UsageTotals,\n} from '../../types.js'\nimport type { ClaudeCliProviderReported } from './types.js'\nimport type { ParsedStream, TurnCollected } from './stream_parse.js'\nimport { allocate_cost_across_turns, type TurnUsage } from './cost.js'\nimport { claude_cli_error } from '../../errors.js'\n\n/**\n * Sum a list of per-turn `UsageTotals` into one aggregate total.\n *\n * Optional fields (`cached_input_tokens`, `cache_write_tokens`,\n * `reasoning_tokens`) are included in the sum only when at least one input\n * reports them, so the aggregate omits a field entirely rather than\n * reporting a false zero.\n */\nfunction sum_usage(totals: ReadonlyArray<UsageTotals>): UsageTotals {\n let input = 0\n let output = 0\n let cached: number | undefined\n let cache_write: number | undefined\n let reasoning: number | undefined\n for (const u of totals) {\n input += u.input_tokens\n output += u.output_tokens\n if (u.cached_input_tokens !== undefined) cached = (cached ?? 0) + u.cached_input_tokens\n if (u.cache_write_tokens !== undefined) cache_write = (cache_write ?? 0) + u.cache_write_tokens\n if (u.reasoning_tokens !== undefined) reasoning = (reasoning ?? 0) + u.reasoning_tokens\n }\n const out: UsageTotals = { input_tokens: input, output_tokens: output }\n if (cached !== undefined) out.cached_input_tokens = cached\n if (cache_write !== undefined) out.cache_write_tokens = cache_write\n if (reasoning !== undefined) out.reasoning_tokens = reasoning\n return out\n}\n\n/**\n * Sum a list of per-turn `CostBreakdown`s into one aggregate breakdown.\n *\n * Returns `undefined` for an empty list. Optional cache fields are\n * included only when at least one input breakdown reports them.\n */\nfunction aggregate_cost_breakdowns(\n breakdowns: ReadonlyArray<CostBreakdown>,\n): CostBreakdown | undefined {\n if (breakdowns.length === 0) return undefined\n let total = 0\n let input = 0\n let output = 0\n let cached_present = false\n let cached = 0\n let cache_write_present = false\n let cache_write = 0\n for (const b of breakdowns) {\n total += b.total_usd\n input += b.input_usd\n output += b.output_usd\n if (b.cached_input_usd !== undefined) {\n cached_present = true\n cached += b.cached_input_usd\n }\n if (b.cache_write_usd !== undefined) {\n cache_write_present = true\n cache_write += b.cache_write_usd\n }\n }\n const agg: CostBreakdown = {\n total_usd: total,\n input_usd: input,\n output_usd: output,\n currency: 'USD',\n is_estimate: true,\n }\n if (cached_present) agg.cached_input_usd = cached\n if (cache_write_present) agg.cache_write_usd = cache_write\n return agg\n}\n\n/**\n * Return the parsed stream's collected turns, or synthesize a single turn\n * from the top-level result when none were collected.\n *\n * A `result` event with no preceding `assistant` events (an immediate\n * error, or a response with no visible turns) leaves `parsed.turns` empty;\n * this keeps `build_generate_result` from having to special-case that.\n */\nfunction normalize_turns(parsed: ParsedStream): ReadonlyArray<TurnCollected> {\n if (parsed.turns.length > 0) return parsed.turns\n const synth: TurnCollected = {\n step_index: 0,\n text: parsed.final_text,\n tool_calls: [],\n tool_results: [],\n usage: parsed.final_usage,\n }\n return [synth]\n}\n\n/**\n * Build a `ToolCallRecord` for one tool call, attaching its matching\n * result (output or error) when present.\n *\n * `duration_ms` is always 0: the CLI's stream-json events don't report\n * per-tool-call timing, so there's nothing to measure it against.\n */\nfunction tool_call_record(\n step_index: number,\n call: { id: string; name: string; input: unknown },\n results: ReadonlyArray<{\n id: string\n output?: unknown\n error?: { message: string }\n }>,\n now: number,\n): ToolCallRecord {\n const rec: ToolCallRecord = {\n id: call.id,\n name: call.name,\n input: call.input,\n duration_ms: 0,\n started_at: now,\n }\n const matched = results.find((r) => r.id === call.id)\n if (matched !== undefined) {\n if (matched.output !== undefined) rec.output = matched.output\n if (matched.error !== undefined) rec.error = matched.error\n }\n return rec\n}\n\nexport type BuildResultInput<T> = {\n readonly parsed: ParsedStream\n readonly resolved: ResolvedModel\n readonly schema?: ToolSchema<T>\n readonly parsed_content?: T\n}\n\n/**\n * Assemble a `GenerateResult<T>` from a parsed CLI stream.\n *\n * Throws a `claude_cli_error` instead of returning when the CLI reported\n * an error result, since `FinishReason` has no `'error'` member and\n * returning `finish_reason: 'stop'` would make the failure look like a\n * successful call.\n */\nexport function build_generate_result<T>(input: BuildResultInput<T>): GenerateResult<T> {\n const { parsed, resolved } = input\n\n // An is_error result is a failed turn, not a clean stop. Returning it with\n // finish_reason 'stop' would make a CLI-side error look like success; throw\n // instead so the caller sees the failure. FinishReason has no 'error' member.\n if (parsed.is_error) {\n throw new claude_cli_error(\n 'result_error',\n parsed.final_text.length > 0\n ? parsed.final_text\n : 'claude_cli returned an error result',\n )\n }\n\n const turns = normalize_turns(parsed)\n const now = Date.now()\n\n const turn_usages: TurnUsage[] = turns.map((t) => ({\n output_tokens: t.usage.output_tokens,\n usage: t.usage,\n }))\n\n const total_cost_usd = parsed.total_cost_usd ?? 0\n const has_cost = parsed.total_cost_usd !== undefined\n const cost_per_turn: ReadonlyArray<CostBreakdown> = has_cost\n ? allocate_cost_across_turns(total_cost_usd, turn_usages)\n : []\n\n const finish_reason: FinishReason = 'stop'\n\n const steps: StepRecord[] = []\n const tool_calls_accum: ToolCallRecord[] = []\n turns.forEach((turn, i) => {\n const step_tool_calls: ToolCallRecord[] = turn.tool_calls.map((call) =>\n tool_call_record(turn.step_index, call, turn.tool_results, now),\n )\n for (const tc of step_tool_calls) tool_calls_accum.push(tc)\n const record: StepRecord = {\n index: turn.step_index,\n text: turn.text,\n tool_calls: step_tool_calls,\n usage: turn.usage,\n finish_reason: i === turns.length - 1 ? finish_reason : 'tool_calls',\n }\n if (has_cost) {\n const cost = cost_per_turn[i]\n if (cost !== undefined) record.cost = cost\n }\n steps.push(record)\n })\n\n const total_usage = sum_usage(steps.map((s) => s.usage))\n const total_cost = has_cost ? aggregate_cost_breakdowns(cost_per_turn) : undefined\n\n const provider_reported: Record<string, unknown> = {}\n if (parsed.session_id !== undefined || parsed.duration_ms !== undefined) {\n const reported: ClaudeCliProviderReported = {\n session_id: parsed.session_id ?? '',\n duration_ms: parsed.duration_ms ?? 0,\n }\n provider_reported['claude_cli'] = reported\n }\n\n // oxlint-disable-next-line typescript-eslint/no-unsafe-type-assertion\n const content_raw = input.parsed_content ?? (parsed.final_text as T)\n\n const result: GenerateResult<T> = {\n content: content_raw,\n tool_calls: tool_calls_accum,\n steps,\n usage: total_usage,\n finish_reason,\n model_resolved: { provider: resolved.provider, model_id: resolved.model_id },\n }\n if (total_cost !== undefined) result.cost = total_cost\n if (Object.keys(provider_reported).length > 0) {\n result.provider_reported = provider_reported\n }\n return result\n}\n","/**\n * Schema parse and repair helpers.\n *\n * The tool-loop / generate orchestrator owns the repair loop itself (counting\n * attempts toward `max_steps`, re-dispatching through the provider). This\n * module exposes only the parse primitive and the canonical repair-prompt\n * shape.\n */\n\nimport { format_schema_issues, validate_schema, type AnySchema, type SchemaIssue } from '#schema'\nimport type { Message } from './types.js'\nimport { schema_validation_error } from './errors.js'\n\nexport type ParseOutcome<t> =\n | { ok: true; value: t }\n | { ok: false; issues: ReadonlyArray<SchemaIssue> }\n\n/**\n * Attempt to parse `text` as JSON and validate it with `schema`. Returns a\n * tagged union; the caller decides whether to escalate to repair, throw, or\n * surface the failure.\n *\n * Even with --json-schema enforcement, models occasionally wrap structured\n * output in markdown fences and surrounding prose. We try a sequence of\n * candidates in increasing leniency: the trimmed text as-is, every fenced\n * block in the text, and the outermost {…} / […] slice. The first candidate\n * that both parses as JSON and matches the schema wins.\n *\n * When every candidate fails, we prefer the schema-validation issues from the\n * FIRST candidate that parsed as JSON: those issues reflect the model's\n * primary output and are what a repair prompt should feed back. Later\n * candidates (e.g. the bracket-slice fallback) often produce noisy issues\n * like \"expected object, received array\" that misdirect the model. Only when\n * NO candidate parses as JSON do we surface the JSON parse error.\n *\n * Async because Standard Schema permits a vendor's `validate` to return a\n * promise; the ripple stops at generate.ts and the claude_cli adapter, both of\n * which already await their surrounding work.\n */\nexport async function parse_with_schema<t>(\n schema: AnySchema<t>,\n text: string,\n): Promise<ParseOutcome<t>> {\n const candidates = json_candidates(text)\n let json_parse_issues: ReadonlyArray<SchemaIssue> = [\n { message: 'No JSON-parseable content found in model output' },\n ]\n let first_schema_issues: ReadonlyArray<SchemaIssue> | undefined\n for (const candidate of candidates) {\n let parsed: unknown\n try {\n parsed = JSON.parse(candidate)\n } catch (err: unknown) {\n json_parse_issues = [{ message: err instanceof Error ? err.message : String(err) }]\n continue\n }\n const result = await validate_schema(schema, parsed)\n if (result.ok) return { ok: true, value: result.value }\n first_schema_issues ??= result.issues\n }\n return { ok: false, issues: first_schema_issues ?? json_parse_issues }\n}\n\nconst FENCE_BLOCK = /```(?:[\\w-]*)\\s*\\n?([\\s\\S]*?)\\n?```/g\n\n/**\n * Generate JSON substrings to try parsing, from strictest to most lenient:\n * the trimmed text as-is, the body of every fenced code block, and the\n * outermost `{...}` and `[...]` slices. Duplicate candidates are dropped.\n */\nfunction json_candidates(text: string): string[] {\n const candidates: string[] = []\n const seen = new Set<string>()\n const push = (s: string): void => {\n const trimmed = s.trim()\n if (trimmed.length === 0 || seen.has(trimmed)) return\n seen.add(trimmed)\n candidates.push(trimmed)\n }\n push(text)\n for (const match of text.matchAll(FENCE_BLOCK)) {\n const body = match[1]\n if (body !== undefined) push(body)\n }\n push(slice_outermost(text, '{', '}'))\n push(slice_outermost(text, '[', ']'))\n return candidates\n}\n\n/**\n * Slice `text` from its first `open` character through its last matching\n * `close` character, inclusive. Returns an empty string if `open` is absent\n * or `close` does not appear after it.\n */\nfunction slice_outermost(text: string, open: string, close: string): string {\n const first = text.indexOf(open)\n const last = text.lastIndexOf(close)\n if (first === -1 || last <= first) return ''\n return text.slice(first, last + 1)\n}\n\n/**\n * Build the canonical repair message appended after a schema parse failure.\n *\n * The wording is fixed rather than adapter-specific, so the repair prompt\n * stays predictable and is easy to read back from trajectory output.\n */\nexport function build_repair_message(issues: ReadonlyArray<SchemaIssue>): Message {\n return { role: 'user', content: build_repair_prompt_text(issues) }\n}\n\n/**\n * String form of the repair prompt for transports (subprocess CLIs) that take\n * a single stdin string rather than a Message. Same wording as\n * build_repair_message so the on-wire instruction is identical across providers.\n */\nexport function build_repair_prompt_text(issues: ReadonlyArray<SchemaIssue>): string {\n const serialized = format_schema_issues(issues)\n return (\n `Your previous response did not match the expected schema. Error: ${serialized}. ` +\n 'Please provide a corrected response that strictly conforms to the schema. ' +\n 'Return ONLY the JSON value: no markdown code fences, no surrounding prose, no commentary.'\n )\n}\n\n/**\n * Throw schema_validation_error carrying the schema issues and the raw model text.\n * Called by the orchestrator when all repair attempts are exhausted.\n */\nexport function throw_schema_validation(\n issues: ReadonlyArray<SchemaIssue>,\n raw_text: string,\n): never {\n throw new schema_validation_error(\n `schema validation failed: ${format_schema_issues(issues)}`,\n issues,\n raw_text,\n )\n}\n","/**\n * Trajectory span and record helpers for the engine.\n *\n * When a TrajectoryLogger is supplied to generate, these helpers emit the\n * engine's event vocabulary. When it is undefined, every helper is a no-op,\n * so call sites never need to branch on whether tracing is on. The tool loop\n * drives span lifecycle; these helpers capture the event shape and keep\n * dispatch consistent.\n */\n\nimport type { TrajectoryLogger } from '#core'\nimport type {\n CostBreakdown,\n FinishReason,\n UsageTotals,\n} from './types.js'\n\nexport type GenerateSpanStartMeta = {\n model: string\n provider: string\n model_id: string\n has_tools: boolean\n has_schema: boolean\n streaming: boolean\n}\n\n/**\n * Open the `engine.generate` span that brackets one whole generate call.\n */\nexport function start_generate_span(\n trajectory: TrajectoryLogger | undefined,\n meta: GenerateSpanStartMeta,\n): string | undefined {\n if (trajectory === undefined) return undefined\n return trajectory.start_span('engine.generate', { ...meta })\n}\n\n/**\n * Close the `engine.generate` span with usage, finish reason, resolved model,\n * or the error message on failure.\n */\nexport function end_generate_span(\n trajectory: TrajectoryLogger | undefined,\n span_id: string | undefined,\n meta: {\n usage?: UsageTotals\n finish_reason?: FinishReason\n model_resolved?: { provider: string; model_id: string }\n error?: string\n },\n): void {\n if (trajectory === undefined || span_id === undefined) return\n trajectory.end_span(span_id, { ...meta })\n}\n\n/**\n * Open an `engine.generate.step` span for one model turn in the tool loop.\n */\nexport function start_step_span(\n trajectory: TrajectoryLogger | undefined,\n index: number,\n): string | undefined {\n if (trajectory === undefined) return undefined\n return trajectory.start_span('engine.generate.step', { index })\n}\n\n/**\n * Close an `engine.generate.step` span with per-step usage or error.\n */\nexport function end_step_span(\n trajectory: TrajectoryLogger | undefined,\n span_id: string | undefined,\n meta: { usage?: UsageTotals; finish_reason?: FinishReason; error?: string },\n): void {\n if (trajectory === undefined || span_id === undefined) return\n trajectory.end_span(span_id, { ...meta })\n}\n\n/**\n * Record that a provider request went out, with an optional prompt-token\n * estimate for providers that report one before the response arrives.\n */\nexport function record_request_sent(\n trajectory: TrajectoryLogger | undefined,\n step_index: number,\n prompt_tokens_estimated: number | undefined,\n): void {\n if (trajectory === undefined) return\n const event: Record<string, unknown> = {\n kind: 'request_sent',\n step_index,\n }\n if (prompt_tokens_estimated !== undefined) {\n event['prompt_tokens_estimated'] = prompt_tokens_estimated\n }\n trajectory.record({ kind: 'request_sent', ...event })\n}\n\n/**\n * Record a provider response with its finish reason and output token count.\n */\nexport function record_response_received(\n trajectory: TrajectoryLogger | undefined,\n step_index: number,\n output_tokens: number | undefined,\n finish_reason: FinishReason,\n): void {\n if (trajectory === undefined) return\n const event: Record<string, unknown> = {\n kind: 'response_received',\n step_index,\n finish_reason,\n }\n if (output_tokens !== undefined) event['output_tokens'] = output_tokens\n trajectory.record({ kind: 'response_received', ...event })\n}\n\nexport type ToolCallRecordEvent = {\n step_index: number\n name: string\n tool_call_id: string\n input: unknown\n duration_ms: number\n error?: { message: string }\n}\n\n/**\n * Record a tool invocation request: name, call id, input, and duration.\n */\nexport function record_tool_call(\n trajectory: TrajectoryLogger | undefined,\n meta: ToolCallRecordEvent,\n): void {\n if (trajectory === undefined) return\n const event: Record<string, unknown> = {\n kind: 'tool_call',\n step_index: meta.step_index,\n name: meta.name,\n tool_call_id: meta.tool_call_id,\n input: meta.input,\n duration_ms: meta.duration_ms,\n }\n if (meta.error !== undefined) event['error'] = meta.error\n trajectory.record({ kind: 'tool_call', ...event })\n}\n\nexport type ToolResultRecordEvent = {\n step_index: number\n name: string\n tool_call_id: string\n duration_ms: number\n output?: unknown\n error?: { message: string }\n}\n\n/**\n * Record a resolved tool call's result. `record_tool_call` captures the request\n * (input); without this event a successful tool's output never reaches the\n * trajectory, leaving the run record blind to what tools actually returned.\n */\nexport function record_tool_result(\n trajectory: TrajectoryLogger | undefined,\n meta: ToolResultRecordEvent,\n): void {\n if (trajectory === undefined) return\n const event: Record<string, unknown> = {\n kind: 'tool_result',\n step_index: meta.step_index,\n name: meta.name,\n tool_call_id: meta.tool_call_id,\n duration_ms: meta.duration_ms,\n }\n if (meta.error !== undefined) event['error'] = meta.error\n else event['output'] = meta.output\n trajectory.record({ kind: 'tool_result', ...event })\n}\n\n/**\n * Add a `ts` (epoch milliseconds) to span meta unless one is already set.\n */\nfunction stamp_ts(meta: Record<string, unknown> | undefined): Record<string, unknown> {\n const out: Record<string, unknown> = { ...meta }\n if (!('ts' in out)) out['ts'] = Date.now()\n return out\n}\n\n/**\n * Wrap a logger so engine events carry a `ts` (epoch milliseconds) even when\n * generate is called directly with a caller-supplied logger rather than\n * through the core runner. When the logger is already runner-decorated, the\n * existing `ts` is preserved.\n */\nexport function with_timestamps(\n inner: TrajectoryLogger | undefined,\n): TrajectoryLogger | undefined {\n if (inner === undefined) return undefined\n return {\n record: (event) => {\n if ('ts' in event) {\n inner.record(event)\n return\n }\n inner.record({ ...event, ts: Date.now() })\n },\n start_span: (name, meta) => inner.start_span(name, stamp_ts(meta)),\n end_span: (id, meta) => {\n inner.end_span(id, stamp_ts(meta))\n },\n }\n}\n\nexport type CostEventSource = 'engine_derived' | 'provider_reported'\n\n/**\n * Record a per-step cost breakdown, tagged with whether the engine derived it\n * from pricing tables or the provider reported it directly.\n */\nexport function record_cost(\n trajectory: TrajectoryLogger | undefined,\n step_index: number,\n cost: CostBreakdown,\n source: CostEventSource,\n): void {\n if (trajectory === undefined) return\n const event: Record<string, unknown> = {\n kind: 'cost',\n step_index,\n source,\n total_usd: cost.total_usd,\n input_usd: cost.input_usd,\n output_usd: cost.output_usd,\n }\n if (cost.cached_input_usd !== undefined) event['cached_input_usd'] = cost.cached_input_usd\n if (cost.cache_write_usd !== undefined) event['cache_write_usd'] = cost.cache_write_usd\n if (cost.reasoning_usd !== undefined) event['reasoning_usd'] = cost.reasoning_usd\n trajectory.record({ kind: 'cost', ...event })\n}\n\n/**\n * Deduplication helper for `pricing_missing`. The event fires at most once\n * per generate call per {provider, model_id}. Callers thread a single\n * instance through the per-call orchestration.\n */\nexport type PricingMissingDedup = {\n emit: (provider: string, model_id: string) => void\n}\n\n/**\n * Build the per-call dedup that emits `pricing_missing` once per model.\n */\nexport function create_pricing_missing_dedup(\n trajectory: TrajectoryLogger | undefined,\n): PricingMissingDedup {\n const seen = new Set<string>()\n return {\n emit(provider: string, model_id: string): void {\n if (trajectory === undefined) return\n const key = `${provider}:${model_id}`\n if (seen.has(key)) return\n seen.add(key)\n trajectory.record({ kind: 'pricing_missing', provider, model_id })\n },\n }\n}\n\n/**\n * Record that a requested reasoning-effort setting was ignored because the\n * model does not support it.\n */\nexport function record_effort_ignored(\n trajectory: TrajectoryLogger | undefined,\n model_id: string,\n): void {\n if (trajectory === undefined) return\n trajectory.record({ kind: 'effort_ignored', model_id })\n}\n\nexport type SchemaValidationFailedAttempt = 'initial' | 'repair'\n\nexport type SchemaValidationFailedEvent = {\n attempt: SchemaValidationFailedAttempt\n schema_issues: string\n raw_text: string\n}\n\n/**\n * Emit a structured event when a schema-driven generate call returns text\n * that fails parse + schema validation. Persists the raw model output and a\n * formatted schema issues summary to the trajectory so the failure is\n * debuggable without needing stdout.\n */\nexport function record_schema_validation_failed(\n trajectory: TrajectoryLogger | undefined,\n meta: SchemaValidationFailedEvent,\n): void {\n if (trajectory === undefined) return\n trajectory.record({\n kind: 'schema_validation_failed',\n attempt: meta.attempt,\n schema_issues: meta.schema_issues,\n raw_text: meta.raw_text,\n })\n}\n\nexport type SalvagedCallEventEntry = {\n tool_call_id: string\n name: string\n format: 'hermes' | 'json' | 'qwen_xml'\n}\n\n/**\n * Emitted once per step whose tool calls were recovered from assistant text\n * rather than returned structurally (tool_call_repair_attempts). The per-call\n * tool_call/tool_result events still fire for each salvaged call; this event\n * answers why the step has calls the provider never emitted, and persists the\n * raw text for debugging (precedent: schema_validation_failed).\n */\nexport function record_tool_call_salvaged(\n trajectory: TrajectoryLogger | undefined,\n meta: {\n step_index: number\n calls: ReadonlyArray<SalvagedCallEventEntry>\n raw_text: string\n },\n): void {\n if (trajectory === undefined) return\n trajectory.record({\n kind: 'tool_call_salvaged',\n step_index: meta.step_index,\n calls: meta.calls,\n raw_text: meta.raw_text,\n })\n}\n\n/**\n * Emitted when max_tool_calls_per_step drops calls beyond the cap. Dropped\n * calls also get ToolCallRecords with an error, but only this event carries\n * the configured cap alongside what was kept.\n */\nexport function record_tool_calls_dropped(\n trajectory: TrajectoryLogger | undefined,\n meta: {\n step_index: number\n max_tool_calls_per_step: number\n kept: number\n dropped: ReadonlyArray<{ tool_call_id: string; name: string }>\n },\n): void {\n if (trajectory === undefined) return\n trajectory.record({\n kind: 'tool_calls_dropped',\n step_index: meta.step_index,\n max_tool_calls_per_step: meta.max_tool_calls_per_step,\n kept: meta.kept,\n dropped: meta.dropped,\n })\n}\n\nexport type ToolApprovalEventKind =\n | 'tool_approval_requested'\n | 'tool_approval_granted'\n | 'tool_approval_denied'\n\n/**\n * Record one stage of the tool-approval handshake (requested, granted, or\n * denied) for a specific tool call.\n */\nexport function record_tool_approval(\n trajectory: TrajectoryLogger | undefined,\n kind: ToolApprovalEventKind,\n meta: { tool_name: string; step_index: number; tool_call_id: string },\n): void {\n if (trajectory === undefined) return\n trajectory.record({\n kind,\n tool_name: meta.tool_name,\n step_index: meta.step_index,\n tool_call_id: meta.tool_call_id,\n })\n}\n\n/**\n * Deduplication helper for `option_ignored`. The event fires at most once per\n * generate call per option key. External adapters whose transports do not\n * honor a caller-supplied option (max_steps, tool_error_policy,\n * on_tool_approval) route the emit through this dedup.\n */\nexport type OptionIgnoredDedup = {\n emit: (option: string, provider: string) => void\n}\n\n/**\n * Build the per-call dedup that emits `option_ignored` once per option key.\n */\nexport function create_option_ignored_dedup(\n trajectory: TrajectoryLogger | undefined,\n): OptionIgnoredDedup {\n const seen = new Set<string>()\n return {\n emit(option: string, provider: string): void {\n if (trajectory === undefined) return\n if (seen.has(option)) return\n seen.add(option)\n trajectory.record({ kind: 'option_ignored', option, provider })\n },\n }\n}\n","/**\n * claude_cli adapter factory.\n *\n * Exports a `create_claude_cli_adapter(init)` factory that returns a\n * `ExternalAgentAdapter`. The factory closure-captures a per-instance\n * `spawn_runtime` (which owns its own `Set<ChildProcess>` live registry), so\n * two factory invocations produce two independent registries; no state is\n * shared at module scope.\n *\n * The returned adapter exposes exactly `{ kind: 'external', name, generate,\n * dispose, supports }`, with no `build_model`, `translate_effort`, or\n * `normalize_usage` members.\n */\n\nimport { to_json_schema, type ToolSchema } from '#schema'\nimport type {\n ResolvedModel,\n EffortLevel,\n GenerateOptions,\n GenerateResult,\n Message,\n ProviderInit,\n StepRecord,\n StreamChunk,\n Tool,\n} from '../../types.js'\nimport type {\n ProviderCapability,\n ExternalAgentAdapter,\n} from '../types.js'\nimport type {\n ClaudeCliCallOptions,\n ClaudeCliProviderConfig,\n ToolBridgeMode,\n} from './types.js'\nimport {\n build_env,\n stderr_is_auth_failure,\n validate_auth_config,\n} from './auth.js'\nimport {\n build_cli_argv,\n merge_allowed_tools,\n merge_system,\n} from './argv.js'\nimport { build_sandbox_plan } from './sandbox.js'\nimport { create_spawn_runtime } from './spawn.js'\nimport {\n create_parser_state,\n feed_chunk,\n flush_remaining,\n snapshot,\n type ParsedStream,\n} from './stream_parse.js'\nimport { build_generate_result } from './stream_result.js'\nimport {\n CLI_BINARY_DEFAULT,\n DEFAULT_STALL_TIMEOUT_MS,\n DEFAULT_STARTUP_TIMEOUT_MS,\n} from './constants.js'\nimport {\n aborted_error,\n claude_cli_error,\n engine_disposed_error,\n provider_auth_error,\n provider_capability_error,\n schema_validation_error,\n} from '../../errors.js'\nimport { format_schema_issues } from '#schema'\nimport {\n build_repair_prompt_text,\n parse_with_schema,\n} from '../../schema.js'\nimport {\n create_option_ignored_dedup,\n end_generate_span,\n end_step_span,\n record_cost,\n record_schema_validation_failed,\n start_generate_span,\n start_step_span,\n with_timestamps,\n} from '../../trajectory.js'\n\nconst SUPPORTED: ReadonlySet<ProviderCapability> = new Set<ProviderCapability>([\n 'text',\n 'tools',\n 'schema',\n 'streaming',\n 'reasoning',\n])\n\nconst PROVIDER_NAME = 'claude_cli'\n\n// Map fascicle's EffortLevel to Claude Code's CLAUDE_CODE_EFFORT_LEVEL env var.\n// The CLI supports `low | medium | high | xhigh | max | auto`; we expose all\n// non-`none` levels of fascicle's EffortLevel and let the user opt out via\n// `effort: 'none'` (which results in no env var being set, deferring to whatever\n// is already in the inherited environment).\nconst CLAUDE_CLI_EFFORT_VALUES: Record<Exclude<EffortLevel, 'none'>, string> = {\n low: 'low',\n medium: 'medium',\n high: 'high',\n xhigh: 'xhigh',\n max: 'max',\n}\n\n/**\n * Build the `CLAUDE_CODE_EFFORT_LEVEL` env var entry for a given effort\n * level.\n *\n * Returns an empty object for `undefined` or `'none'`, which leaves the\n * inherited environment (and thus the CLI's own default) untouched.\n */\nexport function effort_env_for_claude_cli(\n effort: EffortLevel | undefined,\n): Record<string, string> {\n if (effort === undefined || effort === 'none') return {}\n return { CLAUDE_CODE_EFFORT_LEVEL: CLAUDE_CLI_EFFORT_VALUES[effort] }\n}\n\n/**\n * Pull the `claude_cli`-scoped provider options out of `provider_options`.\n *\n * Returns an empty object when the caller didn't set any, so downstream\n * code can read fields without an undefined check.\n */\nexport function extract_call_opts(opts: GenerateOptions<unknown>): ClaudeCliCallOptions {\n const raw = opts.provider_options?.['claude_cli']\n if (raw === undefined || raw === null || typeof raw !== 'object') {\n return {}\n }\n return raw\n}\n\n/**\n * Count how many `user` messages are in the prompt.\n *\n * A plain string prompt counts as a single user message.\n */\nexport function count_user_messages(prompt: string | Message[]): number {\n if (typeof prompt === 'string') return 1\n let count = 0\n for (const m of prompt) {\n if (m.role === 'user') count += 1\n }\n return count\n}\n\n/**\n * Extract the first user message's text to send as CLI stdin.\n *\n * `generate` rejects prompts with more than one user message (claude_cli\n * only supports a single turn per invocation), so only the first one is\n * ever relevant here.\n */\nexport function extract_prompt_text(prompt: string | Message[]): string {\n if (typeof prompt === 'string') return prompt\n for (const m of prompt) {\n if (m.role !== 'user') continue\n if (typeof m.content === 'string') return m.content\n const parts: string[] = []\n for (const p of m.content) {\n if (p.type === 'text') parts.push(p.text)\n }\n return parts.join('\\n')\n }\n return ''\n}\n\n/**\n * Pull the system message content out of a `Message[]` prompt.\n *\n * Returns `undefined` for a plain string prompt or when no system message\n * is present.\n */\nexport function extract_system_text(prompt: string | Message[]): string | undefined {\n if (typeof prompt === 'string') return undefined\n for (const m of prompt) {\n if (m.role === 'system') return m.content\n }\n return undefined\n}\n\n/**\n * Serialize a schema to the JSON Schema string the CLI's `--json-schema`\n * flag expects.\n *\n * `strip_meta` is what makes this CLI-specific: `claude --json-schema`\n * rejects a top-level `$schema`/`$id`, which every other provider tolerates.\n */\nexport function compile_schema<T>(schema: ToolSchema<T>): string {\n return JSON.stringify(to_json_schema(schema, { strip_meta: true }))\n}\n\n/**\n * Turn a closed CLI subprocess's exit code, signal, and stderr into an\n * `Error`.\n *\n * Checks stderr for an auth failure first, then for a missing sandbox\n * binary, then falls back to a generic exit-code error. The stderr\n * snippet attached to each error is truncated to 512 bytes.\n */\nexport function classify_close_error(\n code: number | null,\n signal: NodeJS.Signals | null,\n stderr: string,\n): Error {\n const snippet = stderr.slice(0, 512)\n if (stderr_is_auth_failure(stderr)) {\n return new provider_auth_error(\n PROVIDER_NAME,\n `claude CLI reported an auth failure: ${snippet}`,\n { refresh_command: 'claude login' },\n )\n }\n if (/bwrap|greywall|sandbox/i.test(stderr) && /not found|no such file|enoent/i.test(stderr)) {\n return new claude_cli_error('sandbox_unavailable', `sandbox binary unavailable: ${snippet}`, {\n stderr_snippet: snippet,\n })\n }\n const status = typeof code === 'number' ? code : undefined\n const signal_part = signal !== null ? ` (signal ${signal})` : ''\n const message = `claude CLI exited with code ${String(code)}${signal_part}: ${snippet}`\n const metadata: { status?: number; stderr_snippet?: string } = {\n stderr_snippet: snippet,\n }\n if (status !== undefined) metadata.status = status\n return new claude_cli_error('subprocess_exit', message, metadata)\n}\n\ntype RunArgs = {\n readonly model_id: string\n readonly stdin_text: string\n readonly merged_system: string\n readonly merged_allowed_tools: ReadonlyArray<string>\n readonly call_opts: ClaudeCliCallOptions\n readonly compiled_schema: string | undefined\n readonly env: Record<string, string>\n readonly spawn_cmd: string\n readonly prefix_args: ReadonlyArray<string>\n readonly cwd: string | undefined\n readonly startup_timeout_ms: number\n readonly stall_timeout_ms: number\n readonly abort: AbortSignal | undefined\n readonly dispatch_chunk:\n | ((chunk: StreamChunk) => Promise<void>)\n | undefined\n readonly trajectory: GenerateOptions<unknown>['trajectory']\n}\n\ntype RunOutcome = {\n readonly parsed: ReturnType<typeof snapshot>\n readonly chunks: StreamChunk[]\n}\n\n/**\n * Spawn one claude CLI invocation, stream its stdout into parsed events,\n * and wait for it to close.\n *\n * Runs `session.wait_close()` and the stdout-consuming loop concurrently:\n * the process can still be flushing stdout while it exits, so waiting for\n * close first would drop those trailing lines. Throws if the process\n * exits non-zero or closes without ever emitting a terminal `result`\n * event.\n */\nasync function run_cli(\n spawn_runtime: ReturnType<typeof create_spawn_runtime>,\n args: RunArgs,\n): Promise<RunOutcome> {\n const argv = build_cli_argv({\n model_id: args.model_id,\n provider_config: {},\n call_opts: args.call_opts,\n merged_allowed_tools: args.merged_allowed_tools,\n merged_system: args.merged_system,\n ...(args.compiled_schema !== undefined ? { compiled_schema: args.compiled_schema } : {}),\n })\n const full_argv: string[] = [...args.prefix_args, ...argv]\n\n const spawn_args: Parameters<typeof spawn_runtime.spawn_cli>[0] = {\n cmd: args.spawn_cmd,\n argv: full_argv,\n env: args.env,\n stdin: args.stdin_text,\n startup_timeout_ms: args.startup_timeout_ms,\n stall_timeout_ms: args.stall_timeout_ms,\n }\n if (args.cwd !== undefined) {\n (spawn_args as { cwd?: string }).cwd = args.cwd\n }\n if (args.abort !== undefined) {\n (spawn_args as { abort?: AbortSignal }).abort = args.abort\n }\n\n const session = await spawn_runtime.spawn_cli(spawn_args)\n\n const state = create_parser_state()\n const chunks: StreamChunk[] = []\n\n const consume = (async (): Promise<void> => {\n for await (const line of session.stdout_lines) {\n await feed_chunk(state, `${line}\\n`, chunks, args.dispatch_chunk, args.trajectory)\n }\n await flush_remaining(state, chunks, args.dispatch_chunk, args.trajectory)\n })()\n\n let close_outcome: Awaited<ReturnType<typeof session.wait_close>>\n try {\n [close_outcome] = await Promise.all([session.wait_close(), consume])\n } catch (err: unknown) {\n try {\n await consume\n } catch {\n // ignore secondary consume errors\n }\n throw err\n }\n\n const parsed = snapshot(state)\n\n if (close_outcome.code !== 0) {\n throw classify_close_error(close_outcome.code, close_outcome.signal, close_outcome.stderr)\n }\n if (!parsed.received_result) {\n throw new claude_cli_error(\n 'no_result_event',\n 'claude CLI closed without emitting a terminal result event',\n { stderr_snippet: close_outcome.stderr.slice(0, 512) },\n )\n }\n\n return { parsed, chunks }\n}\n\n/** Span ids one generate call holds open; `first_step` is cleared once closed. */\ntype GenerateSpans = {\n generate: string | undefined\n first_step: string | undefined\n}\n\n/**\n * Emit `option_ignored` events for the loop-control options this provider\n * cannot honor: the CLI runs its own tool loop on the far side of the\n * subprocess boundary.\n */\nfunction emit_ignored_options<T>(\n opts: GenerateOptions<T>,\n trajectory: RunArgs['trajectory'],\n): void {\n const option_ignored = create_option_ignored_dedup(trajectory)\n if (opts.max_steps !== undefined) {\n option_ignored.emit('max_steps', PROVIDER_NAME)\n }\n if (opts.tool_error_policy !== undefined) {\n option_ignored.emit('tool_error_policy', PROVIDER_NAME)\n }\n if (opts.on_tool_approval !== undefined) {\n option_ignored.emit('on_tool_approval', PROVIDER_NAME)\n }\n if (opts.tool_call_repair_attempts !== undefined) {\n option_ignored.emit('tool_call_repair_attempts', PROVIDER_NAME)\n }\n if (opts.max_tool_calls_per_step !== undefined) {\n option_ignored.emit('max_tool_calls_per_step', PROVIDER_NAME)\n }\n}\n\n/**\n * Reject requests the CLI cannot express: multi-turn user history (one user\n * turn per invocation; continuation goes through `session_id`), and\n * executable tools under `tool_bridge: 'forbid'`.\n */\nfunction validate_request(\n prompt: string | Message[],\n tools_list: ReadonlyArray<Tool>,\n tool_bridge: ToolBridgeMode,\n): void {\n if (count_user_messages(prompt) >= 2) {\n throw new provider_capability_error(\n PROVIDER_NAME,\n 'multi_turn_history',\n 'use provider_options.claude_cli.session_id instead',\n )\n }\n if (tools_list.length > 0 && tool_bridge === 'forbid') {\n const has_execute = tools_list.some((t) => typeof t.execute === 'function')\n if (has_execute) {\n throw new provider_capability_error(\n PROVIDER_NAME,\n 'tool_execute',\n 'tool_bridge is forbid; tools with execute closures cannot run under claude_cli',\n )\n }\n }\n}\n\n/**\n * Record which executable tools the allowlist-only bridge is dropping:\n * their names still pass through `--allowedTools`, but their execute\n * closures cannot run on this side of the subprocess boundary.\n */\nfunction record_allowlist_only_drop(\n tools_list: ReadonlyArray<Tool>,\n tool_bridge: ToolBridgeMode,\n trajectory: RunArgs['trajectory'],\n): void {\n if (tools_list.length === 0 || tool_bridge !== 'allowlist_only' || trajectory === undefined) {\n return\n }\n const dropped = tools_list\n .filter((t) => typeof t.execute === 'function')\n .map((t) => t.name)\n trajectory.record({\n kind: 'cli_tool_bridge_allowlist_only',\n dropped,\n })\n}\n\n/**\n * Choose the JSON Schema string for `--json-schema`: a typed `opts.schema`\n * compiles and wins; otherwise a raw `output_json_schema` string passes\n * through verbatim.\n */\nfunction resolve_compiled_schema<T>(\n opts: GenerateOptions<T>,\n call_opts: ClaudeCliCallOptions,\n): string | undefined {\n if (opts.schema !== undefined) return compile_schema(opts.schema)\n if (\n typeof call_opts.output_json_schema === 'string' &&\n call_opts.output_json_schema.length > 0\n ) {\n return call_opts.output_json_schema\n }\n return undefined\n}\n\n/**\n * Wrap `opts.on_chunk` so sync and async callbacks dispatch the same way: a\n * returned thenable is awaited, any other return is fire-and-done. Returns\n * `undefined` when the caller isn't streaming, which downstream code uses\n * as the streaming flag.\n */\nfunction make_dispatch_chunk<T>(\n opts: GenerateOptions<T>,\n): ((chunk: StreamChunk) => Promise<void>) | undefined {\n if (opts.on_chunk === undefined) return undefined\n return async (chunk: StreamChunk): Promise<void> => {\n const maybe = opts.on_chunk?.(chunk)\n if (maybe !== undefined && typeof maybe.then === 'function') {\n await maybe\n }\n }\n}\n\n/**\n * Create this call's AbortController, register it in the adapter's\n * in-flight set (`dispose()` aborts everything still registered), and\n * forward the caller's abort signal into it, including one already aborted.\n * `unlink` undoes both and must run however generate settles, or the\n * registry would pin settled calls alive.\n */\nfunction link_caller_abort(\n in_flight: Set<AbortController>,\n caller_abort: AbortSignal | undefined,\n): { controller: AbortController; unlink: () => void } {\n const controller = new AbortController()\n in_flight.add(controller)\n const on_caller_abort = (): void => {\n controller.abort(caller_abort?.reason)\n }\n if (caller_abort !== undefined) {\n if (caller_abort.aborted) controller.abort(caller_abort.reason)\n else caller_abort.addEventListener('abort', on_caller_abort, { once: true })\n }\n return {\n controller,\n unlink: (): void => {\n if (caller_abort !== undefined) {\n caller_abort.removeEventListener('abort', on_caller_abort)\n }\n in_flight.delete(controller)\n },\n }\n}\n\n/**\n * Open the generate span and the first step span before the CLI spawns, so\n * their timing brackets the whole subprocess run.\n */\nfunction open_spans<T>(\n trajectory: RunArgs['trajectory'],\n opts: GenerateOptions<T>,\n resolved: ResolvedModel,\n has_tools: boolean,\n streaming: boolean,\n): GenerateSpans {\n return {\n generate: start_generate_span(trajectory, {\n model: opts.model ?? resolved.model_id,\n provider: PROVIDER_NAME,\n model_id: resolved.model_id,\n has_tools,\n has_schema: opts.schema !== undefined,\n streaming,\n }),\n first_step: start_step_span(trajectory, 0),\n }\n}\n\n/**\n * Failure message for schema validation that exhausted its repair budget.\n * Zero names the opt-out explicitly so \"repair disabled\" reads differently\n * from \"repairs tried and failed\".\n */\nfunction repair_exhausted_message(max_repairs: number): string {\n if (max_repairs === 0) {\n return 'schema validation failed and repair is disabled (schema_repair_attempts: 0)'\n }\n return `schema validation failed after ${String(max_repairs)} repair attempt${max_repairs === 1 ? '' : 's'}`\n}\n\n/**\n * Validate the CLI's final text against `schema`, re-invoking the CLI with\n * a repair prompt on failure, up to `max_repairs` times.\n *\n * Each repair resumes the previous attempt's `session_id`, so a snapshot\n * without one makes validation failure terminal immediately. The returned\n * snapshot is the one the repair loop settled on; the result must be built\n * from it, not from the first attempt's.\n */\nasync function parse_schema_with_repair<T>(\n spawn_runtime: ReturnType<typeof create_spawn_runtime>,\n base_args: RunArgs,\n schema: ToolSchema<T>,\n max_repairs: number,\n first_parsed: ParsedStream,\n trajectory: RunArgs['trajectory'],\n): Promise<{ parsed: ParsedStream; parsed_content: T }> {\n let parsed = first_parsed\n let repairs_done = 0\n for (;;) {\n const attempt = await parse_with_schema(schema, parsed.final_text)\n if (attempt.ok) {\n return { parsed, parsed_content: attempt.value }\n }\n record_schema_validation_failed(trajectory, {\n attempt: repairs_done === 0 ? 'initial' : 'repair',\n schema_issues: format_schema_issues(attempt.issues),\n raw_text: parsed.final_text,\n })\n if (repairs_done >= max_repairs) {\n throw new schema_validation_error(\n repair_exhausted_message(max_repairs),\n attempt.issues,\n parsed.final_text,\n )\n }\n const repair_session_id = parsed.session_id\n if (repair_session_id === undefined) {\n throw new schema_validation_error(\n 'schema validation failed and no session_id available for repair',\n attempt.issues,\n parsed.final_text,\n )\n }\n const repair_outcome = await run_cli(spawn_runtime, {\n ...base_args,\n stdin_text: build_repair_prompt_text(attempt.issues),\n call_opts: { ...base_args.call_opts, session_id: repair_session_id },\n })\n parsed = repair_outcome.parsed\n repairs_done += 1\n }\n}\n\n/**\n * Resolve the call's final parse snapshot and validated content. Without a\n * schema the first snapshot is final and content stays undefined; with one,\n * the repair loop takes over.\n */\nasync function resolve_content<T>(\n spawn_runtime: ReturnType<typeof create_spawn_runtime>,\n base_args: RunArgs,\n opts: GenerateOptions<T>,\n first_parsed: ParsedStream,\n): Promise<{ parsed: ParsedStream; parsed_content: T | undefined }> {\n if (opts.schema === undefined) {\n return { parsed: first_parsed, parsed_content: undefined }\n }\n return parse_schema_with_repair(\n spawn_runtime,\n base_args,\n opts.schema,\n opts.schema_repair_attempts ?? 1,\n first_parsed,\n base_args.trajectory,\n )\n}\n\n/**\n * Assemble the `build_generate_result` input, attaching the schema and its\n * validated value only when structured output was requested.\n */\nfunction assemble_result<T>(\n parsed: ParsedStream,\n resolved: ResolvedModel,\n schema: ToolSchema<T> | undefined,\n parsed_content: T | undefined,\n): GenerateResult<T> {\n return build_generate_result<T>({\n parsed,\n resolved,\n ...(schema !== undefined ? { schema } : {}),\n ...(parsed_content !== undefined ? { parsed_content } : {}),\n })\n}\n\n/**\n * Forward the CLI's per-turn provider-reported costs into the trajectory.\n */\nfunction record_provider_costs(\n trajectory: RunArgs['trajectory'],\n steps: ReadonlyArray<StepRecord>,\n): void {\n for (const step of steps) {\n if (step.cost !== undefined) {\n record_cost(trajectory, step.index, step.cost, 'provider_reported')\n }\n }\n}\n\n/**\n * Close the eagerly-opened first step span against the steps the CLI\n * reported, then emit paired open/close spans for steps 1..n; those arrive\n * all at once on process close, so their spans carry usage, not timing.\n * Clears `spans.first_step` so the error path cannot close it twice.\n */\nfunction close_step_spans(\n trajectory: RunArgs['trajectory'],\n spans: GenerateSpans,\n steps: ReadonlyArray<StepRecord>,\n): void {\n if (steps.length === 0) {\n end_step_span(trajectory, spans.first_step, {})\n spans.first_step = undefined\n return\n }\n const head = steps[0]\n if (head !== undefined) {\n end_step_span(trajectory, spans.first_step, {\n usage: head.usage,\n finish_reason: head.finish_reason,\n })\n }\n spans.first_step = undefined\n for (let i = 1; i < steps.length; i += 1) {\n const s = steps[i]\n if (s === undefined) continue\n const id = start_step_span(trajectory, i)\n end_step_span(trajectory, id, {\n usage: s.usage,\n finish_reason: s.finish_reason,\n })\n }\n}\n\n/**\n * Emit the terminal `finish` chunk streaming callers expect; the CLI stream\n * has no equivalent event, so it is synthesized from the final result.\n */\nasync function dispatch_finish<T>(\n dispatch_chunk: ((chunk: StreamChunk) => Promise<void>) | undefined,\n result: GenerateResult<T>,\n): Promise<void> {\n if (dispatch_chunk === undefined) return\n await dispatch_chunk({\n kind: 'finish',\n finish_reason: result.finish_reason,\n usage: result.usage,\n })\n}\n\n/**\n * Close whatever spans are still open with the failure message. A failure\n * after the step spans already closed (e.g. in the finish-chunk dispatch)\n * closes only the generate span.\n */\nfunction close_spans_on_error(\n trajectory: RunArgs['trajectory'],\n spans: GenerateSpans,\n err: unknown,\n): void {\n const message = err instanceof Error ? err.message : String(err)\n if (spans.first_step !== undefined) {\n end_step_span(trajectory, spans.first_step, { error: message })\n spans.first_step = undefined\n }\n end_generate_span(trajectory, spans.generate, { error: message })\n}\n\n/**\n * Build a claude_cli `ExternalAgentAdapter` bound to one config.\n *\n * Validates the auth config eagerly, before any call is made, and wires up\n * a spawn runtime plus an in-flight abort-controller registry that\n * `dispose()` uses to cancel every call still running.\n */\nexport function create_claude_cli_adapter(init: ProviderInit): ExternalAgentAdapter {\n const config = init as ClaudeCliProviderConfig\n validate_auth_config(config)\n\n const spawn_runtime = create_spawn_runtime()\n let disposed = false\n const in_flight: Set<AbortController> = new Set()\n\n const resolved_binary = typeof config.binary === 'string' && config.binary.length > 0\n ? config.binary\n : CLI_BINARY_DEFAULT\n const resolved_auth_mode = config.auth_mode ?? 'auto'\n const resolved_startup_timeout = config.startup_timeout_ms ?? DEFAULT_STARTUP_TIMEOUT_MS\n const resolved_stall_timeout = config.stall_timeout_ms ?? DEFAULT_STALL_TIMEOUT_MS\n\n const adapter: ExternalAgentAdapter = {\n kind: 'external',\n name: PROVIDER_NAME,\n supports: (capability) => SUPPORTED.has(capability),\n async generate<T>(\n opts: GenerateOptions<T>,\n resolved: ResolvedModel,\n ): Promise<GenerateResult<T>> {\n if (disposed) throw new engine_disposed_error()\n if (opts.abort?.aborted === true) {\n throw new aborted_error('aborted', { reason: opts.abort.reason })\n }\n\n // Stamp timestamps on this subprocess provider's trajectory events\n // too, matching the ai_sdk path: the external branch in generate.ts\n // returns before the main path's with_timestamps wrap runs, so it\n // has to happen here instead.\n const trajectory = with_timestamps(opts.trajectory)\n const call_opts = extract_call_opts(opts)\n emit_ignored_options(opts, trajectory)\n\n const tools_list: ReadonlyArray<Tool> = opts.tools ?? []\n const tool_bridge: ToolBridgeMode = call_opts.tool_bridge ?? 'allowlist_only'\n validate_request(opts.prompt, tools_list, tool_bridge)\n\n const merged_allowed_tools = merge_allowed_tools(\n call_opts.allowed_tools,\n tools_list.map((t) => t.name),\n )\n record_allowlist_only_drop(tools_list, tool_bridge, trajectory)\n\n const merged_system = merge_system(\n opts.system ?? extract_system_text(opts.prompt),\n call_opts.append_system_prompt,\n )\n const env = build_env(config, call_opts.env, resolved_auth_mode)\n Object.assign(env, effort_env_for_claude_cli(opts.effort))\n const sandbox_plan = build_sandbox_plan(resolved_binary, config.sandbox)\n const dispatch_chunk = make_dispatch_chunk(opts)\n\n const { controller, unlink } = link_caller_abort(in_flight, opts.abort)\n const spans = open_spans(\n trajectory,\n opts,\n resolved,\n tools_list.length > 0,\n dispatch_chunk !== undefined,\n )\n\n const base_args: RunArgs = {\n model_id: resolved.model_id,\n stdin_text: extract_prompt_text(opts.prompt),\n merged_system,\n merged_allowed_tools,\n call_opts,\n compiled_schema: resolve_compiled_schema(opts, call_opts),\n env,\n spawn_cmd: sandbox_plan.spawn_cmd,\n prefix_args: sandbox_plan.prefix_args,\n cwd: config.default_cwd,\n startup_timeout_ms: resolved_startup_timeout,\n stall_timeout_ms: resolved_stall_timeout,\n abort: controller.signal,\n dispatch_chunk,\n trajectory,\n }\n\n try {\n const first_outcome = await run_cli(spawn_runtime, base_args)\n const { parsed, parsed_content } = await resolve_content(\n spawn_runtime,\n base_args,\n opts,\n first_outcome.parsed,\n )\n\n const result = assemble_result<T>(parsed, resolved, opts.schema, parsed_content)\n record_provider_costs(trajectory, result.steps)\n close_step_spans(trajectory, spans, result.steps)\n end_generate_span(trajectory, spans.generate, {\n usage: result.usage,\n finish_reason: result.finish_reason,\n model_resolved: result.model_resolved,\n })\n await dispatch_finish(dispatch_chunk, result)\n\n return result\n } catch (err: unknown) {\n close_spans_on_error(trajectory, spans, err)\n throw err\n } finally {\n unlink()\n }\n },\n async dispose(): Promise<void> {\n if (disposed) return\n disposed = true\n for (const controller of in_flight) {\n controller.abort('engine_disposed')\n }\n await spawn_runtime.dispose_all()\n },\n }\n\n return adapter\n}\n","/**\n * Provider name → adapter factory lookup for the built-in set.\n *\n * Unknown provider names throw provider_not_configured_error. Custom\n * providers enter via `EngineConfig.custom_providers` at construction,\n * resolved custom-first in create_engine; there is no runtime\n * (post-construction) registration.\n */\n\nimport { provider_not_configured_error } from '../errors.js'\nimport type { ProviderFactory } from './types.js'\nimport { create_anthropic_adapter } from './anthropic.js'\nimport { create_openai_adapter } from './openai.js'\nimport { create_google_adapter } from './google.js'\nimport { create_ollama_adapter } from './ollama.js'\nimport { create_lmstudio_adapter } from './lmstudio.js'\nimport { create_openrouter_adapter } from './openrouter.js'\nimport { create_bedrock_adapter } from './bedrock.js'\nimport { create_claude_cli_adapter } from './claude_cli/index.js'\n\nconst BUILTIN_PROVIDERS: ReadonlyMap<string, ProviderFactory> = new Map<string, ProviderFactory>([\n ['anthropic', create_anthropic_adapter],\n ['openai', create_openai_adapter],\n ['google', create_google_adapter],\n ['ollama', create_ollama_adapter],\n ['lmstudio', create_lmstudio_adapter],\n ['openrouter', create_openrouter_adapter],\n ['bedrock', create_bedrock_adapter],\n ['claude_cli', create_claude_cli_adapter],\n])\n\n/**\n * List the names of every built-in provider, in registration order.\n */\nexport function list_builtin_providers(): ReadonlyArray<string> {\n return [...BUILTIN_PROVIDERS.keys()]\n}\n\n/**\n * Look up a built-in provider's adapter factory by name, throwing\n * provider_not_configured_error for unknown names.\n */\nexport function get_provider_factory(name: string): ProviderFactory {\n const factory = BUILTIN_PROVIDERS.get(name)\n if (factory === undefined) throw new provider_not_configured_error(name)\n return factory\n}\n","/**\n * Default-merging helpers for engine-level `EngineDefaults`.\n */\n\n/**\n * Merge per-call `provider_options` over engine-level defaults.\n *\n * Scalar fields merge inline at the call site via `opts.x ?? defaults.x`, but\n * `provider_options` needs a two-level merge: outer keys are provider names\n * (`claude_cli`, `anthropic`, ...) and inner records hold per-provider\n * settings. Per-call inner keys override the matching default's inner keys;\n * provider keys unique to either side fall through unchanged. There is no\n * recursion past that second level, so deeper structures replace wholesale\n * rather than merging further.\n */\nexport function merge_provider_options(\n defaults: Readonly<Record<string, Readonly<Record<string, unknown>>>> | undefined,\n call: Record<string, unknown> | undefined,\n): Record<string, unknown> | undefined {\n if (defaults === undefined && call === undefined) return undefined\n if (defaults === undefined) return call\n if (call === undefined) {\n const out: Record<string, unknown> = {}\n for (const [provider, inner] of Object.entries(defaults)) {\n out[provider] = { ...inner }\n }\n return out\n }\n const out: Record<string, unknown> = {}\n for (const [provider, inner] of Object.entries(defaults)) {\n out[provider] = { ...inner }\n }\n for (const [provider, inner] of Object.entries(call)) {\n const existing = out[provider]\n if (is_plain_object(existing) && is_plain_object(inner)) {\n // Both sides are plain per-provider option records: merge their keys,\n // with the call's values winning on conflicts.\n out[provider] = { ...existing, ...inner }\n } else {\n // No default for this provider, or a non-object value on either side:\n // the call's value replaces the default wholesale.\n out[provider] = inner\n }\n }\n return out\n}\n\n/**\n * Narrow `value` to a plain (non-null, non-array) object.\n */\nfunction is_plain_object(value: unknown): value is Record<string, unknown> {\n return value !== null && typeof value === 'object' && !Array.isArray(value)\n}\n","/**\n * Streaming chunk normalization and dispatch.\n *\n * Provider events are normalized into the discriminated `StreamChunk` union.\n * The dispatcher synchronously invokes on_chunk per provider event; on throw\n * or rejected promise it signals the caller to abort the in-flight request\n * (the request-abort itself is wired up in the generate orchestrator) and\n * surfaces on_chunk_error.\n *\n * Chunk ordering invariants (enforced by the orchestrator that feeds the\n * dispatcher, not here):\n * - text and reasoning interleave within a step.\n * - tool_call_start precedes its input_deltas and end.\n * - tool_result follows the matching tool_call_end.\n * - step_finish is the last STREAMED chunk of a step, but tool execution and\n * tool_result chunks are dispatched by the tool loop after it, so a step's\n * tool_result chunks (and, for a salvaged step, the synthetic\n * tool_call_start/tool_call_end that precede them) follow its step_finish.\n * A salvaged step's StepRecord also reports finish_reason 'tool_calls'\n * while its already-dispatched step_finish carries the provider's 'stop'.\n * - finish is the last chunk of the call.\n */\n\nimport type { FinishReason, StreamChunk, UsageTotals } from './types.js'\nimport { on_chunk_error } from './errors.js'\n\nexport type RawProviderStreamEvent =\n | { type: 'text-delta'; id?: string; delta: string }\n | { type: 'reasoning-delta'; id?: string; delta: string }\n | { type: 'tool-input-start'; id: string; tool_name: string }\n | { type: 'tool-input-delta'; id: string; delta: string }\n | { type: 'tool-input-end'; id: string; input: unknown }\n | { type: 'tool-result'; id: string; output?: unknown; error?: { message: string } }\n | { type: 'finish-step'; finish_reason: FinishReason; usage: UsageTotals }\n | { type: 'finish'; finish_reason: FinishReason; usage: UsageTotals }\n\n/**\n * Normalize a single AI SDK v6 stream event into a StreamChunk with the\n * supplied step_index. Unknown event types return undefined (caller drops).\n */\nexport function normalize_chunk(\n event: RawProviderStreamEvent,\n step_index: number,\n): StreamChunk | undefined {\n switch (event.type) {\n case 'text-delta':\n return { kind: 'text', text: event.delta, step_index }\n case 'reasoning-delta':\n return { kind: 'reasoning', text: event.delta, step_index }\n case 'tool-input-start':\n return { kind: 'tool_call_start', id: event.id, name: event.tool_name, step_index }\n case 'tool-input-delta':\n return { kind: 'tool_call_input_delta', id: event.id, delta: event.delta, step_index }\n case 'tool-input-end':\n return { kind: 'tool_call_end', id: event.id, input: event.input, step_index }\n case 'tool-result': {\n const chunk: StreamChunk = { kind: 'tool_result', id: event.id, step_index }\n if (event.output !== undefined) chunk.output = event.output\n if (event.error !== undefined) chunk.error = event.error\n return chunk\n }\n case 'finish-step':\n return {\n kind: 'step_finish',\n step_index,\n finish_reason: event.finish_reason,\n usage: event.usage,\n }\n case 'finish':\n return { kind: 'finish', finish_reason: event.finish_reason, usage: event.usage }\n default:\n return undefined\n }\n}\n\nexport type ChunkDispatcher = {\n readonly dispatch: (chunk: StreamChunk) => Promise<void>\n readonly aborted: () => boolean\n}\n\n/**\n * Build a dispatcher around a user-supplied on_chunk. Catches sync throws and\n * rejected promises; once an error is recorded subsequent dispatch calls are\n * no-ops and `aborted()` returns true so the orchestrator can short-circuit\n * the in-flight provider request. The first error is re-thrown from the first\n * failing dispatch() call, wrapped in on_chunk_error.\n */\nexport function create_chunk_dispatcher(\n on_chunk: ((chunk: StreamChunk) => void | Promise<void>) | undefined,\n): ChunkDispatcher {\n let failed = false\n return {\n aborted: () => failed,\n async dispatch(chunk: StreamChunk): Promise<void> {\n if (on_chunk === undefined || failed) return\n try {\n const maybe = on_chunk(chunk)\n if (maybe !== undefined && typeof maybe.then === 'function') {\n await maybe\n }\n } catch (err: unknown) {\n failed = true\n throw new on_chunk_error('on_chunk callback failed', err)\n }\n },\n }\n}\n","/**\n * Usage aggregation across a generate call's steps.\n */\n\nimport type { StepRecord, UsageTotals } from './types.js'\n\ntype OptionalFieldKey =\n | 'reasoning_tokens'\n | 'cached_input_tokens'\n | 'cache_write_tokens'\n\nconst OPTIONAL_FIELDS: ReadonlyArray<OptionalFieldKey> = [\n 'reasoning_tokens',\n 'cached_input_tokens',\n 'cache_write_tokens',\n]\n\n/**\n * Sum token usage across every step of a generate call.\n *\n * `input_tokens` and `output_tokens` always total. The optional fields\n * (`reasoning_tokens`, `cached_input_tokens`, `cache_write_tokens`) stay\n * absent on the result unless at least one step reported them; once\n * present, every step contributes to the sum, with steps that omit the\n * field counting as 0.\n */\nexport function sum_usage(steps: ReadonlyArray<StepRecord>): UsageTotals {\n let input_tokens = 0\n let output_tokens = 0\n const present: Record<OptionalFieldKey, boolean> = {\n reasoning_tokens: false,\n cached_input_tokens: false,\n cache_write_tokens: false,\n }\n const sums: Record<OptionalFieldKey, number> = {\n reasoning_tokens: 0,\n cached_input_tokens: 0,\n cache_write_tokens: 0,\n }\n for (const step of steps) {\n input_tokens += step.usage.input_tokens\n output_tokens += step.usage.output_tokens\n for (const key of OPTIONAL_FIELDS) {\n const value = step.usage[key]\n if (value !== undefined) {\n present[key] = true\n sums[key] += value\n }\n }\n }\n\n const total: UsageTotals = { input_tokens, output_tokens }\n for (const key of OPTIONAL_FIELDS) {\n if (present[key]) total[key] = sums[key]\n }\n return total\n}\n","/**\n * Salvage tool calls that a model emitted as assistant TEXT instead of a\n * structured tool_calls array. Local runtimes (Ollama native API, LM Studio\n * /v1) frequently mis-serialize tool definitions in the chat template, so the\n * model writes its call into the content in one of three well-known formats:\n *\n * hermes <tool_call>{\"name\":\"x\",\"arguments\":{...}}</tool_call>\n * json {\"name\":\"x\",\"arguments\":{...}} bare or ```json-fenced\n * qwen_xml <tool_call><function=x><parameter=k>v</parameter></function></tool_call>\n *\n * A candidate is accepted ONLY when its name resolves in the call's tool\n * registry AND its arguments validate against that tool's input_schema.\n * That double gate is the guard against a false positive on an ordinary\n * answer that merely contains JSON.\n *\n * Parsing rules that matter for correctness:\n * - Every <tool_call> block extent, accepted or rejected, is masked so the\n * bare-JSON pass never re-matches a payload inside it (a hermes block\n * contains a shape-valid bare object; double-matching would double-strip).\n * - All code fences are masked from the bare pass for the same reason;\n * only fences with no info string or `json` are parsed as candidates.\n * - A complete bare object that is not a call is skipped whole: descending\n * into it could false-positive on substructures of ordinary JSON output.\n * - An unterminated <tool_call> is ignored (finish_reason 'length'\n * truncation); its text is left intact.\n * - Qwen XML parameter values that contain a literal </parameter> mis-parse\n * under the non-greedy matcher; accepted limitation.\n *\n * Never throws; returns undefined when zero candidates survive validation.\n */\n\nimport { validate_schema } from '#schema'\nimport type { SalvageFormat, Tool } from './types.js'\n\nexport type SalvagedCall = {\n readonly name: string\n readonly input: unknown\n readonly format: SalvageFormat\n readonly span: { readonly start: number; readonly end: number }\n}\n\nexport type SalvageOutcome = {\n readonly calls: ReadonlyArray<SalvagedCall>\n readonly stripped_text: string\n}\n\ntype Span = { readonly start: number; readonly end: number }\n\ntype Candidate = {\n readonly name: string\n readonly args: Record<string, unknown>\n readonly format: SalvageFormat\n readonly span: Span\n}\n\nconst TOOL_CALL_OPEN = '<tool_call>'\nconst TOOL_CALL_CLOSE = '</tool_call>'\nconst FUNCTION_RE = /<function=([^>\\s]+)>([\\s\\S]*?)<\\/function>/g\nconst PARAMETER_RE = /<parameter=([^>\\s]+)>([\\s\\S]*?)<\\/parameter>/g\nconst FENCE_RE = /```([^\\n]*)\\n([\\s\\S]*?)```/g\nconst EMPTY_BLOCK_RE = /<tool_call>\\s*<\\/tool_call>/g\n\n/**\n * From `open` at an opening quote, return the index of the matching closing\n * quote, honoring backslash escapes. Returns `text.length` for an unterminated\n * string, so the caller's scan runs off the end and yields no object.\n */\nfunction skip_json_string(text: string, open: number): number {\n let escaped = false\n for (let i = open + 1; i < text.length; i += 1) {\n const ch = text[i]\n if (escaped) escaped = false\n else if (ch === '\\\\') escaped = true\n else if (ch === '\"') return i\n }\n return text.length\n}\n\n/**\n * Parse `text.slice(start, end)` as JSON, pairing the value with `end`, or\n * `undefined` when the slice is not valid JSON. JSON.parse is the sole\n * semantic authority; the scanner only fixed the extent.\n */\nfunction parse_json_extent(\n text: string,\n start: number,\n end: number,\n): { value: unknown; end: number } | undefined {\n try {\n return { value: JSON.parse(text.slice(start, end)), end }\n } catch {\n return undefined\n }\n}\n\n/**\n * Find the extent of one balanced JSON object starting at `start_index`\n * (which must point at `{`), respecting strings and escapes so braces inside\n * string values do not affect the depth count. The scanner only finds the\n * extent; JSON.parse remains the sole semantic authority.\n */\nexport function scan_balanced_json(\n text: string,\n start_index: number,\n): { value: unknown; end: number } | undefined {\n if (text[start_index] !== '{') return undefined\n let depth = 0\n for (let i = start_index; i < text.length; i += 1) {\n const ch = text[i]\n if (ch === '\"') {\n i = skip_json_string(text, i)\n } else if (ch === '{') {\n depth += 1\n } else if (ch === '}') {\n depth -= 1\n if (depth === 0) return parse_json_extent(text, start_index, i + 1)\n }\n }\n return undefined\n}\n\n/**\n * Check for a non-null, non-array object.\n */\nfunction is_plain_object(value: unknown): value is Record<string, unknown> {\n return typeof value === 'object' && value !== null && !Array.isArray(value)\n}\n\n/**\n * Exactly {name, arguments} with a string name and object arguments. This is\n * the shape firewall against prose that happens to contain JSON.\n */\nfunction call_shape(\n value: unknown,\n): { name: string; args: Record<string, unknown> } | undefined {\n if (!is_plain_object(value)) return undefined\n if (Object.keys(value).length !== 2) return undefined\n const name = value['name']\n const args = value['arguments']\n if (typeof name !== 'string' || !is_plain_object(args)) return undefined\n return { name, args }\n}\n\n/**\n * Check whether a span intersects any masked region.\n */\nfunction overlaps_any(span: Span, masks: ReadonlyArray<Span>): boolean {\n return masks.some((m) => span.start < m.end && m.start < span.end)\n}\n\n/**\n * Find the mask covering a text index, if any, so scanners can jump past it.\n */\nfunction mask_containing(masks: ReadonlyArray<Span>, index: number): Span | undefined {\n return masks.find((m) => index >= m.start && index < m.end)\n}\n\n/**\n * Strip at most one leading and one trailing newline.\n *\n * Qwen XML parameter values are written on their own lines; the wrapping\n * newlines are markup, but interior whitespace is real data and stays.\n */\nfunction trim_one_newline(value: string): string {\n let out = value\n if (out.startsWith('\\n')) out = out.slice(1)\n if (out.endsWith('\\n')) out = out.slice(0, -1)\n return out\n}\n\n/**\n * Extract qwen_xml `<function=name>` candidates from a tool_call block body.\n *\n * Parameters land as a string map (typed coercion happens at validation).\n * Spans are offset by `inner_start` back into the full-text coordinate space.\n */\nfunction scan_qwen_functions(inner_start: number, inner: string): Candidate[] {\n const out: Candidate[] = []\n for (const fn of inner.matchAll(FUNCTION_RE)) {\n const body = fn[2] ?? ''\n const params: Record<string, string> = {}\n let leftover = body\n for (const pm of body.matchAll(PARAMETER_RE)) {\n params[pm[1] ?? ''] = trim_one_newline(pm[2] ?? '')\n leftover = leftover.replace(pm[0], '')\n }\n // Non-whitespace between parameter tags means the block is not a clean\n // call; skip it rather than guess at intent.\n if (leftover.trim().length !== 0) continue\n out.push({\n name: fn[1] ?? '',\n args: params,\n format: 'qwen_xml',\n span: { start: inner_start + fn.index, end: inner_start + fn.index + fn[0].length },\n })\n }\n return out\n}\n\n/**\n * Parse a hermes `<tool_call>{...}</tool_call>` payload into a candidate. The\n * block's whole extent (`span`) is used so a later strip removes the wrapper\n * too. Returns `undefined` when the inner object is not call-shaped.\n */\nfunction scan_hermes_block(text: string, inner_start: number, span: Span): Candidate | undefined {\n const brace = text.indexOf('{', inner_start)\n const scanned = brace === -1 ? undefined : scan_balanced_json(text, brace)\n const shaped = scanned === undefined ? undefined : call_shape(scanned.value)\n if (shaped === undefined) return undefined\n return { name: shaped.name, args: shaped.args, format: 'hermes', span }\n}\n\n/**\n * Parse one located `<tool_call>` block's inner content into candidates,\n * dispatching on whether it opens with a qwen `<function=` tag or a hermes\n * `{` object.\n */\nfunction scan_block_candidates(\n text: string,\n inner_start: number,\n close: number,\n span: Span,\n): Candidate[] {\n const inner = text.slice(inner_start, close)\n const trimmed = inner.trim()\n if (trimmed.startsWith('<function=')) return scan_qwen_functions(inner_start, inner)\n if (trimmed.startsWith('{')) {\n const candidate = scan_hermes_block(text, inner_start, span)\n return candidate === undefined ? [] : [candidate]\n }\n return []\n}\n\n/**\n * Scan `<tool_call>` blocks for hermes and qwen_xml candidates.\n *\n * Every block extent (accepted, rejected, or unterminated) is returned as a\n * mask so later passes never re-match payloads inside it.\n */\nfunction scan_tool_call_blocks(text: string): { candidates: Candidate[]; masks: Span[] } {\n const candidates: Candidate[] = []\n const masks: Span[] = []\n let pos = 0\n while (true) {\n const open = text.indexOf(TOOL_CALL_OPEN, pos)\n if (open === -1) break\n const close = text.indexOf(TOOL_CALL_CLOSE, open + TOOL_CALL_OPEN.length)\n if (close === -1) {\n // Unterminated block, likely 'length' truncation. Mask to end of text\n // so the bare pass cannot salvage a fragment of an incomplete call.\n masks.push({ start: open, end: text.length })\n break\n }\n const block_end = close + TOOL_CALL_CLOSE.length\n const span: Span = { start: open, end: block_end }\n masks.push(span)\n const inner_start = open + TOOL_CALL_OPEN.length\n candidates.push(...scan_block_candidates(text, inner_start, close, span))\n pos = block_end\n }\n return { candidates, masks }\n}\n\n/**\n * Scan code fences for JSON-format candidates.\n *\n * All fences become masks (keeping the bare pass out of code samples), but\n * only fences with no info string or `json` are parsed as candidates.\n */\nfunction scan_fences(\n text: string,\n block_masks: ReadonlyArray<Span>,\n): { candidates: Candidate[]; masks: Span[] } {\n const candidates: Candidate[] = []\n const masks: Span[] = []\n for (const m of text.matchAll(FENCE_RE)) {\n const span: Span = { start: m.index, end: m.index + m[0].length }\n if (overlaps_any(span, block_masks)) continue\n masks.push(span)\n const info = (m[1] ?? '').trim()\n if (info !== '' && info !== 'json') continue\n let value: unknown\n try {\n value = JSON.parse((m[2] ?? '').trim())\n } catch {\n continue\n }\n const shaped = call_shape(value)\n if (shaped === undefined) continue\n candidates.push({ name: shaped.name, args: shaped.args, format: 'json', span })\n }\n return { candidates, masks }\n}\n\n/**\n * Scan unmasked text for bare `{name, arguments}` JSON objects.\n *\n * A complete object that is not call-shaped is skipped whole rather than\n * descended into, so substructures of ordinary JSON output cannot\n * false-positive.\n */\nfunction scan_bare_json(text: string, masks: ReadonlyArray<Span>): Candidate[] {\n const out: Candidate[] = []\n let i = 0\n while (i < text.length) {\n const masked = mask_containing(masks, i)\n if (masked !== undefined) {\n i = masked.end\n continue\n }\n if (text[i] !== '{') {\n i += 1\n continue\n }\n const scanned = scan_balanced_json(text, i)\n if (scanned === undefined) {\n i += 1\n continue\n }\n const span: Span = { start: i, end: scanned.end }\n const shaped = overlaps_any(span, masks) ? undefined : call_shape(scanned.value)\n if (shaped !== undefined) {\n out.push({ name: shaped.name, args: shaped.args, format: 'json', span })\n }\n i = scanned.end\n }\n return out\n}\n\n/**\n * Promote a candidate to a `SalvagedCall` when its tool exists and its\n * arguments validate.\n *\n * This is the second half of the double gate described in the header.\n * qwen_xml candidates get one retry with per-parameter JSON coercion, since\n * XML parameter values always arrive as strings.\n */\nasync function validate_candidate(\n candidate: Candidate,\n tool_map: ReadonlyMap<string, Tool>,\n): Promise<SalvagedCall | undefined> {\n const tool = tool_map.get(candidate.name)\n if (tool === undefined) return undefined\n const schema = tool.input_schema\n const raw = await validate_schema(schema, candidate.args)\n if (raw.ok) {\n return {\n name: candidate.name,\n input: raw.value,\n format: candidate.format,\n span: candidate.span,\n }\n }\n if (candidate.format !== 'qwen_xml') return undefined\n // XML parameters arrive as strings; retry once with per-param JSON coercion\n // so numbers, booleans, and nested structures can validate. Raw-first order\n // keeps z.string() params as the literal string they were written as.\n const coerced: Record<string, unknown> = {}\n for (const [k, v] of Object.entries(candidate.args)) {\n if (typeof v !== 'string') {\n coerced[k] = v\n continue\n }\n try {\n coerced[k] = JSON.parse(v)\n } catch {\n coerced[k] = v\n }\n }\n const retried = await validate_schema(schema, coerced)\n if (!retried.ok) return undefined\n return {\n name: candidate.name,\n input: retried.value,\n format: candidate.format,\n span: candidate.span,\n }\n}\n\n/**\n * Remove the accepted calls' spans from the text, back to front so earlier\n * offsets stay valid, then drop any emptied `<tool_call>` wrappers.\n */\nfunction strip_spans(text: string, spans: ReadonlyArray<Span>): string {\n let out = text\n const descending = spans.toSorted((a, b) => b.start - a.start)\n for (const s of descending) out = out.slice(0, s.start) + out.slice(s.end)\n // Qwen candidates strip only their <function=> extent; drop a wrapper left\n // empty so history does not retain dangling markup.\n return out.replace(EMPTY_BLOCK_RE, '').trim()\n}\n\n/**\n * Recover tool calls from assistant text, per the header's format rules.\n *\n * Runs the three scanners in masking order (blocks, fences, bare JSON),\n * validates every candidate against the tool registry, and returns the\n * surviving calls plus the text with their spans stripped. Returns undefined\n * when nothing survives.\n */\nexport async function salvage_tool_calls(\n text: string,\n tool_map: ReadonlyMap<string, Tool>,\n): Promise<SalvageOutcome | undefined> {\n if (text.length === 0) return undefined\n const blocks = scan_tool_call_blocks(text)\n const fences = scan_fences(text, blocks.masks)\n const all_masks = [...blocks.masks, ...fences.masks]\n const candidates = [\n ...blocks.candidates,\n ...fences.candidates,\n ...scan_bare_json(text, all_masks),\n ].toSorted((a, b) => a.span.start - b.span.start)\n\n // Validated together rather than in sequence: a Standard Schema validator\n // may be async, and candidates are independent, so awaiting them one at a\n // time would only add latency. Promise.all preserves the textual order the\n // candidates were sorted into.\n const validated = await Promise.all(candidates.map((c) => validate_candidate(c, tool_map)))\n const calls = validated.filter((c) => c !== undefined)\n if (calls.length === 0) return undefined\n return {\n calls,\n stripped_text: strip_spans(\n text,\n calls.map((c) => c.span),\n ),\n }\n}\n","/**\n * Tool-call loop orchestration.\n *\n * Invariants:\n * - Tools execute SEQUENTIALLY within a turn (no parallel dispatch).\n * - Abort is checked at the top of each loop iteration AND before each tool\n * call within a turn.\n * - Tool input is validated against tool.input_schema BEFORE execute is\n * invoked. Invalid input is fed back as a tool result with error: true and\n * consumes a step; execute is not called.\n * - tool_error_policy:\n * 'feed_back' (default) serializes the thrown error into a tool result\n * with { error: <message> }. Loop continues.\n * 'throw' wraps the error in tool_error and ends the call.\n * - needs_approval (boolean or predicate) gates execute. Abort fired during\n * the await rejects with aborted_error.\n * - Absent on_tool_approval with needs_approval truthy FAILS CLOSED\n * (tool_approval_denied_error thrown before execute).\n * - max_steps cap RESOLVES with finish_reason: 'max_steps' (does not throw).\n * Attempted-but-unexecuted tool calls from the final turn land in\n * tool_calls with error: { message: 'max_steps_exceeded_before_execution' }.\n * - salvage_budget (from tool_call_repair_attempts): a turn with NO\n * structured calls, finish_reason 'stop'|'length', and tools present is\n * scanned for calls the model emitted as text (a local-runtime failure).\n * Validated matches run the normal execute path and produce the same\n * records/events/chunks as native calls, marked salvaged. The budget is\n * a shared mutable holder so it spans schema-repair re-invocations.\n * - max_tool_calls_per_step: calls beyond the cap are dropped for the step\n * (the model can re-issue next turn), recorded with\n * error: { message: 'dropped_max_tool_calls_per_step' }, and excluded\n * from the assistant history message so providers that require a result\n * per emitted call do not reject the next request.\n * - ends_turn (Tool.ends_turn): a tool flagged terminal ends the loop when a\n * call to it executes SUCCESSFULLY. The call runs the normal execute path\n * (record, fed tool_result message, trajectory events + chunk), then the\n * loop breaks with finish_reason 'stop' instead of running another model\n * turn. Salvaged terminal calls behave identically. A denied, invalid,\n * dropped, or throwing terminal call does NOT end the loop. A successful\n * terminal call is exempt from the max_steps would_exceed_after skip (it\n * needs no follow-up turn), so a terminal finish wins over a coincident\n * max_steps cap (finish_reason 'stop', max_steps_reached false).\n *\n * The loop does not itself call the AI SDK. It invokes a supplied `invoke_once`\n * seam that returns a neutral TurnResult. generate.ts builds the real seam\n * (the ai_sdk transport in providers/ai_sdk/, or a native adapter's\n * invoke_turn); tests inject a mock seam directly.\n */\n\nimport { format_schema_issues, validate_schema } from '#schema'\nimport type { TrajectoryLogger } from '#core'\nimport type {\n CostBreakdown,\n FinishReason,\n Message,\n PrepareStepHook,\n Pricing,\n SalvageFormat,\n StepRecord,\n StreamChunk,\n Tool,\n ToolApprovalHandler,\n ToolCallRecord,\n ToolExecContext,\n TurnResult,\n UsageTotals,\n} from './types.js'\nimport { salvage_tool_calls, type SalvageOutcome } from './tool_call_salvage.js'\nimport {\n aborted_error,\n tool_approval_denied_error,\n tool_error,\n} from './errors.js'\nimport {\n record_cost,\n record_tool_approval,\n record_tool_call,\n record_tool_call_salvaged,\n record_tool_calls_dropped,\n record_tool_result,\n end_step_span,\n start_step_span,\n type PricingMissingDedup,\n} from './trajectory.js'\nimport { compute_cost, FREE_PROVIDERS } from './pricing.js'\n\nexport type InvokeOnceArgs = {\n readonly step_index: number\n readonly messages: ReadonlyArray<Message>\n readonly tools: ReadonlyArray<Tool>\n readonly abort: AbortSignal\n readonly stream: boolean\n}\n\nexport type RawToolCall = {\n readonly id: string\n readonly name: string\n readonly input: unknown\n}\n\n/**\n * Retained alias of the neutral TurnResult (types.ts). Callers built against\n * the loop-local name keep working while TurnResult is the shared spelling.\n */\nexport type InvokeOnceResult = TurnResult\n\nexport type InvokeOnce = (args: InvokeOnceArgs) => Promise<TurnResult>\n\nexport type ToolLoopConfig = {\n readonly invoke_once: InvokeOnce\n readonly messages: Message[]\n readonly tools: ReadonlyArray<Tool>\n readonly max_steps: number\n readonly step_index_start: number\n readonly tool_error_policy: 'feed_back' | 'throw'\n readonly abort: AbortSignal\n readonly on_tool_approval: ToolApprovalHandler | undefined\n readonly trajectory: TrajectoryLogger | undefined\n readonly stream: boolean\n readonly dispatch_chunk: ((chunk: StreamChunk) => Promise<void>) | undefined\n readonly provider: string\n readonly model_id: string\n readonly resolve_pricing: () => Pricing | undefined\n readonly pricing_dedup: PricingMissingDedup\n readonly on_finish_step?: (record: StepRecord) => void\n /**\n * Per-turn message hook. Called before each turn with the would-be request\n * messages; a returned `{ messages }` replaces the request for THAT turn\n * only (config.messages, the canonical transcript, is untouched).\n * undefined disables the hook.\n */\n readonly prepare_step?: PrepareStepHook\n /**\n * Mutable so the budget survives schema-repair re-invocations of the loop\n * within one generate call, the same threading pattern as pricing_dedup.\n * undefined disables salvage.\n */\n readonly salvage_budget?: { remaining: number }\n readonly max_tool_calls_per_step?: number\n}\n\nexport type ToolLoopResult = {\n readonly text: string\n readonly steps: StepRecord[]\n readonly tool_calls: ToolCallRecord[]\n readonly finish_reason: FinishReason\n readonly max_steps_reached: boolean\n}\n\n/**\n * Throw `aborted_error` (tagged with the step index) if the signal has fired.\n */\nfunction throw_if_aborted(abort: AbortSignal, step_index: number): void {\n if (!abort.aborted) return\n throw new aborted_error('aborted', { reason: abort.reason, step_index })\n}\n\n/**\n * Like `throw_if_aborted`, but names the tool call that was about to run so\n * the error shows exactly where the abort landed.\n */\nfunction throw_if_aborted_in_flight(\n abort: AbortSignal,\n step_index: number,\n tool_call: { id: string; name: string },\n): void {\n if (!abort.aborted) return\n throw new aborted_error('aborted', {\n reason: abort.reason,\n step_index,\n tool_call_in_flight: { id: tool_call.id, name: tool_call.name },\n })\n}\n\n/**\n * Reduce any thrown value to a message string, never throwing itself.\n */\nfunction serialize_error(err: unknown): string {\n if (err instanceof Error) return err.message\n if (typeof err === 'string') return err\n try {\n return JSON.stringify(err) ?? String(err)\n } catch {\n return String(err)\n }\n}\n\n/**\n * Resolve whether a tool call may execute.\n *\n * Evaluates `needs_approval` (boolean or async predicate); when approval is\n * required, records the request event and awaits the handler in a race\n * against `abort`. A missing handler fails closed with\n * `tool_approval_denied_error` so approval-gated tools never run silently.\n */\nasync function request_approval(\n tool: Tool,\n input: unknown,\n step_index: number,\n tool_call_id: string,\n abort: AbortSignal,\n on_tool_approval: ToolApprovalHandler | undefined,\n trajectory: TrajectoryLogger | undefined,\n): Promise<boolean> {\n const needs_approval = tool.needs_approval\n const needs =\n typeof needs_approval === 'function'\n ? await needs_approval(input)\n : needs_approval === true\n if (!needs) return true\n\n record_tool_approval(trajectory, 'tool_approval_requested', {\n tool_name: tool.name,\n step_index,\n tool_call_id,\n })\n\n if (on_tool_approval === undefined) {\n record_tool_approval(trajectory, 'tool_approval_denied', {\n tool_name: tool.name,\n step_index,\n tool_call_id,\n })\n throw new tool_approval_denied_error(\n `tool approval required for '${tool.name}' but no on_tool_approval handler was provided`,\n { tool_name: tool.name, step_index, tool_call_id },\n )\n }\n\n const approval_promise = Promise.resolve(\n on_tool_approval({ tool_name: tool.name, input, step_index, abort }),\n )\n\n const approved = await new Promise<boolean>((resolve, reject) => {\n if (abort.aborted) {\n reject(new aborted_error('aborted', { reason: abort.reason, step_index }))\n return\n }\n const on_abort = (): void => {\n reject(new aborted_error('aborted', { reason: abort.reason, step_index }))\n }\n // Stryker disable next-line ObjectLiteral,BooleanLiteral: { once: true } is a cleanup optimization; the abort event is terminal and both then-handlers removeEventListener, so once:false is unobservable.\n abort.addEventListener('abort', on_abort, { once: true })\n approval_promise.then(\n (value) => {\n // Stryker disable next-line StringLiteral: removing the listener on the settled promise is cleanup only; an empty event name leaks a listener that can never fire observably.\n abort.removeEventListener('abort', on_abort)\n resolve(value)\n },\n (err: unknown) => {\n // Stryker disable next-line StringLiteral: same cleanup-only removal on the reject path.\n abort.removeEventListener('abort', on_abort)\n reject(err instanceof Error ? err : new Error(String(err)))\n },\n )\n })\n\n record_tool_approval(\n trajectory,\n approved ? 'tool_approval_granted' : 'tool_approval_denied',\n { tool_name: tool.name, step_index, tool_call_id },\n )\n\n return approved\n}\n\n/**\n * Emit a `tool_result` stream chunk when streaming is active.\n */\nasync function dispatch_tool_result_chunk(\n dispatch_chunk: ((chunk: StreamChunk) => Promise<void>) | undefined,\n step_index: number,\n id: string,\n output?: unknown,\n error?: { message: string },\n): Promise<void> {\n if (dispatch_chunk === undefined) return\n const chunk: StreamChunk = { kind: 'tool_result', id, step_index }\n if (output !== undefined) chunk.output = output\n if (error !== undefined) chunk.error = error\n await dispatch_chunk(chunk)\n}\n\n/**\n * Build the `role: 'tool'` message that feeds a tool's result back to the\n * model, JSON-serializing non-string content.\n */\nfunction build_tool_result_message(\n tool_call_id: string,\n tool_name: string,\n content: unknown,\n): Message {\n const serialized =\n typeof content === 'string' ? content : safe_json_stringify(content)\n return {\n role: 'tool',\n tool_call_id,\n name: tool_name,\n content: serialized,\n }\n}\n\n/**\n * JSON-stringify with a `String(value)` fallback for circular references and\n * other values `JSON.stringify` rejects.\n */\nfunction safe_json_stringify(value: unknown): string {\n try {\n return JSON.stringify(value) ?? String(value)\n } catch {\n return String(value)\n }\n}\n\n/**\n * Build the assistant history message for a turn: plain text when there are\n * no tool calls, otherwise structured text plus tool_call parts.\n */\nfunction build_assistant_message(text: string, tool_calls: ReadonlyArray<RawToolCall>): Message {\n if (tool_calls.length === 0) return { role: 'assistant', content: text }\n const parts: Array<\n | { type: 'text'; text: string }\n | { type: 'tool_call'; id: string; name: string; input: unknown }\n > = []\n if (text.length > 0) parts.push({ type: 'text', text })\n for (const tc of tool_calls) {\n parts.push({ type: 'tool_call', id: tc.id, name: tc.name, input: tc.input })\n }\n return { role: 'assistant', content: parts }\n}\n\n/**\n * Derive the step's cost from pricing tables and record it.\n *\n * Missing pricing for a paid provider emits `pricing_missing` (deduped per\n * call) and yields no breakdown; free providers skip the emit entirely.\n */\nfunction compute_and_record_cost(\n config: ToolLoopConfig,\n step_index: number,\n usage: UsageTotals,\n): CostBreakdown | undefined {\n const pricing = config.resolve_pricing()\n if (pricing === undefined && !FREE_PROVIDERS.has(config.provider)) {\n config.pricing_dedup.emit(config.provider, config.model_id)\n return undefined\n }\n const breakdown = compute_cost(usage, pricing, config.provider)\n if (breakdown !== undefined) {\n record_cost(config.trajectory, step_index, breakdown, 'engine_derived')\n }\n return breakdown\n}\n\n/**\n * Validate a raw tool-call input against the tool's schema before execution,\n * returning the parsed value or a feedback-ready error message.\n */\nasync function validate_tool_input(\n tool: Tool,\n input: unknown,\n): Promise<{ ok: true; value: unknown } | { ok: false; message: string }> {\n const parsed = await validate_schema(tool.input_schema, input)\n if (parsed.ok) return { ok: true, value: parsed.value }\n return { ok: false, message: `invalid tool input: ${format_schema_issues(parsed.issues)}` }\n}\n\n/**\n * Apply the prepare_step hook for one turn. Returns the messages to send to\n * the transport: the hook's replacement when it returns `{ messages }`, else\n * config.messages unchanged. The replacement is ephemeral; it is fed ONLY to\n * invoke_once for this turn, never pushed onto config.messages, so the loop's\n * salvage/approval/ends_turn/schema-repair machinery keeps reading the real\n * transcript. A step_prepared event (recorded inline, as request_sent is)\n * makes the mid-loop mutation legible with the before/after message counts.\n */\nasync function apply_prepare_step(\n config: ToolLoopConfig,\n step_index: number,\n): Promise<ReadonlyArray<Message>> {\n if (config.prepare_step === undefined) return config.messages\n const prepared = await config.prepare_step({\n step_index,\n messages: config.messages,\n })\n const replacement = prepared?.messages\n if (replacement === undefined) return config.messages\n config.trajectory?.record({\n kind: 'step_prepared',\n step_index,\n message_count_before: config.messages.length,\n message_count_after: replacement.length,\n })\n return replacement\n}\n\n/**\n * Mutable accumulators shared across loop iterations: the step records and\n * the flat list of every tool call the loop resolved.\n */\ntype LoopAccumulator = {\n readonly steps: StepRecord[]\n readonly tool_calls: ToolCallRecord[]\n}\n\n/**\n * Per-step working state threaded through the call-execution helpers.\n * `records` and `feed` accumulate in call order; `all_records` aliases the\n * loop-wide accumulator; `terminal_fired` flips when a call to a Tool\n * flagged ends_turn executes successfully (see the header invariant).\n */\ntype StepContext = {\n readonly config: ToolLoopConfig\n readonly tool_map: ReadonlyMap<string, Tool>\n readonly step_index: number\n readonly step_span: string | undefined\n readonly would_exceed_after: boolean\n readonly records: ToolCallRecord[]\n readonly all_records: ToolCallRecord[]\n readonly feed: Message[]\n terminal_fired: boolean\n}\n\n/**\n * One turn's effective view of the model output after salvage: the calls to\n * execute, the text history should carry, and the per-call salvage formats.\n * `outcome` is undefined when no salvage applied (native calls pass through).\n */\ntype SalvageView = {\n readonly calls: ReadonlyArray<RawToolCall>\n readonly history_text: string\n readonly formats: ReadonlyMap<string, SalvageFormat>\n readonly outcome: SalvageOutcome | undefined\n}\n\n/**\n * Assemble the loop's return value from the accumulated steps and records.\n */\nfunction loop_result(\n acc: LoopAccumulator,\n text: string,\n finish_reason: FinishReason,\n max_steps_reached: boolean,\n): ToolLoopResult {\n return { text, steps: acc.steps, tool_calls: acc.tool_calls, finish_reason, max_steps_reached }\n}\n\n/**\n * Invoke the transport seam once for one turn, bracketed by request_sent /\n * response_received events. A thrown invoke (or prepare_step) closes the\n * step span with the error before rethrowing.\n */\nasync function invoke_turn(\n config: ToolLoopConfig,\n step_index: number,\n step_span: string | undefined,\n): Promise<TurnResult> {\n try {\n const request_messages = await apply_prepare_step(config, step_index)\n config.trajectory?.record({ kind: 'request_sent', step_index })\n const turn = await config.invoke_once({\n step_index,\n messages: request_messages,\n tools: config.tools,\n abort: config.abort,\n stream: config.stream,\n })\n config.trajectory?.record({\n kind: 'response_received',\n step_index,\n output_tokens: turn.usage.output_tokens,\n finish_reason: turn.finish_reason,\n })\n return turn\n } catch (err: unknown) {\n const message = err instanceof Error ? err.message : String(err)\n end_step_span(config.trajectory, step_span, { error: message })\n throw err\n }\n}\n\n/**\n * Salvage text-embedded tool calls from an eligible turn.\n *\n * A turn that \"stopped\" with plain text may hold a call the runtime failed\n * to parse into tool_calls; salvage before deciding the step ends the loop.\n * History gets the stripped text + structured parts (raw markup in history\n * would teach the model the text format works, and a tool result without a\n * matching call part is rejected by OpenAI-compatible APIs);\n * StepRecord.text keeps the raw text for debugging. Returns the native view\n * unchanged when the turn is ineligible or nothing salvages.\n */\nasync function salvage_turn(\n config: ToolLoopConfig,\n turn: TurnResult,\n tool_map: ReadonlyMap<string, Tool>,\n step_index: number,\n): Promise<SalvageView> {\n const native: SalvageView = {\n calls: turn.tool_calls,\n history_text: turn.text,\n formats: new Map(),\n outcome: undefined,\n }\n const budget = config.salvage_budget\n const eligible =\n turn.tool_calls.length === 0 &&\n (turn.finish_reason === 'stop' || turn.finish_reason === 'length') &&\n config.tools.length > 0 &&\n budget !== undefined &&\n budget.remaining > 0\n if (!eligible) return native\n\n const outcome = await salvage_tool_calls(turn.text, tool_map)\n if (outcome === undefined) return native\n budget.remaining -= 1\n const formats = new Map<string, SalvageFormat>()\n const calls = outcome.calls.map((c, n) => {\n const id = `salvaged_${step_index}_${n}`\n formats.set(id, c.format)\n return { id, name: c.name, input: c.input }\n })\n record_tool_call_salvaged(config.trajectory, {\n step_index,\n calls: calls.map((c) => ({\n tool_call_id: c.id,\n name: c.name,\n // Stryker disable next-line StringLiteral: formats has an entry for every id (set just above), so the ?? 'json' fallback is unreachable.\n format: formats.get(c.id) ?? 'json',\n })),\n raw_text: turn.text,\n })\n await dispatch_salvaged_call_chunks(config, calls, step_index)\n return { calls, history_text: outcome.stripped_text, formats, outcome }\n}\n\n/**\n * Mirror the native stream for salvaged calls, which emits start/end for\n * every call the model attempted, including ones the per-step clamp later\n * drops.\n */\nasync function dispatch_salvaged_call_chunks(\n config: ToolLoopConfig,\n calls: ReadonlyArray<RawToolCall>,\n step_index: number,\n): Promise<void> {\n if (config.dispatch_chunk === undefined) return\n for (const c of calls) {\n await config.dispatch_chunk({\n kind: 'tool_call_start',\n id: c.id,\n name: c.name,\n step_index,\n })\n await config.dispatch_chunk({\n kind: 'tool_call_end',\n id: c.id,\n input: c.input,\n step_index,\n })\n }\n}\n\n/**\n * Apply `max_tool_calls_per_step` to a turn's calls, native and salvaged\n * alike. Dropped calls never reach history; the model re-issues them on a\n * later turn if it still wants them.\n */\nfunction clamp_calls(\n config: ToolLoopConfig,\n calls: ReadonlyArray<RawToolCall>,\n step_index: number,\n): { kept: ReadonlyArray<RawToolCall>; dropped: ReadonlyArray<RawToolCall> } {\n const cap = config.max_tool_calls_per_step\n if (cap === undefined || calls.length <= cap) return { kept: calls, dropped: [] }\n const kept = calls.slice(0, cap)\n const dropped = calls.slice(cap)\n record_tool_calls_dropped(config.trajectory, {\n step_index,\n max_tool_calls_per_step: cap,\n kept: kept.length,\n dropped: dropped.map((d) => ({ tool_call_id: d.id, name: d.name })),\n })\n return { kept, dropped }\n}\n\n/**\n * Record a call that resolved to an error on the feed-back path: the error\n * record, the fed-back error tool_result message, the tool_call trajectory\n * event, and the stream chunk, in that order. Throw-policy paths raise\n * before reaching here.\n */\nasync function record_failed_call(\n ctx: StepContext,\n call: { id: string; name: string; input: unknown },\n message: string,\n timing: { duration_ms: number; started_at: number },\n): Promise<void> {\n const record: ToolCallRecord = {\n id: call.id,\n name: call.name,\n input: call.input,\n error: { message },\n duration_ms: timing.duration_ms,\n started_at: timing.started_at,\n }\n ctx.records.push(record)\n ctx.all_records.push(record)\n ctx.feed.push(\n build_tool_result_message(call.id, call.name, { error: message }),\n )\n record_tool_call(ctx.config.trajectory, {\n step_index: ctx.step_index,\n name: call.name,\n tool_call_id: call.id,\n input: call.input,\n duration_ms: timing.duration_ms,\n error: { message },\n })\n await dispatch_tool_result_chunk(\n ctx.config.dispatch_chunk,\n ctx.step_index,\n call.id,\n undefined,\n { message },\n )\n}\n\n/**\n * Record a call that never reached execution (the final-turn max_steps skip,\n * the per-step-cap drop): an error record and a tool_result stream chunk,\n * but no tool_call trajectory event, no execution, and no fed-back tool\n * message.\n */\nasync function record_unexecuted_call(\n ctx: StepContext,\n call: RawToolCall,\n message: string,\n): Promise<void> {\n const record: ToolCallRecord = {\n id: call.id,\n name: call.name,\n input: call.input,\n error: { message },\n duration_ms: 0,\n started_at: Date.now(),\n }\n ctx.records.push(record)\n ctx.all_records.push(record)\n await dispatch_tool_result_chunk(\n ctx.config.dispatch_chunk,\n ctx.step_index,\n call.id,\n undefined,\n { message },\n )\n}\n\n/**\n * Look up the named tool and validate the raw input against its schema.\n * Returns undefined when the failure was recorded on the feed-back path;\n * throws under 'throw' policy for an unknown tool.\n */\nasync function resolve_tool_and_input(\n ctx: StepContext,\n raw_call: RawToolCall,\n): Promise<{ tool: Tool; input: unknown } | undefined> {\n const tool = ctx.tool_map.get(raw_call.name)\n if (tool === undefined) {\n const err_message = `unknown tool '${raw_call.name}'`\n if (ctx.config.tool_error_policy === 'throw') {\n const thrown = new tool_error(err_message, {\n tool_name: raw_call.name,\n tool_call_id: raw_call.id,\n cause: new Error(err_message),\n })\n end_step_span(ctx.config.trajectory, ctx.step_span, { error: err_message })\n throw thrown\n }\n await record_failed_call(ctx, raw_call, err_message, {\n duration_ms: 0,\n started_at: Date.now(),\n })\n return undefined\n }\n\n const validation = await validate_tool_input(tool, raw_call.input)\n if (!validation.ok) {\n await record_failed_call(ctx, raw_call, validation.message, {\n duration_ms: 0,\n started_at: Date.now(),\n })\n return undefined\n }\n\n return { tool, input: validation.value }\n}\n\n/**\n * Resolve whether the call may execute (see request_approval). A denial\n * either throws ('throw' policy) or records the denied call and returns\n * false; an abort or handler rejection closes the step span and rethrows.\n */\nasync function approve_call(\n ctx: StepContext,\n tool: Tool,\n input: unknown,\n raw_call: RawToolCall,\n): Promise<boolean> {\n let approved: boolean\n try {\n approved = await request_approval(\n tool,\n input,\n ctx.step_index,\n raw_call.id,\n ctx.config.abort,\n ctx.config.on_tool_approval,\n ctx.config.trajectory,\n )\n } catch (err: unknown) {\n const message = err instanceof Error ? err.message : String(err)\n end_step_span(ctx.config.trajectory, ctx.step_span, { error: message })\n throw err\n }\n if (approved) return true\n\n const denied_message = 'tool_approval_denied'\n if (ctx.config.tool_error_policy === 'throw') {\n const thrown = new tool_approval_denied_error(\n `tool '${tool.name}' approval denied`,\n { tool_name: tool.name, step_index: ctx.step_index, tool_call_id: raw_call.id },\n )\n end_step_span(ctx.config.trajectory, ctx.step_span, { error: denied_message })\n throw thrown\n }\n await record_failed_call(\n ctx,\n { id: raw_call.id, name: tool.name, input },\n denied_message,\n { duration_ms: 0, started_at: Date.now() },\n )\n return false\n}\n\n/**\n * Execute an approved call and record the outcome: a success record with\n * output (flipping terminal_fired for an ends_turn tool), or the error path\n * via record_execute_failure.\n */\nasync function execute_approved_call(\n ctx: StepContext,\n tool: Tool,\n input: unknown,\n raw_call: RawToolCall,\n): Promise<void> {\n const started_at = Date.now()\n const tool_ctx: ToolExecContext = {\n abort: ctx.config.abort,\n tool_call_id: raw_call.id,\n step_index: ctx.step_index,\n ...(ctx.config.trajectory !== undefined ? { trajectory: ctx.config.trajectory } : {}),\n }\n\n let output: unknown\n let err_message: string | undefined\n let thrown: unknown\n try {\n const execute = tool.execute\n const maybe = execute(input, tool_ctx)\n output = maybe instanceof Promise ? await maybe : maybe\n } catch (err: unknown) {\n thrown = err\n err_message = serialize_error(err)\n }\n\n const duration_ms = Date.now() - started_at\n\n if (thrown !== undefined) {\n await record_execute_failure(ctx, tool, raw_call, input, {\n thrown,\n err_message,\n duration_ms,\n started_at,\n })\n return\n }\n\n const record: ToolCallRecord = {\n id: raw_call.id,\n name: tool.name,\n input,\n output,\n duration_ms,\n started_at,\n }\n ctx.records.push(record)\n ctx.all_records.push(record)\n if (tool.ends_turn === true) ctx.terminal_fired = true\n ctx.feed.push(build_tool_result_message(raw_call.id, tool.name, output ?? ''))\n record_tool_call(ctx.config.trajectory, {\n step_index: ctx.step_index,\n name: tool.name,\n tool_call_id: raw_call.id,\n input,\n duration_ms,\n })\n await dispatch_tool_result_chunk(ctx.config.dispatch_chunk, ctx.step_index, raw_call.id, output)\n}\n\n/**\n * Handle a throwing execute: an abort in flight or 'throw' policy closes\n * the step span and throws; feed-back policy records the failure with the\n * measured timing.\n */\nasync function record_execute_failure(\n ctx: StepContext,\n tool: Tool,\n raw_call: RawToolCall,\n input: unknown,\n failure: {\n thrown: unknown\n err_message: string | undefined\n duration_ms: number\n started_at: number\n },\n): Promise<void> {\n if (ctx.config.abort.aborted) {\n const abort_err = new aborted_error('aborted', {\n reason: ctx.config.abort.reason,\n step_index: ctx.step_index,\n tool_call_in_flight: { id: raw_call.id, name: tool.name },\n })\n end_step_span(ctx.config.trajectory, ctx.step_span, { error: 'aborted' })\n throw abort_err\n }\n if (ctx.config.tool_error_policy === 'throw') {\n const wrapped = new tool_error(\n `tool '${tool.name}' failed: ${failure.err_message ?? 'unknown'}`,\n {\n tool_name: tool.name,\n tool_call_id: raw_call.id,\n cause: failure.thrown,\n },\n )\n end_step_span(ctx.config.trajectory, ctx.step_span, {\n // Stryker disable next-line StringLiteral: err_message is always a string in this branch (set from serialize_error in the catch), so the ?? 'tool error' fallback is unreachable.\n error: failure.err_message ?? 'tool error',\n })\n throw wrapped\n }\n await record_failed_call(\n ctx,\n { id: raw_call.id, name: tool.name, input },\n // Stryker disable next-line StringLiteral: err_message is always a string here (see catch above), so this ?? 'unknown' fallback is unreachable.\n failure.err_message ?? 'unknown',\n { duration_ms: failure.duration_ms, started_at: failure.started_at },\n )\n}\n\n/**\n * Run one raw tool call through the guard chain — final-turn skip, tool\n * lookup, input validation, approval — then execute it. Each guard either\n * records the failure (feed-back policy) and stops, or throws (throw\n * policy / abort).\n */\nasync function process_call(ctx: StepContext, raw_call: RawToolCall): Promise<void> {\n throw_if_aborted_in_flight(ctx.config.abort, ctx.step_index, {\n id: raw_call.id,\n name: raw_call.name,\n })\n\n // A successful terminal call needs no follow-up turn, so it is exempt\n // from this skip: it executes below and ends the loop cleanly, winning\n // over the coincident max_steps cap.\n if (ctx.would_exceed_after && ctx.tool_map.get(raw_call.name)?.ends_turn !== true) {\n await record_unexecuted_call(ctx, raw_call, 'max_steps_exceeded_before_execution')\n return\n }\n\n const resolved = await resolve_tool_and_input(ctx, raw_call)\n if (resolved === undefined) return\n\n const approved = await approve_call(ctx, resolved.tool, resolved.input, raw_call)\n if (!approved) return\n\n throw_if_aborted_in_flight(ctx.config.abort, ctx.step_index, {\n id: raw_call.id,\n name: resolved.tool.name,\n })\n\n await execute_approved_call(ctx, resolved.tool, resolved.input, raw_call)\n}\n\n/**\n * Stamp salvage provenance onto the records of calls that came from text\n * salvage rather than structured output.\n */\nfunction mark_salvaged(\n records: ReadonlyArray<ToolCallRecord>,\n formats: ReadonlyMap<string, SalvageFormat>,\n): void {\n for (const r of records) {\n const format = formats.get(r.id)\n if (format !== undefined) {\n r.salvaged = true\n r.salvaged_format = format\n }\n }\n}\n\n/**\n * Emit a tool_result for every resolved call in this step (success carries\n * output, feed-back failures carry error). Throw-policy and aborted calls\n * exit before here and surface loudly as a thrown error instead.\n */\nfunction emit_tool_results(\n config: ToolLoopConfig,\n step_index: number,\n records: ReadonlyArray<ToolCallRecord>,\n): void {\n for (const r of records) {\n record_tool_result(config.trajectory, {\n step_index,\n name: r.name,\n tool_call_id: r.id,\n duration_ms: r.duration_ms,\n ...(r.error !== undefined ? { error: r.error } : { output: r.output }),\n })\n }\n}\n\n/**\n * The finish reason a tool-call step reports. A salvaged step reports\n * 'tool_calls': downstream consumers see the same shape a native tool turn\n * produces; the salvaged flags carry provenance. A terminal step reports\n * 'tool_calls' (it genuinely made calls); the loop-level finish_reason\n * 'stop' is the separate signal that generation ended.\n */\nfunction resolve_turn_finish_reason(\n ctx: StepContext,\n salvaged: boolean,\n turn_finish: FinishReason,\n): FinishReason {\n if (ctx.terminal_fired) return 'tool_calls'\n if (ctx.would_exceed_after) return 'max_steps'\n if (salvaged) return 'tool_calls'\n return turn_finish\n}\n\n/**\n * Build one StepRecord — cost derived and recorded, provider_reported\n * passed through — push it, notify on_finish_step, and close the step span.\n */\nfunction push_step_record(\n config: ToolLoopConfig,\n acc: LoopAccumulator,\n step_index: number,\n turn: TurnResult,\n tool_calls: ToolCallRecord[],\n finish_reason: FinishReason,\n step_span: string | undefined,\n): void {\n const record: StepRecord = {\n index: step_index,\n text: turn.text,\n tool_calls,\n usage: turn.usage,\n finish_reason,\n }\n const breakdown = compute_and_record_cost(config, step_index, turn.usage)\n if (breakdown !== undefined) record.cost = breakdown\n if (turn.provider_reported !== undefined) {\n record.provider_reported = turn.provider_reported\n }\n acc.steps.push(record)\n if (config.on_finish_step !== undefined) config.on_finish_step(record)\n end_step_span(config.trajectory, step_span, {\n usage: turn.usage,\n finish_reason,\n })\n}\n\n/**\n * Run one loop iteration: invoke the turn, salvage and clamp its calls,\n * execute them sequentially, and record the step. Returns the finished\n * ToolLoopResult when this step ends the loop (no calls, terminal tool,\n * max_steps), undefined when the loop should continue.\n */\nasync function run_loop_step(\n config: ToolLoopConfig,\n tool_map: ReadonlyMap<string, Tool>,\n acc: LoopAccumulator,\n step_index: number,\n): Promise<ToolLoopResult | undefined> {\n const step_span = start_step_span(config.trajectory, step_index)\n const turn = await invoke_turn(config, step_index, step_span)\n\n const view = await salvage_turn(config, turn, tool_map, step_index)\n const { kept, dropped } = clamp_calls(config, view.calls, step_index)\n config.messages.push(build_assistant_message(view.history_text, kept))\n\n if (kept.length === 0) {\n push_step_record(config, acc, step_index, turn, [], turn.finish_reason, step_span)\n return loop_result(acc, turn.text, turn.finish_reason, false)\n }\n\n // This turn has tool calls. Execute them sequentially.\n const ctx: StepContext = {\n config,\n tool_map,\n step_index,\n step_span,\n would_exceed_after: step_index + 1 >= config.max_steps,\n records: [],\n all_records: acc.tool_calls,\n feed: [],\n terminal_fired: false,\n }\n for (const raw_call of kept) await process_call(ctx, raw_call)\n\n // Dropped calls mirror the max_steps precedent: a record with an error\n // and a tool_result event/chunk, but no tool_call event, no execution,\n // and no fed-back tool message (their call parts are not in history).\n for (const d of dropped) {\n await record_unexecuted_call(ctx, d, 'dropped_max_tool_calls_per_step')\n }\n\n mark_salvaged(ctx.records, view.formats)\n emit_tool_results(config, step_index, ctx.records)\n for (const m of ctx.feed) config.messages.push(m)\n\n const turn_finish_reason = resolve_turn_finish_reason(\n ctx,\n view.outcome !== undefined,\n turn.finish_reason,\n )\n push_step_record(config, acc, step_index, turn, ctx.records, turn_finish_reason, step_span)\n\n // A successful terminal call ends the loop cleanly. Placed before the\n // max_steps break so a terminal finish wins over a coincident cap: the\n // full step is already recorded, so the result stays complete.\n if (ctx.terminal_fired) return loop_result(acc, turn.text, 'stop', false)\n if (ctx.would_exceed_after) return loop_result(acc, turn.text, 'max_steps', true)\n return undefined\n}\n\n/**\n * Run the model-turn / tool-execution loop to completion.\n *\n * Each iteration invokes the transport seam once, salvages text-embedded\n * tool calls when eligible, clamps to `max_tool_calls_per_step`, executes\n * calls sequentially under the header invariants, and feeds results back\n * until the model stops, a terminal tool fires, or `max_steps` is reached.\n */\nexport async function run_tool_loop(config: ToolLoopConfig): Promise<ToolLoopResult> {\n const acc: LoopAccumulator = { steps: [], tool_calls: [] }\n const tool_map = new Map<string, Tool>()\n for (const t of config.tools) tool_map.set(t.name, t)\n\n let step_index = config.step_index_start\n while (true) {\n throw_if_aborted(config.abort, step_index)\n if (step_index >= config.max_steps) return loop_result(acc, '', 'max_steps', true)\n const finished = await run_loop_step(config, tool_map, acc, step_index)\n if (finished !== undefined) return finished\n step_index += 1\n }\n}\n","/**\n * `generate(opts)`: the single public entry point for model calls.\n *\n * This file is SDK-agnostic: it resolves options, gates capabilities, and\n * owns retry and trajectory recording, and it drives every turn\n * (both the `ai_sdk` and native transports) through the neutral\n * `invoke_turn` seam. The Vercel AI SDK call itself lives in\n * providers/ai_sdk/invoke.ts, the only module allowed to import from `ai`\n * (enforced by the no-ai-import-outside-ai-sdk-provider rule). tool_loop.ts\n * consumes the InvokeOnce seam built here.\n *\n * That seam is reached by `await import(...)` rather than a static import, and\n * the types it exports come in type-only (erased at compile time), so `ai`\n * enters the module graph only on a call that actually selects the ai_sdk\n * transport. A native-transport or claude_cli user never loads it.\n */\n\nimport type {\n AiSdkTelemetrySettings,\n CostBreakdown,\n EffortLevel,\n FinishReason,\n GenerateOptions,\n GenerateResult,\n Message,\n Pricing,\n PricingTable,\n ResolvedModel,\n RetryPolicy,\n StreamChunk,\n Tool,\n TurnRequest,\n TurnResult,\n} from './types.js'\nimport {\n aborted_error,\n engine_config_error,\n incomplete_generation_error,\n model_required_error,\n on_chunk_error,\n provider_capability_error,\n provider_error,\n provider_not_configured_error,\n turn_timeout_error,\n} from './errors.js'\nimport { format_schema_issues } from '#schema'\nimport type { TrajectoryLogger } from '#core'\nimport { split_leading_system_run } from './leading_system.js'\nimport { merge_provider_options } from './merge_defaults.js'\nimport { FREE_PROVIDERS, pricing_key } from './pricing.js'\nimport { parse_retry_after, retry_with_policy } from './retry.js'\nimport {\n build_repair_message,\n parse_with_schema,\n throw_schema_validation,\n} from './schema.js'\nimport {\n create_chunk_dispatcher,\n type ChunkDispatcher,\n} from './streaming.js'\nimport {\n create_pricing_missing_dedup,\n end_generate_span,\n record_effort_ignored,\n record_schema_validation_failed,\n start_generate_span,\n with_timestamps,\n} from './trajectory.js'\nimport { sum_usage } from './usage.js'\nimport {\n run_tool_loop,\n type InvokeOnce,\n type InvokeOnceArgs,\n type InvokeOnceResult,\n type ToolLoopConfig,\n} from './tool_loop.js'\nimport { missing_peer_error } from './providers/types.js'\nimport type {\n AiSdkProviderAdapter,\n NativeProviderAdapter,\n ProviderAdapter,\n} from './providers/types.js'\nimport type { AiSdkTurn, AiSdkTurnConfig } from './providers/ai_sdk/invoke.js'\n\nexport type EngineInternals = {\n readonly pricing: PricingTable\n readonly adapters: ReadonlyMap<string, ProviderAdapter>\n readonly default_retry: RetryPolicy\n readonly default_effort: EffortLevel\n readonly default_max_steps: number\n readonly default_turn_timeout_ms?: number\n readonly default_ai_sdk_telemetry?: AiSdkTelemetrySettings\n readonly default_model?: string\n readonly default_provider?: string\n readonly default_system?: string\n readonly default_tool_error_policy?: 'feed_back' | 'throw'\n readonly default_schema_repair_attempts?: number\n readonly default_tool_call_repair_attempts?: number\n readonly default_max_tool_calls_per_step?: number\n readonly default_provider_options?: Readonly<Record<string, Readonly<Record<string, unknown>>>>\n}\n\n/**\n * Build the initial message list for a generate call from `opts.system` and\n * `opts.prompt`.\n *\n * A non-empty string `system` is prepended as a system message. A string\n * `prompt` becomes a single user message; a `Message[]` prompt is copied\n * through element-by-element so the returned array can be mutated without\n * affecting the caller's.\n */\nexport function build_initial_messages<T>(opts: GenerateOptions<T>): Message[] {\n const messages: Message[] = []\n if (typeof opts.system === 'string' && opts.system.length > 0) {\n messages.push({ role: 'system', content: opts.system })\n }\n if (typeof opts.prompt === 'string') {\n messages.push({ role: 'user', content: opts.prompt })\n return messages\n }\n for (const m of opts.prompt) messages.push({ ...m })\n return messages\n}\n\n/**\n * The engine-Message analog of the SDK-side split_leading_system\n * (providers/ai_sdk/invoke.ts): build_native_invoke hoists the leading system\n * run into TurnRequest.system so a native adapter maps conversation messages\n * only. Same guards as the SDK variant: only the leading run is hoisted, and\n * the original list is returned untouched when hoisting would leave `messages`\n * empty (provider APIs reject an empty messages array).\n */\nexport function split_leading_system_messages(messages: ReadonlyArray<Message>): {\n system?: string\n messages: Message[]\n} {\n return split_leading_system_run(messages, (m) => m.content)\n}\n\nconst RETRY_CLASSIFIED_KINDS = new Set(['rate_limit', 'provider_5xx', 'network', 'timeout'])\nconst NETWORK_ERROR_CODES = new Set(['ECONNRESET', 'ETIMEDOUT', 'ENOTFOUND', 'ECONNREFUSED'])\n\n/**\n * True when `err` already carries a `kind` this layer treats as retryable, so\n * the classifier passes it through untouched.\n */\nfunction has_retry_kind(err: object): boolean {\n const kind = Reflect.get(err, 'kind')\n return typeof kind === 'string' && RETRY_CLASSIFIED_KINDS.has(kind)\n}\n\n/**\n * Read the HTTP status off either `statusCode` or `status`, in that order.\n */\nfunction resolve_error_status(err: object): number | undefined {\n const status = Reflect.get(err, 'statusCode')\n if (typeof status === 'number') return status\n const status_alt = Reflect.get(err, 'status')\n return typeof status_alt === 'number' ? status_alt : undefined\n}\n\n/**\n * Copy the error's `message` onto a classification record when it is a string,\n * returning the same record for chaining.\n */\nfunction with_error_message(\n err: object,\n out: Record<string, unknown>,\n): Record<string, unknown> {\n const message = Reflect.get(err, 'message')\n if (typeof message === 'string') out['message'] = message\n return out\n}\n\n/**\n * Parse a `Retry-After` value off the error's `responseHeaders`, if present.\n */\nfunction retry_after_from_error(err: object): number | undefined {\n const headers = Reflect.get(err, 'responseHeaders')\n if (headers === null || typeof headers !== 'object') return undefined\n const hv = Reflect.get(headers, 'retry-after')\n return typeof hv === 'string' ? parse_retry_after(hv) : undefined\n}\n\n/**\n * Build the `rate_limit` classification for a 429, attaching the message and a\n * parsed `Retry-After` when either is present.\n */\nfunction classify_rate_limit(err: object): Record<string, unknown> {\n const out = with_error_message(err, { kind: 'rate_limit', status: 429 })\n const retry_after_ms = retry_after_from_error(err)\n if (retry_after_ms !== undefined) out['retry_after_ms'] = retry_after_ms\n return out\n}\n\n/**\n * Build the `network` classification when `err.code` is a known network error\n * code, or `undefined` when it is not.\n */\nfunction classify_network_error(err: object): Record<string, unknown> | undefined {\n const code = Reflect.get(err, 'code')\n if (typeof code !== 'string' || !NETWORK_ERROR_CODES.has(code)) return undefined\n return with_error_message(err, { kind: 'network' })\n}\n\n/**\n * Classify a thrown provider error into the shape `retry_with_policy`\n * understands.\n *\n * Passes through anything that already carries a recognized `kind`.\n * Otherwise inspects `statusCode`/`status`: 429 becomes `rate_limit`\n * (reading `Retry-After` off `responseHeaders` when present), 5xx becomes\n * `provider_5xx`, and a known `ECONNRESET`/`ETIMEDOUT`/`ENOTFOUND`/\n * `ECONNREFUSED` error code becomes `network`. Anything else passes through\n * unclassified, which `retry_with_policy` treats as non-retryable.\n */\nexport function classify_provider_error(err: unknown): unknown {\n if (err === null || typeof err !== 'object') return err\n if (has_retry_kind(err)) return err\n const status = resolve_error_status(err)\n if (status === 429) return classify_rate_limit(err)\n if (status !== undefined && status >= 500 && status < 600) {\n return with_error_message(err, { kind: 'provider_5xx', status })\n }\n return classify_network_error(err) ?? err\n}\n\ntype AiSdkInvokeConfig = {\n readonly invoke_turn: AiSdkTurn\n readonly retry_policy: RetryPolicy\n readonly turn_timeout_ms: number | undefined\n}\n\ntype NativeInvokeConfig = {\n readonly adapter: NativeProviderAdapter\n readonly model_id: string\n readonly retry_policy: RetryPolicy\n readonly turn_timeout_ms: number | undefined\n readonly dispatcher: ChunkDispatcher\n readonly effort: EffortLevel\n readonly schema: TurnRequest['schema']\n readonly provider_options: TurnRequest['provider_options']\n readonly temperature: number | undefined\n readonly max_tokens: number | undefined\n readonly top_p: number | undefined\n}\n\ntype TurnDeadline = {\n readonly signal: AbortSignal\n readonly timed_out: () => boolean\n readonly dispose: () => void\n}\n\n/**\n * Compose the per-attempt turn signal: the user's abort OR'd with a fresh\n * `turn_timeout_ms` deadline via `AbortSignal.any` (the same pattern\n * `src/core/timeout.ts` uses). `timed_out()` distinguishes an expiry\n * (retryable) from a user abort (terminal) in the `retry_turn` ladder;\n * `dispose()` clears the timer so a settled attempt never leaves one armed.\n * With no budget configured, the user's abort signal passes through\n * unchanged. Armed fresh inside `retry_with_policy`'s callback so each retry\n * gets its own full budget rather than sharing one deadline across attempts.\n */\nfunction arm_turn_timeout(\n user_abort: AbortSignal,\n turn_timeout_ms: number | undefined,\n): TurnDeadline {\n if (turn_timeout_ms === undefined) {\n // Stryker disable next-line ArrowFunction: timed_out is only ever read as `if (deadline.timed_out())`, where () => undefined and () => false are both falsy, so the mutant is behaviorally identical.\n return { signal: user_abort, timed_out: () => false, dispose: () => {} }\n }\n const local = new AbortController()\n const composed = AbortSignal.any([user_abort, local.signal])\n let timed_out = false\n const timer = setTimeout(() => {\n timed_out = true\n local.abort()\n }, turn_timeout_ms)\n return {\n signal: composed,\n timed_out: () => timed_out,\n dispose: () => {\n clearTimeout(timer)\n },\n }\n}\n\n/**\n * Engine-owned wrapper shared by both transports: one turn attempt inside\n * retry_with_policy. The catch ladder classifies by CAUSE, not\n * by the shape the transport happened to throw: on_chunk_error passes through,\n * then a genuine user abort wins, then any error once a chunk has flowed is a\n * non-retryable stream interruption, then a pre-chunk `turn_timeout_ms` expiry\n * is a retryable typed timeout, and only a below-loop aborted_error unrelated\n * to either passes through. Cause-first ordering is what keeps the two\n * transports in parity: the ai_sdk transport reports a mid-stream abort as an\n * aborted_error and the native one as a raw AbortError, so both must be read as\n * the same interruption rather than the ai_sdk timeout masquerading as a user\n * cancel. call_once receives the composed abort+timeout signal so the deadline\n * actually cancels the in-flight request. Adapters may swap `classify`, but\n * never the ladder itself: the engine owns retry, so a hidden adapter-level\n * retry would be invisible to anything relying on this ladder.\n */\nfunction retry_turn(\n call_once: (turn_abort: AbortSignal) => Promise<TurnResult>,\n args: InvokeOnceArgs,\n has_streamed: () => boolean,\n retry_policy: RetryPolicy,\n classify: (err: unknown) => unknown,\n turn_timeout_ms: number | undefined,\n): Promise<TurnResult> {\n return retry_with_policy(\n async () => {\n const deadline = arm_turn_timeout(args.abort, turn_timeout_ms)\n try {\n return await call_once(deadline.signal)\n } catch (err: unknown) {\n if (err instanceof on_chunk_error) throw err\n // A genuine user abort wins over everything below it, including a\n // deadline that fired in the same tick, so an intentional cancel\n // always surfaces as aborted_error.\n if (args.abort.aborted) {\n throw new aborted_error('aborted', {\n reason: args.abort.reason,\n step_index: args.step_index,\n })\n }\n // Any failure once a chunk has flowed is a non-retryable stream\n // interruption, a deadline expiry included (a retry would re-emit\n // output the consumer already saw). Checked before the aborted_error\n // pass-through so a mid-stream ai_sdk abort classifies here, in parity\n // with the native transport's raw AbortError.\n if (has_streamed()) {\n const message = err instanceof Error ? err.message : String(err)\n throw new provider_error(`stream interrupted: ${message}`, {\n cause_kind: 'unknown',\n })\n }\n // A pre-chunk deadline expiry is a retryable typed timeout, whatever\n // shape the transport threw when its signal aborted. turn_timeout_ms is\n // defined whenever timed_out() can be true.\n if (deadline.timed_out()) {\n throw new turn_timeout_error(turn_timeout_ms ?? 0, args.step_index)\n }\n // A below-loop aborted_error not attributable to the user or the\n // deadline passes through unclassified.\n if (err instanceof aborted_error) throw err\n throw classify(err)\n } finally {\n deadline.dispose()\n }\n },\n retry_policy,\n args.abort,\n )\n}\n\n/**\n * Build the ai_sdk-transport InvokeOnce: the SDK turn built by\n * providers/ai_sdk/invoke.ts behind the same engine-owned retry_turn wrapper\n * the native path uses. The SDK call body lives behind the seam; this builder\n * owns only retry and the streamed-output tracking that makes a mid-stream\n * failure a non-retryable interruption.\n */\nfunction build_ai_sdk_invoke(cfg: AiSdkInvokeConfig): InvokeOnce {\n return async (args: InvokeOnceArgs): Promise<InvokeOnceResult> => {\n let chunks_started = false\n const call_once = (turn_abort: AbortSignal): Promise<TurnResult> =>\n cfg.invoke_turn({\n step_index: args.step_index,\n messages: args.messages,\n abort: turn_abort,\n stream: args.stream,\n on_first_chunk: () => {\n chunks_started = true\n },\n })\n\n return await retry_turn(\n call_once,\n args,\n () => chunks_started,\n cfg.retry_policy,\n classify_provider_error,\n cfg.turn_timeout_ms,\n )\n }\n}\n\n/**\n * Build the native-transport InvokeOnce: maps the loop's InvokeOnceArgs to a\n * TurnRequest and calls adapter.invoke_turn inside the same retry_turn\n * wrapper as the ai_sdk path. The adapter sees a child abort signal so a\n * throwing on_chunk consumer cancels the in-flight request, and its chunk\n * emissions flow through the shared dispatcher, which is what lets\n * run_tool_loop treat both transports identically.\n */\nfunction build_native_invoke(cfg: NativeInvokeConfig): InvokeOnce {\n const classify = cfg.adapter.classify_error ?? classify_provider_error\n return async (args: InvokeOnceArgs): Promise<TurnResult> => {\n let chunks_started = false\n const call_once = async (turn_abort: AbortSignal): Promise<TurnResult> => {\n // turn_abort is the composed user-abort + turn_timeout deadline; the\n // internal controller adds one more reason to cancel (a throwing chunk\n // consumer) without losing either of those.\n const internal_controller = new AbortController()\n const cancel_on_turn_abort = (): void => {\n internal_controller.abort(turn_abort.reason)\n }\n // Stryker disable next-line BlockStatement: unreachable pre-abort guard. retry_with_policy re-checks abort.aborted at the top of every attempt and there is no await between that check and this synchronous read, so the composed turn_abort is never already-aborted when call_once begins.\n if (turn_abort.aborted) {\n internal_controller.abort(turn_abort.reason)\n } else {\n // Stryker disable next-line ObjectLiteral,BooleanLiteral: { once: true } is a cleanup optimization only. The abort event is terminal (fires at most once) and the finally below removes the listener, so once:false is unobservable.\n turn_abort.addEventListener('abort', cancel_on_turn_abort, { once: true })\n }\n const dispatch_chunk = async (chunk: StreamChunk): Promise<void> => {\n chunks_started = true\n try {\n await cfg.dispatcher.dispatch(chunk)\n } catch (err: unknown) {\n internal_controller.abort()\n throw err\n }\n }\n const { system, messages } = split_leading_system_messages(args.messages)\n const req: TurnRequest = {\n step_index: args.step_index,\n messages,\n tools: args.tools,\n abort: internal_controller.signal,\n stream: args.stream,\n model_id: cfg.model_id,\n effort: cfg.effort,\n ...(system !== undefined ? { system } : {}),\n ...(cfg.schema !== undefined ? { schema: cfg.schema } : {}),\n ...(cfg.provider_options !== undefined\n ? { provider_options: cfg.provider_options }\n : {}),\n ...(cfg.temperature !== undefined ? { temperature: cfg.temperature } : {}),\n ...(cfg.max_tokens !== undefined ? { max_tokens: cfg.max_tokens } : {}),\n ...(cfg.top_p !== undefined ? { top_p: cfg.top_p } : {}),\n ...(args.stream ? { dispatch_chunk } : {}),\n }\n try {\n return await cfg.adapter.invoke_turn(req)\n } finally {\n // The finally is listener cleanup only: with { once: true } the listener\n // self-removes on fire and the composed turn_abort is attempt-scoped, so\n // an emptied finally or an empty event name here leaks nothing\n // observable (the BlockStatement survivor is a documented equivalent).\n // Stryker disable next-line StringLiteral: unobservable cleanup, see above.\n turn_abort.removeEventListener('abort', cancel_on_turn_abort)\n }\n }\n\n return await retry_turn(\n call_once,\n args,\n () => chunks_started,\n cfg.retry_policy,\n classify,\n cfg.turn_timeout_ms,\n )\n }\n}\n\n/**\n * Resolve the provider name: per-call, then the engine default, then the sole\n * configured adapter, then 'anthropic'.\n */\nfunction resolve_provider<T>(\n opts_in: GenerateOptions<T>,\n engine: EngineInternals,\n): string {\n const sole_provider =\n engine.adapters.size === 1 ? [...engine.adapters.keys()][0] : undefined\n return opts_in.provider ?? engine.default_provider ?? sole_provider ?? 'anthropic'\n}\n\n/**\n * Resolve the model/provider pair for one call and freeze the resolved\n * options view.\n *\n * The model must resolve (per-call, then engine default) or the call cannot\n * proceed. Engine-default provider_options merge under per-call ones here so\n * every transport downstream sees a single already-merged view instead of\n * re-merging per branch.\n */\nfunction resolve_target<T>(\n opts_in: GenerateOptions<T>,\n engine: EngineInternals,\n): { opts: GenerateOptions<T>; target: ResolvedModel } {\n const resolved_model = opts_in.model ?? engine.default_model\n if (resolved_model === undefined) throw new model_required_error()\n const resolved_provider = resolve_provider(opts_in, engine)\n\n const merged_provider_options = merge_provider_options(\n engine.default_provider_options,\n opts_in.provider_options,\n )\n\n const opts: GenerateOptions<T> = {\n ...opts_in,\n model: resolved_model,\n provider: resolved_provider,\n }\n if (opts_in.system === undefined && engine.default_system !== undefined) {\n opts.system = engine.default_system\n }\n if (merged_provider_options !== undefined) {\n opts.provider_options = merged_provider_options\n }\n return {\n opts,\n target: { provider: resolved_provider, model_id: resolved_model },\n }\n}\n\n/**\n * Reject a call that uses a capability the resolved adapter does not\n * implement. Checked up front, before any transport work, so the failure is a\n * typed capability error rather than a mid-call provider rejection.\n */\nfunction assert_capabilities<T>(\n adapter: AiSdkProviderAdapter | NativeProviderAdapter,\n provider: string,\n opts: GenerateOptions<T>,\n tools_list: ReadonlyArray<Tool>,\n on_chunk_provided: boolean,\n): void {\n if (opts.schema !== undefined && !adapter.supports('schema')) {\n throw new provider_capability_error(provider, 'schema')\n }\n if (tools_list.length > 0 && !adapter.supports('tools')) {\n throw new provider_capability_error(provider, 'tools')\n }\n if (on_chunk_provided && !adapter.supports('streaming')) {\n throw new provider_capability_error(provider, 'streaming')\n }\n}\n\ntype TurnConfig = {\n readonly effort: EffortLevel\n readonly retry_policy: RetryPolicy\n readonly turn_timeout_ms: number | undefined\n}\n\n/**\n * Resolve the per-turn knobs (effort, retry policy, turn timeout) against\n * engine defaults. Validated here, before any transport is built, so a bad\n * budget fails as a config error, never as a spurious timeout.\n */\nfunction resolve_turn_config<T>(\n opts: GenerateOptions<T>,\n engine: EngineInternals,\n): TurnConfig {\n const effort: EffortLevel = opts.effort ?? engine.default_effort\n const retry_policy = opts.retry ?? engine.default_retry\n const turn_timeout_ms = opts.turn_timeout_ms ?? engine.default_turn_timeout_ms\n if (turn_timeout_ms !== undefined && turn_timeout_ms <= 0) {\n // A zero/negative budget would fire the deadline before the request even\n // starts; reject rather than silently disable or hang.\n throw new engine_config_error('turn_timeout_ms must be > 0')\n }\n return { effort, retry_policy, turn_timeout_ms }\n}\n\ntype LoopLimits = {\n readonly max_steps: number\n readonly tool_error_policy: 'feed_back' | 'throw'\n readonly schema_repair_attempts: number\n readonly salvage_budget: { remaining: number } | undefined\n readonly max_tool_calls_per_step: number | undefined\n}\n\n/**\n * Resolve the tool-call salvage budget. Returned as a holder rather than a\n * count: one holder per generate call so schema-repair re-invocations of the\n * loop cannot refill the salvage budget. undefined disables salvage.\n */\nfunction resolve_salvage_budget<T>(\n opts: GenerateOptions<T>,\n engine: EngineInternals,\n): { remaining: number } | undefined {\n const tool_call_repair_attempts =\n opts.tool_call_repair_attempts ?? engine.default_tool_call_repair_attempts ?? 0\n if (tool_call_repair_attempts < 0) {\n throw new engine_config_error('tool_call_repair_attempts must be >= 0')\n }\n return tool_call_repair_attempts > 0\n ? { remaining: tool_call_repair_attempts }\n : undefined\n}\n\n/**\n * Resolve the loop-level limits and policies against engine defaults,\n * rejecting configurations the tool loop cannot honor.\n */\nfunction resolve_loop_limits<T>(\n opts: GenerateOptions<T>,\n engine: EngineInternals,\n): LoopLimits {\n const max_steps = opts.max_steps ?? engine.default_max_steps\n const tool_error_policy =\n // Stryker disable next-line StringLiteral: run_tool_loop treats any non-'throw' policy as feed_back, so '' and 'feed_back' resolve to identical behavior.\n opts.tool_error_policy ?? engine.default_tool_error_policy ?? 'feed_back'\n const schema_repair_attempts =\n opts.schema_repair_attempts ?? engine.default_schema_repair_attempts ?? 1\n const salvage_budget = resolve_salvage_budget(opts, engine)\n const max_tool_calls_per_step =\n opts.max_tool_calls_per_step ?? engine.default_max_tool_calls_per_step\n if (max_tool_calls_per_step !== undefined && max_tool_calls_per_step < 1) {\n // A cap of 0 would drop every call and strand the loop in its stop\n // branch with orphaned records; reject rather than guess.\n throw new engine_config_error('max_tool_calls_per_step must be >= 1')\n }\n return {\n max_steps,\n tool_error_policy,\n schema_repair_attempts,\n salvage_budget,\n max_tool_calls_per_step,\n }\n}\n\ntype AiSdkTransportConfig<T> = {\n readonly adapter: AiSdkProviderAdapter\n readonly target: ResolvedModel\n readonly opts: GenerateOptions<T>\n readonly effort: EffortLevel\n readonly retry_policy: RetryPolicy\n readonly turn_timeout_ms: number | undefined\n readonly dispatcher: ChunkDispatcher\n readonly tools_list: ReadonlyArray<Tool>\n readonly trajectory: TrajectoryLogger | undefined\n readonly telemetry: AiSdkTelemetrySettings | undefined\n}\n\n/**\n * Build the ai_sdk-transport InvokeOnce for one call: translate effort, merge\n * provider options, load the SDK seam, and wrap it in the engine-owned retry\n * via build_ai_sdk_invoke.\n */\nasync function build_ai_sdk_transport<T>(\n cfg: AiSdkTransportConfig<T>,\n): Promise<InvokeOnce> {\n const { adapter, opts, effort } = cfg\n const effort_translation = adapter.translate_effort(effort)\n // Stryker disable next-line LogicalOperator,StringLiteral: no adapter reports effort_ignored for effort 'none', so && vs || and 'none' vs '' cannot change whether this records (the ConditionalExpression twins are covered by the effort tests).\n if (effort !== 'none' && effort_translation.effort_ignored) {\n record_effort_ignored(cfg.trajectory, cfg.target.model_id)\n }\n // Effort translation is the lowest-precedence layer; engine defaults and\n // per-call provider_options (already merged into opts.provider_options, with\n // per-call winning) override it. Without this merge the user's provider_options\n // were computed then dropped, a silent no-op for every provider.\n const combined_provider_options = merge_provider_options(\n effort_translation.provider_options,\n opts.provider_options,\n )\n const provider_options =\n combined_provider_options !== undefined &&\n Object.keys(combined_provider_options).length > 0\n ? combined_provider_options\n : undefined\n\n // All SDK specifics (message/tool mapping, Output.object structured-output\n // gating, the generateText/streamText call) live behind create_ai_sdk_turn;\n // this builder only threads resolved options through the seam.\n //\n // Imported here rather than at the top of the file because that static edge\n // was the one thing that made `ai` mandatory for every consumer: loading it\n // inside the ai_sdk branch keeps it off the graph of a native-transport\n // install. The module resolves once per process and is cached thereafter,\n // so the cost falls on the first ai_sdk call only. On failure this rethrows\n // via missing_peer_error naming `ai` (the peer this module's own static\n // `from 'ai'` import reaches for), not a raw module-resolution error\n // naming this local path.\n let ai_sdk_invoke_mod: typeof import('./providers/ai_sdk/invoke.js')\n try {\n ai_sdk_invoke_mod = await import('./providers/ai_sdk/invoke.js')\n } catch (err: unknown) {\n throw missing_peer_error('ai', err)\n }\n const { create_ai_sdk_turn } = ai_sdk_invoke_mod\n return build_ai_sdk_invoke({\n invoke_turn: create_ai_sdk_turn({\n adapter,\n model_id: cfg.target.model_id,\n dispatcher: cfg.dispatcher,\n tools: cfg.tools_list,\n schema: opts.schema,\n // The merge produces the two-level per-provider shape the seam\n // declares; the merged value is typed loosely upstream.\n // eslint-disable-next-line typescript-eslint/no-unsafe-type-assertion\n provider_options: provider_options as AiSdkTurnConfig['provider_options'],\n temperature: opts.temperature,\n max_tokens: opts.max_tokens,\n top_p: opts.top_p,\n telemetry: cfg.telemetry,\n }),\n retry_policy: cfg.retry_policy,\n turn_timeout_ms: cfg.turn_timeout_ms,\n })\n}\n\n/**\n * Build the message list one generate call starts from. When a schema is set,\n * the JSON-only instruction folds into the existing system message (or is\n * prepended as one) so the model sees it exactly once, wherever the system\n * prompt came from.\n */\nfunction build_prompt_messages<T>(opts: GenerateOptions<T>): Message[] {\n const schema_prefix =\n opts.schema !== undefined\n ? 'You must respond with a single JSON value that conforms to the expected schema. Return ONLY the JSON value, with no markdown or commentary.'\n : undefined\n const initial_messages = build_initial_messages(opts)\n if (schema_prefix !== undefined) {\n const idx = initial_messages.findIndex((m) => m.role === 'system')\n if (idx >= 0) {\n const sys = initial_messages[idx]\n // Stryker disable next-line OptionalChaining: sys is initial_messages[idx] at a found index, so it is always a defined system Message; sys.role and sys?.role read identically.\n if (sys?.role === 'system') {\n initial_messages[idx] = {\n role: 'system',\n content: `${sys.content}\\n\\n${schema_prefix}`,\n }\n }\n } else {\n initial_messages.unshift({ role: 'system', content: schema_prefix })\n }\n }\n return initial_messages\n}\n\ntype LoopConfigInputs<T> = {\n readonly opts: GenerateOptions<T>\n readonly target: ResolvedModel\n readonly pricing: PricingTable\n readonly invoke_once: InvokeOnce\n readonly messages: Message[]\n readonly tools_list: ReadonlyArray<Tool>\n readonly trajectory: TrajectoryLogger | undefined\n readonly dispatcher: ChunkDispatcher\n readonly on_chunk_provided: boolean\n readonly limits: LoopLimits\n}\n\n/**\n * Assemble the ToolLoopConfig base shared by every loop invocation of one\n * generate call. Everything here is per-call state: the mutable transcript,\n * the pricing lookup, and the pricing_missing dedup all live for exactly one\n * call, which is what lets schema-repair re-invocations share them. The\n * conditional spreads keep optional fields absent rather than undefined for\n * exactOptionalPropertyTypes.\n */\nfunction build_loop_config<T>(\n cfg: LoopConfigInputs<T>,\n): Omit<ToolLoopConfig, 'step_index_start'> {\n const { opts, target, limits } = cfg\n const abort = opts.abort ?? new AbortController().signal\n const resolve_pricing = (): Pricing | undefined => {\n return cfg.pricing[pricing_key(target.provider, target.model_id)]\n }\n const dispatch_chunk =\n cfg.on_chunk_provided\n ? async (chunk: StreamChunk): Promise<void> => {\n await cfg.dispatcher.dispatch(chunk)\n }\n : undefined\n return {\n invoke_once: cfg.invoke_once,\n messages: cfg.messages,\n tools: cfg.tools_list,\n max_steps: limits.max_steps,\n tool_error_policy: limits.tool_error_policy,\n abort,\n on_tool_approval: opts.on_tool_approval,\n trajectory: cfg.trajectory,\n stream: cfg.on_chunk_provided,\n dispatch_chunk,\n provider: target.provider,\n model_id: target.model_id,\n resolve_pricing,\n pricing_dedup: create_pricing_missing_dedup(cfg.trajectory),\n ...(limits.salvage_budget !== undefined\n ? { salvage_budget: limits.salvage_budget }\n : {}),\n ...(limits.max_tool_calls_per_step !== undefined\n ? { max_tool_calls_per_step: limits.max_tool_calls_per_step }\n : {}),\n ...(opts.prepare_step !== undefined ? { prepare_step: opts.prepare_step } : {}),\n }\n}\n\ntype SchemaStepConfig<T> = {\n readonly schema: NonNullable<GenerateOptions<T>['schema']>\n readonly text: string\n readonly trajectory: TrajectoryLogger | undefined\n readonly attempt: 'initial' | 'repair'\n readonly can_repair: boolean\n}\n\ntype SchemaStepOutcome<T> =\n | { readonly parsed: { readonly value: T } }\n | { readonly repair_message: Message }\n\n/**\n * One schema-validation pass over the loop's final text. A successful parse\n * returns the value in a holder (a schema can legitimately validate to\n * undefined, which must stay distinguishable from \"nothing parsed\"). A failed\n * parse records the trajectory event first, then either throws (`can_repair`\n * false: the repair or step budget is spent) or hands back the repair message\n * to append before re-invoking the loop.\n */\nasync function parse_schema_step<T>(\n cfg: SchemaStepConfig<T>,\n): Promise<SchemaStepOutcome<T>> {\n const parse = await parse_with_schema(cfg.schema, cfg.text)\n if (parse.ok) return { parsed: { value: parse.value } }\n record_schema_validation_failed(cfg.trajectory, {\n attempt: cfg.attempt,\n schema_issues: format_schema_issues(parse.issues),\n raw_text: cfg.text,\n })\n if (!cfg.can_repair) throw_schema_validation(parse.issues, cfg.text)\n return { repair_message: build_repair_message(parse.issues) }\n}\n\ntype GenerateLoopConfig<T> = {\n readonly base: Omit<ToolLoopConfig, 'step_index_start'>\n readonly schema: GenerateOptions<T>['schema']\n readonly schema_repair_attempts: number\n}\n\ntype GenerateLoopOutcome<T> = {\n readonly steps: GenerateResult<T>['steps']\n readonly tool_calls: GenerateResult<T>['tool_calls']\n readonly text: string\n readonly finish_reason: FinishReason\n readonly content_parsed: { value: T } | undefined\n}\n\n/**\n * Drive run_tool_loop to a final answer, re-invoking it for schema repair.\n *\n * Without a schema this is a single loop invocation. With one, the final text\n * must parse: a non-'stop' finish reason means no validated value can exist\n * (a content filter, the token limit, the step cap), so this throws\n * incomplete_generation_error rather than returning unchecked text; a failed\n * parse appends the repair message to the shared transcript and re-enters the\n * loop until the response parses, repair attempts run out, or max_steps is\n * reached. step_index_start advances by the accumulated step count so step\n * indices stay call-global across re-invocations.\n */\nasync function run_generate_loop<T>(\n cfg: GenerateLoopConfig<T>,\n): Promise<GenerateLoopOutcome<T>> {\n const { base, schema } = cfg\n const steps_accum: GenerateResult<T>['steps'] = []\n const tool_calls_accum: GenerateResult<T>['tool_calls'] = []\n // Stryker disable next-line StringLiteral: text is overwritten by loop_result.text on the first (guaranteed) loop iteration before it is ever read.\n let text = ''\n // Stryker disable next-line StringLiteral: finish_reason is overwritten by loop_result.finish_reason before it is read.\n let finish_reason: FinishReason = 'stop'\n let repair_remaining = cfg.schema_repair_attempts\n // A holder rather than a bare `T | undefined`: a schema can legitimately\n // validate to undefined (a `.transform()` or `.catch()` that returns it), and\n // that has to stay distinguishable from \"nothing parsed\".\n let content_parsed: { value: T } | undefined\n\n while (true) {\n const loop_result = await run_tool_loop({\n ...base,\n step_index_start: steps_accum.length,\n })\n for (const s of loop_result.steps) steps_accum.push(s)\n for (const tc of loop_result.tool_calls) tool_calls_accum.push(tc)\n text = loop_result.text\n finish_reason = loop_result.finish_reason\n\n if (schema === undefined) break\n if (finish_reason !== 'stop') {\n throw new incomplete_generation_error(\n finish_reason,\n text,\n last_provider_reported(steps_accum),\n )\n }\n const schema_step = await parse_schema_step<T>({\n schema,\n text,\n trajectory: base.trajectory,\n attempt: repair_remaining === cfg.schema_repair_attempts ? 'initial' : 'repair',\n can_repair: repair_remaining > 0 && steps_accum.length < base.max_steps,\n })\n if ('parsed' in schema_step) {\n content_parsed = schema_step.parsed\n break\n }\n repair_remaining -= 1\n base.messages.push(schema_step.repair_message)\n }\n\n return {\n steps: steps_accum,\n tool_calls: tool_calls_accum,\n text,\n finish_reason,\n content_parsed,\n }\n}\n\n/**\n * Fold the loop outcome into the caller-facing GenerateResult: usage and cost\n * aggregate across every step (schema-repair re-invocations included), the\n * content is the parsed holder's value when a schema ran, and cost /\n * provider_reported attach only when a step actually reported them.\n */\nfunction assemble_result<T>(\n outcome: GenerateLoopOutcome<T>,\n target: ResolvedModel,\n): GenerateResult<T> {\n const aggregated_usage = sum_usage(outcome.steps)\n const aggregated_cost = aggregate_cost(outcome.steps, target.provider)\n\n let final_content: T\n if (outcome.content_parsed !== undefined) {\n final_content = outcome.content_parsed.value\n } else {\n // No schema, so there is nothing to validate and the raw text is the\n // content. A schema call cannot arrive here: the loop either filled the\n // holder or threw.\n // oxlint-disable-next-line typescript-eslint/no-unsafe-type-assertion\n final_content = outcome.text as T\n }\n\n const result: GenerateResult<T> = {\n content: final_content,\n tool_calls: outcome.tool_calls,\n steps: outcome.steps,\n usage: aggregated_usage,\n finish_reason: outcome.finish_reason,\n model_resolved: { provider: target.provider, model_id: target.model_id },\n }\n if (aggregated_cost !== undefined) result.cost = aggregated_cost\n const aggregated_reported = last_provider_reported(outcome.steps)\n if (aggregated_reported !== undefined) result.provider_reported = aggregated_reported\n return result\n}\n\n/**\n * Resolve a `generate` call's options against engine defaults, run the tool\n * loop, and return the aggregated result.\n *\n * A provider whose adapter is `external` (`adapter.kind === 'external'`)\n * delegates the whole call to `adapter.generate` before any of the logic\n * below runs. For `ai_sdk` and native adapters, this function resolves\n * model, provider, system prompt, and `provider_options` against engine\n * defaults, checks the adapter supports every capability the call actually\n * uses (schema, tools, streaming), builds the `InvokeOnce` closure for the\n * resolved transport, and drives it through `run_tool_loop`. When a schema\n * is set and the model's output fails validation, it appends a repair\n * message and re-invokes the loop, until the response parses, repair\n * attempts run out, or `max_steps` is reached. When a schema is set and the\n * loop finishes for any reason other than `'stop'` (a content filter, the\n * token limit, the step cap), no validated value can exist, so it throws\n * `incomplete_generation_error` carrying the finish reason, the raw text,\n * and the last `provider_reported` payload rather than returning unchecked\n * text. Without a schema those finish reasons return normally.\n */\nexport async function generate<T = string>(\n opts_in: GenerateOptions<T>,\n engine: EngineInternals,\n): Promise<GenerateResult<T>> {\n if (opts_in.abort?.aborted === true) {\n throw new aborted_error('aborted', { reason: opts_in.abort.reason })\n }\n\n const { opts, target } = resolve_target(opts_in, engine)\n\n const adapter = engine.adapters.get(target.provider)\n if (adapter === undefined) {\n throw new provider_not_configured_error(target.provider)\n }\n\n if (adapter.kind === 'external') {\n return adapter.generate<T>(opts, target)\n }\n\n // Stamp engine events with `ts` when generate is called directly with a\n // caller-supplied logger. A runner-decorated logger already carries `ts`;\n // with_timestamps preserves it.\n const trajectory = with_timestamps(opts.trajectory)\n const on_chunk_provided = opts.on_chunk !== undefined\n const tools_list: ReadonlyArray<Tool> = opts.tools ?? []\n\n assert_capabilities(adapter, target.provider, opts, tools_list, on_chunk_provided)\n\n const turn = resolve_turn_config(opts, engine)\n const dispatcher = create_chunk_dispatcher(opts.on_chunk)\n\n let invoke_once: InvokeOnce\n if (adapter.kind === 'ai_sdk') {\n invoke_once = await build_ai_sdk_transport({\n adapter,\n target,\n opts,\n effort: turn.effort,\n retry_policy: turn.retry_policy,\n turn_timeout_ms: turn.turn_timeout_ms,\n dispatcher,\n tools_list,\n trajectory,\n telemetry: engine.default_ai_sdk_telemetry,\n })\n } else {\n // No effort translation here: a native adapter receives the resolved\n // effort level on TurnRequest and owns its own mapping, so\n // provider_options stays the plain defaults + per-call merge.\n invoke_once = build_native_invoke({\n adapter,\n model_id: target.model_id,\n retry_policy: turn.retry_policy,\n turn_timeout_ms: turn.turn_timeout_ms,\n dispatcher,\n effort: turn.effort,\n schema: opts.schema,\n // The merge produces the two-level per-provider shape TurnRequest\n // declares; GenerateOptions types it loosely as Record<string, unknown>.\n // eslint-disable-next-line typescript-eslint/no-unsafe-type-assertion\n provider_options: opts.provider_options as TurnRequest['provider_options'],\n temperature: opts.temperature,\n max_tokens: opts.max_tokens,\n top_p: opts.top_p,\n })\n }\n\n const limits = resolve_loop_limits(opts, engine)\n const initial_messages = build_prompt_messages(opts)\n\n const generate_span = start_generate_span(trajectory, {\n model: target.model_id,\n provider: target.provider,\n model_id: target.model_id,\n has_tools: tools_list.length > 0,\n has_schema: opts.schema !== undefined,\n streaming: on_chunk_provided,\n })\n\n const base = build_loop_config({\n opts,\n target,\n pricing: engine.pricing,\n invoke_once,\n messages: [...initial_messages],\n tools_list,\n trajectory,\n dispatcher,\n on_chunk_provided,\n limits,\n })\n\n try {\n const outcome = await run_generate_loop<T>({\n base,\n schema: opts.schema,\n schema_repair_attempts: limits.schema_repair_attempts,\n })\n const result = assemble_result(outcome, target)\n\n if (on_chunk_provided) {\n await dispatcher.dispatch({\n kind: 'finish',\n finish_reason: outcome.finish_reason,\n usage: result.usage,\n })\n }\n\n end_generate_span(trajectory, generate_span, {\n usage: result.usage,\n finish_reason: outcome.finish_reason,\n model_resolved: result.model_resolved,\n })\n return result\n } catch (err: unknown) {\n const message = err instanceof Error ? err.message : String(err)\n end_generate_span(trajectory, generate_span, { error: message })\n throw err\n }\n}\n\n/**\n * Round `v` to 6 decimal places, the resolution used for the USD cost fields.\n */\nexport function round6(v: number): number {\n return Math.round(v * 1e6) / 1e6\n}\n\n/**\n * Pick the call-level `provider_reported` from the step records: the payload of\n * the last step that reported one.\n *\n * Provider payloads are opaque, so unlike usage and cost there is nothing to\n * sum and no safe way to merge two turns' keys (a provider reports the same keys\n * every turn, so merging would silently overwrite rather than combine). Taking\n * the final reporting turn matches how `content` and `finish_reason` are drawn\n * from the last turn; every turn's own payload stays on `steps[i]`.\n */\nexport function last_provider_reported(\n steps: ReadonlyArray<GenerateResult['steps'][number]>,\n): Record<string, unknown> | undefined {\n return steps.findLast((s) => s.provider_reported !== undefined)?.provider_reported\n}\n\n/**\n * Running totals accumulated across per-step cost breakdowns. Each optional\n * field carries a `_present` flag so the final breakdown can include it only\n * when at least one step reported it, distinct from a summed zero.\n */\ninterface CostAccumulator {\n any_present: boolean\n total: number\n input: number\n output: number\n cached_present: boolean\n cached: number\n cache_write_present: boolean\n cache_write: number\n reasoning_present: boolean\n reasoning: number\n}\n\n/**\n * Fold every step's `cost` into a single {@link CostAccumulator}, skipping steps\n * that reported none. The required fields always sum; each optional field sums\n * and flips its `_present` flag only on the steps that carried it.\n */\nfunction sum_step_costs(\n steps: ReadonlyArray<GenerateResult['steps'][number]>,\n): CostAccumulator {\n const acc: CostAccumulator = {\n any_present: false,\n total: 0,\n input: 0,\n output: 0,\n cached_present: false,\n cached: 0,\n cache_write_present: false,\n cache_write: 0,\n reasoning_present: false,\n reasoning: 0,\n }\n for (const s of steps) {\n if (s.cost === undefined) continue\n acc.any_present = true\n acc.total += s.cost.total_usd\n acc.input += s.cost.input_usd\n acc.output += s.cost.output_usd\n if (s.cost.cached_input_usd !== undefined) {\n acc.cached_present = true\n acc.cached += s.cost.cached_input_usd\n }\n if (s.cost.cache_write_usd !== undefined) {\n acc.cache_write_present = true\n acc.cache_write += s.cost.cache_write_usd\n }\n if (s.cost.reasoning_usd !== undefined) {\n acc.reasoning_present = true\n acc.reasoning += s.cost.reasoning_usd\n }\n }\n return acc\n}\n\n/**\n * Sum per-step cost breakdowns into a single `CostBreakdown` for the whole\n * generate call.\n *\n * Returns `undefined` if no step reports a cost, unless `provider` is free\n * (`FREE_PROVIDERS`) and at least one step ran; in that case it returns an\n * explicit all-zero breakdown instead of omitting cost entirely. The\n * optional fields (`cached_input_usd`, `cache_write_usd`, `reasoning_usd`)\n * are included only when at least one step reported them.\n */\nexport function aggregate_cost(\n steps: ReadonlyArray<GenerateResult['steps'][number]>,\n provider: string,\n): CostBreakdown | undefined {\n const acc = sum_step_costs(steps)\n if (!acc.any_present) {\n if (FREE_PROVIDERS.has(provider) && steps.length > 0) {\n return {\n total_usd: 0,\n input_usd: 0,\n output_usd: 0,\n currency: 'USD',\n is_estimate: true,\n }\n }\n return undefined\n }\n const out: CostBreakdown = {\n total_usd: round6(acc.total),\n input_usd: round6(acc.input),\n output_usd: round6(acc.output),\n currency: 'USD',\n is_estimate: true,\n }\n if (acc.cached_present) out.cached_input_usd = round6(acc.cached)\n if (acc.cache_write_present) out.cache_write_usd = round6(acc.cache_write)\n if (acc.reasoning_present) out.reasoning_usd = round6(acc.reasoning)\n return out\n}\n\n","/**\n * Engine factory.\n *\n * `create_engine` validates each provider entry at construction, merges user\n * pricing over DEFAULT_PRICING into a per-instance table, and returns an\n * Engine whose methods close over this instance state. Model resolution is a\n * verbatim pass-through: `model` is sent to the provider unchanged.\n */\n\nimport type {\n Engine,\n EngineConfig,\n EngineDefaults,\n GenerateOptions,\n GenerateResult,\n Pricing,\n PricingTable,\n ProviderConfigMap,\n} from './types.js'\nimport { DEFAULT_PRICING, pricing_key } from './pricing.js'\nimport { DEFAULT_RETRY } from './retry.js'\nimport {\n engine_config_error,\n engine_disposed_error,\n} from './errors.js'\nimport { get_provider_factory, list_builtin_providers } from './providers/registry.js'\nimport type { ProviderAdapter, ProviderFactory } from './providers/types.js'\nimport { generate, type EngineInternals } from './generate.js'\n\n/**\n * Build the provider-name to adapter map from `providers`, resolving each\n * name to a `custom_providers` factory when one is supplied, or the built-in\n * registry factory otherwise.\n *\n * Each factory validates its init value synchronously, so a bad credential\n * throws here at construction time rather than later; loading the\n * underlying SDK is deferred until the first `generate` call. Throws if\n * `custom_providers` tries to shadow a built-in provider name.\n */\nfunction build_provider_adapters(\n providers: EngineConfig['providers'],\n custom_providers: EngineConfig['custom_providers'],\n): Map<string, ProviderAdapter> {\n if (custom_providers !== undefined) {\n const builtins = new Set(list_builtin_providers())\n for (const name of Object.keys(custom_providers)) {\n if (builtins.has(name)) {\n throw new engine_config_error(\n `custom_providers must not shadow built-in provider '${name}'`,\n name,\n )\n }\n }\n }\n const adapters = new Map<string, ProviderAdapter>()\n for (const [name, init] of Object.entries(providers)) {\n if (init === undefined) continue\n const custom =\n custom_providers !== undefined && Object.hasOwn(custom_providers, name)\n ? custom_providers[name]\n : undefined\n const factory = custom ?? get_provider_factory(name)\n const adapter = factory(init)\n adapters.set(name, adapter)\n }\n return adapters\n}\n\n/**\n * Mutable draft of a deeply `readonly` type, used to assemble an object field\n * by field before returning it under its public, frozen-looking type.\n */\ntype Writable<T> = { -readonly [K in keyof T]: T[K] }\n\n/**\n * Seed a fresh, mutable pricing table from DEFAULT_PRICING and layer any\n * per-engine `config.pricing` overrides on top.\n *\n * The result is the engine's own table: register_price mutates it in place,\n * and DEFAULT_PRICING (frozen at module load) is never touched.\n */\nfunction merge_pricing(overrides: EngineConfig['pricing']): Record<string, Pricing> {\n const pricing: Record<string, Pricing> = { ...DEFAULT_PRICING }\n if (overrides !== undefined) {\n for (const [key, value] of Object.entries(overrides)) {\n pricing[key] = value\n }\n }\n return pricing\n}\n\n/**\n * Resolve the three always-present scalar defaults.\n *\n * `config.defaults.*` is the current nested layer; `config.default_retry`,\n * `config.default_effort`, and `config.default_max_steps` are older top-level\n * fields kept for compatibility. The nested value wins where both are set, and\n * the built-in constant is the last resort.\n */\nfunction resolve_default_scalars(\n config: EngineConfig,\n): Pick<EngineInternals, 'default_retry' | 'default_effort' | 'default_max_steps'> {\n const defaults: EngineDefaults = config.defaults ?? {}\n return {\n default_retry: defaults.retry_policy ?? config.default_retry ?? DEFAULT_RETRY,\n default_effort: defaults.effort ?? config.default_effort ?? 'none',\n default_max_steps: defaults.max_steps ?? config.default_max_steps ?? 10,\n }\n}\n\n/**\n * Validate the numeric defaults once, at construction: a bad bound should fail\n * fast here rather than surfacing deep inside the first generate call that ends\n * up using the default.\n */\nfunction validate_numeric_defaults(defaults: EngineDefaults | undefined): void {\n if (defaults === undefined) return\n const { tool_call_repair_attempts, max_tool_calls_per_step, turn_timeout_ms } = defaults\n if (tool_call_repair_attempts !== undefined && tool_call_repair_attempts < 0) {\n throw new engine_config_error('defaults.tool_call_repair_attempts must be >= 0')\n }\n if (max_tool_calls_per_step !== undefined && max_tool_calls_per_step < 1) {\n throw new engine_config_error('defaults.max_tool_calls_per_step must be >= 1')\n }\n if (turn_timeout_ms !== undefined && turn_timeout_ms <= 0) {\n throw new engine_config_error('defaults.turn_timeout_ms must be > 0')\n }\n}\n\n/**\n * Copy `value` onto `target[key]` only when it is defined, so an absent optional\n * default leaves the key off the object rather than present-as-undefined.\n */\nfunction assign_if_present<T, K extends keyof T>(target: T, key: K, value: T[K]): void {\n if (value !== undefined) target[key] = value\n}\n\n/**\n * Assemble the per-instance EngineInternals from the resolved required fields\n * plus whichever optional `defaults.*` knobs were supplied.\n *\n * The optional defaults form a fixed source-to-target table (`defaults.model` ->\n * `default_model`, and so on); each is folded in only when present, matching the\n * conditional-spread shape this replaced.\n */\nfunction build_internals(\n base: Pick<\n EngineInternals,\n 'pricing' | 'adapters' | 'default_retry' | 'default_effort' | 'default_max_steps'\n >,\n defaults: EngineDefaults | undefined,\n): EngineInternals {\n const internals: Writable<EngineInternals> = {\n pricing: base.pricing,\n adapters: base.adapters,\n default_retry: base.default_retry,\n default_effort: base.default_effort,\n default_max_steps: base.default_max_steps,\n }\n if (defaults !== undefined) {\n assign_if_present(internals, 'default_model', defaults.model)\n assign_if_present(internals, 'default_provider', defaults.provider)\n assign_if_present(internals, 'default_system', defaults.system)\n assign_if_present(internals, 'default_tool_error_policy', defaults.tool_error_policy)\n assign_if_present(internals, 'default_schema_repair_attempts', defaults.schema_repair_attempts)\n assign_if_present(\n internals,\n 'default_tool_call_repair_attempts',\n defaults.tool_call_repair_attempts,\n )\n assign_if_present(internals, 'default_max_tool_calls_per_step', defaults.max_tool_calls_per_step)\n assign_if_present(internals, 'default_turn_timeout_ms', defaults.turn_timeout_ms)\n assign_if_present(internals, 'default_ai_sdk_telemetry', defaults.ai_sdk_telemetry)\n assign_if_present(internals, 'default_provider_options', defaults.provider_options)\n }\n return internals\n}\n\n/**\n * Validate `config` and construct an `Engine`.\n *\n * Provider entries are validated synchronously via `build_provider_adapters`.\n * A `generate` call that names a provider absent from `config.providers`\n * still throws `provider_not_configured_error`, but only at call time.\n */\nexport function create_engine(config: EngineConfig): Engine {\n if (config.providers === null || typeof config.providers !== 'object') {\n throw new engine_config_error('EngineConfig.providers is required')\n }\n\n const adapters = build_provider_adapters(config.providers, config.custom_providers)\n const pricing = merge_pricing(config.pricing)\n const { default_retry, default_effort, default_max_steps } = resolve_default_scalars(config)\n validate_numeric_defaults(config.defaults)\n\n const get_internals = (): EngineInternals =>\n build_internals(\n { pricing, adapters, default_retry, default_effort, default_max_steps },\n config.defaults,\n )\n\n let disposed = false\n let dispose_promise: Promise<void> | undefined\n\n const engine: Engine = {\n generate<t = string>(opts: GenerateOptions<t>): Promise<GenerateResult<t>> {\n if (disposed) throw new engine_disposed_error()\n return generate<t>(opts, get_internals())\n },\n register_price(provider: string, model_id: string, value: Pricing): void {\n pricing[pricing_key(provider, model_id)] = value\n },\n resolve_price(provider: string, model_id: string): Pricing | undefined {\n return pricing[pricing_key(provider, model_id)]\n },\n list_prices(): PricingTable {\n // Defensive shallow copy: mutating the returned object does not affect\n // engine state.\n return { ...pricing }\n },\n with_providers(\n providers: ProviderConfigMap,\n custom_providers?: Record<string, ProviderFactory>,\n ): Engine {\n // Derives a NEW engine from the retained construction config:\n // `providers`/`custom_providers` shallow-merge by name over the\n // originals, the merged config is re-validated by a recursive\n // create_engine call (same validation, fresh adapters, independent\n // disposal), and this engine is left untouched. This is the\n // value-semantic way to add providers at runtime, not a mutable\n // registry.\n //\n // Since `...config` below already carries `config.custom_providers`\n // forward unconditionally, this merge only changes the result when the\n // `custom_providers` ARGUMENT contributes entries. That leaves a cluster of\n // genuine equivalents as documented survivors here, all rooted in the left\n // disjunct being redundant: mutating `config.custom_providers !== undefined`\n // (to `false`, or `!==` to `===`) only swaps `merged_custom` between\n // `undefined`, `{}`, and a shallow copy of `config.custom_providers`, and\n // given `...config` those build identical adapters; forcing the whole\n // condition true likewise yields `{}` for `undefined` when both are absent;\n // and forcing the spread-in below on always passes the `undefined` \"no\n // customs\" sentinel. A Stryker-disable can't fence these off: on the same\n // lines the whole-condition `false` and the right-disjunct mutants DO change\n // behavior, they drop a supplied argument, and the suite kills those.\n const merged_custom =\n config.custom_providers !== undefined || custom_providers !== undefined\n ? { ...config.custom_providers, ...custom_providers }\n : undefined\n return create_engine({\n ...config,\n providers: { ...config.providers, ...providers },\n ...(merged_custom !== undefined ? { custom_providers: merged_custom } : {}),\n })\n },\n dispose(): Promise<void> {\n if (dispose_promise !== undefined) return dispose_promise\n disposed = true\n // Stryker disable next-line ArrayDeclaration: seeding this accumulator\n // non-empty is observationally identical: every element is awaited by\n // the Promise.all below and then discarded by `.then(() => undefined)`,\n // so a stray value cannot change what dispose() resolves to or when.\n const tasks: Promise<void>[] = []\n for (const adapter of adapters.values()) {\n // Any adapter kind may hold resources: external always defines\n // dispose, native optionally (keep-alive agents, connection pools).\n if ('dispose' in adapter && adapter.dispose !== undefined) {\n tasks.push(adapter.dispose())\n }\n }\n dispose_promise = Promise.all(tasks).then(() => undefined)\n return dispose_promise\n },\n }\n\n return engine\n}\n","/**\n * model_call: the single sanctioned bridge between the composition and\n * engine layers.\n *\n * This is the only file under `src/` permitted to import value symbols from\n * both `core` and `engine` (enforced by the model-call-is-sole-bridge\n * ast-grep rule in `rules/`).\n *\n * The returned Step auto-threads ctx.abort, ctx.trajectory, and, only when\n * run.stream is driving, an on_chunk forwarder that records each chunk as a\n * `model_chunk` trajectory event. Callers cannot override these: the\n * composition layer owns cancellation and trajectory plumbing. Cost events\n * flow out via ctx.trajectory per the engine's own emission rules.\n */\n\nimport { createHash } from 'node:crypto'\nimport { aborted_error, step } from '#core'\nimport type { RunContext, Step, TrajectoryLogger } from '#core'\nimport type {\n EffortLevel,\n Engine,\n GenerateOptions,\n GenerateResult,\n Message,\n RetryPolicy,\n Tool,\n ToolApprovalHandler,\n} from '#engine'\nimport type { ToolSchema } from '#schema'\n\nexport type ModelCallInput = string | ReadonlyArray<Message>\n\nexport type ModelCallConfig<T = string, projected = GenerateResult<T>> = {\n readonly engine: Engine\n /**\n * Model or alias string. Optional: if omitted, the engine's\n * `defaults.model` is used. Errors at call time if neither is set.\n */\n readonly model?: string\n /**\n * Transport for the model: `anthropic` | `claude_cli` | `openrouter` | ...\n * Optional: if omitted, the engine's `defaults.provider` (or sole configured\n * provider, else `anthropic`) is used.\n */\n readonly provider?: string\n readonly id?: string\n readonly system?: string\n readonly tools?: ReadonlyArray<Tool>\n readonly schema?: ToolSchema<T>\n readonly effort?: EffortLevel\n readonly max_steps?: number\n readonly provider_options?: Record<string, unknown>\n readonly retry_policy?: RetryPolicy\n readonly tool_error_policy?: 'feed_back' | 'throw'\n readonly schema_repair_attempts?: number\n readonly tool_call_repair_attempts?: number\n readonly max_tool_calls_per_step?: number\n readonly on_tool_approval?: ToolApprovalHandler\n /**\n * Map the `GenerateResult` envelope into the step's output at the source.\n * The projection runs inside the model_call step itself, so `describe` and\n * the trajectory gain no wrapper node. Omitted, the envelope is the output.\n * `model_step` is this option preset to `(r) => r.content`.\n */\n readonly project?: (r: GenerateResult<T>) => projected\n}\n\n/**\n * Wrap the run's trajectory so the engine's own spans (engine.generate and its\n * step spans) nest under the model_call step rather than floating. The wrapper\n * keeps a private span stack seeded with the model_call step's id, so nesting\n * is correct and concurrency-safe even when several model_calls run together\n * under `parallel`/`map` (each invocation builds its own wrapper). A\n * caller-supplied `parent_span_id` is never overridden.\n */\nfunction engine_trajectory(\n inner: TrajectoryLogger,\n root_parent: string | undefined,\n): TrajectoryLogger {\n const stack: string[] = root_parent !== undefined ? [root_parent] : []\n return {\n record: (event) => {\n inner.record(event)\n },\n start_span: (name, meta) => {\n const has_parent = meta !== undefined && 'parent_span_id' in meta\n const parent = stack.length > 0 ? stack[stack.length - 1] : undefined\n const next_meta =\n has_parent || parent === undefined ? meta : { ...meta, parent_span_id: parent }\n const id = inner.start_span(name, next_meta)\n stack.push(id)\n return id\n },\n end_span: (id, meta) => {\n inner.end_span(id, meta)\n const idx = stack.lastIndexOf(id)\n if (idx !== -1) stack.splice(idx, 1)\n },\n }\n}\n\n/**\n * Derive a short, stable hash from the call's model, provider, system\n * prompt, and tool/schema shape.\n *\n * Used to build a default step id when the caller doesn't supply `cfg.id`.\n */\nfunction stable_signature(input: {\n model: string | undefined\n provider: string | undefined\n system: string | undefined\n has_tools: boolean\n has_schema: boolean\n}): string {\n const payload = JSON.stringify({\n model: input.model ?? null,\n provider: input.provider ?? null,\n system: input.system ?? null,\n has_tools: input.has_tools,\n has_schema: input.has_schema,\n })\n return createHash('sha256').update(payload).digest('hex').slice(0, 8)\n}\n\n/**\n * Copy `value` onto `target[key]` only when it is defined, so an absent optional\n * config field leaves the key off `GenerateOptions` rather than present-as-undefined.\n */\nfunction assign_if_present<T, K extends keyof T>(target: T, key: K, value: T[K]): void {\n if (value !== undefined) target[key] = value\n}\n\n/**\n * Translate `cfg` into a `GenerateOptions`, folding each supplied optional field\n * in via `assign_if_present`. `tools` (spread to a fresh array) and\n * `retry_policy` (renamed to `retry`) are the two fields that do not copy\n * straight across and stay explicit; the rest map name-for-name.\n */\nfunction build_generate_options<T, projected>(\n cfg: ModelCallConfig<T, projected>,\n prompt: Message[],\n ctx: RunContext,\n): GenerateOptions<T> {\n const opts: GenerateOptions<T> = {\n prompt,\n abort: ctx.abort,\n trajectory: engine_trajectory(ctx.trajectory, ctx.parent_span_id),\n }\n assign_if_present(opts, 'model', cfg.model)\n assign_if_present(opts, 'provider', cfg.provider)\n assign_if_present(opts, 'system', cfg.system)\n if (cfg.tools !== undefined) opts.tools = [...cfg.tools]\n assign_if_present(opts, 'schema', cfg.schema)\n assign_if_present(opts, 'effort', cfg.effort)\n assign_if_present(opts, 'max_steps', cfg.max_steps)\n assign_if_present(opts, 'provider_options', cfg.provider_options)\n if (cfg.retry_policy !== undefined) opts.retry = cfg.retry_policy\n assign_if_present(opts, 'tool_error_policy', cfg.tool_error_policy)\n assign_if_present(opts, 'schema_repair_attempts', cfg.schema_repair_attempts)\n assign_if_present(opts, 'tool_call_repair_attempts', cfg.tool_call_repair_attempts)\n assign_if_present(opts, 'max_tool_calls_per_step', cfg.max_tool_calls_per_step)\n assign_if_present(opts, 'on_tool_approval', cfg.on_tool_approval)\n return opts\n}\n\n/**\n * Build a `Step` that calls `cfg.engine.generate` with `cfg` translated into\n * `GenerateOptions`.\n *\n * Threads `ctx.abort` and `ctx.trajectory` (nested under the model_call\n * step's own span) into every call, and, when `run.stream` is driving,\n * records each chunk as a `model_chunk` trajectory event. `cfg.project`\n * maps the `GenerateResult` envelope into the step's output inside the same\n * step; omitted, the envelope is the output.\n */\nexport function model_call<T = string, projected = GenerateResult<T>>(\n cfg: ModelCallConfig<T, projected>,\n): Step<ModelCallInput, projected> {\n const has_tools = Boolean(cfg.tools && cfg.tools.length > 0)\n const has_schema = cfg.schema !== undefined\n // When `project` is omitted, `projected` defaults to the envelope type, which\n // is what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = cfg.project ?? ((r: GenerateResult<T>) => r as unknown as projected)\n const step_id =\n cfg.id ??\n `model_call:${stable_signature({\n model: cfg.model,\n provider: cfg.provider,\n system: cfg.system,\n has_tools,\n has_schema,\n })}`\n\n const describe_config: {\n model?: string\n provider?: string\n has_tools: boolean\n has_schema: boolean\n has_project: boolean\n system?: string\n effort?: EffortLevel\n } = {\n has_tools,\n has_schema,\n has_project: cfg.project !== undefined,\n }\n if (cfg.model !== undefined) describe_config.model = cfg.model\n if (cfg.provider !== undefined) describe_config.provider = cfg.provider\n if (cfg.system !== undefined) describe_config.system = cfg.system\n if (cfg.effort !== undefined) describe_config.effort = cfg.effort\n\n const inner = step<ModelCallInput, projected>(step_id, async (input, ctx) => {\n if (ctx.abort.aborted) {\n throw new aborted_error('aborted before model_call', {\n reason: { signal: 'abort' },\n step_index: 0,\n })\n }\n\n const prompt: Message[] =\n typeof input === 'string'\n ? [{ role: 'user', content: [{ type: 'text', text: input }] }]\n : [...input]\n\n const opts = build_generate_options(cfg, prompt, ctx)\n\n if (ctx.streaming) {\n opts.on_chunk = (chunk) => {\n // Record with kind preserved. ctx.emit would clobber kind to 'emit'\n // and bury the chunk, so stream consumers would have to un-nest a\n // generic event; recording keeps a clean top-level `model_chunk` event\n // (what docs/concepts.md already documents) carrying the StreamChunk.\n ctx.trajectory.record({ kind: 'model_chunk', step_id, chunk })\n }\n }\n\n return project(await cfg.engine.generate(opts))\n })\n\n return {\n id: inner.id,\n kind: inner.kind,\n run: (input, ctx) => inner.run(input, ctx),\n config: Object.freeze({ ...describe_config }),\n }\n}\n\n/**\n * model_step: `model_call` projected to its content.\n *\n * Returns a Step whose output is the model's final content (a `string`, or\n * the schema-validated value when `cfg.schema` is set) instead of the full\n * `GenerateResult` envelope. Use `model_step` when the flow only wants the\n * answer, keeping compositions at the `step, step, model_step, step` cadence;\n * drop to `model_call` when the caller needs usage, cost, tool calls, or\n * finish reason (or its `project` option, when the flow wants a slice of the\n * envelope mapped at the source).\n *\n * Implemented as `model_call` with `project` preset to `(r) => r.content`,\n * so the leaf is a single node in `describe` and the trajectory. Wrapping a\n * primitive into an app-shaped helper of your own is still the extension\n * pattern; this is its smallest instance.\n */\nexport function model_step<T = string>(\n cfg: Omit<ModelCallConfig<T>, 'project'>,\n): Step<ModelCallInput, T> {\n return model_call<T, T>({ ...cfg, project: (r) => r.content })\n}\n","/**\n * Env forwarding allowlist for CLI subprocesses.\n *\n * Useful when passing explicit env to `claude_cli` under api_key mode\n * (oauth mode inherits the parent env automatically), or whenever an\n * explicit, minimal allowlist is preferred over inheriting the full parent\n * env.\n */\nconst STANDARD_KEYS = ['PATH', 'HOME', 'SHELL', 'USER', 'LOGNAME', 'LANG', 'TMPDIR'] as const\n\n/**\n * Return the standard env vars a CLI subprocess needs to reach a user's\n * logged-in session: PATH, HOME, SHELL, USER, LOGNAME, LANG, TMPDIR.\n *\n * Keys absent from `process.env` are skipped.\n *\n * @example\n * provider_options: {\n * claude_cli: { env: forward_standard_env() },\n * }\n */\nexport function forward_standard_env(): Record<string, string> {\n const out: Record<string, string> = {}\n for (const key of STANDARD_KEYS) {\n const v = process.env[key]\n if (typeof v === 'string') out[key] = v\n }\n return out\n}\n","/**\n * In-process pub/sub for trajectory events.\n *\n * One ring buffer of the last N events plus a Set of subscriber callbacks.\n * Both producers (file tail and HTTP ingest) push into the same broadcaster;\n * SSE writers fan out via `subscribe`.\n */\n\nimport type { ParsedTrajectoryEvent } from '#core'\n\nexport type BroadcastEvent = {\n readonly id: number\n readonly event: ParsedTrajectoryEvent\n}\n\nexport type Subscriber = (entry: BroadcastEvent) => void\n\nexport type Broadcaster = {\n readonly emit: (event: ParsedTrajectoryEvent) => BroadcastEvent\n readonly subscribe: (fn: Subscriber) => () => void\n readonly snapshot: () => readonly BroadcastEvent[]\n readonly snapshot_after: (last_id: number) => readonly BroadcastEvent[]\n readonly size: () => number\n}\n\nexport type BroadcasterOptions = {\n readonly buffer: number\n readonly on_subscriber_error?: (err: unknown) => void\n}\n\n/**\n * Creates a broadcaster: a bounded ring buffer plus subscriber fan-out.\n *\n * Each event gets a monotonic `id` so SSE clients can replay from a known\n * cursor on reconnect (`snapshot_after`). `emit` does not await delivery, so\n * slow-client backpressure is the subscriber's responsibility. A subscriber\n * that throws is unsubscribed, and the `on_subscriber_error` callback fires\n * once with the captured error so the server can log it.\n */\nexport function create_broadcaster(options: BroadcasterOptions): Broadcaster {\n // `| 0` truncates fractional sizes; clamp so the ring keeps at least one\n // event.\n const max = Math.max(1, options.buffer | 0)\n const ring: BroadcastEvent[] = []\n const subscribers = new Set<Subscriber>()\n let next_id = 1\n\n const emit = (event: ParsedTrajectoryEvent): BroadcastEvent => {\n const entry: BroadcastEvent = { id: next_id++, event }\n ring.push(entry)\n if (ring.length > max) ring.splice(0, ring.length - max)\n // Iterate a copy so deleting a throwing subscriber (or an unsubscribe\n // triggered from inside a callback) cannot upset the live Set.\n for (const fn of Array.from(subscribers)) {\n try {\n fn(entry)\n } catch (err) {\n subscribers.delete(fn)\n if (options.on_subscriber_error) options.on_subscriber_error(err)\n }\n }\n return entry\n }\n\n const subscribe = (fn: Subscriber): (() => void) => {\n subscribers.add(fn)\n return () => { subscribers.delete(fn) }\n }\n\n const snapshot = (): readonly BroadcastEvent[] => [...ring]\n\n const snapshot_after = (last_id: number): readonly BroadcastEvent[] =>\n ring.filter((e) => e.id > last_id)\n\n const size = (): number => ring.length\n\n return { emit, subscribe, snapshot, snapshot_after, size }\n}\n","/**\n * Tiny HTTP server: 5 routes, SSE fan-out, NDJSON ingest.\n *\n * GET / -> static viewer.html\n * GET /api/events -> text/event-stream replaying the ring buffer\n * GET /api/snapshot -> JSON dump of the ring buffer\n * POST /api/ingest -> newline-delimited trajectory events (http_logger)\n * GET /api/health -> { ok: true }\n *\n * The server owns nothing but the socket. The broadcaster owns the event\n * history; the static html lives on disk. SSE clients reconnect with\n * `Last-Event-ID` and the server replays anything past their cursor from\n * the ring buffer; older events are gone (bounded memory by design).\n */\n\nimport { createReadStream, statSync } from 'node:fs'\nimport { createServer, type IncomingMessage, type Server, type ServerResponse } from 'node:http'\nimport { dirname, resolve } from 'node:path'\nimport { fileURLToPath } from 'node:url'\nimport { parse_trajectory_event, type ParsedTrajectoryEvent } from '#core'\nimport type { Broadcaster } from './broadcast.js'\n\nconst SSE_HEARTBEAT_MS = 15_000\nconst HERE = dirname(fileURLToPath(import.meta.url))\nconst STATIC_HTML = resolve(HERE, 'static', 'viewer.html')\n\nexport type ServerOptions = {\n readonly broadcaster: Broadcaster\n readonly host: string\n readonly port: number\n readonly on_parse_error?: (err: unknown, line: string) => void\n}\n\nexport type ViewerServer = {\n readonly url: string\n readonly close: () => Promise<void>\n}\n\n/**\n * Starts the HTTP server and resolves once it is listening.\n *\n * Wires the five routes (static HTML, health, snapshot, SSE, ingest) to a\n * single request handler and resolves with the bound URL and a `close`\n * that shuts the socket down.\n */\nexport function start_server(options: ServerOptions): Promise<ViewerServer> {\n const { broadcaster, host, port, on_parse_error } = options\n\n const handler = (req: IncomingMessage, res: ServerResponse): void => {\n const route = resolve_route(req, host, port)\n\n if (route === 'GET /' || route === 'GET /index.html') {\n serve_static_html(res)\n return\n }\n if (route === 'GET /api/health') {\n send_json(res, 200, { ok: true })\n return\n }\n if (route === 'GET /api/snapshot') {\n send_json(res, 200, { events: broadcaster.snapshot() })\n return\n }\n if (route === 'GET /api/events') {\n handle_sse(req, res, broadcaster)\n return\n }\n if (route === 'POST /api/ingest') {\n handle_ingest(req, res, broadcaster, on_parse_error)\n return\n }\n res.statusCode = 404\n res.setHeader('content-type', 'application/json')\n res.end(JSON.stringify({ error: 'not_found', route }))\n }\n\n const http_server = createServer(handler)\n\n return new Promise((res_ok, res_err) => {\n // `listen` can fail (e.g. port already in use); reject instead of\n // leaving the returned promise pending forever.\n http_server.once('error', res_err)\n http_server.listen(port, host, () => {\n http_server.removeListener('error', res_err)\n // `address().port` is the port actually bound. It only differs from\n // the requested `port` when the caller passed 0 and asked the OS to\n // pick a free port.\n const addr = http_server.address()\n const bound_port =\n addr !== null && typeof addr === 'object' && 'port' in addr ? addr.port : port\n const url = `http://${host}:${bound_port}`\n res_ok({\n url,\n close: () => close_server(http_server),\n })\n })\n })\n}\n\n/**\n * Builds a `\"METHOD /path\"` route key from a request.\n *\n * Falls back to the server's own `host`/`port` when the request has no\n * `Host` header, so a malformed or missing header never throws inside\n * `new URL`.\n */\nexport function resolve_route(\n req: {\n url?: string | undefined\n method?: string | undefined\n headers: { host?: string | undefined }\n },\n host: string,\n port: number,\n): string {\n const url = new URL(req.url ?? '/', `http://${req.headers.host ?? `${host}:${port}`}`)\n return `${req.method ?? 'GET'} ${url.pathname}`\n}\n\n/**\n * Closes the HTTP server and resolves once every connection is torn down.\n */\nfunction close_server(server: Server): Promise<void> {\n return new Promise((res_ok, res_err) => {\n server.close((err) => {\n if (err) res_err(err)\n else res_ok()\n })\n // `close` alone only stops new connections and waits for existing ones\n // (including open SSE streams) to end on their own, which can hang\n // indefinitely. Force them closed so shutdown actually completes.\n server.closeAllConnections?.()\n })\n}\n\n/**\n * Writes a JSON response with the given status code.\n */\nfunction send_json(res: ServerResponse, status: number, body: unknown): void {\n res.statusCode = status\n res.setHeader('content-type', 'application/json')\n res.end(JSON.stringify(body))\n}\n\n/**\n * Streams the bundled `viewer.html` as the response body.\n */\nfunction serve_static_html(res: ServerResponse): void {\n let size: number\n try {\n // Stat first so a missing file produces a clean 500 response instead\n // of a stream error after headers have already been sent.\n size = statSync(STATIC_HTML).size\n } catch {\n res.statusCode = 500\n res.setHeader('content-type', 'text/plain')\n res.end('viewer.html missing')\n return\n }\n res.statusCode = 200\n res.setHeader('content-type', 'text/html; charset=utf-8')\n res.setHeader('cache-control', 'no-store')\n res.setHeader('content-length', String(size))\n createReadStream(STATIC_HTML).pipe(res)\n}\n\n/**\n * Handles `GET /api/events` by turning the connection into an SSE stream.\n *\n * Replays whatever the client missed since its `Last-Event-ID` cursor,\n * subscribes it to the broadcaster for new events, and keeps the\n * connection alive with a periodic heartbeat comment.\n */\nfunction handle_sse(req: IncomingMessage, res: ServerResponse, broadcaster: Broadcaster): void {\n res.statusCode = 200\n res.setHeader('content-type', 'text/event-stream')\n res.setHeader('cache-control', 'no-store')\n res.setHeader('connection', 'keep-alive')\n // Disables response buffering in nginx so SSE frames reach the client as\n // soon as they are written instead of sitting in a proxy buffer.\n res.setHeader('x-accel-buffering', 'no')\n\n // Replay everything after the client's cursor before subscribing. Both\n // calls run synchronously back to back, so there is no window in which\n // an event could land between the replay and the live subscription.\n const last_event_id = parse_last_event_id(req.headers['last-event-id'])\n for (const entry of broadcaster.snapshot_after(last_event_id)) {\n write_event(res, entry.id, entry.event)\n }\n\n // Comment frames keep the connection alive through idle proxies and\n // load balancers that would otherwise time out a quiet SSE stream.\n const heartbeat = setInterval(() => {\n res.write(': heartbeat\\n\\n')\n }, SSE_HEARTBEAT_MS)\n\n const unsubscribe = broadcaster.subscribe((entry) => {\n write_event(res, entry.id, entry.event)\n })\n\n const close = (): void => {\n clearInterval(heartbeat)\n unsubscribe()\n if (!res.writableEnded) {\n res.write('event: close\\ndata: {}\\n\\n')\n res.end()\n }\n }\n\n // A clean disconnect and a socket error both need the same cleanup.\n req.on('close', close)\n req.on('error', close)\n}\n\n/**\n * Parses the `Last-Event-ID` header into a replay cursor, defaulting to 0.\n *\n * Treats a missing header or a non-numeric or non-positive value as \"no\n * cursor\", which makes `handle_sse` replay the full ring buffer.\n */\nfunction parse_last_event_id(value: string | string[] | undefined): number {\n if (typeof value !== 'string') return 0\n const n = Number.parseInt(value, 10)\n return Number.isFinite(n) && n > 0 ? n : 0\n}\n\n/**\n * Writes one SSE `trajectory` event frame to the response stream.\n */\nfunction write_event(res: ServerResponse, id: number, event: ParsedTrajectoryEvent): void {\n res.write(`id: ${id}\\nevent: trajectory\\ndata: ${JSON.stringify(event)}\\n\\n`)\n}\n\n/**\n * Handles `POST /api/ingest`: parses newline-delimited trajectory events\n * from the request body and feeds valid ones into the broadcaster.\n *\n * Reports how many lines were accepted vs rejected in the response body;\n * a malformed line is skipped and reported via `on_parse_error`, not\n * treated as a fatal request error.\n */\nfunction handle_ingest(\n req: IncomingMessage,\n res: ServerResponse,\n broadcaster: Broadcaster,\n on_parse_error?: (err: unknown, line: string) => void,\n): void {\n let buf = ''\n let accepted = 0\n let rejected = 0\n\n const consume_line = (line: string): void => {\n if (line.length === 0) return\n let parsed: unknown\n try {\n parsed = JSON.parse(line)\n } catch (err) {\n rejected++\n if (on_parse_error) on_parse_error(err, line)\n return\n }\n const result = parse_trajectory_event(parsed)\n if (!result.success) {\n rejected++\n if (on_parse_error) on_parse_error(result.error, line)\n return\n }\n broadcaster.emit(result.data)\n accepted++\n }\n\n req.setEncoding('utf8')\n req.on('data', (chunk: string) => {\n buf += chunk\n // Consume every complete line in the buffer so far; a trailing partial\n // line (no `\\n` yet) stays in `buf` until a later chunk completes it.\n let nl = buf.indexOf('\\n')\n while (nl !== -1) {\n consume_line(buf.slice(0, nl))\n buf = buf.slice(nl + 1)\n nl = buf.indexOf('\\n')\n }\n })\n req.on('end', () => {\n // Flush a final line that arrived without a trailing newline.\n if (buf.length > 0) consume_line(buf)\n send_json(res, 200, { accepted, rejected })\n })\n req.on('error', (err: unknown) => {\n if (on_parse_error) on_parse_error(err, '')\n send_json(res, 400, { error: 'bad_request' })\n })\n}\n\nexport const internals_for_test = { STATIC_HTML, SSE_HEARTBEAT_MS, parse_last_event_id }\n","/**\n * JSONL file tailer.\n *\n * Watches a file for appends and emits one parsed trajectory event per\n * complete line. Handles three pathological cases:\n *\n * - Truncation / rotation: a watcher event whose stat is shorter than the\n * current offset means the file shrunk. Reset offset to 0 and re-stream.\n * - Partial last line: if the trailing chunk has no `\\n`, buffer it and\n * wait. Never parse a half-written line.\n * - Schema failures: a line that fails `parse_trajectory_event` is\n * dropped and surfaced to `on_parse_error`. The stream keeps going.\n *\n * The watcher is fs.watch-based; reads are serialized and change events\n * that arrive mid-read are coalesced into one extra pass rather than\n * dropped, so a burst of appends never starts overlapping reads. Each pass\n * re-stats and re-reads from the saved offset, which also covers platforms\n * where fs.watch misses some append notifications: the next successful\n * change event catches the file up regardless.\n */\n\nimport { type FSWatcher, watch as fs_watch } from 'node:fs'\nimport { open, stat } from 'node:fs/promises'\nimport { parse_trajectory_event, type ParsedTrajectoryEvent } from '#core'\n\nexport type TailOptions = {\n readonly path: string\n readonly on_event: (event: ParsedTrajectoryEvent) => void\n readonly on_parse_error?: (err: unknown, line: string) => void\n readonly on_io_error?: (err: unknown) => void\n}\n\nexport type Tail = {\n readonly stop: () => void\n readonly drain: () => Promise<void>\n}\n\n/**\n * Starts tailing `path` and returns a handle to stop or drain it.\n *\n * Watches the file with `fs.watch` and re-reads from the last known offset\n * on every change, buffering an incomplete trailing line until the rest\n * arrives. Overlapping change events are coalesced: a read already in\n * flight absorbs any events that fire while it runs instead of starting a\n * second concurrent read.\n */\nexport function start_tail(options: TailOptions): Tail {\n const { path, on_event, on_parse_error, on_io_error } = options\n let offset = 0\n let buffer = ''\n let busy = false\n let pending = false\n let closed = false\n let watcher: FSWatcher | null = null\n let last_drain: Promise<void> = Promise.resolve()\n\n const handle_line = (line: string): void => {\n if (line.length === 0) return\n let parsed: unknown\n try {\n parsed = JSON.parse(line)\n } catch (err) {\n if (on_parse_error) on_parse_error(err, line)\n return\n }\n const result = parse_trajectory_event(parsed)\n if (!result.success) {\n if (on_parse_error) on_parse_error(result.error, line)\n return\n }\n on_event(result.data)\n }\n\n const read_more = async (): Promise<void> => {\n let st\n try {\n st = await stat(path)\n } catch (err) {\n if (on_io_error) on_io_error(err)\n return\n }\n if (st.size < offset) {\n // File is shorter than our offset: it was truncated or rotated.\n // Restart from the top instead of seeking to a now-invalid offset.\n offset = 0\n buffer = ''\n }\n if (st.size === offset) return\n\n const fh = await open(path, 'r').catch((err: unknown) => {\n if (on_io_error) on_io_error(err)\n return null\n })\n if (!fh) return\n try {\n const length = st.size - offset\n const buf = Buffer.alloc(length)\n const { bytesRead } = await fh.read(buf, 0, length, offset)\n offset += bytesRead\n buffer += buf.subarray(0, bytesRead).toString('utf8')\n } finally {\n await fh.close()\n }\n\n let nl = buffer.indexOf('\\n')\n while (nl !== -1) {\n const line = buffer.slice(0, nl)\n buffer = buffer.slice(nl + 1)\n handle_line(line)\n nl = buffer.indexOf('\\n')\n }\n // Anything left in `buffer` has no trailing newline yet; keep it for\n // the next read instead of parsing a half-written line.\n }\n\n // Coalesces watcher bursts: if `schedule` fires while a read is already\n // running, it just flags `pending` and returns. The running loop below\n // checks `pending` after each pass and does one more pass if it was set,\n // so a burst of change events never starts overlapping reads.\n const schedule = (): void => {\n if (closed) return\n if (busy) {\n pending = true\n return\n }\n busy = true\n last_drain = (async (): Promise<void> => {\n try {\n let keep_going = true\n while (keep_going) {\n pending = false\n await read_more()\n keep_going = pending && !closed\n }\n } finally {\n busy = false\n }\n })()\n }\n\n schedule()\n\n try {\n watcher = fs_watch(path, { persistent: true }, () => { schedule() })\n } catch (err) {\n if (on_io_error) on_io_error(err)\n }\n\n const stop = (): void => {\n closed = true\n if (watcher) {\n watcher.close()\n watcher = null\n }\n }\n\n const drain = async (): Promise<void> => {\n schedule()\n await last_drain\n }\n\n return { stop, drain }\n}\n","/**\n * `start_viewer` programmatic embed implementation.\n *\n * Spin up the server, optionally start tailing a JSONL file, and return a\n * handle that can stop both. `start_viewer` only depends on core's wire-format\n * schema; it never reaches into the engine, composites, or any provider.\n */\n\nimport { create_broadcaster } from './broadcast.js'\nimport { start_server, type ViewerServer } from './server.js'\nimport { start_tail, type Tail } from './tail.js'\n\nexport type StartViewerOptions = {\n readonly path?: string\n readonly host?: string\n readonly port?: number\n readonly buffer?: number\n readonly on_parse_error?: (err: unknown, line: string) => void\n readonly on_io_error?: (err: unknown) => void\n readonly on_subscriber_error?: (err: unknown) => void\n}\n\nexport type ViewerHandle = {\n readonly url: string\n readonly host: string\n readonly port: number\n readonly close: () => Promise<void>\n}\n\n/**\n * Starts the viewer: brings up the HTTP/SSE server and, if `options.path`\n * is set, a file tail that feeds the same broadcaster.\n *\n * Defaults to `127.0.0.1:4242` with a 1000-event ring buffer. HTTP ingest\n * and SSE are always available; tailing is opt-in via `path`.\n */\nexport async function start_viewer(options: StartViewerOptions = {}): Promise<ViewerHandle> {\n const host = options.host ?? '127.0.0.1'\n const port = options.port ?? 4242\n const buffer = options.buffer ?? 1000\n const broadcaster = create_broadcaster({\n buffer,\n ...(options.on_subscriber_error ? { on_subscriber_error: options.on_subscriber_error } : {}),\n })\n const server = await start_server({\n broadcaster,\n host,\n port,\n ...(options.on_parse_error ? { on_parse_error: options.on_parse_error } : {}),\n })\n\n let tail: Tail | null = null\n if (options.path !== undefined) {\n tail = start_tail({\n path: options.path,\n on_event: (event) => { broadcaster.emit(event) },\n ...(options.on_parse_error ? { on_parse_error: options.on_parse_error } : {}),\n ...(options.on_io_error ? { on_io_error: options.on_io_error } : {}),\n })\n }\n\n return wrap_handle(server, tail, host)\n}\n\n/**\n * Combines the server and optional tail into a single `ViewerHandle`.\n *\n * `close` stops the tail first, then closes the server, mirroring the\n * startup order (server first, tail second) in reverse. The port is read\n * back from `server.url` rather than the requested `port` option, since\n * a caller that passes `0` gets whatever port the OS actually bound.\n */\nfunction wrap_handle(server: ViewerServer, tail: Tail | null, host: string): ViewerHandle {\n return {\n url: server.url,\n host,\n port: Number(new URL(server.url).port),\n close: async () => {\n if (tail) tail.stop()\n await server.close()\n },\n }\n}\n","#!/usr/bin/env tsx\n/**\n * fascicle-viewer CLI.\n *\n * fascicle-viewer <path> # tail a JSONL file (primary)\n * fascicle-viewer --listen # accept HTTP push only\n * fascicle-viewer <path> --listen # both producers feed the same broadcaster\n *\n * Flags: --port <n> --host <h> --buffer <n> --no-open --help\n *\n * Defaults bind 127.0.0.1:4242 and open the user's default browser. SIGINT\n * shuts everything down cleanly. The CLI body is exposed as `run_viewer_cli`\n * so the umbrella's bin shim can drive it from a bundled `dist/index.js`.\n */\n\nimport { spawn } from 'node:child_process'\nimport { existsSync } from 'node:fs'\nimport { parseArgs } from 'node:util'\nimport { fileURLToPath } from 'node:url'\nimport { start_viewer } from './start_viewer.js'\n\ntype CliArgs = {\n readonly path?: string\n readonly host: string\n readonly port: number\n readonly buffer: number\n readonly listen: boolean\n readonly open: boolean\n}\n\nconst HELP = `\\\nfascicle-viewer — minimal in-repo dashboard for fascicle trajectory streams.\n\nUsage:\n fascicle-viewer <path> tail a JSONL file\n fascicle-viewer --listen accept HTTP push only\n fascicle-viewer <path> --listen both producers feed the same broadcaster\n\nOptions:\n --port <n> port (default 4242)\n --host <h> bind host (default 127.0.0.1; --host 0.0.0.0 warns)\n --buffer <n> ring-buffer size (default 1000)\n --no-open do not open the browser\n --help show this message\n`\n\n/**\n * Parses CLI argv into a validated `CliArgs`, exiting on bad input.\n *\n * `--help` prints usage and exits 0. Invalid numeric flags, or a missing\n * <path> without `--listen`, write to stderr and exit 2.\n */\nexport function parse(argv: readonly string[]): CliArgs {\n const { values, positionals } = parseArgs({\n args: [...argv],\n allowPositionals: true,\n options: {\n port: { type: 'string', default: '4242' },\n host: { type: 'string', default: '127.0.0.1' },\n buffer: { type: 'string', default: '1000' },\n listen: { type: 'boolean', default: false },\n open: { type: 'boolean', default: true },\n 'no-open': { type: 'boolean', default: false },\n help: { type: 'boolean', default: false },\n },\n })\n if (values.help) {\n process.stdout.write(HELP)\n process.exit(0)\n }\n const port_raw = values.port ?? '4242'\n const buffer_raw = values.buffer ?? '1000'\n const port = Number.parseInt(port_raw, 10)\n const buffer = Number.parseInt(buffer_raw, 10)\n if (!Number.isFinite(port) || port <= 0) {\n process.stderr.write(`invalid --port: ${port_raw}\\n`)\n process.exit(2)\n }\n if (!Number.isFinite(buffer) || buffer <= 0) {\n process.stderr.write(`invalid --buffer: ${buffer_raw}\\n`)\n process.exit(2)\n }\n const path = positionals[0]\n const listen = values.listen ?? false\n if (path === undefined && !listen) {\n process.stderr.write('fascicle-viewer: a <path> is required unless --listen is set\\n')\n process.stderr.write(HELP)\n process.exit(2)\n }\n return {\n ...(path !== undefined ? { path } : {}),\n host: values.host ?? '127.0.0.1',\n port,\n buffer,\n listen,\n open: !values['no-open'] && (values.open ?? true),\n }\n}\n\n/**\n * Opens `url` in the platform's default browser, best-effort.\n *\n * Spawns the platform opener (`open`, `cmd /c start`, or `xdg-open`)\n * detached and swallows failures; the CLI prints the URL either way.\n */\nexport function open_browser(url: string): void {\n const platform = process.platform\n const cmd = platform === 'darwin' ? 'open' : platform === 'win32' ? 'cmd' : 'xdg-open'\n const args = platform === 'win32' ? ['/c', 'start', '\"\"', url] : [url]\n try {\n const child = spawn(cmd, args, { stdio: 'ignore', detached: true })\n child.on('error', () => {})\n child.unref()\n } catch {\n // Best-effort. The CLI logs the URL anyway.\n }\n}\n\n/**\n * CLI entry point: parses argv, starts the viewer, and wires shutdown.\n *\n * Warns but proceeds when the tailed path does not exist yet or when the\n * bind host is 0.0.0.0 (the dashboard has no auth). Optionally opens the\n * browser, then installs SIGINT/SIGTERM handlers that close the viewer\n * before exiting.\n */\nexport async function run_viewer_cli(argv: readonly string[]): Promise<void> {\n const args = parse(argv)\n\n if (args.path !== undefined && !existsSync(args.path)) {\n process.stderr.write(\n `fascicle-viewer: warning: ${args.path} does not exist yet — will pick up events once it is created\\n`,\n )\n }\n if (args.host === '0.0.0.0') {\n process.stderr.write(\n 'fascicle-viewer: warning: binding 0.0.0.0 — this dashboard has no auth and exposes whatever is in your trajectory stream\\n',\n )\n }\n\n const handle = await start_viewer({\n ...(args.path !== undefined ? { path: args.path } : {}),\n host: args.host,\n port: args.port,\n buffer: args.buffer,\n on_parse_error: (err, line) => {\n const preview = line.length > 120 ? `${line.slice(0, 120)}…` : line\n process.stderr.write(\n `fascicle-viewer: skipped malformed line: ${preview}\\n ${describe_error(err)}\\n`,\n )\n },\n on_io_error: (err) => {\n process.stderr.write(`fascicle-viewer: io error: ${describe_error(err)}\\n`)\n },\n })\n\n if (args.path !== undefined) process.stderr.write(`watching ${args.path}\\n`)\n if (args.listen || args.path === undefined) process.stderr.write(`listening for HTTP push on ${handle.url}/api/ingest\\n`)\n process.stderr.write(`viewer at ${handle.url}\\n`)\n\n if (args.open) open_browser(handle.url)\n\n const shutdown = async (): Promise<void> => {\n process.stderr.write('\\nfascicle-viewer: shutting down\\n')\n await handle.close()\n process.exit(0)\n }\n process.on('SIGINT', () => { void shutdown() })\n process.on('SIGTERM', () => { void shutdown() })\n}\n\n/**\n * Renders an unknown thrown value as a human-readable message.\n */\nfunction describe_error(err: unknown): string {\n if (err instanceof Error) return err.message\n try {\n return JSON.stringify(err)\n } catch {\n return String(err)\n }\n}\n\n// ESM main-module detection. The bundler inlines this file into dist/index.js,\n// so a fragile suffix check (`endsWith('/cli.js')`) would fire whenever a\n// consumer's own entry script happened to be named cli.js, see\n// https://nodejs.org/api/esm.html#importmetaurl. Compare the resolved path of\n// this module against argv[1] so the auto-execute only fires when the file is\n// run directly (e.g. `tsx packages/viewer/src/cli.ts`), not when imported.\nconst invoked_directly =\n process.argv[1] !== undefined &&\n process.argv[1] === fileURLToPath(import.meta.url)\n\nif (invoked_directly) {\n void run_viewer_cli(process.argv.slice(2)).catch((err: unknown) => {\n process.stderr.write(`fascicle-viewer: ${describe_error(err)}\\n`)\n process.exit(1)\n })\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAOA,IAAa,+BAAb,cAAkD,MAAM;CAItD,OAAgB;CAChB;CACA,YAAY,QAAgB,SAAkB;EAC5C,MACE,WACE,kBAAkB,OAAO,0FAC7B;EACA,KAAK,OAAO;EACZ,KAAK,SAAS;CAChB;AACF;;;;;;;;;;;;;;;;;;;ACDA,MAAM,iBAAiB;;;;;;;;;;AAWvB,SAAgB,eACd,QACA,UAA6B,CAAC,GACL;CACzB,MAAM,QAAQ,OAAO;CACrB,IAAI,OAAO,MAAM,YAAY,UAAU,YACrC,MAAM,IAAI,6BAA6B,MAAM,MAAM;CAErD,MAAM,OAAO,cAAc,MAAM,WAAW,MAAM,EAAE,QAAQ,QAAQ,UAAU,eAAe,CAAC,CAAC;CAC/F,OAAO,QAAQ,eAAe,OAAO,gBAAgB,IAAI,IAAI;AAC/D;;AAGA,MAAM,cAAc;CAAC;CAAc;CAAqB;CAAS;AAAa;;AAG9E,MAAM,eAAe;CACnB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,SAAS,cAAc,MAAwD;CAC7E,MAAM,SAAS,aAAa,IAAI;CAChC,OAAO,cAAc,MAAM,IAAI;EAAE,GAAG;EAAQ,sBAAsB;CAAM,IAAI;AAC9E;;AAGA,SAAS,aAAa,MAAwD;CAC5E,MAAM,SAAkC,EAAE,GAAG,KAAK;CAClD,KAAK,MAAM,OAAO,aAAa;EAC7B,MAAM,MAAM,OAAO;EACnB,IAAI,QAAQ,GAAG,GAAG,OAAO,OAAO,UAAU,GAAG;CAC/C;CACA,KAAK,MAAM,OAAO,cAChB,IAAI,OAAO,QAAQ,OAAO,OAAO,YAAY,OAAO,IAAI;CAE1D,OAAO;AACT;;AAGA,SAAS,UAAU,KAAuD;CACxE,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,GAAG,GAAG,OAAO,QAAQ,YAAY,KAAK;CACjF,OAAO;AACT;;AAGA,SAAS,YAAY,OAAyB;CAC5C,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,IAAI,WAAW;CACtD,OAAO,QAAQ,KAAK,IAAI,cAAc,KAAK,IAAI;AACjD;;AAGA,SAAS,cAAc,MAAwC;CAC7D,IAAI,0BAA0B,QAAQ,EAAE,gBAAgB,OAAO,OAAO;CACtE,MAAM,OAAO,KAAK;CAClB,OAAO,SAAS,YAAa,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,QAAQ;AAC5E;;AAGA,SAAS,QAAQ,OAAkD;CACjE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;;;;;;;AAQA,SAAS,gBAAgB,MAAwD;CAC/E,MAAM,EAAE,SAAS,SAAS,KAAK,KAAK,GAAG,SAAS;CAChD,OAAO;AACT;;;;;;;;;;;;;;;;ACnFA,SAAS,uBACP,GAC6B;CAC7B,IAAI,EAAE,cAAc,KAAA,GAAW,OAAO,EAAE,OAAO,EAAE,MAAM;CACvD,IAAI,EAAE,mBAAmB,KAAA,GAAW,OAAO;EAAE,OAAO,EAAE;EAAO,OAAO,EAAE;CAAU;CAChF,OAAO;EAAE,OAAO,EAAE;EAAO,OAAO,EAAE;EAAW,UAAU,EAAE;CAAe;AAC1E;;;;;;;;;;;;;;;;;AAkBA,SAAgB,YACd,QACwB;CACxB,MAAM,EAAE,OAAO,UAAU,QAAQ,eAAe;CAIhD,MAAM,UAAU,OAAO,aAAa,MAAoC;CAsCxE,MAAM,QAAQ,KAA0B;EACtC,OAAO,WAAW,EAAE,MAAM;EAC1B,MApCuB,MAAM;GAC7B,MAAM,SAAS,KAAK,aAAa,MAAS,CAAC,CAAC;GAC5C,KAAK,mBAAmB,MAAS,uBAAuB,CAAC,CAAC;GAC1D;GACA,IAAI,CAAC,OAAO,IAAI,MAAM,cAAyB;IAG7C,OAAO;KAAE,GADK,KAAK;KACA;IAAU;GAC/B,CAAC;EACH,CA2BK;EACH,OA1BkD,MAAM;GACxD,MAAM,SAAS,KAAK,aAAa,MAAS,CAAC,CAAC;GAC5C,KAAK,sBAAsB,MAAS;IAClC,IAAI,EAAE,cAAc,KAAA,GAClB,MAAM,IAAI,MAAM,gDAAgD;IAElE,OAAO,EAAE;GACX,CAAC;GACD;GACA,IAAI,CAAC,OAAO,IAAI,MAAM,oBAA+C;IAEnE,MAAM,QAAQ,KAAK;IACnB,OAAO;KACL,MAAM,OAAO,eAAe;KAC5B,OAAO;MACL,GAAG;MACH,eAAe;MACf,gBAAgB,gBAAgB;KAClC;IACF;GACF,CAAC;EACH,CAKM;EACJ,SAAS,GAAG,EAAE,WAAW,aAAa;GACpC,IAAI,EAAE,cAAc,KAAA,GAClB,MAAM,IAAI,MAAM,2CAA2C;GAE7D,OAAO,QAAQ;IAAE,WAAW,EAAE;IAAW;IAAW;GAAO,CAAC;EAC9D;EACA;CACF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,eAAe,KAAK;AACpD;;;;;;;;;;;;;;;;;;;;AC3FA,SAAgB,UACd,QACoB;CACpB,MAAM,EAAE,SAAS,OAAO,eAAe;CAIvC,MAAM,UAAU,OAAO,aAAa,MAA0B;CAK9D,MAAM,aAAa,SAAS,OAAO;CAkBnC,MAAM,QAAQ,KAAsB;EAClC,OAAO,WAAW;GAAE;GAAO,SAAS,CAAC;EAAE;EACvC,MAlBuB,MAAM;GAC7B,MAAM,SAAS,KAAK,aAAa,MAAS,CAAC,CAAC;GAC5C,KAAK,kBAAkB,MAAS,EAAE,KAAK;GACvC;GACA,IAAI,CAAC,OAAO,IAAI,MAAM,YAA+B;IAGnD,OAAO;KAAE,GADK,KAAK;KACA;IAAQ;GAC7B,CAAC;EACH,CASK;EACH,OARkD,KAAK,UAAU,OAAU;GAC3E,MAAM,MAAM,EAAE,OAAO;GACrB,OAAO;EACT,EAKM;EACJ,SAAS,GAAG,EAAE,gBAAgB,QAAQ;GAAE,QAAQ,EAAE;GAAS;EAAU,CAAC;EACtE;CACF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,aAAa,KAAK;AAClD;;;;;;;;;;;;;;;;;;;;AC5CA,SAAgB,SACd,QACoB;CACpB,MAAM,SAAwB,OAAO,UAAU;CAC/C,MAAM,WAAW,OAAO;CACxB,MAAM,OAAO,OAAO,KAAK,OAAO,OAAO;CAIvC,MAAM,UAAU,OAAO,aAAa,MAAyB;CAwC7D,MAAM,QAAQ,SAAS,CArCP,SAAS,OAAO,OAqCF,GAnCjB,KAAK,eAAe,OAAO,YAA+B;EACrE,MAAM,SAAiC,CAAC;EACxC,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,QAAQ,QAAQ;GACtB,IAAI,UAAU,KAAA,GAAW;GACzB,OAAO,KAAK,MAAM,SAAS,OAAO,CAAC;EACrC;EAEA,IAAI,aAAiC,KAAA;EACrC,IAAI,eAAmC,KAAA;EACvC,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,UAAU,OAAO;GACvB,IAAI,YAAY,KAAA,GAAW;GAC3B,IAAI,iBAAiB,KAAA,GAAW;IAC9B,aAAa;IACb,eAAe;IACf;GACF;GAEA,IADe,WAAW,QAAQ,UAAU,eAAe,UAAU,cACzD;IACV,aAAa;IACb,eAAe;GACjB;EACF;EAEA,IAAI,eAAe,KAAA,GACjB,MAAM,IAAI,MAAM,wCAAwC;EAE1D,MAAM,SAAS,QAAQ;EACvB,IAAI,WAAW,KAAA,GACb,MAAM,IAAI,MAAM,uCAAuC;EAEzD,OAAO,QAAQ;GAAE;GAAQ;EAAO,CAAC;CACnC,CAEoC,CAAC,CAAC;CAEtC,OAAO,QAAQ,OAAO,QAAQ,YAAY,KAAK;AACjD;;;;;;AC7DA,MAAM,cAAc;AACpB,MAAM,WAAW;;;;;;;;;;;;;;;;;;;;;;AA0BjB,SAAgB,cACd,QACoB;CACpB,MAAM,EAAE,SAAS,OAAO,YAAY;CACpC,MAAM,SAAwB,OAAO,UAAU;CAC/C,MAAM,OAAO,OAAO,KAAK,OAAO;CAIhC,MAAM,UAAU,OAAO,aAAa,MAAqC;CAEzE,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,MAAM,6CAA6C;CAG/D,MAAM,UAAU,SAAS,OAAO;CAEhC,MAAM,YAAY,MAAM;EACtB,MAAM,UAAU,KAAK,gCAAgC,SAAkB,IAAI,CAAC;EAC5E,KAAK,gCAAgC,SAAkB,KAAK,KAAK;EACjE;EACA,IAAI,CAAC,QAAQ,IAAI,MAAM,WAAuC;GAG5D,OAAO;IAAE,IADI,KAAK,SACD,CAAC;IAAI;GAAO;EAC/B,CAAC;CAEH,CAAC;CAED,MAAM,WAAW,KACf,2BACC,YAAuD;EACtD,MAAM,MAAiB,CAAC;EACxB,KAAK,MAAM,MAAM,MACf,IAAI,MAAM,SAER,IAAI,KAAK;GAAE;GAAI,OAAO,QAAQ;EAAS,CAAC;EAG5C,OAAO;CACT,CACF;CAEA,MAAM,aAAa,IAAyD;EAC1E,QAAQ,UAAU;EAClB,IAAI;CACN,CAAC;CAED,MAAM,OAAO,IACX,CAAC,WAAW,IACX,MAAM,iBAA+D;EAEpE,MAAM,UAAU,KAAK;EACrB,MAAM,SAAiC,CAAC;EACxC,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,KAAK,MAAM,QAAQ,cAAc;GAC/B,OAAO,KAAK,MAAM,KAAK;GACvB,MAAM,OAAO,QAAQ,KAAK,MAAM;GAOhC,IALE,gBAAgB,KAAA,IACZ,OACA,WAAW,QACT,OAAO,cACP,OAAO,aACH;IACV,YAAY,KAAK;IACjB,cAAc;IACd,gBAAgB,KAAK;GACvB;EACF;EACA,IAAI,cAAc,KAAA,KAAa,kBAAkB,KAAA,GAC/C,MAAM,IAAI,MAAM,6CAA6C;EAE/D,MAAM,SAAS,QAAQ;EACvB,IAAI,WAAW,KAAA,GACb,MAAM,IAAI,MAAM,4CAA4C;EAE9D,OAAO,QAAQ;GAAE;GAAW;GAAQ;GAAe;EAAO,CAAC;CAC7D,CACF;CAEA,MAAM,QAAQ,MAAM;EAClB,MAAM,aAAa,OAAO;EAC1B;EACA;EACA;CAEF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,iBAAiB,KAAK;AACtD;;;;;;;;;;;;;ACtEA,MAAM,YAAY;;;;;;;;;;;;;;;;;;;;AAgClB,SAAgB,QACd,QACoB;CACpB,MAAM,EAAE,MAAM,SAAS,OAAO,WAAW;CAIzC,MAAM,UAAU,OAAO,aAAa,MAAwB;CAC5D,MAAM,UAAU,OAAO,WAAW;CAClC,MAAM,sBAAsB,KAAK,IAAI,GAAG,OAAO,uBAAuB,CAAC;CACvE,MAAM,mBAAmB,KAAK,IAAI,GAAG,OAAO,oBAAoB,CAAC;CACjE,MAAM,EAAE,YAAY,kBAAkB,aAAa;CAEnD,MAAM,YAAsE,CAAC;CAC7E,KAAK,IAAI,IAAI,GAAG,IAAI,qBAAqB,KAAK,GAC5C,UAAU,IAAI,OAAO,CAAC,OAAO;CAG/B,MAAM,iBAAiB,cAIrB;EACA,MAAM;EACN,SAAS;EACT;EACA,UAAU,MAAM,EAAE;CACpB,CAAC;CASD,MAAM,gBAAgB,IACpB,CAAC,SAAS,IACT,MAAM,iBAA8B,QAA4B;EAG/D,MAAM,QADQ,KAAK,UACA,CAAC,QAAQ;EAC5B,KAAK,MAAM,WAAW,OAAO,KAAK,gBAAgB,MAAM,GAAG;GACzD,MAAM,SAAS,gBAAgB,OAAO;GACtC,IAAI,WAAW,KAAA,GAAW;GAC1B,IAAI,WAAW,OAAO;IACpB,MAAM;IACN;IACA,aAAa;IACb,OAAO,OAAO;IACd,UAAU,OAAO;IACjB,GAAI,OAAO,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ,OAAO,OAAO;GACjE,CAAC;EACH;EACA,MAAM,IAAI,gBAAgB;EAC1B,OAAO;GACL,GAAG;GACH,WAAW;IAAE,GAAG,EAAE;IAAW,aAAa,gBAAgB;GAAU;EACtE;CACF,CACF;CAEA,MAAM,aAAa,KACjB,uBACC,iBAAiE;EAChE,QAAQ,YAAY;EACpB,cAAc,YAAY;EAC1B,OAAO;EACP,uBAAuB;EACvB,eAAe,KAAK,IAAI;EACxB,SAAS,CAAC;EACV,SAAS,CAAC;CACZ,EACF;CAEA,MAAM,iBAAiB,KACrB,2BACC,GAAoB,QAA8B;EACjD,MAAM,QAAQ,EAAE,QAAQ;EACxB,IAAI,WAAW,OAAO;GACpB,MAAM;GACN;GACA,cAAc,EAAE;GAChB,eAAe,EAAE,QAAQ;EAC3B,CAAC;EACD,OAAO;GACL,QAAQ,EAAE;GACV,cAAc,EAAE;GAChB;GACA,SAAS,EAAE;EACb;CACF,CACF;CAEA,MAAM,gBAAgB,IACpB,CAAC,SAAS,IACT,MAAM,QAA4B,QAAyB;EAE1D,MAAM,QAAQ,KAAK;EACnB,MAAM,aAAa,MAAM,QAAQ;EACjC,MAAM,SAAS,OAAO,QAAQ,MAAM,eAAe;EACnD,MAAM,WAAW,OAAO,YAAY;EACpC,MAAM,eAAe,CAAC,YAAY,OAAO,WAAW,KAAA,IAChD,CACE,GAAG,MAAM,SACT;GACE,OAAO;GACP,aAAa,OAAO,UAAU;GAC9B,QAAQ,OAAO;EACjB,CACF,CAAC,CAAC,MAAM,CAAC,gBAAgB,IACzB,MAAM;EACV,IAAI,WAAW,OAAO;GACpB,MAAM,WAAW,mBAAmB;GACpC,OAAO;GACP,aAAa,OAAO,UAAU;GAC9B,OAAO,OAAO;GACd,aAAa,MAAM;GACnB,GAAI,WAAW,EAAE,OAAO,OAAO,QAAQ,MAAM,aAAa,IAAI,CAAC;GAC/D,GAAI,OAAO,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ,OAAO,OAAO;EACjE,CAAC;EACD,OAAO;GACL,QAAQ,WAAW,OAAO,UAAU,UAAU,MAAM;GACpD,cAAc,WAAW,OAAO,QAAQ,MAAM;GAC9C,OAAO;GACP,uBAAuB,WAAW,IAAI,MAAM,wBAAwB;GACpE,eAAe,MAAM;GACrB,SAAS,CACP,GAAG,MAAM,SACT;IAAE,OAAO;IAAY,QAAQ;IAAQ;GAAS,CAChD;GACA,SAAS;EACX;CACF,CACF;CAqDA,MAAM,QAAQ,MAAM;EAClB;EACA;EA5BiB,KAAyD;GAC1E,OAAO,MAAM;GACb,MA3BW,MAAM;IACjB,MAAM,WAAW,KAAK,qBAAqB,MAAuB,CAAC,CAAC;IACpE;IACA;IACA;IACA;GAEF,CAoBK;GACH,OAnBY,KACZ,kBACC,MAAkE;IACjE,IAAI,EAAE,yBAAyB,UAC7B,OAAO;KAAE,MAAM;KAAM,OAAO;MAAE,GAAG;MAAG,YAAY;KAAU;IAAE;IAE9D,IACE,qBAAqB,KAAA,KACrB,KAAK,IAAI,IAAI,EAAE,iBAAiB,kBAEhC,OAAO;KAAE,MAAM;KAAM,OAAO;MAAE,GAAG;MAAG,YAAY;KAAS;IAAE;IAE7D,OAAO;KAAE,MAAM;KAAO,OAAO;IAAE;GACjC,CAMI;GACJ,SAAS,OAAyB;IAChC,MAAM;KAAE,SAAS,EAAE;KAAQ,OAAO,EAAE;IAAa;IACjD,aAAa,EAAE;IACf,YAAY,EAAE,cAAc;IAC5B,SAAS,EAAE;GACb;GACA;EACF,CAkBW;EAhBS,KAClB,iBACC,QAA0B,QAAmB;GAC5C,IAAI,WAAW,OAAO;IACpB,MAAM;IACN,YAAY,OAAO;IACnB,aAAa,OAAO;IACpB,aAAa,OAAO,KAAK;GAC3B,CAAC;GACD,OAAO,QAAQ,MAAM;EACvB,CAOU;CAEZ,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,WAAW,KAAK;AAChD;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtOA,MAAM,qBAAqB;AAC3B,MAAM,WAAW;;;;AAejB,eAAe,WAAW,KAAgC;CACxD,MAAM,MAAgB,CAAC;CACvB,MAAM,UAAU,MAAM,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;CAC1D,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,OAAO,KAAK,KAAK,MAAM,IAAI;EACjC,IAAI,MAAM,YAAY,GACpB,IAAI,KAAK,GAAI,MAAM,WAAW,IAAI,CAAE;OAC/B,IAAI,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,QAAQ,GACvD,IAAI,KAAK,IAAI;CAEjB;CACA,OAAO;AACT;;;;;;;;AASA,eAAe,WAAW,WAAmB,KAA6C;CAExF,MAAM,SAAQ,MADQ,SAAS,WAAW,MAAM,EAAA,CAC1B,MAAM,IAAI;CAChC,MAAM,SAA4B,CAAC;CACnC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxC,MAAM,MAAM,MAAM;EAClB,IAAI,QAAQ,KAAA,KAAa,IAAI,KAAK,MAAM,IAAI;EAC5C,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,GAAG;EACzB,QAAQ;GACN,IAAI,WAAW,OAAO;IAAE,MAAM;IAAqB,MAAM;IAAW,MAAM,IAAI;GAAE,CAAC;GACjF;EACF;EACA,MAAM,SAAS,uBAAuB,MAAM;EAC5C,IAAI,OAAO,SACT,OAAO,KAAK,OAAO,IAAI;OAEvB,IAAI,WAAW,OAAO;GAAE,MAAM;GAAqB,MAAM;GAAW,MAAM,IAAI;EAAE,CAAC;CAErF;CACA,OAAO;AACT;;;;;AAMA,SAASA,mBAAiB,KAAuB;CAC/C,IAAI,CAAC,IAAI,MAAM,SAAS;CACxB,MAAM,SAAS,IAAI,MAAM;CACzB,IAAI,kBAAkB,eAAe,MAAM;CAC3C,MAAM,IAAI,cAAc,WAAW,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,CAAC;AAC3E;;;;;;;;AASA,eAAe,eACb,QACA,KACyC;CACzC,IAAI,OAAO,SAAS,UAAU,OAAO,OAAO;CAE5C,MAAM,aACJ,OAAO,SAAS,UAAU,CAAC,GAAG,OAAO,KAAK,KAAK,MAAM,WAAW,OAAO,GAAG,EAAA,CAAG,SAAS;CAExF,MAAM,MAAyB,CAAC;CAChC,KAAK,MAAM,KAAK,YAAY;EAC1B,mBAAiB,GAAG;EACpB,MAAM,SAAS,MAAM,WAAW,GAAG,GAAG;EACtC,IAAI,KAAK,GAAG,MAAM;CACpB;CACA,OAAO;AACT;;;;AAKA,SAAS,gBAAgB,QAA+D;CACtF,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,KAAK,MAAM;EACjB,IAAI,OAAO,OAAO,YAAY,CAAC,KAAK,IAAI,EAAE,GAAG;GAC3C,KAAK,IAAI,EAAE;GACX,IAAI,KAAK,EAAE;EACb;CACF;CACA,OAAO;AACT;;;;;;;;;AAUA,SAAgB,MACd,QAC+B;CAC/B,MAAM,EAAE,MAAM,QAAQ,UAAU,WAAW;CAC3C,MAAM,MAAM,OAAO,cAAc;CAEjC,MAAM,eAAe,KACnB,sBACA,OAAO,OAAgB,QAA2B;EAChD,MAAM,MAAM,MAAM,eAAe,QAAQ,GAAG;EAC5C,MAAM,WAAW,SAAS,IAAI,OAAO,MAAM,IAAI;EAC/C,MAAM,YAAY,SAAS,SAAS;EACpC,MAAM,SAAS,YAAY,SAAS,MAAM,GAAG,GAAG,IAAI;EACpD,IAAI,WACF,IAAI,WAAW,OAAO;GACpB,MAAM;GACN,WAAW,SAAS;GACpB,MAAM,OAAO;GACb,YAAY;EACd,CAAC;EAEH,OAAO;GACL,mBAAmB,OAAO;GAC1B,SAAS,gBAAgB,MAAM;GAC/B,QAAQ;GACR;EACF;CACF,CACF;CAEA,MAAM,cAAc,KAClB,sBACC,UAAgC;EAC/B,kBAAkB,SAAS,IAAI;EAC/B,QAAQ,KAAK;EACb,OAAO,KAAK;CACd,EACF;CAEA,MAAM,cAAc,IAClB,CAAC,QAAQ,IACR,MAAM,WAAc,QAAwB;EAE3C,MAAM,OAAO,KAAK;EAClB,IAAI,WAAW,OAAO;GACpB,MAAM;GACN,mBAAmB,KAAK;GACxB,SAAS,KAAK;EAChB,CAAC;EACD,OAAO;GACL;GACA,mBAAmB,KAAK;GACxB,SAAS,KAAK;EAChB;CACF,CACF;CAEA,MAAM,QAAQ,MAAM;EAClB,MAAM,UAAU,YAAY;EAC5B;EACA;EACA;CACF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,SAAS,KAAK;AAC9C;;;;;;;;;;;;;;;;;;;;;;;;;ACrNA,SAAgB,WACd,QACoB;CACpB,MAAM,aAAa,OAAO;CAC1B,MAAM,OAAO,OAAO,KAAK,OAAO,OAAO;CAIvC,MAAM,UAAU,OAAO,aAAa,MAA2B;CAE/D,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,MAAM,0CAA0C;CAmB5D,MAAM,QAAQ,SAAS,CAfP,SAAS,OAAO,OAeF,GAbT,KAAK,WAAW,OAAO,YAA+B;EACzE,IAAI,UAAoB,CAAC,GAAG,IAAI;EAChC,MAAM,UAA2B,CAAC;EAClC,IAAI,QAAQ;EAEZ,OAAO,QAAQ,SAAS,GAAG;GACzB,SAAS;GACT,UAAU,MAAM,WAAW,SAAS,SAAS,YAAY,OAAO,OAAO;EACzE;EAEA,OAAO,QAAQ;GAAE,QAAQ,UAAU,SAAS,OAAO;GAAG;EAAQ,CAAC;CACjE,CAE4C,CAAC,CAAC;CAE9C,OAAO,QAAQ,OAAO,QAAQ,cAAc,KAAK;AACnD;;;;;;AAOA,eAAe,WACb,SACA,SACA,SACA,OACA,SACmB;CACnB,MAAM,aAAuB,CAAC;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;EAC1C,MAAM,OAAO,QAAQ;EACrB,MAAM,OAAO,QAAQ,IAAI;EACzB,IAAI,SAAS,KAAA,GAAW;EACxB,IAAI,SAAS,KAAA,GAAW;GACtB,WAAW,KAAK,IAAI;GACpB;EACF;EACA,MAAM,QAAQ,QAAQ;EACtB,MAAM,QAAQ,QAAQ;EACtB,IAAI,UAAU,KAAA,KAAa,UAAU,KAAA,GACnC,MAAM,IAAI,MAAM,sCAAsC;EAGxD,MAAM,YAAY,MADC,QAAQ,OAAO,KAAK,MACZ,MAAM,OAAO;EACxC,QAAQ,KAAK;GAAE;GAAO;GAAM;GAAM;EAAU,CAAC;EAC7C,WAAW,KAAK,SAAS;CAC3B;CACA,OAAO;AACT;;;;;AAMA,SAAS,UAAa,SAAgC,SAA+B;CACnF,MAAM,WAAW,QAAQ;CACzB,IAAI,aAAa,KAAA,GACf,MAAM,IAAI,MAAM,uBAAuB;CAEzC,MAAM,SAAS,QAAQ;CACvB,IAAI,WAAW,KAAA,GACb,MAAM,IAAI,MAAM,yCAAyC;CAE3D,OAAO;AACT;;;;;;;;;;ACxHA,IAAa,sBAAb,cAAyC,MAAM;CAC7C,OAAgB;CAChB;CACA;CACA,YAAY,SAAiB,YAAoB,SAAkB;EACjE,MACE,WACE,eAAe,QAAQ,gBAAgB,WAAW,uCACtD;EACA,KAAK,OAAO;EACZ,KAAK,UAAU;EACf,KAAK,aAAa;CACpB;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACyEA,eAAsB,MACpB,MACA,OACA,QACA,UAAwB,CAAC,GACM;CAC/B,MAAM,SAAS,QAAQ,UAAU,SAAS,OAAO,KAAK,IAAI,CAAC,EAAE,GAAG,cAAc;CAC9E,MAAM,YAAY,mBAAmB,IAAI;CACzC,MAAM,cAAc,oBAAoB,QAAQ,aAAa,MAAM,MAAM;CACzE,MAAM,0BAA0B,QAAQ,2BAA2B;CACnE,MAAM,cAAc,QAAQ,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,QAAQ,MAAM;CAE9E,mBAAiB,QAAQ,KAAK;CAE9B,IAAI,QAAQ,mBAAmB,KAAA,GAC7B,MAAM,MAAM,QAAQ,gBAAgB,EAAE,WAAW,KAAK,CAAC;CAGzD,MAAM,gBAAgB,OAAO,QAAQ,MAAM;CAE3C,MAAM,UAAU,OAAO,OAAmD;EACxE,MAAM,EAAE,iBAAiB,aAAa,iBAAiB,mBAAmB,SAAS,GAAG,EAAE;EACxF,MAAM,MAAsB;GAAE;GAAa;GAAyB;EAAY;EAEhF,MAAM,QAAQ,KAAK,IAAI;EACvB,IAAI;EACJ,IAAI;EACJ,IAAI,KAAK;EACT,IAAI;GACF,SAAS,MAAM,IAAI,MAAM,GAAG,OAAO;IACjC,YAAY;IACZ;IACA,GAAG;GACL,CAAC;GACD,KAAK;EACP,SAAS,KAAK;GACZ,qBAAqB,KAAK,GAAG,EAAE;GAC/B,QAAQ,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;GACvD,KAAK;EACP;EAEA,MAAM,SACJ,MAAM,WAAW,KAAA,IACb,MAAM,WAAW,eAAe,kBAAkB,IAAI,MAAM,GAAG,KAAK,GAAG,EAAE,IACzE,CAAC;EAEP,MAAM,cAAc,KAAK,IAAI,IAAI;EACjC,MAAM,SAA8B;GAClC,SAAS,GAAG;GACZ;GACA,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;GACzC,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;GACvC;GACA;GACA,UAAU,aAAa,MAAM;GAC7B,GAAI,oBAAoB,KAAA,IAAY,EAAE,gBAAgB,IAAI,CAAC;EAC7D;EACA,IAAI,QAAQ,SAIV,QAAQ,QAAQ,MAA+B;EAEjD,OAAO;CACT;CAEA,MAAM,YAAY,MAAM,qBAAqB,OAAO,aAAa,SAAS,QAAQ,KAAK;CAKvF,mBAAiB,QAAQ,KAAK;CAI9B,OAAO;EACL;EACA;EACA,OAAO;EACP,SANc,UAAU,WAAW,cAAc,KAAK,CAAC,OAAO,CAAC,CAMzD;CACR;AACF;;;;;;;;AAmBA,SAAS,mBACP,SACA,SAKA;CACA,MAAM,kBACJ,QAAQ,mBAAmB,KAAA,IACvB,KAAA,IACA,KAAK,QAAQ,gBAAgB,GAAG,QAAQ,OAAO;CACrD,MAAM,QAA4B,CAAC;CACnC,IAAI,oBAAoB,KAAA,GACtB,MAAM,KAAK,kBAAkB,EAAE,aAAa,gBAAgB,CAAC,CAAC;CAEhE,IAAI,QAAQ,aAAa,KAAA,GACvB,MAAM,KAAK,YAAY,EAAE,KAAK,QAAQ,SAAS,CAAC,CAAC;CAEnD,MAAM,eAAe,oBAAoB;CAGzC,OAAO;EAAE;EAAiB,aADxB,MAAM,WAAW,IAAI,aAAa,SAAS,WAAW,GAAG,OAAO,aAAa,MAAM;EAC9C;CAAa;AACtD;;;;;AAMA,SAAS,kBAAwB,IAAkB,QAA4B;CAC7E,OAAO,GAAG,SAAS,KAAA,IACf;EAAE,OAAO,GAAG;EAAO;CAAO,IAC1B;EAAE,OAAO,GAAG;EAAO;EAAQ,MAAM,GAAG;CAAK;AAC/C;;;;;;;AAQA,eAAe,WACb,eACA,aACA,KACA,SAC4B;CAC5B,MAAM,SAA4B,CAAC;CACnC,KAAK,MAAM,CAAC,MAAM,UAAU,eAAe;EACzC,IAAI;EACJ,IAAI;GAEF,MAAM,MAAM,IAAI,OAAO,aAAa;IAClC,YAAY,IAAI;IAChB,yBAAyB,IAAI;IAC7B,GAAG,IAAI;GACT,CAAC;EACH,SAAS,KAAK;GACZ,qBAAqB,KAAK,OAAO;GACjC;EACF;EACA,MAAM,aAAa,gBAAgB,GAAG;EACtC,IAAI,eAAe,KAAA,GAAW;EAE9B,OAAO,QAAQ;CACjB;CACA,OAAO;AACT;;;;;;;;;;AAWA,SAAS,qBAAqB,KAAc,SAAuB;CACjE,IAAI,eAAe,eAAe,MAAM;CACxC,IAAI,eAAe,iBAAiB,MAAM,IAAI,oBAAoB,SAAS,IAAI,UAAU;AAC3F;;;;;;;;;AAUA,SAASC,mBAAiB,QAAuC;CAC/D,IAAI,QAAQ,YAAY,MAAM;CAC9B,MAAM,SAAkB,OAAO;CAC/B,MAAM,kBAAkB,QAAQ,SAAS,IAAI,cAAc,WAAW,EAAE,OAAO,CAAC;AAClF;;;;;;;;AASA,SAAS,UACP,OACA,aACc;CACd,MAAM,oBAAoB,MAAM,QAAQ,KAAK,MAAM,MAAM,EAAE,aAAa,CAAC;CACzE,MAAM,iBAAiB,MAAM,QAAQ,KAAK,MAAM,MAAM,EAAE,UAAU,CAAC;CACnE,MAAM,WAAW,MAAM,QAAQ,MAAM,EAAE,EAAE,CAAC,CAAC;CAC3C,MAAM,YAAY,MAAM,WAAW,IAAI,IAAI,WAAW,MAAM;CAC5D,MAAM,gBAAgB,MAAM,WAAW,IAAI,IAAI,iBAAiB,MAAM;CAEtE,MAAM,cAAsC,CAAC;CAC7C,KAAK,MAAM,QAAQ,aAAa;EAC9B,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,KAAK,MAAM,KAAK,OAAO;GACrB,MAAM,IAAI,eAAe,EAAE,OAAO,KAAK;GACvC,IAAI,MAAM,KAAA,GAAW;GACrB,OAAO;GACP,SAAS;EACX;EACA,IAAI,QAAQ,GAAG,YAAY,QAAQ,MAAM;CAC3C;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;;;;AAUA,SAAgB,gBAAgB,KAAiC;CAC/D,IAAI,QAAQ,KAAA,KAAa,QAAQ,MAAM,OAAO,KAAA;CAC9C,IAAI,OAAO,QAAQ,UACjB,OAAO,OAAO,SAAS,GAAG,IAAI,EAAE,OAAO,IAAI,IAAI,KAAA;CAEjD,IAAI,OAAO,QAAQ,YAAY,WAAW,KAAK;EAC7C,MAAM,IAAI;EACV,IAAI,OAAO,EAAE,UAAU,YAAY,CAAC,OAAO,SAAS,EAAE,KAAK,GAAG,OAAO,KAAA;EACrE,IAAI,EAAE,WAAW,KAAA,KAAa,OAAO,EAAE,WAAW,UAChD,OAAO,EAAE,OAAO,EAAE,MAAM;EAE1B,OAAO,EAAE,WAAW,KAAA,IAAY,EAAE,OAAO,EAAE,MAAM,IAAI;GAAE,OAAO,EAAE;GAAO,QAAQ,EAAE;EAAO;CAC1F;AAEF;;;;;AAMA,SAAS,eAAe,GAAgC;CACtD,IAAI,MAAM,KAAA,KAAa,MAAM,MAAM,OAAO,KAAA;CAC1C,IAAI,OAAO,MAAM,UAAU,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI,KAAA;CAC3D,IAAI,OAAO,MAAM,YAAY,WAAW,GAAG;EACzC,MAAM,MAAO,EAA8B;EAC3C,OAAO,OAAO,QAAQ,YAAY,OAAO,SAAS,GAAG,IAAI,MAAM,KAAA;CACjE;AAEF;;;;;;AAOA,SAAS,sBAGP;CACA,IAAI,QAAQ;CACZ,OAAO;EACL,aAAa;EACb,QAAQ;GACN,SAAS,UAA2B;IAClC,IAAI,MAAM,SAAS,QAAQ;IAE3B,MAAM,QAAQC,MAAE;IAChB,IAAI,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,GAAG,SAAS;GACpE;GACA,aAAa,SAAS,gBAAgB;GACtC,gBAAgB,CAAC;EACnB;CACF;AACF;;;;;;;;;;;;;;AAeA,eAAe,qBACb,OACA,OACA,IACA,OACc;CACd,IAAI,MAAM,WAAW,GAAG,OAAO,CAAC;CAChC,IAAI,SAAS,MAAM,QACjB,OAAO,QAAQ,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,CAAC,CAAC;CAE9C,MAAM,UAAe,MAAM,KAAK,EAAE,QAAQ,MAAM,OAAO,CAAC;CACxD,IAAI,OAAO;CACX,MAAM,SAAS,YAA2B;EACxC,OAAO,MAAM;GACX,mBAAiB,KAAK;GACtB,MAAM,MAAM;GACZ,QAAQ;GACR,IAAI,OAAO,MAAM,QAAQ;GACzB,MAAM,OAAO,MAAM;GACnB,IAAI,SAAS,KAAA,GAAW;GAExB,QAAQ,OAAO,MAAM,GAAG,IAAI;EAC9B;CACF;CACA,MAAM,UAA2B,CAAC;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,GAAG,QAAQ,KAAK,OAAO,CAAC;CACxD,MAAM,QAAQ,IAAI,OAAO;CACzB,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,OAA2B,SAAyB;CAC/E,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK,IAAI,GAAG,OAAO;CACnD,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GAAG,OAAO,KAAK,IAAI,GAAG,OAAO;CACrE,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;AACtC;;;;;AAMA,SAAS,mBAAyB,MAA0B;CAC1D,MAAM,UAAU,KAAK,SAAS;CAC9B,IAAI,OAAO,YAAY,YAAY,QAAQ,SAAS,GAAG,OAAO;CAC9D,OAAO,KAAK,MAAM,KAAK,QAAQ;AACjC;;;;;AAMA,SAAS,gBAAwB;CAC/B,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC;AAC9C;;;;;;;;;;;;;;;;;;;;;;;;ACnbA,SAAgBC,YAAU,GAA0C;CAClE,OAAO,MAAM,QAAQ,OAAO,MAAM,YAAY,CAAC,MAAM,QAAQ,CAAC;AAChE;;;;;;AAOA,SAAgB,WAAW,GAAY,GAAqB;CAC1D,IAAI,MAAM,GAAG,OAAO;CAIpB,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG,OAAO,aAAa,GAAG,CAAC;CAClE,IAAI,CAACA,YAAU,CAAC,KAAK,CAACA,YAAU,CAAC,GAAG,OAAO;CAC3C,OAAO,cAAc,GAAG,CAAC;AAC3B;;;;;AAMA,SAAS,aAAa,GAAY,GAAqB;CACrD,IAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,GAAG,OAAO;CACnD,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GACjC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;CAEtC,OAAO;AACT;;;;;AAMA,SAAS,cAAc,GAA4B,GAAqC;CACtF,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS;CACnC,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS;CACnC,IAAI,GAAG,WAAW,GAAG,QAAQ,OAAO;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,GAAG;EACrC,MAAM,KAAK,GAAG;EACd,MAAM,KAAK,GAAG;EACd,IAAI,OAAO,KAAA,KAAa,OAAO,KAAA,KAAa,OAAO,IAAI,OAAO;EAC9D,IAAI,CAAC,WAAW,EAAE,KAAK,EAAE,GAAG,GAAG,OAAO;CACxC;CACA,OAAO;AACT;;;;;AAMA,SAAgB,eAAqC;CACnD,OAAO,KAAK,iBAAiB,SAAmD;EAC9E,IAAI,KAAK,SAAS,KAAA,GAAW,OAAO,KAAA;EACpC,IAAI,EAAE,cAAc,KAAK,OAAO,OAAO,KAAA;EACvC,MAAM,WAAW,KAAK,KAAK;EAC3B,MAAM,UAAU,WAAW,KAAK,QAAQ,QAAQ;EAChD,OAAO;GAAE,OAAO,UAAU,IAAI;GAAG,QAAQ,UAAU,UAAU;EAAW;CAC1E,CAAC;AACH;;;;;;AAWA,SAAgB,WAAiB,IAAoC;CACnE,OAAO,KAAK,cAAc,OAAO,SAAsD;EAErF,OAAO,gBAAgB,MADL,GAAG,IAAI,CACC;CAC5B,CAAC;AACH;;;;;;;;;AAgBA,SAAgB,UAAgB,QAAqC;CACnE,MAAM,QAAQ,OAAO,SAAS;EAAE,KAAK;EAAG,KAAK;CAAE;CAC/C,MAAM,eAAe,KAAK,2BAA2B,SACnD,cAAc,OAAO,QAAQ,OAAO,IAAI,CAC1C;CACA,MAAM,QAAQ,KAAK,oBAAoB,UACrC,YAAY,OAAO,KAAK,CAC1B;CAEA,OAAO,QAAQ,aADD,SAAS;EAAC;EAAc,OAAO;EAAO;CAAK,CACzB,CAAC;AACnC;;;;;AAMA,SAAgB,cACd,QACA,OACA,MACQ;CACR,OAAO;EACL;EACA;EACA;EACA;EACA;EACA,yEAAyE,OAAO,MAAM,GAAG,EAAE,IAAI,OAAO,MAAM,GAAG,EAAE;EACjH;EACA;EACA;EACA,KAAK,UAAU,KAAK,KAAK;EACzB;EACA;EACA,KAAK,UAAU,KAAK,MAAM;CAC5B,CAAC,CAAC,KAAK,IAAI;AACb;;;;;;;;AASA,SAAgB,YACd,OACA,OACmB;CAEnB,MAAM,YAAY,oBADF,MAAM,KACsB,CAAC;CAC7C,IAAI,cAAc,KAAA,GAAW,OAAO,KAAA;CACpC,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,SAAS;CAC/B,QAAQ;EACN;CACF;CACA,IAAI,CAACA,YAAU,MAAM,GAAG,OAAO,KAAA;CAC/B,MAAM,YAAY,OAAO;CACzB,IAAI,OAAO,cAAc,YAAY,CAAC,OAAO,SAAS,SAAS,GAAG,OAAO,KAAA;CACzE,MAAM,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;CAClE,MAAM,aAAa,OAAO;CAC1B,MAAM,SAAS,OAAO,eAAe,WAAW,aAAa,KAAA;CAC7D,OAAO,WAAW,KAAA,IAAY,EAAE,OAAO,QAAQ,IAAI;EAAE,OAAO;EAAS;CAAO;AAC9E;;;;;;AAOA,SAAgB,oBAAoB,MAAkC;CACpE,IAAI,KAAK,WAAW,GAAG,GAAG,OAAO;CACjC,MAAM,QAAQ,KAAK,QAAQ,GAAG;CAC9B,MAAM,MAAM,KAAK,YAAY,GAAG;CAChC,IAAI,UAAU,MAAM,QAAQ,MAAM,MAAM,OAAO,OAAO,KAAA;CACtD,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC;AAClC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1IA,SAAgB,mBACd,SACA,UACA,UAAoC,CAAC,GACnB;CAClB,MAAM,kBAAkB,QAAQ,mBAAmB;CACnD,MAAM,iBAAiB,QAAQ,kBAAkB;CAEjD,MAAM,SAA4B,CAAC;CAEnC,MAAM,aAAa,QAAQ,QAAQ,YAAY,SAAS,QAAQ;CAChE,OAAO,KAAK;EACV,QAAQ;EACR,UAAU,SAAS,QAAQ;EAC3B,SAAS,QAAQ,QAAQ;EACzB,OAAO;EACP,eAAe,aAAa,CAAC;CAC/B,CAAC;CAED,MAAM,cAAc,oBAAoB,SAAS,QAAQ;CACzD,KAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,IAAI,QAAQ,QAAQ,YAAY,SAAS;EAC/C,MAAM,IAAI,SAAS,QAAQ,YAAY,SAAS;EAChD,MAAM,IAAI,IAAI;EACd,OAAO,KAAK;GACV,QAAQ,eAAe;GACvB,UAAU;GACV,SAAS;GACT,OAAO;GACP,eAAe,IAAI,CAAC;EACtB,CAAC;CACH;CAEA,MAAM,KAAK,SAAS,QAAQ;CAC5B,MAAM,KAAK,QAAQ,QAAQ;CAC3B,MAAM,aAAa,KAAK;CACxB,MAAM,aAAa,OAAO,IAAK,KAAK,IAAI,WAAW,IAAK,aAAa;CACrE,OAAO,KAAK;EACV,QAAQ;EACR,UAAU;EACV,SAAS;EACT,OAAO;EACP,eAAe,aAAa;CAC9B,CAAC;CAED,MAAM,WAAW,iBAAiB,SAAS,UAAU,iBAAiB,cAAc;CAGpF,OAAO;EAAE,IAFE,CAAC,OAAO,MAAM,MAAM,EAAE,aAAa,KAAK,CAAC,SAAS,MAAM,MAAM,EAAE,aAAa;EAE3E;EAAQ;CAAS;AAChC;;;;;;;;AASA,SAAS,iBACP,SACA,UACA,iBACA,gBACgB;CAChB,MAAM,gBAAgB,iBAAiB,QAAQ,KAAK;CACpD,MAAM,iBAAiB,iBAAiB,SAAS,KAAK;CACtD,MAAM,0BAAU,IAAI,IAAY,CAAC,GAAG,cAAc,KAAK,GAAG,GAAG,eAAe,KAAK,CAAC,CAAC;CAEnF,MAAM,MAAsB,CAAC;CAC7B,KAAK,MAAM,MAAM,SAAS;EACxB,MAAM,IAAI,cAAc,IAAI,EAAE;EAC9B,MAAM,IAAI,eAAe,IAAI,EAAE;EAC/B,MAAM,EAAE,cAAc,mBAAmB,qBAAqB,GAAG,GAAG,eAAe;EACnF,MAAM,EAAE,YAAY,eAAe,oBAAoB,wBACrD,GACA,GACA,cACF;EACA,MAAM,gBAAgB,GAAG,OAAO,QAAQ,GAAG,OAAO;EAClD,IAAI,KAAK;GACP,SAAS;GACT,GAAI,MAAM,KAAA,IAAY,EAAE,UAAU,EAAE,IAAI,CAAC;GACzC,GAAI,MAAM,KAAA,IAAY,EAAE,SAAS,EAAE,IAAI,CAAC;GACxC;GACA;GACA,eAAe,kBAAkB,mBAAmB;EACtD,CAAC;CACH;CACA,OAAO;AACT;;;;;;AAOA,SAAS,qBACP,GACA,GACA,iBACmE;CACnE,MAAM,eAAuC,CAAC;CAC9C,IAAI,iBAAiB;CACrB,MAAM,8BAAc,IAAI,IAAY,CAClC,GAAG,OAAO,KAAK,GAAG,UAAU,CAAC,CAAC,GAC9B,GAAG,OAAO,KAAK,GAAG,UAAU,CAAC,CAAC,CAChC,CAAC;CACD,KAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,QAAQ,YAAY,GAAG,OAAO,KAAK,IAAI,YAAY,GAAG,OAAO,KAAK;EACxE,aAAa,QAAQ;EACrB,IAAI,QAAQ,CAAC,iBAAiB,iBAAiB;CACjD;CACA,OAAO;EAAE;EAAc;CAAe;AACxC;;;;;;;AAQA,SAAS,wBACP,GACA,GACA,gBACgD;CAChD,MAAM,gBAAgB,GAAG,YAAY;CACrC,MAAM,eAAe,GAAG,YAAY;CACpC,MAAM,aAAa,eAAe;CAKlC,OAAO;EAAE;EAAY,eAHnB,gBAAgB,IACZ,aAAa,gBAAgB,iBAC7B,eAAe,KAAK,kBAAkB,KAAK,iBAAiB;CAC/B;AACrC;;;;;;;AAQA,SAAS,YAAY,GAAoB;CACvC,IAAI,MAAM,KAAA,KAAa,MAAM,MAAM,OAAO;CAC1C,IAAI,OAAO,MAAM,UAAU,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI;CAC3D,IAAI,OAAO,MAAM,YAAY,WAAW,GAAG;EACzC,MAAM,IAAK,EAA8B;EACzC,OAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;CAC3D;CACA,OAAO;AACT;;;;AAKA,SAAS,iBACP,OACkC;CAClC,MAAM,oBAAI,IAAI,IAAiC;CAC/C,KAAK,MAAM,KAAK,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC;CACzC,OAAO;AACT;;;;AAKA,SAAS,oBAAoB,GAAgB,GAA0B;CAKrE,OAAO,CAAC,mBAAG,IAJO,IAAY,CAC5B,GAAG,OAAO,KAAK,EAAE,QAAQ,WAAW,GACpC,GAAG,OAAO,KAAK,EAAE,QAAQ,WAAW,CACtC,CACe,CAAC,CAAC,CAAC,SAAS;AAC7B;;;;;;;AAQA,eAAsB,cAAc,MAAoC;CACtE,MAAM,OAAO,MAAM,SAAS,MAAM,MAAM;CACxC,MAAM,SAAkB,KAAK,MAAM,IAAI;CACvC,gBAAgB,QAAQ,IAAI;CAC5B,OAAO;AACT;;;;AAKA,eAAsB,eAAe,MAAc,QAAoC;CACrF,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9C,MAAM,UAAU,MAAM,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,KAAK,MAAM;AACtE;;;;AAKA,SAAS,gBAAgB,OAAgB,MAA4C;CACnF,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,MAAM,eAAe,KAAK,kBAAkB;CAExD,MAAM,IAAI;CACV,IAAI,OAAO,EAAE,cAAc,YAAY,OAAO,EAAE,WAAW,UACzD,MAAM,IAAI,MAAM,eAAe,KAAK,0BAA0B;CAEhE,IAAI,CAAC,MAAM,QAAQ,EAAE,KAAK,KAAK,OAAO,EAAE,YAAY,YAAY,EAAE,YAAY,MAC5E,MAAM,IAAI,MAAM,eAAe,KAAK,uBAAuB;AAE/D;;;ACnPA,MAAa,iCAAsC,IAAI,IAAI,CAAC,UAAU,UAAU,CAAC;AAEjF,MAAa,kBAAgC,OAAO,OAAO;CACzD,6BAA6B;EAC3B,mBAAmB;EACnB,oBAAoB;EACpB,0BAA0B;EAC1B,yBAAyB;CAC3B;CACA,6BAA6B;EAC3B,mBAAmB;EACnB,oBAAoB;EACpB,0BAA0B;EAC1B,yBAAyB;CAC3B;CACA,6BAA6B;EAC3B,mBAAmB;EACnB,oBAAoB;EACpB,0BAA0B;EAC1B,yBAAyB;CAC3B;CACA,+BAA+B;EAC7B,mBAAmB;EACnB,oBAAoB;EACpB,0BAA0B;EAC1B,yBAAyB;CAC3B;CACA,8BAA8B;EAC5B,mBAAmB;EACnB,oBAAoB;EACpB,0BAA0B;EAC1B,yBAAyB;CAC3B;CAEA,iBAAiB;EACf,mBAAmB;EACnB,oBAAoB;EACpB,0BAA0B;CAC5B;CACA,sBAAsB;EACpB,mBAAmB;EACnB,oBAAoB;EACpB,0BAA0B;CAC5B;CAEA,yBAAyB;EAAE,mBAAmB;EAAM,oBAAoB;CAAI;CAC5E,2BAA2B;EAAE,mBAAmB;EAAO,oBAAoB;CAAI;AACjF,CAAC;;;;AAKD,SAAgB,YAAY,UAAkB,UAA0B;CACtE,OAAO,GAAG,SAAS,GAAG;AACxB;;;;;;;AAQA,SAASC,SAAO,OAAuB;CACrC,OAAO,KAAK,MAAM,QAAQ,GAAG,IAAI;AACnC;;;;;;;;AASA,SAAS,0BAA0B,UAA6C;CAC9E,IAAI,CAAC,eAAe,IAAI,QAAQ,GAAG,OAAO,KAAA;CAC1C,OAAO;EACL,WAAW;EACX,WAAW;EACX,YAAY;EACZ,UAAU;EACV,aAAa;CACf;AACF;;;;;;;;;;AAWA,SAAS,qBACP,sBACA,WACA,oBACA,mBACuE;CACvE,IAAI,YAAY,GAAG;EACjB,IAAI,oBACF,OAAO;GAAE,gBAAgB;GAAsB,uBAAuBA,SAAO,iBAAiB;EAAE;EAElG,OAAO;GACL,gBAAgB,uBAAuB;GACvC,uBAAuB,KAAA;EACzB;CACF;CACA,OAAO;EAAE,gBAAgB;EAAsB,uBAAuB,KAAA;CAAU;AAClF;;;;;;;;;;;;AAaA,SAAgB,aACd,OACA,SACA,UAC2B;CAC3B,IAAI,YAAY,KAAA,GAAW,OAAO,0BAA0B,QAAQ;CAEpE,MAAM,SAAS,MAAM,uBAAuB;CAC5C,MAAM,cAAc,MAAM,sBAAsB;CAChD,MAAM,YAAY,MAAM,oBAAoB;CAE5C,MAAM,cAAc,KAAK,IAAI,GAAG,MAAM,eAAe,SAAS,WAAW;CACzE,MAAM,cAAc,QAAQ,4BAA4B,QAAQ;CAChE,MAAM,mBAAmB,QAAQ,2BAA2B,QAAQ;CACpE,MAAM,iBAAiB,QAAQ,yBAAyB,QAAQ;CAEhE,MAAM,gBAAiB,cAAc,QAAQ,oBAAqB;CAClE,MAAM,iBAAkB,SAAS,cAAe;CAChD,MAAM,sBAAuB,cAAc,mBAAoB;CAC/D,MAAM,oBAAqB,YAAY,iBAAkB;CAIzD,MAAM,EAAE,gBAAgB,0BAA0B,qBAHtB,KAAK,IAAI,GAAG,MAAM,gBAAgB,SACd,IAAI,QAAQ,qBAAsB,KAIhF,WACA,QAAQ,0BAA0B,KAAA,GAClC,iBACF;CASA,MAAM,YAA2B;EAC/B,WAAWA,SAPX,gBACA,iBACA,uBACC,0BAA0B,KAAA,IAAY,oBAAoB,KAC3D,cAG2B;EAC3B,WAAWA,SAAO,aAAa;EAC/B,YAAYA,SAAO,cAAc;EACjC,UAAU;EACV,aAAa;CACf;CACA,IAAI,SAAS,GAAG,UAAU,mBAAmBA,SAAO,cAAc;CAClE,IAAI,cAAc,GAAG,UAAU,kBAAkBA,SAAO,mBAAmB;CAC3E,IAAI,0BAA0B,KAAA,GAAW,UAAU,gBAAgB;CACnE,OAAO;AACT;;;ACjLA,MAAa,gBAA6B;CACxC,cAAc;CACd,kBAAkB;CAClB,cAAc;CACd,UAAU;EAAC;EAAc;EAAgB;EAAW;CAAS;AAC/D;;;;;;;;AAeA,SAAgB,kBAAkB,OAAsD;CACtF,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO,KAAA;CAClD,MAAM,UAAU,MAAM,KAAK;CAC3B,IAAI,QAAQ,WAAW,GAAG,OAAO,KAAA;CACjC,IAAI,gBAAgB,KAAK,OAAO,GAC9B,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,OAAO,IAAI,GAAI,CAAC;CAEvD,MAAM,SAAS,KAAK,MAAM,OAAO;CACjC,IAAI,OAAO,MAAM,MAAM,GAAG,OAAO,KAAA;CACjC,OAAO,KAAK,IAAI,GAAG,SAAS,KAAK,IAAI,CAAC;AACxC;;;;AAKA,SAAS,aAAa,MAAwB,QAA8B;CAC1E,OAAO,OAAO,SAAS,SAAS,IAAI;AACtC;;;;;;;;;;;;;;;;AAiBA,SAAS,eAAe,QAAwB;CAC9C,OAAO,IAAI,cAAc,WAAW,EAAE,OAAO,CAAC;AAChD;;;;;;AAOA,SAAS,uBACP,WACA,SACA,uBACkB;CAClB,MAAM,WAA2E,EAC/E,UAAU,QACZ;CACA,IAAI,UAAU,mBAAmB,KAAA,GAAW,SAAS,iBAAiB,UAAU;MAC3E,IAAI,0BAA0B,KAAA,GAAW,SAAS,iBAAiB;CACxE,IAAI,UAAU,WAAW,KAAA,GAAW,SAAS,SAAS,UAAU;CAChE,OAAO,IAAI,iBACT,UAAU,WAAW,sBAAsB,QAAQ,YACnD,QACF;AACF;;;;;AAMA,SAAS,qBACP,WACA,SACgB;CAEhB,MAAM,WAA8E,EAClF,YAFiB,UAAU,SAAS,iBAAiB,iBAAiB,UAGxE;CACA,IAAI,UAAU,SAAS,gBAAgB;EACrC,IAAI,UAAU,WAAW,KAAA,GAAW,SAAS,SAAS,UAAU;EAChE,IAAI,UAAU,SAAS,KAAA,GAAW,SAAS,OAAO,UAAU;CAC9D;CACA,OAAO,IAAI,eACT,UAAU,WAAW,GAAG,UAAU,KAAK,SAAS,QAAQ,YACxD,QACF;AACF;;;;;AAMA,SAAS,uBACP,WACA,SACA,uBACO;CACP,IAAI,UAAU,SAAS,cACrB,OAAO,uBAAuB,WAAW,SAAS,qBAAqB;CAEzE,OAAO,qBAAqB,WAAW,OAAO;AAChD;;;;;;;AAQA,SAAS,aACP,WACA,gBACA,SAC4C;CAC5C,MAAM,QAAQ,gBAAgB,gBAAgB,UAAU,CAAC;CACzD,IAAI,UAAU,SAAS,gBAAgB,UAAU,mBAAmB,KAAA,GAClE,OAAO;EAAE,OAAO,KAAK,IAAI,OAAO,UAAU,cAAc;EAAG,gBAAgB,UAAU;CAAe;CAEtG,OAAO,EAAE,MAAM;AACjB;;;;;;;;;;AAWA,eAAsB,kBACpB,IACA,SAAsB,eACtB,OACY;CACZ,MAAM,iBAAgC;EACpC,kBAAkB,OAAO;EACzB,cAAc,OAAO;EACrB,QAAQ;CACV;CACA,MAAM,SAAS,SAAS,IAAI,gBAAgB,CAAC,CAAC;CAC9C,IAAI,UAAU;CACd,IAAI;CACJ,OAAO,MAAM;EACX,IAAI,OAAO,YAAY,MACrB,MAAM,eAAe,MAAM,MAAM;EAEnC,IAAI;GACF,OAAO,MAAM,GAAG,OAAO;EACzB,SAAS,KAAc;GACrB,MAAM,YAAY,mBAAmB,GAAG;GACxC,IAAI,cAAc,KAAA,KAAa,CAAC,aAAa,UAAU,MAAM,MAAM,GAAG,MAAM;GAC5E,WAAW;GACX,IAAI,WAAW,OAAO,cACpB,MAAM,uBAAuB,WAAW,SAAS,qBAAqB;GAExE,MAAM,UAAU,aAAa,WAAW,gBAAgB,OAAO;GAC/D,wBAAwB,QAAQ,kBAAkB;GAClD,MAAM,gBAAgB,QAAQ,OAAO,QAAQ,cAAc;EAC7D;CACF;AACF;;;;AAKA,SAASC,cAAY,KAAa,KAAiC;CACjE,MAAM,QAAiB,QAAQ,IAAI,KAAK,GAAG;CAC3C,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAA;AAC7C;;;;AAKA,SAASC,cAAY,KAAa,KAAiC;CACjE,MAAM,QAAiB,QAAQ,IAAI,KAAK,GAAG;CAC3C,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAA;AAC7C;;;;;AAMA,SAAS,2BAA2B,KAA6B;CAC/D,MAAM,OAAuB,EAAE,MAAM,aAAa;CAClD,MAAM,cAAcA,cAAY,KAAK,gBAAgB;CACrD,IAAI,gBAAgB,KAAA,GAAW,KAAK,iBAAiB;CACrD,MAAM,SAASA,cAAY,KAAK,QAAQ;CACxC,IAAI,WAAW,KAAA,GAAW,KAAK,SAAS;CACxC,MAAM,UAAUD,cAAY,KAAK,SAAS;CAC1C,IAAI,YAAY,KAAA,GAAW,KAAK,UAAU;CAC1C,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,KAA6B;CACxD,MAAM,OAAuB,EAAE,MAAM,eAAe;CACpD,MAAM,SAASC,cAAY,KAAK,QAAQ;CACxC,IAAI,WAAW,KAAA,GAAW,KAAK,SAAS;CACxC,MAAM,OAAOD,cAAY,KAAK,MAAM;CACpC,IAAI,SAAS,KAAA,GAAW,KAAK,OAAO;CACpC,MAAM,UAAUA,cAAY,KAAK,SAAS;CAC1C,IAAI,YAAY,KAAA,GAAW,KAAK,UAAU;CAC1C,OAAO;AACT;;;;;AAMA,SAAS,uBAAuB,KAAa,MAA6C;CACxF,MAAM,OAAuB,EAAE,KAAK;CACpC,MAAM,UAAUA,cAAY,KAAK,SAAS;CAC1C,IAAI,YAAY,KAAA,GAAW,KAAK,UAAU;CAC1C,OAAO;AACT;;;;;;;;;AAUA,SAAS,mBAAmB,KAA0C;CACpE,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU,OAAO,KAAA;CACpD,MAAM,OAAOA,cAAY,KAAK,MAAM;CACpC,IAAI,SAAS,cAAc,OAAO,2BAA2B,GAAG;CAChE,IAAI,SAAS,gBAAgB,OAAO,oBAAoB,GAAG;CAC3D,IAAI,SAAS,aAAa,SAAS,WAAW,OAAO,uBAAuB,KAAK,IAAI;AAEvF;;;;;;;AChPA,SAAS,oBAAoB,QAAqC;CAKhE,IAAI,WAAW,QAAQ,OAAO,WAAW,UAAU,OAAO,KAAA;CAC1D,MAAM,QAAiB,QAAQ,IAAI,QAAQ,OAAO;CAClD,IAAI,OAAO,UAAU,YAAY,MAAM,SAAS,GAAG,OAAO;CAI1D,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO,KAAA;CACxD,MAAM,UAAmB,QAAQ,IAAI,OAAO,SAAS;CACrD,OAAO,OAAO,YAAY,YAAY,QAAQ,SAAS,IAAI,UAAU,KAAA;AACvE;;;;;;;;;AAUA,SAAS,sBAAsB,MAAsB;CACnD,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,IAAI;CACJ,IAAI;EACF,UAAU,oBAAoB,KAAK,MAAM,IAAI,CAAC;CAChD,QAAQ,CAER;CACA,IAAI,YAAY,KAAA,GAAW,OAAO;CAClC,OAAO,KAAK,SAAS,MAAM,GAAG,KAAK,MAAM,GAAG,GAAG,EAAE,OAAO;AAC1D;;;;;;;;AASA,eAAe,eAAe,UAAoB,UAAkC;CAClF,IAAI,OAAO;CACX,IAAI;EACF,OAAO,MAAM,SAAS,KAAK;CAC7B,QAAQ,CAER;CACA,MAAM,SAAS,sBAAsB,IAAI;CACzC,MAAM,SAAS,SAAS;CACxB,IAAI,WAAW,KACb,OAAO,IAAI,oBACT,UACA,GAAG,SAAS,gCAAgC,QAC9C;CAEF,IAAI,WAAW,OAAO,UAAU,KAAK;EACnC,MAAM,cAAc,SAAS,QAAQ,IAAI,aAAa;EACtD,OAAO,OAAO,uBACZ,IAAI,MAAM,GAAG,SAAS,aAAa,OAAO,IAAI,QAAQ,GACtD,EAAE,OAAO,GACT,gBAAgB,OAAO,EAAE,iBAAiB,EAAE,eAAe,YAAY,EAAE,IAAI,CAAC,CAChF;CACF;CACA,OAAO,IAAI,eAAe,GAAG,SAAS,aAAa,OAAO,IAAI,UAAU;EAAE;EAAQ;CAAK,CAAC;AAC1F;;;;;;;AAQA,SAAS,wBAAwB,KAAc,OAAoB,UAAyB;CAC1F,IAAI,MAAM,SAAS,MAAM;CACzB,MAAM,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;CAC9D,MAAM,OAAO,uBAAO,IAAI,MAAM,GAAG,SAAS,4BAA4B,QAAQ,GAAG,EAC/E,MAAM,UACR,CAAC;AACH;;;;;;;;AASA,eAAsB,iBACpB,KACA,UACA,SAKA,SAIqB;CACrB,IAAI;CACJ,IAAI;EACF,WAAW,MAAM,MAAM,QAAQ,KAAK;GAClC,QAAQ;GACR,SAAS,QAAQ;GACjB,MAAM,KAAK,UAAU,QAAQ,WAAW,CAAC;GACzC,QAAQ,IAAI;EACd,CAAC;CACH,SAAS,KAAc;EACrB,wBAAwB,KAAK,IAAI,OAAO,QAAQ;CAClD;CACA,IAAI,CAAC,SAAS,IAAI,MAAM,MAAM,eAAe,UAAU,QAAQ;CAC/D,IAAI,IAAI,QAAQ,OAAO,QAAQ,OAAO,QAAQ;CAC9C,MAAM,UAAmB,MAAM,SAAS,KAAK;CAC7C,OAAO,QAAQ,MAAM,OAAO;AAC9B;;;;;;;;;AAUA,eAAsB,sBACpB,UACA,KACA,UACA,SACA,mBAIqB;CACrB,MAAM,OAAO,SAAS;CACtB,IAAI,SAAS,MACX,MAAM,IAAI,eAAe,GAAG,SAAS,wCAAwC;CAE/E,MAAM,aAAa,kBAAkB,IAAI,mBAAmB,YAA2B,CAAC,EAAE;CAC1F,MAAM,SAAS,KAAK,UAAU;CAC9B,MAAM,eAAe,IAAI,YAAY;CAErC,MAAM,aAAa,YAA6C;EAC9D,IAAI;EACJ,IAAI;GACF,OAAO,MAAM,OAAO,KAAK;EAC3B,SAAS,KAAc;GACrB,wBAAwB,KAAK,IAAI,OAAO,QAAQ;EAClD;EACA,OAAO,KAAK,OAAO,KAAA,IAAY,KAAK;CACtC;CAIA,IAAI;EACF,OAAO,MAAM;GACX,MAAM,QAAQ,MAAM,WAAW;GAC/B,IAAI,UAAU,KAAA,GAAW;GACzB,KAAK,MAAM,QAAQ,QAAQ,KAAK,aAAa,OAAO,OAAO,EAAE,QAAQ,KAAK,CAAC,CAAC,GAC1E,MAAM,WAAW,OAAO,IAAI;EAEhC;CACF,UAAU;EAGR,OAAY,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC;CACrC;CACA,MAAM,OAAO,CAAC,GAAG,QAAQ,KAAK,aAAa,OAAO,CAAC,GAAG,GAAG,QAAQ,MAAM,CAAC;CACxE,KAAK,MAAM,QAAQ,MACjB,MAAM,WAAW,OAAO,IAAI;CAE9B,OAAO,WAAW,SAAS;AAC7B;;;;;;;;AASA,SAAgB,qBACd,aACA,UAC6D;CAC7D,IAAI,SAAS;CAEb,MAAM,aAAa,KAAa,QAAwB;EACtD,YAAY,IAAI,SAAS,IAAI,IAAI,IAAI,MAAM,GAAG,EAAE,IAAI,KAAK,GAAG;CAC9D;CAEA,OAAO;EACL,KAAK,MAAwB;GAC3B,UAAU;GACV,MAAM,MAAgB,CAAC;GACvB,IAAI,UAAU,OAAO,QAAQ,IAAI;GACjC,OAAO,WAAW,GAAG;IACnB,UAAU,OAAO,MAAM,GAAG,OAAO,GAAG,GAAG;IACvC,SAAS,OAAO,MAAM,UAAU,CAAC;IACjC,UAAU,OAAO,QAAQ,IAAI;GAC/B;GACA,OAAO;EACT;EACA,QAAkB;GAChB,MAAM,MAAgB,CAAC;GACvB,IAAI,OAAO,SAAS,GAAG,UAAU,QAAQ,GAAG;GAC5C,SAAS;GACT,WAAW,GAAG;GACd,OAAO;EACT;CACF;AACF;;;;;;;;AASA,SAAgB,0BACd,UACA,UACA,WACS;CACT,IAAI,OAAO,aAAa,YAAY,SAAS,SAAS,GACpD,IAAI;EACF,OAAO,KAAK,MAAM,QAAQ;CAC5B,QAAQ;EACN,MAAM,IAAI,eACR,GAAG,SAAS,oCAAoC,UAAU,mBAC5D;CACF;CAEF,OAAO,CAAC;AACV;;;;;;;AAQA,SAAgB,qBACd,UACA,MAMK;CACL,MAAM,MAAW,CAAC;CAClB,KAAK,MAAM,WAAW,UACpB,QAAQ,QAAQ,MAAhB;EACE,KAAK;GACH,IAAI,KAAK,KAAK,OAAO,QAAQ,OAAO,CAAC;GACrC;EACF,KAAK;GACH,IAAI,KAAK,KAAK,KAAK,QAAQ,OAAO,CAAC;GACnC;EACF,KAAK;GACH,IAAI,KAAK,KAAK,UAAU,QAAQ,OAAO,CAAC;GACxC;EACF,KAAK;GACH,IAAI,KAAK,KAAK,KAAK,OAAO,CAAC;GAC3B;CACJ;CAEF,OAAO;AACT;;;;;AAMA,SAAgB,sBAAsB,OAGpC;CACA,MAAM,QAAkB,CAAC;CACzB,MAAM,aAA0E,CAAC;CACjF,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,SAAS,QAAQ,MAAM,KAAK,KAAK,IAAI;MACzC,WAAW,KAAK,IAAI;CAE3B,OAAO;EAAE;EAAO;CAAW;AAC7B;;;;;;AAOA,SAAgB,kBACd,MACA,kBACuC;CACvC,OAAO;EACL,SAAS,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;EAC3D,UACE,OAAO,KAAK,aAAa,YAAY,KAAK,SAAS,SAAS,IACxD,KAAK,WACL;CACR;AACF;;;;;;;;;;;;;;;;AClUA,SAAgB,qBAGd;CACA,IAAI,aAAuB,CAAC;CAE5B,MAAM,eAAe,QAAwB;EAC3C,IAAI,WAAW,SAAS,GAAG;GACzB,IAAI,KAAK,WAAW,KAAK,IAAI,CAAC;GAC9B,aAAa,CAAC;EAChB;CACF;CAEA,OAAO,sBACJ,MAAM,QAAQ;EACb,IAAI,KAAK,WAAW,GAAG;GACrB,YAAY,GAAG;GACf;EACF;EACA,IAAI,KAAK,WAAW,GAAG,GAAG;EAC1B,IAAI,KAAK,WAAW,OAAO,GAAG;GAC5B,MAAM,QAAQ,KAAK,MAAM,CAAC;GAC1B,WAAW,KAAK,MAAM,WAAW,GAAG,IAAI,MAAM,MAAM,CAAC,IAAI,KAAK;EAChE;CACF,GACA,WACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACQA,MAAa,6BAA0D;CACrE,MAAM;CACN,KAAK;CACL,QAAQ;CACR,MAAM;CACN,OAAO;CACP,KAAK;AACP;AAEA,MAAM,oBAAoB;;;;;;AAO1B,MAAME,qBAAmB;;;;;;AAOzB,MAAM,qBAAqB;;;;;AAgB3B,SAAS,YAAY,MAAuC;CAC1D,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,IAAI,CAAC;EAAE,MAAM;EAAQ;CAAK,CAAC,IAAI,CAAC;AAC9D;;;;;;AAOA,SAAS,eAAe,SAA8D;CACpF,IAAI,OAAO,YAAY,UAAU,OAAO,YAAY,OAAO;CAC3D,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,QAAQ,SAAS;EAC1B,IAAI,KAAK,SAAS,SAChB,MAAM,IAAI,0BACR,aACA,eACA,6EACF;EAEF,OAAO,KAAK,GAAG,YAAY,KAAK,IAAI,CAAC;CACvC;CACA,OAAO;AACT;;;;;AAMA,SAAS,oBACP,SACyB;CACzB,IAAI,OAAO,YAAY,UAAU,OAAO,YAAY,OAAO;CAC3D,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,QAAQ,SACjB,IAAI,KAAK,SAAS,QAChB,OAAO,KAAK,GAAG,YAAY,KAAK,IAAI,CAAC;MAErC,OAAO,KAAK;EAAE,MAAM;EAAY,IAAI,KAAK;EAAI,MAAM,KAAK;EAAM,OAAO,KAAK;CAAM,CAAC;CAGrF,OAAO;AACT;;;;;;;;AASA,SAAgB,sBAAsB,UAGpC;CACA,MAAM,eAAyB,CAAC;CAChC,MAAM,MAA0B,CAAC;CAEjC,MAAM,eAAe,MAA4B,WAA0C;EACzF,IAAI,OAAO,WAAW,GAAG;EACzB,MAAM,OAAO,IAAI,IAAI,SAAS;EAI9B,IAAI,MAAM,SAAS,MAAM;GACvB,KAAK,QAAQ,KAAK,GAAG,MAAM;GAC3B;EACF;EACA,IAAI,KAAK;GAAE;GAAM,SAAS;EAAO,CAAC;CACpC;CAEA,KAAK,MAAM,WAAW,UACpB,QAAQ,QAAQ,MAAhB;EACE,KAAK;GACH,IAAI,IAAI,SAAS,GACf,MAAM,IAAI,0BACR,aACA,oCACA,gFACF;GAEF,aAAa,KAAK,QAAQ,OAAO;GACjC;EAEF,KAAK;GACH,YAAY,QAAQ,eAAe,QAAQ,OAAO,CAAC;GACnD;EAEF,KAAK;GACH,YAAY,aAAa,oBAAoB,QAAQ,OAAO,CAAC;GAC7D;EAEF,KAAK;GACH,YAAY,QAAQ,CAClB;IAAE,MAAM;IAAe,aAAa,QAAQ;IAAc,SAAS,QAAQ;GAAQ,CACrF,CAAC;GACD;CAEJ;CAGF,OAAO;EACL,QAAQ,aAAa,SAAS,IAAI,aAAa,KAAK,MAAM,IAAI,KAAA;EAC9D,UAAU;CACZ;AACF;;;;;AAMA,SAAgB,mBACd,OACqE;CACrE,OAAO,MAAM,KAAK,UAAU;EAC1B,MAAM,KAAK;EACX,aAAa,KAAK;EAClB,cAAc,eAAe,KAAK,YAAY;CAChD,EAAE;AACJ;;;;;;AAOA,SAAgB,oBAAoB,KAA2C;CAC7E,MAAM,EAAE,QAAQ,gBAAgB,aAAa,sBAAsB,IAAI,QAAQ;CAC/E,MAAM,eAAe,CAAC,IAAI,QAAQ,cAAc,CAAC,CAAC,QAC/C,MAAmB,OAAO,MAAM,YAAY,EAAE,SAAS,CAC1D;CACA,MAAM,SAAS,2BAA2B,IAAI;CAC9C,MAAM,mBAAmB,SAAS;CAElC,MAAM,OAAgC;EACpC,OAAO,IAAI;EACX;EACA,YACE,IAAI,eAAe,mBAAmB,SAAS,qBAAqB;CACxE;CACA,IAAI,aAAa,SAAS,GAAG,KAAK,YAAY,aAAa,KAAK,MAAM;CACtE,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,WAAW,mBAAmB,IAAI,KAAK;CACtE,IAAI,IAAI,QAAQ,KAAK,YAAY;CACjC,IAAI,kBACF,KAAK,cAAc;EAAE,MAAM;EAAW,eAAe;CAAO;MACvD;EAML,IAAI,IAAI,gBAAgB,KAAA,GAAW,KAAK,iBAAiB,IAAI;EAC7D,IAAI,IAAI,UAAU,KAAA,GAAW,KAAK,WAAW,IAAI;CACnD;CAQA,MAAM,cAAc,IAAI,mBAAmB;CAI3C,OAAO,gBAAgB,KAAA,IAAY,OAAO;EAAE,GAAG;EAAM,GAAG;CAAY;AACtE;;;;AAKA,SAAgB,0BAA0B,KAA4B;CACpE,QAAQ,KAAR;EACE,KAAK,YACH,OAAO;EACT,KAAK;EACL,KAAK,iCACH,OAAO;EACT,KAAK,WACH,OAAO;EAGT,SACE,OAAO;CACX;AACF;;;;;;;;;AAUA,SAAgB,oBAAoB,KAA2B;CAC7D,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,OAAO;EAAE,cAAc;EAAG,eAAe;CAAE;CAE7C,MAAM,QAAQ,QAAoC;EAChD,MAAM,QAAiB,QAAQ,IAAI,KAAK,GAAG;EAC3C,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAA;CAC7C;CACA,MAAM,aAAa,KAAK,yBAAyB;CACjD,MAAM,cAAc,KAAK,6BAA6B;CACtD,MAAM,SAAsB;EAC1B,eAAe,KAAK,cAAc,KAAK,MAAM,cAAc,MAAM,eAAe;EAChF,eAAe,KAAK,eAAe,KAAK;CAC1C;CACA,IAAI,eAAe,KAAA,GAAW,OAAO,sBAAsB;CAC3D,IAAI,gBAAgB,KAAA,GAAW,OAAO,qBAAqB;CAC3D,OAAO;AACT;;;;;AAMA,SAAS,uBAAuB,OAAe,OAA6C;CAC1F,MAAM,KAAc,QAAQ,IAAI,OAAO,IAAI;CAC3C,MAAM,OAAgB,QAAQ,IAAI,OAAO,MAAM;CAC/C,IAAI,OAAO,OAAO,YAAY,OAAO,SAAS,UAC5C,MAAM,IAAI,eAAe,iDAAiD,OAAO;CAEnF,OAAO;EAAE;EAAI;CAAK;AACpB;;;;;;;AAQA,SAAS,mBACP,OACA,YACA,YACM;CACN,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;CACjD,MAAM,OAAgB,QAAQ,IAAI,OAAO,MAAM;CAC/C,IAAI,SAAS,QAAQ;EACnB,MAAM,OAAgB,QAAQ,IAAI,OAAO,MAAM;EAC/C,IAAI,OAAO,SAAS,UAAU,WAAW,KAAK,IAAI;EAClD;CACF;CACA,IAAI,SAAS,YAAY;EACvB,MAAM,EAAE,IAAI,SAAS,uBAAuB,OAAO,kBAAkB;EACrE,WAAW,KAAK;GAAE;GAAI;GAAM,OAAO,QAAQ,IAAI,OAAO,OAAO;EAAE,CAAC;CAClE;AACF;;;;;;AAOA,SAAS,uBAAuB,SAG9B;CACA,MAAM,aAAuB,CAAC;CAC9B,MAAM,aAAkE,CAAC;CACzE,IAAI,MAAM,QAAQ,OAAO,GACvB,KAAK,MAAM,SAAS,SAAS,mBAAmB,OAAO,YAAY,UAAU;CAE/E,OAAO;EAAE;EAAY;CAAW;AAClC;;;;;;AAOA,SAAgB,wBAAwB,SAA8B;CACpE,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,MAAM,IAAI,eAAe,yDAAyD;CAEpF,MAAM,EAAE,YAAY,eAAe,uBAAuB,QAAQ,IAAI,SAAS,SAAS,CAAC;CACzF,OAAO;EACL,MAAM,WAAW,KAAK,EAAE;EACxB;EACA,eAAe,0BAA0B,QAAQ,IAAI,SAAS,aAAa,CAAC;EAC5E,OAAO,oBAAoB,QAAQ,IAAI,SAAS,OAAO,CAAC;CAC1D;AACF;;;;;;;;;AAUA,SAAS,mBAAmB,OAAsB;CAChD,MAAM,QAAiB,QAAQ,IAAI,OAAO,OAAO;CACjD,IAAI,aAAa;CACjB,IAAI,UAAU;CACd,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;EAC/C,MAAM,WAAoB,QAAQ,IAAI,OAAO,MAAM;EACnD,IAAI,OAAO,aAAa,YAAY,SAAS,SAAS,GAAG,aAAa;EACtE,MAAM,cAAuB,QAAQ,IAAI,OAAO,SAAS;EACzD,IAAI,OAAO,gBAAgB,YAAY,YAAY,SAAS,GAAG,UAAU;CAC3E;CACA,MAAM,SAAS,2BAA2B,WAAW,KAAK;CAC1D,IAAI;CACJ,IAAI,eAAe,oBAAoB,SAAS;MAC3C,IAAI,eAAe,aAAa,SAAS;MACzC,IAAI,eAAe,oBAAoB,SAAS;CACrD,IAAI,WAAW,KAAA,GAAW,OAAO,OAAO,OAAO,IAAI,MAAM,MAAM,GAAG,EAAE,OAAO,CAAC;CAC5E,OAAO,IAAI,eAAe,MAAM;AAClC;;;;;AAMA,SAAS,iBAAiB,OAAuB;CAC/C,MAAM,QAAiB,QAAQ,IAAI,OAAO,OAAO;CACjD,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,eAAe,2DAA2D;CAEtF,OAAO;AACT;;;;;;;;;;;;AAaA,SAAS,yBACP,YACA,UAIA;CAIA,MAAM,UAAoE,CAAC;CAC3E,MAAM,4BAAY,IAAI,IAA4C;CAClE,MAAM,6BAAa,IAAI,IAAuD;CAC9E,MAAM,QAAgC,CAAC;CACvC,IAAI;CACJ,IAAI,UAAU;CAId,MAAM,eAAe,QAAuB;EAC1C,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;EAC7C,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,GAAG,GAC3C,IAAI,OAAO,UAAU,UAAU,MAAM,OAAO;CAEhD;CAEA,MAAM,iBAAiB,OAAO,UAAiC;EAC7D,MAAM,QAAQ,iBAAiB,KAAK;EACpC,MAAM,QAAiB,QAAQ,IAAI,OAAO,eAAe;EACzD,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;EACjD,MAAM,OAAgB,QAAQ,IAAI,OAAO,MAAM;EAC/C,IAAI,SAAS,QAAQ;GACnB,MAAM,UAAmB,QAAQ,IAAI,OAAO,MAAM;GAClD,MAAM,YAAY;IAChB,MAAM;IACN,MAAM,OAAO,YAAY,WAAW,UAAU;GAChD;GACA,QAAQ,KAAK,SAAS;GACtB,UAAU,IAAI,OAAO,SAAS;GAC9B;EACF;EACA,IAAI,SAAS,YAAY;GACvB,MAAM,EAAE,IAAI,SAAS,uBAAuB,OAAO,QAAQ;GAC3D,MAAM,YAA8B;IAClC,MAAM;IACN;IACA;IACA,OAAO,QAAQ,IAAI,OAAO,OAAO,KAAK,CAAC;GACzC;GACA,QAAQ,KAAK,SAAS;GACtB,WAAW,IAAI,OAAO;IAAE,OAAO;IAAW,MAAM;GAAG,CAAC;GACpD,MAAM,SAAS;IAAE,MAAM;IAAmB;IAAI;IAAM;GAAW,CAAC;EAClE;CAGF;CAEA,MAAM,iBAAiB,OAAO,UAAiC;EAC7D,MAAM,QAAQ,iBAAiB,KAAK;EACpC,MAAM,QAAiB,QAAQ,IAAI,OAAO,OAAO;EACjD,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;EACjD,MAAM,OAAgB,QAAQ,IAAI,OAAO,MAAM;EAC/C,IAAI,SAAS,cAAc;GACzB,MAAM,OAAgB,QAAQ,IAAI,OAAO,MAAM;GAC/C,MAAM,OAAO,UAAU,IAAI,KAAK;GAChC,IAAI,OAAO,SAAS,YAAY,SAAS,KAAA,GAAW;GACpD,KAAK,QAAQ;GACb,MAAM,SAAS;IAAE,MAAM;IAAQ;IAAM;GAAW,CAAC;GACjD;EACF;EACA,IAAI,SAAS,kBAAkB;GAC7B,MAAM,WAAoB,QAAQ,IAAI,OAAO,UAAU;GACvD,IAAI,OAAO,aAAa,UACtB,MAAM,SAAS;IAAE,MAAM;IAAa,MAAM;IAAU;GAAW,CAAC;GAElE;EACF;EACA,IAAI,SAAS,oBAAoB;GAC/B,MAAM,UAAmB,QAAQ,IAAI,OAAO,cAAc;GAC1D,MAAM,OAAO,WAAW,IAAI,KAAK;GACjC,IAAI,OAAO,YAAY,YAAY,SAAS,KAAA,GAAW;GACvD,KAAK,QAAQ;GACb,MAAM,SAAS;IACb,MAAM;IACN,IAAI,KAAK,MAAM;IACf,OAAO;IACP;GACF,CAAC;EACH;CAEF;CAEA,MAAM,gBAAgB,OAAO,UAAiC;EAC5D,MAAM,QAAQ,iBAAiB,KAAK;EACpC,MAAM,OAAO,WAAW,IAAI,KAAK;EACjC,UAAU,OAAO,KAAK;EACtB,IAAI,SAAS,KAAA,GAAW;EACxB,WAAW,OAAO,KAAK;EACvB,IAAI,KAAK,KAAK,SAAS,GACrB,IAAI;GACF,KAAK,MAAM,QAAQ,KAAK,MAAM,KAAK,IAAI;EACzC,QAAQ;GACN,MAAM,IAAI,eACR,wCAAwC,KAAK,MAAM,KAAK,mBAC1D;EACF;EAEF,MAAM,SAAS;GACb,MAAM;GACN,IAAI,KAAK,MAAM;GACf,OAAO,KAAK,MAAM;GAClB;EACF,CAAC;CACH;CAEA,OAAO;EACL,MAAM,OAAO,MAA6B;GACxC,IAAI;GACJ,IAAI;IACF,QAAQ,KAAK,MAAM,IAAI;GACzB,QAAQ;IACN,MAAM,IAAI,eAAe,kDAAkD;GAC7E;GACA,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;GACjD,QAAQ,QAAQ,IAAI,OAAO,MAAM,GAAjC;IACE,KAAK,iBAAiB;KACpB,MAAM,UAAmB,QAAQ,IAAI,OAAO,SAAS;KACrD,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,YAAY,QAAQ,IAAI,SAAS,OAAO,CAAC;KAE3C;IACF;IACA,KAAK;KACH,MAAM,eAAe,KAAK;KAC1B;IACF,KAAK;KACH,MAAM,eAAe,KAAK;KAC1B;IACF,KAAK;KACH,MAAM,cAAc,KAAK;KACzB;IACF,KAAK,iBAAiB;KACpB,MAAM,QAAiB,QAAQ,IAAI,OAAO,OAAO;KACjD,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;MAC/C,MAAM,MAAe,QAAQ,IAAI,OAAO,aAAa;MACrD,IAAI,OAAO,QAAQ,UAAU,cAAc;KAC7C;KACA,YAAY,QAAQ,IAAI,OAAO,OAAO,CAAC;KACvC;IACF;IACA,KAAK;KACH,UAAU;KACV,MAAM,SAAS;MACb,MAAM;MACN;MACA,eAAe,0BAA0B,WAAW;MACpD,OAAO,oBAAoB,KAAK;KAClC,CAAC;KACD;IACF,KAAK,SACH,MAAM,mBAAmB,KAAK;IAEhC,SACE;GACJ;EACF;EACA,WAAuB;GACrB,IAAI,CAAC,SACH,MAAM,IAAI,eACR,mFACF;GAEF,OAAO,wBAAwB;IAAE;IAAS;IAAa;GAAM,CAAC;EAChE;CACF;AACF;;;;;;AAOA,eAAeC,uBAAqB,UAAoB,KAAuC;CAC7F,OAAO,sBAAsB,UAAU,KAAK,aAAa,mBAAmB,IAAI,aAC9E,yBAAyB,IAAI,YAAY,QAAQ,CACnD;AACF;AAKA,MAAMC,+BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;;AAOD,MAAa,mCACX,SAC0B;CAC1B,MAAM,UAAU,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;CAClE,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,oBACR,mDACA,WACF;CAEF,MAAM,YACJ,OAAO,KAAK,aAAa,YAAY,KAAK,SAAS,SAAS,IACxD,KAAK,WACLF,mBAAAA,CACJ,QAAQ,QAAQ,EAAE;CAEpB,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,KAAuC;GACvD,OAAO,iBACL,KACA,aACA;IACE,KAAK,GAAG,SAAS;IACjB,SAAS;KACP,gBAAgB;KAChB,aAAa;KACb,qBAAqB;IACvB;IACA,kBAAkB,oBAAoB,GAAG;GAC3C,GACA;IACE,SAAS,aAAaC,uBAAqB,UAAU,GAAG;IACxD,OAAO;GACT,CACF;EACF;EACA,WAAW,eAAeC,aAAU,IAAI,UAAU;CACpD;AACF;;;;;;;;;;ACrnBA,SAAgB,2BAA2B,QAAwC;CACjF,MAAM,SAAS,2BAA2B;CAC1C,IAAI,WAAW,GACb,OAAO;EAAE,kBAAkB,CAAC;EAAG,gBAAgB;CAAM;CAEvD,OAAO;EACL,kBAAkB,EAChB,WAAW,EAIT,UAAU;GAAE,MAAM;GAAW,cAAc;EAAO,EACpD,EACF;EACA,gBAAgB;CAClB;AACF;;;;;AAMA,SAAgB,0BAA0B,KAAgD;CACxF,OAAO,wBAAwB,GAAG;AACpC;AAEA,MAAMC,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;AAMD,MAAa,4BAA4B,SAAwC;CAC/E,IAAI,kBAAkB,MAAM,WAAW,MAAM,UAC3C,OAAO,gCAAgC,IAAI;CAE7C,OAAO,gCAAgC,IAAI;AAC7C;;;;;;AAOA,MAAM,mCAAmC,SAA6C;CACpF,MAAM,UAAU,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;CAClE,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,oBACR,mDACA,WACF;CAEF,MAAM,WAAW,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW,KAAA;CAErE,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,UAAoC;GACpD,MAAM,MAAM,MAAM,mBAAiC,mBAAmB;GACtE,MAAM,SAA+C,EAAE,QAAQ,QAAQ;GACvE,IAAI,aAAa,KAAA,GAAW,OAAO,UAAU;GAE7C,OADiB,IAAI,gBAAgB,MACvB,CAAC,CAAC,QAAQ;EAC1B;EACA,kBAAkB;EAClB,iBAAiB;EACjB,WAAW,eAAeA,YAAU,IAAI,UAAU;CACpD;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACxCA,MAAM,qCAGF;CACF,KAAK;CACL,QAAQ;CACR,MAAM;CACN,OAAO;CACP,KAAK;AACP;;;;;;AAmBA,SAASC,kBACP,SACA,UACgD;CAChD,IAAI,OAAO,YAAY,UAAU,OAAO;CACxC,MAAM,QAA+C,CAAC;CACtD,KAAK,MAAM,QAAQ,SAAS;EAC1B,IAAI,KAAK,SAAS,SAChB,MAAM,IAAI,0BACR,UACA,eACA,6EACF;EAEF,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC,SAAS,GAAG,MAAM,KAAK;GAAE,MAAM;GAAQ,MAAM,KAAK;EAAK,CAAC;CAC/E;CACA,OAAO,MAAM,SAAS,IAAI,QAAQ;AACpC;;;;;;AAOA,SAASC,uBAAqB,SAAuD;CACnF,IAAI,OAAO,YAAY,UAAU,OAAO;EAAE,MAAM;EAAa;CAAQ;CACrE,MAAM,EAAE,OAAO,eAAe,sBAAsB,OAAO;CAC3D,MAAM,aAA6B,WAAW,KAAK,UAAU;EAC3D,IAAI,KAAK;EACT,MAAM;EACN,UAAU;GAAE,MAAM,KAAK;GAAM,WAAW,KAAK,UAAU,KAAK,KAAK;EAAE;CACrE,EAAE;CACF,MAAM,OAAO,MAAM,KAAK,EAAE;CAG1B,MAAM,UAAuB;EAC3B,MAAM;EACN,SAAS,KAAK,SAAS,KAAK,WAAW,WAAW,IAAI,OAAO;CAC/D;CACA,IAAI,WAAW,SAAS,GAAG,QAAQ,aAAa;CAChD,OAAO;AACT;;;;;;;AAQA,SAAgB,iBACd,UACA,UACe;CACf,OAAO,qBAAkC,UAAU;EACjD,SAAS,aAAa;GAAE,MAAM;GAAU;EAAQ;EAChD,OAAO,aAAa;GAAE,MAAM;GAAQ,SAASD,kBAAgB,SAAS,QAAQ;EAAE;EAChF,WAAWC;EACX,OAAO,aAAa;GAClB,MAAM;GACN,cAAc,QAAQ;GACtB,SAAS,QAAQ;EACnB;CACF,CAAC;AACH;;;;;AAMA,SAAgB,cAAc,OAG3B;CACD,OAAO,MAAM,KAAK,UAAU;EAC1B,MAAM;EACN,UAAU;GACR,MAAM,KAAK;GACX,aAAa,KAAK;GAClB,YAAY,eAAe,KAAK,YAAY;EAC9C;CACF,EAAE;AACJ;;;;;;;AAQA,SAAgB,4BACd,KACA,SACyB;CACzB,MAAM,WAA0B,CAAC;CACjC,IAAI,IAAI,WAAW,KAAA,KAAa,IAAI,OAAO,SAAS,GAClD,SAAS,KAAK;EAAE,MAAM;EAAU,SAAS,IAAI;CAAO,CAAC;CAEvD,SAAS,KAAK,GAAG,iBAAiB,IAAI,UAAU,QAAQ,IAAI,CAAC;CAE7D,MAAM,OAAgC;EACpC,OAAO,IAAI;EACX;CACF;CACA,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,WAAW,cAAc,IAAI,KAAK;CACjE,IAAI,IAAI,eAAe,KAAA,GAAW,KAAK,QAAQ,qBAAqB,IAAI;CACxE,IAAI,IAAI,gBAAgB,KAAA,GAAW,KAAK,iBAAiB,IAAI;CAC7D,IAAI,IAAI,UAAU,KAAA,GAAW,KAAK,WAAW,IAAI;CACjD,IAAI,IAAI,WAAW,QACjB,KAAK,sBAAsB,mCAAmC,IAAI;CAEpE,IAAI,IAAI,QAAQ;EACd,KAAK,YAAY;EAGjB,IAAI,QAAQ,sBAAsB,KAAK,oBAAoB,EAAE,eAAe,KAAK;CACnF;CAMA,MAAM,cAAc,IAAI,mBAAmB,QAAQ;CACnD,OAAO,gBAAgB,KAAA,IAAY,OAAO;EAAE,GAAG;EAAM,GAAG;CAAY;AACtE;;;;AAKA,SAAgB,uBAAuB,KAA4B;CACjE,QAAQ,KAAR;EACE,KAAK,cACH,OAAO;EACT,KAAK,UACH,OAAO;EACT,KAAK,kBACH,OAAO;EAET,SACE,OAAO;CACX;AACF;;;;;AAMA,SAAS,YAAY,QAAgB,KAAiC;CACpE,MAAM,QAAiB,QAAQ,IAAI,QAAQ,GAAG;CAC9C,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAA;AAC7C;;;;;;;;;AAUA,SAAgB,eAAe,KAAc,SAA+C;CAC1F,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;EAC3C,IAAI,QAAQ,gBAAgB,OAAO;GAAE,cAAc;GAAG,eAAe;EAAE;EACvE,MAAM,IAAI,eACR,GAAG,QAAQ,KAAK,8CAClB;CACF;CACA,MAAM,SAAsB;EAC1B,cAAc,YAAY,KAAK,eAAe,KAAK;EACnD,eAAe,YAAY,KAAK,mBAAmB,KAAK;CAC1D;CACA,MAAM,iBAA0B,QAAQ,IAAI,KAAK,uBAAuB;CACxE,IAAI,mBAAmB,QAAQ,OAAO,mBAAmB,UAAU;EACjE,MAAM,SAAS,YAAY,gBAAgB,eAAe;EAC1D,IAAI,WAAW,KAAA,GAAW,OAAO,sBAAsB;CACzD;CACA,MAAM,qBAA8B,QAAQ,IAAI,KAAK,2BAA2B;CAChF,IAAI,uBAAuB,QAAQ,OAAO,uBAAuB,UAAU;EACzE,MAAM,YAAY,YAAY,oBAAoB,kBAAkB;EACpE,IAAI,cAAc,KAAA,GAAW,OAAO,mBAAmB;CACzD;CACA,OAAO;AACT;;;;;;AAOA,SAAS,gBAAgB,KAAc,UAAoD;CACzF,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,MAAM,IAAI,eAAe,GAAG,SAAS,gDAAgD;CAEvF,MAAM,KAAc,QAAQ,IAAI,KAAK,IAAI;CACzC,MAAM,KAAc,QAAQ,IAAI,KAAK,UAAU;CAC/C,IAAI,OAAO,OAAO,YAAY,OAAO,QAAQ,OAAO,OAAO,UACzD,MAAM,IAAI,eAAe,GAAG,SAAS,gDAAgD;CAEvF,MAAM,OAAgB,QAAQ,IAAI,IAAI,MAAM;CAC5C,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,eAAe,GAAG,SAAS,gDAAgD;CAIvF,OAAO;EAAE;EAAI;EAAM,OADL,0BAA0B,QAAQ,IAAI,IAAI,WAAW,GAAG,UAAU,IACzD;CAAE;AAC3B;;;;;;AAOA,SAAgB,sBACd,SACA,SACY;CACZ,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,MAAM,IAAI,eACR,GAAG,QAAQ,KAAK,+CAClB;CAEF,MAAM,UAAmB,QAAQ,IAAI,SAAS,SAAS;CACvD,MAAM,SAAkB,MAAM,QAAQ,OAAO,IAAI,QAAQ,KAAK,KAAA;CAC9D,IAAI,WAAW,QAAQ,WAAW,KAAA,KAAa,OAAO,WAAW,UAC/D,MAAM,IAAI,eAAe,GAAG,QAAQ,KAAK,iCAAiC;CAE5E,MAAM,UAAmB,QAAQ,IAAI,QAAQ,SAAS;CACtD,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,MAAM,IAAI,eAAe,GAAG,QAAQ,KAAK,wCAAwC;CAEnF,MAAM,UAAmB,QAAQ,IAAI,SAAS,SAAS;CACvD,MAAM,iBAA0B,QAAQ,IAAI,SAAS,YAAY;CACjE,MAAM,aAAa,MAAM,QAAQ,cAAc,IAC3C,eAAe,KAAK,UAAU,gBAAgB,OAAO,QAAQ,IAAI,CAAC,IAClE,CAAC;CACL,OAAO;EACL,MAAM,OAAO,YAAY,WAAW,UAAU;EAC9C;EACA,eAAe,uBAAuB,QAAQ,IAAI,QAAQ,eAAe,CAAC;EAC1E,OAAO,eAAe,QAAQ,IAAI,SAAS,OAAO,GAAG,OAAO;CAC9D;AACF;;;;;;;;;;;;;;;;AAiBA,SAAgB,8BACd,SACA,YACA,UAIA;CAQA,IAAI,OAAO;CACX,MAAM,aAA6B,CAAC;CACpC,MAAM,2BAAW,IAAI,IAA0B;CAC/C,IAAI;CACJ,IAAI;CACJ,IAAI,OAAO;CAEX,MAAM,uBACJ,WAAW,UAAU,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;CAEjD,MAAM,mBAAmB,YAA2B;EAClD,KAAK,MAAM,QAAQ,eAAe,GAAG;GACnC,IAAI,KAAK,QAAQ;GACjB,KAAK,SAAS;GAGd,MAAM,EAAE,UAAU,gBAChB;IAAE,IAAI,KAAK;IAAI,UAAU;KAAE,MAAM,KAAK;KAAM,WAAW,KAAK;IAAU;GAAE,GACxE,QAAQ,IACV;GAEA,MAAM,SAAS;IAAE,MAAM;IAAiB,IAAI,KAAK;IAAI;IAAO;GAAW,CAAC;EAC1E;CACF;CAEA,MAAM,qBAAqB,OAAO,UAAkC;EAClE,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,eACR,GAAG,QAAQ,KAAK,8CAClB;EAEF,MAAM,QAAiB,QAAQ,IAAI,OAAO,OAAO;EACjD,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,eACR,GAAG,QAAQ,KAAK,sDAClB;EAEF,MAAM,KAAc,QAAQ,IAAI,OAAO,UAAU;EACjD,IAAI,OAAO,SAAS,IAAI,KAAK;EAC7B,IAAI,SAAS,KAAA,GAAW;GACtB,MAAM,KAAc,QAAQ,IAAI,OAAO,IAAI;GAC3C,MAAM,OACJ,OAAO,QAAQ,OAAO,OAAO,WAAW,QAAQ,IAAI,IAAI,MAAM,IAAI,KAAA;GACpE,IAAI,OAAO,OAAO,YAAY,OAAO,SAAS,UAC5C,MAAM,IAAI,eACR,GAAG,QAAQ,KAAK,4DAClB;GAEF,OAAO;IAAE;IAAO;IAAI;IAAM,WAAW;IAAI,QAAQ;GAAM;GACvD,SAAS,IAAI,OAAO,IAAI;GACxB,WAAW,KAAK,IAAI;GACpB,MAAM,SAAS;IAAE,MAAM;IAAmB;IAAI;IAAM;GAAW,CAAC;EAClE;EACA,IAAI,OAAO,QAAQ,OAAO,OAAO,UAAU;EAC3C,MAAM,OAAgB,QAAQ,IAAI,IAAI,WAAW;EACjD,IAAI,OAAO,SAAS,YAAY,KAAK,SAAS,GAAG;GAC/C,KAAK,aAAa;GAClB,MAAM,SAAS;IACb,MAAM;IACN,IAAI,KAAK;IACT,OAAO;IACP;GACF,CAAC;EACH;CACF;CAEA,MAAM,YAAY,OAAO,WAAkC;EACzD,MAAM,QAAiB,QAAQ,IAAI,QAAQ,OAAO;EAClD,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;GAC/C,MAAM,UAAmB,QAAQ,IAAI,OAAO,SAAS;GACrD,IAAI,OAAO,YAAY,YAAY,QAAQ,SAAS,GAAG;IACrD,QAAQ;IACR,MAAM,SAAS;KAAE,MAAM;KAAQ,MAAM;KAAS;IAAW,CAAC;GAC5D;GACA,MAAM,YAAqB,QAAQ,IAAI,OAAO,YAAY;GAC1D,IAAI,MAAM,QAAQ,SAAS,GACzB,KAAK,MAAM,SAAS,WAElB,MAAM,mBAAmB,KAAK;EAGpC;EACA,MAAM,aAAsB,QAAQ,IAAI,QAAQ,eAAe;EAC/D,IAAI,OAAO,eAAe,UAAU;GAClC,gBAAgB;GAGhB,MAAM,iBAAiB;EACzB;CACF;CAEA,OAAO;EACL,MAAM,YAAY,MAA6B;GAC7C,IAAI,SAAS,UAAU;IACrB,IAAI,MAAM;IACV,OAAO;IAEP,MAAM,iBAAiB;IACvB,MAAM,SAAS;KACb,MAAM;KACN;KACA,eAAe,uBAAuB,aAAa;KACnD,OAAO,eAAe,OAAO,OAAO;IACtC,CAAC;IACD;GACF;GACA,IAAI;GACJ,IAAI;IACF,QAAQ,KAAK,MAAM,IAAI;GACzB,QAAQ;IACN,MAAM,IAAI,eAAe,GAAG,QAAQ,KAAK,wCAAwC;GACnF;GACA,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;GACjD,MAAM,YAAqB,QAAQ,IAAI,OAAO,OAAO;GACrD,IAAI,cAAc,QAAQ,OAAO,cAAc,UAAU,QAAQ;GACjE,MAAM,UAAmB,QAAQ,IAAI,OAAO,SAAS;GACrD,MAAM,SAAkB,MAAM,QAAQ,OAAO,IAAI,QAAQ,KAAK,KAAA;GAC9D,IAAI,WAAW,QAAQ,WAAW,KAAA,KAAa,OAAO,WAAW,UAC/D,MAAM,UAAU,MAAM;EAE1B;EACA,WAAuB;GACrB,IAAI,CAAC,MACH,MAAM,IAAI,eACR,GAAG,QAAQ,KAAK,mEAClB;GAEF,MAAM,UAAU,eAAe;GAC/B,MAAM,UAAmC;IACvC,MAAM;IACN,SAAS,KAAK,SAAS,KAAK,QAAQ,WAAW,IAAI,OAAO;GAC5D;GACA,IAAI,QAAQ,SAAS,GACnB,QAAQ,gBAAgB,QAAQ,KAAK,UAAU;IAC7C,IAAI,KAAK;IACT,MAAM;IACN,UAAU;KAAE,MAAM,KAAK;KAAM,WAAW,KAAK;IAAU;GACzD,EAAE;GAEJ,OAAO,sBACL;IAAE,SAAS,CAAC;KAAE,OAAO;KAAG;KAAS,eAAe,iBAAiB;IAAK,CAAC;IAAG;GAAM,GAChF,OACF;EACF;CACF;AACF;;;;;;;;AASA,eAAe,qBACb,UACA,KACA,SACqB;CACrB,OAAO,sBAAsB,UAAU,KAAK,QAAQ,MAAM,mBAAmB,IAAI,aAAa;EAC5F,MAAM,aAAa,8BAA8B,SAAS,IAAI,YAAY,QAAQ;EAClF,OAAO;GAAE,QAAQ,WAAW;GAAa,UAAU,WAAW;EAAS;CACzE,CAAC;AACH;AAIA,MAAMC,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;;;AAQD,MAAa,oCACX,YAC0B;CAC1B,IAAI,QAAQ,KAAK,SAAS,YAAY,QAAQ,KAAK,QAAQ,WAAW,GACpE,MAAM,IAAI,oBACR,GAAG,QAAQ,KAAK,yCAChB,QAAQ,IACV;CAEF,MAAM,WAAW,QAAQ,SAAS,QAAQ,QAAQ,EAAE;CACpD,MAAM,UAAkC;EACtC,gBAAgB;EAChB,GAAG,QAAQ;CACb;CACA,IAAI,QAAQ,KAAK,SAAS,UACxB,QAAQ,mBAAmB,UAAU,QAAQ,KAAK;CAGpD,OAAO;EACL,MAAM;EACN,MAAM,QAAQ;EACd,MAAM,YAAY,KAAuC;GACvD,OAAO,iBACL,KACA,QAAQ,MACR;IACE,KAAK,GAAG,SAAS;IACjB;IACA,kBAAkB,4BAA4B,KAAK,OAAO;GAC5D,GACA;IACE,SAAS,aAAa,qBAAqB,UAAU,KAAK,OAAO;IACjE,QAAQ,YAAY,sBAAsB,SAAS,OAAO;GAC5D,CACF;EACF;EACA,WAAW,eAAeA,YAAU,IAAI,UAAU;CACpD;AACF;;;ACxiBA,MAAM,0BAAwE;CAC5E,KAAK;CACL,QAAQ;CACR,MAAM;CACN,OAAO;CACP,KAAK;AACP;;;;AAKA,SAAgB,wBAAwB,QAAwC;CAC9E,IAAI,WAAW,QACb,OAAO;EAAE,kBAAkB,CAAC;EAAG,gBAAgB;CAAM;CAEvD,OAAO;EACL,kBAAkB,EAChB,QAAQ,EAAE,iBAAiB,wBAAwB,QAAQ,EAC7D;EACA,gBAAgB;CAClB;AACF;;;;AAKA,SAAgB,uBAAuB,KAAgD;CACrF,OAAO,wBAAwB,GAAG;AACpC;AAEA,MAAMC,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;;AAOD,MAAMC,qBAAmB;;;;;AAMzB,MAAa,yBAAyB,SAAwC;CAC5E,IAAI,kBAAkB,MAAM,QAAQ,MAAM,UACxC,OAAO,6BAA6B,IAAI;CAE1C,OAAO,6BAA6B,IAAI;AAC1C;;;;;;;;;AAUA,MAAM,gCAAgC,SAA8C;CAClF,MAAM,EAAE,SAAS,aAAa,kBAAkB,MAAMA,kBAAgB;CACtE,MAAM,eAAe,OAAO,KAAK,oBAAoB,WAAW,KAAK,kBAAkB,KAAA;CAYvF,OAAO,iCAAiC;EAVtC,MAAM;EACN;EACA,MAAM;GAAE,MAAM;GAAU;EAAQ;EAChC,mBAAmB;EACnB,sBAAsB;EACtB,gBAAgB;EAChB,GAAI,iBAAiB,KAAA,IACjB,EAAE,eAAe,EAAE,uBAAuB,aAAa,EAAE,IACzD,CAAC;CAEuC,CAAC;AACjD;;;;;AAMA,MAAM,gCAAgC,SAA6C;CACjF,MAAM,UAAU,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;CAClE,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,oBACR,gDACA,QACF;CAEF,MAAM,WAAW,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW,KAAA;CACrE,MAAM,eAAe,OAAO,KAAK,oBAAoB,WAAW,KAAK,kBAAkB,KAAA;CAEvF,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,UAAoC;GACpD,MAAM,MAAM,MAAM,mBAA8B,gBAAgB;GAChE,MAAM,SAAsE,EAC1E,QAAQ,QACV;GACA,IAAI,aAAa,KAAA,GAAW,OAAO,UAAU;GAC7C,IAAI,iBAAiB,KAAA,GAAW,OAAO,eAAe;GAEtD,OADiB,IAAI,aAAa,MACpB,CAAC,CAAC,QAAQ;EAC1B;EACA,kBAAkB;EAClB,iBAAiB;EACjB,WAAW,eAAeD,YAAU,IAAI,UAAU;CACpD;AACF;;;AC/HA,MAAM,yBAAuE;CAC3E,KAAK;CACL,QAAQ;CACR,MAAM;CACN,OAAO;CACP,KAAK;AACP;;;;;AAMA,SAAgB,wBAAwB,QAAwC;CAC9E,IAAI,WAAW,QACb,OAAO;EAAE,kBAAkB,CAAC;EAAG,gBAAgB;CAAM;CAEvD,OAAO;EACL,kBAAkB,EAChB,QAAQ,EAAE,gBAAgB,EAAE,gBAAgB,uBAAuB,QAAQ,EAAE,EAC/E;EACA,gBAAgB;CAClB;AACF;;;;AAKA,SAAgB,uBAAuB,KAAgD;CAGrF,OAAO,wBAAwB,GAAG;AACpC;AAEA,MAAME,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;AAMD,MAAa,yBAAyB,SAA6C;CACjF,MAAM,UAAU,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;CAClE,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,oBACR,gDACA,QACF;CAEF,MAAM,WAAW,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW,KAAA;CAErE,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,UAAoC;GACpD,MAAM,MAAM,MAAM,mBAA8B,gBAAgB;GAChE,MAAM,SAA+C,EAAE,QAAQ,QAAQ;GACvE,IAAI,aAAa,KAAA,GAAW,OAAO,UAAU;GAE7C,OADiB,IAAI,yBAAyB,MAChC,CAAC,CAAC,QAAQ;EAC1B;EACA,kBAAkB;EAClB,iBAAiB;EACjB,WAAW,eAAeA,YAAU,IAAI,UAAU;CACpD;AACF;;;;;;;;AC5BA,SAAS,gBAAgB,SAA6C;CACpE,IAAI,OAAO,YAAY,UAAU,OAAO;CACxC,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,QAAQ,SAAS;EAC1B,IAAI,KAAK,SAAS,SAChB,MAAM,IAAI,0BACR,UACA,eACA,6EACF;EAEF,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC,SAAS,GAAG,MAAM,KAAK,KAAK,IAAI;CACvD;CAGA,OAAO,MAAM,KAAK,IAAI;AACxB;;;;;;AAOA,SAAS,qBAAqB,SAA6D;CACzF,IAAI,OAAO,YAAY,UAAU,OAAO;EAAE,MAAM;EAAa;CAAQ;CACrE,MAAM,EAAE,OAAO,eAAe,sBAAsB,OAAO;CAC3D,MAAM,UAA6B;EAAE,MAAM;EAAa,SAAS,MAAM,KAAK,EAAE;CAAE;CAChF,IAAI,WAAW,SAAS,GAItB,QAAQ,aAAa,WAAW,KAAK,UAAU,EAC7C,UAAU;EAAE,MAAM,KAAK;EAAM,WAAW,KAAK;CAAM,EACrD,EAAE;CAEJ,OAAO;AACT;;;;;;AAOA,SAAgB,mBAAmB,UAAuD;CACxF,OAAO,qBAAwC,UAAU;EACvD,SAAS,aAAa;GAAE,MAAM;GAAU;EAAQ;EAChD,OAAO,aAAa;GAAE,MAAM;GAAQ,SAAS,gBAAgB,OAAO;EAAE;EACtE,WAAW;EACX,OAAO,aAAa;GAAE,MAAM;GAAQ,WAAW,QAAQ;GAAM,SAAS,QAAQ;EAAQ;CACxF,CAAC;AACH;;;;;;AAOA,SAAgB,uBAAuB,KAA2C;CAChF,MAAM,WAAgC,CAAC;CACvC,IAAI,IAAI,WAAW,KAAA,KAAa,IAAI,OAAO,SAAS,GAClD,SAAS,KAAK;EAAE,MAAM;EAAU,SAAS,IAAI;CAAO,CAAC;CAEvD,SAAS,KAAK,GAAG,mBAAmB,IAAI,QAAQ,CAAC;CAEjD,MAAM,OAAgC;EACpC,OAAO,IAAI;EACX;EAGA,QAAQ,IAAI;CACd;CAEA,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,WAAW,cAAc,IAAI,KAAK;CAIjE,MAAM,UAAmC,CAAC;CAC1C,IAAI,IAAI,eAAe,KAAA,GAAW,QAAQ,iBAAiB,IAAI;CAC/D,IAAI,IAAI,gBAAgB,KAAA,GAAW,QAAQ,iBAAiB,IAAI;CAChE,IAAI,IAAI,UAAU,KAAA,GAAW,QAAQ,WAAW,IAAI;CACpD,IAAI,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,GAAG,KAAK,aAAa;CAKvD,MAAM,cAAc,IAAI,mBAAmB;CAC3C,OAAO,gBAAgB,KAAA,IAAY,OAAO;EAAE,GAAG;EAAM,GAAG;CAAY;AACtE;;;;;;;;AASA,SAAgB,yBAAyB,KAAc,gBAAuC;CAC5F,IAAI,gBAAgB,OAAO;CAC3B,OAAO,QAAQ,WAAW,WAAW;AACvC;;;;;;;;AASA,SAAgB,iBAAiB,SAA+B;CAC9D,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,OAAO;EAAE,cAAc;EAAG,eAAe;CAAE;CAE7C,MAAM,SAAkB,QAAQ,IAAI,SAAS,mBAAmB;CAChE,MAAM,YAAqB,QAAQ,IAAI,SAAS,YAAY;CAC5D,OAAO;EACL,cAAc,OAAO,WAAW,WAAW,SAAS;EACpD,eAAe,OAAO,cAAc,WAAW,YAAY;CAC7D;AACF;;;;;;;;AASA,SAAS,uBACP,KACA,SACA,YACkC;CAClC,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,MAAM,IAAI,eAAe,uDAAuD;CAElF,MAAM,KAAc,QAAQ,IAAI,KAAK,UAAU;CAC/C,IAAI,OAAO,QAAQ,OAAO,OAAO,UAC/B,MAAM,IAAI,eAAe,uDAAuD;CAElF,MAAM,OAAgB,QAAQ,IAAI,IAAI,MAAM;CAC5C,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,eAAe,uDAAuD;CAElF,MAAM,UAAmB,QAAQ,IAAI,KAAK,IAAI;CAC9C,MAAM,KAAK,OAAO,YAAY,YAAY,QAAQ,SAAS,IACvD,UACA,eAAe,WAAW,GAAG;CAGjC,MAAM,WAAoB,QAAQ,IAAI,IAAI,WAAW;CAKrD,OAAO;EAAE;EAAI;EAAM,OAHjB,aAAa,QAAQ,OAAO,aAAa,WACrC,WACA,0BAA0B,UAAU,UAAU,IAAI;CAC/B;AAC3B;;;;;;AAOA,SAAgB,kBAAkB,SAAkB,YAAgC;CAClF,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,MAAM,IAAI,eAAe,sDAAsD;CAEjF,MAAM,UAAmB,QAAQ,IAAI,SAAS,SAAS;CACvD,IAAI,YAAY,QAAQ,YAAY,KAAA,KAAa,OAAO,YAAY,UAClE,MAAM,IAAI,eAAe,wCAAwC;CAEnE,MAAM,UAAmB,QAAQ,IAAI,SAAS,SAAS;CACvD,MAAM,iBAA0B,QAAQ,IAAI,SAAS,YAAY;CACjE,MAAM,aAAa,MAAM,QAAQ,cAAc,IAC3C,eAAe,KAAK,OAAO,YAAY,uBAAuB,OAAO,SAAS,UAAU,CAAC,IACzF,CAAC;CACL,OAAO;EACL,MAAM,OAAO,YAAY,WAAW,UAAU;EAC9C;EACA,eAAe,yBACb,QAAQ,IAAI,SAAS,aAAa,GAClC,WAAW,SAAS,CACtB;EACA,OAAO,iBAAiB,OAAO;CACjC;AACF;;;;;;;AAQA,SAAgB,wBAGd;CACA,OAAO,sBAAsB,MAAM,QAAQ;EACzC,IAAI,KAAK,KAAK,CAAC,CAAC,SAAS,GAAG,IAAI,KAAK,IAAI;CAC3C,CAAC;AACH;;;;;;;;;;;;;;AAeA,SAAS,gCACP,YACA,UAIA;CACA,IAAI,OAAO;CACX,MAAM,aAAsD,CAAC;CAC7D,IAAI,OAAO;CACX,IAAI;CACJ,IAAI,QAAqB;EAAE,cAAc;EAAG,eAAe;CAAE;CAE7D,MAAM,aAAa,OAAO,YAAmC;EAC3D,MAAM,UAAmB,QAAQ,IAAI,SAAS,SAAS;EACvD,IAAI,OAAO,YAAY,YAAY,QAAQ,SAAS,GAAG;GACrD,QAAQ;GACR,MAAM,SAAS;IAAE,MAAM;IAAQ,MAAM;IAAS;GAAW,CAAC;EAC5D;EACA,MAAM,YAAqB,QAAQ,IAAI,SAAS,YAAY;EAC5D,IAAI,CAAC,MAAM,QAAQ,SAAS,GAAG;EAC/B,KAAK,MAAM,SAAS,WAAW;GAC7B,MAAM,OAAO,uBAAuB,OAAO,WAAW,QAAQ,UAAU;GACxE,WAAW,KAAK,IAAI;GAEpB,MAAM,SAAS;IAAE,MAAM;IAAmB,IAAI,KAAK;IAAI,MAAM,KAAK;IAAM;GAAW,CAAC;GAEpF,MAAM,SAAS;IAAE,MAAM;IAAiB,IAAI,KAAK;IAAI,OAAO,KAAK;IAAO;GAAW,CAAC;EACtF;CACF;CAEA,OAAO;EACL,MAAM,OAAO,MAA6B;GACxC,IAAI,MAAM;GACV,IAAI;GACJ,IAAI;IACF,QAAQ,KAAK,MAAM,IAAI;GACzB,QAAQ;IACN,MAAM,IAAI,eAAe,+CAA+C;GAC1E;GACA,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;GACjD,MAAM,UAAmB,QAAQ,IAAI,OAAO,SAAS;GACrD,IAAI,YAAY,QAAQ,YAAY,KAAA,KAAa,OAAO,YAAY,UAClE,MAAM,WAAW,OAAO;GAE1B,IAAI,QAAQ,IAAI,OAAO,MAAM,MAAM,MAAM;IACvC,OAAO;IACP,cAAc,QAAQ,IAAI,OAAO,aAAa;IAC9C,QAAQ,iBAAiB,KAAK;IAC9B,MAAM,SAAS;KACb,MAAM;KACN;KACA,eAAe,yBAAyB,aAAa,WAAW,SAAS,CAAC;KAC1E;IACF,CAAC;GACH;EACF;EACA,WAAuB;GACrB,IAAI,CAAC,MACH,MAAM,IAAI,eACR,kFACF;GAEF,MAAM,UAAmC;IAAE,MAAM;IAAa,SAAS;GAAK;GAC5E,IAAI,WAAW,SAAS,GAGtB,QAAQ,gBAAgB,WAAW,KAAK,UAAU;IAChD,IAAI,KAAK;IACT,UAAU;KAAE,MAAM,KAAK;KAAM,WAAW,KAAK;IAAM;GACrD,EAAE;GAEJ,OAAO,kBACL;IACE;IACA,MAAM;IACN,aAAa,eAAe;IAC5B,mBAAmB,MAAM;IACzB,YAAY,MAAM;GACpB,GACA,UACF;EACF;CACF;AACF;;;;;;AAOA,eAAe,wBAAwB,UAAoB,KAAuC;CAChG,OAAO,sBAAsB,UAAU,KAAK,UAAU,sBAAsB,IAAI,aAC9E,gCAAgC,IAAI,YAAY,QAAQ,CAC1D;AACF;AAOA,MAAMC,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;AACF,CAAC;;;;;;AAOD,MAAa,gCAAgC,SAA8C;CACzF,MAAM,eAAe,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW;CACzE,IAAI,aAAa,WAAW,GAC1B,MAAM,IAAI,oBAAoB,iDAAiD,QAAQ;CAIzF,MAAM,WAAW,aAAa,QAAQ,QAAQ,EAAE;CAEhD,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,KAAuC;GACvD,OAAO,iBACL,KACA,UACA;IACE,KAAK,GAAG,SAAS;IACjB,SAAS,EAAE,gBAAgB,mBAAmB;IAC9C,kBAAkB,uBAAuB,GAAG;GAC9C,GACA;IACE,SAAS,aAAa,wBAAwB,UAAU,GAAG;IAC3D,QAAQ,YAAY,kBAAkB,SAAS,IAAI,UAAU;GAC/D,CACF;EACF;EACA,WAAW,eAAeA,YAAU,IAAI,UAAU;CACpD;AACF;;;;;;;ACzYA,SAAgB,wBAAwB,QAAwC;CAE9E,OAAO;EAAE,kBAAkB,CAAC;EAAG,gBADf,WAAW;CAC4B;AACzD;;;;;;AAOA,MAAa,yBAAyB;AAEtC,MAAMC,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CAIA;AACF,CAAC;;;;;AAMD,MAAa,yBAAyB,SAAwC;CAC5E,IAAI,kBAAkB,MAAM,QAAQ,MAAM,UACxC,OAAO,6BAA6B,IAAI;CAE1C,OAAO,6BAA6B,IAAI;AAC1C;;;;;AAMA,MAAM,gCAAgC,SAA6C;CACjF,MAAM,WAAW,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW;CACrE,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,oBACR,iDACA,QACF;CAGF,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,UAAoC;GAGpD,QADiB,MADC,mBAA8B,eAAe,EAAA,CAC1C,aAAa,EAAE,SAAS,SAAS,CACxC,CAAC,CAAC,QAAQ;EAC1B;EACA,kBAAkB;EAClB,iBAAiB;EACjB,WAAW,eAAeA,YAAU,IAAI,UAAU;CACpD;AACF;;;;;;;ACpDA,SAAgB,0BAA0B,QAAwC;CAEhF,OAAO;EAAE,kBAAkB,CAAC;EAAG,gBADf,WAAW;CAC4B;AACzD;;;;;;AAOA,MAAa,2BAA2B;AAExC,MAAMC,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CAIA;AACF,CAAC;;;;;AAMD,MAAa,2BAA2B,SAAwC;CAC9E,IAAI,kBAAkB,MAAM,UAAU,MAAM,UAC1C,OAAO,+BAA+B,IAAI;CAE5C,OAAO,+BAA+B,IAAI;AAC5C;;;;;;;AAQA,MAAM,kCAAkC,SAA8C;CACpF,MAAM,WAAW,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW;CACrE,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,oBACR,mDACA,UACF;CAUF,OAAO,iCAAiC;EAPtC,MAAM;EACN;EACA,MAAM,EAAE,MAAM,OAAO;EACrB,mBAAmB;EACnB,sBAAsB;EACtB,gBAAgB;CAE4B,CAAC;AACjD;;;;;AAMA,MAAM,kCAAkC,SAA6C;CACnF,MAAM,WAAW,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW;CACrE,IAAI,SAAS,WAAW,GACtB,MAAM,IAAI,oBACR,mDACA,UACF;CAGF,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,UAAoC;GAUpD,QALiB,MAJC,mBAAwC,2BAA2B,EAAA,CAIhE,uBAAuB;IAC1C,MAAM;IACN,SAAS;IACT,cAAc;GAChB,CACc,CAAC,CAAC,QAAQ;EAC1B;EACA,kBAAkB;EAClB,iBAAiB;EACjB,WAAW,eAAeA,YAAU,IAAI,UAAU;CACpD;AACF;;;;;;;;;;;AC9EA,SAAgB,4BAA4B,QAAwC;CAClF,IAAI,WAAW,QAAQ,OAAO;EAAE,kBAAkB,CAAC;EAAG,gBAAgB;CAAM;CAC5E,OAAO;EACL,kBAAkB,EAChB,YAAY,EAAE,WAAW,EAAE,OAAO,EAAE,EACtC;EACA,gBAAgB;CAClB;AACF;;;;AAKA,SAAgB,2BAA2B,KAAgD;CACzF,OAAO,wBAAwB,GAAG;AACpC;AAEA,MAAMC,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;;AAOD,MAAM,mBAAmB;;;;;AAMzB,MAAa,6BAA6B,SAAwC;CAChF,IAAI,kBAAkB,MAAM,YAAY,MAAM,UAC5C,OAAO,iCAAiC,IAAI;CAE9C,OAAO,iCAAiC,IAAI;AAC9C;;;;;;;;AASA,MAAM,oCAAoC,SAA8C;CACtF,MAAM,EAAE,SAAS,aAAa,kBAAkB,MAAM,gBAAgB;CACtE,MAAM,eAAe,OAAO,KAAK,oBAAoB,WAAW,KAAK,kBAAkB,KAAA;CACvF,MAAM,UAAU,OAAO,KAAK,eAAe,WAAW,KAAK,aAAa,KAAA;CACxE,MAAM,gBAAwC,CAAC;CAC/C,IAAI,iBAAiB,KAAA,GAAW,cAAc,kBAAkB;CAChE,IAAI,YAAY,KAAA,GAAW,cAAc,aAAa;CAUtD,OAAO,iCAAiC;EARtC,MAAM;EACN;EACA,MAAM;GAAE,MAAM;GAAU;EAAQ;EAChC,mBAAmB;EACnB,sBAAsB;EACtB,gBAAgB;EAChB,GAAI,OAAO,KAAK,aAAa,CAAC,CAAC,SAAS,IAAI,EAAE,cAAc,IAAI,CAAC;CAErB,CAAC;AACjD;;;;;AAMA,MAAM,oCAAoC,SAA6C;CACrF,MAAM,UAAU,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;CAClE,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,oBACR,oDACA,YACF;CAEF,MAAM,WAAW,OAAO,KAAK,aAAa,WAAW,KAAK,WAAW,KAAA;CACrE,MAAM,eAAe,OAAO,KAAK,oBAAoB,WAAW,KAAK,kBAAkB,KAAA;CACvF,MAAM,UAAU,OAAO,KAAK,eAAe,WAAW,KAAK,aAAa,KAAA;CAExE,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,UAAoC;GACpD,MAAM,MAAM,MAAM,mBAAkC,6BAA6B;GACjF,MAAM,UAAkC,CAAC;GACzC,IAAI,iBAAiB,KAAA,GAAW,QAAQ,kBAAkB;GAC1D,IAAI,YAAY,KAAA,GAAW,QAAQ,aAAa;GAChD,MAAM,SAIF,EAAE,QAAQ,QAAQ;GACtB,IAAI,aAAa,KAAA,GAAW,OAAO,UAAU;GAC7C,IAAI,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,GAAG,OAAO,UAAU;GAEtD,OADiB,IAAI,iBAAiB,MACxB,CAAC,CAAC,QAAQ;EAC1B;EACA,kBAAkB;EAClB,iBAAiB;EACjB,WAAW,eAAeA,YAAU,IAAI,UAAU;CACpD;AACF;;;AC/FA,MAAM,2BAAwD;CAC5D,MAAM;CACN,KAAK;CACL,QAAQ;CACR,MAAM;CACN,OAAO;CACP,KAAK;AACP;;;;AAKA,SAAgB,yBAAyB,QAAwC;CAG/E,MAAM,SAAS,yBAAyB;CACxC,IAAI,WAAW,GACb,OAAO;EAAE,kBAAkB,CAAC;EAAG,gBAAgB;CAAM;CAEvD,OAAO;EACL,kBAAkB,EAChB,SAAS,EACP,iBAAiB;GAAE,MAAM;GAAW,cAAc;EAAO,EAC3D,EACF;EACA,gBAAgB;CAClB;AACF;;;;AAKA,SAAgB,wBAAwB,KAAgD;CACtF,OAAO,wBAAwB,GAAG;AACpC;AAEA,MAAMC,8BAA6C,IAAI,IAAI;CACzD;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AAKD,SAAS,YAAY,MAAoB,KAAiC;CACxE,MAAM,QAAQ,KAAK;CACnB,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAA;AAC7C;;AAaA,SAAS,wBAAwB,MAAuC;CACtE,MAAM,SAAS,YAAY,MAAM,QAAQ,KAAK;CAC9C,IAAI,OAAO,WAAW,GACpB,MAAM,IAAI,oBAAoB,gDAAgD,SAAS;CAEzF,OAAO;EACL;EACA,SAAS,YAAY,MAAM,SAAS;EACpC,eAAe,YAAY,MAAM,eAAe;EAChD,mBAAmB,YAAY,MAAM,mBAAmB;EACxD,eAAe,YAAY,MAAM,eAAe;EAChD,UAAU,YAAY,MAAM,UAAU;CACxC;AACF;;AAOA,SAAS,uBAAuB,SAAqC;CACnE,OACE,QAAQ,YAAY,KAAA,KACjB,QAAQ,kBAAkB,KAAA,KAC1B,QAAQ,sBAAsB,KAAA,KAC9B,QAAQ,kBAAkB,KAAA;AAEjC;;;;;;;;;AAUA,SAAS,uBACP,MACA,SAC2B;CAC3B,MAAM,YAAY,KAAK,4BAA4B;CACnD,MAAM,MAAM,KAAK;CAEjB,MAAM,WAAW,OAAO,QAAQ,aAAc,MAAoC,KAAA;CAClF,IAAI,aAAa,aAAa,KAAA,GAC5B,MAAM,IAAI,oBACR,kFACA,SACF;CAEF,IAAI,uBAAuB,OAAO,GAAG,OAAO,KAAA;CAC5C,IAAI,aAAa,KAAA,GAAW,OAAO;EAAE,MAAM;EAAY;CAAS;CAChE,OAAO,YAAY,EAAE,MAAM,QAAQ,IAAI,KAAA;AACzC;;;;;;;AAQA,SAAS,cACP,SACA,qBACe;CACf,MAAM,SAAwB,EAAE,QAAQ,QAAQ,OAAO;CACvD,IAAI,QAAQ,YAAY,KAAA,GAAW,OAAO,SAAS,QAAQ;CAC3D,IAAI,QAAQ,kBAAkB,KAAA,GAAW,OAAO,cAAc,QAAQ;CACtE,IAAI,QAAQ,sBAAsB,KAAA,GAAW,OAAO,kBAAkB,QAAQ;CAC9E,IAAI,QAAQ,kBAAkB,KAAA,GAAW,OAAO,eAAe,QAAQ;CACvE,IAAI,QAAQ,aAAa,KAAA,GAAW,OAAO,UAAU,QAAQ;CAC7D,IAAI,wBAAwB,KAAA,GAAW,OAAO,qBAAqB;CACnE,OAAO;AACT;;;;;;;AAQA,MAAa,0BAA0B,SAA6C;CAClF,MAAM,UAAU,wBAAwB,IAAI;CAC5C,MAAM,iBAAiB,uBAAuB,MAAM,OAAO;CAE3D,IAAI;CACJ,eAAe,8BAA8E;EAC3F,IAAI,mBAAmB,KAAA,GAAW,OAAO,KAAA;EACzC,IAAI,eAAe,SAAS,YAAY,OAAO,eAAe;EAC9D,WACE,MAAM,mBAA2C,+BAA+B,EAAA,CAChF,sBAAsB;EACxB,OAAO;CACT;CAEA,OAAO;EACL,MAAM;EACN,MAAM;EACN,MAAM,YAAY,UAAoC;GAKpD,QAHiB,MADC,mBAA+B,wBAAwB,EAAA,CACpD,oBACnB,cAAc,SAAS,MAAM,4BAA4B,CAAC,CAE9C,CAAC,CAAC,QAAQ;EAC1B;EACA,kBAAkB;EAClB,iBAAiB;EACjB,WAAW,eAAeA,YAAU,IAAI,UAAU;CACpD;AACF;;;;;;;;;;;ACzOA,MAAa,qBAAqB;AAMlC,MAAa,wBAAwB;AAErC,MAAa,wBAAwB;AAErC,MAAa,yBAAyB;AAEtC,MAAa,0BAAiD,OAAO,OAAO;CAC1E;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAa,0BACX,OAAO,OAAO,CAAC,WAAW,OAAO,CAAC;;;;;;;;;;;;;;;;;;;ACTpC,MAAM,oBAAoB;CACxB;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;AASA,SAAgB,qBAAqB,QAAuC;CAE1E,KADkB,OAAO,aAAa,YACpB;OACA,OAAO,OAAO,YAAY,WAAW,OAAO,UAAU,GAAA,CAC1D,WAAW,GACrB,MAAM,IAAI,oBACR,8CACA,YACF;CAAA;AAGN;;;;;AAMA,SAAS,oBACP,QACA,QACM;CACN,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO;AAEjD;;;;;;;;;AAUA,SAAS,cACP,QACA,WACwB;CACxB,MAAM,MAA8B,CAAC;CACrC,IAAI,OAAO,gBAAgB,OAAO,OAAO;CACzC,IAAI,cAAc,SAAS;EACzB,oBAAoB,KAAK,QAAQ,GAAG;EACpC,OAAO;CACT;CACA,KAAK,MAAM,OAAO,mBAAmB;EACnC,MAAM,QAAQ,QAAQ,IAAI;EAC1B,IAAI,OAAO,UAAU,UAAU,IAAI,OAAO;CAC5C;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,eACP,KACA,QACA,WACM;CACN,IAAI,cAAc,SAAS;EACzB,OAAO,IAAI;EACX;CACF;CACA,IAAI,cAAc,WAAW;EAC3B,IAAI,uBAAuB,OAAO,OAAO,YAAY,WAAW,OAAO,UAAU;EACjF;CACF;CACA,IAAI,OAAO,OAAO,YAAY,YAAY,OAAO,QAAQ,SAAS,GAChE,IAAI,uBAAuB,OAAO;AAEtC;;;;;;;;;;;;;;;;AAiBA,SAAgB,UACd,QACA,YACA,WACwB;CACxB,MAAM,MAAM,cAAc,QAAQ,SAAS;CAC3C,IAAI,eAAe,KAAA,GAAW,oBAAoB,KAAK,UAAU;CACjE,eAAe,KAAK,QAAQ,SAAS;CACrC,OAAO;AACT;;;;;;;;AASA,SAAgB,uBAAuB,QAAyB;CAC9D,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,QAAQ,OAAO,YAAY;CACjC,KAAK,MAAM,WAAW,yBACpB,IAAI,MAAM,SAAS,QAAQ,YAAY,CAAC,GAAG,OAAO;CAEpD,OAAO;AACT;;;;;;;;;;;;AC5HA,SAAgB,eAAe,OAA8C;CAC3E,MAAM,OAAiB,CAAC;CACxB,KAAK,KAAK,IAAI;CACd,KAAK,KAAK,mBAAmB,aAAa;CAC1C,KAAK,KAAK,WAAW,MAAM,QAAQ;CACnC,KAAK,KAAK,WAAW;CAErB,MAAM,kBACJ,MAAM,gBAAgB,mBAAmB;CAC3C,KAAK,KAAK,qBAAqB,gBAAgB,KAAK,GAAG,CAAC;CAExD,KAAK,MAAM,QAAQ,MAAM,sBACvB,KAAK,KAAK,kBAAkB,IAAI;CAGlC,IAAI,OAAO,MAAM,UAAU,eAAe,YAAY,MAAM,UAAU,WAAW,SAAS,GACxF,KAAK,KAAK,YAAY,MAAM,UAAU,UAAU;CAGlD,IAAI,MAAM,UAAU,WAAW,KAAA,GAC7B,KAAK,KAAK,YAAY,KAAK,UAAU,MAAM,UAAU,MAAM,CAAC;CAG9D,MAAM,cAAc,MAAM,gBAAgB,eAAe,CAAC;CAC1D,KAAK,MAAM,OAAO,aAChB,KAAK,KAAK,gBAAgB,GAAG;CAG/B,IAAI,OAAO,MAAM,oBAAoB,YAAY,MAAM,gBAAgB,SAAS,GAC9E,KAAK,KAAK,iBAAiB,MAAM,eAAe;CAGlD,IAAI,MAAM,cAAc,SAAS,GAC/B,KAAK,KAAK,0BAA0B,MAAM,aAAa;CAGzD,MAAM,aAAa,MAAM,UAAU,cAAc,CAAC;CAClD,KAAK,MAAM,KAAK,YACd,KAAK,KAAK,CAAC;CAGb,OAAO,OAAO,OAAO,IAAI;AAC3B;;;;;;;;AASA,SAAgB,aACd,aACA,QACQ;CACR,MAAM,QAAkB,CAAC;CACzB,IAAI,OAAO,gBAAgB,YAAY,YAAY,SAAS,GAAG,MAAM,KAAK,WAAW;CACrF,IAAI,OAAO,WAAW,YAAY,OAAO,SAAS,GAAG,MAAM,KAAK,MAAM;CACtE,OAAO,MAAM,KAAK,MAAM;AAC1B;;;;;AAMA,SAAgB,oBACd,gBACA,YACuB;CACvB,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,SAAmB,CAAC;CAC1B,MAAM,eAAe,SAAuB;EAC1C,IAAI,KAAK,IAAI,IAAI,GAAG;EACpB,KAAK,IAAI,IAAI;EACb,OAAO,KAAK,IAAI;CAClB;CACA,IAAI,mBAAmB,KAAA,GACrB,KAAK,MAAM,KAAK,gBAAgB,YAAY,CAAC;CAE/C,KAAK,MAAM,KAAK,YAAY,YAAY,CAAC;CACzC,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnEA,SAAgB,mBACd,QACA,SACa;CACb,IAAI,YAAY,KAAA,GACd,OAAO;EAAE,WAAW;EAAQ,aAAa,CAAC;CAAE;CAE9C,IAAI,QAAQ,SAAS,SACnB,OAAO;EAAE,WAAW;EAAS,aAAa,iBAAiB,QAAQ,OAAO;CAAE;CAE9E,OAAO;EAAE,WAAW;EAAY,aAAa,oBAAoB,QAAQ,OAAO;CAAE;AACpF;;;;;;;;;;AAWA,SAAS,iBACP,QACA,SACuB;CACvB,MAAM,OAAiB,CAAC;CACxB,KAAK,KAAK,aAAa,QAAQ,MAAM;CACrC,KAAK,KAAK,aAAa,QAAQ,MAAM;CACrC,KAAK,KAAK,aAAa,QAAQ,MAAM;CACrC,KAAK,KAAK,iBAAiB,UAAU,QAAQ;CAC7C,KAAK,KAAK,iBAAiB,oBAAoB,kBAAkB;CACjE,KAAK,KAAK,UAAU,OAAO;CAC3B,KAAK,KAAK,SAAS,MAAM;CACzB,KAAK,KAAK,WAAW,MAAM;CAC3B,KAAK,KAAK,gBAAgB;CAC1B,KAAK,KAAK,eAAe;CACzB,KAAK,KAAK,eAAe;CACzB,KAAK,KAAK,eAAe;CACzB,KAAK,KAAK,sBAAsB;CAChC,KAAK,KAAK,mBAAmB;CAE7B,MAAM,YAAY,QAAQ,qBAAqB,CAAC;CAChD,IAAI,UAAU,SAAS,GAAG;EACxB,KAAK,KAAK,aAAa;EACvB,KAAK,MAAM,QAAQ,WACjB,KAAK,KAAK,YAAY,wBAAwB,IAAI;CAEtD,OAIE,KAAK,KAAK,eAAe;CAG3B,MAAM,cAAc,QAAQ,0BAA0B,CAAC;CACvD,KAAK,MAAM,KAAK,aACd,KAAK,KAAK,UAAU,GAAG,CAAC;CAG1B,KAAK,KAAK,IAAI;CACd,KAAK,KAAK,MAAM;CAChB,OAAO;AACT;;;;;;;;AASA,SAAS,oBACP,QACA,SACuB;CAEvB,OAAO;EAAC;EADc,QAAQ,iBAAiB,wBAAwB,OAAO;EACzC;EAAM;CAAM;AACnD;;;;;AAMA,SAAS,wBACP,SACQ;CAER,MAAM,OAAO,KADD,YAAY,KAAK,OAAO,GAAG,qBAAqB,QAAQ,IAAI,EAAE,CACtD,GAAG,eAAe;CACtC,MAAM,UAAU;EACd,SAAS,EAAE,YAAY,CAAC,GAAI,QAAQ,qBAAqB,CAAC,CAAE,EAAE;EAC9D,YAAY,EAAE,YAAY,CAAC,GAAI,QAAQ,0BAA0B,CAAC,CAAE,EAAE;CACxE;CACA,cAAc,MAAM,KAAK,UAAU,SAAS,MAAM,CAAC,GAAG,MAAM;CAC5D,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnFA,MAAM,iCAAqC,IAAI,IAAI;AACnD,IAAI,yBAAyB;;;;;;;;;;AAW7B,SAAS,4BAAkC;CACzC,IAAI,wBAAwB;CAC5B,yBAAyB;CACzB,MAAM,gBAAsB;EAC1B,KAAK,MAAM,OAAO,gBAChB,KAAK,MAAM,SAAS,KAAK;GACvB,IAAI,MAAM,QAAQ,KAAA,KAAa,MAAM,aAAa,MAAM;GACxD,IAAI;IACF,QAAQ,KAAK,CAAC,MAAM,KAAK,SAAS;GACpC,QAAQ,CAER;EACF;CAEJ;CACA,QAAQ,GAAG,QAAQ,OAAO;AAC5B;;;;;;;;;AAgBA,SAAgB,uBAAqC;CACnD,MAAM,gCAA+B,IAAI,IAAI;CAC7C,eAAe,IAAI,aAAa;CAChC,0BAA0B;CAE1B,MAAM,YAAY,OAAO,SAA2C;EAClE,IAAI,KAAK,OAAO,YAAY,MAC1B,MAAM,IAAI,cAAc,WAAW,EAAE,QAAQ,KAAK,MAAM,OAAO,CAAC;EAGlE,IAAI;EACJ,IAAI;GACF,MAAM,aAA+C;IACnD,OAAO;KAAC;KAAQ;KAAQ;IAAM;IAC9B,UAAU;IACV,KAAK,KAAK;IACV,OAAO;GACT;GACA,IAAI,KAAK,QAAQ,KAAA,GAAW,WAAW,MAAM,KAAK;GAClD,QAAQC,MAAW,KAAK,KAAK,CAAC,GAAG,KAAK,IAAI,GAAG,UAAU;EACzD,SAAS,KAAc;GACrB,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;GAC/D,MAAM,IAAI,iBAAiB,oBAAoB,oBAAoB,KAAK,IAAI,KAAK,SAAS;EAC5F;EAEA,cAAc,IAAI,KAAK;EAEvB,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI,yBAAyB;EAE7B,MAAM,UAA8B,EAAE,QAAQ,GAAG;EACjD,MAAM,QAAQ,GAAG,SAAS,QAAgB;GACxC,QAAQ,UAAU,IAAI,SAAS,MAAM;EACvC,CAAC;EACD,MAAM,GAAG,UAAU,QAAQ;GACzB,cAAc;EAChB,CAAC;EAED,MAAM,yBAA+B;GAEnC,aAAa,aAAa;GAC1B,aAAa,WAAW;GACxB,aAAa,aAAa;GAC1B,gBAAgB,KAAA;GAChB,cAAc,KAAA;GACd,gBAAgB,KAAA;EAClB;EAEA,MAAM,eAAe,WAAiC;GACpD,IAAI,MAAM,QAAQ,KAAA,KAAa,MAAM,aAAa,MAAM;GACxD,IAAI;IACF,QAAQ,KAAK,CAAC,MAAM,KAAK,MAAM;GACjC,QAAQ,CAER;EACF;EAEA,MAAM,YAAY,WAAmD;GACnE,IAAI,qBAAqB,KAAA,GAAW;GACpC,mBAAmB;GACnB,YAAY,SAAS;GACrB,gBAAgB,iBAAiB;IAC/B,YAAY,SAAS;GACvB,GAAG,qBAAqB;EAC1B;EAEA,IAAI,KAAK,qBAAqB,GAC5B,gBAAgB,iBAAiB;GAC/B,IAAI,wBAAwB;GAC5B,gBAAgB,IAAI,iBAClB,mBACA,oBAAoB,OAAO,KAAK,kBAAkB,EAAE,GACtD;GACA,SAAS,SAAS;EACpB,GAAG,KAAK,kBAAkB;EAG5B,MAAM,wBAA8B;GAClC,IAAI,KAAK,oBAAoB,GAAG;GAGhC,aAAa,WAAW;GACxB,cAAc,iBAAiB;IAC7B,cAAc,IAAI,iBAChB,iBACA,iBAAiB,OAAO,KAAK,gBAAgB,EAAE,GACjD;IACA,SAAS,SAAS;GACpB,GAAG,KAAK,gBAAgB;EAC1B;EAEA,MAAM,uBAA6B;GACjC,SAAS,OAAO;EAClB;EACA,IAAI,KAAK,UAAU,KAAA,GACjB,IAAI,KAAK,MAAM,SAAS,eAAe;OAClC,KAAK,MAAM,iBAAiB,SAAS,gBAAgB,EAAE,MAAM,KAAK,CAAC;EAG1E,MAAM,gBAAgB,IAAI,SAA4B,YAAY;GAChE,MAAM,GAAG,UAAU,MAAM,WAAW;IAClC,iBAAiB;IACjB,cAAc,OAAO,KAAK;IAC1B,IAAI,KAAK,UAAU,KAAA,GACjB,KAAK,MAAM,oBAAoB,SAAS,cAAc;IAExD,QAAQ;KAAE;KAAM;KAAQ,QAAQ,QAAQ;IAAO,CAAC;GAClD,CAAC;EACH,CAAC;EAED,MAAM,QAAQ,MAAM;EACpB,IAAI,UAAU,MAAM;GAClB,MAAM,GAAG,eAAe,CAExB,CAAC;GACD,MAAM,MAAM,KAAK,KAAK;GACtB,MAAM,IAAI;EACZ;EAEA,MAAM,eAAe,mBAAmB,aAAa;GACnD,IAAI,CAAC,wBAAwB;IAC3B,yBAAyB;IACzB,IAAI,kBAAkB,KAAA,GAAW;KAC/B,aAAa,aAAa;KAC1B,gBAAgB,KAAA;IAClB;GACF;GACA,gBAAgB;EAClB,CAAC;EAED,OAAO;GACL;GACA;GACA,YAAY,YAAY;IACtB,MAAM,UAAU,MAAM;IACtB,IAAI,gBAAgB,KAAA,GAAW;KAC7B,MAAM,UAAU,YAAY;KAC5B,MAAM,IAAI,iBAAiB,oBAAoB,OAAO;IACxD;IACA,IAAI,kBAAkB,KAAA,GAAW,MAAM;IACvC,IAAI,gBAAgB,KAAA,GAAW,MAAM;IACrC,IAAI,qBAAqB,SACvB,MAAM,IAAI,cAAc,WAAW,EAAE,QAAQ,KAAK,OAAO,OAAO,CAAC;IAEnE,IAAI,qBAAqB,YACvB,MAAM,IAAI,cAAc,mBAAmB,EAAE,QAAQ,kBAAkB,CAAC;IAE1E,OAAO;GACT;GACA,oBAAoB,WAAW,SAAS,MAAM;EAChD;CACF;CAEA,MAAM,cAAc,YAA2B;EAC7C,MAAM,UAA2B,CAAC;EAClC,KAAK,MAAM,SAAS,eAClB,QAAQ,KACN,IAAI,SAAe,YAAY;GAC7B,IAAI,MAAM,aAAa,MAAM;IAC3B,QAAQ;IACR;GACF;GACA,MAAM,KAAK,eAAe,QAAQ,CAAC;GACnC,IAAI,MAAM,QAAQ,KAAA,GAAW;IAC3B,IAAI;KACF,QAAQ,KAAK,CAAC,MAAM,KAAK,SAAS;IACpC,QAAQ,CAER;IACA,iBAAiB;KACf,IAAI,MAAM,aAAa,QAAQ,MAAM,QAAQ,KAAA,GAC3C,IAAI;MACF,QAAQ,KAAK,CAAC,MAAM,KAAK,SAAS;KACpC,QAAQ,CAER;IAEJ,GAAG,qBAAqB;GAC1B;EACF,CAAC,CACH;EAEF,MAAM,QAAQ,IAAI,OAAO;EACzB,eAAe,OAAO,aAAa;CACrC;CAEA,OAAO;EAAE;EAAe;EAAW;CAAY;AACjD;;;;;;;;;;AAWA,gBAAgB,mBACd,OACA,SACuB;CACvB,MAAM,SAAS,MAAM;CACrB,IAAI,WAAW,MAAM;CACrB,IAAI,SAAS;CACb,IAAI,QAAQ;CACZ,MAAM,QAAkB,CAAC;CACzB,IAAI;CACJ,MAAM,aAAmB;EACvB,MAAM,IAAI;EACV,IAAI,MAAM,KAAA,GAAW;GACnB,WAAW,KAAA;GACX,EAAE;EACJ;CACF;CACA,OAAO,YAAY,MAAM;CACzB,OAAO,GAAG,SAAS,UAAkB;EACnC,QAAQ;EACR,UAAU;EACV,IAAI,KAAK,OAAO,QAAQ,IAAI;EAC5B,OAAO,OAAO,IAAI;GAChB,MAAM,KAAK,OAAO,MAAM,GAAG,EAAE,CAAC;GAC9B,SAAS,OAAO,MAAM,KAAK,CAAC;GAC5B,KAAK,OAAO,QAAQ,IAAI;EAC1B;EACA,KAAK;CACP,CAAC;CACD,OAAO,GAAG,aAAa;EACrB,IAAI,OAAO,SAAS,GAAG;GACrB,MAAM,KAAK,MAAM;GACjB,SAAS;EACX;EACA,QAAQ;EACR,KAAK;CACP,CAAC;CACD,OAAO,GAAG,eAAe;EACvB,QAAQ;EACR,KAAK;CACP,CAAC;CACD,OAAO,MAAM;EACX,IAAI,MAAM,SAAS,GAAG;GACpB,MAAM,OAAO,MAAM,MAAM;GACzB,IAAI,SAAS,KAAA,GAAW,MAAM;GAC9B;EACF;EACA,IAAI,OAAO;EACX,MAAM,IAAI,SAAe,MAAM;GAC7B,WAAW;EACb,CAAC;CACH;AACF;;;;AC3PA,SAAS,UAAU,OAAkD;CACnE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;;AAGA,SAAS,WAAW,KAA8B,KAAsB;CACtE,MAAM,QAAQ,IAAI;CAClB,OAAO,UAAU,KAAA,KAAa,OAAO,UAAU;AACjD;;AAGA,SAAS,WAAW,KAA8B,KAAsB;CACtE,MAAM,QAAQ,IAAI;CAClB,OAAO,UAAU,KAAA,KAAa,OAAO,UAAU;AACjD;;AAGA,SAAS,YAAY,KAA8B,KAAsB;CACvE,MAAM,QAAQ,IAAI;CAClB,OAAO,UAAU,KAAA,KAAa,OAAO,UAAU;AACjD;;;;;;AAOA,SAAS,eAAe,OAAyB;CAC/C,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,IAAI,CAAC,UAAU,KAAK,GAAG,OAAO;CAC9B,OACE,WAAW,OAAO,cAAc,KAChC,WAAW,OAAO,eAAe,KACjC,WAAW,OAAO,yBAAyB,KAC3C,WAAW,OAAO,6BAA6B;AAEnD;;;;;;AAOA,SAAS,yBAAyB,OAAyB;CACzD,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,IAAI,CAAC,UAAU,KAAK,GAAG,OAAO;CAC9B,OACE,WAAW,OAAO,QAAQ,KAC1B,WAAW,OAAO,UAAU,KAC5B,WAAW,OAAO,eAAe,KACjC,WAAW,OAAO,eAAe,KACjC,WAAW,OAAO,iBAAiB,KACnC,YAAY,OAAO,gBAAgB;AAEvC;;;;;;;;;AAUA,SAAS,kBAAkB,OAAiD;CAC1E,IAAI,CAAC,UAAU,KAAK,GAAG,OAAO,KAAA;CAC9B,IAAI,MAAM,YAAY,QAAQ;EAC5B,MAAM,OAAO,MAAM;EACnB,OAAO,OAAO,SAAS,WAAW;GAAE,MAAM;GAAQ;EAAK,IAAI,KAAA;CAC7D;CACA,IAAI,MAAM,YAAY,YAAY;EAChC,MAAM,KAAK,MAAM;EACjB,MAAM,OAAO,MAAM;EACnB,IAAI,OAAO,OAAO,UAAU,OAAO,KAAA;EACnC,IAAI,OAAO,SAAS,UAAU,OAAO,KAAA;EACrC,OAAO;GAAE,MAAM;GAAY;GAAI;GAAM,OAAO,MAAM;EAAS;CAC7D;AAEF;;;;;;;AAQA,SAAS,aAAa,OAA4C;CAChE,IAAI,CAAC,UAAU,KAAK,GAAG,OAAO,KAAA;CAC9B,IAAI,MAAM,YAAY,eAAe,OAAO,KAAA;CAC5C,MAAM,cAAc,MAAM;CAC1B,IAAI,OAAO,gBAAgB,UAAU,OAAO,KAAA;CAC5C,IAAI,CAAC,YAAY,OAAO,UAAU,GAAG,OAAO,KAAA;CAC5C,MAAM,OAAuB;EAAE,MAAM;EAAe;CAAY;CAChE,IAAI,aAAa,OAAO,KAAK,UAAU,MAAM;CAC7C,MAAM,WAAW,MAAM;CACvB,IAAI,OAAO,aAAa,WAAW,KAAK,WAAW;CACnD,OAAO;AACT;;;;;;AAOA,SAAS,cACP,OACA,WACiB;CACjB,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,KAAA;CAClC,MAAM,QAAa,CAAC;CACpB,KAAK,MAAM,SAAS,OAAO;EACzB,MAAM,OAAO,UAAU,KAAK;EAC5B,IAAI,SAAS,KAAA,GAAW,MAAM,KAAK,IAAI;CACzC;CACA,OAAO;AACT;;AAGA,SAAS,gBAAgB,KAAqD;CAC5E,OACE,WAAW,KAAK,SAAS,KACzB,WAAW,KAAK,YAAY,KAC5B,WAAW,KAAK,OAAO;AAE3B;;AAGA,SAAS,gBAAgB,KAAqD;CAC5E,OACE,WAAW,KAAK,SAAS,KACzB,WAAW,KAAK,YAAY,KAC5B,WAAW,KAAK,gBAAgB,KAChC,WAAW,KAAK,aAAa,KAC7B,YAAY,KAAK,UAAU,KAC3B,eAAe,IAAI,QAAQ,KAC3B,WAAW,KAAK,QAAQ;AAE5B;;AAGA,SAAS,oBAAoB,KAAwD;CACnF,OAAO,yBAAyB,IAAI,kBAAkB,KAAK,WAAW,KAAK,YAAY;AACzF;;;;;;AAOA,SAAS,KACP,KACA,WACe;CACf,OAAO,UAAU,GAAG,IAAI,MAAM,KAAA;AAChC;;;;;AAMA,SAAS,mBAAmB,KAAoD;CAC9E,MAAM,UAAU,IAAI;CACpB,IAAI,CAAC,UAAU,OAAO,GAAG,OAAO,KAAA;CAChC,MAAM,UAAU,cAAc,QAAQ,YAAY,iBAAiB;CACnE,OAAO,YAAY,KAAA,IAAY,KAAA,IAAY;EAAE,MAAM;EAAa,SAAS,EAAE,QAAQ;CAAE;AACvF;;AAGA,SAAS,cAAc,KAAoD;CACzE,MAAM,UAAU,IAAI;CACpB,IAAI,CAAC,UAAU,OAAO,GAAG,OAAO,KAAA;CAChC,MAAM,UAAU,cAAc,QAAQ,YAAY,YAAY;CAC9D,OAAO,YAAY,KAAA,IAAY,KAAA,IAAY;EAAE,MAAM;EAAQ,SAAS,EAAE,QAAQ;CAAE;AAClF;;;;;;;;;AAUA,SAAS,SAAS,KAAoC;CACpD,IAAI,CAAC,UAAU,GAAG,GAAG,OAAO,KAAA;CAC5B,QAAQ,IAAI,SAAZ;EACE,KAAK,UACH,OAAO,KAAK,KAAK,eAAe;EAClC,KAAK,aACH,OAAO,mBAAmB,GAAG;EAC/B,KAAK,QACH,OAAO,cAAc,GAAG;EAC1B,KAAK,UACH,OAAO,KAAK,KAAK,eAAe;EAClC,KAAK,oBACH,OAAO,KAAK,KAAK,mBAAmB;EACtC,SACE;CACJ;AACF;;;;AAkDA,SAAgB,sBAAmC;CACjD,OAAO;EACL,QAAQ;EACR,iBAAiB;EACjB,oBAAoB;EACpB,YAAY;EACZ,aAAa;GAAE,cAAc;GAAG,eAAe;EAAE;EACjD,OAAO,CAAC;EACR,WAAW;EACX,iBAAiB,CAAC;EAClB,mBAAmB,CAAC;EACpB,YAAY;GAAE,cAAc;GAAG,eAAe;EAAE;EAChD,UAAU;EACV,iBAAiB;CACnB;AACF;;;;;;;;AASA,SAAS,UAAU,KAA2C;CAC5D,IAAI,QAAQ,KAAA,GAAW,OAAO;EAAE,cAAc;EAAG,eAAe;CAAE;CAClE,MAAM,MAAmB;EACvB,cAAc,OAAO,IAAI,iBAAiB,WAAW,IAAI,eAAe;EACxE,eAAe,OAAO,IAAI,kBAAkB,WAAW,IAAI,gBAAgB;CAC7E;CACA,IAAI,OAAO,IAAI,4BAA4B,UACzC,IAAI,sBAAsB,IAAI;CAEhC,IAAI,OAAO,IAAI,gCAAgC,UAC7C,IAAI,qBAAqB,IAAI;CAE/B,OAAO;AACT;;;;AAKA,SAAS,mBACP,YACA,MACM;CACN,YAAY,OAAO;EAAE,MAAM;EAAmB;CAAK,CAAC;AACtD;;;;AAKA,SAAS,qBACP,YACA,KACM;CACN,YAAY,OAAO;EAAE,MAAM;EAAqB;CAAI,CAAC;AACvD;;;;AAKA,SAAS,uBACP,YACA,YACA,OACM;CACN,YAAY,OAAO;EAAE,MAAM;EAAuB;EAAY;CAAM,CAAC;AACvE;;;;AAKA,SAAS,kBACP,YACA,OACM;CACN,MAAM,OAAO,MAAM;CACnB,YAAY,OAAO;EACjB,MAAM;EACN,YAAY,MAAM;EAClB,QAAQ,MAAM;EACd,iBAAiB,MAAM;EACvB,WAAW,MAAM;EACjB,gBAAgB,MAAM;EACtB,mBAAmB,MAAM;EACzB,kBAAkB,MAAM;CAC1B,CAAC;AACH;;;;;AAMA,SAAS,WAAW,OAA0B;CAC5C,MAAM,MAAM,KAAK;EACf,YAAY,MAAM;EAClB,MAAM,MAAM;EACZ,YAAY,MAAM,gBAAgB,MAAM;EACxC,cAAc,MAAM,kBAAkB,MAAM;EAC5C,OAAO,EAAE,GAAG,MAAM,WAAW;CAC/B,CAAC;CACD,MAAM,YAAY;CAClB,MAAM,kBAAkB,CAAC;CACzB,MAAM,oBAAoB,CAAC;CAC3B,MAAM,aAAa;EAAE,cAAc;EAAG,eAAe;CAAE;AACzD;;;;;AAMA,eAAe,WACb,QACA,UACA,OACe;CACf,OAAO,KAAK,KAAK;CACjB,IAAI,aAAa,KAAA,GAAW,MAAM,SAAS,KAAK;AAClD;;;;;;;;;;;AAYA,eAAe,iBACb,OACA,OACA,QACA,UACe;CACf,IAAI,MAAM,oBAAoB,oBAAoB;EAChD,MAAM,QAAQ,EAAE,GAAG,MAAM,WAAW;EACpC,MAAM,WAAW,QAAQ,UAAU;GACjC,MAAM;GACN,YAAY,MAAM;GAClB,eAAe;GACf;EACF,CAAC;EACD,WAAW,KAAK;EAChB,MAAM,sBAAsB;CAC9B;CAEA,KAAK,MAAM,QAAQ,MAAM,QAAQ,SAAS;EACxC,IAAI,KAAK,SAAS,QAAQ;GACxB,MAAM,aAAa,KAAK;GACxB,MAAM,cAAc,KAAK;GACzB,MAAM,WAAW,QAAQ,UAAU;IACjC,MAAM;IACN,MAAM,KAAK;IACX,YAAY,MAAM;GACpB,CAAC;GACD;EACF;EACA,MAAM,gBAAgB,KAAK;GAAE,IAAI,KAAK;GAAI,MAAM,KAAK;GAAM,OAAO,KAAK;EAAM,CAAC;EAC9E,MAAM,WAAW,QAAQ,UAAU;GACjC,MAAM;GACN,IAAI,KAAK;GACT,MAAM,KAAK;GACX,YAAY,MAAM;EACpB,CAAC;EACD,MAAM,WAAW,QAAQ,UAAU;GACjC,MAAM;GACN,IAAI,KAAK;GACT,OAAO,KAAK;GACZ,YAAY,MAAM;EACpB,CAAC;CACH;CACA,MAAM,kBAAkB;AAC1B;;;;;AAMA,eAAe,YACb,OACA,OACA,QACA,UACe;CACf,KAAK,MAAM,QAAQ,MAAM,QAAQ,SAAS;EACxC,IAAI,KAAK,SAAS,eAAe;EACjC,MAAM,SAAS,KAAK,aAAa;EACjC,MAAM,eAA4B;GAChC,MAAM;GACN,IAAI,KAAK;GACT,YAAY,MAAM;EACpB;EACA,IAAI,QAAQ;GACV,MAAM,cACJ,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU,KAAK,UAAU,KAAK,OAAO;GAC/E,aAAa,QAAQ,EAAE,SAAS,YAAY;GAC5C,MAAM,kBAAkB,KAAK;IAC3B,IAAI,KAAK;IACT,OAAO,EAAE,SAAS,YAAY;GAChC,CAAC;EACH,OAAO;GACL,aAAa,SAAS,KAAK;GAC3B,MAAM,kBAAkB,KAAK;IAAE,IAAI,KAAK;IAAa,QAAQ,KAAK;GAAQ,CAAC;EAC7E;EACA,MAAM,WAAW,QAAQ,UAAU,YAAY;CACjD;CACA,MAAM,kBAAkB;AAC1B;;;;;;;;;AAUA,eAAe,cACb,OACA,OACA,QACA,UACe;CACf,MAAM,kBAAkB;CACxB,IAAI,OAAO,MAAM,eAAe,UAAU,MAAM,aAAa,MAAM;CACnE,IAAI,OAAO,MAAM,mBAAmB,UAAU,MAAM,iBAAiB,MAAM;CAC3E,IAAI,OAAO,MAAM,gBAAgB,UAAU,MAAM,cAAc,MAAM;CACrE,IAAI,MAAM,aAAa,MAAM,MAAM,WAAW;CAC9C,MAAM,QAAQ,UAAU,MAAM,KAAK;CACnC,MAAM,cAAc;CACpB,MAAM,aAAa,EAAE,GAAG,MAAM;CAC9B,IAAI,OAAO,MAAM,WAAW,YAAY,MAAM,OAAO,SAAS;MACxD,MAAM,WAAW,WAAW,GAAG,MAAM,aAAa,MAAM;CAAA;CAE9D,WAAW,KAAK;CAChB,MAAM,kBAAkB;CACxB,MAAM,WAAW,QAAQ,UAAU;EACjC,MAAM;EACN,eAAe;EACf;CACF,CAAC;AACH;;;;AAKA,eAAe,aACb,OACA,OACA,QACA,UACA,YACe;CACf,QAAQ,MAAM,MAAd;EACE,KAAK;GACH,uBAAuB,YAAY,MAAM,YAAY,MAAM,KAAK;GAChE,IAAI,OAAO,MAAM,eAAe,YAAY,MAAM,eAAe,KAAA,GAC/D,MAAM,aAAa,MAAM;GAE3B,MAAM,kBAAkB;GACxB;EACF,KAAK;GACH,MAAM,iBAAiB,OAAO,OAAO,QAAQ,QAAQ;GACrD;EACF,KAAK;GACH,MAAM,YAAY,OAAO,OAAO,QAAQ,QAAQ;GAChD;EACF,KAAK;GACH,MAAM,cAAc,OAAO,OAAO,QAAQ,QAAQ;GAClD;EACF,KAAK;GACH,kBAAkB,YAAY,KAAK;GACnC;CACJ;AACF;;;;;;;;AASA,eAAe,aACb,OACA,MACA,QACA,UACA,YACe;CACf,MAAM,UAAU,KAAK,KAAK;CAC1B,IAAI,QAAQ,WAAW,GAAG;CAC1B,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,OAAO;CAC7B,QAAQ;EACN,mBAAmB,YAAY,IAAI;EACnC;CACF;CACA,MAAM,QAAQ,SAAS,MAAM;CAC7B,IAAI,UAAU,KAAA,GAAW;EACvB,qBAAqB,YAAY,MAAM;EACvC;CACF;CACA,MAAM,aAAa,OAAO,OAAO,QAAQ,UAAU,UAAU;AAC/D;;;;;;;;AASA,eAAsB,WACpB,OACA,OACA,QACA,UACA,YACe;CACf,MAAM,UAAU;CAChB,IAAI,WAAW,MAAM,OAAO,QAAQ,IAAI;CACxC,OAAO,aAAa,IAAI;EACtB,MAAM,OAAO,MAAM,OAAO,MAAM,GAAG,QAAQ;EAC3C,MAAM,SAAS,MAAM,OAAO,MAAM,WAAW,CAAC;EAC9C,MAAM,aAAa,OAAO,MAAM,QAAQ,UAAU,UAAU;EAC5D,WAAW,MAAM,OAAO,QAAQ,IAAI;CACtC;AACF;;;;;;;;;AAUA,eAAsB,gBACpB,OACA,QACA,UACA,YACe;CACf,IAAI,MAAM,OAAO,WAAW,GAAG;CAC/B,MAAM,OAAO,MAAM;CACnB,MAAM,SAAS;CACf,MAAM,aAAa,OAAO,MAAM,QAAQ,UAAU,UAAU;AAC9D;;;;;AAMA,SAAgB,SAAS,OAAkC;CACzD,MAAM,OASF;EACF,YAAY,MAAM;EAClB,aAAa,EAAE,GAAG,MAAM,YAAY;EACpC,OAAO,MAAM,MAAM,MAAM;EACzB,UAAU,MAAM;EAChB,iBAAiB,MAAM;CACzB;CACA,IAAI,MAAM,eAAe,KAAA,GAAW,KAAK,aAAa,MAAM;CAC5D,IAAI,MAAM,mBAAmB,KAAA,GAAW,KAAK,iBAAiB,MAAM;CACpE,IAAI,MAAM,gBAAgB,KAAA,GAAW,KAAK,cAAc,MAAM;CAC9D,OAAO;AACT;;;;;;;;;;;;;ACjsBA,SAAgB,qBACd,gBACA,OACe;CACf,MAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,YAAY;CAC5C,MAAM,SAAS,KAAK,IAAI,GAAG,MAAM,aAAa;CAC9C,MAAM,SAAS,KAAK,IAAI,GAAG,MAAM,uBAAuB,CAAC;CACzD,MAAM,cAAc,KAAK,IAAI,GAAG,MAAM,sBAAsB,CAAC;CAI7D,MAAM,eAFa,KAAK,IAAI,GAAG,QAAQ,SAAS,WAElB;CAC9B,MAAM,gBAAgB;CACtB,MAAM,gBAAgB,SAAS;CAC/B,MAAM,qBAAqB,cAAc;CAEzC,MAAM,eAAe,eAAe,gBAAgB,gBAAgB;CAEpE,IAAI,iBAAiB,KAAK,mBAAmB,GAC3C,OAAO;EACL,WAAW;EACX,WAAW;EACX,YAAY;EACZ,UAAU;EACV,aAAa;CACf;CAGF,MAAM,YAAa,iBAAiB,eAAgB;CACpD,MAAM,aAAc,iBAAiB,gBAAiB;CACtD,MAAM,iBAAkB,iBAAiB,gBAAiB;CAC1D,MAAM,sBAAuB,iBAAiB,qBAAsB;CAEpE,MAAM,YAA2B;EAC/B,WAAW;EACX;EACA;EACA,UAAU;EACV,aAAa;CACf;CACA,IAAI,SAAS,GAAG,UAAU,mBAAmB;CAC7C,IAAI,cAAc,GAAG,UAAU,kBAAkB;CACjD,OAAO;AACT;;;;;;;;AAcA,SAAS,yBACP,gBACA,OACU;CACV,MAAM,eAAe,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK,IAAI,GAAG,EAAE,aAAa,GAAG,CAAC;CACnF,MAAM,WAAW,MAAM,KAAK,MAC1B,iBAAiB,IACb,iBAAiB,MAAM,SACvB,kBAAkB,KAAK,IAAI,GAAG,EAAE,aAAa,IAAI,aACvD;CAEA,MAAM,WAAW,SAAS,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC;CACnD,MAAM,aAAa,MAAM,SAAS;CAClC,SAAS,eAAe,SAAS,eAAe,MAAM,iBAAiB;CACvE,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,2BACd,gBACA,OAC8B;CAC9B,IAAI,MAAM,WAAW,GAAG,OAAO,CAAC;CAChC,MAAM,WAAW,yBAAyB,gBAAgB,KAAK;CAC/D,OAAO,MAAM,KAAK,GAAG,MAAM,qBAAqB,SAAS,MAAM,GAAG,EAAE,KAAK,CAAC;AAC5E;;;;;;;;;;;AC/EA,SAASC,YAAU,QAAiD;CAClE,IAAI,QAAQ;CACZ,IAAI,SAAS;CACb,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,KAAK,MAAM,KAAK,QAAQ;EACtB,SAAS,EAAE;EACX,UAAU,EAAE;EACZ,IAAI,EAAE,wBAAwB,KAAA,GAAW,UAAU,UAAU,KAAK,EAAE;EACpE,IAAI,EAAE,uBAAuB,KAAA,GAAW,eAAe,eAAe,KAAK,EAAE;EAC7E,IAAI,EAAE,qBAAqB,KAAA,GAAW,aAAa,aAAa,KAAK,EAAE;CACzE;CACA,MAAM,MAAmB;EAAE,cAAc;EAAO,eAAe;CAAO;CACtE,IAAI,WAAW,KAAA,GAAW,IAAI,sBAAsB;CACpD,IAAI,gBAAgB,KAAA,GAAW,IAAI,qBAAqB;CACxD,IAAI,cAAc,KAAA,GAAW,IAAI,mBAAmB;CACpD,OAAO;AACT;;;;;;;AAQA,SAAS,0BACP,YAC2B;CAC3B,IAAI,WAAW,WAAW,GAAG,OAAO,KAAA;CACpC,IAAI,QAAQ;CACZ,IAAI,QAAQ;CACZ,IAAI,SAAS;CACb,IAAI,iBAAiB;CACrB,IAAI,SAAS;CACb,IAAI,sBAAsB;CAC1B,IAAI,cAAc;CAClB,KAAK,MAAM,KAAK,YAAY;EAC1B,SAAS,EAAE;EACX,SAAS,EAAE;EACX,UAAU,EAAE;EACZ,IAAI,EAAE,qBAAqB,KAAA,GAAW;GACpC,iBAAiB;GACjB,UAAU,EAAE;EACd;EACA,IAAI,EAAE,oBAAoB,KAAA,GAAW;GACnC,sBAAsB;GACtB,eAAe,EAAE;EACnB;CACF;CACA,MAAM,MAAqB;EACzB,WAAW;EACX,WAAW;EACX,YAAY;EACZ,UAAU;EACV,aAAa;CACf;CACA,IAAI,gBAAgB,IAAI,mBAAmB;CAC3C,IAAI,qBAAqB,IAAI,kBAAkB;CAC/C,OAAO;AACT;;;;;;;;;AAUA,SAAS,gBAAgB,QAAoD;CAC3E,IAAI,OAAO,MAAM,SAAS,GAAG,OAAO,OAAO;CAQ3C,OAAO,CAAC;EANN,YAAY;EACZ,MAAM,OAAO;EACb,YAAY,CAAC;EACb,cAAc,CAAC;EACf,OAAO,OAAO;CAEJ,CAAC;AACf;;;;;;;;AASA,SAAS,iBACP,YACA,MACA,SAKA,KACgB;CAChB,MAAM,MAAsB;EAC1B,IAAI,KAAK;EACT,MAAM,KAAK;EACX,OAAO,KAAK;EACZ,aAAa;EACb,YAAY;CACd;CACA,MAAM,UAAU,QAAQ,MAAM,MAAM,EAAE,OAAO,KAAK,EAAE;CACpD,IAAI,YAAY,KAAA,GAAW;EACzB,IAAI,QAAQ,WAAW,KAAA,GAAW,IAAI,SAAS,QAAQ;EACvD,IAAI,QAAQ,UAAU,KAAA,GAAW,IAAI,QAAQ,QAAQ;CACvD;CACA,OAAO;AACT;;;;;;;;;AAiBA,SAAgB,sBAAyB,OAA+C;CACtF,MAAM,EAAE,QAAQ,aAAa;CAK7B,IAAI,OAAO,UACT,MAAM,IAAI,iBACR,gBACA,OAAO,WAAW,SAAS,IACvB,OAAO,aACP,qCACN;CAGF,MAAM,QAAQ,gBAAgB,MAAM;CACpC,MAAM,MAAM,KAAK,IAAI;CAErB,MAAM,cAA2B,MAAM,KAAK,OAAO;EACjD,eAAe,EAAE,MAAM;EACvB,OAAO,EAAE;CACX,EAAE;CAEF,MAAM,iBAAiB,OAAO,kBAAkB;CAChD,MAAM,WAAW,OAAO,mBAAmB,KAAA;CAC3C,MAAM,gBAA8C,WAChD,2BAA2B,gBAAgB,WAAW,IACtD,CAAC;CAEL,MAAM,gBAA8B;CAEpC,MAAM,QAAsB,CAAC;CAC7B,MAAM,mBAAqC,CAAC;CAC5C,MAAM,SAAS,MAAM,MAAM;EACzB,MAAM,kBAAoC,KAAK,WAAW,KAAK,SAC7D,iBAAiB,KAAK,YAAY,MAAM,KAAK,cAAc,GAAG,CAChE;EACA,KAAK,MAAM,MAAM,iBAAiB,iBAAiB,KAAK,EAAE;EAC1D,MAAM,SAAqB;GACzB,OAAO,KAAK;GACZ,MAAM,KAAK;GACX,YAAY;GACZ,OAAO,KAAK;GACZ,eAAe,MAAM,MAAM,SAAS,IAAI,gBAAgB;EAC1D;EACA,IAAI,UAAU;GACZ,MAAM,OAAO,cAAc;GAC3B,IAAI,SAAS,KAAA,GAAW,OAAO,OAAO;EACxC;EACA,MAAM,KAAK,MAAM;CACnB,CAAC;CAED,MAAM,cAAcA,YAAU,MAAM,KAAK,MAAM,EAAE,KAAK,CAAC;CACvD,MAAM,aAAa,WAAW,0BAA0B,aAAa,IAAI,KAAA;CAEzE,MAAM,oBAA6C,CAAC;CACpD,IAAI,OAAO,eAAe,KAAA,KAAa,OAAO,gBAAgB,KAAA,GAK5D,kBAAkB,gBAAgB;EAHhC,YAAY,OAAO,cAAc;EACjC,aAAa,OAAO,eAAe;CAEI;CAM3C,MAAM,SAA4B;EAChC,SAHkB,MAAM,kBAAmB,OAAO;EAIlD,YAAY;EACZ;EACA,OAAO;EACP;EACA,gBAAgB;GAAE,UAAU,SAAS;GAAU,UAAU,SAAS;EAAS;CAC7E;CACA,IAAI,eAAe,KAAA,GAAW,OAAO,OAAO;CAC5C,IAAI,OAAO,KAAK,iBAAiB,CAAC,CAAC,SAAS,GAC1C,OAAO,oBAAoB;CAE7B,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AChNA,eAAsB,kBACpB,QACA,MAC0B;CAC1B,MAAM,aAAa,gBAAgB,IAAI;CACvC,IAAI,oBAAgD,CAClD,EAAE,SAAS,kDAAkD,CAC/D;CACA,IAAI;CACJ,KAAK,MAAM,aAAa,YAAY;EAClC,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,SAAS;EAC/B,SAAS,KAAc;GACrB,oBAAoB,CAAC,EAAE,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,EAAE,CAAC;GAClF;EACF;EACA,MAAM,SAAS,MAAM,gBAAgB,QAAQ,MAAM;EACnD,IAAI,OAAO,IAAI,OAAO;GAAE,IAAI;GAAM,OAAO,OAAO;EAAM;EACtD,wBAAwB,OAAO;CACjC;CACA,OAAO;EAAE,IAAI;EAAO,QAAQ,uBAAuB;CAAkB;AACvE;AAEA,MAAM,cAAc;;;;;;AAOpB,SAAS,gBAAgB,MAAwB;CAC/C,MAAM,aAAuB,CAAC;CAC9B,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,QAAQ,MAAoB;EAChC,MAAM,UAAU,EAAE,KAAK;EACvB,IAAI,QAAQ,WAAW,KAAK,KAAK,IAAI,OAAO,GAAG;EAC/C,KAAK,IAAI,OAAO;EAChB,WAAW,KAAK,OAAO;CACzB;CACA,KAAK,IAAI;CACT,KAAK,MAAM,SAAS,KAAK,SAAS,WAAW,GAAG;EAC9C,MAAM,OAAO,MAAM;EACnB,IAAI,SAAS,KAAA,GAAW,KAAK,IAAI;CACnC;CACA,KAAK,gBAAgB,MAAM,KAAK,GAAG,CAAC;CACpC,KAAK,gBAAgB,MAAM,KAAK,GAAG,CAAC;CACpC,OAAO;AACT;;;;;;AAOA,SAAS,gBAAgB,MAAc,MAAc,OAAuB;CAC1E,MAAM,QAAQ,KAAK,QAAQ,IAAI;CAC/B,MAAM,OAAO,KAAK,YAAY,KAAK;CACnC,IAAI,UAAU,MAAM,QAAQ,OAAO,OAAO;CAC1C,OAAO,KAAK,MAAM,OAAO,OAAO,CAAC;AACnC;;;;;;;AAQA,SAAgB,qBAAqB,QAA6C;CAChF,OAAO;EAAE,MAAM;EAAQ,SAAS,yBAAyB,MAAM;CAAE;AACnE;;;;;;AAOA,SAAgB,yBAAyB,QAA4C;CAEnF,OACE,oEAFiB,qBAAqB,MAEuC,EAAE;AAInF;;;;;AAMA,SAAgB,wBACd,QACA,UACO;CACP,MAAM,IAAI,wBACR,6BAA6B,qBAAqB,MAAM,KACxD,QACA,QACF;AACF;;;;;;AC7GA,SAAgB,oBACd,YACA,MACoB;CACpB,IAAI,eAAe,KAAA,GAAW,OAAO,KAAA;CACrC,OAAO,WAAW,WAAW,mBAAmB,EAAE,GAAG,KAAK,CAAC;AAC7D;;;;;AAMA,SAAgB,kBACd,YACA,SACA,MAMM;CACN,IAAI,eAAe,KAAA,KAAa,YAAY,KAAA,GAAW;CACvD,WAAW,SAAS,SAAS,EAAE,GAAG,KAAK,CAAC;AAC1C;;;;AAKA,SAAgB,gBACd,YACA,OACoB;CACpB,IAAI,eAAe,KAAA,GAAW,OAAO,KAAA;CACrC,OAAO,WAAW,WAAW,wBAAwB,EAAE,MAAM,CAAC;AAChE;;;;AAKA,SAAgB,cACd,YACA,SACA,MACM;CACN,IAAI,eAAe,KAAA,KAAa,YAAY,KAAA,GAAW;CACvD,WAAW,SAAS,SAAS,EAAE,GAAG,KAAK,CAAC;AAC1C;;;;AAqDA,SAAgB,iBACd,YACA,MACM;CACN,IAAI,eAAe,KAAA,GAAW;CAC9B,MAAM,QAAiC;EACrC,MAAM;EACN,YAAY,KAAK;EACjB,MAAM,KAAK;EACX,cAAc,KAAK;EACnB,OAAO,KAAK;EACZ,aAAa,KAAK;CACpB;CACA,IAAI,KAAK,UAAU,KAAA,GAAW,MAAM,WAAW,KAAK;CACpD,WAAW,OAAO;EAAE,MAAM;EAAa,GAAG;CAAM,CAAC;AACnD;;;;;;AAgBA,SAAgB,mBACd,YACA,MACM;CACN,IAAI,eAAe,KAAA,GAAW;CAC9B,MAAM,QAAiC;EACrC,MAAM;EACN,YAAY,KAAK;EACjB,MAAM,KAAK;EACX,cAAc,KAAK;EACnB,aAAa,KAAK;CACpB;CACA,IAAI,KAAK,UAAU,KAAA,GAAW,MAAM,WAAW,KAAK;MAC/C,MAAM,YAAY,KAAK;CAC5B,WAAW,OAAO;EAAE,MAAM;EAAe,GAAG;CAAM,CAAC;AACrD;;;;AAKA,SAAS,SAAS,MAAoE;CACpF,MAAM,MAA+B,EAAE,GAAG,KAAK;CAC/C,IAAI,EAAE,QAAQ,MAAM,IAAI,QAAQ,KAAK,IAAI;CACzC,OAAO;AACT;;;;;;;AAQA,SAAgB,gBACd,OAC8B;CAC9B,IAAI,UAAU,KAAA,GAAW,OAAO,KAAA;CAChC,OAAO;EACL,SAAS,UAAU;GACjB,IAAI,QAAQ,OAAO;IACjB,MAAM,OAAO,KAAK;IAClB;GACF;GACA,MAAM,OAAO;IAAE,GAAG;IAAO,IAAI,KAAK,IAAI;GAAE,CAAC;EAC3C;EACA,aAAa,MAAM,SAAS,MAAM,WAAW,MAAM,SAAS,IAAI,CAAC;EACjE,WAAW,IAAI,SAAS;GACtB,MAAM,SAAS,IAAI,SAAS,IAAI,CAAC;EACnC;CACF;AACF;;;;;AAQA,SAAgB,YACd,YACA,YACA,MACA,QACM;CACN,IAAI,eAAe,KAAA,GAAW;CAC9B,MAAM,QAAiC;EACrC,MAAM;EACN;EACA;EACA,WAAW,KAAK;EAChB,WAAW,KAAK;EAChB,YAAY,KAAK;CACnB;CACA,IAAI,KAAK,qBAAqB,KAAA,GAAW,MAAM,sBAAsB,KAAK;CAC1E,IAAI,KAAK,oBAAoB,KAAA,GAAW,MAAM,qBAAqB,KAAK;CACxE,IAAI,KAAK,kBAAkB,KAAA,GAAW,MAAM,mBAAmB,KAAK;CACpE,WAAW,OAAO;EAAE,MAAM;EAAQ,GAAG;CAAM,CAAC;AAC9C;;;;AAcA,SAAgB,6BACd,YACqB;CACrB,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,EACL,KAAK,UAAkB,UAAwB;EAC7C,IAAI,eAAe,KAAA,GAAW;EAC9B,MAAM,MAAM,GAAG,SAAS,GAAG;EAC3B,IAAI,KAAK,IAAI,GAAG,GAAG;EACnB,KAAK,IAAI,GAAG;EACZ,WAAW,OAAO;GAAE,MAAM;GAAmB;GAAU;EAAS,CAAC;CACnE,EACF;AACF;;;;;AAMA,SAAgB,sBACd,YACA,UACM;CACN,IAAI,eAAe,KAAA,GAAW;CAC9B,WAAW,OAAO;EAAE,MAAM;EAAkB;CAAS,CAAC;AACxD;;;;;;;AAgBA,SAAgB,gCACd,YACA,MACM;CACN,IAAI,eAAe,KAAA,GAAW;CAC9B,WAAW,OAAO;EAChB,MAAM;EACN,SAAS,KAAK;EACd,eAAe,KAAK;EACpB,UAAU,KAAK;CACjB,CAAC;AACH;;;;;;;;AAeA,SAAgB,0BACd,YACA,MAKM;CACN,IAAI,eAAe,KAAA,GAAW;CAC9B,WAAW,OAAO;EAChB,MAAM;EACN,YAAY,KAAK;EACjB,OAAO,KAAK;EACZ,UAAU,KAAK;CACjB,CAAC;AACH;;;;;;AAOA,SAAgB,0BACd,YACA,MAMM;CACN,IAAI,eAAe,KAAA,GAAW;CAC9B,WAAW,OAAO;EAChB,MAAM;EACN,YAAY,KAAK;EACjB,yBAAyB,KAAK;EAC9B,MAAM,KAAK;EACX,SAAS,KAAK;CAChB,CAAC;AACH;;;;;AAWA,SAAgB,qBACd,YACA,MACA,MACM;CACN,IAAI,eAAe,KAAA,GAAW;CAC9B,WAAW,OAAO;EAChB;EACA,WAAW,KAAK;EAChB,YAAY,KAAK;EACjB,cAAc,KAAK;CACrB,CAAC;AACH;;;;AAeA,SAAgB,4BACd,YACoB;CACpB,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,EACL,KAAK,QAAgB,UAAwB;EAC3C,IAAI,eAAe,KAAA,GAAW;EAC9B,IAAI,KAAK,IAAI,MAAM,GAAG;EACtB,KAAK,IAAI,MAAM;EACf,WAAW,OAAO;GAAE,MAAM;GAAkB;GAAQ;EAAS,CAAC;CAChE,EACF;AACF;;;;;;;;;;;;;;;;AClUA,MAAM,4BAA6C,IAAI,IAAwB;CAC7E;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAM,gBAAgB;AAOtB,MAAM,2BAAyE;CAC7E,KAAK;CACL,QAAQ;CACR,MAAM;CACN,OAAO;CACP,KAAK;AACP;;;;;;;;AASA,SAAgB,0BACd,QACwB;CACxB,IAAI,WAAW,KAAA,KAAa,WAAW,QAAQ,OAAO,CAAC;CACvD,OAAO,EAAE,0BAA0B,yBAAyB,QAAQ;AACtE;;;;;;;AAQA,SAAgB,kBAAkB,MAAsD;CACtF,MAAM,MAAM,KAAK,mBAAmB;CACpC,IAAI,QAAQ,KAAA,KAAa,QAAQ,QAAQ,OAAO,QAAQ,UACtD,OAAO,CAAC;CAEV,OAAO;AACT;;;;;;AAOA,SAAgB,oBAAoB,QAAoC;CACtE,IAAI,OAAO,WAAW,UAAU,OAAO;CACvC,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,QACd,IAAI,EAAE,SAAS,QAAQ,SAAS;CAElC,OAAO;AACT;;;;;;;;AASA,SAAgB,oBAAoB,QAAoC;CACtE,IAAI,OAAO,WAAW,UAAU,OAAO;CACvC,KAAK,MAAM,KAAK,QAAQ;EACtB,IAAI,EAAE,SAAS,QAAQ;EACvB,IAAI,OAAO,EAAE,YAAY,UAAU,OAAO,EAAE;EAC5C,MAAM,QAAkB,CAAC;EACzB,KAAK,MAAM,KAAK,EAAE,SAChB,IAAI,EAAE,SAAS,QAAQ,MAAM,KAAK,EAAE,IAAI;EAE1C,OAAO,MAAM,KAAK,IAAI;CACxB;CACA,OAAO;AACT;;;;;;;AAQA,SAAgB,oBAAoB,QAAgD;CAClF,IAAI,OAAO,WAAW,UAAU,OAAO,KAAA;CACvC,KAAK,MAAM,KAAK,QACd,IAAI,EAAE,SAAS,UAAU,OAAO,EAAE;AAGtC;;;;;;;;AASA,SAAgB,eAAkB,QAA+B;CAC/D,OAAO,KAAK,UAAU,eAAe,QAAQ,EAAE,YAAY,KAAK,CAAC,CAAC;AACpE;;;;;;;;;AAUA,SAAgB,qBACd,MACA,QACA,QACO;CACP,MAAM,UAAU,OAAO,MAAM,GAAG,GAAG;CACnC,IAAI,uBAAuB,MAAM,GAC/B,OAAO,IAAI,oBACT,eACA,wCAAwC,WACxC,EAAE,iBAAiB,eAAe,CACpC;CAEF,IAAI,0BAA0B,KAAK,MAAM,KAAK,iCAAiC,KAAK,MAAM,GACxF,OAAO,IAAI,iBAAiB,uBAAuB,+BAA+B,WAAW,EAC3F,gBAAgB,QAClB,CAAC;CAEH,MAAM,SAAS,OAAO,SAAS,WAAW,OAAO,KAAA;CACjD,MAAM,cAAc,WAAW,OAAO,YAAY,OAAO,KAAK;CAC9D,MAAM,UAAU,+BAA+B,OAAO,IAAI,IAAI,YAAY,IAAI;CAC9E,MAAM,WAAyD,EAC7D,gBAAgB,QAClB;CACA,IAAI,WAAW,KAAA,GAAW,SAAS,SAAS;CAC5C,OAAO,IAAI,iBAAiB,mBAAmB,SAAS,QAAQ;AAClE;;;;;;;;;;;AAqCA,eAAe,QACb,eACA,MACqB;CACrB,MAAM,OAAO,eAAe;EAC1B,UAAU,KAAK;EACf,iBAAiB,CAAC;EAClB,WAAW,KAAK;EAChB,sBAAsB,KAAK;EAC3B,eAAe,KAAK;EACpB,GAAI,KAAK,oBAAoB,KAAA,IAAY,EAAE,iBAAiB,KAAK,gBAAgB,IAAI,CAAC;CACxF,CAAC;CACD,MAAM,YAAsB,CAAC,GAAG,KAAK,aAAa,GAAG,IAAI;CAEzD,MAAM,aAA4D;EAChE,KAAK,KAAK;EACV,MAAM;EACN,KAAK,KAAK;EACV,OAAO,KAAK;EACZ,oBAAoB,KAAK;EACzB,kBAAkB,KAAK;CACzB;CACA,IAAI,KAAK,QAAQ,KAAA,GACf,WAAiC,MAAM,KAAK;CAE9C,IAAI,KAAK,UAAU,KAAA,GACjB,WAAwC,QAAQ,KAAK;CAGvD,MAAM,UAAU,MAAM,cAAc,UAAU,UAAU;CAExD,MAAM,QAAQ,oBAAoB;CAClC,MAAM,SAAwB,CAAC;CAE/B,MAAM,WAAW,YAA2B;EAC1C,WAAW,MAAM,QAAQ,QAAQ,cAC/B,MAAM,WAAW,OAAO,GAAG,KAAK,KAAK,QAAQ,KAAK,gBAAgB,KAAK,UAAU;EAEnF,MAAM,gBAAgB,OAAO,QAAQ,KAAK,gBAAgB,KAAK,UAAU;CAC3E,EAAA,CAAG;CAEH,IAAI;CACJ,IAAI;EACF,CAAC,iBAAiB,MAAM,QAAQ,IAAI,CAAC,QAAQ,WAAW,GAAG,OAAO,CAAC;CACrE,SAAS,KAAc;EACrB,IAAI;GACF,MAAM;EACR,QAAQ,CAER;EACA,MAAM;CACR;CAEA,MAAM,SAAS,SAAS,KAAK;CAE7B,IAAI,cAAc,SAAS,GACzB,MAAM,qBAAqB,cAAc,MAAM,cAAc,QAAQ,cAAc,MAAM;CAE3F,IAAI,CAAC,OAAO,iBACV,MAAM,IAAI,iBACR,mBACA,8DACA,EAAE,gBAAgB,cAAc,OAAO,MAAM,GAAG,GAAG,EAAE,CACvD;CAGF,OAAO;EAAE;EAAQ;CAAO;AAC1B;;;;;;AAaA,SAAS,qBACP,MACA,YACM;CACN,MAAM,iBAAiB,4BAA4B,UAAU;CAC7D,IAAI,KAAK,cAAc,KAAA,GACrB,eAAe,KAAK,aAAa,aAAa;CAEhD,IAAI,KAAK,sBAAsB,KAAA,GAC7B,eAAe,KAAK,qBAAqB,aAAa;CAExD,IAAI,KAAK,qBAAqB,KAAA,GAC5B,eAAe,KAAK,oBAAoB,aAAa;CAEvD,IAAI,KAAK,8BAA8B,KAAA,GACrC,eAAe,KAAK,6BAA6B,aAAa;CAEhE,IAAI,KAAK,4BAA4B,KAAA,GACnC,eAAe,KAAK,2BAA2B,aAAa;AAEhE;;;;;;AAOA,SAAS,iBACP,QACA,YACA,aACM;CACN,IAAI,oBAAoB,MAAM,KAAK,GACjC,MAAM,IAAI,0BACR,eACA,sBACA,oDACF;CAEF,IAAI,WAAW,SAAS,KAAK,gBAAgB;MACvB,WAAW,MAAM,MAAM,OAAO,EAAE,YAAY,UAClD,GACZ,MAAM,IAAI,0BACR,eACA,gBACA,gFACF;CAAA;AAGN;;;;;;AAOA,SAAS,2BACP,YACA,aACA,YACM;CACN,IAAI,WAAW,WAAW,KAAK,gBAAgB,oBAAoB,eAAe,KAAA,GAChF;CAEF,MAAM,UAAU,WACb,QAAQ,MAAM,OAAO,EAAE,YAAY,UAAU,CAAC,CAC9C,KAAK,MAAM,EAAE,IAAI;CACpB,WAAW,OAAO;EAChB,MAAM;EACN;CACF,CAAC;AACH;;;;;;AAOA,SAAS,wBACP,MACA,WACoB;CACpB,IAAI,KAAK,WAAW,KAAA,GAAW,OAAO,eAAe,KAAK,MAAM;CAChE,IACE,OAAO,UAAU,uBAAuB,YACxC,UAAU,mBAAmB,SAAS,GAEtC,OAAO,UAAU;AAGrB;;;;;;;AAQA,SAAS,oBACP,MACqD;CACrD,IAAI,KAAK,aAAa,KAAA,GAAW,OAAO,KAAA;CACxC,OAAO,OAAO,UAAsC;EAClD,MAAM,QAAQ,KAAK,WAAW,KAAK;EACnC,IAAI,UAAU,KAAA,KAAa,OAAO,MAAM,SAAS,YAC/C,MAAM;CAEV;AACF;;;;;;;;AASA,SAAS,kBACP,WACA,cACqD;CACrD,MAAM,aAAa,IAAI,gBAAgB;CACvC,UAAU,IAAI,UAAU;CACxB,MAAM,wBAA8B;EAClC,WAAW,MAAM,cAAc,MAAM;CACvC;CACA,IAAI,iBAAiB,KAAA,GACnB,IAAI,aAAa,SAAS,WAAW,MAAM,aAAa,MAAM;MACzD,aAAa,iBAAiB,SAAS,iBAAiB,EAAE,MAAM,KAAK,CAAC;CAE7E,OAAO;EACL;EACA,cAAoB;GAClB,IAAI,iBAAiB,KAAA,GACnB,aAAa,oBAAoB,SAAS,eAAe;GAE3D,UAAU,OAAO,UAAU;EAC7B;CACF;AACF;;;;;AAMA,SAAS,WACP,YACA,MACA,UACA,WACA,WACe;CACf,OAAO;EACL,UAAU,oBAAoB,YAAY;GACxC,OAAO,KAAK,SAAS,SAAS;GAC9B,UAAU;GACV,UAAU,SAAS;GACnB;GACA,YAAY,KAAK,WAAW,KAAA;GAC5B;EACF,CAAC;EACD,YAAY,gBAAgB,YAAY,CAAC;CAC3C;AACF;;;;;;AAOA,SAAS,yBAAyB,aAA6B;CAC7D,IAAI,gBAAgB,GAClB,OAAO;CAET,OAAO,kCAAkC,OAAO,WAAW,EAAE,iBAAiB,gBAAgB,IAAI,KAAK;AACzG;;;;;;;;;;AAWA,eAAe,yBACb,eACA,WACA,QACA,aACA,cACA,YACsD;CACtD,IAAI,SAAS;CACb,IAAI,eAAe;CACnB,SAAS;EACP,MAAM,UAAU,MAAM,kBAAkB,QAAQ,OAAO,UAAU;EACjE,IAAI,QAAQ,IACV,OAAO;GAAE;GAAQ,gBAAgB,QAAQ;EAAM;EAEjD,gCAAgC,YAAY;GAC1C,SAAS,iBAAiB,IAAI,YAAY;GAC1C,eAAe,qBAAqB,QAAQ,MAAM;GAClD,UAAU,OAAO;EACnB,CAAC;EACD,IAAI,gBAAgB,aAClB,MAAM,IAAI,wBACR,yBAAyB,WAAW,GACpC,QAAQ,QACR,OAAO,UACT;EAEF,MAAM,oBAAoB,OAAO;EACjC,IAAI,sBAAsB,KAAA,GACxB,MAAM,IAAI,wBACR,mEACA,QAAQ,QACR,OAAO,UACT;EAOF,UAAS,MALoB,QAAQ,eAAe;GAClD,GAAG;GACH,YAAY,yBAAyB,QAAQ,MAAM;GACnD,WAAW;IAAE,GAAG,UAAU;IAAW,YAAY;GAAkB;EACrE,CAAC,EAAA,CACuB;EACxB,gBAAgB;CAClB;AACF;;;;;;AAOA,eAAe,gBACb,eACA,WACA,MACA,cACkE;CAClE,IAAI,KAAK,WAAW,KAAA,GAClB,OAAO;EAAE,QAAQ;EAAc,gBAAgB,KAAA;CAAU;CAE3D,OAAO,yBACL,eACA,WACA,KAAK,QACL,KAAK,0BAA0B,GAC/B,cACA,UAAU,UACZ;AACF;;;;;AAMA,SAASC,kBACP,QACA,UACA,QACA,gBACmB;CACnB,OAAO,sBAAyB;EAC9B;EACA;EACA,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;EACzC,GAAI,mBAAmB,KAAA,IAAY,EAAE,eAAe,IAAI,CAAC;CAC3D,CAAC;AACH;;;;AAKA,SAAS,sBACP,YACA,OACM;CACN,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,SAAS,KAAA,GAChB,YAAY,YAAY,KAAK,OAAO,KAAK,MAAM,mBAAmB;AAGxE;;;;;;;AAQA,SAAS,iBACP,YACA,OACA,OACM;CACN,IAAI,MAAM,WAAW,GAAG;EACtB,cAAc,YAAY,MAAM,YAAY,CAAC,CAAC;EAC9C,MAAM,aAAa,KAAA;EACnB;CACF;CACA,MAAM,OAAO,MAAM;CACnB,IAAI,SAAS,KAAA,GACX,cAAc,YAAY,MAAM,YAAY;EAC1C,OAAO,KAAK;EACZ,eAAe,KAAK;CACtB,CAAC;CAEH,MAAM,aAAa,KAAA;CACnB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxC,MAAM,IAAI,MAAM;EAChB,IAAI,MAAM,KAAA,GAAW;EAErB,cAAc,YADH,gBAAgB,YAAY,CACZ,GAAG;GAC5B,OAAO,EAAE;GACT,eAAe,EAAE;EACnB,CAAC;CACH;AACF;;;;;AAMA,eAAe,gBACb,gBACA,QACe;CACf,IAAI,mBAAmB,KAAA,GAAW;CAClC,MAAM,eAAe;EACnB,MAAM;EACN,eAAe,OAAO;EACtB,OAAO,OAAO;CAChB,CAAC;AACH;;;;;;AAOA,SAAS,qBACP,YACA,OACA,KACM;CACN,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;CAC/D,IAAI,MAAM,eAAe,KAAA,GAAW;EAClC,cAAc,YAAY,MAAM,YAAY,EAAE,OAAO,QAAQ,CAAC;EAC9D,MAAM,aAAa,KAAA;CACrB;CACA,kBAAkB,YAAY,MAAM,UAAU,EAAE,OAAO,QAAQ,CAAC;AAClE;;;;;;;;AASA,SAAgB,0BAA0B,MAA0C;CAClF,MAAM,SAAS;CACf,qBAAqB,MAAM;CAE3B,MAAM,gBAAgB,qBAAqB;CAC3C,IAAI,WAAW;CACf,MAAM,4BAAkC,IAAI,IAAI;CAEhD,MAAM,kBAAkB,OAAO,OAAO,WAAW,YAAY,OAAO,OAAO,SAAS,IAChF,OAAO,SACP;CACJ,MAAM,qBAAqB,OAAO,aAAa;CAC/C,MAAM,2BAA2B,OAAO,sBAAA;CACxC,MAAM,yBAAyB,OAAO,oBAAA;CA0GtC,OAAO;EAvGL,MAAM;EACN,MAAM;EACN,WAAW,eAAe,UAAU,IAAI,UAAU;EAClD,MAAM,SACJ,MACA,UAC4B;GAC5B,IAAI,UAAU,MAAM,IAAI,sBAAsB;GAC9C,IAAI,KAAK,OAAO,YAAY,MAC1B,MAAM,IAAI,cAAc,WAAW,EAAE,QAAQ,KAAK,MAAM,OAAO,CAAC;GAOlE,MAAM,aAAa,gBAAgB,KAAK,UAAU;GAClD,MAAM,YAAY,kBAAkB,IAAI;GACxC,qBAAqB,MAAM,UAAU;GAErC,MAAM,aAAkC,KAAK,SAAS,CAAC;GACvD,MAAM,cAA8B,UAAU,eAAe;GAC7D,iBAAiB,KAAK,QAAQ,YAAY,WAAW;GAErD,MAAM,uBAAuB,oBAC3B,UAAU,eACV,WAAW,KAAK,MAAM,EAAE,IAAI,CAC9B;GACA,2BAA2B,YAAY,aAAa,UAAU;GAE9D,MAAM,gBAAgB,aACpB,KAAK,UAAU,oBAAoB,KAAK,MAAM,GAC9C,UAAU,oBACZ;GACA,MAAM,MAAM,UAAU,QAAQ,UAAU,KAAK,kBAAkB;GAC/D,OAAO,OAAO,KAAK,0BAA0B,KAAK,MAAM,CAAC;GACzD,MAAM,eAAe,mBAAmB,iBAAiB,OAAO,OAAO;GACvE,MAAM,iBAAiB,oBAAoB,IAAI;GAE/C,MAAM,EAAE,YAAY,WAAW,kBAAkB,WAAW,KAAK,KAAK;GACtE,MAAM,QAAQ,WACZ,YACA,MACA,UACA,WAAW,SAAS,GACpB,mBAAmB,KAAA,CACrB;GAEA,MAAM,YAAqB;IACzB,UAAU,SAAS;IACnB,YAAY,oBAAoB,KAAK,MAAM;IAC3C;IACA;IACA;IACA,iBAAiB,wBAAwB,MAAM,SAAS;IACxD;IACA,WAAW,aAAa;IACxB,aAAa,aAAa;IAC1B,KAAK,OAAO;IACZ,oBAAoB;IACpB,kBAAkB;IAClB,OAAO,WAAW;IAClB;IACA;GACF;GAEA,IAAI;IACF,MAAM,gBAAgB,MAAM,QAAQ,eAAe,SAAS;IAC5D,MAAM,EAAE,QAAQ,mBAAmB,MAAM,gBACvC,eACA,WACA,MACA,cAAc,MAChB;IAEA,MAAM,SAASA,kBAAmB,QAAQ,UAAU,KAAK,QAAQ,cAAc;IAC/E,sBAAsB,YAAY,OAAO,KAAK;IAC9C,iBAAiB,YAAY,OAAO,OAAO,KAAK;IAChD,kBAAkB,YAAY,MAAM,UAAU;KAC5C,OAAO,OAAO;KACd,eAAe,OAAO;KACtB,gBAAgB,OAAO;IACzB,CAAC;IACD,MAAM,gBAAgB,gBAAgB,MAAM;IAE5C,OAAO;GACT,SAAS,KAAc;IACrB,qBAAqB,YAAY,OAAO,GAAG;IAC3C,MAAM;GACR,UAAU;IACR,OAAO;GACT;EACF;EACA,MAAM,UAAyB;GAC7B,IAAI,UAAU;GACd,WAAW;GACX,KAAK,MAAM,cAAc,WACvB,WAAW,MAAM,iBAAiB;GAEpC,MAAM,cAAc,YAAY;EAClC;CAGW;AACf;;;;;;;;;;;ACzyBA,MAAM,oCAA0D,IAAI,IAA6B;CAC/F,CAAC,aAAa,wBAAwB;CACtC,CAAC,UAAU,qBAAqB;CAChC,CAAC,UAAU,qBAAqB;CAChC,CAAC,UAAU,qBAAqB;CAChC,CAAC,YAAY,uBAAuB;CACpC,CAAC,cAAc,yBAAyB;CACxC,CAAC,WAAW,sBAAsB;CAClC,CAAC,cAAc,yBAAyB;AAC1C,CAAC;;;;AAKD,SAAgB,yBAAgD;CAC9D,OAAO,CAAC,GAAG,kBAAkB,KAAK,CAAC;AACrC;;;;;AAMA,SAAgB,qBAAqB,MAA+B;CAClE,MAAM,UAAU,kBAAkB,IAAI,IAAI;CAC1C,IAAI,YAAY,KAAA,GAAW,MAAM,IAAI,8BAA8B,IAAI;CACvE,OAAO;AACT;;;;;;;;;;;;;;;;;AC/BA,SAAgB,uBACd,UACA,MACqC;CACrC,IAAI,aAAa,KAAA,KAAa,SAAS,KAAA,GAAW,OAAO,KAAA;CACzD,IAAI,aAAa,KAAA,GAAW,OAAO;CACnC,IAAI,SAAS,KAAA,GAAW;EACtB,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,CAAC,UAAU,UAAU,OAAO,QAAQ,QAAQ,GACrD,IAAI,YAAY,EAAE,GAAG,MAAM;EAE7B,OAAO;CACT;CACA,MAAM,MAA+B,CAAC;CACtC,KAAK,MAAM,CAAC,UAAU,UAAU,OAAO,QAAQ,QAAQ,GACrD,IAAI,YAAY,EAAE,GAAG,MAAM;CAE7B,KAAK,MAAM,CAAC,UAAU,UAAU,OAAO,QAAQ,IAAI,GAAG;EACpD,MAAM,WAAW,IAAI;EACrB,IAAIC,kBAAgB,QAAQ,KAAKA,kBAAgB,KAAK,GAGpD,IAAI,YAAY;GAAE,GAAG;GAAU,GAAG;EAAM;OAIxC,IAAI,YAAY;CAEpB;CACA,OAAO;AACT;;;;AAKA,SAASA,kBAAgB,OAAkD;CACzE,OAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC5E;;;;;;;;;;ACmCA,SAAgB,wBACd,UACiB;CACjB,IAAI,SAAS;CACb,OAAO;EACL,eAAe;EACf,MAAM,SAAS,OAAmC;GAChD,IAAI,aAAa,KAAA,KAAa,QAAQ;GACtC,IAAI;IACF,MAAM,QAAQ,SAAS,KAAK;IAC5B,IAAI,UAAU,KAAA,KAAa,OAAO,MAAM,SAAS,YAC/C,MAAM;GAEV,SAAS,KAAc;IACrB,SAAS;IACT,MAAM,IAAI,eAAe,4BAA4B,GAAG;GAC1D;EACF;CACF;AACF;;;AC/FA,MAAM,kBAAmD;CACvD;CACA;CACA;AACF;;;;;;;;;;AAWA,SAAgB,UAAU,OAA+C;CACvE,IAAI,eAAe;CACnB,IAAI,gBAAgB;CACpB,MAAM,UAA6C;EACjD,kBAAkB;EAClB,qBAAqB;EACrB,oBAAoB;CACtB;CACA,MAAM,OAAyC;EAC7C,kBAAkB;EAClB,qBAAqB;EACrB,oBAAoB;CACtB;CACA,KAAK,MAAM,QAAQ,OAAO;EACxB,gBAAgB,KAAK,MAAM;EAC3B,iBAAiB,KAAK,MAAM;EAC5B,KAAK,MAAM,OAAO,iBAAiB;GACjC,MAAM,QAAQ,KAAK,MAAM;GACzB,IAAI,UAAU,KAAA,GAAW;IACvB,QAAQ,OAAO;IACf,KAAK,QAAQ;GACf;EACF;CACF;CAEA,MAAM,QAAqB;EAAE;EAAc;CAAc;CACzD,KAAK,MAAM,OAAO,iBAChB,IAAI,QAAQ,MAAM,MAAM,OAAO,KAAK;CAEtC,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACDA,MAAM,iBAAiB;AACvB,MAAM,kBAAkB;AACxB,MAAM,cAAc;AACpB,MAAM,eAAe;AACrB,MAAM,WAAW;AACjB,MAAM,iBAAiB;;;;;;AAOvB,SAAS,iBAAiB,MAAc,MAAsB;CAC5D,IAAI,UAAU;CACd,KAAK,IAAI,IAAI,OAAO,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;EAC9C,MAAM,KAAK,KAAK;EAChB,IAAI,SAAS,UAAU;OAClB,IAAI,OAAO,MAAM,UAAU;OAC3B,IAAI,OAAO,MAAK,OAAO;CAC9B;CACA,OAAO,KAAK;AACd;;;;;;AAOA,SAAS,kBACP,MACA,OACA,KAC6C;CAC7C,IAAI;EACF,OAAO;GAAE,OAAO,KAAK,MAAM,KAAK,MAAM,OAAO,GAAG,CAAC;GAAG;EAAI;CAC1D,QAAQ;EACN;CACF;AACF;;;;;;;AAQA,SAAgB,mBACd,MACA,aAC6C;CAC7C,IAAI,KAAK,iBAAiB,KAAK,OAAO,KAAA;CACtC,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,aAAa,IAAI,KAAK,QAAQ,KAAK,GAAG;EACjD,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,MACT,IAAI,iBAAiB,MAAM,CAAC;OACvB,IAAI,OAAO,KAChB,SAAS;OACJ,IAAI,OAAO,KAAK;GACrB,SAAS;GACT,IAAI,UAAU,GAAG,OAAO,kBAAkB,MAAM,aAAa,IAAI,CAAC;EACpE;CACF;AAEF;;;;AAKA,SAAS,gBAAgB,OAAkD;CACzE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;;;;;AAMA,SAAS,WACP,OAC6D;CAC7D,IAAI,CAAC,gBAAgB,KAAK,GAAG,OAAO,KAAA;CACpC,IAAI,OAAO,KAAK,KAAK,CAAC,CAAC,WAAW,GAAG,OAAO,KAAA;CAC5C,MAAM,OAAO,MAAM;CACnB,MAAM,OAAO,MAAM;CACnB,IAAI,OAAO,SAAS,YAAY,CAAC,gBAAgB,IAAI,GAAG,OAAO,KAAA;CAC/D,OAAO;EAAE;EAAM;CAAK;AACtB;;;;AAKA,SAAS,aAAa,MAAY,OAAqC;CACrE,OAAO,MAAM,MAAM,MAAM,KAAK,QAAQ,EAAE,OAAO,EAAE,QAAQ,KAAK,GAAG;AACnE;;;;AAKA,SAAS,gBAAgB,OAA4B,OAAiC;CACpF,OAAO,MAAM,MAAM,MAAM,SAAS,EAAE,SAAS,QAAQ,EAAE,GAAG;AAC5D;;;;;;;AAQA,SAAS,iBAAiB,OAAuB;CAC/C,IAAI,MAAM;CACV,IAAI,IAAI,WAAW,IAAI,GAAG,MAAM,IAAI,MAAM,CAAC;CAC3C,IAAI,IAAI,SAAS,IAAI,GAAG,MAAM,IAAI,MAAM,GAAG,EAAE;CAC7C,OAAO;AACT;;;;;;;AAQA,SAAS,oBAAoB,aAAqB,OAA4B;CAC5E,MAAM,MAAmB,CAAC;CAC1B,KAAK,MAAM,MAAM,MAAM,SAAS,WAAW,GAAG;EAC5C,MAAM,OAAO,GAAG,MAAM;EACtB,MAAM,SAAiC,CAAC;EACxC,IAAI,WAAW;EACf,KAAK,MAAM,MAAM,KAAK,SAAS,YAAY,GAAG;GAC5C,OAAO,GAAG,MAAM,MAAM,iBAAiB,GAAG,MAAM,EAAE;GAClD,WAAW,SAAS,QAAQ,GAAG,IAAI,EAAE;EACvC;EAGA,IAAI,SAAS,KAAK,CAAC,CAAC,WAAW,GAAG;EAClC,IAAI,KAAK;GACP,MAAM,GAAG,MAAM;GACf,MAAM;GACN,QAAQ;GACR,MAAM;IAAE,OAAO,cAAc,GAAG;IAAO,KAAK,cAAc,GAAG,QAAQ,GAAG,EAAE,CAAC;GAAO;EACpF,CAAC;CACH;CACA,OAAO;AACT;;;;;;AAOA,SAAS,kBAAkB,MAAc,aAAqB,MAAmC;CAC/F,MAAM,QAAQ,KAAK,QAAQ,KAAK,WAAW;CAC3C,MAAM,UAAU,UAAU,KAAK,KAAA,IAAY,mBAAmB,MAAM,KAAK;CACzE,MAAM,SAAS,YAAY,KAAA,IAAY,KAAA,IAAY,WAAW,QAAQ,KAAK;CAC3E,IAAI,WAAW,KAAA,GAAW,OAAO,KAAA;CACjC,OAAO;EAAE,MAAM,OAAO;EAAM,MAAM,OAAO;EAAM,QAAQ;EAAU;CAAK;AACxE;;;;;;AAOA,SAAS,sBACP,MACA,aACA,OACA,MACa;CACb,MAAM,QAAQ,KAAK,MAAM,aAAa,KAAK;CAC3C,MAAM,UAAU,MAAM,KAAK;CAC3B,IAAI,QAAQ,WAAW,YAAY,GAAG,OAAO,oBAAoB,aAAa,KAAK;CACnF,IAAI,QAAQ,WAAW,GAAG,GAAG;EAC3B,MAAM,YAAY,kBAAkB,MAAM,aAAa,IAAI;EAC3D,OAAO,cAAc,KAAA,IAAY,CAAC,IAAI,CAAC,SAAS;CAClD;CACA,OAAO,CAAC;AACV;;;;;;;AAQA,SAAS,sBAAsB,MAA0D;CACvF,MAAM,aAA0B,CAAC;CACjC,MAAM,QAAgB,CAAC;CACvB,IAAI,MAAM;CACV,OAAO,MAAM;EACX,MAAM,OAAO,KAAK,QAAQ,gBAAgB,GAAG;EAC7C,IAAI,SAAS,IAAI;EACjB,MAAM,QAAQ,KAAK,QAAQ,iBAAiB,OAAO,EAAqB;EACxE,IAAI,UAAU,IAAI;GAGhB,MAAM,KAAK;IAAE,OAAO;IAAM,KAAK,KAAK;GAAO,CAAC;GAC5C;EACF;EACA,MAAM,YAAY,QAAQ;EAC1B,MAAM,OAAa;GAAE,OAAO;GAAM,KAAK;EAAU;EACjD,MAAM,KAAK,IAAI;EACf,MAAM,cAAc,OAAO;EAC3B,WAAW,KAAK,GAAG,sBAAsB,MAAM,aAAa,OAAO,IAAI,CAAC;EACxE,MAAM;CACR;CACA,OAAO;EAAE;EAAY;CAAM;AAC7B;;;;;;;AAQA,SAAS,YACP,MACA,aAC4C;CAC5C,MAAM,aAA0B,CAAC;CACjC,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,KAAK,KAAK,SAAS,QAAQ,GAAG;EACvC,MAAM,OAAa;GAAE,OAAO,EAAE;GAAO,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC;EAAO;EAChE,IAAI,aAAa,MAAM,WAAW,GAAG;EACrC,MAAM,KAAK,IAAI;EACf,MAAM,QAAQ,EAAE,MAAM,GAAA,CAAI,KAAK;EAC/B,IAAI,SAAS,MAAM,SAAS,QAAQ;EACpC,IAAI;EACJ,IAAI;GACF,QAAQ,KAAK,OAAO,EAAE,MAAM,GAAA,CAAI,KAAK,CAAC;EACxC,QAAQ;GACN;EACF;EACA,MAAM,SAAS,WAAW,KAAK;EAC/B,IAAI,WAAW,KAAA,GAAW;EAC1B,WAAW,KAAK;GAAE,MAAM,OAAO;GAAM,MAAM,OAAO;GAAM,QAAQ;GAAQ;EAAK,CAAC;CAChF;CACA,OAAO;EAAE;EAAY;CAAM;AAC7B;;;;;;;;AASA,SAAS,eAAe,MAAc,OAAyC;CAC7E,MAAM,MAAmB,CAAC;CAC1B,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QAAQ;EACtB,MAAM,SAAS,gBAAgB,OAAO,CAAC;EACvC,IAAI,WAAW,KAAA,GAAW;GACxB,IAAI,OAAO;GACX;EACF;EACA,IAAI,KAAK,OAAO,KAAK;GACnB,KAAK;GACL;EACF;EACA,MAAM,UAAU,mBAAmB,MAAM,CAAC;EAC1C,IAAI,YAAY,KAAA,GAAW;GACzB,KAAK;GACL;EACF;EACA,MAAM,OAAa;GAAE,OAAO;GAAG,KAAK,QAAQ;EAAI;EAChD,MAAM,SAAS,aAAa,MAAM,KAAK,IAAI,KAAA,IAAY,WAAW,QAAQ,KAAK;EAC/E,IAAI,WAAW,KAAA,GACb,IAAI,KAAK;GAAE,MAAM,OAAO;GAAM,MAAM,OAAO;GAAM,QAAQ;GAAQ;EAAK,CAAC;EAEzE,IAAI,QAAQ;CACd;CACA,OAAO;AACT;;;;;;;;;AAUA,eAAe,mBACb,WACA,UACmC;CACnC,MAAM,OAAO,SAAS,IAAI,UAAU,IAAI;CACxC,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CAC/B,MAAM,SAAS,KAAK;CACpB,MAAM,MAAM,MAAM,gBAAgB,QAAQ,UAAU,IAAI;CACxD,IAAI,IAAI,IACN,OAAO;EACL,MAAM,UAAU;EAChB,OAAO,IAAI;EACX,QAAQ,UAAU;EAClB,MAAM,UAAU;CAClB;CAEF,IAAI,UAAU,WAAW,YAAY,OAAO,KAAA;CAI5C,MAAM,UAAmC,CAAC;CAC1C,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,UAAU,IAAI,GAAG;EACnD,IAAI,OAAO,MAAM,UAAU;GACzB,QAAQ,KAAK;GACb;EACF;EACA,IAAI;GACF,QAAQ,KAAK,KAAK,MAAM,CAAC;EAC3B,QAAQ;GACN,QAAQ,KAAK;EACf;CACF;CACA,MAAM,UAAU,MAAM,gBAAgB,QAAQ,OAAO;CACrD,IAAI,CAAC,QAAQ,IAAI,OAAO,KAAA;CACxB,OAAO;EACL,MAAM,UAAU;EAChB,OAAO,QAAQ;EACf,QAAQ,UAAU;EAClB,MAAM,UAAU;CAClB;AACF;;;;;AAMA,SAAS,YAAY,MAAc,OAAoC;CACrE,IAAI,MAAM;CACV,MAAM,aAAa,MAAM,UAAU,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;CAC7D,KAAK,MAAM,KAAK,YAAY,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,IAAI,IAAI,MAAM,EAAE,GAAG;CAGzE,OAAO,IAAI,QAAQ,gBAAgB,EAAE,CAAC,CAAC,KAAK;AAC9C;;;;;;;;;AAUA,eAAsB,mBACpB,MACA,UACqC;CACrC,IAAI,KAAK,WAAW,GAAG,OAAO,KAAA;CAC9B,MAAM,SAAS,sBAAsB,IAAI;CACzC,MAAM,SAAS,YAAY,MAAM,OAAO,KAAK;CAC7C,MAAM,YAAY,CAAC,GAAG,OAAO,OAAO,GAAG,OAAO,KAAK;CACnD,MAAM,aAAa;EACjB,GAAG,OAAO;EACV,GAAG,OAAO;EACV,GAAG,eAAe,MAAM,SAAS;CACnC,CAAC,CAAC,UAAU,GAAG,MAAM,EAAE,KAAK,QAAQ,EAAE,KAAK,KAAK;CAOhD,MAAM,SAAQ,MADU,QAAQ,IAAI,WAAW,KAAK,MAAM,mBAAmB,GAAG,QAAQ,CAAC,CAAC,EAAA,CAClE,QAAQ,MAAM,MAAM,KAAA,CAAS;CACrD,IAAI,MAAM,WAAW,GAAG,OAAO,KAAA;CAC/B,OAAO;EACL;EACA,eAAe,YACb,MACA,MAAM,KAAK,MAAM,EAAE,IAAI,CACzB;CACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrRA,SAAS,iBAAiB,OAAoB,YAA0B;CACtE,IAAI,CAAC,MAAM,SAAS;CACpB,MAAM,IAAI,cAAc,WAAW;EAAE,QAAQ,MAAM;EAAQ;CAAW,CAAC;AACzE;;;;;AAMA,SAAS,2BACP,OACA,YACA,WACM;CACN,IAAI,CAAC,MAAM,SAAS;CACpB,MAAM,IAAI,cAAc,WAAW;EACjC,QAAQ,MAAM;EACd;EACA,qBAAqB;GAAE,IAAI,UAAU;GAAI,MAAM,UAAU;EAAK;CAChE,CAAC;AACH;;;;AAKA,SAAS,gBAAgB,KAAsB;CAC7C,IAAI,eAAe,OAAO,OAAO,IAAI;CACrC,IAAI,OAAO,QAAQ,UAAU,OAAO;CACpC,IAAI;EACF,OAAO,KAAK,UAAU,GAAG,KAAK,OAAO,GAAG;CAC1C,QAAQ;EACN,OAAO,OAAO,GAAG;CACnB;AACF;;;;;;;;;AAUA,eAAe,iBACb,MACA,OACA,YACA,cACA,OACA,kBACA,YACkB;CAClB,MAAM,iBAAiB,KAAK;CAK5B,IAAI,EAHF,OAAO,mBAAmB,aACtB,MAAM,eAAe,KAAK,IAC1B,mBAAmB,OACb,OAAO;CAEnB,qBAAqB,YAAY,2BAA2B;EAC1D,WAAW,KAAK;EAChB;EACA;CACF,CAAC;CAED,IAAI,qBAAqB,KAAA,GAAW;EAClC,qBAAqB,YAAY,wBAAwB;GACvD,WAAW,KAAK;GAChB;GACA;EACF,CAAC;EACD,MAAM,IAAI,2BACR,+BAA+B,KAAK,KAAK,iDACzC;GAAE,WAAW,KAAK;GAAM;GAAY;EAAa,CACnD;CACF;CAEA,MAAM,mBAAmB,QAAQ,QAC/B,iBAAiB;EAAE,WAAW,KAAK;EAAM;EAAO;EAAY;CAAM,CAAC,CACrE;CAEA,MAAM,WAAW,MAAM,IAAI,SAAkB,SAAS,WAAW;EAC/D,IAAI,MAAM,SAAS;GACjB,OAAO,IAAI,cAAc,WAAW;IAAE,QAAQ,MAAM;IAAQ;GAAW,CAAC,CAAC;GACzE;EACF;EACA,MAAM,iBAAuB;GAC3B,OAAO,IAAI,cAAc,WAAW;IAAE,QAAQ,MAAM;IAAQ;GAAW,CAAC,CAAC;EAC3E;EAEA,MAAM,iBAAiB,SAAS,UAAU,EAAE,MAAM,KAAK,CAAC;EACxD,iBAAiB,MACd,UAAU;GAET,MAAM,oBAAoB,SAAS,QAAQ;GAC3C,QAAQ,KAAK;EACf,IACC,QAAiB;GAEhB,MAAM,oBAAoB,SAAS,QAAQ;GAC3C,OAAO,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC;EAC5D,CACF;CACF,CAAC;CAED,qBACE,YACA,WAAW,0BAA0B,wBACrC;EAAE,WAAW,KAAK;EAAM;EAAY;CAAa,CACnD;CAEA,OAAO;AACT;;;;AAKA,eAAe,2BACb,gBACA,YACA,IACA,QACA,OACe;CACf,IAAI,mBAAmB,KAAA,GAAW;CAClC,MAAM,QAAqB;EAAE,MAAM;EAAe;EAAI;CAAW;CACjE,IAAI,WAAW,KAAA,GAAW,MAAM,SAAS;CACzC,IAAI,UAAU,KAAA,GAAW,MAAM,QAAQ;CACvC,MAAM,eAAe,KAAK;AAC5B;;;;;AAMA,SAAS,0BACP,cACA,WACA,SACS;CAGT,OAAO;EACL,MAAM;EACN;EACA,MAAM;EACN,SALA,OAAO,YAAY,WAAW,UAAU,oBAAoB,OAAO;CAMrE;AACF;;;;;AAMA,SAAS,oBAAoB,OAAwB;CACnD,IAAI;EACF,OAAO,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK;CAC9C,QAAQ;EACN,OAAO,OAAO,KAAK;CACrB;AACF;;;;;AAMA,SAAS,wBAAwB,MAAc,YAAiD;CAC9F,IAAI,WAAW,WAAW,GAAG,OAAO;EAAE,MAAM;EAAa,SAAS;CAAK;CACvE,MAAM,QAGF,CAAC;CACL,IAAI,KAAK,SAAS,GAAG,MAAM,KAAK;EAAE,MAAM;EAAQ;CAAK,CAAC;CACtD,KAAK,MAAM,MAAM,YACf,MAAM,KAAK;EAAE,MAAM;EAAa,IAAI,GAAG;EAAI,MAAM,GAAG;EAAM,OAAO,GAAG;CAAM,CAAC;CAE7E,OAAO;EAAE,MAAM;EAAa,SAAS;CAAM;AAC7C;;;;;;;AAQA,SAAS,wBACP,QACA,YACA,OAC2B;CAC3B,MAAM,UAAU,OAAO,gBAAgB;CACvC,IAAI,YAAY,KAAA,KAAa,CAAC,eAAe,IAAI,OAAO,QAAQ,GAAG;EACjE,OAAO,cAAc,KAAK,OAAO,UAAU,OAAO,QAAQ;EAC1D;CACF;CACA,MAAM,YAAY,aAAa,OAAO,SAAS,OAAO,QAAQ;CAC9D,IAAI,cAAc,KAAA,GAChB,YAAY,OAAO,YAAY,YAAY,WAAW,gBAAgB;CAExE,OAAO;AACT;;;;;AAMA,eAAe,oBACb,MACA,OACwE;CACxE,MAAM,SAAS,MAAM,gBAAgB,KAAK,cAAc,KAAK;CAC7D,IAAI,OAAO,IAAI,OAAO;EAAE,IAAI;EAAM,OAAO,OAAO;CAAM;CACtD,OAAO;EAAE,IAAI;EAAO,SAAS,uBAAuB,qBAAqB,OAAO,MAAM;CAAI;AAC5F;;;;;;;;;;AAWA,eAAe,mBACb,QACA,YACiC;CACjC,IAAI,OAAO,iBAAiB,KAAA,GAAW,OAAO,OAAO;CAKrD,MAAM,eAAc,MAJG,OAAO,aAAa;EACzC;EACA,UAAU,OAAO;CACnB,CAAC,EAAA,EAC6B;CAC9B,IAAI,gBAAgB,KAAA,GAAW,OAAO,OAAO;CAC7C,OAAO,YAAY,OAAO;EACxB,MAAM;EACN;EACA,sBAAsB,OAAO,SAAS;EACtC,qBAAqB,YAAY;CACnC,CAAC;CACD,OAAO;AACT;;;;AA4CA,SAAS,YACP,KACA,MACA,eACA,mBACgB;CAChB,OAAO;EAAE;EAAM,OAAO,IAAI;EAAO,YAAY,IAAI;EAAY;EAAe;CAAkB;AAChG;;;;;;AAOA,eAAe,YACb,QACA,YACA,WACqB;CACrB,IAAI;EACF,MAAM,mBAAmB,MAAM,mBAAmB,QAAQ,UAAU;EACpE,OAAO,YAAY,OAAO;GAAE,MAAM;GAAgB;EAAW,CAAC;EAC9D,MAAM,OAAO,MAAM,OAAO,YAAY;GACpC;GACA,UAAU;GACV,OAAO,OAAO;GACd,OAAO,OAAO;GACd,QAAQ,OAAO;EACjB,CAAC;EACD,OAAO,YAAY,OAAO;GACxB,MAAM;GACN;GACA,eAAe,KAAK,MAAM;GAC1B,eAAe,KAAK;EACtB,CAAC;EACD,OAAO;CACT,SAAS,KAAc;EACrB,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EAC/D,cAAc,OAAO,YAAY,WAAW,EAAE,OAAO,QAAQ,CAAC;EAC9D,MAAM;CACR;AACF;;;;;;;;;;;;AAaA,eAAe,aACb,QACA,MACA,UACA,YACsB;CACtB,MAAM,SAAsB;EAC1B,OAAO,KAAK;EACZ,cAAc,KAAK;EACnB,yBAAS,IAAI,IAAI;EACjB,SAAS,KAAA;CACX;CACA,MAAM,SAAS,OAAO;CAOtB,IAAI,EALF,KAAK,WAAW,WAAW,MAC1B,KAAK,kBAAkB,UAAU,KAAK,kBAAkB,aACzD,OAAO,MAAM,SAAS,KACtB,WAAW,KAAA,KACX,OAAO,YAAY,IACN,OAAO;CAEtB,MAAM,UAAU,MAAM,mBAAmB,KAAK,MAAM,QAAQ;CAC5D,IAAI,YAAY,KAAA,GAAW,OAAO;CAClC,OAAO,aAAa;CACpB,MAAM,0BAAU,IAAI,IAA2B;CAC/C,MAAM,QAAQ,QAAQ,MAAM,KAAK,GAAG,MAAM;EACxC,MAAM,KAAK,YAAY,WAAW,GAAG;EACrC,QAAQ,IAAI,IAAI,EAAE,MAAM;EACxB,OAAO;GAAE;GAAI,MAAM,EAAE;GAAM,OAAO,EAAE;EAAM;CAC5C,CAAC;CACD,0BAA0B,OAAO,YAAY;EAC3C;EACA,OAAO,MAAM,KAAK,OAAO;GACvB,cAAc,EAAE;GAChB,MAAM,EAAE;GAER,QAAQ,QAAQ,IAAI,EAAE,EAAE,KAAK;EAC/B,EAAE;EACF,UAAU,KAAK;CACjB,CAAC;CACD,MAAM,8BAA8B,QAAQ,OAAO,UAAU;CAC7D,OAAO;EAAE;EAAO,cAAc,QAAQ;EAAe;EAAS;CAAQ;AACxE;;;;;;AAOA,eAAe,8BACb,QACA,OACA,YACe;CACf,IAAI,OAAO,mBAAmB,KAAA,GAAW;CACzC,KAAK,MAAM,KAAK,OAAO;EACrB,MAAM,OAAO,eAAe;GAC1B,MAAM;GACN,IAAI,EAAE;GACN,MAAM,EAAE;GACR;EACF,CAAC;EACD,MAAM,OAAO,eAAe;GAC1B,MAAM;GACN,IAAI,EAAE;GACN,OAAO,EAAE;GACT;EACF,CAAC;CACH;AACF;;;;;;AAOA,SAAS,YACP,QACA,OACA,YAC2E;CAC3E,MAAM,MAAM,OAAO;CACnB,IAAI,QAAQ,KAAA,KAAa,MAAM,UAAU,KAAK,OAAO;EAAE,MAAM;EAAO,SAAS,CAAC;CAAE;CAChF,MAAM,OAAO,MAAM,MAAM,GAAG,GAAG;CAC/B,MAAM,UAAU,MAAM,MAAM,GAAG;CAC/B,0BAA0B,OAAO,YAAY;EAC3C;EACA,yBAAyB;EACzB,MAAM,KAAK;EACX,SAAS,QAAQ,KAAK,OAAO;GAAE,cAAc,EAAE;GAAI,MAAM,EAAE;EAAK,EAAE;CACpE,CAAC;CACD,OAAO;EAAE;EAAM;CAAQ;AACzB;;;;;;;AAQA,eAAe,mBACb,KACA,MACA,SACA,QACe;CACf,MAAM,SAAyB;EAC7B,IAAI,KAAK;EACT,MAAM,KAAK;EACX,OAAO,KAAK;EACZ,OAAO,EAAE,QAAQ;EACjB,aAAa,OAAO;EACpB,YAAY,OAAO;CACrB;CACA,IAAI,QAAQ,KAAK,MAAM;CACvB,IAAI,YAAY,KAAK,MAAM;CAC3B,IAAI,KAAK,KACP,0BAA0B,KAAK,IAAI,KAAK,MAAM,EAAE,OAAO,QAAQ,CAAC,CAClE;CACA,iBAAiB,IAAI,OAAO,YAAY;EACtC,YAAY,IAAI;EAChB,MAAM,KAAK;EACX,cAAc,KAAK;EACnB,OAAO,KAAK;EACZ,aAAa,OAAO;EACpB,OAAO,EAAE,QAAQ;CACnB,CAAC;CACD,MAAM,2BACJ,IAAI,OAAO,gBACX,IAAI,YACJ,KAAK,IACL,KAAA,GACA,EAAE,QAAQ,CACZ;AACF;;;;;;;AAQA,eAAe,uBACb,KACA,MACA,SACe;CACf,MAAM,SAAyB;EAC7B,IAAI,KAAK;EACT,MAAM,KAAK;EACX,OAAO,KAAK;EACZ,OAAO,EAAE,QAAQ;EACjB,aAAa;EACb,YAAY,KAAK,IAAI;CACvB;CACA,IAAI,QAAQ,KAAK,MAAM;CACvB,IAAI,YAAY,KAAK,MAAM;CAC3B,MAAM,2BACJ,IAAI,OAAO,gBACX,IAAI,YACJ,KAAK,IACL,KAAA,GACA,EAAE,QAAQ,CACZ;AACF;;;;;;AAOA,eAAe,uBACb,KACA,UACqD;CACrD,MAAM,OAAO,IAAI,SAAS,IAAI,SAAS,IAAI;CAC3C,IAAI,SAAS,KAAA,GAAW;EACtB,MAAM,cAAc,iBAAiB,SAAS,KAAK;EACnD,IAAI,IAAI,OAAO,sBAAsB,SAAS;GAC5C,MAAM,SAAS,IAAI,WAAW,aAAa;IACzC,WAAW,SAAS;IACpB,cAAc,SAAS;IACvB,OAAO,IAAI,MAAM,WAAW;GAC9B,CAAC;GACD,cAAc,IAAI,OAAO,YAAY,IAAI,WAAW,EAAE,OAAO,YAAY,CAAC;GAC1E,MAAM;EACR;EACA,MAAM,mBAAmB,KAAK,UAAU,aAAa;GACnD,aAAa;GACb,YAAY,KAAK,IAAI;EACvB,CAAC;EACD;CACF;CAEA,MAAM,aAAa,MAAM,oBAAoB,MAAM,SAAS,KAAK;CACjE,IAAI,CAAC,WAAW,IAAI;EAClB,MAAM,mBAAmB,KAAK,UAAU,WAAW,SAAS;GAC1D,aAAa;GACb,YAAY,KAAK,IAAI;EACvB,CAAC;EACD;CACF;CAEA,OAAO;EAAE;EAAM,OAAO,WAAW;CAAM;AACzC;;;;;;AAOA,eAAe,aACb,KACA,MACA,OACA,UACkB;CAClB,IAAI;CACJ,IAAI;EACF,WAAW,MAAM,iBACf,MACA,OACA,IAAI,YACJ,SAAS,IACT,IAAI,OAAO,OACX,IAAI,OAAO,kBACX,IAAI,OAAO,UACb;CACF,SAAS,KAAc;EACrB,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EAC/D,cAAc,IAAI,OAAO,YAAY,IAAI,WAAW,EAAE,OAAO,QAAQ,CAAC;EACtE,MAAM;CACR;CACA,IAAI,UAAU,OAAO;CAErB,MAAM,iBAAiB;CACvB,IAAI,IAAI,OAAO,sBAAsB,SAAS;EAC5C,MAAM,SAAS,IAAI,2BACjB,SAAS,KAAK,KAAK,oBACnB;GAAE,WAAW,KAAK;GAAM,YAAY,IAAI;GAAY,cAAc,SAAS;EAAG,CAChF;EACA,cAAc,IAAI,OAAO,YAAY,IAAI,WAAW,EAAE,OAAO,eAAe,CAAC;EAC7E,MAAM;CACR;CACA,MAAM,mBACJ,KACA;EAAE,IAAI,SAAS;EAAI,MAAM,KAAK;EAAM;CAAM,GAC1C,gBACA;EAAE,aAAa;EAAG,YAAY,KAAK,IAAI;CAAE,CAC3C;CACA,OAAO;AACT;;;;;;AAOA,eAAe,sBACb,KACA,MACA,OACA,UACe;CACf,MAAM,aAAa,KAAK,IAAI;CAC5B,MAAM,WAA4B;EAChC,OAAO,IAAI,OAAO;EAClB,cAAc,SAAS;EACvB,YAAY,IAAI;EAChB,GAAI,IAAI,OAAO,eAAe,KAAA,IAAY,EAAE,YAAY,IAAI,OAAO,WAAW,IAAI,CAAC;CACrF;CAEA,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;EACF,MAAM,UAAU,KAAK;EACrB,MAAM,QAAQ,QAAQ,OAAO,QAAQ;EACrC,SAAS,iBAAiB,UAAU,MAAM,QAAQ;CACpD,SAAS,KAAc;EACrB,SAAS;EACT,cAAc,gBAAgB,GAAG;CACnC;CAEA,MAAM,cAAc,KAAK,IAAI,IAAI;CAEjC,IAAI,WAAW,KAAA,GAAW;EACxB,MAAM,uBAAuB,KAAK,MAAM,UAAU,OAAO;GACvD;GACA;GACA;GACA;EACF,CAAC;EACD;CACF;CAEA,MAAM,SAAyB;EAC7B,IAAI,SAAS;EACb,MAAM,KAAK;EACX;EACA;EACA;EACA;CACF;CACA,IAAI,QAAQ,KAAK,MAAM;CACvB,IAAI,YAAY,KAAK,MAAM;CAC3B,IAAI,KAAK,cAAc,MAAM,IAAI,iBAAiB;CAClD,IAAI,KAAK,KAAK,0BAA0B,SAAS,IAAI,KAAK,MAAM,UAAU,EAAE,CAAC;CAC7E,iBAAiB,IAAI,OAAO,YAAY;EACtC,YAAY,IAAI;EAChB,MAAM,KAAK;EACX,cAAc,SAAS;EACvB;EACA;CACF,CAAC;CACD,MAAM,2BAA2B,IAAI,OAAO,gBAAgB,IAAI,YAAY,SAAS,IAAI,MAAM;AACjG;;;;;;AAOA,eAAe,uBACb,KACA,MACA,UACA,OACA,SAMe;CACf,IAAI,IAAI,OAAO,MAAM,SAAS;EAC5B,MAAM,YAAY,IAAI,cAAc,WAAW;GAC7C,QAAQ,IAAI,OAAO,MAAM;GACzB,YAAY,IAAI;GAChB,qBAAqB;IAAE,IAAI,SAAS;IAAI,MAAM,KAAK;GAAK;EAC1D,CAAC;EACD,cAAc,IAAI,OAAO,YAAY,IAAI,WAAW,EAAE,OAAO,UAAU,CAAC;EACxE,MAAM;CACR;CACA,IAAI,IAAI,OAAO,sBAAsB,SAAS;EAC5C,MAAM,UAAU,IAAI,WAClB,SAAS,KAAK,KAAK,YAAY,QAAQ,eAAe,aACtD;GACE,WAAW,KAAK;GAChB,cAAc,SAAS;GACvB,OAAO,QAAQ;EACjB,CACF;EACA,cAAc,IAAI,OAAO,YAAY,IAAI,WAAW,EAElD,OAAO,QAAQ,eAAe,aAChC,CAAC;EACD,MAAM;CACR;CACA,MAAM,mBACJ,KACA;EAAE,IAAI,SAAS;EAAI,MAAM,KAAK;EAAM;CAAM,GAE1C,QAAQ,eAAe,WACvB;EAAE,aAAa,QAAQ;EAAa,YAAY,QAAQ;CAAW,CACrE;AACF;;;;;;;AAQA,eAAe,aAAa,KAAkB,UAAsC;CAClF,2BAA2B,IAAI,OAAO,OAAO,IAAI,YAAY;EAC3D,IAAI,SAAS;EACb,MAAM,SAAS;CACjB,CAAC;CAKD,IAAI,IAAI,sBAAsB,IAAI,SAAS,IAAI,SAAS,IAAI,CAAC,EAAE,cAAc,MAAM;EACjF,MAAM,uBAAuB,KAAK,UAAU,qCAAqC;EACjF;CACF;CAEA,MAAM,WAAW,MAAM,uBAAuB,KAAK,QAAQ;CAC3D,IAAI,aAAa,KAAA,GAAW;CAG5B,IAAI,CAAC,MADkB,aAAa,KAAK,SAAS,MAAM,SAAS,OAAO,QAAQ,GACjE;CAEf,2BAA2B,IAAI,OAAO,OAAO,IAAI,YAAY;EAC3D,IAAI,SAAS;EACb,MAAM,SAAS,KAAK;CACtB,CAAC;CAED,MAAM,sBAAsB,KAAK,SAAS,MAAM,SAAS,OAAO,QAAQ;AAC1E;;;;;AAMA,SAAS,cACP,SACA,SACM;CACN,KAAK,MAAM,KAAK,SAAS;EACvB,MAAM,SAAS,QAAQ,IAAI,EAAE,EAAE;EAC/B,IAAI,WAAW,KAAA,GAAW;GACxB,EAAE,WAAW;GACb,EAAE,kBAAkB;EACtB;CACF;AACF;;;;;;AAOA,SAAS,kBACP,QACA,YACA,SACM;CACN,KAAK,MAAM,KAAK,SACd,mBAAmB,OAAO,YAAY;EACpC;EACA,MAAM,EAAE;EACR,cAAc,EAAE;EAChB,aAAa,EAAE;EACf,GAAI,EAAE,UAAU,KAAA,IAAY,EAAE,OAAO,EAAE,MAAM,IAAI,EAAE,QAAQ,EAAE,OAAO;CACtE,CAAC;AAEL;;;;;;;;AASA,SAAS,2BACP,KACA,UACA,aACc;CACd,IAAI,IAAI,gBAAgB,OAAO;CAC/B,IAAI,IAAI,oBAAoB,OAAO;CACnC,IAAI,UAAU,OAAO;CACrB,OAAO;AACT;;;;;AAMA,SAAS,iBACP,QACA,KACA,YACA,MACA,YACA,eACA,WACM;CACN,MAAM,SAAqB;EACzB,OAAO;EACP,MAAM,KAAK;EACX;EACA,OAAO,KAAK;EACZ;CACF;CACA,MAAM,YAAY,wBAAwB,QAAQ,YAAY,KAAK,KAAK;CACxE,IAAI,cAAc,KAAA,GAAW,OAAO,OAAO;CAC3C,IAAI,KAAK,sBAAsB,KAAA,GAC7B,OAAO,oBAAoB,KAAK;CAElC,IAAI,MAAM,KAAK,MAAM;CACrB,IAAI,OAAO,mBAAmB,KAAA,GAAW,OAAO,eAAe,MAAM;CACrE,cAAc,OAAO,YAAY,WAAW;EAC1C,OAAO,KAAK;EACZ;CACF,CAAC;AACH;;;;;;;AAQA,eAAe,cACb,QACA,UACA,KACA,YACqC;CACrC,MAAM,YAAY,gBAAgB,OAAO,YAAY,UAAU;CAC/D,MAAM,OAAO,MAAM,YAAY,QAAQ,YAAY,SAAS;CAE5D,MAAM,OAAO,MAAM,aAAa,QAAQ,MAAM,UAAU,UAAU;CAClE,MAAM,EAAE,MAAM,YAAY,YAAY,QAAQ,KAAK,OAAO,UAAU;CACpE,OAAO,SAAS,KAAK,wBAAwB,KAAK,cAAc,IAAI,CAAC;CAErE,IAAI,KAAK,WAAW,GAAG;EACrB,iBAAiB,QAAQ,KAAK,YAAY,MAAM,CAAC,GAAG,KAAK,eAAe,SAAS;EACjF,OAAO,YAAY,KAAK,KAAK,MAAM,KAAK,eAAe,KAAK;CAC9D;CAGA,MAAM,MAAmB;EACvB;EACA;EACA;EACA;EACA,oBAAoB,aAAa,KAAK,OAAO;EAC7C,SAAS,CAAC;EACV,aAAa,IAAI;EACjB,MAAM,CAAC;EACP,gBAAgB;CAClB;CACA,KAAK,MAAM,YAAY,MAAM,MAAM,aAAa,KAAK,QAAQ;CAK7D,KAAK,MAAM,KAAK,SACd,MAAM,uBAAuB,KAAK,GAAG,iCAAiC;CAGxE,cAAc,IAAI,SAAS,KAAK,OAAO;CACvC,kBAAkB,QAAQ,YAAY,IAAI,OAAO;CACjD,KAAK,MAAM,KAAK,IAAI,MAAM,OAAO,SAAS,KAAK,CAAC;CAEhD,MAAM,qBAAqB,2BACzB,KACA,KAAK,YAAY,KAAA,GACjB,KAAK,aACP;CACA,iBAAiB,QAAQ,KAAK,YAAY,MAAM,IAAI,SAAS,oBAAoB,SAAS;CAK1F,IAAI,IAAI,gBAAgB,OAAO,YAAY,KAAK,KAAK,MAAM,QAAQ,KAAK;CACxE,IAAI,IAAI,oBAAoB,OAAO,YAAY,KAAK,KAAK,MAAM,aAAa,IAAI;AAElF;;;;;;;;;AAUA,eAAsB,cAAc,QAAiD;CACnF,MAAM,MAAuB;EAAE,OAAO,CAAC;EAAG,YAAY,CAAC;CAAE;CACzD,MAAM,2BAAW,IAAI,IAAkB;CACvC,KAAK,MAAM,KAAK,OAAO,OAAO,SAAS,IAAI,EAAE,MAAM,CAAC;CAEpD,IAAI,aAAa,OAAO;CACxB,OAAO,MAAM;EACX,iBAAiB,OAAO,OAAO,UAAU;EACzC,IAAI,cAAc,OAAO,WAAW,OAAO,YAAY,KAAK,IAAI,aAAa,IAAI;EACjF,MAAM,WAAW,MAAM,cAAc,QAAQ,UAAU,KAAK,UAAU;EACtE,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,cAAc;CAChB;AACF;;;;;;;;;;;;AC57BA,SAAgB,uBAA0B,MAAqC;CAC7E,MAAM,WAAsB,CAAC;CAC7B,IAAI,OAAO,KAAK,WAAW,YAAY,KAAK,OAAO,SAAS,GAC1D,SAAS,KAAK;EAAE,MAAM;EAAU,SAAS,KAAK;CAAO,CAAC;CAExD,IAAI,OAAO,KAAK,WAAW,UAAU;EACnC,SAAS,KAAK;GAAE,MAAM;GAAQ,SAAS,KAAK;EAAO,CAAC;EACpD,OAAO;CACT;CACA,KAAK,MAAM,KAAK,KAAK,QAAQ,SAAS,KAAK,EAAE,GAAG,EAAE,CAAC;CACnD,OAAO;AACT;;;;;;;;;AAUA,SAAgB,8BAA8B,UAG5C;CACA,OAAO,yBAAyB,WAAW,MAAM,EAAE,OAAO;AAC5D;AAEA,MAAM,yCAAyB,IAAI,IAAI;CAAC;CAAc;CAAgB;CAAW;AAAS,CAAC;AAC3F,MAAM,sCAAsB,IAAI,IAAI;CAAC;CAAc;CAAa;CAAa;AAAc,CAAC;;;;;AAM5F,SAAS,eAAe,KAAsB;CAC5C,MAAM,OAAO,QAAQ,IAAI,KAAK,MAAM;CACpC,OAAO,OAAO,SAAS,YAAY,uBAAuB,IAAI,IAAI;AACpE;;;;AAKA,SAAS,qBAAqB,KAAiC;CAC7D,MAAM,SAAS,QAAQ,IAAI,KAAK,YAAY;CAC5C,IAAI,OAAO,WAAW,UAAU,OAAO;CACvC,MAAM,aAAa,QAAQ,IAAI,KAAK,QAAQ;CAC5C,OAAO,OAAO,eAAe,WAAW,aAAa,KAAA;AACvD;;;;;AAMA,SAAS,mBACP,KACA,KACyB;CACzB,MAAM,UAAU,QAAQ,IAAI,KAAK,SAAS;CAC1C,IAAI,OAAO,YAAY,UAAU,IAAI,aAAa;CAClD,OAAO;AACT;;;;AAKA,SAAS,uBAAuB,KAAiC;CAC/D,MAAM,UAAU,QAAQ,IAAI,KAAK,iBAAiB;CAClD,IAAI,YAAY,QAAQ,OAAO,YAAY,UAAU,OAAO,KAAA;CAC5D,MAAM,KAAK,QAAQ,IAAI,SAAS,aAAa;CAC7C,OAAO,OAAO,OAAO,WAAW,kBAAkB,EAAE,IAAI,KAAA;AAC1D;;;;;AAMA,SAAS,oBAAoB,KAAsC;CACjE,MAAM,MAAM,mBAAmB,KAAK;EAAE,MAAM;EAAc,QAAQ;CAAI,CAAC;CACvE,MAAM,iBAAiB,uBAAuB,GAAG;CACjD,IAAI,mBAAmB,KAAA,GAAW,IAAI,oBAAoB;CAC1D,OAAO;AACT;;;;;AAMA,SAAS,uBAAuB,KAAkD;CAChF,MAAM,OAAO,QAAQ,IAAI,KAAK,MAAM;CACpC,IAAI,OAAO,SAAS,YAAY,CAAC,oBAAoB,IAAI,IAAI,GAAG,OAAO,KAAA;CACvE,OAAO,mBAAmB,KAAK,EAAE,MAAM,UAAU,CAAC;AACpD;;;;;;;;;;;;AAaA,SAAgB,wBAAwB,KAAuB;CAC7D,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU,OAAO;CACpD,IAAI,eAAe,GAAG,GAAG,OAAO;CAChC,MAAM,SAAS,qBAAqB,GAAG;CACvC,IAAI,WAAW,KAAK,OAAO,oBAAoB,GAAG;CAClD,IAAI,WAAW,KAAA,KAAa,UAAU,OAAO,SAAS,KACpD,OAAO,mBAAmB,KAAK;EAAE,MAAM;EAAgB;CAAO,CAAC;CAEjE,OAAO,uBAAuB,GAAG,KAAK;AACxC;;;;;;;;;;;AAsCA,SAAS,iBACP,YACA,iBACc;CACd,IAAI,oBAAoB,KAAA,GAEtB,OAAO;EAAE,QAAQ;EAAY,iBAAiB;EAAO,eAAe,CAAC;CAAE;CAEzE,MAAM,QAAQ,IAAI,gBAAgB;CAClC,MAAM,WAAW,YAAY,IAAI,CAAC,YAAY,MAAM,MAAM,CAAC;CAC3D,IAAI,YAAY;CAChB,MAAM,QAAQ,iBAAiB;EAC7B,YAAY;EACZ,MAAM,MAAM;CACd,GAAG,eAAe;CAClB,OAAO;EACL,QAAQ;EACR,iBAAiB;EACjB,eAAe;GACb,aAAa,KAAK;EACpB;CACF;AACF;;;;;;;;;;;;;;;;;AAkBA,SAAS,WACP,WACA,MACA,cACA,cACA,UACA,iBACqB;CACrB,OAAO,kBACL,YAAY;EACV,MAAM,WAAW,iBAAiB,KAAK,OAAO,eAAe;EAC7D,IAAI;GACF,OAAO,MAAM,UAAU,SAAS,MAAM;EACxC,SAAS,KAAc;GACrB,IAAI,eAAe,gBAAgB,MAAM;GAIzC,IAAI,KAAK,MAAM,SACb,MAAM,IAAI,cAAc,WAAW;IACjC,QAAQ,KAAK,MAAM;IACnB,YAAY,KAAK;GACnB,CAAC;GAOH,IAAI,aAAa,GAEf,MAAM,IAAI,eAAe,uBADT,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,KACJ,EACzD,YAAY,UACd,CAAC;GAKH,IAAI,SAAS,UAAU,GACrB,MAAM,IAAI,mBAAmB,mBAAmB,GAAG,KAAK,UAAU;GAIpE,IAAI,eAAe,eAAe,MAAM;GACxC,MAAM,SAAS,GAAG;EACpB,UAAU;GACR,SAAS,QAAQ;EACnB;CACF,GACA,cACA,KAAK,KACP;AACF;;;;;;;;AASA,SAAS,oBAAoB,KAAoC;CAC/D,OAAO,OAAO,SAAoD;EAChE,IAAI,iBAAiB;EACrB,MAAM,aAAa,eACjB,IAAI,YAAY;GACd,YAAY,KAAK;GACjB,UAAU,KAAK;GACf,OAAO;GACP,QAAQ,KAAK;GACb,sBAAsB;IACpB,iBAAiB;GACnB;EACF,CAAC;EAEH,OAAO,MAAM,WACX,WACA,YACM,gBACN,IAAI,cACJ,yBACA,IAAI,eACN;CACF;AACF;;;;;;;;;AAUA,SAAS,oBAAoB,KAAqC;CAChE,MAAM,WAAW,IAAI,QAAQ,kBAAkB;CAC/C,OAAO,OAAO,SAA8C;EAC1D,IAAI,iBAAiB;EACrB,MAAM,YAAY,OAAO,eAAiD;GAIxE,MAAM,sBAAsB,IAAI,gBAAgB;GAChD,MAAM,6BAAmC;IACvC,oBAAoB,MAAM,WAAW,MAAM;GAC7C;GAEA,IAAI,WAAW,SACb,oBAAoB,MAAM,WAAW,MAAM;QAG3C,WAAW,iBAAiB,SAAS,sBAAsB,EAAE,MAAM,KAAK,CAAC;GAE3E,MAAM,iBAAiB,OAAO,UAAsC;IAClE,iBAAiB;IACjB,IAAI;KACF,MAAM,IAAI,WAAW,SAAS,KAAK;IACrC,SAAS,KAAc;KACrB,oBAAoB,MAAM;KAC1B,MAAM;IACR;GACF;GACA,MAAM,EAAE,QAAQ,aAAa,8BAA8B,KAAK,QAAQ;GACxE,MAAM,MAAmB;IACvB,YAAY,KAAK;IACjB;IACA,OAAO,KAAK;IACZ,OAAO,oBAAoB;IAC3B,QAAQ,KAAK;IACb,UAAU,IAAI;IACd,QAAQ,IAAI;IACZ,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;IACzC,GAAI,IAAI,WAAW,KAAA,IAAY,EAAE,QAAQ,IAAI,OAAO,IAAI,CAAC;IACzD,GAAI,IAAI,qBAAqB,KAAA,IACzB,EAAE,kBAAkB,IAAI,iBAAiB,IACzC,CAAC;IACL,GAAI,IAAI,gBAAgB,KAAA,IAAY,EAAE,aAAa,IAAI,YAAY,IAAI,CAAC;IACxE,GAAI,IAAI,eAAe,KAAA,IAAY,EAAE,YAAY,IAAI,WAAW,IAAI,CAAC;IACrE,GAAI,IAAI,UAAU,KAAA,IAAY,EAAE,OAAO,IAAI,MAAM,IAAI,CAAC;IACtD,GAAI,KAAK,SAAS,EAAE,eAAe,IAAI,CAAC;GAC1C;GACA,IAAI;IACF,OAAO,MAAM,IAAI,QAAQ,YAAY,GAAG;GAC1C,UAAU;IAMR,WAAW,oBAAoB,SAAS,oBAAoB;GAC9D;EACF;EAEA,OAAO,MAAM,WACX,WACA,YACM,gBACN,IAAI,cACJ,UACA,IAAI,eACN;CACF;AACF;;;;;AAMA,SAAS,iBACP,SACA,QACQ;CACR,MAAM,gBACJ,OAAO,SAAS,SAAS,IAAI,CAAC,GAAG,OAAO,SAAS,KAAK,CAAC,CAAC,CAAC,KAAK,KAAA;CAChE,OAAO,QAAQ,YAAY,OAAO,oBAAoB,iBAAiB;AACzE;;;;;;;;;;AAWA,SAAS,eACP,SACA,QACqD;CACrD,MAAM,iBAAiB,QAAQ,SAAS,OAAO;CAC/C,IAAI,mBAAmB,KAAA,GAAW,MAAM,IAAI,qBAAqB;CACjE,MAAM,oBAAoB,iBAAiB,SAAS,MAAM;CAE1D,MAAM,0BAA0B,uBAC9B,OAAO,0BACP,QAAQ,gBACV;CAEA,MAAM,OAA2B;EAC/B,GAAG;EACH,OAAO;EACP,UAAU;CACZ;CACA,IAAI,QAAQ,WAAW,KAAA,KAAa,OAAO,mBAAmB,KAAA,GAC5D,KAAK,SAAS,OAAO;CAEvB,IAAI,4BAA4B,KAAA,GAC9B,KAAK,mBAAmB;CAE1B,OAAO;EACL;EACA,QAAQ;GAAE,UAAU;GAAmB,UAAU;EAAe;CAClE;AACF;;;;;;AAOA,SAAS,oBACP,SACA,UACA,MACA,YACA,mBACM;CACN,IAAI,KAAK,WAAW,KAAA,KAAa,CAAC,QAAQ,SAAS,QAAQ,GACzD,MAAM,IAAI,0BAA0B,UAAU,QAAQ;CAExD,IAAI,WAAW,SAAS,KAAK,CAAC,QAAQ,SAAS,OAAO,GACpD,MAAM,IAAI,0BAA0B,UAAU,OAAO;CAEvD,IAAI,qBAAqB,CAAC,QAAQ,SAAS,WAAW,GACpD,MAAM,IAAI,0BAA0B,UAAU,WAAW;AAE7D;;;;;;AAaA,SAAS,oBACP,MACA,QACY;CACZ,MAAM,SAAsB,KAAK,UAAU,OAAO;CAClD,MAAM,eAAe,KAAK,SAAS,OAAO;CAC1C,MAAM,kBAAkB,KAAK,mBAAmB,OAAO;CACvD,IAAI,oBAAoB,KAAA,KAAa,mBAAmB,GAGtD,MAAM,IAAI,oBAAoB,6BAA6B;CAE7D,OAAO;EAAE;EAAQ;EAAc;CAAgB;AACjD;;;;;;AAeA,SAAS,uBACP,MACA,QACmC;CACnC,MAAM,4BACJ,KAAK,6BAA6B,OAAO,qCAAqC;CAChF,IAAI,4BAA4B,GAC9B,MAAM,IAAI,oBAAoB,wCAAwC;CAExE,OAAO,4BAA4B,IAC/B,EAAE,WAAW,0BAA0B,IACvC,KAAA;AACN;;;;;AAMA,SAAS,oBACP,MACA,QACY;CACZ,MAAM,YAAY,KAAK,aAAa,OAAO;CAC3C,MAAM,oBAEJ,KAAK,qBAAqB,OAAO,6BAA6B;CAChE,MAAM,yBACJ,KAAK,0BAA0B,OAAO,kCAAkC;CAC1E,MAAM,iBAAiB,uBAAuB,MAAM,MAAM;CAC1D,MAAM,0BACJ,KAAK,2BAA2B,OAAO;CACzC,IAAI,4BAA4B,KAAA,KAAa,0BAA0B,GAGrE,MAAM,IAAI,oBAAoB,sCAAsC;CAEtE,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;AAoBA,eAAe,uBACb,KACqB;CACrB,MAAM,EAAE,SAAS,MAAM,WAAW;CAClC,MAAM,qBAAqB,QAAQ,iBAAiB,MAAM;CAE1D,IAAI,WAAW,UAAU,mBAAmB,gBAC1C,sBAAsB,IAAI,YAAY,IAAI,OAAO,QAAQ;CAM3D,MAAM,4BAA4B,uBAChC,mBAAmB,kBACnB,KAAK,gBACP;CACA,MAAM,mBACJ,8BAA8B,KAAA,KAC9B,OAAO,KAAK,yBAAyB,CAAC,CAAC,SAAS,IAC5C,4BACA,KAAA;CAcN,IAAI;CACJ,IAAI;EACF,oBAAoB,MAAM,OAAO;CACnC,SAAS,KAAc;EACrB,MAAM,mBAAmB,MAAM,GAAG;CACpC;CACA,MAAM,EAAE,uBAAuB;CAC/B,OAAO,oBAAoB;EACzB,aAAa,mBAAmB;GAC9B;GACA,UAAU,IAAI,OAAO;GACrB,YAAY,IAAI;GAChB,OAAO,IAAI;GACX,QAAQ,KAAK;GAIK;GAClB,aAAa,KAAK;GAClB,YAAY,KAAK;GACjB,OAAO,KAAK;GACZ,WAAW,IAAI;EACjB,CAAC;EACD,cAAc,IAAI;EAClB,iBAAiB,IAAI;CACvB,CAAC;AACH;;;;;;;AAQA,SAAS,sBAAyB,MAAqC;CACrE,MAAM,gBACJ,KAAK,WAAW,KAAA,IACZ,gJACA,KAAA;CACN,MAAM,mBAAmB,uBAAuB,IAAI;CACpD,IAAI,kBAAkB,KAAA,GAAW;EAC/B,MAAM,MAAM,iBAAiB,WAAW,MAAM,EAAE,SAAS,QAAQ;EACjE,IAAI,OAAO,GAAG;GACZ,MAAM,MAAM,iBAAiB;GAE7B,IAAI,KAAK,SAAS,UAChB,iBAAiB,OAAO;IACtB,MAAM;IACN,SAAS,GAAG,IAAI,QAAQ,MAAM;GAChC;EAEJ,OACE,iBAAiB,QAAQ;GAAE,MAAM;GAAU,SAAS;EAAc,CAAC;CAEvE;CACA,OAAO;AACT;;;;;;;;;AAuBA,SAAS,kBACP,KAC0C;CAC1C,MAAM,EAAE,MAAM,QAAQ,WAAW;CACjC,MAAM,QAAQ,KAAK,SAAS,IAAI,gBAAgB,CAAC,CAAC;CAClD,MAAM,wBAA6C;EACjD,OAAO,IAAI,QAAQ,YAAY,OAAO,UAAU,OAAO,QAAQ;CACjE;CACA,MAAM,iBACJ,IAAI,oBACA,OAAO,UAAsC;EAC3C,MAAM,IAAI,WAAW,SAAS,KAAK;CACrC,IACA,KAAA;CACN,OAAO;EACL,aAAa,IAAI;EACjB,UAAU,IAAI;EACd,OAAO,IAAI;EACX,WAAW,OAAO;EAClB,mBAAmB,OAAO;EAC1B;EACA,kBAAkB,KAAK;EACvB,YAAY,IAAI;EAChB,QAAQ,IAAI;EACZ;EACA,UAAU,OAAO;EACjB,UAAU,OAAO;EACjB;EACA,eAAe,6BAA6B,IAAI,UAAU;EAC1D,GAAI,OAAO,mBAAmB,KAAA,IAC1B,EAAE,gBAAgB,OAAO,eAAe,IACxC,CAAC;EACL,GAAI,OAAO,4BAA4B,KAAA,IACnC,EAAE,yBAAyB,OAAO,wBAAwB,IAC1D,CAAC;EACL,GAAI,KAAK,iBAAiB,KAAA,IAAY,EAAE,cAAc,KAAK,aAAa,IAAI,CAAC;CAC/E;AACF;;;;;;;;;AAsBA,eAAe,kBACb,KAC+B;CAC/B,MAAM,QAAQ,MAAM,kBAAkB,IAAI,QAAQ,IAAI,IAAI;CAC1D,IAAI,MAAM,IAAI,OAAO,EAAE,QAAQ,EAAE,OAAO,MAAM,MAAM,EAAE;CACtD,gCAAgC,IAAI,YAAY;EAC9C,SAAS,IAAI;EACb,eAAe,qBAAqB,MAAM,MAAM;EAChD,UAAU,IAAI;CAChB,CAAC;CACD,IAAI,CAAC,IAAI,YAAY,wBAAwB,MAAM,QAAQ,IAAI,IAAI;CACnE,OAAO,EAAE,gBAAgB,qBAAqB,MAAM,MAAM,EAAE;AAC9D;;;;;;;;;;;;;AA4BA,eAAe,kBACb,KACiC;CACjC,MAAM,EAAE,MAAM,WAAW;CACzB,MAAM,cAA0C,CAAC;CACjD,MAAM,mBAAoD,CAAC;CAE3D,IAAI,OAAO;CAEX,IAAI,gBAA8B;CAClC,IAAI,mBAAmB,IAAI;CAI3B,IAAI;CAEJ,OAAO,MAAM;EACX,MAAM,cAAc,MAAM,cAAc;GACtC,GAAG;GACH,kBAAkB,YAAY;EAChC,CAAC;EACD,KAAK,MAAM,KAAK,YAAY,OAAO,YAAY,KAAK,CAAC;EACrD,KAAK,MAAM,MAAM,YAAY,YAAY,iBAAiB,KAAK,EAAE;EACjE,OAAO,YAAY;EACnB,gBAAgB,YAAY;EAE5B,IAAI,WAAW,KAAA,GAAW;EAC1B,IAAI,kBAAkB,QACpB,MAAM,IAAI,4BACR,eACA,MACA,uBAAuB,WAAW,CACpC;EAEF,MAAM,cAAc,MAAM,kBAAqB;GAC7C;GACA;GACA,YAAY,KAAK;GACjB,SAAS,qBAAqB,IAAI,yBAAyB,YAAY;GACvE,YAAY,mBAAmB,KAAK,YAAY,SAAS,KAAK;EAChE,CAAC;EACD,IAAI,YAAY,aAAa;GAC3B,iBAAiB,YAAY;GAC7B;EACF;EACA,oBAAoB;EACpB,KAAK,SAAS,KAAK,YAAY,cAAc;CAC/C;CAEA,OAAO;EACL,OAAO;EACP,YAAY;EACZ;EACA;EACA;CACF;AACF;;;;;;;AAQA,SAAS,gBACP,SACA,QACmB;CACnB,MAAM,mBAAmB,UAAU,QAAQ,KAAK;CAChD,MAAM,kBAAkB,eAAe,QAAQ,OAAO,OAAO,QAAQ;CAErE,IAAI;CACJ,IAAI,QAAQ,mBAAmB,KAAA,GAC7B,gBAAgB,QAAQ,eAAe;MAMvC,gBAAgB,QAAQ;CAG1B,MAAM,SAA4B;EAChC,SAAS;EACT,YAAY,QAAQ;EACpB,OAAO,QAAQ;EACf,OAAO;EACP,eAAe,QAAQ;EACvB,gBAAgB;GAAE,UAAU,OAAO;GAAU,UAAU,OAAO;EAAS;CACzE;CACA,IAAI,oBAAoB,KAAA,GAAW,OAAO,OAAO;CACjD,MAAM,sBAAsB,uBAAuB,QAAQ,KAAK;CAChE,IAAI,wBAAwB,KAAA,GAAW,OAAO,oBAAoB;CAClE,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;AAsBA,eAAsB,SACpB,SACA,QAC4B;CAC5B,IAAI,QAAQ,OAAO,YAAY,MAC7B,MAAM,IAAI,cAAc,WAAW,EAAE,QAAQ,QAAQ,MAAM,OAAO,CAAC;CAGrE,MAAM,EAAE,MAAM,WAAW,eAAe,SAAS,MAAM;CAEvD,MAAM,UAAU,OAAO,SAAS,IAAI,OAAO,QAAQ;CACnD,IAAI,YAAY,KAAA,GACd,MAAM,IAAI,8BAA8B,OAAO,QAAQ;CAGzD,IAAI,QAAQ,SAAS,YACnB,OAAO,QAAQ,SAAY,MAAM,MAAM;CAMzC,MAAM,aAAa,gBAAgB,KAAK,UAAU;CAClD,MAAM,oBAAoB,KAAK,aAAa,KAAA;CAC5C,MAAM,aAAkC,KAAK,SAAS,CAAC;CAEvD,oBAAoB,SAAS,OAAO,UAAU,MAAM,YAAY,iBAAiB;CAEjF,MAAM,OAAO,oBAAoB,MAAM,MAAM;CAC7C,MAAM,aAAa,wBAAwB,KAAK,QAAQ;CAExD,IAAI;CACJ,IAAI,QAAQ,SAAS,UACnB,cAAc,MAAM,uBAAuB;EACzC;EACA;EACA;EACA,QAAQ,KAAK;EACb,cAAc,KAAK;EACnB,iBAAiB,KAAK;EACtB;EACA;EACA;EACA,WAAW,OAAO;CACpB,CAAC;MAKD,cAAc,oBAAoB;EAChC;EACA,UAAU,OAAO;EACjB,cAAc,KAAK;EACnB,iBAAiB,KAAK;EACtB;EACA,QAAQ,KAAK;EACb,QAAQ,KAAK;EAIb,kBAAkB,KAAK;EACvB,aAAa,KAAK;EAClB,YAAY,KAAK;EACjB,OAAO,KAAK;CACd,CAAC;CAGH,MAAM,SAAS,oBAAoB,MAAM,MAAM;CAC/C,MAAM,mBAAmB,sBAAsB,IAAI;CAEnD,MAAM,gBAAgB,oBAAoB,YAAY;EACpD,OAAO,OAAO;EACd,UAAU,OAAO;EACjB,UAAU,OAAO;EACjB,WAAW,WAAW,SAAS;EAC/B,YAAY,KAAK,WAAW,KAAA;EAC5B,WAAW;CACb,CAAC;CAED,MAAM,OAAO,kBAAkB;EAC7B;EACA;EACA,SAAS,OAAO;EAChB;EACA,UAAU,CAAC,GAAG,gBAAgB;EAC9B;EACA;EACA;EACA;EACA;CACF,CAAC;CAED,IAAI;EACF,MAAM,UAAU,MAAM,kBAAqB;GACzC;GACA,QAAQ,KAAK;GACb,wBAAwB,OAAO;EACjC,CAAC;EACD,MAAM,SAAS,gBAAgB,SAAS,MAAM;EAE9C,IAAI,mBACF,MAAM,WAAW,SAAS;GACxB,MAAM;GACN,eAAe,QAAQ;GACvB,OAAO,OAAO;EAChB,CAAC;EAGH,kBAAkB,YAAY,eAAe;GAC3C,OAAO,OAAO;GACd,eAAe,QAAQ;GACvB,gBAAgB,OAAO;EACzB,CAAC;EACD,OAAO;CACT,SAAS,KAAc;EAErB,kBAAkB,YAAY,eAAe,EAAE,OAD/B,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,EACD,CAAC;EAC/D,MAAM;CACR;AACF;;;;AAKA,SAAgB,OAAO,GAAmB;CACxC,OAAO,KAAK,MAAM,IAAI,GAAG,IAAI;AAC/B;;;;;;;;;;;AAYA,SAAgB,uBACd,OACqC;CACrC,OAAO,MAAM,UAAU,MAAM,EAAE,sBAAsB,KAAA,CAAS,CAAC,EAAE;AACnE;;;;;;AAyBA,SAAS,eACP,OACiB;CACjB,MAAM,MAAuB;EAC3B,aAAa;EACb,OAAO;EACP,OAAO;EACP,QAAQ;EACR,gBAAgB;EAChB,QAAQ;EACR,qBAAqB;EACrB,aAAa;EACb,mBAAmB;EACnB,WAAW;CACb;CACA,KAAK,MAAM,KAAK,OAAO;EACrB,IAAI,EAAE,SAAS,KAAA,GAAW;EAC1B,IAAI,cAAc;EAClB,IAAI,SAAS,EAAE,KAAK;EACpB,IAAI,SAAS,EAAE,KAAK;EACpB,IAAI,UAAU,EAAE,KAAK;EACrB,IAAI,EAAE,KAAK,qBAAqB,KAAA,GAAW;GACzC,IAAI,iBAAiB;GACrB,IAAI,UAAU,EAAE,KAAK;EACvB;EACA,IAAI,EAAE,KAAK,oBAAoB,KAAA,GAAW;GACxC,IAAI,sBAAsB;GAC1B,IAAI,eAAe,EAAE,KAAK;EAC5B;EACA,IAAI,EAAE,KAAK,kBAAkB,KAAA,GAAW;GACtC,IAAI,oBAAoB;GACxB,IAAI,aAAa,EAAE,KAAK;EAC1B;CACF;CACA,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,eACd,OACA,UAC2B;CAC3B,MAAM,MAAM,eAAe,KAAK;CAChC,IAAI,CAAC,IAAI,aAAa;EACpB,IAAI,eAAe,IAAI,QAAQ,KAAK,MAAM,SAAS,GACjD,OAAO;GACL,WAAW;GACX,WAAW;GACX,YAAY;GACZ,UAAU;GACV,aAAa;EACf;EAEF;CACF;CACA,MAAM,MAAqB;EACzB,WAAW,OAAO,IAAI,KAAK;EAC3B,WAAW,OAAO,IAAI,KAAK;EAC3B,YAAY,OAAO,IAAI,MAAM;EAC7B,UAAU;EACV,aAAa;CACf;CACA,IAAI,IAAI,gBAAgB,IAAI,mBAAmB,OAAO,IAAI,MAAM;CAChE,IAAI,IAAI,qBAAqB,IAAI,kBAAkB,OAAO,IAAI,WAAW;CACzE,IAAI,IAAI,mBAAmB,IAAI,gBAAgB,OAAO,IAAI,SAAS;CACnE,OAAO;AACT;;;;;;;;;;;;;ACxpCA,SAAS,wBACP,WACA,kBAC8B;CAC9B,IAAI,qBAAqB,KAAA,GAAW;EAClC,MAAM,WAAW,IAAI,IAAI,uBAAuB,CAAC;EACjD,KAAK,MAAM,QAAQ,OAAO,KAAK,gBAAgB,GAC7C,IAAI,SAAS,IAAI,IAAI,GACnB,MAAM,IAAI,oBACR,uDAAuD,KAAK,IAC5D,IACF;CAGN;CACA,MAAM,2BAAW,IAAI,IAA6B;CAClD,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,SAAS,GAAG;EACpD,IAAI,SAAS,KAAA,GAAW;EAMxB,MAAM,YAJJ,qBAAqB,KAAA,KAAa,OAAO,OAAO,kBAAkB,IAAI,IAClE,iBAAiB,QACjB,KAAA,MACoB,qBAAqB,IAAI,EAAA,CAC3B,IAAI;EAC5B,SAAS,IAAI,MAAM,OAAO;CAC5B;CACA,OAAO;AACT;;;;;;;;AAeA,SAAS,cAAc,WAA6D;CAClF,MAAM,UAAmC,EAAE,GAAG,gBAAgB;CAC9D,IAAI,cAAc,KAAA,GAChB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,SAAS,GACjD,QAAQ,OAAO;CAGnB,OAAO;AACT;;;;;;;;;AAUA,SAAS,wBACP,QACiF;CACjF,MAAM,WAA2B,OAAO,YAAY,CAAC;CACrD,OAAO;EACL,eAAe,SAAS,gBAAgB,OAAO,iBAAiB;EAChE,gBAAgB,SAAS,UAAU,OAAO,kBAAkB;EAC5D,mBAAmB,SAAS,aAAa,OAAO,qBAAqB;CACvE;AACF;;;;;;AAOA,SAAS,0BAA0B,UAA4C;CAC7E,IAAI,aAAa,KAAA,GAAW;CAC5B,MAAM,EAAE,2BAA2B,yBAAyB,oBAAoB;CAChF,IAAI,8BAA8B,KAAA,KAAa,4BAA4B,GACzE,MAAM,IAAI,oBAAoB,iDAAiD;CAEjF,IAAI,4BAA4B,KAAA,KAAa,0BAA0B,GACrE,MAAM,IAAI,oBAAoB,+CAA+C;CAE/E,IAAI,oBAAoB,KAAA,KAAa,mBAAmB,GACtD,MAAM,IAAI,oBAAoB,sCAAsC;AAExE;;;;;AAMA,SAASC,oBAAwC,QAAW,KAAQ,OAAmB;CACrF,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO;AACzC;;;;;;;;;AAUA,SAAS,gBACP,MAIA,UACiB;CACjB,MAAM,YAAuC;EAC3C,SAAS,KAAK;EACd,UAAU,KAAK;EACf,eAAe,KAAK;EACpB,gBAAgB,KAAK;EACrB,mBAAmB,KAAK;CAC1B;CACA,IAAI,aAAa,KAAA,GAAW;EAC1B,oBAAkB,WAAW,iBAAiB,SAAS,KAAK;EAC5D,oBAAkB,WAAW,oBAAoB,SAAS,QAAQ;EAClE,oBAAkB,WAAW,kBAAkB,SAAS,MAAM;EAC9D,oBAAkB,WAAW,6BAA6B,SAAS,iBAAiB;EACpF,oBAAkB,WAAW,kCAAkC,SAAS,sBAAsB;EAC9F,oBACE,WACA,qCACA,SAAS,yBACX;EACA,oBAAkB,WAAW,mCAAmC,SAAS,uBAAuB;EAChG,oBAAkB,WAAW,2BAA2B,SAAS,eAAe;EAChF,oBAAkB,WAAW,4BAA4B,SAAS,gBAAgB;EAClF,oBAAkB,WAAW,4BAA4B,SAAS,gBAAgB;CACpF;CACA,OAAO;AACT;;;;;;;;AASA,SAAgB,cAAc,QAA8B;CAC1D,IAAI,OAAO,cAAc,QAAQ,OAAO,OAAO,cAAc,UAC3D,MAAM,IAAI,oBAAoB,oCAAoC;CAGpE,MAAM,WAAW,wBAAwB,OAAO,WAAW,OAAO,gBAAgB;CAClF,MAAM,UAAU,cAAc,OAAO,OAAO;CAC5C,MAAM,EAAE,eAAe,gBAAgB,sBAAsB,wBAAwB,MAAM;CAC3F,0BAA0B,OAAO,QAAQ;CAEzC,MAAM,sBACJ,gBACE;EAAE;EAAS;EAAU;EAAe;EAAgB;CAAkB,GACtE,OAAO,QACT;CAEF,IAAI,WAAW;CACf,IAAI;CAyEJ,OAAO;EAtEL,SAAqB,MAAsD;GACzE,IAAI,UAAU,MAAM,IAAI,sBAAsB;GAC9C,OAAO,SAAY,MAAM,cAAc,CAAC;EAC1C;EACA,eAAe,UAAkB,UAAkB,OAAsB;GACvE,QAAQ,YAAY,UAAU,QAAQ,KAAK;EAC7C;EACA,cAAc,UAAkB,UAAuC;GACrE,OAAO,QAAQ,YAAY,UAAU,QAAQ;EAC/C;EACA,cAA4B;GAG1B,OAAO,EAAE,GAAG,QAAQ;EACtB;EACA,eACE,WACA,kBACQ;GAsBR,MAAM,gBACJ,OAAO,qBAAqB,KAAA,KAAa,qBAAqB,KAAA,IAC1D;IAAE,GAAG,OAAO;IAAkB,GAAG;GAAiB,IAClD,KAAA;GACN,OAAO,cAAc;IACnB,GAAG;IACH,WAAW;KAAE,GAAG,OAAO;KAAW,GAAG;IAAU;IAC/C,GAAI,kBAAkB,KAAA,IAAY,EAAE,kBAAkB,cAAc,IAAI,CAAC;GAC3E,CAAC;EACH;EACA,UAAyB;GACvB,IAAI,oBAAoB,KAAA,GAAW,OAAO;GAC1C,WAAW;GAKX,MAAM,QAAyB,CAAC;GAChC,KAAK,MAAM,WAAW,SAAS,OAAO,GAGpC,IAAI,aAAa,WAAW,QAAQ,YAAY,KAAA,GAC9C,MAAM,KAAK,QAAQ,QAAQ,CAAC;GAGhC,kBAAkB,QAAQ,IAAI,KAAK,CAAC,CAAC,WAAW,KAAA,CAAS;GACzD,OAAO;EACT;CAGU;AACd;;;;;;;;;;;;;;;;;;;;;;;;;ACzMA,SAAS,kBACP,OACA,aACkB;CAClB,MAAM,QAAkB,gBAAgB,KAAA,IAAY,CAAC,WAAW,IAAI,CAAC;CACrE,OAAO;EACL,SAAS,UAAU;GACjB,MAAM,OAAO,KAAK;EACpB;EACA,aAAa,MAAM,SAAS;GAC1B,MAAM,aAAa,SAAS,KAAA,KAAa,oBAAoB;GAC7D,MAAM,SAAS,MAAM,SAAS,IAAI,MAAM,MAAM,SAAS,KAAK,KAAA;GAC5D,MAAM,YACJ,cAAc,WAAW,KAAA,IAAY,OAAO;IAAE,GAAG;IAAM,gBAAgB;GAAO;GAChF,MAAM,KAAK,MAAM,WAAW,MAAM,SAAS;GAC3C,MAAM,KAAK,EAAE;GACb,OAAO;EACT;EACA,WAAW,IAAI,SAAS;GACtB,MAAM,SAAS,IAAI,IAAI;GACvB,MAAM,MAAM,MAAM,YAAY,EAAE;GAChC,IAAI,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;EACrC;CACF;AACF;;;;;;;AAQA,SAAS,iBAAiB,OAMf;CACT,MAAM,UAAU,KAAK,UAAU;EAC7B,OAAO,MAAM,SAAS;EACtB,UAAU,MAAM,YAAY;EAC5B,QAAQ,MAAM,UAAU;EACxB,WAAW,MAAM;EACjB,YAAY,MAAM;CACpB,CAAC;CACD,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;AACtE;;;;;AAMA,SAAS,kBAAwC,QAAW,KAAQ,OAAmB;CACrF,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO;AACzC;;;;;;;AAQA,SAAS,uBACP,KACA,QACA,KACoB;CACpB,MAAM,OAA2B;EAC/B;EACA,OAAO,IAAI;EACX,YAAY,kBAAkB,IAAI,YAAY,IAAI,cAAc;CAClE;CACA,kBAAkB,MAAM,SAAS,IAAI,KAAK;CAC1C,kBAAkB,MAAM,YAAY,IAAI,QAAQ;CAChD,kBAAkB,MAAM,UAAU,IAAI,MAAM;CAC5C,IAAI,IAAI,UAAU,KAAA,GAAW,KAAK,QAAQ,CAAC,GAAG,IAAI,KAAK;CACvD,kBAAkB,MAAM,UAAU,IAAI,MAAM;CAC5C,kBAAkB,MAAM,UAAU,IAAI,MAAM;CAC5C,kBAAkB,MAAM,aAAa,IAAI,SAAS;CAClD,kBAAkB,MAAM,oBAAoB,IAAI,gBAAgB;CAChE,IAAI,IAAI,iBAAiB,KAAA,GAAW,KAAK,QAAQ,IAAI;CACrD,kBAAkB,MAAM,qBAAqB,IAAI,iBAAiB;CAClE,kBAAkB,MAAM,0BAA0B,IAAI,sBAAsB;CAC5E,kBAAkB,MAAM,6BAA6B,IAAI,yBAAyB;CAClF,kBAAkB,MAAM,2BAA2B,IAAI,uBAAuB;CAC9E,kBAAkB,MAAM,oBAAoB,IAAI,gBAAgB;CAChE,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,WACd,KACiC;CACjC,MAAM,YAAY,QAAQ,IAAI,SAAS,IAAI,MAAM,SAAS,CAAC;CAC3D,MAAM,aAAa,IAAI,WAAW,KAAA;CAIlC,MAAM,UAAU,IAAI,aAAa,MAAyB;CAC1D,MAAM,UACJ,IAAI,MACJ,cAAc,iBAAiB;EAC7B,OAAO,IAAI;EACX,UAAU,IAAI;EACd,QAAQ,IAAI;EACZ;EACA;CACF,CAAC;CAEH,MAAM,kBAQF;EACF;EACA;EACA,aAAa,IAAI,YAAY,KAAA;CAC/B;CACA,IAAI,IAAI,UAAU,KAAA,GAAW,gBAAgB,QAAQ,IAAI;CACzD,IAAI,IAAI,aAAa,KAAA,GAAW,gBAAgB,WAAW,IAAI;CAC/D,IAAI,IAAI,WAAW,KAAA,GAAW,gBAAgB,SAAS,IAAI;CAC3D,IAAI,IAAI,WAAW,KAAA,GAAW,gBAAgB,SAAS,IAAI;CAE3D,MAAM,QAAQ,KAAgC,SAAS,OAAO,OAAO,QAAQ;EAC3E,IAAI,IAAI,MAAM,SACZ,MAAM,IAAI,cAAc,6BAA6B;GACnD,QAAQ,EAAE,QAAQ,QAAQ;GAC1B,YAAY;EACd,CAAC;EAQH,MAAM,OAAO,uBAAuB,KAJlC,OAAO,UAAU,WACb,CAAC;GAAE,MAAM;GAAQ,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM;GAAM,CAAC;EAAE,CAAC,IAC3D,CAAC,GAAG,KAAK,GAEkC,GAAG;EAEpD,IAAI,IAAI,WACN,KAAK,YAAY,UAAU;GAKzB,IAAI,WAAW,OAAO;IAAE,MAAM;IAAe;IAAS;GAAM,CAAC;EAC/D;EAGF,OAAO,QAAQ,MAAM,IAAI,OAAO,SAAS,IAAI,CAAC;CAChD,CAAC;CAED,OAAO;EACL,IAAI,MAAM;EACV,MAAM,MAAM;EACZ,MAAM,OAAO,QAAQ,MAAM,IAAI,OAAO,GAAG;EACzC,QAAQ,OAAO,OAAO,EAAE,GAAG,gBAAgB,CAAC;CAC9C;AACF;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACd,KACyB;CACzB,OAAO,WAAiB;EAAE,GAAG;EAAK,UAAU,MAAM,EAAE;CAAQ,CAAC;AAC/D;;;;;;;;;;;ACpQA,MAAM,gBAAgB;CAAC;CAAQ;CAAQ;CAAS;CAAQ;CAAW;CAAQ;AAAQ;;;;;;;;;;;;AAanF,SAAgB,uBAA+C;CAC7D,MAAM,MAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,eAAe;EAC/B,MAAM,IAAI,QAAQ,IAAI;EACtB,IAAI,OAAO,MAAM,UAAU,IAAI,OAAO;CACxC;CACA,OAAO;AACT;;;;;;;;;;;;ACWA,SAAgB,mBAAmB,SAA0C;CAG3E,MAAM,MAAM,KAAK,IAAI,GAAG,QAAQ,SAAS,CAAC;CAC1C,MAAM,OAAyB,CAAC;CAChC,MAAM,8BAAc,IAAI,IAAgB;CACxC,IAAI,UAAU;CAEd,MAAM,QAAQ,UAAiD;EAC7D,MAAM,QAAwB;GAAE,IAAI;GAAW;EAAM;EACrD,KAAK,KAAK,KAAK;EACf,IAAI,KAAK,SAAS,KAAK,KAAK,OAAO,GAAG,KAAK,SAAS,GAAG;EAGvD,KAAK,MAAM,MAAM,MAAM,KAAK,WAAW,GACrC,IAAI;GACF,GAAG,KAAK;EACV,SAAS,KAAK;GACZ,YAAY,OAAO,EAAE;GACrB,IAAI,QAAQ,qBAAqB,QAAQ,oBAAoB,GAAG;EAClE;EAEF,OAAO;CACT;CAEA,MAAM,aAAa,OAAiC;EAClD,YAAY,IAAI,EAAE;EAClB,aAAa;GAAE,YAAY,OAAO,EAAE;EAAE;CACxC;CAEA,MAAM,iBAA4C,CAAC,GAAG,IAAI;CAE1D,MAAM,kBAAkB,YACtB,KAAK,QAAQ,MAAM,EAAE,KAAK,OAAO;CAEnC,MAAM,aAAqB,KAAK;CAEhC,OAAO;EAAE;EAAM;EAAW;EAAU;EAAgB;CAAK;AAC3D;;;;;;;;;;;;;;;;;ACvDA,MAAM,mBAAmB;AAEzB,MAAM,cAAc,QADP,QAAQ,cAAc,OAAO,KAAK,GAAG,CACnB,GAAG,UAAU,aAAa;;;;;;;;AAqBzD,SAAgB,aAAa,SAA+C;CAC1E,MAAM,EAAE,aAAa,MAAM,MAAM,mBAAmB;CAEpD,MAAM,WAAW,KAAsB,QAA8B;EACnE,MAAM,QAAQ,cAAc,KAAK,MAAM,IAAI;EAE3C,IAAI,UAAU,WAAW,UAAU,mBAAmB;GACpD,kBAAkB,GAAG;GACrB;EACF;EACA,IAAI,UAAU,mBAAmB;GAC/B,UAAU,KAAK,KAAK,EAAE,IAAI,KAAK,CAAC;GAChC;EACF;EACA,IAAI,UAAU,qBAAqB;GACjC,UAAU,KAAK,KAAK,EAAE,QAAQ,YAAY,SAAS,EAAE,CAAC;GACtD;EACF;EACA,IAAI,UAAU,mBAAmB;GAC/B,WAAW,KAAK,KAAK,WAAW;GAChC;EACF;EACA,IAAI,UAAU,oBAAoB;GAChC,cAAc,KAAK,KAAK,aAAa,cAAc;GACnD;EACF;EACA,IAAI,aAAa;EACjB,IAAI,UAAU,gBAAgB,kBAAkB;EAChD,IAAI,IAAI,KAAK,UAAU;GAAE,OAAO;GAAa;EAAM,CAAC,CAAC;CACvD;CAEA,MAAM,cAAc,aAAa,OAAO;CAExC,OAAO,IAAI,SAAS,QAAQ,YAAY;EAGtC,YAAY,KAAK,SAAS,OAAO;EACjC,YAAY,OAAO,MAAM,YAAY;GACnC,YAAY,eAAe,SAAS,OAAO;GAI3C,MAAM,OAAO,YAAY,QAAQ;GACjC,MAAM,aACJ,SAAS,QAAQ,OAAO,SAAS,YAAY,UAAU,OAAO,KAAK,OAAO;GAE5E,OAAO;IACL,KAAA,UAFoB,KAAK,GAAG;IAG5B,aAAa,aAAa,WAAW;GACvC,CAAC;EACH,CAAC;CACH,CAAC;AACH;;;;;;;;AASA,SAAgB,cACd,KAKA,MACA,MACQ;CACR,MAAM,MAAM,IAAI,IAAI,IAAI,OAAO,KAAK,UAAU,IAAI,QAAQ,QAAQ,GAAG,KAAK,GAAG,QAAQ;CACrF,OAAO,GAAG,IAAI,UAAU,MAAM,GAAG,IAAI;AACvC;;;;AAKA,SAAS,aAAa,QAA+B;CACnD,OAAO,IAAI,SAAS,QAAQ,YAAY;EACtC,OAAO,OAAO,QAAQ;GACpB,IAAI,KAAK,QAAQ,GAAG;QACf,OAAO;EACd,CAAC;EAID,OAAO,sBAAsB;CAC/B,CAAC;AACH;;;;AAKA,SAAS,UAAU,KAAqB,QAAgB,MAAqB;CAC3E,IAAI,aAAa;CACjB,IAAI,UAAU,gBAAgB,kBAAkB;CAChD,IAAI,IAAI,KAAK,UAAU,IAAI,CAAC;AAC9B;;;;AAKA,SAAS,kBAAkB,KAA2B;CACpD,IAAI;CACJ,IAAI;EAGF,OAAO,SAAS,WAAW,CAAC,CAAC;CAC/B,QAAQ;EACN,IAAI,aAAa;EACjB,IAAI,UAAU,gBAAgB,YAAY;EAC1C,IAAI,IAAI,qBAAqB;EAC7B;CACF;CACA,IAAI,aAAa;CACjB,IAAI,UAAU,gBAAgB,0BAA0B;CACxD,IAAI,UAAU,iBAAiB,UAAU;CACzC,IAAI,UAAU,kBAAkB,OAAO,IAAI,CAAC;CAC5C,iBAAiB,WAAW,CAAC,CAAC,KAAK,GAAG;AACxC;;;;;;;;AASA,SAAS,WAAW,KAAsB,KAAqB,aAAgC;CAC7F,IAAI,aAAa;CACjB,IAAI,UAAU,gBAAgB,mBAAmB;CACjD,IAAI,UAAU,iBAAiB,UAAU;CACzC,IAAI,UAAU,cAAc,YAAY;CAGxC,IAAI,UAAU,qBAAqB,IAAI;CAKvC,MAAM,gBAAgB,oBAAoB,IAAI,QAAQ,gBAAgB;CACtE,KAAK,MAAM,SAAS,YAAY,eAAe,aAAa,GAC1D,YAAY,KAAK,MAAM,IAAI,MAAM,KAAK;CAKxC,MAAM,YAAY,kBAAkB;EAClC,IAAI,MAAM,iBAAiB;CAC7B,GAAG,gBAAgB;CAEnB,MAAM,cAAc,YAAY,WAAW,UAAU;EACnD,YAAY,KAAK,MAAM,IAAI,MAAM,KAAK;CACxC,CAAC;CAED,MAAM,cAAoB;EACxB,cAAc,SAAS;EACvB,YAAY;EACZ,IAAI,CAAC,IAAI,eAAe;GACtB,IAAI,MAAM,4BAA4B;GACtC,IAAI,IAAI;EACV;CACF;CAGA,IAAI,GAAG,SAAS,KAAK;CACrB,IAAI,GAAG,SAAS,KAAK;AACvB;;;;;;;AAQA,SAAS,oBAAoB,OAA8C;CACzE,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,MAAM,IAAI,OAAO,SAAS,OAAO,EAAE;CACnC,OAAO,OAAO,SAAS,CAAC,KAAK,IAAI,IAAI,IAAI;AAC3C;;;;AAKA,SAAS,YAAY,KAAqB,IAAY,OAAoC;CACxF,IAAI,MAAM,OAAO,GAAG,6BAA6B,KAAK,UAAU,KAAK,EAAE,KAAK;AAC9E;;;;;;;;;AAUA,SAAS,cACP,KACA,KACA,aACA,gBACM;CACN,IAAI,MAAM;CACV,IAAI,WAAW;CACf,IAAI,WAAW;CAEf,MAAM,gBAAgB,SAAuB;EAC3C,IAAI,KAAK,WAAW,GAAG;EACvB,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,IAAI;EAC1B,SAAS,KAAK;GACZ;GACA,IAAI,gBAAgB,eAAe,KAAK,IAAI;GAC5C;EACF;EACA,MAAM,SAAS,uBAAuB,MAAM;EAC5C,IAAI,CAAC,OAAO,SAAS;GACnB;GACA,IAAI,gBAAgB,eAAe,OAAO,OAAO,IAAI;GACrD;EACF;EACA,YAAY,KAAK,OAAO,IAAI;EAC5B;CACF;CAEA,IAAI,YAAY,MAAM;CACtB,IAAI,GAAG,SAAS,UAAkB;EAChC,OAAO;EAGP,IAAI,KAAK,IAAI,QAAQ,IAAI;EACzB,OAAO,OAAO,IAAI;GAChB,aAAa,IAAI,MAAM,GAAG,EAAE,CAAC;GAC7B,MAAM,IAAI,MAAM,KAAK,CAAC;GACtB,KAAK,IAAI,QAAQ,IAAI;EACvB;CACF,CAAC;CACD,IAAI,GAAG,aAAa;EAElB,IAAI,IAAI,SAAS,GAAG,aAAa,GAAG;EACpC,UAAU,KAAK,KAAK;GAAE;GAAU;EAAS,CAAC;CAC5C,CAAC;CACD,IAAI,GAAG,UAAU,QAAiB;EAChC,IAAI,gBAAgB,eAAe,KAAK,EAAE;EAC1C,UAAU,KAAK,KAAK,EAAE,OAAO,cAAc,CAAC;CAC9C,CAAC;AACH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtPA,SAAgB,WAAW,SAA4B;CACrD,MAAM,EAAE,MAAM,UAAU,gBAAgB,gBAAgB;CACxD,IAAI,SAAS;CACb,IAAI,SAAS;CACb,IAAI,OAAO;CACX,IAAI,UAAU;CACd,IAAI,SAAS;CACb,IAAI,UAA4B;CAChC,IAAI,aAA4B,QAAQ,QAAQ;CAEhD,MAAM,eAAe,SAAuB;EAC1C,IAAI,KAAK,WAAW,GAAG;EACvB,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,IAAI;EAC1B,SAAS,KAAK;GACZ,IAAI,gBAAgB,eAAe,KAAK,IAAI;GAC5C;EACF;EACA,MAAM,SAAS,uBAAuB,MAAM;EAC5C,IAAI,CAAC,OAAO,SAAS;GACnB,IAAI,gBAAgB,eAAe,OAAO,OAAO,IAAI;GACrD;EACF;EACA,SAAS,OAAO,IAAI;CACtB;CAEA,MAAM,YAAY,YAA2B;EAC3C,IAAI;EACJ,IAAI;GACF,KAAK,MAAM,KAAK,IAAI;EACtB,SAAS,KAAK;GACZ,IAAI,aAAa,YAAY,GAAG;GAChC;EACF;EACA,IAAI,GAAG,OAAO,QAAQ;GAGpB,SAAS;GACT,SAAS;EACX;EACA,IAAI,GAAG,SAAS,QAAQ;EAExB,MAAM,KAAK,MAAM,KAAK,MAAM,GAAG,CAAC,CAAC,OAAO,QAAiB;GACvD,IAAI,aAAa,YAAY,GAAG;GAChC,OAAO;EACT,CAAC;EACD,IAAI,CAAC,IAAI;EACT,IAAI;GACF,MAAM,SAAS,GAAG,OAAO;GACzB,MAAM,MAAM,OAAO,MAAM,MAAM;GAC/B,MAAM,EAAE,cAAc,MAAM,GAAG,KAAK,KAAK,GAAG,QAAQ,MAAM;GAC1D,UAAU;GACV,UAAU,IAAI,SAAS,GAAG,SAAS,CAAC,CAAC,SAAS,MAAM;EACtD,UAAU;GACR,MAAM,GAAG,MAAM;EACjB;EAEA,IAAI,KAAK,OAAO,QAAQ,IAAI;EAC5B,OAAO,OAAO,IAAI;GAChB,MAAM,OAAO,OAAO,MAAM,GAAG,EAAE;GAC/B,SAAS,OAAO,MAAM,KAAK,CAAC;GAC5B,YAAY,IAAI;GAChB,KAAK,OAAO,QAAQ,IAAI;EAC1B;CAGF;CAMA,MAAM,iBAAuB;EAC3B,IAAI,QAAQ;EACZ,IAAI,MAAM;GACR,UAAU;GACV;EACF;EACA,OAAO;EACP,cAAc,YAA2B;GACvC,IAAI;IACF,IAAI,aAAa;IACjB,OAAO,YAAY;KACjB,UAAU;KACV,MAAM,UAAU;KAChB,aAAa,WAAW,CAAC;IAC3B;GACF,UAAU;IACR,OAAO;GACT;EACF,EAAA,CAAG;CACL;CAEA,SAAS;CAET,IAAI;EACF,UAAUC,MAAS,MAAM,EAAE,YAAY,KAAK,SAAS;GAAE,SAAS;EAAE,CAAC;CACrE,SAAS,KAAK;EACZ,IAAI,aAAa,YAAY,GAAG;CAClC;CAEA,MAAM,aAAmB;EACvB,SAAS;EACT,IAAI,SAAS;GACX,QAAQ,MAAM;GACd,UAAU;EACZ;CACF;CAEA,MAAM,QAAQ,YAA2B;EACvC,SAAS;EACT,MAAM;CACR;CAEA,OAAO;EAAE;EAAM;CAAM;AACvB;;;;;;;;;;;;;;;;;AC9HA,eAAsB,aAAa,UAA8B,CAAC,GAA0B;CAC1F,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,OAAO,QAAQ,QAAQ;CAE7B,MAAM,cAAc,mBAAmB;EACrC,QAFa,QAAQ,UAAU;EAG/B,GAAI,QAAQ,sBAAsB,EAAE,qBAAqB,QAAQ,oBAAoB,IAAI,CAAC;CAC5F,CAAC;CACD,MAAM,SAAS,MAAM,aAAa;EAChC;EACA;EACA;EACA,GAAI,QAAQ,iBAAiB,EAAE,gBAAgB,QAAQ,eAAe,IAAI,CAAC;CAC7E,CAAC;CAED,IAAI,OAAoB;CACxB,IAAI,QAAQ,SAAS,KAAA,GACnB,OAAO,WAAW;EAChB,MAAM,QAAQ;EACd,WAAW,UAAU;GAAE,YAAY,KAAK,KAAK;EAAE;EAC/C,GAAI,QAAQ,iBAAiB,EAAE,gBAAgB,QAAQ,eAAe,IAAI,CAAC;EAC3E,GAAI,QAAQ,cAAc,EAAE,aAAa,QAAQ,YAAY,IAAI,CAAC;CACpE,CAAC;CAGH,OAAO,YAAY,QAAQ,MAAM,IAAI;AACvC;;;;;;;;;AAUA,SAAS,YAAY,QAAsB,MAAmB,MAA4B;CACxF,OAAO;EACL,KAAK,OAAO;EACZ;EACA,MAAM,OAAO,IAAI,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI;EACrC,OAAO,YAAY;GACjB,IAAI,MAAM,KAAK,KAAK;GACpB,MAAM,OAAO,MAAM;EACrB;CACF;AACF;;;;;;;;;;;;;;;;ACpDA,MAAM,OAAO;;;;;;;;;;;;;;;;;;;;;AAsBb,SAAgB,MAAM,MAAkC;CACtD,MAAM,EAAE,QAAQ,gBAAgB,UAAU;EACxC,MAAM,CAAC,GAAG,IAAI;EACd,kBAAkB;EAClB,SAAS;GACP,MAAM;IAAE,MAAM;IAAU,SAAS;GAAO;GACxC,MAAM;IAAE,MAAM;IAAU,SAAS;GAAY;GAC7C,QAAQ;IAAE,MAAM;IAAU,SAAS;GAAO;GAC1C,QAAQ;IAAE,MAAM;IAAW,SAAS;GAAM;GAC1C,MAAM;IAAE,MAAM;IAAW,SAAS;GAAK;GACvC,WAAW;IAAE,MAAM;IAAW,SAAS;GAAM;GAC7C,MAAM;IAAE,MAAM;IAAW,SAAS;GAAM;EAC1C;CACF,CAAC;CACD,IAAI,OAAO,MAAM;EACf,QAAQ,OAAO,MAAM,IAAI;EACzB,QAAQ,KAAK,CAAC;CAChB;CACA,MAAM,WAAW,OAAO,QAAQ;CAChC,MAAM,aAAa,OAAO,UAAU;CACpC,MAAM,OAAO,OAAO,SAAS,UAAU,EAAE;CACzC,MAAM,SAAS,OAAO,SAAS,YAAY,EAAE;CAC7C,IAAI,CAAC,OAAO,SAAS,IAAI,KAAK,QAAQ,GAAG;EACvC,QAAQ,OAAO,MAAM,mBAAmB,SAAS,GAAG;EACpD,QAAQ,KAAK,CAAC;CAChB;CACA,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,GAAG;EAC3C,QAAQ,OAAO,MAAM,qBAAqB,WAAW,GAAG;EACxD,QAAQ,KAAK,CAAC;CAChB;CACA,MAAM,OAAO,YAAY;CACzB,MAAM,SAAS,OAAO,UAAU;CAChC,IAAI,SAAS,KAAA,KAAa,CAAC,QAAQ;EACjC,QAAQ,OAAO,MAAM,gEAAgE;EACrF,QAAQ,OAAO,MAAM,IAAI;EACzB,QAAQ,KAAK,CAAC;CAChB;CACA,OAAO;EACL,GAAI,SAAS,KAAA,IAAY,EAAE,KAAK,IAAI,CAAC;EACrC,MAAM,OAAO,QAAQ;EACrB;EACA;EACA;EACA,MAAM,CAAC,OAAO,eAAe,OAAO,QAAQ;CAC9C;AACF;;;;;;;AAQA,SAAgB,aAAa,KAAmB;CAC9C,MAAM,WAAW,QAAQ;CACzB,MAAM,MAAM,aAAa,WAAW,SAAS,aAAa,UAAU,QAAQ;CAC5E,MAAM,OAAO,aAAa,UAAU;EAAC;EAAM;EAAS;EAAM;CAAG,IAAI,CAAC,GAAG;CACrE,IAAI;EACF,MAAM,QAAQ,MAAM,KAAK,MAAM;GAAE,OAAO;GAAU,UAAU;EAAK,CAAC;EAClE,MAAM,GAAG,eAAe,CAAC,CAAC;EAC1B,MAAM,MAAM;CACd,QAAQ,CAER;AACF;;;;;;;;;AAUA,eAAsB,eAAe,MAAwC;CAC3E,MAAM,OAAO,MAAM,IAAI;CAEvB,IAAI,KAAK,SAAS,KAAA,KAAa,CAAC,WAAW,KAAK,IAAI,GAClD,QAAQ,OAAO,MACb,6BAA6B,KAAK,KAAK,+DACzC;CAEF,IAAI,KAAK,SAAS,WAChB,QAAQ,OAAO,MACb,4HACF;CAGF,MAAM,SAAS,MAAM,aAAa;EAChC,GAAI,KAAK,SAAS,KAAA,IAAY,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;EACrD,MAAM,KAAK;EACX,MAAM,KAAK;EACX,QAAQ,KAAK;EACb,iBAAiB,KAAK,SAAS;GAC7B,MAAM,UAAU,KAAK,SAAS,MAAM,GAAG,KAAK,MAAM,GAAG,GAAG,EAAE,KAAK;GAC/D,QAAQ,OAAO,MACb,4CAA4C,QAAQ,MAAM,eAAe,GAAG,EAAE,GAChF;EACF;EACA,cAAc,QAAQ;GACpB,QAAQ,OAAO,MAAM,8BAA8B,eAAe,GAAG,EAAE,GAAG;EAC5E;CACF,CAAC;CAED,IAAI,KAAK,SAAS,KAAA,GAAW,QAAQ,OAAO,MAAM,YAAY,KAAK,KAAK,GAAG;CAC3E,IAAI,KAAK,UAAU,KAAK,SAAS,KAAA,GAAW,QAAQ,OAAO,MAAM,8BAA8B,OAAO,IAAI,cAAc;CACxH,QAAQ,OAAO,MAAM,aAAa,OAAO,IAAI,GAAG;CAEhD,IAAI,KAAK,MAAM,aAAa,OAAO,GAAG;CAEtC,MAAM,WAAW,YAA2B;EAC1C,QAAQ,OAAO,MAAM,oCAAoC;EACzD,MAAM,OAAO,MAAM;EACnB,QAAQ,KAAK,CAAC;CAChB;CACA,QAAQ,GAAG,gBAAgB;EAAE,SAAc;CAAE,CAAC;CAC9C,QAAQ,GAAG,iBAAiB;EAAE,SAAc;CAAE,CAAC;AACjD;;;;AAKA,SAAS,eAAe,KAAsB;CAC5C,IAAI,eAAe,OAAO,OAAO,IAAI;CACrC,IAAI;EACF,OAAO,KAAK,UAAU,GAAG;CAC3B,QAAQ;EACN,OAAO,OAAO,GAAG;CACnB;AACF;AAYA,IAHE,QAAQ,KAAK,OAAO,KAAA,KACpB,QAAQ,KAAK,OAAO,cAAc,OAAO,KAAK,GAAG,GAGjD,eAAoB,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,QAAiB;CACjE,QAAQ,OAAO,MAAM,oBAAoB,eAAe,GAAG,EAAE,GAAG;CAChE,QAAQ,KAAK,CAAC;AAChB,CAAC"}
|
|
1
|
+
{"version":3,"file":"index.js","names":["throw_if_aborted","e"],"sources":["../src/composites/adversarial.ts","../src/composites/consensus.ts","../src/composites/ensemble.ts","../src/composites/ensemble_step.ts","../src/composites/gate.ts","../src/composites/improve.ts","../src/composites/learn.ts","../src/composites/tournament.ts","../src/composites/errors.ts","../src/composites/bench.ts","../src/composites/judges.ts","../src/composites/regression.ts","../src/model_call.ts","../src/forward_standard_env.ts"],"sourcesContent":["/**\n * adversarial: build-and-critique loop.\n *\n * This file is the canonical example of how a user-built composite is\n * structured: the entire implementation is a composition of core\n * primitives. Read it as documentation.\n */\n\nimport { compose, loop, scope, stash, step, use } from '#core'\nimport type { Step } from '#core'\n\nexport type AdversarialBuildInput<input, candidate> = {\n readonly input: input\n readonly prior?: candidate\n readonly critique?: string\n}\n\nexport type AdversarialCritiqueResult = { readonly notes: string } & Record<string, unknown>\n\nexport type AdversarialResult<candidate> = {\n readonly candidate: candidate\n readonly converged: boolean\n readonly rounds: number\n}\n\nexport type AdversarialConfig<input, candidate, projected = AdversarialResult<candidate>> = {\n readonly name?: string\n readonly build: Step<AdversarialBuildInput<input, candidate>, candidate>\n readonly critique: Step<candidate, AdversarialCritiqueResult>\n readonly accept: (critique_result: AdversarialCritiqueResult) => boolean\n readonly max_rounds: number\n readonly project?: (r: AdversarialResult<candidate>) => projected\n}\n\ntype AdversarialState<input, candidate> = {\n readonly input: input\n readonly candidate?: candidate\n readonly critique_notes?: string\n readonly last_critique?: AdversarialCritiqueResult\n}\n\n/**\n * Projects loop state into the build step's input.\n *\n * Omits `prior` and `critique` until they exist, so the first round's build\n * sees only the original input and later rounds see what came before.\n */\nfunction build_input_from_state<i, c>(\n s: AdversarialState<i, c>,\n): AdversarialBuildInput<i, c> {\n if (s.candidate === undefined) return { input: s.input }\n if (s.critique_notes === undefined) return { input: s.input, prior: s.candidate }\n return { input: s.input, prior: s.candidate, critique: s.critique_notes }\n}\n\n/**\n * Builds a Step that runs up to `max_rounds` iterations of build ->\n * critique -> accept.\n *\n * Each round builds a candidate (receiving the prior candidate and critique\n * notes when available), critiques it, then checks `accept(critique_result)`.\n * Returns `{ candidate, converged, rounds }`. Does not throw on\n * non-convergence; `converged: false` reports it instead. `project` maps\n * that envelope into the step's output (e.g. `(r) => r.candidate`); omitted,\n * the envelope itself is the output.\n *\n * Implemented as a `compose`d `loop` whose body builds a new candidate and\n * whose guard runs the critique step and checks `accept`. State is threaded\n * through `scope`/`stash`/`use` so the build and critique steps remain\n * unmodified user-supplied `Step` values.\n */\nexport function adversarial<input, candidate, projected = AdversarialResult<candidate>>(\n config: AdversarialConfig<input, candidate, projected>,\n): Step<input, projected> {\n const { build, critique, accept, max_rounds } = config\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: AdversarialResult<candidate>) => r as unknown as projected)\n\n type S = AdversarialState<input, candidate>\n\n const body: Step<S, S> = scope([\n stash('state', step('snapshot', (s: S) => s)),\n step('to_build_input', (s: S) => build_input_from_state(s)),\n build,\n use(['state'], (vars, candidate: candidate) => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars['state'] as S\n return { ...prior, candidate }\n }),\n ])\n\n const guard: Step<S, { stop: boolean; state: S }> = scope([\n stash('state', step('snapshot', (s: S) => s)),\n step('extract_candidate', (s: S) => {\n if (s.candidate === undefined) {\n throw new Error('adversarial: guard reached without a candidate')\n }\n return s.candidate\n }),\n critique,\n use(['state'], (vars, critique_result: AdversarialCritiqueResult) => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars['state'] as S\n return {\n stop: accept(critique_result),\n state: {\n ...prior,\n last_critique: critique_result,\n critique_notes: critique_result.notes,\n },\n }\n }),\n ])\n\n const inner = loop<input, S, projected>({\n init: (input) => ({ input }),\n body,\n guard,\n finish: (s, { converged, rounds }) => {\n if (s.candidate === undefined) {\n throw new Error('adversarial: finished without a candidate')\n }\n return project({ candidate: s.candidate, converged, rounds })\n },\n max_rounds,\n })\n\n return compose(config.name ?? 'adversarial', inner)\n}\n","/**\n * consensus: run-until-agreement composite over concurrent members.\n */\n\nimport { compose, loop, parallel, scope, stash, step, use } from '#core'\nimport type { Step } from '#core'\n\nexport type ConsensusConfig<i, o, projected = ConsensusResult<o>> = {\n readonly name?: string\n readonly members: Record<string, Step<i, o>>\n readonly agree: (results: Record<string, o>) => boolean\n readonly max_rounds: number\n readonly project?: (r: ConsensusResult<o>) => projected\n}\n\nexport type ConsensusResult<o> = {\n readonly result: Record<string, o>\n readonly converged: boolean\n}\n\ntype ConsensusState<i, o> = {\n readonly input: i\n readonly results: Record<string, o>\n}\n\n/**\n * Builds a Step that runs every member concurrently with the same input\n * until `agree(results)` accepts a round.\n *\n * On agreement, returns the round's results with `converged: true`.\n * Otherwise re-runs all members up to `max_rounds` times and returns the\n * last results with `converged: false` if no agreement is reached.\n * `project` maps the `{ result, converged }` envelope into the step's output\n * (e.g. `(r) => r.converged`); omitted, the envelope itself is the output.\n *\n * Implemented as a `compose`d `loop` whose body runs `parallel(members)` and\n * whose guard evaluates `agree`. State carries the original input alongside\n * the most recent results so each round receives the same input.\n */\nexport function consensus<i, o, projected = ConsensusResult<o>>(\n config: ConsensusConfig<i, o, projected>,\n): Step<i, projected> {\n const { members, agree, max_rounds } = config\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: ConsensusResult<o>) => r as unknown as projected)\n\n type S = ConsensusState<i, o>\n\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const round_step = parallel(members) as Step<i, Record<string, o>>\n\n const body: Step<S, S> = scope([\n stash('state', step('snapshot', (s: S) => s)),\n step('extract_input', (s: S) => s.input),\n round_step,\n use(['state'], (vars, results: Record<string, o>) => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars['state'] as S\n return { ...prior, results }\n }),\n ])\n\n const guard: Step<S, { stop: boolean; state: S }> = step('agree', (s: S) => ({\n stop: agree(s.results),\n state: s,\n }))\n\n const inner = loop<i, S, projected>({\n init: (input) => ({ input, results: {} }),\n body,\n guard,\n finish: (s, { converged }) => project({ result: s.results, converged }),\n max_rounds,\n })\n\n return compose(config.name ?? 'consensus', inner)\n}\n","/**\n * ensemble: N-of-M pick-best with a plain-function scorer.\n */\n\nimport { compose, parallel, sequence, step } from '#core'\nimport type { Step } from '#core'\n\nexport type EnsembleConfig<i, o, projected = EnsembleResult<o>> = {\n readonly name?: string\n readonly members: Record<string, Step<i, o>>\n readonly score: (result: o, member_id: string) => number | Promise<number>\n readonly select?: 'max' | 'min'\n readonly project?: (r: EnsembleResult<o>) => projected\n}\n\nexport type EnsembleResult<o> = {\n readonly winner: o\n readonly scores: Record<string, number>\n}\n\n/**\n * Builds a Step that runs every member concurrently with the same input,\n * scores each result, and returns the winner plus the complete score map.\n *\n * `select` picks the highest (`'max'`, the default) or lowest (`'min'`)\n * score. Tie-breaking is \"any tied result is acceptable\": the first member\n * (in `members` key order) holding the best score wins. `project` maps the\n * `{ winner, scores }` envelope into the step's output (e.g. `(r) =>\n * r.winner`); omitted, the envelope itself is the output.\n *\n * Implemented as a `compose`d `sequence` of `parallel(members)` followed by\n * a single picking step. Cancellation, fan-out, and abort propagation come\n * from `parallel`'s own contract.\n */\nexport function ensemble<i, o, projected = EnsembleResult<o>>(\n config: EnsembleConfig<i, o, projected>,\n): Step<i, projected> {\n const select: 'max' | 'min' = config.select ?? 'max'\n const score_fn = config.score\n const keys = Object.keys(config.members)\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: EnsembleResult<o>) => r as unknown as projected)\n\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const fan_out = parallel(config.members) as Step<i, Record<string, o>>\n\n const pick = step('pick_winner', async (results: Record<string, o>) => {\n const scores: Record<string, number> = {}\n for (const k of keys) {\n const value = results[k]\n if (value === undefined) continue\n scores[k] = await score_fn(value, k)\n }\n \n let winner_key: string | undefined = undefined\n let winner_score: number | undefined = undefined\n for (const k of keys) {\n const current = scores[k]\n if (current === undefined) continue\n if (winner_score === undefined) {\n winner_key = k\n winner_score = current\n continue\n }\n const better = select === 'max' ? current > winner_score : current < winner_score\n if (better) {\n winner_key = k\n winner_score = current\n }\n }\n \n if (winner_key === undefined) {\n throw new Error('ensemble: no members produced a result')\n }\n const winner = results[winner_key]\n if (winner === undefined) {\n throw new Error('ensemble: winner missing from results')\n }\n return project({ winner, scores })\n })\n\n const inner = sequence([fan_out, pick])\n\n return compose(config.name ?? 'ensemble', inner)\n}\n","/**\n * ensemble_step: N-of-M pick-best with a Step-based scorer.\n */\n\nimport { compose, map, parallel, scope, stash, step, use } from '#core'\nimport type { Step } from '#core'\n\nexport type EnsembleStepConfig<i, o, ranked, projected = EnsembleStepResult<o, ranked>> = {\n readonly name?: string\n readonly members: Record<string, Step<i, o>>\n readonly score: Step<o, ranked>\n readonly rank_by: (r: ranked) => number\n readonly select?: 'max' | 'min'\n readonly project?: (r: EnsembleStepResult<o, ranked>) => projected\n}\n\nexport type EnsembleStepResult<o, ranked> = {\n readonly winner_id: string\n readonly winner: o\n readonly winner_scored: ranked\n readonly scored: Record<string, ranked>\n}\n\n// Scope variable keys, underscore-prefixed to avoid colliding with any\n// stashes a user-supplied step might set in the same scope chain.\nconst RESULTS_KEY = '__ensemble_step_results'\nconst ITEM_KEY = '__ensemble_step_item'\n\ntype Pair<o> = { readonly id: string; readonly value: o }\ntype ScoredPair<ranked> = { readonly id: string; readonly scored: ranked }\n\n/**\n * Builds a Step that runs every member concurrently, scores each result via\n * a scoring `Step`, and returns the best-ranking winner.\n *\n * Sibling of `ensemble` for the case where scoring is itself a `Step` (e.g.\n * a separate model call, a sub-flow, anything that wants its own trajectory\n * span and abort routing). The `score` step is dispatched once per member\n * result; `rank_by` projects a number out of the structured scored output;\n * `select` picks the highest (`'max'`, default) or lowest (`'min'`) rank.\n *\n * The result carries `winner_scored`, the structured output from the round's\n * scoring run preserved verbatim, so callers never pay to re-score the\n * winner. `scored` holds the structured score for every member. `project`\n * maps that envelope into the step's output (e.g. `(r) => r.winner`);\n * omitted, the envelope itself is the output.\n *\n * Implemented as a `compose`d `scope` over (`stash(parallel(members))` ->\n * `to_pairs` -> `map(score per result, threading id)` -> `use` to pick the\n * winner). Cancellation, fan-out, and abort propagation come from the\n * underlying `parallel` and `map` contracts.\n */\nexport function ensemble_step<i, o, ranked, projected = EnsembleStepResult<o, ranked>>(\n config: EnsembleStepConfig<i, o, ranked, projected>,\n): Step<i, projected> {\n const { members, score, rank_by } = config\n const select: 'max' | 'min' = config.select ?? 'max'\n const keys = Object.keys(members)\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: EnsembleStepResult<o, ranked>) => r as unknown as projected)\n\n if (keys.length === 0) {\n throw new Error('ensemble_step: at least one member required')\n }\n\n const fan_out = parallel(members)\n\n const score_one = scope([\n stash(ITEM_KEY, step('ensemble_step_item_snapshot', (item: Pair<o>) => item)),\n step('ensemble_step_extract_value', (item: Pair<o>) => item.value),\n score,\n use([ITEM_KEY], (vars, scored: ranked): ScoredPair<ranked> => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const item = vars[ITEM_KEY] as Pair<o>\n return { id: item.id, scored }\n }),\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n ]) as Step<Pair<o>, ScoredPair<ranked>>\n\n const to_pairs = step(\n 'ensemble_step_to_pairs',\n (results: Record<string, o>): ReadonlyArray<Pair<o>> => {\n const out: Pair<o>[] = []\n for (const id of keys) {\n if (id in results) {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n out.push({ id, value: results[id] as o })\n }\n }\n return out\n },\n )\n\n const score_each = map<ReadonlyArray<Pair<o>>, Pair<o>, ScoredPair<ranked>>({\n items: (pairs) => pairs,\n do: score_one,\n })\n\n const pick = use(\n [RESULTS_KEY],\n (vars, scored_pairs: ReadonlyArray<ScoredPair<ranked>>): projected => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const results = vars[RESULTS_KEY] as Record<string, o>\n const scored: Record<string, ranked> = {}\n let winner_id: string | undefined\n let winner_rank: number | undefined\n let winner_scored: ranked | undefined\n for (const pair of scored_pairs) {\n scored[pair.id] = pair.scored\n const rank = rank_by(pair.scored)\n const better =\n winner_rank === undefined\n ? true\n : select === 'max'\n ? rank > winner_rank\n : rank < winner_rank\n if (better) {\n winner_id = pair.id\n winner_rank = rank\n winner_scored = pair.scored\n }\n }\n if (winner_id === undefined || winner_scored === undefined) {\n throw new Error('ensemble_step: no members produced a result')\n }\n const winner = results[winner_id]\n if (winner === undefined) {\n throw new Error('ensemble_step: winner missing from results')\n }\n return project({ winner_id, winner, winner_scored, scored })\n },\n )\n\n const inner = scope([\n stash(RESULTS_KEY, fan_out),\n to_pairs,\n score_each,\n pick,\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n ]) as Step<i, projected>\n\n return compose(config.name ?? 'ensemble_step', inner)\n}\n","/**\n * gate: persist paid work before a human gate, never re-bill on resume.\n *\n * `gate(inner, config)` runs `inner`, checkpoints its result, then suspends\n * so a human can approve what was produced. The checkpoint write lands before\n * the suspend unwinds the run, so the expensive work (typically a paid model\n * call) survives the pause: a resume, or a fresh run after a process restart,\n * replays the result from the store instead of buying it again.\n *\n * Decisions this composite fixes, and why:\n *\n * - Checkpoint key: `gate:<config.id>`. Derived only from the user-supplied\n * id, with no construction-time counters, so a flow rebuilt in a new\n * process maps to the same stored result. The key is fixed per gate, which\n * assumes a store scoped per logical job (the same assumption the\n * checkpoint and resume docs make for fixed string keys). Inherited from\n * `checkpoint`: a stored `null`/`undefined` counts as a miss, and the inner\n * step must be named.\n * - Suspend payload: follows the library's suspend contract, which raises\n * `{ input }` on the `suspended_error`. Here that `input` is\n * `format(result)` when `format` is given and the raw result otherwise, so\n * `run.until_suspended` surfaces `{ input: <approver view> }` as the\n * outcome payload. A `format` return value is used verbatim (even\n * `undefined`): the approver view is the format's business. The store\n * always holds the raw result; `format` shapes only the view.\n * - Resumed value: the inner result passes through unchanged. The resume\n * decision is the approval signal only and is discarded, so any defined\n * value counts as approval arriving (the schema accepts everything). A\n * flow that needs decision-dependent output (approve vs reject branches)\n * should use `suspend` directly, whose `combine` exists for exactly that.\n * - `store` is optional. Absent, the checkpoint falls back to the run's\n * `checkpoint_store`; with neither, the gate still suspends and resumes\n * in-process but a restart re-executes `inner`. Present, the gate-local\n * store wins over the run-level one, because an explicit argument beats\n * ambient configuration.\n * - The suspend's `on` hook is a noop: notification is the driver's job, and\n * `run.until_suspended` already hands it the payload to render.\n */\n\nimport { checkpoint, compose, scope, stash, step, suspend, use } from '#core'\nimport type { CheckpointStore, RunContext, Step } from '#core'\n\nexport type GateConfig<o> = {\n readonly id: string\n readonly name?: string\n readonly store?: CheckpointStore\n readonly format?: (result: o) => unknown\n}\n\n// The gate has no opinion about the decision's shape, so its resume schema is\n// the always-accepting Standard Schema, written inline because composites\n// depend only on the public core surface.\nconst approval_schema = {\n '~standard': {\n version: 1,\n vendor: 'fascicle',\n validate: (value: unknown) => ({ value }),\n },\n} as const\n\n/**\n * Bind a gate-local store over the run context for the checkpoint beneath.\n *\n * `checkpoint` reads `ctx.checkpoint_store`, so scoping a store to one gate\n * means forking the context above it; contexts are plain spread-copied\n * values, which is what makes this possible with public primitives only. The\n * wrapper adopts the checkpointed step as its child so `describe` still shows\n * the persistence layer and the inner step beneath it.\n */\nfunction bind_store<i, o>(persisted: Step<i, o>, store: CheckpointStore): Step<i, o> {\n const wrapper = step('bind_store', (input: i, ctx: RunContext) => {\n const forked: RunContext = { ...ctx, checkpoint_store: store }\n return forked.call(persisted, input)\n })\n return { ...wrapper, children: [persisted] }\n}\n\n/**\n * Build a Step that runs `inner`, checkpoints its result at `gate:<id>`, and\n * suspends with that result as the payload awaiting approval.\n *\n * On resume (any defined resume value) the gate resolves to the inner result\n * unchanged; the decision itself is discarded. On a re-run against the same\n * store, the checkpoint absorbs the replay so `inner` never re-executes.\n * Throws at construction time when `inner` is anonymous, because the cached\n * result must map back to a stable step.\n *\n * Implemented as a `compose`d `scope`: the checkpointed result is stashed,\n * projected into the approver's view, and handed to `suspend`; the suspend's\n * `combine` returns a `use` step that restores the stashed result, which is\n * how the decision stays signal-only.\n */\nexport function gate<i, o>(inner: Step<i, o>, config: GateConfig<o>): Step<i, o> {\n if (inner.anonymous === true) {\n throw new Error('gate requires a named inner step; got anonymous')\n }\n const { id, store, format } = config\n\n const checkpointed = checkpoint(inner, { key: `gate:${id}` })\n const persisted = store === undefined ? checkpointed : bind_store(checkpointed, store)\n\n const restore = use(['result'], (vars) => {\n // The stash below wrote the checkpointed inner result under this key, so\n // the read-back re-asserts its type.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n return vars['result'] as o\n })\n\n const approval = suspend<unknown, o, unknown>({\n id,\n on: () => {},\n resume_schema: approval_schema,\n combine: () => restore,\n })\n\n const body: Step<i, o> = scope([\n stash('result', persisted),\n step('project_payload', (result: o) => (format === undefined ? result : format(result))),\n approval,\n ])\n\n return compose(config.name ?? 'gate', body)\n}\n","/**\n * improve: bounded online self-improvement loop.\n *\n * The *online* counterpart to `learn`: where `learn` reflects on recorded\n * trajectories offline, `improve` runs a propose/score loop live inside a\n * single run. The amplify example is a domain-specific consumer of this\n * same pattern (filesystem mutation, test-suite gates, subprocess\n * research); `improve` strips those opinions out so any domain can plug in\n * its own `propose` and `score` steps.\n */\n\nimport { compose, loop, scope, step, stash, use } from '#core'\nimport type { Step } from '#core'\nimport { ensemble_step } from './ensemble_step.js'\n\nexport type Candidate<c> = {\n readonly content: c\n readonly proposer_id: string\n readonly rationale?: string\n}\n\nexport type ScoredCandidate<c> = {\n readonly candidate: Candidate<c>\n readonly score: number\n readonly accepted: boolean\n readonly reason?: string\n}\n\nexport type Lesson = {\n readonly round: number\n readonly proposer_id: string\n readonly reason: string\n}\n\nexport type ImproveRoundInput<c> = {\n readonly parent: c\n readonly parent_score: number\n readonly round: number\n readonly lessons: ReadonlyArray<Lesson>\n}\n\nexport type ImproveBudget = {\n readonly max_rounds: number\n readonly max_wallclock_ms?: number\n readonly patience: number\n}\n\nexport type ImproveConfig<i, c, projected = ImproveResult<c>> = {\n readonly name?: string\n readonly seed: Step<i, { readonly content: c; readonly score: number }>\n readonly propose: Step<ImproveRoundInput<c>, Candidate<c>>\n readonly score: Step<Candidate<c>, ScoredCandidate<c>>\n readonly budget: ImproveBudget\n readonly epsilon?: number\n readonly proposers_per_round?: number\n readonly lessons_capacity?: number\n readonly project?: (r: ImproveResult<c>) => projected\n}\n\nexport type HistoryEntry<c> = {\n readonly round: number\n readonly winner: ScoredCandidate<c>\n readonly accepted: boolean\n}\n\nexport type ImproveResult<c> = {\n readonly best: { readonly content: c; readonly score: number }\n readonly rounds_used: number\n readonly stopped_by: 'budget' | 'plateau'\n readonly history: ReadonlyArray<HistoryEntry<c>>\n}\n\n// Scope variable key for the pre-round state snapshot, underscore-prefixed\n// to avoid colliding with stashes set by user-supplied steps.\nconst PRIOR_KEY = '__improve_prior'\n\ntype ImproveState<c> = {\n readonly parent: c\n readonly parent_score: number\n readonly round: number\n readonly rounds_since_progress: number\n readonly started_at_ms: number\n readonly history: ReadonlyArray<HistoryEntry<c>>\n readonly lessons: ReadonlyArray<Lesson>\n readonly stopped_by?: 'budget' | 'plateau'\n}\n\n/**\n * Builds a Step that runs a round-bounded loop threading a `parent`\n * candidate through repeated propose -> score -> accept/reject cycles.\n *\n * Acceptance requires both a hard gate (`scored.accepted`) and an\n * epsilon-improvement test (`scored.score > parent_score + epsilon`).\n * Rejected rounds with a `reason` feed a bounded lessons list back into the\n * next round's input. Plateau detection stops the loop early when no\n * progress has been made for `patience` rounds; an optional wall-clock\n * budget caps total runtime. `project` maps the result envelope into the\n * step's output (e.g. `(r) => r.best.content`); omitted, the envelope\n * itself is the output.\n *\n * Implemented as a `compose`d `scope` of (seed) -> (init state) -> (loop) ->\n * (unwrap). The loop body is itself a small `scope` that snapshots prior\n * state, builds a round input, dispatches the proposers + scorer via\n * `ensemble_step`, and merges the outcome back into state via `use`.\n * State threading is the entire job.\n */\nexport function improve<i, c, projected = ImproveResult<c>>(\n config: ImproveConfig<i, c, projected>,\n): Step<i, projected> {\n const { seed, propose, score, budget } = config\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: ImproveResult<c>) => r as unknown as projected)\n const epsilon = config.epsilon ?? 0\n const proposers_per_round = Math.max(1, config.proposers_per_round ?? 1)\n const lessons_capacity = Math.max(0, config.lessons_capacity ?? 5)\n const { max_rounds, max_wallclock_ms, patience } = budget\n\n const proposers: Record<string, Step<ImproveRoundInput<c>, Candidate<c>>> = {}\n for (let i = 0; i < proposers_per_round; i += 1) {\n proposers[`p${String(i)}`] = propose\n }\n\n const round_ensemble = ensemble_step<\n ImproveRoundInput<c>,\n Candidate<c>,\n ScoredCandidate<c>\n >({\n name: 'improve_round',\n members: proposers,\n score,\n rank_by: (s) => s.score,\n })\n\n type RoundResult = {\n readonly winner_id: string\n readonly winner: Candidate<c>\n readonly winner_scored: ScoredCandidate<c>\n readonly scored: Record<string, ScoredCandidate<c>>\n }\n\n const project_round = use(\n [PRIOR_KEY],\n (vars, ensemble_result: RoundResult, ctx): ScoredCandidate<c> => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars[PRIOR_KEY] as ImproveState<c>\n const round = prior.round + 1\n for (const slot_id of Object.keys(ensemble_result.scored)) {\n const scored = ensemble_result.scored[slot_id]\n if (scored === undefined) continue\n ctx.trajectory.record({\n kind: 'improve.candidate',\n round,\n proposer_id: slot_id,\n score: scored.score,\n accepted: scored.accepted,\n ...(scored.reason === undefined ? {} : { reason: scored.reason }),\n })\n }\n const w = ensemble_result.winner_scored\n return {\n ...w,\n candidate: { ...w.candidate, proposer_id: ensemble_result.winner_id },\n }\n },\n )\n\n const init_state = step(\n 'improve_init_state',\n (seed_result: { content: c; score: number }): ImproveState<c> => ({\n parent: seed_result.content,\n parent_score: seed_result.score,\n round: 0,\n rounds_since_progress: 0,\n started_at_ms: Date.now(),\n history: [],\n lessons: [],\n }),\n )\n\n const to_round_input = step(\n 'improve_to_round_input',\n (s: ImproveState<c>, ctx): ImproveRoundInput<c> => {\n const round = s.round + 1\n ctx.trajectory.record({\n kind: 'improve.round_start',\n round,\n parent_score: s.parent_score,\n lessons_count: s.lessons.length,\n })\n return {\n parent: s.parent,\n parent_score: s.parent_score,\n round,\n lessons: s.lessons,\n }\n },\n )\n\n const merge_outcome = use(\n [PRIOR_KEY],\n (vars, scored: ScoredCandidate<c>, ctx): ImproveState<c> => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const prior = vars[PRIOR_KEY] as ImproveState<c>\n const next_round = prior.round + 1\n const better = scored.score > prior.parent_score + epsilon\n const accepted = scored.accepted && better\n const next_lessons = !accepted && scored.reason !== undefined\n ? [\n ...prior.lessons,\n {\n round: next_round,\n proposer_id: scored.candidate.proposer_id,\n reason: scored.reason,\n },\n ].slice(-lessons_capacity)\n : prior.lessons\n ctx.trajectory.record({\n kind: accepted ? 'improve.accept' : 'improve.reject',\n round: next_round,\n proposer_id: scored.candidate.proposer_id,\n score: scored.score,\n prior_score: prior.parent_score,\n ...(accepted ? { delta: scored.score - prior.parent_score } : {}),\n ...(scored.reason === undefined ? {} : { reason: scored.reason }),\n })\n return {\n parent: accepted ? scored.candidate.content : prior.parent,\n parent_score: accepted ? scored.score : prior.parent_score,\n round: next_round,\n rounds_since_progress: accepted ? 0 : prior.rounds_since_progress + 1,\n started_at_ms: prior.started_at_ms,\n history: [\n ...prior.history,\n { round: next_round, winner: scored, accepted },\n ],\n lessons: next_lessons,\n }\n },\n )\n\n const body = scope([\n stash(PRIOR_KEY, step('improve_snapshot', (s: ImproveState<c>) => s)),\n to_round_input,\n round_ensemble,\n project_round,\n merge_outcome,\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n ]) as Step<ImproveState<c>, ImproveState<c>>\n\n const guard = step(\n 'improve_guard',\n (s: ImproveState<c>): { stop: boolean; state: ImproveState<c> } => {\n if (s.rounds_since_progress >= patience) {\n return { stop: true, state: { ...s, stopped_by: 'plateau' } }\n }\n if (\n max_wallclock_ms !== undefined &&\n Date.now() - s.started_at_ms >= max_wallclock_ms\n ) {\n return { stop: true, state: { ...s, stopped_by: 'budget' } }\n }\n return { stop: false, state: s }\n },\n )\n\n const round_loop = loop<ImproveState<c>, ImproveState<c>, ImproveResult<c>>({\n init: (s) => s,\n body,\n guard,\n finish: (s): ImproveResult<c> => ({\n best: { content: s.parent, score: s.parent_score },\n rounds_used: s.round,\n stopped_by: s.stopped_by ?? 'budget',\n history: s.history,\n }),\n max_rounds,\n })\n\n const record_stop = step(\n 'improve_stop',\n (result: ImproveResult<c>, ctx): projected => {\n ctx.trajectory.record({\n kind: 'improve.stop',\n stopped_by: result.stopped_by,\n rounds_used: result.rounds_used,\n final_score: result.best.score,\n })\n return project(result)\n },\n )\n\n const inner = scope([\n seed,\n init_state,\n round_loop,\n record_stop,\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n ]) as Step<i, projected>\n\n return compose(config.name ?? 'improve', inner)\n}\n","/**\n * learn: offline self-improvement composer.\n *\n * `learn({ flow, source, analyzer })` reads recorded trajectory events from\n * past runs of `flow`, hands them to a user-supplied `analyzer` step alongside\n * `describe(flow)`, and returns the analyzer's proposals plus summary metadata\n * (events considered, distinct run ids).\n *\n * The amplify example is the *online* counterpart of this pattern: propose →\n * score → accept/reject inside a single run. `learn` is the *offline*\n * counterpart: reflect on what already happened across one or many recorded\n * runs without an evaluator in the loop.\n *\n * Implemented as a `compose`d `scope` of (compute meta) → (build LearnInput) →\n * (analyzer) → (wrap result with meta). No engine dependency; the analyzer\n * decides how to use the events.\n *\n * Three source kinds: `events` (in-memory), `paths` (explicit JSONL files),\n * `dir` (recursive *.jsonl walk). File reads honor `ctx.abort` at file-level\n * granularity; malformed lines are skipped and surface as `learn.parse_error`\n * trajectory events with 1-indexed line offsets. When `max_events` clips the\n * filtered set, a `learn.truncated` event records `available`, `kept`, and the\n * configured cap.\n */\n\nimport { readFile, readdir } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport {\n aborted_error,\n compose,\n describe,\n parse_trajectory_event,\n scope,\n stash,\n step,\n use,\n} from '#core'\nimport type { AnyStep, RunContext, Step, TrajectoryEvent } from '#core'\n\nexport type TrajectorySource =\n | { readonly kind: 'events'; readonly events: ReadonlyArray<TrajectoryEvent> }\n | { readonly kind: 'paths'; readonly paths: ReadonlyArray<string> }\n | { readonly kind: 'dir'; readonly dir: string }\n\nexport type LearnInput = {\n readonly flow_description: string\n readonly events: ReadonlyArray<TrajectoryEvent>\n readonly prior?: unknown\n}\n\nexport type Improvement = {\n readonly target: string\n readonly kind: 'prompt' | 'config' | 'structure' | 'note'\n readonly rationale: string\n readonly suggestion: string\n}\n\nexport type LearnConfig<i extends LearnInput, o> = {\n readonly name?: string\n readonly flow: AnyStep\n readonly source: TrajectorySource\n readonly analyzer: Step<i, o>\n readonly filter?: (event: TrajectoryEvent) => boolean\n readonly max_events?: number\n}\n\nexport type LearnResult<o> = {\n readonly proposals: o\n readonly events_considered: number\n readonly run_ids: ReadonlyArray<string>\n}\n\nconst DEFAULT_MAX_EVENTS = 10_000\nconst META_KEY = '__learn_meta'\n\ntype LearnMeta = {\n readonly events_considered: number\n readonly run_ids: ReadonlyArray<string>\n}\n\ntype MetaPlus = LearnMeta & {\n readonly events: ReadonlyArray<TrajectoryEvent>\n readonly prior: unknown\n}\n\n/**\n * Recursively collect every `.jsonl` file path under a directory.\n */\nasync function walk_jsonl(dir: string): Promise<string[]> {\n const out: string[] = []\n const entries = await readdir(dir, { withFileTypes: true })\n for (const entry of entries) {\n const full = join(dir, entry.name)\n if (entry.isDirectory()) {\n out.push(...(await walk_jsonl(full)))\n } else if (entry.isFile() && entry.name.endsWith('.jsonl')) {\n out.push(full)\n }\n }\n return out\n}\n\n/**\n * Parse one JSONL file into validated trajectory events.\n *\n * Malformed JSON lines and lines that fail schema validation are skipped,\n * each recorded as a `learn.parse_error` event with a 1-indexed line number,\n * so a single corrupt line never sinks an analysis run.\n */\nasync function read_jsonl(file_path: string, ctx: RunContext): Promise<TrajectoryEvent[]> {\n const content = await readFile(file_path, 'utf8')\n const lines = content.split('\\n')\n const events: TrajectoryEvent[] = []\n for (let i = 0; i < lines.length; i += 1) {\n const raw = lines[i]\n if (raw === undefined || raw.trim() === '') continue\n let parsed: unknown\n try {\n parsed = JSON.parse(raw)\n } catch {\n ctx.trajectory.record({ kind: 'learn.parse_error', path: file_path, line: i + 1 })\n continue\n }\n const result = parse_trajectory_event(parsed)\n if (result.success) {\n events.push(result.data)\n } else {\n ctx.trajectory.record({ kind: 'learn.parse_error', path: file_path, line: i + 1 })\n }\n }\n return events\n}\n\n/**\n * Throw the abort reason (wrapped in `aborted_error` if needed) when the run\n * has been cancelled.\n */\nfunction throw_if_aborted(ctx: RunContext): void {\n if (!ctx.abort.aborted) return\n const reason = ctx.abort.reason\n if (reason instanceof aborted_error) throw reason\n throw new aborted_error('aborted', reason === undefined ? {} : { reason })\n}\n\n/**\n * Materialize a `TrajectorySource` into an event array.\n *\n * `dir` sources walk recursively and sort paths for deterministic order.\n * File-backed sources check `ctx.abort` between files, so cancellation lands\n * at file-level granularity.\n */\nasync function resolve_events(\n source: TrajectorySource,\n ctx: RunContext,\n): Promise<ReadonlyArray<TrajectoryEvent>> {\n if (source.kind === 'events') return source.events\n\n const file_paths =\n source.kind === 'paths' ? [...source.paths] : (await walk_jsonl(source.dir)).toSorted()\n\n const all: TrajectoryEvent[] = []\n for (const p of file_paths) {\n throw_if_aborted(ctx)\n const events = await read_jsonl(p, ctx)\n all.push(...events)\n }\n return all\n}\n\n/**\n * List the distinct `run_id` values in the events, in first-seen order.\n */\nfunction collect_run_ids(events: ReadonlyArray<TrajectoryEvent>): ReadonlyArray<string> {\n const seen = new Set<string>()\n const out: string[] = []\n for (const event of events) {\n const id = event['run_id']\n if (typeof id === 'string' && !seen.has(id)) {\n seen.add(id)\n out.push(id)\n }\n }\n return out\n}\n\n/**\n * Build the offline self-improvement step.\n *\n * Composes a scope that resolves and caps the recorded events, builds the\n * `LearnInput` (including `describe(flow)`), runs the user's analyzer, and\n * wraps its proposals with the stashed meta (event count, run ids) into a\n * `LearnResult`.\n */\nexport function learn<i extends LearnInput, o>(\n config: LearnConfig<i, o>,\n): Step<unknown, LearnResult<o>> {\n const { flow, source, analyzer, filter } = config\n const max = config.max_events ?? DEFAULT_MAX_EVENTS\n\n const compute_meta = step(\n 'learn_compute_meta',\n async (prior: unknown, ctx): Promise<MetaPlus> => {\n const all = await resolve_events(source, ctx)\n const filtered = filter ? all.filter(filter) : all\n const truncated = filtered.length > max\n const capped = truncated ? filtered.slice(0, max) : filtered\n if (truncated) {\n ctx.trajectory.record({\n kind: 'learn.truncated',\n available: filtered.length,\n kept: capped.length,\n max_events: max,\n })\n }\n return {\n events_considered: capped.length,\n run_ids: collect_run_ids(capped),\n events: capped,\n prior,\n }\n },\n )\n\n const build_input = step(\n 'learn_build_input',\n (meta: MetaPlus): LearnInput => ({\n flow_description: describe(flow),\n events: meta.events,\n prior: meta.prior,\n }),\n )\n\n const wrap_result = use(\n [META_KEY],\n (vars, proposals: o, ctx): LearnResult<o> => {\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const meta = vars[META_KEY] as LearnMeta\n ctx.trajectory.record({\n kind: 'learn.summary',\n events_considered: meta.events_considered,\n run_ids: meta.run_ids,\n })\n return {\n proposals,\n events_considered: meta.events_considered,\n run_ids: meta.run_ids,\n }\n },\n )\n\n const inner = scope([\n stash(META_KEY, compute_meta),\n build_input,\n analyzer,\n wrap_result,\n ])\n\n return compose(config.name ?? 'learn', inner)\n}\n","/**\n * tournament: pairwise bracket.\n *\n * `tournament({ members, compare })` runs every member, then pairs them off\n * in a single-elimination bracket. `compare(a, b)` returns which result\n * advances. An odd member count yields one bye per affected round. Returns\n * `{ winner, bracket }` where `bracket` lists every match record.\n *\n * Implemented as a `compose`d `sequence` of `parallel(members)` followed\n * by a single bracket-reduction step. Cancellation, fan-out, and abort\n * propagation come from `parallel`'s contract; the bracket step only runs\n * after all members settle.\n */\n\nimport { compose, parallel, sequence, step } from '#core'\nimport type { Step } from '#core'\n\nexport type BracketRecord = {\n readonly round: number\n readonly a_id: string\n readonly b_id: string\n readonly winner_id: string\n}\n\nexport type TournamentConfig<i, o, projected = TournamentResult<o>> = {\n readonly name?: string\n readonly members: Record<string, Step<i, o>>\n readonly compare: (a: o, b: o) => Promise<'a' | 'b'> | 'a' | 'b'\n readonly project?: (r: TournamentResult<o>) => projected\n}\n\nexport type TournamentResult<o> = {\n readonly winner: o\n readonly bracket: ReadonlyArray<BracketRecord>\n}\n\n/**\n * Build a single-elimination bracket step over named members.\n *\n * All members run concurrently via `parallel`; the bracket step then reduces\n * survivors round by round with `compare`, recording every match. Requires at\n * least one member so a winner always exists. `project` maps the `{ winner,\n * bracket }` envelope into the step's output (e.g. `(r) => r.winner`);\n * omitted, the envelope itself is the output.\n */\nexport function tournament<i, o, projected = TournamentResult<o>>(\n config: TournamentConfig<i, o, projected>,\n): Step<i, projected> {\n const compare_fn = config.compare\n const keys = Object.keys(config.members)\n // When `project` is omitted, `projected` defaults to the envelope type, which is\n // what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = config.project ?? ((r: TournamentResult<o>) => r as unknown as projected)\n\n if (keys.length === 0) {\n throw new Error('tournament: at least one member required')\n }\n\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const fan_out = parallel(config.members) as Step<i, Record<string, o>>\n\n const bracket_step = step('bracket', async (results: Record<string, o>) => {\n let current: string[] = [...keys]\n const bracket: BracketRecord[] = []\n let round = 0\n\n while (current.length > 1) {\n round += 1\n current = await play_round(current, results, compare_fn, round, bracket)\n }\n\n return project({ winner: winner_of(current, results), bracket })\n })\n\n const inner = sequence([fan_out, bracket_step])\n\n return compose(config.name ?? 'tournament', inner)\n}\n\n/**\n * Plays one bracket round: pairs survivors two at a time, comparing each pair\n * and recording a `BracketRecord`, and returns the ids advancing. An unpaired\n * trailing survivor takes a bye. Every paired id must have a settled result.\n */\nasync function play_round<o>(\n current: ReadonlyArray<string>,\n results: Record<string, o>,\n compare: (a: o, b: o) => Promise<'a' | 'b'> | 'a' | 'b',\n round: number,\n bracket: BracketRecord[],\n): Promise<string[]> {\n const next_round: string[] = []\n for (let i = 0; i < current.length; i += 2) {\n const a_id = current[i]\n const b_id = current[i + 1]\n if (a_id === undefined) continue\n if (b_id === undefined) {\n next_round.push(a_id)\n continue\n }\n const a_val = results[a_id]\n const b_val = results[b_id]\n if (a_val === undefined || b_val === undefined) {\n throw new Error('tournament: missing result for match')\n }\n const pick = await compare(a_val, b_val)\n const winner_id = pick === 'a' ? a_id : b_id\n bracket.push({ round, a_id, b_id, winner_id })\n next_round.push(winner_id)\n }\n return next_round\n}\n\n/**\n * Extracts the tournament winner from the single surviving id, throwing when\n * no survivor remains or its result is missing.\n */\nfunction winner_of<o>(current: ReadonlyArray<string>, results: Record<string, o>): o {\n const final_id = current[0]\n if (final_id === undefined) {\n throw new Error('tournament: no winner')\n }\n const winner = results[final_id]\n if (winner === undefined) {\n throw new Error('tournament: winner missing from results')\n }\n return winner\n}\n","/**\n * Typed errors for the composites layer.\n *\n * Listed alongside src/core/errors.ts, src/engine/errors.ts, and\n * src/mcp/errors.ts in the `no-class` rule ignores: `instanceof` branching is\n * how a caller tells a benched flow's usage error apart from a case failure.\n */\n\nexport class bench_suspend_error extends Error {\n readonly kind = 'bench_suspend_error' as const;\n declare readonly path?: ReadonlyArray<string>;\n readonly case_id: string;\n readonly suspend_id: string;\n constructor(case_id: string, suspend_id: string, message?: string) {\n super(\n message ??\n `bench: case ${case_id} suspended at ${suspend_id}; bench cannot resume a suspended flow`,\n )\n this.name = 'bench_suspend_error'\n this.case_id = case_id\n this.suspend_id = suspend_id\n }\n}\n","/**\n * bench: run a flow against a fixture set, score each result, return a report.\n *\n * Online counterpart to `learn`: where `learn` reflects on past trajectories\n * after the fact, `bench` runs the flow live against fresh cases and judges\n * each output.\n */\n\nimport { mkdir } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport { aborted_error, run, suspended_error } from '#core'\nimport type { Step, TrajectoryEvent, TrajectoryLogger } from '#core'\nimport { filesystem_logger, http_logger, tee_logger } from '#adapters'\nimport { bench_suspend_error } from './errors.js'\n\nexport type Score = { readonly score: number; readonly reason?: string }\n\nexport type BenchCase<I> = {\n readonly id: string\n readonly input: I\n readonly meta?: Readonly<Record<string, unknown>>\n}\n\nexport type JudgeArgs<I, O> = {\n readonly input: I\n readonly output: O\n readonly meta?: Readonly<Record<string, unknown>>\n}\n\nexport type Judge<I, O, S = Score> = Step<JudgeArgs<I, O>, S | undefined>\n\nexport type CaseResult<I = unknown, O = unknown, S = Score> = {\n readonly case_id: string\n readonly ok: boolean\n readonly output?: O\n readonly error?: string\n readonly scores: Record<string, S>\n readonly duration_ms: number\n readonly cost_usd: number\n readonly trajectory_path?: string\n readonly _input?: I\n}\n\nexport type BenchSummary = {\n readonly pass_rate: number\n readonly mean_scores: Record<string, number>\n readonly total_duration_ms: number\n readonly total_cost_usd: number\n readonly mean_cost_usd: number\n}\n\nexport type BenchReport<I = unknown, O = unknown, S = Score> = {\n readonly flow_name: string\n readonly run_id: string\n readonly cases: ReadonlyArray<CaseResult<I, O, S>>\n readonly summary: BenchSummary\n}\n\nexport type BenchOptions = {\n readonly concurrency?: number\n readonly on_case?: (result: CaseResult) => void\n readonly trajectory_dir?: string\n readonly live_url?: string\n readonly run_id?: string\n readonly install_signal_handlers?: boolean\n readonly abort?: AbortSignal\n}\n\n/**\n * Runs `flow` against every case, judges each output, and produces a\n * `BenchReport` you can compare against a committed baseline via\n * `regression_compare`.\n *\n * Each case becomes one `run(flow, case.input, ...)`. Per-case observability:\n * - `trajectory_dir` writes `${dir}/${case.id}.jsonl` via `filesystem_logger`\n * - `live_url` POSTs each event via `http_logger` to a viewer's /api/ingest\n * - both can be combined; bench tees them with an internal cost tracker\n *\n * Cost is tracked per-case in-process by intercepting `kind: 'cost'` events\n * on the trajectory pipeline, so the cost number matches what would be on\n * disk even when no `trajectory_dir` is set.\n *\n * Judges run as Steps after each case, with the same trajectory logger so\n * judge spans land in the case's trajectory file (or push). A judge that\n * throws or returns undefined abstains: the entry is omitted from\n * `case.scores` and the case does not contribute to that judge's mean.\n *\n * Control-flow signals are not case failures and never reach a `CaseResult`.\n * `abort` forwards to every per-case `run` and is re-checked before each case\n * is claimed, so cancelling rejects the whole bench rather than returning a\n * report that silently covers fewer cases than it was given. A\n * `suspended_error` from an approval gate rejects with `bench_suspend_error`:\n * `bench` has no resume path, so a suspend is a usage error, not a zero score.\n */\nexport async function bench<I, O, S = Score>(\n flow: Step<I, O>,\n cases: ReadonlyArray<BenchCase<I>>,\n judges: Record<string, Judge<I, O, S>>,\n options: BenchOptions = {},\n): Promise<BenchReport<I, O, S>> {\n const run_id = options.run_id ?? `bench-${String(Date.now())}-${random_suffix()}`\n const flow_name = describe_flow_name(flow)\n const concurrency = resolve_concurrency(options.concurrency, cases.length)\n const install_signal_handlers = options.install_signal_handlers ?? false\n const run_options = options.abort === undefined ? {} : { abort: options.abort }\n\n throw_if_aborted(options.abort)\n\n if (options.trajectory_dir !== undefined) {\n await mkdir(options.trajectory_dir, { recursive: true })\n }\n\n const judge_entries = Object.entries(judges)\n\n const run_one = async (bc: BenchCase<I>): Promise<CaseResult<I, O, S>> => {\n const { trajectory_path, case_logger, cost_tracker } = build_case_logging(options, bc.id)\n const ctx: CaseRunContext = { case_logger, install_signal_handlers, run_options }\n\n const start = Date.now()\n let output: O | undefined\n let error: string | undefined\n let ok = false\n try {\n output = await run(flow, bc.input, {\n trajectory: case_logger,\n install_signal_handlers,\n ...run_options,\n })\n ok = true\n } catch (err) {\n rethrow_control_flow(err, bc.id)\n error = err instanceof Error ? err.message : String(err)\n ok = false\n }\n\n const scores: Record<string, S> =\n ok && output !== undefined\n ? await run_judges(judge_entries, build_judge_input(bc, output), ctx, bc.id)\n : {}\n\n const duration_ms = Date.now() - start\n const result: CaseResult<I, O, S> = {\n case_id: bc.id,\n ok,\n ...(output !== undefined ? { output } : {}),\n ...(error !== undefined ? { error } : {}),\n scores,\n duration_ms,\n cost_usd: cost_tracker.total(),\n ...(trajectory_path !== undefined ? { trajectory_path } : {}),\n }\n if (options.on_case) {\n // The on_case callback receives the lossy-typed shape: bench's S is\n // generic but the callback hook is a single concrete signature.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n options.on_case(result as unknown as CaseResult)\n }\n return result\n }\n\n const cases_out = await run_with_concurrency(cases, concurrency, run_one, options.abort)\n\n // An abort that fires while every case is already in flight has no queue to\n // halt, and a flow that never checks `ctx.abort` finishes regardless. Both\n // would otherwise yield a full report for a cancelled run.\n throw_if_aborted(options.abort)\n\n const summary = summarize(cases_out, judge_entries.map(([n]) => n))\n\n return {\n flow_name,\n run_id,\n cases: cases_out,\n summary,\n }\n}\n\n/**\n * Per-case run context shared by the flow run and every judge run: the tee'd\n * trajectory logger, the signal-handler flag, and the optional abort forward.\n */\ntype CaseRunContext = {\n readonly case_logger: TrajectoryLogger\n readonly install_signal_handlers: boolean\n readonly run_options: { readonly abort?: AbortSignal }\n}\n\n/**\n * Builds the per-case trajectory pipeline: an optional filesystem sink when\n * `trajectory_dir` is set, an optional HTTP sink when `live_url` is set, and\n * always an in-process cost tracker, all tee'd together. Returns the resolved\n * trajectory path (undefined when no dir is set) alongside the logger and\n * tracker.\n */\nfunction build_case_logging(\n options: BenchOptions,\n case_id: string,\n): {\n readonly trajectory_path: string | undefined\n readonly case_logger: TrajectoryLogger\n readonly cost_tracker: ReturnType<typeof create_cost_tracker>\n} {\n const trajectory_path =\n options.trajectory_dir === undefined\n ? undefined\n : join(options.trajectory_dir, `${case_id}.jsonl`)\n const sinks: TrajectoryLogger[] = []\n if (trajectory_path !== undefined) {\n sinks.push(filesystem_logger({ output_path: trajectory_path }))\n }\n if (options.live_url !== undefined) {\n sinks.push(http_logger({ url: options.live_url }))\n }\n const cost_tracker = create_cost_tracker()\n const case_logger: TrajectoryLogger =\n sinks.length === 0 ? cost_tracker.logger : tee_logger(...sinks, cost_tracker.logger)\n return { trajectory_path, case_logger, cost_tracker }\n}\n\n/**\n * Assembles the judge input triple, including `meta` only when the case\n * carries it so the optional field stays absent rather than `undefined`.\n */\nfunction build_judge_input<I, O>(bc: BenchCase<I>, output: O): JudgeArgs<I, O> {\n return bc.meta === undefined\n ? { input: bc.input, output }\n : { input: bc.input, output, meta: bc.meta }\n}\n\n/**\n * Runs each judge as a Step over the case's input/output, collecting the\n * normalized scores. A judge that throws a control-flow signal rethrows via\n * `rethrow_control_flow`; any other throw, or an abstaining `undefined`,\n * omits that judge from the scores rather than failing the case.\n */\nasync function run_judges<I, O, S>(\n judge_entries: ReadonlyArray<readonly [string, Judge<I, O, S>]>,\n judge_input: JudgeArgs<I, O>,\n ctx: CaseRunContext,\n case_id: string,\n): Promise<Record<string, S>> {\n const scores: Record<string, S> = {}\n for (const [name, judge] of judge_entries) {\n let raw: unknown\n try {\n // oxlint-disable-next-line no-await-in-loop\n raw = await run(judge, judge_input, {\n trajectory: ctx.case_logger,\n install_signal_handlers: ctx.install_signal_handlers,\n ...ctx.run_options,\n })\n } catch (err) {\n rethrow_control_flow(err, case_id)\n continue\n }\n const normalized = normalize_score(raw)\n if (normalized === undefined) continue\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n scores[name] = normalized as S\n }\n return scores\n}\n\n/**\n * Rethrows the control-flow signals that must never become a `CaseResult`.\n *\n * An `aborted_error` cancels the whole bench: a report claiming every\n * remaining case failed is worse than no report. A `suspended_error` becomes\n * `bench_suspend_error` naming the case, because `bench` cannot resume an\n * approval gate and scoring the paused case as a failure corrupts the\n * benchmark. Anything else returns, and the caller records it as a failure.\n */\nfunction rethrow_control_flow(err: unknown, case_id: string): void {\n if (err instanceof aborted_error) throw err\n if (err instanceof suspended_error) throw new bench_suspend_error(case_id, err.suspend_id)\n}\n\n/**\n * Rejects once `signal` has fired, so an abort stops the bench claiming\n * further cases instead of running the queue to completion.\n *\n * Mirrors core's abort shape: an `Error` reason propagates verbatim, anything\n * else is wrapped, so a caller aborting with its own `aborted_error` sees that\n * instance rather than a copy.\n */\nfunction throw_if_aborted(signal: AbortSignal | undefined): void {\n if (signal?.aborted !== true) return\n const reason: unknown = signal.reason\n throw reason instanceof Error ? reason : new aborted_error('aborted', { reason })\n}\n\n/**\n * Aggregates per-case results into the report summary.\n *\n * A judge's mean only averages the cases where that judge produced a score;\n * abstained cases do not drag the mean down, and a judge that never scored\n * is omitted from `mean_scores` entirely.\n */\nfunction summarize<I, O, S>(\n cases: ReadonlyArray<CaseResult<I, O, S>>,\n judge_names: ReadonlyArray<string>,\n): BenchSummary {\n const total_duration_ms = cases.reduce((acc, c) => acc + c.duration_ms, 0)\n const total_cost_usd = cases.reduce((acc, c) => acc + c.cost_usd, 0)\n const ok_count = cases.filter((c) => c.ok).length\n const pass_rate = cases.length === 0 ? 0 : ok_count / cases.length\n const mean_cost_usd = cases.length === 0 ? 0 : total_cost_usd / cases.length\n\n const mean_scores: Record<string, number> = {}\n for (const name of judge_names) {\n let sum = 0\n let count = 0\n for (const c of cases) {\n const n = score_value_of(c.scores[name])\n if (n === undefined) continue\n sum += n\n count += 1\n }\n if (count > 0) mean_scores[name] = sum / count\n }\n\n return {\n pass_rate,\n mean_scores,\n total_duration_ms,\n total_cost_usd,\n mean_cost_usd,\n }\n}\n\n/**\n * Coerces a raw judge return value into a `Score`.\n *\n * Accepts a bare finite number or an object with a finite numeric `score`\n * and optional string `reason`. Anything else (including NaN/Infinity, or a\n * non-string `reason`, which is dropped) normalizes toward `undefined` or a\n * reason-less score; `undefined` means the judge abstained.\n */\nexport function normalize_score(raw: unknown): Score | undefined {\n if (raw === undefined || raw === null) return undefined\n if (typeof raw === 'number') {\n return Number.isFinite(raw) ? { score: raw } : undefined\n }\n if (typeof raw === 'object' && 'score' in raw) {\n const r = raw as { score: unknown; reason?: unknown }\n if (typeof r.score !== 'number' || !Number.isFinite(r.score)) return undefined\n if (r.reason !== undefined && typeof r.reason !== 'string') {\n return { score: r.score }\n }\n return r.reason === undefined ? { score: r.score } : { score: r.score, reason: r.reason }\n }\n return undefined\n}\n\n/**\n * Extracts the numeric value from a score-shaped entry, tolerating both bare\n * numbers and `{ score }` objects since `S` is caller-defined.\n */\nfunction score_value_of(s: unknown): number | undefined {\n if (s === undefined || s === null) return undefined\n if (typeof s === 'number') return Number.isFinite(s) ? s : undefined\n if (typeof s === 'object' && 'score' in s) {\n const raw = (s as Record<string, unknown>)['score']\n return typeof raw === 'number' && Number.isFinite(raw) ? raw : undefined\n }\n return undefined\n}\n\n/**\n * Builds a minimal `TrajectoryLogger` that ignores everything except\n * `kind: 'cost'` events and accumulates their `total_usd` into a running\n * total, read back via `total()` after the case finishes.\n */\nfunction create_cost_tracker(): {\n readonly logger: TrajectoryLogger\n readonly total: () => number\n} {\n let total = 0\n return {\n total: () => total,\n logger: {\n record: (event: TrajectoryEvent) => {\n if (event.kind !== 'cost') return\n const e: Record<string, unknown> = event\n const value = e['total_usd']\n if (typeof value === 'number' && Number.isFinite(value)) total += value\n },\n start_span: (name) => `cost-tracker:${name}`,\n end_span: () => {},\n },\n }\n}\n\n/**\n * Runs `fn` over `items` with at most `limit` calls in flight, preserving\n * input order in the results.\n *\n * Uses a shared-index worker pool: each of the `limit` workers claims the\n * next unclaimed index and writes its result into that slot, so completion\n * order never reorders the output.\n *\n * `abort` is re-checked before each claim, so a signal that fires mid-run\n * halts scheduling at the queue rather than only cancelling work already in\n * flight. The full fan-out path has no queue to halt: every item is already\n * running, so the caller re-checks the signal before reading the results.\n */\nasync function run_with_concurrency<t, r>(\n items: ReadonlyArray<t>,\n limit: number,\n fn: (item: t) => Promise<r>,\n abort?: AbortSignal,\n): Promise<r[]> {\n if (items.length === 0) return []\n if (limit >= items.length) {\n return Promise.all(items.map((it) => fn(it)))\n }\n const results: r[] = Array.from({ length: items.length })\n let next = 0\n const worker = async (): Promise<void> => {\n while (true) {\n throw_if_aborted(abort)\n const idx = next\n next += 1\n if (idx >= items.length) return\n const item = items[idx]\n if (item === undefined) continue\n // oxlint-disable-next-line no-await-in-loop\n results[idx] = await fn(item)\n }\n }\n const workers: Promise<void>[] = []\n for (let i = 0; i < limit; i += 1) workers.push(worker())\n await Promise.all(workers)\n return results\n}\n\n/**\n * Clamps the requested concurrency to a positive integer, defaulting to full\n * fan-out (one worker per case) when unset or invalid.\n */\nfunction resolve_concurrency(value: number | undefined, n_cases: number): number {\n if (value === undefined) return Math.max(1, n_cases)\n if (!Number.isFinite(value) || value <= 0) return Math.max(1, n_cases)\n return Math.max(1, Math.floor(value))\n}\n\n/**\n * Picks a human-readable name for the report: the flow's `display_name`\n * config when set, else its step id or kind.\n */\nfunction describe_flow_name<I, O>(flow: Step<I, O>): string {\n const display = flow.config?.['display_name']\n if (typeof display === 'string' && display.length > 0) return display\n return flow.id ?? flow.kind ?? 'flow'\n}\n\n/**\n * Short random base36 suffix to keep default run ids unique across\n * same-millisecond starts.\n */\nfunction random_suffix(): string {\n return Math.random().toString(36).slice(2, 8)\n}\n","/**\n * Stock judges for `bench`.\n *\n * A `Judge<I, O, S>` is a `Step<{ input, output, meta }, S>`: just a step\n * that scores a flow's input/output/metadata triple. Returning `undefined`\n * (or throwing) means the judge abstains; bench records the absence as a\n * missing key in `case.scores` and excludes the case from that judge's\n * `mean_scores` denominator.\n *\n * judge_equals: strict equality vs. `meta.expected`\n * judge_with: wrap a user-supplied scoring function\n * judge_llm: prompt a model + parse the rubric score out of the reply\n *\n * `judge_llm` is engine-agnostic: callers pass their already-configured\n * model_call step (`Step<string, string>`), which keeps composites decoupled\n * from engine. The user-facing wiring lives in their own code.\n */\n\nimport { compose, sequence, step } from '#core'\nimport type { Step } from '#core'\nimport { normalize_score } from './bench.js'\nimport type { Judge, JudgeArgs, Score } from './bench.js'\n\n/**\n * Narrows an unknown value to a plain string-keyed record (non-null object,\n * not an array).\n */\nexport function is_record(v: unknown): v is Record<string, unknown> {\n return v !== null && typeof v === 'object' && !Array.isArray(v)\n}\n\n/**\n * Structural equality over JSON-shaped values: primitives by `===`, arrays\n * element-wise, records key-by-key with sorted keys. Anything else (class\n * instances, functions) only compares equal by reference.\n */\nexport function deep_equal(a: unknown, b: unknown): boolean {\n if (a === b) return true\n // null, primitives, and array/record mismatches all fall through to the\n // Array.isArray and is_record guards below, so no separate null/typeof\n // pre-checks are needed.\n if (Array.isArray(a) || Array.isArray(b)) return arrays_equal(a, b)\n if (!is_record(a) || !is_record(b)) return false\n return records_equal(a, b)\n}\n\n/**\n * Element-wise deep equality once at least one side is an array: both must be\n * arrays of the same length with every index equal.\n */\nfunction arrays_equal(a: unknown, b: unknown): boolean {\n if (!Array.isArray(a) || !Array.isArray(b)) return false\n if (a.length !== b.length) return false\n for (let i = 0; i < a.length; i += 1) {\n if (!deep_equal(a[i], b[i])) return false\n }\n return true\n}\n\n/**\n * Key-by-key deep equality over two records: same sorted key sets, and each\n * value deep-equal under the shared key.\n */\nfunction records_equal(a: Record<string, unknown>, b: Record<string, unknown>): boolean {\n const ak = Object.keys(a).toSorted()\n const bk = Object.keys(b).toSorted()\n if (ak.length !== bk.length) return false\n for (let i = 0; i < ak.length; i += 1) {\n const ka = ak[i]\n const kb = bk[i]\n if (ka === undefined || kb === undefined || ka !== kb) return false\n if (!deep_equal(a[ka], b[kb])) return false\n }\n return true\n}\n\n/**\n * Judge that scores 1 when the output deep-equals `meta.expected`, 0\n * otherwise. Abstains when the case has no `meta` or no `expected` key.\n */\nexport function judge_equals<O>(): Judge<unknown, O> {\n return step('judge_equals', (args: JudgeArgs<unknown, O>): Score | undefined => {\n if (args.meta === undefined) return undefined\n if (!('expected' in args.meta)) return undefined\n const expected = args.meta['expected']\n const matches = deep_equal(args.output, expected)\n return { score: matches ? 1 : 0, reason: matches ? 'match' : 'mismatch' }\n })\n}\n\nexport type JudgeWithFn<I, O> = (\n args: JudgeArgs<I, O>,\n) => number | Score | undefined | Promise<number | Score | undefined>\n\n/**\n * Wraps a plain scoring function as a Judge. The function may return a bare\n * number, a `Score`, or `undefined` to abstain; the result is normalized\n * via `normalize_score`.\n */\nexport function judge_with<I, O>(fn: JudgeWithFn<I, O>): Judge<I, O> {\n return step('judge_with', async (args: JudgeArgs<I, O>): Promise<Score | undefined> => {\n const raw = await fn(args)\n return normalize_score(raw)\n })\n}\n\nexport type JudgeLlmConfig = {\n readonly model: Step<string, string>\n readonly rubric: string\n readonly scale?: { readonly min: number; readonly max: number }\n}\n\n/**\n * Judge that prompts a model with a rubric and parses the score out of the\n * reply.\n *\n * Built as a three-step sequence: render the rubric prompt, run the\n * caller-supplied model step, parse the JSON score from the reply. An\n * unparseable reply makes the judge abstain rather than fail the case.\n */\nexport function judge_llm<I, O>(config: JudgeLlmConfig): Judge<I, O> {\n const scale = config.scale ?? { min: 0, max: 1 }\n const build_prompt = step('judge_llm_build_prompt', (args: JudgeArgs<I, O>): string =>\n render_prompt(config.rubric, scale, args),\n )\n const parse = step('judge_llm_parse', (reply: string): Score | undefined =>\n parse_score(reply, scale),\n )\n const inner = sequence([build_prompt, config.model, parse])\n return compose('judge_llm', inner)\n}\n\n/**\n * Renders the evaluator prompt: rubric, required JSON reply shape with the\n * score scale, and the case's input/output serialized as JSON.\n */\nexport function render_prompt<I, O>(\n rubric: string,\n scale: { min: number; max: number },\n args: JudgeArgs<I, O>,\n): string {\n return [\n `You are an evaluator. Score the model output against the rubric below.`,\n ``,\n `Rubric:`,\n rubric,\n ``,\n `Return a single line of JSON with exactly two keys: {\"score\": <number ${String(scale.min)}..${String(scale.max)}>, \"reason\": \"<short>\"}.`,\n `Do not include prose outside the JSON.`,\n ``,\n `Input:`,\n JSON.stringify(args.input),\n ``,\n `Output:`,\n JSON.stringify(args.output),\n ].join('\\n')\n}\n\n/**\n * Parses a model reply into a `Score`, or `undefined` (abstain) when no\n * valid JSON object with a finite numeric `score` can be extracted.\n *\n * Tolerates prose around the JSON via `extract_json_object` and clamps the\n * score into the configured scale rather than rejecting out-of-range values.\n */\nexport function parse_score(\n reply: string,\n scale: { min: number; max: number },\n): Score | undefined {\n const trimmed = reply.trim()\n const candidate = extract_json_object(trimmed)\n if (candidate === undefined) return undefined\n let parsed: unknown\n try {\n parsed = JSON.parse(candidate)\n } catch {\n return undefined\n }\n if (!is_record(parsed)) return undefined\n const raw_score = parsed['score']\n if (typeof raw_score !== 'number' || !Number.isFinite(raw_score)) return undefined\n const clamped = Math.max(scale.min, Math.min(scale.max, raw_score))\n const raw_reason = parsed['reason']\n const reason = typeof raw_reason === 'string' ? raw_reason : undefined\n return reason === undefined ? { score: clamped } : { score: clamped, reason }\n}\n\n/**\n * Pulls the outermost `{...}` slice out of a reply that may wrap the JSON\n * in prose or code fences. Returns the text as-is when it already starts\n * with `{`.\n */\nexport function extract_json_object(text: string): string | undefined {\n if (text.startsWith('{')) return text\n const start = text.indexOf('{')\n const end = text.lastIndexOf('}')\n if (start === -1 || end === -1 || end < start) return undefined\n return text.slice(start, end + 1)\n}\n","/**\n * regression_compare: diff two BenchReports for regressions.\n *\n * The contract: given a `current` report and a `baseline` report, produce a\n * `RegressionReport` whose `ok` flag is false when any tracked metric got\n * worse beyond a threshold. The function does NOT short-circuit on first\n * failure; every metric and every per-case delta is computed so callers can\n * print or assert against the whole report.\n *\n * Tracked metrics:\n * - pass_rate (any drop is a regression by default)\n * - mean_scores.<name> (per judge; any drop is a regression by default)\n * - total_cost_usd (a relative cost increase above cost_threshold\n * counts as a regression; default 10%)\n *\n * Baselines are plain JSON, written via `write_baseline` and read via\n * `read_baseline`. They live wherever the caller decides, typically\n * `bench/<flow>/baseline.json` checked into git.\n */\n\nimport { mkdir, readFile, writeFile } from 'node:fs/promises'\nimport { dirname } from 'node:path'\nimport type { BenchReport, CaseResult } from './bench.js'\n\nexport type RegressionDelta = {\n readonly metric: string\n readonly baseline: number\n readonly current: number\n readonly delta: number\n readonly is_regression: boolean\n}\n\nexport type PerCaseDelta = {\n readonly case_id: string\n readonly baseline?: CaseResult\n readonly current?: CaseResult\n readonly score_deltas: Record<string, number>\n readonly cost_delta: number\n readonly is_regression: boolean\n}\n\nexport type RegressionReport = {\n readonly ok: boolean\n readonly deltas: ReadonlyArray<RegressionDelta>\n readonly per_case: ReadonlyArray<PerCaseDelta>\n}\n\nexport type RegressionCompareOptions = {\n readonly score_threshold?: number\n readonly cost_threshold?: number\n}\n\n/**\n * Diff a current `BenchReport` against a baseline.\n *\n * Compares `pass_rate`, each judge's mean score, and total cost, then every\n * individual case. Score metrics regress on any drop beyond\n * `score_threshold` (default 0); cost regresses on a relative increase above\n * `cost_threshold` (default 10%).\n */\nexport function regression_compare(\n current: BenchReport,\n baseline: BenchReport,\n options: RegressionCompareOptions = {},\n): RegressionReport {\n const score_threshold = options.score_threshold ?? 0\n const cost_threshold = options.cost_threshold ?? 0.1\n\n const deltas: RegressionDelta[] = []\n\n const pass_delta = current.summary.pass_rate - baseline.summary.pass_rate\n deltas.push({\n metric: 'pass_rate',\n baseline: baseline.summary.pass_rate,\n current: current.summary.pass_rate,\n delta: pass_delta,\n is_regression: pass_delta < -score_threshold,\n })\n\n const judge_names = collect_judge_names(current, baseline)\n for (const name of judge_names) {\n const c = current.summary.mean_scores[name] ?? 0\n const b = baseline.summary.mean_scores[name] ?? 0\n const d = c - b\n deltas.push({\n metric: `mean_scores.${name}`,\n baseline: b,\n current: c,\n delta: d,\n is_regression: d < -score_threshold,\n })\n }\n\n const cb = baseline.summary.total_cost_usd\n const cc = current.summary.total_cost_usd\n const cost_delta = cc - cb\n const cost_ratio = cb === 0 ? (cc > 0 ? Infinity : 0) : cost_delta / cb\n deltas.push({\n metric: 'total_cost_usd',\n baseline: cb,\n current: cc,\n delta: cost_delta,\n is_regression: cost_ratio > cost_threshold,\n })\n\n const per_case = compute_per_case(current, baseline, score_threshold, cost_threshold)\n const ok = !deltas.some((d) => d.is_regression) && !per_case.some((c) => c.is_regression)\n\n return { ok, deltas, per_case }\n}\n\n/**\n * Compute per-case deltas across the union of case ids in both reports.\n *\n * Cases present on only one side still appear (missing side scores count as\n * 0). A case regresses when a judge score drops beyond the threshold, its\n * cost rises beyond the relative threshold, or it flips from ok to failing.\n */\nfunction compute_per_case(\n current: BenchReport,\n baseline: BenchReport,\n score_threshold: number,\n cost_threshold: number,\n): PerCaseDelta[] {\n const by_id_current = index_by_case_id(current.cases)\n const by_id_baseline = index_by_case_id(baseline.cases)\n const all_ids = new Set<string>([...by_id_current.keys(), ...by_id_baseline.keys()])\n\n const out: PerCaseDelta[] = []\n for (const id of all_ids) {\n const c = by_id_current.get(id)\n const b = by_id_baseline.get(id)\n const { score_deltas, any_regression } = compute_score_deltas(c, b, score_threshold)\n const { cost_delta, is_regression: cost_regression } = compute_cost_regression(\n c,\n b,\n cost_threshold,\n )\n const ok_regression = b?.ok === true && c?.ok !== true\n out.push({\n case_id: id,\n ...(b !== undefined ? { baseline: b } : {}),\n ...(c !== undefined ? { current: c } : {}),\n score_deltas,\n cost_delta,\n is_regression: any_regression || cost_regression || ok_regression,\n })\n }\n return out\n}\n\n/**\n * Compute per-judge score deltas for one case pair across the union of judge\n * names on both sides (a missing side scores 0), flagging a regression when\n * any judge's score drops beyond the threshold.\n */\nfunction compute_score_deltas(\n c: CaseResult | undefined,\n b: CaseResult | undefined,\n score_threshold: number,\n): { score_deltas: Record<string, number>; any_regression: boolean } {\n const score_deltas: Record<string, number> = {}\n let any_regression = false\n const judge_names = new Set<string>([\n ...Object.keys(c?.scores ?? {}),\n ...Object.keys(b?.scores ?? {}),\n ])\n for (const name of judge_names) {\n const delta = score_value(c?.scores[name]) - score_value(b?.scores[name])\n score_deltas[name] = delta\n if (delta < -score_threshold) any_regression = true\n }\n return { score_deltas, any_regression }\n}\n\n/**\n * Compute the cost delta for one case pair and whether it regressed. With a\n * positive baseline cost, a relative rise beyond `cost_threshold` regresses;\n * with a zero baseline, any positive current cost regresses (unless the\n * threshold is Infinity). A missing side counts as 0.\n */\nfunction compute_cost_regression(\n c: CaseResult | undefined,\n b: CaseResult | undefined,\n cost_threshold: number,\n): { cost_delta: number; is_regression: boolean } {\n const baseline_cost = b?.cost_usd ?? 0\n const current_cost = c?.cost_usd ?? 0\n const cost_delta = current_cost - baseline_cost\n const is_regression =\n baseline_cost > 0\n ? cost_delta / baseline_cost > cost_threshold\n : current_cost > 0 && baseline_cost === 0 && cost_threshold < Infinity\n return { cost_delta, is_regression }\n}\n\n/**\n * Extract a finite numeric score from a raw score entry.\n *\n * Accepts a bare number or an object with a numeric `score` field; anything\n * else (missing, NaN, non-numeric) counts as 0 so deltas stay well-defined.\n */\nfunction score_value(s: unknown): number {\n if (s === undefined || s === null) return 0\n if (typeof s === 'number') return Number.isFinite(s) ? s : 0\n if (typeof s === 'object' && 'score' in s) {\n const v = (s as Record<string, unknown>)['score']\n return typeof v === 'number' && Number.isFinite(v) ? v : 0\n }\n return 0\n}\n\n/**\n * Index case results by their `case_id` for pairwise lookup.\n */\nfunction index_by_case_id<I, O, S>(\n cases: ReadonlyArray<CaseResult<I, O, S>>,\n): Map<string, CaseResult<I, O, S>> {\n const m = new Map<string, CaseResult<I, O, S>>()\n for (const c of cases) m.set(c.case_id, c)\n return m\n}\n\n/**\n * Union the judge names appearing in either report, sorted for stable output.\n */\nfunction collect_judge_names(a: BenchReport, b: BenchReport): string[] {\n const names = new Set<string>([\n ...Object.keys(a.summary.mean_scores),\n ...Object.keys(b.summary.mean_scores),\n ])\n return [...names].toSorted()\n}\n\n/**\n * Read and validate a baseline `BenchReport` from a JSON file.\n *\n * Validation is structural (required fields present), so a hand-edited or\n * truncated baseline fails loudly with the offending path in the message.\n */\nexport async function read_baseline(path: string): Promise<BenchReport> {\n const text = await readFile(path, 'utf8')\n const parsed: unknown = JSON.parse(text)\n validate_report(parsed, path)\n return parsed\n}\n\n/**\n * Write a `BenchReport` as pretty-printed JSON, creating parent directories.\n */\nexport async function write_baseline(path: string, report: BenchReport): Promise<void> {\n await mkdir(dirname(path), { recursive: true })\n await writeFile(path, `${JSON.stringify(report, null, 2)}\\n`, 'utf8')\n}\n\n/**\n * Assert that parsed JSON has the structural shape of a `BenchReport`.\n */\nfunction validate_report(value: unknown, path: string): asserts value is BenchReport {\n if (value === null || typeof value !== 'object') {\n throw new Error(`baseline at ${path} is not an object`)\n }\n const v = value as Partial<BenchReport>\n if (typeof v.flow_name !== 'string' || typeof v.run_id !== 'string') {\n throw new Error(`baseline at ${path} missing flow_name/run_id`)\n }\n if (!Array.isArray(v.cases) || typeof v.summary !== 'object' || v.summary === null) {\n throw new Error(`baseline at ${path} missing cases/summary`)\n }\n}\n","/**\n * model_call: the single sanctioned bridge between the composition and\n * engine layers.\n *\n * This is the only file under `src/` permitted to import value symbols from\n * both `core` and `engine` (enforced by the model-call-is-sole-bridge\n * ast-grep rule in `rules/`).\n *\n * The returned Step auto-threads ctx.abort, ctx.trajectory, and, only when\n * run.stream is driving, an on_chunk forwarder that records each chunk as a\n * `model_chunk` trajectory event. Callers cannot override these: the\n * composition layer owns cancellation and trajectory plumbing. Cost events\n * flow out via ctx.trajectory per the engine's own emission rules.\n */\n\nimport { createHash } from 'node:crypto'\nimport { aborted_error, step } from '#core'\nimport type { RunContext, Step, TrajectoryLogger } from '#core'\nimport type {\n EffortLevel,\n Engine,\n GenerateOptions,\n GenerateResult,\n Message,\n PrepareStepHook,\n RetryPolicy,\n Tool,\n ToolApprovalHandler,\n} from '#engine'\nimport type { ToolSchema } from '#schema'\n\nexport type ModelCallInput = string | ReadonlyArray<Message>\n\nexport type ModelCallConfig<T = string, projected = GenerateResult<T>> = {\n readonly engine: Engine\n /**\n * Model id, sent to the provider verbatim (there is no alias layer).\n * Optional: if omitted, the engine's `defaults.model` is used. Errors at\n * call time if neither is set.\n */\n readonly model?: string\n /**\n * Transport for the model: `anthropic` | `claude_cli` | `openrouter` | ...\n * Optional: if omitted, the engine's `defaults.provider` (or its sole\n * configured provider) is used.\n */\n readonly provider?: string\n readonly id?: string\n readonly system?: string\n readonly tools?: ReadonlyArray<Tool>\n readonly schema?: ToolSchema<T>\n readonly effort?: EffortLevel\n readonly temperature?: number\n readonly max_tokens?: number\n readonly top_p?: number\n readonly max_steps?: number\n /**\n * Per-turn wall-clock budget in milliseconds, forwarded to the engine.\n * See `GenerateOptions.turn_timeout_ms`.\n */\n readonly turn_timeout_ms?: number\n /**\n * Per-turn message hook, forwarded to the engine. See\n * `GenerateOptions.prepare_step`.\n */\n readonly prepare_step?: PrepareStepHook\n readonly provider_options?: Record<string, unknown>\n readonly retry_policy?: RetryPolicy\n readonly tool_error_policy?: 'feed_back' | 'throw'\n readonly schema_repair_attempts?: number\n readonly tool_call_repair_attempts?: number\n readonly max_tool_calls_per_step?: number\n readonly on_tool_approval?: ToolApprovalHandler\n /**\n * Map the `GenerateResult` envelope into the step's output at the source.\n * The projection runs inside the model_call step itself, so `describe` and\n * the trajectory gain no wrapper node. Omitted, the envelope is the output.\n * `model_step` is this option preset to `(r) => r.content`.\n */\n readonly project?: (r: GenerateResult<T>) => projected\n}\n\n/**\n * Wrap the run's trajectory so the engine's own spans (engine.generate and its\n * step spans) nest under the model_call step rather than floating. The wrapper\n * keeps a private span stack seeded with the model_call step's id, so nesting\n * is correct and concurrency-safe even when several model_calls run together\n * under `parallel`/`map` (each invocation builds its own wrapper). A\n * caller-supplied `parent_span_id` is never overridden.\n */\nfunction engine_trajectory(\n inner: TrajectoryLogger,\n root_parent: string | undefined,\n): TrajectoryLogger {\n const stack: string[] = root_parent !== undefined ? [root_parent] : []\n return {\n record: (event) => {\n inner.record(event)\n },\n start_span: (name, meta) => {\n const has_parent = meta !== undefined && 'parent_span_id' in meta\n const parent = stack.length > 0 ? stack[stack.length - 1] : undefined\n const next_meta =\n has_parent || parent === undefined ? meta : { ...meta, parent_span_id: parent }\n const id = inner.start_span(name, next_meta)\n stack.push(id)\n return id\n },\n end_span: (id, meta) => {\n inner.end_span(id, meta)\n const idx = stack.lastIndexOf(id)\n if (idx !== -1) stack.splice(idx, 1)\n },\n }\n}\n\n/**\n * Derive a short, stable hash from the call's model, provider, system\n * prompt, and tool/schema shape.\n *\n * Used to build a default step id when the caller doesn't supply `cfg.id`.\n */\nfunction stable_signature(input: {\n model: string | undefined\n provider: string | undefined\n system: string | undefined\n has_tools: boolean\n has_schema: boolean\n}): string {\n const payload = JSON.stringify({\n model: input.model ?? null,\n provider: input.provider ?? null,\n system: input.system ?? null,\n has_tools: input.has_tools,\n has_schema: input.has_schema,\n })\n return createHash('sha256').update(payload).digest('hex').slice(0, 8)\n}\n\nlet model_call_counter = 0\n\n/**\n * Build the default step id: `model_call:<hash>:<n>`. The instance counter\n * keeps two leaves built from identical configs distinguishable in describe\n * and the trajectory; the hash still identifies the call's shape.\n */\nfunction next_auto_id(input: Parameters<typeof stable_signature>[0]): string {\n model_call_counter += 1\n return `model_call:${stable_signature(input)}:${model_call_counter}`\n}\n\n/**\n * Copy `value` onto `target[key]` only when it is defined, so an absent optional\n * config field leaves the key off `GenerateOptions` rather than present-as-undefined.\n */\nfunction assign_if_present<T, K extends keyof T>(target: T, key: K, value: T[K]): void {\n if (value !== undefined) target[key] = value\n}\n\n/**\n * Translate `cfg` into a `GenerateOptions`, folding each supplied optional field\n * in via `assign_if_present`. `tools` (spread to a fresh array) and\n * `retry_policy` (renamed to `retry`) are the two fields that do not copy\n * straight across and stay explicit; the rest map name-for-name.\n */\nfunction build_generate_options<T, projected>(\n cfg: ModelCallConfig<T, projected>,\n prompt: Message[],\n ctx: RunContext,\n): GenerateOptions<T> {\n const opts: GenerateOptions<T> = {\n prompt,\n abort: ctx.abort,\n trajectory: engine_trajectory(ctx.trajectory, ctx.parent_span_id),\n }\n assign_if_present(opts, 'model', cfg.model)\n assign_if_present(opts, 'provider', cfg.provider)\n assign_if_present(opts, 'system', cfg.system)\n if (cfg.tools !== undefined) opts.tools = [...cfg.tools]\n assign_if_present(opts, 'schema', cfg.schema)\n assign_if_present(opts, 'effort', cfg.effort)\n assign_if_present(opts, 'temperature', cfg.temperature)\n assign_if_present(opts, 'max_tokens', cfg.max_tokens)\n assign_if_present(opts, 'top_p', cfg.top_p)\n assign_if_present(opts, 'turn_timeout_ms', cfg.turn_timeout_ms)\n assign_if_present(opts, 'prepare_step', cfg.prepare_step)\n assign_if_present(opts, 'max_steps', cfg.max_steps)\n assign_if_present(opts, 'provider_options', cfg.provider_options)\n if (cfg.retry_policy !== undefined) opts.retry = cfg.retry_policy\n assign_if_present(opts, 'tool_error_policy', cfg.tool_error_policy)\n assign_if_present(opts, 'schema_repair_attempts', cfg.schema_repair_attempts)\n assign_if_present(opts, 'tool_call_repair_attempts', cfg.tool_call_repair_attempts)\n assign_if_present(opts, 'max_tool_calls_per_step', cfg.max_tool_calls_per_step)\n assign_if_present(opts, 'on_tool_approval', cfg.on_tool_approval)\n return opts\n}\n\n/**\n * Build a `Step` that calls `cfg.engine.generate` with `cfg` translated into\n * `GenerateOptions`.\n *\n * Threads `ctx.abort` and `ctx.trajectory` (nested under the model_call\n * step's own span) into every call, and, when `run.stream` is driving,\n * records each chunk as a `model_chunk` trajectory event. `cfg.project`\n * maps the `GenerateResult` envelope into the step's output inside the same\n * step; omitted, the envelope is the output.\n */\nexport function model_call<T = string, projected = GenerateResult<T>>(\n cfg: ModelCallConfig<T, projected>,\n): Step<ModelCallInput, projected> {\n // Guard at construction so a wiring mistake (JS caller, spread gone wrong)\n // surfaces where it was made instead of as a bare property-read crash at\n // dispatch time.\n if (typeof cfg?.engine?.generate !== 'function') {\n throw new TypeError(\n 'model_call: cfg.engine is required (an Engine from create_engine or fascicle/testing)',\n )\n }\n const has_tools = Boolean(cfg.tools && cfg.tools.length > 0)\n const has_schema = cfg.schema !== undefined\n // When `project` is omitted, `projected` defaults to the envelope type, which\n // is what the identity fallback's cast records.\n // oxlint-disable-next-line typescript/no-unsafe-type-assertion\n const project = cfg.project ?? ((r: GenerateResult<T>) => r as unknown as projected)\n const step_id =\n cfg.id ??\n next_auto_id({\n model: cfg.model,\n provider: cfg.provider,\n system: cfg.system,\n has_tools,\n has_schema,\n })\n\n const describe_config: {\n model?: string\n provider?: string\n has_tools: boolean\n has_schema: boolean\n has_project: boolean\n has_prepare_step: boolean\n system?: string\n effort?: EffortLevel\n temperature?: number\n max_tokens?: number\n top_p?: number\n turn_timeout_ms?: number\n } = {\n has_tools,\n has_schema,\n has_project: cfg.project !== undefined,\n has_prepare_step: cfg.prepare_step !== undefined,\n }\n if (cfg.model !== undefined) describe_config.model = cfg.model\n if (cfg.provider !== undefined) describe_config.provider = cfg.provider\n if (cfg.system !== undefined) describe_config.system = cfg.system\n if (cfg.effort !== undefined) describe_config.effort = cfg.effort\n if (cfg.temperature !== undefined) describe_config.temperature = cfg.temperature\n if (cfg.max_tokens !== undefined) describe_config.max_tokens = cfg.max_tokens\n if (cfg.top_p !== undefined) describe_config.top_p = cfg.top_p\n if (cfg.turn_timeout_ms !== undefined) describe_config.turn_timeout_ms = cfg.turn_timeout_ms\n\n const inner = step<ModelCallInput, projected>(step_id, async (input, ctx) => {\n if (ctx.abort.aborted) {\n throw new aborted_error('aborted before model_call', {\n reason: { signal: 'abort' },\n step_index: 0,\n })\n }\n\n const prompt: Message[] =\n typeof input === 'string'\n ? [{ role: 'user', content: [{ type: 'text', text: input }] }]\n : [...input]\n\n const opts = build_generate_options(cfg, prompt, ctx)\n\n if (ctx.streaming) {\n opts.on_chunk = (chunk) => {\n // Record with kind preserved. ctx.emit would clobber kind to 'emit'\n // and bury the chunk, so stream consumers would have to un-nest a\n // generic event; recording keeps a clean top-level `model_chunk` event\n // (what docs/concepts.md already documents) carrying the StreamChunk.\n ctx.trajectory.record({ kind: 'model_chunk', step_id, chunk })\n }\n }\n\n return project(await cfg.engine.generate(opts))\n })\n\n return {\n id: inner.id,\n kind: inner.kind,\n run: (input, ctx) => inner.run(input, ctx),\n config: Object.freeze({ ...describe_config }),\n }\n}\n\n/**\n * model_step: `model_call` projected to its content.\n *\n * Returns a Step whose output is the model's final content (a `string`, or\n * the schema-validated value when `cfg.schema` is set) instead of the full\n * `GenerateResult` envelope. Use `model_step` when the flow only wants the\n * answer, keeping compositions at the `step, step, model_step, step` cadence;\n * drop to `model_call` when the caller needs usage, cost, tool calls, or\n * finish reason (or its `project` option, when the flow wants a slice of the\n * envelope mapped at the source).\n *\n * Implemented as `model_call` with `project` preset to `(r) => r.content`,\n * so the leaf is a single node in `describe` and the trajectory. Wrapping a\n * primitive into an app-shaped helper of your own is still the extension\n * pattern; this is its smallest instance.\n */\nexport function model_step<T = string>(\n cfg: Omit<ModelCallConfig<T>, 'project'>,\n): Step<ModelCallInput, T> {\n return model_call<T, T>({ ...cfg, project: (r) => r.content })\n}\n","/**\n * Env forwarding allowlist for CLI subprocesses.\n *\n * Useful when passing explicit env to `claude_cli` under api_key mode\n * (oauth mode inherits the parent env automatically), or whenever an\n * explicit, minimal allowlist is preferred over inheriting the full parent\n * env.\n */\nconst STANDARD_KEYS = ['PATH', 'HOME', 'SHELL', 'USER', 'LOGNAME', 'LANG', 'TMPDIR'] as const\n\n/**\n * Return the standard env vars a CLI subprocess needs to reach a user's\n * logged-in session: PATH, HOME, SHELL, USER, LOGNAME, LANG, TMPDIR.\n *\n * Keys absent from `process.env` are skipped.\n *\n * @example\n * provider_options: {\n * claude_cli: { env: forward_standard_env() },\n * }\n */\nexport function forward_standard_env(): Record<string, string> {\n const out: Record<string, string> = {}\n for (const key of STANDARD_KEYS) {\n const v = process.env[key]\n if (typeof v === 'string') out[key] = v\n }\n return out\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AA+CA,SAAS,uBACP,GAC6B;CAC7B,IAAI,EAAE,cAAc,KAAA,GAAW,OAAO,EAAE,OAAO,EAAE,MAAM;CACvD,IAAI,EAAE,mBAAmB,KAAA,GAAW,OAAO;EAAE,OAAO,EAAE;EAAO,OAAO,EAAE;CAAU;CAChF,OAAO;EAAE,OAAO,EAAE;EAAO,OAAO,EAAE;EAAW,UAAU,EAAE;CAAe;AAC1E;;;;;;;;;;;;;;;;;AAkBA,SAAgB,YACd,QACwB;CACxB,MAAM,EAAE,OAAO,UAAU,QAAQ,eAAe;CAIhD,MAAM,UAAU,OAAO,aAAa,MAAoC;CAsCxE,MAAM,QAAQ,KAA0B;EACtC,OAAO,WAAW,EAAE,MAAM;EAC1B,MApCuB,MAAM;GAC7B,MAAM,SAAS,KAAK,aAAa,MAAS,CAAC,CAAC;GAC5C,KAAK,mBAAmB,MAAS,uBAAuB,CAAC,CAAC;GAC1D;GACA,IAAI,CAAC,OAAO,IAAI,MAAM,cAAyB;IAG7C,OAAO;KAAE,GADK,KAAK;KACA;IAAU;GAC/B,CAAC;EACH,CA2BK;EACH,OA1BkD,MAAM;GACxD,MAAM,SAAS,KAAK,aAAa,MAAS,CAAC,CAAC;GAC5C,KAAK,sBAAsB,MAAS;IAClC,IAAI,EAAE,cAAc,KAAA,GAClB,MAAM,IAAI,MAAM,gDAAgD;IAElE,OAAO,EAAE;GACX,CAAC;GACD;GACA,IAAI,CAAC,OAAO,IAAI,MAAM,oBAA+C;IAEnE,MAAM,QAAQ,KAAK;IACnB,OAAO;KACL,MAAM,OAAO,eAAe;KAC5B,OAAO;MACL,GAAG;MACH,eAAe;MACf,gBAAgB,gBAAgB;KAClC;IACF;GACF,CAAC;EACH,CAKM;EACJ,SAAS,GAAG,EAAE,WAAW,aAAa;GACpC,IAAI,EAAE,cAAc,KAAA,GAClB,MAAM,IAAI,MAAM,2CAA2C;GAE7D,OAAO,QAAQ;IAAE,WAAW,EAAE;IAAW;IAAW;GAAO,CAAC;EAC9D;EACA;CACF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,eAAe,KAAK;AACpD;;;;;;;;;;;;;;;;;;;;AC3FA,SAAgB,UACd,QACoB;CACpB,MAAM,EAAE,SAAS,OAAO,eAAe;CAIvC,MAAM,UAAU,OAAO,aAAa,MAA0B;CAK9D,MAAM,aAAa,SAAS,OAAO;CAkBnC,MAAM,QAAQ,KAAsB;EAClC,OAAO,WAAW;GAAE;GAAO,SAAS,CAAC;EAAE;EACvC,MAlBuB,MAAM;GAC7B,MAAM,SAAS,KAAK,aAAa,MAAS,CAAC,CAAC;GAC5C,KAAK,kBAAkB,MAAS,EAAE,KAAK;GACvC;GACA,IAAI,CAAC,OAAO,IAAI,MAAM,YAA+B;IAGnD,OAAO;KAAE,GADK,KAAK;KACA;IAAQ;GAC7B,CAAC;EACH,CASK;EACH,OARkD,KAAK,UAAU,OAAU;GAC3E,MAAM,MAAM,EAAE,OAAO;GACrB,OAAO;EACT,EAKM;EACJ,SAAS,GAAG,EAAE,gBAAgB,QAAQ;GAAE,QAAQ,EAAE;GAAS;EAAU,CAAC;EACtE;CACF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,aAAa,KAAK;AAClD;;;;;;;;;;;;;;;;;;;;AC5CA,SAAgB,SACd,QACoB;CACpB,MAAM,SAAwB,OAAO,UAAU;CAC/C,MAAM,WAAW,OAAO;CACxB,MAAM,OAAO,OAAO,KAAK,OAAO,OAAO;CAIvC,MAAM,UAAU,OAAO,aAAa,MAAyB;CAwC7D,MAAM,QAAQ,SAAS,CArCP,SAAS,OAAO,OAqCF,GAnCjB,KAAK,eAAe,OAAO,YAA+B;EACrE,MAAM,SAAiC,CAAC;EACxC,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,QAAQ,QAAQ;GACtB,IAAI,UAAU,KAAA,GAAW;GACzB,OAAO,KAAK,MAAM,SAAS,OAAO,CAAC;EACrC;EAEA,IAAI,aAAiC,KAAA;EACrC,IAAI,eAAmC,KAAA;EACvC,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,UAAU,OAAO;GACvB,IAAI,YAAY,KAAA,GAAW;GAC3B,IAAI,iBAAiB,KAAA,GAAW;IAC9B,aAAa;IACb,eAAe;IACf;GACF;GAEA,IADe,WAAW,QAAQ,UAAU,eAAe,UAAU,cACzD;IACV,aAAa;IACb,eAAe;GACjB;EACF;EAEA,IAAI,eAAe,KAAA,GACjB,MAAM,IAAI,MAAM,wCAAwC;EAE1D,MAAM,SAAS,QAAQ;EACvB,IAAI,WAAW,KAAA,GACb,MAAM,IAAI,MAAM,uCAAuC;EAEzD,OAAO,QAAQ;GAAE;GAAQ;EAAO,CAAC;CACnC,CAEoC,CAAC,CAAC;CAEtC,OAAO,QAAQ,OAAO,QAAQ,YAAY,KAAK;AACjD;;;;;;AC7DA,MAAM,cAAc;AACpB,MAAM,WAAW;;;;;;;;;;;;;;;;;;;;;;AA0BjB,SAAgB,cACd,QACoB;CACpB,MAAM,EAAE,SAAS,OAAO,YAAY;CACpC,MAAM,SAAwB,OAAO,UAAU;CAC/C,MAAM,OAAO,OAAO,KAAK,OAAO;CAIhC,MAAM,UAAU,OAAO,aAAa,MAAqC;CAEzE,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,MAAM,6CAA6C;CAG/D,MAAM,UAAU,SAAS,OAAO;CAEhC,MAAM,YAAY,MAAM;EACtB,MAAM,UAAU,KAAK,gCAAgC,SAAkB,IAAI,CAAC;EAC5E,KAAK,gCAAgC,SAAkB,KAAK,KAAK;EACjE;EACA,IAAI,CAAC,QAAQ,IAAI,MAAM,WAAuC;GAG5D,OAAO;IAAE,IADI,KAAK,SACD,CAAC;IAAI;GAAO;EAC/B,CAAC;CAEH,CAAC;CAED,MAAM,WAAW,KACf,2BACC,YAAuD;EACtD,MAAM,MAAiB,CAAC;EACxB,KAAK,MAAM,MAAM,MACf,IAAI,MAAM,SAER,IAAI,KAAK;GAAE;GAAI,OAAO,QAAQ;EAAS,CAAC;EAG5C,OAAO;CACT,CACF;CAEA,MAAM,aAAa,IAAyD;EAC1E,QAAQ,UAAU;EAClB,IAAI;CACN,CAAC;CAED,MAAM,OAAO,IACX,CAAC,WAAW,IACX,MAAM,iBAA+D;EAEpE,MAAM,UAAU,KAAK;EACrB,MAAM,SAAiC,CAAC;EACxC,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,KAAK,MAAM,QAAQ,cAAc;GAC/B,OAAO,KAAK,MAAM,KAAK;GACvB,MAAM,OAAO,QAAQ,KAAK,MAAM;GAOhC,IALE,gBAAgB,KAAA,IACZ,OACA,WAAW,QACT,OAAO,cACP,OAAO,aACH;IACV,YAAY,KAAK;IACjB,cAAc;IACd,gBAAgB,KAAK;GACvB;EACF;EACA,IAAI,cAAc,KAAA,KAAa,kBAAkB,KAAA,GAC/C,MAAM,IAAI,MAAM,6CAA6C;EAE/D,MAAM,SAAS,QAAQ;EACvB,IAAI,WAAW,KAAA,GACb,MAAM,IAAI,MAAM,4CAA4C;EAE9D,OAAO,QAAQ;GAAE;GAAW;GAAQ;GAAe;EAAO,CAAC;CAC7D,CACF;CAEA,MAAM,QAAQ,MAAM;EAClB,MAAM,aAAa,OAAO;EAC1B;EACA;EACA;CAEF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,iBAAiB,KAAK;AACtD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC5FA,MAAM,kBAAkB,EACtB,aAAa;CACX,SAAS;CACT,QAAQ;CACR,WAAW,WAAoB,EAAE,MAAM;AACzC,EACF;;;;;;;;;;AAWA,SAAS,WAAiB,WAAuB,OAAoC;CAKnF,OAAO;EAAE,GAJO,KAAK,eAAe,OAAU,QAAoB;GAEhE,OAAO;IADsB,GAAG;IAAK,kBAAkB;GAC3C,EAAE,KAAK,WAAW,KAAK;EACrC,CACkB;EAAG,UAAU,CAAC,SAAS;CAAE;AAC7C;;;;;;;;;;;;;;;;AAiBA,SAAgB,KAAW,OAAmB,QAAmC;CAC/E,IAAI,MAAM,cAAc,MACtB,MAAM,IAAI,MAAM,iDAAiD;CAEnE,MAAM,EAAE,IAAI,OAAO,WAAW;CAE9B,MAAM,eAAe,WAAW,OAAO,EAAE,KAAK,QAAQ,KAAK,CAAC;CAC5D,MAAM,YAAY,UAAU,KAAA,IAAY,eAAe,WAAW,cAAc,KAAK;CAErF,MAAM,UAAU,IAAI,CAAC,QAAQ,IAAI,SAAS;EAIxC,OAAO,KAAK;CACd,CAAC;CAED,MAAM,WAAW,QAA6B;EAC5C;EACA,UAAU,CAAC;EACX,eAAe;EACf,eAAe;CACjB,CAAC;CAED,MAAM,OAAmB,MAAM;EAC7B,MAAM,UAAU,SAAS;EACzB,KAAK,oBAAoB,WAAe,WAAW,KAAA,IAAY,SAAS,OAAO,MAAM,CAAE;EACvF;CACF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,QAAQ,IAAI;AAC5C;;;;;;;;;;;;;AChDA,MAAM,YAAY;;;;;;;;;;;;;;;;;;;;AAgClB,SAAgB,QACd,QACoB;CACpB,MAAM,EAAE,MAAM,SAAS,OAAO,WAAW;CAIzC,MAAM,UAAU,OAAO,aAAa,MAAwB;CAC5D,MAAM,UAAU,OAAO,WAAW;CAClC,MAAM,sBAAsB,KAAK,IAAI,GAAG,OAAO,uBAAuB,CAAC;CACvE,MAAM,mBAAmB,KAAK,IAAI,GAAG,OAAO,oBAAoB,CAAC;CACjE,MAAM,EAAE,YAAY,kBAAkB,aAAa;CAEnD,MAAM,YAAsE,CAAC;CAC7E,KAAK,IAAI,IAAI,GAAG,IAAI,qBAAqB,KAAK,GAC5C,UAAU,IAAI,OAAO,CAAC,OAAO;CAG/B,MAAM,iBAAiB,cAIrB;EACA,MAAM;EACN,SAAS;EACT;EACA,UAAU,MAAM,EAAE;CACpB,CAAC;CASD,MAAM,gBAAgB,IACpB,CAAC,SAAS,IACT,MAAM,iBAA8B,QAA4B;EAG/D,MAAM,QADQ,KAAK,UACA,CAAC,QAAQ;EAC5B,KAAK,MAAM,WAAW,OAAO,KAAK,gBAAgB,MAAM,GAAG;GACzD,MAAM,SAAS,gBAAgB,OAAO;GACtC,IAAI,WAAW,KAAA,GAAW;GAC1B,IAAI,WAAW,OAAO;IACpB,MAAM;IACN;IACA,aAAa;IACb,OAAO,OAAO;IACd,UAAU,OAAO;IACjB,GAAI,OAAO,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ,OAAO,OAAO;GACjE,CAAC;EACH;EACA,MAAM,IAAI,gBAAgB;EAC1B,OAAO;GACL,GAAG;GACH,WAAW;IAAE,GAAG,EAAE;IAAW,aAAa,gBAAgB;GAAU;EACtE;CACF,CACF;CAEA,MAAM,aAAa,KACjB,uBACC,iBAAiE;EAChE,QAAQ,YAAY;EACpB,cAAc,YAAY;EAC1B,OAAO;EACP,uBAAuB;EACvB,eAAe,KAAK,IAAI;EACxB,SAAS,CAAC;EACV,SAAS,CAAC;CACZ,EACF;CAEA,MAAM,iBAAiB,KACrB,2BACC,GAAoB,QAA8B;EACjD,MAAM,QAAQ,EAAE,QAAQ;EACxB,IAAI,WAAW,OAAO;GACpB,MAAM;GACN;GACA,cAAc,EAAE;GAChB,eAAe,EAAE,QAAQ;EAC3B,CAAC;EACD,OAAO;GACL,QAAQ,EAAE;GACV,cAAc,EAAE;GAChB;GACA,SAAS,EAAE;EACb;CACF,CACF;CAEA,MAAM,gBAAgB,IACpB,CAAC,SAAS,IACT,MAAM,QAA4B,QAAyB;EAE1D,MAAM,QAAQ,KAAK;EACnB,MAAM,aAAa,MAAM,QAAQ;EACjC,MAAM,SAAS,OAAO,QAAQ,MAAM,eAAe;EACnD,MAAM,WAAW,OAAO,YAAY;EACpC,MAAM,eAAe,CAAC,YAAY,OAAO,WAAW,KAAA,IAChD,CACE,GAAG,MAAM,SACT;GACE,OAAO;GACP,aAAa,OAAO,UAAU;GAC9B,QAAQ,OAAO;EACjB,CACF,CAAC,CAAC,MAAM,CAAC,gBAAgB,IACzB,MAAM;EACV,IAAI,WAAW,OAAO;GACpB,MAAM,WAAW,mBAAmB;GACpC,OAAO;GACP,aAAa,OAAO,UAAU;GAC9B,OAAO,OAAO;GACd,aAAa,MAAM;GACnB,GAAI,WAAW,EAAE,OAAO,OAAO,QAAQ,MAAM,aAAa,IAAI,CAAC;GAC/D,GAAI,OAAO,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ,OAAO,OAAO;EACjE,CAAC;EACD,OAAO;GACL,QAAQ,WAAW,OAAO,UAAU,UAAU,MAAM;GACpD,cAAc,WAAW,OAAO,QAAQ,MAAM;GAC9C,OAAO;GACP,uBAAuB,WAAW,IAAI,MAAM,wBAAwB;GACpE,eAAe,MAAM;GACrB,SAAS,CACP,GAAG,MAAM,SACT;IAAE,OAAO;IAAY,QAAQ;IAAQ;GAAS,CAChD;GACA,SAAS;EACX;CACF,CACF;CAqDA,MAAM,QAAQ,MAAM;EAClB;EACA;EA5BiB,KAAyD;GAC1E,OAAO,MAAM;GACb,MA3BW,MAAM;IACjB,MAAM,WAAW,KAAK,qBAAqB,MAAuB,CAAC,CAAC;IACpE;IACA;IACA;IACA;GAEF,CAoBK;GACH,OAnBY,KACZ,kBACC,MAAkE;IACjE,IAAI,EAAE,yBAAyB,UAC7B,OAAO;KAAE,MAAM;KAAM,OAAO;MAAE,GAAG;MAAG,YAAY;KAAU;IAAE;IAE9D,IACE,qBAAqB,KAAA,KACrB,KAAK,IAAI,IAAI,EAAE,iBAAiB,kBAEhC,OAAO;KAAE,MAAM;KAAM,OAAO;MAAE,GAAG;MAAG,YAAY;KAAS;IAAE;IAE7D,OAAO;KAAE,MAAM;KAAO,OAAO;IAAE;GACjC,CAMI;GACJ,SAAS,OAAyB;IAChC,MAAM;KAAE,SAAS,EAAE;KAAQ,OAAO,EAAE;IAAa;IACjD,aAAa,EAAE;IACf,YAAY,EAAE,cAAc;IAC5B,SAAS,EAAE;GACb;GACA;EACF,CAkBW;EAhBS,KAClB,iBACC,QAA0B,QAAmB;GAC5C,IAAI,WAAW,OAAO;IACpB,MAAM;IACN,YAAY,OAAO;IACnB,aAAa,OAAO;IACpB,aAAa,OAAO,KAAK;GAC3B,CAAC;GACD,OAAO,QAAQ,MAAM;EACvB,CAOU;CAEZ,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,WAAW,KAAK;AAChD;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtOA,MAAM,qBAAqB;AAC3B,MAAM,WAAW;;;;AAejB,eAAe,WAAW,KAAgC;CACxD,MAAM,MAAgB,CAAC;CACvB,MAAM,UAAU,MAAM,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;CAC1D,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,OAAO,KAAK,KAAK,MAAM,IAAI;EACjC,IAAI,MAAM,YAAY,GACpB,IAAI,KAAK,GAAI,MAAM,WAAW,IAAI,CAAE;OAC/B,IAAI,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,QAAQ,GACvD,IAAI,KAAK,IAAI;CAEjB;CACA,OAAO;AACT;;;;;;;;AASA,eAAe,WAAW,WAAmB,KAA6C;CAExF,MAAM,SAAQ,MADQ,SAAS,WAAW,MAAM,EAAA,CAC1B,MAAM,IAAI;CAChC,MAAM,SAA4B,CAAC;CACnC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxC,MAAM,MAAM,MAAM;EAClB,IAAI,QAAQ,KAAA,KAAa,IAAI,KAAK,MAAM,IAAI;EAC5C,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,GAAG;EACzB,QAAQ;GACN,IAAI,WAAW,OAAO;IAAE,MAAM;IAAqB,MAAM;IAAW,MAAM,IAAI;GAAE,CAAC;GACjF;EACF;EACA,MAAM,SAAS,uBAAuB,MAAM;EAC5C,IAAI,OAAO,SACT,OAAO,KAAK,OAAO,IAAI;OAEvB,IAAI,WAAW,OAAO;GAAE,MAAM;GAAqB,MAAM;GAAW,MAAM,IAAI;EAAE,CAAC;CAErF;CACA,OAAO;AACT;;;;;AAMA,SAASA,mBAAiB,KAAuB;CAC/C,IAAI,CAAC,IAAI,MAAM,SAAS;CACxB,MAAM,SAAS,IAAI,MAAM;CACzB,IAAI,kBAAkB,eAAe,MAAM;CAC3C,MAAM,IAAI,cAAc,WAAW,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,CAAC;AAC3E;;;;;;;;AASA,eAAe,eACb,QACA,KACyC;CACzC,IAAI,OAAO,SAAS,UAAU,OAAO,OAAO;CAE5C,MAAM,aACJ,OAAO,SAAS,UAAU,CAAC,GAAG,OAAO,KAAK,KAAK,MAAM,WAAW,OAAO,GAAG,EAAA,CAAG,SAAS;CAExF,MAAM,MAAyB,CAAC;CAChC,KAAK,MAAM,KAAK,YAAY;EAC1B,mBAAiB,GAAG;EACpB,MAAM,SAAS,MAAM,WAAW,GAAG,GAAG;EACtC,IAAI,KAAK,GAAG,MAAM;CACpB;CACA,OAAO;AACT;;;;AAKA,SAAS,gBAAgB,QAA+D;CACtF,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,KAAK,MAAM;EACjB,IAAI,OAAO,OAAO,YAAY,CAAC,KAAK,IAAI,EAAE,GAAG;GAC3C,KAAK,IAAI,EAAE;GACX,IAAI,KAAK,EAAE;EACb;CACF;CACA,OAAO;AACT;;;;;;;;;AAUA,SAAgB,MACd,QAC+B;CAC/B,MAAM,EAAE,MAAM,QAAQ,UAAU,WAAW;CAC3C,MAAM,MAAM,OAAO,cAAc;CAEjC,MAAM,eAAe,KACnB,sBACA,OAAO,OAAgB,QAA2B;EAChD,MAAM,MAAM,MAAM,eAAe,QAAQ,GAAG;EAC5C,MAAM,WAAW,SAAS,IAAI,OAAO,MAAM,IAAI;EAC/C,MAAM,YAAY,SAAS,SAAS;EACpC,MAAM,SAAS,YAAY,SAAS,MAAM,GAAG,GAAG,IAAI;EACpD,IAAI,WACF,IAAI,WAAW,OAAO;GACpB,MAAM;GACN,WAAW,SAAS;GACpB,MAAM,OAAO;GACb,YAAY;EACd,CAAC;EAEH,OAAO;GACL,mBAAmB,OAAO;GAC1B,SAAS,gBAAgB,MAAM;GAC/B,QAAQ;GACR;EACF;CACF,CACF;CAEA,MAAM,cAAc,KAClB,sBACC,UAAgC;EAC/B,kBAAkB,SAAS,IAAI;EAC/B,QAAQ,KAAK;EACb,OAAO,KAAK;CACd,EACF;CAEA,MAAM,cAAc,IAClB,CAAC,QAAQ,IACR,MAAM,WAAc,QAAwB;EAE3C,MAAM,OAAO,KAAK;EAClB,IAAI,WAAW,OAAO;GACpB,MAAM;GACN,mBAAmB,KAAK;GACxB,SAAS,KAAK;EAChB,CAAC;EACD,OAAO;GACL;GACA,mBAAmB,KAAK;GACxB,SAAS,KAAK;EAChB;CACF,CACF;CAEA,MAAM,QAAQ,MAAM;EAClB,MAAM,UAAU,YAAY;EAC5B;EACA;EACA;CACF,CAAC;CAED,OAAO,QAAQ,OAAO,QAAQ,SAAS,KAAK;AAC9C;;;;;;;;;;;;;;;;;;;;;;;;;ACrNA,SAAgB,WACd,QACoB;CACpB,MAAM,aAAa,OAAO;CAC1B,MAAM,OAAO,OAAO,KAAK,OAAO,OAAO;CAIvC,MAAM,UAAU,OAAO,aAAa,MAA2B;CAE/D,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,MAAM,0CAA0C;CAmB5D,MAAM,QAAQ,SAAS,CAfP,SAAS,OAAO,OAeF,GAbT,KAAK,WAAW,OAAO,YAA+B;EACzE,IAAI,UAAoB,CAAC,GAAG,IAAI;EAChC,MAAM,UAA2B,CAAC;EAClC,IAAI,QAAQ;EAEZ,OAAO,QAAQ,SAAS,GAAG;GACzB,SAAS;GACT,UAAU,MAAM,WAAW,SAAS,SAAS,YAAY,OAAO,OAAO;EACzE;EAEA,OAAO,QAAQ;GAAE,QAAQ,UAAU,SAAS,OAAO;GAAG;EAAQ,CAAC;CACjE,CAE4C,CAAC,CAAC;CAE9C,OAAO,QAAQ,OAAO,QAAQ,cAAc,KAAK;AACnD;;;;;;AAOA,eAAe,WACb,SACA,SACA,SACA,OACA,SACmB;CACnB,MAAM,aAAuB,CAAC;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;EAC1C,MAAM,OAAO,QAAQ;EACrB,MAAM,OAAO,QAAQ,IAAI;EACzB,IAAI,SAAS,KAAA,GAAW;EACxB,IAAI,SAAS,KAAA,GAAW;GACtB,WAAW,KAAK,IAAI;GACpB;EACF;EACA,MAAM,QAAQ,QAAQ;EACtB,MAAM,QAAQ,QAAQ;EACtB,IAAI,UAAU,KAAA,KAAa,UAAU,KAAA,GACnC,MAAM,IAAI,MAAM,sCAAsC;EAGxD,MAAM,YAAY,MADC,QAAQ,OAAO,KAAK,MACZ,MAAM,OAAO;EACxC,QAAQ,KAAK;GAAE;GAAO;GAAM;GAAM;EAAU,CAAC;EAC7C,WAAW,KAAK,SAAS;CAC3B;CACA,OAAO;AACT;;;;;AAMA,SAAS,UAAa,SAAgC,SAA+B;CACnF,MAAM,WAAW,QAAQ;CACzB,IAAI,aAAa,KAAA,GACf,MAAM,IAAI,MAAM,uBAAuB;CAEzC,MAAM,SAAS,QAAQ;CACvB,IAAI,WAAW,KAAA,GACb,MAAM,IAAI,MAAM,yCAAyC;CAE3D,OAAO;AACT;;;;;;;;;;ACxHA,IAAa,sBAAb,cAAyC,MAAM;CAC7C,OAAgB;CAEhB;CACA;CACA,YAAY,SAAiB,YAAoB,SAAkB;EACjE,MACE,WACE,eAAe,QAAQ,gBAAgB,WAAW,uCACtD;EACA,KAAK,OAAO;EACZ,KAAK,UAAU;EACf,KAAK,aAAa;CACpB;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACwEA,eAAsB,MACpB,MACA,OACA,QACA,UAAwB,CAAC,GACM;CAC/B,MAAM,SAAS,QAAQ,UAAU,SAAS,OAAO,KAAK,IAAI,CAAC,EAAE,GAAG,cAAc;CAC9E,MAAM,YAAY,mBAAmB,IAAI;CACzC,MAAM,cAAc,oBAAoB,QAAQ,aAAa,MAAM,MAAM;CACzE,MAAM,0BAA0B,QAAQ,2BAA2B;CACnE,MAAM,cAAc,QAAQ,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO,QAAQ,MAAM;CAE9E,iBAAiB,QAAQ,KAAK;CAE9B,IAAI,QAAQ,mBAAmB,KAAA,GAC7B,MAAM,MAAM,QAAQ,gBAAgB,EAAE,WAAW,KAAK,CAAC;CAGzD,MAAM,gBAAgB,OAAO,QAAQ,MAAM;CAE3C,MAAM,UAAU,OAAO,OAAmD;EACxE,MAAM,EAAE,iBAAiB,aAAa,iBAAiB,mBAAmB,SAAS,GAAG,EAAE;EACxF,MAAM,MAAsB;GAAE;GAAa;GAAyB;EAAY;EAEhF,MAAM,QAAQ,KAAK,IAAI;EACvB,IAAI;EACJ,IAAI;EACJ,IAAI,KAAK;EACT,IAAI;GACF,SAAS,MAAM,IAAI,MAAM,GAAG,OAAO;IACjC,YAAY;IACZ;IACA,GAAG;GACL,CAAC;GACD,KAAK;EACP,SAAS,KAAK;GACZ,qBAAqB,KAAK,GAAG,EAAE;GAC/B,QAAQ,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;GACvD,KAAK;EACP;EAEA,MAAM,SACJ,MAAM,WAAW,KAAA,IACb,MAAM,WAAW,eAAe,kBAAkB,IAAI,MAAM,GAAG,KAAK,GAAG,EAAE,IACzE,CAAC;EAEP,MAAM,cAAc,KAAK,IAAI,IAAI;EACjC,MAAM,SAA8B;GAClC,SAAS,GAAG;GACZ;GACA,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;GACzC,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;GACvC;GACA;GACA,UAAU,aAAa,MAAM;GAC7B,GAAI,oBAAoB,KAAA,IAAY,EAAE,gBAAgB,IAAI,CAAC;EAC7D;EACA,IAAI,QAAQ,SAIV,QAAQ,QAAQ,MAA+B;EAEjD,OAAO;CACT;CAEA,MAAM,YAAY,MAAM,qBAAqB,OAAO,aAAa,SAAS,QAAQ,KAAK;CAKvF,iBAAiB,QAAQ,KAAK;CAI9B,OAAO;EACL;EACA;EACA,OAAO;EACP,SANc,UAAU,WAAW,cAAc,KAAK,CAAC,OAAO,CAAC,CAMzD;CACR;AACF;;;;;;;;AAmBA,SAAS,mBACP,SACA,SAKA;CACA,MAAM,kBACJ,QAAQ,mBAAmB,KAAA,IACvB,KAAA,IACA,KAAK,QAAQ,gBAAgB,GAAG,QAAQ,OAAO;CACrD,MAAM,QAA4B,CAAC;CACnC,IAAI,oBAAoB,KAAA,GACtB,MAAM,KAAK,kBAAkB,EAAE,aAAa,gBAAgB,CAAC,CAAC;CAEhE,IAAI,QAAQ,aAAa,KAAA,GACvB,MAAM,KAAK,YAAY,EAAE,KAAK,QAAQ,SAAS,CAAC,CAAC;CAEnD,MAAM,eAAe,oBAAoB;CAGzC,OAAO;EAAE;EAAiB,aADxB,MAAM,WAAW,IAAI,aAAa,SAAS,WAAW,GAAG,OAAO,aAAa,MAAM;EAC9C;CAAa;AACtD;;;;;AAMA,SAAS,kBAAwB,IAAkB,QAA4B;CAC7E,OAAO,GAAG,SAAS,KAAA,IACf;EAAE,OAAO,GAAG;EAAO;CAAO,IAC1B;EAAE,OAAO,GAAG;EAAO;EAAQ,MAAM,GAAG;CAAK;AAC/C;;;;;;;AAQA,eAAe,WACb,eACA,aACA,KACA,SAC4B;CAC5B,MAAM,SAA4B,CAAC;CACnC,KAAK,MAAM,CAAC,MAAM,UAAU,eAAe;EACzC,IAAI;EACJ,IAAI;GAEF,MAAM,MAAM,IAAI,OAAO,aAAa;IAClC,YAAY,IAAI;IAChB,yBAAyB,IAAI;IAC7B,GAAG,IAAI;GACT,CAAC;EACH,SAAS,KAAK;GACZ,qBAAqB,KAAK,OAAO;GACjC;EACF;EACA,MAAM,aAAa,gBAAgB,GAAG;EACtC,IAAI,eAAe,KAAA,GAAW;EAE9B,OAAO,QAAQ;CACjB;CACA,OAAO;AACT;;;;;;;;;;AAWA,SAAS,qBAAqB,KAAc,SAAuB;CACjE,IAAI,eAAe,eAAe,MAAM;CACxC,IAAI,eAAe,iBAAiB,MAAM,IAAI,oBAAoB,SAAS,IAAI,UAAU;AAC3F;;;;;;;;;AAUA,SAAS,iBAAiB,QAAuC;CAC/D,IAAI,QAAQ,YAAY,MAAM;CAC9B,MAAM,SAAkB,OAAO;CAC/B,MAAM,kBAAkB,QAAQ,SAAS,IAAI,cAAc,WAAW,EAAE,OAAO,CAAC;AAClF;;;;;;;;AASA,SAAS,UACP,OACA,aACc;CACd,MAAM,oBAAoB,MAAM,QAAQ,KAAK,MAAM,MAAM,EAAE,aAAa,CAAC;CACzE,MAAM,iBAAiB,MAAM,QAAQ,KAAK,MAAM,MAAM,EAAE,UAAU,CAAC;CACnE,MAAM,WAAW,MAAM,QAAQ,MAAM,EAAE,EAAE,CAAC,CAAC;CAC3C,MAAM,YAAY,MAAM,WAAW,IAAI,IAAI,WAAW,MAAM;CAC5D,MAAM,gBAAgB,MAAM,WAAW,IAAI,IAAI,iBAAiB,MAAM;CAEtE,MAAM,cAAsC,CAAC;CAC7C,KAAK,MAAM,QAAQ,aAAa;EAC9B,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,KAAK,MAAM,KAAK,OAAO;GACrB,MAAM,IAAI,eAAe,EAAE,OAAO,KAAK;GACvC,IAAI,MAAM,KAAA,GAAW;GACrB,OAAO;GACP,SAAS;EACX;EACA,IAAI,QAAQ,GAAG,YAAY,QAAQ,MAAM;CAC3C;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;;;;AAUA,SAAgB,gBAAgB,KAAiC;CAC/D,IAAI,QAAQ,KAAA,KAAa,QAAQ,MAAM,OAAO,KAAA;CAC9C,IAAI,OAAO,QAAQ,UACjB,OAAO,OAAO,SAAS,GAAG,IAAI,EAAE,OAAO,IAAI,IAAI,KAAA;CAEjD,IAAI,OAAO,QAAQ,YAAY,WAAW,KAAK;EAC7C,MAAM,IAAI;EACV,IAAI,OAAO,EAAE,UAAU,YAAY,CAAC,OAAO,SAAS,EAAE,KAAK,GAAG,OAAO,KAAA;EACrE,IAAI,EAAE,WAAW,KAAA,KAAa,OAAO,EAAE,WAAW,UAChD,OAAO,EAAE,OAAO,EAAE,MAAM;EAE1B,OAAO,EAAE,WAAW,KAAA,IAAY,EAAE,OAAO,EAAE,MAAM,IAAI;GAAE,OAAO,EAAE;GAAO,QAAQ,EAAE;EAAO;CAC1F;AAEF;;;;;AAMA,SAAS,eAAe,GAAgC;CACtD,IAAI,MAAM,KAAA,KAAa,MAAM,MAAM,OAAO,KAAA;CAC1C,IAAI,OAAO,MAAM,UAAU,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI,KAAA;CAC3D,IAAI,OAAO,MAAM,YAAY,WAAW,GAAG;EACzC,MAAM,MAAO,EAA8B;EAC3C,OAAO,OAAO,QAAQ,YAAY,OAAO,SAAS,GAAG,IAAI,MAAM,KAAA;CACjE;AAEF;;;;;;AAOA,SAAS,sBAGP;CACA,IAAI,QAAQ;CACZ,OAAO;EACL,aAAa;EACb,QAAQ;GACN,SAAS,UAA2B;IAClC,IAAI,MAAM,SAAS,QAAQ;IAE3B,MAAM,QAAQC,MAAE;IAChB,IAAI,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,GAAG,SAAS;GACpE;GACA,aAAa,SAAS,gBAAgB;GACtC,gBAAgB,CAAC;EACnB;CACF;AACF;;;;;;;;;;;;;;AAeA,eAAe,qBACb,OACA,OACA,IACA,OACc;CACd,IAAI,MAAM,WAAW,GAAG,OAAO,CAAC;CAChC,IAAI,SAAS,MAAM,QACjB,OAAO,QAAQ,IAAI,MAAM,KAAK,OAAO,GAAG,EAAE,CAAC,CAAC;CAE9C,MAAM,UAAe,MAAM,KAAK,EAAE,QAAQ,MAAM,OAAO,CAAC;CACxD,IAAI,OAAO;CACX,MAAM,SAAS,YAA2B;EACxC,OAAO,MAAM;GACX,iBAAiB,KAAK;GACtB,MAAM,MAAM;GACZ,QAAQ;GACR,IAAI,OAAO,MAAM,QAAQ;GACzB,MAAM,OAAO,MAAM;GACnB,IAAI,SAAS,KAAA,GAAW;GAExB,QAAQ,OAAO,MAAM,GAAG,IAAI;EAC9B;CACF;CACA,MAAM,UAA2B,CAAC;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,GAAG,QAAQ,KAAK,OAAO,CAAC;CACxD,MAAM,QAAQ,IAAI,OAAO;CACzB,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,OAA2B,SAAyB;CAC/E,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK,IAAI,GAAG,OAAO;CACnD,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GAAG,OAAO,KAAK,IAAI,GAAG,OAAO;CACrE,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;AACtC;;;;;AAMA,SAAS,mBAAyB,MAA0B;CAC1D,MAAM,UAAU,KAAK,SAAS;CAC9B,IAAI,OAAO,YAAY,YAAY,QAAQ,SAAS,GAAG,OAAO;CAC9D,OAAO,KAAK,MAAM,KAAK,QAAQ;AACjC;;;;;AAMA,SAAS,gBAAwB;CAC/B,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC;AAC9C;;;;;;;;;;;;;;;;;;;;;;;;ACnbA,SAAgB,UAAU,GAA0C;CAClE,OAAO,MAAM,QAAQ,OAAO,MAAM,YAAY,CAAC,MAAM,QAAQ,CAAC;AAChE;;;;;;AAOA,SAAgB,WAAW,GAAY,GAAqB;CAC1D,IAAI,MAAM,GAAG,OAAO;CAIpB,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG,OAAO,aAAa,GAAG,CAAC;CAClE,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO;CAC3C,OAAO,cAAc,GAAG,CAAC;AAC3B;;;;;AAMA,SAAS,aAAa,GAAY,GAAqB;CACrD,IAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,GAAG,OAAO;CACnD,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GACjC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;CAEtC,OAAO;AACT;;;;;AAMA,SAAS,cAAc,GAA4B,GAAqC;CACtF,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS;CACnC,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS;CACnC,IAAI,GAAG,WAAW,GAAG,QAAQ,OAAO;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK,GAAG;EACrC,MAAM,KAAK,GAAG;EACd,MAAM,KAAK,GAAG;EACd,IAAI,OAAO,KAAA,KAAa,OAAO,KAAA,KAAa,OAAO,IAAI,OAAO;EAC9D,IAAI,CAAC,WAAW,EAAE,KAAK,EAAE,GAAG,GAAG,OAAO;CACxC;CACA,OAAO;AACT;;;;;AAMA,SAAgB,eAAqC;CACnD,OAAO,KAAK,iBAAiB,SAAmD;EAC9E,IAAI,KAAK,SAAS,KAAA,GAAW,OAAO,KAAA;EACpC,IAAI,EAAE,cAAc,KAAK,OAAO,OAAO,KAAA;EACvC,MAAM,WAAW,KAAK,KAAK;EAC3B,MAAM,UAAU,WAAW,KAAK,QAAQ,QAAQ;EAChD,OAAO;GAAE,OAAO,UAAU,IAAI;GAAG,QAAQ,UAAU,UAAU;EAAW;CAC1E,CAAC;AACH;;;;;;AAWA,SAAgB,WAAiB,IAAoC;CACnE,OAAO,KAAK,cAAc,OAAO,SAAsD;EAErF,OAAO,gBAAgB,MADL,GAAG,IAAI,CACC;CAC5B,CAAC;AACH;;;;;;;;;AAgBA,SAAgB,UAAgB,QAAqC;CACnE,MAAM,QAAQ,OAAO,SAAS;EAAE,KAAK;EAAG,KAAK;CAAE;CAC/C,MAAM,eAAe,KAAK,2BAA2B,SACnD,cAAc,OAAO,QAAQ,OAAO,IAAI,CAC1C;CACA,MAAM,QAAQ,KAAK,oBAAoB,UACrC,YAAY,OAAO,KAAK,CAC1B;CAEA,OAAO,QAAQ,aADD,SAAS;EAAC;EAAc,OAAO;EAAO;CAAK,CACzB,CAAC;AACnC;;;;;AAMA,SAAgB,cACd,QACA,OACA,MACQ;CACR,OAAO;EACL;EACA;EACA;EACA;EACA;EACA,yEAAyE,OAAO,MAAM,GAAG,EAAE,IAAI,OAAO,MAAM,GAAG,EAAE;EACjH;EACA;EACA;EACA,KAAK,UAAU,KAAK,KAAK;EACzB;EACA;EACA,KAAK,UAAU,KAAK,MAAM;CAC5B,CAAC,CAAC,KAAK,IAAI;AACb;;;;;;;;AASA,SAAgB,YACd,OACA,OACmB;CAEnB,MAAM,YAAY,oBADF,MAAM,KACsB,CAAC;CAC7C,IAAI,cAAc,KAAA,GAAW,OAAO,KAAA;CACpC,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,SAAS;CAC/B,QAAQ;EACN;CACF;CACA,IAAI,CAAC,UAAU,MAAM,GAAG,OAAO,KAAA;CAC/B,MAAM,YAAY,OAAO;CACzB,IAAI,OAAO,cAAc,YAAY,CAAC,OAAO,SAAS,SAAS,GAAG,OAAO,KAAA;CACzE,MAAM,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;CAClE,MAAM,aAAa,OAAO;CAC1B,MAAM,SAAS,OAAO,eAAe,WAAW,aAAa,KAAA;CAC7D,OAAO,WAAW,KAAA,IAAY,EAAE,OAAO,QAAQ,IAAI;EAAE,OAAO;EAAS;CAAO;AAC9E;;;;;;AAOA,SAAgB,oBAAoB,MAAkC;CACpE,IAAI,KAAK,WAAW,GAAG,GAAG,OAAO;CACjC,MAAM,QAAQ,KAAK,QAAQ,GAAG;CAC9B,MAAM,MAAM,KAAK,YAAY,GAAG;CAChC,IAAI,UAAU,MAAM,QAAQ,MAAM,MAAM,OAAO,OAAO,KAAA;CACtD,OAAO,KAAK,MAAM,OAAO,MAAM,CAAC;AAClC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1IA,SAAgB,mBACd,SACA,UACA,UAAoC,CAAC,GACnB;CAClB,MAAM,kBAAkB,QAAQ,mBAAmB;CACnD,MAAM,iBAAiB,QAAQ,kBAAkB;CAEjD,MAAM,SAA4B,CAAC;CAEnC,MAAM,aAAa,QAAQ,QAAQ,YAAY,SAAS,QAAQ;CAChE,OAAO,KAAK;EACV,QAAQ;EACR,UAAU,SAAS,QAAQ;EAC3B,SAAS,QAAQ,QAAQ;EACzB,OAAO;EACP,eAAe,aAAa,CAAC;CAC/B,CAAC;CAED,MAAM,cAAc,oBAAoB,SAAS,QAAQ;CACzD,KAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,IAAI,QAAQ,QAAQ,YAAY,SAAS;EAC/C,MAAM,IAAI,SAAS,QAAQ,YAAY,SAAS;EAChD,MAAM,IAAI,IAAI;EACd,OAAO,KAAK;GACV,QAAQ,eAAe;GACvB,UAAU;GACV,SAAS;GACT,OAAO;GACP,eAAe,IAAI,CAAC;EACtB,CAAC;CACH;CAEA,MAAM,KAAK,SAAS,QAAQ;CAC5B,MAAM,KAAK,QAAQ,QAAQ;CAC3B,MAAM,aAAa,KAAK;CACxB,MAAM,aAAa,OAAO,IAAK,KAAK,IAAI,WAAW,IAAK,aAAa;CACrE,OAAO,KAAK;EACV,QAAQ;EACR,UAAU;EACV,SAAS;EACT,OAAO;EACP,eAAe,aAAa;CAC9B,CAAC;CAED,MAAM,WAAW,iBAAiB,SAAS,UAAU,iBAAiB,cAAc;CAGpF,OAAO;EAAE,IAFE,CAAC,OAAO,MAAM,MAAM,EAAE,aAAa,KAAK,CAAC,SAAS,MAAM,MAAM,EAAE,aAAa;EAE3E;EAAQ;CAAS;AAChC;;;;;;;;AASA,SAAS,iBACP,SACA,UACA,iBACA,gBACgB;CAChB,MAAM,gBAAgB,iBAAiB,QAAQ,KAAK;CACpD,MAAM,iBAAiB,iBAAiB,SAAS,KAAK;CACtD,MAAM,0BAAU,IAAI,IAAY,CAAC,GAAG,cAAc,KAAK,GAAG,GAAG,eAAe,KAAK,CAAC,CAAC;CAEnF,MAAM,MAAsB,CAAC;CAC7B,KAAK,MAAM,MAAM,SAAS;EACxB,MAAM,IAAI,cAAc,IAAI,EAAE;EAC9B,MAAM,IAAI,eAAe,IAAI,EAAE;EAC/B,MAAM,EAAE,cAAc,mBAAmB,qBAAqB,GAAG,GAAG,eAAe;EACnF,MAAM,EAAE,YAAY,eAAe,oBAAoB,wBACrD,GACA,GACA,cACF;EACA,MAAM,gBAAgB,GAAG,OAAO,QAAQ,GAAG,OAAO;EAClD,IAAI,KAAK;GACP,SAAS;GACT,GAAI,MAAM,KAAA,IAAY,EAAE,UAAU,EAAE,IAAI,CAAC;GACzC,GAAI,MAAM,KAAA,IAAY,EAAE,SAAS,EAAE,IAAI,CAAC;GACxC;GACA;GACA,eAAe,kBAAkB,mBAAmB;EACtD,CAAC;CACH;CACA,OAAO;AACT;;;;;;AAOA,SAAS,qBACP,GACA,GACA,iBACmE;CACnE,MAAM,eAAuC,CAAC;CAC9C,IAAI,iBAAiB;CACrB,MAAM,8BAAc,IAAI,IAAY,CAClC,GAAG,OAAO,KAAK,GAAG,UAAU,CAAC,CAAC,GAC9B,GAAG,OAAO,KAAK,GAAG,UAAU,CAAC,CAAC,CAChC,CAAC;CACD,KAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,QAAQ,YAAY,GAAG,OAAO,KAAK,IAAI,YAAY,GAAG,OAAO,KAAK;EACxE,aAAa,QAAQ;EACrB,IAAI,QAAQ,CAAC,iBAAiB,iBAAiB;CACjD;CACA,OAAO;EAAE;EAAc;CAAe;AACxC;;;;;;;AAQA,SAAS,wBACP,GACA,GACA,gBACgD;CAChD,MAAM,gBAAgB,GAAG,YAAY;CACrC,MAAM,eAAe,GAAG,YAAY;CACpC,MAAM,aAAa,eAAe;CAKlC,OAAO;EAAE;EAAY,eAHnB,gBAAgB,IACZ,aAAa,gBAAgB,iBAC7B,eAAe,KAAK,kBAAkB,KAAK,iBAAiB;CAC/B;AACrC;;;;;;;AAQA,SAAS,YAAY,GAAoB;CACvC,IAAI,MAAM,KAAA,KAAa,MAAM,MAAM,OAAO;CAC1C,IAAI,OAAO,MAAM,UAAU,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI;CAC3D,IAAI,OAAO,MAAM,YAAY,WAAW,GAAG;EACzC,MAAM,IAAK,EAA8B;EACzC,OAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;CAC3D;CACA,OAAO;AACT;;;;AAKA,SAAS,iBACP,OACkC;CAClC,MAAM,oBAAI,IAAI,IAAiC;CAC/C,KAAK,MAAM,KAAK,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC;CACzC,OAAO;AACT;;;;AAKA,SAAS,oBAAoB,GAAgB,GAA0B;CAKrE,OAAO,CAAC,mBAAG,IAJO,IAAY,CAC5B,GAAG,OAAO,KAAK,EAAE,QAAQ,WAAW,GACpC,GAAG,OAAO,KAAK,EAAE,QAAQ,WAAW,CACtC,CACe,CAAC,CAAC,CAAC,SAAS;AAC7B;;;;;;;AAQA,eAAsB,cAAc,MAAoC;CACtE,MAAM,OAAO,MAAM,SAAS,MAAM,MAAM;CACxC,MAAM,SAAkB,KAAK,MAAM,IAAI;CACvC,gBAAgB,QAAQ,IAAI;CAC5B,OAAO;AACT;;;;AAKA,eAAsB,eAAe,MAAc,QAAoC;CACrF,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9C,MAAM,UAAU,MAAM,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,KAAK,MAAM;AACtE;;;;AAKA,SAAS,gBAAgB,OAAgB,MAA4C;CACnF,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC,MAAM,IAAI,MAAM,eAAe,KAAK,kBAAkB;CAExD,MAAM,IAAI;CACV,IAAI,OAAO,EAAE,cAAc,YAAY,OAAO,EAAE,WAAW,UACzD,MAAM,IAAI,MAAM,eAAe,KAAK,0BAA0B;CAEhE,IAAI,CAAC,MAAM,QAAQ,EAAE,KAAK,KAAK,OAAO,EAAE,YAAY,YAAY,EAAE,YAAY,MAC5E,MAAM,IAAI,MAAM,eAAe,KAAK,uBAAuB;AAE/D;;;;;;;;;;;;;;;;;;;;;;;;;ACnLA,SAAS,kBACP,OACA,aACkB;CAClB,MAAM,QAAkB,gBAAgB,KAAA,IAAY,CAAC,WAAW,IAAI,CAAC;CACrE,OAAO;EACL,SAAS,UAAU;GACjB,MAAM,OAAO,KAAK;EACpB;EACA,aAAa,MAAM,SAAS;GAC1B,MAAM,aAAa,SAAS,KAAA,KAAa,oBAAoB;GAC7D,MAAM,SAAS,MAAM,SAAS,IAAI,MAAM,MAAM,SAAS,KAAK,KAAA;GAC5D,MAAM,YACJ,cAAc,WAAW,KAAA,IAAY,OAAO;IAAE,GAAG;IAAM,gBAAgB;GAAO;GAChF,MAAM,KAAK,MAAM,WAAW,MAAM,SAAS;GAC3C,MAAM,KAAK,EAAE;GACb,OAAO;EACT;EACA,WAAW,IAAI,SAAS;GACtB,MAAM,SAAS,IAAI,IAAI;GACvB,MAAM,MAAM,MAAM,YAAY,EAAE;GAChC,IAAI,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;EACrC;CACF;AACF;;;;;;;AAQA,SAAS,iBAAiB,OAMf;CACT,MAAM,UAAU,KAAK,UAAU;EAC7B,OAAO,MAAM,SAAS;EACtB,UAAU,MAAM,YAAY;EAC5B,QAAQ,MAAM,UAAU;EACxB,WAAW,MAAM;EACjB,YAAY,MAAM;CACpB,CAAC;CACD,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;AACtE;AAEA,IAAI,qBAAqB;;;;;;AAOzB,SAAS,aAAa,OAAuD;CAC3E,sBAAsB;CACtB,OAAO,cAAc,iBAAiB,KAAK,EAAE,GAAG;AAClD;;;;;AAMA,SAAS,kBAAwC,QAAW,KAAQ,OAAmB;CACrF,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO;AACzC;;;;;;;AAQA,SAAS,uBACP,KACA,QACA,KACoB;CACpB,MAAM,OAA2B;EAC/B;EACA,OAAO,IAAI;EACX,YAAY,kBAAkB,IAAI,YAAY,IAAI,cAAc;CAClE;CACA,kBAAkB,MAAM,SAAS,IAAI,KAAK;CAC1C,kBAAkB,MAAM,YAAY,IAAI,QAAQ;CAChD,kBAAkB,MAAM,UAAU,IAAI,MAAM;CAC5C,IAAI,IAAI,UAAU,KAAA,GAAW,KAAK,QAAQ,CAAC,GAAG,IAAI,KAAK;CACvD,kBAAkB,MAAM,UAAU,IAAI,MAAM;CAC5C,kBAAkB,MAAM,UAAU,IAAI,MAAM;CAC5C,kBAAkB,MAAM,eAAe,IAAI,WAAW;CACtD,kBAAkB,MAAM,cAAc,IAAI,UAAU;CACpD,kBAAkB,MAAM,SAAS,IAAI,KAAK;CAC1C,kBAAkB,MAAM,mBAAmB,IAAI,eAAe;CAC9D,kBAAkB,MAAM,gBAAgB,IAAI,YAAY;CACxD,kBAAkB,MAAM,aAAa,IAAI,SAAS;CAClD,kBAAkB,MAAM,oBAAoB,IAAI,gBAAgB;CAChE,IAAI,IAAI,iBAAiB,KAAA,GAAW,KAAK,QAAQ,IAAI;CACrD,kBAAkB,MAAM,qBAAqB,IAAI,iBAAiB;CAClE,kBAAkB,MAAM,0BAA0B,IAAI,sBAAsB;CAC5E,kBAAkB,MAAM,6BAA6B,IAAI,yBAAyB;CAClF,kBAAkB,MAAM,2BAA2B,IAAI,uBAAuB;CAC9E,kBAAkB,MAAM,oBAAoB,IAAI,gBAAgB;CAChE,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,WACd,KACiC;CAIjC,IAAI,OAAO,KAAK,QAAQ,aAAa,YACnC,MAAM,IAAI,UACR,uFACF;CAEF,MAAM,YAAY,QAAQ,IAAI,SAAS,IAAI,MAAM,SAAS,CAAC;CAC3D,MAAM,aAAa,IAAI,WAAW,KAAA;CAIlC,MAAM,UAAU,IAAI,aAAa,MAAyB;CAC1D,MAAM,UACJ,IAAI,MACJ,aAAa;EACX,OAAO,IAAI;EACX,UAAU,IAAI;EACd,QAAQ,IAAI;EACZ;EACA;CACF,CAAC;CAEH,MAAM,kBAaF;EACF;EACA;EACA,aAAa,IAAI,YAAY,KAAA;EAC7B,kBAAkB,IAAI,iBAAiB,KAAA;CACzC;CACA,IAAI,IAAI,UAAU,KAAA,GAAW,gBAAgB,QAAQ,IAAI;CACzD,IAAI,IAAI,aAAa,KAAA,GAAW,gBAAgB,WAAW,IAAI;CAC/D,IAAI,IAAI,WAAW,KAAA,GAAW,gBAAgB,SAAS,IAAI;CAC3D,IAAI,IAAI,WAAW,KAAA,GAAW,gBAAgB,SAAS,IAAI;CAC3D,IAAI,IAAI,gBAAgB,KAAA,GAAW,gBAAgB,cAAc,IAAI;CACrE,IAAI,IAAI,eAAe,KAAA,GAAW,gBAAgB,aAAa,IAAI;CACnE,IAAI,IAAI,UAAU,KAAA,GAAW,gBAAgB,QAAQ,IAAI;CACzD,IAAI,IAAI,oBAAoB,KAAA,GAAW,gBAAgB,kBAAkB,IAAI;CAE7E,MAAM,QAAQ,KAAgC,SAAS,OAAO,OAAO,QAAQ;EAC3E,IAAI,IAAI,MAAM,SACZ,MAAM,IAAI,cAAc,6BAA6B;GACnD,QAAQ,EAAE,QAAQ,QAAQ;GAC1B,YAAY;EACd,CAAC;EAQH,MAAM,OAAO,uBAAuB,KAJlC,OAAO,UAAU,WACb,CAAC;GAAE,MAAM;GAAQ,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM;GAAM,CAAC;EAAE,CAAC,IAC3D,CAAC,GAAG,KAAK,GAEkC,GAAG;EAEpD,IAAI,IAAI,WACN,KAAK,YAAY,UAAU;GAKzB,IAAI,WAAW,OAAO;IAAE,MAAM;IAAe;IAAS;GAAM,CAAC;EAC/D;EAGF,OAAO,QAAQ,MAAM,IAAI,OAAO,SAAS,IAAI,CAAC;CAChD,CAAC;CAED,OAAO;EACL,IAAI,MAAM;EACV,MAAM,MAAM;EACZ,MAAM,OAAO,QAAQ,MAAM,IAAI,OAAO,GAAG;EACzC,QAAQ,OAAO,OAAO,EAAE,GAAG,gBAAgB,CAAC;CAC9C;AACF;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACd,KACyB;CACzB,OAAO,WAAiB;EAAE,GAAG;EAAK,UAAU,MAAM,EAAE;CAAQ,CAAC;AAC/D;;;;;;;;;;;ACtTA,MAAM,gBAAgB;CAAC;CAAQ;CAAQ;CAAS;CAAQ;CAAW;CAAQ;AAAQ;;;;;;;;;;;;AAanF,SAAgB,uBAA+C;CAC7D,MAAM,MAA8B,CAAC;CACrC,KAAK,MAAM,OAAO,eAAe;EAC/B,MAAM,IAAI,QAAQ,IAAI;EACtB,IAAI,OAAO,MAAM,UAAU,IAAI,OAAO;CACxC;CACA,OAAO;AACT"}
|