@defai.digital/ax-cli 3.4.6 → 3.5.4

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"}

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

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

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

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

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

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

@@ -0,0 +1,34 @@
+/**
+ * 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
+     */
+    private getGitLog;
+    /**
+     * Parse git log output
+     */
+    private parseGitLog;
+    /**
+     * Check if file should be included based on patterns
+     */
+    private shouldIncludeFile;
+    /**
+     * Simple pattern matching (supports * wildcard)
+     */
+    private matchPattern;
+}

package/dist/analyzers/git/churn-calculator.js

@@ -0,0 +1,214 @@
+/**
+ * Git Churn Calculator
+ *
+ * Calculates file churn metrics from git history
+ */
+import { execSync } from 'child_process';
+export class ChurnCalculator {
+    repositoryPath;
+    constructor(repositoryPath) {
+        this.repositoryPath = repositoryPath;
+    }
+    /**
+     * Calculate churn for all files
+     */
+    async calculateChurn(options = {}) {
+        const gitLogOutput = this.getGitLog(options);
+        const fileChurnMap = new Map();
+        // Parse git log output
+        const commits = this.parseGitLog(gitLogOutput);
+        for (const commit of commits) {
+            for (const file of commit.files) {
+                if (!this.shouldIncludeFile(file.path, options))
+                    continue;
+                if (!fileChurnMap.has(file.path)) {
+                    fileChurnMap.set(file.path, {
+                        commits: 0,
+                        additions: 0,
+                        deletions: 0,
+                        lastModified: commit.date,
+                        authors: new Set(),
+                    });
+                }
+                const churn = fileChurnMap.get(file.path);
+                churn.commits++;
+                churn.additions += file.additions;
+                churn.deletions += file.deletions;
+                churn.authors.add(commit.author);
+                // Update last modified date
+                if (commit.date > churn.lastModified) {
+                    churn.lastModified = commit.date;
+                }
+            }
+        }
+        // Convert to FileChurn array
+        const result = [];
+        for (const [filePath, data] of fileChurnMap.entries()) {
+            result.push(Object.freeze({
+                filePath,
+                commitCount: data.commits,
+                additions: data.additions,
+                deletions: data.deletions,
+                totalChurn: data.additions + data.deletions,
+                lastModified: data.lastModified,
+                authors: Object.freeze(Array.from(data.authors)),
+            }));
+        }
+        // Sort by total churn (descending)
+        return result.sort((a, b) => b.totalChurn - a.totalChurn);
+    }
+    /**
+     * Calculate contributor statistics
+     */
+    async calculateContributorStats(options = {}) {
+        const gitLogOutput = this.getGitLog(options);
+        const commits = this.parseGitLog(gitLogOutput);
+        const contributorMap = new Map();
+        for (const commit of commits) {
+            if (!contributorMap.has(commit.author)) {
+                contributorMap.set(commit.author, {
+                    commits: 0,
+                    files: new Set(),
+                    added: 0,
+                    deleted: 0,
+                    firstCommit: commit.date,
+                    lastCommit: commit.date,
+                });
+            }
+            const stats = contributorMap.get(commit.author);
+            stats.commits++;
+            for (const file of commit.files) {
+                if (this.shouldIncludeFile(file.path, options)) {
+                    stats.files.add(file.path);
+                    stats.added += file.additions;
+                    stats.deleted += file.deletions;
+                }
+            }
+            // Update date range
+            if (commit.date < stats.firstCommit) {
+                stats.firstCommit = commit.date;
+            }
+            if (commit.date > stats.lastCommit) {
+                stats.lastCommit = commit.date;
+            }
+        }
+        // Convert to ContributorStats array
+        const result = [];
+        for (const [author, data] of contributorMap.entries()) {
+            result.push(Object.freeze({
+                author,
+                commitCount: data.commits,
+                filesChanged: data.files.size,
+                linesAdded: data.added,
+                linesDeleted: data.deleted,
+                firstCommit: data.firstCommit,
+                lastCommit: data.lastCommit,
+            }));
+        }
+        // Sort by commit count (descending)
+        return result.sort((a, b) => b.commitCount - a.commitCount);
+    }
+    /**
+     * Get git log with file stats
+     */
+    getGitLog(options) {
+        const args = ['log', '--numstat', '--pretty=format:%H|%an|%ad|%s'];
+        if (options.since) {
+            args.push(`--since="${options.since}"`);
+        }
+        if (options.until) {
+            args.push(`--until="${options.until}"`);
+        }
+        if (options.branch) {
+            args.push(options.branch);
+        }
+        try {
+            return execSync(`git ${args.join(' ')}`, {
+                cwd: this.repositoryPath,
+                encoding: 'utf-8',
+                maxBuffer: 10 * 1024 * 1024, // 10MB buffer
+                stdio: ['pipe', 'pipe', 'ignore'], // Ignore stderr to suppress shell warnings
+            });
+        }
+        catch (error) {
+            // If git command fails, return empty string
+            return '';
+        }
+    }
+    /**
+     * Parse git log output
+     */
+    parseGitLog(output) {
+        const commits = [];
+        const lines = output.split('\n');
+        let currentCommit = null;
+        for (const line of lines) {
+            if (!line.trim())
+                continue;
+            // Commit line: hash|author|date|message
+            if (line.includes('|')) {
+                const parts = line.split('|');
+                if (parts.length >= 4) {
+                    // Save previous commit
+                    if (currentCommit) {
+                        commits.push(currentCommit);
+                    }
+                    // Start new commit
+                    currentCommit = {
+                        hash: parts[0],
+                        author: parts[1],
+                        date: new Date(parts[2]),
+                        message: parts[3],
+                        files: [],
+                    };
+                }
+            }
+            else if (currentCommit) {
+                // File stat line: additions deletions filename
+                const parts = line.split('\t');
+                if (parts.length >= 3) {
+                    const additions = parts[0] === '-' ? 0 : parseInt(parts[0], 10);
+                    const deletions = parts[1] === '-' ? 0 : parseInt(parts[1], 10);
+                    const path = parts[2];
+                    currentCommit.files.push({ path, additions, deletions });
+                }
+            }
+        }
+        // Add last commit
+        if (currentCommit) {
+            commits.push(currentCommit);
+        }
+        return commits;
+    }
+    /**
+     * Check if file should be included based on patterns
+     */
+    shouldIncludeFile(filePath, options) {
+        // Check exclude patterns
+        if (options.excludePatterns) {
+            for (const pattern of options.excludePatterns) {
+                if (this.matchPattern(filePath, pattern)) {
+                    return false;
+                }
+            }
+        }
+        // Check include patterns
+        if (options.includePatterns && options.includePatterns.length > 0) {
+            for (const pattern of options.includePatterns) {
+                if (this.matchPattern(filePath, pattern)) {
+                    return true;
+                }
+            }
+            return false;
+        }
+        return true;
+    }
+    /**
+     * Simple pattern matching (supports * wildcard)
+     */
+    matchPattern(filePath, pattern) {
+        const regex = new RegExp('^' + pattern.replace(/\*/g, '.*') + '$');
+        return regex.test(filePath);
+    }
+}
+//# sourceMappingURL=churn-calculator.js.map

package/dist/analyzers/git/churn-calculator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"churn-calculator.js","sourceRoot":"","sources":["../../../src/analyzers/git/churn-calculator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAGzC,MAAM,OAAO,eAAe;IAClB,cAAc,CAAS;IAE/B,YAAY,cAAsB;QAChC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,UAA8B,EAAE;QACnD,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC7C,MAAM,YAAY,GAAG,IAAI,GAAG,EAMxB,CAAC;QAEL,uBAAuB;QACvB,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;QAE/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBAChC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC;oBAAE,SAAS;gBAE1D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACjC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;wBAC1B,OAAO,EAAE,CAAC;wBACV,SAAS,EAAE,CAAC;wBACZ,SAAS,EAAE,CAAC;wBACZ,YAAY,EAAE,MAAM,CAAC,IAAI;wBACzB,OAAO,EAAE,IAAI,GAAG,EAAE;qBACnB,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;gBAC3C,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChB,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC;gBAClC,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC;gBAClC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAEjC,4BAA4B;gBAC5B,IAAI,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;oBACrC,KAAK,CAAC,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YACtD,MAAM,CAAC,IAAI,CACT,MAAM,CAAC,MAAM,CAAC;gBACZ,QAAQ;gBACR,WAAW,EAAE,IAAI,CAAC,OAAO;gBACzB,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,UAAU,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS;gBAC3C,YAAY,EAAE,IAAI,CAAC,YAAY;gBAC/B,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACjD,CAAC,CACH,CAAC;QACJ,CAAC;QAED,mCAAmC;QACnC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,yBAAyB,CAAC,UAA8B,EAAE;QAC9D,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;QAE/C,MAAM,cAAc,GAAG,IAAI,GAAG,EAO1B,CAAC;QAEL,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE;oBAChC,OAAO,EAAE,CAAC;oBACV,KAAK,EAAE,IAAI,GAAG,EAAE;oBAChB,KAAK,EAAE,CAAC;oBACR,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,MAAM,CAAC,IAAI;oBACxB,UAAU,EAAE,MAAM,CAAC,IAAI;iBACxB,CAAC,CAAC;YACL,CAAC;YAED,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAE,CAAC;YACjD,KAAK,CAAC,OAAO,EAAE,CAAC;YAEhB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBAChC,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;oBAC/C,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC3B,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC;oBAC9B,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC;gBAClC,CAAC;YACH,CAAC;YAED,oBAAoB;YACpB,IAAI,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;gBACpC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC;YAClC,CAAC;YACD,IAAI,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;gBACnC,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC;YACjC,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;YACtD,MAAM,CAAC,IAAI,CACT,MAAM,CAAC,MAAM,CAAC;gBACZ,MAAM;gBACN,WAAW,EAAE,IAAI,CAAC,OAAO;gBACzB,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;gBAC7B,UAAU,EAAE,IAAI,CAAC,KAAK;gBACtB,YAAY,EAAE,IAAI,CAAC,OAAO;gBAC1B,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,UAAU,EAAE,IAAI,CAAC,UAAU;aAC5B,CAAC,CACH,CAAC;QACJ,CAAC;QAED,oCAAoC;QACpC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IAC9D,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,OAA2B;QAC3C,MAAM,IAAI,GAAG,CAAC,KAAK,EAAE,WAAW,EAAE,+BAA+B,CAAC,CAAC;QAEnE,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC,YAAY,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC,YAAY,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;QAED,IAAI,CAAC;YACH,OAAO,QAAQ,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;gBACvC,GAAG,EAAE,IAAI,CAAC,cAAc;gBACxB,QAAQ,EAAE,OAAO;gBACjB,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI,EAAE,cAAc;gBAC3C,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,2CAA2C;aAC/E,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,4CAA4C;YAC5C,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,MAAc;QAOhC,MAAM,OAAO,GAMR,EAAE,CAAC;QAER,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,aAAa,GAAQ,IAAI,CAAC;QAE9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,SAAS;YAE3B,wCAAwC;YACxC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBACtB,uBAAuB;oBACvB,IAAI,aAAa,EAAE,CAAC;wBAClB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;oBAC9B,CAAC;oBAED,mBAAmB;oBACnB,aAAa,GAAG;wBACd,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;wBACd,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;wBAChB,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBACxB,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;wBACjB,KAAK,EAAE,EAAE;qBACV,CAAC;gBACJ,CAAC;YACH,CAAC;iBAAM,IAAI,aAAa,EAAE,CAAC;gBACzB,+CAA+C;gBAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/B,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBACtB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAChE,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAChE,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAEtB,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,IAAI,aAAa,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,QAAgB,EAAE,OAA2B;QACrE,yBAAyB;QACzB,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;YAC5B,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;gBAC9C,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC;oBACzC,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,IAAI,OAAO,CAAC,eAAe,IAAI,OAAO,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClE,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;gBAC9C,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC;oBACzC,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,QAAgB,EAAE,OAAe;QACpD,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QACnE,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;CACF"}

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

@@ -0,0 +1,19 @@
+/**
+ * Git Analyzer
+ *
+ * Main orchestrator for Git history analysis
+ */
+import type { GitAnalysisResult, GitAnalysisOptions } from './types.js';
+export declare class GitAnalyzer {
+    private churnCalculator;
+    private hotspotDetector;
+    constructor(repositoryPath: string);
+    /**
+     * Perform complete Git analysis
+     */
+    analyze(options?: GitAnalysisOptions): Promise<GitAnalysisResult>;
+    /**
+     * Calculate summary statistics
+     */
+    private calculateSummary;
+}