@defai.digital/ax-cli 3.15.21 → 3.15.24

package/dist/analyzers/code-smells/types.d.ts

@@ -1,82 +0,0 @@
-/**
- * Code Smell Detector Types
- */
-/**
- * Type of code smell
- */
-export declare enum SmellType {
-    LONG_METHOD = "LONG_METHOD",
-    LARGE_CLASS = "LARGE_CLASS",
-    LONG_PARAMETER_LIST = "LONG_PARAMETER_LIST",
-    DUPLICATE_CODE = "DUPLICATE_CODE",
-    DEAD_CODE = "DEAD_CODE",
-    MAGIC_NUMBERS = "MAGIC_NUMBERS",
-    NESTED_CONDITIONALS = "NESTED_CONDITIONALS",
-    FEATURE_ENVY = "FEATURE_ENVY",
-    DATA_CLUMPS = "DATA_CLUMPS",
-    INAPPROPRIATE_INTIMACY = "INAPPROPRIATE_INTIMACY"
-}
-/**
- * Severity of code smell
- */
-export declare enum SmellSeverity {
-    LOW = "LOW",
-    MEDIUM = "MEDIUM",
-    HIGH = "HIGH",
-    CRITICAL = "CRITICAL"
-}
-/**
- * Code smell detection result
- */
-export interface CodeSmell {
-    readonly type: SmellType;
-    readonly severity: SmellSeverity;
-    readonly filePath: string;
-    readonly startLine: number;
-    readonly endLine: number;
-    readonly message: string;
-    readonly suggestion: string;
-    readonly metadata: Readonly<Record<string, unknown>>;
-}
-/**
- * Detector configuration
- */
-export interface DetectorConfig {
-    readonly enabled: boolean;
-    readonly thresholds?: Readonly<Record<string, number>>;
-}
-/**
- * Analysis options
- */
-export interface CodeSmellAnalysisOptions {
-    readonly detectorConfigs?: Readonly<Record<SmellType, DetectorConfig>>;
-    readonly ignorePatterns?: readonly string[];
-}
-/**
- * Analysis result
- */
-export interface CodeSmellAnalysisResult {
-    readonly smells: ReadonlyArray<CodeSmell>;
-    readonly summary: CodeSmellSummary;
-    readonly timestamp: Date;
-}
-/**
- * Summary statistics
- */
-export interface CodeSmellSummary {
-    readonly totalSmells: number;
-    readonly smellsByType: Readonly<Record<SmellType, number>>;
-    readonly smellsBySeverity: Readonly<Record<SmellSeverity, number>>;
-    readonly filesAnalyzed: number;
-    readonly filesWithSmells: number;
-    readonly averageSmellsPerFile: number;
-    readonly codeHealthScore: number;
-}
-/**
- * Base detector interface
- */
-export interface SmellDetector {
-    readonly type: SmellType;
-    readonly config: DetectorConfig;
-    detect(filePath: string): Promise<CodeSmell[]>;
-}

package/dist/analyzers/code-smells/types.js

@@ -1,30 +0,0 @@
-/**
- * Code Smell Detector Types
- */
-/**
- * Type of code smell
- */
-export var SmellType;
-(function (SmellType) {
-    SmellType["LONG_METHOD"] = "LONG_METHOD";
-    SmellType["LARGE_CLASS"] = "LARGE_CLASS";
-    SmellType["LONG_PARAMETER_LIST"] = "LONG_PARAMETER_LIST";
-    SmellType["DUPLICATE_CODE"] = "DUPLICATE_CODE";
-    SmellType["DEAD_CODE"] = "DEAD_CODE";
-    SmellType["MAGIC_NUMBERS"] = "MAGIC_NUMBERS";
-    SmellType["NESTED_CONDITIONALS"] = "NESTED_CONDITIONALS";
-    SmellType["FEATURE_ENVY"] = "FEATURE_ENVY";
-    SmellType["DATA_CLUMPS"] = "DATA_CLUMPS";
-    SmellType["INAPPROPRIATE_INTIMACY"] = "INAPPROPRIATE_INTIMACY";
-})(SmellType || (SmellType = {}));
-/**
- * Severity of code smell
- */
-export var SmellSeverity;
-(function (SmellSeverity) {
-    SmellSeverity["LOW"] = "LOW";
-    SmellSeverity["MEDIUM"] = "MEDIUM";
-    SmellSeverity["HIGH"] = "HIGH";
-    SmellSeverity["CRITICAL"] = "CRITICAL";
-})(SmellSeverity || (SmellSeverity = {}));
-//# sourceMappingURL=types.js.map

package/dist/analyzers/code-smells/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/analyzers/code-smells/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;GAEG;AACH,MAAM,CAAN,IAAY,SAWX;AAXD,WAAY,SAAS;IACnB,wCAA2B,CAAA;IAC3B,wCAA2B,CAAA;IAC3B,wDAA2C,CAAA;IAC3C,8CAAiC,CAAA;IACjC,oCAAuB,CAAA;IACvB,4CAA+B,CAAA;IAC/B,wDAA2C,CAAA;IAC3C,0CAA6B,CAAA;IAC7B,wCAA2B,CAAA;IAC3B,8DAAiD,CAAA;AACnD,CAAC,EAXW,SAAS,KAAT,SAAS,QAWpB;AAED;;GAEG;AACH,MAAM,CAAN,IAAY,aAKX;AALD,WAAY,aAAa;IACvB,4BAAW,CAAA;IACX,kCAAiB,CAAA;IACjB,8BAAa,CAAA;IACb,sCAAqB,CAAA;AACvB,CAAC,EALW,aAAa,KAAb,aAAa,QAKxB"}

package/dist/analyzers/dependency/circular-detector.d.ts

@@ -1,17 +0,0 @@
-/**
- * Circular Dependency Detector
- *
- * Uses Tarjan's Strongly Connected Components algorithm
- */
-import type { DependencyGraph } from './dependency-graph.js';
-import type { CircularDependency } from './types.js';
-export declare class CircularDependencyDetector {
-    /**
-     * Detect all circular dependencies
-     */
-    detectCycles(graph: DependencyGraph): CircularDependency[];
-    /**
-     * Create circular dependency object from SCC
-     */
-    private createCircularDependency;
-}

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

@@ -1,73 +0,0 @@
-/**
- * Circular Dependency Detector
- *
- * Uses Tarjan's Strongly Connected Components algorithm
- */
-export class CircularDependencyDetector {
-    /**
-     * Detect all circular dependencies
-     */
-    detectCycles(graph) {
-        const sccs = graph.getStronglyConnectedComponents();
-        const cycles = [];
-        for (const scc of sccs) {
-            if (scc.length > 1) {
-                cycles.push(this.createCircularDependency(scc, graph));
-            }
-        }
-        // Sort by severity and impact
-        return cycles.sort((a, b) => {
-            const severityOrder = { critical: 0, high: 1, medium: 2, low: 3 };
-            const severityDiff = severityOrder[a.severity] - severityOrder[b.severity];
-            return severityDiff !== 0 ? severityDiff : b.impact - a.impact;
-        });
-    }
-    /**
-     * Create circular dependency object from SCC
-     */
-    createCircularDependency(cycle, graph) {
-        const length = cycle.length;
-        // Determine severity based on cycle length
-        let severity;
-        if (length === 2) {
-            severity = 'medium'; // Simple A->B->A cycle
-        }
-        else if (length <= 4) {
-            severity = 'high'; // Complex but manageable
-        }
-        else {
-            severity = 'critical'; // Very complex, hard to refactor
-        }
-        // Calculate impact based on:
-        // 1. Number of files in cycle
-        // 2. Total LOC in cycle
-        // 3. Coupling of files in cycle
-        let totalLOC = 0;
-        let totalCoupling = 0;
-        for (const file of cycle) {
-            const node = graph.getNode(file);
-            if (node) {
-                totalLOC += node.loc;
-                totalCoupling += node.imports.length + node.exports.length;
-            }
-        }
-        // BUG FIX: Safe impact formula with individual component capping to prevent overflow
-        // Each component is capped individually before summing to prevent precision loss
-        // with very large codebases (1M+ LOC)
-        const lengthFactor = Math.min(30, (length / 10) * 30);
-        const locFactor = Math.min(40, (totalLOC / 500) * 40);
-        const couplingFactor = Math.min(30, (totalCoupling / 20) * 30);
-        const impact = Math.min(100, Math.round(lengthFactor + locFactor + couplingFactor));
-        // Generate description
-        const fileNames = cycle.map(f => f.split('/').pop() || f);
-        const description = `Circular dependency detected: ${fileNames.join(' → ')} → ${fileNames[0]}`;
-        return Object.freeze({
-            cycle: Object.freeze(cycle),
-            length,
-            severity,
-            impact,
-            description,
-        });
-    }
-}
-//# sourceMappingURL=circular-detector.js.map

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

@@ -1 +0,0 @@
-{"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,qFAAqF;QACrF,iFAAiF;QACjF,sCAAsC;QACtC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,QAAQ,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;QACtD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,aAAa,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAE/D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CACrB,GAAG,EACH,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,SAAS,GAAG,cAAc,CAAC,CACtD,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

@@ -1,24 +0,0 @@
-/**
- * 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

@@ -1,86 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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

@@ -1,44 +0,0 @@
-/**
- * Dependency Analyzer
- *
- * Main orchestrator for dependency analysis
- */
-import type { DependencyAnalysisResult, DependencyAnalysisOptions } from './types.js';
-/**
- * Default file patterns for multi-language support
- */
-export declare const DEFAULT_ANALYSIS_PATTERN = "**/*.{ts,tsx,js,jsx,py,rs,go,c,cpp,cc,cxx,h,hpp,swift}";
-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

@@ -1,218 +0,0 @@
-/**
- * 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 { getMultiLanguageParser } from '../ast/multi-language-parser.js';
-import { existsSync, promises as fs } from 'fs';
-import { glob } from 'glob';
-import path from 'path';
-/**
- * Default file patterns for multi-language support
- */
-export const DEFAULT_ANALYSIS_PATTERN = '**/*.{ts,tsx,js,jsx,py,rs,go,c,cpp,cc,cxx,h,hpp,swift}';
-export class DependencyAnalyzer {
-    astParser;
-    circularDetector;
-    couplingCalculator;
-    constructor() {
-        this.astParser = getMultiLanguageParser();
-        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 = await 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

@@ -1 +0,0 @@
-{"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,sBAAsB,EAA4B,MAAM,iCAAiC,CAAC;AAYnG,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;;GAEG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,wDAAwD,CAAC;AAEjG,MAAM,OAAO,kBAAkB;IACrB,SAAS,CAAsB;IAC/B,gBAAgB,CAA6B;IAC7C,kBAAkB,CAAqB;IAE/C;QACE,IAAI,CAAC,SAAS,GAAG,sBAAsB,EAAE,CAAC;QAC1C,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,MAAM,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBACjD,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

@@ -1,57 +0,0 @@
-/**
- * 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[][];
-}