@massa-ai/core 1.2.1

package/dist/services/search/lexical-search.d.ts

@@ -0,0 +1,83 @@
+/**
+ * Lexical search helpers: trigram query sanitization, Levenshtein fuzzy
+ * correction, and proximity/title re-ranking.
+ *
+ * These are pure functions (no I/O, no DB coupling) so they can be unit-tested
+ * in isolation and shared across the PostgreSQL + PG keyword stores and the fusion
+ * layer in contextual-search-rlm.ts.
+ *
+ * Algorithm references (rewritten fresh in TS, not copied):
+ *  - RRF multi-stream fusion + proximity rerank: Cormack et al. 2009; the
+ *    minSpan/adjacent-pair window approach layers a positional signal on top
+ *    of rank-based RRF.
+ *  - Levenshtein fuzzy correction over a per-store vocabulary table,
+ *    length-bounded by maxEditDistance and LRU-cached at the call site.
+ */
+import type { SearchResult } from "@massa-ai/shared";
+/**
+ * Common words that match everywhere and dilute BM25/proximity scoring.
+ * Filtered from proximity/title/fuzzy paths; kept as a fallback when every
+ * query term is a stopword so a query never produces an empty term list.
+ */
+export declare const STOPWORDS: Set<string>;
+/**
+ * Build an FTS5 trigram MATCH expression from a raw query.
+ *
+ * Trigram tokenizers match 3-char substrings, so very short tokens (<3 chars)
+ * are dropped (they cannot form a trigram and would yield zero matches). The
+ * result is an OR-joined quoted-token list suitable for `WHERE tbl MATCH ?`.
+ * Returns "" when no usable tokens remain — callers should treat "" as
+ * "skip the trigram stream".
+ *
+ * mode "OR" broadens recall (any token matches); "AND" narrows it. We default
+ * to OR so the trigram stream supplements (not replaces) the porter keyword
+ * stream in RRF fusion.
+ */
+export declare function sanitizeTrigramQuery(query: string, mode?: "AND" | "OR"): string;
+/**
+ * Classic two-row Levenshtein edit distance. O(a.length * b.length) time,
+ * O(b.length) space.
+ */
+export declare function levenshtein(a: string, b: string): number;
+/**
+ * Length-tolerant max edit distance. Longer words tolerate more edits because
+ * a single typo/inflection is proportionally smaller. Short words (≤4 chars)
+ * get distance 1 to avoid spurious corrections of "is"→"if" style noise.
+ */
+export declare function maxEditDistance(wordLength: number): number;
+/** Find all character positions of `term` in `text` (ascending). */
+export declare function findAllPositions(text: string, term: string): number[];
+/**
+ * Minimum window span covering at least one position from each list.
+ * Sweep-line: repeatedly advance the pointer at the current minimum until any
+ * list is exhausted. Returns Infinity for empty input, 0 for a single list.
+ */
+export declare function findMinSpan(positionLists: number[][]): number;
+/**
+ * Count matched adjacent pairs across consecutive query terms within `gap`
+ * chars. Each right position is consumed by at most one left position so a
+ * repeated token like "foo foo bar" counts 1 pair, not 2. Layers a saturating
+ * phrase-frequency signal on top of minSpan proximity.
+ */
+export declare function countAdjacentPairs(positionLists: number[][], terms: string[], gap?: number): number;
+/**
+ * Extract query terms for proximity/title scoring: lowercase, split on
+ * whitespace, drop very short tokens, then filter stopwords (falling back to
+ * all terms when every term is a stopword so the term list is never empty).
+ */
+export declare function extractQueryTerms(query: string): string[];
+/**
+ * Proximity + title re-ranking pass.
+ *
+ * Boosts results whose title contains query terms and whose body positions the
+ * query terms close together. Code chunks get a stronger title boost
+ * (function/class names are high signal); prose chunks get a moderate one.
+ *
+ * This is a STABLE re-rank on top of RRF: results are sorted by boost (desc)
+ * with the original rank as tiebreaker, so equally-boosted results keep their
+ * RRF order. Applied after fusion, before minScore/file-chunk limiting.
+ *
+ * Pure over inputs — safe to unit-test without a DB.
+ */
+export declare function applyProximityRerank(results: SearchResult[], query: string): SearchResult[];
+//# sourceMappingURL=lexical-search.d.ts.map

package/dist/services/search/lexical-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lexical-search.d.ts","sourceRoot":"","sources":["../../../src/services/search/lexical-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAMrD;;;;GAIG;AACH,eAAO,MAAM,SAAS,aAWpB,CAAC;AAmBH;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,KAAK,GAAG,IAAW,GACxB,MAAM,CAYR;AAMD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAexD;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAI1D;AAMD,oEAAoE;AACpE,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CASrE;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,aAAa,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,CA+B7D;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,aAAa,EAAE,MAAM,EAAE,EAAE,EACzB,KAAK,EAAE,MAAM,EAAE,EACf,GAAG,GAAE,MAAW,GACf,MAAM,CAoBR;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAOzD;AAmCD;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,YAAY,EAAE,EACvB,KAAK,EAAE,MAAM,GACZ,YAAY,EAAE,CAuDhB"}

package/dist/services/search/lexical-search.js

@@ -0,0 +1,297 @@
+/**
+ * Lexical search helpers: trigram query sanitization, Levenshtein fuzzy
+ * correction, and proximity/title re-ranking.
+ *
+ * These are pure functions (no I/O, no DB coupling) so they can be unit-tested
+ * in isolation and shared across the PostgreSQL + PG keyword stores and the fusion
+ * layer in contextual-search-rlm.ts.
+ *
+ * Algorithm references (rewritten fresh in TS, not copied):
+ *  - RRF multi-stream fusion + proximity rerank: Cormack et al. 2009; the
+ *    minSpan/adjacent-pair window approach layers a positional signal on top
+ *    of rank-based RRF.
+ *  - Levenshtein fuzzy correction over a per-store vocabulary table,
+ *    length-bounded by maxEditDistance and LRU-cached at the call site.
+ */
+// ─────────────────────────────────────────────────────────────────────────────
+// Stopwords
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Common words that match everywhere and dilute BM25/proximity scoring.
+ * Filtered from proximity/title/fuzzy paths; kept as a fallback when every
+ * query term is a stopword so a query never produces an empty term list.
+ */
+export const STOPWORDS = new Set([
+    "the", "and", "for", "are", "but", "not", "you", "all", "can", "had",
+    "her", "was", "one", "our", "out", "has", "his", "how", "its", "may",
+    "new", "now", "old", "see", "way", "who", "did", "get", "got", "let",
+    "say", "she", "too", "use", "will", "with", "this", "that", "from",
+    "they", "been", "have", "many", "some", "them", "than", "each", "make",
+    "like", "just", "over", "such", "take", "into", "year", "your", "good",
+    "could", "would", "about", "which", "their", "there", "other", "after",
+    "should", "through", "also", "more", "most", "only", "very", "when",
+    "what", "then", "these", "those", "being", "does", "done", "both",
+    "same", "still", "while", "where", "here", "were", "much",
+]);
+// ─────────────────────────────────────────────────────────────────────────────
+// Trigram query sanitization
+// ─────────────────────────────────────────────────────────────────────────────
+function dedupeTokens(tokens) {
+    const seen = new Set();
+    const out = [];
+    for (const t of tokens) {
+        const key = t.toLowerCase();
+        if (!seen.has(key)) {
+            seen.add(key);
+            out.push(t);
+        }
+    }
+    return out;
+}
+/**
+ * Build an FTS5 trigram MATCH expression from a raw query.
+ *
+ * Trigram tokenizers match 3-char substrings, so very short tokens (<3 chars)
+ * are dropped (they cannot form a trigram and would yield zero matches). The
+ * result is an OR-joined quoted-token list suitable for `WHERE tbl MATCH ?`.
+ * Returns "" when no usable tokens remain — callers should treat "" as
+ * "skip the trigram stream".
+ *
+ * mode "OR" broadens recall (any token matches); "AND" narrows it. We default
+ * to OR so the trigram stream supplements (not replaces) the porter keyword
+ * stream in RRF fusion.
+ */
+export function sanitizeTrigramQuery(query, mode = "OR") {
+    const cleaned = query.replace(/["'(){}[\]*:^~]/g, "").trim();
+    if (cleaned.length < 3)
+        return "";
+    const words = dedupeTokens(cleaned.split(/\s+/).filter((w) => w.length >= 3));
+    if (words.length === 0)
+        return "";
+    const meaningful = words.filter((w) => !STOPWORDS.has(w.toLowerCase()));
+    const final = meaningful.length > 0 ? meaningful : words;
+    return final.map((w) => `"${w}"`).join(mode === "OR" ? " OR " : " ");
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Levenshtein fuzzy correction
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Classic two-row Levenshtein edit distance. O(a.length * b.length) time,
+ * O(b.length) space.
+ */
+export function levenshtein(a, b) {
+    if (a.length === 0)
+        return b.length;
+    if (b.length === 0)
+        return a.length;
+    let prev = Array.from({ length: b.length + 1 }, (_, i) => i);
+    for (let i = 1; i <= a.length; i++) {
+        const curr = [i];
+        for (let j = 1; j <= b.length; j++) {
+            curr[j] =
+                a[i - 1] === b[j - 1]
+                    ? prev[j - 1]
+                    : 1 + Math.min(prev[j], curr[j - 1], prev[j - 1]);
+        }
+        prev = curr;
+    }
+    return prev[b.length];
+}
+/**
+ * Length-tolerant max edit distance. Longer words tolerate more edits because
+ * a single typo/inflection is proportionally smaller. Short words (≤4 chars)
+ * get distance 1 to avoid spurious corrections of "is"→"if" style noise.
+ */
+export function maxEditDistance(wordLength) {
+    if (wordLength <= 4)
+        return 1;
+    if (wordLength <= 12)
+        return 2;
+    return 3;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Proximity helpers (positional re-ranking)
+// ─────────────────────────────────────────────────────────────────────────────
+/** Find all character positions of `term` in `text` (ascending). */
+export function findAllPositions(text, term) {
+    const positions = [];
+    if (term.length === 0)
+        return positions;
+    let idx = text.indexOf(term);
+    while (idx !== -1) {
+        positions.push(idx);
+        idx = text.indexOf(term, idx + 1);
+    }
+    return positions;
+}
+/**
+ * Minimum window span covering at least one position from each list.
+ * Sweep-line: repeatedly advance the pointer at the current minimum until any
+ * list is exhausted. Returns Infinity for empty input, 0 for a single list.
+ */
+export function findMinSpan(positionLists) {
+    if (positionLists.length === 0)
+        return Infinity;
+    if (positionLists.length === 1)
+        return 0;
+    const ptrs = new Array(positionLists.length).fill(0);
+    let minSpan = Infinity;
+    while (true) {
+        let curMin = Infinity;
+        let curMax = -Infinity;
+        let minIdx = 0;
+        for (let i = 0; i < positionLists.length; i++) {
+            const val = positionLists[i][ptrs[i]];
+            if (val < curMin) {
+                curMin = val;
+                minIdx = i;
+            }
+            if (val > curMax) {
+                curMax = val;
+            }
+        }
+        const span = curMax - curMin;
+        if (span < minSpan)
+            minSpan = span;
+        ptrs[minIdx]++;
+        if (ptrs[minIdx] >= positionLists[minIdx].length)
+            break;
+    }
+    return minSpan;
+}
+/**
+ * Count matched adjacent pairs across consecutive query terms within `gap`
+ * chars. Each right position is consumed by at most one left position so a
+ * repeated token like "foo foo bar" counts 1 pair, not 2. Layers a saturating
+ * phrase-frequency signal on top of minSpan proximity.
+ */
+export function countAdjacentPairs(positionLists, terms, gap = 30) {
+    if (positionLists.length < 2 || terms.length < 2)
+        return 0;
+    let total = 0;
+    const pairs = Math.min(positionLists.length, terms.length) - 1;
+    for (let i = 0; i < pairs; i++) {
+        const left = positionLists[i];
+        const right = positionLists[i + 1];
+        const leftLen = terms[i].length;
+        let j = 0;
+        for (const p of left) {
+            const minStart = p + leftLen;
+            const maxStart = minStart + gap;
+            while (j < right.length && right[j] < minStart)
+                j++;
+            if (j < right.length && right[j] <= maxStart) {
+                total++;
+                j++;
+            }
+        }
+    }
+    return total;
+}
+/**
+ * Extract query terms for proximity/title scoring: lowercase, split on
+ * whitespace, drop very short tokens, then filter stopwords (falling back to
+ * all terms when every term is a stopword so the term list is never empty).
+ */
+export function extractQueryTerms(query) {
+    const all = query
+        .toLowerCase()
+        .split(/\s+/)
+        .filter((w) => w.length >= 2);
+    const filtered = all.filter((w) => !STOPWORDS.has(w));
+    return filtered.length > 0 ? filtered : all;
+}
+/**
+ * Resolve a "title" for a SearchResult for proximity/title boosting.
+ * Prefers explicit metadata fields (label, parentSymbol, symbolName, filePath)
+ * then falls back to the first content line, mirroring how chunks are titled
+ * at index time.
+ */
+function resolveTitle(result) {
+    const meta = (result.metadata ?? {});
+    const candidates = [
+        meta.label,
+        meta.parentSymbol,
+        meta.symbolName,
+        meta.filePath,
+    ];
+    for (const c of candidates) {
+        if (typeof c === "string" && c.length > 0)
+            return c;
+    }
+    const firstLine = result.content.split("\n", 1)[0] ?? "";
+    return firstLine.slice(0, 80);
+}
+/**
+ * Detect whether a result is a code chunk (stronger title boost applies).
+ * Code chunks carry `type` metadata like "code_block", or a language/parentSymbol.
+ */
+function isCodeResult(result) {
+    const meta = (result.metadata ?? {});
+    const type = meta.type;
+    if (type === "code_block")
+        return true;
+    if (typeof meta.language === "string" && meta.language.length > 0)
+        return true;
+    return false;
+}
+/**
+ * Proximity + title re-ranking pass.
+ *
+ * Boosts results whose title contains query terms and whose body positions the
+ * query terms close together. Code chunks get a stronger title boost
+ * (function/class names are high signal); prose chunks get a moderate one.
+ *
+ * This is a STABLE re-rank on top of RRF: results are sorted by boost (desc)
+ * with the original rank as tiebreaker, so equally-boosted results keep their
+ * RRF order. Applied after fusion, before minScore/file-chunk limiting.
+ *
+ * Pure over inputs — safe to unit-test without a DB.
+ */
+export function applyProximityRerank(results, query) {
+    const terms = extractQueryTerms(query);
+    if (results.length === 0)
+        return results;
+    const decorated = results.map((result, index) => {
+        const titleLower = resolveTitle(result).toLowerCase();
+        const titleHits = terms.filter((t) => titleLower.includes(t)).length;
+        const titleWeight = isCodeResult(result) ? 0.6 : 0.3;
+        const titleBoost = titleHits > 0 ? titleWeight * (titleHits / terms.length) : 0;
+        let proximityBoost = 0;
+        let phraseBoost = 0;
+        if (terms.length >= 2) {
+            const content = result.content.toLowerCase();
+            const positions = terms.map((t) => findAllPositions(content, t));
+            if (!positions.some((p) => p.length === 0)) {
+                const minSpan = findMinSpan(positions);
+                proximityBoost = 1 / (1 + minSpan / Math.max(content.length, 1));
+                const adjacentPairs = countAdjacentPairs(positions, terms);
+                phraseBoost = 0.5 * Math.min(1, adjacentPairs / 4);
+            }
+        }
+        return {
+            result,
+            boost: titleBoost + proximityBoost + phraseBoost,
+            rank: index,
+        };
+    });
+    // RRF remains the primary ranking contract. Proximity only breaks ties
+    // inside contiguous groups whose final scores differ by <= 1 percentage
+    // point. Sorting the entire pool by raw lexical boost previously let a weak
+    // rank-40 result jump to rank 1 on an incidental short substring match.
+    const output = [];
+    for (let start = 0; start < decorated.length;) {
+        let end = start + 1;
+        while (end < decorated.length &&
+            Math.abs(decorated[end].result.score - decorated[start].result.score) <= 0.01) {
+            end++;
+        }
+        const group = decorated
+            .slice(start, end)
+            .sort((a, b) => b.boost - a.boost || a.rank - b.rank);
+        output.push(...group.map(({ result }) => result));
+        start = end;
+    }
+    return output;
+}
+//# sourceMappingURL=lexical-search.js.map

package/dist/services/search/lexical-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lexical-search.js","sourceRoot":"","sources":["../../../src/services/search/lexical-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,gFAAgF;AAChF,YAAY;AACZ,gFAAgF;AAEhF;;;;GAIG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS;IACvC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;IACpE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;IACpE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;IACpE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAClE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IACtE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IACtE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IACtE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IACnE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IACjE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAC1D,CAAC,CAAC;AAEH,gFAAgF;AAChF,6BAA6B;AAC7B,gFAAgF;AAEhF,SAAS,YAAY,CAAC,MAAgB;IACpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAa,EACb,OAAqB,IAAI;IAEzB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,YAAY,CACxB,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAClD,CAAC;IACF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACxE,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC;IAEzD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,gFAAgF;AAChF,+BAA+B;AAC/B,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IACpC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IACpC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACnB,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBACb,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACxB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,UAAkB;IAChD,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,UAAU,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IAC/B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,gFAAgF;AAChF,4CAA4C;AAC5C,gFAAgF;AAEhF,oEAAoE;AACpE,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,IAAY;IACzD,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC7B,OAAO,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QAClB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,aAAyB;IACnD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAChD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEzC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,OAAO,GAAG,QAAQ,CAAC;IAEvB,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,MAAM,GAAG,QAAQ,CAAC;QACtB,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;QACvB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;gBACjB,MAAM,GAAG,GAAG,CAAC;gBACb,MAAM,GAAG,CAAC,CAAC;YACb,CAAC;YACD,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;gBACjB,MAAM,GAAG,GAAG,CAAC;YACf,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC;QAC7B,IAAI,IAAI,GAAG,OAAO;YAAE,OAAO,GAAG,IAAI,CAAC;QAEnC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACf,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,MAAM;YAAE,MAAM;IAC1D,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,aAAyB,EACzB,KAAe,EACf,MAAc,EAAE;IAEhB,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC;YAC7B,MAAM,QAAQ,GAAG,QAAQ,GAAG,GAAG,CAAC;YAChC,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ;gBAAE,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC7C,KAAK,EAAE,CAAC;gBACR,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,MAAM,GAAG,GAAG,KAAK;SACd,WAAW,EAAE;SACb,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAChC,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC;AAC9C,CAAC;AAED;;;;;GAKG;AACH,SAAS,YAAY,CAAC,MAAoB;IACxC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,CAA4B,CAAC;IAChE,MAAM,UAAU,GAAG;QACjB,IAAI,CAAC,KAAK;QACV,IAAI,CAAC,YAAY;QACjB,IAAI,CAAC,UAAU;QACf,IAAI,CAAC,QAAQ;KACd,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACzD,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAChC,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,MAAoB;IACxC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,CAA4B,CAAC;IAChE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,IAAI,IAAI,KAAK,YAAY;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/E,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAAuB,EACvB,KAAa;IAEb,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAEzC,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;QAC5C,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;QACtD,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACrE,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACrD,MAAM,UAAU,GACd,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/D,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YAEjE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;gBACvC,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;gBAEjE,MAAM,aAAa,GAAG,kBAAkB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAC3D,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM;YACN,KAAK,EAAE,UAAU,GAAG,cAAc,GAAG,WAAW;YAChD,IAAI,EAAE,KAAK;SACZ,CAAC;IACJ,CAAC,CAAC,CAAC;IAEL,uEAAuE;IACvE,wEAAwE;IACxE,4EAA4E;IAC5E,wEAAwE;IACxE,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC;QAC9C,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;QACpB,OACE,GAAG,GAAG,SAAS,CAAC,MAAM;YACtB,IAAI,CAAC,GAAG,CACN,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAC5D,IAAI,IAAI,EACT,CAAC;YACD,GAAG,EAAE,CAAC;QACR,CAAC;QACD,MAAM,KAAK,GAAG,SAAS;aACpB,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC;aACjB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAClD,KAAK,GAAG,GAAG,CAAC;IACd,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/services/search/query-understanding.d.ts

@@ -0,0 +1,115 @@
+/**
+ * Query Understanding (Phase 2, plan item 4).
+ *
+ * Expands the user's query before the vector/keyword fan-out:
+ *   1. `rewriteQuery` — LLM produces structured `{ expansions, keywords }`
+ *      via `llmObject` + a zod schema (rejects malformed/empty output).
+ *   2. `hyde` — LLM produces a hypothetical implementation paragraph, which
+ *      is then **embedded with the existing EmbeddingService** (no new
+ *      provider spawned) and returned as an extra vector-query stream.
+ *
+ * Contract (cross-cutting §1 + spec NF1):
+ *   - Default-off via `config.search.queryUnderstanding.enabled`.
+ *   - Silent degradation: on any LLM throw / timeout / disabled, `understand()`
+ *     returns `null` → caller falls through to the original 2-stream search.
+ *     NEVER blocks search, NEVER throws to the caller.
+ *   - HyDE's embed call runs ONLY after the LLM step succeeds (no wasted work).
+ *
+ * Pure over its inputs + the injected `llm` handle + the injected `embedFn`,
+ * so tests inject fakes without touching config or network.
+ */
+import { z } from "zod";
+/** Non-empty arrays, bounded length. `llmObject` returns `{ok:false}` on zod failure. */
+export declare const QueryRewriteSchema: z.ZodObject<{
+    expansions: z.ZodArray<z.ZodString>;
+    keywords: z.ZodArray<z.ZodString>;
+}, z.core.$strip>;
+export type QueryRewrite = z.infer<typeof QueryRewriteSchema>;
+/** Injectable LLM surface (matches the `llm` export from llm-client.ts). */
+export interface QueryLlmSurface {
+    complete(prompt: string, opts?: {
+        system?: string;
+        timeoutMs?: number;
+        modelRole?: "instruct" | "code";
+    }): Promise<{
+        ok: boolean;
+        value?: string;
+        error?: string;
+    }>;
+    object<T>(prompt: string, schema: z.ZodSchema<T>, opts?: {
+        system?: string;
+        timeoutMs?: number;
+        modelRole?: "instruct" | "code";
+    }): Promise<{
+        ok: boolean;
+        value?: T;
+        error?: string;
+    }>;
+    isEnabled(): boolean;
+}
+/** Inject an embed function so tests don't touch the EmbeddingService singleton. */
+export type EmbedFn = (text: string) => Promise<number[]>;
+export interface QueryUnderstandingResult {
+    expansions: string[];
+    keywords: string[];
+    /** Null when HyDE is disabled, the LLM step failed, or the embed call threw. */
+    hydeVector: number[] | null;
+}
+/**
+ * Rewrite the query into structured expansions + keywords. Returns `null`
+ * when the LLM is disabled, times out, throws, or returns zod-invalid output
+ * (P2-REWRITE-01/02/03). Never throws.
+ */
+export declare function rewriteQuery(query: string, surface: QueryLlmSurface, opts?: {
+    timeoutMs?: number;
+}): Promise<QueryRewrite | null>;
+/**
+ * Generate a hypothetical implementation paragraph and embed it. The embed
+ * call runs ONLY if the LLM step succeeded (P2-HYDE-02). Uses the **existing**
+ * EmbeddingService via the injected `embedFn` (P2-HYDE-03). Returns `null` on
+ * any failure; never throws.
+ */
+export declare function hyde(query: string, surface: QueryLlmSurface, embedFn: EmbedFn, opts?: {
+    timeoutMs?: number;
+}): Promise<number[] | null>;
+/**
+ * Orchestrates rewrite + HyDE behind a per-`(projectId, query)` cache.
+ * `understand()` returns `null` on any failure path → caller falls through.
+ */
+export declare class QueryUnderstandingService {
+    private readonly llmSurface;
+    private readonly embedFn;
+    private readonly cache;
+    /** Capture the last-call telemetry for tests/observability. */
+    lastHydeUsed: boolean;
+    constructor(opts?: {
+        llmSurface?: QueryLlmSurface;
+        embedFn?: EmbedFn;
+        cacheTtlMs?: number;
+        cacheMaxSize?: number;
+    });
+    /**
+     * Run rewrite + HyDE for `(query, projectId)`. Cached per the configured TTL.
+     * Returns `null` on any failure / disabled → caller's original search path.
+     * Never throws.
+     */
+    understand(query: string, projectId: string): Promise<QueryUnderstandingResult | null>;
+    /** @internal — clear cache between tests. */
+    clearCache(): void;
+    /**
+     * Drop only rewrite/HyDE entries for this projectId (post-commit invalidator
+     * hook for project rename/merge). See QueryUnderstandingCache.invalidateProject.
+     */
+    invalidateProject(projectId: string): void;
+}
+/**
+ * Build a quoted FTS5 OR query from the original query + keywords. Each term
+ * is FTS5-quoted (internal `"` doubled) and joined with `OR` so the keyword
+ * search treats them as a recall-broadening disjunction. Mirrors the per-term
+ * quoting that `sanitizeFTS5Query` applies, but operates on already-distinct
+ * terms (calling sanitizeFTS5Query on the composed string would re-split the
+ * quoted phrases). Returns a sanitized form of the original query when no
+ * keywords survive cleaning.
+ */
+export declare function buildRewrittenFTSQuery(query: string, keywords: string[]): string;
+//# sourceMappingURL=query-understanding.d.ts.map

package/dist/services/search/query-understanding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-understanding.d.ts","sourceRoot":"","sources":["../../../src/services/search/query-understanding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAQxB,yFAAyF;AACzF,eAAO,MAAM,kBAAkB;;;iBAG7B,CAAC;AAEH,MAAM,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,kBAAkB,CAAC,CAAC;AAI9D,4EAA4E;AAC5E,MAAM,WAAW,eAAe;IAC9B,QAAQ,CACN,MAAM,EAAE,MAAM,EACd,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,UAAU,GAAG,MAAM,CAAA;KAAE,GAC9E,OAAO,CAAC;QAAE,EAAE,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC5D,MAAM,CAAC,CAAC,EACN,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EACtB,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,UAAU,GAAG,MAAM,CAAA;KAAE,GAC9E,OAAO,CAAC;QAAE,EAAE,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvD,SAAS,IAAI,OAAO,CAAC;CACtB;AAED,oFAAoF;AACpF,MAAM,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;AAI1D,MAAM,WAAW,wBAAwB;IACvC,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,gFAAgF;IAChF,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;CAC7B;AA4BD;;;;GAIG;AACH,wBAAsB,YAAY,CAChC,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,eAAe,EACxB,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAChC,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAiB9B;AAED;;;;;GAKG;AACH,wBAAsB,IAAI,CACxB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,eAAe,EACxB,OAAO,EAAE,OAAO,EAChB,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAChC,OAAO,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAoB1B;AAuED;;;GAGG;AACH,qBAAa,yBAAyB;IACpC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAkB;IAC7C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAU;IAClC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA0B;IAChD,+DAA+D;IAC/D,YAAY,EAAE,OAAO,CAAS;gBAElB,IAAI,GAAE;QAChB,UAAU,CAAC,EAAE,eAAe,CAAC;QAC7B,OAAO,CAAC,EAAE,OAAO,CAAC;QAClB,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,YAAY,CAAC,EAAE,MAAM,CAAC;KAClB;IAgBN;;;;OAIG;IACG,UAAU,CACd,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,wBAAwB,GAAG,IAAI,CAAC;IAsC3C,6CAA6C;IAC7C,UAAU,IAAI,IAAI;IAIlB;;;OAGG;IACH,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;CAG3C;AAID;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAAE,GACjB,MAAM,CAWR"}