@telora/daemon 0.12.33

package/dist/dependency-resolver.js

@@ -0,0 +1,337 @@
+/**
+ * Dependency resolution for the task DAG.
+ *
+ * Extracted from task-dag-builder.ts. Contains functions that analyze
+ * and resolve task dependencies, including cross-delivery dependencies,
+ * CG-level dependencies, and file overlap detection.
+ *
+ * Pure functions only (no side effects, no API calls).
+ *
+ * Dependency rules:
+ * 1. Delivery ordering: issues in delivery N are blocked by issues in delivery N-1
+ *    (respects priorityRank ordering)
+ * 2. Within a delivery: issues under the same Context Group can run in parallel
+ *    unless they share relevant files
+ * 3. File overlap detection: if two issues from different deliveries share files,
+ *    the lower-priority delivery's issue is blocked by the higher-priority one
+ * 4. Context Groups themselves can run in parallel unless they share relevant files
+ */
+// ── File overlap detection ───────────────────────────────────────
+/**
+ * Parse relevant files from a newline-delimited string into a set of normalized paths.
+ * Supports glob patterns -- for overlap detection, we treat the base path as the key.
+ */
+export function parseRelevantFiles(relevantFiles) {
+    if (!relevantFiles)
+        return new Set();
+    const paths = new Set();
+    for (const line of relevantFiles.split('\n')) {
+        const trimmed = line.trim();
+        if (!trimmed)
+            continue;
+        // Normalize: remove leading ./ and trailing globs for overlap comparison
+        const normalized = trimmed
+            .replace(/^\.\//, '')
+            .replace(/\/\*\*?.*$/, '') // Remove glob suffixes like /** or /*.ts
+            .replace(/\*.*$/, ''); // Remove wildcard suffixes
+        if (normalized) {
+            paths.add(normalized);
+        }
+        // Also keep the original pattern for more precise matching
+        paths.add(trimmed.replace(/^\.\//, ''));
+    }
+    return paths;
+}
+/**
+ * Check if two sets of file paths have any overlap.
+ * An overlap means the two issues touch the same files and should not
+ * be worked on in parallel.
+ */
+export function hasFileOverlap(filesA, filesB) {
+    if (filesA.size === 0 || filesB.size === 0)
+        return false;
+    for (const pathA of filesA) {
+        for (const pathB of filesB) {
+            // Exact match
+            if (pathA === pathB)
+                return true;
+            // One is a prefix of the other (directory overlap)
+            if (pathA.startsWith(pathB + '/') || pathB.startsWith(pathA + '/'))
+                return true;
+        }
+    }
+    return false;
+}
+// ── Cross-delivery dependencies ──────────────────────────────────
+/**
+ * Add cross-delivery dependencies.
+ *
+ * For each delivery after the first, its issues are blocked by the
+ * issues in the immediately preceding delivery. This ensures deliveries
+ * execute in priority order while allowing parallelism within a delivery.
+ *
+ * We also check for file overlap across non-adjacent deliveries.
+ */
+export function addCrossDeliveryDependencies(nodes, sortedDeliveries, issuesByDelivery, _issueDeliveryRank) {
+    for (let i = 1; i < sortedDeliveries.length; i++) {
+        const currentDelivery = sortedDeliveries[i];
+        const prevDelivery = sortedDeliveries[i - 1];
+        const currentIssues = issuesByDelivery.get(currentDelivery.id) ?? [];
+        const prevIssues = issuesByDelivery.get(prevDelivery.id) ?? [];
+        // Get actionable issue IDs from the previous delivery
+        const prevActionableIds = prevIssues
+            .filter(issue => issue.issueType !== 'Context Group' && issue.status !== 'Done')
+            .map(issue => issue.id);
+        if (prevActionableIds.length === 0)
+            continue;
+        // Block all current delivery's issues on all previous delivery's issues
+        for (const issue of currentIssues) {
+            if (issue.issueType === 'Context Group' || issue.status === 'Done')
+                continue;
+            const node = nodes.get(issue.id);
+            if (!node)
+                continue;
+            for (const prevId of prevActionableIds) {
+                if (nodes.has(prevId)) {
+                    node.blockedBy.add(prevId);
+                }
+            }
+        }
+    }
+}
+// ── CG-level dependencies ────────────────────────────────────────
+/**
+ * Add CG-level dependency enforcement within each delivery.
+ *
+ * For each Context Group that has a non-null `dependsOn` array,
+ * all child issues (Tasks/Bugs) under this CG are blocked by
+ * ALL child issues under each dependency CG. This creates a
+ * CG-level DAG: dependent CGs' issues can't start until
+ * dependency CGs' issues are all complete.
+ */
+export function addCGDependencies(nodes, sortedDeliveries, issuesByDelivery, _contextGroups) {
+    for (const delivery of sortedDeliveries) {
+        const deliveryIssues = issuesByDelivery.get(delivery.id) ?? [];
+        // Build a map: contextGroupId -> actionable child issue IDs (in the DAG)
+        const cgChildren = new Map();
+        for (const issue of deliveryIssues) {
+            if (issue.issueType === 'Context Group')
+                continue;
+            if (issue.status === 'Done')
+                continue;
+            if (!issue.parentIssueId)
+                continue;
+            if (!nodes.has(issue.id))
+                continue;
+            const existing = cgChildren.get(issue.parentIssueId) ?? [];
+            existing.push(issue.id);
+            cgChildren.set(issue.parentIssueId, existing);
+        }
+        // For each CG with dependsOn, block its children on all children of dependency CGs
+        for (const issue of deliveryIssues) {
+            if (issue.issueType !== 'Context Group')
+                continue;
+            if (!issue.dependsOn || issue.dependsOn.length === 0)
+                continue;
+            const myChildren = cgChildren.get(issue.id) ?? [];
+            if (myChildren.length === 0)
+                continue;
+            for (const depCgId of issue.dependsOn) {
+                const depChildren = cgChildren.get(depCgId) ?? [];
+                for (const childId of myChildren) {
+                    const childNode = nodes.get(childId);
+                    if (!childNode)
+                        continue;
+                    for (const depChildId of depChildren) {
+                        if (nodes.has(depChildId)) {
+                            childNode.blockedBy.add(depChildId);
+                        }
+                    }
+                }
+            }
+        }
+    }
+}
+/**
+ * Compute CG execution waves for a delivery using topological sort.
+ * Wave 0 = CGs with no dependencies (parallelizable)
+ * Wave N = CGs whose dependencies are all in waves < N
+ * Returns Map<cgId, waveNumber>
+ *
+ * @throws Error if a cycle is detected in the CG dependency graph
+ */
+export function getCGExecutionWaves(issues, deliveryId) {
+    // Filter to CGs in the given delivery
+    const cgs = issues.filter(i => i.issueType === 'Context Group' && i.deliveryId === deliveryId);
+    const cgIds = new Set(cgs.map(cg => cg.id));
+    const waves = new Map();
+    // Build adjacency: cgId -> set of dependency CG IDs (within this delivery)
+    const deps = new Map();
+    // In-degree count for Kahn's algorithm
+    const inDegree = new Map();
+    for (const cg of cgs) {
+        inDegree.set(cg.id, 0);
+        deps.set(cg.id, new Set());
+    }
+    for (const cg of cgs) {
+        if (!cg.dependsOn)
+            continue;
+        for (const depId of cg.dependsOn) {
+            // Only consider dependencies within this delivery's CGs
+            if (cgIds.has(depId)) {
+                deps.get(cg.id).add(depId);
+                inDegree.set(cg.id, (inDegree.get(cg.id) ?? 0) + 1);
+            }
+        }
+    }
+    // Kahn's algorithm: process nodes with in-degree 0 in waves
+    let currentWave = [];
+    for (const [id, degree] of inDegree) {
+        if (degree === 0) {
+            currentWave.push(id);
+        }
+    }
+    let waveNumber = 0;
+    let processed = 0;
+    while (currentWave.length > 0) {
+        const nextWave = [];
+        for (const cgId of currentWave) {
+            waves.set(cgId, waveNumber);
+            processed++;
+            // Reduce in-degree of dependents
+            for (const cg of cgs) {
+                const cgDeps = deps.get(cg.id);
+                if (cgDeps && cgDeps.has(cgId)) {
+                    const newDegree = (inDegree.get(cg.id) ?? 1) - 1;
+                    inDegree.set(cg.id, newDegree);
+                    if (newDegree === 0) {
+                        nextWave.push(cg.id);
+                    }
+                }
+            }
+        }
+        currentWave = nextWave;
+        waveNumber++;
+    }
+    if (processed !== cgs.length) {
+        throw new Error(`Cycle detected in CG dependency graph for delivery ${deliveryId}: ` +
+            `processed ${processed} of ${cgs.length} CGs`);
+    }
+    return waves;
+}
+// ── File overlap dependencies ────────────────────────────────────
+/**
+ * Add file overlap dependencies within the same delivery.
+ *
+ * Within a delivery, issues that share relevant files should run sequentially.
+ * Issues under the same context group with no file overlap can run in parallel.
+ */
+export function addFileOverlapDependencies(nodes, sortedDeliveries, issuesByDelivery, contextGroups) {
+    for (const delivery of sortedDeliveries) {
+        const deliveryIssues = issuesByDelivery.get(delivery.id) ?? [];
+        const actionableIssues = deliveryIssues.filter(i => i.issueType !== 'Context Group' && i.status !== 'Done');
+        // Build file sets for each issue
+        const issueFiles = new Map();
+        for (const issue of actionableIssues) {
+            const parentGroup = issue.parentIssueId ? contextGroups.get(issue.parentIssueId) : null;
+            const relevantFiles = parentGroup?.relevantFiles ?? issue.relevantFiles;
+            issueFiles.set(issue.id, parseRelevantFiles(relevantFiles));
+        }
+        // For each pair of issues in the same delivery, check for file overlap
+        for (let i = 0; i < actionableIssues.length; i++) {
+            for (let j = i + 1; j < actionableIssues.length; j++) {
+                const issueA = actionableIssues[i];
+                const issueB = actionableIssues[j];
+                const filesA = issueFiles.get(issueA.id);
+                const filesB = issueFiles.get(issueB.id);
+                if (!filesA || !filesB)
+                    continue;
+                if (!hasFileOverlap(filesA, filesB))
+                    continue;
+                // File overlap detected -- add a dependency (lower index goes first)
+                const nodeB = nodes.get(issueB.id);
+                if (nodeB && nodes.has(issueA.id)) {
+                    nodeB.blockedBy.add(issueA.id);
+                }
+            }
+        }
+    }
+}
+// ── Single-delivery dependency helpers (for dynamic addition) ────
+/**
+ * Add CG-level dependency enforcement for a single delivery's issues.
+ * Used by addIssuesToDAG for dynamically added deliveries.
+ */
+export function addCGDependenciesForDelivery(nodes, delivery, issues, _contextGroups) {
+    // Build a map: contextGroupId -> actionable child issue IDs (in the DAG)
+    const cgChildren = new Map();
+    for (const issue of issues) {
+        if (issue.issueType === 'Context Group')
+            continue;
+        if (issue.status === 'Done')
+            continue;
+        if (!issue.parentIssueId)
+            continue;
+        if (!nodes.has(issue.id))
+            continue;
+        const existing = cgChildren.get(issue.parentIssueId) ?? [];
+        existing.push(issue.id);
+        cgChildren.set(issue.parentIssueId, existing);
+    }
+    // For each CG with dependsOn, block its children on all children of dependency CGs
+    for (const issue of issues) {
+        if (issue.issueType !== 'Context Group')
+            continue;
+        if (!issue.dependsOn || issue.dependsOn.length === 0)
+            continue;
+        const myChildren = cgChildren.get(issue.id) ?? [];
+        if (myChildren.length === 0)
+            continue;
+        for (const depCgId of issue.dependsOn) {
+            const depChildren = cgChildren.get(depCgId) ?? [];
+            for (const childId of myChildren) {
+                const childNode = nodes.get(childId);
+                if (!childNode)
+                    continue;
+                for (const depChildId of depChildren) {
+                    if (nodes.has(depChildId)) {
+                        childNode.blockedBy.add(depChildId);
+                    }
+                }
+            }
+        }
+    }
+}
+/**
+ * Add file-overlap dependencies within a single delivery's issues.
+ * Used by addIssuesToDAG for dynamically added deliveries.
+ */
+export function addFileOverlapForDelivery(nodes, issues, contextGroups) {
+    const actionableIssues = issues.filter(i => i.issueType !== 'Context Group' && i.status !== 'Done' && nodes.has(i.id));
+    // Build file sets for each issue
+    const issueFiles = new Map();
+    for (const issue of actionableIssues) {
+        const parentGroup = issue.parentIssueId ? contextGroups.get(issue.parentIssueId) : null;
+        const relevantFiles = parentGroup?.relevantFiles ?? issue.relevantFiles;
+        issueFiles.set(issue.id, parseRelevantFiles(relevantFiles));
+    }
+    // For each pair of issues, check for file overlap
+    for (let i = 0; i < actionableIssues.length; i++) {
+        for (let j = i + 1; j < actionableIssues.length; j++) {
+            const issueA = actionableIssues[i];
+            const issueB = actionableIssues[j];
+            const filesA = issueFiles.get(issueA.id);
+            const filesB = issueFiles.get(issueB.id);
+            if (!filesA || !filesB)
+                continue;
+            if (!hasFileOverlap(filesA, filesB))
+                continue;
+            // File overlap detected -- add a dependency (lower index goes first)
+            const nodeB = nodes.get(issueB.id);
+            if (nodeB && nodes.has(issueA.id)) {
+                nodeB.blockedBy.add(issueA.id);
+            }
+        }
+    }
+}
+//# sourceMappingURL=dependency-resolver.js.map

package/dist/dependency-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.js","sourceRoot":"","sources":["../src/dependency-resolver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAQH,oEAAoE;AAEpE;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,aAA4B;IAC7D,IAAI,CAAC,aAAa;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAErC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,yEAAyE;QACzE,MAAM,UAAU,GAAG,OAAO;aACvB,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;aACpB,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAE,yCAAyC;aACpE,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAO,2BAA2B;QAC1D,IAAI,UAAU,EAAE,CAAC;YACf,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACxB,CAAC;QACD,2DAA2D;QAC3D,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,MAAmB,EAAE,MAAmB;IACrE,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEzD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,cAAc;YACd,IAAI,KAAK,KAAK,KAAK;gBAAE,OAAO,IAAI,CAAC;YACjC,mDAAmD;YACnD,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,GAAG,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;QAClF,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,oEAAoE;AAEpE;;;;;;;;GAQG;AACH,MAAM,UAAU,4BAA4B,CAC1C,KAA4B,EAC5B,gBAAwC,EACxC,gBAAkD,EAClD,kBAAuC;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,MAAM,eAAe,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,YAAY,GAAG,gBAAgB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE7C,MAAM,aAAa,GAAG,gBAAgB,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACrE,MAAM,UAAU,GAAG,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAE/D,sDAAsD;QACtD,MAAM,iBAAiB,GAAG,UAAU;aACjC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,KAAK,eAAe,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC;aAC/E,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAE1B,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAE7C,wEAAwE;QACxE,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,SAAS,KAAK,eAAe,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;gBAAE,SAAS;YAC7E,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,MAAM,IAAI,iBAAiB,EAAE,CAAC;gBACvC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBACtB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,oEAAoE;AAEpE;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAA4B,EAC5B,gBAAwC,EACxC,gBAAkD,EAClD,cAA8C;IAE9C,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QACxC,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAE/D,yEAAyE;QACzE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC/C,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,SAAS,KAAK,eAAe;gBAAE,SAAS;YAClD,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;gBAAE,SAAS;YACtC,IAAI,CAAC,KAAK,CAAC,aAAa;gBAAE,SAAS;YACnC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEnC,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;YAC3D,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACxB,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;QAChD,CAAC;QAED,mFAAmF;QACnF,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,SAAS,KAAK,eAAe;gBAAE,SAAS;YAClD,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAE/D,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAClD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEtC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBACtC,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBAElD,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;oBACjC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBACrC,IAAI,CAAC,SAAS;wBAAE,SAAS;oBAEzB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;wBACrC,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;4BAC1B,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;wBACtC,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAA2B,EAC3B,UAAkB;IAElB,sCAAsC;IACtC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CACvB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,eAAe,IAAI,CAAC,CAAC,UAAU,KAAK,UAAU,CACpE,CAAC;IAEF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,2EAA2E;IAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,uCAAuC;IACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,EAAE,CAAC,SAAS;YAAE,SAAS;QAC5B,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,SAAS,EAAE,CAAC;YACjC,wDAAwD;YACxD,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC5B,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,IAAI,WAAW,GAAa,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YAC5B,SAAS,EAAE,CAAC;YAEZ,iCAAiC;YACjC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;gBACrB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC/B,IAAI,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/B,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBACjD,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;oBAC/B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;wBACpB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,WAAW,GAAG,QAAQ,CAAC;QACvB,UAAU,EAAE,CAAC;IACf,CAAC;IAED,IAAI,SAAS,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CACb,sDAAsD,UAAU,IAAI;YACpE,aAAa,SAAS,OAAO,GAAG,CAAC,MAAM,MAAM,CAC9C,CAAC;IACJ,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,oEAAoE;AAEpE;;;;;GAKG;AACH,MAAM,UAAU,0BAA0B,CACxC,KAA4B,EAC5B,gBAAwC,EACxC,gBAAkD,EAClD,aAA6C;IAE7C,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QACxC,MAAM,cAAc,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC/D,MAAM,gBAAgB,GAAG,cAAc,CAAC,MAAM,CAC5C,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,eAAe,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAC5D,CAAC;QAEF,iCAAiC;QACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;QAClD,KAAK,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;YACrC,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACxF,MAAM,aAAa,GAAG,WAAW,EAAE,aAAa,IAAI,KAAK,CAAC,aAAa,CAAC;YACxE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,kBAAkB,CAAC,aAAa,CAAC,CAAC,CAAC;QAC9D,CAAC;QAED,uEAAuE;QACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBACnC,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAEnC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACzC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAEzC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;oBAAE,SAAS;gBACjC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC;oBAAE,SAAS;gBAE9C,qEAAqE;gBACrE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnC,IAAI,KAAK,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;oBAClC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,oEAAoE;AAEpE;;;GAGG;AACH,MAAM,UAAU,4BAA4B,CAC1C,KAA4B,EAC5B,QAA8B,EAC9B,MAA2B,EAC3B,cAA8C;IAE9C,yEAAyE;IACzE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,SAAS,KAAK,eAAe;YAAE,SAAS;QAClD,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,SAAS;QACtC,IAAI,CAAC,KAAK,CAAC,aAAa;YAAE,SAAS;QACnC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAAE,SAAS;QAEnC,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QAC3D,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACxB,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED,mFAAmF;IACnF,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,SAAS,KAAK,eAAe;YAAE,SAAS;QAClD,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAE/D,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAClD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEtC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACtC,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YAElD,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;gBACjC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACrC,IAAI,CAAC,SAAS;oBAAE,SAAS;gBAEzB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;oBACrC,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC1B,SAAS,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACtC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,yBAAyB,CACvC,KAA4B,EAC5B,MAA2B,EAC3B,aAA6C;IAE7C,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,eAAe,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAC/E,CAAC;IAEF,iCAAiC;IACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,KAAK,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;QACrC,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxF,MAAM,aAAa,GAAG,WAAW,EAAE,aAAa,IAAI,KAAK,CAAC,aAAa,CAAC;QACxE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,kBAAkB,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,kDAAkD;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAEnC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAEzC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;gBAAE,SAAS;YACjC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC;gBAAE,SAAS;YAE9C,qEAAqE;YACrE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,KAAK,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/evaluation-context.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Context building for guard evaluation.
+ *
+ * Gathers the evaluation context (delivery state, issue counts, session data,
+ * factory instance state, etc.) needed by condition evaluators.
+ *
+ * The EvaluationContext interface is canonically defined in @telora/daemon-core
+ * and re-exported here for backward compatibility.
+ *
+ * Extracted from guard-engine.ts to improve maintainability.
+ */
+import type { EvaluationContext } from '@telora/daemon-core';
+export type { EvaluationContext } from '@telora/daemon-core';
+/**
+ * Build factory evaluation context from in-memory instance state.
+ *
+ * This is a pure function that builds from already-available data,
+ * avoiding the cross-package DB query problem. The factory engine
+ * calls this with data it already has (instance state, work units,
+ * gate results from its own queries).
+ */
+export declare function buildFactoryEvaluationContext(params: {
+    instanceId: string;
+    instanceState: {
+        tokensUsed: number;
+        completionGateIterations: number;
+        wallClockStartedAt: string | null;
+    };
+    blueprint: {
+        maxTokenBudget: number | null;
+        maxWallClockHours: number | null;
+        maxInstanceIterations: number | null;
+    };
+    workUnits: Array<{
+        status: string;
+    }>;
+    gateResults: Array<{
+        strategyId: string;
+        gateType: string;
+        iteration: number;
+        passed: boolean;
+    }>;
+    strategyId?: string;
+}): EvaluationContext;
+/**
+ * Build evaluation context by querying current delivery state.
+ */
+export declare function buildEvaluationContext(deliveryId: string, lastExitCode: number): Promise<EvaluationContext>;
+//# sourceMappingURL=evaluation-context.d.ts.map

package/dist/evaluation-context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluation-context.d.ts","sourceRoot":"","sources":["../src/evaluation-context.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAMH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAG7D,YAAY,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAM7D;;;;;;;GAOG;AACH,wBAAgB,6BAA6B,CAAC,MAAM,EAAE;IACpD,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE;QACb,UAAU,EAAE,MAAM,CAAC;QACnB,wBAAwB,EAAE,MAAM,CAAC;QACjC,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;KACnC,CAAC;IACF,SAAS,EAAE;QACT,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;QAC9B,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;QACjC,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;KACtC,CAAC;IACF,SAAS,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACrC,WAAW,EAAE,KAAK,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,OAAO,CAAA;KAAE,CAAC,CAAC;IACjG,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB,GAAG,iBAAiB,CAqDpB;AAED;;GAEG;AACH,wBAAsB,sBAAsB,CAC1C,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC,iBAAiB,CAAC,CA4B5B"}

package/dist/evaluation-context.js

@@ -0,0 +1,98 @@
+/**
+ * Context building for guard evaluation.
+ *
+ * Gathers the evaluation context (delivery state, issue counts, session data,
+ * factory instance state, etc.) needed by condition evaluators.
+ *
+ * The EvaluationContext interface is canonically defined in @telora/daemon-core
+ * and re-exported here for backward compatibility.
+ *
+ * Extracted from guard-engine.ts to improve maintainability.
+ */
+import { getDeliveryIssues, getDeliverySessionCount, } from './supabase.js';
+// ============================================
+// Context Builders
+// ============================================
+/**
+ * Build factory evaluation context from in-memory instance state.
+ *
+ * This is a pure function that builds from already-available data,
+ * avoiding the cross-package DB query problem. The factory engine
+ * calls this with data it already has (instance state, work units,
+ * gate results from its own queries).
+ */
+export function buildFactoryEvaluationContext(params) {
+    const { instanceState, blueprint, workUnits, gateResults, strategyId } = params;
+    // Count work units by status
+    const workUnitsByStatus = {};
+    for (const wu of workUnits) {
+        workUnitsByStatus[wu.status] = (workUnitsByStatus[wu.status] ?? 0) + 1;
+    }
+    // Calculate wall clock seconds
+    let wallClockSeconds = 0;
+    if (instanceState.wallClockStartedAt) {
+        wallClockSeconds = Math.floor((Date.now() - new Date(instanceState.wallClockStartedAt).getTime()) / 1000);
+    }
+    // Convert wall clock limit from hours to seconds
+    const wallClockLimitSeconds = blueprint.maxWallClockHours != null
+        ? blueprint.maxWallClockHours * 3600
+        : null;
+    // Filter gate results by strategy if scoped
+    const scopedGateResults = strategyId
+        ? gateResults.filter(r => r.strategyId === strategyId)
+        : gateResults;
+    // Build configValues for dynamic guard thresholds
+    const configValues = {};
+    if (blueprint.maxInstanceIterations != null) {
+        configValues.max_instance_iterations = blueprint.maxInstanceIterations;
+    }
+    return {
+        // Delivery fields (defaults for factory context)
+        deliveryId: '',
+        openIssueCount: 0,
+        totalIssueCount: 0,
+        issuesByStatus: {},
+        issuesByPriority: {},
+        lastExitCode: 0,
+        sessionCount: 0,
+        // Factory fields
+        gateResults: scopedGateResults,
+        tokensUsed: instanceState.tokensUsed,
+        tokenBudget: blueprint.maxTokenBudget,
+        workUnitsByStatus,
+        totalWorkUnitCount: workUnits.length,
+        cycleCount: instanceState.completionGateIterations,
+        wallClockSeconds,
+        wallClockLimitSeconds,
+        configValues,
+    };
+}
+/**
+ * Build evaluation context by querying current delivery state.
+ */
+export async function buildEvaluationContext(deliveryId, lastExitCode) {
+    const [issues, sessionCount] = await Promise.all([
+        getDeliveryIssues(deliveryId),
+        getDeliverySessionCount(deliveryId),
+    ]);
+    const issuesByStatus = {};
+    const issuesByPriority = {};
+    for (const issue of issues) {
+        issuesByStatus[issue.status] = (issuesByStatus[issue.status] ?? 0) + 1;
+        if (issue.issueType !== 'Context Group') {
+            const priority = 'unknown';
+            issuesByPriority[priority] = (issuesByPriority[priority] ?? 0) + 1;
+        }
+    }
+    const openIssueCount = issues.filter(i => i.status !== 'Done').length;
+    return {
+        deliveryId,
+        openIssueCount,
+        totalIssueCount: issues.length,
+        issuesByStatus,
+        issuesByPriority,
+        lastExitCode,
+        sessionCount,
+    };
+}
+//# sourceMappingURL=evaluation-context.js.map

package/dist/evaluation-context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluation-context.js","sourceRoot":"","sources":["../src/evaluation-context.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EACL,iBAAiB,EACjB,uBAAuB,GACxB,MAAM,eAAe,CAAC;AAMvB,+CAA+C;AAC/C,mBAAmB;AACnB,+CAA+C;AAE/C;;;;;;;GAOG;AACH,MAAM,UAAU,6BAA6B,CAAC,MAe7C;IACC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;IAEhF,6BAA6B;IAC7B,MAAM,iBAAiB,GAA2B,EAAE,CAAC;IACrD,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,iBAAiB,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACzE,CAAC;IAED,+BAA+B;IAC/B,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,IAAI,aAAa,CAAC,kBAAkB,EAAE,CAAC;QACrC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAC3B,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,aAAa,CAAC,kBAAkB,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAC3E,CAAC;IACJ,CAAC;IAED,iDAAiD;IACjD,MAAM,qBAAqB,GAAG,SAAS,CAAC,iBAAiB,IAAI,IAAI;QAC/D,CAAC,CAAC,SAAS,CAAC,iBAAiB,GAAG,IAAI;QACpC,CAAC,CAAC,IAAI,CAAC;IAET,4CAA4C;IAC5C,MAAM,iBAAiB,GAAG,UAAU;QAClC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC;QACtD,CAAC,CAAC,WAAW,CAAC;IAEhB,kDAAkD;IAClD,MAAM,YAAY,GAA2B,EAAE,CAAC;IAChD,IAAI,SAAS,CAAC,qBAAqB,IAAI,IAAI,EAAE,CAAC;QAC5C,YAAY,CAAC,uBAAuB,GAAG,SAAS,CAAC,qBAAqB,CAAC;IACzE,CAAC;IAED,OAAO;QACL,iDAAiD;QACjD,UAAU,EAAE,EAAE;QACd,cAAc,EAAE,CAAC;QACjB,eAAe,EAAE,CAAC;QAClB,cAAc,EAAE,EAAE;QAClB,gBAAgB,EAAE,EAAE;QACpB,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,iBAAiB;QACjB,WAAW,EAAE,iBAAiB;QAC9B,UAAU,EAAE,aAAa,CAAC,UAAU;QACpC,WAAW,EAAE,SAAS,CAAC,cAAc;QACrC,iBAAiB;QACjB,kBAAkB,EAAE,SAAS,CAAC,MAAM;QACpC,UAAU,EAAE,aAAa,CAAC,wBAAwB;QAClD,gBAAgB;QAChB,qBAAqB;QACrB,YAAY;KACb,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,UAAkB,EAClB,YAAoB;IAEpB,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QAC/C,iBAAiB,CAAC,UAAU,CAAC;QAC7B,uBAAuB,CAAC,UAAU,CAAC;KACpC,CAAC,CAAC;IAEH,MAAM,cAAc,GAA2B,EAAE,CAAC;IAClD,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IAEpD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACvE,IAAI,KAAK,CAAC,SAAS,KAAK,eAAe,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,SAAS,CAAC;YAC3B,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;IAEtE,OAAO;QACL,UAAU;QACV,cAAc;QACd,eAAe,EAAE,MAAM,CAAC,MAAM;QAC9B,cAAc;QACd,gBAAgB;QAChB,YAAY;QACZ,YAAY;KACb,CAAC;AACJ,CAAC"}

package/dist/git-activity.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Git activity scanner -- parses git log output and buckets commits by hour.
+ *
+ * Used by the dashboard to render git activity charts for agent sessions.
+ */
+export interface GitActivityBucket {
+    /** ISO 8601 timestamp, floored to the hour boundary. */
+    intervalStart: string;
+    linesAdded: number;
+    linesRemoved: number;
+    commitCount: number;
+}
+/**
+ * Scan a git repository for commit activity since a given timestamp and
+ * return the results bucketed by hour.
+ *
+ * If the git command fails for any reason, returns an empty array.
+ *
+ * @param repoPath  Absolute path to the git repository.
+ * @param since     ISO 8601 timestamp (or any git-compatible date string)
+ *                  to start scanning from.
+ */
+export declare function scanGitActivity(repoPath: string, since: string): GitActivityBucket[];
+//# sourceMappingURL=git-activity.d.ts.map

package/dist/git-activity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"git-activity.d.ts","sourceRoot":"","sources":["../src/git-activity.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,MAAM,WAAW,iBAAiB;IAChC,wDAAwD;IACxD,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;CACrB;AAoBD;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,GACZ,iBAAiB,EAAE,CAkFrB"}

package/dist/git-activity.js

@@ -0,0 +1,97 @@
+/**
+ * Git activity scanner -- parses git log output and buckets commits by hour.
+ *
+ * Used by the dashboard to render git activity charts for agent sessions.
+ */
+import { runGitSync } from './git-types.js';
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+/**
+ * Floor an ISO 8601 date string to the start of its hour.
+ * Returns an ISO string with minutes, seconds, and milliseconds zeroed out.
+ */
+function floorToHour(isoDate) {
+    const d = new Date(isoDate);
+    d.setMinutes(0, 0, 0);
+    return d.toISOString();
+}
+// ---------------------------------------------------------------------------
+// Main scanner
+// ---------------------------------------------------------------------------
+/**
+ * Scan a git repository for commit activity since a given timestamp and
+ * return the results bucketed by hour.
+ *
+ * If the git command fails for any reason, returns an empty array.
+ *
+ * @param repoPath  Absolute path to the git repository.
+ * @param since     ISO 8601 timestamp (or any git-compatible date string)
+ *                  to start scanning from.
+ */
+export function scanGitActivity(repoPath, since) {
+    const result = runGitSync(['log', '--numstat', '--format=COMMIT:%H %aI', `--since=${since}`], repoPath, { timeoutMs: 60_000 });
+    if (!result.success) {
+        return [];
+    }
+    const output = result.output;
+    if (!output) {
+        return [];
+    }
+    // Accumulate per-hour buckets
+    const buckets = new Map();
+    let currentHourKey = null;
+    for (const line of output.split('\n')) {
+        const trimmed = line.trim();
+        if (!trimmed) {
+            continue;
+        }
+        if (trimmed.startsWith('COMMIT:')) {
+            // Format: "COMMIT:<hash> <authorDateISO>"
+            // The hash is 40 hex chars, followed by a space, then the ISO date.
+            const parts = trimmed.slice('COMMIT:'.length).split(' ');
+            // parts[0] = hash, parts[1] = author date ISO 8601
+            const authorDate = parts[1];
+            if (authorDate) {
+                currentHourKey = floorToHour(authorDate);
+                let bucket = buckets.get(currentHourKey);
+                if (!bucket) {
+                    bucket = {
+                        intervalStart: currentHourKey,
+                        linesAdded: 0,
+                        linesRemoved: 0,
+                        commitCount: 0,
+                    };
+                    buckets.set(currentHourKey, bucket);
+                }
+                bucket.commitCount += 1;
+            }
+            continue;
+        }
+        // Numstat line: "<added>\t<removed>\t<filename>"
+        // Binary files show as "-\t-\t<filename>" -- skip those.
+        if (currentHourKey) {
+            const tabParts = trimmed.split('\t');
+            if (tabParts.length >= 3) {
+                const addedStr = tabParts[0];
+                const removedStr = tabParts[1];
+                // Skip binary entries
+                if (addedStr === '-' && removedStr === '-') {
+                    continue;
+                }
+                const added = parseInt(addedStr, 10);
+                const removed = parseInt(removedStr, 10);
+                if (!Number.isNaN(added) && !Number.isNaN(removed)) {
+                    const bucket = buckets.get(currentHourKey);
+                    if (bucket) {
+                        bucket.linesAdded += added;
+                        bucket.linesRemoved += removed;
+                    }
+                }
+            }
+        }
+    }
+    // Sort by intervalStart ascending
+    return Array.from(buckets.values()).sort((a, b) => a.intervalStart.localeCompare(b.intervalStart));
+}
+//# sourceMappingURL=git-activity.js.map

package/dist/git-activity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"git-activity.js","sourceRoot":"","sources":["../src/git-activity.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAc5C,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,WAAW,CAAC,OAAe;IAClC,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5B,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;AACzB,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAgB,EAChB,KAAa;IAEb,MAAM,MAAM,GAAG,UAAU,CACvB,CAAC,KAAK,EAAE,WAAW,EAAE,wBAAwB,EAAE,WAAW,KAAK,EAAE,CAAC,EAClE,QAAQ,EACR,EAAE,SAAS,EAAE,MAAM,EAAE,CACtB,CAAC;IAEF,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,8BAA8B;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAA6B,CAAC;IAErD,IAAI,cAAc,GAAkB,IAAI,CAAC;IAEzC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,SAAS;QACX,CAAC;QAED,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAClC,0CAA0C;YAC1C,oEAAoE;YACpE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACzD,mDAAmD;YACnD,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,UAAU,EAAE,CAAC;gBACf,cAAc,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;gBAEzC,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;gBACzC,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,MAAM,GAAG;wBACP,aAAa,EAAE,cAAc;wBAC7B,UAAU,EAAE,CAAC;wBACb,YAAY,EAAE,CAAC;wBACf,WAAW,EAAE,CAAC;qBACf,CAAC;oBACF,OAAO,CAAC,GAAG,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;gBACtC,CAAC;gBACD,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;YAC1B,CAAC;YACD,SAAS;QACX,CAAC;QAED,iDAAiD;QACjD,yDAAyD;QACzD,IAAI,cAAc,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAE/B,sBAAsB;gBACtB,IAAI,QAAQ,KAAK,GAAG,IAAI,UAAU,KAAK,GAAG,EAAE,CAAC;oBAC3C,SAAS;gBACX,CAAC;gBAED,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;gBACrC,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;gBAEzC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;oBACnD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;oBAC3C,IAAI,MAAM,EAAE,CAAC;wBACX,MAAM,CAAC,UAAU,IAAI,KAAK,CAAC;wBAC3B,MAAM,CAAC,YAAY,IAAI,OAAO,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAChD,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAC/C,CAAC;AACJ,CAAC"}