sensemaking 0.11.4 → 0.12.0

package/dist/cjs/commands.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands.ts"],"sourcesContent":["import { readFileSync } from 'node:fs';\nimport { join, matchesGlob } from 'node:path';\nimport posix from 'node:path/posix';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { FeatureName, ResolvedConfig, SearchOverrides } from './config.ts';\nimport { anyPresetEmbeds, embedEnabled, featureEnabled, featureStates, presetNames, presetSemanticEnabled, resolveSearch } from './config.ts';\nimport { SenseError } from './errors.ts';\nimport { embedPending, hasEmbedding, modelPresent, semanticCandidates, similarNotes } from './features/embed.ts';\nimport { linkEdges } from './features/index.ts';\nimport { personalizedRank } from './graph.ts';\nimport type { Row } from './output.ts';\nimport { searchError } from './search-error.ts';\n\n// The three commands: mapTree (orient), search (locate), peek (structure).\n// Each returns data; cli.ts renders. All of them degrade when a feature is off.\n\nconst WEIGHTED_BM25 = 'bm25(content, 10.0, 5.0, 1.0)';\nconst RRF_K = 60;\n\n// snippet() re-tokenizes each candidate doc, superlinearly: ~10s for one 1MB doc\n// (BENCHMARKING.md). Past this bound, rows get the linear JS excerpt instead.\nconst SNIPPET_BOUND = 16_384;\nconst EXCERPT_WINDOW = 160;\n\n// Bare terms from an FTS5 query string: strips operators/quoting so the oversized-doc excerpt\n// scan matches the same words the query matched on, not FTS5 syntax.\nfunction extractBareTerms(query: string): string[] {\n  const cleaned = query\n    .replace(/\"/g, ' ')\n    .replace(/[()*]/g, ' ')\n    .replace(/\\b(AND|OR|NOT|NEAR)\\b(\\/\\d+)?/gi, ' ');\n  return cleaned\n    .split(/\\s+/)\n    .map((tok) => tok.replace(/^[A-Za-z_]\\w*:/, '')) // column filter, e.g. title:term\n    .map((tok) => tok.toLowerCase().trim())\n    .filter((tok) => tok.length > 0);\n}\n\nfunction findOccurrences(haystackLower: string, terms: string[]): Array<{ start: number; end: number; term: string }> {\n  const occ: Array<{ start: number; end: number; term: string }> = [];\n  for (const term of terms) {\n    let idx = 0;\n    for (;;) {\n      const found = haystackLower.indexOf(term, idx);\n      if (found === -1) break;\n      occ.push({ start: found, end: found + term.length, term });\n      idx = found + term.length;\n    }\n  }\n  // Longest span first at equal start, so \"tests\" beats its substring \"test\" and the\n  // whole word gets highlighted; the emit loop then absorbs the shorter overlap.\n  return occ.sort((a, b) => a.start - b.start || b.end - a.end);\n}\n\n// Slides a window over the sorted occurrences, same semantics as FTS5's own best-window\n// pick: most distinct terms, ties broken by most total hits.\nfunction bestWindowStart(occ: Array<{ start: number; end: number; term: string }>, windowSize: number): number {\n  let best = occ[0].start;\n  let bestDistinct = 0;\n  let bestCount = 0;\n  for (let i = 0; i < occ.length; i++) {\n    const winEnd = occ[i].start + windowSize;\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    if (seen.size > bestDistinct || (seen.size === bestDistinct && count > bestCount)) {\n      best = occ[i].start;\n      bestDistinct = seen.size;\n      bestCount = count;\n    }\n  }\n  return best;\n}\n\n// snippet()-shaped excerpt: matched terms wrapped in «», … at cut edges. Linear in doc\n// length, only run for rows actually returned (<= k), unlike snippet()'s per-row cost.\nfunction computeExcerpt(text: string, terms: string[]): { excerpt: string; offset: number } {\n  const occ = findOccurrences(text.toLowerCase(), terms);\n  if (occ.length === 0) {\n    // This is a raw substring scan, not porter-stemmed: a doc matched only through a\n    // stemmed variant (query \"negotiate\" vs doc \"negotiating\") finds no occurrence here.\n    // Fall back to the doc's start, unmarked, rather than claim a match that isn't there.\n    const end = Math.min(text.length, EXCERPT_WINDOW);\n    return { excerpt: `${text.slice(0, end).replace(/\\s+/g, ' ').trim()}${end < text.length ? '…' : ''}`, offset: 0 };\n  }\n  const start = bestWindowStart(occ, EXCERPT_WINDOW);\n  const end = Math.min(text.length, start + EXCERPT_WINDOW);\n  let out = '';\n  let cursor = start;\n  for (const o of occ) {\n    if (o.start < start || o.end > 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, end);\n  const prefix = start > 0 ? '…' : '';\n  const suffix = end < text.length ? '…' : '';\n  return { excerpt: `${prefix}${out.replace(/\\s+/g, ' ')}${suffix}`, offset: start };\n}\n\nfunction 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\nfunction lineRangeFor(db: DatabaseSync, path: string, line: number): string | null {\n  const row = db.prepare('SELECT start_line, end_line FROM sections WHERE \"path\" = ? AND start_line <= ? AND end_line >= ? ORDER BY start_line DESC LIMIT 1').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}\n\n// node:path's matchesGlob is experimental (stable behind an unstable-API flag) as of the\n// engines floor (Node >=22.20); scope filtering only ever needs single-pattern matching, so\n// it's used here in JS rather than running a directory walk in the query path.\nfunction inScope(path: string, include: string[], exclude?: string[]): boolean {\n  if (!include.some((g) => matchesGlob(path, g))) return false;\n  if (exclude?.some((g) => matchesGlob(path, g))) return false;\n  return true;\n}\n\nfunction scopeHasEmbeddings(db: DatabaseSync, cfg: ResolvedConfig, scopedPaths: Set<string>): boolean {\n  if (!anyPresetEmbeds(cfg)) return false; // the embeddings table doesn't exist at all in this case\n  const rows = db.prepare('SELECT DISTINCT \"path\" FROM embeddings').all() as Array<{ path: string }>;\n  return rows.some((r) => scopedPaths.has(r.path));\n}\n\n// BM25 + link expansion + vectors, fused by reciprocal rank; `via` names the signal per row.\n// `opts` arrives already resolved (config.ts:resolveSearch).\nexport async function search(db: DatabaseSync, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<Row[]> {\n  const effective = resolveSearch(cfg, opts);\n  const { k, include, exclude } = effective;\n\n  const allPaths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  // A preset scope reads the coverage reconcile indexed; re-matching globs here could disagree\n  // with it. Only ad-hoc scope flags, which have no persisted coverage, pay the JS match.\n  const adHocScope = opts.include !== undefined || opts.exclude !== undefined || opts.noExclude === true;\n  const scopedPaths = adHocScope ? new Set(allPaths.filter((p) => inScope(p, include, exclude))) : new Set((db.prepare('SELECT \"path\" FROM preset_files WHERE preset = ?').all(effective.presetName) as Array<{ path: string }>).map((r) => r.path));\n  // A scope narrower than the whole index needs a bigger candidate pool before filtering, or\n  // filtering can starve k even though enough in-scope matches exist further down the ranked\n  // list that a plain over-fetch wouldn't have reached.\n  const scopeActive = scopedPaths.size < allPaths.length;\n  const fetch = scopeActive ? Math.max(k * 5, 50) : Math.max(k * 3, 30);\n\n  // Asking for vectors without a model is a misconfiguration, not a mode: degrading would make\n  // the same search answer differently before and after a download. semantic:false never asks.\n  const wantsVectors = effective.semantic && anyPresetEmbeds(cfg);\n  if (wantsVectors && !modelPresent(cfg)) {\n    throw new SenseError('EMBED_MODEL_MISSING', `preset \"${effective.presetName}\" searches with vectors, but the embedding model is not available; run \\`sense download\\`, or set \"semantic\": false on that preset to search on words and links`);\n  }\n  const semanticEnabled = wantsVectors && scopeHasEmbeddings(db, cfg, scopedPaths);\n\n  // Terms pass verbatim to MATCH; invalid syntax errors rather than being rewritten. --where\n  // applies inside the candidate query (a post-filter would drop matches ranked past the pool)\n  // 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  // Docs past SNIPPET_BOUND skip snippet() entirely -- SQLite\n  // short-circuits the untaken CASE branch, so it's never invoked on them.\n  const matchSql = `SELECT content.path AS path, CASE WHEN length(content.text) <= ${SNIPPET_BOUND} THEN snippet(content, -1, '«', '»', '…', 10) ELSE NULL END AS hit FROM content ${whereJoin} WHERE content MATCH ? ${whereCond} ORDER BY ${WEIGHTED_BM25} LIMIT ${fetch}`;\n  let matchRows: Array<{ path: string; hit: string | null }>;\n  try {\n    matchRows = db.prepare(matchSql).all(terms) as Array<{ path: string; hit: string | null }>;\n  } catch (err) {\n    throw searchError(err as Error, terms, scope);\n  }\n  // Scope filtering happens in JS, on each candidate list, rather than in SQL: FTS5 match,\n  // link expansion, and vector search all run unscoped above (cheap to over-fetch), then get\n  // filtered here against the effective include/exclude before ranking is finalized.\n  matchRows = matchRows.filter((r) => scopedPaths.has(r.path));\n\n  const hits = new Map(matchRows.map((r) => [r.path, r.hit]));\n  // hit === null here means the bound suppressed snippet(), not \"no match\" -- distinguish\n  // from via='link' rows (never in matchRows, so absent from this set) below.\n  const oversized = new Set(matchRows.filter((r) => r.hit === null).map((r) => r.path));\n  const candidates = new Map<string, { score: number; via: string }>();\n  matchRows.forEach((r, i) => {\n    candidates.set(r.path, { score: 1 / (RRF_K + i), via: 'match' });\n  });\n\n  const edges = featureEnabled(cfg, 'links') && matchRows.length > 0 ? linkEdges(db) : [];\n  if (edges.length > 0) {\n    // Gates the label only, not the score: restart mass ranks every seed without an incident\n    // edge, but dropping it from the score reweights fusion (FEVER hit@10 0.997 -> 0.907).\n    const linked = new Set(edges.flat());\n    const seeds = new Map(matchRows.map((r, i) => [r.path, 1 / (i + 1)]));\n    const ranked = [...personalizedRank(allPaths, edges, seeds)]\n      .filter(([path, score]) => score > 1e-9 && scopedPaths.has(path))\n      .sort((a, b) => b[1] - a[1])\n      .slice(0, fetch);\n    ranked.forEach(([path], i) => {\n      const existing = candidates.get(path);\n      if (existing) {\n        existing.score += 1 / (RRF_K + i);\n        if (linked.has(path)) existing.via = 'match+link';\n      } else {\n        candidates.set(path, { score: 1 / (RRF_K + i), via: 'link' });\n      }\n    });\n  }\n\n  // Vector expansion, invoked only: a third RRF list at the swept flat-region constants\n  // (weight 1, pool = fetch). Each row carries its best chunk's line range.\n  const chunkLines = new Map<string, string>();\n  const chunkSimilarity = new Map<string, number>();\n  if (semanticEnabled) {\n    const vec = (await semanticCandidates(db, cfg, terms, fetch)).filter((v) => scopedPaths.has(v.path));\n    vec.forEach(({ path, lines, similarity }, i) => {\n      chunkLines.set(path, lines);\n      chunkSimilarity.set(path, similarity);\n      const existing = candidates.get(path);\n      if (existing) {\n        existing.score += 1 / (RRF_K + i);\n        existing.via = `${existing.via}+vector`;\n      } else {\n        candidates.set(path, { score: 1 / (RRF_K + i), via: 'vector' });\n      }\n    });\n  }\n\n  db.exec('DROP TABLE IF EXISTS _search');\n  db.exec('CREATE TEMP TABLE _search (\"path\" TEXT PRIMARY KEY, score REAL, via TEXT, hit TEXT, lines TEXT, similarity REAL)');\n  const insert = db.prepare('INSERT INTO _search (\"path\", score, via, hit, lines, similarity) VALUES (?, ?, ?, ?, ?, ?)');\n  for (const [path, c] of candidates) insert.run(path, c.score, c.via, hits.get(path) ?? null, chunkLines.get(path) ?? null, chunkSimilarity.get(path) ?? null);\n\n  // Already scope-filtered above; the final select reapplies --where only for link-derived\n  // rows, which never passed through whereCond.\n  const where = scope ? `WHERE (${scope})` : '';\n  // lines is always present now: semantic rows carry their chunk's range, oversized-doc\n  // lexical rows gain one below, everything else stays null. similarity stays semantic-only.\n  const similarityCol = semanticEnabled ? ', _search.similarity' : '';\n  const rows = db\n    .prepare(\n      `SELECT f.\"path\" AS path, content.title, content.summary, _search.hit, _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    .all(k) as Row[];\n\n  if (oversized.size > 0) {\n    const bareTerms = extractBareTerms(terms);\n    for (const row of rows) {\n      if (row.hit !== null || !oversized.has(row.path as string)) continue;\n      let text: string;\n      try {\n        text = readFileSync(join(cfg.baseDir, row.path as string), 'utf8');\n      } catch {\n        continue; // vanished since the match; leave hit/lines null rather than throw\n      }\n      const { excerpt, offset } = computeExcerpt(text, bareTerms);\n      row.hit = excerpt;\n      if (row.lines == null) row.lines = featureEnabled(cfg, 'sections') ? lineRangeFor(db, row.path as string, lineNumberAt(text, offset)) : null;\n    }\n  }\n\n  return rows;\n}\n\n// The scope resolver for non-search commands (path, peek, map): same coverage rule search()\n// applies (preset_files for a named preset, JS glob matching for an ad hoc include/exclude),\n// then narrowed by the resolved `where`.\nexport function scopedPaths(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides): Set<string> {\n  const effective = resolveSearch(cfg, overrides);\n  const { include, exclude, where } = effective;\n  const allPaths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const adHocScope = overrides.include !== undefined || overrides.exclude !== undefined || overrides.noExclude === true;\n  const paths = adHocScope ? new Set(allPaths.filter((p) => inScope(p, include, exclude))) : new Set((db.prepare('SELECT \"path\" FROM preset_files WHERE preset = ?').all(effective.presetName) as Array<{ path: string }>).map((r) => r.path));\n  if (!where) return paths;\n  const whereRows = db.prepare(`SELECT \"path\" FROM frontmatter f WHERE (${where})`).all() as Array<{ path: string }>;\n  const wherePaths = new Set(whereRows.map((r) => r.path));\n  return new Set([...paths].filter((p) => wherePaths.has(p)));\n}\n\nexport interface PresetCoverage {\n  name: string;\n  files: number;\n  embedded: number;\n  // Reported so 0 embedded reads as \"this scope declined vectors\" rather than \"not yet built\".\n  semantic: boolean;\n}\n\n// Indexing derives from presets, so the derivation stays visible. Read from preset_files, not\n// recomputed from globs, so it reflects the cache rather than the config.\nexport function presetCoverage(db: DatabaseSync, cfg: ResolvedConfig): PresetCoverage[] {\n  const embedActive = anyPresetEmbeds(cfg);\n  return presetNames(cfg).map((name) => {\n    const files = (db.prepare('SELECT COUNT(*) AS n FROM preset_files WHERE preset = ?').get(name) as { n: number }).n;\n    const embedded = embedActive ? (db.prepare('SELECT COUNT(*) AS n FROM preset_files pf WHERE pf.preset = ? AND EXISTS (SELECT 1 FROM embeddings e WHERE e.\"path\" = pf.\"path\" AND e.vector IS NOT NULL)').get(name) as { n: number }).n : 0;\n    return { name, files, embedded, semantic: presetSemanticEnabled(cfg, name) };\n  });\n}\n\nexport interface TreeMap {\n  docs: { count: number; bytes: number };\n  fields: Row[]; // top 20 by coverage; fieldsTotal carries the real count\n  fieldsTotal: number;\n  features: { on: FeatureName[]; off: FeatureName[] };\n  presets: PresetCoverage[];\n  hubs: Row[];\n  recent: Row[];\n}\n\nconst INTERNAL_COLUMNS = new Set(['path', '_mtime', '_size', '_rank', '_parse_error']);\n\n// A result row is capped at SQLITE_MAX_COLUMN (2000, default); two aggregate expressions\n// per field keeps a chunk's row safely under that regardless of how many fields the tree has.\nconst MAP_COLUMN_CHUNK = 300;\n\nfunction chunk<T>(items: T[], size: number): T[][] {\n  const out: T[][] = [];\n  for (let i = 0; i < items.length; i += size) out.push(items.slice(i, i + size));\n  return out;\n}\n\n// Materializes the resolved scope into a temp table (same shape as traverse.ts's\n// allowed_nodes) so every mapTree query can join/filter against it cheaply.\nfunction setupMapScope(db: DatabaseSync, paths: Set<string>): void {\n  db.exec('DROP TABLE IF EXISTS _map_scope');\n  db.exec('CREATE TEMP TABLE _map_scope (\"path\" TEXT PRIMARY KEY)');\n  db.prepare('INSERT INTO _map_scope SELECT DISTINCT value FROM json_each(?1)').run(JSON.stringify([...paths]));\n}\n\n// What is this scope: fixed-size output regardless of tree size. Coverage and features stay\n// global -- they describe the tree, not the current question.\nexport function mapTree(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides = {}): TreeMap {\n  setupMapScope(db, scopedPaths(db, cfg, overrides));\n  const scopeWhere = 'WHERE \"path\" IN (SELECT \"path\" FROM _map_scope)';\n  const scopeAnd = 'AND f.\"path\" IN (SELECT \"path\" FROM _map_scope)';\n\n  const docs = db.prepare(`SELECT COUNT(*) AS count, COALESCE(SUM(\"_size\"), 0) AS bytes FROM frontmatter ${scopeWhere}`).get() as { count: number; bytes: number };\n\n  const columns = (db.prepare('PRAGMA table_info(frontmatter)').all() as Array<{ name: string }>).map((r) => r.name).filter((name) => !INTERNAL_COLUMNS.has(name));\n  // Observed types, not declared: SQLite types per value, so a field can be text in most notes\n  // and numeric in a few. One aggregate scan per chunk of columns; FILTER matches COUNT's nulls.\n  const allFields: Row[] = [];\n  for (const group of chunk(columns, MAP_COLUMN_CHUNK)) {\n    const exprs = group.map((name, i) => {\n      const quoted = `\"${name.split('\"').join('\"\"')}\"`;\n      return `COUNT(${quoted}) AS n${i}, GROUP_CONCAT(DISTINCT typeof(${quoted})) FILTER (WHERE ${quoted} IS NOT NULL) AS t${i}`;\n    });\n    const result = db.prepare(`SELECT ${exprs.join(', ')} FROM frontmatter ${scopeWhere}`).get() as Record<string, number | string | null>;\n    group.forEach((name, i) => allFields.push({ field: name, coverage: result[`n${i}`] as number, type: (result[`t${i}`] as string) ?? '' }));\n  }\n  allFields.sort((a, b) => (b.coverage as number) - (a.coverage as number));\n  const fields = allFields.slice(0, 20);\n\n  const hubs = featureEnabled(cfg, 'rank') ? (db.prepare(`SELECT f.\"path\" AS path, round(f.\"_rank\" * 100, 2) AS rank, content.title FROM frontmatter f JOIN content ON content.path = f.\"path\" WHERE f.\"_rank\" IS NOT NULL ${scopeAnd} ORDER BY f.\"_rank\" DESC LIMIT 8`).all() as Row[]) : [];\n\n  const recent = db.prepare(`SELECT \"path\", datetime(\"_mtime\" / 1000, 'unixepoch') AS modified FROM frontmatter ${scopeWhere} ORDER BY \"_mtime\" DESC LIMIT 5`).all() as Row[];\n\n  return { docs, fields, fieldsTotal: allFields.length, features: featureStates(cfg), presets: presetCoverage(db, cfg), hubs, recent };\n}\n\n// Note resolution shared by peek and path: an exact path, or a unique basename (case\n// insensitive, .md stripped).\nexport function resolveNote(paths: string[], arg: string): string {\n  const exact = paths.find((p) => p === arg);\n  if (exact) return exact;\n  const base = posix.basename(arg).replace(/\\.md$/i, '').toLowerCase();\n  const matches = paths.filter((p) => posix.basename(p).replace(/\\.md$/i, '').toLowerCase() === base);\n  if (matches.length === 1) return matches[0];\n  if (matches.length > 1) throw new SenseError('NOTE_AMBIGUOUS', `\"${arg}\" is ambiguous: ${matches.join(', ')}`);\n  throw new SenseError('NOTE_NOT_FOUND', `no note matches \"${arg}\"`);\n}\n\nexport interface Peek {\n  path: string;\n  tokens: number;\n  frontmatter: Row;\n  // Set when the note's frontmatter was refused, so an empty frontmatter block reads as \"did\n  // not parse\" rather than \"has none\". Same reason `_parse_error` sits in the row.\n  parseError: string | null;\n  sections: Row[];\n  outbound: string[];\n  backlinks: string[];\n  unresolved: string[];\n  // Totals before truncation: a hub can have thousands of backlinks (or a note thousands of\n  // headings), and peek's whole point is bounded output. Query the sections/links tables\n  // directly for the full list.\n  sectionsTotal: number;\n  outboundTotal: number;\n  backlinksTotal: number;\n  unresolvedTotal: number;\n  // Bounded k-hop expansion beyond the immediate ring already shown by outbound/backlinks\n  // (depth starts at 2).\n  off: FeatureName[]; // disabled features whose blocks are omitted (not empty)\n}\n\nconst PEEK_LIST_LIMIT = 20;\n\n// peek: everything about one note except its prose -- frontmatter, outline with line\n// ranges + token estimates (so the follow-up Read is a range, not the file), links both ways.\nexport function peek(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides: SearchOverrides = {}): Peek {\n  const paths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const path = resolveNote(paths, pathArg);\n\n  const row = db.prepare('SELECT * FROM frontmatter WHERE \"path\" = ?').get(path) as Row;\n  const parseError = (row._parse_error as string | null) ?? null;\n  const frontmatter: Row = {};\n  for (const [key, value] of Object.entries(row)) {\n    if (!INTERNAL_COLUMNS.has(key) && value !== null) frontmatter[key] = value;\n  }\n\n  const sectionsTotal = featureEnabled(cfg, 'sections') ? (db.prepare('SELECT COUNT(*) AS n FROM sections WHERE \"path\" = ?').get(path) as { n: number }).n : 0;\n  const sections = featureEnabled(cfg, 'sections') ? (db.prepare('SELECT level, heading, start_line, end_line, tokens FROM sections WHERE \"path\" = ? ORDER BY idx LIMIT ?').all(path, PEEK_LIST_LIMIT) as Row[]) : [];\n\n  let outbound: string[] = [];\n  let backlinks: string[] = [];\n  let unresolved: string[] = [];\n  let backlinksTotal = 0;\n  const _allowed = scopedPaths(db, cfg, overrides);\n  if (featureEnabled(cfg, 'links')) {\n    const out = db.prepare('SELECT target, dst FROM links WHERE src = ? ORDER BY target').all(path) as Array<{ target: string; dst: string | null }>;\n    outbound = [...new Set(out.filter((l) => l.dst !== null).map((l) => l.dst as string))];\n    unresolved = out.filter((l) => l.dst === null).map((l) => l.target);\n    backlinksTotal = (db.prepare('SELECT COUNT(DISTINCT src) AS n FROM links WHERE dst = ?').get(path) as { n: number }).n;\n    backlinks = (db.prepare('SELECT DISTINCT src FROM links WHERE dst = ? ORDER BY src LIMIT ?').all(path, PEEK_LIST_LIMIT) as Array<{ src: string }>).map((r) => r.src);\n  }\n\n  return {\n    path,\n    tokens: Math.ceil(((row._size as number) ?? 0) / 4),\n    frontmatter,\n    parseError,\n    sections,\n    outbound: outbound.slice(0, PEEK_LIST_LIMIT),\n    backlinks,\n    unresolved: unresolved.slice(0, PEEK_LIST_LIMIT),\n    sectionsTotal,\n    outboundTotal: outbound.length,\n    backlinksTotal,\n    unresolvedTotal: unresolved.length,\n    off: (['sections', 'links'] as FeatureName[]).filter((name) => !featureEnabled(cfg, name)),\n  };\n}\n\n// Notes most similar by cosine, excluding self and everything already linked either way.\n// Its own command, not a peek section: a full embeddings scan is ~480ms at 26k notes.\nexport async function relatedNotes(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides: SearchOverrides, k: number): Promise<Array<{ path: string; similarity: number }>> {\n  const paths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const path = resolveNote(paths, pathArg);\n\n  const outbound = (db.prepare('SELECT DISTINCT dst FROM links WHERE src = ? AND dst IS NOT NULL').all(path) as Array<{ dst: string }>).map((r) => r.dst);\n  const backlinks = (db.prepare('SELECT DISTINCT src FROM links WHERE dst = ?').all(path) as Array<{ src: string }>).map((r) => r.src);\n  const exclude = new Set([path, ...outbound, ...backlinks]);\n\n  // Vectors are the only signal `related` has, so every way of not having them is an error\n  // naming the cause. An empty table then means one thing: nothing near in meaning that this\n  // note does not already link to, which is a real answer.\n  const effective = resolveSearch(cfg, overrides);\n  if (!embedEnabled(cfg)) {\n    throw new SenseError('EMBED_DISABLED', 'related ranks notes by meaning, and this tree has no embedding model; add an \"embed\" block naming one to sense.config.json, then run `sense download` (search works without it, on words and links)');\n  }\n  // search gates on the same flag (see wantsVectors above); reading it here too keeps\n  // `semantic: false` meaning one thing. Without this, an overlapping semantic-on preset's\n  // vectors would answer for a scope that declined them.\n  if (!effective.semantic) {\n    throw new SenseError('PRESET_NOT_SEMANTIC', `preset \"${effective.presetName}\" sets \"semantic\": false, so this scope has no vectors and related has no other signal; search it instead (words and links), or set semantic back on for that preset`);\n  }\n  if (!modelPresent(cfg)) {\n    throw new SenseError('EMBED_MODEL_MISSING', 'related ranks notes by meaning, so it needs the embedding model, which is not downloaded; run `sense download` (search still works without it, on words and links)');\n  }\n  const allowed = scopedPaths(db, cfg, overrides);\n  // Top up pending rows before the seed check, or a fresh index reports every note as\n  // having no indexed text until some search has run.\n  await embedPending(db, cfg, cfg.baseDir);\n  if (!hasEmbedding(db, path)) {\n    throw new SenseError('NOTE_NOT_EMBEDDED', `${path} has no indexed text to compare -- a note that is frontmatter only, or empty, has nothing to rank by meaning`);\n  }\n  if (!scopeHasEmbeddings(db, cfg, allowed)) return [];\n  return similarNotes(db, cfg, path, { exclude, allowed, k });\n}\n"],"names":["mapTree","peek","presetCoverage","relatedNotes","resolveNote","scopedPaths","search","WEIGHTED_BM25","RRF_K","SNIPPET_BOUND","EXCERPT_WINDOW","extractBareTerms","query","cleaned","replace","split","map","tok","toLowerCase","trim","filter","length","findOccurrences","haystackLower","terms","occ","term","idx","found","indexOf","push","start","end","sort","a","b","bestWindowStart","windowSize","best","bestDistinct","bestCount","i","winEnd","seen","Set","count","j","add","size","computeExcerpt","text","Math","min","excerpt","slice","offset","out","cursor","o","prefix","suffix","lineNumberAt","line","charCodeAt","lineRangeFor","db","path","row","prepare","get","start_line","end_line","inScope","include","exclude","some","g","matchesGlob","scopeHasEmbeddings","cfg","anyPresetEmbeds","rows","all","r","has","opts","hits","chunkLines","chunkSimilarity","effective","k","allPaths","adHocScope","scopeActive","fetch","wantsVectors","semanticEnabled","scope","whereJoin","whereCond","matchSql","matchRows","oversized","candidates","edges","linked","seeds","ranked","vec","insert","c","where","similarityCol","bareTerms","resolveSearch","undefined","noExclude","p","presetName","max","semantic","modelPresent","SenseError","err","searchError","Map","hit","forEach","set","score","via","featureEnabled","linkEdges","flat","personalizedRank","existing","semanticCandidates","v","lines","similarity","exec","run","readFileSync","join","baseDir","overrides","paths","whereRows","wherePaths","embedActive","presetNames","name","files","n","embedded","presetSemanticEnabled","INTERNAL_COLUMNS","MAP_COLUMN_CHUNK","chunk","items","setupMapScope","JSON","stringify","scopeWhere","scopeAnd","docs","columns","allFields","group","exprs","quoted","result","field","coverage","type","fields","hubs","recent","fieldsTotal","features","featureStates","presets","arg","exact","find","base","posix","basename","matches","PEEK_LIST_LIMIT","pathArg","parseError","_parse_error","frontmatter","Object","entries","key","value","sectionsTotal","sections","outbound","backlinks","unresolved","backlinksTotal","_allowed","l","dst","target","src","tokens","ceil","_size","outboundTotal","unresolvedTotal","off","allowed","embedEnabled","embedPending","hasEmbedding","similarNotes"],"mappings":";;;;;;;;;;;QAmVgBA;eAAAA;;QAoEAC;eAAAA;;QA7GAC;eAAAA;;QA2JMC;eAAAA;;QAnFNC;eAAAA;;QA9FAC;eAAAA;;QArIMC;eAAAA;;;sBA/IO;wBACK;4DAChB;wBAG8G;wBACrG;uBACgE;uBACjE;uBACO;6BAEL;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAE5B,2EAA2E;AAC3E,gFAAgF;AAEhF,IAAMC,gBAAgB;AACtB,IAAMC,QAAQ;AAEd,iFAAiF;AACjF,8EAA8E;AAC9E,IAAMC,gBAAgB;AACtB,IAAMC,iBAAiB;AAEvB,8FAA8F;AAC9F,qEAAqE;AACrE,SAASC,iBAAiBC,KAAa;IACrC,IAAMC,UAAUD,MACbE,OAAO,CAAC,MAAM,KACdA,OAAO,CAAC,UAAU,KAClBA,OAAO,CAAC,mCAAmC;IAC9C,OAAOD,QACJE,KAAK,CAAC,OACNC,GAAG,CAAC,SAACC;eAAQA,IAAIH,OAAO,CAAC,kBAAkB;OAAK,iCAAiC;KACjFE,GAAG,CAAC,SAACC;eAAQA,IAAIC,WAAW,GAAGC,IAAI;OACnCC,MAAM,CAAC,SAACH;eAAQA,IAAII,MAAM,GAAG;;AAClC;AAEA,SAASC,gBAAgBC,aAAqB,EAAEC,KAAe;IAC7D,IAAMC,MAA2D,EAAE;QAC9D,kCAAA,2BAAA;;QAAL,QAAK,YAAcD,0BAAd,SAAA,6BAAA,QAAA,yBAAA,iCAAqB;YAArB,IAAME,OAAN;YACH,IAAIC,MAAM;YACV,OAAS;gBACP,IAAMC,QAAQL,cAAcM,OAAO,CAACH,MAAMC;gBAC1C,IAAIC,UAAU,CAAC,GAAG;gBAClBH,IAAIK,IAAI,CAAC;oBAAEC,OAAOH;oBAAOI,KAAKJ,QAAQF,KAAKL,MAAM;oBAAEK,MAAAA;gBAAK;gBACxDC,MAAMC,QAAQF,KAAKL,MAAM;YAC3B;QACF;;QARK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IASL,mFAAmF;IACnF,+EAA+E;IAC/E,OAAOI,IAAIQ,IAAI,CAAC,SAACC,GAAGC;eAAMD,EAAEH,KAAK,GAAGI,EAAEJ,KAAK,IAAII,EAAEH,GAAG,GAAGE,EAAEF,GAAG;;AAC9D;AAEA,wFAAwF;AACxF,6DAA6D;AAC7D,SAASI,gBAAgBX,GAAwD,EAAEY,UAAkB;IACnG,IAAIC,OAAOb,GAAG,CAAC,EAAE,CAACM,KAAK;IACvB,IAAIQ,eAAe;IACnB,IAAIC,YAAY;IAChB,IAAK,IAAIC,IAAI,GAAGA,IAAIhB,IAAIJ,MAAM,EAAEoB,IAAK;QACnC,IAAMC,SAASjB,GAAG,CAACgB,EAAE,CAACV,KAAK,GAAGM;QAC9B,IAAMM,OAAO,IAAIC;QACjB,IAAIC,QAAQ;QACZ,IAAK,IAAIC,IAAIL,GAAGK,IAAIrB,IAAIJ,MAAM,IAAII,GAAG,CAACqB,EAAE,CAACf,KAAK,GAAGW,QAAQI,IAAK;YAC5DH,KAAKI,GAAG,CAACtB,GAAG,CAACqB,EAAE,CAACpB,IAAI;YACpBmB;QACF;QACA,IAAIF,KAAKK,IAAI,GAAGT,gBAAiBI,KAAKK,IAAI,KAAKT,gBAAgBM,QAAQL,WAAY;YACjFF,OAAOb,GAAG,CAACgB,EAAE,CAACV,KAAK;YACnBQ,eAAeI,KAAKK,IAAI;YACxBR,YAAYK;QACd;IACF;IACA,OAAOP;AACT;AAEA,uFAAuF;AACvF,uFAAuF;AACvF,SAASW,eAAeC,IAAY,EAAE1B,KAAe;IACnD,IAAMC,MAAMH,gBAAgB4B,KAAKhC,WAAW,IAAIM;IAChD,IAAIC,IAAIJ,MAAM,KAAK,GAAG;QACpB,iFAAiF;QACjF,qFAAqF;QACrF,sFAAsF;QACtF,IAAMW,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEX;QAClC,OAAO;YAAE2C,SAAS,AAAC,GAAmDrB,OAAjDkB,KAAKI,KAAK,CAAC,GAAGtB,KAAKlB,OAAO,CAAC,QAAQ,KAAKK,IAAI,IAAkC,OAA7Ba,MAAMkB,KAAK7B,MAAM,GAAG,MAAM;YAAMkC,QAAQ;QAAE;IAClH;IACA,IAAMxB,QAAQK,gBAAgBX,KAAKf;IACnC,IAAMsB,OAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEU,QAAQrB;IAC1C,IAAI8C,MAAM;IACV,IAAIC,SAAS1B;QACR,kCAAA,2BAAA;;QAAL,QAAK,YAAWN,wBAAX,SAAA,6BAAA,QAAA,yBAAA,iCAAgB;YAAhB,IAAMiC,IAAN;YACH,IAAIA,EAAE3B,KAAK,GAAGA,SAAS2B,EAAE1B,GAAG,GAAGA,MAAK;YACpC,sFAAsF;YACtF,gFAAgF;YAChF,IAAI0B,EAAE3B,KAAK,GAAG0B,QAAQ;YACtBD,OAAO,AAAC,GAAiCN,OAA/BA,KAAKI,KAAK,CAACG,QAAQC,EAAE3B,KAAK,GAAE,QAA8B,OAA3BmB,KAAKI,KAAK,CAACI,EAAE3B,KAAK,EAAE2B,EAAE1B,GAAG,GAAE;YACpEyB,SAASC,EAAE1B,GAAG;QAChB;;QAPK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAQLwB,OAAON,KAAKI,KAAK,CAACG,QAAQzB;IAC1B,IAAM2B,SAAS5B,QAAQ,IAAI,MAAM;IACjC,IAAM6B,SAAS5B,OAAMkB,KAAK7B,MAAM,GAAG,MAAM;IACzC,OAAO;QAAEgC,SAAS,AAAC,GAAWG,OAATG,QAAoCC,OAA3BJ,IAAI1C,OAAO,CAAC,QAAQ,MAAc,OAAP8C;QAAUL,QAAQxB;IAAM;AACnF;AAEA,SAAS8B,aAAaX,IAAY,EAAEK,MAAc;IAChD,IAAIO,OAAO;IACX,IAAK,IAAIrB,IAAI,GAAGA,IAAIc,QAAQd,IAAK,IAAIS,KAAKa,UAAU,CAACtB,OAAO,IAAIqB;IAChE,OAAOA;AACT;AAEA,SAASE,aAAaC,EAAgB,EAAEC,IAAY,EAAEJ,IAAY;IAChE,IAAMK,MAAMF,GAAGG,OAAO,CAAC,qIAAqIC,GAAG,CAACH,MAAMJ,MAAMA;IAC5K,OAAOK,MAAM,AAAC,IAAqBA,OAAlBA,IAAIG,UAAU,EAAC,KAAgB,OAAbH,IAAII,QAAQ,IAAK;AACtD;AAWA,yFAAyF;AACzF,4FAA4F;AAC5F,+EAA+E;AAC/E,SAASC,QAAQN,IAAY,EAAEO,OAAiB,EAAEC,OAAkB;IAClE,IAAI,CAACD,QAAQE,IAAI,CAAC,SAACC;eAAMC,IAAAA,qBAAW,EAACX,MAAMU;QAAK,OAAO;IACvD,IAAIF,oBAAAA,8BAAAA,QAASC,IAAI,CAAC,SAACC;eAAMC,IAAAA,qBAAW,EAACX,MAAMU;QAAK,OAAO;IACvD,OAAO;AACT;AAEA,SAASE,mBAAmBb,EAAgB,EAAEc,GAAmB,EAAE1E,WAAwB;IACzF,IAAI,CAAC2E,IAAAA,yBAAe,EAACD,MAAM,OAAO,OAAO,yDAAyD;IAClG,IAAME,OAAOhB,GAAGG,OAAO,CAAC,0CAA0Cc,GAAG;IACrE,OAAOD,KAAKN,IAAI,CAAC,SAACQ;eAAM9E,YAAY+E,GAAG,CAACD,EAAEjB,IAAI;;AAChD;AAIO,SAAe5D;wCAAO2D,EAAgB,EAAEc,GAAmB,EAAEvD,KAAa;YAAE6D,MA+FZC,WAAwBC,iBAA8BC,sBA9FrHC,WACEC,GAAGjB,SAASC,SAEdiB,UAGAC,YACAvF,aAIAwF,aACAC,OAIAC,cAIAC,iBAKAC,OACAC,WACAC,WAGAC,UACFC,WAWEf,MAGAgB,WACAC,YAKAC,OAIEC,QACAC,OACAC,QAiBFpB,YACAC,iBAEEoB,KAgBFC,QACD,2BAAA,mBAAA,gBAAA,WAAA,oBAAO3C,MAAM4C,GAIZC,OAGAC,eACA/B,MASEgC,WACD,4BAAA,oBAAA,iBAAA,YAAA,QAAM9C,KAELjB,MAMwBD,iBAApBI,SAASE;;;;;oBAzH4D8B,OAAAA,oEAAsB,CAAC;oBAClGI,YAAYyB,IAAAA,uBAAa,EAACnC,KAAKM;oBAC7BK,IAAwBD,UAAxBC,GAAGjB,UAAqBgB,UAArBhB,SAASC,UAAYe,UAAZf;oBAEdiB,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBAClH,6FAA6F;oBAC7F,wFAAwF;oBAClF0B,aAAaP,KAAKZ,OAAO,KAAK0C,aAAa9B,KAAKX,OAAO,KAAKyC,aAAa9B,KAAK+B,SAAS,KAAK;oBAC5F/G,cAAcuF,aAAa,IAAIhD,IAAI+C,SAASvE,MAAM,CAAC,SAACiG;+BAAM7C,QAAQ6C,GAAG5C,SAASC;0BAAa,IAAI9B,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDc,GAAG,CAACO,UAAU6B,UAAU,EAA8BtG,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBAChP,2FAA2F;oBAC3F,2FAA2F;oBAC3F,sDAAsD;oBAChD2B,cAAcxF,YAAY2C,IAAI,GAAG2C,SAAStE,MAAM;oBAChDyE,QAAQD,cAAc1C,KAAKoE,GAAG,CAAC7B,IAAI,GAAG,MAAMvC,KAAKoE,GAAG,CAAC7B,IAAI,GAAG;oBAElE,6FAA6F;oBAC7F,6FAA6F;oBACvFK,eAAeN,UAAU+B,QAAQ,IAAIxC,IAAAA,yBAAe,EAACD;oBAC3D,IAAIgB,gBAAgB,CAAC0B,IAAAA,qBAAY,EAAC1C,MAAM;wBACtC,MAAM,IAAI2C,oBAAU,CAAC,uBAAuB,AAAC,WAA+B,OAArBjC,UAAU6B,UAAU,EAAC;oBAC9E;oBACMtB,kBAAkBD,gBAAgBjB,mBAAmBb,IAAIc,KAAK1E;oBAEpE,2FAA2F;oBAC3F,6FAA6F;oBAC7F,wDAAwD;oBAClD4F,QAAQR,UAAUsB,KAAK;oBACvBb,YAAYD,QAAQ,kDAAkD;oBACtEE,YAAYF,QAAQ,AAAC,QAAa,OAANA,OAAM,OAAK;oBAC7C,4DAA4D;oBAC5D,yEAAyE;oBACnEG,WAAW,AAAC,kEAAiKF,OAAhGzF,eAAc,0FAAqH0F,OAAnCD,WAAU,2BAA+C3F,OAAtB4F,WAAU,cAAmCL,OAAvBvF,eAAc,WAAe,OAANuF;oBAEnQ,IAAI;wBACFO,YAAYpC,GAAGG,OAAO,CAACgC,UAAUlB,GAAG,CAAC1D;oBACvC,EAAE,OAAOmG,KAAK;wBACZ,MAAMC,IAAAA,0BAAW,EAACD,KAAcnG,OAAOyE;oBACzC;oBACA,yFAAyF;oBACzF,2FAA2F;oBAC3F,mFAAmF;oBACnFI,YAAYA,UAAUjF,MAAM,CAAC,SAAC+D;+BAAM9E,YAAY+E,GAAG,CAACD,EAAEjB,IAAI;;oBAEpDoB,OAAO,IAAIuC,IAAIxB,UAAUrF,GAAG,CAAC,SAACmE;+BAAM;4BAACA,EAAEjB,IAAI;4BAAEiB,EAAE2C,GAAG;yBAAC;;oBACzD,wFAAwF;oBACxF,4EAA4E;oBACtExB,YAAY,IAAI1D,IAAIyD,UAAUjF,MAAM,CAAC,SAAC+D;+BAAMA,EAAE2C,GAAG,KAAK;uBAAM9G,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBAC7EqC,aAAa,IAAIsB;oBACvBxB,UAAU0B,OAAO,CAAC,SAAC5C,GAAG1C;wBACpB8D,WAAWyB,GAAG,CAAC7C,EAAEjB,IAAI,EAAE;4BAAE+D,OAAO,IAAKzH,CAAAA,QAAQiC,CAAAA;4BAAIyF,KAAK;wBAAQ;oBAChE;oBAEM1B,QAAQ2B,IAAAA,wBAAc,EAACpD,KAAK,YAAYsB,UAAUhF,MAAM,GAAG,IAAI+G,IAAAA,kBAAS,EAACnE;oBAC/E,IAAIuC,MAAMnF,MAAM,GAAG,GAAG;wBACpB,yFAAyF;wBACzF,uFAAuF;wBACjFoF,SAAS,IAAI7D,IAAI4D,MAAM6B,IAAI;wBAC3B3B,QAAQ,IAAImB,IAAIxB,UAAUrF,GAAG,CAAC,SAACmE,GAAG1C;mCAAM;gCAAC0C,EAAEjB,IAAI;gCAAE,IAAKzB,CAAAA,IAAI,CAAA;6BAAG;;wBAC7DkE,SAAS,AAAC,qBAAG2B,IAAAA,yBAAgB,EAAC3C,UAAUa,OAAOE,QAClDtF,MAAM,CAAC;qEAAE8C,kBAAM+D;mCAAWA,QAAQ,QAAQ5H,YAAY+E,GAAG,CAAClB;2BAC1DjC,IAAI,CAAC,SAACC,GAAGC;mCAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE;2BAC1BoB,KAAK,CAAC,GAAGwC;wBACZa,OAAOoB,OAAO,CAAC,gBAAStF;qEAAPyB;4BACf,IAAMqE,WAAWhC,WAAWlC,GAAG,CAACH;4BAChC,IAAIqE,UAAU;gCACZA,SAASN,KAAK,IAAI,IAAKzH,CAAAA,QAAQiC,CAAAA;gCAC/B,IAAIgE,OAAOrB,GAAG,CAAClB,OAAOqE,SAASL,GAAG,GAAG;4BACvC,OAAO;gCACL3B,WAAWyB,GAAG,CAAC9D,MAAM;oCAAE+D,OAAO,IAAKzH,CAAAA,QAAQiC,CAAAA;oCAAIyF,KAAK;gCAAO;4BAC7D;wBACF;oBACF;oBAEA,sFAAsF;oBACtF,0EAA0E;oBACpE3C,aAAa,IAAIsC;oBACjBrC,kBAAkB,IAAIqC;yBACxB7B,iBAAAA;;;;oBACW;;wBAAMwC,IAAAA,2BAAkB,EAACvE,IAAIc,KAAKvD,OAAOsE;;;oBAAhDc,MAAM,AAAC,cAAiDxF,MAAM,CAAC,SAACqH;+BAAMpI,YAAY+E,GAAG,CAACqD,EAAEvE,IAAI;;oBAClG0C,IAAImB,OAAO,CAAC,gBAA8BtF;4BAA3ByB,aAAAA,MAAMwE,cAAAA,OAAOC,mBAAAA;wBAC1BpD,WAAWyC,GAAG,CAAC9D,MAAMwE;wBACrBlD,gBAAgBwC,GAAG,CAAC9D,MAAMyE;wBAC1B,IAAMJ,WAAWhC,WAAWlC,GAAG,CAACH;wBAChC,IAAIqE,UAAU;4BACZA,SAASN,KAAK,IAAI,IAAKzH,CAAAA,QAAQiC,CAAAA;4BAC/B8F,SAASL,GAAG,GAAG,AAAC,GAAe,OAAbK,SAASL,GAAG,EAAC;wBACjC,OAAO;4BACL3B,WAAWyB,GAAG,CAAC9D,MAAM;gCAAE+D,OAAO,IAAKzH,CAAAA,QAAQiC,CAAAA;gCAAIyF,KAAK;4BAAS;wBAC/D;oBACF;;;oBAGFjE,GAAG2E,IAAI,CAAC;oBACR3E,GAAG2E,IAAI,CAAC;oBACF/B,SAAS5C,GAAGG,OAAO,CAAC;oBACrB,kCAAA,2BAAA;;wBAAL,IAAK,YAAmBmC,iCAAnB,6BAAA,QAAA,yBAAA;2DAAA,iBAAOrC,uBAAM4C;4BAAkBD,OAAOgC,GAAG,CAAC3E,MAAM4C,EAAEmB,KAAK,EAAEnB,EAAEoB,GAAG,GAAE5C,YAAAA,KAAKjB,GAAG,CAACH,mBAAToB,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWlB,GAAG,CAACH,mBAAfqB,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBnB,GAAG,CAACH,mBAApBsB,kCAAAA,uBAA6B;;;wBAAnJ;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAEL,yFAAyF;oBACzF,8CAA8C;oBACxCuB,QAAQd,QAAQ,AAAC,UAAe,OAANA,OAAM,OAAK;oBAC3C,sFAAsF;oBACtF,2FAA2F;oBACrFe,gBAAgBhB,kBAAkB,yBAAyB;oBAC3Df,OAAOhB,GACVG,OAAO,CACN,AAAC,qIAEE2C,OAFkIC,eAAc,gIAE1I,OAAND,OAAM,yCAEV7B,GAAG,CAACQ;oBAEP,IAAIY,UAAUtD,IAAI,GAAG,GAAG;wBAChBiE,YAAYtG,iBAAiBa;wBAC9B,mCAAA,4BAAA;;4BAAL,IAAK,aAAayD,2BAAb,8BAAA,SAAA,0BAAA,kCAAmB;gCAAbd,MAAN;gCACH,IAAIA,IAAI2D,GAAG,KAAK,QAAQ,CAACxB,UAAUlB,GAAG,CAACjB,IAAID,IAAI,GAAa;gCACxDhB,OAAAA,KAAAA;gCACJ,IAAI;oCACFA,OAAO4F,IAAAA,oBAAY,EAACC,IAAAA,cAAI,EAAChE,IAAIiE,OAAO,EAAE7E,IAAID,IAAI,GAAa;gCAC7D,EAAE,eAAM;oCACN,UAAU,mEAAmE;gCAC/E;gCAC4BjB,kBAAAA,eAAeC,MAAM+D,YAAzC5D,UAAoBJ,gBAApBI,SAASE,SAAWN,gBAAXM;gCACjBY,IAAI2D,GAAG,GAAGzE;gCACV,IAAIc,IAAIuE,KAAK,IAAI,MAAMvE,IAAIuE,KAAK,GAAGP,IAAAA,wBAAc,EAACpD,KAAK,cAAcf,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;4BAC1I;;4BAXK;4BAAA;;;qCAAA,8BAAA;oCAAA;;;oCAAA;0CAAA;;;;oBAYP;oBAEA;;wBAAO0B;;;;IACT;;AAKO,SAAS5E,YAAY4D,EAAgB,EAAEc,GAAmB,EAAEkE,SAA0B;IAC3F,IAAMxD,YAAYyB,IAAAA,uBAAa,EAACnC,KAAKkE;IACrC,IAAQxE,UAA4BgB,UAA5BhB,SAASC,UAAmBe,UAAnBf,SAASqC,QAAUtB,UAAVsB;IAC1B,IAAMpB,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IAClH,IAAM0B,aAAaqD,UAAUxE,OAAO,KAAK0C,aAAa8B,UAAUvE,OAAO,KAAKyC,aAAa8B,UAAU7B,SAAS,KAAK;IACjH,IAAM8B,QAAQtD,aAAa,IAAIhD,IAAI+C,SAASvE,MAAM,CAAC,SAACiG;eAAM7C,QAAQ6C,GAAG5C,SAASC;UAAa,IAAI9B,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDc,GAAG,CAACO,UAAU6B,UAAU,EAA8BtG,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IAC1O,IAAI,CAAC6C,OAAO,OAAOmC;IACnB,IAAMC,YAAYlF,GAAGG,OAAO,CAAC,AAAC,2CAAgD,OAAN2C,OAAM,MAAI7B,GAAG;IACrF,IAAMkE,aAAa,IAAIxG,IAAIuG,UAAUnI,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IACtD,OAAO,IAAItB,IAAI,AAAC,qBAAGsG,OAAO9H,MAAM,CAAC,SAACiG;eAAM+B,WAAWhE,GAAG,CAACiC;;AACzD;AAYO,SAASnH,eAAe+D,EAAgB,EAAEc,GAAmB;IAClE,IAAMsE,cAAcrE,IAAAA,yBAAe,EAACD;IACpC,OAAOuE,IAAAA,qBAAW,EAACvE,KAAK/D,GAAG,CAAC,SAACuI;QAC3B,IAAMC,QAAQ,AAACvF,GAAGG,OAAO,CAAC,2DAA2DC,GAAG,CAACkF,MAAwBE,CAAC;QAClH,IAAMC,WAAWL,cAAc,AAACpF,GAAGG,OAAO,CAAC,6JAA6JC,GAAG,CAACkF,MAAwBE,CAAC,GAAG;QACxO,OAAO;YAAEF,MAAAA;YAAMC,OAAAA;YAAOE,UAAAA;YAAUlC,UAAUmC,IAAAA,+BAAqB,EAAC5E,KAAKwE;QAAM;IAC7E;AACF;AAYA,IAAMK,mBAAmB,IAAIhH,IAAI;IAAC;IAAQ;IAAU;IAAS;IAAS;CAAe;AAErF,yFAAyF;AACzF,8FAA8F;AAC9F,IAAMiH,mBAAmB;AAEzB,SAASC,MAASC,KAAU,EAAE/G,IAAY;IACxC,IAAMQ,MAAa,EAAE;IACrB,IAAK,IAAIf,IAAI,GAAGA,IAAIsH,MAAM1I,MAAM,EAAEoB,KAAKO,KAAMQ,IAAI1B,IAAI,CAACiI,MAAMzG,KAAK,CAACb,GAAGA,IAAIO;IACzE,OAAOQ;AACT;AAEA,iFAAiF;AACjF,4EAA4E;AAC5E,SAASwG,cAAc/F,EAAgB,EAAEiF,KAAkB;IACzDjF,GAAG2E,IAAI,CAAC;IACR3E,GAAG2E,IAAI,CAAC;IACR3E,GAAGG,OAAO,CAAC,mEAAmEyE,GAAG,CAACoB,KAAKC,SAAS,CAAE,qBAAGhB;AACvG;AAIO,SAASlJ,QAAQiE,EAAgB,EAAEc,GAAmB;QAAEkE,YAAAA,iEAA6B,CAAC;IAC3Fe,cAAc/F,IAAI5D,YAAY4D,IAAIc,KAAKkE;IACvC,IAAMkB,aAAa;IACnB,IAAMC,WAAW;IAEjB,IAAMC,OAAOpG,GAAGG,OAAO,CAAC,AAAC,iFAA2F,OAAX+F,aAAc9F,GAAG;IAE1H,IAAMiG,UAAU,AAACrG,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAEoE,IAAI;OAAEnI,MAAM,CAAC,SAACmI;eAAS,CAACK,iBAAiBxE,GAAG,CAACmE;;IAC1J,6FAA6F;IAC7F,+FAA+F;IAC/F,IAAMgB,YAAmB,EAAE;QACtB,kCAAA,2BAAA;;;YAAA,IAAMC,QAAN;YACH,IAAMC,QAAQD,MAAMxJ,GAAG,CAAC,SAACuI,MAAM9G;gBAC7B,IAAMiI,SAAS,AAAC,IAA8B,OAA3BnB,KAAKxI,KAAK,CAAC,KAAKgI,IAAI,CAAC,OAAM;gBAC9C,OAAO,AAAC,SAAuBtG,OAAfiI,QAAO,UAA2CA,OAAnCjI,GAAE,mCAA2DiI,OAA1BA,QAAO,qBAA8CjI,OAA3BiI,QAAO,sBAAsB,OAAFjI;YACzH;YACA,IAAMkI,SAAS1G,GAAGG,OAAO,CAAC,AAAC,UAA8C+F,OAArCM,MAAM1B,IAAI,CAAC,OAAM,sBAA+B,OAAXoB,aAAc9F,GAAG;YAC1FmG,MAAMzC,OAAO,CAAC,SAACwB,MAAM9G;oBAAgFkI;uBAA1EJ,UAAUzI,IAAI,CAAC;oBAAE8I,OAAOrB;oBAAMsB,UAAUF,MAAM,CAAC,AAAC,IAAK,OAAFlI,GAAI;oBAAYqI,IAAI,GAAGH,WAAAA,MAAM,CAAC,AAAC,IAAK,OAAFlI,GAAI,cAAfkI,sBAAAA,WAA8B;gBAAG;;QACxI;QAPA,QAAK,YAAeb,MAAMQ,SAAST,sCAA9B,SAAA,6BAAA,QAAA,yBAAA;;QAAA;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAQLU,UAAUtI,IAAI,CAAC,SAACC,GAAGC;eAAM,AAACA,EAAE0I,QAAQ,GAAe3I,EAAE2I,QAAQ;;IAC7D,IAAME,SAASR,UAAUjH,KAAK,CAAC,GAAG;IAElC,IAAM0H,OAAO7C,IAAAA,wBAAc,EAACpD,KAAK,UAAWd,GAAGG,OAAO,CAAC,AAAC,oKAA4K,OAATgG,UAAS,qCAAmClF,GAAG,KAAe,EAAE;IAE3R,IAAM+F,SAAShH,GAAGG,OAAO,CAAC,AAAC,wFAAgG,OAAX+F,YAAW,oCAAkCjF,GAAG;IAEhK,OAAO;QAAEmF,MAAAA;QAAMU,QAAAA;QAAQG,aAAaX,UAAUlJ,MAAM;QAAE8J,UAAUC,IAAAA,uBAAa,EAACrG;QAAMsG,SAASnL,eAAe+D,IAAIc;QAAMiG,MAAAA;QAAMC,QAAAA;IAAO;AACrI;AAIO,SAAS7K,YAAY8I,KAAe,EAAEoC,GAAW;IACtD,IAAMC,QAAQrC,MAAMsC,IAAI,CAAC,SAACnE;eAAMA,MAAMiE;;IACtC,IAAIC,OAAO,OAAOA;IAClB,IAAME,OAAOC,cAAK,CAACC,QAAQ,CAACL,KAAKxK,OAAO,CAAC,UAAU,IAAII,WAAW;IAClE,IAAM0K,UAAU1C,MAAM9H,MAAM,CAAC,SAACiG;eAAMqE,cAAK,CAACC,QAAQ,CAACtE,GAAGvG,OAAO,CAAC,UAAU,IAAII,WAAW,OAAOuK;;IAC9F,IAAIG,QAAQvK,MAAM,KAAK,GAAG,OAAOuK,OAAO,CAAC,EAAE;IAC3C,IAAIA,QAAQvK,MAAM,GAAG,GAAG,MAAM,IAAIqG,oBAAU,CAAC,kBAAkB,AAAC,IAAyBkE,OAAtBN,KAAI,oBAAqC,OAAnBM,QAAQ7C,IAAI,CAAC;IACtG,MAAM,IAAIrB,oBAAU,CAAC,kBAAkB,AAAC,oBAAuB,OAAJ4D,KAAI;AACjE;AAyBA,IAAMO,kBAAkB;AAIjB,SAAS5L,KAAKgE,EAAgB,EAAEc,GAAmB,EAAE+G,OAAe;QAAE7C,YAAAA,iEAA6B,CAAC;QAKrF9E,mBAwBEA;IA5BtB,IAAM+E,QAAQ,AAACjF,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IAC/G,IAAMA,OAAO9D,YAAY8I,OAAO4C;IAEhC,IAAM3H,MAAMF,GAAGG,OAAO,CAAC,8CAA8CC,GAAG,CAACH;IACzE,IAAM6H,cAAc5H,oBAAAA,IAAI6H,YAAY,cAAhB7H,+BAAAA,oBAAsC;IAC1D,IAAM8H,cAAmB,CAAC;QACrB,kCAAA,2BAAA;;QAAL,QAAK,YAAsBC,OAAOC,OAAO,CAAChI,yBAArC,SAAA,6BAAA,QAAA,yBAAA,iCAA2C;YAA3C,mCAAA,iBAAOiI,sBAAKC;YACf,IAAI,CAACzC,iBAAiBxE,GAAG,CAACgH,QAAQC,UAAU,MAAMJ,WAAW,CAACG,IAAI,GAAGC;QACvE;;QAFK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAIL,IAAMC,gBAAgBnE,IAAAA,wBAAc,EAACpD,KAAK,cAAc,AAACd,GAAGG,OAAO,CAAC,uDAAuDC,GAAG,CAACH,MAAwBuF,CAAC,GAAG;IAC3J,IAAM8C,WAAWpE,IAAAA,wBAAc,EAACpD,KAAK,cAAed,GAAGG,OAAO,CAAC,2GAA2Gc,GAAG,CAAChB,MAAM2H,mBAA6B,EAAE;IAEnN,IAAIW,WAAqB,EAAE;IAC3B,IAAIC,YAAsB,EAAE;IAC5B,IAAIC,aAAuB,EAAE;IAC7B,IAAIC,iBAAiB;IACrB,IAAMC,WAAWvM,YAAY4D,IAAIc,KAAKkE;IACtC,IAAId,IAAAA,wBAAc,EAACpD,KAAK,UAAU;QAChC,IAAMvB,MAAMS,GAAGG,OAAO,CAAC,+DAA+Dc,GAAG,CAAChB;QAC1FsI,WAAY,qBAAG,IAAI5J,IAAIY,IAAIpC,MAAM,CAAC,SAACyL;mBAAMA,EAAEC,GAAG,KAAK;WAAM9L,GAAG,CAAC,SAAC6L;mBAAMA,EAAEC,GAAG;;QACzEJ,aAAalJ,IAAIpC,MAAM,CAAC,SAACyL;mBAAMA,EAAEC,GAAG,KAAK;WAAM9L,GAAG,CAAC,SAAC6L;mBAAMA,EAAEE,MAAM;;QAClEJ,iBAAiB,AAAC1I,GAAGG,OAAO,CAAC,4DAA4DC,GAAG,CAACH,MAAwBuF,CAAC;QACtHgD,YAAY,AAACxI,GAAGG,OAAO,CAAC,qEAAqEc,GAAG,CAAChB,MAAM2H,iBAA4C7K,GAAG,CAAC,SAACmE;mBAAMA,EAAE6H,GAAG;;IACrK;IAEA,OAAO;QACL9I,MAAAA;QACA+I,QAAQ9J,KAAK+J,IAAI,CAAC,EAAE/I,aAAAA,IAAIgJ,KAAK,cAAThJ,wBAAAA,aAAwB,KAAK;QACjD8H,aAAAA;QACAF,YAAAA;QACAQ,UAAAA;QACAC,UAAUA,SAASlJ,KAAK,CAAC,GAAGuI;QAC5BY,WAAAA;QACAC,YAAYA,WAAWpJ,KAAK,CAAC,GAAGuI;QAChCS,eAAAA;QACAc,eAAeZ,SAASnL,MAAM;QAC9BsL,gBAAAA;QACAU,iBAAiBX,WAAWrL,MAAM;QAClCiM,KAAK,AAAC;YAAC;YAAY;SAAQ,CAAmBlM,MAAM,CAAC,SAACmI;mBAAS,CAACpB,IAAAA,wBAAc,EAACpD,KAAKwE;;IACtF;AACF;AAIO,SAAepJ,aAAa8D,EAAgB,EAAEc,GAAmB,EAAE+G,OAAe,EAAE7C,SAA0B,EAAEvD,CAAS;;YACxHwD,OACAhF,MAEAsI,UACAC,WACA/H,SAKAe,WAaA8H;;;;oBAvBArE,QAAQ,AAACjF,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBACzGA,OAAO9D,YAAY8I,OAAO4C;oBAE1BU,WAAW,AAACvI,GAAGG,OAAO,CAAC,oEAAoEc,GAAG,CAAChB,MAAiClD,GAAG,CAAC,SAACmE;+BAAMA,EAAE2H,GAAG;;oBAChJL,YAAY,AAACxI,GAAGG,OAAO,CAAC,gDAAgDc,GAAG,CAAChB,MAAiClD,GAAG,CAAC,SAACmE;+BAAMA,EAAE6H,GAAG;;oBAC7HtI,UAAU,IAAI9B,IAAI;wBAACsB;sBAAD,OAAO,qBAAGsI,WAAU,qBAAGC;oBAE/C,yFAAyF;oBACzF,2FAA2F;oBAC3F,yDAAyD;oBACnDhH,YAAYyB,IAAAA,uBAAa,EAACnC,KAAKkE;oBACrC,IAAI,CAACuE,IAAAA,sBAAY,EAACzI,MAAM;wBACtB,MAAM,IAAI2C,oBAAU,CAAC,kBAAkB;oBACzC;oBACA,oFAAoF;oBACpF,yFAAyF;oBACzF,uDAAuD;oBACvD,IAAI,CAACjC,UAAU+B,QAAQ,EAAE;wBACvB,MAAM,IAAIE,oBAAU,CAAC,uBAAuB,AAAC,WAA+B,OAArBjC,UAAU6B,UAAU,EAAC;oBAC9E;oBACA,IAAI,CAACG,IAAAA,qBAAY,EAAC1C,MAAM;wBACtB,MAAM,IAAI2C,oBAAU,CAAC,uBAAuB;oBAC9C;oBACM6F,UAAUlN,YAAY4D,IAAIc,KAAKkE;oBACrC,oFAAoF;oBACpF,oDAAoD;oBACpD;;wBAAMwE,IAAAA,qBAAY,EAACxJ,IAAIc,KAAKA,IAAIiE,OAAO;;;oBAAvC;oBACA,IAAI,CAAC0E,IAAAA,qBAAY,EAACzJ,IAAIC,OAAO;wBAC3B,MAAM,IAAIwD,oBAAU,CAAC,qBAAqB,AAAC,GAAO,OAALxD,MAAK;oBACpD;oBACA,IAAI,CAACY,mBAAmBb,IAAIc,KAAKwI,UAAU;;;;oBAC3C;;wBAAOI,IAAAA,qBAAY,EAAC1J,IAAIc,KAAKb,MAAM;4BAAEQ,SAAAA;4BAAS6I,SAAAA;4BAAS7H,GAAAA;wBAAE;;;;IAC3D"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands.ts"],"sourcesContent":["import { readFileSync } from 'node:fs';\nimport { join, matchesGlob } from 'node:path';\nimport posix from 'node:path/posix';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { FeatureName, ResolvedConfig, SearchOverrides } from './config.ts';\nimport { anyPresetEmbeds, contentTokenize, embedEnabled, featureEnabled, featureStates, presetNames, presetSemanticEnabled, resolveSearch } from './config.ts';\nimport { SenseError } from './errors.ts';\nimport { embedPending, hasEmbedding, modelPresent, semanticCandidates, similarNotes } from './features/embed.ts';\nimport { linkEdges } from './features/index.ts';\nimport { personalizedRank } from './graph.ts';\nimport type { Row } from './output.ts';\nimport { searchError } from './search-error.ts';\nimport { segmentMatch } from './segment.ts';\n\n// The three commands: mapTree (orient), search (locate), peek (structure).\n// Each returns data; cli.ts renders. All of them degrade when a feature is off.\n\n// Mirrors the main columns onto the sidecars, so a title match found through title_seg ranks\n// like a title match found through title, not like a body match.\nconst WEIGHTED_BM25 = 'bm25(content, 10.0, 5.0, 1.0, 0, 10.0, 5.0, 1.0)';\nconst RRF_K = 60;\n\n// snippet() re-tokenizes each candidate doc, superlinearly: ~10s for one 1MB doc\n// (BENCHMARKING.md). Past this bound, rows get the linear JS excerpt instead.\nconst SNIPPET_BOUND = 16_384;\nconst EXCERPT_WINDOW = 160;\n\n// Bare terms from an FTS5 query string: strips operators/quoting so the oversized-doc excerpt\n// scan matches the same words the query matched on, not FTS5 syntax.\nfunction extractBareTerms(query: string): string[] {\n  const cleaned = query\n    .replace(/\"/g, ' ')\n    .replace(/[()*]/g, ' ')\n    .replace(/\\b(AND|OR|NOT|NEAR)\\b(\\/\\d+)?/gi, ' ');\n  return cleaned\n    .split(/\\s+/)\n    .map((tok) => tok.replace(/^[A-Za-z_]\\w*:/, '')) // column filter, e.g. title:term\n    .map((tok) => tok.toLowerCase().trim())\n    .filter((tok) => tok.length > 0);\n}\n\nfunction findOccurrences(haystackLower: string, terms: string[]): Array<{ start: number; end: number; term: string }> {\n  const occ: Array<{ start: number; end: number; term: string }> = [];\n  for (const term of terms) {\n    let idx = 0;\n    for (;;) {\n      const found = haystackLower.indexOf(term, idx);\n      if (found === -1) break;\n      occ.push({ start: found, end: found + term.length, term });\n      idx = found + term.length;\n    }\n  }\n  // Longest span first at equal start, so \"tests\" beats its substring \"test\" and the\n  // whole word gets highlighted; the emit loop then absorbs the shorter overlap.\n  return occ.sort((a, b) => a.start - b.start || b.end - a.end);\n}\n\n// Slides a window over the sorted occurrences, same semantics as FTS5's own best-window\n// pick: most distinct terms, ties broken by most total hits.\nfunction bestWindowStart(occ: Array<{ start: number; end: number; term: string }>, windowSize: number): number {\n  let best = occ[0].start;\n  let bestDistinct = 0;\n  let bestCount = 0;\n  for (let i = 0; i < occ.length; i++) {\n    const winEnd = occ[i].start + windowSize;\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    if (seen.size > bestDistinct || (seen.size === bestDistinct && count > bestCount)) {\n      best = occ[i].start;\n      bestDistinct = seen.size;\n      bestCount = count;\n    }\n  }\n  return best;\n}\n\n// snippet()-shaped excerpt: matched terms wrapped in «», … at cut edges. Linear in doc\n// length, only run for rows actually returned (<= k), unlike snippet()'s per-row cost.\nfunction computeExcerpt(text: string, terms: string[]): { excerpt: string; offset: number } {\n  const occ = findOccurrences(text.toLowerCase(), terms);\n  if (occ.length === 0) {\n    // This is a raw substring scan, not porter-stemmed: a doc matched only through a\n    // stemmed variant (query \"negotiate\" vs doc \"negotiating\") finds no occurrence here.\n    // Fall back to the doc's start, unmarked, rather than claim a match that isn't there.\n    const end = Math.min(text.length, EXCERPT_WINDOW);\n    return { excerpt: `${text.slice(0, end).replace(/\\s+/g, ' ').trim()}${end < text.length ? '…' : ''}`, offset: 0 };\n  }\n  const start = bestWindowStart(occ, EXCERPT_WINDOW);\n  const end = Math.min(text.length, start + EXCERPT_WINDOW);\n  let out = '';\n  let cursor = start;\n  for (const o of occ) {\n    if (o.start < start || o.end > 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, end);\n  const prefix = start > 0 ? '…' : '';\n  const suffix = end < text.length ? '…' : '';\n  return { excerpt: `${prefix}${out.replace(/\\s+/g, ' ')}${suffix}`, offset: start };\n}\n\nfunction 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\nfunction lineRangeFor(db: DatabaseSync, path: string, line: number): string | null {\n  const row = db.prepare('SELECT start_line, end_line FROM sections WHERE \"path\" = ? AND start_line <= ? AND end_line >= ? ORDER BY start_line DESC LIMIT 1').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}\n\n// node:path's matchesGlob is experimental (stable behind an unstable-API flag) as of the\n// engines floor (Node >=22.20); scope filtering only ever needs single-pattern matching, so\n// it's used here in JS rather than running a directory walk in the query path.\nfunction inScope(path: string, include: string[], exclude?: string[]): boolean {\n  if (!include.some((g) => matchesGlob(path, g))) return false;\n  if (exclude?.some((g) => matchesGlob(path, g))) return false;\n  return true;\n}\n\nfunction scopeHasEmbeddings(db: DatabaseSync, cfg: ResolvedConfig, scopedPaths: Set<string>): boolean {\n  if (!anyPresetEmbeds(cfg)) return false; // the embeddings table doesn't exist at all in this case\n  const rows = db.prepare('SELECT DISTINCT \"path\" FROM embeddings').all() as Array<{ path: string }>;\n  return rows.some((r) => scopedPaths.has(r.path));\n}\n\n// BM25 + link expansion + vectors, fused by reciprocal rank; `via` names the signal per row.\n// `opts` arrives already resolved (config.ts:resolveSearch).\nexport async function search(db: DatabaseSync, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<Row[]> {\n  const effective = resolveSearch(cfg, opts);\n  const { k, include, exclude } = effective;\n\n  const allPaths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  // A preset scope reads the coverage reconcile indexed; re-matching globs here could disagree\n  // with it. Only ad-hoc scope flags, which have no persisted coverage, pay the JS match.\n  const adHocScope = opts.include !== undefined || opts.exclude !== undefined || opts.noExclude === true;\n  const scopedPaths = adHocScope ? new Set(allPaths.filter((p) => inScope(p, include, exclude))) : new Set((db.prepare('SELECT \"path\" FROM preset_files WHERE preset = ?').all(effective.presetName) as Array<{ path: string }>).map((r) => r.path));\n  // A scope narrower than the whole index needs a bigger candidate pool before filtering, or\n  // filtering can starve k even though enough in-scope matches exist further down the ranked\n  // list that a plain over-fetch wouldn't have reached.\n  const scopeActive = scopedPaths.size < allPaths.length;\n  const fetch = scopeActive ? Math.max(k * 5, 50) : Math.max(k * 3, 30);\n\n  // Asking for vectors without a model is a misconfiguration, not a mode: degrading would make\n  // the same search answer differently before and after a download. semantic:false never asks.\n  const wantsVectors = effective.semantic && anyPresetEmbeds(cfg);\n  if (wantsVectors && !modelPresent(cfg)) {\n    throw new SenseError('EMBED_MODEL_MISSING', `preset \"${effective.presetName}\" searches with vectors, but the embedding model is not available; run \\`sense download\\`, or set \"semantic\": false on that preset to search on words and links`);\n  }\n  const semanticEnabled = wantsVectors && scopeHasEmbeddings(db, cfg, scopedPaths);\n\n  // Terms pass to MATCH as written, with one transform: a run of text whose language marks no\n  // word boundaries becomes a quoted grapheme phrase (and a title:/summary:/text: qualifier\n  // ahead of it retargets its _seg column), matching how it was indexed. Text that already\n  // carries boundaries comes through untouched, so this is a no-op for the languages that\n  // never needed it. Gated on the same predicate that decided whether the sidecars were\n  // populated (contentTokenize(cfg) === undefined), so index and query can't disagree. Invalid\n  // syntax still errors rather than being rewritten.\n  // --where\n  // applies inside the candidate query (a post-filter would drop matches ranked past the pool)\n  // 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  // Docs past SNIPPET_BOUND skip snippet() entirely -- SQLite\n  // short-circuits the untaken CASE branch, so it's never invoked on them.\n  // Column 2 (text), not -1 (best column): -1 could surface a _seg sidecar as the excerpt,\n  // which is machine-spaced and not what the author wrote. A row that matches only in a\n  // sidecar gets an unhighlighted text excerpt below instead -- a stated cost.\n  const matchSql = `SELECT content.path AS path, CASE WHEN length(content.text) <= ${SNIPPET_BOUND} THEN snippet(content, 2, '«', '»', '…', 10) ELSE NULL END AS hit FROM content ${whereJoin} WHERE content MATCH ? ${whereCond} ORDER BY ${WEIGHTED_BM25} LIMIT ${fetch}`;\n  const query = contentTokenize(cfg) === undefined ? segmentMatch(terms) : terms;\n  let matchRows: Array<{ path: string; hit: string | null }>;\n  try {\n    matchRows = db.prepare(matchSql).all(query) as Array<{ path: string; hit: string | null }>;\n  } catch (err) {\n    throw searchError(err as Error, terms, scope);\n  }\n  // Scope filtering happens in JS, on each candidate list, rather than in SQL: FTS5 match,\n  // link expansion, and vector search all run unscoped above (cheap to over-fetch), then get\n  // filtered here against the effective include/exclude before ranking is finalized.\n  matchRows = matchRows.filter((r) => scopedPaths.has(r.path));\n\n  const hits = new Map(matchRows.map((r) => [r.path, r.hit]));\n  // hit === null here means the bound suppressed snippet(), not \"no match\" -- distinguish\n  // from via='link' rows (never in matchRows, so absent from this set) below.\n  const oversized = new Set(matchRows.filter((r) => r.hit === null).map((r) => r.path));\n  const candidates = new Map<string, { score: number; via: string }>();\n  matchRows.forEach((r, i) => {\n    candidates.set(r.path, { score: 1 / (RRF_K + i), via: 'match' });\n  });\n\n  const edges = featureEnabled(cfg, 'links') && matchRows.length > 0 ? linkEdges(db) : [];\n  if (edges.length > 0) {\n    // Gates the label only, not the score: restart mass ranks every seed without an incident\n    // edge, but dropping it from the score reweights fusion (FEVER hit@10 0.997 -> 0.907).\n    const linked = new Set(edges.flat());\n    const seeds = new Map(matchRows.map((r, i) => [r.path, 1 / (i + 1)]));\n    const ranked = [...personalizedRank(allPaths, edges, seeds)]\n      .filter(([path, score]) => score > 1e-9 && scopedPaths.has(path))\n      .sort((a, b) => b[1] - a[1])\n      .slice(0, fetch);\n    ranked.forEach(([path], i) => {\n      const existing = candidates.get(path);\n      if (existing) {\n        existing.score += 1 / (RRF_K + i);\n        if (linked.has(path)) existing.via = 'match+link';\n      } else {\n        candidates.set(path, { score: 1 / (RRF_K + i), via: 'link' });\n      }\n    });\n  }\n\n  // Vector expansion, invoked only: a third RRF list at the swept flat-region constants\n  // (weight 1, pool = fetch). Each row carries its best chunk's line range.\n  const chunkLines = new Map<string, string>();\n  const chunkSimilarity = new Map<string, number>();\n  if (semanticEnabled) {\n    const vec = (await semanticCandidates(db, cfg, terms, fetch)).filter((v) => scopedPaths.has(v.path));\n    vec.forEach(({ path, lines, similarity }, i) => {\n      chunkLines.set(path, lines);\n      chunkSimilarity.set(path, similarity);\n      const existing = candidates.get(path);\n      if (existing) {\n        existing.score += 1 / (RRF_K + i);\n        existing.via = `${existing.via}+vector`;\n      } else {\n        candidates.set(path, { score: 1 / (RRF_K + i), via: 'vector' });\n      }\n    });\n  }\n\n  db.exec('DROP TABLE IF EXISTS _search');\n  db.exec('CREATE TEMP TABLE _search (\"path\" TEXT PRIMARY KEY, score REAL, via TEXT, hit TEXT, lines TEXT, similarity REAL)');\n  const insert = db.prepare('INSERT INTO _search (\"path\", score, via, hit, lines, similarity) VALUES (?, ?, ?, ?, ?, ?)');\n  for (const [path, c] of candidates) insert.run(path, c.score, c.via, hits.get(path) ?? null, chunkLines.get(path) ?? null, chunkSimilarity.get(path) ?? null);\n\n  // Already scope-filtered above; the final select reapplies --where only for link-derived\n  // rows, which never passed through whereCond.\n  const where = scope ? `WHERE (${scope})` : '';\n  // lines is always present now: semantic rows carry their chunk's range, oversized-doc\n  // lexical rows gain one below, everything else stays null. similarity stays semantic-only.\n  const similarityCol = semanticEnabled ? ', _search.similarity' : '';\n  const rows = db\n    .prepare(\n      `SELECT f.\"path\" AS path, content.title, content.summary, _search.hit, _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    .all(k) as Row[];\n\n  if (oversized.size > 0) {\n    const bareTerms = extractBareTerms(terms);\n    for (const row of rows) {\n      if (row.hit !== null || !oversized.has(row.path as string)) continue;\n      let text: string;\n      try {\n        text = readFileSync(join(cfg.baseDir, row.path as string), 'utf8');\n      } catch {\n        continue; // vanished since the match; leave hit/lines null rather than throw\n      }\n      const { excerpt, offset } = computeExcerpt(text, bareTerms);\n      row.hit = excerpt;\n      if (row.lines == null) row.lines = featureEnabled(cfg, 'sections') ? lineRangeFor(db, row.path as string, lineNumberAt(text, offset)) : null;\n    }\n  }\n\n  return rows;\n}\n\n// The scope resolver for non-search commands (path, peek, map): same coverage rule search()\n// applies (preset_files for a named preset, JS glob matching for an ad hoc include/exclude),\n// then narrowed by the resolved `where`.\nexport function scopedPaths(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides): Set<string> {\n  const effective = resolveSearch(cfg, overrides);\n  const { include, exclude, where } = effective;\n  const allPaths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const adHocScope = overrides.include !== undefined || overrides.exclude !== undefined || overrides.noExclude === true;\n  const paths = adHocScope ? new Set(allPaths.filter((p) => inScope(p, include, exclude))) : new Set((db.prepare('SELECT \"path\" FROM preset_files WHERE preset = ?').all(effective.presetName) as Array<{ path: string }>).map((r) => r.path));\n  if (!where) return paths;\n  const whereRows = db.prepare(`SELECT \"path\" FROM frontmatter f WHERE (${where})`).all() as Array<{ path: string }>;\n  const wherePaths = new Set(whereRows.map((r) => r.path));\n  return new Set([...paths].filter((p) => wherePaths.has(p)));\n}\n\nexport interface PresetCoverage {\n  name: string;\n  files: number;\n  embedded: number;\n  // Reported so 0 embedded reads as \"this scope declined vectors\" rather than \"not yet built\".\n  semantic: boolean;\n}\n\n// Indexing derives from presets, so the derivation stays visible. Read from preset_files, not\n// recomputed from globs, so it reflects the cache rather than the config.\nexport function presetCoverage(db: DatabaseSync, cfg: ResolvedConfig): PresetCoverage[] {\n  const embedActive = anyPresetEmbeds(cfg);\n  return presetNames(cfg).map((name) => {\n    const files = (db.prepare('SELECT COUNT(*) AS n FROM preset_files WHERE preset = ?').get(name) as { n: number }).n;\n    const embedded = embedActive ? (db.prepare('SELECT COUNT(*) AS n FROM preset_files pf WHERE pf.preset = ? AND EXISTS (SELECT 1 FROM embeddings e WHERE e.\"path\" = pf.\"path\" AND e.vector IS NOT NULL)').get(name) as { n: number }).n : 0;\n    return { name, files, embedded, semantic: presetSemanticEnabled(cfg, name) };\n  });\n}\n\nexport interface TreeMap {\n  docs: { count: number; bytes: number };\n  fields: Row[]; // top 20 by coverage; fieldsTotal carries the real count\n  fieldsTotal: number;\n  features: { on: FeatureName[]; off: FeatureName[] };\n  presets: PresetCoverage[];\n  hubs: Row[];\n  recent: Row[];\n}\n\nconst INTERNAL_COLUMNS = new Set(['path', '_mtime', '_size', '_rank', '_parse_error']);\n\n// A result row is capped at SQLITE_MAX_COLUMN (2000, default); two aggregate expressions\n// per field keeps a chunk's row safely under that regardless of how many fields the tree has.\nconst MAP_COLUMN_CHUNK = 300;\n\nfunction chunk<T>(items: T[], size: number): T[][] {\n  const out: T[][] = [];\n  for (let i = 0; i < items.length; i += size) out.push(items.slice(i, i + size));\n  return out;\n}\n\n// Materializes the resolved scope into a temp table (same shape as traverse.ts's\n// allowed_nodes) so every mapTree query can join/filter against it cheaply.\nfunction setupMapScope(db: DatabaseSync, paths: Set<string>): void {\n  db.exec('DROP TABLE IF EXISTS _map_scope');\n  db.exec('CREATE TEMP TABLE _map_scope (\"path\" TEXT PRIMARY KEY)');\n  db.prepare('INSERT INTO _map_scope SELECT DISTINCT value FROM json_each(?1)').run(JSON.stringify([...paths]));\n}\n\n// What is this scope: fixed-size output regardless of tree size. Coverage and features stay\n// global -- they describe the tree, not the current question.\nexport function mapTree(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides = {}): TreeMap {\n  setupMapScope(db, scopedPaths(db, cfg, overrides));\n  const scopeWhere = 'WHERE \"path\" IN (SELECT \"path\" FROM _map_scope)';\n  const scopeAnd = 'AND f.\"path\" IN (SELECT \"path\" FROM _map_scope)';\n\n  const docs = db.prepare(`SELECT COUNT(*) AS count, COALESCE(SUM(\"_size\"), 0) AS bytes FROM frontmatter ${scopeWhere}`).get() as { count: number; bytes: number };\n\n  const columns = (db.prepare('PRAGMA table_info(frontmatter)').all() as Array<{ name: string }>).map((r) => r.name).filter((name) => !INTERNAL_COLUMNS.has(name));\n  // Observed types, not declared: SQLite types per value, so a field can be text in most notes\n  // and numeric in a few. One aggregate scan per chunk of columns; FILTER matches COUNT's nulls.\n  const allFields: Row[] = [];\n  for (const group of chunk(columns, MAP_COLUMN_CHUNK)) {\n    const exprs = group.map((name, i) => {\n      const quoted = `\"${name.split('\"').join('\"\"')}\"`;\n      return `COUNT(${quoted}) AS n${i}, GROUP_CONCAT(DISTINCT typeof(${quoted})) FILTER (WHERE ${quoted} IS NOT NULL) AS t${i}`;\n    });\n    const result = db.prepare(`SELECT ${exprs.join(', ')} FROM frontmatter ${scopeWhere}`).get() as Record<string, number | string | null>;\n    group.forEach((name, i) => allFields.push({ field: name, coverage: result[`n${i}`] as number, type: (result[`t${i}`] as string) ?? '' }));\n  }\n  allFields.sort((a, b) => (b.coverage as number) - (a.coverage as number));\n  const fields = allFields.slice(0, 20);\n\n  const hubs = featureEnabled(cfg, 'rank') ? (db.prepare(`SELECT f.\"path\" AS path, round(f.\"_rank\" * 100, 2) AS rank, content.title FROM frontmatter f JOIN content ON content.path = f.\"path\" WHERE f.\"_rank\" IS NOT NULL ${scopeAnd} ORDER BY f.\"_rank\" DESC LIMIT 8`).all() as Row[]) : [];\n\n  const recent = db.prepare(`SELECT \"path\", datetime(\"_mtime\" / 1000, 'unixepoch') AS modified FROM frontmatter ${scopeWhere} ORDER BY \"_mtime\" DESC LIMIT 5`).all() as Row[];\n\n  return { docs, fields, fieldsTotal: allFields.length, features: featureStates(cfg), presets: presetCoverage(db, cfg), hubs, recent };\n}\n\n// Note resolution shared by peek and path: an exact path, or a unique basename (case\n// insensitive, .md stripped).\nexport function resolveNote(paths: string[], arg: string): string {\n  const exact = paths.find((p) => p === arg);\n  if (exact) return exact;\n  const base = posix.basename(arg).replace(/\\.md$/i, '').toLowerCase();\n  const matches = paths.filter((p) => posix.basename(p).replace(/\\.md$/i, '').toLowerCase() === base);\n  if (matches.length === 1) return matches[0];\n  if (matches.length > 1) throw new SenseError('NOTE_AMBIGUOUS', `\"${arg}\" is ambiguous: ${matches.join(', ')}`);\n  throw new SenseError('NOTE_NOT_FOUND', `no note matches \"${arg}\"`);\n}\n\nexport interface Peek {\n  path: string;\n  tokens: number;\n  frontmatter: Row;\n  // Set when the note's frontmatter was refused, so an empty frontmatter block reads as \"did\n  // not parse\" rather than \"has none\". Same reason `_parse_error` sits in the row.\n  parseError: string | null;\n  sections: Row[];\n  outbound: string[];\n  backlinks: string[];\n  unresolved: string[];\n  // Totals before truncation: a hub can have thousands of backlinks (or a note thousands of\n  // headings), and peek's whole point is bounded output. Query the sections/links tables\n  // directly for the full list.\n  sectionsTotal: number;\n  outboundTotal: number;\n  backlinksTotal: number;\n  unresolvedTotal: number;\n  // Bounded k-hop expansion beyond the immediate ring already shown by outbound/backlinks\n  // (depth starts at 2).\n  off: FeatureName[]; // disabled features whose blocks are omitted (not empty)\n}\n\nconst PEEK_LIST_LIMIT = 20;\n\n// peek: everything about one note except its prose -- frontmatter, outline with line\n// ranges + token estimates (so the follow-up Read is a range, not the file), links both ways.\nexport function peek(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides: SearchOverrides = {}): Peek {\n  const paths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const path = resolveNote(paths, pathArg);\n\n  const row = db.prepare('SELECT * FROM frontmatter WHERE \"path\" = ?').get(path) as Row;\n  const parseError = (row._parse_error as string | null) ?? null;\n  const frontmatter: Row = {};\n  for (const [key, value] of Object.entries(row)) {\n    if (!INTERNAL_COLUMNS.has(key) && value !== null) frontmatter[key] = value;\n  }\n\n  const sectionsTotal = featureEnabled(cfg, 'sections') ? (db.prepare('SELECT COUNT(*) AS n FROM sections WHERE \"path\" = ?').get(path) as { n: number }).n : 0;\n  const sections = featureEnabled(cfg, 'sections') ? (db.prepare('SELECT level, heading, start_line, end_line, tokens FROM sections WHERE \"path\" = ? ORDER BY idx LIMIT ?').all(path, PEEK_LIST_LIMIT) as Row[]) : [];\n\n  let outbound: string[] = [];\n  let backlinks: string[] = [];\n  let unresolved: string[] = [];\n  let backlinksTotal = 0;\n  const _allowed = scopedPaths(db, cfg, overrides);\n  if (featureEnabled(cfg, 'links')) {\n    const out = db.prepare('SELECT target, dst FROM links WHERE src = ? ORDER BY target').all(path) as Array<{ target: string; dst: string | null }>;\n    outbound = [...new Set(out.filter((l) => l.dst !== null).map((l) => l.dst as string))];\n    unresolved = out.filter((l) => l.dst === null).map((l) => l.target);\n    backlinksTotal = (db.prepare('SELECT COUNT(DISTINCT src) AS n FROM links WHERE dst = ?').get(path) as { n: number }).n;\n    backlinks = (db.prepare('SELECT DISTINCT src FROM links WHERE dst = ? ORDER BY src LIMIT ?').all(path, PEEK_LIST_LIMIT) as Array<{ src: string }>).map((r) => r.src);\n  }\n\n  return {\n    path,\n    tokens: Math.ceil(((row._size as number) ?? 0) / 4),\n    frontmatter,\n    parseError,\n    sections,\n    outbound: outbound.slice(0, PEEK_LIST_LIMIT),\n    backlinks,\n    unresolved: unresolved.slice(0, PEEK_LIST_LIMIT),\n    sectionsTotal,\n    outboundTotal: outbound.length,\n    backlinksTotal,\n    unresolvedTotal: unresolved.length,\n    off: (['sections', 'links'] as FeatureName[]).filter((name) => !featureEnabled(cfg, name)),\n  };\n}\n\n// Notes most similar by cosine, excluding self and everything already linked either way.\n// Its own command, not a peek section: a full embeddings scan is ~480ms at 26k notes.\nexport async function relatedNotes(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides: SearchOverrides, k: number): Promise<Array<{ path: string; similarity: number }>> {\n  const paths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const path = resolveNote(paths, pathArg);\n\n  const outbound = (db.prepare('SELECT DISTINCT dst FROM links WHERE src = ? AND dst IS NOT NULL').all(path) as Array<{ dst: string }>).map((r) => r.dst);\n  const backlinks = (db.prepare('SELECT DISTINCT src FROM links WHERE dst = ?').all(path) as Array<{ src: string }>).map((r) => r.src);\n  const exclude = new Set([path, ...outbound, ...backlinks]);\n\n  // Vectors are the only signal `related` has, so every way of not having them is an error\n  // naming the cause. An empty table then means one thing: nothing near in meaning that this\n  // note does not already link to, which is a real answer.\n  const effective = resolveSearch(cfg, overrides);\n  if (!embedEnabled(cfg)) {\n    throw new SenseError('EMBED_DISABLED', 'related ranks notes by meaning, and this tree has no embedding model; add an \"embed\" block naming one to sense.config.json, then run `sense download` (search works without it, on words and links)');\n  }\n  // search gates on the same flag (see wantsVectors above); reading it here too keeps\n  // `semantic: false` meaning one thing. Without this, an overlapping semantic-on preset's\n  // vectors would answer for a scope that declined them.\n  if (!effective.semantic) {\n    throw new SenseError('PRESET_NOT_SEMANTIC', `preset \"${effective.presetName}\" sets \"semantic\": false, so this scope has no vectors and related has no other signal; search it instead (words and links), or set semantic back on for that preset`);\n  }\n  if (!modelPresent(cfg)) {\n    throw new SenseError('EMBED_MODEL_MISSING', 'related ranks notes by meaning, so it needs the embedding model, which is not downloaded; run `sense download` (search still works without it, on words and links)');\n  }\n  const allowed = scopedPaths(db, cfg, overrides);\n  // Top up pending rows before the seed check, or a fresh index reports every note as\n  // having no indexed text until some search has run.\n  await embedPending(db, cfg, cfg.baseDir);\n  if (!hasEmbedding(db, path)) {\n    throw new SenseError('NOTE_NOT_EMBEDDED', `${path} has no indexed text to compare -- a note that is frontmatter only, or empty, has nothing to rank by meaning`);\n  }\n  if (!scopeHasEmbeddings(db, cfg, allowed)) return [];\n  return similarNotes(db, cfg, path, { exclude, allowed, k });\n}\n"],"names":["mapTree","peek","presetCoverage","relatedNotes","resolveNote","scopedPaths","search","WEIGHTED_BM25","RRF_K","SNIPPET_BOUND","EXCERPT_WINDOW","extractBareTerms","query","cleaned","replace","split","map","tok","toLowerCase","trim","filter","length","findOccurrences","haystackLower","terms","occ","term","idx","found","indexOf","push","start","end","sort","a","b","bestWindowStart","windowSize","best","bestDistinct","bestCount","i","winEnd","seen","Set","count","j","add","size","computeExcerpt","text","Math","min","excerpt","slice","offset","out","cursor","o","prefix","suffix","lineNumberAt","line","charCodeAt","lineRangeFor","db","path","row","prepare","get","start_line","end_line","inScope","include","exclude","some","g","matchesGlob","scopeHasEmbeddings","cfg","anyPresetEmbeds","rows","all","r","has","opts","hits","chunkLines","chunkSimilarity","effective","k","allPaths","adHocScope","scopeActive","fetch","wantsVectors","semanticEnabled","scope","whereJoin","whereCond","matchSql","matchRows","oversized","candidates","edges","linked","seeds","ranked","vec","insert","c","where","similarityCol","bareTerms","resolveSearch","undefined","noExclude","p","presetName","max","semantic","modelPresent","SenseError","contentTokenize","segmentMatch","err","searchError","Map","hit","forEach","set","score","via","featureEnabled","linkEdges","flat","personalizedRank","existing","semanticCandidates","v","lines","similarity","exec","run","readFileSync","join","baseDir","overrides","paths","whereRows","wherePaths","embedActive","presetNames","name","files","n","embedded","presetSemanticEnabled","INTERNAL_COLUMNS","MAP_COLUMN_CHUNK","chunk","items","setupMapScope","JSON","stringify","scopeWhere","scopeAnd","docs","columns","allFields","group","exprs","quoted","result","field","coverage","type","fields","hubs","recent","fieldsTotal","features","featureStates","presets","arg","exact","find","base","posix","basename","matches","PEEK_LIST_LIMIT","pathArg","parseError","_parse_error","frontmatter","Object","entries","key","value","sectionsTotal","sections","outbound","backlinks","unresolved","backlinksTotal","_allowed","l","dst","target","src","tokens","ceil","_size","outboundTotal","unresolvedTotal","off","allowed","embedEnabled","embedPending","hasEmbedding","similarNotes"],"mappings":";;;;;;;;;;;QAiWgBA;eAAAA;;QAoEAC;eAAAA;;QA7GAC;eAAAA;;QA2JMC;eAAAA;;QAnFNC;eAAAA;;QA9FAC;eAAAA;;QAhJMC;eAAAA;;;sBAlJO;wBACK;4DAChB;wBAG+H;wBACtH;uBACgE;uBACjE;uBACO;6BAEL;yBACC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAE7B,2EAA2E;AAC3E,gFAAgF;AAEhF,6FAA6F;AAC7F,iEAAiE;AACjE,IAAMC,gBAAgB;AACtB,IAAMC,QAAQ;AAEd,iFAAiF;AACjF,8EAA8E;AAC9E,IAAMC,gBAAgB;AACtB,IAAMC,iBAAiB;AAEvB,8FAA8F;AAC9F,qEAAqE;AACrE,SAASC,iBAAiBC,KAAa;IACrC,IAAMC,UAAUD,MACbE,OAAO,CAAC,MAAM,KACdA,OAAO,CAAC,UAAU,KAClBA,OAAO,CAAC,mCAAmC;IAC9C,OAAOD,QACJE,KAAK,CAAC,OACNC,GAAG,CAAC,SAACC;eAAQA,IAAIH,OAAO,CAAC,kBAAkB;OAAK,iCAAiC;KACjFE,GAAG,CAAC,SAACC;eAAQA,IAAIC,WAAW,GAAGC,IAAI;OACnCC,MAAM,CAAC,SAACH;eAAQA,IAAII,MAAM,GAAG;;AAClC;AAEA,SAASC,gBAAgBC,aAAqB,EAAEC,KAAe;IAC7D,IAAMC,MAA2D,EAAE;QAC9D,kCAAA,2BAAA;;QAAL,QAAK,YAAcD,0BAAd,SAAA,6BAAA,QAAA,yBAAA,iCAAqB;YAArB,IAAME,OAAN;YACH,IAAIC,MAAM;YACV,OAAS;gBACP,IAAMC,QAAQL,cAAcM,OAAO,CAACH,MAAMC;gBAC1C,IAAIC,UAAU,CAAC,GAAG;gBAClBH,IAAIK,IAAI,CAAC;oBAAEC,OAAOH;oBAAOI,KAAKJ,QAAQF,KAAKL,MAAM;oBAAEK,MAAAA;gBAAK;gBACxDC,MAAMC,QAAQF,KAAKL,MAAM;YAC3B;QACF;;QARK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IASL,mFAAmF;IACnF,+EAA+E;IAC/E,OAAOI,IAAIQ,IAAI,CAAC,SAACC,GAAGC;eAAMD,EAAEH,KAAK,GAAGI,EAAEJ,KAAK,IAAII,EAAEH,GAAG,GAAGE,EAAEF,GAAG;;AAC9D;AAEA,wFAAwF;AACxF,6DAA6D;AAC7D,SAASI,gBAAgBX,GAAwD,EAAEY,UAAkB;IACnG,IAAIC,OAAOb,GAAG,CAAC,EAAE,CAACM,KAAK;IACvB,IAAIQ,eAAe;IACnB,IAAIC,YAAY;IAChB,IAAK,IAAIC,IAAI,GAAGA,IAAIhB,IAAIJ,MAAM,EAAEoB,IAAK;QACnC,IAAMC,SAASjB,GAAG,CAACgB,EAAE,CAACV,KAAK,GAAGM;QAC9B,IAAMM,OAAO,IAAIC;QACjB,IAAIC,QAAQ;QACZ,IAAK,IAAIC,IAAIL,GAAGK,IAAIrB,IAAIJ,MAAM,IAAII,GAAG,CAACqB,EAAE,CAACf,KAAK,GAAGW,QAAQI,IAAK;YAC5DH,KAAKI,GAAG,CAACtB,GAAG,CAACqB,EAAE,CAACpB,IAAI;YACpBmB;QACF;QACA,IAAIF,KAAKK,IAAI,GAAGT,gBAAiBI,KAAKK,IAAI,KAAKT,gBAAgBM,QAAQL,WAAY;YACjFF,OAAOb,GAAG,CAACgB,EAAE,CAACV,KAAK;YACnBQ,eAAeI,KAAKK,IAAI;YACxBR,YAAYK;QACd;IACF;IACA,OAAOP;AACT;AAEA,uFAAuF;AACvF,uFAAuF;AACvF,SAASW,eAAeC,IAAY,EAAE1B,KAAe;IACnD,IAAMC,MAAMH,gBAAgB4B,KAAKhC,WAAW,IAAIM;IAChD,IAAIC,IAAIJ,MAAM,KAAK,GAAG;QACpB,iFAAiF;QACjF,qFAAqF;QACrF,sFAAsF;QACtF,IAAMW,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEX;QAClC,OAAO;YAAE2C,SAAS,AAAC,GAAmDrB,OAAjDkB,KAAKI,KAAK,CAAC,GAAGtB,KAAKlB,OAAO,CAAC,QAAQ,KAAKK,IAAI,IAAkC,OAA7Ba,MAAMkB,KAAK7B,MAAM,GAAG,MAAM;YAAMkC,QAAQ;QAAE;IAClH;IACA,IAAMxB,QAAQK,gBAAgBX,KAAKf;IACnC,IAAMsB,OAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEU,QAAQrB;IAC1C,IAAI8C,MAAM;IACV,IAAIC,SAAS1B;QACR,kCAAA,2BAAA;;QAAL,QAAK,YAAWN,wBAAX,SAAA,6BAAA,QAAA,yBAAA,iCAAgB;YAAhB,IAAMiC,IAAN;YACH,IAAIA,EAAE3B,KAAK,GAAGA,SAAS2B,EAAE1B,GAAG,GAAGA,MAAK;YACpC,sFAAsF;YACtF,gFAAgF;YAChF,IAAI0B,EAAE3B,KAAK,GAAG0B,QAAQ;YACtBD,OAAO,AAAC,GAAiCN,OAA/BA,KAAKI,KAAK,CAACG,QAAQC,EAAE3B,KAAK,GAAE,QAA8B,OAA3BmB,KAAKI,KAAK,CAACI,EAAE3B,KAAK,EAAE2B,EAAE1B,GAAG,GAAE;YACpEyB,SAASC,EAAE1B,GAAG;QAChB;;QAPK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAQLwB,OAAON,KAAKI,KAAK,CAACG,QAAQzB;IAC1B,IAAM2B,SAAS5B,QAAQ,IAAI,MAAM;IACjC,IAAM6B,SAAS5B,OAAMkB,KAAK7B,MAAM,GAAG,MAAM;IACzC,OAAO;QAAEgC,SAAS,AAAC,GAAWG,OAATG,QAAoCC,OAA3BJ,IAAI1C,OAAO,CAAC,QAAQ,MAAc,OAAP8C;QAAUL,QAAQxB;IAAM;AACnF;AAEA,SAAS8B,aAAaX,IAAY,EAAEK,MAAc;IAChD,IAAIO,OAAO;IACX,IAAK,IAAIrB,IAAI,GAAGA,IAAIc,QAAQd,IAAK,IAAIS,KAAKa,UAAU,CAACtB,OAAO,IAAIqB;IAChE,OAAOA;AACT;AAEA,SAASE,aAAaC,EAAgB,EAAEC,IAAY,EAAEJ,IAAY;IAChE,IAAMK,MAAMF,GAAGG,OAAO,CAAC,qIAAqIC,GAAG,CAACH,MAAMJ,MAAMA;IAC5K,OAAOK,MAAM,AAAC,IAAqBA,OAAlBA,IAAIG,UAAU,EAAC,KAAgB,OAAbH,IAAII,QAAQ,IAAK;AACtD;AAWA,yFAAyF;AACzF,4FAA4F;AAC5F,+EAA+E;AAC/E,SAASC,QAAQN,IAAY,EAAEO,OAAiB,EAAEC,OAAkB;IAClE,IAAI,CAACD,QAAQE,IAAI,CAAC,SAACC;eAAMC,IAAAA,qBAAW,EAACX,MAAMU;QAAK,OAAO;IACvD,IAAIF,oBAAAA,8BAAAA,QAASC,IAAI,CAAC,SAACC;eAAMC,IAAAA,qBAAW,EAACX,MAAMU;QAAK,OAAO;IACvD,OAAO;AACT;AAEA,SAASE,mBAAmBb,EAAgB,EAAEc,GAAmB,EAAE1E,WAAwB;IACzF,IAAI,CAAC2E,IAAAA,yBAAe,EAACD,MAAM,OAAO,OAAO,yDAAyD;IAClG,IAAME,OAAOhB,GAAGG,OAAO,CAAC,0CAA0Cc,GAAG;IACrE,OAAOD,KAAKN,IAAI,CAAC,SAACQ;eAAM9E,YAAY+E,GAAG,CAACD,EAAEjB,IAAI;;AAChD;AAIO,SAAe5D;wCAAO2D,EAAgB,EAAEc,GAAmB,EAAEvD,KAAa;YAAE6D,MA0GZC,WAAwBC,iBAA8BC,sBAzGrHC,WACEC,GAAGjB,SAASC,SAEdiB,UAGAC,YACAvF,aAIAwF,aACAC,OAIAC,cAIAC,iBAYAC,OACAC,WACAC,WAMAC,UACAxF,OACFyF,WAWEf,MAGAgB,WACAC,YAKAC,OAIEC,QACAC,OACAC,QAiBFpB,YACAC,iBAEEoB,KAgBFC,QACD,2BAAA,mBAAA,gBAAA,WAAA,oBAAO3C,MAAM4C,GAIZC,OAGAC,eACA/B,MASEgC,WACD,4BAAA,oBAAA,iBAAA,YAAA,QAAM9C,KAELjB,MAMwBD,iBAApBI,SAASE;;;;;oBApI4D8B,OAAAA,oEAAsB,CAAC;oBAClGI,YAAYyB,IAAAA,uBAAa,EAACnC,KAAKM;oBAC7BK,IAAwBD,UAAxBC,GAAGjB,UAAqBgB,UAArBhB,SAASC,UAAYe,UAAZf;oBAEdiB,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBAClH,6FAA6F;oBAC7F,wFAAwF;oBAClF0B,aAAaP,KAAKZ,OAAO,KAAK0C,aAAa9B,KAAKX,OAAO,KAAKyC,aAAa9B,KAAK+B,SAAS,KAAK;oBAC5F/G,cAAcuF,aAAa,IAAIhD,IAAI+C,SAASvE,MAAM,CAAC,SAACiG;+BAAM7C,QAAQ6C,GAAG5C,SAASC;0BAAa,IAAI9B,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDc,GAAG,CAACO,UAAU6B,UAAU,EAA8BtG,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBAChP,2FAA2F;oBAC3F,2FAA2F;oBAC3F,sDAAsD;oBAChD2B,cAAcxF,YAAY2C,IAAI,GAAG2C,SAAStE,MAAM;oBAChDyE,QAAQD,cAAc1C,KAAKoE,GAAG,CAAC7B,IAAI,GAAG,MAAMvC,KAAKoE,GAAG,CAAC7B,IAAI,GAAG;oBAElE,6FAA6F;oBAC7F,6FAA6F;oBACvFK,eAAeN,UAAU+B,QAAQ,IAAIxC,IAAAA,yBAAe,EAACD;oBAC3D,IAAIgB,gBAAgB,CAAC0B,IAAAA,qBAAY,EAAC1C,MAAM;wBACtC,MAAM,IAAI2C,oBAAU,CAAC,uBAAuB,AAAC,WAA+B,OAArBjC,UAAU6B,UAAU,EAAC;oBAC9E;oBACMtB,kBAAkBD,gBAAgBjB,mBAAmBb,IAAIc,KAAK1E;oBAEpE,4FAA4F;oBAC5F,0FAA0F;oBAC1F,yFAAyF;oBACzF,wFAAwF;oBACxF,sFAAsF;oBACtF,6FAA6F;oBAC7F,mDAAmD;oBACnD,UAAU;oBACV,6FAA6F;oBAC7F,wDAAwD;oBAClD4F,QAAQR,UAAUsB,KAAK;oBACvBb,YAAYD,QAAQ,kDAAkD;oBACtEE,YAAYF,QAAQ,AAAC,QAAa,OAANA,OAAM,OAAK;oBAC7C,4DAA4D;oBAC5D,yEAAyE;oBACzE,yFAAyF;oBACzF,sFAAsF;oBACtF,6EAA6E;oBACvEG,WAAW,AAAC,kEAAgKF,OAA/FzF,eAAc,yFAAoH0F,OAAnCD,WAAU,2BAA+C3F,OAAtB4F,WAAU,cAAmCL,OAAvBvF,eAAc,WAAe,OAANuF;oBAC5PlF,QAAQ+G,IAAAA,yBAAe,EAAC5C,SAASoC,YAAYS,IAAAA,uBAAY,EAACpG,SAASA;oBAEzE,IAAI;wBACF6E,YAAYpC,GAAGG,OAAO,CAACgC,UAAUlB,GAAG,CAACtE;oBACvC,EAAE,OAAOiH,KAAK;wBACZ,MAAMC,IAAAA,0BAAW,EAACD,KAAcrG,OAAOyE;oBACzC;oBACA,yFAAyF;oBACzF,2FAA2F;oBAC3F,mFAAmF;oBACnFI,YAAYA,UAAUjF,MAAM,CAAC,SAAC+D;+BAAM9E,YAAY+E,GAAG,CAACD,EAAEjB,IAAI;;oBAEpDoB,OAAO,IAAIyC,IAAI1B,UAAUrF,GAAG,CAAC,SAACmE;+BAAM;4BAACA,EAAEjB,IAAI;4BAAEiB,EAAE6C,GAAG;yBAAC;;oBACzD,wFAAwF;oBACxF,4EAA4E;oBACtE1B,YAAY,IAAI1D,IAAIyD,UAAUjF,MAAM,CAAC,SAAC+D;+BAAMA,EAAE6C,GAAG,KAAK;uBAAMhH,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBAC7EqC,aAAa,IAAIwB;oBACvB1B,UAAU4B,OAAO,CAAC,SAAC9C,GAAG1C;wBACpB8D,WAAW2B,GAAG,CAAC/C,EAAEjB,IAAI,EAAE;4BAAEiE,OAAO,IAAK3H,CAAAA,QAAQiC,CAAAA;4BAAI2F,KAAK;wBAAQ;oBAChE;oBAEM5B,QAAQ6B,IAAAA,wBAAc,EAACtD,KAAK,YAAYsB,UAAUhF,MAAM,GAAG,IAAIiH,IAAAA,kBAAS,EAACrE;oBAC/E,IAAIuC,MAAMnF,MAAM,GAAG,GAAG;wBACpB,yFAAyF;wBACzF,uFAAuF;wBACjFoF,SAAS,IAAI7D,IAAI4D,MAAM+B,IAAI;wBAC3B7B,QAAQ,IAAIqB,IAAI1B,UAAUrF,GAAG,CAAC,SAACmE,GAAG1C;mCAAM;gCAAC0C,EAAEjB,IAAI;gCAAE,IAAKzB,CAAAA,IAAI,CAAA;6BAAG;;wBAC7DkE,SAAS,AAAC,qBAAG6B,IAAAA,yBAAgB,EAAC7C,UAAUa,OAAOE,QAClDtF,MAAM,CAAC;qEAAE8C,kBAAMiE;mCAAWA,QAAQ,QAAQ9H,YAAY+E,GAAG,CAAClB;2BAC1DjC,IAAI,CAAC,SAACC,GAAGC;mCAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE;2BAC1BoB,KAAK,CAAC,GAAGwC;wBACZa,OAAOsB,OAAO,CAAC,gBAASxF;qEAAPyB;4BACf,IAAMuE,WAAWlC,WAAWlC,GAAG,CAACH;4BAChC,IAAIuE,UAAU;gCACZA,SAASN,KAAK,IAAI,IAAK3H,CAAAA,QAAQiC,CAAAA;gCAC/B,IAAIgE,OAAOrB,GAAG,CAAClB,OAAOuE,SAASL,GAAG,GAAG;4BACvC,OAAO;gCACL7B,WAAW2B,GAAG,CAAChE,MAAM;oCAAEiE,OAAO,IAAK3H,CAAAA,QAAQiC,CAAAA;oCAAI2F,KAAK;gCAAO;4BAC7D;wBACF;oBACF;oBAEA,sFAAsF;oBACtF,0EAA0E;oBACpE7C,aAAa,IAAIwC;oBACjBvC,kBAAkB,IAAIuC;yBACxB/B,iBAAAA;;;;oBACW;;wBAAM0C,IAAAA,2BAAkB,EAACzE,IAAIc,KAAKvD,OAAOsE;;;oBAAhDc,MAAM,AAAC,cAAiDxF,MAAM,CAAC,SAACuH;+BAAMtI,YAAY+E,GAAG,CAACuD,EAAEzE,IAAI;;oBAClG0C,IAAIqB,OAAO,CAAC,gBAA8BxF;4BAA3ByB,aAAAA,MAAM0E,cAAAA,OAAOC,mBAAAA;wBAC1BtD,WAAW2C,GAAG,CAAChE,MAAM0E;wBACrBpD,gBAAgB0C,GAAG,CAAChE,MAAM2E;wBAC1B,IAAMJ,WAAWlC,WAAWlC,GAAG,CAACH;wBAChC,IAAIuE,UAAU;4BACZA,SAASN,KAAK,IAAI,IAAK3H,CAAAA,QAAQiC,CAAAA;4BAC/BgG,SAASL,GAAG,GAAG,AAAC,GAAe,OAAbK,SAASL,GAAG,EAAC;wBACjC,OAAO;4BACL7B,WAAW2B,GAAG,CAAChE,MAAM;gCAAEiE,OAAO,IAAK3H,CAAAA,QAAQiC,CAAAA;gCAAI2F,KAAK;4BAAS;wBAC/D;oBACF;;;oBAGFnE,GAAG6E,IAAI,CAAC;oBACR7E,GAAG6E,IAAI,CAAC;oBACFjC,SAAS5C,GAAGG,OAAO,CAAC;oBACrB,kCAAA,2BAAA;;wBAAL,IAAK,YAAmBmC,iCAAnB,6BAAA,QAAA,yBAAA;2DAAA,iBAAOrC,uBAAM4C;4BAAkBD,OAAOkC,GAAG,CAAC7E,MAAM4C,EAAEqB,KAAK,EAAErB,EAAEsB,GAAG,GAAE9C,YAAAA,KAAKjB,GAAG,CAACH,mBAAToB,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWlB,GAAG,CAACH,mBAAfqB,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBnB,GAAG,CAACH,mBAApBsB,kCAAAA,uBAA6B;;;wBAAnJ;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAEL,yFAAyF;oBACzF,8CAA8C;oBACxCuB,QAAQd,QAAQ,AAAC,UAAe,OAANA,OAAM,OAAK;oBAC3C,sFAAsF;oBACtF,2FAA2F;oBACrFe,gBAAgBhB,kBAAkB,yBAAyB;oBAC3Df,OAAOhB,GACVG,OAAO,CACN,AAAC,qIAEE2C,OAFkIC,eAAc,gIAE1I,OAAND,OAAM,yCAEV7B,GAAG,CAACQ;oBAEP,IAAIY,UAAUtD,IAAI,GAAG,GAAG;wBAChBiE,YAAYtG,iBAAiBa;wBAC9B,mCAAA,4BAAA;;4BAAL,IAAK,aAAayD,2BAAb,8BAAA,SAAA,0BAAA,kCAAmB;gCAAbd,MAAN;gCACH,IAAIA,IAAI6D,GAAG,KAAK,QAAQ,CAAC1B,UAAUlB,GAAG,CAACjB,IAAID,IAAI,GAAa;gCACxDhB,OAAAA,KAAAA;gCACJ,IAAI;oCACFA,OAAO8F,IAAAA,oBAAY,EAACC,IAAAA,cAAI,EAAClE,IAAImE,OAAO,EAAE/E,IAAID,IAAI,GAAa;gCAC7D,EAAE,eAAM;oCACN,UAAU,mEAAmE;gCAC/E;gCAC4BjB,kBAAAA,eAAeC,MAAM+D,YAAzC5D,UAAoBJ,gBAApBI,SAASE,SAAWN,gBAAXM;gCACjBY,IAAI6D,GAAG,GAAG3E;gCACV,IAAIc,IAAIyE,KAAK,IAAI,MAAMzE,IAAIyE,KAAK,GAAGP,IAAAA,wBAAc,EAACtD,KAAK,cAAcf,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;4BAC1I;;4BAXK;4BAAA;;;qCAAA,8BAAA;oCAAA;;;oCAAA;0CAAA;;;;oBAYP;oBAEA;;wBAAO0B;;;;IACT;;AAKO,SAAS5E,YAAY4D,EAAgB,EAAEc,GAAmB,EAAEoE,SAA0B;IAC3F,IAAM1D,YAAYyB,IAAAA,uBAAa,EAACnC,KAAKoE;IACrC,IAAQ1E,UAA4BgB,UAA5BhB,SAASC,UAAmBe,UAAnBf,SAASqC,QAAUtB,UAAVsB;IAC1B,IAAMpB,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IAClH,IAAM0B,aAAauD,UAAU1E,OAAO,KAAK0C,aAAagC,UAAUzE,OAAO,KAAKyC,aAAagC,UAAU/B,SAAS,KAAK;IACjH,IAAMgC,QAAQxD,aAAa,IAAIhD,IAAI+C,SAASvE,MAAM,CAAC,SAACiG;eAAM7C,QAAQ6C,GAAG5C,SAASC;UAAa,IAAI9B,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDc,GAAG,CAACO,UAAU6B,UAAU,EAA8BtG,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IAC1O,IAAI,CAAC6C,OAAO,OAAOqC;IACnB,IAAMC,YAAYpF,GAAGG,OAAO,CAAC,AAAC,2CAAgD,OAAN2C,OAAM,MAAI7B,GAAG;IACrF,IAAMoE,aAAa,IAAI1G,IAAIyG,UAAUrI,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IACtD,OAAO,IAAItB,IAAI,AAAC,qBAAGwG,OAAOhI,MAAM,CAAC,SAACiG;eAAMiC,WAAWlE,GAAG,CAACiC;;AACzD;AAYO,SAASnH,eAAe+D,EAAgB,EAAEc,GAAmB;IAClE,IAAMwE,cAAcvE,IAAAA,yBAAe,EAACD;IACpC,OAAOyE,IAAAA,qBAAW,EAACzE,KAAK/D,GAAG,CAAC,SAACyI;QAC3B,IAAMC,QAAQ,AAACzF,GAAGG,OAAO,CAAC,2DAA2DC,GAAG,CAACoF,MAAwBE,CAAC;QAClH,IAAMC,WAAWL,cAAc,AAACtF,GAAGG,OAAO,CAAC,6JAA6JC,GAAG,CAACoF,MAAwBE,CAAC,GAAG;QACxO,OAAO;YAAEF,MAAAA;YAAMC,OAAAA;YAAOE,UAAAA;YAAUpC,UAAUqC,IAAAA,+BAAqB,EAAC9E,KAAK0E;QAAM;IAC7E;AACF;AAYA,IAAMK,mBAAmB,IAAIlH,IAAI;IAAC;IAAQ;IAAU;IAAS;IAAS;CAAe;AAErF,yFAAyF;AACzF,8FAA8F;AAC9F,IAAMmH,mBAAmB;AAEzB,SAASC,MAASC,KAAU,EAAEjH,IAAY;IACxC,IAAMQ,MAAa,EAAE;IACrB,IAAK,IAAIf,IAAI,GAAGA,IAAIwH,MAAM5I,MAAM,EAAEoB,KAAKO,KAAMQ,IAAI1B,IAAI,CAACmI,MAAM3G,KAAK,CAACb,GAAGA,IAAIO;IACzE,OAAOQ;AACT;AAEA,iFAAiF;AACjF,4EAA4E;AAC5E,SAAS0G,cAAcjG,EAAgB,EAAEmF,KAAkB;IACzDnF,GAAG6E,IAAI,CAAC;IACR7E,GAAG6E,IAAI,CAAC;IACR7E,GAAGG,OAAO,CAAC,mEAAmE2E,GAAG,CAACoB,KAAKC,SAAS,CAAE,qBAAGhB;AACvG;AAIO,SAASpJ,QAAQiE,EAAgB,EAAEc,GAAmB;QAAEoE,YAAAA,iEAA6B,CAAC;IAC3Fe,cAAcjG,IAAI5D,YAAY4D,IAAIc,KAAKoE;IACvC,IAAMkB,aAAa;IACnB,IAAMC,WAAW;IAEjB,IAAMC,OAAOtG,GAAGG,OAAO,CAAC,AAAC,iFAA2F,OAAXiG,aAAchG,GAAG;IAE1H,IAAMmG,UAAU,AAACvG,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAEsE,IAAI;OAAErI,MAAM,CAAC,SAACqI;eAAS,CAACK,iBAAiB1E,GAAG,CAACqE;;IAC1J,6FAA6F;IAC7F,+FAA+F;IAC/F,IAAMgB,YAAmB,EAAE;QACtB,kCAAA,2BAAA;;;YAAA,IAAMC,QAAN;YACH,IAAMC,QAAQD,MAAM1J,GAAG,CAAC,SAACyI,MAAMhH;gBAC7B,IAAMmI,SAAS,AAAC,IAA8B,OAA3BnB,KAAK1I,KAAK,CAAC,KAAKkI,IAAI,CAAC,OAAM;gBAC9C,OAAO,AAAC,SAAuBxG,OAAfmI,QAAO,UAA2CA,OAAnCnI,GAAE,mCAA2DmI,OAA1BA,QAAO,qBAA8CnI,OAA3BmI,QAAO,sBAAsB,OAAFnI;YACzH;YACA,IAAMoI,SAAS5G,GAAGG,OAAO,CAAC,AAAC,UAA8CiG,OAArCM,MAAM1B,IAAI,CAAC,OAAM,sBAA+B,OAAXoB,aAAchG,GAAG;YAC1FqG,MAAMzC,OAAO,CAAC,SAACwB,MAAMhH;oBAAgFoI;uBAA1EJ,UAAU3I,IAAI,CAAC;oBAAEgJ,OAAOrB;oBAAMsB,UAAUF,MAAM,CAAC,AAAC,IAAK,OAAFpI,GAAI;oBAAYuI,IAAI,GAAGH,WAAAA,MAAM,CAAC,AAAC,IAAK,OAAFpI,GAAI,cAAfoI,sBAAAA,WAA8B;gBAAG;;QACxI;QAPA,QAAK,YAAeb,MAAMQ,SAAST,sCAA9B,SAAA,6BAAA,QAAA,yBAAA;;QAAA;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAQLU,UAAUxI,IAAI,CAAC,SAACC,GAAGC;eAAM,AAACA,EAAE4I,QAAQ,GAAe7I,EAAE6I,QAAQ;;IAC7D,IAAME,SAASR,UAAUnH,KAAK,CAAC,GAAG;IAElC,IAAM4H,OAAO7C,IAAAA,wBAAc,EAACtD,KAAK,UAAWd,GAAGG,OAAO,CAAC,AAAC,oKAA4K,OAATkG,UAAS,qCAAmCpF,GAAG,KAAe,EAAE;IAE3R,IAAMiG,SAASlH,GAAGG,OAAO,CAAC,AAAC,wFAAgG,OAAXiG,YAAW,oCAAkCnF,GAAG;IAEhK,OAAO;QAAEqF,MAAAA;QAAMU,QAAAA;QAAQG,aAAaX,UAAUpJ,MAAM;QAAEgK,UAAUC,IAAAA,uBAAa,EAACvG;QAAMwG,SAASrL,eAAe+D,IAAIc;QAAMmG,MAAAA;QAAMC,QAAAA;IAAO;AACrI;AAIO,SAAS/K,YAAYgJ,KAAe,EAAEoC,GAAW;IACtD,IAAMC,QAAQrC,MAAMsC,IAAI,CAAC,SAACrE;eAAMA,MAAMmE;;IACtC,IAAIC,OAAO,OAAOA;IAClB,IAAME,OAAOC,cAAK,CAACC,QAAQ,CAACL,KAAK1K,OAAO,CAAC,UAAU,IAAII,WAAW;IAClE,IAAM4K,UAAU1C,MAAMhI,MAAM,CAAC,SAACiG;eAAMuE,cAAK,CAACC,QAAQ,CAACxE,GAAGvG,OAAO,CAAC,UAAU,IAAII,WAAW,OAAOyK;;IAC9F,IAAIG,QAAQzK,MAAM,KAAK,GAAG,OAAOyK,OAAO,CAAC,EAAE;IAC3C,IAAIA,QAAQzK,MAAM,GAAG,GAAG,MAAM,IAAIqG,oBAAU,CAAC,kBAAkB,AAAC,IAAyBoE,OAAtBN,KAAI,oBAAqC,OAAnBM,QAAQ7C,IAAI,CAAC;IACtG,MAAM,IAAIvB,oBAAU,CAAC,kBAAkB,AAAC,oBAAuB,OAAJ8D,KAAI;AACjE;AAyBA,IAAMO,kBAAkB;AAIjB,SAAS9L,KAAKgE,EAAgB,EAAEc,GAAmB,EAAEiH,OAAe;QAAE7C,YAAAA,iEAA6B,CAAC;QAKrFhF,mBAwBEA;IA5BtB,IAAMiF,QAAQ,AAACnF,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IAC/G,IAAMA,OAAO9D,YAAYgJ,OAAO4C;IAEhC,IAAM7H,MAAMF,GAAGG,OAAO,CAAC,8CAA8CC,GAAG,CAACH;IACzE,IAAM+H,cAAc9H,oBAAAA,IAAI+H,YAAY,cAAhB/H,+BAAAA,oBAAsC;IAC1D,IAAMgI,cAAmB,CAAC;QACrB,kCAAA,2BAAA;;QAAL,QAAK,YAAsBC,OAAOC,OAAO,CAAClI,yBAArC,SAAA,6BAAA,QAAA,yBAAA,iCAA2C;YAA3C,mCAAA,iBAAOmI,sBAAKC;YACf,IAAI,CAACzC,iBAAiB1E,GAAG,CAACkH,QAAQC,UAAU,MAAMJ,WAAW,CAACG,IAAI,GAAGC;QACvE;;QAFK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAIL,IAAMC,gBAAgBnE,IAAAA,wBAAc,EAACtD,KAAK,cAAc,AAACd,GAAGG,OAAO,CAAC,uDAAuDC,GAAG,CAACH,MAAwByF,CAAC,GAAG;IAC3J,IAAM8C,WAAWpE,IAAAA,wBAAc,EAACtD,KAAK,cAAed,GAAGG,OAAO,CAAC,2GAA2Gc,GAAG,CAAChB,MAAM6H,mBAA6B,EAAE;IAEnN,IAAIW,WAAqB,EAAE;IAC3B,IAAIC,YAAsB,EAAE;IAC5B,IAAIC,aAAuB,EAAE;IAC7B,IAAIC,iBAAiB;IACrB,IAAMC,WAAWzM,YAAY4D,IAAIc,KAAKoE;IACtC,IAAId,IAAAA,wBAAc,EAACtD,KAAK,UAAU;QAChC,IAAMvB,MAAMS,GAAGG,OAAO,CAAC,+DAA+Dc,GAAG,CAAChB;QAC1FwI,WAAY,qBAAG,IAAI9J,IAAIY,IAAIpC,MAAM,CAAC,SAAC2L;mBAAMA,EAAEC,GAAG,KAAK;WAAMhM,GAAG,CAAC,SAAC+L;mBAAMA,EAAEC,GAAG;;QACzEJ,aAAapJ,IAAIpC,MAAM,CAAC,SAAC2L;mBAAMA,EAAEC,GAAG,KAAK;WAAMhM,GAAG,CAAC,SAAC+L;mBAAMA,EAAEE,MAAM;;QAClEJ,iBAAiB,AAAC5I,GAAGG,OAAO,CAAC,4DAA4DC,GAAG,CAACH,MAAwByF,CAAC;QACtHgD,YAAY,AAAC1I,GAAGG,OAAO,CAAC,qEAAqEc,GAAG,CAAChB,MAAM6H,iBAA4C/K,GAAG,CAAC,SAACmE;mBAAMA,EAAE+H,GAAG;;IACrK;IAEA,OAAO;QACLhJ,MAAAA;QACAiJ,QAAQhK,KAAKiK,IAAI,CAAC,EAAEjJ,aAAAA,IAAIkJ,KAAK,cAATlJ,wBAAAA,aAAwB,KAAK;QACjDgI,aAAAA;QACAF,YAAAA;QACAQ,UAAAA;QACAC,UAAUA,SAASpJ,KAAK,CAAC,GAAGyI;QAC5BY,WAAAA;QACAC,YAAYA,WAAWtJ,KAAK,CAAC,GAAGyI;QAChCS,eAAAA;QACAc,eAAeZ,SAASrL,MAAM;QAC9BwL,gBAAAA;QACAU,iBAAiBX,WAAWvL,MAAM;QAClCmM,KAAK,AAAC;YAAC;YAAY;SAAQ,CAAmBpM,MAAM,CAAC,SAACqI;mBAAS,CAACpB,IAAAA,wBAAc,EAACtD,KAAK0E;;IACtF;AACF;AAIO,SAAetJ,aAAa8D,EAAgB,EAAEc,GAAmB,EAAEiH,OAAe,EAAE7C,SAA0B,EAAEzD,CAAS;;YACxH0D,OACAlF,MAEAwI,UACAC,WACAjI,SAKAe,WAaAgI;;;;oBAvBArE,QAAQ,AAACnF,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBACzGA,OAAO9D,YAAYgJ,OAAO4C;oBAE1BU,WAAW,AAACzI,GAAGG,OAAO,CAAC,oEAAoEc,GAAG,CAAChB,MAAiClD,GAAG,CAAC,SAACmE;+BAAMA,EAAE6H,GAAG;;oBAChJL,YAAY,AAAC1I,GAAGG,OAAO,CAAC,gDAAgDc,GAAG,CAAChB,MAAiClD,GAAG,CAAC,SAACmE;+BAAMA,EAAE+H,GAAG;;oBAC7HxI,UAAU,IAAI9B,IAAI;wBAACsB;sBAAD,OAAO,qBAAGwI,WAAU,qBAAGC;oBAE/C,yFAAyF;oBACzF,2FAA2F;oBAC3F,yDAAyD;oBACnDlH,YAAYyB,IAAAA,uBAAa,EAACnC,KAAKoE;oBACrC,IAAI,CAACuE,IAAAA,sBAAY,EAAC3I,MAAM;wBACtB,MAAM,IAAI2C,oBAAU,CAAC,kBAAkB;oBACzC;oBACA,oFAAoF;oBACpF,yFAAyF;oBACzF,uDAAuD;oBACvD,IAAI,CAACjC,UAAU+B,QAAQ,EAAE;wBACvB,MAAM,IAAIE,oBAAU,CAAC,uBAAuB,AAAC,WAA+B,OAArBjC,UAAU6B,UAAU,EAAC;oBAC9E;oBACA,IAAI,CAACG,IAAAA,qBAAY,EAAC1C,MAAM;wBACtB,MAAM,IAAI2C,oBAAU,CAAC,uBAAuB;oBAC9C;oBACM+F,UAAUpN,YAAY4D,IAAIc,KAAKoE;oBACrC,oFAAoF;oBACpF,oDAAoD;oBACpD;;wBAAMwE,IAAAA,qBAAY,EAAC1J,IAAIc,KAAKA,IAAImE,OAAO;;;oBAAvC;oBACA,IAAI,CAAC0E,IAAAA,qBAAY,EAAC3J,IAAIC,OAAO;wBAC3B,MAAM,IAAIwD,oBAAU,CAAC,qBAAqB,AAAC,GAAO,OAALxD,MAAK;oBACpD;oBACA,IAAI,CAACY,mBAAmBb,IAAIc,KAAK0I,UAAU;;;;oBAC3C;;wBAAOI,IAAAA,qBAAY,EAAC5J,IAAIc,KAAKb,MAAM;4BAAEQ,SAAAA;4BAAS+I,SAAAA;4BAAS/H,GAAAA;wBAAE;;;;IAC3D"}

package/dist/cjs/config.d.cts

@@ -38,6 +38,9 @@ export interface Config {
         rank?: boolean;
     };
     embed?: EmbedConfig;
+    content?: {
+        tokenize?: string;
+    };
     queries: Record<string, SavedQuery>;
 }
 export interface ResolvedConfig extends Config {
@@ -62,6 +65,7 @@ export declare function embedConfig(cfg: Config): {
     url?: string;
     key?: string;
 } | null;
+export declare function contentTokenize(cfg: Config): string | undefined;
 export declare function featureSignature(cfg: Config): string;
 export declare function resolvePreset(cfg: Config, name?: string): {
     name: string;

package/dist/cjs/config.d.ts

@@ -38,6 +38,9 @@ export interface Config {
         rank?: boolean;
     };
     embed?: EmbedConfig;
+    content?: {
+        tokenize?: string;
+    };
     queries: Record<string, SavedQuery>;
 }
 export interface ResolvedConfig extends Config {
@@ -62,6 +65,7 @@ export declare function embedConfig(cfg: Config): {
     url?: string;
     key?: string;
 } | null;
+export declare function contentTokenize(cfg: Config): string | undefined;
 export declare function featureSignature(cfg: Config): string;
 export declare function resolvePreset(cfg: Config, name?: string): {
     name: string;

package/dist/cjs/config.js

@@ -24,6 +24,9 @@ _export(exports, {
     get anyPresetEmbeds () {
         return anyPresetEmbeds;
     },
+    get contentTokenize () {
+        return contentTokenize;
+    },
     get embedConfig () {
         return embedConfig;
     },
@@ -294,6 +297,11 @@ function embedConfig(cfg) {
         key: e.key
     };
 }
+function contentTokenize(cfg) {
+    var _cfg_content;
+    var tokenize = (_cfg_content = cfg.content) === null || _cfg_content === void 0 ? void 0 : _cfg_content.tokenize;
+    return tokenize === undefined || tokenize.trim() === '' ? undefined : tokenize.trim();
+}
 function featureSignature(cfg) {
     var globalPart = enabledFeatures(cfg).filter(function(name) {
         return name !== 'embed';
@@ -308,11 +316,14 @@ function featureSignature(cfg) {
         var exclude = _to_consumable_array((_p_exclude = p.exclude) !== null && _p_exclude !== void 0 ? _p_exclude : []).sort().join('+');
         return "preset:".concat(name, ":").concat(include, ":").concat(exclude, ":").concat(p.semantic === false ? 'off' : 'on');
     }).join('|');
-    return [
+    var tokenize = contentTokenize(cfg);
+    var parts = [
         "features:".concat(globalPart),
-        embedPart,
-        presetsPart
-    ].join('|');
+        embedPart
+    ];
+    if (tokenize !== undefined) parts.push("tokenize:".concat(tokenize));
+    parts.push(presetsPart);
+    return parts.join('|');
 }
 function resolvePreset(cfg, name) {
     var presetName = name !== null && name !== void 0 ? name : 'default';
@@ -575,6 +586,7 @@ var KNOWN_KEYS = new Set([
     'presets',
     'features',
     'embed',
+    'content',
     'queries'
 ]);
 var KNOWN_PRESET_KEYS = new Set([
@@ -595,6 +607,9 @@ var KNOWN_EMBED_KEYS = new Set([
     'url',
     'key'
 ]);
+var KNOWN_CONTENT_KEYS = new Set([
+    'tokenize'
+]);
 var SAVED_SEARCH_KEYS = new Set([
     'search',
     'preset',
@@ -622,6 +637,23 @@ function validateLegacyScan(parsed, configPath) {
         throw new _errorsts.SenseError('CONFIG_INVALID', "".concat(configPath, ": scan.include must be a non-empty array of glob strings"));
     }
 }
+// Only the shape is checked here. Whether the linked SQLite accepts the tokenizer is settled
+// by probing it in db.ts, so this never has to carry a table of which version added what.
+function validateContentBlock(value, configPath) {
+    if ((typeof value === "undefined" ? "undefined" : _type_of(value)) !== 'object' || value === null || Array.isArray(value)) {
+        throw new _errorsts.SenseError('CONFIG_INVALID', "".concat(configPath, ": content must be an object of { tokenize?: string }"));
+    }
+    var block = value;
+    var unknown = Object.keys(block).filter(function(k) {
+        return !KNOWN_CONTENT_KEYS.has(k);
+    });
+    if (unknown.length > 0) {
+        throw new _errorsts.SenseError('CONFIG_INVALID', "".concat(configPath, ": content has unknown key(s) ").concat(unknown.join(', '), "; content takes tokenize"));
+    }
+    if (block.tokenize !== undefined && (typeof block.tokenize !== 'string' || block.tokenize.trim() === '')) {
+        throw new _errorsts.SenseError('CONFIG_INVALID', "".concat(configPath, ': content.tokenize must be a non-empty string, e.g. "trigram" or "unicode61 tokenchars \'-_\'"'));
+    }
+}
 function validateFeaturesBlock(value, configPath) {
     if ((typeof value === "undefined" ? "undefined" : _type_of(value)) !== 'object' || value === null || Array.isArray(value)) {
         throw new _errorsts.SenseError('CONFIG_INVALID', "".concat(configPath, ": features must be an object of name -> boolean"));
@@ -832,6 +864,9 @@ function validateConfig(parsed, configPath) {
     if (cfg.embed !== undefined) {
         validateEmbedBlock(cfg.embed, configPath);
     }
+    if (cfg.content !== undefined) {
+        validateContentBlock(cfg.content, configPath);
+    }
     return cfg;
 }
 function loadConfig(explicitPath) {