agentic-flow 2.0.7 → 3.0.0-alpha.2

package/dist/packages/agentdb/src/controllers/ContextSynthesizer.js

@@ -0,0 +1,208 @@
+/**
+ * Context Synthesis - Generate coherent narratives from multiple memories
+ *
+ * Takes a collection of retrieved episodes/patterns and synthesizes
+ * a coherent context summary with extracted patterns, success rates,
+ * and actionable insights.
+ */
+export class ContextSynthesizer {
+    /**
+     * Synthesize context from multiple memories
+     *
+     * @param memories - Retrieved episodes/patterns
+     * @param options - Synthesis options
+     * @returns Synthesized context with insights
+     */
+    static synthesize(memories, options = {}) {
+        const minPatternFrequency = options.minPatternFrequency ?? 2;
+        const includeRecommendations = options.includeRecommendations ?? true;
+        if (memories.length === 0) {
+            return {
+                summary: 'No relevant memories found.',
+                patterns: [],
+                successRate: 0,
+                averageReward: 0,
+                recommendations: [],
+                keyInsights: [],
+                totalMemories: 0,
+            };
+        }
+        // Calculate statistics
+        const successCount = memories.filter(m => m.success).length;
+        const successRate = successCount / memories.length;
+        const averageReward = memories.reduce((sum, m) => sum + (m.reward || 0), 0) / memories.length;
+        // Extract common patterns from critiques
+        const patterns = this.extractPatterns(memories, minPatternFrequency);
+        // Generate key insights
+        const keyInsights = this.generateKeyInsights(memories, successRate, averageReward);
+        // Generate recommendations
+        const recommendations = includeRecommendations
+            ? this.generateRecommendations(memories, patterns, successRate)
+            : [];
+        // Generate summary narrative
+        const summary = this.generateSummary(memories, patterns, successRate, averageReward);
+        return {
+            summary,
+            patterns,
+            successRate,
+            averageReward,
+            recommendations,
+            keyInsights,
+            totalMemories: memories.length,
+        };
+    }
+    /**
+     * Extract common patterns from memory critiques
+     */
+    static extractPatterns(memories, minFrequency) {
+        const phraseCount = new Map();
+        // Extract meaningful phrases from critiques
+        for (const memory of memories) {
+            if (memory.critique) {
+                const phrases = this.extractPhrases(memory.critique);
+                for (const phrase of phrases) {
+                    phraseCount.set(phrase, (phraseCount.get(phrase) || 0) + 1);
+                }
+            }
+        }
+        // Filter by minimum frequency
+        const patterns = [];
+        for (const [phrase, count] of phraseCount.entries()) {
+            if (count >= minFrequency) {
+                patterns.push(`${phrase} (${count}/${memories.length} times)`);
+            }
+        }
+        return patterns.slice(0, 10); // Top 10 patterns
+    }
+    /**
+     * Extract meaningful phrases from text
+     */
+    static extractPhrases(text) {
+        // Simple phrase extraction (can be enhanced with NLP)
+        const sentences = text.split(/[.!?]/).filter(s => s.trim().length > 0);
+        const phrases = [];
+        for (const sentence of sentences) {
+            const trimmed = sentence.trim();
+            // Extract phrases with key action words
+            if (trimmed.match(/\b(use|implement|fix|improve|add|create|design|test)\b/i) &&
+                trimmed.length > 10 &&
+                trimmed.length < 100) {
+                phrases.push(trimmed.toLowerCase());
+            }
+        }
+        return phrases;
+    }
+    /**
+     * Generate key insights from memories
+     */
+    static generateKeyInsights(memories, successRate, averageReward) {
+        const insights = [];
+        // Success rate insight
+        if (successRate >= 0.8) {
+            insights.push(`High success rate (${(successRate * 100).toFixed(0)}%) indicates strong pattern match`);
+        }
+        else if (successRate < 0.5) {
+            insights.push(`Low success rate (${(successRate * 100).toFixed(0)}%) suggests exploring alternative approaches`);
+        }
+        // Reward insight
+        if (averageReward >= 0.8) {
+            insights.push(`High average reward (${averageReward.toFixed(2)}) shows effective past solutions`);
+        }
+        else if (averageReward < 0.6) {
+            insights.push(`Moderate reward (${averageReward.toFixed(2)}) indicates room for improvement`);
+        }
+        // Identify high-performing memories
+        const topMemories = memories
+            .filter(m => m.success && (m.reward || 0) >= 0.9)
+            .slice(0, 3);
+        if (topMemories.length > 0) {
+            insights.push(`${topMemories.length} exemplary solution(s) found with reward ≥0.9`);
+        }
+        // Task diversity
+        const uniqueTasks = new Set(memories.map(m => m.task)).size;
+        if (uniqueTasks > 1) {
+            insights.push(`${uniqueTasks} different task types provide diverse perspectives`);
+        }
+        return insights;
+    }
+    /**
+     * Generate actionable recommendations
+     */
+    static generateRecommendations(memories, patterns, successRate) {
+        const recommendations = [];
+        // Extract successful strategies
+        const successfulMemories = memories.filter(m => m.success && (m.reward || 0) >= 0.8);
+        if (successfulMemories.length > 0) {
+            recommendations.push('Apply strategies from high-reward solutions');
+        }
+        // Pattern-based recommendations
+        if (patterns.length > 0) {
+            recommendations.push(`Follow common patterns: ${patterns[0].split(' (')[0]}`);
+        }
+        // Success rate recommendations
+        if (successRate >= 0.7) {
+            recommendations.push('Previous approaches were effective - follow similar methodology');
+        }
+        else {
+            recommendations.push('Consider alternative approaches given mixed past results');
+        }
+        // Add general recommendations
+        if (memories.length >= 5) {
+            recommendations.push('Sufficient historical data available for confident decision-making');
+        }
+        else {
+            recommendations.push('Limited data - proceed with caution and validate assumptions');
+        }
+        return recommendations.slice(0, 5);
+    }
+    /**
+     * Generate narrative summary
+     */
+    static generateSummary(memories, patterns, successRate, averageReward) {
+        const parts = [];
+        // Opening
+        parts.push(`Based on ${memories.length} similar past ${memories.length === 1 ? 'experience' : 'experiences'}`);
+        // Success rate
+        const successPercent = (successRate * 100).toFixed(0);
+        if (successRate >= 0.7) {
+            parts.push(`with a high success rate of ${successPercent}%`);
+        }
+        else {
+            parts.push(`with a ${successPercent}% success rate`);
+        }
+        // Average reward
+        parts.push(`and average reward of ${averageReward.toFixed(2)}`);
+        // Key patterns
+        if (patterns.length > 0) {
+            parts.push('. Common effective approaches include:');
+            const topPatterns = patterns.slice(0, 3).map(p => p.split(' (')[0]);
+            parts.push(topPatterns.map((p, i) => `${i + 1}) ${p}`).join(', '));
+        }
+        // High performers
+        const topMemories = memories.filter(m => m.success && (m.reward || 0) >= 0.9);
+        if (topMemories.length > 0) {
+            parts.push(`. ${topMemories.length} exemplary solution(s) achieved reward ≥0.9`);
+        }
+        parts.push('.');
+        return parts.join(' ');
+    }
+    /**
+     * Extract actionable steps from successful memories
+     */
+    static extractActionableSteps(memories) {
+        const steps = [];
+        const successfulMemories = memories.filter(m => m.success && (m.reward || 0) >= 0.8);
+        for (const memory of successfulMemories) {
+            if (memory.critique) {
+                // Extract step-like phrases
+                const matches = memory.critique.match(/\b\d+\.\s+([^.!?]+)/g);
+                if (matches) {
+                    steps.push(...matches.map(m => m.trim()));
+                }
+            }
+        }
+        // Remove duplicates and return top 5
+        return Array.from(new Set(steps)).slice(0, 5);
+    }
+}
+//# sourceMappingURL=ContextSynthesizer.js.map

package/dist/packages/agentdb/src/controllers/ContextSynthesizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ContextSynthesizer.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/ContextSynthesizer.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAuBH,MAAM,OAAO,kBAAkB;IAC7B;;;;;;OAMG;IACH,MAAM,CAAC,UAAU,CACf,QAAyB,EACzB,UAII,EAAE;QAEN,MAAM,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAC;QAC7D,MAAM,sBAAsB,GAAG,OAAO,CAAC,sBAAsB,IAAI,IAAI,CAAC;QAEtE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO;gBACL,OAAO,EAAE,6BAA6B;gBACtC,QAAQ,EAAE,EAAE;gBACZ,WAAW,EAAE,CAAC;gBACd,aAAa,EAAE,CAAC;gBAChB,eAAe,EAAE,EAAE;gBACnB,WAAW,EAAE,EAAE;gBACf,aAAa,EAAE,CAAC;aACjB,CAAC;QACJ,CAAC;QAED,uBAAuB;QACvB,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QAC5D,MAAM,WAAW,GAAG,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC;QACnD,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QAE9F,yCAAyC;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,mBAAmB,CAAC,CAAC;QAErE,wBAAwB;QACxB,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;QAEnF,2BAA2B;QAC3B,MAAM,eAAe,GAAG,sBAAsB;YAC5C,CAAC,CAAC,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,QAAQ,EAAE,WAAW,CAAC;YAC/D,CAAC,CAAC,EAAE,CAAC;QAEP,6BAA6B;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;QAErF,OAAO;YACL,OAAO;YACP,QAAQ;YACR,WAAW;YACX,aAAa;YACb,eAAe;YACf,WAAW;YACX,aAAa,EAAE,QAAQ,CAAC,MAAM;SAC/B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,eAAe,CAAC,QAAyB,EAAE,YAAoB;QAC5E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE9C,4CAA4C;QAC5C,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpB,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBACrD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9D,CAAC;YACH,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,KAAK,IAAI,YAAY,EAAE,CAAC;gBAC1B,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,KAAK,KAAK,IAAI,QAAQ,CAAC,MAAM,SAAS,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAE,kBAAkB;IACnD,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,cAAc,CAAC,IAAY;QACxC,sDAAsD;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvE,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;YAChC,wCAAwC;YACxC,IACE,OAAO,CAAC,KAAK,CAAC,yDAAyD,CAAC;gBACxE,OAAO,CAAC,MAAM,GAAG,EAAE;gBACnB,OAAO,CAAC,MAAM,GAAG,GAAG,EACpB,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,mBAAmB,CAChC,QAAyB,EACzB,WAAmB,EACnB,aAAqB;QAErB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,uBAAuB;QACvB,IAAI,WAAW,IAAI,GAAG,EAAE,CAAC;YACvB,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,mCAAmC,CAAC,CAAC;QACzG,CAAC;aAAM,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,qBAAqB,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,8CAA8C,CAAC,CAAC;QACnH,CAAC;QAED,iBAAiB;QACjB,IAAI,aAAa,IAAI,GAAG,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,wBAAwB,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,kCAAkC,CAAC,CAAC;QACpG,CAAC;aAAM,IAAI,aAAa,GAAG,GAAG,EAAE,CAAC;YAC/B,QAAQ,CAAC,IAAI,CAAC,oBAAoB,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,kCAAkC,CAAC,CAAC;QAChG,CAAC;QAED,oCAAoC;QACpC,MAAM,WAAW,GAAG,QAAQ;aACzB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;aAChD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEf,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,+CAA+C,CAAC,CAAC;QACtF,CAAC;QAED,iBAAiB;QACjB,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5D,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC,GAAG,WAAW,oDAAoD,CAAC,CAAC;QACpF,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,uBAAuB,CACpC,QAAyB,EACzB,QAAkB,EAClB,WAAmB;QAEnB,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,gCAAgC;QAChC,MAAM,kBAAkB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAErF,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClC,eAAe,CAAC,IAAI,CAAC,6CAA6C,CAAC,CAAC;QACtE,CAAC;QAED,gCAAgC;QAChC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,eAAe,CAAC,IAAI,CAAC,2BAA2B,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChF,CAAC;QAED,+BAA+B;QAC/B,IAAI,WAAW,IAAI,GAAG,EAAE,CAAC;YACvB,eAAe,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;QAC1F,CAAC;aAAM,CAAC;YACN,eAAe,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;QACnF,CAAC;QAED,8BAA8B;QAC9B,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACzB,eAAe,CAAC,IAAI,CAAC,oEAAoE,CAAC,CAAC;QAC7F,CAAC;aAAM,CAAC;YACN,eAAe,CAAC,IAAI,CAAC,8DAA8D,CAAC,CAAC;QACvF,CAAC;QAED,OAAO,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,eAAe,CAC5B,QAAyB,EACzB,QAAkB,EAClB,WAAmB,EACnB,aAAqB;QAErB,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,UAAU;QACV,KAAK,CAAC,IAAI,CAAC,YAAY,QAAQ,CAAC,MAAM,iBAAiB,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;QAE/G,eAAe;QACf,MAAM,cAAc,GAAG,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,WAAW,IAAI,GAAG,EAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,+BAA+B,cAAc,GAAG,CAAC,CAAC;QAC/D,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,UAAU,cAAc,gBAAgB,CAAC,CAAC;QACvD,CAAC;QAED,iBAAiB;QACjB,KAAK,CAAC,IAAI,CAAC,yBAAyB,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAEhE,eAAe;QACf,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,wCAAwC,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,kBAAkB;QAClB,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAC9E,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,WAAW,CAAC,MAAM,6CAA6C,CAAC,CAAC;QACnF,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEhB,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,sBAAsB,CAAC,QAAyB;QACrD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,kBAAkB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAErF,KAAK,MAAM,MAAM,IAAI,kBAAkB,EAAE,CAAC;YACxC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpB,4BAA4B;gBAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC;gBAC9D,IAAI,OAAO,EAAE,CAAC;oBACZ,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;CACF","sourcesContent":["/**\n * Context Synthesis - Generate coherent narratives from multiple memories\n *\n * Takes a collection of retrieved episodes/patterns and synthesizes\n * a coherent context summary with extracted patterns, success rates,\n * and actionable insights.\n */\n\nexport interface MemoryPattern {\n  task: string;\n  reward: number;\n  success: boolean;\n  critique?: string;\n  input?: string;\n  output?: string;\n  similarity?: number;\n  [key: string]: any;\n}\n\nexport interface SynthesizedContext {\n  summary: string;\n  patterns: string[];\n  successRate: number;\n  averageReward: number;\n  recommendations: string[];\n  keyInsights: string[];\n  totalMemories: number;\n}\n\nexport class ContextSynthesizer {\n  /**\n   * Synthesize context from multiple memories\n   *\n   * @param memories - Retrieved episodes/patterns\n   * @param options - Synthesis options\n   * @returns Synthesized context with insights\n   */\n  static synthesize(\n    memories: MemoryPattern[],\n    options: {\n      minPatternFrequency?: number;\n      includeRecommendations?: boolean;\n      maxSummaryLength?: number;\n    } = {}\n  ): SynthesizedContext {\n    const minPatternFrequency = options.minPatternFrequency ?? 2;\n    const includeRecommendations = options.includeRecommendations ?? true;\n\n    if (memories.length === 0) {\n      return {\n        summary: 'No relevant memories found.',\n        patterns: [],\n        successRate: 0,\n        averageReward: 0,\n        recommendations: [],\n        keyInsights: [],\n        totalMemories: 0,\n      };\n    }\n\n    // Calculate statistics\n    const successCount = memories.filter(m => m.success).length;\n    const successRate = successCount / memories.length;\n    const averageReward = memories.reduce((sum, m) => sum + (m.reward || 0), 0) / memories.length;\n\n    // Extract common patterns from critiques\n    const patterns = this.extractPatterns(memories, minPatternFrequency);\n\n    // Generate key insights\n    const keyInsights = this.generateKeyInsights(memories, successRate, averageReward);\n\n    // Generate recommendations\n    const recommendations = includeRecommendations\n      ? this.generateRecommendations(memories, patterns, successRate)\n      : [];\n\n    // Generate summary narrative\n    const summary = this.generateSummary(memories, patterns, successRate, averageReward);\n\n    return {\n      summary,\n      patterns,\n      successRate,\n      averageReward,\n      recommendations,\n      keyInsights,\n      totalMemories: memories.length,\n    };\n  }\n\n  /**\n   * Extract common patterns from memory critiques\n   */\n  private static extractPatterns(memories: MemoryPattern[], minFrequency: number): string[] {\n    const phraseCount = new Map<string, number>();\n\n    // Extract meaningful phrases from critiques\n    for (const memory of memories) {\n      if (memory.critique) {\n        const phrases = this.extractPhrases(memory.critique);\n        for (const phrase of phrases) {\n          phraseCount.set(phrase, (phraseCount.get(phrase) || 0) + 1);\n        }\n      }\n    }\n\n    // Filter by minimum frequency\n    const patterns: string[] = [];\n    for (const [phrase, count] of phraseCount.entries()) {\n      if (count >= minFrequency) {\n        patterns.push(`${phrase} (${count}/${memories.length} times)`);\n      }\n    }\n\n    return patterns.slice(0, 10);  // Top 10 patterns\n  }\n\n  /**\n   * Extract meaningful phrases from text\n   */\n  private static extractPhrases(text: string): string[] {\n    // Simple phrase extraction (can be enhanced with NLP)\n    const sentences = text.split(/[.!?]/).filter(s => s.trim().length > 0);\n    const phrases: string[] = [];\n\n    for (const sentence of sentences) {\n      const trimmed = sentence.trim();\n      // Extract phrases with key action words\n      if (\n        trimmed.match(/\\b(use|implement|fix|improve|add|create|design|test)\\b/i) &&\n        trimmed.length > 10 &&\n        trimmed.length < 100\n      ) {\n        phrases.push(trimmed.toLowerCase());\n      }\n    }\n\n    return phrases;\n  }\n\n  /**\n   * Generate key insights from memories\n   */\n  private static generateKeyInsights(\n    memories: MemoryPattern[],\n    successRate: number,\n    averageReward: number\n  ): string[] {\n    const insights: string[] = [];\n\n    // Success rate insight\n    if (successRate >= 0.8) {\n      insights.push(`High success rate (${(successRate * 100).toFixed(0)}%) indicates strong pattern match`);\n    } else if (successRate < 0.5) {\n      insights.push(`Low success rate (${(successRate * 100).toFixed(0)}%) suggests exploring alternative approaches`);\n    }\n\n    // Reward insight\n    if (averageReward >= 0.8) {\n      insights.push(`High average reward (${averageReward.toFixed(2)}) shows effective past solutions`);\n    } else if (averageReward < 0.6) {\n      insights.push(`Moderate reward (${averageReward.toFixed(2)}) indicates room for improvement`);\n    }\n\n    // Identify high-performing memories\n    const topMemories = memories\n      .filter(m => m.success && (m.reward || 0) >= 0.9)\n      .slice(0, 3);\n\n    if (topMemories.length > 0) {\n      insights.push(`${topMemories.length} exemplary solution(s) found with reward ≥0.9`);\n    }\n\n    // Task diversity\n    const uniqueTasks = new Set(memories.map(m => m.task)).size;\n    if (uniqueTasks > 1) {\n      insights.push(`${uniqueTasks} different task types provide diverse perspectives`);\n    }\n\n    return insights;\n  }\n\n  /**\n   * Generate actionable recommendations\n   */\n  private static generateRecommendations(\n    memories: MemoryPattern[],\n    patterns: string[],\n    successRate: number\n  ): string[] {\n    const recommendations: string[] = [];\n\n    // Extract successful strategies\n    const successfulMemories = memories.filter(m => m.success && (m.reward || 0) >= 0.8);\n\n    if (successfulMemories.length > 0) {\n      recommendations.push('Apply strategies from high-reward solutions');\n    }\n\n    // Pattern-based recommendations\n    if (patterns.length > 0) {\n      recommendations.push(`Follow common patterns: ${patterns[0].split(' (')[0]}`);\n    }\n\n    // Success rate recommendations\n    if (successRate >= 0.7) {\n      recommendations.push('Previous approaches were effective - follow similar methodology');\n    } else {\n      recommendations.push('Consider alternative approaches given mixed past results');\n    }\n\n    // Add general recommendations\n    if (memories.length >= 5) {\n      recommendations.push('Sufficient historical data available for confident decision-making');\n    } else {\n      recommendations.push('Limited data - proceed with caution and validate assumptions');\n    }\n\n    return recommendations.slice(0, 5);\n  }\n\n  /**\n   * Generate narrative summary\n   */\n  private static generateSummary(\n    memories: MemoryPattern[],\n    patterns: string[],\n    successRate: number,\n    averageReward: number\n  ): string {\n    const parts: string[] = [];\n\n    // Opening\n    parts.push(`Based on ${memories.length} similar past ${memories.length === 1 ? 'experience' : 'experiences'}`);\n\n    // Success rate\n    const successPercent = (successRate * 100).toFixed(0);\n    if (successRate >= 0.7) {\n      parts.push(`with a high success rate of ${successPercent}%`);\n    } else {\n      parts.push(`with a ${successPercent}% success rate`);\n    }\n\n    // Average reward\n    parts.push(`and average reward of ${averageReward.toFixed(2)}`);\n\n    // Key patterns\n    if (patterns.length > 0) {\n      parts.push('. Common effective approaches include:');\n      const topPatterns = patterns.slice(0, 3).map(p => p.split(' (')[0]);\n      parts.push(topPatterns.map((p, i) => `${i + 1}) ${p}`).join(', '));\n    }\n\n    // High performers\n    const topMemories = memories.filter(m => m.success && (m.reward || 0) >= 0.9);\n    if (topMemories.length > 0) {\n      parts.push(`. ${topMemories.length} exemplary solution(s) achieved reward ≥0.9`);\n    }\n\n    parts.push('.');\n\n    return parts.join(' ');\n  }\n\n  /**\n   * Extract actionable steps from successful memories\n   */\n  static extractActionableSteps(memories: MemoryPattern[]): string[] {\n    const steps: string[] = [];\n    const successfulMemories = memories.filter(m => m.success && (m.reward || 0) >= 0.8);\n\n    for (const memory of successfulMemories) {\n      if (memory.critique) {\n        // Extract step-like phrases\n        const matches = memory.critique.match(/\\b\\d+\\.\\s+([^.!?]+)/g);\n        if (matches) {\n          steps.push(...matches.map(m => m.trim()));\n        }\n      }\n    }\n\n    // Remove duplicates and return top 5\n    return Array.from(new Set(steps)).slice(0, 5);\n  }\n}\n"]}

package/dist/packages/agentdb/src/controllers/EmbeddingService.d.ts

@@ -0,0 +1,37 @@
+/**
+ * EmbeddingService - Text Embedding Generation
+ *
+ * Handles text-to-vector embedding generation using various models.
+ * Supports both local (transformers.js) and remote (OpenAI, etc.) embeddings.
+ */
+export interface EmbeddingConfig {
+    model: string;
+    dimension: number;
+    provider: 'transformers' | 'openai' | 'local';
+    apiKey?: string;
+}
+export declare class EmbeddingService {
+    private config;
+    private pipeline;
+    private cache;
+    constructor(config: EmbeddingConfig);
+    /**
+     * Initialize the embedding service
+     */
+    initialize(): Promise<void>;
+    /**
+     * Generate embedding for text
+     */
+    embed(text: string): Promise<Float32Array>;
+    /**
+     * Batch embed multiple texts
+     */
+    embedBatch(texts: string[]): Promise<Float32Array[]>;
+    /**
+     * Clear embedding cache
+     */
+    clearCache(): void;
+    private embedOpenAI;
+    private mockEmbedding;
+}
+//# sourceMappingURL=EmbeddingService.d.ts.map

package/dist/packages/agentdb/src/controllers/EmbeddingService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EmbeddingService.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/EmbeddingService.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,cAAc,GAAG,QAAQ,GAAG,OAAO,CAAC;IAC9C,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,MAAM,CAAkB;IAChC,OAAO,CAAC,QAAQ,CAAM;IACtB,OAAO,CAAC,KAAK,CAA4B;gBAE7B,MAAM,EAAE,eAAe;IAKnC;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IA4BjC;;OAEG;IACG,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;IAgChD;;OAEG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAI1D;;OAEG;IACH,UAAU,IAAI,IAAI;YAQJ,WAAW;IAiBzB,OAAO,CAAC,aAAa;CAmCtB"}

package/dist/packages/agentdb/src/controllers/EmbeddingService.js

@@ -0,0 +1,136 @@
+/**
+ * EmbeddingService - Text Embedding Generation
+ *
+ * Handles text-to-vector embedding generation using various models.
+ * Supports both local (transformers.js) and remote (OpenAI, etc.) embeddings.
+ */
+export class EmbeddingService {
+    config;
+    pipeline; // transformers.js pipeline
+    cache;
+    constructor(config) {
+        this.config = config;
+        this.cache = new Map();
+    }
+    /**
+     * Initialize the embedding service
+     */
+    async initialize() {
+        if (this.config.provider === 'transformers') {
+            // Use transformers.js for local embeddings
+            try {
+                const transformers = await import('@xenova/transformers');
+                // Set Hugging Face token if available from environment
+                const hfToken = process.env.HUGGINGFACE_API_KEY || process.env.HF_TOKEN;
+                if (hfToken) {
+                    // Set the token for Transformers.js to use
+                    if (transformers.env && typeof transformers.env === 'object') {
+                        transformers.env.HF_TOKEN = hfToken;
+                        console.log('🔑 Using Hugging Face API key from environment');
+                    }
+                }
+                this.pipeline = await transformers.pipeline('feature-extraction', this.config.model);
+                console.log(`✅ Transformers.js loaded: ${this.config.model}`);
+            }
+            catch (error) {
+                const errorMessage = error instanceof Error ? error.message : String(error);
+                console.warn(`⚠️  Transformers.js initialization failed: ${errorMessage}`);
+                console.warn('   Falling back to mock embeddings for testing');
+                console.warn('   Set HUGGINGFACE_API_KEY environment variable for real embeddings');
+                this.pipeline = null;
+            }
+        }
+    }
+    /**
+     * Generate embedding for text
+     */
+    async embed(text) {
+        // Check cache
+        const cacheKey = `${this.config.model}:${text}`;
+        if (this.cache.has(cacheKey)) {
+            return this.cache.get(cacheKey);
+        }
+        let embedding;
+        if (this.config.provider === 'transformers' && this.pipeline) {
+            // Use transformers.js
+            const output = await this.pipeline(text, { pooling: 'mean', normalize: true });
+            embedding = new Float32Array(output.data);
+        }
+        else if (this.config.provider === 'openai' && this.config.apiKey) {
+            // Use OpenAI API
+            embedding = await this.embedOpenAI(text);
+        }
+        else {
+            // Mock embedding for testing
+            embedding = this.mockEmbedding(text);
+        }
+        // Cache result
+        if (this.cache.size > 10000) {
+            // Simple LRU: clear half the cache
+            const keysToDelete = Array.from(this.cache.keys()).slice(0, 5000);
+            keysToDelete.forEach(k => this.cache.delete(k));
+        }
+        this.cache.set(cacheKey, embedding);
+        return embedding;
+    }
+    /**
+     * Batch embed multiple texts
+     */
+    async embedBatch(texts) {
+        return Promise.all(texts.map(text => this.embed(text)));
+    }
+    /**
+     * Clear embedding cache
+     */
+    clearCache() {
+        this.cache.clear();
+    }
+    // ========================================================================
+    // Private Methods
+    // ========================================================================
+    async embedOpenAI(text) {
+        const response = await fetch('https://api.openai.com/v1/embeddings', {
+            method: 'POST',
+            headers: {
+                'Authorization': `Bearer ${this.config.apiKey}`,
+                'Content-Type': 'application/json'
+            },
+            body: JSON.stringify({
+                model: this.config.model,
+                input: text
+            })
+        });
+        const data = await response.json();
+        return new Float32Array(data.data[0].embedding);
+    }
+    mockEmbedding(text) {
+        // Simple deterministic mock embedding for testing
+        const embedding = new Float32Array(this.config.dimension);
+        // Handle null/undefined/empty text
+        if (!text || text.length === 0) {
+            return new Array(this.config.dimension).fill(0);
+        }
+        // Use simple hash-based generation
+        let hash = 0;
+        for (let i = 0; i < text.length; i++) {
+            hash = ((hash << 5) - hash) + text.charCodeAt(i);
+            hash = hash & hash; // Convert to 32bit integer
+        }
+        // Fill embedding with pseudo-random values based on hash
+        for (let i = 0; i < this.config.dimension; i++) {
+            const seed = hash + i * 31;
+            embedding[i] = Math.sin(seed) * Math.cos(seed * 0.5);
+        }
+        // Normalize
+        let norm = 0;
+        for (let i = 0; i < embedding.length; i++) {
+            norm += embedding[i] * embedding[i];
+        }
+        norm = Math.sqrt(norm);
+        for (let i = 0; i < embedding.length; i++) {
+            embedding[i] /= norm;
+        }
+        return embedding;
+    }
+}
+//# sourceMappingURL=EmbeddingService.js.map

package/dist/packages/agentdb/src/controllers/EmbeddingService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EmbeddingService.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/EmbeddingService.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AASH,MAAM,OAAO,gBAAgB;IACnB,MAAM,CAAkB;IACxB,QAAQ,CAAM,CAAC,2BAA2B;IAC1C,KAAK,CAA4B;IAEzC,YAAY,MAAuB;QACjC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,KAAK,cAAc,EAAE,CAAC;YAC5C,2CAA2C;YAC3C,IAAI,CAAC;gBACH,MAAM,YAAY,GAAG,MAAM,MAAM,CAAC,sBAAsB,CAAC,CAAC;gBAE1D,uDAAuD;gBACvD,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,mBAAmB,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBACxE,IAAI,OAAO,EAAE,CAAC;oBACZ,2CAA2C;oBAC3C,IAAI,YAAY,CAAC,GAAG,IAAI,OAAO,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;wBAC5D,YAAY,CAAC,GAAW,CAAC,QAAQ,GAAG,OAAO,CAAC;wBAC7C,OAAO,CAAC,GAAG,CAAC,gDAAgD,CAAC,CAAC;oBAChE,CAAC;gBACH,CAAC;gBAED,IAAI,CAAC,QAAQ,GAAG,MAAM,YAAY,CAAC,QAAQ,CAAC,oBAAoB,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACrF,OAAO,CAAC,GAAG,CAAC,6BAA6B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;YAChE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC5E,OAAO,CAAC,IAAI,CAAC,8CAA8C,YAAY,EAAE,CAAC,CAAC;gBAC3E,OAAO,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;gBAC/D,OAAO,CAAC,IAAI,CAAC,qEAAqE,CAAC,CAAC;gBACpF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,IAAY;QACtB,cAAc;QACd,MAAM,QAAQ,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC;QAChD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACnC,CAAC;QAED,IAAI,SAAuB,CAAC;QAE5B,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,KAAK,cAAc,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7D,sBAAsB;YACtB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC/E,SAAS,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACnE,iBAAiB;YACjB,SAAS,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACN,6BAA6B;YAC7B,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;QAED,eAAe;QACf,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,KAAK,EAAE,CAAC;YAC5B,mCAAmC;YACnC,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAClE,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAEpC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,KAAe;QAC9B,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,2EAA2E;IAC3E,kBAAkB;IAClB,2EAA2E;IAEnE,KAAK,CAAC,WAAW,CAAC,IAAY;QACpC,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,sCAAsC,EAAE;YACnE,MAAM,EAAE,MAAM;YACd,OAAO,EAAE;gBACP,eAAe,EAAE,UAAU,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;gBAC/C,cAAc,EAAE,kBAAkB;aACnC;YACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK;gBACxB,KAAK,EAAE,IAAI;aACZ,CAAC;SACH,CAAC,CAAC;QAEH,MAAM,IAAI,GAAQ,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;QACxC,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAClD,CAAC;IAEO,aAAa,CAAC,IAAY;QAChC,kDAAkD;QAClD,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAE1D,mCAAmC;QACnC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAwB,CAAC;QACzE,CAAC;QAED,mCAAmC;QACnC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,2BAA2B;QACjD,CAAC;QAED,yDAAyD;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;YAC3B,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;QACvD,CAAC;QAED,YAAY;QACZ,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACvB,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/**\n * EmbeddingService - Text Embedding Generation\n *\n * Handles text-to-vector embedding generation using various models.\n * Supports both local (transformers.js) and remote (OpenAI, etc.) embeddings.\n */\n\nexport interface EmbeddingConfig {\n  model: string;\n  dimension: number;\n  provider: 'transformers' | 'openai' | 'local';\n  apiKey?: string;\n}\n\nexport class EmbeddingService {\n  private config: EmbeddingConfig;\n  private pipeline: any; // transformers.js pipeline\n  private cache: Map<string, Float32Array>;\n\n  constructor(config: EmbeddingConfig) {\n    this.config = config;\n    this.cache = new Map();\n  }\n\n  /**\n   * Initialize the embedding service\n   */\n  async initialize(): Promise<void> {\n    if (this.config.provider === 'transformers') {\n      // Use transformers.js for local embeddings\n      try {\n        const transformers = await import('@xenova/transformers');\n\n        // Set Hugging Face token if available from environment\n        const hfToken = process.env.HUGGINGFACE_API_KEY || process.env.HF_TOKEN;\n        if (hfToken) {\n          // Set the token for Transformers.js to use\n          if (transformers.env && typeof transformers.env === 'object') {\n            (transformers.env as any).HF_TOKEN = hfToken;\n            console.log('🔑 Using Hugging Face API key from environment');\n          }\n        }\n\n        this.pipeline = await transformers.pipeline('feature-extraction', this.config.model);\n        console.log(`✅ Transformers.js loaded: ${this.config.model}`);\n      } catch (error) {\n        const errorMessage = error instanceof Error ? error.message : String(error);\n        console.warn(`⚠️  Transformers.js initialization failed: ${errorMessage}`);\n        console.warn('   Falling back to mock embeddings for testing');\n        console.warn('   Set HUGGINGFACE_API_KEY environment variable for real embeddings');\n        this.pipeline = null;\n      }\n    }\n  }\n\n  /**\n   * Generate embedding for text\n   */\n  async embed(text: string): Promise<Float32Array> {\n    // Check cache\n    const cacheKey = `${this.config.model}:${text}`;\n    if (this.cache.has(cacheKey)) {\n      return this.cache.get(cacheKey)!;\n    }\n\n    let embedding: Float32Array;\n\n    if (this.config.provider === 'transformers' && this.pipeline) {\n      // Use transformers.js\n      const output = await this.pipeline(text, { pooling: 'mean', normalize: true });\n      embedding = new Float32Array(output.data);\n    } else if (this.config.provider === 'openai' && this.config.apiKey) {\n      // Use OpenAI API\n      embedding = await this.embedOpenAI(text);\n    } else {\n      // Mock embedding for testing\n      embedding = this.mockEmbedding(text);\n    }\n\n    // Cache result\n    if (this.cache.size > 10000) {\n      // Simple LRU: clear half the cache\n      const keysToDelete = Array.from(this.cache.keys()).slice(0, 5000);\n      keysToDelete.forEach(k => this.cache.delete(k));\n    }\n    this.cache.set(cacheKey, embedding);\n\n    return embedding;\n  }\n\n  /**\n   * Batch embed multiple texts\n   */\n  async embedBatch(texts: string[]): Promise<Float32Array[]> {\n    return Promise.all(texts.map(text => this.embed(text)));\n  }\n\n  /**\n   * Clear embedding cache\n   */\n  clearCache(): void {\n    this.cache.clear();\n  }\n\n  // ========================================================================\n  // Private Methods\n  // ========================================================================\n\n  private async embedOpenAI(text: string): Promise<Float32Array> {\n    const response = await fetch('https://api.openai.com/v1/embeddings', {\n      method: 'POST',\n      headers: {\n        'Authorization': `Bearer ${this.config.apiKey}`,\n        'Content-Type': 'application/json'\n      },\n      body: JSON.stringify({\n        model: this.config.model,\n        input: text\n      })\n    });\n\n    const data: any = await response.json();\n    return new Float32Array(data.data[0].embedding);\n  }\n\n  private mockEmbedding(text: string): Float32Array {\n    // Simple deterministic mock embedding for testing\n    const embedding = new Float32Array(this.config.dimension);\n\n    // Handle null/undefined/empty text\n    if (!text || text.length === 0) {\n      return new Array(this.config.dimension).fill(0) as any as Float32Array;\n    }\n\n    // Use simple hash-based generation\n    let hash = 0;\n    for (let i = 0; i < text.length; i++) {\n      hash = ((hash << 5) - hash) + text.charCodeAt(i);\n      hash = hash & hash; // Convert to 32bit integer\n    }\n\n    // Fill embedding with pseudo-random values based on hash\n    for (let i = 0; i < this.config.dimension; i++) {\n      const seed = hash + i * 31;\n      embedding[i] = Math.sin(seed) * Math.cos(seed * 0.5);\n    }\n\n    // Normalize\n    let norm = 0;\n    for (let i = 0; i < embedding.length; i++) {\n      norm += embedding[i] * embedding[i];\n    }\n    norm = Math.sqrt(norm);\n\n    for (let i = 0; i < embedding.length; i++) {\n      embedding[i] /= norm;\n    }\n\n    return embedding;\n  }\n}\n"]}

package/dist/packages/agentdb/src/controllers/EnhancedEmbeddingService.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Enhanced EmbeddingService with WASM Acceleration
+ *
+ * Extends the base EmbeddingService with WASM-accelerated batch operations
+ * and improved performance for large-scale embedding generation.
+ */
+import { EmbeddingService, EmbeddingConfig } from './EmbeddingService.js';
+export interface EnhancedEmbeddingConfig extends EmbeddingConfig {
+    enableWASM?: boolean;
+    enableBatchProcessing?: boolean;
+    batchSize?: number;
+}
+export declare class EnhancedEmbeddingService extends EmbeddingService {
+    private wasmSearch;
+    private enhancedConfig;
+    constructor(config: EnhancedEmbeddingConfig);
+    /**
+     * Initialize WASM acceleration
+     */
+    private initializeWASM;
+    /**
+     * Enhanced batch embedding with parallel processing
+     */
+    embedBatch(texts: string[]): Promise<Float32Array[]>;
+    /**
+     * Calculate similarity between two texts using WASM acceleration
+     */
+    similarity(textA: string, textB: string): Promise<number>;
+    /**
+     * Find most similar texts from a corpus
+     */
+    findMostSimilar(query: string, corpus: string[], k?: number): Promise<Array<{
+        text: string;
+        similarity: number;
+        index: number;
+    }>>;
+    /**
+     * Get service statistics
+     */
+    getStats(): {
+        cacheSize: number;
+        wasmEnabled: boolean;
+        simdEnabled: boolean;
+    };
+}
+//# sourceMappingURL=EnhancedEmbeddingService.d.ts.map

package/dist/packages/agentdb/src/controllers/EnhancedEmbeddingService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EnhancedEmbeddingService.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/EnhancedEmbeddingService.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAI1E,MAAM,WAAW,uBAAwB,SAAQ,eAAe;IAC9D,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,wBAAyB,SAAQ,gBAAgB;IAC5D,OAAO,CAAC,UAAU,CAAiC;IACnD,OAAO,CAAC,cAAc,CAA0B;gBAEpC,MAAM,EAAE,uBAAuB;IAc3C;;OAEG;IACH,OAAO,CAAC,cAAc;IAYtB;;OAEG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAsB1D;;OAEG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAc/D;;OAEG;IACG,eAAe,CACnB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EAAE,EAChB,CAAC,GAAE,MAAU,GACZ,OAAO,CAAC,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IA0BtE;;OAEG;IACH,QAAQ,IAAI;QACV,SAAS,EAAE,MAAM,CAAC;QAClB,WAAW,EAAE,OAAO,CAAC;QACrB,WAAW,EAAE,OAAO,CAAC;KACtB;CAUF"}

package/dist/packages/agentdb/src/controllers/EnhancedEmbeddingService.js

@@ -0,0 +1,105 @@
+/**
+ * Enhanced EmbeddingService with WASM Acceleration
+ *
+ * Extends the base EmbeddingService with WASM-accelerated batch operations
+ * and improved performance for large-scale embedding generation.
+ */
+import { EmbeddingService } from './EmbeddingService.js';
+import { WASMVectorSearch } from './WASMVectorSearch.js';
+import { cosineSimilarity } from '../utils/vector-math.js';
+export class EnhancedEmbeddingService extends EmbeddingService {
+    wasmSearch = null;
+    enhancedConfig;
+    constructor(config) {
+        super(config);
+        this.enhancedConfig = {
+            enableWASM: true,
+            enableBatchProcessing: true,
+            batchSize: 100,
+            ...config,
+        };
+        if (this.enhancedConfig.enableWASM) {
+            this.initializeWASM();
+        }
+    }
+    /**
+     * Initialize WASM acceleration
+     */
+    initializeWASM() {
+        const mockDb = {
+            prepare: () => ({ all: () => [], get: () => null, run: () => ({}) }),
+            exec: () => { },
+        };
+        this.wasmSearch = new WASMVectorSearch(mockDb, {
+            enableWASM: true,
+            batchSize: this.enhancedConfig.batchSize || 100,
+        });
+    }
+    /**
+     * Enhanced batch embedding with parallel processing
+     */
+    async embedBatch(texts) {
+        if (!this.enhancedConfig.enableBatchProcessing || texts.length < 10) {
+            return super.embedBatch(texts);
+        }
+        const batchSize = this.enhancedConfig.batchSize || 100;
+        const batches = [];
+        // Split into batches
+        for (let i = 0; i < texts.length; i += batchSize) {
+            batches.push(texts.slice(i, i + batchSize));
+        }
+        // Process batches in parallel
+        const results = await Promise.all(batches.map(batch => super.embedBatch(batch)));
+        // Flatten results
+        return results.flat();
+    }
+    /**
+     * Calculate similarity between two texts using WASM acceleration
+     */
+    async similarity(textA, textB) {
+        const [embeddingA, embeddingB] = await Promise.all([
+            this.embed(textA),
+            this.embed(textB),
+        ]);
+        if (this.wasmSearch) {
+            return this.wasmSearch.cosineSimilarity(embeddingA, embeddingB);
+        }
+        // Fallback to manual calculation
+        return cosineSimilarity(embeddingA, embeddingB);
+    }
+    /**
+     * Find most similar texts from a corpus
+     */
+    async findMostSimilar(query, corpus, k = 5) {
+        const queryEmbedding = await this.embed(query);
+        const corpusEmbeddings = await this.embedBatch(corpus);
+        let similarities;
+        if (this.wasmSearch) {
+            similarities = this.wasmSearch.batchSimilarity(queryEmbedding, corpusEmbeddings);
+        }
+        else {
+            similarities = corpusEmbeddings.map(emb => cosineSimilarity(queryEmbedding, emb));
+        }
+        // Create results with indices
+        const results = corpus.map((text, index) => ({
+            text,
+            similarity: similarities[index],
+            index,
+        }));
+        // Sort by similarity and take top k
+        results.sort((a, b) => b.similarity - a.similarity);
+        return results.slice(0, k);
+    }
+    /**
+     * Get service statistics
+     */
+    getStats() {
+        const wasmStats = this.wasmSearch?.getStats();
+        return {
+            cacheSize: this.cache.size,
+            wasmEnabled: wasmStats?.wasmAvailable ?? false,
+            simdEnabled: wasmStats?.simdAvailable ?? false,
+        };
+    }
+}
+//# sourceMappingURL=EnhancedEmbeddingService.js.map

package/dist/packages/agentdb/src/controllers/EnhancedEmbeddingService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EnhancedEmbeddingService.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/controllers/EnhancedEmbeddingService.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAmB,MAAM,uBAAuB,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAQ3D,MAAM,OAAO,wBAAyB,SAAQ,gBAAgB;IACpD,UAAU,GAA4B,IAAI,CAAC;IAC3C,cAAc,CAA0B;IAEhD,YAAY,MAA+B;QACzC,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,cAAc,GAAG;YACpB,UAAU,EAAE,IAAI;YAChB,qBAAqB,EAAE,IAAI;YAC3B,SAAS,EAAE,GAAG;YACd,GAAG,MAAM;SACV,CAAC;QAEF,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,MAAM,MAAM,GAAG;YACb,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACpE,IAAI,EAAE,GAAG,EAAE,GAAE,CAAC;SACf,CAAC;QAEF,IAAI,CAAC,UAAU,GAAG,IAAI,gBAAgB,CAAC,MAAM,EAAE;YAC7C,UAAU,EAAE,IAAI;YAChB,SAAS,EAAE,IAAI,CAAC,cAAc,CAAC,SAAS,IAAI,GAAG;SAChD,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,KAAe;QAC9B,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,qBAAqB,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACpE,OAAO,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,IAAI,GAAG,CAAC;QACvD,MAAM,OAAO,GAAe,EAAE,CAAC;QAE/B,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YACjD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,8BAA8B;QAC9B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAC9C,CAAC;QAEF,kBAAkB;QAClB,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,KAAa,EAAE,KAAa;QAC3C,MAAM,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YACjB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;SAClB,CAAC,CAAC;QAEH,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QAClE,CAAC;QAED,iCAAiC;QACjC,OAAO,gBAAgB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CACnB,KAAa,EACb,MAAgB,EAChB,IAAY,CAAC;QAEb,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,gBAAgB,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAEvD,IAAI,YAAsB,CAAC;QAE3B,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnF,CAAC;aAAM,CAAC;YACN,YAAY,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CACxC,gBAAgB,CAAC,cAAc,EAAE,GAAG,CAAC,CACtC,CAAC;QACJ,CAAC;QAED,8BAA8B;QAC9B,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YAC3C,IAAI;YACJ,UAAU,EAAE,YAAY,CAAC,KAAK,CAAC;YAC/B,KAAK;SACN,CAAC,CAAC,CAAC;QAEJ,oCAAoC;QACpC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,QAAQ;QAKN,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC;QAE9C,OAAO;YACL,SAAS,EAAG,IAAY,CAAC,KAAK,CAAC,IAAI;YACnC,WAAW,EAAE,SAAS,EAAE,aAAa,IAAI,KAAK;YAC9C,WAAW,EAAE,SAAS,EAAE,aAAa,IAAI,KAAK;SAC/C,CAAC;IACJ,CAAC;CAEF","sourcesContent":["/**\n * Enhanced EmbeddingService with WASM Acceleration\n *\n * Extends the base EmbeddingService with WASM-accelerated batch operations\n * and improved performance for large-scale embedding generation.\n */\n\nimport { EmbeddingService, EmbeddingConfig } from './EmbeddingService.js';\nimport { WASMVectorSearch } from './WASMVectorSearch.js';\nimport { cosineSimilarity } from '../utils/vector-math.js';\n\nexport interface EnhancedEmbeddingConfig extends EmbeddingConfig {\n  enableWASM?: boolean;\n  enableBatchProcessing?: boolean;\n  batchSize?: number;\n}\n\nexport class EnhancedEmbeddingService extends EmbeddingService {\n  private wasmSearch: WASMVectorSearch | null = null;\n  private enhancedConfig: EnhancedEmbeddingConfig;\n\n  constructor(config: EnhancedEmbeddingConfig) {\n    super(config);\n    this.enhancedConfig = {\n      enableWASM: true,\n      enableBatchProcessing: true,\n      batchSize: 100,\n      ...config,\n    };\n\n    if (this.enhancedConfig.enableWASM) {\n      this.initializeWASM();\n    }\n  }\n\n  /**\n   * Initialize WASM acceleration\n   */\n  private initializeWASM(): void {\n    const mockDb = {\n      prepare: () => ({ all: () => [], get: () => null, run: () => ({}) }),\n      exec: () => {},\n    };\n\n    this.wasmSearch = new WASMVectorSearch(mockDb, {\n      enableWASM: true,\n      batchSize: this.enhancedConfig.batchSize || 100,\n    });\n  }\n\n  /**\n   * Enhanced batch embedding with parallel processing\n   */\n  async embedBatch(texts: string[]): Promise<Float32Array[]> {\n    if (!this.enhancedConfig.enableBatchProcessing || texts.length < 10) {\n      return super.embedBatch(texts);\n    }\n\n    const batchSize = this.enhancedConfig.batchSize || 100;\n    const batches: string[][] = [];\n\n    // Split into batches\n    for (let i = 0; i < texts.length; i += batchSize) {\n      batches.push(texts.slice(i, i + batchSize));\n    }\n\n    // Process batches in parallel\n    const results = await Promise.all(\n      batches.map(batch => super.embedBatch(batch))\n    );\n\n    // Flatten results\n    return results.flat();\n  }\n\n  /**\n   * Calculate similarity between two texts using WASM acceleration\n   */\n  async similarity(textA: string, textB: string): Promise<number> {\n    const [embeddingA, embeddingB] = await Promise.all([\n      this.embed(textA),\n      this.embed(textB),\n    ]);\n\n    if (this.wasmSearch) {\n      return this.wasmSearch.cosineSimilarity(embeddingA, embeddingB);\n    }\n\n    // Fallback to manual calculation\n    return cosineSimilarity(embeddingA, embeddingB);\n  }\n\n  /**\n   * Find most similar texts from a corpus\n   */\n  async findMostSimilar(\n    query: string,\n    corpus: string[],\n    k: number = 5\n  ): Promise<Array<{ text: string; similarity: number; index: number }>> {\n    const queryEmbedding = await this.embed(query);\n    const corpusEmbeddings = await this.embedBatch(corpus);\n\n    let similarities: number[];\n\n    if (this.wasmSearch) {\n      similarities = this.wasmSearch.batchSimilarity(queryEmbedding, corpusEmbeddings);\n    } else {\n      similarities = corpusEmbeddings.map(emb =>\n        cosineSimilarity(queryEmbedding, emb)\n      );\n    }\n\n    // Create results with indices\n    const results = corpus.map((text, index) => ({\n      text,\n      similarity: similarities[index],\n      index,\n    }));\n\n    // Sort by similarity and take top k\n    results.sort((a, b) => b.similarity - a.similarity);\n    return results.slice(0, k);\n  }\n\n  /**\n   * Get service statistics\n   */\n  getStats(): {\n    cacheSize: number;\n    wasmEnabled: boolean;\n    simdEnabled: boolean;\n  } {\n    const wasmStats = this.wasmSearch?.getStats();\n\n    return {\n      cacheSize: (this as any).cache.size,\n      wasmEnabled: wasmStats?.wasmAvailable ?? false,\n      simdEnabled: wasmStats?.simdAvailable ?? false,\n    };\n  }\n\n}\n"]}