driftdetect-cortex 0.9.41

package/dist/compression/compressor/level-2.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Level 2 Compressor
+ *
+ * Compresses memories with one example (~200 tokens).
+ * Includes knowledge, best example, and key evidence.
+ *
+ * @module compression/compressor/level-2
+ */
+import type { Level2Output } from '../../types/compressed-memory.js';
+import type { Memory } from '../../types/memory.js';
+/**
+ * Level 2 Compressor
+ *
+ * Produces output containing:
+ * - Level 1 fields (ID, type, importance, oneLiner, tags, confidence)
+ * - Core knowledge/content
+ * - Single best example
+ * - Key evidence points (max 2)
+ */
+export declare class Level2Compressor {
+    /** Target tokens for level 2 */
+    private readonly TARGET_TOKENS;
+    /** Maximum knowledge length in characters */
+    private readonly MAX_KNOWLEDGE_CHARS;
+    /** Maximum example length in characters */
+    private readonly MAX_EXAMPLE_CHARS;
+    /** Maximum evidence items */
+    private readonly MAX_EVIDENCE;
+    /** Maximum evidence item length */
+    private readonly MAX_EVIDENCE_CHARS;
+    private level1Compressor;
+    constructor();
+    /**
+     * Compress a memory to level 2
+     */
+    compress(memory: Memory): Level2Output;
+    /**
+     * Compress multiple memories to level 2
+     */
+    compressBatch(memories: Memory[]): Level2Output[];
+    /**
+     * Extract core knowledge from memory
+     */
+    extractKnowledge(memory: Memory): string;
+    /**
+     * Select the best example from memory
+     */
+    selectBestExample(memory: Memory): string | undefined;
+    /**
+     * Select key evidence points
+     */
+    selectEvidence(memory: Memory, maxItems: number): string[];
+    /**
+     * Estimate token count for level 2 output
+     */
+    estimateTokens(level1Tokens: number, knowledge: string, example: string | undefined, evidence: string[]): number;
+    /**
+     * Get target token count for this level
+     */
+    getTargetTokens(): number;
+    /**
+     * Format level 2 output as string
+     */
+    format(output: Level2Output): string;
+    private extractTypeSpecificKnowledge;
+    private getExamples;
+    private getEvidence;
+    private generateEvidence;
+    private scoreExample;
+    private truncate;
+}
+//# sourceMappingURL=level-2.d.ts.map

package/dist/compression/compressor/level-2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"level-2.d.ts","sourceRoot":"","sources":["../../../src/compression/compressor/level-2.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AACrE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAGpD;;;;;;;;GAQG;AACH,qBAAa,gBAAgB;IAC3B,gCAAgC;IAChC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAO;IACrC,6CAA6C;IAC7C,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAO;IAC3C,2CAA2C;IAC3C,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAO;IACzC,6BAA6B;IAC7B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAK;IAClC,mCAAmC;IACnC,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAO;IAE1C,OAAO,CAAC,gBAAgB,CAAmB;;IAM3C;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY;IAuBtC;;OAEG;IACH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,YAAY,EAAE;IAIjD;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAexC;;OAEG;IACH,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAsBrD;;OAEG;IACH,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAuB1D;;OAEG;IACH,cAAc,CACZ,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,GAAG,SAAS,EAC3B,QAAQ,EAAE,MAAM,EAAE,GACjB,MAAM;IAcT;;OAEG;IACH,eAAe,IAAI,MAAM;IAIzB;;OAEG;IACH,MAAM,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM;IAoBpC,OAAO,CAAC,4BAA4B;IAepC,OAAO,CAAC,WAAW;IAsCnB,OAAO,CAAC,WAAW;IA+BnB,OAAO,CAAC,gBAAgB;IAqBxB,OAAO,CAAC,YAAY;IAuBpB,OAAO,CAAC,QAAQ;CAMjB"}

package/dist/compression/compressor/level-2.js

@@ -0,0 +1,273 @@
+/**
+ * Level 2 Compressor
+ *
+ * Compresses memories with one example (~200 tokens).
+ * Includes knowledge, best example, and key evidence.
+ *
+ * @module compression/compressor/level-2
+ */
+import { Level1Compressor } from './level-1.js';
+/**
+ * Level 2 Compressor
+ *
+ * Produces output containing:
+ * - Level 1 fields (ID, type, importance, oneLiner, tags, confidence)
+ * - Core knowledge/content
+ * - Single best example
+ * - Key evidence points (max 2)
+ */
+export class Level2Compressor {
+    /** Target tokens for level 2 */
+    TARGET_TOKENS = 200;
+    /** Maximum knowledge length in characters */
+    MAX_KNOWLEDGE_CHARS = 400;
+    /** Maximum example length in characters */
+    MAX_EXAMPLE_CHARS = 300;
+    /** Maximum evidence items */
+    MAX_EVIDENCE = 2;
+    /** Maximum evidence item length */
+    MAX_EVIDENCE_CHARS = 100;
+    level1Compressor;
+    constructor() {
+        this.level1Compressor = new Level1Compressor();
+    }
+    /**
+     * Compress a memory to level 2
+     */
+    compress(memory) {
+        const level1 = this.level1Compressor.compress(memory);
+        const knowledge = this.extractKnowledge(memory);
+        const example = this.selectBestExample(memory);
+        const evidence = this.selectEvidence(memory, this.MAX_EVIDENCE);
+        const details = {
+            knowledge,
+            evidence,
+        };
+        // Only add example if it exists
+        if (example) {
+            details.example = example;
+        }
+        return {
+            ...level1,
+            details,
+            tokens: this.estimateTokens(level1.tokens, knowledge, example, evidence),
+        };
+    }
+    /**
+     * Compress multiple memories to level 2
+     */
+    compressBatch(memories) {
+        return memories.map(m => this.compress(m));
+    }
+    /**
+     * Extract core knowledge from memory
+     */
+    extractKnowledge(memory) {
+        // Try type-specific knowledge extraction
+        const typeKnowledge = this.extractTypeSpecificKnowledge(memory);
+        if (typeKnowledge) {
+            return this.truncate(typeKnowledge, this.MAX_KNOWLEDGE_CHARS);
+        }
+        // Fall back to summary or generic
+        if (memory.summary) {
+            return this.truncate(memory.summary, this.MAX_KNOWLEDGE_CHARS);
+        }
+        return `${memory.type} memory with importance ${memory.importance}`;
+    }
+    /**
+     * Select the best example from memory
+     */
+    selectBestExample(memory) {
+        // Try to get examples from memory
+        const examples = this.getExamples(memory);
+        if (examples.length === 0) {
+            return undefined;
+        }
+        // Select the best example based on:
+        // 1. Length (prefer medium-length examples)
+        // 2. Completeness (has code, not just description)
+        const scored = examples.map(ex => ({
+            example: ex,
+            score: this.scoreExample(ex),
+        }));
+        scored.sort((a, b) => b.score - a.score);
+        const best = scored[0]?.example;
+        return best ? this.truncate(best, this.MAX_EXAMPLE_CHARS) : undefined;
+    }
+    /**
+     * Select key evidence points
+     */
+    selectEvidence(memory, maxItems) {
+        const evidence = [];
+        // Extract evidence from memory
+        const memoryEvidence = this.getEvidence(memory);
+        for (const ev of memoryEvidence) {
+            if (evidence.length >= maxItems)
+                break;
+            evidence.push(this.truncate(ev, this.MAX_EVIDENCE_CHARS));
+        }
+        // If no explicit evidence, generate from context
+        if (evidence.length === 0) {
+            const generated = this.generateEvidence(memory);
+            for (const ev of generated) {
+                if (evidence.length >= maxItems)
+                    break;
+                evidence.push(this.truncate(ev, this.MAX_EVIDENCE_CHARS));
+            }
+        }
+        return evidence;
+    }
+    /**
+     * Estimate token count for level 2 output
+     */
+    estimateTokens(level1Tokens, knowledge, example, evidence) {
+        const knowledgeTokens = Math.ceil(knowledge.length / 4);
+        const exampleTokens = example ? Math.ceil(example.length / 4) : 0;
+        const evidenceTokens = evidence.reduce((sum, e) => sum + Math.ceil(e.length / 4), 0);
+        return Math.max(this.TARGET_TOKENS, level1Tokens + knowledgeTokens + exampleTokens + evidenceTokens);
+    }
+    /**
+     * Get target token count for this level
+     */
+    getTargetTokens() {
+        return this.TARGET_TOKENS;
+    }
+    /**
+     * Format level 2 output as string
+     */
+    format(output) {
+        const parts = [
+            this.level1Compressor.format(output),
+            '',
+            `Knowledge: ${output.details.knowledge}`,
+        ];
+        if (output.details.example) {
+            parts.push(`Example: ${output.details.example}`);
+        }
+        if (output.details.evidence.length > 0) {
+            parts.push(`Evidence: ${output.details.evidence.join('; ')}`);
+        }
+        return parts.join('\n');
+    }
+    // Private helper methods
+    extractTypeSpecificKnowledge(memory) {
+        const m = memory;
+        switch (memory.type) {
+            case 'tribal':
+                return m['knowledge'] || m['content'];
+            case 'pattern_rationale':
+                return m['rationale'] || m['explanation'];
+            case 'code_smell':
+                return m['description'] || m['reason'];
+            default:
+                return m['content'] || m['knowledge'];
+        }
+    }
+    getExamples(memory) {
+        const m = memory;
+        const examples = [];
+        // Check various example fields
+        const examplesArr = m['examples'];
+        if (examplesArr && Array.isArray(examplesArr)) {
+            for (const ex of examplesArr) {
+                if (typeof ex === 'string') {
+                    examples.push(ex);
+                }
+                else if (ex && typeof ex === 'object') {
+                    const exObj = ex;
+                    const code = exObj['code'];
+                    const content = exObj['content'];
+                    if (code && typeof code === 'string')
+                        examples.push(code);
+                    else if (content && typeof content === 'string')
+                        examples.push(content);
+                }
+            }
+        }
+        const example = m['example'];
+        if (example && typeof example === 'string') {
+            examples.push(example);
+        }
+        const correctExample = m['correctExample'];
+        if (correctExample && typeof correctExample === 'string') {
+            examples.push(correctExample);
+        }
+        const exampleGood = m['exampleGood'];
+        if (exampleGood && typeof exampleGood === 'string') {
+            examples.push(exampleGood);
+        }
+        return examples;
+    }
+    getEvidence(memory) {
+        const m = memory;
+        const evidence = [];
+        const evidenceArr = m['evidence'];
+        if (evidenceArr && Array.isArray(evidenceArr)) {
+            for (const ev of evidenceArr) {
+                if (typeof ev === 'string') {
+                    evidence.push(ev);
+                }
+                else if (ev && typeof ev === 'object') {
+                    const evObj = ev;
+                    const content = evObj['content'];
+                    const description = evObj['description'];
+                    if (content && typeof content === 'string')
+                        evidence.push(content);
+                    else if (description && typeof description === 'string')
+                        evidence.push(description);
+                }
+            }
+        }
+        const source = m['source'];
+        if (source && typeof source === 'object') {
+            const sourceObj = source;
+            const reference = sourceObj['reference'];
+            if (reference && typeof reference === 'string') {
+                evidence.push(`Source: ${reference}`);
+            }
+        }
+        return evidence;
+    }
+    generateEvidence(memory) {
+        const evidence = [];
+        // Generate evidence from metadata
+        if (memory.confidence >= 0.8) {
+            evidence.push(`High confidence (${(memory.confidence * 100).toFixed(0)}%)`);
+        }
+        if (memory.accessCount && memory.accessCount > 5) {
+            evidence.push(`Frequently accessed (${memory.accessCount} times)`);
+        }
+        const m = memory;
+        const linkedFiles = m['linkedFiles'];
+        if (linkedFiles && Array.isArray(linkedFiles) && linkedFiles.length > 0) {
+            evidence.push(`Linked to ${linkedFiles.length} file(s)`);
+        }
+        return evidence;
+    }
+    scoreExample(example) {
+        let score = 0;
+        // Prefer medium length (50-200 chars)
+        if (example.length >= 50 && example.length <= 200) {
+            score += 10;
+        }
+        else if (example.length > 200) {
+            score += 5;
+        }
+        // Prefer code-like content
+        if (example.includes('function') || example.includes('const') || example.includes('class')) {
+            score += 5;
+        }
+        // Prefer examples with structure
+        if (example.includes('\n')) {
+            score += 3;
+        }
+        return score;
+    }
+    truncate(text, maxLength) {
+        if (text.length <= maxLength) {
+            return text;
+        }
+        return text.slice(0, maxLength - 3) + '...';
+    }
+}
+//# sourceMappingURL=level-2.js.map

package/dist/compression/compressor/level-2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"level-2.js","sourceRoot":"","sources":["../../../src/compression/compressor/level-2.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAEhD;;;;;;;;GAQG;AACH,MAAM,OAAO,gBAAgB;IAC3B,gCAAgC;IACf,aAAa,GAAG,GAAG,CAAC;IACrC,6CAA6C;IAC5B,mBAAmB,GAAG,GAAG,CAAC;IAC3C,2CAA2C;IAC1B,iBAAiB,GAAG,GAAG,CAAC;IACzC,6BAA6B;IACZ,YAAY,GAAG,CAAC,CAAC;IAClC,mCAAmC;IAClB,kBAAkB,GAAG,GAAG,CAAC;IAElC,gBAAgB,CAAmB;IAE3C;QACE,IAAI,CAAC,gBAAgB,GAAG,IAAI,gBAAgB,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,MAAc;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAEhE,MAAM,OAAO,GAA4B;YACvC,SAAS;YACT,QAAQ;SACT,CAAC;QAEF,gCAAgC;QAChC,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC;QAC5B,CAAC;QAED,OAAO;YACL,GAAG,MAAM;YACT,OAAO;YACP,MAAM,EAAE,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC;SACzE,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,QAAkB;QAC9B,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,yCAAyC;QACzC,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,MAAM,CAAC,CAAC;QAChE,IAAI,aAAa,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAChE,CAAC;QAED,kCAAkC;QAClC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACjE,CAAC;QAED,OAAO,GAAG,MAAM,CAAC,IAAI,2BAA2B,MAAM,CAAC,UAAU,EAAE,CAAC;IACtE,CAAC;IAED;;OAEG;IACH,iBAAiB,CAAC,MAAc;QAC9B,kCAAkC;QAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,oCAAoC;QACpC,4CAA4C;QAC5C,mDAAmD;QACnD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACjC,OAAO,EAAE,EAAE;YACX,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;SAC7B,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,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC;QAChC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxE,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,QAAgB;QAC7C,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,+BAA+B;QAC/B,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAEhD,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;YAChC,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ;gBAAE,MAAM;YACvC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,iDAAiD;QACjD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;YAChD,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ;oBAAE,MAAM;gBACvC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,cAAc,CACZ,YAAoB,EACpB,SAAiB,EACjB,OAA2B,EAC3B,QAAkB;QAElB,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxD,MAAM,aAAa,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CACpC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EACzC,CAAC,CACF,CAAC;QAEF,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,CAAC,aAAa,EAClB,YAAY,GAAG,eAAe,GAAG,aAAa,GAAG,cAAc,CAChE,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,MAAoB;QACzB,MAAM,KAAK,GAAa;YACtB,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC;YACpC,EAAE;YACF,cAAc,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE;SACzC,CAAC;QAEF,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,YAAY,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QACnD,CAAC;QAED,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,aAAa,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChE,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,yBAAyB;IAEjB,4BAA4B,CAAC,MAAc;QACjD,MAAM,CAAC,GAAG,MAA4C,CAAC;QAEvD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,QAAQ;gBACX,OAAQ,CAAC,CAAC,WAAW,CAAwB,IAAK,CAAC,CAAC,SAAS,CAAwB,CAAC;YACxF,KAAK,mBAAmB;gBACtB,OAAQ,CAAC,CAAC,WAAW,CAAwB,IAAK,CAAC,CAAC,aAAa,CAAwB,CAAC;YAC5F,KAAK,YAAY;gBACf,OAAQ,CAAC,CAAC,aAAa,CAAwB,IAAK,CAAC,CAAC,QAAQ,CAAwB,CAAC;YACzF;gBACE,OAAQ,CAAC,CAAC,SAAS,CAAwB,IAAK,CAAC,CAAC,WAAW,CAAwB,CAAC;QAC1F,CAAC;IACH,CAAC;IAEO,WAAW,CAAC,MAAc;QAChC,MAAM,CAAC,GAAG,MAA4C,CAAC;QACvD,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,+BAA+B;QAC/B,MAAM,WAAW,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9C,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;oBAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,CAAC;qBAAM,IAAI,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;oBACxC,MAAM,KAAK,GAAG,EAA6B,CAAC;oBAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;oBAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;oBACjC,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;wBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;yBACrD,IAAI,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ;wBAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC1E,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAC7B,IAAI,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAC3C,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC;QAED,MAAM,cAAc,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAAC;QAC3C,IAAI,cAAc,IAAI,OAAO,cAAc,KAAK,QAAQ,EAAE,CAAC;YACzD,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAChC,CAAC;QAED,MAAM,WAAW,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;QACrC,IAAI,WAAW,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;YACnD,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,WAAW,CAAC,MAAc;QAChC,MAAM,CAAC,GAAG,MAA4C,CAAC;QACvD,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,MAAM,WAAW,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9C,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;oBAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,CAAC;qBAAM,IAAI,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;oBACxC,MAAM,KAAK,GAAG,EAA6B,CAAC;oBAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;oBACjC,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;oBACzC,IAAI,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ;wBAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;yBAC9D,IAAI,WAAW,IAAI,OAAO,WAAW,KAAK,QAAQ;wBAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACtF,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YACzC,MAAM,SAAS,GAAG,MAAiC,CAAC;YACpD,MAAM,SAAS,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC;YACzC,IAAI,SAAS,IAAI,OAAO,SAAS,KAAK,QAAQ,EAAE,CAAC;gBAC/C,QAAQ,CAAC,IAAI,CAAC,WAAW,SAAS,EAAE,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,gBAAgB,CAAC,MAAc;QACrC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,kCAAkC;QAClC,IAAI,MAAM,CAAC,UAAU,IAAI,GAAG,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9E,CAAC;QAED,IAAI,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YACjD,QAAQ,CAAC,IAAI,CAAC,wBAAwB,MAAM,CAAC,WAAW,SAAS,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,CAAC,GAAG,MAA4C,CAAC;QACvD,MAAM,WAAW,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;QACrC,IAAI,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxE,QAAQ,CAAC,IAAI,CAAC,aAAa,WAAW,CAAC,MAAM,UAAU,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,YAAY,CAAC,OAAe;QAClC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,sCAAsC;QACtC,IAAI,OAAO,CAAC,MAAM,IAAI,EAAE,IAAI,OAAO,CAAC,MAAM,IAAI,GAAG,EAAE,CAAC;YAClD,KAAK,IAAI,EAAE,CAAC;QACd,CAAC;aAAM,IAAI,OAAO,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;QAED,2BAA2B;QAC3B,IAAI,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3F,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;QAED,iCAAiC;QACjC,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,QAAQ,CAAC,IAAY,EAAE,SAAiB;QAC9C,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;IAC9C,CAAC;CACF"}

package/dist/compression/compressor/level-3.d.ts

@@ -0,0 +1,68 @@
+/**
+ * Level 3 Compressor
+ *
+ * Full context compression (variable tokens).
+ * Includes complete knowledge, all examples, evidence,
+ * related memories, and causal chains.
+ *
+ * @module compression/compressor/level-3
+ */
+import type { Level3Output } from '../../types/compressed-memory.js';
+import type { Memory } from '../../types/memory.js';
+/**
+ * Level 3 Compressor
+ *
+ * Produces full output containing:
+ * - Level 2 fields
+ * - Complete knowledge
+ * - All examples
+ * - All evidence
+ * - Related memory IDs
+ * - Causal chain summary
+ * - Linked entities
+ */
+export declare class Level3Compressor {
+    /** Target tokens for level 3 (minimum) */
+    private readonly TARGET_TOKENS;
+    /** Maximum tokens for level 3 */
+    private readonly MAX_TOKENS;
+    private level2Compressor;
+    constructor();
+    /**
+     * Compress a memory to level 3
+     */
+    compress(memory: Memory): Level3Output;
+    /**
+     * Compress multiple memories to level 3
+     */
+    compressBatch(memories: Memory[]): Level3Output[];
+    /**
+     * Extract full context from memory
+     */
+    extractFullContext(memory: Memory): Level3Output['full'];
+    /**
+     * Estimate token count for level 3 output
+     */
+    estimateTokens(level2Tokens: number, fullContext: Level3Output['full']): number;
+    /**
+     * Get target token count for this level
+     */
+    getTargetTokens(): number;
+    /**
+     * Get maximum token count for this level
+     */
+    getMaxTokens(): number;
+    /**
+     * Format level 3 output as string
+     */
+    format(output: Level3Output): string;
+    private extractCompleteKnowledge;
+    private extractAllExamples;
+    private extractAllEvidence;
+    private extractRelatedMemories;
+    private extractCausalChain;
+    private toCodeSnippet;
+    private toEvidence;
+    private fieldToDescription;
+}
+//# sourceMappingURL=level-3.d.ts.map

package/dist/compression/compressor/level-3.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"level-3.d.ts","sourceRoot":"","sources":["../../../src/compression/compressor/level-3.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EACV,YAAY,EAGb,MAAM,kCAAkC,CAAC;AAC1C,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAGpD;;;;;;;;;;;GAWG;AACH,qBAAa,gBAAgB;IAC3B,0CAA0C;IAC1C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAO;IACrC,iCAAiC;IACjC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAQ;IAEnC,OAAO,CAAC,gBAAgB,CAAmB;;IAM3C;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY;IAWtC;;OAEG;IACH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,YAAY,EAAE;IAIjD;;OAEG;IACH,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IAmCxD;;OAEG;IACH,cAAc,CACZ,YAAY,EAAE,MAAM,EACpB,WAAW,EAAE,YAAY,CAAC,MAAM,CAAC,GAChC,MAAM;IA0CT;;OAEG;IACH,eAAe,IAAI,MAAM;IAIzB;;OAEG;IACH,YAAY,IAAI,MAAM;IAItB;;OAEG;IACH,MAAM,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM;IA+CpC,OAAO,CAAC,wBAAwB;IA8BhC,OAAO,CAAC,kBAAkB;IAiC1B,OAAO,CAAC,kBAAkB;IA+C1B,OAAO,CAAC,sBAAsB;IA2B9B,OAAO,CAAC,kBAAkB;IA0B1B,OAAO,CAAC,aAAa;IAkDrB,OAAO,CAAC,UAAU;IAiClB,OAAO,CAAC,kBAAkB;CAU3B"}