ai-mind-map 1.1.0

package/dist/knowledge-graph/indexer.js

@@ -0,0 +1,506 @@
+/**
+ * AI Mind Map — Codebase Indexer (Full & Incremental)
+ *
+ * Scans a project's source files, parses each with the tree-sitter/regex parser,
+ * and stores extracted structural information in the knowledge graph.
+ *
+ * Supports full re-indexing and incremental updates (only re-parse changed files).
+ * Respects .gitignore patterns and custom ignore lists.
+ *
+ * Inspired by CocoIndex's incremental approach and Cursor's Merkle tree.
+ */
+import { readFileSync } from 'node:fs';
+import { readFile, stat } from 'node:fs/promises';
+import { relative, join } from 'node:path';
+import { glob } from 'glob';
+import ignore from 'ignore';
+import { parseFile, parseFiles, isSupportedFile, detectLanguage, getSupportedExtensions, generateContentHash, } from './parser.js';
+/** Maximum file size to index (default 512KB). Files larger than this are skipped to prevent OOM. */
+const MAX_FILE_SIZE_BYTES = 512 * 1024;
+// ============================================================
+// Indexer Class
+// ============================================================
+/**
+ * Codebase indexer that scans, parses, and indexes source files
+ * into the knowledge graph.
+ */
+export class Indexer {
+    graph;
+    config;
+    ig;
+    constructor(graph, config) {
+        this.graph = graph;
+        this.config = config;
+        this.ig = ignore();
+        // Load .gitignore patterns
+        this.loadIgnorePatterns();
+    }
+    /** Load ignore patterns from .gitignore and config */
+    loadIgnorePatterns() {
+        // Add config-specified ignore patterns
+        if (this.config.ignore.length > 0) {
+            this.ig.add(this.config.ignore);
+        }
+        // Try to read .gitignore
+        try {
+            const gitignorePath = join(this.config.projectRoot, '.gitignore');
+            const gitignoreContent = readFileSync(gitignorePath, 'utf-8');
+            this.ig.add(gitignoreContent);
+        }
+        catch {
+            // No .gitignore file, continue
+        }
+        // Try nested .gitignore files
+        try {
+            const nestedIgnores = [
+                join(this.config.projectRoot, 'src', '.gitignore'),
+                join(this.config.projectRoot, 'packages', '.gitignore'),
+            ];
+            for (const p of nestedIgnores) {
+                try {
+                    const content = readFileSync(p, 'utf-8');
+                    this.ig.add(content);
+                }
+                catch {
+                    // Skip non-existent files
+                }
+            }
+        }
+        catch {
+            // Skip
+        }
+    }
+    /**
+     * Scan the project directory for indexable source files.
+     *
+     * Respects .gitignore and custom ignore patterns.
+     * Skips binary files and files exceeding maxFileSize.
+     */
+    async scanFiles() {
+        const extensions = getSupportedExtensions();
+        // Build glob patterns from supported extensions
+        const patterns = extensions.map(ext => `**/*${ext}`);
+        // Find all matching files
+        const allFiles = [];
+        for (const pattern of patterns) {
+            const matches = await glob(pattern, {
+                cwd: this.config.projectRoot,
+                absolute: true,
+                nodir: true,
+                dot: false,
+                ignore: this.config.ignore.map(p => {
+                    // Convert simple names to glob patterns
+                    if (!p.includes('/') && !p.includes('*')) {
+                        return `**/${p}/**`;
+                    }
+                    return p;
+                }),
+            });
+            allFiles.push(...matches);
+        }
+        // De-duplicate
+        const uniqueFiles = [...new Set(allFiles)];
+        // Filter through ignore patterns and size checks
+        const validFiles = [];
+        for (const absPath of uniqueFiles) {
+            const relPath = relative(this.config.projectRoot, absPath).replace(/\\/g, '/');
+            // Check ignore patterns
+            if (this.ig.ignores(relPath))
+                continue;
+            // Check file size
+            try {
+                const fileStat = await stat(absPath);
+                if (fileStat.size > this.config.maxFileSize)
+                    continue;
+                if (fileStat.size === 0)
+                    continue;
+            }
+            catch {
+                continue;
+            }
+            // Check if it's a supported source file
+            if (!isSupportedFile(absPath))
+                continue;
+            validFiles.push(absPath);
+        }
+        return validFiles.sort();
+    }
+    /**
+     * Perform a full index of the entire codebase.
+     *
+     * Scans all files, parses each, and stores results in the graph.
+     * Clears existing data before indexing.
+     *
+     * @param onProgress - Optional progress callback
+     * @returns Indexing statistics
+     */
+    async fullIndex(onProgress) {
+        const startTime = Date.now();
+        const stats = {
+            filesScanned: 0,
+            filesParsed: 0,
+            filesSkipped: 0,
+            filesDeleted: 0,
+            nodesCreated: 0,
+            edgesCreated: 0,
+            parseErrors: 0,
+            durationMs: 0,
+            languages: {},
+        };
+        // Phase 1: Scanning
+        onProgress?.({
+            phase: 'scanning',
+            current: 0,
+            total: 0,
+            message: 'Scanning project for source files...',
+        });
+        const files = await this.scanFiles();
+        stats.filesScanned = files.length;
+        if (files.length === 0) {
+            onProgress?.({
+                phase: 'complete',
+                current: 0,
+                total: 0,
+                message: 'No source files found to index.',
+            });
+            stats.durationMs = Date.now() - startTime;
+            return stats;
+        }
+        // Clear existing graph data
+        this.graph.clear();
+        // Phase 2: Parsing
+        onProgress?.({
+            phase: 'parsing',
+            current: 0,
+            total: files.length,
+            message: `Parsing ${files.length} files...`,
+        });
+        const parseResults = await parseFiles(files, 8, (current, total) => {
+            onProgress?.({
+                phase: 'parsing',
+                current,
+                total,
+                currentFile: files[Math.min(current, files.length - 1)],
+                message: `Parsed ${current}/${total} files`,
+            });
+        });
+        // Phase 3: Storing
+        onProgress?.({
+            phase: 'storing',
+            current: 0,
+            total: parseResults.length,
+            message: 'Storing parsed data in knowledge graph...',
+        });
+        for (let i = 0; i < parseResults.length; i++) {
+            const result = parseResults[i];
+            // If any single file fails, log and continue
+            try {
+                if (result.nodes.length === 0 && result.parseErrors.length > 0) {
+                    stats.filesSkipped++;
+                    stats.parseErrors += result.parseErrors.length;
+                    continue;
+                }
+                stats.filesParsed++;
+                stats.nodesCreated += result.nodes.length;
+                stats.edgesCreated += result.edges.length;
+                // Track language distribution
+                if (result.language !== 'unknown') {
+                    stats.languages[result.language] = (stats.languages[result.language] ?? 0) + 1;
+                }
+                if (result.parseErrors.length > 0) {
+                    stats.parseErrors += result.parseErrors.length;
+                }
+                // Store in graph
+                this.graph.replaceFileData(result.filePath, result.nodes, result.edges);
+                if (i % 50 === 0) {
+                    onProgress?.({
+                        phase: 'storing',
+                        current: i + 1,
+                        total: parseResults.length,
+                        currentFile: result.filePath,
+                        message: `Stored ${i + 1}/${parseResults.length} files`,
+                    });
+                }
+            }
+            catch {
+                stats.parseErrors++;
+            }
+        }
+        // Phase 4: Complete
+        stats.durationMs = Date.now() - startTime;
+        onProgress?.({
+            phase: 'complete',
+            current: stats.filesParsed,
+            total: stats.filesScanned,
+            message: `Indexing complete: ${stats.filesParsed} files, ${stats.nodesCreated} nodes, ${stats.edgesCreated} edges in ${stats.durationMs}ms`,
+        });
+        return stats;
+    }
+    /**
+     * Perform an incremental index — only re-parse files that have changed.
+     *
+     * Detects changes by comparing content hashes stored in the graph
+     * against current file contents.
+     *
+     * @param onProgress - Optional progress callback
+     * @returns Indexing statistics
+     */
+    async incrementalIndex(onProgress) {
+        const startTime = Date.now();
+        const stats = {
+            filesScanned: 0,
+            filesParsed: 0,
+            filesSkipped: 0,
+            filesDeleted: 0,
+            nodesCreated: 0,
+            edgesCreated: 0,
+            parseErrors: 0,
+            durationMs: 0,
+            languages: {},
+        };
+        // Phase 1: Scanning
+        onProgress?.({
+            phase: 'scanning',
+            current: 0,
+            total: 0,
+            message: 'Scanning for changes...',
+        });
+        const currentFiles = await this.scanFiles();
+        stats.filesScanned = currentFiles.length;
+        const indexedFiles = new Set(this.graph.getIndexedFiles());
+        const currentFileSet = new Set(currentFiles);
+        // Find files to add/update and files to delete
+        const filesToParse = [];
+        const filesToDelete = [];
+        // Check for new or modified files
+        for (const filePath of currentFiles) {
+            const existingHash = this.graph.getFileHash(filePath);
+            if (!existingHash) {
+                // New file
+                filesToParse.push(filePath);
+                continue;
+            }
+            // Check if content has changed
+            try {
+                const content = await readFile(filePath, 'utf-8');
+                const currentHash = generateContentHash(content);
+                if (currentHash !== existingHash) {
+                    filesToParse.push(filePath);
+                }
+                else {
+                    stats.filesSkipped++;
+                }
+            }
+            catch {
+                stats.filesSkipped++;
+            }
+        }
+        // Check for deleted files
+        for (const indexedFile of indexedFiles) {
+            if (!currentFileSet.has(indexedFile)) {
+                filesToDelete.push(indexedFile);
+            }
+        }
+        // Phase 2: Handle deletions
+        if (filesToDelete.length > 0) {
+            onProgress?.({
+                phase: 'cleanup',
+                current: 0,
+                total: filesToDelete.length,
+                message: `Removing ${filesToDelete.length} deleted files...`,
+            });
+            for (const filePath of filesToDelete) {
+                const deleted = this.graph.deleteFileNodes(filePath);
+                stats.filesDeleted++;
+            }
+        }
+        // Phase 3: Parse changed files
+        if (filesToParse.length > 0) {
+            onProgress?.({
+                phase: 'parsing',
+                current: 0,
+                total: filesToParse.length,
+                message: `Parsing ${filesToParse.length} changed files...`,
+            });
+            const parseResults = await parseFiles(filesToParse, 8, (current, total) => {
+                onProgress?.({
+                    phase: 'parsing',
+                    current,
+                    total,
+                    currentFile: filesToParse[Math.min(current, filesToParse.length - 1)],
+                    message: `Parsed ${current}/${total} changed files`,
+                });
+            });
+            // Phase 4: Store results
+            onProgress?.({
+                phase: 'storing',
+                current: 0,
+                total: parseResults.length,
+                message: 'Updating knowledge graph...',
+            });
+            for (let i = 0; i < parseResults.length; i++) {
+                const result = parseResults[i];
+                if (result.nodes.length === 0 && result.parseErrors.length > 0) {
+                    stats.parseErrors += result.parseErrors.length;
+                    continue;
+                }
+                stats.filesParsed++;
+                stats.nodesCreated += result.nodes.length;
+                stats.edgesCreated += result.edges.length;
+                if (result.language !== 'unknown') {
+                    stats.languages[result.language] = (stats.languages[result.language] ?? 0) + 1;
+                }
+                if (result.parseErrors.length > 0) {
+                    stats.parseErrors += result.parseErrors.length;
+                }
+                // Replace file data atomically
+                this.graph.replaceFileData(result.filePath, result.nodes, result.edges);
+            }
+        }
+        // Phase 5: Complete
+        stats.durationMs = Date.now() - startTime;
+        const changeCount = filesToParse.length + filesToDelete.length;
+        onProgress?.({
+            phase: 'complete',
+            current: changeCount,
+            total: stats.filesScanned,
+            message: changeCount > 0
+                ? `Incremental index: ${stats.filesParsed} updated, ${stats.filesDeleted} deleted in ${stats.durationMs}ms`
+                : `No changes detected (${stats.filesScanned} files checked in ${stats.durationMs}ms)`,
+        });
+        return stats;
+    }
+    /**
+     * Index a single file (e.g., when file watcher detects a change).
+     *
+     * @param filePath - Absolute path to the changed file
+     * @returns Parse result, or null if file was skipped
+     */
+    async indexFile(filePath) {
+        // Check if file should be ignored
+        const relPath = relative(this.config.projectRoot, filePath).replace(/\\/g, '/');
+        if (this.ig.ignores(relPath))
+            return null;
+        if (!isSupportedFile(filePath))
+            return null;
+        // Skip files that are too large (prevent OOM)
+        const fileStat = await stat(filePath).catch(() => null);
+        if (!fileStat || fileStat.size > MAX_FILE_SIZE_BYTES) {
+            return null;
+        }
+        try {
+            if (fileStat.size > this.config.maxFileSize)
+                return null;
+            if (fileStat.size === 0)
+                return null;
+        }
+        catch {
+            // File may have been deleted
+            this.graph.deleteFileNodes(filePath);
+            return null;
+        }
+        const result = await parseFile(filePath);
+        if (result.nodes.length > 0) {
+            this.graph.replaceFileData(filePath, result.nodes, result.edges);
+        }
+        return result;
+    }
+    /**
+     * Remove a file from the index (e.g., when file watcher detects deletion).
+     *
+     * @param filePath - Absolute path to the deleted file
+     * @returns Number of nodes removed
+     */
+    removeFile(filePath) {
+        return this.graph.deleteFileNodes(filePath);
+    }
+    /**
+     * Auto-detect the languages used in the project based on file extension distribution.
+     *
+     * @returns Sorted array of language names (most common first)
+     */
+    async detectProjectLanguages() {
+        const files = await this.scanFiles();
+        const langCounts = {};
+        for (const file of files) {
+            const lang = detectLanguage(file);
+            if (lang) {
+                langCounts[lang] = (langCounts[lang] ?? 0) + 1;
+            }
+        }
+        return Object.entries(langCounts)
+            .sort((a, b) => b[1] - a[1])
+            .map(([lang]) => lang);
+    }
+    /**
+     * Get the current indexing status — how many files are indexed vs how many exist.
+     */
+    async getIndexStatus() {
+        const currentFiles = await this.scanFiles();
+        const indexedFiles = this.graph.getIndexedFiles();
+        const indexedSet = new Set(indexedFiles);
+        let staleCount = 0;
+        for (const filePath of currentFiles) {
+            if (!indexedSet.has(filePath)) {
+                staleCount++;
+            }
+        }
+        // Check for deleted files still in index
+        const currentSet = new Set(currentFiles);
+        for (const indexedFile of indexedFiles) {
+            if (!currentSet.has(indexedFile)) {
+                staleCount++;
+            }
+        }
+        const staleness = currentFiles.length > 0 ? staleCount / currentFiles.length : 0;
+        return {
+            indexedFiles: indexedFiles.length,
+            totalFiles: currentFiles.length,
+            staleness,
+            needsReindex: staleness > 0.1, // More than 10% stale
+        };
+    }
+    /** Validate the index against the filesystem. Returns files that are stale, missing, or orphaned. */
+    async validateIndex() {
+        const indexedFiles = this.graph.getIndexedFiles();
+        const diskFiles = await this.scanFiles();
+        const diskSet = new Set(diskFiles);
+        const indexSet = new Set(indexedFiles);
+        const missingFiles = [];
+        const staleFiles = [];
+        const unindexedFiles = [];
+        // Check indexed files against disk
+        for (const f of indexedFiles) {
+            if (!diskSet.has(f)) {
+                missingFiles.push(f);
+            }
+            else {
+                // Check if file changed
+                try {
+                    const content = readFileSync(f, 'utf-8');
+                    const currentHash = (await import('./parser.js')).generateContentHash(content);
+                    const indexedHash = this.graph.getFileHash(f);
+                    if (indexedHash && currentHash !== indexedHash) {
+                        staleFiles.push(f);
+                    }
+                }
+                catch {
+                    staleFiles.push(f);
+                }
+            }
+        }
+        // Check for unindexed files
+        for (const f of diskFiles) {
+            if (!indexSet.has(f)) {
+                unindexedFiles.push(f);
+            }
+        }
+        return {
+            staleFiles,
+            missingFiles,
+            unindexedFiles,
+            healthy: staleFiles.length === 0 && missingFiles.length === 0 && unindexedFiles.length === 0,
+        };
+    }
+}
+//# sourceMappingURL=indexer.js.map

package/dist/knowledge-graph/indexer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexer.js","sourceRoot":"","sources":["../../src/knowledge-graph/indexer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,MAAM,MAAM,QAAQ,CAAC;AAG5B,OAAO,EACL,SAAS,EACT,UAAU,EACV,eAAe,EACf,cAAc,EACd,sBAAsB,EACtB,mBAAmB,GACpB,MAAM,aAAa,CAAC;AAGrB,qGAAqG;AACrG,MAAM,mBAAmB,GAAG,GAAG,GAAG,IAAI,CAAC;AA+BvC,+DAA+D;AAC/D,gBAAgB;AAChB,+DAA+D;AAE/D;;;GAGG;AACH,MAAM,OAAO,OAAO;IACV,KAAK,CAAiB;IACtB,MAAM,CAAgB;IACtB,EAAE,CAA4B;IAEtC,YAAY,KAAqB,EAAE,MAAqB;QACtD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC;QAEnB,2BAA2B;QAC3B,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5B,CAAC;IAED,sDAAsD;IAC9C,kBAAkB;QACxB,uCAAuC;QACvC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;QAED,yBAAyB;QACzB,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAClE,MAAM,gBAAgB,GAAG,YAAY,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;YAC9D,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,+BAA+B;QACjC,CAAC;QAED,8BAA8B;QAC9B,IAAI,CAAC;YACH,MAAM,aAAa,GAAG;gBACpB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,EAAE,YAAY,CAAC;gBAClD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,UAAU,EAAE,YAAY,CAAC;aACxD,CAAC;YACF,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC9B,IAAI,CAAC;oBACH,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACzC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACvB,CAAC;gBAAC,MAAM,CAAC;oBACP,0BAA0B;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,SAAS;QACb,MAAM,UAAU,GAAG,sBAAsB,EAAE,CAAC;QAE5C,gDAAgD;QAChD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC;QAErD,0BAA0B;QAC1B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE;gBAClC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW;gBAC5B,QAAQ,EAAE,IAAI;gBACd,KAAK,EAAE,IAAI;gBACX,GAAG,EAAE,KAAK;gBACV,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;oBACjC,wCAAwC;oBACxC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;wBACzC,OAAO,MAAM,CAAC,KAAK,CAAC;oBACtB,CAAC;oBACD,OAAO,CAAC,CAAC;gBACX,CAAC,CAAC;aACH,CAAC,CAAC;YACH,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;QAC5B,CAAC;QAED,eAAe;QACf,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QAE3C,iDAAiD;QACjD,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE/E,wBAAwB;YACxB,IAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC;gBAAE,SAAS;YAEvC,kBAAkB;YAClB,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrC,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW;oBAAE,SAAS;gBACtD,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;oBAAE,SAAS;YACpC,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YAED,wCAAwC;YACxC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC;gBAAE,SAAS;YAExC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3B,CAAC;QAED,OAAO,UAAU,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,SAAS,CAAC,UAAkC;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAe;YACxB,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;YACd,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,EAAE;SACd,CAAC;QAEF,oBAAoB;QACpB,UAAU,EAAE,CAAC;YACX,KAAK,EAAE,UAAU;YACjB,OAAO,EAAE,CAAC;YACV,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,sCAAsC;SAChD,CAAC,CAAC;QAEH,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACrC,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC;QAElC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,UAAU,EAAE,CAAC;gBACX,KAAK,EAAE,UAAU;gBACjB,OAAO,EAAE,CAAC;gBACV,KAAK,EAAE,CAAC;gBACR,OAAO,EAAE,iCAAiC;aAC3C,CAAC,CAAC;YACH,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAC1C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,4BAA4B;QAC5B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAEnB,mBAAmB;QACnB,UAAU,EAAE,CAAC;YACX,KAAK,EAAE,SAAS;YAChB,OAAO,EAAE,CAAC;YACV,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,OAAO,EAAE,WAAW,KAAK,CAAC,MAAM,WAAW;SAC5C,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;YACjE,UAAU,EAAE,CAAC;gBACX,KAAK,EAAE,SAAS;gBAChB,OAAO;gBACP,KAAK;gBACL,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACvD,OAAO,EAAE,UAAU,OAAO,IAAI,KAAK,QAAQ;aAC5C,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,mBAAmB;QACnB,UAAU,EAAE,CAAC;YACX,KAAK,EAAE,SAAS;YAChB,OAAO,EAAE,CAAC;YACV,KAAK,EAAE,YAAY,CAAC,MAAM;YAC1B,OAAO,EAAE,2CAA2C;SACrD,CAAC,CAAC;QAEH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YAE/B,6CAA6C;YAC7C,IAAI,CAAC;gBACH,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/D,KAAK,CAAC,YAAY,EAAE,CAAC;oBACrB,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;oBAC/C,SAAS;gBACX,CAAC;gBAED,KAAK,CAAC,WAAW,EAAE,CAAC;gBACpB,KAAK,CAAC,YAAY,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;gBAC1C,KAAK,CAAC,YAAY,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;gBAE1C,8BAA8B;gBAC9B,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAClC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjF,CAAC;gBAED,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAClC,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;gBACjD,CAAC;gBAED,iBAAiB;gBACjB,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBAExE,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;oBACjB,UAAU,EAAE,CAAC;wBACX,KAAK,EAAE,SAAS;wBAChB,OAAO,EAAE,CAAC,GAAG,CAAC;wBACd,KAAK,EAAE,YAAY,CAAC,MAAM;wBAC1B,WAAW,EAAE,MAAM,CAAC,QAAQ;wBAC5B,OAAO,EAAE,UAAU,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,MAAM,QAAQ;qBACxD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,KAAK,CAAC,WAAW,EAAE,CAAC;YACtB,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAE1C,UAAU,EAAE,CAAC;YACX,KAAK,EAAE,UAAU;YACjB,OAAO,EAAE,KAAK,CAAC,WAAW;YAC1B,KAAK,EAAE,KAAK,CAAC,YAAY;YACzB,OAAO,EAAE,sBAAsB,KAAK,CAAC,WAAW,WAAW,KAAK,CAAC,YAAY,WAAW,KAAK,CAAC,YAAY,aAAa,KAAK,CAAC,UAAU,IAAI;SAC5I,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,gBAAgB,CAAC,UAAkC;QACvD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAe;YACxB,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;YACd,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,EAAE;SACd,CAAC;QAEF,oBAAoB;QACpB,UAAU,EAAE,CAAC;YACX,KAAK,EAAE,UAAU;YACjB,OAAO,EAAE,CAAC;YACV,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,yBAAyB;SACnC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QAC5C,KAAK,CAAC,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC;QAEzC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC,CAAC;QAC3D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QAE7C,+CAA+C;QAC/C,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,aAAa,GAAa,EAAE,CAAC;QAEnC,kCAAkC;QAClC,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAEtD,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,WAAW;gBACX,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5B,SAAS;YACX,CAAC;YAED,+BAA+B;YAC/B,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAClD,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,WAAW,KAAK,YAAY,EAAE,CAAC;oBACjC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,YAAY,EAAE,CAAC;gBACvB,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,KAAK,CAAC,YAAY,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;YACvC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBACrC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED,4BAA4B;QAC5B,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,UAAU,EAAE,CAAC;gBACX,KAAK,EAAE,SAAS;gBAChB,OAAO,EAAE,CAAC;gBACV,KAAK,EAAE,aAAa,CAAC,MAAM;gBAC3B,OAAO,EAAE,YAAY,aAAa,CAAC,MAAM,mBAAmB;aAC7D,CAAC,CAAC;YAEH,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;gBACrC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;gBACrD,KAAK,CAAC,YAAY,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,UAAU,EAAE,CAAC;gBACX,KAAK,EAAE,SAAS;gBAChB,OAAO,EAAE,CAAC;gBACV,KAAK,EAAE,YAAY,CAAC,MAAM;gBAC1B,OAAO,EAAE,WAAW,YAAY,CAAC,MAAM,mBAAmB;aAC3D,CAAC,CAAC;YAEH,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;gBACxE,UAAU,EAAE,CAAC;oBACX,KAAK,EAAE,SAAS;oBAChB,OAAO;oBACP,KAAK;oBACL,WAAW,EAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACrE,OAAO,EAAE,UAAU,OAAO,IAAI,KAAK,gBAAgB;iBACpD,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;YAEH,yBAAyB;YACzB,UAAU,EAAE,CAAC;gBACX,KAAK,EAAE,SAAS;gBAChB,OAAO,EAAE,CAAC;gBACV,KAAK,EAAE,YAAY,CAAC,MAAM;gBAC1B,OAAO,EAAE,6BAA6B;aACvC,CAAC,CAAC;YAEH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBAE/B,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/D,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;oBAC/C,SAAS;gBACX,CAAC;gBAED,KAAK,CAAC,WAAW,EAAE,CAAC;gBACpB,KAAK,CAAC,YAAY,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;gBAC1C,KAAK,CAAC,YAAY,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;gBAE1C,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAClC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjF,CAAC;gBAED,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAClC,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;gBACjD,CAAC;gBAED,+BAA+B;gBAC/B,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAE1C,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;QAC/D,UAAU,EAAE,CAAC;YACX,KAAK,EAAE,UAAU;YACjB,OAAO,EAAE,WAAW;YACpB,KAAK,EAAE,KAAK,CAAC,YAAY;YACzB,OAAO,EAAE,WAAW,GAAG,CAAC;gBACtB,CAAC,CAAC,sBAAsB,KAAK,CAAC,WAAW,aAAa,KAAK,CAAC,YAAY,eAAe,KAAK,CAAC,UAAU,IAAI;gBAC3G,CAAC,CAAC,wBAAwB,KAAK,CAAC,YAAY,qBAAqB,KAAK,CAAC,UAAU,KAAK;SACzF,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,SAAS,CAAC,QAAgB;QAC9B,kCAAkC;QAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAChF,IAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1C,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QAE5C,8CAA8C;QAC9C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,GAAG,mBAAmB,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,CAAC;YACH,IAAI,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW;gBAAE,OAAO,IAAI,CAAC;YACzD,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,6BAA6B;YAC7B,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,QAAQ,CAAC,CAAC;QAEzC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QACnE,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,QAAgB;QACzB,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,sBAAsB;QAC1B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACrC,MAAM,UAAU,GAA2B,EAAE,CAAC;QAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,IAAI,EAAE,CAAC;gBACT,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC;aAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc;QAMlB,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC;QAClD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QAEzC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC9B,UAAU,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QAED,yCAAyC;QACzC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QACzC,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;YACvC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBACjC,UAAU,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjF,OAAO;YACL,YAAY,EAAE,YAAY,CAAC,MAAM;YACjC,UAAU,EAAE,YAAY,CAAC,MAAM;YAC/B,SAAS;YACT,YAAY,EAAE,SAAS,GAAG,GAAG,EAAE,sBAAsB;SACtD,CAAC;IACJ,CAAC;IAED,qGAAqG;IACrG,KAAK,CAAC,aAAa;QAMjB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC;QAClD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QAEvC,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,cAAc,GAAa,EAAE,CAAC;QAEpC,mCAAmC;QACnC,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,wBAAwB;gBACxB,IAAI,CAAC;oBACH,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACzC,MAAM,WAAW,GAAG,CAAC,MAAM,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;oBAC/E,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;oBAC9C,IAAI,WAAW,IAAI,WAAW,KAAK,WAAW,EAAE,CAAC;wBAC/C,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QAED,4BAA4B;QAC5B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrB,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO;YACL,UAAU;YACV,YAAY;YACZ,cAAc;YACd,OAAO,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;SAC7F,CAAC;IACJ,CAAC;CACF"}

package/dist/knowledge-graph/pagerank.d.ts

@@ -0,0 +1,141 @@
+/**
+ * AI Mind Map — PageRank-based Relevance Ranking
+ *
+ * Implements standard and personalized PageRank to rank code symbols
+ * by structural importance. Directly inspired by Aider's Personalized
+ * PageRank approach for generating compact repo maps within a token budget.
+ *
+ * Key features:
+ * - Standard PageRank with configurable damping factor
+ * - Personalized PageRank biased toward conversation-relevant nodes
+ * - Token-budget-aware repo map generation
+ * - Caching with graph-change invalidation
+ */
+import type { GraphNode } from '../types.js';
+import { KnowledgeGraph } from './graph.js';
+/** PageRank configuration */
+export interface PageRankConfig {
+    /** Damping factor (probability of following a link vs random jump). Default: 0.85 */
+    dampingFactor: number;
+    /** Maximum iterations before convergence. Default: 100 */
+    maxIterations: number;
+    /** Convergence threshold (stop when max change < epsilon). Default: 1e-6 */
+    epsilon: number;
+}
+/** Ranked node with its PageRank score */
+export interface RankedNode {
+    node: GraphNode;
+    score: number;
+    /** Estimated token cost of this node's signature */
+    tokenCost: number;
+}
+/**
+ * PageRank-based relevance ranking engine for the knowledge graph.
+ *
+ * Computes structural importance of each node based on the link structure
+ * of the codebase graph. Supports personalized PageRank to bias rankings
+ * toward nodes relevant to the current conversation or query.
+ */
+export declare class PageRankEngine {
+    private graph;
+    private config;
+    private cache;
+    constructor(graph: KnowledgeGraph, config?: Partial<PageRankConfig>);
+    /**
+     * Compute a hash of the current graph state for cache invalidation.
+     * Uses node/edge counts + a sample of recent update timestamps.
+     */
+    private computeGraphHash;
+    /**
+     * Check if the cached PageRank scores are still valid.
+     */
+    private isCacheValid;
+    /**
+     * Invalidate the PageRank cache (call when graph changes).
+     */
+    invalidateCache(): void;
+    /**
+     * Build a weighted adjacency list from graph edges.
+     *
+     * @returns Adjacency list: nodeId → [(targetId, weight)]
+     */
+    private buildAdjacencyList;
+    /**
+     * Compute standard PageRank for all nodes in the graph.
+     *
+     * Uses the power iteration method with weighted edges.
+     *
+     * @returns Map of node ID → PageRank score
+     */
+    computePageRank(): Map<string, number>;
+    /**
+     * Compute Personalized PageRank biased toward specific seed nodes.
+     *
+     * This is the key algorithm inspired by Aider's approach:
+     * instead of uniform random jumps, jumps are biased toward nodes
+     * mentioned in the current conversation or query.
+     *
+     * @param seedNodeIds - Node IDs to bias toward (e.g., nodes matching a query)
+     * @param seedWeight - How much to bias toward seeds (0-1, default 0.5)
+     * @returns Map of node ID → personalized PageRank score
+     */
+    computePersonalizedPageRank(seedNodeIds: string[], seedWeight?: number): Map<string, number>;
+    /**
+     * Estimate the token cost of a node's signature representation.
+     * Rough estimate: ~4 characters per token.
+     */
+    private estimateNodeTokenCost;
+    /**
+     * Get the top-N most important nodes ranked by PageRank.
+     *
+     * @param limit - Maximum number of nodes to return
+     * @param excludeTypes - Node types to exclude (e.g., ['file'] to skip file nodes)
+     * @returns Ranked nodes with scores and token costs
+     */
+    getTopNodes(limit?: number, excludeTypes?: string[]): RankedNode[];
+    /**
+     * Get the most relevant nodes for a set of seed nodes (personalized).
+     *
+     * @param seedNodeIds - Seed node IDs to bias toward
+     * @param limit - Maximum number of nodes
+     * @param seedWeight - Bias weight (0-1)
+     * @param excludeTypes - Node types to exclude
+     */
+    getRelevantNodes(seedNodeIds: string[], limit?: number, seedWeight?: number, excludeTypes?: string[]): RankedNode[];
+    /**
+     * Rank nodes by their scores, applying filters.
+     */
+    private rankNodes;
+    /**
+     * Get nodes that fit within a token budget, ranked by importance.
+     *
+     * Greedily fills the budget with the highest-ranked nodes first.
+     *
+     * @param tokenBudget - Maximum tokens to use
+     * @param seedNodeIds - Optional seed nodes for personalized ranking
+     * @param excludeTypes - Node types to exclude
+     * @returns Ranked nodes fitting within budget
+     */
+    getNodesWithinBudget(tokenBudget: number, seedNodeIds?: string[], excludeTypes?: string[]): RankedNode[];
+    /**
+     * Generate a compact repository map string within a token budget.
+     *
+     * Produces an Aider-style repo map that shows the most important
+     * symbols' signatures, organized by file. This is the primary
+     * output for token-efficient context.
+     *
+     * @param tokenBudget - Maximum tokens for the repo map
+     * @param seedNodeIds - Optional seed nodes for personalized ranking
+     * @returns Compact repo map string
+     */
+    generateRepoMap(tokenBudget: number, seedNodeIds?: string[]): string;
+    /**
+     * Get a simple map of file paths → their top symbols.
+     * Useful for a table-of-contents view of the project.
+     *
+     * @param maxSymbolsPerFile - Max symbols to show per file (default 10)
+     * @returns Map of file path → symbol signatures
+     */
+    getProjectTOC(maxSymbolsPerFile?: number): Map<string, string[]>;
+}
+//# sourceMappingURL=pagerank.d.ts.map

package/dist/knowledge-graph/pagerank.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank.d.ts","sourceRoot":"","sources":["../../src/knowledge-graph/pagerank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAuB,MAAM,aAAa,CAAC;AAClE,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAM5C,6BAA6B;AAC7B,MAAM,WAAW,cAAc;IAC7B,qFAAqF;IACrF,aAAa,EAAE,MAAM,CAAC;IACtB,0DAA0D;IAC1D,aAAa,EAAE,MAAM,CAAC;IACtB,4EAA4E;IAC5E,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,0CAA0C;AAC1C,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,SAAS,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,oDAAoD;IACpD,SAAS,EAAE,MAAM,CAAC;CACnB;AA6CD;;;;;;GAMG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,MAAM,CAAiB;IAC/B,OAAO,CAAC,KAAK,CAA8B;gBAE/B,KAAK,EAAE,cAAc,EAAE,MAAM,GAAE,OAAO,CAAC,cAAc,CAAM;IASvE;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAKxB;;OAEG;IACH,OAAO,CAAC,YAAY;IAMpB;;OAEG;IACH,eAAe,IAAI,IAAI;IAQvB;;;;OAIG;IACH,OAAO,CAAC,kBAAkB;IAmC1B;;;;;;OAMG;IACH,eAAe,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAuFtC;;;;;;;;;;OAUG;IACH,2BAA2B,CACzB,WAAW,EAAE,MAAM,EAAE,EACrB,UAAU,GAAE,MAAY,GACvB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAuFtB;;;OAGG;IACH,OAAO,CAAC,qBAAqB;IAU7B;;;;;;OAMG;IACH,WAAW,CACT,KAAK,GAAE,MAAW,EAClB,YAAY,GAAE,MAAM,EAAa,GAChC,UAAU,EAAE;IAKf;;;;;;;OAOG;IACH,gBAAgB,CACd,WAAW,EAAE,MAAM,EAAE,EACrB,KAAK,GAAE,MAAW,EAClB,UAAU,GAAE,MAAY,EACxB,YAAY,GAAE,MAAM,EAAa,GAChC,UAAU,EAAE;IAKf;;OAEG;IACH,OAAO,CAAC,SAAS;IAqCjB;;;;;;;;;OASG;IACH,oBAAoB,CAClB,WAAW,EAAE,MAAM,EACnB,WAAW,CAAC,EAAE,MAAM,EAAE,EACtB,YAAY,GAAE,MAAM,EAAa,GAChC,UAAU,EAAE;IA6Cf;;;;;;;;;;OAUG;IACH,eAAe,CACb,WAAW,EAAE,MAAM,EACnB,WAAW,CAAC,EAAE,MAAM,EAAE,GACrB,MAAM;IAoET;;;;;;OAMG;IACH,aAAa,CAAC,iBAAiB,GAAE,MAAW,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;CA2BrE"}