sensemaking 0.7.2 → 0.9.0

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

@@ -9,16 +9,21 @@ function _export(target, all) {
     });
 }
 _export(exports, {
-    get find () {
-        return find;
-    },
     get mapTree () {
         return mapTree;
     },
     get peek () {
         return peek;
+    },
+    get presetCoverage () {
+        return presetCoverage;
+    },
+    get search () {
+        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");
@@ -217,41 +222,236 @@ function _ts_generator(thisArg, body) {
         };
     }
 }
-// The three layer verbs: mapTree (orient), find (locate), peek (structure).
+// The three commands: mapTree (orient), search (locate), peek (structure).
 // Each returns data; cli.ts renders. All of them degrade when a feature is off.
 var WEIGHTED_BM25 = 'bm25(content, 10.0, 5.0, 1.0)';
 var RRF_K = 60;
-function find(_0, _1, _2) {
+// FTS5 snippet() re-tokenizes the whole doc per candidate row, superlinearly: measured
+// 2ms at 4KB docs but 189ms at 64KB for one query's pool, and ~10s for a single 1MB doc
+// (plans/performance-findings.md finding A). 16KB keeps the whole pool's snippet cost in
+// the low-ms range; bigger docs get the JS-computed excerpt, linear and only for the rows
+// actually returned.
+var SNIPPET_BOUND = 16384;
+var EXCERPT_WINDOW = 160;
+// Bare terms from an FTS5 query string: strips operators/quoting so the oversized-doc excerpt
+// scan matches the same words the query matched on, not FTS5 syntax.
+function extractBareTerms(query) {
+    var cleaned = query.replace(/"/g, ' ').replace(/[()*]/g, ' ').replace(/\b(AND|OR|NOT|NEAR)\b(\/\d+)?/gi, ' ');
+    return cleaned.split(/\s+/).map(function(tok) {
+        return tok.replace(/^[A-Za-z_]\w*:/, '');
+    }) // column filter, e.g. title:term
+    .map(function(tok) {
+        return tok.toLowerCase().trim();
+    }).filter(function(tok) {
+        return tok.length > 0;
+    });
+}
+function findOccurrences(haystackLower, terms) {
+    var occ = [];
+    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+    try {
+        for(var _iterator = terms[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            var term = _step.value;
+            var idx = 0;
+            for(;;){
+                var found = haystackLower.indexOf(term, idx);
+                if (found === -1) break;
+                occ.push({
+                    start: found,
+                    end: found + term.length,
+                    term: term
+                });
+                idx = found + term.length;
+            }
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
+            }
+        }
+    }
+    // Longest span first at equal start, so "tests" beats its substring "test" and the
+    // whole word gets highlighted; the emit loop then absorbs the shorter overlap.
+    return occ.sort(function(a, b) {
+        return a.start - b.start || b.end - a.end;
+    });
+}
+// Slides a window over the sorted occurrences, same semantics as FTS5's own best-window
+// pick: most distinct terms, ties broken by most total hits.
+function bestWindowStart(occ, windowSize) {
+    var best = occ[0].start;
+    var bestDistinct = 0;
+    var bestCount = 0;
+    for(var i = 0; i < occ.length; i++){
+        var winEnd = occ[i].start + windowSize;
+        var seen = new Set();
+        var count = 0;
+        for(var j = i; j < occ.length && occ[j].start < winEnd; j++){
+            seen.add(occ[j].term);
+            count++;
+        }
+        if (seen.size > bestDistinct || seen.size === bestDistinct && count > bestCount) {
+            best = occ[i].start;
+            bestDistinct = seen.size;
+            bestCount = count;
+        }
+    }
+    return best;
+}
+// snippet()-shaped excerpt: matched terms wrapped in «», … at cut edges. Linear in doc
+// length, only run for rows actually returned (<= k), unlike snippet()'s per-row cost.
+function computeExcerpt(text, terms) {
+    var occ = findOccurrences(text.toLowerCase(), terms);
+    if (occ.length === 0) {
+        // This is a raw substring scan, not porter-stemmed: a doc matched only through a
+        // stemmed variant (query "negotiate" vs doc "negotiating") finds no occurrence here.
+        // Fall back to the doc's start, unmarked, rather than claim a match that isn't there.
+        var end = Math.min(text.length, EXCERPT_WINDOW);
+        return {
+            excerpt: "".concat(text.slice(0, end).replace(/\s+/g, ' ').trim()).concat(end < text.length ? '…' : ''),
+            offset: 0
+        };
+    }
+    var start = bestWindowStart(occ, EXCERPT_WINDOW);
+    var end1 = Math.min(text.length, start + EXCERPT_WINDOW);
+    var out = '';
+    var cursor = start;
+    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+    try {
+        for(var _iterator = occ[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            var o = _step.value;
+            if (o.start < start || o.end > end1) continue;
+            // Occurrences of duplicate or substring-overlapping terms ("test tests") can overlap;
+            // emitting each would duplicate document text. Keep the first, absorb the rest.
+            if (o.start < cursor) continue;
+            out += "".concat(text.slice(cursor, o.start), "\xab").concat(text.slice(o.start, o.end), "\xbb");
+            cursor = o.end;
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
+            }
+        }
+    }
+    out += text.slice(cursor, end1);
+    var prefix = start > 0 ? '…' : '';
+    var suffix = end1 < text.length ? '…' : '';
+    return {
+        excerpt: "".concat(prefix).concat(out.replace(/\s+/g, ' ')).concat(suffix),
+        offset: start
+    };
+}
+function lineNumberAt(text, offset) {
+    var line = 1;
+    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;
+}
+// node:path's matchesGlob is experimental (stable behind an unstable-API flag) as of the
+// engines floor (Node >=22.16); scope filtering only ever needs single-pattern matching, so
+// it's used here in JS rather than pulling fast-glob's directory walk into 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, _opts_k, _opts_where, _hits_get, _chunkLines_get, _chunkSimilarity_get, _cfg_defaults_find, _cfg_defaults, k, fetch, scope, whereJoin, whereCond, matchSql, matchRows, hits, candidates, edges, linked, nodes, seeds, ranked, chunkLines, chunkSimilarity, vec, insert, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, _step_value, path, c, where, linesCol;
+        var opts, _hits_get, _chunkLines_get, _chunkSimilarity_get, effective, k, include, exclude, allPaths, scopedPaths, scopeActive, fetch, semanticEnabled, scope, whereJoin, whereCond, matchSql, 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;
         var _arguments = arguments;
         return _ts_generator(this, function(_state) {
             switch(_state.label){
                 case 0:
                     opts = _arguments.length > 3 && _arguments[3] !== void 0 ? _arguments[3] : {};
-                    k = (_opts_k = opts.k) !== null && _opts_k !== void 0 ? _opts_k : 10;
-                    fetch = Math.max(k * 3, 30);
+                    effective = (0, _configts.resolveSearch)(cfg, opts);
+                    k = effective.k, include = effective.include, exclude = effective.exclude;
+                    allPaths = db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
+                        return r.path;
+                    });
+                    // A preset scope reads preset_files -- the coverage reconcile actually indexed with
+                    // (fast-glob semantics); re-matching globs here with node:path's matchesGlob could
+                    // silently disagree with it. Ad-hoc --include has no persisted coverage, so only that
+                    // path pays the JS glob match.
+                    scopedPaths = opts.include ? new Set(allPaths.filter(function(p) {
+                        return inScope(p, include, exclude);
+                    })) : new Set(db.prepare('SELECT "path" FROM preset_files WHERE preset = ?').all(effective.presetName).map(function(r) {
+                        return r.path;
+                    }));
+                    // A scope narrower than the whole index needs a bigger candidate pool before filtering, or
+                    // filtering can starve k even though enough in-scope matches exist further down the ranked
+                    // list that a plain over-fetch wouldn't have reached.
+                    scopeActive = scopedPaths.size < allPaths.length;
+                    fetch = scopeActive ? Math.max(k * 5, 50) : Math.max(k * 3, 30);
+                    // Semantic participation: vectors run only when the effective setting allows it AND the
+                    // scope actually has embedded files -- a scope covered only by semantic-false presets (or
+                    // by no preset embedding at all) searches lexically, automatically, no error.
+                    semanticEnabled = effective.semantic && scopeHasEmbeddings(db, cfg, scopedPaths);
                     // Terms pass verbatim to FTS5 MATCH: bare words AND-join, operators are the caller's.
                     // Invalid syntax propagates as an error, zero matches return zero -- no silent rewrites.
                     // --where applies inside the candidate query (a post-filter over the top-N would drop
                     // matches ranked past the pool) and again on the final select for link-derived rows.
-                    // An explicit --where replaces the tree's declared default rather than ANDing with it,
-                    // so a caller can always widen back to the whole tree.
-                    scope = (_opts_where = opts.where) !== null && _opts_where !== void 0 ? _opts_where : (_cfg_defaults = cfg.defaults) === null || _cfg_defaults === void 0 ? void 0 : (_cfg_defaults_find = _cfg_defaults.find) === null || _cfg_defaults_find === void 0 ? void 0 : _cfg_defaults_find.where;
+                    // An explicit --where replaces the preset's declared where rather than ANDing with it,
+                    // so a caller can always widen back to the whole scope.
+                    scope = effective.where;
                     whereJoin = scope ? 'JOIN frontmatter f ON f."path" = content.path' : '';
                     whereCond = scope ? "AND (".concat(scope, ")") : '';
-                    matchSql = "SELECT content.path AS path, snippet(content, -1, '\xab', '\xbb', '…', 10) AS hit FROM content ".concat(whereJoin, " WHERE content MATCH ? ").concat(whereCond, " ORDER BY ").concat(WEIGHTED_BM25, " LIMIT ").concat(fetch);
+                    // Docs past SNIPPET_BOUND skip snippet() entirely -- SQLite
+                    // short-circuits the untaken CASE branch, so it's never invoked on them.
+                    matchSql = "SELECT content.path AS path, CASE WHEN length(content.text) <= ".concat(SNIPPET_BOUND, " THEN snippet(content, -1, '\xab', '\xbb', '…', 10) ELSE NULL END AS hit FROM content ").concat(whereJoin, " WHERE content MATCH ? ").concat(whereCond, " ORDER BY ").concat(WEIGHTED_BM25, " LIMIT ").concat(fetch);
                     try {
                         matchRows = db.prepare(matchSql).all(terms);
                     } catch (err) {
                         throw (0, _searcherrorts.searchError)(err, terms, scope);
                     }
+                    // Scope filtering happens in JS, on each candidate list, rather than in SQL: FTS5 match,
+                    // link expansion, and vector search all run unscoped above (cheap to over-fetch), then get
+                    // filtered here against the effective include/exclude before ranking is finalized.
+                    matchRows = matchRows.filter(function(r) {
+                        return scopedPaths.has(r.path);
+                    });
                     hits = new Map(matchRows.map(function(r) {
                         return [
                             r.path,
                             r.hit
                         ];
                     }));
+                    // hit === null here means the bound suppressed snippet(), not "no match" -- distinguish
+                    // from via='link' rows (never in matchRows, so absent from this set) below.
+                    oversized = new Set(matchRows.filter(function(r) {
+                        return r.hit === null;
+                    }).map(function(r) {
+                        return r.path;
+                    }));
                     candidates = new Map();
                     matchRows.forEach(function(r, i) {
                         candidates.set(r.path, {
@@ -266,18 +466,15 @@ function find(_0, _1, _2) {
                         // that mass from the score list reweights fusion toward connectivity and measurably
                         // wrecks ranking on link-dense corpora (FEVER hit@10 0.997 -> 0.907; fusion-tuning.md).
                         linked = new Set(edges.flat());
-                        nodes = db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
-                            return r.path;
-                        });
                         seeds = new Map(matchRows.map(function(r, i) {
                             return [
                                 r.path,
                                 1 / (i + 1)
                             ];
                         }));
-                        ranked = _to_consumable_array((0, _graphts.personalizedRank)(nodes, edges, seeds)).filter(function(param) {
-                            var _param = _sliced_to_array(param, 2), score = _param[1];
-                            return score > 1e-9;
+                        ranked = _to_consumable_array((0, _graphts.personalizedRank)(allPaths, edges, seeds)).filter(function(param) {
+                            var _param = _sliced_to_array(param, 2), path = _param[0], score = _param[1];
+                            return score > 1e-9 && scopedPaths.has(path);
                         }).sort(function(a, b) {
                             return b[1] - a[1];
                         }).slice(0, fetch);
@@ -299,7 +496,7 @@ function find(_0, _1, _2) {
                     // (weight 1, pool = fetch). Each row carries its best chunk's line range.
                     chunkLines = new Map();
                     chunkSimilarity = new Map();
-                    if (!opts.semantic) return [
+                    if (!semanticEnabled) return [
                         3,
                         2
                     ];
@@ -308,7 +505,9 @@ function find(_0, _1, _2) {
                         (0, _embedts.semanticCandidates)(db, cfg, terms, fetch)
                     ];
                 case 1:
-                    vec = _state.sent();
+                    vec = _state.sent().filter(function(v) {
+                        return scopedPaths.has(v.path);
+                    });
                     vec.forEach(function(param, i) {
                         var path = param.path, lines = param.lines, similarity = param.similarity;
                         chunkLines.set(path, lines);
@@ -349,22 +548,81 @@ function find(_0, _1, _2) {
                             }
                         }
                     }
-                    where = scope ? "WHERE ".concat(scope) : '';
-                    linesCol = opts.semantic ? ', _find.lines, _find.similarity' : '';
+                    // Every candidate list was already filtered to scopedPaths above, so _find only ever holds
+                    // in-scope rows -- the final select just needs --where again, same as before, for rows
+                    // whichever candidate query didn't itself apply it to (link-derived rows never touched
+                    // whereCond above).
+                    where = scope ? "WHERE (".concat(scope, ")") : '';
+                    // 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 ? ', _find.similarity' : '';
+                    rows = db.prepare('SELECT f."path" AS path, content.title, content.summary, _find.hit, _find.via, round(_find.score, 4) AS score, _find.lines'.concat(similarityCol, '\n       FROM _find JOIN frontmatter f ON f."path" = _find."path" JOIN content ON content.path = _find."path"\n       ').concat(where, " ORDER BY _find.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, _configts.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 [
                         2,
-                        db.prepare('SELECT f."path" AS path, content.title, content.summary, _find.hit, _find.via, round(_find.score, 4) AS score'.concat(linesCol, '\n       FROM _find JOIN frontmatter f ON f."path" = _find."path" JOIN content ON content.path = _find."path"\n       ').concat(where, " ORDER BY _find.score DESC LIMIT ?")).all(k)
+                        rows
                     ];
             }
         });
     }).apply(this, arguments);
 }
+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
+        };
+    });
+}
 var INTERNAL_COLUMNS = new Set([
     'path',
     '_mtime',
     '_size',
     '_rank'
 ]);
+// 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;
+}
 function mapTree(db, cfg) {
     var docs = db.prepare('SELECT COUNT(*) AS count, COALESCE(SUM("_size"), 0) AS bytes FROM frontmatter').get();
     var columns = db.prepare('PRAGMA table_info(frontmatter)').all().map(function(r) {
@@ -372,18 +630,47 @@ function mapTree(db, cfg) {
     }).filter(function(name) {
         return !INTERNAL_COLUMNS.has(name);
     });
-    var allFields = columns.map(function(name) {
-        var quoted = '"'.concat(name.split('"').join('""'), '"');
-        // Observed storage class, not a declared one: these columns are added dynamically and
-        // SQLite types per value, so a field can be text in most notes and numeric in a few.
-        // Listing every distinct type makes both the type and any drift visible.
-        var _db_prepare_get = db.prepare("SELECT COUNT(".concat(quoted, ") AS n, GROUP_CONCAT(DISTINCT typeof(").concat(quoted, ")) AS types FROM frontmatter WHERE ").concat(quoted, " IS NOT NULL")).get(), n = _db_prepare_get.n, types = _db_prepare_get.types;
-        return {
-            field: name,
-            coverage: n,
-            type: types !== null && types !== void 0 ? types : ''
+    // Observed storage class, not a declared one: these columns are added dynamically and
+    // SQLite types per value, so a field can be text in most notes and numeric in a few.
+    // Listing every distinct type makes both the type and any drift visible.
+    // One aggregate scan per chunk of columns rather than one scan per column: COUNT already
+    // ignores NULL, and FILTER keeps typeof() looking only at the non-null rows COUNT counted,
+    // matching the old per-column `WHERE ... IS NOT NULL` exactly.
+    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")).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_ : ''
+                });
+            });
         };
-    }).sort(function(a, b) {
+        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);
@@ -394,11 +681,12 @@ function mapTree(db, cfg) {
         fields: fields,
         fieldsTotal: allFields.length,
         features: (0, _configts.featureStates)(cfg),
+        presets: presetCoverage(db, cfg),
         hubs: hubs,
         recent: recent
     };
 }
-var PEEK_LINK_LIMIT = 20;
+var PEEK_LIST_LIMIT = 20;
 function peek(db, cfg, pathArg) {
     var _row__size;
     var paths = db.prepare('SELECT "path" FROM frontmatter').all().map(function(r) {
@@ -438,7 +726,8 @@ function peek(db, cfg, pathArg) {
             }
         }
     }
-    var sections = (0, _configts.featureEnabled)(cfg, 'sections') ? db.prepare('SELECT level, heading, start_line, end_line, tokens FROM sections WHERE "path" = ? ORDER BY idx').all(path) : [];
+    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 = [];
@@ -456,7 +745,7 @@ function peek(db, cfg, pathArg) {
             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_LINK_LIMIT).map(function(r) {
+        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;
         });
     }
@@ -465,9 +754,10 @@ function peek(db, cfg, pathArg) {
         tokens: Math.ceil(((_row__size = row._size) !== null && _row__size !== void 0 ? _row__size : 0) / 4),
         frontmatter: frontmatter,
         sections: sections,
-        outbound: outbound.slice(0, PEEK_LINK_LIMIT),
+        outbound: outbound.slice(0, PEEK_LIST_LIMIT),
         backlinks: backlinks,
-        unresolved: unresolved.slice(0, PEEK_LINK_LIMIT),
+        unresolved: unresolved.slice(0, PEEK_LIST_LIMIT),
+        sectionsTotal: sectionsTotal,
         outboundTotal: outbound.length,
         backlinksTotal: backlinksTotal,
         unresolvedTotal: unresolved.length,

package/dist/cjs/commands.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/commands.ts"],"sourcesContent":["import { readFileSync } from 'node:fs';\nimport { join, matchesGlob } from 'node:path';\nimport posix from 'node:path/posix';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { FeatureName, ResolvedConfig } from './config.ts';\nimport { anyPresetEmbeds, featureEnabled, featureStates, presetNames, resolveSearch } from './config.ts';\nimport { SenseError } from './errors.ts';\nimport { 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';\n\n// The three commands: mapTree (orient), search (locate), peek (structure).\n// Each returns data; cli.ts renders. All of them degrade when a feature is off.\n\nconst WEIGHTED_BM25 = 'bm25(content, 10.0, 5.0, 1.0)';\nconst RRF_K = 60;\n\n// FTS5 snippet() re-tokenizes the whole doc per candidate row, superlinearly: measured\n// 2ms at 4KB docs but 189ms at 64KB for one query's pool, and ~10s for a single 1MB doc\n// (plans/performance-findings.md finding A). 16KB keeps the whole pool's snippet cost in\n// the low-ms range; bigger docs get the JS-computed excerpt, linear and only for the rows\n// actually returned.\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); replaces the preset's include/exclude\n  semantic?: boolean; // false opts out of vector participation regardless of the preset\n}\n\n// node:path's matchesGlob is experimental (stable behind an unstable-API flag) as of the\n// engines floor (Node >=22.16); scope filtering only ever needs single-pattern matching, so\n// it's used here in JS rather than pulling fast-glob's directory walk into the query path.\nfunction inScope(path: string, include: string[], exclude?: string[]): boolean {\n  if (!include.some((g) => matchesGlob(path, g))) return false;\n  if (exclude?.some((g) => matchesGlob(path, g))) return false;\n  return true;\n}\n\nfunction scopeHasEmbeddings(db: DatabaseSync, cfg: ResolvedConfig, scopedPaths: Set<string>): boolean {\n  if (!anyPresetEmbeds(cfg)) return false; // the embeddings table doesn't exist at all in this case\n  const rows = db.prepare('SELECT DISTINCT \"path\" FROM embeddings').all() as Array<{ path: string }>;\n  return rows.some((r) => scopedPaths.has(r.path));\n}\n\n// BM25 + link-graph expansion, fused by reciprocal rank. `via` says which signal produced\n// each row so the agent knows what evidence it is trusting.\n// Resolution precedence (built-ins <- preset <- caller overrides) lives in\n// src/config.ts:resolveSearch; `opts` here is whatever the caller (a saved search merged\n// with any CLI flag, or a bare CLI invocation) already resolved.\nexport async function search(db: DatabaseSync, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<Row[]> {\n  const effective = resolveSearch(cfg, opts);\n  const { k, include, exclude } = effective;\n\n  const allPaths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  // A preset scope reads preset_files -- the coverage reconcile actually indexed with\n  // (fast-glob semantics); re-matching globs here with node:path's matchesGlob could\n  // silently disagree with it. Ad-hoc --include has no persisted coverage, so only that\n  // path pays the JS glob match.\n  const scopedPaths = opts.include ? new Set(allPaths.filter((p) => inScope(p, include, exclude))) : new Set((db.prepare('SELECT \"path\" FROM preset_files WHERE preset = ?').all(effective.presetName) as Array<{ path: string }>).map((r) => r.path));\n  // A scope narrower than the whole index needs a bigger candidate pool before filtering, or\n  // filtering can starve k even though enough in-scope matches exist further down the ranked\n  // list that a plain over-fetch wouldn't have reached.\n  const scopeActive = scopedPaths.size < allPaths.length;\n  const fetch = scopeActive ? Math.max(k * 5, 50) : Math.max(k * 3, 30);\n\n  // Semantic participation: vectors run only when the effective setting allows it AND the\n  // scope actually has embedded files -- a scope covered only by semantic-false presets (or\n  // by no preset embedding at all) searches lexically, automatically, no error.\n  const semanticEnabled = effective.semantic && scopeHasEmbeddings(db, cfg, scopedPaths);\n\n  // Terms pass verbatim to FTS5 MATCH: bare words AND-join, operators are the caller's.\n  // Invalid syntax propagates as an error, zero matches return zero -- no silent rewrites.\n  // --where applies inside the candidate query (a post-filter over the top-N would drop\n  // matches ranked past the pool) and again on the final select for link-derived rows.\n  // An explicit --where replaces the preset's declared where rather than ANDing with it,\n  // so a caller can always widen back to the whole scope.\n  const scope = effective.where;\n  const whereJoin = scope ? `JOIN frontmatter f ON f.\"path\" = content.path` : '';\n  const whereCond = scope ? `AND (${scope})` : '';\n  // Docs past SNIPPET_BOUND skip snippet() entirely -- SQLite\n  // short-circuits the untaken CASE branch, so it's never invoked on them.\n  const matchSql = `SELECT content.path AS path, CASE WHEN length(content.text) <= ${SNIPPET_BOUND} THEN snippet(content, -1, '«', '»', '…', 10) ELSE NULL END AS hit FROM content ${whereJoin} WHERE content MATCH ? ${whereCond} ORDER BY ${WEIGHTED_BM25} LIMIT ${fetch}`;\n  let matchRows: Array<{ path: string; hit: string | null }>;\n  try {\n    matchRows = db.prepare(matchSql).all(terms) as Array<{ path: string; hit: string | null }>;\n  } catch (err) {\n    throw searchError(err as Error, terms, scope);\n  }\n  // Scope filtering happens in JS, on each candidate list, rather than in SQL: FTS5 match,\n  // link expansion, and vector search all run unscoped above (cheap to over-fetch), then get\n  // filtered here against the effective include/exclude before ranking is finalized.\n  matchRows = matchRows.filter((r) => scopedPaths.has(r.path));\n\n  const hits = new Map(matchRows.map((r) => [r.path, r.hit]));\n  // hit === null here means the bound suppressed snippet(), not \"no match\" -- distinguish\n  // from via='link' rows (never in matchRows, so absent from this set) below.\n  const oversized = new Set(matchRows.filter((r) => r.hit === null).map((r) => r.path));\n  const candidates = new Map<string, { score: number; via: string }>();\n  matchRows.forEach((r, i) => {\n    candidates.set(r.path, { score: 1 / (RRF_K + i), via: 'match' });\n  });\n\n  const edges = featureEnabled(cfg, 'links') && matchRows.length > 0 ? linkEdges(db) : [];\n  if (edges.length > 0) {\n    // `linked` gates the label only, not the score: PPR restart mass gives every seed a\n    // nonzero rank even without an incident edge, which is not link evidence — but dropping\n    // that mass from the score list reweights fusion toward connectivity and measurably\n    // wrecks ranking on link-dense corpora (FEVER hit@10 0.997 -> 0.907; fusion-tuning.md).\n    const linked = new Set(edges.flat());\n    const seeds = new Map(matchRows.map((r, i) => [r.path, 1 / (i + 1)]));\n    const ranked = [...personalizedRank(allPaths, edges, seeds)]\n      .filter(([path, score]) => score > 1e-9 && scopedPaths.has(path))\n      .sort((a, b) => b[1] - a[1])\n      .slice(0, fetch);\n    ranked.forEach(([path], i) => {\n      const existing = candidates.get(path);\n      if (existing) {\n        existing.score += 1 / (RRF_K + i);\n        if (linked.has(path)) existing.via = 'match+link';\n      } else {\n        candidates.set(path, { score: 1 / (RRF_K + i), via: 'link' });\n      }\n    });\n  }\n\n  // Vector expansion, invoked only: a third RRF list at the swept flat-region constants\n  // (weight 1, pool = fetch). Each row carries its best chunk's line range.\n  const chunkLines = new Map<string, string>();\n  const chunkSimilarity = new Map<string, number>();\n  if (semanticEnabled) {\n    const vec = (await semanticCandidates(db, cfg, terms, fetch)).filter((v) => scopedPaths.has(v.path));\n    vec.forEach(({ path, lines, similarity }, i) => {\n      chunkLines.set(path, lines);\n      chunkSimilarity.set(path, similarity);\n      const existing = candidates.get(path);\n      if (existing) {\n        existing.score += 1 / (RRF_K + i);\n        existing.via = `${existing.via}+vector`;\n      } else {\n        candidates.set(path, { score: 1 / (RRF_K + i), via: 'vector' });\n      }\n    });\n  }\n\n  db.exec('DROP TABLE IF EXISTS _find');\n  db.exec('CREATE TEMP TABLE _find (\"path\" TEXT PRIMARY KEY, score REAL, via TEXT, hit TEXT, lines TEXT, similarity REAL)');\n  const insert = db.prepare('INSERT INTO _find (\"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  // Every candidate list was already filtered to scopedPaths above, so _find only ever holds\n  // in-scope rows -- the final select just needs --where again, same as before, for rows\n  // whichever candidate query didn't itself apply it to (link-derived rows never touched\n  // whereCond above).\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 ? ', _find.similarity' : '';\n  const rows = db\n    .prepare(\n      `SELECT f.\"path\" AS path, content.title, content.summary, _find.hit, _find.via, round(_find.score, 4) AS score, _find.lines${similarityCol}\n       FROM _find JOIN frontmatter f ON f.\"path\" = _find.\"path\" JOIN content ON content.path = _find.\"path\"\n       ${where} ORDER BY _find.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\nexport interface PresetCoverage {\n  name: string;\n  files: number;\n  embedded: number;\n}\n\n// Indexing and embedding are both derived from presets rather than declared directly, so\n// that derivation must stay visible: how many files each preset actually matched, and how\n// many of those are covered by embedding. Read from preset_files (rebuilt at reconcile), not\n// recomputed from globs, so this always reflects what's actually on disk in the cache.\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 };\n  });\n}\n\nexport interface TreeMap {\n  docs: { count: number; bytes: number };\n  fields: Row[]; // top 20 by coverage; fieldsTotal carries the real count\n  fieldsTotal: number;\n  features: { on: FeatureName[]; off: FeatureName[] };\n  presets: PresetCoverage[];\n  hubs: Row[];\n  recent: Row[];\n}\n\nconst INTERNAL_COLUMNS = new Set(['path', '_mtime', '_size', '_rank']);\n\n// A result row is capped at SQLITE_MAX_COLUMN (2000, default); two aggregate expressions\n// per field keeps a chunk's row safely under that regardless of how many fields the tree has.\nconst MAP_COLUMN_CHUNK = 300;\n\nfunction chunk<T>(items: T[], size: number): T[][] {\n  const out: T[][] = [];\n  for (let i = 0; i < items.length; i += size) out.push(items.slice(i, i + size));\n  return out;\n}\n\n// mapTree: what is this tree. Fixed-size output regardless of tree size.\nexport function mapTree(db: DatabaseSync, cfg: ResolvedConfig): TreeMap {\n  const docs = db.prepare('SELECT COUNT(*) AS count, COALESCE(SUM(\"_size\"), 0) AS bytes FROM frontmatter').get() as { count: number; bytes: number };\n\n  const columns = (db.prepare('PRAGMA table_info(frontmatter)').all() as Array<{ name: string }>).map((r) => r.name).filter((name) => !INTERNAL_COLUMNS.has(name));\n  // Observed storage class, not a declared one: these columns are added dynamically and\n  // SQLite types per value, so a field can be text in most notes and numeric in a few.\n  // Listing every distinct type makes both the type and any drift visible.\n  // One aggregate scan per chunk of columns rather than one scan per column: COUNT already\n  // ignores NULL, and FILTER keeps typeof() looking only at the non-null rows COUNT counted,\n  // matching the old per-column `WHERE ... IS NOT NULL` exactly.\n  const allFields: Row[] = [];\n  for (const group of chunk(columns, MAP_COLUMN_CHUNK)) {\n    const exprs = group.map((name, i) => {\n      const quoted = `\"${name.split('\"').join('\"\"')}\"`;\n      return `COUNT(${quoted}) AS n${i}, GROUP_CONCAT(DISTINCT typeof(${quoted})) FILTER (WHERE ${quoted} IS NOT NULL) AS t${i}`;\n    });\n    const result = db.prepare(`SELECT ${exprs.join(', ')} FROM frontmatter`).get() as Record<string, number | string | null>;\n    group.forEach((name, i) => allFields.push({ field: name, coverage: result[`n${i}`] as number, type: (result[`t${i}`] as string) ?? '' }));\n  }\n  allFields.sort((a, b) => (b.coverage as number) - (a.coverage as number));\n  const fields = allFields.slice(0, 20);\n\n  const hubs = featureEnabled(cfg, 'rank') ? (db.prepare(`SELECT f.\"path\" AS path, round(f.\"_rank\" * 100, 2) AS rank, content.title FROM frontmatter f JOIN content ON content.path = f.\"path\" WHERE f.\"_rank\" IS NOT NULL ORDER BY f.\"_rank\" DESC LIMIT 8`).all() as Row[]) : [];\n\n  const recent = db.prepare(`SELECT \"path\", datetime(\"_mtime\" / 1000, 'unixepoch') AS modified FROM frontmatter ORDER BY \"_mtime\" DESC LIMIT 5`).all() as Row[];\n\n  return { docs, fields, fieldsTotal: allFields.length, features: featureStates(cfg), presets: presetCoverage(db, cfg), hubs, recent };\n}\n\nexport interface Peek {\n  path: string;\n  tokens: number;\n  frontmatter: Row;\n  sections: Row[];\n  outbound: string[];\n  backlinks: string[];\n  unresolved: string[];\n  // Totals before truncation: a hub can have thousands of backlinks (or a note thousands of\n  // headings), and peek's whole point is bounded output. Query the sections/links tables\n  // directly for the full list.\n  sectionsTotal: number;\n  outboundTotal: number;\n  backlinksTotal: number;\n  unresolvedTotal: number;\n  off: FeatureName[]; // disabled features whose blocks are omitted (not empty)\n}\n\nconst PEEK_LIST_LIMIT = 20;\n\n// peek: everything about one note except its prose -- frontmatter, outline with line\n// ranges + token estimates (so the follow-up Read is a range, not the file), links both ways.\nexport function peek(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string): Peek {\n  const paths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  let path = paths.find((p) => p === pathArg);\n  if (!path) {\n    const base = posix.basename(pathArg).replace(/\\.md$/i, '').toLowerCase();\n    const matches = paths.filter((p) => posix.basename(p).replace(/\\.md$/i, '').toLowerCase() === base);\n    if (matches.length === 1) path = matches[0];\n    else if (matches.length > 1) throw new SenseError('NOTE_AMBIGUOUS', `\"${pathArg}\" is ambiguous: ${matches.join(', ')}`);\n    else throw new SenseError('NOTE_NOT_FOUND', `no note matches \"${pathArg}\"`);\n  }\n\n  const row = db.prepare('SELECT * FROM frontmatter WHERE \"path\" = ?').get(path) as Row;\n  const frontmatter: Row = {};\n  for (const [key, value] of Object.entries(row)) {\n    if (!INTERNAL_COLUMNS.has(key) && value !== null) frontmatter[key] = value;\n  }\n\n  const sectionsTotal = featureEnabled(cfg, 'sections') ? (db.prepare('SELECT COUNT(*) AS n FROM sections WHERE \"path\" = ?').get(path) as { n: number }).n : 0;\n  const sections = featureEnabled(cfg, 'sections') ? (db.prepare('SELECT level, heading, start_line, end_line, tokens FROM sections WHERE \"path\" = ? ORDER BY idx LIMIT ?').all(path, PEEK_LIST_LIMIT) as Row[]) : [];\n\n  let outbound: string[] = [];\n  let backlinks: string[] = [];\n  let unresolved: string[] = [];\n  let backlinksTotal = 0;\n  if (featureEnabled(cfg, 'links')) {\n    const out = db.prepare('SELECT target, dst FROM links WHERE src = ? ORDER BY target').all(path) as Array<{ target: string; dst: string | null }>;\n    outbound = [...new Set(out.filter((l) => l.dst !== null).map((l) => l.dst as string))];\n    unresolved = out.filter((l) => l.dst === null).map((l) => l.target);\n    backlinksTotal = (db.prepare('SELECT COUNT(DISTINCT src) AS n FROM links WHERE dst = ?').get(path) as { n: number }).n;\n    backlinks = (db.prepare('SELECT DISTINCT src FROM links WHERE dst = ? ORDER BY src LIMIT ?').all(path, PEEK_LIST_LIMIT) as Array<{ src: string }>).map((r) => r.src);\n  }\n\n  return {\n    path,\n    tokens: Math.ceil(((row._size as number) ?? 0) / 4),\n    frontmatter,\n    sections,\n    outbound: outbound.slice(0, PEEK_LIST_LIMIT),\n    backlinks,\n    unresolved: unresolved.slice(0, PEEK_LIST_LIMIT),\n    sectionsTotal,\n    outboundTotal: outbound.length,\n    backlinksTotal,\n    unresolvedTotal: unresolved.length,\n    off: (['sections', 'links'] as FeatureName[]).filter((name) => !featureEnabled(cfg, name)),\n  };\n}\n"],"names":["mapTree","peek","presetCoverage","search","WEIGHTED_BM25","RRF_K","SNIPPET_BOUND","EXCERPT_WINDOW","extractBareTerms","query","cleaned","replace","split","map","tok","toLowerCase","trim","filter","length","findOccurrences","haystackLower","terms","occ","term","idx","found","indexOf","push","start","end","sort","a","b","bestWindowStart","windowSize","best","bestDistinct","bestCount","i","winEnd","seen","Set","count","j","add","size","computeExcerpt","text","Math","min","excerpt","slice","offset","out","cursor","o","prefix","suffix","lineNumberAt","line","charCodeAt","lineRangeFor","db","path","row","prepare","get","start_line","end_line","inScope","include","exclude","some","g","matchesGlob","scopeHasEmbeddings","cfg","scopedPaths","anyPresetEmbeds","rows","all","r","has","opts","hits","chunkLines","chunkSimilarity","effective","k","allPaths","scopeActive","fetch","semanticEnabled","scope","whereJoin","whereCond","matchSql","matchRows","oversized","candidates","edges","linked","seeds","ranked","vec","insert","c","where","similarityCol","bareTerms","resolveSearch","p","presetName","max","semantic","err","searchError","Map","hit","forEach","set","score","via","featureEnabled","linkEdges","flat","personalizedRank","existing","semanticCandidates","v","lines","similarity","exec","run","readFileSync","join","baseDir","embedActive","presetNames","name","files","n","embedded","INTERNAL_COLUMNS","MAP_COLUMN_CHUNK","chunk","items","docs","columns","allFields","group","exprs","quoted","result","field","coverage","type","fields","hubs","recent","fieldsTotal","features","featureStates","presets","PEEK_LIST_LIMIT","pathArg","paths","find","base","posix","basename","matches","SenseError","frontmatter","Object","entries","key","value","sectionsTotal","sections","outbound","backlinks","unresolved","backlinksTotal","l","dst","target","src","tokens","ceil","_size","outboundTotal","unresolvedTotal","off"],"mappings":";;;;;;;;;;;QAqUgBA;eAAAA;;QAmDAC;eAAAA;;QAnFAC;eAAAA;;QAjJMC;eAAAA;;;sBApJO;wBACK;4DAChB;wBAGyE;wBAChE;uBACQ;uBACT;uBACO;6BAEL;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAE5B,2EAA2E;AAC3E,gFAAgF;AAEhF,IAAMC,gBAAgB;AACtB,IAAMC,QAAQ;AAEd,uFAAuF;AACvF,wFAAwF;AACxF,yFAAyF;AACzF,0FAA0F;AAC1F,qBAAqB;AACrB,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;AAUA,yFAAyF;AACzF,4FAA4F;AAC5F,2FAA2F;AAC3F,SAASC,QAAQN,IAAY,EAAEO,OAAiB,EAAEC,OAAkB;IAClE,IAAI,CAACD,QAAQE,IAAI,CAAC,SAACC;eAAMC,IAAAA,qBAAW,EAACX,MAAMU;QAAK,OAAO;IACvD,IAAIF,oBAAAA,8BAAAA,QAASC,IAAI,CAAC,SAACC;eAAMC,IAAAA,qBAAW,EAACX,MAAMU;QAAK,OAAO;IACvD,OAAO;AACT;AAEA,SAASE,mBAAmBb,EAAgB,EAAEc,GAAmB,EAAEC,WAAwB;IACzF,IAAI,CAACC,IAAAA,yBAAe,EAACF,MAAM,OAAO,OAAO,yDAAyD;IAClG,IAAMG,OAAOjB,GAAGG,OAAO,CAAC,0CAA0Ce,GAAG;IACrE,OAAOD,KAAKP,IAAI,CAAC,SAACS;eAAMJ,YAAYK,GAAG,CAACD,EAAElB,IAAI;;AAChD;AAOO,SAAe5D;wCAAO2D,EAAgB,EAAEc,GAAmB,EAAEvD,KAAa;YAAE8D,MAkGZC,WAAwBC,iBAA8BC,sBAjGrHC,WACEC,GAAGlB,SAASC,SAEdkB,UAKAZ,aAIAa,aACAC,OAKAC,iBAQAC,OACAC,WACAC,WAGAC,UACFC,WAWEb,MAGAc,WACAC,YAKAC,OAMEC,QACAC,OACAC,QAiBFlB,YACAC,iBAEEkB,KAgBFC,QACD,2BAAA,mBAAA,gBAAA,WAAA,oBAAO1C,MAAM2C,GAMZC,OAGAC,eACA7B,MASE8B,WACD,4BAAA,oBAAA,iBAAA,YAAA,QAAM7C,KAELjB,MAMwBD,iBAApBI,SAASE;;;;;oBA9H4D+B,OAAAA,oEAAsB,CAAC;oBAClGI,YAAYuB,IAAAA,uBAAa,EAAClC,KAAKO;oBAC7BK,IAAwBD,UAAxBC,GAAGlB,UAAqBiB,UAArBjB,SAASC,UAAYgB,UAAZhB;oBAEdkB,WAAW,AAAC3B,GAAGG,OAAO,CAAC,kCAAkCe,GAAG,GAA+BnE,GAAG,CAAC,SAACoE;+BAAMA,EAAElB,IAAI;;oBAClH,oFAAoF;oBACpF,mFAAmF;oBACnF,sFAAsF;oBACtF,+BAA+B;oBACzBc,cAAcM,KAAKb,OAAO,GAAG,IAAI7B,IAAIgD,SAASxE,MAAM,CAAC,SAAC8F;+BAAM1C,QAAQ0C,GAAGzC,SAASC;0BAAa,IAAI9B,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDe,GAAG,CAACO,UAAUyB,UAAU,EAA8BnG,GAAG,CAAC,SAACoE;+BAAMA,EAAElB,IAAI;;oBAClP,2FAA2F;oBAC3F,2FAA2F;oBAC3F,sDAAsD;oBAChD2B,cAAcb,YAAYhC,IAAI,GAAG4C,SAASvE,MAAM;oBAChDyE,QAAQD,cAAc1C,KAAKiE,GAAG,CAACzB,IAAI,GAAG,MAAMxC,KAAKiE,GAAG,CAACzB,IAAI,GAAG;oBAElE,wFAAwF;oBACxF,0FAA0F;oBAC1F,8EAA8E;oBACxEI,kBAAkBL,UAAU2B,QAAQ,IAAIvC,mBAAmBb,IAAIc,KAAKC;oBAE1E,sFAAsF;oBACtF,yFAAyF;oBACzF,sFAAsF;oBACtF,qFAAqF;oBACrF,uFAAuF;oBACvF,wDAAwD;oBAClDgB,QAAQN,UAAUoB,KAAK;oBACvBb,YAAYD,QAAQ,kDAAkD;oBACtEE,YAAYF,QAAQ,AAAC,QAAa,OAANA,OAAM,OAAK;oBAC7C,4DAA4D;oBAC5D,yEAAyE;oBACnEG,WAAW,AAAC,kEAAiKF,OAAhGxF,eAAc,0FAAqHyF,OAAnCD,WAAU,2BAA+C1F,OAAtB2F,WAAU,cAAmCJ,OAAvBvF,eAAc,WAAe,OAANuF;oBAEnQ,IAAI;wBACFM,YAAYnC,GAAGG,OAAO,CAAC+B,UAAUhB,GAAG,CAAC3D;oBACvC,EAAE,OAAO8F,KAAK;wBACZ,MAAMC,IAAAA,0BAAW,EAACD,KAAc9F,OAAOwE;oBACzC;oBACA,yFAAyF;oBACzF,2FAA2F;oBAC3F,mFAAmF;oBACnFI,YAAYA,UAAUhF,MAAM,CAAC,SAACgE;+BAAMJ,YAAYK,GAAG,CAACD,EAAElB,IAAI;;oBAEpDqB,OAAO,IAAIiC,IAAIpB,UAAUpF,GAAG,CAAC,SAACoE;+BAAM;4BAACA,EAAElB,IAAI;4BAAEkB,EAAEqC,GAAG;yBAAC;;oBACzD,wFAAwF;oBACxF,4EAA4E;oBACtEpB,YAAY,IAAIzD,IAAIwD,UAAUhF,MAAM,CAAC,SAACgE;+BAAMA,EAAEqC,GAAG,KAAK;uBAAMzG,GAAG,CAAC,SAACoE;+BAAMA,EAAElB,IAAI;;oBAC7EoC,aAAa,IAAIkB;oBACvBpB,UAAUsB,OAAO,CAAC,SAACtC,GAAG3C;wBACpB6D,WAAWqB,GAAG,CAACvC,EAAElB,IAAI,EAAE;4BAAE0D,OAAO,IAAKpH,CAAAA,QAAQiC,CAAAA;4BAAIoF,KAAK;wBAAQ;oBAChE;oBAEMtB,QAAQuB,IAAAA,wBAAc,EAAC/C,KAAK,YAAYqB,UAAU/E,MAAM,GAAG,IAAI0G,IAAAA,kBAAS,EAAC9D;oBAC/E,IAAIsC,MAAMlF,MAAM,GAAG,GAAG;wBACpB,oFAAoF;wBACpF,wFAAwF;wBACxF,oFAAoF;wBACpF,wFAAwF;wBAClFmF,SAAS,IAAI5D,IAAI2D,MAAMyB,IAAI;wBAC3BvB,QAAQ,IAAIe,IAAIpB,UAAUpF,GAAG,CAAC,SAACoE,GAAG3C;mCAAM;gCAAC2C,EAAElB,IAAI;gCAAE,IAAKzB,CAAAA,IAAI,CAAA;6BAAG;;wBAC7DiE,SAAS,AAAC,qBAAGuB,IAAAA,yBAAgB,EAACrC,UAAUW,OAAOE,QAClDrF,MAAM,CAAC;qEAAE8C,kBAAM0D;mCAAWA,QAAQ,QAAQ5C,YAAYK,GAAG,CAACnB;2BAC1DjC,IAAI,CAAC,SAACC,GAAGC;mCAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE;2BAC1BoB,KAAK,CAAC,GAAGwC;wBACZY,OAAOgB,OAAO,CAAC,gBAASjF;qEAAPyB;4BACf,IAAMgE,WAAW5B,WAAWjC,GAAG,CAACH;4BAChC,IAAIgE,UAAU;gCACZA,SAASN,KAAK,IAAI,IAAKpH,CAAAA,QAAQiC,CAAAA;gCAC/B,IAAI+D,OAAOnB,GAAG,CAACnB,OAAOgE,SAASL,GAAG,GAAG;4BACvC,OAAO;gCACLvB,WAAWqB,GAAG,CAACzD,MAAM;oCAAE0D,OAAO,IAAKpH,CAAAA,QAAQiC,CAAAA;oCAAIoF,KAAK;gCAAO;4BAC7D;wBACF;oBACF;oBAEA,sFAAsF;oBACtF,0EAA0E;oBACpErC,aAAa,IAAIgC;oBACjB/B,kBAAkB,IAAI+B;yBACxBzB,iBAAAA;;;;oBACW;;wBAAMoC,IAAAA,2BAAkB,EAAClE,IAAIc,KAAKvD,OAAOsE;;;oBAAhDa,MAAM,AAAC,cAAiDvF,MAAM,CAAC,SAACgH;+BAAMpD,YAAYK,GAAG,CAAC+C,EAAElE,IAAI;;oBAClGyC,IAAIe,OAAO,CAAC,gBAA8BjF;4BAA3ByB,aAAAA,MAAMmE,cAAAA,OAAOC,mBAAAA;wBAC1B9C,WAAWmC,GAAG,CAACzD,MAAMmE;wBACrB5C,gBAAgBkC,GAAG,CAACzD,MAAMoE;wBAC1B,IAAMJ,WAAW5B,WAAWjC,GAAG,CAACH;wBAChC,IAAIgE,UAAU;4BACZA,SAASN,KAAK,IAAI,IAAKpH,CAAAA,QAAQiC,CAAAA;4BAC/ByF,SAASL,GAAG,GAAG,AAAC,GAAe,OAAbK,SAASL,GAAG,EAAC;wBACjC,OAAO;4BACLvB,WAAWqB,GAAG,CAACzD,MAAM;gCAAE0D,OAAO,IAAKpH,CAAAA,QAAQiC,CAAAA;gCAAIoF,KAAK;4BAAS;wBAC/D;oBACF;;;oBAGF5D,GAAGsE,IAAI,CAAC;oBACRtE,GAAGsE,IAAI,CAAC;oBACF3B,SAAS3C,GAAGG,OAAO,CAAC;oBACrB,kCAAA,2BAAA;;wBAAL,IAAK,YAAmBkC,iCAAnB,6BAAA,QAAA,yBAAA;2DAAA,iBAAOpC,uBAAM2C;4BAAkBD,OAAO4B,GAAG,CAACtE,MAAM2C,EAAEe,KAAK,EAAEf,EAAEgB,GAAG,GAAEtC,YAAAA,KAAKlB,GAAG,CAACH,mBAATqB,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWnB,GAAG,CAACH,mBAAfsB,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBpB,GAAG,CAACH,mBAApBuB,kCAAAA,uBAA6B;;;wBAAnJ;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAEL,2FAA2F;oBAC3F,uFAAuF;oBACvF,uFAAuF;oBACvF,oBAAoB;oBACdqB,QAAQd,QAAQ,AAAC,UAAe,OAANA,OAAM,OAAK;oBAC3C,sFAAsF;oBACtF,2FAA2F;oBACrFe,gBAAgBhB,kBAAkB,uBAAuB;oBACzDb,OAAOjB,GACVG,OAAO,CACN,AAAC,6HAEE0C,OAF0HC,eAAc,0HAElI,OAAND,OAAM,uCAEV3B,GAAG,CAACQ;oBAEP,IAAIU,UAAUrD,IAAI,GAAG,GAAG;wBAChBgE,YAAYrG,iBAAiBa;wBAC9B,mCAAA,4BAAA;;4BAAL,IAAK,aAAa0D,2BAAb,8BAAA,SAAA,0BAAA,kCAAmB;gCAAbf,MAAN;gCACH,IAAIA,IAAIsD,GAAG,KAAK,QAAQ,CAACpB,UAAUhB,GAAG,CAAClB,IAAID,IAAI,GAAa;gCACxDhB,OAAAA,KAAAA;gCACJ,IAAI;oCACFA,OAAOuF,IAAAA,oBAAY,EAACC,IAAAA,cAAI,EAAC3D,IAAI4D,OAAO,EAAExE,IAAID,IAAI,GAAa;gCAC7D,EAAE,eAAM;oCACN,UAAU,mEAAmE;gCAC/E;gCAC4BjB,kBAAAA,eAAeC,MAAM8D,YAAzC3D,UAAoBJ,gBAApBI,SAASE,SAAWN,gBAAXM;gCACjBY,IAAIsD,GAAG,GAAGpE;gCACV,IAAIc,IAAIkE,KAAK,IAAI,MAAMlE,IAAIkE,KAAK,GAAGP,IAAAA,wBAAc,EAAC/C,KAAK,cAAcf,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;4BAC1I;;4BAXK;4BAAA;;;qCAAA,8BAAA;oCAAA;;;oCAAA;0CAAA;;;;oBAYP;oBAEA;;wBAAO2B;;;;IACT;;AAYO,SAAS7E,eAAe4D,EAAgB,EAAEc,GAAmB;IAClE,IAAM6D,cAAc3D,IAAAA,yBAAe,EAACF;IACpC,OAAO8D,IAAAA,qBAAW,EAAC9D,KAAK/D,GAAG,CAAC,SAAC8H;QAC3B,IAAMC,QAAQ,AAAC9E,GAAGG,OAAO,CAAC,2DAA2DC,GAAG,CAACyE,MAAwBE,CAAC;QAClH,IAAMC,WAAWL,cAAc,AAAC3E,GAAGG,OAAO,CAAC,6JAA6JC,GAAG,CAACyE,MAAwBE,CAAC,GAAG;QACxO,OAAO;YAAEF,MAAAA;YAAMC,OAAAA;YAAOE,UAAAA;QAAS;IACjC;AACF;AAYA,IAAMC,mBAAmB,IAAItG,IAAI;IAAC;IAAQ;IAAU;IAAS;CAAQ;AAErE,yFAAyF;AACzF,8FAA8F;AAC9F,IAAMuG,mBAAmB;AAEzB,SAASC,MAASC,KAAU,EAAErG,IAAY;IACxC,IAAMQ,MAAa,EAAE;IACrB,IAAK,IAAIf,IAAI,GAAGA,IAAI4G,MAAMhI,MAAM,EAAEoB,KAAKO,KAAMQ,IAAI1B,IAAI,CAACuH,MAAM/F,KAAK,CAACb,GAAGA,IAAIO;IACzE,OAAOQ;AACT;AAGO,SAASrD,QAAQ8D,EAAgB,EAAEc,GAAmB;IAC3D,IAAMuE,OAAOrF,GAAGG,OAAO,CAAC,iFAAiFC,GAAG;IAE5G,IAAMkF,UAAU,AAACtF,GAAGG,OAAO,CAAC,kCAAkCe,GAAG,GAA+BnE,GAAG,CAAC,SAACoE;eAAMA,EAAE0D,IAAI;OAAE1H,MAAM,CAAC,SAAC0H;eAAS,CAACI,iBAAiB7D,GAAG,CAACyD;;IAC1J,sFAAsF;IACtF,qFAAqF;IACrF,yEAAyE;IACzE,yFAAyF;IACzF,2FAA2F;IAC3F,+DAA+D;IAC/D,IAAMU,YAAmB,EAAE;QACtB,kCAAA,2BAAA;;;YAAA,IAAMC,QAAN;YACH,IAAMC,QAAQD,MAAMzI,GAAG,CAAC,SAAC8H,MAAMrG;gBAC7B,IAAMkH,SAAS,AAAC,IAA8B,OAA3Bb,KAAK/H,KAAK,CAAC,KAAK2H,IAAI,CAAC,OAAM;gBAC9C,OAAO,AAAC,SAAuBjG,OAAfkH,QAAO,UAA2CA,OAAnClH,GAAE,mCAA2DkH,OAA1BA,QAAO,qBAA8ClH,OAA3BkH,QAAO,sBAAsB,OAAFlH;YACzH;YACA,IAAMmH,SAAS3F,GAAGG,OAAO,CAAC,AAAC,UAA0B,OAAjBsF,MAAMhB,IAAI,CAAC,OAAM,sBAAoBrE,GAAG;YAC5EoF,MAAM/B,OAAO,CAAC,SAACoB,MAAMrG;oBAAgFmH;uBAA1EJ,UAAU1H,IAAI,CAAC;oBAAE+H,OAAOf;oBAAMgB,UAAUF,MAAM,CAAC,AAAC,IAAK,OAAFnH,GAAI;oBAAYsH,IAAI,GAAGH,WAAAA,MAAM,CAAC,AAAC,IAAK,OAAFnH,GAAI,cAAfmH,sBAAAA,WAA8B;gBAAG;;QACxI;QAPA,QAAK,YAAeR,MAAMG,SAASJ,sCAA9B,SAAA,6BAAA,QAAA,yBAAA;;QAAA;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAQLK,UAAUvH,IAAI,CAAC,SAACC,GAAGC;eAAM,AAACA,EAAE2H,QAAQ,GAAe5H,EAAE4H,QAAQ;;IAC7D,IAAME,SAASR,UAAUlG,KAAK,CAAC,GAAG;IAElC,IAAM2G,OAAOnC,IAAAA,wBAAc,EAAC/C,KAAK,UAAWd,GAAGG,OAAO,CAAC,oMAAoMe,GAAG,KAAe,EAAE;IAE/Q,IAAM+E,SAASjG,GAAGG,OAAO,CAAC,uHAAqHe,GAAG;IAElJ,OAAO;QAAEmE,MAAAA;QAAMU,QAAAA;QAAQG,aAAaX,UAAUnI,MAAM;QAAE+I,UAAUC,IAAAA,uBAAa,EAACtF;QAAMuF,SAASjK,eAAe4D,IAAIc;QAAMkF,MAAAA;QAAMC,QAAAA;IAAO;AACrI;AAoBA,IAAMK,kBAAkB;AAIjB,SAASnK,KAAK6D,EAAgB,EAAEc,GAAmB,EAAEyF,OAAe;QAkCnDrG;IAjCtB,IAAMsG,QAAQ,AAACxG,GAAGG,OAAO,CAAC,kCAAkCe,GAAG,GAA+BnE,GAAG,CAAC,SAACoE;eAAMA,EAAElB,IAAI;;IAC/G,IAAIA,OAAOuG,MAAMC,IAAI,CAAC,SAACxD;eAAMA,MAAMsD;;IACnC,IAAI,CAACtG,MAAM;QACT,IAAMyG,OAAOC,cAAK,CAACC,QAAQ,CAACL,SAAS1J,OAAO,CAAC,UAAU,IAAII,WAAW;QACtE,IAAM4J,UAAUL,MAAMrJ,MAAM,CAAC,SAAC8F;mBAAM0D,cAAK,CAACC,QAAQ,CAAC3D,GAAGpG,OAAO,CAAC,UAAU,IAAII,WAAW,OAAOyJ;;QAC9F,IAAIG,QAAQzJ,MAAM,KAAK,GAAG6C,OAAO4G,OAAO,CAAC,EAAE;aACtC,IAAIA,QAAQzJ,MAAM,GAAG,GAAG,MAAM,IAAI0J,oBAAU,CAAC,kBAAkB,AAAC,IAA6BD,OAA1BN,SAAQ,oBAAqC,OAAnBM,QAAQpC,IAAI,CAAC;aAC1G,MAAM,IAAIqC,oBAAU,CAAC,kBAAkB,AAAC,oBAA2B,OAARP,SAAQ;IAC1E;IAEA,IAAMrG,MAAMF,GAAGG,OAAO,CAAC,8CAA8CC,GAAG,CAACH;IACzE,IAAM8G,cAAmB,CAAC;QACrB,kCAAA,2BAAA;;QAAL,QAAK,YAAsBC,OAAOC,OAAO,CAAC/G,yBAArC,SAAA,6BAAA,QAAA,yBAAA,iCAA2C;YAA3C,mCAAA,iBAAOgH,sBAAKC;YACf,IAAI,CAAClC,iBAAiB7D,GAAG,CAAC8F,QAAQC,UAAU,MAAMJ,WAAW,CAACG,IAAI,GAAGC;QACvE;;QAFK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAIL,IAAMC,gBAAgBvD,IAAAA,wBAAc,EAAC/C,KAAK,cAAc,AAACd,GAAGG,OAAO,CAAC,uDAAuDC,GAAG,CAACH,MAAwB8E,CAAC,GAAG;IAC3J,IAAMsC,WAAWxD,IAAAA,wBAAc,EAAC/C,KAAK,cAAed,GAAGG,OAAO,CAAC,2GAA2Ge,GAAG,CAACjB,MAAMqG,mBAA6B,EAAE;IAEnN,IAAIgB,WAAqB,EAAE;IAC3B,IAAIC,YAAsB,EAAE;IAC5B,IAAIC,aAAuB,EAAE;IAC7B,IAAIC,iBAAiB;IACrB,IAAI5D,IAAAA,wBAAc,EAAC/C,KAAK,UAAU;QAChC,IAAMvB,MAAMS,GAAGG,OAAO,CAAC,+DAA+De,GAAG,CAACjB;QAC1FqH,WAAY,qBAAG,IAAI3I,IAAIY,IAAIpC,MAAM,CAAC,SAACuK;mBAAMA,EAAEC,GAAG,KAAK;WAAM5K,GAAG,CAAC,SAAC2K;mBAAMA,EAAEC,GAAG;;QACzEH,aAAajI,IAAIpC,MAAM,CAAC,SAACuK;mBAAMA,EAAEC,GAAG,KAAK;WAAM5K,GAAG,CAAC,SAAC2K;mBAAMA,EAAEE,MAAM;;QAClEH,iBAAiB,AAACzH,GAAGG,OAAO,CAAC,4DAA4DC,GAAG,CAACH,MAAwB8E,CAAC;QACtHwC,YAAY,AAACvH,GAAGG,OAAO,CAAC,qEAAqEe,GAAG,CAACjB,MAAMqG,iBAA4CvJ,GAAG,CAAC,SAACoE;mBAAMA,EAAE0G,GAAG;;IACrK;IAEA,OAAO;QACL5H,MAAAA;QACA6H,QAAQ5I,KAAK6I,IAAI,CAAC,EAAE7H,aAAAA,IAAI8H,KAAK,cAAT9H,wBAAAA,aAAwB,KAAK;QACjD6G,aAAAA;QACAM,UAAAA;QACAC,UAAUA,SAASjI,KAAK,CAAC,GAAGiH;QAC5BiB,WAAAA;QACAC,YAAYA,WAAWnI,KAAK,CAAC,GAAGiH;QAChCc,eAAAA;QACAa,eAAeX,SAASlK,MAAM;QAC9BqK,gBAAAA;QACAS,iBAAiBV,WAAWpK,MAAM;QAClC+K,KAAK,AAAC;YAAC;YAAY;SAAQ,CAAmBhL,MAAM,CAAC,SAAC0H;mBAAS,CAAChB,IAAAA,wBAAc,EAAC/C,KAAK+D;;IACtF;AACF"}