codehere 0.2.0 → 0.4.0

package/dist/infrastructure/context/context-compressor.d.ts

@@ -0,0 +1,94 @@
+/**
+ * Infrastructure: Context Compression Service
+ *
+ * Prevents context bloat through intelligent compression techniques
+ * Research: Context bloat leads to escalating costs and degraded reliability
+ *
+ * Techniques:
+ * 1. LLM Summarization: Compress large contexts into concise summaries
+ * 2. Observation Masking: Remove redundant observations in ReAct loops
+ * 3. Hybrid Memory: Combine transient (session) and persistent (long-term) memory
+ * 4. Selective Context: Keep only most relevant chunks based on attention scores
+ */
+import type { IAIService } from '../../domain/interfaces/ai-service.interface.js';
+import type { CodeChunk } from '../../domain/entities/code-chunk.js';
+import type { Memory } from '../../domain/entities/memory.js';
+export interface CompressionStrategy {
+    maxTokens: number;
+    preserveCode: boolean;
+    preserveErrors: boolean;
+    compressMemories: boolean;
+    compressObservations: boolean;
+}
+export interface CompressedContext {
+    chunks: CodeChunk[];
+    memories: Memory[];
+    summary?: string;
+    originalTokenCount: number;
+    compressedTokenCount: number;
+    reductionPercent: number;
+    strategy: CompressionStrategy;
+}
+export interface ObservationMask {
+    toolCalls: boolean;
+    observations: boolean;
+    errors: boolean;
+    thoughts: boolean;
+    maxHistoryLength: number;
+}
+/**
+ * Context Compressor Service
+ * Implements multiple compression techniques to prevent context bloat
+ */
+export declare class ContextCompressor {
+    private aiService;
+    constructor(aiService: IAIService);
+    /**
+     * Compress context using multi-stage compression (selective + summarization)
+     * OPTIMIZED: Multi-stage approach achieves 50%+ reduction
+     */
+    compressWithSummarization(chunks: CodeChunk[], query: string, strategy: CompressionStrategy): Promise<CompressedContext>;
+    /**
+     * Mask observations in ReAct loops
+     * Remove redundant observations while preserving critical information
+     */
+    maskObservations(observations: string[], toolCalls: string[], errors: string[], mask: ObservationMask): {
+        maskedObservations: string[];
+        maskedToolCalls: string[];
+        maskedErrors: string[];
+    };
+    /**
+     * Compress memories by summarizing similar memories
+     */
+    compressMemories(memories: Memory[], query: string, maxMemories?: number): Promise<Memory[]>;
+    /**
+     * Hybrid memory compression: Combine transient and persistent
+     */
+    createHybridContext(transientMemories: Memory[], // Recent session memories
+    persistentMemories: Memory[], // Long-term memories
+    query: string): Memory[];
+    /**
+     * Selective context compression: Keep only most relevant chunks
+     */
+    selectiveCompression(chunks: CodeChunk[], query: string, maxChunks: number, attentionScores?: Map<string, number>): CodeChunk[];
+    /**
+     * Preprocess code: remove comments, excessive whitespace, etc.
+     * Achieves ~15-20% reduction without LLM calls
+     */
+    private preprocessCode;
+    private summarizeFileContext;
+    /**
+     * Aggressive summarization: Target 50%+ reduction
+     */
+    private summarizeFileContextAggressive;
+    private summarizeFileContent;
+    /**
+     * Aggressive summarization: Target 50%+ reduction
+     */
+    private summarizeFileContentAggressive;
+    private groupChunksByFile;
+    private groupSimilarMemories;
+    private calculateRelevance;
+    private estimateTokens;
+}
+//# sourceMappingURL=context-compressor.d.ts.map

package/dist/infrastructure/context/context-compressor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"context-compressor.d.ts","sourceRoot":"","sources":["../../../src/infrastructure/context/context-compressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iDAAiD,CAAC;AAClF,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qCAAqC,CAAC;AACrE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,iCAAiC,CAAC;AAE9D,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,OAAO,CAAC;IACtB,cAAc,EAAE,OAAO,CAAC;IACxB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,oBAAoB,EAAE,OAAO,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,mBAAmB,CAAC;CAC/B;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,OAAO,CAAC;IACnB,YAAY,EAAE,OAAO,CAAC;IACtB,MAAM,EAAE,OAAO,CAAC;IAChB,QAAQ,EAAE,OAAO,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED;;;GAGG;AACH,qBAAa,iBAAiB;IAChB,OAAO,CAAC,SAAS;gBAAT,SAAS,EAAE,UAAU;IAEzC;;;OAGG;IACG,yBAAyB,CAC7B,MAAM,EAAE,SAAS,EAAE,EACnB,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,mBAAmB,GAC5B,OAAO,CAAC,iBAAiB,CAAC;IA+F7B;;;OAGG;IACH,gBAAgB,CACd,YAAY,EAAE,MAAM,EAAE,EACtB,SAAS,EAAE,MAAM,EAAE,EACnB,MAAM,EAAE,MAAM,EAAE,EAChB,IAAI,EAAE,eAAe,GACpB;QACD,kBAAkB,EAAE,MAAM,EAAE,CAAC;QAC7B,eAAe,EAAE,MAAM,EAAE,CAAC;QAC1B,YAAY,EAAE,MAAM,EAAE,CAAC;KACxB;IAyBD;;OAEG;IACG,gBAAgB,CACpB,QAAQ,EAAE,MAAM,EAAE,EAClB,KAAK,EAAE,MAAM,EACb,WAAW,GAAE,MAAW,GACvB,OAAO,CAAC,MAAM,EAAE,CAAC;IA8BpB;;OAEG;IACH,mBAAmB,CACjB,iBAAiB,EAAE,MAAM,EAAE,EAAE,0BAA0B;IACvD,kBAAkB,EAAE,MAAM,EAAE,EAAE,qBAAqB;IACnD,KAAK,EAAE,MAAM,GACZ,MAAM,EAAE;IAkBX;;OAEG;IACH,oBAAoB,CAClB,MAAM,EAAE,SAAS,EAAE,EACnB,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,MAAM,EACjB,eAAe,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GACpC,SAAS,EAAE;IAiBd;;;OAGG;IACH,OAAO,CAAC,cAAc;YAuBR,oBAAoB;IAmBlC;;OAEG;YACW,8BAA8B;YA0B9B,oBAAoB;IAiBlC;;OAEG;YACW,8BAA8B;IAiB5C,OAAO,CAAC,iBAAiB;IAazB,OAAO,CAAC,oBAAoB;IA+B5B,OAAO,CAAC,kBAAkB;IAW1B,OAAO,CAAC,cAAc;CASvB"}

package/dist/infrastructure/context/context-compressor.js

@@ -0,0 +1,329 @@
+/**
+ * Infrastructure: Context Compression Service
+ *
+ * Prevents context bloat through intelligent compression techniques
+ * Research: Context bloat leads to escalating costs and degraded reliability
+ *
+ * Techniques:
+ * 1. LLM Summarization: Compress large contexts into concise summaries
+ * 2. Observation Masking: Remove redundant observations in ReAct loops
+ * 3. Hybrid Memory: Combine transient (session) and persistent (long-term) memory
+ * 4. Selective Context: Keep only most relevant chunks based on attention scores
+ */
+/**
+ * Context Compressor Service
+ * Implements multiple compression techniques to prevent context bloat
+ */
+export class ContextCompressor {
+    aiService;
+    constructor(aiService) {
+        this.aiService = aiService;
+    }
+    /**
+     * Compress context using multi-stage compression (selective + summarization)
+     * OPTIMIZED: Multi-stage approach achieves 50%+ reduction
+     */
+    async compressWithSummarization(chunks, query, strategy) {
+        const originalTokenCount = this.estimateTokens(chunks);
+        if (originalTokenCount <= strategy.maxTokens) {
+            // No compression needed
+            return {
+                chunks,
+                memories: [],
+                originalTokenCount,
+                compressedTokenCount: originalTokenCount,
+                reductionPercent: 0,
+                strategy,
+            };
+        }
+        // STAGE 1: Selective compression - keep only most relevant chunks
+        // Target: Reduce to 70% of original (30% reduction)
+        const targetAfterSelective = Math.floor(originalTokenCount * 0.7);
+        const maxChunksAfterSelective = Math.ceil((chunks.length * targetAfterSelective) / originalTokenCount);
+        const selectiveChunks = this.selectiveCompression(chunks, query, maxChunksAfterSelective);
+        const selectiveTokenCount = this.estimateTokens(selectiveChunks);
+        // If selective compression is enough, return early
+        if (selectiveTokenCount <= strategy.maxTokens) {
+            const reductionPercent = ((originalTokenCount - selectiveTokenCount) / originalTokenCount) * 100;
+            return {
+                chunks: selectiveChunks,
+                memories: [],
+                summary: `Selective compression: ${chunks.length} → ${selectiveChunks.length} chunks`,
+                originalTokenCount,
+                compressedTokenCount: selectiveTokenCount,
+                reductionPercent,
+                strategy,
+            };
+        }
+        // STAGE 2: Code-aware preprocessing - remove comments, whitespace, etc.
+        const preprocessedChunks = this.preprocessCode(selectiveChunks);
+        const preprocessedTokenCount = this.estimateTokens(preprocessedChunks);
+        // If preprocessing is enough, return
+        if (preprocessedTokenCount <= strategy.maxTokens) {
+            const reductionPercent = ((originalTokenCount - preprocessedTokenCount) / originalTokenCount) * 100;
+            return {
+                chunks: preprocessedChunks,
+                memories: [],
+                summary: `Preprocessed: removed comments/whitespace`,
+                originalTokenCount,
+                compressedTokenCount: preprocessedTokenCount,
+                reductionPercent,
+                strategy,
+            };
+        }
+        // STAGE 3: LLM summarization - aggressive compression
+        // Group chunks by file for better summarization
+        const chunksByFile = this.groupChunksByFile(preprocessedChunks);
+        const compressedChunks = [];
+        for (const [filepath, fileChunks] of Object.entries(chunksByFile)) {
+            const fileContent = fileChunks.map(c => c.content).join('\n\n---\n\n');
+            if (strategy.preserveCode) {
+                // Aggressive compression: Keep only essential code, summarize rest
+                const summary = await this.summarizeFileContextAggressive(fileContent, query, filepath);
+                compressedChunks.push({
+                    filepath,
+                    content: summary.summarized,
+                    score: fileChunks[0]?.score || 0.5,
+                });
+            }
+            else {
+                // Full summarization with aggressive target
+                const summary = await this.summarizeFileContentAggressive(fileContent, query, filepath);
+                compressedChunks.push({
+                    filepath,
+                    content: summary,
+                    score: fileChunks[0]?.score || 0.5,
+                });
+            }
+        }
+        const compressedTokenCount = this.estimateTokens(compressedChunks);
+        const reductionPercent = ((originalTokenCount - compressedTokenCount) / originalTokenCount) * 100;
+        return {
+            chunks: compressedChunks,
+            memories: [],
+            summary: `Multi-stage compression: ${chunks.length} chunks, ${originalTokenCount} → ${compressedTokenCount} tokens (${reductionPercent.toFixed(1)}% reduction)`,
+            originalTokenCount,
+            compressedTokenCount,
+            reductionPercent,
+            strategy,
+        };
+    }
+    /**
+     * Mask observations in ReAct loops
+     * Remove redundant observations while preserving critical information
+     */
+    maskObservations(observations, toolCalls, errors, mask) {
+        let maskedObservations = [];
+        let maskedToolCalls = [];
+        let maskedErrors = [];
+        // Keep only recent observations if masking enabled
+        if (mask.observations) {
+            maskedObservations = observations.slice(-mask.maxHistoryLength);
+        }
+        else {
+            maskedObservations = observations;
+        }
+        // Always keep tool calls (they're compact)
+        maskedToolCalls = mask.toolCalls ? toolCalls.slice(-mask.maxHistoryLength) : toolCalls;
+        // Always keep errors (critical information)
+        maskedErrors = mask.errors ? errors : errors;
+        return {
+            maskedObservations,
+            maskedToolCalls,
+            maskedErrors,
+        };
+    }
+    /**
+     * Compress memories by summarizing similar memories
+     */
+    async compressMemories(memories, query, maxMemories = 10) {
+        if (memories.length <= maxMemories) {
+            return memories;
+        }
+        // Group similar memories
+        const grouped = this.groupSimilarMemories(memories);
+        // Keep most relevant from each group
+        const compressed = [];
+        for (const group of grouped) {
+            // Sort by relevance to query
+            const relevant = group.sort((a, b) => {
+                const aRelevance = this.calculateRelevance(a.description, query);
+                const bRelevance = this.calculateRelevance(b.description, query);
+                return bRelevance - aRelevance;
+            });
+            // Keep top 1-2 from each group
+            compressed.push(...relevant.slice(0, Math.min(2, group.length)));
+            if (compressed.length >= maxMemories) {
+                break;
+            }
+        }
+        return compressed.slice(0, maxMemories);
+    }
+    /**
+     * Hybrid memory compression: Combine transient and persistent
+     */
+    createHybridContext(transientMemories, // Recent session memories
+    persistentMemories, // Long-term memories
+    query) {
+        // Prioritize transient (more relevant to current session)
+        const hybrid = [...transientMemories];
+        // Add persistent only if they add new information
+        for (const persistent of persistentMemories) {
+            const isDuplicate = hybrid.some(t => this.calculateRelevance(t.description, persistent.description) > 0.8);
+            if (!isDuplicate && this.calculateRelevance(persistent.description, query) > 0.5) {
+                hybrid.push(persistent);
+            }
+        }
+        return hybrid.slice(0, 20); // Limit total hybrid memories
+    }
+    /**
+     * Selective context compression: Keep only most relevant chunks
+     */
+    selectiveCompression(chunks, query, maxChunks, attentionScores // Optional attention scores from visualizer
+    ) {
+        // Score chunks by relevance
+        const scored = chunks.map(chunk => ({
+            chunk,
+            score: attentionScores?.get(chunk.filepath) ||
+                this.calculateRelevance(chunk.content, query),
+        }));
+        // Sort by score and keep top N
+        return scored
+            .sort((a, b) => b.score - a.score)
+            .slice(0, maxChunks)
+            .map(s => s.chunk);
+    }
+    // Private helper methods
+    /**
+     * Preprocess code: remove comments, excessive whitespace, etc.
+     * Achieves ~15-20% reduction without LLM calls
+     */
+    preprocessCode(chunks) {
+        return chunks.map(chunk => {
+            let content = chunk.content;
+            // Remove single-line comments (// ...)
+            content = content.replace(/\/\/.*$/gm, '');
+            // Remove multi-line comments (/* ... */)
+            content = content.replace(/\/\*[\s\S]*?\*\//g, '');
+            // Remove excessive blank lines (more than 2 consecutive)
+            content = content.replace(/\n{3,}/g, '\n\n');
+            // Remove trailing whitespace
+            content = content.split('\n').map(line => line.trimEnd()).join('\n');
+            return {
+                ...chunk,
+                content: content.trim(),
+            };
+        });
+    }
+    async summarizeFileContext(content, query, filepath) {
+        const prompt = `Summarize the context and comments in this code file, but keep the actual code intact.
+    
+File: ${filepath}
+Query: ${query}
+
+Code:
+${content}
+
+Return a summary that preserves code structure but compresses comments and context.`;
+        const summary = await this.aiService.chat(prompt, []);
+        return { summarized: summary || content };
+    }
+    /**
+     * Aggressive summarization: Target 50%+ reduction
+     */
+    async summarizeFileContextAggressive(content, query, filepath) {
+        const prompt = `Compress this code file aggressively while preserving functionality relevant to: ${query}
+
+File: ${filepath}
+Query: ${query}
+
+Code:
+${content}
+
+Instructions:
+- Remove all comments and docstrings
+- Keep only code directly relevant to the query
+- Summarize helper functions in 1-2 lines
+- Preserve function signatures and critical logic
+- Target: 50%+ token reduction
+
+Return compressed code:`;
+        const summary = await this.aiService.chat(prompt, []);
+        return { summarized: summary || content };
+    }
+    async summarizeFileContent(content, query, filepath) {
+        const prompt = `Provide a concise summary of this code file, focusing on how it relates to: ${query}
+    
+File: ${filepath}
+Code:
+${content}
+
+Return a brief summary (2-3 sentences) of the key functionality.`;
+        const summary = await this.aiService.chat(prompt, []);
+        return summary || content;
+    }
+    /**
+     * Aggressive summarization: Target 50%+ reduction
+     */
+    async summarizeFileContentAggressive(content, query, filepath) {
+        const prompt = `Provide an extremely concise summary (1-2 sentences) of this code file, focusing ONLY on: ${query}
+
+File: ${filepath}
+Code:
+${content}
+
+Return ONLY the essential functionality relevant to the query. Be extremely brief.`;
+        const summary = await this.aiService.chat(prompt, []);
+        return summary || content;
+    }
+    groupChunksByFile(chunks) {
+        const grouped = {};
+        for (const chunk of chunks) {
+            if (!grouped[chunk.filepath]) {
+                grouped[chunk.filepath] = [];
+            }
+            grouped[chunk.filepath].push(chunk);
+        }
+        return grouped;
+    }
+    groupSimilarMemories(memories) {
+        const groups = [];
+        const processed = new Set();
+        for (let i = 0; i < memories.length; i++) {
+            if (processed.has(i))
+                continue;
+            const group = [memories[i]];
+            processed.add(i);
+            // Find similar memories
+            for (let j = i + 1; j < memories.length; j++) {
+                if (processed.has(j))
+                    continue;
+                const similarity = this.calculateRelevance(memories[i].description, memories[j].description);
+                if (similarity > 0.7) {
+                    group.push(memories[j]);
+                    processed.add(j);
+                }
+            }
+            groups.push(group);
+        }
+        return groups;
+    }
+    calculateRelevance(text1, text2) {
+        // Simple word overlap similarity (could be enhanced with embeddings)
+        const words1 = new Set(text1.toLowerCase().split(/\s+/));
+        const words2 = new Set(text2.toLowerCase().split(/\s+/));
+        const intersection = new Set([...words1].filter(w => words2.has(w)));
+        const union = new Set([...words1, ...words2]);
+        return union.size > 0 ? intersection.size / union.size : 0;
+    }
+    estimateTokens(chunks) {
+        // Improved estimation: Code has more tokens per character than prose
+        // Average: ~3.5 characters per token for code, ~4 for prose
+        return chunks.reduce((sum, chunk) => {
+            const isCode = chunk.filepath.match(/\.(ts|js|py|java|cpp|go|rs)$/);
+            const charsPerToken = isCode ? 3.5 : 4;
+            return sum + Math.ceil(chunk.content.length / charsPerToken);
+        }, 0);
+    }
+}
+//# sourceMappingURL=context-compressor.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"context-compressor.js","sourceRoot":"","sources":["../../../src/infrastructure/context/context-compressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAgCH;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IACR;IAApB,YAAoB,SAAqB;QAArB,cAAS,GAAT,SAAS,CAAY;IAAG,CAAC;IAE7C;;;OAGG;IACH,KAAK,CAAC,yBAAyB,CAC7B,MAAmB,EACnB,KAAa,EACb,QAA6B;QAE7B,MAAM,kBAAkB,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAEvD,IAAI,kBAAkB,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;YAC7C,wBAAwB;YACxB,OAAO;gBACL,MAAM;gBACN,QAAQ,EAAE,EAAE;gBACZ,kBAAkB;gBAClB,oBAAoB,EAAE,kBAAkB;gBACxC,gBAAgB,EAAE,CAAC;gBACnB,QAAQ;aACT,CAAC;QACJ,CAAC;QAED,kEAAkE;QAClE,oDAAoD;QACpD,MAAM,oBAAoB,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,GAAG,GAAG,CAAC,CAAC;QAClE,MAAM,uBAAuB,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,oBAAoB,CAAC,GAAG,kBAAkB,CAAC,CAAC;QACvG,MAAM,eAAe,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE,KAAK,EAAE,uBAAuB,CAAC,CAAC;QAC1F,MAAM,mBAAmB,GAAG,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;QAEjE,mDAAmD;QACnD,IAAI,mBAAmB,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;YAC9C,MAAM,gBAAgB,GAAG,CAAC,CAAC,kBAAkB,GAAG,mBAAmB,CAAC,GAAG,kBAAkB,CAAC,GAAG,GAAG,CAAC;YACjG,OAAO;gBACL,MAAM,EAAE,eAAe;gBACvB,QAAQ,EAAE,EAAE;gBACZ,OAAO,EAAE,0BAA0B,MAAM,CAAC,MAAM,MAAM,eAAe,CAAC,MAAM,SAAS;gBACrF,kBAAkB;gBAClB,oBAAoB,EAAE,mBAAmB;gBACzC,gBAAgB;gBAChB,QAAQ;aACT,CAAC;QACJ,CAAC;QAED,wEAAwE;QACxE,MAAM,kBAAkB,GAAG,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;QAChE,MAAM,sBAAsB,GAAG,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,CAAC;QAEvE,qCAAqC;QACrC,IAAI,sBAAsB,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;YACjD,MAAM,gBAAgB,GAAG,CAAC,CAAC,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,kBAAkB,CAAC,GAAG,GAAG,CAAC;YACpG,OAAO;gBACL,MAAM,EAAE,kBAAkB;gBAC1B,QAAQ,EAAE,EAAE;gBACZ,OAAO,EAAE,2CAA2C;gBACpD,kBAAkB;gBAClB,oBAAoB,EAAE,sBAAsB;gBAC5C,gBAAgB;gBAChB,QAAQ;aACT,CAAC;QACJ,CAAC;QAED,sDAAsD;QACtD,gDAAgD;QAChD,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;QAChE,MAAM,gBAAgB,GAAgB,EAAE,CAAC;QAEzC,KAAK,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;YAClE,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAEvE,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;gBAC1B,mEAAmE;gBACnE,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,8BAA8B,CAAC,WAAW,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;gBACxF,gBAAgB,CAAC,IAAI,CAAC;oBACpB,QAAQ;oBACR,OAAO,EAAE,OAAO,CAAC,UAAU;oBAC3B,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,GAAG;iBACnC,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,8BAA8B,CAAC,WAAW,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;gBACxF,gBAAgB,CAAC,IAAI,CAAC;oBACpB,QAAQ;oBACR,OAAO,EAAE,OAAO;oBAChB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,GAAG;iBACnC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,oBAAoB,GAAG,IAAI,CAAC,cAAc,CAAC,gBAAgB,CAAC,CAAC;QACnE,MAAM,gBAAgB,GAAG,CAAC,CAAC,kBAAkB,GAAG,oBAAoB,CAAC,GAAG,kBAAkB,CAAC,GAAG,GAAG,CAAC;QAElG,OAAO;YACL,MAAM,EAAE,gBAAgB;YACxB,QAAQ,EAAE,EAAE;YACZ,OAAO,EAAE,4BAA4B,MAAM,CAAC,MAAM,YAAY,kBAAkB,MAAM,oBAAoB,YAAY,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc;YAC/J,kBAAkB;YAClB,oBAAoB;YACpB,gBAAgB;YAChB,QAAQ;SACT,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,gBAAgB,CACd,YAAsB,EACtB,SAAmB,EACnB,MAAgB,EAChB,IAAqB;QAMrB,IAAI,kBAAkB,GAAa,EAAE,CAAC;QACtC,IAAI,eAAe,GAAa,EAAE,CAAC;QACnC,IAAI,YAAY,GAAa,EAAE,CAAC;QAEhC,mDAAmD;QACnD,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,kBAAkB,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACN,kBAAkB,GAAG,YAAY,CAAC;QACpC,CAAC;QAED,2CAA2C;QAC3C,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEvF,4CAA4C;QAC5C,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAE7C,OAAO;YACL,kBAAkB;YAClB,eAAe;YACf,YAAY;SACb,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CACpB,QAAkB,EAClB,KAAa,EACb,cAAsB,EAAE;QAExB,IAAI,QAAQ,CAAC,MAAM,IAAI,WAAW,EAAE,CAAC;YACnC,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,yBAAyB;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAEpD,qCAAqC;QACrC,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,6BAA6B;YAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACnC,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;gBACjE,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;gBACjE,OAAO,UAAU,GAAG,UAAU,CAAC;YACjC,CAAC,CAAC,CAAC;YAEH,+BAA+B;YAC/B,UAAU,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEjE,IAAI,UAAU,CAAC,MAAM,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,mBAAmB,CACjB,iBAA2B,EAAE,0BAA0B;IACvD,kBAA4B,EAAE,qBAAqB;IACnD,KAAa;QAEb,0DAA0D;QAC1D,MAAM,MAAM,GAAa,CAAC,GAAG,iBAAiB,CAAC,CAAC;QAEhD,kDAAkD;QAClD,KAAK,MAAM,UAAU,IAAI,kBAAkB,EAAE,CAAC;YAC5C,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAClC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,WAAW,EAAE,UAAU,CAAC,WAAW,CAAC,GAAG,GAAG,CACrE,CAAC;YAEF,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,WAAW,EAAE,KAAK,CAAC,GAAG,GAAG,EAAE,CAAC;gBACjF,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,8BAA8B;IAC5D,CAAC;IAED;;OAEG;IACH,oBAAoB,CAClB,MAAmB,EACnB,KAAa,EACb,SAAiB,EACjB,eAAqC,CAAC,4CAA4C;;QAElF,4BAA4B;QAC5B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAClC,KAAK;YACL,KAAK,EAAE,eAAe,EAAE,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC;gBACpC,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC;SACrD,CAAC,CAAC,CAAC;QAEJ,+BAA+B;QAC/B,OAAO,MAAM;aACV,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC;aACnB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAED,yBAAyB;IAEzB;;;OAGG;IACK,cAAc,CAAC,MAAmB;QACxC,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACxB,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;YAE5B,uCAAuC;YACvC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;YAE3C,yCAAyC;YACzC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;YAEnD,yDAAyD;YACzD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAE7C,6BAA6B;YAC7B,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAErE,OAAO;gBACL,GAAG,KAAK;gBACR,OAAO,EAAE,OAAO,CAAC,IAAI,EAAE;aACxB,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,KAAK,CAAC,oBAAoB,CAChC,OAAe,EACf,KAAa,EACb,QAAgB;QAEhB,MAAM,MAAM,GAAG;;QAEX,QAAQ;SACP,KAAK;;;EAGZ,OAAO;;oFAE2E,CAAC;QAEjF,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACtD,OAAO,EAAE,UAAU,EAAE,OAAO,IAAI,OAAO,EAAE,CAAC;IAC5C,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,8BAA8B,CAC1C,OAAe,EACf,KAAa,EACb,QAAgB;QAEhB,MAAM,MAAM,GAAG,oFAAoF,KAAK;;QAEpG,QAAQ;SACP,KAAK;;;EAGZ,OAAO;;;;;;;;;wBASe,CAAC;QAErB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACtD,OAAO,EAAE,UAAU,EAAE,OAAO,IAAI,OAAO,EAAE,CAAC;IAC5C,CAAC;IAEO,KAAK,CAAC,oBAAoB,CAChC,OAAe,EACf,KAAa,EACb,QAAgB;QAEhB,MAAM,MAAM,GAAG,+EAA+E,KAAK;;QAE/F,QAAQ;;EAEd,OAAO;;iEAEwD,CAAC;QAE9D,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACtD,OAAO,OAAO,IAAI,OAAO,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,8BAA8B,CAC1C,OAAe,EACf,KAAa,EACb,QAAgB;QAEhB,MAAM,MAAM,GAAG,6FAA6F,KAAK;;QAE7G,QAAQ;;EAEd,OAAO;;mFAE0E,CAAC;QAEhF,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACtD,OAAO,OAAO,IAAI,OAAO,CAAC;IAC5B,CAAC;IAEO,iBAAiB,CAAC,MAAmB;QAC3C,MAAM,OAAO,GAAgC,EAAE,CAAC;QAEhD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC7B,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;YAC/B,CAAC;YACD,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,oBAAoB,CAAC,QAAkB;QAC7C,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAE/B,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAEjB,wBAAwB;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAE/B,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CACxC,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,EACvB,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,CACxB,CAAC;gBAEF,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;oBACrB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,kBAAkB,CAAC,KAAa,EAAE,KAAa;QACrD,qEAAqE;QACrE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAEzD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QAE9C,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEO,cAAc,CAAC,MAAmB;QACxC,qEAAqE;QACrE,4DAA4D;QAC5D,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YAClC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;YACpE,MAAM,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACvC,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;QAC/D,CAAC,EAAE,CAAC,CAAC,CAAC;IACR,CAAC;CACF"}

package/dist/infrastructure/context/conversation-context.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Conversation Context Manager
+ * Maintains conversation history and enables reference resolution
+ */
+export interface ConversationTurn {
+    query: string;
+    response: string;
+    timestamp: number;
+    entities?: string[];
+    intent?: string;
+}
+export interface ConversationContext {
+    sessionId: string;
+    turns: ConversationTurn[];
+    currentFocus?: {
+        entity?: string;
+        filepath?: string;
+        topic?: string;
+    };
+    createdAt: number;
+    lastUpdated: number;
+}
+export declare class ConversationContextManager {
+    private conversations;
+    private maxHistoryLength;
+    private maxTotalHistoryLength;
+    /**
+     * Get or create conversation context for a session
+     */
+    getContext(sessionId: string): ConversationContext;
+    /**
+     * Add a turn to conversation history
+     * EDGE CASE: Handles very long histories, concurrent sessions, and memory limits
+     */
+    addTurn(sessionId: string, query: string, response: string, entities?: string[], intent?: string): void;
+    /**
+     * Get conversation history for context
+     */
+    getHistory(sessionId: string, maxTurns?: number): ConversationTurn[];
+    /**
+     * Resolve references in query (e.g., "it", "that", "the previous")
+     */
+    resolveReferences(sessionId: string, query: string): string;
+    /**
+     * Extract entities from query (file names, functions, classes)
+     */
+    extractEntities(query: string): string[];
+    /**
+     * Get conversation context summary for AI prompts
+     */
+    getContextSummary(sessionId: string, maxTurns?: number): string;
+    /**
+     * Clear conversation context (for new session)
+     */
+    clearContext(sessionId: string): void;
+}
+export declare const conversationContextManager: ConversationContextManager;
+//# sourceMappingURL=conversation-context.d.ts.map

package/dist/infrastructure/context/conversation-context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conversation-context.d.ts","sourceRoot":"","sources":["../../../src/infrastructure/context/conversation-context.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,gBAAgB,EAAE,CAAC;IAC1B,YAAY,CAAC,EAAE;QACb,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,CAAC;IACF,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,qBAAa,0BAA0B;IACrC,OAAO,CAAC,aAAa,CAA+C;IACpE,OAAO,CAAC,gBAAgB,CAAM;IAC9B,OAAO,CAAC,qBAAqB,CAAM;IAEnC;;OAEG;IACH,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,mBAAmB;IAYlD;;;OAGG;IACH,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI;IA2CvG;;OAEG;IACH,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,gBAAgB,EAAE;IAKvE;;OAEG;IACH,iBAAiB,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAyD3D;;OAEG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE;IA2BxC;;OAEG;IACH,iBAAiB,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,MAAM;IAelE;;OAEG;IACH,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;CAGtC;AAGD,eAAO,MAAM,0BAA0B,4BAAmC,CAAC"}