@phuetz/code-buddy 0.3.0 → 1.0.0-rc.8

package/dist/knowledge/code-graph-deep-populator.js

@@ -0,0 +1,296 @@
+/**
+ * Code Graph Deep Populator
+ *
+ * Enriches the KnowledgeGraph with:
+ *   - Class hierarchy (extends / implements)
+ *   - Class → method containment
+ *   - Function/method → function/method call edges
+ *
+ * Multi-language: delegates to per-language regex scanners.
+ * Supported: TypeScript/JavaScript, Python, Go, Rust, Java.
+ * Designed for on-demand use (deep: true), not at startup.
+ * Performance target: <5s for ~1300 source files.
+ */
+import fs from 'fs';
+import path from 'path';
+import { logger } from '../utils/logger.js';
+import { getScannerForExt, getSupportedExtensions } from './scanners/index.js';
+// ============================================================================
+// Constants
+// ============================================================================
+const SKIP_DIRS = new Set([
+    'node_modules', 'dist', 'build', '.git', 'coverage', '.next', '__pycache__',
+    'target', '.cache', '.codebuddy', '.turbo', 'vendor', 'venv', '.venv', 'out',
+    'test', 'tests', '__tests__', '__mocks__', 'fixtures', 'e2e',
+]);
+const SOURCE_EXTS = getSupportedExtensions();
+/** Max file size to scan (skip huge generated files) */
+const MAX_FILE_SIZE = 200_000; // 200KB
+/** Language-aware test file detection */
+function isTestFile(name) {
+    // TS/JS: foo.test.ts, foo.spec.ts, foo._test.ts
+    if (/\.(test|spec|_test)\./i.test(name))
+        return true;
+    // Go: foo_test.go
+    if (name.endsWith('_test.go'))
+        return true;
+    // Python: test_foo.py, foo_test.py
+    if (name.endsWith('.py') && (name.startsWith('test_') || name.endsWith('_test.py')))
+        return true;
+    // Rust: foo_test.rs (convention, though Rust uses inline #[cfg(test)])
+    if (name.endsWith('_test.rs'))
+        return true;
+    // Java: FooTest.java, FooTests.java
+    if (/Tests?\.java$/i.test(name))
+        return true;
+    return false;
+}
+// ============================================================================
+// Main entry point
+// ============================================================================
+/**
+ * Deep-populate the code graph with class hierarchy and call graph.
+ * Scans source files via per-language regex scanners — no AST parser dependency.
+ *
+ * @returns Number of triples added
+ */
+export function populateDeepCodeGraph(graph, cwd, srcDirs) {
+    const before = graph.getStats().tripleCount;
+    const startTime = Date.now();
+    // 1. Discover source files
+    const dirs = srcDirs ?? detectSrcDirs(cwd);
+    const files = walkSourceFiles(cwd, dirs);
+    // 2. First pass: extract all symbol definitions via language-specific scanners
+    const allSymbols = [];
+    const allCalls = [];
+    const allInheritance = [];
+    const symbolsByName = new Map();
+    for (const file of files) {
+        const content = readFileSafe(file.fullPath);
+        if (!content)
+            continue;
+        const ext = path.extname(file.relPath).toLowerCase();
+        const scanner = getScannerForExt(ext);
+        if (!scanner)
+            continue;
+        const moduleId = file.relPath.replace(/\.[^.]+$/, '');
+        const { symbols, calls, inheritance } = scanner.scanFile(content, moduleId);
+        for (const sym of symbols) {
+            allSymbols.push(sym);
+            const list = symbolsByName.get(sym.name) ?? [];
+            list.push(sym);
+            symbolsByName.set(sym.name, list);
+        }
+        allCalls.push(...calls);
+        allInheritance.push(...inheritance);
+    }
+    // 3. Populate class hierarchy + module → function containment
+    for (const sym of allSymbols) {
+        if (sym.kind === 'class') {
+            graph.add(`cls:${sym.name}`, 'definedIn', `mod:${sym.module}`, {
+                nodeType: 'class',
+                line: String(sym.line),
+            });
+        }
+        if (sym.kind === 'method' && sym.className) {
+            const methodFqn = `fn:${sym.className}.${sym.name}`;
+            const methodMeta = {
+                nodeType: 'method',
+                line: String(sym.line),
+            };
+            if (sym.params)
+                methodMeta.params = sym.params;
+            if (sym.returnType)
+                methodMeta.returnType = sym.returnType;
+            graph.add(`cls:${sym.className}`, 'hasMethod', methodFqn, methodMeta);
+            graph.add(`mod:${sym.module}`, 'containsFunction', methodFqn, {
+                ...methodMeta,
+                className: sym.className,
+            });
+        }
+        if (sym.kind === 'function') {
+            const funcMeta = {
+                nodeType: 'function',
+                line: String(sym.line),
+            };
+            if (sym.params)
+                funcMeta.params = sym.params;
+            if (sym.returnType)
+                funcMeta.returnType = sym.returnType;
+            graph.add(`fn:${sym.name}`, 'definedIn', `mod:${sym.module}`, funcMeta);
+            graph.add(`mod:${sym.module}`, 'containsFunction', `fn:${sym.name}`, funcMeta);
+        }
+    }
+    // 4. Populate extends / implements from scanner-provided inheritance info
+    for (const info of allInheritance) {
+        if (info.extends) {
+            graph.add(`cls:${info.className}`, 'extends', `cls:${info.extends}`);
+        }
+        if (info.implements) {
+            for (const iface of info.implements) {
+                graph.add(`cls:${info.className}`, 'implements', `iface:${iface}`);
+            }
+        }
+    }
+    // 5. Resolve and populate call edges
+    for (const call of allCalls) {
+        const calleeDefs = resolveCall(call, symbolsByName);
+        for (const callee of calleeDefs) {
+            const callerNode = call.callerFqn;
+            const calleeNode = callee.kind === 'method' && callee.className
+                ? `fn:${callee.className}.${callee.name}`
+                : `fn:${callee.name}`;
+            graph.add(callerNode, 'calls', calleeNode);
+        }
+    }
+    // 6. Scan for dynamic imports: await import('./path') → add as import edges
+    const DYNAMIC_IMPORT_RE = /await\s+import\(\s*['"]([^'"]+)['"]\s*\)/g;
+    for (const file of files) {
+        const content = readFileSafe(file.fullPath);
+        if (!content)
+            continue;
+        const moduleId = file.relPath.replace(/\.[^.]+$/, '');
+        const sourceModule = `mod:${moduleId}`;
+        let match;
+        DYNAMIC_IMPORT_RE.lastIndex = 0;
+        while ((match = DYNAMIC_IMPORT_RE.exec(content)) !== null) {
+            const importPath = match[1];
+            if (importPath === undefined)
+                continue;
+            const targetModule = resolveDynamicImport(importPath, moduleId);
+            if (targetModule) {
+                graph.add(sourceModule, 'imports', `mod:${targetModule}`);
+            }
+        }
+    }
+    const elapsed = Date.now() - startTime;
+    const added = graph.getStats().tripleCount - before;
+    logger.debug(`CodeGraphDeep: added ${added} triples in ${elapsed}ms (${files.length} files, ${allSymbols.length} symbols, ${allCalls.length} call sites)`);
+    return added;
+}
+function detectSrcDirs(cwd) {
+    const candidates = ['src', 'lib', 'app', 'server', 'client'];
+    const found = [];
+    for (const c of candidates) {
+        try {
+            if (fs.statSync(path.join(cwd, c)).isDirectory())
+                found.push(c);
+        }
+        catch { /* noop */ }
+    }
+    return found.length > 0 ? found : ['src'];
+}
+function walkSourceFiles(cwd, srcDirs) {
+    const entries = [];
+    function walk(dir, depth) {
+        if (depth > 12)
+            return;
+        let dirents;
+        try {
+            dirents = fs.readdirSync(dir, { withFileTypes: true });
+        }
+        catch {
+            return;
+        }
+        for (const d of dirents) {
+            if (d.isDirectory()) {
+                if (!SKIP_DIRS.has(d.name) && !d.name.startsWith('.')) {
+                    walk(path.join(dir, d.name), depth + 1);
+                }
+                continue;
+            }
+            if (!d.isFile())
+                continue;
+            const ext = path.extname(d.name).toLowerCase();
+            if (!SOURCE_EXTS.has(ext))
+                continue;
+            if (isTestFile(d.name))
+                continue;
+            const fullPath = path.join(dir, d.name);
+            try {
+                if (fs.statSync(fullPath).size > MAX_FILE_SIZE)
+                    continue;
+            }
+            catch {
+                continue;
+            }
+            const relPath = path.relative(cwd, fullPath).replace(/\\/g, '/');
+            entries.push({ relPath, fullPath });
+        }
+    }
+    for (const srcDir of srcDirs) {
+        const abs = path.resolve(cwd, srcDir);
+        if (fs.existsSync(abs))
+            walk(abs, 0);
+    }
+    return entries;
+}
+function readFileSafe(filePath) {
+    try {
+        return fs.readFileSync(filePath, 'utf-8');
+    }
+    catch {
+        return null;
+    }
+}
+// ============================================================================
+// Call resolution
+// ============================================================================
+function resolveCall(call, symbolsByName) {
+    const candidates = symbolsByName.get(call.calleeName);
+    if (!candidates || candidates.length === 0)
+        return [];
+    // If it's a method call with a known receiver class, prefer that class's method
+    if (call.isMethodCall && call.receiverClass) {
+        const classMethod = candidates.find(c => c.kind === 'method' && c.className === call.receiverClass);
+        if (classMethod)
+            return [classMethod];
+    }
+    // For non-method calls, prefer functions over methods
+    if (!call.isMethodCall) {
+        const functions = candidates.filter(c => c.kind === 'function');
+        if (functions.length === 1)
+            return functions;
+        if (functions.length > 1) {
+            const first = functions[0];
+            if (first !== undefined)
+                return [first];
+        }
+    }
+    // Fallback: return first candidate if unique
+    if (candidates.length === 1)
+        return candidates;
+    return [];
+}
+// ============================================================================
+// Dynamic import resolution
+// ============================================================================
+/**
+ * Resolve a dynamic import path to a module ID.
+ * Handles relative paths (./foo.js → dir/foo) and strips extensions.
+ * Skips non-relative imports (npm packages).
+ */
+function resolveDynamicImport(importPath, sourceModule) {
+    // Only resolve relative imports
+    if (!importPath.startsWith('.'))
+        return null;
+    // Strip .js/.ts/.mjs extensions
+    const stripped = importPath.replace(/\.[cm]?[jt]sx?$/, '');
+    // Resolve relative to source module's directory
+    const sourceDir = sourceModule.includes('/')
+        ? sourceModule.substring(0, sourceModule.lastIndexOf('/'))
+        : '';
+    // Simple path.join equivalent for forward-slash paths
+    const parts = (sourceDir ? `${sourceDir}/${stripped}` : stripped).split('/');
+    const resolved = [];
+    for (const part of parts) {
+        if (part === '..') {
+            resolved.pop();
+        }
+        else if (part !== '.') {
+            resolved.push(part);
+        }
+    }
+    return resolved.join('/');
+}
+//# sourceMappingURL=code-graph-deep-populator.js.map

package/dist/knowledge/code-graph-deep-populator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-graph-deep-populator.js","sourceRoot":"","sources":["../../src/knowledge/code-graph-deep-populator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,IAAI,MAAM,MAAM,CAAC;AAExB,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAG/E,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,cAAc,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,aAAa;IAC3E,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;IAC5E,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,KAAK;CAC7D,CAAC,CAAC;AAEH,MAAM,WAAW,GAAG,sBAAsB,EAAE,CAAC;AAE7C,wDAAwD;AACxD,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,QAAQ;AAEvC,yCAAyC;AACzC,SAAS,UAAU,CAAC,IAAY;IAC9B,gDAAgD;IAChD,IAAI,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACrD,kBAAkB;IAClB,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3C,mCAAmC;IACnC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACjG,uEAAuE;IACvE,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3C,oCAAoC;IACpC,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAqB,EACrB,GAAW,EACX,OAAkB;IAElB,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,WAAW,CAAC;IAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE7B,2BAA2B;IAC3B,MAAM,IAAI,GAAG,OAAO,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAEzC,+EAA+E;IAC/E,MAAM,UAAU,GAAgB,EAAE,CAAC;IACnC,MAAM,QAAQ,GAAe,EAAE,CAAC;IAChC,MAAM,cAAc,GAAsB,EAAE,CAAC;IAC7C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IAErD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QACtD,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAE5E,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC/C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;QACxB,cAAc,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;IACtC,CAAC;IAED,8DAA8D;IAC9D,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,IAAI,EAAE,EAAE,WAAW,EAAE,OAAO,GAAG,CAAC,MAAM,EAAE,EAAE;gBAC7D,QAAQ,EAAE,OAAO;gBACjB,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;aACvB,CAAC,CAAC;QACL,CAAC;QACD,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;YACpD,MAAM,UAAU,GAA2B;gBACzC,QAAQ,EAAE,QAAQ;gBAClB,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;aACvB,CAAC;YACF,IAAI,GAAG,CAAC,MAAM;gBAAE,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;YAC/C,IAAI,GAAG,CAAC,UAAU;gBAAE,UAAU,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;YAE3D,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;YACtE,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,MAAM,EAAE,EAAE,kBAAkB,EAAE,SAAS,EAAE;gBAC5D,GAAG,UAAU;gBACb,SAAS,EAAE,GAAG,CAAC,SAAS;aACzB,CAAC,CAAC;QACL,CAAC;QACD,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAA2B;gBACvC,QAAQ,EAAE,UAAU;gBACpB,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;aACvB,CAAC;YACF,IAAI,GAAG,CAAC,MAAM;gBAAE,QAAQ,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;YAC7C,IAAI,GAAG,CAAC,UAAU;gBAAE,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;YAEzD,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,EAAE,WAAW,EAAE,OAAO,GAAG,CAAC,MAAM,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxE,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,MAAM,EAAE,EAAE,kBAAkB,EAAE,MAAM,GAAG,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,KAAK,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACpC,KAAK,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,YAAY,EAAE,SAAS,KAAK,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACpD,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;YAChC,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC;YAClC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS;gBAC7D,CAAC,CAAC,MAAM,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,IAAI,EAAE;gBACzC,CAAC,CAAC,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC;YAExB,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,MAAM,iBAAiB,GAAG,2CAA2C,CAAC;IACtE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QACtD,MAAM,YAAY,GAAG,OAAO,QAAQ,EAAE,CAAC;QAEvC,IAAI,KAA6B,CAAC;QAClC,iBAAiB,CAAC,SAAS,GAAG,CAAC,CAAC;QAChC,OAAO,CAAC,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAC1D,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,UAAU,KAAK,SAAS;gBAAE,SAAS;YACvC,MAAM,YAAY,GAAG,oBAAoB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YAChE,IAAI,YAAY,EAAE,CAAC;gBACjB,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,YAAY,EAAE,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IACvC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,WAAW,GAAG,MAAM,CAAC;IACpD,MAAM,CAAC,KAAK,CAAC,wBAAwB,KAAK,eAAe,OAAO,OAAO,KAAK,CAAC,MAAM,WAAW,UAAU,CAAC,MAAM,aAAa,QAAQ,CAAC,MAAM,cAAc,CAAC,CAAC;IAC3J,OAAO,KAAK,CAAC;AACf,CAAC;AAWD,SAAS,aAAa,CAAC,GAAW;IAChC,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC;YACH,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;QAAC,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAC5C,CAAC;AAED,SAAS,eAAe,CAAC,GAAW,EAAE,OAAiB;IACrD,MAAM,OAAO,GAAgB,EAAE,CAAC;IAEhC,SAAS,IAAI,CAAC,GAAW,EAAE,KAAa;QACtC,IAAI,KAAK,GAAG,EAAE;YAAE,OAAO;QACvB,IAAI,OAAoB,CAAC;QACzB,IAAI,CAAC;YACH,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QACzD,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO;QAAC,CAAC;QAEnB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;gBACpB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC1C,CAAC;gBACD,SAAS;YACX,CAAC;YACD,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE;gBAAE,SAAS;YAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;YAC/C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YACpC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,SAAS;YAEjC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC;gBACH,IAAI,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,GAAG,aAAa;oBAAE,SAAS;YAC3D,CAAC;YAAC,MAAM,CAAC;gBAAC,SAAS;YAAC,CAAC;YAErB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACjE,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACtC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,YAAY,CAAC,QAAgB;IACpC,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC5C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,kBAAkB;AAClB,+EAA+E;AAE/E,SAAS,WAAW,CAClB,IAAc,EACd,aAAuC;IAEvC,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACtD,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtD,gFAAgF;IAChF,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QAC5C,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,aAAa,CAC/D,CAAC;QACF,IAAI,WAAW;YAAE,OAAO,CAAC,WAAW,CAAC,CAAC;IACxC,CAAC;IAED,sDAAsD;IACtD,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;QAChE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC;IAE/C,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,+EAA+E;AAC/E,4BAA4B;AAC5B,+EAA+E;AAE/E;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,UAAkB,EAAE,YAAoB;IACpE,gCAAgC;IAChC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE7C,gCAAgC;IAChC,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;IAE3D,gDAAgD;IAChD,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC;QAC1C,CAAC,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC,CAAC,EAAE,CAAC;IAEP,sDAAsD;IACtD,MAAM,KAAK,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7E,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,QAAQ,CAAC,GAAG,EAAE,CAAC;QACjB,CAAC;aAAM,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACxB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC5B,CAAC"}

package/dist/knowledge/code-graph-persistence.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Code Graph Persistence
+ *
+ * Save/load the KnowledgeGraph to `.codebuddy/code-graph.json`.
+ * Lazy loading: graph is loaded on first access, not at startup.
+ */
+import { KnowledgeGraph } from './knowledge-graph.js';
+/**
+ * Save the knowledge graph to disk.
+ */
+export declare function saveCodeGraph(graph: KnowledgeGraph, cwd: string): void;
+/**
+ * Load the knowledge graph from disk into the given graph instance.
+ * Returns true if loaded successfully, false otherwise.
+ */
+export declare function loadCodeGraph(graph: KnowledgeGraph, cwd: string): boolean;
+/**
+ * Check if the code graph file exists.
+ */
+export declare function codeGraphExists(cwd: string): boolean;

package/dist/knowledge/code-graph-persistence.js

@@ -0,0 +1,72 @@
+/**
+ * Code Graph Persistence
+ *
+ * Save/load the KnowledgeGraph to `.codebuddy/code-graph.json`.
+ * Lazy loading: graph is loaded on first access, not at startup.
+ */
+import fs from 'fs';
+import path from 'path';
+import { logger } from '../utils/logger.js';
+const CODE_GRAPH_FILENAME = '.codebuddy/code-graph.json';
+/**
+ * Save the knowledge graph to disk.
+ */
+export function saveCodeGraph(graph, cwd) {
+    const filePath = path.join(cwd, CODE_GRAPH_FILENAME);
+    const dir = path.dirname(filePath);
+    try {
+        if (!fs.existsSync(dir)) {
+            fs.mkdirSync(dir, { recursive: true });
+        }
+        const data = {
+            version: 1,
+            buildTime: new Date().toISOString(),
+            tripleCount: graph.getStats().tripleCount,
+            triples: graph.toJSON(),
+        };
+        // Atomic write: write to temp file then rename to prevent corruption
+        const tmpPath = filePath + '.tmp';
+        fs.writeFileSync(tmpPath, JSON.stringify(data));
+        fs.renameSync(tmpPath, filePath);
+        logger.debug(`CodeGraph: saved ${data.tripleCount} triples to ${CODE_GRAPH_FILENAME}`);
+    }
+    catch (err) {
+        logger.debug('CodeGraph: failed to save', { err });
+    }
+}
+/**
+ * Load the knowledge graph from disk into the given graph instance.
+ * Returns true if loaded successfully, false otherwise.
+ */
+export function loadCodeGraph(graph, cwd) {
+    const filePath = path.join(cwd, CODE_GRAPH_FILENAME);
+    try {
+        if (!fs.existsSync(filePath))
+            return false;
+        const raw = fs.readFileSync(filePath, 'utf-8');
+        const data = JSON.parse(raw);
+        if (data.version !== 1 || !Array.isArray(data.triples)) {
+            logger.debug('CodeGraph: invalid file format, skipping load');
+            return false;
+        }
+        graph.loadJSON(data.triples);
+        logger.debug(`CodeGraph: loaded ${data.tripleCount} triples from ${CODE_GRAPH_FILENAME}`);
+        return true;
+    }
+    catch (err) {
+        logger.warn('CodeGraph: failed to load (file may be corrupted)', { error: String(err) });
+        // Remove corrupted file so next save creates a clean one
+        try {
+            fs.unlinkSync(filePath);
+        }
+        catch { /* ignore */ }
+        return false;
+    }
+}
+/**
+ * Check if the code graph file exists.
+ */
+export function codeGraphExists(cwd) {
+    return fs.existsSync(path.join(cwd, CODE_GRAPH_FILENAME));
+}
+//# sourceMappingURL=code-graph-persistence.js.map

package/dist/knowledge/code-graph-persistence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-graph-persistence.js","sourceRoot":"","sources":["../../src/knowledge/code-graph-persistence.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,IAAI,MAAM,MAAM,CAAC;AAExB,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C,MAAM,mBAAmB,GAAG,4BAA4B,CAAC;AASzD;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,KAAqB,EAAE,GAAW;IAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,mBAAmB,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAEnC,IAAI,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACzC,CAAC;QAED,MAAM,IAAI,GAAkB;YAC1B,OAAO,EAAE,CAAC;YACV,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,WAAW,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,WAAW;YACzC,OAAO,EAAE,KAAK,CAAC,MAAM,EAAE;SACxB,CAAC;QAEF,qEAAqE;QACrE,MAAM,OAAO,GAAG,QAAQ,GAAG,MAAM,CAAC;QAClC,EAAE,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QAChD,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,oBAAoB,IAAI,CAAC,WAAW,eAAe,mBAAmB,EAAE,CAAC,CAAC;IACzF,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,CAAC,KAAK,CAAC,2BAA2B,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;IACrD,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAqB,EAAE,GAAW;IAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,mBAAmB,CAAC,CAAC;IAErD,IAAI,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC;QAE3C,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAkB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAE5C,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YACvD,MAAM,CAAC,KAAK,CAAC,+CAA+C,CAAC,CAAC;YAC9D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,qBAAqB,IAAI,CAAC,WAAW,iBAAiB,mBAAmB,EAAE,CAAC,CAAC;QAC1F,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,CAAC,IAAI,CAAC,mDAAmD,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzF,yDAAyD;QACzD,IAAI,CAAC;YAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;QACvD,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,OAAO,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,mBAAmB,CAAC,CAAC,CAAC;AAC5D,CAAC"}

package/dist/knowledge/code-graph-populator.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Code Graph Populator
+ *
+ * Converts CartographyResult data into KnowledgeGraph triples.
+ * Population runs after cartography scan — no new file I/O needed.
+ *
+ * Node naming convention:
+ *   mod:src/agent/codebuddy-agent  — Module (file)
+ *   cls:CodeBuddyAgent             — Class
+ *   fn:executePlan                  — Exported function
+ *   iface:ExecutorConfig            — Interface/type
+ *   layer:agent                     — Architecture layer
+ *   pat:singleton                   — Design pattern
+ */
+import { KnowledgeGraph } from './knowledge-graph.js';
+import type { CartographyResult } from '../agent/repo-profiling/cartography.js';
+/**
+ * Populate a KnowledgeGraph from cartography scan results.
+ * Returns the number of triples added.
+ */
+export declare function populateCodeGraph(graph: KnowledgeGraph, carto: CartographyResult): number;

package/dist/knowledge/code-graph-populator.js

@@ -0,0 +1,131 @@
+/**
+ * Code Graph Populator
+ *
+ * Converts CartographyResult data into KnowledgeGraph triples.
+ * Population runs after cartography scan — no new file I/O needed.
+ *
+ * Node naming convention:
+ *   mod:src/agent/codebuddy-agent  — Module (file)
+ *   cls:CodeBuddyAgent             — Class
+ *   fn:executePlan                  — Exported function
+ *   iface:ExecutorConfig            — Interface/type
+ *   layer:agent                     — Architecture layer
+ *   pat:singleton                   — Design pattern
+ */
+import { logger } from '../utils/logger.js';
+/**
+ * Populate a KnowledgeGraph from cartography scan results.
+ * Returns the number of triples added.
+ */
+export function populateCodeGraph(graph, carto) {
+    const before = graph.getStats().tripleCount;
+    // 1. Architecture layers
+    for (const layer of carto.architecture.layers) {
+        graph.add(`layer:${layer.name}`, 'hasDirectory', layer.directory, {
+            nodeType: 'layer',
+            fileCount: String(layer.fileCount),
+        });
+    }
+    // 2. Import edges (full graph)
+    if (carto.importEdges) {
+        for (const [importer, imported] of carto.importEdges) {
+            graph.add(`mod:${importer}`, 'imports', `mod:${imported}`);
+            graph.add(`mod:${imported}`, 'usedBy', `mod:${importer}`);
+        }
+    }
+    // 3. Hot modules (always available, even if importEdges is missing)
+    for (const hot of carto.importGraph.hotModules) {
+        graph.add(`mod:${hot.module}`, 'importCount', String(hot.importedBy), {
+            nodeType: 'module',
+        });
+    }
+    // 4. Components → definedIn triples
+    const components = carto.components;
+    if (components) {
+        addComponentTriples(graph, components.agents, 'agent');
+        addComponentTriples(graph, components.tools, 'tool');
+        addComponentTriples(graph, components.channels, 'channel');
+        addComponentTriples(graph, components.facades, 'facade');
+        for (const mw of components.middlewares) {
+            const file = normalizeModulePath(mw.file);
+            graph.add(`cls:${mw.name}`, 'definedIn', `mod:${file}`, {
+                nodeType: 'middleware',
+                ...(mw.priority != null ? { priority: String(mw.priority) } : {}),
+            });
+        }
+        // 5. Key exports → module exports symbol
+        for (const ke of components.keyExports) {
+            const mod = `mod:${ke.module}`;
+            for (const exp of ke.exports) {
+                // Classify: PascalCase = class, camelCase = function, UPPER_CASE = constant
+                const prefix = classifyExport(exp);
+                graph.add(mod, 'exports', `${prefix}:${exp}`);
+                graph.add(`${prefix}:${exp}`, 'definedIn', mod);
+            }
+        }
+    }
+    // 6. Layer → contains modules (by path convention)
+    for (const layer of carto.architecture.layers) {
+        const layerDir = layer.directory;
+        // Find modules that belong to this layer via import edges or hot modules
+        if (carto.importEdges) {
+            const allMods = new Set();
+            for (const [a, b] of carto.importEdges) {
+                allMods.add(a);
+                allMods.add(b);
+            }
+            for (const mod of allMods) {
+                if (mod.startsWith(layerDir + '/') || mod === layerDir) {
+                    graph.add(`layer:${layer.name}`, 'contains', `mod:${mod}`);
+                    graph.add(`mod:${mod}`, 'belongsTo', `layer:${layer.name}`);
+                }
+            }
+        }
+    }
+    // 7. Design patterns
+    addPatternTriples(graph, carto.patterns.singletons, 'singleton');
+    addPatternTriples(graph, carto.patterns.registries, 'registry');
+    addPatternTriples(graph, carto.patterns.factories, 'factory');
+    addPatternTriples(graph, carto.patterns.facades, 'facade');
+    addPatternTriples(graph, carto.patterns.middlewares, 'middleware');
+    addPatternTriples(graph, carto.patterns.observers, 'observer');
+    // 8. API surface — add metadata to modules with routes
+    for (const route of carto.apiSurface.restRoutes) {
+        const file = normalizeModulePath(route.file);
+        graph.add(`mod:${file}`, 'exposes', `${route.method} ${route.path}`, {
+            nodeType: 'route',
+        });
+    }
+    // 9. Circular dependency warnings
+    for (const circ of carto.importGraph.circularRisks) {
+        graph.add(`mod:${circ.a}`, 'circularWith', `mod:${circ.b}`);
+    }
+    const added = graph.getStats().tripleCount - before;
+    logger.debug(`CodeGraphPopulator: added ${added} triples`);
+    return added;
+}
+// ── Helpers ──────────────────────────────────────────────────────────────
+function addComponentTriples(graph, entries, nodeType) {
+    for (const entry of entries) {
+        const file = normalizeModulePath(entry.file);
+        graph.add(`cls:${entry.name}`, 'definedIn', `mod:${file}`, { nodeType });
+    }
+}
+function addPatternTriples(graph, modules, pattern) {
+    for (const mod of modules) {
+        graph.add(`mod:${mod}`, 'patternOf', `pat:${pattern}`);
+    }
+}
+function normalizeModulePath(filePath) {
+    return filePath
+        .replace(/\\/g, '/')
+        .replace(/\.[^.]+$/, ''); // strip extension
+}
+function classifyExport(name) {
+    if (/^[A-Z][a-z]/.test(name))
+        return 'cls'; // PascalCase → class
+    if (/^I[A-Z]/.test(name))
+        return 'iface'; // IFoo → interface
+    return 'fn'; // camelCase → function
+}
+//# sourceMappingURL=code-graph-populator.js.map

package/dist/knowledge/code-graph-populator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-graph-populator.js","sourceRoot":"","sources":["../../src/knowledge/code-graph-populator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAqB,EACrB,KAAwB;IAExB,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,WAAW,CAAC;IAE5C,yBAAyB;IACzB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;QAC9C,KAAK,CAAC,GAAG,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,KAAK,CAAC,SAAS,EAAE;YAChE,QAAQ,EAAE,OAAO;YACjB,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC;SACnC,CAAC,CAAC;IACL,CAAC;IAED,+BAA+B;IAC/B,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YACrD,KAAK,CAAC,GAAG,CAAC,OAAO,QAAQ,EAAE,EAAE,SAAS,EAAE,OAAO,QAAQ,EAAE,CAAC,CAAC;YAC3D,KAAK,CAAC,GAAG,CAAC,OAAO,QAAQ,EAAE,EAAE,QAAQ,EAAE,OAAO,QAAQ,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,UAAU,EAAE,CAAC;QAC/C,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,MAAM,EAAE,EAAE,aAAa,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE;YACpE,QAAQ,EAAE,QAAQ;SACnB,CAAC,CAAC;IACL,CAAC;IAED,oCAAoC;IACpC,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;IACpC,IAAI,UAAU,EAAE,CAAC;QACf,mBAAmB,CAAC,KAAK,EAAE,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACvD,mBAAmB,CAAC,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACrD,mBAAmB,CAAC,KAAK,EAAE,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC3D,mBAAmB,CAAC,KAAK,EAAE,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAEzD,KAAK,MAAM,EAAE,IAAI,UAAU,CAAC,WAAW,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC1C,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,WAAW,EAAE,OAAO,IAAI,EAAE,EAAE;gBACtD,QAAQ,EAAE,YAAY;gBACtB,GAAG,CAAC,EAAE,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAClE,CAAC,CAAC;QACL,CAAC;QAED,yCAAyC;QACzC,KAAK,MAAM,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;gBAC7B,4EAA4E;gBAC5E,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;gBACnC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC;gBAC9C,KAAK,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,GAAG,EAAE,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;QAC9C,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC;QACjC,yEAAyE;QACzE,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;YAClC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBACvC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC1B,IAAI,GAAG,CAAC,UAAU,CAAC,QAAQ,GAAG,GAAG,CAAC,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;oBACvD,KAAK,CAAC,GAAG,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,EAAE,CAAC,CAAC;oBAC3D,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,EAAE,EAAE,WAAW,EAAE,SAAS,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC9D,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IACjE,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAChE,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC9D,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC3D,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACnE,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAE/D,uDAAuD;IACvD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,mBAAmB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7C,KAAK,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE;YACnE,QAAQ,EAAE,OAAO;SAClB,CAAC,CAAC;IACL,CAAC;IAED,kCAAkC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,CAAC;QACnD,KAAK,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,EAAE,cAAc,EAAE,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,WAAW,GAAG,MAAM,CAAC;IACpD,MAAM,CAAC,KAAK,CAAC,6BAA6B,KAAK,UAAU,CAAC,CAAC;IAC3D,OAAO,KAAK,CAAC;AACf,CAAC;AAED,4EAA4E;AAE5E,SAAS,mBAAmB,CAC1B,KAAqB,EACrB,OAAyB,EACzB,QAAgB;IAEhB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,mBAAmB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7C,KAAK,CAAC,GAAG,CAAC,OAAO,KAAK,CAAC,IAAI,EAAE,EAAE,WAAW,EAAE,OAAO,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAqB,EACrB,OAAiB,EACjB,OAAe;IAEf,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,KAAK,CAAC,GAAG,CAAC,OAAO,GAAG,EAAE,EAAE,WAAW,EAAE,OAAO,OAAO,EAAE,CAAC,CAAC;IACzD,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAAC,QAAgB;IAC3C,OAAO,QAAQ;SACZ,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC;SACnB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB;AAChD,CAAC;AAED,SAAS,cAAc,CAAC,IAAY;IAClC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,qBAAqB;IACjE,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,OAAO,CAAC,CAAI,mBAAmB;IAChE,OAAO,IAAI,CAAC,CAAoC,uBAAuB;AACzE,CAAC"}

package/dist/knowledge/community-detection.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Community Detection — Label Propagation on the Knowledge Graph
+ *
+ * Detects architectural sub-systems (clusters of tightly-connected modules)
+ * using a deterministic Label Propagation algorithm.
+ * Ties are broken by PageRank score to stabilize convergence.
+ */
+import type { KnowledgeGraph } from './knowledge-graph.js';
+export interface CommunityConfig {
+    /** Which predicate defines edges between modules. Default 'imports' */
+    predicate: string;
+    /** Entity prefix to cluster. Default 'mod:' */
+    entityPrefix: string;
+    /** Max iterations. Default 20 */
+    maxIterations: number;
+    /** Discard communities smaller than this. Default 2 */
+    minCommunitySize: number;
+    /** Seed for deterministic shuffling. Default 42 */
+    seed: number;
+}
+export interface CommunityResult {
+    /** entityId → communityId */
+    communities: Map<string, number>;
+    /** communityId → size */
+    communitySizes: Map<number, number>;
+    /** communityId → list of member entities */
+    communityMembers: Map<number, string[]>;
+    /** Modularity quality score [0, 1] */
+    modularity: number;
+    /** Timestamp */
+    computedAt: number;
+}
+/**
+ * Detect communities using Label Propagation.
+ *
+ * 1. Each entity gets a unique label.
+ * 2. Each iteration, in shuffled order, adopt the most common neighbor label.
+ * 3. Ties broken by PageRank (highest-ranked neighbor's label wins).
+ * 4. Converge when no labels change, or maxIterations reached.
+ * 5. Filter out communities below minCommunitySize.
+ */
+export declare function detectCommunities(graph: KnowledgeGraph, config?: Partial<CommunityConfig>, pageRankScores?: Map<string, number>): CommunityResult;
+/**
+ * Generate a human-readable summary for a community.
+ * Shows common path prefix, top entities by PageRank, and fn/cls counts.
+ */
+export declare function summarizeCommunity(graph: KnowledgeGraph, members: string[], pageRankScores?: Map<string, number>): string;