sensemaking 0.17.0 → 0.18.0

package/dist/cjs/commands/search.js

@@ -14,7 +14,6 @@ var _indexts = require("../config/index.js");
 var _storets = require("../embed/store.js");
 var _errorsts = require("../errors.js");
 var _searcherrorts = require("../output/search-error.js");
-var _segmentts = require("../text/segment.js");
 var _scopets = require("./scope.js");
 var _signalsts = require("./signals.js");
 function _array_like_to_array(arr, len) {
@@ -25,6 +24,9 @@ function _array_like_to_array(arr, len) {
 function _array_with_holes(arr) {
     if (Array.isArray(arr)) return arr;
 }
+function _array_without_holes(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array(arr);
+}
 function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
     try {
         var info = gen[key](arg);
@@ -51,6 +53,11 @@ function _async_to_generator(fn) {
         });
     };
 }
+function _iterable_to_array(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) {
+        return Array.from(iter);
+    }
+}
 function _iterable_to_array_limit(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
@@ -78,9 +85,15 @@ function _iterable_to_array_limit(arr, i) {
 function _non_iterable_rest() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
+function _non_iterable_spread() {
+    throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
 function _sliced_to_array(arr, i) {
     return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
 }
+function _to_consumable_array(arr) {
+    return _array_without_holes(arr) || _iterable_to_array(arr) || _unsupported_iterable_to_array(arr) || _non_iterable_spread();
+}
 function _ts_generator(thisArg, body) {
     var f, y, t, _ = {
         label: 0,
@@ -320,13 +333,35 @@ function lineNumberAt(text, offset) {
     for(var i = 0; i < offset; i++)if (text.charCodeAt(i) === 10) line++;
     return line;
 }
-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;
+function lineRangeFor(store, path, line) {
+    return _async_to_generator(function() {
+        var stmt, row;
+        return _ts_generator(this, function(_state) {
+            switch(_state.label){
+                case 0:
+                    return [
+                        4,
+                        store.prepare('SELECT start_line, end_line FROM sections WHERE "path" = ? AND start_line <= ? AND end_line >= ? ORDER BY start_line DESC LIMIT 1')
+                    ];
+                case 1:
+                    stmt = _state.sent();
+                    return [
+                        4,
+                        stmt.get(path, line, line)
+                    ];
+                case 2:
+                    row = _state.sent();
+                    return [
+                        2,
+                        row ? "L".concat(row.start_line, "-").concat(row.end_line) : null
+                    ];
+            }
+        });
+    })();
 }
 function search(_0, _1, _2) {
-    return _async_to_generator(function(db, cfg, terms) {
-        var opts, _hits_get, _chunkLines_get, _chunkSimilarity_get, effective, k, signals, allPaths, scopePaths, scopeActive, allowedPaths, fetch, wantsVectors, e, semanticEnabled, scope, whereJoin, whereCond, scopeCond, query, candidates, matchRows, hits, oversized, chunkLines, chunkSimilarity, ref, insert, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, _step_value, path, c, where, similarityCol, rows, bareTerms, _iteratorNormalCompletion1, _didIteratorError1, _iteratorError1, _iterator1, _step1, row, text, _computeExcerpt, excerpt, offset;
+    return _async_to_generator(function(store, cfg, terms) {
+        var opts, effective, k, signals, allPaths, scopePaths, scopeActive, allowedPaths, err1, fetch, wantsVectors, e, semanticEnabled, _tmp, scope, whereJoin, whereCond, scopeCond, candidates, matchRows, err2, hits, oversized, chunkLines, chunkSimilarity, ref, where, similarityCol, selectStmt, rows, bareTerms, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, row, text, _computeExcerpt, excerpt, offset, _tmp1, err;
         var _arguments = arguments;
         return _ts_generator(this, function(_state) {
             switch(_state.label){
@@ -334,16 +369,48 @@ function search(_0, _1, _2) {
                     opts = _arguments.length > 3 && _arguments[3] !== void 0 ? _arguments[3] : {};
                     effective = (0, _indexts.resolveSearch)(cfg, opts);
                     k = effective.k, signals = effective.signals;
-                    allPaths = db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
+                    return [
+                        4,
+                        store.prepare('SELECT "path" FROM frontmatter')
+                    ];
+                case 1:
+                    return [
+                        4,
+                        _state.sent().all()
+                    ];
+                case 2:
+                    allPaths = _state.sent().map(function(r) {
                         return r.path;
                     });
-                    scopePaths = (0, _scopets.rawScope)(db, cfg, opts, allPaths);
+                    return [
+                        4,
+                        (0, _scopets.rawScope)(store, cfg, opts, allPaths)
+                    ];
+                case 3:
+                    scopePaths = _state.sent();
                     scopeActive = scopePaths.size < allPaths.length;
-                    try {
-                        allowedPaths = (0, _scopets.narrowByWhere)(db, scopePaths, effective.where);
-                    } catch (err) {
-                        throw (0, _searcherrorts.searchError)(err, terms, effective.where);
-                    }
+                    _state.label = 4;
+                case 4:
+                    _state.trys.push([
+                        4,
+                        6,
+                        ,
+                        7
+                    ]);
+                    return [
+                        4,
+                        (0, _scopets.narrowByWhere)(store, scopePaths, effective.where)
+                    ];
+                case 5:
+                    allowedPaths = _state.sent();
+                    return [
+                        3,
+                        7
+                    ];
+                case 6:
+                    err1 = _state.sent();
+                    throw (0, _searcherrorts.searchError)(err1, terms, effective.where);
+                case 7:
                     fetch = Math.max(k * 3, 30);
                     // A downloadable HF id proceeds -- getProvider fetches it lazily on consent. Only a
                     // local path with missing files errors here, since nothing will ever fetch it for itself.
@@ -354,38 +421,66 @@ function search(_0, _1, _2) {
                             throw new _errorsts.SenseError('EMBED_MODEL_MISSING', 'preset "'.concat(effective.presetName, '" searches with vectors, but the local model path "').concat(e.model, '" is missing ').concat(_storets.MODEL_FILENAMES, '; point embed.model at a directory containing them, or drop "vectors" from that preset\'s signals to search without them'));
                         }
                     }
-                    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
-                    // carries boundaries comes through untouched, so this is a no-op for the languages that
-                    // never needed it. Gated on the same predicate that decided whether the sidecars were
-                    // populated (contentTokenize(cfg) === undefined), so index and query can't disagree. Invalid
-                    // syntax still errors rather than being rewritten.
-                    // --where
-                    // applies inside the candidate query (a post-filter would drop matches ranked past the pool)
-                    // and again on the final select, for link-derived rows.
+                    _tmp = wantsVectors;
+                    if (!_tmp) return [
+                        3,
+                        9
+                    ];
+                    return [
+                        4,
+                        (0, _scopets.scopeHasEmbeddings)(store, cfg, allowedPaths)
+                    ];
+                case 8:
+                    _tmp = _state.sent();
+                    _state.label = 9;
+                case 9:
+                    semanticEnabled = _tmp;
+                    // --where applies inside the candidate query (a post-filter would drop matches ranked past
+                    // the pool) and again on the final select, for link-derived rows.
                     scope = effective.where;
                     whereJoin = scope ? 'JOIN frontmatter f ON f."path" = content.path' : '';
                     whereCond = scope ? "AND (".concat(scope, ")") : '';
-                    // A scope narrower than the whole index must filter the candidate pool before LIMIT, not
-                    // 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) (0, _scopets.materializeScope)(db, '_search_scope', scopePaths);
+                    if (!scopeActive) return [
+                        3,
+                        11
+                    ];
+                    return [
+                        4,
+                        (0, _scopets.materializeScope)(store, '_search_scope', scopePaths)
+                    ];
+                case 10:
+                    _state.sent();
+                    _state.label = 11;
+                case 11:
                     scopeCond = scopeActive ? 'AND content.path IN (SELECT "path" FROM _search_scope)' : '';
-                    query = (0, _indexts.contentTokenize)(cfg) === undefined ? (0, _segmentts.segmentMatch)(terms) : terms;
                     candidates = new Map();
                     matchRows = [];
-                    // A query that rewrites to nothing (e.g. only unspaced-script punctuation) has no
-                    // searchable words: zero lexical rows, and the other signals still compose.
-                    if (signals.words !== undefined && query.trim() !== '') {
-                        try {
-                            matchRows = (0, _signalsts.wordsCandidates)(db, candidates, query, whereJoin, whereCond, scopeCond, fetch, signals.words);
-                        } catch (err) {
-                            throw (0, _searcherrorts.searchError)(err, terms, scope);
-                        }
-                    }
+                    if (!(signals.words !== undefined && terms.trim() !== '')) return [
+                        3,
+                        15
+                    ];
+                    _state.label = 12;
+                case 12:
+                    _state.trys.push([
+                        12,
+                        14,
+                        ,
+                        15
+                    ]);
+                    return [
+                        4,
+                        (0, _signalsts.wordsCandidates)(store, candidates, terms, whereJoin, whereCond, scopeCond, fetch, signals.words)
+                    ];
+                case 13:
+                    matchRows = _state.sent();
+                    return [
+                        3,
+                        15
+                    ];
+                case 14:
+                    err2 = _state.sent();
+                    throw (0, _searcherrorts.searchError)(err2, terms, scope);
+                case 15:
                     hits = new Map(matchRows.map(function(r) {
                         return [
                             r.path,
@@ -399,44 +494,69 @@ function search(_0, _1, _2) {
                     }).map(function(r) {
                         return r.path;
                     }));
-                    if (signals.links !== undefined) (0, _signalsts.linksCandidates)(db, candidates, matchRows, allPaths, allowedPaths, fetch, signals.links);
+                    if (!(signals.links !== undefined)) return [
+                        3,
+                        17
+                    ];
+                    return [
+                        4,
+                        (0, _signalsts.linksCandidates)(store, candidates, matchRows, allPaths, allowedPaths, fetch, signals.links)
+                    ];
+                case 16:
+                    _state.sent();
+                    _state.label = 17;
+                case 17:
                     chunkLines = new Map();
                     chunkSimilarity = new Map();
                     if (!semanticEnabled) return [
                         3,
-                        2
+                        19
                     ];
                     return [
                         4,
-                        (0, _signalsts.vectorsCandidates)(db, cfg, candidates, terms, fetch, allowedPaths, signals.vectors)
+                        (0, _signalsts.vectorsCandidates)(store, cfg, candidates, terms, fetch, allowedPaths, signals.vectors)
                     ];
-                case 1:
+                case 18:
                     ref = _state.sent(), chunkLines = ref.chunkLines, chunkSimilarity = ref.chunkSimilarity, ref;
-                    _state.label = 2;
-                case 2:
-                    db.exec('DROP TABLE IF EXISTS _search');
-                    db.exec('CREATE TEMP TABLE _search ("path" TEXT PRIMARY KEY, score REAL, via TEXT, hit TEXT, lines TEXT, similarity REAL)');
-                    insert = db.prepare('INSERT INTO _search ("path", score, via, hit, lines, similarity) VALUES (?, ?, ?, ?, ?, ?)');
-                    _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
-                    try {
-                        for(_iterator = candidates[Symbol.iterator](); !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
-                            _step_value = _sliced_to_array(_step.value, 2), path = _step_value[0], c = _step_value[1];
-                            insert.run(path, c.score, c.via, (_hits_get = hits.get(path)) !== null && _hits_get !== void 0 ? _hits_get : null, (_chunkLines_get = chunkLines.get(path)) !== null && _chunkLines_get !== void 0 ? _chunkLines_get : null, (_chunkSimilarity_get = chunkSimilarity.get(path)) !== null && _chunkSimilarity_get !== void 0 ? _chunkSimilarity_get : null);
-                        }
-                    } catch (err) {
-                        _didIteratorError = true;
-                        _iteratorError = err;
-                    } finally{
-                        try {
-                            if (!_iteratorNormalCompletion && _iterator.return != null) {
-                                _iterator.return();
-                            }
-                        } finally{
-                            if (_didIteratorError) {
-                                throw _iteratorError;
-                            }
-                        }
-                    }
+                    _state.label = 19;
+                case 19:
+                    return [
+                        4,
+                        store.exec('DROP TABLE IF EXISTS _search')
+                    ];
+                case 20:
+                    _state.sent();
+                    // DOUBLE, not REAL: sqlite's REAL is an 8-byte double but duckdb's is a 4-byte float, and the
+                    // rounded score/similarity are printed at full precision in rows.
+                    return [
+                        4,
+                        store.exec('CREATE TEMP TABLE _search ("path" TEXT PRIMARY KEY, score DOUBLE, via TEXT, hit TEXT, lines TEXT, similarity DOUBLE)')
+                    ];
+                case 21:
+                    _state.sent();
+                    if (!(candidates.size > 0)) return [
+                        3,
+                        23
+                    ];
+                    return [
+                        4,
+                        store.runBatch('INSERT INTO _search ("path", score, via, hit, lines, similarity) VALUES (?, ?, ?, ?, ?, ?)', _to_consumable_array(candidates).map(function(param) {
+                            var _param = _sliced_to_array(param, 2), path = _param[0], c = _param[1];
+                            var _hits_get, _chunkLines_get, _chunkSimilarity_get;
+                            return [
+                                path,
+                                c.score,
+                                c.via,
+                                (_hits_get = hits.get(path)) !== null && _hits_get !== void 0 ? _hits_get : null,
+                                (_chunkLines_get = chunkLines.get(path)) !== null && _chunkLines_get !== void 0 ? _chunkLines_get : null,
+                                (_chunkSimilarity_get = chunkSimilarity.get(path)) !== null && _chunkSimilarity_get !== void 0 ? _chunkSimilarity_get : null
+                            ];
+                        }))
+                    ];
+                case 22:
+                    _state.sent();
+                    _state.label = 23;
+                case 23:
                     // All three candidate paths (match, link, vector) already filtered to scope+where before
                     // reaching _search; this reapplies --where anyway since the join to frontmatter is already
                     // needed for the path column.
@@ -444,39 +564,112 @@ function search(_0, _1, _2) {
                     // lines is always present now: semantic rows carry their chunk's range, oversized-doc
                     // lexical rows gain one below, everything else stays null. similarity stays semantic-only.
                     similarityCol = semanticEnabled ? ', _search.similarity' : '';
-                    rows = db.prepare('SELECT f."path" AS path, content.title, content.summary, _search.hit, _search.via, round(_search.score, 4) AS score, _search.lines'.concat(similarityCol, '\n       FROM _search JOIN frontmatter f ON f."path" = _search."path" JOIN content ON content.path = _search."path"\n       ').concat(where, " ORDER BY _search.score DESC LIMIT ?")).all(k);
-                    if (oversized.size > 0) {
-                        bareTerms = extractBareTerms(terms);
-                        _iteratorNormalCompletion1 = true, _didIteratorError1 = false, _iteratorError1 = undefined;
-                        try {
-                            for(_iterator1 = rows[Symbol.iterator](); !(_iteratorNormalCompletion1 = (_step1 = _iterator1.next()).done); _iteratorNormalCompletion1 = true){
-                                row = _step1.value;
-                                if (row.hit !== null || !oversized.has(row.path)) continue;
-                                text = void 0;
-                                try {
-                                    text = (0, _nodefs.readFileSync)((0, _nodepath.join)(cfg.baseDir, row.path), 'utf8');
-                                } catch (unused) {
-                                    continue; // vanished since the match; leave hit/lines null rather than throw
-                                }
-                                _computeExcerpt = computeExcerpt(text, bareTerms), excerpt = _computeExcerpt.excerpt, offset = _computeExcerpt.offset;
-                                row.hit = excerpt;
-                                if (row.lines == null) row.lines = (0, _indexts.featureEnabled)(cfg, 'sections') ? lineRangeFor(db, row.path, lineNumberAt(text, offset)) : null;
-                            }
-                        } catch (err) {
-                            _didIteratorError1 = true;
-                            _iteratorError1 = err;
-                        } finally{
-                            try {
-                                if (!_iteratorNormalCompletion1 && _iterator1.return != null) {
-                                    _iterator1.return();
-                                }
-                            } finally{
-                                if (_didIteratorError1) {
-                                    throw _iteratorError1;
-                                }
-                            }
+                    return [
+                        4,
+                        store.prepare('SELECT f."path" AS path, content.title, content.summary, _search.hit, _search.via, round(_search.score, 4) AS score, _search.lines'.concat(similarityCol, '\n       FROM _search JOIN frontmatter f ON f."path" = _search."path" JOIN content ON content.path = _search."path"\n       ').concat(where, " ORDER BY _search.score DESC LIMIT ?"))
+                    ];
+                case 24:
+                    selectStmt = _state.sent();
+                    return [
+                        4,
+                        selectStmt.all(k)
+                    ];
+                case 25:
+                    rows = _state.sent();
+                    if (!(oversized.size > 0)) return [
+                        3,
+                        35
+                    ];
+                    bareTerms = extractBareTerms(terms);
+                    _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+                    _state.label = 26;
+                case 26:
+                    _state.trys.push([
+                        26,
+                        33,
+                        34,
+                        35
+                    ]);
+                    _iterator = rows[Symbol.iterator]();
+                    _state.label = 27;
+                case 27:
+                    if (!!(_iteratorNormalCompletion = (_step = _iterator.next()).done)) return [
+                        3,
+                        32
+                    ];
+                    row = _step.value;
+                    if (row.hit !== null || !oversized.has(row.path)) return [
+                        3,
+                        31
+                    ];
+                    text = void 0;
+                    try {
+                        text = (0, _nodefs.readFileSync)((0, _nodepath.join)(cfg.baseDir, row.path), 'utf8');
+                    } catch (unused) {
+                        return [
+                            3,
+                            31
+                        ]; // vanished since the match; leave hit/lines null rather than throw
+                    }
+                    _computeExcerpt = computeExcerpt(text, bareTerms), excerpt = _computeExcerpt.excerpt, offset = _computeExcerpt.offset;
+                    row.hit = excerpt;
+                    if (!(row.lines == null)) return [
+                        3,
+                        31
+                    ];
+                    if (!(0, _indexts.featureEnabled)(cfg, 'sections')) return [
+                        3,
+                        29
+                    ];
+                    return [
+                        4,
+                        lineRangeFor(store, row.path, lineNumberAt(text, offset))
+                    ];
+                case 28:
+                    _tmp1 = _state.sent();
+                    return [
+                        3,
+                        30
+                    ];
+                case 29:
+                    _tmp1 = null;
+                    _state.label = 30;
+                case 30:
+                    row.lines = _tmp1;
+                    _state.label = 31;
+                case 31:
+                    _iteratorNormalCompletion = true;
+                    return [
+                        3,
+                        27
+                    ];
+                case 32:
+                    return [
+                        3,
+                        35
+                    ];
+                case 33:
+                    err = _state.sent();
+                    _didIteratorError = true;
+                    _iteratorError = err;
+                    return [
+                        3,
+                        35
+                    ];
+                case 34:
+                    try {
+                        if (!_iteratorNormalCompletion && _iterator.return != null) {
+                            _iterator.return();
+                        }
+                    } finally{
+                        if (_didIteratorError) {
+                            throw _iteratorError;
                         }
                     }
+                    return [
+                        7
+                    ];
+                case 35:
                     return [
                         2,
                         rows

package/dist/cjs/commands/search.js.map

@@ -1 +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 { contentTokenize, embedConfig, featureEnabled, resolveSearch } from '../config/index.ts';\nimport { localModelMissing, MODEL_FILENAMES } from '../embed/store.ts';\nimport { SenseError } from '../errors.ts';\nimport type { Row } from '../output/output.ts';\nimport { searchError } from '../output/search-error.ts';\nimport { segmentMatch } from '../text/segment.ts';\nimport { materializeScope, narrowByWhere, rawScope, scopeHasEmbeddings } from './scope.ts';\nimport { linksCandidates, vectorsCandidates, wordsCandidates } from './signals.ts';\n\n// snippet() re-tokenizes each candidate doc, superlinearly: ~10s for one 1MB doc\n// (benchmark/reports/2026-08-23-hub-release-battery.md). Past this bound, rows get the JS excerpt.\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// The declared or defaulted signals compose via RRF; `via` names which ones produced each 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, signals } = 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  // A downloadable HF id proceeds -- getProvider fetches it lazily on consent. Only a\n  // local path with missing files errors here, since nothing will ever fetch it for itself.\n  const wantsVectors = signals.vectors !== undefined;\n  if (wantsVectors) {\n    const e = embedConfig(cfg); // validate.ts guarantees this is set whenever \"vectors\" is declared\n    if (localModelMissing(e)) {\n      throw new SenseError('EMBED_MODEL_MISSING', `preset \"${effective.presetName}\" searches with vectors, but the local model path \"${e.model}\" is missing ${MODEL_FILENAMES}; point embed.model at a directory containing them, or drop \"vectors\" from that preset's signals to search without them`);\n    }\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  const query = contentTokenize(cfg) === undefined ? segmentMatch(terms) : terms;\n\n  const candidates = new Map<string, { score: number; via: string }>();\n  let matchRows: Array<{ path: string; hit: string | null }> = [];\n  // A query that rewrites to nothing (e.g. only unspaced-script punctuation) has no\n  // searchable words: zero lexical rows, and the other signals still compose.\n  if (signals.words !== undefined && query.trim() !== '') {\n    try {\n      matchRows = wordsCandidates(db, candidates, query, whereJoin, whereCond, scopeCond, fetch, signals.words);\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\n  if (signals.links !== undefined) linksCandidates(db, candidates, matchRows, allPaths, allowedPaths, fetch, signals.links);\n\n  let chunkLines = new Map<string, string>();\n  let chunkSimilarity = new Map<string, number>();\n  if (semanticEnabled) {\n    ({ chunkLines, chunkSimilarity } = await vectorsCandidates(db, cfg, candidates, terms, fetch, allowedPaths, signals.vectors as number));\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","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","signals","allPaths","scopePaths","scopeActive","allowedPaths","fetch","wantsVectors","e","semanticEnabled","scope","whereJoin","whereCond","scopeCond","candidates","matchRows","oversized","insert","c","where","similarityCol","rows","bareTerms","resolveSearch","all","r","rawScope","narrowByWhere","err","searchError","max","vectors","undefined","embedConfig","localModelMissing","SenseError","presetName","MODEL_FILENAMES","model","scopeHasEmbeddings","materializeScope","contentTokenize","segmentMatch","Map","words","wordsCandidates","hit","links","linksCandidates","vectorsCandidates","exec","run","score","via","has","readFileSync","join","baseDir","lines","featureEnabled"],"mappings":";;;;+BAyHsBA;;;eAAAA;;;sBAzHO;wBACR;uBAGuD;uBACzB;wBACxB;6BAEC;yBACC;uBACiD;yBACV;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEpE,iFAAiF;AACjF,mGAAmG;AACnG,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,SAAe9D;wCAAOwD,EAAgB,EAAEO,GAAmB,EAAEhD,KAAa;YAAEiD,MA6EZC,WAAwBC,iBAA8BC,sBA5ErHC,WACEC,GAAGC,SAELC,UACAC,YACAC,aAIFC,cAMEC,OAIAC,cAEEC,GAKFC,iBAYAC,OACAC,WACAC,WAMAC,WACA/E,OAEAgF,YACFC,WAUEnB,MAGAoB,WAIFnB,YACAC,sBAOEmB,QACD,2BAAA,mBAAA,gBAAA,WAAA,oBAAO7B,MAAM8B,GAKZC,OAGAC,eACAC,MASEC,WACD,4BAAA,oBAAA,iBAAA,YAAA,QAAMjC,KAELjB,MAMwBD,iBAApBI,SAASE;;;;;oBAxG4DkB,OAAAA,oEAAsB,CAAC;oBAClGI,YAAYwB,IAAAA,sBAAa,EAAC7B,KAAKC;oBAC7BK,IAAeD,UAAfC,GAAGC,UAAYF,UAAZE;oBAELC,WAAW,AAACf,GAAGG,OAAO,CAAC,kCAAkCkC,GAAG,GAA+BtF,GAAG,CAAC,SAACuF;+BAAMA,EAAErC,IAAI;;oBAC5Ge,aAAauB,IAAAA,iBAAQ,EAACvC,IAAIO,KAAKC,MAAMO;oBACrCE,cAAcD,WAAWjC,IAAI,GAAGgC,SAAS3D,MAAM;oBAKrD,IAAI;wBACF8D,eAAesB,IAAAA,sBAAa,EAACxC,IAAIgB,YAAYJ,UAAUoB,KAAK;oBAC9D,EAAE,OAAOS,KAAK;wBACZ,MAAMC,IAAAA,0BAAW,EAACD,KAAclF,OAAOqD,UAAUoB,KAAK;oBACxD;oBACMb,QAAQjC,KAAKyD,GAAG,CAAC9B,IAAI,GAAG;oBAE9B,oFAAoF;oBACpF,0FAA0F;oBACpFO,eAAeN,QAAQ8B,OAAO,KAAKC;oBACzC,IAAIzB,cAAc;wBACVC,IAAIyB,IAAAA,oBAAW,EAACvC,MAAM,oEAAoE;wBAChG,IAAIwC,IAAAA,0BAAiB,EAAC1B,IAAI;4BACxB,MAAM,IAAI2B,oBAAU,CAAC,uBAAuB,AAAC,WAAoF3B,OAA1ET,UAAUqC,UAAU,EAAC,uDAA4EC,OAAvB7B,EAAE8B,KAAK,EAAC,iBAA+B,OAAhBD,wBAAe,EAAC;wBAC1K;oBACF;oBACM5B,kBAAkBF,gBAAgBgC,IAAAA,2BAAkB,EAACpD,IAAIO,KAAKW;oBAEpE,4FAA4F;oBAC5F,0FAA0F;oBAC1F,yFAAyF;oBACzF,wFAAwF;oBACxF,sFAAsF;oBACtF,6FAA6F;oBAC7F,mDAAmD;oBACnD,UAAU;oBACV,6FAA6F;oBAC7F,wDAAwD;oBAClDK,QAAQX,UAAUoB,KAAK;oBACvBR,YAAYD,QAAQ,kDAAkD;oBACtEE,YAAYF,QAAQ,AAAC,QAAa,OAANA,OAAM,OAAK;oBAC7C,yFAAyF;oBACzF,uFAAuF;oBACvF,sFAAsF;oBACtF,uEAAuE;oBACvE,IAAIN,aAAaoC,IAAAA,yBAAgB,EAACrD,IAAI,iBAAiBgB;oBACjDU,YAAYT,cAAc,2DAA2D;oBACrFtE,QAAQ2G,IAAAA,wBAAe,EAAC/C,SAASsC,YAAYU,IAAAA,uBAAY,EAAChG,SAASA;oBAEnEoE,aAAa,IAAI6B;oBACnB5B;oBACJ,kFAAkF;oBAClF,4EAA4E;oBAC5E,IAAId,QAAQ2C,KAAK,KAAKZ,aAAalG,MAAMO,IAAI,OAAO,IAAI;wBACtD,IAAI;4BACF0E,YAAY8B,IAAAA,0BAAe,EAAC1D,IAAI2B,YAAYhF,OAAO6E,WAAWC,WAAWC,WAAWP,OAAOL,QAAQ2C,KAAK;wBAC1G,EAAE,OAAOhB,KAAK;4BACZ,MAAMC,IAAAA,0BAAW,EAACD,KAAclF,OAAOgE;wBACzC;oBACF;oBACMd,OAAO,IAAI+C,IAAI5B,UAAU7E,GAAG,CAAC,SAACuF;+BAAM;4BAACA,EAAErC,IAAI;4BAAEqC,EAAEqB,GAAG;yBAAC;;oBACzD,wFAAwF;oBACxF,4EAA4E;oBACtE9B,YAAY,IAAIlD,IAAIiD,UAAUzE,MAAM,CAAC,SAACmF;+BAAMA,EAAEqB,GAAG,KAAK;uBAAM5G,GAAG,CAAC,SAACuF;+BAAMA,EAAErC,IAAI;;oBAEnF,IAAIa,QAAQ8C,KAAK,KAAKf,WAAWgB,IAAAA,0BAAe,EAAC7D,IAAI2B,YAAYC,WAAWb,UAAUG,cAAcC,OAAOL,QAAQ8C,KAAK;oBAEpHlD,aAAa,IAAI8C;oBACjB7C,kBAAkB,IAAI6C;yBACtBlC,iBAAAA;;;;oBACiC;;wBAAMwC,IAAAA,4BAAiB,EAAC9D,IAAIO,KAAKoB,YAAYpE,OAAO4D,OAAOD,cAAcJ,QAAQ8B,OAAO;;;0BAAxF,eAAhClC,iBAAAA,YAAYC,sBAAAA;;;oBAGjBX,GAAG+D,IAAI,CAAC;oBACR/D,GAAG+D,IAAI,CAAC;oBACFjC,SAAS9B,GAAGG,OAAO,CAAC;oBACrB,kCAAA,2BAAA;;wBAAL,IAAK,YAAmBwB,iCAAnB,6BAAA,QAAA,yBAAA;2DAAA,iBAAO1B,uBAAM8B;4BAAkBD,OAAOkC,GAAG,CAAC/D,MAAM8B,EAAEkC,KAAK,EAAElC,EAAEmC,GAAG,GAAEzD,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;oBACxBqB,QAAQT,QAAQ,AAAC,UAAe,OAANA,OAAM,OAAK;oBAC3C,sFAAsF;oBACtF,2FAA2F;oBACrFU,gBAAgBX,kBAAkB,yBAAyB;oBAC3DY,OAAOlC,GACVG,OAAO,CACN,AAAC,qIAEE6B,OAFkIC,eAAc,gIAE1I,OAAND,OAAM,yCAEVK,GAAG,CAACxB;oBAEP,IAAIgB,UAAU9C,IAAI,GAAG,GAAG;wBAChBoD,YAAYzF,iBAAiBa;wBAC9B,mCAAA,4BAAA;;4BAAL,IAAK,aAAa2E,2BAAb,8BAAA,SAAA,0BAAA,kCAAmB;gCAAbhC,MAAN;gCACH,IAAIA,IAAIyD,GAAG,KAAK,QAAQ,CAAC9B,UAAUsC,GAAG,CAACjE,IAAID,IAAI,GAAa;gCACxDhB,OAAAA,KAAAA;gCACJ,IAAI;oCACFA,OAAOmF,IAAAA,oBAAY,EAACC,IAAAA,cAAI,EAAC9D,IAAI+D,OAAO,EAAEpE,IAAID,IAAI,GAAa;gCAC7D,EAAE,eAAM;oCACN,UAAU,mEAAmE;gCAC/E;gCAC4BjB,kBAAAA,eAAeC,MAAMkD,YAAzC/C,UAAoBJ,gBAApBI,SAASE,SAAWN,gBAAXM;gCACjBY,IAAIyD,GAAG,GAAGvE;gCACV,IAAIc,IAAIqE,KAAK,IAAI,MAAMrE,IAAIqE,KAAK,GAAGC,IAAAA,uBAAc,EAACjE,KAAK,cAAcR,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;4BAC1I;;4BAXK;4BAAA;;;qCAAA,8BAAA;oCAAA;;;oCAAA;0CAAA;;;;oBAYP;oBAEA;;wBAAO4C;;;;IACT"}
+{"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 { ResolvedConfig } from '../config/index.ts';\nimport { embedConfig, featureEnabled, resolveSearch } from '../config/index.ts';\nimport { localModelMissing, MODEL_FILENAMES } from '../embed/store.ts';\nimport { SenseError } from '../errors.ts';\nimport type { Row } from '../output/output.ts';\nimport { searchError } from '../output/search-error.ts';\nimport type { LexicalHit, Store } from '../store/types.ts';\nimport { materializeScope, narrowByWhere, rawScope, scopeHasEmbeddings } from './scope.ts';\nimport { linksCandidates, vectorsCandidates, wordsCandidates } from './signals.ts';\n\n// snippet() re-tokenizes each candidate doc, superlinearly: ~10s for one 1MB doc\n// (benchmark/reports/2026-08-23-hub-release-battery.md). Past this bound, rows get the JS excerpt.\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\nasync function lineRangeFor(store: Store, path: string, line: number): Promise<string | null> {\n  const stmt = await store.prepare('SELECT start_line, end_line FROM sections WHERE \"path\" = ? AND start_line <= ? AND end_line >= ? ORDER BY start_line DESC LIMIT 1');\n  const row = (await stmt.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// The declared or defaulted signals compose via RRF; `via` names which ones produced each row.\n// `opts` arrives already resolved (config.ts:resolveSearch).\nexport async function search(store: Store, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<Row[]> {\n  const effective = resolveSearch(cfg, opts);\n  const { k, signals } = effective;\n\n  const allPaths = ((await (await store.prepare('SELECT \"path\" FROM frontmatter')).all()) as Array<{ path: string }>).map((r) => r.path);\n  const scopePaths = await rawScope(store, 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 = await narrowByWhere(store, 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  // A downloadable HF id proceeds -- getProvider fetches it lazily on consent. Only a\n  // local path with missing files errors here, since nothing will ever fetch it for itself.\n  const wantsVectors = signals.vectors !== undefined;\n  if (wantsVectors) {\n    const e = embedConfig(cfg); // validate.ts guarantees this is set whenever \"vectors\" is declared\n    if (localModelMissing(e)) {\n      throw new SenseError('EMBED_MODEL_MISSING', `preset \"${effective.presetName}\" searches with vectors, but the local model path \"${e.model}\" is missing ${MODEL_FILENAMES}; point embed.model at a directory containing them, or drop \"vectors\" from that preset's signals to search without them`);\n    }\n  }\n  const semanticEnabled = wantsVectors && (await scopeHasEmbeddings(store, cfg, allowedPaths));\n\n  // --where applies inside the candidate query (a post-filter would drop matches ranked past\n  // the pool) 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) await materializeScope(store, '_search_scope', scopePaths);\n  const scopeCond = scopeActive ? `AND content.path IN (SELECT \"path\" FROM _search_scope)` : '';\n\n  const candidates = new Map<string, { score: number; via: string }>();\n  let matchRows: LexicalHit[] = [];\n  // A query that is only whitespace has no searchable words: zero lexical rows, and the other\n  // signals still compose. Any store-specific rewrite of `terms` (sqlite's grapheme phrase for\n  // unspaced scripts, duckdb's word/substring split) happens inside store.lexical.query itself.\n  if (signals.words !== undefined && terms.trim() !== '') {\n    try {\n      matchRows = await wordsCandidates(store, candidates, terms, whereJoin, whereCond, scopeCond, fetch, signals.words);\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\n  if (signals.links !== undefined) await linksCandidates(store, candidates, matchRows, allPaths, allowedPaths, fetch, signals.links);\n\n  let chunkLines = new Map<string, string>();\n  let chunkSimilarity = new Map<string, number>();\n  if (semanticEnabled) {\n    ({ chunkLines, chunkSimilarity } = await vectorsCandidates(store, cfg, candidates, terms, fetch, allowedPaths, signals.vectors as number));\n  }\n\n  await store.exec('DROP TABLE IF EXISTS _search');\n  // DOUBLE, not REAL: sqlite's REAL is an 8-byte double but duckdb's is a 4-byte float, and the\n  // rounded score/similarity are printed at full precision in rows.\n  await store.exec('CREATE TEMP TABLE _search (\"path\" TEXT PRIMARY KEY, score DOUBLE, via TEXT, hit TEXT, lines TEXT, similarity DOUBLE)');\n  if (candidates.size > 0) {\n    await store.runBatch(\n      'INSERT INTO _search (\"path\", score, via, hit, lines, similarity) VALUES (?, ?, ?, ?, ?, ?)',\n      [...candidates].map(([path, c]) => [path, c.score, c.via, hits.get(path) ?? null, chunkLines.get(path) ?? null, chunkSimilarity.get(path) ?? null])\n    );\n  }\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 selectStmt = await store.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  const rows = (await selectStmt.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') ? await lineRangeFor(store, row.path as string, lineNumberAt(text, offset)) : null;\n    }\n  }\n\n  return rows;\n}\n"],"names":["search","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","store","path","stmt","row","prepare","get","start_line","end_line","cfg","opts","effective","k","signals","allPaths","scopePaths","scopeActive","allowedPaths","err","fetch","wantsVectors","e","semanticEnabled","scope","whereJoin","whereCond","scopeCond","candidates","matchRows","hits","oversized","chunkLines","chunkSimilarity","where","similarityCol","selectStmt","rows","bareTerms","resolveSearch","all","r","rawScope","narrowByWhere","searchError","max","vectors","undefined","embedConfig","localModelMissing","SenseError","presetName","MODEL_FILENAMES","model","scopeHasEmbeddings","materializeScope","Map","words","wordsCandidates","hit","links","linksCandidates","vectorsCandidates","exec","runBatch","c","score","via","has","readFileSync","join","baseDir","lines","featureEnabled"],"mappings":";;;;+BAyHsBA;;;eAAAA;;;sBAzHO;wBACR;uBAEsC;uBACR;wBACxB;6BAEC;uBAEkD;yBACV;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEpE,iFAAiF;AACjF,mGAAmG;AACnG,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,SAAeE,aAAaC,KAAY,EAAEC,IAAY,EAAEJ,IAAY;;YAC5DK,MACAC;;;;oBADO;;wBAAMH,MAAMI,OAAO,CAAC;;;oBAA3BF,OAAO;oBACA;;wBAAMA,KAAKG,GAAG,CAACJ,MAAMJ,MAAMA;;;oBAAlCM,MAAO;oBACb;;wBAAOA,MAAM,AAAC,IAAqBA,OAAlBA,IAAIG,UAAU,EAAC,KAAgB,OAAbH,IAAII,QAAQ,IAAK;;;;IACtD;;AAaO,SAAe/D;wCAAOwD,KAAY,EAAEQ,GAAmB,EAAEjD,KAAa;YAAEkD,MACvEC,WACEC,GAAGC,SAELC,UACAC,YACAC,aAIFC,cAGKC,MAGHC,OAIAC,cAEEC,GAKFC,uBAIAC,OACAC,WACAC,WAMAC,WAEAC,YACFC,WAOOV,MAILW,MAGAC,WAIFC,YACAC,sBAmBEC,OAGAC,eACAC,YAKAC,MAGEC,WACD,2BAAA,mBAAA,gBAAA,WAAA,OAAMjC,KAELlB,MAMwBD,iBAApBI,SAASE;;;;;oBArGwDmB,OAAAA,oEAAsB,CAAC;oBAC9FC,YAAY2B,IAAAA,sBAAa,EAAC7B,KAAKC;oBAC7BE,IAAeD,UAAfC,GAAGC,UAAYF,UAAZE;oBAEe;;wBAAMZ,MAAMI,OAAO,CAAC;;;oBAA3B;;wBAAO,cAAuDkC,GAAG;;;oBAA9EzB,WAAW,AAAE,cAAiG9D,GAAG,CAAC,SAACwF;+BAAMA,EAAEtC,IAAI;;oBAClH;;wBAAMuC,IAAAA,iBAAQ,EAACxC,OAAOQ,KAAKC,MAAMI;;;oBAA9CC,aAAa;oBACbC,cAAcD,WAAW/B,IAAI,GAAG8B,SAASzD,MAAM;;;;;;;;;oBAMpC;;wBAAMqF,IAAAA,sBAAa,EAACzC,OAAOc,YAAYJ,UAAUsB,KAAK;;;oBAArEhB,eAAe;;;;;;oBACRC;oBACP,MAAMyB,IAAAA,0BAAW,EAACzB,MAAc1D,OAAOmD,UAAUsB,KAAK;;oBAElDd,QAAQhC,KAAKyD,GAAG,CAAChC,IAAI,GAAG;oBAE9B,oFAAoF;oBACpF,0FAA0F;oBACpFQ,eAAeP,QAAQgC,OAAO,KAAKC;oBACzC,IAAI1B,cAAc;wBACVC,IAAI0B,IAAAA,oBAAW,EAACtC,MAAM,oEAAoE;wBAChG,IAAIuC,IAAAA,0BAAiB,EAAC3B,IAAI;4BACxB,MAAM,IAAI4B,oBAAU,CAAC,uBAAuB,AAAC,WAAoF5B,OAA1EV,UAAUuC,UAAU,EAAC,uDAA4EC,OAAvB9B,EAAE+B,KAAK,EAAC,iBAA+B,OAAhBD,wBAAe,EAAC;wBAC1K;oBACF;2BACwB/B;+BAAAA;;;;oBAAiB;;wBAAMiC,IAAAA,2BAAkB,EAACpD,OAAOQ,KAAKQ;;;2BAArC;;;oBAAnCK;oBAEN,2FAA2F;oBAC3F,kEAAkE;oBAC5DC,QAAQZ,UAAUsB,KAAK;oBACvBT,YAAYD,QAAQ,kDAAkD;oBACtEE,YAAYF,QAAQ,AAAC,QAAa,OAANA,OAAM,OAAK;yBAKzCP,aAAAA;;;;oBAAa;;wBAAMsC,IAAAA,yBAAgB,EAACrD,OAAO,iBAAiBc;;;oBAA/C;;;oBACXW,YAAYV,cAAc,2DAA2D;oBAErFW,aAAa,IAAI4B;oBACnB3B;yBAIAf,CAAAA,QAAQ2C,KAAK,KAAKV,aAAatF,MAAML,IAAI,OAAO,EAAC,GAAjD0D;;;;;;;;;;;;oBAEY;;wBAAM4C,IAAAA,0BAAe,EAACxD,OAAO0B,YAAYnE,OAAOgE,WAAWC,WAAWC,WAAWP,OAAON,QAAQ2C,KAAK;;;oBAAjH5B,YAAY;;;;;;oBACLV;oBACP,MAAMyB,IAAAA,0BAAW,EAACzB,MAAc1D,OAAO+D;;oBAGrCM,OAAO,IAAI0B,IAAI3B,UAAU5E,GAAG,CAAC,SAACwF;+BAAM;4BAACA,EAAEtC,IAAI;4BAAEsC,EAAEkB,GAAG;yBAAC;;oBACzD,wFAAwF;oBACxF,4EAA4E;oBACtE5B,YAAY,IAAIlD,IAAIgD,UAAUxE,MAAM,CAAC,SAACoF;+BAAMA,EAAEkB,GAAG,KAAK;uBAAM1G,GAAG,CAAC,SAACwF;+BAAMA,EAAEtC,IAAI;;yBAE/EW,CAAAA,QAAQ8C,KAAK,KAAKb,SAAQ,GAA1BjC;;;;oBAA6B;;wBAAM+C,IAAAA,0BAAe,EAAC3D,OAAO0B,YAAYC,WAAWd,UAAUG,cAAcE,OAAON,QAAQ8C,KAAK;;;oBAAhG;;;oBAE7B5B,aAAa,IAAIwB;oBACjBvB,kBAAkB,IAAIuB;yBACtBjC,iBAAAA;;;;oBACiC;;wBAAMuC,IAAAA,4BAAiB,EAAC5D,OAAOQ,KAAKkB,YAAYnE,OAAO2D,OAAOF,cAAcJ,QAAQgC,OAAO;;;0BAA3F,eAAhCd,iBAAAA,YAAYC,sBAAAA;;;oBAGjB;;wBAAM/B,MAAM6D,IAAI,CAAC;;;oBAAjB;oBACA,8FAA8F;oBAC9F,kEAAkE;oBAClE;;wBAAM7D,MAAM6D,IAAI,CAAC;;;oBAAjB;yBACInC,CAAAA,WAAW3C,IAAI,GAAG,CAAA,GAAlB2C;;;;oBACF;;wBAAM1B,MAAM8D,QAAQ,CAClB,8FACA,AAAC,qBAAGpC,YAAY3E,GAAG,CAAC;qEAAEkD,kBAAM8D;gCAA8BnC,WAAwBE,iBAA8BC;mCAA7E;gCAAC9B;gCAAM8D,EAAEC,KAAK;gCAAED,EAAEE,GAAG;iCAAErC,YAAAA,KAAKvB,GAAG,CAACJ,mBAAT2B,uBAAAA,YAAkB;iCAAME,kBAAAA,WAAWzB,GAAG,CAACJ,mBAAf6B,6BAAAA,kBAAwB;iCAAMC,uBAAAA,gBAAgB1B,GAAG,CAACJ,mBAApB8B,kCAAAA,uBAA6B;6BAAK;;;;oBAFpJ;;;oBAMF,yFAAyF;oBACzF,2FAA2F;oBAC3F,8BAA8B;oBACxBC,QAAQV,QAAQ,AAAC,UAAe,OAANA,OAAM,OAAK;oBAC3C,sFAAsF;oBACtF,2FAA2F;oBACrFW,gBAAgBZ,kBAAkB,yBAAyB;oBAC9C;;wBAAMrB,MAAMI,OAAO,CACpC,AAAC,qIAEI4B,OAFgIC,eAAc,gIAExI,OAAND,OAAM;;;oBAHPE,aAAa;oBAKL;;wBAAMA,WAAWI,GAAG,CAAC3B;;;oBAA7BwB,OAAQ;yBAEVN,CAAAA,UAAU9C,IAAI,GAAG,CAAA,GAAjB8C;;;;oBACIO,YAAY1F,iBAAiBa;oBAC9B,kCAAA,2BAAA;;;;;;;;;oBAAA,YAAa4E;;;2BAAb,6BAAA,QAAA;;;;oBAAMhC,MAAN;oBACH,IAAIA,IAAIsD,GAAG,KAAK,QAAQ,CAAC5B,UAAUqC,GAAG,CAAC/D,IAAIF,IAAI,GAAa;;;;oBACxDhB,OAAAA,KAAAA;oBACJ,IAAI;wBACFA,OAAOkF,IAAAA,oBAAY,EAACC,IAAAA,cAAI,EAAC5D,IAAI6D,OAAO,EAAElE,IAAIF,IAAI,GAAa;oBAC7D,EAAE,eAAM;wBACN;;;2BAAU,mEAAmE;oBAC/E;oBAC4BjB,kBAAAA,eAAeC,MAAMmD,YAAzChD,UAAoBJ,gBAApBI,SAASE,SAAWN,gBAAXM;oBACjBa,IAAIsD,GAAG,GAAGrE;yBACNe,CAAAA,IAAImE,KAAK,IAAI,IAAG,GAAhBnE;;;;yBAA+BoE,IAAAA,uBAAc,EAAC/D,KAAK,aAApB+D;;;;oBAAkC;;wBAAMxE,aAAaC,OAAOG,IAAIF,IAAI,EAAYL,aAAaX,MAAMK;;;4BAAjE;;;;;;4BAA4E;;;oBAA1Ha,IAAImE,KAAK;;;oBAV7B;;;;;;;;;;;;oBAAA;oBAAA;;;;;;;6BAAA,6BAAA;4BAAA;;;4BAAA;kCAAA;;;;;;;oBAcP;;wBAAOnC;;;;IACT"}

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

@@ -1,18 +1,12 @@
-import type { DatabaseSync } from 'node:sqlite';
 import type { ResolvedConfig } from '../config/index.js';
+import type { LexicalHit, Store } from '../store/types.js';
 export type Candidates = Map<string, {
     score: number;
     via: string;
 }>;
-export declare function wordsCandidates(db: DatabaseSync, candidates: Candidates, query: string, whereJoin: string, whereCond: string, scopeCond: string, fetch: number, weight: number): Array<{
-    path: string;
-    hit: string | null;
-}>;
-export declare function linksCandidates(db: DatabaseSync, candidates: Candidates, matchRows: Array<{
-    path: string;
-    hit: string | null;
-}>, allPaths: string[], allowedPaths: Set<string>, fetch: number, weight: number): void;
-export declare function vectorsCandidates(db: DatabaseSync, cfg: ResolvedConfig, candidates: Candidates, terms: string, fetch: number, allowedPaths: Set<string>, weight: number): Promise<{
+export declare function wordsCandidates(store: Store, candidates: Candidates, query: string, whereJoin: string, whereCond: string, scopeCond: string, fetch: number, weight: number): Promise<LexicalHit[]>;
+export declare function linksCandidates(store: Store, candidates: Candidates, matchRows: LexicalHit[], allPaths: string[], allowedPaths: Set<string>, fetch: number, weight: number): Promise<void>;
+export declare function vectorsCandidates(store: Store, cfg: ResolvedConfig, candidates: Candidates, terms: string, fetch: number, allowedPaths: Set<string>, weight: number): Promise<{
     chunkLines: Map<string, string>;
     chunkSimilarity: Map<string, number>;
 }>;