@superatomai/sdk-node 0.0.41-mds → 0.0.42-mds

package/dist/index.d.mts

@@ -2712,7 +2712,8 @@ declare const openaiLLM: OpenAILLM;
  * Query Cache — Two mechanisms:
  *
  * 1. `cache` (query string → result data) — TTL-based with max size, for avoiding re-execution
- *    of recently validated queries. LRU eviction when max size exceeded.
+ *    of recently validated queries. True LRU eviction: reads bubble entries to the back via
+ *    delete+re-set so the oldest *unused* entry is evicted, not the oldest *inserted*.
  *
  * 2. Encrypted queryId tokens — SQL is encrypted into the queryId itself (self-contained).
  *    No server-side storage needed for SQL mappings. The token is decrypted on each request.
@@ -2739,11 +2740,16 @@ declare class QueryCache {
      */
     getTTL(): number;
     /**
-     * Store query result in data cache
+     * Store query result in data cache.
+     * If the key already exists, it's removed first so the re-insert places it
+     * at the back of the iteration order (LRU). Eviction only fires when adding
+     * a genuinely new key past the size limit.
      */
     set(query: string, data: any): void;
     /**
-     * Get cached result if exists and not expired
+     * Get cached result if exists and not expired.
+     * On hit, re-inserts the entry so it moves to the back of the Map's
+     * iteration order — turning FIFO eviction into true LRU.
      */
     get(query: string): any | null;
     /**

package/dist/index.d.ts

@@ -2712,7 +2712,8 @@ declare const openaiLLM: OpenAILLM;
  * Query Cache — Two mechanisms:
  *
  * 1. `cache` (query string → result data) — TTL-based with max size, for avoiding re-execution
- *    of recently validated queries. LRU eviction when max size exceeded.
+ *    of recently validated queries. True LRU eviction: reads bubble entries to the back via
+ *    delete+re-set so the oldest *unused* entry is evicted, not the oldest *inserted*.
  *
  * 2. Encrypted queryId tokens — SQL is encrypted into the queryId itself (self-contained).
  *    No server-side storage needed for SQL mappings. The token is decrypted on each request.
@@ -2739,11 +2740,16 @@ declare class QueryCache {
      */
     getTTL(): number;
     /**
-     * Store query result in data cache
+     * Store query result in data cache.
+     * If the key already exists, it's removed first so the re-insert places it
+     * at the back of the iteration order (LRU). Eviction only fires when adding
+     * a genuinely new key past the size limit.
      */
     set(query: string, data: any): void;
     /**
-     * Get cached result if exists and not expired
+     * Get cached result if exists and not expired.
+     * On hit, re-inserts the entry so it moves to the back of the Map's
+     * iteration order — turning FIFO eviction into true LRU.
      */
     get(query: string): any | null;
     /**

package/dist/index.js

@@ -1536,7 +1536,7 @@ var QueryCache = class {
     this.cache = /* @__PURE__ */ new Map();
     this.ttlMs = 10 * 60 * 1e3;
     // Default: 10 minutes
-    this.maxCacheSize = 500;
+    this.maxCacheSize = 5e3;
     // Max data cache entries
     this.cleanupInterval = null;
     // Encryption for queryId tokens
@@ -1563,9 +1563,13 @@ var QueryCache = class {
     return this.ttlMs / 60 / 1e3;
   }
   /**
-   * Store query result in data cache
+   * Store query result in data cache.
+   * If the key already exists, it's removed first so the re-insert places it
+   * at the back of the iteration order (LRU). Eviction only fires when adding
+   * a genuinely new key past the size limit.
    */
   set(query, data) {
+    this.cache.delete(query);
     if (this.cache.size >= this.maxCacheSize) {
       const oldestKey = this.cache.keys().next().value;
       if (oldestKey) this.cache.delete(oldestKey);
@@ -1578,7 +1582,9 @@ var QueryCache = class {
     logger.debug(`[QueryCache] Stored result for query (${query.substring(0, 50)}...)`);
   }
   /**
-   * Get cached result if exists and not expired
+   * Get cached result if exists and not expired.
+   * On hit, re-inserts the entry so it moves to the back of the Map's
+   * iteration order — turning FIFO eviction into true LRU.
    */
   get(query) {
     const entry = this.cache.get(query);
@@ -1587,6 +1593,8 @@ var QueryCache = class {
       this.cache.delete(query);
       return null;
     }
+    this.cache.delete(query);
+    this.cache.set(query, entry);
     logger.info(`[QueryCache] Cache HIT for query (${query.substring(0, 50)}...)`);
     return entry.data;
   }