ai-mind-map 1.1.0

package/dist/knowledge-graph/pagerank.js

@@ -0,0 +1,493 @@
+/**
+ * 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
+ */
+// ============================================================
+// Constants
+// ============================================================
+const DEFAULT_CONFIG = {
+    dampingFactor: 0.85,
+    maxIterations: 100,
+    epsilon: 1e-6,
+};
+/**
+ * Weights for different edge types when building the adjacency matrix.
+ * Higher weight = stronger connection = more rank transferred.
+ */
+const EDGE_WEIGHTS = {
+    calls: 1.0,
+    imports: 0.8,
+    exports: 0.6,
+    inherits: 1.2,
+    implements: 1.1,
+    uses: 0.7,
+    decorates: 0.5,
+    overrides: 1.0,
+    contains: 0.9,
+    tests: 0.6,
+    depends_on: 0.8,
+    routes_to: 0.7,
+};
+// ============================================================
+// PageRank Engine
+// ============================================================
+/**
+ * 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 class PageRankEngine {
+    graph;
+    config;
+    cache = null;
+    constructor(graph, config = {}) {
+        this.graph = graph;
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    // ============================================================
+    // Graph Hash (for cache invalidation)
+    // ============================================================
+    /**
+     * Compute a hash of the current graph state for cache invalidation.
+     * Uses node/edge counts + a sample of recent update timestamps.
+     */
+    computeGraphHash() {
+        const stats = this.graph.getStats();
+        return `${stats.totalNodes}:${stats.totalEdges}:${Date.now() >> 16}`;
+    }
+    /**
+     * Check if the cached PageRank scores are still valid.
+     */
+    isCacheValid() {
+        if (!this.cache)
+            return false;
+        const currentHash = this.computeGraphHash();
+        return this.cache.graphHash === currentHash;
+    }
+    /**
+     * Invalidate the PageRank cache (call when graph changes).
+     */
+    invalidateCache() {
+        this.cache = null;
+    }
+    // ============================================================
+    // Adjacency Matrix Construction
+    // ============================================================
+    /**
+     * Build a weighted adjacency list from graph edges.
+     *
+     * @returns Adjacency list: nodeId → [(targetId, weight)]
+     */
+    buildAdjacencyList(nodeIds, edges) {
+        const nodeSet = new Set(nodeIds);
+        const outLinks = new Map();
+        const inLinks = new Map();
+        // Initialize empty adjacency lists
+        for (const id of nodeIds) {
+            outLinks.set(id, []);
+            inLinks.set(id, []);
+        }
+        // Populate from edges
+        for (const edge of edges) {
+            if (!nodeSet.has(edge.sourceId) || !nodeSet.has(edge.targetId))
+                continue;
+            if (edge.sourceId === edge.targetId)
+                continue; // Skip self-loops
+            const weight = EDGE_WEIGHTS[edge.type] ?? 0.5;
+            outLinks.get(edge.sourceId).push({ target: edge.targetId, weight });
+            inLinks.get(edge.targetId).push({ source: edge.sourceId, weight });
+        }
+        return { outLinks, inLinks };
+    }
+    // ============================================================
+    // Standard PageRank
+    // ============================================================
+    /**
+     * 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() {
+        // Check cache first
+        if (this.isCacheValid() && this.cache) {
+            return new Map(this.cache.scores);
+        }
+        const nodeIds = this.graph.getAllNodeIds();
+        if (nodeIds.length === 0)
+            return new Map();
+        const edges = this.graph.getAllEdges();
+        const { outLinks, inLinks } = this.buildAdjacencyList(nodeIds, edges);
+        const n = nodeIds.length;
+        const d = this.config.dampingFactor;
+        const uniformProb = 1 / n;
+        // Initialize scores uniformly
+        let scores = new Map();
+        for (const id of nodeIds) {
+            scores.set(id, uniformProb);
+        }
+        // Power iteration
+        for (let iter = 0; iter < this.config.maxIterations; iter++) {
+            const newScores = new Map();
+            let maxDelta = 0;
+            // Handle dangling nodes (nodes with no outgoing edges)
+            let danglingSum = 0;
+            for (const id of nodeIds) {
+                if (outLinks.get(id).length === 0) {
+                    danglingSum += scores.get(id);
+                }
+            }
+            for (const id of nodeIds) {
+                // Sum of weighted incoming rank
+                let incomingRank = 0;
+                const incomingEdges = inLinks.get(id);
+                for (const { source, weight } of incomingEdges) {
+                    const sourceScore = scores.get(source);
+                    const sourceOutLinks = outLinks.get(source);
+                    // Total outgoing weight from source
+                    const totalOutWeight = sourceOutLinks.reduce((sum, l) => sum + l.weight, 0);
+                    if (totalOutWeight > 0) {
+                        incomingRank += (sourceScore * weight) / totalOutWeight;
+                    }
+                }
+                // PageRank formula with dangling node handling
+                const newScore = (1 - d) / n + d * (incomingRank + danglingSum / n);
+                newScores.set(id, newScore);
+                const delta = Math.abs(newScore - (scores.get(id) ?? 0));
+                if (delta > maxDelta)
+                    maxDelta = delta;
+            }
+            scores = newScores;
+            // Check convergence
+            if (maxDelta < this.config.epsilon)
+                break;
+        }
+        // Normalize scores to sum to 1
+        const total = Array.from(scores.values()).reduce((s, v) => s + v, 0);
+        if (total > 0) {
+            for (const [id, score] of scores) {
+                scores.set(id, score / total);
+            }
+        }
+        // Cache the results
+        this.cache = {
+            scores: new Map(scores),
+            graphHash: this.computeGraphHash(),
+            computedAt: Date.now(),
+        };
+        return scores;
+    }
+    // ============================================================
+    // Personalized PageRank
+    // ============================================================
+    /**
+     * 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, seedWeight = 0.5) {
+        const nodeIds = this.graph.getAllNodeIds();
+        if (nodeIds.length === 0)
+            return new Map();
+        const edges = this.graph.getAllEdges();
+        const { outLinks, inLinks } = this.buildAdjacencyList(nodeIds, edges);
+        const n = nodeIds.length;
+        const d = this.config.dampingFactor;
+        // Build personalization vector
+        const seedSet = new Set(seedNodeIds.filter(id => nodeIds.includes(id)));
+        const personalization = new Map();
+        if (seedSet.size > 0) {
+            const seedProb = seedWeight / seedSet.size;
+            const nonSeedProb = (1 - seedWeight) / Math.max(n - seedSet.size, 1);
+            for (const id of nodeIds) {
+                personalization.set(id, seedSet.has(id) ? seedProb : nonSeedProb);
+            }
+        }
+        else {
+            // No valid seeds — fall back to uniform
+            const uniformProb = 1 / n;
+            for (const id of nodeIds) {
+                personalization.set(id, uniformProb);
+            }
+        }
+        // Initialize scores from personalization vector
+        let scores = new Map(personalization);
+        // Power iteration with personalization
+        for (let iter = 0; iter < this.config.maxIterations; iter++) {
+            const newScores = new Map();
+            let maxDelta = 0;
+            // Handle dangling nodes
+            let danglingSum = 0;
+            for (const id of nodeIds) {
+                if (outLinks.get(id).length === 0) {
+                    danglingSum += scores.get(id);
+                }
+            }
+            for (const id of nodeIds) {
+                let incomingRank = 0;
+                const incomingEdges = inLinks.get(id);
+                for (const { source, weight } of incomingEdges) {
+                    const sourceScore = scores.get(source);
+                    const sourceOutLinks = outLinks.get(source);
+                    const totalOutWeight = sourceOutLinks.reduce((sum, l) => sum + l.weight, 0);
+                    if (totalOutWeight > 0) {
+                        incomingRank += (sourceScore * weight) / totalOutWeight;
+                    }
+                }
+                // Personalized PageRank: random jumps go to personalization vector instead of uniform
+                const pv = personalization.get(id);
+                const danglingContrib = danglingSum * pv;
+                const newScore = (1 - d) * pv + d * (incomingRank + danglingContrib);
+                newScores.set(id, newScore);
+                const delta = Math.abs(newScore - (scores.get(id) ?? 0));
+                if (delta > maxDelta)
+                    maxDelta = delta;
+            }
+            scores = newScores;
+            if (maxDelta < this.config.epsilon)
+                break;
+        }
+        // Normalize
+        const total = Array.from(scores.values()).reduce((s, v) => s + v, 0);
+        if (total > 0) {
+            for (const [id, score] of scores) {
+                scores.set(id, score / total);
+            }
+        }
+        return scores;
+    }
+    // ============================================================
+    // Ranking & Token Budget
+    // ============================================================
+    /**
+     * Estimate the token cost of a node's signature representation.
+     * Rough estimate: ~4 characters per token.
+     */
+    estimateNodeTokenCost(node) {
+        let text = node.signature;
+        if (node.docComment) {
+            // Include first line of doc comment
+            const firstLine = node.docComment.split('\n')[0];
+            text += `\n/** ${firstLine} */`;
+        }
+        return Math.ceil(text.length / 4);
+    }
+    /**
+     * 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 = 50, excludeTypes = ['file']) {
+        const scores = this.computePageRank();
+        return this.rankNodes(scores, limit, excludeTypes);
+    }
+    /**
+     * 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, limit = 50, seedWeight = 0.5, excludeTypes = ['file']) {
+        const scores = this.computePersonalizedPageRank(seedNodeIds, seedWeight);
+        return this.rankNodes(scores, limit, excludeTypes);
+    }
+    /**
+     * Rank nodes by their scores, applying filters.
+     */
+    rankNodes(scores, limit, excludeTypes) {
+        const excludeSet = new Set(excludeTypes);
+        // Sort by score descending
+        const sortedIds = Array.from(scores.entries())
+            .sort((a, b) => b[1] - a[1])
+            .map(([id]) => id);
+        const ranked = [];
+        // Fetch nodes in batches for efficiency
+        const batchSize = Math.min(limit * 3, sortedIds.length); // Fetch extra to account for filtering
+        const candidateIds = sortedIds.slice(0, batchSize);
+        const nodes = this.graph.getNodesByIds(candidateIds);
+        const nodeMap = new Map(nodes.map(n => [n.id, n]));
+        for (const id of sortedIds) {
+            if (ranked.length >= limit)
+                break;
+            const node = nodeMap.get(id);
+            if (!node)
+                continue;
+            if (excludeSet.has(node.type))
+                continue;
+            ranked.push({
+                node,
+                score: scores.get(id),
+                tokenCost: this.estimateNodeTokenCost(node),
+            });
+        }
+        return ranked;
+    }
+    /**
+     * 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, seedNodeIds, excludeTypes = ['file']) {
+        const scores = seedNodeIds && seedNodeIds.length > 0
+            ? this.computePersonalizedPageRank(seedNodeIds)
+            : this.computePageRank();
+        const excludeSet = new Set(excludeTypes);
+        // Sort by score descending
+        const sortedIds = Array.from(scores.entries())
+            .sort((a, b) => b[1] - a[1])
+            .map(([id]) => id);
+        const allNodes = this.graph.getNodesByIds(sortedIds.slice(0, sortedIds.length));
+        const nodeMap = new Map(allNodes.map(n => [n.id, n]));
+        const result = [];
+        let usedTokens = 0;
+        for (const id of sortedIds) {
+            const node = nodeMap.get(id);
+            if (!node)
+                continue;
+            if (excludeSet.has(node.type))
+                continue;
+            const cost = this.estimateNodeTokenCost(node);
+            if (usedTokens + cost > tokenBudget) {
+                // Try to fit a few more smaller nodes
+                if (cost > tokenBudget * 0.1)
+                    continue;
+                if (usedTokens + cost > tokenBudget)
+                    break;
+            }
+            result.push({
+                node,
+                score: scores.get(id),
+                tokenCost: cost,
+            });
+            usedTokens += cost;
+        }
+        return result;
+    }
+    // ============================================================
+    // Repo Map Generation
+    // ============================================================
+    /**
+     * 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, seedNodeIds) {
+        const rankedNodes = this.getNodesWithinBudget(tokenBudget, seedNodeIds);
+        if (rankedNodes.length === 0) {
+            return '// Empty repo map — no nodes indexed yet';
+        }
+        // Group nodes by file
+        const fileGroups = new Map();
+        for (const rn of rankedNodes) {
+            const group = fileGroups.get(rn.node.filePath) ?? [];
+            group.push(rn);
+            fileGroups.set(rn.node.filePath, group);
+        }
+        // Sort files by max score of their nodes
+        const sortedFiles = Array.from(fileGroups.entries())
+            .sort((a, b) => {
+            const maxA = Math.max(...a[1].map(rn => rn.score));
+            const maxB = Math.max(...b[1].map(rn => rn.score));
+            return maxB - maxA;
+        });
+        // Build the repo map string
+        const lines = [];
+        let currentTokens = 0;
+        for (const [filePath, nodes] of sortedFiles) {
+            // File header
+            const header = `\n// ${filePath}`;
+            const headerCost = Math.ceil(header.length / 4);
+            if (currentTokens + headerCost > tokenBudget)
+                break;
+            lines.push(header);
+            currentTokens += headerCost;
+            // Sort nodes within file by line number
+            nodes.sort((a, b) => a.node.startLine - b.node.startLine);
+            for (const { node } of nodes) {
+                // Build the entry
+                let entry = '';
+                // Add a brief doc comment if available
+                if (node.docComment) {
+                    const firstLine = node.docComment.split('\n')[0].trim();
+                    if (firstLine.length <= 80) {
+                        entry += `  /** ${firstLine} */\n`;
+                    }
+                }
+                // Indent methods/properties (nested under class)
+                const indent = node.qualifiedName.includes('.') ? '  ' : '';
+                entry += `${indent}${node.signature}`;
+                const entryCost = Math.ceil(entry.length / 4);
+                if (currentTokens + entryCost > tokenBudget)
+                    continue;
+                lines.push(entry);
+                currentTokens += entryCost;
+            }
+        }
+        return lines.join('\n').trim();
+    }
+    /**
+     * 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 = 10) {
+        const scores = this.computePageRank();
+        const nodeIds = Array.from(scores.keys());
+        const allNodes = this.graph.getNodesByIds(nodeIds);
+        // Group by file
+        const fileNodes = new Map();
+        for (const node of allNodes) {
+            if (node.type === 'file')
+                continue;
+            const score = scores.get(node.id) ?? 0;
+            const group = fileNodes.get(node.filePath) ?? [];
+            group.push({ node, score });
+            fileNodes.set(node.filePath, group);
+        }
+        // Build TOC
+        const toc = new Map();
+        for (const [filePath, nodes] of fileNodes) {
+            // Sort by score, take top N
+            nodes.sort((a, b) => b.score - a.score);
+            const topNodes = nodes.slice(0, maxSymbolsPerFile);
+            toc.set(filePath, topNodes.map(n => n.node.signature));
+        }
+        return toc;
+    }
+}
+//# sourceMappingURL=pagerank.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank.js","sourceRoot":"","sources":["../../src/knowledge-graph/pagerank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAqCH,+DAA+D;AAC/D,YAAY;AACZ,+DAA+D;AAE/D,MAAM,cAAc,GAAmB;IACrC,aAAa,EAAE,IAAI;IACnB,aAAa,EAAE,GAAG;IAClB,OAAO,EAAE,IAAI;CACd,CAAC;AAEF;;;GAGG;AACH,MAAM,YAAY,GAA6B;IAC7C,KAAK,EAAE,GAAG;IACV,OAAO,EAAE,GAAG;IACZ,OAAO,EAAE,GAAG;IACZ,QAAQ,EAAE,GAAG;IACb,UAAU,EAAE,GAAG;IACf,IAAI,EAAE,GAAG;IACT,SAAS,EAAE,GAAG;IACd,SAAS,EAAE,GAAG;IACd,QAAQ,EAAE,GAAG;IACb,KAAK,EAAE,GAAG;IACV,UAAU,EAAE,GAAG;IACf,SAAS,EAAE,GAAG;CACf,CAAC;AAEF,+DAA+D;AAC/D,kBAAkB;AAClB,+DAA+D;AAE/D;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IACjB,KAAK,CAAiB;IACtB,MAAM,CAAiB;IACvB,KAAK,GAAyB,IAAI,CAAC;IAE3C,YAAY,KAAqB,EAAE,SAAkC,EAAE;QACrE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED,+DAA+D;IAC/D,sCAAsC;IACtC,+DAA+D;IAE/D;;;OAGG;IACK,gBAAgB;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpC,OAAO,GAAG,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;IACvE,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC5C,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,KAAK,WAAW,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,eAAe;QACb,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,+DAA+D;IAC/D,gCAAgC;IAChC,+DAA+D;IAE/D;;;;OAIG;IACK,kBAAkB,CACxB,OAAiB,EACjB,KAAkB;QAKlB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAgD,CAAC;QACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgD,CAAC;QAExE,mCAAmC;QACnC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,sBAAsB;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACzE,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ;gBAAE,SAAS,CAAC,kBAAkB;YAEjE,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;YAE9C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;YACrE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;QACtE,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,+DAA+D;IAC/D,oBAAoB;IACpB,+DAA+D;IAE/D;;;;;;OAMG;IACH,eAAe;QACb,oBAAoB;QACpB,IAAI,IAAI,CAAC,YAAY,EAAE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACtC,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAC3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,GAAG,EAAE,CAAC;QAE3C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEtE,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;QAE1B,8BAA8B;QAC9B,IAAI,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;QAC9B,CAAC;QAED,kBAAkB;QAClB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;YAC5D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC5C,IAAI,QAAQ,GAAG,CAAC,CAAC;YAEjB,uDAAuD;YACvD,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACnC,WAAW,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,gCAAgC;gBAChC,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBAEvC,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;oBAC/C,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;oBACxC,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;oBAE7C,oCAAoC;oBACpC,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAC5E,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;wBACvB,YAAY,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,GAAG,cAAc,CAAC;oBAC1D,CAAC;gBACH,CAAC;gBAED,+CAA+C;gBAC/C,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC;gBACpE,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAE5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzD,IAAI,KAAK,GAAG,QAAQ;oBAAE,QAAQ,GAAG,KAAK,CAAC;YACzC,CAAC;YAED,MAAM,GAAG,SAAS,CAAC;YAEnB,oBAAoB;YACpB,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO;gBAAE,MAAM;QAC5C,CAAC;QAED,+BAA+B;QAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;gBACjC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,KAAK,GAAG;YACX,MAAM,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC;YACvB,SAAS,EAAE,IAAI,CAAC,gBAAgB,EAAE;YAClC,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE;SACvB,CAAC;QAEF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+DAA+D;IAC/D,wBAAwB;IACxB,+DAA+D;IAE/D;;;;;;;;;;OAUG;IACH,2BAA2B,CACzB,WAAqB,EACrB,aAAqB,GAAG;QAExB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAC3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,GAAG,EAAE,CAAC;QAE3C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEtE,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAEpC,+BAA+B;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;QAElD,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;YAC3C,MAAM,WAAW,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAErE,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;aAAM,CAAC;YACN,wCAAwC;YACxC,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;YAC1B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,gDAAgD;QAChD,IAAI,MAAM,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;QAEtC,uCAAuC;QACvC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;YAC5D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC5C,IAAI,QAAQ,GAAG,CAAC,CAAC;YAEjB,wBAAwB;YACxB,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACnC,WAAW,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBAEvC,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;oBAC/C,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;oBACxC,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;oBAC7C,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAC5E,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;wBACvB,YAAY,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,GAAG,cAAc,CAAC;oBAC1D,CAAC;gBACH,CAAC;gBAED,sFAAsF;gBACtF,MAAM,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBACpC,MAAM,eAAe,GAAG,WAAW,GAAG,EAAE,CAAC;gBACzC,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,YAAY,GAAG,eAAe,CAAC,CAAC;gBACrE,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAE5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzD,IAAI,KAAK,GAAG,QAAQ;oBAAE,QAAQ,GAAG,KAAK,CAAC;YACzC,CAAC;YAED,MAAM,GAAG,SAAS,CAAC;YACnB,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO;gBAAE,MAAM;QAC5C,CAAC;QAED,YAAY;QACZ,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;gBACjC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+DAA+D;IAC/D,yBAAyB;IACzB,+DAA+D;IAE/D;;;OAGG;IACK,qBAAqB,CAAC,IAAe;QAC3C,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC1B,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,oCAAoC;YACpC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,IAAI,SAAS,SAAS,KAAK,CAAC;QAClC,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CACT,QAAgB,EAAE,EAClB,eAAyB,CAAC,MAAM,CAAC;QAEjC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACtC,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;;OAOG;IACH,gBAAgB,CACd,WAAqB,EACrB,QAAgB,EAAE,EAClB,aAAqB,GAAG,EACxB,eAAyB,CAAC,MAAM,CAAC;QAEjC,MAAM,MAAM,GAAG,IAAI,CAAC,2BAA2B,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QACzE,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACK,SAAS,CACf,MAA2B,EAC3B,KAAa,EACb,YAAsB;QAEtB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QAEzC,2BAA2B;QAC3B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;aAC3C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAErB,MAAM,MAAM,GAAiB,EAAE,CAAC;QAEhC,wCAAwC;QACxC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,uCAAuC;QAChG,MAAM,YAAY,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;QACrD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnD,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,MAAM,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;YAElC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YAExC,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI;gBACJ,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE;gBACtB,SAAS,EAAE,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;aAC5C,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;OASG;IACH,oBAAoB,CAClB,WAAmB,EACnB,WAAsB,EACtB,eAAyB,CAAC,MAAM,CAAC;QAEjC,MAAM,MAAM,GAAG,WAAW,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;YAClD,CAAC,CAAC,IAAI,CAAC,2BAA2B,CAAC,WAAW,CAAC;YAC/C,CAAC,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;QAE3B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QAEzC,2BAA2B;QAC3B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;aAC3C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAErB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAChF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtD,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YAExC,MAAM,IAAI,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,UAAU,GAAG,IAAI,GAAG,WAAW,EAAE,CAAC;gBACpC,sCAAsC;gBACtC,IAAI,IAAI,GAAG,WAAW,GAAG,GAAG;oBAAE,SAAS;gBACvC,IAAI,UAAU,GAAG,IAAI,GAAG,WAAW;oBAAE,MAAM;YAC7C,CAAC;YAED,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI;gBACJ,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE;gBACtB,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;YACH,UAAU,IAAI,IAAI,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+DAA+D;IAC/D,sBAAsB;IACtB,+DAA+D;IAE/D;;;;;;;;;;OAUG;IACH,eAAe,CACb,WAAmB,EACnB,WAAsB;QAEtB,MAAM,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAExE,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,0CAA0C,CAAC;QACpD,CAAC;QAED,sBAAsB;QACtB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAwB,CAAC;QACnD,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACrD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;QAED,yCAAyC;QACzC,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;aACjD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACb,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACnD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACnD,OAAO,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC,CAAC,CAAC;QAEL,4BAA4B;QAC5B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5C,cAAc;YACd,MAAM,MAAM,GAAG,QAAQ,QAAQ,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAEhD,IAAI,aAAa,GAAG,UAAU,GAAG,WAAW;gBAAE,MAAM;YAEpD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,aAAa,IAAI,UAAU,CAAC;YAE5B,wCAAwC;YACxC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAE1D,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;gBAC7B,kBAAkB;gBAClB,IAAI,KAAK,GAAG,EAAE,CAAC;gBAEf,uCAAuC;gBACvC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;oBACpB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACxD,IAAI,SAAS,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;wBAC3B,KAAK,IAAI,SAAS,SAAS,OAAO,CAAC;oBACrC,CAAC;gBACH,CAAC;gBAED,iDAAiD;gBACjD,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5D,KAAK,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAEtC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAE9C,IAAI,aAAa,GAAG,SAAS,GAAG,WAAW;oBAAE,SAAS;gBAEtD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAClB,aAAa,IAAI,SAAS,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACH,aAAa,CAAC,oBAA4B,EAAE;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAEnD,gBAAgB;QAChB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAgD,CAAC;QAC1E,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,SAAS;YAEnC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YAC5B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACtC,CAAC;QAED,YAAY;QACZ,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;QACxC,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1C,4BAA4B;YAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;YACnD,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

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

@@ -0,0 +1,55 @@
+/**
+ * AI Mind Map — Tree-sitter AST Parser with Regex Fallback
+ *
+ * Extracts structural information (functions, classes, methods, interfaces,
+ * types, enums, constants, exports, imports) from source code files.
+ *
+ * Inspired by codebase-memory-mcp (158 languages) and Aider's repo map.
+ * Uses tree-sitter grammars for accurate parsing with a regex-based fallback
+ * when native bindings are unavailable or parsing fails.
+ */
+import type { GraphNode, GraphEdge } from '../types.js';
+/** Result of parsing a single file */
+export interface ParseResult {
+    filePath: string;
+    language: string;
+    nodes: GraphNode[];
+    edges: GraphEdge[];
+    parseErrors: string[];
+}
+/** Generate a unique deterministic ID for a node */
+export declare function generateNodeId(filePath: string, name: string, type: string): string;
+/** Generate a content hash for change detection */
+export declare function generateContentHash(content: string): string;
+/** Detect language from file extension */
+export declare function detectLanguage(filePath: string): string | null;
+/** Get all supported file extensions */
+export declare function getSupportedExtensions(): string[];
+/**
+ * Parse a source code file and extract its structural information.
+ *
+ * Attempts tree-sitter parsing first, falls back to regex if unavailable.
+ *
+ * @param filePath - Absolute path to the source file
+ * @param source - Optional pre-read source code (reads from disk if not provided)
+ * @returns ParseResult with extracted nodes, edges, and any parse errors
+ */
+export declare function parseFile(filePath: string, source?: string): Promise<ParseResult>;
+/**
+ * Parse multiple files concurrently in batches.
+ *
+ * @param files - Array of file paths to parse
+ * @param concurrency - Max concurrent parses (default 8)
+ * @param onProgress - Optional progress callback (current, total)
+ * @returns Array of ParseResults
+ */
+export declare function parseFiles(files: string[], concurrency?: number, onProgress?: (current: number, total: number) => void): Promise<ParseResult[]>;
+/**
+ * Check if a file extension is supported for parsing.
+ */
+export declare function isSupportedFile(filePath: string): boolean;
+/**
+ * Get the list of supported languages.
+ */
+export declare function getSupportedLanguages(): string[];
+//# sourceMappingURL=parser.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"parser.d.ts","sourceRoot":"","sources":["../../src/knowledge-graph/parser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH,OAAO,KAAK,EACV,SAAS,EACT,SAAS,EAIV,MAAM,aAAa,CAAC;AAuErB,sCAAsC;AACtC,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAMD,oDAAoD;AACpD,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAKnF;AAED,mDAAmD;AACnD,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED,0CAA0C;AAC1C,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAG9D;AAED,wCAAwC;AACxC,wBAAgB,sBAAsB,IAAI,MAAM,EAAE,CAEjD;AAg8BD;;;;;;;;GAQG;AACH,wBAAsB,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,CAmEvF;AAED;;;;;;;GAOG;AACH,wBAAsB,UAAU,CAC9B,KAAK,EAAE,MAAM,EAAE,EACf,WAAW,GAAE,MAAU,EACvB,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GACpD,OAAO,CAAC,WAAW,EAAE,CAAC,CAiBxB;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAEzD;AAED;;GAEG;AACH,wBAAgB,qBAAqB,IAAI,MAAM,EAAE,CAEhD"}