@defai.digital/ax-cli 3.15.21 → 3.15.24

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

@@ -1,198 +0,0 @@
-/**
- * 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 (sets are guaranteed to exist after the checks above)
-        const fromSet = this.adjacencyList.get(from);
-        const toSet = this.reverseAdjacencyList.get(to);
-        if (fromSet && toSet) {
-            fromSet.add(to);
-            toSet.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 === undefined)
-                break;
-            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);
-                    const nodeLow = lowLink.get(node) ?? 0;
-                    const neighborLow = lowLink.get(neighbor) ?? 0;
-                    lowLink.set(node, Math.min(nodeLow, neighborLow));
-                }
-                else if (onStack.has(neighbor)) {
-                    const nodeLow = lowLink.get(node) ?? 0;
-                    const neighborIdx = index.get(neighbor) ?? 0;
-                    lowLink.set(node, Math.min(nodeLow, neighborIdx));
-                }
-            }
-            // 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();
-                    if (w === undefined)
-                        break;
-                    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

@@ -1 +0,0 @@
-{"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,iEAAiE;QACjE,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChD,IAAI,OAAO,IAAI,KAAK,EAAE,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;IACH,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,EAAE,CAAC;YAC9B,IAAI,OAAO,KAAK,SAAS;gBAAE,MAAM;YAEjC,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,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvC,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;oBAC/C,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC;gBACpD,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACjC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;oBAC7C,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC;gBACpD,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,CAAqB,CAAC;gBAC1B,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;oBAChB,IAAI,CAAC,KAAK,SAAS;wBAAE,MAAM;oBAC3B,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

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

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

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

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

@@ -1,105 +0,0 @@
-/**
- * Dependency Analyzer Types
- */
-/**
- * Dependency node representing a file
- */
-export interface DependencyNode {
-    readonly filePath: string;
-    readonly imports: ReadonlyArray<ImportEdge>;
-    readonly exports: ReadonlyArray<ExportEdge>;
-    readonly size: number;
-    readonly loc: number;
-}
-/**
- * Import edge in dependency graph
- */
-export interface ImportEdge {
-    readonly from: string;
-    readonly to: string;
-    readonly importedSymbols: ReadonlyArray<string>;
-    readonly isDynamic: boolean;
-    readonly isTypeOnly: boolean;
-}
-/**
- * Export edge
- */
-export interface ExportEdge {
-    readonly from: string;
-    readonly symbols: ReadonlyArray<string>;
-    readonly isDefault: boolean;
-    readonly isReExport: boolean;
-}
-/**
- * Circular dependency cycle
- */
-export interface CircularDependency {
-    readonly cycle: ReadonlyArray<string>;
-    readonly length: number;
-    readonly severity: 'critical' | 'high' | 'medium' | 'low';
-    readonly impact: number;
-    readonly description: string;
-}
-/**
- * Coupling metrics for a file
- */
-export interface CouplingMetrics {
-    readonly file: string;
-    readonly afferentCoupling: number;
-    readonly efferentCoupling: number;
-    readonly instability: number;
-    readonly abstractness: number;
-    readonly distanceFromMainSequence: number;
-    readonly zone: 'useless' | 'painful' | 'balanced';
-}
-/**
- * Dependency analysis result
- */
-export interface DependencyAnalysisResult {
-    readonly graph: DependencyGraph;
-    readonly circularDependencies: ReadonlyArray<CircularDependency>;
-    readonly couplingMetrics: ReadonlyArray<CouplingMetrics>;
-    readonly orphanedFiles: ReadonlyArray<string>;
-    readonly hubFiles: ReadonlyArray<string>;
-    readonly summary: DependencySummary;
-    readonly timestamp: Date;
-}
-/**
- * Summary statistics
- */
-export interface DependencySummary {
-    readonly totalFiles: number;
-    readonly totalDependencies: number;
-    readonly averageAfferentCoupling: number;
-    readonly averageEfferentCoupling: number;
-    readonly averageInstability: number;
-    readonly circularDependencyCount: number;
-    readonly maxCycleLength: number;
-    readonly healthScore: number;
-}
-/**
- * Dependency graph interface
- */
-export interface DependencyGraph {
-    addNode(node: DependencyNode): void;
-    addEdge(from: string, to: string): void;
-    getNode(file: string): DependencyNode | undefined;
-    getNodes(): DependencyNode[];
-    getAfferentDependencies(file: string): string[];
-    getEfferentDependencies(file: string): string[];
-    getTotalEdges(): number;
-    hasPath(from: string, to: string): boolean;
-    topologicalSort(): {
-        sorted: string[];
-        hasCycle: boolean;
-    };
-    getStronglyConnectedComponents(): string[][];
-}
-/**
- * Analysis options
- */
-export interface DependencyAnalysisOptions {
-    readonly includeNodeModules?: boolean;
-    readonly maxDepth?: number;
-    readonly ignorePatterns?: readonly string[];
-}

package/dist/analyzers/dependency/types.js

@@ -1,5 +0,0 @@
-/**
- * Dependency Analyzer Types
- */
-export {};
-//# sourceMappingURL=types.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/analyzers/dependency/types.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/analyzers/errors.d.ts

@@ -1,51 +0,0 @@
-/**
- * Analysis Error Classes
- *
- * Structured error hierarchy for analysis operations.
- * All errors extend from AnalysisError base class and include context information.
- */
-/**
- * Base error class for all analysis errors
- */
-export declare abstract class AnalysisError extends Error {
-    readonly code: string;
-    readonly context?: Readonly<Record<string, unknown>> | undefined;
-    constructor(message: string, code: string, context?: Readonly<Record<string, unknown>> | undefined);
-    /**
-     * Convert error to JSON for logging/serialization
-     */
-    toJSON(): Record<string, unknown>;
-}
-/**
- * Error thrown when project structure cannot be analyzed
- */
-export declare class ProjectStructureError extends AnalysisError {
-    constructor(message: string, context?: Record<string, unknown>);
-}
-/**
- * Error thrown when a file cannot be parsed or read
- */
-export declare class FileParseError extends AnalysisError {
-    readonly filePath: string;
-    constructor(message: string, filePath: string, context?: Record<string, unknown>);
-}
-/**
- * Error thrown when validation fails
- */
-export declare class ValidationError extends AnalysisError {
-    constructor(message: string, context?: Record<string, unknown>);
-}
-/**
- * Error thrown when analysis exceeds timeout
- */
-export declare class AnalysisTimeoutError extends AnalysisError {
-    readonly timeoutMs: number;
-    constructor(message: string, timeoutMs: number, context?: Record<string, unknown>);
-}
-/**
- * Error thrown when pattern detection fails
- */
-export declare class PatternDetectionError extends AnalysisError {
-    readonly patternName: string;
-    constructor(message: string, patternName: string, context?: Record<string, unknown>);
-}

package/dist/analyzers/errors.js

@@ -1,79 +0,0 @@
-/**
- * Analysis Error Classes
- *
- * Structured error hierarchy for analysis operations.
- * All errors extend from AnalysisError base class and include context information.
- */
-/**
- * Base error class for all analysis errors
- */
-export class AnalysisError extends Error {
-    code;
-    context;
-    constructor(message, code, context) {
-        super(message);
-        this.code = code;
-        this.context = context;
-        this.name = this.constructor.name;
-        Error.captureStackTrace(this, this.constructor);
-    }
-    /**
-     * Convert error to JSON for logging/serialization
-     */
-    toJSON() {
-        return {
-            name: this.name,
-            message: this.message,
-            code: this.code,
-            context: this.context,
-            stack: this.stack,
-        };
-    }
-}
-/**
- * Error thrown when project structure cannot be analyzed
- */
-export class ProjectStructureError extends AnalysisError {
-    constructor(message, context) {
-        super(message, 'PROJECT_STRUCTURE_ERROR', context);
-    }
-}
-/**
- * Error thrown when a file cannot be parsed or read
- */
-export class FileParseError extends AnalysisError {
-    filePath;
-    constructor(message, filePath, context) {
-        super(message, 'FILE_PARSE_ERROR', { ...context, filePath });
-        this.filePath = filePath;
-    }
-}
-/**
- * Error thrown when validation fails
- */
-export class ValidationError extends AnalysisError {
-    constructor(message, context) {
-        super(message, 'VALIDATION_ERROR', context);
-    }
-}
-/**
- * Error thrown when analysis exceeds timeout
- */
-export class AnalysisTimeoutError extends AnalysisError {
-    timeoutMs;
-    constructor(message, timeoutMs, context) {
-        super(message, 'ANALYSIS_TIMEOUT', { ...context, timeoutMs });
-        this.timeoutMs = timeoutMs;
-    }
-}
-/**
- * Error thrown when pattern detection fails
- */
-export class PatternDetectionError extends AnalysisError {
-    patternName;
-    constructor(message, patternName, context) {
-        super(message, 'PATTERN_DETECTION_ERROR', { ...context, patternName });
-        this.patternName = patternName;
-    }
-}
-//# sourceMappingURL=errors.js.map

package/dist/analyzers/errors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"errors.js","sourceRoot":"","sources":["../../src/analyzers/errors.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;GAEG;AACH,MAAM,OAAgB,aAAc,SAAQ,KAAK;IAG7B;IACA;IAHlB,YACE,OAAe,EACC,IAAY,EACZ,OAA2C;QAE3D,KAAK,CAAC,OAAO,CAAC,CAAC;QAHC,SAAI,GAAJ,IAAI,CAAQ;QACZ,YAAO,GAAP,OAAO,CAAoC;QAG3D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;QAClC,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,qBAAsB,SAAQ,aAAa;IACtD,YAAY,OAAe,EAAE,OAAiC;QAC5D,KAAK,CAAC,OAAO,EAAE,yBAAyB,EAAE,OAAO,CAAC,CAAC;IACrD,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,cAAe,SAAQ,aAAa;IAG7B;IAFlB,YACE,OAAe,EACC,QAAgB,EAChC,OAAiC;QAEjC,KAAK,CAAC,OAAO,EAAE,kBAAkB,EAAE,EAAE,GAAG,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC;QAH7C,aAAQ,GAAR,QAAQ,CAAQ;IAIlC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,eAAgB,SAAQ,aAAa;IAChD,YAAY,OAAe,EAAE,OAAiC;QAC5D,KAAK,CAAC,OAAO,EAAE,kBAAkB,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,oBAAqB,SAAQ,aAAa;IAGnC;IAFlB,YACE,OAAe,EACC,SAAiB,EACjC,OAAiC;QAEjC,KAAK,CAAC,OAAO,EAAE,kBAAkB,EAAE,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;QAH9C,cAAS,GAAT,SAAS,CAAQ;IAInC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,qBAAsB,SAAQ,aAAa;IAGpC;IAFlB,YACE,OAAe,EACC,WAAmB,EACnC,OAAiC;QAEjC,KAAK,CAAC,OAAO,EAAE,yBAAyB,EAAE,EAAE,GAAG,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;QAHvD,gBAAW,GAAX,WAAW,CAAQ;IAIrC,CAAC;CACF"}

package/dist/analyzers/git/churn-calculator.d.ts

@@ -1,36 +0,0 @@
-/**
- * Git Churn Calculator
- *
- * Calculates file churn metrics from git history
- */
-import type { FileChurn, GitAnalysisOptions, ContributorStats } from './types.js';
-export declare class ChurnCalculator {
-    private repositoryPath;
-    constructor(repositoryPath: string);
-    /**
-     * Calculate churn for all files
-     */
-    calculateChurn(options?: GitAnalysisOptions): Promise<FileChurn[]>;
-    /**
-     * Calculate contributor statistics
-     */
-    calculateContributorStats(options?: GitAnalysisOptions): Promise<ContributorStats[]>;
-    /**
-     * Get git log with file stats
-     * SECURITY FIX: Prevent command injection by validating inputs and using array-based execution
-     */
-    private getGitLog;
-    /**
-     * Parse git log output
-     */
-    private parseGitLog;
-    /**
-     * Check if file should be included based on patterns
-     */
-    private shouldIncludeFile;
-    /**
-     * Simple pattern matching (supports * wildcard)
-     * SECURITY FIX: Prevent ReDoS by using non-greedy matching and proper escaping
-     */
-    private matchPattern;
-}