deepseek-coder-cli 1.0.0

package/dist/core/episodicMemory.js

@@ -0,0 +1,833 @@
+/**
+ * Episodic Memory System - Cross-session pattern learning with semantic indexing
+ *
+ * Features:
+ * 1. Episode detection and boundary marking
+ * 2. Semantic indexing via vector embeddings (pluggable providers)
+ * 3. Cross-session pattern learning and retrieval
+ * 4. Task-specific memory with temporal decay
+ * 5. Memory consolidation and pruning
+ *
+ * Storage: ~/.agi/episodic-memory/
+ *   - episodes.json     (episode metadata index)
+ *   - embeddings.bin    (vector embeddings cache)
+ *   - patterns.json     (learned patterns)
+ */
+import { mkdirSync, readFileSync, writeFileSync, existsSync } from 'node:fs';
+import { join } from 'node:path';
+import { homedir } from 'node:os';
+/**
+ * Default reward weights for each category
+ */
+const DEFAULT_REWARD_WEIGHTS = {
+    bug_fix: {
+        executionSuccess: 0.30,
+        testsPassed: 0.35,
+        staticAnalysis: 0.10,
+        codeQuality: 0.05,
+        blastRadius: 0.15,
+        selfAssessment: 0.03,
+        speedBonus: 0.02,
+    },
+    feature_add: {
+        executionSuccess: 0.25,
+        testsPassed: 0.25,
+        staticAnalysis: 0.15,
+        codeQuality: 0.15,
+        blastRadius: 0.10,
+        selfAssessment: 0.05,
+        speedBonus: 0.05,
+    },
+    refactor: {
+        executionSuccess: 0.25,
+        testsPassed: 0.30,
+        staticAnalysis: 0.20,
+        codeQuality: 0.15,
+        blastRadius: 0.05,
+        selfAssessment: 0.03,
+        speedBonus: 0.02,
+    },
+    test_write: {
+        executionSuccess: 0.30,
+        testsPassed: 0.40,
+        staticAnalysis: 0.10,
+        codeQuality: 0.05,
+        blastRadius: 0.05,
+        selfAssessment: 0.05,
+        speedBonus: 0.05,
+    },
+    documentation: {
+        executionSuccess: 0.35,
+        testsPassed: 0.05,
+        staticAnalysis: 0.10,
+        codeQuality: 0.20,
+        blastRadius: 0.10,
+        selfAssessment: 0.10,
+        speedBonus: 0.10,
+    },
+    analysis: {
+        executionSuccess: 0.40,
+        testsPassed: 0.05,
+        staticAnalysis: 0.05,
+        codeQuality: 0.10,
+        blastRadius: 0.05,
+        selfAssessment: 0.20,
+        speedBonus: 0.15,
+    },
+    configuration: {
+        executionSuccess: 0.35,
+        testsPassed: 0.20,
+        staticAnalysis: 0.15,
+        codeQuality: 0.05,
+        blastRadius: 0.15,
+        selfAssessment: 0.05,
+        speedBonus: 0.05,
+    },
+    debugging: {
+        executionSuccess: 0.35,
+        testsPassed: 0.25,
+        staticAnalysis: 0.05,
+        codeQuality: 0.05,
+        blastRadius: 0.05,
+        selfAssessment: 0.15,
+        speedBonus: 0.10,
+    },
+    optimization: {
+        executionSuccess: 0.25,
+        testsPassed: 0.25,
+        staticAnalysis: 0.10,
+        codeQuality: 0.15,
+        blastRadius: 0.05,
+        selfAssessment: 0.05,
+        speedBonus: 0.15,
+    },
+    migration: {
+        executionSuccess: 0.30,
+        testsPassed: 0.30,
+        staticAnalysis: 0.15,
+        codeQuality: 0.05,
+        blastRadius: 0.10,
+        selfAssessment: 0.05,
+        speedBonus: 0.05,
+    },
+    unknown: {
+        executionSuccess: 0.25,
+        testsPassed: 0.30,
+        staticAnalysis: 0.15,
+        codeQuality: 0.10,
+        blastRadius: 0.10,
+        selfAssessment: 0.05,
+        speedBonus: 0.05,
+    },
+};
+// ============================================================================
+// DEFAULT EMBEDDING PROVIDER (Simple TF-IDF style, no external deps)
+// ============================================================================
+class SimpleEmbeddingProvider {
+    dimension = 256;
+    name = 'simple-tfidf';
+    vocabulary = new Map();
+    idf = new Map();
+    async embed(text) {
+        const tokens = this.tokenize(text);
+        const vector = new Array(this.dimension).fill(0);
+        // Simple hash-based embedding (deterministic, no training needed)
+        for (const token of tokens) {
+            const hash = this.hashToken(token);
+            const idx = Math.abs(hash) % this.dimension;
+            vector[idx] += 1;
+        }
+        // Normalize to unit vector
+        const magnitude = Math.sqrt(vector.reduce((sum, v) => sum + v * v, 0));
+        if (magnitude > 0) {
+            for (let i = 0; i < vector.length; i++) {
+                vector[i] /= magnitude;
+            }
+        }
+        return vector;
+    }
+    tokenize(text) {
+        return text
+            .toLowerCase()
+            .replace(/[^a-z0-9\s]/g, ' ')
+            .split(/\s+/)
+            .filter(t => t.length > 2);
+    }
+    hashToken(token) {
+        let hash = 0;
+        for (let i = 0; i < token.length; i++) {
+            const char = token.charCodeAt(i);
+            hash = ((hash << 5) - hash) + char;
+            hash = hash & hash; // Convert to 32-bit integer
+        }
+        return hash;
+    }
+}
+// ============================================================================
+// EPISODIC MEMORY SYSTEM
+// ============================================================================
+export class EpisodicMemory {
+    config;
+    episodes = new Map();
+    approaches = new Map();
+    optimizationProfiles = new Map();
+    embeddingProvider;
+    dirty = false;
+    // In-memory episode being recorded
+    currentEpisode = null;
+    episodeToolsUsed = new Set();
+    episodeFilesModified = new Set();
+    constructor(config = {}) {
+        const dataRoot = process.env['AGI_DATA_DIR']?.trim() || join(homedir(), '.agi');
+        this.config = {
+            maxEpisodes: 1000,
+            maxApproaches: 200,
+            decayFactor: 0.95,
+            minSimilarity: 0.3,
+            useEmbeddings: true,
+            storageDir: join(dataRoot, 'episodic-memory'),
+            ...config,
+        };
+        this.embeddingProvider = config.embeddingProvider || new SimpleEmbeddingProvider();
+        this.load();
+    }
+    // ==========================================================================
+    // EPISODE LIFECYCLE
+    // ==========================================================================
+    /**
+     * Start recording a new episode
+     */
+    startEpisode(intent, sessionId, category) {
+        const id = this.generateId();
+        this.currentEpisode = {
+            id,
+            sessionId,
+            startTime: Date.now(),
+            intent,
+            category: category || this.inferCategory(intent),
+            toolsUsed: [],
+            filesModified: [],
+            success: false,
+            summary: '',
+            tags: this.extractTags(intent),
+            retrievalCount: 0,
+            lastRetrieved: 0,
+        };
+        this.episodeToolsUsed.clear();
+        this.episodeFilesModified.clear();
+        return id;
+    }
+    /**
+     * Record tool usage within current episode
+     */
+    recordToolUse(toolName) {
+        this.episodeToolsUsed.add(toolName);
+    }
+    /**
+     * Record file modification within current episode
+     */
+    recordFileModification(filePath) {
+        this.episodeFilesModified.add(filePath);
+    }
+    /**
+     * End current episode and save to memory
+     */
+    async endEpisode(success, summary) {
+        if (!this.currentEpisode)
+            return null;
+        const episode = {
+            ...this.currentEpisode,
+            endTime: Date.now(),
+            success,
+            summary,
+            toolsUsed: Array.from(this.episodeToolsUsed),
+            filesModified: Array.from(this.episodeFilesModified),
+        };
+        // Generate embedding for semantic search
+        if (this.config.useEmbeddings) {
+            const textForEmbedding = `${episode.intent} ${episode.summary} ${episode.tags.join(' ')}`;
+            episode.embedding = await this.embeddingProvider.embed(textForEmbedding);
+        }
+        this.episodes.set(episode.id, episode);
+        this.dirty = true;
+        // Learn from successful episodes
+        if (success) {
+            await this.learnFromEpisode(episode);
+        }
+        // Prune if needed
+        this.pruneEpisodes();
+        // Clear current episode
+        this.currentEpisode = null;
+        this.episodeToolsUsed.clear();
+        this.episodeFilesModified.clear();
+        // Auto-save
+        this.save();
+        return episode;
+    }
+    /**
+     * Abort current episode without saving
+     */
+    abortEpisode() {
+        this.currentEpisode = null;
+        this.episodeToolsUsed.clear();
+        this.episodeFilesModified.clear();
+    }
+    // ==========================================================================
+    // RETRIEVAL & SEARCH
+    // ==========================================================================
+    /**
+     * Search for similar past episodes
+     */
+    async search(query) {
+        const results = [];
+        const limit = query.limit || 10;
+        // Generate query embedding if using embeddings
+        let queryEmbedding = null;
+        if (this.config.useEmbeddings) {
+            queryEmbedding = await this.embeddingProvider.embed(query.query);
+        }
+        for (const episode of this.episodes.values()) {
+            // Apply filters
+            if (query.category && episode.category !== query.category)
+                continue;
+            if (query.successOnly && !episode.success)
+                continue;
+            if (query.since && episode.startTime < query.since)
+                continue;
+            if (query.tags && !query.tags.some(t => episode.tags.includes(t)))
+                continue;
+            // Calculate similarity
+            let similarity = 0;
+            let matchReason = '';
+            if (queryEmbedding && episode.embedding) {
+                // Cosine similarity for embeddings
+                similarity = this.cosineSimilarity(queryEmbedding, episode.embedding);
+                matchReason = 'semantic similarity';
+            }
+            else {
+                // Fallback to keyword matching
+                similarity = this.keywordSimilarity(query.query, episode.intent + ' ' + episode.summary);
+                matchReason = 'keyword match';
+            }
+            // Apply temporal decay
+            const ageInDays = (Date.now() - episode.endTime) / (1000 * 60 * 60 * 24);
+            const decayedSimilarity = similarity * Math.pow(this.config.decayFactor, ageInDays / 30);
+            // Boost for popularity
+            const popularityBoost = 1 + (episode.retrievalCount * 0.01);
+            const finalSimilarity = decayedSimilarity * popularityBoost;
+            if (finalSimilarity >= (query.minSimilarity || this.config.minSimilarity)) {
+                results.push({
+                    episode,
+                    similarity: finalSimilarity,
+                    matchReason,
+                });
+            }
+        }
+        // Sort by similarity and limit
+        results.sort((a, b) => b.similarity - a.similarity);
+        const topResults = results.slice(0, limit);
+        // Update retrieval counts
+        for (const result of topResults) {
+            result.episode.retrievalCount++;
+            result.episode.lastRetrieved = Date.now();
+            this.dirty = true;
+        }
+        return topResults;
+    }
+    /**
+     * Get learned approach for a task
+     */
+    async getApproach(intent) {
+        const keywords = this.extractKeywords(intent);
+        // First try exact keyword match
+        for (const approach of this.approaches.values()) {
+            const overlapCount = keywords.filter(k => approach.keywords.includes(k)).length;
+            if (overlapCount >= Math.min(3, keywords.length * 0.5)) {
+                return approach;
+            }
+        }
+        // Try semantic search if embeddings enabled
+        if (this.config.useEmbeddings) {
+            const queryEmbedding = await this.embeddingProvider.embed(intent);
+            let bestMatch = null;
+            let bestSimilarity = 0;
+            for (const approach of this.approaches.values()) {
+                if (approach.embedding) {
+                    const similarity = this.cosineSimilarity(queryEmbedding, approach.embedding);
+                    if (similarity > bestSimilarity && similarity >= this.config.minSimilarity) {
+                        bestSimilarity = similarity;
+                        bestMatch = approach;
+                    }
+                }
+            }
+            return bestMatch;
+        }
+        return null;
+    }
+    /**
+     * Get recent episodes for context
+     */
+    getRecentEpisodes(limit = 5, sessionId) {
+        const episodes = Array.from(this.episodes.values());
+        const filtered = sessionId
+            ? episodes.filter(e => e.sessionId === sessionId)
+            : episodes;
+        return filtered
+            .sort((a, b) => b.endTime - a.endTime)
+            .slice(0, limit);
+    }
+    // ==========================================================================
+    // LEARNING
+    // ==========================================================================
+    /**
+     * Learn patterns from a successful episode
+     */
+    async learnFromEpisode(episode) {
+        const keywords = this.extractKeywords(episode.intent);
+        const approachKey = keywords.sort().join('_');
+        const existing = this.approaches.get(approachKey);
+        if (existing) {
+            // Update existing approach
+            existing.useCount++;
+            existing.successRate = (existing.successRate * (existing.useCount - 1) + 1) / existing.useCount;
+            existing.sourceEpisodes.push(episode.id);
+            existing.tools = [...new Set([...existing.tools, ...episode.toolsUsed])];
+            existing.updatedAt = Date.now();
+            // Re-compute embedding
+            if (this.config.useEmbeddings) {
+                existing.embedding = await this.embeddingProvider.embed(existing.triggerPattern);
+            }
+        }
+        else {
+            // Create new approach
+            const approach = {
+                id: this.generateId(),
+                triggerPattern: episode.intent,
+                keywords,
+                approach: [episode.summary],
+                tools: episode.toolsUsed,
+                successRate: 1,
+                useCount: 1,
+                sourceEpisodes: [episode.id],
+                updatedAt: Date.now(),
+            };
+            if (this.config.useEmbeddings) {
+                approach.embedding = await this.embeddingProvider.embed(approach.triggerPattern);
+            }
+            this.approaches.set(approachKey, approach);
+        }
+        this.pruneApproaches();
+        this.dirty = true;
+    }
+    /**
+     * Record approach failure to update success rate
+     */
+    recordApproachFailure(approachId) {
+        for (const approach of this.approaches.values()) {
+            if (approach.id === approachId) {
+                approach.useCount++;
+                approach.successRate = (approach.successRate * (approach.useCount - 1)) / approach.useCount;
+                approach.updatedAt = Date.now();
+                this.dirty = true;
+                break;
+            }
+        }
+    }
+    // ==========================================================================
+    // HELPERS
+    // ==========================================================================
+    generateId() {
+        const timestamp = Date.now().toString(36);
+        const random = Math.random().toString(36).slice(2, 8);
+        return `ep_${timestamp}_${random}`;
+    }
+    inferCategory(intent) {
+        const lower = intent.toLowerCase();
+        if (/\b(fix|bug|error|issue|crash|broken)\b/.test(lower))
+            return 'bug_fix';
+        if (/\b(add|feature|implement|create|new)\b/.test(lower))
+            return 'feature_add';
+        if (/\b(refactor|clean|reorganize|restructure)\b/.test(lower))
+            return 'refactor';
+        if (/\b(test|spec|coverage)\b/.test(lower))
+            return 'test_write';
+        if (/\b(doc|readme|comment|explain)\b/.test(lower))
+            return 'documentation';
+        if (/\b(analyz|understand|explore|investigate)\b/.test(lower))
+            return 'analysis';
+        if (/\b(config|setup|install|env)\b/.test(lower))
+            return 'configuration';
+        if (/\b(debug|trace|log|inspect)\b/.test(lower))
+            return 'debugging';
+        if (/\b(optim|perf|speed|fast)\b/.test(lower))
+            return 'optimization';
+        if (/\b(migrat|upgrad|update|convert)\b/.test(lower))
+            return 'migration';
+        return 'unknown';
+    }
+    extractTags(text) {
+        const tags = [];
+        const lower = text.toLowerCase();
+        // Extract technology tags
+        const techPatterns = {
+            typescript: /\btypescript\b|\\.tsx?\b/,
+            javascript: /\bjavascript\b|\\.jsx?\b/,
+            python: /\bpython\b|\\.py\b/,
+            react: /\breact\b/,
+            node: /\bnode\.?js?\b/,
+            api: /\bapi\b|\brest\b|\bgraphql\b/,
+            database: /\bdb\b|\bdatabase\b|\bsql\b|\bmongo\b/,
+            test: /\btest\b|\bspec\b|\bjest\b|\bvitest\b/,
+            git: /\bgit\b|\bcommit\b|\bbranch\b/,
+        };
+        for (const [tag, pattern] of Object.entries(techPatterns)) {
+            if (pattern.test(lower)) {
+                tags.push(tag);
+            }
+        }
+        return tags;
+    }
+    extractKeywords(text) {
+        return text
+            .toLowerCase()
+            .replace(/[^a-z0-9\s]/g, ' ')
+            .split(/\s+/)
+            .filter(w => w.length > 3)
+            .filter(w => !['this', 'that', 'with', 'from', 'have', 'will', 'would', 'could', 'should'].includes(w));
+    }
+    cosineSimilarity(a, b) {
+        if (a.length !== b.length)
+            return 0;
+        let dotProduct = 0;
+        let magnitudeA = 0;
+        let magnitudeB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dotProduct += a[i] * b[i];
+            magnitudeA += a[i] * a[i];
+            magnitudeB += b[i] * b[i];
+        }
+        const magnitude = Math.sqrt(magnitudeA) * Math.sqrt(magnitudeB);
+        return magnitude === 0 ? 0 : dotProduct / magnitude;
+    }
+    keywordSimilarity(query, text) {
+        const queryWords = new Set(this.extractKeywords(query));
+        const textWords = new Set(this.extractKeywords(text));
+        if (queryWords.size === 0 || textWords.size === 0)
+            return 0;
+        let matches = 0;
+        for (const word of queryWords) {
+            if (textWords.has(word))
+                matches++;
+        }
+        return matches / queryWords.size;
+    }
+    // ==========================================================================
+    // OPTIMIZATION PROFILES
+    // ==========================================================================
+    /**
+     * Get or create an optimization profile for a category.
+     * Used by the RL tournament system to get task-specific settings.
+     */
+    getOptimizationProfile(category, policyName) {
+        const existing = this.optimizationProfiles.get(category);
+        if (existing) {
+            return existing;
+        }
+        // Create default profile for this category
+        const profile = {
+            id: `profile_${category}_${Date.now().toString(36)}`,
+            category,
+            policyName: policyName || `${category}_default`,
+            preferredMode: this.inferPreferredMode(category),
+            useGitWorktrees: category === 'migration' || category === 'refactor',
+            rewardWeights: { ...DEFAULT_REWARD_WEIGHTS[category] },
+            preferredTools: this.inferPreferredTools(category),
+            autoApprovalThreshold: 0.85,
+            successCount: 0,
+            failureCount: 0,
+            updatedAt: Date.now(),
+        };
+        this.optimizationProfiles.set(category, profile);
+        this.dirty = true;
+        return profile;
+    }
+    /**
+     * Update optimization profile based on episode outcome.
+     * Called after an episode completes to adjust learned settings.
+     */
+    updateOptimizationProfile(category, success, options) {
+        const profile = this.getOptimizationProfile(category);
+        if (success) {
+            profile.successCount++;
+            // Update preferred tools based on successful episodes
+            if (options?.toolsUsed) {
+                for (const tool of options.toolsUsed) {
+                    if (!profile.preferredTools.includes(tool)) {
+                        profile.preferredTools.push(tool);
+                    }
+                }
+                // Keep only top 10 preferred tools
+                profile.preferredTools = profile.preferredTools.slice(0, 10);
+            }
+            // Update mode preference if dual mode was successful
+            if (options?.mode && options.mode !== 'single-continuous') {
+                const successRate = profile.successCount / (profile.successCount + profile.failureCount);
+                if (successRate > 0.7 && profile.preferredMode === 'single-continuous') {
+                    profile.preferredMode = 'dual-rl-continuous';
+                }
+            }
+            // Track git worktree success
+            if (options?.usedGitWorktrees && !profile.useGitWorktrees) {
+                profile.useGitWorktrees = true;
+            }
+        }
+        else {
+            profile.failureCount++;
+            // If success rate drops, adjust auto-approval threshold
+            const successRate = profile.successCount / (profile.successCount + profile.failureCount);
+            if (successRate < profile.autoApprovalThreshold) {
+                profile.autoApprovalThreshold = Math.max(0.5, successRate - 0.05);
+            }
+        }
+        profile.updatedAt = Date.now();
+        this.dirty = true;
+        this.save();
+    }
+    /**
+     * Get reward weights for a category, adjusted based on learned patterns.
+     */
+    getRewardWeights(category) {
+        const profile = this.getOptimizationProfile(category);
+        return profile.rewardWeights;
+    }
+    /**
+     * Update reward weights based on tournament outcomes.
+     * Adjusts weights to favor signals that correlated with successful outcomes.
+     */
+    adjustRewardWeights(category, winningSignals, success) {
+        const profile = this.getOptimizationProfile(category);
+        const learningRate = 0.1;
+        for (const [key, value] of Object.entries(winningSignals)) {
+            const k = key;
+            if (success) {
+                // Slightly increase weight for signals that contributed to success
+                profile.rewardWeights[k] = Math.min(0.5, profile.rewardWeights[k] + learningRate * value);
+            }
+            else {
+                // Slightly decrease weight for signals that didn't prevent failure
+                profile.rewardWeights[k] = Math.max(0.01, profile.rewardWeights[k] - learningRate * 0.5 * value);
+            }
+        }
+        // Normalize weights to sum to 1
+        const total = Object.values(profile.rewardWeights).reduce((sum, v) => sum + v, 0);
+        for (const key of Object.keys(profile.rewardWeights)) {
+            const k = key;
+            profile.rewardWeights[k] /= total;
+        }
+        profile.updatedAt = Date.now();
+        this.dirty = true;
+    }
+    /**
+     * Get all optimization profiles for inspection.
+     */
+    getAllOptimizationProfiles() {
+        return Array.from(this.optimizationProfiles.values());
+    }
+    inferPreferredMode(category) {
+        // Categories that benefit from dual-agent comparison
+        switch (category) {
+            case 'refactor':
+            case 'optimization':
+            case 'migration':
+                return 'dual-rl-tournament';
+            case 'feature_add':
+            case 'bug_fix':
+                return 'dual-rl-continuous';
+            default:
+                return 'single-continuous';
+        }
+    }
+    inferPreferredTools(category) {
+        switch (category) {
+            case 'bug_fix':
+                return ['Read', 'Grep', 'Edit', 'Bash'];
+            case 'feature_add':
+                return ['Read', 'Write', 'Edit', 'Bash'];
+            case 'refactor':
+                return ['Read', 'Edit', 'Grep', 'Bash'];
+            case 'test_write':
+                return ['Read', 'Write', 'Bash'];
+            case 'documentation':
+                return ['Read', 'Write', 'Edit'];
+            case 'analysis':
+                return ['Read', 'Grep', 'Glob'];
+            case 'debugging':
+                return ['Read', 'Grep', 'Bash', 'Edit'];
+            default:
+                return ['Read', 'Edit', 'Bash'];
+        }
+    }
+    // ==========================================================================
+    // PRUNING
+    // ==========================================================================
+    pruneEpisodes() {
+        if (this.episodes.size <= this.config.maxEpisodes)
+            return;
+        // Score episodes by value (recency + success + retrieval count)
+        const scored = Array.from(this.episodes.values()).map(ep => {
+            const ageScore = 1 - (Date.now() - ep.endTime) / (1000 * 60 * 60 * 24 * 365); // 1 year decay
+            const successScore = ep.success ? 0.3 : 0;
+            const retrievalScore = Math.min(ep.retrievalCount * 0.05, 0.2);
+            return { id: ep.id, score: ageScore + successScore + retrievalScore };
+        });
+        scored.sort((a, b) => b.score - a.score);
+        // Keep top episodes
+        const toKeep = new Set(scored.slice(0, this.config.maxEpisodes).map(s => s.id));
+        for (const id of this.episodes.keys()) {
+            if (!toKeep.has(id)) {
+                this.episodes.delete(id);
+            }
+        }
+    }
+    pruneApproaches() {
+        if (this.approaches.size <= this.config.maxApproaches)
+            return;
+        // Score approaches by usefulness
+        const scored = Array.from(this.approaches.entries()).map(([key, ap]) => {
+            const recencyScore = 1 - (Date.now() - ap.updatedAt) / (1000 * 60 * 60 * 24 * 180); // 6 month decay
+            const useScore = Math.min(ap.useCount * 0.1, 0.3);
+            const successScore = ap.successRate * 0.4;
+            return { key, score: recencyScore + useScore + successScore };
+        });
+        scored.sort((a, b) => b.score - a.score);
+        // Keep top approaches
+        const toKeep = new Set(scored.slice(0, this.config.maxApproaches).map(s => s.key));
+        for (const key of this.approaches.keys()) {
+            if (!toKeep.has(key)) {
+                this.approaches.delete(key);
+            }
+        }
+    }
+    // ==========================================================================
+    // PERSISTENCE
+    // ==========================================================================
+    load() {
+        try {
+            if (!existsSync(this.config.storageDir)) {
+                mkdirSync(this.config.storageDir, { recursive: true });
+                return;
+            }
+            const episodesPath = join(this.config.storageDir, 'episodes.json');
+            const approachesPath = join(this.config.storageDir, 'approaches.json');
+            const profilesPath = join(this.config.storageDir, 'optimization-profiles.json');
+            if (existsSync(episodesPath)) {
+                const data = JSON.parse(readFileSync(episodesPath, 'utf-8'));
+                for (const ep of data.episodes || []) {
+                    this.episodes.set(ep.id, ep);
+                }
+            }
+            if (existsSync(approachesPath)) {
+                const data = JSON.parse(readFileSync(approachesPath, 'utf-8'));
+                for (const [key, ap] of Object.entries(data.approaches || {})) {
+                    this.approaches.set(key, ap);
+                }
+            }
+            if (existsSync(profilesPath)) {
+                const data = JSON.parse(readFileSync(profilesPath, 'utf-8'));
+                for (const profile of data.profiles || []) {
+                    this.optimizationProfiles.set(profile.category, profile);
+                }
+            }
+        }
+        catch (error) {
+            console.error('Failed to load episodic memory:', error);
+        }
+    }
+    save() {
+        if (!this.dirty)
+            return;
+        try {
+            mkdirSync(this.config.storageDir, { recursive: true });
+            const episodesPath = join(this.config.storageDir, 'episodes.json');
+            const approachesPath = join(this.config.storageDir, 'approaches.json');
+            const profilesPath = join(this.config.storageDir, 'optimization-profiles.json');
+            writeFileSync(episodesPath, JSON.stringify({
+                version: 1,
+                updatedAt: Date.now(),
+                episodes: Array.from(this.episodes.values()),
+            }, null, 2));
+            writeFileSync(approachesPath, JSON.stringify({
+                version: 1,
+                updatedAt: Date.now(),
+                approaches: Object.fromEntries(this.approaches),
+            }, null, 2));
+            writeFileSync(profilesPath, JSON.stringify({
+                version: 1,
+                updatedAt: Date.now(),
+                profiles: Array.from(this.optimizationProfiles.values()),
+            }, null, 2));
+            this.dirty = false;
+        }
+        catch (error) {
+            console.error('Failed to save episodic memory:', error);
+        }
+    }
+    // ==========================================================================
+    // STATS
+    // ==========================================================================
+    getStats() {
+        const categoryCounts = {};
+        const tagCounts = {};
+        let successCount = 0;
+        for (const episode of this.episodes.values()) {
+            categoryCounts[episode.category] = (categoryCounts[episode.category] || 0) + 1;
+            if (episode.success)
+                successCount++;
+            for (const tag of episode.tags) {
+                tagCounts[tag] = (tagCounts[tag] || 0) + 1;
+            }
+        }
+        const topTags = Object.entries(tagCounts)
+            .sort((a, b) => b[1] - a[1])
+            .slice(0, 10)
+            .map(([tag]) => tag);
+        const profileSummary = Array.from(this.optimizationProfiles.values())
+            .map(p => ({
+            category: p.category,
+            successRate: p.successCount + p.failureCount > 0
+                ? p.successCount / (p.successCount + p.failureCount)
+                : 0,
+            preferredMode: p.preferredMode,
+        }))
+            .sort((a, b) => b.successRate - a.successRate);
+        return {
+            totalEpisodes: this.episodes.size,
+            successfulEpisodes: successCount,
+            totalApproaches: this.approaches.size,
+            totalProfiles: this.optimizationProfiles.size,
+            categoryCounts,
+            topTags,
+            profileSummary,
+        };
+    }
+}
+// ============================================================================
+// SINGLETON & FACTORY
+// ============================================================================
+let defaultInstance = null;
+/**
+ * Get or create the default episodic memory instance
+ */
+export function getEpisodicMemory(config) {
+    if (!defaultInstance) {
+        defaultInstance = new EpisodicMemory(config);
+    }
+    return defaultInstance;
+}
+/**
+ * Create a new episodic memory instance with custom config
+ */
+export function createEpisodicMemory(config = {}) {
+    return new EpisodicMemory(config);
+}
+//# sourceMappingURL=episodicMemory.js.map