openlore 2.0.0

package/dist/core/analyzer/subgraph-extractor.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Subgraph Extractor
+ *
+ * For files that are too large to send as raw source to the LLM,
+ * extracts a compact call-graph neighborhood around "god functions"
+ * (high fan-out) and formats it as a structured prompt section.
+ *
+ * This dramatically reduces token usage while preserving structural
+ * information about complex orchestration code.
+ */
+import type { SerializedCallGraph, FunctionNode } from './call-graph.js';
+import type { FileSignatureMap } from './signature-extractor.js';
+export interface SubgraphOptions {
+    maxDepth?: number;
+    maxNodes?: number;
+    /** If provided, derive maxDepth/maxNodes from the token budget */
+    tokenBudget?: number;
+}
+/** Derive a reasonable maxDepth from a token budget (rough heuristic). */
+export declare function depthFromBudget(tokenBudget: number): number;
+export interface SubGraphNode {
+    name: string;
+    file: string;
+    fanIn: number;
+    fanOut: number;
+}
+export interface SubGraph {
+    root: SubGraphNode;
+    /** Callee nodes reachable within MAX_DEPTH */
+    nodes: SubGraphNode[];
+    /** [callerName, calleeName] pairs */
+    edges: Array<[string, string]>;
+}
+/**
+ * Return all god functions (fanOut >= threshold) defined in a given file.
+ * Normalises path separators for cross-platform matching.
+ */
+export declare function getFileGodFunctions(callGraph: SerializedCallGraph, filePath: string, fanOutThreshold?: number): FunctionNode[];
+/**
+ * Extract a depth-limited subgraph around a root node.
+ * Only follows outgoing (callee) edges.
+ */
+export declare function extractSubgraph(callGraph: SerializedCallGraph, root: FunctionNode, options?: SubgraphOptions): SubGraph;
+/**
+ * Build a graph-based prompt section for a large file.
+ *
+ * Returns null if no call-graph data is available for the file,
+ * signalling the caller to fall back to raw source chunking.
+ */
+export declare function buildGraphPromptSection(callGraph: SerializedCallGraph | undefined, signatures: FileSignatureMap[] | undefined, filePath: string, tokenBudget?: number): string | null;
+//# sourceMappingURL=subgraph-extractor.d.ts.map

package/dist/core/analyzer/subgraph-extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgraph-extractor.d.ts","sourceRoot":"","sources":["../../../src/core/analyzer/subgraph-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACzE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAYjE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,kEAAkE;IAClE,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,0EAA0E;AAC1E,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CAM3D;AAMD,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,YAAY,CAAC;IACnB,8CAA8C;IAC9C,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,qCAAqC;IACrC,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CAChC;AAMD;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,mBAAmB,EAC9B,QAAQ,EAAE,MAAM,EAChB,eAAe,SAAuB,GACrC,YAAY,EAAE,CAKhB;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,mBAAmB,EAC9B,IAAI,EAAE,YAAY,EAClB,OAAO,GAAE,eAAoB,GAC5B,QAAQ,CAiDV;AA+BD;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,SAAS,EAAE,mBAAmB,GAAG,SAAS,EAC1C,UAAU,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC1C,QAAQ,EAAE,MAAM,EAChB,WAAW,CAAC,EAAE,MAAM,GACnB,MAAM,GAAG,IAAI,CAiCf"}

package/dist/core/analyzer/subgraph-extractor.js

@@ -0,0 +1,147 @@
+/**
+ * Subgraph Extractor
+ *
+ * For files that are too large to send as raw source to the LLM,
+ * extracts a compact call-graph neighborhood around "god functions"
+ * (high fan-out) and formats it as a structured prompt section.
+ *
+ * This dramatically reduces token usage while preserving structural
+ * information about complex orchestration code.
+ */
+// Fan-out threshold for god-function detection (matches refactor-analyzer.ts)
+const GOD_FANOUT_THRESHOLD = 8;
+// Default max graph depth and nodes per subgraph
+const DEFAULT_MAX_DEPTH = 2;
+const DEFAULT_MAX_NODES = 30;
+/** Approx tokens per node in the prompt section (name + file + stats) */
+const TOKENS_PER_NODE = 20;
+/** Derive a reasonable maxDepth from a token budget (rough heuristic). */
+export function depthFromBudget(tokenBudget) {
+    // At depth=1: ~10 nodes avg, depth=2: ~30, depth=3: ~90
+    const maxNodes = Math.floor(tokenBudget / TOKENS_PER_NODE);
+    if (maxNodes <= 10)
+        return 1;
+    if (maxNodes <= 30)
+        return 2;
+    return 3;
+}
+// ============================================================================
+// CORE FUNCTIONS
+// ============================================================================
+/**
+ * Return all god functions (fanOut >= threshold) defined in a given file.
+ * Normalises path separators for cross-platform matching.
+ */
+export function getFileGodFunctions(callGraph, filePath, fanOutThreshold = GOD_FANOUT_THRESHOLD) {
+    const normalised = filePath.replace(/\\/g, '/');
+    return callGraph.nodes.filter(n => n.filePath.replace(/\\/g, '/').endsWith(normalised) && n.fanOut >= fanOutThreshold);
+}
+/**
+ * Extract a depth-limited subgraph around a root node.
+ * Only follows outgoing (callee) edges.
+ */
+export function extractSubgraph(callGraph, root, options = {}) {
+    const maxDepth = options.tokenBudget !== undefined
+        ? depthFromBudget(options.tokenBudget)
+        : (options.maxDepth ?? DEFAULT_MAX_DEPTH);
+    const maxNodes = options.tokenBudget !== undefined
+        ? Math.floor(options.tokenBudget / TOKENS_PER_NODE)
+        : (options.maxNodes ?? DEFAULT_MAX_NODES);
+    const nodeMap = new Map(callGraph.nodes.map(n => [n.id, n]));
+    const visited = new Set();
+    const resultNodes = [];
+    const edges = [];
+    function visit(nodeId, depth) {
+        if (visited.has(nodeId) || depth > maxDepth || visited.size >= maxNodes)
+            return;
+        visited.add(nodeId);
+        const outgoing = callGraph.edges.filter(e => e.callerId === nodeId && e.calleeId);
+        for (const edge of outgoing) {
+            const callerNode = nodeMap.get(edge.callerId);
+            const calleeNode = nodeMap.get(edge.calleeId);
+            if (!callerNode || !calleeNode)
+                continue;
+            edges.push([callerNode.name, calleeNode.name]);
+            if (!visited.has(edge.calleeId)) {
+                resultNodes.push({
+                    name: calleeNode.name,
+                    file: calleeNode.filePath,
+                    fanIn: calleeNode.fanIn,
+                    fanOut: calleeNode.fanOut,
+                });
+                visit(edge.calleeId, depth + 1);
+            }
+        }
+    }
+    visit(root.id, 0);
+    return {
+        root: {
+            name: root.name,
+            file: root.filePath,
+            fanIn: root.fanIn,
+            fanOut: root.fanOut,
+        },
+        nodes: resultNodes,
+        edges,
+    };
+}
+/**
+ * Format a single subgraph as a compact ASCII block for LLM prompts.
+ *
+ * Example output:
+ *   run (fanIn=0, fanOut=12)
+ *     → runStage1, runStage2, runStage3 ...
+ */
+function formatSubgraph(sub) {
+    const lines = [];
+    lines.push(`${sub.root.name} (fanIn=${sub.root.fanIn}, fanOut=${sub.root.fanOut})`);
+    // Direct callees of root
+    const directCallees = sub.edges
+        .filter(([from]) => from === sub.root.name)
+        .map(([, to]) => to);
+    if (directCallees.length > 0) {
+        lines.push(`  → ${directCallees.join(', ')}`);
+    }
+    // Second-level callees
+    const secondLevel = sub.edges.filter(([from]) => from !== sub.root.name);
+    for (const [from, to] of secondLevel) {
+        lines.push(`    ${from} → ${to}`);
+    }
+    return lines.join('\n');
+}
+/**
+ * Build a graph-based prompt section for a large file.
+ *
+ * Returns null if no call-graph data is available for the file,
+ * signalling the caller to fall back to raw source chunking.
+ */
+export function buildGraphPromptSection(callGraph, signatures, filePath, tokenBudget) {
+    if (!callGraph)
+        return null;
+    const godFunctions = getFileGodFunctions(callGraph, filePath);
+    // No god functions means the graph adds little value; let caller chunk normally
+    if (godFunctions.length === 0)
+        return null;
+    const lines = [
+        `[Graph-based analysis — file too large to include full source]`,
+        '',
+    ];
+    // Signatures for this file (from signature-extractor)
+    const sigMap = signatures?.find(s => s.path.replace(/\\/g, '/').endsWith(filePath.replace(/\\/g, '/')));
+    if (sigMap && sigMap.entries.length > 0) {
+        lines.push('Signatures:');
+        for (const entry of sigMap.entries) {
+            const doc = entry.docstring ? `  // ${entry.docstring}` : '';
+            lines.push(`  ${entry.signature}${doc}`);
+        }
+        lines.push('');
+    }
+    // Subgraphs for each god function
+    lines.push(`High-complexity functions (fanOut >= ${GOD_FANOUT_THRESHOLD}):`);
+    for (const godFn of godFunctions) {
+        const sub = extractSubgraph(callGraph, godFn, tokenBudget !== undefined ? { tokenBudget } : {});
+        lines.push(formatSubgraph(sub));
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=subgraph-extractor.js.map

package/dist/core/analyzer/subgraph-extractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgraph-extractor.js","sourceRoot":"","sources":["../../../src/core/analyzer/subgraph-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH,8EAA8E;AAC9E,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAE/B,iDAAiD;AACjD,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAE7B,yEAAyE;AACzE,MAAM,eAAe,GAAG,EAAE,CAAC;AAS3B,0EAA0E;AAC1E,MAAM,UAAU,eAAe,CAAC,WAAmB;IACjD,wDAAwD;IACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,eAAe,CAAC,CAAC;IAC3D,IAAI,QAAQ,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IAC7B,IAAI,QAAQ,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IAC7B,OAAO,CAAC,CAAC;AACX,CAAC;AAqBD,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CACjC,SAA8B,EAC9B,QAAgB,EAChB,eAAe,GAAG,oBAAoB;IAEtC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAChD,OAAO,SAAS,CAAC,KAAK,CAAC,MAAM,CAC3B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,eAAe,CACxF,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,SAA8B,EAC9B,IAAkB,EAClB,UAA2B,EAAE;IAE7B,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,KAAK,SAAS;QAChD,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,WAAW,CAAC;QACtC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,IAAI,iBAAiB,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,KAAK,SAAS;QAChD,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,GAAG,eAAe,CAAC;QACnD,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,IAAI,iBAAiB,CAAC,CAAC;IAE5C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAuB,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,WAAW,GAAmB,EAAE,CAAC;IACvC,MAAM,KAAK,GAA4B,EAAE,CAAC;IAE1C,SAAS,KAAK,CAAC,MAAc,EAAE,KAAa;QAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,IAAI,IAAI,QAAQ;YAAE,OAAO;QAChF,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC;QAClF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC9C,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC9C,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU;gBAAE,SAAS;YAEzC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;YAE/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,WAAW,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,IAAI,EAAE,UAAU,CAAC,QAAQ;oBACzB,KAAK,EAAE,UAAU,CAAC,KAAK;oBACvB,MAAM,EAAE,UAAU,CAAC,MAAM;iBAC1B,CAAC,CAAC;gBACH,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAElB,OAAO;QACL,IAAI,EAAE;YACJ,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB;QACD,KAAK,EAAE,WAAW;QAClB,KAAK;KACN,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,GAAa;IACnC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,WAAW,GAAG,CAAC,IAAI,CAAC,KAAK,YAAY,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAEpF,yBAAyB;IACzB,MAAM,aAAa,GAAG,GAAG,CAAC,KAAK;SAC5B,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;SAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAEvB,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,OAAO,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,uBAAuB;IACvB,MAAM,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzE,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC;QACrC,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM,EAAE,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CACrC,SAA0C,EAC1C,UAA0C,EAC1C,QAAgB,EAChB,WAAoB;IAEpB,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5B,MAAM,YAAY,GAAG,mBAAmB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAE9D,gFAAgF;IAChF,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAE3C,MAAM,KAAK,GAAa;QACtB,gEAAgE;QAChE,EAAE;KACH,CAAC;IAEF,sDAAsD;IACtD,MAAM,MAAM,GAAG,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAClC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAClE,CAAC;IACF,IAAI,MAAM,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7D,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,kCAAkC;IAClC,KAAK,CAAC,IAAI,CAAC,wCAAwC,oBAAoB,IAAI,CAAC,CAAC;IAC7E,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,eAAe,CAAC,SAAS,EAAE,KAAK,EAAE,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/core/analyzer/type-inference-engine.d.ts

@@ -0,0 +1,23 @@
+/**
+ * TypeInferenceEngine — lightweight regex-based type inference for 7 languages.
+ *
+ * Given the source text of a single function body, returns a map of
+ * { variableName → className } inferred from declarations, annotations,
+ * and constructor calls.
+ *
+ * Intentionally NOT a full type system — false positives are acceptable;
+ * false negatives (missing resolutions) are the only cost.  Only class names
+ * starting with an uppercase letter are tracked (conventional in all supported
+ * languages), which eliminates most false positives from primitive types.
+ */
+import type { FunctionRegistryTrie } from './function-registry-trie.js';
+import type { FunctionNode } from './call-graph.js';
+/** variableName → className */
+export type InferredTypes = Map<string, string>;
+export declare function inferTypesFromSource(source: string, language: string): InferredTypes;
+/**
+ * Given a receiver variable name and a method name, look up the inferred type
+ * of the receiver and resolve the method to a FunctionNode via the trie.
+ */
+export declare function resolveViaTypeInference(calleeObject: string, calleeName: string, inferredTypes: InferredTypes, trie: FunctionRegistryTrie): FunctionNode | undefined;
+//# sourceMappingURL=type-inference-engine.d.ts.map

package/dist/core/analyzer/type-inference-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-inference-engine.d.ts","sourceRoot":"","sources":["../../../src/core/analyzer/type-inference-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AACxE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEpD,+BAA+B;AAC/B,MAAM,MAAM,aAAa,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEhD,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,aAAa,CAYpF;AAyGD;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,aAAa,EAAE,aAAa,EAC5B,IAAI,EAAE,oBAAoB,GACzB,YAAY,GAAG,SAAS,CAI1B"}

package/dist/core/analyzer/type-inference-engine.js

@@ -0,0 +1,130 @@
+/**
+ * TypeInferenceEngine — lightweight regex-based type inference for 7 languages.
+ *
+ * Given the source text of a single function body, returns a map of
+ * { variableName → className } inferred from declarations, annotations,
+ * and constructor calls.
+ *
+ * Intentionally NOT a full type system — false positives are acceptable;
+ * false negatives (missing resolutions) are the only cost.  Only class names
+ * starting with an uppercase letter are tracked (conventional in all supported
+ * languages), which eliminates most false positives from primitive types.
+ */
+export function inferTypesFromSource(source, language) {
+    switch (language) {
+        case 'Python': return inferPython(source);
+        case 'C++': return inferCpp(source);
+        case 'TypeScript':
+        case 'JavaScript': return inferTypeScript(source);
+        case 'Go': return inferGo(source);
+        case 'Rust': return inferRust(source);
+        case 'Java': return inferJava(source);
+        case 'Ruby': return inferRuby(source);
+        default: return new Map();
+    }
+}
+// ---------------------------------------------------------------------------
+// Per-language inference rules
+// ---------------------------------------------------------------------------
+function inferPython(source) {
+    const result = new Map();
+    // var = ClassName(...)
+    for (const m of source.matchAll(/^\s*(\w+)\s*=\s*([A-Z]\w*)\s*\(/gm))
+        result.set(m[1], m[2]);
+    // var: ClassName = ...
+    for (const m of source.matchAll(/^\s*(\w+)\s*:\s*([A-Z]\w*)\s*=/gm))
+        result.set(m[1], m[2]);
+    // param: ClassName in signatures
+    for (const m of source.matchAll(/\b(\w+)\s*:\s*([A-Z]\w*)\b/g))
+        result.set(m[1], m[2]);
+    return result;
+}
+function inferCpp(source) {
+    const result = new Map();
+    // ClassName var;  or  ClassName var(...)
+    for (const m of source.matchAll(/\b([A-Z]\w*)\s+(\w+)\s*[;({]/g))
+        result.set(m[2], m[1]);
+    // ClassName* var = new ClassName(...)
+    for (const m of source.matchAll(/\b([A-Z]\w*)\s*\*\s*(\w+)\s*=\s*new\s+\1/g))
+        result.set(m[2], m[1]);
+    // auto var = make_shared<ClassName>(...)  /  make_unique<ClassName>(...)
+    for (const m of source.matchAll(/auto\s+(\w+)\s*=\s*(?:make_shared|make_unique)<([A-Z]\w*)>/g))
+        result.set(m[1], m[2]);
+    // shared_ptr<ClassName> var  /  unique_ptr  /  weak_ptr
+    for (const m of source.matchAll(/(?:shared_ptr|unique_ptr|weak_ptr)<([A-Z]\w*)>\s+(\w+)/g))
+        result.set(m[2], m[1]);
+    return result;
+}
+function inferTypeScript(source) {
+    const result = new Map();
+    // const var = new ClassName(...)
+    for (const m of source.matchAll(/\bconst\s+(\w+)\s*=\s*new\s+([A-Z]\w*)\s*\(/g))
+        result.set(m[1], m[2]);
+    // let/var/const var: ClassName =
+    for (const m of source.matchAll(/\b(?:let|var|const)\s+(\w+)\s*:\s*([A-Z]\w*)\s*=/g))
+        result.set(m[1], m[2]);
+    // param: ClassName in signatures
+    for (const m of source.matchAll(/\b(\w+)\s*:\s*([A-Z]\w*)\b/g))
+        result.set(m[1], m[2]);
+    return result;
+}
+function inferGo(source) {
+    const result = new Map();
+    // var svc *MyService
+    for (const m of source.matchAll(/\bvar\s+(\w+)\s+\*?([A-Z]\w*)\b/g))
+        result.set(m[1], m[2]);
+    // svc := MyService{...}  or  NewMyService(...)
+    for (const m of source.matchAll(/\b(\w+)\s*:=\s*(?:New)?([A-Z]\w*)[{(]/g))
+        result.set(m[1], m[2]);
+    // svc := &MyService{...}
+    for (const m of source.matchAll(/\b(\w+)\s*:=\s*&([A-Z]\w*)\s*{/g))
+        result.set(m[1], m[2]);
+    // func f(svc *MyService) — parameter annotations
+    for (const m of source.matchAll(/\b(\w+)\s+\*?([A-Z]\w*)\b/g))
+        result.set(m[1], m[2]);
+    return result;
+}
+function inferRust(source) {
+    const result = new Map();
+    // let svc: MyService = ...
+    for (const m of source.matchAll(/\blet\s+(?:mut\s+)?(\w+)\s*:\s*([A-Z]\w*)\b/g))
+        result.set(m[1], m[2]);
+    // let svc = MyService::new(...)  /  MyService::default()
+    for (const m of source.matchAll(/\blet\s+(?:mut\s+)?(\w+)\s*=\s*([A-Z]\w*)::(?:new|default)\s*\(/g))
+        result.set(m[1], m[2]);
+    // let svc = Box::new(MyService::new(...))
+    for (const m of source.matchAll(/\blet\s+(?:mut\s+)?(\w+)\s*=\s*Box::new\(([A-Z]\w*)::new/g))
+        result.set(m[1], m[2]);
+    return result;
+}
+function inferJava(source) {
+    const result = new Map();
+    // ClassName var = ...  or  ClassName var;
+    for (const m of source.matchAll(/\b([A-Z]\w*)\s+(\w+)\s*(?:=|;)/g))
+        result.set(m[2], m[1]);
+    // Interface var = new ConcreteClass(...)  — prefer the concrete type
+    for (const m of source.matchAll(/\b([A-Z]\w*)\s+(\w+)\s*=\s*new\s+([A-Z]\w*)\s*\(/g))
+        result.set(m[2], m[3]);
+    return result;
+}
+function inferRuby(source) {
+    const result = new Map();
+    // svc = MyClass.new(...)
+    for (const m of source.matchAll(/\b(\w+)\s*=\s*([A-Z]\w*)\.new\b/g))
+        result.set(m[1], m[2]);
+    return result;
+}
+// ---------------------------------------------------------------------------
+// Common resolution helper
+// ---------------------------------------------------------------------------
+/**
+ * Given a receiver variable name and a method name, look up the inferred type
+ * of the receiver and resolve the method to a FunctionNode via the trie.
+ */
+export function resolveViaTypeInference(calleeObject, calleeName, inferredTypes, trie) {
+    const className = inferredTypes.get(calleeObject);
+    if (!className)
+        return undefined;
+    return trie.findByQualifiedName(className, calleeName)[0];
+}
+//# sourceMappingURL=type-inference-engine.js.map

package/dist/core/analyzer/type-inference-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-inference-engine.js","sourceRoot":"","sources":["../../../src/core/analyzer/type-inference-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAQH,MAAM,UAAU,oBAAoB,CAAC,MAAc,EAAE,QAAgB;IACnE,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,QAAQ,CAAC,CAAK,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC;QAC9C,KAAK,KAAK,CAAC,CAAQ,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC3C,KAAK,YAAY,CAAC;QAClB,KAAK,YAAY,CAAC,CAAC,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,CAAS,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC;QAC1C,KAAK,MAAM,CAAC,CAAO,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC;QAC5C,KAAK,MAAM,CAAC,CAAO,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC;QAC5C,KAAK,MAAM,CAAC,CAAO,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC;QAC5C,OAAO,CAAC,CAAW,OAAO,IAAI,GAAG,EAAE,CAAC;IACtC,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,+BAA+B;AAC/B,8EAA8E;AAE9E,SAAS,WAAW,CAAC,MAAc;IACjC,MAAM,MAAM,GAAkB,IAAI,GAAG,EAAE,CAAC;IACxC,uBAAuB;IACvB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,mCAAmC,CAAC;QAClE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,uBAAuB;IACvB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,kCAAkC,CAAC;QACjE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,iCAAiC;IACjC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,6BAA6B,CAAC;QAC5D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,QAAQ,CAAC,MAAc;IAC9B,MAAM,MAAM,GAAkB,IAAI,GAAG,EAAE,CAAC;IACxC,yCAAyC;IACzC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,+BAA+B,CAAC;QAC9D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,sCAAsC;IACtC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,2CAA2C,CAAC;QAC1E,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,yEAAyE;IACzE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,6DAA6D,CAAC;QAC5F,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,wDAAwD;IACxD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,yDAAyD,CAAC;QACxF,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,eAAe,CAAC,MAAc;IACrC,MAAM,MAAM,GAAkB,IAAI,GAAG,EAAE,CAAC;IACxC,iCAAiC;IACjC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,8CAA8C,CAAC;QAC7E,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,iCAAiC;IACjC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,mDAAmD,CAAC;QAClF,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,iCAAiC;IACjC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,6BAA6B,CAAC;QAC5D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,OAAO,CAAC,MAAc;IAC7B,MAAM,MAAM,GAAkB,IAAI,GAAG,EAAE,CAAC;IACxC,qBAAqB;IACrB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,kCAAkC,CAAC;QACjE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,+CAA+C;IAC/C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,wCAAwC,CAAC;QACvE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,yBAAyB;IACzB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,iCAAiC,CAAC;QAChE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,iDAAiD;IACjD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,4BAA4B,CAAC;QAC3D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,MAAM,GAAkB,IAAI,GAAG,EAAE,CAAC;IACxC,2BAA2B;IAC3B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,8CAA8C,CAAC;QAC7E,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,yDAAyD;IACzD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,kEAAkE,CAAC;QACjG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,0CAA0C;IAC1C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,2DAA2D,CAAC;QAC1F,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,MAAM,GAAkB,IAAI,GAAG,EAAE,CAAC;IACxC,0CAA0C;IAC1C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,iCAAiC,CAAC;QAChE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,qEAAqE;IACrE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,mDAAmD,CAAC;QAClF,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,MAAM,GAAkB,IAAI,GAAG,EAAE,CAAC;IACxC,yBAAyB;IACzB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,kCAAkC,CAAC;QACjE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,2BAA2B;AAC3B,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,YAAoB,EACpB,UAAkB,EAClB,aAA4B,EAC5B,IAA0B;IAE1B,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAClD,IAAI,CAAC,SAAS;QAAE,OAAO,SAAS,CAAC;IACjC,OAAO,IAAI,CAAC,mBAAmB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC"}

package/dist/core/analyzer/ui-component-extractor.d.ts

@@ -0,0 +1,43 @@
+/**
+ * UI Component Extractor
+ *
+ * Detects React, Vue, Svelte, and Angular UI components from source files
+ * using regex-based analysis (no tree-sitter required).
+ *
+ * Detection strategy per framework:
+ *   - React: function/const export with PascalCase name in JSX/TSX files
+ *   - Vue: Single File Components (.vue) with <template> blocks
+ *   - Svelte: .svelte files (each file = one component)
+ *   - Angular: @Component decorator
+ */
+export interface ComponentProp {
+    name: string;
+    type: string;
+    required: boolean;
+}
+export interface UIComponent {
+    /** PascalCase component name */
+    name: string;
+    /** Path relative to project root */
+    file: string;
+    /** UI framework */
+    framework: 'react' | 'vue' | 'svelte' | 'angular';
+    /** Whether this is the default export */
+    isDefault: boolean;
+    /** 1-based line number of the declaration */
+    line: number;
+    /** Extracted props (up to MAX_PROPS) */
+    props: ComponentProp[];
+}
+/**
+ * Extract UI components from a list of absolute file paths.
+ *
+ * @param filePaths - Absolute paths to source files
+ * @param rootDir   - Project root used to compute relative paths in output
+ */
+export declare function extractUIComponents(filePaths: string[], rootDir: string): Promise<UIComponent[]>;
+/**
+ * Summarise components by framework for display / artifact embedding.
+ */
+export declare function summarizeUIComponents(components: UIComponent[]): Record<string, number>;
+//# sourceMappingURL=ui-component-extractor.d.ts.map

package/dist/core/analyzer/ui-component-extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ui-component-extractor.d.ts","sourceRoot":"","sources":["../../../src/core/analyzer/ui-component-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AASH,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,MAAM,WAAW,WAAW;IAC1B,gCAAgC;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,mBAAmB;IACnB,SAAS,EAAE,OAAO,GAAG,KAAK,GAAG,QAAQ,GAAG,SAAS,CAAC;IAClD,yCAAyC;IACzC,SAAS,EAAE,OAAO,CAAC;IACnB,6CAA6C;IAC7C,IAAI,EAAE,MAAM,CAAC;IACb,wCAAwC;IACxC,KAAK,EAAE,aAAa,EAAE,CAAC;CACxB;AAmOD;;;;;GAKG;AACH,wBAAsB,mBAAmB,CACvC,SAAS,EAAE,MAAM,EAAE,EACnB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,WAAW,EAAE,CAAC,CAUxB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,WAAW,EAAE,GACxB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAMxB"}