@autocode-cli/autocode 0.1.14 → 0.1.17

package/dist/core/hierarchy.d.ts

@@ -0,0 +1,97 @@
+/**
+ * Issue Hierarchy Module
+ *
+ * Manages parent-child relationships between issues with depth-first selection.
+ * Columns are identified by NAME (not index):
+ * - BACKLOG: column name contains "backlog"
+ * - DONE: column name is exactly "done"
+ * - WORK: any other column
+ */
+import type { Issue, Column } from '../types/index.js';
+/**
+ * Check if column is a backlog column (name contains "backlog")
+ */
+export declare function isBacklogColumn(column: Column): boolean;
+/**
+ * Check if column is a done column (name is exactly "done")
+ */
+export declare function isDoneColumn(column: Column): boolean;
+/**
+ * Check if column is a work column (not backlog, not done)
+ */
+export declare function isWorkColumn(column: Column): boolean;
+/**
+ * Check if issue is in backlog
+ */
+export declare function isIssueInBacklog(issue: Issue): boolean;
+/**
+ * Check if issue is done
+ */
+export declare function isIssueDone(issue: Issue): boolean;
+/**
+ * Check if issue is in progress (work column)
+ */
+export declare function isIssueInProgress(issue: Issue): boolean;
+/**
+ * Get direct children of an issue
+ */
+export declare function getChildren(rootDir: string, parentKey: string): Issue[];
+/**
+ * Get all descendants (subtree) of an issue recursively
+ */
+export declare function getSubtree(rootDir: string, key: string): Issue[];
+/**
+ * Get ancestors (parent chain) from issue up to root
+ */
+export declare function getAncestors(rootDir: string, key: string): Issue[];
+/**
+ * Get depth of issue in hierarchy (0 = root)
+ */
+export declare function getDepth(rootDir: string, key: string): number;
+/**
+ * Check if setting parentKey as parent of key would create a cycle
+ */
+export declare function wouldCreateCycle(rootDir: string, key: string, proposedParentKey: string): boolean;
+/**
+ * Check if issue can be moved to Done (all descendants must be Done)
+ */
+export declare function isEligibleForCompletion(rootDir: string, key: string): {
+    eligible: boolean;
+    blockers: string[];
+};
+/**
+ * Check if issue can be deleted (no children)
+ */
+export declare function canDeleteIssue(rootDir: string, key: string): {
+    canDelete: boolean;
+    reason?: string;
+};
+/**
+ * Get all issues in the active scope
+ * Active scope = issues in progress + all their descendants
+ */
+export declare function getActiveScope(rootDir: string): Issue[];
+/**
+ * Check if issue is in active scope
+ */
+export declare function isInActiveScope(rootDir: string, key: string): boolean;
+/**
+ * Set parent for an issue (with validation)
+ */
+export declare function setParent(rootDir: string, key: string, parentKey: string | null): {
+    success: boolean;
+    error?: string;
+};
+/**
+ * Find the next actionable issue using depth-first selection
+ *
+ * Rules:
+ * 1. P0 in backlog can preempt active scope (emergency handling)
+ * 2. Select from work columns (not backlog, not done) - deepest eligible first
+ * 3. Backlog is storage only - issues must be manually moved to work columns
+ *
+ * Eligible = not Done AND no non-Done descendants
+ * Tie-breaker: priority, then created_at (FIFO)
+ */
+export declare function findActionableIssueWithHierarchy(rootDir: string): Issue | null;
+//# sourceMappingURL=hierarchy.d.ts.map

package/dist/core/hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy.d.ts","sourceRoot":"","sources":["../../src/core/hierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,EAAY,MAAM,mBAAmB,CAAC;AAgBjE;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAEvD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAEpD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAEpD;AAMD;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAGtD;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAGjD;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAGvD;AAMD;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,KAAK,EAAE,CAGvE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,EAAE,CAahE;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,EAAE,CAelE;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAE7D;AAMD;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,GAAG,OAAO,CAOjG;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG;IAAE,QAAQ,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAAE,CAU/G;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG;IAAE,SAAS,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CASpG;AAMD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,KAAK,EAAE,CAevD;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAGrE;AAMD;;GAEG;AACH,wBAAgB,SAAS,CACvB,OAAO,EAAE,MAAM,EACf,GAAG,EAAE,MAAM,EACX,SAAS,EAAE,MAAM,GAAG,IAAI,GACvB;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,CA2BtC;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,gCAAgC,CAAC,OAAO,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CA2D9E"}

package/dist/core/hierarchy.js

@@ -0,0 +1,274 @@
+/**
+ * Issue Hierarchy Module
+ *
+ * Manages parent-child relationships between issues with depth-first selection.
+ * Columns are identified by NAME (not index):
+ * - BACKLOG: column name contains "backlog"
+ * - DONE: column name is exactly "done"
+ * - WORK: any other column
+ */
+import { getColumnBySlug } from './column.js';
+import { listIssues, getIssue, findIssueDir } from './issue.js';
+import { updateMetadata } from '../services/issue-io.js';
+// ============================================
+// COLUMN IDENTIFICATION (by name, not index)
+// ============================================
+/**
+ * Normalize column name for comparison
+ */
+function normalizeColumnName(name) {
+    return name.toLowerCase().trim();
+}
+/**
+ * Check if column is a backlog column (name contains "backlog")
+ */
+export function isBacklogColumn(column) {
+    return normalizeColumnName(column.name).includes('backlog');
+}
+/**
+ * Check if column is a done column (name is exactly "done")
+ */
+export function isDoneColumn(column) {
+    return normalizeColumnName(column.name) === 'done';
+}
+/**
+ * Check if column is a work column (not backlog, not done)
+ */
+export function isWorkColumn(column) {
+    return !isBacklogColumn(column) && !isDoneColumn(column);
+}
+// ============================================
+// ISSUE STATE HELPERS
+// ============================================
+/**
+ * Check if issue is in backlog
+ */
+export function isIssueInBacklog(issue) {
+    const column = getColumnBySlug(issue.column_slug);
+    return column ? isBacklogColumn(column) : false;
+}
+/**
+ * Check if issue is done
+ */
+export function isIssueDone(issue) {
+    const column = getColumnBySlug(issue.column_slug);
+    return column ? isDoneColumn(column) : false;
+}
+/**
+ * Check if issue is in progress (work column)
+ */
+export function isIssueInProgress(issue) {
+    const column = getColumnBySlug(issue.column_slug);
+    return column ? isWorkColumn(column) : false;
+}
+// ============================================
+// HIERARCHY TRAVERSAL
+// ============================================
+/**
+ * Get direct children of an issue
+ */
+export function getChildren(rootDir, parentKey) {
+    const allIssues = listIssues(rootDir);
+    return allIssues.filter(t => t.parent_key === parentKey);
+}
+/**
+ * Get all descendants (subtree) of an issue recursively
+ */
+export function getSubtree(rootDir, key) {
+    const allIssues = listIssues(rootDir);
+    const descendants = [];
+    const queue = [key];
+    while (queue.length > 0) {
+        const currentKey = queue.shift();
+        const children = allIssues.filter(t => t.parent_key === currentKey);
+        descendants.push(...children);
+        queue.push(...children.map(c => c.key));
+    }
+    return descendants;
+}
+/**
+ * Get ancestors (parent chain) from issue up to root
+ */
+export function getAncestors(rootDir, key) {
+    const ancestors = [];
+    let current = getIssue(rootDir, key);
+    while (current?.parent_key) {
+        const parent = getIssue(rootDir, current.parent_key);
+        if (parent) {
+            ancestors.push(parent);
+            current = parent;
+        }
+        else {
+            break;
+        }
+    }
+    return ancestors;
+}
+/**
+ * Get depth of issue in hierarchy (0 = root)
+ */
+export function getDepth(rootDir, key) {
+    return getAncestors(rootDir, key).length;
+}
+// ============================================
+// VALIDATION
+// ============================================
+/**
+ * Check if setting parentKey as parent of key would create a cycle
+ */
+export function wouldCreateCycle(rootDir, key, proposedParentKey) {
+    // Can't be own parent
+    if (key === proposedParentKey)
+        return true;
+    // Check if proposedParentKey is in the subtree of key
+    const subtree = getSubtree(rootDir, key);
+    return subtree.some(t => t.key === proposedParentKey);
+}
+/**
+ * Check if issue can be moved to Done (all descendants must be Done)
+ */
+export function isEligibleForCompletion(rootDir, key) {
+    const descendants = getSubtree(rootDir, key);
+    const blockers = descendants
+        .filter(t => !isIssueDone(t))
+        .map(t => t.key);
+    return {
+        eligible: blockers.length === 0,
+        blockers,
+    };
+}
+/**
+ * Check if issue can be deleted (no children)
+ */
+export function canDeleteIssue(rootDir, key) {
+    const children = getChildren(rootDir, key);
+    if (children.length > 0) {
+        return {
+            canDelete: false,
+            reason: `Cannot delete: ${children.length} child issue(s) exist`,
+        };
+    }
+    return { canDelete: true };
+}
+// ============================================
+// ACTIVE SCOPE
+// ============================================
+/**
+ * Get all issues in the active scope
+ * Active scope = issues in progress + all their descendants
+ */
+export function getActiveScope(rootDir) {
+    const allIssues = listIssues(rootDir);
+    const inProgressIssues = allIssues.filter(isIssueInProgress);
+    if (inProgressIssues.length === 0)
+        return [];
+    const activeScope = new Set();
+    for (const issue of inProgressIssues) {
+        activeScope.add(issue.key);
+        const subtree = getSubtree(rootDir, issue.key);
+        subtree.forEach(t => activeScope.add(t.key));
+    }
+    return allIssues.filter(t => activeScope.has(t.key));
+}
+/**
+ * Check if issue is in active scope
+ */
+export function isInActiveScope(rootDir, key) {
+    const activeScope = getActiveScope(rootDir);
+    return activeScope.some(t => t.key === key);
+}
+// ============================================
+// MODIFICATION
+// ============================================
+/**
+ * Set parent for an issue (with validation)
+ */
+export function setParent(rootDir, key, parentKey) {
+    const issue = getIssue(rootDir, key);
+    if (!issue) {
+        return { success: false, error: `Issue '${key}' not found` };
+    }
+    if (parentKey !== null) {
+        // Validate parent exists
+        const parent = getIssue(rootDir, parentKey);
+        if (!parent) {
+            return { success: false, error: `Parent issue '${parentKey}' not found` };
+        }
+        // Check for cycles
+        if (wouldCreateCycle(rootDir, key, parentKey)) {
+            return { success: false, error: 'Cannot set parent: would create a cycle' };
+        }
+    }
+    // Update the issue's parent_key
+    const issueDir = findIssueDir(rootDir, key);
+    if (!issueDir) {
+        return { success: false, error: `Issue directory for '${key}' not found` };
+    }
+    updateMetadata(issueDir, { parent_key: parentKey });
+    return { success: true };
+}
+// ============================================
+// ACTIONABLE ISSUE SELECTION (depth-first)
+// ============================================
+/**
+ * Find the next actionable issue using depth-first selection
+ *
+ * Rules:
+ * 1. P0 in backlog can preempt active scope (emergency handling)
+ * 2. Select from work columns (not backlog, not done) - deepest eligible first
+ * 3. Backlog is storage only - issues must be manually moved to work columns
+ *
+ * Eligible = not Done AND no non-Done descendants
+ * Tie-breaker: priority, then created_at (FIFO)
+ */
+export function findActionableIssueWithHierarchy(rootDir) {
+    const allIssues = listIssues(rootDir);
+    // 1. Check for P0 in backlog (preemption for emergencies)
+    const backlogP0 = allIssues.filter(t => t.parent_key === null &&
+        t.priority === 'P0' &&
+        isIssueInBacklog(t));
+    if (backlogP0.length > 0) {
+        return backlogP0.sort((a, b) => new Date(a.created_at).getTime() - new Date(b.created_at).getTime())[0];
+    }
+    // 2. Select from work columns (qualification, in-progress, testing, review, etc.)
+    // Backlog is storage - user must manually move issues to work columns
+    const workIssues = allIssues.filter(isIssueInProgress);
+    if (workIssues.length === 0) {
+        // No issues in work columns - nothing to do
+        // User must manually move issues from backlog to qualification
+        return null;
+    }
+    // Build active scope: work issues + all descendants
+    const activeScope = new Set();
+    for (const t of workIssues) {
+        activeScope.add(t.key);
+        getSubtree(rootDir, t.key).forEach(d => activeScope.add(d.key));
+    }
+    // Filter eligible: not Done AND no non-Done descendants
+    const eligible = allIssues.filter(t => {
+        if (!activeScope.has(t.key))
+            return false;
+        if (isIssueDone(t))
+            return false;
+        const subtree = getSubtree(rootDir, t.key);
+        return subtree.length === 0 || subtree.every(isIssueDone);
+    });
+    if (eligible.length === 0) {
+        // All work issues are done or waiting for children - nothing to do
+        return null;
+    }
+    return eligible.sort((a, b) => {
+        // Deepest first
+        const depthDiff = getDepth(rootDir, b.key) - getDepth(rootDir, a.key);
+        if (depthDiff !== 0)
+            return depthDiff;
+        // Priority
+        const prio = { P0: 0, P1: 1, P2: 2, P3: 3 };
+        const prioDiff = prio[a.priority] - prio[b.priority];
+        if (prioDiff !== 0)
+            return prioDiff;
+        // Created at (FIFO)
+        return new Date(a.created_at).getTime() - new Date(b.created_at).getTime();
+    })[0];
+}
+//# sourceMappingURL=hierarchy.js.map

package/dist/core/hierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy.js","sourceRoot":"","sources":["../../src/core/hierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEzD,+CAA+C;AAC/C,6CAA6C;AAC7C,+CAA+C;AAE/C;;GAEG;AACH,SAAS,mBAAmB,CAAC,IAAY;IACvC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;AACnC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,OAAO,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,OAAO,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;AACrD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;AAC3D,CAAC;AAED,+CAA+C;AAC/C,sBAAsB;AACtB,+CAA+C;AAE/C;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAY;IAC3C,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAY;IACtC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAY;IAC5C,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAC/C,CAAC;AAED,+CAA+C;AAC/C,sBAAsB;AACtB,+CAA+C;AAE/C;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,OAAe,EAAE,SAAiB;IAC5D,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IACtC,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC;AAC3D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,OAAe,EAAE,GAAW;IACrD,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,WAAW,GAAY,EAAE,CAAC;IAChC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAClC,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CAAC;QACpE,WAAW,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe,EAAE,GAAW;IACvD,MAAM,SAAS,GAAY,EAAE,CAAC;IAC9B,IAAI,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAErC,OAAO,OAAO,EAAE,UAAU,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;QACrD,IAAI,MAAM,EAAE,CAAC;YACX,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO,GAAG,MAAM,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,OAAe,EAAE,GAAW;IACnD,OAAO,YAAY,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;AAC3C,CAAC;AAED,+CAA+C;AAC/C,aAAa;AACb,+CAA+C;AAE/C;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe,EAAE,GAAW,EAAE,iBAAyB;IACtF,sBAAsB;IACtB,IAAI,GAAG,KAAK,iBAAiB;QAAE,OAAO,IAAI,CAAC;IAE3C,sDAAsD;IACtD,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACzC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,iBAAiB,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CAAC,OAAe,EAAE,GAAW;IAClE,MAAM,WAAW,GAAG,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,WAAW;SACzB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SAC5B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEnB,OAAO;QACL,QAAQ,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC;QAC/B,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe,EAAE,GAAW;IACzD,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC3C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,OAAO;YACL,SAAS,EAAE,KAAK;YAChB,MAAM,EAAE,kBAAkB,QAAQ,CAAC,MAAM,uBAAuB;SACjE,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAC7B,CAAC;AAED,+CAA+C;AAC/C,eAAe;AACf,+CAA+C;AAE/C;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe;IAC5C,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,gBAAgB,GAAG,SAAS,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAE7D,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IAEtC,KAAK,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;QACrC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/C,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe,EAAE,GAAW;IAC1D,MAAM,WAAW,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IAC5C,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;AAC9C,CAAC;AAED,+CAA+C;AAC/C,eAAe;AACf,+CAA+C;AAE/C;;GAEG;AACH,MAAM,UAAU,SAAS,CACvB,OAAe,EACf,GAAW,EACX,SAAwB;IAExB,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,GAAG,aAAa,EAAE,CAAC;IAC/D,CAAC;IAED,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QACvB,yBAAyB;QACzB,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,iBAAiB,SAAS,aAAa,EAAE,CAAC;QAC5E,CAAC;QAED,mBAAmB;QACnB,IAAI,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,CAAC;YAC9C,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,yCAAyC,EAAE,CAAC;QAC9E,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC5C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,wBAAwB,GAAG,aAAa,EAAE,CAAC;IAC7E,CAAC;IAED,cAAc,CAAC,QAAQ,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC;IACpD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC3B,CAAC;AAED,+CAA+C;AAC/C,2CAA2C;AAC3C,+CAA+C;AAE/C;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gCAAgC,CAAC,OAAe;IAC9D,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IAEtC,0DAA0D;IAC1D,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACrC,CAAC,CAAC,UAAU,KAAK,IAAI;QACrB,CAAC,CAAC,QAAQ,KAAK,IAAI;QACnB,gBAAgB,CAAC,CAAC,CAAC,CACpB,CAAC;IAEF,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC7B,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CACpE,CAAC,CAAC,CAAC,CAAC;IACP,CAAC;IAED,kFAAkF;IAClF,sEAAsE;IACtE,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAEvD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,4CAA4C;QAC5C,+DAA+D;QAC/D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oDAAoD;IACpD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvB,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,wDAAwD;IACxD,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAC1C,IAAI,WAAW,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACjC,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3C,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,mEAAmE;QACnE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC5B,gBAAgB;QAChB,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACtE,IAAI,SAAS,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAEtC,WAAW;QACX,MAAM,IAAI,GAA6B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACtE,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACrD,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAEpC,oBAAoB;QACpB,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;IAC7E,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACR,CAAC"}

package/dist/core/issue.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Issue CRUD operations - Multi-file structure
+ */
+import type { Issue, IssueCreateInput, IssueUpdateInput } from '../types/index.js';
+/**
+ * Find an issue directory by its key
+ */
+export declare function findIssueDir(rootDir: string, key: string): string | null;
+/**
+ * Find an issue path by its key (for backwards compatibility)
+ * @deprecated Use findIssueDir instead
+ */
+export declare function findIssuePath(rootDir: string, key: string): string | null;
+/**
+ * Get an issue by its key
+ */
+export declare function getIssue(rootDir: string, key: string): Issue | null;
+/**
+ * Create a new issue
+ */
+export declare function createIssue(rootDir: string, input: IssueCreateInput): Issue;
+/**
+ * Update an issue
+ */
+export declare function updateIssue(rootDir: string, key: string, updates: IssueUpdateInput): Issue | null;
+/**
+ * Add a comment to an issue
+ */
+export declare function addComment(rootDir: string, key: string, text: string, column?: string, source?: 'user' | 'claude'): Issue | null;
+/**
+ * Move an issue to a new column
+ */
+export declare function moveIssue(rootDir: string, key: string, toColumnSlug: string, force?: boolean): Issue | null;
+/**
+ * Move an issue to the next column
+ */
+export declare function nextIssue(rootDir: string, key: string): Issue | null;
+/**
+ * List all issues
+ */
+export declare function listIssues(rootDir: string): Issue[];
+/**
+ * List issues in a specific column
+ */
+export declare function listIssuesInColumn(rootDir: string, columnSlug: string): Issue[];
+/**
+ * Find the first actionable issue (for Claude processing)
+ *
+ * Uses hierarchical depth-first selection:
+ * 1. P0 in backlog can preempt active scope
+ * 2. If active scope exists, select deepest eligible issue
+ * 3. If no active scope, select from backlog roots by priority
+ */
+export declare function findActionableIssue(rootDir: string): Issue | null;
+/**
+ * Delete an issue (blocked if has children)
+ */
+export declare function deleteIssue(rootDir: string, key: string): {
+    success: boolean;
+    error?: string;
+};
+//# sourceMappingURL=issue.d.ts.map

package/dist/core/issue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"issue.d.ts","sourceRoot":"","sources":["../../src/core/issue.ts"],"names":[],"mappings":"AAAA;;GAEG;AAyBH,OAAO,KAAK,EAAE,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,EAAY,MAAM,mBAAmB,CAAC;AAE7F;;GAEG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAiBxE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAIzE;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAKnE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,GAAG,KAAK,CA2C3E;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,GAAG,KAAK,GAAG,IAAI,CA0BjG;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,GAAE,MAAM,GAAG,QAAiB,GAAG,KAAK,GAAG,IAAI,CAWxI;AAED;;GAEG;AACH,wBAAgB,SAAS,CACvB,OAAO,EAAE,MAAM,EACf,GAAG,EAAE,MAAM,EACX,YAAY,EAAE,MAAM,EACpB,KAAK,UAAQ,GACZ,KAAK,GAAG,IAAI,CA8Bd;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAWpE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,KAAK,EAAE,CAoBnD;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,KAAK,EAAE,CAiB/E;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAEjE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,CAa9F"}