@spikedpunch/mast 0.1.0

package/dist/search/fused.d.ts

@@ -0,0 +1,110 @@
+import type { SearchInput, SearchResult, SearchSuggestion, RelatedHint } from '../ast/types.js';
+import type { Db } from '../graph/db.js';
+import type { ChunkStore, ChunkRecord } from '../store/sqliteChunkStore.js';
+import { type DeclexDiagnostics } from './declex.js';
+/**
+ * RRF score for a document at rank `r` (1-indexed) with fusion constant `k`.
+ *
+ * Standard formula: Score(d) = Σ 1/(k + r(d)) over all rankers.
+ * The default k=60 dampens rank differences — a #1 vs #2 gap matters less
+ * than the absolute score gap would suggest.
+ */
+export declare function rrfScore(rank: number, k: number): number;
+export interface FusedSearchConfig {
+    readonly rrf_k: number;
+    /**
+     * F18 kill-switch (M2 decision memo condition 3) — fuses ranker D
+     * (declaration-exact, `./declex.ts`) into RRF as a third input. OPTIONAL,
+     * and absent means OFF: the eval instruments (`eval/*-rank-check.mjs`,
+     * frozen at the `mast-pre-vector-delete` tag per IMPLEMENTATION_PLAN.md
+     * Stage 7) call this function directly to reconstruct measured experiment
+     * arms, so a function-level default-on would silently contaminate future
+     * instrument re-runs against a config shape they never asked for. The
+     * product's default-on lives in `MastConfig` DEFAULTS (`store/config.ts`) —
+     * the config layer a kill-switch belongs to, not the function signature
+     * every caller (including eval) shares.
+     */
+    readonly declaration_exact_ranker?: boolean;
+}
+/**
+ * One chunk whose fused rank differs between the shipped (with-D) ranking
+ * and the reconstructed without-D ranking.
+ *
+ * `rank_with_d`/`rank_without_d` are the ACTUAL 1-based fused rank in each
+ * list — not `null` for a merely-displaced-out-of-window entry. `null` is
+ * reserved for genuine absence from that list (a D-only chunk has no
+ * `rank_without_d` because it never entered the without-D candidate pool at
+ * all). This is a deliberate refinement of IMPLEMENTATION_PLAN.md Stage 6
+ * design decision 4, which sketched reporting `null` for anything pushed out
+ * of the window — the shipped contract is strictly more informative;
+ * consumers who want window semantics compare the reported rank against
+ * `limit` themselves.
+ */
+export interface DeclexWindowEffect {
+    readonly chunk_id: string;
+    /** From the already-fetched chunk records; `null` when the id fell outside the fetched candidate pool entirely. */
+    readonly symbol_name: string | null;
+    readonly rank_with_d: number | null;
+    readonly rank_without_d: number | null;
+}
+/**
+ * D-fire telemetry attached to `fusedSearch`'s return, present ONLY when
+ * ranker D actually fired (`fired` is always `true` here by construction —
+ * the field itself is omitted, not set to `{fired: false}`, when D was
+ * silent or the flag was off).
+ */
+export interface DeclexTelemetry {
+    readonly fired: true;
+    readonly top_match_channel: DeclexDiagnostics['top_match_channel'];
+    readonly candidate_count: number;
+    readonly window_effects: readonly DeclexWindowEffect[];
+}
+/**
+ * BM25 lexical search fused with ranker D (declaration-exact, `./declex.ts`)
+ * via Reciprocal Rank Fusion.
+ *
+ * Stage 7 (IMPLEMENTATION_PLAN.md "Stage 7: Vector-store deletion") excised
+ * the vector leg entirely — `mast_search` is FTS + ranker D only now, and
+ * Stage 7.2 renamed this function (decision 4): its old name asserted a
+ * vector-plus-lexical fusion that no longer exists. The response no longer
+ * carries a search-mode discriminator or a per-result similarity score —
+ * both described the retired vector leg and have no honest value to report
+ * now that it's gone.
+ *
+ * Post-filters (`chunk_type`, `only_exported`) are applied after RRF ranking,
+ * on the full chunk records fetched from `chunkStore`.
+ *
+ * The scope filters (`file_pattern`, `language`) are NOT post-filters: each
+ * ranker applies them to its own candidate pool, through the shared
+ * `./scope.ts`, before that pool is capped. Applying them here instead would
+ * spend each ranker's candidate budget on rows about to be discarded. Anything
+ * later fused into this function must be scoped the same way — the union below
+ * is what carries a leak into the result set, and `__tests__/search-scope.test.ts`
+ * asserts the union, not the individual legs, for exactly that reason.
+ */
+export declare function fusedSearch(db: Db, input: SearchInput, config: FusedSearchConfig, chunkStore: ChunkStore): Promise<{
+    results: SearchResult[];
+    suggestions?: SearchSuggestion[];
+    /** Present only when ranker D fired — Stage 6.3 telemetry, see {@link DeclexTelemetry}. */
+    declex?: DeclexTelemetry;
+}>;
+/**
+ * Walk RRF-ranked candidates and keep up to `limit`, suppressing the
+ * lower-ranked half of every shell↔method pair from the same class:
+ *
+ * - a `class_shell` is dropped when any method of that class is already kept —
+ *   the `{ parent_symbol }` hint lands on the highest-ranked such method;
+ * - a `method` is dropped when its class's shell is already kept — its
+ *   qualified name is appended to the shell's `{ methods_matched }` hint;
+ * - methods never suppress each other, and classes are matched by
+ *   file_path + class name so same-named classes in different files
+ *   never collapse.
+ *
+ * Suppression frees slots, so later candidates backfill until `limit` distinct
+ * results are kept. Purely presentational — RRF scores are not modified.
+ */
+export declare function dedupShellMethodCollisions(candidates: readonly ChunkRecord[], limit: number): Array<{
+    chunk: ChunkRecord;
+    related: RelatedHint | undefined;
+}>;
+//# sourceMappingURL=fused.d.ts.map

package/dist/search/fused.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fused.d.ts","sourceRoot":"","sources":["../../src/search/fused.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,gBAAgB,EAAE,WAAW,EAAa,MAAM,iBAAiB,CAAC;AAC3G,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,gBAAgB,CAAC;AACzC,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAG5E,OAAO,EAAiB,KAAK,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAOpE;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAExD;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;CAC7C;AAaD;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,mHAAmH;IACnH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;CACxC;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC;IACrB,QAAQ,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,mBAAmB,CAAC,CAAC;IACnE,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,cAAc,EAAE,SAAS,kBAAkB,EAAE,CAAC;CACxD;AAMD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAsB,WAAW,CAC/B,EAAE,EAAE,EAAE,EACN,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,iBAAiB,EAIzB,UAAU,EAAE,UAAU,GACrB,OAAO,CAAC;IACT,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,WAAW,CAAC,EAAE,gBAAgB,EAAE,CAAC;IACjC,2FAA2F;IAC3F,MAAM,CAAC,EAAE,eAAe,CAAC;CAC1B,CAAC,CAuKD;AAcD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,0BAA0B,CACxC,UAAU,EAAE,SAAS,WAAW,EAAE,EAClC,KAAK,EAAE,MAAM,GACZ,KAAK,CAAC;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,OAAO,EAAE,WAAW,GAAG,SAAS,CAAA;CAAE,CAAC,CAiDjE"}

package/dist/search/fused.js

@@ -0,0 +1,323 @@
+import { searchFts, searchIdentifierNearMiss, splitIdentifierTerms } from './fts.js';
+import { querySymbolsBySimilarity } from '../graph/queries.js';
+import { searchRankerD } from './declex.js';
+import { resolveScopedPaths } from './scope.js';
+// ---------------------------------------------------------------------------
+// Reciprocal Rank Fusion helpers
+// ---------------------------------------------------------------------------
+/**
+ * RRF score for a document at rank `r` (1-indexed) with fusion constant `k`.
+ *
+ * Standard formula: Score(d) = Σ 1/(k + r(d)) over all rankers.
+ * The default k=60 dampens rank differences — a #1 vs #2 gap matters less
+ * than the absolute score gap would suggest.
+ */
+export function rrfScore(rank, k) {
+    return 1 / (k + rank);
+}
+// ---------------------------------------------------------------------------
+// Fused search
+// ---------------------------------------------------------------------------
+/**
+ * BM25 lexical search fused with ranker D (declaration-exact, `./declex.ts`)
+ * via Reciprocal Rank Fusion.
+ *
+ * Stage 7 (IMPLEMENTATION_PLAN.md "Stage 7: Vector-store deletion") excised
+ * the vector leg entirely — `mast_search` is FTS + ranker D only now, and
+ * Stage 7.2 renamed this function (decision 4): its old name asserted a
+ * vector-plus-lexical fusion that no longer exists. The response no longer
+ * carries a search-mode discriminator or a per-result similarity score —
+ * both described the retired vector leg and have no honest value to report
+ * now that it's gone.
+ *
+ * Post-filters (`chunk_type`, `only_exported`) are applied after RRF ranking,
+ * on the full chunk records fetched from `chunkStore`.
+ *
+ * The scope filters (`file_pattern`, `language`) are NOT post-filters: each
+ * ranker applies them to its own candidate pool, through the shared
+ * `./scope.ts`, before that pool is capped. Applying them here instead would
+ * spend each ranker's candidate budget on rows about to be discarded. Anything
+ * later fused into this function must be scoped the same way — the union below
+ * is what carries a leak into the result set, and `__tests__/search-scope.test.ts`
+ * asserts the union, not the individual legs, for exactly that reason.
+ */
+export async function fusedSearch(db, input, config, 
+// Required (Stage 7.1): retires two recorded defects — the retired-Lance
+// default and the swallowed embedder failure that used to live in this
+// function's now-deleted vector-search try/catch (HANDOFF_Q1.md §5).
+chunkStore) {
+    const limit = input.limit ?? 10;
+    // Over-fetch so post-filters don't starve the final result set.
+    const candidateLimit = limit * 4;
+    // One scope, handed to every ranker — see this function's doc.
+    const scope = { filePattern: input.file_pattern, language: input.language };
+    // --- BM25 ---
+    const ftsRows = await searchFts(db, input.query, {
+        limit: candidateLimit,
+        filePattern: scope.filePattern,
+        language: scope.language,
+    });
+    // Build rank + metadata maps for RRF.
+    const ftsMap = new Map();
+    ftsRows.forEach((r, i) => {
+        ftsMap.set(r.chunk_id, { rank: i + 1, bm25Score: r.bm25_score, snippet: r.match_snippet });
+    });
+    // --- Ranker D (declaration-exact) ---
+    // Gated on `=== true` (not truthiness) so `undefined` and `false` behave
+    // identically — the absent-means-OFF contract `FusedSearchConfig`
+    // documents above. `declex` is kept as the full result (not just its rows)
+    // so a later telemetry stage can lift its diagnostics into the return value
+    // without re-plumbing this call.
+    const dMap = new Map();
+    // Lifted out of the `if` block (rather than left local) so the telemetry
+    // block below can read `top_match_channel`/`candidate_count` without
+    // re-running `searchRankerD` — see this function's return-type doc.
+    let declexDiagnostics;
+    if (config.declaration_exact_ranker === true) {
+        const declex = await searchRankerD(db, input.query, { limit: candidateLimit, scope });
+        declex.rows.forEach((r, i) => {
+            dMap.set(r.chunk_id, i + 1);
+        });
+        declexDiagnostics = declex.diagnostics;
+    }
+    // --- RRF fusion ---
+    const allIds = new Set([...ftsMap.keys(), ...dMap.keys()]);
+    const scored = [];
+    for (const id of allIds) {
+        let rrf = 0;
+        const ftsMeta = ftsMap.get(id);
+        const dRank = dMap.get(id);
+        if (ftsMeta !== undefined)
+            rrf += rrfScore(ftsMeta.rank, config.rrf_k);
+        if (dRank !== undefined)
+            rrf += rrfScore(dRank, config.rrf_k);
+        scored.push({ chunk_id: id, rrf });
+    }
+    scored.sort((a, b) => b.rrf - a.rrf);
+    // --- Fetch chunk data and apply post-filters ---
+    const topIds = scored.slice(0, candidateLimit).map((s) => s.chunk_id);
+    const chunkRecords = await chunkStore.getChunksByIds(topIds);
+    // --- Ranker D dual-fusion diff (Stage 6.3 D-fire telemetry) ---
+    // Pure in-memory arithmetic over the already-fetched ftsMap list — no
+    // second FTS/D query, no second chunk fetch. Reconstructs the RRF sum RRF
+    // would have produced with D excluded entirely (not merely zero-scored — a
+    // D-only id has no rank without D, so it cannot appear in this list at
+    // all), to isolate exactly what D changed. Computed against `chunkRecords`
+    // (PRE-dedup, PRE-post-filter) per this feature's contract — the fused rank
+    // a consumer sees is the presentation-independent one.
+    let declexTelemetry;
+    if (dMap.size > 0 && declexDiagnostics !== undefined) {
+        const idsWithoutD = new Set([...ftsMap.keys()]);
+        const scoredWithoutD = [];
+        for (const id of idsWithoutD) {
+            let rrf = 0;
+            const ftsMeta = ftsMap.get(id);
+            if (ftsMeta !== undefined)
+                rrf += rrfScore(ftsMeta.rank, config.rrf_k);
+            scoredWithoutD.push({ chunk_id: id, rrf });
+        }
+        scoredWithoutD.sort((a, b) => b.rrf - a.rrf);
+        const rankWithD = new Map(scored.map((s, i) => [s.chunk_id, i + 1]));
+        const rankWithoutD = new Map(scoredWithoutD.map((s, i) => [s.chunk_id, i + 1]));
+        const symbolNameOf = new Map(chunkRecords.map((c) => [c.chunk_id, c.symbol_name]));
+        // Union of both lists' top-`limit` ids — the window a consumer actually
+        // sees, from either side of the diff.
+        const unionIds = new Set([
+            ...scored.slice(0, limit).map((s) => s.chunk_id),
+            ...scoredWithoutD.slice(0, limit).map((s) => s.chunk_id),
+        ]);
+        const windowEffects = [];
+        for (const id of unionIds) {
+            const rankWith = rankWithD.get(id) ?? null;
+            const rankWithout = rankWithoutD.get(id) ?? null;
+            if (rankWith === rankWithout)
+                continue; // unaffected by D — not an "effect"
+            windowEffects.push({
+                chunk_id: id,
+                symbol_name: symbolNameOf.get(id) ?? null,
+                rank_with_d: rankWith,
+                rank_without_d: rankWithout,
+            });
+        }
+        // Ascending rank_with_d, nulls last, ascending chunk_id tie-break — determinism.
+        windowEffects.sort((a, b) => {
+            if (a.rank_with_d === null && b.rank_with_d === null) {
+                return a.chunk_id < b.chunk_id ? -1 : a.chunk_id > b.chunk_id ? 1 : 0;
+            }
+            if (a.rank_with_d === null)
+                return 1;
+            if (b.rank_with_d === null)
+                return -1;
+            if (a.rank_with_d !== b.rank_with_d)
+                return a.rank_with_d - b.rank_with_d;
+            return a.chunk_id < b.chunk_id ? -1 : a.chunk_id > b.chunk_id ? 1 : 0;
+        });
+        declexTelemetry = {
+            fired: true,
+            top_match_channel: declexDiagnostics.top_match_channel,
+            candidate_count: declexDiagnostics.candidate_count,
+            window_effects: windowEffects,
+        };
+    }
+    const filtered = chunkRecords.filter((c) => {
+        if (input.chunk_type != null && c.chunk_type !== input.chunk_type)
+            return false;
+        if (input.only_exported === true && !c.is_exported)
+            return false;
+        return true;
+    });
+    // Re-sort filtered chunks by their RRF score (getChunksByIds order is arbitrary).
+    const rrfByChunkId = new Map(scored.map((s) => [s.chunk_id, s.rrf]));
+    filtered.sort((a, b) => (rrfByChunkId.get(b.chunk_id) ?? 0) - (rrfByChunkId.get(a.chunk_id) ?? 0));
+    // Post-RRF presentation pass (§9 mast_search): a method chunk and its class
+    // shell repeat the same signature, so when both land in the window only the
+    // higher-ranked one is returned, with a hint at the suppressed counterpart.
+    // Ranking math is untouched; freed slots backfill from the RRF tail.
+    const deduped = dedupShellMethodCollisions(filtered, limit);
+    const results = deduped.map(({ chunk: c, related }, i) => {
+        const ftsMeta = ftsMap.get(c.chunk_id);
+        return {
+            file_path: c.file_path,
+            start_line: c.start_line,
+            end_line: c.end_line,
+            content: c.content,
+            chunk_type: c.chunk_type,
+            symbol_name: c.symbol_name,
+            parent_symbol: c.parent_symbol,
+            is_exported: c.is_exported,
+            match_score: ftsMeta?.bm25Score ?? null,
+            // Re-ranked after dedup so consumers keep contiguous ranks from 1.
+            rank: i + 1,
+            match_snippet: ftsMeta?.snippet ?? null,
+            ...(related !== undefined ? { related } : {}),
+        };
+    });
+    // Zero-result assist: when nothing survived (no FTS/D hit, or filters
+    // emptied the set), gather advisory "did you mean" candidates instead of
+    // returning a bare dead end (§9 mast_search). Suggestions never become
+    // results — the caller keeps `results: []`.
+    const declexField = declexTelemetry !== undefined ? { declex: declexTelemetry } : {};
+    if (results.length === 0) {
+        const suggestions = await gatherSuggestions(db, chunkStore, input.query, limit, scope);
+        return { results, suggestions, ...declexField };
+    }
+    return { results, ...declexField };
+}
+/**
+ * Walk RRF-ranked candidates and keep up to `limit`, suppressing the
+ * lower-ranked half of every shell↔method pair from the same class:
+ *
+ * - a `class_shell` is dropped when any method of that class is already kept —
+ *   the `{ parent_symbol }` hint lands on the highest-ranked such method;
+ * - a `method` is dropped when its class's shell is already kept — its
+ *   qualified name is appended to the shell's `{ methods_matched }` hint;
+ * - methods never suppress each other, and classes are matched by
+ *   file_path + class name so same-named classes in different files
+ *   never collapse.
+ *
+ * Suppression frees slots, so later candidates backfill until `limit` distinct
+ * results are kept. Purely presentational — RRF scores are not modified.
+ */
+export function dedupShellMethodCollisions(candidates, limit) {
+    const kept = [];
+    const keptShellByClass = new Map();
+    const firstKeptMethodByClass = new Map();
+    // NUL never appears in paths or identifiers, so the key cannot collide.
+    const classKey = (filePath, className) => `${filePath}\u0000${className}`;
+    for (const c of candidates) {
+        if (kept.length >= limit)
+            break;
+        if (c.chunk_type === 'class_shell' && c.symbol_name !== null) {
+            const key = classKey(c.file_path, c.symbol_name);
+            const method = firstKeptMethodByClass.get(key);
+            if (method !== undefined) {
+                method.parentSymbolHint = c.symbol_name;
+                continue;
+            }
+            const entry = { chunk: c };
+            kept.push(entry);
+            // First shell claims the class slot (split shells share the key).
+            if (!keptShellByClass.has(key))
+                keptShellByClass.set(key, entry);
+            continue;
+        }
+        if (c.chunk_type === 'method' && c.parent_symbol !== null) {
+            const key = classKey(c.file_path, c.parent_symbol);
+            const shell = keptShellByClass.get(key);
+            if (shell !== undefined) {
+                if (c.symbol_name !== null) {
+                    (shell.methodsMatched ??= []).push(c.symbol_name);
+                }
+                continue;
+            }
+            const entry = { chunk: c };
+            kept.push(entry);
+            if (!firstKeptMethodByClass.has(key))
+                firstKeptMethodByClass.set(key, entry);
+            continue;
+        }
+        kept.push({ chunk: c });
+    }
+    return kept.map((k) => ({
+        chunk: k.chunk,
+        related: k.methodsMatched !== undefined ? { methods_matched: k.methodsMatched }
+            : k.parentSymbolHint !== undefined ? { parent_symbol: k.parentSymbolHint }
+                : undefined,
+    }));
+}
+// ---------------------------------------------------------------------------
+// Zero-result assist
+// ---------------------------------------------------------------------------
+/**
+ * Build advisory suggestions for a query that returned no results, from three
+ * complementary passes:
+ *   (a) trigram similarity against the `symbols` table ("did you mean"),
+ *   (b) an FTS retry over camelCase/snake_case-split query terms,
+ *   (c) an `identifier_fts` near-miss over the same split terms.
+ * Results are de-duplicated by (symbol, file) and capped at `limit`.
+ *
+ * All three passes honour the caller's `scope`. A suggestion naming a file the
+ * caller excluded is the same misleading answer a *result* naming it would be —
+ * advisory or not, it points at code outside the boundary the caller asked
+ * about. Only pass (b) can take the filters natively; (a) and (c) return just a
+ * symbol and a path, so the scope is enforced in `add`, the one funnel all
+ * three go through.
+ */
+async function gatherSuggestions(db, chunkStore, query, limit, scope) {
+    const scopedList = await resolveScopedPaths(db, scope);
+    const scopedPaths = scopedList === null ? null : new Set(scopedList);
+    const out = [];
+    const seen = new Set();
+    const add = (symbol, filePath, reason) => {
+        if (symbol === null || out.length >= limit)
+            return;
+        if (scopedPaths !== null && !scopedPaths.has(filePath))
+            return;
+        const key = `${symbol}\u0000${filePath}`;
+        if (seen.has(key))
+            return;
+        seen.add(key);
+        out.push({ symbol, file_path: filePath, reason });
+    };
+    // (a) Trigram-similar symbol names — the highest-signal "did you mean".
+    const similar = await querySymbolsBySimilarity(db, query, limit);
+    for (const s of similar)
+        add(s.name, s.file_path, 'similar symbol name');
+    const terms = splitIdentifierTerms(query);
+    if (terms.length > 0) {
+        // (b) FTS retry over the split terms.
+        const ftsRows = await searchFts(db, terms.join(' '), {
+            limit, filePattern: scope.filePattern, language: scope.language,
+        });
+        const ftsChunks = await chunkStore.getChunksByIds(ftsRows.map((r) => r.chunk_id));
+        for (const c of ftsChunks)
+            add(c.symbol_name, c.file_path, 'matched split query terms');
+        // (c) Identifier near-miss over the split terms.
+        const nearRows = await searchIdentifierNearMiss(db, terms, limit);
+        const nearChunks = await chunkStore.getChunksByIds(nearRows.map((r) => r.chunk_id));
+        for (const c of nearChunks)
+            add(c.symbol_name, c.file_path, 'identifier near-miss');
+    }
+    return out;
+}
+//# sourceMappingURL=fused.js.map

package/dist/search/fused.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fused.js","sourceRoot":"","sources":["../../src/search/fused.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,wBAAwB,EAAE,oBAAoB,EAAE,MAAM,UAAU,CAAC;AACrF,OAAO,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAC;AAC/D,OAAO,EAAE,aAAa,EAA0B,MAAM,aAAa,CAAC;AACpE,OAAO,EAAE,kBAAkB,EAAoB,MAAM,YAAY,CAAC;AAElE,8EAA8E;AAC9E,iCAAiC;AACjC,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,CAAS;IAC9C,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AACxB,CAAC;AAiED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,EAAM,EACN,KAAkB,EAClB,MAAyB;AACzB,yEAAyE;AACzE,uEAAuE;AACvE,qEAAqE;AACrE,UAAsB;IAOtB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;IAChC,gEAAgE;IAChE,MAAM,cAAc,GAAG,KAAK,GAAG,CAAC,CAAC;IAEjC,+DAA+D;IAC/D,MAAM,KAAK,GAAgB,EAAE,WAAW,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC;IAEzF,eAAe;IACf,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,EAAE;QAC/C,KAAK,EAAE,cAAc;QACrB,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,QAAQ,EAAE,KAAK,CAAC,QAAQ;KACzB,CAAC,CAAC;IAEH,sCAAsC;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgE,CAAC;IACvF,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;IAC7F,CAAC,CAAC,CAAC;IAEH,uCAAuC;IACvC,yEAAyE;IACzE,kEAAkE;IAClE,2EAA2E;IAC3E,4EAA4E;IAC5E,iCAAiC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,yEAAyE;IACzE,qEAAqE;IACrE,oEAAoE;IACpE,IAAI,iBAAgD,CAAC;IACrD,IAAI,MAAM,CAAC,wBAAwB,KAAK,IAAI,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,CAAC;QACtF,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QACH,iBAAiB,GAAG,MAAM,CAAC,WAAW,CAAC;IACzC,CAAC;IAED,qBAAqB;IACrB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE3D,MAAM,MAAM,GAA6C,EAAE,CAAC;IAC5D,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,OAAO,KAAK,SAAS;YAAE,GAAG,IAAI,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QACvE,IAAI,KAAK,KAAK,SAAS;YAAE,GAAG,IAAI,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9D,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;IACrC,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAErC,kDAAkD;IAClD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACtE,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IAE7D,iEAAiE;IACjE,sEAAsE;IACtE,0EAA0E;IAC1E,2EAA2E;IAC3E,uEAAuE;IACvE,2EAA2E;IAC3E,4EAA4E;IAC5E,uDAAuD;IACvD,IAAI,eAA4C,CAAC;IACjD,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;QACrD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,cAAc,GAA6C,EAAE,CAAC;QACpE,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/B,IAAI,OAAO,KAAK,SAAS;gBAAE,GAAG,IAAI,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;YACvE,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7C,CAAC;QACD,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAE7C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAEnF,wEAAwE;QACxE,sCAAsC;QACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC;YACvB,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;YAChD,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;SACzD,CAAC,CAAC;QAEH,MAAM,aAAa,GAAyB,EAAE,CAAC;QAC/C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;YAC3C,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;YACjD,IAAI,QAAQ,KAAK,WAAW;gBAAE,SAAS,CAAC,oCAAoC;YAC5E,aAAa,CAAC,IAAI,CAAC;gBACjB,QAAQ,EAAE,EAAE;gBACZ,WAAW,EAAE,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI;gBACzC,WAAW,EAAE,QAAQ;gBACrB,cAAc,EAAE,WAAW;aAC5B,CAAC,CAAC;QACL,CAAC;QACD,iFAAiF;QACjF,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;gBACrD,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxE,CAAC;YACD,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC;YACrC,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW;gBAAE,OAAO,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;YAC1E,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC,CAAC,CAAC;QAEH,eAAe,GAAG;YAChB,KAAK,EAAE,IAAI;YACX,iBAAiB,EAAE,iBAAiB,CAAC,iBAAiB;YACtD,eAAe,EAAE,iBAAiB,CAAC,eAAe;YAClD,cAAc,EAAE,aAAa;SAC9B,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACzC,IAAI,KAAK,CAAC,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU;YAAE,OAAO,KAAK,CAAC;QAChF,IAAI,KAAK,CAAC,aAAa,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW;YAAE,OAAO,KAAK,CAAC;QACjE,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,kFAAkF;IAClF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEnG,4EAA4E;IAC5E,4EAA4E;IAC5E,4EAA4E;IAC5E,qEAAqE;IACrE,MAAM,OAAO,GAAG,0BAA0B,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAE5D,MAAM,OAAO,GAAmB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE;QACvE,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACvC,OAAO;YACL,SAAS,EAAO,CAAC,CAAC,SAAS;YAC3B,UAAU,EAAM,CAAC,CAAC,UAAU;YAC5B,QAAQ,EAAQ,CAAC,CAAC,QAAQ;YAC1B,OAAO,EAAS,CAAC,CAAC,OAAO;YACzB,UAAU,EAAM,CAAC,CAAC,UAAuB;YACzC,WAAW,EAAK,CAAC,CAAC,WAAW;YAC7B,aAAa,EAAG,CAAC,CAAC,aAAa;YAC/B,WAAW,EAAK,CAAC,CAAC,WAAW;YAC7B,WAAW,EAAK,OAAO,EAAE,SAAS,IAAI,IAAI;YAC1C,mEAAmE;YACnE,IAAI,EAAY,CAAC,GAAG,CAAC;YACrB,aAAa,EAAG,OAAO,EAAE,OAAO,IAAI,IAAI;YACxC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC9C,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,sEAAsE;IACtE,yEAAyE;IACzE,uEAAuE;IACvE,4CAA4C;IAC5C,MAAM,WAAW,GAAG,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAErF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,MAAM,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACvF,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,WAAW,EAAE,CAAC;IAClD,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,GAAG,WAAW,EAAE,CAAC;AACrC,CAAC;AAcD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,0BAA0B,CACxC,UAAkC,EAClC,KAAa;IAEb,MAAM,IAAI,GAAgB,EAAE,CAAC;IAC7B,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAqB,CAAC;IACtD,MAAM,sBAAsB,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5D,wEAAwE;IACxE,MAAM,QAAQ,GAAG,CAAC,QAAgB,EAAE,SAAiB,EAAU,EAAE,CAAC,GAAG,QAAQ,SAAS,SAAS,EAAE,CAAC;IAElG,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;YAAE,MAAM;QAEhC,IAAI,CAAC,CAAC,UAAU,KAAK,aAAa,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;YAC7D,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;YACjD,MAAM,MAAM,GAAG,sBAAsB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,gBAAgB,GAAG,CAAC,CAAC,WAAW,CAAC;gBACxC,SAAS;YACX,CAAC;YACD,MAAM,KAAK,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjB,kEAAkE;YAClE,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjE,SAAS;QACX,CAAC;QAED,IAAI,CAAC,CAAC,UAAU,KAAK,QAAQ,IAAI,CAAC,CAAC,aAAa,KAAK,IAAI,EAAE,CAAC;YAC1D,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC;YACnD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;oBAC3B,CAAC,KAAK,CAAC,cAAc,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;gBACpD,CAAC;gBACD,SAAS;YACX,CAAC;YACD,MAAM,KAAK,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjB,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,sBAAsB,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC7E,SAAS;QACX,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtB,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,OAAO,EACL,CAAC,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC,cAAc,EAAE;YACtE,CAAC,CAAC,CAAC,CAAC,gBAAgB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,gBAAgB,EAAE;gBAC1E,CAAC,CAAC,SAAS;KACd,CAAC,CAAC,CAAC;AACN,CAAC;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;;;;;;;;;;;;GAcG;AACH,KAAK,UAAU,iBAAiB,CAC9B,EAAM,EACN,UAAsB,EACtB,KAAa,EACb,KAAa,EACb,KAAkB;IAElB,MAAM,UAAU,GAAG,MAAM,kBAAkB,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACvD,MAAM,WAAW,GAAG,UAAU,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;IACrE,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAG,CAAC,MAAqB,EAAE,QAAgB,EAAE,MAAc,EAAQ,EAAE;QAC5E,IAAI,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,IAAI,KAAK;YAAE,OAAO;QACnD,IAAI,WAAW,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO;QAC/D,MAAM,GAAG,GAAG,GAAG,MAAM,SAAS,QAAQ,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;IACpD,CAAC,CAAC;IAEF,wEAAwE;IACxE,MAAM,OAAO,GAAG,MAAM,wBAAwB,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACjE,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,EAAE,qBAAqB,CAAC,CAAC;IAEzE,MAAM,KAAK,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC1C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,sCAAsC;QACtC,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;YACnD,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ;SAChE,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,MAAM,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAClF,KAAK,MAAM,CAAC,IAAI,SAAS;YAAE,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,SAAS,EAAE,2BAA2B,CAAC,CAAC;QAExF,iDAAiD;QACjD,MAAM,QAAQ,GAAG,MAAM,wBAAwB,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAClE,MAAM,UAAU,GAAG,MAAM,UAAU,CAAC,cAAc,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACpF,KAAK,MAAM,CAAC,IAAI,UAAU;YAAE,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,SAAS,EAAE,sBAAsB,CAAC,CAAC;IACtF,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/search/potential-matches.d.ts

@@ -0,0 +1,88 @@
+import type { Db } from '../graph/db.js';
+import type { VerifiedCaller, PotentialMatch } from '../ast/types.js';
+/** The chunk fields candidate collection actually reads. */
+export interface CandidateChunkRecord {
+    readonly chunk_id: string;
+    readonly file_path: string;
+    readonly start_line: number;
+    readonly end_line: number;
+    readonly symbol_name: string | null;
+}
+/**
+ * Role interface (§4.3) over "fetch chunks by id" — the only capability this
+ * module needs from a chunk store. `SqliteChunkStore` satisfies it
+ * structurally, so `mast_callers`/`mast_rename_impact` pass their
+ * `ctx.chunkStore` directly. The `mast index --checker` pass passes an
+ * in-memory prefetched source instead: its Phase A runs candidate collection
+ * for EVERY indexed symbol, and one round-trip per symbol was measured at
+ * 50+ CPU-minutes on the kluster monorepo (10,733 symbols, against the
+ * pre-M1 LanceDB chunk store) without completing — one full scan up front
+ * plus Map lookups keeps identical semantics at a fraction of the cost.
+ */
+export interface ChunkByIdSource {
+    getChunksByIds(ids: readonly string[]): Promise<readonly CandidateChunkRecord[]>;
+}
+/**
+ * Chunk-level detail behind a potential match. `collectPotentialMatches` (the
+ * public shape `mast_callers`/`mast_rename_impact` consume) and the checker
+ * pass (which additionally needs `end_line` and the call site's enclosing
+ * symbol to classify, and on a definite match, write a caller edge) both
+ * derive from this one query — never forked.
+ */
+export interface PotentialMatchCandidate {
+    readonly file_path: string;
+    readonly start_line: number;
+    readonly end_line: number;
+    /** The call site's own enclosing symbol (e.g. the function it appears
+     *  inside) — NOT the queried symbol. Null for a `block` chunk (top-level
+     *  code with no enclosing declaration). */
+    readonly chunk_symbol_name: string | null;
+}
+export interface PotentialMatchCandidatesResult {
+    readonly candidates: readonly PotentialMatchCandidate[];
+    /**
+     * F10 (Stage 3, IMPLEMENTATION_PLAN.md): the real, uncapped `identifier_fts`
+     * match count for `symbolName` — present ONLY when the capped fetch
+     * (`limit`) came back full AND the true count exceeds it (an exactly-full
+     * fetch with no more real matches is not truncation). `mast_callers` /
+     * `mast_rename_impact` surface this as `summary.potential_truncated`
+     * (MAST_SPEC.md §9.0's Confidence signals table). Omitted whenever the
+     * fetch returned fewer rows than `limit` — the fetch count already IS the
+     * real count on that path, so the extra `COUNT(*)` query
+     * ({@link countIdentifierMatches}) is never run and would be pure waste.
+     */
+    readonly truncatedMatchCount?: number;
+}
+/**
+ * Identifier-FTS hits for `symbolName` that are NOT already covered by a
+ * verified caller — the raw candidate pool behind `potential_matches` (§9
+ * mast_callers), before checker-verdict filtering.
+ */
+export declare function collectPotentialMatchCandidates(db: Db, chunkSource: ChunkByIdSource, symbolName: string, verified: readonly VerifiedCaller[], limit?: number): Promise<PotentialMatchCandidatesResult>;
+export interface PotentialMatchesResult {
+    readonly matches: readonly PotentialMatch[];
+    /** Candidates the checker pass classified as not a call site (§10.3.2), dropped from `matches`. */
+    readonly checkerClassifiedNonCallSite: number;
+    /** Candidates the checker pass resolved to a DIFFERENT declaration, dropped from `matches`. */
+    readonly checkerClassifiedDifferentDeclaration: number;
+    /** @see {@link PotentialMatchCandidatesResult.truncatedMatchCount} — same signal, passed through unchanged. */
+    readonly truncatedMatchCount?: number;
+}
+/**
+ * Identifier-FTS hits for `symbolName` that are NOT already covered by a
+ * verified caller — the "review required" set. Shared by `mast_callers` and
+ * `mast_rename_impact` so the two tools can never disagree about what counts
+ * as a potential match.
+ *
+ * When `mast index --checker` (Stage 1.2) has classified a candidate as
+ * `non_call_site` or `resolves_to_different`, it is dropped here rather than
+ * re-surfaced as a review site forever — a `resolves_to_queried` candidate is
+ * also dropped defensively (it should already be excluded via `verified`
+ * through the checker edge's own `call_line`, but the checker's more-precise
+ * call line can differ from the chunk's `start_line` for a multi-line chunk;
+ * this filter closes that gap using the SAME (file_path, start_line) key the
+ * verdict was recorded against). `unresolved` candidates are never persisted
+ * as verdicts (see `checker_verdicts` in `graph/db.ts`) and always remain.
+ */
+export declare function collectPotentialMatches(db: Db, chunkSource: ChunkByIdSource, symbolId: number, symbolName: string, verified: readonly VerifiedCaller[], limit?: number): Promise<PotentialMatchesResult>;
+//# sourceMappingURL=potential-matches.d.ts.map

package/dist/search/potential-matches.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"potential-matches.d.ts","sourceRoot":"","sources":["../../src/search/potential-matches.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,gBAAgB,CAAC;AACzC,OAAO,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AActE,4DAA4D;AAC5D,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CACrC;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,eAAe;IAC9B,cAAc,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,oBAAoB,EAAE,CAAC,CAAC;CAClF;AAED;;;;;;GAMG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;+CAE2C;IAC3C,QAAQ,CAAC,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3C;AAED,MAAM,WAAW,8BAA8B;IAC7C,QAAQ,CAAC,UAAU,EAAE,SAAS,uBAAuB,EAAE,CAAC;IACxD;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,mBAAmB,CAAC,EAAE,MAAM,CAAC;CACvC;AAED;;;;GAIG;AACH,wBAAsB,+BAA+B,CACnD,EAAE,EAAE,EAAE,EACN,WAAW,EAAE,eAAe,EAC5B,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,SAAS,cAAc,EAAE,EACnC,KAAK,SAAK,GACT,OAAO,CAAC,8BAA8B,CAAC,CA2BzC;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,CAAC;IAC5C,mGAAmG;IACnG,QAAQ,CAAC,4BAA4B,EAAE,MAAM,CAAC;IAC9C,+FAA+F;IAC/F,QAAQ,CAAC,qCAAqC,EAAE,MAAM,CAAC;IACvD,+GAA+G;IAC/G,QAAQ,CAAC,mBAAmB,CAAC,EAAE,MAAM,CAAC;CACvC;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAsB,uBAAuB,CAC3C,EAAE,EAAE,EAAE,EACN,WAAW,EAAE,eAAe,EAC5B,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,SAAS,cAAc,EAAE,EACnC,KAAK,SAAK,GACT,OAAO,CAAC,sBAAsB,CAAC,CAwBjC"}

package/dist/search/potential-matches.js

@@ -0,0 +1,83 @@
+import { searchIdentifiers, countIdentifierMatches } from './fts.js';
+import { queryCheckerVerdicts } from '../graph/queries.js';
+/**
+ * Identifier-FTS hits for `symbolName` that are NOT already covered by a
+ * verified caller — the raw candidate pool behind `potential_matches` (§9
+ * mast_callers), before checker-verdict filtering.
+ */
+export async function collectPotentialMatchCandidates(db, chunkSource, symbolName, verified, limit = 50) {
+    const identRows = await searchIdentifiers(db, symbolName, limit);
+    const chunks = await chunkSource.getChunksByIds(identRows.map((r) => r.chunk_id));
+    // Exclude chunk IDs already covered by the verified set.
+    const verifiedKeys = new Set(verified.map((c) => `${c.file_path}:${c.line}`));
+    const candidates = [];
+    for (const chunk of chunks) {
+        if (verifiedKeys.has(`${chunk.file_path}:${chunk.start_line}`))
+            continue;
+        candidates.push({
+            file_path: chunk.file_path,
+            start_line: chunk.start_line,
+            end_line: chunk.end_line,
+            chunk_symbol_name: chunk.symbol_name,
+        });
+    }
+    // The capped fetch hides how many real matches exist. Only worth paying
+    // for an uncapped COUNT(*) when the fetch actually came back full — under
+    // the cap, identRows.length already IS the real count (see F10 note above).
+    let truncatedMatchCount;
+    if (identRows.length === limit) {
+        const rawCount = await countIdentifierMatches(db, symbolName);
+        if (rawCount > limit)
+            truncatedMatchCount = rawCount;
+    }
+    return truncatedMatchCount !== undefined ? { candidates, truncatedMatchCount } : { candidates };
+}
+/**
+ * Identifier-FTS hits for `symbolName` that are NOT already covered by a
+ * verified caller — the "review required" set. Shared by `mast_callers` and
+ * `mast_rename_impact` so the two tools can never disagree about what counts
+ * as a potential match.
+ *
+ * When `mast index --checker` (Stage 1.2) has classified a candidate as
+ * `non_call_site` or `resolves_to_different`, it is dropped here rather than
+ * re-surfaced as a review site forever — a `resolves_to_queried` candidate is
+ * also dropped defensively (it should already be excluded via `verified`
+ * through the checker edge's own `call_line`, but the checker's more-precise
+ * call line can differ from the chunk's `start_line` for a multi-line chunk;
+ * this filter closes that gap using the SAME (file_path, start_line) key the
+ * verdict was recorded against). `unresolved` candidates are never persisted
+ * as verdicts (see `checker_verdicts` in `graph/db.ts`) and always remain.
+ */
+export async function collectPotentialMatches(db, chunkSource, symbolId, symbolName, verified, limit = 50) {
+    const { candidates, truncatedMatchCount } = await collectPotentialMatchCandidates(db, chunkSource, symbolName, verified, limit);
+    const verdicts = await queryCheckerVerdicts(db, symbolId);
+    const verdictByKey = new Map();
+    for (const v of verdicts)
+        verdictByKey.set(`${v.file_path}:${v.call_site_line}`, v.verdict);
+    const matches = [];
+    let checkerClassifiedNonCallSite = 0;
+    let checkerClassifiedDifferentDeclaration = 0;
+    for (const c of candidates) {
+        const verdict = verdictByKey.get(`${c.file_path}:${c.start_line}`);
+        if (verdict === 'non_call_site') {
+            checkerClassifiedNonCallSite++;
+            continue;
+        }
+        if (verdict === 'resolves_to_different') {
+            checkerClassifiedDifferentDeclaration++;
+            continue;
+        }
+        if (verdict === 'resolves_to_queried')
+            continue;
+        matches.push({
+            file_path: c.file_path,
+            line: c.start_line,
+            context: c.chunk_symbol_name ?? '',
+            reason: 'identifier_match_no_resolved_edge',
+        });
+    }
+    return truncatedMatchCount !== undefined
+        ? { matches, checkerClassifiedNonCallSite, checkerClassifiedDifferentDeclaration, truncatedMatchCount }
+        : { matches, checkerClassifiedNonCallSite, checkerClassifiedDifferentDeclaration };
+}
+//# sourceMappingURL=potential-matches.js.map

package/dist/search/potential-matches.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"potential-matches.js","sourceRoot":"","sources":["../../src/search/potential-matches.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,MAAM,UAAU,CAAC;AACrE,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAqE3D;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,+BAA+B,CACnD,EAAM,EACN,WAA4B,EAC5B,UAAkB,EAClB,QAAmC,EACnC,KAAK,GAAG,EAAE;IAEV,MAAM,SAAS,GAAG,MAAM,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;IACjE,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAElF,yDAAyD;IACzD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC9E,MAAM,UAAU,GAA8B,EAAE,CAAC;IACjD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YAAE,SAAS;QACzE,UAAU,CAAC,IAAI,CAAC;YACd,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,iBAAiB,EAAE,KAAK,CAAC,WAAW;SACrC,CAAC,CAAC;IACL,CAAC;IAED,wEAAwE;IACxE,0EAA0E;IAC1E,4EAA4E;IAC5E,IAAI,mBAAuC,CAAC;IAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,MAAM,sBAAsB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC9D,IAAI,QAAQ,GAAG,KAAK;YAAE,mBAAmB,GAAG,QAAQ,CAAC;IACvD,CAAC;IAED,OAAO,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,mBAAmB,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC;AAClG,CAAC;AAYD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,EAAM,EACN,WAA4B,EAC5B,QAAgB,EAChB,UAAkB,EAClB,QAAmC,EACnC,KAAK,GAAG,EAAE;IAEV,MAAM,EAAE,UAAU,EAAE,mBAAmB,EAAE,GAAG,MAAM,+BAA+B,CAAC,EAAE,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChI,MAAM,QAAQ,GAAG,MAAM,oBAAoB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAC1D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;IAE5F,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,4BAA4B,GAAG,CAAC,CAAC;IACrC,IAAI,qCAAqC,GAAG,CAAC,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;QACnE,IAAI,OAAO,KAAK,eAAe,EAAE,CAAC;YAAC,4BAA4B,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QAC9E,IAAI,OAAO,KAAK,uBAAuB,EAAE,CAAC;YAAC,qCAAqC,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QAC/F,IAAI,OAAO,KAAK,qBAAqB;YAAE,SAAS;QAChD,OAAO,CAAC,IAAI,CAAC;YACX,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,IAAI,EAAE,CAAC,CAAC,UAAU;YAClB,OAAO,EAAE,CAAC,CAAC,iBAAiB,IAAI,EAAE;YAClC,MAAM,EAAE,mCAAmC;SAC5C,CAAC,CAAC;IACL,CAAC;IACD,OAAO,mBAAmB,KAAK,SAAS;QACtC,CAAC,CAAC,EAAE,OAAO,EAAE,4BAA4B,EAAE,qCAAqC,EAAE,mBAAmB,EAAE;QACvG,CAAC,CAAC,EAAE,OAAO,EAAE,4BAA4B,EAAE,qCAAqC,EAAE,CAAC;AACvF,CAAC"}