forge-cc 1.0.0 → 1.0.2

package/dist/worktree/parallel.js

@@ -1,328 +0,0 @@
-/**
- * Parallel Scheduler — Milestone Dependency Analyzer & Execution Planner
- *
- * Parses `dependsOn` from PRD milestones, builds a DAG, determines which
- * milestones can run simultaneously in parallel waves, and provides
- * functions to query ready milestones given completed set.
- *
- * Backward compatible: milestones without `dependsOn` are treated as
- * having no dependencies (roots).
- */
-import { readFile } from "node:fs/promises";
-// ---------------------------------------------------------------------------
-// buildDAG
-// ---------------------------------------------------------------------------
-/**
- * Build a directed acyclic graph from milestone dependencies.
- *
- * Validates:
- * - All referenced dependencies exist in the milestone set
- * - No cycles exist in the dependency graph
- *
- * Throws descriptive errors on validation failure.
- */
-export function buildDAG(milestones) {
-    const dag = new Map();
-    const milestoneNumbers = new Set(milestones.map((m) => m.number));
-    // Initialize all nodes
-    for (const milestone of milestones) {
-        dag.set(milestone.number, {
-            milestone,
-            children: [],
-            parents: [...milestone.dependsOn],
-            depth: -1, // computed later
-        });
-    }
-    // Validate dependencies exist and build children links
-    for (const milestone of milestones) {
-        for (const dep of milestone.dependsOn) {
-            if (!milestoneNumbers.has(dep)) {
-                throw new Error(`Milestone ${milestone.number} ("${milestone.name}") depends on milestone ${dep}, which does not exist`);
-            }
-            const parentNode = dag.get(dep);
-            parentNode.children.push(milestone.number);
-        }
-    }
-    // Detect cycles using DFS with coloring (white/gray/black)
-    detectCycles(dag);
-    // Compute depths via BFS from roots
-    computeDepths(dag);
-    return dag;
-}
-/**
- * Detect cycles in the DAG using DFS with three-color marking.
- * Throws an error with a descriptive message if a cycle is found.
- */
-function detectCycles(dag) {
-    const WHITE = 0; // unvisited
-    const GRAY = 1; // in current DFS path
-    const BLACK = 2; // fully processed
-    const color = new Map();
-    for (const num of dag.keys()) {
-        color.set(num, WHITE);
-    }
-    const path = [];
-    function dfs(nodeNum) {
-        color.set(nodeNum, GRAY);
-        path.push(nodeNum);
-        const node = dag.get(nodeNum);
-        for (const childNum of node.children) {
-            const childColor = color.get(childNum);
-            if (childColor === GRAY) {
-                // Found a cycle — extract the cycle path for the error message
-                const cycleStart = path.indexOf(childNum);
-                const cyclePath = path.slice(cycleStart);
-                cyclePath.push(childNum); // close the cycle
-                const cycleStr = cyclePath
-                    .map((n) => {
-                    const m = dag.get(n).milestone;
-                    return `M${m.number}("${m.name}")`;
-                })
-                    .join(" -> ");
-                throw new Error(`Dependency cycle detected: ${cycleStr}`);
-            }
-            if (childColor === WHITE) {
-                dfs(childNum);
-            }
-        }
-        color.set(nodeNum, BLACK);
-        path.pop();
-    }
-    for (const num of dag.keys()) {
-        if (color.get(num) === WHITE) {
-            dfs(num);
-        }
-    }
-}
-/**
- * Compute depth for each node via BFS from roots (nodes with no parents).
- * Depth = longest path from any root to this node.
- */
-function computeDepths(dag) {
-    // Find roots (no parents)
-    const roots = [];
-    for (const [num, node] of dag) {
-        if (node.parents.length === 0) {
-            roots.push(num);
-        }
-    }
-    // BFS-like traversal computing max depth
-    // Use Kahn's algorithm approach: process nodes whose all parents are resolved
-    const depth = new Map();
-    const inDegree = new Map();
-    for (const [num, node] of dag) {
-        inDegree.set(num, node.parents.length);
-    }
-    const queue = [];
-    for (const root of roots) {
-        depth.set(root, 0);
-        queue.push(root);
-    }
-    while (queue.length > 0) {
-        const current = queue.shift();
-        const currentDepth = depth.get(current);
-        const node = dag.get(current);
-        node.depth = currentDepth;
-        for (const childNum of node.children) {
-            const childDepth = depth.get(childNum);
-            // Set child depth to max of current paths
-            if (childDepth === undefined || currentDepth + 1 > childDepth) {
-                depth.set(childNum, currentDepth + 1);
-            }
-            // Decrement in-degree; enqueue when all parents processed
-            const remaining = inDegree.get(childNum) - 1;
-            inDegree.set(childNum, remaining);
-            if (remaining === 0) {
-                queue.push(childNum);
-            }
-        }
-    }
-}
-// ---------------------------------------------------------------------------
-// computeExecutionWaves
-// ---------------------------------------------------------------------------
-/**
- * Topological sort milestones into parallel execution waves.
- *
- * - Wave 1: all milestones with no dependencies (roots)
- * - Wave 2: milestones whose dependencies are all in Wave 1
- * - Wave N: milestones whose dependencies are all in waves < N
- */
-export function computeExecutionWaves(dag) {
-    if (dag.size === 0) {
-        return {
-            waves: [],
-            totalMilestones: 0,
-            maxParallelism: 0,
-            isSequential: true,
-        };
-    }
-    // Group milestones by depth — depth corresponds to wave number
-    const waveMap = new Map();
-    for (const [num, node] of dag) {
-        const d = node.depth;
-        if (!waveMap.has(d)) {
-            waveMap.set(d, []);
-        }
-        waveMap.get(d).push(num);
-    }
-    // Sort wave keys and build ExecutionWave array
-    const sortedDepths = [...waveMap.keys()].sort((a, b) => a - b);
-    const waves = sortedDepths.map((depth, index) => ({
-        waveNumber: index + 1,
-        milestones: waveMap.get(depth).sort((a, b) => a - b),
-    }));
-    const maxParallelism = Math.max(...waves.map((w) => w.milestones.length));
-    const isSequential = maxParallelism <= 1;
-    return {
-        waves,
-        totalMilestones: dag.size,
-        maxParallelism,
-        isSequential,
-    };
-}
-// ---------------------------------------------------------------------------
-// parseMilestoneDependencies
-// ---------------------------------------------------------------------------
-/**
- * Parse a PRD markdown document to extract milestone definitions and
- * their `dependsOn` fields.
- *
- * Looks for milestone headers like:
- *   ### Milestone 1: Name Here
- *   ### Milestone 2 — Name Here
- *
- * And within each milestone section, looks for:
- *   **dependsOn:** 1, 3
- *   dependsOn: [1, 3]
- *   **dependsOn:** [1]
- *
- * If no `dependsOn` field is found, treats the milestone as having no
- * dependencies (backward compatible).
- */
-export function parseMilestoneDependencies(prdContent) {
-    const milestones = [];
-    // Split PRD into milestone sections
-    // Match headers like: ### Milestone 1: Name or ### Milestone 1 — Name
-    const milestoneHeaderRe = /###\s*Milestone\s+(\d+)\s*[:\—–-]\s*(.+)/g;
-    const headers = [];
-    let headerMatch;
-    while ((headerMatch = milestoneHeaderRe.exec(prdContent)) !== null) {
-        headers.push({
-            number: parseInt(headerMatch[1], 10),
-            name: headerMatch[2].trim(),
-            index: headerMatch.index,
-        });
-    }
-    // Extract section content for each milestone
-    for (let i = 0; i < headers.length; i++) {
-        const header = headers[i];
-        const sectionStart = header.index;
-        const sectionEnd = i + 1 < headers.length ? headers[i + 1].index : prdContent.length;
-        const sectionContent = prdContent.slice(sectionStart, sectionEnd);
-        // Look for dependsOn field in the section
-        const dependsOn = parseDependsOnField(sectionContent);
-        milestones.push({
-            number: header.number,
-            name: header.name,
-            dependsOn,
-        });
-    }
-    return milestones;
-}
-/**
- * Parse the dependsOn field from a milestone section.
- * Supports formats:
- *   **dependsOn:** 1, 3
- *   dependsOn: [1, 3]
- *   **dependsOn:** [1]
- *   **dependsOn:** none
- *
- * Returns empty array if not found or explicitly "none".
- */
-function parseDependsOnField(sectionContent) {
-    // Match patterns like:
-    //   **dependsOn:** 1, 3      (bold markdown: ** before key, :** after)
-    //   dependsOn: [1, 3]        (plain text)
-    //   **dependsOn:** [1]       (bold with brackets)
-    const dependsOnRe = /\*{0,2}dependsOn:\*{0,2}\s*(.+)/i;
-    const match = sectionContent.match(dependsOnRe);
-    if (!match) {
-        return [];
-    }
-    const value = match[1].trim();
-    // Handle "none" or empty
-    if (value.toLowerCase() === "none" ||
-        value === "[]" ||
-        value === "" ||
-        value === "-") {
-        return [];
-    }
-    // Strip brackets if present: [1, 3] -> 1, 3
-    const stripped = value.replace(/^\[/, "").replace(/\].*$/, "");
-    // Parse comma-separated numbers
-    const numbers = [];
-    for (const part of stripped.split(",")) {
-        const trimmed = part.trim();
-        const num = parseInt(trimmed, 10);
-        if (!isNaN(num)) {
-            numbers.push(num);
-        }
-    }
-    return numbers;
-}
-// ---------------------------------------------------------------------------
-// getReadyMilestones
-// ---------------------------------------------------------------------------
-/**
- * Given execution waves and a set of completed milestone numbers,
- * return which milestones are ready to start.
- *
- * A milestone is ready if:
- * 1. It has not been completed yet
- * 2. All of its dependencies (from the wave schedule) are in the completed set
- *
- * This requires the original DAG to check dependencies, so we accept
- * the waves plus the DAG.
- */
-export function getReadyMilestones(dag, completed) {
-    const ready = [];
-    for (const [num, node] of dag) {
-        // Skip already completed
-        if (completed.has(num)) {
-            continue;
-        }
-        // Check if all parents are completed
-        const allParentsCompleted = node.parents.every((p) => completed.has(p));
-        if (allParentsCompleted) {
-            ready.push(num);
-        }
-    }
-    return ready.sort((a, b) => a - b);
-}
-// ---------------------------------------------------------------------------
-// buildScheduleFromPRD — convenience function
-// ---------------------------------------------------------------------------
-/**
- * Parse a PRD file and build the full execution schedule.
- * Combines parseMilestoneDependencies + buildDAG + computeExecutionWaves.
- *
- * If the PRD has no `dependsOn` fields, all milestones will be in wave 1
- * (all roots), which is backward compatible with sequential execution
- * when the caller processes them in milestone-number order.
- */
-export async function buildScheduleFromPRD(prdPath) {
-    const prdContent = await readFile(prdPath, "utf-8");
-    const milestones = parseMilestoneDependencies(prdContent);
-    if (milestones.length === 0) {
-        return {
-            waves: [],
-            totalMilestones: 0,
-            maxParallelism: 0,
-            isSequential: true,
-        };
-    }
-    const dag = buildDAG(milestones);
-    return computeExecutionWaves(dag);
-}
-//# sourceMappingURL=parallel.js.map

package/dist/worktree/parallel.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parallel.js","sourceRoot":"","sources":["../../src/worktree/parallel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AA+B5C,8EAA8E;AAC9E,WAAW;AACX,8EAA8E;AAE9E;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,UAA0B;IACjD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAmB,CAAC;IACvC,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAElE,uBAAuB;IACvB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE;YACxB,SAAS;YACT,QAAQ,EAAE,EAAE;YACZ,OAAO,EAAE,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC;YACjC,KAAK,EAAE,CAAC,CAAC,EAAE,iBAAiB;SAC7B,CAAC,CAAC;IACL,CAAC;IAED,uDAAuD;IACvD,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;YACtC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CACb,aAAa,SAAS,CAAC,MAAM,MAAM,SAAS,CAAC,IAAI,2BAA2B,GAAG,wBAAwB,CACxG,CAAC;YACJ,CAAC;YACD,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YACjC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,YAAY,CAAC,GAAG,CAAC,CAAC;IAElB,oCAAoC;IACpC,aAAa,CAAC,GAAG,CAAC,CAAC;IAEnB,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,GAAyB;IAC7C,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,YAAY;IAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,sBAAsB;IACtC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,kBAAkB;IAEnC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;QAC7B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,OAAe;QAC1B,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAEnB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QAC/B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YACxC,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;gBACxB,+DAA+D;gBAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBACzC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,kBAAkB;gBAC5C,MAAM,QAAQ,GAAG,SAAS;qBACvB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;oBACT,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,SAAS,CAAC;oBAChC,OAAO,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC;gBACrC,CAAC,CAAC;qBACD,IAAI,CAAC,MAAM,CAAC,CAAC;gBAChB,MAAM,IAAI,KAAK,CAAC,8BAA8B,QAAQ,EAAE,CAAC,CAAC;YAC5D,CAAC;YACD,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;gBACzB,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,GAAG,EAAE,CAAC;IACb,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;QAC7B,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC;YAC7B,GAAG,CAAC,GAAG,CAAC,CAAC;QACX,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,GAAyB;IAC9C,0BAA0B;IAC1B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,8EAA8E;IAC9E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC9B,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QACzC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC;QAE1B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACvC,0CAA0C;YAC1C,IAAI,UAAU,KAAK,SAAS,IAAI,YAAY,GAAG,CAAC,GAAG,UAAU,EAAE,CAAC;gBAC9D,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC;YAED,0DAA0D;YAC1D,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAE,GAAG,CAAC,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAClC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACnC,GAAyB;IAEzB,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO;YACL,KAAK,EAAE,EAAE;YACT,eAAe,EAAE,CAAC;YAClB,cAAc,EAAE,CAAC;YACjB,YAAY,EAAE,IAAI;SACnB,CAAC;IACJ,CAAC;IAED,+DAA+D;IAC/D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE5C,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,+CAA+C;IAC/C,MAAM,YAAY,GAAG,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAoB,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACjE,UAAU,EAAE,KAAK,GAAG,CAAC;QACrB,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;KACtD,CAAC,CAAC,CAAC;IAEJ,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1E,MAAM,YAAY,GAAG,cAAc,IAAI,CAAC,CAAC;IAEzC,OAAO;QACL,KAAK;QACL,eAAe,EAAE,GAAG,CAAC,IAAI;QACzB,cAAc;QACd,YAAY;KACb,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,0BAA0B,CAAC,UAAkB;IAC3D,MAAM,UAAU,GAAmB,EAAE,CAAC;IAEtC,oCAAoC;IACpC,sEAAsE;IACtE,MAAM,iBAAiB,GACrB,2CAA2C,CAAC;IAE9C,MAAM,OAAO,GAA2D,EAAE,CAAC;IAC3E,IAAI,WAAmC,CAAC;IACxC,OAAO,CAAC,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACnE,OAAO,CAAC,IAAI,CAAC;YACX,MAAM,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;YAC3B,KAAK,EAAE,WAAW,CAAC,KAAK;SACzB,CAAC,CAAC;IACL,CAAC;IAED,6CAA6C;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC;QAClC,MAAM,UAAU,GACd,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACpE,MAAM,cAAc,GAAG,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;QAElE,0CAA0C;QAC1C,MAAM,SAAS,GAAG,mBAAmB,CAAC,cAAc,CAAC,CAAC;QAEtD,UAAU,CAAC,IAAI,CAAC;YACd,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,mBAAmB,CAAC,cAAsB;IACjD,uBAAuB;IACvB,uEAAuE;IACvE,0CAA0C;IAC1C,kDAAkD;IAClD,MAAM,WAAW,GACf,kCAAkC,CAAC;IACrC,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAEhD,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAE9B,yBAAyB;IACzB,IACE,KAAK,CAAC,WAAW,EAAE,KAAK,MAAM;QAC9B,KAAK,KAAK,IAAI;QACd,KAAK,KAAK,EAAE;QACZ,KAAK,KAAK,GAAG,EACb,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAE/D,gCAAgC;IAChC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAChC,GAAyB,EACzB,SAAsB;IAEtB,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC9B,yBAAyB;QACzB,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,SAAS;QACX,CAAC;QAED,qCAAqC;QACrC,MAAM,mBAAmB,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,IAAI,mBAAmB,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,8EAA8E;AAC9E,8CAA8C;AAC9C,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,OAAe;IAEf,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACpD,MAAM,UAAU,GAAG,0BAA0B,CAAC,UAAU,CAAC,CAAC;IAE1D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO;YACL,KAAK,EAAE,EAAE;YACT,eAAe,EAAE,CAAC;YAClB,cAAc,EAAE,CAAC;YACjB,YAAY,EAAE,IAAI;SACnB,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IACjC,OAAO,qBAAqB,CAAC,GAAG,CAAC,CAAC;AACpC,CAAC"}

package/dist/worktree/session.d.ts

@@ -1,67 +0,0 @@
-import type { UserIdentity } from "./identity.js";
-export interface Session {
-    id: string;
-    user: string;
-    email: string;
-    skill: "go" | "spec";
-    milestone?: string;
-    /** PRD slug this session is executing (for multi-PRD queue tracking) */
-    prdSlug?: string;
-    branch: string;
-    worktreePath: string;
-    startedAt: string;
-    pid: number;
-    status: "active" | "stale" | "completing";
-}
-export interface SessionRegistry {
-    sessions: Session[];
-}
-/**
- * Get the path to the session registry file.
- * Located at <repoRoot>/.forge/sessions.json
- */
-export declare function getRegistryPath(repoRoot: string): string;
-/**
- * Load the session registry. Returns empty registry if file doesn't exist.
- */
-export declare function loadRegistry(repoRoot: string): SessionRegistry;
-/**
- * Save the session registry atomically.
- */
-export declare function saveRegistry(repoRoot: string, registry: SessionRegistry): void;
-/**
- * Register a new session. Returns the created session.
- * Uses file-based locking to prevent lost updates from concurrent writes.
- */
-export declare function registerSession(repoRoot: string, params: {
-    user: UserIdentity;
-    skill: "go" | "spec";
-    milestone?: string;
-    prdSlug?: string;
-    branch: string;
-    worktreePath: string;
-}): Session;
-/**
- * Deregister (remove) a session by ID.
- * Uses file-based locking to prevent lost updates.
- */
-export declare function deregisterSession(repoRoot: string, sessionId: string): void;
-/**
- * Update a session's status.
- * Uses file-based locking to prevent lost updates.
- */
-export declare function updateSessionStatus(repoRoot: string, sessionId: string, status: Session["status"]): void;
-/**
- * Find and mark stale sessions.
- * A session is stale if its PID is no longer running.
- * Uses file-based locking to prevent lost updates.
- */
-export declare function detectStaleSessions(repoRoot: string): Session[];
-/**
- * Get all active sessions.
- */
-export declare function getActiveSessions(repoRoot: string): Session[];
-/**
- * Get a session by ID.
- */
-export declare function getSession(repoRoot: string, sessionId: string): Session | null;

package/dist/worktree/session.js

@@ -1,194 +0,0 @@
-import { join } from "node:path";
-import { openSync, closeSync, unlinkSync, mkdirSync, existsSync, } from "node:fs";
-import { readJsonFileSync, writeJsonFileSync, generateSessionId, } from "../utils/platform.js";
-/**
- * Get the path to the session registry file.
- * Located at <repoRoot>/.forge/sessions.json
- */
-export function getRegistryPath(repoRoot) {
-    return join(repoRoot, ".forge", "sessions.json");
-}
-// ---------------------------------------------------------------------------
-// File-based lock for registry writes
-// ---------------------------------------------------------------------------
-const LOCK_RETRIES = 10;
-const LOCK_RETRY_MS = 100;
-function getLockPath(repoRoot) {
-    return join(repoRoot, ".forge", "sessions.lock");
-}
-/**
- * Acquire an exclusive lock file. Retries with backoff on contention.
- * Uses O_CREAT|O_EXCL which atomically fails if the file exists.
- */
-function acquireLock(repoRoot) {
-    const lockPath = getLockPath(repoRoot);
-    const dir = join(repoRoot, ".forge");
-    if (!existsSync(dir)) {
-        mkdirSync(dir, { recursive: true });
-    }
-    for (let attempt = 0; attempt < LOCK_RETRIES; attempt++) {
-        try {
-            // O_CREAT | O_EXCL | O_WRONLY — fails if file already exists
-            const fd = openSync(lockPath, "wx");
-            closeSync(fd);
-            return;
-        }
-        catch {
-            if (attempt === LOCK_RETRIES - 1) {
-                // Last attempt — force-remove stale lock and try once more
-                try {
-                    unlinkSync(lockPath);
-                    const fd = openSync(lockPath, "wx");
-                    closeSync(fd);
-                    return;
-                }
-                catch {
-                    throw new Error(`Failed to acquire session registry lock at ${lockPath} after ${LOCK_RETRIES} attempts`);
-                }
-            }
-            // Busy-wait (sync context)
-            const waitUntil = Date.now() + LOCK_RETRY_MS;
-            while (Date.now() < waitUntil) {
-                // spin
-            }
-        }
-    }
-}
-/**
- * Release the lock file.
- */
-function releaseLock(repoRoot) {
-    try {
-        unlinkSync(getLockPath(repoRoot));
-    }
-    catch {
-        // Lock already removed — non-fatal
-    }
-}
-/**
- * Execute a callback while holding the registry lock.
- * Ensures read-modify-write operations are serialized.
- */
-function withRegistryLock(repoRoot, fn) {
-    acquireLock(repoRoot);
-    try {
-        return fn();
-    }
-    finally {
-        releaseLock(repoRoot);
-    }
-}
-/**
- * Load the session registry. Returns empty registry if file doesn't exist.
- */
-export function loadRegistry(repoRoot) {
-    const data = readJsonFileSync(getRegistryPath(repoRoot));
-    if (data === null) {
-        return { sessions: [] };
-    }
-    return data;
-}
-/**
- * Save the session registry atomically.
- */
-export function saveRegistry(repoRoot, registry) {
-    writeJsonFileSync(getRegistryPath(repoRoot), registry);
-}
-/**
- * Register a new session. Returns the created session.
- * Uses file-based locking to prevent lost updates from concurrent writes.
- */
-export function registerSession(repoRoot, params) {
-    return withRegistryLock(repoRoot, () => {
-        const registry = loadRegistry(repoRoot);
-        const session = {
-            id: generateSessionId(),
-            user: params.user.name,
-            email: params.user.email,
-            skill: params.skill,
-            milestone: params.milestone,
-            prdSlug: params.prdSlug,
-            branch: params.branch,
-            worktreePath: params.worktreePath,
-            startedAt: new Date().toISOString(),
-            pid: process.pid,
-            status: "active",
-        };
-        registry.sessions.push(session);
-        saveRegistry(repoRoot, registry);
-        return session;
-    });
-}
-/**
- * Deregister (remove) a session by ID.
- * Uses file-based locking to prevent lost updates.
- */
-export function deregisterSession(repoRoot, sessionId) {
-    withRegistryLock(repoRoot, () => {
-        const registry = loadRegistry(repoRoot);
-        registry.sessions = registry.sessions.filter((s) => s.id !== sessionId);
-        saveRegistry(repoRoot, registry);
-    });
-}
-/**
- * Update a session's status.
- * Uses file-based locking to prevent lost updates.
- */
-export function updateSessionStatus(repoRoot, sessionId, status) {
-    withRegistryLock(repoRoot, () => {
-        const registry = loadRegistry(repoRoot);
-        const session = registry.sessions.find((s) => s.id === sessionId);
-        if (session) {
-            session.status = status;
-            saveRegistry(repoRoot, registry);
-        }
-    });
-}
-/**
- * Check if a process with the given PID is still running.
- */
-function isPidAlive(pid) {
-    try {
-        process.kill(pid, 0);
-        return true;
-    }
-    catch {
-        return false;
-    }
-}
-/**
- * Find and mark stale sessions.
- * A session is stale if its PID is no longer running.
- * Uses file-based locking to prevent lost updates.
- */
-export function detectStaleSessions(repoRoot) {
-    return withRegistryLock(repoRoot, () => {
-        const registry = loadRegistry(repoRoot);
-        const newlyStale = [];
-        for (const session of registry.sessions) {
-            if (session.status === "active" && !isPidAlive(session.pid)) {
-                session.status = "stale";
-                newlyStale.push(session);
-            }
-        }
-        if (newlyStale.length > 0) {
-            saveRegistry(repoRoot, registry);
-        }
-        return newlyStale;
-    });
-}
-/**
- * Get all active sessions.
- */
-export function getActiveSessions(repoRoot) {
-    const registry = loadRegistry(repoRoot);
-    return registry.sessions.filter((s) => s.status === "active");
-}
-/**
- * Get a session by ID.
- */
-export function getSession(repoRoot, sessionId) {
-    const registry = loadRegistry(repoRoot);
-    return registry.sessions.find((s) => s.id === sessionId) ?? null;
-}
-//# sourceMappingURL=session.js.map

package/dist/worktree/session.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"session.js","sourceRoot":"","sources":["../../src/worktree/session.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EACL,QAAQ,EACR,SAAS,EACT,UAAU,EACV,SAAS,EACT,UAAU,GACX,MAAM,SAAS,CAAC;AACjB,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,iBAAiB,GAClB,MAAM,sBAAsB,CAAC;AAsB9B;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,QAAgB;IAC9C,OAAO,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC;AACnD,CAAC;AAED,8EAA8E;AAC9E,sCAAsC;AACtC,8EAA8E;AAE9E,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,SAAS,WAAW,CAAC,QAAgB;IACnC,OAAO,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC;AACnD,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,QAAgB;IACnC,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACrC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,YAAY,EAAE,OAAO,EAAE,EAAE,CAAC;QACxD,IAAI,CAAC;YACH,6DAA6D;YAC7D,MAAM,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YACpC,SAAS,CAAC,EAAE,CAAC,CAAC;YACd,OAAO;QACT,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,OAAO,KAAK,YAAY,GAAG,CAAC,EAAE,CAAC;gBACjC,2DAA2D;gBAC3D,IAAI,CAAC;oBACH,UAAU,CAAC,QAAQ,CAAC,CAAC;oBACrB,MAAM,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;oBACpC,SAAS,CAAC,EAAE,CAAC,CAAC;oBACd,OAAO;gBACT,CAAC;gBAAC,MAAM,CAAC;oBACP,MAAM,IAAI,KAAK,CACb,8CAA8C,QAAQ,UAAU,YAAY,WAAW,CACxF,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,2BAA2B;YAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa,CAAC;YAC7C,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,EAAE,CAAC;gBAC9B,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,QAAgB;IACnC,IAAI,CAAC;QACH,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpC,CAAC;IAAC,MAAM,CAAC;QACP,mCAAmC;IACrC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAI,QAAgB,EAAE,EAAW;IACxD,WAAW,CAAC,QAAQ,CAAC,CAAC;IACtB,IAAI,CAAC;QACH,OAAO,EAAE,EAAE,CAAC;IACd,CAAC;YAAS,CAAC;QACT,WAAW,CAAC,QAAQ,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB;IAC3C,MAAM,IAAI,GAAG,gBAAgB,CAAkB,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC1E,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IAC1B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAC1B,QAAgB,EAChB,QAAyB;IAEzB,iBAAiB,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;AACzD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAgB,EAChB,MAOC;IAED,OAAO,gBAAgB,CAAC,QAAQ,EAAE,GAAG,EAAE;QACrC,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QAExC,MAAM,OAAO,GAAY;YACvB,EAAE,EAAE,iBAAiB,EAAE;YACvB,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI;YACtB,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK;YACxB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,GAAG,EAAE,OAAO,CAAC,GAAG;YAChB,MAAM,EAAE,QAAQ;SACjB,CAAC;QAEF,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEjC,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAgB,EAChB,SAAiB;IAEjB,gBAAgB,CAAC,QAAQ,EAAE,GAAG,EAAE;QAC9B,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACxC,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC;QACxE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAAgB,EAChB,SAAiB,EACjB,MAAyB;IAEzB,gBAAgB,CAAC,QAAQ,EAAE,GAAG,EAAE;QAC9B,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC;QAElE,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;YACxB,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,GAAW;IAC7B,IAAI,CAAC;QACH,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAgB;IAClD,OAAO,gBAAgB,CAAC,QAAQ,EAAE,GAAG,EAAE;QACrC,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACxC,MAAM,UAAU,GAAc,EAAE,CAAC;QAEjC,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5D,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC;gBACzB,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAgB;IAChD,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACxC,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;AAChE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CACxB,QAAgB,EAChB,SAAiB;IAEjB,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACxC,OAAO,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,IAAI,IAAI,CAAC;AACnE,CAAC"}

package/dist/worktree/state-merge.d.ts

@@ -1,43 +0,0 @@
-export interface MergeResult {
-    stateUpdated: boolean;
-    roadmapUpdated: boolean;
-    warnings: string[];
-}
-/**
- * Merge state from a completed worktree session back to the main repo.
- *
- * - STATE.md: updates the milestone row with completion status and the
- *   Last Session date.
- * - ROADMAP.md: marks the milestone row as complete with the given date.
- *
- * Uses synchronous I/O throughout — consistent with all other worktree modules.
- *
- * @param mainRepoDir - Absolute path to the main repository
- * @param worktreeDir - Absolute path to the completed worktree
- * @param milestoneNumber - The milestone that was completed
- * @param completionDate - Date string (YYYY-MM-DD) for the completion
- */
-export declare function mergeSessionState(mainRepoDir: string, worktreeDir: string, milestoneNumber: number, completionDate: string): MergeResult;
-/**
- * Update a specific milestone row in a ROADMAP.md file.
- * Uses structured line-by-line parsing (not regex replace) to safely
- * update the status column of the milestone's table row.
- *
- * @param roadmapPath - Absolute path to ROADMAP.md
- * @param milestoneNumber - Which milestone to update
- * @param newStatus - New status string (e.g., "Complete (2026-02-15)")
- * @returns true if the milestone was found and updated
- */
-export declare function updateRoadmapMilestoneStatus(roadmapPath: string, milestoneNumber: number, newStatus: string): boolean;
-/**
- * Update the milestone progress table in STATE.md.
- * Reads the current STATE.md, finds the milestone row, updates its status.
- * Also updates the `**Last Session:**` date if present.
- * Preserves all other content.
- *
- * @param statePath - Absolute path to STATE.md
- * @param milestoneNumber - Which milestone to update
- * @param newStatus - New status string
- * @returns true if the milestone was found and updated
- */
-export declare function updateStateMilestoneRow(statePath: string, milestoneNumber: number, newStatus: string): boolean;