@aiready/context-analyzer 0.9.4 → 0.9.6

package/dist/scoring.js

@@ -0,0 +1,133 @@
+/**
+ * Calculate AI Readiness Score for context efficiency (0-100)
+ *
+ * Based on:
+ * - Average context budget (tokens needed to understand files)
+ * - Import depth (dependency chain length)
+ * - Fragmentation score (code organization)
+ * - Critical/major issues
+ */
+export function calculateContextScore(summary) {
+    const { avgContextBudget, maxContextBudget, avgImportDepth, maxImportDepth, avgFragmentation, criticalIssues, majorIssues, } = summary;
+    // Context budget scoring (40% weight in final score)
+    // Ideal: <5000 tokens avg = 100
+    // Acceptable: 5000-10000 = 90-70
+    // High: 10000-20000 = 70-40
+    // Critical: >20000 = <40
+    const budgetScore = avgContextBudget < 5000
+        ? 100
+        : Math.max(0, 100 - (avgContextBudget - 5000) / 150);
+    // Import depth scoring (30% weight)
+    // Ideal: <5 avg = 100
+    // Acceptable: 5-8 = 80-60
+    // Deep: >8 = <60
+    const depthScore = avgImportDepth < 5
+        ? 100
+        : Math.max(0, 100 - (avgImportDepth - 5) * 10);
+    // Fragmentation scoring (30% weight)
+    // Well-organized: <0.3 = 100
+    // Moderate: 0.3-0.5 = 80-60
+    // Fragmented: >0.5 = <60
+    const fragmentationScore = avgFragmentation < 0.3
+        ? 100
+        : Math.max(0, 100 - (avgFragmentation - 0.3) * 200);
+    // Issue penalties
+    const criticalPenalty = criticalIssues * 10;
+    const majorPenalty = majorIssues * 3;
+    // Max budget penalty (if any single file is extreme)
+    const maxBudgetPenalty = maxContextBudget > 15000
+        ? Math.min(20, (maxContextBudget - 15000) / 500)
+        : 0;
+    // Weighted average of subscores
+    const rawScore = (budgetScore * 0.4) + (depthScore * 0.3) + (fragmentationScore * 0.3);
+    const finalScore = rawScore - criticalPenalty - majorPenalty - maxBudgetPenalty;
+    const score = Math.max(0, Math.min(100, Math.round(finalScore)));
+    // Build factors array
+    const factors = [
+        {
+            name: 'Context Budget',
+            impact: Math.round((budgetScore * 0.4) - 40),
+            description: `Avg ${Math.round(avgContextBudget)} tokens per file ${avgContextBudget < 5000 ? '(excellent)' : avgContextBudget < 10000 ? '(acceptable)' : '(high)'}`,
+        },
+        {
+            name: 'Import Depth',
+            impact: Math.round((depthScore * 0.3) - 30),
+            description: `Avg ${avgImportDepth.toFixed(1)} levels ${avgImportDepth < 5 ? '(excellent)' : avgImportDepth < 8 ? '(acceptable)' : '(deep)'}`,
+        },
+        {
+            name: 'Fragmentation',
+            impact: Math.round((fragmentationScore * 0.3) - 30),
+            description: `${(avgFragmentation * 100).toFixed(0)}% fragmentation ${avgFragmentation < 0.3 ? '(well-organized)' : avgFragmentation < 0.5 ? '(moderate)' : '(high)'}`,
+        },
+    ];
+    if (criticalIssues > 0) {
+        factors.push({
+            name: 'Critical Issues',
+            impact: -criticalPenalty,
+            description: `${criticalIssues} critical context issue${criticalIssues > 1 ? 's' : ''}`,
+        });
+    }
+    if (majorIssues > 0) {
+        factors.push({
+            name: 'Major Issues',
+            impact: -majorPenalty,
+            description: `${majorIssues} major context issue${majorIssues > 1 ? 's' : ''}`,
+        });
+    }
+    if (maxBudgetPenalty > 0) {
+        factors.push({
+            name: 'Extreme File Detected',
+            impact: -Math.round(maxBudgetPenalty),
+            description: `One file requires ${Math.round(maxContextBudget)} tokens (very high)`,
+        });
+    }
+    // Generate recommendations
+    const recommendations = [];
+    if (avgContextBudget > 10000) {
+        const estimatedImpact = Math.min(15, Math.round((avgContextBudget - 10000) / 1000));
+        recommendations.push({
+            action: 'Reduce file dependencies to lower context requirements',
+            estimatedImpact,
+            priority: 'high',
+        });
+    }
+    if (avgImportDepth > 8) {
+        const estimatedImpact = Math.min(10, Math.round((avgImportDepth - 8) * 2));
+        recommendations.push({
+            action: 'Flatten import chains to reduce depth',
+            estimatedImpact,
+            priority: avgImportDepth > 10 ? 'high' : 'medium',
+        });
+    }
+    if (avgFragmentation > 0.5) {
+        const estimatedImpact = Math.min(12, Math.round((avgFragmentation - 0.5) * 40));
+        recommendations.push({
+            action: 'Consolidate related code into cohesive modules',
+            estimatedImpact,
+            priority: 'medium',
+        });
+    }
+    if (maxContextBudget > 20000) {
+        recommendations.push({
+            action: `Split large file (${Math.round(maxContextBudget)} tokens) into smaller modules`,
+            estimatedImpact: 8,
+            priority: 'high',
+        });
+    }
+    return {
+        toolName: 'context-analyzer',
+        score,
+        rawMetrics: {
+            avgContextBudget: Math.round(avgContextBudget),
+            maxContextBudget: Math.round(maxContextBudget),
+            avgImportDepth: Math.round(avgImportDepth * 10) / 10,
+            maxImportDepth,
+            avgFragmentation: Math.round(avgFragmentation * 100) / 100,
+            criticalIssues,
+            majorIssues,
+        },
+        factors,
+        recommendations,
+    };
+}
+//# sourceMappingURL=scoring.js.map

package/dist/scoring.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../src/scoring.ts"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,OAAuB;IAEvB,MAAM,EACJ,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,gBAAgB,EAChB,cAAc,EACd,WAAW,GACZ,GAAG,OAAO,CAAC;IAEZ,qDAAqD;IACrD,gCAAgC;IAChC,iCAAiC;IACjC,4BAA4B;IAC5B,yBAAyB;IACzB,MAAM,WAAW,GAAG,gBAAgB,GAAG,IAAI;QACzC,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;IAEvD,oCAAoC;IACpC,sBAAsB;IACtB,0BAA0B;IAC1B,iBAAiB;IACjB,MAAM,UAAU,GAAG,cAAc,GAAG,CAAC;QACnC,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAEjD,qCAAqC;IACrC,6BAA6B;IAC7B,4BAA4B;IAC5B,yBAAyB;IACzB,MAAM,kBAAkB,GAAG,gBAAgB,GAAG,GAAG;QAC/C,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,gBAAgB,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAEtD,kBAAkB;IAClB,MAAM,eAAe,GAAG,cAAc,GAAG,EAAE,CAAC;IAC5C,MAAM,YAAY,GAAG,WAAW,GAAG,CAAC,CAAC;IAErC,qDAAqD;IACrD,MAAM,gBAAgB,GAAG,gBAAgB,GAAG,KAAK;QAC/C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,gBAAgB,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC;QAChD,CAAC,CAAC,CAAC,CAAC;IAEN,gCAAgC;IAChC,MAAM,QAAQ,GAAG,CAAC,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,kBAAkB,GAAG,GAAG,CAAC,CAAC;IACvF,MAAM,UAAU,GAAG,QAAQ,GAAG,eAAe,GAAG,YAAY,GAAG,gBAAgB,CAAC;IAEhF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAEjE,sBAAsB;IACtB,MAAM,OAAO,GAAG;QACd;YACE,IAAI,EAAE,gBAAgB;YACtB,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YAC5C,WAAW,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,oBAAoB,gBAAgB,GAAG,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,gBAAgB,GAAG,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,EAAE;SACrK;QACD;YACE,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YAC3C,WAAW,EAAE,OAAO,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,EAAE;SAC9I;QACD;YACE,IAAI,EAAE,eAAe;YACrB,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,kBAAkB,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YACnD,WAAW,EAAE,GAAG,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,mBAAmB,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,EAAE;SACvK;KACF,CAAC;IAEF,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,iBAAiB;YACvB,MAAM,EAAE,CAAC,eAAe;YACxB,WAAW,EAAE,GAAG,cAAc,0BAA0B,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;SACxF,CAAC,CAAC;IACL,CAAC;IAED,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QACpB,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,CAAC,YAAY;YACrB,WAAW,EAAE,GAAG,WAAW,uBAAuB,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;SAC/E,CAAC,CAAC;IACL,CAAC;IAED,IAAI,gBAAgB,GAAG,CAAC,EAAE,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,uBAAuB;YAC7B,MAAM,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC;YACrC,WAAW,EAAE,qBAAqB,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,qBAAqB;SACpF,CAAC,CAAC;IACL,CAAC;IAED,2BAA2B;IAC3B,MAAM,eAAe,GAAyC,EAAE,CAAC;IAEjE,IAAI,gBAAgB,GAAG,KAAK,EAAE,CAAC;QAC7B,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,gBAAgB,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACpF,eAAe,CAAC,IAAI,CAAC;YACnB,MAAM,EAAE,wDAAwD;YAChE,eAAe;YACf,QAAQ,EAAE,MAAM;SACjB,CAAC,CAAC;IACL,CAAC;IAED,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3E,eAAe,CAAC,IAAI,CAAC;YACnB,MAAM,EAAE,uCAAuC;YAC/C,eAAe;YACf,QAAQ,EAAE,cAAc,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;SAClD,CAAC,CAAC;IACL,CAAC;IAED,IAAI,gBAAgB,GAAG,GAAG,EAAE,CAAC;QAC3B,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,gBAAgB,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChF,eAAe,CAAC,IAAI,CAAC;YACnB,MAAM,EAAE,gDAAgD;YACxD,eAAe;YACf,QAAQ,EAAE,QAAQ;SACnB,CAAC,CAAC;IACL,CAAC;IAED,IAAI,gBAAgB,GAAG,KAAK,EAAE,CAAC;QAC7B,eAAe,CAAC,IAAI,CAAC;YACnB,MAAM,EAAE,qBAAqB,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,+BAA+B;YACxF,eAAe,EAAE,CAAC;YAClB,QAAQ,EAAE,MAAM;SACjB,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,kBAAkB;QAC5B,KAAK;QACL,UAAU,EAAE;YACV,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC;YAC9C,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC;YAC9C,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,EAAE,CAAC,GAAG,EAAE;YACpD,cAAc;YACd,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB,GAAG,GAAG,CAAC,GAAG,GAAG;YAC1D,cAAc;YACd,WAAW;SACZ;QACD,OAAO;QACP,eAAe;KAChB,CAAC;AACJ,CAAC"}

package/dist/semantic-analysis.d.ts

@@ -0,0 +1,44 @@
+import type { DependencyGraph, CoUsageData, DomainAssignment, DomainSignals } from './types';
+/**
+ * Build co-usage matrix: track which files are imported together
+ *
+ * Files frequently imported together likely belong to the same semantic domain
+ */
+export declare function buildCoUsageMatrix(graph: DependencyGraph): Map<string, Map<string, number>>;
+/**
+ * Extract type dependencies from AST exports
+ *
+ * Files that share types are semantically related
+ */
+export declare function buildTypeGraph(graph: DependencyGraph): Map<string, Set<string>>;
+/**
+ * Find semantic clusters using co-usage patterns
+ *
+ * Files with high co-usage counts belong in the same cluster
+ */
+export declare function findSemanticClusters(coUsageMatrix: Map<string, Map<string, number>>, minCoUsage?: number): Map<string, string[]>;
+/**
+ * Calculate confidence score for domain assignment based on multiple signals
+ */
+export declare function calculateDomainConfidence(signals: DomainSignals): number;
+/**
+ * Infer domain from semantic analysis (co-usage + types)
+ *
+ * This replaces the folder-based heuristic with actual code relationships
+ */
+export declare function inferDomainFromSemantics(file: string, exportName: string, graph: DependencyGraph, coUsageMatrix: Map<string, Map<string, number>>, typeGraph: Map<string, Set<string>>, exportTypeRefs?: string[]): DomainAssignment[];
+/**
+ * Get co-usage data for a specific file
+ */
+export declare function getCoUsageData(file: string, coUsageMatrix: Map<string, Map<string, number>>): CoUsageData;
+/**
+ * Find files that should be consolidated based on semantic similarity
+ *
+ * High co-usage + shared types = strong consolidation candidate
+ */
+export declare function findConsolidationCandidates(graph: DependencyGraph, coUsageMatrix: Map<string, Map<string, number>>, typeGraph: Map<string, Set<string>>, minCoUsage?: number, minSharedTypes?: number): Array<{
+    files: string[];
+    reason: string;
+    strength: number;
+}>;
+//# sourceMappingURL=semantic-analysis.d.ts.map

package/dist/semantic-analysis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-analysis.d.ts","sourceRoot":"","sources":["../src/semantic-analysis.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,WAAW,EAAkB,gBAAgB,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAE7G;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,eAAe,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAgC3F;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,eAAe,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAiB/E;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC/C,UAAU,GAAE,MAAU,GACrB,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CA0BvB;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,EAAE,aAAa,GAAG,MAAM,CAiBxE;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,CACtC,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,MAAM,EAClB,KAAK,EAAE,eAAe,EACtB,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC/C,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,EACnC,cAAc,CAAC,EAAE,MAAM,EAAE,GACxB,gBAAgB,EAAE,CA2EpB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,MAAM,EACZ,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAC9C,WAAW,CAYb;AAED;;;;GAIG;AACH,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,eAAe,EACtB,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC/C,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,EACnC,UAAU,GAAE,MAAU,EACtB,cAAc,GAAE,MAAU,GACzB,KAAK,CAAC;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,CA2C9D"}

package/dist/semantic-analysis.js

@@ -0,0 +1,241 @@
+/**
+ * Build co-usage matrix: track which files are imported together
+ *
+ * Files frequently imported together likely belong to the same semantic domain
+ */
+export function buildCoUsageMatrix(graph) {
+    const coUsageMatrix = new Map();
+    // For each file, track which other files are imported alongside it
+    for (const [sourceFile, node] of graph.nodes) {
+        const imports = node.imports;
+        // For each pair of imports in this file, increment their co-usage count
+        for (let i = 0; i < imports.length; i++) {
+            const fileA = imports[i];
+            if (!coUsageMatrix.has(fileA)) {
+                coUsageMatrix.set(fileA, new Map());
+            }
+            for (let j = i + 1; j < imports.length; j++) {
+                const fileB = imports[j];
+                // Increment bidirectional co-usage count
+                const fileAUsage = coUsageMatrix.get(fileA);
+                fileAUsage.set(fileB, (fileAUsage.get(fileB) || 0) + 1);
+                if (!coUsageMatrix.has(fileB)) {
+                    coUsageMatrix.set(fileB, new Map());
+                }
+                const fileBUsage = coUsageMatrix.get(fileB);
+                fileBUsage.set(fileA, (fileBUsage.get(fileA) || 0) + 1);
+            }
+        }
+    }
+    return coUsageMatrix;
+}
+/**
+ * Extract type dependencies from AST exports
+ *
+ * Files that share types are semantically related
+ */
+export function buildTypeGraph(graph) {
+    const typeGraph = new Map();
+    for (const [file, node] of graph.nodes) {
+        for (const exp of node.exports) {
+            if (exp.typeReferences) {
+                for (const typeRef of exp.typeReferences) {
+                    if (!typeGraph.has(typeRef)) {
+                        typeGraph.set(typeRef, new Set());
+                    }
+                    typeGraph.get(typeRef).add(file);
+                }
+            }
+        }
+    }
+    return typeGraph;
+}
+/**
+ * Find semantic clusters using co-usage patterns
+ *
+ * Files with high co-usage counts belong in the same cluster
+ */
+export function findSemanticClusters(coUsageMatrix, minCoUsage = 3) {
+    const clusters = new Map();
+    const visited = new Set();
+    // Simple clustering: group files with high co-usage
+    for (const [file, coUsages] of coUsageMatrix) {
+        if (visited.has(file))
+            continue;
+        const cluster = [file];
+        visited.add(file);
+        // Find strongly related files (co-imported >= minCoUsage times)
+        for (const [relatedFile, count] of coUsages) {
+            if (count >= minCoUsage && !visited.has(relatedFile)) {
+                cluster.push(relatedFile);
+                visited.add(relatedFile);
+            }
+        }
+        if (cluster.length > 1) {
+            // Use first file as cluster ID
+            clusters.set(file, cluster);
+        }
+    }
+    return clusters;
+}
+/**
+ * Calculate confidence score for domain assignment based on multiple signals
+ */
+export function calculateDomainConfidence(signals) {
+    const weights = {
+        coUsage: 0.35, // Strongest signal: actual usage patterns
+        typeReference: 0.30, // Strong signal: shared types
+        exportName: 0.15, // Medium signal: identifier semantics
+        importPath: 0.10, // Weaker signal: path structure
+        folderStructure: 0.10 // Weakest signal: organization convention
+    };
+    let confidence = 0;
+    if (signals.coUsage)
+        confidence += weights.coUsage;
+    if (signals.typeReference)
+        confidence += weights.typeReference;
+    if (signals.exportName)
+        confidence += weights.exportName;
+    if (signals.importPath)
+        confidence += weights.importPath;
+    if (signals.folderStructure)
+        confidence += weights.folderStructure;
+    return confidence;
+}
+/**
+ * Infer domain from semantic analysis (co-usage + types)
+ *
+ * This replaces the folder-based heuristic with actual code relationships
+ */
+export function inferDomainFromSemantics(file, exportName, graph, coUsageMatrix, typeGraph, exportTypeRefs) {
+    const assignments = [];
+    const domainSignals = new Map();
+    // 1. Check co-usage patterns
+    const coUsages = coUsageMatrix.get(file) || new Map();
+    const strongCoUsages = Array.from(coUsages.entries())
+        .filter(([_, count]) => count >= 3)
+        .map(([coFile]) => coFile);
+    // Extract domains from frequently co-imported files
+    for (const coFile of strongCoUsages) {
+        const coNode = graph.nodes.get(coFile);
+        if (coNode) {
+            for (const exp of coNode.exports) {
+                if (exp.inferredDomain && exp.inferredDomain !== 'unknown') {
+                    const domain = exp.inferredDomain;
+                    if (!domainSignals.has(domain)) {
+                        domainSignals.set(domain, {
+                            coUsage: false,
+                            typeReference: false,
+                            exportName: false,
+                            importPath: false,
+                            folderStructure: false
+                        });
+                    }
+                    domainSignals.get(domain).coUsage = true;
+                }
+            }
+        }
+    }
+    // 2. Check type references
+    if (exportTypeRefs) {
+        for (const typeRef of exportTypeRefs) {
+            const filesWithType = typeGraph.get(typeRef);
+            if (filesWithType) {
+                for (const typeFile of filesWithType) {
+                    if (typeFile !== file) {
+                        const typeNode = graph.nodes.get(typeFile);
+                        if (typeNode) {
+                            for (const exp of typeNode.exports) {
+                                if (exp.inferredDomain && exp.inferredDomain !== 'unknown') {
+                                    const domain = exp.inferredDomain;
+                                    if (!domainSignals.has(domain)) {
+                                        domainSignals.set(domain, {
+                                            coUsage: false,
+                                            typeReference: false,
+                                            exportName: false,
+                                            importPath: false,
+                                            folderStructure: false
+                                        });
+                                    }
+                                    domainSignals.get(domain).typeReference = true;
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+    // 3. Build domain assignments with confidence scores
+    for (const [domain, signals] of domainSignals) {
+        const confidence = calculateDomainConfidence(signals);
+        if (confidence >= 0.3) { // Minimum confidence threshold
+            assignments.push({ domain, confidence, signals });
+        }
+    }
+    // Sort by confidence (highest first)
+    assignments.sort((a, b) => b.confidence - a.confidence);
+    return assignments;
+}
+/**
+ * Get co-usage data for a specific file
+ */
+export function getCoUsageData(file, coUsageMatrix) {
+    const coImportedWith = coUsageMatrix.get(file) || new Map();
+    // Find files that import both this file and others
+    const sharedImporters = [];
+    // This would require inverse mapping from imports, simplified for now
+    return {
+        file,
+        coImportedWith,
+        sharedImporters
+    };
+}
+/**
+ * Find files that should be consolidated based on semantic similarity
+ *
+ * High co-usage + shared types = strong consolidation candidate
+ */
+export function findConsolidationCandidates(graph, coUsageMatrix, typeGraph, minCoUsage = 5, minSharedTypes = 2) {
+    const candidates = [];
+    // Find file pairs with both high co-usage AND shared types
+    for (const [fileA, coUsages] of coUsageMatrix) {
+        const nodeA = graph.nodes.get(fileA);
+        if (!nodeA)
+            continue;
+        for (const [fileB, coUsageCount] of coUsages) {
+            if (fileB <= fileA)
+                continue; // Avoid duplicates
+            if (coUsageCount < minCoUsage)
+                continue;
+            const nodeB = graph.nodes.get(fileB);
+            if (!nodeB)
+                continue;
+            // Count shared types
+            const typesA = new Set(nodeA.exports.flatMap(e => e.typeReferences || []));
+            const typesB = new Set(nodeB.exports.flatMap(e => e.typeReferences || []));
+            const sharedTypes = Array.from(typesA).filter(t => typesB.has(t));
+            if (sharedTypes.length >= minSharedTypes) {
+                const strength = (coUsageCount / 10) + (sharedTypes.length / 5);
+                candidates.push({
+                    files: [fileA, fileB],
+                    reason: `High co-usage (${coUsageCount}x) and ${sharedTypes.length} shared types`,
+                    strength
+                });
+            }
+            else if (coUsageCount >= minCoUsage * 2) {
+                // Very high co-usage alone is enough
+                const strength = coUsageCount / 10;
+                candidates.push({
+                    files: [fileA, fileB],
+                    reason: `Very high co-usage (${coUsageCount}x)`,
+                    strength
+                });
+            }
+        }
+    }
+    // Sort by strength (highest first)
+    candidates.sort((a, b) => b.strength - a.strength);
+    return candidates;
+}
+//# sourceMappingURL=semantic-analysis.js.map

package/dist/semantic-analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-analysis.js","sourceRoot":"","sources":["../src/semantic-analysis.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAsB;IACvD,MAAM,aAAa,GAAG,IAAI,GAAG,EAA+B,CAAC;IAE7D,mEAAmE;IACnE,KAAK,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAE7B,wEAAwE;QACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAEzB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACtC,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAEzB,yCAAyC;gBACzC,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;gBAC7C,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAExD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC9B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACtC,CAAC;gBACD,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;gBAC7C,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAsB;IACnD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEjD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/B,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC;gBACvB,KAAK,MAAM,OAAO,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC;oBACzC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;wBAC5B,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBACpC,CAAC;oBACD,SAAS,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,aAA+C,EAC/C,aAAqB,CAAC;IAEtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,oDAAoD;IACpD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;QAC7C,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAEhC,MAAM,OAAO,GAAa,CAAC,IAAI,CAAC,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAElB,gEAAgE;QAChE,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC5C,IAAI,KAAK,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBACrD,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,+BAA+B;YAC/B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,OAAsB;IAC9D,MAAM,OAAO,GAAG;QACd,OAAO,EAAE,IAAI,EAAS,0CAA0C;QAChE,aAAa,EAAE,IAAI,EAAI,8BAA8B;QACrD,UAAU,EAAE,IAAI,EAAO,sCAAsC;QAC7D,UAAU,EAAE,IAAI,EAAO,gCAAgC;QACvD,eAAe,EAAE,IAAI,CAAE,0CAA0C;KAClE,CAAC;IAEF,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,OAAO,CAAC,OAAO;QAAE,UAAU,IAAI,OAAO,CAAC,OAAO,CAAC;IACnD,IAAI,OAAO,CAAC,aAAa;QAAE,UAAU,IAAI,OAAO,CAAC,aAAa,CAAC;IAC/D,IAAI,OAAO,CAAC,UAAU;QAAE,UAAU,IAAI,OAAO,CAAC,UAAU,CAAC;IACzD,IAAI,OAAO,CAAC,UAAU;QAAE,UAAU,IAAI,OAAO,CAAC,UAAU,CAAC;IACzD,IAAI,OAAO,CAAC,eAAe;QAAE,UAAU,IAAI,OAAO,CAAC,eAAe,CAAC;IAEnE,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAY,EACZ,UAAkB,EAClB,KAAsB,EACtB,aAA+C,EAC/C,SAAmC,EACnC,cAAyB;IAEzB,MAAM,WAAW,GAAuB,EAAE,CAAC;IAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEvD,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IACtD,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;SAClD,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC;SAClC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IAE7B,oDAAoD;IACpD,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACjC,IAAI,GAAG,CAAC,cAAc,IAAI,GAAG,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;oBAC3D,MAAM,MAAM,GAAG,GAAG,CAAC,cAAc,CAAC;oBAClC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC/B,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE;4BACxB,OAAO,EAAE,KAAK;4BACd,aAAa,EAAE,KAAK;4BACpB,UAAU,EAAE,KAAK;4BACjB,UAAU,EAAE,KAAK;4BACjB,eAAe,EAAE,KAAK;yBACvB,CAAC,CAAC;oBACL,CAAC;oBACD,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,OAAO,GAAG,IAAI,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,IAAI,cAAc,EAAE,CAAC;QACnB,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;YACrC,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC7C,IAAI,aAAa,EAAE,CAAC;gBAClB,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;oBACrC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;wBACtB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBAC3C,IAAI,QAAQ,EAAE,CAAC;4BACb,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gCACnC,IAAI,GAAG,CAAC,cAAc,IAAI,GAAG,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;oCAC3D,MAAM,MAAM,GAAG,GAAG,CAAC,cAAc,CAAC;oCAClC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wCAC/B,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE;4CACxB,OAAO,EAAE,KAAK;4CACd,aAAa,EAAE,KAAK;4CACpB,UAAU,EAAE,KAAK;4CACjB,UAAU,EAAE,KAAK;4CACjB,eAAe,EAAE,KAAK;yCACvB,CAAC,CAAC;oCACL,CAAC;oCACD,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,aAAa,GAAG,IAAI,CAAC;gCAClD,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9C,MAAM,UAAU,GAAG,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACtD,IAAI,UAAU,IAAI,GAAG,EAAE,CAAC,CAAC,+BAA+B;YACtD,WAAW,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAExD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAY,EACZ,aAA+C;IAE/C,MAAM,cAAc,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAE5D,mDAAmD;IACnD,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,sEAAsE;IAEtE,OAAO;QACL,IAAI;QACJ,cAAc;QACd,eAAe;KAChB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAsB,EACtB,aAA+C,EAC/C,SAAmC,EACnC,aAAqB,CAAC,EACtB,iBAAyB,CAAC;IAE1B,MAAM,UAAU,GAAiE,EAAE,CAAC;IAEpF,2DAA2D;IAC3D,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,KAAK,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC7C,IAAI,KAAK,IAAI,KAAK;gBAAE,SAAS,CAAC,mBAAmB;YACjD,IAAI,YAAY,GAAG,UAAU;gBAAE,SAAS;YAExC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,qBAAqB;YACrB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,CAAC;YAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,CAAC;YAC3E,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAElE,IAAI,WAAW,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;gBACzC,MAAM,QAAQ,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAChE,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;oBACrB,MAAM,EAAE,kBAAkB,YAAY,UAAU,WAAW,CAAC,MAAM,eAAe;oBACjF,QAAQ;iBACT,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,YAAY,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBAC1C,qCAAqC;gBACrC,MAAM,QAAQ,GAAG,YAAY,GAAG,EAAE,CAAC;gBACnC,UAAU,CAAC,IAAI,CAAC;oBACd,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;oBACrB,MAAM,EAAE,uBAAuB,YAAY,IAAI;oBAC/C,QAAQ;iBACT,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,mCAAmC;IACnC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAEnD,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,117 @@
+import type { ScanOptions } from '@aiready/core';
+export interface ContextAnalyzerOptions extends ScanOptions {
+    maxDepth?: number;
+    maxContextBudget?: number;
+    minCohesion?: number;
+    maxFragmentation?: number;
+    focus?: 'fragmentation' | 'cohesion' | 'depth' | 'all';
+    includeNodeModules?: boolean;
+}
+export interface ContextAnalysisResult {
+    file: string;
+    tokenCost: number;
+    linesOfCode: number;
+    importDepth: number;
+    dependencyCount: number;
+    dependencyList: string[];
+    circularDeps: string[][];
+    cohesionScore: number;
+    domains: string[];
+    exportCount: number;
+    contextBudget: number;
+    fragmentationScore: number;
+    relatedFiles: string[];
+    severity: 'critical' | 'major' | 'minor' | 'info';
+    issues: string[];
+    recommendations: string[];
+    potentialSavings: number;
+}
+export interface ModuleCluster {
+    domain: string;
+    files: string[];
+    totalTokens: number;
+    fragmentationScore: number;
+    pathEntropy?: number;
+    directoryDistance?: number;
+    importCohesion?: number;
+    avgCohesion: number;
+    suggestedStructure: {
+        targetFiles: number;
+        consolidationPlan: string[];
+    };
+}
+export interface ContextSummary {
+    totalFiles: number;
+    totalTokens: number;
+    avgContextBudget: number;
+    maxContextBudget: number;
+    avgImportDepth: number;
+    maxImportDepth: number;
+    deepFiles: Array<{
+        file: string;
+        depth: number;
+    }>;
+    avgFragmentation: number;
+    fragmentedModules: ModuleCluster[];
+    avgCohesion: number;
+    lowCohesionFiles: Array<{
+        file: string;
+        score: number;
+    }>;
+    criticalIssues: number;
+    majorIssues: number;
+    minorIssues: number;
+    totalPotentialSavings: number;
+    topExpensiveFiles: Array<{
+        file: string;
+        contextBudget: number;
+        severity: string;
+    }>;
+}
+export interface DependencyGraph {
+    nodes: Map<string, DependencyNode>;
+    edges: Map<string, Set<string>>;
+    coUsageMatrix?: Map<string, Map<string, number>>;
+    typeGraph?: Map<string, Set<string>>;
+}
+export interface DependencyNode {
+    file: string;
+    imports: string[];
+    exports: ExportInfo[];
+    tokenCost: number;
+    linesOfCode: number;
+    exportedBy?: string[];
+    sharedTypes?: string[];
+}
+export interface ExportInfo {
+    name: string;
+    type: 'function' | 'class' | 'const' | 'type' | 'interface' | 'default';
+    inferredDomain?: string;
+    domains?: DomainAssignment[];
+    imports?: string[];
+    dependencies?: string[];
+    typeReferences?: string[];
+}
+export interface DomainAssignment {
+    domain: string;
+    confidence: number;
+    signals: DomainSignals;
+}
+export interface DomainSignals {
+    folderStructure: boolean;
+    importPath: boolean;
+    typeReference: boolean;
+    coUsage: boolean;
+    exportName: boolean;
+}
+export interface CoUsageData {
+    file: string;
+    coImportedWith: Map<string, number>;
+    sharedImporters: string[];
+}
+export interface TypeDependency {
+    typeName: string;
+    definedIn: string;
+    usedBy: string[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEjD,MAAM,WAAW,sBAAuB,SAAQ,WAAW;IACzD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,KAAK,CAAC,EAAE,eAAe,GAAG,UAAU,GAAG,OAAO,GAAG,KAAK,CAAC;IACvD,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED,MAAM,WAAW,qBAAqB;IACpC,IAAI,EAAE,MAAM,CAAC;IAGb,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IAGpB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,YAAY,EAAE,MAAM,EAAE,EAAE,CAAC;IAGzB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IAGpB,aAAa,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,YAAY,EAAE,MAAM,EAAE,CAAC;IAGvB,QAAQ,EAAE,UAAU,GAAG,OAAO,GAAG,OAAO,GAAG,MAAM,CAAC;IAClD,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,kBAAkB,EAAE;QAClB,WAAW,EAAE,MAAM,CAAC;QACpB,iBAAiB,EAAE,MAAM,EAAE,CAAC;KAC7B,CAAC;CACH;AAED,MAAM,WAAW,cAAc;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,gBAAgB,EAAE,MAAM,CAAC;IAGzB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAGlD,gBAAgB,EAAE,MAAM,CAAC;IACzB,iBAAiB,EAAE,aAAa,EAAE,CAAC;IAGnC,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAGzD,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,qBAAqB,EAAE,MAAM,CAAC;IAG9B,iBAAiB,EAAE,KAAK,CAAC;QACvB,IAAI,EAAE,MAAM,CAAC;QACb,aAAa,EAAE,MAAM,CAAC;QACtB,QAAQ,EAAE,MAAM,CAAC;KAClB,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IACnC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAChC,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACjD,SAAS,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;CACtC;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,GAAG,OAAO,GAAG,OAAO,GAAG,MAAM,GAAG,WAAW,GAAG,SAAS,CAAC;IACxE,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,OAAO,CAAC,EAAE,gBAAgB,EAAE,CAAC;IAC7B,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;CAC3B;AAED,MAAM,WAAW,gBAAgB;IAC/B,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,aAAa,CAAC;CACxB;AAED,MAAM,WAAW,aAAa;IAC5B,eAAe,EAAE,OAAO,CAAC;IACzB,UAAU,EAAE,OAAO,CAAC;IACpB,aAAa,EAAE,OAAO,CAAC;IACvB,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,EAAE,OAAO,CAAC;CACrB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB"}

package/dist/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

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

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@aiready/context-analyzer",
-  "version": "0.9.4",
+  "version": "0.9.6",
   "description": "AI context window cost analysis - detect fragmented code, deep import chains, and expensive context budgets",
   "main": "./dist/index.js",
   "module": "./dist/index.mjs",
@@ -49,7 +49,7 @@
     "commander": "^14.0.0",
     "chalk": "^5.3.0",
     "prompts": "^2.4.2",
-    "@aiready/core": "0.9.4"
+    "@aiready/core": "0.9.6"
   },
   "devDependencies": {
     "@types/node": "^24.0.0",

package/src/__tests__/fragmentation-advanced.test.ts

@@ -0,0 +1,60 @@
+import { describe, it, expect } from 'vitest';
+import {
+  calculatePathEntropy,
+  calculateDirectoryDistance,
+} from '../analyzer';
+
+describe('advanced fragmentation heuristics', () => {
+  it('path entropy is low when most files are in one directory', () => {
+    const files = [
+      'src/billing/a.ts',
+      'src/billing/b.ts',
+      'src/billing/c.ts',
+      'src/billing/d.ts',
+      'src/billing/e.ts',
+      'src/billing/f.ts',
+      'src/billing/g.ts',
+      'src/billing/h.ts',
+      'src/billing/i.ts',
+      'src/other/x.ts',
+    ];
+
+    const entropy = calculatePathEntropy(files);
+    // 9 in one folder and 1 in another should yield low entropy (< 0.5)
+    expect(entropy).toBeLessThan(0.5);
+  });
+
+  it('path entropy is high when files are evenly distributed', () => {
+    const files = [
+      'a/f1.ts',
+      'b/f2.ts',
+      'c/f3.ts',
+      'd/f4.ts',
+      'e/f5.ts',
+    ];
+
+    const entropy = calculatePathEntropy(files);
+    expect(entropy).toBeGreaterThan(0.8);
+  });
+
+  it('directory distance is low for sibling files and high for scattered files', () => {
+    const siblings = [
+      'src/auth/ui/button.ts',
+      'src/auth/ui/input.ts',
+      'src/auth/ui/modal.ts',
+    ];
+
+    const scattered = [
+      'src/auth/ui/button.ts',
+      'src/payments/api/charge.ts',
+      'lib/analytics/track.ts',
+    ];
+
+    const distSiblings = calculateDirectoryDistance(siblings);
+    const distScattered = calculateDirectoryDistance(scattered);
+
+    expect(distSiblings).toBeLessThan(distScattered);
+    expect(distSiblings).toBeLessThan(0.5);
+    expect(distScattered).toBeGreaterThan(0.6);
+  });
+});