actly 1.1.0 → 1.1.5

package/dist/stores/memory.cjs

@@ -5,17 +5,37 @@ function isUnrefable(t) {
     return typeof t.unref === 'function';
 }
 // ─── Implementation ───────────────────────────────────────────────────────────
+/**
+ * Reference `SyncStateStore` implementation backed by a `Map`.
+ *
+ * # LRU semantics
+ *
+ * `Map` iteration order is insertion order, so we implement LRU by
+ * `delete` + `set` on every access — the most-recently-touched key ends up
+ * at the end of the iteration, and the oldest is `entries.keys().next().value`.
+ *
+ * # 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;
+    entries = new Map();
+    maxSize;
+    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;
@@ -29,47 +49,71 @@ class InMemoryStore {
             this.entries.delete(key);
             return undefined;
         }
+        // LRU refresh: move to most-recent position.
+        // delete + set is the canonical pattern for reordering a Map.
+        this.entries.delete(key);
+        this.entries.set(key, entry);
         return entry.value;
     }
     set(key, value, ttlMs) {
-        // ttlMs = 0 or undefined → no expiry (sentinel null)
+        // Evict if at capacity AND adding a new key (updates don't grow size).
+        if (!this.entries.has(key) && this.entries.size >= this.maxSize) {
+            const oldest = this.entries.keys().next().value;
+            if (oldest !== undefined)
+                this.entries.delete(oldest);
+        }
         const expiresAt = ttlMs != null && ttlMs > 0 ? Date.now() + ttlMs : null;
+        // delete + set ensures the key is moved to the most-recent position
+        // even on update, keeping LRU order consistent.
+        this.entries.delete(key);
         this.entries.set(key, { value, expiresAt });
     }
     delete(key) {
         this.entries.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 entry = this.entries.get(key);
+        if (!entry)
+            return false;
+        if (entry.expiresAt !== null && Date.now() > entry.expiresAt) {
+            this.entries.delete(key);
+            return false;
+        }
+        return true;
     }
-    /**
-     * Remove all entries.
-     * After this call, size() returns 0.
-     */
     clear() {
         this.entries.clear();
     }
     /**
      * 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.
+     * Pure query — does NOT touch LRU order. Expired entries discovered during
+     * the scan are evicted opportunistically (they were already invisible to
+     * `get()`, so eviction has no observable effect beyond memory reclamation).
+     *
+     * Two-pass to avoid mutating the Map during iteration (spec-safe).
      */
     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;
+        const now = Date.now();
+        const expired = [];
+        let count = 0;
+        for (const [key, entry] of this.entries) {
+            if (entry.expiresAt !== null && entry.expiresAt <= now) {
+                expired.push(key);
+            }
+            else {
+                count++;
+            }
+        }
+        for (const key of expired)
+            this.entries.delete(key);
+        return count;
     }
     /**
      * 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 +121,20 @@ 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.
+    /**
+     * Sweep all entries and remove those past their expiry time.
+     * Called by the autoCleanup interval; not part of the public contract.
+     */
     _sweep() {
         const now = Date.now();
+        const expired = [];
         for (const [key, entry] of this.entries) {
             if (entry.expiresAt !== null && now > entry.expiresAt) {
-                this.entries.delete(key);
+                expired.push(key);
             }
         }
+        for (const key of expired)
+            this.entries.delete(key);
     }
 }
 exports.InMemoryStore = InMemoryStore;

package/dist/stores/memory.d.ts

@@ -3,56 +3,77 @@ 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. 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.
      */
     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.
+     */
+    maxSize?: number;
 }
+/**
+ * Reference `SyncStateStore` implementation backed by a `Map`.
+ *
+ * # LRU semantics
+ *
+ * `Map` iteration order is insertion order, so we implement LRU by
+ * `delete` + `set` on every access — the most-recently-touched key ends up
+ * at the end of the iteration, and the oldest is `entries.keys().next().value`.
+ *
+ * # 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 maxSize;
     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.
+     * Pure query — does NOT touch LRU order. Expired entries discovered during
+     * the scan are evicted opportunistically (they were already invisible to
+     * `get()`, so eviction has no observable effect beyond memory reclamation).
+     *
+     * Two-pass to avoid mutating the Map during iteration (spec-safe).
      */
     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;
+    /**
+     * Sweep all entries and remove those past their expiry time.
+     * Called by the autoCleanup interval; not part of the public contract.
+     */
     private _sweep;
 }
 //# 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;AAwB/C,MAAM,WAAW,oBAAoB;IACnC;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,OAAO,CAAA;IAErB;;;OAGG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAE1B;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,EAAE,MAAM,CAAA;CACjB;AAID;;;;;;;;;;;;;GAaG;AACH,qBAAa,aAAc,YAAW,cAAc;IAClD,QAAQ,CAAC,KAAK,EAAG,IAAI,CAAS;IAE9B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAoC;IAC5D,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAQ;IAChC,OAAO,CAAC,YAAY,CAA4C;gBAEpD,OAAO,GAAE,oBAAyB;IA0B9C,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAiBlC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI;IAcnD,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAYzB,KAAK,IAAI,IAAI;IAIb;;;;;;;;OAQG;IACH,IAAI,IAAI,MAAM;IAiBd;;;OAGG;IACH,OAAO,IAAI,IAAI;IAOf;;;OAGG;IACH,OAAO,CAAC,MAAM;CAUf"}

package/dist/stores/memory.js

@@ -2,17 +2,37 @@ function isUnrefable(t) {
     return typeof t.unref === 'function';
 }
 // ─── Implementation ───────────────────────────────────────────────────────────
+/**
+ * Reference `SyncStateStore` implementation backed by a `Map`.
+ *
+ * # LRU semantics
+ *
+ * `Map` iteration order is insertion order, so we implement LRU by
+ * `delete` + `set` on every access — the most-recently-touched key ends up
+ * at the end of the iteration, and the oldest is `entries.keys().next().value`.
+ *
+ * # 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;
+    entries = new Map();
+    maxSize;
+    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;
@@ -26,47 +46,71 @@ export class InMemoryStore {
             this.entries.delete(key);
             return undefined;
         }
+        // LRU refresh: move to most-recent position.
+        // delete + set is the canonical pattern for reordering a Map.
+        this.entries.delete(key);
+        this.entries.set(key, entry);
         return entry.value;
     }
     set(key, value, ttlMs) {
-        // ttlMs = 0 or undefined → no expiry (sentinel null)
+        // Evict if at capacity AND adding a new key (updates don't grow size).
+        if (!this.entries.has(key) && this.entries.size >= this.maxSize) {
+            const oldest = this.entries.keys().next().value;
+            if (oldest !== undefined)
+                this.entries.delete(oldest);
+        }
         const expiresAt = ttlMs != null && ttlMs > 0 ? Date.now() + ttlMs : null;
+        // delete + set ensures the key is moved to the most-recent position
+        // even on update, keeping LRU order consistent.
+        this.entries.delete(key);
         this.entries.set(key, { value, expiresAt });
     }
     delete(key) {
         this.entries.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 entry = this.entries.get(key);
+        if (!entry)
+            return false;
+        if (entry.expiresAt !== null && Date.now() > entry.expiresAt) {
+            this.entries.delete(key);
+            return false;
+        }
+        return true;
     }
-    /**
-     * Remove all entries.
-     * After this call, size() returns 0.
-     */
     clear() {
         this.entries.clear();
     }
     /**
      * 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.
+     * Pure query — does NOT touch LRU order. Expired entries discovered during
+     * the scan are evicted opportunistically (they were already invisible to
+     * `get()`, so eviction has no observable effect beyond memory reclamation).
+     *
+     * Two-pass to avoid mutating the Map during iteration (spec-safe).
      */
     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;
+        const now = Date.now();
+        const expired = [];
+        let count = 0;
+        for (const [key, entry] of this.entries) {
+            if (entry.expiresAt !== null && entry.expiresAt <= now) {
+                expired.push(key);
+            }
+            else {
+                count++;
+            }
+        }
+        for (const key of expired)
+            this.entries.delete(key);
+        return count;
     }
     /**
      * 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 +118,20 @@ 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.
+    /**
+     * Sweep all entries and remove those past their expiry time.
+     * Called by the autoCleanup interval; not part of the public contract.
+     */
     _sweep() {
         const now = Date.now();
+        const expired = [];
         for (const [key, entry] of this.entries) {
             if (entry.expiresAt !== null && now > entry.expiresAt) {
-                this.entries.delete(key);
+                expired.push(key);
             }
         }
+        for (const key of expired)
+            this.entries.delete(key);
     }
 }
 //# 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":"AAkBA,SAAS,WAAW,CAAC,CAAU;IAC7B,OAAO,OAAQ,CAAoB,CAAC,KAAK,KAAK,UAAU,CAAA;AAC1D,CAAC;AAsCD,iFAAiF;AAEjF;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,aAAa;IACf,KAAK,GAAG,IAAa,CAAA;IAEb,OAAO,GAAG,IAAI,GAAG,EAA0B,CAAA;IAC3C,OAAO,CAAQ;IACxB,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,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,6CAA6C;QAC7C,8DAA8D;QAC9D,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAE5B,OAAO,KAAK,CAAC,KAAU,CAAA;IACzB,CAAC;IAED,GAAG,CAAI,GAAW,EAAE,KAAQ,EAAE,KAAc;QAC1C,uEAAuE;QACvE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAA;YAC/C,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;QACvD,CAAC;QAED,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,oEAAoE;QACpE,gDAAgD;QAChD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACxB,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,iEAAiE;QACjE,+CAA+C;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACnC,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAA;QACxB,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,KAAK,CAAA;QACd,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAA;IACtB,CAAC;IAED;;;;;;;;OAQG;IACH,IAAI;QACF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAA;QAEb,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI,IAAI,KAAK,CAAC,SAAS,IAAI,GAAG,EAAE,CAAC;gBACvD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACnB,CAAC;iBAAM,CAAC;gBACN,KAAK,EAAE,CAAA;YACT,CAAC;QACH,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,OAAO;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACnD,OAAO,KAAK,CAAA;IACd,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;;;OAGG;IACK,MAAM;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,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,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACnB,CAAC;QACH,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,OAAO;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACrD,CAAC;CACF"}