universal-agent-memory 0.6.2 → 0.7.0

package/dist/memory/context-compressor.js

@@ -0,0 +1,250 @@
+/**
+ * Context Compression Module for UAM
+ *
+ * Implements semantic compression to reduce token usage while preserving meaning.
+ * Based on Acon (Agent Context Optimization) and AgentCompress research.
+ */
+const DEFAULT_CONFIG = {
+    maxTokens: 2000,
+    minSemanticPreservation: 0.85,
+    compressionLevel: 'medium',
+};
+/**
+ * Estimate token count (rough approximation: ~4 chars per token)
+ */
+export function estimateTokens(text) {
+    return Math.ceil(text.length / 4);
+}
+/**
+ * Compress a single memory entry
+ */
+export function compressMemoryEntry(content, config = {}) {
+    const cfg = { ...DEFAULT_CONFIG, ...config };
+    const originalTokens = estimateTokens(content);
+    if (originalTokens <= cfg.maxTokens / 4) {
+        return {
+            original: content,
+            compressed: content,
+            originalTokens,
+            compressedTokens: originalTokens,
+            tokenReduction: 0,
+            preservedSemantics: 1.0,
+        };
+    }
+    let compressed = content;
+    // Level 1: Remove redundant whitespace and formatting
+    compressed = compressed.replace(/\s+/g, ' ').trim();
+    compressed = compressed.replace(/\n{3,}/g, '\n\n');
+    // Level 2: Remove common filler phrases
+    if (cfg.compressionLevel !== 'light') {
+        const fillerPatterns = [
+            /\b(basically|essentially|actually|really|very|quite|somewhat|rather)\b/gi,
+            /\b(in order to)\b/gi,
+            /\b(it is worth noting that|it should be noted that)\b/gi,
+            /\b(as a matter of fact|in fact)\b/gi,
+            /\b(at the end of the day)\b/gi,
+            /\b(the fact that)\b/gi,
+            /\b(in this case|in that case)\b/gi,
+        ];
+        for (const pattern of fillerPatterns) {
+            compressed = compressed.replace(pattern, '');
+        }
+    }
+    // Level 3: Aggressive - truncate to key sentences
+    if (cfg.compressionLevel === 'aggressive') {
+        const sentences = compressed.split(/(?<=[.!?])\s+/);
+        const maxSentences = Math.max(3, Math.ceil(sentences.length * 0.4));
+        // Keep first sentence (context), middle sentences (key info), last sentence (conclusion)
+        if (sentences.length > maxSentences) {
+            const first = sentences.slice(0, 1);
+            const middle = sentences.slice(1, -1).slice(0, maxSentences - 2);
+            const last = sentences.slice(-1);
+            compressed = [...first, ...middle, ...last].join(' ');
+        }
+    }
+    // Clean up artifacts
+    compressed = compressed.replace(/\s{2,}/g, ' ').trim();
+    const compressedTokens = estimateTokens(compressed);
+    const tokenReduction = 1 - (compressedTokens / originalTokens);
+    // Estimate semantic preservation (based on compression ratio - rough heuristic)
+    const preservedSemantics = Math.max(0.7, 1 - (tokenReduction * 0.3));
+    return {
+        original: content,
+        compressed,
+        originalTokens,
+        compressedTokens,
+        tokenReduction,
+        preservedSemantics,
+    };
+}
+/**
+ * Compress multiple memories into a consolidated context
+ */
+export function compressMemoryBatch(memories, config = {}) {
+    const cfg = { ...DEFAULT_CONFIG, ...config };
+    // Sort by importance (descending)
+    const sorted = [...memories].sort((a, b) => (b.importance || 5) - (a.importance || 5));
+    // Group by type for structured output
+    const grouped = {};
+    for (const mem of sorted) {
+        const type = mem.type || 'general';
+        if (!grouped[type])
+            grouped[type] = [];
+        grouped[type].push(mem.content);
+    }
+    // Build consolidated context
+    const sections = [];
+    const typeOrder = ['goal', 'action', 'observation', 'thought'];
+    for (const type of typeOrder) {
+        if (grouped[type] && grouped[type].length > 0) {
+            const compressed = grouped[type].map(c => compressMemoryEntry(c, cfg).compressed);
+            sections.push(`[${type.toUpperCase()}]\n${compressed.join('\n')}`);
+        }
+    }
+    // Add remaining types
+    for (const type of Object.keys(grouped)) {
+        if (!typeOrder.includes(type)) {
+            const compressed = grouped[type].map(c => compressMemoryEntry(c, cfg).compressed);
+            sections.push(`[${type.toUpperCase()}]\n${compressed.join('\n')}`);
+        }
+    }
+    const original = memories.map(m => m.content).join('\n');
+    const compressed = sections.join('\n\n');
+    const originalTokens = estimateTokens(original);
+    const compressedTokens = estimateTokens(compressed);
+    return {
+        original,
+        compressed,
+        originalTokens,
+        compressedTokens,
+        tokenReduction: 1 - (compressedTokens / originalTokens),
+        preservedSemantics: 0.9, // Batch compression preserves structure
+    };
+}
+/**
+ * Summarize old memories into a single compressed entry
+ */
+export function summarizeMemories(memories, maxOutputTokens = 500) {
+    if (memories.length === 0)
+        return '';
+    // Group by type
+    const byType = {};
+    for (const mem of memories) {
+        if (!byType[mem.type])
+            byType[mem.type] = [];
+        byType[mem.type].push(mem.content);
+    }
+    // Create summary sections
+    const summaryParts = [];
+    for (const [type, contents] of Object.entries(byType)) {
+        // Deduplicate similar content
+        const unique = deduplicateContent(contents);
+        // Compress each unique entry
+        const compressed = unique.map(c => {
+            const result = compressMemoryEntry(c, { compressionLevel: 'aggressive' });
+            return result.compressed;
+        });
+        // Limit to most important entries
+        const maxPerType = Math.max(2, Math.floor(maxOutputTokens / (Object.keys(byType).length * 50)));
+        const limited = compressed.slice(0, maxPerType);
+        if (limited.length > 0) {
+            summaryParts.push(`${type}: ${limited.join('; ')}`);
+        }
+    }
+    const dateRange = getDateRange(memories.map(m => m.timestamp));
+    const header = `[Summary ${dateRange}]`;
+    return `${header}\n${summaryParts.join('\n')}`;
+}
+/**
+ * Deduplicate content using simple similarity check
+ */
+function deduplicateContent(contents, threshold = 0.8) {
+    const unique = [];
+    for (const content of contents) {
+        const normalizedNew = content.toLowerCase().replace(/\s+/g, ' ').trim();
+        let isDuplicate = false;
+        for (const existing of unique) {
+            const normalizedExisting = existing.toLowerCase().replace(/\s+/g, ' ').trim();
+            const similarity = jaccardSimilarity(normalizedNew, normalizedExisting);
+            if (similarity > threshold) {
+                isDuplicate = true;
+                break;
+            }
+        }
+        if (!isDuplicate) {
+            unique.push(content);
+        }
+    }
+    return unique;
+}
+/**
+ * Calculate Jaccard similarity between two strings
+ */
+function jaccardSimilarity(a, b) {
+    const setA = new Set(a.split(/\s+/));
+    const setB = new Set(b.split(/\s+/));
+    const intersection = new Set([...setA].filter(x => setB.has(x)));
+    const union = new Set([...setA, ...setB]);
+    return intersection.size / union.size;
+}
+/**
+ * Get date range string
+ */
+function getDateRange(timestamps) {
+    if (timestamps.length === 0)
+        return 'unknown';
+    const dates = timestamps.map(t => new Date(t)).filter(d => !isNaN(d.getTime()));
+    if (dates.length === 0)
+        return 'unknown';
+    const min = new Date(Math.min(...dates.map(d => d.getTime())));
+    const max = new Date(Math.max(...dates.map(d => d.getTime())));
+    const formatDate = (d) => d.toISOString().split('T')[0];
+    if (formatDate(min) === formatDate(max)) {
+        return formatDate(min);
+    }
+    return `${formatDate(min)} to ${formatDate(max)}`;
+}
+/**
+ * Context budget manager
+ */
+export class ContextBudget {
+    maxTokens;
+    usedTokens = 0;
+    sections = new Map();
+    constructor(maxTokens = 12000) {
+        this.maxTokens = maxTokens;
+    }
+    allocate(section, content) {
+        const tokens = estimateTokens(content);
+        const available = this.maxTokens - this.usedTokens;
+        if (tokens <= available) {
+            this.usedTokens += tokens;
+            this.sections.set(section, tokens);
+            return { content, tokens, truncated: false };
+        }
+        // Need to truncate
+        const targetTokens = Math.floor(available * 0.9);
+        const targetChars = targetTokens * 4;
+        const truncated = content.slice(0, targetChars) + '... [truncated]';
+        const actualTokens = estimateTokens(truncated);
+        this.usedTokens += actualTokens;
+        this.sections.set(section, actualTokens);
+        return { content: truncated, tokens: actualTokens, truncated: true };
+    }
+    remaining() {
+        return this.maxTokens - this.usedTokens;
+    }
+    usage() {
+        return {
+            total: this.maxTokens,
+            used: this.usedTokens,
+            remaining: this.remaining(),
+            sections: Object.fromEntries(this.sections),
+        };
+    }
+    reset() {
+        this.usedTokens = 0;
+        this.sections.clear();
+    }
+}
+//# sourceMappingURL=context-compressor.js.map

package/dist/memory/context-compressor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context-compressor.js","sourceRoot":"","sources":["../../src/memory/context-compressor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAiBH,MAAM,cAAc,GAAqB;IACvC,SAAS,EAAE,IAAI;IACf,uBAAuB,EAAE,IAAI;IAC7B,gBAAgB,EAAE,QAAQ;CAC3B,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAe,EAAE,SAAoC,EAAE;IACzF,MAAM,GAAG,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAC7C,MAAM,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IAE/C,IAAI,cAAc,IAAI,GAAG,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;QACxC,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,UAAU,EAAE,OAAO;YACnB,cAAc;YACd,gBAAgB,EAAE,cAAc;YAChC,cAAc,EAAE,CAAC;YACjB,kBAAkB,EAAE,GAAG;SACxB,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,GAAG,OAAO,CAAC;IAEzB,sDAAsD;IACtD,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACpD,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAEnD,wCAAwC;IACxC,IAAI,GAAG,CAAC,gBAAgB,KAAK,OAAO,EAAE,CAAC;QACrC,MAAM,cAAc,GAAG;YACrB,0EAA0E;YAC1E,qBAAqB;YACrB,yDAAyD;YACzD,qCAAqC;YACrC,+BAA+B;YAC/B,uBAAuB;YACvB,mCAAmC;SACpC,CAAC;QAEF,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;YACrC,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,IAAI,GAAG,CAAC,gBAAgB,KAAK,YAAY,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QACpD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;QAEpE,yFAAyF;QACzF,IAAI,SAAS,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;YACjE,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,UAAU,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAEvD,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;IACpD,MAAM,cAAc,GAAG,CAAC,GAAG,CAAC,gBAAgB,GAAG,cAAc,CAAC,CAAC;IAE/D,gFAAgF;IAChF,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC,CAAC;IAErE,OAAO;QACL,QAAQ,EAAE,OAAO;QACjB,UAAU;QACV,cAAc;QACd,gBAAgB;QAChB,cAAc;QACd,kBAAkB;KACnB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAAuE,EACvE,SAAoC,EAAE;IAEtC,MAAM,GAAG,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IAE7C,kCAAkC;IAClC,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC;IAEvF,sCAAsC;IACtC,MAAM,OAAO,GAA6B,EAAE,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,SAAS,CAAC;QACnC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,6BAA6B;IAC7B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;IAE/D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;YAClF,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,MAAM,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACxC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;YAClF,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,MAAM,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEzC,MAAM,cAAc,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAChD,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;IAEpD,OAAO;QACL,QAAQ;QACR,UAAU;QACV,cAAc;QACd,gBAAgB;QAChB,cAAc,EAAE,CAAC,GAAG,CAAC,gBAAgB,GAAG,cAAc,CAAC;QACvD,kBAAkB,EAAE,GAAG,EAAE,wCAAwC;KAClE,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAqE,EACrE,kBAA0B,GAAG;IAE7B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,gBAAgB;IAChB,MAAM,MAAM,GAA6B,EAAE,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IAED,0BAA0B;IAC1B,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACtD,8BAA8B;QAC9B,MAAM,MAAM,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QAE5C,6BAA6B;QAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAChC,MAAM,MAAM,GAAG,mBAAmB,CAAC,CAAC,EAAE,EAAE,gBAAgB,EAAE,YAAY,EAAE,CAAC,CAAC;YAC1E,OAAO,MAAM,CAAC,UAAU,CAAC;QAC3B,CAAC,CAAC,CAAC;QAEH,kCAAkC;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChG,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAEhD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,YAAY,CAAC,IAAI,CAAC,GAAG,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAG,YAAY,SAAS,GAAG,CAAC;IAExC,OAAO,GAAG,MAAM,KAAK,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,QAAkB,EAAE,YAAoB,GAAG;IACrE,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,aAAa,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAExE,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;YAC9B,MAAM,kBAAkB,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YAC9E,MAAM,UAAU,GAAG,iBAAiB,CAAC,aAAa,EAAE,kBAAkB,CAAC,CAAC;YAExE,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;gBAC3B,WAAW,GAAG,IAAI,CAAC;gBACnB,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IAErC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1C,OAAO,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,UAAoB;IACxC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAE9C,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAChF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAEzC,MAAM,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IAE/D,MAAM,UAAU,GAAG,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9D,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACxC,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,aAAa;IAChB,SAAS,CAAS;IAClB,UAAU,GAAW,CAAC,CAAC;IACvB,QAAQ,GAAwB,IAAI,GAAG,EAAE,CAAC;IAElD,YAAY,YAAoB,KAAK;QACnC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,QAAQ,CAAC,OAAe,EAAE,OAAe;QACvC,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnD,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACnC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QAC/C,CAAC;QAED,mBAAmB;QACnB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;QACjD,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,iBAAiB,CAAC;QACpE,MAAM,YAAY,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;QAE/C,IAAI,CAAC,UAAU,IAAI,YAAY,CAAC;QAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAEzC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IACvE,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;IAC1C,CAAC;IAED,KAAK;QACH,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,SAAS;YACrB,IAAI,EAAE,IAAI,CAAC,UAAU;YACrB,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE;YAC3B,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC;SAC5C,CAAC;IACJ,CAAC;IAED,KAAK;QACH,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;CACF"}

package/dist/memory/dynamic-retrieval.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Dynamic Memory Retrieval System for UAM
+ *
+ * Retrieves relevant memories based on task content, not static context.
+ * Implements semantic search with fallback to keyword matching.
+ */
+import { type TaskClassification } from './task-classifier.js';
+export interface RetrievedMemory {
+    content: string;
+    type: 'lesson' | 'gotcha' | 'pattern' | 'context' | 'example';
+    relevance: number;
+    source: string;
+}
+export interface DynamicMemoryContext {
+    classification: TaskClassification;
+    relevantMemories: RetrievedMemory[];
+    patterns: string[];
+    gotchas: string[];
+    projectContext: string;
+    formattedContext: string;
+}
+/**
+ * Main function to retrieve task-specific memory context
+ */
+export declare function retrieveDynamicMemoryContext(taskInstruction: string, projectRoot?: string): Promise<DynamicMemoryContext>;
+//# sourceMappingURL=dynamic-retrieval.d.ts.map

package/dist/memory/dynamic-retrieval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dynamic-retrieval.d.ts","sourceRoot":"","sources":["../../src/memory/dynamic-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,EAAgE,KAAK,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE7H,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;IAC9D,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,oBAAoB;IACnC,cAAc,EAAE,kBAAkB,CAAC;IACnC,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,wBAAsB,4BAA4B,CAChD,eAAe,EAAE,MAAM,EACvB,WAAW,GAAE,MAAsB,GAClC,OAAO,CAAC,oBAAoB,CAAC,CAgD/B"}

package/dist/memory/dynamic-retrieval.js

@@ -0,0 +1,378 @@
+/**
+ * Dynamic Memory Retrieval System for UAM
+ *
+ * Retrieves relevant memories based on task content, not static context.
+ * Implements semantic search with fallback to keyword matching.
+ */
+import { existsSync, readFileSync } from 'fs';
+import { join } from 'path';
+import { execSync } from 'child_process';
+import { classifyTask, extractTaskEntities, getSuggestedMemoryQueries } from './task-classifier.js';
+/**
+ * Main function to retrieve task-specific memory context
+ */
+export async function retrieveDynamicMemoryContext(taskInstruction, projectRoot = process.cwd()) {
+    // Step 1: Classify the task
+    const classification = classifyTask(taskInstruction);
+    // Step 2: Extract entities from task
+    const entities = extractTaskEntities(taskInstruction);
+    // Step 3: Get suggested memory queries
+    const suggestedQueries = getSuggestedMemoryQueries(classification);
+    // Step 4: Query all memory sources
+    const memories = await queryAllMemorySources(taskInstruction, classification, entities, suggestedQueries, projectRoot);
+    // Step 5: Extract patterns and gotchas
+    const patterns = memories
+        .filter(m => m.type === 'pattern')
+        .map(m => m.content);
+    const gotchas = memories
+        .filter(m => m.type === 'gotcha')
+        .map(m => m.content);
+    // Step 6: Get project-specific context
+    const projectContext = await getProjectContext(classification, projectRoot);
+    // Step 7: Format the context with recency bias (critical at END)
+    const formattedContext = formatContextWithRecencyBias(classification, memories, patterns, gotchas, projectContext);
+    return {
+        classification,
+        relevantMemories: memories,
+        patterns,
+        gotchas,
+        projectContext,
+        formattedContext,
+    };
+}
+/**
+ * Query all memory sources for relevant information
+ */
+async function queryAllMemorySources(taskInstruction, classification, entities, suggestedQueries, projectRoot) {
+    const memories = [];
+    // Source 1: Short-term SQLite memory
+    const shortTermMemories = await queryShortTermMemory(classification, entities, projectRoot);
+    memories.push(...shortTermMemories);
+    // Source 2: Session memories (recent decisions)
+    const sessionMemories = await querySessionMemory(taskInstruction, projectRoot);
+    memories.push(...sessionMemories);
+    // Source 3: Long-term prepopulated memory
+    const longTermMemories = await queryLongTermMemory(suggestedQueries, projectRoot);
+    memories.push(...longTermMemories);
+    // Source 4: CLAUDE.md sections relevant to task
+    const claudeMdMemories = await queryCLAUDEMd(classification, projectRoot);
+    memories.push(...claudeMdMemories);
+    // Source 5: Category-specific patterns from droids
+    const droidPatterns = getCategoryPatterns(classification);
+    memories.push(...droidPatterns);
+    // Deduplicate and sort by relevance
+    const uniqueMemories = deduplicateMemories(memories);
+    return uniqueMemories.sort((a, b) => b.relevance - a.relevance).slice(0, 15);
+}
+/**
+ * Query short-term SQLite memory
+ */
+async function queryShortTermMemory(classification, entities, projectRoot) {
+    const dbPath = join(projectRoot, 'agents/data/memory/short_term.db');
+    if (!existsSync(dbPath))
+        return [];
+    const memories = [];
+    try {
+        // Query by category keywords
+        for (const keyword of classification.keywords.slice(0, 3)) {
+            const result = execSync(`sqlite3 "${dbPath}" "SELECT type, content FROM memories WHERE content LIKE '%${keyword}%' ORDER BY id DESC LIMIT 3;"`, { encoding: 'utf-8', timeout: 5000 }).trim();
+            if (result) {
+                for (const line of result.split('\n')) {
+                    const [type, content] = line.split('|');
+                    if (content) {
+                        memories.push({
+                            content: content.slice(0, 500),
+                            type: type === 'lesson' ? 'lesson' : 'context',
+                            relevance: 0.7,
+                            source: 'short-term-memory',
+                        });
+                    }
+                }
+            }
+        }
+        // Query by technology mentions
+        for (const tech of entities.technologies.slice(0, 2)) {
+            const result = execSync(`sqlite3 "${dbPath}" "SELECT type, content FROM memories WHERE content LIKE '%${tech}%' ORDER BY id DESC LIMIT 2;"`, { encoding: 'utf-8', timeout: 5000 }).trim();
+            if (result) {
+                for (const line of result.split('\n')) {
+                    const [type, content] = line.split('|');
+                    if (content) {
+                        memories.push({
+                            content: content.slice(0, 500),
+                            type: type === 'gotcha' ? 'gotcha' : 'context',
+                            relevance: 0.6,
+                            source: 'short-term-memory',
+                        });
+                    }
+                }
+            }
+        }
+    }
+    catch {
+        // Ignore query errors
+    }
+    return memories;
+}
+/**
+ * Query session memories for recent decisions
+ */
+async function querySessionMemory(_taskInstruction, projectRoot) {
+    const dbPath = join(projectRoot, 'agents/data/memory/short_term.db');
+    if (!existsSync(dbPath))
+        return [];
+    const memories = [];
+    try {
+        // Get recent high-importance session memories
+        const result = execSync(`sqlite3 "${dbPath}" "SELECT type, content FROM session_memories WHERE importance >= 7 ORDER BY id DESC LIMIT 5;"`, { encoding: 'utf-8', timeout: 5000 }).trim();
+        if (result) {
+            for (const line of result.split('\n')) {
+                const [type, content] = line.split('|');
+                if (content) {
+                    memories.push({
+                        content: content.slice(0, 500),
+                        type: type === 'lesson' ? 'lesson' : type === 'decision' ? 'context' : 'pattern',
+                        relevance: 0.8,
+                        source: 'session-memory',
+                    });
+                }
+            }
+        }
+    }
+    catch {
+        // Ignore query errors
+    }
+    return memories;
+}
+/**
+ * Query long-term prepopulated memory
+ */
+async function queryLongTermMemory(queries, projectRoot) {
+    const memoryPath = join(projectRoot, 'agents/data/memory/long_term_prepopulated.json');
+    if (!existsSync(memoryPath))
+        return [];
+    const memories = [];
+    try {
+        const data = JSON.parse(readFileSync(memoryPath, 'utf-8'));
+        const allMemories = data.memories || data.lessons || data || [];
+        // Simple keyword matching for now (semantic search would be better)
+        for (const query of queries.slice(0, 5)) {
+            const queryLower = query.toLowerCase();
+            const queryWords = queryLower.split(/\s+/);
+            for (const mem of allMemories) {
+                const content = (mem.content || mem.text || JSON.stringify(mem)).toLowerCase();
+                const matchCount = queryWords.filter(w => content.includes(w)).length;
+                if (matchCount >= 2) {
+                    memories.push({
+                        content: (mem.content || mem.text || JSON.stringify(mem)).slice(0, 500),
+                        type: mem.type || 'lesson',
+                        relevance: matchCount / queryWords.length,
+                        source: 'long-term-memory',
+                    });
+                }
+            }
+        }
+    }
+    catch {
+        // Ignore parse errors
+    }
+    return memories;
+}
+/**
+ * Query CLAUDE.md for relevant sections
+ */
+async function queryCLAUDEMd(classification, projectRoot) {
+    const claudeMdPath = join(projectRoot, 'CLAUDE.md');
+    if (!existsSync(claudeMdPath))
+        return [];
+    const memories = [];
+    try {
+        const content = readFileSync(claudeMdPath, 'utf-8');
+        // Extract Code Field section (always relevant)
+        const codeFieldMatch = content.match(/## .*CODE FIELD.*?(?=\n## |\n---\n|$)/s);
+        if (codeFieldMatch) {
+            memories.push({
+                content: codeFieldMatch[0].slice(0, 800),
+                type: 'pattern',
+                relevance: 0.9,
+                source: 'CLAUDE.md',
+            });
+        }
+        // Extract category-specific sections
+        const categorySectionMap = {
+            'sysadmin': [/## .*System|Admin|Linux|Network.*?(?=\n## |\n---\n|$)/si],
+            'security': [/## .*Security|Auth.*?(?=\n## |\n---\n|$)/si],
+            'testing': [/## .*Test.*?(?=\n## |\n---\n|$)/si],
+            'coding': [/## .*Coding|Convention|Pattern.*?(?=\n## |\n---\n|$)/si],
+        };
+        const patterns = categorySectionMap[classification.category] || [];
+        for (const pattern of patterns) {
+            const match = content.match(pattern);
+            if (match) {
+                memories.push({
+                    content: match[0].slice(0, 600),
+                    type: 'context',
+                    relevance: 0.75,
+                    source: 'CLAUDE.md',
+                });
+            }
+        }
+        // Extract gotchas/troubleshooting sections
+        const gotchasMatch = content.match(/## .*Troubleshoot|Gotcha|Common.*?(?=\n## |\n---\n|$)/si);
+        if (gotchasMatch) {
+            memories.push({
+                content: gotchasMatch[0].slice(0, 500),
+                type: 'gotcha',
+                relevance: 0.7,
+                source: 'CLAUDE.md',
+            });
+        }
+    }
+    catch {
+        // Ignore read errors
+    }
+    return memories;
+}
+/**
+ * Get category-specific patterns from droid knowledge
+ */
+function getCategoryPatterns(classification) {
+    const patterns = [];
+    const categoryPatterns = {
+        'sysadmin': [
+            'Use `ip addr` instead of deprecated `ifconfig` for network info',
+            'Use `ss -tlnp` instead of `netstat` for listening ports',
+            'Always check `journalctl -u <service>` for service logs',
+            'Use `make -j$(nproc)` for parallel kernel compilation',
+        ],
+        'security': [
+            'Never log sensitive data (passwords, tokens, keys)',
+            'Use parameterized queries to prevent SQL injection',
+            'Validate and sanitize all user input',
+            'Check for CVE exploits before attempting complex attacks',
+        ],
+        'ml-training': [
+            'Start with smaller models (distilbert vs bert-large) for speed',
+            'Use `CUDA_VISIBLE_DEVICES` to select specific GPUs',
+            'Cache datasets to avoid repeated downloads',
+            'Set `num_train_epochs=3` initially, increase if needed',
+        ],
+        'debugging': [
+            'Use `pip check` to detect dependency conflicts',
+            'Use `git reflog` to recover lost commits',
+            'Check `conda env export` before modifying environments',
+            'Add verbose flags (-v, --debug) to diagnose issues',
+        ],
+        'coding': [
+            'State assumptions before writing code',
+            'Handle edge cases explicitly (empty arrays, null values)',
+            'Use TypeScript strict mode for better type safety',
+            'Include try-catch for operations that can fail',
+        ],
+        'testing': [
+            'Test edge cases: empty input, null, undefined',
+            'Use mocks for external dependencies',
+            'Aim for high coverage on critical paths',
+            'Run tests before committing: `npm test`',
+        ],
+    };
+    const relevantPatterns = categoryPatterns[classification.category] || [];
+    for (const pattern of relevantPatterns) {
+        patterns.push({
+            content: pattern,
+            type: 'pattern',
+            relevance: 0.85,
+            source: 'droid-knowledge',
+        });
+    }
+    // Add common gotchas
+    const commonGotchas = [
+        'Array index: use `i < length`, not `i <= length`',
+        'JSON.parse throws on invalid input - wrap in try/catch',
+        'Empty array reduce needs initial value',
+        'Map.get() returns undefined for missing keys',
+    ];
+    for (const gotcha of commonGotchas.slice(0, 2)) {
+        patterns.push({
+            content: gotcha,
+            type: 'gotcha',
+            relevance: 0.8,
+            source: 'droid-knowledge',
+        });
+    }
+    return patterns;
+}
+/**
+ * Get project-specific context
+ */
+async function getProjectContext(classification, projectRoot) {
+    const sections = [];
+    // Add project structure if relevant
+    if (['coding', 'testing', 'debugging'].includes(classification.category)) {
+        try {
+            const pkgJsonPath = join(projectRoot, 'package.json');
+            if (existsSync(pkgJsonPath)) {
+                const pkg = JSON.parse(readFileSync(pkgJsonPath, 'utf-8'));
+                sections.push(`Project: ${pkg.name} v${pkg.version}`);
+                if (pkg.scripts) {
+                    const scripts = Object.keys(pkg.scripts).slice(0, 5).join(', ');
+                    sections.push(`Available scripts: ${scripts}`);
+                }
+            }
+        }
+        catch {
+            // Ignore
+        }
+    }
+    return sections.join('\n');
+}
+/**
+ * Format context with recency bias (critical info at END)
+ * Based on Droid's hierarchical prompting strategy
+ */
+function formatContextWithRecencyBias(classification, memories, patterns, gotchas, projectContext) {
+    const sections = [];
+    // Section 1: Project context (less critical, at start)
+    if (projectContext) {
+        sections.push('## Project Context\n' + projectContext);
+    }
+    // Section 2: General patterns (medium priority)
+    if (patterns.length > 0) {
+        sections.push('## Relevant Patterns\n' + patterns.slice(0, 5).map(p => `- ${p}`).join('\n'));
+    }
+    // Section 3: Retrieved memories
+    const lessons = memories.filter(m => m.type === 'lesson').slice(0, 3);
+    if (lessons.length > 0) {
+        sections.push('## Lessons from Memory\n' + lessons.map(m => `- ${m.content}`).join('\n'));
+    }
+    // Section 4: Task classification info
+    sections.push(`## Task Classification
+- Category: ${classification.category}
+- Suggested approach: Use ${classification.suggestedDroid} patterns
+- Key focus: ${classification.keywords.slice(0, 3).join(', ')}`);
+    // Section 5: CRITICAL - Gotchas at END (recency bias)
+    if (gotchas.length > 0) {
+        sections.push('## ⚠️ CRITICAL: Avoid These Mistakes\n' + gotchas.slice(0, 4).map(g => `- ${g}`).join('\n'));
+    }
+    // Section 6: Final reminders (most recent = highest attention)
+    sections.push(`## Final Reminders
+- State assumptions before coding
+- Handle edge cases explicitly
+- Verify solution before reporting success`);
+    return sections.join('\n\n') + '\n\n---\n\n';
+}
+/**
+ * Deduplicate memories by content similarity
+ */
+function deduplicateMemories(memories) {
+    const seen = new Set();
+    const unique = [];
+    for (const mem of memories) {
+        const key = mem.content.slice(0, 100).toLowerCase().replace(/\s+/g, ' ');
+        if (!seen.has(key)) {
+            seen.add(key);
+            unique.push(mem);
+        }
+    }
+    return unique;
+}
+//# sourceMappingURL=dynamic-retrieval.js.map