@cleocode/core 2026.4.41 → 2026.4.43

package/dist/memory/brain-search.js

@@ -1,613 +0,0 @@
-/**
- * Full-text search across BRAIN memory using SQLite FTS5.
- * Uses raw SQL via nativeDb because drizzle doesn't support FTS5 virtual tables.
- *
- * Falls back to LIKE queries if FTS5 is not available (some SQLite builds lack it).
- *
- * @task T5130
- * @epic T5149
- */
-import { getBrainAccessor } from '../store/brain-accessor.js';
-import { typedAll } from '../store/typed-query.js';
-import { searchSimilar } from './brain-similarity.js';
-import { QUALITY_SCORE_THRESHOLD } from './quality-scoring.js';
-/** Track whether FTS5 is available in the current SQLite build. */
-let _fts5Available = null;
-/** Track whether FTS tables have been created and indexed this session. */
-let _fts5Initialized = false;
-/**
- * Check if FTS5 is available in the current SQLite build.
- */
-function checkFts5Available(nativeDb) {
-    if (_fts5Available !== null)
-        return _fts5Available;
-    try {
-        // Use run() to execute DDL statements
-        nativeDb.prepare('CREATE VIRTUAL TABLE IF NOT EXISTS _fts5_check USING fts5(test)').run();
-        nativeDb.prepare('DROP TABLE IF EXISTS _fts5_check').run();
-        _fts5Available = true;
-    }
-    catch {
-        _fts5Available = false;
-    }
-    return _fts5Available;
-}
-/**
- * Execute a DDL statement using the native database.
- * Wraps nativeDb.prepare().run() for consistent usage.
- */
-function execDDL(nativeDb, sql) {
-    nativeDb.prepare(sql).run();
-}
-/**
- * Create FTS5 virtual tables and content-sync triggers if they don't exist.
- *
- * Uses content= to sync from main tables, so inserts to main tables
- * auto-populate FTS. UPDATE/DELETE require triggers.
- *
- * @task T5130
- */
-export function ensureFts5Tables(nativeDb) {
-    if (!checkFts5Available(nativeDb)) {
-        return false;
-    }
-    // Decisions FTS
-    execDDL(nativeDb, `
-    CREATE VIRTUAL TABLE IF NOT EXISTS brain_decisions_fts
-    USING fts5(id, decision, rationale, content=brain_decisions, content_rowid=rowid)
-  `);
-    // Patterns FTS
-    execDDL(nativeDb, `
-    CREATE VIRTUAL TABLE IF NOT EXISTS brain_patterns_fts
-    USING fts5(id, pattern, context, content=brain_patterns, content_rowid=rowid)
-  `);
-    // Learnings FTS
-    execDDL(nativeDb, `
-    CREATE VIRTUAL TABLE IF NOT EXISTS brain_learnings_fts
-    USING fts5(id, insight, source, content=brain_learnings, content_rowid=rowid)
-  `);
-    // Content-sync triggers for decisions
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_decisions_ai AFTER INSERT ON brain_decisions BEGIN
-      INSERT INTO brain_decisions_fts(rowid, id, decision, rationale)
-      VALUES (new.rowid, new.id, new.decision, new.rationale);
-    END
-  `);
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_decisions_ad AFTER DELETE ON brain_decisions BEGIN
-      INSERT INTO brain_decisions_fts(brain_decisions_fts, rowid, id, decision, rationale)
-      VALUES('delete', old.rowid, old.id, old.decision, old.rationale);
-    END
-  `);
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_decisions_au AFTER UPDATE ON brain_decisions BEGIN
-      INSERT INTO brain_decisions_fts(brain_decisions_fts, rowid, id, decision, rationale)
-      VALUES('delete', old.rowid, old.id, old.decision, old.rationale);
-      INSERT INTO brain_decisions_fts(rowid, id, decision, rationale)
-      VALUES (new.rowid, new.id, new.decision, new.rationale);
-    END
-  `);
-    // Content-sync triggers for patterns
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_patterns_ai AFTER INSERT ON brain_patterns BEGIN
-      INSERT INTO brain_patterns_fts(rowid, id, pattern, context)
-      VALUES (new.rowid, new.id, new.pattern, new.context);
-    END
-  `);
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_patterns_ad AFTER DELETE ON brain_patterns BEGIN
-      INSERT INTO brain_patterns_fts(brain_patterns_fts, rowid, id, pattern, context)
-      VALUES('delete', old.rowid, old.id, old.pattern, old.context);
-    END
-  `);
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_patterns_au AFTER UPDATE ON brain_patterns BEGIN
-      INSERT INTO brain_patterns_fts(brain_patterns_fts, rowid, id, pattern, context)
-      VALUES('delete', old.rowid, old.id, old.pattern, old.context);
-      INSERT INTO brain_patterns_fts(rowid, id, pattern, context)
-      VALUES (new.rowid, new.id, new.pattern, new.context);
-    END
-  `);
-    // Content-sync triggers for learnings
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_learnings_ai AFTER INSERT ON brain_learnings BEGIN
-      INSERT INTO brain_learnings_fts(rowid, id, insight, source)
-      VALUES (new.rowid, new.id, new.insight, new.source);
-    END
-  `);
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_learnings_ad AFTER DELETE ON brain_learnings BEGIN
-      INSERT INTO brain_learnings_fts(brain_learnings_fts, rowid, id, insight, source)
-      VALUES('delete', old.rowid, old.id, old.insight, old.source);
-    END
-  `);
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_learnings_au AFTER UPDATE ON brain_learnings BEGIN
-      INSERT INTO brain_learnings_fts(brain_learnings_fts, rowid, id, insight, source)
-      VALUES('delete', old.rowid, old.id, old.insight, old.source);
-      INSERT INTO brain_learnings_fts(rowid, id, insight, source)
-      VALUES (new.rowid, new.id, new.insight, new.source);
-    END
-  `);
-    // Observations FTS
-    execDDL(nativeDb, `
-    CREATE VIRTUAL TABLE IF NOT EXISTS brain_observations_fts
-    USING fts5(id, title, narrative, content=brain_observations, content_rowid=rowid)
-  `);
-    // Content-sync triggers for observations
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_observations_ai AFTER INSERT ON brain_observations BEGIN
-      INSERT INTO brain_observations_fts(rowid, id, title, narrative)
-      VALUES (new.rowid, new.id, new.title, new.narrative);
-    END
-  `);
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_observations_ad AFTER DELETE ON brain_observations BEGIN
-      INSERT INTO brain_observations_fts(brain_observations_fts, rowid, id, title, narrative)
-      VALUES('delete', old.rowid, old.id, old.title, old.narrative);
-    END
-  `);
-    execDDL(nativeDb, `
-    CREATE TRIGGER IF NOT EXISTS brain_observations_au AFTER UPDATE ON brain_observations BEGIN
-      INSERT INTO brain_observations_fts(brain_observations_fts, rowid, id, title, narrative)
-      VALUES('delete', old.rowid, old.id, old.title, old.narrative);
-      INSERT INTO brain_observations_fts(rowid, id, title, narrative)
-      VALUES (new.rowid, new.id, new.title, new.narrative);
-    END
-  `);
-    return true;
-}
-/**
- * Rebuild FTS5 indexes from the content tables.
- * Useful after bulk inserts that bypass triggers.
- *
- * @task T5130
- */
-export function rebuildFts5Index(nativeDb) {
-    if (!checkFts5Available(nativeDb)) {
-        return;
-    }
-    nativeDb.prepare("INSERT INTO brain_decisions_fts(brain_decisions_fts) VALUES('rebuild')").run();
-    nativeDb.prepare("INSERT INTO brain_patterns_fts(brain_patterns_fts) VALUES('rebuild')").run();
-    nativeDb.prepare("INSERT INTO brain_learnings_fts(brain_learnings_fts) VALUES('rebuild')").run();
-    // Observations FTS rebuild — table may not exist yet in older DBs
-    try {
-        nativeDb
-            .prepare("INSERT INTO brain_observations_fts(brain_observations_fts) VALUES('rebuild')")
-            .run();
-    }
-    catch {
-        // brain_observations_fts not created yet — skip
-    }
-}
-/**
- * Unified search across all BRAIN memory tables.
- *
- * Uses FTS5 MATCH for full-text search with BM25 ranking when available,
- * falls back to LIKE queries otherwise.
- *
- * @task T5130
- */
-export async function searchBrain(projectRoot, query, options) {
-    if (!query?.trim()) {
-        return { decisions: [], patterns: [], learnings: [], observations: [] };
-    }
-    // Ensure brain.db is initialized
-    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    await getBrainDb(projectRoot);
-    const nativeDb = getBrainNativeDb();
-    if (!nativeDb) {
-        return { decisions: [], patterns: [], learnings: [], observations: [] };
-    }
-    const limit = options?.limit ?? 10;
-    const tables = options?.tables ?? ['decisions', 'patterns', 'learnings', 'observations'];
-    const ftsAvailable = ensureFts5Tables(nativeDb);
-    if (ftsAvailable) {
-        // On first initialization, rebuild FTS indexes to sync any data
-        // that was inserted before the FTS triggers existed.
-        if (!_fts5Initialized) {
-            _fts5Initialized = true;
-            rebuildFts5Index(nativeDb);
-        }
-        return searchWithFts5(nativeDb, query, tables, limit);
-    }
-    return searchWithLike(nativeDb, query, tables, limit);
-}
-/**
- * Search using FTS5 MATCH with BM25 ranking.
- */
-function searchWithFts5(nativeDb, query, tables, limit) {
-    const result = {
-        decisions: [],
-        patterns: [],
-        learnings: [],
-        observations: [],
-    };
-    // Escape FTS5 special characters for safety
-    const safeQuery = escapeFts5Query(query);
-    if (tables.includes('decisions')) {
-        try {
-            const rows = typedAll(nativeDb.prepare(`
-        SELECT d.*
-        FROM brain_decisions_fts fts
-        JOIN brain_decisions d ON d.rowid = fts.rowid
-        WHERE brain_decisions_fts MATCH ?
-          AND (d.quality_score IS NULL OR d.quality_score >= ?)
-        ORDER BY bm25(brain_decisions_fts)
-        LIMIT ?
-      `), safeQuery, QUALITY_SCORE_THRESHOLD, limit);
-            result.decisions = rows;
-        }
-        catch {
-            // FTS query failed, fall back to LIKE for this table
-            result.decisions = likeSearchDecisions(nativeDb, query, limit);
-        }
-    }
-    if (tables.includes('patterns')) {
-        try {
-            const rows = typedAll(nativeDb.prepare(`
-        SELECT p.*
-        FROM brain_patterns_fts fts
-        JOIN brain_patterns p ON p.rowid = fts.rowid
-        WHERE brain_patterns_fts MATCH ?
-          AND (p.quality_score IS NULL OR p.quality_score >= ?)
-        ORDER BY bm25(brain_patterns_fts)
-        LIMIT ?
-      `), safeQuery, QUALITY_SCORE_THRESHOLD, limit);
-            result.patterns = rows;
-        }
-        catch {
-            result.patterns = likeSearchPatterns(nativeDb, query, limit);
-        }
-    }
-    if (tables.includes('learnings')) {
-        try {
-            const rows = typedAll(nativeDb.prepare(`
-        SELECT l.*
-        FROM brain_learnings_fts fts
-        JOIN brain_learnings l ON l.rowid = fts.rowid
-        WHERE brain_learnings_fts MATCH ?
-          AND (l.quality_score IS NULL OR l.quality_score >= ?)
-        ORDER BY bm25(brain_learnings_fts)
-        LIMIT ?
-      `), safeQuery, QUALITY_SCORE_THRESHOLD, limit);
-            result.learnings = rows;
-        }
-        catch {
-            result.learnings = likeSearchLearnings(nativeDb, query, limit);
-        }
-    }
-    if (tables.includes('observations')) {
-        try {
-            const rows = typedAll(nativeDb.prepare(`
-        SELECT o.*
-        FROM brain_observations_fts fts
-        JOIN brain_observations o ON o.rowid = fts.rowid
-        WHERE brain_observations_fts MATCH ?
-          AND (o.quality_score IS NULL OR o.quality_score >= ?)
-        ORDER BY bm25(brain_observations_fts)
-        LIMIT ?
-      `), safeQuery, QUALITY_SCORE_THRESHOLD, limit);
-            result.observations = rows;
-        }
-        catch {
-            result.observations = likeSearchObservations(nativeDb, query, limit);
-        }
-    }
-    return result;
-}
-/**
- * Search using LIKE queries as fallback when FTS5 is unavailable.
- */
-function searchWithLike(nativeDb, query, tables, limit) {
-    const result = {
-        decisions: [],
-        patterns: [],
-        learnings: [],
-        observations: [],
-    };
-    if (tables.includes('decisions')) {
-        result.decisions = likeSearchDecisions(nativeDb, query, limit);
-    }
-    if (tables.includes('patterns')) {
-        result.patterns = likeSearchPatterns(nativeDb, query, limit);
-    }
-    if (tables.includes('learnings')) {
-        result.learnings = likeSearchLearnings(nativeDb, query, limit);
-    }
-    if (tables.includes('observations')) {
-        result.observations = likeSearchObservations(nativeDb, query, limit);
-    }
-    return result;
-}
-function likeSearchDecisions(nativeDb, query, limit) {
-    const likePattern = `%${query}%`;
-    return typedAll(nativeDb.prepare(`
-    SELECT * FROM brain_decisions
-    WHERE (decision LIKE ? OR rationale LIKE ?)
-      AND (quality_score IS NULL OR quality_score >= ?)
-    ORDER BY created_at DESC
-    LIMIT ?
-  `), likePattern, likePattern, QUALITY_SCORE_THRESHOLD, limit);
-}
-function likeSearchPatterns(nativeDb, query, limit) {
-    const likePattern = `%${query}%`;
-    return typedAll(nativeDb.prepare(`
-    SELECT * FROM brain_patterns
-    WHERE (pattern LIKE ? OR context LIKE ?)
-      AND (quality_score IS NULL OR quality_score >= ?)
-    ORDER BY frequency DESC
-    LIMIT ?
-  `), likePattern, likePattern, QUALITY_SCORE_THRESHOLD, limit);
-}
-function likeSearchLearnings(nativeDb, query, limit) {
-    const likePattern = `%${query}%`;
-    return typedAll(nativeDb.prepare(`
-    SELECT * FROM brain_learnings
-    WHERE (insight LIKE ? OR source LIKE ?)
-      AND (quality_score IS NULL OR quality_score >= ?)
-    ORDER BY confidence DESC
-    LIMIT ?
-  `), likePattern, likePattern, QUALITY_SCORE_THRESHOLD, limit);
-}
-function likeSearchObservations(nativeDb, query, limit) {
-    const likePattern = `%${query}%`;
-    return typedAll(nativeDb.prepare(`
-    SELECT * FROM brain_observations
-    WHERE (title LIKE ? OR narrative LIKE ?)
-      AND (quality_score IS NULL OR quality_score >= ?)
-    ORDER BY created_at DESC
-    LIMIT ?
-  `), likePattern, likePattern, QUALITY_SCORE_THRESHOLD, limit);
-}
-/**
- * Escape special FTS5 characters in query string.
- *
- * Wraps each meaningful token in double quotes and joins with OR so that
- * partial matches are returned even when some tokens are not indexable
- * (e.g. task prefixes like "EPIC:", em-dashes "—", or short stop-words).
- *
- * Strategy:
- *   1. Split on whitespace.
- *   2. Keep only tokens that contain at least one word character (\w), which
- *      ensures punctuation-only tokens (em dashes, colons standalone, etc.)
- *      are dropped before they zero-out the entire result set.
- *   3. Deduplicate case-insensitively.
- *   4. Join with OR so the query broadens rather than requiring ALL tokens.
- *
- * Using AND (implicit FTS5 join) caused empty results whenever a task title
- * contained non-word tokens such as em dashes ("—") or trailing colons
- * ("EPIC:"), because FTS5's default tokenizer cannot index them and the
- * AND semantics then guaranteed zero matches for the whole query. (T553 bug fix)
- */
-function escapeFts5Query(query) {
-    const rawTokens = query.trim().split(/\s+/).filter(Boolean);
-    if (rawTokens.length === 0)
-        return '""';
-    // Keep tokens that have at least one alphanumeric character and are not
-    // pure stop-words (length ≥ 2 after stripping leading/trailing punctuation).
-    const seen = new Set();
-    const tokens = [];
-    for (const t of rawTokens) {
-        // Strip leading/trailing non-word characters (e.g. "EPIC:" → "EPIC", "—" → "")
-        const stripped = t.replace(/^\W+|\W+$/g, '');
-        if (stripped.length < 2)
-            continue; // skip very short or empty tokens
-        if (!/\w/.test(stripped))
-            continue; // skip tokens with no word chars
-        const lower = stripped.toLowerCase();
-        if (seen.has(lower))
-            continue; // deduplicate
-        seen.add(lower);
-        tokens.push(`"${stripped.replace(/"/g, '""')}"`);
-    }
-    if (tokens.length === 0)
-        return '""';
-    // OR semantics: any matching token returns the row, ranked by BM25 relevance.
-    return tokens.join(' OR ');
-}
-/**
- * Reset the cached FTS5 availability flag.
- * Used in tests to force re-detection.
- */
-export function resetFts5Cache() {
-    _fts5Available = null;
-    _fts5Initialized = false;
-}
-// ============================================================================
-// Reciprocal Rank Fusion (RRF) — Hybrid Retrieval
-// ============================================================================
-/**
- * The RRF smoothing constant (research-proven at 60).
- *
- * Balances noise vs. signal: small values amplify top-rank differences;
- * large values compress ranks toward a flat distribution. 60 is the
- * standard value from Cormack, Clarke & Buettcher (SIGIR 2009).
- */
-export const RRF_K = 60;
-/**
- * Fuse ranked lists from multiple retrieval sources using Reciprocal Rank Fusion.
- *
- * Implements the RRF algorithm from Cormack, Clarke & Buettcher (SIGIR 2009):
- *
- *   score(d) = Σ 1 / (k + rank(d, list))  for each list containing d
- *
- * where k=60 is the research-proven smoothing constant.
- *
- * Properties:
- * - Rank-based: actual scores from each source are ignored (only rank matters).
- * - Additive: items appearing in multiple lists accumulate higher scores.
- * - Robust: the +60 constant prevents rank-1 items from dominating.
- *
- * @param sources - Named arrays of ranked hits (order = rank, index 0 = best)
- * @param k - RRF smoothing constant (default: RRF_K = 60)
- * @returns Array of fused results sorted by rrfScore descending
- *
- * @example
- * ```ts
- * const fused = reciprocalRankFusion([
- *   { source: 'fts', hits: ftsHits },
- *   { source: 'vec', hits: vecHits },
- * ]);
- * ```
- */
-export function reciprocalRankFusion(sources, k = RRF_K) {
-    // Accumulator: id -> mutable result record
-    const accum = new Map();
-    for (const { source, hits } of sources) {
-        for (let rank = 0; rank < hits.length; rank++) {
-            const hit = hits[rank];
-            const contribution = 1 / (k + rank);
-            const existing = accum.get(hit.id);
-            if (existing) {
-                existing.rrfScore += contribution;
-                existing.sources.add(source);
-                if (source === 'fts')
-                    existing.ftsRank = rank;
-                if (source === 'vec')
-                    existing.vecRank = rank;
-            }
-            else {
-                accum.set(hit.id, {
-                    rrfScore: contribution,
-                    type: hit.type,
-                    title: hit.title,
-                    text: hit.text,
-                    sources: new Set([source]),
-                    ftsRank: source === 'fts' ? rank : undefined,
-                    vecRank: source === 'vec' ? rank : undefined,
-                });
-            }
-        }
-    }
-    return [...accum.entries()]
-        .map(([id, data]) => ({
-        id,
-        rrfScore: data.rrfScore,
-        type: data.type,
-        title: data.title,
-        text: data.text,
-        sources: [...data.sources],
-        ftsRank: data.ftsRank,
-        vecRank: data.vecRank,
-    }))
-        .sort((a, b) => b.rrfScore - a.rrfScore);
-}
-/**
- * Hybrid search across FTS5, vector similarity, and graph neighbors using
- * Reciprocal Rank Fusion (RRF) for result combination.
- *
- * Algorithm:
- * 1. Run FTS5 search and vector similarity search in parallel.
- * 2. Optionally expand via graph neighbors (best-effort).
- * 3. Fuse all ranked lists with RRF: score = Σ 1/(rank+60).
- * 4. Return top-N sorted by fused RRF score.
- *
- * Graceful degradation: vector and graph sources are silently skipped when
- * unavailable — RRF naturally handles partial source lists.
- *
- * @param query - Search query text
- * @param projectRoot - Project root directory
- * @param options - Limit and RRF tuning
- * @returns Array of hybrid results ranked by RRF score descending
- */
-export async function hybridSearch(query, projectRoot, options) {
-    if (!query?.trim())
-        return [];
-    const maxResults = options?.limit ?? 10;
-    const rrfK = options?.rrfK ?? RRF_K;
-    // --- 1. Run FTS5 and vector in parallel ---
-    const [ftsResults, vecResults] = await Promise.all([
-        searchBrain(projectRoot, query, { limit: maxResults * 3 }).catch(() => ({
-            decisions: [],
-            patterns: [],
-            learnings: [],
-            observations: [],
-        })),
-        searchSimilar(query, projectRoot, maxResults * 3).catch(() => []),
-    ]);
-    // --- 2. Project FTS results into ranked RrfHit list ---
-    const ftsHits = [];
-    for (const d of ftsResults.decisions) {
-        ftsHits.push({
-            id: d.id,
-            type: 'decision',
-            title: d.decision,
-            text: `${d.decision} — ${d.rationale}`,
-        });
-    }
-    for (const p of ftsResults.patterns) {
-        ftsHits.push({
-            id: p.id,
-            type: 'pattern',
-            title: p.pattern,
-            text: `${p.pattern} — ${p.context}`,
-        });
-    }
-    for (const l of ftsResults.learnings) {
-        ftsHits.push({
-            id: l.id,
-            type: 'learning',
-            title: l.insight,
-            text: `${l.insight} (source: ${l.source})`,
-        });
-    }
-    for (const o of ftsResults.observations) {
-        ftsHits.push({ id: o.id, type: 'observation', title: o.title, text: o.narrative ?? o.title });
-    }
-    // --- 3. Project vector results into ranked RrfHit list (ascending distance = descending quality) ---
-    const vecHits = vecResults.map((r) => ({
-        id: r.id,
-        type: r.type,
-        title: r.title,
-        text: r.text,
-    }));
-    // --- 4. Build source list for RRF ---
-    const rrfSources = [];
-    if (ftsHits.length > 0)
-        rrfSources.push({ source: 'fts', hits: ftsHits });
-    if (vecHits.length > 0)
-        rrfSources.push({ source: 'vec', hits: vecHits });
-    // --- 5. Graph neighbor expansion (best-effort) ---
-    try {
-        const accessor = await getBrainAccessor(projectRoot);
-        const possibleNodeIds = [
-            `concept:${query.toLowerCase().replace(/\s+/g, '-')}`,
-            `task:${query}`,
-            `doc:${query}`,
-        ];
-        const graphHits = [];
-        for (const nodeId of possibleNodeIds) {
-            const node = await accessor.getPageNode(nodeId);
-            if (!node)
-                continue;
-            const neighbors = await accessor.getNeighbors(nodeId);
-            for (const neighbor of neighbors) {
-                graphHits.push({
-                    id: neighbor.id,
-                    type: neighbor.nodeType,
-                    title: neighbor.label,
-                    text: neighbor.label,
-                });
-            }
-        }
-        if (graphHits.length > 0)
-            rrfSources.push({ source: 'graph', hits: graphHits });
-    }
-    catch {
-        // Graph unavailable — RRF handles gracefully with remaining sources
-    }
-    // --- 6. Fuse with RRF and return top-N ---
-    const fused = reciprocalRankFusion(rrfSources, rrfK);
-    return fused.slice(0, maxResults).map((r) => ({
-        id: r.id,
-        score: r.rrfScore,
-        type: r.type,
-        title: r.title,
-        text: r.text,
-        sources: r.sources,
-        ftsRank: r.ftsRank,
-        vecRank: r.vecRank,
-    }));
-}
-//# sourceMappingURL=brain-search.js.map

package/dist/memory/brain-search.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"brain-search.js","sourceRoot":"","sources":["../../src/memory/brain-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAO9D,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAEnD,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAkB/D,mEAAmE;AACnE,IAAI,cAAc,GAAmB,IAAI,CAAC;AAE1C,2EAA2E;AAC3E,IAAI,gBAAgB,GAAG,KAAK,CAAC;AAE7B;;GAEG;AACH,SAAS,kBAAkB,CAAC,QAAsB;IAChD,IAAI,cAAc,KAAK,IAAI;QAAE,OAAO,cAAc,CAAC;IACnD,IAAI,CAAC;QACH,sCAAsC;QACtC,QAAQ,CAAC,OAAO,CAAC,iEAAiE,CAAC,CAAC,GAAG,EAAE,CAAC;QAC1F,QAAQ,CAAC,OAAO,CAAC,kCAAkC,CAAC,CAAC,GAAG,EAAE,CAAC;QAC3D,cAAc,GAAG,IAAI,CAAC;IACxB,CAAC;IAAC,MAAM,CAAC;QACP,cAAc,GAAG,KAAK,CAAC;IACzB,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,QAAsB,EAAE,GAAW;IAClD,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;AAC9B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAsB;IACrD,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gBAAgB;IAChB,OAAO,CACL,QAAQ,EACR;;;GAGD,CACA,CAAC;IAEF,eAAe;IACf,OAAO,CACL,QAAQ,EACR;;;GAGD,CACA,CAAC;IAEF,gBAAgB;IAChB,OAAO,CACL,QAAQ,EACR;;;GAGD,CACA,CAAC;IAEF,sCAAsC;IACtC,OAAO,CACL,QAAQ,EACR;;;;;GAKD,CACA,CAAC;IACF,OAAO,CACL,QAAQ,EACR;;;;;GAKD,CACA,CAAC;IACF,OAAO,CACL,QAAQ,EACR;;;;;;;GAOD,CACA,CAAC;IAEF,qCAAqC;IACrC,OAAO,CACL,QAAQ,EACR;;;;;GAKD,CACA,CAAC;IACF,OAAO,CACL,QAAQ,EACR;;;;;GAKD,CACA,CAAC;IACF,OAAO,CACL,QAAQ,EACR;;;;;;;GAOD,CACA,CAAC;IAEF,sCAAsC;IACtC,OAAO,CACL,QAAQ,EACR;;;;;GAKD,CACA,CAAC;IACF,OAAO,CACL,QAAQ,EACR;;;;;GAKD,CACA,CAAC;IACF,OAAO,CACL,QAAQ,EACR;;;;;;;GAOD,CACA,CAAC;IAEF,mBAAmB;IACnB,OAAO,CACL,QAAQ,EACR;;;GAGD,CACA,CAAC;IAEF,yCAAyC;IACzC,OAAO,CACL,QAAQ,EACR;;;;;GAKD,CACA,CAAC;IACF,OAAO,CACL,QAAQ,EACR;;;;;GAKD,CACA,CAAC;IACF,OAAO,CACL,QAAQ,EACR;;;;;;;GAOD,CACA,CAAC;IAEF,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAsB;IACrD,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO;IACT,CAAC;IAED,QAAQ,CAAC,OAAO,CAAC,wEAAwE,CAAC,CAAC,GAAG,EAAE,CAAC;IACjG,QAAQ,CAAC,OAAO,CAAC,sEAAsE,CAAC,CAAC,GAAG,EAAE,CAAC;IAC/F,QAAQ,CAAC,OAAO,CAAC,wEAAwE,CAAC,CAAC,GAAG,EAAE,CAAC;IAEjG,kEAAkE;IAClE,IAAI,CAAC;QACH,QAAQ;aACL,OAAO,CAAC,8EAA8E,CAAC;aACvF,GAAG,EAAE,CAAC;IACX,CAAC;IAAC,MAAM,CAAC;QACP,gDAAgD;IAClD,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,WAAmB,EACnB,KAAa,EACb,OAA4B;IAE5B,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACnB,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;IAC1E,CAAC;IAED,iCAAiC;IACjC,MAAM,EAAE,UAAU,EAAE,gBAAgB,EAAE,GAAG,MAAM,MAAM,CAAC,0BAA0B,CAAC,CAAC;IAClF,MAAM,UAAU,CAAC,WAAW,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,gBAAgB,EAAE,CAAC;IAEpC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;IAC1E,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;IACnC,MAAM,MAAM,GAAG,OAAO,EAAE,MAAM,IAAI,CAAC,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;IAEzF,MAAM,YAAY,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAEhD,IAAI,YAAY,EAAE,CAAC;QACjB,gEAAgE;QAChE,qDAAqD;QACrD,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,gBAAgB,GAAG,IAAI,CAAC;YACxB,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CACrB,QAAsB,EACtB,KAAa,EACb,MAAsE,EACtE,KAAa;IAEb,MAAM,MAAM,GAAsB;QAChC,SAAS,EAAE,EAAE;QACb,QAAQ,EAAE,EAAE;QACZ,SAAS,EAAE,EAAE;QACb,YAAY,EAAE,EAAE;KACjB,CAAC;IAEF,4CAA4C;IAC5C,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAEzC,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACjC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,QAAQ,CACnB,QAAQ,CAAC,OAAO,CAAC;;;;;;;;OAQlB,CAAC,EACA,SAAS,EACT,uBAAuB,EACvB,KAAK,CACN,CAAC;YACF,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,qDAAqD;YACrD,MAAM,CAAC,SAAS,GAAG,mBAAmB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QAChC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,QAAQ,CACnB,QAAQ,CAAC,OAAO,CAAC;;;;;;;;OAQlB,CAAC,EACA,SAAS,EACT,uBAAuB,EACvB,KAAK,CACN,CAAC;YACF,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC;QACzB,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,CAAC,QAAQ,GAAG,kBAAkB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACjC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,QAAQ,CACnB,QAAQ,CAAC,OAAO,CAAC;;;;;;;;OAQlB,CAAC,EACA,SAAS,EACT,uBAAuB,EACvB,KAAK,CACN,CAAC;YACF,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,CAAC,SAAS,GAAG,mBAAmB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,QAAQ,CACnB,QAAQ,CAAC,OAAO,CAAC;;;;;;;;OAQlB,CAAC,EACA,SAAS,EACT,uBAAuB,EACvB,KAAK,CACN,CAAC;YACF,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC;QAC7B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,CAAC,YAAY,GAAG,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CACrB,QAAsB,EACtB,KAAa,EACb,MAAsE,EACtE,KAAa;IAEb,MAAM,MAAM,GAAsB;QAChC,SAAS,EAAE,EAAE;QACb,QAAQ,EAAE,EAAE;QACZ,SAAS,EAAE,EAAE;QACb,YAAY,EAAE,EAAE;KACjB,CAAC;IAEF,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACjC,MAAM,CAAC,SAAS,GAAG,mBAAmB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACjE,CAAC;IAED,IAAI,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,QAAQ,GAAG,kBAAkB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/D,CAAC;IAED,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACjC,MAAM,CAAC,SAAS,GAAG,mBAAmB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACjE,CAAC;IAED,IAAI,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;QACpC,MAAM,CAAC,YAAY,GAAG,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACvE,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,mBAAmB,CAC1B,QAAsB,EACtB,KAAa,EACb,KAAa;IAEb,MAAM,WAAW,GAAG,IAAI,KAAK,GAAG,CAAC;IACjC,OAAO,QAAQ,CACb,QAAQ,CAAC,OAAO,CAAC;;;;;;GAMlB,CAAC,EACA,WAAW,EACX,WAAW,EACX,uBAAuB,EACvB,KAAK,CACN,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CACzB,QAAsB,EACtB,KAAa,EACb,KAAa;IAEb,MAAM,WAAW,GAAG,IAAI,KAAK,GAAG,CAAC;IACjC,OAAO,QAAQ,CACb,QAAQ,CAAC,OAAO,CAAC;;;;;;GAMlB,CAAC,EACA,WAAW,EACX,WAAW,EACX,uBAAuB,EACvB,KAAK,CACN,CAAC;AACJ,CAAC;AAED,SAAS,mBAAmB,CAC1B,QAAsB,EACtB,KAAa,EACb,KAAa;IAEb,MAAM,WAAW,GAAG,IAAI,KAAK,GAAG,CAAC;IACjC,OAAO,QAAQ,CACb,QAAQ,CAAC,OAAO,CAAC;;;;;;GAMlB,CAAC,EACA,WAAW,EACX,WAAW,EACX,uBAAuB,EACvB,KAAK,CACN,CAAC;AACJ,CAAC;AAED,SAAS,sBAAsB,CAC7B,QAAsB,EACtB,KAAa,EACb,KAAa;IAEb,MAAM,WAAW,GAAG,IAAI,KAAK,GAAG,CAAC;IACjC,OAAO,QAAQ,CACb,QAAQ,CAAC,OAAO,CAAC;;;;;;GAMlB,CAAC,EACA,WAAW,EACX,WAAW,EACX,uBAAuB,EACvB,KAAK,CACN,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,eAAe,CAAC,KAAa;IACpC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC5D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAExC,wEAAwE;IACxE,6EAA6E;IAC7E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,+EAA+E;QAC/E,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QAC7C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS,CAAC,kCAAkC;QACrE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,SAAS,CAAC,iCAAiC;QACrE,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS,CAAC,cAAc;QAC7C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAErC,8EAA8E;IAC9E,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc;IAC5B,cAAc,GAAG,IAAI,CAAC;IACtB,gBAAgB,GAAG,KAAK,CAAC;AAC3B,CAAC;AAED,+EAA+E;AAC/E,kDAAkD;AAClD,+EAA+E;AAE/E;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;AA0BxB;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAGE,EACF,IAAY,KAAK;IAEjB,2CAA2C;IAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAWlB,CAAC;IAEJ,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;QACvC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAE,CAAC;YACxB,MAAM,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAEpC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,QAAQ,IAAI,YAAY,CAAC;gBAClC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC7B,IAAI,MAAM,KAAK,KAAK;oBAAE,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAC;gBAC9C,IAAI,MAAM,KAAK,KAAK;oBAAE,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;oBAChB,QAAQ,EAAE,YAAY;oBACtB,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,KAAK,EAAE,GAAG,CAAC,KAAK;oBAChB,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;oBAC1B,OAAO,EAAE,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;oBAC5C,OAAO,EAAE,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;iBAC7C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;SACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACpB,EAAE;QACF,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAmC;QAC5D,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,OAAO,EAAE,IAAI,CAAC,OAAO;KACtB,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;AAC7C,CAAC;AA+BD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,KAAa,EACb,WAAmB,EACnB,OAA6B;IAE7B,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE;QAAE,OAAO,EAAE,CAAC;IAE9B,MAAM,UAAU,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;IACxC,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,KAAK,CAAC;IAEpC,6CAA6C;IAC7C,MAAM,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACjD,WAAW,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;YACtE,SAAS,EAAE,EAAE;YACb,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,EAAE;YACb,YAAY,EAAE,EAAE;SACjB,CAAC,CAAC;QACH,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAwB,CAAC;KACxF,CAAC,CAAC;IAEH,yDAAyD;IACzD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;QACrC,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,UAAU;YAChB,KAAK,EAAE,CAAC,CAAC,QAAQ;YACjB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC,SAAS,EAAE;SACvC,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QACpC,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,SAAS;YACf,KAAK,EAAE,CAAC,CAAC,OAAO;YAChB,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,OAAO,EAAE;SACpC,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;QACrC,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,UAAU;YAChB,KAAK,EAAE,CAAC,CAAC,OAAO;YAChB,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,aAAa,CAAC,CAAC,MAAM,GAAG;SAC3C,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAChG,CAAC;IAED,sGAAsG;IACtG,MAAM,OAAO,GAAa,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/C,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,IAAI,EAAE,CAAC,CAAC,IAAI;KACb,CAAC,CAAC,CAAC;IAEJ,uCAAuC;IACvC,MAAM,UAAU,GAA+D,EAAE,CAAC;IAClF,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;IAC1E,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;IAE1E,oDAAoD;IACpD,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,eAAe,GAAG;YACtB,WAAW,KAAK,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;YACrD,QAAQ,KAAK,EAAE;YACf,OAAO,KAAK,EAAE;SACf,CAAC;QAEF,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChD,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YACtD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,SAAS,CAAC,IAAI,CAAC;oBACb,EAAE,EAAE,QAAQ,CAAC,EAAE;oBACf,IAAI,EAAE,QAAQ,CAAC,QAAQ;oBACvB,KAAK,EAAE,QAAQ,CAAC,KAAK;oBACrB,IAAI,EAAE,QAAQ,CAAC,KAAK;iBACrB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;IAClF,CAAC;IAAC,MAAM,CAAC;QACP,oEAAoE;IACtE,CAAC;IAED,4CAA4C;IAC5C,MAAM,KAAK,GAAG,oBAAoB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAErD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5C,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,QAAQ;QACjB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,OAAO,EAAE,CAAC,CAAC,OAAO;KACnB,CAAC,CAAC,CAAC;AACN,CAAC"}