@cacheable/memory 2.0.7 → 2.0.9

package/README.md

@@ -2,13 +2,13 @@
 
 > High Performance Layer 1 / Layer 2 Caching with Keyv Storage
 
-[![codecov](https://codecov.io/gh/jaredwray/cacheable/graph/badge.svg?token=lWZ9OBQ7GM)](https://codecov.io/gh/jaredwray/cacheable)
+[![codecov](https://codecov.io/gh/jaredwray/cacheable/branch/main/graph/badge.svg?token=lWZ9OBQ7GM)](https://codecov.io/gh/jaredwray/cacheable)
 [![tests](https://github.com/jaredwray/cacheable/actions/workflows/tests.yml/badge.svg)](https://github.com/jaredwray/cacheable/actions/workflows/tests.yml)
 [![npm](https://img.shields.io/npm/dm/@cacheable/memory.svg)](https://www.npmjs.com/package/@cacheable/memory)
 [![npm](https://img.shields.io/npm/v/@cacheable/memory.svg)](https://www.npmjs.com/package/@cacheable/memory)
 [![license](https://img.shields.io/github/license/jaredwray/cacheable)](https://github.com/jaredwray/cacheable/blob/main/LICENSE)
 
-You can use `CacheableMemory` as a standalone cache or as a primary store for `cacheable`. You can also set the `useClones` property to `false` if you want to use the same reference for the values. This is useful if you are using large objects and want to save memory. The `lruSize` property is the size of the LRU cache and is set to `0` by default which is unlimited. When setting the `lruSize` property it will limit the number of keys in the cache.
+You can use `CacheableMemory` as a standalone cache or as a primary store for `cacheable`. You can also set the `useClones` property to `false` if you want to use the same reference for the values. This is useful if you are using large objects and want to save memory. The `lruSize` property is the size of the LRU cache and is set to `0` by default, which disables the LRU cache (no LRU eviction is performed and the cache size is bounded only by the underlying `Map` stores). When the `lruSize` property is set to a value greater than `0`, it limits the number of keys in the cache and evicts the least recently used entries when full.
 
 This simple in-memory cache uses multiple Map objects and a with `expiration` and `lru` policies if set to manage the in memory cache at scale.
 
@@ -188,11 +188,11 @@ const value = cache.get('key'); // value
 
 You can enable the LRU (Least Recently Used) feature in `CacheableMemory` by setting the `lruSize` property in the options. This will limit the number of keys in the cache to the size you set. When the cache reaches the limit it will remove the least recently used keys from the cache. This is useful if you want to limit the memory usage of the cache.
 
-When you set the `lruSize` we use a double linked list to manage the LRU cache and also set the `hashStoreSize` to `1` which means we will only use a single `Map` object for the LRU cache. This is because the LRU cache is managed by the double linked list and it is not possible to have more than `16,777,216 (2^24) keys` in a single `Map` object.
+When you set the `lruSize`, we use a doubly linked list to track the LRU order across the underlying `Map` stores. The `lruSize` itself is capped at `16,777,216 (2^24) keys` — values above this limit are rejected and an `error` event is emitted. Setting `lruSize` does not change `storeHashSize`; the underlying stores keep whatever `storeHashSize` you configured (default `16`).
 
 ```javascript
 import { CacheableMemory } from 'cacheable';
-const cache = new CacheableMemory({ lruSize: 1 }); // sets the LRU cache size to 1000 keys and hashStoreSize to 1
+const cache = new CacheableMemory({ lruSize: 1 }); // sets the LRU cache size to 1 key
 cache.set('key1', 'value1');
 cache.set('key2', 'value2');
 const value1 = cache.get('key1');
@@ -230,7 +230,7 @@ As you can see from the benchmarks `CacheableMemory` is on par with other cachin
 
 * `ttl`: The time to live for the cache in milliseconds. Default is `undefined` which is means indefinitely.
 * `useClones`: If the cache should use clones for the values. Default is `true`.
-* `lruSize`: The size of the LRU cache. Default is `0` which is unlimited.
+* `lruSize`: The size of the LRU cache. Default is `0`, which disables the LRU cache (no LRU eviction is performed). Maximum is `16,777,216 (2^24)`.
 * `checkInterval`: The interval to check for expired keys in milliseconds. Default is `0` which is disabled.
 * `storeHashSize`: The number of `Map` objects to use for the cache. Default is `16`.
 * `storeHashAlgorithm`: The hashing algorithm to use for the cache. Default is `djb2`. Supported: DJB2, FNV1, MURMER, CRC32.
@@ -253,7 +253,7 @@ As you can see from the benchmarks `CacheableMemory` is on par with other cachin
 * `clear()`: Clears the cache.
 * `ttl`: The default time to live for the cache in milliseconds. Default is `undefined` which is disabled.
 * `useClones`: If the cache should use clones for the values. Default is `true`.
-* `lruSize`: The size of the LRU cache. Default is `0` which is unlimited.
+* `lruSize`: The size of the LRU cache. Default is `0`, which disables the LRU cache (no LRU eviction is performed). Maximum is `16,777,216 (2^24)`.
 * `size`: The number of keys in the cache.
 * `checkInterval`: The interval to check for expired keys in milliseconds. Default is `0` which is disabled.
 * `storeHashSize`: The number of `Map` objects to use for the cache. Default is `16`.

package/dist/index.cjs

@@ -100,6 +100,31 @@ var DoublyLinkedList = class {
     this.nodesMap.delete(oldValue);
     return oldValue;
   }
+  // Remove a specific node by value
+  remove(value) {
+    const node = this.nodesMap.get(value);
+    if (!node) {
+      return false;
+    }
+    if (node.prev) {
+      node.prev.next = node.next;
+    } else {
+      this.head = node.next;
+      if (this.head) {
+        this.head.prev = void 0;
+      }
+    }
+    if (node.next) {
+      node.next.prev = node.prev;
+    } else {
+      this.tail = node.prev;
+      if (this.tail) {
+        this.tail.next = void 0;
+      }
+    }
+    this.nodesMap.delete(value);
+    return true;
+  }
   get size() {
     return this.nodesMap.size;
   }
@@ -387,6 +412,7 @@ var CacheableMemory = class extends import_hookified.Hookified {
         const item = store.get(key);
         if (item && this.hasExpired(item)) {
           store.delete(key);
+          this.lruRemove(key);
           continue;
         }
         keys.push(key);
@@ -404,6 +430,7 @@ var CacheableMemory = class extends import_hookified.Hookified {
       for (const item of store.values()) {
         if (this.hasExpired(item)) {
           store.delete(item.key);
+          this.lruRemove(item.key);
           continue;
         }
         items.push(item);
@@ -431,6 +458,7 @@ var CacheableMemory = class extends import_hookified.Hookified {
     }
     if (item.expires && Date.now() > item.expires) {
       store.delete(key);
+      this.lruRemove(key);
       return void 0;
     }
     this.lruMoveToFront(key);
@@ -464,6 +492,7 @@ var CacheableMemory = class extends import_hookified.Hookified {
     }
     if (item.expires && item.expires && Date.now() > item.expires) {
       store.delete(key);
+      this.lruRemove(key);
       return void 0;
     }
     this.lruMoveToFront(key);
@@ -593,6 +622,7 @@ var CacheableMemory = class extends import_hookified.Hookified {
   delete(key) {
     const store = this.getStore(key);
     store.delete(key);
+    this.lruRemove(key);
   }
   /**
    * Delete the keys
@@ -680,6 +710,17 @@ var CacheableMemory = class extends import_hookified.Hookified {
     }
     this._lru.moveToFront(key);
   }
+  /**
+   * Remove a key from the LRU cache. This is for internal use
+   * @param {string} key - The key to remove
+   * @returns {void}
+   */
+  lruRemove(key) {
+    if (this._lruSize === 0) {
+      return;
+    }
+    this._lru.remove(key);
+  }
   /**
    * Resize the LRU cache. This is for internal use.
    * @returns {void}
@@ -702,6 +743,7 @@ var CacheableMemory = class extends import_hookified.Hookified {
       for (const item of store.values()) {
         if (item.expires && Date.now() > item.expires) {
           store.delete(item.key);
+          this.lruRemove(item.key);
         }
       }
     }

package/dist/index.d.cts

@@ -1,7 +1,7 @@
 import { HashAlgorithm, CacheableStoreItem, CacheableItem, WrapFunctionOptions } from '@cacheable/utils';
 export { CacheableItem, CacheableStoreItem, HashAlgorithm, hash, hashToNumber } from '@cacheable/utils';
 import { Hookified } from 'hookified';
-import { Keyv, KeyvStoreAdapter, StoredData } from 'keyv';
+import { KeyvStoreAdapter, StoredData, Keyv } from 'keyv';
 
 type KeyvCacheableMemoryOptions = CacheableMemoryOptions & {
     namespace?: string;
@@ -269,6 +269,12 @@ declare class CacheableMemory extends Hookified {
      * @returns {void}
      */
     lruMoveToFront(key: string): void;
+    /**
+     * Remove a key from the LRU cache. This is for internal use
+     * @param {string} key - The key to remove
+     * @returns {void}
+     */
+    lruRemove(key: string): void;
     /**
      * Resize the LRU cache. This is for internal use.
      * @returns {void}

package/dist/index.d.ts

@@ -1,7 +1,7 @@
 import { HashAlgorithm, CacheableStoreItem, CacheableItem, WrapFunctionOptions } from '@cacheable/utils';
 export { CacheableItem, CacheableStoreItem, HashAlgorithm, hash, hashToNumber } from '@cacheable/utils';
 import { Hookified } from 'hookified';
-import { Keyv, KeyvStoreAdapter, StoredData } from 'keyv';
+import { KeyvStoreAdapter, StoredData, Keyv } from 'keyv';
 
 type KeyvCacheableMemoryOptions = CacheableMemoryOptions & {
     namespace?: string;
@@ -269,6 +269,12 @@ declare class CacheableMemory extends Hookified {
      * @returns {void}
      */
     lruMoveToFront(key: string): void;
+    /**
+     * Remove a key from the LRU cache. This is for internal use
+     * @param {string} key - The key to remove
+     * @returns {void}
+     */
+    lruRemove(key: string): void;
     /**
      * Resize the LRU cache. This is for internal use.
      * @returns {void}

package/dist/index.js

@@ -74,6 +74,31 @@ var DoublyLinkedList = class {
     this.nodesMap.delete(oldValue);
     return oldValue;
   }
+  // Remove a specific node by value
+  remove(value) {
+    const node = this.nodesMap.get(value);
+    if (!node) {
+      return false;
+    }
+    if (node.prev) {
+      node.prev.next = node.next;
+    } else {
+      this.head = node.next;
+      if (this.head) {
+        this.head.prev = void 0;
+      }
+    }
+    if (node.next) {
+      node.next.prev = node.prev;
+    } else {
+      this.tail = node.prev;
+      if (this.tail) {
+        this.tail.next = void 0;
+      }
+    }
+    this.nodesMap.delete(value);
+    return true;
+  }
   get size() {
     return this.nodesMap.size;
   }
@@ -365,6 +390,7 @@ var CacheableMemory = class extends Hookified {
         const item = store.get(key);
         if (item && this.hasExpired(item)) {
           store.delete(key);
+          this.lruRemove(key);
           continue;
         }
         keys.push(key);
@@ -382,6 +408,7 @@ var CacheableMemory = class extends Hookified {
       for (const item of store.values()) {
         if (this.hasExpired(item)) {
           store.delete(item.key);
+          this.lruRemove(item.key);
           continue;
         }
         items.push(item);
@@ -409,6 +436,7 @@ var CacheableMemory = class extends Hookified {
     }
     if (item.expires && Date.now() > item.expires) {
       store.delete(key);
+      this.lruRemove(key);
       return void 0;
     }
     this.lruMoveToFront(key);
@@ -442,6 +470,7 @@ var CacheableMemory = class extends Hookified {
     }
     if (item.expires && item.expires && Date.now() > item.expires) {
       store.delete(key);
+      this.lruRemove(key);
       return void 0;
     }
     this.lruMoveToFront(key);
@@ -571,6 +600,7 @@ var CacheableMemory = class extends Hookified {
   delete(key) {
     const store = this.getStore(key);
     store.delete(key);
+    this.lruRemove(key);
   }
   /**
    * Delete the keys
@@ -658,6 +688,17 @@ var CacheableMemory = class extends Hookified {
     }
     this._lru.moveToFront(key);
   }
+  /**
+   * Remove a key from the LRU cache. This is for internal use
+   * @param {string} key - The key to remove
+   * @returns {void}
+   */
+  lruRemove(key) {
+    if (this._lruSize === 0) {
+      return;
+    }
+    this._lru.remove(key);
+  }
   /**
    * Resize the LRU cache. This is for internal use.
    * @returns {void}
@@ -680,6 +721,7 @@ var CacheableMemory = class extends Hookified {
       for (const item of store.values()) {
         if (item.expires && Date.now() > item.expires) {
           store.delete(item.key);
+          this.lruRemove(item.key);
         }
       }
     }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@cacheable/memory",
-  "version": "2.0.7",
+  "version": "2.0.9",
   "description": "High Performance In-Memory Cache for Node.js",
   "type": "module",
   "main": "./dist/index.js",
@@ -27,20 +27,14 @@
   "license": "MIT",
   "private": false,
   "devDependencies": {
-    "@biomejs/biome": "^2.3.10",
-    "@faker-js/faker": "^10.1.0",
-    "@types/node": "^25.0.3",
-    "@vitest/coverage-v8": "^4.0.16",
-    "rimraf": "^6.1.2",
     "tsup": "^8.5.1",
-    "typescript": "^5.9.3",
-    "vitest": "^4.0.16"
+    "typescript": "^5.9.3"
   },
   "dependencies": {
-    "@keyv/bigmap": "^1.3.0",
-    "hookified": "^1.14.0",
-    "keyv": "^5.5.5",
-    "@cacheable/utils": "^2.3.3"
+    "@keyv/bigmap": "^1.3.1",
+    "hookified": "^1.15.1",
+    "keyv": "^5.6.0",
+    "@cacheable/utils": "^2.4.1"
   },
   "keywords": [
     "cacheable",
@@ -63,7 +57,6 @@
   ],
   "scripts": {
     "build": "rimraf ./dist && tsup src/index.ts --format cjs,esm --dts --clean",
-    "prepublish": "pnpm build",
     "lint": "biome check --write --error-on-warnings",
     "test": "pnpm lint && vitest run --coverage",
     "test:ci": "biome check --error-on-warnings && vitest run --coverage",