@defai.digital/ax-cli 3.4.6 → 3.5.2

package/dist/analyzers/dependency/circular-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"circular-detector.js","sourceRoot":"","sources":["../../../src/analyzers/dependency/circular-detector.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,MAAM,OAAO,0BAA0B;IACrC;;OAEG;IACH,YAAY,CAAC,KAAsB;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,8BAA8B,EAAE,CAAC;QACpD,MAAM,MAAM,GAAyB,EAAE,CAAC;QAExC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,aAAa,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAClE,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC3E,OAAO,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QACjE,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,KAAe,EACf,KAAsB;QAEtB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAE5B,2CAA2C;QAC3C,IAAI,QAAgD,CAAC;QACrD,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,QAAQ,GAAG,QAAQ,CAAC,CAAC,uBAAuB;QAC9C,CAAC;aAAM,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;YACvB,QAAQ,GAAG,MAAM,CAAC,CAAC,yBAAyB;QAC9C,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,UAAU,CAAC,CAAC,iCAAiC;QAC1D,CAAC;QAED,6BAA6B;QAC7B,8BAA8B;QAC9B,wBAAwB;QACxB,gCAAgC;QAChC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,IAAI,EAAE,CAAC;gBACT,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC;gBACrB,aAAa,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CACrB,GAAG,EACH,IAAI,CAAC,KAAK,CACR,CAAC,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,GAAa,mCAAmC;YAClE,CAAC,QAAQ,GAAG,GAAG,CAAC,GAAG,EAAE,GAAU,0BAA0B;YACzD,CAAC,aAAa,GAAG,EAAE,CAAC,GAAG,EAAE,CAAM,+BAA+B;SAC/D,CACF,CAAC;QAEF,uBAAuB;QACvB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QAC1D,MAAM,WAAW,GAAG,iCAAiC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAE/F,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YAC3B,MAAM;YACN,QAAQ;YACR,MAAM;YACN,WAAW;SACZ,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/analyzers/dependency/coupling-calculator.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Coupling Metrics Calculator
+ *
+ * Calculates:
+ * - Afferent Coupling (Ca): How many files depend on this
+ * - Efferent Coupling (Ce): How many files this depends on
+ * - Instability (I): Ce / (Ce + Ca)
+ * - Abstractness (A): Abstract elements / Total elements
+ * - Distance from Main Sequence (D): |A + I - 1|
+ */
+import type { DependencyGraph } from './dependency-graph.js';
+import type { CouplingMetrics } from './types.js';
+import type { FileASTInfo } from '../ast/types.js';
+export declare class CouplingCalculator {
+    /**
+     * Calculate coupling metrics for all files
+     */
+    calculateMetrics(graph: DependencyGraph, astMap: Map<string, FileASTInfo>): CouplingMetrics[];
+    /**
+     * Calculate abstractness of a file
+     * A = abstract classes + interfaces / total classes + functions
+     */
+    private calculateAbstractness;
+}

package/dist/analyzers/dependency/coupling-calculator.js

@@ -0,0 +1,86 @@
+/**
+ * Coupling Metrics Calculator
+ *
+ * Calculates:
+ * - Afferent Coupling (Ca): How many files depend on this
+ * - Efferent Coupling (Ce): How many files this depends on
+ * - Instability (I): Ce / (Ce + Ca)
+ * - Abstractness (A): Abstract elements / Total elements
+ * - Distance from Main Sequence (D): |A + I - 1|
+ */
+export class CouplingCalculator {
+    /**
+     * Calculate coupling metrics for all files
+     */
+    calculateMetrics(graph, astMap) {
+        const metrics = [];
+        for (const node of graph.getNodes()) {
+            const file = node.filePath;
+            const ca = graph.getAfferentDependencies(file).length;
+            const ce = graph.getEfferentDependencies(file).length;
+            // Instability: I = Ce / (Ce + Ca)
+            // I = 0: Maximally stable (many dependents, few dependencies)
+            // I = 1: Maximally unstable (few dependents, many dependencies)
+            const instability = (ce + ca) === 0 ? 0 : ce / (ce + ca);
+            // Abstractness: A = abstract elements / total elements
+            const ast = astMap.get(file);
+            const abstractness = ast ? this.calculateAbstractness(ast) : 0;
+            // Distance from Main Sequence: D = |A + I - 1|
+            // D = 0: On the main sequence (ideal)
+            // D > 0.5: In "zone of pain" (concrete + unstable) or "zone of uselessness" (abstract + stable)
+            const distance = Math.abs(abstractness + instability - 1);
+            // Determine zone
+            let zone;
+            if (abstractness > 0.7 && instability < 0.3) {
+                zone = 'useless'; // Abstract but no dependents
+            }
+            else if (abstractness < 0.3 && instability > 0.7) {
+                zone = 'painful'; // Concrete and many dependencies
+            }
+            else {
+                zone = 'balanced';
+            }
+            metrics.push(Object.freeze({
+                file,
+                afferentCoupling: ca,
+                efferentCoupling: ce,
+                instability,
+                abstractness,
+                distanceFromMainSequence: distance,
+                zone,
+            }));
+        }
+        return metrics;
+    }
+    /**
+     * Calculate abstractness of a file
+     * A = abstract classes + interfaces / total classes + functions
+     */
+    calculateAbstractness(ast) {
+        let abstractCount = 0;
+        let totalCount = 0;
+        // Count classes
+        for (const cls of ast.classes) {
+            totalCount++;
+            // Heuristic: Consider class abstract if:
+            // 1. Name starts with 'Abstract' or 'Base' or 'I'
+            // 2. Implements interfaces (likely an abstraction)
+            const isAbstract = cls.name.startsWith('Abstract') ||
+                cls.name.startsWith('Base') ||
+                cls.name.startsWith('I') ||
+                cls.implementsInterfaces.length > 0;
+            if (isAbstract) {
+                abstractCount++;
+            }
+        }
+        // Count type exports as abstract
+        // (interfaces, type aliases)
+        const typeExports = ast.exports.filter(exp => exp.type === 'type');
+        abstractCount += typeExports.length;
+        totalCount += typeExports.length;
+        // Functions are always concrete
+        totalCount += ast.functions.length;
+        return totalCount === 0 ? 0 : abstractCount / totalCount;
+    }
+}
+//# sourceMappingURL=coupling-calculator.js.map

package/dist/analyzers/dependency/coupling-calculator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coupling-calculator.js","sourceRoot":"","sources":["../../../src/analyzers/dependency/coupling-calculator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAMH,MAAM,OAAO,kBAAkB;IAC7B;;OAEG;IACH,gBAAgB,CACd,KAAsB,EACtB,MAAgC;QAEhC,MAAM,OAAO,GAAsB,EAAE,CAAC;QAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE3B,MAAM,EAAE,GAAG,KAAK,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;YACtD,MAAM,EAAE,GAAG,KAAK,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;YAEtD,kCAAkC;YAClC,8DAA8D;YAC9D,gEAAgE;YAChE,MAAM,WAAW,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAEzD,uDAAuD;YACvD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC7B,MAAM,YAAY,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAE/D,+CAA+C;YAC/C,sCAAsC;YACtC,gGAAgG;YAChG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC;YAE1D,iBAAiB;YACjB,IAAI,IAAwC,CAAC;YAC7C,IAAI,YAAY,GAAG,GAAG,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;gBAC5C,IAAI,GAAG,SAAS,CAAC,CAAC,6BAA6B;YACjD,CAAC;iBAAM,IAAI,YAAY,GAAG,GAAG,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;gBACnD,IAAI,GAAG,SAAS,CAAC,CAAC,iCAAiC;YACrD,CAAC;iBAAM,CAAC;gBACN,IAAI,GAAG,UAAU,CAAC;YACpB,CAAC;YAED,OAAO,CAAC,IAAI,CACV,MAAM,CAAC,MAAM,CAAC;gBACZ,IAAI;gBACJ,gBAAgB,EAAE,EAAE;gBACpB,gBAAgB,EAAE,EAAE;gBACpB,WAAW;gBACX,YAAY;gBACZ,wBAAwB,EAAE,QAAQ;gBAClC,IAAI;aACL,CAAC,CACH,CAAC;QACJ,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACK,qBAAqB,CAAC,GAAgB;QAC5C,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,gBAAgB;QAChB,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAC9B,UAAU,EAAE,CAAC;YAEb,yCAAyC;YACzC,kDAAkD;YAClD,mDAAmD;YACnD,MAAM,UAAU,GACd,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC;gBAC/B,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;gBAC3B,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBACxB,GAAG,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC;YAEtC,IAAI,UAAU,EAAE,CAAC;gBACf,aAAa,EAAE,CAAC;YAClB,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,6BAA6B;QAC7B,MAAM,WAAW,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;QACnE,aAAa,IAAI,WAAW,CAAC,MAAM,CAAC;QACpC,UAAU,IAAI,WAAW,CAAC,MAAM,CAAC;QAEjC,gCAAgC;QAChC,UAAU,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC;QAEnC,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,UAAU,CAAC;IAC3D,CAAC;CACF"}

package/dist/analyzers/dependency/dependency-analyzer.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Dependency Analyzer
+ *
+ * Main orchestrator for dependency analysis
+ */
+import type { DependencyAnalysisResult, DependencyAnalysisOptions } from './types.js';
+export declare class DependencyAnalyzer {
+    private astParser;
+    private circularDetector;
+    private couplingCalculator;
+    constructor();
+    /**
+     * Analyze dependencies in a directory
+     */
+    analyzeDependencies(directory: string, pattern?: string, options?: DependencyAnalysisOptions): Promise<DependencyAnalysisResult>;
+    /**
+     * Create import edges from AST imports
+     */
+    private createImportEdges;
+    /**
+     * Create export edges from AST exports
+     */
+    private createExportEdges;
+    /**
+     * Resolve import specifier to absolute file path
+     */
+    private resolveImportPath;
+    /**
+     * Find orphaned files (no dependencies)
+     */
+    private findOrphanedFiles;
+    /**
+     * Find hub files (high coupling)
+     */
+    private findHubFiles;
+    /**
+     * Calculate summary statistics
+     */
+    private calculateSummary;
+}

package/dist/analyzers/dependency/dependency-analyzer.js

@@ -0,0 +1,214 @@
+/**
+ * Dependency Analyzer
+ *
+ * Main orchestrator for dependency analysis
+ */
+import { DependencyGraph } from './dependency-graph.js';
+import { CircularDependencyDetector } from './circular-detector.js';
+import { CouplingCalculator } from './coupling-calculator.js';
+import { ASTParser } from '../ast/parser.js';
+import { existsSync, promises as fs } from 'fs';
+import { glob } from 'glob';
+import path from 'path';
+export class DependencyAnalyzer {
+    astParser;
+    circularDetector;
+    couplingCalculator;
+    constructor() {
+        this.astParser = new ASTParser();
+        this.circularDetector = new CircularDependencyDetector();
+        this.couplingCalculator = new CouplingCalculator();
+    }
+    /**
+     * Analyze dependencies in a directory
+     */
+    async analyzeDependencies(directory, pattern = '**/*.{ts,tsx,js,jsx}', options = {}) {
+        const timestamp = new Date();
+        // Find all files
+        const ignorePatterns = [
+            '**/node_modules/**',
+            '**/dist/**',
+            '**/build/**',
+            '**/.git/**',
+            ...(options.ignorePatterns || []),
+        ];
+        const files = await glob(pattern, {
+            cwd: directory,
+            absolute: true,
+            nodir: true,
+            ignore: ignorePatterns,
+        });
+        // Build dependency graph
+        const graph = new DependencyGraph();
+        const astMap = new Map();
+        // Parse all files
+        for (const file of files) {
+            try {
+                const ast = this.astParser.parseFile(file);
+                astMap.set(file, ast);
+                // Get file stats
+                const stats = await fs.stat(file);
+                // Create dependency node
+                const node = {
+                    filePath: file,
+                    imports: this.createImportEdges(file, ast.imports, directory),
+                    exports: this.createExportEdges(file, ast.exports),
+                    size: stats.size,
+                    loc: ast.totalLines,
+                };
+                graph.addNode(node);
+                // Add edges for internal imports
+                for (const imp of node.imports) {
+                    if (!options.includeNodeModules && imp.to.includes('node_modules')) {
+                        continue;
+                    }
+                    graph.addEdge(imp.from, imp.to);
+                }
+            }
+            catch (error) {
+                // Skip files that can't be parsed
+                console.error(`Error parsing ${file}:`, error);
+            }
+        }
+        // Detect circular dependencies
+        const circularDependencies = this.circularDetector.detectCycles(graph);
+        // Calculate coupling metrics
+        const couplingMetrics = this.couplingCalculator.calculateMetrics(graph, astMap);
+        // Find orphaned files (no imports/exports or isolated)
+        const orphanedFiles = this.findOrphanedFiles(graph);
+        // Find hub files (high coupling)
+        const hubFiles = this.findHubFiles(couplingMetrics);
+        // Calculate summary
+        const summary = this.calculateSummary(graph, circularDependencies, couplingMetrics);
+        return Object.freeze({
+            graph,
+            circularDependencies: Object.freeze(circularDependencies),
+            couplingMetrics: Object.freeze(couplingMetrics),
+            orphanedFiles: Object.freeze(orphanedFiles),
+            hubFiles: Object.freeze(hubFiles),
+            summary: Object.freeze(summary),
+            timestamp,
+        });
+    }
+    /**
+     * Create import edges from AST imports
+     */
+    createImportEdges(file, imports, baseDir) {
+        return imports.map(imp => {
+            const resolvedPath = this.resolveImportPath(file, imp.moduleSpecifier, baseDir);
+            return Object.freeze({
+                from: file,
+                to: resolvedPath,
+                importedSymbols: Object.freeze([
+                    ...imp.namedImports,
+                    ...(imp.defaultImport ? [imp.defaultImport] : []),
+                    ...(imp.namespaceImport ? [imp.namespaceImport] : []),
+                ]),
+                isDynamic: false,
+                isTypeOnly: imp.isTypeOnly || false,
+            });
+        });
+    }
+    /**
+     * Create export edges from AST exports
+     */
+    createExportEdges(file, exports) {
+        return exports.map(exp => Object.freeze({
+            from: file,
+            symbols: Object.freeze([exp.name]),
+            isDefault: exp.isDefault,
+            isReExport: false, // Simplified for now
+        }));
+    }
+    /**
+     * Resolve import specifier to absolute file path
+     */
+    resolveImportPath(fromFile, specifier, baseDir) {
+        if (specifier.startsWith('.')) {
+            // Relative import
+            const fromDir = path.dirname(fromFile);
+            let resolved = path.resolve(fromDir, specifier);
+            // Remove .js extension if present (TypeScript uses .js in imports)
+            if (resolved.endsWith('.js')) {
+                resolved = resolved.slice(0, -3);
+            }
+            // Try extensions
+            const extensions = ['.ts', '.tsx', '.js', '.jsx', '/index.ts', '/index.tsx', '/index.js'];
+            for (const ext of extensions) {
+                const testPath = resolved.endsWith('.ts') || resolved.endsWith('.tsx')
+                    ? resolved
+                    : resolved + ext;
+                try {
+                    if (existsSync(testPath)) {
+                        return testPath;
+                    }
+                }
+                catch {
+                    // Continue to next extension
+                }
+            }
+            // Return resolved path even if file doesn't exist
+            return resolved + '.ts'; // Default to .ts
+        }
+        // External module
+        return path.join(baseDir, 'node_modules', specifier);
+    }
+    /**
+     * Find orphaned files (no dependencies)
+     */
+    findOrphanedFiles(graph) {
+        const orphaned = [];
+        for (const node of graph.getNodes()) {
+            const afferent = graph.getAfferentDependencies(node.filePath);
+            const efferent = graph.getEfferentDependencies(node.filePath);
+            if (afferent.length === 0 && efferent.length === 0) {
+                orphaned.push(node.filePath);
+            }
+        }
+        return orphaned;
+    }
+    /**
+     * Find hub files (high coupling)
+     */
+    findHubFiles(metrics) {
+        if (metrics.length === 0)
+            return [];
+        // Hub = high afferent OR efferent coupling (top 10%)
+        const sorted = [...metrics].sort((a, b) => (b.afferentCoupling + b.efferentCoupling) -
+            (a.afferentCoupling + a.efferentCoupling));
+        const threshold = Math.max(1, Math.ceil(sorted.length * 0.1));
+        return sorted.slice(0, threshold).map(m => m.file);
+    }
+    /**
+     * Calculate summary statistics
+     */
+    calculateSummary(graph, circularDeps, metrics) {
+        const totalFiles = graph.getNodes().length;
+        const totalDependencies = graph.getTotalEdges();
+        const avgCa = totalFiles > 0
+            ? metrics.reduce((sum, m) => sum + m.afferentCoupling, 0) / totalFiles
+            : 0;
+        const avgCe = totalFiles > 0
+            ? metrics.reduce((sum, m) => sum + m.efferentCoupling, 0) / totalFiles
+            : 0;
+        const avgInstability = totalFiles > 0
+            ? metrics.reduce((sum, m) => sum + m.instability, 0) / totalFiles
+            : 0;
+        const maxCycleLength = circularDeps.reduce((max, dep) => Math.max(max, dep.length), 0);
+        // Health score (0-100)
+        const circularPenalty = Math.min(50, circularDeps.length * 5);
+        const instabilityPenalty = avgInstability * 20;
+        const healthScore = Math.max(0, 100 - circularPenalty - instabilityPenalty);
+        return Object.freeze({
+            totalFiles,
+            totalDependencies,
+            averageAfferentCoupling: avgCa,
+            averageEfferentCoupling: avgCe,
+            averageInstability: avgInstability,
+            circularDependencyCount: circularDeps.length,
+            maxCycleLength,
+            healthScore: Math.round(healthScore),
+        });
+    }
+}
+//# sourceMappingURL=dependency-analyzer.js.map

package/dist/analyzers/dependency/dependency-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-analyzer.js","sourceRoot":"","sources":["../../../src/analyzers/dependency/dependency-analyzer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,0BAA0B,EAAE,MAAM,wBAAwB,CAAC;AACpE,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAY7C,OAAO,EAAE,UAAU,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,IAAI,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,IAAI,MAAM,MAAM,CAAC;AAExB,MAAM,OAAO,kBAAkB;IACrB,SAAS,CAAY;IACrB,gBAAgB,CAA6B;IAC7C,kBAAkB,CAAqB;IAE/C;QACE,IAAI,CAAC,SAAS,GAAG,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,CAAC,gBAAgB,GAAG,IAAI,0BAA0B,EAAE,CAAC;QACzD,IAAI,CAAC,kBAAkB,GAAG,IAAI,kBAAkB,EAAE,CAAC;IACrD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,mBAAmB,CACvB,SAAiB,EACjB,UAAkB,sBAAsB,EACxC,UAAqC,EAAE;QAEvC,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAE7B,iBAAiB;QACjB,MAAM,cAAc,GAAG;YACrB,oBAAoB;YACpB,YAAY;YACZ,aAAa;YACb,YAAY;YACZ,GAAG,CAAC,OAAO,CAAC,cAAc,IAAI,EAAE,CAAC;SAClC,CAAC;QAEF,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE;YAChC,GAAG,EAAE,SAAS;YACd,QAAQ,EAAE,IAAI;YACd,KAAK,EAAE,IAAI;YACX,MAAM,EAAE,cAAc;SACvB,CAAC,CAAC;QAEH,yBAAyB;QACzB,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAE9C,kBAAkB;QAClB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAEtB,iBAAiB;gBACjB,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAElC,yBAAyB;gBACzB,MAAM,IAAI,GAAmB;oBAC3B,QAAQ,EAAE,IAAI;oBACd,OAAO,EAAE,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC;oBAC7D,OAAO,EAAE,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC;oBAClD,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,GAAG,EAAE,GAAG,CAAC,UAAU;iBACpB,CAAC;gBAEF,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAEpB,iCAAiC;gBACjC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBAC/B,IAAI,CAAC,OAAO,CAAC,kBAAkB,IAAI,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;wBACnE,SAAS;oBACX,CAAC;oBACD,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,kCAAkC;gBAClC,OAAO,CAAC,KAAK,CAAC,iBAAiB,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,MAAM,oBAAoB,GAAG,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAEvE,6BAA6B;QAC7B,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEhF,uDAAuD;QACvD,MAAM,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAEpD,iCAAiC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;QAEpD,oBAAoB;QACpB,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,oBAAoB,EAAE,eAAe,CAAC,CAAC;QAEpF,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,KAAK;YACL,oBAAoB,EAAE,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC;YACzD,eAAe,EAAE,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC;YAC/C,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC;YAC3C,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;YACjC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;YAC/B,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,iBAAiB,CACvB,IAAY,EACZ,OAA8B,EAC9B,OAAe;QAEf,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACvB,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,GAAG,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC;YAEhF,OAAO,MAAM,CAAC,MAAM,CAAC;gBACnB,IAAI,EAAE,IAAI;gBACV,EAAE,EAAE,YAAY;gBAChB,eAAe,EAAE,MAAM,CAAC,MAAM,CAAC;oBAC7B,GAAG,GAAG,CAAC,YAAY;oBACnB,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjD,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;iBACtD,CAAC;gBACF,SAAS,EAAE,KAAK;gBAChB,UAAU,EAAE,GAAG,CAAC,UAAU,IAAI,KAAK;aACpC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,IAAY,EAAE,OAA8B;QACpE,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CACvB,MAAM,CAAC,MAAM,CAAC;YACZ,IAAI,EAAE,IAAI;YACV,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,UAAU,EAAE,KAAK,EAAE,qBAAqB;SACzC,CAAC,CACH,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,QAAgB,EAAE,SAAiB,EAAE,OAAe;QAC5E,IAAI,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9B,kBAAkB;YAClB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YAEhD,mEAAmE;YACnE,IAAI,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;YAED,iBAAiB;YACjB,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YAC1F,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;oBACpE,CAAC,CAAC,QAAQ;oBACV,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC;gBACnB,IAAI,CAAC;oBACH,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACzB,OAAO,QAAQ,CAAC;oBAClB,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,6BAA6B;gBAC/B,CAAC;YACH,CAAC;YAED,kDAAkD;YAClD,OAAO,QAAQ,GAAG,KAAK,CAAC,CAAC,iBAAiB;QAC5C,CAAC;QAED,kBAAkB;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,cAAc,EAAE,SAAS,CAAC,CAAC;IACvD,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAAsB;QAC9C,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,uBAAuB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC9D,MAAM,QAAQ,GAAG,KAAK,CAAC,uBAAuB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAE9D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,OAAmC;QACtD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEpC,qDAAqD;QACrD,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAC9B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAAC;YACzC,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAC5C,CAAC;QAEF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;QAC9D,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAAsB,EACtB,YAA2C,EAC3C,OAAmC;QAEnC,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC;QAC3C,MAAM,iBAAiB,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;QAEhD,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC;YAC1B,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,GAAG,UAAU;YACtE,CAAC,CAAC,CAAC,CAAC;QACN,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC;YAC1B,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,GAAG,UAAU;YACtE,CAAC,CAAC,CAAC,CAAC;QACN,MAAM,cAAc,GAAG,UAAU,GAAG,CAAC;YACnC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,GAAG,UAAU;YACjE,CAAC,CAAC,CAAC,CAAC;QAEN,MAAM,cAAc,GAAG,YAAY,CAAC,MAAM,CACxC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,EACvC,CAAC,CACF,CAAC;QAEF,uBAAuB;QACvB,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9D,MAAM,kBAAkB,GAAG,cAAc,GAAG,EAAE,CAAC;QAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,eAAe,GAAG,kBAAkB,CAAC,CAAC;QAE5E,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,UAAU;YACV,iBAAiB;YACjB,uBAAuB,EAAE,KAAK;YAC9B,uBAAuB,EAAE,KAAK;YAC9B,kBAAkB,EAAE,cAAc;YAClC,uBAAuB,EAAE,YAAY,CAAC,MAAM;YAC5C,cAAc;YACd,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC;SACrC,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/analyzers/dependency/dependency-graph.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Dependency Graph Implementation
+ *
+ * Adjacency list-based directed graph for file dependencies
+ */
+import type { DependencyNode, DependencyGraph as IDependencyGraph } from './types.js';
+export declare class DependencyGraph implements IDependencyGraph {
+    private nodes;
+    private adjacencyList;
+    private reverseAdjacencyList;
+    constructor();
+    /**
+     * Add node to graph
+     */
+    addNode(node: DependencyNode): void;
+    /**
+     * Add directed edge from -> to
+     */
+    addEdge(from: string, to: string): void;
+    /**
+     * Get node by file path
+     */
+    getNode(file: string): DependencyNode | undefined;
+    /**
+     * Get all nodes
+     */
+    getNodes(): DependencyNode[];
+    /**
+     * Get afferent dependencies (files that depend on this file)
+     */
+    getAfferentDependencies(file: string): string[];
+    /**
+     * Get efferent dependencies (files this file depends on)
+     */
+    getEfferentDependencies(file: string): string[];
+    /**
+     * Get total number of edges
+     */
+    getTotalEdges(): number;
+    /**
+     * Check if path exists from -> to using BFS
+     */
+    hasPath(from: string, to: string): boolean;
+    /**
+     * Topological sort using DFS
+     * Returns sorted list and whether cycle was detected
+     */
+    topologicalSort(): {
+        sorted: string[];
+        hasCycle: boolean;
+    };
+    /**
+     * Get strongly connected components using Tarjan's algorithm
+     * (Used for circular dependency detection)
+     */
+    getStronglyConnectedComponents(): string[][];
+}

package/dist/analyzers/dependency/dependency-graph.js

@@ -0,0 +1,186 @@
+/**
+ * Dependency Graph Implementation
+ *
+ * Adjacency list-based directed graph for file dependencies
+ */
+export class DependencyGraph {
+    nodes;
+    adjacencyList;
+    reverseAdjacencyList; // For efficient afferent lookup
+    constructor() {
+        this.nodes = new Map();
+        this.adjacencyList = new Map();
+        this.reverseAdjacencyList = new Map();
+    }
+    /**
+     * Add node to graph
+     */
+    addNode(node) {
+        this.nodes.set(node.filePath, node);
+        if (!this.adjacencyList.has(node.filePath)) {
+            this.adjacencyList.set(node.filePath, new Set());
+        }
+        if (!this.reverseAdjacencyList.has(node.filePath)) {
+            this.reverseAdjacencyList.set(node.filePath, new Set());
+        }
+    }
+    /**
+     * Add directed edge from -> to
+     */
+    addEdge(from, to) {
+        // Ensure nodes exist
+        if (!this.adjacencyList.has(from)) {
+            this.adjacencyList.set(from, new Set());
+        }
+        if (!this.reverseAdjacencyList.has(to)) {
+            this.reverseAdjacencyList.set(to, new Set());
+        }
+        // Add edge
+        this.adjacencyList.get(from).add(to);
+        this.reverseAdjacencyList.get(to).add(from);
+    }
+    /**
+     * Get node by file path
+     */
+    getNode(file) {
+        return this.nodes.get(file);
+    }
+    /**
+     * Get all nodes
+     */
+    getNodes() {
+        return Array.from(this.nodes.values());
+    }
+    /**
+     * Get afferent dependencies (files that depend on this file)
+     */
+    getAfferentDependencies(file) {
+        const deps = this.reverseAdjacencyList.get(file);
+        return deps ? Array.from(deps) : [];
+    }
+    /**
+     * Get efferent dependencies (files this file depends on)
+     */
+    getEfferentDependencies(file) {
+        const deps = this.adjacencyList.get(file);
+        return deps ? Array.from(deps) : [];
+    }
+    /**
+     * Get total number of edges
+     */
+    getTotalEdges() {
+        let total = 0;
+        for (const deps of this.adjacencyList.values()) {
+            total += deps.size;
+        }
+        return total;
+    }
+    /**
+     * Check if path exists from -> to using BFS
+     */
+    hasPath(from, to) {
+        if (from === to)
+            return true;
+        const visited = new Set();
+        const queue = [from];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current === to)
+                return true;
+            if (visited.has(current))
+                continue;
+            visited.add(current);
+            const neighbors = this.adjacencyList.get(current) || new Set();
+            for (const neighbor of neighbors) {
+                if (!visited.has(neighbor)) {
+                    queue.push(neighbor);
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Topological sort using DFS
+     * Returns sorted list and whether cycle was detected
+     */
+    topologicalSort() {
+        const visited = new Set();
+        const recursionStack = new Set();
+        const sorted = [];
+        let hasCycle = false;
+        const dfs = (node) => {
+            if (recursionStack.has(node)) {
+                hasCycle = true;
+                return;
+            }
+            if (visited.has(node))
+                return;
+            visited.add(node);
+            recursionStack.add(node);
+            const neighbors = this.adjacencyList.get(node) || new Set();
+            for (const neighbor of neighbors) {
+                dfs(neighbor);
+            }
+            recursionStack.delete(node);
+            sorted.unshift(node); // Add to front for reverse post-order
+        };
+        // Visit all nodes
+        for (const node of this.nodes.keys()) {
+            if (!visited.has(node)) {
+                dfs(node);
+            }
+        }
+        return { sorted, hasCycle };
+    }
+    /**
+     * Get strongly connected components using Tarjan's algorithm
+     * (Used for circular dependency detection)
+     */
+    getStronglyConnectedComponents() {
+        const index = new Map();
+        const lowLink = new Map();
+        const onStack = new Set();
+        const stack = [];
+        const sccs = [];
+        let currentIndex = 0;
+        const strongConnect = (node) => {
+            index.set(node, currentIndex);
+            lowLink.set(node, currentIndex);
+            currentIndex++;
+            stack.push(node);
+            onStack.add(node);
+            const neighbors = this.adjacencyList.get(node) || new Set();
+            for (const neighbor of neighbors) {
+                if (!index.has(neighbor)) {
+                    strongConnect(neighbor);
+                    lowLink.set(node, Math.min(lowLink.get(node), lowLink.get(neighbor)));
+                }
+                else if (onStack.has(neighbor)) {
+                    lowLink.set(node, Math.min(lowLink.get(node), index.get(neighbor)));
+                }
+            }
+            // If node is a root node, pop the stack and create SCC
+            if (lowLink.get(node) === index.get(node)) {
+                const scc = [];
+                let w;
+                do {
+                    w = stack.pop();
+                    onStack.delete(w);
+                    scc.push(w);
+                } while (w !== node);
+                // Only add if SCC has more than 1 node (circular dependency)
+                if (scc.length > 1) {
+                    sccs.push(scc);
+                }
+            }
+        };
+        // Run on all nodes
+        for (const node of this.nodes.keys()) {
+            if (!index.has(node)) {
+                strongConnect(node);
+            }
+        }
+        return sccs;
+    }
+}
+//# sourceMappingURL=dependency-graph.js.map

package/dist/analyzers/dependency/dependency-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-graph.js","sourceRoot":"","sources":["../../../src/analyzers/dependency/dependency-graph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,OAAO,eAAe;IAClB,KAAK,CAA8B;IACnC,aAAa,CAA2B;IACxC,oBAAoB,CAA2B,CAAC,gCAAgC;IAExF;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,oBAAoB,GAAG,IAAI,GAAG,EAAE,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAoB;QAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAEpC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY,EAAE,EAAU;QAC9B,qBAAqB;QACrB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC1C,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/C,CAAC;QAED,WAAW;QACX,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,uBAAuB,CAAC,IAAY;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,uBAAuB,CAAC,IAAY;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,aAAa;QACX,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY,EAAE,EAAU;QAC9B,IAAI,IAAI,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QAE7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,IAAI,CAAC,CAAC;QAE/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,KAAK,EAAE;gBAAE,OAAO,IAAI,CAAC;YAChC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAEnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAC/D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,MAAM,GAAG,GAAG,CAAC,IAAY,EAAQ,EAAE;YACjC,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,QAAQ,GAAG,IAAI,CAAC;gBAChB,OAAO;YACT,CAAC;YACD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO;YAE9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAEzB,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAC5D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChB,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,sCAAsC;QAC9D,CAAC,CAAC;QAEF,kBAAkB;QAClB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,GAAG,CAAC,IAAI,CAAC,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACH,8BAA8B;QAC5B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAe,EAAE,CAAC;QAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,MAAM,aAAa,GAAG,CAAC,IAAY,EAAQ,EAAE;YAC3C,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YAChC,YAAY,EAAE,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElB,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAC5D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzB,aAAa,CAAC,QAAQ,CAAC,CAAC;oBACxB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;gBAC1E,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACjC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;YAED,uDAAuD;YACvD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1C,MAAM,GAAG,GAAa,EAAE,CAAC;gBACzB,IAAI,CAAS,CAAC;gBACd,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACd,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE;gBAErB,6DAA6D;gBAC7D,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,mBAAmB;QACnB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,aAAa,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/analyzers/dependency/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Dependency Analyzer Module
+ */
+export { DependencyAnalyzer } from './dependency-analyzer.js';
+export { DependencyGraph } from './dependency-graph.js';
+export { CircularDependencyDetector } from './circular-detector.js';
+export { CouplingCalculator } from './coupling-calculator.js';
+export type { DependencyNode, ImportEdge, ExportEdge, CircularDependency, CouplingMetrics, DependencyAnalysisResult, DependencySummary, DependencyAnalysisOptions, } from './types.js';

package/dist/analyzers/dependency/index.js

@@ -0,0 +1,8 @@
+/**
+ * Dependency Analyzer Module
+ */
+export { DependencyAnalyzer } from './dependency-analyzer.js';
+export { DependencyGraph } from './dependency-graph.js';
+export { CircularDependencyDetector } from './circular-detector.js';
+export { CouplingCalculator } from './coupling-calculator.js';
+//# sourceMappingURL=index.js.map

package/dist/analyzers/dependency/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/analyzers/dependency/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,0BAA0B,EAAE,MAAM,wBAAwB,CAAC;AACpE,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC"}