@massa-ai/core 1.2.1

package/dist/services/search/rlm-fusion.d.ts

@@ -0,0 +1,23 @@
+/**
+ * rlm-fusion — Reciprocal Rank Fusion + score explanation delegates for
+ * ContextualSearchRLM.
+ *
+ * Split (M14 Phase 3, T3.3 safety valve) from rlm-search.ts so each module
+ * stays under the ~600 LOC budget. Behavior is byte-preserved: bodies moved
+ * verbatim with `this` → `rlm`.
+ */
+import { SearchResult } from "@massa-ai/shared";
+import type { ContextualSearchRLM } from "./contextual-search-rlm.js";
+/**
+ * Reciprocal Rank Fusion (RRF) - Combines multiple result lists.
+ *
+ * Now includes intelligent boosting:
+ * - Keywords get higher weight when query contains function/class names
+ * - Exact matches in keyword results get additional boost
+ */
+export declare function fuseResultsImpl(rlm: ContextualSearchRLM, resultSets: SearchResult[][], query: string, explainScores?: boolean): SearchResult[];
+/**
+ * Generate detailed score explanation
+ */
+export declare function generateScoreExplanationImpl(finalScore: number, rrfScore: number, vectorScore?: number, keywordScore?: number, vectorRank?: number, keywordRank?: number, combinedRank?: number): any;
+//# sourceMappingURL=rlm-fusion.d.ts.map

package/dist/services/search/rlm-fusion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rlm-fusion.d.ts","sourceRoot":"","sources":["../../../src/services/search/rlm-fusion.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,YAAY,EAAU,MAAM,kBAAkB,CAAC;AACxD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAEtE;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,mBAAmB,EACxB,UAAU,EAAE,YAAY,EAAE,EAAE,EAC5B,KAAK,EAAE,MAAM,EACb,aAAa,GAAE,OAAe,GAC7B,YAAY,EAAE,CAoMhB;AAED;;GAEG;AACH,wBAAgB,4BAA4B,CAC1C,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,WAAW,CAAC,EAAE,MAAM,EACpB,YAAY,CAAC,EAAE,MAAM,EACrB,UAAU,CAAC,EAAE,MAAM,EACnB,WAAW,CAAC,EAAE,MAAM,EACpB,YAAY,CAAC,EAAE,MAAM,GACpB,GAAG,CA6BL"}

package/dist/services/search/rlm-fusion.js

@@ -0,0 +1,180 @@
+/**
+ * rlm-fusion — Reciprocal Rank Fusion + score explanation delegates for
+ * ContextualSearchRLM.
+ *
+ * Split (M14 Phase 3, T3.3 safety valve) from rlm-search.ts so each module
+ * stays under the ~600 LOC budget. Behavior is byte-preserved: bodies moved
+ * verbatim with `this` → `rlm`.
+ */
+import { logger } from "@massa-ai/shared";
+/**
+ * Reciprocal Rank Fusion (RRF) - Combines multiple result lists.
+ *
+ * Now includes intelligent boosting:
+ * - Keywords get higher weight when query contains function/class names
+ * - Exact matches in keyword results get additional boost
+ */
+export function fuseResultsImpl(rlm, resultSets, query, explainScores = false) {
+    const scoreMap = new Map();
+    // Detect if query contains code-specific patterns (functions, classes, etc.)
+    const hasCodePattern = (text) => {
+        const codePatterns = [
+            /\w+\(\)/, // function calls: cn(), useState()
+            /\bfunction\b/i, // "function" keyword
+            /\bclass\b/i, // "class" keyword
+            /\binterface\b/i, // "interface" keyword
+            /\benum\b/i, // "enum" keyword
+            /\btype\b/i, // "type" keyword
+            /\bconst\b/i, // "const" keyword
+            /\bimport\b/i, // "import" keyword
+            /\bexport\b/i, // "export" keyword
+        ];
+        return codePatterns.some((pattern) => pattern.test(text));
+    };
+    // Check if this is a code-focused query
+    const isCodeQuery = hasCodePattern(query);
+    // Keyword weight multiplier (higher = more weight to keyword results)
+    // For code queries: 2.5x boost to keyword matches
+    // For general queries: 1.0x (equal weight)
+    const codeKeywordBoostRaw = Number(process.env.RRF_KEYWORD_BOOST ?? "2.5");
+    const codeKeywordBoost = Number.isFinite(codeKeywordBoostRaw) && codeKeywordBoostRaw > 0 ? codeKeywordBoostRaw : 2.5;
+    const KEYWORD_BOOST = isCodeQuery ? codeKeywordBoost : 1.0;
+    logger.debug("RRF fusion parameters", {
+        query,
+        isCodeQuery,
+        keywordBoost: KEYWORD_BOOST,
+        vectorResults: resultSets[0]?.length || 0,
+        keywordResults: resultSets[1]?.length || 0,
+    });
+    // Calculate RRF score for each result.
+    // Stream roles: index 0 is always the vector stream (see search()). All
+    // other streams are lexical (porter keyword, trigram, fuzzy) or memory
+    // (graph). Lexical streams get the code-query keyword boost; the memory
+    // graph stream gets neutral weight (1.0) since it surfaces context, not a
+    // direct lexical match.
+    for (let i = 0; i < resultSets.length; i++) {
+        const results = resultSets[i];
+        const isVector = i === 0;
+        const isMemoryStream = results.some((r) => r.source === "memory" ||
+            r.metadata?.context
+                ?.graphNeighbor === true);
+        const boost = isVector ? 1.0 : isMemoryStream ? 1.0 : KEYWORD_BOOST;
+        results.forEach((result, rank) => {
+            const rrfScore = (1 / (rlm.RRF_K + rank + 1)) * boost;
+            if (scoreMap.has(result.id)) {
+                const existing = scoreMap.get(result.id);
+                if (isVector) {
+                    existing.vectorRrfScore += rrfScore;
+                    existing.vectorRank = rank;
+                    existing.vectorScore = result.score;
+                }
+                else if (isMemoryStream) {
+                    existing.memoryRrfScore += rrfScore;
+                }
+                else {
+                    // Porter, trigram, and fuzzy are correlated lexical views of the
+                    // same document. Count the best lexical rank once so duplicate
+                    // matches cannot overwhelm a strong vector-only result.
+                    existing.lexicalRrfScore = Math.max(existing.lexicalRrfScore, rrfScore);
+                    // Record the best lexical rank/score (porter/trigram/fuzzy).
+                    if (existing.keywordRank === undefined ||
+                        rank < existing.keywordRank) {
+                        existing.keywordRank = rank;
+                        existing.keywordScore = result.score;
+                    }
+                }
+                existing.rrfScore =
+                    existing.vectorRrfScore +
+                        existing.lexicalRrfScore +
+                        existing.memoryRrfScore;
+            }
+            else {
+                const vectorRrfScore = isVector ? rrfScore : 0;
+                const lexicalRrfScore = !isVector && !isMemoryStream ? rrfScore : 0;
+                const memoryRrfScore = isMemoryStream ? rrfScore : 0;
+                scoreMap.set(result.id, {
+                    result: { ...result },
+                    rrfScore: vectorRrfScore + lexicalRrfScore + memoryRrfScore,
+                    vectorRrfScore,
+                    lexicalRrfScore,
+                    memoryRrfScore,
+                    vectorRank: isVector ? rank : undefined,
+                    keywordRank: !isVector && !isMemoryStream ? rank : undefined,
+                    vectorScore: isVector ? result.score : undefined,
+                    keywordScore: !isVector && !isMemoryStream ? result.score : undefined,
+                });
+            }
+        });
+    }
+    // Convert to array and sort by RRF score
+    const sorted = Array.from(scoreMap.values())
+        .sort((a, b) => b.rrfScore - a.rrfScore);
+    // Dynamic normalization: use the top RRF score as divisor so results
+    // span the full [0, 1] range instead of being capped by a fixed constant.
+    const maxRrfScore = sorted[0]?.rrfScore || 1;
+    const vectorWeightRaw = Number(process.env.RRF_VECTOR_WEIGHT ?? "0.3");
+    const vectorWeight = Number.isFinite(vectorWeightRaw) ? Math.min(1, Math.max(0, vectorWeightRaw)) : 0.3;
+    return sorted
+        .map(({ result, rrfScore, vectorRank, keywordRank, vectorScore, keywordScore, vectorRrfScore, lexicalRrfScore, memoryRrfScore, }, index) => {
+        const rrfNormalized = rrfScore / maxRrfScore;
+        // Combine RRF score with vector similarity for better relevance measurement
+        // Weight: 70% RRF (ranking-based) + 30% vector similarity (semantic)
+        const vectorSimilarity = vectorScore || 0;
+        const combinedScore = rrfNormalized * (1 - vectorWeight) + vectorSimilarity * vectorWeight;
+        // Centrality boost: symbols with higher PageRank get a mild re-ranking bonus.
+        // finalScore = combined_score * (1 + 0.2 * centralityScore)
+        // centralityScore is in [0, 1]; clamped to [0, 1] after boost.
+        const centralityScore = typeof result.metadata?.centralityScore === "number"
+            ? result.metadata.centralityScore
+            : 0;
+        const normalizedScore = Math.min(1, combinedScore * (1 + 0.2 * centralityScore));
+        const memoryOnly = memoryRrfScore > 0 && vectorRrfScore === 0 && lexicalRrfScore === 0;
+        // Generate explanation if requested
+        const explanation = explainScores
+            ? generateScoreExplanationImpl(normalizedScore, rrfScore, vectorScore, keywordScore, vectorRank, keywordRank, index)
+            : undefined;
+        return {
+            ...result,
+            score: normalizedScore,
+            explanation,
+            // Internal field: raw cosine similarity from the vector store.
+            // Used by search() to apply minScore as an absolute relevance gate
+            // (normalized RRF score is always ~1.0 for the top result and
+            // therefore cannot filter semantic noise). Stripped before caching.
+            metadata: {
+                ...result.metadata,
+                // Graph-only context has no direct query-relevance signal. Give
+                // it an explicit zero for minScore gating so dynamic RRF
+                // normalization cannot turn an unrelated neighbor into a 0.7
+                // hit. A result also found by vector/lexical retrieval keeps its
+                // direct relevance behavior.
+                _rrfRawVectorScore: vectorScore ?? (memoryOnly ? 0 : undefined),
+            },
+        };
+    });
+}
+/**
+ * Generate detailed score explanation
+ */
+export function generateScoreExplanationImpl(finalScore, rrfScore, vectorScore, keywordScore, vectorRank, keywordRank, combinedRank) {
+    const parts = [];
+    if (vectorScore != null && vectorRank != null) {
+        parts.push(`Vector: ${(vectorScore * 100).toFixed(1)}% (rank #${vectorRank + 1})`);
+    }
+    if (keywordScore != null && keywordRank != null) {
+        parts.push(`Keyword: ${(keywordScore * 100).toFixed(1)}% (rank #${keywordRank + 1})`);
+    }
+    const breakdown = parts.join(" + ") +
+        ` → RRF: ${rrfScore.toFixed(4)} → Final: ${(finalScore * 100).toFixed(1)}%`;
+    return {
+        finalScore,
+        vectorScore: vectorScore ?? undefined,
+        keywordScore: keywordScore ?? undefined,
+        rrfScore,
+        vectorRank: vectorRank != null ? vectorRank + 1 : undefined,
+        keywordRank: keywordRank != null ? keywordRank + 1 : undefined,
+        combinedRank: combinedRank != null ? combinedRank + 1 : undefined,
+        breakdown,
+    };
+}
+//# sourceMappingURL=rlm-fusion.js.map

package/dist/services/search/rlm-fusion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rlm-fusion.js","sourceRoot":"","sources":["../../../src/services/search/rlm-fusion.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAgB,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAGxD;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,GAAwB,EACxB,UAA4B,EAC5B,KAAa,EACb,gBAAyB,KAAK;IAE9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAarB,CAAC;IAEJ,6EAA6E;IAC7E,MAAM,cAAc,GAAG,CAAC,IAAY,EAAW,EAAE;QAC/C,MAAM,YAAY,GAAG;YACnB,SAAS,EAAE,mCAAmC;YAC9C,eAAe,EAAE,qBAAqB;YACtC,YAAY,EAAE,kBAAkB;YAChC,gBAAgB,EAAE,sBAAsB;YACxC,WAAW,EAAE,iBAAiB;YAC9B,WAAW,EAAE,iBAAiB;YAC9B,YAAY,EAAE,kBAAkB;YAChC,aAAa,EAAE,mBAAmB;YAClC,aAAa,EAAE,mBAAmB;SACnC,CAAC;QACF,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5D,CAAC,CAAC;IAEF,wCAAwC;IACxC,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAE1C,sEAAsE;IACtE,kDAAkD;IAClD,2CAA2C;IAC3C,MAAM,mBAAmB,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,iBAAiB,IAAI,KAAK,CAAC,CAAC;IAC3E,MAAM,gBAAgB,GAAG,MAAM,CAAC,QAAQ,CAAC,mBAAmB,CAAC,IAAI,mBAAmB,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,GAAG,CAAC;IACrH,MAAM,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC;IAE3D,MAAM,CAAC,KAAK,CAAC,uBAAuB,EAAE;QACpC,KAAK;QACL,WAAW;QACX,YAAY,EAAE,aAAa;QAC3B,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC;QACzC,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC;KAC3C,CAAC,CAAC;IAEH,uCAAuC;IACvC,wEAAwE;IACxE,uEAAuE;IACvE,wEAAwE;IACxE,0EAA0E;IAC1E,wBAAwB;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,EAAE,CACH,CAAC,CAAC,MAAiB,KAAK,QAAQ;YAC/B,CAAC,CAAC,QAAoC,EAAE,OAAmC;gBAC3E,EAAE,aAAa,KAAK,IAAI,CAC7B,CAAC;QACF,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC;QAEpE,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;YAC/B,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAEtD,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC;gBAE1C,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,cAAc,IAAI,QAAQ,CAAC;oBACpC,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC;oBAC3B,QAAQ,CAAC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC;gBACtC,CAAC;qBAAM,IAAI,cAAc,EAAE,CAAC;oBAC1B,QAAQ,CAAC,cAAc,IAAI,QAAQ,CAAC;gBACtC,CAAC;qBAAM,CAAC;oBACN,iEAAiE;oBACjE,+DAA+D;oBAC/D,wDAAwD;oBACxD,QAAQ,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CACjC,QAAQ,CAAC,eAAe,EACxB,QAAQ,CACT,CAAC;oBACF,6DAA6D;oBAC7D,IACE,QAAQ,CAAC,WAAW,KAAK,SAAS;wBAClC,IAAI,GAAG,QAAQ,CAAC,WAAW,EAC3B,CAAC;wBACD,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC;wBAC5B,QAAQ,CAAC,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC;oBACvC,CAAC;gBACH,CAAC;gBACD,QAAQ,CAAC,QAAQ;oBACf,QAAQ,CAAC,cAAc;wBACvB,QAAQ,CAAC,eAAe;wBACxB,QAAQ,CAAC,cAAc,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,MAAM,cAAc,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,MAAM,eAAe,GAAG,CAAC,QAAQ,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpE,MAAM,cAAc,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrD,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE;oBACtB,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE;oBACrB,QAAQ,EAAE,cAAc,GAAG,eAAe,GAAG,cAAc;oBAC3D,cAAc;oBACd,eAAe;oBACf,cAAc;oBACd,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;oBACvC,WAAW,EAAE,CAAC,QAAQ,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;oBAC5D,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;oBAChD,YAAY,EAAE,CAAC,QAAQ,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;iBACtE,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,yCAAyC;IACzC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;SACzC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAE3C,qEAAqE;IACrE,0EAA0E;IAC1E,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC;IAC7C,MAAM,eAAe,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,iBAAiB,IAAI,KAAK,CAAC,CAAC;IACvE,MAAM,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAExG,OAAO,MAAM;SACV,GAAG,CACF,CACE,EACE,MAAM,EACN,QAAQ,EACR,UAAU,EACV,WAAW,EACX,WAAW,EACX,YAAY,EACZ,cAAc,EACd,eAAe,EACf,cAAc,GACf,EACD,KAAK,EACL,EAAE;QACF,MAAM,aAAa,GAAG,QAAQ,GAAG,WAAW,CAAC;QAE7C,4EAA4E;QAC5E,qEAAqE;QACrE,MAAM,gBAAgB,GAAG,WAAW,IAAI,CAAC,CAAC;QAC1C,MAAM,aAAa,GAAG,aAAa,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,gBAAgB,GAAG,YAAY,CAAC;QAE3F,8EAA8E;QAC9E,4DAA4D;QAC5D,+DAA+D;QAC/D,MAAM,eAAe,GACnB,OAAQ,MAAM,CAAC,QAAoC,EAAE,eAAe,KAAK,QAAQ;YAC/E,CAAC,CAAG,MAAM,CAAC,QAAoC,CAAC,eAA0B;YAC1E,CAAC,CAAC,CAAC,CAAC;QACR,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC;QACjF,MAAM,UAAU,GACd,cAAc,GAAG,CAAC,IAAI,cAAc,KAAK,CAAC,IAAI,eAAe,KAAK,CAAC,CAAC;QAEtE,oCAAoC;QACpC,MAAM,WAAW,GAAG,aAAa;YAC/B,CAAC,CAAC,4BAA4B,CAC1B,eAAe,EACf,QAAQ,EACR,WAAW,EACX,YAAY,EACZ,UAAU,EACV,WAAW,EACX,KAAK,CACN;YACH,CAAC,CAAC,SAAS,CAAC;QAEd,OAAO;YACL,GAAG,MAAM;YACT,KAAK,EAAE,eAAe;YACtB,WAAW;YACX,+DAA+D;YAC/D,mEAAmE;YACnE,8DAA8D;YAC9D,oEAAoE;YACpE,QAAQ,EAAE;gBACR,GAAI,MAAM,CAAC,QAAoC;gBAC/C,gEAAgE;gBAChE,yDAAyD;gBACzD,6DAA6D;gBAC7D,iEAAiE;gBACjE,6BAA6B;gBAC7B,kBAAkB,EAAE,WAAW,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;aACtC;SAC5B,CAAC;IACJ,CAAC,CACF,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,4BAA4B,CAC1C,UAAkB,EAClB,QAAgB,EAChB,WAAoB,EACpB,YAAqB,EACrB,UAAmB,EACnB,WAAoB,EACpB,YAAqB;IAErB,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,WAAW,IAAI,IAAI,IAAI,UAAU,IAAI,IAAI,EAAE,CAAC;QAC9C,KAAK,CAAC,IAAI,CACR,WAAW,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,UAAU,GAAG,CAAC,GAAG,CACvE,CAAC;IACJ,CAAC;IAED,IAAI,YAAY,IAAI,IAAI,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;QAChD,KAAK,CAAC,IAAI,CACR,YAAY,CAAC,YAAY,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,WAAW,GAAG,CAAC,GAAG,CAC1E,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GACb,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QACjB,WAAW,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAE9E,OAAO;QACL,UAAU;QACV,WAAW,EAAE,WAAW,IAAI,SAAS;QACrC,YAAY,EAAE,YAAY,IAAI,SAAS;QACvC,QAAQ;QACR,UAAU,EAAE,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;QAC3D,WAAW,EAAE,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;QAC9D,YAAY,EAAE,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;QACjE,SAAS;KACV,CAAC;AACJ,CAAC"}

package/dist/services/search/rlm-indexing.d.ts

@@ -0,0 +1,71 @@
+/**
+ * rlm-indexing — indexing lifecycle delegates for ContextualSearchRLM.
+ *
+ * Extracted (M14 Phase 3, T3.1) from contextual-search-rlm.ts. Behavior is
+ * byte-preserved: bodies moved verbatim with `this` → `rlm`. The class keeps
+ * the static `indexingLocks` mutex map and `_indexProjectInternal` /
+ * `ensureInitialized` as instance delegate methods (test monkey-patches them
+ * on the instance; see design.md "Delegate-preservation contract").
+ */
+import type { ContextualSearchRLM } from "./contextual-search-rlm.js";
+export type IndexProjectOptions = {
+    onProgress?: (current: number, total: number) => void;
+};
+export type IndexProjectResult = {
+    filesIndexed: number;
+    chunksIndexed: number;
+    errors: number;
+};
+export type EnsureFreshIndexOptions = {
+    allowFullReindex?: boolean;
+    maxSyncFiles?: number;
+};
+export type EnsureFreshIndexResult = {
+    wasStale: boolean;
+    reindexed: boolean;
+    reason?: string;
+    deferred?: boolean;
+    filesPending?: number;
+};
+export type SearchAdmissionResult = {
+    admitted: boolean;
+    error?: string;
+    stale?: {
+        reason: string;
+        modifiedFiles?: number;
+        newFiles?: number;
+        deletedFiles?: number;
+    };
+};
+/**
+ * Per-project queue mutex: serializes concurrent indexing for the same project.
+ *
+ * Pattern: each caller chains its lock after the current tail, then waits for
+ * the previous lock before proceeding. This guarantees correct ordering for any
+ * number of concurrent callers (3+), unlike a simple check-and-set.
+ *
+ *   A sets map[proj] = lock_A, awaits null  → starts immediately
+ *   B sets map[proj] = lock_B, awaits lock_A → waits for A
+ *   C sets map[proj] = lock_C, awaits lock_B → waits for B
+ *   A finishes → releases lock_A → B starts
+ *   B finishes → releases lock_B → C starts
+ *   C finishes → map[proj] === lock_C, so we clean up the entry
+ *
+ * The `try { await work() } finally { delete-if-still-owner; releaseLock() }`
+ * shape is load-bearing: `releaseLock()` MUST run even when `work` throws, or
+ * the lock leaks and subsequent callers hang (BUG-SYN-4).
+ *
+ * `work` is `() => this._indexProjectInternal(...)` in the caller — a lambda
+ * that captures virtual dispatch through `this`, so test monkey-patches on the
+ * instance still route. Do NOT inline a direct call to a module function here.
+ */
+export declare function runWithIndexLock<T>(lockMap: Map<string, Promise<void>>, projectId: string, work: () => Promise<T>): Promise<T>;
+export declare function _indexProjectInternalImpl(rlm: ContextualSearchRLM, projectPath: string, projectId: string, options?: IndexProjectOptions): Promise<IndexProjectResult>;
+export declare function ensureFreshIndexImpl(rlm: ContextualSearchRLM, projectId: string, projectPath: string, options?: EnsureFreshIndexOptions): Promise<EnsureFreshIndexResult>;
+export declare function checkSearchAdmissionImpl(rlm: ContextualSearchRLM, projectId: string, projectPath?: string): Promise<SearchAdmissionResult>;
+export declare function indexFileImpl(rlm: ContextualSearchRLM, filePath: string, projectId: string, projectRoot: string, centralityMap?: Map<string, number>): Promise<{
+    chunks: number;
+}>;
+export declare function loadGitignoreImpl(projectPath: string): Promise<import("ignore").Ignore>;
+export declare function ensureInitializedImpl(rlm: ContextualSearchRLM): Promise<void>;
+//# sourceMappingURL=rlm-indexing.d.ts.map

package/dist/services/search/rlm-indexing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rlm-indexing.d.ts","sourceRoot":"","sources":["../../../src/services/search/rlm-indexing.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAoBH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAMtE,MAAM,MAAM,mBAAmB,GAAG;IAChC,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;CACvD,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG;IACpC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB,CAAC;AAEF,MAAM,MAAM,sBAAsB,GAAG;IACnC,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB,CAAC;AAEF,MAAM,MAAM,qBAAqB,GAAG;IAClC,QAAQ,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE;QACN,MAAM,EAAE,MAAM,CAAC;QACf,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,YAAY,CAAC,EAAE,MAAM,CAAC;KACvB,CAAC;CACH,CAAC;AAIF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAsB,gBAAgB,CAAC,CAAC,EACtC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,EACnC,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GACrB,OAAO,CAAC,CAAC,CAAC,CAsBZ;AAID,wBAAsB,yBAAyB,CAC7C,GAAG,EAAE,mBAAmB,EACxB,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE,mBAAwB,GAChC,OAAO,CAAC,kBAAkB,CAAC,CAgH7B;AAID,wBAAsB,oBAAoB,CACxC,GAAG,EAAE,mBAAmB,EACxB,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,sBAAsB,CAAC,CAkLjC;AAID,wBAAsB,wBAAwB,CAC5C,GAAG,EAAE,mBAAmB,EACxB,SAAS,EAAE,MAAM,EACjB,WAAW,CAAC,EAAE,MAAM,GACnB,OAAO,CAAC,qBAAqB,CAAC,CA8BhC;AAID,wBAAsB,aAAa,CACjC,GAAG,EAAE,mBAAmB,EACxB,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,OAAO,CAAC;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAyD7B;AAID,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,MAAM,oCAEpD;AAID,wBAAsB,qBAAqB,CAAC,GAAG,EAAE,mBAAmB,GAAG,OAAO,CAAC,IAAI,CAAC,CAuCnF"}