agentic-flow 2.0.7 → 3.0.0-alpha.2

package/dist/packages/agentdb/src/controllers/HierarchicalMemory.js

@@ -0,0 +1,519 @@
+/**
+ * HierarchicalMemory - 3-Tier Human-like Memory System
+ *
+ * Implements a biologically-inspired memory hierarchy with:
+ * - Working Memory: Active context (fast access, 1MB limit)
+ * - Episodic Memory: Recent experiences (hours-days)
+ * - Semantic Memory: Long-term knowledge (consolidated)
+ *
+ * Based on:
+ * - Atkinson-Shiffrin Multi-Store Model (1968)
+ * - Tulving's Episodic/Semantic Distinction (1972)
+ * - Baddeley's Working Memory Model (2000)
+ *
+ * Features:
+ * - Automatic tier promotion based on access frequency and importance
+ * - Forgetting curves (Ebbinghaus decay: R = e^(-t/S))
+ * - Spaced repetition for consolidation
+ * - Context-dependent recall
+ * - Memory replay for reinforcement
+ *
+ * ADR-066 Phase P2-3
+ */
+import { cosineSimilarity } from '../utils/vector-math.js';
+export class HierarchicalMemory {
+    db;
+    embedder;
+    vectorBackend;
+    graphBackend;
+    config;
+    // In-memory caches for fast access
+    workingMemoryCache = new Map();
+    episodicMemoryIndex = new Map();
+    // Stats tracking
+    stats = {
+        totalAccesses: 0,
+        promotions: 0,
+        consolidations: 0,
+        forgotten: 0,
+    };
+    constructor(db, embedder, vectorBackend, graphBackend, config) {
+        this.db = db;
+        this.embedder = embedder;
+        this.vectorBackend = vectorBackend;
+        this.graphBackend = graphBackend;
+        this.config = {
+            workingMemoryLimit: 1024 * 1024, // 1MB
+            episodicWindow: 7 * 24 * 60 * 60 * 1000, // 7 days
+            forgetting: {
+                decayRate: 0.3,
+                minRetention: 0.1,
+                importanceMultiplier: 2.0,
+                rehearsalBoost: 1.5,
+            },
+            consolidation: {
+                minAccessCount: 3,
+                minImportance: 0.6,
+                minAge: 24 * 60 * 60 * 1000, // 24 hours
+                maxEpisodicSize: 1000,
+            },
+            autoConsolidate: true,
+            ...config,
+        };
+        this.initializeDatabase();
+    }
+    /**
+     * Initialize database tables for hierarchical memory
+     */
+    initializeDatabase() {
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS hierarchical_memory (
+        id TEXT PRIMARY KEY,
+        tier TEXT NOT NULL,
+        content TEXT NOT NULL,
+        importance REAL NOT NULL,
+        access_count INTEGER DEFAULT 0,
+        created_at INTEGER NOT NULL,
+        last_accessed_at INTEGER NOT NULL,
+        last_rehearsed_at INTEGER,
+        consolidated_at INTEGER,
+        tags TEXT,
+        context TEXT,
+        metadata TEXT
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_hierarchical_tier ON hierarchical_memory(tier);
+      CREATE INDEX IF NOT EXISTS idx_hierarchical_importance ON hierarchical_memory(importance);
+      CREATE INDEX IF NOT EXISTS idx_hierarchical_access ON hierarchical_memory(access_count);
+      CREATE INDEX IF NOT EXISTS idx_hierarchical_created ON hierarchical_memory(created_at);
+    `);
+    }
+    /**
+     * Store a new memory item
+     */
+    async store(content, importance = 0.5, tier = 'working', options) {
+        const id = `mem-${Date.now()}-${Math.random().toString(36).substr(2, 9)}`;
+        const now = Date.now();
+        // Generate embedding
+        const embedding = await this.embedder.embed(content);
+        const item = {
+            id,
+            tier,
+            content,
+            embedding,
+            importance,
+            accessCount: 0,
+            createdAt: now,
+            lastAccessedAt: now,
+            tags: options?.tags,
+            context: options?.context,
+            metadata: options?.metadata,
+        };
+        // Store in database
+        const stmt = this.db.prepare(`
+      INSERT INTO hierarchical_memory (
+        id, tier, content, importance, access_count,
+        created_at, last_accessed_at, tags, context, metadata
+      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        stmt.run(id, tier, content, importance, 0, now, now, options?.tags ? JSON.stringify(options.tags) : null, options?.context ? JSON.stringify(options.context) : null, options?.metadata ? JSON.stringify(options.metadata) : null);
+        // Add to vector backend if available
+        if (this.vectorBackend) {
+            this.vectorBackend.insert(id, embedding, {
+                tier,
+                importance,
+                createdAt: now,
+                ...options?.metadata,
+            });
+        }
+        // Cache in appropriate tier
+        if (tier === 'working') {
+            this.workingMemoryCache.set(id, item);
+            await this.enforceWorkingMemoryLimit();
+        }
+        else if (tier === 'episodic') {
+            this.episodicMemoryIndex.set(id, item);
+        }
+        // Trigger auto-consolidation if needed
+        if (this.config.autoConsolidate) {
+            await this.checkConsolidation();
+        }
+        return id;
+    }
+    /**
+     * Retrieve memories matching the query
+     */
+    async recall(query) {
+        this.stats.totalAccesses++;
+        // Generate embedding if not provided
+        const queryEmbedding = query.queryEmbedding || await this.embedder.embed(query.query);
+        // Determine which tiers to search
+        const tiers = Array.isArray(query.tier)
+            ? query.tier
+            : query.tier
+                ? [query.tier]
+                : ['working', 'episodic', 'semantic'];
+        const k = query.k || 10;
+        const threshold = query.threshold || 0.5;
+        let results = [];
+        // Search vector backend if available (faster)
+        if (this.vectorBackend) {
+            const searchResults = [];
+            for (const tier of tiers) {
+                const tierResults = await this.vectorBackend.search(queryEmbedding, k, {
+                    threshold,
+                    filter: { tier },
+                });
+                searchResults.push(...tierResults);
+            }
+            // Convert to MemoryItems
+            results = await Promise.all(searchResults.map(async (result) => {
+                const item = await this.getMemoryById(result.id);
+                if (item) {
+                    item.metadata = { ...item.metadata, similarity: result.similarity };
+                }
+                return item;
+            })).then(items => items.filter((item) => item !== null));
+        }
+        else {
+            // Fallback: manual search
+            results = await this.manualSearch(queryEmbedding, ['working', 'episodic', 'semantic'], k, threshold);
+        }
+        // Apply forgetting curve if not including decayed
+        if (!query.includeDecayed) {
+            results = results.filter(item => this.calculateRetention(item) >= this.config.forgetting.minRetention);
+        }
+        // Context-dependent recall
+        if (query.context) {
+            results = this.applyContextFilter(results, query.context);
+        }
+        // Update access tracking and promote if needed
+        await this.updateAccessTracking(results.map(r => r.id));
+        return results.slice(0, k);
+    }
+    /**
+     * Promote memory to higher tier based on importance and access
+     */
+    async promote(memoryId) {
+        const item = await this.getMemoryById(memoryId);
+        if (!item)
+            return false;
+        let newTier = null;
+        // Working → Episodic: After multiple accesses
+        if (item.tier === 'working' && item.accessCount >= 2) {
+            newTier = 'episodic';
+        }
+        // Episodic → Semantic: Based on consolidation criteria
+        if (item.tier === 'episodic') {
+            const age = Date.now() - item.createdAt;
+            if (item.accessCount >= this.config.consolidation.minAccessCount &&
+                item.importance >= this.config.consolidation.minImportance &&
+                age >= this.config.consolidation.minAge) {
+                newTier = 'semantic';
+            }
+        }
+        if (newTier) {
+            await this.updateTier(memoryId, newTier);
+            this.stats.promotions++;
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Rehearse a memory to strengthen retention
+     */
+    async rehearse(memoryId) {
+        const now = Date.now();
+        const stmt = this.db.prepare(`
+      UPDATE hierarchical_memory
+      SET last_rehearsed_at = ?, access_count = access_count + 1
+      WHERE id = ?
+    `);
+        stmt.run(now, memoryId);
+        // Update cache
+        const item = this.workingMemoryCache.get(memoryId) || this.episodicMemoryIndex.get(memoryId);
+        if (item) {
+            item.lastRehearsedAt = now;
+            item.accessCount++;
+        }
+    }
+    /**
+     * Calculate retention score using Ebbinghaus forgetting curve
+     * R(t) = e^(-t/S)
+     * Where S = base_strength * importance_multiplier * rehearsal_boost
+     */
+    calculateRetention(item) {
+        const now = Date.now();
+        const timeSinceCreation = (now - item.createdAt) / (24 * 60 * 60 * 1000); // days
+        const timeSinceRehearsal = item.lastRehearsedAt
+            ? (now - item.lastRehearsedAt) / (24 * 60 * 60 * 1000)
+            : timeSinceCreation;
+        // Calculate strength (inverse of decay rate)
+        const baseStrength = 1 / this.config.forgetting.decayRate;
+        const importanceBoost = 1 + (item.importance * this.config.forgetting.importanceMultiplier);
+        const rehearsalBoost = item.lastRehearsedAt ? this.config.forgetting.rehearsalBoost : 1.0;
+        const strength = baseStrength * importanceBoost * rehearsalBoost;
+        // Ebbinghaus formula
+        const retention = Math.exp(-timeSinceRehearsal / strength);
+        return Math.max(retention, this.config.forgetting.minRetention);
+    }
+    /**
+     * Get memory statistics
+     */
+    async getStats() {
+        const workingStats = this.db.prepare(`
+      SELECT
+        COUNT(*) as count,
+        AVG(importance) as avgImportance,
+        AVG(access_count) as avgAccessCount,
+        SUM(LENGTH(content)) as sizeBytes
+      FROM hierarchical_memory WHERE tier = 'working'
+    `).get();
+        const episodicStats = this.db.prepare(`
+      SELECT
+        COUNT(*) as count,
+        AVG(importance) as avgImportance,
+        AVG(? - created_at) as avgAge,
+        SUM(LENGTH(content)) as sizeBytes
+      FROM hierarchical_memory WHERE tier = 'episodic'
+    `).get(Date.now());
+        const semanticStats = this.db.prepare(`
+      SELECT
+        COUNT(*) as count,
+        AVG(importance) as avgImportance,
+        COUNT(CASE WHEN consolidated_at IS NOT NULL THEN 1 END) as consolidated,
+        SUM(LENGTH(content)) as sizeBytes
+      FROM hierarchical_memory WHERE tier = 'semantic'
+    `).get();
+        const totalMemories = workingStats.count + episodicStats.count + semanticStats.count;
+        const promotionRate = totalMemories > 0 ? this.stats.promotions / totalMemories : 0;
+        return {
+            working: {
+                count: workingStats.count || 0,
+                sizeBytes: workingStats.sizeBytes || 0,
+                avgImportance: workingStats.avgImportance || 0,
+                avgAccessCount: workingStats.avgAccessCount || 0,
+            },
+            episodic: {
+                count: episodicStats.count || 0,
+                sizeBytes: episodicStats.sizeBytes || 0,
+                avgImportance: episodicStats.avgImportance || 0,
+                avgAge: episodicStats.avgAge || 0,
+            },
+            semantic: {
+                count: semanticStats.count || 0,
+                sizeBytes: semanticStats.sizeBytes || 0,
+                avgImportance: semanticStats.avgImportance || 0,
+                consolidationRate: semanticStats.count > 0
+                    ? (semanticStats.consolidated || 0) / semanticStats.count
+                    : 0,
+            },
+            totalMemories,
+            forgottenCount: this.stats.forgotten,
+            promotionRate,
+        };
+    }
+    /**
+     * Enforce working memory size limit by evicting least important items
+     */
+    async enforceWorkingMemoryLimit() {
+        const currentSize = this.calculateWorkingMemorySize();
+        if (currentSize > this.config.workingMemoryLimit) {
+            // Get working memories sorted by importance * retention
+            const memories = Array.from(this.workingMemoryCache.values())
+                .map(item => ({
+                ...item,
+                score: item.importance * this.calculateRetention(item),
+            }))
+                .sort((a, b) => a.score - b.score);
+            // Evict until under limit
+            let freedSize = 0;
+            for (const memory of memories) {
+                if (currentSize - freedSize <= this.config.workingMemoryLimit)
+                    break;
+                // Promote to episodic or forget
+                if (memory.score > 0.3) {
+                    await this.updateTier(memory.id, 'episodic');
+                }
+                else {
+                    await this.forget(memory.id);
+                }
+                freedSize += new TextEncoder().encode(memory.content).length;
+                this.workingMemoryCache.delete(memory.id);
+            }
+        }
+    }
+    /**
+     * Calculate current working memory size in bytes
+     */
+    calculateWorkingMemorySize() {
+        let size = 0;
+        for (const item of this.workingMemoryCache.values()) {
+            size += new TextEncoder().encode(item.content).length;
+        }
+        return size;
+    }
+    /**
+     * Update memory tier
+     */
+    async updateTier(memoryId, newTier) {
+        const now = Date.now();
+        const stmt = this.db.prepare(`
+      UPDATE hierarchical_memory
+      SET tier = ?, consolidated_at = ?
+      WHERE id = ?
+    `);
+        stmt.run(newTier, newTier === 'semantic' ? now : null, memoryId);
+        // Update caches
+        const item = this.workingMemoryCache.get(memoryId) || this.episodicMemoryIndex.get(memoryId);
+        if (item) {
+            item.tier = newTier;
+            if (newTier === 'semantic') {
+                item.consolidatedAt = now;
+            }
+            // Move between caches
+            this.workingMemoryCache.delete(memoryId);
+            this.episodicMemoryIndex.delete(memoryId);
+            if (newTier === 'working') {
+                this.workingMemoryCache.set(memoryId, item);
+            }
+            else if (newTier === 'episodic') {
+                this.episodicMemoryIndex.set(memoryId, item);
+            }
+        }
+        // Update vector backend metadata
+        if (this.vectorBackend && item?.embedding) {
+            this.vectorBackend.insert(memoryId, item.embedding, {
+                tier: newTier,
+                consolidated: newTier === 'semantic',
+            });
+        }
+    }
+    /**
+     * Forget (delete) a memory
+     */
+    async forget(memoryId) {
+        this.db.prepare('DELETE FROM hierarchical_memory WHERE id = ?').run(memoryId);
+        this.workingMemoryCache.delete(memoryId);
+        this.episodicMemoryIndex.delete(memoryId);
+        this.stats.forgotten++;
+        // Remove from vector backend
+        if (this.vectorBackend) {
+            this.vectorBackend.remove(memoryId);
+        }
+    }
+    /**
+     * Get memory item by ID
+     */
+    async getMemoryById(id) {
+        // Check caches first
+        const cached = this.workingMemoryCache.get(id) || this.episodicMemoryIndex.get(id);
+        if (cached)
+            return cached;
+        // Fetch from database
+        const row = this.db.prepare(`
+      SELECT * FROM hierarchical_memory WHERE id = ?
+    `).get(id);
+        if (!row)
+            return null;
+        const item = {
+            id: row.id,
+            tier: row.tier,
+            content: row.content,
+            importance: row.importance,
+            accessCount: row.access_count,
+            createdAt: row.created_at,
+            lastAccessedAt: row.last_accessed_at,
+            lastRehearsedAt: row.last_rehearsed_at,
+            consolidatedAt: row.consolidated_at,
+            tags: row.tags ? JSON.parse(row.tags) : undefined,
+            context: row.context ? JSON.parse(row.context) : undefined,
+            metadata: row.metadata ? JSON.parse(row.metadata) : undefined,
+        };
+        return item;
+    }
+    /**
+     * Manual search without vector backend
+     */
+    async manualSearch(queryEmbedding, tiers, k, threshold) {
+        const tierFilter = tiers.map(t => `'${t}'`).join(',');
+        const rows = this.db.prepare(`
+      SELECT * FROM hierarchical_memory
+      WHERE tier IN (${tierFilter})
+      ORDER BY importance DESC
+      LIMIT ?
+    `).all(k * 2); // Get more to account for filtering
+        const results = [];
+        for (const row of rows) {
+            const embedding = await this.embedder.embed(row.content);
+            const similarity = cosineSimilarity(queryEmbedding, embedding);
+            if (similarity >= threshold) {
+                results.push({
+                    id: row.id,
+                    tier: row.tier,
+                    content: row.content,
+                    embedding,
+                    importance: row.importance,
+                    accessCount: row.access_count,
+                    createdAt: row.created_at,
+                    lastAccessedAt: row.last_accessed_at,
+                    lastRehearsedAt: row.last_rehearsed_at,
+                    consolidatedAt: row.consolidated_at,
+                    tags: row.tags ? JSON.parse(row.tags) : undefined,
+                    context: row.context ? JSON.parse(row.context) : undefined,
+                    metadata: row.metadata ? JSON.parse(row.metadata) : undefined,
+                    similarity,
+                });
+            }
+        }
+        return results.sort((a, b) => b.similarity - a.similarity).slice(0, k);
+    }
+    /**
+     * Apply context filter to results
+     */
+    applyContextFilter(results, context) {
+        return results.filter(item => {
+            if (!item.context)
+                return false;
+            // Check if at least 50% of context keys match
+            const keys = Object.keys(context);
+            const matches = keys.filter(key => item.context[key] === context[key]).length;
+            return matches / keys.length >= 0.5;
+        });
+    }
+    /**
+     * Update access tracking for retrieved memories
+     */
+    async updateAccessTracking(ids) {
+        if (ids.length === 0)
+            return;
+        const now = Date.now();
+        const placeholders = ids.map(() => '?').join(',');
+        this.db.prepare(`
+      UPDATE hierarchical_memory
+      SET access_count = access_count + 1, last_accessed_at = ?
+      WHERE id IN (${placeholders})
+    `).run(now, ...ids);
+        // Update caches
+        for (const id of ids) {
+            const item = this.workingMemoryCache.get(id) || this.episodicMemoryIndex.get(id);
+            if (item) {
+                item.accessCount++;
+                item.lastAccessedAt = now;
+                // Check for promotion
+                await this.promote(id);
+            }
+        }
+    }
+    /**
+     * Check if consolidation is needed and trigger if necessary
+     */
+    async checkConsolidation() {
+        const episodicCount = this.episodicMemoryIndex.size;
+        if (episodicCount >= this.config.consolidation.maxEpisodicSize) {
+            // Trigger consolidation (will be handled by MemoryConsolidation service)
+            console.log(`⚠️ Episodic memory full (${episodicCount} items). Consolidation recommended.`);
+        }
+    }
+}
+//# sourceMappingURL=HierarchicalMemory.js.map

package/dist/packages/agentdb/src/controllers/HierarchicalMemory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HierarchicalMemory.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/HierarchicalMemory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAKH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAqG3D,MAAM,OAAO,kBAAkB;IACrB,EAAE,CAAW;IACb,QAAQ,CAAmB;IAC3B,aAAa,CAAiB;IAC9B,YAAY,CAAgB;IAC5B,MAAM,CAA2B;IAEzC,mCAAmC;IAC3B,kBAAkB,GAAG,IAAI,GAAG,EAAsB,CAAC;IACnD,mBAAmB,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE5D,iBAAiB;IACT,KAAK,GAAG;QACd,aAAa,EAAE,CAAC;QAChB,UAAU,EAAE,CAAC;QACb,cAAc,EAAE,CAAC;QACjB,SAAS,EAAE,CAAC;KACb,CAAC;IAEF,YACE,EAAY,EACZ,QAA0B,EAC1B,aAA6B,EAC7B,YAA2B,EAC3B,MAA0C;QAE1C,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QAEjC,IAAI,CAAC,MAAM,GAAG;YACZ,kBAAkB,EAAE,IAAI,GAAG,IAAI,EAAE,MAAM;YACvC,cAAc,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,SAAS;YAClD,UAAU,EAAE;gBACV,SAAS,EAAE,GAAG;gBACd,YAAY,EAAE,GAAG;gBACjB,oBAAoB,EAAE,GAAG;gBACzB,cAAc,EAAE,GAAG;aACpB;YACD,aAAa,EAAE;gBACb,cAAc,EAAE,CAAC;gBACjB,aAAa,EAAE,GAAG;gBAClB,MAAM,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,WAAW;gBACxC,eAAe,EAAE,IAAI;aACtB;YACD,eAAe,EAAE,IAAI;YACrB,GAAG,MAAM;SACV,CAAC;QAEF,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,kBAAkB;QACxB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;KAoBZ,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CACT,OAAe,EACf,aAA8B,GAAG,EACjC,OAAmB,SAAS,EAC5B,OAIC;QAED,MAAM,EAAE,GAAG,OAAO,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QAC1E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,qBAAqB;QACrB,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAErD,MAAM,IAAI,GAAe;YACvB,EAAE;YACF,IAAI;YACJ,OAAO;YACP,SAAS;YACT,UAAU;YACV,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,GAAG;YACd,cAAc,EAAE,GAAG;YACnB,IAAI,EAAE,OAAO,EAAE,IAAI;YACnB,OAAO,EAAE,OAAO,EAAE,OAAO;YACzB,QAAQ,EAAE,OAAO,EAAE,QAAQ;SAC5B,CAAC;QAEF,oBAAoB;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;KAK5B,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CACN,EAAE,EACF,IAAI,EACJ,OAAO,EACP,UAAU,EACV,CAAC,EACD,GAAG,EACH,GAAG,EACH,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EACnD,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,EACzD,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAC5D,CAAC;QAEF,qCAAqC;QACrC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE;gBACvC,IAAI;gBACJ,UAAU;gBACV,SAAS,EAAE,GAAG;gBACd,GAAG,OAAO,EAAE,QAAQ;aACrB,CAAC,CAAC;QACL,CAAC;QAED,4BAA4B;QAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACtC,MAAM,IAAI,CAAC,yBAAyB,EAAE,CAAC;QACzC,CAAC;aAAM,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;YAC/B,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACzC,CAAC;QAED,uCAAuC;QACvC,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YAChC,MAAM,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAClC,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,KAAkB;QAC7B,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAE3B,qCAAqC;QACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,IAAI,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEtF,kCAAkC;QAClC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YACrC,CAAC,CAAC,KAAK,CAAC,IAAI;YACZ,CAAC,CAAC,KAAK,CAAC,IAAI;gBACV,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;gBACd,CAAC,CAAC,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAE1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,GAAG,CAAC;QAEzC,IAAI,OAAO,GAAiB,EAAE,CAAC;QAE/B,8CAA8C;QAC9C,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,aAAa,GAAmB,EAAE,CAAC;YAEzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC,EAAE;oBACrE,SAAS;oBACT,MAAM,EAAE,EAAE,IAAI,EAAE;iBACjB,CAAC,CAAC;gBACH,aAAa,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;YACrC,CAAC;YAED,yBAAyB;YACzB,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CACzB,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;gBACjC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,CAAC,QAAQ,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC;gBACtE,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CACH,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAsB,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;QAC7E,CAAC;aAAM,CAAC;YACN,0BAA0B;YAC1B,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,cAAc,EAAE,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAiB,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QACvH,CAAC;QAED,kDAAkD;QAClD,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;YAC1B,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QACzG,CAAC;QAED,2BAA2B;QAC3B,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAC5D,CAAC;QAED,+CAA+C;QAC/C,MAAM,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAExD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,QAAgB;QAC5B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,IAAI,OAAO,GAAsB,IAAI,CAAC;QAEtC,8CAA8C;QAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,EAAE,CAAC;YACrD,OAAO,GAAG,UAAU,CAAC;QACvB,CAAC;QAED,uDAAuD;QACvD,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;YACxC,IACE,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,cAAc;gBAC5D,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,aAAa;gBAC1D,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,EACvC,CAAC;gBACD,OAAO,GAAG,UAAU,CAAC;YACvB,CAAC;QACH,CAAC;QAED,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,QAAgB;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAI5B,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAExB,eAAe;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7F,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,eAAe,GAAG,GAAG,CAAC;YAC3B,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,kBAAkB,CAAC,IAAgB;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,iBAAiB,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO;QACjF,MAAM,kBAAkB,GAAG,IAAI,CAAC,eAAe;YAC7C,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YACtD,CAAC,CAAC,iBAAiB,CAAC;QAEtB,6CAA6C;QAC7C,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC;QAC1D,MAAM,eAAe,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;QAC5F,MAAM,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC;QAE1F,MAAM,QAAQ,GAAG,YAAY,GAAG,eAAe,GAAG,cAAc,CAAC;QAEjE,qBAAqB;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,kBAAkB,GAAG,QAAQ,CAAC,CAAC;QAE3D,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QACZ,MAAM,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;KAOpC,CAAC,CAAC,GAAG,EAAE,CAAC;QAET,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;KAOrC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAEnB,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;KAOrC,CAAC,CAAC,GAAG,EAAE,CAAC;QAET,MAAM,aAAa,GAAG,YAAY,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC;QACrF,MAAM,aAAa,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpF,OAAO;YACL,OAAO,EAAE;gBACP,KAAK,EAAE,YAAY,CAAC,KAAK,IAAI,CAAC;gBAC9B,SAAS,EAAE,YAAY,CAAC,SAAS,IAAI,CAAC;gBACtC,aAAa,EAAE,YAAY,CAAC,aAAa,IAAI,CAAC;gBAC9C,cAAc,EAAE,YAAY,CAAC,cAAc,IAAI,CAAC;aACjD;YACD,QAAQ,EAAE;gBACR,KAAK,EAAE,aAAa,CAAC,KAAK,IAAI,CAAC;gBAC/B,SAAS,EAAE,aAAa,CAAC,SAAS,IAAI,CAAC;gBACvC,aAAa,EAAE,aAAa,CAAC,aAAa,IAAI,CAAC;gBAC/C,MAAM,EAAE,aAAa,CAAC,MAAM,IAAI,CAAC;aAClC;YACD,QAAQ,EAAE;gBACR,KAAK,EAAE,aAAa,CAAC,KAAK,IAAI,CAAC;gBAC/B,SAAS,EAAE,aAAa,CAAC,SAAS,IAAI,CAAC;gBACvC,aAAa,EAAE,aAAa,CAAC,aAAa,IAAI,CAAC;gBAC/C,iBAAiB,EAAE,aAAa,CAAC,KAAK,GAAG,CAAC;oBACxC,CAAC,CAAC,CAAC,aAAa,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,KAAK;oBACzD,CAAC,CAAC,CAAC;aACN;YACD,aAAa;YACb,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS;YACpC,aAAa;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,yBAAyB;QACrC,MAAM,WAAW,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAEtD,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;YACjD,wDAAwD;YACxD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC;iBAC1D,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACZ,GAAG,IAAI;gBACP,KAAK,EAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;aACvD,CAAC,CAAC;iBACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAErC,0BAA0B;YAC1B,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,IAAI,WAAW,GAAG,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB;oBAAE,MAAM;gBAErE,gCAAgC;gBAChC,IAAI,MAAM,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC;oBACvB,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBAC/C,CAAC;qBAAM,CAAC;oBACN,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAC/B,CAAC;gBAED,SAAS,IAAI,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;gBAC7D,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,0BAA0B;QAChC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,CAAC;YACpD,IAAI,IAAI,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QACxD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,QAAgB,EAAE,OAAmB;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAI5B,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAEjE,gBAAgB;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7F,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;gBAC3B,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;YAC5B,CAAC;YAED,sBAAsB;YACtB,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACzC,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAE1C,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC9C,CAAC;iBAAM,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;gBAClC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,EAAE,SAAS,EAAE,CAAC;YAC1C,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE;gBAClD,IAAI,EAAE,OAAO;gBACb,YAAY,EAAE,OAAO,KAAK,UAAU;aACrC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,MAAM,CAAC,QAAgB;QACnC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9E,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;QAEvB,6BAA6B;QAC7B,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CAAC,EAAU;QACpC,qBAAqB;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnF,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAE1B,sBAAsB;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAE3B,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEX,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,MAAM,IAAI,GAAe;YACvB,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,cAAc,EAAE,GAAG,CAAC,gBAAgB;YACpC,eAAe,EAAE,GAAG,CAAC,iBAAiB;YACtC,cAAc,EAAE,GAAG,CAAC,eAAe;YACnC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;YACjD,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;YAC1D,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS;SAC9D,CAAC;QAEF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,YAAY,CACxB,cAA4B,EAC5B,KAAmB,EACnB,CAAS,EACT,SAAiB;QAEjB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEtD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;uBAEV,UAAU;;;KAG5B,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,oCAAoC;QAEnD,MAAM,OAAO,GAA+C,EAAE,CAAC;QAE/D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzD,MAAM,UAAU,GAAG,gBAAgB,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;YAE/D,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC;oBACX,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,SAAS;oBACT,UAAU,EAAE,GAAG,CAAC,UAAU;oBAC1B,WAAW,EAAE,GAAG,CAAC,YAAY;oBAC7B,SAAS,EAAE,GAAG,CAAC,UAAU;oBACzB,cAAc,EAAE,GAAG,CAAC,gBAAgB;oBACpC,eAAe,EAAE,GAAG,CAAC,iBAAiB;oBACtC,cAAc,EAAE,GAAG,CAAC,eAAe;oBACnC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;oBACjD,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;oBAC1D,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS;oBAC7D,UAAU;iBACX,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,OAAqB,EAAE,OAA4B;QAC5E,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YAC3B,IAAI,CAAC,IAAI,CAAC,OAAO;gBAAE,OAAO,KAAK,CAAC;YAEhC,8CAA8C;YAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,OAAQ,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAE/E,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC;QACtC,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,oBAAoB,CAAC,GAAa;QAC9C,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAE7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAElD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;qBAGC,YAAY;KAC5B,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC;QAEpB,gBAAgB;QAChB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjF,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,WAAW,EAAE,CAAC;gBACnB,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;gBAE1B,sBAAsB;gBACtB,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB;QAC9B,MAAM,aAAa,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;QAEpD,IAAI,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,EAAE,CAAC;YAC/D,yEAAyE;YACzE,OAAO,CAAC,GAAG,CAAC,4BAA4B,aAAa,qCAAqC,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC;CACF","sourcesContent":["/**\n * HierarchicalMemory - 3-Tier Human-like Memory System\n *\n * Implements a biologically-inspired memory hierarchy with:\n * - Working Memory: Active context (fast access, 1MB limit)\n * - Episodic Memory: Recent experiences (hours-days)\n * - Semantic Memory: Long-term knowledge (consolidated)\n *\n * Based on:\n * - Atkinson-Shiffrin Multi-Store Model (1968)\n * - Tulving's Episodic/Semantic Distinction (1972)\n * - Baddeley's Working Memory Model (2000)\n *\n * Features:\n * - Automatic tier promotion based on access frequency and importance\n * - Forgetting curves (Ebbinghaus decay: R = e^(-t/S))\n * - Spaced repetition for consolidation\n * - Context-dependent recall\n * - Memory replay for reinforcement\n *\n * ADR-066 Phase P2-3\n */\n\nimport type { VectorBackend, SearchResult } from '../backends/VectorBackend.js';\nimport type { GraphBackend } from '../backends/GraphBackend.js';\nimport { EmbeddingService } from './EmbeddingService.js';\nimport { cosineSimilarity } from '../utils/vector-math.js';\n\n// Database type from db-fallback\ntype Database = any;\n\n/** Memory tier in the hierarchy */\nexport type MemoryTier = 'working' | 'episodic' | 'semantic';\n\n/** Memory importance score (0-1, higher = more important) */\nexport type ImportanceScore = number;\n\n/** Memory item with metadata and embeddings */\nexport interface MemoryItem {\n  id: string;\n  tier: MemoryTier;\n  content: string;\n  embedding?: Float32Array;\n  importance: ImportanceScore;\n  accessCount: number;\n  createdAt: number;\n  lastAccessedAt: number;\n  lastRehearsedAt?: number;\n  consolidatedAt?: number;\n  tags?: string[];\n  context?: Record<string, any>;\n  metadata?: Record<string, any>;\n}\n\n/** Query for memory retrieval */\nexport interface MemoryQuery {\n  query: string;\n  queryEmbedding?: Float32Array;\n  tier?: MemoryTier | MemoryTier[];\n  k?: number;\n  threshold?: number;\n  context?: Record<string, any>;\n  includeDecayed?: boolean;\n}\n\n/** Memory statistics */\nexport interface MemoryStats {\n  working: {\n    count: number;\n    sizeBytes: number;\n    avgImportance: number;\n    avgAccessCount: number;\n  };\n  episodic: {\n    count: number;\n    sizeBytes: number;\n    avgImportance: number;\n    avgAge: number;\n  };\n  semantic: {\n    count: number;\n    sizeBytes: number;\n    avgImportance: number;\n    consolidationRate: number;\n  };\n  totalMemories: number;\n  forgottenCount: number;\n  promotionRate: number;\n}\n\n/** Forgetting curve configuration */\nexport interface ForgettingConfig {\n  /** Base decay rate (higher = faster forgetting) */\n  decayRate: number;\n  /** Minimum retention (memories don't decay below this) */\n  minRetention: number;\n  /** Importance multiplier (important memories decay slower) */\n  importanceMultiplier: number;\n  /** Rehearsal boost (how much rehearsal extends retention) */\n  rehearsalBoost: number;\n}\n\n/** Consolidation configuration */\nexport interface ConsolidationConfig {\n  /** Minimum access count for consolidation */\n  minAccessCount: number;\n  /** Minimum importance for consolidation */\n  minImportance: number;\n  /** Minimum age (ms) before episodic → semantic */\n  minAge: number;\n  /** Maximum episodic memories before forced consolidation */\n  maxEpisodicSize: number;\n}\n\nexport interface HierarchicalMemoryConfig {\n  /** Working memory size limit (bytes) */\n  workingMemoryLimit: number;\n  /** Episodic memory time window (ms) */\n  episodicWindow: number;\n  /** Forgetting curve parameters */\n  forgetting: ForgettingConfig;\n  /** Consolidation parameters */\n  consolidation: ConsolidationConfig;\n  /** Enable automatic consolidation */\n  autoConsolidate: boolean;\n}\n\nexport class HierarchicalMemory {\n  private db: Database;\n  private embedder: EmbeddingService;\n  private vectorBackend?: VectorBackend;\n  private graphBackend?: GraphBackend;\n  private config: HierarchicalMemoryConfig;\n\n  // In-memory caches for fast access\n  private workingMemoryCache = new Map<string, MemoryItem>();\n  private episodicMemoryIndex = new Map<string, MemoryItem>();\n\n  // Stats tracking\n  private stats = {\n    totalAccesses: 0,\n    promotions: 0,\n    consolidations: 0,\n    forgotten: 0,\n  };\n\n  constructor(\n    db: Database,\n    embedder: EmbeddingService,\n    vectorBackend?: VectorBackend,\n    graphBackend?: GraphBackend,\n    config?: Partial<HierarchicalMemoryConfig>\n  ) {\n    this.db = db;\n    this.embedder = embedder;\n    this.vectorBackend = vectorBackend;\n    this.graphBackend = graphBackend;\n\n    this.config = {\n      workingMemoryLimit: 1024 * 1024, // 1MB\n      episodicWindow: 7 * 24 * 60 * 60 * 1000, // 7 days\n      forgetting: {\n        decayRate: 0.3,\n        minRetention: 0.1,\n        importanceMultiplier: 2.0,\n        rehearsalBoost: 1.5,\n      },\n      consolidation: {\n        minAccessCount: 3,\n        minImportance: 0.6,\n        minAge: 24 * 60 * 60 * 1000, // 24 hours\n        maxEpisodicSize: 1000,\n      },\n      autoConsolidate: true,\n      ...config,\n    };\n\n    this.initializeDatabase();\n  }\n\n  /**\n   * Initialize database tables for hierarchical memory\n   */\n  private initializeDatabase(): void {\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS hierarchical_memory (\n        id TEXT PRIMARY KEY,\n        tier TEXT NOT NULL,\n        content TEXT NOT NULL,\n        importance REAL NOT NULL,\n        access_count INTEGER DEFAULT 0,\n        created_at INTEGER NOT NULL,\n        last_accessed_at INTEGER NOT NULL,\n        last_rehearsed_at INTEGER,\n        consolidated_at INTEGER,\n        tags TEXT,\n        context TEXT,\n        metadata TEXT\n      );\n\n      CREATE INDEX IF NOT EXISTS idx_hierarchical_tier ON hierarchical_memory(tier);\n      CREATE INDEX IF NOT EXISTS idx_hierarchical_importance ON hierarchical_memory(importance);\n      CREATE INDEX IF NOT EXISTS idx_hierarchical_access ON hierarchical_memory(access_count);\n      CREATE INDEX IF NOT EXISTS idx_hierarchical_created ON hierarchical_memory(created_at);\n    `);\n  }\n\n  /**\n   * Store a new memory item\n   */\n  async store(\n    content: string,\n    importance: ImportanceScore = 0.5,\n    tier: MemoryTier = 'working',\n    options?: {\n      tags?: string[];\n      context?: Record<string, any>;\n      metadata?: Record<string, any>;\n    }\n  ): Promise<string> {\n    const id = `mem-${Date.now()}-${Math.random().toString(36).substr(2, 9)}`;\n    const now = Date.now();\n\n    // Generate embedding\n    const embedding = await this.embedder.embed(content);\n\n    const item: MemoryItem = {\n      id,\n      tier,\n      content,\n      embedding,\n      importance,\n      accessCount: 0,\n      createdAt: now,\n      lastAccessedAt: now,\n      tags: options?.tags,\n      context: options?.context,\n      metadata: options?.metadata,\n    };\n\n    // Store in database\n    const stmt = this.db.prepare(`\n      INSERT INTO hierarchical_memory (\n        id, tier, content, importance, access_count,\n        created_at, last_accessed_at, tags, context, metadata\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    stmt.run(\n      id,\n      tier,\n      content,\n      importance,\n      0,\n      now,\n      now,\n      options?.tags ? JSON.stringify(options.tags) : null,\n      options?.context ? JSON.stringify(options.context) : null,\n      options?.metadata ? JSON.stringify(options.metadata) : null\n    );\n\n    // Add to vector backend if available\n    if (this.vectorBackend) {\n      this.vectorBackend.insert(id, embedding, {\n        tier,\n        importance,\n        createdAt: now,\n        ...options?.metadata,\n      });\n    }\n\n    // Cache in appropriate tier\n    if (tier === 'working') {\n      this.workingMemoryCache.set(id, item);\n      await this.enforceWorkingMemoryLimit();\n    } else if (tier === 'episodic') {\n      this.episodicMemoryIndex.set(id, item);\n    }\n\n    // Trigger auto-consolidation if needed\n    if (this.config.autoConsolidate) {\n      await this.checkConsolidation();\n    }\n\n    return id;\n  }\n\n  /**\n   * Retrieve memories matching the query\n   */\n  async recall(query: MemoryQuery): Promise<MemoryItem[]> {\n    this.stats.totalAccesses++;\n\n    // Generate embedding if not provided\n    const queryEmbedding = query.queryEmbedding || await this.embedder.embed(query.query);\n\n    // Determine which tiers to search\n    const tiers = Array.isArray(query.tier)\n      ? query.tier\n      : query.tier\n        ? [query.tier]\n        : ['working', 'episodic', 'semantic'];\n\n    const k = query.k || 10;\n    const threshold = query.threshold || 0.5;\n\n    let results: MemoryItem[] = [];\n\n    // Search vector backend if available (faster)\n    if (this.vectorBackend) {\n      const searchResults: SearchResult[] = [];\n\n      for (const tier of tiers) {\n        const tierResults = await this.vectorBackend.search(queryEmbedding, k, {\n          threshold,\n          filter: { tier },\n        });\n        searchResults.push(...tierResults);\n      }\n\n      // Convert to MemoryItems\n      results = await Promise.all(\n        searchResults.map(async (result) => {\n          const item = await this.getMemoryById(result.id);\n          if (item) {\n            item.metadata = { ...item.metadata, similarity: result.similarity };\n          }\n          return item;\n        })\n      ).then(items => items.filter((item): item is MemoryItem => item !== null));\n    } else {\n      // Fallback: manual search\n      results = await this.manualSearch(queryEmbedding, ['working', 'episodic', 'semantic'] as MemoryTier[], k, threshold);\n    }\n\n    // Apply forgetting curve if not including decayed\n    if (!query.includeDecayed) {\n      results = results.filter(item => this.calculateRetention(item) >= this.config.forgetting.minRetention);\n    }\n\n    // Context-dependent recall\n    if (query.context) {\n      results = this.applyContextFilter(results, query.context);\n    }\n\n    // Update access tracking and promote if needed\n    await this.updateAccessTracking(results.map(r => r.id));\n\n    return results.slice(0, k);\n  }\n\n  /**\n   * Promote memory to higher tier based on importance and access\n   */\n  async promote(memoryId: string): Promise<boolean> {\n    const item = await this.getMemoryById(memoryId);\n    if (!item) return false;\n\n    let newTier: MemoryTier | null = null;\n\n    // Working → Episodic: After multiple accesses\n    if (item.tier === 'working' && item.accessCount >= 2) {\n      newTier = 'episodic';\n    }\n\n    // Episodic → Semantic: Based on consolidation criteria\n    if (item.tier === 'episodic') {\n      const age = Date.now() - item.createdAt;\n      if (\n        item.accessCount >= this.config.consolidation.minAccessCount &&\n        item.importance >= this.config.consolidation.minImportance &&\n        age >= this.config.consolidation.minAge\n      ) {\n        newTier = 'semantic';\n      }\n    }\n\n    if (newTier) {\n      await this.updateTier(memoryId, newTier);\n      this.stats.promotions++;\n      return true;\n    }\n\n    return false;\n  }\n\n  /**\n   * Rehearse a memory to strengthen retention\n   */\n  async rehearse(memoryId: string): Promise<void> {\n    const now = Date.now();\n\n    const stmt = this.db.prepare(`\n      UPDATE hierarchical_memory\n      SET last_rehearsed_at = ?, access_count = access_count + 1\n      WHERE id = ?\n    `);\n\n    stmt.run(now, memoryId);\n\n    // Update cache\n    const item = this.workingMemoryCache.get(memoryId) || this.episodicMemoryIndex.get(memoryId);\n    if (item) {\n      item.lastRehearsedAt = now;\n      item.accessCount++;\n    }\n  }\n\n  /**\n   * Calculate retention score using Ebbinghaus forgetting curve\n   * R(t) = e^(-t/S)\n   * Where S = base_strength * importance_multiplier * rehearsal_boost\n   */\n  private calculateRetention(item: MemoryItem): number {\n    const now = Date.now();\n    const timeSinceCreation = (now - item.createdAt) / (24 * 60 * 60 * 1000); // days\n    const timeSinceRehearsal = item.lastRehearsedAt\n      ? (now - item.lastRehearsedAt) / (24 * 60 * 60 * 1000)\n      : timeSinceCreation;\n\n    // Calculate strength (inverse of decay rate)\n    const baseStrength = 1 / this.config.forgetting.decayRate;\n    const importanceBoost = 1 + (item.importance * this.config.forgetting.importanceMultiplier);\n    const rehearsalBoost = item.lastRehearsedAt ? this.config.forgetting.rehearsalBoost : 1.0;\n\n    const strength = baseStrength * importanceBoost * rehearsalBoost;\n\n    // Ebbinghaus formula\n    const retention = Math.exp(-timeSinceRehearsal / strength);\n\n    return Math.max(retention, this.config.forgetting.minRetention);\n  }\n\n  /**\n   * Get memory statistics\n   */\n  async getStats(): Promise<MemoryStats> {\n    const workingStats = this.db.prepare(`\n      SELECT\n        COUNT(*) as count,\n        AVG(importance) as avgImportance,\n        AVG(access_count) as avgAccessCount,\n        SUM(LENGTH(content)) as sizeBytes\n      FROM hierarchical_memory WHERE tier = 'working'\n    `).get();\n\n    const episodicStats = this.db.prepare(`\n      SELECT\n        COUNT(*) as count,\n        AVG(importance) as avgImportance,\n        AVG(? - created_at) as avgAge,\n        SUM(LENGTH(content)) as sizeBytes\n      FROM hierarchical_memory WHERE tier = 'episodic'\n    `).get(Date.now());\n\n    const semanticStats = this.db.prepare(`\n      SELECT\n        COUNT(*) as count,\n        AVG(importance) as avgImportance,\n        COUNT(CASE WHEN consolidated_at IS NOT NULL THEN 1 END) as consolidated,\n        SUM(LENGTH(content)) as sizeBytes\n      FROM hierarchical_memory WHERE tier = 'semantic'\n    `).get();\n\n    const totalMemories = workingStats.count + episodicStats.count + semanticStats.count;\n    const promotionRate = totalMemories > 0 ? this.stats.promotions / totalMemories : 0;\n\n    return {\n      working: {\n        count: workingStats.count || 0,\n        sizeBytes: workingStats.sizeBytes || 0,\n        avgImportance: workingStats.avgImportance || 0,\n        avgAccessCount: workingStats.avgAccessCount || 0,\n      },\n      episodic: {\n        count: episodicStats.count || 0,\n        sizeBytes: episodicStats.sizeBytes || 0,\n        avgImportance: episodicStats.avgImportance || 0,\n        avgAge: episodicStats.avgAge || 0,\n      },\n      semantic: {\n        count: semanticStats.count || 0,\n        sizeBytes: semanticStats.sizeBytes || 0,\n        avgImportance: semanticStats.avgImportance || 0,\n        consolidationRate: semanticStats.count > 0\n          ? (semanticStats.consolidated || 0) / semanticStats.count\n          : 0,\n      },\n      totalMemories,\n      forgottenCount: this.stats.forgotten,\n      promotionRate,\n    };\n  }\n\n  /**\n   * Enforce working memory size limit by evicting least important items\n   */\n  private async enforceWorkingMemoryLimit(): Promise<void> {\n    const currentSize = this.calculateWorkingMemorySize();\n\n    if (currentSize > this.config.workingMemoryLimit) {\n      // Get working memories sorted by importance * retention\n      const memories = Array.from(this.workingMemoryCache.values())\n        .map(item => ({\n          ...item,\n          score: item.importance * this.calculateRetention(item),\n        }))\n        .sort((a, b) => a.score - b.score);\n\n      // Evict until under limit\n      let freedSize = 0;\n      for (const memory of memories) {\n        if (currentSize - freedSize <= this.config.workingMemoryLimit) break;\n\n        // Promote to episodic or forget\n        if (memory.score > 0.3) {\n          await this.updateTier(memory.id, 'episodic');\n        } else {\n          await this.forget(memory.id);\n        }\n\n        freedSize += new TextEncoder().encode(memory.content).length;\n        this.workingMemoryCache.delete(memory.id);\n      }\n    }\n  }\n\n  /**\n   * Calculate current working memory size in bytes\n   */\n  private calculateWorkingMemorySize(): number {\n    let size = 0;\n    for (const item of this.workingMemoryCache.values()) {\n      size += new TextEncoder().encode(item.content).length;\n    }\n    return size;\n  }\n\n  /**\n   * Update memory tier\n   */\n  private async updateTier(memoryId: string, newTier: MemoryTier): Promise<void> {\n    const now = Date.now();\n\n    const stmt = this.db.prepare(`\n      UPDATE hierarchical_memory\n      SET tier = ?, consolidated_at = ?\n      WHERE id = ?\n    `);\n\n    stmt.run(newTier, newTier === 'semantic' ? now : null, memoryId);\n\n    // Update caches\n    const item = this.workingMemoryCache.get(memoryId) || this.episodicMemoryIndex.get(memoryId);\n    if (item) {\n      item.tier = newTier;\n      if (newTier === 'semantic') {\n        item.consolidatedAt = now;\n      }\n\n      // Move between caches\n      this.workingMemoryCache.delete(memoryId);\n      this.episodicMemoryIndex.delete(memoryId);\n\n      if (newTier === 'working') {\n        this.workingMemoryCache.set(memoryId, item);\n      } else if (newTier === 'episodic') {\n        this.episodicMemoryIndex.set(memoryId, item);\n      }\n    }\n\n    // Update vector backend metadata\n    if (this.vectorBackend && item?.embedding) {\n      this.vectorBackend.insert(memoryId, item.embedding, {\n        tier: newTier,\n        consolidated: newTier === 'semantic',\n      });\n    }\n  }\n\n  /**\n   * Forget (delete) a memory\n   */\n  private async forget(memoryId: string): Promise<void> {\n    this.db.prepare('DELETE FROM hierarchical_memory WHERE id = ?').run(memoryId);\n    this.workingMemoryCache.delete(memoryId);\n    this.episodicMemoryIndex.delete(memoryId);\n    this.stats.forgotten++;\n\n    // Remove from vector backend\n    if (this.vectorBackend) {\n      this.vectorBackend.remove(memoryId);\n    }\n  }\n\n  /**\n   * Get memory item by ID\n   */\n  private async getMemoryById(id: string): Promise<MemoryItem | null> {\n    // Check caches first\n    const cached = this.workingMemoryCache.get(id) || this.episodicMemoryIndex.get(id);\n    if (cached) return cached;\n\n    // Fetch from database\n    const row = this.db.prepare(`\n      SELECT * FROM hierarchical_memory WHERE id = ?\n    `).get(id);\n\n    if (!row) return null;\n\n    const item: MemoryItem = {\n      id: row.id,\n      tier: row.tier,\n      content: row.content,\n      importance: row.importance,\n      accessCount: row.access_count,\n      createdAt: row.created_at,\n      lastAccessedAt: row.last_accessed_at,\n      lastRehearsedAt: row.last_rehearsed_at,\n      consolidatedAt: row.consolidated_at,\n      tags: row.tags ? JSON.parse(row.tags) : undefined,\n      context: row.context ? JSON.parse(row.context) : undefined,\n      metadata: row.metadata ? JSON.parse(row.metadata) : undefined,\n    };\n\n    return item;\n  }\n\n  /**\n   * Manual search without vector backend\n   */\n  private async manualSearch(\n    queryEmbedding: Float32Array,\n    tiers: MemoryTier[],\n    k: number,\n    threshold: number\n  ): Promise<MemoryItem[]> {\n    const tierFilter = tiers.map(t => `'${t}'`).join(',');\n\n    const rows = this.db.prepare(`\n      SELECT * FROM hierarchical_memory\n      WHERE tier IN (${tierFilter})\n      ORDER BY importance DESC\n      LIMIT ?\n    `).all(k * 2); // Get more to account for filtering\n\n    const results: Array<MemoryItem & { similarity: number }> = [];\n\n    for (const row of rows) {\n      const embedding = await this.embedder.embed(row.content);\n      const similarity = cosineSimilarity(queryEmbedding, embedding);\n\n      if (similarity >= threshold) {\n        results.push({\n          id: row.id,\n          tier: row.tier,\n          content: row.content,\n          embedding,\n          importance: row.importance,\n          accessCount: row.access_count,\n          createdAt: row.created_at,\n          lastAccessedAt: row.last_accessed_at,\n          lastRehearsedAt: row.last_rehearsed_at,\n          consolidatedAt: row.consolidated_at,\n          tags: row.tags ? JSON.parse(row.tags) : undefined,\n          context: row.context ? JSON.parse(row.context) : undefined,\n          metadata: row.metadata ? JSON.parse(row.metadata) : undefined,\n          similarity,\n        });\n      }\n    }\n\n    return results.sort((a, b) => b.similarity - a.similarity).slice(0, k);\n  }\n\n  /**\n   * Apply context filter to results\n   */\n  private applyContextFilter(results: MemoryItem[], context: Record<string, any>): MemoryItem[] {\n    return results.filter(item => {\n      if (!item.context) return false;\n\n      // Check if at least 50% of context keys match\n      const keys = Object.keys(context);\n      const matches = keys.filter(key => item.context![key] === context[key]).length;\n\n      return matches / keys.length >= 0.5;\n    });\n  }\n\n  /**\n   * Update access tracking for retrieved memories\n   */\n  private async updateAccessTracking(ids: string[]): Promise<void> {\n    if (ids.length === 0) return;\n\n    const now = Date.now();\n    const placeholders = ids.map(() => '?').join(',');\n\n    this.db.prepare(`\n      UPDATE hierarchical_memory\n      SET access_count = access_count + 1, last_accessed_at = ?\n      WHERE id IN (${placeholders})\n    `).run(now, ...ids);\n\n    // Update caches\n    for (const id of ids) {\n      const item = this.workingMemoryCache.get(id) || this.episodicMemoryIndex.get(id);\n      if (item) {\n        item.accessCount++;\n        item.lastAccessedAt = now;\n\n        // Check for promotion\n        await this.promote(id);\n      }\n    }\n  }\n\n  /**\n   * Check if consolidation is needed and trigger if necessary\n   */\n  private async checkConsolidation(): Promise<void> {\n    const episodicCount = this.episodicMemoryIndex.size;\n\n    if (episodicCount >= this.config.consolidation.maxEpisodicSize) {\n      // Trigger consolidation (will be handled by MemoryConsolidation service)\n      console.log(`⚠️ Episodic memory full (${episodicCount} items). Consolidation recommended.`);\n    }\n  }\n}\n"]}