sensemaking 0.12.2 → 0.13.0

package/dist/esm/sql-functions.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/sql-functions.ts"],"sourcesContent":["import posix from 'node:path/posix';\nimport type { DatabaseSync } from 'node:sqlite';\nimport { segmentMatch } from './segment.ts';\n\n// has(field, value): JSON-array field -> membership, string field -> substring, NULL -> false.\nexport function registerFunctions(db: DatabaseSync, segmenting: boolean): void {\n  db.function('has', { deterministic: true, varargs: false }, (field: unknown, value: unknown): number => {\n    if (field === null || field === undefined) return 0;\n\n    const needle = String(value);\n\n    if (typeof field === 'string') {\n      if (field.startsWith('[')) {\n        try {\n          const parsed = JSON.parse(field);\n          if (Array.isArray(parsed)) {\n            return parsed.some((item) => String(item) === needle) ? 1 : 0;\n          }\n        } catch {}\n      }\n      return field.includes(needle) ? 1 : 0;\n    }\n\n    return String(field).includes(needle) ? 1 : 0;\n  });\n\n  // Unix basename(path, suffix?): the filename, minus suffix when it ends with one. SQLite\n  // itself has no filename function, and the LIKE tricks that fake one also match folder names.\n  db.function('basename', { deterministic: true, varargs: true }, (path: unknown, suffix?: unknown): string | null => {\n    if (path === null || path === undefined) return null;\n    const name = posix.basename(String(path));\n    const tail = suffix === null || suffix === undefined ? '' : String(suffix);\n    // POSIX: a suffix identical to the whole name is not removed (node's own basename strips it).\n    return tail !== '' && tail !== name && name.endsWith(tail) ? name.slice(0, -tail.length) : name;\n  });\n\n  // Raw `content MATCH '<unspaced text>'` cannot be rewritten behind the author's back, and\n  // matches nothing, so the same transform is available to hand-written SQL by name. `segmenting`\n  // is the same config predicate commands.ts's search() gates on (contentTokenize(cfg) ===\n  // undefined), passed in by open() rather than read back from persisted state.\n  db.function('segment', { deterministic: true, varargs: false }, (terms: unknown): string => {\n    const text = terms === null || terms === undefined ? '' : String(terms);\n    return segmenting ? segmentMatch(text) : text;\n  });\n}\n"],"names":["posix","segmentMatch","registerFunctions","db","segmenting","function","deterministic","varargs","field","value","undefined","needle","String","startsWith","parsed","JSON","parse","Array","isArray","some","item","includes","path","suffix","name","basename","tail","endsWith","slice","length","terms","text"],"mappings":"AAAA,OAAOA,WAAW,kBAAkB;AAEpC,SAASC,YAAY,QAAQ,eAAe;AAE5C,+FAA+F;AAC/F,OAAO,SAASC,kBAAkBC,EAAgB,EAAEC,UAAmB;IACrED,GAAGE,QAAQ,CAAC,OAAO;QAAEC,eAAe;QAAMC,SAAS;IAAM,GAAG,CAACC,OAAgBC;QAC3E,IAAID,UAAU,QAAQA,UAAUE,WAAW,OAAO;QAElD,MAAMC,SAASC,OAAOH;QAEtB,IAAI,OAAOD,UAAU,UAAU;YAC7B,IAAIA,MAAMK,UAAU,CAAC,MAAM;gBACzB,IAAI;oBACF,MAAMC,SAASC,KAAKC,KAAK,CAACR;oBAC1B,IAAIS,MAAMC,OAAO,CAACJ,SAAS;wBACzB,OAAOA,OAAOK,IAAI,CAAC,CAACC,OAASR,OAAOQ,UAAUT,UAAU,IAAI;oBAC9D;gBACF,EAAE,OAAM,CAAC;YACX;YACA,OAAOH,MAAMa,QAAQ,CAACV,UAAU,IAAI;QACtC;QAEA,OAAOC,OAAOJ,OAAOa,QAAQ,CAACV,UAAU,IAAI;IAC9C;IAEA,yFAAyF;IACzF,8FAA8F;IAC9FR,GAAGE,QAAQ,CAAC,YAAY;QAAEC,eAAe;QAAMC,SAAS;IAAK,GAAG,CAACe,MAAeC;QAC9E,IAAID,SAAS,QAAQA,SAASZ,WAAW,OAAO;QAChD,MAAMc,OAAOxB,MAAMyB,QAAQ,CAACb,OAAOU;QACnC,MAAMI,OAAOH,WAAW,QAAQA,WAAWb,YAAY,KAAKE,OAAOW;QACnE,8FAA8F;QAC9F,OAAOG,SAAS,MAAMA,SAASF,QAAQA,KAAKG,QAAQ,CAACD,QAAQF,KAAKI,KAAK,CAAC,GAAG,CAACF,KAAKG,MAAM,IAAIL;IAC7F;IAEA,0FAA0F;IAC1F,gGAAgG;IAChG,yFAAyF;IACzF,8EAA8E;IAC9ErB,GAAGE,QAAQ,CAAC,WAAW;QAAEC,eAAe;QAAMC,SAAS;IAAM,GAAG,CAACuB;QAC/D,MAAMC,OAAOD,UAAU,QAAQA,UAAUpB,YAAY,KAAKE,OAAOkB;QACjE,OAAO1B,aAAaH,aAAa8B,QAAQA;IAC3C;AACF"}

package/dist/esm/watch.d.ts

@@ -1,4 +1,4 @@
-import type { ResolvedConfig } from './config.js';
+import type { ResolvedConfig } from './config/index.js';
 export type WatchEvent = {
     type: 'started';
     baseDir: string;

package/dist/esm/watch.js

@@ -1,6 +1,6 @@
 import { watch as fsWatch } from 'node:fs';
-import { STATE_DIR } from './config.js';
-import { docCount, getMeta, open, reconcile, setMeta } from './db.js';
+import { STATE_DIR } from './config/index.js';
+import { docCount, getMeta, open, reconcile, setMeta } from './db/index.js';
 import { SenseError } from './errors.js';
 // Watch is a cache pre-warmer, not a correctness mechanism: open() always reconciles anyway, so any fs event just triggers a debounced full reconcile.
 const DEBOUNCE_MS = 200;

package/dist/esm/watch.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/watch.ts"],"sourcesContent":["import { watch as fsWatch } from 'node:fs';\nimport type { ResolvedConfig } from './config.ts';\nimport { STATE_DIR } from './config.ts';\nimport { docCount, getMeta, open, reconcile, setMeta } from './db.ts';\nimport { SenseError } from './errors.ts';\n\n// Watch is a cache pre-warmer, not a correctness mechanism: open() always reconciles anyway, so any fs event just triggers a debounced full reconcile.\nconst DEBOUNCE_MS = 200;\nconst HEARTBEAT_INTERVAL_MS = 5000;\nconst STALE_HEARTBEAT_MS = 15000;\n\nexport type WatchEvent = { type: 'started'; baseDir: string; dbPath: string } | { type: 'reconciled'; parsed: number; total: number; warnings: string[] } | { type: 'reconcile-error'; message: string };\n\nexport interface WatchOptions {\n  force?: boolean;\n  onEvent?: (event: WatchEvent) => void;\n}\n\n// Runs in the foreground until SIGINT/SIGTERM. Throws WATCH_ACTIVE if another watcher's heartbeat is still fresh and --force wasn't given.\nexport async function runWatch(cfg: ResolvedConfig, opts: WatchOptions = {}): Promise<void> {\n  const onEvent = opts.onEvent ?? (() => {});\n  const { db, dbPath, warnings: initialWarnings, parsed: initialParsed } = open(cfg);\n  const baseDir = cfg.baseDir;\n\n  const existingHeartbeat = getMeta(db, 'watch_heartbeat');\n  if (existingHeartbeat && !opts.force) {\n    const age = Date.now() - Date.parse(existingHeartbeat);\n    if (age >= 0 && age < STALE_HEARTBEAT_MS) {\n      db.close();\n      throw new SenseError('WATCH_ACTIVE', `another watcher appears active (heartbeat ${Math.round(age / 1000)}s ago); use --force to override`);\n    }\n  }\n\n  onEvent({ type: 'started', baseDir, dbPath });\n  if (initialWarnings.length > 0 || initialParsed > 0) {\n    onEvent({ type: 'reconciled', parsed: initialParsed, total: docCount(db), warnings: initialWarnings });\n  }\n\n  const touchHeartbeat = () => {\n    setMeta(db, 'watch_heartbeat', new Date().toISOString());\n    setMeta(db, 'watch_pid', String(process.pid));\n  };\n  touchHeartbeat();\n\n  let debounceTimer: NodeJS.Timeout | null = null;\n  const scheduleReconcile = () => {\n    if (debounceTimer) clearTimeout(debounceTimer);\n    debounceTimer = setTimeout(() => {\n      debounceTimer = null;\n      try {\n        const { parsed, warnings } = reconcile(db, cfg, baseDir);\n        onEvent({ type: 'reconciled', parsed, total: docCount(db), warnings });\n      } catch (err) {\n        onEvent({ type: 'reconcile-error', message: (err as Error).message });\n      }\n    }, DEBOUNCE_MS);\n  };\n\n  // Ignore our own state dir, or the heartbeat write would retrigger itself forever.\n  const watcher = fsWatch(baseDir, { recursive: true }, (_event, filename) => {\n    if (typeof filename === 'string' && filename.startsWith(STATE_DIR)) return;\n    scheduleReconcile();\n  });\n  const heartbeatTimer = setInterval(touchHeartbeat, HEARTBEAT_INTERVAL_MS);\n\n  return new Promise<void>((resolveShutdown) => {\n    const cleanExit = () => {\n      clearInterval(heartbeatTimer);\n      if (debounceTimer) clearTimeout(debounceTimer);\n      watcher.close();\n      setMeta(db, 'watch_heartbeat', null);\n      setMeta(db, 'watch_pid', null);\n      db.close();\n      resolveShutdown();\n    };\n    process.once('SIGINT', cleanExit);\n    process.once('SIGTERM', cleanExit);\n  });\n}\n"],"names":["watch","fsWatch","STATE_DIR","docCount","getMeta","open","reconcile","setMeta","SenseError","DEBOUNCE_MS","HEARTBEAT_INTERVAL_MS","STALE_HEARTBEAT_MS","runWatch","cfg","opts","onEvent","db","dbPath","warnings","initialWarnings","parsed","initialParsed","baseDir","existingHeartbeat","force","age","Date","now","parse","close","Math","round","type","length","total","touchHeartbeat","toISOString","String","process","pid","debounceTimer","scheduleReconcile","clearTimeout","setTimeout","err","message","watcher","recursive","_event","filename","startsWith","heartbeatTimer","setInterval","Promise","resolveShutdown","cleanExit","clearInterval","once"],"mappings":"AAAA,SAASA,SAASC,OAAO,QAAQ,UAAU;AAE3C,SAASC,SAAS,QAAQ,cAAc;AACxC,SAASC,QAAQ,EAAEC,OAAO,EAAEC,IAAI,EAAEC,SAAS,EAAEC,OAAO,QAAQ,UAAU;AACtE,SAASC,UAAU,QAAQ,cAAc;AAEzC,uJAAuJ;AACvJ,MAAMC,cAAc;AACpB,MAAMC,wBAAwB;AAC9B,MAAMC,qBAAqB;AAS3B,2IAA2I;AAC3I,OAAO,eAAeC,SAASC,GAAmB,EAAEC,OAAqB,CAAC,CAAC;QACzDA;IAAhB,MAAMC,WAAUD,gBAAAA,KAAKC,OAAO,cAAZD,2BAAAA,gBAAiB,KAAO;IACxC,MAAM,EAAEE,EAAE,EAAEC,MAAM,EAAEC,UAAUC,eAAe,EAAEC,QAAQC,aAAa,EAAE,GAAGhB,KAAKQ;IAC9E,MAAMS,UAAUT,IAAIS,OAAO;IAE3B,MAAMC,oBAAoBnB,QAAQY,IAAI;IACtC,IAAIO,qBAAqB,CAACT,KAAKU,KAAK,EAAE;QACpC,MAAMC,MAAMC,KAAKC,GAAG,KAAKD,KAAKE,KAAK,CAACL;QACpC,IAAIE,OAAO,KAAKA,MAAMd,oBAAoB;YACxCK,GAAGa,KAAK;YACR,MAAM,IAAIrB,WAAW,gBAAgB,CAAC,0CAA0C,EAAEsB,KAAKC,KAAK,CAACN,MAAM,MAAM,+BAA+B,CAAC;QAC3I;IACF;IAEAV,QAAQ;QAAEiB,MAAM;QAAWV;QAASL;IAAO;IAC3C,IAAIE,gBAAgBc,MAAM,GAAG,KAAKZ,gBAAgB,GAAG;QACnDN,QAAQ;YAAEiB,MAAM;YAAcZ,QAAQC;YAAea,OAAO/B,SAASa;YAAKE,UAAUC;QAAgB;IACtG;IAEA,MAAMgB,iBAAiB;QACrB5B,QAAQS,IAAI,mBAAmB,IAAIU,OAAOU,WAAW;QACrD7B,QAAQS,IAAI,aAAaqB,OAAOC,QAAQC,GAAG;IAC7C;IACAJ;IAEA,IAAIK,gBAAuC;IAC3C,MAAMC,oBAAoB;QACxB,IAAID,eAAeE,aAAaF;QAChCA,gBAAgBG,WAAW;YACzBH,gBAAgB;YAChB,IAAI;gBACF,MAAM,EAAEpB,MAAM,EAAEF,QAAQ,EAAE,GAAGZ,UAAUU,IAAIH,KAAKS;gBAChDP,QAAQ;oBAAEiB,MAAM;oBAAcZ;oBAAQc,OAAO/B,SAASa;oBAAKE;gBAAS;YACtE,EAAE,OAAO0B,KAAK;gBACZ7B,QAAQ;oBAAEiB,MAAM;oBAAmBa,SAAS,AAACD,IAAcC,OAAO;gBAAC;YACrE;QACF,GAAGpC;IACL;IAEA,mFAAmF;IACnF,MAAMqC,UAAU7C,QAAQqB,SAAS;QAAEyB,WAAW;IAAK,GAAG,CAACC,QAAQC;QAC7D,IAAI,OAAOA,aAAa,YAAYA,SAASC,UAAU,CAAChD,YAAY;QACpEuC;IACF;IACA,MAAMU,iBAAiBC,YAAYjB,gBAAgBzB;IAEnD,OAAO,IAAI2C,QAAc,CAACC;QACxB,MAAMC,YAAY;YAChBC,cAAcL;YACd,IAAIX,eAAeE,aAAaF;YAChCM,QAAQjB,KAAK;YACbtB,QAAQS,IAAI,mBAAmB;YAC/BT,QAAQS,IAAI,aAAa;YACzBA,GAAGa,KAAK;YACRyB;QACF;QACAhB,QAAQmB,IAAI,CAAC,UAAUF;QACvBjB,QAAQmB,IAAI,CAAC,WAAWF;IAC1B;AACF"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/watch.ts"],"sourcesContent":["import { watch as fsWatch } from 'node:fs';\nimport type { ResolvedConfig } from './config/index.ts';\nimport { STATE_DIR } from './config/index.ts';\nimport { docCount, getMeta, open, reconcile, setMeta } from './db/index.ts';\nimport { SenseError } from './errors.ts';\n\n// Watch is a cache pre-warmer, not a correctness mechanism: open() always reconciles anyway, so any fs event just triggers a debounced full reconcile.\nconst DEBOUNCE_MS = 200;\nconst HEARTBEAT_INTERVAL_MS = 5000;\nconst STALE_HEARTBEAT_MS = 15000;\n\nexport type WatchEvent = { type: 'started'; baseDir: string; dbPath: string } | { type: 'reconciled'; parsed: number; total: number; warnings: string[] } | { type: 'reconcile-error'; message: string };\n\nexport interface WatchOptions {\n  force?: boolean;\n  onEvent?: (event: WatchEvent) => void;\n}\n\n// Runs in the foreground until SIGINT/SIGTERM. Throws WATCH_ACTIVE if another watcher's heartbeat is still fresh and --force wasn't given.\nexport async function runWatch(cfg: ResolvedConfig, opts: WatchOptions = {}): Promise<void> {\n  const onEvent = opts.onEvent ?? (() => {});\n  const { db, dbPath, warnings: initialWarnings, parsed: initialParsed } = open(cfg);\n  const baseDir = cfg.baseDir;\n\n  const existingHeartbeat = getMeta(db, 'watch_heartbeat');\n  if (existingHeartbeat && !opts.force) {\n    const age = Date.now() - Date.parse(existingHeartbeat);\n    if (age >= 0 && age < STALE_HEARTBEAT_MS) {\n      db.close();\n      throw new SenseError('WATCH_ACTIVE', `another watcher appears active (heartbeat ${Math.round(age / 1000)}s ago); use --force to override`);\n    }\n  }\n\n  onEvent({ type: 'started', baseDir, dbPath });\n  if (initialWarnings.length > 0 || initialParsed > 0) {\n    onEvent({ type: 'reconciled', parsed: initialParsed, total: docCount(db), warnings: initialWarnings });\n  }\n\n  const touchHeartbeat = () => {\n    setMeta(db, 'watch_heartbeat', new Date().toISOString());\n    setMeta(db, 'watch_pid', String(process.pid));\n  };\n  touchHeartbeat();\n\n  let debounceTimer: NodeJS.Timeout | null = null;\n  const scheduleReconcile = () => {\n    if (debounceTimer) clearTimeout(debounceTimer);\n    debounceTimer = setTimeout(() => {\n      debounceTimer = null;\n      try {\n        const { parsed, warnings } = reconcile(db, cfg, baseDir);\n        onEvent({ type: 'reconciled', parsed, total: docCount(db), warnings });\n      } catch (err) {\n        onEvent({ type: 'reconcile-error', message: (err as Error).message });\n      }\n    }, DEBOUNCE_MS);\n  };\n\n  // Ignore our own state dir, or the heartbeat write would retrigger itself forever.\n  const watcher = fsWatch(baseDir, { recursive: true }, (_event, filename) => {\n    if (typeof filename === 'string' && filename.startsWith(STATE_DIR)) return;\n    scheduleReconcile();\n  });\n  const heartbeatTimer = setInterval(touchHeartbeat, HEARTBEAT_INTERVAL_MS);\n\n  return new Promise<void>((resolveShutdown) => {\n    const cleanExit = () => {\n      clearInterval(heartbeatTimer);\n      if (debounceTimer) clearTimeout(debounceTimer);\n      watcher.close();\n      setMeta(db, 'watch_heartbeat', null);\n      setMeta(db, 'watch_pid', null);\n      db.close();\n      resolveShutdown();\n    };\n    process.once('SIGINT', cleanExit);\n    process.once('SIGTERM', cleanExit);\n  });\n}\n"],"names":["watch","fsWatch","STATE_DIR","docCount","getMeta","open","reconcile","setMeta","SenseError","DEBOUNCE_MS","HEARTBEAT_INTERVAL_MS","STALE_HEARTBEAT_MS","runWatch","cfg","opts","onEvent","db","dbPath","warnings","initialWarnings","parsed","initialParsed","baseDir","existingHeartbeat","force","age","Date","now","parse","close","Math","round","type","length","total","touchHeartbeat","toISOString","String","process","pid","debounceTimer","scheduleReconcile","clearTimeout","setTimeout","err","message","watcher","recursive","_event","filename","startsWith","heartbeatTimer","setInterval","Promise","resolveShutdown","cleanExit","clearInterval","once"],"mappings":"AAAA,SAASA,SAASC,OAAO,QAAQ,UAAU;AAE3C,SAASC,SAAS,QAAQ,oBAAoB;AAC9C,SAASC,QAAQ,EAAEC,OAAO,EAAEC,IAAI,EAAEC,SAAS,EAAEC,OAAO,QAAQ,gBAAgB;AAC5E,SAASC,UAAU,QAAQ,cAAc;AAEzC,uJAAuJ;AACvJ,MAAMC,cAAc;AACpB,MAAMC,wBAAwB;AAC9B,MAAMC,qBAAqB;AAS3B,2IAA2I;AAC3I,OAAO,eAAeC,SAASC,GAAmB,EAAEC,OAAqB,CAAC,CAAC;QACzDA;IAAhB,MAAMC,WAAUD,gBAAAA,KAAKC,OAAO,cAAZD,2BAAAA,gBAAiB,KAAO;IACxC,MAAM,EAAEE,EAAE,EAAEC,MAAM,EAAEC,UAAUC,eAAe,EAAEC,QAAQC,aAAa,EAAE,GAAGhB,KAAKQ;IAC9E,MAAMS,UAAUT,IAAIS,OAAO;IAE3B,MAAMC,oBAAoBnB,QAAQY,IAAI;IACtC,IAAIO,qBAAqB,CAACT,KAAKU,KAAK,EAAE;QACpC,MAAMC,MAAMC,KAAKC,GAAG,KAAKD,KAAKE,KAAK,CAACL;QACpC,IAAIE,OAAO,KAAKA,MAAMd,oBAAoB;YACxCK,GAAGa,KAAK;YACR,MAAM,IAAIrB,WAAW,gBAAgB,CAAC,0CAA0C,EAAEsB,KAAKC,KAAK,CAACN,MAAM,MAAM,+BAA+B,CAAC;QAC3I;IACF;IAEAV,QAAQ;QAAEiB,MAAM;QAAWV;QAASL;IAAO;IAC3C,IAAIE,gBAAgBc,MAAM,GAAG,KAAKZ,gBAAgB,GAAG;QACnDN,QAAQ;YAAEiB,MAAM;YAAcZ,QAAQC;YAAea,OAAO/B,SAASa;YAAKE,UAAUC;QAAgB;IACtG;IAEA,MAAMgB,iBAAiB;QACrB5B,QAAQS,IAAI,mBAAmB,IAAIU,OAAOU,WAAW;QACrD7B,QAAQS,IAAI,aAAaqB,OAAOC,QAAQC,GAAG;IAC7C;IACAJ;IAEA,IAAIK,gBAAuC;IAC3C,MAAMC,oBAAoB;QACxB,IAAID,eAAeE,aAAaF;QAChCA,gBAAgBG,WAAW;YACzBH,gBAAgB;YAChB,IAAI;gBACF,MAAM,EAAEpB,MAAM,EAAEF,QAAQ,EAAE,GAAGZ,UAAUU,IAAIH,KAAKS;gBAChDP,QAAQ;oBAAEiB,MAAM;oBAAcZ;oBAAQc,OAAO/B,SAASa;oBAAKE;gBAAS;YACtE,EAAE,OAAO0B,KAAK;gBACZ7B,QAAQ;oBAAEiB,MAAM;oBAAmBa,SAAS,AAACD,IAAcC,OAAO;gBAAC;YACrE;QACF,GAAGpC;IACL;IAEA,mFAAmF;IACnF,MAAMqC,UAAU7C,QAAQqB,SAAS;QAAEyB,WAAW;IAAK,GAAG,CAACC,QAAQC;QAC7D,IAAI,OAAOA,aAAa,YAAYA,SAASC,UAAU,CAAChD,YAAY;QACpEuC;IACF;IACA,MAAMU,iBAAiBC,YAAYjB,gBAAgBzB;IAEnD,OAAO,IAAI2C,QAAc,CAACC;QACxB,MAAMC,YAAY;YAChBC,cAAcL;YACd,IAAIX,eAAeE,aAAaF;YAChCM,QAAQjB,KAAK;YACbtB,QAAQS,IAAI,mBAAmB;YAC/BT,QAAQS,IAAI,aAAa;YACzBA,GAAGa,KAAK;YACRyB;QACF;QACAhB,QAAQmB,IAAI,CAAC,UAAUF;QACvBjB,QAAQmB,IAAI,CAAC,WAAWF;IAC1B;AACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "sensemaking",
-  "version": "0.12.2",
+  "version": "0.13.0",
   "description": "Query and search your markdown notes with context-aware progressive disclosure: SQL over frontmatter, links, and text, plus semantic search and link-graph ranking. No server, no build step",
   "keywords": [
     "markdown",
@@ -27,6 +27,7 @@
     "notes",
     "obsidian",
     "markdowndb",
+    "mdbase",
     "iwe",
     "silverbullet",
     "logseq",

package/schema.json

@@ -65,6 +65,10 @@
           "type": "boolean",
           "description": "Extract headings into the `sections` table (path, idx, level, heading, start_line, end_line, tokens estimate). Powers `peek`'s outline so agents can read line ranges instead of whole files."
         },
+        "tags": {
+          "type": "boolean",
+          "description": "Extract frontmatter and inline #tags into the `tags` table (path, tag), deduplicated and not distinguishing source -- Obsidian's `file.tags` grain. Nested tags store full (book/scifi); match a parent too with `tag = 'book' OR tag LIKE 'book/%'`."
+        },
         "rank": {
           "type": "boolean",
           "description": "PageRank over resolved links into `frontmatter._rank` at reconcile -- a static importance prior. Powers `map`'s hub list; usable in any ORDER BY. Requires `links`."

package/skills/sense/SKILL.md

@@ -5,7 +5,7 @@ description: "Query a markdown tree with the sense CLI: filter notes by frontmat
 
 # sense
 
-SQL over a markdown tree, kept fresh by a filesystem check on every query. Every file becomes rows in `frontmatter` (one column per key, plus `path`/`_mtime`/`_size`/`_rank`/`_parse_error`), `content` (FTS5: `title`, `summary`, `text`, `path`, plus machine-written `title_seg`/`summary_seg`/`text_seg` sidecars used for matching Chinese, Japanese, Thai, Khmer, Lao, and Burmese text, not for reading), `links` (`src`, `target`, `dst`; `NULL` dst = dead link; one row per distinct written target with alias and anchor stripped, so `[[Foo]]` and `[[Foo|alias]]` are one row while `[[Foo]]` and `[[notes/Foo]]` are two rows that can share a `dst`), `sections` (heading outline with line ranges and token estimates), and `preset_files` (`path`, `preset`: which presets cover which files). Features add their own storage; `map` and `status` report which are on.
+SQL over a markdown tree, kept fresh by a filesystem check on every query. Every file becomes rows in `frontmatter` (one column per key, plus `path`/`_mtime`/`_ctime`/`_size`/`_rank`/`_parse_error`; `_ctime` is filesystem birthtime, which a clone or copy resets just like `_mtime`), `content` (FTS5: `title`, `summary`, `text`, `path`, plus machine-written `title_seg`/`summary_seg`/`text_seg` sidecars used for matching Chinese, Japanese, Thai, Khmer, Lao, and Burmese text, not for reading), `links` (`src`, `target`, `dst`, `embed`; `NULL` dst = dead link; `embed` 1 for `![[...]]` embeds, 0 for links; one row per distinct written target and kind with alias and anchor stripped, so `[[Foo]]` and `[[Foo|alias]]` are one row while `[[Foo]]` and `[[notes/Foo]]` are two rows that can share a `dst`, and a target both linked and embedded is a row of each kind), `tags` (`path`, `tag`: frontmatter and inline `#tags` merged and deduplicated; nested tags stored full, so `book/scifi` matches `tag = 'book' OR tag LIKE 'book/%'`), `sections` (heading outline with line ranges and token estimates), and `preset_files` (`path`, `preset`: which presets cover which files). Features add their own storage; `map` and `status` report which are on.
 
 ## What each tool is for
 
@@ -107,11 +107,11 @@ Worked traces: [EXAMPLES.md](EXAMPLES.md).
 
 ## Setup and upkeep
 
-- Missing CLI: `npm install -g sensemaking`. Missing config: `sense init` at the tree root. Discovery walks up from cwd; `--config <path>` overrides. Setting up or restructuring a tree (presets, frontmatter conventions, note design) is the `sense-setup` skill.
+- Missing CLI: `npm install -g sensemaking`. Missing config: `sense init` at the tree root. Discovery walks up from cwd; `--config <path>` overrides. Setting up or restructuring a tree (presets, frontmatter conventions, note design) is the `sense-setup` skill. Translating an Obsidian Bases `.base` file into equivalent queries is the `sense-bases` skill.
 - `map` and `status` report each preset's coverage (files matched, embedded count). Indexing derives from presets, so the coverage numbers are how you see what a config actually indexes and embeds. A scope with fewer signals just uses fewer (a semantic-off preset searches lexically); a saved search naming an unknown preset errors when run, listing the declared ones.
 - Save a query into `sense.config.json` only when it will be reused; run ad-hoc otherwise.
 - A one-line `summary:` per note is optional and pays twice: it appears in result rows and is a weighted search field. Date comparisons work for dates written as ISO 8601 (`2026-08-12`, or with time and offset); other formats do not compare. Field names in examples (`status`, `tags`, `created`) are illustrative; your tree defines its own.
-- Reserved frontmatter keys (dropped with a warning): `path`, `_mtime`, `_size`, `_rank`, `_parse_error`, `content`, `links`, `sections`.
+- Reserved frontmatter keys (dropped with a warning): `path`, `_mtime`, `_ctime`, `_size`, `_rank`, `_parse_error`, `content`, `links`, `sections`. The `tags` frontmatter column and the `tags` table coexist: the column holds the raw YAML list, the table the merged frontmatter+inline set.
 - A note whose frontmatter does not parse is indexed with **no** frontmatter columns and `_parse_error` set to the YAML message, which carries the line. Nothing is half-recovered: a non-NULL value is a value the author wrote. So a NULL column means the key was absent *or* the note did not parse, and `_parse_error` is how you tell: `WHERE status IS NULL AND _parse_error IS NULL` is "genuinely missing status". List what needs fixing with `sense sql "SELECT path, _parse_error FROM frontmatter WHERE _parse_error IS NOT NULL"`; fixing a file clears it on the next command. `sense status` reports the count.
 - Exit codes: `0` ok, `1` error (SQLite message verbatim), `2` usage (unknown query, wrong param count).
 - Doubted cache: delete the directory `sense status` prints on its `cache:` line. Rarely needed; every query reconciles first.

package/skills/sense-bases/EXAMPLES.md

@@ -0,0 +1,103 @@
+# sense-bases: worked translations
+
+Two real `.base` shapes translated end to end. Field names are illustrative; your tree
+defines its own.
+
+## A. Filtered, sorted table with formulas
+
+The base: notes categorized as Movies, excluding templates, with a "To-watch" view of unseen
+entries sorted by score.
+
+```yaml
+filters:
+  and:
+    - categories.contains(link("Movies"))
+    - '!file.name.contains("Template")'
+views:
+  - type: table
+    name: To-watch
+    filters:
+      and:
+        - last.isEmpty()
+        - rating.isEmpty()
+    order: [file.name, year, scoreImdb, runtime, director]
+    sort:
+      - { property: scoreImdb, direction: DESC }
+      - { property: file.name, direction: ASC }
+```
+
+One view, one query. Base filters AND view filters; `order` is the SELECT list; `sort` the
+ORDER BY. The link comparison is the literal written text (`[[Movies]]`), the name test uses
+`basename` so a folder named Templates does not false-positive:
+
+```sql
+SELECT basename(f.path, '.md') AS name, f.year, f.scoreImdb, f.runtime, f.director
+FROM frontmatter f
+WHERE EXISTS (SELECT 1 FROM json_each(f.categories) WHERE value = '[[Movies]]')
+  AND instr(basename(f.path), 'Template') = 0
+  AND (f.last IS NULL OR f.last = '[null]')
+  AND (f.rating IS NULL OR f.rating = '[null]')
+ORDER BY f.scoreImdb DESC, name ASC
+```
+
+Saved in `sense.config.json` under `queries` as e.g. `to-watch`, it runs as `sense to-watch`.
+
+## B. `this`-relative: the Related pattern
+
+The base: for the current note, every other note ranked by shared outgoing links, including
+anything it links or that links to it.
+
+```yaml
+filters:
+  and:
+    - file.path != this.file.path
+formulas:
+  Related: list(this.file.links).filter(list(file.links).containsAny(value)).unique()
+  LinksOverlap: formula.Related.length
+views:
+  - type: table
+    name: Related
+    filters:
+      or:
+        - formula.LinksOverlap > 2
+        - file.hasLink(this)
+        - this.file.hasLink(file)
+    sort:
+      - { property: formula.LinksOverlap, direction: DESC }
+    limit: 20
+```
+
+`this` becomes one bound path. The chained list formula (`filter(...containsAny).unique()`)
+is set intersection, which SQL states as an IN-filtered count; the `Related` list itself is
+the same rows through `GROUP_CONCAT`:
+
+```sql
+WITH me AS (SELECT ? AS p),
+mine AS (SELECT DISTINCT dst FROM links, me WHERE src = me.p AND dst IS NOT NULL),
+scored AS (
+  SELECT f.path,
+    (SELECT COUNT(DISTINCT l.dst) FROM links l
+      WHERE l.src = f.path AND l.dst IN (SELECT dst FROM mine)) AS overlap,
+    EXISTS (SELECT 1 FROM links, me WHERE src = f.path AND dst = me.p) AS links_to_me,
+    EXISTS (SELECT 1 FROM links, me WHERE src = me.p AND dst = f.path) AS linked_by_me,
+    (SELECT GROUP_CONCAT(DISTINCT l.dst) FROM links l
+      WHERE l.src = f.path AND l.dst IN (SELECT dst FROM mine)) AS shared_links
+  FROM frontmatter f, me WHERE f.path != me.p)
+SELECT path, overlap, shared_links FROM scored
+WHERE overlap > 2 OR links_to_me OR linked_by_me
+ORDER BY overlap DESC
+LIMIT 20
+```
+
+Run as `sense sql "..." current-note.md`, or saved with the `?` in place and the path passed
+as the parameter. The `or:` block reproduces Obsidian's semantics exactly: rows qualify by
+overlap, by linking to the note, or by being linked from it -- so leaf notes the current note
+links to appear even at zero overlap, as they do in Obsidian.
+
+## Notes that recur across translations
+
+- Multiple views over the same base share the base-level filter; write it once per query
+  rather than factoring it out -- saved queries are self-contained by design.
+- `sort` keys referencing formulas sort by the SELECT alias.
+- A `groupBy` view keeps its rows; see the window-function shape in SKILL.md. Only a
+  deliberately collapsed report wants `GROUP BY`.

package/skills/sense-bases/SKILL.md

@@ -0,0 +1,137 @@
+---
+name: sense-bases
+description: "Translate an Obsidian Bases .base file into sense SQL that returns the same rows. Use when asked to convert, import, or reproduce a .base file (or a Bases view, filter, or formula) with sense, or when a markdown tree contains .base files whose views someone wants queryable outside Obsidian."
+---
+
+# sense-bases
+
+A `.base` file is YAML: filters selecting notes, formulas computing values, and views ordering
+and grouping them. Obsidian evaluates it against its own metadata cache; sense holds the same
+data in SQL tables. Every Bases construct that selects or computes rows has a SQL equivalent.
+What has none is presentation (`columnSize`, card layout) -- those change pixels, not rows, so
+a translation loses nothing by ignoring them.
+
+Translate one view to one query: base-level `filters` AND the view's `filters`, the view's
+`order`/`sort`/`limit` as the SELECT list, ORDER BY, and LIMIT. A base with four views becomes
+four queries; saving them under the base's name in `sense.config.json`'s `queries` block keeps
+them runnable as `sense <name>`. The general query surface is the `sense` skill; this one only
+maps Bases constructs onto it.
+
+## Properties
+
+| Bases | sense | notes |
+|---|---|---|
+| `note.field` / bare `field` | `f.<field>` | frontmatter column, same name |
+| `file.name` | `basename(f.path, '.md')` | the Name column: no directory, no extension |
+| a name with extension | `basename(f.path)` | the suffix arg is Unix basename's: present, stripped |
+| `file.folder` | `f.path LIKE 'Folder/%'` | for `inFolder("Folder")` |
+| `file.ext` | `'md'` | sense indexes only markdown |
+| `file.size` | `f._size` | bytes |
+| `file.mtime` | `datetime(f._mtime / 1000, 'unixepoch')` | stored as ms |
+| `file.ctime` | `datetime(f._ctime / 1000, 'unixepoch')` | see the caveat below |
+| `file.tags` | the `tags` table | frontmatter + inline `#tags`, deduplicated, Obsidian's grain |
+| `file.links` | `links WHERE embed = 0` | one row per distinct written target |
+| `file.embeds` | `links WHERE embed = 1` | |
+| `file.backlinks` | `links WHERE dst = f.path` | |
+| `this` | a bound `?` | see below |
+
+`file.ctime` is the filesystem's creation time. A `git clone` or a copy resets it, so on a
+tree that arrived as a checkout, every ctime is the checkout date and age formulas are wrong
+about authorship without being wrong about the filesystem. `map` warns when modification
+times have this shape; creation times share it.
+
+## Predicates
+
+| Bases | sense |
+|---|---|
+| `==` `!=` `>` `<` `>=` `<=` | same |
+| `&&` `\|\|` `!` | `AND` `OR` `NOT` |
+| `and:` / `or:` / `not:` filter blocks | parenthesized `AND` / `OR` / `NOT` |
+| `field.isEmpty()` | `(f.field IS NULL OR f.field = '[null]')` |
+| `file.hasTag("book")` | `EXISTS (SELECT 1 FROM tags WHERE tags.path = f.path AND (tag = 'book' OR tag LIKE 'book/%'))` |
+| `file.hasLink("Note")` | `EXISTS (SELECT 1 FROM links WHERE src = f.path AND dst = 'Note.md')` |
+| `list.contains(x)` | `EXISTS (SELECT 1 FROM json_each(f.list) WHERE value = x)` |
+| `string.contains(x)` | `instr(f.string, x) > 0` |
+| `list.containsAny(...)` | the `json_each` EXISTS with `value IN (...)` |
+| `/regex/.matches(x)` | no SQLite regex; `LIKE`/`GLOB` cover anchored and wildcard shapes |
+
+A field no note in the tree declares has no column at all, so a filter naming it errors with
+`no such column` instead of treating every row as empty. Obsidian's evaluator returns empty
+for unknown properties; SQL does not. Dropping the clause states the same thing the error
+did, and `SELECT name FROM pragma_table_info('frontmatter')` lists what exists.
+
+`isEmpty()`'s second arm exists because a list key written with no items (`tags:` above a bare
+`-`) stores as the JSON text `[null]`: present, not NULL, holding nothing. Obsidian's
+`isEmpty()` is true for it; `IS NULL` alone is not.
+
+`contains(link("Movies"))` compares against a link value. In frontmatter, a list of links
+holds the written text, so the `json_each` comparison value is the literal `[[Movies]]`.
+`hasLink` compares resolved paths: `links.dst` is the resolved target (`NULL` for dead
+links), so the comparison value is the target's path, not its display name.
+
+sense's own `has(field, x)` is looser than both `contains` variants: exact membership on JSON
+arrays but substring on strings, so `has(f.status, 'active')` also matches `inactive`. It
+reads shorter when the field is known to be a list; the `json_each` form is the exact
+translation.
+
+## Formulas
+
+Formulas are SELECT expressions. The Bases functions map onto SQLite's:
+
+| Bases | sense |
+|---|---|
+| `if(c, a, b)` | `iif(c, a, b)` or `CASE WHEN` |
+| `now()` / `today()` | `datetime('now')` / `date('now')` |
+| `date(x)` | `datetime(x)` |
+| `(date1 - date2).days` | `julianday(date1) - julianday(date2)` |
+| `(now() - acquired).months` | `(julianday('now') - julianday(f.acquired)) / 30.44` |
+| `x.round(n)` / `x.toFixed(n)` | `round(x, n)` / `printf('%.2f', x)` |
+| `d.format("YYYY-MM-DD")` | `strftime('%Y-%m-%d', d)` |
+| `x.toString()` | `CAST(x AS TEXT)` |
+| `list.length` | `json_array_length(f.list)` on a JSON column, a COUNT subquery on a table |
+| `list(a).filter(list(b).containsAny(value)).unique()` | an EXISTS-joined subquery; worked example in EXAMPLES.md |
+
+Bases durations are typed; SQL date arithmetic is julianday day-fractions. A formula chaining
+duration fields (`.days.round()`) flattens to arithmetic on the julianday difference.
+
+## Views
+
+- `sort:` (multi-key, each with direction) -> `ORDER BY a DESC, b ASC`. `limit:` -> `LIMIT`.
+- `groupBy` does not collapse rows -- Obsidian shows every row bucketed under headers with
+  per-group summaries. The SQL producing the same rows and numbers is ordering plus window
+  functions, not GROUP BY:
+
+  ```sql
+  SELECT f.path, f.status, f.days,
+         AVG(f.days)  OVER (PARTITION BY f.status) AS group_avg,
+         COUNT(*)     OVER (PARTITION BY f.status) AS group_n
+  FROM frontmatter f WHERE f.days IS NOT NULL
+  ORDER BY f.status, f.days DESC
+  ```
+
+  A collapsed one-row-per-group report is plain `GROUP BY` -- that is a different result than
+  the Bases view shows.
+- View `summaries` (Sum, Average, Median via ordering, Unique, Filled, Checked) are the
+  matching aggregates, windowed as above to keep the rows, or a separate aggregate query.
+
+## `this`
+
+`this` is the note the base is evaluated against: the embedding note, or Obsidian's active
+pane. sense has no pane, so the caller supplies the path as a bound parameter -- `sense sql
+"..." <path>`, or a saved query run as `sense <name> <path>`. A CTE keeps it single-bind:
+
+```sql
+WITH me AS (SELECT ? AS p)
+```
+
+and every `this.file.*` expression joins `me`. The full Related.base translation in
+EXAMPLES.md is the worked case: link overlap, mutual-link filters, and the shared-target list
+via `GROUP_CONCAT`, all from one bound path.
+
+## Not translatable, and why it costs nothing
+
+- `columnSize`, card/table/list/map chrome: pixel layout over the same rows.
+- Obsidian choosing `this` from the active pane: there is no pane; the path parameter is the
+  resolution.
+- Live re-evaluation as files change: every sense query reconciles against the filesystem
+  first, so the freshness is already there; nothing re-renders on its own.

package/skills/sense-setup/SKILL.md

@@ -38,7 +38,7 @@ A preset is a named, self-contained bundle of settings. `default` (required) is
 
 These belong to the tree's owner. sense works with any of them and reads no instruction files of its own; each choice only changes what queries can do.
 
-- **Frontmatter fields.** Columns are discovered per tree: whatever keys notes declare become queryable. Consistent fields across notes make SQL filters and saved queries possible (`WHERE status = 'active'`). SQLite's compiled column limit (2,000; sqlite.org/limits.html) bounds distinct keys per tree. The crawl stops with an error naming the count and the levers. Reserved keys (dropped with a warning): `path`, `_mtime`, `_size`, `_rank`, `content`, `links`, `sections`. Values keep their YAML type: strings TEXT, whole numbers and booleans INTEGER (`true` is 1), fractions REAL, lists and maps JSON text; `map` prints the observed type per field.
+- **Frontmatter fields.** Columns are discovered per tree: whatever keys notes declare become queryable. Consistent fields across notes make SQL filters and saved queries possible (`WHERE status = 'active'`). SQLite's compiled column limit (2,000; sqlite.org/limits.html) bounds distinct keys per tree. The crawl stops with an error naming the count and the levers. Reserved keys (dropped with a warning): `path`, `_mtime`, `_ctime`, `_size`, `_rank`, `content`, `links`, `sections`. Values keep their YAML type: strings TEXT, whole numbers and booleans INTEGER (`true` is 1), fractions REAL, lists and maps JSON text; `map` prints the observed type per field.
 - **Presets are path-shaped; frontmatter is state-shaped.** A preset's coverage must be computable from the path alone (it decides indexing, baked into the cache). Volatile state (`status`, `project`, dates) lives in frontmatter and filters at query time (`where`, `has()`, `datetime()`). A state worth different *indexing* (retired memory, superseded sources) is a state worth moving the file: the archive-folder pattern in EXAMPLES.md.
 - **What a note omits is also a filter.** A layer that deliberately carries none of the fields the saved views filter on is excluded from all of them without any view naming the layer. Sparse fields cut both ways: less of the tree filters when you want breadth, and exactly this separation when layers differ in authority.
 - **Dates.** `datetime()` comparisons work for dates written as ISO 8601, the only format it parses. A tree that mixes date formats can store them, but can't compare them in SQL.

package/dist/cjs/commands.d.cts

@@ -1,58 +0,0 @@
-import type { DatabaseSync } from 'node:sqlite';
-import type { FeatureName, ResolvedConfig, SearchOverrides } from './config.js';
-import type { Row } from './output.js';
-export interface SearchOptions {
-    k?: number;
-    where?: string;
-    preset?: string;
-    include?: string[];
-    exclude?: string[];
-    noExclude?: boolean;
-}
-export declare function search(db: DatabaseSync, cfg: ResolvedConfig, terms: string, opts?: SearchOptions): Promise<Row[]>;
-export declare function scopedPaths(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides): Set<string>;
-export interface PresetCoverage {
-    name: string;
-    files: number;
-    embedded: number;
-    semantic: boolean;
-}
-export declare function presetCoverage(db: DatabaseSync, cfg: ResolvedConfig): PresetCoverage[];
-export interface TreeMap {
-    docs: {
-        count: number;
-        bytes: number;
-    };
-    fields: Row[];
-    fieldsTotal: number;
-    features: {
-        on: FeatureName[];
-        off: FeatureName[];
-    };
-    presets: PresetCoverage[];
-    hubs: Row[];
-    recent: Row[];
-    recentCaveat: string | null;
-}
-export declare function mapTree(db: DatabaseSync, cfg: ResolvedConfig, overrides?: SearchOverrides): TreeMap;
-export declare function resolveNote(paths: string[], arg: string): string;
-export interface Peek {
-    path: string;
-    tokens: number;
-    frontmatter: Row;
-    parseError: string | null;
-    sections: Row[];
-    outbound: string[];
-    backlinks: string[];
-    unresolved: string[];
-    sectionsTotal: number;
-    outboundTotal: number;
-    backlinksTotal: number;
-    unresolvedTotal: number;
-    off: FeatureName[];
-}
-export declare function peek(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides?: SearchOverrides): Peek;
-export declare function relatedNotes(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides: SearchOverrides, k: number): Promise<Array<{
-    path: string;
-    similarity: number;
-}>>;

package/dist/cjs/commands.d.ts

@@ -1,58 +0,0 @@
-import type { DatabaseSync } from 'node:sqlite';
-import type { FeatureName, ResolvedConfig, SearchOverrides } from './config.js';
-import type { Row } from './output.js';
-export interface SearchOptions {
-    k?: number;
-    where?: string;
-    preset?: string;
-    include?: string[];
-    exclude?: string[];
-    noExclude?: boolean;
-}
-export declare function search(db: DatabaseSync, cfg: ResolvedConfig, terms: string, opts?: SearchOptions): Promise<Row[]>;
-export declare function scopedPaths(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides): Set<string>;
-export interface PresetCoverage {
-    name: string;
-    files: number;
-    embedded: number;
-    semantic: boolean;
-}
-export declare function presetCoverage(db: DatabaseSync, cfg: ResolvedConfig): PresetCoverage[];
-export interface TreeMap {
-    docs: {
-        count: number;
-        bytes: number;
-    };
-    fields: Row[];
-    fieldsTotal: number;
-    features: {
-        on: FeatureName[];
-        off: FeatureName[];
-    };
-    presets: PresetCoverage[];
-    hubs: Row[];
-    recent: Row[];
-    recentCaveat: string | null;
-}
-export declare function mapTree(db: DatabaseSync, cfg: ResolvedConfig, overrides?: SearchOverrides): TreeMap;
-export declare function resolveNote(paths: string[], arg: string): string;
-export interface Peek {
-    path: string;
-    tokens: number;
-    frontmatter: Row;
-    parseError: string | null;
-    sections: Row[];
-    outbound: string[];
-    backlinks: string[];
-    unresolved: string[];
-    sectionsTotal: number;
-    outboundTotal: number;
-    backlinksTotal: number;
-    unresolvedTotal: number;
-    off: FeatureName[];
-}
-export declare function peek(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides?: SearchOverrides): Peek;
-export declare function relatedNotes(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides: SearchOverrides, k: number): Promise<Array<{
-    path: string;
-    similarity: number;
-}>>;

package/dist/cjs/commands.js.map

@@ -1 +0,0 @@
-{"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":["mapTree","peek","presetCoverage","relatedNotes","resolveNote","scopedPaths","search","WEIGHTED_BM25","RRF_K","SNIPPET_BOUND","EXCERPT_WINDOW","extractBareTerms","query","cleaned","replace","split","map","tok","toLowerCase","trim","filter","length","findOccurrences","haystackLower","terms","occ","term","idx","found","indexOf","push","start","end","sort","a","b","bestWindowStart","windowSize","best","bestDistinct","bestCount","i","winEnd","seen","Set","count","j","add","size","computeExcerpt","text","Math","min","excerpt","slice","offset","out","cursor","o","prefix","suffix","lineNumberAt","line","charCodeAt","lineRangeFor","db","path","row","prepare","get","start_line","end_line","inScope","include","exclude","some","g","matchesGlob","scopeHasEmbeddings","cfg","anyPresetEmbeds","rows","all","r","has","opts","hits","chunkLines","chunkSimilarity","effective","k","allPaths","scopePaths","scopeActive","allowedPaths","fetch","wantsVectors","semanticEnabled","scope","whereJoin","whereCond","scopeCond","matchSql","matchRows","oversized","candidates","edges","linked","seeds","ranked","vec","insert","c","where","similarityCol","bareTerms","resolveSearch","rawScope","narrowByWhere","err","searchError","max","semantic","modelPresent","SenseError","presetName","materializeScope","contentTokenize","undefined","segmentMatch","Map","hit","forEach","set","score","via","featureEnabled","linkEdges","flat","personalizedRank","existing","semanticCandidates","lines","similarity","exec","run","readFileSync","join","baseDir","overrides","adHocScope","noExclude","paths","p","whereRows","wherePaths","embedActive","presetNames","name","files","n","embedded","presetSemanticEnabled","INTERNAL_COLUMNS","MAP_COLUMN_CHUNK","chunk","items","table","JSON","stringify","setupMapScope","scopeWhere","scopeAnd","docs","columns","allFields","group","exprs","quoted","result","field","coverage","type","fields","hubs","recent","topSecond","recentCaveat","fieldsTotal","features","featureStates","presets","arg","exact","find","base","posix","basename","matches","PEEK_LIST_LIMIT","pathArg","parseError","_parse_error","frontmatter","Object","entries","key","value","sectionsTotal","sections","outbound","backlinks","unresolved","backlinksTotal","_allowed","l","dst","target","src","tokens","ceil","_size","outboundTotal","unresolvedTotal","off","allowed","embedEnabled","embedPending","hasEmbedding","similarNotes"],"mappings":";;;;;;;;;;;QAuXgBA;eAAAA;;QAyEAC;eAAAA;;QAvHAC;eAAAA;;QAqKMC;eAAAA;;QAnFNC;eAAAA;;QAjGAC;eAAAA;;QAxKMC;eAAAA;;;sBAlJO;wBACK;4DAChB;wBAG+H;wBACtH;uBACgE;uBACjE;uBACO;6BAEL;yBACC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAE7B,2EAA2E;AAC3E,gFAAgF;AAEhF,6FAA6F;AAC7F,iEAAiE;AACjE,IAAMC,gBAAgB;AACtB,IAAMC,QAAQ;AAEd,iFAAiF;AACjF,8EAA8E;AAC9E,IAAMC,gBAAgB;AACtB,IAAMC,iBAAiB;AAEvB,8FAA8F;AAC9F,qEAAqE;AACrE,SAASC,iBAAiBC,KAAa;IACrC,IAAMC,UAAUD,MACbE,OAAO,CAAC,MAAM,KACdA,OAAO,CAAC,UAAU,KAClBA,OAAO,CAAC,mCAAmC;IAC9C,OAAOD,QACJE,KAAK,CAAC,OACNC,GAAG,CAAC,SAACC;eAAQA,IAAIH,OAAO,CAAC,kBAAkB;OAAK,iCAAiC;KACjFE,GAAG,CAAC,SAACC;eAAQA,IAAIC,WAAW,GAAGC,IAAI;OACnCC,MAAM,CAAC,SAACH;eAAQA,IAAII,MAAM,GAAG;;AAClC;AAEA,SAASC,gBAAgBC,aAAqB,EAAEC,KAAe;IAC7D,IAAMC,MAA2D,EAAE;QAC9D,kCAAA,2BAAA;;QAAL,QAAK,YAAcD,0BAAd,SAAA,6BAAA,QAAA,yBAAA,iCAAqB;YAArB,IAAME,OAAN;YACH,IAAIC,MAAM;YACV,OAAS;gBACP,IAAMC,QAAQL,cAAcM,OAAO,CAACH,MAAMC;gBAC1C,IAAIC,UAAU,CAAC,GAAG;gBAClBH,IAAIK,IAAI,CAAC;oBAAEC,OAAOH;oBAAOI,KAAKJ,QAAQF,KAAKL,MAAM;oBAAEK,MAAAA;gBAAK;gBACxDC,MAAMC,QAAQF,KAAKL,MAAM;YAC3B;QACF;;QARK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IASL,mFAAmF;IACnF,+EAA+E;IAC/E,OAAOI,IAAIQ,IAAI,CAAC,SAACC,GAAGC;eAAMD,EAAEH,KAAK,GAAGI,EAAEJ,KAAK,IAAII,EAAEH,GAAG,GAAGE,EAAEF,GAAG;;AAC9D;AAEA,wFAAwF;AACxF,6DAA6D;AAC7D,SAASI,gBAAgBX,GAAwD,EAAEY,UAAkB;IACnG,IAAIC,OAAOb,GAAG,CAAC,EAAE,CAACM,KAAK;IACvB,IAAIQ,eAAe;IACnB,IAAIC,YAAY;IAChB,IAAK,IAAIC,IAAI,GAAGA,IAAIhB,IAAIJ,MAAM,EAAEoB,IAAK;QACnC,IAAMC,SAASjB,GAAG,CAACgB,EAAE,CAACV,KAAK,GAAGM;QAC9B,IAAMM,OAAO,IAAIC;QACjB,IAAIC,QAAQ;QACZ,IAAK,IAAIC,IAAIL,GAAGK,IAAIrB,IAAIJ,MAAM,IAAII,GAAG,CAACqB,EAAE,CAACf,KAAK,GAAGW,QAAQI,IAAK;YAC5DH,KAAKI,GAAG,CAACtB,GAAG,CAACqB,EAAE,CAACpB,IAAI;YACpBmB;QACF;QACA,IAAIF,KAAKK,IAAI,GAAGT,gBAAiBI,KAAKK,IAAI,KAAKT,gBAAgBM,QAAQL,WAAY;YACjFF,OAAOb,GAAG,CAACgB,EAAE,CAACV,KAAK;YACnBQ,eAAeI,KAAKK,IAAI;YACxBR,YAAYK;QACd;IACF;IACA,OAAOP;AACT;AAEA,uFAAuF;AACvF,uFAAuF;AACvF,SAASW,eAAeC,IAAY,EAAE1B,KAAe;IACnD,IAAMC,MAAMH,gBAAgB4B,KAAKhC,WAAW,IAAIM;IAChD,IAAIC,IAAIJ,MAAM,KAAK,GAAG;QACpB,iFAAiF;QACjF,qFAAqF;QACrF,sFAAsF;QACtF,IAAMW,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEX;QAClC,OAAO;YAAE2C,SAAS,AAAC,GAAmDrB,OAAjDkB,KAAKI,KAAK,CAAC,GAAGtB,KAAKlB,OAAO,CAAC,QAAQ,KAAKK,IAAI,IAAkC,OAA7Ba,MAAMkB,KAAK7B,MAAM,GAAG,MAAM;YAAMkC,QAAQ;QAAE;IAClH;IACA,IAAMxB,QAAQK,gBAAgBX,KAAKf;IACnC,IAAMsB,OAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEU,QAAQrB;IAC1C,IAAI8C,MAAM;IACV,IAAIC,SAAS1B;QACR,kCAAA,2BAAA;;QAAL,QAAK,YAAWN,wBAAX,SAAA,6BAAA,QAAA,yBAAA,iCAAgB;YAAhB,IAAMiC,IAAN;YACH,IAAIA,EAAE3B,KAAK,GAAGA,SAAS2B,EAAE1B,GAAG,GAAGA,MAAK;YACpC,sFAAsF;YACtF,gFAAgF;YAChF,IAAI0B,EAAE3B,KAAK,GAAG0B,QAAQ;YACtBD,OAAO,AAAC,GAAiCN,OAA/BA,KAAKI,KAAK,CAACG,QAAQC,EAAE3B,KAAK,GAAE,QAA8B,OAA3BmB,KAAKI,KAAK,CAACI,EAAE3B,KAAK,EAAE2B,EAAE1B,GAAG,GAAE;YACpEyB,SAASC,EAAE1B,GAAG;QAChB;;QAPK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAQLwB,OAAON,KAAKI,KAAK,CAACG,QAAQzB;IAC1B,IAAM2B,SAAS5B,QAAQ,IAAI,MAAM;IACjC,IAAM6B,SAAS5B,OAAMkB,KAAK7B,MAAM,GAAG,MAAM;IACzC,OAAO;QAAEgC,SAAS,AAAC,GAAWG,OAATG,QAAoCC,OAA3BJ,IAAI1C,OAAO,CAAC,QAAQ,MAAc,OAAP8C;QAAUL,QAAQxB;IAAM;AACnF;AAEA,SAAS8B,aAAaX,IAAY,EAAEK,MAAc;IAChD,IAAIO,OAAO;IACX,IAAK,IAAIrB,IAAI,GAAGA,IAAIc,QAAQd,IAAK,IAAIS,KAAKa,UAAU,CAACtB,OAAO,IAAIqB;IAChE,OAAOA;AACT;AAEA,SAASE,aAAaC,EAAgB,EAAEC,IAAY,EAAEJ,IAAY;IAChE,IAAMK,MAAMF,GAAGG,OAAO,CAAC,qIAAqIC,GAAG,CAACH,MAAMJ,MAAMA;IAC5K,OAAOK,MAAM,AAAC,IAAqBA,OAAlBA,IAAIG,UAAU,EAAC,KAAgB,OAAbH,IAAII,QAAQ,IAAK;AACtD;AAWA,yFAAyF;AACzF,4FAA4F;AAC5F,+EAA+E;AAC/E,SAASC,QAAQN,IAAY,EAAEO,OAAiB,EAAEC,OAAkB;IAClE,IAAI,CAACD,QAAQE,IAAI,CAAC,SAACC;eAAMC,IAAAA,qBAAW,EAACX,MAAMU;QAAK,OAAO;IACvD,IAAIF,oBAAAA,8BAAAA,QAASC,IAAI,CAAC,SAACC;eAAMC,IAAAA,qBAAW,EAACX,MAAMU;QAAK,OAAO;IACvD,OAAO;AACT;AAEA,SAASE,mBAAmBb,EAAgB,EAAEc,GAAmB,EAAE1E,WAAwB;IACzF,IAAI,CAAC2E,IAAAA,yBAAe,EAACD,MAAM,OAAO,OAAO,yDAAyD;IAClG,IAAME,OAAOhB,GAAGG,OAAO,CAAC,0CAA0Cc,GAAG;IACrE,OAAOD,KAAKN,IAAI,CAAC,SAACQ;eAAM9E,YAAY+E,GAAG,CAACD,EAAEjB,IAAI;;AAChD;AAIO,SAAe5D;wCAAO2D,EAAgB,EAAEc,GAAmB,EAAEvD,KAAa;YAAE6D,MA+GZC,WAAwBC,iBAA8BC,sBA9GrHC,WACEC,GAEFC,UACAC,YACAC,aAIFC,cAMEC,OAIAC,cAIAC,iBAYAC,OACAC,WACAC,WAMAC,WAMAC,UACA1F,OACF2F,WAOEjB,MAGAkB,WACAC,YAKAC,OAIEC,QACAC,OACAC,QAiBFtB,YACAC,iBAEEsB,KAgBFC,QACD,2BAAA,mBAAA,gBAAA,WAAA,oBAAO7C,MAAM8C,GAKZC,OAGAC,eACAjC,MASEkC,WACD,4BAAA,oBAAA,iBAAA,YAAA,QAAMhD,KAELjB,MAMwBD,iBAApBI,SAASE;;;;;oBA1I4D8B,OAAAA,oEAAsB,CAAC;oBAClGI,YAAY2B,IAAAA,uBAAa,EAACrC,KAAKM;oBAC7BK,IAAMD,UAANC;oBAEFC,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBAC5G0B,aAAayB,SAASpD,IAAIc,KAAKM,MAAMM;oBACrCE,cAAcD,WAAW5C,IAAI,GAAG2C,SAAStE,MAAM;oBAKrD,IAAI;wBACFyE,eAAewB,cAAcrD,IAAI2B,YAAYH,UAAUwB,KAAK;oBAC9D,EAAE,OAAOM,KAAK;wBACZ,MAAMC,IAAAA,0BAAW,EAACD,KAAc/F,OAAOiE,UAAUwB,KAAK;oBACxD;oBACMlB,QAAQ5C,KAAKsE,GAAG,CAAC/B,IAAI,GAAG;oBAE9B,6FAA6F;oBAC7F,6FAA6F;oBACvFM,eAAeP,UAAUiC,QAAQ,IAAI1C,IAAAA,yBAAe,EAACD;oBAC3D,IAAIiB,gBAAgB,CAAC2B,IAAAA,qBAAY,EAAC5C,MAAM;wBACtC,MAAM,IAAI6C,oBAAU,CAAC,uBAAuB,AAAC,WAA+B,OAArBnC,UAAUoC,UAAU,EAAC;oBAC9E;oBACM5B,kBAAkBD,gBAAgBlB,mBAAmBb,IAAIc,KAAKe;oBAEpE,4FAA4F;oBAC5F,0FAA0F;oBAC1F,yFAAyF;oBACzF,wFAAwF;oBACxF,sFAAsF;oBACtF,6FAA6F;oBAC7F,mDAAmD;oBACnD,UAAU;oBACV,6FAA6F;oBAC7F,wDAAwD;oBAClDI,QAAQT,UAAUwB,KAAK;oBACvBd,YAAYD,QAAQ,kDAAkD;oBACtEE,YAAYF,QAAQ,AAAC,QAAa,OAANA,OAAM,OAAK;oBAC7C,yFAAyF;oBACzF,uFAAuF;oBACvF,sFAAsF;oBACtF,uEAAuE;oBACvE,IAAIL,aAAaiC,iBAAiB7D,IAAI,iBAAiB2B;oBACjDS,YAAYR,cAAc,2DAA2D;oBAC3F,4DAA4D;oBAC5D,yEAAyE;oBACzE,yFAAyF;oBACzF,sFAAsF;oBACtF,6EAA6E;oBACvES,WAAW,AAAC,kEAAgKH,OAA/F1F,eAAc,yFAAoH2F,OAAnCD,WAAU,2BAAsCE,OAAbD,WAAU,KAAyB7F,OAAtB8F,WAAU,cAAmCN,OAAvBxF,eAAc,WAAe,OAANwF;oBACzQnF,QAAQmH,IAAAA,yBAAe,EAAChD,SAASiD,YAAYC,IAAAA,uBAAY,EAACzG,SAASA;oBAEzE,IAAI;wBACF+E,YAAYtC,GAAGG,OAAO,CAACkC,UAAUpB,GAAG,CAACtE;oBACvC,EAAE,OAAO2G,KAAK;wBACZ,MAAMC,IAAAA,0BAAW,EAACD,KAAc/F,OAAO0E;oBACzC;oBAEMZ,OAAO,IAAI4C,IAAI3B,UAAUvF,GAAG,CAAC,SAACmE;+BAAM;4BAACA,EAAEjB,IAAI;4BAAEiB,EAAEgD,GAAG;yBAAC;;oBACzD,wFAAwF;oBACxF,4EAA4E;oBACtE3B,YAAY,IAAI5D,IAAI2D,UAAUnF,MAAM,CAAC,SAAC+D;+BAAMA,EAAEgD,GAAG,KAAK;uBAAMnH,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBAC7EuC,aAAa,IAAIyB;oBACvB3B,UAAU6B,OAAO,CAAC,SAACjD,GAAG1C;wBACpBgE,WAAW4B,GAAG,CAAClD,EAAEjB,IAAI,EAAE;4BAAEoE,OAAO,IAAK9H,CAAAA,QAAQiC,CAAAA;4BAAI8F,KAAK;wBAAQ;oBAChE;oBAEM7B,QAAQ8B,IAAAA,wBAAc,EAACzD,KAAK,YAAYwB,UAAUlF,MAAM,GAAG,IAAIoH,IAAAA,kBAAS,EAACxE;oBAC/E,IAAIyC,MAAMrF,MAAM,GAAG,GAAG;wBACpB,yFAAyF;wBACzF,uFAAuF;wBACjFsF,SAAS,IAAI/D,IAAI8D,MAAMgC,IAAI;wBAC3B9B,QAAQ,IAAIsB,IAAI3B,UAAUvF,GAAG,CAAC,SAACmE,GAAG1C;mCAAM;gCAAC0C,EAAEjB,IAAI;gCAAE,IAAKzB,CAAAA,IAAI,CAAA;6BAAG;;wBAC7DoE,SAAS,AAAC,qBAAG8B,IAAAA,yBAAgB,EAAChD,UAAUe,OAAOE,QAClDxF,MAAM,CAAC;qEAAE8C,kBAAMoE;mCAAWA,QAAQ,QAAQxC,aAAaV,GAAG,CAAClB;2BAC3DjC,IAAI,CAAC,SAACC,GAAGC;mCAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE;2BAC1BoB,KAAK,CAAC,GAAGyC;wBACZc,OAAOuB,OAAO,CAAC,gBAAS3F;qEAAPyB;4BACf,IAAM0E,WAAWnC,WAAWpC,GAAG,CAACH;4BAChC,IAAI0E,UAAU;gCACZA,SAASN,KAAK,IAAI,IAAK9H,CAAAA,QAAQiC,CAAAA;gCAC/B,IAAIkE,OAAOvB,GAAG,CAAClB,OAAO0E,SAASL,GAAG,GAAG;4BACvC,OAAO;gCACL9B,WAAW4B,GAAG,CAACnE,MAAM;oCAAEoE,OAAO,IAAK9H,CAAAA,QAAQiC,CAAAA;oCAAI8F,KAAK;gCAAO;4BAC7D;wBACF;oBACF;oBAEA,sFAAsF;oBACtF,0EAA0E;oBACpEhD,aAAa,IAAI2C;oBACjB1C,kBAAkB,IAAI0C;yBACxBjC,iBAAAA;;;;oBACU;;wBAAM4C,IAAAA,2BAAkB,EAAC5E,IAAIc,KAAKvD,OAAOuE,OAAOD;;;oBAAtDgB,MAAM;oBACZA,IAAIsB,OAAO,CAAC,gBAA8B3F;4BAA3ByB,aAAAA,MAAM4E,cAAAA,OAAOC,mBAAAA;wBAC1BxD,WAAW8C,GAAG,CAACnE,MAAM4E;wBACrBtD,gBAAgB6C,GAAG,CAACnE,MAAM6E;wBAC1B,IAAMH,WAAWnC,WAAWpC,GAAG,CAACH;wBAChC,IAAI0E,UAAU;4BACZA,SAASN,KAAK,IAAI,IAAK9H,CAAAA,QAAQiC,CAAAA;4BAC/BmG,SAASL,GAAG,GAAG,AAAC,GAAe,OAAbK,SAASL,GAAG,EAAC;wBACjC,OAAO;4BACL9B,WAAW4B,GAAG,CAACnE,MAAM;gCAAEoE,OAAO,IAAK9H,CAAAA,QAAQiC,CAAAA;gCAAI8F,KAAK;4BAAS;wBAC/D;oBACF;;;oBAGFtE,GAAG+E,IAAI,CAAC;oBACR/E,GAAG+E,IAAI,CAAC;oBACFjC,SAAS9C,GAAGG,OAAO,CAAC;oBACrB,kCAAA,2BAAA;;wBAAL,IAAK,YAAmBqC,iCAAnB,6BAAA,QAAA,yBAAA;2DAAA,iBAAOvC,uBAAM8C;4BAAkBD,OAAOkC,GAAG,CAAC/E,MAAM8C,EAAEsB,KAAK,EAAEtB,EAAEuB,GAAG,GAAEjD,YAAAA,KAAKjB,GAAG,CAACH,mBAAToB,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWlB,GAAG,CAACH,mBAAfqB,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBnB,GAAG,CAACH,mBAApBsB,kCAAAA,uBAA6B;;;wBAAnJ;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAEL,yFAAyF;oBACzF,2FAA2F;oBAC3F,8BAA8B;oBACxByB,QAAQf,QAAQ,AAAC,UAAe,OAANA,OAAM,OAAK;oBAC3C,sFAAsF;oBACtF,2FAA2F;oBACrFgB,gBAAgBjB,kBAAkB,yBAAyB;oBAC3DhB,OAAOhB,GACVG,OAAO,CACN,AAAC,qIAEE6C,OAFkIC,eAAc,gIAE1I,OAAND,OAAM,yCAEV/B,GAAG,CAACQ;oBAEP,IAAIc,UAAUxD,IAAI,GAAG,GAAG;wBAChBmE,YAAYxG,iBAAiBa;wBAC9B,mCAAA,4BAAA;;4BAAL,IAAK,aAAayD,2BAAb,8BAAA,SAAA,0BAAA,kCAAmB;gCAAbd,MAAN;gCACH,IAAIA,IAAIgE,GAAG,KAAK,QAAQ,CAAC3B,UAAUpB,GAAG,CAACjB,IAAID,IAAI,GAAa;gCACxDhB,OAAAA,KAAAA;gCACJ,IAAI;oCACFA,OAAOgG,IAAAA,oBAAY,EAACC,IAAAA,cAAI,EAACpE,IAAIqE,OAAO,EAAEjF,IAAID,IAAI,GAAa;gCAC7D,EAAE,eAAM;oCACN,UAAU,mEAAmE;gCAC/E;gCAC4BjB,kBAAAA,eAAeC,MAAMiE,YAAzC9D,UAAoBJ,gBAApBI,SAASE,SAAWN,gBAAXM;gCACjBY,IAAIgE,GAAG,GAAG9E;gCACV,IAAIc,IAAI2E,KAAK,IAAI,MAAM3E,IAAI2E,KAAK,GAAGN,IAAAA,wBAAc,EAACzD,KAAK,cAAcf,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;4BAC1I;;4BAXK;4BAAA;;;qCAAA,8BAAA;oCAAA;;;oCAAA;0CAAA;;;;oBAYP;oBAEA;;wBAAO0B;;;;IACT;;AAEA,2FAA2F;AAC3F,uFAAuF;AACvF,mDAAmD;AACnD,SAASoC,SAASpD,EAAgB,EAAEc,GAAmB,EAAEsE,SAA0B,EAAE1D,QAAmB;IACtG,IAAMF,YAAY2B,IAAAA,uBAAa,EAACrC,KAAKsE;IACrC,IAAQ5E,UAAqBgB,UAArBhB,SAASC,UAAYe,UAAZf;IACjB,IAAM4E,aAAaD,UAAU5E,OAAO,KAAKuD,aAAaqB,UAAU3E,OAAO,KAAKsD,aAAaqB,UAAUE,SAAS,KAAK;IACjH,IAAI,CAACD,YAAY,OAAO,IAAI1G,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDc,GAAG,CAACO,UAAUoC,UAAU,EAA8B7G,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IACvK,IAAMsF,QAAQ7D,qBAAAA,sBAAAA,WAAY,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IAC3H,OAAO,IAAItB,IAAI4G,MAAMpI,MAAM,CAAC,SAACqI;eAAMjF,QAAQiF,GAAGhF,SAASC;;AACzD;AAEA,SAAS4C,cAAcrD,EAAgB,EAAEuF,KAAkB,EAAEvC,KAAyB;IACpF,IAAI,CAACA,OAAO,OAAOuC;IACnB,IAAME,YAAYzF,GAAGG,OAAO,CAAC,AAAC,2CAAgD,OAAN6C,OAAM,MAAI/B,GAAG;IACrF,IAAMyE,aAAa,IAAI/G,IAAI8G,UAAU1I,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IACtD,OAAO,IAAItB,IAAI,AAAC,qBAAG4G,OAAOpI,MAAM,CAAC,SAACqI;eAAME,WAAWvE,GAAG,CAACqE;;AACzD;AAIO,SAASpJ,YAAY4D,EAAgB,EAAEc,GAAmB,EAAEsE,SAA0B;IAC3F,IAAM5D,YAAY2B,IAAAA,uBAAa,EAACrC,KAAKsE;IACrC,OAAO/B,cAAcrD,IAAIoD,SAASpD,IAAIc,KAAKsE,YAAY5D,UAAUwB,KAAK;AACxE;AAYO,SAAS/G,eAAe+D,EAAgB,EAAEc,GAAmB;IAClE,IAAM6E,cAAc5E,IAAAA,yBAAe,EAACD;IACpC,OAAO8E,IAAAA,qBAAW,EAAC9E,KAAK/D,GAAG,CAAC,SAAC8I;QAC3B,IAAMC,QAAQ,AAAC9F,GAAGG,OAAO,CAAC,2DAA2DC,GAAG,CAACyF,MAAwBE,CAAC;QAClH,IAAMC,WAAWL,cAAc,AAAC3F,GAAGG,OAAO,CAAC,6JAA6JC,GAAG,CAACyF,MAAwBE,CAAC,GAAG;QACxO,OAAO;YAAEF,MAAAA;YAAMC,OAAAA;YAAOE,UAAAA;YAAUvC,UAAUwC,IAAAA,+BAAqB,EAACnF,KAAK+E;QAAM;IAC7E;AACF;AAaA,IAAMK,mBAAmB,IAAIvH,IAAI;IAAC;IAAQ;IAAU;IAAS;IAAS;CAAe;AAErF,yFAAyF;AACzF,8FAA8F;AAC9F,IAAMwH,mBAAmB;AAEzB,SAASC,MAASC,KAAU,EAAEtH,IAAY;IACxC,IAAMQ,MAAa,EAAE;IACrB,IAAK,IAAIf,IAAI,GAAGA,IAAI6H,MAAMjJ,MAAM,EAAEoB,KAAKO,KAAMQ,IAAI1B,IAAI,CAACwI,MAAMhH,KAAK,CAACb,GAAGA,IAAIO;IACzE,OAAOQ;AACT;AAEA,8FAA8F;AAC9F,yFAAyF;AACzF,SAASsE,iBAAiB7D,EAAgB,EAAEsG,KAAa,EAAEf,KAAkB;IAC3EvF,GAAG+E,IAAI,CAAC,AAAC,wBAA6B,OAANuB;IAChCtG,GAAG+E,IAAI,CAAC,AAAC,qBAA0B,OAANuB,OAAM;IACnCtG,GAAGG,OAAO,CAAC,AAAC,eAAoB,OAANmG,OAAM,8CAA4CtB,GAAG,CAACuB,KAAKC,SAAS,CAAE,qBAAGjB;AACrG;AAEA,SAASkB,cAAczG,EAAgB,EAAEuF,KAAkB;IACzD1B,iBAAiB7D,IAAI,cAAcuF;AACrC;AAIO,SAASxJ,QAAQiE,EAAgB,EAAEc,GAAmB;QAAEsE,YAAAA,iEAA6B,CAAC;IAC3FqB,cAAczG,IAAI5D,YAAY4D,IAAIc,KAAKsE;IACvC,IAAMsB,aAAa;IACnB,IAAMC,WAAW;IAEjB,IAAMC,OAAO5G,GAAGG,OAAO,CAAC,AAAC,iFAA2F,OAAXuG,aAActG,GAAG;IAE1H,IAAMyG,UAAU,AAAC7G,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAE2E,IAAI;OAAE1I,MAAM,CAAC,SAAC0I;eAAS,CAACK,iBAAiB/E,GAAG,CAAC0E;;IAC1J,6FAA6F;IAC7F,+FAA+F;IAC/F,IAAMiB,YAAmB,EAAE;QACtB,kCAAA,2BAAA;;;YAAA,IAAMC,QAAN;YACH,IAAMC,QAAQD,MAAMhK,GAAG,CAAC,SAAC8I,MAAMrH;gBAC7B,IAAMyI,SAAS,AAAC,IAA8B,OAA3BpB,KAAK/I,KAAK,CAAC,KAAKoI,IAAI,CAAC,OAAM;gBAC9C,OAAO,AAAC,SAAuB1G,OAAfyI,QAAO,UAA2CA,OAAnCzI,GAAE,mCAA2DyI,OAA1BA,QAAO,qBAA8CzI,OAA3ByI,QAAO,sBAAsB,OAAFzI;YACzH;YACA,IAAM0I,SAASlH,GAAGG,OAAO,CAAC,AAAC,UAA8CuG,OAArCM,MAAM9B,IAAI,CAAC,OAAM,sBAA+B,OAAXwB,aAActG,GAAG;YAC1F2G,MAAM5C,OAAO,CAAC,SAAC0B,MAAMrH;oBAAgF0I;uBAA1EJ,UAAUjJ,IAAI,CAAC;oBAAEsJ,OAAOtB;oBAAMuB,UAAUF,MAAM,CAAC,AAAC,IAAK,OAAF1I,GAAI;oBAAY6I,IAAI,GAAGH,WAAAA,MAAM,CAAC,AAAC,IAAK,OAAF1I,GAAI,cAAf0I,sBAAAA,WAA8B;gBAAG;;QACxI;QAPA,QAAK,YAAed,MAAMS,SAASV,sCAA9B,SAAA,6BAAA,QAAA,yBAAA;;QAAA;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAQLW,UAAU9I,IAAI,CAAC,SAACC,GAAGC;eAAM,AAACA,EAAEkJ,QAAQ,GAAenJ,EAAEmJ,QAAQ;;IAC7D,IAAME,SAASR,UAAUzH,KAAK,CAAC,GAAG;IAElC,IAAMkI,OAAOhD,IAAAA,wBAAc,EAACzD,KAAK,UAAWd,GAAGG,OAAO,CAAC,AAAC,oKAA4K,OAATwG,UAAS,qCAAmC1F,GAAG,KAAe,EAAE;IAE3R,IAAMuG,SAASxH,GAAGG,OAAO,CAAC,AAAC,wFAAgG,OAAXuG,YAAW,oCAAkCzF,GAAG;IAEhK,2FAA2F;IAC3F,iGAAiG;IACjG,IAAMwG,YAAYzH,GAAGG,OAAO,CAAC,AAAC,yCAAmD,OAAXuG,YAAW,uEAAqEtG,GAAG;IACzJ,IAAMsH,eAAeD,aAAab,KAAKhI,KAAK,GAAG,KAAK6I,UAAU1B,CAAC,GAAGa,KAAKhI,KAAK,GAAG,IAAI,AAAC,GAAoBgI,OAAlBa,UAAU1B,CAAC,EAAC,QAAiB,OAAXa,KAAKhI,KAAK,EAAC,uGAAqG;IAExN,OAAO;QAAEgI,MAAAA;QAAMU,QAAAA;QAAQK,aAAab,UAAU1J,MAAM;QAAEwK,UAAUC,IAAAA,uBAAa,EAAC/G;QAAMgH,SAAS7L,eAAe+D,IAAIc;QAAMyG,MAAAA;QAAMC,QAAAA;QAAQE,cAAAA;IAAa;AACnJ;AAIO,SAASvL,YAAYoJ,KAAe,EAAEwC,GAAW;IACtD,IAAMC,QAAQzC,MAAM0C,IAAI,CAAC,SAACzC;eAAMA,MAAMuC;;IACtC,IAAIC,OAAO,OAAOA;IAClB,IAAME,OAAOC,cAAK,CAACC,QAAQ,CAACL,KAAKlL,OAAO,CAAC,UAAU,IAAII,WAAW;IAClE,IAAMoL,UAAU9C,MAAMpI,MAAM,CAAC,SAACqI;eAAM2C,cAAK,CAACC,QAAQ,CAAC5C,GAAG3I,OAAO,CAAC,UAAU,IAAII,WAAW,OAAOiL;;IAC9F,IAAIG,QAAQjL,MAAM,KAAK,GAAG,OAAOiL,OAAO,CAAC,EAAE;IAC3C,IAAIA,QAAQjL,MAAM,GAAG,GAAG,MAAM,IAAIuG,oBAAU,CAAC,kBAAkB,AAAC,IAAyB0E,OAAtBN,KAAI,oBAAqC,OAAnBM,QAAQnD,IAAI,CAAC;IACtG,MAAM,IAAIvB,oBAAU,CAAC,kBAAkB,AAAC,oBAAuB,OAAJoE,KAAI;AACjE;AAyBA,IAAMO,kBAAkB;AAIjB,SAAStM,KAAKgE,EAAgB,EAAEc,GAAmB,EAAEyH,OAAe;QAAEnD,YAAAA,iEAA6B,CAAC;QAKrFlF,mBAwBEA;IA5BtB,IAAMqF,QAAQ,AAACvF,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;eAAMA,EAAEjB,IAAI;;IAC/G,IAAMA,OAAO9D,YAAYoJ,OAAOgD;IAEhC,IAAMrI,MAAMF,GAAGG,OAAO,CAAC,8CAA8CC,GAAG,CAACH;IACzE,IAAMuI,cAActI,oBAAAA,IAAIuI,YAAY,cAAhBvI,+BAAAA,oBAAsC;IAC1D,IAAMwI,cAAmB,CAAC;QACrB,kCAAA,2BAAA;;QAAL,QAAK,YAAsBC,OAAOC,OAAO,CAAC1I,yBAArC,SAAA,6BAAA,QAAA,yBAAA,iCAA2C;YAA3C,mCAAA,iBAAO2I,sBAAKC;YACf,IAAI,CAAC5C,iBAAiB/E,GAAG,CAAC0H,QAAQC,UAAU,MAAMJ,WAAW,CAACG,IAAI,GAAGC;QACvE;;QAFK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAIL,IAAMC,gBAAgBxE,IAAAA,wBAAc,EAACzD,KAAK,cAAc,AAACd,GAAGG,OAAO,CAAC,uDAAuDC,GAAG,CAACH,MAAwB8F,CAAC,GAAG;IAC3J,IAAMiD,WAAWzE,IAAAA,wBAAc,EAACzD,KAAK,cAAed,GAAGG,OAAO,CAAC,2GAA2Gc,GAAG,CAAChB,MAAMqI,mBAA6B,EAAE;IAEnN,IAAIW,WAAqB,EAAE;IAC3B,IAAIC,YAAsB,EAAE;IAC5B,IAAIC,aAAuB,EAAE;IAC7B,IAAIC,iBAAiB;IACrB,IAAMC,WAAWjN,YAAY4D,IAAIc,KAAKsE;IACtC,IAAIb,IAAAA,wBAAc,EAACzD,KAAK,UAAU;QAChC,IAAMvB,MAAMS,GAAGG,OAAO,CAAC,+DAA+Dc,GAAG,CAAChB;QAC1FgJ,WAAY,qBAAG,IAAItK,IAAIY,IAAIpC,MAAM,CAAC,SAACmM;mBAAMA,EAAEC,GAAG,KAAK;WAAMxM,GAAG,CAAC,SAACuM;mBAAMA,EAAEC,GAAG;;QACzEJ,aAAa5J,IAAIpC,MAAM,CAAC,SAACmM;mBAAMA,EAAEC,GAAG,KAAK;WAAMxM,GAAG,CAAC,SAACuM;mBAAMA,EAAEE,MAAM;;QAClEJ,iBAAiB,AAACpJ,GAAGG,OAAO,CAAC,4DAA4DC,GAAG,CAACH,MAAwB8F,CAAC;QACtHmD,YAAY,AAAClJ,GAAGG,OAAO,CAAC,qEAAqEc,GAAG,CAAChB,MAAMqI,iBAA4CvL,GAAG,CAAC,SAACmE;mBAAMA,EAAEuI,GAAG;;IACrK;IAEA,OAAO;QACLxJ,MAAAA;QACAyJ,QAAQxK,KAAKyK,IAAI,CAAC,EAAEzJ,aAAAA,IAAI0J,KAAK,cAAT1J,wBAAAA,aAAwB,KAAK;QACjDwI,aAAAA;QACAF,YAAAA;QACAQ,UAAAA;QACAC,UAAUA,SAAS5J,KAAK,CAAC,GAAGiJ;QAC5BY,WAAAA;QACAC,YAAYA,WAAW9J,KAAK,CAAC,GAAGiJ;QAChCS,eAAAA;QACAc,eAAeZ,SAAS7L,MAAM;QAC9BgM,gBAAAA;QACAU,iBAAiBX,WAAW/L,MAAM;QAClC2M,KAAK,AAAC;YAAC;YAAY;SAAQ,CAAmB5M,MAAM,CAAC,SAAC0I;mBAAS,CAACtB,IAAAA,wBAAc,EAACzD,KAAK+E;;IACtF;AACF;AAIO,SAAe3J,aAAa8D,EAAgB,EAAEc,GAAmB,EAAEyH,OAAe,EAAEnD,SAA0B,EAAE3D,CAAS;;YACxH8D,OACAtF,MAEAgJ,UACAC,WACAzI,SAKAe,WAaAwI;;;;oBAvBAzE,QAAQ,AAACvF,GAAGG,OAAO,CAAC,kCAAkCc,GAAG,GAA+BlE,GAAG,CAAC,SAACmE;+BAAMA,EAAEjB,IAAI;;oBACzGA,OAAO9D,YAAYoJ,OAAOgD;oBAE1BU,WAAW,AAACjJ,GAAGG,OAAO,CAAC,oEAAoEc,GAAG,CAAChB,MAAiClD,GAAG,CAAC,SAACmE;+BAAMA,EAAEqI,GAAG;;oBAChJL,YAAY,AAAClJ,GAAGG,OAAO,CAAC,gDAAgDc,GAAG,CAAChB,MAAiClD,GAAG,CAAC,SAACmE;+BAAMA,EAAEuI,GAAG;;oBAC7HhJ,UAAU,IAAI9B,IAAI;wBAACsB;sBAAD,OAAO,qBAAGgJ,WAAU,qBAAGC;oBAE/C,yFAAyF;oBACzF,2FAA2F;oBAC3F,yDAAyD;oBACnD1H,YAAY2B,IAAAA,uBAAa,EAACrC,KAAKsE;oBACrC,IAAI,CAAC6E,IAAAA,sBAAY,EAACnJ,MAAM;wBACtB,MAAM,IAAI6C,oBAAU,CAAC,kBAAkB;oBACzC;oBACA,oFAAoF;oBACpF,yFAAyF;oBACzF,uDAAuD;oBACvD,IAAI,CAACnC,UAAUiC,QAAQ,EAAE;wBACvB,MAAM,IAAIE,oBAAU,CAAC,uBAAuB,AAAC,WAA+B,OAArBnC,UAAUoC,UAAU,EAAC;oBAC9E;oBACA,IAAI,CAACF,IAAAA,qBAAY,EAAC5C,MAAM;wBACtB,MAAM,IAAI6C,oBAAU,CAAC,uBAAuB;oBAC9C;oBACMqG,UAAU5N,YAAY4D,IAAIc,KAAKsE;oBACrC,oFAAoF;oBACpF,oDAAoD;oBACpD;;wBAAM8E,IAAAA,qBAAY,EAAClK,IAAIc,KAAKA,IAAIqE,OAAO;;;oBAAvC;oBACA,IAAI,CAACgF,IAAAA,qBAAY,EAACnK,IAAIC,OAAO;wBAC3B,MAAM,IAAI0D,oBAAU,CAAC,qBAAqB,AAAC,GAAO,OAAL1D,MAAK;oBACpD;oBACA,IAAI,CAACY,mBAAmBb,IAAIc,KAAKkJ,UAAU;;;;oBAC3C;;wBAAOI,IAAAA,qBAAY,EAACpK,IAAIc,KAAKb,MAAM;4BAAEQ,SAAAA;4BAASuJ,SAAAA;4BAASvI,GAAAA;wBAAE;;;;IAC3D"}