adaptive-memory-multi-model-router 2.14.45 → 2.14.47

package/tests/tsconfig.json

@@ -1,21 +0,0 @@
-{
-  "compilerOptions": {
-    "target": "ES2022",
-    "module": "ESNext",
-    "moduleResolution": "bundler",
-    "lib": ["ES2022"],
-    "types": ["node"],
-    "strict": true,
-    "esModuleInterop": true,
-    "skipLibCheck": true,
-    "forceConsistentCasingInFileNames": true,
-    "resolveJsonModule": true,
-    "allowImportingTsExtensions": true,
-    "noEmit": true
-  },
-  "include": [
-    "../tmlpd-pi-extension/src/**/*.ts",
-    "../src/**/*.ts",
-    "./**/*.ts"
-  ]
-}

package/tests/vitest.config.ts

@@ -1,18 +0,0 @@
-import { defineConfig } from 'vitest/config';
-
-export default defineConfig({
-  test: {
-    globals: true,
-    environment: 'node',
-    include: ['**/*.test.ts'],
-    exclude: ['node_modules', 'dist'],
-    testTimeout: 15_000,
-    hookTimeout: 10_000,
-    pool: 'forks',
-    poolOptions: {
-      forks: {
-        singleFork: true,
-      },
-    },
-  },
-});

package/tmlpd-pi-extension/README.md

@@ -1,66 +0,0 @@
-# TMLPD — Parallel Multi-LLM Execution Module
-
-> **Part of the [A3M Router](https://github.com/Das-rebel/a3m-router) ecosystem — the fastest-growing npm LLM router (10K downloads in 14 days).**
-
-Parallel multi-LLM execution with confidence-weighted ensemble merging. Runs providers simultaneously, scores each result, and returns the best answer with transparent reasoning.
-
-## What This Is
-
-A TypeScript library for executing prompts across multiple LLM providers **in parallel** — not sequentially. Every provider runs at the same time, results are scored on quality, and the best answer is selected with a clear explanation of why it won.
-
-## Core Features
-
-| Feature | Description |
-|:--------|:------------|
-| **Parallel execution** | Run N providers simultaneously, not sequentially |
-| **Ensemble scoring** | Score results on specificity, structure, and relevance |
-| **Query-type presets** | Auto-configure provider + temp per task type |
-| **Cost tracking** | Per-query cost display with provider breakdown |
-| **Persistent memory** | Cross-session `.memory.json` with keyword indexing |
-| **Prefix caching** | RadixAttention-style caching for repeated prefixes |
-| **Speculative decoding** | Medusa/EAGLE-style multi-token prediction |
-| **Token compression** | ISON encoding for ~40% token reduction |
-
-## Usage
-
-```typescript
-import { executeEnsemble, createPresetRouter, EpisodicMemoryStore } from "tmlpd-pi";
-
-// Parallel ensemble: run all providers simultaneously, pick best
-const result = await executeEnsemble(
-  "Explain vector databases",
-  systemPrompt,
-  context,
-  { nvidia: callNvidia, groq: callGroq }
-);
-console.log(`Winner: ${result.winner} (score: ${result.scores[result.winner]})`);
-
-// Query-type presets: auto-configure per task
-const router = createPresetRouter();
-const preset = router.classify("Write a Python sort function"); // → 'code'
-
-// Persistent memory
-const memory = new EpisodicMemoryStore(1000, './memory.json');
-const similar = memory.getSimilarTasks("Python async API", 5);
-```
-
-## Exports
-
-- `createTMLPD`, `TMLPDTools` — Core parallel execution
-- `executeEnsemble`, `mergeComplementary`, `recordFeedback` — P0 Ensemble voting
-- `createPresetRouter`, `getPresetForQuery`, `DEFAULT_PRESETS` — P1 Query presets
-- `EpisodicMemoryStore` — P3 Persistent memory with auto-save
-- `CostTracker`, `BudgetEnforcer` — P2 Cost tracking
-- `ResponseCache`, `PrefixCache` — Caching layers
-- `HALOOrchestrator`, `MCTSWorkflowOptimizer` — Advanced orchestration
-
-## Research Backing
-
-- **RouteLLM** (arXiv:2404.06035) — Learned cost-quality routing
-- **RadixAttention** (arXiv:2312.07104) — 5-10x speedup via prefix caching
-- **Medusa** (arXiv:2401.10774) — 2-3x faster generation
-- **A-Mem** (arXiv:2502.12110) — Episodic memory patterns
-
----
-
-*Part of the A3M Router ecosystem. "Nobody does parallel multi-LLM execution with result merging. Everyone does sequential fallback."*

package/tmlpd-pi-extension/dist/cache/prefixCache.d.ts

@@ -1,114 +0,0 @@
-/**
- * TMLPD Prefix Cache - RadixAttention Style
- *
- * Inspired by SGLang's RadixAttention (arXiv:2312.07104)
- * Caches KV states for common prefixes (system prompts, etc.)
- * 5-10x speedup for repeated prompt patterns
- */
-export interface CacheEntry {
-    key: string;
-    prefix: string;
-    kv_state?: Buffer;
-    response_hash?: string;
-    hit_count: number;
-    last_used: number;
-    token_count: number;
-    children: Map<string, string>;
-}
-export interface PrefixCacheStats {
-    total_entries: number;
-    total_hits: number;
-    total_misses: number;
-    hit_rate: number;
-    memory_estimate_mb: number;
-    oldest_entry_age_ms: number;
-}
-export declare class PrefixCache {
-    private entries;
-    private access_order;
-    private max_entries;
-    private max_memory_mb;
-    constructor(options?: {
-        max_entries?: number;
-        max_memory_mb?: number;
-    });
-    /**
-     * Generate cache key from text prefix
-     */
-    private generateKey;
-    /**
-     * Check if prefix is cached
-     */
-    has(prefix: string, model?: string): boolean;
-    /**
-     * Get cached entry
-     */
-    get(prefix: string, model?: string): CacheEntry | undefined;
-    /**
-     * Store a new prefix with its KV state
-     */
-    store(prefix: string, options?: {
-        kv_state?: Buffer;
-        response_hash?: string;
-        model?: string;
-        children?: Map<string, string>;
-    }): string;
-    /**
-     * Extend cached prefix with completion
-     */
-    extend(prefix: string, completion: string, options?: {
-        model?: string;
-    }): string;
-    /**
-     * Find common prefix between two texts
-     */
-    findCommonPrefix(text1: string, text2: string): string;
-    /**
-     * Lookup with prefix matching
-     * Returns cached entry if any prefix is found
-     */
-    lookup(text: string, model?: string): {
-        cached: boolean;
-        prefix?: string;
-        remaining?: string;
-    };
-    /**
-     * Batch lookup for multiple texts
-     */
-    lookupBatch(texts: string[], model?: string): Array<{
-        cached: boolean;
-        prefix?: string;
-        remaining?: string;
-    }>;
-    /**
-     * Get cache statistics
-     */
-    getStats(): PrefixCacheStats;
-    /**
-     * Get estimated memory usage
-     */
-    private getMemoryUsage;
-    /**
-     * Update LRU order
-     */
-    private updateLRU;
-    /**
-     * Evict least recently used entry
-     */
-    private evictLRU;
-    /**
-     * Clear all cache
-     */
-    clear(): void;
-    /**
-     * Invalidate entries matching pattern
-     */
-    invalidate(pattern?: string): number;
-    /**
-     * Warm up cache with common system prompts
-     */
-    warmup(common_prefixes: string[], model?: string): void;
-}
-export default PrefixCache;
-export declare function createWarmedCache(): PrefixCache;
-//# sourceMappingURL=prefixCache.d.ts.map

package/tmlpd-pi-extension/dist/cache/prefixCache.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"prefixCache.d.ts","sourceRoot":"","sources":["../../src/cache/prefixCache.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC/B;AAED,MAAM,WAAW,gBAAgB;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,qBAAa,WAAW;IACtB,OAAO,CAAC,OAAO,CAAsC;IACrD,OAAO,CAAC,YAAY,CAAgB;IACpC,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,aAAa,CAAS;gBAElB,OAAO,CAAC,EAAE;QACpB,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,aAAa,CAAC,EAAE,MAAM,CAAC;KACxB;IAKD;;OAEG;IACH,OAAO,CAAC,WAAW;IAenB;;OAEG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO;IAK5C;;OAEG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAc3D;;OAEG;IACH,KAAK,CACH,MAAM,EAAE,MAAM,EACd,OAAO,CAAC,EAAE;QACR,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,QAAQ,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAChC,GACA,MAAM;IAsCT;;OAEG;IACH,MAAM,CACJ,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,OAAO,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC3B,MAAM;IAoBT;;OAEG;IACH,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAgBtD;;;OAGG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG;QAAE,MAAM,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE;IAsB9F;;OAEG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,MAAM,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAI7G;;OAEG;IACH,QAAQ,IAAI,gBAAgB;IAwB5B;;OAEG;IACH,OAAO,CAAC,cAAc;IAsBtB;;OAEG;IACH,OAAO,CAAC,SAAS;IAQjB;;OAEG;IACH,OAAO,CAAC,QAAQ;IAuBhB;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,MAAM;IAqBpC;;OAEG;IACH,MAAM,CAAC,eAAe,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI;CAMxD;AAcD,eAAe,WAAW,CAAC;AAG3B,wBAAgB,iBAAiB,IAAI,WAAW,CAI/C"}

package/tmlpd-pi-extension/dist/cache/prefixCache.js

@@ -1,285 +0,0 @@
-"use strict";
-/**
- * TMLPD Prefix Cache - RadixAttention Style
- *
- * Inspired by SGLang's RadixAttention (arXiv:2312.07104)
- * Caches KV states for common prefixes (system prompts, etc.)
- * 5-10x speedup for repeated prompt patterns
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PrefixCache = void 0;
-exports.createWarmedCache = createWarmedCache;
-class PrefixCache {
-    entries = new Map();
-    access_order = []; // LRU tracking
-    max_entries;
-    max_memory_mb;
-    constructor(options) {
-        this.max_entries = options?.max_entries || 10000;
-        this.max_memory_mb = options?.max_memory_mb || 512;
-    }
-    /**
-     * Generate cache key from text prefix
-     */
-    generateKey(text, model) {
-        // Simple hash for now - in production use SHA-256
-        const normalized = text.toLowerCase().trim().substring(0, 500);
-        const str = `${model || "default"}:${normalized}`;
-        let hash = 0;
-        for (let i = 0; i < str.length; i++) {
-            const char = str.charCodeAt(i);
-            hash = ((hash << 5) - hash) + char;
-            hash = hash & hash; // Convert to 32bit integer
-        }
-        return `pc_${Math.abs(hash).toString(16)}`;
-    }
-    /**
-     * Check if prefix is cached
-     */
-    has(prefix, model) {
-        const key = this.generateKey(prefix, model);
-        return this.entries.has(key);
-    }
-    /**
-     * Get cached entry
-     */
-    get(prefix, model) {
-        const key = this.generateKey(prefix, model);
-        const entry = this.entries.get(key);
-        if (entry) {
-            // Update LRU
-            this.updateLRU(key);
-            entry.hit_count++;
-            entry.last_used = Date.now();
-        }
-        return entry;
-    }
-    /**
-     * Store a new prefix with its KV state
-     */
-    store(prefix, options) {
-        const key = this.generateKey(prefix, options?.model);
-        // Check if already exists
-        if (this.entries.has(key)) {
-            const existing = this.entries.get(key);
-            existing.hit_count++;
-            existing.last_used = Date.now();
-            return key;
-        }
-        // Estimate memory
-        const token_count = Math.ceil(prefix.split(/\s+/).length * 1.3);
-        const memory_bytes = token_count * 16 * 128 * 2; // Rough KV estimate
-        const memory_mb = memory_bytes / (1024 * 1024);
-        const entry = {
-            key,
-            prefix: prefix.substring(0, 1000), // Store truncated
-            kv_state: options?.kv_state,
-            response_hash: options?.response_hash,
-            hit_count: 1,
-            last_used: Date.now(),
-            token_count,
-            children: options?.children || new Map()
-        };
-        // Evict if necessary
-        while (this.entries.size >= this.max_entries || this.getMemoryUsage() + memory_mb > this.max_memory_mb) {
-            this.evictLRU();
-        }
-        this.entries.set(key, entry);
-        this.access_order.push(key);
-        return key;
-    }
-    /**
-     * Extend cached prefix with completion
-     */
-    extend(prefix, completion, options) {
-        const prefix_key = this.generateKey(prefix, options?.model);
-        const parent = this.entries.get(prefix_key);
-        if (!parent) {
-            // No parent - just store completion as new entry
-            return this.store(completion, { model: options?.model });
-        }
-        // Create child entry for the extended sequence
-        const extended = prefix + completion;
-        const child_key = this.store(extended, { model: options?.model });
-        // Link child to parent
-        const completion_key = this.generateKey(completion);
-        parent.children.set(completion_key, child_key);
-        return child_key;
-    }
-    /**
-     * Find common prefix between two texts
-     */
-    findCommonPrefix(text1, text2) {
-        const words1 = text1.split(/\s+/);
-        const words2 = text2.split(/\s+/);
-        let common_length = 0;
-        for (let i = 0; i < Math.min(words1.length, words2.length); i++) {
-            if (words1[i].toLowerCase() === words2[i].toLowerCase()) {
-                common_length = i + 1;
-            }
-            else {
-                break;
-            }
-        }
-        return words1.slice(0, common_length).join(" ");
-    }
-    /**
-     * Lookup with prefix matching
-     * Returns cached entry if any prefix is found
-     */
-    lookup(text, model) {
-        // Try exact match first
-        const exact_key = this.generateKey(text, model);
-        if (this.entries.has(exact_key)) {
-            return { cached: true };
-        }
-        // Try progressively shorter prefixes
-        const words = text.split(/\s+/);
-        for (let len = words.length - 1; len >= 5; len--) { // Min 5 words
-            const prefix = words.slice(0, len).join(" ");
-            const key = this.generateKey(prefix, model);
-            if (this.entries.has(key)) {
-                const remaining = words.slice(len).join(" ");
-                return { cached: true, prefix, remaining };
-            }
-        }
-        return { cached: false };
-    }
-    /**
-     * Batch lookup for multiple texts
-     */
-    lookupBatch(texts, model) {
-        return texts.map(t => this.lookup(t, model));
-    }
-    /**
-     * Get cache statistics
-     */
-    getStats() {
-        const now = Date.now();
-        let oldest_age = 0;
-        let total_hits = 0;
-        for (const entry of this.entries.values()) {
-            total_hits += entry.hit_count;
-            const age = now - entry.last_used;
-            if (age > oldest_age)
-                oldest_age = age;
-        }
-        const total_requests = total_hits + this.entries.size; // Approximate
-        const hit_rate = total_requests > 0 ? total_hits / total_requests : 0;
-        return {
-            total_entries: this.entries.size,
-            total_hits: total_hits,
-            total_misses: this.entries.size, // Approximate
-            hit_rate,
-            memory_estimate_mb: this.getMemoryUsage(),
-            oldest_entry_age_ms: oldest_age
-        };
-    }
-    /**
-     * Get estimated memory usage
-     */
-    getMemoryUsage() {
-        let total_bytes = 0;
-        for (const entry of this.entries.values()) {
-            // Base entry overhead
-            total_bytes += 200;
-            // Prefix text
-            total_bytes += entry.prefix.length * 2;
-            // KV state (if stored)
-            if (entry.kv_state) {
-                total_bytes += entry.kv_state.length;
-            }
-            // Children map
-            total_bytes += entry.children.size * 50;
-        }
-        return total_bytes / (1024 * 1024);
-    }
-    /**
-     * Update LRU order
-     */
-    updateLRU(key) {
-        const index = this.access_order.indexOf(key);
-        if (index > -1) {
-            this.access_order.splice(index, 1);
-        }
-        this.access_order.push(key);
-    }
-    /**
-     * Evict least recently used entry
-     */
-    evictLRU() {
-        if (this.access_order.length === 0)
-            return false;
-        const lru_key = this.access_order.shift();
-        const entry = this.entries.get(lru_key);
-        if (entry) {
-            // If has children, re-parent them
-            for (const [child_key, child_cache_key] of entry.children) {
-                const child = this.entries.get(child_cache_key);
-                if (child) {
-                    // Promote child to standalone
-                    this.access_order.push(child_cache_key);
-                }
-            }
-            this.entries.delete(lru_key);
-            return true;
-        }
-        return false;
-    }
-    /**
-     * Clear all cache
-     */
-    clear() {
-        this.entries.clear();
-        this.access_order = [];
-    }
-    /**
-     * Invalidate entries matching pattern
-     */
-    invalidate(pattern) {
-        let count = 0;
-        if (!pattern) {
-            // Clear all
-            count = this.entries.size;
-            this.clear();
-            return count;
-        }
-        // Pattern-based invalidation
-        for (const [key, entry] of this.entries) {
-            if (entry.prefix.includes(pattern)) {
-                this.entries.delete(key);
-                count++;
-            }
-        }
-        return count;
-    }
-    /**
-     * Warm up cache with common system prompts
-     */
-    warmup(common_prefixes, model) {
-        for (const prefix of common_prefixes) {
-            this.store(prefix, { model });
-        }
-        console.log(`[PrefixCache] Warmed up with ${common_prefixes.length} common prefixes`);
-    }
-}
-exports.PrefixCache = PrefixCache;
-// Common system prompts that benefit from prefix caching
-const COMMON_SYSTEM_PROMPTS = [
-    "You are a helpful assistant.",
-    "You are a coding assistant. Help with programming tasks.",
-    "You are an expert data scientist.",
-    "You are a senior software engineer.",
-    "Analyze the following code and provide feedback.",
-    "Explain this concept in simple terms.",
-    "Write clean, well-documented code.",
-    "Think step by step and explain your reasoning."
-];
-exports.default = PrefixCache;
-// Utility function for creating pre-warmed cache
-function createWarmedCache() {
-    const cache = new PrefixCache({ max_entries: 5000 });
-    cache.warmup(COMMON_SYSTEM_PROMPTS);
-    return cache;
-}
-//# sourceMappingURL=prefixCache.js.map

package/tmlpd-pi-extension/dist/cache/prefixCache.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prefixCache.js","sourceRoot":"","sources":["../../src/cache/prefixCache.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAkWH,8CAIC;AAhVD,MAAa,WAAW;IACd,OAAO,GAA4B,IAAI,GAAG,EAAE,CAAC;IAC7C,YAAY,GAAa,EAAE,CAAC,CAAE,eAAe;IAC7C,WAAW,CAAS;IACpB,aAAa,CAAS;IAE9B,YAAY,OAGX;QACC,IAAI,CAAC,WAAW,GAAG,OAAO,EAAE,WAAW,IAAI,KAAK,CAAC;QACjD,IAAI,CAAC,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,GAAG,CAAC;IACrD,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,IAAY,EAAE,KAAc;QAC9C,kDAAkD;QAClD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/D,MAAM,GAAG,GAAG,GAAG,KAAK,IAAI,SAAS,IAAI,UAAU,EAAE,CAAC;QAElD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YACnC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAE,2BAA2B;QAClD,CAAC;QAED,OAAO,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,MAAc,EAAE,KAAc;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5C,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,MAAc,EAAE,KAAc;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEpC,IAAI,KAAK,EAAE,CAAC;YACV,aAAa;YACb,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACpB,KAAK,CAAC,SAAS,EAAE,CAAC;YAClB,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CACH,MAAc,EACd,OAKC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAErD,0BAA0B;QAC1B,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YACxC,QAAQ,CAAC,SAAS,EAAE,CAAC;YACrB,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAChC,OAAO,GAAG,CAAC;QACb,CAAC;QAED,kBAAkB;QAClB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;QAChE,MAAM,YAAY,GAAG,WAAW,GAAG,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAE,oBAAoB;QACtE,MAAM,SAAS,GAAG,YAAY,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;QAE/C,MAAM,KAAK,GAAe;YACxB,GAAG;YACH,MAAM,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,EAAG,kBAAkB;YACtD,QAAQ,EAAE,OAAO,EAAE,QAAQ;YAC3B,aAAa,EAAE,OAAO,EAAE,aAAa;YACrC,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,WAAW;YACX,QAAQ,EAAE,OAAO,EAAE,QAAQ,IAAI,IAAI,GAAG,EAAE;SACzC,CAAC;QAEF,qBAAqB;QACrB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,cAAc,EAAE,GAAG,SAAS,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YACvG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE5B,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACH,MAAM,CACJ,MAAc,EACd,UAAkB,EAClB,OAA4B;QAE5B,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAE5C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,iDAAiD;YACjD,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3D,CAAC;QAED,+CAA+C;QAC/C,MAAM,QAAQ,GAAG,MAAM,GAAG,UAAU,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAElE,uBAAuB;QACvB,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACpD,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;QAE/C,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,KAAa,EAAE,KAAa;QAC3C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAElC,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChE,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;gBACxD,aAAa,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClD,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAY,EAAE,KAAc;QACjC,wBAAwB;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChD,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAC1B,CAAC;QAED,qCAAqC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,KAAK,IAAI,GAAG,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAE,cAAc;YACjE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAE5C,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC7C,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,KAAe,EAAE,KAAc;QACzC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,UAAU,IAAI,KAAK,CAAC,SAAS,CAAC;YAC9B,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC;YAClC,IAAI,GAAG,GAAG,UAAU;gBAAE,UAAU,GAAG,GAAG,CAAC;QACzC,CAAC;QAED,MAAM,cAAc,GAAG,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAE,cAAc;QACtE,MAAM,QAAQ,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtE,OAAO;YACL,aAAa,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;YAChC,UAAU,EAAE,UAAU;YACtB,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAG,cAAc;YAChD,QAAQ;YACR,kBAAkB,EAAE,IAAI,CAAC,cAAc,EAAE;YACzC,mBAAmB,EAAE,UAAU;SAChC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,sBAAsB;YACtB,WAAW,IAAI,GAAG,CAAC;YAEnB,cAAc;YACd,WAAW,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAEvC,uBAAuB;YACvB,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnB,WAAW,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;YACvC,CAAC;YAED,eAAe;YACf,WAAW,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC;QAC1C,CAAC;QAED,OAAO,WAAW,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,GAAW;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACK,QAAQ;QACd,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAEjD,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAG,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAExC,IAAI,KAAK,EAAE,CAAC;YACV,kCAAkC;YAClC,KAAK,MAAM,CAAC,SAAS,EAAE,eAAe,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;gBAChD,IAAI,KAAK,EAAE,CAAC;oBACV,8BAA8B;oBAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;YAED,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,OAAgB;QACzB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,YAAY;YACZ,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO,KAAK,CAAC;QACf,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACzB,KAAK,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,eAAyB,EAAE,KAAc;QAC9C,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,gCAAgC,eAAe,CAAC,MAAM,kBAAkB,CAAC,CAAC;IACxF,CAAC;CACF;AA3TD,kCA2TC;AAED,yDAAyD;AACzD,MAAM,qBAAqB,GAAG;IAC5B,8BAA8B;IAC9B,0DAA0D;IAC1D,mCAAmC;IACnC,qCAAqC;IACrC,kDAAkD;IAClD,uCAAuC;IACvC,oCAAoC;IACpC,gDAAgD;CACjD,CAAC;AAEF,kBAAe,WAAW,CAAC;AAE3B,iDAAiD;AACjD,SAAgB,iBAAiB;IAC/B,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;IACrD,KAAK,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;IACpC,OAAO,KAAK,CAAC;AACf,CAAC"}

package/tmlpd-pi-extension/dist/cache/responseCache.d.ts

@@ -1,58 +0,0 @@
-/**
- * TMLPD Response Cache
- *
- * Caches LLM responses to avoid redundant API calls.
- * Uses content hash for cache key and supports TTL.
- */
-export interface CacheEntry {
-    content: string;
-    model: string;
-    provider: string;
-    tokens: number;
-    cost: number;
-    cached_at: number;
-    expires_at: number;
-}
-export interface CacheConfig {
-    enabled: boolean;
-    ttl_seconds: number;
-    max_entries: number;
-    cache_dir?: string;
-}
-export declare class ResponseCache {
-    private cache;
-    private config;
-    private hits;
-    private misses;
-    constructor(config?: Partial<CacheConfig>);
-    /**
-     * Generate cache key from prompt + model
-     */
-    generateKey(prompt: string, model: string): string;
-    /**
-     * Get cached response if available and not expired
-     */
-    get(prompt: string, model: string): CacheEntry | null;
-    /**
-     * Store response in cache
-     */
-    set(prompt: string, model: string, response: Partial<CacheEntry>): void;
-    /**
-     * Invalidate cache for specific model or all
-     */
-    invalidate(model?: string): void;
-    /**
-     * Get cache statistics
-     */
-    getStats(): {
-        hits: number;
-        misses: number;
-        size: number;
-        hit_rate: number;
-    };
-    /**
-     * Evict oldest entry by cached_at timestamp
-     */
-    private evictOldest;
-}
-//# sourceMappingURL=responseCache.d.ts.map

package/tmlpd-pi-extension/dist/cache/responseCache.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"responseCache.d.ts","sourceRoot":"","sources":["../../src/cache/responseCache.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,KAAK,CAAsC;IACnD,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,IAAI,CAAK;IACjB,OAAO,CAAC,MAAM,CAAK;gBAEP,MAAM,GAAE,OAAO,CAAC,WAAW,CAAM;IAS7C;;OAEG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAMlD;;OAEG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI;IAsBrD;;OAEG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,IAAI;IAsBvE;;OAEG;IACH,UAAU,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI;IAYhC;;OAEG;IACH,QAAQ,IAAI;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE;IAU5E;;OAEG;IACH,OAAO,CAAC,WAAW;CAepB"}