@amsterdamdatalabs/enact-docs-search 0.1.2 → 0.2.1

package/dist/search/relevance.js

@@ -0,0 +1,119 @@
+/**
+ * Relevance gating.
+ *
+ * Reciprocal rank fusion scores a result by its *position*, not by how well it
+ * matched, so the top hit for a nonsense query scores about as high as the top
+ * hit for a perfect one. Measured on this repo: gibberish topped out at 0.0664
+ * against 0.0815 for a well-matched query. Nothing downstream of fusion can
+ * tell those apart, so the gate has to run on the raw per-modality evidence
+ * before fusion throws it away.
+ */
+import { extractQueryTerms, containsTerm } from "./snippet.js";
+/**
+ * Cosine floor for semantic hits.
+ *
+ * Re-measured against docs/ in enact-m5 (203 chunks), taking the top cosine
+ * over the whole corpus per query:
+ *
+ *   junk       zzqzz qqxxw 0.131 | florbnax vimtuzzle 0.134
+ *              purple giraffe tapdance 0.103 | qwertyuiop asdfghjkl 0.132
+ *   genuine    invariants 0.260 | brownfield reference implementation 0.322
+ *              database migrations 0.374 | websocket routes 0.520
+ *              sandbox lifecycle 0.531 | coverage hooks 0.693
+ *
+ * So the real gap is [0.134, 0.260], and 0.20 sits in the middle of it with
+ * roughly equal headroom on each side. An earlier value of 0.35 was set from
+ * figures this measurement could not reproduce, and it silently discarded the
+ * best hit for real queries -- "invariants" returned nothing at all.
+ *
+ * Reproduce with:
+ *   node dist/cli.js "<query>" --repo <repo> --mode semantic --min-score 0 --json
+ */
+export const DEFAULT_MIN_VECTOR_SCORE = 0.2;
+/**
+ * Fraction of the query's *weight* a document must cover (see
+ * `idfWeightedCoverage`), not a fraction of its terms.
+ *
+ * Measured separation on this corpus:
+ *   0.09  "presence is not armedness" -- absent term dominates the weight
+ *   0.47  "mobile device" matching only the commoner term
+ *   0.53  "mobile device" matching only the rarer term
+ *   0.73  a five-term query missing one term
+ *   1.00  full match
+ *
+ * 0.5 sits below every genuine partial match and far above the junk floor.
+ */
+export const DEFAULT_MIN_TERM_COVERAGE = 0.5;
+/**
+ * Fraction of the query's content terms that appear in `text`.
+ *
+ * Returns 1 for a query with no content terms (all stopwords or too short):
+ * there is nothing to be missing, so the gate must not reject on that basis.
+ */
+export function termCoverage(query, text) {
+    const terms = extractQueryTerms(query);
+    if (terms.length === 0)
+        return 1;
+    const matched = terms.filter((term) => containsTerm(text, term)).length;
+    return matched / terms.length;
+}
+/** Smoothed inverse document frequency. A term absent from the corpus scores
+ * highest: a query term nothing contains is the most load-bearing one there
+ * is, and a result that misses it has missed the point of the query. */
+function idf(term, stats) {
+    const df = stats.documentFrequency.get(term) ?? 0;
+    return Math.log((stats.totalDocs + 1) / (df + 1)) + 1;
+}
+/**
+ * Normalise a raw query string.
+ *
+ * Agents type `mobile | devices` out of grep habit. The pipe is treated as a
+ * separator, exactly like a space -- `mobile | devices` and `mobile devices`
+ * are the same query. It is deliberately not an OR operator: one query syntax
+ * is easier to use correctly than two, and an unquoted pipe never reaches this
+ * process anyway -- the shell consumes it as a pipeline first.
+ */
+export function normalizeQuery(query) {
+    return query.replace(/\|/g, " ").replace(/\s+/g, " ").trim();
+}
+/**
+ * Coverage weighted by term rarity.
+ *
+ * Flat coverage treats every term as equally important, which makes a two-term
+ * query behave like AND -- "mobile device" then drops a document about a
+ * "mobile target" for lacking the word "device". Weighting by IDF lets the
+ * term that actually carries the query decide, in both directions: matching
+ * only the rare term passes, matching only the common one does not.
+ *
+ * Falls back to flat coverage when no stats are supplied.
+ */
+export function idfWeightedCoverage(query, text, stats) {
+    if (!stats)
+        return termCoverage(query, text);
+    const terms = extractQueryTerms(query);
+    if (terms.length === 0)
+        return 1;
+    let matchedWeight = 0;
+    let totalWeight = 0;
+    for (const term of terms) {
+        const weight = idf(term, stats);
+        totalWeight += weight;
+        if (containsTerm(text, term))
+            matchedWeight += weight;
+    }
+    return totalWeight === 0 ? 1 : matchedWeight / totalWeight;
+}
+/**
+ * Keyword-side gate. Uses term coverage rather than a BM25 threshold: BM25
+ * scores here are unnormalised and scale with query length and corpus size,
+ * so any absolute cutoff would be a fact about one repo. Coverage is a ratio
+ * and travels.
+ */
+export function passesKeywordGate(query, text, minCoverage = DEFAULT_MIN_TERM_COVERAGE, stats) {
+    return idfWeightedCoverage(query, text, stats) >= (minCoverage ?? DEFAULT_MIN_TERM_COVERAGE);
+}
+/** Semantic-side gate. Cosine is bounded, so an absolute floor is portable. */
+export function passesVectorGate(score, minScore = DEFAULT_MIN_VECTOR_SCORE) {
+    return score >= minScore;
+}
+//# sourceMappingURL=relevance.js.map

package/dist/search/relevance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relevance.js","sourceRoot":"","sources":["../../src/search/relevance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE/D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAE5C;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,GAAG,CAAC;AAE7C;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,IAAY;IACtD,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEjC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACxE,OAAO,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC;AAChC,CAAC;AASD;;wEAEwE;AACxE,SAAS,GAAG,CAAC,IAAY,EAAE,KAAkB;IAC3C,MAAM,EAAE,GAAG,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAC/D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAa,EACb,IAAY,EACZ,KAAmB;IAEnB,IAAI,CAAC,KAAK;QAAE,OAAO,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAE7C,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEjC,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChC,WAAW,IAAI,MAAM,CAAC;QACtB,IAAI,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC;YAAE,aAAa,IAAI,MAAM,CAAC;IACxD,CAAC;IAED,OAAO,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,WAAW,CAAC;AAC7D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAa,EACb,IAAY,EACZ,cAAsB,yBAAyB,EAC/C,KAAmB;IAEnB,OAAO,mBAAmB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW,IAAI,yBAAyB,CAAC,CAAC;AAC/F,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,gBAAgB,CAC9B,KAAa,EACb,WAAmB,wBAAwB;IAE3C,OAAO,KAAK,IAAI,QAAQ,CAAC;AAC3B,CAAC"}

package/dist/search/search-service.d.ts

@@ -13,7 +13,7 @@
 import { DocumentStore } from "../storage/document-store.js";
 import { VectorStore } from "../storage/vector-store.js";
 import { EmbeddingService } from "../embeddings/embedding-service.js";
-import type { Scope, SearchMode } from "../types.js";
+import type { SearchMode } from "../types.js";
 import type { HighlightMode } from "./snippet.js";
 export interface HybridResult {
     id: string;
@@ -27,10 +27,19 @@ export interface HybridResult {
     content?: string;
     headingBreadcrumb?: string[];
     source: "text" | "vector" | "hybrid";
+    title?: string;
+    description?: string;
+    headings?: string;
+    status?: string;
+    documentType?: string;
+    lastUpdate?: string;
+    /** Fused score before authority weighting, kept so --explain can show both. */
+    baseScore?: number;
+    /** Authority multiplier applied to `baseScore` to produce the final order. */
+    authority?: number;
 }
 export interface SearchOptions {
     mode: SearchMode;
-    scope: Scope;
     limit?: number;
     /** How matched terms should be marked in generated snippets. Defaults to
      * "plain" (no markup) when omitted. */
@@ -39,15 +48,48 @@ export interface SearchOptions {
      * snippet generation. When omitted, snippets fall back to chunk-only
      * generation. */
     repoRoot?: string;
+    /** Cosine floor for semantic hits. */
+    minVectorScore?: number;
+    /** Required fraction of query terms present, for keyword hits. */
+    minCoverage?: number;
+    /** Skip status/recency weighting, so raw retrieval order can be compared. */
+    rawRank?: boolean;
+    /** Clock for recency decay; injected so tests are not time-dependent. */
+    now?: number;
 }
 export declare class SearchService {
     private docStore;
     private vectorStore;
     private embeddingService;
     constructor(docStore: DocumentStore, vectorStore: VectorStore, embeddingService: EmbeddingService | null);
+    /**
+     * Fetch vector chunks and collapse to the best-scoring chunk per FILE,
+     * growing the request until `fileLimit` distinct files are found (or the
+     * store has no more chunks to give).
+     *
+     * `DocumentStore.search` collapses to one result per file before slicing
+     * to a limit (see its comment); a raw HNSW search can't do the equivalent
+     * because it has to be told a chunk budget upfront, and one large document
+     * can own most of that budget -- on the real corpus,
+     * docs/architecture/engine/lessons-learned.md supplied 26 of the top 30
+     * vector hits for one query, leaving only 4 chunk-slots (not file-slots)
+     * for every other document combined. Raising the chunk budget cannot fix
+     * this in general, since a bigger document just needs a bigger multiple.
+     * Instead ask for more chunks, geometrically, until enough distinct files
+     * have shown up -- the same "collapse before slice" shape the keyword side
+     * already gets from MiniSearch returning its full match list.
+     */
+    private fetchVectorResultsByFile;
     search(query: string, options: SearchOptions): Promise<HybridResult[]>;
     private textSearch;
     private semanticSearch;
     private hybridSearch;
+    /**
+     * Apply authority weighting and produce the final page.
+     *
+     * Every mode ends here, so `--mode keyword` cannot become a quiet bypass of
+     * the same weighting hybrid results get.
+     */
+    private finish;
 }
 //# sourceMappingURL=search-service.d.ts.map

package/dist/search/search-service.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search-service.d.ts","sourceRoot":"","sources":["../../src/search/search-service.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAC7D,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAErD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAElD,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC7B,MAAM,EAAE,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;CACtC;AAED,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,UAAU,CAAC;IACjB,KAAK,EAAE,KAAK,CAAC;IACb,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;2CACuC;IACvC,SAAS,CAAC,EAAE,aAAa,CAAC;IAC1B;;qBAEiB;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAID,qBAAa,aAAa;IAEtB,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,WAAW;IACnB,OAAO,CAAC,gBAAgB;gBAFhB,QAAQ,EAAE,aAAa,EACvB,WAAW,EAAE,WAAW,EACxB,gBAAgB,EAAE,gBAAgB,GAAG,IAAI;IAG7C,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;YAkB9D,UAAU;YAqBV,cAAc;YAwCd,YAAY;CAqF3B"}
+{"version":3,"file":"search-service.d.ts","sourceRoot":"","sources":["../../src/search/search-service.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,EAAE,aAAa,EAAkB,MAAM,8BAA8B,CAAC;AAC7E,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAEzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAE9C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAUlD,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC7B,MAAM,EAAE,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACrC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,+EAA+E;IAC/E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,8EAA8E;IAC9E,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,UAAU,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;2CACuC;IACvC,SAAS,CAAC,EAAE,aAAa,CAAC;IAC1B;;qBAEiB;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,sCAAsC;IACtC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,kEAAkE;IAClE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,6EAA6E;IAC7E,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,yEAAyE;IACzE,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAaD,qBAAa,aAAa;IAEtB,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,WAAW;IACnB,OAAO,CAAC,gBAAgB;gBAFhB,QAAQ,EAAE,aAAa,EACvB,WAAW,EAAE,WAAW,EACxB,gBAAgB,EAAE,gBAAgB,GAAG,IAAI;IAGnD;;;;;;;;;;;;;;;;OAgBG;YACW,wBAAwB;IA6BhC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;YA+B9D,UAAU;YAoCV,cAAc;YAuDd,YAAY;IAsH1B;;;;;OAKG;IACH,OAAO,CAAC,MAAM;CAyBf"}

package/dist/search/search-service.js

@@ -1,5 +1,27 @@
+/**
+ * Adapted from obsidian-qmd (MIT): https://github.com/thirteen37/obsidian-qmd
+ * Source: src/search/SearchService.ts. Carried over: the core idea of
+ * Reciprocal Rank Fusion over independently-ranked BM25 and vector result
+ * lists, with small positional bonuses for top ranks (RRF_K=60, same
+ * constant as upstream). Dropped: `QueryExpansionService` and
+ * `RerankingService` integration — both call out to an LLM, which is out of
+ * scope for this offline CLI (the brief's three dependencies are minisearch,
+ * @huggingface/transformers, and hnswlib-node; no LLM client). Also dropped:
+ * `groupByFile`/section dedup UI conveniences not needed by a line-oriented
+ * CLI, since callers get raw scored chunks that already carry a line number.
+ */
+import { searchableText } from "../storage/document-store.js";
 import { extractQueryTerms, buildSnippet } from "./snippet.js";
+import { passesKeywordGate, passesVectorGate, normalizeQuery, DEFAULT_MIN_TERM_COVERAGE, DEFAULT_MIN_VECTOR_SCORE, } from "./relevance.js";
+import { authorityFactor } from "./authority.js";
 const RRF_K = 60;
+/**
+ * Retrieval over-fetch. The gate and the authority pass both remove or demote
+ * results, so each modality is asked for more than the caller wants -- without
+ * this a demoted document merely shuffles within the page instead of leaving
+ * it.
+ */
+const OVERFETCH = 3;
 export class SearchService {
     docStore;
     vectorStore;
@@ -9,54 +31,142 @@ export class SearchService {
         this.vectorStore = vectorStore;
         this.embeddingService = embeddingService;
     }
+    /**
+     * Fetch vector chunks and collapse to the best-scoring chunk per FILE,
+     * growing the request until `fileLimit` distinct files are found (or the
+     * store has no more chunks to give).
+     *
+     * `DocumentStore.search` collapses to one result per file before slicing
+     * to a limit (see its comment); a raw HNSW search can't do the equivalent
+     * because it has to be told a chunk budget upfront, and one large document
+     * can own most of that budget -- on the real corpus,
+     * docs/architecture/engine/lessons-learned.md supplied 26 of the top 30
+     * vector hits for one query, leaving only 4 chunk-slots (not file-slots)
+     * for every other document combined. Raising the chunk budget cannot fix
+     * this in general, since a bigger document just needs a bigger multiple.
+     * Instead ask for more chunks, geometrically, until enough distinct files
+     * have shown up -- the same "collapse before slice" shape the keyword side
+     * already gets from MiniSearch returning its full match list.
+     */
+    async fetchVectorResultsByFile(embedding, fileLimit) {
+        // `fileLimit` already carries the caller's OVERFETCH (see semanticSearch
+        // / hybridSearch) -- starting the first request at `fileLimit` again
+        // multiplied by OVERFETCH asked for a chunk budget nobody wanted; the
+        // first request's budget is `fileLimit` itself.
+        let k = fileLimit;
+        let byFile = new Map();
+        for (;;) {
+            const raw = await this.vectorStore.search(embedding, k);
+            byFile = new Map();
+            for (const r of raw) {
+                const incumbent = byFile.get(r.filePath);
+                if (!incumbent || r.score > incumbent.score)
+                    byFile.set(r.filePath, r);
+            }
+            // Stop once enough distinct files have surfaced, or once the store
+            // hands back fewer chunks than asked for -- a strictly smaller
+            // response is unambiguous proof there is nothing left to fetch. A
+            // response of exactly `k` is not that proof (the store may hold
+            // more), so that case keeps growing instead of stopping one
+            // (increasingly expensive) request early.
+            if (byFile.size >= fileLimit || raw.length < k)
+                break;
+            k *= 2;
+        }
+        return Array.from(byFile.values()).sort((a, b) => b.score - a.score);
+    }
     async search(query, options) {
-        const trimmed = query.trim();
+        // The CLI normalizes (pipe-stripping, whitespace-collapsing) before
+        // calling in, but a library consumer of SearchService directly would
+        // otherwise get different pipe-handling than the CLI does for the exact
+        // same query string. Doing it here makes every caller's behaviour the
+        // same. Idempotent, so normalizing an already-normalized CLI query is a
+        // no-op, not a double-transform.
+        const trimmed = normalizeQuery(query);
         if (!trimmed)
             return [];
         const limit = options.limit ?? 10;
+        // The CLI validates its flags, but this is also a library entry point. An
+        // unchecked limit reached hnswlib as a negative k and surfaced a native
+        // error describing the opposite problem; a fractional or NaN limit silently
+        // emptied the page via slice(). Fail here, where the message can be true.
+        if (!Number.isInteger(limit) || limit < 1) {
+            throw new Error(`limit must be a positive integer, got ${String(options.limit)}`);
+        }
         const highlight = options.highlight ?? "plain";
         const repoRoot = options.repoRoot;
         switch (options.mode) {
             case "keyword":
-                return this.textSearch(trimmed, options.scope, limit, highlight, repoRoot);
+                return this.finish(await this.textSearch(trimmed, limit, highlight, repoRoot, options), limit, options);
             case "semantic":
-                return this.semanticSearch(trimmed, options.scope, limit, highlight, repoRoot);
+                return this.finish(await this.semanticSearch(trimmed, limit, highlight, repoRoot, options), limit, options);
             case "hybrid":
-                return this.hybridSearch(trimmed, options.scope, limit, highlight, repoRoot);
+                return this.finish(await this.hybridSearch(trimmed, limit, highlight, repoRoot, options), limit, options);
         }
     }
-    async textSearch(query, scope, limit, highlight, repoRoot) {
-        const results = await this.docStore.search(query, { limit, scope, highlight, repoRoot });
-        return results.map((r) => ({
+    async textSearch(query, limit, highlight, repoRoot, options) {
+        const minCoverage = options.minCoverage ?? DEFAULT_MIN_TERM_COVERAGE;
+        const stats = this.docStore.corpusStats(extractQueryTerms(query));
+        const results = await this.docStore.search(query, {
+            limit: limit * OVERFETCH,
+            highlight,
+            repoRoot,
+        });
+        return results
+            .filter((r) => passesKeywordGate(query, searchableText(r), minCoverage, stats))
+            .map((r) => ({
             id: r.id,
             filePath: r.filePath,
             chunkIndex: r.chunkIndex,
             startLine: r.startLine,
             textScore: r.score,
+            baseScore: r.score,
             snippet: r.snippet,
             content: r.content,
             headingBreadcrumb: r.headingBreadcrumb,
+            title: r.title,
+            description: r.description,
+            headings: r.headings,
+            status: r.status,
+            documentType: r.documentType,
+            lastUpdate: r.lastUpdate,
             source: "text",
         }));
     }
-    async semanticSearch(query, scope, limit, highlight, repoRoot) {
+    async semanticSearch(query, limit, highlight, repoRoot, options) {
         if (!this.embeddingService) {
             throw new Error("Semantic search requires an embedding service");
         }
+        const minVectorScore = options.minVectorScore ?? DEFAULT_MIN_VECTOR_SCORE;
         const embedding = await this.embeddingService.embed(query);
-        const results = await this.vectorStore.search(embedding, limit, scope);
+        const raw = await this.fetchVectorResultsByFile(embedding, limit * OVERFETCH);
+        const results = raw.filter((r) => passesVectorGate(r.score, minVectorScore));
         const queryTerms = extractQueryTerms(query);
         const hybridResults = [];
         for (const r of results) {
             const doc = await this.docStore.getDocument(r.id);
+            // The vector index and the document store are written separately, so a
+            // point can outlive its chunk. Without the chunk there is no line and no
+            // text to show -- it rendered as a citation to "file:0" with no snippet.
+            // Drop what we cannot substantiate rather than print a line that is not
+            // there.
+            if (!doc)
+                continue;
             hybridResults.push({
                 id: r.id,
                 filePath: r.filePath,
                 chunkIndex: r.chunkIndex,
                 startLine: doc?.startLine ?? 0,
                 vectorScore: r.score,
+                baseScore: r.score,
                 content: doc?.content,
                 headingBreadcrumb: doc?.headingBreadcrumb,
+                title: doc?.title,
+                description: doc?.description,
+                headings: doc?.headings,
+                status: doc?.status,
+                documentType: doc?.documentType,
+                lastUpdate: doc?.lastUpdate,
                 snippet: doc
                     ? await buildSnippet({ filePath: r.filePath, content: doc.content, startLine: doc.startLine }, queryTerms, highlight, repoRoot)
                     : undefined,
@@ -65,16 +175,28 @@ export class SearchService {
         }
         return hybridResults;
     }
-    async hybridSearch(query, scope, limit, highlight, repoRoot) {
-        const [textResults, vectorResults] = await Promise.all([
-            this.docStore.search(query, { limit: limit * 2, scope, highlight, repoRoot }),
+    async hybridSearch(query, limit, highlight, repoRoot, options) {
+        const minCoverage = options.minCoverage ?? DEFAULT_MIN_TERM_COVERAGE;
+        const minVectorScore = options.minVectorScore ?? DEFAULT_MIN_VECTOR_SCORE;
+        const [rawText, rawVector] = await Promise.all([
+            this.docStore.search(query, { limit: limit * OVERFETCH, highlight, repoRoot }),
             this.embeddingService
-                ? this.vectorStore.search(await this.embeddingService.embed(query), limit * 2, scope)
+                ? this.fetchVectorResultsByFile(await this.embeddingService.embed(query), limit * OVERFETCH)
                 : Promise.resolve([]),
         ]);
-        const byId = new Map();
+        // Gate each list on its own evidence before fusion. Afterwards the scores
+        // are ranks, and a rank cannot tell a good match from a bad one.
+        const stats = this.docStore.corpusStats(extractQueryTerms(query));
+        const textResults = rawText.filter((r) => passesKeywordGate(query, searchableText(r), minCoverage, stats));
+        const vectorResults = rawVector.filter((r) => passesVectorGate(r.score, minVectorScore));
+        // Fuse per FILE, not per chunk. The keyword and vector sides routinely pick
+        // different chunks of the same document; keyed by chunk id they would
+        // compete as separate entries and one side's evidence would be thrown away
+        // at the final collapse. Keyed by file they reinforce, which is what a
+        // document matching both ways should mean.
+        const byFile = new Map();
         textResults.forEach((r, index) => {
-            byId.set(r.id, {
+            byFile.set(r.filePath, {
                 id: r.id,
                 filePath: r.filePath,
                 chunkIndex: r.chunkIndex,
@@ -84,20 +206,32 @@ export class SearchService {
                 snippet: r.snippet,
                 content: r.content,
                 headingBreadcrumb: r.headingBreadcrumb,
+                title: r.title,
+                description: r.description,
+                headings: r.headings,
+                status: r.status,
+                documentType: r.documentType,
+                lastUpdate: r.lastUpdate,
                 source: "text",
             });
         });
         const queryTerms = extractQueryTerms(query);
         for (const [index, r] of vectorResults.entries()) {
-            const existing = byId.get(r.id);
+            const existing = byFile.get(r.filePath);
             if (existing) {
-                existing.vectorScore = r.score;
-                existing.vectorRank = index + 1;
+                // Keep the keyword side's chunk for display -- its snippet already has
+                // the query terms marked -- and take the vector rank as extra evidence
+                // for the same document.
+                existing.vectorScore = Math.max(existing.vectorScore ?? 0, r.score);
+                existing.vectorRank = Math.min(existing.vectorRank ?? Infinity, index + 1);
                 existing.source = "hybrid";
             }
             else {
                 const doc = await this.docStore.getDocument(r.id);
-                byId.set(r.id, {
+                // Same orphan case as in semanticSearch: no chunk, nothing to cite.
+                if (!doc)
+                    continue;
+                byFile.set(r.filePath, {
                     id: r.id,
                     filePath: r.filePath,
                     chunkIndex: r.chunkIndex,
@@ -106,6 +240,12 @@ export class SearchService {
                     vectorRank: index + 1,
                     content: doc?.content,
                     headingBreadcrumb: doc?.headingBreadcrumb,
+                    title: doc?.title,
+                    description: doc?.description,
+                    headings: doc?.headings,
+                    status: doc?.status,
+                    documentType: doc?.documentType,
+                    lastUpdate: doc?.lastUpdate,
                     snippet: doc
                         ? await buildSnippet({ filePath: r.filePath, content: doc.content, startLine: doc.startLine }, queryTerms, highlight, repoRoot)
                         : undefined,
@@ -113,7 +253,7 @@ export class SearchService {
                 });
             }
         }
-        const results = Array.from(byId.values()).map((r) => {
+        const results = Array.from(byFile.values()).map((r) => {
             let rrfScore = 0;
             if (r.textRank) {
                 rrfScore += 1 / (RRF_K + r.textRank);
@@ -130,10 +270,33 @@ export class SearchService {
                     rrfScore += 0.02;
             }
             const { textRank, vectorRank, ...clean } = r;
-            return { ...clean, rrfScore };
+            return { ...clean, rrfScore, baseScore: rrfScore };
+        });
+        return results;
+    }
+    /**
+     * Apply authority weighting and produce the final page.
+     *
+     * Every mode ends here, so `--mode keyword` cannot become a quiet bypass of
+     * the same weighting hybrid results get.
+     */
+    finish(results, limit, options) {
+        const now = options.now ?? Date.now();
+        const weighted = results.map((r) => {
+            const base = r.baseScore ?? r.rrfScore ?? r.textScore ?? r.vectorScore ?? 0;
+            const authority = options.rawRank ? 1 : authorityFactor(r, now);
+            return { ...r, baseScore: base, authority, finalScore: base * authority };
         });
-        results.sort((a, b) => (b.rrfScore ?? 0) - (a.rrfScore ?? 0));
-        return results.slice(0, limit);
+        weighted.sort((a, b) => b.finalScore - a.finalScore);
+        // No per-file dedup here: every path into this method already returns
+        // at most one row per file. DocumentStore.search (used by both
+        // textSearch and hybridSearch's text side) and fetchVectorResultsByFile
+        // both collapse to the best-scoring chunk per file before their caller
+        // ever sees a result, and hybridSearch's fusion map is keyed by
+        // filePath. Verified with an instrumented dedup counter across the full
+        // test suite plus the exact "two chunks of one file both clear the
+        // gate" semantic-mode shape that used to need this -- it never fires.
+        return weighted.slice(0, limit).map(({ finalScore, ...r }) => r);
     }
 }
 //# sourceMappingURL=search-service.js.map

package/dist/search/search-service.js.map

@@ -1 +1 @@
-{"version":3,"file":"search-service.js","sourceRoot":"","sources":["../../src/search/search-service.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AA8B/D,MAAM,KAAK,GAAG,EAAE,CAAC;AAEjB,MAAM,OAAO,aAAa;IAEd;IACA;IACA;IAHV,YACU,QAAuB,EACvB,WAAwB,EACxB,gBAAyC;QAFzC,aAAQ,GAAR,QAAQ,CAAe;QACvB,gBAAW,GAAX,WAAW,CAAa;QACxB,qBAAgB,GAAhB,gBAAgB,CAAyB;IAChD,CAAC;IAEJ,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,OAAsB;QAChD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;QAClC,MAAM,SAAS,GAAkB,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC;QAC9D,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QAElC,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACrB,KAAK,SAAS;gBACZ,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YAC7E,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YACjF,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,UAAU,CACtB,KAAa,EACb,KAAY,EACZ,KAAa,EACb,SAAwB,EACxB,QAAiB;QAEjB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC;QACzF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACzB,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,SAAS,EAAE,CAAC,CAAC,KAAK;YAClB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,iBAAiB,EAAE,CAAC,CAAC,iBAAiB;YACtC,MAAM,EAAE,MAAe;SACxB,CAAC,CAAC,CAAC;IACN,CAAC;IAEO,KAAK,CAAC,cAAc,CAC1B,KAAa,EACb,KAAY,EACZ,KAAa,EACb,SAAwB,EACxB,QAAiB;QAEjB,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAEvE,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE5C,MAAM,aAAa,GAAmB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClD,aAAa,CAAC,IAAI,CAAC;gBACjB,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,SAAS,EAAE,GAAG,EAAE,SAAS,IAAI,CAAC;gBAC9B,WAAW,EAAE,CAAC,CAAC,KAAK;gBACpB,OAAO,EAAE,GAAG,EAAE,OAAO;gBACrB,iBAAiB,EAAE,GAAG,EAAE,iBAAiB;gBACzC,OAAO,EAAE,GAAG;oBACV,CAAC,CAAC,MAAM,YAAY,CAChB,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,EACxE,UAAU,EACV,SAAS,EACT,QAAQ,CACT;oBACH,CAAC,CAAC,SAAS;gBACb,MAAM,EAAE,QAAiB;aAC1B,CAAC,CAAC;QACL,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IAEO,KAAK,CAAC,YAAY,CACxB,KAAa,EACb,KAAY,EACZ,KAAa,EACb,SAAwB,EACxB,QAAiB;QAEjB,MAAM,CAAC,WAAW,EAAE,aAAa,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACrD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;YAC7E,IAAI,CAAC,gBAAgB;gBACnB,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC;gBACrF,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;SACxB,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,IAAI,GAAG,EAGjB,CAAC;QAEJ,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE;YAC/B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACb,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,SAAS,EAAE,CAAC,CAAC,KAAK;gBAClB,QAAQ,EAAE,KAAK,GAAG,CAAC;gBACnB,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,iBAAiB,EAAE,CAAC,CAAC,iBAAiB;gBACtC,MAAM,EAAE,MAAM;aACf,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE5C,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC;gBAC/B,QAAQ,CAAC,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC;gBAChC,QAAQ,CAAC,MAAM,GAAG,QAAQ,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAClD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;oBACb,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;oBACpB,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,SAAS,EAAE,GAAG,EAAE,SAAS,IAAI,CAAC;oBAC9B,WAAW,EAAE,CAAC,CAAC,KAAK;oBACpB,UAAU,EAAE,KAAK,GAAG,CAAC;oBACrB,OAAO,EAAE,GAAG,EAAE,OAAO;oBACrB,iBAAiB,EAAE,GAAG,EAAE,iBAAiB;oBACzC,OAAO,EAAE,GAAG;wBACV,CAAC,CAAC,MAAM,YAAY,CAChB,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,EACxE,UAAU,EACV,SAAS,EACT,QAAQ,CACT;wBACH,CAAC,CAAC,SAAS;oBACb,MAAM,EAAE,QAAQ;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAClD,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACf,QAAQ,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC;oBAAE,QAAQ,IAAI,IAAI,CAAC;qBAClC,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC;oBAAE,QAAQ,IAAI,IAAI,CAAC;YAC7C,CAAC;YACD,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;gBACjB,QAAQ,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC;oBAAE,QAAQ,IAAI,IAAI,CAAC;qBACpC,IAAI,CAAC,CAAC,UAAU,IAAI,CAAC;oBAAE,QAAQ,IAAI,IAAI,CAAC;YAC/C,CAAC;YACD,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;YAC7C,OAAO,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9D,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;CACF"}
+{"version":3,"file":"search-service.js","sourceRoot":"","sources":["../../src/search/search-service.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,EAAiB,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAK7E,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE/D,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,cAAc,EACd,yBAAyB,EACzB,wBAAwB,GACzB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AA8CjD,MAAM,KAAK,GAAG,EAAE,CAAC;AAEjB;;;;;GAKG;AACH,MAAM,SAAS,GAAG,CAAC,CAAC;AAGpB,MAAM,OAAO,aAAa;IAEd;IACA;IACA;IAHV,YACU,QAAuB,EACvB,WAAwB,EACxB,gBAAyC;QAFzC,aAAQ,GAAR,QAAQ,CAAe;QACvB,gBAAW,GAAX,WAAW,CAAa;QACxB,qBAAgB,GAAhB,gBAAgB,CAAyB;IAChD,CAAC;IAEJ;;;;;;;;;;;;;;;;OAgBG;IACK,KAAK,CAAC,wBAAwB,CACpC,SAAmB,EACnB,SAAiB;QAEjB,yEAAyE;QACzE,qEAAqE;QACrE,sEAAsE;QACtE,gDAAgD;QAChD,IAAI,CAAC,GAAG,SAAS,CAAC;QAClB,IAAI,MAAM,GAAG,IAAI,GAAG,EAA8B,CAAC;QACnD,SAAS,CAAC;YACR,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YACxD,MAAM,GAAG,IAAI,GAAG,EAA8B,CAAC;YAC/C,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;gBACpB,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACzC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,KAAK;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACzE,CAAC;YACD,mEAAmE;YACnE,+DAA+D;YAC/D,kEAAkE;YAClE,gEAAgE;YAChE,4DAA4D;YAC5D,0CAA0C;YAC1C,IAAI,MAAM,CAAC,IAAI,IAAI,SAAS,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAM;YACtD,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACvE,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,OAAsB;QAChD,oEAAoE;QACpE,qEAAqE;QACrE,wEAAwE;QACxE,sEAAsE;QACtE,wEAAwE;QACxE,iCAAiC;QACjC,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;QAClC,0EAA0E;QAC1E,wEAAwE;QACxE,4EAA4E;QAC5E,0EAA0E;QAC1E,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,IAAI,KAAK,CAAC,yCAAyC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpF,CAAC;QACD,MAAM,SAAS,GAAkB,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC;QAC9D,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QAElC,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACrB,KAAK,SAAS;gBACZ,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1G,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC9G,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC9G,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,UAAU,CACtB,KAAa,EACb,KAAa,EACb,SAAwB,EACxB,QAA4B,EAC5B,OAAsB;QAEtB,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,yBAAyB,CAAC;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;QAClE,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE;YAChD,KAAK,EAAE,KAAK,GAAG,SAAS;YACxB,SAAS;YACT,QAAQ;SACT,CAAC,CAAC;QACH,OAAO,OAAO;aACX,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;aAC9E,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,SAAS,EAAE,CAAC,CAAC,KAAK;YAClB,SAAS,EAAE,CAAC,CAAC,KAAK;YAClB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,iBAAiB,EAAE,CAAC,CAAC,iBAAiB;YACtC,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,MAAM,EAAE,MAAe;SACxB,CAAC,CAAC,CAAC;IACR,CAAC;IAEO,KAAK,CAAC,cAAc,CAC1B,KAAa,EACb,KAAa,EACb,SAAwB,EACxB,QAA4B,EAC5B,OAAsB;QAEtB,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,wBAAwB,CAAC;QAC1E,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3D,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,KAAK,GAAG,SAAS,CAAC,CAAC;QAC9E,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC;QAE7E,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE5C,MAAM,aAAa,GAAmB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClD,uEAAuE;YACvE,yEAAyE;YACzE,yEAAyE;YACzE,wEAAwE;YACxE,SAAS;YACT,IAAI,CAAC,GAAG;gBAAE,SAAS;YACnB,aAAa,CAAC,IAAI,CAAC;gBACjB,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,SAAS,EAAE,GAAG,EAAE,SAAS,IAAI,CAAC;gBAC9B,WAAW,EAAE,CAAC,CAAC,KAAK;gBACpB,SAAS,EAAE,CAAC,CAAC,KAAK;gBAClB,OAAO,EAAE,GAAG,EAAE,OAAO;gBACrB,iBAAiB,EAAE,GAAG,EAAE,iBAAiB;gBACzC,KAAK,EAAE,GAAG,EAAE,KAAK;gBACjB,WAAW,EAAE,GAAG,EAAE,WAAW;gBAC7B,QAAQ,EAAE,GAAG,EAAE,QAAQ;gBACvB,MAAM,EAAE,GAAG,EAAE,MAAM;gBACnB,YAAY,EAAE,GAAG,EAAE,YAAY;gBAC/B,UAAU,EAAE,GAAG,EAAE,UAAU;gBAC3B,OAAO,EAAE,GAAG;oBACV,CAAC,CAAC,MAAM,YAAY,CAChB,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,EACxE,UAAU,EACV,SAAS,EACT,QAAQ,CACT;oBACH,CAAC,CAAC,SAAS;gBACb,MAAM,EAAE,QAAiB;aAC1B,CAAC,CAAC;QACL,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IAEO,KAAK,CAAC,YAAY,CACxB,KAAa,EACb,KAAa,EACb,SAAwB,EACxB,QAA4B,EAC5B,OAAsB;QAEtB,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,yBAAyB,CAAC;QACrE,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,wBAAwB,CAAC;QAE1E,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;YAC9E,IAAI,CAAC,gBAAgB;gBACnB,CAAC,CAAC,IAAI,CAAC,wBAAwB,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC;gBAC5F,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;SACxB,CAAC,CAAC;QAEH,0EAA0E;QAC1E,iEAAiE;QACjE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;QAClE,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACvC,iBAAiB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAChE,CAAC;QACF,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC;QAEzF,4EAA4E;QAC5E,sEAAsE;QACtE,2EAA2E;QAC3E,uEAAuE;QACvE,2CAA2C;QAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAGnB,CAAC;QAEJ,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE;YAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE;gBACrB,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,SAAS,EAAE,CAAC,CAAC,KAAK;gBAClB,QAAQ,EAAE,KAAK,GAAG,CAAC;gBACnB,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,iBAAiB,EAAE,CAAC,CAAC,iBAAiB;gBACtC,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,YAAY,EAAE,CAAC,CAAC,YAAY;gBAC5B,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,MAAM,EAAE,MAAM;aACf,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE5C,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACxC,IAAI,QAAQ,EAAE,CAAC;gBACb,uEAAuE;gBACvE,uEAAuE;gBACvE,yBAAyB;gBACzB,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBACpE,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,IAAI,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC3E,QAAQ,CAAC,MAAM,GAAG,QAAQ,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAClD,oEAAoE;gBACpE,IAAI,CAAC,GAAG;oBAAE,SAAS;gBACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE;oBACrB,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;oBACpB,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,SAAS,EAAE,GAAG,EAAE,SAAS,IAAI,CAAC;oBAC9B,WAAW,EAAE,CAAC,CAAC,KAAK;oBACpB,UAAU,EAAE,KAAK,GAAG,CAAC;oBACrB,OAAO,EAAE,GAAG,EAAE,OAAO;oBACrB,iBAAiB,EAAE,GAAG,EAAE,iBAAiB;oBACzC,KAAK,EAAE,GAAG,EAAE,KAAK;oBACjB,WAAW,EAAE,GAAG,EAAE,WAAW;oBAC7B,QAAQ,EAAE,GAAG,EAAE,QAAQ;oBACvB,MAAM,EAAE,GAAG,EAAE,MAAM;oBACnB,YAAY,EAAE,GAAG,EAAE,YAAY;oBAC/B,UAAU,EAAE,GAAG,EAAE,UAAU;oBAC3B,OAAO,EAAE,GAAG;wBACV,CAAC,CAAC,MAAM,YAAY,CAChB,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,EACxE,UAAU,EACV,SAAS,EACT,QAAQ,CACT;wBACH,CAAC,CAAC,SAAS;oBACb,MAAM,EAAE,QAAQ;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACpD,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACf,QAAQ,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC;oBAAE,QAAQ,IAAI,IAAI,CAAC;qBAClC,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC;oBAAE,QAAQ,IAAI,IAAI,CAAC;YAC7C,CAAC;YACD,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;gBACjB,QAAQ,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC;oBAAE,QAAQ,IAAI,IAAI,CAAC;qBACpC,IAAI,CAAC,CAAC,UAAU,IAAI,CAAC;oBAAE,QAAQ,IAAI,IAAI,CAAC;YAC/C,CAAC;YACD,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;YAC7C,OAAO,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;QACrD,CAAC,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACK,MAAM,CACZ,OAAuB,EACvB,KAAa,EACb,OAAsB;QAEtB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;QAEtC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACjC,MAAM,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC;YAC5E,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAChE,OAAO,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,IAAI,GAAG,SAAS,EAAE,CAAC;QAC5E,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAErD,sEAAsE;QACtE,+DAA+D;QAC/D,wEAAwE;QACxE,uEAAuE;QACvE,gEAAgE;QAChE,wEAAwE;QACxE,mEAAmE;QACnE,sEAAsE;QACtE,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;CACF"}

package/dist/search/snippet.d.ts

@@ -16,6 +16,17 @@ export declare function extractQueryTerms(query: string): string[];
  *    the output programmatically, so escape codes would just be noise, and
  *    literal `**` clutter is exactly the bug being fixed). */
 export type HighlightMode = "ansi" | "plain";
+/**
+ * Does `text` contain `term` as a word?
+ *
+ * The single definition of "contains this term", shared by snippet
+ * highlighting, the relevance gate, and the document-frequency count behind
+ * it. Two implementations of this question disagree silently: a substring
+ * test credited a document about a "dialog box" with the term "log" while
+ * reporting that "log" appeared in no document at all, which handed it
+ * maximum IDF weight and inverted the ranking.
+ */
+export declare function containsTerm(text: string, term: string): boolean;
 /** Context needed to resolve a chunk-local match position against the real,
  * full source file rather than just the chunk's own text (fix #4 in the
  * module doc-comment). `chunkStartLine` is the chunk's 1-based start line

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

@@ -1 +1 @@
-{"version":3,"file":"snippet.d.ts","sourceRoot":"","sources":["../../src/search/snippet.ts"],"names":[],"mappings":"AAwDA;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAKzD;AAMD;;;;;;;8DAO8D;AAC9D,MAAM,MAAM,aAAa,GAAG,MAAM,GAAG,OAAO,CAAC;AAoO7C;;;;kCAIkC;AAClC,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EAAE,EACf,aAAa,GAAE,aAAuB,EACtC,WAAW,CAAC,EAAE,WAAW,GACxB,MAAM,CA4BR;AAED,gEAAgE;AAChE,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,sEAAsE;IACtE,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,YAAY,CAChC,GAAG,EAAE,UAAU,EACf,KAAK,EAAE,MAAM,EAAE,EACf,aAAa,EAAE,aAAa,EAC5B,QAAQ,CAAC,EAAE,MAAM,GAChB,OAAO,CAAC,MAAM,CAAC,CAWjB"}
+{"version":3,"file":"snippet.d.ts","sourceRoot":"","sources":["../../src/search/snippet.ts"],"names":[],"mappings":"AAoFA;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CASzD;AAMD;;;;;;;8DAO8D;AAC9D,MAAM,MAAM,aAAa,GAAG,MAAM,GAAG,OAAO,CAAC;AA+C7C;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAGhE;AAsMD;;;;kCAIkC;AAClC,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EAAE,EACf,aAAa,GAAE,aAAuB,EACtC,WAAW,CAAC,EAAE,WAAW,GACxB,MAAM,CA4BR;AAuBD,gEAAgE;AAChE,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,sEAAsE;IACtE,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,YAAY,CAChC,GAAG,EAAE,UAAU,EACf,KAAK,EAAE,MAAM,EAAE,EACf,aAAa,EAAE,aAAa,EAC5B,QAAQ,CAAC,EAAE,MAAM,GAChB,OAAO,CAAC,MAAM,CAAC,CAiBjB"}