sensemaking 0.12.2 → 0.13.0

package/dist/cjs/{commands.js → commands/search.js}

@@ -2,45 +2,22 @@
 Object.defineProperty(exports, "__esModule", {
     value: true
 });
-function _export(target, all) {
-    for(var name in all)Object.defineProperty(target, name, {
-        enumerable: true,
-        get: Object.getOwnPropertyDescriptor(all, name).get
-    });
-}
-_export(exports, {
-    get mapTree () {
-        return mapTree;
-    },
-    get peek () {
-        return peek;
-    },
-    get presetCoverage () {
-        return presetCoverage;
-    },
-    get relatedNotes () {
-        return relatedNotes;
-    },
-    get resolveNote () {
-        return resolveNote;
-    },
-    get scopedPaths () {
-        return scopedPaths;
-    },
-    get search () {
+Object.defineProperty(exports, "search", {
+    enumerable: true,
+    get: function() {
         return search;
     }
 });
 var _nodefs = require("node:fs");
 var _nodepath = require("node:path");
-var _posix = /*#__PURE__*/ _interop_require_default(require("node:path/posix"));
-var _configts = require("./config.js");
-var _errorsts = require("./errors.js");
-var _embedts = require("./features/embed.js");
-var _indexts = require("./features/index.js");
-var _graphts = require("./graph.js");
-var _searcherrorts = require("./search-error.js");
-var _segmentts = require("./segment.js");
+var _indexts = require("../config/index.js");
+var _errorsts = require("../errors.js");
+var _embedts = require("../features/embed.js");
+var _indexts1 = require("../features/index.js");
+var _graphts = require("../graph.js");
+var _searcherrorts = require("../search-error.js");
+var _segmentts = require("../segment.js");
+var _scopets = require("./scope.js");
 function _array_like_to_array(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
@@ -81,11 +58,6 @@ function _async_to_generator(fn) {
         });
     };
 }
-function _interop_require_default(obj) {
-    return obj && obj.__esModule ? obj : {
-        default: obj
-    };
-}
 function _iterable_to_array(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
@@ -232,8 +204,6 @@ function _ts_generator(thisArg, body) {
         };
     }
 }
-// The three commands: mapTree (orient), search (locate), peek (structure).
-// Each returns data; cli.ts renders. All of them degrade when a feature is off.
 // Mirrors the main columns onto the sidecars, so a title match found through title_seg ranks
 // like a title match found through title, not like a body match.
 var WEIGHTED_BM25 = 'bm25(content, 10.0, 5.0, 1.0, 0, 10.0, 5.0, 1.0)';
@@ -375,25 +345,6 @@ function lineRangeFor(db, path, line) {
     var 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);
     return row ? "L".concat(row.start_line, "-").concat(row.end_line) : null;
 }
-// node:path's matchesGlob is experimental (stable behind an unstable-API flag) as of the
-// engines floor (Node >=22.20); scope filtering only ever needs single-pattern matching, so
-// it's used here in JS rather than running a directory walk in the query path.
-function inScope(path, include, exclude) {
-    if (!include.some(function(g) {
-        return (0, _nodepath.matchesGlob)(path, g);
-    })) return false;
-    if (exclude === null || exclude === void 0 ? void 0 : exclude.some(function(g) {
-        return (0, _nodepath.matchesGlob)(path, g);
-    })) return false;
-    return true;
-}
-function scopeHasEmbeddings(db, cfg, scopedPaths) {
-    if (!(0, _configts.anyPresetEmbeds)(cfg)) return false; // the embeddings table doesn't exist at all in this case
-    var rows = db.prepare('SELECT DISTINCT "path" FROM embeddings').all();
-    return rows.some(function(r) {
-        return scopedPaths.has(r.path);
-    });
-}
 function search(_0, _1, _2) {
     return _async_to_generator(function(db, cfg, terms) {
         var opts, _hits_get, _chunkLines_get, _chunkSimilarity_get, effective, k, allPaths, scopePaths, scopeActive, allowedPaths, fetch, wantsVectors, semanticEnabled, scope, whereJoin, whereCond, scopeCond, matchSql, query, matchRows, hits, oversized, candidates, edges, linked, seeds, ranked, chunkLines, chunkSimilarity, vec, insert, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, _step_value, path, c, where, similarityCol, rows, bareTerms, _iteratorNormalCompletion1, _didIteratorError1, _iteratorError1, _iterator1, _step1, row, text, _computeExcerpt, excerpt, offset;
@@ -402,26 +353,26 @@ function search(_0, _1, _2) {
             switch(_state.label){
                 case 0:
                     opts = _arguments.length > 3 && _arguments[3] !== void 0 ? _arguments[3] : {};
-                    effective = (0, _configts.resolveSearch)(cfg, opts);
+                    effective = (0, _indexts.resolveSearch)(cfg, opts);
                     k = effective.k;
                     allPaths = db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
                         return r.path;
                     });
-                    scopePaths = rawScope(db, cfg, opts, allPaths);
+                    scopePaths = (0, _scopets.rawScope)(db, cfg, opts, allPaths);
                     scopeActive = scopePaths.size < allPaths.length;
                     try {
-                        allowedPaths = narrowByWhere(db, scopePaths, effective.where);
+                        allowedPaths = (0, _scopets.narrowByWhere)(db, scopePaths, effective.where);
                     } catch (err) {
                         throw (0, _searcherrorts.searchError)(err, terms, effective.where);
                     }
                     fetch = Math.max(k * 3, 30);
                     // Asking for vectors without a model is a misconfiguration, not a mode: degrading would make
                     // the same search answer differently before and after a download. semantic:false never asks.
-                    wantsVectors = effective.semantic && (0, _configts.anyPresetEmbeds)(cfg);
+                    wantsVectors = effective.semantic && (0, _indexts.anyPresetEmbeds)(cfg);
                     if (wantsVectors && !(0, _embedts.modelPresent)(cfg)) {
                         throw new _errorsts.SenseError('EMBED_MODEL_MISSING', 'preset "'.concat(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'));
                     }
-                    semanticEnabled = wantsVectors && scopeHasEmbeddings(db, cfg, allowedPaths);
+                    semanticEnabled = wantsVectors && (0, _scopets.scopeHasEmbeddings)(db, cfg, allowedPaths);
                     // Terms pass to MATCH as written, with one transform: a run of text whose language marks no
                     // word boundaries becomes a quoted grapheme phrase (and a title:/summary:/text: qualifier
                     // ahead of it retargets its _seg column), matching how it was indexed. Text that already
@@ -439,7 +390,7 @@ function search(_0, _1, _2) {
                     // after -- otherwise scoped notes ranking below the global top-`fetch` never reach the
                     // filter. A join against a temp table, not a bound parameter list: real scopes run to
                     // thousands of paths, past SQLITE_MAX_VARIABLE_NUMBER on older builds.
-                    if (scopeActive) materializeScope(db, '_search_scope', scopePaths);
+                    if (scopeActive) (0, _scopets.materializeScope)(db, '_search_scope', scopePaths);
                     scopeCond = scopeActive ? 'AND content.path IN (SELECT "path" FROM _search_scope)' : '';
                     // Docs past SNIPPET_BOUND skip snippet() entirely -- SQLite
                     // short-circuits the untaken CASE branch, so it's never invoked on them.
@@ -447,7 +398,7 @@ function search(_0, _1, _2) {
                     // which is machine-spaced and not what the author wrote. A row that matches only in a
                     // sidecar gets an unhighlighted text excerpt below instead -- a stated cost.
                     matchSql = "SELECT content.path AS path, CASE WHEN length(content.text) <= ".concat(SNIPPET_BOUND, " THEN snippet(content, 2, '\xab', '\xbb', '…', 10) ELSE NULL END AS hit FROM content ").concat(whereJoin, " WHERE content MATCH ? ").concat(whereCond, " ").concat(scopeCond, " ORDER BY ").concat(WEIGHTED_BM25, " LIMIT ").concat(fetch);
-                    query = (0, _configts.contentTokenize)(cfg) === undefined ? (0, _segmentts.segmentMatch)(terms) : terms;
+                    query = (0, _indexts.contentTokenize)(cfg) === undefined ? (0, _segmentts.segmentMatch)(terms) : terms;
                     try {
                         matchRows = db.prepare(matchSql).all(query);
                     } catch (err) {
@@ -473,7 +424,7 @@ function search(_0, _1, _2) {
                             via: 'match'
                         });
                     });
-                    edges = (0, _configts.featureEnabled)(cfg, 'links') && matchRows.length > 0 ? (0, _indexts.linkEdges)(db) : [];
+                    edges = (0, _indexts.featureEnabled)(cfg, 'links') && matchRows.length > 0 ? (0, _indexts1.linkEdges)(db) : [];
                     if (edges.length > 0) {
                         // Gates the label only, not the score: restart mass ranks every seed without an incident
                         // edge, but dropping it from the score reweights fusion (FEVER hit@10 0.997 -> 0.907).
@@ -581,7 +532,7 @@ function search(_0, _1, _2) {
                                 }
                                 _computeExcerpt = computeExcerpt(text, bareTerms), excerpt = _computeExcerpt.excerpt, offset = _computeExcerpt.offset;
                                 row.hit = excerpt;
-                                if (row.lines == null) row.lines = (0, _configts.featureEnabled)(cfg, 'sections') ? lineRangeFor(db, row.path, lineNumberAt(text, offset)) : null;
+                                if (row.lines == null) row.lines = (0, _indexts.featureEnabled)(cfg, 'sections') ? lineRangeFor(db, row.path, lineNumberAt(text, offset)) : null;
                             }
                         } catch (err) {
                             _didIteratorError1 = true;
@@ -606,293 +557,4 @@ function search(_0, _1, _2) {
         });
     }).apply(this, arguments);
 }
-// Scope only (no --where): preset_files for a named preset, JS glob matching for an ad hoc
-// include/exclude override. Shared by scopedPaths() and search(), which also needs the
-// pre-where set to size the candidate-pool filter.
-function rawScope(db, cfg, overrides, allPaths) {
-    var effective = (0, _configts.resolveSearch)(cfg, overrides);
-    var include = effective.include, exclude = effective.exclude;
-    var adHocScope = overrides.include !== undefined || overrides.exclude !== undefined || overrides.noExclude === true;
-    if (!adHocScope) return new Set(db.prepare('SELECT "path" FROM preset_files WHERE preset = ?').all(effective.presetName).map(function(r) {
-        return r.path;
-    }));
-    var paths = allPaths !== null && allPaths !== void 0 ? allPaths : db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
-        return r.path;
-    });
-    return new Set(paths.filter(function(p) {
-        return inScope(p, include, exclude);
-    }));
-}
-function narrowByWhere(db, paths, where) {
-    if (!where) return paths;
-    var whereRows = db.prepare('SELECT "path" FROM frontmatter f WHERE ('.concat(where, ")")).all();
-    var wherePaths = new Set(whereRows.map(function(r) {
-        return r.path;
-    }));
-    return new Set(_to_consumable_array(paths).filter(function(p) {
-        return wherePaths.has(p);
-    }));
-}
-function scopedPaths(db, cfg, overrides) {
-    var effective = (0, _configts.resolveSearch)(cfg, overrides);
-    return narrowByWhere(db, rawScope(db, cfg, overrides), effective.where);
-}
-function presetCoverage(db, cfg) {
-    var embedActive = (0, _configts.anyPresetEmbeds)(cfg);
-    return (0, _configts.presetNames)(cfg).map(function(name) {
-        var files = db.prepare('SELECT COUNT(*) AS n FROM preset_files WHERE preset = ?').get(name).n;
-        var 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).n : 0;
-        return {
-            name: name,
-            files: files,
-            embedded: embedded,
-            semantic: (0, _configts.presetSemanticEnabled)(cfg, name)
-        };
-    });
-}
-var INTERNAL_COLUMNS = new Set([
-    'path',
-    '_mtime',
-    '_size',
-    '_rank',
-    '_parse_error'
-]);
-// A result row is capped at SQLITE_MAX_COLUMN (2000, default); two aggregate expressions
-// per field keeps a chunk's row safely under that regardless of how many fields the tree has.
-var MAP_COLUMN_CHUNK = 300;
-function chunk(items, size) {
-    var out = [];
-    for(var i = 0; i < items.length; i += size)out.push(items.slice(i, i + size));
-    return out;
-}
-// Materializes a path set into a named temp table (same shape as traverse.ts's allowed_nodes)
-// so a query can join/filter against it cheaply instead of binding a parameter per path.
-function materializeScope(db, table, paths) {
-    db.exec("DROP TABLE IF EXISTS ".concat(table));
-    db.exec("CREATE TEMP TABLE ".concat(table, ' ("path" TEXT PRIMARY KEY)'));
-    db.prepare("INSERT INTO ".concat(table, " SELECT DISTINCT value FROM json_each(?1)")).run(JSON.stringify(_to_consumable_array(paths)));
-}
-function setupMapScope(db, paths) {
-    materializeScope(db, '_map_scope', paths);
-}
-function mapTree(db, cfg) {
-    var overrides = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-    setupMapScope(db, scopedPaths(db, cfg, overrides));
-    var scopeWhere = 'WHERE "path" IN (SELECT "path" FROM _map_scope)';
-    var scopeAnd = 'AND f."path" IN (SELECT "path" FROM _map_scope)';
-    var docs = db.prepare('SELECT COUNT(*) AS count, COALESCE(SUM("_size"), 0) AS bytes FROM frontmatter '.concat(scopeWhere)).get();
-    var columns = db.prepare('PRAGMA table_info(frontmatter)').all().map(function(r) {
-        return r.name;
-    }).filter(function(name) {
-        return !INTERNAL_COLUMNS.has(name);
-    });
-    // Observed types, not declared: SQLite types per value, so a field can be text in most notes
-    // and numeric in a few. One aggregate scan per chunk of columns; FILTER matches COUNT's nulls.
-    var allFields = [];
-    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
-    try {
-        var _loop = function() {
-            var group = _step.value;
-            var exprs = group.map(function(name, i) {
-                var quoted = '"'.concat(name.split('"').join('""'), '"');
-                return "COUNT(".concat(quoted, ") AS n").concat(i, ", GROUP_CONCAT(DISTINCT typeof(").concat(quoted, ")) FILTER (WHERE ").concat(quoted, " IS NOT NULL) AS t").concat(i);
-            });
-            var result = db.prepare("SELECT ".concat(exprs.join(', '), " FROM frontmatter ").concat(scopeWhere)).get();
-            group.forEach(function(name, i) {
-                var _result_;
-                return allFields.push({
-                    field: name,
-                    coverage: result["n".concat(i)],
-                    type: (_result_ = result["t".concat(i)]) !== null && _result_ !== void 0 ? _result_ : ''
-                });
-            });
-        };
-        for(var _iterator = chunk(columns, MAP_COLUMN_CHUNK)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true)_loop();
-    } catch (err) {
-        _didIteratorError = true;
-        _iteratorError = err;
-    } finally{
-        try {
-            if (!_iteratorNormalCompletion && _iterator.return != null) {
-                _iterator.return();
-            }
-        } finally{
-            if (_didIteratorError) {
-                throw _iteratorError;
-            }
-        }
-    }
-    allFields.sort(function(a, b) {
-        return b.coverage - a.coverage;
-    });
-    var fields = allFields.slice(0, 20);
-    var hubs = (0, _configts.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 '.concat(scopeAnd, ' ORDER BY f."_rank" DESC LIMIT 8')).all() : [];
-    var recent = db.prepare('SELECT "path", datetime("_mtime" / 1000, \'unixepoch\') AS modified FROM frontmatter '.concat(scopeWhere, ' ORDER BY "_mtime" DESC LIMIT 5')).all();
-    // A fresh clone/copy stamps files with checkout time, not edit history; second granularity
-    // matches the `recent` table above and is coarse enough to catch that without an exact-ms match.
-    var topSecond = db.prepare("SELECT COUNT(*) AS n FROM frontmatter ".concat(scopeWhere, ' GROUP BY CAST("_mtime" / 1000 AS INTEGER) ORDER BY n DESC LIMIT 1')).get();
-    var recentCaveat = topSecond && docs.count > 1 && topSecond.n > docs.count / 2 ? "".concat(topSecond.n, " of ").concat(docs.count, " files share one modified second, so recency likely reflects a checkout or copy, not edit history") : null;
-    return {
-        docs: docs,
-        fields: fields,
-        fieldsTotal: allFields.length,
-        features: (0, _configts.featureStates)(cfg),
-        presets: presetCoverage(db, cfg),
-        hubs: hubs,
-        recent: recent,
-        recentCaveat: recentCaveat
-    };
-}
-function resolveNote(paths, arg) {
-    var exact = paths.find(function(p) {
-        return p === arg;
-    });
-    if (exact) return exact;
-    var base = _posix.default.basename(arg).replace(/\.md$/i, '').toLowerCase();
-    var matches = paths.filter(function(p) {
-        return _posix.default.basename(p).replace(/\.md$/i, '').toLowerCase() === base;
-    });
-    if (matches.length === 1) return matches[0];
-    if (matches.length > 1) throw new _errorsts.SenseError('NOTE_AMBIGUOUS', '"'.concat(arg, '" is ambiguous: ').concat(matches.join(', ')));
-    throw new _errorsts.SenseError('NOTE_NOT_FOUND', 'no note matches "'.concat(arg, '"'));
-}
-var PEEK_LIST_LIMIT = 20;
-function peek(db, cfg, pathArg) {
-    var overrides = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : {};
-    var _row__parse_error, _row__size;
-    var paths = db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
-        return r.path;
-    });
-    var path = resolveNote(paths, pathArg);
-    var row = db.prepare('SELECT * FROM frontmatter WHERE "path" = ?').get(path);
-    var parseError = (_row__parse_error = row._parse_error) !== null && _row__parse_error !== void 0 ? _row__parse_error : null;
-    var frontmatter = {};
-    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
-    try {
-        for(var _iterator = Object.entries(row)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
-            var _step_value = _sliced_to_array(_step.value, 2), key = _step_value[0], value = _step_value[1];
-            if (!INTERNAL_COLUMNS.has(key) && value !== null) frontmatter[key] = value;
-        }
-    } catch (err) {
-        _didIteratorError = true;
-        _iteratorError = err;
-    } finally{
-        try {
-            if (!_iteratorNormalCompletion && _iterator.return != null) {
-                _iterator.return();
-            }
-        } finally{
-            if (_didIteratorError) {
-                throw _iteratorError;
-            }
-        }
-    }
-    var sectionsTotal = (0, _configts.featureEnabled)(cfg, 'sections') ? db.prepare('SELECT COUNT(*) AS n FROM sections WHERE "path" = ?').get(path).n : 0;
-    var sections = (0, _configts.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) : [];
-    var outbound = [];
-    var backlinks = [];
-    var unresolved = [];
-    var backlinksTotal = 0;
-    var _allowed = scopedPaths(db, cfg, overrides);
-    if ((0, _configts.featureEnabled)(cfg, 'links')) {
-        var out = db.prepare('SELECT target, dst FROM links WHERE src = ? ORDER BY target').all(path);
-        outbound = _to_consumable_array(new Set(out.filter(function(l) {
-            return l.dst !== null;
-        }).map(function(l) {
-            return l.dst;
-        })));
-        unresolved = out.filter(function(l) {
-            return l.dst === null;
-        }).map(function(l) {
-            return l.target;
-        });
-        backlinksTotal = db.prepare('SELECT COUNT(DISTINCT src) AS n FROM links WHERE dst = ?').get(path).n;
-        backlinks = db.prepare('SELECT DISTINCT src FROM links WHERE dst = ? ORDER BY src LIMIT ?').all(path, PEEK_LIST_LIMIT).map(function(r) {
-            return r.src;
-        });
-    }
-    return {
-        path: path,
-        tokens: Math.ceil(((_row__size = row._size) !== null && _row__size !== void 0 ? _row__size : 0) / 4),
-        frontmatter: frontmatter,
-        parseError: parseError,
-        sections: sections,
-        outbound: outbound.slice(0, PEEK_LIST_LIMIT),
-        backlinks: backlinks,
-        unresolved: unresolved.slice(0, PEEK_LIST_LIMIT),
-        sectionsTotal: sectionsTotal,
-        outboundTotal: outbound.length,
-        backlinksTotal: backlinksTotal,
-        unresolvedTotal: unresolved.length,
-        off: [
-            'sections',
-            'links'
-        ].filter(function(name) {
-            return !(0, _configts.featureEnabled)(cfg, name);
-        })
-    };
-}
-function relatedNotes(db, cfg, pathArg, overrides, k) {
-    return _async_to_generator(function() {
-        var paths, path, outbound, backlinks, exclude, effective, allowed;
-        return _ts_generator(this, function(_state) {
-            switch(_state.label){
-                case 0:
-                    paths = db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
-                        return r.path;
-                    });
-                    path = resolveNote(paths, pathArg);
-                    outbound = db.prepare('SELECT DISTINCT dst FROM links WHERE src = ? AND dst IS NOT NULL').all(path).map(function(r) {
-                        return r.dst;
-                    });
-                    backlinks = db.prepare('SELECT DISTINCT src FROM links WHERE dst = ?').all(path).map(function(r) {
-                        return r.src;
-                    });
-                    exclude = new Set([
-                        path
-                    ].concat(_to_consumable_array(outbound), _to_consumable_array(backlinks)));
-                    // Vectors are the only signal `related` has, so every way of not having them is an error
-                    // naming the cause. An empty table then means one thing: nothing near in meaning that this
-                    // note does not already link to, which is a real answer.
-                    effective = (0, _configts.resolveSearch)(cfg, overrides);
-                    if (!(0, _configts.embedEnabled)(cfg)) {
-                        throw new _errorsts.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)');
-                    }
-                    // search gates on the same flag (see wantsVectors above); reading it here too keeps
-                    // `semantic: false` meaning one thing. Without this, an overlapping semantic-on preset's
-                    // vectors would answer for a scope that declined them.
-                    if (!effective.semantic) {
-                        throw new _errorsts.SenseError('PRESET_NOT_SEMANTIC', 'preset "'.concat(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'));
-                    }
-                    if (!(0, _embedts.modelPresent)(cfg)) {
-                        throw new _errorsts.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)');
-                    }
-                    allowed = scopedPaths(db, cfg, overrides);
-                    // Top up pending rows before the seed check, or a fresh index reports every note as
-                    // having no indexed text until some search has run.
-                    return [
-                        4,
-                        (0, _embedts.embedPending)(db, cfg, cfg.baseDir)
-                    ];
-                case 1:
-                    _state.sent();
-                    if (!(0, _embedts.hasEmbedding)(db, path)) {
-                        throw new _errorsts.SenseError('NOTE_NOT_EMBEDDED', "".concat(path, " has no indexed text to compare -- a note that is frontmatter only, or empty, has nothing to rank by meaning"));
-                    }
-                    if (!scopeHasEmbeddings(db, cfg, allowed)) return [
-                        2,
-                        []
-                    ];
-                    return [
-                        2,
-                        (0, _embedts.similarNotes)(db, cfg, path, {
-                            exclude: exclude,
-                            allowed: allowed,
-                            k: k
-                        })
-                    ];
-            }
-        });
-    })();
-}
 /* 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/commands/search.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands/search.ts"],"sourcesContent":["import { readFileSync } from 'node:fs';\nimport { join } from 'node:path';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { ResolvedConfig } from '../config/index.ts';\nimport { anyPresetEmbeds, contentTokenize, featureEnabled, resolveSearch } from '../config/index.ts';\nimport { SenseError } from '../errors.ts';\nimport { modelPresent, semanticCandidates } 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';\nimport { materializeScope, narrowByWhere, rawScope, scopeHasEmbeddings } from './scope.ts';\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// 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"],"names":["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","cfg","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","rows","bareTerms","resolveSearch","all","r","rawScope","narrowByWhere","err","searchError","max","semantic","anyPresetEmbeds","modelPresent","SenseError","presetName","scopeHasEmbeddings","materializeScope","contentTokenize","undefined","segmentMatch","Map","hit","forEach","set","score","via","featureEnabled","linkEdges","flat","personalizedRank","has","existing","semanticCandidates","lines","similarity","exec","run","readFileSync","join","baseDir"],"mappings":";;;;+BAgIsBA;;;eAAAA;;;sBAhIO;wBACR;uBAG2D;wBACrD;uBACsB;wBACvB;uBACO;6BAEL;yBACC;uBACiD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAE9E,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;AAaO,SAAejE;wCAAO2D,EAAgB,EAAEO,GAAmB,EAAEhD,KAAa;YAAEiD,MA+GZC,WAAwBC,iBAA8BC,sBA9GrHC,WACEC,GAEFC,UACAC,YACAC,aAIFC,cAMEC,OAIAC,cAIAC,iBAYAC,OACAC,WACAC,WAMAC,WAMAC,UACA9E,OACF+E,WAOEjB,MAGAkB,WACAC,YAKAC,OAIEC,QACAC,OACAC,QAiBFtB,YACAC,iBAEEsB,KAgBFC,QACD,2BAAA,mBAAA,gBAAA,WAAA,oBAAOjC,MAAMkC,GAKZC,OAGAC,eACAC,MASEC,WACD,4BAAA,oBAAA,iBAAA,YAAA,QAAMrC,KAELjB,MAMwBD,iBAApBI,SAASE;;;;;oBA1I4DkB,OAAAA,oEAAsB,CAAC;oBAClGI,YAAY4B,IAAAA,sBAAa,EAACjC,KAAKC;oBAC7BK,IAAMD,UAANC;oBAEFC,WAAW,AAACd,GAAGG,OAAO,CAAC,kCAAkCsC,GAAG,GAA+B1F,GAAG,CAAC,SAAC2F;+BAAMA,EAAEzC,IAAI;;oBAC5Gc,aAAa4B,IAAAA,iBAAQ,EAAC3C,IAAIO,KAAKC,MAAMM;oBACrCE,cAAcD,WAAWhC,IAAI,GAAG+B,SAAS1D,MAAM;oBAKrD,IAAI;wBACF6D,eAAe2B,IAAAA,sBAAa,EAAC5C,IAAIe,YAAYH,UAAUwB,KAAK;oBAC9D,EAAE,OAAOS,KAAK;wBACZ,MAAMC,IAAAA,0BAAW,EAACD,KAActF,OAAOqD,UAAUwB,KAAK;oBACxD;oBACMlB,QAAQhC,KAAK6D,GAAG,CAAClC,IAAI,GAAG;oBAE9B,6FAA6F;oBAC7F,6FAA6F;oBACvFM,eAAeP,UAAUoC,QAAQ,IAAIC,IAAAA,wBAAe,EAAC1C;oBAC3D,IAAIY,gBAAgB,CAAC+B,IAAAA,qBAAY,EAAC3C,MAAM;wBACtC,MAAM,IAAI4C,oBAAU,CAAC,uBAAuB,AAAC,WAA+B,OAArBvC,UAAUwC,UAAU,EAAC;oBAC9E;oBACMhC,kBAAkBD,gBAAgBkC,IAAAA,2BAAkB,EAACrD,IAAIO,KAAKU;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,aAAasC,IAAAA,yBAAgB,EAACtD,IAAI,iBAAiBe;oBACjDS,YAAYR,cAAc,2DAA2D;oBAC3F,4DAA4D;oBAC5D,yEAAyE;oBACzE,yFAAyF;oBACzF,sFAAsF;oBACtF,6EAA6E;oBACvES,WAAW,AAAC,kEAAgKH,OAA/F9E,eAAc,yFAAoH+E,OAAnCD,WAAU,2BAAsCE,OAAbD,WAAU,KAAyBjF,OAAtBkF,WAAU,cAAmCN,OAAvB5E,eAAc,WAAe,OAAN4E;oBACzQvE,QAAQ4G,IAAAA,wBAAe,EAAChD,SAASiD,YAAYC,IAAAA,uBAAY,EAAClG,SAASA;oBAEzE,IAAI;wBACFmE,YAAY1B,GAAGG,OAAO,CAACsB,UAAUgB,GAAG,CAAC9F;oBACvC,EAAE,OAAOkG,KAAK;wBACZ,MAAMC,IAAAA,0BAAW,EAACD,KAActF,OAAO8D;oBACzC;oBAEMZ,OAAO,IAAIiD,IAAIhC,UAAU3E,GAAG,CAAC,SAAC2F;+BAAM;4BAACA,EAAEzC,IAAI;4BAAEyC,EAAEiB,GAAG;yBAAC;;oBACzD,wFAAwF;oBACxF,4EAA4E;oBACtEhC,YAAY,IAAIhD,IAAI+C,UAAUvE,MAAM,CAAC,SAACuF;+BAAMA,EAAEiB,GAAG,KAAK;uBAAM5G,GAAG,CAAC,SAAC2F;+BAAMA,EAAEzC,IAAI;;oBAC7E2B,aAAa,IAAI8B;oBACvBhC,UAAUkC,OAAO,CAAC,SAAClB,GAAGlE;wBACpBoD,WAAWiC,GAAG,CAACnB,EAAEzC,IAAI,EAAE;4BAAE6D,OAAO,IAAKvH,CAAAA,QAAQiC,CAAAA;4BAAIuF,KAAK;wBAAQ;oBAChE;oBAEMlC,QAAQmC,IAAAA,uBAAc,EAACzD,KAAK,YAAYmB,UAAUtE,MAAM,GAAG,IAAI6G,IAAAA,mBAAS,EAACjE;oBAC/E,IAAI6B,MAAMzE,MAAM,GAAG,GAAG;wBACpB,yFAAyF;wBACzF,uFAAuF;wBACjF0E,SAAS,IAAInD,IAAIkD,MAAMqC,IAAI;wBAC3BnC,QAAQ,IAAI2B,IAAIhC,UAAU3E,GAAG,CAAC,SAAC2F,GAAGlE;mCAAM;gCAACkE,EAAEzC,IAAI;gCAAE,IAAKzB,CAAAA,IAAI,CAAA;6BAAG;;wBAC7DwD,SAAS,AAAC,qBAAGmC,IAAAA,yBAAgB,EAACrD,UAAUe,OAAOE,QAClD5E,MAAM,CAAC;qEAAE8C,kBAAM6D;mCAAWA,QAAQ,QAAQ7C,aAAamD,GAAG,CAACnE;2BAC3DjC,IAAI,CAAC,SAACC,GAAGC;mCAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE;2BAC1BoB,KAAK,CAAC,GAAG6B;wBACZc,OAAO4B,OAAO,CAAC,gBAASpF;qEAAPyB;4BACf,IAAMoE,WAAWzC,WAAWxB,GAAG,CAACH;4BAChC,IAAIoE,UAAU;gCACZA,SAASP,KAAK,IAAI,IAAKvH,CAAAA,QAAQiC,CAAAA;gCAC/B,IAAIsD,OAAOsC,GAAG,CAACnE,OAAOoE,SAASN,GAAG,GAAG;4BACvC,OAAO;gCACLnC,WAAWiC,GAAG,CAAC5D,MAAM;oCAAE6D,OAAO,IAAKvH,CAAAA,QAAQiC,CAAAA;oCAAIuF,KAAK;gCAAO;4BAC7D;wBACF;oBACF;oBAEA,sFAAsF;oBACtF,0EAA0E;oBACpErD,aAAa,IAAIgD;oBACjB/C,kBAAkB,IAAI+C;yBACxBtC,iBAAAA;;;;oBACU;;wBAAMkD,IAAAA,2BAAkB,EAACtE,IAAIO,KAAKhD,OAAO2D,OAAOD;;;oBAAtDgB,MAAM;oBACZA,IAAI2B,OAAO,CAAC,gBAA8BpF;4BAA3ByB,aAAAA,MAAMsE,cAAAA,OAAOC,mBAAAA;wBAC1B9D,WAAWmD,GAAG,CAAC5D,MAAMsE;wBACrB5D,gBAAgBkD,GAAG,CAAC5D,MAAMuE;wBAC1B,IAAMH,WAAWzC,WAAWxB,GAAG,CAACH;wBAChC,IAAIoE,UAAU;4BACZA,SAASP,KAAK,IAAI,IAAKvH,CAAAA,QAAQiC,CAAAA;4BAC/B6F,SAASN,GAAG,GAAG,AAAC,GAAe,OAAbM,SAASN,GAAG,EAAC;wBACjC,OAAO;4BACLnC,WAAWiC,GAAG,CAAC5D,MAAM;gCAAE6D,OAAO,IAAKvH,CAAAA,QAAQiC,CAAAA;gCAAIuF,KAAK;4BAAS;wBAC/D;oBACF;;;oBAGF/D,GAAGyE,IAAI,CAAC;oBACRzE,GAAGyE,IAAI,CAAC;oBACFvC,SAASlC,GAAGG,OAAO,CAAC;oBACrB,kCAAA,2BAAA;;wBAAL,IAAK,YAAmByB,iCAAnB,6BAAA,QAAA,yBAAA;2DAAA,iBAAO3B,uBAAMkC;4BAAkBD,OAAOwC,GAAG,CAACzE,MAAMkC,EAAE2B,KAAK,EAAE3B,EAAE4B,GAAG,GAAEtD,YAAAA,KAAKL,GAAG,CAACH,mBAATQ,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWN,GAAG,CAACH,mBAAfS,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBP,GAAG,CAACH,mBAApBU,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;oBAC3DkB,OAAOtC,GACVG,OAAO,CACN,AAAC,qIAEEiC,OAFkIC,eAAc,gIAE1I,OAAND,OAAM,yCAEVK,GAAG,CAAC5B;oBAEP,IAAIc,UAAU5C,IAAI,GAAG,GAAG;wBAChBwD,YAAY7F,iBAAiBa;wBAC9B,mCAAA,4BAAA;;4BAAL,IAAK,aAAa+E,2BAAb,8BAAA,SAAA,0BAAA,kCAAmB;gCAAbpC,MAAN;gCACH,IAAIA,IAAIyD,GAAG,KAAK,QAAQ,CAAChC,UAAUyC,GAAG,CAAClE,IAAID,IAAI,GAAa;gCACxDhB,OAAAA,KAAAA;gCACJ,IAAI;oCACFA,OAAO0F,IAAAA,oBAAY,EAACC,IAAAA,cAAI,EAACrE,IAAIsE,OAAO,EAAE3E,IAAID,IAAI,GAAa;gCAC7D,EAAE,eAAM;oCACN,UAAU,mEAAmE;gCAC/E;gCAC4BjB,kBAAAA,eAAeC,MAAMsD,YAAzCnD,UAAoBJ,gBAApBI,SAASE,SAAWN,gBAAXM;gCACjBY,IAAIyD,GAAG,GAAGvE;gCACV,IAAIc,IAAIqE,KAAK,IAAI,MAAMrE,IAAIqE,KAAK,GAAGP,IAAAA,uBAAc,EAACzD,KAAK,cAAcR,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;4BAC1I;;4BAXK;4BAAA;;;qCAAA,8BAAA;oCAAA;;;oCAAA;0CAAA;;;;oBAYP;oBAEA;;wBAAOgD;;;;IACT"}

package/dist/cjs/commands/status.d.cts

@@ -0,0 +1,9 @@
+import type { DatabaseSync } from 'node:sqlite';
+import type { ResolvedConfig } from '../config/index.js';
+export interface PresetCoverage {
+    name: string;
+    files: number;
+    embedded: number;
+    semantic: boolean;
+}
+export declare function presetCoverage(db: DatabaseSync, cfg: ResolvedConfig): PresetCoverage[];

package/dist/cjs/commands/status.d.ts

@@ -0,0 +1,9 @@
+import type { DatabaseSync } from 'node:sqlite';
+import type { ResolvedConfig } from '../config/index.js';
+export interface PresetCoverage {
+    name: string;
+    files: number;
+    embedded: number;
+    semantic: boolean;
+}
+export declare function presetCoverage(db: DatabaseSync, cfg: ResolvedConfig): PresetCoverage[];

package/dist/cjs/commands/status.js

@@ -0,0 +1,25 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", {
+    value: true
+});
+Object.defineProperty(exports, "presetCoverage", {
+    enumerable: true,
+    get: function() {
+        return presetCoverage;
+    }
+});
+var _indexts = require("../config/index.js");
+function presetCoverage(db, cfg) {
+    var embedActive = (0, _indexts.anyPresetEmbeds)(cfg);
+    return (0, _indexts.presetNames)(cfg).map(function(name) {
+        var files = db.prepare('SELECT COUNT(*) AS n FROM preset_files WHERE preset = ?').get(name).n;
+        var 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).n : 0;
+        return {
+            name: name,
+            files: files,
+            embedded: embedded,
+            semantic: (0, _indexts.presetSemanticEnabled)(cfg, name)
+        };
+    });
+}
+/* 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/commands/status.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands/status.ts"],"sourcesContent":["import type { DatabaseSync } from 'node:sqlite';\nimport type { ResolvedConfig } from '../config/index.ts';\nimport { anyPresetEmbeds, presetNames, presetSemanticEnabled } from '../config/index.ts';\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"],"names":["presetCoverage","db","cfg","embedActive","anyPresetEmbeds","presetNames","map","name","files","prepare","get","n","embedded","semantic","presetSemanticEnabled"],"mappings":";;;;+BAcgBA;;;eAAAA;;;uBAZoD;AAY7D,SAASA,eAAeC,EAAgB,EAAEC,GAAmB;IAClE,IAAMC,cAAcC,IAAAA,wBAAe,EAACF;IACpC,OAAOG,IAAAA,oBAAW,EAACH,KAAKI,GAAG,CAAC,SAACC;QAC3B,IAAMC,QAAQ,AAACP,GAAGQ,OAAO,CAAC,2DAA2DC,GAAG,CAACH,MAAwBI,CAAC;QAClH,IAAMC,WAAWT,cAAc,AAACF,GAAGQ,OAAO,CAAC,6JAA6JC,GAAG,CAACH,MAAwBI,CAAC,GAAG;QACxO,OAAO;YAAEJ,MAAAA;YAAMC,OAAAA;YAAOI,UAAAA;YAAUC,UAAUC,IAAAA,8BAAqB,EAACZ,KAAKK;QAAM;IAC7E;AACF"}

package/dist/cjs/config/access.d.cts

@@ -0,0 +1,19 @@
+import { type Config, type FeatureName } from './types.js';
+export declare function presetNames(cfg: Config): string[];
+export declare function embedEnabled(cfg: Config): boolean;
+export declare function presetSemanticEnabled(cfg: Config, name: string): boolean;
+export declare function anyPresetEmbeds(cfg: Config): boolean;
+export declare function featureEnabled(cfg: Config, name: FeatureName): boolean;
+export declare function enabledFeatures(cfg: Config): FeatureName[];
+export declare function featureStates(cfg: Config): {
+    on: FeatureName[];
+    off: FeatureName[];
+};
+export declare function embedConfig(cfg: Config): {
+    model: string;
+    type: 'static' | 'api';
+    url?: string;
+    key?: string;
+} | null;
+export declare function contentTokenize(cfg: Config): string | undefined;
+export declare function featureSignature(cfg: Config): string;

package/dist/cjs/config/access.d.ts

@@ -0,0 +1,19 @@
+import { type Config, type FeatureName } from './types.js';
+export declare function presetNames(cfg: Config): string[];
+export declare function embedEnabled(cfg: Config): boolean;
+export declare function presetSemanticEnabled(cfg: Config, name: string): boolean;
+export declare function anyPresetEmbeds(cfg: Config): boolean;
+export declare function featureEnabled(cfg: Config, name: FeatureName): boolean;
+export declare function enabledFeatures(cfg: Config): FeatureName[];
+export declare function featureStates(cfg: Config): {
+    on: FeatureName[];
+    off: FeatureName[];
+};
+export declare function embedConfig(cfg: Config): {
+    model: string;
+    type: 'static' | 'api';
+    url?: string;
+    key?: string;
+} | null;
+export declare function contentTokenize(cfg: Config): string | undefined;
+export declare function featureSignature(cfg: Config): string;