@jterrats/smart-deployment 1.0.3

package/lib/dependencies/circular-dependency-detector.js

@@ -0,0 +1,329 @@
+/**
+ * Circular Dependency Detector
+ * Detects and reports circular dependencies in the dependency graph
+ *
+ * @ac US-030-AC-1: Detect simple cycles (A→B→A)
+ * @ac US-030-AC-2: Detect complex cycles (A→B→C→A)
+ * @ac US-030-AC-3: Report all nodes in cycle
+ * @ac US-030-AC-4: Suggest where to break cycle
+ * @ac US-030-AC-5: Support user-defined cycle breaks
+ * @ac US-030-AC-6: Handle multiple separate cycles
+ *
+ * @issue #30
+ */
+import { getLogger } from '../utils/logger.js';
+const logger = getLogger('CircularDependencyDetector');
+/**
+ * Circular Dependency Detector
+ *
+ * Uses depth-first search (DFS) to detect cycles in the dependency graph.
+ * Supports both simple (A→B→A) and complex (A→B→C→A) cycles.
+ *
+ * Performance: O(V + E) where V = vertices, E = edges
+ *
+ * @example
+ * const detector = new CircularDependencyDetector(graph);
+ * const cycles = detector.detectCycles();
+ * if (cycles.length > 0) {
+ *   console.log(`Found ${cycles.length} circular dependencies`);
+ *   console.log('Suggestion:', cycles[0].breakSuggestions[0]);
+ * }
+ */
+export class CircularDependencyDetector {
+    graph;
+    options;
+    ignoredEdges;
+    constructor(graph, options = {}) {
+        this.graph = graph;
+        this.options = {
+            maxDepth: options.maxDepth ?? 100,
+            ignoreEdges: options.ignoreEdges ?? [],
+            generateSuggestions: options.generateSuggestions ?? true,
+        };
+        // Create set of ignored edges for O(1) lookup
+        this.ignoredEdges = new Set(this.options.ignoreEdges.map(({ from, to }) => `${from}->${to}`));
+        logger.debug('Initialized CircularDependencyDetector', {
+            nodes: this.graph.size,
+            ignoredEdges: this.ignoredEdges.size,
+        });
+    }
+    // Private static helper methods
+    /**
+     * Calculate priority for breaking an edge
+     * Higher = better candidate to break
+     */
+    static calculateBreakPriority(from, to) {
+        let priority = 50; // Base priority
+        // Test classes are good candidates to break (they can be deployed separately)
+        if (from.includes('Test') || to.includes('Test')) {
+            priority += 30;
+        }
+        // Utility/helper classes are good candidates
+        if (CircularDependencyDetector.isUtilityClass(from) || CircularDependencyDetector.isUtilityClass(to)) {
+            priority += 20;
+        }
+        // Handler -> Service edges are typically safe to break
+        if (from.includes('Handler') && to.includes('Service')) {
+            priority += 15;
+        }
+        // Controller -> Service edges can be broken
+        if (from.includes('Controller') && to.includes('Service')) {
+            priority += 15;
+        }
+        // Trigger -> Handler edges should not be broken (tightly coupled)
+        if (from.includes('Trigger') && to.includes('Handler')) {
+            priority -= 20;
+        }
+        // Core domain classes should not be broken if possible
+        if (CircularDependencyDetector.isCoreDomainClass(from) && CircularDependencyDetector.isCoreDomainClass(to)) {
+            priority -= 15;
+        }
+        return Math.max(0, Math.min(100, priority));
+    }
+    /**
+     * Get human-readable reason for break suggestion
+     */
+    static getBreakReason(from, to, priority) {
+        if (priority >= 80) {
+            return `High priority: ${from} → ${to} is a test or utility dependency`;
+        }
+        else if (priority >= 65) {
+            return `Medium priority: ${from} → ${to} can be broken safely`;
+        }
+        else if (priority >= 50) {
+            return `Low priority: ${from} → ${to} may be tightly coupled`;
+        }
+        else {
+            return `Not recommended: ${from} → ${to} appears to be core business logic`;
+        }
+    }
+    /**
+     * Check if a class is a utility/helper class
+     */
+    static isUtilityClass(nodeId) {
+        const name = nodeId.toLowerCase();
+        return name.includes('util') || name.includes('helper') || name.includes('constant') || name.includes('logger');
+    }
+    /**
+     * Check if a class is core domain logic
+     */
+    static isCoreDomainClass(nodeId) {
+        const name = nodeId.toLowerCase();
+        // Core classes typically don't have suffixes like Test, Handler, etc.
+        return (!name.includes('test') &&
+            !name.includes('handler') &&
+            !name.includes('controller') &&
+            !name.includes('util') &&
+            !name.includes('helper'));
+    }
+    /**
+     * Generate a unique ID for a cycle (order-independent)
+     */
+    static generateCycleId(cycle) {
+        // Sort to make it order-independent: [A,B,C] and [B,C,A] are the same cycle
+        const sorted = [...cycle].sort();
+        return sorted.join('->');
+    }
+    /**
+     * Check if a cycle is a duplicate of already found cycles
+     */
+    static isDuplicateCycle(cycle, existingCycles) {
+        const cycleId = CircularDependencyDetector.generateCycleId(cycle);
+        return existingCycles.some((c) => c.id === cycleId);
+    }
+    // Public methods
+    /**
+     * Detect all circular dependencies in the graph
+     *
+     * @ac US-030-AC-1: Detect simple cycles (A→B→A)
+     * @ac US-030-AC-2: Detect complex cycles (A→B→C→A)
+     * @ac US-030-AC-6: Handle multiple separate cycles
+     */
+    detectCycles() {
+        const startTime = Date.now();
+        const allCycles = [];
+        const visited = new Set();
+        const recursionStack = new Set();
+        const currentPath = [];
+        const dfs = (nodeId, depth) => {
+            // Depth limit check
+            if (depth > this.options.maxDepth) {
+                logger.warn('Max depth reached during cycle detection', { nodeId, depth });
+                return;
+            }
+            visited.add(nodeId);
+            recursionStack.add(nodeId);
+            currentPath.push(nodeId);
+            const dependencies = this.graph.get(nodeId) ?? new Set();
+            for (const depId of dependencies) {
+                // Skip ignored edges
+                if (this.isEdgeIgnored(nodeId, depId)) {
+                    continue;
+                }
+                if (!visited.has(depId)) {
+                    // Continue DFS
+                    dfs(depId, depth + 1);
+                }
+                else if (recursionStack.has(depId)) {
+                    // Found a cycle!
+                    const cycleStartIndex = currentPath.indexOf(depId);
+                    const cycle = currentPath.slice(cycleStartIndex);
+                    // Check if we've already found this cycle
+                    if (!CircularDependencyDetector.isDuplicateCycle(cycle, allCycles)) {
+                        allCycles.push(this.createDetectedCycle(cycle, depId));
+                    }
+                }
+            }
+            recursionStack.delete(nodeId);
+            currentPath.pop();
+        };
+        // Run DFS from each node
+        for (const nodeId of this.graph.keys()) {
+            if (!visited.has(nodeId)) {
+                dfs(nodeId, 0);
+            }
+        }
+        const duration = Date.now() - startTime;
+        logger.info('Cycle detection completed', {
+            cyclesFound: allCycles.length,
+            nodesScanned: visited.size,
+            durationMs: duration,
+        });
+        return allCycles;
+    }
+    /**
+     * Detect cycles starting from a specific node
+     */
+    detectCyclesFromNode(startNode) {
+        const cycles = [];
+        const recursionStack = new Set();
+        const currentPath = [];
+        const dfs = (nodeId, depth) => {
+            if (depth > this.options.maxDepth) {
+                return;
+            }
+            recursionStack.add(nodeId);
+            currentPath.push(nodeId);
+            const dependencies = this.graph.get(nodeId) ?? new Set();
+            for (const depId of dependencies) {
+                if (this.isEdgeIgnored(nodeId, depId)) {
+                    continue;
+                }
+                if (recursionStack.has(depId)) {
+                    const cycleStartIndex = currentPath.indexOf(depId);
+                    const cycle = currentPath.slice(cycleStartIndex);
+                    if (!CircularDependencyDetector.isDuplicateCycle(cycle, cycles)) {
+                        cycles.push(this.createDetectedCycle(cycle, depId));
+                    }
+                }
+                else {
+                    dfs(depId, depth + 1);
+                }
+            }
+            recursionStack.delete(nodeId);
+            currentPath.pop();
+        };
+        dfs(startNode, 0);
+        return cycles;
+    }
+    /**
+     * Check if a specific path creates a cycle
+     */
+    wouldCreateCycle(from, to) {
+        // Check if adding edge from->to would create a cycle
+        // This means: can we reach 'from' starting from 'to'?
+        const visited = new Set();
+        const queue = [to];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current === from) {
+                return true; // Found a path back to 'from'
+            }
+            if (visited.has(current)) {
+                continue;
+            }
+            visited.add(current);
+            const deps = this.graph.get(current) ?? new Set();
+            for (const dep of deps) {
+                if (!this.isEdgeIgnored(current, dep) && !visited.has(dep)) {
+                    queue.push(dep);
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * @ac US-030-AC-3: Report all nodes in cycle
+     *
+     * Create a detected cycle with full information
+     */
+    createDetectedCycle(cycle, closingNode) {
+        const cycleId = CircularDependencyDetector.generateCycleId(cycle);
+        const message = `Circular dependency: ${cycle.join(' → ')} → ${closingNode}`;
+        const detected = {
+            id: cycleId,
+            cycle: [...cycle],
+            severity: cycle.length <= 2 ? 'error' : 'warning',
+            message,
+            breakSuggestions: [],
+        };
+        // Generate break suggestions if enabled
+        if (this.options.generateSuggestions) {
+            detected.breakSuggestions = CircularDependencyDetector.generateBreakSuggestions(cycle, closingNode);
+        }
+        return detected;
+    }
+    /**
+     * @ac US-030-AC-4: Suggest where to break cycle
+     *
+     * Generate suggestions for breaking the cycle
+     * Priority based on:
+     * - Test classes (high priority to break)
+     * - Utility classes (medium priority)
+     * - Core business logic (low priority)
+     */
+    static generateBreakSuggestions(cycle, closingNode) {
+        const suggestions = [];
+        // Add closing edge
+        const fullCycle = [...cycle, closingNode];
+        // Analyze each edge in the cycle
+        for (let i = 0; i < fullCycle.length - 1; i++) {
+            const from = fullCycle[i];
+            const to = fullCycle[i + 1];
+            const priority = CircularDependencyDetector.calculateBreakPriority(from, to);
+            const reason = CircularDependencyDetector.getBreakReason(from, to, priority);
+            suggestions.push({
+                from,
+                to,
+                reason,
+                priority,
+            });
+        }
+        // Sort by priority (highest first)
+        suggestions.sort((a, b) => b.priority - a.priority);
+        return suggestions;
+    }
+    /**
+     * @ac US-030-AC-5: Support user-defined cycle breaks
+     *
+     * Check if an edge is in the ignore list
+     */
+    isEdgeIgnored(from, to) {
+        return this.ignoredEdges.has(`${from}->${to}`);
+    }
+    /**
+     * Get summary statistics
+     */
+    getStats() {
+        let totalEdges = 0;
+        for (const deps of this.graph.values()) {
+            totalEdges += deps.size;
+        }
+        return {
+            totalNodes: this.graph.size,
+            totalEdges,
+            ignoredEdges: this.ignoredEdges.size,
+        };
+    }
+}
+//# sourceMappingURL=circular-dependency-detector.js.map

package/lib/dependencies/circular-dependency-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"circular-dependency-detector.js","sourceRoot":"","sources":["../../src/dependencies/circular-dependency-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAG/C,MAAM,MAAM,GAAG,SAAS,CAAC,4BAA4B,CAAC,CAAC;AAgCvD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,0BAA0B;IAC7B,KAAK,CAAkB;IACvB,OAAO,CAAkC;IACzC,YAAY,CAAc;IAElC,YAAmB,KAAsB,EAAE,UAAiC,EAAE;QAC5E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG;YACb,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,GAAG;YACjC,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,EAAE;YACtC,mBAAmB,EAAE,OAAO,CAAC,mBAAmB,IAAI,IAAI;SACzD,CAAC;QAEF,8CAA8C;QAC9C,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;QAE9F,MAAM,CAAC,KAAK,CAAC,wCAAwC,EAAE;YACrD,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACtB,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI;SACrC,CAAC,CAAC;IACL,CAAC;IAED,gCAAgC;IAChC;;;OAGG;IACK,MAAM,CAAC,sBAAsB,CAAC,IAAY,EAAE,EAAU;QAC5D,IAAI,QAAQ,GAAG,EAAE,CAAC,CAAC,gBAAgB;QAEnC,8EAA8E;QAC9E,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACjD,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;QAED,6CAA6C;QAC7C,IAAI,0BAA0B,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;YACrG,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;QAED,uDAAuD;QACvD,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YACvD,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;QAED,4CAA4C;QAC5C,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YAC1D,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;QAED,kEAAkE;QAClE,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YACvD,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;QAED,uDAAuD;QACvD,IAAI,0BAA0B,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3G,QAAQ,IAAI,EAAE,CAAC;QACjB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,cAAc,CAAC,IAAY,EAAE,EAAU,EAAE,QAAgB;QACtE,IAAI,QAAQ,IAAI,EAAE,EAAE,CAAC;YACnB,OAAO,kBAAkB,IAAI,MAAM,EAAE,kCAAkC,CAAC;QAC1E,CAAC;aAAM,IAAI,QAAQ,IAAI,EAAE,EAAE,CAAC;YAC1B,OAAO,oBAAoB,IAAI,MAAM,EAAE,uBAAuB,CAAC;QACjE,CAAC;aAAM,IAAI,QAAQ,IAAI,EAAE,EAAE,CAAC;YAC1B,OAAO,iBAAiB,IAAI,MAAM,EAAE,yBAAyB,CAAC;QAChE,CAAC;aAAM,CAAC;YACN,OAAO,oBAAoB,IAAI,MAAM,EAAE,oCAAoC,CAAC;QAC9E,CAAC;IACH,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,cAAc,CAAC,MAAc;QAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAClH,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,iBAAiB,CAAC,MAAc;QAC7C,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QAClC,sEAAsE;QACtE,OAAO,CACL,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;YACtB,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;YACzB,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC;YAC5B,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;YACtB,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CACzB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,eAAe,CAAC,KAAe;QAC5C,4EAA4E;QAC5E,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACjC,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,gBAAgB,CAAC,KAAe,EAAE,cAA+B;QAC9E,MAAM,OAAO,GAAG,0BAA0B,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAClE,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IACtD,CAAC;IAED,iBAAiB;IACjB;;;;;;OAMG;IACI,YAAY;QACjB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAoB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,KAAa,EAAQ,EAAE;YAClD,oBAAoB;YACpB,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAClC,MAAM,CAAC,IAAI,CAAC,0CAA0C,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC3E,OAAO;YACT,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEzB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAEzD,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;gBACjC,qBAAqB;gBACrB,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;oBACtC,SAAS;gBACX,CAAC;gBAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,eAAe;oBACf,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACxB,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrC,iBAAiB;oBACjB,MAAM,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBACnD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;oBAEjD,0CAA0C;oBAC1C,IAAI,CAAC,0BAA0B,CAAC,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;wBACnE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBACzD,CAAC;gBACH,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,WAAW,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC,CAAC;QAEF,yBAAyB;QACzB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,2BAA2B,EAAE;YACvC,WAAW,EAAE,SAAS,CAAC,MAAM;YAC7B,YAAY,EAAE,OAAO,CAAC,IAAI;YAC1B,UAAU,EAAE,QAAQ;SACrB,CAAC,CAAC;QAEH,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACI,oBAAoB,CAAC,SAAiB;QAC3C,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,KAAa,EAAQ,EAAE;YAClD,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAClC,OAAO;YACT,CAAC;YAED,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEzB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAEzD,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;oBACtC,SAAS;gBACX,CAAC;gBAED,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC9B,MAAM,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBACnD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;oBAEjD,IAAI,CAAC,0BAA0B,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;wBAChE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBACtD,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,WAAW,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC,CAAC;QAEF,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACI,gBAAgB,CAAC,IAAY,EAAE,EAAU;QAC9C,qDAAqD;QACrD,sDAAsD;QAEtD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,EAAE,CAAC,CAAC;QAE7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAC,CAAC,8BAA8B;YAC7C,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAClD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC3D,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACK,mBAAmB,CAAC,KAAe,EAAE,WAAmB;QAC9D,MAAM,OAAO,GAAG,0BAA0B,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAClE,MAAM,OAAO,GAAG,wBAAwB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,WAAW,EAAE,CAAC;QAE7E,MAAM,QAAQ,GAAkB;YAC9B,EAAE,EAAE,OAAO;YACX,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC;YACjB,QAAQ,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;YACjD,OAAO;YACP,gBAAgB,EAAE,EAAE;SACrB,CAAC;QAEF,wCAAwC;QACxC,IAAI,IAAI,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC;YACrC,QAAQ,CAAC,gBAAgB,GAAG,0BAA0B,CAAC,wBAAwB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACtG,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;;OAQG;IACK,MAAM,CAAC,wBAAwB,CAAC,KAAe,EAAE,WAAmB;QAC1E,MAAM,WAAW,GAA2B,EAAE,CAAC;QAE/C,mBAAmB;QACnB,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,EAAE,WAAW,CAAC,CAAC;QAE1C,iCAAiC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAE5B,MAAM,QAAQ,GAAG,0BAA0B,CAAC,sBAAsB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC7E,MAAM,MAAM,GAAG,0BAA0B,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YAE7E,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI;gBACJ,EAAE;gBACF,MAAM;gBACN,QAAQ;aACT,CAAC,CAAC;QACL,CAAC;QAED,mCAAmC;QACnC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAEpD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACK,aAAa,CAAC,IAAY,EAAE,EAAU;QAC5C,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,KAAK,EAAE,EAAE,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACI,QAAQ;QAKb,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC;QAC1B,CAAC;QAED,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC3B,UAAU;YACV,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI;SACrC,CAAC;IACJ,CAAC;CACF"}

package/lib/dependencies/cycle-remediation-planner.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Cycle Remediation Planner
+ *
+ * First-slice planner that identifies strongly connected components, detects
+ * self-loops, and classifies cycles for safe remediation planning.
+ */
+import type { DependencyGraph, NodeId } from '../types/dependency.js';
+import type { MetadataComponent } from '../types/metadata.js';
+export type CycleRemediationStrategy = 'comment-reference' | 'manual';
+export type CycleRemediationSourceEdit = {
+    nodeId: NodeId;
+    targetDependency: NodeId;
+    operation: 'comment-reference';
+    filePath?: string;
+    targetDescription: string;
+};
+export type CycleRemediationDeployPhase = {
+    phase: 1 | 2;
+    description: string;
+    components: NodeId[];
+    restoreEdits?: boolean;
+};
+export type RemediationCycle = {
+    id: string;
+    nodes: NodeId[];
+    strategy: CycleRemediationStrategy;
+    warnings: string[];
+    edits: CycleRemediationSourceEdit[];
+    deployPhases: CycleRemediationDeployPhase[];
+};
+export type CycleRemediationPlan = {
+    cycles: RemediationCycle[];
+    supported: boolean;
+    warnings: string[];
+};
+export type CycleRemediationPlannerOptions = {
+    components?: ReadonlyMap<NodeId, MetadataComponent>;
+};
+export declare class CycleRemediationPlanner {
+    private readonly graph;
+    private readonly components?;
+    constructor(graph: DependencyGraph, options?: CycleRemediationPlannerOptions);
+    createPlan(): CycleRemediationPlan;
+    private findCycles;
+    private planCycle;
+    private getInternalEdges;
+    private isSimpleCycle;
+    private createCommentReferenceEdit;
+    private createDeployPhases;
+}

package/lib/dependencies/cycle-remediation-planner.js

@@ -0,0 +1,192 @@
+/**
+ * Cycle Remediation Planner
+ *
+ * First-slice planner that identifies strongly connected components, detects
+ * self-loops, and classifies cycles for safe remediation planning.
+ */
+const SUPPORTED_AUTOMATIC_TYPES = new Set(['ApexClass']);
+function compareNodeIds(left, right) {
+    return left.localeCompare(right);
+}
+function parseTypeFromNodeId(nodeId) {
+    const separatorIndex = nodeId.indexOf(':');
+    return separatorIndex === -1 ? 'Unknown' : nodeId.slice(0, separatorIndex);
+}
+function collectGraphNodeIds(graph) {
+    const nodeIds = new Set();
+    for (const [nodeId, dependencies] of graph) {
+        nodeIds.add(nodeId);
+        for (const dependencyId of dependencies) {
+            nodeIds.add(dependencyId);
+        }
+    }
+    return [...nodeIds].sort(compareNodeIds);
+}
+function getSortedDependencies(graph, nodeId) {
+    return [...(graph.get(nodeId) ?? new Set())].sort(compareNodeIds);
+}
+function getNodeType(nodeId, components) {
+    return components?.get(nodeId)?.type ?? parseTypeFromNodeId(nodeId);
+}
+function createCycleId(nodes) {
+    return nodes.join('|');
+}
+export class CycleRemediationPlanner {
+    graph;
+    components;
+    constructor(graph, options = {}) {
+        this.graph = graph;
+        this.components = options.components;
+    }
+    createPlan() {
+        const cycles = this.findCycles().map((cycleNodes) => this.planCycle(cycleNodes));
+        const warnings = [...new Set(cycles.flatMap((cycle) => cycle.warnings))].sort();
+        return {
+            cycles,
+            supported: cycles.every((cycle) => cycle.strategy === 'comment-reference'),
+            warnings,
+        };
+    }
+    findCycles() {
+        const nodeIds = collectGraphNodeIds(this.graph);
+        const indexMap = new Map();
+        const lowLinkMap = new Map();
+        const activeStack = new Set();
+        const stack = [];
+        const stronglyConnectedComponents = [];
+        let currentIndex = 0;
+        const visit = (nodeId) => {
+            indexMap.set(nodeId, currentIndex);
+            lowLinkMap.set(nodeId, currentIndex);
+            currentIndex += 1;
+            stack.push(nodeId);
+            activeStack.add(nodeId);
+            for (const dependencyId of getSortedDependencies(this.graph, nodeId)) {
+                if (!indexMap.has(dependencyId)) {
+                    visit(dependencyId);
+                    lowLinkMap.set(nodeId, Math.min(lowLinkMap.get(nodeId), lowLinkMap.get(dependencyId)));
+                }
+                else if (activeStack.has(dependencyId)) {
+                    lowLinkMap.set(nodeId, Math.min(lowLinkMap.get(nodeId), indexMap.get(dependencyId)));
+                }
+            }
+            if (lowLinkMap.get(nodeId) !== indexMap.get(nodeId)) {
+                return;
+            }
+            const component = [];
+            while (stack.length > 0) {
+                const stackNodeId = stack.pop();
+                activeStack.delete(stackNodeId);
+                component.push(stackNodeId);
+                if (stackNodeId === nodeId) {
+                    break;
+                }
+            }
+            stronglyConnectedComponents.push(component.sort(compareNodeIds));
+        };
+        for (const nodeId of nodeIds) {
+            if (!indexMap.has(nodeId)) {
+                visit(nodeId);
+            }
+        }
+        return stronglyConnectedComponents
+            .filter((component) => {
+            if (component.length > 1) {
+                return true;
+            }
+            const [nodeId] = component;
+            return (this.graph.get(nodeId) ?? new Set()).has(nodeId);
+        })
+            .sort((left, right) => createCycleId(left).localeCompare(createCycleId(right)));
+    }
+    planCycle(nodes) {
+        const nodeSet = new Set(nodes);
+        const internalEdges = this.getInternalEdges(nodes, nodeSet);
+        const nodeTypes = [...new Set(nodes.map((nodeId) => getNodeType(nodeId, this.components)))].sort();
+        const warnings = [];
+        let strategy = 'manual';
+        let edits = [];
+        if (!nodeTypes.every((type) => SUPPORTED_AUTOMATIC_TYPES.has(type))) {
+            warnings.push(`Automatic remediation currently supports ApexClass-only cycles; found ${nodeTypes.join(', ')} in ${createCycleId(nodes)}.`);
+        }
+        else if (!this.isSimpleCycle(nodes, internalEdges)) {
+            warnings.push(`Cycle ${createCycleId(nodes)} requires manual remediation because it is not a simple directed cycle.`);
+        }
+        else {
+            strategy = 'comment-reference';
+            edits = [this.createCommentReferenceEdit(internalEdges[0])];
+            for (const nodeId of nodes) {
+                if (!this.components?.get(nodeId)?.filePath) {
+                    warnings.push(`Missing component file path for ${nodeId}; execution must resolve the source file before applying edits.`);
+                }
+            }
+        }
+        return {
+            id: createCycleId(nodes),
+            nodes,
+            strategy,
+            warnings: warnings.sort(),
+            edits,
+            deployPhases: this.createDeployPhases(nodes, strategy),
+        };
+    }
+    getInternalEdges(nodes, nodeSet) {
+        return nodes
+            .flatMap((nodeId) => getSortedDependencies(this.graph, nodeId)
+            .filter((dependencyId) => nodeSet.has(dependencyId))
+            .map((dependencyId) => ({ from: nodeId, to: dependencyId })))
+            .sort((left, right) => {
+            const fromComparison = compareNodeIds(left.from, right.from);
+            return fromComparison !== 0 ? fromComparison : compareNodeIds(left.to, right.to);
+        });
+    }
+    isSimpleCycle(nodes, internalEdges) {
+        if (nodes.length === 1) {
+            return internalEdges.length === 1 && internalEdges[0].from === internalEdges[0].to;
+        }
+        if (internalEdges.length !== nodes.length) {
+            return false;
+        }
+        const outgoingCounts = new Map();
+        const incomingCounts = new Map();
+        for (const { from, to } of internalEdges) {
+            outgoingCounts.set(from, (outgoingCounts.get(from) ?? 0) + 1);
+            incomingCounts.set(to, (incomingCounts.get(to) ?? 0) + 1);
+        }
+        return nodes.every((nodeId) => outgoingCounts.get(nodeId) === 1 && incomingCounts.get(nodeId) === 1);
+    }
+    createCommentReferenceEdit(edge) {
+        return {
+            nodeId: edge.from,
+            targetDependency: edge.to,
+            operation: 'comment-reference',
+            filePath: this.components?.get(edge.from)?.filePath,
+            targetDescription: `Temporarily comment the ${edge.from} reference to ${edge.to} during phase 1.`,
+        };
+    }
+    createDeployPhases(nodes, strategy) {
+        if (strategy === 'comment-reference') {
+            return [
+                {
+                    phase: 1,
+                    description: 'Deploy temporarily cycle-broken metadata.',
+                    components: nodes,
+                },
+                {
+                    phase: 2,
+                    description: 'Restore original references and redeploy the same components.',
+                    components: nodes,
+                    restoreEdits: true,
+                },
+            ];
+        }
+        return [
+            {
+                phase: 1,
+                description: 'Manual remediation required before deployment can continue.',
+                components: nodes,
+            },
+        ];
+    }
+}
+//# sourceMappingURL=cycle-remediation-planner.js.map

package/lib/dependencies/cycle-remediation-planner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycle-remediation-planner.js","sourceRoot":"","sources":["../../src/dependencies/cycle-remediation-planner.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AA8CH,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;AAEzD,SAAS,cAAc,CAAC,IAAY,EAAE,KAAa;IACjD,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAc;IACzC,MAAM,cAAc,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3C,OAAO,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAsB;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3C,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,KAAK,MAAM,YAAY,IAAI,YAAY,EAAE,CAAC;YACxC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAsB,EAAE,MAAc;IACnE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,WAAW,CAAC,MAAc,EAAE,UAAmD;IACtF,OAAO,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,aAAa,CAAC,KAAe;IACpC,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,MAAM,OAAO,uBAAuB;IACjB,KAAK,CAAkB;IACvB,UAAU,CAA0C;IAErE,YAAmB,KAAsB,EAAE,UAA0C,EAAE;QACrF,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;IACvC,CAAC;IAEM,UAAU;QACf,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;QACjF,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAEhF,OAAO;YACL,MAAM;YACN,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,mBAAmB,CAAC;YAC1E,QAAQ;SACT,CAAC;IACJ,CAAC;IAEO,UAAU;QAChB,MAAM,OAAO,GAAG,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,2BAA2B,GAAe,EAAE,CAAC;QACnD,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,MAAM,KAAK,GAAG,CAAC,MAAc,EAAQ,EAAE;YACrC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACnC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACrC,YAAY,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAExB,KAAK,MAAM,YAAY,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;gBACrE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBAChC,KAAK,CAAC,YAAY,CAAC,CAAC;oBACpB,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,UAAU,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,CAAC,CAAC;gBAC3F,CAAC;qBAAM,IAAI,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBACzC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,CAAC,CAAC;gBACzF,CAAC;YACH,CAAC;YAED,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpD,OAAO;YACT,CAAC;YAED,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACjC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBAChC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAE5B,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;oBAC3B,MAAM;gBACR,CAAC;YACH,CAAC;YAED,2BAA2B,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;QACnE,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC1B,KAAK,CAAC,MAAM,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO,2BAA2B;aAC/B,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE;YACpB,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,MAAM,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnE,CAAC,CAAC;aACD,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC;IAEO,SAAS,CAAC,KAAe;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5D,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACnG,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,IAAI,QAAQ,GAA6B,QAAQ,CAAC;QAClD,IAAI,KAAK,GAAiC,EAAE,CAAC;QAE7C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,yBAAyB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACpE,QAAQ,CAAC,IAAI,CACX,yEAAyE,SAAS,CAAC,IAAI,CACrF,IAAI,CACL,OAAO,aAAa,CAAC,KAAK,CAAC,GAAG,CAChC,CAAC;QACJ,CAAC;aAAM,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,CAAC;YACrD,QAAQ,CAAC,IAAI,CACX,SAAS,aAAa,CAAC,KAAK,CAAC,yEAAyE,CACvG,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,mBAAmB,CAAC;YAC/B,KAAK,GAAG,CAAC,IAAI,CAAC,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAE5D,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,CAAC;oBAC5C,QAAQ,CAAC,IAAI,CACX,mCAAmC,MAAM,iEAAiE,CAC3G,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,EAAE,EAAE,aAAa,CAAC,KAAK,CAAC;YACxB,KAAK;YACL,QAAQ;YACR,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE;YACzB,KAAK;YACL,YAAY,EAAE,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,QAAQ,CAAC;SACvD,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,KAAe,EAAE,OAA4B;QACpE,OAAO,KAAK;aACT,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAClB,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC;aACtC,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;aACnD,GAAG,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC,CAC/D;aACA,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YACpB,MAAM,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC7D,OAAO,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QACnF,CAAC,CAAC,CAAC;IACP,CAAC;IAEO,aAAa,CAAC,KAAe,EAAE,aAA6B;QAClE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,aAAa,CAAC,MAAM,KAAK,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACrF,CAAC;QAED,IAAI,aAAa,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YAC1C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QACjD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEjD,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,aAAa,EAAE,CAAC;YACzC,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IACvG,CAAC;IAEO,0BAA0B,CAAC,IAAkB;QACnD,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,IAAI;YACjB,gBAAgB,EAAE,IAAI,CAAC,EAAE;YACzB,SAAS,EAAE,mBAAmB;YAC9B,QAAQ,EAAE,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ;YACnD,iBAAiB,EAAE,2BAA2B,IAAI,CAAC,IAAI,iBAAiB,IAAI,CAAC,EAAE,kBAAkB;SAClG,CAAC;IACJ,CAAC;IAEO,kBAAkB,CAAC,KAAe,EAAE,QAAkC;QAC5E,IAAI,QAAQ,KAAK,mBAAmB,EAAE,CAAC;YACrC,OAAO;gBACL;oBACE,KAAK,EAAE,CAAC;oBACR,WAAW,EAAE,2CAA2C;oBACxD,UAAU,EAAE,KAAK;iBAClB;gBACD;oBACE,KAAK,EAAE,CAAC;oBACR,WAAW,EAAE,+DAA+D;oBAC5E,UAAU,EAAE,KAAK;oBACjB,YAAY,EAAE,IAAI;iBACnB;aACF,CAAC;QACJ,CAAC;QAED,OAAO;YACL;gBACE,KAAK,EAAE,CAAC;gBACR,WAAW,EAAE,6DAA6D;gBAC1E,UAAU,EAAE,KAAK;aAClB;SACF,CAAC;IACJ,CAAC;CACF"}