@cleocode/cleo 2026.2.5

package/dist/core/tasks/dependency-check.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Dependency checking - validate task dependency graphs.
+ * Ported from lib/tasks/dependency-check.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '../../types/task.js';
+/** Result of a dependency validation check. */
+export interface DependencyCheckResult {
+    valid: boolean;
+    errors: DependencyError[];
+    warnings: DependencyWarning[];
+}
+/** A dependency error. */
+export interface DependencyError {
+    code: string;
+    taskId: string;
+    message: string;
+    relatedIds?: string[];
+}
+/** A dependency warning. */
+export interface DependencyWarning {
+    code: string;
+    taskId: string;
+    message: string;
+}
+/**
+ * Detect circular dependencies using DFS.
+ * Returns the cycle path if found, empty array otherwise.
+ */
+export declare function detectCircularDeps(taskId: string, tasks: Task[]): string[];
+/**
+ * Check if adding a dependency would create a cycle.
+ */
+export declare function wouldCreateCycle(fromId: string, toId: string, tasks: Task[]): boolean;
+/**
+ * Get tasks that are blocked (have unmet dependencies).
+ */
+export declare function getBlockedTasks(tasks: Task[]): Task[];
+/**
+ * Get tasks that are ready (all dependencies met).
+ */
+export declare function getReadyTasks(tasks: Task[]): Task[];
+/**
+ * Get tasks that depend on a given task.
+ */
+export declare function getDependents(taskId: string, tasks: Task[]): Task[];
+/**
+ * Get dependent IDs.
+ */
+export declare function getDependentIds(taskId: string, tasks: Task[]): string[];
+/**
+ * Get unresolved dependencies for a task (deps that are not done/cancelled).
+ */
+export declare function getUnresolvedDeps(taskId: string, tasks: Task[]): string[];
+/**
+ * Validate dependencies for missing references.
+ */
+export declare function validateDependencyRefs(tasks: Task[]): DependencyError[];
+/**
+ * Full dependency graph validation.
+ */
+export declare function validateDependencies(tasks: Task[]): DependencyCheckResult;
+/**
+ * Topological sort of tasks by dependencies.
+ * Returns sorted task IDs or null if cycle detected.
+ */
+export declare function topologicalSort(tasks: Task[]): string[] | null;
+//# sourceMappingURL=dependency-check.d.ts.map

package/dist/core/tasks/dependency-check.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-check.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/dependency-check.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAEhD,+CAA+C;AAC/C,MAAM,WAAW,qBAAqB;IACpC,KAAK,EAAE,OAAO,CAAC;IACf,MAAM,EAAE,eAAe,EAAE,CAAC;IAC1B,QAAQ,EAAE,iBAAiB,EAAE,CAAC;CAC/B;AAED,0BAA0B;AAC1B,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,4BAA4B;AAC5B,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,IAAI,EAAE,GACZ,MAAM,EAAE,CAgCV;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,IAAI,EAAE,GACZ,OAAO,CAST;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAUrD;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAUnD;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAEnE;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAEvE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CASzE;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,eAAe,EAAE,CAmBvE;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,qBAAqB,CAwDzE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CA0C9D"}

package/dist/core/tasks/dependency-check.js

@@ -0,0 +1,226 @@
+/**
+ * Dependency checking - validate task dependency graphs.
+ * Ported from lib/tasks/dependency-check.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+/**
+ * Detect circular dependencies using DFS.
+ * Returns the cycle path if found, empty array otherwise.
+ */
+export function detectCircularDeps(taskId, tasks) {
+    const taskMap = new Map(tasks.map((t) => [t.id, t]));
+    const visited = new Set();
+    const recursionStack = new Set();
+    const path = [];
+    function dfs(id) {
+        visited.add(id);
+        recursionStack.add(id);
+        path.push(id);
+        const task = taskMap.get(id);
+        if (task?.depends) {
+            for (const depId of task.depends) {
+                if (!visited.has(depId)) {
+                    const cycle = dfs(depId);
+                    if (cycle.length > 0)
+                        return cycle;
+                }
+                else if (recursionStack.has(depId)) {
+                    // Found cycle - return path from depId to current + depId
+                    const cycleStart = path.indexOf(depId);
+                    return [...path.slice(cycleStart), depId];
+                }
+            }
+        }
+        path.pop();
+        recursionStack.delete(id);
+        return [];
+    }
+    return dfs(taskId);
+}
+/**
+ * Check if adding a dependency would create a cycle.
+ */
+export function wouldCreateCycle(fromId, toId, tasks) {
+    // Temporarily add the dependency and check
+    const modified = tasks.map((t) => {
+        if (t.id === fromId) {
+            return { ...t, depends: [...(t.depends ?? []), toId] };
+        }
+        return t;
+    });
+    return detectCircularDeps(fromId, modified).length > 0;
+}
+/**
+ * Get tasks that are blocked (have unmet dependencies).
+ */
+export function getBlockedTasks(tasks) {
+    const completedIds = new Set(tasks.filter((t) => t.status === 'done' || t.status === 'cancelled').map((t) => t.id));
+    return tasks.filter((t) => {
+        if (!t.depends?.length)
+            return false;
+        if (t.status === 'done' || t.status === 'cancelled')
+            return false;
+        return t.depends.some((depId) => !completedIds.has(depId));
+    });
+}
+/**
+ * Get tasks that are ready (all dependencies met).
+ */
+export function getReadyTasks(tasks) {
+    const completedIds = new Set(tasks.filter((t) => t.status === 'done' || t.status === 'cancelled').map((t) => t.id));
+    return tasks.filter((t) => {
+        if (t.status === 'done' || t.status === 'cancelled')
+            return false;
+        if (!t.depends?.length)
+            return true;
+        return t.depends.every((depId) => completedIds.has(depId));
+    });
+}
+/**
+ * Get tasks that depend on a given task.
+ */
+export function getDependents(taskId, tasks) {
+    return tasks.filter((t) => t.depends?.includes(taskId));
+}
+/**
+ * Get dependent IDs.
+ */
+export function getDependentIds(taskId, tasks) {
+    return getDependents(taskId, tasks).map((t) => t.id);
+}
+/**
+ * Get unresolved dependencies for a task (deps that are not done/cancelled).
+ */
+export function getUnresolvedDeps(taskId, tasks) {
+    const task = tasks.find((t) => t.id === taskId);
+    if (!task?.depends?.length)
+        return [];
+    const completedIds = new Set(tasks.filter((t) => t.status === 'done' || t.status === 'cancelled').map((t) => t.id));
+    return task.depends.filter((depId) => !completedIds.has(depId));
+}
+/**
+ * Validate dependencies for missing references.
+ */
+export function validateDependencyRefs(tasks) {
+    const taskIds = new Set(tasks.map((t) => t.id));
+    const errors = [];
+    for (const task of tasks) {
+        if (!task.depends?.length)
+            continue;
+        for (const depId of task.depends) {
+            if (!taskIds.has(depId)) {
+                errors.push({
+                    code: 'E_DEP_NOT_FOUND',
+                    taskId: task.id,
+                    message: `Task ${task.id} depends on ${depId}, which does not exist`,
+                    relatedIds: [depId],
+                });
+            }
+        }
+    }
+    return errors;
+}
+/**
+ * Full dependency graph validation.
+ */
+export function validateDependencies(tasks) {
+    const errors = [];
+    const warnings = [];
+    // Check for missing references
+    errors.push(...validateDependencyRefs(tasks));
+    // Check for circular dependencies
+    const visited = new Set();
+    for (const task of tasks) {
+        if (visited.has(task.id))
+            continue;
+        if (!task.depends?.length)
+            continue;
+        const cycle = detectCircularDeps(task.id, tasks);
+        if (cycle.length > 0) {
+            errors.push({
+                code: 'E_CIRCULAR_DEP',
+                taskId: task.id,
+                message: `Circular dependency detected: ${cycle.join(' -> ')}`,
+                relatedIds: cycle,
+            });
+            // Mark all in cycle as visited to avoid duplicate reports
+            cycle.forEach((id) => visited.add(id));
+        }
+    }
+    // Check for self-dependencies
+    for (const task of tasks) {
+        if (task.depends?.includes(task.id)) {
+            errors.push({
+                code: 'E_SELF_DEP',
+                taskId: task.id,
+                message: `Task ${task.id} depends on itself`,
+            });
+        }
+    }
+    // Warn about completed tasks with unmet dependencies
+    for (const task of tasks) {
+        if (task.status === 'done' && task.depends?.length) {
+            const unresolved = getUnresolvedDeps(task.id, tasks);
+            if (unresolved.length > 0) {
+                warnings.push({
+                    code: 'W_COMPLETED_WITH_UNMET_DEPS',
+                    taskId: task.id,
+                    message: `Completed task ${task.id} has unmet dependencies: ${unresolved.join(', ')}`,
+                });
+            }
+        }
+    }
+    return {
+        valid: errors.length === 0,
+        errors,
+        warnings,
+    };
+}
+/**
+ * Topological sort of tasks by dependencies.
+ * Returns sorted task IDs or null if cycle detected.
+ */
+export function topologicalSort(tasks) {
+    const inDegree = new Map();
+    const adjList = new Map();
+    // Initialize
+    for (const task of tasks) {
+        inDegree.set(task.id, 0);
+        adjList.set(task.id, []);
+    }
+    // Build adjacency list (dependency -> dependent)
+    for (const task of tasks) {
+        if (!task.depends?.length)
+            continue;
+        for (const depId of task.depends) {
+            if (adjList.has(depId)) {
+                adjList.get(depId).push(task.id);
+                inDegree.set(task.id, (inDegree.get(task.id) ?? 0) + 1);
+            }
+        }
+    }
+    // Kahn's algorithm
+    const queue = [];
+    for (const [id, degree] of inDegree) {
+        if (degree === 0)
+            queue.push(id);
+    }
+    const sorted = [];
+    while (queue.length > 0) {
+        const id = queue.shift();
+        sorted.push(id);
+        for (const dependent of adjList.get(id) ?? []) {
+            const newDegree = (inDegree.get(dependent) ?? 1) - 1;
+            inDegree.set(dependent, newDegree);
+            if (newDegree === 0)
+                queue.push(dependent);
+        }
+    }
+    // If not all tasks sorted, there's a cycle
+    if (sorted.length !== tasks.length)
+        return null;
+    return sorted;
+}
+//# sourceMappingURL=dependency-check.js.map

package/dist/core/tasks/dependency-check.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-check.js","sourceRoot":"","sources":["../../../src/core/tasks/dependency-check.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AA0BH;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAc,EACd,KAAa;IAEb,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAErD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,EAAU;QACrB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEd,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,IAAI,EAAE,OAAO,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;oBACzB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;wBAAE,OAAO,KAAK,CAAC;gBACrC,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrC,0DAA0D;oBAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBACvC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAc,EACd,IAAY,EACZ,KAAa;IAEb,2CAA2C;IAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;YACpB,OAAO,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;QACzD,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IACH,OAAO,kBAAkB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AACzD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACtF,CAAC;IAEF,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACxB,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,KAAK,CAAC;QAClE,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACtF,CAAC;IAEF,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACxB,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,KAAK,CAAC;QAClE,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM;YAAE,OAAO,IAAI,CAAC;QACpC,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,MAAc,EAAE,KAAa;IACzD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc,EAAE,KAAa;IAC3D,OAAO,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAc,EAAE,KAAa;IAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAChD,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM;QAAE,OAAO,EAAE,CAAC;IAEtC,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACtF,CAAC;IAEF,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AAClE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,MAAM,MAAM,GAAsB,EAAE,CAAC;IAErC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM;YAAE,SAAS;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,iBAAiB;oBACvB,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,OAAO,EAAE,QAAQ,IAAI,CAAC,EAAE,eAAe,KAAK,wBAAwB;oBACpE,UAAU,EAAE,CAAC,KAAK,CAAC;iBACpB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAa;IAChD,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,QAAQ,GAAwB,EAAE,CAAC;IAEzC,+BAA+B;IAC/B,MAAM,CAAC,IAAI,CAAC,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC,CAAC;IAE9C,kCAAkC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QACnC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM;YAAE,SAAS;QAEpC,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,OAAO,EAAE,iCAAiC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBAC9D,UAAU,EAAE,KAAK;aAClB,CAAC,CAAC;YACH,0DAA0D;YAC1D,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,YAAY;gBAClB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,OAAO,EAAE,QAAQ,IAAI,CAAC,EAAE,oBAAoB;aAC7C,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC;YACnD,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACrD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,6BAA6B;oBACnC,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,OAAO,EAAE,kBAAkB,IAAI,CAAC,EAAE,4BAA4B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;iBACtF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM;QACN,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE5C,aAAa;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,iDAAiD;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM;YAAE,SAAS;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEhB,KAAK,MAAM,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9C,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACrD,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACnC,IAAI,SAAS,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAChD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/core/tasks/find.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Fuzzy task search with minimal output.
+ * @task T4460
+ * @epic T4454
+ */
+import type { TaskStatus } from '../../types/task.js';
+import type { DataAccessor } from '../../store/data-accessor.js';
+/** Minimal task info for search results. */
+export interface FindResult {
+    id: string;
+    title: string;
+    status: string;
+    priority: string;
+    type?: string;
+    parentId?: string | null;
+    score: number;
+}
+/** Options for finding tasks. */
+export interface FindTasksOptions {
+    query?: string;
+    id?: string;
+    exact?: boolean;
+    status?: TaskStatus;
+    field?: string;
+    includeArchive?: boolean;
+    limit?: number;
+    offset?: number;
+}
+/** Result of finding tasks. */
+export interface FindTasksResult {
+    results: FindResult[];
+    total: number;
+    query: string;
+    searchType: 'fuzzy' | 'id' | 'exact';
+}
+/**
+ * Calculate fuzzy match score between query and text.
+ * Higher score = better match. 0 = no match.
+ * @task T4460
+ */
+export declare function fuzzyScore(query: string, text: string): number;
+/**
+ * Search tasks by fuzzy matching, ID prefix, or exact title.
+ * Returns minimal fields only (context-efficient).
+ * @task T4460
+ */
+export declare function findTasks(options: FindTasksOptions, cwd?: string, accessor?: DataAccessor): Promise<FindTasksResult>;
+//# sourceMappingURL=find.d.ts.map

package/dist/core/tasks/find.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/find.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,KAAK,EAAQ,UAAU,EAAY,MAAM,qBAAqB,CAAC;AAEtE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAEjE,4CAA4C;AAC5C,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,iCAAiC;AACjC,MAAM,WAAW,gBAAgB;IAC/B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,+BAA+B;AAC/B,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,OAAO,GAAG,IAAI,GAAG,OAAO,CAAC;CACtC;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAqC9D;AAED;;;;GAIG;AACH,wBAAsB,SAAS,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,eAAe,CAAC,CA4G1H"}

package/dist/core/tasks/find.js

@@ -0,0 +1,155 @@
+/**
+ * Fuzzy task search with minimal output.
+ * @task T4460
+ * @epic T4454
+ */
+import { readJsonRequired, readJson } from '../../store/json.js';
+import { CleoError } from '../errors.js';
+import { ExitCode } from '../../types/exit-codes.js';
+import { getTodoPath, getArchivePath } from '../paths.js';
+/**
+ * Calculate fuzzy match score between query and text.
+ * Higher score = better match. 0 = no match.
+ * @task T4460
+ */
+export function fuzzyScore(query, text) {
+    const q = query.toLowerCase();
+    const t = text.toLowerCase();
+    // Exact match
+    if (t === q)
+        return 100;
+    // Contains full query
+    if (t.includes(q))
+        return 80;
+    // Word-boundary match
+    const words = t.split(/\s+/);
+    const queryWords = q.split(/\s+/);
+    let wordMatchCount = 0;
+    for (const qw of queryWords) {
+        if (words.some(w => w.startsWith(qw) || w.includes(qw))) {
+            wordMatchCount++;
+        }
+    }
+    if (wordMatchCount > 0) {
+        return 40 + (wordMatchCount / queryWords.length) * 40;
+    }
+    // Character sequence match
+    let qIdx = 0;
+    let matched = 0;
+    for (let tIdx = 0; tIdx < t.length && qIdx < q.length; tIdx++) {
+        if (t[tIdx] === q[qIdx]) {
+            matched++;
+            qIdx++;
+        }
+    }
+    if (qIdx === q.length) {
+        return 10 + (matched / t.length) * 20;
+    }
+    return 0;
+}
+/**
+ * Search tasks by fuzzy matching, ID prefix, or exact title.
+ * Returns minimal fields only (context-efficient).
+ * @task T4460
+ */
+export async function findTasks(options, cwd, accessor) {
+    if (!options.query && !options.id) {
+        throw new CleoError(ExitCode.INVALID_INPUT, 'Search query or --id is required');
+    }
+    const todoPath = getTodoPath(cwd);
+    const data = accessor
+        ? await accessor.loadTodoFile()
+        : await readJsonRequired(todoPath);
+    let allTasks = [...data.tasks];
+    // Include archive if requested
+    if (options.includeArchive) {
+        if (accessor) {
+            const archive = await accessor.loadArchive();
+            if (archive?.archivedTasks) {
+                allTasks = [...allTasks, ...archive.archivedTasks];
+            }
+        }
+        else {
+            const archivePath = getArchivePath(cwd);
+            const archive = await readJson(archivePath);
+            if (archive?.archivedTasks) {
+                allTasks = [...allTasks, ...archive.archivedTasks];
+            }
+        }
+    }
+    // Apply status filter
+    if (options.status) {
+        allTasks = allTasks.filter(t => t.status === options.status);
+    }
+    let results;
+    let searchType;
+    let queryStr;
+    if (options.id) {
+        // ID prefix search
+        searchType = 'id';
+        queryStr = options.id;
+        const idQuery = options.id.toUpperCase();
+        results = allTasks
+            .filter(t => t.id.toUpperCase().startsWith(idQuery) || t.id.toUpperCase().includes(idQuery))
+            .map(t => ({
+            id: t.id,
+            title: t.title,
+            status: t.status,
+            priority: t.priority,
+            type: t.type,
+            parentId: t.parentId,
+            score: t.id.toUpperCase() === idQuery ? 100 : t.id.toUpperCase().startsWith(idQuery) ? 80 : 50,
+        }));
+    }
+    else if (options.exact) {
+        // Exact title match
+        searchType = 'exact';
+        queryStr = options.query;
+        results = allTasks
+            .filter(t => t.title === options.query)
+            .map(t => ({
+            id: t.id,
+            title: t.title,
+            status: t.status,
+            priority: t.priority,
+            type: t.type,
+            parentId: t.parentId,
+            score: 100,
+        }));
+    }
+    else {
+        // Fuzzy search
+        searchType = 'fuzzy';
+        queryStr = options.query;
+        const scored = [];
+        for (const t of allTasks) {
+            const titleScore = fuzzyScore(queryStr, t.title);
+            const descScore = t.description ? fuzzyScore(queryStr, t.description) * 0.7 : 0;
+            const score = Math.max(titleScore, descScore);
+            if (score > 0) {
+                scored.push({
+                    id: t.id,
+                    title: t.title,
+                    status: t.status,
+                    priority: t.priority,
+                    type: t.type,
+                    parentId: t.parentId,
+                    score: Math.round(score),
+                });
+            }
+        }
+        results = scored.sort((a, b) => b.score - a.score);
+    }
+    const total = results.length;
+    // Apply pagination
+    const limit = options.limit ?? 20;
+    const offset = options.offset ?? 0;
+    results = results.slice(offset, offset + limit);
+    return {
+        results,
+        total,
+        query: queryStr,
+        searchType,
+    };
+}
+//# sourceMappingURL=find.js.map

package/dist/core/tasks/find.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sourceRoot":"","sources":["../../../src/core/tasks/find.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AACjE,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAErD,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAkC1D;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa,EAAE,IAAY;IACpD,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAE7B,cAAc;IACd,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAExB,sBAAsB;IACtB,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAE7B,sBAAsB;IACtB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACxD,cAAc,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IACD,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,GAAG,CAAC,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IACxD,CAAC;IAED,2BAA2B;IAC3B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,IAAI,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QAC9D,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,OAAO,EAAE,CAAC;YACV,IAAI,EAAE,CAAC;QACT,CAAC;IACH,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACtB,OAAO,EAAE,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IACxC,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,OAAyB,EAAE,GAAY,EAAE,QAAuB;IAC9F,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,SAAS,CAAC,QAAQ,CAAC,aAAa,EAAE,kCAAkC,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,QAAQ;QACnB,CAAC,CAAC,MAAM,QAAQ,CAAC,YAAY,EAAE;QAC/B,CAAC,CAAC,MAAM,gBAAgB,CAAW,QAAQ,CAAC,CAAC;IAE/C,IAAI,QAAQ,GAAW,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAEvC,+BAA+B;IAC/B,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;QAC3B,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,WAAW,EAAE,CAAC;YAC7C,IAAI,OAAO,EAAE,aAAa,EAAE,CAAC;gBAC3B,QAAQ,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,OAAO,GAAG,MAAM,QAAQ,CAA4B,WAAW,CAAC,CAAC;YACvE,IAAI,OAAO,EAAE,aAAa,EAAE,CAAC;gBAC3B,QAAQ,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACnB,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,OAAqB,CAAC;IAC1B,IAAI,UAAyC,CAAC;IAC9C,IAAI,QAAgB,CAAC;IAErB,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;QACf,mBAAmB;QACnB,UAAU,GAAG,IAAI,CAAC;QAClB,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QACzC,OAAO,GAAG,QAAQ;aACf,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;aAC3F,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;SAC/F,CAAC,CAAC,CAAC;IACR,CAAC;SAAM,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QACzB,oBAAoB;QACpB,UAAU,GAAG,OAAO,CAAC;QACrB,QAAQ,GAAG,OAAO,CAAC,KAAM,CAAC;QAC1B,OAAO,GAAG,QAAQ;aACf,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,OAAO,CAAC,KAAK,CAAC;aACtC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,KAAK,EAAE,GAAG;SACX,CAAC,CAAC,CAAC;IACR,CAAC;SAAM,CAAC;QACN,eAAe;QACf,UAAU,GAAG,OAAO,CAAC;QACrB,QAAQ,GAAG,OAAO,CAAC,KAAM,CAAC;QAC1B,MAAM,MAAM,GAAiB,EAAE,CAAC;QAEhC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YACjD,MAAM,SAAS,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YAE9C,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC;oBACV,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;oBACpB,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;oBACpB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;iBACzB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACrD,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;IAE7B,mBAAmB;IACnB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAClC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;IACnC,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC;IAEhD,OAAO;QACL,OAAO;QACP,KAAK;QACL,KAAK,EAAE,QAAQ;QACf,UAAU;KACX,CAAC;AACJ,CAAC"}

package/dist/core/tasks/graph-cache.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Graph cache - memoized dependency graph operations.
+ * Ported from lib/tasks/graph-cache.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '../../types/task.js';
+import { type DependencyWave } from './graph-ops.js';
+/**
+ * Graph cache for expensive dependency calculations.
+ * Automatically invalidates when tasks change.
+ */
+export declare class GraphCache {
+    private descendantsCache;
+    private childrenCache;
+    private dependentsCache;
+    private wavesCache;
+    private taskChecksum;
+    private ttlMs;
+    constructor(options?: {
+        ttlMs?: number;
+    });
+    /**
+     * Compute a simple checksum from task data to detect changes.
+     */
+    private computeChecksum;
+    /**
+     * Check if cache is still valid for given tasks.
+     */
+    private isValid;
+    /**
+     * Check if a cache entry has expired.
+     */
+    private isExpired;
+    /**
+     * Invalidate all caches.
+     */
+    invalidate(): void;
+    /**
+     * Ensure cache is fresh for the given task set.
+     */
+    private ensureFresh;
+    /**
+     * Get descendants of a task (cached).
+     */
+    getDescendants(taskId: string, tasks: Task[]): string[];
+    /**
+     * Get children of a task (cached).
+     */
+    getChildren(taskId: string, tasks: Task[]): string[];
+    /**
+     * Get dependents of a task (cached).
+     */
+    getDependents(taskId: string, tasks: Task[]): string[];
+    /**
+     * Get dependency waves (cached).
+     */
+    getWaves(tasks: Task[]): DependencyWave[];
+    /**
+     * Get cache statistics.
+     */
+    getStats(): {
+        descendantsSize: number;
+        childrenSize: number;
+        dependentsSize: number;
+        hasWaves: boolean;
+    };
+}
+//# sourceMappingURL=graph-cache.d.ts.map

package/dist/core/tasks/graph-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-cache.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/graph-cache.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAGhD,OAAO,EAA0B,KAAK,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAQ7E;;;GAGG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,gBAAgB,CAA2C;IACnE,OAAO,CAAC,aAAa,CAA2C;IAChE,OAAO,CAAC,eAAe,CAA2C;IAClE,OAAO,CAAC,UAAU,CAA6C;IAC/D,OAAO,CAAC,YAAY,CAAc;IAClC,OAAO,CAAC,KAAK,CAAS;gBAEV,OAAO,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE;IAIxC;;OAEG;IACH,OAAO,CAAC,eAAe;IAQvB;;OAEG;IACH,OAAO,CAAC,OAAO;IAIf;;OAEG;IACH,OAAO,CAAC,SAAS;IAIjB;;OAEG;IACH,UAAU,IAAI,IAAI;IAQlB;;OAEG;IACH,OAAO,CAAC,WAAW;IAOnB;;OAEG;IACH,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE;IAavD;;OAEG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE;IAapD;;OAEG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE;IAatD;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE;IAYzC;;OAEG;IACH,QAAQ,IAAI;QACV,eAAe,EAAE,MAAM,CAAC;QACxB,YAAY,EAAE,MAAM,CAAC;QACrB,cAAc,EAAE,MAAM,CAAC;QACvB,QAAQ,EAAE,OAAO,CAAC;KACnB;CAQF"}