@miller-tech/uap 1.0.0

package/dist/memory/context-compressor.js

@@ -0,0 +1,430 @@
+/**
+ * Context Compression Module for UAP
+ *
+ * Implements semantic compression to reduce token usage while preserving meaning.
+ * Based on Acon (Agent Context Optimization) and AgentCompress research.
+ */
+import { jaccardSimilarity } from '../utils/string-similarity.js';
+const DEFAULT_CONFIG = {
+    maxTokens: 800,
+    minSemanticPreservation: 0.85,
+    compressionLevel: 'medium',
+};
+/**
+ * Estimate token count using improved heuristics for mixed code/prose
+ * More accurate than simple length/4: accounts for whitespace splits,
+ * special characters, camelCase, and numeric tokens.
+ */
+export function estimateTokens(text) {
+    if (!text || text.length === 0)
+        return 0;
+    // Split by whitespace for base word count
+    const words = text.split(/\s+/).filter((w) => w.length > 0);
+    // Special characters that typically become separate tokens
+    const specialChars = (text.match(/[{}()\[\]<>:;,."'`@#$%^&*+=|\\/?!~-]/g) || []).length;
+    // Code tokens: camelCase/snake_case boundaries add sub-word tokens
+    const codeTokens = (text.match(/[a-z][A-Z]|_[a-z]/g) || []).length;
+    // Numeric sequences often tokenize separately
+    const numbers = (text.match(/\d+/g) || []).length;
+    // Average English word is ~1.3 tokens, code identifiers ~1.5
+    const baseTokens = words.length * 1.3;
+    const specialTokens = specialChars * 0.5;
+    const extraCodeTokens = codeTokens * 0.3;
+    const numberTokens = numbers * 0.5;
+    return Math.ceil(baseTokens + specialTokens + extraCodeTokens + numberTokens);
+}
+/**
+ * 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;
+}
+// jaccardSimilarity imported from ../utils/string-similarity.js
+/**
+ * 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)}`;
+}
+/**
+ * Smart truncation using head+tail split.
+ * Preserves both initial context (setup, config) and final output (errors, results).
+ * Head gets 60%, tail gets 40% of the allowed line budget.
+ */
+export function smartTruncate(content, maxChars) {
+    if (content.length <= maxChars)
+        return content;
+    const lines = content.split('\n');
+    if (lines.length <= 4) {
+        // Too few lines for head+tail split, just char-truncate
+        return content.slice(0, maxChars) + '\n... [truncated]';
+    }
+    const ratio = Math.min(1, maxChars / content.length);
+    const totalLines = Math.max(2, Math.floor(lines.length * ratio));
+    const headLines = Math.max(1, Math.ceil(totalLines * 0.6));
+    const tailLines = Math.max(1, totalLines - headLines);
+    // Avoid overlap when head + tail >= total lines
+    if (headLines + tailLines >= lines.length) {
+        return content.slice(0, maxChars) + '\n... [truncated]';
+    }
+    const headPart = lines.slice(0, headLines);
+    const tailPart = lines.slice(-tailLines);
+    const omitted = lines.length - headLines - tailLines;
+    return [
+        ...headPart,
+        `\n... [${omitted} lines truncated — showing first ${headLines} + last ${tailLines} lines] ...\n`,
+        ...tailPart,
+    ].join('\n');
+}
+/**
+ * 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 - use head+tail split to preserve error context
+        const targetTokens = Math.floor(available * 0.9);
+        const targetChars = targetTokens * 4;
+        const truncated = smartTruncate(content, targetChars);
+        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();
+    }
+}
+/**
+ * Dynamic Compressor - adjusts compression level based on available context budget.
+ *
+ * Tiers:
+ * - light   (budget >70% remaining): remove whitespace/comments only
+ * - medium  (30-70%): also summarize verbose sections
+ * - aggressive (<30%): extract only key facts
+ */
+export class DynamicCompressor {
+    /**
+     * Determine compression tier from budget ratio.
+     */
+    determineTier(budgetRemaining, budgetTotal) {
+        if (budgetTotal <= 0)
+            return 'aggressive';
+        const ratio = budgetRemaining / budgetTotal;
+        if (ratio > 0.7)
+            return 'light';
+        if (ratio >= 0.3)
+            return 'medium';
+        return 'aggressive';
+    }
+    /**
+     * Light compression: strip whitespace and comment lines only.
+     */
+    compressLight(content) {
+        let result = content;
+        // Remove single-line comments (// ...)
+        result = result.replace(/\/\/[^\n]*/g, '');
+        // Remove multi-line comments (/* ... */)
+        result = result.replace(/\/\*[\s\S]*?\*\//g, '');
+        // Remove hash comments (# ...)
+        result = result.replace(/^#[^\n]*/gm, '');
+        // Collapse redundant whitespace
+        result = result.replace(/\n{3,}/g, '\n\n');
+        result = result.replace(/[ \t]+/g, ' ');
+        return result.trim();
+    }
+    /**
+     * Medium compression: light + summarize verbose sections by removing filler.
+     */
+    compressMedium(content) {
+        let result = this.compressLight(content);
+        // Remove filler phrases
+        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,
+            /\b(please note that|note that)\b/gi,
+        ];
+        for (const pattern of fillerPatterns) {
+            result = result.replace(pattern, '');
+        }
+        // Remove filler sentences
+        const sentences = result.split(/(?<=[.!?])\s+/);
+        const kept = sentences.filter((s) => {
+            const lower = s.toLowerCase().trim();
+            if (lower.length < 10)
+                return false;
+            if (/^(let me|i will|i'll|okay|alright|sure|thanks|thank you)/i.test(lower))
+                return false;
+            if (/^(as mentioned|as noted|as stated|as discussed)/i.test(lower))
+                return false;
+            if (/^(in conclusion|to summarize|in summary|overall)/i.test(lower))
+                return false;
+            return true;
+        });
+        result = kept.join(' ');
+        result = result.replace(/\s{2,}/g, ' ').trim();
+        return result;
+    }
+    /**
+     * Aggressive compression: extract only key facts (entities, decisions, actions).
+     */
+    compressAggressive(content) {
+        const mediumResult = this.compressMedium(content);
+        const sentences = mediumResult.split(/(?<=[.!?])\s+/).filter((s) => s.trim().length > 10);
+        // Score each sentence and keep only high-value ones
+        const scored = sentences.map((s) => {
+            let score = 0;
+            // Boost for technical content
+            if (/`[^`]+`|"[^"]+"|'[^']+'/.test(s))
+                score += 2;
+            if (/\.(ts|js|py|sh|json|yaml|md)\b|\/[\w/]+/.test(s))
+                score += 2;
+            // Boost for actionable/important language
+            if (/^(use|run|execute|call|apply|implement|add|remove|fix|change)/i.test(s))
+                score += 2;
+            if (/careful|watch out|gotcha|avoid|don't|never|must|critical|important/i.test(s))
+                score += 3;
+            if (/decided|chose|selected|learned|realized|discovered/i.test(s))
+                score += 2;
+            // Penalty for vague language
+            if (/might|maybe|perhaps|possibly|somewhat|kind of/i.test(s))
+                score -= 1;
+            if (/I think|I believe|in my opinion|it seems/i.test(s))
+                score -= 1;
+            return { sentence: s, score };
+        });
+        // Keep sentences with positive scores, or at minimum the top 40%
+        scored.sort((a, b) => b.score - a.score);
+        const minKeep = Math.max(1, Math.ceil(scored.length * 0.4));
+        const kept = scored.filter((s) => s.score > 0);
+        const result = kept.length >= minKeep ? kept : scored.slice(0, minKeep);
+        return result
+            .map((s) => s.sentence)
+            .join(' ')
+            .trim();
+    }
+    /**
+     * Compress content dynamically based on remaining context budget.
+     *
+     * @param content - The text to compress
+     * @param budgetRemaining - Tokens remaining in the context budget
+     * @param budgetTotal - Total context budget in tokens
+     * @returns Compressed content and compression ratio
+     */
+    compressDynamic(content, budgetRemaining, budgetTotal) {
+        const tier = this.determineTier(budgetRemaining, budgetTotal);
+        const originalTokens = estimateTokens(content);
+        let compressed;
+        switch (tier) {
+            case 'light':
+                compressed = this.compressLight(content);
+                break;
+            case 'medium':
+                compressed = this.compressMedium(content);
+                break;
+            case 'aggressive':
+                compressed = this.compressAggressive(content);
+                break;
+        }
+        const compressedTokens = estimateTokens(compressed);
+        const ratio = originalTokens > 0 ? compressedTokens / originalTokens : 1;
+        return { compressed, ratio };
+    }
+}
+//# 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;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAiBlE,MAAM,cAAc,GAAqB;IACvC,SAAS,EAAE,GAAG;IACd,uBAAuB,EAAE,IAAI;IAC7B,gBAAgB,EAAE,QAAQ;CAC3B,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEzC,0CAA0C;IAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE5D,2DAA2D;IAC3D,MAAM,YAAY,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,uCAAuC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IAExF,mEAAmE;IACnE,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IAEnE,8CAA8C;IAC9C,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IAElD,6DAA6D;IAC7D,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC;IACtC,MAAM,aAAa,GAAG,YAAY,GAAG,GAAG,CAAC;IACzC,MAAM,eAAe,GAAG,UAAU,GAAG,GAAG,CAAC;IACzC,MAAM,YAAY,GAAG,OAAO,GAAG,GAAG,CAAC;IAEnC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,aAAa,GAAG,eAAe,GAAG,YAAY,CAAC,CAAC;AAChF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAe,EACf,SAAoC,EAAE;IAEtC,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,gBAAgB,GAAG,cAAc,CAAC;IAE7D,gFAAgF;IAChF,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,cAAc,GAAG,GAAG,CAAC,CAAC;IAEnE,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,EAAE,CAAC,mBAAmB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;YACpF,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,EAAE,CAAC,mBAAmB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;YACpF,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,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,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,gBAAgB,GAAG,cAAc;QACrD,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,EAAE;YAClC,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,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE,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,gEAAgE;AAEhE;;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,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACpF,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,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IAEjE,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;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe,EAAE,QAAgB;IAC7D,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ;QAAE,OAAO,OAAO,CAAC;IAE/C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,wDAAwD;QACxD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,mBAAmB,CAAC;IAC1D,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IACrD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IACjE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC;IAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC,CAAC;IAEtD,gDAAgD;IAChD,IAAI,SAAS,GAAG,SAAS,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,mBAAmB,CAAC;IAC1D,CAAC;IAED,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,GAAG,SAAS,GAAG,SAAS,CAAC;IAErD,OAAO;QACL,GAAG,QAAQ;QACX,UAAU,OAAO,oCAAoC,SAAS,WAAW,SAAS,eAAe;QACjG,GAAG,QAAQ;KACZ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,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,CACN,OAAe,EACf,OAAe;QAEf,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,mEAAmE;QACnE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;QACjD,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACtD,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;AAOD;;;;;;;GAOG;AACH,MAAM,OAAO,iBAAiB;IAC5B;;OAEG;IACK,aAAa,CAAC,eAAuB,EAAE,WAAmB;QAChE,IAAI,WAAW,IAAI,CAAC;YAAE,OAAO,YAAY,CAAC;QAC1C,MAAM,KAAK,GAAG,eAAe,GAAG,WAAW,CAAC;QAC5C,IAAI,KAAK,GAAG,GAAG;YAAE,OAAO,OAAO,CAAC;QAChC,IAAI,KAAK,IAAI,GAAG;YAAE,OAAO,QAAQ,CAAC;QAClC,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,OAAe;QACnC,IAAI,MAAM,GAAG,OAAO,CAAC;QAErB,uCAAuC;QACvC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;QAE3C,yCAAyC;QACzC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;QAEjD,+BAA+B;QAC/B,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QAE1C,gCAAgC;QAChC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC3C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAExC,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,OAAe;QACpC,IAAI,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAEzC,wBAAwB;QACxB,MAAM,cAAc,GAAG;YACrB,0EAA0E;YAC1E,qBAAqB;YACrB,yDAAyD;YACzD,qCAAqC;YACrC,+BAA+B;YAC/B,uBAAuB;YACvB,mCAAmC;YACnC,oCAAoC;SACrC,CAAC;QAEF,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;YACrC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,0BAA0B;QAC1B,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YAClC,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;YACrC,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE;gBAAE,OAAO,KAAK,CAAC;YACpC,IAAI,2DAA2D,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC1F,IAAI,kDAAkD,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACjF,IAAI,mDAAmD,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClF,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAE/C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,OAAe;QACxC,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAElD,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;QAE1F,oDAAoD;QACpD,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACjC,IAAI,KAAK,GAAG,CAAC,CAAC;YAEd,8BAA8B;YAC9B,IAAI,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;YAClD,IAAI,yCAAyC,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;YAElE,0CAA0C;YAC1C,IAAI,gEAAgE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;YACzF,IAAI,qEAAqE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;YAC9F,IAAI,qDAAqD,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;YAE9E,6BAA6B;YAC7B,IAAI,gDAAgD,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;YACzE,IAAI,2CAA2C,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;YAEpE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,iEAAiE;QACjE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAExE,OAAO,MAAM;aACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;aACtB,IAAI,CAAC,GAAG,CAAC;aACT,IAAI,EAAE,CAAC;IACZ,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CACb,OAAe,EACf,eAAuB,EACvB,WAAmB;QAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;QAC9D,MAAM,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;QAE/C,IAAI,UAAkB,CAAC;QAEvB,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,OAAO;gBACV,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;gBACzC,MAAM;YACR,KAAK,QAAQ;gBACX,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM;YACR,KAAK,YAAY;gBACf,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;gBAC9C,MAAM;QACV,CAAC;QAED,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QAEzE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC/B,CAAC;CACF"}

package/dist/memory/context-pruner.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Context Pruner Module for UAP
+ *
+ * Scores and prunes memories based on relevance, recency, and access frequency
+ * to fit within a token budget. Uses a composite scoring formula to decide
+ * which memories to keep.
+ */
+export interface PrunableMemory {
+    content: string;
+    relevance: number;
+    age: number;
+    accessCount: number;
+}
+export interface PrunedMemory {
+    content: string;
+    relevance: number;
+}
+/**
+ * Estimate token count from text using a rough 4-chars-per-token heuristic.
+ */
+export declare function estimateTokens(text: string): number;
+/**
+ * ContextPruner scores memories using a composite formula and removes
+ * low-scoring entries until the remaining set fits within a token budget.
+ *
+ * Scoring formula:
+ *   score = relevance * 0.5 + recency * 0.3 + frequency * 0.2
+ *
+ * where:
+ *   recency   = 1 / (1 + age_hours)
+ *   frequency = min(accessCount / 10, 1)
+ */
+export declare class ContextPruner {
+    /**
+     * Calculate composite score for a memory entry.
+     */
+    private scoreMemory;
+    /**
+     * Prune memories to fit within a token budget.
+     *
+     * Scores each memory, sorts by score descending, then keeps memories
+     * until the budget is exhausted.
+     *
+     * @param memories - Array of memory entries with metadata
+     * @param budget - Maximum number of tokens for the result
+     * @returns Pruned array of memories that fit within budget
+     */
+    prune(memories: PrunableMemory[], budget: number): PrunedMemory[];
+    /**
+     * Rough token estimation at 4 characters per token.
+     */
+    estimateTokens(text: string): number;
+}
+export declare function getContextPruner(): ContextPruner;
+//# sourceMappingURL=context-pruner.d.ts.map

package/dist/memory/context-pruner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"context-pruner.d.ts","sourceRoot":"","sources":["../../src/memory/context-pruner.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,GAAG,EAAE,MAAM,CAAC;IACZ,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAGnD;AAED;;;;;;;;;;GAUG;AACH,qBAAa,aAAa;IACxB;;OAEG;IACH,OAAO,CAAC,WAAW;IAMnB;;;;;;;;;OASG;IACH,KAAK,CAAC,QAAQ,EAAE,cAAc,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,YAAY,EAAE;IA4BjE;;OAEG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;CAGrC;AAKD,wBAAgB,gBAAgB,IAAI,aAAa,CAKhD"}

package/dist/memory/context-pruner.js

@@ -0,0 +1,85 @@
+/**
+ * Context Pruner Module for UAP
+ *
+ * Scores and prunes memories based on relevance, recency, and access frequency
+ * to fit within a token budget. Uses a composite scoring formula to decide
+ * which memories to keep.
+ */
+/**
+ * Estimate token count from text using a rough 4-chars-per-token heuristic.
+ */
+export function estimateTokens(text) {
+    if (!text || text.length === 0)
+        return 0;
+    return Math.ceil(text.length / 4);
+}
+/**
+ * ContextPruner scores memories using a composite formula and removes
+ * low-scoring entries until the remaining set fits within a token budget.
+ *
+ * Scoring formula:
+ *   score = relevance * 0.5 + recency * 0.3 + frequency * 0.2
+ *
+ * where:
+ *   recency   = 1 / (1 + age_hours)
+ *   frequency = min(accessCount / 10, 1)
+ */
+export class ContextPruner {
+    /**
+     * Calculate composite score for a memory entry.
+     */
+    scoreMemory(memory) {
+        const recency = 1 / (1 + memory.age);
+        const frequency = Math.min(memory.accessCount / 10, 1);
+        return memory.relevance * 0.5 + recency * 0.3 + frequency * 0.2;
+    }
+    /**
+     * Prune memories to fit within a token budget.
+     *
+     * Scores each memory, sorts by score descending, then keeps memories
+     * until the budget is exhausted.
+     *
+     * @param memories - Array of memory entries with metadata
+     * @param budget - Maximum number of tokens for the result
+     * @returns Pruned array of memories that fit within budget
+     */
+    prune(memories, budget) {
+        if (memories.length === 0)
+            return [];
+        // Score and sort descending
+        const scored = memories.map((m) => ({
+            memory: m,
+            score: this.scoreMemory(m),
+            tokens: estimateTokens(m.content),
+        }));
+        scored.sort((a, b) => b.score - a.score);
+        // Greedily keep memories until budget is used
+        const result = [];
+        let usedTokens = 0;
+        for (const entry of scored) {
+            if (usedTokens + entry.tokens > budget)
+                continue;
+            usedTokens += entry.tokens;
+            result.push({
+                content: entry.memory.content,
+                relevance: entry.memory.relevance,
+            });
+        }
+        return result;
+    }
+    /**
+     * Rough token estimation at 4 characters per token.
+     */
+    estimateTokens(text) {
+        return estimateTokens(text);
+    }
+}
+// Singleton
+let instance = null;
+export function getContextPruner() {
+    if (!instance) {
+        instance = new ContextPruner();
+    }
+    return instance;
+}
+//# sourceMappingURL=context-pruner.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"context-pruner.js","sourceRoot":"","sources":["../../src/memory/context-pruner.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAcH;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,aAAa;IACxB;;OAEG;IACK,WAAW,CAAC,MAAsB;QACxC,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC,SAAS,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,GAAG,SAAS,GAAG,GAAG,CAAC;IAClE,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,QAA0B,EAAE,MAAc;QAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,4BAA4B;QAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAClC,MAAM,EAAE,CAAC;YACT,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC;SAClC,CAAC,CAAC,CAAC;QAEJ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAEzC,8CAA8C;QAC9C,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM;gBAAE,SAAS;YACjD,UAAU,IAAI,KAAK,CAAC,MAAM,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC;gBACV,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,OAAO;gBAC7B,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC,SAAS;aAClC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,IAAY;QACzB,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;CACF;AAED,YAAY;AACZ,IAAI,QAAQ,GAAyB,IAAI,CAAC;AAE1C,MAAM,UAAU,gBAAgB;IAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,QAAQ,GAAG,IAAI,aAAa,EAAE,CAAC;IACjC,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/memory/correction-propagator.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Correction Propagation Protocol
+ *
+ * When a memory is corrected, updates propagate across all tiers:
+ * daily log, working memory, and session memory. Old claims are marked
+ * [superseded] with date and reason, preserving the audit trail.
+ *
+ * Inspired by Total Recall's correction gate.
+ */
+import Database from 'better-sqlite3';
+export interface CorrectionResult {
+    originalFound: boolean;
+    originalId?: number;
+    originalContent?: string;
+    tiersUpdated: string[];
+    supersededCount: number;
+    correctedEntryId?: number;
+}
+export interface SupersededEntry {
+    id: number;
+    tier: string;
+    originalContent: string;
+    supersededDate: string;
+    supersededBy: string;
+    reason: string;
+}
+/**
+ * Ensure the superseded tracking table exists.
+ */
+export declare function ensureSupersededSchema(db: Database.Database): void;
+/**
+ * Propagate a correction across all memory tiers.
+ *
+ * @param dbPath Path to the SQLite database
+ * @param searchContent Content to find and correct (fuzzy match)
+ * @param correctedContent The corrected version
+ * @param reason Why the correction was made
+ */
+export declare function propagateCorrection(dbPath: string, searchContent: string, correctedContent: string, reason?: string): CorrectionResult;
+/**
+ * Get the superseded history for audit trail.
+ */
+export declare function getSupersededHistory(dbPath: string, limit?: number): SupersededEntry[];
+//# sourceMappingURL=correction-propagator.d.ts.map

package/dist/memory/correction-propagator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"correction-propagator.d.ts","sourceRoot":"","sources":["../../src/memory/correction-propagator.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AAItC,MAAM,WAAW,gBAAgB;IAC/B,aAAa,EAAE,OAAO,CAAC;IACvB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAalE;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,MAAM,EACrB,gBAAgB,EAAE,MAAM,EACxB,MAAM,GAAE,MAA0B,GACjC,gBAAgB,CAwGlB;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,MAAW,GACjB,eAAe,EAAE,CAgCnB"}