agent-bober 0.12.0 → 0.17.0

package/dist/orchestrator/workflow/pure-sprint.d.ts

@@ -0,0 +1,65 @@
+/**
+ * Pure (side-effect-free) sprint cycle for the workflow interpreter.
+ *
+ * The TS pipeline's `runSprintCycle` (pipeline.ts:131) writes contracts, history,
+ * and audit checkpoints to `.bober/` inline. The workflow engine makes
+ * `RunResultFlusher` the SOLE clock/commit source — so the interpreter needs a
+ * sprint cycle that produces a result WITHOUT touching disk. This is that cycle:
+ * a generate→evaluate retry loop that returns a {@link SprintOutcome} and writes
+ * nothing. The flusher commits it afterward.
+ *
+ * The curate / generate / evaluate steps are INJECTED ({@link PureSprintDeps}):
+ * Sprint 3 ships the loop + its tests with fakes; the real wiring (runCurator /
+ * runGenerator / panel evaluator) is attached in the interpreter's default deps
+ * (Sprint 5, when eligibility flips). EvalResult timestamps come from the
+ * evaluator (real evaluation data) — never synthesized here — so this stays
+ * clock-free for the host's history stamping.
+ */
+import type { SprintContract } from "../../contracts/sprint-contract.js";
+import type { EvalResult } from "../../contracts/eval-result.js";
+import type { PlanSpec } from "../../contracts/spec.js";
+export type SprintOutcomeKind = "passed" | "needs-rework" | "failed";
+export interface SprintInput {
+    contract: SprintContract;
+    spec: PlanSpec;
+    /** Max generate→evaluate iterations for this sprint. */
+    maxIterations: number;
+    /** Contracts that already passed — context for the generator/curator. */
+    priorPassed: SprintContract[];
+}
+export interface SprintOutcome {
+    contract: SprintContract;
+    finalVerdict: EvalResult;
+    iterationsUsed: number;
+    outcome: SprintOutcomeKind;
+    /** The per-lens verdicts from the final iteration (length >= 1). */
+    lensVerdicts: EvalResult[];
+}
+/** One generation attempt's result (provider-agnostic, side-effect-free). */
+export interface GenerationResult {
+    /** True if the generator hit a hard blocker it could not resolve. */
+    blocked: boolean;
+    /** Free-form summary, threaded into the next iteration's feedback. */
+    summary: string;
+}
+export type ReconcileFn = (contractId: string, iteration: number, verdicts: EvalResult[], timestamp: string) => EvalResult;
+export interface PureSprintDeps {
+    /** Optional one-shot context curation; returns a briefing string. */
+    curate?: (input: SprintInput) => Promise<string>;
+    /** Run one generation attempt. `feedback` is empty on the first iteration. */
+    generate: (input: SprintInput, briefing: string, feedback: string) => Promise<GenerationResult>;
+    /** Evaluate current state → one or more lens verdicts for this iteration. */
+    evaluate: (input: SprintInput, iteration: number) => Promise<EvalResult[]>;
+    /** Reduce lens verdicts to one verdict. Defaults to the majority-vote reconciler. */
+    reconcile?: ReconcileFn;
+}
+/**
+ * Run a single sprint's generate→evaluate retry loop, side-effect-free.
+ *
+ * Each iteration: (curate once) → generate → evaluate → reconcile. Returns
+ * `passed` as soon as a verdict passes (and the generator isn't blocked);
+ * `failed` if the generator reports a hard blocker; `needs-rework` if the
+ * iteration budget is exhausted without passing.
+ */
+export declare function runPureSprint(input: SprintInput, deps: PureSprintDeps): Promise<SprintOutcome>;
+//# sourceMappingURL=pure-sprint.d.ts.map

package/dist/orchestrator/workflow/pure-sprint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pure-sprint.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/workflow/pure-sprint.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AACzE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AACjE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGxD,MAAM,MAAM,iBAAiB,GAAG,QAAQ,GAAG,cAAc,GAAG,QAAQ,CAAC;AAErE,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,cAAc,CAAC;IACzB,IAAI,EAAE,QAAQ,CAAC;IACf,wDAAwD;IACxD,aAAa,EAAE,MAAM,CAAC;IACtB,yEAAyE;IACzE,WAAW,EAAE,cAAc,EAAE,CAAC;CAC/B;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,cAAc,CAAC;IACzB,YAAY,EAAE,UAAU,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,iBAAiB,CAAC;IAC3B,oEAAoE;IACpE,YAAY,EAAE,UAAU,EAAE,CAAC;CAC5B;AAED,6EAA6E;AAC7E,MAAM,WAAW,gBAAgB;IAC/B,qEAAqE;IACrE,OAAO,EAAE,OAAO,CAAC;IACjB,sEAAsE;IACtE,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,WAAW,GAAG,CACxB,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,UAAU,EAAE,EACtB,SAAS,EAAE,MAAM,KACd,UAAU,CAAC;AAEhB,MAAM,WAAW,cAAc;IAC7B,qEAAqE;IACrE,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IACjD,8EAA8E;IAC9E,QAAQ,EAAE,CACR,KAAK,EAAE,WAAW,EAClB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,KACb,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAC/B,6EAA6E;IAC7E,QAAQ,EAAE,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IAC3E,qFAAqF;IACrF,SAAS,CAAC,EAAE,WAAW,CAAC;CACzB;AAaD;;;;;;;GAOG;AACH,wBAAsB,aAAa,CACjC,KAAK,EAAE,WAAW,EAClB,IAAI,EAAE,cAAc,GACnB,OAAO,CAAC,aAAa,CAAC,CAqDxB"}

package/dist/orchestrator/workflow/pure-sprint.js

@@ -0,0 +1,82 @@
+/**
+ * Pure (side-effect-free) sprint cycle for the workflow interpreter.
+ *
+ * The TS pipeline's `runSprintCycle` (pipeline.ts:131) writes contracts, history,
+ * and audit checkpoints to `.bober/` inline. The workflow engine makes
+ * `RunResultFlusher` the SOLE clock/commit source — so the interpreter needs a
+ * sprint cycle that produces a result WITHOUT touching disk. This is that cycle:
+ * a generate→evaluate retry loop that returns a {@link SprintOutcome} and writes
+ * nothing. The flusher commits it afterward.
+ *
+ * The curate / generate / evaluate steps are INJECTED ({@link PureSprintDeps}):
+ * Sprint 3 ships the loop + its tests with fakes; the real wiring (runCurator /
+ * runGenerator / panel evaluator) is attached in the interpreter's default deps
+ * (Sprint 5, when eligibility flips). EvalResult timestamps come from the
+ * evaluator (real evaluation data) — never synthesized here — so this stays
+ * clock-free for the host's history stamping.
+ */
+import { reconcile } from "./reconciler.js";
+/** Use a verdict's own timestamp (evaluation data); epoch fallback if none. */
+function pickTimestamp(verdicts) {
+    return verdicts[0]?.timestamp ?? new Date(0).toISOString();
+}
+function buildFeedback(verdict, gen) {
+    return [verdict.feedback, gen.summary]
+        .filter((s) => s.length > 0)
+        .join("\n");
+}
+/**
+ * Run a single sprint's generate→evaluate retry loop, side-effect-free.
+ *
+ * Each iteration: (curate once) → generate → evaluate → reconcile. Returns
+ * `passed` as soon as a verdict passes (and the generator isn't blocked);
+ * `failed` if the generator reports a hard blocker; `needs-rework` if the
+ * iteration budget is exhausted without passing.
+ */
+export async function runPureSprint(input, deps) {
+    const reduce = deps.reconcile ?? reconcile;
+    const contractId = input.contract.contractId;
+    const briefing = deps.curate ? await deps.curate(input) : "";
+    const maxIter = Math.max(1, input.maxIterations);
+    let feedback = "";
+    let lastVerdict;
+    let lastLensVerdicts = [];
+    for (let iter = 1; iter <= maxIter; iter += 1) {
+        const gen = await deps.generate(input, briefing, feedback);
+        const lensVerdicts = await deps.evaluate(input, iter);
+        lastLensVerdicts = lensVerdicts;
+        const verdict = lensVerdicts.length === 1 && lensVerdicts[0] !== undefined
+            ? lensVerdicts[0]
+            : reduce(contractId, iter, lensVerdicts, pickTimestamp(lensVerdicts));
+        lastVerdict = verdict;
+        if (verdict.passed && !gen.blocked) {
+            return {
+                contract: input.contract,
+                finalVerdict: verdict,
+                iterationsUsed: iter,
+                outcome: "passed",
+                lensVerdicts,
+            };
+        }
+        if (gen.blocked) {
+            return {
+                contract: input.contract,
+                finalVerdict: verdict,
+                iterationsUsed: iter,
+                outcome: "failed",
+                lensVerdicts,
+            };
+        }
+        feedback = buildFeedback(verdict, gen);
+    }
+    // Iteration budget exhausted without passing → retryable rework.
+    const finalVerdict = lastVerdict ?? reduce(contractId, maxIter, [], new Date(0).toISOString());
+    return {
+        contract: input.contract,
+        finalVerdict,
+        iterationsUsed: maxIter,
+        outcome: "needs-rework",
+        lensVerdicts: lastLensVerdicts,
+    };
+}
+//# sourceMappingURL=pure-sprint.js.map

package/dist/orchestrator/workflow/pure-sprint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pure-sprint.js","sourceRoot":"","sources":["../../../src/orchestrator/workflow/pure-sprint.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAKH,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAoD5C,+EAA+E;AAC/E,SAAS,aAAa,CAAC,QAAsB;IAC3C,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;AAC7D,CAAC;AAED,SAAS,aAAa,CAAC,OAAmB,EAAE,GAAqB;IAC/D,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC;SACnC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,KAAkB,EAClB,IAAoB;IAEpB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;IAC3C,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC;IAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAE7D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IACjD,IAAI,QAAQ,GAAG,EAAE,CAAC;IAClB,IAAI,WAAmC,CAAC;IACxC,IAAI,gBAAgB,GAAiB,EAAE,CAAC;IAExC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,OAAO,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC9C,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC3D,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACtD,gBAAgB,GAAG,YAAY,CAAC;QAEhC,MAAM,OAAO,GACX,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,SAAS;YACxD,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;YACjB,CAAC,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC;QAC1E,WAAW,GAAG,OAAO,CAAC;QAEtB,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;YACnC,OAAO;gBACL,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,YAAY,EAAE,OAAO;gBACrB,cAAc,EAAE,IAAI;gBACpB,OAAO,EAAE,QAAQ;gBACjB,YAAY;aACb,CAAC;QACJ,CAAC;QAED,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChB,OAAO;gBACL,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,YAAY,EAAE,OAAO;gBACrB,cAAc,EAAE,IAAI;gBACpB,OAAO,EAAE,QAAQ;gBACjB,YAAY;aACb,CAAC;QACJ,CAAC;QAED,QAAQ,GAAG,aAAa,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,iEAAiE;IACjE,MAAM,YAAY,GAAG,WAAW,IAAI,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAC/F,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,YAAY;QACZ,cAAc,EAAE,OAAO;QACvB,OAAO,EAAE,cAAc;QACvB,YAAY,EAAE,gBAAgB;KAC/B,CAAC;AACJ,CAAC"}

package/dist/orchestrator/workflow/reconciler.d.ts

@@ -0,0 +1,15 @@
+import type { EvalResult } from "../../contracts/eval-result.js";
+/**
+ * Pure majority-vote reducer over per-lens EvalResult[] (ADR-4).
+ * No Date.now / new Date / Math.random / fs — timestamp is a caller arg.
+ *
+ * Rules:
+ *   - empty lensVerdicts → throws
+ *   - passed = passCount > failCount (strict majority, fail-closed on tie)
+ *   - details = union of all failing details, de-duped by (criterion, message)
+ *   - feedback = failing lenses' feedback joined with newlines, or "All lenses passed."
+ *   - evaluator = "panel"
+ *   - timestamp = the injected timestamp argument (echoed verbatim)
+ */
+export declare function reconcile(_sprintId: string, _round: number, lensVerdicts: EvalResult[], timestamp: string): EvalResult;
+//# sourceMappingURL=reconciler.d.ts.map

package/dist/orchestrator/workflow/reconciler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconciler.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/workflow/reconciler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAc,MAAM,gCAAgC,CAAC;AAI7E;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CACvB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,UAAU,EAAE,EAC1B,SAAS,EAAE,MAAM,GAChB,UAAU,CA4DZ"}

package/dist/orchestrator/workflow/reconciler.js

@@ -0,0 +1,65 @@
+// ── Reconciler ─────────────────────────────────────────────────────
+/**
+ * Pure majority-vote reducer over per-lens EvalResult[] (ADR-4).
+ * No Date.now / new Date / Math.random / fs — timestamp is a caller arg.
+ *
+ * Rules:
+ *   - empty lensVerdicts → throws
+ *   - passed = passCount > failCount (strict majority, fail-closed on tie)
+ *   - details = union of all failing details, de-duped by (criterion, message)
+ *   - feedback = failing lenses' feedback joined with newlines, or "All lenses passed."
+ *   - evaluator = "panel"
+ *   - timestamp = the injected timestamp argument (echoed verbatim)
+ */
+export function reconcile(_sprintId, _round, lensVerdicts, timestamp) {
+    if (lensVerdicts.length === 0) {
+        throw new Error("reconcile: lensVerdicts must be non-empty");
+    }
+    const n = lensVerdicts.length;
+    // Count passing lenses
+    let passCount = 0;
+    for (const lens of lensVerdicts) {
+        if (lens.passed === true) {
+            passCount = passCount + 1;
+        }
+    }
+    const failCount = n - passCount;
+    // Strict majority: passCount must exceed failCount (fail-closed on tie)
+    const passed = passCount > failCount;
+    // Union failing details, de-duped by criterion + message
+    const seenKeys = new Set();
+    const details = [];
+    for (const lens of lensVerdicts) {
+        for (const detail of lens.details) {
+            if (detail.passed === false) {
+                const key = `${detail.criterion}␟${detail.message}`;
+                if (!seenKeys.has(key)) {
+                    seenKeys.add(key);
+                    details.push(detail);
+                }
+            }
+        }
+    }
+    // Build summary
+    const summary = `Panel verdict: ${passCount}/${n} lenses passed`;
+    // Build feedback from failing lenses
+    const feedbackParts = [];
+    for (const lens of lensVerdicts) {
+        if (!lens.passed && lens.feedback) {
+            feedbackParts.push(lens.feedback);
+        }
+    }
+    const feedback = feedbackParts.length > 0 ? feedbackParts.join("\n") : "All lenses passed.";
+    // Compute optional score
+    const score = Math.round((100 * passCount) / n);
+    return {
+        evaluator: "panel",
+        passed,
+        score,
+        details,
+        summary,
+        feedback,
+        timestamp,
+    };
+}
+//# sourceMappingURL=reconciler.js.map

package/dist/orchestrator/workflow/reconciler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconciler.js","sourceRoot":"","sources":["../../../src/orchestrator/workflow/reconciler.ts"],"names":[],"mappings":"AAEA,sEAAsE;AAEtE;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,SAAS,CACvB,SAAiB,EACjB,MAAc,EACd,YAA0B,EAC1B,SAAiB;IAEjB,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;IAE9B,uBAAuB;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACzB,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC;IAEhC,wEAAwE;IACxE,MAAM,MAAM,GAAG,SAAS,GAAG,SAAS,CAAC;IAErC,yDAAyD;IACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,OAAO,GAAiB,EAAE,CAAC;IAEjC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAClB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,gBAAgB;IAChB,MAAM,OAAO,GAAG,kBAAkB,SAAS,IAAI,CAAC,gBAAgB,CAAC;IAEjE,qCAAqC;IACrC,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC;IAE5F,yBAAyB;IACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAEhD,OAAO;QACL,SAAS,EAAE,OAAO;QAClB,MAAM;QACN,KAAK;QACL,OAAO;QACP,OAAO;QACP,QAAQ;QACR,SAAS;KACV,CAAC;AACJ,CAAC"}

package/dist/orchestrator/workflow/resume-cursor.d.ts

@@ -0,0 +1,10 @@
+import type { ResumeCursor } from "./types.js";
+/**
+ * Reconstructs a ResumeCursor from durable contract status and history.
+ * Contract status is the source of truth — history is corroboration only.
+ * When history and contract status conflict, contract status wins.
+ */
+export declare class ResumeCursorReconstructor {
+    reconstruct(projectRoot: string, specId: string): Promise<ResumeCursor>;
+}
+//# sourceMappingURL=resume-cursor.d.ts.map

package/dist/orchestrator/workflow/resume-cursor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resume-cursor.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/workflow/resume-cursor.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C;;;;GAIG;AACH,qBAAa,yBAAyB;IAC9B,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;CAoB9E"}

package/dist/orchestrator/workflow/resume-cursor.js

@@ -0,0 +1,25 @@
+// ── ResumeCursorReconstructor ───────────────────────────────────────
+import { listContracts } from "../../state/sprint-state.js";
+import { loadHistory } from "../../state/history.js";
+/**
+ * Reconstructs a ResumeCursor from durable contract status and history.
+ * Contract status is the source of truth — history is corroboration only.
+ * When history and contract status conflict, contract status wins.
+ */
+export class ResumeCursorReconstructor {
+    async reconstruct(projectRoot, specId) {
+        const contracts = (await listContracts(projectRoot)).filter((c) => c.specId === specId);
+        // Corroborate with history, but contract status WINS on conflict
+        await loadHistory(projectRoot);
+        const completed = contracts
+            .filter((c) => c.status === "passed" || c.status === "completed")
+            .map((c) => c.sprintNumber);
+        const allNumbers = contracts.map((c) => c.sprintNumber);
+        return {
+            specId,
+            completedSprintNumbers: [...completed].sort((a, b) => a - b),
+            lastObservedSprintNumber: allNumbers.length ? Math.max(...allNumbers) : 0,
+        };
+    }
+}
+//# sourceMappingURL=resume-cursor.js.map

package/dist/orchestrator/workflow/resume-cursor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resume-cursor.js","sourceRoot":"","sources":["../../../src/orchestrator/workflow/resume-cursor.ts"],"names":[],"mappings":"AAAA,uEAAuE;AAEvE,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAGrD;;;;GAIG;AACH,MAAM,OAAO,yBAAyB;IACpC,KAAK,CAAC,WAAW,CAAC,WAAmB,EAAE,MAAc;QACnD,MAAM,SAAS,GAAG,CAAC,MAAM,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CACzD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAC3B,CAAC;QAEF,iEAAiE;QACjE,MAAM,WAAW,CAAC,WAAW,CAAC,CAAC;QAE/B,MAAM,SAAS,GAAG,SAAS;aACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC;aAChE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QAE9B,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QAExD,OAAO;YACL,MAAM;YACN,sBAAsB,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5D,wBAAwB,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;SAC1E,CAAC;IACJ,CAAC;CACF"}

package/dist/orchestrator/workflow/retry.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Exponential-backoff retry for transient provider failures.
+ *
+ * Today the agentic loop ends on the first `client.chat()` error
+ * (agentic-loop.ts), which is fragile when hammering a single local model
+ * server (Ollama/vLLM return 429/503 under load). `withRetry` wraps a call in
+ * bounded exponential backoff with jitter, retrying only TRANSIENT failures
+ * (rate limits, overload, timeouts, network resets) and surfacing everything
+ * else immediately.
+ *
+ * The scheduler / interpreter wraps each provider call in this, so every
+ * provider benefits without per-adapter changes. `sleep` and `jitter` are
+ * injectable so tests are deterministic and instant.
+ */
+/**
+ * Heuristic: is this error worth retrying? True for HTTP 408/429 and 5xx,
+ * known transient network codes, and overload/rate-limit/timeout messages.
+ */
+export declare function classifyTransient(err: unknown): boolean;
+export interface RetryOptions {
+    /** Max retries AFTER the first attempt. Default 3 (=> up to 4 calls). */
+    maxRetries?: number;
+    /** Base delay in ms for the first backoff. Default 500. */
+    baseDelayMs?: number;
+    /** Upper bound on a single backoff delay. Default 30_000. */
+    maxDelayMs?: number;
+    /** Exponential growth factor. Default 2. */
+    factor?: number;
+    /** Returns a value in [0, 1) for jitter. Default Math.random. Inject for tests. */
+    jitter?: () => number;
+    /** Sleeps for `ms`. Default setTimeout-backed. Inject for tests. */
+    sleep?: (ms: number) => Promise<void>;
+    /** Decides whether an error is retryable. Default {@link classifyTransient}. */
+    isTransient?: (err: unknown) => boolean;
+    /** Called before each backoff sleep (for logging / telemetry). */
+    onRetry?: (info: {
+        attempt: number;
+        delayMs: number;
+        error: unknown;
+    }) => void;
+}
+/**
+ * Run `fn`, retrying TRANSIENT failures with exponential backoff + jitter.
+ * Non-transient errors and the final exhausted error are rethrown.
+ *
+ * Backoff for retry `n` (0-based): `min(maxDelayMs, baseDelayMs * factor**n)`,
+ * then jittered to 50–100% of that value (decorrelated, avoids thundering herd).
+ */
+export declare function withRetry<T>(fn: () => Promise<T>, opts?: RetryOptions): Promise<T>;
+//# sourceMappingURL=retry.d.ts.map

package/dist/orchestrator/workflow/retry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retry.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/workflow/retry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AA2CH;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CASvD;AAID,MAAM,WAAW,YAAY;IAC3B,yEAAyE;IACzE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,2DAA2D;IAC3D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,4CAA4C;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,mFAAmF;IACnF,MAAM,CAAC,EAAE,MAAM,MAAM,CAAC;IACtB,oEAAoE;IACpE,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IACtC,gFAAgF;IAChF,WAAW,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,OAAO,CAAC;IACxC,kEAAkE;IAClE,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,CAAA;KAAE,KAAK,IAAI,CAAC;CAChF;AAKD;;;;;;GAMG;AACH,wBAAsB,SAAS,CAAC,CAAC,EAC/B,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACpB,IAAI,GAAE,YAAiB,GACtB,OAAO,CAAC,CAAC,CAAC,CAyBZ"}

package/dist/orchestrator/workflow/retry.js

@@ -0,0 +1,100 @@
+/**
+ * Exponential-backoff retry for transient provider failures.
+ *
+ * Today the agentic loop ends on the first `client.chat()` error
+ * (agentic-loop.ts), which is fragile when hammering a single local model
+ * server (Ollama/vLLM return 429/503 under load). `withRetry` wraps a call in
+ * bounded exponential backoff with jitter, retrying only TRANSIENT failures
+ * (rate limits, overload, timeouts, network resets) and surfacing everything
+ * else immediately.
+ *
+ * The scheduler / interpreter wraps each provider call in this, so every
+ * provider benefits without per-adapter changes. `sleep` and `jitter` are
+ * injectable so tests are deterministic and instant.
+ */
+// ── Transient classification ────────────────────────────────────────
+function asRecord(err) {
+    return typeof err === "object" && err !== null
+        ? err
+        : undefined;
+}
+function getStatus(err) {
+    const e = asRecord(err);
+    if (!e)
+        return undefined;
+    const s = e["status"] ?? e["statusCode"];
+    return typeof s === "number" ? s : undefined;
+}
+function getCode(err) {
+    const e = asRecord(err);
+    const c = e?.["code"];
+    return typeof c === "string" ? c : undefined;
+}
+function getMessage(err) {
+    if (err instanceof Error)
+        return err.message;
+    const e = asRecord(err);
+    const m = e?.["message"];
+    return typeof m === "string" ? m : String(err);
+}
+const TRANSIENT_CODES = new Set([
+    "ETIMEDOUT",
+    "ECONNRESET",
+    "ECONNREFUSED",
+    "ENOTFOUND",
+    "EAI_AGAIN",
+    "EPIPE",
+    "ECONNABORTED",
+]);
+const TRANSIENT_MESSAGE = /rate.?limit|too many requests|overloaded|overload|temporarily|try again|timed? ?out|service unavailable|ECONNRESET|ETIMEDOUT|\b(?:429|500|502|503|504|529)\b/i;
+/**
+ * Heuristic: is this error worth retrying? True for HTTP 408/429 and 5xx,
+ * known transient network codes, and overload/rate-limit/timeout messages.
+ */
+export function classifyTransient(err) {
+    const status = getStatus(err);
+    if (status !== undefined) {
+        if (status === 408 || status === 429)
+            return true;
+        if (status >= 500 && status < 600)
+            return true;
+    }
+    const code = getCode(err);
+    if (code && TRANSIENT_CODES.has(code))
+        return true;
+    return TRANSIENT_MESSAGE.test(getMessage(err));
+}
+const defaultSleep = (ms) => new Promise((resolve) => setTimeout(resolve, ms));
+/**
+ * Run `fn`, retrying TRANSIENT failures with exponential backoff + jitter.
+ * Non-transient errors and the final exhausted error are rethrown.
+ *
+ * Backoff for retry `n` (0-based): `min(maxDelayMs, baseDelayMs * factor**n)`,
+ * then jittered to 50–100% of that value (decorrelated, avoids thundering herd).
+ */
+export async function withRetry(fn, opts = {}) {
+    const maxRetries = opts.maxRetries ?? 3;
+    const baseDelayMs = opts.baseDelayMs ?? 500;
+    const maxDelayMs = opts.maxDelayMs ?? 30_000;
+    const factor = opts.factor ?? 2;
+    const jitter = opts.jitter ?? Math.random;
+    const sleep = opts.sleep ?? defaultSleep;
+    const isTransient = opts.isTransient ?? classifyTransient;
+    for (let attempt = 0; attempt <= maxRetries; attempt += 1) {
+        try {
+            return await fn();
+        }
+        catch (error) {
+            if (attempt === maxRetries || !isTransient(error)) {
+                throw error;
+            }
+            const raw = Math.min(maxDelayMs, baseDelayMs * Math.pow(factor, attempt));
+            const delayMs = raw * (0.5 + 0.5 * jitter());
+            opts.onRetry?.({ attempt: attempt + 1, delayMs, error });
+            await sleep(delayMs);
+        }
+    }
+    // Unreachable: the loop either returns or throws on the final attempt.
+    throw new Error("withRetry: retry loop exited unexpectedly.");
+}
+//# sourceMappingURL=retry.js.map

package/dist/orchestrator/workflow/retry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retry.js","sourceRoot":"","sources":["../../../src/orchestrator/workflow/retry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,uEAAuE;AAEvE,SAAS,QAAQ,CAAC,GAAY;IAC5B,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAC5C,CAAC,CAAE,GAA+B;QAClC,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC;AAED,SAAS,SAAS,CAAC,GAAY;IAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IACxB,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACzB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC;IACzC,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/C,CAAC;AAED,SAAS,OAAO,CAAC,GAAY;IAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IACtB,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/C,CAAC;AAED,SAAS,UAAU,CAAC,GAAY;IAC9B,IAAI,GAAG,YAAY,KAAK;QAAE,OAAO,GAAG,CAAC,OAAO,CAAC;IAC7C,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IACzB,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACjD,CAAC;AAED,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;IAC9B,WAAW;IACX,YAAY;IACZ,cAAc;IACd,WAAW;IACX,WAAW;IACX,OAAO;IACP,cAAc;CACf,CAAC,CAAC;AAEH,MAAM,iBAAiB,GACrB,+JAA+J,CAAC;AAElK;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAY;IAC5C,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,IAAI,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QAClD,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,GAAG,GAAG;YAAE,OAAO,IAAI,CAAC;IACjD,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,IAAI,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACnD,OAAO,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC;AAuBD,MAAM,YAAY,GAAG,CAAC,EAAU,EAAiB,EAAE,CACjD,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;AAEpD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,EAAoB,EACpB,OAAqB,EAAE;IAEvB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC;IACxC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,GAAG,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,YAAY,CAAC;IACzC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,iBAAiB,CAAC;IAE1D,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,UAAU,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;QAC1D,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,EAAE,CAAC;QACpB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,OAAO,KAAK,UAAU,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClD,MAAM,KAAK,CAAC;YACd,CAAC;YACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;YAC1E,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,MAAM,EAAE,CAAC,CAAC;YAC7C,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;YACzD,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;AAChE,CAAC"}

package/dist/orchestrator/workflow/scheduler.d.ts

@@ -0,0 +1,87 @@
+/**
+ * Concurrency scheduler for the local-model workflow runtime.
+ *
+ * Mirrors the execution model of Claude Code's dynamic-workflow runtime:
+ *   - `parallel(thunks)` — barrier; runs all thunks with bounded concurrency
+ *     and awaits them all (order-preserving). Use for lens panels / N skeptics.
+ *   - `pipeline(items, ...stages)` — per-item, NO barrier between stages; each
+ *     item flows through every stage independently, so item A can be in stage 3
+ *     while item B is still in stage 1. Total concurrent stage executions are
+ *     bounded by the same cap.
+ *
+ * Concurrency is enforced by a hand-off semaphore (true bounded concurrency,
+ * unlike chunk-batching which idles fast tasks waiting on a slow one). A live
+ * agent counter caps total executions over the scheduler's lifetime (the
+ * runaway guard — Claude Code uses 1000/run).
+ */
+/** Raised when a scheduler exceeds its lifetime agent-execution cap. */
+export declare class AgentCapError extends Error {
+    /** The cap that was hit. */
+    readonly cap: number;
+    constructor(message: string, 
+    /** The cap that was hit. */
+    cap: number);
+}
+/**
+ * The default concurrency cap: `min(16, cores - 2)`, floored at 1. Matches the
+ * Claude Code dynamic-workflow runtime. For local model servers the real bound
+ * is usually the server's slot count (e.g. Ollama's OLLAMA_NUM_PARALLEL), so
+ * callers should override `maxConcurrent` to match their backend.
+ */
+export declare function defaultConcurrency(): number;
+/**
+ * A counting semaphore with FIFO hand-off: when a holder releases and a waiter
+ * is queued, the slot transfers directly to that waiter (the active count never
+ * dips), giving true peak-concurrency === cap regardless of task duration.
+ */
+export declare class Semaphore {
+    private readonly cap;
+    private active;
+    private readonly waiters;
+    constructor(cap: number);
+    acquire(): Promise<void>;
+    release(): void;
+    /** Number of currently-held slots (for tests / introspection). */
+    get inFlight(): number;
+}
+export interface SchedulerOptions {
+    /** Max concurrent task executions. Default {@link defaultConcurrency}. */
+    maxConcurrent?: number;
+    /** Hard ceiling on total executions over this scheduler's lifetime. Default 1000. */
+    maxAgents?: number;
+}
+/** A pipeline stage: receives the previous stage's output, the original item, and its index. */
+export type Stage<I> = (prev: unknown, item: I, index: number) => Promise<unknown>;
+export declare class Scheduler {
+    readonly maxConcurrent: number;
+    readonly maxAgents: number;
+    private readonly sem;
+    private agentsStarted;
+    constructor(opts?: SchedulerOptions);
+    /** Total task executions started over this scheduler's lifetime. */
+    get agentsRun(): number;
+    /** Acquire a slot, run, release — counting the execution against the cap. */
+    private run;
+    /**
+     * Run all thunks concurrently (bounded by the cap) and await them all.
+     * Results are index-aligned with `thunks`. A thunk that throws rejects the
+     * whole call (use try/catch inside the thunk for {@link Promise.allSettled}-style
+     * tolerance).
+     */
+    parallel<T>(thunks: ReadonlyArray<() => Promise<T>>): Promise<T[]>;
+    /**
+     * Run each item through every stage independently — no barrier between
+     * stages. Returns an array index-aligned with `items`. A stage that throws
+     * (other than {@link AgentCapError}) drops that item to `null` and skips its
+     * remaining stages; the runaway-cap error propagates.
+     */
+    pipeline<I>(items: ReadonlyArray<I>, ...stages: Array<Stage<I>>): Promise<unknown[]>;
+}
+/**
+ * Map over `items` applying `fn` with at most `cap` concurrent calls, preserving
+ * input order. Backed by a hand-off {@link Semaphore} (true bounded concurrency,
+ * superseding the chunk-batching copies previously duplicated in the evaluator
+ * and architect agents).
+ */
+export declare function mapBounded<T, R>(items: ReadonlyArray<T>, cap: number, fn: (x: T) => Promise<R>): Promise<R[]>;
+//# sourceMappingURL=scheduler.d.ts.map

package/dist/orchestrator/workflow/scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/workflow/scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAMH,wEAAwE;AACxE,qBAAa,aAAc,SAAQ,KAAK;IAGpC,4BAA4B;IAC5B,QAAQ,CAAC,GAAG,EAAE,MAAM;gBAFpB,OAAO,EAAE,MAAM;IACf,4BAA4B;IACnB,GAAG,EAAE,MAAM;CAKvB;AAID;;;;;GAKG;AACH,wBAAgB,kBAAkB,IAAI,MAAM,CAG3C;AAID;;;;GAIG;AACH,qBAAa,SAAS;IAIR,OAAO,CAAC,QAAQ,CAAC,GAAG;IAHhC,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAyB;gBAEpB,GAAG,EAAE,MAAM;IAIlC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAU9B,OAAO,IAAI,IAAI;IASf,kEAAkE;IAClE,IAAI,QAAQ,IAAI,MAAM,CAErB;CACF;AAID,MAAM,WAAW,gBAAgB;IAC/B,0EAA0E;IAC1E,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,qFAAqF;IACrF,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,gGAAgG;AAChG,MAAM,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;AAEnF,qBAAa,SAAS;IACpB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAY;IAChC,OAAO,CAAC,aAAa,CAAK;gBAEd,IAAI,GAAE,gBAAqB;IAMvC,oEAAoE;IACpE,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,6EAA6E;YAC/D,GAAG;IAgBjB;;;;;OAKG;IACG,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC;IAIxE;;;;;OAKG;IACG,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;CAgB3F;AAID;;;;;GAKG;AACH,wBAAsB,UAAU,CAAC,CAAC,EAAE,CAAC,EACnC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,GAAG,EAAE,MAAM,EACX,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,GACvB,OAAO,CAAC,CAAC,EAAE,CAAC,CAYd"}