pi-loop 0.1.0

package/dist/integrations/linear/contract.js

@@ -0,0 +1,86 @@
+const SECTION_ORDER = ["goal", "acceptance criteria", "constraints", "test plan", "stop conditions"];
+export function parseAgentContract(description) {
+    const content = description ?? "";
+    const sections = extractSections(content);
+    return {
+        goal: sections.goal.join("\n").trim(),
+        acceptanceCriteria: normalizeListItems(sections["acceptance criteria"]),
+        constraints: normalizeListItems(sections.constraints),
+        testPlan: normalizeListItems(sections["test plan"]),
+        stopConditions: normalizeListItems(sections["stop conditions"]),
+    };
+}
+export function validateAgentContract(description) {
+    const contract = parseAgentContract(description);
+    const reasons = [];
+    if (!contract.goal)
+        reasons.push("Missing Goal section");
+    if (contract.acceptanceCriteria.length === 0)
+        reasons.push("Missing Acceptance Criteria");
+    if (contract.constraints.length === 0)
+        reasons.push("Missing Constraints");
+    if (contract.testPlan.length === 0)
+        reasons.push("Missing Test Plan");
+    if (contract.stopConditions.length === 0)
+        reasons.push("Missing Stop Conditions");
+    if (contract.testPlan.length > 0) {
+        const hasCommand = contract.testPlan.some((line) => /(npm|npx|pnpm|yarn|vitest|pytest|go test|cargo test|make)/i.test(line));
+        if (!hasCommand) {
+            reasons.push("Test Plan should include runnable test commands");
+        }
+    }
+    const ambiguousTokens = ["tbd", "todo", "to be decided"];
+    const hasAmbiguousStopCondition = contract.stopConditions.some((line) => ambiguousTokens.some((token) => line.toLowerCase().includes(token)));
+    if (hasAmbiguousStopCondition) {
+        reasons.push("Stop Conditions contain ambiguous placeholder text");
+    }
+    return {
+        valid: reasons.length === 0,
+        reasons,
+        contract,
+    };
+}
+function extractSections(markdown) {
+    const sections = {
+        goal: [],
+        "acceptance criteria": [],
+        constraints: [],
+        "test plan": [],
+        "stop conditions": [],
+    };
+    let activeSection = null;
+    for (const rawLine of markdown.split("\n")) {
+        const normalizedHeading = normalizeHeading(rawLine);
+        if (isSectionHeading(normalizedHeading)) {
+            activeSection = normalizedHeading;
+            continue;
+        }
+        if (activeSection) {
+            sections[activeSection].push(rawLine);
+        }
+    }
+    return sections;
+}
+function normalizeHeading(line) {
+    return line
+        .trim()
+        .replace(/^#+\s*/, "")
+        .replace(/^\*\*(.+)\*\*:?\s*$/, "$1")
+        .replace(/:$/, "")
+        .trim()
+        .toLowerCase();
+}
+function isSectionHeading(value) {
+    return SECTION_ORDER.includes(value);
+}
+function normalizeListItems(lines) {
+    return lines
+        .map((line) => line.trim())
+        .filter(Boolean)
+        .map((line) => line
+        .replace(/^[-*]\s+/, "")
+        .replace(/^\d+\.\s+/, "")
+        .trim())
+        .filter(Boolean);
+}
+//# sourceMappingURL=contract.js.map

package/dist/integrations/linear/contract.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contract.js","sourceRoot":"","sources":["../../../src/integrations/linear/contract.ts"],"names":[],"mappings":"AAcA,MAAM,aAAa,GAAG,CAAC,MAAM,EAAE,qBAAqB,EAAE,aAAa,EAAE,WAAW,EAAE,iBAAiB,CAAU,CAAC;AAI9G,MAAM,UAAU,kBAAkB,CAAC,WAAmB;IACrD,MAAM,OAAO,GAAG,WAAW,IAAI,EAAE,CAAC;IAClC,MAAM,QAAQ,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAE1C,OAAO;QACN,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QACrC,kBAAkB,EAAE,kBAAkB,CAAC,QAAQ,CAAC,qBAAqB,CAAC,CAAC;QACvE,WAAW,EAAE,kBAAkB,CAAC,QAAQ,CAAC,WAAW,CAAC;QACrD,QAAQ,EAAE,kBAAkB,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACnD,cAAc,EAAE,kBAAkB,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC;KAC/D,CAAC;AACH,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,WAAmB;IACxD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IACjD,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IACzD,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;IAC1F,IAAI,QAAQ,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IAC3E,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACtE,IAAI,QAAQ,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IAElF,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAClD,4DAA4D,CAAC,IAAI,CAAC,IAAI,CAAC,CACvE,CAAC;QACF,IAAI,CAAC,UAAU,EAAE,CAAC;YACjB,OAAO,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;QACjE,CAAC;IACF,CAAC;IAED,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IACzD,MAAM,yBAAyB,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CACvE,eAAe,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CACnE,CAAC;IACF,IAAI,yBAAyB,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,oDAAoD,CAAC,CAAC;IACpE,CAAC;IAED,OAAO;QACN,KAAK,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC;QAC3B,OAAO;QACP,QAAQ;KACR,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,QAAgB;IACxC,MAAM,QAAQ,GAAkC;QAC/C,IAAI,EAAE,EAAE;QACR,qBAAqB,EAAE,EAAE;QACzB,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,EAAE;QACf,iBAAiB,EAAE,EAAE;KACrB,CAAC;IAEF,IAAI,aAAa,GAAuB,IAAI,CAAC;IAC7C,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,gBAAgB,CAAC,iBAAiB,CAAC,EAAE,CAAC;YACzC,aAAa,GAAG,iBAAiB,CAAC;YAClC,SAAS;QACV,CAAC;QAED,IAAI,aAAa,EAAE,CAAC;YACnB,QAAQ,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC;IACF,CAAC;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAY;IACrC,OAAO,IAAI;SACT,IAAI,EAAE;SACN,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;SACrB,OAAO,CAAC,qBAAqB,EAAE,IAAI,CAAC;SACpC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;SACjB,IAAI,EAAE;SACN,WAAW,EAAE,CAAC;AACjB,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAa;IACtC,OAAO,aAAa,CAAC,QAAQ,CAAC,KAAoB,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAe;IAC1C,OAAO,KAAK;SACV,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;SAC1B,MAAM,CAAC,OAAO,CAAC;SACf,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACb,IAAI;SACF,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;SACxB,IAAI,EAAE,CACR;SACA,MAAM,CAAC,OAAO,CAAC,CAAC;AACnB,CAAC"}

package/dist/integrations/linear/types.d.ts

@@ -0,0 +1,39 @@
+export interface LinearIssueState {
+    id: string;
+    name: string;
+    type?: string;
+}
+export interface LinearLabel {
+    id: string;
+    name: string;
+}
+export interface LinearCycleRef {
+    id: string;
+    name: string;
+}
+export interface LinearIssue {
+    id: string;
+    identifier: string;
+    title: string;
+    description: string;
+    priority: number;
+    createdAt: string;
+    updatedAt: string;
+    state: LinearIssueState;
+    labels: LinearLabel[];
+    cycle?: LinearCycleRef;
+}
+export interface LinearIssueConnection {
+    nodes: LinearIssue[];
+    pageInfo: {
+        hasNextPage: boolean;
+        endCursor?: string;
+    };
+}
+export interface LinearStateConnection {
+    nodes: LinearIssueState[];
+}
+export interface LinearLabelConnection {
+    nodes: LinearLabel[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/integrations/linear/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/integrations/linear/types.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,gBAAgB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,WAAW;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,cAAc;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,WAAW;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,gBAAgB,CAAC;IACxB,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,KAAK,CAAC,EAAE,cAAc,CAAC;CACvB;AAED,MAAM,WAAW,qBAAqB;IACrC,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,QAAQ,EAAE;QACT,WAAW,EAAE,OAAO,CAAC;QACrB,SAAS,CAAC,EAAE,MAAM,CAAC;KACnB,CAAC;CACF;AAED,MAAM,WAAW,qBAAqB;IACrC,KAAK,EAAE,gBAAgB,EAAE,CAAC;CAC1B;AAED,MAAM,WAAW,qBAAqB;IACrC,KAAK,EAAE,WAAW,EAAE,CAAC;CACrB"}

package/dist/integrations/linear/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/integrations/linear/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/integrations/linear/types.ts"],"names":[],"mappings":""}

package/dist/swarm/pool.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Concurrent worker pool management.
+ */
+import type { PiLoopConfig } from "../config/types.js";
+import type { Task } from "../core/task-state.js";
+import type { ParallelismMode } from "./scheduler.js";
+import type { WorkerDeps } from "./worker.js";
+export interface BatchResult {
+    taskId: string;
+    success: boolean;
+    commitHash?: string;
+    error?: string;
+    attempts: number;
+    changedFiles: string[];
+}
+export interface PoolConfig {
+    maxConcurrency: number;
+    mode: ParallelismMode;
+    repoRoot: string;
+    worktreeBaseDir: string;
+    piLoopConfig: PiLoopConfig;
+}
+/**
+ * Runs tasks in parallel according to mode:
+ * - sequential: run one at a time
+ * - worktree: create worktree per task, run in parallel, merge back
+ * - same-branch: run all in same dir with pull-rebase-push cycle
+ *
+ * Manages concurrency via a semaphore pattern.
+ */
+export declare function executeBatch(tasks: Task[], poolConfig: PoolConfig, workerFactory: (taskId: string, workDir: string) => WorkerDeps): Promise<BatchResult[]>;
+export declare function buildTaskBranchName(task: Task, config: PiLoopConfig): string;
+//# sourceMappingURL=pool.d.ts.map

package/dist/swarm/pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.d.ts","sourceRoot":"","sources":["../../src/swarm/pool.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAIlD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAG9C,MAAM,WAAW,WAAW;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,UAAU;IAC1B,cAAc,EAAE,MAAM,CAAC;IACvB,IAAI,EAAE,eAAe,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,YAAY,CAAC;CAC3B;AAkCD;;;;;;;GAOG;AACH,wBAAsB,YAAY,CACjC,KAAK,EAAE,IAAI,EAAE,EACb,UAAU,EAAE,UAAU,EACtB,aAAa,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,KAAK,UAAU,GAC5D,OAAO,CAAC,WAAW,EAAE,CAAC,CAWxB;AAkJD,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,GAAG,MAAM,CAY5E"}

package/dist/swarm/pool.js

@@ -0,0 +1,182 @@
+/**
+ * Concurrent worker pool management.
+ */
+import { getCurrentBranch, gitExec } from "../git/repo.js";
+import { commitAndPush, pullLatest, rebaseAndRetry } from "../git/same-branch.js";
+import { createWorktree, mergeWorktree, removeWorktree } from "../git/worktree.js";
+import { runWorker } from "./worker.js";
+/**
+ * Simple semaphore for controlling concurrency.
+ */
+class Semaphore {
+    max;
+    current = 0;
+    waiting = [];
+    constructor(max) {
+        this.max = max;
+    }
+    async acquire() {
+        if (this.current < this.max) {
+            this.current++;
+            return;
+        }
+        return new Promise((resolve) => {
+            this.waiting.push(resolve);
+        });
+    }
+    release() {
+        if (this.waiting.length > 0) {
+            const next = this.waiting.shift();
+            if (next) {
+                next();
+            }
+        }
+        else {
+            this.current--;
+        }
+    }
+}
+/**
+ * Runs tasks in parallel according to mode:
+ * - sequential: run one at a time
+ * - worktree: create worktree per task, run in parallel, merge back
+ * - same-branch: run all in same dir with pull-rebase-push cycle
+ *
+ * Manages concurrency via a semaphore pattern.
+ */
+export async function executeBatch(tasks, poolConfig, workerFactory) {
+    if (tasks.length === 0)
+        return [];
+    switch (poolConfig.mode) {
+        case "sequential":
+            return executeSequential(tasks, poolConfig, workerFactory);
+        case "worktree":
+            return executeWorktree(tasks, poolConfig, workerFactory);
+        case "same-branch":
+            return executeSameBranch(tasks, poolConfig, workerFactory);
+    }
+}
+async function executeSequential(tasks, poolConfig, workerFactory) {
+    const results = [];
+    for (const task of tasks) {
+        const deps = workerFactory(task.id, poolConfig.repoRoot);
+        const result = await runSingleWorker(task, poolConfig, deps);
+        results.push(result);
+    }
+    return results;
+}
+async function executeWorktree(tasks, poolConfig, workerFactory) {
+    const semaphore = new Semaphore(poolConfig.maxConcurrency);
+    const baseBranch = await getCurrentBranch(poolConfig.repoRoot);
+    const promises = tasks.map(async (task) => {
+        await semaphore.acquire();
+        let worktreePath;
+        const taskBranch = buildTaskBranchName(task, poolConfig.piLoopConfig);
+        try {
+            worktreePath = await createWorktree(poolConfig.repoRoot, task.id, baseBranch, poolConfig.worktreeBaseDir, taskBranch);
+            const deps = workerFactory(task.id, worktreePath);
+            const result = await runSingleWorker(task, poolConfig, deps);
+            // Merge successful work back to base branch
+            if (result.success) {
+                const mergeResult = await mergeWorktree(poolConfig.repoRoot, taskBranch, baseBranch);
+                if (!mergeResult.success) {
+                    // Abort the failed merge so the repo is clean
+                    await gitExec(["merge", "--abort"], poolConfig.repoRoot);
+                    return {
+                        ...result,
+                        success: false,
+                        error: `Merge conflict in: ${mergeResult.conflictFiles?.join(", ") ?? "unknown files"}`,
+                    };
+                }
+            }
+            return result;
+        }
+        catch (err) {
+            return {
+                taskId: task.id,
+                success: false,
+                error: err instanceof Error ? err.message : String(err),
+                attempts: 1,
+                changedFiles: [],
+            };
+        }
+        finally {
+            if (worktreePath) {
+                try {
+                    await removeWorktree(poolConfig.repoRoot, worktreePath, taskBranch);
+                }
+                catch {
+                    // Best-effort cleanup
+                }
+            }
+            semaphore.release();
+        }
+    });
+    return Promise.all(promises);
+}
+async function executeSameBranch(tasks, poolConfig, workerFactory) {
+    const semaphore = new Semaphore(poolConfig.maxConcurrency);
+    // Pull latest before starting parallel work
+    await pullLatest(poolConfig.repoRoot);
+    const promises = tasks.map(async (task) => {
+        await semaphore.acquire();
+        try {
+            const deps = workerFactory(task.id, poolConfig.repoRoot);
+            const result = await runSingleWorker(task, poolConfig, deps);
+            // Commit and push successful work
+            if (result.success) {
+                const pushResult = await commitAndPush(poolConfig.repoRoot, `task(${task.id}): ${task.title?.slice(0, 72) ?? task.id}`, poolConfig.piLoopConfig.git.commitPrefix);
+                if (!pushResult.success && pushResult.needsRebase) {
+                    const rebased = await rebaseAndRetry(poolConfig.repoRoot, 3);
+                    if (!rebased) {
+                        return {
+                            ...result,
+                            success: false,
+                            error: "Push failed after rebase retries",
+                        };
+                    }
+                }
+            }
+            return result;
+        }
+        finally {
+            semaphore.release();
+        }
+    });
+    return Promise.all(promises);
+}
+async function runSingleWorker(task, poolConfig, deps) {
+    try {
+        const result = await runWorker(task, poolConfig.piLoopConfig, deps);
+        return {
+            taskId: result.taskId,
+            success: result.success,
+            commitHash: result.commitHash,
+            error: result.rejection,
+            attempts: result.attempts,
+            changedFiles: result.changedFiles,
+        };
+    }
+    catch (err) {
+        return {
+            taskId: task.id,
+            success: false,
+            error: err instanceof Error ? err.message : String(err),
+            attempts: 1,
+            changedFiles: [],
+        };
+    }
+}
+export function buildTaskBranchName(task, config) {
+    if (config.taskBackend !== "linear") {
+        return `pi-loop/${task.id}`;
+    }
+    const slug = task.title
+        .toLowerCase()
+        .replace(/[^a-z0-9]+/g, "-")
+        .replace(/(^-|-$)/g, "")
+        .slice(0, 32);
+    const suffix = slug || "task";
+    return `pi-loop/${task.id}-${suffix}`;
+}
+//# sourceMappingURL=pool.js.map

package/dist/swarm/pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.js","sourceRoot":"","sources":["../../src/swarm/pool.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH,OAAO,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAClF,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAGnF,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAmBxC;;GAEG;AACH,MAAM,SAAS;IAIe;IAHrB,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,GAAsB,EAAE,CAAC;IAExC,YAA6B,GAAW;QAAX,QAAG,GAAH,GAAG,CAAQ;IAAG,CAAC;IAE5C,KAAK,CAAC,OAAO;QACZ,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,OAAO;QACR,CAAC;QAED,OAAO,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YACpC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,OAAO;QACN,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,IAAI,EAAE,CAAC;gBACV,IAAI,EAAE,CAAC;YACR,CAAC;QACF,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,OAAO,EAAE,CAAC;QAChB,CAAC;IACF,CAAC;CACD;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CACjC,KAAa,EACb,UAAsB,EACtB,aAA8D;IAE9D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,QAAQ,UAAU,CAAC,IAAI,EAAE,CAAC;QACzB,KAAK,YAAY;YAChB,OAAO,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;QAC5D,KAAK,UAAU;YACd,OAAO,eAAe,CAAC,KAAK,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;QAC1D,KAAK,aAAa;YACjB,OAAO,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IAC7D,CAAC;AACF,CAAC;AAED,KAAK,UAAU,iBAAiB,CAC/B,KAAa,EACb,UAAsB,EACtB,aAA8D;IAE9D,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;QAC7D,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,KAAK,UAAU,eAAe,CAC7B,KAAa,EACb,UAAsB,EACtB,aAA8D;IAE9D,MAAM,SAAS,GAAG,IAAI,SAAS,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;IAC3D,MAAM,UAAU,GAAG,MAAM,gBAAgB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAE/D,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;QACzC,MAAM,SAAS,CAAC,OAAO,EAAE,CAAC;QAC1B,IAAI,YAAgC,CAAC;QACrC,MAAM,UAAU,GAAG,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,YAAY,CAAC,CAAC;QACtE,IAAI,CAAC;YACJ,YAAY,GAAG,MAAM,cAAc,CAClC,UAAU,CAAC,QAAQ,EACnB,IAAI,CAAC,EAAE,EACP,UAAU,EACV,UAAU,CAAC,eAAe,EAC1B,UAAU,CACV,CAAC;YACF,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;YAClD,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;YAE7D,4CAA4C;YAC5C,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpB,MAAM,WAAW,GAAG,MAAM,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;gBACrF,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;oBAC1B,8CAA8C;oBAC9C,MAAM,OAAO,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;oBACzD,OAAO;wBACN,GAAG,MAAM;wBACT,OAAO,EAAE,KAAK;wBACd,KAAK,EAAE,sBAAsB,WAAW,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,eAAe,EAAE;qBACvF,CAAC;gBACH,CAAC;YACF,CAAC;YAED,OAAO,MAAM,CAAC;QACf,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACd,OAAO;gBACN,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;gBACvD,QAAQ,EAAE,CAAC;gBACX,YAAY,EAAE,EAAE;aAChB,CAAC;QACH,CAAC;gBAAS,CAAC;YACV,IAAI,YAAY,EAAE,CAAC;gBAClB,IAAI,CAAC;oBACJ,MAAM,cAAc,CAAC,UAAU,CAAC,QAAQ,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;gBACrE,CAAC;gBAAC,MAAM,CAAC;oBACR,sBAAsB;gBACvB,CAAC;YACF,CAAC;YACD,SAAS,CAAC,OAAO,EAAE,CAAC;QACrB,CAAC;IACF,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED,KAAK,UAAU,iBAAiB,CAC/B,KAAa,EACb,UAAsB,EACtB,aAA8D;IAE9D,MAAM,SAAS,GAAG,IAAI,SAAS,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;IAE3D,4CAA4C;IAC5C,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAEtC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;QACzC,MAAM,SAAS,CAAC,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC;YACJ,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzD,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;YAE7D,kCAAkC;YAClC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpB,MAAM,UAAU,GAAG,MAAM,aAAa,CACrC,UAAU,CAAC,QAAQ,EACnB,QAAQ,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,EAC1D,UAAU,CAAC,YAAY,CAAC,GAAG,CAAC,YAAY,CACxC,CAAC;gBAEF,IAAI,CAAC,UAAU,CAAC,OAAO,IAAI,UAAU,CAAC,WAAW,EAAE,CAAC;oBACnD,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;oBAC7D,IAAI,CAAC,OAAO,EAAE,CAAC;wBACd,OAAO;4BACN,GAAG,MAAM;4BACT,OAAO,EAAE,KAAK;4BACd,KAAK,EAAE,kCAAkC;yBACzC,CAAC;oBACH,CAAC;gBACF,CAAC;YACF,CAAC;YAED,OAAO,MAAM,CAAC;QACf,CAAC;gBAAS,CAAC;YACV,SAAS,CAAC,OAAO,EAAE,CAAC;QACrB,CAAC;IACF,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED,KAAK,UAAU,eAAe,CAAC,IAAU,EAAE,UAAsB,EAAE,IAAgB;IAClF,IAAI,CAAC;QACJ,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACpE,OAAO;YACN,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,KAAK,EAAE,MAAM,CAAC,SAAS;YACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,YAAY,EAAE,MAAM,CAAC,YAAY;SACjC,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACd,OAAO;YACN,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;YACvD,QAAQ,EAAE,CAAC;YACX,YAAY,EAAE,EAAE;SAChB,CAAC;IACH,CAAC;AACF,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAU,EAAE,MAAoB;IACnE,IAAI,MAAM,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;QACrC,OAAO,WAAW,IAAI,CAAC,EAAE,EAAE,CAAC;IAC7B,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK;SACrB,WAAW,EAAE;SACb,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;SAC3B,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACf,MAAM,MAAM,GAAG,IAAI,IAAI,MAAM,CAAC;IAC9B,OAAO,WAAW,IAAI,CAAC,EAAE,IAAI,MAAM,EAAE,CAAC;AACvC,CAAC"}

package/dist/swarm/scheduler.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Dependency graph construction and batch dispatch scheduling.
+ */
+import type { Task } from "../core/task-state.js";
+export interface DependencyGraph {
+    nodes: Map<string, Task>;
+    edges: Map<string, Set<string>>;
+}
+export type ParallelismMode = "sequential" | "worktree" | "same-branch";
+/**
+ * Creates a DAG from task dependencies.
+ * Throws if circular dependencies are detected.
+ */
+export declare function buildDependencyGraph(tasks: Task[]): DependencyGraph;
+/**
+ * Returns tasks whose dependencies are ALL in completedIds AND whose status is "pending".
+ */
+export declare function getReadyBatch(graph: DependencyGraph, completedIds: Set<string>): Task[];
+/**
+ * Groups tasks into batches where tasks in the same batch are unlikely
+ * to touch the same files. Uses keyword extraction from task titles to estimate overlap.
+ * Tasks sharing >50% keywords go in different batches.
+ *
+ * When fileHints is provided (from previous commit history), uses actual file paths
+ * instead of keyword heuristics for more accurate grouping.
+ */
+export declare function groupNonOverlapping(tasks: Task[], fileHints?: Map<string, string[]>): Task[][];
+/**
+ * Selects parallelism mode based on concurrency level.
+ * 1=sequential, 2-8=worktree, 9+=same-branch
+ */
+export declare function selectParallelismMode(concurrency: number): ParallelismMode;
+/**
+ * Detects circular dependencies using DFS.
+ * Returns the cycle path if found, null if no cycles exist.
+ */
+export declare function detectCircularDeps(graph: DependencyGraph): string[] | null;
+//# sourceMappingURL=scheduler.d.ts.map

package/dist/swarm/scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../../src/swarm/scheduler.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAElD,MAAM,WAAW,eAAe;IAC/B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACzB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;CAChC;AAED,MAAM,MAAM,eAAe,GAAG,YAAY,GAAG,UAAU,GAAG,aAAa,CAAC;AAExE;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,eAAe,CAiBnE;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC5B,KAAK,EAAE,eAAe,EACtB,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,GACvB,IAAI,EAAE,CA0BR;AAuCD;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAClC,KAAK,EAAE,IAAI,EAAE,EACb,SAAS,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAC/B,IAAI,EAAE,EAAE,CA+CV;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,MAAM,GAAG,eAAe,CAI1E;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE,GAAG,IAAI,CAiB1E"}

package/dist/swarm/scheduler.js

@@ -0,0 +1,191 @@
+/**
+ * Dependency graph construction and batch dispatch scheduling.
+ */
+/**
+ * Creates a DAG from task dependencies.
+ * Throws if circular dependencies are detected.
+ */
+export function buildDependencyGraph(tasks) {
+    const nodes = new Map();
+    const edges = new Map();
+    for (const task of tasks) {
+        nodes.set(task.id, task);
+        edges.set(task.id, new Set(task.dependencies));
+    }
+    const graph = { nodes, edges };
+    const cycle = detectCircularDeps(graph);
+    if (cycle) {
+        throw new Error(`Circular dependency detected: ${cycle.join(" \u2192 ")}`);
+    }
+    return graph;
+}
+/**
+ * Returns tasks whose dependencies are ALL in completedIds AND whose status is "pending".
+ */
+export function getReadyBatch(graph, completedIds) {
+    const ready = [];
+    for (const [taskId, node] of graph.nodes) {
+        if (node.status !== "pending")
+            continue;
+        const deps = graph.edges.get(taskId);
+        if (!deps || deps.size === 0) {
+            ready.push(node);
+            continue;
+        }
+        let allDepsComplete = true;
+        for (const depId of deps) {
+            if (!completedIds.has(depId)) {
+                allDepsComplete = false;
+                break;
+            }
+        }
+        if (allDepsComplete) {
+            ready.push(node);
+        }
+    }
+    return ready;
+}
+/**
+ * Extracts keywords from a task title for overlap estimation.
+ */
+function extractKeywords(title) {
+    const stopWords = new Set([
+        "a", "an", "the", "and", "or", "but", "in", "on", "at", "to",
+        "for", "of", "with", "by", "from", "as", "is", "was", "are",
+        "be", "been", "being", "have", "has", "had", "do", "does",
+        "did", "will", "would", "could", "should", "may", "might",
+        "shall", "can", "need", "must", "it", "its", "this", "that",
+    ]);
+    return new Set(title
+        .toLowerCase()
+        .replace(/[^a-z0-9\s]/g, " ")
+        .split(/\s+/)
+        .filter((word) => word.length > 1 && !stopWords.has(word)));
+}
+/**
+ * Computes keyword overlap ratio between two sets.
+ * Returns a value between 0 and 1.
+ */
+function keywordOverlap(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let shared = 0;
+    for (const word of a) {
+        if (b.has(word))
+            shared++;
+    }
+    const minSize = Math.min(a.size, b.size);
+    return minSize === 0 ? 0 : shared / minSize;
+}
+/**
+ * Groups tasks into batches where tasks in the same batch are unlikely
+ * to touch the same files. Uses keyword extraction from task titles to estimate overlap.
+ * Tasks sharing >50% keywords go in different batches.
+ *
+ * When fileHints is provided (from previous commit history), uses actual file paths
+ * instead of keyword heuristics for more accurate grouping.
+ */
+export function groupNonOverlapping(tasks, fileHints) {
+    if (tasks.length === 0)
+        return [];
+    if (tasks.length === 1)
+        return [[tasks[0]]];
+    const OVERLAP_THRESHOLD = 0.5;
+    const batches = [];
+    // Build overlap data: either from file hints or keyword extraction
+    const overlapData = new Map();
+    for (const task of tasks) {
+        const hints = fileHints?.get(task.id);
+        if (hints && hints.length > 0) {
+            overlapData.set(task.id, new Set(hints));
+        }
+        else {
+            overlapData.set(task.id, extractKeywords(task.title));
+        }
+    }
+    for (const task of tasks) {
+        const taskData = overlapData.get(task.id);
+        let placed = false;
+        for (const batch of batches) {
+            let overlaps = false;
+            for (const existing of batch) {
+                const existingData = overlapData.get(existing.id);
+                if (keywordOverlap(taskData, existingData) > OVERLAP_THRESHOLD) {
+                    overlaps = true;
+                    break;
+                }
+            }
+            if (!overlaps) {
+                batch.push(task);
+                placed = true;
+                break;
+            }
+        }
+        if (!placed) {
+            batches.push([task]);
+        }
+    }
+    return batches;
+}
+/**
+ * Selects parallelism mode based on concurrency level.
+ * 1=sequential, 2-8=worktree, 9+=same-branch
+ */
+export function selectParallelismMode(concurrency) {
+    if (concurrency <= 1)
+        return "sequential";
+    if (concurrency <= 8)
+        return "worktree";
+    return "same-branch";
+}
+/**
+ * Detects circular dependencies using DFS.
+ * Returns the cycle path if found, null if no cycles exist.
+ */
+export function detectCircularDeps(graph) {
+    // Color states: 0=unvisited, 1=in current path, 2=fully processed
+    const color = new Map();
+    const parent = new Map();
+    for (const nodeId of graph.nodes.keys()) {
+        color.set(nodeId, 0);
+    }
+    for (const nodeId of graph.nodes.keys()) {
+        if (color.get(nodeId) === 0) {
+            const cycle = dfsVisit(nodeId, graph, color, parent);
+            if (cycle)
+                return cycle;
+        }
+    }
+    return null;
+}
+function dfsVisit(nodeId, graph, color, parent) {
+    // 0=unvisited, 1=in path, 2=done
+    color.set(nodeId, 1);
+    const deps = graph.edges.get(nodeId);
+    if (deps) {
+        for (const depId of deps) {
+            if (!graph.nodes.has(depId))
+                continue;
+            if (color.get(depId) === 1) {
+                // Found a cycle -- reconstruct the path
+                const cycle = [depId, nodeId];
+                let current = nodeId;
+                while (parent.has(current) && parent.get(current) !== depId) {
+                    current = parent.get(current);
+                    cycle.push(current);
+                }
+                cycle.push(depId);
+                return cycle.reverse();
+            }
+            if (color.get(depId) === 0) {
+                parent.set(depId, nodeId);
+                const cycle = dfsVisit(depId, graph, color, parent);
+                if (cycle)
+                    return cycle;
+            }
+        }
+    }
+    color.set(nodeId, 2);
+    return null;
+}
+//# sourceMappingURL=scheduler.js.map

package/dist/swarm/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../../src/swarm/scheduler.ts"],"names":[],"mappings":"AAAA;;GAEG;AAWH;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAa;IACjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,MAAM,KAAK,GAAoB,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAEhD,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACxC,IAAI,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,iCAAiC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IAC5E,CAAC;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAC5B,KAAsB,EACtB,YAAyB;IAEzB,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QAExC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,SAAS;QACV,CAAC;QAED,IAAI,eAAe,GAAG,IAAI,CAAC;QAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,eAAe,GAAG,KAAK,CAAC;gBACxB,MAAM;YACP,CAAC;QACF,CAAC;QAED,IAAI,eAAe,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;IACF,CAAC;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,KAAa;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;QACzB,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;QAC5D,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK;QAC3D,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM;QACzD,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO;QACzD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;KAC3D,CAAC,CAAC;IAEH,OAAO,IAAI,GAAG,CACb,KAAK;SACH,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAC3D,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,CAAc,EAAE,CAAc;IACrD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,EAAE,CAAC;IAC3B,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC;AAC7C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAClC,KAAa,EACb,SAAiC;IAEjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5C,MAAM,iBAAiB,GAAG,GAAG,CAAC;IAC9B,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,mEAAmE;IACnE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEnD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACP,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACvD,CAAC;IACF,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC;QAC3C,IAAI,MAAM,GAAG,KAAK,CAAC;QAEnB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,QAAQ,GAAG,KAAK,CAAC;YAErB,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;gBAC9B,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAE,CAAC;gBACnD,IAAI,cAAc,CAAC,QAAQ,EAAE,YAAY,CAAC,GAAG,iBAAiB,EAAE,CAAC;oBAChE,QAAQ,GAAG,IAAI,CAAC;oBAChB,MAAM;gBACP,CAAC;YACF,CAAC;YAED,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,MAAM,GAAG,IAAI,CAAC;gBACd,MAAM;YACP,CAAC;QACF,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtB,CAAC;IACF,CAAC;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,WAAmB;IACxD,IAAI,WAAW,IAAI,CAAC;QAAE,OAAO,YAAY,CAAC;IAC1C,IAAI,WAAW,IAAI,CAAC;QAAE,OAAO,UAAU,CAAC;IACxC,OAAO,aAAa,CAAC;AACtB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAsB;IACxD,kEAAkE;IAClE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACzC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACzC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;YACrD,IAAI,KAAK;gBAAE,OAAO,KAAK,CAAC;QACzB,CAAC;IACF,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAChB,MAAc,EACd,KAAsB,EACtB,KAA0B,EAC1B,MAA2B;IAE3B,iCAAiC;IACjC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAErB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,IAAI,EAAE,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAEtC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,wCAAwC;gBACxC,MAAM,KAAK,GAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACxC,IAAI,OAAO,GAAG,MAAM,CAAC;gBACrB,OAAO,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,EAAE,CAAC;oBAC7D,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;oBAC/B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAClB,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YAED,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBACpD,IAAI,KAAK;oBAAE,OAAO,KAAK,CAAC;YACzB,CAAC;QACF,CAAC;IACF,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC;AACb,CAAC"}