@thi.ng/cache 2.1.87 → 2.1.89

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2023-12-31T09:44:23Z
+- **Last updated**: 2024-01-26T18:03:04Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.
@@ -9,6 +9,12 @@ See [Conventional Commits](https://conventionalcommits.org/) for commit guidelin
 **Note:** Unlisted _patch_ versions only involve non-code or otherwise excluded changes
 and/or version bumps of transitive dependencies.
 
+### [2.1.89](https://github.com/thi-ng/umbrella/tree/@thi.ng/cache@2.1.89) (2024-01-26)
+
+#### 🩹 Bug fixes
+
+- attempt to add element bigger than "maxsize" blocks addition of any new elements to the cache ([3c855ef](https://github.com/thi-ng/umbrella/commit/3c855ef))
+
 ### [2.1.76](https://github.com/thi-ng/umbrella/tree/@thi.ng/cache@2.1.76) (2023-11-09)
 
 #### ♻️ Refactoring

package/README.md

@@ -76,7 +76,7 @@ For Node.js REPL:
 const cache = await import("@thi.ng/cache");
 ```
 
-Package sizes (brotli'd, pre-treeshake): ESM: 1.06 KB
+Package sizes (brotli'd, pre-treeshake): ESM: 1.08 KB
 
 ## Dependencies
 
@@ -246,4 +246,4 @@ If this project contributes to an academic publication, please cite it as:
 
 ## License
 
-© 2018 - 2023 Karsten Schmidt // Apache License 2.0
+© 2018 - 2024 Karsten Schmidt // Apache License 2.0

package/lru.js

@@ -81,8 +81,13 @@ class LRUCache {
   set(key, value) {
     const size = this.opts.ksize(key) + this.opts.vsize(value);
     const e = this.map.get(key);
-    this._size += Math.max(0, size - (e ? e.value.s : 0));
-    this.ensureSize() && this.doSetEntry(e, key, value, size);
+    const additionalSize = Math.max(0, size - (e ? e.value.s : 0));
+    this._size += additionalSize;
+    if (this.ensureSize()) {
+      this.doSetEntry(e, key, value, size);
+    } else {
+      this._size -= additionalSize;
+    }
     return value;
   }
   into(pairs) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/cache",
-  "version": "2.1.87",
+  "version": "2.1.89",
   "description": "In-memory cache implementations with ES6 Map-like API and different eviction strategies",
   "type": "module",
   "module": "./index.js",
@@ -35,9 +35,9 @@
     "test": "bun test"
   },
   "dependencies": {
-    "@thi.ng/api": "^8.9.16",
-    "@thi.ng/dcons": "^3.2.82",
-    "@thi.ng/transducers": "^8.8.20"
+    "@thi.ng/api": "^8.9.18",
+    "@thi.ng/dcons": "^3.2.84",
+    "@thi.ng/transducers": "^8.8.22"
   },
   "devDependencies": {
     "@microsoft/api-extractor": "^7.39.0",
@@ -90,5 +90,5 @@
     ],
     "year": 2018
   },
-  "gitHead": "b3db173682e1148cf08a6bd907b8d90b47b7c066\n"
+  "gitHead": "7426e2ae6fca5482c6eaf649872296fc89955374\n"
 }

package/tlru.d.ts

@@ -34,5 +34,6 @@ export declare class TLRUCache<K, V> extends LRUCache<K, V> {
     getSet(key: K, retrieve: Fn0<Promise<V>>, ttl?: number): Promise<V>;
     prune(): void;
     protected ensureSize(): boolean;
+    protected doSetTlruEntry(e: ConsCell<TLRUCacheEntry<K, V>> | undefined, k: K, v: V, s: number, t: number): void;
 }
 //# sourceMappingURL=tlru.d.ts.map

package/tlru.js

@@ -23,23 +23,13 @@ class TLRUCache extends LRUCache {
   set(key, value, ttl = this.opts.ttl) {
     const size = this.opts.ksize(key) + this.opts.vsize(value);
     const e = this.map.get(key);
-    this._size += Math.max(0, size - (e ? e.value.s : 0));
+    const additionalSize = Math.max(0, size - (e ? e.value.s : 0));
+    this._size += additionalSize;
     if (this.ensureSize()) {
       const t = Date.now() + ttl;
-      if (e) {
-        e.value.v = value;
-        e.value.s = size;
-        e.value.t = t;
-        this.items.asTail(e);
-      } else {
-        this.items.push({
-          k: key,
-          v: value,
-          s: size,
-          t
-        });
-        this.map.set(key, this.items.tail);
-      }
+      this.doSetTlruEntry(e, key, value, size, t);
+    } else {
+      this._size -= additionalSize;
     }
     return value;
   }
@@ -73,6 +63,17 @@ class TLRUCache extends LRUCache {
     }
     return super.ensureSize();
   }
+  doSetTlruEntry(e, k, v, s, t) {
+    if (e) {
+      e.value.v = v;
+      e.value.s = s;
+      e.value.t = t;
+      this.items.asTail(e);
+    } else {
+      this.items.push({ k, v, s, t });
+      this.map.set(k, this.items.tail);
+    }
+  }
 }
 export {
   TLRUCache