.github/workflows/benchmark.yml

@@ -6,7 +6,7 @@ jobs:
   build:
     strategy:
       matrix:
-        node-version: [16.x, 18.x, 19.x]
+        node-version: [18.x, 20.x, 22.x]
         platform:
           - os: ubuntu-latest
             shell: bash

.github/workflows/ci.yml

@@ -6,7 +6,7 @@ jobs:
   build:
     strategy:
       matrix:
-        node-version: [18.x, 20.x, 21.x]
+        node-version: [18.x, 20.x, 22.x]
         platform:
           - os: ubuntu-latest
             shell: bash

CHANGELOG.md

@@ -1,5 +1,13 @@
 # cringe lorg
 
+## 10.3.0
+
+- add `forceFetch()` method
+- set `disposeReason` to `'expire'` when it's the result of a TTL
+  expiration, or `'fetch'` when it's the result of an aborted
+  or `undefined`-returning `fetch()`
+- add `memo()` method
+
 ## 10.2.0
 
 - types: implement the `Map<K, V>` interface

package.json

@@ -1,7 +1,7 @@
 {
   "name": "lru-cache",
   "description": "A cache object that deletes the least-recently-used items.",
-  "version": "10.2.2",
+  "version": "10.3.0",
   "author": "Isaac Z. Schlueter <i@izs.me>",
   "keywords": [
     "mru",

test/dispose.ts

@@ -1,5 +1,7 @@
+import { Clock } from 'clock-mock'
 import t from 'tap'
 import { LRUCache as LRU } from '../dist/esm/index.js'
+import { LRUCache } from '../src/index.js'
 
 t.test('disposal', t => {
   const disposed: any[] = []
@@ -205,3 +207,53 @@ t.test('disposeAfter', t => {
 
   t.end()
 })
+
+t.test('expiration reflected in dispose reason', async t => {
+  const clock = new Clock()
+  t.teardown(clock.enter())
+  clock.advance(1)
+  const disposes: [number, number, LRUCache.DisposeReason][] = []
+  const c = new LRUCache<number, number>({
+    ttl: 100,
+    max: 5,
+    dispose: (v, k, r) => disposes.push([k, v, r]),
+  })
+  c.set(1, 1)
+  c.set(2, 2, { ttl: 10 })
+  c.set(3, 3)
+  c.set(4, 4)
+  c.set(5, 5)
+  t.strictSame(disposes, [])
+  c.set(6, 6)
+  t.strictSame(disposes, [[1, 1, 'evict']])
+  c.delete(6)
+  c.delete(5)
+  c.delete(4)
+  // test when it's the last one, and when it's not, because we
+  // delete with cache.clear() when it's the only entry.
+  t.strictSame(disposes, [
+    [1, 1, 'evict'],
+    [6, 6, 'delete'],
+    [5, 5, 'delete'],
+    [4, 4, 'delete'],
+  ])
+  clock.advance(20)
+  t.equal(c.get(2), undefined)
+  t.strictSame(disposes, [
+    [1, 1, 'evict'],
+    [6, 6, 'delete'],
+    [5, 5, 'delete'],
+    [4, 4, 'delete'],
+    [2, 2, 'expire'],
+  ])
+  clock.advance(200)
+  t.equal(c.get(3), undefined)
+  t.strictSame(disposes, [
+    [1, 1, 'evict'],
+    [6, 6, 'delete'],
+    [5, 5, 'delete'],
+    [4, 4, 'delete'],
+    [2, 2, 'expire'],
+    [3, 3, 'expire'],
+  ])
+})

test/fetch.ts

@@ -673,7 +673,7 @@ t.test('abort, but then keep on fetching anyway', async t => {
   t.equal(ac.signal.reason, er)
   t.equal(cache.get(1), 1)
 
-  const p2 = cache.fetch(2)
+  const p2 = cache.forceFetch(2)
   t.equal(cache.get(2), undefined)
   cache.delete(2)
   t.equal(cache.get(2), undefined)
@@ -696,6 +696,9 @@ t.test('abort, but then keep on fetching anyway', async t => {
   const p4 = cache.fetch(4)
   clock.advance(100)
   t.equal(await p4, undefined)
+  const p5 = cache.forceFetch(4)
+  clock.advance(100)
+  await t.rejects(p5, { message: 'fetch() returned undefined' })
   t.same(e.valList, before, 'did not update values with undefined')
 })