@aid-framework/runtime 0.0.0-stage → 0.1.39

package/dist/control.js

@@ -0,0 +1,281 @@
+/**
+ * Composite pipeline steps: `branch`, `parallel`, `map` and `reduce`.
+ *
+ * {@link Pipeline} is a sequential reducer, and it stays one. Each factory here returns
+ * an ordinary {@link Step}, so a composite composes with the flat steps by the same rule
+ * and replays unchanged on the streaming route, which inlines the pipeline instead of
+ * driving it step by step.
+ *
+ * Six context keys are reserved for the family, and no step may bind a name equal to one
+ * of them: `principal`, `limiter`, `item`, `index`, `depth` and `reduced`. The first
+ * two are seeded by the application, the rest are written and removed by the composites
+ * themselves, so an inner step can read `item` without a matching binding leaking to a
+ * later sibling.
+ *
+ * Two bounds are enforced here and both fail the run rather than degrade it:
+ *
+ * - nesting, at {@link MAX_STEP_DEPTH}. The spec layer rejects a deeper pipeline before
+ *   generation, so reaching this bound at run time means a hand-built pipeline, and the
+ *   reason is named in the error.
+ * - concurrency, through the application's one {@link ConcurrencyLimiter}. A fan-out
+ *   with no limiter in the context raises rather than running unbounded, because the cap
+ *   is what makes a fan-out safe and its absence is a wiring bug.
+ *
+ * This file mirrors `aid_runtime/control.py`.
+ */
+import { ConcurrencyLimiter, holdsSlot } from './concurrency.js';
+import { PipelineError } from './errors.js';
+import { repr } from './internal/json.js';
+import { STEPS_KEY } from './pipeline.js';
+import { evaluatePolicy, Principal, policySource } from './policy.js';
+/**
+ * Deepest composite nesting a pipeline may declare.
+ *
+ * The spec layer owns this number and the generator *emits* it into the generated
+ * package, so a generated app passes its own build's value; this default is what a
+ * hand-written pipeline gets. A test reads the spec constant and holds the two
+ * together, so a drift fails instead of diverging silently.
+ */
+export const MAX_STEP_DEPTH = 4;
+/** Who the caller is, for `branch`. Seeded by the route. */
+export const PRINCIPAL_KEY = 'principal';
+/** The application's single limiter, from `deployments.concurrency`. */
+export const LIMITER_KEY = 'limiter';
+/** The current item and its position, written by `map`/`reduce` for one iteration. */
+export const ITEM_KEY = 'item';
+export const INDEX_KEY = 'index';
+/** How many composites deep the current step is. */
+export const DEPTH_KEY = 'depth';
+/**
+ * The binding `reduce` collects from each iteration. Reserved so a reduce body's own
+ * binding cannot collide with the name the composite reads.
+ */
+export const REDUCED_KEY = 'reduced';
+/** Names a composite owns. A spec binding equal to one of them is refused upstream. */
+export const RESERVED_KEYS = new Set([
+    PRINCIPAL_KEY,
+    LIMITER_KEY,
+    ITEM_KEY,
+    INDEX_KEY,
+    DEPTH_KEY,
+    REDUCED_KEY,
+]);
+/**
+ * Name a composite's callable, so a trace and `Pipeline.of` identify it.
+ *
+ * `Pipeline` names a step by the callable's `name` and refuses two steps with the same
+ * name, so a pipeline holding two `branch` composites must give them distinct names. The
+ * generator passes one; the default is the kind.
+ */
+function named(step, name) {
+    if (name !== undefined) {
+        Object.defineProperty(step, 'name', { value: name, configurable: true });
+    }
+    return step;
+}
+function depthOf(context) {
+    const value = context.get(DEPTH_KEY, 0);
+    return typeof value === 'number' && Number.isFinite(value) ? Math.trunc(value) : 0;
+}
+/** The context a nested step list runs in, or a named refusal past the bound. */
+function enter(context, maxDepth, where) {
+    const depth = depthOf(context);
+    if (depth >= maxDepth) {
+        throw new PipelineError(`composite step ${where} is nested deeper than ${maxDepth} levels; ` +
+            'nesting is bounded so a self-similar spec cannot recurse without end');
+    }
+    return context.withValues({ [DEPTH_KEY]: depth + 1 });
+}
+function limiterFor(context, where) {
+    const limiter = context.get(LIMITER_KEY);
+    if (!(limiter instanceof ConcurrencyLimiter)) {
+        throw new PipelineError(`step ${where} fans out but the pipeline context has no concurrency limiter; ` +
+            'declare `concurrency` under a deployment in the spec so the generator seeds one');
+    }
+    return limiter;
+}
+/** Drop the iteration keys, so nothing a composite added reaches a later sibling. */
+function escapeIteration(context) {
+    return context.without(DEPTH_KEY, ITEM_KEY, INDEX_KEY, REDUCED_KEY);
+}
+/**
+ * Run one iteration and return its context with only the bindings it added.
+ *
+ * Only the added names come back, so a composite hands its siblings the bindings the
+ * spec declared and nothing else. The inner run records its own `steps`; it is excluded
+ * here because the outer `Pipeline.run` writes that key itself when the composite
+ * returns, and an inner list would otherwise be read as a binding.
+ */
+async function runBody(body, context) {
+    const result = await body.run(context);
+    const added = {};
+    for (const [key, value] of Object.entries(result.values)) {
+        if (!Object.hasOwn(context.values, key) && !RESERVED_KEYS.has(key) && key !== STEPS_KEY) {
+            added[key] = value;
+        }
+    }
+    return [result, added];
+}
+/**
+ * Run every worker, in the order given, whatever order they finish in.
+ *
+ * `Promise.allSettled` returns results positionally, so the caller's ordering rule is
+ * input order even when the last worker finishes first.
+ *
+ * A worker inside a slot this context already holds runs its siblings one at a time
+ * instead of acquiring a second slot: the limiter is shared with the gateway and the
+ * tool executor, so a worker that acquired again while its own body waited for the
+ * gateway would deadlock at a cap of one. Serialising keeps the cap and cannot deadlock,
+ * which is the trade this family makes at nesting depth two.
+ */
+async function fanOut(workers) {
+    if (holdsSlot()) {
+        const serial = [];
+        for (const worker of workers)
+            serial.push(await worker());
+        return serial;
+    }
+    const settled = await Promise.allSettled(workers.map((worker) => worker()));
+    // Every worker is awaited even after one fails, so nothing is left running and the
+    // error that surfaces is the first in input order rather than the first to finish.
+    for (const entry of settled) {
+        if (entry.status === 'rejected')
+            throw entry.reason;
+    }
+    return settled.map((entry) => entry.value);
+}
+/**
+ * Run `then` when the caller's principal satisfies `when`, else `otherwise`.
+ *
+ * `when` is a `PolicyExpr` AST, evaluated against the principal and nothing else: the
+ * grammar has no operand for a context value, so a branch cannot read what an earlier
+ * step produced. It is a plain mapping rather than a parsed object so the generated code
+ * passes the AST the IR already carries, and {@link evaluatePolicy} stays the only
+ * evaluator.
+ *
+ * No principal in the context is an error, not a false. Defaulting would decide an
+ * authorization question for a caller nobody identified.
+ */
+export function branch(options) {
+    const { when, then, otherwise, maxDepth = MAX_STEP_DEPTH, name } = options;
+    // Named `_branch` by default, matching the reference runtime, so `steps` reads alike.
+    const run = async function _branch(context) {
+        const principal = context.get(PRINCIPAL_KEY);
+        if (!(principal instanceof Principal)) {
+            throw new PipelineError(`branch needs a principal in the pipeline context to evaluate ${repr(policySource(when))}; none was seeded`);
+        }
+        const nested = enter(context, maxDepth, `branch (${policySource(when)})`);
+        const chosen = evaluatePolicy(when, principal) ? then : otherwise;
+        if (chosen === undefined) {
+            // No alternative declared: the branch binds nothing at all.
+            return escapeIteration(context);
+        }
+        const [, added] = await runBody(chosen, nested);
+        return escapeIteration(context.withValues(added));
+    };
+    return named(run, name);
+}
+/**
+ * Run every arm concurrently under the shared cap, then merge what they bound.
+ *
+ * A failing arm fails the whole run: the results are inspected in input order and the
+ * first failure is raised, so which error surfaces does not depend on which arm happened
+ * to fail first. Two arms binding the same new name is an error rather than a silent
+ * last-writer-wins, because the winning value would depend on completion order and the
+ * ordering rule exists to remove that.
+ */
+export function parallel(options) {
+    const { branches, maxDepth = MAX_STEP_DEPTH, name } = options;
+    const run = async function _parallel(context) {
+        if (branches.length === 0)
+            return escapeIteration(context);
+        const limiter = limiterFor(context, 'parallel');
+        const nested = enter(context, maxDepth, 'parallel');
+        const workers = branches.map((arm) => () => limiter.run(() => runBody(arm, nested)));
+        const outcomes = await fanOut(workers);
+        const merged = {};
+        for (const [, added] of outcomes) {
+            for (const [key, value] of Object.entries(added)) {
+                if (Object.hasOwn(merged, key)) {
+                    throw new PipelineError(`parallel arms both bind ${repr(key)}; a name may be bound by one arm`);
+                }
+                merged[key] = value;
+            }
+        }
+        return escapeIteration(context.withValues(merged));
+    };
+    return named(run, name);
+}
+/**
+ * Run `step` once per item of `over`, binding the results in input order.
+ *
+ * `as` holds one mapping of the names the body bound for that item, so an item that
+ * bound nothing contributes `{}` rather than vanishing: the list keeps the length of the
+ * input. An empty or absent-over value binds an empty list.
+ */
+export function mapStep(options) {
+    const { over, as: as_, step, maxDepth = MAX_STEP_DEPTH, name } = options;
+    const run = async function _map(context) {
+        const items = itemsOf(context, over, 'map');
+        const limiter = limiterFor(context, 'map');
+        const nested = enter(context, maxDepth, `map over ${repr(over)}`);
+        const workers = items.map((item, index) => () => {
+            const iteration = nested.withValues({ [ITEM_KEY]: item, [INDEX_KEY]: index });
+            return limiter.run(() => runBody(step, iteration));
+        });
+        const outcomes = await fanOut(workers);
+        return escapeIteration(context.withValues({ [as_]: outcomes.map(([, added]) => added) }));
+    };
+    return named(run, name);
+}
+/**
+ * Run `step` once per item of `over`, binding its {@link REDUCED_KEY} results.
+ *
+ * `step` is a one-step pipeline that renders the reduce prompt for one item and binds
+ * `reduced`; the composite collects that binding into `as` in input order. Combining the
+ * results is a following `generate` step, so this layer never invents a merge strategy.
+ */
+export function reduceStep(options) {
+    const { over, as: as_, step, maxDepth = MAX_STEP_DEPTH, name } = options;
+    const run = async function _reduce(context) {
+        const items = itemsOf(context, over, 'reduce');
+        const limiter = limiterFor(context, 'reduce');
+        const nested = enter(context, maxDepth, `reduce over ${repr(over)}`);
+        const workers = items.map((item, index) => () => {
+            const iteration = nested.withValues({ [ITEM_KEY]: item, [INDEX_KEY]: index });
+            return limiter.run(async () => {
+                const result = await step.run(iteration);
+                if (!Object.hasOwn(result.values, REDUCED_KEY)) {
+                    throw new PipelineError(`reduce over ${repr(over)} produced no ${repr(REDUCED_KEY)} binding for item ${index}`);
+                }
+                return [result, { [REDUCED_KEY]: result.require(REDUCED_KEY) }];
+            });
+        });
+        const outcomes = await fanOut(workers);
+        return escapeIteration(context.withValues({ [as_]: outcomes.map(([, added]) => added[REDUCED_KEY]) }));
+    };
+    return named(run, name);
+}
+/** The sequence a `map`/`reduce` iterates, refusing a missing or odd value. */
+function itemsOf(context, over, where) {
+    const value = context.require(over);
+    if (!Array.isArray(value)) {
+        throw new PipelineError(`${where} over ${repr(over)} needs a list, got ${typeName(value)}`);
+    }
+    return value;
+}
+/** The reference runtime's spelling of a type name, so both runtimes' errors read alike. */
+function typeName(value) {
+    if (value === null)
+        return 'NoneType';
+    if (Array.isArray(value))
+        return 'list';
+    if (typeof value === 'string')
+        return 'str';
+    if (typeof value === 'number')
+        return Number.isInteger(value) ? 'int' : 'float';
+    if (typeof value === 'boolean')
+        return 'bool';
+    return 'dict';
+}
+//# sourceMappingURL=control.js.map

package/dist/control.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"control.js","sourceRoot":"","sources":["../src/control.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAC1C,OAAO,EAAuC,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/E,OAAO,EAAE,cAAc,EAAmB,SAAS,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEvF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAEhC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,aAAa,GAAG,WAAW,CAAC;AACzC,wEAAwE;AACxE,MAAM,CAAC,MAAM,WAAW,GAAG,SAAS,CAAC;AACrC,sFAAsF;AACtF,MAAM,CAAC,MAAM,QAAQ,GAAG,MAAM,CAAC;AAC/B,MAAM,CAAC,MAAM,SAAS,GAAG,OAAO,CAAC;AACjC,oDAAoD;AACpD,MAAM,CAAC,MAAM,SAAS,GAAG,OAAO,CAAC;AACjC;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,SAAS,CAAC;AAErC,uFAAuF;AACvF,MAAM,CAAC,MAAM,aAAa,GAAwB,IAAI,GAAG,CAAC;IACxD,aAAa;IACb,WAAW;IACX,QAAQ;IACR,SAAS;IACT,SAAS;IACT,WAAW;CACZ,CAAC,CAAC;AAQH;;;;;;GAMG;AACH,SAAS,KAAK,CAAC,IAAmB,EAAE,IAAwB;IAC1D,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,OAAO,CAAC,OAAwB;IACvC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACxC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,iFAAiF;AACjF,SAAS,KAAK,CAAC,OAAwB,EAAE,QAAgB,EAAE,KAAa;IACtE,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC/B,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;QACtB,MAAM,IAAI,aAAa,CACrB,kBAAkB,KAAK,0BAA0B,QAAQ,WAAW;YAClE,sEAAsE,CACzE,CAAC;IACJ,CAAC;IACD,OAAO,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,UAAU,CAAC,OAAwB,EAAE,KAAa;IACzD,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACzC,IAAI,CAAC,CAAC,OAAO,YAAY,kBAAkB,CAAC,EAAE,CAAC;QAC7C,MAAM,IAAI,aAAa,CACrB,QAAQ,KAAK,iEAAiE;YAC5E,iFAAiF,CACpF,CAAC;IACJ,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,qFAAqF;AACrF,SAAS,eAAe,CAAC,OAAwB;IAC/C,OAAO,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;AACtE,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,OAAO,CAAC,IAAc,EAAE,OAAwB;IAC7D,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACvC,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACzD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACxF,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,MAAM,EAAE,KAAK,CAAU,CAAC;AAClC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,KAAK,UAAU,MAAM,CAAC,OAA8C;IAClE,IAAI,SAAS,EAAE,EAAE,CAAC;QAChB,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,MAAM,CAAC,IAAI,CAAC,MAAM,MAAM,EAAE,CAAC,CAAC;QAC1D,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC5E,mFAAmF;IACnF,mFAAmF;IACnF,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,MAAM,KAAK,UAAU;YAAE,MAAM,KAAK,CAAC,MAAM,CAAC;IACtD,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAE,KAAyC,CAAC,KAAK,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,MAAM,CAAC,OAMtB;IACC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,GAAG,cAAc,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;IAE3E,sFAAsF;IACtF,MAAM,GAAG,GAAG,KAAK,UAAU,OAAO,CAAC,OAAwB;QACzD,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC7C,IAAI,CAAC,CAAC,SAAS,YAAY,SAAS,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,aAAa,CACrB,gEAAgE,IAAI,CAClE,YAAY,CAAC,IAAI,CAAC,CACnB,mBAAmB,CACrB,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,WAAW,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1E,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;QAClE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,4DAA4D;YAC5D,OAAO,eAAe,CAAC,OAAO,CAAC,CAAC;QAClC,CAAC;QACD,MAAM,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAChD,OAAO,eAAe,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,OAIxB;IACC,MAAM,EAAE,QAAQ,EAAE,QAAQ,GAAG,cAAc,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;IAE9D,MAAM,GAAG,GAAG,KAAK,UAAU,SAAS,CAAC,OAAwB;QAC3D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,eAAe,CAAC,OAAO,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAEpD,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAC1B,CAAC,GAAG,EAAE,EAAE,CAAC,GAAqB,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CACzE,CAAC;QACF,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjD,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;oBAC/B,MAAM,IAAI,aAAa,CACrB,2BAA2B,IAAI,CAAC,GAAG,CAAC,kCAAkC,CACvE,CAAC;gBACJ,CAAC;gBACD,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,eAAe,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,OAMvB;IACC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,GAAG,cAAc,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;IAEzE,MAAM,GAAG,GAAG,KAAK,UAAU,IAAI,CAAC,OAAwB;QACtD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,YAAY,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAElE,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,GAAqB,EAAE;YAChE,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9E,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,CAAC;QACvC,OAAO,eAAe,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5F,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,OAM1B;IACC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,GAAG,cAAc,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;IAEzE,MAAM,GAAG,GAAG,KAAK,UAAU,OAAO,CAAC,OAAwB;QACzD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,eAAe,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAErE,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,GAAqB,EAAE;YAChE,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9E,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;gBAC5B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACzC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC;oBAC/C,MAAM,IAAI,aAAa,CACrB,eAAe,IAAI,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,WAAW,CAAC,qBAAqB,KAAK,EAAE,CACvF,CAAC;gBACJ,CAAC;gBACD,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAU,CAAC;YAC3E,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,CAAC;QACvC,OAAO,eAAe,CACpB,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAC/E,CAAC;IACJ,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,+EAA+E;AAC/E,SAAS,OAAO,CAAC,OAAwB,EAAE,IAAY,EAAE,KAAa;IACpE,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,aAAa,CAAC,GAAG,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,sBAAsB,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9F,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,4FAA4F;AAC5F,SAAS,QAAQ,CAAC,KAAc;IAC9B,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,UAAU,CAAC;IACtC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IACxC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;IAChF,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAC9C,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/cost.d.ts

@@ -0,0 +1,95 @@
+/**
+ * Cost accounting and budget enforcement.
+ *
+ * Cost is the budget this runtime enforces. A latency p95 budget is deliberately
+ * absent: it is only meaningful next to a dashboard, and a gate nobody reads is not
+ * a gate.
+ */
+import { type ModelSpec, TokenUsage } from './types.js';
+/** A spending ceiling for one scope (a run, a request, a nightly job). */
+export declare class Budget {
+    readonly maxUsd: number | undefined;
+    readonly maxTotalTokens: number | undefined;
+    readonly scope: string;
+    constructor(init: {
+        readonly maxUsd?: number;
+        readonly maxTotalTokens?: number;
+        readonly scope?: string;
+    });
+}
+/** One charged model call. */
+export declare class LedgerEntry {
+    readonly alias: string;
+    readonly model: string;
+    readonly provider: string;
+    readonly usage: TokenUsage;
+    readonly costUsd: number;
+    constructor(init: {
+        readonly alias: string;
+        readonly model: string;
+        readonly provider: string;
+        readonly usage: TokenUsage;
+        readonly costUsd: number;
+    });
+}
+/** Aggregate spend, suitable for a log line or an OTel span attribute. */
+export declare class SpendSummary {
+    readonly calls: number;
+    readonly inputTokens: number;
+    readonly outputTokens: number;
+    readonly costUsd: number;
+    readonly byModel: Readonly<Record<string, number>>;
+    constructor(init: {
+        readonly calls: number;
+        readonly inputTokens: number;
+        readonly outputTokens: number;
+        readonly costUsd: number;
+        readonly byModel?: Record<string, number>;
+    });
+    get totalTokens(): number;
+}
+/** Price a call against a pinned model's published cost. */
+export declare function estimateCostUsd(spec: ModelSpec, usage: TokenUsage): number;
+/**
+ * The runtime's token estimate for a text: four characters per token.
+ *
+ * The same approximation `estimatePromptCostUsd` uses, exposed because agent memory has to
+ * agree with it: a transcript trimmed against one estimate and priced against another would
+ * report a budget it did not honour.
+ */
+export declare function estimateTokens(text: string): number;
+/**
+ * Rough pre-flight price for a prompt, used to fail before spending.
+ *
+ * Four characters per token is the usual English approximation. It is deliberately
+ * an approximation, and the same one `estimate_tokens` uses in retrieval, so an
+ * offline estimate and an offline charge cannot disagree about what a text costs.
+ */
+export declare function estimatePromptCostUsd(spec: ModelSpec, text: string): number;
+/**
+ * Accumulates spend and refuses to let a budget be crossed.
+ *
+ * The ledger is intentionally not concurrency-safe: a gateway owns one ledger per
+ * logical run, and sharing one across concurrent runs would make "spent so far"
+ * meaningless.
+ */
+export declare class CostLedger {
+    private readonly _entries;
+    get entries(): readonly LedgerEntry[];
+    get costUsd(): number;
+    get totalTokens(): number;
+    /** Raise if current spend already violates `budget`. */
+    check(budget: Budget): void;
+    /**
+     * Record a call, throwing {@link BudgetExceededError} if it overshoots.
+     *
+     * The entry is recorded before the check so the ledger reflects what was actually
+     * spent when the error propagates: a caller that catches the error still sees
+     * truthful accounting.
+     */
+    charge(budget: Budget | undefined, entry: LedgerEntry): void;
+    summary(): SpendSummary;
+    private checkUsd;
+    private checkTokens;
+}
+//# sourceMappingURL=cost.d.ts.map

package/dist/cost.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost.d.ts","sourceRoot":"","sources":["../src/cost.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAAE,KAAK,SAAS,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AASxD,0EAA0E;AAC1E,qBAAa,MAAM;IACjB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IACpC,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAEvB,YAAY,IAAI,EAAE;QAChB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QACzB,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;QACjC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;KACzB,EAgBA;CACF;AAED,8BAA8B;AAC9B,qBAAa,WAAW;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IAEzB,YAAY,IAAI,EAAE;QAChB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;QAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;KAC1B,EAMA;CACF;AAED,0EAA0E;AAC1E,qBAAa,YAAY;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAEnD,YAAY,IAAI,EAAE;QAChB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;QAC9B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QACzB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAC3C,EAMA;IAED,IAAI,WAAW,IAAI,MAAM,CAExB;CACF;AAED,4DAA4D;AAC5D,wBAAgB,eAAe,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM,CAE1E;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAE3E;AAED;;;;;;GAMG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAqB;IAE9C,IAAI,OAAO,IAAI,SAAS,WAAW,EAAE,CAEpC;IAED,IAAI,OAAO,IAAI,MAAM,CAKpB;IAED,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,wDAAwD;IACxD,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAG1B;IAED;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,KAAK,EAAE,WAAW,GAAG,IAAI,CAI3D;IAED,OAAO,IAAI,YAAY,CAYtB;IAED,OAAO,CAAC,QAAQ;IAQhB,OAAO,CAAC,WAAW;CAOpB"}

package/dist/cost.js

@@ -0,0 +1,161 @@
+/**
+ * Cost accounting and budget enforcement.
+ *
+ * Cost is the budget this runtime enforces. A latency p95 budget is deliberately
+ * absent: it is only meaningful next to a dashboard, and a gate nobody reads is not
+ * a gate.
+ */
+import { BudgetExceededError } from './errors.js';
+import { roundTo } from './internal/json.js';
+import { TokenUsage } from './types.js';
+/**
+ * Prices are quoted per 1k tokens, so a call costs fractions of a cent. Six
+ * decimals keeps a single call representable without letting float error accumulate
+ * visibly over a long run.
+ */
+const USD_PRECISION = 6;
+/** A spending ceiling for one scope (a run, a request, a nightly job). */
+export class Budget {
+    maxUsd;
+    maxTotalTokens;
+    scope;
+    constructor(init) {
+        if (init.maxUsd === undefined && init.maxTotalTokens === undefined) {
+            throw new RangeError('a budget must set maxUsd, maxTotalTokens, or both');
+        }
+        if (init.maxUsd !== undefined && (!Number.isFinite(init.maxUsd) || init.maxUsd < 0)) {
+            throw new RangeError('maxUsd must be a non-negative number');
+        }
+        if (init.maxTotalTokens !== undefined &&
+            (!Number.isInteger(init.maxTotalTokens) || init.maxTotalTokens <= 0)) {
+            throw new RangeError('maxTotalTokens must be a positive integer');
+        }
+        this.maxUsd = init.maxUsd;
+        this.maxTotalTokens = init.maxTotalTokens;
+        this.scope = init.scope ?? 'run';
+    }
+}
+/** One charged model call. */
+export class LedgerEntry {
+    alias;
+    model;
+    provider;
+    usage;
+    costUsd;
+    constructor(init) {
+        this.alias = init.alias;
+        this.model = init.model;
+        this.provider = init.provider;
+        this.usage = init.usage;
+        this.costUsd = init.costUsd;
+    }
+}
+/** Aggregate spend, suitable for a log line or an OTel span attribute. */
+export class SpendSummary {
+    calls;
+    inputTokens;
+    outputTokens;
+    costUsd;
+    byModel;
+    constructor(init) {
+        this.calls = init.calls;
+        this.inputTokens = init.inputTokens;
+        this.outputTokens = init.outputTokens;
+        this.costUsd = init.costUsd;
+        this.byModel = init.byModel ?? {};
+    }
+    get totalTokens() {
+        return this.inputTokens + this.outputTokens;
+    }
+}
+/** Price a call against a pinned model's published cost. */
+export function estimateCostUsd(spec, usage) {
+    return spec.cost.costUsd(usage);
+}
+/**
+ * The runtime's token estimate for a text: four characters per token.
+ *
+ * The same approximation `estimatePromptCostUsd` uses, exposed because agent memory has to
+ * agree with it: a transcript trimmed against one estimate and priced against another would
+ * report a budget it did not honour.
+ */
+export function estimateTokens(text) {
+    return (text.length + 3) >> 2;
+}
+/**
+ * Rough pre-flight price for a prompt, used to fail before spending.
+ *
+ * Four characters per token is the usual English approximation. It is deliberately
+ * an approximation, and the same one `estimate_tokens` uses in retrieval, so an
+ * offline estimate and an offline charge cannot disagree about what a text costs.
+ */
+export function estimatePromptCostUsd(spec, text) {
+    return spec.cost.costUsd(new TokenUsage({ inputTokens: estimateTokens(text) }));
+}
+/**
+ * Accumulates spend and refuses to let a budget be crossed.
+ *
+ * The ledger is intentionally not concurrency-safe: a gateway owns one ledger per
+ * logical run, and sharing one across concurrent runs would make "spent so far"
+ * meaningless.
+ */
+export class CostLedger {
+    _entries = [];
+    get entries() {
+        return this._entries;
+    }
+    get costUsd() {
+        return roundTo(this._entries.reduce((total, entry) => total + entry.costUsd, 0), USD_PRECISION);
+    }
+    get totalTokens() {
+        return this._entries.reduce((total, entry) => total + entry.usage.totalTokens, 0);
+    }
+    /** Raise if current spend already violates `budget`. */
+    check(budget) {
+        this.checkUsd(budget);
+        this.checkTokens(budget);
+    }
+    /**
+     * Record a call, throwing {@link BudgetExceededError} if it overshoots.
+     *
+     * The entry is recorded before the check so the ledger reflects what was actually
+     * spent when the error propagates: a caller that catches the error still sees
+     * truthful accounting.
+     */
+    charge(budget, entry) {
+        this._entries.push(entry);
+        if (budget === undefined)
+            return;
+        this.check(budget);
+    }
+    summary() {
+        const byModel = {};
+        for (const entry of this._entries) {
+            byModel[entry.model] = roundTo((byModel[entry.model] ?? 0) + entry.costUsd, USD_PRECISION);
+        }
+        return new SpendSummary({
+            calls: this._entries.length,
+            inputTokens: this._entries.reduce((total, entry) => total + entry.usage.inputTokens, 0),
+            outputTokens: this._entries.reduce((total, entry) => total + entry.usage.outputTokens, 0),
+            costUsd: this.costUsd,
+            byModel,
+        });
+    }
+    checkUsd(budget) {
+        if (budget.maxUsd === undefined)
+            return;
+        const spent = this.costUsd;
+        if (spent > budget.maxUsd) {
+            throw new BudgetExceededError(budget.scope, budget.maxUsd, spent);
+        }
+    }
+    checkTokens(budget) {
+        if (budget.maxTotalTokens === undefined)
+            return;
+        const spentTokens = this.totalTokens;
+        if (spentTokens > budget.maxTotalTokens) {
+            throw new BudgetExceededError(budget.scope, budget.maxTotalTokens, spentTokens, 'tokens');
+        }
+    }
+}
+//# sourceMappingURL=cost.js.map

package/dist/cost.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost.js","sourceRoot":"","sources":["../src/cost.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAkB,UAAU,EAAE,MAAM,YAAY,CAAC;AAExD;;;;GAIG;AACH,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB,0EAA0E;AAC1E,MAAM,OAAO,MAAM;IACR,MAAM,CAAqB;IAC3B,cAAc,CAAqB;IACnC,KAAK,CAAS;IAEvB,YAAY,IAIX;QACC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YACnE,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;YACpF,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;QAC/D,CAAC;QACD,IACE,IAAI,CAAC,cAAc,KAAK,SAAS;YACjC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,cAAc,IAAI,CAAC,CAAC,EACpE,CAAC;YACD,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QAC1C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC;IACnC,CAAC;CACF;AAED,8BAA8B;AAC9B,MAAM,OAAO,WAAW;IACb,KAAK,CAAS;IACd,KAAK,CAAS;IACd,QAAQ,CAAS;IACjB,KAAK,CAAa;IAClB,OAAO,CAAS;IAEzB,YAAY,IAMX;QACC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;IAC9B,CAAC;CACF;AAED,0EAA0E;AAC1E,MAAM,OAAO,YAAY;IACd,KAAK,CAAS;IACd,WAAW,CAAS;IACpB,YAAY,CAAS;IACrB,OAAO,CAAS;IAChB,OAAO,CAAmC;IAEnD,YAAY,IAMX;QACC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;IACpC,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;IAC9C,CAAC;CACF;AAED,4DAA4D;AAC5D,MAAM,UAAU,eAAe,CAAC,IAAe,EAAE,KAAiB;IAChE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAClC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAe,EAAE,IAAY;IACjE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,EAAE,WAAW,EAAE,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,UAAU;IACJ,QAAQ,GAAkB,EAAE,CAAC;IAE9C,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,OAAO,CACZ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,EAChE,aAAa,CACd,CAAC;IACJ,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,wDAAwD;IACxD,KAAK,CAAC,MAAc;QAClB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,MAA0B,EAAE,KAAkB;QACnD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO;QACjC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACrB,CAAC;IAED,OAAO;QACL,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QAC7F,CAAC;QACD,OAAO,IAAI,YAAY,CAAC;YACtB,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM;YAC3B,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;YACvF,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;YACzF,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,OAAO;SACR,CAAC,CAAC;IACL,CAAC;IAEO,QAAQ,CAAC,MAAc;QAC7B,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;QAC3B,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,mBAAmB,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAEO,WAAW,CAAC,MAAc;QAChC,IAAI,MAAM,CAAC,cAAc,KAAK,SAAS;YAAE,OAAO;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACrC,IAAI,WAAW,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YACxC,MAAM,IAAI,mBAAmB,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,cAAc,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QAC5F,CAAC;IACH,CAAC;CACF"}