agentic-flow 2.0.7 → 3.0.0-alpha.2

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

@@ -0,0 +1,479 @@
+/**
+ * MemoryConsolidation - Nightly Memory Processing
+ *
+ * Implements automatic memory consolidation from episodic to semantic memory
+ * using spaced repetition and importance scoring.
+ *
+ * Based on:
+ * - Complementary Learning Systems (McClelland et al., 1995)
+ * - Active Systems Consolidation (Diekelmann & Born, 2010)
+ * - Spaced Repetition (Ebbinghaus, 1885)
+ *
+ * Process:
+ * 1. Identify consolidation candidates (high importance + multiple accesses)
+ * 2. Cluster similar episodic memories
+ * 3. Extract semantic patterns (abstractions)
+ * 4. Promote to semantic memory
+ * 5. Apply forgetting to low-value episodic memories
+ * 6. Schedule spaced repetition for important memories
+ *
+ * ADR-066 Phase P2-3
+ */
+import { cosineSimilarity } from '../utils/vector-math.js';
+export class MemoryConsolidation {
+    db;
+    hierarchicalMemory;
+    embedder;
+    vectorBackend;
+    graphBackend;
+    config;
+    // Spaced repetition tracking
+    repetitionSchedules = new Map();
+    constructor(db, hierarchicalMemory, embedder, vectorBackend, graphBackend, config) {
+        this.db = db;
+        this.hierarchicalMemory = hierarchicalMemory;
+        this.embedder = embedder;
+        this.vectorBackend = vectorBackend;
+        this.graphBackend = graphBackend;
+        this.config = {
+            clusterThreshold: 0.75,
+            minClusterSize: 3,
+            maxClusterSize: 20,
+            importanceThreshold: 0.6,
+            minAccessCount: 3,
+            enableSpacedRepetition: true,
+            initialInterval: 24 * 60 * 60 * 1000, // 24 hours
+            intervalMultiplier: 2.0,
+            forgettingThreshold: 0.2,
+            ...config,
+        };
+        this.initializeDatabase();
+        this.loadRepetitionSchedules();
+    }
+    /**
+     * Initialize database tables for consolidation tracking
+     */
+    initializeDatabase() {
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS consolidation_log (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        timestamp INTEGER NOT NULL,
+        execution_time_ms INTEGER NOT NULL,
+        episodic_processed INTEGER NOT NULL,
+        semantic_created INTEGER NOT NULL,
+        memories_forgotten INTEGER NOT NULL,
+        clusters_formed INTEGER NOT NULL,
+        retention_rate REAL NOT NULL
+      );
+
+      CREATE TABLE IF NOT EXISTS spaced_repetition (
+        memory_id TEXT PRIMARY KEY,
+        next_review INTEGER NOT NULL,
+        interval INTEGER NOT NULL,
+        ease_factor REAL NOT NULL,
+        repetitions INTEGER NOT NULL
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_spaced_next_review ON spaced_repetition(next_review);
+    `);
+    }
+    /**
+     * Run nightly consolidation process
+     */
+    async consolidate() {
+        console.log('\n🌙 Starting Memory Consolidation...\n');
+        const startTime = Date.now();
+        const report = {
+            timestamp: startTime,
+            executionTimeMs: 0,
+            episodicProcessed: 0,
+            semanticCreated: 0,
+            memoriesForgotten: 0,
+            clustersFormed: 0,
+            avgImportance: 0,
+            retentionRate: 0,
+            recommendations: [],
+        };
+        try {
+            // Step 1: Get consolidation candidates
+            console.log('📊 Identifying consolidation candidates...');
+            const candidates = await this.getConsolidationCandidates();
+            report.episodicProcessed = candidates.length;
+            console.log(`   Found ${candidates.length} episodic memories`);
+            if (candidates.length === 0) {
+                console.log('✅ No memories to consolidate');
+                report.executionTimeMs = Date.now() - startTime;
+                return report;
+            }
+            // Step 2: Cluster similar memories
+            console.log('🔗 Clustering similar memories...');
+            const clusters = await this.clusterMemories(candidates);
+            report.clustersFormed = clusters.length;
+            console.log(`   Formed ${clusters.length} clusters`);
+            // Step 3: Extract semantic patterns and create semantic memories
+            console.log('🧠 Extracting semantic patterns...');
+            for (const cluster of clusters) {
+                if (cluster.members.length >= this.config.minClusterSize) {
+                    const semanticMemory = await this.createSemanticMemory(cluster);
+                    if (semanticMemory) {
+                        report.semanticCreated++;
+                    }
+                }
+            }
+            console.log(`   Created ${report.semanticCreated} semantic memories`);
+            // Step 4: Apply forgetting curve
+            console.log('🗑️  Applying forgetting curve...');
+            const forgotten = await this.applyForgettingCurve(candidates);
+            report.memoriesForgotten = forgotten;
+            console.log(`   Forgot ${forgotten} low-value memories`);
+            // Step 5: Schedule spaced repetition
+            if (this.config.enableSpacedRepetition) {
+                console.log('📅 Scheduling spaced repetition...');
+                await this.scheduleSpacedRepetition(candidates);
+                console.log(`   Scheduled ${candidates.length - forgotten} memories`);
+            }
+            // Step 6: Calculate statistics
+            const totalImportance = candidates.reduce((sum, m) => sum + m.importance, 0);
+            report.avgImportance = candidates.length > 0 ? totalImportance / candidates.length : 0;
+            report.retentionRate = candidates.length > 0
+                ? (candidates.length - forgotten) / candidates.length
+                : 0;
+            // Step 7: Generate recommendations
+            report.recommendations = this.generateRecommendations(report);
+            report.executionTimeMs = Date.now() - startTime;
+            // Log consolidation
+            this.logConsolidation(report);
+            console.log('\n✅ Memory Consolidation Complete');
+            console.log(`   Time: ${report.executionTimeMs}ms`);
+            console.log(`   Retention: ${(report.retentionRate * 100).toFixed(1)}%`);
+            return report;
+        }
+        catch (error) {
+            console.error('❌ Memory consolidation failed:', error);
+            report.executionTimeMs = Date.now() - startTime;
+            return report;
+        }
+    }
+    /**
+     * Get episodic memories that are candidates for consolidation
+     */
+    async getConsolidationCandidates() {
+        const rows = this.db.prepare(`
+      SELECT * FROM hierarchical_memory
+      WHERE tier = 'episodic'
+        AND importance >= ?
+        AND access_count >= ?
+      ORDER BY importance DESC, access_count DESC
+    `).all(this.config.importanceThreshold, this.config.minAccessCount);
+        const candidates = [];
+        for (const row of rows) {
+            const embedding = await this.embedder.embed(row.content);
+            candidates.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,
+            });
+        }
+        return candidates;
+    }
+    /**
+     * Cluster similar memories using hierarchical clustering
+     */
+    async clusterMemories(memories) {
+        if (memories.length === 0)
+            return [];
+        const clusters = [];
+        const assigned = new Set();
+        // Simple greedy clustering
+        for (const memory of memories) {
+            if (assigned.has(memory.id))
+                continue;
+            // Create new cluster
+            const cluster = {
+                id: `cluster-${Date.now()}-${Math.random().toString(36).substr(2, 9)}`,
+                centroid: memory.embedding,
+                members: [memory],
+                avgImportance: memory.importance,
+            };
+            assigned.add(memory.id);
+            // Find similar memories to add to cluster
+            for (const candidate of memories) {
+                if (assigned.has(candidate.id))
+                    continue;
+                if (cluster.members.length >= this.config.maxClusterSize)
+                    break;
+                const similarity = cosineSimilarity(cluster.centroid, candidate.embedding);
+                if (similarity >= this.config.clusterThreshold) {
+                    cluster.members.push(candidate);
+                    assigned.add(candidate.id);
+                    // Update centroid (simple average)
+                    this.updateCentroid(cluster);
+                }
+            }
+            // Calculate average importance
+            cluster.avgImportance = cluster.members.reduce((sum, m) => sum + m.importance, 0) / cluster.members.length;
+            clusters.push(cluster);
+        }
+        return clusters;
+    }
+    /**
+     * Update cluster centroid (simple average)
+     */
+    updateCentroid(cluster) {
+        const dimension = cluster.centroid.length;
+        const newCentroid = new Float32Array(dimension);
+        for (const member of cluster.members) {
+            for (let i = 0; i < dimension; i++) {
+                newCentroid[i] += member.embedding[i];
+            }
+        }
+        for (let i = 0; i < dimension; i++) {
+            newCentroid[i] /= cluster.members.length;
+        }
+        cluster.centroid = newCentroid;
+    }
+    /**
+     * Create semantic memory from cluster
+     */
+    async createSemanticMemory(cluster) {
+        // Extract common pattern from cluster members
+        const pattern = this.extractSemanticPattern(cluster);
+        if (!pattern)
+            return null;
+        // Calculate consolidated importance (weighted by access count)
+        const totalAccess = cluster.members.reduce((sum, m) => sum + m.accessCount, 0);
+        const weightedImportance = cluster.members.reduce((sum, m) => sum + (m.importance * m.accessCount), 0) / totalAccess;
+        // Store as semantic memory
+        const memoryId = await this.hierarchicalMemory.store(pattern, weightedImportance, 'semantic', {
+            tags: this.extractCommonTags(cluster),
+            metadata: {
+                clusterId: cluster.id,
+                clusterSize: cluster.members.length,
+                sourceMemories: cluster.members.map(m => m.id),
+                consolidatedAt: Date.now(),
+            },
+        });
+        // Mark source episodic memories as consolidated
+        for (const member of cluster.members) {
+            await this.markConsolidated(member.id);
+        }
+        return memoryId;
+    }
+    /**
+     * Extract semantic pattern from cluster
+     */
+    extractSemanticPattern(cluster) {
+        if (cluster.members.length < this.config.minClusterSize)
+            return null;
+        // Simple pattern: find common themes in content
+        // In production, this could use LLM for better abstraction
+        const contents = cluster.members.map(m => m.content);
+        // For now, just return a summary of the most important memory
+        const mostImportant = cluster.members.reduce((best, m) => m.importance > best.importance ? m : best);
+        const pattern = `Pattern: ${mostImportant.content} (consolidated from ${cluster.members.length} similar memories)`;
+        return pattern;
+    }
+    /**
+     * Extract common tags from cluster members
+     */
+    extractCommonTags(cluster) {
+        const tagCounts = new Map();
+        for (const member of cluster.members) {
+            if (member.tags) {
+                for (const tag of member.tags) {
+                    tagCounts.set(tag, (tagCounts.get(tag) || 0) + 1);
+                }
+            }
+        }
+        // Return tags that appear in at least 50% of members
+        const threshold = cluster.members.length * 0.5;
+        return Array.from(tagCounts.entries())
+            .filter(([_, count]) => count >= threshold)
+            .map(([tag, _]) => tag);
+    }
+    /**
+     * Mark episodic memory as consolidated
+     */
+    async markConsolidated(memoryId) {
+        const now = Date.now();
+        this.db.prepare(`
+      UPDATE hierarchical_memory
+      SET consolidated_at = ?
+      WHERE id = ?
+    `).run(now, memoryId);
+    }
+    /**
+     * Apply forgetting curve and delete low-value memories
+     */
+    async applyForgettingCurve(memories) {
+        let forgotten = 0;
+        for (const memory of memories) {
+            const retention = this.calculateRetention(memory);
+            if (retention < this.config.forgettingThreshold) {
+                // Delete from database
+                this.db.prepare('DELETE FROM hierarchical_memory WHERE id = ?').run(memory.id);
+                // Remove from vector backend
+                if (this.vectorBackend) {
+                    this.vectorBackend.remove(memory.id);
+                }
+                forgotten++;
+            }
+        }
+        return forgotten;
+    }
+    /**
+     * Calculate retention using Ebbinghaus forgetting curve
+     */
+    calculateRetention(memory) {
+        const now = Date.now();
+        const daysSinceCreation = (now - memory.createdAt) / (24 * 60 * 60 * 1000);
+        const daysSinceRehearsal = memory.lastRehearsedAt
+            ? (now - memory.lastRehearsedAt) / (24 * 60 * 60 * 1000)
+            : daysSinceCreation;
+        // Strength increases with importance and rehearsal
+        const baseStrength = 5; // days
+        const importanceMultiplier = 1 + memory.importance * 2;
+        const rehearsalBoost = memory.lastRehearsedAt ? 1.5 : 1.0;
+        const strength = baseStrength * importanceMultiplier * rehearsalBoost;
+        // Ebbinghaus: R = e^(-t/S)
+        return Math.exp(-daysSinceRehearsal / strength);
+    }
+    /**
+     * Schedule spaced repetition for memories
+     */
+    async scheduleSpacedRepetition(memories) {
+        const now = Date.now();
+        for (const memory of memories) {
+            const existingSchedule = this.repetitionSchedules.get(memory.id);
+            if (existingSchedule) {
+                // Update existing schedule if review is due
+                if (now >= existingSchedule.nextReview) {
+                    this.updateRepetitionSchedule(memory.id, true);
+                }
+            }
+            else {
+                // Create new schedule
+                const schedule = {
+                    memoryId: memory.id,
+                    nextReview: now + this.config.initialInterval,
+                    interval: this.config.initialInterval,
+                    easeFactor: 2.5, // SM-2 algorithm default
+                    repetitions: 0,
+                };
+                this.repetitionSchedules.set(memory.id, schedule);
+                this.saveRepetitionSchedule(schedule);
+            }
+        }
+    }
+    /**
+     * Update repetition schedule after review
+     */
+    updateRepetitionSchedule(memoryId, success) {
+        const schedule = this.repetitionSchedules.get(memoryId);
+        if (!schedule)
+            return;
+        if (success) {
+            // Increase interval (spaced repetition)
+            schedule.repetitions++;
+            schedule.interval = Math.floor(schedule.interval * this.config.intervalMultiplier);
+            schedule.nextReview = Date.now() + schedule.interval;
+        }
+        else {
+            // Reset interval on failure
+            schedule.repetitions = 0;
+            schedule.interval = this.config.initialInterval;
+            schedule.nextReview = Date.now() + schedule.interval;
+        }
+        this.saveRepetitionSchedule(schedule);
+    }
+    /**
+     * Save repetition schedule to database
+     */
+    saveRepetitionSchedule(schedule) {
+        this.db.prepare(`
+      INSERT OR REPLACE INTO spaced_repetition
+      (memory_id, next_review, interval, ease_factor, repetitions)
+      VALUES (?, ?, ?, ?, ?)
+    `).run(schedule.memoryId, schedule.nextReview, schedule.interval, schedule.easeFactor, schedule.repetitions);
+    }
+    /**
+     * Load repetition schedules from database
+     */
+    loadRepetitionSchedules() {
+        const rows = this.db.prepare('SELECT * FROM spaced_repetition').all();
+        for (const row of rows) {
+            this.repetitionSchedules.set(row.memory_id, {
+                memoryId: row.memory_id,
+                nextReview: row.next_review,
+                interval: row.interval,
+                easeFactor: row.ease_factor,
+                repetitions: row.repetitions,
+            });
+        }
+    }
+    /**
+     * Generate recommendations based on consolidation report
+     */
+    generateRecommendations(report) {
+        const recommendations = [];
+        if (report.retentionRate < 0.5) {
+            recommendations.push('Low retention rate. Consider increasing importance thresholds.');
+        }
+        if (report.clustersFormed === 0 && report.episodicProcessed > 10) {
+            recommendations.push('No clusters formed. Consider lowering similarity threshold.');
+        }
+        if (report.semanticCreated < report.clustersFormed * 0.5) {
+            recommendations.push('Low semantic memory creation. Check cluster size thresholds.');
+        }
+        if (report.avgImportance < 0.5) {
+            recommendations.push('Average importance is low. Consider adjusting importance scoring.');
+        }
+        if (report.memoriesForgotten > report.episodicProcessed * 0.8) {
+            recommendations.push('High forgetting rate. Consider lowering forgetting threshold.');
+        }
+        return recommendations;
+    }
+    /**
+     * Log consolidation to database
+     */
+    logConsolidation(report) {
+        this.db.prepare(`
+      INSERT INTO consolidation_log (
+        timestamp, execution_time_ms, episodic_processed, semantic_created,
+        memories_forgotten, clusters_formed, retention_rate
+      ) VALUES (?, ?, ?, ?, ?, ?, ?)
+    `).run(report.timestamp, report.executionTimeMs, report.episodicProcessed, report.semanticCreated, report.memoriesForgotten, report.clustersFormed, report.retentionRate);
+    }
+    /**
+     * Get consolidation history
+     */
+    async getConsolidationHistory(limit = 10) {
+        const rows = this.db.prepare(`
+      SELECT * FROM consolidation_log
+      ORDER BY timestamp DESC
+      LIMIT ?
+    `).all(limit);
+        return rows.map(row => ({
+            timestamp: row.timestamp,
+            executionTimeMs: row.execution_time_ms,
+            episodicProcessed: row.episodic_processed,
+            semanticCreated: row.semantic_created,
+            memoriesForgotten: row.memories_forgotten,
+            clustersFormed: row.clusters_formed,
+            avgImportance: 0,
+            retentionRate: row.retention_rate,
+            recommendations: [],
+        }));
+    }
+}
+//# sourceMappingURL=MemoryConsolidation.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryConsolidation.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/MemoryConsolidation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAMH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAyD3D,MAAM,OAAO,mBAAmB;IACtB,EAAE,CAAW;IACb,kBAAkB,CAAqB;IACvC,QAAQ,CAAmB;IAC3B,aAAa,CAAiB;IAC9B,YAAY,CAAgB;IAC5B,MAAM,CAAsB;IAEpC,6BAA6B;IACrB,mBAAmB,GAAG,IAAI,GAAG,EAA8B,CAAC;IAEpE,YACE,EAAY,EACZ,kBAAsC,EACtC,QAA0B,EAC1B,aAA6B,EAC7B,YAA2B,EAC3B,MAAqC;QAErC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;QAC7C,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,gBAAgB,EAAE,IAAI;YACtB,cAAc,EAAE,CAAC;YACjB,cAAc,EAAE,EAAE;YAClB,mBAAmB,EAAE,GAAG;YACxB,cAAc,EAAE,CAAC;YACjB,sBAAsB,EAAE,IAAI;YAC5B,eAAe,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,WAAW;YACjD,kBAAkB,EAAE,GAAG;YACvB,mBAAmB,EAAE,GAAG;YACxB,GAAG,MAAM;SACV,CAAC;QAEF,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC1B,IAAI,CAAC,uBAAuB,EAAE,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,kBAAkB;QACxB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;KAqBZ,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW;QACf,OAAO,CAAC,GAAG,CAAC,yCAAyC,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,MAAM,MAAM,GAAwB;YAClC,SAAS,EAAE,SAAS;YACpB,eAAe,EAAE,CAAC;YAClB,iBAAiB,EAAE,CAAC;YACpB,eAAe,EAAE,CAAC;YAClB,iBAAiB,EAAE,CAAC;YACpB,cAAc,EAAE,CAAC;YACjB,aAAa,EAAE,CAAC;YAChB,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,EAAE;SACpB,CAAC;QAEF,IAAI,CAAC;YACH,uCAAuC;YACvC,OAAO,CAAC,GAAG,CAAC,4CAA4C,CAAC,CAAC;YAC1D,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,0BAA0B,EAAE,CAAC;YAC3D,MAAM,CAAC,iBAAiB,GAAG,UAAU,CAAC,MAAM,CAAC;YAC7C,OAAO,CAAC,GAAG,CAAC,YAAY,UAAU,CAAC,MAAM,oBAAoB,CAAC,CAAC;YAE/D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,OAAO,CAAC,GAAG,CAAC,8BAA8B,CAAC,CAAC;gBAC5C,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;gBAChD,OAAO,MAAM,CAAC;YAChB,CAAC;YAED,mCAAmC;YACnC,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC;YACjD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YACxD,MAAM,CAAC,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC;YACxC,OAAO,CAAC,GAAG,CAAC,aAAa,QAAQ,CAAC,MAAM,WAAW,CAAC,CAAC;YAErD,iEAAiE;YACjE,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;YAClD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;oBACzD,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;oBAChE,IAAI,cAAc,EAAE,CAAC;wBACnB,MAAM,CAAC,eAAe,EAAE,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,cAAc,MAAM,CAAC,eAAe,oBAAoB,CAAC,CAAC;YAEtE,iCAAiC;YACjC,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC;YACjD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;YAC9D,MAAM,CAAC,iBAAiB,GAAG,SAAS,CAAC;YACrC,OAAO,CAAC,GAAG,CAAC,aAAa,SAAS,qBAAqB,CAAC,CAAC;YAEzD,qCAAqC;YACrC,IAAI,IAAI,CAAC,MAAM,CAAC,sBAAsB,EAAE,CAAC;gBACvC,OAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;gBAClD,MAAM,IAAI,CAAC,wBAAwB,CAAC,UAAU,CAAC,CAAC;gBAChD,OAAO,CAAC,GAAG,CAAC,gBAAgB,UAAU,CAAC,MAAM,GAAG,SAAS,WAAW,CAAC,CAAC;YACxE,CAAC;YAED,+BAA+B;YAC/B,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAC7E,MAAM,CAAC,aAAa,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACvF,MAAM,CAAC,aAAa,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC;gBAC1C,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,SAAS,CAAC,GAAG,UAAU,CAAC,MAAM;gBACrD,CAAC,CAAC,CAAC,CAAC;YAEN,mCAAmC;YACnC,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;YAE9D,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAEhD,oBAAoB;YACpB,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;YAE9B,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC;YACjD,OAAO,CAAC,GAAG,CAAC,YAAY,MAAM,CAAC,eAAe,IAAI,CAAC,CAAC;YACpD,OAAO,CAAC,GAAG,CAAC,iBAAiB,CAAC,MAAM,CAAC,aAAa,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAEzE,OAAO,MAAM,CAAC;QAChB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,gCAAgC,EAAE,KAAK,CAAC,CAAC;YACvD,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAChD,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,0BAA0B;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;KAM5B,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QAEpE,MAAM,UAAU,GAAiB,EAAE,CAAC;QAEpC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzD,UAAU,CAAC,IAAI,CAAC;gBACd,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,IAAI,EAAE,GAAG,CAAC,IAAkB;gBAC5B,OAAO,EAAE,GAAG,CAAC,OAAO;gBACpB,SAAS;gBACT,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,WAAW,EAAE,GAAG,CAAC,YAAY;gBAC7B,SAAS,EAAE,GAAG,CAAC,UAAU;gBACzB,cAAc,EAAE,GAAG,CAAC,gBAAgB;gBACpC,eAAe,EAAE,GAAG,CAAC,iBAAiB;gBACtC,cAAc,EAAE,GAAG,CAAC,eAAe;gBACnC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;gBACjD,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC1D,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS;aAC9D,CAAC,CAAC;QACL,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,eAAe,CAAC,QAAsB;QAClD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,QAAQ,GAAoB,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,2BAA2B;QAC3B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEtC,qBAAqB;YACrB,MAAM,OAAO,GAAkB;gBAC7B,EAAE,EAAE,WAAW,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACtE,QAAQ,EAAE,MAAM,CAAC,SAAU;gBAC3B,OAAO,EAAE,CAAC,MAAM,CAAC;gBACjB,aAAa,EAAE,MAAM,CAAC,UAAU;aACjC,CAAC;YAEF,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAExB,0CAA0C;YAC1C,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;gBACjC,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAAE,SAAS;gBACzC,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc;oBAAE,MAAM;gBAEhE,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,CAAC,SAAU,CAAC,CAAC;gBAE5E,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;oBAC/C,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAChC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;oBAE3B,mCAAmC;oBACnC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;YAED,+BAA+B;YAC/B,OAAO,CAAC,aAAa,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC;YAE3G,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,OAAsB;QAC3C,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC1C,MAAM,WAAW,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;QAEhD,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,WAAW,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,SAAU,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,WAAW,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC;QAC3C,CAAC;QAED,OAAO,CAAC,QAAQ,GAAG,WAAW,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,oBAAoB,CAAC,OAAsB;QACvD,8CAA8C;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QACrD,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAE1B,+DAA+D;QAC/D,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,kBAAkB,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAC/C,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,WAAW,CAAC,EAChD,CAAC,CACF,GAAG,WAAW,CAAC;QAEhB,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,MAAO,IAAI,CAAC,kBAA0B,CAAC,KAAK,CAC3D,OAAO,EACP,kBAAkB,EAClB,UAAU,EACV;YACE,IAAI,EAAE,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;YACrC,QAAQ,EAAE;gBACR,SAAS,EAAE,OAAO,CAAC,EAAE;gBACrB,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM;gBACnC,cAAc,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9C,cAAc,EAAE,IAAI,CAAC,GAAG,EAAE;aAC3B;SACF,CACF,CAAC;QAEF,gDAAgD;QAChD,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACrC,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,OAAsB;QACnD,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc;YAAE,OAAO,IAAI,CAAC;QAErE,gDAAgD;QAChD,2DAA2D;QAC3D,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAErD,8DAA8D;QAC9D,MAAM,aAAa,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAC1C,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CACvD,CAAC;QAEF,MAAM,OAAO,GAAG,YAAY,aAAa,CAAC,OAAO,uBAAuB,OAAO,CAAC,OAAO,CAAC,MAAM,oBAAoB,CAAC;QAEnH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,OAAsB;QAC9C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE5C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACrC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAChB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;oBAC9B,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpD,CAAC;YACH,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC;QAC/C,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;aACnC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,IAAI,SAAS,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB,CAAC,QAAgB;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAIf,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,oBAAoB,CAAC,QAAsB;QACvD,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;YAElD,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;gBAChD,uBAAuB;gBACvB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAE/E,6BAA6B;gBAC7B,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;oBACvB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACvC,CAAC;gBAED,SAAS,EAAE,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,MAAkB;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,iBAAiB,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;QAC3E,MAAM,kBAAkB,GAAG,MAAM,CAAC,eAAe;YAC/C,CAAC,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YACxD,CAAC,CAAC,iBAAiB,CAAC;QAEtB,mDAAmD;QACnD,MAAM,YAAY,GAAG,CAAC,CAAC,CAAC,OAAO;QAC/B,MAAM,oBAAoB,GAAG,CAAC,GAAG,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;QACvD,MAAM,cAAc,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QAE1D,MAAM,QAAQ,GAAG,YAAY,GAAG,oBAAoB,GAAG,cAAc,CAAC;QAEtE,2BAA2B;QAC3B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,kBAAkB,GAAG,QAAQ,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,wBAAwB,CAAC,QAAsB;QAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,MAAM,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAEjE,IAAI,gBAAgB,EAAE,CAAC;gBACrB,4CAA4C;gBAC5C,IAAI,GAAG,IAAI,gBAAgB,CAAC,UAAU,EAAE,CAAC;oBACvC,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,sBAAsB;gBACtB,MAAM,QAAQ,GAAuB;oBACnC,QAAQ,EAAE,MAAM,CAAC,EAAE;oBACnB,UAAU,EAAE,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe;oBAC7C,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,eAAe;oBACrC,UAAU,EAAE,GAAG,EAAE,yBAAyB;oBAC1C,WAAW,EAAE,CAAC;iBACf,CAAC;gBAEF,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAClD,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,QAAgB,EAAE,OAAgB;QACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,IAAI,OAAO,EAAE,CAAC;YACZ,wCAAwC;YACxC,QAAQ,CAAC,WAAW,EAAE,CAAC;YACvB,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;YACnF,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC;QACvD,CAAC;aAAM,CAAC;YACN,4BAA4B;YAC5B,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC;YACzB,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;YAChD,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC;QACvD,CAAC;QAED,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,QAA4B;QACzD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAIf,CAAC,CAAC,GAAG,CACJ,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,UAAU,EACnB,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,UAAU,EACnB,QAAQ,CAAC,WAAW,CACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,uBAAuB;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,iCAAiC,CAAC,CAAC,GAAG,EAAE,CAAC;QAEtE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE;gBAC1C,QAAQ,EAAE,GAAG,CAAC,SAAS;gBACvB,UAAU,EAAE,GAAG,CAAC,WAAW;gBAC3B,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,UAAU,EAAE,GAAG,CAAC,WAAW;gBAC3B,WAAW,EAAE,GAAG,CAAC,WAAW;aAC7B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,MAA2B;QACzD,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,IAAI,MAAM,CAAC,aAAa,GAAG,GAAG,EAAE,CAAC;YAC/B,eAAe,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;QACzF,CAAC;QAED,IAAI,MAAM,CAAC,cAAc,KAAK,CAAC,IAAI,MAAM,CAAC,iBAAiB,GAAG,EAAE,EAAE,CAAC;YACjE,eAAe,CAAC,IAAI,CAAC,6DAA6D,CAAC,CAAC;QACtF,CAAC;QAED,IAAI,MAAM,CAAC,eAAe,GAAG,MAAM,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC;YACzD,eAAe,CAAC,IAAI,CAAC,8DAA8D,CAAC,CAAC;QACvF,CAAC;QAED,IAAI,MAAM,CAAC,aAAa,GAAG,GAAG,EAAE,CAAC;YAC/B,eAAe,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;QAC5F,CAAC;QAED,IAAI,MAAM,CAAC,iBAAiB,GAAG,MAAM,CAAC,iBAAiB,GAAG,GAAG,EAAE,CAAC;YAC9D,eAAe,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;QACxF,CAAC;QAED,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,MAA2B;QAClD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;KAKf,CAAC,CAAC,GAAG,CACJ,MAAM,CAAC,SAAS,EAChB,MAAM,CAAC,eAAe,EACtB,MAAM,CAAC,iBAAiB,EACxB,MAAM,CAAC,eAAe,EACtB,MAAM,CAAC,iBAAiB,EACxB,MAAM,CAAC,cAAc,EACrB,MAAM,CAAC,aAAa,CACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,uBAAuB,CAAC,QAAgB,EAAE;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAI5B,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEd,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtB,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,eAAe,EAAE,GAAG,CAAC,iBAAiB;YACtC,iBAAiB,EAAE,GAAG,CAAC,kBAAkB;YACzC,eAAe,EAAE,GAAG,CAAC,gBAAgB;YACrC,iBAAiB,EAAE,GAAG,CAAC,kBAAkB;YACzC,cAAc,EAAE,GAAG,CAAC,eAAe;YACnC,aAAa,EAAE,CAAC;YAChB,aAAa,EAAE,GAAG,CAAC,cAAc;YACjC,eAAe,EAAE,EAAE;SACpB,CAAC,CAAC,CAAC;IACN,CAAC;CACF","sourcesContent":["/**\n * MemoryConsolidation - Nightly Memory Processing\n *\n * Implements automatic memory consolidation from episodic to semantic memory\n * using spaced repetition and importance scoring.\n *\n * Based on:\n * - Complementary Learning Systems (McClelland et al., 1995)\n * - Active Systems Consolidation (Diekelmann & Born, 2010)\n * - Spaced Repetition (Ebbinghaus, 1885)\n *\n * Process:\n * 1. Identify consolidation candidates (high importance + multiple accesses)\n * 2. Cluster similar episodic memories\n * 3. Extract semantic patterns (abstractions)\n * 4. Promote to semantic memory\n * 5. Apply forgetting to low-value episodic memories\n * 6. Schedule spaced repetition for important memories\n *\n * ADR-066 Phase P2-3\n */\n\nimport type { VectorBackend } from '../backends/VectorBackend.js';\nimport type { GraphBackend } from '../backends/GraphBackend.js';\nimport { HierarchicalMemory, type MemoryItem, type MemoryTier } from './HierarchicalMemory.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/** Consolidation result report */\nexport interface ConsolidationReport {\n  timestamp: number;\n  executionTimeMs: number;\n  episodicProcessed: number;\n  semanticCreated: number;\n  memoriesForgotten: number;\n  clustersFormed: number;\n  avgImportance: number;\n  retentionRate: number;\n  recommendations: string[];\n}\n\n/** Memory cluster for consolidation */\ninterface MemoryCluster {\n  id: string;\n  centroid: Float32Array;\n  members: MemoryItem[];\n  avgImportance: number;\n  semanticPattern?: string;\n}\n\n/** Spaced repetition schedule */\ninterface RepetitionSchedule {\n  memoryId: string;\n  nextReview: number;\n  interval: number;\n  easeFactor: number;\n  repetitions: number;\n}\n\nexport interface ConsolidationConfig {\n  /** Minimum similarity for clustering (0-1) */\n  clusterThreshold: number;\n  /** Minimum cluster size for semantic extraction */\n  minClusterSize: number;\n  /** Maximum cluster size before splitting */\n  maxClusterSize: number;\n  /** Importance threshold for consolidation */\n  importanceThreshold: number;\n  /** Minimum access count for consolidation */\n  minAccessCount: number;\n  /** Enable spaced repetition */\n  enableSpacedRepetition: boolean;\n  /** Initial repetition interval (ms) */\n  initialInterval: number;\n  /** Interval multiplier for successful recall */\n  intervalMultiplier: number;\n  /** Forgetting threshold (retention below this = forget) */\n  forgettingThreshold: number;\n}\n\nexport class MemoryConsolidation {\n  private db: Database;\n  private hierarchicalMemory: HierarchicalMemory;\n  private embedder: EmbeddingService;\n  private vectorBackend?: VectorBackend;\n  private graphBackend?: GraphBackend;\n  private config: ConsolidationConfig;\n\n  // Spaced repetition tracking\n  private repetitionSchedules = new Map<string, RepetitionSchedule>();\n\n  constructor(\n    db: Database,\n    hierarchicalMemory: HierarchicalMemory,\n    embedder: EmbeddingService,\n    vectorBackend?: VectorBackend,\n    graphBackend?: GraphBackend,\n    config?: Partial<ConsolidationConfig>\n  ) {\n    this.db = db;\n    this.hierarchicalMemory = hierarchicalMemory;\n    this.embedder = embedder;\n    this.vectorBackend = vectorBackend;\n    this.graphBackend = graphBackend;\n\n    this.config = {\n      clusterThreshold: 0.75,\n      minClusterSize: 3,\n      maxClusterSize: 20,\n      importanceThreshold: 0.6,\n      minAccessCount: 3,\n      enableSpacedRepetition: true,\n      initialInterval: 24 * 60 * 60 * 1000, // 24 hours\n      intervalMultiplier: 2.0,\n      forgettingThreshold: 0.2,\n      ...config,\n    };\n\n    this.initializeDatabase();\n    this.loadRepetitionSchedules();\n  }\n\n  /**\n   * Initialize database tables for consolidation tracking\n   */\n  private initializeDatabase(): void {\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS consolidation_log (\n        id INTEGER PRIMARY KEY AUTOINCREMENT,\n        timestamp INTEGER NOT NULL,\n        execution_time_ms INTEGER NOT NULL,\n        episodic_processed INTEGER NOT NULL,\n        semantic_created INTEGER NOT NULL,\n        memories_forgotten INTEGER NOT NULL,\n        clusters_formed INTEGER NOT NULL,\n        retention_rate REAL NOT NULL\n      );\n\n      CREATE TABLE IF NOT EXISTS spaced_repetition (\n        memory_id TEXT PRIMARY KEY,\n        next_review INTEGER NOT NULL,\n        interval INTEGER NOT NULL,\n        ease_factor REAL NOT NULL,\n        repetitions INTEGER NOT NULL\n      );\n\n      CREATE INDEX IF NOT EXISTS idx_spaced_next_review ON spaced_repetition(next_review);\n    `);\n  }\n\n  /**\n   * Run nightly consolidation process\n   */\n  async consolidate(): Promise<ConsolidationReport> {\n    console.log('\\n🌙 Starting Memory Consolidation...\\n');\n    const startTime = Date.now();\n\n    const report: ConsolidationReport = {\n      timestamp: startTime,\n      executionTimeMs: 0,\n      episodicProcessed: 0,\n      semanticCreated: 0,\n      memoriesForgotten: 0,\n      clustersFormed: 0,\n      avgImportance: 0,\n      retentionRate: 0,\n      recommendations: [],\n    };\n\n    try {\n      // Step 1: Get consolidation candidates\n      console.log('📊 Identifying consolidation candidates...');\n      const candidates = await this.getConsolidationCandidates();\n      report.episodicProcessed = candidates.length;\n      console.log(`   Found ${candidates.length} episodic memories`);\n\n      if (candidates.length === 0) {\n        console.log('✅ No memories to consolidate');\n        report.executionTimeMs = Date.now() - startTime;\n        return report;\n      }\n\n      // Step 2: Cluster similar memories\n      console.log('🔗 Clustering similar memories...');\n      const clusters = await this.clusterMemories(candidates);\n      report.clustersFormed = clusters.length;\n      console.log(`   Formed ${clusters.length} clusters`);\n\n      // Step 3: Extract semantic patterns and create semantic memories\n      console.log('🧠 Extracting semantic patterns...');\n      for (const cluster of clusters) {\n        if (cluster.members.length >= this.config.minClusterSize) {\n          const semanticMemory = await this.createSemanticMemory(cluster);\n          if (semanticMemory) {\n            report.semanticCreated++;\n          }\n        }\n      }\n      console.log(`   Created ${report.semanticCreated} semantic memories`);\n\n      // Step 4: Apply forgetting curve\n      console.log('🗑️  Applying forgetting curve...');\n      const forgotten = await this.applyForgettingCurve(candidates);\n      report.memoriesForgotten = forgotten;\n      console.log(`   Forgot ${forgotten} low-value memories`);\n\n      // Step 5: Schedule spaced repetition\n      if (this.config.enableSpacedRepetition) {\n        console.log('📅 Scheduling spaced repetition...');\n        await this.scheduleSpacedRepetition(candidates);\n        console.log(`   Scheduled ${candidates.length - forgotten} memories`);\n      }\n\n      // Step 6: Calculate statistics\n      const totalImportance = candidates.reduce((sum, m) => sum + m.importance, 0);\n      report.avgImportance = candidates.length > 0 ? totalImportance / candidates.length : 0;\n      report.retentionRate = candidates.length > 0\n        ? (candidates.length - forgotten) / candidates.length\n        : 0;\n\n      // Step 7: Generate recommendations\n      report.recommendations = this.generateRecommendations(report);\n\n      report.executionTimeMs = Date.now() - startTime;\n\n      // Log consolidation\n      this.logConsolidation(report);\n\n      console.log('\\n✅ Memory Consolidation Complete');\n      console.log(`   Time: ${report.executionTimeMs}ms`);\n      console.log(`   Retention: ${(report.retentionRate * 100).toFixed(1)}%`);\n\n      return report;\n    } catch (error) {\n      console.error('❌ Memory consolidation failed:', error);\n      report.executionTimeMs = Date.now() - startTime;\n      return report;\n    }\n  }\n\n  /**\n   * Get episodic memories that are candidates for consolidation\n   */\n  private async getConsolidationCandidates(): Promise<MemoryItem[]> {\n    const rows = this.db.prepare(`\n      SELECT * FROM hierarchical_memory\n      WHERE tier = 'episodic'\n        AND importance >= ?\n        AND access_count >= ?\n      ORDER BY importance DESC, access_count DESC\n    `).all(this.config.importanceThreshold, this.config.minAccessCount);\n\n    const candidates: MemoryItem[] = [];\n\n    for (const row of rows) {\n      const embedding = await this.embedder.embed(row.content);\n      candidates.push({\n        id: row.id,\n        tier: row.tier as MemoryTier,\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      });\n    }\n\n    return candidates;\n  }\n\n  /**\n   * Cluster similar memories using hierarchical clustering\n   */\n  private async clusterMemories(memories: MemoryItem[]): Promise<MemoryCluster[]> {\n    if (memories.length === 0) return [];\n\n    const clusters: MemoryCluster[] = [];\n    const assigned = new Set<string>();\n\n    // Simple greedy clustering\n    for (const memory of memories) {\n      if (assigned.has(memory.id)) continue;\n\n      // Create new cluster\n      const cluster: MemoryCluster = {\n        id: `cluster-${Date.now()}-${Math.random().toString(36).substr(2, 9)}`,\n        centroid: memory.embedding!,\n        members: [memory],\n        avgImportance: memory.importance,\n      };\n\n      assigned.add(memory.id);\n\n      // Find similar memories to add to cluster\n      for (const candidate of memories) {\n        if (assigned.has(candidate.id)) continue;\n        if (cluster.members.length >= this.config.maxClusterSize) break;\n\n        const similarity = cosineSimilarity(cluster.centroid, candidate.embedding!);\n\n        if (similarity >= this.config.clusterThreshold) {\n          cluster.members.push(candidate);\n          assigned.add(candidate.id);\n\n          // Update centroid (simple average)\n          this.updateCentroid(cluster);\n        }\n      }\n\n      // Calculate average importance\n      cluster.avgImportance = cluster.members.reduce((sum, m) => sum + m.importance, 0) / cluster.members.length;\n\n      clusters.push(cluster);\n    }\n\n    return clusters;\n  }\n\n  /**\n   * Update cluster centroid (simple average)\n   */\n  private updateCentroid(cluster: MemoryCluster): void {\n    const dimension = cluster.centroid.length;\n    const newCentroid = new Float32Array(dimension);\n\n    for (const member of cluster.members) {\n      for (let i = 0; i < dimension; i++) {\n        newCentroid[i] += member.embedding![i];\n      }\n    }\n\n    for (let i = 0; i < dimension; i++) {\n      newCentroid[i] /= cluster.members.length;\n    }\n\n    cluster.centroid = newCentroid;\n  }\n\n  /**\n   * Create semantic memory from cluster\n   */\n  private async createSemanticMemory(cluster: MemoryCluster): Promise<string | null> {\n    // Extract common pattern from cluster members\n    const pattern = this.extractSemanticPattern(cluster);\n    if (!pattern) return null;\n\n    // Calculate consolidated importance (weighted by access count)\n    const totalAccess = cluster.members.reduce((sum, m) => sum + m.accessCount, 0);\n    const weightedImportance = cluster.members.reduce(\n      (sum, m) => sum + (m.importance * m.accessCount),\n      0\n    ) / totalAccess;\n\n    // Store as semantic memory\n    const memoryId = await (this.hierarchicalMemory as any).store(\n      pattern,\n      weightedImportance,\n      'semantic',\n      {\n        tags: this.extractCommonTags(cluster),\n        metadata: {\n          clusterId: cluster.id,\n          clusterSize: cluster.members.length,\n          sourceMemories: cluster.members.map(m => m.id),\n          consolidatedAt: Date.now(),\n        },\n      }\n    );\n\n    // Mark source episodic memories as consolidated\n    for (const member of cluster.members) {\n      await this.markConsolidated(member.id);\n    }\n\n    return memoryId;\n  }\n\n  /**\n   * Extract semantic pattern from cluster\n   */\n  private extractSemanticPattern(cluster: MemoryCluster): string | null {\n    if (cluster.members.length < this.config.minClusterSize) return null;\n\n    // Simple pattern: find common themes in content\n    // In production, this could use LLM for better abstraction\n    const contents = cluster.members.map(m => m.content);\n\n    // For now, just return a summary of the most important memory\n    const mostImportant = cluster.members.reduce(\n      (best, m) => m.importance > best.importance ? m : best\n    );\n\n    const pattern = `Pattern: ${mostImportant.content} (consolidated from ${cluster.members.length} similar memories)`;\n\n    return pattern;\n  }\n\n  /**\n   * Extract common tags from cluster members\n   */\n  private extractCommonTags(cluster: MemoryCluster): string[] {\n    const tagCounts = new Map<string, number>();\n\n    for (const member of cluster.members) {\n      if (member.tags) {\n        for (const tag of member.tags) {\n          tagCounts.set(tag, (tagCounts.get(tag) || 0) + 1);\n        }\n      }\n    }\n\n    // Return tags that appear in at least 50% of members\n    const threshold = cluster.members.length * 0.5;\n    return Array.from(tagCounts.entries())\n      .filter(([_, count]) => count >= threshold)\n      .map(([tag, _]) => tag);\n  }\n\n  /**\n   * Mark episodic memory as consolidated\n   */\n  private async markConsolidated(memoryId: string): Promise<void> {\n    const now = Date.now();\n    this.db.prepare(`\n      UPDATE hierarchical_memory\n      SET consolidated_at = ?\n      WHERE id = ?\n    `).run(now, memoryId);\n  }\n\n  /**\n   * Apply forgetting curve and delete low-value memories\n   */\n  private async applyForgettingCurve(memories: MemoryItem[]): Promise<number> {\n    let forgotten = 0;\n\n    for (const memory of memories) {\n      const retention = this.calculateRetention(memory);\n\n      if (retention < this.config.forgettingThreshold) {\n        // Delete from database\n        this.db.prepare('DELETE FROM hierarchical_memory WHERE id = ?').run(memory.id);\n\n        // Remove from vector backend\n        if (this.vectorBackend) {\n          this.vectorBackend.remove(memory.id);\n        }\n\n        forgotten++;\n      }\n    }\n\n    return forgotten;\n  }\n\n  /**\n   * Calculate retention using Ebbinghaus forgetting curve\n   */\n  private calculateRetention(memory: MemoryItem): number {\n    const now = Date.now();\n    const daysSinceCreation = (now - memory.createdAt) / (24 * 60 * 60 * 1000);\n    const daysSinceRehearsal = memory.lastRehearsedAt\n      ? (now - memory.lastRehearsedAt) / (24 * 60 * 60 * 1000)\n      : daysSinceCreation;\n\n    // Strength increases with importance and rehearsal\n    const baseStrength = 5; // days\n    const importanceMultiplier = 1 + memory.importance * 2;\n    const rehearsalBoost = memory.lastRehearsedAt ? 1.5 : 1.0;\n\n    const strength = baseStrength * importanceMultiplier * rehearsalBoost;\n\n    // Ebbinghaus: R = e^(-t/S)\n    return Math.exp(-daysSinceRehearsal / strength);\n  }\n\n  /**\n   * Schedule spaced repetition for memories\n   */\n  private async scheduleSpacedRepetition(memories: MemoryItem[]): Promise<void> {\n    const now = Date.now();\n\n    for (const memory of memories) {\n      const existingSchedule = this.repetitionSchedules.get(memory.id);\n\n      if (existingSchedule) {\n        // Update existing schedule if review is due\n        if (now >= existingSchedule.nextReview) {\n          this.updateRepetitionSchedule(memory.id, true);\n        }\n      } else {\n        // Create new schedule\n        const schedule: RepetitionSchedule = {\n          memoryId: memory.id,\n          nextReview: now + this.config.initialInterval,\n          interval: this.config.initialInterval,\n          easeFactor: 2.5, // SM-2 algorithm default\n          repetitions: 0,\n        };\n\n        this.repetitionSchedules.set(memory.id, schedule);\n        this.saveRepetitionSchedule(schedule);\n      }\n    }\n  }\n\n  /**\n   * Update repetition schedule after review\n   */\n  private updateRepetitionSchedule(memoryId: string, success: boolean): void {\n    const schedule = this.repetitionSchedules.get(memoryId);\n    if (!schedule) return;\n\n    if (success) {\n      // Increase interval (spaced repetition)\n      schedule.repetitions++;\n      schedule.interval = Math.floor(schedule.interval * this.config.intervalMultiplier);\n      schedule.nextReview = Date.now() + schedule.interval;\n    } else {\n      // Reset interval on failure\n      schedule.repetitions = 0;\n      schedule.interval = this.config.initialInterval;\n      schedule.nextReview = Date.now() + schedule.interval;\n    }\n\n    this.saveRepetitionSchedule(schedule);\n  }\n\n  /**\n   * Save repetition schedule to database\n   */\n  private saveRepetitionSchedule(schedule: RepetitionSchedule): void {\n    this.db.prepare(`\n      INSERT OR REPLACE INTO spaced_repetition\n      (memory_id, next_review, interval, ease_factor, repetitions)\n      VALUES (?, ?, ?, ?, ?)\n    `).run(\n      schedule.memoryId,\n      schedule.nextReview,\n      schedule.interval,\n      schedule.easeFactor,\n      schedule.repetitions\n    );\n  }\n\n  /**\n   * Load repetition schedules from database\n   */\n  private loadRepetitionSchedules(): void {\n    const rows = this.db.prepare('SELECT * FROM spaced_repetition').all();\n\n    for (const row of rows) {\n      this.repetitionSchedules.set(row.memory_id, {\n        memoryId: row.memory_id,\n        nextReview: row.next_review,\n        interval: row.interval,\n        easeFactor: row.ease_factor,\n        repetitions: row.repetitions,\n      });\n    }\n  }\n\n  /**\n   * Generate recommendations based on consolidation report\n   */\n  private generateRecommendations(report: ConsolidationReport): string[] {\n    const recommendations: string[] = [];\n\n    if (report.retentionRate < 0.5) {\n      recommendations.push('Low retention rate. Consider increasing importance thresholds.');\n    }\n\n    if (report.clustersFormed === 0 && report.episodicProcessed > 10) {\n      recommendations.push('No clusters formed. Consider lowering similarity threshold.');\n    }\n\n    if (report.semanticCreated < report.clustersFormed * 0.5) {\n      recommendations.push('Low semantic memory creation. Check cluster size thresholds.');\n    }\n\n    if (report.avgImportance < 0.5) {\n      recommendations.push('Average importance is low. Consider adjusting importance scoring.');\n    }\n\n    if (report.memoriesForgotten > report.episodicProcessed * 0.8) {\n      recommendations.push('High forgetting rate. Consider lowering forgetting threshold.');\n    }\n\n    return recommendations;\n  }\n\n  /**\n   * Log consolidation to database\n   */\n  private logConsolidation(report: ConsolidationReport): void {\n    this.db.prepare(`\n      INSERT INTO consolidation_log (\n        timestamp, execution_time_ms, episodic_processed, semantic_created,\n        memories_forgotten, clusters_formed, retention_rate\n      ) VALUES (?, ?, ?, ?, ?, ?, ?)\n    `).run(\n      report.timestamp,\n      report.executionTimeMs,\n      report.episodicProcessed,\n      report.semanticCreated,\n      report.memoriesForgotten,\n      report.clustersFormed,\n      report.retentionRate\n    );\n  }\n\n  /**\n   * Get consolidation history\n   */\n  async getConsolidationHistory(limit: number = 10): Promise<ConsolidationReport[]> {\n    const rows = this.db.prepare(`\n      SELECT * FROM consolidation_log\n      ORDER BY timestamp DESC\n      LIMIT ?\n    `).all(limit);\n\n    return rows.map(row => ({\n      timestamp: row.timestamp,\n      executionTimeMs: row.execution_time_ms,\n      episodicProcessed: row.episodic_processed,\n      semanticCreated: row.semantic_created,\n      memoriesForgotten: row.memories_forgotten,\n      clustersFormed: row.clusters_formed,\n      avgImportance: 0,\n      retentionRate: row.retention_rate,\n      recommendations: [],\n    }));\n  }\n}\n"]}

package/dist/packages/agentdb/src/controllers/MetadataFilter.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Advanced Metadata Filtering
+ *
+ * Implements MongoDB-style query operators for filtering
+ * episodes and patterns based on metadata fields.
+ *
+ * Supported operators:
+ * - $eq: Equal to
+ * - $ne: Not equal to
+ * - $gt: Greater than
+ * - $gte: Greater than or equal to
+ * - $lt: Less than
+ * - $lte: Less than or equal to
+ * - $in: Value is in array
+ * - $nin: Value is not in array
+ * - $contains: String/array contains value
+ * - $exists: Field exists
+ */
+export type FilterOperator = '$eq' | '$ne' | '$gt' | '$gte' | '$lt' | '$lte' | '$in' | '$nin' | '$contains' | '$exists';
+export type FilterValue = string | number | boolean | string[] | number[] | {
+    [op in FilterOperator]?: any;
+};
+export interface MetadataFilters {
+    [field: string]: FilterValue;
+}
+export interface FilterableItem {
+    metadata?: any;
+    [key: string]: any;
+}
+export declare class MetadataFilter {
+    /**
+     * Apply filters to a collection of items
+     *
+     * @param items - Items to filter
+     * @param filters - MongoDB-style filter object
+     * @returns Filtered items
+     */
+    static apply<T extends FilterableItem>(items: T[], filters: MetadataFilters): T[];
+    /**
+     * Check if an item matches all filters
+     */
+    private static matchesFilters;
+    /**
+     * Check if an item matches a single filter
+     */
+    private static matchesFilter;
+    /**
+     * Get field value from item (supports nested paths)
+     */
+    private static getFieldValue;
+    /**
+     * Build SQL WHERE clause from filters (for database queries)
+     *
+     * @param filters - Metadata filters
+     * @param tableName - Table name for column references
+     * @returns SQL WHERE clause and parameters
+     */
+    static toSQL(filters: MetadataFilters, tableName?: string): {
+        where: string;
+        params: any[];
+    };
+    /**
+     * Validate filter object
+     */
+    static validate(filters: MetadataFilters): {
+        valid: boolean;
+        errors: string[];
+    };
+}
+//# sourceMappingURL=MetadataFilter.d.ts.map

package/dist/packages/agentdb/src/controllers/MetadataFilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MetadataFilter.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/MetadataFilter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,MAAM,cAAc,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,WAAW,GAAG,SAAS,CAAC;AAExH,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG;KAAG,EAAE,IAAI,cAAc,CAAC,CAAC,EAAE,GAAG;CAAE,CAAC;AAE7G,MAAM,WAAW,eAAe;IAC9B,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,CAAC;CAC9B;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,GAAG,CAAC;IACf,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;CACpB;AAED,qBAAa,cAAc;IACzB;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,cAAc,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,eAAe,GAAG,CAAC,EAAE;IAQjF;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAS7B;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,aAAa;IAsE5B;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,aAAa;IAwB5B;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,eAAe,EAAE,SAAS,GAAE,MAAW,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,GAAG,EAAE,CAAA;KAAE;IAyFhG;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,eAAe,GAAG;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;CAoBhF"}