@cleocode/core 2026.3.42 → 2026.3.43

package/dist/tasks/deletion-strategy.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Strategy pattern for child handling during task deletion/cancellation.
+ * Ported from lib/tasks/deletion-strategy.sh
+ *
+ * Strategies: block (fail if has children), cascade (cancel all), orphan (remove parent ref)
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '@cleocode/contracts';
+/** Valid child handling strategies. */
+export type ChildStrategy = 'block' | 'cascade' | 'orphan';
+export declare const VALID_STRATEGIES: ChildStrategy[];
+/** Result from a strategy handler. */
+export interface StrategyResult {
+    success: boolean;
+    strategy: ChildStrategy;
+    taskId: string;
+    affectedTasks: string[];
+    affectedCount?: number;
+    message: string;
+    error?: {
+        code: string;
+        message: string;
+        childCount?: number;
+        childIds?: string[];
+        suggestion?: string;
+    };
+}
+/**
+ * Validate a strategy name.
+ */
+export declare function isValidStrategy(strategy: string): strategy is ChildStrategy;
+/**
+ * Handle children using the specified strategy.
+ * Returns the modified tasks array and the strategy result.
+ */
+export declare function handleChildren(taskId: string, strategy: ChildStrategy, tasks: Task[], options?: {
+    force?: boolean;
+    cascadeThreshold?: number;
+    allowCascade?: boolean;
+}): {
+    tasks: Task[];
+    result: StrategyResult;
+};
+//# sourceMappingURL=deletion-strategy.d.ts.map

package/dist/tasks/deletion-strategy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deletion-strategy.d.ts","sourceRoot":"","sources":["../../src/tasks/deletion-strategy.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAGhD,uCAAuC;AACvC,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,SAAS,GAAG,QAAQ,CAAC;AAE3D,eAAO,MAAM,gBAAgB,EAAE,aAAa,EAAmC,CAAC;AAEhF,sCAAsC;AACtC,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,aAAa,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE;QACN,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;QACpB,UAAU,CAAC,EAAE,MAAM,CAAC;KACrB,CAAC;CACH;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,IAAI,aAAa,CAE3E;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,aAAa,EACvB,KAAK,EAAE,IAAI,EAAE,EACb,OAAO,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,OAAO,CAAC;IAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,OAAO,CAAA;CAAE,GAC/E;IAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAAC,MAAM,EAAE,cAAc,CAAA;CAAE,CAwB3C"}

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

@@ -0,0 +1,82 @@
+/**
+ * Dependency checking - validate task dependency graphs.
+ * Ported from lib/tasks/dependency-check.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '@cleocode/contracts';
+/** 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;
+/**
+ * Walk upstream recursively through a task's dependency chain.
+ * Returns all non-done/non-cancelled dependency IDs (deduplicated).
+ * Uses a visited set for cycle protection.
+ */
+export declare function getTransitiveBlockers(taskId: string, tasks: Task[]): string[];
+/**
+ * From the transitive blockers, return only "leaf" blockers — those whose
+ * own dependencies are all resolved (done/cancelled) or that have no
+ * dependencies at all. These are the root-cause tasks that need action first.
+ */
+export declare function getLeafBlockers(taskId: string, tasks: Task[]): string[];
+//# sourceMappingURL=dependency-check.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-check.d.ts","sourceRoot":"","sources":["../../src/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,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAgC1E;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,OAAO,CASrF;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,CA0DzE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CA0C9D;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CA0B7E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAcvE"}

package/dist/tasks/deps-ready.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Shared dependency-readiness check.
+ *
+ * Used by plan, task-ops, and briefing modules to determine
+ * if a task's dependencies are all satisfied.
+ *
+ * Accepts a loosely-typed map (including Map<string, unknown>) so all
+ * consumers can use it without unsafe casts.
+ *
+ * @epic T4454
+ */
+/**
+ * Check if all dependencies of a task are satisfied.
+ *
+ * @param depends - Array of dependency task IDs (may be undefined/empty)
+ * @param taskLookup - Map from task ID to a task-like object with at least { status: string }
+ * @returns true if all dependencies are done/cancelled, or if no dependencies exist
+ */
+export declare function depsReady(depends: string[] | undefined, taskLookup: ReadonlyMap<string, {
+    status?: string;
+} | unknown>): boolean;
+//# sourceMappingURL=deps-ready.d.ts.map

package/dist/tasks/deps-ready.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deps-ready.d.ts","sourceRoot":"","sources":["../../src/tasks/deps-ready.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH;;;;;;GAMG;AACH,wBAAgB,SAAS,CACvB,OAAO,EAAE,MAAM,EAAE,GAAG,SAAS,EAC7B,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAAC,GAC7D,OAAO,CAQT"}

package/dist/tasks/find.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Fuzzy task search with minimal output.
+ * @task T4460
+ * @epic T4454
+ */
+import type { TaskStatus } from '@cleocode/contracts';
+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/tasks/find.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.d.ts","sourceRoot":"","sources":["../../src/tasks/find.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAA0B,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAG9E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAG9D,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,CAC7B,OAAO,EAAE,gBAAgB,EACzB,GAAG,CAAC,EAAE,MAAM,EACZ,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC,eAAe,CAAC,CAuG1B"}

package/dist/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 '@cleocode/contracts';
+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/tasks/graph-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-cache.d.ts","sourceRoot":"","sources":["../../src/tasks/graph-cache.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,EAA0B,KAAK,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAS7E;;;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"}

package/dist/tasks/graph-ops.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Task graph operations - dependency waves, ordering, and critical path.
+ * Ported from lib/tasks/graph-ops.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '@cleocode/contracts';
+/** A wave of parallelizable tasks. */
+export interface DependencyWave {
+    wave: number;
+    taskIds: string[];
+}
+/**
+ * Compute dependency waves for parallel execution.
+ * Tasks in the same wave can run in parallel; waves must be sequential.
+ */
+export declare function computeDependencyWaves(tasks: Task[]): DependencyWave[];
+/**
+ * Get the next task to work on (highest priority ready task).
+ */
+export declare function getNextTask(tasks: Task[]): Task | null;
+/**
+ * Calculate the critical path (longest dependency chain).
+ * Returns task IDs along the critical path.
+ */
+export declare function getCriticalPath(tasks: Task[]): string[];
+/**
+ * Get task ordering by dependency + priority.
+ */
+export declare function getTaskOrder(tasks: Task[]): string[];
+/**
+ * Get parallelizable tasks (tasks with no unmet dependencies).
+ */
+export declare function getParallelTasks(tasks: Task[]): string[];
+//# sourceMappingURL=graph-ops.d.ts.map

package/dist/tasks/graph-ops.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-ops.d.ts","sourceRoot":"","sources":["../../src/tasks/graph-ops.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAGhD,sCAAsC;AACtC,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE,CAwDtE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CA8BtD;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAqDvD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAepD;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAGxD"}

package/dist/tasks/graph-rag.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Semantic relationship discovery for CLEO tasks.
+ * Discovers related tasks via shared labels, description keywords, files, and hierarchy.
+ * Ported from lib/tasks/graph-rag.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '@cleocode/contracts';
+import type { RelatesType } from './crossref-extract.js';
+/** Discovery method. */
+export type DiscoveryMethod = 'labels' | 'description' | 'files' | 'hierarchy' | 'auto';
+/** A single discovery match. */
+export interface DiscoveryMatch {
+    taskId: string;
+    type: RelatesType;
+    reason: string;
+    score: number;
+    _hierarchyBoost?: number;
+    _relationship?: string;
+}
+/**
+ * Discover related tasks by shared labels.
+ */
+export declare function discoverByLabels(taskId: string, tasks: Task[]): DiscoveryMatch[];
+/**
+ * Discover related tasks by description similarity (keyword-based Jaccard).
+ */
+export declare function discoverByDescription(taskId: string, tasks: Task[]): DiscoveryMatch[];
+/**
+ * Discover related tasks by shared files.
+ */
+export declare function discoverByFiles(taskId: string, tasks: Task[]): DiscoveryMatch[];
+/**
+ * Discover related tasks by hierarchical proximity (siblings and cousins).
+ */
+export declare function discoverByHierarchy(taskId: string, tasks: Task[], options?: {
+    siblingBoost?: number;
+    cousinBoost?: number;
+}): DiscoveryMatch[];
+/**
+ * Discover related tasks using all methods combined.
+ */
+export declare function discoverRelatedTasks(taskId: string, tasks: Task[], method?: DiscoveryMethod): DiscoveryMatch[];
+/**
+ * Suggest relates entries filtered by threshold.
+ */
+export declare function suggestRelates(taskId: string, tasks: Task[], threshold?: number): DiscoveryMatch[];
+//# sourceMappingURL=graph-rag.d.ts.map

package/dist/tasks/graph-rag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-rag.d.ts","sourceRoot":"","sources":["../../src/tasks/graph-rag.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAgB,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEvE,wBAAwB;AACxB,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,aAAa,GAAG,OAAO,GAAG,WAAW,GAAG,MAAM,CAAC;AAExF,gCAAgC;AAChC,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,WAAW,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAwHD;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE,CA2BhF;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE,CAkCrF;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE,CA8B/E;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,IAAI,EAAE,EACb,OAAO,CAAC,EAAE;IAAE,YAAY,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAE,GACxD,cAAc,EAAE,CA6ClB;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,IAAI,EAAE,EACb,MAAM,GAAE,eAAwB,GAC/B,cAAc,EAAE,CA8ClB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,IAAI,EAAE,EACb,SAAS,GAAE,MAAY,GACtB,cAAc,EAAE,CAiBlB"}

package/dist/tasks/hierarchy-policy.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Unified hierarchy policy resolution and validation.
+ * Single source of truth for all hierarchy enforcement paths.
+ *
+ * @epic T4454
+ * @task T5001
+ */
+import type { CleoConfig, Task } from '@cleocode/contracts';
+export interface HierarchyPolicy {
+    maxDepth: number;
+    maxSiblings: number;
+    maxActiveSiblings: number;
+    countDoneInLimit: boolean;
+    enforcementProfile: 'llm-agent-first' | 'human-cognitive' | 'custom';
+}
+export interface HierarchyValidationResult {
+    valid: boolean;
+    error?: {
+        code: string;
+        message: string;
+    };
+}
+export declare const ENFORCEMENT_PROFILES: {
+    readonly 'llm-agent-first': {
+        readonly maxSiblings: 0;
+        readonly maxActiveSiblings: 0;
+        readonly maxDepth: 3;
+        readonly countDoneInLimit: false;
+    };
+    readonly 'human-cognitive': {
+        readonly maxSiblings: 7;
+        readonly maxActiveSiblings: 3;
+        readonly maxDepth: 3;
+        readonly countDoneInLimit: false;
+    };
+};
+/**
+ * Resolve a full HierarchyPolicy from config, starting with a profile preset
+ * and overriding with any explicitly set config.hierarchy fields.
+ */
+export declare function resolveHierarchyPolicy(config: CleoConfig): HierarchyPolicy;
+/**
+ * Assert that a parent task exists in the task list.
+ * Returns an error result if not found, null if OK.
+ */
+export declare function assertParentExists(parentId: string, tasks: Task[]): HierarchyValidationResult | null;
+/**
+ * Assert that re-parenting would not create a cycle.
+ * Returns an error result if a cycle is detected, null if OK.
+ */
+export declare function assertNoCycle(taskId: string, newParentId: string, tasks: Task[]): HierarchyValidationResult | null;
+/**
+ * Count active (non-done, non-cancelled, non-archived) children of a parent.
+ */
+export declare function countActiveChildren(parentId: string, tasks: Task[]): number;
+/**
+ * Validate whether a new task can be placed under the given parent
+ * according to the resolved hierarchy policy.
+ */
+export declare function validateHierarchyPlacement(parentId: string | null, tasks: Task[], policy: HierarchyPolicy): HierarchyValidationResult;
+//# sourceMappingURL=hierarchy-policy.d.ts.map

package/dist/tasks/hierarchy-policy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy-policy.d.ts","sourceRoot":"","sources":["../../src/tasks/hierarchy-policy.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAO5D,MAAM,WAAW,eAAe;IAC9B,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,OAAO,CAAC;IAC1B,kBAAkB,EAAE,iBAAiB,GAAG,iBAAiB,GAAG,QAAQ,CAAC;CACtE;AAED,MAAM,WAAW,yBAAyB;IACxC,KAAK,EAAE,OAAO,CAAC;IACf,KAAK,CAAC,EAAE;QACN,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;CACH;AAMD,eAAO,MAAM,oBAAoB;;;;;;;;;;;;;CAGvB,CAAC;AAQX;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,UAAU,GAAG,eAAe,CAiC1E;AAMD;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,IAAI,EAAE,GACZ,yBAAyB,GAAG,IAAI,CASlC;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,IAAI,EAAE,GACZ,yBAAyB,GAAG,IAAI,CAWlC;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,CAG3E;AAMD;;;GAGG;AACH,wBAAgB,0BAA0B,CACxC,QAAQ,EAAE,MAAM,GAAG,IAAI,EACvB,KAAK,EAAE,IAAI,EAAE,EACb,MAAM,EAAE,eAAe,GACtB,yBAAyB,CAuD3B"}

package/dist/tasks/hierarchy.d.ts

@@ -0,0 +1,85 @@
+/**
+ * Task hierarchy operations - parent/child tree traversal and validation.
+ * Ported from lib/tasks/hierarchy.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '@cleocode/contracts';
+/**
+ * Get direct children of a task.
+ */
+export declare function getChildren(taskId: string, tasks: Task[]): Task[];
+/**
+ * Get direct child IDs.
+ */
+export declare function getChildIds(taskId: string, tasks: Task[]): string[];
+/**
+ * Get all descendants of a task (recursive).
+ */
+export declare function getDescendants(taskId: string, tasks: Task[]): Task[];
+/**
+ * Get all descendant IDs (flat list).
+ */
+export declare function getDescendantIds(taskId: string, tasks: Task[]): string[];
+/**
+ * Get the parent chain (ancestors) from a task up to the root.
+ * Returns ordered from immediate parent to root.
+ */
+export declare function getParentChain(taskId: string, tasks: Task[]): Task[];
+/**
+ * Get the parent chain as IDs.
+ */
+export declare function getParentChainIds(taskId: string, tasks: Task[]): string[];
+/**
+ * Calculate depth of a task in the hierarchy (0-based).
+ * Root tasks have depth 0, their children depth 1, etc.
+ */
+export declare function getDepth(taskId: string, tasks: Task[]): number;
+/**
+ * Get the root ancestor of a task.
+ */
+export declare function getRootAncestor(taskId: string, tasks: Task[]): Task | null;
+/**
+ * Check if a task is an ancestor of another.
+ */
+export declare function isAncestorOf(ancestorId: string, descendantId: string, tasks: Task[]): boolean;
+/**
+ * Check if a task is a descendant of another.
+ */
+export declare function isDescendantOf(descendantId: string, ancestorId: string, tasks: Task[]): boolean;
+/**
+ * Get sibling tasks (same parent).
+ */
+export declare function getSiblings(taskId: string, tasks: Task[]): Task[];
+/**
+ * Validate that adding a child to a parent would not violate constraints.
+ */
+export interface HierarchyValidation {
+    valid: boolean;
+    error?: {
+        code: string;
+        message: string;
+    };
+}
+export declare function validateHierarchy(parentId: string | null, tasks: Task[], policy?: {
+    maxDepth?: number;
+    maxSiblings?: number;
+}): HierarchyValidation;
+/**
+ * Detect circular reference if parentId were set.
+ */
+export declare function wouldCreateCircle(taskId: string, newParentId: string, tasks: Task[]): boolean;
+/**
+ * Build a tree structure from flat task list.
+ */
+export interface TaskTreeNode {
+    task: Task;
+    children: TaskTreeNode[];
+}
+export declare function buildTree(tasks: Task[]): TaskTreeNode[];
+/**
+ * Flatten a tree back to a list (depth-first).
+ */
+export declare function flattenTree(nodes: TaskTreeNode[]): Task[];
+//# sourceMappingURL=hierarchy.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy.d.ts","sourceRoot":"","sources":["../../src/tasks/hierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAEhD;;GAEG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAEjE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAEnE;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAkBpE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAExE;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAgBpE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAEzE;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,CAE9D;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CAG1E;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,OAAO,CAG7F;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,OAAO,CAE/F;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CASjE;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,OAAO,CAAC;IACf,KAAK,CAAC,EAAE;QACN,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;CACH;AAED,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,MAAM,GAAG,IAAI,EACvB,KAAK,EAAE,IAAI,EAAE,EACb,MAAM,CAAC,EAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAE,GACnD,mBAAmB,CAuCrB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,OAAO,CAI7F;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,IAAI,CAAC;IACX,QAAQ,EAAE,YAAY,EAAE,CAAC;CAC1B;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,YAAY,EAAE,CAkBvD;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,IAAI,EAAE,CAOzD"}

package/dist/tasks/id-generator.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Task ID Generator
+ *
+ * Generates unique task IDs in the T#### format used by CLEO.
+ * Ensures uniqueness across active and archived tasks.
+ */
+/**
+ * Find the highest existing task ID number
+ */
+export declare function findHighestId(existingIds: Set<string>): number;
+/**
+ * Generate the next ID given an explicit set of existing IDs.
+ * Useful when caller has already loaded task data.
+ */
+export declare function generateNextIdFromSet(existingIds: Set<string>): string;
+/**
+ * Validate that a task ID matches the expected format
+ */
+export declare function isValidTaskId(id: string): boolean;
+/**
+ * Normalize a task ID input to canonical T#### format.
+ *
+ * Accepts various loose formats (lowercase prefix, bare digits,
+ * underscore-suffixed descriptors) and returns the canonical form,
+ * or null if the input cannot be parsed as a task ID.
+ */
+export declare function normalizeTaskId(input: unknown): string | null;
+//# sourceMappingURL=id-generator.d.ts.map

package/dist/tasks/id-generator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"id-generator.d.ts","sourceRoot":"","sources":["../../src/tasks/id-generator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAeH;;GAEG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAS9D;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAKtE;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEjD;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAO7D"}

package/dist/tasks/index.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Task operations barrel export.
+ * @task T4460
+ * @epic T4454
+ */
+export { type AddTaskOptions, type AddTaskResult, addTask, findRecentDuplicate, getNextPosition, getTaskDepth, inferTaskType, logOperation, normalizePriority, VALID_PRIORITIES, validateDepends, validateLabels, validateParent, validatePhaseFormat, validatePriority, validateSize, validateStatus, validateTaskType, validateTitle, } from './add.js';
+export { type ArchiveTasksOptions, type ArchiveTasksResult, archiveTasks } from './archive.js';
+export { type CompleteTaskOptions, type CompleteTaskResult, completeTask } from './complete.js';
+export { type DeleteTaskOptions, type DeleteTaskResult, deleteTask } from './delete.js';
+export { type FindResult, type FindTasksOptions, type FindTasksResult, findTasks, fuzzyScore, } from './find.js';
+export { type ListTasksOptions, type ListTasksResult, listTasks } from './list.js';
+export { showTask, type TaskDetail } from './show.js';
+export { type UpdateTaskOptions, type UpdateTaskResult, updateTask } from './update.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/tasks/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/tasks/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,KAAK,cAAc,EACnB,KAAK,aAAa,EAClB,OAAO,EACP,mBAAmB,EACnB,eAAe,EACf,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,cAAc,EACd,cAAc,EACd,mBAAmB,EACnB,gBAAgB,EAChB,YAAY,EACZ,cAAc,EACd,gBAAgB,EAChB,aAAa,GACd,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,KAAK,mBAAmB,EAAE,KAAK,kBAAkB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC/F,OAAO,EAAE,KAAK,mBAAmB,EAAE,KAAK,kBAAkB,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAChG,OAAO,EAAE,KAAK,iBAAiB,EAAE,KAAK,gBAAgB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACxF,OAAO,EACL,KAAK,UAAU,EACf,KAAK,gBAAgB,EACrB,KAAK,eAAe,EACpB,SAAS,EACT,UAAU,GACX,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,KAAK,gBAAgB,EAAE,KAAK,eAAe,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACnF,OAAO,EAAE,QAAQ,EAAE,KAAK,UAAU,EAAE,MAAM,WAAW,CAAC;AACtD,OAAO,EAAE,KAAK,iBAAiB,EAAE,KAAK,gBAAgB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC"}

package/dist/tasks/labels.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Label management core module.
+ * @task T4538
+ * @epic T4454
+ */
+import type { DataAccessor } from '../store/data-accessor.js';
+interface LabelInfo {
+    label: string;
+    count: number;
+    statuses: Record<string, number>;
+}
+/** List all labels with task counts. */
+export declare function listLabels(cwd?: string, accessor?: DataAccessor): Promise<LabelInfo[]>;
+/** Show tasks with a specific label. */
+export declare function showLabelTasks(label: string, cwd?: string, accessor?: DataAccessor): Promise<Record<string, unknown>>;
+/** Get detailed label statistics. */
+export declare function getLabelStats(cwd?: string, accessor?: DataAccessor): Promise<Record<string, unknown>>;
+export {};
+//# sourceMappingURL=labels.d.ts.map

package/dist/tasks/labels.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"labels.d.ts","sourceRoot":"","sources":["../../src/tasks/labels.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAG9D,UAAU,SAAS;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAClC;AAED,wCAAwC;AACxC,wBAAsB,UAAU,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAiB5F;AAED,wCAAwC;AACxC,wBAAsB,cAAc,CAClC,KAAK,EAAE,MAAM,EACb,GAAG,CAAC,EAAE,MAAM,EACZ,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAalC;AAED,qCAAqC;AACrC,wBAAsB,aAAa,CACjC,GAAG,CAAC,EAAE,MAAM,EACZ,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAYlC"}