@cleocode/core 2026.3.38 → 2026.3.39

package/dist/memory/brain-retrieval.js

@@ -1,481 +0,0 @@
-/**
- * BRAIN Retrieval Operations — 3-layer pattern (search -> timeline -> fetch).
- *
- * Provides token-efficient memory access modeled after claude-mem's
- * search/timeline/get_observations workflow:
- *
- * 1. searchBrainCompact — lightweight index (IDs + titles, ~50 tokens/hit)
- * 2. timelineBrain      — chronological context around an anchor entry
- * 3. fetchBrainEntries  — full details for a filtered set of IDs
- * 4. observeBrain       — unified save (observations table)
- *
- * Wave 2A provides the core implementations; Wave 2B wires them through
- * the dispatch layer (engine-compat -> domain handler -> MCP gateway).
- *
- * @task T5131 T5132 T5133 T5134 T5135
- * @epic T5149
- */
-import { createHash } from 'node:crypto';
-import { getBrainAccessor } from '../store/brain-accessor.js';
-import { embedText, isEmbeddingAvailable } from './brain-embedding.js';
-import { searchBrain } from './brain-search.js';
-// ============================================================================
-// Layer 1: Compact Search
-// ============================================================================
-/**
- * Token-efficient compact search across BRAIN tables.
- * Returns index-level hits (~50 tokens per result).
- *
- * Delegates to searchBrain() from brain-search.ts for FTS5/LIKE search,
- * then projects results to a compact format with optional date filtering.
- *
- * @param projectRoot - Project root directory
- * @param params - Search parameters
- * @returns Compact search results with token estimate
- */
-export async function searchBrainCompact(projectRoot, params) {
-    const { query, limit, tables, dateStart, dateEnd } = params;
-    if (!query || !query.trim()) {
-        return { results: [], total: 0, tokensEstimated: 0 };
-    }
-    const searchResult = await searchBrain(projectRoot, query, {
-        limit: limit ?? 10,
-        tables,
-    });
-    // Project full results to compact format.
-    // Note: searchBrain() returns rows from raw SQL (nativeDb) which use
-    // snake_case column names, but the TypeScript types are camelCase.
-    // We handle both naming conventions for robustness.
-    let results = [];
-    for (const d of searchResult.decisions) {
-        const raw = d;
-        results.push({
-            id: d.id,
-            type: 'decision',
-            title: d.decision.slice(0, 80),
-            date: (d.createdAt ?? raw['created_at']) || '',
-        });
-    }
-    for (const p of searchResult.patterns) {
-        const raw = p;
-        results.push({
-            id: p.id,
-            type: 'pattern',
-            title: p.pattern.slice(0, 80),
-            date: (p.extractedAt ?? raw['extracted_at']) || '',
-        });
-    }
-    for (const l of searchResult.learnings) {
-        const raw = l;
-        results.push({
-            id: l.id,
-            type: 'learning',
-            title: l.insight.slice(0, 80),
-            date: (l.createdAt ?? raw['created_at']) || '',
-        });
-    }
-    for (const o of searchResult.observations) {
-        const raw = o;
-        results.push({
-            id: o.id,
-            type: 'observation',
-            title: o.title.slice(0, 80),
-            date: (o.createdAt ?? raw['created_at']) || '',
-        });
-    }
-    // Apply date filters client-side if provided
-    if (dateStart) {
-        results = results.filter((r) => r.date >= dateStart);
-    }
-    if (dateEnd) {
-        results = results.filter((r) => r.date <= dateEnd);
-    }
-    return {
-        results,
-        total: results.length,
-        tokensEstimated: results.length * 50,
-    };
-}
-// ============================================================================
-// Layer 2: Timeline
-// ============================================================================
-/**
- * Determine the entry type from its ID prefix.
- *
- * Conventions:
- * - D... -> decision (D001, D-xxx)
- * - P... -> pattern  (P001, P-xxx)
- * - L... -> learning (L001, L-xxx)
- * - O... or CM-... -> observation (O-xxx, CM-xxx)
- */
-function parseIdPrefix(id) {
-    if (id.startsWith('D-') || /^D\d/.test(id))
-        return 'decision';
-    if (id.startsWith('P-') || /^P\d/.test(id))
-        return 'pattern';
-    if (id.startsWith('L-') || /^L\d/.test(id))
-        return 'learning';
-    if (id.startsWith('O-') || id.startsWith('O') || id.startsWith('CM-'))
-        return 'observation';
-    return null;
-}
-/**
- * Get chronological context around an anchor entry.
- * Fetches the anchor's full data, then queries all 4 BRAIN tables
- * via UNION ALL to find chronological neighbors.
- *
- * @param projectRoot - Project root directory
- * @param params - Timeline parameters with anchor ID and depth
- * @returns Anchor entry data with surrounding chronological entries
- */
-export async function timelineBrain(projectRoot, params) {
-    const { anchor: anchorId, depthBefore = 3, depthAfter = 3 } = params;
-    // Ensure DB is initialized
-    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    await getBrainDb(projectRoot);
-    const nativeDb = getBrainNativeDb();
-    if (!nativeDb) {
-        return { anchor: null, before: [], after: [] };
-    }
-    // Determine anchor type and fetch it via accessor
-    const anchorType = parseIdPrefix(anchorId);
-    if (!anchorType) {
-        return { anchor: null, before: [], after: [] };
-    }
-    const accessor = await getBrainAccessor(projectRoot);
-    let anchorData = null;
-    let anchorDate = null;
-    switch (anchorType) {
-        case 'decision': {
-            const row = await accessor.getDecision(anchorId);
-            if (row) {
-                anchorData = row;
-                anchorDate = row.createdAt;
-            }
-            break;
-        }
-        case 'pattern': {
-            const row = await accessor.getPattern(anchorId);
-            if (row) {
-                anchorData = row;
-                anchorDate = row.extractedAt;
-            }
-            break;
-        }
-        case 'learning': {
-            const row = await accessor.getLearning(anchorId);
-            if (row) {
-                anchorData = row;
-                anchorDate = row.createdAt;
-            }
-            break;
-        }
-        case 'observation': {
-            const row = await accessor.getObservation(anchorId);
-            if (row) {
-                anchorData = row;
-                anchorDate = row.createdAt;
-            }
-            break;
-        }
-    }
-    if (!anchorData || !anchorDate) {
-        return { anchor: null, before: [], after: [] };
-    }
-    // UNION ALL across all 4 tables to get chronological neighbors.
-    // Excludes the anchor itself.
-    const beforeRows = nativeDb
-        .prepare(`
-    SELECT id, 'decision' AS type, created_at AS date FROM brain_decisions WHERE created_at < ? AND id != ?
-    UNION ALL
-    SELECT id, 'pattern' AS type, extracted_at AS date FROM brain_patterns WHERE extracted_at < ? AND id != ?
-    UNION ALL
-    SELECT id, 'learning' AS type, created_at AS date FROM brain_learnings WHERE created_at < ? AND id != ?
-    UNION ALL
-    SELECT id, 'observation' AS type, created_at AS date FROM brain_observations WHERE created_at < ? AND id != ?
-    ORDER BY date DESC
-    LIMIT ?
-  `)
-        .all(anchorDate, anchorId, anchorDate, anchorId, anchorDate, anchorId, anchorDate, anchorId, depthBefore);
-    const afterRows = nativeDb
-        .prepare(`
-    SELECT id, 'decision' AS type, created_at AS date FROM brain_decisions WHERE created_at > ? AND id != ?
-    UNION ALL
-    SELECT id, 'pattern' AS type, extracted_at AS date FROM brain_patterns WHERE extracted_at > ? AND id != ?
-    UNION ALL
-    SELECT id, 'learning' AS type, created_at AS date FROM brain_learnings WHERE created_at > ? AND id != ?
-    UNION ALL
-    SELECT id, 'observation' AS type, created_at AS date FROM brain_observations WHERE created_at > ? AND id != ?
-    ORDER BY date ASC
-    LIMIT ?
-  `)
-        .all(anchorDate, anchorId, anchorDate, anchorId, anchorDate, anchorId, anchorDate, anchorId, depthAfter);
-    return {
-        anchor: { id: anchorId, type: anchorType, data: anchorData },
-        before: beforeRows.map((r) => ({ id: r.id, type: r.type, date: r.date })),
-        after: afterRows.map((r) => ({ id: r.id, type: r.type, date: r.date })),
-    };
-}
-// ============================================================================
-// Layer 3: Batch Fetch
-// ============================================================================
-/**
- * Batch-fetch full details by IDs.
- * Groups IDs by prefix to query the correct tables via BrainDataAccessor.
- *
- * @param projectRoot - Project root directory
- * @param params - Fetch parameters with IDs
- * @returns Full entry data for each found ID, plus not-found list
- */
-export async function fetchBrainEntries(projectRoot, params) {
-    const { ids } = params;
-    if (!ids || ids.length === 0) {
-        return { results: [], notFound: [], tokensEstimated: 0 };
-    }
-    const accessor = await getBrainAccessor(projectRoot);
-    // Group IDs by type prefix
-    const decisionIds = [];
-    const patternIds = [];
-    const learningIds = [];
-    const observationIds = [];
-    const unknownIds = [];
-    for (const id of ids) {
-        const type = parseIdPrefix(id);
-        switch (type) {
-            case 'decision':
-                decisionIds.push(id);
-                break;
-            case 'pattern':
-                patternIds.push(id);
-                break;
-            case 'learning':
-                learningIds.push(id);
-                break;
-            case 'observation':
-                observationIds.push(id);
-                break;
-            default:
-                unknownIds.push(id);
-        }
-    }
-    const results = [];
-    const notFound = [...unknownIds];
-    // Fetch decisions
-    for (const id of decisionIds) {
-        const row = await accessor.getDecision(id);
-        if (row) {
-            results.push({ id, type: 'decision', data: row });
-        }
-        else {
-            notFound.push(id);
-        }
-    }
-    // Fetch patterns
-    for (const id of patternIds) {
-        const row = await accessor.getPattern(id);
-        if (row) {
-            results.push({ id, type: 'pattern', data: row });
-        }
-        else {
-            notFound.push(id);
-        }
-    }
-    // Fetch learnings
-    for (const id of learningIds) {
-        const row = await accessor.getLearning(id);
-        if (row) {
-            results.push({ id, type: 'learning', data: row });
-        }
-        else {
-            notFound.push(id);
-        }
-    }
-    // Fetch observations
-    for (const id of observationIds) {
-        const row = await accessor.getObservation(id);
-        if (row) {
-            results.push({ id, type: 'observation', data: row });
-        }
-        else {
-            notFound.push(id);
-        }
-    }
-    return {
-        results,
-        notFound,
-        tokensEstimated: results.length * 500,
-    };
-}
-// ============================================================================
-// Observe (Unified Save)
-// ============================================================================
-/**
- * Keyword patterns for auto-classifying observation type from text.
- */
-const TYPE_KEYWORDS = [
-    { keywords: ['bug', 'fix', 'error', 'crash'], type: 'bugfix' },
-    { keywords: ['refactor', 'rename', 'extract', 'move'], type: 'refactor' },
-    { keywords: ['add', 'create', 'implement', 'new'], type: 'feature' },
-    { keywords: ['decide', 'chose', 'pick', 'instead'], type: 'decision' },
-    { keywords: ['update', 'change', 'modify', 'upgrade'], type: 'change' },
-];
-/**
- * Auto-classify observation type from text using keyword matching.
- */
-function classifyObservationType(text) {
-    const lower = text.toLowerCase();
-    for (const { keywords, type } of TYPE_KEYWORDS) {
-        for (const keyword of keywords) {
-            if (lower.includes(keyword)) {
-                return type;
-            }
-        }
-    }
-    return 'discovery';
-}
-/** Monotonic counter to prevent ID collisions within the same millisecond. */
-let observeSeq = 0;
-/**
- * Save an observation to the BRAIN observations table.
- * Replaces the external claude-mem save_observation pattern.
- *
- * Auto-classifies type from text if not provided. Generates a
- * unique ID with O- prefix + base36 timestamp.
- *
- * @param projectRoot - Project root directory
- * @param params - Observation data
- * @returns Created observation ID, type, and timestamp
- */
-export async function observeBrain(projectRoot, params) {
-    const { text, title: titleParam, type: typeParam, project, sourceSessionId, sourceType } = params;
-    if (!text || !text.trim()) {
-        throw new Error('Observation text is required');
-    }
-    const type = typeParam ?? classifyObservationType(text);
-    const title = titleParam ?? text.slice(0, 120);
-    const now = new Date().toISOString().replace('T', ' ').slice(0, 19);
-    // Content-hash dedup: SHA-256 prefix of title+text
-    const contentHash = createHash('sha256')
-        .update(title + text)
-        .digest('hex')
-        .slice(0, 16);
-    // Check for recent duplicate (same content within last 30 seconds)
-    const { getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    const nativeDb = getBrainNativeDb();
-    if (nativeDb) {
-        const cutoff = new Date(Date.now() - 30000).toISOString().replace('T', ' ').slice(0, 19);
-        const existing = nativeDb
-            .prepare('SELECT id, type, created_at FROM brain_observations WHERE content_hash = ? AND created_at > ?')
-            .all(contentHash, cutoff);
-        if (existing.length > 0) {
-            return {
-                id: existing[0].id,
-                type: existing[0].type,
-                createdAt: existing[0].created_at,
-            };
-        }
-    }
-    const id = `O-${Date.now().toString(36)}-${(observeSeq++ % 1000).toString(36)}`;
-    const accessor = await getBrainAccessor(projectRoot);
-    const row = await accessor.addObservation({
-        id,
-        type,
-        title,
-        narrative: text,
-        contentHash,
-        project: project ?? null,
-        sourceSessionId: sourceSessionId ?? null,
-        sourceType: sourceType ?? 'agent',
-        createdAt: now,
-    });
-    // Populate embedding if provider is available (T5387).
-    // Fire-and-forget: embedding runs in the background so it never blocks the CLI.
-    // The observation is already saved above — if embedding fails, the observation
-    // still exists, just without vector similarity search capability. (T027)
-    if (isEmbeddingAvailable()) {
-        setImmediate(() => {
-            embedText(text)
-                .then((vector) => {
-                if (vector && nativeDb) {
-                    nativeDb
-                        .prepare('INSERT OR REPLACE INTO brain_embeddings (id, embedding) VALUES (?, ?)')
-                        .run(id, Buffer.from(vector.buffer));
-                }
-            })
-                .catch(() => {
-                // Silently skip embedding failures — observation is already persisted
-            });
-        });
-    }
-    // Regenerate memory bridge for high-value observation types (T5240).
-    // Only learning and decision types trigger bridge refresh to avoid excessive writes.
-    if (type === 'decision') {
-        import('./memory-bridge.js')
-            .then(({ refreshMemoryBridge }) => refreshMemoryBridge(projectRoot))
-            .catch(() => {
-            /* Memory bridge refresh is best-effort */
-        });
-    }
-    return {
-        id: row.id,
-        type: row.type,
-        createdAt: row.createdAt,
-    };
-}
-/**
- * Backfill embeddings for existing observations that lack them.
- *
- * Iterates through observations not yet in brain_embeddings and
- * generates vectors using the registered embedding provider.
- * Processes in batches to avoid memory pressure.
- *
- * @param projectRoot - Project root directory
- * @param options - Optional batch size configuration
- * @returns Count of processed and skipped observations
- */
-export async function populateEmbeddings(projectRoot, options) {
-    if (!isEmbeddingAvailable()) {
-        return { processed: 0, skipped: 0 };
-    }
-    const { getBrainDb, getBrainNativeDb } = await import('../store/brain-sqlite.js');
-    await getBrainDb(projectRoot);
-    const nativeDb = getBrainNativeDb();
-    if (!nativeDb) {
-        return { processed: 0, skipped: 0 };
-    }
-    const batchSize = options?.batchSize ?? 50;
-    let processed = 0;
-    let skipped = 0;
-    // Find observations without embeddings
-    const rows = nativeDb
-        .prepare(`
-    SELECT o.id, o.narrative, o.title
-    FROM brain_observations o
-    LEFT JOIN brain_embeddings e ON o.id = e.id
-    WHERE e.id IS NULL AND o.narrative IS NOT NULL
-    ORDER BY o.created_at DESC
-  `)
-        .all();
-    for (let i = 0; i < rows.length; i += batchSize) {
-        const batch = rows.slice(i, i + batchSize);
-        for (const row of batch) {
-            try {
-                const vector = await embedText(row.narrative || row.title);
-                if (vector) {
-                    nativeDb
-                        .prepare('INSERT OR REPLACE INTO brain_embeddings (id, embedding) VALUES (?, ?)')
-                        .run(row.id, Buffer.from(vector.buffer));
-                    processed++;
-                }
-                else {
-                    skipped++;
-                }
-            }
-            catch {
-                skipped++;
-            }
-        }
-    }
-    return { processed, skipped };
-}
-//# sourceMappingURL=brain-retrieval.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"brain-retrieval.js","sourceRoot":"","sources":["../../src/memory/brain-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAM9D,OAAO,EAAE,SAAS,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AACvE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AA8FhD,+EAA+E;AAC/E,0BAA0B;AAC1B,+EAA+E;AAE/E;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,WAAmB,EACnB,MAAgC;IAEhC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;IAE5D,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC5B,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IACvD,CAAC;IAED,MAAM,YAAY,GAAG,MAAM,WAAW,CAAC,WAAW,EAAE,KAAK,EAAE;QACzD,KAAK,EAAE,KAAK,IAAI,EAAE;QAClB,MAAM;KACP,CAAC,CAAC;IAEH,0CAA0C;IAC1C,qEAAqE;IACrE,mEAAmE;IACnE,oDAAoD;IACpD,IAAI,OAAO,GAAsB,EAAE,CAAC;IAEpC,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,UAAU;YAChB,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,IAAK,GAAG,CAAC,YAAY,CAAY,CAAC,IAAI,EAAE;SAC3D,CAAC,CAAC;IACL,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,QAAQ,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,SAAS;YACf,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,EAAE,CAAC,CAAC,CAAC,WAAW,IAAK,GAAG,CAAC,cAAc,CAAY,CAAC,IAAI,EAAE;SAC/D,CAAC,CAAC;IACL,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,UAAU;YAChB,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,IAAK,GAAG,CAAC,YAAY,CAAY,CAAC,IAAI,EAAE;SAC3D,CAAC,CAAC;IACL,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,YAAY,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,IAAK,GAAG,CAAC,YAAY,CAAY,CAAC,IAAI,EAAE;SAC3D,CAAC,CAAC;IACL,CAAC;IAED,6CAA6C;IAC7C,IAAI,SAAS,EAAE,CAAC;QACd,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,CAAC;IACrD,CAAC;IAED,OAAO;QACL,OAAO;QACP,KAAK,EAAE,OAAO,CAAC,MAAM;QACrB,eAAe,EAAE,OAAO,CAAC,MAAM,GAAG,EAAE;KACrC,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,oBAAoB;AACpB,+EAA+E;AAE/E;;;;;;;;GAQG;AACH,SAAS,aAAa,CAAC,EAAU;IAC/B,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAAE,OAAO,UAAU,CAAC;IAC9D,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7D,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAAE,OAAO,UAAU,CAAC;IAC9D,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,OAAO,aAAa,CAAC;IAC5F,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,WAAmB,EACnB,MAA2B;IAE3B,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC;IAErE,2BAA2B;IAC3B,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,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IACjD,CAAC;IAED,kDAAkD;IAClD,MAAM,UAAU,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IAC3C,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IACjD,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACrD,IAAI,UAAU,GAAY,IAAI,CAAC;IAC/B,IAAI,UAAU,GAAkB,IAAI,CAAC;IAErC,QAAQ,UAAU,EAAE,CAAC;QACnB,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACjD,IAAI,GAAG,EAAE,CAAC;gBACR,UAAU,GAAG,GAAG,CAAC;gBACjB,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC;YAC7B,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAChD,IAAI,GAAG,EAAE,CAAC;gBACR,UAAU,GAAG,GAAG,CAAC;gBACjB,UAAU,GAAG,GAAG,CAAC,WAAW,CAAC;YAC/B,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACjD,IAAI,GAAG,EAAE,CAAC;gBACR,UAAU,GAAG,GAAG,CAAC;gBACjB,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC;YAC7B,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;YACpD,IAAI,GAAG,EAAE,CAAC;gBACR,UAAU,GAAG,GAAG,CAAC;gBACjB,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC;YAC7B,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC;IAED,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;QAC/B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IACjD,CAAC;IAED,gEAAgE;IAChE,8BAA8B;IAC9B,MAAM,UAAU,GAAG,QAAQ;SACxB,OAAO,CAAC;;;;;;;;;;GAUV,CAAC;SACC,GAAG,CACF,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,EACR,WAAW,CACqB,CAAC;IAErC,MAAM,SAAS,GAAG,QAAQ;SACvB,OAAO,CAAC;;;;;;;;;;GAUV,CAAC;SACC,GAAG,CACF,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,EACR,UAAU,CACsB,CAAC;IAErC,OAAO;QACL,MAAM,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE;QAC5D,MAAM,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACzE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;KACxE,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,uBAAuB;AACvB,+EAA+E;AAE/E;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,WAAmB,EACnB,MAA+B;IAE/B,MAAM,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC;IAEvB,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IAC3D,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAErD,2BAA2B;IAC3B,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAC/B,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,UAAU;gBACb,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM;YACR,KAAK,SAAS;gBACZ,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,MAAM;YACR,KAAK,UAAU;gBACb,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM;YACR,KAAK,aAAa;gBAChB,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxB,MAAM;YACR;gBACE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAwB,EAAE,CAAC;IACxC,MAAM,QAAQ,GAAa,CAAC,GAAG,UAAU,CAAC,CAAC;IAE3C,kBAAkB;IAClB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAI,GAAG,EAAE,CAAC;YACR,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,iBAAiB;IACjB,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,GAAG,EAAE,CAAC;YACR,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAI,GAAG,EAAE,CAAC;YACR,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,GAAG,EAAE,CAAC;YACR,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;QACvD,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO;QACP,QAAQ;QACR,eAAe,EAAE,OAAO,CAAC,MAAM,GAAG,GAAG;KACtC,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,yBAAyB;AACzB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,aAAa,GAA8D;IAC/E,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE;IAC9D,EAAE,QAAQ,EAAE,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE;IACzE,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE;IACpE,EAAE,QAAQ,EAAE,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE;IACtE,EAAE,QAAQ,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE;CACxE,CAAC;AAEF;;GAEG;AACH,SAAS,uBAAuB,CAAC,IAAY;IAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,aAAa,EAAE,CAAC;QAC/C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,8EAA8E;AAC9E,IAAI,UAAU,GAAG,CAAC,CAAC;AAEnB;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,WAAmB,EACnB,MAA0B;IAE1B,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;IAElG,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,IAAI,GAAG,SAAS,IAAI,uBAAuB,CAAC,IAAI,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEpE,mDAAmD;IACnD,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC;SACrC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;SACpB,MAAM,CAAC,KAAK,CAAC;SACb,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEhB,mEAAmE;IACnE,MAAM,EAAE,gBAAgB,EAAE,GAAG,MAAM,MAAM,CAAC,0BAA0B,CAAC,CAAC;IACtE,MAAM,QAAQ,GAAG,gBAAgB,EAAE,CAAC;IACpC,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACzF,MAAM,QAAQ,GAAG,QAAQ;aACtB,OAAO,CACN,+FAA+F,CAChG;aACA,GAAG,CAAC,WAAW,EAAE,MAAM,CAA6B,CAAC;QAExD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO;gBACL,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;gBAClB,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI;gBACtB,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU;aAClC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,EAAE,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;IAChF,MAAM,QAAQ,GAAG,MAAM,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAErD,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,cAAc,CAAC;QACxC,EAAE;QACF,IAAI;QACJ,KAAK;QACL,SAAS,EAAE,IAAI;QACf,WAAW;QACX,OAAO,EAAE,OAAO,IAAI,IAAI;QACxB,eAAe,EAAE,eAAe,IAAI,IAAI;QACxC,UAAU,EAAE,UAAU,IAAI,OAAO;QACjC,SAAS,EAAE,GAAG;KACf,CAAC,CAAC;IAEH,uDAAuD;IACvD,gFAAgF;IAChF,+EAA+E;IAC/E,yEAAyE;IACzE,IAAI,oBAAoB,EAAE,EAAE,CAAC;QAC3B,YAAY,CAAC,GAAG,EAAE;YAChB,SAAS,CAAC,IAAI,CAAC;iBACZ,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE;gBACf,IAAI,MAAM,IAAI,QAAQ,EAAE,CAAC;oBACvB,QAAQ;yBACL,OAAO,CAAC,uEAAuE,CAAC;yBAChF,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC,CAAC;iBACD,KAAK,CAAC,GAAG,EAAE;gBACV,sEAAsE;YACxE,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACL,CAAC;IAED,qEAAqE;IACrE,qFAAqF;IACrF,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;QACxB,MAAM,CAAC,oBAAoB,CAAC;aACzB,IAAI,CAAC,CAAC,EAAE,mBAAmB,EAAE,EAAE,EAAE,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC;aACnE,KAAK,CAAC,GAAG,EAAE;YACV,0CAA0C;QAC5C,CAAC,CAAC,CAAC;IACP,CAAC;IAED,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,SAAS,EAAE,GAAG,CAAC,SAAS;KACzB,CAAC;AACJ,CAAC;AAYD;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,WAAmB,EACnB,OAAgC;IAEhC,IAAI,CAAC,oBAAoB,EAAE,EAAE,CAAC;QAC5B,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IACtC,CAAC;IAED,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,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IACtC,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,EAAE,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,uCAAuC;IACvC,MAAM,IAAI,GAAG,QAAQ;SAClB,OAAO,CAAC;;;;;;GAMV,CAAC;SACC,GAAG,EAAoC,CAAC;IAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;QAC3C,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC3D,IAAI,MAAM,EAAE,CAAC;oBACX,QAAQ;yBACL,OAAO,CAAC,uEAAuE,CAAC;yBAChF,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;oBAC3C,SAAS,EAAE,CAAC;gBACd,CAAC;qBAAM,CAAC;oBACN,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAChC,CAAC"}

package/dist/memory/brain-row-types.d.ts

@@ -1,45 +0,0 @@
-/**
- * Typed row interfaces for raw SQLite queries against brain.db.
- *
- * These replace inline `as Array<{ ... }>` casts throughout the brain/memory modules,
- * giving each raw-SQL result shape a named, reusable type.
- *
- * @task T5800
- */
-/** Row returned by FTS content_hash duplicate check. */
-export interface BrainFtsRow {
-    id: string;
-    type: string;
-    created_at: string;
-}
-/** Row returned by narrative backfill query (missing embeddings). */
-export interface BrainNarrativeRow {
-    id: string;
-    narrative: string;
-    title: string;
-}
-/** Flattened FTS hit used in hybrid search scoring. */
-export interface BrainSearchHit {
-    id: string;
-    type: string;
-    title: string;
-    text: string;
-}
-/** Row returned by KNN vector similarity query. */
-export interface BrainKnnRow {
-    id: string;
-    distance: number;
-}
-/** Decision node attached to a blocker in causal traces. */
-export interface BrainDecisionNode {
-    id: string;
-    title: string;
-    rationale?: string;
-}
-/** Anchor entry in a timeline result. */
-export interface BrainAnchor {
-    id: string;
-    type: string;
-    data: unknown;
-}
-//# sourceMappingURL=brain-row-types.d.ts.map

package/dist/memory/brain-row-types.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"brain-row-types.d.ts","sourceRoot":"","sources":["../../src/memory/brain-row-types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,wDAAwD;AACxD,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,qEAAqE;AACrE,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,uDAAuD;AACvD,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd;AAED,mDAAmD;AACnD,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,4DAA4D;AAC5D,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,yCAAyC;AACzC,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,CAAC;CACf"}

package/dist/memory/brain-row-types.js

@@ -1,10 +0,0 @@
-/**
- * Typed row interfaces for raw SQLite queries against brain.db.
- *
- * These replace inline `as Array<{ ... }>` casts throughout the brain/memory modules,
- * giving each raw-SQL result shape a named, reusable type.
- *
- * @task T5800
- */
-export {};
-//# sourceMappingURL=brain-row-types.js.map

package/dist/memory/brain-row-types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"brain-row-types.js","sourceRoot":"","sources":["../../src/memory/brain-row-types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

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

@@ -1,91 +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 type { DatabaseSync } from 'node:sqlite';
-import type { BrainDecisionRow, BrainLearningRow, BrainObservationRow, BrainPatternRow } from '../store/brain-schema.js';
-/** Search result with BM25 rank. */
-export interface BrainSearchResult {
-    decisions: BrainDecisionRow[];
-    patterns: BrainPatternRow[];
-    learnings: BrainLearningRow[];
-    observations: BrainObservationRow[];
-}
-/** Search options. */
-export interface BrainSearchOptions {
-    /** Max results per table. Default 10. */
-    limit?: number;
-    /** Which tables to search. Default: all four. */
-    tables?: Array<'decisions' | 'patterns' | 'learnings' | 'observations'>;
-}
-/**
- * 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 declare function ensureFts5Tables(nativeDb: DatabaseSync): boolean;
-/**
- * Rebuild FTS5 indexes from the content tables.
- * Useful after bulk inserts that bypass triggers.
- *
- * @task T5130
- */
-export declare function rebuildFts5Index(nativeDb: DatabaseSync): void;
-/**
- * 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 declare function searchBrain(projectRoot: string, query: string, options?: BrainSearchOptions): Promise<BrainSearchResult>;
-/**
- * Reset the cached FTS5 availability flag.
- * Used in tests to force re-detection.
- */
-export declare function resetFts5Cache(): void;
-/** Result from hybridSearch combining multiple search signals. */
-export interface HybridResult {
-    id: string;
-    score: number;
-    type: string;
-    title: string;
-    text: string;
-    sources: Array<'fts' | 'vec' | 'graph'>;
-}
-/** Options for hybridSearch weighting and limits. */
-export interface HybridSearchOptions {
-    ftsWeight?: number;
-    vecWeight?: number;
-    graphWeight?: number;
-    limit?: number;
-}
-/**
- * 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 declare function hybridSearch(query: string, projectRoot: string, options?: HybridSearchOptions): Promise<HybridResult[]>;
-//# sourceMappingURL=brain-search.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"brain-search.d.ts","sourceRoot":"","sources":["../../src/memory/brain-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD,OAAO,KAAK,EACV,gBAAgB,EAChB,gBAAgB,EAChB,mBAAmB,EACnB,eAAe,EAChB,MAAM,0BAA0B,CAAC;AAKlC,oCAAoC;AACpC,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,gBAAgB,EAAE,CAAC;IAC9B,QAAQ,EAAE,eAAe,EAAE,CAAC;IAC5B,SAAS,EAAE,gBAAgB,EAAE,CAAC;IAC9B,YAAY,EAAE,mBAAmB,EAAE,CAAC;CACrC;AAED,sBAAsB;AACtB,MAAM,WAAW,kBAAkB;IACjC,yCAAyC;IACzC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iDAAiD;IACjD,MAAM,CAAC,EAAE,KAAK,CAAC,WAAW,GAAG,UAAU,GAAG,WAAW,GAAG,cAAc,CAAC,CAAC;CACzE;AAgCD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,YAAY,GAAG,OAAO,CAsKhE;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,YAAY,GAAG,IAAI,CAiB7D;AAED;;;;;;;GAOG;AACH,wBAAsB,WAAW,CAC/B,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,kBAAkB,GAC3B,OAAO,CAAC,iBAAiB,CAAC,CA8B5B;AA+MD;;;GAGG;AACH,wBAAgB,cAAc,IAAI,IAAI,CAGrC;AAMD,kEAAkE;AAClE,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,KAAK,CAAC,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC,CAAC;CACzC;AAED,qDAAqD;AACrD,MAAM,WAAW,mBAAmB;IAClC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAsB,YAAY,CAChC,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,OAAO,CAAC,EAAE,mBAAmB,GAC5B,OAAO,CAAC,YAAY,EAAE,CAAC,CAkKzB"}