sensemaking 0.7.2 → 0.9.0

package/dist/esm/commands.js

@@ -0,0 +1,386 @@
+import { readFileSync } from 'node:fs';
+import { join, matchesGlob } from 'node:path';
+import posix from 'node:path/posix';
+import { anyPresetEmbeds, featureEnabled, featureStates, presetNames, resolveSearch } from './config.js';
+import { SenseError } from './errors.js';
+import { semanticCandidates } from './features/embed.js';
+import { linkEdges } from './features/index.js';
+import { personalizedRank } from './graph.js';
+import { searchError } from './search-error.js';
+// The three commands: mapTree (orient), search (locate), peek (structure).
+// Each returns data; cli.ts renders. All of them degrade when a feature is off.
+const WEIGHTED_BM25 = 'bm25(content, 10.0, 5.0, 1.0)';
+const RRF_K = 60;
+// 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.
+const SNIPPET_BOUND = 16384;
+const 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) {
+    const cleaned = query.replace(/"/g, ' ').replace(/[()*]/g, ' ').replace(/\b(AND|OR|NOT|NEAR)\b(\/\d+)?/gi, ' ');
+    return cleaned.split(/\s+/).map((tok)=>tok.replace(/^[A-Za-z_]\w*:/, '')) // column filter, e.g. title:term
+    .map((tok)=>tok.toLowerCase().trim()).filter((tok)=>tok.length > 0);
+}
+function findOccurrences(haystackLower, terms) {
+    const occ = [];
+    for (const term of terms){
+        let idx = 0;
+        for(;;){
+            const found = haystackLower.indexOf(term, idx);
+            if (found === -1) break;
+            occ.push({
+                start: found,
+                end: found + term.length,
+                term
+            });
+            idx = found + term.length;
+        }
+    }
+    // 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((a, b)=>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) {
+    let best = occ[0].start;
+    let bestDistinct = 0;
+    let bestCount = 0;
+    for(let i = 0; i < occ.length; i++){
+        const winEnd = occ[i].start + windowSize;
+        const seen = new Set();
+        let count = 0;
+        for(let 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) {
+    const 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.
+        const end = Math.min(text.length, EXCERPT_WINDOW);
+        return {
+            excerpt: `${text.slice(0, end).replace(/\s+/g, ' ').trim()}${end < text.length ? '…' : ''}`,
+            offset: 0
+        };
+    }
+    const start = bestWindowStart(occ, EXCERPT_WINDOW);
+    const end = Math.min(text.length, start + EXCERPT_WINDOW);
+    let out = '';
+    let cursor = start;
+    for (const o of occ){
+        if (o.start < start || o.end > end) 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 += `${text.slice(cursor, o.start)}«${text.slice(o.start, o.end)}»`;
+        cursor = o.end;
+    }
+    out += text.slice(cursor, end);
+    const prefix = start > 0 ? '…' : '';
+    const suffix = end < text.length ? '…' : '';
+    return {
+        excerpt: `${prefix}${out.replace(/\s+/g, ' ')}${suffix}`,
+        offset: start
+    };
+}
+function lineNumberAt(text, offset) {
+    let line = 1;
+    for(let i = 0; i < offset; i++)if (text.charCodeAt(i) === 10) line++;
+    return line;
+}
+function lineRangeFor(db, path, line) {
+    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);
+    return row ? `L${row.start_line}-${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((g)=>matchesGlob(path, g))) return false;
+    if (exclude === null || exclude === void 0 ? void 0 : exclude.some((g)=>matchesGlob(path, g))) return false;
+    return true;
+}
+function scopeHasEmbeddings(db, cfg, scopedPaths) {
+    if (!anyPresetEmbeds(cfg)) return false; // the embeddings table doesn't exist at all in this case
+    const rows = db.prepare('SELECT DISTINCT "path" FROM embeddings').all();
+    return rows.some((r)=>scopedPaths.has(r.path));
+}
+// BM25 + link-graph expansion, fused by reciprocal rank. `via` says which signal produced
+// each row so the agent knows what evidence it is trusting.
+// Resolution precedence (built-ins <- preset <- caller overrides) lives in
+// src/config.ts:resolveSearch; `opts` here is whatever the caller (a saved search merged
+// with any CLI flag, or a bare CLI invocation) already resolved.
+export async function search(db, cfg, terms, opts = {}) {
+    var _hits_get, _chunkLines_get, _chunkSimilarity_get;
+    const effective = resolveSearch(cfg, opts);
+    const { k, include, exclude } = effective;
+    const allPaths = db.prepare('SELECT "path" FROM frontmatter').all().map((r)=>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.
+    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).map((r)=>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.
+    const scopeActive = scopedPaths.size < allPaths.length;
+    const 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.
+    const 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 preset's declared where rather than ANDing with it,
+    // so a caller can always widen back to the whole scope.
+    const scope = effective.where;
+    const whereJoin = scope ? `JOIN frontmatter f ON f."path" = content.path` : '';
+    const whereCond = scope ? `AND (${scope})` : '';
+    // Docs past SNIPPET_BOUND skip snippet() entirely -- SQLite
+    // short-circuits the untaken CASE branch, so it's never invoked on them.
+    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}`;
+    let matchRows;
+    try {
+        matchRows = db.prepare(matchSql).all(terms);
+    } catch (err) {
+        throw 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((r)=>scopedPaths.has(r.path));
+    const hits = new Map(matchRows.map((r)=>[
+            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.
+    const oversized = new Set(matchRows.filter((r)=>r.hit === null).map((r)=>r.path));
+    const candidates = new Map();
+    matchRows.forEach((r, i)=>{
+        candidates.set(r.path, {
+            score: 1 / (RRF_K + i),
+            via: 'match'
+        });
+    });
+    const edges = featureEnabled(cfg, 'links') && matchRows.length > 0 ? linkEdges(db) : [];
+    if (edges.length > 0) {
+        // `linked` gates the label only, not the score: PPR restart mass gives every seed a
+        // nonzero rank even without an incident edge, which is not link evidence — but dropping
+        // 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).
+        const linked = new Set(edges.flat());
+        const seeds = new Map(matchRows.map((r, i)=>[
+                r.path,
+                1 / (i + 1)
+            ]));
+        const ranked = [
+            ...personalizedRank(allPaths, edges, seeds)
+        ].filter(([path, score])=>score > 1e-9 && scopedPaths.has(path)).sort((a, b)=>b[1] - a[1]).slice(0, fetch);
+        ranked.forEach(([path], i)=>{
+            const existing = candidates.get(path);
+            if (existing) {
+                existing.score += 1 / (RRF_K + i);
+                if (linked.has(path)) existing.via = 'match+link';
+            } else {
+                candidates.set(path, {
+                    score: 1 / (RRF_K + i),
+                    via: 'link'
+                });
+            }
+        });
+    }
+    // Vector expansion, invoked only: a third RRF list at the swept flat-region constants
+    // (weight 1, pool = fetch). Each row carries its best chunk's line range.
+    const chunkLines = new Map();
+    const chunkSimilarity = new Map();
+    if (semanticEnabled) {
+        const vec = (await semanticCandidates(db, cfg, terms, fetch)).filter((v)=>scopedPaths.has(v.path));
+        vec.forEach(({ path, lines, similarity }, i)=>{
+            chunkLines.set(path, lines);
+            chunkSimilarity.set(path, similarity);
+            const existing = candidates.get(path);
+            if (existing) {
+                existing.score += 1 / (RRF_K + i);
+                existing.via = `${existing.via}+vector`;
+            } else {
+                candidates.set(path, {
+                    score: 1 / (RRF_K + i),
+                    via: 'vector'
+                });
+            }
+        });
+    }
+    db.exec('DROP TABLE IF EXISTS _find');
+    db.exec('CREATE TEMP TABLE _find ("path" TEXT PRIMARY KEY, score REAL, via TEXT, hit TEXT, lines TEXT, similarity REAL)');
+    const insert = db.prepare('INSERT INTO _find ("path", score, via, hit, lines, similarity) VALUES (?, ?, ?, ?, ?, ?)');
+    for (const [path, c] of candidates)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);
+    // 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).
+    const where = scope ? `WHERE (${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.
+    const similarityCol = semanticEnabled ? ', _find.similarity' : '';
+    const rows = db.prepare(`SELECT f."path" AS path, content.title, content.summary, _find.hit, _find.via, round(_find.score, 4) AS score, _find.lines${similarityCol}
+       FROM _find JOIN frontmatter f ON f."path" = _find."path" JOIN content ON content.path = _find."path"
+       ${where} ORDER BY _find.score DESC LIMIT ?`).all(k);
+    if (oversized.size > 0) {
+        const bareTerms = extractBareTerms(terms);
+        for (const row of rows){
+            if (row.hit !== null || !oversized.has(row.path)) continue;
+            let text;
+            try {
+                text = readFileSync(join(cfg.baseDir, row.path), 'utf8');
+            } catch  {
+                continue; // vanished since the match; leave hit/lines null rather than throw
+            }
+            const { excerpt, offset } = computeExcerpt(text, bareTerms);
+            row.hit = excerpt;
+            if (row.lines == null) row.lines = featureEnabled(cfg, 'sections') ? lineRangeFor(db, row.path, lineNumberAt(text, offset)) : null;
+        }
+    }
+    return rows;
+}
+// Indexing and embedding are both derived from presets rather than declared directly, so
+// that derivation must stay visible: how many files each preset actually matched, and how
+// many of those are covered by embedding. Read from preset_files (rebuilt at reconcile), not
+// recomputed from globs, so this always reflects what's actually on disk in the cache.
+export function presetCoverage(db, cfg) {
+    const embedActive = anyPresetEmbeds(cfg);
+    return presetNames(cfg).map((name)=>{
+        const files = db.prepare('SELECT COUNT(*) AS n FROM preset_files WHERE preset = ?').get(name).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).n : 0;
+        return {
+            name,
+            files,
+            embedded
+        };
+    });
+}
+const 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.
+const MAP_COLUMN_CHUNK = 300;
+function chunk(items, size) {
+    const out = [];
+    for(let i = 0; i < items.length; i += size)out.push(items.slice(i, i + size));
+    return out;
+}
+// mapTree: what is this tree. Fixed-size output regardless of tree size.
+export function mapTree(db, cfg) {
+    const docs = db.prepare('SELECT COUNT(*) AS count, COALESCE(SUM("_size"), 0) AS bytes FROM frontmatter').get();
+    const columns = db.prepare('PRAGMA table_info(frontmatter)').all().map((r)=>r.name).filter((name)=>!INTERNAL_COLUMNS.has(name));
+    // 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.
+    const allFields = [];
+    for (const group of chunk(columns, MAP_COLUMN_CHUNK)){
+        const exprs = group.map((name, i)=>{
+            const quoted = `"${name.split('"').join('""')}"`;
+            return `COUNT(${quoted}) AS n${i}, GROUP_CONCAT(DISTINCT typeof(${quoted})) FILTER (WHERE ${quoted} IS NOT NULL) AS t${i}`;
+        });
+        const result = db.prepare(`SELECT ${exprs.join(', ')} FROM frontmatter`).get();
+        group.forEach((name, i)=>{
+            var _result_;
+            return allFields.push({
+                field: name,
+                coverage: result[`n${i}`],
+                type: (_result_ = result[`t${i}`]) !== null && _result_ !== void 0 ? _result_ : ''
+            });
+        });
+    }
+    allFields.sort((a, b)=>b.coverage - a.coverage);
+    const fields = allFields.slice(0, 20);
+    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() : [];
+    const recent = db.prepare(`SELECT "path", datetime("_mtime" / 1000, 'unixepoch') AS modified FROM frontmatter ORDER BY "_mtime" DESC LIMIT 5`).all();
+    return {
+        docs,
+        fields,
+        fieldsTotal: allFields.length,
+        features: featureStates(cfg),
+        presets: presetCoverage(db, cfg),
+        hubs,
+        recent
+    };
+}
+const PEEK_LIST_LIMIT = 20;
+// peek: everything about one note except its prose -- frontmatter, outline with line
+// ranges + token estimates (so the follow-up Read is a range, not the file), links both ways.
+export function peek(db, cfg, pathArg) {
+    var _row__size;
+    const paths = db.prepare('SELECT "path" FROM frontmatter').all().map((r)=>r.path);
+    let path = paths.find((p)=>p === pathArg);
+    if (!path) {
+        const base = posix.basename(pathArg).replace(/\.md$/i, '').toLowerCase();
+        const matches = paths.filter((p)=>posix.basename(p).replace(/\.md$/i, '').toLowerCase() === base);
+        if (matches.length === 1) path = matches[0];
+        else if (matches.length > 1) throw new SenseError('NOTE_AMBIGUOUS', `"${pathArg}" is ambiguous: ${matches.join(', ')}`);
+        else throw new SenseError('NOTE_NOT_FOUND', `no note matches "${pathArg}"`);
+    }
+    const row = db.prepare('SELECT * FROM frontmatter WHERE "path" = ?').get(path);
+    const frontmatter = {};
+    for (const [key, value] of Object.entries(row)){
+        if (!INTERNAL_COLUMNS.has(key) && value !== null) frontmatter[key] = value;
+    }
+    const sectionsTotal = featureEnabled(cfg, 'sections') ? db.prepare('SELECT COUNT(*) AS n FROM sections WHERE "path" = ?').get(path).n : 0;
+    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) : [];
+    let outbound = [];
+    let backlinks = [];
+    let unresolved = [];
+    let backlinksTotal = 0;
+    if (featureEnabled(cfg, 'links')) {
+        const out = db.prepare('SELECT target, dst FROM links WHERE src = ? ORDER BY target').all(path);
+        outbound = [
+            ...new Set(out.filter((l)=>l.dst !== null).map((l)=>l.dst))
+        ];
+        unresolved = out.filter((l)=>l.dst === null).map((l)=>l.target);
+        backlinksTotal = db.prepare('SELECT COUNT(DISTINCT src) AS n FROM links WHERE dst = ?').get(path).n;
+        backlinks = db.prepare('SELECT DISTINCT src FROM links WHERE dst = ? ORDER BY src LIMIT ?').all(path, PEEK_LIST_LIMIT).map((r)=>r.src);
+    }
+    return {
+        path,
+        tokens: Math.ceil(((_row__size = row._size) !== null && _row__size !== void 0 ? _row__size : 0) / 4),
+        frontmatter,
+        sections,
+        outbound: outbound.slice(0, PEEK_LIST_LIMIT),
+        backlinks,
+        unresolved: unresolved.slice(0, PEEK_LIST_LIMIT),
+        sectionsTotal,
+        outboundTotal: outbound.length,
+        backlinksTotal,
+        unresolvedTotal: unresolved.length,
+        off: [
+            'sections',
+            'links'
+        ].filter((name)=>!featureEnabled(cfg, name))
+    };
+}

package/dist/esm/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":["readFileSync","join","matchesGlob","posix","anyPresetEmbeds","featureEnabled","featureStates","presetNames","resolveSearch","SenseError","semanticCandidates","linkEdges","personalizedRank","searchError","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","scopeHasEmbeddings","cfg","scopedPaths","rows","all","r","has","search","opts","hits","chunkLines","chunkSimilarity","effective","k","allPaths","p","presetName","scopeActive","fetch","max","semanticEnabled","semantic","scope","where","whereJoin","whereCond","matchSql","matchRows","err","Map","hit","oversized","candidates","forEach","set","score","via","edges","linked","flat","seeds","ranked","existing","vec","v","lines","similarity","exec","insert","c","run","similarityCol","bareTerms","baseDir","presetCoverage","embedActive","name","files","n","embedded","INTERNAL_COLUMNS","MAP_COLUMN_CHUNK","chunk","items","mapTree","docs","columns","allFields","group","exprs","quoted","result","field","coverage","type","fields","hubs","recent","fieldsTotal","features","presets","PEEK_LIST_LIMIT","peek","pathArg","paths","find","base","basename","matches","frontmatter","key","value","Object","entries","sectionsTotal","sections","outbound","backlinks","unresolved","backlinksTotal","l","dst","target","src","tokens","ceil","_size","outboundTotal","unresolvedTotal","off"],"mappings":"AAAA,SAASA,YAAY,QAAQ,UAAU;AACvC,SAASC,IAAI,EAAEC,WAAW,QAAQ,YAAY;AAC9C,OAAOC,WAAW,kBAAkB;AAGpC,SAASC,eAAe,EAAEC,cAAc,EAAEC,aAAa,EAAEC,WAAW,EAAEC,aAAa,QAAQ,cAAc;AACzG,SAASC,UAAU,QAAQ,cAAc;AACzC,SAASC,kBAAkB,QAAQ,sBAAsB;AACzD,SAASC,SAAS,QAAQ,sBAAsB;AAChD,SAASC,gBAAgB,QAAQ,aAAa;AAE9C,SAASC,WAAW,QAAQ,oBAAoB;AAEhD,2EAA2E;AAC3E,gFAAgF;AAEhF,MAAMC,gBAAgB;AACtB,MAAMC,QAAQ;AAEd,uFAAuF;AACvF,wFAAwF;AACxF,yFAAyF;AACzF,0FAA0F;AAC1F,qBAAqB;AACrB,MAAMC,gBAAgB;AACtB,MAAMC,iBAAiB;AAEvB,8FAA8F;AAC9F,qEAAqE;AACrE,SAASC,iBAAiBC,KAAa;IACrC,MAAMC,UAAUD,MACbE,OAAO,CAAC,MAAM,KACdA,OAAO,CAAC,UAAU,KAClBA,OAAO,CAAC,mCAAmC;IAC9C,OAAOD,QACJE,KAAK,CAAC,OACNC,GAAG,CAAC,CAACC,MAAQA,IAAIH,OAAO,CAAC,kBAAkB,KAAK,iCAAiC;KACjFE,GAAG,CAAC,CAACC,MAAQA,IAAIC,WAAW,GAAGC,IAAI,IACnCC,MAAM,CAAC,CAACH,MAAQA,IAAII,MAAM,GAAG;AAClC;AAEA,SAASC,gBAAgBC,aAAqB,EAAEC,KAAe;IAC7D,MAAMC,MAA2D,EAAE;IACnE,KAAK,MAAMC,QAAQF,MAAO;QACxB,IAAIG,MAAM;QACV,OAAS;YACP,MAAMC,QAAQL,cAAcM,OAAO,CAACH,MAAMC;YAC1C,IAAIC,UAAU,CAAC,GAAG;YAClBH,IAAIK,IAAI,CAAC;gBAAEC,OAAOH;gBAAOI,KAAKJ,QAAQF,KAAKL,MAAM;gBAAEK;YAAK;YACxDC,MAAMC,QAAQF,KAAKL,MAAM;QAC3B;IACF;IACA,mFAAmF;IACnF,+EAA+E;IAC/E,OAAOI,IAAIQ,IAAI,CAAC,CAACC,GAAGC,IAAMD,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,MAAMC,SAASjB,GAAG,CAACgB,EAAE,CAACV,KAAK,GAAGM;QAC9B,MAAMM,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,MAAMC,MAAMH,gBAAgB4B,KAAKhC,WAAW,IAAIM;IAChD,IAAIC,IAAIJ,MAAM,KAAK,GAAG;QACpB,iFAAiF;QACjF,qFAAqF;QACrF,sFAAsF;QACtF,MAAMW,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEX;QAClC,OAAO;YAAE2C,SAAS,GAAGH,KAAKI,KAAK,CAAC,GAAGtB,KAAKlB,OAAO,CAAC,QAAQ,KAAKK,IAAI,KAAKa,MAAMkB,KAAK7B,MAAM,GAAG,MAAM,IAAI;YAAEkC,QAAQ;QAAE;IAClH;IACA,MAAMxB,QAAQK,gBAAgBX,KAAKf;IACnC,MAAMsB,MAAMmB,KAAKC,GAAG,CAACF,KAAK7B,MAAM,EAAEU,QAAQrB;IAC1C,IAAI8C,MAAM;IACV,IAAIC,SAAS1B;IACb,KAAK,MAAM2B,KAAKjC,IAAK;QACnB,IAAIiC,EAAE3B,KAAK,GAAGA,SAAS2B,EAAE1B,GAAG,GAAGA,KAAK;QACpC,sFAAsF;QACtF,gFAAgF;QAChF,IAAI0B,EAAE3B,KAAK,GAAG0B,QAAQ;QACtBD,OAAO,GAAGN,KAAKI,KAAK,CAACG,QAAQC,EAAE3B,KAAK,EAAE,CAAC,EAAEmB,KAAKI,KAAK,CAACI,EAAE3B,KAAK,EAAE2B,EAAE1B,GAAG,EAAE,CAAC,CAAC;QACtEyB,SAASC,EAAE1B,GAAG;IAChB;IACAwB,OAAON,KAAKI,KAAK,CAACG,QAAQzB;IAC1B,MAAM2B,SAAS5B,QAAQ,IAAI,MAAM;IACjC,MAAM6B,SAAS5B,MAAMkB,KAAK7B,MAAM,GAAG,MAAM;IACzC,OAAO;QAAEgC,SAAS,GAAGM,SAASH,IAAI1C,OAAO,CAAC,QAAQ,OAAO8C,QAAQ;QAAEL,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,MAAMK,MAAMF,GAAGG,OAAO,CAAC,qIAAqIC,GAAG,CAACH,MAAMJ,MAAMA;IAC5K,OAAOK,MAAM,CAAC,CAAC,EAAEA,IAAIG,UAAU,CAAC,CAAC,EAAEH,IAAII,QAAQ,EAAE,GAAG;AACtD;AAUA,yFAAyF;AACzF,4FAA4F;AAC5F,2FAA2F;AAC3F,SAASC,QAAQN,IAAY,EAAEO,OAAiB,EAAEC,OAAkB;IAClE,IAAI,CAACD,QAAQE,IAAI,CAAC,CAACC,IAAMjF,YAAYuE,MAAMU,KAAK,OAAO;IACvD,IAAIF,oBAAAA,8BAAAA,QAASC,IAAI,CAAC,CAACC,IAAMjF,YAAYuE,MAAMU,KAAK,OAAO;IACvD,OAAO;AACT;AAEA,SAASC,mBAAmBZ,EAAgB,EAAEa,GAAmB,EAAEC,WAAwB;IACzF,IAAI,CAAClF,gBAAgBiF,MAAM,OAAO,OAAO,yDAAyD;IAClG,MAAME,OAAOf,GAAGG,OAAO,CAAC,0CAA0Ca,GAAG;IACrE,OAAOD,KAAKL,IAAI,CAAC,CAACO,IAAMH,YAAYI,GAAG,CAACD,EAAEhB,IAAI;AAChD;AAEA,0FAA0F;AAC1F,4DAA4D;AAC5D,2EAA2E;AAC3E,yFAAyF;AACzF,iEAAiE;AACjE,OAAO,eAAekB,OAAOnB,EAAgB,EAAEa,GAAmB,EAAEtD,KAAa,EAAE6D,OAAsB,CAAC,CAAC;QAkGpCC,WAAwBC,iBAA8BC;IAjG3H,MAAMC,YAAYxF,cAAc6E,KAAKO;IACrC,MAAM,EAAEK,CAAC,EAAEjB,OAAO,EAAEC,OAAO,EAAE,GAAGe;IAEhC,MAAME,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAClH,oFAAoF;IACpF,mFAAmF;IACnF,sFAAsF;IACtF,+BAA+B;IAC/B,MAAMa,cAAcM,KAAKZ,OAAO,GAAG,IAAI7B,IAAI+C,SAASvE,MAAM,CAAC,CAACwE,IAAMpB,QAAQoB,GAAGnB,SAASC,aAAa,IAAI9B,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDa,GAAG,CAACQ,UAAUI,UAAU,EAA8B7E,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAClP,2FAA2F;IAC3F,2FAA2F;IAC3F,sDAAsD;IACtD,MAAM4B,cAAcf,YAAY/B,IAAI,GAAG2C,SAAStE,MAAM;IACtD,MAAM0E,QAAQD,cAAc3C,KAAK6C,GAAG,CAACN,IAAI,GAAG,MAAMvC,KAAK6C,GAAG,CAACN,IAAI,GAAG;IAElE,wFAAwF;IACxF,0FAA0F;IAC1F,8EAA8E;IAC9E,MAAMO,kBAAkBR,UAAUS,QAAQ,IAAIrB,mBAAmBZ,IAAIa,KAAKC;IAE1E,sFAAsF;IACtF,yFAAyF;IACzF,sFAAsF;IACtF,qFAAqF;IACrF,uFAAuF;IACvF,wDAAwD;IACxD,MAAMoB,QAAQV,UAAUW,KAAK;IAC7B,MAAMC,YAAYF,QAAQ,CAAC,6CAA6C,CAAC,GAAG;IAC5E,MAAMG,YAAYH,QAAQ,CAAC,KAAK,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC7C,4DAA4D;IAC5D,yEAAyE;IACzE,MAAMI,WAAW,CAAC,+DAA+D,EAAE9F,cAAc,gFAAgF,EAAE4F,UAAU,uBAAuB,EAAEC,UAAU,UAAU,EAAE/F,cAAc,OAAO,EAAEwF,OAAO;IAC1Q,IAAIS;IACJ,IAAI;QACFA,YAAYvC,GAAGG,OAAO,CAACmC,UAAUtB,GAAG,CAACzD;IACvC,EAAE,OAAOiF,KAAK;QACZ,MAAMnG,YAAYmG,KAAcjF,OAAO2E;IACzC;IACA,yFAAyF;IACzF,2FAA2F;IAC3F,mFAAmF;IACnFK,YAAYA,UAAUpF,MAAM,CAAC,CAAC8D,IAAMH,YAAYI,GAAG,CAACD,EAAEhB,IAAI;IAE1D,MAAMoB,OAAO,IAAIoB,IAAIF,UAAUxF,GAAG,CAAC,CAACkE,IAAM;YAACA,EAAEhB,IAAI;YAAEgB,EAAEyB,GAAG;SAAC;IACzD,wFAAwF;IACxF,4EAA4E;IAC5E,MAAMC,YAAY,IAAIhE,IAAI4D,UAAUpF,MAAM,CAAC,CAAC8D,IAAMA,EAAEyB,GAAG,KAAK,MAAM3F,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACnF,MAAM2C,aAAa,IAAIH;IACvBF,UAAUM,OAAO,CAAC,CAAC5B,GAAGzC;QACpBoE,WAAWE,GAAG,CAAC7B,EAAEhB,IAAI,EAAE;YAAE8C,OAAO,IAAKxG,CAAAA,QAAQiC,CAAAA;YAAIwE,KAAK;QAAQ;IAChE;IAEA,MAAMC,QAAQpH,eAAegF,KAAK,YAAY0B,UAAUnF,MAAM,GAAG,IAAIjB,UAAU6D,MAAM,EAAE;IACvF,IAAIiD,MAAM7F,MAAM,GAAG,GAAG;QACpB,oFAAoF;QACpF,wFAAwF;QACxF,oFAAoF;QACpF,wFAAwF;QACxF,MAAM8F,SAAS,IAAIvE,IAAIsE,MAAME,IAAI;QACjC,MAAMC,QAAQ,IAAIX,IAAIF,UAAUxF,GAAG,CAAC,CAACkE,GAAGzC,IAAM;gBAACyC,EAAEhB,IAAI;gBAAE,IAAKzB,CAAAA,IAAI,CAAA;aAAG;QACnE,MAAM6E,SAAS;eAAIjH,iBAAiBsF,UAAUuB,OAAOG;SAAO,CACzDjG,MAAM,CAAC,CAAC,CAAC8C,MAAM8C,MAAM,GAAKA,QAAQ,QAAQjC,YAAYI,GAAG,CAACjB,OAC1DjC,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,EAC1BoB,KAAK,CAAC,GAAGyC;QACZuB,OAAOR,OAAO,CAAC,CAAC,CAAC5C,KAAK,EAAEzB;YACtB,MAAM8E,WAAWV,WAAWxC,GAAG,CAACH;YAChC,IAAIqD,UAAU;gBACZA,SAASP,KAAK,IAAI,IAAKxG,CAAAA,QAAQiC,CAAAA;gBAC/B,IAAI0E,OAAOhC,GAAG,CAACjB,OAAOqD,SAASN,GAAG,GAAG;YACvC,OAAO;gBACLJ,WAAWE,GAAG,CAAC7C,MAAM;oBAAE8C,OAAO,IAAKxG,CAAAA,QAAQiC,CAAAA;oBAAIwE,KAAK;gBAAO;YAC7D;QACF;IACF;IAEA,sFAAsF;IACtF,0EAA0E;IAC1E,MAAM1B,aAAa,IAAImB;IACvB,MAAMlB,kBAAkB,IAAIkB;IAC5B,IAAIT,iBAAiB;QACnB,MAAMuB,MAAM,AAAC,CAAA,MAAMrH,mBAAmB8D,IAAIa,KAAKtD,OAAOuE,MAAK,EAAG3E,MAAM,CAAC,CAACqG,IAAM1C,YAAYI,GAAG,CAACsC,EAAEvD,IAAI;QAClGsD,IAAIV,OAAO,CAAC,CAAC,EAAE5C,IAAI,EAAEwD,KAAK,EAAEC,UAAU,EAAE,EAAElF;YACxC8C,WAAWwB,GAAG,CAAC7C,MAAMwD;YACrBlC,gBAAgBuB,GAAG,CAAC7C,MAAMyD;YAC1B,MAAMJ,WAAWV,WAAWxC,GAAG,CAACH;YAChC,IAAIqD,UAAU;gBACZA,SAASP,KAAK,IAAI,IAAKxG,CAAAA,QAAQiC,CAAAA;gBAC/B8E,SAASN,GAAG,GAAG,GAAGM,SAASN,GAAG,CAAC,OAAO,CAAC;YACzC,OAAO;gBACLJ,WAAWE,GAAG,CAAC7C,MAAM;oBAAE8C,OAAO,IAAKxG,CAAAA,QAAQiC,CAAAA;oBAAIwE,KAAK;gBAAS;YAC/D;QACF;IACF;IAEAhD,GAAG2D,IAAI,CAAC;IACR3D,GAAG2D,IAAI,CAAC;IACR,MAAMC,SAAS5D,GAAGG,OAAO,CAAC;IAC1B,KAAK,MAAM,CAACF,MAAM4D,EAAE,IAAIjB,WAAYgB,OAAOE,GAAG,CAAC7D,MAAM4D,EAAEd,KAAK,EAAEc,EAAEb,GAAG,GAAE3B,YAAAA,KAAKjB,GAAG,CAACH,mBAAToB,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWlB,GAAG,CAACH,mBAAfqB,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBnB,GAAG,CAACH,mBAApBsB,kCAAAA,uBAA6B;IAExJ,2FAA2F;IAC3F,uFAAuF;IACvF,uFAAuF;IACvF,oBAAoB;IACpB,MAAMY,QAAQD,QAAQ,CAAC,OAAO,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC3C,sFAAsF;IACtF,2FAA2F;IAC3F,MAAM6B,gBAAgB/B,kBAAkB,uBAAuB;IAC/D,MAAMjB,OAAOf,GACVG,OAAO,CACN,CAAC,0HAA0H,EAAE4D,cAAc;;OAE1I,EAAE5B,MAAM,kCAAkC,CAAC,EAE7CnB,GAAG,CAACS;IAEP,IAAIkB,UAAU5D,IAAI,GAAG,GAAG;QACtB,MAAMiF,YAAYtH,iBAAiBa;QACnC,KAAK,MAAM2C,OAAOa,KAAM;YACtB,IAAIb,IAAIwC,GAAG,KAAK,QAAQ,CAACC,UAAUzB,GAAG,CAAChB,IAAID,IAAI,GAAa;YAC5D,IAAIhB;YACJ,IAAI;gBACFA,OAAOzD,aAAaC,KAAKoF,IAAIoD,OAAO,EAAE/D,IAAID,IAAI,GAAa;YAC7D,EAAE,OAAM;gBACN,UAAU,mEAAmE;YAC/E;YACA,MAAM,EAAEb,OAAO,EAAEE,MAAM,EAAE,GAAGN,eAAeC,MAAM+E;YACjD9D,IAAIwC,GAAG,GAAGtD;YACV,IAAIc,IAAIuD,KAAK,IAAI,MAAMvD,IAAIuD,KAAK,GAAG5H,eAAegF,KAAK,cAAcd,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;QAC1I;IACF;IAEA,OAAOyB;AACT;AAQA,yFAAyF;AACzF,0FAA0F;AAC1F,6FAA6F;AAC7F,uFAAuF;AACvF,OAAO,SAASmD,eAAelE,EAAgB,EAAEa,GAAmB;IAClE,MAAMsD,cAAcvI,gBAAgBiF;IACpC,OAAO9E,YAAY8E,KAAK9D,GAAG,CAAC,CAACqH;QAC3B,MAAMC,QAAQ,AAACrE,GAAGG,OAAO,CAAC,2DAA2DC,GAAG,CAACgE,MAAwBE,CAAC;QAClH,MAAMC,WAAWJ,cAAc,AAACnE,GAAGG,OAAO,CAAC,6JAA6JC,GAAG,CAACgE,MAAwBE,CAAC,GAAG;QACxO,OAAO;YAAEF;YAAMC;YAAOE;QAAS;IACjC;AACF;AAYA,MAAMC,mBAAmB,IAAI7F,IAAI;IAAC;IAAQ;IAAU;IAAS;CAAQ;AAErE,yFAAyF;AACzF,8FAA8F;AAC9F,MAAM8F,mBAAmB;AAEzB,SAASC,MAASC,KAAU,EAAE5F,IAAY;IACxC,MAAMQ,MAAa,EAAE;IACrB,IAAK,IAAIf,IAAI,GAAGA,IAAImG,MAAMvH,MAAM,EAAEoB,KAAKO,KAAMQ,IAAI1B,IAAI,CAAC8G,MAAMtF,KAAK,CAACb,GAAGA,IAAIO;IACzE,OAAOQ;AACT;AAEA,yEAAyE;AACzE,OAAO,SAASqF,QAAQ5E,EAAgB,EAAEa,GAAmB;IAC3D,MAAMgE,OAAO7E,GAAGG,OAAO,CAAC,iFAAiFC,GAAG;IAE5G,MAAM0E,UAAU,AAAC9E,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEmD,IAAI,EAAEjH,MAAM,CAAC,CAACiH,OAAS,CAACI,iBAAiBtD,GAAG,CAACkD;IAC1J,sFAAsF;IACtF,qFAAqF;IACrF,yEAAyE;IACzE,yFAAyF;IACzF,2FAA2F;IAC3F,+DAA+D;IAC/D,MAAMW,YAAmB,EAAE;IAC3B,KAAK,MAAMC,SAASN,MAAMI,SAASL,kBAAmB;QACpD,MAAMQ,QAAQD,MAAMjI,GAAG,CAAC,CAACqH,MAAM5F;YAC7B,MAAM0G,SAAS,CAAC,CAAC,EAAEd,KAAKtH,KAAK,CAAC,KAAKrB,IAAI,CAAC,MAAM,CAAC,CAAC;YAChD,OAAO,CAAC,MAAM,EAAEyJ,OAAO,MAAM,EAAE1G,EAAE,+BAA+B,EAAE0G,OAAO,iBAAiB,EAAEA,OAAO,kBAAkB,EAAE1G,GAAG;QAC5H;QACA,MAAM2G,SAASnF,GAAGG,OAAO,CAAC,CAAC,OAAO,EAAE8E,MAAMxJ,IAAI,CAAC,MAAM,iBAAiB,CAAC,EAAE2E,GAAG;QAC5E4E,MAAMnC,OAAO,CAAC,CAACuB,MAAM5F;gBAAgF2G;mBAA1EJ,UAAUlH,IAAI,CAAC;gBAAEuH,OAAOhB;gBAAMiB,UAAUF,MAAM,CAAC,CAAC,CAAC,EAAE3G,GAAG,CAAC;gBAAY8G,IAAI,GAAGH,WAAAA,MAAM,CAAC,CAAC,CAAC,EAAE3G,GAAG,CAAC,cAAf2G,sBAAAA,WAA8B;YAAG;;IACxI;IACAJ,UAAU/G,IAAI,CAAC,CAACC,GAAGC,IAAM,AAACA,EAAEmH,QAAQ,GAAepH,EAAEoH,QAAQ;IAC7D,MAAME,SAASR,UAAU1F,KAAK,CAAC,GAAG;IAElC,MAAMmG,OAAO3J,eAAegF,KAAK,UAAWb,GAAGG,OAAO,CAAC,CAAC,gMAAgM,CAAC,EAAEa,GAAG,KAAe,EAAE;IAE/Q,MAAMyE,SAASzF,GAAGG,OAAO,CAAC,CAAC,iHAAiH,CAAC,EAAEa,GAAG;IAElJ,OAAO;QAAE6D;QAAMU;QAAQG,aAAaX,UAAU3H,MAAM;QAAEuI,UAAU7J,cAAc+E;QAAM+E,SAAS1B,eAAelE,IAAIa;QAAM2E;QAAMC;IAAO;AACrI;AAoBA,MAAMI,kBAAkB;AAExB,qFAAqF;AACrF,8FAA8F;AAC9F,OAAO,SAASC,KAAK9F,EAAgB,EAAEa,GAAmB,EAAEkF,OAAe;QAkCnD7F;IAjCtB,MAAM8F,QAAQ,AAAChG,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC/G,IAAIA,OAAO+F,MAAMC,IAAI,CAAC,CAACtE,IAAMA,MAAMoE;IACnC,IAAI,CAAC9F,MAAM;QACT,MAAMiG,OAAOvK,MAAMwK,QAAQ,CAACJ,SAASlJ,OAAO,CAAC,UAAU,IAAII,WAAW;QACtE,MAAMmJ,UAAUJ,MAAM7I,MAAM,CAAC,CAACwE,IAAMhG,MAAMwK,QAAQ,CAACxE,GAAG9E,OAAO,CAAC,UAAU,IAAII,WAAW,OAAOiJ;QAC9F,IAAIE,QAAQhJ,MAAM,KAAK,GAAG6C,OAAOmG,OAAO,CAAC,EAAE;aACtC,IAAIA,QAAQhJ,MAAM,GAAG,GAAG,MAAM,IAAInB,WAAW,kBAAkB,CAAC,CAAC,EAAE8J,QAAQ,gBAAgB,EAAEK,QAAQ3K,IAAI,CAAC,OAAO;aACjH,MAAM,IAAIQ,WAAW,kBAAkB,CAAC,iBAAiB,EAAE8J,QAAQ,CAAC,CAAC;IAC5E;IAEA,MAAM7F,MAAMF,GAAGG,OAAO,CAAC,8CAA8CC,GAAG,CAACH;IACzE,MAAMoG,cAAmB,CAAC;IAC1B,KAAK,MAAM,CAACC,KAAKC,MAAM,IAAIC,OAAOC,OAAO,CAACvG,KAAM;QAC9C,IAAI,CAACsE,iBAAiBtD,GAAG,CAACoF,QAAQC,UAAU,MAAMF,WAAW,CAACC,IAAI,GAAGC;IACvE;IAEA,MAAMG,gBAAgB7K,eAAegF,KAAK,cAAc,AAACb,GAAGG,OAAO,CAAC,uDAAuDC,GAAG,CAACH,MAAwBqE,CAAC,GAAG;IAC3J,MAAMqC,WAAW9K,eAAegF,KAAK,cAAeb,GAAGG,OAAO,CAAC,2GAA2Ga,GAAG,CAACf,MAAM4F,mBAA6B,EAAE;IAEnN,IAAIe,WAAqB,EAAE;IAC3B,IAAIC,YAAsB,EAAE;IAC5B,IAAIC,aAAuB,EAAE;IAC7B,IAAIC,iBAAiB;IACrB,IAAIlL,eAAegF,KAAK,UAAU;QAChC,MAAMtB,MAAMS,GAAGG,OAAO,CAAC,+DAA+Da,GAAG,CAACf;QAC1F2G,WAAW;eAAI,IAAIjI,IAAIY,IAAIpC,MAAM,CAAC,CAAC6J,IAAMA,EAAEC,GAAG,KAAK,MAAMlK,GAAG,CAAC,CAACiK,IAAMA,EAAEC,GAAG;SAAa;QACtFH,aAAavH,IAAIpC,MAAM,CAAC,CAAC6J,IAAMA,EAAEC,GAAG,KAAK,MAAMlK,GAAG,CAAC,CAACiK,IAAMA,EAAEE,MAAM;QAClEH,iBAAiB,AAAC/G,GAAGG,OAAO,CAAC,4DAA4DC,GAAG,CAACH,MAAwBqE,CAAC;QACtHuC,YAAY,AAAC7G,GAAGG,OAAO,CAAC,qEAAqEa,GAAG,CAACf,MAAM4F,iBAA4C9I,GAAG,CAAC,CAACkE,IAAMA,EAAEkG,GAAG;IACrK;IAEA,OAAO;QACLlH;QACAmH,QAAQlI,KAAKmI,IAAI,CAAC,EAAEnH,aAAAA,IAAIoH,KAAK,cAATpH,wBAAAA,aAAwB,KAAK;QACjDmG;QACAM;QACAC,UAAUA,SAASvH,KAAK,CAAC,GAAGwG;QAC5BgB;QACAC,YAAYA,WAAWzH,KAAK,CAAC,GAAGwG;QAChCa;QACAa,eAAeX,SAASxJ,MAAM;QAC9B2J;QACAS,iBAAiBV,WAAW1J,MAAM;QAClCqK,KAAK,AAAC;YAAC;YAAY;SAAQ,CAAmBtK,MAAM,CAAC,CAACiH,OAAS,CAACvI,eAAegF,KAAKuD;IACtF;AACF"}

package/dist/esm/config.d.ts

@@ -1,6 +1,6 @@
 export declare const CONFIG_FILENAME = "sense.config.json";
 export declare const STATE_DIR = ".sense";
-export declare const SUPPORTED_CONFIG_VERSION = 2;
+export declare const SUPPORTED_CONFIG_VERSION = 3;
 declare const FEATURE_NAMES: readonly ["links", "sections", "rank", "embed"];
 export type FeatureName = (typeof FEATURE_NAMES)[number];
 export interface EmbedConfig {
@@ -10,25 +10,35 @@ export interface EmbedConfig {
     key?: string;
 }
 export declare const DEFAULT_EMBED_MODEL = "minishlab/potion-retrieval-32M";
+export interface Preset {
+    include: string[];
+    exclude?: string[];
+    k?: number;
+    semantic?: boolean;
+    where?: string;
+}
+export interface SavedSearch {
+    search: string;
+    preset?: string;
+    include?: string[];
+    where?: string;
+    k?: number;
+    semantic?: boolean;
+}
+export type SavedQuery = string | {
+    sql: string;
+} | SavedSearch;
 export interface Config {
     $schema?: string;
     version?: number;
-    scan: {
-        include: string[];
-    };
+    presets: Record<string, Preset>;
     features?: {
         links?: boolean;
         sections?: boolean;
         rank?: boolean;
-        embed?: boolean | EmbedConfig;
-    };
-    defaults?: {
-        find?: {
-            where?: string;
-        };
     };
-    checks?: Record<string, 'empty'>;
-    queries: Record<string, string>;
+    embed?: EmbedConfig;
+    queries: Record<string, SavedQuery>;
 }
 export interface ResolvedConfig extends Config {
     baseDir: string;
@@ -36,6 +46,9 @@ export interface ResolvedConfig extends Config {
     unknownKeys?: string[];
     migratedFrom?: number;
 }
+export declare function presetNames(cfg: Config): string[];
+export declare function presetSemanticEnabled(cfg: Config, name: string): boolean;
+export declare function anyPresetEmbeds(cfg: Config): boolean;
 export declare function featureEnabled(cfg: Config, name: FeatureName): boolean;
 export declare function enabledFeatures(cfg: Config): FeatureName[];
 export declare function featureStates(cfg: Config): {
@@ -49,6 +62,26 @@ export declare function embedConfig(cfg: Config): {
     key?: string;
 } | null;
 export declare function featureSignature(cfg: Config): string;
+export declare function resolvePreset(cfg: Config, name?: string): {
+    name: string;
+    preset: Preset;
+};
+export interface SearchOverrides {
+    preset?: string;
+    k?: number;
+    where?: string;
+    include?: string[];
+    semantic?: boolean;
+}
+export interface EffectiveSearch {
+    presetName: string;
+    k: number;
+    where?: string;
+    include: string[];
+    exclude?: string[];
+    semantic: boolean;
+}
+export declare function resolveSearch(cfg: Config, opts?: SearchOverrides): EffectiveSearch;
 export declare function migrateConfig(cfg: Config): {
     cfg: Config;
     from: number;