lsp-intelligence 0.1.2 → 0.2.1

package/dist/search/ranking/coalesceCandidates.js

@@ -0,0 +1,48 @@
+/**
+ * Coalesce candidates that represent the same logical match.
+ * Merges doc + declaration, usage + pattern, etc. at the same location/symbol.
+ *
+ * This runs after retriever merge and before ranking, preventing
+ * duplicate entries for the same symbol from different retriever types.
+ */
+export function coalesceCandidates(candidates) {
+    const coalesced = new Map();
+    for (const c of candidates) {
+        const key = coalesceKey(c);
+        const existing = coalesced.get(key);
+        if (existing) {
+            // Merge: keep the higher score, combine evidence and sources
+            existing.score = Math.max(existing.score, c.score) + 2; // coalesce bonus
+            existing.evidence.push(...c.evidence, `coalesced: ${c.candidateType}`);
+            for (const s of c.sources) {
+                if (!existing.sources.includes(s))
+                    existing.sources.push(s);
+            }
+            // Prefer longer snippet/context
+            if (c.snippet && (!existing.snippet || c.snippet.length > existing.snippet.length)) {
+                existing.snippet = c.snippet;
+                existing.context = c.context;
+            }
+            // Prefer declaration type over doc type
+            if (c.candidateType === 'declaration' && existing.candidateType === 'doc') {
+                existing.candidateType = 'declaration';
+                existing.kind = c.kind;
+            }
+        }
+        else {
+            coalesced.set(key, { ...c });
+        }
+    }
+    return [...coalesced.values()];
+}
+/**
+ * Coalesce key: same file + same line (within 2 lines) + same symbol.
+ * Does NOT include candidateType — that's the whole point.
+ */
+function coalesceKey(c) {
+    // Round line to nearest 2 to catch doc comments 1-2 lines above the declaration
+    const roundedLine = Math.floor(c.line / 3) * 3;
+    const symbol = c.symbol ?? c.matchedIdentifier ?? '';
+    return `${c.filePath}:${roundedLine}:${symbol}`;
+}
+//# sourceMappingURL=coalesceCandidates.js.map

package/dist/search/ranking/coalesceCandidates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coalesceCandidates.js","sourceRoot":"","sources":["../../../src/search/ranking/coalesceCandidates.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAA2B;IAC5D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEnD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEpC,IAAI,QAAQ,EAAE,CAAC;YACb,6DAA6D;YAC7D,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,iBAAiB;YACzE,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;YACvE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC1B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;YACD,gCAAgC;YAChC,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnF,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;gBAC7B,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;YAC/B,CAAC;YACD,wCAAwC;YACxC,IAAI,CAAC,CAAC,aAAa,KAAK,aAAa,IAAI,QAAQ,CAAC,aAAa,KAAK,KAAK,EAAE,CAAC;gBAC1E,QAAQ,CAAC,aAAa,GAAG,aAAa,CAAC;gBACvC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;YACzB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,CAAgB;IACnC,gFAAgF;IAChF,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,iBAAiB,IAAI,EAAE,CAAC;IACrD,OAAO,GAAG,CAAC,CAAC,QAAQ,IAAI,WAAW,IAAI,MAAM,EAAE,CAAC;AAClD,CAAC"}

package/dist/search/ranking/fieldedTextRanker.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Fielded text scorer — lightweight BM25-inspired local ranker.
+ * Scores documents with multiple named fields against query tokens.
+ */
+export interface FieldedDocument {
+    id: string;
+    fields: Record<string, string[]>;
+}
+export interface FieldedScore {
+    id: string;
+    score: number;
+    evidence: string[];
+}
+export interface FieldWeights {
+    symbol: number;
+    path: number;
+    docs: number;
+    tests: number;
+    config?: number;
+}
+/**
+ * Score query tokens against fielded documents.
+ * Uses a simplified BM25-like scoring: term frequency within fields,
+ * weighted by field importance, with length normalization.
+ */
+export declare function scoreFieldedQuery(queryTokens: string[], docs: FieldedDocument[], weights?: Partial<FieldWeights>, limit?: number): FieldedScore[];

package/dist/search/ranking/fieldedTextRanker.js

@@ -0,0 +1,79 @@
+/**
+ * Fielded text scorer — lightweight BM25-inspired local ranker.
+ * Scores documents with multiple named fields against query tokens.
+ */
+const DEFAULT_WEIGHTS = {
+    symbol: 8,
+    path: 3,
+    docs: 5,
+    tests: 4,
+    config: 3,
+};
+/**
+ * Score query tokens against fielded documents.
+ * Uses a simplified BM25-like scoring: term frequency within fields,
+ * weighted by field importance, with length normalization.
+ */
+export function scoreFieldedQuery(queryTokens, docs, weights, limit = 100) {
+    const w = { ...DEFAULT_WEIGHTS, ...weights };
+    const results = [];
+    // Compute average field lengths for normalization
+    const avgLengths = {};
+    const fieldNames = new Set();
+    for (const doc of docs) {
+        for (const [field, tokens] of Object.entries(doc.fields)) {
+            fieldNames.add(field);
+            avgLengths[field] = (avgLengths[field] ?? 0) + tokens.length;
+        }
+    }
+    for (const field of fieldNames) {
+        avgLengths[field] = docs.length > 0 ? avgLengths[field] / docs.length : 1;
+    }
+    // IDF: tokens that appear in fewer docs are more valuable
+    const docFreq = {};
+    for (const tok of queryTokens) {
+        docFreq[tok] = 0;
+        for (const doc of docs) {
+            const allTokens = Object.values(doc.fields).flat();
+            if (allTokens.some((t) => t === tok || t.startsWith(tok) || tok.startsWith(t))) {
+                docFreq[tok]++;
+            }
+        }
+    }
+    const N = docs.length || 1;
+    for (const doc of docs) {
+        let totalScore = 0;
+        const evidence = [];
+        for (const tok of queryTokens) {
+            const idf = Math.log((N - docFreq[tok] + 0.5) / (docFreq[tok] + 0.5) + 1);
+            for (const [field, tokens] of Object.entries(doc.fields)) {
+                const fieldWeight = w[field] ?? 1;
+                const avgLen = avgLengths[field] || 1;
+                const k1 = 1.2;
+                const b = 0.75;
+                // Count matches (exact + prefix)
+                let tf = 0;
+                for (const t of tokens) {
+                    if (t === tok)
+                        tf += 1;
+                    else if (t.startsWith(tok) || tok.startsWith(t))
+                        tf += 0.5;
+                }
+                if (tf === 0)
+                    continue;
+                // BM25 TF component with length normalization
+                const lenNorm = 1 - b + b * (tokens.length / avgLen);
+                const tfScore = (tf * (k1 + 1)) / (tf + k1 * lenNorm);
+                const fieldScore = idf * tfScore * fieldWeight;
+                totalScore += fieldScore;
+                evidence.push(`${field}:${tok}(${fieldScore.toFixed(1)})`);
+            }
+        }
+        if (totalScore > 0) {
+            results.push({ id: doc.id, score: totalScore, evidence });
+        }
+    }
+    results.sort((a, b) => b.score - a.score);
+    return results.slice(0, limit);
+}
+//# sourceMappingURL=fieldedTextRanker.js.map

package/dist/search/ranking/fieldedTextRanker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fieldedTextRanker.js","sourceRoot":"","sources":["../../../src/search/ranking/fieldedTextRanker.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAqBH,MAAM,eAAe,GAAiB;IACpC,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC;IACR,MAAM,EAAE,CAAC;CACV,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,WAAqB,EACrB,IAAuB,EACvB,OAA+B,EAC/B,QAAgB,GAAG;IAEnB,MAAM,CAAC,GAAiB,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;IAC3D,MAAM,OAAO,GAAmB,EAAE,CAAC;IAEnC,kDAAkD;IAClD,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzD,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACtB,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAC/D,CAAC;IACH,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,UAAU,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED,0DAA0D;IAC1D,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YACnD,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/E,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAE3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAE1E,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzD,MAAM,WAAW,GAAI,CAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACtC,MAAM,EAAE,GAAG,GAAG,CAAC;gBACf,MAAM,CAAC,GAAG,IAAI,CAAC;gBAEf,iCAAiC;gBACjC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACX,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;oBACvB,IAAI,CAAC,KAAK,GAAG;wBAAE,EAAE,IAAI,CAAC,CAAC;yBAClB,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;wBAAE,EAAE,IAAI,GAAG,CAAC;gBAC7D,CAAC;gBAED,IAAI,EAAE,KAAK,CAAC;oBAAE,SAAS;gBAEvB,8CAA8C;gBAC9C,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;gBACrD,MAAM,OAAO,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC,CAAC;gBACtD,MAAM,UAAU,GAAG,GAAG,GAAG,OAAO,GAAG,WAAW,CAAC;gBAE/C,UAAU,IAAI,UAAU,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACjC,CAAC"}

package/dist/search/ranking/mergeCandidates.d.ts

@@ -0,0 +1,13 @@
+import type { CodeCandidate } from '../types.js';
+/**
+ * Merge candidates from all retrievers, deduplicating by match identity.
+ * Overlapping candidates get a score boost.
+ */
+export declare function mergeCandidates(inputs: {
+    behavior: CodeCandidate[];
+    identifier: CodeCandidate[];
+    structural: CodeCandidate[];
+    regex: CodeCandidate[];
+    doc: CodeCandidate[];
+    config: CodeCandidate[];
+}): CodeCandidate[];

package/dist/search/ranking/mergeCandidates.js

@@ -0,0 +1,85 @@
+import { candidateKey } from '../types.js';
+/**
+ * Merge candidates from all retrievers, deduplicating by match identity.
+ * Overlapping candidates get a score boost.
+ */
+export function mergeCandidates(inputs) {
+    const merged = new Map();
+    // Add behavior candidates
+    for (const c of inputs.behavior) {
+        merged.set(candidateKey(c), { ...c });
+    }
+    // Merge identifier candidates — boost on overlap
+    for (const c of inputs.identifier) {
+        const key = candidateKey(c);
+        const existing = merged.get(key);
+        if (existing) {
+            existing.score += c.score + 3; // overlap bonus
+            existing.evidence.push(...c.evidence, 'multi-retriever-overlap');
+            for (const s of c.sources) {
+                if (!existing.sources.includes(s))
+                    existing.sources.push(s);
+            }
+        }
+        else {
+            merged.set(key, { ...c });
+        }
+    }
+    // Merge structural candidates — boost on overlap
+    for (const c of inputs.structural) {
+        const key = candidateKey(c);
+        const existing = merged.get(key);
+        if (existing) {
+            existing.score += c.score + 3;
+            existing.evidence.push(...c.evidence, 'structural-overlap');
+            for (const s of c.sources) {
+                if (!existing.sources.includes(s))
+                    existing.sources.push(s);
+            }
+        }
+        else {
+            merged.set(key, { ...c });
+        }
+    }
+    // Merge regex candidates — boost on overlap
+    for (const c of inputs.regex) {
+        const key = candidateKey(c);
+        const existing = merged.get(key);
+        if (existing) {
+            existing.score += c.score + 2;
+            existing.evidence.push(...c.evidence, 'regex-overlap');
+            for (const s of c.sources) {
+                if (!existing.sources.includes(s))
+                    existing.sources.push(s);
+            }
+        }
+        else {
+            merged.set(key, { ...c });
+        }
+    }
+    // Merge doc candidates — boost on overlap with behavior/identifier
+    for (const c of inputs.doc) {
+        const key = candidateKey(c);
+        const existing = merged.get(key);
+        if (existing) {
+            existing.score += Math.round(c.score * 0.5) + 2; // lighter boost for doc overlap
+            existing.evidence.push(...c.evidence, 'doc-overlap');
+            for (const s of c.sources) {
+                if (!existing.sources.includes(s))
+                    existing.sources.push(s);
+            }
+        }
+        else {
+            merged.set(key, { ...c });
+        }
+    }
+    // Add config candidates (typically no overlap with code candidates)
+    for (const c of inputs.config) {
+        const key = candidateKey(c);
+        if (!merged.has(key)) {
+            merged.set(key, { ...c });
+        }
+    }
+    return [...merged.values()];
+}
+//# sourceMappingURL=mergeCandidates.js.map

package/dist/search/ranking/mergeCandidates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeCandidates.js","sourceRoot":"","sources":["../../../src/search/ranking/mergeCandidates.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE3C;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,MAO/B;IACC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEhD,0BAA0B;IAC1B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,iDAAiD;IACjD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,gBAAgB;YAC/C,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,yBAAyB,CAAC,CAAC;YACjE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC1B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;YAC9B,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC;YAC5D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC1B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;YAC9B,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;YACvD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC1B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,mEAAmE;IACnE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,gCAAgC;YACjF,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;YACrD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC1B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;AAC9B,CAAC"}

package/dist/search/ranking/rankCandidates.d.ts

@@ -0,0 +1,12 @@
+import type { CodeCandidate, QueryIR, SearchPlan, SearchScope } from '../types.js';
+import type { LspEngine } from '../../engine/LspEngine.js';
+/**
+ * Rank candidates with mode-aware scoring + LSP enrichment.
+ * First filters excluded paths, then applies penalties, enriches top candidates.
+ */
+export declare function rankCandidates(candidates: CodeCandidate[], ctx: {
+    ir: QueryIR;
+    plan: SearchPlan;
+    engine: LspEngine;
+    scope: SearchScope;
+}): Promise<CodeCandidate[]>;

package/dist/search/ranking/rankCandidates.js

@@ -0,0 +1,106 @@
+import { formatHover } from '../../format/markdown.js';
+import { relativePath } from '../../engine/positions.js';
+import { shouldSkipDir, shouldSkipFile } from '../fileKinds.js';
+import * as path from 'path';
+const TEST_PATTERN = /\.(spec|test|stories)\.(ts|tsx|js|jsx)$/;
+const GENERATED_PATTERN = /\/(dist|es|build|generated|__generated__|\.cache)\//;
+const DEMO_PATTERN = /\/(demo|example|storybook|stories|fixtures)\//;
+/**
+ * Check if a candidate's file path should be excluded.
+ * Applied at ranking time as a safety net — catches files from stale indexes.
+ */
+function isExcludedPath(filePath) {
+    const parts = filePath.split(path.sep);
+    for (const part of parts) {
+        if (shouldSkipDir(part))
+            return true;
+    }
+    if (shouldSkipFile(filePath))
+        return true;
+    return false;
+}
+/**
+ * Rank candidates with mode-aware scoring + LSP enrichment.
+ * First filters excluded paths, then applies penalties, enriches top candidates.
+ */
+export async function rankCandidates(candidates, ctx) {
+    // Post-filter: remove candidates from excluded paths (safety net for stale indexes)
+    const clean = candidates.filter((c) => !isExcludedPath(c.filePath));
+    // Apply penalties
+    for (const c of clean) {
+        if (TEST_PATTERN.test(c.filePath)) {
+            c.score -= 3;
+            c.evidence.push('penalty: test-file');
+        }
+        if (GENERATED_PATTERN.test(c.filePath)) {
+            c.score -= 10;
+            c.evidence.push('penalty: generated');
+        }
+        if (DEMO_PATTERN.test(c.filePath)) {
+            c.score -= 4;
+            c.evidence.push('penalty: demo');
+        }
+        if (c.filePath.endsWith('.d.ts')) {
+            c.score -= 6;
+            c.evidence.push('penalty: declaration-file');
+        }
+    }
+    // Recipe-aware scoring: boost candidates from multiple backends, downweight identifier-only when recipes exist
+    const hasRecipes = ctx.ir.recipes.length > 0;
+    for (const c of clean) {
+        // Multi-source bonus
+        if (c.sources.length >= 3) {
+            c.score += 3;
+            c.evidence.push('multi-source-bonus');
+        }
+        // Recipe score boost
+        for (const recipe of ctx.ir.recipes) {
+            if (recipe.scoreBoost && recipe.scoreBoost > 0) {
+                // Boost if candidate matches recipe's identifiers
+                const recipeIds = recipe.exactIdentifiers ?? [];
+                if (recipeIds.length === 0 || recipeIds.some((id) => c.matchedIdentifier === id || c.symbol === id)) {
+                    // Extra boost if candidate has structural evidence matching recipe
+                    const hasStructural = c.sources.includes('structural');
+                    const hasRegex = c.evidence.some((e) => e.startsWith('regex-match'));
+                    if (hasStructural || hasRegex) {
+                        c.score += recipe.scoreBoost;
+                        c.evidence.push(`recipe-boost: ${recipe.id}(+${recipe.scoreBoost})`);
+                    }
+                }
+            }
+        }
+        // Downweight identifier-only hits when recipes demand richer evidence
+        if (hasRecipes && c.sources.length === 1 && c.sources[0] === 'identifier') {
+            c.score -= 2;
+            c.evidence.push('penalty: identifier-only-with-recipe');
+        }
+    }
+    // Filter out negative scores
+    const filtered = clean.filter((c) => c.score > 0);
+    // Sort by score
+    filtered.sort((a, b) => b.score - a.score);
+    // LSP enrichment for top candidates (use actual match position, not line 0)
+    const enrichLimit = Math.min(15, filtered.length);
+    for (let i = 0; i < enrichLimit; i++) {
+        const c = filtered[i];
+        try {
+            const { uri } = await ctx.engine.prepareFile(c.filePath);
+            const position = { line: c.line - 1, character: c.column ?? 0 };
+            const hover = await ctx.engine.request('textDocument/hover', { textDocument: { uri }, position }, 5000);
+            if (hover) {
+                c.signature = formatHover(hover).substring(0, 200);
+                if (!c.sources.includes('lsp'))
+                    c.sources.push('lsp');
+            }
+        }
+        catch (err) {
+            c.evidence.push(`lsp-enrich-failed: ${err?.message ?? 'unknown'}`);
+        }
+    }
+    // Relativize file paths
+    for (const c of filtered) {
+        c.filePath = relativePath(c.filePath, ctx.engine.workspaceRoot);
+    }
+    return filtered;
+}
+//# sourceMappingURL=rankCandidates.js.map

package/dist/search/ranking/rankCandidates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rankCandidates.js","sourceRoot":"","sources":["../../../src/search/ranking/rankCandidates.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,MAAM,YAAY,GAAG,yCAAyC,CAAC;AAC/D,MAAM,iBAAiB,GAAG,qDAAqD,CAAC;AAChF,MAAM,YAAY,GAAG,+CAA+C,CAAC;AAErE;;;GAGG;AACH,SAAS,cAAc,CAAC,QAAgB;IACtC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,aAAa,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IACvC,CAAC;IACD,IAAI,cAAc,CAAC,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1C,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,UAA2B,EAC3B,GAA6E;IAE7E,oFAAoF;IACpF,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEpE,kBAAkB;IAClB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAAC,CAAC;QAC3F,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAAC,CAAC;QACjG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAAC,CAAC;QACtF,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QAAC,CAAC;IACnG,CAAC;IAED,+GAA+G;IAC/G,MAAM,UAAU,GAAG,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,qBAAqB;QACrB,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1B,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YACb,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACxC,CAAC;QACD,qBAAqB;QACrB,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;YACpC,IAAI,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;gBAC/C,kDAAkD;gBAClD,MAAM,SAAS,GAAG,MAAM,CAAC,gBAAgB,IAAI,EAAE,CAAC;gBAChD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,EAAE,CAAC,EAAE,CAAC;oBACpG,mEAAmE;oBACnE,MAAM,aAAa,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;oBACvD,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC;oBACrE,IAAI,aAAa,IAAI,QAAQ,EAAE,CAAC;wBAC9B,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,UAAU,CAAC;wBAC7B,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;oBACvE,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,sEAAsE;QACtE,IAAI,UAAU,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,YAAY,EAAE,CAAC;YAC1E,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YACb,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAElD,gBAAgB;IAChB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAE3C,4EAA4E;IAC5E,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,EAAE,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACzD,MAAM,QAAQ,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAChE,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,OAAO,CACpC,oBAAoB,EAAE,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,CAChE,CAAC;YACF,IAAI,KAAK,EAAE,CAAC;gBACV,CAAC,CAAC,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBACnD,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAClB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,sBAAsB,GAAG,EAAE,OAAO,IAAI,SAAS,EAAE,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,CAAC,CAAC,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/search/retrievers/behaviorRetriever.d.ts

@@ -0,0 +1,7 @@
+import type { QueryIR, SearchScope, WorkspaceIndex, CodeCandidate } from '../types.js';
+import type { EffectiveSearchSpec } from '../query/compileEffectiveSearchSpec.js';
+/**
+ * Retrieve declaration-oriented candidates based on behavior family matching.
+ * Uses the compiled spec's behaviorTerms (merged from parser + recipes).
+ */
+export declare function retrieveBehaviorCandidates(ir: QueryIR, scope: SearchScope, index: WorkspaceIndex, spec?: EffectiveSearchSpec): CodeCandidate[];

package/dist/search/retrievers/behaviorRetriever.js

@@ -0,0 +1,86 @@
+import { BEHAVIOR_FAMILIES } from '../families/behaviorFamilies.js';
+import { scoreFieldedQuery } from '../ranking/fieldedTextRanker.js';
+import { buildSnippetFromFile } from '../../analysis/ts/snippets.js';
+/**
+ * Retrieve declaration-oriented candidates based on behavior family matching.
+ * Uses the compiled spec's behaviorTerms (merged from parser + recipes).
+ */
+export function retrieveBehaviorCandidates(ir, scope, index, spec) {
+    const matchedFamilies = BEHAVIOR_FAMILIES.filter((f) => ir.familyScores[f.id] > 0);
+    if (matchedFamilies.length === 0 && ir.nlTokens.length === 0)
+        return [];
+    // Expand query tokens with family expansion terms
+    const expansionTerms = [];
+    for (const family of matchedFamilies) {
+        expansionTerms.push(...family.expansionTerms);
+    }
+    // Build fielded documents from declarations + their attached docs
+    const docsBySymbol = new Map();
+    for (const d of index.docs) {
+        if (d.attachedSymbol) {
+            const existing = docsBySymbol.get(`${d.filePath}:${d.attachedSymbol}`) ?? [];
+            existing.push(...d.tokens);
+            docsBySymbol.set(`${d.filePath}:${d.attachedSymbol}`, existing);
+        }
+    }
+    const docs = index.declarations.map((decl, i) => {
+        const docTokens = docsBySymbol.get(`${decl.filePath}:${decl.symbol}`) ?? [];
+        return {
+            id: String(i),
+            fields: {
+                symbol: decl.symbolTokens,
+                path: decl.pathTokens,
+                docs: docTokens,
+            },
+        };
+    });
+    // Query tokens: use spec behaviorTerms if available, plus family expansion
+    const baseTerms = spec?.behaviorTerms ?? [...ir.nlTokens, ...ir.codeTokens];
+    const queryTokens = [...new Set([...baseTerms, ...expansionTerms])];
+    const scored = scoreFieldedQuery(queryTokens, docs, { symbol: 8, path: 3, docs: 5 }, 100);
+    const candidates = [];
+    for (const s of scored) {
+        const decl = index.declarations[parseInt(s.id)];
+        if (!decl)
+            continue;
+        // Family hint bonus (additive, on top of fielded score)
+        let familyBonus = 0;
+        const familyEvidence = [];
+        for (const family of matchedFamilies) {
+            for (const hint of family.symbolHints) {
+                if (decl.symbolTokens.some((t) => t === hint)) {
+                    familyBonus += 3;
+                    familyEvidence.push(`family-hint: ${family.id}:${hint}`);
+                }
+            }
+            for (const hint of family.fileHints) {
+                if (decl.pathTokens.some((t) => t.includes(hint))) {
+                    familyBonus += 2;
+                    familyEvidence.push(`family-file: ${family.id}:${hint}`);
+                }
+            }
+        }
+        // Export bonus
+        const exportBonus = decl.isExported ? 2 : 0;
+        const totalScore = Math.round(s.score) + familyBonus + exportBonus;
+        const evidence = [...s.evidence, ...familyEvidence];
+        if (decl.isExported)
+            evidence.push('exported');
+        const { snippet, context } = buildSnippetFromFile(decl.filePath, decl.line, 1);
+        candidates.push({
+            candidateType: 'declaration',
+            filePath: decl.filePath,
+            line: decl.line,
+            column: decl.column,
+            symbol: decl.symbol,
+            kind: decl.kind,
+            snippet,
+            context,
+            score: totalScore,
+            evidence,
+            sources: ['behavior'],
+        });
+    }
+    return candidates.sort((a, b) => b.score - a.score);
+}
+//# sourceMappingURL=behaviorRetriever.js.map

package/dist/search/retrievers/behaviorRetriever.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"behaviorRetriever.js","sourceRoot":"","sources":["../../../src/search/retrievers/behaviorRetriever.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAwB,MAAM,iCAAiC,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AAErE;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CACxC,EAAW,EACX,KAAkB,EAClB,KAAqB,EACrB,IAA0B;IAE1B,MAAM,eAAe,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACnF,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExE,kDAAkD;IAClD,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;QACrC,cAAc,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;IAChD,CAAC;IAED,kEAAkE;IAClE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC,IAAI,EAAE,CAAC;YAC7E,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAC3B,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,cAAc,EAAE,EAAE,QAAQ,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAsB,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QACjE,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;QAC5E,OAAO;YACL,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;YACb,MAAM,EAAE;gBACN,MAAM,EAAE,IAAI,CAAC,YAAY;gBACzB,IAAI,EAAE,IAAI,CAAC,UAAU;gBACrB,IAAI,EAAE,SAAS;aAChB;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,2EAA2E;IAC3E,MAAM,SAAS,GAAG,IAAI,EAAE,aAAa,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;IAC5E,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,iBAAiB,CAAC,WAAW,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAE1F,MAAM,UAAU,GAAoB,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,wDAAwD;QACxD,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;oBAC9C,WAAW,IAAI,CAAC,CAAC;oBACjB,cAAc,CAAC,IAAI,CAAC,gBAAgB,MAAM,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACpC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;oBAClD,WAAW,IAAI,CAAC,CAAC;oBACjB,cAAc,CAAC,IAAI,CAAC,gBAAgB,MAAM,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;QACH,CAAC;QAED,eAAe;QACf,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,WAAW,GAAG,WAAW,CAAC;QACnE,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,cAAc,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,UAAU;YAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE/C,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,oBAAoB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/E,UAAU,CAAC,IAAI,CAAC;YACd,aAAa,EAAE,aAAa;YAC5B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,IAA6B;YACxC,OAAO;YACP,OAAO;YACP,KAAK,EAAE,UAAU;YACjB,QAAQ;YACR,OAAO,EAAE,CAAC,UAAU,CAAC;SACtB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC"}

package/dist/search/retrievers/configRetriever.d.ts

@@ -0,0 +1,7 @@
+import type { QueryIR, SearchScope, WorkspaceIndex, CodeCandidate } from '../types.js';
+import type { EffectiveSearchSpec } from '../query/compileEffectiveSearchSpec.js';
+/**
+ * Retrieve candidates from the config/registry index.
+ * Uses the compiled spec's configTerms and routeTerms for boosted scoring.
+ */
+export declare function retrieveConfigCandidates(ir: QueryIR, scope: SearchScope, index: WorkspaceIndex, spec?: EffectiveSearchSpec): CodeCandidate[];

package/dist/search/retrievers/configRetriever.js

@@ -0,0 +1,46 @@
+import { scoreFieldedQuery } from '../ranking/fieldedTextRanker.js';
+import { buildSnippetFromFile } from '../../analysis/ts/snippets.js';
+/**
+ * Retrieve candidates from the config/registry index.
+ * Uses the compiled spec's configTerms and routeTerms for boosted scoring.
+ */
+export function retrieveConfigCandidates(ir, scope, index, spec) {
+    if (index.configs.length === 0)
+        return [];
+    const baseTerms = spec?.behaviorTerms ?? [...ir.nlTokens, ...ir.codeTokens];
+    const extraTerms = [...(spec?.routeTerms ?? []), ...(spec?.configTerms ?? [])];
+    const idTerms = (spec?.exactIdentifiers ?? ir.exactIdentifiers).map((s) => s.toLowerCase());
+    const queryTokens = [...new Set([...baseTerms, ...extraTerms, ...idTerms])];
+    if (queryTokens.length === 0)
+        return [];
+    const docs = index.configs.map((c, i) => ({
+        id: String(i),
+        fields: {
+            config: c.tokens,
+            path: c.keyPath ?? [],
+        },
+    }));
+    const scored = scoreFieldedQuery(queryTokens, docs, { config: 6, path: 4 }, 30);
+    const candidates = [];
+    for (const s of scored) {
+        const entry = index.configs[parseInt(s.id)];
+        if (!entry)
+            continue;
+        const { snippet, context } = buildSnippetFromFile(entry.filePath, entry.line, 1);
+        candidates.push({
+            candidateType: 'config',
+            filePath: entry.filePath,
+            line: entry.line,
+            symbol: entry.keyPath?.join('.'),
+            kind: 'config',
+            snippet,
+            context,
+            score: Math.round(s.score) + (entry.kind === 'route' && spec?.routeTerms.length ? 3 : 0)
+                + (entry.kind === 'env' && spec?.configTerms.length ? 2 : 0),
+            evidence: [`config-${entry.kind}: "${entry.text.substring(0, 80)}"`, ...s.evidence],
+            sources: ['config'],
+        });
+    }
+    return candidates;
+}
+//# sourceMappingURL=configRetriever.js.map

package/dist/search/retrievers/configRetriever.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"configRetriever.js","sourceRoot":"","sources":["../../../src/search/retrievers/configRetriever.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAwB,MAAM,iCAAiC,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AAErE;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CACtC,EAAW,EACX,KAAkB,EAClB,KAAqB,EACrB,IAA0B;IAE1B,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE1C,MAAM,SAAS,GAAG,IAAI,EAAE,aAAa,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;IAC5E,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,WAAW,IAAI,EAAE,CAAC,CAAC,CAAC;IAC/E,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,gBAAgB,IAAI,EAAE,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAC5F,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,UAAU,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAC5E,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExC,MAAM,IAAI,GAAsB,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3D,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;QACb,MAAM,EAAE;YACN,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,IAAI,EAAE,CAAC,CAAC,OAAO,IAAI,EAAE;SACtB;KACF,CAAC,CAAC,CAAC;IAEJ,MAAM,MAAM,GAAG,iBAAiB,CAAC,WAAW,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAS,EAAE,EAAE,CAAC,CAAC;IAEvF,MAAM,UAAU,GAAoB,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,oBAAoB,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACjF,UAAU,CAAC,IAAI,CAAC;YACd,aAAa,EAAE,QAAQ;YACvB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,MAAM,EAAE,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC;YAChC,IAAI,EAAE,QAAQ;YACd,OAAO;YACP,OAAO;YACP,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;kBACpF,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,QAAQ,EAAE,CAAC,UAAU,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;YACnF,OAAO,EAAE,CAAC,QAAQ,CAAC;SACpB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/search/retrievers/docRetriever.d.ts

@@ -0,0 +1,7 @@
+import type { QueryIR, SearchScope, WorkspaceIndex, CodeCandidate } from '../types.js';
+import type { EffectiveSearchSpec } from '../query/compileEffectiveSearchSpec.js';
+/**
+ * Retrieve candidates from the doc/narrative index.
+ * Uses the compiled spec's behaviorTerms for BM25 scoring.
+ */
+export declare function retrieveDocCandidates(ir: QueryIR, scope: SearchScope, index: WorkspaceIndex, spec?: EffectiveSearchSpec): CodeCandidate[];

package/dist/search/retrievers/docRetriever.js

@@ -0,0 +1,46 @@
+import { scoreFieldedQuery } from '../ranking/fieldedTextRanker.js';
+import { buildSnippetFromFile } from '../../analysis/ts/snippets.js';
+/**
+ * Retrieve candidates from the doc/narrative index.
+ * Uses the compiled spec's behaviorTerms for BM25 scoring.
+ */
+export function retrieveDocCandidates(ir, scope, index, spec) {
+    const terms = spec?.behaviorTerms ?? [...ir.nlTokens, ...ir.codeTokens];
+    if (terms.length === 0 && ir.phrases.length === 0)
+        return [];
+    if (index.docs.length === 0)
+        return [];
+    // Build fielded documents from doc entries
+    const docs = index.docs.map((d, i) => ({
+        id: String(i),
+        fields: {
+            docs: d.tokens,
+            symbol: d.attachedSymbol
+                ? d.attachedSymbol.replace(/([a-z])([A-Z])/g, '$1 $2').toLowerCase().split(/\s+/)
+                : [],
+        },
+    }));
+    const queryTokens = terms;
+    const scored = scoreFieldedQuery(queryTokens, docs, { docs: 6, symbol: 4 }, 50);
+    const candidates = [];
+    for (const s of scored) {
+        const entry = index.docs[parseInt(s.id)];
+        if (!entry)
+            continue;
+        const { snippet, context } = buildSnippetFromFile(entry.filePath, entry.line, 1);
+        candidates.push({
+            candidateType: 'doc',
+            filePath: entry.filePath,
+            line: entry.line,
+            symbol: entry.attachedSymbol,
+            kind: 'doc',
+            snippet,
+            context,
+            score: Math.round(s.score),
+            evidence: [`doc-${entry.kind}: "${entry.text.substring(0, 60)}"`, ...s.evidence],
+            sources: ['doc'],
+        });
+    }
+    return candidates;
+}
+//# sourceMappingURL=docRetriever.js.map

package/dist/search/retrievers/docRetriever.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"docRetriever.js","sourceRoot":"","sources":["../../../src/search/retrievers/docRetriever.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAwB,MAAM,iCAAiC,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AAErE;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,EAAW,EACX,KAAkB,EAClB,KAAqB,EACrB,IAA0B;IAE1B,MAAM,KAAK,GAAG,IAAI,EAAE,aAAa,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;IACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC7D,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvC,2CAA2C;IAC3C,MAAM,IAAI,GAAsB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACxD,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;QACb,MAAM,EAAE;YACN,IAAI,EAAE,CAAC,CAAC,MAAM;YACd,MAAM,EAAE,CAAC,CAAC,cAAc;gBACtB,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;gBACjF,CAAC,CAAC,EAAE;SACP;KACF,CAAC,CAAC,CAAC;IAEJ,MAAM,WAAW,GAAG,KAAK,CAAC;IAC1B,MAAM,MAAM,GAAG,iBAAiB,CAAC,WAAW,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAEhF,MAAM,UAAU,GAAoB,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,oBAAoB,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACjF,UAAU,CAAC,IAAI,CAAC;YACd,aAAa,EAAE,KAAK;YACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,MAAM,EAAE,KAAK,CAAC,cAAc;YAC5B,IAAI,EAAE,KAAK;YACX,OAAO;YACP,OAAO;YACP,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YAC1B,QAAQ,EAAE,CAAC,OAAO,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;YAChF,OAAO,EAAE,CAAC,KAAK,CAAC;SACjB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/search/retrievers/identifierRetriever.d.ts

@@ -0,0 +1,7 @@
+import type { QueryIR, SearchScope, WorkspaceIndex, CodeCandidate } from '../types.js';
+import type { EffectiveSearchSpec } from '../query/compileEffectiveSearchSpec.js';
+/**
+ * Retrieve usage-oriented candidates based on exact identifier matching.
+ * Uses the compiled spec's identifiers (merged from parser + recipes).
+ */
+export declare function retrieveIdentifierCandidates(ir: QueryIR, scope: SearchScope, index: WorkspaceIndex, spec?: EffectiveSearchSpec): CodeCandidate[];