@wrongstack/sdd 0.284.1 → 0.285.0

package/dist/auto-executor.d.ts

@@ -0,0 +1,89 @@
+import type { TaskGraph, TaskNode } from '@wrongstack/core/types';
+import type { Specification } from '@wrongstack/core/types';
+import type { EventBus } from '@wrongstack/core/kernel';
+import type { TaskTracker } from '@wrongstack/core/tasking';
+export interface AutoExecutorOptions {
+    tracker: TaskTracker;
+    events: EventBus;
+    /** Maximum concurrent tasks. Defaults to 1 (sequential). */
+    maxConcurrent?: number | undefined;
+    /** Maximum retry attempts for failed tasks. */
+    maxRetries?: number | undefined;
+    /** Custom task executor function. */
+    executeTask: (task: TaskNode, context: TaskExecutionContext) => Promise<TaskExecutionResult>;
+    /** Called before each task starts. */
+    onTaskStart?: (((task: TaskNode) => void)) | undefined;
+    /** Called after each task completes. */
+    onTaskComplete?: (task: TaskNode, result: TaskExecutionResult) => void;
+    /** Called when a task fails. */
+    onTaskFail?: (task: TaskNode, error: Error, retryCount: number) => void;
+    /** Called when all tasks are done or no more can execute. */
+    onDone?: (((summary: ExecutionSummary) => void)) | undefined;
+}
+export interface TaskExecutionContext {
+    /** The spec being implemented. */
+    spec: Specification;
+    /** The full task graph. */
+    graph: TaskGraph;
+    /** The current task being executed. */
+    task: TaskNode;
+    /** Tasks that this task depends on. */
+    dependencies: TaskNode[];
+    /** Tasks that depend on this task. */
+    dependents: TaskNode[];
+    /** Retry count for this task (0 = first attempt). */
+    retryCount: number;
+}
+export interface TaskExecutionResult {
+    success: boolean;
+    output?: string | undefined;
+    error?: string | undefined;
+    /** If true, the task will be retried. */
+    retry?: boolean | undefined;
+}
+export interface ExecutionSummary {
+    total: number;
+    completed: number;
+    failed: number;
+    skipped: number;
+    retried: number;
+    duration: number;
+    criticalPath: string[];
+}
+/**
+ * Auto-executor that drives task execution with dependency resolution,
+ * retry logic, and critical path awareness.
+ */
+export declare class AutoExecutor {
+    private readonly opts;
+    private stopped;
+    private retryMap;
+    constructor(opts: AutoExecutorOptions);
+    /**
+     * Execute all tasks in the graph, respecting dependencies.
+     */
+    execute(graph: TaskGraph, spec: Specification): Promise<ExecutionSummary>;
+    /** Stop execution. */
+    stop(): void;
+    /** Get tasks that are ready to execute (all dependencies completed). */
+    private getReadyTasks;
+    /** Execute a single task with retry logic. */
+    private executeTaskWithRetry;
+    /** Get tasks that this task depends on. */
+    private getTaskDependencies;
+    /** Get tasks that depend on this task. */
+    private getTaskDependents;
+    /** Detect deadlock: all remaining tasks are blocked by failed tasks. */
+    private detectDeadlock;
+}
+/**
+ * Create an auto-executor that works with TaskFlow.
+ */
+export declare function createAutoExecutor(opts: {
+    tracker: TaskTracker;
+    events: EventBus;
+    executeTask: AutoExecutorOptions['executeTask'];
+    maxConcurrent?: number | undefined;
+    maxRetries?: number | undefined;
+}): AutoExecutor;
+//# sourceMappingURL=auto-executor.d.ts.map

package/dist/auto-executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"auto-executor.d.ts","sourceRoot":"","sources":["../src/auto-executor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAC5D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAG5D,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,WAAW,CAAC;IACrB,MAAM,EAAE,QAAQ,CAAC;IACjB,4DAA4D;IAC5D,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,+CAA+C;IAC/C,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAChC,qCAAqC;IACrC,WAAW,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,oBAAoB,KAAK,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAC7F,sCAAsC;IACtC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;IACvD,wCAAwC;IACxC,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,mBAAmB,KAAK,IAAI,CAAC;IACvE,gCAAgC;IAChC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,KAAK,IAAI,CAAC;IACxE,6DAA6D;IAC7D,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,gBAAgB,KAAK,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;CAC9D;AAED,MAAM,WAAW,oBAAoB;IACnC,kCAAkC;IAClC,IAAI,EAAE,aAAa,CAAC;IACpB,2BAA2B;IAC3B,KAAK,EAAE,SAAS,CAAC;IACjB,uCAAuC;IACvC,IAAI,EAAE,QAAQ,CAAC;IACf,uCAAuC;IACvC,YAAY,EAAE,QAAQ,EAAE,CAAC;IACzB,sCAAsC;IACtC,UAAU,EAAE,QAAQ,EAAE,CAAC;IACvB,qDAAqD;IACrD,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5B,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,yCAAyC;IACzC,KAAK,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CAC7B;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED;;;GAGG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAsB;IAC3C,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,QAAQ,CAA6B;IAE7C,YAAY,IAAI,EAAE,mBAAmB,EAEpC;IAED;;OAEG;IACG,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC,gBAAgB,CAAC,CA2E9E;IAED,sBAAsB;IACtB,IAAI,IAAI,IAAI,CAEX;IAED,wEAAwE;IACxE,OAAO,CAAC,aAAa;IAyBrB,8CAA8C;YAChC,oBAAoB;IA+DlC,2CAA2C;IAC3C,OAAO,CAAC,mBAAmB;IAO3B,0CAA0C;IAC1C,OAAO,CAAC,iBAAiB;IAOzB,wEAAwE;IACxE,OAAO,CAAC,cAAc;CAgBvB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE;IACvC,OAAO,EAAE,WAAW,CAAC;IACrB,MAAM,EAAE,QAAQ,CAAC;IACjB,WAAW,EAAE,mBAAmB,CAAC,aAAa,CAAC,CAAC;IAChD,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACjC,GAAG,YAAY,CAQf"}

package/dist/board-types.d.ts

@@ -0,0 +1,144 @@
+/**
+ * SDD live board model.
+ *
+ * A board snapshot is the canonical, surface-agnostic projection of a running
+ * (or persisted) SDD TaskGraph: tasks laid into topological dependency columns,
+ * each carrying its short id, status, blockers and the agent currently on it.
+ * The projector (sdd-board-projector.ts) emits these over the EventBus and
+ * persists them (sdd-board-store.ts); every surface (WebUI/TUI) renders the
+ * same shape.
+ */
+import type { TaskGraph, TaskNode, TaskProgress } from '@wrongstack/core/types';
+export type SddBoardStatus = 'idle' | 'running' | 'paused' | 'stopped' | 'completed' | 'failed' | 'deadlocked';
+/**
+ * FORGE-style display status: `queued` = pending with all blockers done;
+ * `cancelled` = a task the user stopped (stored as a terminal `failed` node
+ * carrying `metadata.cancelled`, surfaced distinctly so it doesn't read as an
+ * error). Display-only — not a core `TaskStatus`.
+ */
+export type SddTaskDisplayStatus = TaskNode['status'] | 'queued' | 'cancelled';
+export interface SddBoardTask {
+    id: string;
+    /** Stable short id (t01, t02, …) in creation order. */
+    shortId: string;
+    title: string;
+    description: string;
+    status: TaskNode['status'];
+    displayStatus: SddTaskDisplayStatus;
+    priority: TaskNode['priority'];
+    type: TaskNode['type'];
+    /** Short ids of the tasks that block this one (depends_on edges). */
+    deps: string[];
+    /** Worker on the task right now (scientist nickname), if any. */
+    agentName?: string | undefined;
+    /** Git worktree branch this task runs in, when isolated. */
+    worktreeBranch?: string | undefined;
+    startedAt?: number | undefined;
+    completedAt?: number | undefined;
+    retries: number;
+    /** Per-task model assignment (overrides the run default), if set. */
+    model?: string | undefined;
+    /** Per-task provider assignment (overrides the run default), if set. */
+    provider?: string | undefined;
+    /** Per-task fallback model chain (overrides the run default), if set. */
+    fallbackModels?: string[] | undefined;
+    /** Per-task completion-gate verification command, if set. */
+    verificationCommand?: string | undefined;
+}
+/** A topological column: tasks whose deepest dependency chain is `depth`. */
+export interface SddBoardColumn {
+    label: string;
+    /** Short ids of the tasks in this column (join against `tasks`). */
+    taskIds: string[];
+}
+export interface SddDeadlockChain {
+    /** Short id of the blocked task. */
+    blocked: string;
+    /** Short ids of the failed/incomplete blockers holding it. */
+    blockedBy: string[];
+}
+/** One entry in the live activity feed (the board's "what just happened" ticker). */
+export interface SddBoardFeedEntry {
+    ts: number;
+    kind: 'started' | 'completed' | 'failed' | 'retrying' | 'wave' | 'deadlock' | 'verification_failed' | 'conflict' | 'split' | 'supervisor';
+    /** Short id of the task this entry concerns, when applicable. */
+    taskShortId?: string | undefined;
+    /** Worker involved, when applicable. */
+    agentName?: string | undefined;
+    /** Human-readable one-line summary. */
+    text: string;
+}
+export interface SddBoardSnapshot {
+    runId: string;
+    specId?: string | undefined;
+    graphId: string;
+    title: string;
+    status: SddBoardStatus;
+    startedAt: number;
+    updatedAt: number;
+    progress: TaskProgress;
+    /** Current wave index (0-based) of the parallel run. */
+    wave: number;
+    tasks: SddBoardTask[];
+    columns: SddBoardColumn[];
+    diagnostics?: {
+        deadlockChains?: SddDeadlockChain[];
+    } | undefined;
+    /** Live activity feed — most recent first (capped). */
+    feed?: SddBoardFeedEntry[] | undefined;
+    /** Run-level default worker model (task overrides take precedence). */
+    defaultModel?: string | undefined;
+    /** Run-level default worker provider. */
+    defaultProvider?: string | undefined;
+    /** Run-level default fallback model chain. */
+    fallbackModels?: string[] | undefined;
+    /** Base branch the run's squash commits land on (worktree runs only). */
+    baseBranch?: string | undefined;
+    /**
+     * Squash commits the run landed on the base branch, in landing order. Lets a
+     * post-run `/sdd rollback` revert them from disk after the live run is gone.
+     */
+    mergedCommits?: Array<{
+        taskId: string;
+        sha: string;
+        title: string;
+    }> | undefined;
+}
+/**
+ * Lay a TaskGraph's nodes into topological dependency columns with stable short
+ * ids and per-task blocker refs. Shared by the projector (live) and any static
+ * board browser. Pure; no run state — `agentName`/`worktreeBranch`/`retries`
+ * are read from the node's `assignee`/`metadata` so a reload reflects the last
+ * persisted run.
+ */
+/**
+ * Stable short-id map (t01, t02, …) for a graph's nodes in creation order.
+ * Shared by the board renderer and the projector (deadlock-chain labelling).
+ */
+export declare function shortIdMap(graph: TaskGraph): Map<string, string>;
+export declare function buildBoardTasks(graph: TaskGraph): {
+    tasks: SddBoardTask[];
+    columns: SddBoardColumn[];
+};
+/**
+ * Build a full board snapshot from a graph + run state. The projector calls
+ * this on every (throttled) change.
+ */
+export declare function buildBoardSnapshot(graph: TaskGraph, run: {
+    runId: string;
+    specId?: string | undefined;
+    status: SddBoardStatus;
+    startedAt: number;
+    wave: number;
+    deadlockChains?: SddDeadlockChain[] | undefined;
+    defaultModel?: string | undefined;
+    defaultProvider?: string | undefined;
+    fallbackModels?: string[] | undefined;
+    baseBranch?: string | undefined;
+    mergedCommits?: Array<{
+        taskId: string;
+        sha: string;
+        title: string;
+    }> | undefined;
+}, now: number): SddBoardSnapshot;
+//# sourceMappingURL=board-types.d.ts.map

package/dist/board-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"board-types.d.ts","sourceRoot":"","sources":["../src/board-types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAGhF,MAAM,MAAM,cAAc,GACtB,MAAM,GACN,SAAS,GACT,QAAQ,GACR,SAAS,GACT,WAAW,GACX,QAAQ,GACR,YAAY,CAAC;AAEjB;;;;;GAKG;AACH,MAAM,MAAM,oBAAoB,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,QAAQ,GAAG,WAAW,CAAC;AAE/E,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,uDAAuD;IACvD,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC3B,aAAa,EAAE,oBAAoB,CAAC;IACpC,QAAQ,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;IAC/B,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IACvB,qEAAqE;IACrE,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,iEAAiE;IACjE,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,4DAA4D;IAC5D,cAAc,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACpC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACjC,OAAO,EAAE,MAAM,CAAC;IAChB,qEAAqE;IACrE,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,wEAAwE;IACxE,QAAQ,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC9B,yEAAyE;IACzE,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IACtC,6DAA6D;IAC7D,mBAAmB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC1C;AAED,6EAA6E;AAC7E,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,oEAAoE;IACpE,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,MAAM,WAAW,gBAAgB;IAC/B,oCAAoC;IACpC,OAAO,EAAE,MAAM,CAAC;IAChB,8DAA8D;IAC9D,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,qFAAqF;AACrF,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EACA,SAAS,GACT,WAAW,GACX,QAAQ,GACR,UAAU,GACV,MAAM,GACN,UAAU,GACV,qBAAqB,GACrB,UAAU,GACV,OAAO,GACP,YAAY,CAAC;IACjB,iEAAiE;IACjE,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACjC,wCAAwC;IACxC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,uCAAuC;IACvC,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,cAAc,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,YAAY,CAAC;IACvB,wDAAwD;IACxD,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,OAAO,EAAE,cAAc,EAAE,CAAC;IAC1B,WAAW,CAAC,EAAE;QAAE,cAAc,CAAC,EAAE,gBAAgB,EAAE,CAAA;KAAE,GAAG,SAAS,CAAC;IAClE,uDAAuD;IACvD,IAAI,CAAC,EAAE,iBAAiB,EAAE,GAAG,SAAS,CAAC;IACvC,uEAAuE;IACvE,YAAY,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAClC,yCAAyC;IACzC,eAAe,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACrC,8CAA8C;IAC9C,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IACtC,yEAAyE;IACzE,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAChC;;;OAGG;IACH,aAAa,CAAC,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,SAAS,CAAC;CACnF;AAED;;;;;;GAMG;AACH;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAOhE;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,GAAG;IACjD,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,OAAO,EAAE,cAAc,EAAE,CAAC;CAC3B,CAwEA;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,SAAS,EAChB,GAAG,EAAE;IACH,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5B,MAAM,EAAE,cAAc,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,CAAC,EAAE,gBAAgB,EAAE,GAAG,SAAS,CAAC;IAChD,YAAY,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAClC,eAAe,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACrC,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IACtC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAChC,aAAa,CAAC,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,SAAS,CAAC;CACnF,EACD,GAAG,EAAE,MAAM,GACV,gBAAgB,CAqBlB"}

package/dist/conflict-resolver.d.ts

@@ -0,0 +1,45 @@
+import type { TaskNode } from '@wrongstack/core/types';
+export type ConflictSide = 'incoming' | 'base';
+/**
+ * Resolve every standard git conflict hunk in `text` by keeping `side`. Handles
+ * both 2-way (`<<<<<<< / ======= / >>>>>>>`) and diff3 (`||||||| base`) markers.
+ * Returns the rewritten text (markers removed).
+ */
+export declare function resolveConflictText(text: string, side: ConflictSide): string;
+/** True when `text` still contains a git conflict marker line. */
+export declare function hasConflictMarkers(text: string): boolean;
+/**
+ * Build a `conflictResolver` that keeps `side` of every hunk in each conflicted
+ * file. Returns false (abort → conservative fail) if any file can't be read,
+ * written, or still has markers after the rewrite.
+ */
+export declare function makePreferSideConflictResolver(side: ConflictSide): (info: {
+    task: TaskNode;
+    conflictFiles: string[];
+    cwd: string;
+}) => Promise<boolean>;
+export interface LlmConflictResolverOptions {
+    /** Runs one self-contained, isolated LLM turn and resolves its final text. */
+    run: (prompt: string) => Promise<string>;
+    /**
+     * Reject a resolution that shrinks the file below this fraction of its original
+     * non-marker line count — a crude guard against the model dropping content.
+     * Default 0.5.
+     */
+    minRetainedFraction?: number;
+}
+/**
+ * Build an LLM-backed `conflictResolver`: for each conflicted file it asks the
+ * model (via one isolated `run` turn) to produce the fully resolved file and
+ * writes it back. Heavily guarded — returns false (→ conservative abort/retry)
+ * if the model leaves a marker, returns junk, or drops too much content. The
+ * WorktreeManager STILL rejects any surviving marker, and (when a `verifyTask`
+ * is configured) the run re-verifies the integrated base and reverts a
+ * regression — so a bad LLM merge can never silently stick. OFF by default.
+ */
+export declare function makeLlmConflictResolver(opts: LlmConflictResolverOptions): (info: {
+    task: TaskNode;
+    conflictFiles: string[];
+    cwd: string;
+}) => Promise<boolean>;
+//# sourceMappingURL=conflict-resolver.d.ts.map

package/dist/conflict-resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict-resolver.d.ts","sourceRoot":"","sources":["../src/conflict-resolver.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAMvD,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,MAAM,CAAC;AAO/C;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM,CA4B5E;AAED,kEAAkE;AAClE,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAKxD;AAED;;;;GAIG;AACH,wBAAgB,8BAA8B,CAAC,IAAI,EAAE,YAAY,UAClB;IAC3C,IAAI,EAAE,QAAQ,CAAC;IACf,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,GAAG,EAAE,MAAM,CAAC;CACb,KAAG,OAAO,CAAC,OAAO,CAAC,CAoBrB;AAED,MAAM,WAAW,0BAA0B;IACzC,8EAA8E;IAC9E,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IACzC;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAgBD;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,0BAA0B,UAGzB;IAC3C,IAAI,EAAE,QAAQ,CAAC;IACf,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,GAAG,EAAE,MAAM,CAAC;CACb,KAAG,OAAO,CAAC,OAAO,CAAC,CAyCrB"}

package/dist/critical-path.d.ts

@@ -0,0 +1,36 @@
+import type { TaskGraph } from '@wrongstack/core/types';
+/**
+ * Enhanced critical path analysis with bottleneck detection,
+ * parallel execution groups, and time estimation.
+ */
+export interface CriticalPathAnalysis {
+    /** Ordered list of critical path task IDs. */
+    criticalPath: string[];
+    /** Total estimated hours for the critical path. */
+    totalHours: number;
+    /** Tasks that block the most downstream work. */
+    bottlenecks: BottleneckTask[];
+    /** Groups of tasks that can run in parallel. */
+    parallelGroups: string[][];
+    /** Recommended execution order respecting dependencies. */
+    executionOrder: string[];
+    /** Tasks with no blockers (can start immediately). */
+    readyTasks: string[];
+    /** Tasks that are blocked and cannot start. */
+    blockedTasks: string[];
+}
+export interface BottleneckTask {
+    taskId: string;
+    title: string;
+    /** Number of tasks directly or transitively blocked by this task. */
+    blockedCount: number;
+    /** Total estimated hours of blocked downstream work. */
+    blockedHours: number;
+    /** Severity score (0-100). */
+    severity: number;
+}
+/**
+ * Analyze a task graph and return critical path analysis.
+ */
+export declare function analyzeCriticalPath(graph: TaskGraph): CriticalPathAnalysis;
+//# sourceMappingURL=critical-path.d.ts.map

package/dist/critical-path.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"critical-path.d.ts","sourceRoot":"","sources":["../src/critical-path.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAExD;;;GAGG;AACH,MAAM,WAAW,oBAAoB;IACnC,8CAA8C;IAC9C,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,mDAAmD;IACnD,UAAU,EAAE,MAAM,CAAC;IACnB,iDAAiD;IACjD,WAAW,EAAE,cAAc,EAAE,CAAC;IAC9B,gDAAgD;IAChD,cAAc,EAAE,MAAM,EAAE,EAAE,CAAC;IAC3B,2DAA2D;IAC3D,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,sDAAsD;IACtD,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,+CAA+C;IAC/C,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,qEAAqE;IACrE,YAAY,EAAE,MAAM,CAAC;IACrB,wDAAwD;IACxD,YAAY,EAAE,MAAM,CAAC;IACrB,8BAA8B;IAC9B,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,oBAAoB,CA0F1E"}

package/dist/decompose-task.d.ts

@@ -0,0 +1,20 @@
+import type { TaskNode } from '@wrongstack/core/types';
+import type { SddSubtaskSpec } from './sdd-parallel-run.js';
+export interface SubtaskGeneratorOptions {
+    /** Runs one self-contained, isolated LLM turn and resolves its final text. */
+    run: (prompt: string) => Promise<string>;
+    /** Minimum well-formed sub-tasks required to accept a split. Default 2. */
+    minSubtasks?: number;
+    /** Maximum sub-tasks kept (excess is dropped). Default 4. */
+    maxSubtasks?: number;
+}
+/**
+ * Build a `SddSupervisorOptions.generateSubtasks` closure backed by an LLM turn.
+ * Returns [] on any failure (parse error, too few valid items, runner throw), so
+ * the supervisor safely degrades a `split` verdict into a retry.
+ */
+export declare function makeLlmSubtaskGenerator(opts: SubtaskGeneratorOptions): (info: {
+    task: TaskNode;
+    error: string;
+}) => Promise<SddSubtaskSpec[]>;
+//# sourceMappingURL=decompose-task.d.ts.map

package/dist/decompose-task.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decompose-task.d.ts","sourceRoot":"","sources":["../src/decompose-task.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,QAAQ,EAA0B,MAAM,wBAAwB,CAAC;AAK/E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAK5D,MAAM,WAAW,uBAAuB;IACtC,8EAA8E;IAC9E,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IACzC,2EAA2E;IAC3E,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AA2BD;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,uBAAuB,UAItB;IAC3C,IAAI,EAAE,QAAQ,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf,KAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAsC9B"}