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

package/dist/index.mjs

@@ -1476,7 +1476,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
@@ -1503,9 +1503,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);
@@ -1518,7 +1522,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);
@@ -1527,6 +1533,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;
   }