@cleocode/core 2026.4.0 → 2026.4.3

package/dist/tasks/graph-ops.js

@@ -1,171 +0,0 @@
-/**
- * Task graph operations - dependency waves, ordering, and critical path.
- * Ported from lib/tasks/graph-ops.sh
- *
- * @epic T4454
- * @task T4529
- */
-import { topologicalSort } from './dependency-check.js';
-/**
- * Compute dependency waves for parallel execution.
- * Tasks in the same wave can run in parallel; waves must be sequential.
- */
-export function computeDependencyWaves(tasks) {
-    const activeTasks = tasks.filter((t) => t.status !== 'done' && t.status !== 'cancelled');
-    if (activeTasks.length === 0)
-        return [];
-    const taskMap = new Map(activeTasks.map((t) => [t.id, t]));
-    const completedIds = new Set(tasks.filter((t) => t.status === 'done' || t.status === 'cancelled').map((t) => t.id));
-    // Compute in-degree for each task (only counting active deps)
-    const inDegree = new Map();
-    for (const task of activeTasks) {
-        const activeDeps = (task.depends ?? []).filter((d) => !completedIds.has(d) && taskMap.has(d));
-        inDegree.set(task.id, activeDeps.length);
-    }
-    const waves = [];
-    const assigned = new Set();
-    let waveNum = 0;
-    while (assigned.size < activeTasks.length) {
-        // Find all tasks with in-degree 0 that haven't been assigned
-        const wave = [];
-        for (const [id, degree] of inDegree) {
-            if (!assigned.has(id) && degree === 0) {
-                wave.push(id);
-            }
-        }
-        if (wave.length === 0) {
-            // Remaining tasks have cycles - add them all to final wave
-            const remaining = activeTasks.filter((t) => !assigned.has(t.id)).map((t) => t.id);
-            if (remaining.length > 0) {
-                waves.push({ wave: waveNum, taskIds: remaining });
-            }
-            break;
-        }
-        waves.push({ wave: waveNum, taskIds: wave.sort() });
-        // Mark wave tasks as assigned and reduce in-degree
-        for (const id of wave) {
-            assigned.add(id);
-            // Reduce in-degree for dependents
-            for (const task of activeTasks) {
-                if (task.depends?.includes(id) && !assigned.has(task.id)) {
-                    inDegree.set(task.id, (inDegree.get(task.id) ?? 1) - 1);
-                }
-            }
-        }
-        waveNum++;
-    }
-    return waves;
-}
-/**
- * Get the next task to work on (highest priority ready task).
- */
-export function getNextTask(tasks) {
-    const completedIds = new Set(tasks.filter((t) => t.status === 'done' || t.status === 'cancelled').map((t) => t.id));
-    const priorityOrder = {
-        critical: 0,
-        high: 1,
-        medium: 2,
-        low: 3,
-    };
-    const ready = tasks
-        .filter((t) => {
-        if (t.status === 'done' || t.status === 'cancelled')
-            return false;
-        if (t.status === 'active')
-            return true; // Already active = highest priority
-        if (!t.depends?.length)
-            return true;
-        return t.depends.every((d) => completedIds.has(d));
-    })
-        .sort((a, b) => {
-        // Active tasks first
-        if (a.status === 'active' && b.status !== 'active')
-            return -1;
-        if (b.status === 'active' && a.status !== 'active')
-            return 1;
-        // Then by priority
-        const pa = priorityOrder[a.priority] ?? 2;
-        const pb = priorityOrder[b.priority] ?? 2;
-        return pa - pb;
-    });
-    return ready[0] ?? null;
-}
-/**
- * Calculate the critical path (longest dependency chain).
- * Returns task IDs along the critical path.
- */
-export function getCriticalPath(tasks) {
-    const activeTasks = tasks.filter((t) => t.status !== 'done' && t.status !== 'cancelled');
-    if (activeTasks.length === 0)
-        return [];
-    const sorted = topologicalSort(activeTasks);
-    if (!sorted)
-        return []; // Cycle detected
-    const taskMap = new Map(activeTasks.map((t) => [t.id, t]));
-    const dist = new Map();
-    const prev = new Map();
-    // Initialize distances
-    for (const id of sorted) {
-        dist.set(id, 0);
-    }
-    // Process in topological order
-    for (const id of sorted) {
-        const task = taskMap.get(id);
-        if (!task?.depends)
-            continue;
-        for (const depId of task.depends) {
-            if (!taskMap.has(depId))
-                continue;
-            const newDist = (dist.get(depId) ?? 0) + 1;
-            if (newDist > (dist.get(id) ?? 0)) {
-                dist.set(id, newDist);
-                prev.set(id, depId);
-            }
-        }
-    }
-    // Find the task with maximum distance
-    let maxDist = 0;
-    let endId = '';
-    for (const [id, d] of dist) {
-        if (d >= maxDist) {
-            maxDist = d;
-            endId = id;
-        }
-    }
-    if (!endId)
-        return [];
-    // Trace back the path
-    const path = [endId];
-    let current = endId;
-    while (prev.has(current)) {
-        current = prev.get(current);
-        path.unshift(current);
-    }
-    return path;
-}
-/**
- * Get task ordering by dependency + priority.
- */
-export function getTaskOrder(tasks) {
-    const sorted = topologicalSort(tasks);
-    if (sorted)
-        return sorted;
-    // Fallback: sort by priority if cycle detected
-    const priorityOrder = {
-        critical: 0,
-        high: 1,
-        medium: 2,
-        low: 3,
-    };
-    return [...tasks]
-        .sort((a, b) => (priorityOrder[a.priority] ?? 2) - (priorityOrder[b.priority] ?? 2))
-        .map((t) => t.id);
-}
-/**
- * Get parallelizable tasks (tasks with no unmet dependencies).
- */
-export function getParallelTasks(tasks) {
-    const waves = computeDependencyWaves(tasks);
-    return waves[0]?.taskIds ?? [];
-}
-//# sourceMappingURL=graph-ops.js.map

package/dist/tasks/graph-ops.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-ops.js","sourceRoot":"","sources":["../../src/tasks/graph-ops.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAQxD;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa;IAClD,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;IAEzF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,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,8DAA8D;IAC9D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9F,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;QAC1C,6DAA6D;QAC7D,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,2DAA2D;YAC3D,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClF,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;YACpD,CAAC;YACD,MAAM;QACR,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAEpD,mDAAmD;QACnD,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,kCAAkC;YAClC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACzD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa;IACvC,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,MAAM,aAAa,GAA2B;QAC5C,QAAQ,EAAE,CAAC;QACX,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;KACP,CAAC;IAEF,MAAM,KAAK,GAAG,KAAK;SAChB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,KAAK,CAAC;QAClE,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC,CAAC,oCAAoC;QAC5E,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM;YAAE,OAAO,IAAI,CAAC;QACpC,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,qBAAqB;QACrB,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC;QAC7D,mBAAmB;QACnB,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC1C,OAAO,EAAE,GAAG,EAAE,CAAC;IACjB,CAAC,CAAC,CAAC;IAEL,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;IAEzF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExC,MAAM,MAAM,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAC5C,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC,CAAC,iBAAiB;IAEzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEvC,uBAAuB;IACvB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,EAAE,OAAO;YAAE,SAAS;QAE7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAClC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3C,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBACtB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;YACjB,OAAO,GAAG,CAAC,CAAC;YACZ,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IAED,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IAEtB,sBAAsB;IACtB,MAAM,IAAI,GAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;QACzB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QAC7B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACxB,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAE1B,+CAA+C;IAC/C,MAAM,aAAa,GAA2B;QAC5C,QAAQ,EAAE,CAAC;QACX,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;KACP,CAAC;IAEF,OAAO,CAAC,GAAG,KAAK,CAAC;SACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;SACnF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,MAAM,KAAK,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI,EAAE,CAAC;AACjC,CAAC"}

package/dist/tasks/graph-rag.js

@@ -1,328 +0,0 @@
-/**
- * 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
- */
-/** Common English stopwords for text comparison. */
-const STOPWORDS = new Set([
-    'a',
-    'an',
-    'the',
-    'and',
-    'or',
-    'but',
-    'in',
-    'on',
-    'at',
-    'to',
-    'for',
-    'of',
-    'with',
-    'by',
-    'from',
-    'as',
-    'is',
-    'was',
-    'are',
-    'were',
-    'be',
-    'been',
-    'being',
-    'have',
-    'has',
-    'had',
-    'do',
-    'does',
-    'did',
-    'will',
-    'would',
-    'could',
-    'should',
-    'may',
-    'might',
-    'must',
-    'shall',
-    'can',
-    'this',
-    'that',
-    'these',
-    'those',
-    'i',
-    'you',
-    'he',
-    'she',
-    'it',
-    'we',
-    'they',
-    'what',
-    'which',
-    'who',
-    'when',
-    'where',
-    'why',
-    'how',
-    'all',
-    'each',
-    'every',
-    'both',
-    'few',
-    'more',
-    'most',
-    'other',
-    'some',
-    'such',
-    'no',
-    'nor',
-    'not',
-    'only',
-    'own',
-    'same',
-    'so',
-    'than',
-    'too',
-    'very',
-    'just',
-    'also',
-    'now',
-    'then',
-    'here',
-    'there',
-    'if',
-    'else',
-    'any',
-]);
-/**
- * Tokenize text: lowercase, remove punctuation, split, remove stopwords.
- */
-function tokenize(text) {
-    const tokens = text
-        .toLowerCase()
-        .replace(/[^a-z0-9\s]/g, ' ')
-        .split(/\s+/)
-        .filter((t) => t.length > 0 && !STOPWORDS.has(t));
-    return new Set(tokens);
-}
-/**
- * Calculate Jaccard similarity between two sets.
- */
-function jaccardSimilarity(a, b) {
-    if (a.size === 0 && b.size === 0)
-        return 0;
-    let intersection = 0;
-    for (const item of a) {
-        if (b.has(item))
-            intersection++;
-    }
-    const union = new Set([...a, ...b]).size;
-    if (union === 0)
-        return 0;
-    return intersection / union;
-}
-/**
- * Discover related tasks by shared labels.
- */
-export function discoverByLabels(taskId, tasks) {
-    const source = tasks.find((t) => t.id === taskId);
-    if (!source?.labels?.length)
-        return [];
-    const sourceLabels = new Set(source.labels);
-    const results = [];
-    for (const task of tasks) {
-        if (task.id === taskId)
-            continue;
-        if (!task.labels?.length)
-            continue;
-        const taskLabels = new Set(task.labels);
-        const shared = [...sourceLabels].filter((l) => taskLabels.has(l));
-        if (shared.length === 0)
-            continue;
-        const allLabels = new Set([...sourceLabels, ...taskLabels]);
-        const score = shared.length / allLabels.size;
-        results.push({
-            taskId: task.id,
-            type: 'relates-to',
-            reason: `${shared.length} shared label(s): ${shared.join(', ')}`,
-            score: Math.round(score * 100) / 100,
-        });
-    }
-    return results.sort((a, b) => b.score - a.score);
-}
-/**
- * Discover related tasks by description similarity (keyword-based Jaccard).
- */
-export function discoverByDescription(taskId, tasks) {
-    const source = tasks.find((t) => t.id === taskId);
-    if (!source)
-        return [];
-    const sourceText = `${source.title ?? ''} ${source.description ?? ''}`;
-    const sourceTokens = tokenize(sourceText);
-    if (sourceTokens.size === 0)
-        return [];
-    const results = [];
-    for (const task of tasks) {
-        if (task.id === taskId)
-            continue;
-        const text = `${task.title ?? ''} ${task.description ?? ''}`;
-        const tokens = tokenize(text);
-        if (tokens.size === 0)
-            continue;
-        const score = jaccardSimilarity(sourceTokens, tokens);
-        if (score <= 0)
-            continue;
-        let sharedCount = 0;
-        for (const t of sourceTokens) {
-            if (tokens.has(t))
-                sharedCount++;
-        }
-        results.push({
-            taskId: task.id,
-            type: 'relates-to',
-            reason: `${sharedCount} shared keyword(s)`,
-            score: Math.round(score * 100) / 100,
-        });
-    }
-    return results.sort((a, b) => b.score - a.score);
-}
-/**
- * Discover related tasks by shared files.
- */
-export function discoverByFiles(taskId, tasks) {
-    const source = tasks.find((t) => t.id === taskId);
-    if (!source?.files?.length)
-        return [];
-    const sourceFiles = new Set(source.files);
-    const results = [];
-    for (const task of tasks) {
-        if (task.id === taskId)
-            continue;
-        if (!task.files?.length)
-            continue;
-        const taskFiles = new Set(task.files);
-        const shared = [...sourceFiles].filter((f) => taskFiles.has(f));
-        if (shared.length === 0)
-            continue;
-        const allFiles = new Set([...sourceFiles, ...taskFiles]);
-        const score = shared.length / allFiles.size;
-        const preview = shared.slice(0, 3).join(', ');
-        const suffix = shared.length > 3 ? '...' : '';
-        results.push({
-            taskId: task.id,
-            type: 'relates-to',
-            reason: `${shared.length} shared file(s): ${preview}${suffix}`,
-            score: Math.round(score * 100) / 100,
-        });
-    }
-    return results.sort((a, b) => b.score - a.score);
-}
-/**
- * Discover related tasks by hierarchical proximity (siblings and cousins).
- */
-export function discoverByHierarchy(taskId, tasks, options) {
-    const { siblingBoost = 0.15, cousinBoost = 0.08 } = options ?? {};
-    const source = tasks.find((t) => t.id === taskId);
-    if (!source)
-        return [];
-    const results = [];
-    // Find siblings (same parent)
-    if (source.parentId) {
-        const siblings = tasks.filter((t) => t.parentId === source.parentId && t.id !== taskId);
-        for (const sib of siblings) {
-            results.push({
-                taskId: sib.id,
-                type: 'relates-to',
-                reason: `sibling (shared parent ${source.parentId})`,
-                score: siblingBoost,
-                _hierarchyBoost: siblingBoost,
-                _relationship: 'sibling',
-            });
-        }
-        // Find cousins (same grandparent, different parent)
-        const parent = tasks.find((t) => t.id === source.parentId);
-        if (parent?.parentId) {
-            const auntsUncles = tasks.filter((t) => t.parentId === parent.parentId && t.id !== source.parentId);
-            const auntUncleIds = new Set(auntsUncles.map((t) => t.id));
-            const cousins = tasks.filter((t) => t.parentId && auntUncleIds.has(t.parentId));
-            for (const cousin of cousins) {
-                results.push({
-                    taskId: cousin.id,
-                    type: 'relates-to',
-                    reason: `cousin (shared grandparent ${parent.parentId})`,
-                    score: cousinBoost,
-                    _hierarchyBoost: cousinBoost,
-                    _relationship: 'cousin',
-                });
-            }
-        }
-    }
-    return results.sort((a, b) => b.score - a.score);
-}
-/**
- * Discover related tasks using all methods combined.
- */
-export function discoverRelatedTasks(taskId, tasks, method = 'auto') {
-    const task = tasks.find((t) => t.id === taskId);
-    if (!task)
-        return [];
-    switch (method) {
-        case 'labels':
-            return discoverByLabels(taskId, tasks);
-        case 'description':
-            return discoverByDescription(taskId, tasks);
-        case 'files':
-            return discoverByFiles(taskId, tasks);
-        case 'hierarchy':
-            return discoverByHierarchy(taskId, tasks);
-        default: {
-            const labels = discoverByLabels(taskId, tasks);
-            const description = discoverByDescription(taskId, tasks);
-            const files = discoverByFiles(taskId, tasks);
-            const hierarchy = discoverByHierarchy(taskId, tasks);
-            // Merge: group by taskId, apply hierarchy boost
-            const combined = new Map();
-            // Add base results (take highest score per taskId)
-            for (const match of [...labels, ...description, ...files]) {
-                const existing = combined.get(match.taskId);
-                if (!existing || match.score > existing.score) {
-                    combined.set(match.taskId, { ...match });
-                }
-            }
-            // Apply hierarchy boosts
-            for (const hMatch of hierarchy) {
-                const existing = combined.get(hMatch.taskId);
-                if (existing) {
-                    existing.score = Math.min(existing.score + (hMatch._hierarchyBoost ?? 0), 1.0);
-                    existing._hierarchyBoost = hMatch._hierarchyBoost;
-                    existing._relationship = hMatch._relationship;
-                }
-                else {
-                    // Task only found via hierarchy
-                    combined.set(hMatch.taskId, { ...hMatch });
-                }
-            }
-            return [...combined.values()].sort((a, b) => b.score - a.score);
-        }
-    }
-}
-/**
- * Suggest relates entries filtered by threshold.
- */
-export function suggestRelates(taskId, tasks, threshold = 0.5) {
-    const task = tasks.find((t) => t.id === taskId);
-    if (!task)
-        return [];
-    const all = discoverRelatedTasks(taskId, tasks, 'auto');
-    // Exclude already-related tasks
-    const existingRelates = new Set();
-    // Tasks may have a `relates` field (not in the type but used at runtime)
-    const taskAny = task;
-    if (taskAny.relates) {
-        for (const r of taskAny.relates) {
-            existingRelates.add(r.taskId);
-        }
-    }
-    return all.filter((m) => m.score >= threshold && !existingRelates.has(m.taskId));
-}
-//# sourceMappingURL=graph-rag.js.map

package/dist/tasks/graph-rag.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-rag.js","sourceRoot":"","sources":["../../src/tasks/graph-rag.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAkBH,oDAAoD;AACpD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,GAAG;IACH,IAAI;IACJ,KAAK;IACL,KAAK;IACL,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,QAAQ;IACR,KAAK;IACL,OAAO;IACP,MAAM;IACN,OAAO;IACP,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,OAAO;IACP,GAAG;IACH,KAAK;IACL,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,MAAM;IACN,OAAO;IACP,KAAK;IACL,MAAM;IACN,OAAO;IACP,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,MAAM;IACN,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,IAAI;IACJ,MAAM;IACN,KAAK;CACN,CAAC,CAAC;AAEH;;GAEG;AACH,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,MAAM,GAAG,IAAI;SAChB,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,CAAc,EAAE,CAAc;IACvD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,YAAY,EAAE,CAAC;IAClC,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE1B,OAAO,YAAY,GAAG,KAAK,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,KAAa;IAC5D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM;QAAE,OAAO,EAAE,CAAC;IAEvC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM;YAAE,SAAS;QACjC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM;YAAE,SAAS;QAEnC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAElC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC;QAE7C,OAAO,CAAC,IAAI,CAAC;YACX,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,qBAAqB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAChE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG;SACrC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,MAAc,EAAE,KAAa;IACjE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,UAAU,GAAG,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,IAAI,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;IACvE,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IAC1C,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvC,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM;YAAE,SAAS;QAEjC,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,IAAI,IAAI,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;QAC7D,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QAEhC,MAAM,KAAK,GAAG,iBAAiB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;QACtD,IAAI,KAAK,IAAI,CAAC;YAAE,SAAS;QAEzB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,WAAW,EAAE,CAAC;QACnC,CAAC;QAED,OAAO,CAAC,IAAI,CAAC;YACX,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,GAAG,WAAW,oBAAoB;YAC1C,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG;SACrC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc,EAAE,KAAa;IAC3D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM;QAAE,OAAO,EAAE,CAAC;IAEtC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM;YAAE,SAAS;QACjC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM;YAAE,SAAS;QAElC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAElC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC;QAE5C,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAE9C,OAAO,CAAC,IAAI,CAAC;YACX,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,oBAAoB,OAAO,GAAG,MAAM,EAAE;YAC9D,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG;SACrC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAc,EACd,KAAa,EACb,OAAyD;IAEzD,MAAM,EAAE,YAAY,GAAG,IAAI,EAAE,WAAW,GAAG,IAAI,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;IAElE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,8BAA8B;IAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpB,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QACxF,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC;gBACX,MAAM,EAAE,GAAG,CAAC,EAAE;gBACd,IAAI,EAAE,YAAY;gBAClB,MAAM,EAAE,0BAA0B,MAAM,CAAC,QAAQ,GAAG;gBACpD,KAAK,EAAE,YAAY;gBACnB,eAAe,EAAE,YAAY;gBAC7B,aAAa,EAAE,SAAS;aACzB,CAAC,CAAC;QACL,CAAC;QAED,oDAAoD;QACpD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC3D,IAAI,MAAM,EAAE,QAAQ,EAAE,CAAC;YACrB,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,QAAQ,CAClE,CAAC;YACF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YAEhF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,OAAO,CAAC,IAAI,CAAC;oBACX,MAAM,EAAE,MAAM,CAAC,EAAE;oBACjB,IAAI,EAAE,YAAY;oBAClB,MAAM,EAAE,8BAA8B,MAAM,CAAC,QAAQ,GAAG;oBACxD,KAAK,EAAE,WAAW;oBAClB,eAAe,EAAE,WAAW;oBAC5B,aAAa,EAAE,QAAQ;iBACxB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAc,EACd,KAAa,EACb,SAA0B,MAAM;IAEhC,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,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACzC,KAAK,aAAa;YAChB,OAAO,qBAAqB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC9C,KAAK,OAAO;YACV,OAAO,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACxC,KAAK,WAAW;YACd,OAAO,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5C,OAAO,CAAC,CAAC,CAAC;YACR,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC/C,MAAM,WAAW,GAAG,qBAAqB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACzD,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC7C,MAAM,SAAS,GAAG,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAErD,gDAAgD;YAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;YAEnD,mDAAmD;YACnD,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,GAAG,WAAW,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;gBAC1D,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC5C,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;oBAC9C,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YAED,yBAAyB;YACzB,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;gBAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC7C,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,eAAe,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC/E,QAAQ,CAAC,eAAe,GAAG,MAAM,CAAC,eAAe,CAAC;oBAClD,QAAQ,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC;gBAChD,CAAC;qBAAM,CAAC;oBACN,gCAAgC;oBAChC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;YAED,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAc,EACd,KAAa,EACb,YAAoB,GAAG;IAEvB,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,MAAM,GAAG,GAAG,oBAAoB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAExD,gCAAgC;IAChC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,yEAAyE;IACzE,MAAM,OAAO,GAAG,IAA2C,CAAC;IAC5D,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YAChC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AACnF,CAAC"}

package/dist/tasks/hierarchy-policy.js

@@ -1,149 +0,0 @@
-/**
- * Unified hierarchy policy resolution and validation.
- * Single source of truth for all hierarchy enforcement paths.
- *
- * @epic T4454
- * @task T5001
- */
-import { getChildren, getDepth, wouldCreateCircle } from './hierarchy.js';
-// ---------------------------------------------------------------------------
-// Constants
-// ---------------------------------------------------------------------------
-export const ENFORCEMENT_PROFILES = {
-    'llm-agent-first': { maxSiblings: 0, maxActiveSiblings: 0, maxDepth: 3, countDoneInLimit: false },
-    'human-cognitive': { maxSiblings: 7, maxActiveSiblings: 3, maxDepth: 3, countDoneInLimit: false },
-};
-// ---------------------------------------------------------------------------
-// Policy resolution
-// ---------------------------------------------------------------------------
-/**
- * Resolve a full HierarchyPolicy from config, starting with a profile preset
- * and overriding with any explicitly set config.hierarchy fields.
- */
-export function resolveHierarchyPolicy(config) {
-    const hierarchy = config.hierarchy;
-    const profileName = hierarchy?.enforcementProfile ?? 'llm-agent-first';
-    const preset = ENFORCEMENT_PROFILES[profileName] ?? ENFORCEMENT_PROFILES['llm-agent-first'];
-    const resolved = {
-        enforcementProfile: profileName in ENFORCEMENT_PROFILES ? profileName : 'custom',
-        maxDepth: preset.maxDepth,
-        maxSiblings: preset.maxSiblings,
-        maxActiveSiblings: preset.maxActiveSiblings,
-        countDoneInLimit: preset.countDoneInLimit,
-    };
-    // Override with explicit config values when present
-    if (hierarchy) {
-        if (typeof hierarchy.maxDepth === 'number') {
-            resolved.maxDepth = hierarchy.maxDepth;
-        }
-        if (typeof hierarchy.maxSiblings === 'number') {
-            resolved.maxSiblings = hierarchy.maxSiblings;
-        }
-        if (typeof hierarchy.maxActiveSiblings === 'number') {
-            resolved.maxActiveSiblings = hierarchy.maxActiveSiblings;
-        }
-        if (typeof hierarchy.countDoneInLimit === 'boolean') {
-            resolved.countDoneInLimit = hierarchy.countDoneInLimit;
-        }
-    }
-    return resolved;
-}
-// ---------------------------------------------------------------------------
-// Validation helpers
-// ---------------------------------------------------------------------------
-/**
- * Assert that a parent task exists in the task list.
- * Returns an error result if not found, null if OK.
- */
-export function assertParentExists(parentId, tasks) {
-    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` },
-        };
-    }
-    return null;
-}
-/**
- * Assert that re-parenting would not create a cycle.
- * Returns an error result if a cycle is detected, null if OK.
- */
-export function assertNoCycle(taskId, newParentId, tasks) {
-    if (wouldCreateCircle(taskId, newParentId, tasks)) {
-        return {
-            valid: false,
-            error: {
-                code: 'E_CIRCULAR_REFERENCE',
-                message: `Setting parent to ${newParentId} would create a circular reference for task ${taskId}`,
-            },
-        };
-    }
-    return null;
-}
-/**
- * Count active (non-done, non-cancelled, non-archived) children of a parent.
- */
-export function countActiveChildren(parentId, tasks) {
-    const activeStatuses = new Set(['pending', 'active', 'blocked']);
-    return tasks.filter((t) => t.parentId === parentId && activeStatuses.has(t.status)).length;
-}
-// ---------------------------------------------------------------------------
-// Primary validation
-// ---------------------------------------------------------------------------
-/**
- * Validate whether a new task can be placed under the given parent
- * according to the resolved hierarchy policy.
- */
-export function validateHierarchyPlacement(parentId, tasks, policy) {
-    // Root placement is always allowed
-    if (parentId === null) {
-        return { valid: true };
-    }
-    // Parent must exist
-    const parentError = assertParentExists(parentId, tasks);
-    if (parentError)
-        return parentError;
-    // Depth check
-    const parentDepth = getDepth(parentId, tasks);
-    if (parentDepth + 1 >= policy.maxDepth) {
-        return {
-            valid: false,
-            error: {
-                code: 'E_DEPTH_EXCEEDED',
-                message: `Maximum nesting depth ${policy.maxDepth} would be exceeded`,
-            },
-        };
-    }
-    // Sibling limit (0 = unlimited)
-    if (policy.maxSiblings > 0) {
-        const children = getChildren(parentId, tasks);
-        const counted = policy.countDoneInLimit
-            ? children.length
-            : children.filter((t) => t.status !== 'done').length;
-        if (counted >= policy.maxSiblings) {
-            return {
-                valid: false,
-                error: {
-                    code: 'E_SIBLING_LIMIT',
-                    message: `Parent ${parentId} already has ${counted} children (limit: ${policy.maxSiblings})`,
-                },
-            };
-        }
-    }
-    // Active sibling limit
-    if (policy.maxActiveSiblings > 0) {
-        const activeCount = countActiveChildren(parentId, tasks);
-        if (activeCount >= policy.maxActiveSiblings) {
-            return {
-                valid: false,
-                error: {
-                    code: 'E_ACTIVE_SIBLING_LIMIT',
-                    message: `Parent ${parentId} already has ${activeCount} active children (limit: ${policy.maxActiveSiblings})`,
-                },
-            };
-        }
-    }
-    return { valid: true };
-}
-//# sourceMappingURL=hierarchy-policy.js.map