@cleocode/core 2.0.0

package/dist/memory/brain-search.js

@@ -0,0 +1,534 @@
+/**
+ * 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 { searchSimilar } from './brain-similarity.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 || !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 = nativeDb
+                .prepare(`
+        SELECT d.*
+        FROM brain_decisions_fts fts
+        JOIN brain_decisions d ON d.rowid = fts.rowid
+        WHERE brain_decisions_fts MATCH ?
+        ORDER BY bm25(brain_decisions_fts)
+        LIMIT ?
+      `)
+                .all(safeQuery, 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 = nativeDb
+                .prepare(`
+        SELECT p.*
+        FROM brain_patterns_fts fts
+        JOIN brain_patterns p ON p.rowid = fts.rowid
+        WHERE brain_patterns_fts MATCH ?
+        ORDER BY bm25(brain_patterns_fts)
+        LIMIT ?
+      `)
+                .all(safeQuery, limit);
+            result.patterns = rows;
+        }
+        catch {
+            result.patterns = likeSearchPatterns(nativeDb, query, limit);
+        }
+    }
+    if (tables.includes('learnings')) {
+        try {
+            const rows = nativeDb
+                .prepare(`
+        SELECT l.*
+        FROM brain_learnings_fts fts
+        JOIN brain_learnings l ON l.rowid = fts.rowid
+        WHERE brain_learnings_fts MATCH ?
+        ORDER BY bm25(brain_learnings_fts)
+        LIMIT ?
+      `)
+                .all(safeQuery, limit);
+            result.learnings = rows;
+        }
+        catch {
+            result.learnings = likeSearchLearnings(nativeDb, query, limit);
+        }
+    }
+    if (tables.includes('observations')) {
+        try {
+            const rows = nativeDb
+                .prepare(`
+        SELECT o.*
+        FROM brain_observations_fts fts
+        JOIN brain_observations o ON o.rowid = fts.rowid
+        WHERE brain_observations_fts MATCH ?
+        ORDER BY bm25(brain_observations_fts)
+        LIMIT ?
+      `)
+                .all(safeQuery, 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 nativeDb
+        .prepare(`
+    SELECT * FROM brain_decisions
+    WHERE decision LIKE ? OR rationale LIKE ?
+    ORDER BY created_at DESC
+    LIMIT ?
+  `)
+        .all(likePattern, likePattern, limit);
+}
+function likeSearchPatterns(nativeDb, query, limit) {
+    const likePattern = `%${query}%`;
+    return nativeDb
+        .prepare(`
+    SELECT * FROM brain_patterns
+    WHERE pattern LIKE ? OR context LIKE ?
+    ORDER BY frequency DESC
+    LIMIT ?
+  `)
+        .all(likePattern, likePattern, limit);
+}
+function likeSearchLearnings(nativeDb, query, limit) {
+    const likePattern = `%${query}%`;
+    return nativeDb
+        .prepare(`
+    SELECT * FROM brain_learnings
+    WHERE insight LIKE ? OR source LIKE ?
+    ORDER BY confidence DESC
+    LIMIT ?
+  `)
+        .all(likePattern, likePattern, limit);
+}
+function likeSearchObservations(nativeDb, query, limit) {
+    const likePattern = `%${query}%`;
+    return nativeDb
+        .prepare(`
+    SELECT * FROM brain_observations
+    WHERE title LIKE ? OR narrative LIKE ?
+    ORDER BY created_at DESC
+    LIMIT ?
+  `)
+        .all(likePattern, likePattern, limit);
+}
+/**
+ * Escape special FTS5 characters in query string.
+ * Wraps each token in quotes to prevent syntax errors from special chars.
+ */
+function escapeFts5Query(query) {
+    // Split on whitespace, wrap each token in double quotes
+    const tokens = query.trim().split(/\s+/).filter(Boolean);
+    if (tokens.length === 0)
+        return '""';
+    return tokens.map((t) => `"${t.replace(/"/g, '""')}"`).join(' ');
+}
+/**
+ * Reset the cached FTS5 availability flag.
+ * Used in tests to force re-detection.
+ */
+export function resetFts5Cache() {
+    _fts5Available = null;
+    _fts5Initialized = false;
+}
+/**
+ * Hybrid search across FTS5, vector similarity, and graph neighbors.
+ *
+ * 1. Runs FTS5 search via existing searchBrain.
+ * 2. Runs vector similarity via searchSimilar (if available).
+ * 3. Runs graph neighbor expansion via getNeighbors (if query matches a node).
+ * 4. Normalizes scores to 0-1 using min-max normalization.
+ * 5. Combines with configurable weights.
+ * 6. Deduplicates by ID, keeping highest combined score.
+ * 7. Returns top-N sorted by score descending.
+ *
+ * Graceful fallback: if vec unavailable, redistributes weight to FTS5.
+ *
+ * @param query - Search query text
+ * @param projectRoot - Project root directory
+ * @param options - Weight and limit configuration
+ * @returns Array of hybrid results ranked by combined score
+ */
+export async function hybridSearch(query, projectRoot, options) {
+    if (!query || !query.trim())
+        return [];
+    const maxResults = options?.limit ?? 10;
+    let ftsWeight = options?.ftsWeight ?? 0.5;
+    let vecWeight = options?.vecWeight ?? 0.4;
+    const graphWeight = options?.graphWeight ?? 0.1;
+    // Score accumulators: id -> { score, sources, type, title, text }
+    const scoreMap = new Map();
+    const addScore = (id, normalizedScore, weight, source, type, title, text) => {
+        const existing = scoreMap.get(id);
+        if (existing) {
+            existing.score += normalizedScore * weight;
+            existing.sources.add(source);
+        }
+        else {
+            scoreMap.set(id, {
+                score: normalizedScore * weight,
+                type,
+                title,
+                text,
+                sources: new Set([source]),
+            });
+        }
+    };
+    // --- 1. FTS5 search ---
+    const ftsResults = await searchBrain(projectRoot, query, { limit: maxResults * 2 });
+    // Collect all FTS hits into a flat list with position-based scores
+    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 });
+    }
+    // Normalize FTS: position-based (first result = 1.0, last = near 0)
+    for (let i = 0; i < ftsHits.length; i++) {
+        const hit = ftsHits[i];
+        const normalizedScore = ftsHits.length > 1 ? 1.0 - i / (ftsHits.length - 1) : 1.0;
+        addScore(hit.id, normalizedScore, ftsWeight, 'fts', hit.type, hit.title, hit.text);
+    }
+    // --- 2. Vector similarity search ---
+    let vecResults = [];
+    try {
+        vecResults = await searchSimilar(query, projectRoot, maxResults * 2);
+    }
+    catch {
+        // Vector search unavailable
+    }
+    if (vecResults.length > 0) {
+        // Normalize vector: distance-based (smaller distance = higher score)
+        const maxDist = Math.max(...vecResults.map((r) => r.distance), 0.001);
+        for (const r of vecResults) {
+            const normalizedScore = 1.0 - r.distance / maxDist;
+            addScore(r.id, normalizedScore, vecWeight, 'vec', r.type, r.title, r.text);
+        }
+    }
+    else {
+        // Redistribute vec weight to FTS if vector unavailable
+        ftsWeight += vecWeight;
+        vecWeight = 0;
+        // Re-score FTS hits with updated weight
+        scoreMap.clear();
+        for (let i = 0; i < ftsHits.length; i++) {
+            const hit = ftsHits[i];
+            const normalizedScore = ftsHits.length > 1 ? 1.0 - i / (ftsHits.length - 1) : 1.0;
+            addScore(hit.id, normalizedScore, ftsWeight, 'fts', hit.type, hit.title, hit.text);
+        }
+    }
+    // --- 3. Graph neighbor expansion ---
+    try {
+        const accessor = await getBrainAccessor(projectRoot);
+        // Check if query matches a known graph node ID pattern
+        const possibleNodeIds = [
+            `concept:${query.toLowerCase().replace(/\s+/g, '-')}`,
+            `task:${query}`,
+            `doc:${query}`,
+        ];
+        for (const nodeId of possibleNodeIds) {
+            const node = await accessor.getPageNode(nodeId);
+            if (!node)
+                continue;
+            const neighbors = await accessor.getNeighbors(nodeId);
+            for (let i = 0; i < neighbors.length; i++) {
+                const neighbor = neighbors[i];
+                const normalizedScore = neighbors.length > 1 ? 1.0 - i / (neighbors.length - 1) : 1.0;
+                addScore(neighbor.id, normalizedScore, graphWeight, 'graph', neighbor.nodeType, neighbor.label, neighbor.label);
+            }
+        }
+    }
+    catch {
+        // Graph search unavailable — no redistribution needed (small weight)
+    }
+    // --- 4. Sort and return top-N ---
+    const sorted = [...scoreMap.entries()]
+        .map(([id, data]) => ({
+        id,
+        score: data.score,
+        type: data.type,
+        title: data.title,
+        text: data.text,
+        sources: [...data.sources],
+    }))
+        .sort((a, b) => b.score - a.score)
+        .slice(0, maxResults);
+    return sorted;
+}
+//# sourceMappingURL=brain-search.js.map

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

@@ -0,0 +1 @@
+{"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;AAQ9D,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAmBtD,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,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC5B,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;iBAClB,OAAO,CAAC;;;;;;;OAOV,CAAC;iBACC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAkC,CAAC;YAC1D,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;iBAClB,OAAO,CAAC;;;;;;;OAOV,CAAC;iBACC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAiC,CAAC;YACzD,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;iBAClB,OAAO,CAAC;;;;;;;OAOV,CAAC;iBACC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAkC,CAAC;YAC1D,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;iBAClB,OAAO,CAAC;;;;;;;OAOV,CAAC;iBACC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAqC,CAAC;YAC7D,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;SACZ,OAAO,CAAC;;;;;GAKV,CAAC;SACC,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,CAAkC,CAAC;AAC3E,CAAC;AAED,SAAS,kBAAkB,CACzB,QAAsB,EACtB,KAAa,EACb,KAAa;IAEb,MAAM,WAAW,GAAG,IAAI,KAAK,GAAG,CAAC;IACjC,OAAO,QAAQ;SACZ,OAAO,CAAC;;;;;GAKV,CAAC;SACC,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,CAAiC,CAAC;AAC1E,CAAC;AAED,SAAS,mBAAmB,CAC1B,QAAsB,EACtB,KAAa,EACb,KAAa;IAEb,MAAM,WAAW,GAAG,IAAI,KAAK,GAAG,CAAC;IACjC,OAAO,QAAQ;SACZ,OAAO,CAAC;;;;;GAKV,CAAC;SACC,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,CAAkC,CAAC;AAC3E,CAAC;AAED,SAAS,sBAAsB,CAC7B,QAAsB,EACtB,KAAa,EACb,KAAa;IAEb,MAAM,WAAW,GAAG,IAAI,KAAK,GAAG,CAAC;IACjC,OAAO,QAAQ;SACZ,OAAO,CAAC;;;;;GAKV,CAAC;SACC,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,CAAqC,CAAC;AAC9E,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,KAAa;IACpC,wDAAwD;IACxD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACzD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACnE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc;IAC5B,cAAc,GAAG,IAAI,CAAC;IACtB,gBAAgB,GAAG,KAAK,CAAC;AAC3B,CAAC;AAwBD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,KAAa,EACb,WAAmB,EACnB,OAA6B;IAE7B,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,CAAC;IAEvC,MAAM,UAAU,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;IACxC,IAAI,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,GAAG,CAAC;IAC1C,IAAI,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,GAAG,CAAC;IAC1C,MAAM,WAAW,GAAG,OAAO,EAAE,WAAW,IAAI,GAAG,CAAC;IAEhD,kEAAkE;IAClE,MAAM,QAAQ,GAAG,IAAI,GAAG,EASrB,CAAC;IAEJ,MAAM,QAAQ,GAAG,CACf,EAAU,EACV,eAAuB,EACvB,MAAc,EACd,MAA+B,EAC/B,IAAY,EACZ,KAAa,EACb,IAAY,EACZ,EAAE;QACF,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,IAAI,eAAe,GAAG,MAAM,CAAC;YAC3C,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE;gBACf,KAAK,EAAE,eAAe,GAAG,MAAM;gBAC/B,IAAI;gBACJ,KAAK;gBACL,IAAI;gBACJ,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;aAC3B,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC;IAEF,yBAAyB;IACzB,MAAM,UAAU,GAAG,MAAM,WAAW,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC;IAEpF,mEAAmE;IACnE,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,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,oEAAoE;IACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACxB,MAAM,eAAe,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAClF,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,eAAe,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACrF,CAAC;IAED,sCAAsC;IACtC,IAAI,UAAU,GAAuB,EAAE,CAAC;IACxC,IAAI,CAAC;QACH,UAAU,GAAG,MAAM,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;IACvE,CAAC;IAAC,MAAM,CAAC;QACP,4BAA4B;IAC9B,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,qEAAqE;QACrE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QACtE,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,eAAe,GAAG,GAAG,GAAG,CAAC,CAAC,QAAQ,GAAG,OAAO,CAAC;YACnD,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,eAAe,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;SAAM,CAAC;QACN,uDAAuD;QACvD,SAAS,IAAI,SAAS,CAAC;QACvB,SAAS,GAAG,CAAC,CAAC;QAEd,wCAAwC;QACxC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;YACxB,MAAM,eAAe,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YAClF,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,eAAe,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;QAErD,uDAAuD;QACvD,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,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;YAEpB,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;gBAC/B,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBACtF,QAAQ,CACN,QAAQ,CAAC,EAAE,EACX,eAAe,EACf,WAAW,EACX,OAAO,EACP,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,KAAK,EACd,QAAQ,CAAC,KAAK,CACf,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,qEAAqE;IACvE,CAAC;IAED,mCAAmC;IACnC,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;SACnC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACpB,EAAE;QACF,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,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;KAC7D,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAExB,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/memory/brain-similarity.d.ts

@@ -0,0 +1,33 @@
+/**
+ * BRAIN Vector Similarity Search
+ *
+ * Provides vector-based KNN search against brain_embeddings vec0 table.
+ * Falls back gracefully when no embedding provider is registered or
+ * sqlite-vec is unavailable.
+ *
+ * @task T5388
+ * @epic T5149
+ */
+export interface SimilarityResult {
+    id: string;
+    distance: number;
+    type: string;
+    title: string;
+    text: string;
+}
+/**
+ * Search for entries similar to a query string using vector similarity.
+ *
+ * 1. Embeds the query text via the registered embedding provider.
+ * 2. Runs KNN query against brain_embeddings vec0 table.
+ * 3. Joins with observation/decision/pattern/learning tables for full entries.
+ *
+ * Returns empty array when embedding is unavailable (graceful fallback).
+ *
+ * @param query - Text to find similar entries for
+ * @param projectRoot - Project root directory
+ * @param limit - Maximum results to return (default 10)
+ * @returns Array of similar entries ranked by distance (ascending)
+ */
+export declare function searchSimilar(query: string, projectRoot: string, limit?: number): Promise<SimilarityResult[]>;
+//# sourceMappingURL=brain-similarity.d.ts.map

package/dist/memory/brain-similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"brain-similarity.d.ts","sourceRoot":"","sources":["../../src/memory/brain-similarity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAUH,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd;AAkBD;;;;;;;;;;;;;GAaG;AACH,wBAAsB,aAAa,CACjC,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,gBAAgB,EAAE,CAAC,CA4G7B"}