"use strict";Object.defineProperty(exports, "__esModule", { value: true });exports.LRUCache = void 0; /**
 * Simple LRU (Least Recently Used) cache implementation
 * Automatically evicts least recently used items when capacity is reached
 */
class LRUCache {
  cache;
  maxSize;
  constructor(maxSize = 10000) {
    this.cache = new Map();
    this.maxSize = maxSize;
  }
  /**
   * Get a value from the cache
   * @param key The key to retrieve
   * @returns The value if found, undefined otherwise
   */
  get(key) {
    const value = this.cache.get(key);
    if (value !== undefined) {
      // Move to end (most recently used)
      this.cache.delete(key);
      this.cache.set(key, value);
    }
    return value;
  }
  /**
   * Set a value in the cache
   * @param key The key to set
   * @param value The value to store
   */
  set(key, value) {
    // Delete if exists to reinsert at end
    this.cache.delete(key);
    // Evict least recently used if at capacity
    if (this.cache.size >= this.maxSize) {
      const firstKey = this.cache.keys().next().value;
      if (firstKey !== undefined) {
        this.cache.delete(firstKey);
      }
    }
    this.cache.set(key, value);
  }
  /**
   * Check if a key exists in the cache
   * @param key The key to check
   * @returns true if the key exists
   */
  has(key) {
    return this.cache.has(key);
  }
  /**
   * Delete a key from the cache
   * @param key The key to delete
   * @returns true if the key was deleted
   */
  delete(key) {
    return this.cache.delete(key);
  }
  /**
   * Get the current size of the cache
   */
  get size() {
    return this.cache.size;
  }
  /**
   * Get all values in the cache
   */
  values() {
    return this.cache.values();
  }
  /**
   * Clear all entries from the cache
   */
  clear() {
    this.cache.clear();
  }
}exports.LRUCache = LRUCache; /* v9-e534a97c5f3a0fe7 */