@cleocode/core 2026.4.13 → 2026.4.15

package/dist/intelligence/impact.js

@@ -1,675 +0,0 @@
-/**
- * Impact analysis module - dependency-aware prediction of downstream effects.
- *
- * Builds on the existing dependency graph infrastructure in phases/deps.ts
- * and orchestration/analyze.ts to provide:
- *   - Task impact assessment (direct + transitive dependents)
- *   - Change impact prediction (cancel, block, complete, reprioritize)
- *   - Blast radius calculation (scope quantification)
- *   - Free-text impact prediction (predictImpact) — T043
- *
- * @module intelligence
- */
-import { getAccessor } from '../store/data-accessor.js';
-import { getCriticalPath } from '../tasks/graph-ops.js';
-import { getParentChain } from '../tasks/hierarchy.js';
-// ============================================================================
-// Internal Helpers
-// ============================================================================
-/**
- * Load all tasks from the data store.
- */
-async function loadAllTasks(accessor) {
-    const { tasks } = await accessor.queryTasks({});
-    return tasks;
-}
-/**
- * Build a reverse adjacency map: taskId -> set of tasks that depend on it.
- * Reuses buildGraph from phases/deps.ts for the forward graph, then inverts.
- */
-function buildDependentsMap(tasks) {
-    const dependents = new Map();
-    for (const task of tasks) {
-        if (!dependents.has(task.id)) {
-            dependents.set(task.id, new Set());
-        }
-        if (task.depends) {
-            for (const depId of task.depends) {
-                if (!dependents.has(depId)) {
-                    dependents.set(depId, new Set());
-                }
-                dependents.get(depId).add(task.id);
-            }
-        }
-    }
-    return dependents;
-}
-/**
- * Collect all transitive dependents via BFS.
- * Returns set excluding the source task itself.
- */
-function collectTransitiveDependents(taskId, dependentsMap) {
-    const visited = new Set();
-    const queue = [taskId];
-    while (queue.length > 0) {
-        const current = queue.shift();
-        const deps = dependentsMap.get(current);
-        if (!deps)
-            continue;
-        for (const depId of deps) {
-            if (!visited.has(depId)) {
-                visited.add(depId);
-                queue.push(depId);
-            }
-        }
-    }
-    return visited;
-}
-/**
- * Count tasks that would be blocked (have unmet dependencies) if
- * the given task is not completed.
- */
-function countBlockedWork(taskId, transitiveDependents, taskMap) {
-    let count = 0;
-    for (const depId of transitiveDependents) {
-        if (depId === taskId)
-            continue; // Exclude the source task itself
-        const task = taskMap.get(depId);
-        if (!task)
-            continue;
-        // A task is considered blocked-work if it has a dependency on the
-        // source task (directly or transitively) and is not yet completed.
-        if (task.status !== 'done' && task.status !== 'cancelled') {
-            count++;
-        }
-    }
-    return count;
-}
-/**
- * Find epic IDs whose pipelines are affected by changes to a task.
- * A pipeline is affected if the task or any of its transitive dependents
- * belong to that epic's hierarchy.
- */
-function findAffectedPipelines(taskId, transitiveDependents, tasks) {
-    const affectedEpicIds = new Set();
-    const allAffectedIds = new Set([taskId, ...transitiveDependents]);
-    for (const id of allAffectedIds) {
-        const task = tasks.find((t) => t.id === id);
-        if (!task)
-            continue;
-        // Walk parent chain to find epics
-        const ancestors = getParentChain(id, tasks);
-        for (const ancestor of ancestors) {
-            if (ancestor.type === 'epic') {
-                affectedEpicIds.add(ancestor.id);
-            }
-        }
-        // The task itself might be an epic
-        if (task.type === 'epic') {
-            affectedEpicIds.add(task.id);
-        }
-    }
-    return Array.from(affectedEpicIds);
-}
-/**
- * Check whether a task lies on the critical path.
- * Reuses getCriticalPath from tasks/graph-ops.ts.
- */
-function isTaskOnCriticalPath(taskId, tasks) {
-    const criticalPath = getCriticalPath(tasks);
-    return criticalPath.includes(taskId);
-}
-/**
- * Classify blast radius severity based on project percentage.
- */
-function classifySeverity(projectPercentage) {
-    if (projectPercentage <= 1)
-        return 'isolated';
-    if (projectPercentage <= 10)
-        return 'moderate';
-    if (projectPercentage <= 30)
-        return 'widespread';
-    return 'critical';
-}
-/**
- * Compute the maximum cascade depth via DFS from the source task
- * through its transitive dependents.
- */
-function computeCascadeDepth(taskId, dependentsMap) {
-    const visited = new Set();
-    function dfs(id) {
-        if (visited.has(id))
-            return 0;
-        visited.add(id);
-        const deps = dependentsMap.get(id);
-        if (!deps || deps.size === 0)
-            return 0;
-        let maxDepth = 0;
-        for (const depId of deps) {
-            const depth = dfs(depId);
-            if (depth > maxDepth)
-                maxDepth = depth;
-        }
-        return maxDepth + 1;
-    }
-    return dfs(taskId);
-}
-// ============================================================================
-// Public API
-// ============================================================================
-/**
- * Analyze the full downstream impact of a task.
- *
- * Computes direct and transitive dependents, affected lifecycle pipelines,
- * blocked work counts, critical path membership, and blast radius.
- *
- * @param taskId - The task to analyze
- * @param accessor - DataAccessor instance (or auto-created from cwd)
- * @param cwd - Working directory (used if accessor is not provided)
- * @returns Full impact assessment
- */
-export async function analyzeTaskImpact(taskId, accessor, cwd) {
-    const acc = accessor ?? (await getAccessor(cwd));
-    const tasks = await loadAllTasks(acc);
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    if (!taskMap.has(taskId)) {
-        return {
-            taskId,
-            directDependents: [],
-            transitiveDependents: [],
-            affectedPipelines: [],
-            blockedWorkCount: 0,
-            isOnCriticalPath: false,
-            blastRadius: {
-                directCount: 0,
-                transitiveCount: 0,
-                epicCount: 0,
-                projectPercentage: 0,
-                severity: 'isolated',
-            },
-        };
-    }
-    const dependentsMap = buildDependentsMap(tasks);
-    const directDeps = dependentsMap.get(taskId) ?? new Set();
-    const transitiveDeps = collectTransitiveDependents(taskId, dependentsMap);
-    const affectedPipelines = findAffectedPipelines(taskId, transitiveDeps, tasks);
-    const blockedWorkCount = countBlockedWork(taskId, transitiveDeps, taskMap);
-    const onCriticalPath = isTaskOnCriticalPath(taskId, tasks);
-    const blastRadius = calculateBlastRadiusFromData(taskId, directDeps, transitiveDeps, tasks);
-    return {
-        taskId,
-        directDependents: Array.from(directDeps),
-        transitiveDependents: Array.from(transitiveDeps),
-        affectedPipelines,
-        blockedWorkCount,
-        isOnCriticalPath: onCriticalPath,
-        blastRadius,
-    };
-}
-/**
- * Analyze the downstream effects of a specific change to a task.
- *
- * Predicts what happens when a task is cancelled, blocked, completed,
- * or reprioritized, including cascading status changes.
- *
- * @param taskId - The task being changed
- * @param changeType - The type of change
- * @param accessor - DataAccessor instance (or auto-created from cwd)
- * @param cwd - Working directory (used if accessor is not provided)
- * @returns Predicted change impact
- */
-export async function analyzeChangeImpact(taskId, changeType, accessor, cwd) {
-    const acc = accessor ?? (await getAccessor(cwd));
-    const tasks = await loadAllTasks(acc);
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    const sourceTask = taskMap.get(taskId);
-    if (!sourceTask) {
-        return {
-            taskId,
-            changeType,
-            affectedTasks: [],
-            cascadeDepth: 0,
-            recommendation: `Task ${taskId} not found.`,
-        };
-    }
-    const dependentsMap = buildDependentsMap(tasks);
-    const transitiveDeps = collectTransitiveDependents(taskId, dependentsMap);
-    const cascadeDepth = computeCascadeDepth(taskId, dependentsMap);
-    const affectedTasks = [];
-    switch (changeType) {
-        case 'cancel':
-            affectedTasks.push(...predictCancelEffects(taskId, transitiveDeps, dependentsMap, taskMap));
-            break;
-        case 'block':
-            affectedTasks.push(...predictBlockEffects(taskId, transitiveDeps, dependentsMap, taskMap));
-            break;
-        case 'complete':
-            affectedTasks.push(...predictCompleteEffects(taskId, transitiveDeps, dependentsMap, taskMap));
-            break;
-        case 'reprioritize':
-            affectedTasks.push(...predictReprioritizeEffects(taskId, transitiveDeps, taskMap));
-            break;
-    }
-    const recommendation = generateRecommendation(changeType, affectedTasks.length, cascadeDepth, taskId);
-    return {
-        taskId,
-        changeType,
-        affectedTasks,
-        cascadeDepth,
-        recommendation,
-    };
-}
-/**
- * Calculate the blast radius for a task.
- *
- * Quantifies how many tasks, epics, and what percentage of the project
- * would be impacted by changes to this task.
- *
- * @param taskId - The task to analyze
- * @param accessor - DataAccessor instance (or auto-created from cwd)
- * @param cwd - Working directory (used if accessor is not provided)
- * @returns Blast radius metrics
- */
-export async function calculateBlastRadius(taskId, accessor, cwd) {
-    const acc = accessor ?? (await getAccessor(cwd));
-    const tasks = await loadAllTasks(acc);
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    if (!taskMap.has(taskId)) {
-        return {
-            directCount: 0,
-            transitiveCount: 0,
-            epicCount: 0,
-            projectPercentage: 0,
-            severity: 'isolated',
-        };
-    }
-    const dependentsMap = buildDependentsMap(tasks);
-    const directDeps = dependentsMap.get(taskId) ?? new Set();
-    const transitiveDeps = collectTransitiveDependents(taskId, dependentsMap);
-    return calculateBlastRadiusFromData(taskId, directDeps, transitiveDeps, tasks);
-}
-// ============================================================================
-// Change Effect Predictors
-// ============================================================================
-/**
- * Predict effects of cancelling a task.
- * Direct dependents whose only unmet dependency is this task become orphaned.
- * Transitive dependents that lose their last prerequisite also cascade.
- */
-function predictCancelEffects(taskId, transitiveDeps, dependentsMap, taskMap) {
-    const affected = [];
-    const directDeps = dependentsMap.get(taskId) ?? new Set();
-    // Direct dependents: they lose a dependency
-    for (const depId of directDeps) {
-        const task = taskMap.get(depId);
-        if (!task || task.status === 'done' || task.status === 'cancelled')
-            continue;
-        const otherUnmetDeps = (task.depends ?? []).filter((d) => d !== taskId &&
-            taskMap.has(d) &&
-            taskMap.get(d).status !== 'done' &&
-            taskMap.get(d).status !== 'cancelled');
-        if (otherUnmetDeps.length === 0) {
-            // This was the only blocking dep -- task becomes unblocked but orphaned
-            affected.push({
-                id: depId,
-                title: task.title,
-                currentStatus: task.status,
-                newStatus: task.status === 'blocked' ? 'pending' : undefined,
-                reason: 'Direct dependency cancelled; dependency link becomes orphaned.',
-            });
-        }
-        else {
-            affected.push({
-                id: depId,
-                title: task.title,
-                currentStatus: task.status,
-                reason: 'Direct dependency cancelled; other dependencies remain.',
-            });
-        }
-    }
-    // Transitive dependents (excluding direct)
-    for (const depId of transitiveDeps) {
-        if (directDeps.has(depId))
-            continue;
-        const task = taskMap.get(depId);
-        if (!task || task.status === 'done' || task.status === 'cancelled')
-            continue;
-        affected.push({
-            id: depId,
-            title: task.title,
-            currentStatus: task.status,
-            reason: 'Transitive dependency cancelled; may cascade through dependency chain.',
-        });
-    }
-    return affected;
-}
-/**
- * Predict effects of blocking a task.
- * All downstream dependents that are not yet done become cascading-blocked.
- */
-function predictBlockEffects(taskId, transitiveDeps, dependentsMap, taskMap) {
-    const affected = [];
-    for (const depId of transitiveDeps) {
-        const task = taskMap.get(depId);
-        if (!task || task.status === 'done' || task.status === 'cancelled')
-            continue;
-        const isDirect = (dependentsMap.get(taskId) ?? new Set()).has(depId);
-        affected.push({
-            id: depId,
-            title: task.title,
-            currentStatus: task.status,
-            newStatus: 'blocked',
-            reason: isDirect
-                ? 'Direct dependency blocked; task cannot proceed.'
-                : 'Transitive dependency blocked; cascading block through dependency chain.',
-        });
-    }
-    return affected;
-}
-/**
- * Predict effects of completing a task.
- * Dependents whose last unmet dependency was this task become unblocked.
- */
-function predictCompleteEffects(taskId, transitiveDeps, dependentsMap, taskMap) {
-    const affected = [];
-    const directDeps = dependentsMap.get(taskId) ?? new Set();
-    for (const depId of directDeps) {
-        const task = taskMap.get(depId);
-        if (!task || task.status === 'done' || task.status === 'cancelled')
-            continue;
-        const remainingUnmet = (task.depends ?? []).filter((d) => d !== taskId &&
-            taskMap.has(d) &&
-            taskMap.get(d).status !== 'done' &&
-            taskMap.get(d).status !== 'cancelled');
-        if (remainingUnmet.length === 0) {
-            affected.push({
-                id: depId,
-                title: task.title,
-                currentStatus: task.status,
-                newStatus: task.status === 'blocked' ? 'pending' : task.status,
-                reason: 'All dependencies met; task becomes unblocked.',
-            });
-        }
-        else {
-            affected.push({
-                id: depId,
-                title: task.title,
-                currentStatus: task.status,
-                reason: `Dependency completed; ${remainingUnmet.length} other dependency(ies) still unmet.`,
-            });
-        }
-    }
-    // Note transitive downstream tasks that benefit indirectly
-    for (const depId of transitiveDeps) {
-        if (directDeps.has(depId))
-            continue; // Already handled above
-        const task = taskMap.get(depId);
-        if (!task || task.status === 'done' || task.status === 'cancelled')
-            continue;
-        affected.push({
-            id: depId,
-            title: task.title,
-            currentStatus: task.status,
-            reason: 'Upstream dependency completed; may unblock cascading work.',
-        });
-    }
-    return affected;
-}
-/**
- * Predict effects of reprioritizing a task.
- * Downstream tasks may need reordering in execution waves.
- */
-function predictReprioritizeEffects(taskId, transitiveDeps, taskMap) {
-    const affected = [];
-    for (const depId of transitiveDeps) {
-        const task = taskMap.get(depId);
-        if (!task || task.status === 'done' || task.status === 'cancelled')
-            continue;
-        const isDirect = (task.depends ?? []).includes(taskId);
-        affected.push({
-            id: depId,
-            title: task.title,
-            currentStatus: task.status,
-            reason: isDirect
-                ? `Direct dependency ${taskId} reprioritized; execution order may change.`
-                : `Upstream dependency ${taskId} reprioritized; cascading reorder possible.`,
-        });
-    }
-    return affected;
-}
-// ============================================================================
-// Blast Radius Computation
-// ============================================================================
-/**
- * Internal blast radius computation from pre-computed dependency data.
- */
-function calculateBlastRadiusFromData(taskId, directDeps, transitiveDeps, tasks) {
-    const totalTasks = tasks.length;
-    // Find affected epics
-    const affectedEpicIds = new Set();
-    const allAffectedIds = new Set([taskId, ...transitiveDeps]);
-    for (const id of allAffectedIds) {
-        const task = tasks.find((t) => t.id === id);
-        if (!task)
-            continue;
-        const ancestors = getParentChain(id, tasks);
-        for (const ancestor of ancestors) {
-            if (ancestor.type === 'epic') {
-                affectedEpicIds.add(ancestor.id);
-            }
-        }
-        if (task.type === 'epic') {
-            affectedEpicIds.add(task.id);
-        }
-    }
-    const projectPercentage = totalTasks > 0 ? Math.round((transitiveDeps.size / totalTasks) * 100 * 100) / 100 : 0;
-    return {
-        directCount: directDeps.size,
-        transitiveCount: transitiveDeps.size,
-        epicCount: affectedEpicIds.size,
-        projectPercentage,
-        severity: classifySeverity(projectPercentage),
-    };
-}
-// ============================================================================
-// Recommendation Generator
-// ============================================================================
-/**
- * Generate a human-readable recommendation based on impact analysis.
- */
-function generateRecommendation(changeType, affectedCount, cascadeDepth, taskId) {
-    if (affectedCount === 0) {
-        return `No downstream tasks affected. Safe to ${changeType} ${taskId}.`;
-    }
-    const severity = affectedCount > 10 ? 'High' : affectedCount > 3 ? 'Moderate' : 'Low';
-    switch (changeType) {
-        case 'cancel':
-            return (`${severity} impact: cancelling ${taskId} affects ${affectedCount} downstream task(s) ` +
-                `with cascade depth ${cascadeDepth}. Review affected tasks for orphaned dependencies.`);
-        case 'block':
-            return (`${severity} impact: blocking ${taskId} would cascade-block ${affectedCount} downstream task(s) ` +
-                `across ${cascadeDepth} level(s). Consider resolving the blocker to unblock the pipeline.`);
-        case 'complete':
-            return (`Completing ${taskId} would unblock or partially unblock ${affectedCount} downstream task(s). ` +
-                `Cascade depth: ${cascadeDepth}.`);
-        case 'reprioritize':
-            return (`${severity} impact: reprioritizing ${taskId} may reorder ${affectedCount} downstream task(s) ` +
-                `across ${cascadeDepth} level(s) of dependencies.`);
-    }
-}
-// ============================================================================
-// Free-text Impact Prediction (T043)
-// ============================================================================
-/**
- * Score a task against a change description using simple keyword matching.
- *
- * Normalises both strings to lowercase and counts overlapping tokens (words).
- * Returns a score in [0, 1] — 1 meaning every non-trivial token in the change
- * description was found in the task text.
- */
-function scoreTaskMatch(change, task) {
-    const STOP_WORDS = new Set([
-        'a',
-        'an',
-        'the',
-        'and',
-        'or',
-        'in',
-        'of',
-        'to',
-        'for',
-        'with',
-        'on',
-        'at',
-        'by',
-        'is',
-        'it',
-        'be',
-        'as',
-        'if',
-        'do',
-        'not',
-    ]);
-    const tokenise = (text) => text
-        .toLowerCase()
-        .split(/\W+/)
-        .filter((t) => t.length > 2 && !STOP_WORDS.has(t));
-    const changeTokens = new Set(tokenise(change));
-    if (changeTokens.size === 0)
-        return 0;
-    const taskText = `${task.title ?? ''} ${task.description ?? ''}`;
-    const taskTokens = new Set(tokenise(taskText));
-    let matches = 0;
-    for (const token of changeTokens) {
-        if (taskTokens.has(token))
-            matches++;
-    }
-    return matches / changeTokens.size;
-}
-/**
- * Predict the downstream impact of a free-text change description.
- *
- * Uses fuzzy keyword matching to identify candidate tasks that relate to
- * the change, then walks the reverse dependency graph to enumerate all
- * downstream tasks that may be affected.
- *
- * @remarks
- * The matching is purely lexical (no embeddings). Tasks are ranked by
- * how many tokens from the change description appear in their title and
- * description. The top `matchLimit` (default: 5) matched tasks are used
- * as seeds for downstream dependency tracing.
- *
- * @example
- * ```ts
- * import { predictImpact } from '@cleocode/core';
- *
- * const report = await predictImpact('Modify authentication flow', process.cwd());
- * console.log(report.summary);
- * // "3 tasks matched 'Modify authentication flow'; 7 downstream tasks affected."
- * for (const task of report.affectedTasks) {
- *   console.log(`${task.id} (${task.exposure}): ${task.reason}`);
- * }
- * ```
- *
- * @param change - Free-text description of the proposed change (e.g. "Modify X")
- * @param cwd - Working directory used to locate the tasks database
- * @param accessor - Optional pre-created DataAccessor (useful in tests)
- * @param matchLimit - Maximum number of seed tasks to match (default: 5)
- * @returns Full impact prediction report
- */
-export async function predictImpact(change, cwd, accessor, matchLimit = 5) {
-    const acc = accessor ?? (await getAccessor(cwd));
-    const tasks = await loadAllTasks(acc);
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    const dependentsMap = buildDependentsMap(tasks);
-    // --- Step 1: Score every task against the change description ---
-    const scored = tasks
-        .map((t) => ({ task: t, score: scoreTaskMatch(change, t) }))
-        .filter(({ score }) => score > 0)
-        .sort((a, b) => b.score - a.score);
-    const seeds = scored.slice(0, matchLimit).map(({ task }) => task);
-    if (seeds.length === 0) {
-        return {
-            change,
-            matchedTasks: [],
-            affectedTasks: [],
-            totalAffected: 0,
-            summary: `No tasks matched the change description "${change}".`,
-        };
-    }
-    // --- Step 2: Collect all affected task IDs via reverse dependency graph ---
-    const directMatchIds = new Set(seeds.map((t) => t.id));
-    // Map: taskId -> exposure level
-    const exposureMap = new Map();
-    for (const id of directMatchIds) {
-        exposureMap.set(id, 'direct');
-    }
-    // BFS over dependents for each seed
-    for (const seed of seeds) {
-        const transitive = collectTransitiveDependents(seed.id, dependentsMap);
-        for (const depId of transitive) {
-            if (!exposureMap.has(depId)) {
-                // Determine whether this is a direct dependent of the seed or further out
-                const isDirectDependent = (dependentsMap.get(seed.id) ?? new Set()).has(depId);
-                exposureMap.set(depId, isDirectDependent ? 'dependent' : 'transitive');
-            }
-        }
-    }
-    // --- Step 3: Build ImpactedTask list ---
-    const EXPOSURE_ORDER = {
-        direct: 0,
-        dependent: 1,
-        transitive: 2,
-    };
-    const affectedTasks = [];
-    for (const [id, exposure] of exposureMap) {
-        const task = taskMap.get(id);
-        if (!task)
-            continue;
-        const downstreamTransitive = collectTransitiveDependents(id, dependentsMap);
-        const downstreamCount = downstreamTransitive.size;
-        let reason;
-        if (exposure === 'direct') {
-            reason = `Task title/description matched "${change}".`;
-        }
-        else if (exposure === 'dependent') {
-            const seedNames = seeds
-                .filter((s) => (dependentsMap.get(s.id) ?? new Set()).has(id))
-                .map((s) => s.id)
-                .join(', ');
-            reason = `Directly depends on matched task(s): ${seedNames}.`;
-        }
-        else {
-            reason = 'Downstream of a matched task via transitive dependency chain.';
-        }
-        affectedTasks.push({
-            id,
-            title: task.title,
-            status: task.status,
-            priority: task.priority,
-            exposure,
-            downstreamCount,
-            reason,
-        });
-    }
-    // Sort: exposure order first, then descending downstream count
-    affectedTasks.sort((a, b) => {
-        const expDiff = EXPOSURE_ORDER[a.exposure] - EXPOSURE_ORDER[b.exposure];
-        if (expDiff !== 0)
-            return expDiff;
-        return b.downstreamCount - a.downstreamCount;
-    });
-    const matchedTasks = affectedTasks.filter((t) => t.exposure === 'direct');
-    const totalAffected = affectedTasks.length;
-    const summary = matchedTasks.length === 0
-        ? `No tasks matched "${change}".`
-        : `${matchedTasks.length} task(s) matched "${change}"; ${totalAffected} total task(s) affected (including downstream).`;
-    return {
-        change,
-        matchedTasks,
-        affectedTasks,
-        totalAffected,
-        summary,
-    };
-}
-//# sourceMappingURL=impact.js.map