@bhimudev/gnanai 0.4.0

package/dist/utils/dependency-analysis.js

@@ -0,0 +1,298 @@
+/**
+ * Error thrown when cyclic dependencies are detected among tasks.
+ */
+export class CyclicDependencyError extends Error {
+    /** The task IDs forming the cycle */
+    cycle;
+    constructor(cycle) {
+        const cycleStr = cycle.join(' -> ');
+        super(`Cyclic dependency detected: ${cycleStr}`);
+        this.name = 'CyclicDependencyError';
+        this.cycle = cycle;
+    }
+}
+/**
+ * Normalize a filesystem path for comparison.
+ */
+export function normalizePath(p) {
+    const backslashRe = new RegExp('\\\\', 'g');
+    const dotSlashRe = new RegExp('^\\.\\/');
+    let result = p
+        .trim()
+        .replace(backslashRe, '/')
+        .replace(dotSlashRe, '')
+        .toLowerCase();
+    if (!result.endsWith('/')) {
+        result += '/';
+    }
+    return result;
+}
+/**
+ * Parse affected area paths from a task body markdown.
+ * Returns null if no Affected Areas section found, or string[] of normalized paths.
+ */
+export function parseAffectedAreas(body) {
+    const headingRe = new RegExp('^#{2,3}\\s+affected\\s+areas\\s*$', 'im');
+    const match = headingRe.exec(body);
+    if (!match)
+        return null;
+    // Extract content between this heading and the next heading (or end of string)
+    const startIdx = match.index + match[0].length;
+    const nextHeadingRe = new RegExp('^#{2,}\\s', 'm');
+    const restOfBody = body.slice(startIdx);
+    const nextMatch = nextHeadingRe.exec(restOfBody);
+    const sectionContent = nextMatch ? restOfBody.slice(0, nextMatch.index) : restOfBody;
+    // Extract paths from bullet lines
+    const paths = [];
+    const bulletRe = new RegExp('^[-*]\\s+(.+)$', 'gm');
+    const backtickRe = new RegExp('`([^`]+)`');
+    const descStripRe = new RegExp('\\s+(--|—|–).*$');
+    let bulletMatch;
+    while ((bulletMatch = bulletRe.exec(sectionContent)) !== null) {
+        const lineContent = bulletMatch[1];
+        // Try backtick-wrapped path first
+        const btMatch = backtickRe.exec(lineContent);
+        if (btMatch) {
+            paths.push(normalizePath(btMatch[1]));
+        }
+        else {
+            // Bare path: strip description after -- or em-dash/en-dash
+            const barePath = lineContent.replace(descStripRe, '').trim();
+            if (barePath) {
+                paths.push(normalizePath(barePath));
+            }
+        }
+    }
+    return paths;
+}
+/**
+ * Check if two sets of paths have hierarchical overlap.
+ * Paths should already be normalized (trailing slash, lowercase).
+ */
+export function pathsOverlap(pathsA, pathsB) {
+    for (const a of pathsA) {
+        for (const b of pathsB) {
+            // Exact match or one is a prefix of the other
+            // With trailing slashes, prefix check handles parent-child correctly:
+            // src/utils/ startsWith src/utils/ (exact)
+            // src/utils/worktree/ startsWith src/utils/ (child)
+            // src/utils/ does NOT startsWith src/utilsExtra/ (partial name)
+            if (a === b || a.startsWith(b) || b.startsWith(a)) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Detect cycles in the dependency graph using iterative DFS (three-color).
+ * Returns the cycle path as an array, or null if no cycles.
+ */
+function detectCycles(taskIds, adjacency) {
+    const WHITE = 0, GRAY = 1, BLACK = 2;
+    const color = new Map();
+    const parent = new Map();
+    for (const id of taskIds) {
+        color.set(id, WHITE);
+    }
+    for (const startId of taskIds) {
+        if (color.get(startId) !== WHITE)
+            continue;
+        const stack = [[startId, false]];
+        parent.set(startId, null);
+        while (stack.length > 0) {
+            const [nodeId, isBacktrack] = stack.pop();
+            if (isBacktrack) {
+                color.set(nodeId, BLACK);
+                continue;
+            }
+            if (color.get(nodeId) === GRAY || color.get(nodeId) === BLACK) {
+                continue;
+            }
+            color.set(nodeId, GRAY);
+            stack.push([nodeId, true]);
+            const neighbors = adjacency.get(nodeId) ?? new Set();
+            for (const neighbor of neighbors) {
+                if (!color.has(neighbor))
+                    continue;
+                if (color.get(neighbor) === GRAY) {
+                    // Cycle found - reconstruct path
+                    return reconstructCyclePath(parent, nodeId, neighbor);
+                }
+                if (color.get(neighbor) === WHITE) {
+                    parent.set(neighbor, nodeId);
+                    stack.push([neighbor, false]);
+                }
+            }
+        }
+    }
+    return null;
+}
+function reconstructCyclePath(parent, current, cycleTarget) {
+    const path = [];
+    let node = current;
+    while (node !== null && node !== cycleTarget) {
+        path.push(node);
+        node = parent.get(node) ?? null;
+    }
+    path.push(cycleTarget);
+    path.reverse();
+    path.push(cycleTarget);
+    return path;
+}
+/**
+ * Produce topological levels using Kahn's algorithm.
+ * Returns array of arrays, where each sub-array is a level of task IDs.
+ */
+function topologicalLevels(taskIds, adjacency) {
+    // Build in-degree map (only for task IDs in the input)
+    const inDegree = new Map();
+    for (const id of taskIds) {
+        inDegree.set(id, 0);
+    }
+    for (const [from, neighbors] of adjacency) {
+        if (!inDegree.has(from))
+            continue;
+        for (const to of neighbors) {
+            if (!inDegree.has(to))
+                continue;
+            inDegree.set(to, (inDegree.get(to) ?? 0) + 1);
+        }
+    }
+    // Start with all zero-in-degree nodes
+    let currentLevel = taskIds.filter(id => inDegree.get(id) === 0);
+    const levels = [];
+    let processed = 0;
+    while (currentLevel.length > 0) {
+        levels.push(currentLevel);
+        processed += currentLevel.length;
+        const nextLevel = [];
+        for (const nodeId of currentLevel) {
+            const neighbors = adjacency.get(nodeId) ?? new Set();
+            for (const neighbor of neighbors) {
+                if (!inDegree.has(neighbor))
+                    continue;
+                const newDeg = (inDegree.get(neighbor) ?? 1) - 1;
+                inDegree.set(neighbor, newDeg);
+                if (newDeg === 0) {
+                    nextLevel.push(neighbor);
+                }
+            }
+        }
+        currentLevel = nextLevel;
+    }
+    // Defensive check (critical reviewer recommendation #2)
+    if (processed !== taskIds.length) {
+        throw new Error(`Internal error: topological sort processed ${processed}/${taskIds.length} tasks`);
+    }
+    return levels;
+}
+/**
+ * Split tasks at a single topological level into non-conflicting execution groups.
+ * Tasks with null affected areas are isolated into singleton sequential groups.
+ * Tasks with defined areas are grouped using greedy bin-packing: each task is placed
+ * in the first bin that has no path overlap, or a new bin is created.
+ */
+function splitByConflicts(tasks, affectedAreasMap) {
+    const groups = [];
+    // Separate tasks with null areas (singletons) from those with defined areas
+    const nullAreaTasks = [];
+    const definedAreaTasks = [];
+    for (const task of tasks) {
+        const areas = affectedAreasMap.get(task.frontmatter.id);
+        if (areas === null || areas === undefined) {
+            nullAreaTasks.push(task);
+        }
+        else {
+            definedAreaTasks.push(task);
+        }
+    }
+    // Null-area tasks go first as singletons (front-load risk)
+    for (const task of nullAreaTasks) {
+        groups.push({ tasks: [task], parallel: false });
+    }
+    // Greedy bin-packing for defined-area tasks
+    // Each bin tracks its aggregated paths
+    const bins = [];
+    for (const task of definedAreaTasks) {
+        const taskPaths = affectedAreasMap.get(task.frontmatter.id) ?? [];
+        let placed = false;
+        for (const bin of bins) {
+            if (!pathsOverlap(bin.paths, taskPaths)) {
+                bin.tasks.push(task);
+                bin.paths.push(...taskPaths);
+                placed = true;
+                break;
+            }
+        }
+        if (!placed) {
+            bins.push({ tasks: [task], paths: [...taskPaths] });
+        }
+    }
+    // Convert bins to ExecutionGroups
+    for (const bin of bins) {
+        groups.push({
+            tasks: bin.tasks,
+            parallel: bin.tasks.length > 1,
+        });
+    }
+    return groups;
+}
+/**
+ * Build an execution graph from task specs.
+ * Returns an ordered list of execution groups where tasks within a group
+ * are independent (can run in parallel) and groups must execute sequentially.
+ *
+ * Note: Only `depends_on` is consulted for explicit dependencies.
+ * The `blocks` field is not used by this function.
+ */
+export function buildExecutionGraph(tasks) {
+    // Edge case: empty input
+    if (tasks.length === 0)
+        return [];
+    // Build task ID map, validate no duplicates
+    const idMap = new Map();
+    for (const task of tasks) {
+        const id = task.frontmatter.id;
+        if (idMap.has(id)) {
+            throw new Error(`Duplicate task ID: ${id}`);
+        }
+        idMap.set(id, task);
+    }
+    const taskIds = [...idMap.keys()];
+    // Build adjacency list from explicit depends_on
+    // Edge direction: depId -> taskId (depId must complete before taskId)
+    const adjacency = new Map();
+    for (const id of taskIds) {
+        adjacency.set(id, new Set());
+    }
+    for (const task of tasks) {
+        for (const depId of task.frontmatter.depends_on) {
+            // Only add edge if the dependency is in our task set (silently ignore unresolved refs)
+            if (adjacency.has(depId)) {
+                adjacency.get(depId).add(task.frontmatter.id);
+            }
+        }
+    }
+    // Detect cycles
+    const cyclePath = detectCycles(taskIds, adjacency);
+    if (cyclePath) {
+        throw new CyclicDependencyError(cyclePath);
+    }
+    // Topological sort to produce levels
+    const levels = topologicalLevels(taskIds, adjacency);
+    // Parse affected areas for each task
+    const affectedAreasMap = new Map();
+    for (const task of tasks) {
+        affectedAreasMap.set(task.frontmatter.id, parseAffectedAreas(task.body));
+    }
+    // Within each level, split by module-overlap conflicts
+    const result = [];
+    for (const level of levels) {
+        const levelTasks = level.map(id => idMap.get(id));
+        const subGroups = splitByConflicts(levelTasks, affectedAreasMap);
+        result.push(...subGroups);
+    }
+    return result;
+}
+//# sourceMappingURL=dependency-analysis.js.map

package/dist/utils/dependency-analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-analysis.js","sourceRoot":"","sources":["../../src/utils/dependency-analysis.ts"],"names":[],"mappings":"AAGA;;GAEG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9C,qCAAqC;IACrB,KAAK,CAAW;IAEhC,YAAY,KAAe;QACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,KAAK,CAAC,+BAA+B,QAAQ,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,CAAS;IACrC,MAAM,WAAW,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC;IACzC,IAAI,MAAM,GAAG,CAAC;SACX,IAAI,EAAE;SACN,OAAO,CAAC,WAAW,EAAE,GAAG,CAAC;SACzB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,WAAW,EAAE,CAAC;IACjB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,mCAAmC,EAAE,IAAI,CAAC,CAAC;IACxE,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IAExB,+EAA+E;IAC/E,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/C,MAAM,aAAa,GAAG,IAAI,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACjD,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IAErF,kCAAkC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC;IACpD,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,WAAW,CAAC,CAAC;IAC3C,MAAM,WAAW,GAAG,IAAI,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAClD,IAAI,WAAmC,CAAC;IACxC,OAAO,CAAC,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC9D,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QACnC,kCAAkC;QAClC,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC7C,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,2DAA2D;YAC3D,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAC7D,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,MAAgB,EAAE,MAAgB;IAC7D,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,8CAA8C;YAC9C,sEAAsE;YACtE,2CAA2C;YAC3C,oDAAoD;YACpD,gEAAgE;YAChE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClD,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CACnB,OAAiB,EACjB,SAAmC;IAEnC,MAAM,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEhD,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACvB,CAAC;IAED,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK;YAAE,SAAS;QAE3C,MAAM,KAAK,GAA6B,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAE3C,IAAI,WAAW,EAAE,CAAC;gBAChB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,EAAE,CAAC;gBAC9D,SAAS;YACX,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;YAE3B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YAC7D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBAEnC,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;oBACjC,iCAAiC;oBACjC,OAAO,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;gBACxD,CAAC;gBAED,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC;oBAClC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,oBAAoB,CAC3B,MAAkC,EAClC,OAAe,EACf,WAAmB;IAEnB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,IAAI,GAAkB,OAAO,CAAC;IAElC,OAAO,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;QAC7C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvB,IAAI,CAAC,OAAO,EAAE,CAAC;IACf,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAEvB,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CACxB,OAAiB,EACjB,SAAmC;IAEnC,uDAAuD;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAClC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAChC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IAChE,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1B,SAAS,IAAI,YAAY,CAAC,MAAM,CAAC;QACjC,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YAC7D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBACtC,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC/B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACjB,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QAED,YAAY,GAAG,SAAS,CAAC;IAC3B,CAAC;IAED,wDAAwD;IACxD,IAAI,SAAS,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,8CAA8C,SAAS,IAAI,OAAO,CAAC,MAAM,QAAQ,CAAC,CAAC;IACrG,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CACvB,KAAiB,EACjB,gBAA8C;IAE9C,MAAM,MAAM,GAAqB,EAAE,CAAC;IAEpC,4EAA4E;IAC5E,MAAM,aAAa,GAAe,EAAE,CAAC;IACrC,MAAM,gBAAgB,GAAe,EAAE,CAAC;IAExC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACxD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC1C,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;aAAM,CAAC;YACN,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC;IAED,4CAA4C;IAC5C,uCAAuC;IACvC,MAAM,IAAI,GAA6C,EAAE,CAAC;IAE1D,KAAK,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;QACpC,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAClE,IAAI,MAAM,GAAG,KAAK,CAAC;QAEnB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;gBACxC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;gBAC7B,MAAM,GAAG,IAAI,CAAC;gBACd,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC;YACV,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;SAC/B,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAiB;IACnD,yBAAyB;IACzB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,4CAA4C;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAElC,gDAAgD;IAChD,sEAAsE;IACtE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC;YAChD,uFAAuF;YACvF,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,SAAS,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IAED,gBAAgB;IAChB,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IACnD,IAAI,SAAS,EAAE,CAAC;QACd,MAAM,IAAI,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,qCAAqC;IACrC,MAAM,MAAM,GAAG,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAErD,qCAAqC;IACrC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA2B,CAAC;IAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,uDAAuD;IACvD,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,gBAAgB,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;QACjE,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/utils/detect-git.d.ts

@@ -0,0 +1,57 @@
+import type { GitConfig, GitignoreValidation, GitPatterns } from '../types/index.js';
+/**
+ * Check if the current directory is a Git repository.
+ */
+export declare function detectGitRepo(): Promise<boolean>;
+/**
+ * Check if the current directory is inside a linked git worktree.
+ * Returns true if .git is a file (linked worktree), false if directory (main repo) or missing.
+ */
+export declare function isWorktree(): Promise<boolean>;
+/**
+ * Discover Git defaults by running local git commands.
+ * No network calls are made.
+ */
+export declare function discoverGitDefaults(): Promise<GitConfig>;
+/**
+ * Validate that .gitignore contains all required archai entries.
+ */
+export declare function validateGitignore(): Promise<GitignoreValidation>;
+/**
+ * Fix .gitignore by appending missing archai entries.
+ */
+export declare function fixGitignore(missing: string[]): Promise<void>;
+/**
+ * Parse git for-each-ref output into cleaned branch names.
+ * Strips remote prefixes, deduplicates, and filters HEAD pointers.
+ */
+export declare function parseBranchNames(rawOutput: string): string[];
+/**
+ * Classify branch names by their prefix (first path segment before /).
+ * Returns a map of prefix/ -> count for all branches containing a slash.
+ */
+export declare function classifyBranchPrefixes(branches: string[]): Map<string, number>;
+/**
+ * Parse git log output (format: %H %P\n%s) to detect merge commits and PR platforms.
+ */
+export declare function parseMergeCommits(rawLogOutput: string): {
+    mergeCount: number;
+    totalCount: number;
+    prPlatform: 'github' | 'gitlab' | 'bitbucket' | 'azure' | null;
+    usesPRs: boolean;
+};
+/**
+ * Determine the dominant merge strategy based on merge commit ratio.
+ */
+export declare function determineMergeStrategy(mergeCount: number, totalCount: number): GitPatterns['mergeStrategy'];
+/**
+ * Build the agent branch naming convention based on detected patterns.
+ */
+export declare function buildAgentConvention(topPrefix: string, isUsernamePattern: boolean, isJiraPattern: boolean): string;
+/**
+ * Detect git branching and merge patterns from repository history.
+ * Analyzes branch names (up to 100) and merge commits (up to 200).
+ * Never throws -- returns sensible defaults on any error.
+ */
+export declare function detectGitPatterns(projectRoot?: string): Promise<GitPatterns>;
+//# sourceMappingURL=detect-git.d.ts.map

package/dist/utils/detect-git.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect-git.d.ts","sourceRoot":"","sources":["../../src/utils/detect-git.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,SAAS,EAAE,mBAAmB,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAarF;;GAEG;AACH,wBAAsB,aAAa,IAAI,OAAO,CAAC,OAAO,CAAC,CAEtD;AAED;;;GAGG;AACH,wBAAsB,UAAU,IAAI,OAAO,CAAC,OAAO,CAAC,CAOnD;AAoBD;;;GAGG;AACH,wBAAsB,mBAAmB,IAAI,OAAO,CAAC,SAAS,CAAC,CAwF9D;AAED;;GAEG;AACH,wBAAsB,iBAAiB,IAAI,OAAO,CAAC,mBAAmB,CAAC,CAiBtE;AAED;;GAEG;AACH,wBAAsB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAmBnE;AAkBD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAkE5D;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAY9E;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,YAAY,EAAE,MAAM,GAAG;IACvD,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,QAAQ,GAAG,QAAQ,GAAG,WAAW,GAAG,OAAO,GAAG,IAAI,CAAC;IAC/D,OAAO,EAAE,OAAO,CAAC;CAClB,CAsDA;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,GACjB,WAAW,CAAC,eAAe,CAAC,CAW9B;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,SAAS,EAAE,MAAM,EACjB,iBAAiB,EAAE,OAAO,EAC1B,aAAa,EAAE,OAAO,GACrB,MAAM,CAcR;AAED;;;;GAIG;AACH,wBAAsB,iBAAiB,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,CAgGlF"}