@vauban-org/agent-sdk 0.16.0

package/dist/economy/outcome-tracker.js

@@ -0,0 +1,172 @@
+/**
+ * economy/outcome-tracker — Per-cycle cost accounting, in-memory store.
+ *
+ * Closes the "agent_run.cost_usd always zero" gap (Sprint 0 v1).
+ *
+ * Design principles:
+ *   • No DB dependency — substrate is product-agnostic.
+ *   • Host wires DB persistence via OutcomeHook.
+ *   • Cost computed from TierPolicy pricing; unknown models default to 0.
+ */
+import { lookupTier } from "./tier-policy.js";
+// ─── OutcomeTracker ───────────────────────────────────────────────────────
+/**
+ * OutcomeTracker records token usage per cycle and computes cost_usd
+ * from the injected TierPolicy.
+ *
+ * Usage:
+ *   const tracker = new OutcomeTracker(policy, hook);
+ *   const cost = tracker.record(runId, "litellm/default-fast", 1200, 300, 1800);
+ *   await tracker.flush(runId);
+ */
+export class OutcomeTracker {
+    _policy;
+    _hook;
+    /** In-memory store: runId → list of CycleCost records. */
+    _store = new Map();
+    constructor(policy, hook) {
+        this._policy = policy;
+        this._hook = hook;
+    }
+    /**
+     * Record tokens used by one cycle.
+     *
+     * @param runId        - Unique run identifier.
+     * @param model        - "provider/model" string, e.g. "litellm/default-fast" or "groq/llama-3.3-70b-versatile".
+     * @param inputTokens  - Number of input tokens consumed.
+     * @param outputTokens - Number of output tokens produced.
+     * @param durationMs   - Wall-clock duration of the cycle.
+     * @param opts         - Optional: skillId for Sprint C skill attribution.
+     */
+    record(runId, model, inputTokens, outputTokens, durationMs, opts) {
+        const { provider, modelName } = parseModel(model);
+        const tier = lookupTier(provider, modelName);
+        const costUsd = tier !== undefined
+            ? (inputTokens / 1_000_000) * tier.costPerMTokenIn +
+                (outputTokens / 1_000_000) * tier.costPerMTokenOut
+            : 0;
+        // Also try via policy catalog for consumer-injected tiers.
+        // We use the "standard" category degraded mode to get a list, then check
+        // if any matches — this is a fallback for consumer tiers not in built-in catalog.
+        let tierLabel = tier?.label ?? "unknown";
+        if (tier === undefined) {
+            const candidates = this._policy.tiersFor("standard", "degraded");
+            const match = candidates.find((t) => t.provider === provider && t.model === modelName);
+            if (match !== undefined) {
+                tierLabel = match.label;
+                const matchedCost = (inputTokens / 1_000_000) * match.costPerMTokenIn +
+                    (outputTokens / 1_000_000) * match.costPerMTokenOut;
+                const cycleCost = {
+                    runId,
+                    inputTokens,
+                    outputTokens,
+                    costUsd: matchedCost,
+                    modelTier: tierLabel,
+                    durationMs,
+                    ...(opts?.skillId !== undefined ? { skillId: opts.skillId } : {}),
+                    ...(opts?.outcomeValue !== undefined
+                        ? { outcomeValue: opts.outcomeValue }
+                        : {}),
+                    ...(opts?.category !== undefined ? { category: opts.category } : {}),
+                };
+                this._push(runId, cycleCost);
+                return cycleCost;
+            }
+        }
+        const cycleCost = {
+            runId,
+            inputTokens,
+            outputTokens,
+            costUsd,
+            modelTier: tierLabel,
+            durationMs,
+            ...(opts?.skillId !== undefined ? { skillId: opts.skillId } : {}),
+            ...(opts?.outcomeValue !== undefined
+                ? { outcomeValue: opts.outcomeValue }
+                : {}),
+            ...(opts?.category !== undefined ? { category: opts.category } : {}),
+        };
+        this._push(runId, cycleCost);
+        return cycleCost;
+    }
+    /**
+     * Flush all recorded cycles for a runId to the consumer hook.
+     * Noop if no hook is configured or no records exist for the runId.
+     */
+    async flush(runId) {
+        if (this._hook === undefined)
+            return;
+        const records = this._store.get(runId);
+        if (records === undefined || records.length === 0)
+            return;
+        for (const cost of records) {
+            await this._hook.onCycleEnd(runId, cost);
+        }
+    }
+    /**
+     * Get all recorded costs, optionally filtered to a trailing time window.
+     *
+     * @param windowMs - If provided, only return records within the last windowMs milliseconds.
+     *                   The tracker uses the current time as the reference point and
+     *                   estimates record time by insertion order (no timestamp stored per record).
+     *                   For window filtering, use totalCostInWindow() which is time-aware.
+     */
+    getCosts(windowMs) {
+        const all = [];
+        for (const records of this._store.values()) {
+            all.push(...records);
+        }
+        if (windowMs === undefined)
+            return all;
+        // Without per-record timestamps, return all (host should use totalCostInWindow).
+        return all;
+    }
+    /**
+     * Running total cost (USD) across all recorded cycles within the time window.
+     * Default window: last 1 hour (3_600_000 ms).
+     *
+     * Uses an internal timestamped wrapper to implement accurate windowing.
+     */
+    totalCostInWindow(windowMs = 3_600_000) {
+        const cutoff = Date.now() - windowMs;
+        let total = 0;
+        for (const records of this._timestamped.values()) {
+            for (const r of records) {
+                if (r.ts >= cutoff) {
+                    total += r.cost.costUsd;
+                }
+            }
+        }
+        return total;
+    }
+    // ─── Private helpers ───────────────────────────────────────────────────
+    /** Timestamped record store for window queries. */
+    _timestamped = new Map();
+    _push(runId, cost) {
+        // Plain store
+        const list = this._store.get(runId) ?? [];
+        list.push(cost);
+        this._store.set(runId, list);
+        // Timestamped store
+        const tsList = this._timestamped.get(runId) ?? [];
+        tsList.push({ ts: Date.now(), cost });
+        this._timestamped.set(runId, tsList);
+    }
+}
+// ─── Internal helpers ─────────────────────────────────────────────────────
+/**
+ * Parse "provider/model" string.
+ * If no "/" is present, treats the whole string as the model name with an
+ * empty provider (will not match any built-in tier).
+ */
+function parseModel(model) {
+    const idx = model.indexOf("/");
+    if (idx === -1) {
+        return { provider: "", modelName: model };
+    }
+    return {
+        provider: model.slice(0, idx),
+        modelName: model.slice(idx + 1),
+    };
+}
+//# sourceMappingURL=outcome-tracker.js.map

package/dist/economy/outcome-tracker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"outcome-tracker.js","sourceRoot":"","sources":["../../src/economy/outcome-tracker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AA6B9C,6EAA6E;AAE7E;;;;;;;;GAQG;AACH,MAAM,OAAO,cAAc;IACR,OAAO,CAAa;IACpB,KAAK,CAA0B;IAChD,0DAA0D;IACzC,MAAM,GAA6B,IAAI,GAAG,EAAE,CAAC;IAE9D,YAAY,MAAkB,EAAE,IAAkB;QAChD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CACJ,KAAa,EACb,KAAa,EACb,WAAmB,EACnB,YAAoB,EACpB,UAAkB,EAClB,IAAqE;QAErE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE7C,MAAM,OAAO,GACX,IAAI,KAAK,SAAS;YAChB,CAAC,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,eAAe;gBAChD,CAAC,YAAY,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,gBAAgB;YACpD,CAAC,CAAC,CAAC,CAAC;QAER,2DAA2D;QAC3D,yEAAyE;QACzE,kFAAkF;QAClF,IAAI,SAAS,GAAG,IAAI,EAAE,KAAK,IAAI,SAAS,CAAC;QACzC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjE,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAC3B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,CACxD,CAAC;YACF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC;gBACxB,MAAM,WAAW,GACf,CAAC,WAAW,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,eAAe;oBACjD,CAAC,YAAY,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC;gBACtD,MAAM,SAAS,GAAc;oBAC3B,KAAK;oBACL,WAAW;oBACX,YAAY;oBACZ,OAAO,EAAE,WAAW;oBACpB,SAAS,EAAE,SAAS;oBACpB,UAAU;oBACV,GAAG,CAAC,IAAI,EAAE,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjE,GAAG,CAAC,IAAI,EAAE,YAAY,KAAK,SAAS;wBAClC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE;wBACrC,CAAC,CAAC,EAAE,CAAC;oBACP,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACrE,CAAC;gBACF,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gBAC7B,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAc;YAC3B,KAAK;YACL,WAAW;YACX,YAAY;YACZ,OAAO;YACP,SAAS,EAAE,SAAS;YACpB,UAAU;YACV,GAAG,CAAC,IAAI,EAAE,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjE,GAAG,CAAC,IAAI,EAAE,YAAY,KAAK,SAAS;gBAClC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE;gBACrC,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACrE,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC7B,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAK,CAAC,KAAa;QACvB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,OAAO;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC1D,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAiB;QACxB,MAAM,GAAG,GAAgB,EAAE,CAAC;QAC5B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;QACvB,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QACvC,iFAAiF;QACjF,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,iBAAiB,CAAC,WAAmB,SAAS;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,IAAI,CAAC,CAAC,EAAE,IAAI,MAAM,EAAE,CAAC;oBACnB,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0EAA0E;IAE1E,mDAAmD;IAClC,YAAY,GAGzB,IAAI,GAAG,EAAE,CAAC;IAEN,KAAK,CAAC,KAAa,EAAE,IAAe;QAC1C,cAAc;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAE7B,oBAAoB;QACpB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAClD,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;CACF;AAED,6EAA6E;AAE7E;;;;GAIG;AACH,SAAS,UAAU,CAAC,KAAa;IAC/B,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QACf,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC5C,CAAC;IACD,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;QAC7B,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;KAChC,CAAC;AACJ,CAAC"}

package/dist/economy/router.d.ts

@@ -0,0 +1,97 @@
+/**
+ * economy/router — EconomyRouter dual-mode (Sprint D).
+ *
+ * Decides WHICH model tier to use for a given task category, based on
+ * observed cost-per-cycle data from OutcomeTracker. Sits ABOVE TierPolicy
+ * (which produces the candidate set) and is informed by FleetCircuitBreaker.
+ *
+ * NOT to be confused with the compute-strategy router (withCompute, Sprint A)
+ * or the legacy heuristic complexity router (src/router/llm-router.ts).
+ *
+ * Substrate-pure: no consumer-specific product references.
+ */
+import type { ModelTier, TierPolicy } from "./tier-policy.js";
+import type { OutcomeTracker } from "./outcome-tracker.js";
+import type { FleetCircuitBreaker } from "./circuit-breaker.js";
+export type EconomyMode = "degraded" | "full";
+export interface EconomyRouterConfig {
+    mode: EconomyMode;
+    policy: TierPolicy;
+    tracker: OutcomeTracker;
+    breaker: FleetCircuitBreaker;
+    /** Fraction of budget to leave as buffer when filtering tiers by cost. Default 0.1 (10%). */
+    budgetBuffer?: number;
+}
+export interface RouteDecision {
+    tier: ModelTier;
+    mode: EconomyMode;
+    reason: string;
+    blockedByBreaker: boolean;
+}
+/**
+ * EconomyRouter — model tier selector informed by observed costs.
+ *
+ * Degraded mode: cost lookup is per task category.
+ * Full mode (Sprint C): cost lookup is per skillId. Falls back to degraded
+ *   when no skill data is available.
+ */
+export declare class EconomyRouter {
+    private readonly _mode;
+    private readonly _policy;
+    private readonly _tracker;
+    private readonly _breaker;
+    private readonly _budgetBuffer;
+    /** Total `route()` calls. */
+    private _totalRouteCalls;
+    /** Calls where `blockedByBreaker` was false. */
+    private _nonBlockedRouteCalls;
+    constructor(config: EconomyRouterConfig);
+    /**
+     * Decide which tier to use for a task.
+     *
+     * Caller is responsible for honouring `blockedByBreaker` — when true,
+     * the returned tier is informational and the caller should typically
+     * defer or run a degraded execution path.
+     */
+    route(category: string, opts?: {
+        skillId?: string;
+        budgetRemainingUsd?: number;
+    }): RouteDecision;
+    /**
+     * Record outcome of a completed cycle. Propagates to OutcomeTracker
+     * (which computes cost from pricing) AND to FleetCircuitBreaker.
+     *
+     * The model identifier sent to the tracker is `provider/model` per
+     * tracker convention.
+     */
+    recordOutcome(runId: string, tier: ModelTier, inputTokens: number, outputTokens: number, durationMs: number, opts?: {
+        skillId?: string;
+        outcomeValue?: number;
+        category?: string;
+    }): void;
+    /**
+     * Routing rate: fraction of `route()` calls that returned non-blocked.
+     * 0 when no calls have been made (cannot divide by zero).
+     */
+    get routingRate(): number;
+    /**
+     * Compute average cost-per-cycle observed within the rolling window.
+     *
+     * In "full" mode with a skillId, we filter records by skillId.
+     * Falls back to category filtering when:
+     *   - mode is degraded, OR
+     *   - skillId is undefined, OR
+     *   - no records match the skillId.
+     *
+     * Returns undefined when no records match (caller treats as "no history").
+     */
+    private _observedAvgCostUsd;
+    /**
+     * Estimate the cost (USD) of one tier call. Used for budget filtering.
+     * Heuristic: assume 1k output tokens per call (output dominates cost).
+     */
+    private _estimateCallCost;
+    /** Return the cheapest tier in a non-empty list (by output cost). */
+    private _cheapest;
+}
+//# sourceMappingURL=router.d.ts.map

package/dist/economy/router.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.d.ts","sourceRoot":"","sources":["../../src/economy/router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAa,MAAM,sBAAsB,CAAC;AACtE,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAIhE,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,MAAM,CAAC;AAE9C,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,WAAW,CAAC;IAClB,MAAM,EAAE,UAAU,CAAC;IACnB,OAAO,EAAE,cAAc,CAAC;IACxB,OAAO,EAAE,mBAAmB,CAAC;IAC7B,6FAA6F;IAC7F,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,SAAS,CAAC;IAChB,IAAI,EAAE,WAAW,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,gBAAgB,EAAE,OAAO,CAAC;CAC3B;AAiBD;;;;;;GAMG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAc;IACpC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAa;IACrC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAiB;IAC1C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAsB;IAC/C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IAEvC,6BAA6B;IAC7B,OAAO,CAAC,gBAAgB,CAAK;IAC7B,gDAAgD;IAChD,OAAO,CAAC,qBAAqB,CAAK;gBAEtB,MAAM,EAAE,mBAAmB;IAQvC;;;;;;OAMG;IACH,KAAK,CACH,QAAQ,EAAE,MAAM,EAChB,IAAI,CAAC,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,kBAAkB,CAAC,EAAE,MAAM,CAAA;KAAE,GACvD,aAAa;IA0DhB;;;;;;OAMG;IACH,aAAa,CACX,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,IAAI,CAAC,EAAE;QACL,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,YAAY,CAAC,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;KACnB,GACA,IAAI;IAmBP;;;OAGG;IACH,IAAI,WAAW,IAAI,MAAM,CAGxB;IAID;;;;;;;;;;OAUG;IACH,OAAO,CAAC,mBAAmB;IAuB3B;;;OAGG;IACH,OAAO,CAAC,iBAAiB;IAIzB,qEAAqE;IACrE,OAAO,CAAC,SAAS;CAOlB"}

package/dist/economy/router.js

@@ -0,0 +1,181 @@
+/**
+ * economy/router — EconomyRouter dual-mode (Sprint D).
+ *
+ * Decides WHICH model tier to use for a given task category, based on
+ * observed cost-per-cycle data from OutcomeTracker. Sits ABOVE TierPolicy
+ * (which produces the candidate set) and is informed by FleetCircuitBreaker.
+ *
+ * NOT to be confused with the compute-strategy router (withCompute, Sprint A)
+ * or the legacy heuristic complexity router (src/router/llm-router.ts).
+ *
+ * Substrate-pure: no consumer-specific product references.
+ */
+// ─── Internal constants ───────────────────────────────────────────────────
+/** Default rolling cost-window for tier-cost averaging. 1 hour. */
+const COST_WINDOW_MS = 3_600_000;
+/**
+ * Cost ceiling for "cheap-enough to upgrade" heuristic, in USD per cycle.
+ * Below this average cycle cost, the router will try a tier ABOVE the policy
+ * default (better quality at acceptable cost). Above it, downgrade.
+ */
+const UPGRADE_THRESHOLD_USD = 0.005;
+const DOWNGRADE_THRESHOLD_USD = 0.05;
+// ─── EconomyRouter ────────────────────────────────────────────────────────
+/**
+ * EconomyRouter — model tier selector informed by observed costs.
+ *
+ * Degraded mode: cost lookup is per task category.
+ * Full mode (Sprint C): cost lookup is per skillId. Falls back to degraded
+ *   when no skill data is available.
+ */
+export class EconomyRouter {
+    _mode;
+    _policy;
+    _tracker;
+    _breaker;
+    _budgetBuffer;
+    /** Total `route()` calls. */
+    _totalRouteCalls = 0;
+    /** Calls where `blockedByBreaker` was false. */
+    _nonBlockedRouteCalls = 0;
+    constructor(config) {
+        this._mode = config.mode;
+        this._policy = config.policy;
+        this._tracker = config.tracker;
+        this._breaker = config.breaker;
+        this._budgetBuffer = config.budgetBuffer ?? 0.1;
+    }
+    /**
+     * Decide which tier to use for a task.
+     *
+     * Caller is responsible for honouring `blockedByBreaker` — when true,
+     * the returned tier is informational and the caller should typically
+     * defer or run a degraded execution path.
+     */
+    route(category, opts) {
+        this._totalRouteCalls += 1;
+        const blockedByBreaker = !this._breaker.canProceed();
+        const candidates = this._policy.tiersFor(category, this._mode);
+        if (candidates.length === 0) {
+            // Defensive: empty candidate set should never happen with DefaultTierPolicy
+            // but custom policies might. Surface a clear error.
+            throw new Error(`EconomyRouter: TierPolicy returned no candidates for category "${category}"`);
+        }
+        // Apply budget filter (if provided).
+        const budget = opts?.budgetRemainingUsd;
+        const affordable = budget !== undefined
+            ? candidates.filter((t) => this._estimateCallCost(t) <= budget * (1 - this._budgetBuffer))
+            : candidates;
+        // If budget filtered everything, fall back to cheapest known tier.
+        let pool = affordable.length > 0 ? affordable : [this._cheapest(candidates)];
+        // Cost-history-driven tier selection.
+        const avgCost = this._observedAvgCostUsd(category, opts?.skillId);
+        let chosen;
+        let reason;
+        if (avgCost === undefined) {
+            // No history — use policy default (head of list, intersected with affordable pool).
+            chosen = pool[0];
+            reason = "default-tier-no-history";
+        }
+        else if (avgCost < UPGRADE_THRESHOLD_USD) {
+            // Cheap-enough average → try to upgrade one tier.
+            chosen = pool.length >= 2 ? pool[1] : pool[0];
+            reason = pool.length >= 2 ? "upgrade-cheap-history" : "default-no-upgrade-available";
+        }
+        else if (avgCost > DOWNGRADE_THRESHOLD_USD) {
+            // Too expensive on average → downgrade to cheapest of pool.
+            chosen = this._cheapest(pool);
+            reason = "downgrade-expensive-history";
+        }
+        else {
+            // Within band — keep policy default (head of pool).
+            chosen = pool[0];
+            reason = "default-tier-within-band";
+        }
+        if (!blockedByBreaker) {
+            this._nonBlockedRouteCalls += 1;
+        }
+        return {
+            tier: chosen,
+            mode: this._mode,
+            reason: blockedByBreaker ? `${reason}+breaker-open` : reason,
+            blockedByBreaker,
+        };
+    }
+    /**
+     * Record outcome of a completed cycle. Propagates to OutcomeTracker
+     * (which computes cost from pricing) AND to FleetCircuitBreaker.
+     *
+     * The model identifier sent to the tracker is `provider/model` per
+     * tracker convention.
+     */
+    recordOutcome(runId, tier, inputTokens, outputTokens, durationMs, opts) {
+        const modelStr = `${tier.provider}/${tier.model}`;
+        const cost = this._tracker.record(runId, modelStr, inputTokens, outputTokens, durationMs, {
+            ...(opts?.skillId !== undefined ? { skillId: opts.skillId } : {}),
+            ...(opts?.outcomeValue !== undefined
+                ? { outcomeValue: opts.outcomeValue }
+                : {}),
+            ...(opts?.category !== undefined ? { category: opts.category } : {}),
+        });
+        this._breaker.recordCost(cost.costUsd);
+    }
+    /**
+     * Routing rate: fraction of `route()` calls that returned non-blocked.
+     * 0 when no calls have been made (cannot divide by zero).
+     */
+    get routingRate() {
+        if (this._totalRouteCalls === 0)
+            return 0;
+        return this._nonBlockedRouteCalls / this._totalRouteCalls;
+    }
+    // ─── Private helpers ───────────────────────────────────────────────────
+    /**
+     * Compute average cost-per-cycle observed within the rolling window.
+     *
+     * In "full" mode with a skillId, we filter records by skillId.
+     * Falls back to category filtering when:
+     *   - mode is degraded, OR
+     *   - skillId is undefined, OR
+     *   - no records match the skillId.
+     *
+     * Returns undefined when no records match (caller treats as "no history").
+     */
+    _observedAvgCostUsd(category, skillId) {
+        const all = this._tracker.getCosts(COST_WINDOW_MS);
+        if (all.length === 0)
+            return undefined;
+        let pool = [];
+        if (this._mode === "full" && skillId !== undefined) {
+            pool = all.filter((r) => r.skillId === skillId);
+            if (pool.length === 0) {
+                // Fall back to category in full mode when no skill data yet.
+                pool = all.filter((r) => r.category === category);
+            }
+        }
+        else {
+            pool = all.filter((r) => r.category === category);
+        }
+        if (pool.length === 0)
+            return undefined;
+        const sum = pool.reduce((acc, r) => acc + r.costUsd, 0);
+        return sum / pool.length;
+    }
+    /**
+     * Estimate the cost (USD) of one tier call. Used for budget filtering.
+     * Heuristic: assume 1k output tokens per call (output dominates cost).
+     */
+    _estimateCallCost(tier) {
+        return (1_000 / 1_000_000) * tier.costPerMTokenOut;
+    }
+    /** Return the cheapest tier in a non-empty list (by output cost). */
+    _cheapest(tiers) {
+        let best = tiers[0];
+        for (const t of tiers) {
+            if (t.costPerMTokenOut < best.costPerMTokenOut)
+                best = t;
+        }
+        return best;
+    }
+}
+//# sourceMappingURL=router.js.map

package/dist/economy/router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.js","sourceRoot":"","sources":["../../src/economy/router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AA0BH,6EAA6E;AAE7E,mEAAmE;AACnE,MAAM,cAAc,GAAG,SAAS,CAAC;AAEjC;;;;GAIG;AACH,MAAM,qBAAqB,GAAG,KAAK,CAAC;AACpC,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAErC,6EAA6E;AAE7E;;;;;;GAMG;AACH,MAAM,OAAO,aAAa;IACP,KAAK,CAAc;IACnB,OAAO,CAAa;IACpB,QAAQ,CAAiB;IACzB,QAAQ,CAAsB;IAC9B,aAAa,CAAS;IAEvC,6BAA6B;IACrB,gBAAgB,GAAG,CAAC,CAAC;IAC7B,gDAAgD;IACxC,qBAAqB,GAAG,CAAC,CAAC;IAElC,YAAY,MAA2B;QACrC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC,YAAY,IAAI,GAAG,CAAC;IAClD,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CACH,QAAgB,EAChB,IAAwD;QAExD,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAE3B,MAAM,gBAAgB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC;QACrD,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,4EAA4E;YAC5E,oDAAoD;YACpD,MAAM,IAAI,KAAK,CACb,kEAAkE,QAAQ,GAAG,CAC9E,CAAC;QACJ,CAAC;QAED,qCAAqC;QACrC,MAAM,MAAM,GAAG,IAAI,EAAE,kBAAkB,CAAC;QACxC,MAAM,UAAU,GACd,MAAM,KAAK,SAAS;YAClB,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;YAC1F,CAAC,CAAC,UAAU,CAAC;QAEjB,mEAAmE;QACnE,IAAI,IAAI,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;QAE7E,sCAAsC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAClE,IAAI,MAAiB,CAAC;QACtB,IAAI,MAAc,CAAC;QAEnB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,oFAAoF;YACpF,MAAM,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YAClB,MAAM,GAAG,yBAAyB,CAAC;QACrC,CAAC;aAAM,IAAI,OAAO,GAAG,qBAAqB,EAAE,CAAC;YAC3C,kDAAkD;YAClD,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;YAChD,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,8BAA8B,CAAC;QACvF,CAAC;aAAM,IAAI,OAAO,GAAG,uBAAuB,EAAE,CAAC;YAC7C,4DAA4D;YAC5D,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAC9B,MAAM,GAAG,6BAA6B,CAAC;QACzC,CAAC;aAAM,CAAC;YACN,oDAAoD;YACpD,MAAM,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YAClB,MAAM,GAAG,0BAA0B,CAAC;QACtC,CAAC;QAED,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,IAAI,CAAC,qBAAqB,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,OAAO;YACL,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE,IAAI,CAAC,KAAK;YAChB,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,MAAM,eAAe,CAAC,CAAC,CAAC,MAAM;YAC5D,gBAAgB;SACjB,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,aAAa,CACX,KAAa,EACb,IAAe,EACf,WAAmB,EACnB,YAAoB,EACpB,UAAkB,EAClB,IAIC;QAED,MAAM,QAAQ,GAAG,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAC/B,KAAK,EACL,QAAQ,EACR,WAAW,EACX,YAAY,EACZ,UAAU,EACV;YACE,GAAG,CAAC,IAAI,EAAE,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjE,GAAG,CAAC,IAAI,EAAE,YAAY,KAAK,SAAS;gBAClC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE;gBACrC,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACrE,CACF,CAAC;QACF,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;IAED;;;OAGG;IACH,IAAI,WAAW;QACb,IAAI,IAAI,CAAC,gBAAgB,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAC,gBAAgB,CAAC;IAC5D,CAAC;IAED,0EAA0E;IAE1E;;;;;;;;;;OAUG;IACK,mBAAmB,CACzB,QAAgB,EAChB,OAA2B;QAE3B,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;QACnD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAEvC,IAAI,IAAI,GAAgB,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,KAAK,KAAK,MAAM,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACnD,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;YAChD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,6DAA6D;gBAC7D,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACxD,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,IAAe;QACvC,OAAO,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC;IACrD,CAAC;IAED,qEAAqE;IAC7D,SAAS,CAAC,KAAkB;QAClC,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB;gBAAE,IAAI,GAAG,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/economy/tier-policy.d.ts

@@ -0,0 +1,46 @@
+/**
+ * economy/tier-policy — Model tier catalog and routing policy.
+ *
+ * Substrate-pure: no consumer-specific names anywhere.
+ * Consumers inject a custom TierPolicy implementation to override defaults.
+ */
+export interface ModelTier {
+    /** Provider identifier: "litellm" | "groq" | "anthropic" | etc. */
+    provider: string;
+    /** Model alias as configured in the provider. e.g. "default-fast", "deepseek-v4-flash". */
+    model: string;
+    /** USD per 1M input tokens. 0 when unknown or local (free). */
+    costPerMTokenIn: number;
+    /** USD per 1M output tokens. */
+    costPerMTokenOut: number;
+    label: "free" | "cheap" | "mid" | "premium";
+}
+export interface TierPolicy {
+    /**
+     * Return an ordered list of tiers to try for a given task category.
+     * First element = preferred tier.
+     *
+     * @param category - Task category: "simple" | "standard" | "complex" | "reasoning" | string
+     * @param mode     - "degraded" uses cost-minimising static routing;
+     *                   "full" allows observed cost-per-outcome to influence order.
+     */
+    tiersFor(category: string, mode: "degraded" | "full"): ModelTier[];
+}
+/**
+ * DefaultTierPolicy — static cost-minimising routing.
+ *
+ * "degraded" mode: purely static, category → ordered tier list.
+ * "full" mode: same tiers returned in same order; the *caller* (economy router)
+ *   is responsible for re-ordering by observed cost-per-outcome from OutcomeTracker.
+ *   This class only supplies the candidate set.
+ */
+export declare class DefaultTierPolicy implements TierPolicy {
+    tiersFor(category: string, _mode: "degraded" | "full"): ModelTier[];
+}
+/**
+ * Look up a ModelTier by provider+model from the built-in catalog.
+ * Returns undefined if the model is not in the default catalog
+ * (consumers may use custom tiers not registered here).
+ */
+export declare function lookupTier(provider: string, model: string): ModelTier | undefined;
+//# sourceMappingURL=tier-policy.d.ts.map

package/dist/economy/tier-policy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier-policy.d.ts","sourceRoot":"","sources":["../../src/economy/tier-policy.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,WAAW,SAAS;IACxB,mEAAmE;IACnE,QAAQ,EAAE,MAAM,CAAC;IACjB,2FAA2F;IAC3F,KAAK,EAAE,MAAM,CAAC;IACd,+DAA+D;IAC/D,eAAe,EAAE,MAAM,CAAC;IACxB,gCAAgC;IAChC,gBAAgB,EAAE,MAAM,CAAC;IACzB,KAAK,EAAE,MAAM,GAAG,OAAO,GAAG,KAAK,GAAG,SAAS,CAAC;CAC7C;AAED,MAAM,WAAW,UAAU;IACzB;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,EAAE,CAAC;CACpE;AAqDD;;;;;;;GAOG;AACH,qBAAa,iBAAkB,YAAW,UAAU;IAClD,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,EAAE;CAOpE;AAID;;;;GAIG;AACH,wBAAgB,UAAU,CACxB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,GACZ,SAAS,GAAG,SAAS,CAGvB"}

package/dist/economy/tier-policy.js

@@ -0,0 +1,76 @@
+/**
+ * economy/tier-policy — Model tier catalog and routing policy.
+ *
+ * Substrate-pure: no consumer-specific names anywhere.
+ * Consumers inject a custom TierPolicy implementation to override defaults.
+ */
+// ─── Built-in tier catalog ────────────────────────────────────────────────
+/** Tier 0 — local Qwen3-8B via LiteLLM proxy. Free. */
+const TIER_FREE = {
+    provider: "litellm",
+    model: "default-fast",
+    costPerMTokenIn: 0,
+    costPerMTokenOut: 0,
+    label: "free",
+};
+/** Tier 1 — DeepSeek Flash via LiteLLM proxy. Low cost. */
+const TIER_CHEAP = {
+    provider: "litellm",
+    model: "deepseek-v4-flash",
+    costPerMTokenIn: 0.14,
+    costPerMTokenOut: 0.28,
+    label: "cheap",
+};
+/** Tier 2 — Groq free tier (llama-3.3-70b-versatile). Mid quality, near-zero cost. */
+const TIER_MID = {
+    provider: "groq",
+    model: "llama-3.3-70b-versatile",
+    costPerMTokenIn: 0.0,
+    costPerMTokenOut: 0.0,
+    label: "mid",
+};
+/** Tier 3 — DeepSeek Pro via LiteLLM proxy. Premium. */
+const TIER_PREMIUM = {
+    provider: "litellm",
+    model: "deepseek-v4-pro",
+    costPerMTokenIn: 0.27,
+    costPerMTokenOut: 1.1,
+    label: "premium",
+};
+// ─── Static category → tier index mapping ─────────────────────────────────
+const DEGRADED_ROUTING = {
+    simple: [TIER_FREE, TIER_CHEAP],
+    standard: [TIER_CHEAP, TIER_MID],
+    complex: [TIER_MID, TIER_PREMIUM],
+    reasoning: [TIER_PREMIUM],
+};
+const DEFAULT_DEGRADED = [TIER_CHEAP, TIER_MID];
+// ─── DefaultTierPolicy ────────────────────────────────────────────────────
+/**
+ * DefaultTierPolicy — static cost-minimising routing.
+ *
+ * "degraded" mode: purely static, category → ordered tier list.
+ * "full" mode: same tiers returned in same order; the *caller* (economy router)
+ *   is responsible for re-ordering by observed cost-per-outcome from OutcomeTracker.
+ *   This class only supplies the candidate set.
+ */
+export class DefaultTierPolicy {
+    tiersFor(category, _mode) {
+        // Both modes return the same candidate set; re-ordering in "full" mode
+        // is the router's responsibility (Sprint D router.ts, not this class).
+        const tiers = DEGRADED_ROUTING[category] ?? DEFAULT_DEGRADED;
+        // Return a copy to prevent external mutation of the catalog.
+        return [...tiers];
+    }
+}
+// ─── Catalog helpers ──────────────────────────────────────────────────────
+/**
+ * Look up a ModelTier by provider+model from the built-in catalog.
+ * Returns undefined if the model is not in the default catalog
+ * (consumers may use custom tiers not registered here).
+ */
+export function lookupTier(provider, model) {
+    const catalog = [TIER_FREE, TIER_CHEAP, TIER_MID, TIER_PREMIUM];
+    return catalog.find((t) => t.provider === provider && t.model === model);
+}
+//# sourceMappingURL=tier-policy.js.map

package/dist/economy/tier-policy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier-policy.js","sourceRoot":"","sources":["../../src/economy/tier-policy.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AA4BH,6EAA6E;AAE7E,uDAAuD;AACvD,MAAM,SAAS,GAAc;IAC3B,QAAQ,EAAE,SAAS;IACnB,KAAK,EAAE,cAAc;IACrB,eAAe,EAAE,CAAC;IAClB,gBAAgB,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM;CACd,CAAC;AAEF,2DAA2D;AAC3D,MAAM,UAAU,GAAc;IAC5B,QAAQ,EAAE,SAAS;IACnB,KAAK,EAAE,mBAAmB;IAC1B,eAAe,EAAE,IAAI;IACrB,gBAAgB,EAAE,IAAI;IACtB,KAAK,EAAE,OAAO;CACf,CAAC;AAEF,sFAAsF;AACtF,MAAM,QAAQ,GAAc;IAC1B,QAAQ,EAAE,MAAM;IAChB,KAAK,EAAE,yBAAyB;IAChC,eAAe,EAAE,GAAG;IACpB,gBAAgB,EAAE,GAAG;IACrB,KAAK,EAAE,KAAK;CACb,CAAC;AAEF,wDAAwD;AACxD,MAAM,YAAY,GAAc;IAC9B,QAAQ,EAAE,SAAS;IACnB,KAAK,EAAE,iBAAiB;IACxB,eAAe,EAAE,IAAI;IACrB,gBAAgB,EAAE,GAAG;IACrB,KAAK,EAAE,SAAS;CACjB,CAAC;AAEF,6EAA6E;AAE7E,MAAM,gBAAgB,GAAgC;IACpD,MAAM,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC;IAC/B,QAAQ,EAAE,CAAC,UAAU,EAAE,QAAQ,CAAC;IAChC,OAAO,EAAE,CAAC,QAAQ,EAAE,YAAY,CAAC;IACjC,SAAS,EAAE,CAAC,YAAY,CAAC;CAC1B,CAAC;AAEF,MAAM,gBAAgB,GAAgB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;AAE7D,6EAA6E;AAE7E;;;;;;;GAOG;AACH,MAAM,OAAO,iBAAiB;IAC5B,QAAQ,CAAC,QAAgB,EAAE,KAA0B;QACnD,uEAAuE;QACvE,uEAAuE;QACvE,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC;QAC7D,6DAA6D;QAC7D,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;IACpB,CAAC;CACF;AAED,6EAA6E;AAE7E;;;;GAIG;AACH,MAAM,UAAU,UAAU,CACxB,QAAgB,EAChB,KAAa;IAEb,MAAM,OAAO,GAAgB,CAAC,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IAC7E,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;AAC3E,CAAC"}