@task-mcp/shared 1.0.4 → 1.0.7

package/dist/algorithms/tech-analysis.js

@@ -0,0 +1,296 @@
+/**
+ * Tech area ordering rules (lower = execute first)
+ * Based on dependency flow: DB changes → Infrastructure → Backend → Frontend → Tests
+ */
+const TECH_ORDER = {
+    schema: 0, // DB/schema changes first
+    infra: 0, // Infrastructure setup
+    devops: 1, // CI/CD pipelines
+    backend: 2, // API/server
+    frontend: 3, // UI
+    test: 4, // Tests
+    docs: 4, // Documentation
+    refactor: 5, // Refactoring last
+};
+/**
+ * Risk level ordering (lower = safer, execute first)
+ */
+const RISK_ORDER = {
+    low: 0,
+    medium: 1,
+    high: 2,
+    critical: 3,
+};
+/**
+ * Get the minimum tech order value for a task
+ * If multiple areas, use the lowest (most foundational)
+ */
+function getMinTechOrder(task) {
+    const areas = task.techStack?.areas ?? [];
+    if (areas.length === 0)
+        return TECH_ORDER.backend; // Default to backend
+    return Math.min(...areas.map((area) => TECH_ORDER[area]));
+}
+/**
+ * Get the risk order value for a task
+ */
+function getRiskOrder(task) {
+    const riskLevel = task.techStack?.riskLevel ?? "medium";
+    return RISK_ORDER[riskLevel];
+}
+/**
+ * Check if a task has breaking changes
+ */
+function hasBreakingChange(task) {
+    return task.techStack?.hasBreakingChange === true;
+}
+/**
+ * Suggest safe execution order for tasks
+ *
+ * Ordering strategy:
+ * 1. Tech level (schema → infra → devops → backend → frontend → test → docs → refactor)
+ * 2. Risk level within same tech level (low → medium → high → critical)
+ * 3. Breaking changes last within same tech/risk level
+ * 4. Priority as tiebreaker (critical > high > medium > low)
+ */
+export function suggestSafeOrder(tasks) {
+    // Filter to active tasks only
+    const activeTasks = tasks.filter((t) => t.status === "pending" || t.status === "in_progress");
+    if (activeTasks.length === 0) {
+        return {
+            orderedTasks: [],
+            phases: [],
+            summary: {
+                totalTasks: 0,
+                breakingChanges: 0,
+                highRiskCount: 0,
+            },
+        };
+    }
+    // Sort tasks
+    const sorted = [...activeTasks].sort((a, b) => {
+        // 1. Tech level (lower first)
+        const techDiff = getMinTechOrder(a) - getMinTechOrder(b);
+        if (techDiff !== 0)
+            return techDiff;
+        // 2. Risk level (lower first)
+        const riskDiff = getRiskOrder(a) - getRiskOrder(b);
+        if (riskDiff !== 0)
+            return riskDiff;
+        // 3. Breaking changes last
+        const aBreaking = hasBreakingChange(a) ? 1 : 0;
+        const bBreaking = hasBreakingChange(b) ? 1 : 0;
+        if (aBreaking !== bBreaking)
+            return aBreaking - bBreaking;
+        // 4. Priority as tiebreaker (higher priority first)
+        const priorityOrder = { critical: 0, high: 1, medium: 2, low: 3 };
+        return (priorityOrder[a.priority] ?? 2) - (priorityOrder[b.priority] ?? 2);
+    });
+    // Group into phases by tech level
+    const phases = [];
+    let currentTechOrder = -1;
+    let currentPhase = null;
+    for (const task of sorted) {
+        const techOrder = getMinTechOrder(task);
+        if (techOrder !== currentTechOrder) {
+            // Start new phase
+            const primaryArea = getPrimaryArea(task);
+            currentPhase = {
+                phase: phases.length + 1,
+                primaryArea,
+                tasks: [task],
+                notes: [],
+            };
+            phases.push(currentPhase);
+            currentTechOrder = techOrder;
+        }
+        else {
+            // Add to current phase
+            currentPhase.tasks.push(task);
+        }
+    }
+    // Add notes to phases
+    for (const phase of phases) {
+        const breakingCount = phase.tasks.filter(hasBreakingChange).length;
+        const highRiskCount = phase.tasks.filter((t) => t.techStack?.riskLevel === "high" || t.techStack?.riskLevel === "critical").length;
+        if (breakingCount > 0) {
+            phase.notes.push(`${breakingCount} breaking change(s) - test thoroughly`);
+        }
+        if (highRiskCount > 0) {
+            phase.notes.push(`${highRiskCount} high-risk task(s) - review carefully`);
+        }
+    }
+    // Calculate summary
+    const breakingChanges = sorted.filter(hasBreakingChange).length;
+    const highRiskCount = sorted.filter((t) => t.techStack?.riskLevel === "high" || t.techStack?.riskLevel === "critical").length;
+    return {
+        orderedTasks: sorted,
+        phases,
+        summary: {
+            totalTasks: sorted.length,
+            breakingChanges,
+            highRiskCount,
+        },
+    };
+}
+/**
+ * Get the primary tech area for a task
+ */
+function getPrimaryArea(task) {
+    const areas = task.techStack?.areas;
+    if (!areas || areas.length === 0)
+        return "mixed";
+    // Return the one with lowest order (most foundational)
+    let primary = areas[0];
+    for (let i = 1; i < areas.length; i++) {
+        const area = areas[i];
+        if (TECH_ORDER[area] < TECH_ORDER[primary]) {
+            primary = area;
+        }
+    }
+    return primary;
+}
+/**
+ * Find tasks with breaking changes
+ */
+export function findBreakingChanges(tasks) {
+    return tasks.filter((t) => (t.status === "pending" || t.status === "in_progress") &&
+        hasBreakingChange(t));
+}
+/**
+ * Find high-risk tasks (high or critical risk level)
+ */
+export function findHighRiskTasks(tasks) {
+    return tasks.filter((t) => (t.status === "pending" || t.status === "in_progress") &&
+        (t.techStack?.riskLevel === "high" || t.techStack?.riskLevel === "critical"));
+}
+/**
+ * Group tasks by tech area
+ * A task may appear in multiple groups if it spans multiple areas
+ */
+export function groupByTechArea(tasks) {
+    const groups = new Map();
+    // Initialize all groups
+    const allAreas = [
+        "schema", "infra", "devops", "backend", "frontend", "test", "docs", "refactor"
+    ];
+    for (const area of allAreas) {
+        groups.set(area, []);
+    }
+    // Group active tasks
+    const activeTasks = tasks.filter((t) => t.status === "pending" || t.status === "in_progress");
+    for (const task of activeTasks) {
+        const areas = task.techStack?.areas ?? [];
+        if (areas.length === 0) {
+            // Default to backend if no area specified
+            groups.get("backend").push(task);
+        }
+        else {
+            for (const area of areas) {
+                groups.get(area).push(task);
+            }
+        }
+    }
+    return groups;
+}
+/**
+ * Analyze complexity distribution across tasks
+ */
+export function getComplexitySummary(tasks) {
+    const activeTasks = tasks.filter((t) => t.status === "pending" || t.status === "in_progress");
+    const analyzed = activeTasks.filter((t) => t.complexity?.score !== undefined);
+    const unanalyzed = activeTasks.filter((t) => t.complexity?.score === undefined);
+    // Calculate distribution
+    const distribution = {
+        low: 0,
+        medium: 0,
+        high: 0,
+    };
+    let totalScore = 0;
+    const needsBreakdown = [];
+    for (const task of analyzed) {
+        const score = task.complexity.score;
+        totalScore += score;
+        if (score <= 3) {
+            distribution.low++;
+        }
+        else if (score <= 6) {
+            distribution.medium++;
+        }
+        else {
+            distribution.high++;
+            needsBreakdown.push(task);
+        }
+    }
+    return {
+        distribution,
+        needsBreakdown,
+        averageScore: analyzed.length > 0 ? totalScore / analyzed.length : 0,
+        unanalyzed,
+    };
+}
+/**
+ * Analyze tech stack distribution across tasks
+ */
+export function getTechStackSummary(tasks) {
+    const activeTasks = tasks.filter((t) => t.status === "pending" || t.status === "in_progress");
+    const analyzed = activeTasks.filter((t) => t.techStack?.areas !== undefined);
+    const unanalyzed = activeTasks.filter((t) => t.techStack?.areas === undefined);
+    // Count by area
+    const areaCounts = {
+        schema: 0,
+        infra: 0,
+        devops: 0,
+        backend: 0,
+        frontend: 0,
+        test: 0,
+        docs: 0,
+        refactor: 0,
+    };
+    for (const task of analyzed) {
+        for (const area of task.techStack.areas) {
+            areaCounts[area]++;
+        }
+    }
+    // Risk distribution
+    const riskDistribution = {
+        low: 0,
+        medium: 0,
+        high: 0,
+        critical: 0,
+    };
+    for (const task of analyzed) {
+        const risk = task.techStack?.riskLevel ?? "medium";
+        riskDistribution[risk]++;
+    }
+    // Breaking changes
+    const breakingChanges = findBreakingChanges(activeTasks);
+    return {
+        areaCounts,
+        breakingChanges,
+        riskDistribution,
+        unanalyzed,
+    };
+}
+/**
+ * Suggest number of subtasks based on complexity score
+ *
+ * Mapping:
+ * 1-2: 0 (no breakdown needed)
+ * 3-4: 2
+ * 5-6: 3-4
+ * 7-8: 5-6
+ * 9-10: 7-10
+ */
+export function suggestSubtaskCount(score) {
+    if (score <= 2)
+        return 0;
+    if (score <= 4)
+        return 2;
+    if (score <= 6)
+        return Math.ceil((score - 4) * 0.5 + 3); // 3-4
+    if (score <= 8)
+        return Math.ceil((score - 6) * 0.5 + 5); // 5-6
+    return Math.ceil((score - 8) * 1.5 + 7); // 7-10
+}
+//# sourceMappingURL=tech-analysis.js.map

package/dist/algorithms/tech-analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tech-analysis.js","sourceRoot":"","sources":["../../src/algorithms/tech-analysis.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,MAAM,UAAU,GAA6B;IAC3C,MAAM,EAAE,CAAC,EAAK,0BAA0B;IACxC,KAAK,EAAE,CAAC,EAAM,uBAAuB;IACrC,MAAM,EAAE,CAAC,EAAK,kBAAkB;IAChC,OAAO,EAAE,CAAC,EAAI,aAAa;IAC3B,QAAQ,EAAE,CAAC,EAAG,KAAK;IACnB,IAAI,EAAE,CAAC,EAAO,QAAQ;IACtB,IAAI,EAAE,CAAC,EAAO,gBAAgB;IAC9B,QAAQ,EAAE,CAAC,EAAG,mBAAmB;CAClC,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,GAA8B;IAC5C,GAAG,EAAE,CAAC;IACN,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;IACP,QAAQ,EAAE,CAAC;CACZ,CAAC;AAgCF;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAU;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE,CAAC;IAC1C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC,OAAO,CAAC,CAAC,qBAAqB;IAExE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,IAAU;IAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,IAAI,QAAQ,CAAC;IACxD,OAAO,UAAU,CAAC,SAAS,CAAC,CAAC;AAC/B,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,IAAU;IACnC,OAAO,IAAI,CAAC,SAAS,EAAE,iBAAiB,KAAK,IAAI,CAAC;AACpD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,8BAA8B;IAC9B,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAC5D,CAAC;IAEF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO;YACL,YAAY,EAAE,EAAE;YAChB,MAAM,EAAE,EAAE;YACV,OAAO,EAAE;gBACP,UAAU,EAAE,CAAC;gBACb,eAAe,EAAE,CAAC;gBAClB,aAAa,EAAE,CAAC;aACjB;SACF,CAAC;IACJ,CAAC;IAED,aAAa;IACb,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC5C,8BAA8B;QAC9B,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAEpC,8BAA8B;QAC9B,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,QAAQ,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QAEpC,2BAA2B;QAC3B,MAAM,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,SAAS,GAAG,SAAS,CAAC;QAE1D,oDAAoD;QACpD,MAAM,aAAa,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QAClE,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,kCAAkC;IAClC,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,IAAI,gBAAgB,GAAG,CAAC,CAAC,CAAC;IAC1B,IAAI,YAAY,GAA0B,IAAI,CAAC;IAE/C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QAExC,IAAI,SAAS,KAAK,gBAAgB,EAAE,CAAC;YACnC,kBAAkB;YAClB,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;YACzC,YAAY,GAAG;gBACb,KAAK,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC;gBACxB,WAAW;gBACX,KAAK,EAAE,CAAC,IAAI,CAAC;gBACb,KAAK,EAAE,EAAE;aACV,CAAC;YACF,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1B,gBAAgB,GAAG,SAAS,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,YAAa,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC;QACnE,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,KAAK,UAAU,CAClF,CAAC,MAAM,CAAC;QAET,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,aAAa,uCAAuC,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,aAAa,uCAAuC,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC;IAChE,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CACjC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,KAAK,UAAU,CAClF,CAAC,MAAM,CAAC;IAET,OAAO;QACL,YAAY,EAAE,MAAM;QACpB,MAAM;QACN,OAAO,EAAE;YACP,UAAU,EAAE,MAAM,CAAC,MAAM;YACzB,eAAe;YACf,aAAa;SACd;KACF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,IAAU;IAChC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC;IACpC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAEjD,uDAAuD;IACvD,IAAI,OAAO,GAAa,KAAK,CAAC,CAAC,CAAE,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3C,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAC/C,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC;QACtD,iBAAiB,CAAC,CAAC,CAAC,CACvB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC;QACtD,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,KAAK,UAAU,CAAC,CAC/E,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE3C,wBAAwB;IACxB,MAAM,QAAQ,GAAe;QAC3B,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU;KAC/E,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACvB,CAAC;IAED,qBAAqB;IACrB,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAC5D,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE,CAAC;QAC1C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,0CAA0C;YAC1C,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAyBD;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAa;IAChD,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAC5D,CAAC;IAEF,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC;IAC9E,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC;IAEhF,yBAAyB;IACzB,MAAM,YAAY,GAA2B;QAC3C,GAAG,EAAE,CAAC;QACN,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,CAAC;KACR,CAAC;IAEF,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,cAAc,GAAW,EAAE,CAAC;IAElC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAW,CAAC,KAAM,CAAC;QACtC,UAAU,IAAI,KAAK,CAAC;QAEpB,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,YAAY,CAAC,GAAG,EAAE,CAAC;QACrB,CAAC;aAAM,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACtB,YAAY,CAAC,MAAM,EAAE,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,IAAI,EAAE,CAAC;YACpB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO;QACL,YAAY;QACZ,cAAc;QACd,YAAY,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpE,UAAU;KACX,CAAC;AACJ,CAAC;AAgBD;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAC/C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAC5D,CAAC;IAEF,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC;IAC7E,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC;IAE/E,gBAAgB;IAChB,MAAM,UAAU,GAA6B;QAC3C,MAAM,EAAE,CAAC;QACT,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;QACT,OAAO,EAAE,CAAC;QACV,QAAQ,EAAE,CAAC;QACX,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;QACP,QAAQ,EAAE,CAAC;KACZ,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,SAAU,CAAC,KAAM,EAAE,CAAC;YAC1C,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACrB,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,MAAM,gBAAgB,GAA8B;QAClD,GAAG,EAAE,CAAC;QACN,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,CAAC;QACP,QAAQ,EAAE,CAAC;KACZ,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,IAAI,QAAQ,CAAC;QACnD,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;IAC3B,CAAC;IAED,mBAAmB;IACnB,MAAM,eAAe,GAAG,mBAAmB,CAAC,WAAW,CAAC,CAAC;IAEzD,OAAO;QACL,UAAU;QACV,eAAe;QACf,gBAAgB;QAChB,UAAU;KACX,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAC/C,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM;IAC/D,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM;IAC/D,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO;AAClD,CAAC"}

package/dist/algorithms/tech-analysis.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=tech-analysis.test.d.ts.map

package/dist/algorithms/tech-analysis.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tech-analysis.test.d.ts","sourceRoot":"","sources":["../../src/algorithms/tech-analysis.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/tech-analysis.test.js

@@ -0,0 +1,338 @@
+import { describe, test, expect } from "bun:test";
+import { suggestSafeOrder, findBreakingChanges, findHighRiskTasks, groupByTechArea, getComplexitySummary, getTechStackSummary, suggestSubtaskCount, } from "./tech-analysis.js";
+// Helper to create mock tasks with tech stack analysis
+function createTask(id, options = {}) {
+    const task = {
+        id,
+        title: `Task ${id}`,
+        status: options.status ?? "pending",
+        priority: options.priority ?? "medium",
+        projectId: "test-project",
+        createdAt: new Date().toISOString(),
+        updatedAt: new Date().toISOString(),
+    };
+    if (options.areas || options.riskLevel !== undefined || options.hasBreakingChange !== undefined) {
+        task.techStack = {};
+        if (options.areas) {
+            task.techStack.areas = options.areas;
+        }
+        if (options.riskLevel !== undefined) {
+            task.techStack.riskLevel = options.riskLevel;
+        }
+        if (options.hasBreakingChange !== undefined) {
+            task.techStack.hasBreakingChange = options.hasBreakingChange;
+        }
+    }
+    if (options.complexityScore !== undefined) {
+        task.complexity = {
+            score: options.complexityScore,
+        };
+    }
+    return task;
+}
+describe("suggestSafeOrder", () => {
+    test("returns empty result for empty input", () => {
+        const result = suggestSafeOrder([]);
+        expect(result.orderedTasks).toEqual([]);
+        expect(result.phases).toEqual([]);
+        expect(result.summary.totalTasks).toBe(0);
+    });
+    test("returns empty for all completed tasks", () => {
+        const tasks = [createTask("A", { status: "completed" })];
+        const result = suggestSafeOrder(tasks);
+        expect(result.orderedTasks).toEqual([]);
+    });
+    test("orders by tech level (schema before backend)", () => {
+        const tasks = [
+            createTask("backend-task", { areas: ["backend"] }),
+            createTask("schema-task", { areas: ["schema"] }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.orderedTasks[0].id).toBe("schema-task");
+        expect(result.orderedTasks[1].id).toBe("backend-task");
+    });
+    test("orders by tech level (full chain)", () => {
+        const tasks = [
+            createTask("frontend", { areas: ["frontend"] }),
+            createTask("backend", { areas: ["backend"] }),
+            createTask("schema", { areas: ["schema"] }),
+            createTask("test", { areas: ["test"] }),
+            createTask("devops", { areas: ["devops"] }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        const order = result.orderedTasks.map((t) => t.id);
+        expect(order).toEqual(["schema", "devops", "backend", "frontend", "test"]);
+    });
+    test("orders by risk level within same tech level", () => {
+        const tasks = [
+            createTask("high-risk", { areas: ["backend"], riskLevel: "high" }),
+            createTask("low-risk", { areas: ["backend"], riskLevel: "low" }),
+            createTask("medium-risk", { areas: ["backend"], riskLevel: "medium" }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        const order = result.orderedTasks.map((t) => t.id);
+        expect(order).toEqual(["low-risk", "medium-risk", "high-risk"]);
+    });
+    test("puts breaking changes last within same tech/risk level", () => {
+        const tasks = [
+            createTask("breaking", { areas: ["backend"], riskLevel: "low", hasBreakingChange: true }),
+            createTask("safe", { areas: ["backend"], riskLevel: "low", hasBreakingChange: false }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.orderedTasks[0].id).toBe("safe");
+        expect(result.orderedTasks[1].id).toBe("breaking");
+    });
+    test("uses priority as tiebreaker", () => {
+        const tasks = [
+            createTask("low-priority", { areas: ["backend"], priority: "low" }),
+            createTask("high-priority", { areas: ["backend"], priority: "high" }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.orderedTasks[0].id).toBe("high-priority");
+        expect(result.orderedTasks[1].id).toBe("low-priority");
+    });
+    test("groups tasks into phases by tech level", () => {
+        const tasks = [
+            createTask("schema1", { areas: ["schema"] }),
+            createTask("schema2", { areas: ["schema"] }),
+            createTask("backend1", { areas: ["backend"] }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.phases.length).toBe(2);
+        expect(result.phases[0].primaryArea).toBe("schema");
+        expect(result.phases[0].tasks.length).toBe(2);
+        expect(result.phases[1].primaryArea).toBe("backend");
+        expect(result.phases[1].tasks.length).toBe(1);
+    });
+    test("calculates summary statistics correctly", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], hasBreakingChange: true }),
+            createTask("t2", { areas: ["backend"], riskLevel: "high" }),
+            createTask("t3", { areas: ["backend"], riskLevel: "critical" }),
+            createTask("t4", { areas: ["backend"] }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.summary.totalTasks).toBe(4);
+        expect(result.summary.breakingChanges).toBe(1);
+        expect(result.summary.highRiskCount).toBe(2);
+    });
+});
+describe("findBreakingChanges", () => {
+    test("returns empty for no breaking changes", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], hasBreakingChange: false }),
+            createTask("t2", { areas: ["backend"] }),
+        ];
+        const result = findBreakingChanges(tasks);
+        expect(result).toEqual([]);
+    });
+    test("finds tasks with breaking changes", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], hasBreakingChange: true }),
+            createTask("t2", { areas: ["backend"], hasBreakingChange: false }),
+            createTask("t3", { areas: ["schema"], hasBreakingChange: true }),
+        ];
+        const result = findBreakingChanges(tasks);
+        expect(result.length).toBe(2);
+        expect(result.map((t) => t.id).sort()).toEqual(["t1", "t3"]);
+    });
+    test("excludes completed tasks", () => {
+        const tasks = [
+            createTask("t1", { status: "completed", areas: ["backend"], hasBreakingChange: true }),
+            createTask("t2", { status: "pending", areas: ["backend"], hasBreakingChange: true }),
+        ];
+        const result = findBreakingChanges(tasks);
+        expect(result.length).toBe(1);
+        expect(result[0].id).toBe("t2");
+    });
+});
+describe("findHighRiskTasks", () => {
+    test("returns empty for no high-risk tasks", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], riskLevel: "low" }),
+            createTask("t2", { areas: ["backend"], riskLevel: "medium" }),
+        ];
+        const result = findHighRiskTasks(tasks);
+        expect(result).toEqual([]);
+    });
+    test("finds high and critical risk tasks", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], riskLevel: "low" }),
+            createTask("t2", { areas: ["backend"], riskLevel: "high" }),
+            createTask("t3", { areas: ["backend"], riskLevel: "critical" }),
+        ];
+        const result = findHighRiskTasks(tasks);
+        expect(result.length).toBe(2);
+        expect(result.map((t) => t.id).sort()).toEqual(["t2", "t3"]);
+    });
+});
+describe("groupByTechArea", () => {
+    test("returns all areas with empty arrays for empty input", () => {
+        const result = groupByTechArea([]);
+        expect(result.get("schema")).toEqual([]);
+        expect(result.get("backend")).toEqual([]);
+        expect(result.get("frontend")).toEqual([]);
+    });
+    test("groups tasks by their tech areas", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"] }),
+            createTask("t2", { areas: ["backend"] }),
+            createTask("t3", { areas: ["frontend"] }),
+        ];
+        const result = groupByTechArea(tasks);
+        expect(result.get("backend").length).toBe(2);
+        expect(result.get("frontend").length).toBe(1);
+        expect(result.get("schema").length).toBe(0);
+    });
+    test("task appears in multiple groups if it spans multiple areas", () => {
+        const tasks = [
+            createTask("fullstack", { areas: ["backend", "frontend"] }),
+        ];
+        const result = groupByTechArea(tasks);
+        expect(result.get("backend").length).toBe(1);
+        expect(result.get("frontend").length).toBe(1);
+        expect(result.get("backend")[0].id).toBe("fullstack");
+    });
+    test("defaults to backend if no area specified", () => {
+        const tasks = [createTask("t1", {})];
+        const result = groupByTechArea(tasks);
+        expect(result.get("backend").length).toBe(1);
+    });
+    test("excludes completed tasks", () => {
+        const tasks = [
+            createTask("t1", { status: "completed", areas: ["backend"] }),
+            createTask("t2", { status: "pending", areas: ["backend"] }),
+        ];
+        const result = groupByTechArea(tasks);
+        expect(result.get("backend").length).toBe(1);
+    });
+});
+describe("getComplexitySummary", () => {
+    test("returns empty summary for no tasks", () => {
+        const result = getComplexitySummary([]);
+        expect(result.distribution).toEqual({ low: 0, medium: 0, high: 0 });
+        expect(result.needsBreakdown).toEqual([]);
+        expect(result.averageScore).toBe(0);
+        expect(result.unanalyzed).toEqual([]);
+    });
+    test("calculates distribution correctly", () => {
+        const tasks = [
+            createTask("t1", { complexityScore: 2 }), // low
+            createTask("t2", { complexityScore: 3 }), // low
+            createTask("t3", { complexityScore: 5 }), // medium
+            createTask("t4", { complexityScore: 8 }), // high
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.distribution.low).toBe(2);
+        expect(result.distribution.medium).toBe(1);
+        expect(result.distribution.high).toBe(1);
+    });
+    test("identifies tasks needing breakdown (score >= 7)", () => {
+        const tasks = [
+            createTask("t1", { complexityScore: 6 }),
+            createTask("t2", { complexityScore: 7 }),
+            createTask("t3", { complexityScore: 9 }),
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.needsBreakdown.length).toBe(2);
+        expect(result.needsBreakdown.map((t) => t.id).sort()).toEqual(["t2", "t3"]);
+    });
+    test("calculates average score correctly", () => {
+        const tasks = [
+            createTask("t1", { complexityScore: 2 }),
+            createTask("t2", { complexityScore: 6 }),
+            createTask("t3", { complexityScore: 10 }),
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.averageScore).toBe(6); // (2+6+10)/3
+    });
+    test("identifies unanalyzed tasks", () => {
+        const tasks = [
+            createTask("analyzed", { complexityScore: 5 }),
+            createTask("not-analyzed", {}),
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.unanalyzed.length).toBe(1);
+        expect(result.unanalyzed[0].id).toBe("not-analyzed");
+    });
+    test("excludes completed tasks", () => {
+        const tasks = [
+            createTask("t1", { status: "completed", complexityScore: 10 }),
+            createTask("t2", { status: "pending", complexityScore: 5 }),
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.distribution.high).toBe(0);
+        expect(result.distribution.medium).toBe(1);
+    });
+});
+describe("getTechStackSummary", () => {
+    test("returns empty summary for no tasks", () => {
+        const result = getTechStackSummary([]);
+        expect(result.areaCounts.schema).toBe(0);
+        expect(result.breakingChanges).toEqual([]);
+        expect(result.unanalyzed).toEqual([]);
+    });
+    test("counts tasks by area correctly", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"] }),
+            createTask("t2", { areas: ["backend", "frontend"] }),
+            createTask("t3", { areas: ["schema"] }),
+        ];
+        const result = getTechStackSummary(tasks);
+        expect(result.areaCounts.backend).toBe(2);
+        expect(result.areaCounts.frontend).toBe(1);
+        expect(result.areaCounts.schema).toBe(1);
+    });
+    test("tracks risk distribution", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], riskLevel: "low" }),
+            createTask("t2", { areas: ["backend"], riskLevel: "medium" }),
+            createTask("t3", { areas: ["backend"], riskLevel: "high" }),
+        ];
+        const result = getTechStackSummary(tasks);
+        expect(result.riskDistribution.low).toBe(1);
+        expect(result.riskDistribution.medium).toBe(1);
+        expect(result.riskDistribution.high).toBe(1);
+    });
+    test("identifies breaking changes", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], hasBreakingChange: true }),
+            createTask("t2", { areas: ["backend"], hasBreakingChange: false }),
+        ];
+        const result = getTechStackSummary(tasks);
+        expect(result.breakingChanges.length).toBe(1);
+        expect(result.breakingChanges[0].id).toBe("t1");
+    });
+    test("identifies unanalyzed tasks", () => {
+        const tasks = [
+            createTask("analyzed", { areas: ["backend"] }),
+            createTask("not-analyzed", {}),
+        ];
+        const result = getTechStackSummary(tasks);
+        expect(result.unanalyzed.length).toBe(1);
+        expect(result.unanalyzed[0].id).toBe("not-analyzed");
+    });
+});
+describe("suggestSubtaskCount", () => {
+    test("returns 0 for very low complexity (1-2)", () => {
+        expect(suggestSubtaskCount(1)).toBe(0);
+        expect(suggestSubtaskCount(2)).toBe(0);
+    });
+    test("returns 2 for low complexity (3-4)", () => {
+        expect(suggestSubtaskCount(3)).toBe(2);
+        expect(suggestSubtaskCount(4)).toBe(2);
+    });
+    test("returns 3-4 for medium complexity (5-6)", () => {
+        expect(suggestSubtaskCount(5)).toBe(4);
+        expect(suggestSubtaskCount(6)).toBe(4);
+    });
+    test("returns 5-6 for high complexity (7-8)", () => {
+        expect(suggestSubtaskCount(7)).toBe(6);
+        expect(suggestSubtaskCount(8)).toBe(6);
+    });
+    test("returns 7-10 for very high complexity (9-10)", () => {
+        expect(suggestSubtaskCount(9)).toBe(9);
+        expect(suggestSubtaskCount(10)).toBe(10);
+    });
+});
+//# sourceMappingURL=tech-analysis.test.js.map