sensemaking 0.12.2 → 0.13.0

package/dist/esm/commands.js

@@ -1,486 +0,0 @@
-import { readFileSync } from 'node:fs';
-import { join, matchesGlob } from 'node:path';
-import posix from 'node:path/posix';
-import { anyPresetEmbeds, contentTokenize, embedEnabled, featureEnabled, featureStates, presetNames, presetSemanticEnabled, resolveSearch } from './config.js';
-import { SenseError } from './errors.js';
-import { embedPending, hasEmbedding, modelPresent, semanticCandidates, similarNotes } from './features/embed.js';
-import { linkEdges } from './features/index.js';
-import { personalizedRank } from './graph.js';
-import { searchError } from './search-error.js';
-import { segmentMatch } from './segment.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.
-// Mirrors the main columns onto the sidecars, so a title match found through title_seg ranks
-// like a title match found through title, not like a body match.
-const WEIGHTED_BM25 = 'bm25(content, 10.0, 5.0, 1.0, 0, 10.0, 5.0, 1.0)';
-const RRF_K = 60;
-// snippet() re-tokenizes each candidate doc, superlinearly: ~10s for one 1MB doc
-// (BENCHMARKING.md). Past this bound, rows get the linear JS excerpt instead.
-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.20); scope filtering only ever needs single-pattern matching, so
-// it's used here in JS rather than running a directory walk in the query path.
-function inScope(path, include, exclude) {
-    if (!include.some((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 expansion + vectors, fused by reciprocal rank; `via` names the signal per row.
-// `opts` arrives already resolved (config.ts:resolveSearch).
-export async function search(db, cfg, terms, opts = {}) {
-    var _hits_get, _chunkLines_get, _chunkSimilarity_get;
-    const effective = resolveSearch(cfg, opts);
-    const { k } = effective;
-    const allPaths = db.prepare('SELECT "path" FROM frontmatter').all().map((r)=>r.path);
-    const scopePaths = rawScope(db, cfg, opts, allPaths);
-    const scopeActive = scopePaths.size < allPaths.length;
-    // The set every candidate pool must be filtered to before truncation: scope narrowed by
-    // --where, the same composition scopedPaths() gives the other commands. Runs the same where
-    // fragment matchSql does, so a bad column gets the same attributed error either way.
-    let allowedPaths;
-    try {
-        allowedPaths = narrowByWhere(db, scopePaths, effective.where);
-    } catch (err) {
-        throw searchError(err, terms, effective.where);
-    }
-    const fetch = Math.max(k * 3, 30);
-    // Asking for vectors without a model is a misconfiguration, not a mode: degrading would make
-    // the same search answer differently before and after a download. semantic:false never asks.
-    const wantsVectors = effective.semantic && anyPresetEmbeds(cfg);
-    if (wantsVectors && !modelPresent(cfg)) {
-        throw new SenseError('EMBED_MODEL_MISSING', `preset "${effective.presetName}" searches with vectors, but the embedding model is not available; run \`sense download\`, or set "semantic": false on that preset to search on words and links`);
-    }
-    const semanticEnabled = wantsVectors && scopeHasEmbeddings(db, cfg, allowedPaths);
-    // Terms pass to MATCH as written, with one transform: a run of text whose language marks no
-    // word boundaries becomes a quoted grapheme phrase (and a title:/summary:/text: qualifier
-    // ahead of it retargets its _seg column), matching how it was indexed. Text that already
-    // carries boundaries comes through untouched, so this is a no-op for the languages that
-    // never needed it. Gated on the same predicate that decided whether the sidecars were
-    // populated (contentTokenize(cfg) === undefined), so index and query can't disagree. Invalid
-    // syntax still errors rather than being rewritten.
-    // --where
-    // applies inside the candidate query (a post-filter would drop matches ranked past the pool)
-    // and again on the final select, for link-derived rows.
-    const scope = effective.where;
-    const whereJoin = scope ? `JOIN frontmatter f ON f."path" = content.path` : '';
-    const whereCond = scope ? `AND (${scope})` : '';
-    // A scope narrower than the whole index must filter the candidate pool before LIMIT, not
-    // after -- otherwise scoped notes ranking below the global top-`fetch` never reach the
-    // filter. A join against a temp table, not a bound parameter list: real scopes run to
-    // thousands of paths, past SQLITE_MAX_VARIABLE_NUMBER on older builds.
-    if (scopeActive) materializeScope(db, '_search_scope', scopePaths);
-    const scopeCond = scopeActive ? `AND content.path IN (SELECT "path" FROM _search_scope)` : '';
-    // Docs past SNIPPET_BOUND skip snippet() entirely -- SQLite
-    // short-circuits the untaken CASE branch, so it's never invoked on them.
-    // Column 2 (text), not -1 (best column): -1 could surface a _seg sidecar as the excerpt,
-    // which is machine-spaced and not what the author wrote. A row that matches only in a
-    // sidecar gets an unhighlighted text excerpt below instead -- a stated cost.
-    const matchSql = `SELECT content.path AS path, CASE WHEN length(content.text) <= ${SNIPPET_BOUND} THEN snippet(content, 2, '«', '»', '…', 10) ELSE NULL END AS hit FROM content ${whereJoin} WHERE content MATCH ? ${whereCond} ${scopeCond} ORDER BY ${WEIGHTED_BM25} LIMIT ${fetch}`;
-    const query = contentTokenize(cfg) === undefined ? segmentMatch(terms) : terms;
-    let matchRows;
-    try {
-        matchRows = db.prepare(matchSql).all(query);
-    } catch (err) {
-        throw searchError(err, terms, scope);
-    }
-    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) {
-        // Gates the label only, not the score: restart mass ranks every seed without an incident
-        // edge, but dropping it from the score reweights fusion (FEVER hit@10 0.997 -> 0.907).
-        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 && allowedPaths.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, allowedPaths);
-        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 _search');
-    db.exec('CREATE TEMP TABLE _search ("path" TEXT PRIMARY KEY, score REAL, via TEXT, hit TEXT, lines TEXT, similarity REAL)');
-    const insert = db.prepare('INSERT INTO _search ("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);
-    // All three candidate paths (match, link, vector) already filtered to scope+where before
-    // reaching _search; this reapplies --where anyway since the join to frontmatter is already
-    // needed for the path column.
-    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 ? ', _search.similarity' : '';
-    const rows = db.prepare(`SELECT f."path" AS path, content.title, content.summary, _search.hit, _search.via, round(_search.score, 4) AS score, _search.lines${similarityCol}
-       FROM _search JOIN frontmatter f ON f."path" = _search."path" JOIN content ON content.path = _search."path"
-       ${where} ORDER BY _search.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;
-}
-// Scope only (no --where): preset_files for a named preset, JS glob matching for an ad hoc
-// include/exclude override. Shared by scopedPaths() and search(), which also needs the
-// pre-where set to size the candidate-pool filter.
-function rawScope(db, cfg, overrides, allPaths) {
-    const effective = resolveSearch(cfg, overrides);
-    const { include, exclude } = effective;
-    const adHocScope = overrides.include !== undefined || overrides.exclude !== undefined || overrides.noExclude === true;
-    if (!adHocScope) return new Set(db.prepare('SELECT "path" FROM preset_files WHERE preset = ?').all(effective.presetName).map((r)=>r.path));
-    const paths = allPaths !== null && allPaths !== void 0 ? allPaths : db.prepare('SELECT "path" FROM frontmatter').all().map((r)=>r.path);
-    return new Set(paths.filter((p)=>inScope(p, include, exclude)));
-}
-function narrowByWhere(db, paths, where) {
-    if (!where) return paths;
-    const whereRows = db.prepare(`SELECT "path" FROM frontmatter f WHERE (${where})`).all();
-    const wherePaths = new Set(whereRows.map((r)=>r.path));
-    return new Set([
-        ...paths
-    ].filter((p)=>wherePaths.has(p)));
-}
-// The scope resolver for non-search commands (path, peek, map): same coverage rule search()
-// applies, then narrowed by the resolved `where`.
-export function scopedPaths(db, cfg, overrides) {
-    const effective = resolveSearch(cfg, overrides);
-    return narrowByWhere(db, rawScope(db, cfg, overrides), effective.where);
-}
-// Indexing derives from presets, so the derivation stays visible. Read from preset_files, not
-// recomputed from globs, so it reflects the cache rather than the config.
-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,
-            semantic: presetSemanticEnabled(cfg, name)
-        };
-    });
-}
-const INTERNAL_COLUMNS = new Set([
-    'path',
-    '_mtime',
-    '_size',
-    '_rank',
-    '_parse_error'
-]);
-// A result row is capped at SQLITE_MAX_COLUMN (2000, default); two aggregate expressions
-// per field keeps a chunk's row safely under that regardless of how many fields the tree has.
-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;
-}
-// Materializes a path set into a named temp table (same shape as traverse.ts's allowed_nodes)
-// so a query can join/filter against it cheaply instead of binding a parameter per path.
-function materializeScope(db, table, paths) {
-    db.exec(`DROP TABLE IF EXISTS ${table}`);
-    db.exec(`CREATE TEMP TABLE ${table} ("path" TEXT PRIMARY KEY)`);
-    db.prepare(`INSERT INTO ${table} SELECT DISTINCT value FROM json_each(?1)`).run(JSON.stringify([
-        ...paths
-    ]));
-}
-function setupMapScope(db, paths) {
-    materializeScope(db, '_map_scope', paths);
-}
-// What is this scope: fixed-size output regardless of tree size. Coverage and features stay
-// global -- they describe the tree, not the current question.
-export function mapTree(db, cfg, overrides = {}) {
-    setupMapScope(db, scopedPaths(db, cfg, overrides));
-    const scopeWhere = 'WHERE "path" IN (SELECT "path" FROM _map_scope)';
-    const scopeAnd = 'AND f."path" IN (SELECT "path" FROM _map_scope)';
-    const docs = db.prepare(`SELECT COUNT(*) AS count, COALESCE(SUM("_size"), 0) AS bytes FROM frontmatter ${scopeWhere}`).get();
-    const columns = db.prepare('PRAGMA table_info(frontmatter)').all().map((r)=>r.name).filter((name)=>!INTERNAL_COLUMNS.has(name));
-    // Observed types, not declared: SQLite types per value, so a field can be text in most notes
-    // and numeric in a few. One aggregate scan per chunk of columns; FILTER matches COUNT's nulls.
-    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 ${scopeWhere}`).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 ${scopeAnd} ORDER BY f."_rank" DESC LIMIT 8`).all() : [];
-    const recent = db.prepare(`SELECT "path", datetime("_mtime" / 1000, 'unixepoch') AS modified FROM frontmatter ${scopeWhere} ORDER BY "_mtime" DESC LIMIT 5`).all();
-    // A fresh clone/copy stamps files with checkout time, not edit history; second granularity
-    // matches the `recent` table above and is coarse enough to catch that without an exact-ms match.
-    const topSecond = db.prepare(`SELECT COUNT(*) AS n FROM frontmatter ${scopeWhere} GROUP BY CAST("_mtime" / 1000 AS INTEGER) ORDER BY n DESC LIMIT 1`).get();
-    const recentCaveat = topSecond && docs.count > 1 && topSecond.n > docs.count / 2 ? `${topSecond.n} of ${docs.count} files share one modified second, so recency likely reflects a checkout or copy, not edit history` : null;
-    return {
-        docs,
-        fields,
-        fieldsTotal: allFields.length,
-        features: featureStates(cfg),
-        presets: presetCoverage(db, cfg),
-        hubs,
-        recent,
-        recentCaveat
-    };
-}
-// Note resolution shared by peek and path: an exact path, or a unique basename (case
-// insensitive, .md stripped).
-export function resolveNote(paths, arg) {
-    const exact = paths.find((p)=>p === arg);
-    if (exact) return exact;
-    const base = posix.basename(arg).replace(/\.md$/i, '').toLowerCase();
-    const matches = paths.filter((p)=>posix.basename(p).replace(/\.md$/i, '').toLowerCase() === base);
-    if (matches.length === 1) return matches[0];
-    if (matches.length > 1) throw new SenseError('NOTE_AMBIGUOUS', `"${arg}" is ambiguous: ${matches.join(', ')}`);
-    throw new SenseError('NOTE_NOT_FOUND', `no note matches "${arg}"`);
-}
-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, overrides = {}) {
-    var _row__parse_error, _row__size;
-    const paths = db.prepare('SELECT "path" FROM frontmatter').all().map((r)=>r.path);
-    const path = resolveNote(paths, pathArg);
-    const row = db.prepare('SELECT * FROM frontmatter WHERE "path" = ?').get(path);
-    const parseError = (_row__parse_error = row._parse_error) !== null && _row__parse_error !== void 0 ? _row__parse_error : null;
-    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;
-    const _allowed = scopedPaths(db, cfg, overrides);
-    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,
-        parseError,
-        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))
-    };
-}
-// Notes most similar by cosine, excluding self and everything already linked either way.
-// Its own command, not a peek section: a full embeddings scan is ~480ms at 26k notes.
-export async function relatedNotes(db, cfg, pathArg, overrides, k) {
-    const paths = db.prepare('SELECT "path" FROM frontmatter').all().map((r)=>r.path);
-    const path = resolveNote(paths, pathArg);
-    const outbound = db.prepare('SELECT DISTINCT dst FROM links WHERE src = ? AND dst IS NOT NULL').all(path).map((r)=>r.dst);
-    const backlinks = db.prepare('SELECT DISTINCT src FROM links WHERE dst = ?').all(path).map((r)=>r.src);
-    const exclude = new Set([
-        path,
-        ...outbound,
-        ...backlinks
-    ]);
-    // Vectors are the only signal `related` has, so every way of not having them is an error
-    // naming the cause. An empty table then means one thing: nothing near in meaning that this
-    // note does not already link to, which is a real answer.
-    const effective = resolveSearch(cfg, overrides);
-    if (!embedEnabled(cfg)) {
-        throw new SenseError('EMBED_DISABLED', 'related ranks notes by meaning, and this tree has no embedding model; add an "embed" block naming one to sense.config.json, then run `sense download` (search works without it, on words and links)');
-    }
-    // search gates on the same flag (see wantsVectors above); reading it here too keeps
-    // `semantic: false` meaning one thing. Without this, an overlapping semantic-on preset's
-    // vectors would answer for a scope that declined them.
-    if (!effective.semantic) {
-        throw new SenseError('PRESET_NOT_SEMANTIC', `preset "${effective.presetName}" sets "semantic": false, so this scope has no vectors and related has no other signal; search it instead (words and links), or set semantic back on for that preset`);
-    }
-    if (!modelPresent(cfg)) {
-        throw new SenseError('EMBED_MODEL_MISSING', 'related ranks notes by meaning, so it needs the embedding model, which is not downloaded; run `sense download` (search still works without it, on words and links)');
-    }
-    const allowed = scopedPaths(db, cfg, overrides);
-    // Top up pending rows before the seed check, or a fresh index reports every note as
-    // having no indexed text until some search has run.
-    await embedPending(db, cfg, cfg.baseDir);
-    if (!hasEmbedding(db, path)) {
-        throw new SenseError('NOTE_NOT_EMBEDDED', `${path} has no indexed text to compare -- a note that is frontmatter only, or empty, has nothing to rank by meaning`);
-    }
-    if (!scopeHasEmbeddings(db, cfg, allowed)) return [];
-    return similarNotes(db, cfg, path, {
-        exclude,
-        allowed,
-        k
-    });
-}

package/dist/esm/commands.js.map

@@ -1 +0,0 @@
-{"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, SearchOverrides } from './config.ts';\nimport { anyPresetEmbeds, contentTokenize, embedEnabled, featureEnabled, featureStates, presetNames, presetSemanticEnabled, resolveSearch } from './config.ts';\nimport { SenseError } from './errors.ts';\nimport { embedPending, hasEmbedding, modelPresent, semanticCandidates, similarNotes } from './features/embed.ts';\nimport { linkEdges } from './features/index.ts';\nimport { personalizedRank } from './graph.ts';\nimport type { Row } from './output.ts';\nimport { searchError } from './search-error.ts';\nimport { segmentMatch } from './segment.ts';\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\n// Mirrors the main columns onto the sidecars, so a title match found through title_seg ranks\n// like a title match found through title, not like a body match.\nconst WEIGHTED_BM25 = 'bm25(content, 10.0, 5.0, 1.0, 0, 10.0, 5.0, 1.0)';\nconst RRF_K = 60;\n\n// snippet() re-tokenizes each candidate doc, superlinearly: ~10s for one 1MB doc\n// (BENCHMARKING.md). Past this bound, rows get the linear JS excerpt instead.\nconst SNIPPET_BOUND = 16_384;\nconst EXCERPT_WINDOW = 160;\n\n// Bare terms from an FTS5 query string: strips operators/quoting so the oversized-doc excerpt\n// scan matches the same words the query matched on, not FTS5 syntax.\nfunction extractBareTerms(query: string): string[] {\n  const cleaned = query\n    .replace(/\"/g, ' ')\n    .replace(/[()*]/g, ' ')\n    .replace(/\\b(AND|OR|NOT|NEAR)\\b(\\/\\d+)?/gi, ' ');\n  return cleaned\n    .split(/\\s+/)\n    .map((tok) => tok.replace(/^[A-Za-z_]\\w*:/, '')) // column filter, e.g. title:term\n    .map((tok) => tok.toLowerCase().trim())\n    .filter((tok) => tok.length > 0);\n}\n\nfunction findOccurrences(haystackLower: string, terms: string[]): Array<{ start: number; end: number; term: string }> {\n  const occ: Array<{ start: number; end: number; term: string }> = [];\n  for (const term of terms) {\n    let idx = 0;\n    for (;;) {\n      const found = haystackLower.indexOf(term, idx);\n      if (found === -1) break;\n      occ.push({ start: found, end: found + term.length, term });\n      idx = found + term.length;\n    }\n  }\n  // Longest span first at equal start, so \"tests\" beats its substring \"test\" and the\n  // whole word gets highlighted; the emit loop then absorbs the shorter overlap.\n  return occ.sort((a, b) => a.start - b.start || b.end - a.end);\n}\n\n// Slides a window over the sorted occurrences, same semantics as FTS5's own best-window\n// pick: most distinct terms, ties broken by most total hits.\nfunction bestWindowStart(occ: Array<{ start: number; end: number; term: string }>, windowSize: number): number {\n  let best = occ[0].start;\n  let bestDistinct = 0;\n  let bestCount = 0;\n  for (let i = 0; i < occ.length; i++) {\n    const winEnd = occ[i].start + windowSize;\n    const seen = new Set<string>();\n    let count = 0;\n    for (let j = i; j < occ.length && occ[j].start < winEnd; j++) {\n      seen.add(occ[j].term);\n      count++;\n    }\n    if (seen.size > bestDistinct || (seen.size === bestDistinct && count > bestCount)) {\n      best = occ[i].start;\n      bestDistinct = seen.size;\n      bestCount = count;\n    }\n  }\n  return best;\n}\n\n// snippet()-shaped excerpt: matched terms wrapped in «», … at cut edges. Linear in doc\n// length, only run for rows actually returned (<= k), unlike snippet()'s per-row cost.\nfunction computeExcerpt(text: string, terms: string[]): { excerpt: string; offset: number } {\n  const occ = findOccurrences(text.toLowerCase(), terms);\n  if (occ.length === 0) {\n    // This is a raw substring scan, not porter-stemmed: a doc matched only through a\n    // stemmed variant (query \"negotiate\" vs doc \"negotiating\") finds no occurrence here.\n    // Fall back to the doc's start, unmarked, rather than claim a match that isn't there.\n    const end = Math.min(text.length, EXCERPT_WINDOW);\n    return { excerpt: `${text.slice(0, end).replace(/\\s+/g, ' ').trim()}${end < text.length ? '…' : ''}`, offset: 0 };\n  }\n  const start = bestWindowStart(occ, EXCERPT_WINDOW);\n  const end = Math.min(text.length, start + EXCERPT_WINDOW);\n  let out = '';\n  let cursor = start;\n  for (const o of occ) {\n    if (o.start < start || o.end > end) continue;\n    // Occurrences of duplicate or substring-overlapping terms (\"test tests\") can overlap;\n    // emitting each would duplicate document text. Keep the first, absorb the rest.\n    if (o.start < cursor) continue;\n    out += `${text.slice(cursor, o.start)}«${text.slice(o.start, o.end)}»`;\n    cursor = o.end;\n  }\n  out += text.slice(cursor, end);\n  const prefix = start > 0 ? '…' : '';\n  const suffix = end < text.length ? '…' : '';\n  return { excerpt: `${prefix}${out.replace(/\\s+/g, ' ')}${suffix}`, offset: start };\n}\n\nfunction lineNumberAt(text: string, offset: number): number {\n  let line = 1;\n  for (let i = 0; i < offset; i++) if (text.charCodeAt(i) === 10) line++;\n  return line;\n}\n\nfunction lineRangeFor(db: DatabaseSync, path: string, line: number): string | null {\n  const row = db.prepare('SELECT start_line, end_line FROM sections WHERE \"path\" = ? AND start_line <= ? AND end_line >= ? ORDER BY start_line DESC LIMIT 1').get(path, line, line) as { start_line: number; end_line: number } | undefined;\n  return row ? `L${row.start_line}-${row.end_line}` : null;\n}\n\nexport interface SearchOptions {\n  k?: number;\n  where?: string; // SQL fragment against frontmatter alias `f`, e.g. \"f.status = 'active'\"\n  preset?: string; // named preset; unknown name throws listing declared presets, undefined -> \"default\"\n  include?: string[]; // ad hoc scope override (repeatable --include); independent of exclude\n  exclude?: string[]; // ad hoc scope override (repeatable --exclude); independent of include\n  noExclude?: boolean; // --no-exclude: drop the preset's exclude for this command\n}\n\n// node:path's matchesGlob is experimental (stable behind an unstable-API flag) as of the\n// engines floor (Node >=22.20); scope filtering only ever needs single-pattern matching, so\n// it's used here in JS rather than running a directory walk in 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 expansion + vectors, fused by reciprocal rank; `via` names the signal per row.\n// `opts` arrives already resolved (config.ts:resolveSearch).\nexport async function search(db: DatabaseSync, cfg: ResolvedConfig, terms: string, opts: SearchOptions = {}): Promise<Row[]> {\n  const effective = resolveSearch(cfg, opts);\n  const { k } = effective;\n\n  const allPaths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const scopePaths = rawScope(db, cfg, opts, allPaths);\n  const scopeActive = scopePaths.size < allPaths.length;\n  // The set every candidate pool must be filtered to before truncation: scope narrowed by\n  // --where, the same composition scopedPaths() gives the other commands. Runs the same where\n  // fragment matchSql does, so a bad column gets the same attributed error either way.\n  let allowedPaths: Set<string>;\n  try {\n    allowedPaths = narrowByWhere(db, scopePaths, effective.where);\n  } catch (err) {\n    throw searchError(err as Error, terms, effective.where);\n  }\n  const fetch = Math.max(k * 3, 30);\n\n  // Asking for vectors without a model is a misconfiguration, not a mode: degrading would make\n  // the same search answer differently before and after a download. semantic:false never asks.\n  const wantsVectors = effective.semantic && anyPresetEmbeds(cfg);\n  if (wantsVectors && !modelPresent(cfg)) {\n    throw new SenseError('EMBED_MODEL_MISSING', `preset \"${effective.presetName}\" searches with vectors, but the embedding model is not available; run \\`sense download\\`, or set \"semantic\": false on that preset to search on words and links`);\n  }\n  const semanticEnabled = wantsVectors && scopeHasEmbeddings(db, cfg, allowedPaths);\n\n  // Terms pass to MATCH as written, with one transform: a run of text whose language marks no\n  // word boundaries becomes a quoted grapheme phrase (and a title:/summary:/text: qualifier\n  // ahead of it retargets its _seg column), matching how it was indexed. Text that already\n  // carries boundaries comes through untouched, so this is a no-op for the languages that\n  // never needed it. Gated on the same predicate that decided whether the sidecars were\n  // populated (contentTokenize(cfg) === undefined), so index and query can't disagree. Invalid\n  // syntax still errors rather than being rewritten.\n  // --where\n  // applies inside the candidate query (a post-filter would drop matches ranked past the pool)\n  // and again on the final select, for link-derived rows.\n  const scope = effective.where;\n  const whereJoin = scope ? `JOIN frontmatter f ON f.\"path\" = content.path` : '';\n  const whereCond = scope ? `AND (${scope})` : '';\n  // A scope narrower than the whole index must filter the candidate pool before LIMIT, not\n  // after -- otherwise scoped notes ranking below the global top-`fetch` never reach the\n  // filter. A join against a temp table, not a bound parameter list: real scopes run to\n  // thousands of paths, past SQLITE_MAX_VARIABLE_NUMBER on older builds.\n  if (scopeActive) materializeScope(db, '_search_scope', scopePaths);\n  const scopeCond = scopeActive ? `AND content.path IN (SELECT \"path\" FROM _search_scope)` : '';\n  // Docs past SNIPPET_BOUND skip snippet() entirely -- SQLite\n  // short-circuits the untaken CASE branch, so it's never invoked on them.\n  // Column 2 (text), not -1 (best column): -1 could surface a _seg sidecar as the excerpt,\n  // which is machine-spaced and not what the author wrote. A row that matches only in a\n  // sidecar gets an unhighlighted text excerpt below instead -- a stated cost.\n  const matchSql = `SELECT content.path AS path, CASE WHEN length(content.text) <= ${SNIPPET_BOUND} THEN snippet(content, 2, '«', '»', '…', 10) ELSE NULL END AS hit FROM content ${whereJoin} WHERE content MATCH ? ${whereCond} ${scopeCond} ORDER BY ${WEIGHTED_BM25} LIMIT ${fetch}`;\n  const query = contentTokenize(cfg) === undefined ? segmentMatch(terms) : terms;\n  let matchRows: Array<{ path: string; hit: string | null }>;\n  try {\n    matchRows = db.prepare(matchSql).all(query) as Array<{ path: string; hit: string | null }>;\n  } catch (err) {\n    throw searchError(err as Error, terms, scope);\n  }\n\n  const hits = new Map(matchRows.map((r) => [r.path, r.hit]));\n  // hit === null here means the bound suppressed snippet(), not \"no match\" -- distinguish\n  // from via='link' rows (never in matchRows, so absent from this set) below.\n  const oversized = new Set(matchRows.filter((r) => r.hit === null).map((r) => r.path));\n  const candidates = new Map<string, { score: number; via: string }>();\n  matchRows.forEach((r, i) => {\n    candidates.set(r.path, { score: 1 / (RRF_K + i), via: 'match' });\n  });\n\n  const edges = featureEnabled(cfg, 'links') && matchRows.length > 0 ? linkEdges(db) : [];\n  if (edges.length > 0) {\n    // Gates the label only, not the score: restart mass ranks every seed without an incident\n    // edge, but dropping it from the score reweights fusion (FEVER hit@10 0.997 -> 0.907).\n    const linked = new Set(edges.flat());\n    const seeds = new Map(matchRows.map((r, i) => [r.path, 1 / (i + 1)]));\n    const ranked = [...personalizedRank(allPaths, edges, seeds)]\n      .filter(([path, score]) => score > 1e-9 && allowedPaths.has(path))\n      .sort((a, b) => b[1] - a[1])\n      .slice(0, fetch);\n    ranked.forEach(([path], i) => {\n      const existing = candidates.get(path);\n      if (existing) {\n        existing.score += 1 / (RRF_K + i);\n        if (linked.has(path)) existing.via = 'match+link';\n      } else {\n        candidates.set(path, { score: 1 / (RRF_K + i), via: 'link' });\n      }\n    });\n  }\n\n  // Vector expansion, invoked only: a third RRF list at the swept flat-region constants\n  // (weight 1, pool = fetch). Each row carries its best chunk's line range.\n  const chunkLines = new Map<string, string>();\n  const chunkSimilarity = new Map<string, number>();\n  if (semanticEnabled) {\n    const vec = await semanticCandidates(db, cfg, terms, fetch, allowedPaths);\n    vec.forEach(({ path, lines, similarity }, i) => {\n      chunkLines.set(path, lines);\n      chunkSimilarity.set(path, similarity);\n      const existing = candidates.get(path);\n      if (existing) {\n        existing.score += 1 / (RRF_K + i);\n        existing.via = `${existing.via}+vector`;\n      } else {\n        candidates.set(path, { score: 1 / (RRF_K + i), via: 'vector' });\n      }\n    });\n  }\n\n  db.exec('DROP TABLE IF EXISTS _search');\n  db.exec('CREATE TEMP TABLE _search (\"path\" TEXT PRIMARY KEY, score REAL, via TEXT, hit TEXT, lines TEXT, similarity REAL)');\n  const insert = db.prepare('INSERT INTO _search (\"path\", score, via, hit, lines, similarity) VALUES (?, ?, ?, ?, ?, ?)');\n  for (const [path, c] of candidates) insert.run(path, c.score, c.via, hits.get(path) ?? null, chunkLines.get(path) ?? null, chunkSimilarity.get(path) ?? null);\n\n  // All three candidate paths (match, link, vector) already filtered to scope+where before\n  // reaching _search; this reapplies --where anyway since the join to frontmatter is already\n  // needed for the path column.\n  const where = scope ? `WHERE (${scope})` : '';\n  // lines is always present now: semantic rows carry their chunk's range, oversized-doc\n  // lexical rows gain one below, everything else stays null. similarity stays semantic-only.\n  const similarityCol = semanticEnabled ? ', _search.similarity' : '';\n  const rows = db\n    .prepare(\n      `SELECT f.\"path\" AS path, content.title, content.summary, _search.hit, _search.via, round(_search.score, 4) AS score, _search.lines${similarityCol}\n       FROM _search JOIN frontmatter f ON f.\"path\" = _search.\"path\" JOIN content ON content.path = _search.\"path\"\n       ${where} ORDER BY _search.score DESC LIMIT ?`\n    )\n    .all(k) as Row[];\n\n  if (oversized.size > 0) {\n    const bareTerms = extractBareTerms(terms);\n    for (const row of rows) {\n      if (row.hit !== null || !oversized.has(row.path as string)) continue;\n      let text: string;\n      try {\n        text = readFileSync(join(cfg.baseDir, row.path as string), 'utf8');\n      } catch {\n        continue; // vanished since the match; leave hit/lines null rather than throw\n      }\n      const { excerpt, offset } = computeExcerpt(text, bareTerms);\n      row.hit = excerpt;\n      if (row.lines == null) row.lines = featureEnabled(cfg, 'sections') ? lineRangeFor(db, row.path as string, lineNumberAt(text, offset)) : null;\n    }\n  }\n\n  return rows;\n}\n\n// Scope only (no --where): preset_files for a named preset, JS glob matching for an ad hoc\n// include/exclude override. Shared by scopedPaths() and search(), which also needs the\n// pre-where set to size the candidate-pool filter.\nfunction rawScope(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides, allPaths?: string[]): Set<string> {\n  const effective = resolveSearch(cfg, overrides);\n  const { include, exclude } = effective;\n  const adHocScope = overrides.include !== undefined || overrides.exclude !== undefined || overrides.noExclude === true;\n  if (!adHocScope) return new Set((db.prepare('SELECT \"path\" FROM preset_files WHERE preset = ?').all(effective.presetName) as Array<{ path: string }>).map((r) => r.path));\n  const paths = allPaths ?? (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  return new Set(paths.filter((p) => inScope(p, include, exclude)));\n}\n\nfunction narrowByWhere(db: DatabaseSync, paths: Set<string>, where: string | undefined): Set<string> {\n  if (!where) return paths;\n  const whereRows = db.prepare(`SELECT \"path\" FROM frontmatter f WHERE (${where})`).all() as Array<{ path: string }>;\n  const wherePaths = new Set(whereRows.map((r) => r.path));\n  return new Set([...paths].filter((p) => wherePaths.has(p)));\n}\n\n// The scope resolver for non-search commands (path, peek, map): same coverage rule search()\n// applies, then narrowed by the resolved `where`.\nexport function scopedPaths(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides): Set<string> {\n  const effective = resolveSearch(cfg, overrides);\n  return narrowByWhere(db, rawScope(db, cfg, overrides), effective.where);\n}\n\nexport interface PresetCoverage {\n  name: string;\n  files: number;\n  embedded: number;\n  // Reported so 0 embedded reads as \"this scope declined vectors\" rather than \"not yet built\".\n  semantic: boolean;\n}\n\n// Indexing derives from presets, so the derivation stays visible. Read from preset_files, not\n// recomputed from globs, so it reflects the cache rather than the config.\nexport function presetCoverage(db: DatabaseSync, cfg: ResolvedConfig): PresetCoverage[] {\n  const embedActive = anyPresetEmbeds(cfg);\n  return presetNames(cfg).map((name) => {\n    const files = (db.prepare('SELECT COUNT(*) AS n FROM preset_files WHERE preset = ?').get(name) as { n: number }).n;\n    const embedded = embedActive ? (db.prepare('SELECT COUNT(*) AS n FROM preset_files pf WHERE pf.preset = ? AND EXISTS (SELECT 1 FROM embeddings e WHERE e.\"path\" = pf.\"path\" AND e.vector IS NOT NULL)').get(name) as { n: number }).n : 0;\n    return { name, files, embedded, semantic: presetSemanticEnabled(cfg, name) };\n  });\n}\n\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  recentCaveat: string | null;\n}\n\nconst INTERNAL_COLUMNS = new Set(['path', '_mtime', '_size', '_rank', '_parse_error']);\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// Materializes a path set into a named temp table (same shape as traverse.ts's allowed_nodes)\n// so a query can join/filter against it cheaply instead of binding a parameter per path.\nfunction materializeScope(db: DatabaseSync, table: string, paths: Set<string>): void {\n  db.exec(`DROP TABLE IF EXISTS ${table}`);\n  db.exec(`CREATE TEMP TABLE ${table} (\"path\" TEXT PRIMARY KEY)`);\n  db.prepare(`INSERT INTO ${table} SELECT DISTINCT value FROM json_each(?1)`).run(JSON.stringify([...paths]));\n}\n\nfunction setupMapScope(db: DatabaseSync, paths: Set<string>): void {\n  materializeScope(db, '_map_scope', paths);\n}\n\n// What is this scope: fixed-size output regardless of tree size. Coverage and features stay\n// global -- they describe the tree, not the current question.\nexport function mapTree(db: DatabaseSync, cfg: ResolvedConfig, overrides: SearchOverrides = {}): TreeMap {\n  setupMapScope(db, scopedPaths(db, cfg, overrides));\n  const scopeWhere = 'WHERE \"path\" IN (SELECT \"path\" FROM _map_scope)';\n  const scopeAnd = 'AND f.\"path\" IN (SELECT \"path\" FROM _map_scope)';\n\n  const docs = db.prepare(`SELECT COUNT(*) AS count, COALESCE(SUM(\"_size\"), 0) AS bytes FROM frontmatter ${scopeWhere}`).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 types, not declared: SQLite types per value, so a field can be text in most notes\n  // and numeric in a few. One aggregate scan per chunk of columns; FILTER matches COUNT's nulls.\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 ${scopeWhere}`).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 ${scopeAnd} 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 ${scopeWhere} ORDER BY \"_mtime\" DESC LIMIT 5`).all() as Row[];\n\n  // A fresh clone/copy stamps files with checkout time, not edit history; second granularity\n  // matches the `recent` table above and is coarse enough to catch that without an exact-ms match.\n  const topSecond = db.prepare(`SELECT COUNT(*) AS n FROM frontmatter ${scopeWhere} GROUP BY CAST(\"_mtime\" / 1000 AS INTEGER) ORDER BY n DESC LIMIT 1`).get() as { n: number } | undefined;\n  const recentCaveat = topSecond && docs.count > 1 && topSecond.n > docs.count / 2 ? `${topSecond.n} of ${docs.count} files share one modified second, so recency likely reflects a checkout or copy, not edit history` : null;\n\n  return { docs, fields, fieldsTotal: allFields.length, features: featureStates(cfg), presets: presetCoverage(db, cfg), hubs, recent, recentCaveat };\n}\n\n// Note resolution shared by peek and path: an exact path, or a unique basename (case\n// insensitive, .md stripped).\nexport function resolveNote(paths: string[], arg: string): string {\n  const exact = paths.find((p) => p === arg);\n  if (exact) return exact;\n  const base = posix.basename(arg).replace(/\\.md$/i, '').toLowerCase();\n  const matches = paths.filter((p) => posix.basename(p).replace(/\\.md$/i, '').toLowerCase() === base);\n  if (matches.length === 1) return matches[0];\n  if (matches.length > 1) throw new SenseError('NOTE_AMBIGUOUS', `\"${arg}\" is ambiguous: ${matches.join(', ')}`);\n  throw new SenseError('NOTE_NOT_FOUND', `no note matches \"${arg}\"`);\n}\n\nexport interface Peek {\n  path: string;\n  tokens: number;\n  frontmatter: Row;\n  // Set when the note's frontmatter was refused, so an empty frontmatter block reads as \"did\n  // not parse\" rather than \"has none\". Same reason `_parse_error` sits in the row.\n  parseError: string | null;\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  // Bounded k-hop expansion beyond the immediate ring already shown by outbound/backlinks\n  // (depth starts at 2).\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, overrides: SearchOverrides = {}): Peek {\n  const paths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const path = resolveNote(paths, pathArg);\n\n  const row = db.prepare('SELECT * FROM frontmatter WHERE \"path\" = ?').get(path) as Row;\n  const parseError = (row._parse_error as string | null) ?? null;\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  const _allowed = scopedPaths(db, cfg, overrides);\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    parseError,\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\n// Notes most similar by cosine, excluding self and everything already linked either way.\n// Its own command, not a peek section: a full embeddings scan is ~480ms at 26k notes.\nexport async function relatedNotes(db: DatabaseSync, cfg: ResolvedConfig, pathArg: string, overrides: SearchOverrides, k: number): Promise<Array<{ path: string; similarity: number }>> {\n  const paths = (db.prepare('SELECT \"path\" FROM frontmatter').all() as Array<{ path: string }>).map((r) => r.path);\n  const path = resolveNote(paths, pathArg);\n\n  const outbound = (db.prepare('SELECT DISTINCT dst FROM links WHERE src = ? AND dst IS NOT NULL').all(path) as Array<{ dst: string }>).map((r) => r.dst);\n  const backlinks = (db.prepare('SELECT DISTINCT src FROM links WHERE dst = ?').all(path) as Array<{ src: string }>).map((r) => r.src);\n  const exclude = new Set([path, ...outbound, ...backlinks]);\n\n  // Vectors are the only signal `related` has, so every way of not having them is an error\n  // naming the cause. An empty table then means one thing: nothing near in meaning that this\n  // note does not already link to, which is a real answer.\n  const effective = resolveSearch(cfg, overrides);\n  if (!embedEnabled(cfg)) {\n    throw new SenseError('EMBED_DISABLED', 'related ranks notes by meaning, and this tree has no embedding model; add an \"embed\" block naming one to sense.config.json, then run `sense download` (search works without it, on words and links)');\n  }\n  // search gates on the same flag (see wantsVectors above); reading it here too keeps\n  // `semantic: false` meaning one thing. Without this, an overlapping semantic-on preset's\n  // vectors would answer for a scope that declined them.\n  if (!effective.semantic) {\n    throw new SenseError('PRESET_NOT_SEMANTIC', `preset \"${effective.presetName}\" sets \"semantic\": false, so this scope has no vectors and related has no other signal; search it instead (words and links), or set semantic back on for that preset`);\n  }\n  if (!modelPresent(cfg)) {\n    throw new SenseError('EMBED_MODEL_MISSING', 'related ranks notes by meaning, so it needs the embedding model, which is not downloaded; run `sense download` (search still works without it, on words and links)');\n  }\n  const allowed = scopedPaths(db, cfg, overrides);\n  // Top up pending rows before the seed check, or a fresh index reports every note as\n  // having no indexed text until some search has run.\n  await embedPending(db, cfg, cfg.baseDir);\n  if (!hasEmbedding(db, path)) {\n    throw new SenseError('NOTE_NOT_EMBEDDED', `${path} has no indexed text to compare -- a note that is frontmatter only, or empty, has nothing to rank by meaning`);\n  }\n  if (!scopeHasEmbeddings(db, cfg, allowed)) return [];\n  return similarNotes(db, cfg, path, { exclude, allowed, k });\n}\n"],"names":["readFileSync","join","matchesGlob","posix","anyPresetEmbeds","contentTokenize","embedEnabled","featureEnabled","featureStates","presetNames","presetSemanticEnabled","resolveSearch","SenseError","embedPending","hasEmbedding","modelPresent","semanticCandidates","similarNotes","linkEdges","personalizedRank","searchError","segmentMatch","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","scopePaths","rawScope","scopeActive","allowedPaths","narrowByWhere","where","err","fetch","max","wantsVectors","semantic","presetName","semanticEnabled","scope","whereJoin","whereCond","materializeScope","scopeCond","matchSql","undefined","matchRows","Map","hit","oversized","candidates","forEach","set","score","via","edges","linked","flat","seeds","ranked","existing","vec","lines","similarity","exec","insert","c","run","similarityCol","bareTerms","baseDir","overrides","adHocScope","noExclude","paths","p","whereRows","wherePaths","presetCoverage","embedActive","name","files","n","embedded","INTERNAL_COLUMNS","MAP_COLUMN_CHUNK","chunk","items","table","JSON","stringify","setupMapScope","mapTree","scopeWhere","scopeAnd","docs","columns","allFields","group","exprs","quoted","result","field","coverage","type","fields","hubs","recent","topSecond","recentCaveat","fieldsTotal","features","presets","resolveNote","arg","exact","find","base","basename","matches","PEEK_LIST_LIMIT","peek","pathArg","parseError","_parse_error","frontmatter","key","value","Object","entries","sectionsTotal","sections","outbound","backlinks","unresolved","backlinksTotal","_allowed","l","dst","target","src","tokens","ceil","_size","outboundTotal","unresolvedTotal","off","relatedNotes","allowed"],"mappings":"AAAA,SAASA,YAAY,QAAQ,UAAU;AACvC,SAASC,IAAI,EAAEC,WAAW,QAAQ,YAAY;AAC9C,OAAOC,WAAW,kBAAkB;AAGpC,SAASC,eAAe,EAAEC,eAAe,EAAEC,YAAY,EAAEC,cAAc,EAAEC,aAAa,EAAEC,WAAW,EAAEC,qBAAqB,EAAEC,aAAa,QAAQ,cAAc;AAC/J,SAASC,UAAU,QAAQ,cAAc;AACzC,SAASC,YAAY,EAAEC,YAAY,EAAEC,YAAY,EAAEC,kBAAkB,EAAEC,YAAY,QAAQ,sBAAsB;AACjH,SAASC,SAAS,QAAQ,sBAAsB;AAChD,SAASC,gBAAgB,QAAQ,aAAa;AAE9C,SAASC,WAAW,QAAQ,oBAAoB;AAChD,SAASC,YAAY,QAAQ,eAAe;AAE5C,2EAA2E;AAC3E,gFAAgF;AAEhF,6FAA6F;AAC7F,iEAAiE;AACjE,MAAMC,gBAAgB;AACtB,MAAMC,QAAQ;AAEd,iFAAiF;AACjF,8EAA8E;AAC9E,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;AAWA,yFAAyF;AACzF,4FAA4F;AAC5F,+EAA+E;AAC/E,SAASC,QAAQN,IAAY,EAAEO,OAAiB,EAAEC,OAAkB;IAClE,IAAI,CAACD,QAAQE,IAAI,CAAC,CAACC,IAAMzF,YAAY+E,MAAMU,KAAK,OAAO;IACvD,IAAIF,oBAAAA,8BAAAA,QAASC,IAAI,CAAC,CAACC,IAAMzF,YAAY+E,MAAMU,KAAK,OAAO;IACvD,OAAO;AACT;AAEA,SAASC,mBAAmBZ,EAAgB,EAAEa,GAAmB,EAAEC,WAAwB;IACzF,IAAI,CAAC1F,gBAAgByF,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,6FAA6F;AAC7F,6DAA6D;AAC7D,OAAO,eAAekB,OAAOnB,EAAgB,EAAEa,GAAmB,EAAEtD,KAAa,EAAE6D,OAAsB,CAAC,CAAC;QA+GpCC,WAAwBC,iBAA8BC;IA9G3H,MAAMC,YAAY7F,cAAckF,KAAKO;IACrC,MAAM,EAAEK,CAAC,EAAE,GAAGD;IAEd,MAAME,WAAW,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAClH,MAAM0B,aAAaC,SAAS5B,IAAIa,KAAKO,MAAMM;IAC3C,MAAMG,cAAcF,WAAW5C,IAAI,GAAG2C,SAAStE,MAAM;IACrD,wFAAwF;IACxF,4FAA4F;IAC5F,qFAAqF;IACrF,IAAI0E;IACJ,IAAI;QACFA,eAAeC,cAAc/B,IAAI2B,YAAYH,UAAUQ,KAAK;IAC9D,EAAE,OAAOC,KAAK;QACZ,MAAM7F,YAAY6F,KAAc1E,OAAOiE,UAAUQ,KAAK;IACxD;IACA,MAAME,QAAQhD,KAAKiD,GAAG,CAACV,IAAI,GAAG;IAE9B,6FAA6F;IAC7F,6FAA6F;IAC7F,MAAMW,eAAeZ,UAAUa,QAAQ,IAAIjH,gBAAgByF;IAC3D,IAAIuB,gBAAgB,CAACrG,aAAa8E,MAAM;QACtC,MAAM,IAAIjF,WAAW,uBAAuB,CAAC,QAAQ,EAAE4F,UAAUc,UAAU,CAAC,+JAA+J,CAAC;IAC9O;IACA,MAAMC,kBAAkBH,gBAAgBxB,mBAAmBZ,IAAIa,KAAKiB;IAEpE,4FAA4F;IAC5F,0FAA0F;IAC1F,yFAAyF;IACzF,wFAAwF;IACxF,sFAAsF;IACtF,6FAA6F;IAC7F,mDAAmD;IACnD,UAAU;IACV,6FAA6F;IAC7F,wDAAwD;IACxD,MAAMU,QAAQhB,UAAUQ,KAAK;IAC7B,MAAMS,YAAYD,QAAQ,CAAC,6CAA6C,CAAC,GAAG;IAC5E,MAAME,YAAYF,QAAQ,CAAC,KAAK,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC7C,yFAAyF;IACzF,uFAAuF;IACvF,sFAAsF;IACtF,uEAAuE;IACvE,IAAIX,aAAac,iBAAiB3C,IAAI,iBAAiB2B;IACvD,MAAMiB,YAAYf,cAAc,CAAC,sDAAsD,CAAC,GAAG;IAC3F,4DAA4D;IAC5D,yEAAyE;IACzE,yFAAyF;IACzF,sFAAsF;IACtF,6EAA6E;IAC7E,MAAMgB,WAAW,CAAC,+DAA+D,EAAErG,cAAc,+EAA+E,EAAEiG,UAAU,uBAAuB,EAAEC,UAAU,CAAC,EAAEE,UAAU,UAAU,EAAEtG,cAAc,OAAO,EAAE4F,OAAO;IACtR,MAAMvF,QAAQtB,gBAAgBwF,SAASiC,YAAYzG,aAAakB,SAASA;IACzE,IAAIwF;IACJ,IAAI;QACFA,YAAY/C,GAAGG,OAAO,CAAC0C,UAAU7B,GAAG,CAACrE;IACvC,EAAE,OAAOsF,KAAK;QACZ,MAAM7F,YAAY6F,KAAc1E,OAAOiF;IACzC;IAEA,MAAMnB,OAAO,IAAI2B,IAAID,UAAUhG,GAAG,CAAC,CAACkE,IAAM;YAACA,EAAEhB,IAAI;YAAEgB,EAAEgC,GAAG;SAAC;IACzD,wFAAwF;IACxF,4EAA4E;IAC5E,MAAMC,YAAY,IAAIvE,IAAIoE,UAAU5F,MAAM,CAAC,CAAC8D,IAAMA,EAAEgC,GAAG,KAAK,MAAMlG,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACnF,MAAMkD,aAAa,IAAIH;IACvBD,UAAUK,OAAO,CAAC,CAACnC,GAAGzC;QACpB2E,WAAWE,GAAG,CAACpC,EAAEhB,IAAI,EAAE;YAAEqD,OAAO,IAAK/G,CAAAA,QAAQiC,CAAAA;YAAI+E,KAAK;QAAQ;IAChE;IAEA,MAAMC,QAAQjI,eAAesF,KAAK,YAAYkC,UAAU3F,MAAM,GAAG,IAAIlB,UAAU8D,MAAM,EAAE;IACvF,IAAIwD,MAAMpG,MAAM,GAAG,GAAG;QACpB,yFAAyF;QACzF,uFAAuF;QACvF,MAAMqG,SAAS,IAAI9E,IAAI6E,MAAME,IAAI;QACjC,MAAMC,QAAQ,IAAIX,IAAID,UAAUhG,GAAG,CAAC,CAACkE,GAAGzC,IAAM;gBAACyC,EAAEhB,IAAI;gBAAE,IAAKzB,CAAAA,IAAI,CAAA;aAAG;QACnE,MAAMoF,SAAS;eAAIzH,iBAAiBuF,UAAU8B,OAAOG;SAAO,CACzDxG,MAAM,CAAC,CAAC,CAAC8C,MAAMqD,MAAM,GAAKA,QAAQ,QAAQxB,aAAaZ,GAAG,CAACjB,OAC3DjC,IAAI,CAAC,CAACC,GAAGC,IAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE,EAC1BoB,KAAK,CAAC,GAAG6C;QACZ0B,OAAOR,OAAO,CAAC,CAAC,CAACnD,KAAK,EAAEzB;YACtB,MAAMqF,WAAWV,WAAW/C,GAAG,CAACH;YAChC,IAAI4D,UAAU;gBACZA,SAASP,KAAK,IAAI,IAAK/G,CAAAA,QAAQiC,CAAAA;gBAC/B,IAAIiF,OAAOvC,GAAG,CAACjB,OAAO4D,SAASN,GAAG,GAAG;YACvC,OAAO;gBACLJ,WAAWE,GAAG,CAACpD,MAAM;oBAAEqD,OAAO,IAAK/G,CAAAA,QAAQiC,CAAAA;oBAAI+E,KAAK;gBAAO;YAC7D;QACF;IACF;IAEA,sFAAsF;IACtF,0EAA0E;IAC1E,MAAMjC,aAAa,IAAI0B;IACvB,MAAMzB,kBAAkB,IAAIyB;IAC5B,IAAIT,iBAAiB;QACnB,MAAMuB,MAAM,MAAM9H,mBAAmBgE,IAAIa,KAAKtD,OAAO2E,OAAOJ;QAC5DgC,IAAIV,OAAO,CAAC,CAAC,EAAEnD,IAAI,EAAE8D,KAAK,EAAEC,UAAU,EAAE,EAAExF;YACxC8C,WAAW+B,GAAG,CAACpD,MAAM8D;YACrBxC,gBAAgB8B,GAAG,CAACpD,MAAM+D;YAC1B,MAAMH,WAAWV,WAAW/C,GAAG,CAACH;YAChC,IAAI4D,UAAU;gBACZA,SAASP,KAAK,IAAI,IAAK/G,CAAAA,QAAQiC,CAAAA;gBAC/BqF,SAASN,GAAG,GAAG,GAAGM,SAASN,GAAG,CAAC,OAAO,CAAC;YACzC,OAAO;gBACLJ,WAAWE,GAAG,CAACpD,MAAM;oBAAEqD,OAAO,IAAK/G,CAAAA,QAAQiC,CAAAA;oBAAI+E,KAAK;gBAAS;YAC/D;QACF;IACF;IAEAvD,GAAGiE,IAAI,CAAC;IACRjE,GAAGiE,IAAI,CAAC;IACR,MAAMC,SAASlE,GAAGG,OAAO,CAAC;IAC1B,KAAK,MAAM,CAACF,MAAMkE,EAAE,IAAIhB,WAAYe,OAAOE,GAAG,CAACnE,MAAMkE,EAAEb,KAAK,EAAEa,EAAEZ,GAAG,GAAElC,YAAAA,KAAKjB,GAAG,CAACH,mBAAToB,uBAAAA,YAAkB,OAAMC,kBAAAA,WAAWlB,GAAG,CAACH,mBAAfqB,6BAAAA,kBAAwB,OAAMC,uBAAAA,gBAAgBnB,GAAG,CAACH,mBAApBsB,kCAAAA,uBAA6B;IAExJ,yFAAyF;IACzF,2FAA2F;IAC3F,8BAA8B;IAC9B,MAAMS,QAAQQ,QAAQ,CAAC,OAAO,EAAEA,MAAM,CAAC,CAAC,GAAG;IAC3C,sFAAsF;IACtF,2FAA2F;IAC3F,MAAM6B,gBAAgB9B,kBAAkB,yBAAyB;IACjE,MAAMxB,OAAOf,GACVG,OAAO,CACN,CAAC,kIAAkI,EAAEkE,cAAc;;OAElJ,EAAErC,MAAM,oCAAoC,CAAC,EAE/ChB,GAAG,CAACS;IAEP,IAAIyB,UAAUnE,IAAI,GAAG,GAAG;QACtB,MAAMuF,YAAY5H,iBAAiBa;QACnC,KAAK,MAAM2C,OAAOa,KAAM;YACtB,IAAIb,IAAI+C,GAAG,KAAK,QAAQ,CAACC,UAAUhC,GAAG,CAAChB,IAAID,IAAI,GAAa;YAC5D,IAAIhB;YACJ,IAAI;gBACFA,OAAOjE,aAAaC,KAAK4F,IAAI0D,OAAO,EAAErE,IAAID,IAAI,GAAa;YAC7D,EAAE,OAAM;gBACN,UAAU,mEAAmE;YAC/E;YACA,MAAM,EAAEb,OAAO,EAAEE,MAAM,EAAE,GAAGN,eAAeC,MAAMqF;YACjDpE,IAAI+C,GAAG,GAAG7D;YACV,IAAIc,IAAI6D,KAAK,IAAI,MAAM7D,IAAI6D,KAAK,GAAGxI,eAAesF,KAAK,cAAcd,aAAaC,IAAIE,IAAID,IAAI,EAAYL,aAAaX,MAAMK,WAAW;QAC1I;IACF;IAEA,OAAOyB;AACT;AAEA,2FAA2F;AAC3F,uFAAuF;AACvF,mDAAmD;AACnD,SAASa,SAAS5B,EAAgB,EAAEa,GAAmB,EAAE2D,SAA0B,EAAE9C,QAAmB;IACtG,MAAMF,YAAY7F,cAAckF,KAAK2D;IACrC,MAAM,EAAEhE,OAAO,EAAEC,OAAO,EAAE,GAAGe;IAC7B,MAAMiD,aAAaD,UAAUhE,OAAO,KAAKsC,aAAa0B,UAAU/D,OAAO,KAAKqC,aAAa0B,UAAUE,SAAS,KAAK;IACjH,IAAI,CAACD,YAAY,OAAO,IAAI9F,IAAI,AAACqB,GAAGG,OAAO,CAAC,oDAAoDa,GAAG,CAACQ,UAAUc,UAAU,EAA8BvF,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACvK,MAAM0E,QAAQjD,qBAAAA,sBAAAA,WAAY,AAAC1B,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC3H,OAAO,IAAItB,IAAIgG,MAAMxH,MAAM,CAAC,CAACyH,IAAMrE,QAAQqE,GAAGpE,SAASC;AACzD;AAEA,SAASsB,cAAc/B,EAAgB,EAAE2E,KAAkB,EAAE3C,KAAyB;IACpF,IAAI,CAACA,OAAO,OAAO2C;IACnB,MAAME,YAAY7E,GAAGG,OAAO,CAAC,CAAC,wCAAwC,EAAE6B,MAAM,CAAC,CAAC,EAAEhB,GAAG;IACrF,MAAM8D,aAAa,IAAInG,IAAIkG,UAAU9H,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IACtD,OAAO,IAAItB,IAAI;WAAIgG;KAAM,CAACxH,MAAM,CAAC,CAACyH,IAAME,WAAW5D,GAAG,CAAC0D;AACzD;AAEA,4FAA4F;AAC5F,kDAAkD;AAClD,OAAO,SAAS9D,YAAYd,EAAgB,EAAEa,GAAmB,EAAE2D,SAA0B;IAC3F,MAAMhD,YAAY7F,cAAckF,KAAK2D;IACrC,OAAOzC,cAAc/B,IAAI4B,SAAS5B,IAAIa,KAAK2D,YAAYhD,UAAUQ,KAAK;AACxE;AAUA,8FAA8F;AAC9F,0EAA0E;AAC1E,OAAO,SAAS+C,eAAe/E,EAAgB,EAAEa,GAAmB;IAClE,MAAMmE,cAAc5J,gBAAgByF;IACpC,OAAOpF,YAAYoF,KAAK9D,GAAG,CAAC,CAACkI;QAC3B,MAAMC,QAAQ,AAAClF,GAAGG,OAAO,CAAC,2DAA2DC,GAAG,CAAC6E,MAAwBE,CAAC;QAClH,MAAMC,WAAWJ,cAAc,AAAChF,GAAGG,OAAO,CAAC,6JAA6JC,GAAG,CAAC6E,MAAwBE,CAAC,GAAG;QACxO,OAAO;YAAEF;YAAMC;YAAOE;YAAU/C,UAAU3G,sBAAsBmF,KAAKoE;QAAM;IAC7E;AACF;AAaA,MAAMI,mBAAmB,IAAI1G,IAAI;IAAC;IAAQ;IAAU;IAAS;IAAS;CAAe;AAErF,yFAAyF;AACzF,8FAA8F;AAC9F,MAAM2G,mBAAmB;AAEzB,SAASC,MAASC,KAAU,EAAEzG,IAAY;IACxC,MAAMQ,MAAa,EAAE;IACrB,IAAK,IAAIf,IAAI,GAAGA,IAAIgH,MAAMpI,MAAM,EAAEoB,KAAKO,KAAMQ,IAAI1B,IAAI,CAAC2H,MAAMnG,KAAK,CAACb,GAAGA,IAAIO;IACzE,OAAOQ;AACT;AAEA,8FAA8F;AAC9F,yFAAyF;AACzF,SAASoD,iBAAiB3C,EAAgB,EAAEyF,KAAa,EAAEd,KAAkB;IAC3E3E,GAAGiE,IAAI,CAAC,CAAC,qBAAqB,EAAEwB,OAAO;IACvCzF,GAAGiE,IAAI,CAAC,CAAC,kBAAkB,EAAEwB,MAAM,0BAA0B,CAAC;IAC9DzF,GAAGG,OAAO,CAAC,CAAC,YAAY,EAAEsF,MAAM,yCAAyC,CAAC,EAAErB,GAAG,CAACsB,KAAKC,SAAS,CAAC;WAAIhB;KAAM;AAC3G;AAEA,SAASiB,cAAc5F,EAAgB,EAAE2E,KAAkB;IACzDhC,iBAAiB3C,IAAI,cAAc2E;AACrC;AAEA,4FAA4F;AAC5F,8DAA8D;AAC9D,OAAO,SAASkB,QAAQ7F,EAAgB,EAAEa,GAAmB,EAAE2D,YAA6B,CAAC,CAAC;IAC5FoB,cAAc5F,IAAIc,YAAYd,IAAIa,KAAK2D;IACvC,MAAMsB,aAAa;IACnB,MAAMC,WAAW;IAEjB,MAAMC,OAAOhG,GAAGG,OAAO,CAAC,CAAC,8EAA8E,EAAE2F,YAAY,EAAE1F,GAAG;IAE1H,MAAM6F,UAAU,AAACjG,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEgE,IAAI,EAAE9H,MAAM,CAAC,CAAC8H,OAAS,CAACI,iBAAiBnE,GAAG,CAAC+D;IAC1J,6FAA6F;IAC7F,+FAA+F;IAC/F,MAAMiB,YAAmB,EAAE;IAC3B,KAAK,MAAMC,SAASZ,MAAMU,SAASX,kBAAmB;QACpD,MAAMc,QAAQD,MAAMpJ,GAAG,CAAC,CAACkI,MAAMzG;YAC7B,MAAM6H,SAAS,CAAC,CAAC,EAAEpB,KAAKnI,KAAK,CAAC,KAAK7B,IAAI,CAAC,MAAM,CAAC,CAAC;YAChD,OAAO,CAAC,MAAM,EAAEoL,OAAO,MAAM,EAAE7H,EAAE,+BAA+B,EAAE6H,OAAO,iBAAiB,EAAEA,OAAO,kBAAkB,EAAE7H,GAAG;QAC5H;QACA,MAAM8H,SAAStG,GAAGG,OAAO,CAAC,CAAC,OAAO,EAAEiG,MAAMnL,IAAI,CAAC,MAAM,kBAAkB,EAAE6K,YAAY,EAAE1F,GAAG;QAC1F+F,MAAM/C,OAAO,CAAC,CAAC6B,MAAMzG;gBAAgF8H;mBAA1EJ,UAAUrI,IAAI,CAAC;gBAAE0I,OAAOtB;gBAAMuB,UAAUF,MAAM,CAAC,CAAC,CAAC,EAAE9H,GAAG,CAAC;gBAAYiI,IAAI,GAAGH,WAAAA,MAAM,CAAC,CAAC,CAAC,EAAE9H,GAAG,CAAC,cAAf8H,sBAAAA,WAA8B;YAAG;;IACxI;IACAJ,UAAUlI,IAAI,CAAC,CAACC,GAAGC,IAAM,AAACA,EAAEsI,QAAQ,GAAevI,EAAEuI,QAAQ;IAC7D,MAAME,SAASR,UAAU7G,KAAK,CAAC,GAAG;IAElC,MAAMsH,OAAOpL,eAAesF,KAAK,UAAWb,GAAGG,OAAO,CAAC,CAAC,iKAAiK,EAAE4F,SAAS,gCAAgC,CAAC,EAAE/E,GAAG,KAAe,EAAE;IAE3R,MAAM4F,SAAS5G,GAAGG,OAAO,CAAC,CAAC,mFAAmF,EAAE2F,WAAW,+BAA+B,CAAC,EAAE9E,GAAG;IAEhK,2FAA2F;IAC3F,iGAAiG;IACjG,MAAM6F,YAAY7G,GAAGG,OAAO,CAAC,CAAC,sCAAsC,EAAE2F,WAAW,kEAAkE,CAAC,EAAE1F,GAAG;IACzJ,MAAM0G,eAAeD,aAAab,KAAKpH,KAAK,GAAG,KAAKiI,UAAU1B,CAAC,GAAGa,KAAKpH,KAAK,GAAG,IAAI,GAAGiI,UAAU1B,CAAC,CAAC,IAAI,EAAEa,KAAKpH,KAAK,CAAC,iGAAiG,CAAC,GAAG;IAExN,OAAO;QAAEoH;QAAMU;QAAQK,aAAab,UAAU9I,MAAM;QAAE4J,UAAUxL,cAAcqF;QAAMoG,SAASlC,eAAe/E,IAAIa;QAAM8F;QAAMC;QAAQE;IAAa;AACnJ;AAEA,qFAAqF;AACrF,8BAA8B;AAC9B,OAAO,SAASI,YAAYvC,KAAe,EAAEwC,GAAW;IACtD,MAAMC,QAAQzC,MAAM0C,IAAI,CAAC,CAACzC,IAAMA,MAAMuC;IACtC,IAAIC,OAAO,OAAOA;IAClB,MAAME,OAAOnM,MAAMoM,QAAQ,CAACJ,KAAKtK,OAAO,CAAC,UAAU,IAAII,WAAW;IAClE,MAAMuK,UAAU7C,MAAMxH,MAAM,CAAC,CAACyH,IAAMzJ,MAAMoM,QAAQ,CAAC3C,GAAG/H,OAAO,CAAC,UAAU,IAAII,WAAW,OAAOqK;IAC9F,IAAIE,QAAQpK,MAAM,KAAK,GAAG,OAAOoK,OAAO,CAAC,EAAE;IAC3C,IAAIA,QAAQpK,MAAM,GAAG,GAAG,MAAM,IAAIxB,WAAW,kBAAkB,CAAC,CAAC,EAAEuL,IAAI,gBAAgB,EAAEK,QAAQvM,IAAI,CAAC,OAAO;IAC7G,MAAM,IAAIW,WAAW,kBAAkB,CAAC,iBAAiB,EAAEuL,IAAI,CAAC,CAAC;AACnE;AAyBA,MAAMM,kBAAkB;AAExB,qFAAqF;AACrF,8FAA8F;AAC9F,OAAO,SAASC,KAAK1H,EAAgB,EAAEa,GAAmB,EAAE8G,OAAe,EAAEnD,YAA6B,CAAC,CAAC;QAKtFtE,mBAwBEA;IA5BtB,MAAMyE,QAAQ,AAAC3E,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC/G,MAAMA,OAAOiH,YAAYvC,OAAOgD;IAEhC,MAAMzH,MAAMF,GAAGG,OAAO,CAAC,8CAA8CC,GAAG,CAACH;IACzE,MAAM2H,cAAc1H,oBAAAA,IAAI2H,YAAY,cAAhB3H,+BAAAA,oBAAsC;IAC1D,MAAM4H,cAAmB,CAAC;IAC1B,KAAK,MAAM,CAACC,KAAKC,MAAM,IAAIC,OAAOC,OAAO,CAAChI,KAAM;QAC9C,IAAI,CAACmF,iBAAiBnE,GAAG,CAAC6G,QAAQC,UAAU,MAAMF,WAAW,CAACC,IAAI,GAAGC;IACvE;IAEA,MAAMG,gBAAgB5M,eAAesF,KAAK,cAAc,AAACb,GAAGG,OAAO,CAAC,uDAAuDC,GAAG,CAACH,MAAwBkF,CAAC,GAAG;IAC3J,MAAMiD,WAAW7M,eAAesF,KAAK,cAAeb,GAAGG,OAAO,CAAC,2GAA2Ga,GAAG,CAACf,MAAMwH,mBAA6B,EAAE;IAEnN,IAAIY,WAAqB,EAAE;IAC3B,IAAIC,YAAsB,EAAE;IAC5B,IAAIC,aAAuB,EAAE;IAC7B,IAAIC,iBAAiB;IACrB,MAAMC,WAAW3H,YAAYd,IAAIa,KAAK2D;IACtC,IAAIjJ,eAAesF,KAAK,UAAU;QAChC,MAAMtB,MAAMS,GAAGG,OAAO,CAAC,+DAA+Da,GAAG,CAACf;QAC1FoI,WAAW;eAAI,IAAI1J,IAAIY,IAAIpC,MAAM,CAAC,CAACuL,IAAMA,EAAEC,GAAG,KAAK,MAAM5L,GAAG,CAAC,CAAC2L,IAAMA,EAAEC,GAAG;SAAa;QACtFJ,aAAahJ,IAAIpC,MAAM,CAAC,CAACuL,IAAMA,EAAEC,GAAG,KAAK,MAAM5L,GAAG,CAAC,CAAC2L,IAAMA,EAAEE,MAAM;QAClEJ,iBAAiB,AAACxI,GAAGG,OAAO,CAAC,4DAA4DC,GAAG,CAACH,MAAwBkF,CAAC;QACtHmD,YAAY,AAACtI,GAAGG,OAAO,CAAC,qEAAqEa,GAAG,CAACf,MAAMwH,iBAA4C1K,GAAG,CAAC,CAACkE,IAAMA,EAAE4H,GAAG;IACrK;IAEA,OAAO;QACL5I;QACA6I,QAAQ5J,KAAK6J,IAAI,CAAC,EAAE7I,aAAAA,IAAI8I,KAAK,cAAT9I,wBAAAA,aAAwB,KAAK;QACjD4H;QACAF;QACAQ;QACAC,UAAUA,SAAShJ,KAAK,CAAC,GAAGoI;QAC5Ba;QACAC,YAAYA,WAAWlJ,KAAK,CAAC,GAAGoI;QAChCU;QACAc,eAAeZ,SAASjL,MAAM;QAC9BoL;QACAU,iBAAiBX,WAAWnL,MAAM;QAClC+L,KAAK,AAAC;YAAC;YAAY;SAAQ,CAAmBhM,MAAM,CAAC,CAAC8H,OAAS,CAAC1J,eAAesF,KAAKoE;IACtF;AACF;AAEA,yFAAyF;AACzF,sFAAsF;AACtF,OAAO,eAAemE,aAAapJ,EAAgB,EAAEa,GAAmB,EAAE8G,OAAe,EAAEnD,SAA0B,EAAE/C,CAAS;IAC9H,MAAMkD,QAAQ,AAAC3E,GAAGG,OAAO,CAAC,kCAAkCa,GAAG,GAA+BjE,GAAG,CAAC,CAACkE,IAAMA,EAAEhB,IAAI;IAC/G,MAAMA,OAAOiH,YAAYvC,OAAOgD;IAEhC,MAAMU,WAAW,AAACrI,GAAGG,OAAO,CAAC,oEAAoEa,GAAG,CAACf,MAAiClD,GAAG,CAAC,CAACkE,IAAMA,EAAE0H,GAAG;IACtJ,MAAML,YAAY,AAACtI,GAAGG,OAAO,CAAC,gDAAgDa,GAAG,CAACf,MAAiClD,GAAG,CAAC,CAACkE,IAAMA,EAAE4H,GAAG;IACnI,MAAMpI,UAAU,IAAI9B,IAAI;QAACsB;WAASoI;WAAaC;KAAU;IAEzD,yFAAyF;IACzF,2FAA2F;IAC3F,yDAAyD;IACzD,MAAM9G,YAAY7F,cAAckF,KAAK2D;IACrC,IAAI,CAAClJ,aAAauF,MAAM;QACtB,MAAM,IAAIjF,WAAW,kBAAkB;IACzC;IACA,oFAAoF;IACpF,yFAAyF;IACzF,uDAAuD;IACvD,IAAI,CAAC4F,UAAUa,QAAQ,EAAE;QACvB,MAAM,IAAIzG,WAAW,uBAAuB,CAAC,QAAQ,EAAE4F,UAAUc,UAAU,CAAC,oKAAoK,CAAC;IACnP;IACA,IAAI,CAACvG,aAAa8E,MAAM;QACtB,MAAM,IAAIjF,WAAW,uBAAuB;IAC9C;IACA,MAAMyN,UAAUvI,YAAYd,IAAIa,KAAK2D;IACrC,oFAAoF;IACpF,oDAAoD;IACpD,MAAM3I,aAAamE,IAAIa,KAAKA,IAAI0D,OAAO;IACvC,IAAI,CAACzI,aAAakE,IAAIC,OAAO;QAC3B,MAAM,IAAIrE,WAAW,qBAAqB,GAAGqE,KAAK,4GAA4G,CAAC;IACjK;IACA,IAAI,CAACW,mBAAmBZ,IAAIa,KAAKwI,UAAU,OAAO,EAAE;IACpD,OAAOpN,aAAa+D,IAAIa,KAAKZ,MAAM;QAAEQ;QAAS4I;QAAS5H;IAAE;AAC3D"}