@cleocode/core 2026.3.38 → 2026.3.40

package/dist/tasks/hierarchy.d.ts

@@ -1,85 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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/hierarchy.js

@@ -1,185 +0,0 @@
-/**
- * Task hierarchy operations - parent/child tree traversal and validation.
- * Ported from lib/tasks/hierarchy.sh
- *
- * @epic T4454
- * @task T4529
- */
-/**
- * Get direct children of a task.
- */
-export function getChildren(taskId, tasks) {
-    return tasks.filter((t) => t.parentId === taskId);
-}
-/**
- * Get direct child IDs.
- */
-export function getChildIds(taskId, tasks) {
-    return getChildren(taskId, tasks).map((t) => t.id);
-}
-/**
- * Get all descendants of a task (recursive).
- */
-export function getDescendants(taskId, tasks) {
-    const result = [];
-    const queue = [taskId];
-    const visited = new Set();
-    while (queue.length > 0) {
-        const current = queue.shift();
-        if (visited.has(current))
-            continue;
-        visited.add(current);
-        const children = getChildren(current, tasks);
-        for (const child of children) {
-            result.push(child);
-            queue.push(child.id);
-        }
-    }
-    return result;
-}
-/**
- * Get all descendant IDs (flat list).
- */
-export function getDescendantIds(taskId, tasks) {
-    return getDescendants(taskId, tasks).map((t) => t.id);
-}
-/**
- * Get the parent chain (ancestors) from a task up to the root.
- * Returns ordered from immediate parent to root.
- */
-export function getParentChain(taskId, tasks) {
-    const chain = [];
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    let current = taskMap.get(taskId);
-    const visited = new Set();
-    while (current?.parentId) {
-        if (visited.has(current.parentId))
-            break; // circular reference guard
-        visited.add(current.parentId);
-        const parent = taskMap.get(current.parentId);
-        if (!parent)
-            break;
-        chain.push(parent);
-        current = parent;
-    }
-    return chain;
-}
-/**
- * Get the parent chain as IDs.
- */
-export function getParentChainIds(taskId, tasks) {
-    return getParentChain(taskId, tasks).map((t) => t.id);
-}
-/**
- * Calculate depth of a task in the hierarchy (0-based).
- * Root tasks have depth 0, their children depth 1, etc.
- */
-export function getDepth(taskId, tasks) {
-    return getParentChain(taskId, tasks).length;
-}
-/**
- * Get the root ancestor of a task.
- */
-export function getRootAncestor(taskId, tasks) {
-    const chain = getParentChain(taskId, tasks);
-    return chain.length > 0 ? chain[chain.length - 1] : null;
-}
-/**
- * Check if a task is an ancestor of another.
- */
-export function isAncestorOf(ancestorId, descendantId, tasks) {
-    const chain = getParentChainIds(descendantId, tasks);
-    return chain.includes(ancestorId);
-}
-/**
- * Check if a task is a descendant of another.
- */
-export function isDescendantOf(descendantId, ancestorId, tasks) {
-    return isAncestorOf(ancestorId, descendantId, tasks);
-}
-/**
- * Get sibling tasks (same parent).
- */
-export function getSiblings(taskId, tasks) {
-    const task = tasks.find((t) => t.id === taskId);
-    if (!task)
-        return [];
-    if (task.parentId) {
-        return tasks.filter((t) => t.parentId === task.parentId && t.id !== taskId);
-    }
-    // Root-level siblings: tasks with no parent, excluding self
-    return tasks.filter((t) => !t.parentId && t.id !== taskId);
-}
-export function validateHierarchy(parentId, tasks, policy) {
-    if (!parentId) {
-        return { valid: true };
-    }
-    const parent = tasks.find((t) => t.id === parentId);
-    if (!parent) {
-        return {
-            valid: false,
-            error: { code: 'E_PARENT_NOT_FOUND', message: `Parent task ${parentId} not found` },
-        };
-    }
-    // Check depth
-    const parentDepth = getDepth(parentId, tasks);
-    if (parentDepth + 1 >= (policy?.maxDepth ?? 3)) {
-        return {
-            valid: false,
-            error: {
-                code: 'E_DEPTH_EXCEEDED',
-                message: `Maximum nesting depth ${policy?.maxDepth ?? 3} would be exceeded`,
-            },
-        };
-    }
-    // Check sibling limit
-    const existingChildren = getChildren(parentId, tasks);
-    const maxSiblings = policy?.maxSiblings ?? 0;
-    if (maxSiblings > 0 && existingChildren.length >= maxSiblings) {
-        return {
-            valid: false,
-            error: {
-                code: 'E_SIBLING_LIMIT',
-                message: `Parent ${parentId} already has ${maxSiblings} children (max)`,
-            },
-        };
-    }
-    return { valid: true };
-}
-/**
- * Detect circular reference if parentId were set.
- */
-export function wouldCreateCircle(taskId, newParentId, tasks) {
-    if (taskId === newParentId)
-        return true;
-    const descendants = getDescendantIds(taskId, tasks);
-    return descendants.includes(newParentId);
-}
-export function buildTree(tasks) {
-    const childrenMap = new Map();
-    for (const task of tasks) {
-        const parentKey = task.parentId ?? null;
-        if (!childrenMap.has(parentKey)) {
-            childrenMap.set(parentKey, []);
-        }
-        childrenMap.get(parentKey).push(task);
-    }
-    function buildNode(task) {
-        const children = (childrenMap.get(task.id) ?? []).map(buildNode);
-        return { task, children };
-    }
-    const roots = childrenMap.get(null) ?? [];
-    return roots.map(buildNode);
-}
-/**
- * Flatten a tree back to a list (depth-first).
- */
-export function flattenTree(nodes) {
-    const result = [];
-    for (const node of nodes) {
-        result.push(node.task);
-        result.push(...flattenTree(node.children));
-    }
-    return result;
-}
-//# sourceMappingURL=hierarchy.js.map

package/dist/tasks/hierarchy.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hierarchy.js","sourceRoot":"","sources":["../../src/tasks/hierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,KAAa;IACvD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,KAAa;IACvD,OAAO,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACrD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,KAAa;IAC1D,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAS;QACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAErB,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,KAAa;IAC5D,OAAO,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,KAAa;IAC1D,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,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;IACrD,IAAI,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,OAAO,OAAO,EAAE,QAAQ,EAAE,CAAC;QACzB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC;YAAE,MAAM,CAAC,2BAA2B;QACrE,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM;YAAE,MAAM;QACnB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnB,OAAO,GAAG,MAAM,CAAC;IACnB,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAc,EAAE,KAAa;IAC7D,OAAO,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,MAAc,EAAE,KAAa;IACpD,OAAO,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC;AAC9C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc,EAAE,KAAa;IAC3D,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC5C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC3D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,UAAkB,EAAE,YAAoB,EAAE,KAAa;IAClF,MAAM,KAAK,GAAG,iBAAiB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IACrD,OAAO,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,YAAoB,EAAE,UAAkB,EAAE,KAAa;IACpF,OAAO,YAAY,CAAC,UAAU,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,KAAa;IACvD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAChD,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IAErB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAC9E,CAAC;IACD,4DAA4D;IAC5D,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;AAC7D,CAAC;AAaD,MAAM,UAAU,iBAAiB,CAC/B,QAAuB,EACvB,KAAa,EACb,MAAoD;IAEpD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACzB,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC;IACpD,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,KAAK,EAAE,EAAE,IAAI,EAAE,oBAAoB,EAAE,OAAO,EAAE,eAAe,QAAQ,YAAY,EAAE;SACpF,CAAC;IACJ,CAAC;IAED,cAAc;IACd,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC9C,IAAI,WAAW,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC;QAC/C,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,KAAK,EAAE;gBACL,IAAI,EAAE,kBAAkB;gBACxB,OAAO,EAAE,yBAAyB,MAAM,EAAE,QAAQ,IAAI,CAAC,oBAAoB;aAC5E;SACF,CAAC;IACJ,CAAC;IAED,sBAAsB;IACtB,MAAM,gBAAgB,GAAG,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACtD,MAAM,WAAW,GAAG,MAAM,EAAE,WAAW,IAAI,CAAC,CAAC;IAC7C,IAAI,WAAW,GAAG,CAAC,IAAI,gBAAgB,CAAC,MAAM,IAAI,WAAW,EAAE,CAAC;QAC9D,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,KAAK,EAAE;gBACL,IAAI,EAAE,iBAAiB;gBACvB,OAAO,EAAE,UAAU,QAAQ,gBAAgB,WAAW,iBAAiB;aACxE;SACF,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAc,EAAE,WAAmB,EAAE,KAAa;IAClF,IAAI,MAAM,KAAK,WAAW;QAAE,OAAO,IAAI,CAAC;IACxC,MAAM,WAAW,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACpD,OAAO,WAAW,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC3C,CAAC;AAUD,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAyB,CAAC;IAErD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;QACxC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACjC,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,SAAS,SAAS,CAAC,IAAU;QAC3B,MAAM,QAAQ,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACjE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IAC5B,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC1C,OAAO,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAqB;IAC/C,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -1,28 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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/id-generator.js

@@ -1,65 +0,0 @@
-/**
- * Task ID Generator
- *
- * Generates unique task IDs in the T#### format used by CLEO.
- * Ensures uniqueness across active and archived tasks.
- */
-/**
- * Task ID pattern: T followed by 3+ digits
- */
-const TASK_ID_PATTERN = /^T(\d{3,})$/;
-/**
- * Extract the numeric part from a task ID
- */
-function extractNumber(id) {
-    const match = id.match(TASK_ID_PATTERN);
-    return match ? parseInt(match[1], 10) : 0;
-}
-/**
- * Find the highest existing task ID number
- */
-export function findHighestId(existingIds) {
-    let highest = 0;
-    for (const id of existingIds) {
-        const num = extractNumber(id);
-        if (num > highest) {
-            highest = num;
-        }
-    }
-    return highest;
-}
-/**
- * Generate the next ID given an explicit set of existing IDs.
- * Useful when caller has already loaded task data.
- */
-export function generateNextIdFromSet(existingIds) {
-    const highest = findHighestId(existingIds);
-    const next = highest + 1;
-    const padded = next.toString().padStart(3, '0');
-    return `T${padded}`;
-}
-/**
- * Validate that a task ID matches the expected format
- */
-export function isValidTaskId(id) {
-    return TASK_ID_PATTERN.test(id);
-}
-/**
- * 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 function normalizeTaskId(input) {
-    if (typeof input !== 'string')
-        return null;
-    const trimmed = input.trim();
-    if (trimmed === '')
-        return null;
-    const match = trimmed.match(/^[Tt]?(\d+)(?:_.*)?$/);
-    if (!match)
-        return null;
-    return `T${match[1]}`;
-}
-//# sourceMappingURL=id-generator.js.map

package/dist/tasks/id-generator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"id-generator.js","sourceRoot":"","sources":["../../src/tasks/id-generator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;GAEG;AACH,MAAM,eAAe,GAAG,aAAa,CAAC;AAEtC;;GAEG;AACH,SAAS,aAAa,CAAC,EAAU;IAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,WAAwB;IACpD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;YAClB,OAAO,GAAG,GAAG,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,WAAwB;IAC5D,MAAM,OAAO,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAChD,OAAO,IAAI,MAAM,EAAE,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,EAAU;IACtC,OAAO,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAClC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,KAAc;IAC5C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC;IACpD,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;AACxB,CAAC"}

package/dist/tasks/index.d.ts

@@ -1,14 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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/index.js

@@ -1,14 +0,0 @@
-/**
- * Task operations barrel export.
- * @task T4460
- * @epic T4454
- */
-export { addTask, findRecentDuplicate, getNextPosition, getTaskDepth, inferTaskType, logOperation, normalizePriority, VALID_PRIORITIES, validateDepends, validateLabels, validateParent, validatePhaseFormat, validatePriority, validateSize, validateStatus, validateTaskType, validateTitle, } from './add.js';
-export { archiveTasks } from './archive.js';
-export { completeTask } from './complete.js';
-export { deleteTask } from './delete.js';
-export { findTasks, fuzzyScore, } from './find.js';
-export { listTasks } from './list.js';
-export { showTask } from './show.js';
-export { updateTask } from './update.js';
-//# sourceMappingURL=index.js.map

package/dist/tasks/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/tasks/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAGL,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,EAAqD,YAAY,EAAE,MAAM,cAAc,CAAC;AAC/F,OAAO,EAAqD,YAAY,EAAE,MAAM,eAAe,CAAC;AAChG,OAAO,EAAiD,UAAU,EAAE,MAAM,aAAa,CAAC;AACxF,OAAO,EAIL,SAAS,EACT,UAAU,GACX,MAAM,WAAW,CAAC;AACnB,OAAO,EAA+C,SAAS,EAAE,MAAM,WAAW,CAAC;AACnF,OAAO,EAAE,QAAQ,EAAmB,MAAM,WAAW,CAAC;AACtD,OAAO,EAAiD,UAAU,EAAE,MAAM,aAAa,CAAC"}

package/dist/tasks/labels.d.ts

@@ -1,19 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"version":3,"file":"labels.d.ts","sourceRoot":"","sources":["../../src/tasks/labels.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAK9D,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"}

package/dist/tasks/labels.js

@@ -1,52 +0,0 @@
-/**
- * Label management core module.
- * @task T4538
- * @epic T4454
- */
-import { getAccessor } from '../store/data-accessor.js';
-import { ExitCode } from '@cleocode/contracts';
-import { CleoError } from '../errors.js';
-/** List all labels with task counts. */
-export async function listLabels(cwd, accessor) {
-    const acc = accessor ?? (await getAccessor(cwd));
-    const { tasks } = await acc.queryTasks({});
-    const labelMap = {};
-    for (const task of tasks) {
-        for (const label of task.labels ?? []) {
-            if (!labelMap[label]) {
-                labelMap[label] = { label, count: 0, statuses: {} };
-            }
-            const info = labelMap[label];
-            info.count++;
-            info.statuses[task.status] = (info.statuses[task.status] ?? 0) + 1;
-        }
-    }
-    return Object.values(labelMap).sort((a, b) => b.count - a.count);
-}
-/** Show tasks with a specific label. */
-export async function showLabelTasks(label, cwd, accessor) {
-    const acc = accessor ?? (await getAccessor(cwd));
-    const { tasks } = await acc.queryTasks({ label });
-    if (tasks.length === 0) {
-        throw new CleoError(ExitCode.NOT_FOUND, `No tasks found with label '${label}'`);
-    }
-    return {
-        label,
-        tasks: tasks.map((t) => ({ id: t.id, title: t.title, status: t.status, priority: t.priority })),
-        count: tasks.length,
-    };
-}
-/** Get detailed label statistics. */
-export async function getLabelStats(cwd, accessor) {
-    const labels = await listLabels(cwd, accessor);
-    const totalLabels = labels.length;
-    const totalUsages = labels.reduce((sum, l) => sum + l.count, 0);
-    const avgPerLabel = totalLabels > 0 ? Math.round((totalUsages / totalLabels) * 100) / 100 : 0;
-    return {
-        labels,
-        totalLabels,
-        totalUsages,
-        avgPerLabel,
-    };
-}
-//# sourceMappingURL=labels.js.map

package/dist/tasks/labels.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"labels.js","sourceRoot":"","sources":["../../src/tasks/labels.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAQzC,wCAAwC;AACxC,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,GAAY,EAAE,QAAuB;IACpE,MAAM,GAAG,GAAG,QAAQ,IAAI,CAAC,MAAM,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAA8B,EAAE,CAAC;IAE/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrB,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;YACtD,CAAC;YACD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACnE,CAAC;AAED,wCAAwC;AACxC,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,KAAa,EACb,GAAY,EACZ,QAAuB;IAEvB,MAAM,GAAG,GAAG,QAAQ,IAAI,CAAC,MAAM,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAElD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,SAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,8BAA8B,KAAK,GAAG,CAAC,CAAC;IAClF,CAAC;IAED,OAAO;QACL,KAAK;QACL,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC/F,KAAK,EAAE,KAAK,CAAC,MAAM;KACpB,CAAC;AACJ,CAAC;AAED,qCAAqC;AACrC,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,GAAY,EACZ,QAAuB;IAEvB,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC/C,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;IAClC,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAChE,MAAM,WAAW,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9F,OAAO;QACL,MAAM;QACN,WAAW;QACX,WAAW;QACX,WAAW;KACZ,CAAC;AACJ,CAAC"}

package/dist/tasks/list.d.ts

@@ -1,49 +0,0 @@
-/**
- * Task listing with filters.
- * @task T4460
- * @epic T4454
- */
-import type { LAFSPage } from '@cleocode/lafs-protocol';
-import type { DataAccessor } from '../store/data-accessor.js';
-import type { Task, TaskPriority, TaskStatus, TaskType } from '@cleocode/contracts';
-/** Compact task representation — minimal fields for MCP list responses. */
-export interface CompactTask {
-    id: string;
-    title: string;
-    status: string;
-    priority: string;
-    type?: string;
-    parentId?: string | null;
-}
-/** Convert a full Task to compact representation. */
-export declare function toCompact(task: Task): CompactTask;
-/** Filter options for listing tasks. */
-export interface ListTasksOptions {
-    status?: TaskStatus;
-    priority?: TaskPriority;
-    type?: TaskType;
-    parentId?: string;
-    phase?: string;
-    label?: string;
-    children?: boolean;
-    limit?: number;
-    offset?: number;
-}
-/** Result of listing tasks. */
-export interface ListTasksResult {
-    tasks: Task[];
-    total: number;
-    filtered: number;
-    page: LAFSPage;
-    pagination?: {
-        limit: number;
-        offset: number;
-        hasMore: boolean;
-    };
-}
-/**
- * List tasks with optional filtering and pagination.
- * @task T4460
- */
-export declare function listTasks(options?: ListTasksOptions, cwd?: string, accessor?: DataAccessor): Promise<ListTasksResult>;
-//# sourceMappingURL=list.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../../src/tasks/list.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,KAAK,EAAE,YAAY,EAAoB,MAAM,2BAA2B,CAAC;AAChF,OAAO,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAKpF,2EAA2E;AAC3E,MAAM,WAAW,WAAW;IAC1B,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;CAC1B;AAED,qDAAqD;AACrD,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,GAAG,WAAW,CASjD;AAED,wCAAwC;AACxC,MAAM,WAAW,gBAAgB;IAC/B,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,QAAQ,CAAC,EAAE,YAAY,CAAC;IACxB,IAAI,CAAC,EAAE,QAAQ,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,+BAA+B;AAC/B,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,QAAQ,CAAC;IACf,UAAU,CAAC,EAAE;QACX,KAAK,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,MAAM,CAAC;QACf,OAAO,EAAE,OAAO,CAAC;KAClB,CAAC;CACH;AAED;;;GAGG;AACH,wBAAsB,SAAS,CAC7B,OAAO,GAAE,gBAAqB,EAC9B,GAAG,CAAC,EAAE,MAAM,EACZ,QAAQ,CAAC,EAAE,YAAY,GACtB,OAAO,CAAC,eAAe,CAAC,CA+C1B"}

package/dist/tasks/list.js

@@ -1,68 +0,0 @@
-/**
- * Task listing with filters.
- * @task T4460
- * @epic T4454
- */
-import { paginate } from '../pagination.js';
-const TASK_LIST_DEFAULT_LIMIT = 10;
-/** Convert a full Task to compact representation. */
-export function toCompact(task) {
-    return {
-        id: task.id,
-        title: task.title,
-        status: task.status,
-        priority: task.priority,
-        type: task.type,
-        parentId: task.parentId,
-    };
-}
-/**
- * List tasks with optional filtering and pagination.
- * @task T4460
- */
-export async function listTasks(options = {}, cwd, accessor) {
-    const dataAccessor = accessor ?? (await (await import('../store/data-accessor.js')).getAccessor(cwd));
-    // Build targeted query filters
-    const queryFilters = {
-        orderBy: 'position',
-    };
-    if (options.status)
-        queryFilters.status = options.status;
-    if (options.priority)
-        queryFilters.priority = options.priority;
-    if (options.type)
-        queryFilters.type = options.type;
-    if (options.parentId)
-        queryFilters.parentId = options.parentId;
-    if (options.phase)
-        queryFilters.phase = options.phase;
-    if (options.label)
-        queryFilters.label = options.label;
-    const queryResult = await dataAccessor.queryTasks(queryFilters);
-    let filtered = queryResult.tasks;
-    const filteredCount = queryResult.total;
-    // Get total count of all tasks (unfiltered) for the response
-    const total = await dataAccessor.countTasks();
-    const limit = options.limit === 0
-        ? undefined
-        : typeof options.limit === 'number' && options.limit > 0
-            ? options.limit
-            : TASK_LIST_DEFAULT_LIMIT;
-    const offset = typeof options.offset === 'number' && options.offset > 0 ? options.offset : undefined;
-    const { items: tasks, page } = paginate(filtered, limit, offset);
-    const pagination = page.mode === 'offset'
-        ? {
-            limit: page.limit,
-            offset: page.offset,
-            hasMore: page.hasMore,
-        }
-        : undefined;
-    return {
-        tasks,
-        total,
-        filtered: filteredCount,
-        page,
-        pagination,
-    };
-}
-//# sourceMappingURL=list.js.map

package/dist/tasks/list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/tasks/list.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAYnC,qDAAqD;AACrD,MAAM,UAAU,SAAS,CAAC,IAAU;IAClC,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;KACxB,CAAC;AACJ,CAAC;AA4BD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,UAA4B,EAAE,EAC9B,GAAY,EACZ,QAAuB;IAEvB,MAAM,YAAY,GAChB,QAAQ,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM,CAAC,2BAA2B,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IAEnF,+BAA+B;IAC/B,MAAM,YAAY,GAAqB;QACrC,OAAO,EAAE,UAAU;KACpB,CAAC;IACF,IAAI,OAAO,CAAC,MAAM;QAAE,YAAY,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IACzD,IAAI,OAAO,CAAC,QAAQ;QAAE,YAAY,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;IAC/D,IAAI,OAAO,CAAC,IAAI;QAAE,YAAY,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IACnD,IAAI,OAAO,CAAC,QAAQ;QAAE,YAAY,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;IAC/D,IAAI,OAAO,CAAC,KAAK;QAAE,YAAY,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IACtD,IAAI,OAAO,CAAC,KAAK;QAAE,YAAY,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAEtD,MAAM,WAAW,GAAG,MAAM,YAAY,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;IAChE,IAAI,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC;IACjC,MAAM,aAAa,GAAG,WAAW,CAAC,KAAK,CAAC;IAExC,6DAA6D;IAC7D,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,UAAU,EAAE,CAAC;IAE9C,MAAM,KAAK,GACT,OAAO,CAAC,KAAK,KAAK,CAAC;QACjB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,OAAO,OAAO,CAAC,KAAK,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,GAAG,CAAC;YACtD,CAAC,CAAC,OAAO,CAAC,KAAK;YACf,CAAC,CAAC,uBAAuB,CAAC;IAChC,MAAM,MAAM,GACV,OAAO,OAAO,CAAC,MAAM,KAAK,QAAQ,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACxF,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACjE,MAAM,UAAU,GACd,IAAI,CAAC,IAAI,KAAK,QAAQ;QACpB,CAAC,CAAC;YACE,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,OAAO,EAAE,IAAI,CAAC,OAAO;SACtB;QACH,CAAC,CAAC,SAAS,CAAC;IAEhB,OAAO;QACL,KAAK;QACL,KAAK;QACL,QAAQ,EAAE,aAAa;QACvB,IAAI;QACJ,UAAU;KACX,CAAC;AACJ,CAAC"}