sensemaking 0.24.7 → 0.25.1

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

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands/search.ts"],"sourcesContent":["import { readFileSync } from 'node:fs';\nimport { join } from 'node:path';\nimport { stemmer } from 'stemmer';\nimport type { ResolvedConfig } from '../config/index.ts';\nimport { embedConfig, featureEnabled, resolveSearch } from '../config/index.ts';\nimport { localModelMissing, MODEL_FILENAMES } from '../embed/store.ts';\nimport { SenseError } from '../errors.ts';\nimport type { Row } from '../output/output.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 { linksCandidates, vectorsCandidates, wordsCandidates } 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\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\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}\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: Row[], 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  for (const row of rows) {\n    if (!matchedPaths.has(row.path as string)) continue;\n    let text: string;\n    try {\n      text = readFileSync(join(cfg.rootDir ?? cfg.baseDir, row.path as string), 'utf8');\n    } catch {\n      continue; // vanished since the match; leave snippets/lines empty rather than throw\n    }\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 as string, lineNumberAt(text, offset)) : null;\n  }\n}\n\n// The declared or defaulted signals compose via RRF; `via` names which ones produced each row.\n// `opts` arrives already resolved (config.ts:resolveSearch).\nexport async function search(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<Row[]> {\n  validateSearchOptions(opts);\n  const effective = resolveSearch(cfg, opts);\n  const { k, signals } = effective;\n\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  const scopeActive = scopePaths.size < allPaths.length;\n  // The set every candidate pool must be filtered to before truncation: scope narrowed by\n  // --where, the same composition scopedPaths() gives the other commands.\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 fetch = Math.max(k * 3, 30);\n\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 = 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 \"${effective.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  const semanticEnabled = wantsVectors && (await scopeHasEmbeddings(store, cfg, allowedPaths));\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 = new Map<string, { score: number; via: string }>();\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) {\n    ({ chunkLines, chunkSimilarity } = await vectorsCandidates(store, cfg, candidates, terms, fetch, allowedPaths, signals.vectors as number));\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 LIMIT ?`\n  );\n  const rows = (await selectStmt.all(k)) as Row[];\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":["readFileSync","join","stemmer","embedConfig","featureEnabled","resolveSearch","localModelMissing","MODEL_FILENAMES","SenseError","bareTermSyntaxError","searchError","foldForSearch","hasUnspacedRun","searchTokens","unspacedRuns","materializeScope","narrowByWhere","rawScope","scopeHasEmbeddings","linksCandidates","vectorsCandidates","wordsCandidates","SNIPPET_CHAR_LIMIT_DEFAULT","SNIPPET_COUNT_LIMIT_DEFAULT","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","rootDir","baseDir","lines","search","effective","signals","allPaths","all","r","scopePaths","scopeActive","allowedPaths","where","err","fetch","wantsVectors","vectors","presetName","model","semanticEnabled","scope","whereJoin","whereCond","scopeCond","matchRows","hasEmptyPhrase","matchAll","test","hasBareSyntaxOnly","words","syntaxError","links","chunkLines","chunkSimilarity","exec","runBatch","score","via","similarityCol","selectStmt"],"mappings":"AAAA,SAASA,YAAY,QAAQ,UAAU;AACvC,SAASC,IAAI,QAAQ,YAAY;AACjC,SAASC,OAAO,QAAQ,UAAU;AAElC,SAASC,WAAW,EAAEC,cAAc,EAAEC,aAAa,QAAQ,qBAAqB;AAChF,SAASC,iBAAiB,EAAEC,eAAe,QAAQ,oBAAoB;AACvE,SAASC,UAAU,QAAQ,eAAe;AAE1C,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;AAC3F,SAASC,eAAe,EAAEC,iBAAiB,EAAEC,eAAe,QAAQ,eAAe;AAEnF,8FAA8F;AAC9F,mGAAmG;AACnG,OAAO,MAAMC,6BAA6B,GAAG;AAC7C,OAAO,MAAMC,8BAA8B,EAAE;AAE7C,yFAAyF;AACzF,oGAAoG;AACpG,SAASC,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,MAAQjB,aAAaiB,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,CAACvB;IACnC,IAAI8B,cAAcN,MAAM,GAAG,GAAG;QAC5B,KAAK,MAAMO,OAAO7B,aAAakB,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,CAAC1C,eAAe0C;IACxD,IAAID,YAAYjB,MAAM,GAAG,GAAG;QAC1B,MAAMmB,aAAa,IAAIC,IAAIH,YAAYxB,GAAG,CAAC,CAACyB,IAAM;gBAACpD,QAAQS,cAAc2C;gBAAKA;aAAE;QAChF,MAAMG,eAAe,IAAIC,IAAIC,MAAMC,IAAI,CAACL,WAAWM,IAAI,IAAI,CAACb,OAASA,IAAI,CAAC,EAAE;QAC5E,KAAK,MAAMc,SAASjD,aAAamB,MAAO;YACtC,MAAM+B,UAAUD,MAAM9B,IAAI;YAC1B,IAAI8B,MAAME,QAAQ,EAAE;YACpB,MAAMC,SAAStD,cAAcoD;YAC7B,2FAA2F;YAC3F,IAAI,CAACN,aAAaS,GAAG,CAACD,MAAM,CAAC,EAAE,GAAG;YAClC,MAAMjB,OAAOO,WAAWY,GAAG,CAACjE,QAAQ+D;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;AAaA,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,IAAIvI,WAAW,yBAAyB,CAAC,eAAe,EAAEsI,KAAK,yCAAyC,EAAEQ,OAAOP,QAAQ;QACjI;IACF;AACF;AAEA,8FAA8F;AAC9F,OAAO,eAAeQ,kBAAkBlB,KAAY,EAAEmB,GAAmB,EAAEC,IAAW,EAAEC,YAAyB,EAAEnH,KAAa,EAAEsG,OAAsE,CAAC,CAAC;QAGtLA,wBACCA;IAHnB,IAAIa,aAAavC,IAAI,KAAK,GAAG;IAC7B,MAAMwC,YAAYnI,iBAAiBe;IACnC,MAAMiD,aAAYqD,yBAAAA,KAAKI,gBAAgB,cAArBJ,oCAAAA,yBAAyBvH;IAC3C,MAAMgG,cAAauB,0BAAAA,KAAKK,iBAAiB,cAAtBL,qCAAAA,0BAA0BtH;IAC7C,KAAK,MAAMkH,OAAOgB,KAAM;QACtB,IAAI,CAACC,aAAaxF,GAAG,CAACuE,IAAIH,IAAI,GAAa;QAC3C,IAAItG;QACJ,IAAI;gBACuBwH;YAAzBxH,OAAOhC,aAAaC,MAAKuJ,eAAAA,IAAII,OAAO,cAAXJ,0BAAAA,eAAeA,IAAIK,OAAO,EAAEpB,IAAIH,IAAI,GAAa;QAC5E,EAAE,OAAM;YACN,UAAU,yEAAyE;QACrF;QACA,MAAM,EAAEP,QAAQ,EAAEC,MAAM,EAAE,GAAGH,gBAAgB7F,MAAM2H,WAAWnE,WAAW8B;QACzEmB,IAAIV,QAAQ,GAAGA;QACf,IAAIU,IAAIqB,KAAK,IAAI,MAAMrB,IAAIqB,KAAK,GAAG1J,eAAeoJ,KAAK,cAAc,MAAMpB,aAAaC,OAAOI,IAAIH,IAAI,EAAYL,aAAajG,MAAMgG,WAAW;IACnJ;AACF;AAEA,+FAA+F;AAC/F,6DAA6D;AAC7D,OAAO,eAAe+B,OAAO1B,KAAY,EAAEmB,GAAmB,EAAEjH,KAAa,EAAEsG,OAAsB,CAAC,CAAC;IACrGD,sBAAsBC;IACtB,MAAMmB,YAAY3J,cAAcmJ,KAAKX;IACrC,MAAM,EAAEG,CAAC,EAAEiB,OAAO,EAAE,GAAGD;IAEvB,MAAME,WAAW,AAAE,CAAA,MAAM,AAAC,CAAA,MAAM7B,MAAMG,OAAO,CAAC,iCAAgC,EAAG2B,GAAG,EAAC,EAA+BtI,GAAG,CAAC,CAACuI,IAAMA,EAAE9B,IAAI;IACrI,MAAM+B,aAAa,MAAMpJ,SAASoH,OAAOmB,KAAKX,MAAMqB;IACpD,MAAMI,cAAcD,WAAWlD,IAAI,GAAG+C,SAAS9H,MAAM;IACrD,wFAAwF;IACxF,wEAAwE;IACxE,IAAImI;IACJ,IAAI;QACFA,eAAe,MAAMvJ,cAAcqH,OAAOgC,YAAYL,UAAUQ,KAAK;IACvE,EAAE,OAAOC,KAAK;QACZ,MAAM/J,YAAY+J,KAAclI,OAAOyH,UAAUQ,KAAK;IACxD;IACA,MAAME,QAAQhF,KAAKsB,GAAG,CAACgC,IAAI,GAAG;IAE9B,oFAAoF;IACpF,0FAA0F;IAC1F,MAAM2B,eAAeV,QAAQW,OAAO,KAAKxG;IACzC,IAAIuG,cAAc;QAChB,MAAM1D,IAAI9G,YAAYqJ,MAAM,oEAAoE;QAChG,IAAIlJ,kBAAkB2G,IAAI;YACxB,MAAM,IAAIzG,WAAW,uBAAuB,CAAC,QAAQ,EAAEwJ,UAAUa,UAAU,CAAC,mDAAmD,EAAE5D,EAAE6D,KAAK,CAAC,aAAa,EAAEvK,gBAAgB,uHAAuH,CAAC;QAClS;IACF;IACA,MAAMwK,kBAAkBJ,gBAAiB,MAAMzJ,mBAAmBmH,OAAOmB,KAAKe;IAE9E,2FAA2F;IAC3F,kEAAkE;IAClE,MAAMS,QAAQhB,UAAUQ,KAAK;IAC7B,MAAMS,YAAYD,QAAQ,CAAC,6CAA6C,CAAC,GAAG;IAC5E,MAAME,YAAYF,QAAQ,CAAC,KAAK,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC7C,yFAAyF;IACzF,2GAA2G;IAC3G,IAAIV,aAAa,MAAMvJ,iBAAiBsH,OAAO,iBAAiBgC;IAChE,MAAMc,YAAYb,cAAc,CAAC,sDAAsD,CAAC,GAAG;IAE3F,MAAM5D,aAAa,IAAIlD;IACvB,IAAI4H,YAA0B,EAAE;IAChC,MAAMC,iBAAiB;WAAI9I,MAAM+I,QAAQ,CAAC;KAAc,CAAC5D,IAAI,CAAC,CAAC5D,QAAU,CAAC,iBAAiByH,IAAI,CAACzH,KAAK,CAAC,EAAE;IACxG,MAAM0H,oBAAoB,QAAQD,IAAI,CAAChJ,MAAMZ,OAAO,CAAC,YAAY;IACjE,6FAA6F;IAC7F,8FAA8F;IAC9F,IAAIsI,QAAQwB,KAAK,KAAKrH,aAAa7B,MAAML,IAAI,OAAO,MAAO,CAAA,iBAAiBqJ,IAAI,CAAChJ,UAAUiJ,iBAAgB,KAAM,CAACH,gBAAgB;QAChI,MAAMK,cAAcjL,oBAAoB8B;QACxC,IAAImJ,aAAa,MAAMA;QACvB,IAAI;YACFN,YAAY,MAAM/J,gBAAgBgH,OAAO3B,YAAYnE,OAAO0I,WAAWC,WAAWC,WAAWT,OAAOT,QAAQwB,KAAK;QACnH,EAAE,OAAOhB,KAAK;YACZ,MAAM/J,YAAY+J,KAAclI,OAAOyI;QACzC;IACF;IACA,uFAAuF;IACvF,qEAAqE;IACrE,MAAMtB,eAAe,IAAIhG,IAAI0H,UAAUvJ,GAAG,CAAC,CAACuI,IAAMA,EAAE9B,IAAI;IAExD,IAAI2B,QAAQ0B,KAAK,KAAKvH,WAAW,MAAMjD,gBAAgBkH,OAAO3B,YAAY0E,WAAWlB,UAAUK,cAAcG,OAAOT,QAAQ0B,KAAK;IAEjI,IAAIC,aAAa,IAAIpI;IACrB,IAAIqI,kBAAkB,IAAIrI;IAC1B,IAAIuH,iBAAiB;QAClB,CAAA,EAAEa,UAAU,EAAEC,eAAe,EAAE,GAAG,MAAMzK,kBAAkBiH,OAAOmB,KAAK9C,YAAYnE,OAAOmI,OAAOH,cAAcN,QAAQW,OAAO,CAAU;IAC1I;IAEA,MAAMvC,MAAMyD,IAAI,CAAC;IACjB,8FAA8F;IAC9F,kEAAkE;IAClE,MAAMzD,MAAMyD,IAAI,CAAC;IACjB,IAAIpF,WAAWS,IAAI,GAAG,GAAG;QACvB,MAAMkB,MAAM0D,QAAQ,CAClB,sFACA;eAAIrF;SAAW,CAAC7E,GAAG,CAAC,CAAC,CAACyG,MAAMb,EAAE;gBAA4BmE,iBAA8BC;mBAArD;gBAACvD;gBAAMb,EAAEuE,KAAK;gBAAEvE,EAAEwE,GAAG;iBAAEL,kBAAAA,WAAWzH,GAAG,CAACmE,mBAAfsD,6BAAAA,kBAAwB;iBAAMC,uBAAAA,gBAAgB1H,GAAG,CAACmE,mBAApBuD,kCAAAA,uBAA6B;aAAK;;IAE9H;IAEA,2FAA2F;IAC3F,qDAAqD;IACrD,MAAMrB,QAAQQ,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,MAAM9D,MAAMG,OAAO,CACpC,CAAC,uIAAuI,EAAE0D,cAAc;;OAErJ,EAAE1B,MAAM,oCAAoC,CAAC;IAElD,MAAMf,OAAQ,MAAM0C,WAAWhC,GAAG,CAACnB;IACnC,KAAK,MAAMP,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 { stemmer } from 'stemmer';\nimport type { ResolvedConfig } from '../config/index.ts';\nimport { embedConfig, featureEnabled, resolveSearch } from '../config/index.ts';\nimport { ensureDocumentEmbeddings } 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 type { Row } from '../output/output.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 { linksCandidates, vectorsCandidates, wordsCandidates } 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\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\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}\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: Row[], 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 as string)) 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 as string, lineNumberAt(text, offset)) : null;\n  }\n}\n\n// The declared or defaulted signals compose via RRF; `via` names which ones produced each row.\n// `opts` arrives already resolved (config.ts:resolveSearch).\nexport function search(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<Row[]> {\n  return serialQuery(store, () => searchIndexed(store, cfg, terms, opts));\n}\n\nasync function searchIndexed(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions): Promise<Row[]> {\n  validateSearchOptions(opts);\n  const effective = resolveSearch(cfg, opts);\n  const { k, signals } = effective;\n\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  const scopeActive = scopePaths.size < allPaths.length;\n  // The set every candidate pool must be filtered to before truncation: scope narrowed by\n  // --where, the same composition scopedPaths() gives the other commands.\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 fetch = Math.max(k * 3, 30);\n\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 = 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 \"${effective.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    await ensureDocumentEmbeddings(store, cfg, allowedPaths);\n  }\n  const semanticEnabled = wantsVectors && (await scopeHasEmbeddings(store, cfg, allowedPaths));\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 = new Map<string, { score: number; via: string }>();\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) {\n    ({ chunkLines, chunkSimilarity } = await vectorsCandidates(store, cfg, candidates, terms, fetch, allowedPaths, signals.vectors as number));\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 LIMIT ?`\n  );\n  const rows = (await selectStmt.all(k)) as Row[];\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":["stemmer","embedConfig","featureEnabled","resolveSearch","ensureDocumentEmbeddings","localModelMissing","MODEL_FILENAMES","SenseError","serialQuery","bareTermSyntaxError","searchError","foldForSearch","hasUnspacedRun","searchTokens","unspacedRuns","materializeScope","narrowByWhere","rawScope","scopeHasEmbeddings","linksCandidates","vectorsCandidates","wordsCandidates","SNIPPET_CHAR_LIMIT_DEFAULT","SNIPPET_COUNT_LIMIT_DEFAULT","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","searchIndexed","effective","signals","allPaths","all","r","scopePaths","scopeActive","allowedPaths","where","err","fetch","wantsVectors","vectors","presetName","model","semanticEnabled","scope","whereJoin","whereCond","scopeCond","matchRows","hasEmptyPhrase","matchAll","test","hasBareSyntaxOnly","words","syntaxError","links","chunkLines","chunkSimilarity","exec","runBatch","score","via","similarityCol","selectStmt"],"mappings":"AAAA,SAASA,OAAO,QAAQ,UAAU;AAElC,SAASC,WAAW,EAAEC,cAAc,EAAEC,aAAa,QAAQ,qBAAqB;AAChF,SAASC,wBAAwB,QAAQ,oBAAoB;AAC7D,SAASC,iBAAiB,EAAEC,eAAe,QAAQ,oBAAoB;AACvE,SAASC,UAAU,QAAQ,eAAe;AAC1C,SAASC,WAAW,QAAQ,yBAAyB;AAErD,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;AAC3F,SAASC,eAAe,EAAEC,iBAAiB,EAAEC,eAAe,QAAQ,eAAe;AAEnF,8FAA8F;AAC9F,mGAAmG;AACnG,OAAO,MAAMC,6BAA6B,GAAG;AAC7C,OAAO,MAAMC,8BAA8B,EAAE;AAE7C,yFAAyF;AACzF,oGAAoG;AACpG,SAASC,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,MAAQjB,aAAaiB,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,CAACvB;IACnC,IAAI8B,cAAcN,MAAM,GAAG,GAAG;QAC5B,KAAK,MAAMO,OAAO7B,aAAakB,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,CAAC1C,eAAe0C;IACxD,IAAID,YAAYjB,MAAM,GAAG,GAAG;QAC1B,MAAMmB,aAAa,IAAIC,IAAIH,YAAYxB,GAAG,CAAC,CAACyB,IAAM;gBAACtD,QAAQW,cAAc2C;gBAAKA;aAAE;QAChF,MAAMG,eAAe,IAAIC,IAAIC,MAAMC,IAAI,CAACL,WAAWM,IAAI,IAAI,CAACb,OAASA,IAAI,CAAC,EAAE;QAC5E,KAAK,MAAMc,SAASjD,aAAamB,MAAO;YACtC,MAAM+B,UAAUD,MAAM9B,IAAI;YAC1B,IAAI8B,MAAME,QAAQ,EAAE;YACpB,MAAMC,SAAStD,cAAcoD;YAC7B,2FAA2F;YAC3F,IAAI,CAACN,aAAaS,GAAG,CAACD,MAAM,CAAC,EAAE,GAAG;YAClC,MAAMjB,OAAOO,WAAWY,GAAG,CAACnE,QAAQiE;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;AAaA,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,IAAIxI,WAAW,yBAAyB,CAAC,eAAe,EAAEuI,KAAK,yCAAyC,EAAEQ,OAAOP,QAAQ;QACjI;IACF;AACF;AAEA,8FAA8F;AAC9F,OAAO,eAAeQ,kBAAkBlB,KAAY,EAAEmB,GAAmB,EAAEC,IAAW,EAAEC,YAAyB,EAAEnH,KAAa,EAAEsG,OAAsE,CAAC,CAAC;QAGtLA,wBACCA;IAHnB,IAAIa,aAAavC,IAAI,KAAK,GAAG;IAC7B,MAAMwC,YAAYnI,iBAAiBe;IACnC,MAAMiD,aAAYqD,yBAAAA,KAAKI,gBAAgB,cAArBJ,oCAAAA,yBAAyBvH;IAC3C,MAAMgG,cAAauB,0BAAAA,KAAKK,iBAAiB,cAAtBL,qCAAAA,0BAA0BtH;IAC7C,MAAMqI,aAAa,MAAMvB,MAAMG,OAAO,CAAC;IACvC,KAAK,MAAMC,OAAOgB,KAAM;QACtB,IAAI,CAACC,aAAaxF,GAAG,CAACuE,IAAIH,IAAI,GAAa;QAC3C,MAAMuB,SAAU,MAAMD,WAAWzF,GAAG,CAACsE,IAAIH,IAAI;QAC7C,IAAI,CAACuB,QAAQ,MAAM,IAAItJ,WAAW,mBAAmB,CAAC,mCAAmC,EAAE+I,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,GAAG5J,eAAesJ,KAAK,cAAc,MAAMpB,aAAaC,OAAOI,IAAIH,IAAI,EAAYL,aAAajG,MAAMgG,WAAW;IACnJ;AACF;AAEA,+FAA+F;AAC/F,6DAA6D;AAC7D,OAAO,SAAS+B,OAAO1B,KAAY,EAAEmB,GAAmB,EAAEjH,KAAa,EAAEsG,OAAsB,CAAC,CAAC;IAC/F,OAAOrI,YAAY6H,OAAO,IAAM2B,cAAc3B,OAAOmB,KAAKjH,OAAOsG;AACnE;AAEA,eAAemB,cAAc3B,KAAY,EAAEmB,GAAmB,EAAEjH,KAAa,EAAEsG,IAAmB;IAChGD,sBAAsBC;IACtB,MAAMoB,YAAY9J,cAAcqJ,KAAKX;IACrC,MAAM,EAAEG,CAAC,EAAEkB,OAAO,EAAE,GAAGD;IAEvB,MAAME,WAAW,AAAE,CAAA,MAAM,AAAC,CAAA,MAAM9B,MAAMG,OAAO,CAAC,iCAAgC,EAAG4B,GAAG,EAAC,EAA+BvI,GAAG,CAAC,CAACwI,IAAMA,EAAE/B,IAAI;IACrI,MAAMgC,aAAa,MAAMrJ,SAASoH,OAAOmB,KAAKX,MAAMsB;IACpD,MAAMI,cAAcD,WAAWnD,IAAI,GAAGgD,SAAS/H,MAAM;IACrD,wFAAwF;IACxF,wEAAwE;IACxE,IAAIoI;IACJ,IAAI;QACFA,eAAe,MAAMxJ,cAAcqH,OAAOiC,YAAYL,UAAUQ,KAAK;IACvE,EAAE,OAAOC,KAAK;QACZ,MAAMhK,YAAYgK,KAAcnI,OAAO0H,UAAUQ,KAAK;IACxD;IACA,MAAME,QAAQjF,KAAKsB,GAAG,CAACgC,IAAI,GAAG;IAE9B,oFAAoF;IACpF,0FAA0F;IAC1F,MAAM4B,eAAeV,QAAQW,OAAO,KAAKzG;IACzC,IAAIwG,cAAc;QAChB,MAAM3D,IAAIhH,YAAYuJ,MAAM,oEAAoE;QAChG,IAAInJ,kBAAkB4G,IAAI;YACxB,MAAM,IAAI1G,WAAW,uBAAuB,CAAC,QAAQ,EAAE0J,UAAUa,UAAU,CAAC,mDAAmD,EAAE7D,EAAE8D,KAAK,CAAC,aAAa,EAAEzK,gBAAgB,uHAAuH,CAAC;QAClS;QACA,MAAMF,yBAAyBiI,OAAOmB,KAAKgB;IAC7C;IACA,MAAMQ,kBAAkBJ,gBAAiB,MAAM1J,mBAAmBmH,OAAOmB,KAAKgB;IAE9E,2FAA2F;IAC3F,kEAAkE;IAClE,MAAMS,QAAQhB,UAAUQ,KAAK;IAC7B,MAAMS,YAAYD,QAAQ,CAAC,6CAA6C,CAAC,GAAG;IAC5E,MAAME,YAAYF,QAAQ,CAAC,KAAK,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC7C,yFAAyF;IACzF,2GAA2G;IAC3G,IAAIV,aAAa,MAAMxJ,iBAAiBsH,OAAO,iBAAiBiC;IAChE,MAAMc,YAAYb,cAAc,CAAC,sDAAsD,CAAC,GAAG;IAE3F,MAAM7D,aAAa,IAAIlD;IACvB,IAAI6H,YAA0B,EAAE;IAChC,MAAMC,iBAAiB;WAAI/I,MAAMgJ,QAAQ,CAAC;KAAc,CAAC7D,IAAI,CAAC,CAAC5D,QAAU,CAAC,iBAAiB0H,IAAI,CAAC1H,KAAK,CAAC,EAAE;IACxG,MAAM2H,oBAAoB,QAAQD,IAAI,CAACjJ,MAAMZ,OAAO,CAAC,YAAY;IACjE,6FAA6F;IAC7F,8FAA8F;IAC9F,IAAIuI,QAAQwB,KAAK,KAAKtH,aAAa7B,MAAML,IAAI,OAAO,MAAO,CAAA,iBAAiBsJ,IAAI,CAACjJ,UAAUkJ,iBAAgB,KAAM,CAACH,gBAAgB;QAChI,MAAMK,cAAclL,oBAAoB8B;QACxC,IAAIoJ,aAAa,MAAMA;QACvB,IAAI;YACFN,YAAY,MAAMhK,gBAAgBgH,OAAO3B,YAAYnE,OAAO2I,WAAWC,WAAWC,WAAWT,OAAOT,QAAQwB,KAAK;QACnH,EAAE,OAAOhB,KAAK;YACZ,MAAMhK,YAAYgK,KAAcnI,OAAO0I;QACzC;IACF;IACA,uFAAuF;IACvF,qEAAqE;IACrE,MAAMvB,eAAe,IAAIhG,IAAI2H,UAAUxJ,GAAG,CAAC,CAACwI,IAAMA,EAAE/B,IAAI;IAExD,IAAI4B,QAAQ0B,KAAK,KAAKxH,WAAW,MAAMjD,gBAAgBkH,OAAO3B,YAAY2E,WAAWlB,UAAUK,cAAcG,OAAOT,QAAQ0B,KAAK;IAEjI,IAAIC,aAAa,IAAIrI;IACrB,IAAIsI,kBAAkB,IAAItI;IAC1B,IAAIwH,iBAAiB;QAClB,CAAA,EAAEa,UAAU,EAAEC,eAAe,EAAE,GAAG,MAAM1K,kBAAkBiH,OAAOmB,KAAK9C,YAAYnE,OAAOoI,OAAOH,cAAcN,QAAQW,OAAO,CAAU;IAC1I;IAEA,MAAMxC,MAAM0D,IAAI,CAAC;IACjB,8FAA8F;IAC9F,kEAAkE;IAClE,MAAM1D,MAAM0D,IAAI,CAAC;IACjB,IAAIrF,WAAWS,IAAI,GAAG,GAAG;QACvB,MAAMkB,MAAM2D,QAAQ,CAClB,sFACA;eAAItF;SAAW,CAAC7E,GAAG,CAAC,CAAC,CAACyG,MAAMb,EAAE;gBAA4BoE,iBAA8BC;mBAArD;gBAACxD;gBAAMb,EAAEwE,KAAK;gBAAExE,EAAEyE,GAAG;iBAAEL,kBAAAA,WAAW1H,GAAG,CAACmE,mBAAfuD,6BAAAA,kBAAwB;iBAAMC,uBAAAA,gBAAgB3H,GAAG,CAACmE,mBAApBwD,kCAAAA,uBAA6B;aAAK;;IAE9H;IAEA,2FAA2F;IAC3F,qDAAqD;IACrD,MAAMrB,QAAQQ,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,MAAM/D,MAAMG,OAAO,CACpC,CAAC,uIAAuI,EAAE2D,cAAc;;OAErJ,EAAE1B,MAAM,oCAAoC,CAAC;IAElD,MAAMhB,OAAQ,MAAM2C,WAAWhC,GAAG,CAACpB;IACnC,KAAK,MAAMP,OAAOgB,KAAMhB,IAAIV,QAAQ,GAAG,EAAE;IAEzC,MAAMwB,kBAAkBlB,OAAOmB,KAAKC,MAAMC,cAAcnH,OAAOsG;IAE/D,OAAOY;AACT"}

package/dist/esm/config/index.d.ts

@@ -1,5 +1,5 @@
 export { anyPresetEmbeds, embedConfig, embedEnabled, enabledFeatures, featureEnabled, featureSignature, featureStates, presetHasSignal, presetNames, presetSignals, storeName } from './access.js';
-export type { InitOverrides } from './load.js';
+export type { InitOverrides, LoadConfigOptions } from './load.js';
 export { findConfigPath, initConfig, loadConfig, migrateConfig } from './load.js';
 export { resolvePreset, resolveSearch } from './resolve.js';
 export type { SignalName, SignalWeights } from './signals.js';

package/dist/esm/config/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/config/index.ts"],"sourcesContent":["export { anyPresetEmbeds, embedConfig, embedEnabled, enabledFeatures, featureEnabled, featureSignature, featureStates, presetHasSignal, presetNames, presetSignals, storeName } from './access.ts';\nexport type { InitOverrides } from './load.ts';\nexport { findConfigPath, initConfig, loadConfig, migrateConfig } from './load.ts';\nexport { resolvePreset, resolveSearch } from './resolve.ts';\nexport type { SignalName, SignalWeights } from './signals.ts';\nexport { SIGNAL_NAMES, SIGNAL_PREREQUISITES } from './signals.ts';\nexport type { Config, EffectiveSearch, EmbedConfig, FeatureName, Preset, ResolvedConfig, SavedQuery, SavedSearch, SearchOverrides, StoreName } from './types.ts';\nexport { CONFIG_FILENAME, DEFAULT_EMBED_MODEL, STATE_DIR, STORE_NAMES, SUPPORTED_CONFIG_VERSION } from './types.ts';\nexport { KNOWN_EMBED_KEYS } from './validate.ts';\n"],"names":["anyPresetEmbeds","embedConfig","embedEnabled","enabledFeatures","featureEnabled","featureSignature","featureStates","presetHasSignal","presetNames","presetSignals","storeName","findConfigPath","initConfig","loadConfig","migrateConfig","resolvePreset","resolveSearch","SIGNAL_NAMES","SIGNAL_PREREQUISITES","CONFIG_FILENAME","DEFAULT_EMBED_MODEL","STATE_DIR","STORE_NAMES","SUPPORTED_CONFIG_VERSION","KNOWN_EMBED_KEYS"],"mappings":"AAAA,SAASA,eAAe,EAAEC,WAAW,EAAEC,YAAY,EAAEC,eAAe,EAAEC,cAAc,EAAEC,gBAAgB,EAAEC,aAAa,EAAEC,eAAe,EAAEC,WAAW,EAAEC,aAAa,EAAEC,SAAS,QAAQ,cAAc;AAEnM,SAASC,cAAc,EAAEC,UAAU,EAAEC,UAAU,EAAEC,aAAa,QAAQ,YAAY;AAClF,SAASC,aAAa,EAAEC,aAAa,QAAQ,eAAe;AAE5D,SAASC,YAAY,EAAEC,oBAAoB,QAAQ,eAAe;AAElE,SAASC,eAAe,EAAEC,mBAAmB,EAAEC,SAAS,EAAEC,WAAW,EAAEC,wBAAwB,QAAQ,aAAa;AACpH,SAASC,gBAAgB,QAAQ,gBAAgB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/config/index.ts"],"sourcesContent":["export { anyPresetEmbeds, embedConfig, embedEnabled, enabledFeatures, featureEnabled, featureSignature, featureStates, presetHasSignal, presetNames, presetSignals, storeName } from './access.ts';\nexport type { InitOverrides, LoadConfigOptions } from './load.ts';\nexport { findConfigPath, initConfig, loadConfig, migrateConfig } from './load.ts';\nexport { resolvePreset, resolveSearch } from './resolve.ts';\nexport type { SignalName, SignalWeights } from './signals.ts';\nexport { SIGNAL_NAMES, SIGNAL_PREREQUISITES } from './signals.ts';\nexport type { Config, EffectiveSearch, EmbedConfig, FeatureName, Preset, ResolvedConfig, SavedQuery, SavedSearch, SearchOverrides, StoreName } from './types.ts';\nexport { CONFIG_FILENAME, DEFAULT_EMBED_MODEL, STATE_DIR, STORE_NAMES, SUPPORTED_CONFIG_VERSION } from './types.ts';\nexport { KNOWN_EMBED_KEYS } from './validate.ts';\n"],"names":["anyPresetEmbeds","embedConfig","embedEnabled","enabledFeatures","featureEnabled","featureSignature","featureStates","presetHasSignal","presetNames","presetSignals","storeName","findConfigPath","initConfig","loadConfig","migrateConfig","resolvePreset","resolveSearch","SIGNAL_NAMES","SIGNAL_PREREQUISITES","CONFIG_FILENAME","DEFAULT_EMBED_MODEL","STATE_DIR","STORE_NAMES","SUPPORTED_CONFIG_VERSION","KNOWN_EMBED_KEYS"],"mappings":"AAAA,SAASA,eAAe,EAAEC,WAAW,EAAEC,YAAY,EAAEC,eAAe,EAAEC,cAAc,EAAEC,gBAAgB,EAAEC,aAAa,EAAEC,eAAe,EAAEC,WAAW,EAAEC,aAAa,EAAEC,SAAS,QAAQ,cAAc;AAEnM,SAASC,cAAc,EAAEC,UAAU,EAAEC,UAAU,EAAEC,aAAa,QAAQ,YAAY;AAClF,SAASC,aAAa,EAAEC,aAAa,QAAQ,eAAe;AAE5D,SAASC,YAAY,EAAEC,oBAAoB,QAAQ,eAAe;AAElE,SAASC,eAAe,EAAEC,mBAAmB,EAAEC,SAAS,EAAEC,WAAW,EAAEC,wBAAwB,QAAQ,aAAa;AACpH,SAASC,gBAAgB,QAAQ,gBAAgB"}

package/dist/esm/config/load.d.ts

@@ -10,4 +10,9 @@ export interface InitOverrides {
 }
 export declare function initConfig(dir: string, overrides?: InitOverrides): string;
 export declare function findConfigPath(startDir: string): string | null;
-export declare function loadConfig(explicitPath?: string): ResolvedConfig;
+/** Controls whether loading an older config may persist its in-memory migration. */
+export interface LoadConfigOptions {
+    /** Write a successful migration back to the config file. Defaults to true. */
+    writeMigration?: boolean;
+}
+export declare function loadConfig(explicitPath?: string, options?: LoadConfigOptions): ResolvedConfig;

package/dist/esm/config/load.js

@@ -169,7 +169,13 @@ const MIGRATIONS = {
             result.presets = nextPresets;
         }
         return result;
-    }
+    },
+    // v5 -> v6: query-triggered builds are on by default. Preserve an explicit opt-out.
+    5: (cfg)=>({
+            ...cfg,
+            version: 6,
+            build: cfg.build === undefined ? true : cfg.build
+        })
 };
 export function migrateConfig(cfg) {
     var _cfg_version;
@@ -196,6 +202,7 @@ function starterConfig(overrides) {
     return {
         $schema: 'https://unpkg.com/sensemaking/schema.json',
         version: SUPPORTED_CONFIG_VERSION,
+        build: true,
         presets: {
             default: {
                 include: [
@@ -238,7 +245,7 @@ export function findConfigPath(startDir) {
         dir = parent;
     }
 }
-export function loadConfig(explicitPath) {
+export function loadConfig(explicitPath, options = {}) {
     var _cfg_root;
     let configPath;
     if (explicitPath) {
@@ -273,7 +280,29 @@ export function loadConfig(explicitPath) {
         const result = migrateConfig(parsed);
         cfg = validateConfig(result.cfg, configPath);
         migratedFrom = result.from;
-        writeFileAtomic(configPath, `${JSON.stringify(cfg, null, 2)}\n`);
+        if (options.writeMigration !== false) {
+            const migrated = `${JSON.stringify(cfg, null, 2)}\n`;
+            try {
+                writeFileAtomic(configPath, migrated);
+            } catch (err) {
+                var _errno_code;
+                // Only a rename-contention error might already be published by a racing writer.
+                // Any other failure, including a failed initial write, rethrows immediately.
+                const errno = err;
+                if (!(err instanceof Error) || errno.syscall !== 'rename' || ![
+                    'EPERM',
+                    'EACCES',
+                    'EBUSY'
+                ].includes((_errno_code = errno.code) !== null && _errno_code !== void 0 ? _errno_code : '')) throw err;
+                let existing;
+                try {
+                    existing = readFileSync(configPath, 'utf8');
+                } catch  {
+                    throw err;
+                }
+                if (existing !== migrated) throw err;
+            }
+        }
     } else {
         cfg = validateConfig(parsed, configPath);
     }

package/dist/esm/config/load.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/config/load.ts"],"sourcesContent":["import { existsSync, readFileSync } from 'node:fs';\nimport { dirname, join, resolve } from 'node:path';\nimport { SenseError } from '../errors.ts';\nimport { writeFileAtomic } from '../lib/atomic-write.ts';\nimport type { Config, ResolvedConfig } from './types.ts';\nimport { CONFIG_FILENAME, DEFAULT_EMBED_MODEL, SUPPORTED_CONFIG_VERSION } from './types.ts';\nimport { unknownConfigKeys, validateConfig, validateLegacyScan } from './validate.ts';\n\n// v1 and v2 were `scan`/`find`-shaped; v3 introduced `presets`. Only the former need the\n// legacy shape check before migrating.\nconst FIRST_PRESET_VERSION = 3;\n\n// v1 -> v2 migration only: the features v2 introduced as opt-out (embed was opt-in then).\nconst V2_OPT_OUT_NAMES = ['links', 'sections', 'rank'] as const;\n\n// Pure per-version steps, chained by loadConfig. Intermediate shapes predate the Config type,\n// so steps are loosely typed and only the final result is cast back.\nconst MIGRATIONS: Record<number, (cfg: Record<string, unknown>) => Record<string, unknown>> = {\n  // v1 -> v2: features block introduced, opt-out features enabled (matches the old implicit\n  // behavior of `links` etc. not existing). embed stays absent -- opt-in.\n  1: (cfg) => ({ ...cfg, version: 2, features: Object.fromEntries(V2_OPT_OUT_NAMES.map((name) => [name, true])) }),\n  // v2 -> v3: mechanical-minimal by decision -- only what keeps an existing config loading (no\n  // restructuring, no preset inference, no query rewriting); real trees get hand-migrated to use presets.\n  2: (cfg) => {\n    const { scan, defaults, features, checks, queries, ...rest } = cfg;\n    const scanInclude = (scan as { include: string[] }).include;\n\n    const nextQueries: Record<string, unknown> = {};\n    for (const [name, value] of Object.entries((queries as Record<string, unknown> | undefined) ?? {})) {\n      if (typeof value === 'string') {\n        nextQueries[name] = value;\n        continue;\n      }\n      const entry = value as { find: string; k?: number; where?: string; semantic?: boolean };\n      // Loosely typed on purpose: this step emits the v3 shape, which still had `semantic`.\n      // The v3 -> v4 step below strips it.\n      const search: Record<string, unknown> = { search: entry.find };\n      if (entry.k !== undefined) search.k = entry.k;\n      if (entry.where !== undefined) search.where = entry.where;\n      // semantic: true was opt-in; it is now the default, so it drops. semantic: false is kept.\n      if (entry.semantic === false) search.semantic = false;\n      nextQueries[name] = search;\n    }\n\n    const prevDefaults = defaults as { find?: { where?: string } } | undefined;\n    const defaultWhere = prevDefaults?.find?.where;\n\n    // features.embed false becomes semantic:false on every preset produced here.\n    const prevFeatures = (features as Record<string, unknown> | undefined) ?? {};\n    const embedWasOff = prevFeatures.embed === false;\n    // Object form carries provider settings (model/type/url/key), not a toggle -- they move to\n    // the v3 top-level `embed` block verbatim; dropping them would silently switch an api tree to the static model.\n    const embedProvider = typeof prevFeatures.embed === 'object' && prevFeatures.embed !== null ? prevFeatures.embed : undefined;\n    const { embed: _embed, ...restFeatures } = prevFeatures;\n\n    const defaultPreset: Record<string, unknown> = { include: scanInclude };\n    if (defaultWhere !== undefined) defaultPreset.where = defaultWhere;\n    if (embedWasOff) defaultPreset.semantic = false;\n\n    if (checks !== undefined) {\n      console.error('sense: v2 \"checks\" was removed in v3 (sense check no longer asserts on saved queries); its queries are carried over under \"queries\" -- a returned row set is now the reader\\'s judgment');\n    }\n\n    const result: Record<string, unknown> = { ...rest, version: 3, presets: { default: defaultPreset }, queries: nextQueries };\n    if (embedProvider !== undefined) result.embed = embedProvider;\n    if (Object.keys(restFeatures).length > 0) result.features = restFeatures;\n    return result;\n  },\n  // v3 -> v4: write the model into the file, wrap bare-string queries as { sql }, drop a saved\n  // search's `semantic` (its preset decides). Same effective model, so nothing re-embeds.\n  3: (cfg) => {\n    const presets = cfg.presets as Record<string, Record<string, unknown>>;\n    const embedded = Object.values(presets).some((p) => p.semantic !== false);\n\n    const nextQueries: Record<string, unknown> = {};\n    for (const [name, value] of Object.entries((cfg.queries as Record<string, unknown> | undefined) ?? {})) {\n      // v3's bare string meant SQL by inference; v4 makes every entry name its verb.\n      if (typeof value === 'string') {\n        nextQueries[name] = { sql: value };\n        continue;\n      }\n      if (typeof value !== 'object' || value === null || !('search' in value)) {\n        nextQueries[name] = value;\n        continue;\n      }\n      const { semantic: _semantic, ...rest } = value as Record<string, unknown>;\n      nextQueries[name] = rest;\n    }\n\n    const prev = (cfg.embed as Record<string, unknown> | undefined) ?? {};\n    const result: Record<string, unknown> = { ...cfg, version: 4, queries: nextQueries };\n    if (embedded) {\n      result.embed = { model: (prev.model as string | undefined) ?? DEFAULT_EMBED_MODEL, type: (prev.type as string | undefined) ?? 'static', ...(prev.url !== undefined ? { url: prev.url } : {}), ...(prev.key !== undefined ? { key: prev.key } : {}) };\n    } else {\n      delete result.embed;\n      // Dropping settings silently would look like a bug in a tree that configured an api endpoint\n      // then turned vectors off; say it, since v4 has no way to carry provider settings for a tree that doesn't embed.\n      if (Object.keys(prev).length > 0) console.error('sense: every preset has \"semantic\": false, so v4 drops the \"embed\" block (vectors stay off); re-add it, or set a preset\\'s semantic back to true, to turn them on');\n    }\n    return result;\n  },\n  // v4 -> v5: embed.type renames to embed.provider (\"api\" migrates to \"openai\", the wire protocol\n  // it always was; other values pass through). A preset's `semantic` also migrates to `signals` (false -> explicit weights, true/absent -> no key).\n  4: (cfg) => {\n    const prevEmbed = cfg.embed as Record<string, unknown> | undefined;\n    const result: Record<string, unknown> = { ...cfg, version: 5 };\n    if (prevEmbed) {\n      const { type, ...rest } = prevEmbed;\n      result.embed = type === undefined ? rest : { ...rest, provider: type === 'api' ? 'openai' : type };\n    }\n\n    const linksOn = (cfg.features as Record<string, unknown> | undefined)?.links !== false;\n    const presets = cfg.presets as Record<string, Record<string, unknown>> | undefined;\n    if (presets) {\n      const nextPresets: Record<string, unknown> = {};\n      for (const [name, preset] of Object.entries(presets)) {\n        const { semantic, ...rest } = preset;\n        if (semantic === undefined) {\n          nextPresets[name] = preset;\n          continue;\n        }\n        if (typeof semantic !== 'boolean') {\n          throw new SenseError('CONFIG_INVALID', `presets.${name}.semantic must be a boolean`);\n        }\n        nextPresets[name] = semantic === false ? { ...rest, signals: linksOn ? { words: 1, links: 1 } : { words: 1 } } : rest;\n      }\n      result.presets = nextPresets;\n    }\n    return result;\n  },\n};\n\nexport function migrateConfig(cfg: Config): { cfg: Config; from: number } {\n  const from = cfg.version ?? 1;\n  let current: Record<string, unknown> = cfg as unknown as Record<string, unknown>;\n  for (let v = from; v < SUPPORTED_CONFIG_VERSION; v++) {\n    const step = MIGRATIONS[v];\n    if (!step) throw new SenseError('CONFIG_VERSION_UNSUPPORTED', `no migration from config version ${v}`);\n    current = step(current);\n  }\n  return { cfg: current as unknown as Config, from };\n}\n\n// `sense init`'s flags map onto these three `embed` keys one-to-one; an absent field\n// keeps the built-in default rather than merging partial input.\nexport interface InitOverrides {\n  model?: string;\n  provider?: string;\n  url?: string;\n}\n\nfunction starterConfig(overrides?: InitOverrides): Config {\n  const embed: Record<string, unknown> = { model: DEFAULT_EMBED_MODEL, provider: 'static' };\n  if (overrides?.model !== undefined) embed.model = overrides.model;\n  if (overrides?.provider !== undefined) embed.provider = overrides.provider;\n  if (overrides?.url !== undefined) embed.url = overrides.url;\n  return {\n    $schema: 'https://unpkg.com/sensemaking/schema.json',\n    version: SUPPORTED_CONFIG_VERSION,\n    presets: {\n      default: { include: ['**/*.md'], k: 10 },\n      large: { include: ['**/*.md'], k: 20 },\n    },\n    // Written out rather than defaulted in code: this line is what makes `sense download`\n    // fetch a model, so it belongs where it can be read and changed.\n    embed: embed as Config['embed'],\n    queries: {},\n  };\n}\n\n// Refuses to overwrite an existing config. `overrides` come from `sense init`'s flags; an\n// invalid --provider fails validateConfig's own shape check before anything is written.\nexport function initConfig(dir: string, overrides?: InitOverrides): string {\n  const configPath = join(dir, CONFIG_FILENAME);\n  if (existsSync(configPath)) {\n    throw new SenseError('CONFIG_EXISTS', `${CONFIG_FILENAME} already exists in ${dir}`);\n  }\n  const cfg = starterConfig(overrides);\n  validateConfig(cfg, configPath);\n  writeFileAtomic(configPath, `${JSON.stringify(cfg, null, 2)}\\n`);\n  return configPath;\n}\n\nexport function findConfigPath(startDir: string): string | null {\n  let dir = resolve(startDir);\n  for (;;) {\n    const candidate = join(dir, CONFIG_FILENAME);\n    if (existsSync(candidate)) return candidate;\n    const parent = dirname(dir);\n    if (parent === dir) return null;\n    dir = parent;\n  }\n}\n\nexport function loadConfig(explicitPath?: string): ResolvedConfig {\n  let configPath: string;\n  if (explicitPath) {\n    configPath = resolve(process.cwd(), explicitPath);\n    if (!existsSync(configPath)) throw new SenseError('CONFIG_NOT_FOUND', `config not found: ${configPath}`);\n  } else {\n    const found = findConfigPath(process.cwd());\n    if (!found) {\n      throw new SenseError('CONFIG_NOT_FOUND', `could not find ${CONFIG_FILENAME} in ${process.cwd()} or any parent directory`);\n    }\n    configPath = found;\n  }\n\n  const raw = readFileSync(configPath, 'utf8');\n  const parsed: unknown = JSON.parse(raw);\n\n  // Ahead of both the version gate and shape checks: a non-object file (or array -- typeof []\n  // is also 'object') is malformed at every version, so it gets one error regardless of branch.\n  if (typeof parsed !== 'object' || parsed === null || Array.isArray(parsed)) {\n    throw new SenseError('CONFIG_INVALID', `${configPath}: config must be a JSON object`);\n  }\n\n  // Version gate before shape validation: a config written by a newer sense should fail\n  // with \"requires a newer sense\", not with shape errors its own version may not have.\n  const version = typeof parsed === 'object' && parsed !== null && typeof (parsed as { version?: unknown }).version === 'number' ? (parsed as { version: number }).version : 1;\n  if (version > SUPPORTED_CONFIG_VERSION) {\n    throw new SenseError('CONFIG_VERSION_UNSUPPORTED', `config version ${version} requires a newer sense`);\n  }\n\n  // validateConfig only knows the current shape, so scan-shaped files (pre-v3) get a minimal\n  // check, migrate, then the full one on the result.\n  let cfg: Config;\n  let migratedFrom: number | undefined;\n  if (version < SUPPORTED_CONFIG_VERSION) {\n    if (version < FIRST_PRESET_VERSION) validateLegacyScan(parsed, configPath);\n    const result = migrateConfig(parsed as unknown as Config);\n    cfg = validateConfig(result.cfg, configPath);\n    migratedFrom = result.from;\n    writeFileAtomic(configPath, `${JSON.stringify(cfg, null, 2)}\\n`);\n  } else {\n    cfg = validateConfig(parsed, configPath);\n  }\n\n  const unknownKeys = unknownConfigKeys(cfg as unknown as Record<string, unknown>);\n  const configDir = dirname(configPath);\n  const rootDir = resolve(configDir, cfg.root ?? '.');\n  return { ...cfg, configDir, rootDir, baseDir: rootDir, configPath, migratedFrom, unknownKeys: unknownKeys.length > 0 ? unknownKeys : undefined };\n}\n"],"names":["existsSync","readFileSync","dirname","join","resolve","SenseError","writeFileAtomic","CONFIG_FILENAME","DEFAULT_EMBED_MODEL","SUPPORTED_CONFIG_VERSION","unknownConfigKeys","validateConfig","validateLegacyScan","FIRST_PRESET_VERSION","V2_OPT_OUT_NAMES","MIGRATIONS","cfg","version","features","Object","fromEntries","map","name","prevDefaults","scan","defaults","checks","queries","rest","scanInclude","include","nextQueries","value","entries","entry","search","find","k","undefined","where","semantic","defaultWhere","prevFeatures","embedWasOff","embed","embedProvider","_embed","restFeatures","defaultPreset","console","error","result","presets","default","keys","length","embedded","values","some","p","sql","_semantic","prev","model","type","url","key","prevEmbed","provider","linksOn","links","nextPresets","preset","signals","words","migrateConfig","from","current","v","step","starterConfig","overrides","$schema","large","initConfig","dir","configPath","JSON","stringify","findConfigPath","startDir","candidate","parent","loadConfig","explicitPath","process","cwd","found","raw","parsed","parse","Array","isArray","migratedFrom","unknownKeys","configDir","rootDir","root","baseDir"],"mappings":"AAAA,SAASA,UAAU,EAAEC,YAAY,QAAQ,UAAU;AACnD,SAASC,OAAO,EAAEC,IAAI,EAAEC,OAAO,QAAQ,YAAY;AACnD,SAASC,UAAU,QAAQ,eAAe;AAC1C,SAASC,eAAe,QAAQ,yBAAyB;AAEzD,SAASC,eAAe,EAAEC,mBAAmB,EAAEC,wBAAwB,QAAQ,aAAa;AAC5F,SAASC,iBAAiB,EAAEC,cAAc,EAAEC,kBAAkB,QAAQ,gBAAgB;AAEtF,yFAAyF;AACzF,uCAAuC;AACvC,MAAMC,uBAAuB;AAE7B,0FAA0F;AAC1F,MAAMC,mBAAmB;IAAC;IAAS;IAAY;CAAO;AAEtD,8FAA8F;AAC9F,qEAAqE;AACrE,MAAMC,aAAwF;IAC5F,0FAA0F;IAC1F,wEAAwE;IACxE,GAAG,CAACC,MAAS,CAAA;YAAE,GAAGA,GAAG;YAAEC,SAAS;YAAGC,UAAUC,OAAOC,WAAW,CAACN,iBAAiBO,GAAG,CAAC,CAACC,OAAS;oBAACA;oBAAM;iBAAK;QAAG,CAAA;IAC9G,6FAA6F;IAC7F,wGAAwG;IACxG,GAAG,CAACN;YAsBmBO;QArBrB,MAAM,EAAEC,IAAI,EAAEC,QAAQ,EAAEP,QAAQ,EAAEQ,MAAM,EAAEC,OAAO,EAAE,GAAGC,MAAM,GAAGZ;QAC/D,MAAMa,cAAc,AAACL,KAA+BM,OAAO;QAE3D,MAAMC,cAAuC,CAAC;QAC9C,KAAK,MAAM,CAACT,MAAMU,MAAM,IAAIb,OAAOc,OAAO,CAAEN,oBAAAA,qBAAAA,UAAmD,CAAC,GAAI;YAClG,IAAI,OAAOK,UAAU,UAAU;gBAC7BD,WAAW,CAACT,KAAK,GAAGU;gBACpB;YACF;YACA,MAAME,QAAQF;YACd,sFAAsF;YACtF,qCAAqC;YACrC,MAAMG,SAAkC;gBAAEA,QAAQD,MAAME,IAAI;YAAC;YAC7D,IAAIF,MAAMG,CAAC,KAAKC,WAAWH,OAAOE,CAAC,GAAGH,MAAMG,CAAC;YAC7C,IAAIH,MAAMK,KAAK,KAAKD,WAAWH,OAAOI,KAAK,GAAGL,MAAMK,KAAK;YACzD,0FAA0F;YAC1F,IAAIL,MAAMM,QAAQ,KAAK,OAAOL,OAAOK,QAAQ,GAAG;YAChDT,WAAW,CAACT,KAAK,GAAGa;QACtB;QAEA,MAAMZ,eAAeE;QACrB,MAAMgB,eAAelB,yBAAAA,oCAAAA,qBAAAA,aAAca,IAAI,cAAlBb,yCAAAA,mBAAoBgB,KAAK;QAE9C,6EAA6E;QAC7E,MAAMG,eAAgBxB,qBAAAA,sBAAAA,WAAoD,CAAC;QAC3E,MAAMyB,cAAcD,aAAaE,KAAK,KAAK;QAC3C,2FAA2F;QAC3F,gHAAgH;QAChH,MAAMC,gBAAgB,OAAOH,aAAaE,KAAK,KAAK,YAAYF,aAAaE,KAAK,KAAK,OAAOF,aAAaE,KAAK,GAAGN;QACnH,MAAM,EAAEM,OAAOE,MAAM,EAAE,GAAGC,cAAc,GAAGL;QAE3C,MAAMM,gBAAyC;YAAElB,SAASD;QAAY;QACtE,IAAIY,iBAAiBH,WAAWU,cAAcT,KAAK,GAAGE;QACtD,IAAIE,aAAaK,cAAcR,QAAQ,GAAG;QAE1C,IAAId,WAAWY,WAAW;YACxBW,QAAQC,KAAK,CAAC;QAChB;QAEA,MAAMC,SAAkC;YAAE,GAAGvB,IAAI;YAAEX,SAAS;YAAGmC,SAAS;gBAAEC,SAASL;YAAc;YAAGrB,SAASI;QAAY;QACzH,IAAIc,kBAAkBP,WAAWa,OAAOP,KAAK,GAAGC;QAChD,IAAI1B,OAAOmC,IAAI,CAACP,cAAcQ,MAAM,GAAG,GAAGJ,OAAOjC,QAAQ,GAAG6B;QAC5D,OAAOI;IACT;IACA,6FAA6F;IAC7F,wFAAwF;IACxF,GAAG,CAACnC;YAK0CA,cAc9BA;QAlBd,MAAMoC,UAAUpC,IAAIoC,OAAO;QAC3B,MAAMI,WAAWrC,OAAOsC,MAAM,CAACL,SAASM,IAAI,CAAC,CAACC,IAAMA,EAAEnB,QAAQ,KAAK;QAEnE,MAAMT,cAAuC,CAAC;QAC9C,KAAK,MAAM,CAACT,MAAMU,MAAM,IAAIb,OAAOc,OAAO,EAAEjB,eAAAA,IAAIW,OAAO,cAAXX,0BAAAA,eAAuD,CAAC,GAAI;YACtG,+EAA+E;YAC/E,IAAI,OAAOgB,UAAU,UAAU;gBAC7BD,WAAW,CAACT,KAAK,GAAG;oBAAEsC,KAAK5B;gBAAM;gBACjC;YACF;YACA,IAAI,OAAOA,UAAU,YAAYA,UAAU,QAAQ,CAAE,CAAA,YAAYA,KAAI,GAAI;gBACvED,WAAW,CAACT,KAAK,GAAGU;gBACpB;YACF;YACA,MAAM,EAAEQ,UAAUqB,SAAS,EAAE,GAAGjC,MAAM,GAAGI;YACzCD,WAAW,CAACT,KAAK,GAAGM;QACtB;QAEA,MAAMkC,QAAQ9C,aAAAA,IAAI4B,KAAK,cAAT5B,wBAAAA,aAAqD,CAAC;QACpE,MAAMmC,SAAkC;YAAE,GAAGnC,GAAG;YAAEC,SAAS;YAAGU,SAASI;QAAY;QACnF,IAAIyB,UAAU;gBACaM,aAAiEA;YAA1FX,OAAOP,KAAK,GAAG;gBAAEmB,KAAK,GAAGD,cAAAA,KAAKC,KAAK,cAAVD,yBAAAA,cAAqCtD;gBAAqBwD,IAAI,GAAGF,aAAAA,KAAKE,IAAI,cAATF,wBAAAA,aAAoC;gBAAU,GAAIA,KAAKG,GAAG,KAAK3B,YAAY;oBAAE2B,KAAKH,KAAKG,GAAG;gBAAC,IAAI,CAAC,CAAC;gBAAG,GAAIH,KAAKI,GAAG,KAAK5B,YAAY;oBAAE4B,KAAKJ,KAAKI,GAAG;gBAAC,IAAI,CAAC,CAAC;YAAE;QACrP,OAAO;YACL,OAAOf,OAAOP,KAAK;YACnB,6FAA6F;YAC7F,iHAAiH;YACjH,IAAIzB,OAAOmC,IAAI,CAACQ,MAAMP,MAAM,GAAG,GAAGN,QAAQC,KAAK,CAAC;QAClD;QACA,OAAOC;IACT;IACA,gGAAgG;IAChG,kJAAkJ;IAClJ,GAAG,CAACnC;YAQeA;QAPjB,MAAMmD,YAAYnD,IAAI4B,KAAK;QAC3B,MAAMO,SAAkC;YAAE,GAAGnC,GAAG;YAAEC,SAAS;QAAE;QAC7D,IAAIkD,WAAW;YACb,MAAM,EAAEH,IAAI,EAAE,GAAGpC,MAAM,GAAGuC;YAC1BhB,OAAOP,KAAK,GAAGoB,SAAS1B,YAAYV,OAAO;gBAAE,GAAGA,IAAI;gBAAEwC,UAAUJ,SAAS,QAAQ,WAAWA;YAAK;QACnG;QAEA,MAAMK,UAAU,EAACrD,gBAAAA,IAAIE,QAAQ,cAAZF,oCAAD,AAACA,cAAsDsD,KAAK,MAAK;QACjF,MAAMlB,UAAUpC,IAAIoC,OAAO;QAC3B,IAAIA,SAAS;YACX,MAAMmB,cAAuC,CAAC;YAC9C,KAAK,MAAM,CAACjD,MAAMkD,OAAO,IAAIrD,OAAOc,OAAO,CAACmB,SAAU;gBACpD,MAAM,EAAEZ,QAAQ,EAAE,GAAGZ,MAAM,GAAG4C;gBAC9B,IAAIhC,aAAaF,WAAW;oBAC1BiC,WAAW,CAACjD,KAAK,GAAGkD;oBACpB;gBACF;gBACA,IAAI,OAAOhC,aAAa,WAAW;oBACjC,MAAM,IAAInC,WAAW,kBAAkB,CAAC,QAAQ,EAAEiB,KAAK,2BAA2B,CAAC;gBACrF;gBACAiD,WAAW,CAACjD,KAAK,GAAGkB,aAAa,QAAQ;oBAAE,GAAGZ,IAAI;oBAAE6C,SAASJ,UAAU;wBAAEK,OAAO;wBAAGJ,OAAO;oBAAE,IAAI;wBAAEI,OAAO;oBAAE;gBAAE,IAAI9C;YACnH;YACAuB,OAAOC,OAAO,GAAGmB;QACnB;QACA,OAAOpB;IACT;AACF;AAEA,OAAO,SAASwB,cAAc3D,GAAW;QAC1BA;IAAb,MAAM4D,QAAO5D,eAAAA,IAAIC,OAAO,cAAXD,0BAAAA,eAAe;IAC5B,IAAI6D,UAAmC7D;IACvC,IAAK,IAAI8D,IAAIF,MAAME,IAAIrE,0BAA0BqE,IAAK;QACpD,MAAMC,OAAOhE,UAAU,CAAC+D,EAAE;QAC1B,IAAI,CAACC,MAAM,MAAM,IAAI1E,WAAW,8BAA8B,CAAC,iCAAiC,EAAEyE,GAAG;QACrGD,UAAUE,KAAKF;IACjB;IACA,OAAO;QAAE7D,KAAK6D;QAA8BD;IAAK;AACnD;AAUA,SAASI,cAAcC,SAAyB;IAC9C,MAAMrC,QAAiC;QAAEmB,OAAOvD;QAAqB4D,UAAU;IAAS;IACxF,IAAIa,CAAAA,sBAAAA,gCAAAA,UAAWlB,KAAK,MAAKzB,WAAWM,MAAMmB,KAAK,GAAGkB,UAAUlB,KAAK;IACjE,IAAIkB,CAAAA,sBAAAA,gCAAAA,UAAWb,QAAQ,MAAK9B,WAAWM,MAAMwB,QAAQ,GAAGa,UAAUb,QAAQ;IAC1E,IAAIa,CAAAA,sBAAAA,gCAAAA,UAAWhB,GAAG,MAAK3B,WAAWM,MAAMqB,GAAG,GAAGgB,UAAUhB,GAAG;IAC3D,OAAO;QACLiB,SAAS;QACTjE,SAASR;QACT2C,SAAS;YACPC,SAAS;gBAAEvB,SAAS;oBAAC;iBAAU;gBAAEO,GAAG;YAAG;YACvC8C,OAAO;gBAAErD,SAAS;oBAAC;iBAAU;gBAAEO,GAAG;YAAG;QACvC;QACA,sFAAsF;QACtF,iEAAiE;QACjEO,OAAOA;QACPjB,SAAS,CAAC;IACZ;AACF;AAEA,0FAA0F;AAC1F,wFAAwF;AACxF,OAAO,SAASyD,WAAWC,GAAW,EAAEJ,SAAyB;IAC/D,MAAMK,aAAanF,KAAKkF,KAAK9E;IAC7B,IAAIP,WAAWsF,aAAa;QAC1B,MAAM,IAAIjF,WAAW,iBAAiB,GAAGE,gBAAgB,mBAAmB,EAAE8E,KAAK;IACrF;IACA,MAAMrE,MAAMgE,cAAcC;IAC1BtE,eAAeK,KAAKsE;IACpBhF,gBAAgBgF,YAAY,GAAGC,KAAKC,SAAS,CAACxE,KAAK,MAAM,GAAG,EAAE,CAAC;IAC/D,OAAOsE;AACT;AAEA,OAAO,SAASG,eAAeC,QAAgB;IAC7C,IAAIL,MAAMjF,QAAQsF;IAClB,OAAS;QACP,MAAMC,YAAYxF,KAAKkF,KAAK9E;QAC5B,IAAIP,WAAW2F,YAAY,OAAOA;QAClC,MAAMC,SAAS1F,QAAQmF;QACvB,IAAIO,WAAWP,KAAK,OAAO;QAC3BA,MAAMO;IACR;AACF;AAEA,OAAO,SAASC,WAAWC,YAAqB;QA6CX9E;IA5CnC,IAAIsE;IACJ,IAAIQ,cAAc;QAChBR,aAAalF,QAAQ2F,QAAQC,GAAG,IAAIF;QACpC,IAAI,CAAC9F,WAAWsF,aAAa,MAAM,IAAIjF,WAAW,oBAAoB,CAAC,kBAAkB,EAAEiF,YAAY;IACzG,OAAO;QACL,MAAMW,QAAQR,eAAeM,QAAQC,GAAG;QACxC,IAAI,CAACC,OAAO;YACV,MAAM,IAAI5F,WAAW,oBAAoB,CAAC,eAAe,EAAEE,gBAAgB,IAAI,EAAEwF,QAAQC,GAAG,GAAG,wBAAwB,CAAC;QAC1H;QACAV,aAAaW;IACf;IAEA,MAAMC,MAAMjG,aAAaqF,YAAY;IACrC,MAAMa,SAAkBZ,KAAKa,KAAK,CAACF;IAEnC,4FAA4F;IAC5F,8FAA8F;IAC9F,IAAI,OAAOC,WAAW,YAAYA,WAAW,QAAQE,MAAMC,OAAO,CAACH,SAAS;QAC1E,MAAM,IAAI9F,WAAW,kBAAkB,GAAGiF,WAAW,8BAA8B,CAAC;IACtF;IAEA,sFAAsF;IACtF,qFAAqF;IACrF,MAAMrE,UAAU,OAAOkF,WAAW,YAAYA,WAAW,QAAQ,OAAO,AAACA,OAAiClF,OAAO,KAAK,WAAW,AAACkF,OAA+BlF,OAAO,GAAG;IAC3K,IAAIA,UAAUR,0BAA0B;QACtC,MAAM,IAAIJ,WAAW,8BAA8B,CAAC,eAAe,EAAEY,QAAQ,uBAAuB,CAAC;IACvG;IAEA,2FAA2F;IAC3F,mDAAmD;IACnD,IAAID;IACJ,IAAIuF;IACJ,IAAItF,UAAUR,0BAA0B;QACtC,IAAIQ,UAAUJ,sBAAsBD,mBAAmBuF,QAAQb;QAC/D,MAAMnC,SAASwB,cAAcwB;QAC7BnF,MAAML,eAAewC,OAAOnC,GAAG,EAAEsE;QACjCiB,eAAepD,OAAOyB,IAAI;QAC1BtE,gBAAgBgF,YAAY,GAAGC,KAAKC,SAAS,CAACxE,KAAK,MAAM,GAAG,EAAE,CAAC;IACjE,OAAO;QACLA,MAAML,eAAewF,QAAQb;IAC/B;IAEA,MAAMkB,cAAc9F,kBAAkBM;IACtC,MAAMyF,YAAYvG,QAAQoF;IAC1B,MAAMoB,UAAUtG,QAAQqG,YAAWzF,YAAAA,IAAI2F,IAAI,cAAR3F,uBAAAA,YAAY;IAC/C,OAAO;QAAE,GAAGA,GAAG;QAAEyF;QAAWC;QAASE,SAASF;QAASpB;QAAYiB;QAAcC,aAAaA,YAAYjD,MAAM,GAAG,IAAIiD,cAAclE;IAAU;AACjJ"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/config/load.ts"],"sourcesContent":["import { existsSync, readFileSync } from 'node:fs';\nimport { dirname, join, resolve } from 'node:path';\nimport { SenseError } from '../errors.ts';\nimport { writeFileAtomic } from '../lib/atomic-write.ts';\nimport type { Config, ResolvedConfig } from './types.ts';\nimport { CONFIG_FILENAME, DEFAULT_EMBED_MODEL, SUPPORTED_CONFIG_VERSION } from './types.ts';\nimport { unknownConfigKeys, validateConfig, validateLegacyScan } from './validate.ts';\n\n// v1 and v2 were `scan`/`find`-shaped; v3 introduced `presets`. Only the former need the\n// legacy shape check before migrating.\nconst FIRST_PRESET_VERSION = 3;\n\n// v1 -> v2 migration only: the features v2 introduced as opt-out (embed was opt-in then).\nconst V2_OPT_OUT_NAMES = ['links', 'sections', 'rank'] as const;\n\n// Pure per-version steps, chained by loadConfig. Intermediate shapes predate the Config type,\n// so steps are loosely typed and only the final result is cast back.\nconst MIGRATIONS: Record<number, (cfg: Record<string, unknown>) => Record<string, unknown>> = {\n  // v1 -> v2: features block introduced, opt-out features enabled (matches the old implicit\n  // behavior of `links` etc. not existing). embed stays absent -- opt-in.\n  1: (cfg) => ({ ...cfg, version: 2, features: Object.fromEntries(V2_OPT_OUT_NAMES.map((name) => [name, true])) }),\n  // v2 -> v3: mechanical-minimal by decision -- only what keeps an existing config loading (no\n  // restructuring, no preset inference, no query rewriting); real trees get hand-migrated to use presets.\n  2: (cfg) => {\n    const { scan, defaults, features, checks, queries, ...rest } = cfg;\n    const scanInclude = (scan as { include: string[] }).include;\n\n    const nextQueries: Record<string, unknown> = {};\n    for (const [name, value] of Object.entries((queries as Record<string, unknown> | undefined) ?? {})) {\n      if (typeof value === 'string') {\n        nextQueries[name] = value;\n        continue;\n      }\n      const entry = value as { find: string; k?: number; where?: string; semantic?: boolean };\n      // Loosely typed on purpose: this step emits the v3 shape, which still had `semantic`.\n      // The v3 -> v4 step below strips it.\n      const search: Record<string, unknown> = { search: entry.find };\n      if (entry.k !== undefined) search.k = entry.k;\n      if (entry.where !== undefined) search.where = entry.where;\n      // semantic: true was opt-in; it is now the default, so it drops. semantic: false is kept.\n      if (entry.semantic === false) search.semantic = false;\n      nextQueries[name] = search;\n    }\n\n    const prevDefaults = defaults as { find?: { where?: string } } | undefined;\n    const defaultWhere = prevDefaults?.find?.where;\n\n    // features.embed false becomes semantic:false on every preset produced here.\n    const prevFeatures = (features as Record<string, unknown> | undefined) ?? {};\n    const embedWasOff = prevFeatures.embed === false;\n    // Object form carries provider settings (model/type/url/key), not a toggle -- they move to\n    // the v3 top-level `embed` block verbatim; dropping them would silently switch an api tree to the static model.\n    const embedProvider = typeof prevFeatures.embed === 'object' && prevFeatures.embed !== null ? prevFeatures.embed : undefined;\n    const { embed: _embed, ...restFeatures } = prevFeatures;\n\n    const defaultPreset: Record<string, unknown> = { include: scanInclude };\n    if (defaultWhere !== undefined) defaultPreset.where = defaultWhere;\n    if (embedWasOff) defaultPreset.semantic = false;\n\n    if (checks !== undefined) {\n      console.error('sense: v2 \"checks\" was removed in v3 (sense check no longer asserts on saved queries); its queries are carried over under \"queries\" -- a returned row set is now the reader\\'s judgment');\n    }\n\n    const result: Record<string, unknown> = { ...rest, version: 3, presets: { default: defaultPreset }, queries: nextQueries };\n    if (embedProvider !== undefined) result.embed = embedProvider;\n    if (Object.keys(restFeatures).length > 0) result.features = restFeatures;\n    return result;\n  },\n  // v3 -> v4: write the model into the file, wrap bare-string queries as { sql }, drop a saved\n  // search's `semantic` (its preset decides). Same effective model, so nothing re-embeds.\n  3: (cfg) => {\n    const presets = cfg.presets as Record<string, Record<string, unknown>>;\n    const embedded = Object.values(presets).some((p) => p.semantic !== false);\n\n    const nextQueries: Record<string, unknown> = {};\n    for (const [name, value] of Object.entries((cfg.queries as Record<string, unknown> | undefined) ?? {})) {\n      // v3's bare string meant SQL by inference; v4 makes every entry name its verb.\n      if (typeof value === 'string') {\n        nextQueries[name] = { sql: value };\n        continue;\n      }\n      if (typeof value !== 'object' || value === null || !('search' in value)) {\n        nextQueries[name] = value;\n        continue;\n      }\n      const { semantic: _semantic, ...rest } = value as Record<string, unknown>;\n      nextQueries[name] = rest;\n    }\n\n    const prev = (cfg.embed as Record<string, unknown> | undefined) ?? {};\n    const result: Record<string, unknown> = { ...cfg, version: 4, queries: nextQueries };\n    if (embedded) {\n      result.embed = { model: (prev.model as string | undefined) ?? DEFAULT_EMBED_MODEL, type: (prev.type as string | undefined) ?? 'static', ...(prev.url !== undefined ? { url: prev.url } : {}), ...(prev.key !== undefined ? { key: prev.key } : {}) };\n    } else {\n      delete result.embed;\n      // Dropping settings silently would look like a bug in a tree that configured an api endpoint\n      // then turned vectors off; say it, since v4 has no way to carry provider settings for a tree that doesn't embed.\n      if (Object.keys(prev).length > 0) console.error('sense: every preset has \"semantic\": false, so v4 drops the \"embed\" block (vectors stay off); re-add it, or set a preset\\'s semantic back to true, to turn them on');\n    }\n    return result;\n  },\n  // v4 -> v5: embed.type renames to embed.provider (\"api\" migrates to \"openai\", the wire protocol\n  // it always was; other values pass through). A preset's `semantic` also migrates to `signals` (false -> explicit weights, true/absent -> no key).\n  4: (cfg) => {\n    const prevEmbed = cfg.embed as Record<string, unknown> | undefined;\n    const result: Record<string, unknown> = { ...cfg, version: 5 };\n    if (prevEmbed) {\n      const { type, ...rest } = prevEmbed;\n      result.embed = type === undefined ? rest : { ...rest, provider: type === 'api' ? 'openai' : type };\n    }\n\n    const linksOn = (cfg.features as Record<string, unknown> | undefined)?.links !== false;\n    const presets = cfg.presets as Record<string, Record<string, unknown>> | undefined;\n    if (presets) {\n      const nextPresets: Record<string, unknown> = {};\n      for (const [name, preset] of Object.entries(presets)) {\n        const { semantic, ...rest } = preset;\n        if (semantic === undefined) {\n          nextPresets[name] = preset;\n          continue;\n        }\n        if (typeof semantic !== 'boolean') {\n          throw new SenseError('CONFIG_INVALID', `presets.${name}.semantic must be a boolean`);\n        }\n        nextPresets[name] = semantic === false ? { ...rest, signals: linksOn ? { words: 1, links: 1 } : { words: 1 } } : rest;\n      }\n      result.presets = nextPresets;\n    }\n    return result;\n  },\n  // v5 -> v6: query-triggered builds are on by default. Preserve an explicit opt-out.\n  5: (cfg) => ({ ...cfg, version: 6, build: cfg.build === undefined ? true : cfg.build }),\n};\n\nexport function migrateConfig(cfg: Config): { cfg: Config; from: number } {\n  const from = cfg.version ?? 1;\n  let current: Record<string, unknown> = cfg as unknown as Record<string, unknown>;\n  for (let v = from; v < SUPPORTED_CONFIG_VERSION; v++) {\n    const step = MIGRATIONS[v];\n    if (!step) throw new SenseError('CONFIG_VERSION_UNSUPPORTED', `no migration from config version ${v}`);\n    current = step(current);\n  }\n  return { cfg: current as unknown as Config, from };\n}\n\n// `sense init`'s flags map onto these three `embed` keys one-to-one; an absent field\n// keeps the built-in default rather than merging partial input.\nexport interface InitOverrides {\n  model?: string;\n  provider?: string;\n  url?: string;\n}\n\nfunction starterConfig(overrides?: InitOverrides): Config {\n  const embed: Record<string, unknown> = { model: DEFAULT_EMBED_MODEL, provider: 'static' };\n  if (overrides?.model !== undefined) embed.model = overrides.model;\n  if (overrides?.provider !== undefined) embed.provider = overrides.provider;\n  if (overrides?.url !== undefined) embed.url = overrides.url;\n  return {\n    $schema: 'https://unpkg.com/sensemaking/schema.json',\n    version: SUPPORTED_CONFIG_VERSION,\n    build: true,\n    presets: {\n      default: { include: ['**/*.md'], k: 10 },\n      large: { include: ['**/*.md'], k: 20 },\n    },\n    // Written out rather than defaulted in code: this line is what makes `sense download`\n    // fetch a model, so it belongs where it can be read and changed.\n    embed: embed as Config['embed'],\n    queries: {},\n  };\n}\n\n// Refuses to overwrite an existing config. `overrides` come from `sense init`'s flags; an\n// invalid --provider fails validateConfig's own shape check before anything is written.\nexport function initConfig(dir: string, overrides?: InitOverrides): string {\n  const configPath = join(dir, CONFIG_FILENAME);\n  if (existsSync(configPath)) {\n    throw new SenseError('CONFIG_EXISTS', `${CONFIG_FILENAME} already exists in ${dir}`);\n  }\n  const cfg = starterConfig(overrides);\n  validateConfig(cfg, configPath);\n  writeFileAtomic(configPath, `${JSON.stringify(cfg, null, 2)}\\n`);\n  return configPath;\n}\n\nexport function findConfigPath(startDir: string): string | null {\n  let dir = resolve(startDir);\n  for (;;) {\n    const candidate = join(dir, CONFIG_FILENAME);\n    if (existsSync(candidate)) return candidate;\n    const parent = dirname(dir);\n    if (parent === dir) return null;\n    dir = parent;\n  }\n}\n\n/** Controls whether loading an older config may persist its in-memory migration. */\nexport interface LoadConfigOptions {\n  /** Write a successful migration back to the config file. Defaults to true. */\n  writeMigration?: boolean;\n}\n\nexport function loadConfig(explicitPath?: string, options: LoadConfigOptions = {}): ResolvedConfig {\n  let configPath: string;\n  if (explicitPath) {\n    configPath = resolve(process.cwd(), explicitPath);\n    if (!existsSync(configPath)) throw new SenseError('CONFIG_NOT_FOUND', `config not found: ${configPath}`);\n  } else {\n    const found = findConfigPath(process.cwd());\n    if (!found) {\n      throw new SenseError('CONFIG_NOT_FOUND', `could not find ${CONFIG_FILENAME} in ${process.cwd()} or any parent directory`);\n    }\n    configPath = found;\n  }\n\n  const raw = readFileSync(configPath, 'utf8');\n  const parsed: unknown = JSON.parse(raw);\n\n  // Ahead of both the version gate and shape checks: a non-object file (or array -- typeof []\n  // is also 'object') is malformed at every version, so it gets one error regardless of branch.\n  if (typeof parsed !== 'object' || parsed === null || Array.isArray(parsed)) {\n    throw new SenseError('CONFIG_INVALID', `${configPath}: config must be a JSON object`);\n  }\n\n  // Version gate before shape validation: a config written by a newer sense should fail\n  // with \"requires a newer sense\", not with shape errors its own version may not have.\n  const version = typeof parsed === 'object' && parsed !== null && typeof (parsed as { version?: unknown }).version === 'number' ? (parsed as { version: number }).version : 1;\n  if (version > SUPPORTED_CONFIG_VERSION) {\n    throw new SenseError('CONFIG_VERSION_UNSUPPORTED', `config version ${version} requires a newer sense`);\n  }\n\n  // validateConfig only knows the current shape, so scan-shaped files (pre-v3) get a minimal\n  // check, migrate, then the full one on the result.\n  let cfg: Config;\n  let migratedFrom: number | undefined;\n  if (version < SUPPORTED_CONFIG_VERSION) {\n    if (version < FIRST_PRESET_VERSION) validateLegacyScan(parsed, configPath);\n    const result = migrateConfig(parsed as unknown as Config);\n    cfg = validateConfig(result.cfg, configPath);\n    migratedFrom = result.from;\n    if (options.writeMigration !== false) {\n      const migrated = `${JSON.stringify(cfg, null, 2)}\\n`;\n      try {\n        writeFileAtomic(configPath, migrated);\n      } catch (err) {\n        // Only a rename-contention error might already be published by a racing writer.\n        // Any other failure, including a failed initial write, rethrows immediately.\n        const errno = err as NodeJS.ErrnoException;\n        if (!(err instanceof Error) || errno.syscall !== 'rename' || !['EPERM', 'EACCES', 'EBUSY'].includes(errno.code ?? '')) throw err;\n        let existing: string;\n        try {\n          existing = readFileSync(configPath, 'utf8');\n        } catch {\n          throw err;\n        }\n        if (existing !== migrated) throw err;\n      }\n    }\n  } else {\n    cfg = validateConfig(parsed, configPath);\n  }\n\n  const unknownKeys = unknownConfigKeys(cfg as unknown as Record<string, unknown>);\n  const configDir = dirname(configPath);\n  const rootDir = resolve(configDir, cfg.root ?? '.');\n  return { ...cfg, configDir, rootDir, baseDir: rootDir, configPath, migratedFrom, unknownKeys: unknownKeys.length > 0 ? unknownKeys : undefined };\n}\n"],"names":["existsSync","readFileSync","dirname","join","resolve","SenseError","writeFileAtomic","CONFIG_FILENAME","DEFAULT_EMBED_MODEL","SUPPORTED_CONFIG_VERSION","unknownConfigKeys","validateConfig","validateLegacyScan","FIRST_PRESET_VERSION","V2_OPT_OUT_NAMES","MIGRATIONS","cfg","version","features","Object","fromEntries","map","name","prevDefaults","scan","defaults","checks","queries","rest","scanInclude","include","nextQueries","value","entries","entry","search","find","k","undefined","where","semantic","defaultWhere","prevFeatures","embedWasOff","embed","embedProvider","_embed","restFeatures","defaultPreset","console","error","result","presets","default","keys","length","embedded","values","some","p","sql","_semantic","prev","model","type","url","key","prevEmbed","provider","linksOn","links","nextPresets","preset","signals","words","build","migrateConfig","from","current","v","step","starterConfig","overrides","$schema","large","initConfig","dir","configPath","JSON","stringify","findConfigPath","startDir","candidate","parent","loadConfig","explicitPath","options","process","cwd","found","raw","parsed","parse","Array","isArray","migratedFrom","writeMigration","migrated","err","errno","Error","syscall","includes","code","existing","unknownKeys","configDir","rootDir","root","baseDir"],"mappings":"AAAA,SAASA,UAAU,EAAEC,YAAY,QAAQ,UAAU;AACnD,SAASC,OAAO,EAAEC,IAAI,EAAEC,OAAO,QAAQ,YAAY;AACnD,SAASC,UAAU,QAAQ,eAAe;AAC1C,SAASC,eAAe,QAAQ,yBAAyB;AAEzD,SAASC,eAAe,EAAEC,mBAAmB,EAAEC,wBAAwB,QAAQ,aAAa;AAC5F,SAASC,iBAAiB,EAAEC,cAAc,EAAEC,kBAAkB,QAAQ,gBAAgB;AAEtF,yFAAyF;AACzF,uCAAuC;AACvC,MAAMC,uBAAuB;AAE7B,0FAA0F;AAC1F,MAAMC,mBAAmB;IAAC;IAAS;IAAY;CAAO;AAEtD,8FAA8F;AAC9F,qEAAqE;AACrE,MAAMC,aAAwF;IAC5F,0FAA0F;IAC1F,wEAAwE;IACxE,GAAG,CAACC,MAAS,CAAA;YAAE,GAAGA,GAAG;YAAEC,SAAS;YAAGC,UAAUC,OAAOC,WAAW,CAACN,iBAAiBO,GAAG,CAAC,CAACC,OAAS;oBAACA;oBAAM;iBAAK;QAAG,CAAA;IAC9G,6FAA6F;IAC7F,wGAAwG;IACxG,GAAG,CAACN;YAsBmBO;QArBrB,MAAM,EAAEC,IAAI,EAAEC,QAAQ,EAAEP,QAAQ,EAAEQ,MAAM,EAAEC,OAAO,EAAE,GAAGC,MAAM,GAAGZ;QAC/D,MAAMa,cAAc,AAACL,KAA+BM,OAAO;QAE3D,MAAMC,cAAuC,CAAC;QAC9C,KAAK,MAAM,CAACT,MAAMU,MAAM,IAAIb,OAAOc,OAAO,CAAEN,oBAAAA,qBAAAA,UAAmD,CAAC,GAAI;YAClG,IAAI,OAAOK,UAAU,UAAU;gBAC7BD,WAAW,CAACT,KAAK,GAAGU;gBACpB;YACF;YACA,MAAME,QAAQF;YACd,sFAAsF;YACtF,qCAAqC;YACrC,MAAMG,SAAkC;gBAAEA,QAAQD,MAAME,IAAI;YAAC;YAC7D,IAAIF,MAAMG,CAAC,KAAKC,WAAWH,OAAOE,CAAC,GAAGH,MAAMG,CAAC;YAC7C,IAAIH,MAAMK,KAAK,KAAKD,WAAWH,OAAOI,KAAK,GAAGL,MAAMK,KAAK;YACzD,0FAA0F;YAC1F,IAAIL,MAAMM,QAAQ,KAAK,OAAOL,OAAOK,QAAQ,GAAG;YAChDT,WAAW,CAACT,KAAK,GAAGa;QACtB;QAEA,MAAMZ,eAAeE;QACrB,MAAMgB,eAAelB,yBAAAA,oCAAAA,qBAAAA,aAAca,IAAI,cAAlBb,yCAAAA,mBAAoBgB,KAAK;QAE9C,6EAA6E;QAC7E,MAAMG,eAAgBxB,qBAAAA,sBAAAA,WAAoD,CAAC;QAC3E,MAAMyB,cAAcD,aAAaE,KAAK,KAAK;QAC3C,2FAA2F;QAC3F,gHAAgH;QAChH,MAAMC,gBAAgB,OAAOH,aAAaE,KAAK,KAAK,YAAYF,aAAaE,KAAK,KAAK,OAAOF,aAAaE,KAAK,GAAGN;QACnH,MAAM,EAAEM,OAAOE,MAAM,EAAE,GAAGC,cAAc,GAAGL;QAE3C,MAAMM,gBAAyC;YAAElB,SAASD;QAAY;QACtE,IAAIY,iBAAiBH,WAAWU,cAAcT,KAAK,GAAGE;QACtD,IAAIE,aAAaK,cAAcR,QAAQ,GAAG;QAE1C,IAAId,WAAWY,WAAW;YACxBW,QAAQC,KAAK,CAAC;QAChB;QAEA,MAAMC,SAAkC;YAAE,GAAGvB,IAAI;YAAEX,SAAS;YAAGmC,SAAS;gBAAEC,SAASL;YAAc;YAAGrB,SAASI;QAAY;QACzH,IAAIc,kBAAkBP,WAAWa,OAAOP,KAAK,GAAGC;QAChD,IAAI1B,OAAOmC,IAAI,CAACP,cAAcQ,MAAM,GAAG,GAAGJ,OAAOjC,QAAQ,GAAG6B;QAC5D,OAAOI;IACT;IACA,6FAA6F;IAC7F,wFAAwF;IACxF,GAAG,CAACnC;YAK0CA,cAc9BA;QAlBd,MAAMoC,UAAUpC,IAAIoC,OAAO;QAC3B,MAAMI,WAAWrC,OAAOsC,MAAM,CAACL,SAASM,IAAI,CAAC,CAACC,IAAMA,EAAEnB,QAAQ,KAAK;QAEnE,MAAMT,cAAuC,CAAC;QAC9C,KAAK,MAAM,CAACT,MAAMU,MAAM,IAAIb,OAAOc,OAAO,EAAEjB,eAAAA,IAAIW,OAAO,cAAXX,0BAAAA,eAAuD,CAAC,GAAI;YACtG,+EAA+E;YAC/E,IAAI,OAAOgB,UAAU,UAAU;gBAC7BD,WAAW,CAACT,KAAK,GAAG;oBAAEsC,KAAK5B;gBAAM;gBACjC;YACF;YACA,IAAI,OAAOA,UAAU,YAAYA,UAAU,QAAQ,CAAE,CAAA,YAAYA,KAAI,GAAI;gBACvED,WAAW,CAACT,KAAK,GAAGU;gBACpB;YACF;YACA,MAAM,EAAEQ,UAAUqB,SAAS,EAAE,GAAGjC,MAAM,GAAGI;YACzCD,WAAW,CAACT,KAAK,GAAGM;QACtB;QAEA,MAAMkC,QAAQ9C,aAAAA,IAAI4B,KAAK,cAAT5B,wBAAAA,aAAqD,CAAC;QACpE,MAAMmC,SAAkC;YAAE,GAAGnC,GAAG;YAAEC,SAAS;YAAGU,SAASI;QAAY;QACnF,IAAIyB,UAAU;gBACaM,aAAiEA;YAA1FX,OAAOP,KAAK,GAAG;gBAAEmB,KAAK,GAAGD,cAAAA,KAAKC,KAAK,cAAVD,yBAAAA,cAAqCtD;gBAAqBwD,IAAI,GAAGF,aAAAA,KAAKE,IAAI,cAATF,wBAAAA,aAAoC;gBAAU,GAAIA,KAAKG,GAAG,KAAK3B,YAAY;oBAAE2B,KAAKH,KAAKG,GAAG;gBAAC,IAAI,CAAC,CAAC;gBAAG,GAAIH,KAAKI,GAAG,KAAK5B,YAAY;oBAAE4B,KAAKJ,KAAKI,GAAG;gBAAC,IAAI,CAAC,CAAC;YAAE;QACrP,OAAO;YACL,OAAOf,OAAOP,KAAK;YACnB,6FAA6F;YAC7F,iHAAiH;YACjH,IAAIzB,OAAOmC,IAAI,CAACQ,MAAMP,MAAM,GAAG,GAAGN,QAAQC,KAAK,CAAC;QAClD;QACA,OAAOC;IACT;IACA,gGAAgG;IAChG,kJAAkJ;IAClJ,GAAG,CAACnC;YAQeA;QAPjB,MAAMmD,YAAYnD,IAAI4B,KAAK;QAC3B,MAAMO,SAAkC;YAAE,GAAGnC,GAAG;YAAEC,SAAS;QAAE;QAC7D,IAAIkD,WAAW;YACb,MAAM,EAAEH,IAAI,EAAE,GAAGpC,MAAM,GAAGuC;YAC1BhB,OAAOP,KAAK,GAAGoB,SAAS1B,YAAYV,OAAO;gBAAE,GAAGA,IAAI;gBAAEwC,UAAUJ,SAAS,QAAQ,WAAWA;YAAK;QACnG;QAEA,MAAMK,UAAU,EAACrD,gBAAAA,IAAIE,QAAQ,cAAZF,oCAAD,AAACA,cAAsDsD,KAAK,MAAK;QACjF,MAAMlB,UAAUpC,IAAIoC,OAAO;QAC3B,IAAIA,SAAS;YACX,MAAMmB,cAAuC,CAAC;YAC9C,KAAK,MAAM,CAACjD,MAAMkD,OAAO,IAAIrD,OAAOc,OAAO,CAACmB,SAAU;gBACpD,MAAM,EAAEZ,QAAQ,EAAE,GAAGZ,MAAM,GAAG4C;gBAC9B,IAAIhC,aAAaF,WAAW;oBAC1BiC,WAAW,CAACjD,KAAK,GAAGkD;oBACpB;gBACF;gBACA,IAAI,OAAOhC,aAAa,WAAW;oBACjC,MAAM,IAAInC,WAAW,kBAAkB,CAAC,QAAQ,EAAEiB,KAAK,2BAA2B,CAAC;gBACrF;gBACAiD,WAAW,CAACjD,KAAK,GAAGkB,aAAa,QAAQ;oBAAE,GAAGZ,IAAI;oBAAE6C,SAASJ,UAAU;wBAAEK,OAAO;wBAAGJ,OAAO;oBAAE,IAAI;wBAAEI,OAAO;oBAAE;gBAAE,IAAI9C;YACnH;YACAuB,OAAOC,OAAO,GAAGmB;QACnB;QACA,OAAOpB;IACT;IACA,oFAAoF;IACpF,GAAG,CAACnC,MAAS,CAAA;YAAE,GAAGA,GAAG;YAAEC,SAAS;YAAG0D,OAAO3D,IAAI2D,KAAK,KAAKrC,YAAY,OAAOtB,IAAI2D,KAAK;QAAC,CAAA;AACvF;AAEA,OAAO,SAASC,cAAc5D,GAAW;QAC1BA;IAAb,MAAM6D,QAAO7D,eAAAA,IAAIC,OAAO,cAAXD,0BAAAA,eAAe;IAC5B,IAAI8D,UAAmC9D;IACvC,IAAK,IAAI+D,IAAIF,MAAME,IAAItE,0BAA0BsE,IAAK;QACpD,MAAMC,OAAOjE,UAAU,CAACgE,EAAE;QAC1B,IAAI,CAACC,MAAM,MAAM,IAAI3E,WAAW,8BAA8B,CAAC,iCAAiC,EAAE0E,GAAG;QACrGD,UAAUE,KAAKF;IACjB;IACA,OAAO;QAAE9D,KAAK8D;QAA8BD;IAAK;AACnD;AAUA,SAASI,cAAcC,SAAyB;IAC9C,MAAMtC,QAAiC;QAAEmB,OAAOvD;QAAqB4D,UAAU;IAAS;IACxF,IAAIc,CAAAA,sBAAAA,gCAAAA,UAAWnB,KAAK,MAAKzB,WAAWM,MAAMmB,KAAK,GAAGmB,UAAUnB,KAAK;IACjE,IAAImB,CAAAA,sBAAAA,gCAAAA,UAAWd,QAAQ,MAAK9B,WAAWM,MAAMwB,QAAQ,GAAGc,UAAUd,QAAQ;IAC1E,IAAIc,CAAAA,sBAAAA,gCAAAA,UAAWjB,GAAG,MAAK3B,WAAWM,MAAMqB,GAAG,GAAGiB,UAAUjB,GAAG;IAC3D,OAAO;QACLkB,SAAS;QACTlE,SAASR;QACTkE,OAAO;QACPvB,SAAS;YACPC,SAAS;gBAAEvB,SAAS;oBAAC;iBAAU;gBAAEO,GAAG;YAAG;YACvC+C,OAAO;gBAAEtD,SAAS;oBAAC;iBAAU;gBAAEO,GAAG;YAAG;QACvC;QACA,sFAAsF;QACtF,iEAAiE;QACjEO,OAAOA;QACPjB,SAAS,CAAC;IACZ;AACF;AAEA,0FAA0F;AAC1F,wFAAwF;AACxF,OAAO,SAAS0D,WAAWC,GAAW,EAAEJ,SAAyB;IAC/D,MAAMK,aAAapF,KAAKmF,KAAK/E;IAC7B,IAAIP,WAAWuF,aAAa;QAC1B,MAAM,IAAIlF,WAAW,iBAAiB,GAAGE,gBAAgB,mBAAmB,EAAE+E,KAAK;IACrF;IACA,MAAMtE,MAAMiE,cAAcC;IAC1BvE,eAAeK,KAAKuE;IACpBjF,gBAAgBiF,YAAY,GAAGC,KAAKC,SAAS,CAACzE,KAAK,MAAM,GAAG,EAAE,CAAC;IAC/D,OAAOuE;AACT;AAEA,OAAO,SAASG,eAAeC,QAAgB;IAC7C,IAAIL,MAAMlF,QAAQuF;IAClB,OAAS;QACP,MAAMC,YAAYzF,KAAKmF,KAAK/E;QAC5B,IAAIP,WAAW4F,YAAY,OAAOA;QAClC,MAAMC,SAAS3F,QAAQoF;QACvB,IAAIO,WAAWP,KAAK,OAAO;QAC3BA,MAAMO;IACR;AACF;AAQA,OAAO,SAASC,WAAWC,YAAqB,EAAEC,UAA6B,CAAC,CAAC;QA8D5ChF;IA7DnC,IAAIuE;IACJ,IAAIQ,cAAc;QAChBR,aAAanF,QAAQ6F,QAAQC,GAAG,IAAIH;QACpC,IAAI,CAAC/F,WAAWuF,aAAa,MAAM,IAAIlF,WAAW,oBAAoB,CAAC,kBAAkB,EAAEkF,YAAY;IACzG,OAAO;QACL,MAAMY,QAAQT,eAAeO,QAAQC,GAAG;QACxC,IAAI,CAACC,OAAO;YACV,MAAM,IAAI9F,WAAW,oBAAoB,CAAC,eAAe,EAAEE,gBAAgB,IAAI,EAAE0F,QAAQC,GAAG,GAAG,wBAAwB,CAAC;QAC1H;QACAX,aAAaY;IACf;IAEA,MAAMC,MAAMnG,aAAasF,YAAY;IACrC,MAAMc,SAAkBb,KAAKc,KAAK,CAACF;IAEnC,4FAA4F;IAC5F,8FAA8F;IAC9F,IAAI,OAAOC,WAAW,YAAYA,WAAW,QAAQE,MAAMC,OAAO,CAACH,SAAS;QAC1E,MAAM,IAAIhG,WAAW,kBAAkB,GAAGkF,WAAW,8BAA8B,CAAC;IACtF;IAEA,sFAAsF;IACtF,qFAAqF;IACrF,MAAMtE,UAAU,OAAOoF,WAAW,YAAYA,WAAW,QAAQ,OAAO,AAACA,OAAiCpF,OAAO,KAAK,WAAW,AAACoF,OAA+BpF,OAAO,GAAG;IAC3K,IAAIA,UAAUR,0BAA0B;QACtC,MAAM,IAAIJ,WAAW,8BAA8B,CAAC,eAAe,EAAEY,QAAQ,uBAAuB,CAAC;IACvG;IAEA,2FAA2F;IAC3F,mDAAmD;IACnD,IAAID;IACJ,IAAIyF;IACJ,IAAIxF,UAAUR,0BAA0B;QACtC,IAAIQ,UAAUJ,sBAAsBD,mBAAmByF,QAAQd;QAC/D,MAAMpC,SAASyB,cAAcyB;QAC7BrF,MAAML,eAAewC,OAAOnC,GAAG,EAAEuE;QACjCkB,eAAetD,OAAO0B,IAAI;QAC1B,IAAImB,QAAQU,cAAc,KAAK,OAAO;YACpC,MAAMC,WAAW,GAAGnB,KAAKC,SAAS,CAACzE,KAAK,MAAM,GAAG,EAAE,CAAC;YACpD,IAAI;gBACFV,gBAAgBiF,YAAYoB;YAC9B,EAAE,OAAOC,KAAK;oBAIwFC;gBAHpG,gFAAgF;gBAChF,6EAA6E;gBAC7E,MAAMA,QAAQD;gBACd,IAAI,CAAEA,CAAAA,eAAeE,KAAI,KAAMD,MAAME,OAAO,KAAK,YAAY,CAAC;oBAAC;oBAAS;oBAAU;iBAAQ,CAACC,QAAQ,EAACH,cAAAA,MAAMI,IAAI,cAAVJ,yBAAAA,cAAc,KAAK,MAAMD;gBAC7H,IAAIM;gBACJ,IAAI;oBACFA,WAAWjH,aAAasF,YAAY;gBACtC,EAAE,OAAM;oBACN,MAAMqB;gBACR;gBACA,IAAIM,aAAaP,UAAU,MAAMC;YACnC;QACF;IACF,OAAO;QACL5F,MAAML,eAAe0F,QAAQd;IAC/B;IAEA,MAAM4B,cAAczG,kBAAkBM;IACtC,MAAMoG,YAAYlH,QAAQqF;IAC1B,MAAM8B,UAAUjH,QAAQgH,YAAWpG,YAAAA,IAAIsG,IAAI,cAARtG,uBAAAA,YAAY;IAC/C,OAAO;QAAE,GAAGA,GAAG;QAAEoG;QAAWC;QAASE,SAASF;QAAS9B;QAAYkB;QAAcU,aAAaA,YAAY5D,MAAM,GAAG,IAAI4D,cAAc7E;IAAU;AACjJ"}

package/dist/esm/config/types.d.ts

@@ -1,7 +1,7 @@
 import type { SignalWeights } from './signals.js';
 export declare const CONFIG_FILENAME = "sense.config.json";
 export declare const STATE_DIR = ".sense";
-export declare const SUPPORTED_CONFIG_VERSION = 5;
+export declare const SUPPORTED_CONFIG_VERSION = 6;
 export declare const FEATURE_NAMES: readonly ["links", "sections", "tags", "rank", "embed"];
 export type FeatureName = (typeof FEATURE_NAMES)[number];
 export interface EmbedConfig {
@@ -37,6 +37,7 @@ export interface Config {
     $schema?: string;
     version?: number;
     root?: string;
+    build?: boolean;
     presets: Record<string, Preset>;
     features?: {
         links?: boolean;

package/dist/esm/config/types.js

@@ -1,7 +1,7 @@
 export const CONFIG_FILENAME = 'sense.config.json';
 export const STATE_DIR = '.sense';
 // Highest sense.config.json `version` this build understands. Older versions auto-migrate on load.
-export const SUPPORTED_CONFIG_VERSION = 5;
+export const SUPPORTED_CONFIG_VERSION = 6;
 // Each feature owns its tables, parse-time extraction, and reconcile step; commands degrade when one is off.
 // links/sections/tags/rank are opt-out toggles in `features`; embed is on exactly when an `embed` block names a model.
 export const FEATURE_NAMES = [

package/dist/esm/config/types.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/config/types.ts"],"sourcesContent":["import type { SignalWeights } from './signals.ts';\n\nexport const CONFIG_FILENAME = 'sense.config.json';\nexport const STATE_DIR = '.sense';\n\n// Highest sense.config.json `version` this build understands. Older versions auto-migrate on load.\nexport const SUPPORTED_CONFIG_VERSION = 5;\n\n// Each feature owns its tables, parse-time extraction, and reconcile step; commands degrade when one is off.\n// links/sections/tags/rank are opt-out toggles in `features`; embed is on exactly when an `embed` block names a model.\nexport const FEATURE_NAMES = ['links', 'sections', 'tags', 'rank', 'embed'] as const;\nexport type FeatureName = (typeof FEATURE_NAMES)[number];\n\n// `embed` names the model and gives the tree vectors at all; a preset's `signals` says which\n// engines that scope's searches use.\nexport interface EmbedConfig {\n  model?: string;\n  provider?: 'static' | 'openai' | 'cohere';\n  url?: string; // openai provider: OpenAI-compatible base URL, e.g. http://localhost:11434/v1\n  key?: string; // openai/cohere provider: name of the env var holding the bearer token, if any\n  languages?: string[]; // owner-declared model languages; enables the language-fit check where no card exists\n  chunkTokens?: number; // chunk size ceiling in estimated tokens for small-context models; default 500\n}\n\nexport const DEFAULT_EMBED_MODEL = 'minishlab/potion-retrieval-32M';\n\n// The single declaration every other store name derives from (Store.name, the store/index.ts\n// registry, validate.ts's accepted set). An array, not a bare union, so runtime checks read the same list.\nexport const STORE_NAMES = ['sqlite', 'duckdb', 'turso'] as const;\nexport type StoreName = (typeof STORE_NAMES)[number];\n\n// A named, self-contained file-selection scope: include/exclude are globby patterns resolved\n// relative to the configured tree root. No inheritance between presets; they may overlap freely (views, not partitions).\nexport interface Preset {\n  include: string[];\n  exclude?: string[];\n  k?: number; // result count for `search` scoped to this preset; default 10\n  // Exhaustive when present: every signal this preset's searches compose, each mapped to its RRF\n  // weight (finite > 0; presence is enablement). Absent = every signal whose prerequisite holds, at weight 1 (words always, links when on, vectors when a model is named).\n  signals?: SignalWeights;\n  where?: string; // standing SQL condition against frontmatter alias `f`\n}\n\n// A saved `search` invocation: `sense <name>` runs like\n// `sense search <search> [--preset] [--include] [--exclude] [--where] [--k]`.\nexport interface SavedSearch {\n  search: string;\n  preset?: string;\n  include?: string[];\n  exclude?: string[];\n  where?: string;\n  k?: number;\n}\n\n// An entry names the verb it runs, one to one with the commands: { sql } runs like\n// `sense sql`, { search } like `sense search`.\nexport type SavedQuery = { sql: string } | SavedSearch;\n\nexport interface Config {\n  // Editor-only pointer to schema.json; never read by sense.\n  $schema?: string;\n  version?: number;\n  // Markdown tree to index. Relative paths resolve from the configuration file's directory;\n  // omitted keeps the historic colocated-config behavior.\n  root?: string;\n  // File selection, index-time, and per-preset search defaults. A file is indexed iff any\n  // preset's include/exclude covers it (union). `default` is used when a command names no preset.\n  presets: Record<string, Preset>;\n  // Global feature defaults; absent block or key means enabled. embed is not a member here --\n  // see the `embed` block.\n  features?: { links?: boolean; sections?: boolean; tags?: boolean; rank?: boolean };\n  // Names the embedding model. Present means every indexed file gets vectors; absent means none do.\n  embed?: EmbedConfig;\n  // Backing store engine: \"sqlite\" (default, zero-dependency), \"duckdb\", or \"turso\" (optional\n  // dependency, installed on first use). What differs per store is declared through CAPABILITIES (store/types.ts).\n  store?: StoreName;\n  queries: Record<string, SavedQuery>;\n}\n\nexport interface ResolvedConfig extends Config {\n  // Configuration and state ownership are deliberately separate from the indexed tree.\n  configDir?: string;\n  rootDir?: string;\n  // Compatibility for callers that construct a ResolvedConfig for `open()` directly. New code\n  // uses rootDir/configDir; openStore normalizes this alias to both when necessary.\n  baseDir: string;\n  configPath: string | null;\n  // Keys the file declares that this build does not read; cli reports them.\n  unknownKeys?: string[];\n  // Set when loadConfig auto-migrated the file on disk; cli reports it.\n  migratedFrom?: number;\n}\n\nexport interface SearchOverrides {\n  preset?: string;\n  k?: number;\n  where?: string;\n  include?: string[];\n  exclude?: string[];\n  noExclude?: boolean; // drop the preset's exclude for this command; --exclude still applies\n}\n\nexport interface EffectiveSearch {\n  presetName: string;\n  k: number;\n  where?: string;\n  include: string[];\n  exclude?: string[];\n  signals: SignalWeights; // this preset's effective signal weights\n}\n"],"names":["CONFIG_FILENAME","STATE_DIR","SUPPORTED_CONFIG_VERSION","FEATURE_NAMES","DEFAULT_EMBED_MODEL","STORE_NAMES"],"mappings":"AAEA,OAAO,MAAMA,kBAAkB,oBAAoB;AACnD,OAAO,MAAMC,YAAY,SAAS;AAElC,mGAAmG;AACnG,OAAO,MAAMC,2BAA2B,EAAE;AAE1C,6GAA6G;AAC7G,uHAAuH;AACvH,OAAO,MAAMC,gBAAgB;IAAC;IAAS;IAAY;IAAQ;IAAQ;CAAQ,CAAU;AAcrF,OAAO,MAAMC,sBAAsB,iCAAiC;AAEpE,6FAA6F;AAC7F,2GAA2G;AAC3G,OAAO,MAAMC,cAAc;IAAC;IAAU;IAAU;CAAQ,CAAU"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/config/types.ts"],"sourcesContent":["import type { SignalWeights } from './signals.ts';\n\nexport const CONFIG_FILENAME = 'sense.config.json';\nexport const STATE_DIR = '.sense';\n\n// Highest sense.config.json `version` this build understands. Older versions auto-migrate on load.\nexport const SUPPORTED_CONFIG_VERSION = 6;\n\n// Each feature owns its tables, parse-time extraction, and reconcile step; commands degrade when one is off.\n// links/sections/tags/rank are opt-out toggles in `features`; embed is on exactly when an `embed` block names a model.\nexport const FEATURE_NAMES = ['links', 'sections', 'tags', 'rank', 'embed'] as const;\nexport type FeatureName = (typeof FEATURE_NAMES)[number];\n\n// `embed` names the model and gives the tree vectors at all; a preset's `signals` says which\n// engines that scope's searches use.\nexport interface EmbedConfig {\n  model?: string;\n  provider?: 'static' | 'openai' | 'cohere';\n  url?: string; // openai provider: OpenAI-compatible base URL, e.g. http://localhost:11434/v1\n  key?: string; // openai/cohere provider: name of the env var holding the bearer token, if any\n  languages?: string[]; // owner-declared model languages; enables the language-fit check where no card exists\n  chunkTokens?: number; // chunk size ceiling in estimated tokens for small-context models; default 500\n}\n\nexport const DEFAULT_EMBED_MODEL = 'minishlab/potion-retrieval-32M';\n\n// The single declaration every other store name derives from (Store.name, the store/index.ts\n// registry, validate.ts's accepted set). An array, not a bare union, so runtime checks read the same list.\nexport const STORE_NAMES = ['sqlite', 'duckdb', 'turso'] as const;\nexport type StoreName = (typeof STORE_NAMES)[number];\n\n// A named, self-contained file-selection scope: include/exclude are globby patterns resolved\n// relative to the configured tree root. No inheritance between presets; they may overlap freely (views, not partitions).\nexport interface Preset {\n  include: string[];\n  exclude?: string[];\n  k?: number; // result count for `search` scoped to this preset; default 10\n  // Exhaustive when present: every signal this preset's searches compose, each mapped to its RRF\n  // weight (finite > 0; presence is enablement). Absent = every signal whose prerequisite holds, at weight 1 (words always, links when on, vectors when a model is named).\n  signals?: SignalWeights;\n  where?: string; // standing SQL condition against frontmatter alias `f`\n}\n\n// A saved `search` invocation: `sense <name>` runs like\n// `sense search <search> [--preset] [--include] [--exclude] [--where] [--k]`.\nexport interface SavedSearch {\n  search: string;\n  preset?: string;\n  include?: string[];\n  exclude?: string[];\n  where?: string;\n  k?: number;\n}\n\n// An entry names the verb it runs, one to one with the commands: { sql } runs like\n// `sense sql`, { search } like `sense search`.\nexport type SavedQuery = { sql: string } | SavedSearch;\n\nexport interface Config {\n  // Editor-only pointer to schema.json; never read by sense.\n  $schema?: string;\n  version?: number;\n  // Markdown tree to index. Relative paths resolve from the configuration file's directory;\n  // omitted keeps the historic colocated-config behavior.\n  root?: string;\n  // CLI query-time incremental build default. Defaults to true; explicit build/watch ignore it.\n  build?: boolean;\n  // File selection, index-time, and per-preset search defaults. A file is indexed iff any\n  // preset's include/exclude covers it (union). `default` is used when a command names no preset.\n  presets: Record<string, Preset>;\n  // Global feature defaults; absent block or key means enabled. embed is not a member here --\n  // see the `embed` block.\n  features?: { links?: boolean; sections?: boolean; tags?: boolean; rank?: boolean };\n  // Names the embedding model. Present means every indexed file gets vectors; absent means none do.\n  embed?: EmbedConfig;\n  // Backing store engine: \"sqlite\" (default, zero-dependency), \"duckdb\", or \"turso\" (optional\n  // dependency, installed on first use). What differs per store is declared through CAPABILITIES (store/types.ts).\n  store?: StoreName;\n  queries: Record<string, SavedQuery>;\n}\n\nexport interface ResolvedConfig extends Config {\n  // Configuration and state ownership are deliberately separate from the indexed tree.\n  configDir?: string;\n  rootDir?: string;\n  // Compatibility for callers that construct a ResolvedConfig for `open()` directly. New code\n  // uses rootDir/configDir; openStore normalizes this alias to both when necessary.\n  baseDir: string;\n  configPath: string | null;\n  // Keys the file declares that this build does not read; cli reports them.\n  unknownKeys?: string[];\n  // Set when loadConfig auto-migrated the file on disk; cli reports it.\n  migratedFrom?: number;\n}\n\nexport interface SearchOverrides {\n  preset?: string;\n  k?: number;\n  where?: string;\n  include?: string[];\n  exclude?: string[];\n  noExclude?: boolean; // drop the preset's exclude for this command; --exclude still applies\n}\n\nexport interface EffectiveSearch {\n  presetName: string;\n  k: number;\n  where?: string;\n  include: string[];\n  exclude?: string[];\n  signals: SignalWeights; // this preset's effective signal weights\n}\n"],"names":["CONFIG_FILENAME","STATE_DIR","SUPPORTED_CONFIG_VERSION","FEATURE_NAMES","DEFAULT_EMBED_MODEL","STORE_NAMES"],"mappings":"AAEA,OAAO,MAAMA,kBAAkB,oBAAoB;AACnD,OAAO,MAAMC,YAAY,SAAS;AAElC,mGAAmG;AACnG,OAAO,MAAMC,2BAA2B,EAAE;AAE1C,6GAA6G;AAC7G,uHAAuH;AACvH,OAAO,MAAMC,gBAAgB;IAAC;IAAS;IAAY;IAAQ;IAAQ;CAAQ,CAAU;AAcrF,OAAO,MAAMC,sBAAsB,iCAAiC;AAEpE,6FAA6F;AAC7F,2GAA2G;AAC3G,OAAO,MAAMC,cAAc;IAAC;IAAU;IAAU;CAAQ,CAAU"}

package/dist/esm/config/validate.js

@@ -7,6 +7,7 @@ const KNOWN_KEYS = new Set([
     '$schema',
     'version',
     'root',
+    'build',
     'presets',
     'features',
     'embed',
@@ -44,6 +45,19 @@ const SAVED_SEARCH_KEYS = new Set([
     'where',
     'k'
 ]);
+const RESERVED_QUERY_NAMES = new Set([
+    'init',
+    'build',
+    'watch',
+    'status',
+    'download',
+    'sql',
+    'search',
+    'map',
+    'peek',
+    'path',
+    'related'
+]);
 export function unknownConfigKeys(cfg) {
     return Object.keys(cfg).filter((k)=>!KNOWN_KEYS.has(k));
 }
@@ -171,6 +185,9 @@ function validatePreset(name, value, configPath) {
 }
 // A queries.<name> entry: { sql } or a saved search { search, preset?, include?, exclude?, where?, k? }.
 function validateSavedQuery(name, value, configPath) {
+    if (RESERVED_QUERY_NAMES.has(name)) {
+        throw new SenseError('CONFIG_INVALID', `${configPath}: queries.${name} uses a reserved command name and can never be run as a saved query`);
+    }
     // A bare string is rejected rather than inferred to be SQL: an entry says which of the two
     // verbs it runs, the same choice the CLI makes explicit.
     if (typeof value === 'string') {
@@ -226,6 +243,9 @@ export function validateConfig(parsed, configPath) {
     if (cfg.root !== undefined && (typeof cfg.root !== 'string' || cfg.root.length === 0)) {
         throw new SenseError('CONFIG_INVALID', `${configPath}: root must be a non-empty path string`);
     }
+    if (cfg.build !== undefined && typeof cfg.build !== 'boolean') {
+        throw new SenseError('CONFIG_INVALID', `${configPath}: build must be a boolean`);
+    }
     // `checks` is rejected by name, not warned: silence would hide that assertions are gone.
     if (cfg.checks !== undefined) {
         throw new SenseError('CONFIG_INVALID', `${configPath}: checks was removed in v3 -- sense check no longer asserts on saved queries; a returned row set is the reader's judgment`);