sensemaking 0.7.2 → 0.9.0

package/dist/cjs/features/links.js

@@ -47,7 +47,9 @@ function _unsupported_iterable_to_array(o, minLen) {
     if (n === "Map" || n === "Set") return Array.from(n);
     if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
 }
-// links(src, target, dst): target as written, dst the resolved path or NULL (a queryable dead link).
+// links(src, target, target_base, dst): target as written, target_base its baseKey
+// (indexed, for the incremental resolve below), dst the resolved path or NULL (a
+// queryable dead link).
 // Wikilinks ([[target]], [[target#anchor|alias]], embeds) plus relative markdown links to .md files.
 function extract(_raw, body) {
     var targets = new Set();
@@ -95,6 +97,9 @@ function extract(_raw, body) {
     }
     return _to_consumable_array(targets);
 }
+function cleanTarget(target) {
+    return target.replace(/\\/g, '/').replace(/^\.\//, '');
+}
 function baseKey(path) {
     return _posix.default.basename(path).replace(/\.md$/i, '').toLowerCase();
 }
@@ -103,7 +108,7 @@ function baseKey(path) {
 function resolveTarget(src, target, pathSet, byBase) {
     var _ref;
     var _byBase_get;
-    var clean = target.replace(/\\/g, '/').replace(/^\.\//, '');
+    var clean = cleanTarget(target);
     var fromSrc = _posix.default.normalize(_posix.default.join(_posix.default.dirname(src), clean));
     for(var _i = 0, _iter = [
         clean,
@@ -116,20 +121,18 @@ function resolveTarget(src, target, pathSet, byBase) {
     }
     return (_ref = (_byBase_get = byBase.get(baseKey(clean))) === null || _byBase_get === void 0 ? void 0 : _byBase_get[0]) !== null && _ref !== void 0 ? _ref : null;
 }
-// A new or deleted file can change any note's resolution, so re-resolve the whole table
-// whenever the tree changes. An in-memory probe per row; writes only on change.
-function resolveAll(db, files) {
-    var pathSet = new Set(files.map(function(f) {
-        return f.relPath;
-    }));
+function buildByBase(files) {
     var byBase = new Map();
     var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
     try {
-        for(var _iterator = _to_consumable_array(pathSet).sort()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+        for(var _iterator = files.map(function(f) {
+            return f.relPath;
+        }).sort()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
             var path = _step.value;
-            var list = byBase.get(baseKey(path));
+            var key = baseKey(path);
+            var list = byBase.get(key);
             if (list) list.push(path);
-            else byBase.set(baseKey(path), [
+            else byBase.set(key, [
                 path
             ]);
         }
@@ -147,14 +150,86 @@ function resolveAll(db, files) {
             }
         }
     }
-    var rows = db.prepare('SELECT src, target, dst FROM links').all();
+    return byBase;
+}
+// Applies resolveTarget to `rows`, writing only rows whose dst actually changes.
+function resolveRows(db, rows, pathSet, byBase) {
     var update = db.prepare('UPDATE links SET dst = ? WHERE src = ? AND target = ?');
-    var _iteratorNormalCompletion1 = true, _didIteratorError1 = false, _iteratorError1 = undefined;
+    var changed = false;
+    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
     try {
-        for(var _iterator1 = rows[Symbol.iterator](), _step1; !(_iteratorNormalCompletion1 = (_step1 = _iterator1.next()).done); _iteratorNormalCompletion1 = true){
-            var row = _step1.value;
+        for(var _iterator = rows[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            var row = _step.value;
             var dst = resolveTarget(row.src, row.target, pathSet, byBase);
-            if (dst !== row.dst) update.run(dst, row.src, row.target);
+            if (dst !== row.dst) {
+                update.run(dst, row.src, row.target);
+                changed = true;
+            }
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
+            }
+        }
+    }
+    return changed;
+}
+// A new or deleted file can change any note's resolution, so re-resolve the whole table.
+// Fallback for cold builds and large deltas -- see afterReconcile's threshold.
+function resolveAll(db, files) {
+    var pathSet = new Set(files.map(function(f) {
+        return f.relPath;
+    }));
+    var byBase = buildByBase(files);
+    var rows = db.prepare('SELECT src, target, dst FROM links').all();
+    return resolveRows(db, rows, pathSet, byBase);
+}
+// Re-resolve only what this reconcile could have affected: (a) links whose src was just
+// re-stored (their rows are fresh, dst reset to NULL by store()), (b) links whose target's
+// basename matches a file that appeared or disappeared this reconcile (resolution and
+// lexicographic-tie ambiguity hinge on exactly that set), and (c) links whose dst was a
+// path that just vanished. All three are indexed lookups (src is the links PK's leading
+// column; target_base and dst each have their own index), so this reads only the rows this
+// reconcile could plausibly have changed, not the whole table.
+function resolveIncremental(db, delta) {
+    var pathSet = new Set(delta.files.map(function(f) {
+        return f.relPath;
+    }));
+    var byBase = buildByBase(delta.files);
+    var changedBasenames = new Set();
+    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+    try {
+        for(var _iterator = delta.added[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            var p = _step.value;
+            changedBasenames.add(baseKey(p));
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
+            }
+        }
+    }
+    var _iteratorNormalCompletion1 = true, _didIteratorError1 = false, _iteratorError1 = undefined;
+    try {
+        for(var _iterator1 = delta.vanished[Symbol.iterator](), _step1; !(_iteratorNormalCompletion1 = (_step1 = _iterator1.next()).done); _iteratorNormalCompletion1 = true){
+            var p1 = _step1.value;
+            changedBasenames.add(baseKey(p1));
         }
     } catch (err) {
         _didIteratorError1 = true;
@@ -170,6 +245,46 @@ function resolveAll(db, files) {
             }
         }
     }
+    // \0 can't appear in a path or target, so the key never collides; a space can.
+    var candidates = new Map();
+    var collect = function collect(rows) {
+        var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+        try {
+            for(var _iterator = rows[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+                var row = _step.value;
+                candidates.set("".concat(row.src, "\0").concat(row.target), row);
+            }
+        } catch (err) {
+            _didIteratorError = true;
+            _iteratorError = err;
+        } finally{
+            try {
+                if (!_iteratorNormalCompletion && _iterator.return != null) {
+                    _iterator.return();
+                }
+            } finally{
+                if (_didIteratorError) {
+                    throw _iteratorError;
+                }
+            }
+        }
+    };
+    // Chunked so a large-but-under-threshold delta never exceeds SQLite's bound-variable
+    // limit (SQLITE_MAX_VARIABLE_NUMBER, 32766).
+    var collectIn = function collectIn(column, keys) {
+        for(var i = 0; i < keys.length; i += 500){
+            var _db_prepare;
+            var chunk = keys.slice(i, i + 500);
+            var placeholders = chunk.map(function() {
+                return '?';
+            }).join(', ');
+            collect((_db_prepare = db.prepare("SELECT src, target, dst FROM links WHERE ".concat(column, " IN (").concat(placeholders, ")"))).all.apply(_db_prepare, _to_consumable_array(chunk)));
+        }
+    };
+    collectIn('src', delta.reparsed);
+    collectIn('target_base', _to_consumable_array(changedBasenames));
+    collectIn('dst', delta.vanished);
+    return resolveRows(db, _to_consumable_array(candidates.values()), pathSet, byBase);
 }
 function linkEdges(db) {
     return db.prepare('SELECT src, dst FROM links WHERE dst IS NOT NULL').all().map(function(r) {
@@ -179,23 +294,70 @@ function linkEdges(db) {
         ];
     });
 }
+// A removed path's outbound link rows are already gone by the time afterReconcile runs
+// (remove() below deletes them for vanished files AND for reparsed existing files), so
+// afterReconcile can't tell from the links table alone whether deleted rows carried edges.
+// remove() records that here, keyed on the reconcile's own delta object -- state dies with
+// the reconcile, including on ROLLBACK, and distinct reconciles never share it.
+var removedWithLinks = new WeakMap();
+function recordRemoved(delta, path) {
+    var set = removedWithLinks.get(delta);
+    if (!set) {
+        set = new Set();
+        removedWithLinks.set(delta, set);
+    }
+    set.add(path);
+}
+// remove() runs per path; the vanished list is an array, so cache the Set per delta.
+var vanishedSets = new WeakMap();
+function vanishedSet(delta) {
+    var set = vanishedSets.get(delta);
+    if (!set) {
+        set = new Set(delta.vanished);
+        vanishedSets.set(delta, set);
+    }
+    return set;
+}
 var links = {
     name: 'links',
     schema: function schema(db) {
-        db.exec('CREATE TABLE IF NOT EXISTS links (src TEXT, target TEXT, dst TEXT, PRIMARY KEY (src, target))');
+        db.exec('CREATE TABLE IF NOT EXISTS links (src TEXT, target TEXT, target_base TEXT, dst TEXT, PRIMARY KEY (src, target))');
         db.exec('CREATE INDEX IF NOT EXISTS links_dst ON links(dst)');
+        db.exec('CREATE INDEX IF NOT EXISTS links_target_base ON links(target_base)');
     },
     extract: extract,
-    remove: function remove(db, path) {
-        db.prepare('DELETE FROM links WHERE src = ?').run(path);
+    // Reparsed docs are diffed in store() below instead of wiped here: deleting and
+    // re-inserting resets dst to NULL, which made every touch-only reparse read as an edge
+    // change and recompute PageRank -- measured as most of the remaining update cost.
+    remove: function remove(db, path, delta) {
+        if (!vanishedSet(delta).has(path)) return;
+        var result = db.prepare('DELETE FROM links WHERE src = ?').run(path);
+        if (Number(result.changes) > 0) recordRemoved(delta, path);
     },
-    store: function store(db, path, extracted) {
-        var insert = db.prepare('INSERT OR REPLACE INTO links (src, target, dst) VALUES (?, ?, NULL)');
+    store: function store(db, path, extracted, delta) {
+        var targets = extracted;
+        // Stale rows (targets the new parse no longer contains) are real edge removals.
+        var stale;
+        if (targets.length === 0) {
+            stale = db.prepare('DELETE FROM links WHERE src = ?').run(path);
+        } else {
+            var _db_prepare;
+            var placeholders = targets.map(function() {
+                return '?';
+            }).join(', ');
+            stale = (_db_prepare = db.prepare("DELETE FROM links WHERE src = ? AND target NOT IN (".concat(placeholders, ")"))).run.apply(_db_prepare, [
+                path
+            ].concat(_to_consumable_array(targets)));
+        }
+        if (Number(stale.changes) > 0) recordRemoved(delta, path);
+        // Upsert preserves dst on surviving rows, so an unchanged link resolves to the same
+        // value and reports no change; only genuinely new rows start at NULL.
+        var insert = db.prepare('INSERT INTO links (src, target, target_base, dst) VALUES (?, ?, ?, NULL) ON CONFLICT(src, target) DO UPDATE SET target_base = excluded.target_base');
         var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
         try {
-            for(var _iterator = extracted[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            for(var _iterator = targets[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
                 var target = _step.value;
-                insert.run(path, target);
+                insert.run(path, target, baseKey(cleanTarget(target)));
             }
         } catch (err) {
             _didIteratorError = true;
@@ -212,6 +374,21 @@ var links = {
             }
         }
     },
-    afterReconcile: resolveAll
+    afterReconcile: function afterReconcile(db, delta) {
+        var _ref;
+        var _removedWithLinks_get;
+        // Any deleted rows that carried edges mean the edge set shrank -- whether the file
+        // vanished or was reparsed down to fewer/no links. dstChanged alone misses the
+        // reparsed-to-zero-links case (no surviving rows to re-resolve).
+        var removeHadLinks = ((_ref = (_removedWithLinks_get = removedWithLinks.get(delta)) === null || _removedWithLinks_get === void 0 ? void 0 : _removedWithLinks_get.size) !== null && _ref !== void 0 ? _ref : 0) > 0;
+        var churn = delta.reparsed.length + delta.vanished.length;
+        // Fallback rule: correctness over cleverness once too much of the tree moved in one
+        // reconcile -- a full pass is the one guaranteed to match resolveTarget's ambiguity
+        // rules exactly. A cold build reparses ~every file, so it clears this threshold on its
+        // own without a separate check.
+        var large = delta.files.length === 0 || churn > 0.2 * delta.files.length;
+        var dstChanged = large ? resolveAll(db, delta.files) : resolveIncremental(db, delta);
+        delta.linksChanged = dstChanged || removeHadLinks;
+    }
 };
 /* CJS INTEROP */ if (exports.__esModule && exports.default) { try { Object.defineProperty(exports.default, '__esModule', { value: true }); for (var key in exports) { exports.default[key] = exports[key]; } } catch (_) {}; module.exports = exports.default; }

package/dist/cjs/features/links.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/features/links.ts"],"sourcesContent":["import posix from 'node:path/posix';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { FileStat } from '../scan.ts';\nimport type { Feature } from './types.ts';\n\n// links(src, target, dst): target as written, dst the resolved path or NULL (a queryable dead link).\n\n// Wikilinks ([[target]], [[target#anchor|alias]], embeds) plus relative markdown links to .md files.\nfunction extract(_raw: string, body: string): string[] {\n  const targets = new Set<string>();\n  for (const m of body.matchAll(/\\[\\[([^\\]|#]+)(?:#[^\\]|]*)?(?:\\|[^\\]]*)?\\]\\]/g)) {\n    const target = m[1].trim();\n    if (target) targets.add(target);\n  }\n  for (const m of body.matchAll(/\\]\\(([^)]+\\.md)(?:#[^)]*)?\\)/g)) {\n    const target = m[1].trim();\n    if (target && !/^[a-z]+:\\/\\//i.test(target)) targets.add(target);\n  }\n  return [...targets];\n}\n\nfunction baseKey(path: string): string {\n  return posix.basename(path).replace(/\\.md$/i, '').toLowerCase();\n}\n\n// Obsidian-style: exact relative path (with/without .md), path relative to the linking\n// note's directory, then basename match (lexicographically first on ties).\nfunction resolveTarget(src: string, target: string, pathSet: Set<string>, byBase: Map<string, string[]>): string | null {\n  const clean = target.replace(/\\\\/g, '/').replace(/^\\.\\//, '');\n  const fromSrc = posix.normalize(posix.join(posix.dirname(src), clean));\n  for (const candidate of [clean, `${clean}.md`, fromSrc, `${fromSrc}.md`]) {\n    if (pathSet.has(candidate)) return candidate;\n  }\n  return byBase.get(baseKey(clean))?.[0] ?? null;\n}\n\n// A new or deleted file can change any note's resolution, so re-resolve the whole table\n// whenever the tree changes. An in-memory probe per row; writes only on change.\nfunction resolveAll(db: DatabaseSync, files: FileStat[]): void {\n  const pathSet = new Set(files.map((f) => f.relPath));\n  const byBase = new Map<string, string[]>();\n  for (const path of [...pathSet].sort()) {\n    const list = byBase.get(baseKey(path));\n    if (list) list.push(path);\n    else byBase.set(baseKey(path), [path]);\n  }\n  const rows = db.prepare('SELECT src, target, dst FROM links').all() as Array<{ src: string; target: string; dst: string | null }>;\n  const update = db.prepare('UPDATE links SET dst = ? WHERE src = ? AND target = ?');\n  for (const row of rows) {\n    const dst = resolveTarget(row.src, row.target, pathSet, byBase);\n    if (dst !== row.dst) update.run(dst, row.src, row.target);\n  }\n}\n\n// Resolved edges, for rank and for find's graph expansion.\nexport function linkEdges(db: DatabaseSync): [string, string][] {\n  return (db.prepare('SELECT src, dst FROM links WHERE dst IS NOT NULL').all() as Array<{ src: string; dst: string }>).map((r) => [r.src, r.dst]);\n}\n\nexport const links: Feature = {\n  name: 'links',\n  schema(db) {\n    db.exec('CREATE TABLE IF NOT EXISTS links (src TEXT, target TEXT, dst TEXT, PRIMARY KEY (src, target))');\n    db.exec('CREATE INDEX IF NOT EXISTS links_dst ON links(dst)');\n  },\n  extract,\n  remove(db, path) {\n    db.prepare('DELETE FROM links WHERE src = ?').run(path);\n  },\n  store(db, path, extracted) {\n    const insert = db.prepare('INSERT OR REPLACE INTO links (src, target, dst) VALUES (?, ?, NULL)');\n    for (const target of extracted as string[]) insert.run(path, target);\n  },\n  afterReconcile: resolveAll,\n};\n"],"names":["linkEdges","links","extract","_raw","body","targets","Set","matchAll","m","target","trim","add","test","baseKey","path","posix","basename","replace","toLowerCase","resolveTarget","src","pathSet","byBase","clean","fromSrc","normalize","join","dirname","candidate","has","get","resolveAll","db","files","map","f","relPath","Map","sort","list","push","set","rows","prepare","all","update","row","dst","run","r","name","schema","exec","remove","store","extracted","insert","afterReconcile"],"mappings":";;;;;;;;;;;QAuDgBA;eAAAA;;QAIHC;eAAAA;;;4DA3DK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAKlB,qGAAqG;AAErG,qGAAqG;AACrG,SAASC,QAAQC,IAAY,EAAEC,IAAY;IACzC,IAAMC,UAAU,IAAIC;QACf,kCAAA,2BAAA;;QAAL,QAAK,YAAWF,KAAKG,QAAQ,CAAC,qEAAzB,SAAA,6BAAA,QAAA,yBAAA,iCAA2E;YAA3E,IAAMC,IAAN;YACH,IAAMC,SAASD,CAAC,CAAC,EAAE,CAACE,IAAI;YACxB,IAAID,QAAQJ,QAAQM,GAAG,CAACF;QAC1B;;QAHK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;QAIA,mCAAA,4BAAA;;QAAL,QAAK,aAAWL,KAAKG,QAAQ,CAAC,qDAAzB,UAAA,8BAAA,SAAA,0BAAA,kCAA2D;YAA3D,IAAMC,KAAN;YACH,IAAMC,UAASD,EAAC,CAAC,EAAE,CAACE,IAAI;YACxB,IAAID,WAAU,CAAC,gBAAgBG,IAAI,CAACH,UAASJ,QAAQM,GAAG,CAACF;QAC3D;;QAHK;QAAA;;;iBAAA,8BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAIL,OAAQ,qBAAGJ;AACb;AAEA,SAASQ,QAAQC,IAAY;IAC3B,OAAOC,cAAK,CAACC,QAAQ,CAACF,MAAMG,OAAO,CAAC,UAAU,IAAIC,WAAW;AAC/D;AAEA,uFAAuF;AACvF,2EAA2E;AAC3E,SAASC,cAAcC,GAAW,EAAEX,MAAc,EAAEY,OAAoB,EAAEC,MAA6B;;QAM9FA;IALP,IAAMC,QAAQd,OAAOQ,OAAO,CAAC,OAAO,KAAKA,OAAO,CAAC,SAAS;IAC1D,IAAMO,UAAUT,cAAK,CAACU,SAAS,CAACV,cAAK,CAACW,IAAI,CAACX,cAAK,CAACY,OAAO,CAACP,MAAMG;IAC/D,gBAAwB,QAAA;QAACA;QAAQ,GAAQ,OAANA,OAAM;QAAMC;QAAU,GAAU,OAARA,SAAQ;KAAK,OAAhD,mBAAkD;YAA/DI,YAAa;QACtB,IAAIP,QAAQQ,GAAG,CAACD,YAAY,OAAOA;IACrC;IACA,gBAAON,cAAAA,OAAOQ,GAAG,CAACjB,QAAQU,qBAAnBD,kCAAAA,WAA4B,CAAC,EAAE,uCAAI;AAC5C;AAEA,wFAAwF;AACxF,gFAAgF;AAChF,SAASS,WAAWC,EAAgB,EAAEC,KAAiB;IACrD,IAAMZ,UAAU,IAAIf,IAAI2B,MAAMC,GAAG,CAAC,SAACC;eAAMA,EAAEC,OAAO;;IAClD,IAAMd,SAAS,IAAIe;QACd,kCAAA,2BAAA;;QAAL,QAAK,YAAc,AAAC,qBAAGhB,SAASiB,IAAI,uBAA/B,SAAA,6BAAA,QAAA,yBAAA,iCAAmC;YAAnC,IAAMxB,OAAN;YACH,IAAMyB,OAAOjB,OAAOQ,GAAG,CAACjB,QAAQC;YAChC,IAAIyB,MAAMA,KAAKC,IAAI,CAAC1B;iBACfQ,OAAOmB,GAAG,CAAC5B,QAAQC,OAAO;gBAACA;aAAK;QACvC;;QAJK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAKL,IAAM4B,OAAOV,GAAGW,OAAO,CAAC,sCAAsCC,GAAG;IACjE,IAAMC,SAASb,GAAGW,OAAO,CAAC;QACrB,mCAAA,4BAAA;;QAAL,QAAK,aAAaD,yBAAb,UAAA,8BAAA,SAAA,0BAAA,kCAAmB;YAAnB,IAAMI,MAAN;YACH,IAAMC,MAAM5B,cAAc2B,IAAI1B,GAAG,EAAE0B,IAAIrC,MAAM,EAAEY,SAASC;YACxD,IAAIyB,QAAQD,IAAIC,GAAG,EAAEF,OAAOG,GAAG,CAACD,KAAKD,IAAI1B,GAAG,EAAE0B,IAAIrC,MAAM;QAC1D;;QAHK;QAAA;;;iBAAA,8BAAA;gBAAA;;;gBAAA;sBAAA;;;;AAIP;AAGO,SAAST,UAAUgC,EAAgB;IACxC,OAAO,AAACA,GAAGW,OAAO,CAAC,oDAAoDC,GAAG,GAA2CV,GAAG,CAAC,SAACe;eAAM;YAACA,EAAE7B,GAAG;YAAE6B,EAAEF,GAAG;SAAC;;AAChJ;AAEO,IAAM9C,QAAiB;IAC5BiD,MAAM;IACNC,QAAAA,SAAAA,OAAOnB,EAAE;QACPA,GAAGoB,IAAI,CAAC;QACRpB,GAAGoB,IAAI,CAAC;IACV;IACAlD,SAAAA;IACAmD,QAAAA,SAAAA,OAAOrB,EAAE,EAAElB,IAAI;QACbkB,GAAGW,OAAO,CAAC,mCAAmCK,GAAG,CAAClC;IACpD;IACAwC,OAAAA,SAAAA,MAAMtB,EAAE,EAAElB,IAAI,EAAEyC,SAAS;QACvB,IAAMC,SAASxB,GAAGW,OAAO,CAAC;YACrB,kCAAA,2BAAA;;YAAL,QAAK,YAAgBY,8BAAhB,SAAA,6BAAA,QAAA,yBAAA;gBAAA,IAAM9C,SAAN;gBAAuC+C,OAAOR,GAAG,CAAClC,MAAML;;;YAAxD;YAAA;;;qBAAA,6BAAA;oBAAA;;;oBAAA;0BAAA;;;;IACP;IACAgD,gBAAgB1B;AAClB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/features/links.ts"],"sourcesContent":["import posix from 'node:path/posix';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { FileStat } from '../scan.ts';\nimport type { Feature, ReconcileDelta } from './types.ts';\n\n// links(src, target, target_base, dst): target as written, target_base its baseKey\n// (indexed, for the incremental resolve below), dst the resolved path or NULL (a\n// queryable dead link).\n\n// Wikilinks ([[target]], [[target#anchor|alias]], embeds) plus relative markdown links to .md files.\nfunction extract(_raw: string, body: string): string[] {\n  const targets = new Set<string>();\n  for (const m of body.matchAll(/\\[\\[([^\\]|#]+)(?:#[^\\]|]*)?(?:\\|[^\\]]*)?\\]\\]/g)) {\n    const target = m[1].trim();\n    if (target) targets.add(target);\n  }\n  for (const m of body.matchAll(/\\]\\(([^)]+\\.md)(?:#[^)]*)?\\)/g)) {\n    const target = m[1].trim();\n    if (target && !/^[a-z]+:\\/\\//i.test(target)) targets.add(target);\n  }\n  return [...targets];\n}\n\nfunction cleanTarget(target: string): string {\n  return target.replace(/\\\\/g, '/').replace(/^\\.\\//, '');\n}\n\nfunction baseKey(path: string): string {\n  return posix.basename(path).replace(/\\.md$/i, '').toLowerCase();\n}\n\n// Obsidian-style: exact relative path (with/without .md), path relative to the linking\n// note's directory, then basename match (lexicographically first on ties).\nfunction resolveTarget(src: string, target: string, pathSet: Set<string>, byBase: Map<string, string[]>): string | null {\n  const clean = cleanTarget(target);\n  const fromSrc = posix.normalize(posix.join(posix.dirname(src), clean));\n  for (const candidate of [clean, `${clean}.md`, fromSrc, `${fromSrc}.md`]) {\n    if (pathSet.has(candidate)) return candidate;\n  }\n  return byBase.get(baseKey(clean))?.[0] ?? null;\n}\n\nfunction buildByBase(files: FileStat[]): Map<string, string[]> {\n  const byBase = new Map<string, string[]>();\n  for (const path of files.map((f) => f.relPath).sort()) {\n    const key = baseKey(path);\n    const list = byBase.get(key);\n    if (list) list.push(path);\n    else byBase.set(key, [path]);\n  }\n  return byBase;\n}\n\ninterface LinkRow {\n  src: string;\n  target: string;\n  dst: string | null;\n}\n\n// Applies resolveTarget to `rows`, writing only rows whose dst actually changes.\nfunction resolveRows(db: DatabaseSync, rows: LinkRow[], pathSet: Set<string>, byBase: Map<string, string[]>): boolean {\n  const update = db.prepare('UPDATE links SET dst = ? WHERE src = ? AND target = ?');\n  let changed = false;\n  for (const row of rows) {\n    const dst = resolveTarget(row.src, row.target, pathSet, byBase);\n    if (dst !== row.dst) {\n      update.run(dst, row.src, row.target);\n      changed = true;\n    }\n  }\n  return changed;\n}\n\n// A new or deleted file can change any note's resolution, so re-resolve the whole table.\n// Fallback for cold builds and large deltas -- see afterReconcile's threshold.\nfunction resolveAll(db: DatabaseSync, files: FileStat[]): boolean {\n  const pathSet = new Set(files.map((f) => f.relPath));\n  const byBase = buildByBase(files);\n  const rows = db.prepare('SELECT src, target, dst FROM links').all() as unknown as LinkRow[];\n  return resolveRows(db, rows, pathSet, byBase);\n}\n\n// Re-resolve only what this reconcile could have affected: (a) links whose src was just\n// re-stored (their rows are fresh, dst reset to NULL by store()), (b) links whose target's\n// basename matches a file that appeared or disappeared this reconcile (resolution and\n// lexicographic-tie ambiguity hinge on exactly that set), and (c) links whose dst was a\n// path that just vanished. All three are indexed lookups (src is the links PK's leading\n// column; target_base and dst each have their own index), so this reads only the rows this\n// reconcile could plausibly have changed, not the whole table.\nfunction resolveIncremental(db: DatabaseSync, delta: ReconcileDelta): boolean {\n  const pathSet = new Set(delta.files.map((f) => f.relPath));\n  const byBase = buildByBase(delta.files);\n\n  const changedBasenames = new Set<string>();\n  for (const p of delta.added) changedBasenames.add(baseKey(p));\n  for (const p of delta.vanished) changedBasenames.add(baseKey(p));\n\n  // \\0 can't appear in a path or target, so the key never collides; a space can.\n  const candidates = new Map<string, LinkRow>();\n  const collect = (rows: LinkRow[]) => {\n    for (const row of rows) candidates.set(`${row.src}\\0${row.target}`, row);\n  };\n  // Chunked so a large-but-under-threshold delta never exceeds SQLite's bound-variable\n  // limit (SQLITE_MAX_VARIABLE_NUMBER, 32766).\n  const collectIn = (column: string, keys: string[]) => {\n    for (let i = 0; i < keys.length; i += 500) {\n      const chunk = keys.slice(i, i + 500);\n      const placeholders = chunk.map(() => '?').join(', ');\n      collect(db.prepare(`SELECT src, target, dst FROM links WHERE ${column} IN (${placeholders})`).all(...chunk) as unknown as LinkRow[]);\n    }\n  };\n\n  collectIn('src', delta.reparsed);\n  collectIn('target_base', [...changedBasenames]);\n  collectIn('dst', delta.vanished);\n\n  return resolveRows(db, [...candidates.values()], pathSet, byBase);\n}\n\n// Resolved edges, for rank and for find's graph expansion.\nexport function linkEdges(db: DatabaseSync): [string, string][] {\n  return (db.prepare('SELECT src, dst FROM links WHERE dst IS NOT NULL').all() as Array<{ src: string; dst: string }>).map((r) => [r.src, r.dst]);\n}\n\n// A removed path's outbound link rows are already gone by the time afterReconcile runs\n// (remove() below deletes them for vanished files AND for reparsed existing files), so\n// afterReconcile can't tell from the links table alone whether deleted rows carried edges.\n// remove() records that here, keyed on the reconcile's own delta object -- state dies with\n// the reconcile, including on ROLLBACK, and distinct reconciles never share it.\nconst removedWithLinks = new WeakMap<ReconcileDelta, Set<string>>();\n\nfunction recordRemoved(delta: ReconcileDelta, path: string): void {\n  let set = removedWithLinks.get(delta);\n  if (!set) {\n    set = new Set();\n    removedWithLinks.set(delta, set);\n  }\n  set.add(path);\n}\n\n// remove() runs per path; the vanished list is an array, so cache the Set per delta.\nconst vanishedSets = new WeakMap<ReconcileDelta, Set<string>>();\nfunction vanishedSet(delta: ReconcileDelta): Set<string> {\n  let set = vanishedSets.get(delta);\n  if (!set) {\n    set = new Set(delta.vanished);\n    vanishedSets.set(delta, set);\n  }\n  return set;\n}\n\nexport const links: Feature = {\n  name: 'links',\n  schema(db) {\n    db.exec('CREATE TABLE IF NOT EXISTS links (src TEXT, target TEXT, target_base TEXT, dst TEXT, PRIMARY KEY (src, target))');\n    db.exec('CREATE INDEX IF NOT EXISTS links_dst ON links(dst)');\n    db.exec('CREATE INDEX IF NOT EXISTS links_target_base ON links(target_base)');\n  },\n  extract,\n  // Reparsed docs are diffed in store() below instead of wiped here: deleting and\n  // re-inserting resets dst to NULL, which made every touch-only reparse read as an edge\n  // change and recompute PageRank -- measured as most of the remaining update cost.\n  remove(db, path, delta) {\n    if (!vanishedSet(delta).has(path)) return;\n    const result = db.prepare('DELETE FROM links WHERE src = ?').run(path);\n    if (Number(result.changes) > 0) recordRemoved(delta, path);\n  },\n  store(db, path, extracted, delta) {\n    const targets = extracted as string[];\n    // Stale rows (targets the new parse no longer contains) are real edge removals.\n    let stale: ReturnType<ReturnType<DatabaseSync['prepare']>['run']>;\n    if (targets.length === 0) {\n      stale = db.prepare('DELETE FROM links WHERE src = ?').run(path);\n    } else {\n      const placeholders = targets.map(() => '?').join(', ');\n      stale = db.prepare(`DELETE FROM links WHERE src = ? AND target NOT IN (${placeholders})`).run(path, ...targets);\n    }\n    if (Number(stale.changes) > 0) recordRemoved(delta, path);\n    // Upsert preserves dst on surviving rows, so an unchanged link resolves to the same\n    // value and reports no change; only genuinely new rows start at NULL.\n    const insert = db.prepare('INSERT INTO links (src, target, target_base, dst) VALUES (?, ?, ?, NULL) ON CONFLICT(src, target) DO UPDATE SET target_base = excluded.target_base');\n    for (const target of targets) insert.run(path, target, baseKey(cleanTarget(target)));\n  },\n  afterReconcile(db, delta) {\n    // Any deleted rows that carried edges mean the edge set shrank -- whether the file\n    // vanished or was reparsed down to fewer/no links. dstChanged alone misses the\n    // reparsed-to-zero-links case (no surviving rows to re-resolve).\n    const removeHadLinks = (removedWithLinks.get(delta)?.size ?? 0) > 0;\n\n    const churn = delta.reparsed.length + delta.vanished.length;\n    // Fallback rule: correctness over cleverness once too much of the tree moved in one\n    // reconcile -- a full pass is the one guaranteed to match resolveTarget's ambiguity\n    // rules exactly. A cold build reparses ~every file, so it clears this threshold on its\n    // own without a separate check.\n    const large = delta.files.length === 0 || churn > 0.2 * delta.files.length;\n\n    const dstChanged = large ? resolveAll(db, delta.files) : resolveIncremental(db, delta);\n    delta.linksChanged = dstChanged || removeHadLinks;\n  },\n};\n"],"names":["linkEdges","links","extract","_raw","body","targets","Set","matchAll","m","target","trim","add","test","cleanTarget","replace","baseKey","path","posix","basename","toLowerCase","resolveTarget","src","pathSet","byBase","clean","fromSrc","normalize","join","dirname","candidate","has","get","buildByBase","files","Map","map","f","relPath","sort","key","list","push","set","resolveRows","db","rows","update","prepare","changed","row","dst","run","resolveAll","all","resolveIncremental","delta","changedBasenames","added","p","vanished","candidates","collect","collectIn","column","keys","i","length","chunk","slice","placeholders","reparsed","values","r","removedWithLinks","WeakMap","recordRemoved","vanishedSets","vanishedSet","name","schema","exec","remove","result","Number","changes","store","extracted","stale","insert","afterReconcile","removeHadLinks","size","churn","large","dstChanged","linksChanged"],"mappings":";;;;;;;;;;;QAwHgBA;eAAAA;;QA+BHC;eAAAA;;;4DAvJK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAKlB,mFAAmF;AACnF,iFAAiF;AACjF,wBAAwB;AAExB,qGAAqG;AACrG,SAASC,QAAQC,IAAY,EAAEC,IAAY;IACzC,IAAMC,UAAU,IAAIC;QACf,kCAAA,2BAAA;;QAAL,QAAK,YAAWF,KAAKG,QAAQ,CAAC,qEAAzB,SAAA,6BAAA,QAAA,yBAAA,iCAA2E;YAA3E,IAAMC,IAAN;YACH,IAAMC,SAASD,CAAC,CAAC,EAAE,CAACE,IAAI;YACxB,IAAID,QAAQJ,QAAQM,GAAG,CAACF;QAC1B;;QAHK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;QAIA,mCAAA,4BAAA;;QAAL,QAAK,aAAWL,KAAKG,QAAQ,CAAC,qDAAzB,UAAA,8BAAA,SAAA,0BAAA,kCAA2D;YAA3D,IAAMC,KAAN;YACH,IAAMC,UAASD,EAAC,CAAC,EAAE,CAACE,IAAI;YACxB,IAAID,WAAU,CAAC,gBAAgBG,IAAI,CAACH,UAASJ,QAAQM,GAAG,CAACF;QAC3D;;QAHK;QAAA;;;iBAAA,8BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAIL,OAAQ,qBAAGJ;AACb;AAEA,SAASQ,YAAYJ,MAAc;IACjC,OAAOA,OAAOK,OAAO,CAAC,OAAO,KAAKA,OAAO,CAAC,SAAS;AACrD;AAEA,SAASC,QAAQC,IAAY;IAC3B,OAAOC,cAAK,CAACC,QAAQ,CAACF,MAAMF,OAAO,CAAC,UAAU,IAAIK,WAAW;AAC/D;AAEA,uFAAuF;AACvF,2EAA2E;AAC3E,SAASC,cAAcC,GAAW,EAAEZ,MAAc,EAAEa,OAAoB,EAAEC,MAA6B;;QAM9FA;IALP,IAAMC,QAAQX,YAAYJ;IAC1B,IAAMgB,UAAUR,cAAK,CAACS,SAAS,CAACT,cAAK,CAACU,IAAI,CAACV,cAAK,CAACW,OAAO,CAACP,MAAMG;IAC/D,gBAAwB,QAAA;QAACA;QAAQ,GAAQ,OAANA,OAAM;QAAMC;QAAU,GAAU,OAARA,SAAQ;KAAK,OAAhD,mBAAkD;YAA/DI,YAAa;QACtB,IAAIP,QAAQQ,GAAG,CAACD,YAAY,OAAOA;IACrC;IACA,gBAAON,cAAAA,OAAOQ,GAAG,CAAChB,QAAQS,qBAAnBD,kCAAAA,WAA4B,CAAC,EAAE,uCAAI;AAC5C;AAEA,SAASS,YAAYC,KAAiB;IACpC,IAAMV,SAAS,IAAIW;QACd,kCAAA,2BAAA;;QAAL,QAAK,YAAcD,MAAME,GAAG,CAAC,SAACC;mBAAMA,EAAEC,OAAO;WAAEC,IAAI,uBAA9C,SAAA,6BAAA,QAAA,yBAAA,iCAAkD;YAAlD,IAAMtB,OAAN;YACH,IAAMuB,MAAMxB,QAAQC;YACpB,IAAMwB,OAAOjB,OAAOQ,GAAG,CAACQ;YACxB,IAAIC,MAAMA,KAAKC,IAAI,CAACzB;iBACfO,OAAOmB,GAAG,CAACH,KAAK;gBAACvB;aAAK;QAC7B;;QALK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAML,OAAOO;AACT;AAQA,iFAAiF;AACjF,SAASoB,YAAYC,EAAgB,EAAEC,IAAe,EAAEvB,OAAoB,EAAEC,MAA6B;IACzG,IAAMuB,SAASF,GAAGG,OAAO,CAAC;IAC1B,IAAIC,UAAU;QACT,kCAAA,2BAAA;;QAAL,QAAK,YAAaH,yBAAb,SAAA,6BAAA,QAAA,yBAAA,iCAAmB;YAAnB,IAAMI,MAAN;YACH,IAAMC,MAAM9B,cAAc6B,IAAI5B,GAAG,EAAE4B,IAAIxC,MAAM,EAAEa,SAASC;YACxD,IAAI2B,QAAQD,IAAIC,GAAG,EAAE;gBACnBJ,OAAOK,GAAG,CAACD,KAAKD,IAAI5B,GAAG,EAAE4B,IAAIxC,MAAM;gBACnCuC,UAAU;YACZ;QACF;;QANK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAOL,OAAOA;AACT;AAEA,yFAAyF;AACzF,+EAA+E;AAC/E,SAASI,WAAWR,EAAgB,EAAEX,KAAiB;IACrD,IAAMX,UAAU,IAAIhB,IAAI2B,MAAME,GAAG,CAAC,SAACC;eAAMA,EAAEC,OAAO;;IAClD,IAAMd,SAASS,YAAYC;IAC3B,IAAMY,OAAOD,GAAGG,OAAO,CAAC,sCAAsCM,GAAG;IACjE,OAAOV,YAAYC,IAAIC,MAAMvB,SAASC;AACxC;AAEA,wFAAwF;AACxF,2FAA2F;AAC3F,sFAAsF;AACtF,wFAAwF;AACxF,wFAAwF;AACxF,2FAA2F;AAC3F,+DAA+D;AAC/D,SAAS+B,mBAAmBV,EAAgB,EAAEW,KAAqB;IACjE,IAAMjC,UAAU,IAAIhB,IAAIiD,MAAMtB,KAAK,CAACE,GAAG,CAAC,SAACC;eAAMA,EAAEC,OAAO;;IACxD,IAAMd,SAASS,YAAYuB,MAAMtB,KAAK;IAEtC,IAAMuB,mBAAmB,IAAIlD;QACxB,kCAAA,2BAAA;;QAAL,QAAK,YAAWiD,MAAME,KAAK,qBAAtB,SAAA,6BAAA,QAAA,yBAAA;YAAA,IAAMC,IAAN;YAAwBF,iBAAiB7C,GAAG,CAACI,QAAQ2C;;;QAArD;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;QACA,mCAAA,4BAAA;;QAAL,QAAK,aAAWH,MAAMI,QAAQ,qBAAzB,UAAA,8BAAA,SAAA,0BAAA;YAAA,IAAMD,KAAN;YAA2BF,iBAAiB7C,GAAG,CAACI,QAAQ2C;;;QAAxD;QAAA;;;iBAAA,8BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAEL,+EAA+E;IAC/E,IAAME,aAAa,IAAI1B;IACvB,IAAM2B,UAAU,iBAAChB;YACV,kCAAA,2BAAA;;YAAL,QAAK,YAAaA,yBAAb,SAAA,6BAAA,QAAA,yBAAA;gBAAA,IAAMI,MAAN;gBAAmBW,WAAWlB,GAAG,CAAC,AAAC,GAAcO,OAAZA,IAAI5B,GAAG,EAAC,MAAe,OAAX4B,IAAIxC,MAAM,GAAIwC;;;YAA/D;YAAA;;;qBAAA,6BAAA;oBAAA;;;oBAAA;0BAAA;;;;IACP;IACA,qFAAqF;IACrF,6CAA6C;IAC7C,IAAMa,YAAY,mBAACC,QAAgBC;QACjC,IAAK,IAAIC,IAAI,GAAGA,IAAID,KAAKE,MAAM,EAAED,KAAK,IAAK;gBAGjCrB;YAFR,IAAMuB,QAAQH,KAAKI,KAAK,CAACH,GAAGA,IAAI;YAChC,IAAMI,eAAeF,MAAMhC,GAAG,CAAC;uBAAM;eAAKR,IAAI,CAAC;YAC/CkC,QAAQjB,CAAAA,cAAAA,GAAGG,OAAO,CAAC,AAAC,4CAAyDsB,OAAdN,QAAO,SAAoB,OAAbM,cAAa,OAAIhB,GAAG,OAAzFT,aAA0F,qBAAGuB;QACvG;IACF;IAEAL,UAAU,OAAOP,MAAMe,QAAQ;IAC/BR,UAAU,eAAgB,qBAAGN;IAC7BM,UAAU,OAAOP,MAAMI,QAAQ;IAE/B,OAAOhB,YAAYC,IAAK,qBAAGgB,WAAWW,MAAM,KAAKjD,SAASC;AAC5D;AAGO,SAASvB,UAAU4C,EAAgB;IACxC,OAAO,AAACA,GAAGG,OAAO,CAAC,oDAAoDM,GAAG,GAA2ClB,GAAG,CAAC,SAACqC;eAAM;YAACA,EAAEnD,GAAG;YAAEmD,EAAEtB,GAAG;SAAC;;AAChJ;AAEA,uFAAuF;AACvF,uFAAuF;AACvF,2FAA2F;AAC3F,2FAA2F;AAC3F,gFAAgF;AAChF,IAAMuB,mBAAmB,IAAIC;AAE7B,SAASC,cAAcpB,KAAqB,EAAEvC,IAAY;IACxD,IAAI0B,MAAM+B,iBAAiB1C,GAAG,CAACwB;IAC/B,IAAI,CAACb,KAAK;QACRA,MAAM,IAAIpC;QACVmE,iBAAiB/B,GAAG,CAACa,OAAOb;IAC9B;IACAA,IAAI/B,GAAG,CAACK;AACV;AAEA,qFAAqF;AACrF,IAAM4D,eAAe,IAAIF;AACzB,SAASG,YAAYtB,KAAqB;IACxC,IAAIb,MAAMkC,aAAa7C,GAAG,CAACwB;IAC3B,IAAI,CAACb,KAAK;QACRA,MAAM,IAAIpC,IAAIiD,MAAMI,QAAQ;QAC5BiB,aAAalC,GAAG,CAACa,OAAOb;IAC1B;IACA,OAAOA;AACT;AAEO,IAAMzC,QAAiB;IAC5B6E,MAAM;IACNC,QAAAA,SAAAA,OAAOnC,EAAE;QACPA,GAAGoC,IAAI,CAAC;QACRpC,GAAGoC,IAAI,CAAC;QACRpC,GAAGoC,IAAI,CAAC;IACV;IACA9E,SAAAA;IACA,gFAAgF;IAChF,uFAAuF;IACvF,kFAAkF;IAClF+E,QAAAA,SAAAA,OAAOrC,EAAE,EAAE5B,IAAI,EAAEuC,KAAK;QACpB,IAAI,CAACsB,YAAYtB,OAAOzB,GAAG,CAACd,OAAO;QACnC,IAAMkE,SAAStC,GAAGG,OAAO,CAAC,mCAAmCI,GAAG,CAACnC;QACjE,IAAImE,OAAOD,OAAOE,OAAO,IAAI,GAAGT,cAAcpB,OAAOvC;IACvD;IACAqE,OAAAA,SAAAA,MAAMzC,EAAE,EAAE5B,IAAI,EAAEsE,SAAS,EAAE/B,KAAK;QAC9B,IAAMlD,UAAUiF;QAChB,gFAAgF;QAChF,IAAIC;QACJ,IAAIlF,QAAQ6D,MAAM,KAAK,GAAG;YACxBqB,QAAQ3C,GAAGG,OAAO,CAAC,mCAAmCI,GAAG,CAACnC;QAC5D,OAAO;gBAEG4B;YADR,IAAMyB,eAAehE,QAAQ8B,GAAG,CAAC;uBAAM;eAAKR,IAAI,CAAC;YACjD4D,QAAQ3C,CAAAA,cAAAA,GAAGG,OAAO,CAAC,AAAC,sDAAkE,OAAbsB,cAAa,OAAIlB,GAAG,OAArFP,aAAAA;gBAAsF5B;aAAiB,CAAvG4B,OAA4F,qBAAGvC;QACzG;QACA,IAAI8E,OAAOI,MAAMH,OAAO,IAAI,GAAGT,cAAcpB,OAAOvC;QACpD,oFAAoF;QACpF,sEAAsE;QACtE,IAAMwE,SAAS5C,GAAGG,OAAO,CAAC;YACrB,kCAAA,2BAAA;;YAAL,QAAK,YAAgB1C,4BAAhB,SAAA,6BAAA,QAAA,yBAAA;gBAAA,IAAMI,SAAN;gBAAyB+E,OAAOrC,GAAG,CAACnC,MAAMP,QAAQM,QAAQF,YAAYJ;;;YAAtE;YAAA;;;qBAAA,6BAAA;oBAAA;;;oBAAA;0BAAA;;;;IACP;IACAgF,gBAAAA,SAAAA,eAAe7C,EAAE,EAAEW,KAAK;;YAIEkB;QAHxB,mFAAmF;QACnF,+EAA+E;QAC/E,iEAAiE;QACjE,IAAMiB,iBAAiB,UAACjB,wBAAAA,iBAAiB1C,GAAG,CAACwB,oBAArBkB,4CAAAA,sBAA6BkB,IAAI,uCAAI,KAAK;QAElE,IAAMC,QAAQrC,MAAMe,QAAQ,CAACJ,MAAM,GAAGX,MAAMI,QAAQ,CAACO,MAAM;QAC3D,oFAAoF;QACpF,oFAAoF;QACpF,uFAAuF;QACvF,gCAAgC;QAChC,IAAM2B,QAAQtC,MAAMtB,KAAK,CAACiC,MAAM,KAAK,KAAK0B,QAAQ,MAAMrC,MAAMtB,KAAK,CAACiC,MAAM;QAE1E,IAAM4B,aAAaD,QAAQzC,WAAWR,IAAIW,MAAMtB,KAAK,IAAIqB,mBAAmBV,IAAIW;QAChFA,MAAMwC,YAAY,GAAGD,cAAcJ;IACrC;AACF"}

package/dist/cjs/features/rank.js

@@ -64,7 +64,14 @@ var rank = {
             return c.name === '_rank';
         })) db.exec('ALTER TABLE frontmatter ADD COLUMN "_rank" REAL');
     },
-    afterReconcile: function afterReconcile(db) {
+    afterReconcile: function afterReconcile(db, delta) {
+        // links.afterReconcile runs first (registry order) and sets delta.linksChanged;
+        // `undefined` (links off, or no opinion) recomputes, same as always -- only an
+        // explicit `false` allows a skip. Rank also depends on the node set (every note is a
+        // PageRank node, edges or not), so any add or vanish recomputes even with edges
+        // untouched -- otherwise a new linkless note keeps _rank NULL and every other rank
+        // stays normalized over the old count.
+        if (delta.linksChanged === false && delta.added.length === 0 && delta.vanished.length === 0) return;
         var nodes = db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
             return r.path;
         });

package/dist/cjs/features/rank.js.map

@@ -1 +1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/features/rank.ts"],"sourcesContent":["import { pagerank } from '../graph.ts';\nimport { linkEdges } from './links.ts';\nimport type { Feature } from './types.ts';\n\n// frontmatter._rank: PageRank over resolved links -- a static \"how load-bearing is this\n// note\" prior. Depends on links (enforced in config.featureEnabled).\n\nexport const rank: Feature = {\n  name: 'rank',\n  schema(db) {\n    const columns = db.prepare('PRAGMA table_info(frontmatter)').all() as Array<{ name: string }>;\n    if (!columns.some((c) => c.name === '_rank')) db.exec('ALTER TABLE frontmatter ADD COLUMN \"_rank\" REAL');\n  },\n  afterReconcile(db) {\n    const nodes = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n    const ranks = pagerank(nodes, linkEdges(db));\n    const update = db.prepare('UPDATE frontmatter SET \"_rank\" = ? WHERE \"path\" = ?');\n    for (const [path, value] of ranks) update.run(value, path);\n  },\n};\n"],"names":["rank","name","schema","db","columns","prepare","all","some","c","exec","afterReconcile","nodes","map","r","path","ranks","pagerank","linkEdges","update","value","run"],"mappings":";;;;+BAOaA;;;eAAAA;;;uBAPY;uBACC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAMnB,IAAMA,OAAgB;IAC3BC,MAAM;IACNC,QAAAA,SAAAA,OAAOC,EAAE;QACP,IAAMC,UAAUD,GAAGE,OAAO,CAAC,kCAAkCC,GAAG;QAChE,IAAI,CAACF,QAAQG,IAAI,CAAC,SAACC;mBAAMA,EAAEP,IAAI,KAAK;YAAUE,GAAGM,IAAI,CAAC;IACxD;IACAC,gBAAAA,SAAAA,eAAeP,EAAE;QACf,IAAMQ,QAAQ,AAACR,GAAGE,OAAO,CAAC,kCAAkCC,GAAG,GAA+BM,GAAG,CAAC,SAACC;mBAAMA,EAAEC,IAAI;;QAC/G,IAAMC,QAAQC,IAAAA,iBAAQ,EAACL,OAAOM,IAAAA,kBAAS,EAACd;QACxC,IAAMe,SAASf,GAAGE,OAAO,CAAC;YACrB,kCAAA,2BAAA;;YAAL,QAAK,YAAuBU,0BAAvB,SAAA,6BAAA,QAAA,yBAAA;gBAAA,mCAAA,iBAAOD,uBAAMK;gBAAiBD,OAAOE,GAAG,CAACD,OAAOL;;;YAAhD;YAAA;;;qBAAA,6BAAA;oBAAA;;;oBAAA;0BAAA;;;;IACP;AACF"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/features/rank.ts"],"sourcesContent":["import { pagerank } from '../graph.ts';\nimport { linkEdges } from './links.ts';\nimport type { Feature } from './types.ts';\n\n// frontmatter._rank: PageRank over resolved links -- a static \"how load-bearing is this\n// note\" prior. Depends on links (enforced in config.featureEnabled).\n\nexport const rank: Feature = {\n  name: 'rank',\n  schema(db) {\n    const columns = db.prepare('PRAGMA table_info(frontmatter)').all() as Array<{ name: string }>;\n    if (!columns.some((c) => c.name === '_rank')) db.exec('ALTER TABLE frontmatter ADD COLUMN \"_rank\" REAL');\n  },\n  afterReconcile(db, delta) {\n    // links.afterReconcile runs first (registry order) and sets delta.linksChanged;\n    // `undefined` (links off, or no opinion) recomputes, same as always -- only an\n    // explicit `false` allows a skip. Rank also depends on the node set (every note is a\n    // PageRank node, edges or not), so any add or vanish recomputes even with edges\n    // untouched -- otherwise a new linkless note keeps _rank NULL and every other rank\n    // stays normalized over the old count.\n    if (delta.linksChanged === false && delta.added.length === 0 && delta.vanished.length === 0) return;\n    const nodes = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n    const ranks = pagerank(nodes, linkEdges(db));\n    const update = db.prepare('UPDATE frontmatter SET \"_rank\" = ? WHERE \"path\" = ?');\n    for (const [path, value] of ranks) update.run(value, path);\n  },\n};\n"],"names":["rank","name","schema","db","columns","prepare","all","some","c","exec","afterReconcile","delta","linksChanged","added","length","vanished","nodes","map","r","path","ranks","pagerank","linkEdges","update","value","run"],"mappings":";;;;+BAOaA;;;eAAAA;;;uBAPY;uBACC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAMnB,IAAMA,OAAgB;IAC3BC,MAAM;IACNC,QAAAA,SAAAA,OAAOC,EAAE;QACP,IAAMC,UAAUD,GAAGE,OAAO,CAAC,kCAAkCC,GAAG;QAChE,IAAI,CAACF,QAAQG,IAAI,CAAC,SAACC;mBAAMA,EAAEP,IAAI,KAAK;YAAUE,GAAGM,IAAI,CAAC;IACxD;IACAC,gBAAAA,SAAAA,eAAeP,EAAE,EAAEQ,KAAK;QACtB,gFAAgF;QAChF,+EAA+E;QAC/E,qFAAqF;QACrF,gFAAgF;QAChF,mFAAmF;QACnF,uCAAuC;QACvC,IAAIA,MAAMC,YAAY,KAAK,SAASD,MAAME,KAAK,CAACC,MAAM,KAAK,KAAKH,MAAMI,QAAQ,CAACD,MAAM,KAAK,GAAG;QAC7F,IAAME,QAAQ,AAACb,GAAGE,OAAO,CAAC,kCAAkCC,GAAG,GAA+BW,GAAG,CAAC,SAACC;mBAAMA,EAAEC,IAAI;;QAC/G,IAAMC,QAAQC,IAAAA,iBAAQ,EAACL,OAAOM,IAAAA,kBAAS,EAACnB;QACxC,IAAMoB,SAASpB,GAAGE,OAAO,CAAC;YACrB,kCAAA,2BAAA;;YAAL,QAAK,YAAuBe,0BAAvB,SAAA,6BAAA,QAAA,yBAAA;gBAAA,mCAAA,iBAAOD,uBAAMK;gBAAiBD,OAAOE,GAAG,CAACD,OAAOL;;;YAAhD;YAAA;;;qBAAA,6BAAA;oBAAA;;;oBAAA;0BAAA;;;;IACP;AACF"}

package/dist/cjs/features/types.d.cts

@@ -1,6 +1,13 @@
 import type { DatabaseSync } from 'node:sqlite';
-import type { FeatureName } from '../config.js';
+import type { Config, FeatureName } from '../config.js';
 import type { FileStat } from '../scan.js';
+export interface ReconcileDelta {
+    files: FileStat[];
+    reparsed: string[];
+    added: string[];
+    vanished: string[];
+    linksChanged?: boolean;
+}
 export interface Feature {
     name: FeatureName;
     schema(db: DatabaseSync): void;
@@ -8,7 +15,8 @@ export interface Feature {
         title: string;
         summary: string;
     }): unknown;
-    remove?(db: DatabaseSync, path: string): void;
-    store?(db: DatabaseSync, path: string, extracted: unknown): void;
-    afterReconcile?(db: DatabaseSync, files: FileStat[]): void;
+    remove?(db: DatabaseSync, path: string, delta: ReconcileDelta): void;
+    store?(db: DatabaseSync, path: string, extracted: unknown, delta: ReconcileDelta): void;
+    afterReconcile?(db: DatabaseSync, delta: ReconcileDelta): void;
+    enabledForFile?(cfg: Config, file: FileStat): boolean;
 }

package/dist/cjs/features/types.d.ts

@@ -1,6 +1,13 @@
 import type { DatabaseSync } from 'node:sqlite';
-import type { FeatureName } from '../config.js';
+import type { Config, FeatureName } from '../config.js';
 import type { FileStat } from '../scan.js';
+export interface ReconcileDelta {
+    files: FileStat[];
+    reparsed: string[];
+    added: string[];
+    vanished: string[];
+    linksChanged?: boolean;
+}
 export interface Feature {
     name: FeatureName;
     schema(db: DatabaseSync): void;
@@ -8,7 +15,8 @@ export interface Feature {
         title: string;
         summary: string;
     }): unknown;
-    remove?(db: DatabaseSync, path: string): void;
-    store?(db: DatabaseSync, path: string, extracted: unknown): void;
-    afterReconcile?(db: DatabaseSync, files: FileStat[]): void;
+    remove?(db: DatabaseSync, path: string, delta: ReconcileDelta): void;
+    store?(db: DatabaseSync, path: string, extracted: unknown, delta: ReconcileDelta): void;
+    afterReconcile?(db: DatabaseSync, delta: ReconcileDelta): void;
+    enabledForFile?(cfg: Config, file: FileStat): boolean;
 }

package/dist/cjs/index.d.cts

@@ -1,4 +1,6 @@
-export type { Config, EmbedConfig, FeatureName, ResolvedConfig } from './config.js';
+export type { Peek, PresetCoverage, SearchOptions, TreeMap } from './commands.js';
+export { mapTree, peek, presetCoverage, search } from './commands.js';
+export type { Config, EmbedConfig, FeatureName, Preset, ResolvedConfig, SavedQuery, SavedSearch } from './config.js';
 export { CONFIG_FILENAME, initConfig, loadConfig, migrateConfig, STATE_DIR, SUPPORTED_CONFIG_VERSION } from './config.js';
 export type { OpenResult } from './db.js';
 export { open, rebuild } from './db.js';
@@ -6,7 +8,5 @@ export type { SenseErrorCode } from './errors.js';
 export { SenseError } from './errors.js';
 export type { Row } from './output.js';
 export { printRows } from './output.js';
-export type { FindOptions, Peek, TreeMap } from './verbs.js';
-export { find, mapTree, peek } from './verbs.js';
 export type { WatchEvent, WatchOptions } from './watch.js';
 export { runWatch } from './watch.js';

package/dist/cjs/index.d.ts

@@ -1,4 +1,6 @@
-export type { Config, EmbedConfig, FeatureName, ResolvedConfig } from './config.js';
+export type { Peek, PresetCoverage, SearchOptions, TreeMap } from './commands.js';
+export { mapTree, peek, presetCoverage, search } from './commands.js';
+export type { Config, EmbedConfig, FeatureName, Preset, ResolvedConfig, SavedQuery, SavedSearch } from './config.js';
 export { CONFIG_FILENAME, initConfig, loadConfig, migrateConfig, STATE_DIR, SUPPORTED_CONFIG_VERSION } from './config.js';
 export type { OpenResult } from './db.js';
 export { open, rebuild } from './db.js';
@@ -6,7 +8,5 @@ export type { SenseErrorCode } from './errors.js';
 export { SenseError } from './errors.js';
 export type { Row } from './output.js';
 export { printRows } from './output.js';
-export type { FindOptions, Peek, TreeMap } from './verbs.js';
-export { find, mapTree, peek } from './verbs.js';
 export type { WatchEvent, WatchOptions } from './watch.js';
 export { runWatch } from './watch.js';

package/dist/cjs/index.js

@@ -23,9 +23,6 @@ _export(exports, {
     get SenseError () {
         return _errorsts.SenseError;
     },
-    get find () {
-        return _verbsts.find;
-    },
     get initConfig () {
         return _configts.initConfig;
     },
@@ -33,7 +30,7 @@ _export(exports, {
         return _configts.loadConfig;
     },
     get mapTree () {
-        return _verbsts.mapTree;
+        return _commandsts.mapTree;
     },
     get migrateConfig () {
         return _configts.migrateConfig;
@@ -42,7 +39,10 @@ _export(exports, {
         return _dbts.open;
     },
     get peek () {
-        return _verbsts.peek;
+        return _commandsts.peek;
+    },
+    get presetCoverage () {
+        return _commandsts.presetCoverage;
     },
     get printRows () {
         return _outputts.printRows;
@@ -52,12 +52,15 @@ _export(exports, {
     },
     get runWatch () {
         return _watchts.runWatch;
+    },
+    get search () {
+        return _commandsts.search;
     }
 });
+var _commandsts = require("./commands.js");
 var _configts = require("./config.js");
 var _dbts = require("./db.js");
 var _errorsts = require("./errors.js");
 var _outputts = require("./output.js");
-var _verbsts = require("./verbs.js");
 var _watchts = require("./watch.js");
 /* CJS INTEROP */ if (exports.__esModule && exports.default) { try { Object.defineProperty(exports.default, '__esModule', { value: true }); for (var key in exports) { exports.default[key] = exports[key]; } } catch (_) {}; module.exports = exports.default; }

package/dist/cjs/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 { Config, EmbedConfig, FeatureName, ResolvedConfig } from './config.ts';\nexport { CONFIG_FILENAME, initConfig, loadConfig, migrateConfig, STATE_DIR, SUPPORTED_CONFIG_VERSION } from './config.ts';\n\nexport type { OpenResult } from './db.ts';\nexport { open, rebuild } from './db.ts';\n\nexport type { SenseErrorCode } from './errors.ts';\nexport { SenseError } from './errors.ts';\n\nexport type { Row } from './output.ts';\nexport { printRows } from './output.ts';\n\nexport type { FindOptions, Peek, TreeMap } from './verbs.ts';\nexport { find, mapTree, peek } from './verbs.ts';\n\nexport type { WatchEvent, WatchOptions } from './watch.ts';\nexport { runWatch } from './watch.ts';\n"],"names":["CONFIG_FILENAME","STATE_DIR","SUPPORTED_CONFIG_VERSION","SenseError","find","initConfig","loadConfig","mapTree","migrateConfig","open","peek","printRows","rebuild","runWatch"],"mappings":"AAAA,+EAA+E;AAC/E,uEAAuE;;;;;;;;;;;;QAG9DA;eAAAA,yBAAe;;QAAyCC;eAAAA,mBAAS;;QAAEC;eAAAA,kCAAwB;;QAM3FC;eAAAA,oBAAU;;QAMVC;eAAAA,aAAI;;QAZaC;eAAAA,oBAAU;;QAAEC;eAAAA,oBAAU;;QAYjCC;eAAAA,gBAAO;;QAZ4BC;eAAAA,uBAAa;;QAGtDC;eAAAA,UAAI;;QASWC;eAAAA,aAAI;;QAHnBC;eAAAA,mBAAS;;QANHC;eAAAA,aAAO;;QAYbC;eAAAA,iBAAQ;;;wBAf2F;oBAG9E;wBAGH;wBAGD;uBAGU;uBAGX"}
+{"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 } from './config.ts';\nexport { CONFIG_FILENAME, initConfig, loadConfig, migrateConfig, STATE_DIR, SUPPORTED_CONFIG_VERSION } from './config.ts';\nexport type { OpenResult } from './db.ts';\nexport { open, rebuild } 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":["CONFIG_FILENAME","STATE_DIR","SUPPORTED_CONFIG_VERSION","SenseError","initConfig","loadConfig","mapTree","migrateConfig","open","peek","presetCoverage","printRows","rebuild","runWatch","search"],"mappings":"AAAA,+EAA+E;AAC/E,uEAAuE;;;;;;;;;;;;QAK9DA;eAAAA,yBAAe;;QAAyCC;eAAAA,mBAAS;;QAAEC;eAAAA,kCAAwB;;QAI3FC;eAAAA,oBAAU;;QAJOC;eAAAA,oBAAU;;QAAEC;eAAAA,oBAAU;;QAFvCC;eAAAA,mBAAO;;QAEkCC;eAAAA,uBAAa;;QAEtDC;eAAAA,UAAI;;QAJKC;eAAAA,gBAAI;;QAAEC;eAAAA,0BAAc;;QAQ7BC;eAAAA,mBAAS;;QAJHC;eAAAA,aAAO;;QAObC;eAAAA,iBAAQ;;QAXuBC;eAAAA,kBAAM;;;0BAAQ;wBAEsD;oBAE9E;wBAEH;wBAED;uBAGD"}

package/dist/cjs/output.d.cts

@@ -1,5 +1,15 @@
 export type Row = Record<string, unknown>;
 export declare function printRows(rows: Row[], format: 'table' | 'json'): void;
+export declare function featureOffHint(name: string): string;
+export declare function featuresLine(features: {
+    on: string[];
+    off: string[];
+}): string;
+export declare function presetsLines(presets: Array<{
+    name: string;
+    files: number;
+    embedded: number;
+}>): string[];
 export declare function renderMap(result: {
     docs: {
         count: number;
@@ -11,6 +21,11 @@ export declare function renderMap(result: {
         on: string[];
         off: string[];
     };
+    presets: Array<{
+        name: string;
+        files: number;
+        embedded: number;
+    }>;
     hubs: Row[];
     recent: Row[];
 }): string;
@@ -22,6 +37,7 @@ export declare function renderPeek(result: {
     outbound: string[];
     backlinks: string[];
     unresolved: string[];
+    sectionsTotal: number;
     outboundTotal: number;
     backlinksTotal: number;
     unresolvedTotal: number;

package/dist/cjs/output.d.ts

@@ -1,5 +1,15 @@
 export type Row = Record<string, unknown>;
 export declare function printRows(rows: Row[], format: 'table' | 'json'): void;
+export declare function featureOffHint(name: string): string;
+export declare function featuresLine(features: {
+    on: string[];
+    off: string[];
+}): string;
+export declare function presetsLines(presets: Array<{
+    name: string;
+    files: number;
+    embedded: number;
+}>): string[];
 export declare function renderMap(result: {
     docs: {
         count: number;
@@ -11,6 +21,11 @@ export declare function renderMap(result: {
         on: string[];
         off: string[];
     };
+    presets: Array<{
+        name: string;
+        files: number;
+        embedded: number;
+    }>;
     hubs: Row[];
     recent: Row[];
 }): string;
@@ -22,6 +37,7 @@ export declare function renderPeek(result: {
     outbound: string[];
     backlinks: string[];
     unresolved: string[];
+    sectionsTotal: number;
     outboundTotal: number;
     backlinksTotal: number;
     unresolvedTotal: number;