@coool/opencode-adaptive 1.0.0 → 1.2.0

package/dist/core/compatibility/gate.js.map

@@ -1 +1 @@
-{"version":3,"file":"gate.js","sourceRoot":"","sources":["../../../src/core/compatibility/gate.ts"],"names":[],"mappings":"AAEA,yFAAyF;AACzF,SAAS,gBAAgB,CAAC,KAAyB;IACjD,OAAO,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;AACpE,CAAC;AAED,SAAS,kBAAkB,CACzB,SAAwC,EACxC,QAA2B;IAE3B,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAA;IACd,CAAC;IACD,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAA;AACnE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,SAAyB,EAAE,MAAc;IAC1E,MAAM,OAAO,GAA4B,EAAE,CAAA;IAE3C,IAAI,SAAS,CAAC,eAAe,KAAK,IAAI,EAAE,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAA;IACtC,CAAC;IACD,IAAI,SAAS,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAA;IACnC,CAAC;IACD,IAAI,SAAS,CAAC,OAAO,KAAK,SAAS,IAAI,SAAS,CAAC,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAC3E,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;IACrC,CAAC;IAED,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,IAAI,SAAS,CAAC,YAAY,EAAE,KAAK,KAAK,IAAI,EAAE,CAAC;QACpE,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAA;IACtC,CAAC;IACD,IACE,MAAM,CAAC,KAAK,KAAK,SAAS;QAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;QACvB,CAAC,kBAAkB,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAChE,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAA;IAC5C,CAAC;IACD,IACE,MAAM,CAAC,MAAM,KAAK,SAAS;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QACxB,CAAC,kBAAkB,CAAC,SAAS,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAClE,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAA;IAC7C,CAAC;IAED,IAAI,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;QAC3C,MAAM,YAAY,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,CAAA;QAC7C,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAA;QAC1C,CAAC;aAAM,IAAI,YAAY,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YAC/C,OAAO,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAA;QAC/C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,CAAA;AACtD,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,gBAAgB,CAC9B,UAAwB,EACxB,MAAc;IAEd,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,kBAAkB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,UAAU,CAAC,CAAA;AAC3F,CAAC"}
+{"version":3,"file":"gate.js","sourceRoot":"","sources":["../../../src/core/compatibility/gate.ts"],"names":[],"mappings":"AAEA,yFAAyF;AACzF,SAAS,gBAAgB,CAAC,KAAyB;IACjD,OAAO,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;AACpE,CAAC;AAED,SAAS,kBAAkB,CACzB,SAAwC,EACxC,QAA2B;IAE3B,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAA;IACd,CAAC;IACD,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAA;AACnE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,SAAyB,EAAE,MAAc;IAC1E,MAAM,OAAO,GAA4B,EAAE,CAAA;IAE3C,IAAI,SAAS,CAAC,eAAe,KAAK,IAAI,EAAE,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAA;IACtC,CAAC;IACD,IAAI,SAAS,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAA;IACnC,CAAC;IACD,IAAI,SAAS,CAAC,OAAO,KAAK,SAAS,IAAI,SAAS,CAAC,gBAAgB,KAAK,IAAI,EAAE,CAAC;QAC3E,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;IACrC,CAAC;IAED,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,IAAI,SAAS,CAAC,YAAY,EAAE,KAAK,KAAK,IAAI,EAAE,CAAC;QACpE,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAA;IACtC,CAAC;IACD,IACE,MAAM,CAAC,KAAK,KAAK,SAAS;QAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;QACvB,CAAC,kBAAkB,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAChE,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAA;IAC5C,CAAC;IACD,IACE,MAAM,CAAC,MAAM,KAAK,SAAS;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QACxB,CAAC,kBAAkB,CAAC,SAAS,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAClE,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAA;IAC7C,CAAC;IAED,IAAI,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;QAC3C,MAAM,YAAY,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,CAAA;QAC7C,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAA;QAC1C,CAAC;aAAM,IAAI,YAAY,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YAC/C,OAAO,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAA;QAC/C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,CAAA;AACtD,CAAC","sourcesContent":["import type { CandidateModel, Demand, IncompatibilityReason, Verdict } from \"./types.js\"\n\n/** A finite, non-negative token count is assessable; anything else is unknown demand. */\nfunction assessableTokens(value: number | undefined): value is number {\n  return value !== undefined && Number.isFinite(value) && value >= 0\n}\n\nfunction supportsModalities(\n  supported: readonly string[] | undefined,\n  demanded: readonly string[],\n): boolean {\n  if (supported === undefined) {\n    return false\n  }\n  return demanded.every((modality) => supported.includes(modality))\n}\n\n/**\n * Run every check and accumulate reasons in fixed order. A candidate is\n * compatible only when no reason applies; unknown candidate metadata never\n * satisfies a stated requirement.\n */\nexport function checkCompatibility(candidate: CandidateModel, demand: Demand): Verdict {\n  const reasons: IncompatibilityReason[] = []\n\n  if (candidate.providerEnabled !== true) {\n    reasons.push(\"provider-unavailable\")\n  }\n  if (candidate.enabled !== true) {\n    reasons.push(\"model-unavailable\")\n  }\n  if (candidate.variant !== undefined && candidate.variantAvailable !== true) {\n    reasons.push(\"variant-unavailable\")\n  }\n\n  if (demand.tools === true && candidate.capabilities?.tools !== true) {\n    reasons.push(\"tool-use-unsupported\")\n  }\n  if (\n    demand.input !== undefined &&\n    demand.input.length > 0 &&\n    !supportsModalities(candidate.capabilities?.input, demand.input)\n  ) {\n    reasons.push(\"input-modality-unsupported\")\n  }\n  if (\n    demand.output !== undefined &&\n    demand.output.length > 0 &&\n    !supportsModalities(candidate.capabilities?.output, demand.output)\n  ) {\n    reasons.push(\"output-modality-unsupported\")\n  }\n\n  if (assessableTokens(demand.contextTokens)) {\n    const contextLimit = candidate.limit?.context\n    if (!assessableTokens(contextLimit)) {\n      reasons.push(\"context-capacity-unknown\")\n    } else if (contextLimit < demand.contextTokens) {\n      reasons.push(\"context-capacity-insufficient\")\n    }\n  }\n\n  return { compatible: reasons.length === 0, reasons }\n}\n"]}

package/dist/core/compatibility/index.d.ts

@@ -1,3 +1,2 @@
 export * from "./types.js";
 export * from "./gate.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/core/compatibility/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/compatibility/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,WAAW,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/compatibility/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,WAAW,CAAA","sourcesContent":["export * from \"./types.js\"\nexport * from \"./gate.js\"\n"]}

package/dist/core/compatibility/types.d.ts

@@ -51,4 +51,3 @@ export interface Verdict {
     readonly compatible: boolean;
     readonly reasons: readonly IncompatibilityReason[];
 }
-//# sourceMappingURL=types.d.ts.map

package/dist/core/compatibility/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/compatibility/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAmCH;;;GAGG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG;IACrC,sBAAsB;IACtB,mBAAmB;IACnB,qBAAqB;IACrB,sBAAsB;IACtB,4BAA4B;IAC5B,6BAA6B;IAC7B,+BAA+B;IAC/B,0BAA0B;CACU,CAAA"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/compatibility/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAmCH;;;GAGG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG;IACrC,sBAAsB;IACtB,mBAAmB;IACnB,qBAAqB;IACrB,sBAAsB;IACtB,4BAA4B;IAC5B,6BAA6B;IAC7B,+BAA+B;IAC/B,0BAA0B;CACU,CAAA","sourcesContent":["/**\n * Compatibility gate (ADP-017): filters candidates on context capacity,\n * tool use, modalities, and model/variant/provider availability BEFORE\n * health/preference ranking. Pure — adapters map OpenCode `Model.Info` /\n * `Provider.Info` into `CandidateModel`, this module never touches\n * `@opencode/plugin` types.\n *\n * Conservative rule: metadata the gate needs but cannot see is treated as\n * NOT satisfying the requirement (e.g. unknown `enabled`, unknown tool\n * support, unknown context limit). Only demand-side quantities that are\n * themselves unknown are skipped — there is nothing to check against.\n */\n\n/** What the executing work needs from a resource. All demand fields are optional. */\nexport interface Demand {\n  /** The unit needs tool use. `undefined`/`false` imposes no tool requirement. */\n  readonly tools?: boolean | undefined\n  /** Input modalities the unit carries (e.g. `\"text\"`, `\"image\"`). */\n  readonly input?: readonly string[] | undefined\n  /** Output modalities the unit must produce. */\n  readonly output?: readonly string[] | undefined\n  /** Known or estimated context need in tokens; `undefined` skips the capacity check. */\n  readonly contextTokens?: number | undefined\n}\n\n/** Adapter-normalized view of one candidate resource. */\nexport interface CandidateModel {\n  readonly providerID: string\n  readonly modelID: string\n  readonly variant?: string | undefined\n  /** Model is enabled in the host inventory. Unknown ⇒ conservative reject. */\n  readonly enabled?: boolean | undefined\n  /** Provider is available in the host inventory. Unknown ⇒ conservative reject. */\n  readonly providerEnabled?: boolean | undefined\n  /** The requested variant exists for this model. Unknown ⇒ conservative reject. */\n  readonly variantAvailable?: boolean | undefined\n  readonly capabilities?:\n    | {\n        readonly tools?: boolean | undefined\n        readonly input?: readonly string[] | undefined\n        readonly output?: readonly string[] | undefined\n      }\n    | undefined\n  readonly limit?: { readonly context?: number | undefined } | undefined\n}\n\n/**\n * Why a candidate failed the gate, in the fixed order the checks run:\n * availability → tools → input modalities → output modalities → context.\n */\nexport const INCOMPATIBILITY_REASONS = [\n  \"provider-unavailable\",\n  \"model-unavailable\",\n  \"variant-unavailable\",\n  \"tool-use-unsupported\",\n  \"input-modality-unsupported\",\n  \"output-modality-unsupported\",\n  \"context-capacity-insufficient\",\n  \"context-capacity-unknown\",\n] as const satisfies readonly string[]\n\nexport type IncompatibilityReason = (typeof INCOMPATIBILITY_REASONS)[number]\n\nexport interface Verdict {\n  readonly compatible: boolean\n  readonly reasons: readonly IncompatibilityReason[]\n}\n"]}

package/dist/core/scheduler/admit.d.ts

@@ -4,4 +4,3 @@ import type { AdmissionDecision, SchedulerInput } from "./types.js";
  * input always yields the same decision, and the function has no effects.
  */
 export declare function admit(input: SchedulerInput): AdmissionDecision;
-//# sourceMappingURL=admit.d.ts.map

package/dist/core/scheduler/admit.js

@@ -2,11 +2,13 @@
  * Admission routing (ADP-013/016/022): pick the model for a fresh work unit,
  * or decide to defer (OpenCode's choice stands) or park (wait for recovery).
  *
- * Selection order, after the compatibility gate (ADP-017) filters candidates:
- * ready → probe → draining. Rationale: a half-open breaker candidate is one
- * single-flight admission away from verified recovery; a draining resource is
- * being retired, so depending on it is the last resort. Breaker single-flight
- * is enforced by the resource-health registry, not here.
+ * Selection, after the compatibility gate (ADP-017) filters candidates: the
+ * first candidate in user order that is ready or due for its half-open probe
+ * wins; draining only when none is. Rationale: a due probe at a preferred
+ * position is how that resource returns (ADP-018/019) — passing it over for a
+ * later ready sibling would keep it out forever; a draining resource is being
+ * retired, so depending on it is the last resort. Breaker single-flight is
+ * enforced by the resource-health registry, not here.
  */
 import { checkCompatibility } from "../compatibility/gate.js";
 import { sameModelRef } from "../work-unit/types.js";
@@ -74,10 +76,11 @@ function admitTier(input, tier) {
         // discrepancy; park rather than invent resources (ADP-005).
         return { kind: "park", reason: "no-candidates" };
     }
+    // Candidates passed over before the winner (or all of them, when none won).
     const seen = [];
     let gateSkipped = 0;
     const skipWhys = [];
-    let readyRef;
+    let chosen;
     for (const ref of input.tierCandidates) {
         const entry = lookup(input.inventory, ref);
         if (entry === undefined) {
@@ -99,10 +102,11 @@ function admitTier(input, tier) {
         }
         const key = schedulerHealthKey(ref);
         const bucket = classify(input.health[key], input.capacity[key]);
-        if (bucket.kind === "ready") {
-            // First ready candidate wins; later candidates are irrelevant, so the
-            // scan stops and the evidence stays an honest prefix of the user order.
-            readyRef = ref;
+        if (bucket.kind === "ready" || bucket.kind === "probe") {
+            // The first ready or probe candidate wins; later candidates are
+            // irrelevant, so the scan stops and the evidence stays an honest prefix
+            // of the user order.
+            chosen = { ref, bucket };
             break;
         }
         seen.push({ ref, bucket });
@@ -111,18 +115,15 @@ function admitTier(input, tier) {
         }
     }
     const first = input.tierCandidates[0];
-    const evidenceBefore = (until) => seen.slice(0, until).map((e) => {
-        if (e.bucket.kind === "skip")
-            return { ref: e.ref, why: e.bucket.why };
-        return { ref: e.ref, why: e.bucket.kind === "draining" ? "draining" : "probe-in-flight" };
-    });
-    if (readyRef !== undefined) {
-        return apply(readyRef, tier, first !== undefined && sameModelRef(readyRef, first) ? "preferred" : "fallback", evidenceBefore(seen.length), undefined);
+    const evidenceBefore = (until) => seen.slice(0, until).map((e) => ({
+        ref: e.ref,
+        why: e.bucket.kind === "skip" ? e.bucket.why : "draining",
+    }));
+    if (chosen?.bucket.kind === "probe") {
+        return apply(chosen.ref, tier, "probe", evidenceBefore(seen.length), chosen.bucket.probeId);
     }
-    const probeIndex = seen.findIndex((e) => e.bucket.kind === "probe");
-    const probeEntry = probeIndex >= 0 ? seen[probeIndex] : undefined;
-    if (probeEntry?.bucket.kind === "probe") {
-        return apply(probeEntry.ref, tier, "probe", evidenceBefore(probeIndex), probeEntry.bucket.probeId);
+    if (chosen !== undefined) {
+        return apply(chosen.ref, tier, first !== undefined && sameModelRef(chosen.ref, first) ? "preferred" : "fallback", evidenceBefore(seen.length), undefined);
     }
     const drainIndex = seen.findIndex((e) => e.bucket.kind === "draining");
     const drainEntry = drainIndex >= 0 ? seen[drainIndex] : undefined;

package/dist/core/scheduler/admit.js.map

@@ -1 +1 @@
-{"version":3,"file":"admit.js","sourceRoot":"","sources":["../../../src/core/scheduler/admit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAA;AAG7D,OAAO,EAAE,YAAY,EAAiB,MAAM,uBAAuB,CAAA;AAWnE,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAA;AASrE,SAAS,cAAc,CAAC,SAAyB;IAC/C,OAAO;QACL,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,EAAE,EAAE,SAAS,CAAC,OAAO;QACrB,OAAO,EAAE,SAAS,CAAC,OAAO;KAC3B,CAAA;AACH,CAAC;AAED,SAAS,MAAM,CAAC,SAAoC,EAAE,GAAa;IACjE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;AACpF,CAAC;AAED,SAAS,QAAQ,CACf,UAAkC,EAClC,OAAoC;IAEpC,IAAI,OAAO,EAAE,SAAS,KAAK,IAAI,EAAE,CAAC;QAChC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,oBAAoB,EAAE,CAAA;IACpD,CAAC;IACD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,OAAO,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAA;IAC9E,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAChC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,CAAA;IACzD,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACpC,OAAO,OAAO,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAA;IAC9E,CAAC;IACD,OAAO,UAAU,CAAC,MAAM,KAAK,UAAU;QACrC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE;QACtB,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,CAAC,MAAM,EAAE,CAAA;AAC9C,CAAC;AAED,SAAS,KAAK,CACZ,KAAe,EACf,IAA0B,EAC1B,MAAmB,EACnB,OAAoC,EACpC,OAA2B;IAE3B,OAAO;QACL,IAAI,EAAE,OAAO;QACb,KAAK;QACL,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;QACvC,MAAM;QACN,QAAQ,EAAE;YACR,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,oBAAoB,CAAC;YAC/C,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;SAC9C;KACF,CAAA;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,KAAqB,EAAE,GAAa;IACpD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAA;IAC1C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,CAAA;IACtD,CAAC;IACD,MAAM,OAAO,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;IACvD,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAA;IACzF,CAAC;IACD,MAAM,GAAG,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAA;IACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;IAC/D,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC3B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,EAAE,CAAA;IACpE,CAAC;IACD,4EAA4E;IAC5E,8EAA8E;IAC9E,OAAO,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;AAC/F,CAAC;AAED,SAAS,SAAS,CAAC,KAAqB,EAAE,IAAc;IACtD,IAAI,KAAK,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,2EAA2E;QAC3E,4DAA4D;QAC5D,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,CAAA;IAClD,CAAC;IACD,MAAM,IAAI,GAAwC,EAAE,CAAA;IACpD,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,IAAI,QAA8B,CAAA;IAClC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAA;QAC1C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,kBAAkB,EAAE,EAAE,CAAC,CAAA;YACrE,QAAQ,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAA;YACjC,WAAW,IAAI,CAAC,CAAA;YAChB,SAAQ;QACV,CAAC;QACD,MAAM,OAAO,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;QACvD,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;YACxB,0EAA0E;YAC1E,wEAAwE;YACxE,oEAAoE;YACpE,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAE,CAAA;YAC/B,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;YACjD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAClB,WAAW,IAAI,CAAC,CAAA;YAChB,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAA;QACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/D,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC5B,sEAAsE;YACtE,wEAAwE;YACxE,QAAQ,GAAG,GAAG,CAAA;YACd,MAAK;QACP,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAA;QAC1B,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAA;IACrC,MAAM,cAAc,GAAG,CAAC,KAAa,EAAsB,EAAE,CAC3D,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAoB,EAAE;QAC/C,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAA;QACtE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,iBAAiB,EAAE,CAAA;IAC3F,CAAC,CAAC,CAAA;IACJ,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,KAAK,CACV,QAAQ,EACR,IAAI,EACJ,KAAK,KAAK,SAAS,IAAI,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,EAC/E,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,EAC3B,SAAS,CACV,CAAA;IACH,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAA;IACnE,MAAM,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACjE,IAAI,UAAU,EAAE,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACxC,OAAO,KAAK,CACV,UAAU,CAAC,GAAG,EACd,IAAI,EACJ,OAAO,EACP,cAAc,CAAC,UAAU,CAAC,EAC1B,UAAU,CAAC,MAAM,CAAC,OAAO,CAC1B,CAAA;IACH,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAA;IACtE,MAAM,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACjE,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAA;IACvF,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC9C,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,MAAM,EAAE,WAAW,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,aAAa;QAClF,MAAM,EAAE,OAAO;KAChB,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,KAAK,CAAC,KAAqB;IACzC,MAAM,OAAO,GAAoB,KAAK,CAAC,OAAO,CAAA;IAC9C,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC7B,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAA;IAC3E,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC3B,OAAO,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;IACvC,CAAC;IACD,OAAO,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;AACvC,CAAC"}
+{"version":3,"file":"admit.js","sourceRoot":"","sources":["../../../src/core/scheduler/admit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAA;AAG7D,OAAO,EAAE,YAAY,EAAiB,MAAM,uBAAuB,CAAA;AAWnE,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAA;AASrE,SAAS,cAAc,CAAC,SAAyB;IAC/C,OAAO;QACL,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,EAAE,EAAE,SAAS,CAAC,OAAO;QACrB,OAAO,EAAE,SAAS,CAAC,OAAO;KAC3B,CAAA;AACH,CAAC;AAED,SAAS,MAAM,CAAC,SAAoC,EAAE,GAAa;IACjE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;AACpF,CAAC;AAED,SAAS,QAAQ,CACf,UAAkC,EAClC,OAAoC;IAEpC,IAAI,OAAO,EAAE,SAAS,KAAK,IAAI,EAAE,CAAC;QAChC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,oBAAoB,EAAE,CAAA;IACpD,CAAC;IACD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,OAAO,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAA;IAC9E,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAChC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,CAAA;IACzD,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACpC,OAAO,OAAO,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAA;IAC9E,CAAC;IACD,OAAO,UAAU,CAAC,MAAM,KAAK,UAAU;QACrC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE;QACtB,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,CAAC,MAAM,EAAE,CAAA;AAC9C,CAAC;AAED,SAAS,KAAK,CACZ,KAAe,EACf,IAA0B,EAC1B,MAAmB,EACnB,OAAoC,EACpC,OAA2B;IAE3B,OAAO;QACL,IAAI,EAAE,OAAO;QACb,KAAK;QACL,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;QACvC,MAAM;QACN,QAAQ,EAAE;YACR,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,oBAAoB,CAAC;YAC/C,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;SAC9C;KACF,CAAA;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,KAAqB,EAAE,GAAa;IACpD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAA;IAC1C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,CAAA;IACtD,CAAC;IACD,MAAM,OAAO,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;IACvD,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAA;IACzF,CAAC;IACD,MAAM,GAAG,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAA;IACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;IAC/D,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC3B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,EAAE,CAAA;IACpE,CAAC;IACD,4EAA4E;IAC5E,8EAA8E;IAC9E,OAAO,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;AAC/F,CAAC;AAED,SAAS,SAAS,CAAC,KAAqB,EAAE,IAAc;IACtD,IAAI,KAAK,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,2EAA2E;QAC3E,4DAA4D;QAC5D,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,CAAA;IAClD,CAAC;IACD,4EAA4E;IAC5E,MAAM,IAAI,GAAgF,EAAE,CAAA;IAC5F,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,IAAI,MAA2F,CAAA;IAC/F,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAA;QAC1C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,kBAAkB,EAAE,EAAE,CAAC,CAAA;YACrE,QAAQ,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAA;YACjC,WAAW,IAAI,CAAC,CAAA;YAChB,SAAQ;QACV,CAAC;QACD,MAAM,OAAO,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;QACvD,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;YACxB,0EAA0E;YAC1E,wEAAwE;YACxE,oEAAoE;YACpE,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAE,CAAA;YAC/B,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAA;YACjD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAClB,WAAW,IAAI,CAAC,CAAA;YAChB,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAA;QACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/D,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACvD,gEAAgE;YAChE,wEAAwE;YACxE,qBAAqB;YACrB,MAAM,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,CAAA;YACxB,MAAK;QACP,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAA;QAC1B,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAA;IACrC,MAAM,cAAc,GAAG,CAAC,KAAa,EAAsB,EAAE,CAC3D,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC;QACjD,GAAG,EAAE,CAAC,CAAC,GAAG;QACV,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU;KAC1D,CAAC,CAAC,CAAA;IACL,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACpC,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAC7F,CAAC;IACD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,KAAK,CACV,MAAM,CAAC,GAAG,EACV,IAAI,EACJ,KAAK,KAAK,SAAS,IAAI,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,EACjF,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,EAC3B,SAAS,CACV,CAAA;IACH,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAA;IACtE,MAAM,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACjE,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAA;IACvF,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC9C,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,MAAM,EAAE,WAAW,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,aAAa;QAClF,MAAM,EAAE,OAAO;KAChB,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,KAAK,CAAC,KAAqB;IACzC,MAAM,OAAO,GAAoB,KAAK,CAAC,OAAO,CAAA;IAC9C,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC7B,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAA;IAC3E,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC3B,OAAO,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;IACvC,CAAC;IACD,OAAO,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;AACvC,CAAC","sourcesContent":["/**\n * Admission routing (ADP-013/016/022): pick the model for a fresh work unit,\n * or decide to defer (OpenCode's choice stands) or park (wait for recovery).\n *\n * Selection, after the compatibility gate (ADP-017) filters candidates: the\n * first candidate in user order that is ready or due for its half-open probe\n * wins; draining only when none is. Rationale: a due probe at a preferred\n * position is how that resource returns (ADP-018/019) — passing it over for a\n * later ready sibling would keep it out forever; a draining resource is being\n * retired, so depending on it is the last resort. Breaker single-flight is\n * enforced by the resource-health registry, not here.\n */\nimport { checkCompatibility } from \"../compatibility/gate.js\"\nimport type { CandidateModel } from \"../compatibility/types.js\"\nimport type { RoutingDecision, TierName } from \"../tier-policy/types.js\"\nimport { sameModelRef, type ModelRef } from \"../work-unit/types.js\"\nimport type { Assessment } from \"../../health/resource-health/types.js\"\nimport type { CapacitySignals } from \"../../health/capacity/types.js\"\nimport type {\n  AdmissionDecision,\n  ApplyDecision,\n  ApplyReason,\n  SchedulerInput,\n  SkippedCandidate,\n  SkipReason,\n} from \"./types.js\"\nimport { MAX_EVIDENCE_SKIPPED, schedulerHealthKey } from \"./types.js\"\n\n/** The health/capacity view of one candidate, resolved to an admission bucket. */\ntype Bucket =\n  | { readonly kind: \"ready\" }\n  | { readonly kind: \"probe\"; readonly probeId: string }\n  | { readonly kind: \"draining\" }\n  | { readonly kind: \"skip\"; readonly why: SkipReason }\n\nfunction refOfCandidate(candidate: CandidateModel): ModelRef {\n  return {\n    providerID: candidate.providerID,\n    id: candidate.modelID,\n    variant: candidate.variant,\n  }\n}\n\nfunction lookup(inventory: readonly CandidateModel[], ref: ModelRef): CandidateModel | undefined {\n  return inventory.find((candidate) => sameModelRef(refOfCandidate(candidate), ref))\n}\n\nfunction classify(\n  assessment: Assessment | undefined,\n  signals: CapacitySignals | undefined,\n): Bucket {\n  if (signals?.exhausted === true) {\n    return { kind: \"skip\", why: \"capacity-exhausted\" }\n  }\n  if (assessment === undefined) {\n    return signals?.draining === true ? { kind: \"draining\" } : { kind: \"ready\" }\n  }\n  if (assessment.kind === \"probe\") {\n    return { kind: \"probe\", probeId: assessment.ticket.id }\n  }\n  if (assessment.kind === \"available\") {\n    return signals?.draining === true ? { kind: \"draining\" } : { kind: \"ready\" }\n  }\n  return assessment.reason === \"draining\"\n    ? { kind: \"draining\" }\n    : { kind: \"skip\", why: assessment.reason }\n}\n\nfunction apply(\n  model: ModelRef,\n  tier: TierName | undefined,\n  reason: ApplyReason,\n  skipped: readonly SkippedCandidate[],\n  probeId: string | undefined,\n): ApplyDecision {\n  return {\n    kind: \"apply\",\n    model,\n    ...(tier === undefined ? {} : { tier }),\n    reason,\n    evidence: {\n      skipped: skipped.slice(0, MAX_EVIDENCE_SKIPPED),\n      ...(probeId === undefined ? {} : { probeId }),\n    },\n  }\n}\n\nfunction admitPin(input: SchedulerInput, pin: ModelRef): AdmissionDecision {\n  const entry = lookup(input.inventory, pin)\n  if (entry === undefined) {\n    return { kind: \"defer\", reason: \"pin-unverifiable\" }\n  }\n  const verdict = checkCompatibility(entry, input.demand)\n  if (!verdict.compatible) {\n    return { kind: \"defer\", reason: \"pin-incompatible\", detail: verdict.reasons.join(\",\") }\n  }\n  const key = schedulerHealthKey(pin)\n  const bucket = classify(input.health[key], input.capacity[key])\n  if (bucket.kind === \"skip\") {\n    return { kind: \"park\", reason: \"pin-blocked\", detail: bucket.why }\n  }\n  // Manual intent wins (GOAL): a pinned model is applied even while draining;\n  // a probe admission is recorded for observability but never overrides intent.\n  return apply(pin, undefined, \"pin\", [], bucket.kind === \"probe\" ? bucket.probeId : undefined)\n}\n\nfunction admitTier(input: SchedulerInput, tier: TierName): AdmissionDecision {\n  if (input.tierCandidates.length === 0) {\n    // The tier was reported configured but has an empty list — a configuration\n    // discrepancy; park rather than invent resources (ADP-005).\n    return { kind: \"park\", reason: \"no-candidates\" }\n  }\n  // Candidates passed over before the winner (or all of them, when none won).\n  const seen: { ref: ModelRef; bucket: Extract<Bucket, { kind: \"draining\" | \"skip\" }> }[] = []\n  let gateSkipped = 0\n  const skipWhys: string[] = []\n  let chosen: { ref: ModelRef; bucket: Extract<Bucket, { kind: \"ready\" | \"probe\" }> } | undefined\n  for (const ref of input.tierCandidates) {\n    const entry = lookup(input.inventory, ref)\n    if (entry === undefined) {\n      seen.push({ ref, bucket: { kind: \"skip\", why: \"not-in-inventory\" } })\n      skipWhys.push(\"not-in-inventory\")\n      gateSkipped += 1\n      continue\n    }\n    const verdict = checkCompatibility(entry, input.demand)\n    if (!verdict.compatible) {\n      // The gate reports incompatible only when at least one reason exists; the\n      // non-null assertion is the only way to express that invariant locally.\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      const why = verdict.reasons[0]!\n      seen.push({ ref, bucket: { kind: \"skip\", why } })\n      skipWhys.push(why)\n      gateSkipped += 1\n      continue\n    }\n    const key = schedulerHealthKey(ref)\n    const bucket = classify(input.health[key], input.capacity[key])\n    if (bucket.kind === \"ready\" || bucket.kind === \"probe\") {\n      // The first ready or probe candidate wins; later candidates are\n      // irrelevant, so the scan stops and the evidence stays an honest prefix\n      // of the user order.\n      chosen = { ref, bucket }\n      break\n    }\n    seen.push({ ref, bucket })\n    if (bucket.kind === \"skip\") {\n      skipWhys.push(bucket.why)\n    }\n  }\n  const first = input.tierCandidates[0]\n  const evidenceBefore = (until: number): SkippedCandidate[] =>\n    seen.slice(0, until).map((e): SkippedCandidate => ({\n      ref: e.ref,\n      why: e.bucket.kind === \"skip\" ? e.bucket.why : \"draining\",\n    }))\n  if (chosen?.bucket.kind === \"probe\") {\n    return apply(chosen.ref, tier, \"probe\", evidenceBefore(seen.length), chosen.bucket.probeId)\n  }\n  if (chosen !== undefined) {\n    return apply(\n      chosen.ref,\n      tier,\n      first !== undefined && sameModelRef(chosen.ref, first) ? \"preferred\" : \"fallback\",\n      evidenceBefore(seen.length),\n      undefined,\n    )\n  }\n  const drainIndex = seen.findIndex((e) => e.bucket.kind === \"draining\")\n  const drainEntry = drainIndex >= 0 ? seen[drainIndex] : undefined\n  if (drainEntry !== undefined) {\n    return apply(drainEntry.ref, tier, \"draining\", evidenceBefore(drainIndex), undefined)\n  }\n  const summary = skipWhys.slice(0, 3).join(\",\")\n  return {\n    kind: \"park\",\n    reason: gateSkipped === skipWhys.length ? \"no-compatible-resource\" : \"all-blocked\",\n    detail: summary,\n  }\n}\n\n/**\n * Decide the model for a fresh work unit. Total and deterministic: the same\n * input always yields the same decision, and the function has no effects.\n */\nexport function admit(input: SchedulerInput): AdmissionDecision {\n  const routing: RoutingDecision = input.routing\n  if (routing.kind === \"defer\") {\n    return { kind: \"defer\", reason: \"routing-defer\", detail: routing.reason }\n  }\n  if (routing.kind === \"pin\") {\n    return admitPin(input, routing.model)\n  }\n  return admitTier(input, routing.tier)\n}\n"]}

package/dist/core/scheduler/escalate.d.ts

@@ -4,4 +4,3 @@ import type { DeferDecision, EscalateDecision, EscalationInput } from "./types.j
  * proceed. Total and deterministic.
  */
 export declare function planEscalation(input: EscalationInput): EscalateDecision | DeferDecision;
-//# sourceMappingURL=escalate.d.ts.map

package/dist/core/scheduler/escalate.js

@@ -2,11 +2,12 @@
  * Capability escalation planner (ADP-015).
  *
  * Escalation is justified only by non-empty structured evidence, follows the
- * ladder same model / current effort → same model / stronger effort → next
- * tier, and is bounded by a finite per-unit budget. Every output either moves
- * strictly up the ladder or refuses — the planner can never produce a loop,
- * because each accepted step strictly increases a well-founded measure
- * (variant index within the ladder, then tier index).
+ * ladder next tier, and is bounded by the caller's finite budget. The
+ * same-model stronger-variant rung is not implemented: it would need an
+ * ordered variant ladder the host does not expose, and strength is never
+ * guessed from variant names. Every output moves strictly up the ladder or
+ * refuses. Termination rests on the budget, which the caller must carry
+ * across every unit of one task (each escalation continues on a new unit).
  */
 import { nextTier } from "../tier-policy/types.js";
 import { MAX_ESCALATION_EVIDENCE } from "./types.js";
@@ -31,18 +32,6 @@ export function planEscalation(input) {
     if (input.budget.max <= 0 || input.budget.used >= input.budget.max) {
         return { kind: "defer", reason: "escalation-budget-exhausted" };
     }
-    const { currentModel, variantLadder } = input;
-    if (currentModel.variant !== undefined && variantLadder !== undefined) {
-        const index = variantLadder.indexOf(currentModel.variant);
-        if (index >= 0) {
-            // For a well-formed (non-holey) ladder, undefined here means the current
-            // variant is the strongest — the ladder is exhausted.
-            const stronger = variantLadder[index + 1];
-            if (stronger !== undefined) {
-                return escalate(input, { ...currentModel, variant: stronger }, "variant", input.currentTier);
-            }
-        }
-    }
     const next = nextTier(input.currentTier);
     if (next === undefined) {
         return { kind: "defer", reason: "escalation-ceiling" };

package/dist/core/scheduler/escalate.js.map

@@ -1 +1 @@
-{"version":3,"file":"escalate.js","sourceRoot":"","sources":["../../../src/core/scheduler/escalate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAA;AAGlD,OAAO,EAAE,uBAAuB,EAAE,MAAM,YAAY,CAAA;AAEpD,SAAS,QAAQ,CACf,KAAsB,EACtB,MAAgB,EAChB,IAA8B,EAC9B,IAA8B;IAE9B,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,MAAM;QACN,IAAI;QACJ,IAAI;QACJ,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,uBAAuB,CAAC;QACxD,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC;KAC1D,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAsB;IACnD,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,0BAA0B,EAAE,CAAA;IAC9D,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACnE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAA;IACjE,CAAC;IACD,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,GAAG,KAAK,CAAA;IAC7C,IAAI,YAAY,CAAC,OAAO,KAAK,SAAS,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;QACtE,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;QACzD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,yEAAyE;YACzE,sDAAsD;YACtD,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YACzC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,QAAQ,CAAC,KAAK,EAAE,EAAE,GAAG,YAAY,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,WAAW,CAAC,CAAA;YAC9F,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;IACxC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,oBAAoB,EAAE,CAAA;IACxD,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAA;IACzC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,yBAAyB,EAAE,CAAA;IAC7D,CAAC;IACD,OAAO,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAA;AAC9C,CAAC"}
+{"version":3,"file":"escalate.js","sourceRoot":"","sources":["../../../src/core/scheduler/escalate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAA;AAGlD,OAAO,EAAE,uBAAuB,EAAE,MAAM,YAAY,CAAA;AAEpD,SAAS,QAAQ,CACf,KAAsB,EACtB,MAAgB,EAChB,IAA8B,EAC9B,IAA8B;IAE9B,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,MAAM;QACN,IAAI;QACJ,IAAI;QACJ,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,uBAAuB,CAAC;QACxD,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC;KAC1D,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAsB;IACnD,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,0BAA0B,EAAE,CAAA;IAC9D,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACnE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAA;IACjE,CAAC;IACD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;IACxC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,oBAAoB,EAAE,CAAA;IACxD,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAA;IACzC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,yBAAyB,EAAE,CAAA;IAC7D,CAAC;IACD,OAAO,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAA;AAC9C,CAAC","sourcesContent":["/**\n * Capability escalation planner (ADP-015).\n *\n * Escalation is justified only by non-empty structured evidence, follows the\n * ladder next tier, and is bounded by the caller's finite budget. The\n * same-model stronger-variant rung is not implemented: it would need an\n * ordered variant ladder the host does not expose, and strength is never\n * guessed from variant names. Every output moves strictly up the ladder or\n * refuses. Termination rests on the budget, which the caller must carry\n * across every unit of one task (each escalation continues on a new unit).\n */\nimport { nextTier } from \"../tier-policy/types.js\"\nimport type { ModelRef } from \"../work-unit/types.js\"\nimport type { DeferDecision, EscalateDecision, EscalationInput } from \"./types.js\"\nimport { MAX_ESCALATION_EVIDENCE } from \"./types.js\"\n\nfunction escalate(\n  input: EscalationInput,\n  target: ModelRef,\n  step: EscalateDecision[\"step\"],\n  tier: EscalateDecision[\"tier\"],\n): EscalateDecision {\n  return {\n    kind: \"escalate\",\n    target,\n    step,\n    tier,\n    evidence: input.evidence.slice(-MAX_ESCALATION_EVIDENCE),\n    budgetRemaining: input.budget.max - input.budget.used - 1,\n  }\n}\n\n/**\n * Plan the next escalation step, or defer with the reason escalation cannot\n * proceed. Total and deterministic.\n */\nexport function planEscalation(input: EscalationInput): EscalateDecision | DeferDecision {\n  if (input.evidence.length === 0) {\n    return { kind: \"defer\", reason: \"escalation-not-justified\" }\n  }\n  if (input.budget.max <= 0 || input.budget.used >= input.budget.max) {\n    return { kind: \"defer\", reason: \"escalation-budget-exhausted\" }\n  }\n  const next = nextTier(input.currentTier)\n  if (next === undefined) {\n    return { kind: \"defer\", reason: \"escalation-ceiling\" }\n  }\n  const target = input.nextTierResources[0]\n  if (target === undefined) {\n    return { kind: \"defer\", reason: \"escalation-no-candidate\" }\n  }\n  return escalate(input, target, \"tier\", next)\n}\n"]}

package/dist/core/scheduler/index.d.ts

@@ -2,4 +2,3 @@ export * from "./types.js";
 export * from "./admit.js";
 export * from "./escalate.js";
 export * from "./mode.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/core/scheduler/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/scheduler/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,YAAY,CAAA;AAC1B,cAAc,eAAe,CAAA;AAC7B,cAAc,WAAW,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/scheduler/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,YAAY,CAAA;AAC1B,cAAc,eAAe,CAAA;AAC7B,cAAc,WAAW,CAAA","sourcesContent":["export * from \"./types.js\"\nexport * from \"./admit.js\"\nexport * from \"./escalate.js\"\nexport * from \"./mode.js\"\n"]}

package/dist/core/scheduler/mode.d.ts

@@ -6,4 +6,3 @@
  */
 import type { Decision, OperatingMode } from "./types.js";
 export declare function forMode(decision: Decision, mode: OperatingMode): Decision;
-//# sourceMappingURL=mode.d.ts.map

package/dist/core/scheduler/mode.js.map

@@ -1 +1 @@
-{"version":3,"file":"mode.js","sourceRoot":"","sources":["../../../src/core/scheduler/mode.ts"],"names":[],"mappings":"AAQA,MAAM,UAAU,OAAO,CAAC,QAAkB,EAAE,IAAmB;IAC7D,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAA;IAClD,CAAC;IACD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,OAAO,QAAQ,CAAA;IACjB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,CAAA;AAClD,CAAC"}
+{"version":3,"file":"mode.js","sourceRoot":"","sources":["../../../src/core/scheduler/mode.ts"],"names":[],"mappings":"AAQA,MAAM,UAAU,OAAO,CAAC,QAAkB,EAAE,IAAmB;IAC7D,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAA;IAClD,CAAC;IACD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,OAAO,QAAQ,CAAA;IACjB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,CAAA;AAClD,CAAC","sourcesContent":["/**\n * Operating-mode wrapper (GOAL operating modes). OBSERVE and CONTROL run the\n * identical core; OBSERVE wraps the result without applying it. OFF never\n * reaches the scheduler, but the total wrapper maps it to an explicit defer\n * so the union stays closed.\n */\nimport type { Decision, OperatingMode } from \"./types.js\"\n\nexport function forMode(decision: Decision, mode: OperatingMode): Decision {\n  if (mode === \"observe\") {\n    return { kind: \"observe-only\", would: decision }\n  }\n  if (mode === \"active\") {\n    return decision\n  }\n  return { kind: \"defer\", reason: \"adaptive-off\" }\n}\n"]}

package/dist/core/scheduler/types.d.ts

@@ -40,7 +40,7 @@ export type SchedulerDeferReason = (typeof SCHEDULER_DEFER_REASONS)[number];
 export declare const PARK_REASONS: readonly ["pin-blocked", "no-candidates", "no-compatible-resource", "all-blocked"];
 export type ParkReason = (typeof PARK_REASONS)[number];
 /** Why a tier candidate was not usable. Superset of gate and health reasons. */
-export declare const SKIP_REASONS: readonly ["not-in-inventory", "capacity-exhausted", "incompatible", "provider-unavailable", "model-unavailable", "variant-unavailable", "tool-use-unsupported", "input-modality-unsupported", "output-modality-unsupported", "context-capacity-insufficient", "context-capacity-unknown", "unavailable", "quota-exhausted", "rate-limited", "breaker-open", "probe-in-flight", "draining"];
+export declare const SKIP_REASONS: readonly ["not-in-inventory", "capacity-exhausted", "provider-unavailable", "model-unavailable", "variant-unavailable", "tool-use-unsupported", "input-modality-unsupported", "output-modality-unsupported", "context-capacity-insufficient", "context-capacity-unknown", "unavailable", "quota-exhausted", "rate-limited", "breaker-open", "probe-in-flight", "draining"];
 export type SkipReason = (typeof SKIP_REASONS)[number];
 /** A tier candidate that could not take the work, with the bounded reason. */
 export interface SkippedCandidate {
@@ -91,12 +91,6 @@ export declare const MAX_ESCALATION_EVIDENCE = 4;
 export interface EscalationInput {
     readonly currentModel: ModelRef;
     readonly currentTier: TierName;
-    /**
-     * Ordered variant ids for the current model, weakest → strongest, when the
-     * host inventory exposes an order. Without a ladder the variant step is
-     * skipped — strength is never guessed from variant names (ADP-004).
-     */
-    readonly variantLadder?: readonly string[] | undefined;
     /** Configured resources of the next tier, user order, already gated. */
     readonly nextTierResources: readonly ModelRef[];
     /** Non-empty structured evidence justifies escalation. */
@@ -107,7 +101,7 @@ export interface EscalateDecision {
     readonly kind: "escalate";
     readonly target: ModelRef;
     readonly step: EscalationStep;
-    /** Tier of the target: unchanged for the variant step, next tier otherwise. */
+    /** Tier of the escalated-to resource (the next tier). */
     readonly tier: TierName;
     readonly evidence: readonly EscalationEvidence[];
     readonly budgetRemaining: number;
@@ -140,4 +134,3 @@ export interface SchedulerInput {
 export declare const MAX_EVIDENCE_SKIPPED = 8;
 /** Canonical health/capacity map key for a candidate model reference. */
 export declare function schedulerHealthKey(ref: ModelRef): string;
-//# sourceMappingURL=types.d.ts.map

package/dist/core/scheduler/types.js

@@ -48,7 +48,6 @@ export const PARK_REASONS = [
 export const SKIP_REASONS = [
     "not-in-inventory",
     "capacity-exhausted",
-    "incompatible",
     ...INCOMPATIBILITY_REASONS,
     ...BLOCKED_REASONS,
 ];
@@ -60,6 +59,8 @@ export const ESCALATION_EVIDENCE_KINDS = [
     "repeated-failure",
     "explicit-blocker",
 ];
+// Persisted receipt vocabulary. The planner produces only "tier" today; the
+// historical "variant" step stays parseable so old receipts are not dropped.
 export const ESCALATION_STEPS = ["variant", "tier"];
 /** Bound on evidence carried by an `escalate` decision (latest wins). */
 export const MAX_ESCALATION_EVIDENCE = 4;

package/dist/core/scheduler/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/scheduler/types.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAA;AACnE,OAAO,EAAE,eAAe,EAAE,MAAM,uCAAuC,CAAA;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,qCAAqC,CAAA;AAEnE,+EAA+E;AAC/E,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAsC,CAAA;AAIhG,oEAAoE;AACpE,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,KAAK;IACL,WAAW;IACX,UAAU;IACV,OAAO;IACP,UAAU;CAC0B,CAAA;AAItC;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG;IACrC,eAAe;IACf,kBAAkB;IAClB,kBAAkB;IAClB,0BAA0B;IAC1B,6BAA6B;IAC7B,oBAAoB;IACpB,yBAAyB;IACzB,cAAc;CACsB,CAAA;AAItC;;;;GAIG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,aAAa;IACb,eAAe;IACf,wBAAwB;IACxB,aAAa;CACuB,CAAA;AAItC,gFAAgF;AAChF,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,kBAAkB;IAClB,oBAAoB;IACpB,cAAc;IACd,GAAG,uBAAuB;IAC1B,GAAG,eAAe;CACkB,CAAA;AAuCtC,mFAAmF;AACnF,MAAM,CAAC,MAAM,yBAAyB,GAAG;IACvC,eAAe;IACf,oBAAoB;IACpB,sBAAsB;IACtB,kBAAkB;IAClB,kBAAkB;CACkB,CAAA;AAStC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,SAAS,EAAE,MAAM,CAAsC,CAAA;AAUxF,yEAAyE;AACzE,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAA;AAyDxC,mEAAmE;AACnE,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAA;AAErC,yEAAyE;AACzE,MAAM,UAAU,kBAAkB,CAAC,GAAa;IAC9C,OAAO,aAAa,CAClB,GAAG,CAAC,OAAO,KAAK,SAAS;QACvB,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,EAAE;QACjD,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,OAAO,EAAE,CAC5E,CAAA;AACH,CAAC"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/scheduler/types.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAA;AACnE,OAAO,EAAE,eAAe,EAAE,MAAM,uCAAuC,CAAA;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,qCAAqC,CAAA;AAEnE,+EAA+E;AAC/E,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAsC,CAAA;AAIhG,oEAAoE;AACpE,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,KAAK;IACL,WAAW;IACX,UAAU;IACV,OAAO;IACP,UAAU;CAC0B,CAAA;AAItC;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG;IACrC,eAAe;IACf,kBAAkB;IAClB,kBAAkB;IAClB,0BAA0B;IAC1B,6BAA6B;IAC7B,oBAAoB;IACpB,yBAAyB;IACzB,cAAc;CACsB,CAAA;AAItC;;;;GAIG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,aAAa;IACb,eAAe;IACf,wBAAwB;IACxB,aAAa;CACuB,CAAA;AAItC,gFAAgF;AAChF,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,kBAAkB;IAClB,oBAAoB;IACpB,GAAG,uBAAuB;IAC1B,GAAG,eAAe;CACkB,CAAA;AAuCtC,mFAAmF;AACnF,MAAM,CAAC,MAAM,yBAAyB,GAAG;IACvC,eAAe;IACf,oBAAoB;IACpB,sBAAsB;IACtB,kBAAkB;IAClB,kBAAkB;CACkB,CAAA;AAStC,4EAA4E;AAC5E,6EAA6E;AAC7E,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,SAAS,EAAE,MAAM,CAAsC,CAAA;AAUxF,yEAAyE;AACzE,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAA;AAmDxC,mEAAmE;AACnE,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAA;AAErC,yEAAyE;AACzE,MAAM,UAAU,kBAAkB,CAAC,GAAa;IAC9C,OAAO,aAAa,CAClB,GAAG,CAAC,OAAO,KAAK,SAAS;QACvB,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,EAAE;QACjD,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,OAAO,EAAE,CAC5E,CAAA;AACH,CAAC","sourcesContent":["/**\n * Scheduler types (ADP-013/015/016/022): the pure decision core's vocabulary.\n *\n * The core is a total function over its inputs — routing outcome, demand,\n * inventory, per-candidate health and capacity views — and never performs\n * effects. Effects (switching, receipts, parking) belong to the execution\n * layer. OBSERVE and CONTROL call the same core; mode handling is a pure\n * wrapper (`forMode`).\n */\nimport type { ModelRef } from \"../work-unit/types.js\"\nimport type { RoutingDecision, TierName } from \"../tier-policy/types.js\"\nimport type { CandidateModel, Demand } from \"../compatibility/types.js\"\nimport type { Assessment } from \"../../health/resource-health/types.js\"\nimport type { CapacitySignals } from \"../../health/capacity/types.js\"\nimport { INCOMPATIBILITY_REASONS } from \"../compatibility/types.js\"\nimport { BLOCKED_REASONS } from \"../../health/resource-health/types.js\"\nimport { resourceKeyID } from \"../../health/resource-health/key.js\"\n\n/** Operating modes (GOAL manual control). The plugin defaults to `observe`. */\nexport const OPERATING_MODES = [\"off\", \"observe\", \"active\"] as const satisfies readonly string[]\n\nexport type OperatingMode = (typeof OPERATING_MODES)[number]\n\n/** Why an `apply` decision chose its model (receipt provenance). */\nexport const APPLY_REASONS = [\n  \"pin\",\n  \"preferred\",\n  \"fallback\",\n  \"probe\",\n  \"draining\",\n] as const satisfies readonly string[]\n\nexport type ApplyReason = (typeof APPLY_REASONS)[number]\n\n/**\n * Why the core did not apply anything.\n * - `routing-defer` — the tier ladder deferred; OpenCode's choice stands.\n * - `pin-unverifiable` — the pinned model is not in the host inventory, so\n *   availability cannot be verified (inventory gate); deferring keeps the\n *   user's own model choice, which for a pin is typically the pinned model.\n * - `pin-incompatible` — the pinned model cannot execute the work.\n * - `escalation-*` — escalation evidence was absent, the budget was spent,\n *   the tier ladder is at its ceiling, or the next tier has no resources\n *   (no cross-tier borrowing).\n * - `adaptive-off` — the plugin is off; only reachable through `forMode`.\n */\nexport const SCHEDULER_DEFER_REASONS = [\n  \"routing-defer\",\n  \"pin-unverifiable\",\n  \"pin-incompatible\",\n  \"escalation-not-justified\",\n  \"escalation-budget-exhausted\",\n  \"escalation-ceiling\",\n  \"escalation-no-candidate\",\n  \"adaptive-off\",\n] as const satisfies readonly string[]\n\nexport type SchedulerDeferReason = (typeof SCHEDULER_DEFER_REASONS)[number]\n\n/**\n * Why work parks instead of applying: the required tier has no usable\n * resource right now. Parking waits for recovery — it never borrows across\n * tiers (ADP-022).\n */\nexport const PARK_REASONS = [\n  \"pin-blocked\",\n  \"no-candidates\",\n  \"no-compatible-resource\",\n  \"all-blocked\",\n] as const satisfies readonly string[]\n\nexport type ParkReason = (typeof PARK_REASONS)[number]\n\n/** Why a tier candidate was not usable. Superset of gate and health reasons. */\nexport const SKIP_REASONS = [\n  \"not-in-inventory\",\n  \"capacity-exhausted\",\n  ...INCOMPATIBILITY_REASONS,\n  ...BLOCKED_REASONS,\n] as const satisfies readonly string[]\n\nexport type SkipReason = (typeof SKIP_REASONS)[number]\n\n/** A tier candidate that could not take the work, with the bounded reason. */\nexport interface SkippedCandidate {\n  readonly ref: ModelRef\n  readonly why: SkipReason\n}\n\n/** Bounded evidence attached to an `apply` decision. */\nexport interface ApplyEvidence {\n  /** Candidates considered before the applied one, in order (bounded). */\n  readonly skipped: readonly SkippedCandidate[]\n  /** Breaker probe id when the applied unit is the half-open probe. */\n  readonly probeId?: string | undefined\n}\n\nexport interface ApplyDecision {\n  readonly kind: \"apply\"\n  readonly model: ModelRef\n  /** Required tier; `undefined` for pin routing (a pin is not a tier). */\n  readonly tier?: TierName | undefined\n  readonly reason: ApplyReason\n  readonly evidence: ApplyEvidence\n}\n\nexport interface DeferDecision {\n  readonly kind: \"defer\"\n  readonly reason: SchedulerDeferReason\n  readonly detail?: string | undefined\n}\n\nexport interface ParkDecision {\n  readonly kind: \"park\"\n  readonly reason: ParkReason\n  readonly detail?: string | undefined\n}\n\n/** Structured capability evidence for escalation (ADP-015). Never prose mining. */\nexport const ESCALATION_EVIDENCE_KINDS = [\n  \"agent-request\",\n  \"reviewer-rejection\",\n  \"verification-failure\",\n  \"repeated-failure\",\n  \"explicit-blocker\",\n] as const satisfies readonly string[]\n\nexport type EscalationEvidenceKind = (typeof ESCALATION_EVIDENCE_KINDS)[number]\n\nexport interface EscalationEvidence {\n  readonly kind: EscalationEvidenceKind\n  readonly detail?: string | undefined\n}\n\n// Persisted receipt vocabulary. The planner produces only \"tier\" today; the\n// historical \"variant\" step stays parseable so old receipts are not dropped.\nexport const ESCALATION_STEPS = [\"variant\", \"tier\"] as const satisfies readonly string[]\n\nexport type EscalationStep = (typeof ESCALATION_STEPS)[number]\n\n/** Finite per-unit escalation budget (ADP-015). `used >= max` ends escalation. */\nexport interface EscalationBudget {\n  readonly used: number\n  readonly max: number\n}\n\n/** Bound on evidence carried by an `escalate` decision (latest wins). */\nexport const MAX_ESCALATION_EVIDENCE = 4\n\nexport interface EscalationInput {\n  readonly currentModel: ModelRef\n  readonly currentTier: TierName\n  /** Configured resources of the next tier, user order, already gated. */\n  readonly nextTierResources: readonly ModelRef[]\n  /** Non-empty structured evidence justifies escalation. */\n  readonly evidence: readonly EscalationEvidence[]\n  readonly budget: EscalationBudget\n}\n\nexport interface EscalateDecision {\n  readonly kind: \"escalate\"\n  readonly target: ModelRef\n  readonly step: EscalationStep\n  /** Tier of the escalated-to resource (the next tier). */\n  readonly tier: TierName\n  readonly evidence: readonly EscalationEvidence[]\n  readonly budgetRemaining: number\n}\n\n/** OBSERVE mode's wrapper: the identical decision, recorded but not applied. */\nexport interface ObserveOnlyDecision {\n  readonly kind: \"observe-only\"\n  readonly would: Decision\n}\n\nexport type Decision =\n  ApplyDecision | DeferDecision | ParkDecision | EscalateDecision | ObserveOnlyDecision\n\n/** What admission can return — escalation never originates from admission. */\nexport type AdmissionDecision = ApplyDecision | DeferDecision | ParkDecision\n\n/**\n * Everything admission looks at. `health` and `capacity` are keyed by\n * `schedulerHealthKey(ref)`; an absent health entry means \"no observed\n * failure\" (the registry's default), an absent capacity entry means \"no\n * estimate\" — unknown is never treated as exhausted.\n */\nexport interface SchedulerInput {\n  readonly routing: RoutingDecision\n  readonly demand: Demand\n  /** Host inventory (adapter-normalized). Candidates absent here are unverifiable. */\n  readonly inventory: readonly CandidateModel[]\n  /** Configured resources of the required tier, in user order (ADP-005). */\n  readonly tierCandidates: readonly ModelRef[]\n  readonly health: Readonly<Record<string, Assessment>>\n  readonly capacity: Readonly<Record<string, CapacitySignals>>\n}\n\n/** Bound on the `skipped` evidence list of an `apply` decision. */\nexport const MAX_EVIDENCE_SKIPPED = 8\n\n/** Canonical health/capacity map key for a candidate model reference. */\nexport function schedulerHealthKey(ref: ModelRef): string {\n  return resourceKeyID(\n    ref.variant === undefined\n      ? { providerID: ref.providerID, modelID: ref.id }\n      : { providerID: ref.providerID, modelID: ref.id, variantID: ref.variant },\n  )\n}\n"]}

package/dist/core/tier-policy/index.d.ts

@@ -1,4 +1,3 @@
 export * from "./types.js";
 export * from "./resolve.js";
 export * from "./tier-list.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/core/tier-policy/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/tier-policy/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,cAAc,CAAA;AAC5B,cAAc,gBAAgB,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/tier-policy/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,cAAc,CAAA;AAC5B,cAAc,gBAAgB,CAAA","sourcesContent":["export * from \"./types.js\"\nexport * from \"./resolve.js\"\nexport * from \"./tier-list.js\"\n"]}

package/dist/core/tier-policy/resolve.d.ts

@@ -16,4 +16,3 @@
  */
 import { type RoutingDecision, type RoutingInput } from "./types.js";
 export declare function resolveRouting(input: RoutingInput): RoutingDecision;
-//# sourceMappingURL=resolve.d.ts.map

package/dist/core/tier-policy/resolve.js.map

@@ -1 +1 @@
-{"version":3,"file":"resolve.js","sourceRoot":"","sources":["../../../src/core/tier-policy/resolve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,EACL,cAAc,EACd,YAAY,EACZ,WAAW,GAKZ,MAAM,YAAY,CAAA;AAEnB,MAAM,UAAU,cAAc,CAAC,KAAmB;IAChD,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,CAAA;IAC1C,CAAC;IAED,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACpC,OAAO,eAAe,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,cAAc,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;IACvF,CAAC;IAED,oEAAoE;IACpE,qEAAqE;IACrE,kEAAkE;IAClE,MAAM,SAAS,GACb,KAAK,CAAC,KAAK,KAAK,SAAS;QACzB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;QACtB,KAAK,CAAC,UAAU,KAAK,SAAS;QAC9B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC;QAC1C,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC;QAC/B,CAAC,CAAC,SAAS,CAAA;IACf,MAAM,aAAa,GACjB,KAAK,CAAC,WAAW,KAAK,SAAS,IAAI,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAA;IAEhG,IAAI,SAAS,KAAK,SAAS,IAAI,aAAa,KAAK,SAAS,IAAI,SAAS,KAAK,aAAa,EAAE,CAAC;QAC1F,OAAO,eAAe,CAAC,YAAY,EAAE,WAAW,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,eAAe,CAAC,SAAS,EAAE,YAAY,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;IACxE,CAAC;IACD,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,eAAe,CAAC,aAAa,EAAE,mBAAmB,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;IACnF,CAAC;IAED,OAAO,eAAe,CAAC,YAAY,EAAE,SAAS,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;AACxE,CAAC;AAED,SAAS,eAAe,CACtB,IAAc,EACd,MAAqB,EACrB,eAAoC;IAEpC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,qBAAqB,EAAE,CAAA;IAC/D,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAA;AACvC,CAAC"}
+{"version":3,"file":"resolve.js","sourceRoot":"","sources":["../../../src/core/tier-policy/resolve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,EACL,cAAc,EACd,YAAY,EACZ,WAAW,GAKZ,MAAM,YAAY,CAAA;AAEnB,MAAM,UAAU,cAAc,CAAC,KAAmB;IAChD,IAAI,KAAK,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,CAAA;IAC1C,CAAC;IAED,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACpC,OAAO,eAAe,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,cAAc,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;IACvF,CAAC;IAED,oEAAoE;IACpE,qEAAqE;IACrE,kEAAkE;IAClE,MAAM,SAAS,GACb,KAAK,CAAC,KAAK,KAAK,SAAS;QACzB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;QACtB,KAAK,CAAC,UAAU,KAAK,SAAS;QAC9B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC;QAC1C,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC;QAC/B,CAAC,CAAC,SAAS,CAAA;IACf,MAAM,aAAa,GACjB,KAAK,CAAC,WAAW,KAAK,SAAS,IAAI,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAA;IAEhG,IAAI,SAAS,KAAK,SAAS,IAAI,aAAa,KAAK,SAAS,IAAI,SAAS,KAAK,aAAa,EAAE,CAAC;QAC1F,OAAO,eAAe,CAAC,YAAY,EAAE,WAAW,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,eAAe,CAAC,SAAS,EAAE,YAAY,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;IACxE,CAAC;IACD,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,eAAe,CAAC,aAAa,EAAE,mBAAmB,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;IACnF,CAAC;IAED,OAAO,eAAe,CAAC,YAAY,EAAE,SAAS,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;AACxE,CAAC;AAED,SAAS,eAAe,CACtB,IAAc,EACd,MAAqB,EACrB,eAAoC;IAEpC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,qBAAqB,EAAE,CAAA;IAC/D,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAA;AACvC,CAAC","sourcesContent":["/**\n * Routing priority ladder (ADP-002):\n *\n *   explicit user/model pin\n *   → explicit tier request\n *   → supported agent role hint\n *   → deterministic local request evidence (auxiliary kinds)\n *   → default `standard`\n *\n * Ambiguity within a level resolves to `standard`. An explicit signal whose\n * tier has no configured resources is NOT silently downgraded to another\n * tier (that would borrow across tiers — GOAL tenet 4): the router defers\n * instead (ADP-003), keeping OpenCode's model choice. No LLM call and no\n * keyword classifier participates (ADP-004) — every input is a structured\n * field.\n */\nimport {\n  AUXILIARY_TIER,\n  DEFAULT_TIER,\n  isAuxiliary,\n  type RoutingDecision,\n  type RoutingInput,\n  type RoutingSource,\n  type TierName,\n} from \"./types.js\"\n\nexport function resolveRouting(input: RoutingInput): RoutingDecision {\n  if (input.pin !== undefined) {\n    return { kind: \"pin\", model: input.pin }\n  }\n\n  if (input.tierRequest !== undefined) {\n    return byConfiguration(input.tierRequest.tier, \"tier-request\", input.configuredTiers)\n  }\n\n  // Role level: an agent-name hint from user policy and deterministic\n  // auxiliary-request evidence. Conflict inside the level is ambiguity\n  // (ADP-002) and resolves to `standard`; agreement keeps the tier.\n  const agentTier =\n    input.agent !== undefined &&\n    input.agent.length > 0 &&\n    input.agentTiers !== undefined &&\n    Object.hasOwn(input.agentTiers, input.agent)\n      ? input.agentTiers[input.agent]\n      : undefined\n  const auxiliaryTier =\n    input.requestKind !== undefined && isAuxiliary(input.requestKind) ? AUXILIARY_TIER : undefined\n\n  if (agentTier !== undefined && auxiliaryTier !== undefined && agentTier !== auxiliaryTier) {\n    return byConfiguration(DEFAULT_TIER, \"ambiguity\", input.configuredTiers)\n  }\n  if (agentTier !== undefined) {\n    return byConfiguration(agentTier, \"agent-role\", input.configuredTiers)\n  }\n  if (auxiliaryTier !== undefined) {\n    return byConfiguration(auxiliaryTier, \"auxiliary-request\", input.configuredTiers)\n  }\n\n  return byConfiguration(DEFAULT_TIER, \"default\", input.configuredTiers)\n}\n\nfunction byConfiguration(\n  tier: TierName,\n  source: RoutingSource,\n  configuredTiers: readonly TierName[],\n): RoutingDecision {\n  if (!configuredTiers.includes(tier)) {\n    return { kind: \"defer\", tier, reason: \"tier-not-configured\" }\n  }\n  return { kind: \"tier\", tier, source }\n}\n"]}

package/dist/core/tier-policy/tier-list.d.ts

@@ -8,4 +8,3 @@
  */
 import { type ModelRef } from "../work-unit/types.js";
 export declare function normalizeTierList(resources: readonly ModelRef[]): ModelRef[];
-//# sourceMappingURL=tier-list.d.ts.map

package/dist/core/tier-policy/tier-list.js.map

@@ -1 +1 @@
-{"version":3,"file":"tier-list.js","sourceRoot":"","sources":["../../../src/core/tier-policy/tier-list.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,YAAY,EAAiB,MAAM,uBAAuB,CAAA;AAEnE,MAAM,UAAU,iBAAiB,CAAC,SAA8B;IAC9D,MAAM,IAAI,GAAe,EAAE,CAAA;IAC3B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjE,SAAQ;QACV,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;YAC9D,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IACrB,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC"}
+{"version":3,"file":"tier-list.js","sourceRoot":"","sources":["../../../src/core/tier-policy/tier-list.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,YAAY,EAAiB,MAAM,uBAAuB,CAAA;AAEnE,MAAM,UAAU,iBAAiB,CAAC,SAA8B;IAC9D,MAAM,IAAI,GAAe,EAAE,CAAA;IAC3B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjE,SAAQ;QACV,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;YAC9D,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IACrB,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC","sourcesContent":["/**\n * User-configured tier lists (ADP-005): each tier is an ordered list of\n * resources; list order is user policy and is never reordered by Adaptive.\n * Normalization only removes unusable entries and exact duplicates — it\n * never reorders and never merges look-alike names (ADP-006: similar model\n * names across providers are never equivalent unless the user configures\n * both, and full-reference equality below is deliberately provider-scoped).\n */\nimport { sameModelRef, type ModelRef } from \"../work-unit/types.js\"\n\nexport function normalizeTierList(resources: readonly ModelRef[]): ModelRef[] {\n  const kept: ModelRef[] = []\n  for (const resource of resources) {\n    if (resource.providerID.length === 0 || resource.id.length === 0) {\n      continue\n    }\n    if (kept.some((existing) => sameModelRef(existing, resource))) {\n      continue\n    }\n    kept.push(resource)\n  }\n  return kept\n}\n"]}

package/dist/core/tier-policy/types.d.ts

@@ -6,6 +6,8 @@
 import type { ModelRef } from "../work-unit/types.js";
 export declare const TIERS: readonly ["quick", "standard", "advanced"];
 export type TierName = (typeof TIERS)[number];
+/** Vocabulary guard without a cast: strict member equality. */
+export declare function isTierName(tier: string): tier is TierName;
 /**
  * Request kinds the OpenCode `context` hook exposes for the executing
  * request. Auxiliary kinds are trivial host-internal requests (title,
@@ -82,4 +84,3 @@ export declare function isAuxiliary(kind: RequestKind): boolean;
  * → `advanced`. `advanced` is the last tier — there is no next.
  */
 export declare function nextTier(tier: TierName): TierName | undefined;
-//# sourceMappingURL=types.d.ts.map

package/dist/core/tier-policy/types.js

@@ -1,4 +1,8 @@
 export const TIERS = ["quick", "standard", "advanced"];
+/** Vocabulary guard without a cast: strict member equality. */
+export function isTierName(tier) {
+    return TIERS.some((name) => name === tier);
+}
 /**
  * Request kinds the OpenCode `context` hook exposes for the executing
  * request. Auxiliary kinds are trivial host-internal requests (title,

package/dist/core/tier-policy/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/tier-policy/types.ts"],"names":[],"mappings":"AAOA,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,CAAsC,CAAA;AAI3F;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,YAAY;IACZ,OAAO;IACP,UAAU;CAC0B,CAAA;AAMtC,2CAA2C;AAC3C,MAAM,CAAC,MAAM,cAAc,GAAa,OAAO,CAAA;AAE/C,2CAA2C;AAC3C,MAAM,CAAC,MAAM,YAAY,GAAa,UAAU,CAAA;AAEhD,iFAAiF;AACjF,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,gBAAgB;IAChB,iBAAiB;CACmB,CAAA;AAiCtC,oEAAoE;AACpE,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,KAAK;IACL,cAAc;IACd,YAAY;IACZ,mBAAmB;IACnB,WAAW;IACX,SAAS;CAC2B,CAAA;AAItC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,qBAAqB,CAAsC,CAAA;AAiBzF,yDAAyD;AACzD,MAAM,UAAU,WAAW,CAAC,IAAiB;IAC3C,OAAO,IAAI,KAAK,SAAS,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAc;IACrC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IACjC,OAAO,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;AACzB,CAAC"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/tier-policy/types.ts"],"names":[],"mappings":"AAOA,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,CAAsC,CAAA;AAI3F,+DAA+D;AAC/D,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;AAC5C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,YAAY;IACZ,OAAO;IACP,UAAU;CAC0B,CAAA;AAMtC,2CAA2C;AAC3C,MAAM,CAAC,MAAM,cAAc,GAAa,OAAO,CAAA;AAE/C,2CAA2C;AAC3C,MAAM,CAAC,MAAM,YAAY,GAAa,UAAU,CAAA;AAEhD,iFAAiF;AACjF,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,gBAAgB;IAChB,iBAAiB;CACmB,CAAA;AAiCtC,oEAAoE;AACpE,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,KAAK;IACL,cAAc;IACd,YAAY;IACZ,mBAAmB;IACnB,WAAW;IACX,SAAS;CAC2B,CAAA;AAItC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,qBAAqB,CAAsC,CAAA;AAiBzF,yDAAyD;AACzD,MAAM,UAAU,WAAW,CAAC,IAAiB;IAC3C,OAAO,IAAI,KAAK,SAAS,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAc;IACrC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IACjC,OAAO,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;AACzB,CAAC","sourcesContent":["/**\n * Tier-policy types (ADP-002..006). Tier names are an ecosystem proposal —\n * OpenCode has no native capability-tier API — so every tier semantic lives\n * in this module and nowhere else.\n */\nimport type { ModelRef } from \"../work-unit/types.js\"\n\nexport const TIERS = [\"quick\", \"standard\", \"advanced\"] as const satisfies readonly string[]\n\nexport type TierName = (typeof TIERS)[number]\n\n/** Vocabulary guard without a cast: strict member equality. */\nexport function isTierName(tier: string): tier is TierName {\n  return TIERS.some((name) => name === tier)\n}\n\n/**\n * Request kinds the OpenCode `context` hook exposes for the executing\n * request. Auxiliary kinds are trivial host-internal requests (title,\n * compaction, generate) that must not consume an unnecessarily expensive\n * tier — this is structured host evidence, not prompt keyword matching\n * (ADP-004).\n */\nexport const AUXILIARY_KINDS = [\n  \"compaction\",\n  \"title\",\n  \"generate\",\n] as const satisfies readonly string[]\n\nexport type AuxiliaryKind = (typeof AUXILIARY_KINDS)[number]\n\nexport type RequestKind = \"primary\" | AuxiliaryKind\n\n/** Auxiliary requests route to `quick`. */\nexport const AUXILIARY_TIER: TierName = \"quick\"\n\n/** Unambiguous fallback tier (ADP-002). */\nexport const DEFAULT_TIER: TierName = \"standard\"\n\n/** How an explicit tier request reached the plugin (provenance for receipts). */\nexport const TIER_REQUEST_VIAS = [\n  \"manual-command\",\n  \"session-setting\",\n] as const satisfies readonly string[]\n\nexport type TierRequestVia = (typeof TIER_REQUEST_VIAS)[number]\n\nexport interface TierRequest {\n  readonly tier: TierName\n  readonly via: TierRequestVia\n}\n\n/**\n * Everything the ladder may look at, all optional except the configuration\n * view. Every signal is a structured field supplied by the adapter — never\n * text mined from a prompt.\n */\nexport interface RoutingInput {\n  /** Explicit user/model pin (manual control); always wins (ADP-002). */\n  readonly pin?: ModelRef | undefined\n  /** Explicit tier request (manual command or session setting). */\n  readonly tierRequest?: TierRequest | undefined\n  /** OpenCode agent name of the executing request, when the host supplies one. */\n  readonly agent?: string | undefined\n  /** Request kind from the `context` hook, when known. */\n  readonly requestKind?: RequestKind | undefined\n  /** User-configured agent-name → tier mapping (role hints are user policy). */\n  readonly agentTiers?: Readonly<Record<string, TierName>> | undefined\n  /**\n   * Tiers that currently have at least one configured resource (ADP-005).\n   * A tier without resources can never be honored — Adaptive does not\n   * invent resources and never borrows across tiers (GOAL tenet 4).\n   */\n  readonly configuredTiers: readonly TierName[]\n}\n\n/** Why the ladder produced a tier decision (receipt provenance). */\nexport const ROUTING_SOURCES = [\n  \"pin\",\n  \"tier-request\",\n  \"agent-role\",\n  \"auxiliary-request\",\n  \"ambiguity\",\n  \"default\",\n] as const satisfies readonly string[]\n\nexport type RoutingSource = (typeof ROUTING_SOURCES)[number]\n\nexport const DEFER_REASONS = [\"tier-not-configured\"] as const satisfies readonly string[]\n\nexport type DeferReason = (typeof DEFER_REASONS)[number]\n\n/**\n * Routing outcome (ADP-002/003):\n * - `pin` — route to the pinned resource.\n * - `tier` — route within the named tier.\n * - `defer` — Adaptive has no reason to override ordinary OpenCode behavior;\n *   the unit keeps OpenCode's model choice. `tier` records which tier the\n *   ladder resolved to before the configuration gate blocked it.\n */\nexport type RoutingDecision =\n  | { readonly kind: \"pin\"; readonly model: ModelRef }\n  | { readonly kind: \"tier\"; readonly tier: TierName; readonly source: RoutingSource }\n  | { readonly kind: \"defer\"; readonly tier: TierName; readonly reason: DeferReason }\n\n/** True only for the trivial auxiliary request kinds. */\nexport function isAuxiliary(kind: RequestKind): boolean {\n  return kind !== \"primary\"\n}\n\n/**\n * Escalation ladder order (GOAL capability escalation): `quick` → `standard`\n * → `advanced`. `advanced` is the last tier — there is no next.\n */\nexport function nextTier(tier: TierName): TierName | undefined {\n  const index = TIERS.indexOf(tier)\n  return TIERS[index + 1]\n}\n"]}

package/dist/core/work-unit/index.d.ts

@@ -1,4 +1,3 @@
 export * from "./interruption.js";
 export * from "./types.js";
 export * from "./tracker.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/core/work-unit/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/work-unit/index.ts"],"names":[],"mappings":"AAAA,cAAc,mBAAmB,CAAA;AACjC,cAAc,YAAY,CAAA;AAC1B,cAAc,cAAc,CAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/work-unit/index.ts"],"names":[],"mappings":"AAAA,cAAc,mBAAmB,CAAA;AACjC,cAAc,YAAY,CAAA;AAC1B,cAAc,cAAc,CAAA","sourcesContent":["export * from \"./interruption.js\"\nexport * from \"./types.js\"\nexport * from \"./tracker.js\"\n"]}

package/dist/core/work-unit/interruption.d.ts

@@ -5,4 +5,3 @@
  */
 export declare const INTERRUPT_REASONS: readonly ["user", "shutdown", "superseded", "inactivity"];
 export type InterruptReason = (typeof INTERRUPT_REASONS)[number];
-//# sourceMappingURL=interruption.d.ts.map

package/dist/core/work-unit/interruption.js.map

@@ -1 +1 @@
-{"version":3,"file":"interruption.js","sourceRoot":"","sources":["../../../src/core/work-unit/interruption.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,MAAM;IACN,UAAU;IACV,YAAY;IACZ,YAAY;CACwB,CAAA"}
+{"version":3,"file":"interruption.js","sourceRoot":"","sources":["../../../src/core/work-unit/interruption.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,MAAM;IACN,UAAU;IACV,YAAY;IACZ,YAAY;CACwB,CAAA","sourcesContent":["/**\n * Why an OpenCode execution was interrupted. Values mirror the verified\n * `session.execution.interrupted` event payload (`reason`), which OpenCode\n * guarantees to be one of these four.\n */\nexport const INTERRUPT_REASONS = [\n  \"user\",\n  \"shutdown\",\n  \"superseded\",\n  \"inactivity\",\n] as const satisfies readonly string[]\n\nexport type InterruptReason = (typeof INTERRUPT_REASONS)[number]\n"]}

package/dist/core/work-unit/tracker.d.ts

@@ -15,9 +15,16 @@
  * then attributed external — again the safe direction, since the adapter
  * serializes per-session switches.
  */
-import { type ActiveUnit, type ApplyResult, type ModelRef, type ModelTransition, type OpenedResult, type WorkUnitEvent } from "./types.js";
+import { type ActiveUnit, type ApplyResult, type ModelRef, type ModelTransition, type OpenedResult, type SelectionResult, type WorkUnitEvent } from "./types.js";
 export declare class WorkUnitTracker {
     #private;
+    /**
+     * Bounded per-session maps (last model, pending own-switch note): a
+     * long-lived host meets unbounded short-lived sessions, and the model
+     * knowledge of a long-gone session is worthless. Insertion order gives the
+     * eviction (oldest session first).
+     */
+    static readonly MAX_TRACKED_SESSIONS = 1024;
     /**
      * Arms the pending own-switch note consumed by the next matching
      * `model-selected` event for this session.
@@ -35,12 +42,12 @@ export declare class WorkUnitTracker {
     apply(event: Extract<WorkUnitEvent, {
         kind: "execution-started";
     }>): OpenedResult;
+    apply(event: Extract<WorkUnitEvent, {
+        kind: "model-selected" | "model-request";
+    }>): SelectionResult;
     apply(event: WorkUnitEvent): ApplyResult;
     /** The open unit for a session, if any. */
     active(sessionID: string): ActiveUnit | undefined;
-    /** All currently open units, in insertion order. */
-    activeAll(): ActiveUnit[];
     /** Last model known to be in effect for a session, across episodes. */
     lastModel(sessionID: string): ModelTransition | undefined;
 }
-//# sourceMappingURL=tracker.d.ts.map

package/dist/core/work-unit/tracker.js

@@ -1,3 +1,4 @@
+var _a;
 /**
  * Episode tracker (ADP-001): a deterministic, clock-free state machine over
  * normalized work-unit events, keyed by session. All timestamps come from the
@@ -16,9 +17,31 @@
  * serializes per-session switches.
  */
 import { sameModelRef, } from "./types.js";
+/** Insert into a bounded map, evicting the oldest (first) entry past the cap. */
+function setBounded(map, key, value, cap) {
+    if (!map.has(key) && map.size >= cap) {
+        for (const oldest of map.keys()) {
+            map.delete(oldest);
+            break;
+        }
+    }
+    map.set(key, value);
+}
 export class WorkUnitTracker {
     #active = new Map();
+    // Intentionally unbounded: evicting an episode counter could re-mint a unit
+    // id (`${sessionID}#${episode}`) that a persisted receipt or parked record
+    // already carries — a collision replaces parked work. The map holds one
+    // number per session ever seen; that growth is bounded by session churn,
+    // not by episodes.
     #episodes = new Map();
+    /**
+     * Bounded per-session maps (last model, pending own-switch note): a
+     * long-lived host meets unbounded short-lived sessions, and the model
+     * knowledge of a long-gone session is worthless. Insertion order gives the
+     * eviction (oldest session first).
+     */
+    static MAX_TRACKED_SESSIONS = 1024;
     #lastModel = new Map();
     #pendingOwn = new Map();
     /**
@@ -26,7 +49,7 @@ export class WorkUnitTracker {
      * `model-selected` event for this session.
      */
     noteOwnSwitch(sessionID, model) {
-        this.#pendingOwn.set(sessionID, model);
+        setBounded(this.#pendingOwn, sessionID, model, _a.MAX_TRACKED_SESSIONS);
     }
     /**
      * Raises each session's episode floor. Used at startup: unit ids are
@@ -100,10 +123,6 @@ export class WorkUnitTracker {
     active(sessionID) {
         return this.#active.get(sessionID);
     }
-    /** All currently open units, in insertion order. */
-    activeAll() {
-        return [...this.#active.values()];
-    }
     /** Last model known to be in effect for a session, across episodes. */
     lastModel(sessionID) {
         return this.#lastModel.get(sessionID);
@@ -120,7 +139,7 @@ export class WorkUnitTracker {
     }
     #trackModel(sessionID, at, model, source) {
         const transition = { at, model, source };
-        this.#lastModel.set(sessionID, transition);
+        setBounded(this.#lastModel, sessionID, transition, _a.MAX_TRACKED_SESSIONS);
         const current = this.#active.get(sessionID);
         if (current === undefined)
             return { kind: "model-noted", transition };
@@ -133,4 +152,5 @@ export class WorkUnitTracker {
         return { kind: "model-tracked", unit, transition };
     }
 }
+_a = WorkUnitTracker;
 //# sourceMappingURL=tracker.js.map