sensemaking 0.26.0 → 0.27.0

package/dist/esm/commands/search.js

@@ -274,6 +274,9 @@ async function lineRangeFor(store, path, line) {
     return row ? `L${row.start_line}-${row.end_line}` : null;
 }
 function validateSearchOptions(opts) {
+    if (opts.explain !== undefined && typeof opts.explain !== 'boolean') {
+        throw new SenseError('SEARCH_OPTION_INVALID', `search option "explain" must be a boolean, got ${String(opts.explain)}`);
+    }
     for (const [name, value] of [
         [
             'k',
@@ -425,7 +428,7 @@ async function searchSnapshot(store, cfg, terms, opts, prepared, preparedSignatu
         const syntaxError = bareTermSyntaxError(terms);
         if (syntaxError) throw syntaxError;
         try {
-            matchRows = await wordsCandidates(store, candidates, terms, whereJoin, whereCond, scopeCond, fetch, signals.words);
+            matchRows = await wordsCandidates(store, candidates, terms, whereJoin, whereCond, scopeCond, fetch, signals.words, opts.explain);
         } catch (err) {
             throw searchError(err, terms, scope);
         }
@@ -433,11 +436,11 @@ async function searchSnapshot(store, cfg, terms, opts, prepared, preparedSignatu
     // Every store's lexical `snippets` is NULL; the snippet text is always computed below.
     // Distinguish from via='link' rows, which never appear in matchRows.
     const matchedPaths = new Set(matchRows.map((r)=>r.path));
-    if (signals.links !== undefined) await linksCandidates(store, candidates, matchRows, allPaths, allowedPaths, fetch, signals.links);
+    if (signals.links !== undefined) await linksCandidates(store, candidates, matchRows, allPaths, allowedPaths, fetch, signals.links, opts.explain);
     let chunkLines = new Map();
     let chunkSimilarity = new Map();
     if (semanticEnabled && signals.vectors !== undefined && prepared !== undefined) {
-        ({ chunkLines, chunkSimilarity } = await vectorsCandidates(store, prepared, candidates, fetch, allowedPaths, allPaths.length, signals.vectors));
+        ({ chunkLines, chunkSimilarity } = await vectorsCandidates(store, prepared, candidates, fetch, allowedPaths, allPaths.length, signals.vectors, opts.explain));
     }
     await store.exec('DROP TABLE IF EXISTS _search');
     // DOUBLE, not REAL: sqlite's REAL is an 8-byte double but duckdb's is a 4-byte float, and the
@@ -474,5 +477,10 @@ async function searchSnapshot(store, cfg, terms, opts, prepared, preparedSignatu
     });
     for (const row of rows)row.snippets = [];
     await hydrateSearchRows(store, cfg, rows, matchedPaths, terms, opts);
+    if (opts.explain) {
+        var _ref;
+        var _candidates_get;
+        for (const row of rows)row.explanation = (_ref = (_candidates_get = candidates.get(row.path)) === null || _candidates_get === void 0 ? void 0 : _candidates_get.explanation) !== null && _ref !== void 0 ? _ref : [];
+    }
     return rows;
 }

package/dist/esm/commands/search.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands/search.ts"],"sourcesContent":["import { channel } from 'node:diagnostics_channel';\nimport { stemmer } from 'stemmer';\nimport type { EffectiveSearch, ResolvedConfig } from '../config/index.ts';\nimport { embedConfig, featureEnabled, resolveSearch } from '../config/index.ts';\nimport type { PreparedSemanticQuery } from '../embed/query.ts';\nimport { ensureDocumentEmbeddings, prepareSemanticQuery } from '../embed/query.ts';\nimport { localModelMissing, MODEL_FILENAMES } from '../embed/store.ts';\nimport { SenseError } from '../errors.ts';\nimport { serialQuery } from '../lib/serial-query.ts';\nimport { bareTermSyntaxError, searchError } from '../output/search-error.ts';\nimport type { LexicalHit, Store } from '../store/types.ts';\nimport { foldForSearch, hasUnspacedRun, searchTokens, unspacedRuns } from '../text/segment.ts';\nimport { materializeScope, narrowByWhere, rawScope, scopeHasEmbeddings } from './scope.ts';\nimport type { Candidates, SearchResultVia } from './signals.ts';\nimport { linksCandidates, vectorsCandidates, wordsCandidates } from './signals.ts';\nimport { assertQuerySnapshot } from './snapshot.ts';\n\nexport type { SearchResultVia } from './signals.ts';\n\n// Default budget behind --snippet-char-limit/--snippet-count-limit: the limit is whatever the\n// caller passes, these only say what happens when they pass nothing (DESIGN.md \"Search snippets\").\nexport const SNIPPET_CHAR_LIMIT_DEFAULT = 80;\nexport const SNIPPET_COUNT_LIMIT_DEFAULT = 1;\n\nconst searchCandidatesRead = channel('sensemaking.search.candidates-read');\n\n// Bare terms from an FTS5 query string: strips operators/quoting, not real terms, so the\n// snippet scan matches what the query matched -- FTS5 operators are uppercase-only, so this is too.\nfunction extractBareTerms(query: string): string[] {\n  const cleaned = query\n    .replace(/\"/g, ' ')\n    .replace(/[()*]/g, ' ')\n    .replace(/\\b(AND|OR|NOT|NEAR)\\b(\\/\\d+)?/g, ' ');\n  return cleaned\n    .split(/\\s+/)\n    .map((tok) => tok.replace(/^[A-Za-z_]\\w*:/, '')) // column filter, e.g. title:term\n    .flatMap((tok) => searchTokens(tok).map(({ text }) => text))\n    .map((tok) => tok.toLowerCase().trim())\n    .filter((tok) => tok.length > 0);\n}\n\n// House convention (src/chunk/group.ts): Intl.Segmenter word boundaries, not a bare \\b, which\n// is ASCII-only. Built on first use: construction is a few ms, paid only when a term matches.\nlet wordSegmenter: Intl.Segmenter | undefined;\n\nfunction findOccurrences(text: string, terms: string[]): Array<{ start: number; end: number; term: string }> {\n  const occ: Array<{ start: number; end: number; term: string }> = [];\n  const textLower = text.toLowerCase();\n\n  // Unspaced scripts (UNSPACED_SCRIPTS) mark no word boundaries: the sense-setup skill promises\n  // substring semantics there, so a matching term is found wherever it occurs in the run.\n  const unspacedTerms = terms.filter(hasUnspacedRun);\n  if (unspacedTerms.length > 0) {\n    for (const run of unspacedRuns(text)) {\n      const runLower = textLower.slice(run.start, run.end);\n      for (const term of unspacedTerms) {\n        let idx = 0;\n        for (;;) {\n          const found = runLower.indexOf(term, idx);\n          if (found === -1) break;\n          occ.push({ start: run.start + found, end: run.start + found + term.length, term });\n          idx = found + term.length;\n        }\n      }\n    }\n  }\n\n  // Spaced scripts: a word is marked when its porter stem equals a query term's stem, the same\n  // algorithm both indexes tokenize with (sqlite's TOKENIZE = 'porter unicode61'; duckdb's fts default).\n  const spacedTerms = terms.filter((t) => !hasUnspacedRun(t));\n  if (spacedTerms.length > 0) {\n    const termByStem = new Map(spacedTerms.map((t) => [stemmer(foldForSearch(t)), t]));\n    const stemInitials = new Set(Array.from(termByStem.keys(), (term) => term[0]));\n    for (const match of searchTokens(text)) {\n      const segment = match.text;\n      if (match.unspaced) continue;\n      const folded = foldForSearch(segment);\n      // Porter stemming changes suffixes only, so a different initial cannot match a query stem.\n      if (!stemInitials.has(folded[0])) continue;\n      const term = termByStem.get(stemmer(folded));\n      if (term !== undefined) occ.push({ start: match.start, end: match.end, term });\n    }\n  }\n\n  return occ.sort((a, b) => a.start - b.start || b.end - a.end);\n}\n\n// Segment boundaries of the whole text, word granularity: the only cut points a snippet edge\n// may land on. One rule for every script (DESIGN.md \"Cutting\") -- a regex \\b is ASCII-only and\n// would mis-cut Japanese, Chinese and Thai, which Intl.Segmenter divides by dictionary instead.\nfunction wordBoundaries(text: string): number[] {\n  wordSegmenter ??= new Intl.Segmenter('en', { granularity: 'word' });\n  const bounds = [0];\n  for (const { index, segment } of wordSegmenter.segment(text)) bounds.push(index + segment.length);\n  return bounds;\n}\n\n// bounds is sorted: snaps are binary searches, since each runs once per candidate window.\nfunction snapForward(bounds: number[], pos: number): number {\n  let lo = 0;\n  let hi = bounds.length - 1;\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1;\n    if (bounds[mid] < pos) lo = mid + 1;\n    else hi = mid;\n  }\n  return bounds[lo];\n}\n\nfunction snapBackward(bounds: number[], pos: number): number {\n  let lo = 0;\n  let hi = bounds.length - 1;\n  let result = bounds[0];\n  while (lo < hi) {\n    const mid = (lo + hi + 1) >> 1;\n    if (bounds[mid] <= pos) {\n      lo = mid;\n      result = bounds[mid];\n    } else hi = mid - 1;\n  }\n  return result;\n}\n\nfunction firstBoundAfter(bounds: number[], pos: number): number | undefined {\n  let lo = 0;\n  let hi = bounds.length;\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1;\n    if (bounds[mid] <= pos) lo = mid + 1;\n    else hi = mid;\n  }\n  return bounds[lo];\n}\n\n// A raw, unmarked upper bound: [start, end) inside [anchor, anchor+charLimit), edges on\n// boundaries. Markup (guillemets, ellipses) added on top of this can push the rendered result\n// past charLimit, which is what fitEnd() below corrects for; this is only the starting guess.\n// A single segment spanning the whole target window (a word longer than the char limit) is the\n// one case where holding the boundary rule means the budget is not a hard ceiling.\nfunction cutWindow(text: string, bounds: number[], anchor: number, charLimit: number): { start: number; end: number } {\n  const rawEnd = Math.min(text.length, anchor + charLimit);\n  const start = snapForward(bounds, anchor);\n  let end = snapBackward(bounds, rawEnd);\n  if (end <= start) end = firstBoundAfter(bounds, start) ?? text.length;\n  return { start, end: Math.min(end, text.length) };\n}\n\n// The largest boundary <= upperBound, > floor, whose rendered [*, end) fits charLimit. Markup\n// only ever adds characters as end grows, so rendered length is non-decreasing in end and\n// shrinking from upperBound is guaranteed to find the true fit rather than guess at it.\n// `floor` is the one end this never shrinks past (the anchor's own marked word, or the first\n// word in the unmarked fallback): DESIGN.md's budget is a ceiling except here, where returning\n// nothing is worse than a single word that overruns it.\nfunction fitEnd(render: (end: number) => string, bounds: number[], floor: number, upperBound: number, charLimit: number): number {\n  let lo = 0;\n  let hi = bounds.length - 1;\n  while (lo < hi) {\n    const mid = (lo + hi + 1) >> 1;\n    if (bounds[mid] <= upperBound) lo = mid;\n    else hi = mid - 1;\n  }\n  for (; lo >= 0 && bounds[lo] > floor; lo--) {\n    if (render(bounds[lo]).length <= charLimit) return bounds[lo];\n  }\n  return floor;\n}\n\ninterface Span {\n  start: number;\n  end: number;\n}\n\ninterface SnippetWindow extends Span {\n  distinct: number;\n  count: number;\n}\n\n// occ is start-sorted: a window's first candidate occurrence is a binary search, not a walk.\nfunction firstOccAtOrAfter(occ: Array<{ start: number; end: number; term: string }>, pos: number): number {\n  let lo = 0;\n  let hi = occ.length;\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1;\n    if (occ[mid].start < pos) lo = mid + 1;\n    else hi = mid;\n  }\n  return lo;\n}\n\nfunction renderWindow(text: string, occ: Array<{ start: number; end: number; term: string }>, win: Span): string {\n  let out = '';\n  let cursor = win.start;\n  for (let i = firstOccAtOrAfter(occ, win.start); i < occ.length && occ[i].start < win.end; i++) {\n    const o = occ[i];\n    if (o.end > win.end) continue;\n    // Occurrences of duplicate or substring-overlapping terms (\"test tests\") can overlap;\n    // emitting each would duplicate document text. Keep the first, absorb the rest.\n    if (o.start < cursor) continue;\n    out += `${text.slice(cursor, o.start)}«${text.slice(o.start, o.end)}»`;\n    cursor = o.end;\n  }\n  out += text.slice(cursor, win.end);\n  const prefix = win.start > 0 ? '…' : '';\n  const suffix = win.end < text.length ? '…' : '';\n  return `${prefix}${out.replace(/\\s+/g, ' ')}${suffix}`;\n}\n\n// Scores every occurrence-anchored candidate window: most distinct terms wins, ties broken by\n// most total hits -- coverage now that occurrences are real words, not the false-fragment counts\n// a substring scan produced. Selection itself is unevaluated (DESIGN.md \"Selection, unsettled\").\n// The window's `end` is fitted to the *rendered* text, markup included, not the raw span: a\n// window dense with marks (every guillemet pair adds two characters) shrinks to fit the same\n// budget a sparse one fills almost exactly.\nfunction scoreWindows(occ: Array<{ start: number; end: number; term: string }>, bounds: number[], text: string, charLimit: number): SnippetWindow[] {\n  const candidates: SnippetWindow[] = [];\n  for (let i = 0; i < occ.length; i++) {\n    const winEnd = occ[i].start + charLimit;\n    const seen = new Set<string>();\n    let count = 0;\n    for (let j = i; j < occ.length && occ[j].start < winEnd; j++) {\n      seen.add(occ[j].term);\n      count++;\n    }\n    const start = snapForward(bounds, occ[i].start);\n    const floor = Math.max(start, occ[i].end);\n    const upperBound = Math.max(floor, cutWindow(text, bounds, occ[i].start, charLimit).end);\n    const end = fitEnd((e) => renderWindow(text, occ, { start, end: e }), bounds, floor, upperBound, charLimit);\n    candidates.push({ start, end, distinct: seen.size, count });\n  }\n  return candidates;\n}\n\nfunction overlaps(a: Span, b: Span): boolean {\n  return a.start < b.end && b.start < a.end;\n}\n\n// Same scoring function as a single snippet, kept rather than discarded (DESIGN.md \"Several\n// snippets per note\"): rank by score, take the top non-overlapping windows, then reorder to the\n// note's own order, since several passages from one note read as an abridged note.\nfunction selectWindows(candidates: SnippetWindow[], countLimit: number): { chosen: SnippetWindow[]; best: SnippetWindow } {\n  const ranked = candidates.slice().sort((a, b) => b.distinct - a.distinct || b.count - a.count);\n  const chosen: SnippetWindow[] = [];\n  for (const c of ranked) {\n    if (chosen.length >= countLimit) break;\n    if (chosen.some((s) => overlaps(s, c))) continue;\n    chosen.push(c);\n  }\n  chosen.sort((a, b) => a.start - b.start);\n  return { chosen, best: ranked[0] };\n}\n\n// Builds bounded marked passages and returns the best window's offset for section lookup.\nexport function computeSnippets(text: string, terms: string[], charLimit: number, countLimit: number): { snippets: string[]; offset: number } {\n  const occ = findOccurrences(text, terms);\n  const bounds = wordBoundaries(text);\n  if (occ.length === 0) {\n    // A term matched only via title/summary, not this body text, finds no occurrence here;\n    // fall back to the doc's start, unmarked.\n    const render = (end: number): string => `${text.slice(0, end).replace(/\\s+/g, ' ').trim()}${end < text.length ? '…' : ''}`;\n    const floor = bounds.find((b) => b > 0) ?? text.length;\n    const upperBound = Math.max(floor, cutWindow(text, bounds, 0, charLimit).end);\n    const end = fitEnd(render, bounds, floor, upperBound, charLimit);\n    return { snippets: [render(end)], offset: 0 };\n  }\n  const candidates = scoreWindows(occ, bounds, text, charLimit);\n  const { chosen, best } = selectWindows(candidates, countLimit);\n  return { snippets: chosen.map((win) => renderWindow(text, occ, win)), offset: best.start };\n}\n\n// Converts an offset in the original text to its one-based line number.\nexport function lineNumberAt(text: string, offset: number): number {\n  let line = 1;\n  for (let i = 0; i < offset; i++) if (text.charCodeAt(i) === 10) line++;\n  return line;\n}\n\nasync function lineRangeFor(store: Store, path: string, line: number): Promise<string | null> {\n  const stmt = await store.prepare('SELECT start_line, end_line FROM sections WHERE \"path\" = ? AND start_line <= ? AND end_line >= ? ORDER BY start_line DESC LIMIT 1');\n  const row = (await stmt.get(path, line, line)) as { start_line: number; end_line: number } | undefined;\n  return row ? `L${row.start_line}-${row.end_line}` : null;\n}\n\n/** Options for the root {@link search} API. */\nexport interface SearchOptions {\n  k?: number;\n  where?: string; // SQL fragment against frontmatter alias `f`, e.g. \"f.status = 'active'\"\n  preset?: string; // named preset; unknown name throws listing declared presets, undefined -> \"default\"\n  include?: string[]; // ad hoc scope override (repeatable --include); independent of exclude\n  exclude?: string[]; // ad hoc scope override (repeatable --exclude); independent of include\n  noExclude?: boolean; // --no-exclude: drop the preset's exclude for this command\n  snippetCharLimit?: number; // --snippet-char-limit; defaults to SNIPPET_CHAR_LIMIT_DEFAULT\n  snippetCountLimit?: number; // --snippet-count-limit; defaults to SNIPPET_COUNT_LIMIT_DEFAULT\n  /** Cancels supported provider I/O and stops between phases after active native work finishes. */\n  signal?: AbortSignal;\n}\n\nexport type SearchResult = {\n  path: string;\n  title: string;\n  summary: string;\n  snippets: string[];\n  via: SearchResultVia;\n  score: number;\n  lines: string | null;\n  similarity?: number | null;\n};\n\nexport interface SearchHydrationRow {\n  path: string;\n  snippets?: string[];\n  lines?: string | null;\n}\n\nfunction validateSearchOptions(opts: SearchOptions): void {\n  for (const [name, value] of [\n    ['k', opts.k],\n    ['snippetCharLimit', opts.snippetCharLimit],\n    ['snippetCountLimit', opts.snippetCountLimit],\n  ] as const) {\n    if (value !== undefined && (!Number.isFinite(value) || !Number.isInteger(value) || value <= 0)) {\n      throw new SenseError('SEARCH_OPTION_INVALID', `search option \"${name}\" must be a positive finite integer, got ${String(value)}`);\n    }\n  }\n}\n\n// Hydrates already-ranked rows with snippets and containing-section ranges without reranking.\nexport async function hydrateSearchRows(store: Store, cfg: ResolvedConfig, rows: SearchHydrationRow[], matchedPaths: Set<string>, terms: string, opts: Pick<SearchOptions, 'snippetCharLimit' | 'snippetCountLimit'> = {}): Promise<void> {\n  if (matchedPaths.size === 0) return;\n  const bareTerms = extractBareTerms(terms);\n  const charLimit = opts.snippetCharLimit ?? SNIPPET_CHAR_LIMIT_DEFAULT;\n  const countLimit = opts.snippetCountLimit ?? SNIPPET_COUNT_LIMIT_DEFAULT;\n  const sourceStmt = await store.prepare('SELECT text FROM indexed_sources WHERE \"path\" = ?');\n  for (const row of rows) {\n    if (!matchedPaths.has(row.path)) continue;\n    const source = (await sourceStmt.get(row.path)) as { text: string } | undefined;\n    if (!source) throw new SenseError('INDEX_NOT_READY', `indexed source text is missing for ${String(row.path)}; run \\`sense build --force\\` (or library build(config, { force: true })) before querying`);\n    const text = source.text;\n    const { snippets, offset } = computeSnippets(text, bareTerms, charLimit, countLimit);\n    row.snippets = snippets;\n    if (row.lines == null) row.lines = featureEnabled(cfg, 'sections') ? await lineRangeFor(store, row.path, lineNumberAt(text, offset)) : null;\n  }\n}\n\n/**\n * Searches one committed published generation. Provider work precedes the final read transaction;\n * cancellation waits for active native work and transaction cleanup before rejection.\n */\nexport function search(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<SearchResult[]> {\n  if (opts.signal?.aborted) return Promise.reject(opts.signal.reason);\n  return serialQuery(store, () => searchIndexed(store, cfg, terms, opts));\n}\n\ninterface SearchScope {\n  signature: string;\n  effective: EffectiveSearch;\n  allPaths: string[];\n  scopePaths: Set<string>;\n  allowedPaths: Set<string>;\n  semanticEligible: boolean;\n}\n\nasync function readSearchScope(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions): Promise<SearchScope> {\n  const signature = await assertQuerySnapshot(store, cfg);\n  const effective = resolveSearch(cfg, opts);\n  const allPaths = ((await (await store.prepare('SELECT \"path\" FROM frontmatter')).all()) as Array<{ path: string }>).map((r) => r.path);\n  const scopePaths = await rawScope(store, cfg, opts, allPaths);\n  let allowedPaths: Set<string>;\n  try {\n    allowedPaths = await narrowByWhere(store, scopePaths, effective.where);\n  } catch (err) {\n    throw searchError(err as Error, terms, effective.where);\n  }\n  const wantsVectors = effective.signals.vectors !== undefined;\n  if (wantsVectors) await ensureDocumentEmbeddings(store, cfg, allowedPaths);\n  const semanticEligible = wantsVectors && (await scopeHasEmbeddings(store, cfg, allowedPaths));\n  return { signature, effective, allPaths, scopePaths, allowedPaths, semanticEligible };\n}\n\ninterface SemanticPreparationNeeded {\n  signature: string;\n}\n\nfunction needsSemanticPreparation(result: SearchResult[] | SemanticPreparationNeeded): result is SemanticPreparationNeeded {\n  return !Array.isArray(result);\n}\n\nasync function searchIndexed(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions): Promise<SearchResult[]> {\n  validateSearchOptions(opts);\n  const initial = resolveSearch(cfg, opts);\n  opts.signal?.throwIfAborted();\n  // A downloadable HF id proceeds -- getProvider fetches it lazily on consent. Only a\n  // local path with missing files errors here, since nothing will ever fetch it for itself.\n  const wantsVectors = initial.signals.vectors !== undefined;\n  if (wantsVectors) {\n    const e = embedConfig(cfg); // validate.ts guarantees this is set whenever \"vectors\" is declared\n    if (localModelMissing(e)) {\n      throw new SenseError('EMBED_MODEL_MISSING', `preset \"${initial.presetName}\" searches with vectors, but the local model path \"${e.model}\" is missing ${MODEL_FILENAMES}; point embed.model at a directory containing them, or drop \"vectors\" from that preset's signals to search without them`);\n    }\n  }\n\n  let prepared: PreparedSemanticQuery | undefined;\n  let preparedSignature: string | undefined;\n  if (wantsVectors) {\n    // This first snapshot only decides whether a semantic query can contribute. It closes before\n    // provider/model work, and the complete scope/readiness decision is repeated below.\n    const preflight = await store.transaction(() => readSearchScope(store, cfg, terms, opts));\n    opts.signal?.throwIfAborted();\n    if (preflight.semanticEligible) {\n      preparedSignature = preflight.signature;\n      prepared = await prepareSemanticQuery(cfg, terms, { signal: opts.signal });\n      opts.signal?.throwIfAborted();\n    }\n  }\n\n  opts.signal?.throwIfAborted();\n  let result = await store.transaction(() => searchSnapshot(store, cfg, terms, opts, prepared, preparedSignature));\n  opts.signal?.throwIfAborted();\n  if (!needsSemanticPreparation(result)) return result;\n\n  // The scope became vector-eligible after an empty/ineligible preflight. Leave that snapshot,\n  // prepare once, then take a fresh final snapshot rather than waiting on the provider inside it.\n  preparedSignature = result.signature;\n  prepared = await prepareSemanticQuery(cfg, terms, { signal: opts.signal });\n  opts.signal?.throwIfAborted();\n  result = await store.transaction(() => searchSnapshot(store, cfg, terms, opts, prepared, preparedSignature));\n  opts.signal?.throwIfAborted();\n  if (needsSemanticPreparation(result)) throw new SenseError('INDEX_NOT_READY', 'the semantic search scope changed while its query was being prepared; retry the search against a stable published index');\n  return result;\n}\n\nasync function searchSnapshot(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions, prepared: PreparedSemanticQuery | undefined, preparedSignature: string | undefined): Promise<SearchResult[] | SemanticPreparationNeeded> {\n  const { signature, effective, allPaths, scopePaths, allowedPaths, semanticEligible } = await readSearchScope(store, cfg, terms, opts);\n  if (prepared !== undefined && signature !== preparedSignature) {\n    throw new SenseError('INDEX_NOT_READY', 'the index configuration changed while the semantic query was being prepared; retry after the current build finishes, or rebuild the index for this configuration');\n  }\n  if (semanticEligible && prepared === undefined) return { signature };\n\n  const { k, signals } = effective;\n  const fetch = Math.max(k * 3, 30);\n  const scopeActive = scopePaths.size < allPaths.length;\n  const semanticEnabled = semanticEligible && prepared !== undefined;\n\n  // --where applies inside the candidate query (a post-filter would drop matches ranked past\n  // the pool) and again on the final select, for link-derived rows.\n  const scope = effective.where;\n  const whereJoin = scope ? `JOIN frontmatter f ON f.\"path\" = content.path` : '';\n  const whereCond = scope ? `AND (${scope})` : '';\n  // Filtered before LIMIT, not after, or scoped notes ranking below the global top-`fetch`\n  // never reach the filter; joined against a temp table since real scopes exceed SQLITE_MAX_VARIABLE_NUMBER.\n  if (scopeActive) await materializeScope(store, '_search_scope', scopePaths);\n  const scopeCond = scopeActive ? `AND content.path IN (SELECT \"path\" FROM _search_scope)` : '';\n\n  const candidates: Candidates = new Map();\n  let matchRows: LexicalHit[] = [];\n  const hasEmptyPhrase = [...terms.matchAll(/\"([^\"]*)\"/g)].some((match) => !/[\\p{L}\\p{N}_]/u.test(match[1]));\n  const hasBareSyntaxOnly = /[()]/u.test(terms.replace(/\"[^\"]*\"/g, ' '));\n  // A query that is only whitespace or punctuation has no lexical rows; other declared signals\n  // compose normally. In particular, unspaced-script punctuation can rewrite to an empty MATCH.\n  if (signals.words !== undefined && terms.trim() !== '' && (/[\\p{L}\\p{N}_]/u.test(terms) || hasBareSyntaxOnly) && !hasEmptyPhrase) {\n    const syntaxError = bareTermSyntaxError(terms);\n    if (syntaxError) throw syntaxError;\n    try {\n      matchRows = await wordsCandidates(store, candidates, terms, whereJoin, whereCond, scopeCond, fetch, signals.words);\n    } catch (err) {\n      throw searchError(err as Error, terms, scope);\n    }\n  }\n  // Every store's lexical `snippets` is NULL; the snippet text is always computed below.\n  // Distinguish from via='link' rows, which never appear in matchRows.\n  const matchedPaths = new Set(matchRows.map((r) => r.path));\n\n  if (signals.links !== undefined) await linksCandidates(store, candidates, matchRows, allPaths, allowedPaths, fetch, signals.links);\n\n  let chunkLines = new Map<string, string>();\n  let chunkSimilarity = new Map<string, number>();\n  if (semanticEnabled && signals.vectors !== undefined && prepared !== undefined) {\n    ({ chunkLines, chunkSimilarity } = await vectorsCandidates(store, prepared, candidates, fetch, allowedPaths, allPaths.length, signals.vectors));\n  }\n\n  await store.exec('DROP TABLE IF EXISTS _search');\n  // DOUBLE, not REAL: sqlite's REAL is an 8-byte double but duckdb's is a 4-byte float, and the\n  // rounded score/similarity are printed at full precision in rows.\n  await store.exec('CREATE TEMP TABLE _search (\"path\" TEXT PRIMARY KEY, score DOUBLE, via TEXT, lines TEXT, similarity DOUBLE)');\n  if (candidates.size > 0) {\n    await store.runBatch(\n      'INSERT INTO _search (\"path\", score, via, lines, similarity) VALUES (?, ?, ?, ?, ?)',\n      [...candidates].map(([path, c]) => [path, c.score, c.via, chunkLines.get(path) ?? null, chunkSimilarity.get(path) ?? null])\n    );\n  }\n\n  // Reapplies --where even though _search is already scope+where filtered, since the join to\n  // frontmatter is already needed for the path column.\n  const where = scope ? `WHERE (${scope})` : '';\n  // lines: semantic rows carry their chunk's range, lexical rows gain one below,\n  // everything else stays null; similarity stays semantic-only.\n  const similarityCol = semanticEnabled ? ', _search.similarity' : '';\n  // NULL AS snippets holds this column's position (between summary and via) for every row;\n  // overwritten below, always to an array, never left null (DESIGN.md).\n  const selectStmt = await store.prepare(\n    `SELECT f.\"path\" AS path, content.title, content.summary, NULL AS snippets, _search.via, round(_search.score, 4) AS score, _search.lines${similarityCol}\n       FROM _search JOIN frontmatter f ON f.\"path\" = _search.\"path\" JOIN content ON content.path = _search.\"path\"\n       ${where} ORDER BY _search.score DESC, _search.\"path\" ASC LIMIT ?`\n  );\n  const rows = (await selectStmt.all(k)) as SearchResult[];\n  if (searchCandidatesRead.hasSubscribers) searchCandidatesRead.publish({ paths: rows.map((row) => row.path) });\n  for (const row of rows) row.snippets = [];\n\n  await hydrateSearchRows(store, cfg, rows, matchedPaths, terms, opts);\n\n  return rows;\n}\n"],"names":["channel","stemmer","embedConfig","featureEnabled","resolveSearch","ensureDocumentEmbeddings","prepareSemanticQuery","localModelMissing","MODEL_FILENAMES","SenseError","serialQuery","bareTermSyntaxError","searchError","foldForSearch","hasUnspacedRun","searchTokens","unspacedRuns","materializeScope","narrowByWhere","rawScope","scopeHasEmbeddings","linksCandidates","vectorsCandidates","wordsCandidates","assertQuerySnapshot","SNIPPET_CHAR_LIMIT_DEFAULT","SNIPPET_COUNT_LIMIT_DEFAULT","searchCandidatesRead","extractBareTerms","query","cleaned","replace","split","map","tok","flatMap","text","toLowerCase","trim","filter","length","wordSegmenter","findOccurrences","terms","occ","textLower","unspacedTerms","run","runLower","slice","start","end","term","idx","found","indexOf","push","spacedTerms","t","termByStem","Map","stemInitials","Set","Array","from","keys","match","segment","unspaced","folded","has","get","undefined","sort","a","b","wordBoundaries","Intl","Segmenter","granularity","bounds","index","snapForward","pos","lo","hi","mid","snapBackward","result","firstBoundAfter","cutWindow","anchor","charLimit","rawEnd","Math","min","fitEnd","render","floor","upperBound","firstOccAtOrAfter","renderWindow","win","out","cursor","i","o","prefix","suffix","scoreWindows","candidates","winEnd","seen","count","j","add","max","e","distinct","size","overlaps","selectWindows","countLimit","ranked","chosen","c","some","s","best","computeSnippets","find","snippets","offset","lineNumberAt","line","charCodeAt","lineRangeFor","store","path","stmt","prepare","row","start_line","end_line","validateSearchOptions","opts","name","value","k","snippetCharLimit","snippetCountLimit","Number","isFinite","isInteger","String","hydrateSearchRows","cfg","rows","matchedPaths","bareTerms","sourceStmt","source","lines","search","signal","aborted","Promise","reject","reason","searchIndexed","readSearchScope","signature","effective","allPaths","all","r","scopePaths","allowedPaths","where","err","wantsVectors","signals","vectors","semanticEligible","needsSemanticPreparation","isArray","initial","throwIfAborted","presetName","model","prepared","preparedSignature","preflight","transaction","searchSnapshot","fetch","scopeActive","semanticEnabled","scope","whereJoin","whereCond","scopeCond","matchRows","hasEmptyPhrase","matchAll","test","hasBareSyntaxOnly","words","syntaxError","links","chunkLines","chunkSimilarity","exec","runBatch","score","via","similarityCol","selectStmt","hasSubscribers","publish","paths"],"mappings":"AAAA,SAASA,OAAO,QAAQ,2BAA2B;AACnD,SAASC,OAAO,QAAQ,UAAU;AAElC,SAASC,WAAW,EAAEC,cAAc,EAAEC,aAAa,QAAQ,qBAAqB;AAEhF,SAASC,wBAAwB,EAAEC,oBAAoB,QAAQ,oBAAoB;AACnF,SAASC,iBAAiB,EAAEC,eAAe,QAAQ,oBAAoB;AACvE,SAASC,UAAU,QAAQ,eAAe;AAC1C,SAASC,WAAW,QAAQ,yBAAyB;AACrD,SAASC,mBAAmB,EAAEC,WAAW,QAAQ,4BAA4B;AAE7E,SAASC,aAAa,EAAEC,cAAc,EAAEC,YAAY,EAAEC,YAAY,QAAQ,qBAAqB;AAC/F,SAASC,gBAAgB,EAAEC,aAAa,EAAEC,QAAQ,EAAEC,kBAAkB,QAAQ,aAAa;AAE3F,SAASC,eAAe,EAAEC,iBAAiB,EAAEC,eAAe,QAAQ,eAAe;AACnF,SAASC,mBAAmB,QAAQ,gBAAgB;AAIpD,8FAA8F;AAC9F,mGAAmG;AACnG,OAAO,MAAMC,6BAA6B,GAAG;AAC7C,OAAO,MAAMC,8BAA8B,EAAE;AAE7C,MAAMC,uBAAuB3B,QAAQ;AAErC,yFAAyF;AACzF,oGAAoG;AACpG,SAAS4B,iBAAiBC,KAAa;IACrC,MAAMC,UAAUD,MACbE,OAAO,CAAC,MAAM,KACdA,OAAO,CAAC,UAAU,KAClBA,OAAO,CAAC,kCAAkC;IAC7C,OAAOD,QACJE,KAAK,CAAC,OACNC,GAAG,CAAC,CAACC,MAAQA,IAAIH,OAAO,CAAC,kBAAkB,KAAK,iCAAiC;KACjFI,OAAO,CAAC,CAACD,MAAQnB,aAAamB,KAAKD,GAAG,CAAC,CAAC,EAAEG,IAAI,EAAE,GAAKA,OACrDH,GAAG,CAAC,CAACC,MAAQA,IAAIG,WAAW,GAAGC,IAAI,IACnCC,MAAM,CAAC,CAACL,MAAQA,IAAIM,MAAM,GAAG;AAClC;AAEA,8FAA8F;AAC9F,8FAA8F;AAC9F,IAAIC;AAEJ,SAASC,gBAAgBN,IAAY,EAAEO,KAAe;IACpD,MAAMC,MAA2D,EAAE;IACnE,MAAMC,YAAYT,KAAKC,WAAW;IAElC,8FAA8F;IAC9F,wFAAwF;IACxF,MAAMS,gBAAgBH,MAAMJ,MAAM,CAACzB;IACnC,IAAIgC,cAAcN,MAAM,GAAG,GAAG;QAC5B,KAAK,MAAMO,OAAO/B,aAAaoB,MAAO;YACpC,MAAMY,WAAWH,UAAUI,KAAK,CAACF,IAAIG,KAAK,EAAEH,IAAII,GAAG;YACnD,KAAK,MAAMC,QAAQN,cAAe;gBAChC,IAAIO,MAAM;gBACV,OAAS;oBACP,MAAMC,QAAQN,SAASO,OAAO,CAACH,MAAMC;oBACrC,IAAIC,UAAU,CAAC,GAAG;oBAClBV,IAAIY,IAAI,CAAC;wBAAEN,OAAOH,IAAIG,KAAK,GAAGI;wBAAOH,KAAKJ,IAAIG,KAAK,GAAGI,QAAQF,KAAKZ,MAAM;wBAAEY;oBAAK;oBAChFC,MAAMC,QAAQF,KAAKZ,MAAM;gBAC3B;YACF;QACF;IACF;IAEA,6FAA6F;IAC7F,uGAAuG;IACvG,MAAMiB,cAAcd,MAAMJ,MAAM,CAAC,CAACmB,IAAM,CAAC5C,eAAe4C;IACxD,IAAID,YAAYjB,MAAM,GAAG,GAAG;QAC1B,MAAMmB,aAAa,IAAIC,IAAIH,YAAYxB,GAAG,CAAC,CAACyB,IAAM;gBAACzD,QAAQY,cAAc6C;gBAAKA;aAAE;QAChF,MAAMG,eAAe,IAAIC,IAAIC,MAAMC,IAAI,CAACL,WAAWM,IAAI,IAAI,CAACb,OAASA,IAAI,CAAC,EAAE;QAC5E,KAAK,MAAMc,SAASnD,aAAaqB,MAAO;YACtC,MAAM+B,UAAUD,MAAM9B,IAAI;YAC1B,IAAI8B,MAAME,QAAQ,EAAE;YACpB,MAAMC,SAASxD,cAAcsD;YAC7B,2FAA2F;YAC3F,IAAI,CAACN,aAAaS,GAAG,CAACD,MAAM,CAAC,EAAE,GAAG;YAClC,MAAMjB,OAAOO,WAAWY,GAAG,CAACtE,QAAQoE;YACpC,IAAIjB,SAASoB,WAAW5B,IAAIY,IAAI,CAAC;gBAAEN,OAAOgB,MAAMhB,KAAK;gBAAEC,KAAKe,MAAMf,GAAG;gBAAEC;YAAK;QAC9E;IACF;IAEA,OAAOR,IAAI6B,IAAI,CAAC,CAACC,GAAGC,IAAMD,EAAExB,KAAK,GAAGyB,EAAEzB,KAAK,IAAIyB,EAAExB,GAAG,GAAGuB,EAAEvB,GAAG;AAC9D;AAEA,6FAA6F;AAC7F,+FAA+F;AAC/F,gGAAgG;AAChG,SAASyB,eAAexC,IAAY;IAClCK,0BAAAA,2BAAAA,gBAAAA,gBAAkB,IAAIoC,KAAKC,SAAS,CAAC,MAAM;QAAEC,aAAa;IAAO;IACjE,MAAMC,SAAS;QAAC;KAAE;IAClB,KAAK,MAAM,EAAEC,KAAK,EAAEd,OAAO,EAAE,IAAI1B,cAAc0B,OAAO,CAAC/B,MAAO4C,OAAOxB,IAAI,CAACyB,QAAQd,QAAQ3B,MAAM;IAChG,OAAOwC;AACT;AAEA,0FAA0F;AAC1F,SAASE,YAAYF,MAAgB,EAAEG,GAAW;IAChD,IAAIC,KAAK;IACT,IAAIC,KAAKL,OAAOxC,MAAM,GAAG;IACzB,MAAO4C,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,MAAO;QACzB,IAAIL,MAAM,CAACM,IAAI,GAAGH,KAAKC,KAAKE,MAAM;aAC7BD,KAAKC;IACZ;IACA,OAAON,MAAM,CAACI,GAAG;AACnB;AAEA,SAASG,aAAaP,MAAgB,EAAEG,GAAW;IACjD,IAAIC,KAAK;IACT,IAAIC,KAAKL,OAAOxC,MAAM,GAAG;IACzB,IAAIgD,SAASR,MAAM,CAAC,EAAE;IACtB,MAAOI,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,KAAK,KAAM;QAC7B,IAAIL,MAAM,CAACM,IAAI,IAAIH,KAAK;YACtBC,KAAKE;YACLE,SAASR,MAAM,CAACM,IAAI;QACtB,OAAOD,KAAKC,MAAM;IACpB;IACA,OAAOE;AACT;AAEA,SAASC,gBAAgBT,MAAgB,EAAEG,GAAW;IACpD,IAAIC,KAAK;IACT,IAAIC,KAAKL,OAAOxC,MAAM;IACtB,MAAO4C,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,MAAO;QACzB,IAAIL,MAAM,CAACM,IAAI,IAAIH,KAAKC,KAAKE,MAAM;aAC9BD,KAAKC;IACZ;IACA,OAAON,MAAM,CAACI,GAAG;AACnB;AAEA,wFAAwF;AACxF,8FAA8F;AAC9F,8FAA8F;AAC9F,+FAA+F;AAC/F,mFAAmF;AACnF,SAASM,UAAUtD,IAAY,EAAE4C,MAAgB,EAAEW,MAAc,EAAEC,SAAiB;QAI1DH;IAHxB,MAAMI,SAASC,KAAKC,GAAG,CAAC3D,KAAKI,MAAM,EAAEmD,SAASC;IAC9C,MAAM1C,QAAQgC,YAAYF,QAAQW;IAClC,IAAIxC,MAAMoC,aAAaP,QAAQa;IAC/B,IAAI1C,OAAOD,OAAOC,OAAMsC,mBAAAA,gBAAgBT,QAAQ9B,oBAAxBuC,8BAAAA,mBAAkCrD,KAAKI,MAAM;IACrE,OAAO;QAAEU;QAAOC,KAAK2C,KAAKC,GAAG,CAAC5C,KAAKf,KAAKI,MAAM;IAAE;AAClD;AAEA,8FAA8F;AAC9F,0FAA0F;AAC1F,wFAAwF;AACxF,6FAA6F;AAC7F,+FAA+F;AAC/F,wDAAwD;AACxD,SAASwD,OAAOC,MAA+B,EAAEjB,MAAgB,EAAEkB,KAAa,EAAEC,UAAkB,EAAEP,SAAiB;IACrH,IAAIR,KAAK;IACT,IAAIC,KAAKL,OAAOxC,MAAM,GAAG;IACzB,MAAO4C,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,KAAK,KAAM;QAC7B,IAAIL,MAAM,CAACM,IAAI,IAAIa,YAAYf,KAAKE;aAC/BD,KAAKC,MAAM;IAClB;IACA,MAAOF,MAAM,KAAKJ,MAAM,CAACI,GAAG,GAAGc,OAAOd,KAAM;QAC1C,IAAIa,OAAOjB,MAAM,CAACI,GAAG,EAAE5C,MAAM,IAAIoD,WAAW,OAAOZ,MAAM,CAACI,GAAG;IAC/D;IACA,OAAOc;AACT;AAYA,6FAA6F;AAC7F,SAASE,kBAAkBxD,GAAwD,EAAEuC,GAAW;IAC9F,IAAIC,KAAK;IACT,IAAIC,KAAKzC,IAAIJ,MAAM;IACnB,MAAO4C,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,MAAO;QACzB,IAAIzC,GAAG,CAAC0C,IAAI,CAACpC,KAAK,GAAGiC,KAAKC,KAAKE,MAAM;aAChCD,KAAKC;IACZ;IACA,OAAOF;AACT;AAEA,SAASiB,aAAajE,IAAY,EAAEQ,GAAwD,EAAE0D,GAAS;IACrG,IAAIC,MAAM;IACV,IAAIC,SAASF,IAAIpD,KAAK;IACtB,IAAK,IAAIuD,IAAIL,kBAAkBxD,KAAK0D,IAAIpD,KAAK,GAAGuD,IAAI7D,IAAIJ,MAAM,IAAII,GAAG,CAAC6D,EAAE,CAACvD,KAAK,GAAGoD,IAAInD,GAAG,EAAEsD,IAAK;QAC7F,MAAMC,IAAI9D,GAAG,CAAC6D,EAAE;QAChB,IAAIC,EAAEvD,GAAG,GAAGmD,IAAInD,GAAG,EAAE;QACrB,sFAAsF;QACtF,gFAAgF;QAChF,IAAIuD,EAAExD,KAAK,GAAGsD,QAAQ;QACtBD,OAAO,GAAGnE,KAAKa,KAAK,CAACuD,QAAQE,EAAExD,KAAK,EAAE,CAAC,EAAEd,KAAKa,KAAK,CAACyD,EAAExD,KAAK,EAAEwD,EAAEvD,GAAG,EAAE,CAAC,CAAC;QACtEqD,SAASE,EAAEvD,GAAG;IAChB;IACAoD,OAAOnE,KAAKa,KAAK,CAACuD,QAAQF,IAAInD,GAAG;IACjC,MAAMwD,SAASL,IAAIpD,KAAK,GAAG,IAAI,MAAM;IACrC,MAAM0D,SAASN,IAAInD,GAAG,GAAGf,KAAKI,MAAM,GAAG,MAAM;IAC7C,OAAO,GAAGmE,SAASJ,IAAIxE,OAAO,CAAC,QAAQ,OAAO6E,QAAQ;AACxD;AAEA,8FAA8F;AAC9F,iGAAiG;AACjG,iGAAiG;AACjG,4FAA4F;AAC5F,6FAA6F;AAC7F,4CAA4C;AAC5C,SAASC,aAAajE,GAAwD,EAAEoC,MAAgB,EAAE5C,IAAY,EAAEwD,SAAiB;IAC/H,MAAMkB,aAA8B,EAAE;IACtC,IAAK,IAAIL,IAAI,GAAGA,IAAI7D,IAAIJ,MAAM,EAAEiE,IAAK;QACnC,MAAMM,SAASnE,GAAG,CAAC6D,EAAE,CAACvD,KAAK,GAAG0C;QAC9B,MAAMoB,OAAO,IAAIlD;QACjB,IAAImD,QAAQ;QACZ,IAAK,IAAIC,IAAIT,GAAGS,IAAItE,IAAIJ,MAAM,IAAII,GAAG,CAACsE,EAAE,CAAChE,KAAK,GAAG6D,QAAQG,IAAK;YAC5DF,KAAKG,GAAG,CAACvE,GAAG,CAACsE,EAAE,CAAC9D,IAAI;YACpB6D;QACF;QACA,MAAM/D,QAAQgC,YAAYF,QAAQpC,GAAG,CAAC6D,EAAE,CAACvD,KAAK;QAC9C,MAAMgD,QAAQJ,KAAKsB,GAAG,CAAClE,OAAON,GAAG,CAAC6D,EAAE,CAACtD,GAAG;QACxC,MAAMgD,aAAaL,KAAKsB,GAAG,CAAClB,OAAOR,UAAUtD,MAAM4C,QAAQpC,GAAG,CAAC6D,EAAE,CAACvD,KAAK,EAAE0C,WAAWzC,GAAG;QACvF,MAAMA,MAAM6C,OAAO,CAACqB,IAAMhB,aAAajE,MAAMQ,KAAK;gBAAEM;gBAAOC,KAAKkE;YAAE,IAAIrC,QAAQkB,OAAOC,YAAYP;QACjGkB,WAAWtD,IAAI,CAAC;YAAEN;YAAOC;YAAKmE,UAAUN,KAAKO,IAAI;YAAEN;QAAM;IAC3D;IACA,OAAOH;AACT;AAEA,SAASU,SAAS9C,CAAO,EAAEC,CAAO;IAChC,OAAOD,EAAExB,KAAK,GAAGyB,EAAExB,GAAG,IAAIwB,EAAEzB,KAAK,GAAGwB,EAAEvB,GAAG;AAC3C;AAEA,4FAA4F;AAC5F,gGAAgG;AAChG,mFAAmF;AACnF,SAASsE,cAAcX,UAA2B,EAAEY,UAAkB;IACpE,MAAMC,SAASb,WAAW7D,KAAK,GAAGwB,IAAI,CAAC,CAACC,GAAGC,IAAMA,EAAE2C,QAAQ,GAAG5C,EAAE4C,QAAQ,IAAI3C,EAAEsC,KAAK,GAAGvC,EAAEuC,KAAK;IAC7F,MAAMW,SAA0B,EAAE;IAClC,KAAK,MAAMC,KAAKF,OAAQ;QACtB,IAAIC,OAAOpF,MAAM,IAAIkF,YAAY;QACjC,IAAIE,OAAOE,IAAI,CAAC,CAACC,IAAMP,SAASO,GAAGF,KAAK;QACxCD,OAAOpE,IAAI,CAACqE;IACd;IACAD,OAAOnD,IAAI,CAAC,CAACC,GAAGC,IAAMD,EAAExB,KAAK,GAAGyB,EAAEzB,KAAK;IACvC,OAAO;QAAE0E;QAAQI,MAAML,MAAM,CAAC,EAAE;IAAC;AACnC;AAEA,0FAA0F;AAC1F,OAAO,SAASM,gBAAgB7F,IAAY,EAAEO,KAAe,EAAEiD,SAAiB,EAAE8B,UAAkB;IAClG,MAAM9E,MAAMF,gBAAgBN,MAAMO;IAClC,MAAMqC,SAASJ,eAAexC;IAC9B,IAAIQ,IAAIJ,MAAM,KAAK,GAAG;YAINwC;QAHd,uFAAuF;QACvF,0CAA0C;QAC1C,MAAMiB,SAAS,CAAC9C,MAAwB,GAAGf,KAAKa,KAAK,CAAC,GAAGE,KAAKpB,OAAO,CAAC,QAAQ,KAAKO,IAAI,KAAKa,MAAMf,KAAKI,MAAM,GAAG,MAAM,IAAI;QAC1H,MAAM0D,SAAQlB,eAAAA,OAAOkD,IAAI,CAAC,CAACvD,IAAMA,IAAI,gBAAvBK,0BAAAA,eAA6B5C,KAAKI,MAAM;QACtD,MAAM2D,aAAaL,KAAKsB,GAAG,CAAClB,OAAOR,UAAUtD,MAAM4C,QAAQ,GAAGY,WAAWzC,GAAG;QAC5E,MAAMA,MAAM6C,OAAOC,QAAQjB,QAAQkB,OAAOC,YAAYP;QACtD,OAAO;YAAEuC,UAAU;gBAAClC,OAAO9C;aAAK;YAAEiF,QAAQ;QAAE;IAC9C;IACA,MAAMtB,aAAaD,aAAajE,KAAKoC,QAAQ5C,MAAMwD;IACnD,MAAM,EAAEgC,MAAM,EAAEI,IAAI,EAAE,GAAGP,cAAcX,YAAYY;IACnD,OAAO;QAAES,UAAUP,OAAO3F,GAAG,CAAC,CAACqE,MAAQD,aAAajE,MAAMQ,KAAK0D;QAAO8B,QAAQJ,KAAK9E,KAAK;IAAC;AAC3F;AAEA,wEAAwE;AACxE,OAAO,SAASmF,aAAajG,IAAY,EAAEgG,MAAc;IACvD,IAAIE,OAAO;IACX,IAAK,IAAI7B,IAAI,GAAGA,IAAI2B,QAAQ3B,IAAK,IAAIrE,KAAKmG,UAAU,CAAC9B,OAAO,IAAI6B;IAChE,OAAOA;AACT;AAEA,eAAeE,aAAaC,KAAY,EAAEC,IAAY,EAAEJ,IAAY;IAClE,MAAMK,OAAO,MAAMF,MAAMG,OAAO,CAAC;IACjC,MAAMC,MAAO,MAAMF,KAAKpE,GAAG,CAACmE,MAAMJ,MAAMA;IACxC,OAAOO,MAAM,CAAC,CAAC,EAAEA,IAAIC,UAAU,CAAC,CAAC,EAAED,IAAIE,QAAQ,EAAE,GAAG;AACtD;AAiCA,SAASC,sBAAsBC,IAAmB;IAChD,KAAK,MAAM,CAACC,MAAMC,MAAM,IAAI;QAC1B;YAAC;YAAKF,KAAKG,CAAC;SAAC;QACb;YAAC;YAAoBH,KAAKI,gBAAgB;SAAC;QAC3C;YAAC;YAAqBJ,KAAKK,iBAAiB;SAAC;KAC9C,CAAW;QACV,IAAIH,UAAU3E,aAAc,CAAA,CAAC+E,OAAOC,QAAQ,CAACL,UAAU,CAACI,OAAOE,SAAS,CAACN,UAAUA,SAAS,CAAA,GAAI;YAC9F,MAAM,IAAI1I,WAAW,yBAAyB,CAAC,eAAe,EAAEyI,KAAK,yCAAyC,EAAEQ,OAAOP,QAAQ;QACjI;IACF;AACF;AAEA,8FAA8F;AAC9F,OAAO,eAAeQ,kBAAkBlB,KAAY,EAAEmB,GAAmB,EAAEC,IAA0B,EAAEC,YAAyB,EAAEnH,KAAa,EAAEsG,OAAsE,CAAC,CAAC;QAGrMA,wBACCA;IAHnB,IAAIa,aAAavC,IAAI,KAAK,GAAG;IAC7B,MAAMwC,YAAYnI,iBAAiBe;IACnC,MAAMiD,aAAYqD,yBAAAA,KAAKI,gBAAgB,cAArBJ,oCAAAA,yBAAyBxH;IAC3C,MAAMiG,cAAauB,0BAAAA,KAAKK,iBAAiB,cAAtBL,qCAAAA,0BAA0BvH;IAC7C,MAAMsI,aAAa,MAAMvB,MAAMG,OAAO,CAAC;IACvC,KAAK,MAAMC,OAAOgB,KAAM;QACtB,IAAI,CAACC,aAAaxF,GAAG,CAACuE,IAAIH,IAAI,GAAG;QACjC,MAAMuB,SAAU,MAAMD,WAAWzF,GAAG,CAACsE,IAAIH,IAAI;QAC7C,IAAI,CAACuB,QAAQ,MAAM,IAAIxJ,WAAW,mBAAmB,CAAC,mCAAmC,EAAEiJ,OAAOb,IAAIH,IAAI,EAAE,yFAAyF,CAAC;QACtM,MAAMtG,OAAO6H,OAAO7H,IAAI;QACxB,MAAM,EAAE+F,QAAQ,EAAEC,MAAM,EAAE,GAAGH,gBAAgB7F,MAAM2H,WAAWnE,WAAW8B;QACzEmB,IAAIV,QAAQ,GAAGA;QACf,IAAIU,IAAIqB,KAAK,IAAI,MAAMrB,IAAIqB,KAAK,GAAG/J,eAAeyJ,KAAK,cAAc,MAAMpB,aAAaC,OAAOI,IAAIH,IAAI,EAAEL,aAAajG,MAAMgG,WAAW;IACzI;AACF;AAEA;;;CAGC,GACD,OAAO,SAAS+B,OAAO1B,KAAY,EAAEmB,GAAmB,EAAEjH,KAAa,EAAEsG,OAAsB,CAAC,CAAC;QAC3FA;IAAJ,KAAIA,eAAAA,KAAKmB,MAAM,cAAXnB,mCAAAA,aAAaoB,OAAO,EAAE,OAAOC,QAAQC,MAAM,CAACtB,KAAKmB,MAAM,CAACI,MAAM;IAClE,OAAO9J,YAAY+H,OAAO,IAAMgC,cAAchC,OAAOmB,KAAKjH,OAAOsG;AACnE;AAWA,eAAeyB,gBAAgBjC,KAAY,EAAEmB,GAAmB,EAAEjH,KAAa,EAAEsG,IAAmB;IAClG,MAAM0B,YAAY,MAAMnJ,oBAAoBiH,OAAOmB;IACnD,MAAMgB,YAAYxK,cAAcwJ,KAAKX;IACrC,MAAM4B,WAAW,AAAE,CAAA,MAAM,AAAC,CAAA,MAAMpC,MAAMG,OAAO,CAAC,iCAAgC,EAAGkC,GAAG,EAAC,EAA+B7I,GAAG,CAAC,CAAC8I,IAAMA,EAAErC,IAAI;IACrI,MAAMsC,aAAa,MAAM7J,SAASsH,OAAOmB,KAAKX,MAAM4B;IACpD,IAAII;IACJ,IAAI;QACFA,eAAe,MAAM/J,cAAcuH,OAAOuC,YAAYJ,UAAUM,KAAK;IACvE,EAAE,OAAOC,KAAK;QACZ,MAAMvK,YAAYuK,KAAcxI,OAAOiI,UAAUM,KAAK;IACxD;IACA,MAAME,eAAeR,UAAUS,OAAO,CAACC,OAAO,KAAK9G;IACnD,IAAI4G,cAAc,MAAM/K,yBAAyBoI,OAAOmB,KAAKqB;IAC7D,MAAMM,mBAAmBH,gBAAiB,MAAMhK,mBAAmBqH,OAAOmB,KAAKqB;IAC/E,OAAO;QAAEN;QAAWC;QAAWC;QAAUG;QAAYC;QAAcM;IAAiB;AACtF;AAMA,SAASC,yBAAyBhG,MAAkD;IAClF,OAAO,CAACzB,MAAM0H,OAAO,CAACjG;AACxB;AAEA,eAAeiF,cAAchC,KAAY,EAAEmB,GAAmB,EAAEjH,KAAa,EAAEsG,IAAmB;QAGhGA,cAyBAA,eAEAA,eAOAA,eAEAA;IAtCAD,sBAAsBC;IACtB,MAAMyC,UAAUtL,cAAcwJ,KAAKX;KACnCA,eAAAA,KAAKmB,MAAM,cAAXnB,mCAAAA,aAAa0C,cAAc;IAC3B,oFAAoF;IACpF,0FAA0F;IAC1F,MAAMP,eAAeM,QAAQL,OAAO,CAACC,OAAO,KAAK9G;IACjD,IAAI4G,cAAc;QAChB,MAAM/D,IAAInH,YAAY0J,MAAM,oEAAoE;QAChG,IAAIrJ,kBAAkB8G,IAAI;YACxB,MAAM,IAAI5G,WAAW,uBAAuB,CAAC,QAAQ,EAAEiL,QAAQE,UAAU,CAAC,mDAAmD,EAAEvE,EAAEwE,KAAK,CAAC,aAAa,EAAErL,gBAAgB,uHAAuH,CAAC;QAChS;IACF;IAEA,IAAIsL;IACJ,IAAIC;IACJ,IAAIX,cAAc;YAIhBnC;QAHA,6FAA6F;QAC7F,oFAAoF;QACpF,MAAM+C,YAAY,MAAMvD,MAAMwD,WAAW,CAAC,IAAMvB,gBAAgBjC,OAAOmB,KAAKjH,OAAOsG;SACnFA,gBAAAA,KAAKmB,MAAM,cAAXnB,oCAAAA,cAAa0C,cAAc;QAC3B,IAAIK,UAAUT,gBAAgB,EAAE;gBAG9BtC;YAFA8C,oBAAoBC,UAAUrB,SAAS;YACvCmB,WAAW,MAAMxL,qBAAqBsJ,KAAKjH,OAAO;gBAAEyH,QAAQnB,KAAKmB,MAAM;YAAC;aACxEnB,gBAAAA,KAAKmB,MAAM,cAAXnB,oCAAAA,cAAa0C,cAAc;QAC7B;IACF;KAEA1C,gBAAAA,KAAKmB,MAAM,cAAXnB,oCAAAA,cAAa0C,cAAc;IAC3B,IAAInG,SAAS,MAAMiD,MAAMwD,WAAW,CAAC,IAAMC,eAAezD,OAAOmB,KAAKjH,OAAOsG,MAAM6C,UAAUC;KAC7F9C,gBAAAA,KAAKmB,MAAM,cAAXnB,oCAAAA,cAAa0C,cAAc;IAC3B,IAAI,CAACH,yBAAyBhG,SAAS,OAAOA;IAE9C,6FAA6F;IAC7F,gGAAgG;IAChGuG,oBAAoBvG,OAAOmF,SAAS;IACpCmB,WAAW,MAAMxL,qBAAqBsJ,KAAKjH,OAAO;QAAEyH,QAAQnB,KAAKmB,MAAM;IAAC;KACxEnB,gBAAAA,KAAKmB,MAAM,cAAXnB,oCAAAA,cAAa0C,cAAc;IAC3BnG,SAAS,MAAMiD,MAAMwD,WAAW,CAAC,IAAMC,eAAezD,OAAOmB,KAAKjH,OAAOsG,MAAM6C,UAAUC;KACzF9C,gBAAAA,KAAKmB,MAAM,cAAXnB,oCAAAA,cAAa0C,cAAc;IAC3B,IAAIH,yBAAyBhG,SAAS,MAAM,IAAI/E,WAAW,mBAAmB;IAC9E,OAAO+E;AACT;AAEA,eAAe0G,eAAezD,KAAY,EAAEmB,GAAmB,EAAEjH,KAAa,EAAEsG,IAAmB,EAAE6C,QAA2C,EAAEC,iBAAqC;IACrL,MAAM,EAAEpB,SAAS,EAAEC,SAAS,EAAEC,QAAQ,EAAEG,UAAU,EAAEC,YAAY,EAAEM,gBAAgB,EAAE,GAAG,MAAMb,gBAAgBjC,OAAOmB,KAAKjH,OAAOsG;IAChI,IAAI6C,aAAatH,aAAamG,cAAcoB,mBAAmB;QAC7D,MAAM,IAAItL,WAAW,mBAAmB;IAC1C;IACA,IAAI8K,oBAAoBO,aAAatH,WAAW,OAAO;QAAEmG;IAAU;IAEnE,MAAM,EAAEvB,CAAC,EAAEiC,OAAO,EAAE,GAAGT;IACvB,MAAMuB,QAAQrG,KAAKsB,GAAG,CAACgC,IAAI,GAAG;IAC9B,MAAMgD,cAAcpB,WAAWzD,IAAI,GAAGsD,SAASrI,MAAM;IACrD,MAAM6J,kBAAkBd,oBAAoBO,aAAatH;IAEzD,2FAA2F;IAC3F,kEAAkE;IAClE,MAAM8H,QAAQ1B,UAAUM,KAAK;IAC7B,MAAMqB,YAAYD,QAAQ,CAAC,6CAA6C,CAAC,GAAG;IAC5E,MAAME,YAAYF,QAAQ,CAAC,KAAK,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC7C,yFAAyF;IACzF,2GAA2G;IAC3G,IAAIF,aAAa,MAAMnL,iBAAiBwH,OAAO,iBAAiBuC;IAChE,MAAMyB,YAAYL,cAAc,CAAC,sDAAsD,CAAC,GAAG;IAE3F,MAAMtF,aAAyB,IAAIlD;IACnC,IAAI8I,YAA0B,EAAE;IAChC,MAAMC,iBAAiB;WAAIhK,MAAMiK,QAAQ,CAAC;KAAc,CAAC9E,IAAI,CAAC,CAAC5D,QAAU,CAAC,iBAAiB2I,IAAI,CAAC3I,KAAK,CAAC,EAAE;IACxG,MAAM4I,oBAAoB,QAAQD,IAAI,CAAClK,MAAMZ,OAAO,CAAC,YAAY;IACjE,6FAA6F;IAC7F,8FAA8F;IAC9F,IAAIsJ,QAAQ0B,KAAK,KAAKvI,aAAa7B,MAAML,IAAI,OAAO,MAAO,CAAA,iBAAiBuK,IAAI,CAAClK,UAAUmK,iBAAgB,KAAM,CAACH,gBAAgB;QAChI,MAAMK,cAAcrM,oBAAoBgC;QACxC,IAAIqK,aAAa,MAAMA;QACvB,IAAI;YACFN,YAAY,MAAMnL,gBAAgBkH,OAAO3B,YAAYnE,OAAO4J,WAAWC,WAAWC,WAAWN,OAAOd,QAAQ0B,KAAK;QACnH,EAAE,OAAO5B,KAAK;YACZ,MAAMvK,YAAYuK,KAAcxI,OAAO2J;QACzC;IACF;IACA,uFAAuF;IACvF,qEAAqE;IACrE,MAAMxC,eAAe,IAAIhG,IAAI4I,UAAUzK,GAAG,CAAC,CAAC8I,IAAMA,EAAErC,IAAI;IAExD,IAAI2C,QAAQ4B,KAAK,KAAKzI,WAAW,MAAMnD,gBAAgBoH,OAAO3B,YAAY4F,WAAW7B,UAAUI,cAAckB,OAAOd,QAAQ4B,KAAK;IAEjI,IAAIC,aAAa,IAAItJ;IACrB,IAAIuJ,kBAAkB,IAAIvJ;IAC1B,IAAIyI,mBAAmBhB,QAAQC,OAAO,KAAK9G,aAAasH,aAAatH,WAAW;QAC7E,CAAA,EAAE0I,UAAU,EAAEC,eAAe,EAAE,GAAG,MAAM7L,kBAAkBmH,OAAOqD,UAAUhF,YAAYqF,OAAOlB,cAAcJ,SAASrI,MAAM,EAAE6I,QAAQC,OAAO,CAAA;IAC/I;IAEA,MAAM7C,MAAM2E,IAAI,CAAC;IACjB,8FAA8F;IAC9F,kEAAkE;IAClE,MAAM3E,MAAM2E,IAAI,CAAC;IACjB,IAAItG,WAAWS,IAAI,GAAG,GAAG;QACvB,MAAMkB,MAAM4E,QAAQ,CAClB,sFACA;eAAIvG;SAAW,CAAC7E,GAAG,CAAC,CAAC,CAACyG,MAAMb,EAAE;gBAA4BqF,iBAA8BC;mBAArD;gBAACzE;gBAAMb,EAAEyF,KAAK;gBAAEzF,EAAE0F,GAAG;iBAAEL,kBAAAA,WAAW3I,GAAG,CAACmE,mBAAfwE,6BAAAA,kBAAwB;iBAAMC,uBAAAA,gBAAgB5I,GAAG,CAACmE,mBAApByE,kCAAAA,uBAA6B;aAAK;;IAE9H;IAEA,2FAA2F;IAC3F,qDAAqD;IACrD,MAAMjC,QAAQoB,QAAQ,CAAC,OAAO,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC3C,+EAA+E;IAC/E,8DAA8D;IAC9D,MAAMkB,gBAAgBnB,kBAAkB,yBAAyB;IACjE,yFAAyF;IACzF,sEAAsE;IACtE,MAAMoB,aAAa,MAAMhF,MAAMG,OAAO,CACpC,CAAC,uIAAuI,EAAE4E,cAAc;;OAErJ,EAAEtC,MAAM,wDAAwD,CAAC;IAEtE,MAAMrB,OAAQ,MAAM4D,WAAW3C,GAAG,CAAC1B;IACnC,IAAIzH,qBAAqB+L,cAAc,EAAE/L,qBAAqBgM,OAAO,CAAC;QAAEC,OAAO/D,KAAK5H,GAAG,CAAC,CAAC4G,MAAQA,IAAIH,IAAI;IAAE;IAC3G,KAAK,MAAMG,OAAOgB,KAAMhB,IAAIV,QAAQ,GAAG,EAAE;IAEzC,MAAMwB,kBAAkBlB,OAAOmB,KAAKC,MAAMC,cAAcnH,OAAOsG;IAE/D,OAAOY;AACT"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands/search.ts"],"sourcesContent":["import { channel } from 'node:diagnostics_channel';\nimport { stemmer } from 'stemmer';\nimport type { EffectiveSearch, ResolvedConfig } from '../config/index.ts';\nimport { embedConfig, featureEnabled, resolveSearch } from '../config/index.ts';\nimport type { PreparedSemanticQuery } from '../embed/query.ts';\nimport { ensureDocumentEmbeddings, prepareSemanticQuery } from '../embed/query.ts';\nimport { localModelMissing, MODEL_FILENAMES } from '../embed/store.ts';\nimport { SenseError } from '../errors.ts';\nimport { serialQuery } from '../lib/serial-query.ts';\nimport { bareTermSyntaxError, searchError } from '../output/search-error.ts';\nimport type { LexicalHit, Store } from '../store/types.ts';\nimport { foldForSearch, hasUnspacedRun, searchTokens, unspacedRuns } from '../text/segment.ts';\nimport { materializeScope, narrowByWhere, rawScope, scopeHasEmbeddings } from './scope.ts';\nimport type { Candidates, SearchResultVia, SearchSignalContribution } from './signals.ts';\nimport { linksCandidates, vectorsCandidates, wordsCandidates } from './signals.ts';\nimport { assertQuerySnapshot } from './snapshot.ts';\n\nexport type { SearchResultVia, SearchSignalContribution } from './signals.ts';\n\n// Default budget behind --snippet-char-limit/--snippet-count-limit: the limit is whatever the\n// caller passes, these only say what happens when they pass nothing (DESIGN.md \"Search snippets\").\nexport const SNIPPET_CHAR_LIMIT_DEFAULT = 80;\nexport const SNIPPET_COUNT_LIMIT_DEFAULT = 1;\n\nconst searchCandidatesRead = channel('sensemaking.search.candidates-read');\n\n// Bare terms from an FTS5 query string: strips operators/quoting, not real terms, so the\n// snippet scan matches what the query matched -- FTS5 operators are uppercase-only, so this is too.\nfunction extractBareTerms(query: string): string[] {\n  const cleaned = query\n    .replace(/\"/g, ' ')\n    .replace(/[()*]/g, ' ')\n    .replace(/\\b(AND|OR|NOT|NEAR)\\b(\\/\\d+)?/g, ' ');\n  return cleaned\n    .split(/\\s+/)\n    .map((tok) => tok.replace(/^[A-Za-z_]\\w*:/, '')) // column filter, e.g. title:term\n    .flatMap((tok) => searchTokens(tok).map(({ text }) => text))\n    .map((tok) => tok.toLowerCase().trim())\n    .filter((tok) => tok.length > 0);\n}\n\n// House convention (src/chunk/group.ts): Intl.Segmenter word boundaries, not a bare \\b, which\n// is ASCII-only. Built on first use: construction is a few ms, paid only when a term matches.\nlet wordSegmenter: Intl.Segmenter | undefined;\n\nfunction findOccurrences(text: string, terms: string[]): Array<{ start: number; end: number; term: string }> {\n  const occ: Array<{ start: number; end: number; term: string }> = [];\n  const textLower = text.toLowerCase();\n\n  // Unspaced scripts (UNSPACED_SCRIPTS) mark no word boundaries: the sense-setup skill promises\n  // substring semantics there, so a matching term is found wherever it occurs in the run.\n  const unspacedTerms = terms.filter(hasUnspacedRun);\n  if (unspacedTerms.length > 0) {\n    for (const run of unspacedRuns(text)) {\n      const runLower = textLower.slice(run.start, run.end);\n      for (const term of unspacedTerms) {\n        let idx = 0;\n        for (;;) {\n          const found = runLower.indexOf(term, idx);\n          if (found === -1) break;\n          occ.push({ start: run.start + found, end: run.start + found + term.length, term });\n          idx = found + term.length;\n        }\n      }\n    }\n  }\n\n  // Spaced scripts: a word is marked when its porter stem equals a query term's stem, the same\n  // algorithm both indexes tokenize with (sqlite's TOKENIZE = 'porter unicode61'; duckdb's fts default).\n  const spacedTerms = terms.filter((t) => !hasUnspacedRun(t));\n  if (spacedTerms.length > 0) {\n    const termByStem = new Map(spacedTerms.map((t) => [stemmer(foldForSearch(t)), t]));\n    const stemInitials = new Set(Array.from(termByStem.keys(), (term) => term[0]));\n    for (const match of searchTokens(text)) {\n      const segment = match.text;\n      if (match.unspaced) continue;\n      const folded = foldForSearch(segment);\n      // Porter stemming changes suffixes only, so a different initial cannot match a query stem.\n      if (!stemInitials.has(folded[0])) continue;\n      const term = termByStem.get(stemmer(folded));\n      if (term !== undefined) occ.push({ start: match.start, end: match.end, term });\n    }\n  }\n\n  return occ.sort((a, b) => a.start - b.start || b.end - a.end);\n}\n\n// Segment boundaries of the whole text, word granularity: the only cut points a snippet edge\n// may land on. One rule for every script (DESIGN.md \"Cutting\") -- a regex \\b is ASCII-only and\n// would mis-cut Japanese, Chinese and Thai, which Intl.Segmenter divides by dictionary instead.\nfunction wordBoundaries(text: string): number[] {\n  wordSegmenter ??= new Intl.Segmenter('en', { granularity: 'word' });\n  const bounds = [0];\n  for (const { index, segment } of wordSegmenter.segment(text)) bounds.push(index + segment.length);\n  return bounds;\n}\n\n// bounds is sorted: snaps are binary searches, since each runs once per candidate window.\nfunction snapForward(bounds: number[], pos: number): number {\n  let lo = 0;\n  let hi = bounds.length - 1;\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1;\n    if (bounds[mid] < pos) lo = mid + 1;\n    else hi = mid;\n  }\n  return bounds[lo];\n}\n\nfunction snapBackward(bounds: number[], pos: number): number {\n  let lo = 0;\n  let hi = bounds.length - 1;\n  let result = bounds[0];\n  while (lo < hi) {\n    const mid = (lo + hi + 1) >> 1;\n    if (bounds[mid] <= pos) {\n      lo = mid;\n      result = bounds[mid];\n    } else hi = mid - 1;\n  }\n  return result;\n}\n\nfunction firstBoundAfter(bounds: number[], pos: number): number | undefined {\n  let lo = 0;\n  let hi = bounds.length;\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1;\n    if (bounds[mid] <= pos) lo = mid + 1;\n    else hi = mid;\n  }\n  return bounds[lo];\n}\n\n// A raw, unmarked upper bound: [start, end) inside [anchor, anchor+charLimit), edges on\n// boundaries. Markup (guillemets, ellipses) added on top of this can push the rendered result\n// past charLimit, which is what fitEnd() below corrects for; this is only the starting guess.\n// A single segment spanning the whole target window (a word longer than the char limit) is the\n// one case where holding the boundary rule means the budget is not a hard ceiling.\nfunction cutWindow(text: string, bounds: number[], anchor: number, charLimit: number): { start: number; end: number } {\n  const rawEnd = Math.min(text.length, anchor + charLimit);\n  const start = snapForward(bounds, anchor);\n  let end = snapBackward(bounds, rawEnd);\n  if (end <= start) end = firstBoundAfter(bounds, start) ?? text.length;\n  return { start, end: Math.min(end, text.length) };\n}\n\n// The largest boundary <= upperBound, > floor, whose rendered [*, end) fits charLimit. Markup\n// only ever adds characters as end grows, so rendered length is non-decreasing in end and\n// shrinking from upperBound is guaranteed to find the true fit rather than guess at it.\n// `floor` is the one end this never shrinks past (the anchor's own marked word, or the first\n// word in the unmarked fallback): DESIGN.md's budget is a ceiling except here, where returning\n// nothing is worse than a single word that overruns it.\nfunction fitEnd(render: (end: number) => string, bounds: number[], floor: number, upperBound: number, charLimit: number): number {\n  let lo = 0;\n  let hi = bounds.length - 1;\n  while (lo < hi) {\n    const mid = (lo + hi + 1) >> 1;\n    if (bounds[mid] <= upperBound) lo = mid;\n    else hi = mid - 1;\n  }\n  for (; lo >= 0 && bounds[lo] > floor; lo--) {\n    if (render(bounds[lo]).length <= charLimit) return bounds[lo];\n  }\n  return floor;\n}\n\ninterface Span {\n  start: number;\n  end: number;\n}\n\ninterface SnippetWindow extends Span {\n  distinct: number;\n  count: number;\n}\n\n// occ is start-sorted: a window's first candidate occurrence is a binary search, not a walk.\nfunction firstOccAtOrAfter(occ: Array<{ start: number; end: number; term: string }>, pos: number): number {\n  let lo = 0;\n  let hi = occ.length;\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1;\n    if (occ[mid].start < pos) lo = mid + 1;\n    else hi = mid;\n  }\n  return lo;\n}\n\nfunction renderWindow(text: string, occ: Array<{ start: number; end: number; term: string }>, win: Span): string {\n  let out = '';\n  let cursor = win.start;\n  for (let i = firstOccAtOrAfter(occ, win.start); i < occ.length && occ[i].start < win.end; i++) {\n    const o = occ[i];\n    if (o.end > win.end) continue;\n    // Occurrences of duplicate or substring-overlapping terms (\"test tests\") can overlap;\n    // emitting each would duplicate document text. Keep the first, absorb the rest.\n    if (o.start < cursor) continue;\n    out += `${text.slice(cursor, o.start)}«${text.slice(o.start, o.end)}»`;\n    cursor = o.end;\n  }\n  out += text.slice(cursor, win.end);\n  const prefix = win.start > 0 ? '…' : '';\n  const suffix = win.end < text.length ? '…' : '';\n  return `${prefix}${out.replace(/\\s+/g, ' ')}${suffix}`;\n}\n\n// Scores every occurrence-anchored candidate window: most distinct terms wins, ties broken by\n// most total hits -- coverage now that occurrences are real words, not the false-fragment counts\n// a substring scan produced. Selection itself is unevaluated (DESIGN.md \"Selection, unsettled\").\n// The window's `end` is fitted to the *rendered* text, markup included, not the raw span: a\n// window dense with marks (every guillemet pair adds two characters) shrinks to fit the same\n// budget a sparse one fills almost exactly.\nfunction scoreWindows(occ: Array<{ start: number; end: number; term: string }>, bounds: number[], text: string, charLimit: number): SnippetWindow[] {\n  const candidates: SnippetWindow[] = [];\n  for (let i = 0; i < occ.length; i++) {\n    const winEnd = occ[i].start + charLimit;\n    const seen = new Set<string>();\n    let count = 0;\n    for (let j = i; j < occ.length && occ[j].start < winEnd; j++) {\n      seen.add(occ[j].term);\n      count++;\n    }\n    const start = snapForward(bounds, occ[i].start);\n    const floor = Math.max(start, occ[i].end);\n    const upperBound = Math.max(floor, cutWindow(text, bounds, occ[i].start, charLimit).end);\n    const end = fitEnd((e) => renderWindow(text, occ, { start, end: e }), bounds, floor, upperBound, charLimit);\n    candidates.push({ start, end, distinct: seen.size, count });\n  }\n  return candidates;\n}\n\nfunction overlaps(a: Span, b: Span): boolean {\n  return a.start < b.end && b.start < a.end;\n}\n\n// Same scoring function as a single snippet, kept rather than discarded (DESIGN.md \"Several\n// snippets per note\"): rank by score, take the top non-overlapping windows, then reorder to the\n// note's own order, since several passages from one note read as an abridged note.\nfunction selectWindows(candidates: SnippetWindow[], countLimit: number): { chosen: SnippetWindow[]; best: SnippetWindow } {\n  const ranked = candidates.slice().sort((a, b) => b.distinct - a.distinct || b.count - a.count);\n  const chosen: SnippetWindow[] = [];\n  for (const c of ranked) {\n    if (chosen.length >= countLimit) break;\n    if (chosen.some((s) => overlaps(s, c))) continue;\n    chosen.push(c);\n  }\n  chosen.sort((a, b) => a.start - b.start);\n  return { chosen, best: ranked[0] };\n}\n\n// Builds bounded marked passages and returns the best window's offset for section lookup.\nexport function computeSnippets(text: string, terms: string[], charLimit: number, countLimit: number): { snippets: string[]; offset: number } {\n  const occ = findOccurrences(text, terms);\n  const bounds = wordBoundaries(text);\n  if (occ.length === 0) {\n    // A term matched only via title/summary, not this body text, finds no occurrence here;\n    // fall back to the doc's start, unmarked.\n    const render = (end: number): string => `${text.slice(0, end).replace(/\\s+/g, ' ').trim()}${end < text.length ? '…' : ''}`;\n    const floor = bounds.find((b) => b > 0) ?? text.length;\n    const upperBound = Math.max(floor, cutWindow(text, bounds, 0, charLimit).end);\n    const end = fitEnd(render, bounds, floor, upperBound, charLimit);\n    return { snippets: [render(end)], offset: 0 };\n  }\n  const candidates = scoreWindows(occ, bounds, text, charLimit);\n  const { chosen, best } = selectWindows(candidates, countLimit);\n  return { snippets: chosen.map((win) => renderWindow(text, occ, win)), offset: best.start };\n}\n\n// Converts an offset in the original text to its one-based line number.\nexport function lineNumberAt(text: string, offset: number): number {\n  let line = 1;\n  for (let i = 0; i < offset; i++) if (text.charCodeAt(i) === 10) line++;\n  return line;\n}\n\nasync function lineRangeFor(store: Store, path: string, line: number): Promise<string | null> {\n  const stmt = await store.prepare('SELECT start_line, end_line FROM sections WHERE \"path\" = ? AND start_line <= ? AND end_line >= ? ORDER BY start_line DESC LIMIT 1');\n  const row = (await stmt.get(path, line, line)) as { start_line: number; end_line: number } | undefined;\n  return row ? `L${row.start_line}-${row.end_line}` : null;\n}\n\n/** Options for the root {@link search} API. */\nexport interface SearchOptions {\n  k?: number;\n  /** Collects ranking contributions for returned candidates; omitted or false preserves ordinary output. */\n  explain?: boolean;\n  where?: string; // SQL fragment against frontmatter alias `f`, e.g. \"f.status = 'active'\"\n  preset?: string; // named preset; unknown name throws listing declared presets, undefined -> \"default\"\n  include?: string[]; // ad hoc scope override (repeatable --include); independent of exclude\n  exclude?: string[]; // ad hoc scope override (repeatable --exclude); independent of include\n  noExclude?: boolean; // --no-exclude: drop the preset's exclude for this command\n  snippetCharLimit?: number; // --snippet-char-limit; defaults to SNIPPET_CHAR_LIMIT_DEFAULT\n  snippetCountLimit?: number; // --snippet-count-limit; defaults to SNIPPET_COUNT_LIMIT_DEFAULT\n  /** Cancels supported provider I/O and stops between phases after active native work finishes. */\n  signal?: AbortSignal;\n}\n\nexport type SearchResult = {\n  path: string;\n  title: string;\n  summary: string;\n  snippets: string[];\n  via: SearchResultVia;\n  score: number;\n  lines: string | null;\n  similarity?: number | null;\n  /** Present only with explain: true, in words/links/vectors order; contributions can differ from via labels. */\n  explanation?: SearchSignalContribution[];\n};\n\nexport interface SearchHydrationRow {\n  path: string;\n  snippets?: string[];\n  lines?: string | null;\n}\n\nfunction validateSearchOptions(opts: SearchOptions): void {\n  if (opts.explain !== undefined && typeof opts.explain !== 'boolean') {\n    throw new SenseError('SEARCH_OPTION_INVALID', `search option \"explain\" must be a boolean, got ${String(opts.explain)}`);\n  }\n  for (const [name, value] of [\n    ['k', opts.k],\n    ['snippetCharLimit', opts.snippetCharLimit],\n    ['snippetCountLimit', opts.snippetCountLimit],\n  ] as const) {\n    if (value !== undefined && (!Number.isFinite(value) || !Number.isInteger(value) || value <= 0)) {\n      throw new SenseError('SEARCH_OPTION_INVALID', `search option \"${name}\" must be a positive finite integer, got ${String(value)}`);\n    }\n  }\n}\n\n// Hydrates already-ranked rows with snippets and containing-section ranges without reranking.\nexport async function hydrateSearchRows(store: Store, cfg: ResolvedConfig, rows: SearchHydrationRow[], matchedPaths: Set<string>, terms: string, opts: Pick<SearchOptions, 'snippetCharLimit' | 'snippetCountLimit'> = {}): Promise<void> {\n  if (matchedPaths.size === 0) return;\n  const bareTerms = extractBareTerms(terms);\n  const charLimit = opts.snippetCharLimit ?? SNIPPET_CHAR_LIMIT_DEFAULT;\n  const countLimit = opts.snippetCountLimit ?? SNIPPET_COUNT_LIMIT_DEFAULT;\n  const sourceStmt = await store.prepare('SELECT text FROM indexed_sources WHERE \"path\" = ?');\n  for (const row of rows) {\n    if (!matchedPaths.has(row.path)) continue;\n    const source = (await sourceStmt.get(row.path)) as { text: string } | undefined;\n    if (!source) throw new SenseError('INDEX_NOT_READY', `indexed source text is missing for ${String(row.path)}; run \\`sense build --force\\` (or library build(config, { force: true })) before querying`);\n    const text = source.text;\n    const { snippets, offset } = computeSnippets(text, bareTerms, charLimit, countLimit);\n    row.snippets = snippets;\n    if (row.lines == null) row.lines = featureEnabled(cfg, 'sections') ? await lineRangeFor(store, row.path, lineNumberAt(text, offset)) : null;\n  }\n}\n\n/**\n * Searches one committed published generation. Provider work precedes the final read transaction;\n * cancellation waits for active native work and transaction cleanup before rejection.\n */\nexport function search(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<SearchResult[]> {\n  if (opts.signal?.aborted) return Promise.reject(opts.signal.reason);\n  return serialQuery(store, () => searchIndexed(store, cfg, terms, opts));\n}\n\ninterface SearchScope {\n  signature: string;\n  effective: EffectiveSearch;\n  allPaths: string[];\n  scopePaths: Set<string>;\n  allowedPaths: Set<string>;\n  semanticEligible: boolean;\n}\n\nasync function readSearchScope(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions): Promise<SearchScope> {\n  const signature = await assertQuerySnapshot(store, cfg);\n  const effective = resolveSearch(cfg, opts);\n  const allPaths = ((await (await store.prepare('SELECT \"path\" FROM frontmatter')).all()) as Array<{ path: string }>).map((r) => r.path);\n  const scopePaths = await rawScope(store, cfg, opts, allPaths);\n  let allowedPaths: Set<string>;\n  try {\n    allowedPaths = await narrowByWhere(store, scopePaths, effective.where);\n  } catch (err) {\n    throw searchError(err as Error, terms, effective.where);\n  }\n  const wantsVectors = effective.signals.vectors !== undefined;\n  if (wantsVectors) await ensureDocumentEmbeddings(store, cfg, allowedPaths);\n  const semanticEligible = wantsVectors && (await scopeHasEmbeddings(store, cfg, allowedPaths));\n  return { signature, effective, allPaths, scopePaths, allowedPaths, semanticEligible };\n}\n\ninterface SemanticPreparationNeeded {\n  signature: string;\n}\n\nfunction needsSemanticPreparation(result: SearchResult[] | SemanticPreparationNeeded): result is SemanticPreparationNeeded {\n  return !Array.isArray(result);\n}\n\nasync function searchIndexed(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions): Promise<SearchResult[]> {\n  validateSearchOptions(opts);\n  const initial = resolveSearch(cfg, opts);\n  opts.signal?.throwIfAborted();\n  // A downloadable HF id proceeds -- getProvider fetches it lazily on consent. Only a\n  // local path with missing files errors here, since nothing will ever fetch it for itself.\n  const wantsVectors = initial.signals.vectors !== undefined;\n  if (wantsVectors) {\n    const e = embedConfig(cfg); // validate.ts guarantees this is set whenever \"vectors\" is declared\n    if (localModelMissing(e)) {\n      throw new SenseError('EMBED_MODEL_MISSING', `preset \"${initial.presetName}\" searches with vectors, but the local model path \"${e.model}\" is missing ${MODEL_FILENAMES}; point embed.model at a directory containing them, or drop \"vectors\" from that preset's signals to search without them`);\n    }\n  }\n\n  let prepared: PreparedSemanticQuery | undefined;\n  let preparedSignature: string | undefined;\n  if (wantsVectors) {\n    // This first snapshot only decides whether a semantic query can contribute. It closes before\n    // provider/model work, and the complete scope/readiness decision is repeated below.\n    const preflight = await store.transaction(() => readSearchScope(store, cfg, terms, opts));\n    opts.signal?.throwIfAborted();\n    if (preflight.semanticEligible) {\n      preparedSignature = preflight.signature;\n      prepared = await prepareSemanticQuery(cfg, terms, { signal: opts.signal });\n      opts.signal?.throwIfAborted();\n    }\n  }\n\n  opts.signal?.throwIfAborted();\n  let result = await store.transaction(() => searchSnapshot(store, cfg, terms, opts, prepared, preparedSignature));\n  opts.signal?.throwIfAborted();\n  if (!needsSemanticPreparation(result)) return result;\n\n  // The scope became vector-eligible after an empty/ineligible preflight. Leave that snapshot,\n  // prepare once, then take a fresh final snapshot rather than waiting on the provider inside it.\n  preparedSignature = result.signature;\n  prepared = await prepareSemanticQuery(cfg, terms, { signal: opts.signal });\n  opts.signal?.throwIfAborted();\n  result = await store.transaction(() => searchSnapshot(store, cfg, terms, opts, prepared, preparedSignature));\n  opts.signal?.throwIfAborted();\n  if (needsSemanticPreparation(result)) throw new SenseError('INDEX_NOT_READY', 'the semantic search scope changed while its query was being prepared; retry the search against a stable published index');\n  return result;\n}\n\nasync function searchSnapshot(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions, prepared: PreparedSemanticQuery | undefined, preparedSignature: string | undefined): Promise<SearchResult[] | SemanticPreparationNeeded> {\n  const { signature, effective, allPaths, scopePaths, allowedPaths, semanticEligible } = await readSearchScope(store, cfg, terms, opts);\n  if (prepared !== undefined && signature !== preparedSignature) {\n    throw new SenseError('INDEX_NOT_READY', 'the index configuration changed while the semantic query was being prepared; retry after the current build finishes, or rebuild the index for this configuration');\n  }\n  if (semanticEligible && prepared === undefined) return { signature };\n\n  const { k, signals } = effective;\n  const fetch = Math.max(k * 3, 30);\n  const scopeActive = scopePaths.size < allPaths.length;\n  const semanticEnabled = semanticEligible && prepared !== undefined;\n\n  // --where applies inside the candidate query (a post-filter would drop matches ranked past\n  // the pool) and again on the final select, for link-derived rows.\n  const scope = effective.where;\n  const whereJoin = scope ? `JOIN frontmatter f ON f.\"path\" = content.path` : '';\n  const whereCond = scope ? `AND (${scope})` : '';\n  // Filtered before LIMIT, not after, or scoped notes ranking below the global top-`fetch`\n  // never reach the filter; joined against a temp table since real scopes exceed SQLITE_MAX_VARIABLE_NUMBER.\n  if (scopeActive) await materializeScope(store, '_search_scope', scopePaths);\n  const scopeCond = scopeActive ? `AND content.path IN (SELECT \"path\" FROM _search_scope)` : '';\n\n  const candidates: Candidates = new Map();\n  let matchRows: LexicalHit[] = [];\n  const hasEmptyPhrase = [...terms.matchAll(/\"([^\"]*)\"/g)].some((match) => !/[\\p{L}\\p{N}_]/u.test(match[1]));\n  const hasBareSyntaxOnly = /[()]/u.test(terms.replace(/\"[^\"]*\"/g, ' '));\n  // A query that is only whitespace or punctuation has no lexical rows; other declared signals\n  // compose normally. In particular, unspaced-script punctuation can rewrite to an empty MATCH.\n  if (signals.words !== undefined && terms.trim() !== '' && (/[\\p{L}\\p{N}_]/u.test(terms) || hasBareSyntaxOnly) && !hasEmptyPhrase) {\n    const syntaxError = bareTermSyntaxError(terms);\n    if (syntaxError) throw syntaxError;\n    try {\n      matchRows = await wordsCandidates(store, candidates, terms, whereJoin, whereCond, scopeCond, fetch, signals.words, opts.explain);\n    } catch (err) {\n      throw searchError(err as Error, terms, scope);\n    }\n  }\n  // Every store's lexical `snippets` is NULL; the snippet text is always computed below.\n  // Distinguish from via='link' rows, which never appear in matchRows.\n  const matchedPaths = new Set(matchRows.map((r) => r.path));\n\n  if (signals.links !== undefined) await linksCandidates(store, candidates, matchRows, allPaths, allowedPaths, fetch, signals.links, opts.explain);\n\n  let chunkLines = new Map<string, string>();\n  let chunkSimilarity = new Map<string, number>();\n  if (semanticEnabled && signals.vectors !== undefined && prepared !== undefined) {\n    ({ chunkLines, chunkSimilarity } = await vectorsCandidates(store, prepared, candidates, fetch, allowedPaths, allPaths.length, signals.vectors, opts.explain));\n  }\n\n  await store.exec('DROP TABLE IF EXISTS _search');\n  // DOUBLE, not REAL: sqlite's REAL is an 8-byte double but duckdb's is a 4-byte float, and the\n  // rounded score/similarity are printed at full precision in rows.\n  await store.exec('CREATE TEMP TABLE _search (\"path\" TEXT PRIMARY KEY, score DOUBLE, via TEXT, lines TEXT, similarity DOUBLE)');\n  if (candidates.size > 0) {\n    await store.runBatch(\n      'INSERT INTO _search (\"path\", score, via, lines, similarity) VALUES (?, ?, ?, ?, ?)',\n      [...candidates].map(([path, c]) => [path, c.score, c.via, chunkLines.get(path) ?? null, chunkSimilarity.get(path) ?? null])\n    );\n  }\n\n  // Reapplies --where even though _search is already scope+where filtered, since the join to\n  // frontmatter is already needed for the path column.\n  const where = scope ? `WHERE (${scope})` : '';\n  // lines: semantic rows carry their chunk's range, lexical rows gain one below,\n  // everything else stays null; similarity stays semantic-only.\n  const similarityCol = semanticEnabled ? ', _search.similarity' : '';\n  // NULL AS snippets holds this column's position (between summary and via) for every row;\n  // overwritten below, always to an array, never left null (DESIGN.md).\n  const selectStmt = await store.prepare(\n    `SELECT f.\"path\" AS path, content.title, content.summary, NULL AS snippets, _search.via, round(_search.score, 4) AS score, _search.lines${similarityCol}\n       FROM _search JOIN frontmatter f ON f.\"path\" = _search.\"path\" JOIN content ON content.path = _search.\"path\"\n       ${where} ORDER BY _search.score DESC, _search.\"path\" ASC LIMIT ?`\n  );\n  const rows = (await selectStmt.all(k)) as SearchResult[];\n  if (searchCandidatesRead.hasSubscribers) searchCandidatesRead.publish({ paths: rows.map((row) => row.path) });\n  for (const row of rows) row.snippets = [];\n\n  await hydrateSearchRows(store, cfg, rows, matchedPaths, terms, opts);\n  if (opts.explain) {\n    for (const row of rows) row.explanation = candidates.get(row.path)?.explanation ?? [];\n  }\n\n  return rows;\n}\n"],"names":["channel","stemmer","embedConfig","featureEnabled","resolveSearch","ensureDocumentEmbeddings","prepareSemanticQuery","localModelMissing","MODEL_FILENAMES","SenseError","serialQuery","bareTermSyntaxError","searchError","foldForSearch","hasUnspacedRun","searchTokens","unspacedRuns","materializeScope","narrowByWhere","rawScope","scopeHasEmbeddings","linksCandidates","vectorsCandidates","wordsCandidates","assertQuerySnapshot","SNIPPET_CHAR_LIMIT_DEFAULT","SNIPPET_COUNT_LIMIT_DEFAULT","searchCandidatesRead","extractBareTerms","query","cleaned","replace","split","map","tok","flatMap","text","toLowerCase","trim","filter","length","wordSegmenter","findOccurrences","terms","occ","textLower","unspacedTerms","run","runLower","slice","start","end","term","idx","found","indexOf","push","spacedTerms","t","termByStem","Map","stemInitials","Set","Array","from","keys","match","segment","unspaced","folded","has","get","undefined","sort","a","b","wordBoundaries","Intl","Segmenter","granularity","bounds","index","snapForward","pos","lo","hi","mid","snapBackward","result","firstBoundAfter","cutWindow","anchor","charLimit","rawEnd","Math","min","fitEnd","render","floor","upperBound","firstOccAtOrAfter","renderWindow","win","out","cursor","i","o","prefix","suffix","scoreWindows","candidates","winEnd","seen","count","j","add","max","e","distinct","size","overlaps","selectWindows","countLimit","ranked","chosen","c","some","s","best","computeSnippets","find","snippets","offset","lineNumberAt","line","charCodeAt","lineRangeFor","store","path","stmt","prepare","row","start_line","end_line","validateSearchOptions","opts","explain","String","name","value","k","snippetCharLimit","snippetCountLimit","Number","isFinite","isInteger","hydrateSearchRows","cfg","rows","matchedPaths","bareTerms","sourceStmt","source","lines","search","signal","aborted","Promise","reject","reason","searchIndexed","readSearchScope","signature","effective","allPaths","all","r","scopePaths","allowedPaths","where","err","wantsVectors","signals","vectors","semanticEligible","needsSemanticPreparation","isArray","initial","throwIfAborted","presetName","model","prepared","preparedSignature","preflight","transaction","searchSnapshot","fetch","scopeActive","semanticEnabled","scope","whereJoin","whereCond","scopeCond","matchRows","hasEmptyPhrase","matchAll","test","hasBareSyntaxOnly","words","syntaxError","links","chunkLines","chunkSimilarity","exec","runBatch","score","via","similarityCol","selectStmt","hasSubscribers","publish","paths","explanation"],"mappings":"AAAA,SAASA,OAAO,QAAQ,2BAA2B;AACnD,SAASC,OAAO,QAAQ,UAAU;AAElC,SAASC,WAAW,EAAEC,cAAc,EAAEC,aAAa,QAAQ,qBAAqB;AAEhF,SAASC,wBAAwB,EAAEC,oBAAoB,QAAQ,oBAAoB;AACnF,SAASC,iBAAiB,EAAEC,eAAe,QAAQ,oBAAoB;AACvE,SAASC,UAAU,QAAQ,eAAe;AAC1C,SAASC,WAAW,QAAQ,yBAAyB;AACrD,SAASC,mBAAmB,EAAEC,WAAW,QAAQ,4BAA4B;AAE7E,SAASC,aAAa,EAAEC,cAAc,EAAEC,YAAY,EAAEC,YAAY,QAAQ,qBAAqB;AAC/F,SAASC,gBAAgB,EAAEC,aAAa,EAAEC,QAAQ,EAAEC,kBAAkB,QAAQ,aAAa;AAE3F,SAASC,eAAe,EAAEC,iBAAiB,EAAEC,eAAe,QAAQ,eAAe;AACnF,SAASC,mBAAmB,QAAQ,gBAAgB;AAIpD,8FAA8F;AAC9F,mGAAmG;AACnG,OAAO,MAAMC,6BAA6B,GAAG;AAC7C,OAAO,MAAMC,8BAA8B,EAAE;AAE7C,MAAMC,uBAAuB3B,QAAQ;AAErC,yFAAyF;AACzF,oGAAoG;AACpG,SAAS4B,iBAAiBC,KAAa;IACrC,MAAMC,UAAUD,MACbE,OAAO,CAAC,MAAM,KACdA,OAAO,CAAC,UAAU,KAClBA,OAAO,CAAC,kCAAkC;IAC7C,OAAOD,QACJE,KAAK,CAAC,OACNC,GAAG,CAAC,CAACC,MAAQA,IAAIH,OAAO,CAAC,kBAAkB,KAAK,iCAAiC;KACjFI,OAAO,CAAC,CAACD,MAAQnB,aAAamB,KAAKD,GAAG,CAAC,CAAC,EAAEG,IAAI,EAAE,GAAKA,OACrDH,GAAG,CAAC,CAACC,MAAQA,IAAIG,WAAW,GAAGC,IAAI,IACnCC,MAAM,CAAC,CAACL,MAAQA,IAAIM,MAAM,GAAG;AAClC;AAEA,8FAA8F;AAC9F,8FAA8F;AAC9F,IAAIC;AAEJ,SAASC,gBAAgBN,IAAY,EAAEO,KAAe;IACpD,MAAMC,MAA2D,EAAE;IACnE,MAAMC,YAAYT,KAAKC,WAAW;IAElC,8FAA8F;IAC9F,wFAAwF;IACxF,MAAMS,gBAAgBH,MAAMJ,MAAM,CAACzB;IACnC,IAAIgC,cAAcN,MAAM,GAAG,GAAG;QAC5B,KAAK,MAAMO,OAAO/B,aAAaoB,MAAO;YACpC,MAAMY,WAAWH,UAAUI,KAAK,CAACF,IAAIG,KAAK,EAAEH,IAAII,GAAG;YACnD,KAAK,MAAMC,QAAQN,cAAe;gBAChC,IAAIO,MAAM;gBACV,OAAS;oBACP,MAAMC,QAAQN,SAASO,OAAO,CAACH,MAAMC;oBACrC,IAAIC,UAAU,CAAC,GAAG;oBAClBV,IAAIY,IAAI,CAAC;wBAAEN,OAAOH,IAAIG,KAAK,GAAGI;wBAAOH,KAAKJ,IAAIG,KAAK,GAAGI,QAAQF,KAAKZ,MAAM;wBAAEY;oBAAK;oBAChFC,MAAMC,QAAQF,KAAKZ,MAAM;gBAC3B;YACF;QACF;IACF;IAEA,6FAA6F;IAC7F,uGAAuG;IACvG,MAAMiB,cAAcd,MAAMJ,MAAM,CAAC,CAACmB,IAAM,CAAC5C,eAAe4C;IACxD,IAAID,YAAYjB,MAAM,GAAG,GAAG;QAC1B,MAAMmB,aAAa,IAAIC,IAAIH,YAAYxB,GAAG,CAAC,CAACyB,IAAM;gBAACzD,QAAQY,cAAc6C;gBAAKA;aAAE;QAChF,MAAMG,eAAe,IAAIC,IAAIC,MAAMC,IAAI,CAACL,WAAWM,IAAI,IAAI,CAACb,OAASA,IAAI,CAAC,EAAE;QAC5E,KAAK,MAAMc,SAASnD,aAAaqB,MAAO;YACtC,MAAM+B,UAAUD,MAAM9B,IAAI;YAC1B,IAAI8B,MAAME,QAAQ,EAAE;YACpB,MAAMC,SAASxD,cAAcsD;YAC7B,2FAA2F;YAC3F,IAAI,CAACN,aAAaS,GAAG,CAACD,MAAM,CAAC,EAAE,GAAG;YAClC,MAAMjB,OAAOO,WAAWY,GAAG,CAACtE,QAAQoE;YACpC,IAAIjB,SAASoB,WAAW5B,IAAIY,IAAI,CAAC;gBAAEN,OAAOgB,MAAMhB,KAAK;gBAAEC,KAAKe,MAAMf,GAAG;gBAAEC;YAAK;QAC9E;IACF;IAEA,OAAOR,IAAI6B,IAAI,CAAC,CAACC,GAAGC,IAAMD,EAAExB,KAAK,GAAGyB,EAAEzB,KAAK,IAAIyB,EAAExB,GAAG,GAAGuB,EAAEvB,GAAG;AAC9D;AAEA,6FAA6F;AAC7F,+FAA+F;AAC/F,gGAAgG;AAChG,SAASyB,eAAexC,IAAY;IAClCK,0BAAAA,2BAAAA,gBAAAA,gBAAkB,IAAIoC,KAAKC,SAAS,CAAC,MAAM;QAAEC,aAAa;IAAO;IACjE,MAAMC,SAAS;QAAC;KAAE;IAClB,KAAK,MAAM,EAAEC,KAAK,EAAEd,OAAO,EAAE,IAAI1B,cAAc0B,OAAO,CAAC/B,MAAO4C,OAAOxB,IAAI,CAACyB,QAAQd,QAAQ3B,MAAM;IAChG,OAAOwC;AACT;AAEA,0FAA0F;AAC1F,SAASE,YAAYF,MAAgB,EAAEG,GAAW;IAChD,IAAIC,KAAK;IACT,IAAIC,KAAKL,OAAOxC,MAAM,GAAG;IACzB,MAAO4C,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,MAAO;QACzB,IAAIL,MAAM,CAACM,IAAI,GAAGH,KAAKC,KAAKE,MAAM;aAC7BD,KAAKC;IACZ;IACA,OAAON,MAAM,CAACI,GAAG;AACnB;AAEA,SAASG,aAAaP,MAAgB,EAAEG,GAAW;IACjD,IAAIC,KAAK;IACT,IAAIC,KAAKL,OAAOxC,MAAM,GAAG;IACzB,IAAIgD,SAASR,MAAM,CAAC,EAAE;IACtB,MAAOI,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,KAAK,KAAM;QAC7B,IAAIL,MAAM,CAACM,IAAI,IAAIH,KAAK;YACtBC,KAAKE;YACLE,SAASR,MAAM,CAACM,IAAI;QACtB,OAAOD,KAAKC,MAAM;IACpB;IACA,OAAOE;AACT;AAEA,SAASC,gBAAgBT,MAAgB,EAAEG,GAAW;IACpD,IAAIC,KAAK;IACT,IAAIC,KAAKL,OAAOxC,MAAM;IACtB,MAAO4C,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,MAAO;QACzB,IAAIL,MAAM,CAACM,IAAI,IAAIH,KAAKC,KAAKE,MAAM;aAC9BD,KAAKC;IACZ;IACA,OAAON,MAAM,CAACI,GAAG;AACnB;AAEA,wFAAwF;AACxF,8FAA8F;AAC9F,8FAA8F;AAC9F,+FAA+F;AAC/F,mFAAmF;AACnF,SAASM,UAAUtD,IAAY,EAAE4C,MAAgB,EAAEW,MAAc,EAAEC,SAAiB;QAI1DH;IAHxB,MAAMI,SAASC,KAAKC,GAAG,CAAC3D,KAAKI,MAAM,EAAEmD,SAASC;IAC9C,MAAM1C,QAAQgC,YAAYF,QAAQW;IAClC,IAAIxC,MAAMoC,aAAaP,QAAQa;IAC/B,IAAI1C,OAAOD,OAAOC,OAAMsC,mBAAAA,gBAAgBT,QAAQ9B,oBAAxBuC,8BAAAA,mBAAkCrD,KAAKI,MAAM;IACrE,OAAO;QAAEU;QAAOC,KAAK2C,KAAKC,GAAG,CAAC5C,KAAKf,KAAKI,MAAM;IAAE;AAClD;AAEA,8FAA8F;AAC9F,0FAA0F;AAC1F,wFAAwF;AACxF,6FAA6F;AAC7F,+FAA+F;AAC/F,wDAAwD;AACxD,SAASwD,OAAOC,MAA+B,EAAEjB,MAAgB,EAAEkB,KAAa,EAAEC,UAAkB,EAAEP,SAAiB;IACrH,IAAIR,KAAK;IACT,IAAIC,KAAKL,OAAOxC,MAAM,GAAG;IACzB,MAAO4C,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,KAAK,KAAM;QAC7B,IAAIL,MAAM,CAACM,IAAI,IAAIa,YAAYf,KAAKE;aAC/BD,KAAKC,MAAM;IAClB;IACA,MAAOF,MAAM,KAAKJ,MAAM,CAACI,GAAG,GAAGc,OAAOd,KAAM;QAC1C,IAAIa,OAAOjB,MAAM,CAACI,GAAG,EAAE5C,MAAM,IAAIoD,WAAW,OAAOZ,MAAM,CAACI,GAAG;IAC/D;IACA,OAAOc;AACT;AAYA,6FAA6F;AAC7F,SAASE,kBAAkBxD,GAAwD,EAAEuC,GAAW;IAC9F,IAAIC,KAAK;IACT,IAAIC,KAAKzC,IAAIJ,MAAM;IACnB,MAAO4C,KAAKC,GAAI;QACd,MAAMC,MAAM,AAACF,KAAKC,MAAO;QACzB,IAAIzC,GAAG,CAAC0C,IAAI,CAACpC,KAAK,GAAGiC,KAAKC,KAAKE,MAAM;aAChCD,KAAKC;IACZ;IACA,OAAOF;AACT;AAEA,SAASiB,aAAajE,IAAY,EAAEQ,GAAwD,EAAE0D,GAAS;IACrG,IAAIC,MAAM;IACV,IAAIC,SAASF,IAAIpD,KAAK;IACtB,IAAK,IAAIuD,IAAIL,kBAAkBxD,KAAK0D,IAAIpD,KAAK,GAAGuD,IAAI7D,IAAIJ,MAAM,IAAII,GAAG,CAAC6D,EAAE,CAACvD,KAAK,GAAGoD,IAAInD,GAAG,EAAEsD,IAAK;QAC7F,MAAMC,IAAI9D,GAAG,CAAC6D,EAAE;QAChB,IAAIC,EAAEvD,GAAG,GAAGmD,IAAInD,GAAG,EAAE;QACrB,sFAAsF;QACtF,gFAAgF;QAChF,IAAIuD,EAAExD,KAAK,GAAGsD,QAAQ;QACtBD,OAAO,GAAGnE,KAAKa,KAAK,CAACuD,QAAQE,EAAExD,KAAK,EAAE,CAAC,EAAEd,KAAKa,KAAK,CAACyD,EAAExD,KAAK,EAAEwD,EAAEvD,GAAG,EAAE,CAAC,CAAC;QACtEqD,SAASE,EAAEvD,GAAG;IAChB;IACAoD,OAAOnE,KAAKa,KAAK,CAACuD,QAAQF,IAAInD,GAAG;IACjC,MAAMwD,SAASL,IAAIpD,KAAK,GAAG,IAAI,MAAM;IACrC,MAAM0D,SAASN,IAAInD,GAAG,GAAGf,KAAKI,MAAM,GAAG,MAAM;IAC7C,OAAO,GAAGmE,SAASJ,IAAIxE,OAAO,CAAC,QAAQ,OAAO6E,QAAQ;AACxD;AAEA,8FAA8F;AAC9F,iGAAiG;AACjG,iGAAiG;AACjG,4FAA4F;AAC5F,6FAA6F;AAC7F,4CAA4C;AAC5C,SAASC,aAAajE,GAAwD,EAAEoC,MAAgB,EAAE5C,IAAY,EAAEwD,SAAiB;IAC/H,MAAMkB,aAA8B,EAAE;IACtC,IAAK,IAAIL,IAAI,GAAGA,IAAI7D,IAAIJ,MAAM,EAAEiE,IAAK;QACnC,MAAMM,SAASnE,GAAG,CAAC6D,EAAE,CAACvD,KAAK,GAAG0C;QAC9B,MAAMoB,OAAO,IAAIlD;QACjB,IAAImD,QAAQ;QACZ,IAAK,IAAIC,IAAIT,GAAGS,IAAItE,IAAIJ,MAAM,IAAII,GAAG,CAACsE,EAAE,CAAChE,KAAK,GAAG6D,QAAQG,IAAK;YAC5DF,KAAKG,GAAG,CAACvE,GAAG,CAACsE,EAAE,CAAC9D,IAAI;YACpB6D;QACF;QACA,MAAM/D,QAAQgC,YAAYF,QAAQpC,GAAG,CAAC6D,EAAE,CAACvD,KAAK;QAC9C,MAAMgD,QAAQJ,KAAKsB,GAAG,CAAClE,OAAON,GAAG,CAAC6D,EAAE,CAACtD,GAAG;QACxC,MAAMgD,aAAaL,KAAKsB,GAAG,CAAClB,OAAOR,UAAUtD,MAAM4C,QAAQpC,GAAG,CAAC6D,EAAE,CAACvD,KAAK,EAAE0C,WAAWzC,GAAG;QACvF,MAAMA,MAAM6C,OAAO,CAACqB,IAAMhB,aAAajE,MAAMQ,KAAK;gBAAEM;gBAAOC,KAAKkE;YAAE,IAAIrC,QAAQkB,OAAOC,YAAYP;QACjGkB,WAAWtD,IAAI,CAAC;YAAEN;YAAOC;YAAKmE,UAAUN,KAAKO,IAAI;YAAEN;QAAM;IAC3D;IACA,OAAOH;AACT;AAEA,SAASU,SAAS9C,CAAO,EAAEC,CAAO;IAChC,OAAOD,EAAExB,KAAK,GAAGyB,EAAExB,GAAG,IAAIwB,EAAEzB,KAAK,GAAGwB,EAAEvB,GAAG;AAC3C;AAEA,4FAA4F;AAC5F,gGAAgG;AAChG,mFAAmF;AACnF,SAASsE,cAAcX,UAA2B,EAAEY,UAAkB;IACpE,MAAMC,SAASb,WAAW7D,KAAK,GAAGwB,IAAI,CAAC,CAACC,GAAGC,IAAMA,EAAE2C,QAAQ,GAAG5C,EAAE4C,QAAQ,IAAI3C,EAAEsC,KAAK,GAAGvC,EAAEuC,KAAK;IAC7F,MAAMW,SAA0B,EAAE;IAClC,KAAK,MAAMC,KAAKF,OAAQ;QACtB,IAAIC,OAAOpF,MAAM,IAAIkF,YAAY;QACjC,IAAIE,OAAOE,IAAI,CAAC,CAACC,IAAMP,SAASO,GAAGF,KAAK;QACxCD,OAAOpE,IAAI,CAACqE;IACd;IACAD,OAAOnD,IAAI,CAAC,CAACC,GAAGC,IAAMD,EAAExB,KAAK,GAAGyB,EAAEzB,KAAK;IACvC,OAAO;QAAE0E;QAAQI,MAAML,MAAM,CAAC,EAAE;IAAC;AACnC;AAEA,0FAA0F;AAC1F,OAAO,SAASM,gBAAgB7F,IAAY,EAAEO,KAAe,EAAEiD,SAAiB,EAAE8B,UAAkB;IAClG,MAAM9E,MAAMF,gBAAgBN,MAAMO;IAClC,MAAMqC,SAASJ,eAAexC;IAC9B,IAAIQ,IAAIJ,MAAM,KAAK,GAAG;YAINwC;QAHd,uFAAuF;QACvF,0CAA0C;QAC1C,MAAMiB,SAAS,CAAC9C,MAAwB,GAAGf,KAAKa,KAAK,CAAC,GAAGE,KAAKpB,OAAO,CAAC,QAAQ,KAAKO,IAAI,KAAKa,MAAMf,KAAKI,MAAM,GAAG,MAAM,IAAI;QAC1H,MAAM0D,SAAQlB,eAAAA,OAAOkD,IAAI,CAAC,CAACvD,IAAMA,IAAI,gBAAvBK,0BAAAA,eAA6B5C,KAAKI,MAAM;QACtD,MAAM2D,aAAaL,KAAKsB,GAAG,CAAClB,OAAOR,UAAUtD,MAAM4C,QAAQ,GAAGY,WAAWzC,GAAG;QAC5E,MAAMA,MAAM6C,OAAOC,QAAQjB,QAAQkB,OAAOC,YAAYP;QACtD,OAAO;YAAEuC,UAAU;gBAAClC,OAAO9C;aAAK;YAAEiF,QAAQ;QAAE;IAC9C;IACA,MAAMtB,aAAaD,aAAajE,KAAKoC,QAAQ5C,MAAMwD;IACnD,MAAM,EAAEgC,MAAM,EAAEI,IAAI,EAAE,GAAGP,cAAcX,YAAYY;IACnD,OAAO;QAAES,UAAUP,OAAO3F,GAAG,CAAC,CAACqE,MAAQD,aAAajE,MAAMQ,KAAK0D;QAAO8B,QAAQJ,KAAK9E,KAAK;IAAC;AAC3F;AAEA,wEAAwE;AACxE,OAAO,SAASmF,aAAajG,IAAY,EAAEgG,MAAc;IACvD,IAAIE,OAAO;IACX,IAAK,IAAI7B,IAAI,GAAGA,IAAI2B,QAAQ3B,IAAK,IAAIrE,KAAKmG,UAAU,CAAC9B,OAAO,IAAI6B;IAChE,OAAOA;AACT;AAEA,eAAeE,aAAaC,KAAY,EAAEC,IAAY,EAAEJ,IAAY;IAClE,MAAMK,OAAO,MAAMF,MAAMG,OAAO,CAAC;IACjC,MAAMC,MAAO,MAAMF,KAAKpE,GAAG,CAACmE,MAAMJ,MAAMA;IACxC,OAAOO,MAAM,CAAC,CAAC,EAAEA,IAAIC,UAAU,CAAC,CAAC,EAAED,IAAIE,QAAQ,EAAE,GAAG;AACtD;AAqCA,SAASC,sBAAsBC,IAAmB;IAChD,IAAIA,KAAKC,OAAO,KAAK1E,aAAa,OAAOyE,KAAKC,OAAO,KAAK,WAAW;QACnE,MAAM,IAAIzI,WAAW,yBAAyB,CAAC,+CAA+C,EAAE0I,OAAOF,KAAKC,OAAO,GAAG;IACxH;IACA,KAAK,MAAM,CAACE,MAAMC,MAAM,IAAI;QAC1B;YAAC;YAAKJ,KAAKK,CAAC;SAAC;QACb;YAAC;YAAoBL,KAAKM,gBAAgB;SAAC;QAC3C;YAAC;YAAqBN,KAAKO,iBAAiB;SAAC;KAC9C,CAAW;QACV,IAAIH,UAAU7E,aAAc,CAAA,CAACiF,OAAOC,QAAQ,CAACL,UAAU,CAACI,OAAOE,SAAS,CAACN,UAAUA,SAAS,CAAA,GAAI;YAC9F,MAAM,IAAI5I,WAAW,yBAAyB,CAAC,eAAe,EAAE2I,KAAK,yCAAyC,EAAED,OAAOE,QAAQ;QACjI;IACF;AACF;AAEA,8FAA8F;AAC9F,OAAO,eAAeO,kBAAkBnB,KAAY,EAAEoB,GAAmB,EAAEC,IAA0B,EAAEC,YAAyB,EAAEpH,KAAa,EAAEsG,OAAsE,CAAC,CAAC;QAGrMA,wBACCA;IAHnB,IAAIc,aAAaxC,IAAI,KAAK,GAAG;IAC7B,MAAMyC,YAAYpI,iBAAiBe;IACnC,MAAMiD,aAAYqD,yBAAAA,KAAKM,gBAAgB,cAArBN,oCAAAA,yBAAyBxH;IAC3C,MAAMiG,cAAauB,0BAAAA,KAAKO,iBAAiB,cAAtBP,qCAAAA,0BAA0BvH;IAC7C,MAAMuI,aAAa,MAAMxB,MAAMG,OAAO,CAAC;IACvC,KAAK,MAAMC,OAAOiB,KAAM;QACtB,IAAI,CAACC,aAAazF,GAAG,CAACuE,IAAIH,IAAI,GAAG;QACjC,MAAMwB,SAAU,MAAMD,WAAW1F,GAAG,CAACsE,IAAIH,IAAI;QAC7C,IAAI,CAACwB,QAAQ,MAAM,IAAIzJ,WAAW,mBAAmB,CAAC,mCAAmC,EAAE0I,OAAON,IAAIH,IAAI,EAAE,yFAAyF,CAAC;QACtM,MAAMtG,OAAO8H,OAAO9H,IAAI;QACxB,MAAM,EAAE+F,QAAQ,EAAEC,MAAM,EAAE,GAAGH,gBAAgB7F,MAAM4H,WAAWpE,WAAW8B;QACzEmB,IAAIV,QAAQ,GAAGA;QACf,IAAIU,IAAIsB,KAAK,IAAI,MAAMtB,IAAIsB,KAAK,GAAGhK,eAAe0J,KAAK,cAAc,MAAMrB,aAAaC,OAAOI,IAAIH,IAAI,EAAEL,aAAajG,MAAMgG,WAAW;IACzI;AACF;AAEA;;;CAGC,GACD,OAAO,SAASgC,OAAO3B,KAAY,EAAEoB,GAAmB,EAAElH,KAAa,EAAEsG,OAAsB,CAAC,CAAC;QAC3FA;IAAJ,KAAIA,eAAAA,KAAKoB,MAAM,cAAXpB,mCAAAA,aAAaqB,OAAO,EAAE,OAAOC,QAAQC,MAAM,CAACvB,KAAKoB,MAAM,CAACI,MAAM;IAClE,OAAO/J,YAAY+H,OAAO,IAAMiC,cAAcjC,OAAOoB,KAAKlH,OAAOsG;AACnE;AAWA,eAAe0B,gBAAgBlC,KAAY,EAAEoB,GAAmB,EAAElH,KAAa,EAAEsG,IAAmB;IAClG,MAAM2B,YAAY,MAAMpJ,oBAAoBiH,OAAOoB;IACnD,MAAMgB,YAAYzK,cAAcyJ,KAAKZ;IACrC,MAAM6B,WAAW,AAAE,CAAA,MAAM,AAAC,CAAA,MAAMrC,MAAMG,OAAO,CAAC,iCAAgC,EAAGmC,GAAG,EAAC,EAA+B9I,GAAG,CAAC,CAAC+I,IAAMA,EAAEtC,IAAI;IACrI,MAAMuC,aAAa,MAAM9J,SAASsH,OAAOoB,KAAKZ,MAAM6B;IACpD,IAAII;IACJ,IAAI;QACFA,eAAe,MAAMhK,cAAcuH,OAAOwC,YAAYJ,UAAUM,KAAK;IACvE,EAAE,OAAOC,KAAK;QACZ,MAAMxK,YAAYwK,KAAczI,OAAOkI,UAAUM,KAAK;IACxD;IACA,MAAME,eAAeR,UAAUS,OAAO,CAACC,OAAO,KAAK/G;IACnD,IAAI6G,cAAc,MAAMhL,yBAAyBoI,OAAOoB,KAAKqB;IAC7D,MAAMM,mBAAmBH,gBAAiB,MAAMjK,mBAAmBqH,OAAOoB,KAAKqB;IAC/E,OAAO;QAAEN;QAAWC;QAAWC;QAAUG;QAAYC;QAAcM;IAAiB;AACtF;AAMA,SAASC,yBAAyBjG,MAAkD;IAClF,OAAO,CAACzB,MAAM2H,OAAO,CAAClG;AACxB;AAEA,eAAekF,cAAcjC,KAAY,EAAEoB,GAAmB,EAAElH,KAAa,EAAEsG,IAAmB;QAGhGA,cAyBAA,eAEAA,eAOAA,eAEAA;IAtCAD,sBAAsBC;IACtB,MAAM0C,UAAUvL,cAAcyJ,KAAKZ;KACnCA,eAAAA,KAAKoB,MAAM,cAAXpB,mCAAAA,aAAa2C,cAAc;IAC3B,oFAAoF;IACpF,0FAA0F;IAC1F,MAAMP,eAAeM,QAAQL,OAAO,CAACC,OAAO,KAAK/G;IACjD,IAAI6G,cAAc;QAChB,MAAMhE,IAAInH,YAAY2J,MAAM,oEAAoE;QAChG,IAAItJ,kBAAkB8G,IAAI;YACxB,MAAM,IAAI5G,WAAW,uBAAuB,CAAC,QAAQ,EAAEkL,QAAQE,UAAU,CAAC,mDAAmD,EAAExE,EAAEyE,KAAK,CAAC,aAAa,EAAEtL,gBAAgB,uHAAuH,CAAC;QAChS;IACF;IAEA,IAAIuL;IACJ,IAAIC;IACJ,IAAIX,cAAc;YAIhBpC;QAHA,6FAA6F;QAC7F,oFAAoF;QACpF,MAAMgD,YAAY,MAAMxD,MAAMyD,WAAW,CAAC,IAAMvB,gBAAgBlC,OAAOoB,KAAKlH,OAAOsG;SACnFA,gBAAAA,KAAKoB,MAAM,cAAXpB,oCAAAA,cAAa2C,cAAc;QAC3B,IAAIK,UAAUT,gBAAgB,EAAE;gBAG9BvC;YAFA+C,oBAAoBC,UAAUrB,SAAS;YACvCmB,WAAW,MAAMzL,qBAAqBuJ,KAAKlH,OAAO;gBAAE0H,QAAQpB,KAAKoB,MAAM;YAAC;aACxEpB,gBAAAA,KAAKoB,MAAM,cAAXpB,oCAAAA,cAAa2C,cAAc;QAC7B;IACF;KAEA3C,gBAAAA,KAAKoB,MAAM,cAAXpB,oCAAAA,cAAa2C,cAAc;IAC3B,IAAIpG,SAAS,MAAMiD,MAAMyD,WAAW,CAAC,IAAMC,eAAe1D,OAAOoB,KAAKlH,OAAOsG,MAAM8C,UAAUC;KAC7F/C,gBAAAA,KAAKoB,MAAM,cAAXpB,oCAAAA,cAAa2C,cAAc;IAC3B,IAAI,CAACH,yBAAyBjG,SAAS,OAAOA;IAE9C,6FAA6F;IAC7F,gGAAgG;IAChGwG,oBAAoBxG,OAAOoF,SAAS;IACpCmB,WAAW,MAAMzL,qBAAqBuJ,KAAKlH,OAAO;QAAE0H,QAAQpB,KAAKoB,MAAM;IAAC;KACxEpB,gBAAAA,KAAKoB,MAAM,cAAXpB,oCAAAA,cAAa2C,cAAc;IAC3BpG,SAAS,MAAMiD,MAAMyD,WAAW,CAAC,IAAMC,eAAe1D,OAAOoB,KAAKlH,OAAOsG,MAAM8C,UAAUC;KACzF/C,gBAAAA,KAAKoB,MAAM,cAAXpB,oCAAAA,cAAa2C,cAAc;IAC3B,IAAIH,yBAAyBjG,SAAS,MAAM,IAAI/E,WAAW,mBAAmB;IAC9E,OAAO+E;AACT;AAEA,eAAe2G,eAAe1D,KAAY,EAAEoB,GAAmB,EAAElH,KAAa,EAAEsG,IAAmB,EAAE8C,QAA2C,EAAEC,iBAAqC;IACrL,MAAM,EAAEpB,SAAS,EAAEC,SAAS,EAAEC,QAAQ,EAAEG,UAAU,EAAEC,YAAY,EAAEM,gBAAgB,EAAE,GAAG,MAAMb,gBAAgBlC,OAAOoB,KAAKlH,OAAOsG;IAChI,IAAI8C,aAAavH,aAAaoG,cAAcoB,mBAAmB;QAC7D,MAAM,IAAIvL,WAAW,mBAAmB;IAC1C;IACA,IAAI+K,oBAAoBO,aAAavH,WAAW,OAAO;QAAEoG;IAAU;IAEnE,MAAM,EAAEtB,CAAC,EAAEgC,OAAO,EAAE,GAAGT;IACvB,MAAMuB,QAAQtG,KAAKsB,GAAG,CAACkC,IAAI,GAAG;IAC9B,MAAM+C,cAAcpB,WAAW1D,IAAI,GAAGuD,SAAStI,MAAM;IACrD,MAAM8J,kBAAkBd,oBAAoBO,aAAavH;IAEzD,2FAA2F;IAC3F,kEAAkE;IAClE,MAAM+H,QAAQ1B,UAAUM,KAAK;IAC7B,MAAMqB,YAAYD,QAAQ,CAAC,6CAA6C,CAAC,GAAG;IAC5E,MAAME,YAAYF,QAAQ,CAAC,KAAK,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC7C,yFAAyF;IACzF,2GAA2G;IAC3G,IAAIF,aAAa,MAAMpL,iBAAiBwH,OAAO,iBAAiBwC;IAChE,MAAMyB,YAAYL,cAAc,CAAC,sDAAsD,CAAC,GAAG;IAE3F,MAAMvF,aAAyB,IAAIlD;IACnC,IAAI+I,YAA0B,EAAE;IAChC,MAAMC,iBAAiB;WAAIjK,MAAMkK,QAAQ,CAAC;KAAc,CAAC/E,IAAI,CAAC,CAAC5D,QAAU,CAAC,iBAAiB4I,IAAI,CAAC5I,KAAK,CAAC,EAAE;IACxG,MAAM6I,oBAAoB,QAAQD,IAAI,CAACnK,MAAMZ,OAAO,CAAC,YAAY;IACjE,6FAA6F;IAC7F,8FAA8F;IAC9F,IAAIuJ,QAAQ0B,KAAK,KAAKxI,aAAa7B,MAAML,IAAI,OAAO,MAAO,CAAA,iBAAiBwK,IAAI,CAACnK,UAAUoK,iBAAgB,KAAM,CAACH,gBAAgB;QAChI,MAAMK,cAActM,oBAAoBgC;QACxC,IAAIsK,aAAa,MAAMA;QACvB,IAAI;YACFN,YAAY,MAAMpL,gBAAgBkH,OAAO3B,YAAYnE,OAAO6J,WAAWC,WAAWC,WAAWN,OAAOd,QAAQ0B,KAAK,EAAE/D,KAAKC,OAAO;QACjI,EAAE,OAAOkC,KAAK;YACZ,MAAMxK,YAAYwK,KAAczI,OAAO4J;QACzC;IACF;IACA,uFAAuF;IACvF,qEAAqE;IACrE,MAAMxC,eAAe,IAAIjG,IAAI6I,UAAU1K,GAAG,CAAC,CAAC+I,IAAMA,EAAEtC,IAAI;IAExD,IAAI4C,QAAQ4B,KAAK,KAAK1I,WAAW,MAAMnD,gBAAgBoH,OAAO3B,YAAY6F,WAAW7B,UAAUI,cAAckB,OAAOd,QAAQ4B,KAAK,EAAEjE,KAAKC,OAAO;IAE/I,IAAIiE,aAAa,IAAIvJ;IACrB,IAAIwJ,kBAAkB,IAAIxJ;IAC1B,IAAI0I,mBAAmBhB,QAAQC,OAAO,KAAK/G,aAAauH,aAAavH,WAAW;QAC7E,CAAA,EAAE2I,UAAU,EAAEC,eAAe,EAAE,GAAG,MAAM9L,kBAAkBmH,OAAOsD,UAAUjF,YAAYsF,OAAOlB,cAAcJ,SAAStI,MAAM,EAAE8I,QAAQC,OAAO,EAAEtC,KAAKC,OAAO,CAAA;IAC7J;IAEA,MAAMT,MAAM4E,IAAI,CAAC;IACjB,8FAA8F;IAC9F,kEAAkE;IAClE,MAAM5E,MAAM4E,IAAI,CAAC;IACjB,IAAIvG,WAAWS,IAAI,GAAG,GAAG;QACvB,MAAMkB,MAAM6E,QAAQ,CAClB,sFACA;eAAIxG;SAAW,CAAC7E,GAAG,CAAC,CAAC,CAACyG,MAAMb,EAAE;gBAA4BsF,iBAA8BC;mBAArD;gBAAC1E;gBAAMb,EAAE0F,KAAK;gBAAE1F,EAAE2F,GAAG;iBAAEL,kBAAAA,WAAW5I,GAAG,CAACmE,mBAAfyE,6BAAAA,kBAAwB;iBAAMC,uBAAAA,gBAAgB7I,GAAG,CAACmE,mBAApB0E,kCAAAA,uBAA6B;aAAK;;IAE9H;IAEA,2FAA2F;IAC3F,qDAAqD;IACrD,MAAMjC,QAAQoB,QAAQ,CAAC,OAAO,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC3C,+EAA+E;IAC/E,8DAA8D;IAC9D,MAAMkB,gBAAgBnB,kBAAkB,yBAAyB;IACjE,yFAAyF;IACzF,sEAAsE;IACtE,MAAMoB,aAAa,MAAMjF,MAAMG,OAAO,CACpC,CAAC,uIAAuI,EAAE6E,cAAc;;OAErJ,EAAEtC,MAAM,wDAAwD,CAAC;IAEtE,MAAMrB,OAAQ,MAAM4D,WAAW3C,GAAG,CAACzB;IACnC,IAAI3H,qBAAqBgM,cAAc,EAAEhM,qBAAqBiM,OAAO,CAAC;QAAEC,OAAO/D,KAAK7H,GAAG,CAAC,CAAC4G,MAAQA,IAAIH,IAAI;IAAE;IAC3G,KAAK,MAAMG,OAAOiB,KAAMjB,IAAIV,QAAQ,GAAG,EAAE;IAEzC,MAAMyB,kBAAkBnB,OAAOoB,KAAKC,MAAMC,cAAcpH,OAAOsG;IAC/D,IAAIA,KAAKC,OAAO,EAAE;;YAC0BpC;QAA1C,KAAK,MAAM+B,OAAOiB,KAAMjB,IAAIiF,WAAW,YAAGhH,kBAAAA,WAAWvC,GAAG,CAACsE,IAAIH,IAAI,eAAvB5B,sCAAAA,gBAA0BgH,WAAW,uCAAI,EAAE;IACvF;IAEA,OAAOhE;AACT"}

package/dist/esm/commands/signals.d.ts

@@ -1,13 +1,27 @@
+import type { SignalName } from '../config/index.js';
 import type { PreparedSemanticQuery } from '../embed/query.js';
 import type { LexicalHit, Store } from '../store/types.js';
 export type SearchResultVia = 'match' | 'match+link' | 'link' | 'match+vector' | 'match+link+vector' | 'link+vector' | 'vector';
-export type Candidates = Map<string, {
+/** One participating signal's contribution captured during the existing ranking computation. */
+export interface SearchSignalContribution {
+    signal: SignalName;
+    /** One-based position; fusion uses weight / (60 + rank - 1). */
+    rank: number;
+    /** Effective weight from the selected preset. */
+    weight: number;
+    /** Unrounded value added to the fused score, independent of the rounded public score and via label. */
+    contribution: number;
+}
+interface Candidate {
     score: number;
     via: SearchResultVia;
-}>;
-export declare function wordsCandidates(store: Store, candidates: Candidates, query: string, whereJoin: string, whereCond: string, scopeCond: string, fetch: number, weight: number): Promise<LexicalHit[]>;
-export declare function linksCandidates(store: Store, candidates: Candidates, matchRows: LexicalHit[], allPaths: string[], allowedPaths: Set<string>, fetch: number, weight: number): Promise<void>;
-export declare function vectorsCandidates(store: Store, prepared: PreparedSemanticQuery, candidates: Candidates, fetch: number, allowedPaths: Set<string>, totalPaths: number, weight: number): Promise<{
+    explanation?: SearchSignalContribution[];
+}
+export type Candidates = Map<string, Candidate>;
+export declare function wordsCandidates(store: Store, candidates: Candidates, query: string, whereJoin: string, whereCond: string, scopeCond: string, fetch: number, weight: number, explain?: boolean): Promise<LexicalHit[]>;
+export declare function linksCandidates(store: Store, candidates: Candidates, matchRows: LexicalHit[], allPaths: string[], allowedPaths: Set<string>, fetch: number, weight: number, explain?: boolean): Promise<void>;
+export declare function vectorsCandidates(store: Store, prepared: PreparedSemanticQuery, candidates: Candidates, fetch: number, allowedPaths: Set<string>, totalPaths: number, weight: number, explain?: boolean): Promise<{
     chunkLines: Map<string, string>;
     chunkSimilarity: Map<string, number>;
 }>;
+export {};

package/dist/esm/commands/signals.js

@@ -13,7 +13,7 @@ function withVector(via) {
 }
 // BM25 match rows (store.lexical.query), folded into `candidates` by reciprocal rank scaled by
 // the preset's declared weight for this signal. Every other signal is seeded from its output.
-export async function wordsCandidates(store, candidates, query, whereJoin, whereCond, scopeCond, fetch, weight) {
+export async function wordsCandidates(store, candidates, query, whereJoin, whereCond, scopeCond, fetch, weight, explain = false) {
     const matchRows = await store.lexical.query(query, {
         whereJoin,
         whereCond,
@@ -21,16 +21,26 @@ export async function wordsCandidates(store, candidates, query, whereJoin, where
         limit: fetch
     });
     matchRows.forEach((r, i)=>{
-        candidates.set(r.path, {
-            score: weight / (RRF_K + i),
+        const contribution = weight / (RRF_K + i);
+        const candidate = {
+            score: contribution,
             via: 'match'
-        });
+        };
+        if (explain) candidate.explanation = [
+            {
+                signal: 'words',
+                rank: i + 1,
+                weight,
+                contribution
+            }
+        ];
+        candidates.set(r.path, candidate);
     });
     return matchRows;
 }
 // Personalized-PageRank expansion from the word-match seeds, folded into `candidates` at this
 // signal's weight. A no-op when there is nothing to seed from (matchRows empty).
-export async function linksCandidates(store, candidates, matchRows, allPaths, allowedPaths, fetch, weight) {
+export async function linksCandidates(store, candidates, matchRows, allPaths, allowedPaths, fetch, weight, explain = false) {
     if (matchRows.length === 0) return;
     const stmt = await store.prepare(LINK_EDGES_SQL);
     const edges = toEdges(await stmt.all());
@@ -46,36 +56,76 @@ export async function linksCandidates(store, candidates, matchRows, allPaths, al
         ...personalizedRank(allPaths, edges, seeds)
     ].filter(([path, score])=>score > 1e-9 && allowedPaths.has(path)).sort((a, b)=>b[1] - a[1] || Buffer.compare(Buffer.from(a[0]), Buffer.from(b[0]))).slice(0, fetch);
     ranked.forEach(([path], i)=>{
+        const contribution = weight / (RRF_K + i);
         const existing = candidates.get(path);
         if (existing) {
-            existing.score += weight / (RRF_K + i);
+            existing.score += contribution;
+            if (explain) {
+                var _existing, _explanation;
+                (_explanation = (_existing = existing).explanation) !== null && _explanation !== void 0 ? _explanation : _existing.explanation = [];
+                existing.explanation.push({
+                    signal: 'links',
+                    rank: i + 1,
+                    weight,
+                    contribution
+                });
+            }
             if (linked.has(path)) existing.via = 'match+link';
         } else {
-            candidates.set(path, {
-                score: weight / (RRF_K + i),
+            const candidate = {
+                score: contribution,
                 via: 'link'
-            });
+            };
+            if (explain) candidate.explanation = [
+                {
+                    signal: 'links',
+                    rank: i + 1,
+                    weight,
+                    contribution
+                }
+            ];
+            candidates.set(path, candidate);
         }
     });
 }
 // Vector expansion at the swept flat-region constants (pool = fetch), folded into `candidates`
 // at this signal's weight; each row also carries its best chunk's line range and similarity.
-export async function vectorsCandidates(store, prepared, candidates, fetch, allowedPaths, totalPaths, weight) {
+export async function vectorsCandidates(store, prepared, candidates, fetch, allowedPaths, totalPaths, weight, explain = false) {
     const chunkLines = new Map();
     const chunkSimilarity = new Map();
     const vec = await withMaterializedVectorScope(store, allowedPaths, ()=>semanticCandidates(store, prepared, fetch, allowedPaths), totalPaths);
     vec.forEach(({ path, lines, similarity }, i)=>{
+        const contribution = weight / (RRF_K + i);
         chunkLines.set(path, lines);
         chunkSimilarity.set(path, similarity);
         const existing = candidates.get(path);
         if (existing) {
-            existing.score += weight / (RRF_K + i);
+            existing.score += contribution;
+            if (explain) {
+                var _existing, _explanation;
+                (_explanation = (_existing = existing).explanation) !== null && _explanation !== void 0 ? _explanation : _existing.explanation = [];
+                existing.explanation.push({
+                    signal: 'vectors',
+                    rank: i + 1,
+                    weight,
+                    contribution
+                });
+            }
             existing.via = withVector(existing.via);
         } else {
-            candidates.set(path, {
-                score: weight / (RRF_K + i),
+            const candidate = {
+                score: contribution,
                 via: 'vector'
-            });
+            };
+            if (explain) candidate.explanation = [
+                {
+                    signal: 'vectors',
+                    rank: i + 1,
+                    weight,
+                    contribution
+                }
+            ];
+            candidates.set(path, candidate);
         }
     });
     return {

package/dist/esm/commands/signals.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands/signals.ts"],"sourcesContent":["import type { PreparedSemanticQuery } from '../embed/query.ts';\nimport { semanticCandidates } from '../embed/query.ts';\nimport { LINK_EDGES_SQL, toEdges } from '../features/index.ts';\nimport { personalizedRank } from '../graph/graph.ts';\nimport type { LexicalHit, Store } from '../store/types.ts';\nimport { withMaterializedVectorScope } from './scope.ts';\n\n// RRF composes whatever the preset declares; the constant lives here since it belongs to\n// the fusion these three functions share, not to search() itself.\nconst RRF_K = 60;\n\nexport type SearchResultVia = 'match' | 'match+link' | 'link' | 'match+vector' | 'match+link+vector' | 'link+vector' | 'vector';\n\nexport type Candidates = Map<string, { score: number; via: SearchResultVia }>;\n\nfunction withVector(via: SearchResultVia): SearchResultVia {\n  if (via === 'match') return 'match+vector';\n  if (via === 'match+link') return 'match+link+vector';\n  if (via === 'link') return 'link+vector';\n  return via;\n}\n\n// BM25 match rows (store.lexical.query), folded into `candidates` by reciprocal rank scaled by\n// the preset's declared weight for this signal. Every other signal is seeded from its output.\nexport async function wordsCandidates(store: Store, candidates: Candidates, query: string, whereJoin: string, whereCond: string, scopeCond: string, fetch: number, weight: number): Promise<LexicalHit[]> {\n  const matchRows = await store.lexical.query(query, { whereJoin, whereCond, scopeCond, limit: fetch });\n  matchRows.forEach((r, i) => {\n    candidates.set(r.path, { score: weight / (RRF_K + i), via: 'match' });\n  });\n  return matchRows;\n}\n\n// Personalized-PageRank expansion from the word-match seeds, folded into `candidates` at this\n// signal's weight. A no-op when there is nothing to seed from (matchRows empty).\nexport async function linksCandidates(store: Store, candidates: Candidates, matchRows: LexicalHit[], allPaths: string[], allowedPaths: Set<string>, fetch: number, weight: number): Promise<void> {\n  if (matchRows.length === 0) return;\n  const stmt = await store.prepare(LINK_EDGES_SQL);\n  const edges = toEdges((await stmt.all()) as Array<{ src: string; dst: string }>);\n  if (edges.length === 0) return;\n  // Gates the label only, not the score: restart mass ranks every seed without an incident\n  // edge, but dropping it from the score reweights fusion (FEVER hit@10 0.997 -> 0.907).\n  const linked = new Set(edges.flat());\n  const seeds = new Map(matchRows.map((r, i) => [r.path, 1 / (i + 1)]));\n  const ranked = [...personalizedRank(allPaths, edges, seeds)]\n    .filter(([path, score]) => score > 1e-9 && allowedPaths.has(path))\n    .sort((a, b) => b[1] - a[1] || Buffer.compare(Buffer.from(a[0]), Buffer.from(b[0])))\n    .slice(0, fetch);\n  ranked.forEach(([path], i) => {\n    const existing = candidates.get(path);\n    if (existing) {\n      existing.score += weight / (RRF_K + i);\n      if (linked.has(path)) existing.via = 'match+link';\n    } else {\n      candidates.set(path, { score: weight / (RRF_K + i), via: 'link' });\n    }\n  });\n}\n\n// Vector expansion at the swept flat-region constants (pool = fetch), folded into `candidates`\n// at this signal's weight; each row also carries its best chunk's line range and similarity.\nexport async function vectorsCandidates(store: Store, prepared: PreparedSemanticQuery, candidates: Candidates, fetch: number, allowedPaths: Set<string>, totalPaths: number, weight: number): Promise<{ chunkLines: Map<string, string>; chunkSimilarity: Map<string, number> }> {\n  const chunkLines = new Map<string, string>();\n  const chunkSimilarity = new Map<string, number>();\n  const vec = await withMaterializedVectorScope(store, allowedPaths, () => semanticCandidates(store, prepared, fetch, allowedPaths), totalPaths);\n  vec.forEach(({ path, lines, similarity }, i) => {\n    chunkLines.set(path, lines);\n    chunkSimilarity.set(path, similarity);\n    const existing = candidates.get(path);\n    if (existing) {\n      existing.score += weight / (RRF_K + i);\n      existing.via = withVector(existing.via);\n    } else {\n      candidates.set(path, { score: weight / (RRF_K + i), via: 'vector' });\n    }\n  });\n  return { chunkLines, chunkSimilarity };\n}\n"],"names":["semanticCandidates","LINK_EDGES_SQL","toEdges","personalizedRank","withMaterializedVectorScope","RRF_K","withVector","via","wordsCandidates","store","candidates","query","whereJoin","whereCond","scopeCond","fetch","weight","matchRows","lexical","limit","forEach","r","i","set","path","score","linksCandidates","allPaths","allowedPaths","length","stmt","prepare","edges","all","linked","Set","flat","seeds","Map","map","ranked","filter","has","sort","a","b","Buffer","compare","from","slice","existing","get","vectorsCandidates","prepared","totalPaths","chunkLines","chunkSimilarity","vec","lines","similarity"],"mappings":"AACA,SAASA,kBAAkB,QAAQ,oBAAoB;AACvD,SAASC,cAAc,EAAEC,OAAO,QAAQ,uBAAuB;AAC/D,SAASC,gBAAgB,QAAQ,oBAAoB;AAErD,SAASC,2BAA2B,QAAQ,aAAa;AAEzD,yFAAyF;AACzF,kEAAkE;AAClE,MAAMC,QAAQ;AAMd,SAASC,WAAWC,GAAoB;IACtC,IAAIA,QAAQ,SAAS,OAAO;IAC5B,IAAIA,QAAQ,cAAc,OAAO;IACjC,IAAIA,QAAQ,QAAQ,OAAO;IAC3B,OAAOA;AACT;AAEA,+FAA+F;AAC/F,8FAA8F;AAC9F,OAAO,eAAeC,gBAAgBC,KAAY,EAAEC,UAAsB,EAAEC,KAAa,EAAEC,SAAiB,EAAEC,SAAiB,EAAEC,SAAiB,EAAEC,KAAa,EAAEC,MAAc;IAC/K,MAAMC,YAAY,MAAMR,MAAMS,OAAO,CAACP,KAAK,CAACA,OAAO;QAAEC;QAAWC;QAAWC;QAAWK,OAAOJ;IAAM;IACnGE,UAAUG,OAAO,CAAC,CAACC,GAAGC;QACpBZ,WAAWa,GAAG,CAACF,EAAEG,IAAI,EAAE;YAAEC,OAAOT,SAAUX,CAAAA,QAAQiB,CAAAA;YAAIf,KAAK;QAAQ;IACrE;IACA,OAAOU;AACT;AAEA,8FAA8F;AAC9F,iFAAiF;AACjF,OAAO,eAAeS,gBAAgBjB,KAAY,EAAEC,UAAsB,EAAEO,SAAuB,EAAEU,QAAkB,EAAEC,YAAyB,EAAEb,KAAa,EAAEC,MAAc;IAC/K,IAAIC,UAAUY,MAAM,KAAK,GAAG;IAC5B,MAAMC,OAAO,MAAMrB,MAAMsB,OAAO,CAAC9B;IACjC,MAAM+B,QAAQ9B,QAAS,MAAM4B,KAAKG,GAAG;IACrC,IAAID,MAAMH,MAAM,KAAK,GAAG;IACxB,yFAAyF;IACzF,uFAAuF;IACvF,MAAMK,SAAS,IAAIC,IAAIH,MAAMI,IAAI;IACjC,MAAMC,QAAQ,IAAIC,IAAIrB,UAAUsB,GAAG,CAAC,CAAClB,GAAGC,IAAM;YAACD,EAAEG,IAAI;YAAE,IAAKF,CAAAA,IAAI,CAAA;SAAG;IACnE,MAAMkB,SAAS;WAAIrC,iBAAiBwB,UAAUK,OAAOK;KAAO,CACzDI,MAAM,CAAC,CAAC,CAACjB,MAAMC,MAAM,GAAKA,QAAQ,QAAQG,aAAac,GAAG,CAAClB,OAC3DmB,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,IAAIE,OAAOC,OAAO,CAACD,OAAOE,IAAI,CAACJ,CAAC,CAAC,EAAE,GAAGE,OAAOE,IAAI,CAACH,CAAC,CAAC,EAAE,IAChFI,KAAK,CAAC,GAAGlC;IACZyB,OAAOpB,OAAO,CAAC,CAAC,CAACI,KAAK,EAAEF;QACtB,MAAM4B,WAAWxC,WAAWyC,GAAG,CAAC3B;QAChC,IAAI0B,UAAU;YACZA,SAASzB,KAAK,IAAIT,SAAUX,CAAAA,QAAQiB,CAAAA;YACpC,IAAIY,OAAOQ,GAAG,CAAClB,OAAO0B,SAAS3C,GAAG,GAAG;QACvC,OAAO;YACLG,WAAWa,GAAG,CAACC,MAAM;gBAAEC,OAAOT,SAAUX,CAAAA,QAAQiB,CAAAA;gBAAIf,KAAK;YAAO;QAClE;IACF;AACF;AAEA,+FAA+F;AAC/F,6FAA6F;AAC7F,OAAO,eAAe6C,kBAAkB3C,KAAY,EAAE4C,QAA+B,EAAE3C,UAAsB,EAAEK,KAAa,EAAEa,YAAyB,EAAE0B,UAAkB,EAAEtC,MAAc;IACzL,MAAMuC,aAAa,IAAIjB;IACvB,MAAMkB,kBAAkB,IAAIlB;IAC5B,MAAMmB,MAAM,MAAMrD,4BAA4BK,OAAOmB,cAAc,IAAM5B,mBAAmBS,OAAO4C,UAAUtC,OAAOa,eAAe0B;IACnIG,IAAIrC,OAAO,CAAC,CAAC,EAAEI,IAAI,EAAEkC,KAAK,EAAEC,UAAU,EAAE,EAAErC;QACxCiC,WAAWhC,GAAG,CAACC,MAAMkC;QACrBF,gBAAgBjC,GAAG,CAACC,MAAMmC;QAC1B,MAAMT,WAAWxC,WAAWyC,GAAG,CAAC3B;QAChC,IAAI0B,UAAU;YACZA,SAASzB,KAAK,IAAIT,SAAUX,CAAAA,QAAQiB,CAAAA;YACpC4B,SAAS3C,GAAG,GAAGD,WAAW4C,SAAS3C,GAAG;QACxC,OAAO;YACLG,WAAWa,GAAG,CAACC,MAAM;gBAAEC,OAAOT,SAAUX,CAAAA,QAAQiB,CAAAA;gBAAIf,KAAK;YAAS;QACpE;IACF;IACA,OAAO;QAAEgD;QAAYC;IAAgB;AACvC"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands/signals.ts"],"sourcesContent":["import type { SignalName } from '../config/index.ts';\nimport type { PreparedSemanticQuery } from '../embed/query.ts';\nimport { semanticCandidates } from '../embed/query.ts';\nimport { LINK_EDGES_SQL, toEdges } from '../features/index.ts';\nimport { personalizedRank } from '../graph/graph.ts';\nimport type { LexicalHit, Store } from '../store/types.ts';\nimport { withMaterializedVectorScope } from './scope.ts';\n\n// RRF composes whatever the preset declares; the constant lives here since it belongs to\n// the fusion these three functions share, not to search() itself.\nconst RRF_K = 60;\n\nexport type SearchResultVia = 'match' | 'match+link' | 'link' | 'match+vector' | 'match+link+vector' | 'link+vector' | 'vector';\n\n/** One participating signal's contribution captured during the existing ranking computation. */\nexport interface SearchSignalContribution {\n  signal: SignalName;\n  /** One-based position; fusion uses weight / (60 + rank - 1). */\n  rank: number;\n  /** Effective weight from the selected preset. */\n  weight: number;\n  /** Unrounded value added to the fused score, independent of the rounded public score and via label. */\n  contribution: number;\n}\n\ninterface Candidate {\n  score: number;\n  via: SearchResultVia;\n  explanation?: SearchSignalContribution[];\n}\n\nexport type Candidates = Map<string, Candidate>;\n\nfunction withVector(via: SearchResultVia): SearchResultVia {\n  if (via === 'match') return 'match+vector';\n  if (via === 'match+link') return 'match+link+vector';\n  if (via === 'link') return 'link+vector';\n  return via;\n}\n\n// BM25 match rows (store.lexical.query), folded into `candidates` by reciprocal rank scaled by\n// the preset's declared weight for this signal. Every other signal is seeded from its output.\nexport async function wordsCandidates(store: Store, candidates: Candidates, query: string, whereJoin: string, whereCond: string, scopeCond: string, fetch: number, weight: number, explain = false): Promise<LexicalHit[]> {\n  const matchRows = await store.lexical.query(query, { whereJoin, whereCond, scopeCond, limit: fetch });\n  matchRows.forEach((r, i) => {\n    const contribution = weight / (RRF_K + i);\n    const candidate: Candidate = { score: contribution, via: 'match' };\n    if (explain) candidate.explanation = [{ signal: 'words', rank: i + 1, weight, contribution }];\n    candidates.set(r.path, candidate);\n  });\n  return matchRows;\n}\n\n// Personalized-PageRank expansion from the word-match seeds, folded into `candidates` at this\n// signal's weight. A no-op when there is nothing to seed from (matchRows empty).\nexport async function linksCandidates(store: Store, candidates: Candidates, matchRows: LexicalHit[], allPaths: string[], allowedPaths: Set<string>, fetch: number, weight: number, explain = false): Promise<void> {\n  if (matchRows.length === 0) return;\n  const stmt = await store.prepare(LINK_EDGES_SQL);\n  const edges = toEdges((await stmt.all()) as Array<{ src: string; dst: string }>);\n  if (edges.length === 0) return;\n  // Gates the label only, not the score: restart mass ranks every seed without an incident\n  // edge, but dropping it from the score reweights fusion (FEVER hit@10 0.997 -> 0.907).\n  const linked = new Set(edges.flat());\n  const seeds = new Map(matchRows.map((r, i) => [r.path, 1 / (i + 1)]));\n  const ranked = [...personalizedRank(allPaths, edges, seeds)]\n    .filter(([path, score]) => score > 1e-9 && allowedPaths.has(path))\n    .sort((a, b) => b[1] - a[1] || Buffer.compare(Buffer.from(a[0]), Buffer.from(b[0])))\n    .slice(0, fetch);\n  ranked.forEach(([path], i) => {\n    const contribution = weight / (RRF_K + i);\n    const existing = candidates.get(path);\n    if (existing) {\n      existing.score += contribution;\n      if (explain) {\n        existing.explanation ??= [];\n        existing.explanation.push({ signal: 'links', rank: i + 1, weight, contribution });\n      }\n      if (linked.has(path)) existing.via = 'match+link';\n    } else {\n      const candidate: Candidate = { score: contribution, via: 'link' };\n      if (explain) candidate.explanation = [{ signal: 'links', rank: i + 1, weight, contribution }];\n      candidates.set(path, candidate);\n    }\n  });\n}\n\n// Vector expansion at the swept flat-region constants (pool = fetch), folded into `candidates`\n// at this signal's weight; each row also carries its best chunk's line range and similarity.\nexport async function vectorsCandidates(store: Store, prepared: PreparedSemanticQuery, candidates: Candidates, fetch: number, allowedPaths: Set<string>, totalPaths: number, weight: number, explain = false): Promise<{ chunkLines: Map<string, string>; chunkSimilarity: Map<string, number> }> {\n  const chunkLines = new Map<string, string>();\n  const chunkSimilarity = new Map<string, number>();\n  const vec = await withMaterializedVectorScope(store, allowedPaths, () => semanticCandidates(store, prepared, fetch, allowedPaths), totalPaths);\n  vec.forEach(({ path, lines, similarity }, i) => {\n    const contribution = weight / (RRF_K + i);\n    chunkLines.set(path, lines);\n    chunkSimilarity.set(path, similarity);\n    const existing = candidates.get(path);\n    if (existing) {\n      existing.score += contribution;\n      if (explain) {\n        existing.explanation ??= [];\n        existing.explanation.push({ signal: 'vectors', rank: i + 1, weight, contribution });\n      }\n      existing.via = withVector(existing.via);\n    } else {\n      const candidate: Candidate = { score: contribution, via: 'vector' };\n      if (explain) candidate.explanation = [{ signal: 'vectors', rank: i + 1, weight, contribution }];\n      candidates.set(path, candidate);\n    }\n  });\n  return { chunkLines, chunkSimilarity };\n}\n"],"names":["semanticCandidates","LINK_EDGES_SQL","toEdges","personalizedRank","withMaterializedVectorScope","RRF_K","withVector","via","wordsCandidates","store","candidates","query","whereJoin","whereCond","scopeCond","fetch","weight","explain","matchRows","lexical","limit","forEach","r","i","contribution","candidate","score","explanation","signal","rank","set","path","linksCandidates","allPaths","allowedPaths","length","stmt","prepare","edges","all","linked","Set","flat","seeds","Map","map","ranked","filter","has","sort","a","b","Buffer","compare","from","slice","existing","get","push","vectorsCandidates","prepared","totalPaths","chunkLines","chunkSimilarity","vec","lines","similarity"],"mappings":"AAEA,SAASA,kBAAkB,QAAQ,oBAAoB;AACvD,SAASC,cAAc,EAAEC,OAAO,QAAQ,uBAAuB;AAC/D,SAASC,gBAAgB,QAAQ,oBAAoB;AAErD,SAASC,2BAA2B,QAAQ,aAAa;AAEzD,yFAAyF;AACzF,kEAAkE;AAClE,MAAMC,QAAQ;AAuBd,SAASC,WAAWC,GAAoB;IACtC,IAAIA,QAAQ,SAAS,OAAO;IAC5B,IAAIA,QAAQ,cAAc,OAAO;IACjC,IAAIA,QAAQ,QAAQ,OAAO;IAC3B,OAAOA;AACT;AAEA,+FAA+F;AAC/F,8FAA8F;AAC9F,OAAO,eAAeC,gBAAgBC,KAAY,EAAEC,UAAsB,EAAEC,KAAa,EAAEC,SAAiB,EAAEC,SAAiB,EAAEC,SAAiB,EAAEC,KAAa,EAAEC,MAAc,EAAEC,UAAU,KAAK;IAChM,MAAMC,YAAY,MAAMT,MAAMU,OAAO,CAACR,KAAK,CAACA,OAAO;QAAEC;QAAWC;QAAWC;QAAWM,OAAOL;IAAM;IACnGG,UAAUG,OAAO,CAAC,CAACC,GAAGC;QACpB,MAAMC,eAAeR,SAAUX,CAAAA,QAAQkB,CAAAA;QACvC,MAAME,YAAuB;YAAEC,OAAOF;YAAcjB,KAAK;QAAQ;QACjE,IAAIU,SAASQ,UAAUE,WAAW,GAAG;YAAC;gBAAEC,QAAQ;gBAASC,MAAMN,IAAI;gBAAGP;gBAAQQ;YAAa;SAAE;QAC7Fd,WAAWoB,GAAG,CAACR,EAAES,IAAI,EAAEN;IACzB;IACA,OAAOP;AACT;AAEA,8FAA8F;AAC9F,iFAAiF;AACjF,OAAO,eAAec,gBAAgBvB,KAAY,EAAEC,UAAsB,EAAEQ,SAAuB,EAAEe,QAAkB,EAAEC,YAAyB,EAAEnB,KAAa,EAAEC,MAAc,EAAEC,UAAU,KAAK;IAChM,IAAIC,UAAUiB,MAAM,KAAK,GAAG;IAC5B,MAAMC,OAAO,MAAM3B,MAAM4B,OAAO,CAACpC;IACjC,MAAMqC,QAAQpC,QAAS,MAAMkC,KAAKG,GAAG;IACrC,IAAID,MAAMH,MAAM,KAAK,GAAG;IACxB,yFAAyF;IACzF,uFAAuF;IACvF,MAAMK,SAAS,IAAIC,IAAIH,MAAMI,IAAI;IACjC,MAAMC,QAAQ,IAAIC,IAAI1B,UAAU2B,GAAG,CAAC,CAACvB,GAAGC,IAAM;YAACD,EAAES,IAAI;YAAE,IAAKR,CAAAA,IAAI,CAAA;SAAG;IACnE,MAAMuB,SAAS;WAAI3C,iBAAiB8B,UAAUK,OAAOK;KAAO,CACzDI,MAAM,CAAC,CAAC,CAAChB,MAAML,MAAM,GAAKA,QAAQ,QAAQQ,aAAac,GAAG,CAACjB,OAC3DkB,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,IAAIE,OAAOC,OAAO,CAACD,OAAOE,IAAI,CAACJ,CAAC,CAAC,EAAE,GAAGE,OAAOE,IAAI,CAACH,CAAC,CAAC,EAAE,IAChFI,KAAK,CAAC,GAAGxC;IACZ+B,OAAOzB,OAAO,CAAC,CAAC,CAACU,KAAK,EAAER;QACtB,MAAMC,eAAeR,SAAUX,CAAAA,QAAQkB,CAAAA;QACvC,MAAMiC,WAAW9C,WAAW+C,GAAG,CAAC1B;QAChC,IAAIyB,UAAU;YACZA,SAAS9B,KAAK,IAAIF;YAClB,IAAIP,SAAS;oBACXuC,WAAAA;iBAAAA,eAAAA,CAAAA,YAAAA,UAAS7B,WAAW,cAApB6B,0BAAAA,eAAAA,UAAS7B,WAAW,GAAK,EAAE;gBAC3B6B,SAAS7B,WAAW,CAAC+B,IAAI,CAAC;oBAAE9B,QAAQ;oBAASC,MAAMN,IAAI;oBAAGP;oBAAQQ;gBAAa;YACjF;YACA,IAAIgB,OAAOQ,GAAG,CAACjB,OAAOyB,SAASjD,GAAG,GAAG;QACvC,OAAO;YACL,MAAMkB,YAAuB;gBAAEC,OAAOF;gBAAcjB,KAAK;YAAO;YAChE,IAAIU,SAASQ,UAAUE,WAAW,GAAG;gBAAC;oBAAEC,QAAQ;oBAASC,MAAMN,IAAI;oBAAGP;oBAAQQ;gBAAa;aAAE;YAC7Fd,WAAWoB,GAAG,CAACC,MAAMN;QACvB;IACF;AACF;AAEA,+FAA+F;AAC/F,6FAA6F;AAC7F,OAAO,eAAekC,kBAAkBlD,KAAY,EAAEmD,QAA+B,EAAElD,UAAsB,EAAEK,KAAa,EAAEmB,YAAyB,EAAE2B,UAAkB,EAAE7C,MAAc,EAAEC,UAAU,KAAK;IAC1M,MAAM6C,aAAa,IAAIlB;IACvB,MAAMmB,kBAAkB,IAAInB;IAC5B,MAAMoB,MAAM,MAAM5D,4BAA4BK,OAAOyB,cAAc,IAAMlC,mBAAmBS,OAAOmD,UAAU7C,OAAOmB,eAAe2B;IACnIG,IAAI3C,OAAO,CAAC,CAAC,EAAEU,IAAI,EAAEkC,KAAK,EAAEC,UAAU,EAAE,EAAE3C;QACxC,MAAMC,eAAeR,SAAUX,CAAAA,QAAQkB,CAAAA;QACvCuC,WAAWhC,GAAG,CAACC,MAAMkC;QACrBF,gBAAgBjC,GAAG,CAACC,MAAMmC;QAC1B,MAAMV,WAAW9C,WAAW+C,GAAG,CAAC1B;QAChC,IAAIyB,UAAU;YACZA,SAAS9B,KAAK,IAAIF;YAClB,IAAIP,SAAS;oBACXuC,WAAAA;iBAAAA,eAAAA,CAAAA,YAAAA,UAAS7B,WAAW,cAApB6B,0BAAAA,eAAAA,UAAS7B,WAAW,GAAK,EAAE;gBAC3B6B,SAAS7B,WAAW,CAAC+B,IAAI,CAAC;oBAAE9B,QAAQ;oBAAWC,MAAMN,IAAI;oBAAGP;oBAAQQ;gBAAa;YACnF;YACAgC,SAASjD,GAAG,GAAGD,WAAWkD,SAASjD,GAAG;QACxC,OAAO;YACL,MAAMkB,YAAuB;gBAAEC,OAAOF;gBAAcjB,KAAK;YAAS;YAClE,IAAIU,SAASQ,UAAUE,WAAW,GAAG;gBAAC;oBAAEC,QAAQ;oBAAWC,MAAMN,IAAI;oBAAGP;oBAAQQ;gBAAa;aAAE;YAC/Fd,WAAWoB,GAAG,CAACC,MAAMN;QACvB;IACF;IACA,OAAO;QAAEqC;QAAYC;IAAgB;AACvC"}

package/dist/esm/config/load.js

@@ -1,3 +1,4 @@
+import { channel } from 'node:diagnostics_channel';
 import { existsSync, readFileSync } from 'node:fs';
 import { dirname, join, resolve } from 'node:path';
 import { SenseError } from '../errors.js';
@@ -7,6 +8,7 @@ import { unknownConfigKeys, validateConfig, validateLegacyScan } from './validat
 // v1 and v2 were `scan`/`find`-shaped; v3 introduced `presets`. Only the former need the
 // legacy shape check before migrating.
 const FIRST_PRESET_VERSION = 3;
+const migrationReady = channel('sensemaking.config.migration-ready');
 // v1 -> v2 migration only: the features v2 introduced as opt-out (embed was opt-in then).
 const V2_OPT_OUT_NAMES = [
     'links',
@@ -282,6 +284,10 @@ export function loadConfig(explicitPath, options = {}) {
         migratedFrom = result.from;
         if (options.writeMigration !== false) {
             const migrated = `${JSON.stringify(cfg, null, 2)}\n`;
+            if (migrationReady.hasSubscribers) migrationReady.publish({
+                configPath,
+                from: migratedFrom
+            });
             try {
                 writeFileAtomic(configPath, migrated);
             } catch (err) {