actly 1.1.0 → 1.2.0

package/dist/stores/memory.cjs

@@ -1,75 +1,134 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.InMemoryStore = void 0;
+exports.createDefaultStore = createDefaultStore;
+const limits_js_1 = require("../utils/limits.js");
 function isUnrefable(t) {
     return typeof t.unref === 'function';
 }
 // ─── Implementation ───────────────────────────────────────────────────────────
+/**
+ * Reference `SyncStateStore` implementation backed by a `Map` + doubly-linked
+ * list for LRU.
+ *
+ * # Properties
+ *
+ *  - `size()` is O(1) — tracked via a counter instead of full scan.
+ *  - LRU reordering uses an explicit doubly-linked list, avoiding the
+ *    `delete + set` Map churn that was 2 Map operations per `get()`.
+ *  - Default `maxSize` is bounded (`LIMITS.DEFAULT_STORE_MAX_SIZE`) when
+ *    used as the module-level default — prevents unbounded memory growth
+ *    in long-running servers.
+ *
+ * # Expiry
+ *
+ * Lazy on `get()` / `has()`: expired entries are deleted when touched.
+ * Background sweep (optional) reclaims entries that are never re-read.
+ */
 class InMemoryStore {
+    _sync = true;
+    map = new Map();
+    maxSize;
+    head; // least recently used
+    tail; // most recently used
+    cleanupTimer;
     constructor(options = {}) {
-        // Discriminant read by isSyncStore() in execute() to enforce the dedupe
-        // constraint at runtime for JS callers who bypass TypeScript.
-        this._sync = true;
-        this.entries = new Map();
-        const { autoCleanup = false, cleanupIntervalMs = 30000 } = options;
+        const { autoCleanup = false, cleanupIntervalMs = 30_000, maxSize = Number.POSITIVE_INFINITY, } = options;
+        if (!Number.isFinite(maxSize) || maxSize <= 0) {
+            // Infinity is allowed (unbounded); any other non-positive finite value
+            // is a programmer error.
+            if (maxSize !== Number.POSITIVE_INFINITY) {
+                throw new RangeError(`Actly: InMemoryStore maxSize must be a positive finite number or Infinity, got ${maxSize}`);
+            }
+        }
+        this.maxSize = maxSize;
         if (autoCleanup) {
             const timer = setInterval(() => this._sweep(), cleanupIntervalMs);
-            // Prevent the interval from keeping the Node.js process alive when the
-            // application has otherwise finished its work. Safe no-op in browsers.
             if (isUnrefable(timer))
                 timer.unref();
             this.cleanupTimer = timer;
         }
     }
     get(key) {
-        const entry = this.entries.get(key);
-        if (!entry)
+        const node = this.map.get(key);
+        if (!node)
             return undefined;
-        if (entry.expiresAt !== null && Date.now() > entry.expiresAt) {
-            this.entries.delete(key);
+        if (node.expiresAt !== null && Date.now() > node.expiresAt) {
+            this._removeNode(node);
+            this.map.delete(key);
             return undefined;
         }
-        return entry.value;
+        // LRU refresh: move to tail (most-recent).
+        this._moveToTail(node);
+        return node.value;
     }
     set(key, value, ttlMs) {
-        // ttlMs = 0 or undefined → no expiry (sentinel null)
-        const expiresAt = ttlMs != null && ttlMs > 0 ? Date.now() + ttlMs : null;
-        this.entries.set(key, { value, expiresAt });
+        const existing = this.map.get(key);
+        const now = Date.now();
+        if (existing) {
+            // Update in place — don't grow size, don't evict.
+            existing.value = value;
+            existing.expiresAt = ttlMs != null && ttlMs > 0 ? now + ttlMs : null;
+            existing.insertedAt = now;
+            this._moveToTail(existing);
+            return;
+        }
+        // New key — evict if at capacity.
+        while (this.map.size >= this.maxSize && this.head) {
+            const evict = this.head;
+            this._removeNode(evict);
+            this.map.delete(evict.key);
+        }
+        const node = {
+            key,
+            value,
+            expiresAt: ttlMs != null && ttlMs > 0 ? now + ttlMs : null,
+            insertedAt: now,
+        };
+        this.map.set(key, node);
+        this._appendTail(node);
     }
     delete(key) {
-        this.entries.delete(key);
+        const node = this.map.get(key);
+        if (!node)
+            return;
+        this._removeNode(node);
+        this.map.delete(key);
     }
     has(key) {
-        // Delegate to get() so expired entries are evicted on access.
-        return this.get(key) !== undefined;
+        // Inline the expiry check to avoid the LRU side-effect of get().
+        // `has()` should be a pure query, not a touch.
+        const node = this.map.get(key);
+        if (!node)
+            return false;
+        if (node.expiresAt !== null && Date.now() > node.expiresAt) {
+            this._removeNode(node);
+            this.map.delete(key);
+            return false;
+        }
+        return true;
     }
-    /**
-     * Remove all entries.
-     * After this call, size() returns 0.
-     */
     clear() {
-        this.entries.clear();
+        this.map.clear();
+        this.head = undefined;
+        this.tail = undefined;
     }
     /**
      * Return the count of live (non-expired) entries.
      *
-     * Expired entries are evicted during the scan, so repeated calls are
-     * slightly cheaper as the map self-prunes. O(n) in the number of entries.
+     * O(1) — returns the Map size directly. Expired-but-not-yet-
+     * evicted entries are counted; they're reclaimed lazily on next access
+     * or by the background sweep. This is intentional: a fully-accurate
+     * count would require an O(n) scan, defeating the purpose.
+     *
+     * Pure query — does NOT touch LRU order.
      */
     size() {
-        // Evict expired entries as we scan — keeps the map tidy between sweeps
-        // and ensures the returned count reflects only observable entries.
-        for (const key of this.entries.keys())
-            this.has(key);
-        return this.entries.size;
+        return this.map.size;
     }
     /**
      * Stop the background cleanup timer and release internal state.
      * Safe to call multiple times — subsequent calls are no-ops.
-     *
-     * Call destroy() when discarding a long-lived store instance to prevent
-     * timer leaks. Stores without autoCleanup enabled have nothing to release,
-     * but destroy() is safe to call on them regardless.
      */
     destroy() {
         if (this.cleanupTimer !== undefined) {
@@ -77,15 +136,78 @@ class InMemoryStore {
             this.cleanupTimer = undefined;
         }
     }
-    // Sweep all entries and remove those past their expiry time.
-    // Called by the autoCleanup interval — not part of the public contract.
+    // ─── LRU list operations ──────────────────────────────────────────────────
+    //
+    // All operations are O(1). The list runs head (LRU) → tail (MRU).
+    _appendTail(node) {
+        if (this.tail) {
+            this.tail.next = node;
+            node.prev = this.tail;
+            node.next = undefined;
+        }
+        else {
+            // Empty list — node is both head and tail.
+            this.head = node;
+        }
+        this.tail = node;
+    }
+    _removeNode(node) {
+        if (node.prev) {
+            node.prev.next = node.next;
+        }
+        else {
+            this.head = node.next;
+        }
+        if (node.next) {
+            node.next.prev = node.prev;
+        }
+        else {
+            this.tail = node.prev;
+        }
+        node.prev = undefined;
+        node.next = undefined;
+    }
+    _moveToTail(node) {
+        if (this.tail === node)
+            return; // already MRU
+        this._removeNode(node);
+        this._appendTail(node);
+    }
+    /**
+     * Sweep all entries and remove those past their expiry time.
+     * Called by the autoCleanup interval; not part of the public contract.
+     *
+     * Two-pass to avoid mutating the Map during iteration (spec-safe).
+     */
     _sweep() {
         const now = Date.now();
-        for (const [key, entry] of this.entries) {
-            if (entry.expiresAt !== null && now > entry.expiresAt) {
-                this.entries.delete(key);
+        const expired = [];
+        for (const [key, node] of this.map) {
+            if (node.expiresAt !== null && now > node.expiresAt) {
+                expired.push(key);
+            }
+        }
+        for (const key of expired) {
+            const node = this.map.get(key);
+            if (node) {
+                this._removeNode(node);
+                this.map.delete(key);
             }
         }
     }
 }
 exports.InMemoryStore = InMemoryStore;
+/**
+ * Factory for the default module-level store.
+ *
+ * Bounded by `LIMITS.DEFAULT_STORE_MAX_SIZE` with background sweep —
+ * prevents unbounded memory growth in long-running servers without
+ * requiring callers to opt in.
+ */
+function createDefaultStore() {
+    return new InMemoryStore({
+        maxSize: limits_js_1.LIMITS.DEFAULT_STORE_MAX_SIZE,
+        autoCleanup: true,
+        cleanupIntervalMs: limits_js_1.LIMITS.DEFAULT_STORE_CLEANUP_INTERVAL_MS,
+    });
+}

package/dist/stores/memory.d.ts

@@ -3,56 +3,96 @@ export interface InMemoryStoreOptions {
     /**
      * Periodically sweep and remove expired entries in the background.
      *
-     * Disabled by default. The store evicts lazily on get()/has() access, which
-     * is sufficient for most use cases. Enable autoCleanup when the store is
-     * long-lived and accumulates many TTL'd entries that are never re-read — for
-     * example, a server-side cache that receives write-heavy traffic with low
-     * subsequent read rates.
-     *
-     * The sweep does not affect observable store semantics: expired entries are
-     * already invisible to get()/has()/size() before the sweep runs.
+     * Disabled by default for explicit-store users. The DEFAULT module-level
+     * store (used when you call `act()` without `withStore()`) enables this
+     * automatically — see `core/act.ts`.
      */
     autoCleanup?: boolean;
     /**
      * Interval between background sweeps in milliseconds.
-     * Defaults to 30 000 (30 seconds). Ignored when autoCleanup is false.
-     *
-     * Choose a value appropriate to your TTL distribution — sweeping more often
-     * than your shortest TTL is wasteful; sweeping much less often than your
-     * longest TTL wastes memory.
+     * Defaults to 30 000 (30 seconds). Ignored when `autoCleanup` is false.
      */
     cleanupIntervalMs?: number;
+    /**
+     * Maximum number of live entries the store will hold.
+     *
+     * When `set()` would exceed this limit, the least-recently-used entry is
+     * evicted before the new one is inserted (LRU semantics). Updates to an
+     * existing key do not trigger eviction.
+     *
+     * Defaults to `Infinity` (unbounded). Set a finite value for long-running
+     * caches with high-cardinality keys to bound memory usage.
+     *
+     * The LRU order is updated on `get()` and `set()` — both move the accessed
+     * key to the most-recent position. Implementation uses a doubly-linked
+     * list for O(1) reordering (no `delete + set` Map churn).
+     */
+    maxSize?: number;
 }
+/**
+ * Reference `SyncStateStore` implementation backed by a `Map` + doubly-linked
+ * list for LRU.
+ *
+ * # Properties
+ *
+ *  - `size()` is O(1) — tracked via a counter instead of full scan.
+ *  - LRU reordering uses an explicit doubly-linked list, avoiding the
+ *    `delete + set` Map churn that was 2 Map operations per `get()`.
+ *  - Default `maxSize` is bounded (`LIMITS.DEFAULT_STORE_MAX_SIZE`) when
+ *    used as the module-level default — prevents unbounded memory growth
+ *    in long-running servers.
+ *
+ * # Expiry
+ *
+ * Lazy on `get()` / `has()`: expired entries are deleted when touched.
+ * Background sweep (optional) reclaims entries that are never re-read.
+ */
 export declare class InMemoryStore implements SyncStateStore {
     readonly _sync: true;
-    private readonly entries;
+    private readonly map;
+    private readonly maxSize;
+    private head?;
+    private tail?;
     private cleanupTimer;
     constructor(options?: InMemoryStoreOptions);
     get<T>(key: string): T | undefined;
     set<T>(key: string, value: T, ttlMs?: number): void;
     delete(key: string): void;
     has(key: string): boolean;
-    /**
-     * Remove all entries.
-     * After this call, size() returns 0.
-     */
     clear(): void;
     /**
      * Return the count of live (non-expired) entries.
      *
-     * Expired entries are evicted during the scan, so repeated calls are
-     * slightly cheaper as the map self-prunes. O(n) in the number of entries.
+     * O(1) — returns the Map size directly. Expired-but-not-yet-
+     * evicted entries are counted; they're reclaimed lazily on next access
+     * or by the background sweep. This is intentional: a fully-accurate
+     * count would require an O(n) scan, defeating the purpose.
+     *
+     * Pure query — does NOT touch LRU order.
      */
     size(): number;
     /**
      * Stop the background cleanup timer and release internal state.
      * Safe to call multiple times — subsequent calls are no-ops.
-     *
-     * Call destroy() when discarding a long-lived store instance to prevent
-     * timer leaks. Stores without autoCleanup enabled have nothing to release,
-     * but destroy() is safe to call on them regardless.
      */
     destroy(): void;
+    private _appendTail;
+    private _removeNode;
+    private _moveToTail;
+    /**
+     * Sweep all entries and remove those past their expiry time.
+     * Called by the autoCleanup interval; not part of the public contract.
+     *
+     * Two-pass to avoid mutating the Map during iteration (spec-safe).
+     */
     private _sweep;
 }
+/**
+ * Factory for the default module-level store.
+ *
+ * Bounded by `LIMITS.DEFAULT_STORE_MAX_SIZE` with background sweep —
+ * prevents unbounded memory growth in long-running servers without
+ * requiring callers to opt in.
+ */
+export declare function createDefaultStore(): InMemoryStore;
 //# sourceMappingURL=memory.d.ts.map

package/dist/stores/memory.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../src/stores/memory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAA;AAuB/C,MAAM,WAAW,oBAAoB;IACnC;;;;;;;;;;;OAWG;IACH,WAAW,CAAC,EAAE,OAAO,CAAA;IAErB;;;;;;;OAOG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAC3B;AAID,qBAAa,aAAc,YAAW,cAAc;IAGlD,QAAQ,CAAC,KAAK,EAAG,IAAI,CAAS;IAE9B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAoC;IAC5D,OAAO,CAAC,YAAY,CAA4C;gBAEpD,OAAO,GAAE,oBAAyB;IAY9C,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAYlC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI;IAMnD,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAKzB;;;OAGG;IACH,KAAK,IAAI,IAAI;IAIb;;;;;OAKG;IACH,IAAI,IAAI,MAAM;IAOd;;;;;;;OAOG;IACH,OAAO,IAAI,IAAI;IASf,OAAO,CAAC,MAAM;CAQf"}
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../src/stores/memory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAA;AAkC/C,MAAM,WAAW,oBAAoB;IACnC;;;;;;OAMG;IACH,WAAW,CAAC,EAAE,OAAO,CAAA;IAErB;;;OAGG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAE1B;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,EAAE,MAAM,CAAA;CACjB;AAID;;;;;;;;;;;;;;;;;GAiBG;AACH,qBAAa,aAAc,YAAW,cAAc;IAClD,QAAQ,CAAC,KAAK,EAAG,IAAI,CAAS;IAE9B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAA6B;IACjD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAQ;IAChC,OAAO,CAAC,IAAI,CAAC,CAAS;IACtB,OAAO,CAAC,IAAI,CAAC,CAAS;IACtB,OAAO,CAAC,YAAY,CAA4C;gBAEpD,OAAO,GAAE,oBAAyB;IA0B9C,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAgBlC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI;IA8BnD,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAOzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAazB,KAAK,IAAI,IAAI;IAMb;;;;;;;;;OASG;IACH,IAAI,IAAI,MAAM;IAId;;;OAGG;IACH,OAAO,IAAI,IAAI;IAWf,OAAO,CAAC,WAAW;IAYnB,OAAO,CAAC,WAAW;IAenB,OAAO,CAAC,WAAW;IAMnB;;;;;OAKG;IACH,OAAO,CAAC,MAAM;CAgBf;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,IAAI,aAAa,CAMlD"}

package/dist/stores/memory.js

@@ -1,72 +1,130 @@
+import { LIMITS } from '../utils/limits.js';
 function isUnrefable(t) {
     return typeof t.unref === 'function';
 }
 // ─── Implementation ───────────────────────────────────────────────────────────
+/**
+ * Reference `SyncStateStore` implementation backed by a `Map` + doubly-linked
+ * list for LRU.
+ *
+ * # Properties
+ *
+ *  - `size()` is O(1) — tracked via a counter instead of full scan.
+ *  - LRU reordering uses an explicit doubly-linked list, avoiding the
+ *    `delete + set` Map churn that was 2 Map operations per `get()`.
+ *  - Default `maxSize` is bounded (`LIMITS.DEFAULT_STORE_MAX_SIZE`) when
+ *    used as the module-level default — prevents unbounded memory growth
+ *    in long-running servers.
+ *
+ * # Expiry
+ *
+ * Lazy on `get()` / `has()`: expired entries are deleted when touched.
+ * Background sweep (optional) reclaims entries that are never re-read.
+ */
 export class InMemoryStore {
+    _sync = true;
+    map = new Map();
+    maxSize;
+    head; // least recently used
+    tail; // most recently used
+    cleanupTimer;
     constructor(options = {}) {
-        // Discriminant read by isSyncStore() in execute() to enforce the dedupe
-        // constraint at runtime for JS callers who bypass TypeScript.
-        this._sync = true;
-        this.entries = new Map();
-        const { autoCleanup = false, cleanupIntervalMs = 30000 } = options;
+        const { autoCleanup = false, cleanupIntervalMs = 30_000, maxSize = Number.POSITIVE_INFINITY, } = options;
+        if (!Number.isFinite(maxSize) || maxSize <= 0) {
+            // Infinity is allowed (unbounded); any other non-positive finite value
+            // is a programmer error.
+            if (maxSize !== Number.POSITIVE_INFINITY) {
+                throw new RangeError(`Actly: InMemoryStore maxSize must be a positive finite number or Infinity, got ${maxSize}`);
+            }
+        }
+        this.maxSize = maxSize;
         if (autoCleanup) {
             const timer = setInterval(() => this._sweep(), cleanupIntervalMs);
-            // Prevent the interval from keeping the Node.js process alive when the
-            // application has otherwise finished its work. Safe no-op in browsers.
             if (isUnrefable(timer))
                 timer.unref();
             this.cleanupTimer = timer;
         }
     }
     get(key) {
-        const entry = this.entries.get(key);
-        if (!entry)
+        const node = this.map.get(key);
+        if (!node)
             return undefined;
-        if (entry.expiresAt !== null && Date.now() > entry.expiresAt) {
-            this.entries.delete(key);
+        if (node.expiresAt !== null && Date.now() > node.expiresAt) {
+            this._removeNode(node);
+            this.map.delete(key);
             return undefined;
         }
-        return entry.value;
+        // LRU refresh: move to tail (most-recent).
+        this._moveToTail(node);
+        return node.value;
     }
     set(key, value, ttlMs) {
-        // ttlMs = 0 or undefined → no expiry (sentinel null)
-        const expiresAt = ttlMs != null && ttlMs > 0 ? Date.now() + ttlMs : null;
-        this.entries.set(key, { value, expiresAt });
+        const existing = this.map.get(key);
+        const now = Date.now();
+        if (existing) {
+            // Update in place — don't grow size, don't evict.
+            existing.value = value;
+            existing.expiresAt = ttlMs != null && ttlMs > 0 ? now + ttlMs : null;
+            existing.insertedAt = now;
+            this._moveToTail(existing);
+            return;
+        }
+        // New key — evict if at capacity.
+        while (this.map.size >= this.maxSize && this.head) {
+            const evict = this.head;
+            this._removeNode(evict);
+            this.map.delete(evict.key);
+        }
+        const node = {
+            key,
+            value,
+            expiresAt: ttlMs != null && ttlMs > 0 ? now + ttlMs : null,
+            insertedAt: now,
+        };
+        this.map.set(key, node);
+        this._appendTail(node);
     }
     delete(key) {
-        this.entries.delete(key);
+        const node = this.map.get(key);
+        if (!node)
+            return;
+        this._removeNode(node);
+        this.map.delete(key);
     }
     has(key) {
-        // Delegate to get() so expired entries are evicted on access.
-        return this.get(key) !== undefined;
+        // Inline the expiry check to avoid the LRU side-effect of get().
+        // `has()` should be a pure query, not a touch.
+        const node = this.map.get(key);
+        if (!node)
+            return false;
+        if (node.expiresAt !== null && Date.now() > node.expiresAt) {
+            this._removeNode(node);
+            this.map.delete(key);
+            return false;
+        }
+        return true;
     }
-    /**
-     * Remove all entries.
-     * After this call, size() returns 0.
-     */
     clear() {
-        this.entries.clear();
+        this.map.clear();
+        this.head = undefined;
+        this.tail = undefined;
     }
     /**
      * Return the count of live (non-expired) entries.
      *
-     * Expired entries are evicted during the scan, so repeated calls are
-     * slightly cheaper as the map self-prunes. O(n) in the number of entries.
+     * O(1) — returns the Map size directly. Expired-but-not-yet-
+     * evicted entries are counted; they're reclaimed lazily on next access
+     * or by the background sweep. This is intentional: a fully-accurate
+     * count would require an O(n) scan, defeating the purpose.
+     *
+     * Pure query — does NOT touch LRU order.
      */
     size() {
-        // Evict expired entries as we scan — keeps the map tidy between sweeps
-        // and ensures the returned count reflects only observable entries.
-        for (const key of this.entries.keys())
-            this.has(key);
-        return this.entries.size;
+        return this.map.size;
     }
     /**
      * Stop the background cleanup timer and release internal state.
      * Safe to call multiple times — subsequent calls are no-ops.
-     *
-     * Call destroy() when discarding a long-lived store instance to prevent
-     * timer leaks. Stores without autoCleanup enabled have nothing to release,
-     * but destroy() is safe to call on them regardless.
      */
     destroy() {
         if (this.cleanupTimer !== undefined) {
@@ -74,15 +132,78 @@ export class InMemoryStore {
             this.cleanupTimer = undefined;
         }
     }
-    // Sweep all entries and remove those past their expiry time.
-    // Called by the autoCleanup interval — not part of the public contract.
+    // ─── LRU list operations ──────────────────────────────────────────────────
+    //
+    // All operations are O(1). The list runs head (LRU) → tail (MRU).
+    _appendTail(node) {
+        if (this.tail) {
+            this.tail.next = node;
+            node.prev = this.tail;
+            node.next = undefined;
+        }
+        else {
+            // Empty list — node is both head and tail.
+            this.head = node;
+        }
+        this.tail = node;
+    }
+    _removeNode(node) {
+        if (node.prev) {
+            node.prev.next = node.next;
+        }
+        else {
+            this.head = node.next;
+        }
+        if (node.next) {
+            node.next.prev = node.prev;
+        }
+        else {
+            this.tail = node.prev;
+        }
+        node.prev = undefined;
+        node.next = undefined;
+    }
+    _moveToTail(node) {
+        if (this.tail === node)
+            return; // already MRU
+        this._removeNode(node);
+        this._appendTail(node);
+    }
+    /**
+     * Sweep all entries and remove those past their expiry time.
+     * Called by the autoCleanup interval; not part of the public contract.
+     *
+     * Two-pass to avoid mutating the Map during iteration (spec-safe).
+     */
     _sweep() {
         const now = Date.now();
-        for (const [key, entry] of this.entries) {
-            if (entry.expiresAt !== null && now > entry.expiresAt) {
-                this.entries.delete(key);
+        const expired = [];
+        for (const [key, node] of this.map) {
+            if (node.expiresAt !== null && now > node.expiresAt) {
+                expired.push(key);
+            }
+        }
+        for (const key of expired) {
+            const node = this.map.get(key);
+            if (node) {
+                this._removeNode(node);
+                this.map.delete(key);
             }
         }
     }
 }
+/**
+ * Factory for the default module-level store.
+ *
+ * Bounded by `LIMITS.DEFAULT_STORE_MAX_SIZE` with background sweep —
+ * prevents unbounded memory growth in long-running servers without
+ * requiring callers to opt in.
+ */
+export function createDefaultStore() {
+    return new InMemoryStore({
+        maxSize: LIMITS.DEFAULT_STORE_MAX_SIZE,
+        autoCleanup: true,
+        cleanupIntervalMs: LIMITS.DEFAULT_STORE_CLEANUP_INTERVAL_MS,
+    });
+}
 //# sourceMappingURL=memory.js.map

package/dist/stores/memory.js.map

@@ -1 +1 @@
-{"version":3,"file":"memory.js","sourceRoot":"","sources":["../../src/stores/memory.ts"],"names":[],"mappings":"AAiBA,SAAS,WAAW,CAAC,CAAU;IAC7B,OAAO,OAAQ,CAAoB,CAAC,KAAK,KAAK,UAAU,CAAA;AAC1D,CAAC;AA8BD,iFAAiF;AAEjF,MAAM,OAAO,aAAa;IAQxB,YAAY,UAAgC,EAAE;QAP9C,wEAAwE;QACxE,8DAA8D;QACrD,UAAK,GAAG,IAAa,CAAA;QAEb,YAAO,GAAG,IAAI,GAAG,EAA0B,CAAA;QAI1D,MAAM,EAAE,WAAW,GAAG,KAAK,EAAE,iBAAiB,GAAG,KAAM,EAAE,GAAG,OAAO,CAAA;QAEnE,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,iBAAiB,CAAC,CAAA;YACjE,uEAAuE;YACvE,uEAAuE;YACvE,IAAI,WAAW,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,KAAK,EAAE,CAAA;YACrC,IAAI,CAAC,YAAY,GAAG,KAAK,CAAA;QAC3B,CAAC;IACH,CAAC;IAED,GAAG,CAAI,GAAW;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAA;QAE5B,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YAC7D,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACxB,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,OAAO,KAAK,CAAC,KAAU,CAAA;IACzB,CAAC;IAED,GAAG,CAAI,GAAW,EAAE,KAAQ,EAAE,KAAc;QAC1C,qDAAqD;QACrD,MAAM,SAAS,GAAG,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;QACxE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAA;IAC7C,CAAC;IAED,MAAM,CAAC,GAAW;QAChB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IAC1B,CAAC;IAED,GAAG,CAAC,GAAW;QACb,8DAA8D;QAC9D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAA;IACpC,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;IACtB,CAAC;IAED;;;;;OAKG;IACH,IAAI;QACF,uEAAuE;QACvE,mEAAmE;QACnE,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACpD,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAA;IAC1B,CAAC;IAED;;;;;;;OAOG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YACpC,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;YAChC,IAAI,CAAC,YAAY,GAAG,SAAS,CAAA;QAC/B,CAAC;IACH,CAAC;IAED,6DAA6D;IAC7D,wEAAwE;IAChE,MAAM;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;gBACtD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;CACF"}
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../../src/stores/memory.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAA;AA2B3C,SAAS,WAAW,CAAC,CAAU;IAC7B,OAAO,OAAQ,CAAoB,CAAC,KAAK,KAAK,UAAU,CAAA;AAC1D,CAAC;AAqCD,iFAAiF;AAEjF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,aAAa;IACf,KAAK,GAAG,IAAa,CAAA;IAEb,GAAG,GAAG,IAAI,GAAG,EAAmB,CAAA;IAChC,OAAO,CAAQ;IACxB,IAAI,CAAU,CAAE,sBAAsB;IACtC,IAAI,CAAU,CAAE,qBAAqB;IACrC,YAAY,CAA4C;IAEhE,YAAY,UAAgC,EAAE;QAC5C,MAAM,EACJ,WAAW,GAAG,KAAK,EACnB,iBAAiB,GAAG,MAAM,EAC1B,OAAO,GAAG,MAAM,CAAC,iBAAiB,GACnC,GAAG,OAAO,CAAA;QAEX,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;YAC9C,uEAAuE;YACvE,yBAAyB;YACzB,IAAI,OAAO,KAAK,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBACzC,MAAM,IAAI,UAAU,CAClB,kFAAkF,OAAO,EAAE,CAC5F,CAAA;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAEtB,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,iBAAiB,CAAC,CAAA;YACjE,IAAI,WAAW,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,KAAK,EAAE,CAAA;YACrC,IAAI,CAAC,YAAY,GAAG,KAAK,CAAA;QAC3B,CAAC;IACH,CAAC;IAED,GAAG,CAAI,GAAW;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAA;QAE3B,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC3D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACtB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACpB,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,2CAA2C;QAC3C,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QAEtB,OAAO,IAAI,CAAC,KAAU,CAAA;IACxB,CAAC;IAED,GAAG,CAAI,GAAW,EAAE,KAAQ,EAAE,KAAc;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAEtB,IAAI,QAAQ,EAAE,CAAC;YACb,kDAAkD;YAClD,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;YACtB,QAAQ,CAAC,SAAS,GAAG,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;YACpE,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAA;YACzB,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAA;YAC1B,OAAM;QACR,CAAC;QAED,kCAAkC;QAClC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAClD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAA;YACvB,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;YACvB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAC5B,CAAC;QAED,MAAM,IAAI,GAAY;YACpB,GAAG;YACH,KAAK;YACL,SAAS,EAAE,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI;YAC1D,UAAU,EAAE,GAAG;SAChB,CAAA;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QACvB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC;IAED,MAAM,CAAC,GAAW;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,CAAC,IAAI;YAAE,OAAM;QACjB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACtB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACtB,CAAC;IAED,GAAG,CAAC,GAAW;QACb,iEAAiE;QACjE,+CAA+C;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAA;QACvB,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC3D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACtB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACpB,OAAO,KAAK,CAAA;QACd,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,KAAK;QACH,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAA;QACrB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAA;IACvB,CAAC;IAED;;;;;;;;;OASG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAA;IACtB,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YACpC,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;YAChC,IAAI,CAAC,YAAY,GAAG,SAAS,CAAA;QAC/B,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,EAAE;IACF,kEAAkE;IAE1D,WAAW,CAAC,IAAa;QAC/B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;YACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YACrB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAA;QACvB,CAAC;aAAM,CAAC;YACN,2CAA2C;YAC3C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAClB,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;IAEO,WAAW,CAAC,IAAa;QAC/B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAC5B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACvB,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAC5B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACvB,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,SAAS,CAAA;QACrB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAA;IACvB,CAAC;IAEO,WAAW,CAAC,IAAa;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,OAAM,CAAE,cAAc;QAC9C,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC;IAED;;;;;OAKG;IACK,MAAM;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBACpD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACnB,CAAC;QACH,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC9B,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;gBACtB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACtB,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO,IAAI,aAAa,CAAC;QACvB,OAAO,EAAE,MAAM,CAAC,sBAAsB;QACtC,WAAW,EAAE,IAAI;QACjB,iBAAiB,EAAE,MAAM,CAAC,iCAAiC;KAC5D,CAAC,CAAA;AACJ,CAAC"}