@hivehub/rulebook 5.7.0 → 5.8.1

package/dist/memory/memory-cache.js

@@ -1,85 +0,0 @@
-/**
- * Cache Size Limiter with LRU Eviction
- *
- * Enforces configurable max database size (default 500MB)
- * using LRU-based eviction to protect the SSD.
- */
-const DEFAULT_MAX_SIZE = 524288000; // 500MB
-const EVICTION_BATCH_SIZE = 100;
-const TARGET_USAGE = 0.85; // 85% — evict until 15% headroom
-export class MemoryCache {
-    store;
-    index;
-    maxSizeBytes;
-    constructor(store, index, maxSizeBytes) {
-        this.store = store;
-        this.index = index;
-        this.maxSizeBytes = maxSizeBytes ?? DEFAULT_MAX_SIZE;
-    }
-    getCurrentSize() {
-        return this.store.getDbSizeBytes();
-    }
-    getUsagePercent() {
-        return (this.getCurrentSize() / this.maxSizeBytes) * 100;
-    }
-    isOverLimit() {
-        return this.getCurrentSize() > this.maxSizeBytes;
-    }
-    /**
-     * Check and evict if over limit
-     * Returns number of evicted memories and freed bytes
-     */
-    checkAndEvict(activeSessionId) {
-        if (!this.isOverLimit()) {
-            return { evictedCount: 0, freedBytes: 0 };
-        }
-        return this.evict(activeSessionId);
-    }
-    /**
-     * Force eviction regardless of current size.
-     * Evicts at least one batch of candidates.
-     */
-    forceEvict(activeSessionId) {
-        const sizeBefore = this.getCurrentSize();
-        let evictedCount = 0;
-        // Always run at least one batch
-        const candidates = this.store.getEvictionCandidates(EVICTION_BATCH_SIZE, activeSessionId);
-        for (const candidate of candidates) {
-            this.store.deleteMemory(candidate.id);
-            this.index.remove(candidate.id);
-            evictedCount++;
-        }
-        // If still over target, keep evicting
-        const targetSize = this.maxSizeBytes * TARGET_USAGE;
-        while (this.getCurrentSize() > targetSize) {
-            const moreCandidates = this.store.getEvictionCandidates(EVICTION_BATCH_SIZE, activeSessionId);
-            if (moreCandidates.length === 0)
-                break;
-            for (const candidate of moreCandidates) {
-                this.store.deleteMemory(candidate.id);
-                this.index.remove(candidate.id);
-                evictedCount++;
-            }
-        }
-        const freedBytes = sizeBefore - this.getCurrentSize();
-        return { evictedCount, freedBytes: Math.max(0, freedBytes) };
-    }
-    evict(activeSessionId) {
-        const sizeBefore = this.getCurrentSize();
-        const targetSize = this.maxSizeBytes * TARGET_USAGE;
-        let evictedCount = 0;
-        while (this.getCurrentSize() > targetSize) {
-            const candidates = this.store.getEvictionCandidates(EVICTION_BATCH_SIZE, activeSessionId);
-            if (candidates.length === 0)
-                break;
-            for (const candidate of candidates) {
-                this.store.deleteMemory(candidate.id);
-                this.index.remove(candidate.id);
-                evictedCount++;
-            }
-        }
-        const freedBytes = sizeBefore - this.getCurrentSize();
-        return { evictedCount, freedBytes: Math.max(0, freedBytes) };
-    }
-}
-//# sourceMappingURL=memory-cache.js.map

package/dist/memory/memory-cache.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-cache.js","sourceRoot":"","sources":["../../src/memory/memory-cache.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,MAAM,gBAAgB,GAAG,SAAS,CAAC,CAAC,QAAQ;AAC5C,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAChC,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,iCAAiC;AAO5D,MAAM,OAAO,WAAW;IAIZ;IACA;IAJF,YAAY,CAAS;IAE7B,YACU,KAAkB,EAClB,KAAgB,EACxB,YAAqB;QAFb,UAAK,GAAL,KAAK,CAAa;QAClB,UAAK,GAAL,KAAK,CAAW;QAGxB,IAAI,CAAC,YAAY,GAAG,YAAY,IAAI,gBAAgB,CAAC;IACvD,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;IACrC,CAAC;IAED,eAAe;QACb,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC;IAC3D,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC;IACnD,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,eAAwB;QACpC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QAC5C,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,eAAwB;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACzC,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,gCAAgC;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAC;QAE1F,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAChC,YAAY,EAAE,CAAC;QACjB,CAAC;QAED,sCAAsC;QACtC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACpD,OAAO,IAAI,CAAC,cAAc,EAAE,GAAG,UAAU,EAAE,CAAC;YAC1C,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAC;YAC9F,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAEvC,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;gBACvC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAChC,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACtD,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC;IAC/D,CAAC;IAEO,KAAK,CAAC,eAAwB;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACpD,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,OAAO,IAAI,CAAC,cAAc,EAAE,GAAG,UAAU,EAAE,CAAC;YAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAC;YAE1F,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAEnC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACnC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAChC,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACtD,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC;IAC/D,CAAC;CACF"}

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

@@ -1,42 +0,0 @@
-/**
- * Hybrid Search Engine with Reciprocal Rank Fusion (RRF)
- *
- * Combines BM25 keyword search (FTS5) with HNSW vector search
- * using RRF scoring for hybrid results.
- */
-import type { HNSWIndex } from './hnsw-index.js';
-import type { MemoryStore } from './memory-store.js';
-import type { Memory, MemorySearchOptions, MemorySearchResult, TimelineEntry } from './memory-types.js';
-export declare class MemorySearch {
-    private store;
-    private index;
-    private dimensions;
-    constructor(store: MemoryStore, index: HNSWIndex, dimensions?: number);
-    /**
-     * Search memories using the specified mode
-     */
-    search(options: MemorySearchOptions): MemorySearchResult[];
-    /**
-     * BM25 keyword search via FTS5
-     */
-    private searchBM25;
-    /**
-     * Vector similarity search via HNSW
-     */
-    private searchVector;
-    /**
-     * Hybrid search: BM25 + HNSW merged with Reciprocal Rank Fusion
-     *
-     * RRF formula: score(d) = 1/(k + rank_bm25(d)) + 1/(k + rank_hnsw(d))
-     */
-    private searchHybrid;
-    /**
-     * Layer 2: Get timeline context around a memory
-     */
-    getTimeline(memoryId: string, window?: number): TimelineEntry[];
-    /**
-     * Layer 3: Get full details for specific memory IDs
-     */
-    getFullDetails(ids: string[]): Memory[];
-}
-//# sourceMappingURL=memory-search.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"memory-search.d.ts","sourceRoot":"","sources":["../../src/memory/memory-search.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EACV,MAAM,EACN,mBAAmB,EACnB,kBAAkB,EAElB,aAAa,EACd,MAAM,mBAAmB,CAAC;AAK3B,qBAAa,YAAY;IAErB,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,UAAU;gBAFV,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,SAAS,EAChB,UAAU,GAAE,MAAY;IAGlC;;OAEG;IACH,MAAM,CAAC,OAAO,EAAE,mBAAmB,GAAG,kBAAkB,EAAE;IAe1D;;OAEG;IACH,OAAO,CAAC,UAAU;IAelB;;OAEG;IACH,OAAO,CAAC,YAAY;IA+CpB;;;;OAIG;IACH,OAAO,CAAC,YAAY;IA2DpB;;OAEG;IACH,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAE,MAAU,GAAG,aAAa,EAAE;IAoBlE;;OAEG;IACH,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;CAWxC"}

package/dist/memory/memory-search.js

@@ -1,180 +0,0 @@
-/**
- * Hybrid Search Engine with Reciprocal Rank Fusion (RRF)
- *
- * Combines BM25 keyword search (FTS5) with HNSW vector search
- * using RRF scoring for hybrid results.
- */
-import { vectorize } from './memory-vectorizer.js';
-const RRF_K = 60; // RRF smoothing constant
-export class MemorySearch {
-    store;
-    index;
-    dimensions;
-    constructor(store, index, dimensions = 256) {
-        this.store = store;
-        this.index = index;
-        this.dimensions = dimensions;
-    }
-    /**
-     * Search memories using the specified mode
-     */
-    search(options) {
-        const mode = options.mode ?? 'hybrid';
-        const limit = options.limit ?? 20;
-        switch (mode) {
-            case 'bm25':
-                return this.searchBM25(options.query, limit, options.type);
-            case 'vector':
-                return this.searchVector(options.query, limit, options.type);
-            case 'hybrid':
-            default:
-                return this.searchHybrid(options.query, limit, options.type);
-        }
-    }
-    /**
-     * BM25 keyword search via FTS5
-     */
-    searchBM25(query, limit, type) {
-        const results = this.store.searchBM25(query, limit, { type });
-        return results.map((r) => {
-            const memory = this.store.getMemory(r.id);
-            return {
-                id: r.id,
-                title: memory?.title ?? '',
-                type: (memory?.type ?? 'observation'),
-                score: r.score,
-                matchType: 'bm25',
-                createdAt: memory?.createdAt ?? 0,
-            };
-        });
-    }
-    /**
-     * Vector similarity search via HNSW
-     */
-    searchVector(query, limit, type) {
-        if (this.index.size === 0)
-            return [];
-        const queryVector = vectorize(query, this.dimensions);
-        const candidates = this.index.search(queryVector, limit * 2); // fetch extra for filtering
-        const results = [];
-        for (const candidate of candidates) {
-            // Handle code node vectors (prefixed with __code__)
-            if (candidate.label.startsWith('__code__')) {
-                const codeNodeId = candidate.label.replace('__code__', '');
-                const codeNode = this.store.getCodeNode(codeNodeId);
-                if (!codeNode)
-                    continue;
-                results.push({
-                    id: candidate.label, // Keep __code__ prefix so MCP tool can filter
-                    title: `[${codeNode.type}] ${codeNode.name} — ${codeNode.filePath}`,
-                    type: 'discovery', // Map code nodes to 'discovery' type
-                    score: 1 - candidate.distance,
-                    matchType: 'vector',
-                    createdAt: codeNode.updatedAt,
-                });
-                if (results.length >= limit)
-                    break;
-                continue;
-            }
-            // Standard memory vector lookup
-            const memory = this.store.getMemory(candidate.label);
-            if (!memory)
-                continue;
-            if (type && memory.type !== type)
-                continue;
-            results.push({
-                id: memory.id,
-                title: memory.title,
-                type: memory.type,
-                score: 1 - candidate.distance, // convert distance to similarity
-                matchType: 'vector',
-                createdAt: memory.createdAt,
-            });
-            if (results.length >= limit)
-                break;
-        }
-        return results;
-    }
-    /**
-     * Hybrid search: BM25 + HNSW merged with Reciprocal Rank Fusion
-     *
-     * RRF formula: score(d) = 1/(k + rank_bm25(d)) + 1/(k + rank_hnsw(d))
-     */
-    searchHybrid(query, limit, type) {
-        const bm25Results = this.searchBM25(query, limit * 2, type);
-        const vectorResults = this.searchVector(query, limit * 2, type);
-        // Build rank maps
-        const bm25Rank = new Map();
-        bm25Results.forEach((r, i) => bm25Rank.set(r.id, i + 1));
-        const vectorRank = new Map();
-        vectorResults.forEach((r, i) => vectorRank.set(r.id, i + 1));
-        // Collect all unique IDs
-        const allIds = new Set([...bm25Results.map((r) => r.id), ...vectorResults.map((r) => r.id)]);
-        // Compute RRF scores
-        const scored = [];
-        for (const id of allIds) {
-            const bRank = bm25Rank.get(id);
-            const vRank = vectorRank.get(id);
-            let score = 0;
-            if (bRank)
-                score += 1 / (RRF_K + bRank);
-            if (vRank)
-                score += 1 / (RRF_K + vRank);
-            const matchType = bRank && vRank ? 'both' : bRank ? 'bm25' : 'vector';
-            scored.push({ id, score, matchType });
-        }
-        // Sort by RRF score descending
-        scored.sort((a, b) => b.score - a.score);
-        // Build results with metadata
-        const results = [];
-        const memoryMap = new Map();
-        for (const r of [...bm25Results, ...vectorResults]) {
-            if (!memoryMap.has(r.id))
-                memoryMap.set(r.id, r);
-        }
-        for (const s of scored.slice(0, limit)) {
-            const base = memoryMap.get(s.id);
-            if (base) {
-                results.push({
-                    ...base,
-                    score: s.score,
-                    matchType: s.matchType,
-                });
-            }
-        }
-        return results;
-    }
-    /**
-     * Layer 2: Get timeline context around a memory
-     */
-    getTimeline(memoryId, window = 5) {
-        const rows = this.store.getTimelineAround(memoryId, window);
-        return rows.map((row) => ({
-            id: row.id,
-            title: row.title,
-            type: row.type,
-            createdAt: row.createdAt,
-            position: row.id === memoryId
-                ? 'anchor'
-                : row.createdAt <= (rows.find((r) => r.id === memoryId)?.createdAt ?? 0)
-                    ? 'before'
-                    : 'after',
-            distanceFromAnchor: Math.abs(row.createdAt - (rows.find((r) => r.id === memoryId)?.createdAt ?? 0)),
-        }));
-    }
-    /**
-     * Layer 3: Get full details for specific memory IDs
-     */
-    getFullDetails(ids) {
-        const memories = [];
-        for (const id of ids) {
-            const memory = this.store.getMemory(id);
-            if (memory) {
-                this.store.updateAccessedAt(id);
-                memories.push(memory);
-            }
-        }
-        return memories;
-    }
-}
-//# sourceMappingURL=memory-search.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"memory-search.js","sourceRoot":"","sources":["../../src/memory/memory-search.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAWH,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAEnD,MAAM,KAAK,GAAG,EAAE,CAAC,CAAC,yBAAyB;AAE3C,MAAM,OAAO,YAAY;IAEb;IACA;IACA;IAHV,YACU,KAAkB,EAClB,KAAgB,EAChB,aAAqB,GAAG;QAFxB,UAAK,GAAL,KAAK,CAAa;QAClB,UAAK,GAAL,KAAK,CAAW;QAChB,eAAU,GAAV,UAAU,CAAc;IAC/B,CAAC;IAEJ;;OAEG;IACH,MAAM,CAAC,OAA4B;QACjC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC;QACtC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;QAElC,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,MAAM;gBACT,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;YAC7D,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/D,KAAK,QAAQ,CAAC;YACd;gBACE,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAa,EAAE,KAAa,EAAE,IAAiB;QAChE,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9D,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1C,OAAO;gBACL,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,KAAK,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE;gBAC1B,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,IAAI,aAAa,CAAe;gBACnD,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,SAAS,EAAE,MAAe;gBAC1B,SAAS,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC;aAClC,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,KAAa,EAAE,KAAa,EAAE,IAAiB;QAClE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,4BAA4B;QAE1F,MAAM,OAAO,GAAyB,EAAE,CAAC;QACzC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,oDAAoD;YACpD,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;gBAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;gBACpD,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,OAAO,CAAC,IAAI,CAAC;oBACX,EAAE,EAAE,SAAS,CAAC,KAAK,EAAE,8CAA8C;oBACnE,KAAK,EAAE,IAAI,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,MAAM,QAAQ,CAAC,QAAQ,EAAE;oBACnE,IAAI,EAAE,WAAyB,EAAE,qCAAqC;oBACtE,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,QAAQ;oBAC7B,SAAS,EAAE,QAAQ;oBACnB,SAAS,EAAE,QAAQ,CAAC,SAAS;iBAC9B,CAAC,CAAC;gBAEH,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK;oBAAE,MAAM;gBACnC,SAAS;YACX,CAAC;YAED,gCAAgC;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACrD,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI;gBAAE,SAAS;YAE3C,OAAO,CAAC,IAAI,CAAC;gBACX,EAAE,EAAE,MAAM,CAAC,EAAE;gBACb,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,QAAQ,EAAE,iCAAiC;gBAChE,SAAS,EAAE,QAAQ;gBACnB,SAAS,EAAE,MAAM,CAAC,SAAS;aAC5B,CAAC,CAAC;YAEH,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACrC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,KAAa,EAAE,KAAa,EAAE,IAAiB;QAClE,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5D,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QAEhE,kBAAkB;QAClB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEzD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE7D,yBAAyB;QACzB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE7F,qBAAqB;QACrB,MAAM,MAAM,GAIP,EAAE,CAAC;QAER,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEjC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,KAAK;gBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;YACxC,IAAI,KAAK;gBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;YAExC,MAAM,SAAS,GACb,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;YAEtD,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,+BAA+B;QAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAEzC,8BAA8B;QAC9B,MAAM,OAAO,GAAyB,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,GAAG,EAA8B,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC;YACnD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACnD,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,IAAI,EAAE,CAAC;gBACT,OAAO,CAAC,IAAI,CAAC;oBACX,GAAG,IAAI;oBACP,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,SAAS,EAAE,CAAC,CAAC,SAAS;iBACvB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,QAAgB,EAAE,SAAiB,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAE5D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACxB,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,IAAI,EAAE,GAAG,CAAC,IAAkB;YAC5B,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,QAAQ,EACN,GAAG,CAAC,EAAE,KAAK,QAAQ;gBACjB,CAAC,CAAE,QAAkB;gBACrB,CAAC,CAAC,GAAG,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,SAAS,IAAI,CAAC,CAAC;oBACtE,CAAC,CAAE,QAAkB;oBACrB,CAAC,CAAE,OAAiB;YAC1B,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAC1B,GAAG,CAAC,SAAS,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,SAAS,IAAI,CAAC,CAAC,CACtE;SACF,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,GAAa;QAC1B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;gBAChC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF"}

package/dist/memory/memory-store.d.ts

@@ -1,84 +0,0 @@
-/**
- * SQLite Storage Layer using better-sqlite3 (native)
- *
- * Provides CRUD operations for memories and sessions,
- * with FTS5 full-text search (BM25 ranking).
- *
- * Replaced sql.js (WASM) in v5.0 to eliminate:
- * - Full DB export() copies on every save (100-500MB allocations)
- * - WASM JIT warmup delay (~300ms on init)
- * - Event loop blocking on synchronous writeFileSync of entire DB
- *
- * better-sqlite3 writes directly to disk via SQLite's WAL journal.
- * No export(), no manual saveToDisk(), no memory copies.
- */
-import type { Memory, MemorySession, MemoryType } from './memory-types.js';
-export declare class MemoryStore {
-    private db;
-    private dbPath;
-    private initialized;
-    constructor(dbPath: string);
-    initialize(): Promise<void>;
-    private createSchema;
-    saveMemory(memory: Memory): void;
-    getMemory(id: string): Memory | null;
-    deleteMemory(id: string): void;
-    listMemories(options?: {
-        type?: MemoryType;
-        limit?: number;
-        offset?: number;
-        project?: string;
-    }): Memory[];
-    updateAccessedAt(id: string): void;
-    getMemoryCount(): number;
-    searchBM25(query: string, limit?: number, filters?: {
-        type?: MemoryType;
-        project?: string;
-    }): Array<{
-        id: string;
-        score: number;
-    }>;
-    private searchLike;
-    createSession(session: MemorySession): void;
-    endSession(id: string, summary?: string): void;
-    getActiveSession(): MemorySession | null;
-    getSessionCount(): number;
-    getOldestMemoryTimestamp(): number | undefined;
-    getNewestMemoryTimestamp(): number | undefined;
-    getEvictionCandidates(batchSize: number, activeSessionId?: string): Array<{
-        id: string;
-    }>;
-    /**
-     * Get memories in chronological order around a given memory
-     */
-    getTimelineAround(memoryId: string, window: number): Array<{
-        id: string;
-        title: string;
-        type: string;
-        createdAt: number;
-    }>;
-    getDbSizeBytes(): number;
-    saveToDisk(): void;
-    close(): void;
-    /**
-     * Wraps a sql.js database to expose the same API surface as better-sqlite3.
-     * This enables the rest of the class to use db.prepare().run/get/all uniformly.
-     */
-    private wrapSqlJs;
-    private rowToMemory;
-    saveCodeNode(node: import('../core/indexer/indexer-types.js').CodeNode): void;
-    saveCodeEdge(edge: import('../core/indexer/indexer-types.js').CodeEdge): void;
-    getCodeNodeIdsByFile(filePath: string): string[];
-    deleteCodeNodesByFile(filePath: string): void;
-    getCodeNodeByHash(id: string): string | null;
-    getCodeNode(id: string): {
-        id: string;
-        type: string;
-        name: string;
-        filePath: string;
-        content: string;
-        hash: string;
-        updatedAt: number;
-    } | null;
-}
-//# sourceMappingURL=memory-store.d.ts.map

package/dist/memory/memory-store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-store.d.ts","sourceRoot":"","sources":["../../src/memory/memory-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAE3E,qBAAa,WAAW;IACtB,OAAO,CAAC,EAAE,CAA6B;IACvC,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,WAAW,CAAS;gBAEhB,MAAM,EAAE,MAAM;IAIpB,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IA2CjC,OAAO,CAAC,YAAY;IA4GpB,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAsBhC,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAcpC,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAK9B,YAAY,CAAC,OAAO,CAAC,EAAE;QACrB,IAAI,CAAC,EAAE,UAAU,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,OAAO,CAAC,EAAE,MAAM,CAAC;KAClB,GAAG,MAAM,EAAE;IA6BZ,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAKlC,cAAc,IAAI,MAAM;IAUxB,UAAU,CACR,KAAK,EAAE,MAAM,EACb,KAAK,GAAE,MAAW,EAClB,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,UAAU,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE,GAChD,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAwCvC,OAAO,CAAC,UAAU;IA+BlB,aAAa,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;IAmB3C,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI;IAO9C,gBAAgB,IAAI,aAAa,GAAG,IAAI;IAuBxC,eAAe,IAAI,MAAM;IAUzB,wBAAwB,IAAI,MAAM,GAAG,SAAS;IAQ9C,wBAAwB,IAAI,MAAM,GAAG,SAAS;IAQ9C,qBAAqB,CAAC,SAAS,EAAE,MAAM,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;IAgBzF;;OAEG;IACH,iBAAiB,CACf,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,GACb,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IAuCxE,cAAc,IAAI,MAAM;IAYxB,UAAU,IAAI,IAAI;IAalB,KAAK,IAAI,IAAI;IAQb;;;OAGG;IAEH,OAAO,CAAC,SAAS;IA8EjB,OAAO,CAAC,WAAW;IAiBnB,YAAY,CAAC,IAAI,EAAE,OAAO,kCAAkC,EAAE,QAAQ,GAAG,IAAI;IAsB7E,YAAY,CAAC,IAAI,EAAE,OAAO,kCAAkC,EAAE,QAAQ,GAAG,IAAI;IAW7E,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAQhD,qBAAqB,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAK7C,iBAAiB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAQ5C,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG;QACvB,EAAE,EAAE,MAAM,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE,MAAM,CAAC;QACb,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;KACnB,GAAG,IAAI;CAmBT"}