@fleettools/server 0.1.0 → 0.1.1

package/dist/server/api/src/decomposition/dependency-resolver.js

@@ -1,261 +0,0 @@
-/**
- * FleetTools Phase 4: Dependency Resolution
- *
- * Analyzes sortie dependencies to identify parallel groups, calculate
- * critical path, and estimate total duration.
- *
- * @since 4.0.0 - Initial implementation
- * @last-updated 2026-01-08
- */
-/**
- * DecompositionDependencyResolver - Resolves sortie dependencies
- */
-export class DecompositionDependencyResolver {
-    /**
-     * Resolve dependencies in a SortieTree
-     */
-    resolve(sortieTree) {
-        const sortieMap = new Map(sortieTree.sorties.map(s => [s.id, s]));
-        // Topologically sort sorties
-        const sortedSorties = this.topologicalSort(sortieTree.sorties, sortieMap);
-        // Identify parallel groups
-        const parallelGroups = this.identifyParallelGroups(sortedSorties, sortieMap);
-        // Calculate critical path
-        const criticalPath = this.calculateCriticalPath(sortieTree.sorties, sortieMap);
-        // Estimate total duration
-        const estimatedDuration = this.estimateDuration(criticalPath);
-        // Calculate max depth
-        const maxDepth = this.calculateMaxDepth(sortieTree.sorties, sortieMap);
-        // Check for circular dependencies
-        const circularDependencies = this.findCircularDependencies(sortieTree.sorties, sortieMap);
-        return {
-            sorted_sorties: sortedSorties,
-            parallel_groups: parallelGroups,
-            critical_path: criticalPath,
-            estimated_duration_ms: estimatedDuration,
-            max_depth: maxDepth,
-            circular_dependencies: circularDependencies.length > 0 ? circularDependencies : undefined,
-        };
-    }
-    /**
-     * Topologically sort sorties
-     */
-    topologicalSort(sorties, sortieMap) {
-        const visited = new Set();
-        const sorted = [];
-        const visit = (sortieId) => {
-            if (visited.has(sortieId))
-                return;
-            visited.add(sortieId);
-            const sortie = sortieMap.get(sortieId);
-            if (!sortie)
-                return;
-            // Visit dependencies first
-            for (const depId of sortie.dependencies) {
-                visit(depId);
-            }
-            sorted.push(sortie);
-        };
-        for (const sortie of sorties) {
-            visit(sortie.id);
-        }
-        return sorted;
-    }
-    /**
-     * Identify parallel groups
-     */
-    identifyParallelGroups(sortedSorties, sortieMap) {
-        const groups = [];
-        const processed = new Set();
-        for (const sortie of sortedSorties) {
-            if (processed.has(sortie.id))
-                continue;
-            const group = [sortie];
-            processed.add(sortie.id);
-            // Find other sorties that can run in parallel with this one
-            for (const other of sortedSorties) {
-                if (processed.has(other.id))
-                    continue;
-                // Check if other can run in parallel with all sorties in the group
-                let canRunInParallel = true;
-                for (const groupMember of group) {
-                    if (!this.canRunInParallel(groupMember, other, sortieMap)) {
-                        canRunInParallel = false;
-                        break;
-                    }
-                }
-                if (canRunInParallel) {
-                    group.push(other);
-                    processed.add(other.id);
-                }
-            }
-            groups.push(group);
-        }
-        return groups;
-    }
-    /**
-     * Check if two sorties can run in parallel
-     */
-    canRunInParallel(s1, s2, sortieMap) {
-        // Check for direct dependencies
-        if (s1.dependencies.includes(s2.id) || s2.dependencies.includes(s1.id)) {
-            return false;
-        }
-        // Check for file overlap
-        const files1 = new Set(s1.scope.files || []);
-        const files2 = new Set(s2.scope.files || []);
-        for (const file of files1) {
-            if (files2.has(file)) {
-                return false;
-            }
-        }
-        // Check for transitive dependencies
-        if (this.hasTransitiveDependency(s1.id, s2.id, sortieMap) ||
-            this.hasTransitiveDependency(s2.id, s1.id, sortieMap)) {
-            return false;
-        }
-        return true;
-    }
-    /**
-     * Check if there's a transitive dependency
-     */
-    hasTransitiveDependency(fromId, toId, sortieMap, visited = new Set()) {
-        if (visited.has(fromId))
-            return false;
-        visited.add(fromId);
-        const sortie = sortieMap.get(fromId);
-        if (!sortie)
-            return false;
-        for (const depId of sortie.dependencies) {
-            if (depId === toId)
-                return true;
-            if (this.hasTransitiveDependency(depId, toId, sortieMap, visited)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Calculate critical path (longest dependency chain)
-     */
-    calculateCriticalPath(sorties, sortieMap) {
-        let longestPath = [];
-        for (const sortie of sorties) {
-            const path = this.buildPath(sortie.id, sortieMap, new Set());
-            if (path.length > longestPath.length) {
-                longestPath = path;
-            }
-        }
-        return longestPath;
-    }
-    /**
-     * Build dependency path from a sortie
-     */
-    buildPath(sortieId, sortieMap, visited) {
-        if (visited.has(sortieId))
-            return [];
-        visited.add(sortieId);
-        const sortie = sortieMap.get(sortieId);
-        if (!sortie)
-            return [];
-        if (sortie.dependencies.length === 0) {
-            return [sortie];
-        }
-        let longestDependencyPath = [];
-        for (const depId of sortie.dependencies) {
-            const depPath = this.buildPath(depId, sortieMap, new Set(visited));
-            if (depPath.length > longestDependencyPath.length) {
-                longestDependencyPath = depPath;
-            }
-        }
-        return [...longestDependencyPath, sortie];
-    }
-    /**
-     * Estimate total duration based on critical path
-     */
-    estimateDuration(criticalPath) {
-        const totalHours = criticalPath.reduce((sum, s) => sum + s.estimated_effort_hours, 0);
-        return totalHours * 3600000; // Convert hours to milliseconds
-    }
-    /**
-     * Calculate maximum dependency depth
-     */
-    calculateMaxDepth(sorties, sortieMap) {
-        let maxDepth = 0;
-        for (const sortie of sorties) {
-            const depth = this.calculateDepth(sortie.id, sortieMap, new Set());
-            maxDepth = Math.max(maxDepth, depth);
-        }
-        return maxDepth;
-    }
-    /**
-     * Calculate depth of a sortie in the dependency graph
-     */
-    calculateDepth(sortieId, sortieMap, visited) {
-        if (visited.has(sortieId))
-            return 0;
-        visited.add(sortieId);
-        const sortie = sortieMap.get(sortieId);
-        if (!sortie || sortie.dependencies.length === 0) {
-            return 1;
-        }
-        let maxDependencyDepth = 0;
-        for (const depId of sortie.dependencies) {
-            const depth = this.calculateDepth(depId, sortieMap, new Set(visited));
-            maxDependencyDepth = Math.max(maxDependencyDepth, depth);
-        }
-        return maxDependencyDepth + 1;
-    }
-    /**
-     * Find circular dependencies
-     */
-    findCircularDependencies(sorties, sortieMap) {
-        const cycles = [];
-        const visited = new Set();
-        for (const sortie of sorties) {
-            if (visited.has(sortie.id))
-                continue;
-            const cycle = this.findCycle(sortie.id, sortieMap, new Set(), []);
-            if (cycle.length > 0) {
-                cycles.push(cycle);
-                // Mark all sorties in the cycle as visited
-                for (const id of cycle) {
-                    visited.add(id);
-                }
-            }
-        }
-        return cycles;
-    }
-    /**
-     * Find a cycle starting from a sortie
-     */
-    findCycle(sortieId, sortieMap, visited, path) {
-        if (visited.has(sortieId)) {
-            // Check if this sortie is in the current path (indicating a cycle)
-            const cycleStart = path.indexOf(sortieId);
-            if (cycleStart !== -1) {
-                return path.slice(cycleStart).concat(sortieId);
-            }
-            return [];
-        }
-        visited.add(sortieId);
-        const sortie = sortieMap.get(sortieId);
-        if (!sortie) {
-            return [];
-        }
-        for (const depId of sortie.dependencies) {
-            const cycle = this.findCycle(depId, sortieMap, new Set(visited), [...path, sortieId]);
-            if (cycle.length > 0) {
-                return cycle;
-            }
-        }
-        return [];
-    }
-}
-/**
- * Create a new dependency resolver instance
- */
-export function createDependencyResolver() {
-    return new DecompositionDependencyResolver();
-}
-//# sourceMappingURL=dependency-resolver.js.map

package/dist/server/api/src/decomposition/dependency-resolver.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dependency-resolver.js","sourceRoot":"","sources":["../../../../../src/decomposition/dependency-resolver.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAQH;;GAEG;AACH,MAAM,OAAO,+BAA+B;IAC1C;;OAEG;IACI,OAAO,CAAC,UAAsB;QACnC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAElE,6BAA6B;QAC7B,MAAM,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE1E,2BAA2B;QAC3B,MAAM,cAAc,GAAG,IAAI,CAAC,sBAAsB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;QAE7E,0BAA0B;QAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE/E,0BAA0B;QAC1B,MAAM,iBAAiB,GAAG,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,CAAC;QAE9D,sBAAsB;QACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAEvE,kCAAkC;QAClC,MAAM,oBAAoB,GAAG,IAAI,CAAC,wBAAwB,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAE1F,OAAO;YACL,cAAc,EAAE,aAAa;YAC7B,eAAe,EAAE,cAAc;YAC/B,aAAa,EAAE,YAAY;YAC3B,qBAAqB,EAAE,iBAAiB;YACxC,SAAS,EAAE,QAAQ;YACnB,qBAAqB,EAAE,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,SAAS;SAC1F,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,OAAiB,EAAE,SAA8B;QACvE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,MAAM,KAAK,GAAG,CAAC,QAAgB,EAAE,EAAE;YACjC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,OAAO;YAClC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAEtB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM;gBAAE,OAAO;YAEpB,2BAA2B;YAC3B,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBACxC,KAAK,CAAC,KAAK,CAAC,CAAC;YACf,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,aAAuB,EAAE,SAA8B;QACpF,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACnC,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEvC,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;YACjC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAEzB,4DAA4D;YAC5D,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;gBAClC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAEtC,mEAAmE;gBACnE,IAAI,gBAAgB,GAAG,IAAI,CAAC;gBAC5B,KAAK,MAAM,WAAW,IAAI,KAAK,EAAE,CAAC;oBAChC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;wBAC1D,gBAAgB,GAAG,KAAK,CAAC;wBACzB,MAAM;oBACR,CAAC;gBACH,CAAC;gBAED,IAAI,gBAAgB,EAAE,CAAC;oBACrB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAClB,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,EAAU,EAAE,EAAU,EAAE,SAA8B;QAC7E,gCAAgC;QAChC,IAAI,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YACvE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,yBAAyB;QACzB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAE7C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,IAAI,IAAI,CAAC,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC;YACrD,IAAI,CAAC,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC;YAC1D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,uBAAuB,CAC7B,MAAc,EACd,IAAY,EACZ,SAA8B,EAC9B,UAAuB,IAAI,GAAG,EAAE;QAEhC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QACtC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAE1B,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACxC,IAAI,KAAK,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC;YAChC,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC;gBAClE,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,OAAiB,EAAE,SAA8B;QAC7E,IAAI,WAAW,GAAa,EAAE,CAAC;QAE/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC7D,IAAI,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;gBACrC,WAAW,GAAG,IAAI,CAAC;YACrB,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,QAAgB,EAAE,SAA8B,EAAE,OAAoB;QACtF,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO,EAAE,CAAC;QACrC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAEvB,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClB,CAAC;QAED,IAAI,qBAAqB,GAAa,EAAE,CAAC;QAEzC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;YACnE,IAAI,OAAO,CAAC,MAAM,GAAG,qBAAqB,CAAC,MAAM,EAAE,CAAC;gBAClD,qBAAqB,GAAG,OAAO,CAAC;YAClC,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,qBAAqB,EAAE,MAAM,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,YAAsB;QAC7C,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC;QACtF,OAAO,UAAU,GAAG,OAAO,CAAC,CAAC,gCAAgC;IAC/D,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,OAAiB,EAAE,SAA8B;QACzE,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACnE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,QAAgB,EAAE,SAA8B,EAAE,OAAoB;QAC3F,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO,CAAC,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;YACtE,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,KAAK,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,kBAAkB,GAAG,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,OAAiB,EAAE,SAA8B;QAChF,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAAE,SAAS;YAErC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,2CAA2C;gBAC3C,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;oBACvB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,SAAS,CACf,QAAgB,EAChB,SAA8B,EAC9B,OAAoB,EACpB,IAAc;QAEd,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1B,mEAAmE;YACnE,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;gBACtB,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACjD,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEvC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;YACtF,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB;IACtC,OAAO,IAAI,+BAA+B,EAAE,CAAC;AAC/C,CAAC"}

package/dist/server/api/src/decomposition/index.d.ts

@@ -1,17 +0,0 @@
-/**
- * FleetTools Phase 4: Task Decomposition Module
- *
- * Exports all decomposition-related types and classes.
- *
- * @since 4.0.0 - Initial implementation
- * @last-updated 2026-01-08
- */
-export * from './types.js';
-export { StrategySelector, createStrategySelector } from './strategies.js';
-export { CodebaseAnalyzer, createCodebaseAnalyzer } from './codebase-analyzer.js';
-export { LLMPlanner, createLLMPlanner } from './planner.js';
-export { SortieTreeValidator, createValidator } from './validator.js';
-export { DecompositionDependencyResolver, createDependencyResolver } from './dependency-resolver.js';
-export { ParallelizationAnalyzer, createParallelizationAnalyzer } from './parallelization.js';
-export { decomposeTaskCLI } from './cli.js';
-//# sourceMappingURL=index.d.ts.map

package/dist/server/api/src/decomposition/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/decomposition/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,cAAc,YAAY,CAAC;AAG3B,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAC;AAClF,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EAAE,+BAA+B,EAAE,wBAAwB,EAAE,MAAM,0BAA0B,CAAC;AACrG,OAAO,EAAE,uBAAuB,EAAE,6BAA6B,EAAE,MAAM,sBAAsB,CAAC;AAC9F,OAAO,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC"}

package/dist/server/api/src/decomposition/index.js

@@ -1,19 +0,0 @@
-/**
- * FleetTools Phase 4: Task Decomposition Module
- *
- * Exports all decomposition-related types and classes.
- *
- * @since 4.0.0 - Initial implementation
- * @last-updated 2026-01-08
- */
-// Types
-export * from './types.js';
-// Classes and functions
-export { StrategySelector, createStrategySelector } from './strategies.js';
-export { CodebaseAnalyzer, createCodebaseAnalyzer } from './codebase-analyzer.js';
-export { LLMPlanner, createLLMPlanner } from './planner.js';
-export { SortieTreeValidator, createValidator } from './validator.js';
-export { DecompositionDependencyResolver, createDependencyResolver } from './dependency-resolver.js';
-export { ParallelizationAnalyzer, createParallelizationAnalyzer } from './parallelization.js';
-export { decomposeTaskCLI } from './cli.js';
-//# sourceMappingURL=index.js.map

package/dist/server/api/src/decomposition/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/decomposition/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,QAAQ;AACR,cAAc,YAAY,CAAC;AAE3B,wBAAwB;AACxB,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAC3E,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAC;AAClF,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EAAE,+BAA+B,EAAE,wBAAwB,EAAE,MAAM,0BAA0B,CAAC;AACrG,OAAO,EAAE,uBAAuB,EAAE,6BAA6B,EAAE,MAAM,sBAAsB,CAAC;AAC9F,OAAO,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC"}

package/dist/server/api/src/decomposition/parallelization.d.ts

@@ -1,40 +0,0 @@
-/**
- * FleetTools Phase 4: Parallelization Analysis
- *
- * Analyzes parallelization opportunities and provides recommendations
- * for optimizing task execution.
- *
- * @since 4.0.0 - Initial implementation
- * @last-updated 2026-01-08
- */
-import { SortieTree, ParallelizationAnalysisResult } from './types.js';
-/**
- * ParallelizationAnalyzer - Analyzes parallelization opportunities
- */
-export declare class ParallelizationAnalyzer {
-    /**
-     * Analyze parallelization opportunities
-     */
-    analyze(sortieTree: SortieTree): ParallelizationAnalysisResult;
-    /**
-     * Calculate parallelization potential (0-1)
-     */
-    private calculateParallelizationPotential;
-    /**
-     * Calculate estimated speedup from parallelization
-     */
-    private calculateSpeedup;
-    /**
-     * Generate recommendations for optimization
-     */
-    private generateRecommendations;
-    /**
-     * Identify bottlenecks in execution
-     */
-    private identifyBottlenecks;
-}
-/**
- * Create a new parallelization analyzer instance
- */
-export declare function createParallelizationAnalyzer(): ParallelizationAnalyzer;
-//# sourceMappingURL=parallelization.d.ts.map

package/dist/server/api/src/decomposition/parallelization.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"parallelization.d.ts","sourceRoot":"","sources":["../../../../../src/decomposition/parallelization.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAEL,UAAU,EACV,6BAA6B,EAC9B,MAAM,YAAY,CAAC;AAEpB;;GAEG;AACH,qBAAa,uBAAuB;IAClC;;OAEG;IACI,OAAO,CAAC,UAAU,EAAE,UAAU,GAAG,6BAA6B;IA0CrE;;OAEG;IACH,OAAO,CAAC,iCAAiC;IAWzC;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAkBxB;;OAEG;IACH,OAAO,CAAC,uBAAuB;IAqE/B;;OAEG;IACH,OAAO,CAAC,mBAAmB;CAiD5B;AAED;;GAEG;AACH,wBAAgB,6BAA6B,IAAI,uBAAuB,CAEvE"}

package/dist/server/api/src/decomposition/parallelization.js

@@ -1,144 +0,0 @@
-/**
- * FleetTools Phase 4: Parallelization Analysis
- *
- * Analyzes parallelization opportunities and provides recommendations
- * for optimizing task execution.
- *
- * @since 4.0.0 - Initial implementation
- * @last-updated 2026-01-08
- */
-/**
- * ParallelizationAnalyzer - Analyzes parallelization opportunities
- */
-export class ParallelizationAnalyzer {
-    /**
-     * Analyze parallelization opportunities
-     */
-    analyze(sortieTree) {
-        const parallelGroups = sortieTree.parallelization.parallel_groups;
-        const criticalPath = sortieTree.parallelization.critical_path;
-        const estimatedDuration = sortieTree.parallelization.estimated_duration_ms;
-        // Calculate parallelization potential
-        const parallelizationPotential = this.calculateParallelizationPotential(sortieTree.sorties, parallelGroups);
-        // Calculate estimated speedup
-        const estimatedSpeedup = this.calculateSpeedup(sortieTree.sorties, criticalPath, estimatedDuration);
-        // Generate recommendations
-        const recommendations = this.generateRecommendations(sortieTree, parallelGroups, criticalPath, parallelizationPotential);
-        // Identify bottlenecks
-        const bottlenecks = this.identifyBottlenecks(sortieTree, parallelGroups, criticalPath);
-        return {
-            parallel_groups: parallelGroups,
-            parallelization_potential: parallelizationPotential,
-            estimated_speedup: estimatedSpeedup,
-            recommendations,
-            bottlenecks,
-        };
-    }
-    /**
-     * Calculate parallelization potential (0-1)
-     */
-    calculateParallelizationPotential(sorties, parallelGroups) {
-        if (sorties.length <= 1)
-            return 0;
-        // Potential is based on how many sorties can run in parallel
-        const maxParallelSize = Math.max(...parallelGroups.map(g => g.length));
-        return maxParallelSize / sorties.length;
-    }
-    /**
-     * Calculate estimated speedup from parallelization
-     */
-    calculateSpeedup(sorties, criticalPath, estimatedDuration) {
-        if (sorties.length <= 1)
-            return 1;
-        // Total effort if executed sequentially
-        const totalEffort = sorties.reduce((sum, s) => sum + s.estimated_effort_hours, 0);
-        // Critical path effort
-        const criticalPathEffort = criticalPath.reduce((sum, s) => sum + s.estimated_effort_hours, 0);
-        // Speedup is the ratio of sequential to parallel execution
-        if (criticalPathEffort === 0)
-            return 1;
-        return totalEffort / criticalPathEffort;
-    }
-    /**
-     * Generate recommendations for optimization
-     */
-    generateRecommendations(sortieTree, parallelGroups, criticalPath, parallelizationPotential) {
-        const recommendations = [];
-        // Check if parallelization potential is low
-        if (parallelizationPotential < 0.3) {
-            recommendations.push('Low parallelization potential: Consider breaking down sorties with high complexity into smaller, independent tasks');
-        }
-        // Check for long critical path
-        if (criticalPath.length > 5) {
-            recommendations.push(`Long critical path (${criticalPath.length} sorties): Consider reordering dependencies to reduce sequential execution`);
-        }
-        // Check for unbalanced effort
-        const efforts = sortieTree.sorties.map(s => s.estimated_effort_hours);
-        const avgEffort = efforts.reduce((a, b) => a + b, 0) / efforts.length;
-        const maxEffort = Math.max(...efforts);
-        if (maxEffort > avgEffort * 2) {
-            const heavySorties = sortieTree.sorties
-                .filter(s => s.estimated_effort_hours > avgEffort * 1.5)
-                .map(s => s.title);
-            recommendations.push(`Unbalanced effort distribution: Consider breaking down heavy sorties (${heavySorties.join(', ')}) into smaller tasks`);
-        }
-        // Check for high complexity sorties
-        const highComplexitySorties = sortieTree.sorties.filter(s => s.complexity === 'high');
-        if (highComplexitySorties.length > 0) {
-            recommendations.push(`High complexity sorties detected: Consider adding intermediate milestones or breaking them into smaller tasks`);
-        }
-        // Check for sorties with many dependencies
-        const heavilyDependentSorties = sortieTree.sorties.filter(s => s.dependencies.length > 2);
-        if (heavilyDependentSorties.length > 0) {
-            recommendations.push(`Some sorties have many dependencies: Consider reordering to reduce dependency depth`);
-        }
-        // Positive recommendations
-        if (parallelizationPotential > 0.7) {
-            recommendations.push('Good parallelization potential: Most sorties can run in parallel for efficient execution');
-        }
-        if (criticalPath.length <= 3) {
-            recommendations.push('Short critical path: Task can be completed quickly with parallel execution');
-        }
-        return recommendations;
-    }
-    /**
-     * Identify bottlenecks in execution
-     */
-    identifyBottlenecks(sortieTree, parallelGroups, criticalPath) {
-        const bottlenecks = [];
-        // Sorties on the critical path are bottlenecks
-        const criticalPathIds = new Set(criticalPath.map(s => s.id));
-        for (const sortie of criticalPath) {
-            if (sortie.complexity === 'high') {
-                bottlenecks.push(`High complexity sortie on critical path: "${sortie.title}" (${sortie.estimated_effort_hours}h)`);
-            }
-            if (sortie.estimated_effort_hours > 4) {
-                bottlenecks.push(`Long-running sortie on critical path: "${sortie.title}" (${sortie.estimated_effort_hours}h)`);
-            }
-        }
-        // Sorties with many dependents are bottlenecks
-        for (const sortie of sortieTree.sorties) {
-            const dependentCount = sortieTree.sorties.filter(s => s.dependencies.includes(sortie.id)).length;
-            if (dependentCount > 2) {
-                bottlenecks.push(`Sortie with many dependents: "${sortie.title}" (${dependentCount} sorties depend on it)`);
-            }
-        }
-        // Identify sequential chains
-        for (const group of parallelGroups) {
-            if (group.length === 1) {
-                const sortie = group[0];
-                if (sortie.dependencies.length > 0 && sortieTree.sorties.filter(s => s.dependencies.includes(sortie.id)).length > 0) {
-                    bottlenecks.push(`Sequential chain: "${sortie.title}" is part of a sequential dependency chain`);
-                }
-            }
-        }
-        return bottlenecks;
-    }
-}
-/**
- * Create a new parallelization analyzer instance
- */
-export function createParallelizationAnalyzer() {
-    return new ParallelizationAnalyzer();
-}
-//# sourceMappingURL=parallelization.js.map

package/dist/server/api/src/decomposition/parallelization.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parallelization.js","sourceRoot":"","sources":["../../../../../src/decomposition/parallelization.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAQH;;GAEG;AACH,MAAM,OAAO,uBAAuB;IAClC;;OAEG;IACI,OAAO,CAAC,UAAsB;QACnC,MAAM,cAAc,GAAG,UAAU,CAAC,eAAe,CAAC,eAAe,CAAC;QAClE,MAAM,YAAY,GAAG,UAAU,CAAC,eAAe,CAAC,aAAa,CAAC;QAC9D,MAAM,iBAAiB,GAAG,UAAU,CAAC,eAAe,CAAC,qBAAqB,CAAC;QAE3E,sCAAsC;QACtC,MAAM,wBAAwB,GAAG,IAAI,CAAC,iCAAiC,CACrE,UAAU,CAAC,OAAO,EAClB,cAAc,CACf,CAAC;QAEF,8BAA8B;QAC9B,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAC5C,UAAU,CAAC,OAAO,EAClB,YAAY,EACZ,iBAAiB,CAClB,CAAC;QAEF,2BAA2B;QAC3B,MAAM,eAAe,GAAG,IAAI,CAAC,uBAAuB,CAClD,UAAU,EACV,cAAc,EACd,YAAY,EACZ,wBAAwB,CACzB,CAAC;QAEF,uBAAuB;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAC1C,UAAU,EACV,cAAc,EACd,YAAY,CACb,CAAC;QAEF,OAAO;YACL,eAAe,EAAE,cAAc;YAC/B,yBAAyB,EAAE,wBAAwB;YACnD,iBAAiB,EAAE,gBAAgB;YACnC,eAAe;YACf,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iCAAiC,CACvC,OAAiB,EACjB,cAA0B;QAE1B,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAElC,6DAA6D;QAC7D,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACvE,OAAO,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,OAAiB,EACjB,YAAsB,EACtB,iBAAyB;QAEzB,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAElC,wCAAwC;QACxC,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC;QAElF,uBAAuB;QACvB,MAAM,kBAAkB,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC;QAE9F,2DAA2D;QAC3D,IAAI,kBAAkB,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACvC,OAAO,WAAW,GAAG,kBAAkB,CAAC;IAC1C,CAAC;IAED;;OAEG;IACK,uBAAuB,CAC7B,UAAsB,EACtB,cAA0B,EAC1B,YAAsB,EACtB,wBAAgC;QAEhC,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,4CAA4C;QAC5C,IAAI,wBAAwB,GAAG,GAAG,EAAE,CAAC;YACnC,eAAe,CAAC,IAAI,CAClB,oHAAoH,CACrH,CAAC;QACJ,CAAC;QAED,+BAA+B;QAC/B,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,eAAe,CAAC,IAAI,CAClB,uBAAuB,YAAY,CAAC,MAAM,4EAA4E,CACvH,CAAC;QACJ,CAAC;QAED,8BAA8B;QAC9B,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC;QACtE,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACtE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAEvC,IAAI,SAAS,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;YAC9B,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO;iBACpC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,sBAAsB,GAAG,SAAS,GAAG,GAAG,CAAC;iBACvD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAErB,eAAe,CAAC,IAAI,CAClB,yEAAyE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,sBAAsB,CACvH,CAAC;QACJ,CAAC;QAED,oCAAoC;QACpC,MAAM,qBAAqB,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CAAC;QACtF,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,eAAe,CAAC,IAAI,CAClB,+GAA+G,CAChH,CAAC;QACJ,CAAC;QAED,2CAA2C;QAC3C,MAAM,uBAAuB,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1F,IAAI,uBAAuB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvC,eAAe,CAAC,IAAI,CAClB,qFAAqF,CACtF,CAAC;QACJ,CAAC;QAED,2BAA2B;QAC3B,IAAI,wBAAwB,GAAG,GAAG,EAAE,CAAC;YACnC,eAAe,CAAC,IAAI,CAClB,0FAA0F,CAC3F,CAAC;QACJ,CAAC;QAED,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC7B,eAAe,CAAC,IAAI,CAClB,4EAA4E,CAC7E,CAAC;QACJ,CAAC;QAED,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,UAAsB,EACtB,cAA0B,EAC1B,YAAsB;QAEtB,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,+CAA+C;QAC/C,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE7D,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,IAAI,MAAM,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;gBACjC,WAAW,CAAC,IAAI,CACd,6CAA6C,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC,sBAAsB,IAAI,CACjG,CAAC;YACJ,CAAC;YAED,IAAI,MAAM,CAAC,sBAAsB,GAAG,CAAC,EAAE,CAAC;gBACtC,WAAW,CAAC,IAAI,CACd,0CAA0C,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC,sBAAsB,IAAI,CAC9F,CAAC;YACJ,CAAC;QACH,CAAC;QAED,+CAA+C;QAC/C,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;YACxC,MAAM,cAAc,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;YAEjG,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;gBACvB,WAAW,CAAC,IAAI,CACd,iCAAiC,MAAM,CAAC,KAAK,MAAM,cAAc,wBAAwB,CAC1F,CAAC;YACJ,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpH,WAAW,CAAC,IAAI,CACd,sBAAsB,MAAM,CAAC,KAAK,4CAA4C,CAC/E,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,6BAA6B;IAC3C,OAAO,IAAI,uBAAuB,EAAE,CAAC;AACvC,CAAC"}

package/dist/server/api/src/decomposition/planner.d.ts

@@ -1,84 +0,0 @@
-/**
- * FleetTools Phase 4: LLM Planner
- *
- * Uses Claude API to generate SortieTree from task description and codebase context.
- * Handles prompt generation, API calls, response parsing, and validation.
- *
- * @since 4.0.0 - Initial implementation
- * @last-updated 2026-01-08
- */
-import { LLMPlannerInput, SortieTree } from './types.js';
-/**
- * LLMPlanner - Generates SortieTree using Claude API
- */
-export declare class LLMPlanner {
-    private readonly apiKey;
-    private readonly apiBaseUrl;
-    private readonly model;
-    constructor(apiKey?: string);
-    /**
-     * Generate SortieTree from task description
-     */
-    plan(input: LLMPlannerInput): Promise<SortieTree>;
-    /**
-     * Generate prompt for Claude
-     */
-    private generatePrompt;
-    /**
-     * Call Claude API
-     */
-    private callClaudeAPI;
-    /**
-     * Parse Claude response
-     */
-    private parseResponse;
-    /**
-     * Validate parsed output
-     */
-    private validateParsedOutput;
-    /**
-     * Convert parsed output to SortieTree
-     */
-    private convertToSortieTree;
-    /**
-     * Generate parallelization info
-     */
-    private generateParallelizationInfo;
-    /**
-     * Identify parallel groups
-     */
-    private identifyParallelGroups;
-    /**
-     * Check if two sorties can run in parallel
-     */
-    private canRunInParallel;
-    /**
-     * Calculate critical path
-     */
-    private calculateCriticalPath;
-    /**
-     * Build dependency path
-     */
-    private buildPath;
-    /**
-     * Estimate total duration
-     */
-    private estimateDuration;
-    /**
-     * Calculate parallelization potential
-     */
-    private calculateParallelizationPotential;
-    /**
-     * Calculate estimated speedup
-     */
-    private calculateSpeedup;
-    /**
-     * Generate unique ID
-     */
-    private generateId;
-}
-/**
- * Create a new LLM planner instance
- */
-export declare function createLLMPlanner(apiKey?: string): LLMPlanner;
-//# sourceMappingURL=planner.d.ts.map

package/dist/server/api/src/decomposition/planner.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"planner.d.ts","sourceRoot":"","sources":["../../../../../src/decomposition/planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAEL,eAAe,EAIf,UAAU,EAGX,MAAM,YAAY,CAAC;AAEpB;;GAEG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA0C;IACrE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwC;gBAElD,MAAM,CAAC,EAAE,MAAM;IAO3B;;OAEG;IACU,IAAI,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,UAAU,CAAC;IAgB9D;;OAEG;IACH,OAAO,CAAC,cAAc;IA8DtB;;OAEG;YACW,aAAa;IAmC3B;;OAEG;IACH,OAAO,CAAC,aAAa;IA0BrB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IA2D5B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAgE3B;;OAEG;IACH,OAAO,CAAC,2BAA2B;IA+BnC;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAyB9B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAgBxB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAkB7B;;OAEG;IACH,OAAO,CAAC,SAAS;IAiBjB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAMxB;;OAEG;IACH,OAAO,CAAC,iCAAiC;IAQzC;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAQxB;;OAEG;IACH,OAAO,CAAC,UAAU;CAQnB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,UAAU,CAE5D"}