@nodetool-ai/runtime 0.7.0-rc.23 → 0.8.1

package/dist/turn-budget.d.ts

@@ -0,0 +1,278 @@
+/**
+ * Per-turn spend admission for agent loops.
+ *
+ * A dollar ceiling cannot be enforced by checking spent cost before a call: the
+ * next call's cost is only known afterwards, so $0.49 spent under a $0.50 cap
+ * still admits a $0.30 call and lands at $0.79. The ceiling holds only if the
+ * worst case is *reserved* before the turn and reconciled to actuals after it.
+ *
+ * The interception point has to sit inside the provider layer. A wrapper around
+ * `generateLoop()` sees one call while the base loop makes its turns
+ * internally, and providers that own their loop (the Claude Agent SDK) never
+ * return between turns at all. So the budget is an object threaded through
+ * `generateLoop` options and honored before every model turn — by the base loop
+ * and, as a contract obligation, by any provider overriding it.
+ *
+ * See docs/workflow-supervisor-design.md §6.
+ */
+import type { ProviderId } from "@nodetool-ai/protocol";
+/** What a provider knows about the turn it is about to make. */
+export interface TurnReservation {
+    model: string;
+    provider: ProviderId;
+    /** Prompt tokens the turn will send, as well as the provider can tell. */
+    inputTokens: number;
+}
+/**
+ * One admitted turn's reservation. `reserve` hands it back and `commit` takes
+ * it, so a budget shared by several loops settles the turn that finished
+ * rather than whichever one reserved last.
+ *
+ * It carries its own worst case and its own pricing, because both are
+ * per-turn: two loops can hold reservations of different sizes at the same
+ * time, and one of them can be on a model the catalog does not price.
+ */
+export interface TurnReservationHandle {
+    /** USD this reservation holds against the cap. Zero for an unpriced turn. */
+    readonly worstCaseUsd: number;
+    /** True when the turn's model has no catalog price. */
+    readonly unpriced: boolean;
+}
+export interface TurnBudget {
+    /**
+     * Admit or refuse the turn. A refusal — `null` — is final for this loop: the
+     * provider stops rather than making the call. An admission is the handle to
+     * hand back to {@link TurnBudget.commit}.
+     */
+    reserve(turn: TurnReservation): TurnReservationHandle | null;
+    /**
+     * Reconcile one reservation against what its turn actually cost, in USD.
+     * Only the named handle is settled; every other loop's reservation stays
+     * outstanding. Committing a handle twice is a no-op.
+     *
+     * Pass `null` when turns provably ran but their cost was never reported —
+     * the Claude Agent SDK only reports usage on a terminal `result` message,
+     * which an aborted session never emits. That is not the same as free, and
+     * booking it as zero would hand the reserved headroom back for spend that
+     * really happened. The reserved worst case is charged instead.
+     */
+    commit(handle: TurnReservationHandle, actualUsd: number | null): void;
+    /** Committed spend so far, in USD. */
+    readonly spentUsd: number;
+}
+export interface CostCappedTurnBudgetOptions {
+    /** Ceiling on total spend, in USD. */
+    capUsd: number;
+    /**
+     * Output-token bound assumed for every turn. Reservation needs a *known*
+     * worst case, so this is required — an optional `maxTokens` that providers
+     * may ignore cannot bound anything.
+     */
+    maxOutputTokens: number;
+}
+/**
+ * The reserving budget. Refuses a turn whose worst case would cross the cap,
+ * and refuses any turn on a model with no price in the catalog — an unpriced
+ * model has no worst case, and admitting it would make the cap advisory.
+ */
+export declare class CostCappedTurnBudget implements TurnBudget {
+    private readonly _capUsd;
+    private readonly _maxOutputTokens;
+    private _spentUsd;
+    /** Reservations of the turns in flight, released one at a time by `commit`. */
+    private readonly _outstanding;
+    /** Sum over {@link _outstanding}, kept incrementally. */
+    private _reservedUsd;
+    constructor(opts: CostCappedTurnBudgetOptions);
+    get spentUsd(): number;
+    reserve(turn: TurnReservation): TurnReservationHandle | null;
+    commit(handle: TurnReservationHandle, actualUsd: number | null): void;
+    private _hold;
+}
+/** Wall-clock ceiling for a run. */
+export interface Deadline {
+    /** Epoch milliseconds after which the run must stop. */
+    readonly at: number;
+    remainingMs(): number;
+    expired(): boolean;
+}
+/**
+ * A deadline `ms` from now. `Infinity` means no deadline — `at` is `Infinity`,
+ * so `expired()` is false forever without a second "unbounded" code path.
+ */
+export declare function createDeadline(ms: number): Deadline;
+/**
+ * Hand back one permit. Idempotent: a caller that releases twice (a `finally`
+ * plus an explicit release, say) must not inflate the semaphore.
+ *
+ * Not a `Symbol.dispose` object — this package compiles against `lib: ES2022`,
+ * which has no disposable typings. A plain callable works in every consumer.
+ */
+export type Release = () => void;
+/** FIFO permit pool bounding concurrent provider conversations for a run. */
+export interface Semaphore {
+    /** Permits the pool was created with. */
+    readonly permits: number;
+    /** Permits not currently held. */
+    readonly available: number;
+    /** Callers waiting for a permit. */
+    readonly waiting: number;
+    acquire(): Promise<Release>;
+}
+export declare function createSemaphore(permits: number): Semaphore;
+/** Bounded counter. `increment` answers false once `max` has been reached. */
+export interface Counter {
+    readonly max: number;
+    readonly current: number;
+    increment(): boolean;
+}
+export declare function createCounter(max: number): Counter;
+/** Why a run stopped. An `as const` union, not an enum (AGENTS.md § TypeScript). */
+export declare const BUDGET_EXHAUSTION_KINDS: readonly ["cost", "deadline", "turns"];
+export type BudgetExhaustionKind = (typeof BUDGET_EXHAUSTION_KINDS)[number];
+export interface BudgetExhaustion {
+    kind: BudgetExhaustionKind;
+    detail: string;
+}
+/** Which ceiling a {@link CompositeTurnBudget} refusal hit. */
+export declare const TURN_REFUSALS: readonly ["cost-cap", "unpriced-token-ceiling"];
+export type TurnRefusal = (typeof TURN_REFUSALS)[number];
+export interface CompositeTurnBudgetOptions {
+    /**
+     * Ceiling on total spend, in USD, or `null` for no USD cap (a local-only
+     * install).
+     */
+    capUsd: number | null;
+    /** Output-token bound assumed for every turn. See {@link CostCappedTurnBudgetOptions}. */
+    maxOutputTokens: number;
+    /**
+     * Prompt-token ceiling applied to a turn on a model with no catalog price.
+     * Only consulted when a USD cap exists — see {@link CompositeTurnBudget}.
+     */
+    unpricedTokenCeiling: number;
+}
+/**
+ * The budget every run gets. Priced models behave exactly like
+ * {@link CostCappedTurnBudget}; a model with no catalog price is admitted
+ * against a prompt-token ceiling instead and its turns are counted apart from
+ * `spentUsd`.
+ *
+ * Why not just refuse an unpriced model the way `CostCappedTurnBudget` does:
+ * that budget is the supervisor's, where refusing is right — a supervisor that
+ * cannot be priced should not run. A user's chat turn on a model the catalog
+ * has not caught up with is a different case; refusing it would make the
+ * product unusable on any new model. So the run is bounded by the one thing
+ * that is known (prompt size) and the unknown is *reported* rather than
+ * booked: `spentUsd` is a lower bound whenever `unpricedTurns > 0`, never a
+ * claim that those turns were free (assumption A-5, invariant I-4).
+ *
+ * With `capUsd: null` there is no USD cap, and admission is therefore
+ * unbounded by cost — including for unpriced models. The token ceiling exists
+ * to keep a *cap* meaningful when a turn cannot be priced; with no cap there
+ * is nothing to keep meaningful, and enforcing it anyway would impose a prompt
+ * limit nobody configured. Deadline and turn count still bound such a run.
+ */
+export declare class CompositeTurnBudget implements TurnBudget {
+    private readonly _capUsd;
+    private readonly _maxOutputTokens;
+    private readonly _unpricedTokenCeiling;
+    private _spentUsd;
+    /** Reservations of the turns in flight, released one at a time by `commit`. */
+    private readonly _outstanding;
+    /** Sum over {@link _outstanding}, kept incrementally. */
+    private _reservedUsd;
+    private _unpricedTurns;
+    private _lastRefusal;
+    constructor(opts: CompositeTurnBudgetOptions);
+    get spentUsd(): number;
+    /**
+     * Why the most recent `reserve` refused, so a caller can name the ceiling in
+     * the message the user sees rather than guessing which one it was.
+     */
+    get lastRefusal(): TurnRefusal | null;
+    /** Turns admitted on a model the price catalog does not cover. */
+    get unpricedTurns(): number;
+    /** True when `spentUsd` under-reports the run because some turns had no price. */
+    get hasUnpricedTurns(): boolean;
+    reserve(turn: TurnReservation): TurnReservationHandle | null;
+    commit(handle: TurnReservationHandle, actualUsd: number | null): void;
+    private _reserveUnpriced;
+    private _hold;
+}
+/**
+ * The run's spend admission, plus what `spentUsd` leaves out: turns admitted
+ * on a model the price catalog does not cover, so a reported total reads as
+ * the lower bound it is (invariant I-4).
+ */
+export interface RunTurnBudget extends TurnBudget {
+    readonly unpricedTurns: number;
+}
+/** The four bounds one run shares, plus the reason it stopped. */
+export interface RunBudget {
+    /** USD admission; reserve before a turn, commit after. */
+    turns: RunTurnBudget;
+    /** Absolute deadline; every loop checks it before a turn and before a tool call. */
+    deadline: Deadline;
+    /** Process-wide bound on concurrent provider conversations for this run. */
+    concurrency: Semaphore;
+    /** Cumulative model turns across every loop in the run. */
+    turnCount: Counter;
+    /** Why a stop happened, set once — the first reason wins. */
+    readonly exhausted: BudgetExhaustion | null;
+}
+export interface CreateRunBudgetOptions {
+    /** `null` = no USD cap (local-only install). */
+    capUsd: number | null;
+    maxOutputTokens: number;
+    /** Per-turn prompt-token ceiling when the model has no price. */
+    unpricedTokenCeiling: number;
+    deadlineMs: number;
+    maxConcurrency: number;
+    maxTurns: number;
+}
+/** Runtime narrower: a {@link RunBudget} carries the other three bounds. */
+export declare function isRunBudget(value: TurnBudget | RunBudget | undefined | null): value is RunBudget;
+/**
+ * Build the one budget a run shares downward (invariant I-2).
+ *
+ * `turns.reserve` is the single admission point: it checks the deadline, then
+ * the cumulative turn count, then the USD cap, and records the first reason it
+ * refuses for. A provider loop therefore only has to call `reserve` to honor
+ * all three, and reads `exhausted` to say which one stopped it.
+ */
+export declare function createRunBudget(opts: CreateRunBudgetOptions): RunBudget;
+/**
+ * Context variable holding the run's {@link RunBudget}.
+ *
+ * A budget has to reach loops the host never sees: an `AgentNode` a chat turn
+ * started through `run_node`, a JS script, a sub-agent three levels down. The
+ * context bag is the one channel every one of them already carries, and
+ * `ProcessingContext.copy()` shallow-copies it, so a child context shares the
+ * same object rather than a clone of it — which is what makes the cap a run
+ * total instead of a per-loop allowance (invariant I-2).
+ *
+ * It lives here, beside the type it names, so that hosts, `agents`, and
+ * `llm-nodes` agree on the key without any of them importing each other.
+ */
+export declare const RUN_BUDGET_CONTEXT_KEY = "nodetool_run_budget";
+/**
+ * Minimal reader for the context bag, so this stays free of a context import.
+ *
+ * `get` is optional because the callers are hosts and nodes that accept a
+ * partial context — a test double, or a node invoked with none at all. A
+ * context that cannot answer has no budget on it, which is the same answer as
+ * a context that answers with nothing; throwing instead would make reading the
+ * budget riskier than not having one.
+ */
+interface RunBudgetContext {
+    get?<T = unknown>(key: string, defaultValue?: T): T;
+}
+/**
+ * The run budget a host put on the context, or `undefined` when none did.
+ *
+ * Absent means unbudgeted, not exhausted: a workflow run started from the
+ * kernel with no host budget must keep working exactly as it does today.
+ */
+export declare function budgetFromContext(context: RunBudgetContext | undefined | null): RunBudget | undefined;
+export {};
+//# sourceMappingURL=turn-budget.d.ts.map

package/dist/turn-budget.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"turn-budget.d.ts","sourceRoot":"","sources":["../src/turn-budget.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAMxD,gEAAgE;AAChE,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,UAAU,CAAC;IACrB,0EAA0E;IAC1E,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,qBAAqB;IACpC,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,uDAAuD;IACvD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,UAAU;IACzB;;;;OAIG;IACH,OAAO,CAAC,IAAI,EAAE,eAAe,GAAG,qBAAqB,GAAG,IAAI,CAAC;IAC7D;;;;;;;;;;OAUG;IACH,MAAM,CAAC,MAAM,EAAE,qBAAqB,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC;IACtE,sCAAsC;IACtC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,2BAA2B;IAC1C,sCAAsC;IACtC,MAAM,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,eAAe,EAAE,MAAM,CAAC;CACzB;AAED;;;;GAIG;AACH,qBAAa,oBAAqB,YAAW,UAAU;IACrD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAS;IAC1C,OAAO,CAAC,SAAS,CAAK;IACtB,+EAA+E;IAC/E,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAoC;IACjE,yDAAyD;IACzD,OAAO,CAAC,YAAY,CAAK;IAEzB,YAAY,IAAI,EAAE,2BAA2B,EAG5C;IAED,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,OAAO,CAAC,IAAI,EAAE,eAAe,GAAG,qBAAqB,GAAG,IAAI,CAW3D;IAED,MAAM,CAAC,MAAM,EAAE,qBAAqB,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CASpE;IAED,OAAO,CAAC,KAAK;CAKd;AAYD,oCAAoC;AACpC,MAAM,WAAW,QAAQ;IACvB,wDAAwD;IACxD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,WAAW,IAAI,MAAM,CAAC;IACtB,OAAO,IAAI,OAAO,CAAC;CACpB;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,CAOnD;AAED;;;;;;GAMG;AACH,MAAM,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC;AAEjC,6EAA6E;AAC7E,MAAM,WAAW,SAAS;IACxB,yCAAyC;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,kCAAkC;IAClC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,oCAAoC;IACpC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;CAC7B;AAED,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,CAwC1D;AAED,8EAA8E;AAC9E,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,SAAS,IAAI,OAAO,CAAC;CACtB;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAalD;AAED,oFAAoF;AACpF,eAAO,MAAM,uBAAuB,YAAI,MAAM,EAAE,UAAU,EAAE,OAAO,CAAU,CAAC;AAC9E,MAAM,MAAM,oBAAoB,GAAG,CAAC,OAAO,uBAAuB,CAAC,CAAC,MAAM,CAAC,CAAC;AAE5E,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,oBAAoB,CAAC;IAC3B,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,+DAA+D;AAC/D,eAAO,MAAM,aAAa,YAAI,UAAU,EAAE,wBAAwB,CAAU,CAAC;AAC7E,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC;AAEzD,MAAM,WAAW,0BAA0B;IACzC;;;OAGG;IACH,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,0FAA0F;IAC1F,eAAe,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAKD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,mBAAoB,YAAW,UAAU;IACpD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgB;IACxC,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAS;IAC1C,OAAO,CAAC,QAAQ,CAAC,qBAAqB,CAAS;IAC/C,OAAO,CAAC,SAAS,CAAK;IACtB,+EAA+E;IAC/E,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAoC;IACjE,yDAAyD;IACzD,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,cAAc,CAAK;IAC3B,OAAO,CAAC,YAAY,CAA4B;IAEhD,YAAY,IAAI,EAAE,0BAA0B,EAI3C;IAED,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED;;;OAGG;IACH,IAAI,WAAW,IAAI,WAAW,GAAG,IAAI,CAEpC;IAED,kEAAkE;IAClE,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED,kFAAkF;IAClF,IAAI,gBAAgB,IAAI,OAAO,CAE9B;IAED,OAAO,CAAC,IAAI,EAAE,eAAe,GAAG,qBAAqB,GAAG,IAAI,CAkB3D;IAED,MAAM,CAAC,MAAM,EAAE,qBAAqB,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAgBpE;IAED,OAAO,CAAC,gBAAgB;IAsBxB,OAAO,CAAC,KAAK;CAKd;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAc,SAAQ,UAAU;IAC/C,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,kEAAkE;AAClE,MAAM,WAAW,SAAS;IACxB,0DAA0D;IAC1D,KAAK,EAAE,aAAa,CAAC;IACrB,oFAAoF;IACpF,QAAQ,EAAE,QAAQ,CAAC;IACnB,4EAA4E;IAC5E,WAAW,EAAE,SAAS,CAAC;IACvB,2DAA2D;IAC3D,SAAS,EAAE,OAAO,CAAC;IACnB,6DAA6D;IAC7D,QAAQ,CAAC,SAAS,EAAE,gBAAgB,GAAG,IAAI,CAAC;CAC7C;AAED,MAAM,WAAW,sBAAsB;IACrC,gDAAgD;IAChD,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;IACxB,iEAAiE;IACjE,oBAAoB,EAAE,MAAM,CAAC;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,4EAA4E;AAC5E,wBAAgB,WAAW,CACzB,KAAK,EAAE,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,IAAI,GAC/C,KAAK,IAAI,SAAS,CASpB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,sBAAsB,GAAG,SAAS,CAyEvE;AAED;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,sBAAsB,wBAAwB,CAAC;AAE5D;;;;;;;;GAQG;AACH,UAAU,gBAAgB;IACxB,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;CACrD;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,gBAAgB,GAAG,SAAS,GAAG,IAAI,GAC3C,SAAS,GAAG,SAAS,CAMvB"}

package/dist/turn-budget.js

@@ -0,0 +1,365 @@
+/**
+ * Per-turn spend admission for agent loops.
+ *
+ * A dollar ceiling cannot be enforced by checking spent cost before a call: the
+ * next call's cost is only known afterwards, so $0.49 spent under a $0.50 cap
+ * still admits a $0.30 call and lands at $0.79. The ceiling holds only if the
+ * worst case is *reserved* before the turn and reconciled to actuals after it.
+ *
+ * The interception point has to sit inside the provider layer. A wrapper around
+ * `generateLoop()` sees one call while the base loop makes its turns
+ * internally, and providers that own their loop (the Claude Agent SDK) never
+ * return between turns at all. So the budget is an object threaded through
+ * `generateLoop` options and honored before every model turn — by the base loop
+ * and, as a contract obligation, by any provider overriding it.
+ *
+ * See docs/workflow-supervisor-design.md §6.
+ */
+import { createLogger } from "@nodetool-ai/config";
+import { CostCalculator } from "./providers/cost-calculator.js";
+const log = createLogger("nodetool.runtime.turn-budget");
+/**
+ * The reserving budget. Refuses a turn whose worst case would cross the cap,
+ * and refuses any turn on a model with no price in the catalog — an unpriced
+ * model has no worst case, and admitting it would make the cap advisory.
+ */
+export class CostCappedTurnBudget {
+    _capUsd;
+    _maxOutputTokens;
+    _spentUsd = 0;
+    /** Reservations of the turns in flight, released one at a time by `commit`. */
+    _outstanding = new Set();
+    /** Sum over {@link _outstanding}, kept incrementally. */
+    _reservedUsd = 0;
+    constructor(opts) {
+        this._capUsd = opts.capUsd;
+        this._maxOutputTokens = opts.maxOutputTokens;
+    }
+    get spentUsd() {
+        return this._spentUsd;
+    }
+    reserve(turn) {
+        const worstCase = CostCalculator.estimateTokenCostUsd(turn.model, { inputTokens: turn.inputTokens, outputTokens: this._maxOutputTokens }, turn.provider);
+        if (worstCase === null)
+            return null;
+        if (this._spentUsd + this._reservedUsd + worstCase > this._capUsd) {
+            return null;
+        }
+        return this._hold({ worstCaseUsd: worstCase, unpriced: false });
+    }
+    commit(handle, actualUsd) {
+        if (!this._outstanding.delete(handle))
+            return;
+        this._reservedUsd -= handle.worstCaseUsd;
+        // Unknown must not read as free — the same rule invocation-cost accounting
+        // follows. With no number to book, this turn's reservation is the charge.
+        this._spentUsd +=
+            actualUsd === null || !Number.isFinite(actualUsd)
+                ? handle.worstCaseUsd
+                : Math.max(actualUsd, 0);
+    }
+    _hold(handle) {
+        this._outstanding.add(handle);
+        this._reservedUsd += handle.worstCaseUsd;
+        return handle;
+    }
+}
+/**
+ * A deadline `ms` from now. `Infinity` means no deadline — `at` is `Infinity`,
+ * so `expired()` is false forever without a second "unbounded" code path.
+ */
+export function createDeadline(ms) {
+    const at = Number.isFinite(ms) ? Date.now() + ms : Infinity;
+    return {
+        at,
+        remainingMs: () => (at === Infinity ? Infinity : at - Date.now()),
+        expired: () => Date.now() >= at
+    };
+}
+export function createSemaphore(permits) {
+    // A non-positive bound would deadlock every acquirer; treat it as "one at a
+    // time", which is the strictest bound that still makes progress.
+    const max = Number.isFinite(permits) && permits > 0 ? Math.floor(permits) : 1;
+    let held = 0;
+    const queue = [];
+    const makeRelease = () => {
+        let released = false;
+        return () => {
+            if (released)
+                return;
+            released = true;
+            const next = queue.shift();
+            if (next) {
+                // Hand the permit straight to the head of the queue: `held` stays put,
+                // so a waiter cannot be overtaken by a caller that acquires between
+                // this release and the waiter's continuation.
+                next(makeRelease());
+                return;
+            }
+            held--;
+        };
+    };
+    return {
+        permits: max,
+        get available() {
+            return max - held;
+        },
+        get waiting() {
+            return queue.length;
+        },
+        acquire() {
+            if (held < max) {
+                held++;
+                return Promise.resolve(makeRelease());
+            }
+            return new Promise((resolve) => queue.push(resolve));
+        }
+    };
+}
+export function createCounter(max) {
+    let current = 0;
+    return {
+        max,
+        get current() {
+            return current;
+        },
+        increment() {
+            if (current >= max)
+                return false;
+            current++;
+            return true;
+        }
+    };
+}
+/** Why a run stopped. An `as const` union, not an enum (AGENTS.md § TypeScript). */
+export const BUDGET_EXHAUSTION_KINDS = ["cost", "deadline", "turns"];
+/** Which ceiling a {@link CompositeTurnBudget} refusal hit. */
+export const TURN_REFUSALS = ["cost-cap", "unpriced-token-ceiling"];
+/** Models already logged as unpriced, so the notice fires once per model. */
+const loggedUnpricedModels = new Set();
+/**
+ * The budget every run gets. Priced models behave exactly like
+ * {@link CostCappedTurnBudget}; a model with no catalog price is admitted
+ * against a prompt-token ceiling instead and its turns are counted apart from
+ * `spentUsd`.
+ *
+ * Why not just refuse an unpriced model the way `CostCappedTurnBudget` does:
+ * that budget is the supervisor's, where refusing is right — a supervisor that
+ * cannot be priced should not run. A user's chat turn on a model the catalog
+ * has not caught up with is a different case; refusing it would make the
+ * product unusable on any new model. So the run is bounded by the one thing
+ * that is known (prompt size) and the unknown is *reported* rather than
+ * booked: `spentUsd` is a lower bound whenever `unpricedTurns > 0`, never a
+ * claim that those turns were free (assumption A-5, invariant I-4).
+ *
+ * With `capUsd: null` there is no USD cap, and admission is therefore
+ * unbounded by cost — including for unpriced models. The token ceiling exists
+ * to keep a *cap* meaningful when a turn cannot be priced; with no cap there
+ * is nothing to keep meaningful, and enforcing it anyway would impose a prompt
+ * limit nobody configured. Deadline and turn count still bound such a run.
+ */
+export class CompositeTurnBudget {
+    _capUsd;
+    _maxOutputTokens;
+    _unpricedTokenCeiling;
+    _spentUsd = 0;
+    /** Reservations of the turns in flight, released one at a time by `commit`. */
+    _outstanding = new Set();
+    /** Sum over {@link _outstanding}, kept incrementally. */
+    _reservedUsd = 0;
+    _unpricedTurns = 0;
+    _lastRefusal = null;
+    constructor(opts) {
+        this._capUsd = opts.capUsd;
+        this._maxOutputTokens = opts.maxOutputTokens;
+        this._unpricedTokenCeiling = opts.unpricedTokenCeiling;
+    }
+    get spentUsd() {
+        return this._spentUsd;
+    }
+    /**
+     * Why the most recent `reserve` refused, so a caller can name the ceiling in
+     * the message the user sees rather than guessing which one it was.
+     */
+    get lastRefusal() {
+        return this._lastRefusal;
+    }
+    /** Turns admitted on a model the price catalog does not cover. */
+    get unpricedTurns() {
+        return this._unpricedTurns;
+    }
+    /** True when `spentUsd` under-reports the run because some turns had no price. */
+    get hasUnpricedTurns() {
+        return this._unpricedTurns > 0;
+    }
+    reserve(turn) {
+        const worstCase = CostCalculator.estimateTokenCostUsd(turn.model, { inputTokens: turn.inputTokens, outputTokens: this._maxOutputTokens }, turn.provider);
+        if (worstCase === null) {
+            return this._reserveUnpriced(turn);
+        }
+        if (this._capUsd !== null &&
+            this._spentUsd + this._reservedUsd + worstCase > this._capUsd) {
+            this._lastRefusal = "cost-cap";
+            return null;
+        }
+        this._lastRefusal = null;
+        return this._hold({ worstCaseUsd: worstCase, unpriced: false });
+    }
+    commit(handle, actualUsd) {
+        if (!this._outstanding.delete(handle))
+            return;
+        this._reservedUsd -= handle.worstCaseUsd;
+        const reported = actualUsd !== null && Number.isFinite(actualUsd)
+            ? Math.max(actualUsd, 0)
+            : null;
+        if (handle.unpriced) {
+            this._unpricedTurns++;
+            // No worst case to fall back on: an unpriced model has none. A number
+            // the provider reported anyway is real money and is booked; an unknown
+            // adds nothing to `spentUsd` and is visible as an unpriced turn.
+            if (reported !== null)
+                this._spentUsd += reported;
+            return;
+        }
+        this._spentUsd += reported ?? handle.worstCaseUsd;
+    }
+    _reserveUnpriced(turn) {
+        if (this._capUsd === null) {
+            this._lastRefusal = null;
+            return this._hold({ worstCaseUsd: 0, unpriced: true });
+        }
+        const key = `${turn.provider}/${turn.model}`;
+        if (!loggedUnpricedModels.has(key)) {
+            loggedUnpricedModels.add(key);
+            log.warn("Model has no catalog price; admitting against a token ceiling", {
+                provider: turn.provider,
+                model: turn.model,
+                unpricedTokenCeiling: this._unpricedTokenCeiling
+            });
+        }
+        if (turn.inputTokens > this._unpricedTokenCeiling) {
+            this._lastRefusal = "unpriced-token-ceiling";
+            return null;
+        }
+        this._lastRefusal = null;
+        return this._hold({ worstCaseUsd: 0, unpriced: true });
+    }
+    _hold(handle) {
+        this._outstanding.add(handle);
+        this._reservedUsd += handle.worstCaseUsd;
+        return handle;
+    }
+}
+/** Runtime narrower: a {@link RunBudget} carries the other three bounds. */
+export function isRunBudget(value) {
+    return (typeof value === "object" &&
+        value !== null &&
+        "turns" in value &&
+        "deadline" in value &&
+        "concurrency" in value &&
+        "turnCount" in value);
+}
+/**
+ * Build the one budget a run shares downward (invariant I-2).
+ *
+ * `turns.reserve` is the single admission point: it checks the deadline, then
+ * the cumulative turn count, then the USD cap, and records the first reason it
+ * refuses for. A provider loop therefore only has to call `reserve` to honor
+ * all three, and reads `exhausted` to say which one stopped it.
+ */
+export function createRunBudget(opts) {
+    const cost = new CompositeTurnBudget({
+        capUsd: opts.capUsd,
+        maxOutputTokens: opts.maxOutputTokens,
+        unpricedTokenCeiling: opts.unpricedTokenCeiling
+    });
+    const rawDeadline = createDeadline(opts.deadlineMs);
+    const turnCount = createCounter(opts.maxTurns);
+    let exhausted = null;
+    // Set once: a run that ran out of money and then ran out of time stopped for
+    // the money. Overwriting would report the symptom of the first stop.
+    const markExhausted = (kind, detail) => {
+        if (exhausted === null)
+            exhausted = { kind, detail };
+    };
+    // Any loop that checks the deadline records the reason by doing so, so a
+    // pre-turn deadline check needs no separate setter on the interface.
+    const deadline = {
+        at: rawDeadline.at,
+        remainingMs: () => rawDeadline.remainingMs(),
+        expired: () => {
+            if (!rawDeadline.expired())
+                return false;
+            markExhausted("deadline", `run deadline of ${Math.round(opts.deadlineMs)}ms reached`);
+            return true;
+        }
+    };
+    const turns = {
+        reserve(turn) {
+            if (deadline.expired())
+                return null;
+            // Read the count before spending it: a turn refused on cost must not
+            // also consume a turn slot, and a reservation cannot be handed back.
+            if (turnCount.current >= turnCount.max) {
+                markExhausted("turns", `turn limit of ${opts.maxTurns} reached`);
+                return null;
+            }
+            const handle = cost.reserve(turn);
+            if (handle === null) {
+                markExhausted("cost", cost.lastRefusal === "unpriced-token-ceiling"
+                    ? `${turn.model} has no catalog price and the turn's ${turn.inputTokens} prompt tokens exceed the unpriced ceiling of ${opts.unpricedTokenCeiling}`
+                    : `turn budget of $${opts.capUsd} reached`);
+                return null;
+            }
+            turnCount.increment();
+            return handle;
+        },
+        commit(handle, actualUsd) {
+            cost.commit(handle, actualUsd);
+        },
+        get spentUsd() {
+            return cost.spentUsd;
+        },
+        get unpricedTurns() {
+            return cost.unpricedTurns;
+        }
+    };
+    return {
+        turns,
+        deadline,
+        concurrency: createSemaphore(opts.maxConcurrency),
+        turnCount,
+        get exhausted() {
+            return exhausted;
+        }
+    };
+}
+/**
+ * Context variable holding the run's {@link RunBudget}.
+ *
+ * A budget has to reach loops the host never sees: an `AgentNode` a chat turn
+ * started through `run_node`, a JS script, a sub-agent three levels down. The
+ * context bag is the one channel every one of them already carries, and
+ * `ProcessingContext.copy()` shallow-copies it, so a child context shares the
+ * same object rather than a clone of it — which is what makes the cap a run
+ * total instead of a per-loop allowance (invariant I-2).
+ *
+ * It lives here, beside the type it names, so that hosts, `agents`, and
+ * `llm-nodes` agree on the key without any of them importing each other.
+ */
+export const RUN_BUDGET_CONTEXT_KEY = "nodetool_run_budget";
+/**
+ * The run budget a host put on the context, or `undefined` when none did.
+ *
+ * Absent means unbudgeted, not exhausted: a workflow run started from the
+ * kernel with no host budget must keep working exactly as it does today.
+ */
+export function budgetFromContext(context) {
+    if (typeof context?.get !== "function")
+        return undefined;
+    const value = context.get(RUN_BUDGET_CONTEXT_KEY);
+    return isRunBudget(value)
+        ? value
+        : undefined;
+}
+//# sourceMappingURL=turn-budget.js.map

package/dist/turn-budget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"turn-budget.js","sourceRoot":"","sources":["../src/turn-budget.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AAEhE,MAAM,GAAG,GAAG,YAAY,CAAC,8BAA8B,CAAC,CAAC;AA4DzD;;;;GAIG;AACH,MAAM,OAAO,oBAAoB;IACd,OAAO,CAAS;IAChB,gBAAgB,CAAS;IAClC,SAAS,GAAG,CAAC,CAAC;IACtB,+EAA+E;IAC9D,YAAY,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjE,yDAAyD;IACjD,YAAY,GAAG,CAAC,CAAC;IAEzB,YAAY,IAAiC;QAC3C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,eAAe,CAAC;IAC/C,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,OAAO,CAAC,IAAqB;QAC3B,MAAM,SAAS,GAAG,cAAc,CAAC,oBAAoB,CACnD,IAAI,CAAC,KAAK,EACV,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,YAAY,EAAE,IAAI,CAAC,gBAAgB,EAAE,EACtE,IAAI,CAAC,QAAQ,CACd,CAAC;QACF,IAAI,SAAS,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACpC,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,GAAG,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAClE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,MAAM,CAAC,MAA6B,EAAE,SAAwB;QAC5D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC;YAAE,OAAO;QAC9C,IAAI,CAAC,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;QACzC,2EAA2E;QAC3E,0EAA0E;QAC1E,IAAI,CAAC,SAAS;YACZ,SAAS,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC;gBAC/C,CAAC,CAAC,MAAM,CAAC,YAAY;gBACrB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IAEO,KAAK,CAAC,MAA6B;QACzC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAI,CAAC,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;QACzC,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAoBD;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,EAAU;IACvC,MAAM,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC5D,OAAO;QACL,EAAE;QACF,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACjE,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE;KAChC,CAAC;AACJ,CAAC;AAsBD,MAAM,UAAU,eAAe,CAAC,OAAe;IAC7C,4EAA4E;IAC5E,iEAAiE;IACjE,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,KAAK,GAAsC,EAAE,CAAC;IAEpD,MAAM,WAAW,GAAG,GAAY,EAAE;QAChC,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,OAAO,GAAG,EAAE;YACV,IAAI,QAAQ;gBAAE,OAAO;YACrB,QAAQ,GAAG,IAAI,CAAC;YAChB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,IAAI,EAAE,CAAC;gBACT,uEAAuE;gBACvE,oEAAoE;gBACpE,8CAA8C;gBAC9C,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;gBACpB,OAAO;YACT,CAAC;YACD,IAAI,EAAE,CAAC;QACT,CAAC,CAAC;IACJ,CAAC,CAAC;IAEF,OAAO;QACL,OAAO,EAAE,GAAG;QACZ,IAAI,SAAS;YACX,OAAO,GAAG,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,IAAI,OAAO;YACT,OAAO,KAAK,CAAC,MAAM,CAAC;QACtB,CAAC;QACD,OAAO;YACL,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;gBACf,IAAI,EAAE,CAAC;gBACP,OAAO,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,OAAO,CAAU,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAChE,CAAC;KACF,CAAC;AACJ,CAAC;AASD,MAAM,UAAU,aAAa,CAAC,GAAW;IACvC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO;QACL,GAAG;QACH,IAAI,OAAO;YACT,OAAO,OAAO,CAAC;QACjB,CAAC;QACD,SAAS;YACP,IAAI,OAAO,IAAI,GAAG;gBAAE,OAAO,KAAK,CAAC;YACjC,OAAO,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QACd,CAAC;KACF,CAAC;AACJ,CAAC;AAED,oFAAoF;AACpF,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAU,CAAC;AAQ9E,+DAA+D;AAC/D,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,UAAU,EAAE,wBAAwB,CAAU,CAAC;AAkB7E,6EAA6E;AAC7E,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAC;AAE/C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,OAAO,mBAAmB;IACb,OAAO,CAAgB;IACvB,gBAAgB,CAAS;IACzB,qBAAqB,CAAS;IACvC,SAAS,GAAG,CAAC,CAAC;IACtB,+EAA+E;IAC9D,YAAY,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjE,yDAAyD;IACjD,YAAY,GAAG,CAAC,CAAC;IACjB,cAAc,GAAG,CAAC,CAAC;IACnB,YAAY,GAAuB,IAAI,CAAC;IAEhD,YAAY,IAAgC;QAC1C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,eAAe,CAAC;QAC7C,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAC,oBAAoB,CAAC;IACzD,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,kEAAkE;IAClE,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAED,kFAAkF;IAClF,IAAI,gBAAgB;QAClB,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,CAAC,IAAqB;QAC3B,MAAM,SAAS,GAAG,cAAc,CAAC,oBAAoB,CACnD,IAAI,CAAC,KAAK,EACV,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,YAAY,EAAE,IAAI,CAAC,gBAAgB,EAAE,EACtE,IAAI,CAAC,QAAQ,CACd,CAAC;QACF,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;QACD,IACE,IAAI,CAAC,OAAO,KAAK,IAAI;YACrB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,GAAG,SAAS,GAAG,IAAI,CAAC,OAAO,EAC7D,CAAC;YACD,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC;YAC/B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,MAAM,CAAC,MAA6B,EAAE,SAAwB;QAC5D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC;YAAE,OAAO;QAC9C,IAAI,CAAC,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;QACzC,MAAM,QAAQ,GACZ,SAAS,KAAK,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC;YAC9C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;YACxB,CAAC,CAAC,IAAI,CAAC;QACX,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpB,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,sEAAsE;YACtE,uEAAuE;YACvE,iEAAiE;YACjE,IAAI,QAAQ,KAAK,IAAI;gBAAE,IAAI,CAAC,SAAS,IAAI,QAAQ,CAAC;YAClD,OAAO;QACT,CAAC;QACD,IAAI,CAAC,SAAS,IAAI,QAAQ,IAAI,MAAM,CAAC,YAAY,CAAC;IACpD,CAAC;IAEO,gBAAgB,CAAC,IAAqB;QAC5C,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YACzB,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC7C,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,oBAAoB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,GAAG,CAAC,IAAI,CAAC,+DAA+D,EAAE;gBACxE,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,oBAAoB,EAAE,IAAI,CAAC,qBAAqB;aACjD,CAAC,CAAC;QACL,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAClD,IAAI,CAAC,YAAY,GAAG,wBAAwB,CAAC;YAC7C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;IACzD,CAAC;IAEO,KAAK,CAAC,MAA6B;QACzC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAI,CAAC,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;QACzC,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAoCD,4EAA4E;AAC5E,MAAM,UAAU,WAAW,CACzB,KAAgD;IAEhD,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,OAAO,IAAI,KAAK;QAChB,UAAU,IAAI,KAAK;QACnB,aAAa,IAAI,KAAK;QACtB,WAAW,IAAI,KAAK,CACrB,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,IAA4B;IAC1D,MAAM,IAAI,GAAG,IAAI,mBAAmB,CAAC;QACnC,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,eAAe,EAAE,IAAI,CAAC,eAAe;QACrC,oBAAoB,EAAE,IAAI,CAAC,oBAAoB;KAChD,CAAC,CAAC;IACH,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACpD,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,IAAI,SAAS,GAA4B,IAAI,CAAC;IAE9C,6EAA6E;IAC7E,qEAAqE;IACrE,MAAM,aAAa,GAAG,CAAC,IAA0B,EAAE,MAAc,EAAQ,EAAE;QACzE,IAAI,SAAS,KAAK,IAAI;YAAE,SAAS,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IACvD,CAAC,CAAC;IAEF,yEAAyE;IACzE,qEAAqE;IACrE,MAAM,QAAQ,GAAa;QACzB,EAAE,EAAE,WAAW,CAAC,EAAE;QAClB,WAAW,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,EAAE;QAC5C,OAAO,EAAE,GAAG,EAAE;YACZ,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE;gBAAE,OAAO,KAAK,CAAC;YACzC,aAAa,CACX,UAAU,EACV,mBAAmB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAC3D,CAAC;YACF,OAAO,IAAI,CAAC;QACd,CAAC;KACF,CAAC;IAEF,MAAM,KAAK,GAAkB;QAC3B,OAAO,CAAC,IAAqB;YAC3B,IAAI,QAAQ,CAAC,OAAO,EAAE;gBAAE,OAAO,IAAI,CAAC;YACpC,qEAAqE;YACrE,qEAAqE;YACrE,IAAI,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC;gBACvC,aAAa,CAAC,OAAO,EAAE,iBAAiB,IAAI,CAAC,QAAQ,UAAU,CAAC,CAAC;gBACjE,OAAO,IAAI,CAAC;YACd,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,aAAa,CACX,MAAM,EACN,IAAI,CAAC,WAAW,KAAK,wBAAwB;oBAC3C,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,wCAAwC,IAAI,CAAC,WAAW,iDAAiD,IAAI,CAAC,oBAAoB,EAAE;oBACnJ,CAAC,CAAC,mBAAmB,IAAI,CAAC,MAAM,UAAU,CAC7C,CAAC;gBACF,OAAO,IAAI,CAAC;YACd,CAAC;YACD,SAAS,CAAC,SAAS,EAAE,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,CAAC,MAA6B,EAAE,SAAwB;YAC5D,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,QAAQ;YACV,OAAO,IAAI,CAAC,QAAQ,CAAC;QACvB,CAAC;QACD,IAAI,aAAa;YACf,OAAO,IAAI,CAAC,aAAa,CAAC;QAC5B,CAAC;KACF,CAAC;IAEF,OAAO;QACL,KAAK;QACL,QAAQ;QACR,WAAW,EAAE,eAAe,CAAC,IAAI,CAAC,cAAc,CAAC;QACjD,SAAS;QACT,IAAI,SAAS;YACX,OAAO,SAAS,CAAC;QACnB,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,qBAAqB,CAAC;AAe5D;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAA4C;IAE5C,IAAI,OAAO,OAAO,EAAE,GAAG,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IACzD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAU,sBAAsB,CAAC,CAAC;IAC3D,OAAO,WAAW,CAAC,KAA8B,CAAC;QAChD,CAAC,CAAE,KAAmB;QACtB,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC"}