sensemaking 0.12.0 → 0.12.1

package/dist/esm/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, 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":["readFileSync","join","matchesGlob","posix","anyPresetEmbeds","contentTokenize","embedEnabled","featureEnabled","featureStates","presetNames","presetSemanticEnabled","resolveSearch","SenseError","embedPending","hasEmbedding","modelPresent","semanticCandidates","similarNotes","linkEdges","personalizedRank","searchError","segmentMatch","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","scopeHasEmbeddings","cfg","scopedPaths","rows","all","r","has","search","opts","hits","chunkLines","chunkSimilarity","effective","k","allPaths","adHocScope","undefined","noExclude","p","presetName","scopeActive","fetch","max","wantsVectors","semantic","semanticEnabled","scope","where","whereJoin","whereCond","matchSql","matchRows","err","Map","hit","oversized","candidates","forEach","set","score","via","edges","linked","flat","seeds","ranked","existing","vec","v","lines","similarity","exec","insert","c","run","similarityCol","bareTerms","baseDir","overrides","paths","whereRows","wherePaths","presetCoverage","embedActive","name","files","n","embedded","INTERNAL_COLUMNS","MAP_COLUMN_CHUNK","chunk","items","setupMapScope","JSON","stringify","mapTree","scopeWhere","scopeAnd","docs","columns","allFields","group","exprs","quoted","result","field","coverage","type","fields","hubs","recent","fieldsTotal","features","presets","resolveNote","arg","exact","find","base","basename","matches","PEEK_LIST_LIMIT","peek","pathArg","parseError","_parse_error","frontmatter","key","value","Object","entries","sectionsTotal","sections","outbound","backlinks","unresolved","backlinksTotal","_allowed","l","dst","target","src","tokens","ceil","_size","outboundTotal","unresolvedTotal","off","relatedNotes","allowed"],"mappings":"AAAA,SAASA,YAAY,QAAQ,UAAU;AACvC,SAASC,IAAI,EAAEC,WAAW,QAAQ,YAAY;AAC9C,OAAOC,WAAW,kBAAkB;AAGpC,SAASC,eAAe,EAAEC,eAAe,EAAEC,YAAY,EAAEC,cAAc,EAAEC,aAAa,EAAEC,WAAW,EAAEC,qBAAqB,EAAEC,aAAa,QAAQ,cAAc;AAC/J,SAASC,UAAU,QAAQ,cAAc;AACzC,SAASC,YAAY,EAAEC,YAAY,EAAEC,YAAY,EAAEC,kBAAkB,EAAEC,YAAY,QAAQ,sBAAsB;AACjH,SAASC,SAAS,QAAQ,sBAAsB;AAChD,SAASC,gBAAgB,QAAQ,aAAa;AAE9C,SAASC,WAAW,QAAQ,oBAAoB;AAChD,SAASC,YAAY,QAAQ,eAAe;AAE5C,2EAA2E;AAC3E,gFAAgF;AAEhF,6FAA6F;AAC7F,iEAAiE;AACjE,MAAMC,gBAAgB;AACtB,MAAMC,QAAQ;AAEd,iFAAiF;AACjF,8EAA8E;AAC9E,MAAMC,gBAAgB;AACtB,MAAMC,iBAAiB;AAEvB,8FAA8F;AAC9F,qEAAqE;AACrE,SAASC,iBAAiBC,KAAa;IACrC,MAAMC,UAAUD,MACbE,OAAO,CAAC,MAAM,KACdA,OAAO,CAAC,UAAU,KAClBA,OAAO,CAAC,mCAAmC;IAC9C,OAAOD,QACJE,KAAK,CAAC,OACNC,GAAG,CAAC,CAACC,MAAQA,IAAIH,OAAO,CAAC,kBAAkB,KAAK,iCAAiC;KACjFE,GAAG,CAAC,CAACC,MAAQA,IAAIC,WAAW,GAAGC,IAAI,IACnCC,MAAM,CAAC,CAACH,MAAQA,IAAII,MAAM,GAAG;AAClC;AAEA,SAASC,gBAAgBC,aAAqB,EAAEC,KAAe;IAC7D,MAAMC,MAA2D,EAAE;IACnE,KAAK,MAAMC,QAAQF,MAAO;QACxB,IAAIG,MAAM;QACV,OAAS;YACP,MAAMC,QAAQL,cAAcM,OAAO,CAACH,MAAMC;YAC1C,IAAIC,UAAU,CAAC,GAAG;YAClBH,IAAIK,IAAI,CAAC;gBAAEC,OAAOH;gBAAOI,KAAKJ,QAAQF,KAAKL,MAAM;gBAAEK;YAAK;YACxDC,MAAMC,QAAQF,KAAKL,MAAM;QAC3B;IACF;IACA,mFAAmF;IACnF,+EAA+E;IAC/E,OAAOI,IAAIQ,IAAI,CAAC,CAACC,GAAGC,IAAMD,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,MAAMC,SAASjB,GAAG,CAACgB,EAAE,CAACV,KAAK,GAAGM;QAC9B,MAAMM,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,MAAMC,MAAMH,gBAAgB4B,KAAKhC,WAAW,IAAIM;IAChD,IAAIC,IAAIJ,MAAM,KAAK,GAAG;QACpB,iFAAiF;QACjF,qFAAqF;QACrF,sFAAsF;QACtF,MAAMW,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEX;QAClC,OAAO;YAAE2C,SAAS,GAAGH,KAAKI,KAAK,CAAC,GAAGtB,KAAKlB,OAAO,CAAC,QAAQ,KAAKK,IAAI,KAAKa,MAAMkB,KAAK7B,MAAM,GAAG,MAAM,IAAI;YAAEkC,QAAQ;QAAE;IAClH;IACA,MAAMxB,QAAQK,gBAAgBX,KAAKf;IACnC,MAAMsB,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEU,QAAQrB;IAC1C,IAAI8C,MAAM;IACV,IAAIC,SAAS1B;IACb,KAAK,MAAM2B,KAAKjC,IAAK;QACnB,IAAIiC,EAAE3B,KAAK,GAAGA,SAAS2B,EAAE1B,GAAG,GAAGA,KAAK;QACpC,sFAAsF;QACtF,gFAAgF;QAChF,IAAI0B,EAAE3B,KAAK,GAAG0B,QAAQ;QACtBD,OAAO,GAAGN,KAAKI,KAAK,CAACG,QAAQC,EAAE3B,KAAK,EAAE,CAAC,EAAEmB,KAAKI,KAAK,CAACI,EAAE3B,KAAK,EAAE2B,EAAE1B,GAAG,EAAE,CAAC,CAAC;QACtEyB,SAASC,EAAE1B,GAAG;IAChB;IACAwB,OAAON,KAAKI,KAAK,CAACG,QAAQzB;IAC1B,MAAM2B,SAAS5B,QAAQ,IAAI,MAAM;IACjC,MAAM6B,SAAS5B,MAAMkB,KAAK7B,MAAM,GAAG,MAAM;IACzC,OAAO;QAAEgC,SAAS,GAAGM,SAASH,IAAI1C,OAAO,CAAC,QAAQ,OAAO8C,QAAQ;QAAEL,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,MAAMK,MAAMF,GAAGG,OAAO,CAAC,qIAAqIC,GAAG,CAACH,MAAMJ,MAAMA;IAC5K,OAAOK,MAAM,CAAC,CAAC,EAAEA,IAAIG,UAAU,CAAC,CAAC,EAAEH,IAAII,QAAQ,EAAE,GAAG;AACtD;AAWA,yFAAyF;AACzF,4FAA4F;AAC5F,+EAA+E;AAC/E,SAASC,QAAQN,IAAY,EAAEO,OAAiB,EAAEC,OAAkB;IAClE,IAAI,CAACD,QAAQE,IAAI,CAAC,CAACC,IAAMzF,YAAY+E,MAAMU,KAAK,OAAO;IACvD,IAAIF,oBAAAA,8BAAAA,QAASC,IAAI,CAAC,CAACC,IAAMzF,YAAY+E,MAAMU,KAAK,OAAO;IACvD,OAAO;AACT;AAEA,SAASC,mBAAmBZ,EAAgB,EAAEa,GAAmB,EAAEC,WAAwB;IACzF,IAAI,CAAC1F,gBAAgByF,MAAM,OAAO,OAAO,yDAAyD;IAClG,MAAME,OAAOf,GAAGG,OAAO,CAAC,0CAA0Ca,GAAG;IACrE,OAAOD,KAAKL,IAAI,CAAC,CAACO,IAAMH,YAAYI,GAAG,CAACD,EAAEhB,IAAI;AAChD;AAEA,6FAA6F;AAC7F,6DAA6D;AAC7D,OAAO,eAAekB,OAAOnB,EAAgB,EAAEa,GAAmB,EAAEtD,KAAa,EAAE6D,OAAsB,CAAC,CAAC;QA0GpCC,WAAwBC,iBAA8BC;IAzG3H,MAAMC,YAAY7F,cAAckF,KAAKO;IACrC,MAAM,EAAEK,CAAC,EAAEjB,OAAO,EAAEC,OAAO,EAAE,GAAGe;IAEhC,MAAME,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAClH,6FAA6F;IAC7F,wFAAwF;IACxF,MAAM0B,aAAaP,KAAKZ,OAAO,KAAKoB,aAAaR,KAAKX,OAAO,KAAKmB,aAAaR,KAAKS,SAAS,KAAK;IAClG,MAAMf,cAAca,aAAa,IAAIhD,IAAI+C,SAASvE,MAAM,CAAC,CAAC2E,IAAMvB,QAAQuB,GAAGtB,SAASC,aAAa,IAAI9B,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDa,GAAG,CAACQ,UAAUO,UAAU,EAA8BhF,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAChP,2FAA2F;IAC3F,2FAA2F;IAC3F,sDAAsD;IACtD,MAAM+B,cAAclB,YAAY/B,IAAI,GAAG2C,SAAStE,MAAM;IACtD,MAAM6E,QAAQD,cAAc9C,KAAKgD,GAAG,CAACT,IAAI,GAAG,MAAMvC,KAAKgD,GAAG,CAACT,IAAI,GAAG;IAElE,6FAA6F;IAC7F,6FAA6F;IAC7F,MAAMU,eAAeX,UAAUY,QAAQ,IAAIhH,gBAAgByF;IAC3D,IAAIsB,gBAAgB,CAACpG,aAAa8E,MAAM;QACtC,MAAM,IAAIjF,WAAW,uBAAuB,CAAC,QAAQ,EAAE4F,UAAUO,UAAU,CAAC,+JAA+J,CAAC;IAC9O;IACA,MAAMM,kBAAkBF,gBAAgBvB,mBAAmBZ,IAAIa,KAAKC;IAEpE,4FAA4F;IAC5F,0FAA0F;IAC1F,yFAAyF;IACzF,wFAAwF;IACxF,sFAAsF;IACtF,6FAA6F;IAC7F,mDAAmD;IACnD,UAAU;IACV,6FAA6F;IAC7F,wDAAwD;IACxD,MAAMwB,QAAQd,UAAUe,KAAK;IAC7B,MAAMC,YAAYF,QAAQ,CAAC,6CAA6C,CAAC,GAAG;IAC5E,MAAMG,YAAYH,QAAQ,CAAC,KAAK,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC7C,4DAA4D;IAC5D,yEAAyE;IACzE,yFAAyF;IACzF,sFAAsF;IACtF,6EAA6E;IAC7E,MAAMI,WAAW,CAAC,+DAA+D,EAAElG,cAAc,+EAA+E,EAAEgG,UAAU,uBAAuB,EAAEC,UAAU,UAAU,EAAEnG,cAAc,OAAO,EAAE2F,OAAO;IACzQ,MAAMtF,QAAQtB,gBAAgBwF,SAASe,YAAYvF,aAAakB,SAASA;IACzE,IAAIoF;IACJ,IAAI;QACFA,YAAY3C,GAAGG,OAAO,CAACuC,UAAU1B,GAAG,CAACrE;IACvC,EAAE,OAAOiG,KAAK;QACZ,MAAMxG,YAAYwG,KAAcrF,OAAO+E;IACzC;IACA,yFAAyF;IACzF,2FAA2F;IAC3F,mFAAmF;IACnFK,YAAYA,UAAUxF,MAAM,CAAC,CAAC8D,IAAMH,YAAYI,GAAG,CAACD,EAAEhB,IAAI;IAE1D,MAAMoB,OAAO,IAAIwB,IAAIF,UAAU5F,GAAG,CAAC,CAACkE,IAAM;YAACA,EAAEhB,IAAI;YAAEgB,EAAE6B,GAAG;SAAC;IACzD,wFAAwF;IACxF,4EAA4E;IAC5E,MAAMC,YAAY,IAAIpE,IAAIgE,UAAUxF,MAAM,CAAC,CAAC8D,IAAMA,EAAE6B,GAAG,KAAK,MAAM/F,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACnF,MAAM+C,aAAa,IAAIH;IACvBF,UAAUM,OAAO,CAAC,CAAChC,GAAGzC;QACpBwE,WAAWE,GAAG,CAACjC,EAAEhB,IAAI,EAAE;YAAEkD,OAAO,IAAK5G,CAAAA,QAAQiC,CAAAA;YAAI4E,KAAK;QAAQ;IAChE;IAEA,MAAMC,QAAQ9H,eAAesF,KAAK,YAAY8B,UAAUvF,MAAM,GAAG,IAAIlB,UAAU8D,MAAM,EAAE;IACvF,IAAIqD,MAAMjG,MAAM,GAAG,GAAG;QACpB,yFAAyF;QACzF,uFAAuF;QACvF,MAAMkG,SAAS,IAAI3E,IAAI0E,MAAME,IAAI;QACjC,MAAMC,QAAQ,IAAIX,IAAIF,UAAU5F,GAAG,CAAC,CAACkE,GAAGzC,IAAM;gBAACyC,EAAEhB,IAAI;gBAAE,IAAKzB,CAAAA,IAAI,CAAA;aAAG;QACnE,MAAMiF,SAAS;eAAItH,iBAAiBuF,UAAU2B,OAAOG;SAAO,CACzDrG,MAAM,CAAC,CAAC,CAAC8C,MAAMkD,MAAM,GAAKA,QAAQ,QAAQrC,YAAYI,GAAG,CAACjB,OAC1DjC,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,EAC1BoB,KAAK,CAAC,GAAG4C;QACZwB,OAAOR,OAAO,CAAC,CAAC,CAAChD,KAAK,EAAEzB;YACtB,MAAMkF,WAAWV,WAAW5C,GAAG,CAACH;YAChC,IAAIyD,UAAU;gBACZA,SAASP,KAAK,IAAI,IAAK5G,CAAAA,QAAQiC,CAAAA;gBAC/B,IAAI8E,OAAOpC,GAAG,CAACjB,OAAOyD,SAASN,GAAG,GAAG;YACvC,OAAO;gBACLJ,WAAWE,GAAG,CAACjD,MAAM;oBAAEkD,OAAO,IAAK5G,CAAAA,QAAQiC,CAAAA;oBAAI4E,KAAK;gBAAO;YAC7D;QACF;IACF;IAEA,sFAAsF;IACtF,0EAA0E;IAC1E,MAAM9B,aAAa,IAAIuB;IACvB,MAAMtB,kBAAkB,IAAIsB;IAC5B,IAAIR,iBAAiB;QACnB,MAAMsB,MAAM,AAAC,CAAA,MAAM3H,mBAAmBgE,IAAIa,KAAKtD,OAAO0E,MAAK,EAAG9E,MAAM,CAAC,CAACyG,IAAM9C,YAAYI,GAAG,CAAC0C,EAAE3D,IAAI;QAClG0D,IAAIV,OAAO,CAAC,CAAC,EAAEhD,IAAI,EAAE4D,KAAK,EAAEC,UAAU,EAAE,EAAEtF;YACxC8C,WAAW4B,GAAG,CAACjD,MAAM4D;YACrBtC,gBAAgB2B,GAAG,CAACjD,MAAM6D;YAC1B,MAAMJ,WAAWV,WAAW5C,GAAG,CAACH;YAChC,IAAIyD,UAAU;gBACZA,SAASP,KAAK,IAAI,IAAK5G,CAAAA,QAAQiC,CAAAA;gBAC/BkF,SAASN,GAAG,GAAG,GAAGM,SAASN,GAAG,CAAC,OAAO,CAAC;YACzC,OAAO;gBACLJ,WAAWE,GAAG,CAACjD,MAAM;oBAAEkD,OAAO,IAAK5G,CAAAA,QAAQiC,CAAAA;oBAAI4E,KAAK;gBAAS;YAC/D;QACF;IACF;IAEApD,GAAG+D,IAAI,CAAC;IACR/D,GAAG+D,IAAI,CAAC;IACR,MAAMC,SAAShE,GAAGG,OAAO,CAAC;IAC1B,KAAK,MAAM,CAACF,MAAMgE,EAAE,IAAIjB,WAAYgB,OAAOE,GAAG,CAACjE,MAAMgE,EAAEd,KAAK,EAAEc,EAAEb,GAAG,GAAE/B,YAAAA,KAAKjB,GAAG,CAACH,mBAAToB,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWlB,GAAG,CAACH,mBAAfqB,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBnB,GAAG,CAACH,mBAApBsB,kCAAAA,uBAA6B;IAExJ,yFAAyF;IACzF,8CAA8C;IAC9C,MAAMgB,QAAQD,QAAQ,CAAC,OAAO,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC3C,sFAAsF;IACtF,2FAA2F;IAC3F,MAAM6B,gBAAgB9B,kBAAkB,yBAAyB;IACjE,MAAMtB,OAAOf,GACVG,OAAO,CACN,CAAC,kIAAkI,EAAEgE,cAAc;;OAElJ,EAAE5B,MAAM,oCAAoC,CAAC,EAE/CvB,GAAG,CAACS;IAEP,IAAIsB,UAAUhE,IAAI,GAAG,GAAG;QACtB,MAAMqF,YAAY1H,iBAAiBa;QACnC,KAAK,MAAM2C,OAAOa,KAAM;YACtB,IAAIb,IAAI4C,GAAG,KAAK,QAAQ,CAACC,UAAU7B,GAAG,CAAChB,IAAID,IAAI,GAAa;YAC5D,IAAIhB;YACJ,IAAI;gBACFA,OAAOjE,aAAaC,KAAK4F,IAAIwD,OAAO,EAAEnE,IAAID,IAAI,GAAa;YAC7D,EAAE,OAAM;gBACN,UAAU,mEAAmE;YAC/E;YACA,MAAM,EAAEb,OAAO,EAAEE,MAAM,EAAE,GAAGN,eAAeC,MAAMmF;YACjDlE,IAAI4C,GAAG,GAAG1D;YACV,IAAIc,IAAI2D,KAAK,IAAI,MAAM3D,IAAI2D,KAAK,GAAGtI,eAAesF,KAAK,cAAcd,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;QAC1I;IACF;IAEA,OAAOyB;AACT;AAEA,4FAA4F;AAC5F,6FAA6F;AAC7F,yCAAyC;AACzC,OAAO,SAASD,YAAYd,EAAgB,EAAEa,GAAmB,EAAEyD,SAA0B;IAC3F,MAAM9C,YAAY7F,cAAckF,KAAKyD;IACrC,MAAM,EAAE9D,OAAO,EAAEC,OAAO,EAAE8B,KAAK,EAAE,GAAGf;IACpC,MAAME,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAClH,MAAM0B,aAAa2C,UAAU9D,OAAO,KAAKoB,aAAa0C,UAAU7D,OAAO,KAAKmB,aAAa0C,UAAUzC,SAAS,KAAK;IACjH,MAAM0C,QAAQ5C,aAAa,IAAIhD,IAAI+C,SAASvE,MAAM,CAAC,CAAC2E,IAAMvB,QAAQuB,GAAGtB,SAASC,aAAa,IAAI9B,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDa,GAAG,CAACQ,UAAUO,UAAU,EAA8BhF,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC1O,IAAI,CAACsC,OAAO,OAAOgC;IACnB,MAAMC,YAAYxE,GAAGG,OAAO,CAAC,CAAC,wCAAwC,EAAEoC,MAAM,CAAC,CAAC,EAAEvB,GAAG;IACrF,MAAMyD,aAAa,IAAI9F,IAAI6F,UAAUzH,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACtD,OAAO,IAAItB,IAAI;WAAI4F;KAAM,CAACpH,MAAM,CAAC,CAAC2E,IAAM2C,WAAWvD,GAAG,CAACY;AACzD;AAUA,8FAA8F;AAC9F,0EAA0E;AAC1E,OAAO,SAAS4C,eAAe1E,EAAgB,EAAEa,GAAmB;IAClE,MAAM8D,cAAcvJ,gBAAgByF;IACpC,OAAOpF,YAAYoF,KAAK9D,GAAG,CAAC,CAAC6H;QAC3B,MAAMC,QAAQ,AAAC7E,GAAGG,OAAO,CAAC,2DAA2DC,GAAG,CAACwE,MAAwBE,CAAC;QAClH,MAAMC,WAAWJ,cAAc,AAAC3E,GAAGG,OAAO,CAAC,6JAA6JC,GAAG,CAACwE,MAAwBE,CAAC,GAAG;QACxO,OAAO;YAAEF;YAAMC;YAAOE;YAAU3C,UAAU1G,sBAAsBmF,KAAK+D;QAAM;IAC7E;AACF;AAYA,MAAMI,mBAAmB,IAAIrG,IAAI;IAAC;IAAQ;IAAU;IAAS;IAAS;CAAe;AAErF,yFAAyF;AACzF,8FAA8F;AAC9F,MAAMsG,mBAAmB;AAEzB,SAASC,MAASC,KAAU,EAAEpG,IAAY;IACxC,MAAMQ,MAAa,EAAE;IACrB,IAAK,IAAIf,IAAI,GAAGA,IAAI2G,MAAM/H,MAAM,EAAEoB,KAAKO,KAAMQ,IAAI1B,IAAI,CAACsH,MAAM9F,KAAK,CAACb,GAAGA,IAAIO;IACzE,OAAOQ;AACT;AAEA,iFAAiF;AACjF,4EAA4E;AAC5E,SAAS6F,cAAcpF,EAAgB,EAAEuE,KAAkB;IACzDvE,GAAG+D,IAAI,CAAC;IACR/D,GAAG+D,IAAI,CAAC;IACR/D,GAAGG,OAAO,CAAC,mEAAmE+D,GAAG,CAACmB,KAAKC,SAAS,CAAC;WAAIf;KAAM;AAC7G;AAEA,4FAA4F;AAC5F,8DAA8D;AAC9D,OAAO,SAASgB,QAAQvF,EAAgB,EAAEa,GAAmB,EAAEyD,YAA6B,CAAC,CAAC;IAC5Fc,cAAcpF,IAAIc,YAAYd,IAAIa,KAAKyD;IACvC,MAAMkB,aAAa;IACnB,MAAMC,WAAW;IAEjB,MAAMC,OAAO1F,GAAGG,OAAO,CAAC,CAAC,8EAA8E,EAAEqF,YAAY,EAAEpF,GAAG;IAE1H,MAAMuF,UAAU,AAAC3F,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAE2D,IAAI,EAAEzH,MAAM,CAAC,CAACyH,OAAS,CAACI,iBAAiB9D,GAAG,CAAC0D;IAC1J,6FAA6F;IAC7F,+FAA+F;IAC/F,MAAMgB,YAAmB,EAAE;IAC3B,KAAK,MAAMC,SAASX,MAAMS,SAASV,kBAAmB;QACpD,MAAMa,QAAQD,MAAM9I,GAAG,CAAC,CAAC6H,MAAMpG;YAC7B,MAAMuH,SAAS,CAAC,CAAC,EAAEnB,KAAK9H,KAAK,CAAC,KAAK7B,IAAI,CAAC,MAAM,CAAC,CAAC;YAChD,OAAO,CAAC,MAAM,EAAE8K,OAAO,MAAM,EAAEvH,EAAE,+BAA+B,EAAEuH,OAAO,iBAAiB,EAAEA,OAAO,kBAAkB,EAAEvH,GAAG;QAC5H;QACA,MAAMwH,SAAShG,GAAGG,OAAO,CAAC,CAAC,OAAO,EAAE2F,MAAM7K,IAAI,CAAC,MAAM,kBAAkB,EAAEuK,YAAY,EAAEpF,GAAG;QAC1FyF,MAAM5C,OAAO,CAAC,CAAC2B,MAAMpG;gBAAgFwH;mBAA1EJ,UAAU/H,IAAI,CAAC;gBAAEoI,OAAOrB;gBAAMsB,UAAUF,MAAM,CAAC,CAAC,CAAC,EAAExH,GAAG,CAAC;gBAAY2H,IAAI,GAAGH,WAAAA,MAAM,CAAC,CAAC,CAAC,EAAExH,GAAG,CAAC,cAAfwH,sBAAAA,WAA8B;YAAG;;IACxI;IACAJ,UAAU5H,IAAI,CAAC,CAACC,GAAGC,IAAM,AAACA,EAAEgI,QAAQ,GAAejI,EAAEiI,QAAQ;IAC7D,MAAME,SAASR,UAAUvG,KAAK,CAAC,GAAG;IAElC,MAAMgH,OAAO9K,eAAesF,KAAK,UAAWb,GAAGG,OAAO,CAAC,CAAC,iKAAiK,EAAEsF,SAAS,gCAAgC,CAAC,EAAEzE,GAAG,KAAe,EAAE;IAE3R,MAAMsF,SAAStG,GAAGG,OAAO,CAAC,CAAC,mFAAmF,EAAEqF,WAAW,+BAA+B,CAAC,EAAExE,GAAG;IAEhK,OAAO;QAAE0E;QAAMU;QAAQG,aAAaX,UAAUxI,MAAM;QAAEoJ,UAAUhL,cAAcqF;QAAM4F,SAAS/B,eAAe1E,IAAIa;QAAMwF;QAAMC;IAAO;AACrI;AAEA,qFAAqF;AACrF,8BAA8B;AAC9B,OAAO,SAASI,YAAYnC,KAAe,EAAEoC,GAAW;IACtD,MAAMC,QAAQrC,MAAMsC,IAAI,CAAC,CAAC/E,IAAMA,MAAM6E;IACtC,IAAIC,OAAO,OAAOA;IAClB,MAAME,OAAO3L,MAAM4L,QAAQ,CAACJ,KAAK9J,OAAO,CAAC,UAAU,IAAII,WAAW;IAClE,MAAM+J,UAAUzC,MAAMpH,MAAM,CAAC,CAAC2E,IAAM3G,MAAM4L,QAAQ,CAACjF,GAAGjF,OAAO,CAAC,UAAU,IAAII,WAAW,OAAO6J;IAC9F,IAAIE,QAAQ5J,MAAM,KAAK,GAAG,OAAO4J,OAAO,CAAC,EAAE;IAC3C,IAAIA,QAAQ5J,MAAM,GAAG,GAAG,MAAM,IAAIxB,WAAW,kBAAkB,CAAC,CAAC,EAAE+K,IAAI,gBAAgB,EAAEK,QAAQ/L,IAAI,CAAC,OAAO;IAC7G,MAAM,IAAIW,WAAW,kBAAkB,CAAC,iBAAiB,EAAE+K,IAAI,CAAC,CAAC;AACnE;AAyBA,MAAMM,kBAAkB;AAExB,qFAAqF;AACrF,8FAA8F;AAC9F,OAAO,SAASC,KAAKlH,EAAgB,EAAEa,GAAmB,EAAEsG,OAAe,EAAE7C,YAA6B,CAAC,CAAC;QAKtFpE,mBAwBEA;IA5BtB,MAAMqE,QAAQ,AAACvE,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC/G,MAAMA,OAAOyG,YAAYnC,OAAO4C;IAEhC,MAAMjH,MAAMF,GAAGG,OAAO,CAAC,8CAA8CC,GAAG,CAACH;IACzE,MAAMmH,cAAclH,oBAAAA,IAAImH,YAAY,cAAhBnH,+BAAAA,oBAAsC;IAC1D,MAAMoH,cAAmB,CAAC;IAC1B,KAAK,MAAM,CAACC,KAAKC,MAAM,IAAIC,OAAOC,OAAO,CAACxH,KAAM;QAC9C,IAAI,CAAC8E,iBAAiB9D,GAAG,CAACqG,QAAQC,UAAU,MAAMF,WAAW,CAACC,IAAI,GAAGC;IACvE;IAEA,MAAMG,gBAAgBpM,eAAesF,KAAK,cAAc,AAACb,GAAGG,OAAO,CAAC,uDAAuDC,GAAG,CAACH,MAAwB6E,CAAC,GAAG;IAC3J,MAAM8C,WAAWrM,eAAesF,KAAK,cAAeb,GAAGG,OAAO,CAAC,2GAA2Ga,GAAG,CAACf,MAAMgH,mBAA6B,EAAE;IAEnN,IAAIY,WAAqB,EAAE;IAC3B,IAAIC,YAAsB,EAAE;IAC5B,IAAIC,aAAuB,EAAE;IAC7B,IAAIC,iBAAiB;IACrB,MAAMC,WAAWnH,YAAYd,IAAIa,KAAKyD;IACtC,IAAI/I,eAAesF,KAAK,UAAU;QAChC,MAAMtB,MAAMS,GAAGG,OAAO,CAAC,+DAA+Da,GAAG,CAACf;QAC1F4H,WAAW;eAAI,IAAIlJ,IAAIY,IAAIpC,MAAM,CAAC,CAAC+K,IAAMA,EAAEC,GAAG,KAAK,MAAMpL,GAAG,CAAC,CAACmL,IAAMA,EAAEC,GAAG;SAAa;QACtFJ,aAAaxI,IAAIpC,MAAM,CAAC,CAAC+K,IAAMA,EAAEC,GAAG,KAAK,MAAMpL,GAAG,CAAC,CAACmL,IAAMA,EAAEE,MAAM;QAClEJ,iBAAiB,AAAChI,GAAGG,OAAO,CAAC,4DAA4DC,GAAG,CAACH,MAAwB6E,CAAC;QACtHgD,YAAY,AAAC9H,GAAGG,OAAO,CAAC,qEAAqEa,GAAG,CAACf,MAAMgH,iBAA4ClK,GAAG,CAAC,CAACkE,IAAMA,EAAEoH,GAAG;IACrK;IAEA,OAAO;QACLpI;QACAqI,QAAQpJ,KAAKqJ,IAAI,CAAC,EAAErI,aAAAA,IAAIsI,KAAK,cAATtI,wBAAAA,aAAwB,KAAK;QACjDoH;QACAF;QACAQ;QACAC,UAAUA,SAASxI,KAAK,CAAC,GAAG4H;QAC5Ba;QACAC,YAAYA,WAAW1I,KAAK,CAAC,GAAG4H;QAChCU;QACAc,eAAeZ,SAASzK,MAAM;QAC9B4K;QACAU,iBAAiBX,WAAW3K,MAAM;QAClCuL,KAAK,AAAC;YAAC;YAAY;SAAQ,CAAmBxL,MAAM,CAAC,CAACyH,OAAS,CAACrJ,eAAesF,KAAK+D;IACtF;AACF;AAEA,yFAAyF;AACzF,sFAAsF;AACtF,OAAO,eAAegE,aAAa5I,EAAgB,EAAEa,GAAmB,EAAEsG,OAAe,EAAE7C,SAA0B,EAAE7C,CAAS;IAC9H,MAAM8C,QAAQ,AAACvE,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC/G,MAAMA,OAAOyG,YAAYnC,OAAO4C;IAEhC,MAAMU,WAAW,AAAC7H,GAAGG,OAAO,CAAC,oEAAoEa,GAAG,CAACf,MAAiClD,GAAG,CAAC,CAACkE,IAAMA,EAAEkH,GAAG;IACtJ,MAAML,YAAY,AAAC9H,GAAGG,OAAO,CAAC,gDAAgDa,GAAG,CAACf,MAAiClD,GAAG,CAAC,CAACkE,IAAMA,EAAEoH,GAAG;IACnI,MAAM5H,UAAU,IAAI9B,IAAI;QAACsB;WAAS4H;WAAaC;KAAU;IAEzD,yFAAyF;IACzF,2FAA2F;IAC3F,yDAAyD;IACzD,MAAMtG,YAAY7F,cAAckF,KAAKyD;IACrC,IAAI,CAAChJ,aAAauF,MAAM;QACtB,MAAM,IAAIjF,WAAW,kBAAkB;IACzC;IACA,oFAAoF;IACpF,yFAAyF;IACzF,uDAAuD;IACvD,IAAI,CAAC4F,UAAUY,QAAQ,EAAE;QACvB,MAAM,IAAIxG,WAAW,uBAAuB,CAAC,QAAQ,EAAE4F,UAAUO,UAAU,CAAC,oKAAoK,CAAC;IACnP;IACA,IAAI,CAAChG,aAAa8E,MAAM;QACtB,MAAM,IAAIjF,WAAW,uBAAuB;IAC9C;IACA,MAAMiN,UAAU/H,YAAYd,IAAIa,KAAKyD;IACrC,oFAAoF;IACpF,oDAAoD;IACpD,MAAMzI,aAAamE,IAAIa,KAAKA,IAAIwD,OAAO;IACvC,IAAI,CAACvI,aAAakE,IAAIC,OAAO;QAC3B,MAAM,IAAIrE,WAAW,qBAAqB,GAAGqE,KAAK,4GAA4G,CAAC;IACjK;IACA,IAAI,CAACW,mBAAmBZ,IAAIa,KAAKgI,UAAU,OAAO,EAAE;IACpD,OAAO5M,aAAa+D,IAAIa,KAAKZ,MAAM;QAAEQ;QAASoI;QAASpH;IAAE;AAC3D"}
+{"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 } = effective;\n\n  const allPaths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const scopePaths = rawScope(db, cfg, opts, allPaths);\n  const scopeActive = scopePaths.size < allPaths.length;\n  // The set every candidate pool must be filtered to before truncation: scope narrowed by\n  // --where, the same composition scopedPaths() gives the other commands. Runs the same where\n  // fragment matchSql does, so a bad column gets the same attributed error either way.\n  let allowedPaths: Set<string>;\n  try {\n    allowedPaths = narrowByWhere(db, scopePaths, effective.where);\n  } catch (err) {\n    throw searchError(err as Error, terms, effective.where);\n  }\n  const fetch = Math.max(k * 3, 30);\n\n  // 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, allowedPaths);\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  // A scope narrower than the whole index must filter the candidate pool before LIMIT, not\n  // after -- otherwise scoped notes ranking below the global top-`fetch` never reach the\n  // filter. A join against a temp table, not a bound parameter list: real scopes run to\n  // thousands of paths, past SQLITE_MAX_VARIABLE_NUMBER on older builds.\n  if (scopeActive) materializeScope(db, '_search_scope', scopePaths);\n  const scopeCond = scopeActive ? `AND content.path IN (SELECT \"path\" FROM _search_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} ${scopeCond} 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\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 && allowedPaths.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, allowedPaths);\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  // All three candidate paths (match, link, vector) already filtered to scope+where before\n  // reaching _search; this reapplies --where anyway since the join to frontmatter is already\n  // needed for the path column.\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// Scope only (no --where): preset_files for a named preset, JS glob matching for an ad hoc\n// include/exclude override. Shared by scopedPaths() and search(), which also needs the\n// pre-where set to size the candidate-pool filter.\nfunction rawScope(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides, allPaths?: string[]): Set<string> {\n  const effective = resolveSearch(cfg, overrides);\n  const { include, exclude } = effective;\n  const adHocScope = overrides.include !== undefined || overrides.exclude !== undefined || overrides.noExclude === true;\n  if (!adHocScope) return new Set((db.prepare('SELECT \"path\" FROM preset_files WHERE preset = ?').all(effective.presetName) as Array<{ path: string }>).map((r) => r.path));\n  const paths = allPaths ?? (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  return new Set(paths.filter((p) => inScope(p, include, exclude)));\n}\n\nfunction narrowByWhere(db: DatabaseSync, paths: Set<string>, where: string | undefined): Set<string> {\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\n// The scope resolver for non-search commands (path, peek, map): same coverage rule search()\n// applies, then narrowed by the resolved `where`.\nexport function scopedPaths(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides): Set<string> {\n  const effective = resolveSearch(cfg, overrides);\n  return narrowByWhere(db, rawScope(db, cfg, overrides), effective.where);\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  recentCaveat: string | null;\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 a path set into a named temp table (same shape as traverse.ts's allowed_nodes)\n// so a query can join/filter against it cheaply instead of binding a parameter per path.\nfunction materializeScope(db: DatabaseSync, table: string, paths: Set<string>): void {\n  db.exec(`DROP TABLE IF EXISTS ${table}`);\n  db.exec(`CREATE TEMP TABLE ${table} (\"path\" TEXT PRIMARY KEY)`);\n  db.prepare(`INSERT INTO ${table} SELECT DISTINCT value FROM json_each(?1)`).run(JSON.stringify([...paths]));\n}\n\nfunction setupMapScope(db: DatabaseSync, paths: Set<string>): void {\n  materializeScope(db, '_map_scope', 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  // A fresh clone/copy stamps files with checkout time, not edit history; second granularity\n  // matches the `recent` table above and is coarse enough to catch that without an exact-ms match.\n  const topSecond = db.prepare(`SELECT COUNT(*) AS n FROM frontmatter ${scopeWhere} GROUP BY CAST(\"_mtime\" / 1000 AS INTEGER) ORDER BY n DESC LIMIT 1`).get() as { n: number } | undefined;\n  const recentCaveat = topSecond && docs.count > 1 && topSecond.n > docs.count / 2 ? `${topSecond.n} of ${docs.count} files share one modified second, so recency likely reflects a checkout or copy, not edit history` : null;\n\n  return { docs, fields, fieldsTotal: allFields.length, features: featureStates(cfg), presets: presetCoverage(db, cfg), hubs, recent, recentCaveat };\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":["readFileSync","join","matchesGlob","posix","anyPresetEmbeds","contentTokenize","embedEnabled","featureEnabled","featureStates","presetNames","presetSemanticEnabled","resolveSearch","SenseError","embedPending","hasEmbedding","modelPresent","semanticCandidates","similarNotes","linkEdges","personalizedRank","searchError","segmentMatch","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","scopeHasEmbeddings","cfg","scopedPaths","rows","all","r","has","search","opts","hits","chunkLines","chunkSimilarity","effective","k","allPaths","scopePaths","rawScope","scopeActive","allowedPaths","narrowByWhere","where","err","fetch","max","wantsVectors","semantic","presetName","semanticEnabled","scope","whereJoin","whereCond","materializeScope","scopeCond","matchSql","undefined","matchRows","Map","hit","oversized","candidates","forEach","set","score","via","edges","linked","flat","seeds","ranked","existing","vec","lines","similarity","exec","insert","c","run","similarityCol","bareTerms","baseDir","overrides","adHocScope","noExclude","paths","p","whereRows","wherePaths","presetCoverage","embedActive","name","files","n","embedded","INTERNAL_COLUMNS","MAP_COLUMN_CHUNK","chunk","items","table","JSON","stringify","setupMapScope","mapTree","scopeWhere","scopeAnd","docs","columns","allFields","group","exprs","quoted","result","field","coverage","type","fields","hubs","recent","topSecond","recentCaveat","fieldsTotal","features","presets","resolveNote","arg","exact","find","base","basename","matches","PEEK_LIST_LIMIT","peek","pathArg","parseError","_parse_error","frontmatter","key","value","Object","entries","sectionsTotal","sections","outbound","backlinks","unresolved","backlinksTotal","_allowed","l","dst","target","src","tokens","ceil","_size","outboundTotal","unresolvedTotal","off","relatedNotes","allowed"],"mappings":"AAAA,SAASA,YAAY,QAAQ,UAAU;AACvC,SAASC,IAAI,EAAEC,WAAW,QAAQ,YAAY;AAC9C,OAAOC,WAAW,kBAAkB;AAGpC,SAASC,eAAe,EAAEC,eAAe,EAAEC,YAAY,EAAEC,cAAc,EAAEC,aAAa,EAAEC,WAAW,EAAEC,qBAAqB,EAAEC,aAAa,QAAQ,cAAc;AAC/J,SAASC,UAAU,QAAQ,cAAc;AACzC,SAASC,YAAY,EAAEC,YAAY,EAAEC,YAAY,EAAEC,kBAAkB,EAAEC,YAAY,QAAQ,sBAAsB;AACjH,SAASC,SAAS,QAAQ,sBAAsB;AAChD,SAASC,gBAAgB,QAAQ,aAAa;AAE9C,SAASC,WAAW,QAAQ,oBAAoB;AAChD,SAASC,YAAY,QAAQ,eAAe;AAE5C,2EAA2E;AAC3E,gFAAgF;AAEhF,6FAA6F;AAC7F,iEAAiE;AACjE,MAAMC,gBAAgB;AACtB,MAAMC,QAAQ;AAEd,iFAAiF;AACjF,8EAA8E;AAC9E,MAAMC,gBAAgB;AACtB,MAAMC,iBAAiB;AAEvB,8FAA8F;AAC9F,qEAAqE;AACrE,SAASC,iBAAiBC,KAAa;IACrC,MAAMC,UAAUD,MACbE,OAAO,CAAC,MAAM,KACdA,OAAO,CAAC,UAAU,KAClBA,OAAO,CAAC,mCAAmC;IAC9C,OAAOD,QACJE,KAAK,CAAC,OACNC,GAAG,CAAC,CAACC,MAAQA,IAAIH,OAAO,CAAC,kBAAkB,KAAK,iCAAiC;KACjFE,GAAG,CAAC,CAACC,MAAQA,IAAIC,WAAW,GAAGC,IAAI,IACnCC,MAAM,CAAC,CAACH,MAAQA,IAAII,MAAM,GAAG;AAClC;AAEA,SAASC,gBAAgBC,aAAqB,EAAEC,KAAe;IAC7D,MAAMC,MAA2D,EAAE;IACnE,KAAK,MAAMC,QAAQF,MAAO;QACxB,IAAIG,MAAM;QACV,OAAS;YACP,MAAMC,QAAQL,cAAcM,OAAO,CAACH,MAAMC;YAC1C,IAAIC,UAAU,CAAC,GAAG;YAClBH,IAAIK,IAAI,CAAC;gBAAEC,OAAOH;gBAAOI,KAAKJ,QAAQF,KAAKL,MAAM;gBAAEK;YAAK;YACxDC,MAAMC,QAAQF,KAAKL,MAAM;QAC3B;IACF;IACA,mFAAmF;IACnF,+EAA+E;IAC/E,OAAOI,IAAIQ,IAAI,CAAC,CAACC,GAAGC,IAAMD,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,MAAMC,SAASjB,GAAG,CAACgB,EAAE,CAACV,KAAK,GAAGM;QAC9B,MAAMM,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,MAAMC,MAAMH,gBAAgB4B,KAAKhC,WAAW,IAAIM;IAChD,IAAIC,IAAIJ,MAAM,KAAK,GAAG;QACpB,iFAAiF;QACjF,qFAAqF;QACrF,sFAAsF;QACtF,MAAMW,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEX;QAClC,OAAO;YAAE2C,SAAS,GAAGH,KAAKI,KAAK,CAAC,GAAGtB,KAAKlB,OAAO,CAAC,QAAQ,KAAKK,IAAI,KAAKa,MAAMkB,KAAK7B,MAAM,GAAG,MAAM,IAAI;YAAEkC,QAAQ;QAAE;IAClH;IACA,MAAMxB,QAAQK,gBAAgBX,KAAKf;IACnC,MAAMsB,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEU,QAAQrB;IAC1C,IAAI8C,MAAM;IACV,IAAIC,SAAS1B;IACb,KAAK,MAAM2B,KAAKjC,IAAK;QACnB,IAAIiC,EAAE3B,KAAK,GAAGA,SAAS2B,EAAE1B,GAAG,GAAGA,KAAK;QACpC,sFAAsF;QACtF,gFAAgF;QAChF,IAAI0B,EAAE3B,KAAK,GAAG0B,QAAQ;QACtBD,OAAO,GAAGN,KAAKI,KAAK,CAACG,QAAQC,EAAE3B,KAAK,EAAE,CAAC,EAAEmB,KAAKI,KAAK,CAACI,EAAE3B,KAAK,EAAE2B,EAAE1B,GAAG,EAAE,CAAC,CAAC;QACtEyB,SAASC,EAAE1B,GAAG;IAChB;IACAwB,OAAON,KAAKI,KAAK,CAACG,QAAQzB;IAC1B,MAAM2B,SAAS5B,QAAQ,IAAI,MAAM;IACjC,MAAM6B,SAAS5B,MAAMkB,KAAK7B,MAAM,GAAG,MAAM;IACzC,OAAO;QAAEgC,SAAS,GAAGM,SAASH,IAAI1C,OAAO,CAAC,QAAQ,OAAO8C,QAAQ;QAAEL,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,MAAMK,MAAMF,GAAGG,OAAO,CAAC,qIAAqIC,GAAG,CAACH,MAAMJ,MAAMA;IAC5K,OAAOK,MAAM,CAAC,CAAC,EAAEA,IAAIG,UAAU,CAAC,CAAC,EAAEH,IAAII,QAAQ,EAAE,GAAG;AACtD;AAWA,yFAAyF;AACzF,4FAA4F;AAC5F,+EAA+E;AAC/E,SAASC,QAAQN,IAAY,EAAEO,OAAiB,EAAEC,OAAkB;IAClE,IAAI,CAACD,QAAQE,IAAI,CAAC,CAACC,IAAMzF,YAAY+E,MAAMU,KAAK,OAAO;IACvD,IAAIF,oBAAAA,8BAAAA,QAASC,IAAI,CAAC,CAACC,IAAMzF,YAAY+E,MAAMU,KAAK,OAAO;IACvD,OAAO;AACT;AAEA,SAASC,mBAAmBZ,EAAgB,EAAEa,GAAmB,EAAEC,WAAwB;IACzF,IAAI,CAAC1F,gBAAgByF,MAAM,OAAO,OAAO,yDAAyD;IAClG,MAAME,OAAOf,GAAGG,OAAO,CAAC,0CAA0Ca,GAAG;IACrE,OAAOD,KAAKL,IAAI,CAAC,CAACO,IAAMH,YAAYI,GAAG,CAACD,EAAEhB,IAAI;AAChD;AAEA,6FAA6F;AAC7F,6DAA6D;AAC7D,OAAO,eAAekB,OAAOnB,EAAgB,EAAEa,GAAmB,EAAEtD,KAAa,EAAE6D,OAAsB,CAAC,CAAC;QA+GpCC,WAAwBC,iBAA8BC;IA9G3H,MAAMC,YAAY7F,cAAckF,KAAKO;IACrC,MAAM,EAAEK,CAAC,EAAE,GAAGD;IAEd,MAAME,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAClH,MAAM0B,aAAaC,SAAS5B,IAAIa,KAAKO,MAAMM;IAC3C,MAAMG,cAAcF,WAAW5C,IAAI,GAAG2C,SAAStE,MAAM;IACrD,wFAAwF;IACxF,4FAA4F;IAC5F,qFAAqF;IACrF,IAAI0E;IACJ,IAAI;QACFA,eAAeC,cAAc/B,IAAI2B,YAAYH,UAAUQ,KAAK;IAC9D,EAAE,OAAOC,KAAK;QACZ,MAAM7F,YAAY6F,KAAc1E,OAAOiE,UAAUQ,KAAK;IACxD;IACA,MAAME,QAAQhD,KAAKiD,GAAG,CAACV,IAAI,GAAG;IAE9B,6FAA6F;IAC7F,6FAA6F;IAC7F,MAAMW,eAAeZ,UAAUa,QAAQ,IAAIjH,gBAAgByF;IAC3D,IAAIuB,gBAAgB,CAACrG,aAAa8E,MAAM;QACtC,MAAM,IAAIjF,WAAW,uBAAuB,CAAC,QAAQ,EAAE4F,UAAUc,UAAU,CAAC,+JAA+J,CAAC;IAC9O;IACA,MAAMC,kBAAkBH,gBAAgBxB,mBAAmBZ,IAAIa,KAAKiB;IAEpE,4FAA4F;IAC5F,0FAA0F;IAC1F,yFAAyF;IACzF,wFAAwF;IACxF,sFAAsF;IACtF,6FAA6F;IAC7F,mDAAmD;IACnD,UAAU;IACV,6FAA6F;IAC7F,wDAAwD;IACxD,MAAMU,QAAQhB,UAAUQ,KAAK;IAC7B,MAAMS,YAAYD,QAAQ,CAAC,6CAA6C,CAAC,GAAG;IAC5E,MAAME,YAAYF,QAAQ,CAAC,KAAK,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC7C,yFAAyF;IACzF,uFAAuF;IACvF,sFAAsF;IACtF,uEAAuE;IACvE,IAAIX,aAAac,iBAAiB3C,IAAI,iBAAiB2B;IACvD,MAAMiB,YAAYf,cAAc,CAAC,sDAAsD,CAAC,GAAG;IAC3F,4DAA4D;IAC5D,yEAAyE;IACzE,yFAAyF;IACzF,sFAAsF;IACtF,6EAA6E;IAC7E,MAAMgB,WAAW,CAAC,+DAA+D,EAAErG,cAAc,+EAA+E,EAAEiG,UAAU,uBAAuB,EAAEC,UAAU,CAAC,EAAEE,UAAU,UAAU,EAAEtG,cAAc,OAAO,EAAE4F,OAAO;IACtR,MAAMvF,QAAQtB,gBAAgBwF,SAASiC,YAAYzG,aAAakB,SAASA;IACzE,IAAIwF;IACJ,IAAI;QACFA,YAAY/C,GAAGG,OAAO,CAAC0C,UAAU7B,GAAG,CAACrE;IACvC,EAAE,OAAOsF,KAAK;QACZ,MAAM7F,YAAY6F,KAAc1E,OAAOiF;IACzC;IAEA,MAAMnB,OAAO,IAAI2B,IAAID,UAAUhG,GAAG,CAAC,CAACkE,IAAM;YAACA,EAAEhB,IAAI;YAAEgB,EAAEgC,GAAG;SAAC;IACzD,wFAAwF;IACxF,4EAA4E;IAC5E,MAAMC,YAAY,IAAIvE,IAAIoE,UAAU5F,MAAM,CAAC,CAAC8D,IAAMA,EAAEgC,GAAG,KAAK,MAAMlG,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACnF,MAAMkD,aAAa,IAAIH;IACvBD,UAAUK,OAAO,CAAC,CAACnC,GAAGzC;QACpB2E,WAAWE,GAAG,CAACpC,EAAEhB,IAAI,EAAE;YAAEqD,OAAO,IAAK/G,CAAAA,QAAQiC,CAAAA;YAAI+E,KAAK;QAAQ;IAChE;IAEA,MAAMC,QAAQjI,eAAesF,KAAK,YAAYkC,UAAU3F,MAAM,GAAG,IAAIlB,UAAU8D,MAAM,EAAE;IACvF,IAAIwD,MAAMpG,MAAM,GAAG,GAAG;QACpB,yFAAyF;QACzF,uFAAuF;QACvF,MAAMqG,SAAS,IAAI9E,IAAI6E,MAAME,IAAI;QACjC,MAAMC,QAAQ,IAAIX,IAAID,UAAUhG,GAAG,CAAC,CAACkE,GAAGzC,IAAM;gBAACyC,EAAEhB,IAAI;gBAAE,IAAKzB,CAAAA,IAAI,CAAA;aAAG;QACnE,MAAMoF,SAAS;eAAIzH,iBAAiBuF,UAAU8B,OAAOG;SAAO,CACzDxG,MAAM,CAAC,CAAC,CAAC8C,MAAMqD,MAAM,GAAKA,QAAQ,QAAQxB,aAAaZ,GAAG,CAACjB,OAC3DjC,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,EAC1BoB,KAAK,CAAC,GAAG6C;QACZ0B,OAAOR,OAAO,CAAC,CAAC,CAACnD,KAAK,EAAEzB;YACtB,MAAMqF,WAAWV,WAAW/C,GAAG,CAACH;YAChC,IAAI4D,UAAU;gBACZA,SAASP,KAAK,IAAI,IAAK/G,CAAAA,QAAQiC,CAAAA;gBAC/B,IAAIiF,OAAOvC,GAAG,CAACjB,OAAO4D,SAASN,GAAG,GAAG;YACvC,OAAO;gBACLJ,WAAWE,GAAG,CAACpD,MAAM;oBAAEqD,OAAO,IAAK/G,CAAAA,QAAQiC,CAAAA;oBAAI+E,KAAK;gBAAO;YAC7D;QACF;IACF;IAEA,sFAAsF;IACtF,0EAA0E;IAC1E,MAAMjC,aAAa,IAAI0B;IACvB,MAAMzB,kBAAkB,IAAIyB;IAC5B,IAAIT,iBAAiB;QACnB,MAAMuB,MAAM,MAAM9H,mBAAmBgE,IAAIa,KAAKtD,OAAO2E,OAAOJ;QAC5DgC,IAAIV,OAAO,CAAC,CAAC,EAAEnD,IAAI,EAAE8D,KAAK,EAAEC,UAAU,EAAE,EAAExF;YACxC8C,WAAW+B,GAAG,CAACpD,MAAM8D;YACrBxC,gBAAgB8B,GAAG,CAACpD,MAAM+D;YAC1B,MAAMH,WAAWV,WAAW/C,GAAG,CAACH;YAChC,IAAI4D,UAAU;gBACZA,SAASP,KAAK,IAAI,IAAK/G,CAAAA,QAAQiC,CAAAA;gBAC/BqF,SAASN,GAAG,GAAG,GAAGM,SAASN,GAAG,CAAC,OAAO,CAAC;YACzC,OAAO;gBACLJ,WAAWE,GAAG,CAACpD,MAAM;oBAAEqD,OAAO,IAAK/G,CAAAA,QAAQiC,CAAAA;oBAAI+E,KAAK;gBAAS;YAC/D;QACF;IACF;IAEAvD,GAAGiE,IAAI,CAAC;IACRjE,GAAGiE,IAAI,CAAC;IACR,MAAMC,SAASlE,GAAGG,OAAO,CAAC;IAC1B,KAAK,MAAM,CAACF,MAAMkE,EAAE,IAAIhB,WAAYe,OAAOE,GAAG,CAACnE,MAAMkE,EAAEb,KAAK,EAAEa,EAAEZ,GAAG,GAAElC,YAAAA,KAAKjB,GAAG,CAACH,mBAAToB,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWlB,GAAG,CAACH,mBAAfqB,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBnB,GAAG,CAACH,mBAApBsB,kCAAAA,uBAA6B;IAExJ,yFAAyF;IACzF,2FAA2F;IAC3F,8BAA8B;IAC9B,MAAMS,QAAQQ,QAAQ,CAAC,OAAO,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC3C,sFAAsF;IACtF,2FAA2F;IAC3F,MAAM6B,gBAAgB9B,kBAAkB,yBAAyB;IACjE,MAAMxB,OAAOf,GACVG,OAAO,CACN,CAAC,kIAAkI,EAAEkE,cAAc;;OAElJ,EAAErC,MAAM,oCAAoC,CAAC,EAE/ChB,GAAG,CAACS;IAEP,IAAIyB,UAAUnE,IAAI,GAAG,GAAG;QACtB,MAAMuF,YAAY5H,iBAAiBa;QACnC,KAAK,MAAM2C,OAAOa,KAAM;YACtB,IAAIb,IAAI+C,GAAG,KAAK,QAAQ,CAACC,UAAUhC,GAAG,CAAChB,IAAID,IAAI,GAAa;YAC5D,IAAIhB;YACJ,IAAI;gBACFA,OAAOjE,aAAaC,KAAK4F,IAAI0D,OAAO,EAAErE,IAAID,IAAI,GAAa;YAC7D,EAAE,OAAM;gBACN,UAAU,mEAAmE;YAC/E;YACA,MAAM,EAAEb,OAAO,EAAEE,MAAM,EAAE,GAAGN,eAAeC,MAAMqF;YACjDpE,IAAI+C,GAAG,GAAG7D;YACV,IAAIc,IAAI6D,KAAK,IAAI,MAAM7D,IAAI6D,KAAK,GAAGxI,eAAesF,KAAK,cAAcd,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;QAC1I;IACF;IAEA,OAAOyB;AACT;AAEA,2FAA2F;AAC3F,uFAAuF;AACvF,mDAAmD;AACnD,SAASa,SAAS5B,EAAgB,EAAEa,GAAmB,EAAE2D,SAA0B,EAAE9C,QAAmB;IACtG,MAAMF,YAAY7F,cAAckF,KAAK2D;IACrC,MAAM,EAAEhE,OAAO,EAAEC,OAAO,EAAE,GAAGe;IAC7B,MAAMiD,aAAaD,UAAUhE,OAAO,KAAKsC,aAAa0B,UAAU/D,OAAO,KAAKqC,aAAa0B,UAAUE,SAAS,KAAK;IACjH,IAAI,CAACD,YAAY,OAAO,IAAI9F,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDa,GAAG,CAACQ,UAAUc,UAAU,EAA8BvF,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACvK,MAAM0E,QAAQjD,qBAAAA,sBAAAA,WAAY,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC3H,OAAO,IAAItB,IAAIgG,MAAMxH,MAAM,CAAC,CAACyH,IAAMrE,QAAQqE,GAAGpE,SAASC;AACzD;AAEA,SAASsB,cAAc/B,EAAgB,EAAE2E,KAAkB,EAAE3C,KAAyB;IACpF,IAAI,CAACA,OAAO,OAAO2C;IACnB,MAAME,YAAY7E,GAAGG,OAAO,CAAC,CAAC,wCAAwC,EAAE6B,MAAM,CAAC,CAAC,EAAEhB,GAAG;IACrF,MAAM8D,aAAa,IAAInG,IAAIkG,UAAU9H,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACtD,OAAO,IAAItB,IAAI;WAAIgG;KAAM,CAACxH,MAAM,CAAC,CAACyH,IAAME,WAAW5D,GAAG,CAAC0D;AACzD;AAEA,4FAA4F;AAC5F,kDAAkD;AAClD,OAAO,SAAS9D,YAAYd,EAAgB,EAAEa,GAAmB,EAAE2D,SAA0B;IAC3F,MAAMhD,YAAY7F,cAAckF,KAAK2D;IACrC,OAAOzC,cAAc/B,IAAI4B,SAAS5B,IAAIa,KAAK2D,YAAYhD,UAAUQ,KAAK;AACxE;AAUA,8FAA8F;AAC9F,0EAA0E;AAC1E,OAAO,SAAS+C,eAAe/E,EAAgB,EAAEa,GAAmB;IAClE,MAAMmE,cAAc5J,gBAAgByF;IACpC,OAAOpF,YAAYoF,KAAK9D,GAAG,CAAC,CAACkI;QAC3B,MAAMC,QAAQ,AAAClF,GAAGG,OAAO,CAAC,2DAA2DC,GAAG,CAAC6E,MAAwBE,CAAC;QAClH,MAAMC,WAAWJ,cAAc,AAAChF,GAAGG,OAAO,CAAC,6JAA6JC,GAAG,CAAC6E,MAAwBE,CAAC,GAAG;QACxO,OAAO;YAAEF;YAAMC;YAAOE;YAAU/C,UAAU3G,sBAAsBmF,KAAKoE;QAAM;IAC7E;AACF;AAaA,MAAMI,mBAAmB,IAAI1G,IAAI;IAAC;IAAQ;IAAU;IAAS;IAAS;CAAe;AAErF,yFAAyF;AACzF,8FAA8F;AAC9F,MAAM2G,mBAAmB;AAEzB,SAASC,MAASC,KAAU,EAAEzG,IAAY;IACxC,MAAMQ,MAAa,EAAE;IACrB,IAAK,IAAIf,IAAI,GAAGA,IAAIgH,MAAMpI,MAAM,EAAEoB,KAAKO,KAAMQ,IAAI1B,IAAI,CAAC2H,MAAMnG,KAAK,CAACb,GAAGA,IAAIO;IACzE,OAAOQ;AACT;AAEA,8FAA8F;AAC9F,yFAAyF;AACzF,SAASoD,iBAAiB3C,EAAgB,EAAEyF,KAAa,EAAEd,KAAkB;IAC3E3E,GAAGiE,IAAI,CAAC,CAAC,qBAAqB,EAAEwB,OAAO;IACvCzF,GAAGiE,IAAI,CAAC,CAAC,kBAAkB,EAAEwB,MAAM,0BAA0B,CAAC;IAC9DzF,GAAGG,OAAO,CAAC,CAAC,YAAY,EAAEsF,MAAM,yCAAyC,CAAC,EAAErB,GAAG,CAACsB,KAAKC,SAAS,CAAC;WAAIhB;KAAM;AAC3G;AAEA,SAASiB,cAAc5F,EAAgB,EAAE2E,KAAkB;IACzDhC,iBAAiB3C,IAAI,cAAc2E;AACrC;AAEA,4FAA4F;AAC5F,8DAA8D;AAC9D,OAAO,SAASkB,QAAQ7F,EAAgB,EAAEa,GAAmB,EAAE2D,YAA6B,CAAC,CAAC;IAC5FoB,cAAc5F,IAAIc,YAAYd,IAAIa,KAAK2D;IACvC,MAAMsB,aAAa;IACnB,MAAMC,WAAW;IAEjB,MAAMC,OAAOhG,GAAGG,OAAO,CAAC,CAAC,8EAA8E,EAAE2F,YAAY,EAAE1F,GAAG;IAE1H,MAAM6F,UAAU,AAACjG,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEgE,IAAI,EAAE9H,MAAM,CAAC,CAAC8H,OAAS,CAACI,iBAAiBnE,GAAG,CAAC+D;IAC1J,6FAA6F;IAC7F,+FAA+F;IAC/F,MAAMiB,YAAmB,EAAE;IAC3B,KAAK,MAAMC,SAASZ,MAAMU,SAASX,kBAAmB;QACpD,MAAMc,QAAQD,MAAMpJ,GAAG,CAAC,CAACkI,MAAMzG;YAC7B,MAAM6H,SAAS,CAAC,CAAC,EAAEpB,KAAKnI,KAAK,CAAC,KAAK7B,IAAI,CAAC,MAAM,CAAC,CAAC;YAChD,OAAO,CAAC,MAAM,EAAEoL,OAAO,MAAM,EAAE7H,EAAE,+BAA+B,EAAE6H,OAAO,iBAAiB,EAAEA,OAAO,kBAAkB,EAAE7H,GAAG;QAC5H;QACA,MAAM8H,SAAStG,GAAGG,OAAO,CAAC,CAAC,OAAO,EAAEiG,MAAMnL,IAAI,CAAC,MAAM,kBAAkB,EAAE6K,YAAY,EAAE1F,GAAG;QAC1F+F,MAAM/C,OAAO,CAAC,CAAC6B,MAAMzG;gBAAgF8H;mBAA1EJ,UAAUrI,IAAI,CAAC;gBAAE0I,OAAOtB;gBAAMuB,UAAUF,MAAM,CAAC,CAAC,CAAC,EAAE9H,GAAG,CAAC;gBAAYiI,IAAI,GAAGH,WAAAA,MAAM,CAAC,CAAC,CAAC,EAAE9H,GAAG,CAAC,cAAf8H,sBAAAA,WAA8B;YAAG;;IACxI;IACAJ,UAAUlI,IAAI,CAAC,CAACC,GAAGC,IAAM,AAACA,EAAEsI,QAAQ,GAAevI,EAAEuI,QAAQ;IAC7D,MAAME,SAASR,UAAU7G,KAAK,CAAC,GAAG;IAElC,MAAMsH,OAAOpL,eAAesF,KAAK,UAAWb,GAAGG,OAAO,CAAC,CAAC,iKAAiK,EAAE4F,SAAS,gCAAgC,CAAC,EAAE/E,GAAG,KAAe,EAAE;IAE3R,MAAM4F,SAAS5G,GAAGG,OAAO,CAAC,CAAC,mFAAmF,EAAE2F,WAAW,+BAA+B,CAAC,EAAE9E,GAAG;IAEhK,2FAA2F;IAC3F,iGAAiG;IACjG,MAAM6F,YAAY7G,GAAGG,OAAO,CAAC,CAAC,sCAAsC,EAAE2F,WAAW,kEAAkE,CAAC,EAAE1F,GAAG;IACzJ,MAAM0G,eAAeD,aAAab,KAAKpH,KAAK,GAAG,KAAKiI,UAAU1B,CAAC,GAAGa,KAAKpH,KAAK,GAAG,IAAI,GAAGiI,UAAU1B,CAAC,CAAC,IAAI,EAAEa,KAAKpH,KAAK,CAAC,iGAAiG,CAAC,GAAG;IAExN,OAAO;QAAEoH;QAAMU;QAAQK,aAAab,UAAU9I,MAAM;QAAE4J,UAAUxL,cAAcqF;QAAMoG,SAASlC,eAAe/E,IAAIa;QAAM8F;QAAMC;QAAQE;IAAa;AACnJ;AAEA,qFAAqF;AACrF,8BAA8B;AAC9B,OAAO,SAASI,YAAYvC,KAAe,EAAEwC,GAAW;IACtD,MAAMC,QAAQzC,MAAM0C,IAAI,CAAC,CAACzC,IAAMA,MAAMuC;IACtC,IAAIC,OAAO,OAAOA;IAClB,MAAME,OAAOnM,MAAMoM,QAAQ,CAACJ,KAAKtK,OAAO,CAAC,UAAU,IAAII,WAAW;IAClE,MAAMuK,UAAU7C,MAAMxH,MAAM,CAAC,CAACyH,IAAMzJ,MAAMoM,QAAQ,CAAC3C,GAAG/H,OAAO,CAAC,UAAU,IAAII,WAAW,OAAOqK;IAC9F,IAAIE,QAAQpK,MAAM,KAAK,GAAG,OAAOoK,OAAO,CAAC,EAAE;IAC3C,IAAIA,QAAQpK,MAAM,GAAG,GAAG,MAAM,IAAIxB,WAAW,kBAAkB,CAAC,CAAC,EAAEuL,IAAI,gBAAgB,EAAEK,QAAQvM,IAAI,CAAC,OAAO;IAC7G,MAAM,IAAIW,WAAW,kBAAkB,CAAC,iBAAiB,EAAEuL,IAAI,CAAC,CAAC;AACnE;AAyBA,MAAMM,kBAAkB;AAExB,qFAAqF;AACrF,8FAA8F;AAC9F,OAAO,SAASC,KAAK1H,EAAgB,EAAEa,GAAmB,EAAE8G,OAAe,EAAEnD,YAA6B,CAAC,CAAC;QAKtFtE,mBAwBEA;IA5BtB,MAAMyE,QAAQ,AAAC3E,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC/G,MAAMA,OAAOiH,YAAYvC,OAAOgD;IAEhC,MAAMzH,MAAMF,GAAGG,OAAO,CAAC,8CAA8CC,GAAG,CAACH;IACzE,MAAM2H,cAAc1H,oBAAAA,IAAI2H,YAAY,cAAhB3H,+BAAAA,oBAAsC;IAC1D,MAAM4H,cAAmB,CAAC;IAC1B,KAAK,MAAM,CAACC,KAAKC,MAAM,IAAIC,OAAOC,OAAO,CAAChI,KAAM;QAC9C,IAAI,CAACmF,iBAAiBnE,GAAG,CAAC6G,QAAQC,UAAU,MAAMF,WAAW,CAACC,IAAI,GAAGC;IACvE;IAEA,MAAMG,gBAAgB5M,eAAesF,KAAK,cAAc,AAACb,GAAGG,OAAO,CAAC,uDAAuDC,GAAG,CAACH,MAAwBkF,CAAC,GAAG;IAC3J,MAAMiD,WAAW7M,eAAesF,KAAK,cAAeb,GAAGG,OAAO,CAAC,2GAA2Ga,GAAG,CAACf,MAAMwH,mBAA6B,EAAE;IAEnN,IAAIY,WAAqB,EAAE;IAC3B,IAAIC,YAAsB,EAAE;IAC5B,IAAIC,aAAuB,EAAE;IAC7B,IAAIC,iBAAiB;IACrB,MAAMC,WAAW3H,YAAYd,IAAIa,KAAK2D;IACtC,IAAIjJ,eAAesF,KAAK,UAAU;QAChC,MAAMtB,MAAMS,GAAGG,OAAO,CAAC,+DAA+Da,GAAG,CAACf;QAC1FoI,WAAW;eAAI,IAAI1J,IAAIY,IAAIpC,MAAM,CAAC,CAACuL,IAAMA,EAAEC,GAAG,KAAK,MAAM5L,GAAG,CAAC,CAAC2L,IAAMA,EAAEC,GAAG;SAAa;QACtFJ,aAAahJ,IAAIpC,MAAM,CAAC,CAACuL,IAAMA,EAAEC,GAAG,KAAK,MAAM5L,GAAG,CAAC,CAAC2L,IAAMA,EAAEE,MAAM;QAClEJ,iBAAiB,AAACxI,GAAGG,OAAO,CAAC,4DAA4DC,GAAG,CAACH,MAAwBkF,CAAC;QACtHmD,YAAY,AAACtI,GAAGG,OAAO,CAAC,qEAAqEa,GAAG,CAACf,MAAMwH,iBAA4C1K,GAAG,CAAC,CAACkE,IAAMA,EAAE4H,GAAG;IACrK;IAEA,OAAO;QACL5I;QACA6I,QAAQ5J,KAAK6J,IAAI,CAAC,EAAE7I,aAAAA,IAAI8I,KAAK,cAAT9I,wBAAAA,aAAwB,KAAK;QACjD4H;QACAF;QACAQ;QACAC,UAAUA,SAAShJ,KAAK,CAAC,GAAGoI;QAC5Ba;QACAC,YAAYA,WAAWlJ,KAAK,CAAC,GAAGoI;QAChCU;QACAc,eAAeZ,SAASjL,MAAM;QAC9BoL;QACAU,iBAAiBX,WAAWnL,MAAM;QAClC+L,KAAK,AAAC;YAAC;YAAY;SAAQ,CAAmBhM,MAAM,CAAC,CAAC8H,OAAS,CAAC1J,eAAesF,KAAKoE;IACtF;AACF;AAEA,yFAAyF;AACzF,sFAAsF;AACtF,OAAO,eAAemE,aAAapJ,EAAgB,EAAEa,GAAmB,EAAE8G,OAAe,EAAEnD,SAA0B,EAAE/C,CAAS;IAC9H,MAAMkD,QAAQ,AAAC3E,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC/G,MAAMA,OAAOiH,YAAYvC,OAAOgD;IAEhC,MAAMU,WAAW,AAACrI,GAAGG,OAAO,CAAC,oEAAoEa,GAAG,CAACf,MAAiClD,GAAG,CAAC,CAACkE,IAAMA,EAAE0H,GAAG;IACtJ,MAAML,YAAY,AAACtI,GAAGG,OAAO,CAAC,gDAAgDa,GAAG,CAACf,MAAiClD,GAAG,CAAC,CAACkE,IAAMA,EAAE4H,GAAG;IACnI,MAAMpI,UAAU,IAAI9B,IAAI;QAACsB;WAASoI;WAAaC;KAAU;IAEzD,yFAAyF;IACzF,2FAA2F;IAC3F,yDAAyD;IACzD,MAAM9G,YAAY7F,cAAckF,KAAK2D;IACrC,IAAI,CAAClJ,aAAauF,MAAM;QACtB,MAAM,IAAIjF,WAAW,kBAAkB;IACzC;IACA,oFAAoF;IACpF,yFAAyF;IACzF,uDAAuD;IACvD,IAAI,CAAC4F,UAAUa,QAAQ,EAAE;QACvB,MAAM,IAAIzG,WAAW,uBAAuB,CAAC,QAAQ,EAAE4F,UAAUc,UAAU,CAAC,oKAAoK,CAAC;IACnP;IACA,IAAI,CAACvG,aAAa8E,MAAM;QACtB,MAAM,IAAIjF,WAAW,uBAAuB;IAC9C;IACA,MAAMyN,UAAUvI,YAAYd,IAAIa,KAAK2D;IACrC,oFAAoF;IACpF,oDAAoD;IACpD,MAAM3I,aAAamE,IAAIa,KAAKA,IAAI0D,OAAO;IACvC,IAAI,CAACzI,aAAakE,IAAIC,OAAO;QAC3B,MAAM,IAAIrE,WAAW,qBAAqB,GAAGqE,KAAK,4GAA4G,CAAC;IACjK;IACA,IAAI,CAACW,mBAAmBZ,IAAIa,KAAKwI,UAAU,OAAO,EAAE;IACpD,OAAOpN,aAAa+D,IAAIa,KAAKZ,MAAM;QAAEQ;QAAS4I;QAAS5H;IAAE;AAC3D"}

package/dist/esm/features/embed.d.ts

@@ -14,7 +14,7 @@ export declare function hasModelFiles(model: string): boolean;
 export declare function modelPresent(cfg: Config): boolean;
 export declare function downloadModel(model: string, onFile?: (file: string, dir: string) => void): Promise<string>;
 export declare function embedPending(db: DatabaseSync, cfg: Config, baseDir: string): Promise<void>;
-export declare function semanticCandidates(db: DatabaseSync, cfg: Config, terms: string, fetch: number): Promise<Array<{
+export declare function semanticCandidates(db: DatabaseSync, cfg: Config, terms: string, fetch: number, allowed?: Set<string>): Promise<Array<{
     path: string;
     lines: string;
     similarity: number;

package/dist/esm/features/embed.js

@@ -332,7 +332,7 @@ function asCosine(score) {
 // Best chunk per file by cosine, its line range riding along; FTS5 operators are stripped as
 // lexical syntax. Similarity comes back because the fused score cannot express match quality,
 // and nearest-neighbour search always returns a neighbour however far away.
-export async function semanticCandidates(db, cfg, terms, fetch1) {
+export async function semanticCandidates(db, cfg, terms, fetch1, allowed) {
     var _terms_match;
     const baseDir = cfg.baseDir;
     if (!baseDir) throw new SenseError('EMBED_MODEL', 'semantic expansion needs a config with baseDir (use loadConfig/open)');
@@ -351,6 +351,7 @@ export async function semanticCandidates(db, cfg, terms, fetch1) {
     const rows = db.prepare('SELECT "path", start_line, end_line, scale, vector FROM embeddings WHERE vector IS NOT NULL').all();
     const best = new Map();
     for (const row of rows){
+        if (allowed && !allowed.has(row.path)) continue;
         const q = new Int8Array(row.vector.buffer, row.vector.byteOffset, Math.min(storeDims, row.vector.byteLength));
         let dot = 0;
         for(let d = 0; d < q.length; d++)dot += q[d] * qv[d];

package/dist/esm/features/embed.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/features/embed.ts"],"sourcesContent":["import { existsSync, mkdirSync, readFileSync, renameSync, writeFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { Config, ResolvedConfig } from '../config.ts';\nimport { embedConfig } from '../config.ts';\nimport { SenseError } from '../errors.ts';\nimport { progress } from '../progress.ts';\nimport { parseFile } from '../scan.ts';\nimport type { Feature } from './types.ts';\n\n// Heading-based chunks, int8 vectors with a per-vector scale, NULL vector = not yet embedded.\n// Reconcile writes dirty rows; embedding tops up on the next search, so staleness costs recall.\n\n// Storage lever fixed by the bake-off (BENCHMARKING.md): int8 at 256 dims is\n// quality-free vs f32-512 when fused. Queries stay f32 at the same dims.\nconst STORE_DIMS = 256;\n// Seed chunks that participate in a `related` scan; see similarNotes for the measurement.\nconst TARGET_CHUNK_CAP = 16;\nconst BATCH = 64;\n\nexport interface EmbedProvider {\n  id: string; // model identity; participates in the cache key, change -> re-embed\n  dims: number;\n  embed(texts: string[]): Promise<Float32Array[]>;\n}\n\ninterface Chunk {\n  startLine: number;\n  endLine: number;\n  text: string;\n}\n\n// Deterministic, so embed time can re-derive text from stored line ranges. Heading-delimited,\n// preamble kept, whole body when no headings; the title/summary prefix mirrors bm25 weighting.\n//\n// Chunks the body, not the raw file, with `offset` shifting line numbers back onto the raw\n// file so a range stays a direct Read range (sections is 1-indexed over raw too). Chunking raw\n// put the frontmatter block in its own leading chunk on every note with a heading, which made\n// `lines` point at YAML and made frontmatter-only notes near-identical to each other. It also\n// disagreed with FTS, which indexes the body alone.\nfunction chunksOf(body: string, search?: { title: string; summary: string }, offset = 0): Chunk[] {\n  const lines = body.split('\\n');\n  const starts: number[] = [];\n  let inFence = false;\n  for (let i = 0; i < lines.length; i++) {\n    if (/^(```|~~~)/.test(lines[i])) {\n      inFence = !inFence;\n      continue;\n    }\n    if (!inFence && /^#{1,6} +/.test(lines[i])) starts.push(i + 1);\n  }\n  const bounds = starts.length === 0 ? [1] : starts[0] > 1 ? [1, ...starts] : starts;\n  const prefix = [search?.title, search?.summary].filter(Boolean).join('\\n');\n  const chunks: Chunk[] = [];\n  bounds.forEach((start, i) => {\n    const end = i + 1 < bounds.length ? bounds[i + 1] - 1 : lines.length;\n    const text = lines\n      .slice(start - 1, end)\n      .join('\\n')\n      .trim();\n    // A body with nothing in it yields no chunks at all, so a frontmatter-only note has no\n    // vectors rather than a vector of its own YAML.\n    if (text.length > 0) chunks.push({ startLine: start + offset, endLine: end + offset, text: prefix ? `${prefix}\\n${text}` : text });\n  });\n  return chunks;\n}\n\nexport const embed: Feature = {\n  name: 'embed',\n  schema(db) {\n    db.exec(`CREATE TABLE IF NOT EXISTS embeddings (\"path\" TEXT, chunk INTEGER, start_line INTEGER, end_line INTEGER, scale REAL, vector BLOB, PRIMARY KEY (\"path\", chunk))`);\n  },\n  extract(raw, body, search) {\n    // Lines the frontmatter occupies, so body line 1 maps back to its raw line number.\n    return chunksOf(body, search, raw.split('\\n').length - body.split('\\n').length);\n  },\n  remove(db, path) {\n    db.prepare('DELETE FROM embeddings WHERE \"path\" = ?').run(path);\n  },\n  // A tree with no embedding model never had extract() run for the doc (db.ts's per-file\n  // filter skips it), so extracted is undefined here -- store nothing, i.e. no rows.\n  store(db, path, extracted) {\n    if (!extracted) return;\n    const insert = db.prepare('INSERT INTO embeddings (\"path\", chunk, start_line, end_line, scale, vector) VALUES (?, ?, ?, ?, NULL, NULL)');\n    (extracted as Chunk[]).forEach((c, idx) => insert.run(path, idx, c.startLine, c.endLine));\n  },\n  enabledForFile(_cfg, file) {\n    return file.embed;\n  },\n};\n\n// --- static type: Model2Vec safetensors + pure-JS tokenizer, model cached in ~/.cache ---\n// Encode convention from model2vec/model.py: no special tokens, drop unk ids, mean-pool,\n// L2-normalize.\n\nconst MODEL_FILES = ['model.safetensors', 'tokenizer.json'];\n// The pair, for messages that name what a local model directory must contain.\nexport const MODEL_FILENAMES = MODEL_FILES.join(' and ');\n\n// A Hugging Face repo id: one slash, HF's charset. Anything else is a path, used as one rather\n// than flattened into a cache key Windows would reject.\nconst HF_MODEL_ID = /^[A-Za-z0-9][\\w.-]*\\/[A-Za-z0-9][\\w.-]*$/;\n\n// Downloadable iff it names a Hugging Face repo; a local path is the caller's to populate.\nexport function isDownloadable(model: string): boolean {\n  return HF_MODEL_ID.test(model);\n}\n\n// Machine-wide, not per-tree: `.sense/` is the index a rebuild throws away, while a 124 MB\n// model is shared by every tree on the machine. Honors XDG_CACHE_HOME where it is set;\n// elsewhere ~/.cache, which is also where Hugging Face's own libraries keep theirs.\nfunction cacheRoot(): string {\n  const xdg = process.env.XDG_CACHE_HOME;\n  return join(xdg && xdg.length > 0 ? xdg : join(homedir(), '.cache'), 'sensemaking', 'models');\n}\n\n// A model is either a local directory the caller pointed at, or the cache `sense download`\n// fills. Nothing here fetches: an absent model degrades search to its other signals rather\n// than pulling 124 MB out of a command that reads like a query.\nexport function modelDir(model: string): string {\n  if (!HF_MODEL_ID.test(model)) return model;\n  return join(cacheRoot(), model.replace(/\\//g, '--'));\n}\n\n// Both files, so an interrupted download reads as absent and the next one resumes it.\nexport function hasModelFiles(model: string): boolean {\n  const dir = modelDir(model);\n  return MODEL_FILES.every((file) => existsSync(join(dir, file)));\n}\n\n// api providers have nothing to download, so they are never \"missing\" here; an unreachable\n// endpoint surfaces as an EMBED_MODEL error at call time instead.\nexport function modelPresent(cfg: Config): boolean {\n  const e = embedConfig(cfg);\n  if (!e) return false;\n  return e.type === 'api' || hasModelFiles(e.model);\n}\n\nfunction fetchToFile(url: string, dest: string): Promise<void> {\n  return fetch(url).then(async (res) => {\n    if (!res.ok) throw new SenseError('EMBED_MODEL', `model download failed: ${url} -> HTTP ${res.status}`);\n    writeFileSync(`${dest}.part`, Buffer.from(await res.arrayBuffer()));\n    renameSync(`${dest}.part`, dest);\n  });\n}\n\n// The only code path that touches the network for weights. `sense download` calls it; no\n// query ever does. Idempotent: a file already on disk is left alone.\nexport async function downloadModel(model: string, onFile?: (file: string, dir: string) => void): Promise<string> {\n  if (!isDownloadable(model)) {\n    throw new SenseError('EMBED_MODEL', `embed.model \"${model}\" is a local path, not a Hugging Face model id, so there is nothing to download; put model.safetensors and tokenizer.json in that directory, or name a model id like \"minishlab/potion-retrieval-32M\"`);\n  }\n  const dir = modelDir(model);\n  mkdirSync(dir, { recursive: true });\n  for (const file of MODEL_FILES) {\n    if (existsSync(join(dir, file))) continue;\n    onFile?.(file, dir);\n    await fetchToFile(`https://huggingface.co/${model}/resolve/main/${file}`, join(dir, file));\n  }\n  return dir;\n}\n\nasync function staticProvider(model: string): Promise<EmbedProvider> {\n  const dir = modelDir(model);\n  for (const file of MODEL_FILES) {\n    if (!existsSync(join(dir, file))) {\n      // A local path the caller controls gets told what is missing where; only a repo id can\n      // be fixed by downloading.\n      const fix = isDownloadable(model) ? 'run `sense download`' : `expected ${MODEL_FILENAMES} in that directory`;\n      throw new SenseError('EMBED_MODEL_MISSING', `embed model ${model} is not available (looked in ${dir}); ${fix}`);\n    }\n  }\n\n  const raw = readFileSync(join(dir, 'model.safetensors'));\n  const headerLen = Number(raw.readBigUInt64LE(0));\n  const header = JSON.parse(raw.subarray(8, 8 + headerLen).toString('utf8')) as Record<string, { dtype: string; shape: number[]; data_offsets: number[] }>;\n  const entry = Object.entries(header).find(([k]) => k !== '__metadata__');\n  if (!entry || entry[1].dtype !== 'F32') throw new SenseError('EMBED_MODEL', `${model}: expected an F32 safetensors matrix`);\n  const spec = entry[1];\n  const dims = spec.shape[1];\n  const dataStart = raw.byteOffset + 8 + headerLen + spec.data_offsets[0];\n  const matrix = dataStart % 4 === 0 ? new Float32Array(raw.buffer, dataStart, spec.shape[0] * dims) : new Float32Array(raw.buffer.slice(dataStart, dataStart + spec.shape[0] * dims * 4));\n\n  const tokenizerJson = JSON.parse(readFileSync(join(dir, 'tokenizer.json'), 'utf8'));\n  // Lazy import: the tokenizer loads only on the semantic path, never at CLI startup.\n  const { Tokenizer } = await import('@huggingface/tokenizers');\n  const tok = new Tokenizer(tokenizerJson, {});\n  const unkId = tokenizerJson.model?.vocab?.[tokenizerJson.model?.unk_token] ?? -1;\n\n  function one(text: string): Float32Array {\n    // The tokenizer yields undefined (not the unk id) for tokens outside the vocab; an\n    // undefined id would index the matrix at NaN and poison the whole mean-pool -- and the\n    // int8 conversion then stores the NaN vector as all zeros, silently. Keep integers only.\n    const ids = (tok.encode(text, { add_special_tokens: false }).ids as number[]).filter((id) => Number.isInteger(id) && id !== unkId);\n    const v = new Float32Array(dims);\n    if (ids.length === 0) return v;\n    for (const id of ids) {\n      const off = id * dims;\n      for (let d = 0; d < dims; d++) v[d] += matrix[off + d];\n    }\n    let norm = 0;\n    for (let d = 0; d < dims; d++) {\n      v[d] /= ids.length;\n      norm += v[d] * v[d];\n    }\n    norm = Math.sqrt(norm) + 1e-32;\n    for (let d = 0; d < dims; d++) v[d] /= norm;\n    return v;\n  }\n\n  return { id: `static:${model}`, dims, embed: async (texts) => texts.map(one) };\n}\n\n// --- api type: one POST against any OpenAI-compatible /embeddings endpoint ---\n\nasync function apiProvider(model: string, url: string | undefined, keyEnv: string | undefined): Promise<EmbedProvider> {\n  if (!url) throw new SenseError('EMBED_MODEL', 'features.embed.type \"api\" requires a url');\n  const base = url.replace(/\\/+$/, '');\n  const headers: Record<string, string> = { 'content-type': 'application/json' };\n  const key = keyEnv ? process.env[keyEnv] : undefined;\n  if (key) headers.authorization = `Bearer ${key}`;\n\n  async function post(texts: string[]): Promise<Float32Array[]> {\n    const res = await fetch(`${base}/embeddings`, { method: 'POST', headers, body: JSON.stringify({ model, input: texts }) });\n    if (!res.ok) throw new SenseError('EMBED_MODEL', `${base}/embeddings -> HTTP ${res.status}`);\n    const body = (await res.json()) as { data: Array<{ embedding: number[] }> };\n    return body.data.map((d) => Float32Array.from(d.embedding));\n  }\n\n  const dims = (await post(['dimension probe']))[0].length;\n  return { id: `api:${base}:${model}`, dims, embed: post };\n}\n\nconst providers = new Map<string, Promise<EmbedProvider>>();\n\nfunction getProvider(cfg: Config): Promise<EmbedProvider> {\n  const e = embedConfig(cfg);\n  if (!e) throw new SenseError('EMBED_DISABLED', 'this tree has no embedding model: add an \"embed\" block naming one to sense.config.json, then run `sense download`');\n  const sig = `${e.type}:${e.model}:${e.url ?? ''}`;\n  let p = providers.get(sig);\n  if (!p) {\n    p = e.type === 'api' ? apiProvider(e.model, e.url, e.key) : staticProvider(e.model);\n    providers.set(sig, p);\n  }\n  return p;\n}\n\n// Slice + re-normalize (Matryoshka); optionally round through int8 storage.\nfunction toStore(full: Float32Array, dims: number, int8: boolean): { v: Float32Array; scale: number } {\n  const v = new Float32Array(dims);\n  let norm = 0;\n  for (let d = 0; d < dims; d++) norm += full[d] * full[d];\n  norm = Math.sqrt(norm) + 1e-32;\n  for (let d = 0; d < dims; d++) v[d] = full[d] / norm;\n  if (!int8) return { v, scale: 1 };\n  let max = 0;\n  for (let d = 0; d < dims; d++) max = Math.max(max, Math.abs(v[d]));\n  return { v, scale: max / 127 || 1 };\n}\n\n// Embed rows whose vector is NULL, re-deriving chunk text from the files through the\n// same parse + chunker that stored the rows.\nexport async function embedPending(db: DatabaseSync, cfg: Config, baseDir: string): Promise<void> {\n  const provider = await getProvider(cfg); // throws EMBED_DISABLED before touching the table\n  const dirty = db.prepare('SELECT \"path\", chunk FROM embeddings WHERE vector IS NULL ORDER BY \"path\", chunk').all() as Array<{ path: string; chunk: number }>;\n  if (dirty.length === 0) return;\n  const storeDims = Math.min(STORE_DIMS, provider.dims);\n\n  const byPath = new Map<string, number[]>();\n  for (const row of dirty) {\n    const list = byPath.get(row.path) ?? [];\n    list.push(row.chunk);\n    byPath.set(row.path, list);\n  }\n\n  const jobs: Array<{ path: string; chunk: number; text: string }> = [];\n  for (const [path, chunkIdxs] of byPath) {\n    let chunks: Chunk[];\n    try {\n      // presets/embed are irrelevant here -- re-deriving chunk text for a doc that already\n      // has embeddings rows means the tree had an embedding model at reconcile time.\n      chunks = parseFile({ relPath: path, absPath: join(baseDir, path), mtimeMs: 0, size: 0, presets: [], embed: true }, [embed]).doc.extracted.embed as Chunk[];\n    } catch {\n      continue; // vanished since reconcile; the next reconcile removes its rows\n    }\n    for (const idx of chunkIdxs) if (chunks[idx]) jobs.push({ path, chunk: idx, text: chunks[idx].text });\n  }\n\n  const update = db.prepare('UPDATE embeddings SET scale = ?, vector = ? WHERE \"path\" = ? AND chunk = ?');\n  // The lazy build is the one long silence a first search hits (measured 23s at\n  // 26k notes); progress makes it distinguishable from a hang.\n  const report = progress('embedding chunks', jobs.length);\n  for (let i = 0; i < jobs.length; i += BATCH) {\n    const batch = jobs.slice(i, i + BATCH);\n    const vectors = await provider.embed(batch.map((j) => j.text));\n    db.exec('BEGIN');\n    try {\n      batch.forEach((job, j) => {\n        const { v, scale } = toStore(vectors[j], storeDims, true);\n        const q = new Int8Array(storeDims);\n        for (let d = 0; d < storeDims; d++) q[d] = Math.round(v[d] / scale);\n        update.run(scale, Buffer.from(q.buffer), job.path, job.chunk);\n      });\n      db.exec('COMMIT');\n    } catch (err) {\n      db.exec('ROLLBACK');\n      throw err;\n    }\n    report.tick(Math.min(i + BATCH, jobs.length));\n  }\n  report.finish();\n}\n\n// Dequantised int8 dot products land a little either side of a true cosine, so an identical\n// pair prints 1.001 and undermines a column whose whole job is being a bounded number.\nfunction asCosine(score: number): number {\n  return Math.round(Math.min(1, Math.max(-1, score)) * 1000) / 1000;\n}\n\n// Best chunk per file by cosine, its line range riding along; FTS5 operators are stripped as\n// lexical syntax. Similarity comes back because the fused score cannot express match quality,\n// and nearest-neighbour search always returns a neighbour however far away.\nexport async function semanticCandidates(db: DatabaseSync, cfg: Config, terms: string, fetch: number): Promise<Array<{ path: string; lines: string; similarity: number }>> {\n  const baseDir = (cfg as Partial<ResolvedConfig>).baseDir;\n  if (!baseDir) throw new SenseError('EMBED_MODEL', 'semantic expansion needs a config with baseDir (use loadConfig/open)');\n  await embedPending(db, cfg, baseDir);\n\n  const provider = await getProvider(cfg);\n  const storeDims = Math.min(STORE_DIMS, provider.dims);\n  const text = (terms.match(/[\\p{L}\\p{N}]+/gu) ?? []).filter((t) => !['AND', 'OR', 'NOT', 'NEAR'].includes(t)).join(' ');\n  const { v: qv } = toStore((await provider.embed([text]))[0], storeDims, false);\n\n  const rows = db.prepare('SELECT \"path\", start_line, end_line, scale, vector FROM embeddings WHERE vector IS NOT NULL').all() as Array<{\n    path: string;\n    start_line: number;\n    end_line: number;\n    scale: number;\n    vector: Uint8Array;\n  }>;\n\n  const best = new Map<string, { score: number; lines: string }>();\n  for (const row of rows) {\n    const q = new Int8Array(row.vector.buffer, row.vector.byteOffset, Math.min(storeDims, row.vector.byteLength));\n    let dot = 0;\n    for (let d = 0; d < q.length; d++) dot += q[d] * qv[d];\n    const score = dot * row.scale;\n    const existing = best.get(row.path);\n    if (!existing || score > existing.score) best.set(row.path, { score, lines: `L${row.start_line}-${row.end_line}` });\n  }\n  return [...best.entries()]\n    .sort((a, b) => b[1].score - a[1].score)\n    .slice(0, fetch)\n    .map(([path, b]) => ({ path, lines: b.lines, similarity: asCosine(b.score) }));\n}\n\n// Whether a note has any chunk with a vector. Distinguishes \"nothing is near this note\" from\n// \"this note has no text\", which look the same in an empty result.\nexport function hasEmbedding(db: DatabaseSync, path: string): boolean {\n  const row = db.prepare('SELECT 1 AS ok FROM embeddings WHERE \"path\" = ? AND vector IS NOT NULL LIMIT 1').get(path) as { ok: number } | undefined;\n  return row !== undefined;\n}\n\n// Note-to-note similarity is the max cosine over (target chunk, other chunk) pairs, one linear\n// scan of stored vectors. Reads only what is stored, so it stays sync.\nexport function similarNotes(db: DatabaseSync, _cfg: Config, path: string, opts: { exclude: Set<string>; allowed?: Set<string>; k: number }): Array<{ path: string; similarity: number }> {\n  // Cost is target_chunks x stored_chunks, so a heading-dense seed multiplies a full-corpus\n  // scan (12.7s at 201 chunks/note). Sample evenly, so late sections still get a vote.\n  const targetRows = db.prepare('SELECT scale, vector FROM embeddings WHERE \"path\" = ? AND vector IS NOT NULL ORDER BY chunk').all(path) as Array<{ scale: number; vector: Uint8Array }>;\n  if (targetRows.length === 0) return [];\n  const step = Math.max(1, Math.ceil(targetRows.length / TARGET_CHUNK_CAP));\n  const target = targetRows.filter((_, i) => i % step === 0).map((row) => ({ v: new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength), scale: row.scale }));\n\n  const rows = db.prepare('SELECT \"path\", scale, vector FROM embeddings WHERE vector IS NOT NULL').all() as Array<{ path: string; scale: number; vector: Uint8Array }>;\n  const best = new Map<string, number>();\n  for (const row of rows) {\n    if (row.path === path || opts.exclude.has(row.path) || (opts.allowed && !opts.allowed.has(row.path))) continue;\n    const other = new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength);\n    for (const t of target) {\n      let dot = 0;\n      const len = Math.min(t.v.length, other.length);\n      for (let d = 0; d < len; d++) dot += t.v[d] * other[d];\n      const score = dot * t.scale * row.scale;\n      const existing = best.get(row.path);\n      if (existing === undefined || score > existing) best.set(row.path, score);\n    }\n  }\n\n  return [...best.entries()]\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, opts.k)\n    .map(([p, score]) => ({ path: p, similarity: asCosine(score) }));\n}\n"],"names":["existsSync","mkdirSync","readFileSync","renameSync","writeFileSync","homedir","join","embedConfig","SenseError","progress","parseFile","STORE_DIMS","TARGET_CHUNK_CAP","BATCH","chunksOf","body","search","offset","lines","split","starts","inFence","i","length","test","push","bounds","prefix","title","summary","filter","Boolean","chunks","forEach","start","end","text","slice","trim","startLine","endLine","embed","name","schema","db","exec","extract","raw","remove","path","prepare","run","store","extracted","insert","c","idx","enabledForFile","_cfg","file","MODEL_FILES","MODEL_FILENAMES","HF_MODEL_ID","isDownloadable","model","cacheRoot","xdg","process","env","XDG_CACHE_HOME","modelDir","replace","hasModelFiles","dir","every","modelPresent","cfg","e","type","fetchToFile","url","dest","fetch","then","res","ok","status","Buffer","from","arrayBuffer","downloadModel","onFile","recursive","staticProvider","tokenizerJson","fix","headerLen","Number","readBigUInt64LE","header","JSON","parse","subarray","toString","entry","Object","entries","find","k","dtype","spec","dims","shape","dataStart","byteOffset","data_offsets","matrix","Float32Array","buffer","Tokenizer","tok","unkId","vocab","unk_token","one","ids","encode","add_special_tokens","id","isInteger","v","off","d","norm","Math","sqrt","texts","map","apiProvider","keyEnv","base","headers","key","undefined","authorization","post","method","stringify","input","json","data","embedding","providers","Map","getProvider","sig","p","get","set","toStore","full","int8","scale","max","abs","embedPending","baseDir","provider","dirty","all","storeDims","min","byPath","row","list","chunk","jobs","chunkIdxs","relPath","absPath","mtimeMs","size","presets","doc","update","report","batch","vectors","j","job","q","Int8Array","round","err","tick","finish","asCosine","score","semanticCandidates","terms","match","t","includes","qv","rows","best","vector","byteLength","dot","existing","start_line","end_line","sort","a","b","similarity","hasEmbedding","similarNotes","opts","targetRows","step","ceil","target","_","exclude","has","allowed","other","len"],"mappings":"AAAA,SAASA,UAAU,EAAEC,SAAS,EAAEC,YAAY,EAAEC,UAAU,EAAEC,aAAa,QAAQ,UAAU;AACzF,SAASC,OAAO,QAAQ,UAAU;AAClC,SAASC,IAAI,QAAQ,YAAY;AAGjC,SAASC,WAAW,QAAQ,eAAe;AAC3C,SAASC,UAAU,QAAQ,eAAe;AAC1C,SAASC,QAAQ,QAAQ,iBAAiB;AAC1C,SAASC,SAAS,QAAQ,aAAa;AAGvC,8FAA8F;AAC9F,gGAAgG;AAEhG,6EAA6E;AAC7E,yEAAyE;AACzE,MAAMC,aAAa;AACnB,0FAA0F;AAC1F,MAAMC,mBAAmB;AACzB,MAAMC,QAAQ;AAcd,8FAA8F;AAC9F,+FAA+F;AAC/F,EAAE;AACF,2FAA2F;AAC3F,+FAA+F;AAC/F,8FAA8F;AAC9F,8FAA8F;AAC9F,oDAAoD;AACpD,SAASC,SAASC,IAAY,EAAEC,MAA2C,EAAEC,SAAS,CAAC;IACrF,MAAMC,QAAQH,KAAKI,KAAK,CAAC;IACzB,MAAMC,SAAmB,EAAE;IAC3B,IAAIC,UAAU;IACd,IAAK,IAAIC,IAAI,GAAGA,IAAIJ,MAAMK,MAAM,EAAED,IAAK;QACrC,IAAI,aAAaE,IAAI,CAACN,KAAK,CAACI,EAAE,GAAG;YAC/BD,UAAU,CAACA;YACX;QACF;QACA,IAAI,CAACA,WAAW,YAAYG,IAAI,CAACN,KAAK,CAACI,EAAE,GAAGF,OAAOK,IAAI,CAACH,IAAI;IAC9D;IACA,MAAMI,SAASN,OAAOG,MAAM,KAAK,IAAI;QAAC;KAAE,GAAGH,MAAM,CAAC,EAAE,GAAG,IAAI;QAAC;WAAMA;KAAO,GAAGA;IAC5E,MAAMO,SAAS;QAACX,mBAAAA,6BAAAA,OAAQY,KAAK;QAAEZ,mBAAAA,6BAAAA,OAAQa,OAAO;KAAC,CAACC,MAAM,CAACC,SAASzB,IAAI,CAAC;IACrE,MAAM0B,SAAkB,EAAE;IAC1BN,OAAOO,OAAO,CAAC,CAACC,OAAOZ;QACrB,MAAMa,MAAMb,IAAI,IAAII,OAAOH,MAAM,GAAGG,MAAM,CAACJ,IAAI,EAAE,GAAG,IAAIJ,MAAMK,MAAM;QACpE,MAAMa,OAAOlB,MACVmB,KAAK,CAACH,QAAQ,GAAGC,KACjB7B,IAAI,CAAC,MACLgC,IAAI;QACP,uFAAuF;QACvF,gDAAgD;QAChD,IAAIF,KAAKb,MAAM,GAAG,GAAGS,OAAOP,IAAI,CAAC;YAAEc,WAAWL,QAAQjB;YAAQuB,SAASL,MAAMlB;YAAQmB,MAAMT,SAAS,GAAGA,OAAO,EAAE,EAAES,MAAM,GAAGA;QAAK;IAClI;IACA,OAAOJ;AACT;AAEA,OAAO,MAAMS,QAAiB;IAC5BC,MAAM;IACNC,QAAOC,EAAE;QACPA,GAAGC,IAAI,CAAC,CAAC,8JAA8J,CAAC;IAC1K;IACAC,SAAQC,GAAG,EAAEhC,IAAI,EAAEC,MAAM;QACvB,mFAAmF;QACnF,OAAOF,SAASC,MAAMC,QAAQ+B,IAAI5B,KAAK,CAAC,MAAMI,MAAM,GAAGR,KAAKI,KAAK,CAAC,MAAMI,MAAM;IAChF;IACAyB,QAAOJ,EAAE,EAAEK,IAAI;QACbL,GAAGM,OAAO,CAAC,2CAA2CC,GAAG,CAACF;IAC5D;IACA,uFAAuF;IACvF,mFAAmF;IACnFG,OAAMR,EAAE,EAAEK,IAAI,EAAEI,SAAS;QACvB,IAAI,CAACA,WAAW;QAChB,MAAMC,SAASV,GAAGM,OAAO,CAAC;QACzBG,UAAsBpB,OAAO,CAAC,CAACsB,GAAGC,MAAQF,OAAOH,GAAG,CAACF,MAAMO,KAAKD,EAAEhB,SAAS,EAAEgB,EAAEf,OAAO;IACzF;IACAiB,gBAAeC,IAAI,EAAEC,IAAI;QACvB,OAAOA,KAAKlB,KAAK;IACnB;AACF,EAAE;AAEF,2FAA2F;AAC3F,yFAAyF;AACzF,gBAAgB;AAEhB,MAAMmB,cAAc;IAAC;IAAqB;CAAiB;AAC3D,8EAA8E;AAC9E,OAAO,MAAMC,kBAAkBD,YAAYtD,IAAI,CAAC,SAAS;AAEzD,+FAA+F;AAC/F,wDAAwD;AACxD,MAAMwD,cAAc;AAEpB,2FAA2F;AAC3F,OAAO,SAASC,eAAeC,KAAa;IAC1C,OAAOF,YAAYtC,IAAI,CAACwC;AAC1B;AAEA,2FAA2F;AAC3F,uFAAuF;AACvF,oFAAoF;AACpF,SAASC;IACP,MAAMC,MAAMC,QAAQC,GAAG,CAACC,cAAc;IACtC,OAAO/D,KAAK4D,OAAOA,IAAI3C,MAAM,GAAG,IAAI2C,MAAM5D,KAAKD,WAAW,WAAW,eAAe;AACtF;AAEA,2FAA2F;AAC3F,2FAA2F;AAC3F,gEAAgE;AAChE,OAAO,SAASiE,SAASN,KAAa;IACpC,IAAI,CAACF,YAAYtC,IAAI,CAACwC,QAAQ,OAAOA;IACrC,OAAO1D,KAAK2D,aAAaD,MAAMO,OAAO,CAAC,OAAO;AAChD;AAEA,sFAAsF;AACtF,OAAO,SAASC,cAAcR,KAAa;IACzC,MAAMS,MAAMH,SAASN;IACrB,OAAOJ,YAAYc,KAAK,CAAC,CAACf,OAAS3D,WAAWM,KAAKmE,KAAKd;AAC1D;AAEA,2FAA2F;AAC3F,kEAAkE;AAClE,OAAO,SAASgB,aAAaC,GAAW;IACtC,MAAMC,IAAItE,YAAYqE;IACtB,IAAI,CAACC,GAAG,OAAO;IACf,OAAOA,EAAEC,IAAI,KAAK,SAASN,cAAcK,EAAEb,KAAK;AAClD;AAEA,SAASe,YAAYC,GAAW,EAAEC,IAAY;IAC5C,OAAOC,MAAMF,KAAKG,IAAI,CAAC,OAAOC;QAC5B,IAAI,CAACA,IAAIC,EAAE,EAAE,MAAM,IAAI7E,WAAW,eAAe,CAAC,uBAAuB,EAAEwE,IAAI,SAAS,EAAEI,IAAIE,MAAM,EAAE;QACtGlF,cAAc,GAAG6E,KAAK,KAAK,CAAC,EAAEM,OAAOC,IAAI,CAAC,MAAMJ,IAAIK,WAAW;QAC/DtF,WAAW,GAAG8E,KAAK,KAAK,CAAC,EAAEA;IAC7B;AACF;AAEA,yFAAyF;AACzF,qEAAqE;AACrE,OAAO,eAAeS,cAAc1B,KAAa,EAAE2B,MAA4C;IAC7F,IAAI,CAAC5B,eAAeC,QAAQ;QAC1B,MAAM,IAAIxD,WAAW,eAAe,CAAC,aAAa,EAAEwD,MAAM,qMAAqM,CAAC;IAClQ;IACA,MAAMS,MAAMH,SAASN;IACrB/D,UAAUwE,KAAK;QAAEmB,WAAW;IAAK;IACjC,KAAK,MAAMjC,QAAQC,YAAa;QAC9B,IAAI5D,WAAWM,KAAKmE,KAAKd,QAAQ;QACjCgC,mBAAAA,6BAAAA,OAAShC,MAAMc;QACf,MAAMM,YAAY,CAAC,uBAAuB,EAAEf,MAAM,cAAc,EAAEL,MAAM,EAAErD,KAAKmE,KAAKd;IACtF;IACA,OAAOc;AACT;AAEA,eAAeoB,eAAe7B,KAAa;;QAyBE8B,sBAA7BA,4BAAAA;IAxBd,MAAMrB,MAAMH,SAASN;IACrB,KAAK,MAAML,QAAQC,YAAa;QAC9B,IAAI,CAAC5D,WAAWM,KAAKmE,KAAKd,QAAQ;YAChC,uFAAuF;YACvF,2BAA2B;YAC3B,MAAMoC,MAAMhC,eAAeC,SAAS,yBAAyB,CAAC,SAAS,EAAEH,gBAAgB,kBAAkB,CAAC;YAC5G,MAAM,IAAIrD,WAAW,uBAAuB,CAAC,YAAY,EAAEwD,MAAM,6BAA6B,EAAES,IAAI,GAAG,EAAEsB,KAAK;QAChH;IACF;IAEA,MAAMhD,MAAM7C,aAAaI,KAAKmE,KAAK;IACnC,MAAMuB,YAAYC,OAAOlD,IAAImD,eAAe,CAAC;IAC7C,MAAMC,SAASC,KAAKC,KAAK,CAACtD,IAAIuD,QAAQ,CAAC,GAAG,IAAIN,WAAWO,QAAQ,CAAC;IAClE,MAAMC,QAAQC,OAAOC,OAAO,CAACP,QAAQQ,IAAI,CAAC,CAAC,CAACC,EAAE,GAAKA,MAAM;IACzD,IAAI,CAACJ,SAASA,KAAK,CAAC,EAAE,CAACK,KAAK,KAAK,OAAO,MAAM,IAAIrG,WAAW,eAAe,GAAGwD,MAAM,oCAAoC,CAAC;IAC1H,MAAM8C,OAAON,KAAK,CAAC,EAAE;IACrB,MAAMO,OAAOD,KAAKE,KAAK,CAAC,EAAE;IAC1B,MAAMC,YAAYlE,IAAImE,UAAU,GAAG,IAAIlB,YAAYc,KAAKK,YAAY,CAAC,EAAE;IACvE,MAAMC,SAASH,YAAY,MAAM,IAAI,IAAII,aAAatE,IAAIuE,MAAM,EAAEL,WAAWH,KAAKE,KAAK,CAAC,EAAE,GAAGD,QAAQ,IAAIM,aAAatE,IAAIuE,MAAM,CAACjF,KAAK,CAAC4E,WAAWA,YAAYH,KAAKE,KAAK,CAAC,EAAE,GAAGD,OAAO;IAErL,MAAMjB,gBAAgBM,KAAKC,KAAK,CAACnG,aAAaI,KAAKmE,KAAK,mBAAmB;IAC3E,oFAAoF;IACpF,MAAM,EAAE8C,SAAS,EAAE,GAAG,MAAM,MAAM,CAAC;IACnC,MAAMC,MAAM,IAAID,UAAUzB,eAAe,CAAC;IAC1C,MAAM2B,iBAAQ3B,wBAAAA,cAAc9B,KAAK,cAAnB8B,6CAAAA,6BAAAA,sBAAqB4B,KAAK,cAA1B5B,iDAAAA,0BAA4B,EAACA,uBAAAA,cAAc9B,KAAK,cAAnB8B,2CAAAA,qBAAqB6B,SAAS,CAAC,uCAAI,CAAC;IAE/E,SAASC,IAAIxF,IAAY;QACvB,mFAAmF;QACnF,uFAAuF;QACvF,yFAAyF;QACzF,MAAMyF,MAAM,AAACL,IAAIM,MAAM,CAAC1F,MAAM;YAAE2F,oBAAoB;QAAM,GAAGF,GAAG,CAAc/F,MAAM,CAAC,CAACkG,KAAO/B,OAAOgC,SAAS,CAACD,OAAOA,OAAOP;QAC5H,MAAMS,IAAI,IAAIb,aAAaN;QAC3B,IAAIc,IAAItG,MAAM,KAAK,GAAG,OAAO2G;QAC7B,KAAK,MAAMF,MAAMH,IAAK;YACpB,MAAMM,MAAMH,KAAKjB;YACjB,IAAK,IAAIqB,IAAI,GAAGA,IAAIrB,MAAMqB,IAAKF,CAAC,CAACE,EAAE,IAAIhB,MAAM,CAACe,MAAMC,EAAE;QACxD;QACA,IAAIC,OAAO;QACX,IAAK,IAAID,IAAI,GAAGA,IAAIrB,MAAMqB,IAAK;YAC7BF,CAAC,CAACE,EAAE,IAAIP,IAAItG,MAAM;YAClB8G,QAAQH,CAAC,CAACE,EAAE,GAAGF,CAAC,CAACE,EAAE;QACrB;QACAC,OAAOC,KAAKC,IAAI,CAACF,QAAQ;QACzB,IAAK,IAAID,IAAI,GAAGA,IAAIrB,MAAMqB,IAAKF,CAAC,CAACE,EAAE,IAAIC;QACvC,OAAOH;IACT;IAEA,OAAO;QAAEF,IAAI,CAAC,OAAO,EAAEhE,OAAO;QAAE+C;QAAMtE,OAAO,OAAO+F,QAAUA,MAAMC,GAAG,CAACb;IAAK;AAC/E;AAEA,gFAAgF;AAEhF,eAAec,YAAY1E,KAAa,EAAEgB,GAAuB,EAAE2D,MAA0B;IAC3F,IAAI,CAAC3D,KAAK,MAAM,IAAIxE,WAAW,eAAe;IAC9C,MAAMoI,OAAO5D,IAAIT,OAAO,CAAC,QAAQ;IACjC,MAAMsE,UAAkC;QAAE,gBAAgB;IAAmB;IAC7E,MAAMC,MAAMH,SAASxE,QAAQC,GAAG,CAACuE,OAAO,GAAGI;IAC3C,IAAID,KAAKD,QAAQG,aAAa,GAAG,CAAC,OAAO,EAAEF,KAAK;IAEhD,eAAeG,KAAKT,KAAe;QACjC,MAAMpD,MAAM,MAAMF,MAAM,GAAG0D,KAAK,WAAW,CAAC,EAAE;YAAEM,QAAQ;YAAQL;YAAS9H,MAAMqF,KAAK+C,SAAS,CAAC;gBAAEnF;gBAAOoF,OAAOZ;YAAM;QAAG;QACvH,IAAI,CAACpD,IAAIC,EAAE,EAAE,MAAM,IAAI7E,WAAW,eAAe,GAAGoI,KAAK,oBAAoB,EAAExD,IAAIE,MAAM,EAAE;QAC3F,MAAMvE,OAAQ,MAAMqE,IAAIiE,IAAI;QAC5B,OAAOtI,KAAKuI,IAAI,CAACb,GAAG,CAAC,CAACL,IAAMf,aAAa7B,IAAI,CAAC4C,EAAEmB,SAAS;IAC3D;IAEA,MAAMxC,OAAO,AAAC,CAAA,MAAMkC,KAAK;QAAC;KAAkB,CAAA,CAAE,CAAC,EAAE,CAAC1H,MAAM;IACxD,OAAO;QAAEyG,IAAI,CAAC,IAAI,EAAEY,KAAK,CAAC,EAAE5E,OAAO;QAAE+C;QAAMtE,OAAOwG;IAAK;AACzD;AAEA,MAAMO,YAAY,IAAIC;AAEtB,SAASC,YAAY9E,GAAW;QAGMC;IAFpC,MAAMA,IAAItE,YAAYqE;IACtB,IAAI,CAACC,GAAG,MAAM,IAAIrE,WAAW,kBAAkB;IAC/C,MAAMmJ,MAAM,GAAG9E,EAAEC,IAAI,CAAC,CAAC,EAAED,EAAEb,KAAK,CAAC,CAAC,GAAEa,SAAAA,EAAEG,GAAG,cAALH,oBAAAA,SAAS,IAAI;IACjD,IAAI+E,IAAIJ,UAAUK,GAAG,CAACF;IACtB,IAAI,CAACC,GAAG;QACNA,IAAI/E,EAAEC,IAAI,KAAK,QAAQ4D,YAAY7D,EAAEb,KAAK,EAAEa,EAAEG,GAAG,EAAEH,EAAEiE,GAAG,IAAIjD,eAAehB,EAAEb,KAAK;QAClFwF,UAAUM,GAAG,CAACH,KAAKC;IACrB;IACA,OAAOA;AACT;AAEA,4EAA4E;AAC5E,SAASG,QAAQC,IAAkB,EAAEjD,IAAY,EAAEkD,IAAa;IAC9D,MAAM/B,IAAI,IAAIb,aAAaN;IAC3B,IAAIsB,OAAO;IACX,IAAK,IAAID,IAAI,GAAGA,IAAIrB,MAAMqB,IAAKC,QAAQ2B,IAAI,CAAC5B,EAAE,GAAG4B,IAAI,CAAC5B,EAAE;IACxDC,OAAOC,KAAKC,IAAI,CAACF,QAAQ;IACzB,IAAK,IAAID,IAAI,GAAGA,IAAIrB,MAAMqB,IAAKF,CAAC,CAACE,EAAE,GAAG4B,IAAI,CAAC5B,EAAE,GAAGC;IAChD,IAAI,CAAC4B,MAAM,OAAO;QAAE/B;QAAGgC,OAAO;IAAE;IAChC,IAAIC,MAAM;IACV,IAAK,IAAI/B,IAAI,GAAGA,IAAIrB,MAAMqB,IAAK+B,MAAM7B,KAAK6B,GAAG,CAACA,KAAK7B,KAAK8B,GAAG,CAAClC,CAAC,CAACE,EAAE;IAChE,OAAO;QAAEF;QAAGgC,OAAOC,MAAM,OAAO;IAAE;AACpC;AAEA,qFAAqF;AACrF,6CAA6C;AAC7C,OAAO,eAAeE,aAAazH,EAAgB,EAAEgC,GAAW,EAAE0F,OAAe;IAC/E,MAAMC,WAAW,MAAMb,YAAY9E,MAAM,kDAAkD;IAC3F,MAAM4F,QAAQ5H,GAAGM,OAAO,CAAC,oFAAoFuH,GAAG;IAChH,IAAID,MAAMjJ,MAAM,KAAK,GAAG;IACxB,MAAMmJ,YAAYpC,KAAKqC,GAAG,CAAChK,YAAY4J,SAASxD,IAAI;IAEpD,MAAM6D,SAAS,IAAInB;IACnB,KAAK,MAAMoB,OAAOL,MAAO;YACVI;QAAb,MAAME,QAAOF,cAAAA,OAAOf,GAAG,CAACgB,IAAI5H,IAAI,eAAnB2H,yBAAAA,cAAwB,EAAE;QACvCE,KAAKrJ,IAAI,CAACoJ,IAAIE,KAAK;QACnBH,OAAOd,GAAG,CAACe,IAAI5H,IAAI,EAAE6H;IACvB;IAEA,MAAME,OAA6D,EAAE;IACrE,KAAK,MAAM,CAAC/H,MAAMgI,UAAU,IAAIL,OAAQ;QACtC,IAAI5I;QACJ,IAAI;YACF,qFAAqF;YACrF,+EAA+E;YAC/EA,SAAStB,UAAU;gBAAEwK,SAASjI;gBAAMkI,SAAS7K,KAAKgK,SAASrH;gBAAOmI,SAAS;gBAAGC,MAAM;gBAAGC,SAAS,EAAE;gBAAE7I,OAAO;YAAK,GAAG;gBAACA;aAAM,EAAE8I,GAAG,CAAClI,SAAS,CAACZ,KAAK;QACjJ,EAAE,OAAM;YACN,UAAU,gEAAgE;QAC5E;QACA,KAAK,MAAMe,OAAOyH,UAAW,IAAIjJ,MAAM,CAACwB,IAAI,EAAEwH,KAAKvJ,IAAI,CAAC;YAAEwB;YAAM8H,OAAOvH;YAAKpB,MAAMJ,MAAM,CAACwB,IAAI,CAACpB,IAAI;QAAC;IACrG;IAEA,MAAMoJ,SAAS5I,GAAGM,OAAO,CAAC;IAC1B,8EAA8E;IAC9E,6DAA6D;IAC7D,MAAMuI,SAAShL,SAAS,oBAAoBuK,KAAKzJ,MAAM;IACvD,IAAK,IAAID,IAAI,GAAGA,IAAI0J,KAAKzJ,MAAM,EAAED,KAAKT,MAAO;QAC3C,MAAM6K,QAAQV,KAAK3I,KAAK,CAACf,GAAGA,IAAIT;QAChC,MAAM8K,UAAU,MAAMpB,SAAS9H,KAAK,CAACiJ,MAAMjD,GAAG,CAAC,CAACmD,IAAMA,EAAExJ,IAAI;QAC5DQ,GAAGC,IAAI,CAAC;QACR,IAAI;YACF6I,MAAMzJ,OAAO,CAAC,CAAC4J,KAAKD;gBAClB,MAAM,EAAE1D,CAAC,EAAEgC,KAAK,EAAE,GAAGH,QAAQ4B,OAAO,CAACC,EAAE,EAAElB,WAAW;gBACpD,MAAMoB,IAAI,IAAIC,UAAUrB;gBACxB,IAAK,IAAItC,IAAI,GAAGA,IAAIsC,WAAWtC,IAAK0D,CAAC,CAAC1D,EAAE,GAAGE,KAAK0D,KAAK,CAAC9D,CAAC,CAACE,EAAE,GAAG8B;gBAC7DsB,OAAOrI,GAAG,CAAC+G,OAAO3E,OAAOC,IAAI,CAACsG,EAAExE,MAAM,GAAGuE,IAAI5I,IAAI,EAAE4I,IAAId,KAAK;YAC9D;YACAnI,GAAGC,IAAI,CAAC;QACV,EAAE,OAAOoJ,KAAK;YACZrJ,GAAGC,IAAI,CAAC;YACR,MAAMoJ;QACR;QACAR,OAAOS,IAAI,CAAC5D,KAAKqC,GAAG,CAACrJ,IAAIT,OAAOmK,KAAKzJ,MAAM;IAC7C;IACAkK,OAAOU,MAAM;AACf;AAEA,4FAA4F;AAC5F,uFAAuF;AACvF,SAASC,SAASC,KAAa;IAC7B,OAAO/D,KAAK0D,KAAK,CAAC1D,KAAKqC,GAAG,CAAC,GAAGrC,KAAK6B,GAAG,CAAC,CAAC,GAAGkC,UAAU,QAAQ;AAC/D;AAEA,6FAA6F;AAC7F,8FAA8F;AAC9F,4EAA4E;AAC5E,OAAO,eAAeC,mBAAmB1J,EAAgB,EAAEgC,GAAW,EAAE2H,KAAa,EAAErH,MAAa;QAOpFqH;IANd,MAAMjC,UAAU,AAAC1F,IAAgC0F,OAAO;IACxD,IAAI,CAACA,SAAS,MAAM,IAAI9J,WAAW,eAAe;IAClD,MAAM6J,aAAazH,IAAIgC,KAAK0F;IAE5B,MAAMC,WAAW,MAAMb,YAAY9E;IACnC,MAAM8F,YAAYpC,KAAKqC,GAAG,CAAChK,YAAY4J,SAASxD,IAAI;IACpD,MAAM3E,OAAO,EAACmK,eAAAA,MAAMC,KAAK,CAAC,gCAAZD,0BAAAA,eAAkC,EAAE,EAAEzK,MAAM,CAAC,CAAC2K,IAAM,CAAC;YAAC;YAAO;YAAM;YAAO;SAAO,CAACC,QAAQ,CAACD,IAAInM,IAAI,CAAC;IAClH,MAAM,EAAE4H,GAAGyE,EAAE,EAAE,GAAG5C,QAAQ,AAAC,CAAA,MAAMQ,SAAS9H,KAAK,CAAC;QAACL;KAAK,CAAA,CAAE,CAAC,EAAE,EAAEsI,WAAW;IAExE,MAAMkC,OAAOhK,GAAGM,OAAO,CAAC,+FAA+FuH,GAAG;IAQ1H,MAAMoC,OAAO,IAAIpD;IACjB,KAAK,MAAMoB,OAAO+B,KAAM;QACtB,MAAMd,IAAI,IAAIC,UAAUlB,IAAIiC,MAAM,CAACxF,MAAM,EAAEuD,IAAIiC,MAAM,CAAC5F,UAAU,EAAEoB,KAAKqC,GAAG,CAACD,WAAWG,IAAIiC,MAAM,CAACC,UAAU;QAC3G,IAAIC,MAAM;QACV,IAAK,IAAI5E,IAAI,GAAGA,IAAI0D,EAAEvK,MAAM,EAAE6G,IAAK4E,OAAOlB,CAAC,CAAC1D,EAAE,GAAGuE,EAAE,CAACvE,EAAE;QACtD,MAAMiE,QAAQW,MAAMnC,IAAIX,KAAK;QAC7B,MAAM+C,WAAWJ,KAAKhD,GAAG,CAACgB,IAAI5H,IAAI;QAClC,IAAI,CAACgK,YAAYZ,QAAQY,SAASZ,KAAK,EAAEQ,KAAK/C,GAAG,CAACe,IAAI5H,IAAI,EAAE;YAAEoJ;YAAOnL,OAAO,CAAC,CAAC,EAAE2J,IAAIqC,UAAU,CAAC,CAAC,EAAErC,IAAIsC,QAAQ,EAAE;QAAC;IACnH;IACA,OAAO;WAAIN,KAAKnG,OAAO;KAAG,CACvB0G,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,CAACjB,KAAK,GAAGgB,CAAC,CAAC,EAAE,CAAChB,KAAK,EACtChK,KAAK,CAAC,GAAG6C,QACTuD,GAAG,CAAC,CAAC,CAACxF,MAAMqK,EAAE,GAAM,CAAA;YAAErK;YAAM/B,OAAOoM,EAAEpM,KAAK;YAAEqM,YAAYnB,SAASkB,EAAEjB,KAAK;QAAE,CAAA;AAC/E;AAEA,6FAA6F;AAC7F,mEAAmE;AACnE,OAAO,SAASmB,aAAa5K,EAAgB,EAAEK,IAAY;IACzD,MAAM4H,MAAMjI,GAAGM,OAAO,CAAC,kFAAkF2G,GAAG,CAAC5G;IAC7G,OAAO4H,QAAQ9B;AACjB;AAEA,+FAA+F;AAC/F,uEAAuE;AACvE,OAAO,SAAS0E,aAAa7K,EAAgB,EAAEc,IAAY,EAAET,IAAY,EAAEyK,IAAgE;IACzI,0FAA0F;IAC1F,qFAAqF;IACrF,MAAMC,aAAa/K,GAAGM,OAAO,CAAC,+FAA+FuH,GAAG,CAACxH;IACjI,IAAI0K,WAAWpM,MAAM,KAAK,GAAG,OAAO,EAAE;IACtC,MAAMqM,OAAOtF,KAAK6B,GAAG,CAAC,GAAG7B,KAAKuF,IAAI,CAACF,WAAWpM,MAAM,GAAGX;IACvD,MAAMkN,SAASH,WAAW7L,MAAM,CAAC,CAACiM,GAAGzM,IAAMA,IAAIsM,SAAS,GAAGnF,GAAG,CAAC,CAACoC,MAAS,CAAA;YAAE3C,GAAG,IAAI6D,UAAUlB,IAAIiC,MAAM,CAACxF,MAAM,EAAEuD,IAAIiC,MAAM,CAAC5F,UAAU,EAAE2D,IAAIiC,MAAM,CAACC,UAAU;YAAG7C,OAAOW,IAAIX,KAAK;QAAC,CAAA;IAE/K,MAAM0C,OAAOhK,GAAGM,OAAO,CAAC,yEAAyEuH,GAAG;IACpG,MAAMoC,OAAO,IAAIpD;IACjB,KAAK,MAAMoB,OAAO+B,KAAM;QACtB,IAAI/B,IAAI5H,IAAI,KAAKA,QAAQyK,KAAKM,OAAO,CAACC,GAAG,CAACpD,IAAI5H,IAAI,KAAMyK,KAAKQ,OAAO,IAAI,CAACR,KAAKQ,OAAO,CAACD,GAAG,CAACpD,IAAI5H,IAAI,GAAI;QACtG,MAAMkL,QAAQ,IAAIpC,UAAUlB,IAAIiC,MAAM,CAACxF,MAAM,EAAEuD,IAAIiC,MAAM,CAAC5F,UAAU,EAAE2D,IAAIiC,MAAM,CAACC,UAAU;QAC3F,KAAK,MAAMN,KAAKqB,OAAQ;YACtB,IAAId,MAAM;YACV,MAAMoB,MAAM9F,KAAKqC,GAAG,CAAC8B,EAAEvE,CAAC,CAAC3G,MAAM,EAAE4M,MAAM5M,MAAM;YAC7C,IAAK,IAAI6G,IAAI,GAAGA,IAAIgG,KAAKhG,IAAK4E,OAAOP,EAAEvE,CAAC,CAACE,EAAE,GAAG+F,KAAK,CAAC/F,EAAE;YACtD,MAAMiE,QAAQW,MAAMP,EAAEvC,KAAK,GAAGW,IAAIX,KAAK;YACvC,MAAM+C,WAAWJ,KAAKhD,GAAG,CAACgB,IAAI5H,IAAI;YAClC,IAAIgK,aAAalE,aAAasD,QAAQY,UAAUJ,KAAK/C,GAAG,CAACe,IAAI5H,IAAI,EAAEoJ;QACrE;IACF;IAEA,OAAO;WAAIQ,KAAKnG,OAAO;KAAG,CACvB0G,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,EAC1BhL,KAAK,CAAC,GAAGqL,KAAK9G,CAAC,EACf6B,GAAG,CAAC,CAAC,CAACmB,GAAGyC,MAAM,GAAM,CAAA;YAAEpJ,MAAM2G;YAAG2D,YAAYnB,SAASC;QAAO,CAAA;AACjE"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/features/embed.ts"],"sourcesContent":["import { existsSync, mkdirSync, readFileSync, renameSync, writeFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { Config, ResolvedConfig } from '../config.ts';\nimport { embedConfig } from '../config.ts';\nimport { SenseError } from '../errors.ts';\nimport { progress } from '../progress.ts';\nimport { parseFile } from '../scan.ts';\nimport type { Feature } from './types.ts';\n\n// Heading-based chunks, int8 vectors with a per-vector scale, NULL vector = not yet embedded.\n// Reconcile writes dirty rows; embedding tops up on the next search, so staleness costs recall.\n\n// Storage lever fixed by the bake-off (BENCHMARKING.md): int8 at 256 dims is\n// quality-free vs f32-512 when fused. Queries stay f32 at the same dims.\nconst STORE_DIMS = 256;\n// Seed chunks that participate in a `related` scan; see similarNotes for the measurement.\nconst TARGET_CHUNK_CAP = 16;\nconst BATCH = 64;\n\nexport interface EmbedProvider {\n  id: string; // model identity; participates in the cache key, change -> re-embed\n  dims: number;\n  embed(texts: string[]): Promise<Float32Array[]>;\n}\n\ninterface Chunk {\n  startLine: number;\n  endLine: number;\n  text: string;\n}\n\n// Deterministic, so embed time can re-derive text from stored line ranges. Heading-delimited,\n// preamble kept, whole body when no headings; the title/summary prefix mirrors bm25 weighting.\n//\n// Chunks the body, not the raw file, with `offset` shifting line numbers back onto the raw\n// file so a range stays a direct Read range (sections is 1-indexed over raw too). Chunking raw\n// put the frontmatter block in its own leading chunk on every note with a heading, which made\n// `lines` point at YAML and made frontmatter-only notes near-identical to each other. It also\n// disagreed with FTS, which indexes the body alone.\nfunction chunksOf(body: string, search?: { title: string; summary: string }, offset = 0): Chunk[] {\n  const lines = body.split('\\n');\n  const starts: number[] = [];\n  let inFence = false;\n  for (let i = 0; i < lines.length; i++) {\n    if (/^(```|~~~)/.test(lines[i])) {\n      inFence = !inFence;\n      continue;\n    }\n    if (!inFence && /^#{1,6} +/.test(lines[i])) starts.push(i + 1);\n  }\n  const bounds = starts.length === 0 ? [1] : starts[0] > 1 ? [1, ...starts] : starts;\n  const prefix = [search?.title, search?.summary].filter(Boolean).join('\\n');\n  const chunks: Chunk[] = [];\n  bounds.forEach((start, i) => {\n    const end = i + 1 < bounds.length ? bounds[i + 1] - 1 : lines.length;\n    const text = lines\n      .slice(start - 1, end)\n      .join('\\n')\n      .trim();\n    // A body with nothing in it yields no chunks at all, so a frontmatter-only note has no\n    // vectors rather than a vector of its own YAML.\n    if (text.length > 0) chunks.push({ startLine: start + offset, endLine: end + offset, text: prefix ? `${prefix}\\n${text}` : text });\n  });\n  return chunks;\n}\n\nexport const embed: Feature = {\n  name: 'embed',\n  schema(db) {\n    db.exec(`CREATE TABLE IF NOT EXISTS embeddings (\"path\" TEXT, chunk INTEGER, start_line INTEGER, end_line INTEGER, scale REAL, vector BLOB, PRIMARY KEY (\"path\", chunk))`);\n  },\n  extract(raw, body, search) {\n    // Lines the frontmatter occupies, so body line 1 maps back to its raw line number.\n    return chunksOf(body, search, raw.split('\\n').length - body.split('\\n').length);\n  },\n  remove(db, path) {\n    db.prepare('DELETE FROM embeddings WHERE \"path\" = ?').run(path);\n  },\n  // A tree with no embedding model never had extract() run for the doc (db.ts's per-file\n  // filter skips it), so extracted is undefined here -- store nothing, i.e. no rows.\n  store(db, path, extracted) {\n    if (!extracted) return;\n    const insert = db.prepare('INSERT INTO embeddings (\"path\", chunk, start_line, end_line, scale, vector) VALUES (?, ?, ?, ?, NULL, NULL)');\n    (extracted as Chunk[]).forEach((c, idx) => insert.run(path, idx, c.startLine, c.endLine));\n  },\n  enabledForFile(_cfg, file) {\n    return file.embed;\n  },\n};\n\n// --- static type: Model2Vec safetensors + pure-JS tokenizer, model cached in ~/.cache ---\n// Encode convention from model2vec/model.py: no special tokens, drop unk ids, mean-pool,\n// L2-normalize.\n\nconst MODEL_FILES = ['model.safetensors', 'tokenizer.json'];\n// The pair, for messages that name what a local model directory must contain.\nexport const MODEL_FILENAMES = MODEL_FILES.join(' and ');\n\n// A Hugging Face repo id: one slash, HF's charset. Anything else is a path, used as one rather\n// than flattened into a cache key Windows would reject.\nconst HF_MODEL_ID = /^[A-Za-z0-9][\\w.-]*\\/[A-Za-z0-9][\\w.-]*$/;\n\n// Downloadable iff it names a Hugging Face repo; a local path is the caller's to populate.\nexport function isDownloadable(model: string): boolean {\n  return HF_MODEL_ID.test(model);\n}\n\n// Machine-wide, not per-tree: `.sense/` is the index a rebuild throws away, while a 124 MB\n// model is shared by every tree on the machine. Honors XDG_CACHE_HOME where it is set;\n// elsewhere ~/.cache, which is also where Hugging Face's own libraries keep theirs.\nfunction cacheRoot(): string {\n  const xdg = process.env.XDG_CACHE_HOME;\n  return join(xdg && xdg.length > 0 ? xdg : join(homedir(), '.cache'), 'sensemaking', 'models');\n}\n\n// A model is either a local directory the caller pointed at, or the cache `sense download`\n// fills. Nothing here fetches: an absent model degrades search to its other signals rather\n// than pulling 124 MB out of a command that reads like a query.\nexport function modelDir(model: string): string {\n  if (!HF_MODEL_ID.test(model)) return model;\n  return join(cacheRoot(), model.replace(/\\//g, '--'));\n}\n\n// Both files, so an interrupted download reads as absent and the next one resumes it.\nexport function hasModelFiles(model: string): boolean {\n  const dir = modelDir(model);\n  return MODEL_FILES.every((file) => existsSync(join(dir, file)));\n}\n\n// api providers have nothing to download, so they are never \"missing\" here; an unreachable\n// endpoint surfaces as an EMBED_MODEL error at call time instead.\nexport function modelPresent(cfg: Config): boolean {\n  const e = embedConfig(cfg);\n  if (!e) return false;\n  return e.type === 'api' || hasModelFiles(e.model);\n}\n\nfunction fetchToFile(url: string, dest: string): Promise<void> {\n  return fetch(url).then(async (res) => {\n    if (!res.ok) throw new SenseError('EMBED_MODEL', `model download failed: ${url} -> HTTP ${res.status}`);\n    writeFileSync(`${dest}.part`, Buffer.from(await res.arrayBuffer()));\n    renameSync(`${dest}.part`, dest);\n  });\n}\n\n// The only code path that touches the network for weights. `sense download` calls it; no\n// query ever does. Idempotent: a file already on disk is left alone.\nexport async function downloadModel(model: string, onFile?: (file: string, dir: string) => void): Promise<string> {\n  if (!isDownloadable(model)) {\n    throw new SenseError('EMBED_MODEL', `embed.model \"${model}\" is a local path, not a Hugging Face model id, so there is nothing to download; put model.safetensors and tokenizer.json in that directory, or name a model id like \"minishlab/potion-retrieval-32M\"`);\n  }\n  const dir = modelDir(model);\n  mkdirSync(dir, { recursive: true });\n  for (const file of MODEL_FILES) {\n    if (existsSync(join(dir, file))) continue;\n    onFile?.(file, dir);\n    await fetchToFile(`https://huggingface.co/${model}/resolve/main/${file}`, join(dir, file));\n  }\n  return dir;\n}\n\nasync function staticProvider(model: string): Promise<EmbedProvider> {\n  const dir = modelDir(model);\n  for (const file of MODEL_FILES) {\n    if (!existsSync(join(dir, file))) {\n      // A local path the caller controls gets told what is missing where; only a repo id can\n      // be fixed by downloading.\n      const fix = isDownloadable(model) ? 'run `sense download`' : `expected ${MODEL_FILENAMES} in that directory`;\n      throw new SenseError('EMBED_MODEL_MISSING', `embed model ${model} is not available (looked in ${dir}); ${fix}`);\n    }\n  }\n\n  const raw = readFileSync(join(dir, 'model.safetensors'));\n  const headerLen = Number(raw.readBigUInt64LE(0));\n  const header = JSON.parse(raw.subarray(8, 8 + headerLen).toString('utf8')) as Record<string, { dtype: string; shape: number[]; data_offsets: number[] }>;\n  const entry = Object.entries(header).find(([k]) => k !== '__metadata__');\n  if (!entry || entry[1].dtype !== 'F32') throw new SenseError('EMBED_MODEL', `${model}: expected an F32 safetensors matrix`);\n  const spec = entry[1];\n  const dims = spec.shape[1];\n  const dataStart = raw.byteOffset + 8 + headerLen + spec.data_offsets[0];\n  const matrix = dataStart % 4 === 0 ? new Float32Array(raw.buffer, dataStart, spec.shape[0] * dims) : new Float32Array(raw.buffer.slice(dataStart, dataStart + spec.shape[0] * dims * 4));\n\n  const tokenizerJson = JSON.parse(readFileSync(join(dir, 'tokenizer.json'), 'utf8'));\n  // Lazy import: the tokenizer loads only on the semantic path, never at CLI startup.\n  const { Tokenizer } = await import('@huggingface/tokenizers');\n  const tok = new Tokenizer(tokenizerJson, {});\n  const unkId = tokenizerJson.model?.vocab?.[tokenizerJson.model?.unk_token] ?? -1;\n\n  function one(text: string): Float32Array {\n    // The tokenizer yields undefined (not the unk id) for tokens outside the vocab; an\n    // undefined id would index the matrix at NaN and poison the whole mean-pool -- and the\n    // int8 conversion then stores the NaN vector as all zeros, silently. Keep integers only.\n    const ids = (tok.encode(text, { add_special_tokens: false }).ids as number[]).filter((id) => Number.isInteger(id) && id !== unkId);\n    const v = new Float32Array(dims);\n    if (ids.length === 0) return v;\n    for (const id of ids) {\n      const off = id * dims;\n      for (let d = 0; d < dims; d++) v[d] += matrix[off + d];\n    }\n    let norm = 0;\n    for (let d = 0; d < dims; d++) {\n      v[d] /= ids.length;\n      norm += v[d] * v[d];\n    }\n    norm = Math.sqrt(norm) + 1e-32;\n    for (let d = 0; d < dims; d++) v[d] /= norm;\n    return v;\n  }\n\n  return { id: `static:${model}`, dims, embed: async (texts) => texts.map(one) };\n}\n\n// --- api type: one POST against any OpenAI-compatible /embeddings endpoint ---\n\nasync function apiProvider(model: string, url: string | undefined, keyEnv: string | undefined): Promise<EmbedProvider> {\n  if (!url) throw new SenseError('EMBED_MODEL', 'features.embed.type \"api\" requires a url');\n  const base = url.replace(/\\/+$/, '');\n  const headers: Record<string, string> = { 'content-type': 'application/json' };\n  const key = keyEnv ? process.env[keyEnv] : undefined;\n  if (key) headers.authorization = `Bearer ${key}`;\n\n  async function post(texts: string[]): Promise<Float32Array[]> {\n    const res = await fetch(`${base}/embeddings`, { method: 'POST', headers, body: JSON.stringify({ model, input: texts }) });\n    if (!res.ok) throw new SenseError('EMBED_MODEL', `${base}/embeddings -> HTTP ${res.status}`);\n    const body = (await res.json()) as { data: Array<{ embedding: number[] }> };\n    return body.data.map((d) => Float32Array.from(d.embedding));\n  }\n\n  const dims = (await post(['dimension probe']))[0].length;\n  return { id: `api:${base}:${model}`, dims, embed: post };\n}\n\nconst providers = new Map<string, Promise<EmbedProvider>>();\n\nfunction getProvider(cfg: Config): Promise<EmbedProvider> {\n  const e = embedConfig(cfg);\n  if (!e) throw new SenseError('EMBED_DISABLED', 'this tree has no embedding model: add an \"embed\" block naming one to sense.config.json, then run `sense download`');\n  const sig = `${e.type}:${e.model}:${e.url ?? ''}`;\n  let p = providers.get(sig);\n  if (!p) {\n    p = e.type === 'api' ? apiProvider(e.model, e.url, e.key) : staticProvider(e.model);\n    providers.set(sig, p);\n  }\n  return p;\n}\n\n// Slice + re-normalize (Matryoshka); optionally round through int8 storage.\nfunction toStore(full: Float32Array, dims: number, int8: boolean): { v: Float32Array; scale: number } {\n  const v = new Float32Array(dims);\n  let norm = 0;\n  for (let d = 0; d < dims; d++) norm += full[d] * full[d];\n  norm = Math.sqrt(norm) + 1e-32;\n  for (let d = 0; d < dims; d++) v[d] = full[d] / norm;\n  if (!int8) return { v, scale: 1 };\n  let max = 0;\n  for (let d = 0; d < dims; d++) max = Math.max(max, Math.abs(v[d]));\n  return { v, scale: max / 127 || 1 };\n}\n\n// Embed rows whose vector is NULL, re-deriving chunk text from the files through the\n// same parse + chunker that stored the rows.\nexport async function embedPending(db: DatabaseSync, cfg: Config, baseDir: string): Promise<void> {\n  const provider = await getProvider(cfg); // throws EMBED_DISABLED before touching the table\n  const dirty = db.prepare('SELECT \"path\", chunk FROM embeddings WHERE vector IS NULL ORDER BY \"path\", chunk').all() as Array<{ path: string; chunk: number }>;\n  if (dirty.length === 0) return;\n  const storeDims = Math.min(STORE_DIMS, provider.dims);\n\n  const byPath = new Map<string, number[]>();\n  for (const row of dirty) {\n    const list = byPath.get(row.path) ?? [];\n    list.push(row.chunk);\n    byPath.set(row.path, list);\n  }\n\n  const jobs: Array<{ path: string; chunk: number; text: string }> = [];\n  for (const [path, chunkIdxs] of byPath) {\n    let chunks: Chunk[];\n    try {\n      // presets/embed are irrelevant here -- re-deriving chunk text for a doc that already\n      // has embeddings rows means the tree had an embedding model at reconcile time.\n      chunks = parseFile({ relPath: path, absPath: join(baseDir, path), mtimeMs: 0, size: 0, presets: [], embed: true }, [embed]).doc.extracted.embed as Chunk[];\n    } catch {\n      continue; // vanished since reconcile; the next reconcile removes its rows\n    }\n    for (const idx of chunkIdxs) if (chunks[idx]) jobs.push({ path, chunk: idx, text: chunks[idx].text });\n  }\n\n  const update = db.prepare('UPDATE embeddings SET scale = ?, vector = ? WHERE \"path\" = ? AND chunk = ?');\n  // The lazy build is the one long silence a first search hits (measured 23s at\n  // 26k notes); progress makes it distinguishable from a hang.\n  const report = progress('embedding chunks', jobs.length);\n  for (let i = 0; i < jobs.length; i += BATCH) {\n    const batch = jobs.slice(i, i + BATCH);\n    const vectors = await provider.embed(batch.map((j) => j.text));\n    db.exec('BEGIN');\n    try {\n      batch.forEach((job, j) => {\n        const { v, scale } = toStore(vectors[j], storeDims, true);\n        const q = new Int8Array(storeDims);\n        for (let d = 0; d < storeDims; d++) q[d] = Math.round(v[d] / scale);\n        update.run(scale, Buffer.from(q.buffer), job.path, job.chunk);\n      });\n      db.exec('COMMIT');\n    } catch (err) {\n      db.exec('ROLLBACK');\n      throw err;\n    }\n    report.tick(Math.min(i + BATCH, jobs.length));\n  }\n  report.finish();\n}\n\n// Dequantised int8 dot products land a little either side of a true cosine, so an identical\n// pair prints 1.001 and undermines a column whose whole job is being a bounded number.\nfunction asCosine(score: number): number {\n  return Math.round(Math.min(1, Math.max(-1, score)) * 1000) / 1000;\n}\n\n// Best chunk per file by cosine, its line range riding along; FTS5 operators are stripped as\n// lexical syntax. Similarity comes back because the fused score cannot express match quality,\n// and nearest-neighbour search always returns a neighbour however far away.\nexport async function semanticCandidates(db: DatabaseSync, cfg: Config, terms: string, fetch: number, allowed?: Set<string>): Promise<Array<{ path: string; lines: string; similarity: number }>> {\n  const baseDir = (cfg as Partial<ResolvedConfig>).baseDir;\n  if (!baseDir) throw new SenseError('EMBED_MODEL', 'semantic expansion needs a config with baseDir (use loadConfig/open)');\n  await embedPending(db, cfg, baseDir);\n\n  const provider = await getProvider(cfg);\n  const storeDims = Math.min(STORE_DIMS, provider.dims);\n  const text = (terms.match(/[\\p{L}\\p{N}]+/gu) ?? []).filter((t) => !['AND', 'OR', 'NOT', 'NEAR'].includes(t)).join(' ');\n  const { v: qv } = toStore((await provider.embed([text]))[0], storeDims, false);\n\n  const rows = db.prepare('SELECT \"path\", start_line, end_line, scale, vector FROM embeddings WHERE vector IS NOT NULL').all() as Array<{\n    path: string;\n    start_line: number;\n    end_line: number;\n    scale: number;\n    vector: Uint8Array;\n  }>;\n\n  const best = new Map<string, { score: number; lines: string }>();\n  for (const row of rows) {\n    if (allowed && !allowed.has(row.path)) continue;\n    const q = new Int8Array(row.vector.buffer, row.vector.byteOffset, Math.min(storeDims, row.vector.byteLength));\n    let dot = 0;\n    for (let d = 0; d < q.length; d++) dot += q[d] * qv[d];\n    const score = dot * row.scale;\n    const existing = best.get(row.path);\n    if (!existing || score > existing.score) best.set(row.path, { score, lines: `L${row.start_line}-${row.end_line}` });\n  }\n  return [...best.entries()]\n    .sort((a, b) => b[1].score - a[1].score)\n    .slice(0, fetch)\n    .map(([path, b]) => ({ path, lines: b.lines, similarity: asCosine(b.score) }));\n}\n\n// Whether a note has any chunk with a vector. Distinguishes \"nothing is near this note\" from\n// \"this note has no text\", which look the same in an empty result.\nexport function hasEmbedding(db: DatabaseSync, path: string): boolean {\n  const row = db.prepare('SELECT 1 AS ok FROM embeddings WHERE \"path\" = ? AND vector IS NOT NULL LIMIT 1').get(path) as { ok: number } | undefined;\n  return row !== undefined;\n}\n\n// Note-to-note similarity is the max cosine over (target chunk, other chunk) pairs, one linear\n// scan of stored vectors. Reads only what is stored, so it stays sync.\nexport function similarNotes(db: DatabaseSync, _cfg: Config, path: string, opts: { exclude: Set<string>; allowed?: Set<string>; k: number }): Array<{ path: string; similarity: number }> {\n  // Cost is target_chunks x stored_chunks, so a heading-dense seed multiplies a full-corpus\n  // scan (12.7s at 201 chunks/note). Sample evenly, so late sections still get a vote.\n  const targetRows = db.prepare('SELECT scale, vector FROM embeddings WHERE \"path\" = ? AND vector IS NOT NULL ORDER BY chunk').all(path) as Array<{ scale: number; vector: Uint8Array }>;\n  if (targetRows.length === 0) return [];\n  const step = Math.max(1, Math.ceil(targetRows.length / TARGET_CHUNK_CAP));\n  const target = targetRows.filter((_, i) => i % step === 0).map((row) => ({ v: new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength), scale: row.scale }));\n\n  const rows = db.prepare('SELECT \"path\", scale, vector FROM embeddings WHERE vector IS NOT NULL').all() as Array<{ path: string; scale: number; vector: Uint8Array }>;\n  const best = new Map<string, number>();\n  for (const row of rows) {\n    if (row.path === path || opts.exclude.has(row.path) || (opts.allowed && !opts.allowed.has(row.path))) continue;\n    const other = new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength);\n    for (const t of target) {\n      let dot = 0;\n      const len = Math.min(t.v.length, other.length);\n      for (let d = 0; d < len; d++) dot += t.v[d] * other[d];\n      const score = dot * t.scale * row.scale;\n      const existing = best.get(row.path);\n      if (existing === undefined || score > existing) best.set(row.path, score);\n    }\n  }\n\n  return [...best.entries()]\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, opts.k)\n    .map(([p, score]) => ({ path: p, similarity: asCosine(score) }));\n}\n"],"names":["existsSync","mkdirSync","readFileSync","renameSync","writeFileSync","homedir","join","embedConfig","SenseError","progress","parseFile","STORE_DIMS","TARGET_CHUNK_CAP","BATCH","chunksOf","body","search","offset","lines","split","starts","inFence","i","length","test","push","bounds","prefix","title","summary","filter","Boolean","chunks","forEach","start","end","text","slice","trim","startLine","endLine","embed","name","schema","db","exec","extract","raw","remove","path","prepare","run","store","extracted","insert","c","idx","enabledForFile","_cfg","file","MODEL_FILES","MODEL_FILENAMES","HF_MODEL_ID","isDownloadable","model","cacheRoot","xdg","process","env","XDG_CACHE_HOME","modelDir","replace","hasModelFiles","dir","every","modelPresent","cfg","e","type","fetchToFile","url","dest","fetch","then","res","ok","status","Buffer","from","arrayBuffer","downloadModel","onFile","recursive","staticProvider","tokenizerJson","fix","headerLen","Number","readBigUInt64LE","header","JSON","parse","subarray","toString","entry","Object","entries","find","k","dtype","spec","dims","shape","dataStart","byteOffset","data_offsets","matrix","Float32Array","buffer","Tokenizer","tok","unkId","vocab","unk_token","one","ids","encode","add_special_tokens","id","isInteger","v","off","d","norm","Math","sqrt","texts","map","apiProvider","keyEnv","base","headers","key","undefined","authorization","post","method","stringify","input","json","data","embedding","providers","Map","getProvider","sig","p","get","set","toStore","full","int8","scale","max","abs","embedPending","baseDir","provider","dirty","all","storeDims","min","byPath","row","list","chunk","jobs","chunkIdxs","relPath","absPath","mtimeMs","size","presets","doc","update","report","batch","vectors","j","job","q","Int8Array","round","err","tick","finish","asCosine","score","semanticCandidates","terms","allowed","match","t","includes","qv","rows","best","has","vector","byteLength","dot","existing","start_line","end_line","sort","a","b","similarity","hasEmbedding","similarNotes","opts","targetRows","step","ceil","target","_","exclude","other","len"],"mappings":"AAAA,SAASA,UAAU,EAAEC,SAAS,EAAEC,YAAY,EAAEC,UAAU,EAAEC,aAAa,QAAQ,UAAU;AACzF,SAASC,OAAO,QAAQ,UAAU;AAClC,SAASC,IAAI,QAAQ,YAAY;AAGjC,SAASC,WAAW,QAAQ,eAAe;AAC3C,SAASC,UAAU,QAAQ,eAAe;AAC1C,SAASC,QAAQ,QAAQ,iBAAiB;AAC1C,SAASC,SAAS,QAAQ,aAAa;AAGvC,8FAA8F;AAC9F,gGAAgG;AAEhG,6EAA6E;AAC7E,yEAAyE;AACzE,MAAMC,aAAa;AACnB,0FAA0F;AAC1F,MAAMC,mBAAmB;AACzB,MAAMC,QAAQ;AAcd,8FAA8F;AAC9F,+FAA+F;AAC/F,EAAE;AACF,2FAA2F;AAC3F,+FAA+F;AAC/F,8FAA8F;AAC9F,8FAA8F;AAC9F,oDAAoD;AACpD,SAASC,SAASC,IAAY,EAAEC,MAA2C,EAAEC,SAAS,CAAC;IACrF,MAAMC,QAAQH,KAAKI,KAAK,CAAC;IACzB,MAAMC,SAAmB,EAAE;IAC3B,IAAIC,UAAU;IACd,IAAK,IAAIC,IAAI,GAAGA,IAAIJ,MAAMK,MAAM,EAAED,IAAK;QACrC,IAAI,aAAaE,IAAI,CAACN,KAAK,CAACI,EAAE,GAAG;YAC/BD,UAAU,CAACA;YACX;QACF;QACA,IAAI,CAACA,WAAW,YAAYG,IAAI,CAACN,KAAK,CAACI,EAAE,GAAGF,OAAOK,IAAI,CAACH,IAAI;IAC9D;IACA,MAAMI,SAASN,OAAOG,MAAM,KAAK,IAAI;QAAC;KAAE,GAAGH,MAAM,CAAC,EAAE,GAAG,IAAI;QAAC;WAAMA;KAAO,GAAGA;IAC5E,MAAMO,SAAS;QAACX,mBAAAA,6BAAAA,OAAQY,KAAK;QAAEZ,mBAAAA,6BAAAA,OAAQa,OAAO;KAAC,CAACC,MAAM,CAACC,SAASzB,IAAI,CAAC;IACrE,MAAM0B,SAAkB,EAAE;IAC1BN,OAAOO,OAAO,CAAC,CAACC,OAAOZ;QACrB,MAAMa,MAAMb,IAAI,IAAII,OAAOH,MAAM,GAAGG,MAAM,CAACJ,IAAI,EAAE,GAAG,IAAIJ,MAAMK,MAAM;QACpE,MAAMa,OAAOlB,MACVmB,KAAK,CAACH,QAAQ,GAAGC,KACjB7B,IAAI,CAAC,MACLgC,IAAI;QACP,uFAAuF;QACvF,gDAAgD;QAChD,IAAIF,KAAKb,MAAM,GAAG,GAAGS,OAAOP,IAAI,CAAC;YAAEc,WAAWL,QAAQjB;YAAQuB,SAASL,MAAMlB;YAAQmB,MAAMT,SAAS,GAAGA,OAAO,EAAE,EAAES,MAAM,GAAGA;QAAK;IAClI;IACA,OAAOJ;AACT;AAEA,OAAO,MAAMS,QAAiB;IAC5BC,MAAM;IACNC,QAAOC,EAAE;QACPA,GAAGC,IAAI,CAAC,CAAC,8JAA8J,CAAC;IAC1K;IACAC,SAAQC,GAAG,EAAEhC,IAAI,EAAEC,MAAM;QACvB,mFAAmF;QACnF,OAAOF,SAASC,MAAMC,QAAQ+B,IAAI5B,KAAK,CAAC,MAAMI,MAAM,GAAGR,KAAKI,KAAK,CAAC,MAAMI,MAAM;IAChF;IACAyB,QAAOJ,EAAE,EAAEK,IAAI;QACbL,GAAGM,OAAO,CAAC,2CAA2CC,GAAG,CAACF;IAC5D;IACA,uFAAuF;IACvF,mFAAmF;IACnFG,OAAMR,EAAE,EAAEK,IAAI,EAAEI,SAAS;QACvB,IAAI,CAACA,WAAW;QAChB,MAAMC,SAASV,GAAGM,OAAO,CAAC;QACzBG,UAAsBpB,OAAO,CAAC,CAACsB,GAAGC,MAAQF,OAAOH,GAAG,CAACF,MAAMO,KAAKD,EAAEhB,SAAS,EAAEgB,EAAEf,OAAO;IACzF;IACAiB,gBAAeC,IAAI,EAAEC,IAAI;QACvB,OAAOA,KAAKlB,KAAK;IACnB;AACF,EAAE;AAEF,2FAA2F;AAC3F,yFAAyF;AACzF,gBAAgB;AAEhB,MAAMmB,cAAc;IAAC;IAAqB;CAAiB;AAC3D,8EAA8E;AAC9E,OAAO,MAAMC,kBAAkBD,YAAYtD,IAAI,CAAC,SAAS;AAEzD,+FAA+F;AAC/F,wDAAwD;AACxD,MAAMwD,cAAc;AAEpB,2FAA2F;AAC3F,OAAO,SAASC,eAAeC,KAAa;IAC1C,OAAOF,YAAYtC,IAAI,CAACwC;AAC1B;AAEA,2FAA2F;AAC3F,uFAAuF;AACvF,oFAAoF;AACpF,SAASC;IACP,MAAMC,MAAMC,QAAQC,GAAG,CAACC,cAAc;IACtC,OAAO/D,KAAK4D,OAAOA,IAAI3C,MAAM,GAAG,IAAI2C,MAAM5D,KAAKD,WAAW,WAAW,eAAe;AACtF;AAEA,2FAA2F;AAC3F,2FAA2F;AAC3F,gEAAgE;AAChE,OAAO,SAASiE,SAASN,KAAa;IACpC,IAAI,CAACF,YAAYtC,IAAI,CAACwC,QAAQ,OAAOA;IACrC,OAAO1D,KAAK2D,aAAaD,MAAMO,OAAO,CAAC,OAAO;AAChD;AAEA,sFAAsF;AACtF,OAAO,SAASC,cAAcR,KAAa;IACzC,MAAMS,MAAMH,SAASN;IACrB,OAAOJ,YAAYc,KAAK,CAAC,CAACf,OAAS3D,WAAWM,KAAKmE,KAAKd;AAC1D;AAEA,2FAA2F;AAC3F,kEAAkE;AAClE,OAAO,SAASgB,aAAaC,GAAW;IACtC,MAAMC,IAAItE,YAAYqE;IACtB,IAAI,CAACC,GAAG,OAAO;IACf,OAAOA,EAAEC,IAAI,KAAK,SAASN,cAAcK,EAAEb,KAAK;AAClD;AAEA,SAASe,YAAYC,GAAW,EAAEC,IAAY;IAC5C,OAAOC,MAAMF,KAAKG,IAAI,CAAC,OAAOC;QAC5B,IAAI,CAACA,IAAIC,EAAE,EAAE,MAAM,IAAI7E,WAAW,eAAe,CAAC,uBAAuB,EAAEwE,IAAI,SAAS,EAAEI,IAAIE,MAAM,EAAE;QACtGlF,cAAc,GAAG6E,KAAK,KAAK,CAAC,EAAEM,OAAOC,IAAI,CAAC,MAAMJ,IAAIK,WAAW;QAC/DtF,WAAW,GAAG8E,KAAK,KAAK,CAAC,EAAEA;IAC7B;AACF;AAEA,yFAAyF;AACzF,qEAAqE;AACrE,OAAO,eAAeS,cAAc1B,KAAa,EAAE2B,MAA4C;IAC7F,IAAI,CAAC5B,eAAeC,QAAQ;QAC1B,MAAM,IAAIxD,WAAW,eAAe,CAAC,aAAa,EAAEwD,MAAM,qMAAqM,CAAC;IAClQ;IACA,MAAMS,MAAMH,SAASN;IACrB/D,UAAUwE,KAAK;QAAEmB,WAAW;IAAK;IACjC,KAAK,MAAMjC,QAAQC,YAAa;QAC9B,IAAI5D,WAAWM,KAAKmE,KAAKd,QAAQ;QACjCgC,mBAAAA,6BAAAA,OAAShC,MAAMc;QACf,MAAMM,YAAY,CAAC,uBAAuB,EAAEf,MAAM,cAAc,EAAEL,MAAM,EAAErD,KAAKmE,KAAKd;IACtF;IACA,OAAOc;AACT;AAEA,eAAeoB,eAAe7B,KAAa;;QAyBE8B,sBAA7BA,4BAAAA;IAxBd,MAAMrB,MAAMH,SAASN;IACrB,KAAK,MAAML,QAAQC,YAAa;QAC9B,IAAI,CAAC5D,WAAWM,KAAKmE,KAAKd,QAAQ;YAChC,uFAAuF;YACvF,2BAA2B;YAC3B,MAAMoC,MAAMhC,eAAeC,SAAS,yBAAyB,CAAC,SAAS,EAAEH,gBAAgB,kBAAkB,CAAC;YAC5G,MAAM,IAAIrD,WAAW,uBAAuB,CAAC,YAAY,EAAEwD,MAAM,6BAA6B,EAAES,IAAI,GAAG,EAAEsB,KAAK;QAChH;IACF;IAEA,MAAMhD,MAAM7C,aAAaI,KAAKmE,KAAK;IACnC,MAAMuB,YAAYC,OAAOlD,IAAImD,eAAe,CAAC;IAC7C,MAAMC,SAASC,KAAKC,KAAK,CAACtD,IAAIuD,QAAQ,CAAC,GAAG,IAAIN,WAAWO,QAAQ,CAAC;IAClE,MAAMC,QAAQC,OAAOC,OAAO,CAACP,QAAQQ,IAAI,CAAC,CAAC,CAACC,EAAE,GAAKA,MAAM;IACzD,IAAI,CAACJ,SAASA,KAAK,CAAC,EAAE,CAACK,KAAK,KAAK,OAAO,MAAM,IAAIrG,WAAW,eAAe,GAAGwD,MAAM,oCAAoC,CAAC;IAC1H,MAAM8C,OAAON,KAAK,CAAC,EAAE;IACrB,MAAMO,OAAOD,KAAKE,KAAK,CAAC,EAAE;IAC1B,MAAMC,YAAYlE,IAAImE,UAAU,GAAG,IAAIlB,YAAYc,KAAKK,YAAY,CAAC,EAAE;IACvE,MAAMC,SAASH,YAAY,MAAM,IAAI,IAAII,aAAatE,IAAIuE,MAAM,EAAEL,WAAWH,KAAKE,KAAK,CAAC,EAAE,GAAGD,QAAQ,IAAIM,aAAatE,IAAIuE,MAAM,CAACjF,KAAK,CAAC4E,WAAWA,YAAYH,KAAKE,KAAK,CAAC,EAAE,GAAGD,OAAO;IAErL,MAAMjB,gBAAgBM,KAAKC,KAAK,CAACnG,aAAaI,KAAKmE,KAAK,mBAAmB;IAC3E,oFAAoF;IACpF,MAAM,EAAE8C,SAAS,EAAE,GAAG,MAAM,MAAM,CAAC;IACnC,MAAMC,MAAM,IAAID,UAAUzB,eAAe,CAAC;IAC1C,MAAM2B,iBAAQ3B,wBAAAA,cAAc9B,KAAK,cAAnB8B,6CAAAA,6BAAAA,sBAAqB4B,KAAK,cAA1B5B,iDAAAA,0BAA4B,EAACA,uBAAAA,cAAc9B,KAAK,cAAnB8B,2CAAAA,qBAAqB6B,SAAS,CAAC,uCAAI,CAAC;IAE/E,SAASC,IAAIxF,IAAY;QACvB,mFAAmF;QACnF,uFAAuF;QACvF,yFAAyF;QACzF,MAAMyF,MAAM,AAACL,IAAIM,MAAM,CAAC1F,MAAM;YAAE2F,oBAAoB;QAAM,GAAGF,GAAG,CAAc/F,MAAM,CAAC,CAACkG,KAAO/B,OAAOgC,SAAS,CAACD,OAAOA,OAAOP;QAC5H,MAAMS,IAAI,IAAIb,aAAaN;QAC3B,IAAIc,IAAItG,MAAM,KAAK,GAAG,OAAO2G;QAC7B,KAAK,MAAMF,MAAMH,IAAK;YACpB,MAAMM,MAAMH,KAAKjB;YACjB,IAAK,IAAIqB,IAAI,GAAGA,IAAIrB,MAAMqB,IAAKF,CAAC,CAACE,EAAE,IAAIhB,MAAM,CAACe,MAAMC,EAAE;QACxD;QACA,IAAIC,OAAO;QACX,IAAK,IAAID,IAAI,GAAGA,IAAIrB,MAAMqB,IAAK;YAC7BF,CAAC,CAACE,EAAE,IAAIP,IAAItG,MAAM;YAClB8G,QAAQH,CAAC,CAACE,EAAE,GAAGF,CAAC,CAACE,EAAE;QACrB;QACAC,OAAOC,KAAKC,IAAI,CAACF,QAAQ;QACzB,IAAK,IAAID,IAAI,GAAGA,IAAIrB,MAAMqB,IAAKF,CAAC,CAACE,EAAE,IAAIC;QACvC,OAAOH;IACT;IAEA,OAAO;QAAEF,IAAI,CAAC,OAAO,EAAEhE,OAAO;QAAE+C;QAAMtE,OAAO,OAAO+F,QAAUA,MAAMC,GAAG,CAACb;IAAK;AAC/E;AAEA,gFAAgF;AAEhF,eAAec,YAAY1E,KAAa,EAAEgB,GAAuB,EAAE2D,MAA0B;IAC3F,IAAI,CAAC3D,KAAK,MAAM,IAAIxE,WAAW,eAAe;IAC9C,MAAMoI,OAAO5D,IAAIT,OAAO,CAAC,QAAQ;IACjC,MAAMsE,UAAkC;QAAE,gBAAgB;IAAmB;IAC7E,MAAMC,MAAMH,SAASxE,QAAQC,GAAG,CAACuE,OAAO,GAAGI;IAC3C,IAAID,KAAKD,QAAQG,aAAa,GAAG,CAAC,OAAO,EAAEF,KAAK;IAEhD,eAAeG,KAAKT,KAAe;QACjC,MAAMpD,MAAM,MAAMF,MAAM,GAAG0D,KAAK,WAAW,CAAC,EAAE;YAAEM,QAAQ;YAAQL;YAAS9H,MAAMqF,KAAK+C,SAAS,CAAC;gBAAEnF;gBAAOoF,OAAOZ;YAAM;QAAG;QACvH,IAAI,CAACpD,IAAIC,EAAE,EAAE,MAAM,IAAI7E,WAAW,eAAe,GAAGoI,KAAK,oBAAoB,EAAExD,IAAIE,MAAM,EAAE;QAC3F,MAAMvE,OAAQ,MAAMqE,IAAIiE,IAAI;QAC5B,OAAOtI,KAAKuI,IAAI,CAACb,GAAG,CAAC,CAACL,IAAMf,aAAa7B,IAAI,CAAC4C,EAAEmB,SAAS;IAC3D;IAEA,MAAMxC,OAAO,AAAC,CAAA,MAAMkC,KAAK;QAAC;KAAkB,CAAA,CAAE,CAAC,EAAE,CAAC1H,MAAM;IACxD,OAAO;QAAEyG,IAAI,CAAC,IAAI,EAAEY,KAAK,CAAC,EAAE5E,OAAO;QAAE+C;QAAMtE,OAAOwG;IAAK;AACzD;AAEA,MAAMO,YAAY,IAAIC;AAEtB,SAASC,YAAY9E,GAAW;QAGMC;IAFpC,MAAMA,IAAItE,YAAYqE;IACtB,IAAI,CAACC,GAAG,MAAM,IAAIrE,WAAW,kBAAkB;IAC/C,MAAMmJ,MAAM,GAAG9E,EAAEC,IAAI,CAAC,CAAC,EAAED,EAAEb,KAAK,CAAC,CAAC,GAAEa,SAAAA,EAAEG,GAAG,cAALH,oBAAAA,SAAS,IAAI;IACjD,IAAI+E,IAAIJ,UAAUK,GAAG,CAACF;IACtB,IAAI,CAACC,GAAG;QACNA,IAAI/E,EAAEC,IAAI,KAAK,QAAQ4D,YAAY7D,EAAEb,KAAK,EAAEa,EAAEG,GAAG,EAAEH,EAAEiE,GAAG,IAAIjD,eAAehB,EAAEb,KAAK;QAClFwF,UAAUM,GAAG,CAACH,KAAKC;IACrB;IACA,OAAOA;AACT;AAEA,4EAA4E;AAC5E,SAASG,QAAQC,IAAkB,EAAEjD,IAAY,EAAEkD,IAAa;IAC9D,MAAM/B,IAAI,IAAIb,aAAaN;IAC3B,IAAIsB,OAAO;IACX,IAAK,IAAID,IAAI,GAAGA,IAAIrB,MAAMqB,IAAKC,QAAQ2B,IAAI,CAAC5B,EAAE,GAAG4B,IAAI,CAAC5B,EAAE;IACxDC,OAAOC,KAAKC,IAAI,CAACF,QAAQ;IACzB,IAAK,IAAID,IAAI,GAAGA,IAAIrB,MAAMqB,IAAKF,CAAC,CAACE,EAAE,GAAG4B,IAAI,CAAC5B,EAAE,GAAGC;IAChD,IAAI,CAAC4B,MAAM,OAAO;QAAE/B;QAAGgC,OAAO;IAAE;IAChC,IAAIC,MAAM;IACV,IAAK,IAAI/B,IAAI,GAAGA,IAAIrB,MAAMqB,IAAK+B,MAAM7B,KAAK6B,GAAG,CAACA,KAAK7B,KAAK8B,GAAG,CAAClC,CAAC,CAACE,EAAE;IAChE,OAAO;QAAEF;QAAGgC,OAAOC,MAAM,OAAO;IAAE;AACpC;AAEA,qFAAqF;AACrF,6CAA6C;AAC7C,OAAO,eAAeE,aAAazH,EAAgB,EAAEgC,GAAW,EAAE0F,OAAe;IAC/E,MAAMC,WAAW,MAAMb,YAAY9E,MAAM,kDAAkD;IAC3F,MAAM4F,QAAQ5H,GAAGM,OAAO,CAAC,oFAAoFuH,GAAG;IAChH,IAAID,MAAMjJ,MAAM,KAAK,GAAG;IACxB,MAAMmJ,YAAYpC,KAAKqC,GAAG,CAAChK,YAAY4J,SAASxD,IAAI;IAEpD,MAAM6D,SAAS,IAAInB;IACnB,KAAK,MAAMoB,OAAOL,MAAO;YACVI;QAAb,MAAME,QAAOF,cAAAA,OAAOf,GAAG,CAACgB,IAAI5H,IAAI,eAAnB2H,yBAAAA,cAAwB,EAAE;QACvCE,KAAKrJ,IAAI,CAACoJ,IAAIE,KAAK;QACnBH,OAAOd,GAAG,CAACe,IAAI5H,IAAI,EAAE6H;IACvB;IAEA,MAAME,OAA6D,EAAE;IACrE,KAAK,MAAM,CAAC/H,MAAMgI,UAAU,IAAIL,OAAQ;QACtC,IAAI5I;QACJ,IAAI;YACF,qFAAqF;YACrF,+EAA+E;YAC/EA,SAAStB,UAAU;gBAAEwK,SAASjI;gBAAMkI,SAAS7K,KAAKgK,SAASrH;gBAAOmI,SAAS;gBAAGC,MAAM;gBAAGC,SAAS,EAAE;gBAAE7I,OAAO;YAAK,GAAG;gBAACA;aAAM,EAAE8I,GAAG,CAAClI,SAAS,CAACZ,KAAK;QACjJ,EAAE,OAAM;YACN,UAAU,gEAAgE;QAC5E;QACA,KAAK,MAAMe,OAAOyH,UAAW,IAAIjJ,MAAM,CAACwB,IAAI,EAAEwH,KAAKvJ,IAAI,CAAC;YAAEwB;YAAM8H,OAAOvH;YAAKpB,MAAMJ,MAAM,CAACwB,IAAI,CAACpB,IAAI;QAAC;IACrG;IAEA,MAAMoJ,SAAS5I,GAAGM,OAAO,CAAC;IAC1B,8EAA8E;IAC9E,6DAA6D;IAC7D,MAAMuI,SAAShL,SAAS,oBAAoBuK,KAAKzJ,MAAM;IACvD,IAAK,IAAID,IAAI,GAAGA,IAAI0J,KAAKzJ,MAAM,EAAED,KAAKT,MAAO;QAC3C,MAAM6K,QAAQV,KAAK3I,KAAK,CAACf,GAAGA,IAAIT;QAChC,MAAM8K,UAAU,MAAMpB,SAAS9H,KAAK,CAACiJ,MAAMjD,GAAG,CAAC,CAACmD,IAAMA,EAAExJ,IAAI;QAC5DQ,GAAGC,IAAI,CAAC;QACR,IAAI;YACF6I,MAAMzJ,OAAO,CAAC,CAAC4J,KAAKD;gBAClB,MAAM,EAAE1D,CAAC,EAAEgC,KAAK,EAAE,GAAGH,QAAQ4B,OAAO,CAACC,EAAE,EAAElB,WAAW;gBACpD,MAAMoB,IAAI,IAAIC,UAAUrB;gBACxB,IAAK,IAAItC,IAAI,GAAGA,IAAIsC,WAAWtC,IAAK0D,CAAC,CAAC1D,EAAE,GAAGE,KAAK0D,KAAK,CAAC9D,CAAC,CAACE,EAAE,GAAG8B;gBAC7DsB,OAAOrI,GAAG,CAAC+G,OAAO3E,OAAOC,IAAI,CAACsG,EAAExE,MAAM,GAAGuE,IAAI5I,IAAI,EAAE4I,IAAId,KAAK;YAC9D;YACAnI,GAAGC,IAAI,CAAC;QACV,EAAE,OAAOoJ,KAAK;YACZrJ,GAAGC,IAAI,CAAC;YACR,MAAMoJ;QACR;QACAR,OAAOS,IAAI,CAAC5D,KAAKqC,GAAG,CAACrJ,IAAIT,OAAOmK,KAAKzJ,MAAM;IAC7C;IACAkK,OAAOU,MAAM;AACf;AAEA,4FAA4F;AAC5F,uFAAuF;AACvF,SAASC,SAASC,KAAa;IAC7B,OAAO/D,KAAK0D,KAAK,CAAC1D,KAAKqC,GAAG,CAAC,GAAGrC,KAAK6B,GAAG,CAAC,CAAC,GAAGkC,UAAU,QAAQ;AAC/D;AAEA,6FAA6F;AAC7F,8FAA8F;AAC9F,4EAA4E;AAC5E,OAAO,eAAeC,mBAAmB1J,EAAgB,EAAEgC,GAAW,EAAE2H,KAAa,EAAErH,MAAa,EAAEsH,OAAqB;QAO3GD;IANd,MAAMjC,UAAU,AAAC1F,IAAgC0F,OAAO;IACxD,IAAI,CAACA,SAAS,MAAM,IAAI9J,WAAW,eAAe;IAClD,MAAM6J,aAAazH,IAAIgC,KAAK0F;IAE5B,MAAMC,WAAW,MAAMb,YAAY9E;IACnC,MAAM8F,YAAYpC,KAAKqC,GAAG,CAAChK,YAAY4J,SAASxD,IAAI;IACpD,MAAM3E,OAAO,EAACmK,eAAAA,MAAME,KAAK,CAAC,gCAAZF,0BAAAA,eAAkC,EAAE,EAAEzK,MAAM,CAAC,CAAC4K,IAAM,CAAC;YAAC;YAAO;YAAM;YAAO;SAAO,CAACC,QAAQ,CAACD,IAAIpM,IAAI,CAAC;IAClH,MAAM,EAAE4H,GAAG0E,EAAE,EAAE,GAAG7C,QAAQ,AAAC,CAAA,MAAMQ,SAAS9H,KAAK,CAAC;QAACL;KAAK,CAAA,CAAE,CAAC,EAAE,EAAEsI,WAAW;IAExE,MAAMmC,OAAOjK,GAAGM,OAAO,CAAC,+FAA+FuH,GAAG;IAQ1H,MAAMqC,OAAO,IAAIrD;IACjB,KAAK,MAAMoB,OAAOgC,KAAM;QACtB,IAAIL,WAAW,CAACA,QAAQO,GAAG,CAAClC,IAAI5H,IAAI,GAAG;QACvC,MAAM6I,IAAI,IAAIC,UAAUlB,IAAImC,MAAM,CAAC1F,MAAM,EAAEuD,IAAImC,MAAM,CAAC9F,UAAU,EAAEoB,KAAKqC,GAAG,CAACD,WAAWG,IAAImC,MAAM,CAACC,UAAU;QAC3G,IAAIC,MAAM;QACV,IAAK,IAAI9E,IAAI,GAAGA,IAAI0D,EAAEvK,MAAM,EAAE6G,IAAK8E,OAAOpB,CAAC,CAAC1D,EAAE,GAAGwE,EAAE,CAACxE,EAAE;QACtD,MAAMiE,QAAQa,MAAMrC,IAAIX,KAAK;QAC7B,MAAMiD,WAAWL,KAAKjD,GAAG,CAACgB,IAAI5H,IAAI;QAClC,IAAI,CAACkK,YAAYd,QAAQc,SAASd,KAAK,EAAES,KAAKhD,GAAG,CAACe,IAAI5H,IAAI,EAAE;YAAEoJ;YAAOnL,OAAO,CAAC,CAAC,EAAE2J,IAAIuC,UAAU,CAAC,CAAC,EAAEvC,IAAIwC,QAAQ,EAAE;QAAC;IACnH;IACA,OAAO;WAAIP,KAAKpG,OAAO;KAAG,CACvB4G,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,CAACnB,KAAK,GAAGkB,CAAC,CAAC,EAAE,CAAClB,KAAK,EACtChK,KAAK,CAAC,GAAG6C,QACTuD,GAAG,CAAC,CAAC,CAACxF,MAAMuK,EAAE,GAAM,CAAA;YAAEvK;YAAM/B,OAAOsM,EAAEtM,KAAK;YAAEuM,YAAYrB,SAASoB,EAAEnB,KAAK;QAAE,CAAA;AAC/E;AAEA,6FAA6F;AAC7F,mEAAmE;AACnE,OAAO,SAASqB,aAAa9K,EAAgB,EAAEK,IAAY;IACzD,MAAM4H,MAAMjI,GAAGM,OAAO,CAAC,kFAAkF2G,GAAG,CAAC5G;IAC7G,OAAO4H,QAAQ9B;AACjB;AAEA,+FAA+F;AAC/F,uEAAuE;AACvE,OAAO,SAAS4E,aAAa/K,EAAgB,EAAEc,IAAY,EAAET,IAAY,EAAE2K,IAAgE;IACzI,0FAA0F;IAC1F,qFAAqF;IACrF,MAAMC,aAAajL,GAAGM,OAAO,CAAC,+FAA+FuH,GAAG,CAACxH;IACjI,IAAI4K,WAAWtM,MAAM,KAAK,GAAG,OAAO,EAAE;IACtC,MAAMuM,OAAOxF,KAAK6B,GAAG,CAAC,GAAG7B,KAAKyF,IAAI,CAACF,WAAWtM,MAAM,GAAGX;IACvD,MAAMoN,SAASH,WAAW/L,MAAM,CAAC,CAACmM,GAAG3M,IAAMA,IAAIwM,SAAS,GAAGrF,GAAG,CAAC,CAACoC,MAAS,CAAA;YAAE3C,GAAG,IAAI6D,UAAUlB,IAAImC,MAAM,CAAC1F,MAAM,EAAEuD,IAAImC,MAAM,CAAC9F,UAAU,EAAE2D,IAAImC,MAAM,CAACC,UAAU;YAAG/C,OAAOW,IAAIX,KAAK;QAAC,CAAA;IAE/K,MAAM2C,OAAOjK,GAAGM,OAAO,CAAC,yEAAyEuH,GAAG;IACpG,MAAMqC,OAAO,IAAIrD;IACjB,KAAK,MAAMoB,OAAOgC,KAAM;QACtB,IAAIhC,IAAI5H,IAAI,KAAKA,QAAQ2K,KAAKM,OAAO,CAACnB,GAAG,CAAClC,IAAI5H,IAAI,KAAM2K,KAAKpB,OAAO,IAAI,CAACoB,KAAKpB,OAAO,CAACO,GAAG,CAAClC,IAAI5H,IAAI,GAAI;QACtG,MAAMkL,QAAQ,IAAIpC,UAAUlB,IAAImC,MAAM,CAAC1F,MAAM,EAAEuD,IAAImC,MAAM,CAAC9F,UAAU,EAAE2D,IAAImC,MAAM,CAACC,UAAU;QAC3F,KAAK,MAAMP,KAAKsB,OAAQ;YACtB,IAAId,MAAM;YACV,MAAMkB,MAAM9F,KAAKqC,GAAG,CAAC+B,EAAExE,CAAC,CAAC3G,MAAM,EAAE4M,MAAM5M,MAAM;YAC7C,IAAK,IAAI6G,IAAI,GAAGA,IAAIgG,KAAKhG,IAAK8E,OAAOR,EAAExE,CAAC,CAACE,EAAE,GAAG+F,KAAK,CAAC/F,EAAE;YACtD,MAAMiE,QAAQa,MAAMR,EAAExC,KAAK,GAAGW,IAAIX,KAAK;YACvC,MAAMiD,WAAWL,KAAKjD,GAAG,CAACgB,IAAI5H,IAAI;YAClC,IAAIkK,aAAapE,aAAasD,QAAQc,UAAUL,KAAKhD,GAAG,CAACe,IAAI5H,IAAI,EAAEoJ;QACrE;IACF;IAEA,OAAO;WAAIS,KAAKpG,OAAO;KAAG,CACvB4G,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,EAC1BlL,KAAK,CAAC,GAAGuL,KAAKhH,CAAC,EACf6B,GAAG,CAAC,CAAC,CAACmB,GAAGyC,MAAM,GAAM,CAAA;YAAEpJ,MAAM2G;YAAG6D,YAAYrB,SAASC;QAAO,CAAA;AACjE"}

package/dist/esm/index.d.ts

@@ -6,7 +6,7 @@ export type { OpenResult } from './db.js';
 export { clearCache, open } from './db.js';
 export type { SenseErrorCode } from './errors.js';
 export { SenseError } from './errors.js';
-export type { Row } from './output.js';
+export type { Format, Row, RowFormat } from './output.js';
 export { printRows } from './output.js';
 export type { WatchEvent, WatchOptions } from './watch.js';
 export { runWatch } from './watch.js';

package/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/index.ts"],"sourcesContent":["// Public library API. Deliberately small: every export is a stability promise;\n// internals (feature registry, graph, scan, meta) stay module-private.\n\nexport type { Peek, PresetCoverage, SearchOptions, TreeMap } from './commands.ts';\nexport { mapTree, peek, presetCoverage, search } from './commands.ts';\nexport type { Config, EmbedConfig, FeatureName, Preset, ResolvedConfig, SavedQuery, SavedSearch, SearchOverrides } from './config.ts';\nexport { CONFIG_FILENAME, initConfig, loadConfig, migrateConfig, STATE_DIR, SUPPORTED_CONFIG_VERSION } from './config.ts';\nexport type { OpenResult } from './db.ts';\nexport { clearCache, open } from './db.ts';\nexport type { SenseErrorCode } from './errors.ts';\nexport { SenseError } from './errors.ts';\nexport type { Row } from './output.ts';\nexport { printRows } from './output.ts';\n\nexport type { WatchEvent, WatchOptions } from './watch.ts';\nexport { runWatch } from './watch.ts';\n"],"names":["mapTree","peek","presetCoverage","search","CONFIG_FILENAME","initConfig","loadConfig","migrateConfig","STATE_DIR","SUPPORTED_CONFIG_VERSION","clearCache","open","SenseError","printRows","runWatch"],"mappings":"AAAA,+EAA+E;AAC/E,uEAAuE;AAGvE,SAASA,OAAO,EAAEC,IAAI,EAAEC,cAAc,EAAEC,MAAM,QAAQ,gBAAgB;AAEtE,SAASC,eAAe,EAAEC,UAAU,EAAEC,UAAU,EAAEC,aAAa,EAAEC,SAAS,EAAEC,wBAAwB,QAAQ,cAAc;AAE1H,SAASC,UAAU,EAAEC,IAAI,QAAQ,UAAU;AAE3C,SAASC,UAAU,QAAQ,cAAc;AAEzC,SAASC,SAAS,QAAQ,cAAc;AAGxC,SAASC,QAAQ,QAAQ,aAAa"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/index.ts"],"sourcesContent":["// Public library API. Deliberately small: every export is a stability promise;\n// internals (feature registry, graph, scan, meta) stay module-private.\n\nexport type { Peek, PresetCoverage, SearchOptions, TreeMap } from './commands.ts';\nexport { mapTree, peek, presetCoverage, search } from './commands.ts';\nexport type { Config, EmbedConfig, FeatureName, Preset, ResolvedConfig, SavedQuery, SavedSearch, SearchOverrides } from './config.ts';\nexport { CONFIG_FILENAME, initConfig, loadConfig, migrateConfig, STATE_DIR, SUPPORTED_CONFIG_VERSION } from './config.ts';\nexport type { OpenResult } from './db.ts';\nexport { clearCache, open } from './db.ts';\nexport type { SenseErrorCode } from './errors.ts';\nexport { SenseError } from './errors.ts';\nexport type { Format, Row, RowFormat } from './output.ts';\nexport { printRows } from './output.ts';\n\nexport type { WatchEvent, WatchOptions } from './watch.ts';\nexport { runWatch } from './watch.ts';\n"],"names":["mapTree","peek","presetCoverage","search","CONFIG_FILENAME","initConfig","loadConfig","migrateConfig","STATE_DIR","SUPPORTED_CONFIG_VERSION","clearCache","open","SenseError","printRows","runWatch"],"mappings":"AAAA,+EAA+E;AAC/E,uEAAuE;AAGvE,SAASA,OAAO,EAAEC,IAAI,EAAEC,cAAc,EAAEC,MAAM,QAAQ,gBAAgB;AAEtE,SAASC,eAAe,EAAEC,UAAU,EAAEC,UAAU,EAAEC,aAAa,EAAEC,SAAS,EAAEC,wBAAwB,QAAQ,cAAc;AAE1H,SAASC,UAAU,EAAEC,IAAI,QAAQ,UAAU;AAE3C,SAASC,UAAU,QAAQ,cAAc;AAEzC,SAASC,SAAS,QAAQ,cAAc;AAGxC,SAASC,QAAQ,QAAQ,aAAa"}

package/dist/esm/output.d.ts

@@ -33,6 +33,7 @@ export declare function renderMap(result: {
     }>;
     hubs: Row[];
     recent: Row[];
+    recentCaveat: string | null;
 }): string;
 export declare function renderPeek(result: {
     path: string;

package/dist/esm/output.js

@@ -174,7 +174,9 @@ export function renderMap(result) {
     if (result.fieldsTotal > result.fields.length) parts.push(`(+${result.fieldsTotal - result.fields.length} more fields)`);
     if (result.hubs.length > 0) parts.push('\nhubs (by link rank):', renderRows(result.hubs, 'table'));
     else if (result.features.off.includes('rank')) parts.push(`\nhubs: off (${featureOffHint('rank')})`);
-    parts.push('\nrecent:', renderRows(result.recent, 'table'));
+    parts.push('\nrecent:');
+    if (result.recentCaveat) parts.push(result.recentCaveat);
+    parts.push(renderRows(result.recent, 'table'));
     return parts.join('\n');
 }
 export function renderPeek(result) {