@od-oneapp/ai-platform 0.1.0

package/dist/caching-strategies.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"caching-strategies.mjs","names":[],"sources":["../src/caching/strategies/index.ts"],"sourcesContent":["/**\n * @fileoverview Pluggable cache eviction strategies (LRU, LFU, TTL, FIFO, Adaptive).\n * @module @od-oneapp/ai-platform/caching/strategies\n *\n * Pluggable eviction strategies for cache management:\n * - LRU (Least Recently Used) - evicts least recently accessed items\n * - LFU (Least Frequently Used) - evicts least frequently accessed items\n * - TTL (Time To Live) - evicts items after expiration\n * - FIFO (First In First Out) - evicts oldest items first\n * - Adaptive - dynamically switches between strategies based on access patterns\n *\n * @module @od-oneapp/ai-platform/caching/strategies\n *\n * @example\n * ```typescript\n * import { createLRUStrategy, createAdaptiveStrategy } from '@od-oneapp/ai-platform/caching/strategies';\n *\n * // LRU with max 1000 items\n * const lru = createLRUStrategy({ maxSize: 1000 });\n * lru.set('key1', 'value1');\n * const val = lru.get('key1'); // Updates access time\n *\n * // Adaptive strategy\n * const adaptive = createAdaptiveStrategy({ maxSize: 1000 });\n * ```\n */\n\n// -----------------------------------------------------------------------------\n// Types\n// -----------------------------------------------------------------------------\n\n/** Eviction strategy type */\nexport type EvictionStrategy = 'lru' | 'lfu' | 'ttl' | 'fifo' | 'adaptive';\n\n/** Base strategy configuration */\nexport interface StrategyConfig {\n  /** Maximum number of items */\n  maxSize: number;\n  /** Default TTL in milliseconds (for TTL strategy) */\n  defaultTtlMs?: number;\n  /** Callback when item is evicted */\n  onEvict?: (key: string, value: unknown) => void;\n}\n\n/** Cache entry metadata */\nexport interface CacheEntryMeta {\n  /** When the entry was created */\n  createdAt: number;\n  /** When the entry was last accessed */\n  lastAccessedAt: number;\n  /** Number of times accessed */\n  accessCount: number;\n  /** When the entry expires (if TTL set) */\n  expiresAt?: number;\n  /** Size estimate in bytes */\n  sizeBytes?: number;\n}\n\n/** Cache entry with metadata */\nexport interface CacheEntry<T = unknown> {\n  key: string;\n  value: T;\n  meta: CacheEntryMeta;\n}\n\n/** Strategy statistics */\nexport interface StrategyStats {\n  hits: number;\n  misses: number;\n  evictions: number;\n  currentSize: number;\n  maxSize: number;\n  hitRate: number;\n}\n\n/** Eviction strategy interface */\nexport interface CacheEvictionStrategy<T = unknown> {\n  /** Get item from cache */\n  get(key: string): T | undefined;\n  /** Set item in cache */\n  set(key: string, value: T, ttlMs?: number): void;\n  /** Check if key exists */\n  has(key: string): boolean;\n  /** Delete item from cache */\n  delete(key: string): boolean;\n  /** Clear all items */\n  clear(): void;\n  /** Get current size */\n  size(): number;\n  /** Get all keys */\n  keys(): string[];\n  /** Get statistics */\n  stats(): StrategyStats;\n  /** Peek at value without updating access */\n  peek(key: string): T | undefined;\n  /** Peek at full entry with metadata without updating access */\n  peekEntry?(key: string): CacheEntry<T> | undefined;\n}\n\n// -----------------------------------------------------------------------------\n// LRU Strategy Implementation\n// -----------------------------------------------------------------------------\n\n/**\n * Create an LRU (Least Recently Used) eviction strategy.\n * Evicts the least recently accessed items when capacity is reached.\n *\n * @example\n * ```typescript\n * const cache = createLRUStrategy<string>({ maxSize: 100 });\n * cache.set('user:1', 'Alice');\n * cache.get('user:1'); // Returns 'Alice', updates access time\n * ```\n */\nexport function createLRUStrategy<T = unknown>(config: StrategyConfig): CacheEvictionStrategy<T> {\n  const { maxSize, defaultTtlMs, onEvict } = config;\n\n  const cache = new Map<string, CacheEntry<T>>();\n  let hits = 0;\n  let misses = 0;\n  let evictions = 0;\n\n  function evictExpired(): void {\n    const now = Date.now();\n    for (const [key, entry] of cache) {\n      if (entry.meta.expiresAt && now > entry.meta.expiresAt) {\n        cache.delete(key);\n        onEvict?.(key, entry.value);\n        evictions++;\n      }\n    }\n  }\n\n  function evictLRU(): void {\n    if (cache.size === 0) return;\n\n    let oldestKey: string | null = null;\n    let oldestTime = Infinity;\n\n    for (const [key, entry] of cache) {\n      if (entry.meta.lastAccessedAt < oldestTime) {\n        oldestTime = entry.meta.lastAccessedAt;\n        oldestKey = key;\n      }\n    }\n\n    if (oldestKey) {\n      const entry = cache.get(oldestKey);\n      cache.delete(oldestKey);\n      if (entry) onEvict?.(oldestKey, entry.value);\n      evictions++;\n    }\n  }\n\n  function get(key: string): T | undefined {\n    evictExpired();\n\n    const entry = cache.get(key);\n    if (!entry) {\n      misses++;\n      return undefined;\n    }\n\n    // Check expiration\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      cache.delete(key);\n      onEvict?.(key, entry.value);\n      evictions++;\n      misses++;\n      return undefined;\n    }\n\n    // Update access metadata\n    entry.meta.lastAccessedAt = Date.now();\n    entry.meta.accessCount++;\n    hits++;\n\n    // Move to end (most recently used) by re-inserting\n    cache.delete(key);\n    cache.set(key, entry);\n\n    return entry.value;\n  }\n\n  function set(key: string, value: T, ttlMs?: number): void {\n    evictExpired();\n\n    // Evict if at capacity and key is new\n    if (!cache.has(key) && cache.size >= maxSize) {\n      evictLRU();\n    }\n\n    const now = Date.now();\n    const effectiveTtl = ttlMs ?? defaultTtlMs;\n\n    const entry: CacheEntry<T> = {\n      key,\n      value,\n      meta: {\n        createdAt: now,\n        lastAccessedAt: now,\n        accessCount: 1,\n        expiresAt: effectiveTtl ? now + effectiveTtl : undefined,\n      },\n    };\n\n    // Delete first to ensure it goes to end\n    cache.delete(key);\n    cache.set(key, entry);\n  }\n\n  function has(key: string): boolean {\n    const entry = cache.get(key);\n    if (!entry) return false;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      cache.delete(key);\n      onEvict?.(key, entry.value);\n      return false;\n    }\n    return true;\n  }\n\n  function del(key: string): boolean {\n    const entry = cache.get(key);\n    if (entry) {\n      cache.delete(key);\n      return true;\n    }\n    return false;\n  }\n\n  function clear(): void {\n    cache.clear();\n  }\n\n  function size(): number {\n    evictExpired();\n    return cache.size;\n  }\n\n  function keys(): string[] {\n    evictExpired();\n    return Array.from(cache.keys());\n  }\n\n  function stats(): StrategyStats {\n    const total = hits + misses;\n    return {\n      hits,\n      misses,\n      evictions,\n      currentSize: cache.size,\n      maxSize,\n      hitRate: total > 0 ? hits / total : 0,\n    };\n  }\n\n  function peek(key: string): T | undefined {\n    const entry = cache.get(key);\n    if (!entry) return undefined;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      return undefined;\n    }\n    return entry.value;\n  }\n\n  function peekEntry(key: string): CacheEntry<T> | undefined {\n    const entry = cache.get(key);\n    if (!entry) return undefined;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      return undefined;\n    }\n    return entry;\n  }\n\n  return { get, set, has, delete: del, clear, size, keys, stats, peek, peekEntry };\n}\n\n// -----------------------------------------------------------------------------\n// LFU Strategy Implementation\n// -----------------------------------------------------------------------------\n\n/**\n * Create an LFU (Least Frequently Used) eviction strategy.\n * Evicts the least frequently accessed items when capacity is reached.\n *\n * @example\n * ```typescript\n * const cache = createLFUStrategy<string>({ maxSize: 100 });\n * cache.set('popular', 'data');\n * cache.get('popular'); // Increases frequency\n * cache.get('popular'); // Now won't be evicted easily\n * ```\n */\nexport function createLFUStrategy<T = unknown>(config: StrategyConfig): CacheEvictionStrategy<T> {\n  const { maxSize, defaultTtlMs, onEvict } = config;\n\n  const cache = new Map<string, CacheEntry<T>>();\n  let hits = 0;\n  let misses = 0;\n  let evictions = 0;\n\n  function evictExpired(): void {\n    const now = Date.now();\n    for (const [key, entry] of cache) {\n      if (entry.meta.expiresAt && now > entry.meta.expiresAt) {\n        cache.delete(key);\n        onEvict?.(key, entry.value);\n        evictions++;\n      }\n    }\n  }\n\n  function evictLFU(): void {\n    if (cache.size === 0) return;\n\n    let lfuKey: string | null = null;\n    let minFreq = Infinity;\n    let oldestTime = Infinity;\n\n    for (const [key, entry] of cache) {\n      // Find lowest frequency, break ties by oldest access time\n      if (\n        entry.meta.accessCount < minFreq ||\n        (entry.meta.accessCount === minFreq && entry.meta.lastAccessedAt < oldestTime)\n      ) {\n        minFreq = entry.meta.accessCount;\n        oldestTime = entry.meta.lastAccessedAt;\n        lfuKey = key;\n      }\n    }\n\n    if (lfuKey) {\n      const entry = cache.get(lfuKey);\n      cache.delete(lfuKey);\n      if (entry) onEvict?.(lfuKey, entry.value);\n      evictions++;\n    }\n  }\n\n  function get(key: string): T | undefined {\n    evictExpired();\n\n    const entry = cache.get(key);\n    if (!entry) {\n      misses++;\n      return undefined;\n    }\n\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      cache.delete(key);\n      onEvict?.(key, entry.value);\n      evictions++;\n      misses++;\n      return undefined;\n    }\n\n    entry.meta.lastAccessedAt = Date.now();\n    entry.meta.accessCount++;\n    hits++;\n\n    return entry.value;\n  }\n\n  function set(key: string, value: T, ttlMs?: number): void {\n    evictExpired();\n\n    if (!cache.has(key) && cache.size >= maxSize) {\n      evictLFU();\n    }\n\n    const now = Date.now();\n    const effectiveTtl = ttlMs ?? defaultTtlMs;\n\n    const existing = cache.get(key);\n    const entry: CacheEntry<T> = {\n      key,\n      value,\n      meta: {\n        createdAt: existing?.meta.createdAt ?? now,\n        lastAccessedAt: now,\n        accessCount: existing ? existing.meta.accessCount + 1 : 1,\n        expiresAt: effectiveTtl ? now + effectiveTtl : undefined,\n      },\n    };\n\n    cache.set(key, entry);\n  }\n\n  function has(key: string): boolean {\n    const entry = cache.get(key);\n    if (!entry) return false;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      cache.delete(key);\n      onEvict?.(key, entry.value);\n      return false;\n    }\n    return true;\n  }\n\n  function del(key: string): boolean {\n    return cache.delete(key);\n  }\n\n  function clear(): void {\n    cache.clear();\n  }\n\n  function size(): number {\n    evictExpired();\n    return cache.size;\n  }\n\n  function keys(): string[] {\n    evictExpired();\n    return Array.from(cache.keys());\n  }\n\n  function stats(): StrategyStats {\n    const total = hits + misses;\n    return {\n      hits,\n      misses,\n      evictions,\n      currentSize: cache.size,\n      maxSize,\n      hitRate: total > 0 ? hits / total : 0,\n    };\n  }\n\n  function peek(key: string): T | undefined {\n    const entry = cache.get(key);\n    if (!entry) return undefined;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      return undefined;\n    }\n    return entry.value;\n  }\n\n  function peekEntry(key: string): CacheEntry<T> | undefined {\n    const entry = cache.get(key);\n    if (!entry) return undefined;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      return undefined;\n    }\n    return entry;\n  }\n\n  return { get, set, has, delete: del, clear, size, keys, stats, peek, peekEntry };\n}\n\n// -----------------------------------------------------------------------------\n// FIFO Strategy Implementation\n// -----------------------------------------------------------------------------\n\n/**\n * Create a FIFO (First In First Out) eviction strategy.\n * Evicts the oldest items first when capacity is reached.\n *\n * @example\n * ```typescript\n * const cache = createFIFOStrategy<string>({ maxSize: 100 });\n * cache.set('first', 'data'); // Will be evicted first\n * cache.set('second', 'data');\n * ```\n */\nexport function createFIFOStrategy<T = unknown>(config: StrategyConfig): CacheEvictionStrategy<T> {\n  const { maxSize, defaultTtlMs, onEvict } = config;\n\n  const cache = new Map<string, CacheEntry<T>>();\n  let hits = 0;\n  let misses = 0;\n  let evictions = 0;\n\n  function evictExpired(): void {\n    const now = Date.now();\n    for (const [key, entry] of cache) {\n      if (entry.meta.expiresAt && now > entry.meta.expiresAt) {\n        cache.delete(key);\n        onEvict?.(key, entry.value);\n        evictions++;\n      }\n    }\n  }\n\n  function evictFIFO(): void {\n    if (cache.size === 0) return;\n\n    // Map maintains insertion order, first key is oldest\n    const firstKey = cache.keys().next().value;\n    if (firstKey) {\n      const entry = cache.get(firstKey);\n      cache.delete(firstKey);\n      if (entry) onEvict?.(firstKey, entry.value);\n      evictions++;\n    }\n  }\n\n  function get(key: string): T | undefined {\n    evictExpired();\n\n    const entry = cache.get(key);\n    if (!entry) {\n      misses++;\n      return undefined;\n    }\n\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      cache.delete(key);\n      onEvict?.(key, entry.value);\n      evictions++;\n      misses++;\n      return undefined;\n    }\n\n    entry.meta.lastAccessedAt = Date.now();\n    entry.meta.accessCount++;\n    hits++;\n\n    // FIFO doesn't reorder on access\n    return entry.value;\n  }\n\n  function set(key: string, value: T, ttlMs?: number): void {\n    evictExpired();\n\n    if (!cache.has(key) && cache.size >= maxSize) {\n      evictFIFO();\n    }\n\n    const now = Date.now();\n    const effectiveTtl = ttlMs ?? defaultTtlMs;\n\n    // For FIFO, we don't want to update position of existing keys\n    const existing = cache.get(key);\n    const entry: CacheEntry<T> = {\n      key,\n      value,\n      meta: {\n        createdAt: existing?.meta.createdAt ?? now,\n        lastAccessedAt: now,\n        accessCount: existing ? existing.meta.accessCount + 1 : 1,\n        expiresAt: effectiveTtl ? now + effectiveTtl : undefined,\n      },\n    };\n\n    if (existing) {\n      // Update in place\n      cache.set(key, entry);\n    } else {\n      // New entry goes to end\n      cache.set(key, entry);\n    }\n  }\n\n  function has(key: string): boolean {\n    const entry = cache.get(key);\n    if (!entry) return false;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      cache.delete(key);\n      onEvict?.(key, entry.value);\n      return false;\n    }\n    return true;\n  }\n\n  function del(key: string): boolean {\n    return cache.delete(key);\n  }\n\n  function clear(): void {\n    cache.clear();\n  }\n\n  function size(): number {\n    evictExpired();\n    return cache.size;\n  }\n\n  function keys(): string[] {\n    evictExpired();\n    return Array.from(cache.keys());\n  }\n\n  function stats(): StrategyStats {\n    const total = hits + misses;\n    return {\n      hits,\n      misses,\n      evictions,\n      currentSize: cache.size,\n      maxSize,\n      hitRate: total > 0 ? hits / total : 0,\n    };\n  }\n\n  function peek(key: string): T | undefined {\n    const entry = cache.get(key);\n    if (!entry) return undefined;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      return undefined;\n    }\n    return entry.value;\n  }\n\n  function peekEntry(key: string): CacheEntry<T> | undefined {\n    const entry = cache.get(key);\n    if (!entry) return undefined;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      return undefined;\n    }\n    return entry;\n  }\n\n  return { get, set, has, delete: del, clear, size, keys, stats, peek, peekEntry };\n}\n\n// -----------------------------------------------------------------------------\n// TTL Strategy Implementation\n// -----------------------------------------------------------------------------\n\n/**\n * Create a TTL (Time To Live) eviction strategy.\n * Items automatically expire after their TTL.\n *\n * @example\n * ```typescript\n * const cache = createTTLStrategy<string>({\n *   maxSize: 1000,\n *   defaultTtlMs: 60000 // 1 minute default\n * });\n * cache.set('temp', 'data', 5000); // Expires in 5 seconds\n * ```\n */\nexport function createTTLStrategy<T = unknown>(config: StrategyConfig): CacheEvictionStrategy<T> {\n  const { maxSize, defaultTtlMs = 60000, onEvict } = config;\n\n  const cache = new Map<string, CacheEntry<T>>();\n  let hits = 0;\n  let misses = 0;\n  let evictions = 0;\n\n  function evictExpired(): number {\n    const now = Date.now();\n    let count = 0;\n    for (const [key, entry] of cache) {\n      if (entry.meta.expiresAt && now > entry.meta.expiresAt) {\n        cache.delete(key);\n        onEvict?.(key, entry.value);\n        evictions++;\n        count++;\n      }\n    }\n    return count;\n  }\n\n  function evictOldest(): void {\n    if (cache.size === 0) return;\n\n    let oldestKey: string | null = null;\n    let oldestExpiry = Infinity;\n\n    for (const [key, entry] of cache) {\n      const expiry = entry.meta.expiresAt ?? entry.meta.createdAt;\n      if (expiry < oldestExpiry) {\n        oldestExpiry = expiry;\n        oldestKey = key;\n      }\n    }\n\n    if (oldestKey) {\n      const entry = cache.get(oldestKey);\n      cache.delete(oldestKey);\n      if (entry) onEvict?.(oldestKey, entry.value);\n      evictions++;\n    }\n  }\n\n  function get(key: string): T | undefined {\n    evictExpired();\n\n    const entry = cache.get(key);\n    if (!entry) {\n      misses++;\n      return undefined;\n    }\n\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      cache.delete(key);\n      onEvict?.(key, entry.value);\n      evictions++;\n      misses++;\n      return undefined;\n    }\n\n    entry.meta.lastAccessedAt = Date.now();\n    entry.meta.accessCount++;\n    hits++;\n\n    return entry.value;\n  }\n\n  function set(key: string, value: T, ttlMs?: number): void {\n    evictExpired();\n\n    if (!cache.has(key) && cache.size >= maxSize) {\n      evictOldest();\n    }\n\n    const now = Date.now();\n    const effectiveTtl = ttlMs ?? defaultTtlMs;\n\n    const entry: CacheEntry<T> = {\n      key,\n      value,\n      meta: {\n        createdAt: now,\n        lastAccessedAt: now,\n        accessCount: 1,\n        expiresAt: now + effectiveTtl,\n      },\n    };\n\n    cache.set(key, entry);\n  }\n\n  function has(key: string): boolean {\n    const entry = cache.get(key);\n    if (!entry) return false;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      cache.delete(key);\n      onEvict?.(key, entry.value);\n      return false;\n    }\n    return true;\n  }\n\n  function del(key: string): boolean {\n    return cache.delete(key);\n  }\n\n  function clear(): void {\n    cache.clear();\n  }\n\n  function size(): number {\n    evictExpired();\n    return cache.size;\n  }\n\n  function keys(): string[] {\n    evictExpired();\n    return Array.from(cache.keys());\n  }\n\n  function stats(): StrategyStats {\n    const total = hits + misses;\n    return {\n      hits,\n      misses,\n      evictions,\n      currentSize: cache.size,\n      maxSize,\n      hitRate: total > 0 ? hits / total : 0,\n    };\n  }\n\n  function peek(key: string): T | undefined {\n    const entry = cache.get(key);\n    if (!entry) return undefined;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      return undefined;\n    }\n    return entry.value;\n  }\n\n  function peekEntry(key: string): CacheEntry<T> | undefined {\n    const entry = cache.get(key);\n    if (!entry) return undefined;\n    if (entry.meta.expiresAt && Date.now() > entry.meta.expiresAt) {\n      return undefined;\n    }\n    return entry;\n  }\n\n  return { get, set, has, delete: del, clear, size, keys, stats, peek, peekEntry };\n}\n\n// -----------------------------------------------------------------------------\n// Adaptive Strategy Implementation\n// -----------------------------------------------------------------------------\n\n/** Adaptive strategy configuration */\nexport interface AdaptiveStrategyConfig extends StrategyConfig {\n  /** Window size for measuring access patterns */\n  analysisWindowMs?: number;\n  /** How often to analyze and potentially switch strategies */\n  analysisIntervalMs?: number;\n}\n\n/**\n * Create an Adaptive eviction strategy.\n * Dynamically switches between LRU and LFU based on access patterns.\n *\n * @example\n * ```typescript\n * const cache = createAdaptiveStrategy<string>({\n *   maxSize: 1000,\n *   analysisWindowMs: 60000 // Analyze every minute\n * });\n * ```\n */\nexport function createAdaptiveStrategy<T = unknown>(\n  config: AdaptiveStrategyConfig,\n): CacheEvictionStrategy<T> {\n  const {\n    maxSize,\n    defaultTtlMs,\n    onEvict,\n    analysisWindowMs = 60000,\n    analysisIntervalMs = 10000,\n  } = config;\n\n  // Start with LRU\n  let currentStrategy: 'lru' | 'lfu' = 'lru';\n  const lruCache = createLRUStrategy<T>({ maxSize, defaultTtlMs, onEvict });\n  const lfuCache = createLFUStrategy<T>({ maxSize, defaultTtlMs, onEvict });\n  let activeCache = lruCache;\n\n  // Access pattern tracking\n  const accessLog: Array<{ key: string; time: number }> = [];\n  let lastAnalysis = Date.now();\n\n  function analyzePatterns(): void {\n    const now = Date.now();\n    if (now - lastAnalysis < analysisIntervalMs) return;\n    lastAnalysis = now;\n\n    // Filter to window\n    const windowStart = now - analysisWindowMs;\n    const recentAccesses = accessLog.filter(a => a.time >= windowStart);\n\n    if (recentAccesses.length < 10) return; // Not enough data\n\n    // Count frequency of each key\n    const keyCounts = new Map<string, number>();\n    for (const access of recentAccesses) {\n      keyCounts.set(access.key, (keyCounts.get(access.key) ?? 0) + 1);\n    }\n\n    // Calculate skewness - how concentrated are accesses?\n    const counts = Array.from(keyCounts.values());\n    const total = counts.reduce((a, b) => a + b, 0);\n    const mean = total / counts.length;\n    const variance = counts.reduce((sum, c) => sum + Math.pow(c - mean, 2), 0) / counts.length;\n    const stdDev = Math.sqrt(variance);\n    const coefficientOfVariation = mean > 0 ? stdDev / mean : 0;\n\n    // High CV = skewed access (few hot keys) = prefer LFU\n    // Low CV = uniform access = prefer LRU\n    const shouldUseLFU = coefficientOfVariation > 1.5;\n\n    if (shouldUseLFU && currentStrategy !== 'lfu') {\n      // Switch to LFU - migrate data preserving per-entry TTLs\n      const entries = lruCache\n        .keys()\n        .map(k => lruCache.peekEntry?.(k))\n        .filter((e): e is CacheEntry<T> => e !== undefined);\n      lfuCache.clear();\n      for (const entry of entries) {\n        // Calculate remaining TTL to preserve per-entry expiration\n        const remainingTtlMs = entry.meta.expiresAt\n          ? Math.max(0, entry.meta.expiresAt - now)\n          : undefined;\n        // Only migrate non-expired entries\n        if (remainingTtlMs === undefined || remainingTtlMs > 0) {\n          lfuCache.set(entry.key, entry.value, remainingTtlMs);\n        }\n      }\n      // Clear source cache to avoid memory duplication\n      lruCache.clear();\n      activeCache = lfuCache;\n      currentStrategy = 'lfu';\n    } else if (!shouldUseLFU && currentStrategy !== 'lru') {\n      // Switch to LRU - migrate data preserving per-entry TTLs\n      const entries = lfuCache\n        .keys()\n        .map(k => lfuCache.peekEntry?.(k))\n        .filter((e): e is CacheEntry<T> => e !== undefined);\n      lruCache.clear();\n      for (const entry of entries) {\n        // Calculate remaining TTL to preserve per-entry expiration\n        const remainingTtlMs = entry.meta.expiresAt\n          ? Math.max(0, entry.meta.expiresAt - now)\n          : undefined;\n        // Only migrate non-expired entries\n        if (remainingTtlMs === undefined || remainingTtlMs > 0) {\n          lruCache.set(entry.key, entry.value, remainingTtlMs);\n        }\n      }\n      // Clear source cache to avoid memory duplication\n      lfuCache.clear();\n      activeCache = lruCache;\n      currentStrategy = 'lru';\n    }\n\n    // Trim access log - remove old entries and cap max length to prevent memory spikes\n    const maxLogLength = 10000;\n    while (accessLog.length > 0 && (accessLog[0]?.time ?? 0) < windowStart) {\n      accessLog.shift();\n    }\n    // Hard cap to prevent unbounded growth under high QPS\n    if (accessLog.length > maxLogLength) {\n      accessLog.splice(0, accessLog.length - maxLogLength);\n    }\n  }\n\n  function get(key: string): T | undefined {\n    analyzePatterns();\n    // Cap accessLog length on push to prevent memory spikes under high QPS\n    if (accessLog.length >= 10000) {\n      accessLog.shift();\n    }\n    accessLog.push({ key, time: Date.now() });\n    return activeCache.get(key);\n  }\n\n  function set(key: string, value: T, ttlMs?: number): void {\n    analyzePatterns();\n    activeCache.set(key, value, ttlMs);\n  }\n\n  function has(key: string): boolean {\n    return activeCache.has(key);\n  }\n\n  function del(key: string): boolean {\n    // Delete from both to be safe\n    lruCache.delete(key);\n    lfuCache.delete(key);\n    return activeCache.delete(key);\n  }\n\n  function clear(): void {\n    lruCache.clear();\n    lfuCache.clear();\n    accessLog.length = 0;\n  }\n\n  function size(): number {\n    return activeCache.size();\n  }\n\n  function keys(): string[] {\n    return activeCache.keys();\n  }\n\n  function stats(): StrategyStats {\n    const baseStats = activeCache.stats();\n    return {\n      ...baseStats,\n      // Could add strategy-specific stats here\n    };\n  }\n\n  function peek(key: string): T | undefined {\n    return activeCache.peek(key);\n  }\n\n  function peekEntry(key: string): CacheEntry<T> | undefined {\n    return activeCache.peekEntry?.(key);\n  }\n\n  return { get, set, has, delete: del, clear, size, keys, stats, peek, peekEntry };\n}\n\n// -----------------------------------------------------------------------------\n// Factory Function\n// -----------------------------------------------------------------------------\n\n/**\n * Create a cache strategy by type.\n *\n * @example\n * ```typescript\n * const cache = createCacheStrategy('lru', { maxSize: 1000 });\n * const adaptiveCache = createCacheStrategy('adaptive', { maxSize: 1000 });\n * ```\n */\nexport function createCacheStrategy<T = unknown>(\n  strategy: EvictionStrategy,\n  config: StrategyConfig | AdaptiveStrategyConfig,\n): CacheEvictionStrategy<T> {\n  switch (strategy) {\n    case 'lru':\n      return createLRUStrategy<T>(config);\n    case 'lfu':\n      return createLFUStrategy<T>(config);\n    case 'fifo':\n      return createFIFOStrategy<T>(config);\n    case 'ttl':\n      return createTTLStrategy<T>(config);\n    case 'adaptive':\n      return createAdaptiveStrategy<T>(config as AdaptiveStrategyConfig);\n    default:\n      throw new Error(`Unknown cache strategy: ${strategy}`);\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAkHA,SAAgB,kBAA+B,QAAkD;CAC/F,MAAM,EAAE,SAAS,cAAc,YAAY;CAE3C,MAAM,wBAAQ,IAAI,KAA4B;CAC9C,IAAI,OAAO;CACX,IAAI,SAAS;CACb,IAAI,YAAY;CAEhB,SAAS,eAAqB;EAC5B,MAAM,MAAM,KAAK,KAAK;AACtB,OAAK,MAAM,CAAC,KAAK,UAAU,MACzB,KAAI,MAAM,KAAK,aAAa,MAAM,MAAM,KAAK,WAAW;AACtD,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B;;;CAKN,SAAS,WAAiB;AACxB,MAAI,MAAM,SAAS,EAAG;EAEtB,IAAI,YAA2B;EAC/B,IAAI,aAAa;AAEjB,OAAK,MAAM,CAAC,KAAK,UAAU,MACzB,KAAI,MAAM,KAAK,iBAAiB,YAAY;AAC1C,gBAAa,MAAM,KAAK;AACxB,eAAY;;AAIhB,MAAI,WAAW;GACb,MAAM,QAAQ,MAAM,IAAI,UAAU;AAClC,SAAM,OAAO,UAAU;AACvB,OAAI,MAAO,WAAU,WAAW,MAAM,MAAM;AAC5C;;;CAIJ,SAAS,IAAI,KAA4B;AACvC,gBAAc;EAEd,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,OAAO;AACV;AACA;;AAIF,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,WAAW;AAC7D,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B;AACA;AACA;;AAIF,QAAM,KAAK,iBAAiB,KAAK,KAAK;AACtC,QAAM,KAAK;AACX;AAGA,QAAM,OAAO,IAAI;AACjB,QAAM,IAAI,KAAK,MAAM;AAErB,SAAO,MAAM;;CAGf,SAAS,IAAI,KAAa,OAAU,OAAsB;AACxD,gBAAc;AAGd,MAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,QAAQ,QACnC,WAAU;EAGZ,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,eAAe,SAAS;EAE9B,MAAM,QAAuB;GAC3B;GACA;GACA,MAAM;IACJ,WAAW;IACX,gBAAgB;IAChB,aAAa;IACb,WAAW,eAAe,MAAM,eAAe;IAChD;GACF;AAGD,QAAM,OAAO,IAAI;AACjB,QAAM,IAAI,KAAK,MAAM;;CAGvB,SAAS,IAAI,KAAsB;EACjC,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,WAAW;AAC7D,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B,UAAO;;AAET,SAAO;;CAGT,SAAS,IAAI,KAAsB;AAEjC,MADc,MAAM,IAAI,IAAI,EACjB;AACT,SAAM,OAAO,IAAI;AACjB,UAAO;;AAET,SAAO;;CAGT,SAAS,QAAc;AACrB,QAAM,OAAO;;CAGf,SAAS,OAAe;AACtB,gBAAc;AACd,SAAO,MAAM;;CAGf,SAAS,OAAiB;AACxB,gBAAc;AACd,SAAO,MAAM,KAAK,MAAM,MAAM,CAAC;;CAGjC,SAAS,QAAuB;EAC9B,MAAM,QAAQ,OAAO;AACrB,SAAO;GACL;GACA;GACA;GACA,aAAa,MAAM;GACnB;GACA,SAAS,QAAQ,IAAI,OAAO,QAAQ;GACrC;;CAGH,SAAS,KAAK,KAA4B;EACxC,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,UAClD;AAEF,SAAO,MAAM;;CAGf,SAAS,UAAU,KAAwC;EACzD,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,UAClD;AAEF,SAAO;;AAGT,QAAO;EAAE;EAAK;EAAK;EAAK,QAAQ;EAAK;EAAO;EAAM;EAAM;EAAO;EAAM;EAAW;;;;;;;;;;;;;;AAmBlF,SAAgB,kBAA+B,QAAkD;CAC/F,MAAM,EAAE,SAAS,cAAc,YAAY;CAE3C,MAAM,wBAAQ,IAAI,KAA4B;CAC9C,IAAI,OAAO;CACX,IAAI,SAAS;CACb,IAAI,YAAY;CAEhB,SAAS,eAAqB;EAC5B,MAAM,MAAM,KAAK,KAAK;AACtB,OAAK,MAAM,CAAC,KAAK,UAAU,MACzB,KAAI,MAAM,KAAK,aAAa,MAAM,MAAM,KAAK,WAAW;AACtD,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B;;;CAKN,SAAS,WAAiB;AACxB,MAAI,MAAM,SAAS,EAAG;EAEtB,IAAI,SAAwB;EAC5B,IAAI,UAAU;EACd,IAAI,aAAa;AAEjB,OAAK,MAAM,CAAC,KAAK,UAAU,MAEzB,KACE,MAAM,KAAK,cAAc,WACxB,MAAM,KAAK,gBAAgB,WAAW,MAAM,KAAK,iBAAiB,YACnE;AACA,aAAU,MAAM,KAAK;AACrB,gBAAa,MAAM,KAAK;AACxB,YAAS;;AAIb,MAAI,QAAQ;GACV,MAAM,QAAQ,MAAM,IAAI,OAAO;AAC/B,SAAM,OAAO,OAAO;AACpB,OAAI,MAAO,WAAU,QAAQ,MAAM,MAAM;AACzC;;;CAIJ,SAAS,IAAI,KAA4B;AACvC,gBAAc;EAEd,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,OAAO;AACV;AACA;;AAGF,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,WAAW;AAC7D,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B;AACA;AACA;;AAGF,QAAM,KAAK,iBAAiB,KAAK,KAAK;AACtC,QAAM,KAAK;AACX;AAEA,SAAO,MAAM;;CAGf,SAAS,IAAI,KAAa,OAAU,OAAsB;AACxD,gBAAc;AAEd,MAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,QAAQ,QACnC,WAAU;EAGZ,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,eAAe,SAAS;EAE9B,MAAM,WAAW,MAAM,IAAI,IAAI;EAC/B,MAAM,QAAuB;GAC3B;GACA;GACA,MAAM;IACJ,WAAW,UAAU,KAAK,aAAa;IACvC,gBAAgB;IAChB,aAAa,WAAW,SAAS,KAAK,cAAc,IAAI;IACxD,WAAW,eAAe,MAAM,eAAe;IAChD;GACF;AAED,QAAM,IAAI,KAAK,MAAM;;CAGvB,SAAS,IAAI,KAAsB;EACjC,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,WAAW;AAC7D,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B,UAAO;;AAET,SAAO;;CAGT,SAAS,IAAI,KAAsB;AACjC,SAAO,MAAM,OAAO,IAAI;;CAG1B,SAAS,QAAc;AACrB,QAAM,OAAO;;CAGf,SAAS,OAAe;AACtB,gBAAc;AACd,SAAO,MAAM;;CAGf,SAAS,OAAiB;AACxB,gBAAc;AACd,SAAO,MAAM,KAAK,MAAM,MAAM,CAAC;;CAGjC,SAAS,QAAuB;EAC9B,MAAM,QAAQ,OAAO;AACrB,SAAO;GACL;GACA;GACA;GACA,aAAa,MAAM;GACnB;GACA,SAAS,QAAQ,IAAI,OAAO,QAAQ;GACrC;;CAGH,SAAS,KAAK,KAA4B;EACxC,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,UAClD;AAEF,SAAO,MAAM;;CAGf,SAAS,UAAU,KAAwC;EACzD,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,UAClD;AAEF,SAAO;;AAGT,QAAO;EAAE;EAAK;EAAK;EAAK,QAAQ;EAAK;EAAO;EAAM;EAAM;EAAO;EAAM;EAAW;;;;;;;;;;;;;AAkBlF,SAAgB,mBAAgC,QAAkD;CAChG,MAAM,EAAE,SAAS,cAAc,YAAY;CAE3C,MAAM,wBAAQ,IAAI,KAA4B;CAC9C,IAAI,OAAO;CACX,IAAI,SAAS;CACb,IAAI,YAAY;CAEhB,SAAS,eAAqB;EAC5B,MAAM,MAAM,KAAK,KAAK;AACtB,OAAK,MAAM,CAAC,KAAK,UAAU,MACzB,KAAI,MAAM,KAAK,aAAa,MAAM,MAAM,KAAK,WAAW;AACtD,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B;;;CAKN,SAAS,YAAkB;AACzB,MAAI,MAAM,SAAS,EAAG;EAGtB,MAAM,WAAW,MAAM,MAAM,CAAC,MAAM,CAAC;AACrC,MAAI,UAAU;GACZ,MAAM,QAAQ,MAAM,IAAI,SAAS;AACjC,SAAM,OAAO,SAAS;AACtB,OAAI,MAAO,WAAU,UAAU,MAAM,MAAM;AAC3C;;;CAIJ,SAAS,IAAI,KAA4B;AACvC,gBAAc;EAEd,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,OAAO;AACV;AACA;;AAGF,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,WAAW;AAC7D,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B;AACA;AACA;;AAGF,QAAM,KAAK,iBAAiB,KAAK,KAAK;AACtC,QAAM,KAAK;AACX;AAGA,SAAO,MAAM;;CAGf,SAAS,IAAI,KAAa,OAAU,OAAsB;AACxD,gBAAc;AAEd,MAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,QAAQ,QACnC,YAAW;EAGb,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,eAAe,SAAS;EAG9B,MAAM,WAAW,MAAM,IAAI,IAAI;EAC/B,MAAM,QAAuB;GAC3B;GACA;GACA,MAAM;IACJ,WAAW,UAAU,KAAK,aAAa;IACvC,gBAAgB;IAChB,aAAa,WAAW,SAAS,KAAK,cAAc,IAAI;IACxD,WAAW,eAAe,MAAM,eAAe;IAChD;GACF;AAED,MAAI,SAEF,OAAM,IAAI,KAAK,MAAM;MAGrB,OAAM,IAAI,KAAK,MAAM;;CAIzB,SAAS,IAAI,KAAsB;EACjC,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,WAAW;AAC7D,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B,UAAO;;AAET,SAAO;;CAGT,SAAS,IAAI,KAAsB;AACjC,SAAO,MAAM,OAAO,IAAI;;CAG1B,SAAS,QAAc;AACrB,QAAM,OAAO;;CAGf,SAAS,OAAe;AACtB,gBAAc;AACd,SAAO,MAAM;;CAGf,SAAS,OAAiB;AACxB,gBAAc;AACd,SAAO,MAAM,KAAK,MAAM,MAAM,CAAC;;CAGjC,SAAS,QAAuB;EAC9B,MAAM,QAAQ,OAAO;AACrB,SAAO;GACL;GACA;GACA;GACA,aAAa,MAAM;GACnB;GACA,SAAS,QAAQ,IAAI,OAAO,QAAQ;GACrC;;CAGH,SAAS,KAAK,KAA4B;EACxC,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,UAClD;AAEF,SAAO,MAAM;;CAGf,SAAS,UAAU,KAAwC;EACzD,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,UAClD;AAEF,SAAO;;AAGT,QAAO;EAAE;EAAK;EAAK;EAAK,QAAQ;EAAK;EAAO;EAAM;EAAM;EAAO;EAAM;EAAW;;;;;;;;;;;;;;;AAoBlF,SAAgB,kBAA+B,QAAkD;CAC/F,MAAM,EAAE,SAAS,eAAe,KAAO,YAAY;CAEnD,MAAM,wBAAQ,IAAI,KAA4B;CAC9C,IAAI,OAAO;CACX,IAAI,SAAS;CACb,IAAI,YAAY;CAEhB,SAAS,eAAuB;EAC9B,MAAM,MAAM,KAAK,KAAK;EACtB,IAAI,QAAQ;AACZ,OAAK,MAAM,CAAC,KAAK,UAAU,MACzB,KAAI,MAAM,KAAK,aAAa,MAAM,MAAM,KAAK,WAAW;AACtD,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B;AACA;;AAGJ,SAAO;;CAGT,SAAS,cAAoB;AAC3B,MAAI,MAAM,SAAS,EAAG;EAEtB,IAAI,YAA2B;EAC/B,IAAI,eAAe;AAEnB,OAAK,MAAM,CAAC,KAAK,UAAU,OAAO;GAChC,MAAM,SAAS,MAAM,KAAK,aAAa,MAAM,KAAK;AAClD,OAAI,SAAS,cAAc;AACzB,mBAAe;AACf,gBAAY;;;AAIhB,MAAI,WAAW;GACb,MAAM,QAAQ,MAAM,IAAI,UAAU;AAClC,SAAM,OAAO,UAAU;AACvB,OAAI,MAAO,WAAU,WAAW,MAAM,MAAM;AAC5C;;;CAIJ,SAAS,IAAI,KAA4B;AACvC,gBAAc;EAEd,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,OAAO;AACV;AACA;;AAGF,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,WAAW;AAC7D,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B;AACA;AACA;;AAGF,QAAM,KAAK,iBAAiB,KAAK,KAAK;AACtC,QAAM,KAAK;AACX;AAEA,SAAO,MAAM;;CAGf,SAAS,IAAI,KAAa,OAAU,OAAsB;AACxD,gBAAc;AAEd,MAAI,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,QAAQ,QACnC,cAAa;EAGf,MAAM,MAAM,KAAK,KAAK;EAGtB,MAAM,QAAuB;GAC3B;GACA;GACA,MAAM;IACJ,WAAW;IACX,gBAAgB;IAChB,aAAa;IACb,WAAW,OATM,SAAS;IAU3B;GACF;AAED,QAAM,IAAI,KAAK,MAAM;;CAGvB,SAAS,IAAI,KAAsB;EACjC,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,WAAW;AAC7D,SAAM,OAAO,IAAI;AACjB,aAAU,KAAK,MAAM,MAAM;AAC3B,UAAO;;AAET,SAAO;;CAGT,SAAS,IAAI,KAAsB;AACjC,SAAO,MAAM,OAAO,IAAI;;CAG1B,SAAS,QAAc;AACrB,QAAM,OAAO;;CAGf,SAAS,OAAe;AACtB,gBAAc;AACd,SAAO,MAAM;;CAGf,SAAS,OAAiB;AACxB,gBAAc;AACd,SAAO,MAAM,KAAK,MAAM,MAAM,CAAC;;CAGjC,SAAS,QAAuB;EAC9B,MAAM,QAAQ,OAAO;AACrB,SAAO;GACL;GACA;GACA;GACA,aAAa,MAAM;GACnB;GACA,SAAS,QAAQ,IAAI,OAAO,QAAQ;GACrC;;CAGH,SAAS,KAAK,KAA4B;EACxC,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,UAClD;AAEF,SAAO,MAAM;;CAGf,SAAS,UAAU,KAAwC;EACzD,MAAM,QAAQ,MAAM,IAAI,IAAI;AAC5B,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,MAAM,KAAK,aAAa,KAAK,KAAK,GAAG,MAAM,KAAK,UAClD;AAEF,SAAO;;AAGT,QAAO;EAAE;EAAK;EAAK;EAAK,QAAQ;EAAK;EAAO;EAAM;EAAM;EAAO;EAAM;EAAW;;;;;;;;;;;;;;AA2BlF,SAAgB,uBACd,QAC0B;CAC1B,MAAM,EACJ,SACA,cACA,SACA,mBAAmB,KACnB,qBAAqB,QACnB;CAGJ,IAAI,kBAAiC;CACrC,MAAM,WAAW,kBAAqB;EAAE;EAAS;EAAc;EAAS,CAAC;CACzE,MAAM,WAAW,kBAAqB;EAAE;EAAS;EAAc;EAAS,CAAC;CACzE,IAAI,cAAc;CAGlB,MAAM,YAAkD,EAAE;CAC1D,IAAI,eAAe,KAAK,KAAK;CAE7B,SAAS,kBAAwB;EAC/B,MAAM,MAAM,KAAK,KAAK;AACtB,MAAI,MAAM,eAAe,mBAAoB;AAC7C,iBAAe;EAGf,MAAM,cAAc,MAAM;EAC1B,MAAM,iBAAiB,UAAU,QAAO,MAAK,EAAE,QAAQ,YAAY;AAEnE,MAAI,eAAe,SAAS,GAAI;EAGhC,MAAM,4BAAY,IAAI,KAAqB;AAC3C,OAAK,MAAM,UAAU,eACnB,WAAU,IAAI,OAAO,MAAM,UAAU,IAAI,OAAO,IAAI,IAAI,KAAK,EAAE;EAIjE,MAAM,SAAS,MAAM,KAAK,UAAU,QAAQ,CAAC;EAE7C,MAAM,OADQ,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,EAAE,GAC1B,OAAO;EAC5B,MAAM,WAAW,OAAO,QAAQ,KAAK,MAAM,MAAM,KAAK,IAAI,IAAI,MAAM,EAAE,EAAE,EAAE,GAAG,OAAO;EAMpF,MAAM,gBAJyB,OAAO,IADvB,KAAK,KAAK,SAAS,GACiB,OAAO,KAIZ;AAE9C,MAAI,gBAAgB,oBAAoB,OAAO;GAE7C,MAAM,UAAU,SACb,MAAM,CACN,KAAI,MAAK,SAAS,YAAY,EAAE,CAAC,CACjC,QAAQ,MAA0B,MAAM,OAAU;AACrD,YAAS,OAAO;AAChB,QAAK,MAAM,SAAS,SAAS;IAE3B,MAAM,iBAAiB,MAAM,KAAK,YAC9B,KAAK,IAAI,GAAG,MAAM,KAAK,YAAY,IAAI,GACvC;AAEJ,QAAI,mBAAmB,UAAa,iBAAiB,EACnD,UAAS,IAAI,MAAM,KAAK,MAAM,OAAO,eAAe;;AAIxD,YAAS,OAAO;AAChB,iBAAc;AACd,qBAAkB;aACT,CAAC,gBAAgB,oBAAoB,OAAO;GAErD,MAAM,UAAU,SACb,MAAM,CACN,KAAI,MAAK,SAAS,YAAY,EAAE,CAAC,CACjC,QAAQ,MAA0B,MAAM,OAAU;AACrD,YAAS,OAAO;AAChB,QAAK,MAAM,SAAS,SAAS;IAE3B,MAAM,iBAAiB,MAAM,KAAK,YAC9B,KAAK,IAAI,GAAG,MAAM,KAAK,YAAY,IAAI,GACvC;AAEJ,QAAI,mBAAmB,UAAa,iBAAiB,EACnD,UAAS,IAAI,MAAM,KAAK,MAAM,OAAO,eAAe;;AAIxD,YAAS,OAAO;AAChB,iBAAc;AACd,qBAAkB;;EAIpB,MAAM,eAAe;AACrB,SAAO,UAAU,SAAS,MAAM,UAAU,IAAI,QAAQ,KAAK,YACzD,WAAU,OAAO;AAGnB,MAAI,UAAU,SAAS,aACrB,WAAU,OAAO,GAAG,UAAU,SAAS,aAAa;;CAIxD,SAAS,IAAI,KAA4B;AACvC,mBAAiB;AAEjB,MAAI,UAAU,UAAU,IACtB,WAAU,OAAO;AAEnB,YAAU,KAAK;GAAE;GAAK,MAAM,KAAK,KAAK;GAAE,CAAC;AACzC,SAAO,YAAY,IAAI,IAAI;;CAG7B,SAAS,IAAI,KAAa,OAAU,OAAsB;AACxD,mBAAiB;AACjB,cAAY,IAAI,KAAK,OAAO,MAAM;;CAGpC,SAAS,IAAI,KAAsB;AACjC,SAAO,YAAY,IAAI,IAAI;;CAG7B,SAAS,IAAI,KAAsB;AAEjC,WAAS,OAAO,IAAI;AACpB,WAAS,OAAO,IAAI;AACpB,SAAO,YAAY,OAAO,IAAI;;CAGhC,SAAS,QAAc;AACrB,WAAS,OAAO;AAChB,WAAS,OAAO;AAChB,YAAU,SAAS;;CAGrB,SAAS,OAAe;AACtB,SAAO,YAAY,MAAM;;CAG3B,SAAS,OAAiB;AACxB,SAAO,YAAY,MAAM;;CAG3B,SAAS,QAAuB;AAE9B,SAAO,EACL,GAFgB,YAAY,OAAO,EAIpC;;CAGH,SAAS,KAAK,KAA4B;AACxC,SAAO,YAAY,KAAK,IAAI;;CAG9B,SAAS,UAAU,KAAwC;AACzD,SAAO,YAAY,YAAY,IAAI;;AAGrC,QAAO;EAAE;EAAK;EAAK;EAAK,QAAQ;EAAK;EAAO;EAAM;EAAM;EAAO;EAAM;EAAW;;;;;;;;;;;AAgBlF,SAAgB,oBACd,UACA,QAC0B;AAC1B,SAAQ,UAAR;EACE,KAAK,MACH,QAAO,kBAAqB,OAAO;EACrC,KAAK,MACH,QAAO,kBAAqB,OAAO;EACrC,KAAK,OACH,QAAO,mBAAsB,OAAO;EACtC,KAAK,MACH,QAAO,kBAAqB,OAAO;EACrC,KAAK,WACH,QAAO,uBAA0B,OAAiC;EACpE,QACE,OAAM,IAAI,MAAM,2BAA2B,WAAW"}

package/dist/caching.d.mts

@@ -0,0 +1,14 @@
+import "./ai-runtime-DIwOEc6g.mjs";
+import { t as RedisClient } from "./types-By-r93bE.mjs";
+import { i as CachingMiddlewareOptions, n as CacheStrategy, r as CachedResponse, t as CacheAdapter } from "./types-BPnq3GQo.mjs";
+import { n as MemoryCacheAdapter, t as RedisCacheAdapter } from "./redis-CwguYFGh.mjs";
+import "./caching-adapters.mjs";
+import { n as createCachingMiddleware, t as computeCacheKey } from "./middleware-C7k0uItW.mjs";
+
+//#region src/caching/index.d.ts
+declare namespace index_d_exports {
+  export { CacheAdapter, CacheStrategy, CachedResponse, CachingMiddlewareOptions, MemoryCacheAdapter, RedisCacheAdapter, RedisClient, computeCacheKey, createCachingMiddleware };
+}
+//#endregion
+export { type CacheAdapter, type CacheStrategy, type CachedResponse, type CachingMiddlewareOptions, MemoryCacheAdapter, RedisCacheAdapter, RedisClient, computeCacheKey, createCachingMiddleware, index_d_exports as t };
+//# sourceMappingURL=caching.d.mts.map

package/dist/caching.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"caching.d.mts","names":[],"sources":["../src/caching/index.ts"],"mappings":""}

package/dist/caching.mjs

@@ -0,0 +1,15 @@
+import { t as __exportAll } from "./chunk-CkzbjWQW.mjs";
+import { n as createCachingMiddleware, t as computeCacheKey } from "./middleware-5wQ9bANW.mjs";
+import { n as MemoryCacheAdapter, t as RedisCacheAdapter } from "./redis-CpsSrF8K.mjs";
+
+//#region src/caching/index.ts
+var caching_exports = /* @__PURE__ */ __exportAll({
+	MemoryCacheAdapter: () => MemoryCacheAdapter,
+	RedisCacheAdapter: () => RedisCacheAdapter,
+	computeCacheKey: () => computeCacheKey,
+	createCachingMiddleware: () => createCachingMiddleware
+});
+
+//#endregion
+export { MemoryCacheAdapter, RedisCacheAdapter, computeCacheKey, createCachingMiddleware, caching_exports as t };
+//# sourceMappingURL=caching.mjs.map

package/dist/caching.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"caching.mjs","names":[],"sources":["../src/caching/index.ts"],"sourcesContent":["/**\n * Response caching module for AI SDK\n *\n * Provides middleware for caching AI responses with multiple\n * storage backends and caching strategies.\n *\n * @module @od-oneapp/ai-platform/caching\n */\n\nexport { createCachingMiddleware, computeCacheKey } from './middleware';\nexport type {\n  CacheAdapter,\n  CachedResponse,\n  CacheStrategy,\n  CachingMiddlewareOptions,\n} from './types';\nexport * from \"./adapters\";\n"],"mappings":""}

package/dist/catalog.d.mts

@@ -0,0 +1,19 @@
+//#region src/catalog.d.ts
+interface CatalogEntry {
+  id: string;
+  name: string;
+  module: string;
+  domain: 'agents' | 'models' | 'streaming' | 'grounding' | 'tools' | 'sdk' | 'security' | 'governance' | 'observability' | 'hitl' | 'output' | 'prompts' | 'pipelines' | 'caching' | 'shared' | 'integrations' | 'generative-ui';
+  description: string;
+  tags: readonly string[];
+  useCase: string;
+}
+declare const PATTERN_CATALOG: readonly CatalogEntry[];
+declare const CATALOG_DOMAINS: readonly ("output" | "agents" | "models" | "streaming" | "grounding" | "tools" | "sdk" | "security" | "governance" | "observability" | "hitl" | "prompts" | "pipelines" | "caching" | "shared" | "integrations" | "generative-ui")[];
+declare const CATALOG_TAGS: readonly string[];
+declare function searchCatalog(query: string): readonly CatalogEntry[];
+declare function getCatalogByDomain(domain: CatalogEntry['domain']): readonly CatalogEntry[];
+declare function getCatalogByTag(tag: string): readonly CatalogEntry[];
+//#endregion
+export { CATALOG_DOMAINS, CATALOG_TAGS, CatalogEntry, PATTERN_CATALOG, getCatalogByDomain, getCatalogByTag, searchCatalog };
+//# sourceMappingURL=catalog.d.mts.map

package/dist/catalog.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"catalog.d.mts","names":[],"sources":["../src/catalog.ts"],"mappings":";UA0BiB,YAAA;EAEf,EAAA;EAEA,IAAA;EAEA,MAAA;EAEA,MAAA;EAmBA,WAAA;EAEA,IAAA;EAEA,OAAA;AAAA;AAAA,cAaW,eAAA,WAA0B,YAAA;AAAA,cA2xB1B,eAAA;AAAA,cAGA,YAAA;AAAA,iBAsBG,aAAA,CAAc,KAAA,oBAAyB,YAAA;AAAA,iBAkBvC,kBAAA,CAAmB,MAAA,EAAQ,YAAA,sBAAkC,YAAA;AAAA,iBAU7D,eAAA,CAAgB,GAAA,oBAAuB,YAAA"}