wotann 0.5.0

package/dist/orchestration/critic-rerank.d.ts

@@ -0,0 +1,119 @@
+/**
+ * Critic-model rerank over N parallel rollouts — OpenHands port (P1-B10).
+ *
+ * Pattern:
+ *   1. Dispatch N generator calls in parallel (each a fresh rollout with
+ *      potentially different temperature / seed / prompt-variant).
+ *   2. For each successful rollout, a critic model scores the candidate
+ *      on a 0..100 rubric (correctness, quality, security, tests).
+ *   3. Pick the highest-scored candidate. Tie-break: shortest output.
+ *
+ * Opt-in per task via `rerank: true` in the task spec — this module
+ * never fires on its own; the caller decides which tasks are hard
+ * enough to justify the N× cost.
+ *
+ * Design notes (WOTANN quality bars):
+ * - QB #6 honest failures: generator and critic errors are captured in
+ *   `errors[]` with stage + reason, never silently dropped. If ALL
+ *   generators fail, throws `AllRolloutsFailed` with every reason.
+ * - QB #7 per-session state: each `rerank()` invocation owns its own
+ *   events, rollouts, errors — no class-level mutable state leaks
+ *   between concurrent invocations on the same instance.
+ * - Observability: events emitted via `onEvent` callback in order.
+ * - Injection pattern matches B4 verifier: critic is a `CriticJudge`
+ *   which can be built from any `LlmQuery` via `llmQueryCritic()`.
+ */
+import type { CriticJudge, CriticTask } from "../intelligence/critic-model.js";
+/**
+ * Result of one generator call. Metadata is provider-specific
+ * (temperature, seed, prompt-variant, cost, etc.) — passed through
+ * unmodified to the critic and to the final pick rationale.
+ */
+export interface Rollout {
+    readonly output: string;
+    readonly metadata: Readonly<Record<string, unknown>>;
+}
+export type RollouGenerator = (task: CriticTask, index: number) => Promise<Rollout>;
+export interface ScoredRollout {
+    readonly index: number;
+    readonly output: string;
+    readonly metadata: Readonly<Record<string, unknown>>;
+    readonly score: number;
+    readonly reasoning: string;
+}
+export interface RerankError {
+    readonly index: number;
+    readonly stage: "generator" | "critic";
+    readonly reason: string;
+}
+export type RerankEvent = {
+    readonly kind: "rollout.started";
+    readonly index: number;
+} | {
+    readonly kind: "rollout.finished";
+    readonly index: number;
+    readonly output: string;
+} | {
+    readonly kind: "rollout.failed";
+    readonly index: number;
+    readonly reason: string;
+} | {
+    readonly kind: "critic.scored";
+    readonly index: number;
+    readonly score: number;
+} | {
+    readonly kind: "critic.failed";
+    readonly index: number;
+    readonly reason: string;
+} | {
+    readonly kind: "rerank.picked";
+    readonly winnerIndex: number;
+    readonly score: number;
+};
+export interface RerankConfig {
+    readonly generator: RollouGenerator;
+    readonly critic: CriticJudge;
+    /** Number of candidate rollouts to generate. Default 5. */
+    readonly N?: number;
+    /** Per-rollout generation timeout in ms. Default 120_000. */
+    readonly perRolloutTimeoutMs?: number;
+    /** Event sink for observability. Optional. */
+    readonly onEvent?: (event: RerankEvent) => void;
+}
+export interface RerankResult {
+    /** The chosen candidate, or null only if no rollouts survived. */
+    readonly winner: ScoredRollout | null;
+    /** All scored rollouts (includes winner). */
+    readonly rollouts: readonly ScoredRollout[];
+    /** All generator + critic failures, indexed by original rollout index. */
+    readonly errors: readonly RerankError[];
+    /** Human-readable rationale for the pick. */
+    readonly rationale: string;
+}
+export declare class AllRolloutsFailed extends Error {
+    readonly reasons: readonly string[];
+    constructor(reasons: readonly string[]);
+}
+export declare class CriticRerank {
+    private readonly generator;
+    private readonly critic;
+    private readonly N;
+    private readonly perRolloutTimeoutMs;
+    private readonly onEvent;
+    constructor(config: RerankConfig);
+    /**
+     * Run N parallel rollouts, score each, pick the winner.
+     * Throws `AllRolloutsFailed` if every generator fails.
+     */
+    rerank(task: CriticTask): Promise<RerankResult>;
+    private runGenerator;
+    private runCritic;
+}
+/**
+ * Pick by highest score; tie-break by shortest output; final tie-break
+ * by lowest original index (stable, reproducible).
+ */
+export declare function pickWinner(scored: readonly ScoredRollout[]): ScoredRollout;
+export type { CriticCandidate, CriticJudge, CriticScore, CriticTask, } from "../intelligence/critic-model.js";
+export { llmQueryCritic } from "../intelligence/critic-model.js";
+//# sourceMappingURL=critic-rerank.d.ts.map

package/dist/orchestration/critic-rerank.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"critic-rerank.d.ts","sourceRoot":"","sources":["../../src/orchestration/critic-rerank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAEV,WAAW,EAEX,UAAU,EACX,MAAM,iCAAiC,CAAC;AAIzC;;;;GAIG;AACH,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CACtD;AAED,MAAM,MAAM,eAAe,GAAG,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;AAEpF,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACrD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,QAAQ,CAAC;IACvC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,MAAM,WAAW,GACnB;IAAE,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC5D;IAAE,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACtF;IAAE,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACpF;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAClF;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACnF;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAE7F,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,SAAS,EAAE,eAAe,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,2DAA2D;IAC3D,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC;IACpB,6DAA6D;IAC7D,QAAQ,CAAC,mBAAmB,CAAC,EAAE,MAAM,CAAC;IACtC,8CAA8C;IAC9C,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,IAAI,CAAC;CACjD;AAED,MAAM,WAAW,YAAY;IAC3B,kEAAkE;IAClE,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI,CAAC;IACtC,6CAA6C;IAC7C,QAAQ,CAAC,QAAQ,EAAE,SAAS,aAAa,EAAE,CAAC;IAC5C,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;IACxC,6CAA6C;IAC7C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAID,qBAAa,iBAAkB,SAAQ,KAAK;IAC1C,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;gBACxB,OAAO,EAAE,SAAS,MAAM,EAAE;CAOvC;AAID,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAkB;IAC5C,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAc;IACrC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAS;IAC3B,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAS;IAC7C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA+B;gBAE3C,MAAM,EAAE,YAAY;IAYhC;;;OAGG;IACG,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC;YAkFvC,YAAY;YA2BZ,SAAS;CAkBxB;AAID;;;GAGG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,GAAG,aAAa,CAY1E;AAmCD,YAAY,EACV,eAAe,EACf,WAAW,EACX,WAAW,EACX,UAAU,GACX,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC"}

package/dist/orchestration/critic-rerank.js

@@ -0,0 +1,207 @@
+/**
+ * Critic-model rerank over N parallel rollouts — OpenHands port (P1-B10).
+ *
+ * Pattern:
+ *   1. Dispatch N generator calls in parallel (each a fresh rollout with
+ *      potentially different temperature / seed / prompt-variant).
+ *   2. For each successful rollout, a critic model scores the candidate
+ *      on a 0..100 rubric (correctness, quality, security, tests).
+ *   3. Pick the highest-scored candidate. Tie-break: shortest output.
+ *
+ * Opt-in per task via `rerank: true` in the task spec — this module
+ * never fires on its own; the caller decides which tasks are hard
+ * enough to justify the N× cost.
+ *
+ * Design notes (WOTANN quality bars):
+ * - QB #6 honest failures: generator and critic errors are captured in
+ *   `errors[]` with stage + reason, never silently dropped. If ALL
+ *   generators fail, throws `AllRolloutsFailed` with every reason.
+ * - QB #7 per-session state: each `rerank()` invocation owns its own
+ *   events, rollouts, errors — no class-level mutable state leaks
+ *   between concurrent invocations on the same instance.
+ * - Observability: events emitted via `onEvent` callback in order.
+ * - Injection pattern matches B4 verifier: critic is a `CriticJudge`
+ *   which can be built from any `LlmQuery` via `llmQueryCritic()`.
+ */
+// ── Error types ────────────────────────────────────────
+export class AllRolloutsFailed extends Error {
+    reasons;
+    constructor(reasons) {
+        super(`all rollouts failed (N=${reasons.length}): ${reasons.slice(0, 3).join("; ")}${reasons.length > 3 ? "…" : ""}`);
+        this.name = "AllRolloutsFailed";
+        this.reasons = reasons;
+    }
+}
+// ── Core class ─────────────────────────────────────────
+export class CriticRerank {
+    generator;
+    critic;
+    N;
+    perRolloutTimeoutMs;
+    onEvent;
+    constructor(config) {
+        const N = config.N ?? 5;
+        if (!Number.isInteger(N) || N < 1) {
+            throw new Error(`N must be a positive integer, got ${N}`);
+        }
+        this.generator = config.generator;
+        this.critic = config.critic;
+        this.N = N;
+        this.perRolloutTimeoutMs = config.perRolloutTimeoutMs ?? 120_000;
+        this.onEvent = config.onEvent ?? (() => { });
+    }
+    /**
+     * Run N parallel rollouts, score each, pick the winner.
+     * Throws `AllRolloutsFailed` if every generator fails.
+     */
+    async rerank(task) {
+        // Per-invocation local state — no cross-contamination between
+        // concurrent rerank() calls on the same instance. (QB #7)
+        const errors = [];
+        const generated = [];
+        const generatorErrorReasons = new Array(this.N).fill(null);
+        // 1. Dispatch N generators in parallel.
+        const genPromises = Array.from({ length: this.N }, (_, idx) => this.runGenerator(task, idx));
+        const genResults = await Promise.all(genPromises);
+        for (let i = 0; i < genResults.length; i++) {
+            const r = genResults[i];
+            if (!r)
+                continue;
+            if (r.ok) {
+                generated.push({ index: i, ...r.rollout });
+            }
+            else {
+                generatorErrorReasons[i] = r.reason;
+                errors.push({ index: i, stage: "generator", reason: r.reason });
+            }
+        }
+        // If every single generator failed, surface the union of reasons.
+        if (generated.length === 0) {
+            const reasons = [];
+            for (let i = 0; i < this.N; i++) {
+                reasons.push(generatorErrorReasons[i] ?? "unknown generator failure");
+            }
+            throw new AllRolloutsFailed(reasons);
+        }
+        // 2. Score each surviving candidate via the critic.
+        const scored = [];
+        for (const g of generated) {
+            const candidate = {
+                output: g.output,
+                metadata: g.metadata,
+            };
+            const scoreResult = await this.runCritic(task, candidate, g.index);
+            if (scoreResult.ok) {
+                scored.push({
+                    index: g.index,
+                    output: g.output,
+                    metadata: g.metadata,
+                    score: scoreResult.score.score,
+                    reasoning: scoreResult.score.reasoning,
+                });
+            }
+            else {
+                errors.push({
+                    index: g.index,
+                    stage: "critic",
+                    reason: scoreResult.reason,
+                });
+            }
+        }
+        // 3. Pick the winner.
+        if (scored.length === 0) {
+            return {
+                winner: null,
+                rollouts: [],
+                errors,
+                rationale: "no rollout received a critic score",
+            };
+        }
+        const winner = pickWinner(scored);
+        this.onEvent({
+            kind: "rerank.picked",
+            winnerIndex: winner.index,
+            score: winner.score,
+        });
+        return {
+            winner,
+            rollouts: scored,
+            errors,
+            rationale: buildRationale(winner, scored, errors),
+        };
+    }
+    // ── Internals ────────────────────────────────────────
+    async runGenerator(task, index) {
+        this.onEvent({ kind: "rollout.started", index });
+        try {
+            const rollout = await withTimeout(this.generator(task, index), this.perRolloutTimeoutMs, `rollout ${index} timeout after ${this.perRolloutTimeoutMs}ms`);
+            this.onEvent({
+                kind: "rollout.finished",
+                index,
+                output: rollout.output,
+            });
+            return { ok: true, rollout };
+        }
+        catch (err) {
+            const reason = err instanceof Error ? err.message : String(err);
+            this.onEvent({ kind: "rollout.failed", index, reason });
+            return { ok: false, reason };
+        }
+    }
+    async runCritic(task, candidate, index) {
+        try {
+            const score = await this.critic(task, candidate);
+            this.onEvent({ kind: "critic.scored", index, score: score.score });
+            return { ok: true, score };
+        }
+        catch (err) {
+            const reason = err instanceof Error ? err.message : String(err);
+            this.onEvent({ kind: "critic.failed", index, reason });
+            return { ok: false, reason };
+        }
+    }
+}
+// ── Helpers ────────────────────────────────────────────
+/**
+ * Pick by highest score; tie-break by shortest output; final tie-break
+ * by lowest original index (stable, reproducible).
+ */
+export function pickWinner(scored) {
+    const sorted = [...scored].sort((a, b) => {
+        if (a.score !== b.score)
+            return b.score - a.score;
+        if (a.output.length !== b.output.length)
+            return a.output.length - b.output.length;
+        return a.index - b.index;
+    });
+    const first = sorted[0];
+    if (!first) {
+        // Unreachable given caller checks length > 0 — defensive only.
+        throw new Error("pickWinner called with empty input");
+    }
+    return first;
+}
+function buildRationale(winner, scored, errors) {
+    const scoreList = scored
+        .map((s) => `#${s.index}=${s.score}`)
+        .sort()
+        .join(", ");
+    const tail = errors.length > 0 ? `; errors: ${errors.map((e) => `#${e.index}/${e.stage}`).join(", ")}` : "";
+    return `winner=#${winner.index} score=${winner.score} (scored: ${scoreList})${tail}`;
+}
+function withTimeout(promise, ms, message) {
+    if (!Number.isFinite(ms) || ms <= 0)
+        return promise;
+    return new Promise((resolve, reject) => {
+        const timer = setTimeout(() => reject(new Error(message)), ms);
+        promise.then((v) => {
+            clearTimeout(timer);
+            resolve(v);
+        }, (e) => {
+            clearTimeout(timer);
+            reject(e);
+        });
+    });
+}
+export { llmQueryCritic } from "../intelligence/critic-model.js";
+//# sourceMappingURL=critic-rerank.js.map

package/dist/orchestration/critic-rerank.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"critic-rerank.js","sourceRoot":"","sources":["../../src/orchestration/critic-rerank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAmEH,0DAA0D;AAE1D,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IACjC,OAAO,CAAoB;IACpC,YAAY,OAA0B;QACpC,KAAK,CACH,0BAA0B,OAAO,CAAC,MAAM,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC/G,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAED,0DAA0D;AAE1D,MAAM,OAAO,YAAY;IACN,SAAS,CAAkB;IAC3B,MAAM,CAAc;IACpB,CAAC,CAAS;IACV,mBAAmB,CAAS;IAC5B,OAAO,CAA+B;IAEvD,YAAY,MAAoB;QAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAC5B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,mBAAmB,GAAG,MAAM,CAAC,mBAAmB,IAAI,OAAO,CAAC;QACjE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM,CAAC,IAAgB;QAC3B,8DAA8D;QAC9D,0DAA0D;QAC1D,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,SAAS,GAA6C,EAAE,CAAC;QAC/D,MAAM,qBAAqB,GAAsB,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE9E,wCAAwC;QACxC,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7F,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;gBACT,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;YAC7C,CAAC;iBAAM,CAAC;gBACN,qBAAqB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;gBACpC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;QAED,kEAAkE;QAClE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,IAAI,2BAA2B,CAAC,CAAC;YACxE,CAAC;YACD,MAAM,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC;QAED,oDAAoD;QACpD,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAoB;gBACjC,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;aACrB,CAAC;YACF,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YACnE,IAAI,WAAW,CAAC,EAAE,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC;oBACV,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;oBACpB,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,KAAK;oBAC9B,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,SAAS;iBACvC,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC;oBACV,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,KAAK,EAAE,QAAQ;oBACf,MAAM,EAAE,WAAW,CAAC,MAAM;iBAC3B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,sBAAsB;QACtB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO;gBACL,MAAM,EAAE,IAAI;gBACZ,QAAQ,EAAE,EAAE;gBACZ,MAAM;gBACN,SAAS,EAAE,oCAAoC;aAChD,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,CAAC;YACX,IAAI,EAAE,eAAe;YACrB,WAAW,EAAE,MAAM,CAAC,KAAK;YACzB,KAAK,EAAE,MAAM,CAAC,KAAK;SACpB,CAAC,CAAC;QAEH,OAAO;YACL,MAAM;YACN,QAAQ,EAAE,MAAM;YAChB,MAAM;YACN,SAAS,EAAE,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;SAClD,CAAC;IACJ,CAAC;IAED,wDAAwD;IAEhD,KAAK,CAAC,YAAY,CACxB,IAAgB,EAChB,KAAa;QAKb,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,WAAW,CAC/B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,EAC3B,IAAI,CAAC,mBAAmB,EACxB,WAAW,KAAK,kBAAkB,IAAI,CAAC,mBAAmB,IAAI,CAC/D,CAAC;YACF,IAAI,CAAC,OAAO,CAAC;gBACX,IAAI,EAAE,kBAAkB;gBACxB,KAAK;gBACL,MAAM,EAAE,OAAO,CAAC,MAAM;aACvB,CAAC,CAAC;YACH,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC/B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAChE,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;YACxD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,SAAS,CACrB,IAAgB,EAChB,SAA0B,EAC1B,KAAa;QAKb,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACjD,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YACnE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QAC7B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAChE,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;YACvD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;CACF;AAED,0DAA0D;AAE1D;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,MAAgC;IACzD,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAClD,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAClF,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,+DAA+D;QAC/D,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,cAAc,CACrB,MAAqB,EACrB,MAAgC,EAChC,MAA8B;IAE9B,MAAM,SAAS,GAAG,MAAM;SACrB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;SACpC,IAAI,EAAE;SACN,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,MAAM,IAAI,GACR,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACjG,OAAO,WAAW,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,KAAK,aAAa,SAAS,IAAI,IAAI,EAAE,CAAC;AACvF,CAAC;AAED,SAAS,WAAW,CAAI,OAAmB,EAAE,EAAU,EAAE,OAAe;IACtE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;QAAE,OAAO,OAAO,CAAC;IACpD,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACxC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/D,OAAO,CAAC,IAAI,CACV,CAAC,CAAC,EAAE,EAAE;YACJ,YAAY,CAAC,KAAK,CAAC,CAAC;YACpB,OAAO,CAAC,CAAC,CAAC,CAAC;QACb,CAAC,EACD,CAAC,CAAC,EAAE,EAAE;YACJ,YAAY,CAAC,KAAK,CAAC,CAAC;YACpB,MAAM,CAAC,CAAC,CAAC,CAAC;QACZ,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAUD,OAAO,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC"}

package/dist/orchestration/dag-runner.d.ts

@@ -0,0 +1,78 @@
+/**
+ * DAG Runner — conductor-oss-style typed JSON DAG with parallel scheduling.
+ *
+ * Inspired by Netflix Conductor (https://github.com/conductor-oss/conductor)
+ * which describes workflows as JSON DAGs of tasks. Tasks have explicit
+ * dependencies (`deps: [taskId]`); the runner topologically sorts and
+ * executes independent tasks in parallel, respecting the partial order.
+ *
+ * Design:
+ *   - Pure planner (computeExecutionPlan) — given the DAG, return the topo-
+ *     ordered list of "waves" where every task in a wave can run in
+ *     parallel.
+ *   - Executor (runDag) — iterates the waves, calls a caller-supplied
+ *     `taskRunner` for each task, awaits the wave, then advances. Per-task
+ *     results are immutable and are accumulated into a frozen map.
+ *   - Cycles are rejected at planning time with a precise error pointing
+ *     at the offending task IDs.
+ *
+ * Quality bars:
+ *   - QB #6  honest stubs: missing taskRunner → echo-fixture; cycle/unknown-
+ *     dep returns {ok:false, error}; never silent success.
+ *   - QB #7  per-call state: Run state is built per `runDag` call; no globals.
+ *   - QB #13 env guard: zero env reads.
+ *   - QB #14 verification: tests cover happy path, cycle rejection, parallel
+ *     scheduling assertion, and unknown-dep rejection.
+ */
+export interface DagTask {
+    readonly id: string;
+    readonly type: string;
+    readonly deps: readonly string[];
+    readonly params?: Readonly<Record<string, unknown>>;
+}
+export interface Dag {
+    readonly tasks: readonly DagTask[];
+}
+export type TaskRunner = (input: TaskRunInput) => Promise<TaskRunOutput>;
+export interface TaskRunInput {
+    readonly task: DagTask;
+    readonly priorResults: ReadonlyMap<string, TaskRunOutput>;
+}
+export interface TaskRunOutput {
+    readonly ok: boolean;
+    readonly output: unknown;
+    readonly error?: string;
+}
+export interface ExecutionPlan {
+    readonly waves: readonly (readonly string[])[];
+}
+export type PlanResult = {
+    readonly ok: true;
+    readonly plan: ExecutionPlan;
+} | {
+    readonly ok: false;
+    readonly error: string;
+};
+export interface RunDagOptions {
+    readonly runner?: TaskRunner;
+    /** Stop after the first failure in any wave (default true). */
+    readonly stopOnFirstFailure?: boolean;
+}
+export interface DagRunResult {
+    readonly ok: boolean;
+    readonly results: ReadonlyMap<string, TaskRunOutput>;
+    readonly executedWaves: readonly (readonly string[])[];
+    readonly error?: string;
+}
+/**
+ * Compute the topologically-ordered waves for a DAG. Each wave is a list of
+ * task IDs that have all of their deps satisfied by prior waves. Pure.
+ */
+export declare function computeExecutionPlan(dag: Dag): PlanResult;
+/**
+ * Run a DAG. Topologically schedules tasks into parallel waves. Returns the
+ * per-task results. If a task fails and stopOnFirstFailure is true (default),
+ * downstream waves are skipped and remaining tasks do NOT run.
+ */
+export declare function runDag(dag: Dag, options?: RunDagOptions): Promise<DagRunResult>;
+//# sourceMappingURL=dag-runner.d.ts.map

package/dist/orchestration/dag-runner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag-runner.d.ts","sourceRoot":"","sources":["../../src/orchestration/dag-runner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAIH,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CACrD;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,KAAK,EAAE,SAAS,OAAO,EAAE,CAAC;CACpC;AAED,MAAM,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,YAAY,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC;AAEzE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;CAC3D;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC;IACrB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC;CAChD;AAED,MAAM,MAAM,UAAU,GAClB;IAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;CAAE,GACnD;IAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnD,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;IAC7B,+DAA+D;IAC/D,QAAQ,CAAC,kBAAkB,CAAC,EAAE,OAAO,CAAC;CACvC;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACrD,QAAQ,CAAC,aAAa,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC;IACvD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAID;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,GAAG,GAAG,UAAU,CAgEzD;AAED;;;;GAIG;AACH,wBAAsB,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,YAAY,CAAC,CAwCzF"}

package/dist/orchestration/dag-runner.js

@@ -0,0 +1,176 @@
+/**
+ * DAG Runner — conductor-oss-style typed JSON DAG with parallel scheduling.
+ *
+ * Inspired by Netflix Conductor (https://github.com/conductor-oss/conductor)
+ * which describes workflows as JSON DAGs of tasks. Tasks have explicit
+ * dependencies (`deps: [taskId]`); the runner topologically sorts and
+ * executes independent tasks in parallel, respecting the partial order.
+ *
+ * Design:
+ *   - Pure planner (computeExecutionPlan) — given the DAG, return the topo-
+ *     ordered list of "waves" where every task in a wave can run in
+ *     parallel.
+ *   - Executor (runDag) — iterates the waves, calls a caller-supplied
+ *     `taskRunner` for each task, awaits the wave, then advances. Per-task
+ *     results are immutable and are accumulated into a frozen map.
+ *   - Cycles are rejected at planning time with a precise error pointing
+ *     at the offending task IDs.
+ *
+ * Quality bars:
+ *   - QB #6  honest stubs: missing taskRunner → echo-fixture; cycle/unknown-
+ *     dep returns {ok:false, error}; never silent success.
+ *   - QB #7  per-call state: Run state is built per `runDag` call; no globals.
+ *   - QB #13 env guard: zero env reads.
+ *   - QB #14 verification: tests cover happy path, cycle rejection, parallel
+ *     scheduling assertion, and unknown-dep rejection.
+ */
+// ── Public API ──────────────────────────────────────────────
+/**
+ * Compute the topologically-ordered waves for a DAG. Each wave is a list of
+ * task IDs that have all of their deps satisfied by prior waves. Pure.
+ */
+export function computeExecutionPlan(dag) {
+    if (!Array.isArray(dag.tasks)) {
+        return { ok: false, error: "dag-runner: tasks must be an array" };
+    }
+    const ids = new Set();
+    for (const t of dag.tasks) {
+        if (typeof t.id !== "string" || t.id.length === 0) {
+            return { ok: false, error: "dag-runner: task.id must be a non-empty string" };
+        }
+        if (ids.has(t.id)) {
+            return { ok: false, error: `dag-runner: duplicate task id "${t.id}"` };
+        }
+        ids.add(t.id);
+    }
+    // Validate deps reference known IDs.
+    for (const t of dag.tasks) {
+        for (const d of t.deps) {
+            if (!ids.has(d)) {
+                return { ok: false, error: `dag-runner: task "${t.id}" deps unknown task "${d}"` };
+            }
+            if (d === t.id) {
+                return { ok: false, error: `dag-runner: task "${t.id}" cannot depend on itself` };
+            }
+        }
+    }
+    // Kahn's algorithm — produces topo order partitioned into waves.
+    const indegree = new Map();
+    const adj = new Map();
+    for (const t of dag.tasks) {
+        indegree.set(t.id, t.deps.length);
+        adj.set(t.id, []);
+    }
+    for (const t of dag.tasks) {
+        for (const d of t.deps) {
+            adj.get(d)?.push(t.id);
+        }
+    }
+    const waves = [];
+    let frontier = [];
+    for (const t of dag.tasks) {
+        if ((indegree.get(t.id) ?? 0) === 0)
+            frontier.push(t.id);
+    }
+    let processed = 0;
+    while (frontier.length > 0) {
+        waves.push([...frontier].sort());
+        const nextFrontier = [];
+        for (const id of frontier) {
+            processed += 1;
+            for (const child of adj.get(id) ?? []) {
+                const newDeg = (indegree.get(child) ?? 0) - 1;
+                indegree.set(child, newDeg);
+                if (newDeg === 0)
+                    nextFrontier.push(child);
+            }
+        }
+        frontier = nextFrontier;
+    }
+    if (processed !== dag.tasks.length) {
+        const remaining = dag.tasks.filter((t) => (indegree.get(t.id) ?? 0) > 0).map((t) => t.id);
+        return {
+            ok: false,
+            error: `dag-runner: cycle detected involving tasks [${remaining.join(", ")}]`,
+        };
+    }
+    return { ok: true, plan: { waves: Object.freeze(waves.map((w) => Object.freeze(w))) } };
+}
+/**
+ * Run a DAG. Topologically schedules tasks into parallel waves. Returns the
+ * per-task results. If a task fails and stopOnFirstFailure is true (default),
+ * downstream waves are skipped and remaining tasks do NOT run.
+ */
+export async function runDag(dag, options = {}) {
+    const planResult = computeExecutionPlan(dag);
+    if (!planResult.ok) {
+        return {
+            ok: false,
+            results: new Map(),
+            executedWaves: [],
+            error: planResult.error,
+        };
+    }
+    const runner = options.runner ?? echoFixtureRunner;
+    const stopOnFirstFailure = options.stopOnFirstFailure !== false;
+    const taskById = new Map();
+    for (const t of dag.tasks)
+        taskById.set(t.id, t);
+    const results = new Map();
+    const executedWaves = [];
+    let aborted = false;
+    for (const wave of planResult.plan.waves) {
+        if (aborted)
+            break;
+        const promises = wave.map((id) => runOne(id, taskById, results, runner));
+        const settled = await Promise.all(promises);
+        executedWaves.push([...wave]);
+        let waveHasFailure = false;
+        for (let i = 0; i < wave.length; i += 1) {
+            const id = wave[i];
+            const out = settled[i];
+            if (id === undefined || out === undefined)
+                continue;
+            results.set(id, out);
+            if (!out.ok)
+                waveHasFailure = true;
+        }
+        if (waveHasFailure && stopOnFirstFailure) {
+            aborted = true;
+        }
+    }
+    const allOk = !aborted && [...results.values()].every((r) => r.ok);
+    return {
+        ok: allOk,
+        results,
+        executedWaves: Object.freeze(executedWaves.map((w) => Object.freeze(w))),
+    };
+}
+// ── Internals ───────────────────────────────────────────────
+async function runOne(id, taskById, prior, runner) {
+    const task = taskById.get(id);
+    if (!task) {
+        return { ok: false, output: null, error: `dag-runner: missing task "${id}"` };
+    }
+    try {
+        return await runner({ task, priorResults: prior });
+    }
+    catch (err) {
+        const reason = err instanceof Error ? err.message : String(err);
+        return { ok: false, output: null, error: reason };
+    }
+}
+// ── Honest test fixture ─────────────────────────────────────
+async function echoFixtureRunner(input) {
+    return {
+        ok: true,
+        output: {
+            _fixture: true,
+            taskId: input.task.id,
+            type: input.task.type,
+            deps: input.task.deps,
+            priorCount: input.priorResults.size,
+        },
+    };
+}
+//# sourceMappingURL=dag-runner.js.map

package/dist/orchestration/dag-runner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag-runner.js","sourceRoot":"","sources":["../../src/orchestration/dag-runner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAiDH,+DAA+D;AAE/D;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAQ;IAC3C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,oCAAoC,EAAE,CAAC;IACpE,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,gDAAgD,EAAE,CAAC;QAChF,CAAC;QACD,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YAClB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,kCAAkC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC;QACzE,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAChB,CAAC;IACD,qCAAqC;IACrC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,qBAAqB,CAAC,CAAC,EAAE,wBAAwB,CAAC,GAAG,EAAE,CAAC;YACrF,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;gBACf,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,qBAAqB,CAAC,CAAC,EAAE,2BAA2B,EAAE,CAAC;YACpF,CAAC;QACH,CAAC;IACH,CAAC;IACD,iEAAiE;IACjE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpB,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACvB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,IAAI,QAAQ,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACjC,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,SAAS,IAAI,CAAC,CAAC;YACf,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtC,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9C,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC5B,IAAI,MAAM,KAAK,CAAC;oBAAE,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,YAAY,CAAC;IAC1B,CAAC;IACD,IAAI,SAAS,KAAK,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1F,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,+CAA+C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;SAC9E,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;AAC1F,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,GAAQ,EAAE,UAAyB,EAAE;IAChE,MAAM,UAAU,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;IAC7C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC;QACnB,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,aAAa,EAAE,EAAE;YACjB,KAAK,EAAE,UAAU,CAAC,KAAK;SACxB,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,iBAAiB,CAAC;IACnD,MAAM,kBAAkB,GAAG,OAAO,CAAC,kBAAkB,KAAK,KAAK,CAAC;IAChE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,MAAM,aAAa,GAAe,EAAE,CAAC;IACrC,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACzC,IAAI,OAAO;YAAE,MAAM;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;QACzE,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5C,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC9B,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,EAAE,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS;YACpD,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC,EAAE;gBAAE,cAAc,GAAG,IAAI,CAAC;QACrC,CAAC;QACD,IAAI,cAAc,IAAI,kBAAkB,EAAE,CAAC;YACzC,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,OAAO,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnE,OAAO;QACL,EAAE,EAAE,KAAK;QACT,OAAO;QACP,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;KACzE,CAAC;AACJ,CAAC;AAED,+DAA+D;AAE/D,KAAK,UAAU,MAAM,CACnB,EAAU,EACV,QAA8B,EAC9B,KAAiC,EACjC,MAAkB;IAElB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,6BAA6B,EAAE,GAAG,EAAE,CAAC;IAChF,CAAC;IACD,IAAI,CAAC;QACH,OAAO,MAAM,MAAM,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,CAAC;IACrD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,MAAM,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAChE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IACpD,CAAC;AACH,CAAC;AAED,+DAA+D;AAE/D,KAAK,UAAU,iBAAiB,CAAC,KAAmB;IAClD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,MAAM,EAAE;YACN,QAAQ,EAAE,IAAI;YACd,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE;YACrB,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI;YACrB,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI;YACrB,UAAU,EAAE,KAAK,CAAC,YAAY,CAAC,IAAI;SACpC;KACF,CAAC;AACJ,CAAC"}