@ckb-ccc/core 1.11.3 → 1.11.4

package/CHANGELOG.md

@@ -1,5 +1,12 @@
 # @ckb-ccc/core
 
+## 1.11.4
+### Patch Changes
+
+
+
+- [#295](https://github.com/ckb-devrel/ccc/pull/295) [`1eb030f`](https://github.com/ckb-devrel/ccc/commit/1eb030fde95c545561a092a4025747e6d14fc8de) Thanks [@Hanssen0](https://github.com/Hanssen0)! - fix(core): `ClientCacheMemory.findCells` never stops
+
 ## 1.11.3
 ### Patch Changes
 

package/dist/client/cache/memory.advanced.d.ts

@@ -13,43 +13,40 @@ export declare function filterNumByRange(lengthLike: NumLike, range: [NumLike, N
 export declare function filterScriptByLenRange(valueLike?: ScriptLike, scriptLenRange?: [NumLike, NumLike]): boolean;
 export declare function filterCell(searchKeyLike: ClientCollectableSearchKeyLike, cellLike: CellLike): boolean;
 /**
- * A Least Recently Used (LRU) cache implemented using a Map.
- *
- * This class extends the built-in Map to provide an LRU cache with a fixed capacity.
- * When the cache is full, the least recently used entry is automatically evicted.
- *
- * @template K The type of the keys in the cache.
- * @template V The type of the values in the cache.
+ * A Map-like class that implements a "Least Recently Used" (LRU) cache policy.
+ * When the cache reaches its capacity, the least recently used item is removed.
+ * @public
  */
 export declare class MapLru<K, V> extends Map<K, V> {
     private readonly capacity;
+    private readonly lru;
     /**
-     * Constructs a new MapLru instance.
-     *
-     * @param capacity The maximum number of entries the cache can hold. Must be a positive integer.
-     * @throws {Error} If the capacity is not a positive integer.
+     * @param capacity - The maximum number of items to store in the cache. Must be a positive integer.
      */
     constructor(capacity: number);
     /**
-     * Retrieves a value from the cache.
-     *
-     * If the key is present in the cache, the value is moved to the most-recently-used position.
-     *
-     * @param key The key of the value to retrieve.
-     * @returns The value associated with the key, or undefined if the key is not present.
+     * Retrieves the value for a given key and marks it as recently used.
+     * @param key - The key of the element to retrieve.
+     * @returns The value associated with the key, or `undefined` if the key is not in the cache.
      */
     get(key: K): V | undefined;
     /**
-     * Inserts a new value into the cache, or updates an existing value.
-     *
-     * If the key is already present in the cache, it is first deleted so that the re-insertion
-     * moves it to the most-recently-used position.
-     * If the cache is over capacity after the insertion, the least recently used entry is evicted.
-     *
-     * @param key The key of the value to insert or update.
-     * @param value The value to associate with the key.
-     * @returns This MapLru instance.
+     * Adds or updates a key-value pair in the cache and marks the key as recently used.
+     * If setting a new key causes the cache to exceed its capacity, the least recently used item is evicted.
+     * @param key - The key of the element to add or update.
+     * @param value - The value of the element to add or update.
+     * @returns The `MapLru` instance.
      */
     set(key: K, value: V): this;
+    /**
+     * Removes the specified element from the cache.
+     * @param key - The key of the element to remove.
+     * @returns `true` if an element in the `MapLru` object existed and has been removed, or `false` if the element does not exist.
+     */
+    delete(key: K): boolean;
+    /**
+     * Removes all key-value pairs from the cache.
+     */
+    clear(): void;
 }
 //# sourceMappingURL=memory.advanced.d.ts.map

package/dist/client/cache/memory.advanced.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"memory.advanced.d.ts","sourceRoot":"","sources":["../../../src/client/cache/memory.advanced.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAU,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAE,OAAO,EAAW,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,OAAO,EAAW,MAAM,oBAAoB,CAAC;AACtD,OAAO,EACL,8BAA8B,EAE/B,MAAM,4BAA4B,CAAC;AAGpC,eAAO,MAAM,4BAA4B,QAA0B,CAAC;AAGpE,MAAM,MAAM,UAAU,GAClB;IACE,KAAK;IACL,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,GAAG,YAAY,CAAC,CAAC;CAC1E,GACD,CAAC,IAAI,EAAE,IAAI,CAAC,GACZ,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AAEtB,wBAAgB,UAAU,CACxB,QAAQ,EAAE,OAAO,EACjB,UAAU,EAAE,OAAO,GAAG,SAAS,EAC/B,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS,GACzC,OAAO,CAgBT;AAED,wBAAgB,YAAY,CAC1B,SAAS,EAAE,UAAU,GAAG,SAAS,EACjC,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,UAAU,EAAE,QAAQ,GAAG,OAAO,GAAG,SAAS,GACzC,OAAO,CAkBT;AAED,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,OAAO,EACnB,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,SAAS,GACpC,OAAO,CAQT;AAED,wBAAgB,sBAAsB,CACpC,SAAS,CAAC,EAAE,UAAU,EACtB,cAAc,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAClC,OAAO,CAYT;AAED,wBAAgB,UAAU,CACxB,aAAa,EAAE,8BAA8B,EAC7C,QAAQ,EAAE,QAAQ,GACjB,OAAO,CA4CT;AAED;;;;;;;;GAQG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAO7B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IANrC;;;;;OAKG;gBAC0B,QAAQ,EAAE,MAAM;IAO7C;;;;;;;OAOG;IACM,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAenC;;;;;;;;;;OAUG;IACM,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;CAarC"}
+{"version":3,"file":"memory.advanced.d.ts","sourceRoot":"","sources":["../../../src/client/cache/memory.advanced.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAU,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAE,OAAO,EAAW,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,OAAO,EAAW,MAAM,oBAAoB,CAAC;AACtD,OAAO,EACL,8BAA8B,EAE/B,MAAM,4BAA4B,CAAC;AAGpC,eAAO,MAAM,4BAA4B,QAA0B,CAAC;AAGpE,MAAM,MAAM,UAAU,GAClB;IACE,KAAK;IACL,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,GAAG,YAAY,CAAC,CAAC;CAC1E,GACD,CAAC,IAAI,EAAE,IAAI,CAAC,GACZ,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AAEtB,wBAAgB,UAAU,CACxB,QAAQ,EAAE,OAAO,EACjB,UAAU,EAAE,OAAO,GAAG,SAAS,EAC/B,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS,GACzC,OAAO,CAgBT;AAED,wBAAgB,YAAY,CAC1B,SAAS,EAAE,UAAU,GAAG,SAAS,EACjC,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,UAAU,EAAE,QAAQ,GAAG,OAAO,GAAG,SAAS,GACzC,OAAO,CAkBT;AAED,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,OAAO,EACnB,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,SAAS,GACpC,OAAO,CAQT;AAED,wBAAgB,sBAAsB,CACpC,SAAS,CAAC,EAAE,UAAU,EACtB,cAAc,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAClC,OAAO,CAYT;AAED,wBAAgB,UAAU,CACxB,aAAa,EAAE,8BAA8B,EAC7C,QAAQ,EAAE,QAAQ,GACjB,OAAO,CA4CT;AAED;;;;GAIG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAM7B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IALrC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAwB;IAE5C;;OAEG;gBAC0B,QAAQ,EAAE,MAAM;IAQ7C;;;;OAIG;IACM,GAAG,CAAC,GAAG,EAAE,CAAC;IAWnB;;;;;;OAMG;IACM,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IAc7B;;;;OAIG;IACM,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAShC;;OAEG;IACM,KAAK;CAIf"}

package/dist/client/cache/memory.advanced.js

@@ -80,67 +80,70 @@ export function filterCell(searchKeyLike, cellLike) {
     return true;
 }
 /**
- * A Least Recently Used (LRU) cache implemented using a Map.
- *
- * This class extends the built-in Map to provide an LRU cache with a fixed capacity.
- * When the cache is full, the least recently used entry is automatically evicted.
- *
- * @template K The type of the keys in the cache.
- * @template V The type of the values in the cache.
+ * A Map-like class that implements a "Least Recently Used" (LRU) cache policy.
+ * When the cache reaches its capacity, the least recently used item is removed.
+ * @public
  */
 export class MapLru extends Map {
     /**
-     * Constructs a new MapLru instance.
-     *
-     * @param capacity The maximum number of entries the cache can hold. Must be a positive integer.
-     * @throws {Error} If the capacity is not a positive integer.
+     * @param capacity - The maximum number of items to store in the cache. Must be a positive integer.
      */
     constructor(capacity) {
         super();
         this.capacity = capacity;
+        this.lru = new Set();
         if (!Number.isInteger(capacity) || capacity < 1) {
             throw new Error("Capacity must be a positive integer");
         }
     }
     /**
-     * Retrieves a value from the cache.
-     *
-     * If the key is present in the cache, the value is moved to the most-recently-used position.
-     *
-     * @param key The key of the value to retrieve.
-     * @returns The value associated with the key, or undefined if the key is not present.
+     * Retrieves the value for a given key and marks it as recently used.
+     * @param key - The key of the element to retrieve.
+     * @returns The value associated with the key, or `undefined` if the key is not in the cache.
      */
     get(key) {
-        // Check if the key exists. If not, return undefined.
         if (!super.has(key)) {
-            return undefined;
+            return;
         }
-        const value = super.get(key);
-        // Move to most-recently-used position
-        super.delete(key);
-        super.set(key, value);
-        return value;
+        this.lru.delete(key);
+        this.lru.add(key);
+        return super.get(key);
     }
     /**
-     * Inserts a new value into the cache, or updates an existing value.
-     *
-     * If the key is already present in the cache, it is first deleted so that the re-insertion
-     * moves it to the most-recently-used position.
-     * If the cache is over capacity after the insertion, the least recently used entry is evicted.
-     *
-     * @param key The key of the value to insert or update.
-     * @param value The value to associate with the key.
-     * @returns This MapLru instance.
+     * Adds or updates a key-value pair in the cache and marks the key as recently used.
+     * If setting a new key causes the cache to exceed its capacity, the least recently used item is evicted.
+     * @param key - The key of the element to add or update.
+     * @param value - The value of the element to add or update.
+     * @returns The `MapLru` instance.
      */
     set(key, value) {
-        // Delete and re-insert to move key to the end (most-recently-used)
-        super.delete(key);
         super.set(key, value);
-        // Evict oldest if over capacity
-        if (super.size > this.capacity) {
-            const oldestKey = super.keys().next().value;
-            super.delete(oldestKey);
+        this.lru.delete(key);
+        this.lru.add(key);
+        // Evict the oldest entry if capacity is exceeded.
+        if (this.lru.size > this.capacity) {
+            const oldestKey = this.lru.keys().next().value;
+            this.delete(oldestKey);
         }
         return this;
     }
+    /**
+     * Removes the specified element from the cache.
+     * @param key - The key of the element to remove.
+     * @returns `true` if an element in the `MapLru` object existed and has been removed, or `false` if the element does not exist.
+     */
+    delete(key) {
+        if (!super.delete(key)) {
+            return false;
+        }
+        this.lru.delete(key);
+        return true;
+    }
+    /**
+     * Removes all key-value pairs from the cache.
+     */
+    clear() {
+        super.clear();
+        this.lru.clear();
+    }
 }

package/dist/client/cache/memory.d.ts

@@ -8,7 +8,6 @@ export declare class ClientCacheMemory extends ClientCache {
     private readonly maxCells;
     private readonly maxTxs;
     private readonly maxBlocks;
-    private readonly confirmedBlockTime;
     /**
      * OutPoint => [isLive, Cell | OutPoint]
      */
@@ -25,14 +24,15 @@ export declare class ClientCacheMemory extends ClientCache {
      * Block Hash => Block Header / Full Block
      */
     private readonly knownBlocks;
+    private readonly confirmedBlockTime;
     /**
      * @param maxCells - Maximum number of cells to store in the cache. Defaults to 512.
      * @param maxTxs - Maximum number of transactions to store in the cache. Defaults to 256.
      * @param maxBlocks - Maximum number of blocks to store in the cache. Defaults to 128.
-     * @param confirmedBlockTime - Time in milliseconds after which a block is considered confirmed.
-     *                              Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
+     * @param confirmedBlockTimeLike - Time in milliseconds after which a block is considered confirmed.
+     *                                 Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
      */
-    constructor(maxCells?: number, maxTxs?: number, maxBlocks?: number, confirmedBlockTime?: bigint);
+    constructor(maxCells?: number, maxTxs?: number, maxBlocks?: number, confirmedBlockTimeLike?: NumLike);
     markUsableNoCache(...cellLikes: (CellLike | CellLike[])[]): Promise<void>;
     markUnusable(...outPointLikes: (OutPointLike | OutPointLike[])[]): Promise<void>;
     clear(): Promise<void>;

package/dist/client/cache/memory.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../../src/client/cache/memory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAY,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAC5E,OAAO,EAAW,OAAO,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAgB,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,EAAE,8BAA8B,EAAE,MAAM,4BAA4B,CAAC;AAC5E,OAAO,EACL,WAAW,EACX,iBAAiB,EACjB,qBAAqB,EACrB,eAAe,EACf,yBAAyB,EACzB,6BAA6B,EAC9B,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAQzC,qBAAa,iBAAkB,SAAQ,WAAW;IAgC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,kBAAkB;IAlCrC;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA6B;IAEnD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAA4C;IAE9E;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAsB;IAEvD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAG1B;IAEF;;;;;;OAMG;gBAEgB,QAAQ,SAAM,EACd,MAAM,SAAM,EACZ,SAAS,SAAM,EACf,kBAAkB,SAA+B;IAe9D,iBAAiB,CACrB,GAAG,SAAS,EAAE,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,GACtC,OAAO,CAAC,IAAI,CAAC;IASV,YAAY,CAChB,GAAG,aAAa,EAAE,CAAC,YAAY,GAAG,YAAY,EAAE,CAAC,EAAE,GAClD,OAAO,CAAC,IAAI,CAAC;IAcV,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAKrB,SAAS,CACd,OAAO,EAAE,8BAA8B,GACtC,cAAc,CAAC,IAAI,CAAC;IAcjB,UAAU,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC;IAMxD,WAAW,CAAC,GAAG,KAAK,EAAE,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAW/D,OAAO,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC;IAS9D,0BAA0B,CAC9B,GAAG,YAAY,EAAE,CACb,6BAA6B,GAC7B,6BAA6B,EAAE,CAClC,EAAE,GACF,OAAO,CAAC,IAAI,CAAC;IAMV,sBAAsB,CAC1B,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,yBAAyB,GAAG,SAAS,CAAC;IAK3C,aAAa,CACjB,GAAG,OAAO,EAAE,CAAC,qBAAqB,GAAG,qBAAqB,EAAE,CAAC,EAAE,GAC9D,OAAO,CAAC,IAAI,CAAC;IAaV,eAAe,CACnB,QAAQ,EAAE,OAAO,GAChB,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAQnC,iBAAiB,CACrB,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAUnC,YAAY,CAChB,GAAG,MAAM,EAAE,CAAC,eAAe,GAAG,eAAe,EAAE,CAAC,EAAE,GACjD,OAAO,CAAC,IAAI,CAAC;IAQV,cAAc,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC;IAWnE,gBAAgB,CACpB,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC;IAUnC,kBAAkB,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO;CAGvD"}
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../../src/client/cache/memory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAY,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAC5E,OAAO,EAAW,OAAO,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAgB,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,EAAE,8BAA8B,EAAE,MAAM,4BAA4B,CAAC;AAC5E,OAAO,EACL,WAAW,EACX,iBAAiB,EACjB,qBAAqB,EACrB,eAAe,EACf,yBAAyB,EACzB,6BAA6B,EAC9B,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAQzC,qBAAa,iBAAkB,SAAQ,WAAW;IAkC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAnC5B;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA6B;IAEnD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAA4C;IAE9E;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAsB;IAEvD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAG1B;IAEF,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAC;IAEpC;;;;;;OAMG;gBAEgB,QAAQ,SAAM,EACd,MAAM,SAAM,EACZ,SAAS,SAAM,EAChC,sBAAsB,GAAE,OAAsC;IAiB1D,iBAAiB,CACrB,GAAG,SAAS,EAAE,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,GACtC,OAAO,CAAC,IAAI,CAAC;IASV,YAAY,CAChB,GAAG,aAAa,EAAE,CAAC,YAAY,GAAG,YAAY,EAAE,CAAC,EAAE,GAClD,OAAO,CAAC,IAAI,CAAC;IAcV,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAKrB,SAAS,CACd,OAAO,EAAE,8BAA8B,GACtC,cAAc,CAAC,IAAI,CAAC;IAcjB,UAAU,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC;IAMxD,WAAW,CAAC,GAAG,KAAK,EAAE,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAW/D,OAAO,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC;IAS9D,0BAA0B,CAC9B,GAAG,YAAY,EAAE,CACb,6BAA6B,GAC7B,6BAA6B,EAAE,CAClC,EAAE,GACF,OAAO,CAAC,IAAI,CAAC;IAMV,sBAAsB,CAC1B,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,yBAAyB,GAAG,SAAS,CAAC;IAK3C,aAAa,CACjB,GAAG,OAAO,EAAE,CAAC,qBAAqB,GAAG,qBAAqB,EAAE,CAAC,EAAE,GAC9D,OAAO,CAAC,IAAI,CAAC;IAaV,eAAe,CACnB,QAAQ,EAAE,OAAO,GAChB,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAQnC,iBAAiB,CACrB,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAUnC,YAAY,CAChB,GAAG,MAAM,EAAE,CAAC,eAAe,GAAG,eAAe,EAAE,CAAC,EAAE,GACjD,OAAO,CAAC,IAAI,CAAC;IAQV,cAAc,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC;IAWnE,gBAAgB,CACpB,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC;IAUnC,kBAAkB,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO;CAGvD"}

package/dist/client/cache/memory.js

@@ -9,19 +9,19 @@ export class ClientCacheMemory extends ClientCache {
      * @param maxCells - Maximum number of cells to store in the cache. Defaults to 512.
      * @param maxTxs - Maximum number of transactions to store in the cache. Defaults to 256.
      * @param maxBlocks - Maximum number of blocks to store in the cache. Defaults to 128.
-     * @param confirmedBlockTime - Time in milliseconds after which a block is considered confirmed.
-     *                              Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
+     * @param confirmedBlockTimeLike - Time in milliseconds after which a block is considered confirmed.
+     *                                 Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
      */
-    constructor(maxCells = 512, maxTxs = 256, maxBlocks = 128, confirmedBlockTime = DEFAULT_CONFIRMED_BLOCK_TIME) {
+    constructor(maxCells = 512, maxTxs = 256, maxBlocks = 128, confirmedBlockTimeLike = DEFAULT_CONFIRMED_BLOCK_TIME) {
         super();
         this.maxCells = maxCells;
         this.maxTxs = maxTxs;
         this.maxBlocks = maxBlocks;
-        this.confirmedBlockTime = confirmedBlockTime;
         this.cells = new MapLru(this.maxCells);
         this.knownTransactions = new MapLru(this.maxTxs);
         this.knownBlockHashes = new MapLru(this.maxBlocks);
         this.knownBlocks = new MapLru(this.maxBlocks);
+        this.confirmedBlockTime = numFrom(confirmedBlockTimeLike);
     }
     async markUsableNoCache(...cellLikes) {
         cellLikes.flat().forEach((cellLike) => {

package/dist.commonjs/client/cache/memory.advanced.d.ts

@@ -13,43 +13,40 @@ export declare function filterNumByRange(lengthLike: NumLike, range: [NumLike, N
 export declare function filterScriptByLenRange(valueLike?: ScriptLike, scriptLenRange?: [NumLike, NumLike]): boolean;
 export declare function filterCell(searchKeyLike: ClientCollectableSearchKeyLike, cellLike: CellLike): boolean;
 /**
- * A Least Recently Used (LRU) cache implemented using a Map.
- *
- * This class extends the built-in Map to provide an LRU cache with a fixed capacity.
- * When the cache is full, the least recently used entry is automatically evicted.
- *
- * @template K The type of the keys in the cache.
- * @template V The type of the values in the cache.
+ * A Map-like class that implements a "Least Recently Used" (LRU) cache policy.
+ * When the cache reaches its capacity, the least recently used item is removed.
+ * @public
  */
 export declare class MapLru<K, V> extends Map<K, V> {
     private readonly capacity;
+    private readonly lru;
     /**
-     * Constructs a new MapLru instance.
-     *
-     * @param capacity The maximum number of entries the cache can hold. Must be a positive integer.
-     * @throws {Error} If the capacity is not a positive integer.
+     * @param capacity - The maximum number of items to store in the cache. Must be a positive integer.
      */
     constructor(capacity: number);
     /**
-     * Retrieves a value from the cache.
-     *
-     * If the key is present in the cache, the value is moved to the most-recently-used position.
-     *
-     * @param key The key of the value to retrieve.
-     * @returns The value associated with the key, or undefined if the key is not present.
+     * Retrieves the value for a given key and marks it as recently used.
+     * @param key - The key of the element to retrieve.
+     * @returns The value associated with the key, or `undefined` if the key is not in the cache.
      */
     get(key: K): V | undefined;
     /**
-     * Inserts a new value into the cache, or updates an existing value.
-     *
-     * If the key is already present in the cache, it is first deleted so that the re-insertion
-     * moves it to the most-recently-used position.
-     * If the cache is over capacity after the insertion, the least recently used entry is evicted.
-     *
-     * @param key The key of the value to insert or update.
-     * @param value The value to associate with the key.
-     * @returns This MapLru instance.
+     * Adds or updates a key-value pair in the cache and marks the key as recently used.
+     * If setting a new key causes the cache to exceed its capacity, the least recently used item is evicted.
+     * @param key - The key of the element to add or update.
+     * @param value - The value of the element to add or update.
+     * @returns The `MapLru` instance.
      */
     set(key: K, value: V): this;
+    /**
+     * Removes the specified element from the cache.
+     * @param key - The key of the element to remove.
+     * @returns `true` if an element in the `MapLru` object existed and has been removed, or `false` if the element does not exist.
+     */
+    delete(key: K): boolean;
+    /**
+     * Removes all key-value pairs from the cache.
+     */
+    clear(): void;
 }
 //# sourceMappingURL=memory.advanced.d.ts.map

package/dist.commonjs/client/cache/memory.advanced.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"memory.advanced.d.ts","sourceRoot":"","sources":["../../../src/client/cache/memory.advanced.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAU,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAE,OAAO,EAAW,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,OAAO,EAAW,MAAM,oBAAoB,CAAC;AACtD,OAAO,EACL,8BAA8B,EAE/B,MAAM,4BAA4B,CAAC;AAGpC,eAAO,MAAM,4BAA4B,QAA0B,CAAC;AAGpE,MAAM,MAAM,UAAU,GAClB;IACE,KAAK;IACL,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,GAAG,YAAY,CAAC,CAAC;CAC1E,GACD,CAAC,IAAI,EAAE,IAAI,CAAC,GACZ,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AAEtB,wBAAgB,UAAU,CACxB,QAAQ,EAAE,OAAO,EACjB,UAAU,EAAE,OAAO,GAAG,SAAS,EAC/B,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS,GACzC,OAAO,CAgBT;AAED,wBAAgB,YAAY,CAC1B,SAAS,EAAE,UAAU,GAAG,SAAS,EACjC,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,UAAU,EAAE,QAAQ,GAAG,OAAO,GAAG,SAAS,GACzC,OAAO,CAkBT;AAED,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,OAAO,EACnB,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,SAAS,GACpC,OAAO,CAQT;AAED,wBAAgB,sBAAsB,CACpC,SAAS,CAAC,EAAE,UAAU,EACtB,cAAc,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAClC,OAAO,CAYT;AAED,wBAAgB,UAAU,CACxB,aAAa,EAAE,8BAA8B,EAC7C,QAAQ,EAAE,QAAQ,GACjB,OAAO,CA4CT;AAED;;;;;;;;GAQG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAO7B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IANrC;;;;;OAKG;gBAC0B,QAAQ,EAAE,MAAM;IAO7C;;;;;;;OAOG;IACM,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAenC;;;;;;;;;;OAUG;IACM,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;CAarC"}
+{"version":3,"file":"memory.advanced.d.ts","sourceRoot":"","sources":["../../../src/client/cache/memory.advanced.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAU,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAE,OAAO,EAAW,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,OAAO,EAAW,MAAM,oBAAoB,CAAC;AACtD,OAAO,EACL,8BAA8B,EAE/B,MAAM,4BAA4B,CAAC;AAGpC,eAAO,MAAM,4BAA4B,QAA0B,CAAC;AAGpE,MAAM,MAAM,UAAU,GAClB;IACE,KAAK;IACL,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,GAAG,YAAY,CAAC,CAAC;CAC1E,GACD,CAAC,IAAI,EAAE,IAAI,CAAC,GACZ,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AAEtB,wBAAgB,UAAU,CACxB,QAAQ,EAAE,OAAO,EACjB,UAAU,EAAE,OAAO,GAAG,SAAS,EAC/B,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS,GACzC,OAAO,CAgBT;AAED,wBAAgB,YAAY,CAC1B,SAAS,EAAE,UAAU,GAAG,SAAS,EACjC,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,UAAU,EAAE,QAAQ,GAAG,OAAO,GAAG,SAAS,GACzC,OAAO,CAkBT;AAED,wBAAgB,gBAAgB,CAC9B,UAAU,EAAE,OAAO,EACnB,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,SAAS,GACpC,OAAO,CAQT;AAED,wBAAgB,sBAAsB,CACpC,SAAS,CAAC,EAAE,UAAU,EACtB,cAAc,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAClC,OAAO,CAYT;AAED,wBAAgB,UAAU,CACxB,aAAa,EAAE,8BAA8B,EAC7C,QAAQ,EAAE,QAAQ,GACjB,OAAO,CA4CT;AAED;;;;GAIG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAM7B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IALrC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAwB;IAE5C;;OAEG;gBAC0B,QAAQ,EAAE,MAAM;IAQ7C;;;;OAIG;IACM,GAAG,CAAC,GAAG,EAAE,CAAC;IAWnB;;;;;;OAMG;IACM,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IAc7B;;;;OAIG;IACM,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAShC;;OAEG;IACM,KAAK;CAIf"}

package/dist.commonjs/client/cache/memory.advanced.js

@@ -88,68 +88,71 @@ function filterCell(searchKeyLike, cellLike) {
     return true;
 }
 /**
- * A Least Recently Used (LRU) cache implemented using a Map.
- *
- * This class extends the built-in Map to provide an LRU cache with a fixed capacity.
- * When the cache is full, the least recently used entry is automatically evicted.
- *
- * @template K The type of the keys in the cache.
- * @template V The type of the values in the cache.
+ * A Map-like class that implements a "Least Recently Used" (LRU) cache policy.
+ * When the cache reaches its capacity, the least recently used item is removed.
+ * @public
  */
 class MapLru extends Map {
     /**
-     * Constructs a new MapLru instance.
-     *
-     * @param capacity The maximum number of entries the cache can hold. Must be a positive integer.
-     * @throws {Error} If the capacity is not a positive integer.
+     * @param capacity - The maximum number of items to store in the cache. Must be a positive integer.
      */
     constructor(capacity) {
         super();
         this.capacity = capacity;
+        this.lru = new Set();
         if (!Number.isInteger(capacity) || capacity < 1) {
             throw new Error("Capacity must be a positive integer");
         }
     }
     /**
-     * Retrieves a value from the cache.
-     *
-     * If the key is present in the cache, the value is moved to the most-recently-used position.
-     *
-     * @param key The key of the value to retrieve.
-     * @returns The value associated with the key, or undefined if the key is not present.
+     * Retrieves the value for a given key and marks it as recently used.
+     * @param key - The key of the element to retrieve.
+     * @returns The value associated with the key, or `undefined` if the key is not in the cache.
      */
     get(key) {
-        // Check if the key exists. If not, return undefined.
         if (!super.has(key)) {
-            return undefined;
+            return;
         }
-        const value = super.get(key);
-        // Move to most-recently-used position
-        super.delete(key);
-        super.set(key, value);
-        return value;
+        this.lru.delete(key);
+        this.lru.add(key);
+        return super.get(key);
     }
     /**
-     * Inserts a new value into the cache, or updates an existing value.
-     *
-     * If the key is already present in the cache, it is first deleted so that the re-insertion
-     * moves it to the most-recently-used position.
-     * If the cache is over capacity after the insertion, the least recently used entry is evicted.
-     *
-     * @param key The key of the value to insert or update.
-     * @param value The value to associate with the key.
-     * @returns This MapLru instance.
+     * Adds or updates a key-value pair in the cache and marks the key as recently used.
+     * If setting a new key causes the cache to exceed its capacity, the least recently used item is evicted.
+     * @param key - The key of the element to add or update.
+     * @param value - The value of the element to add or update.
+     * @returns The `MapLru` instance.
      */
     set(key, value) {
-        // Delete and re-insert to move key to the end (most-recently-used)
-        super.delete(key);
         super.set(key, value);
-        // Evict oldest if over capacity
-        if (super.size > this.capacity) {
-            const oldestKey = super.keys().next().value;
-            super.delete(oldestKey);
+        this.lru.delete(key);
+        this.lru.add(key);
+        // Evict the oldest entry if capacity is exceeded.
+        if (this.lru.size > this.capacity) {
+            const oldestKey = this.lru.keys().next().value;
+            this.delete(oldestKey);
         }
         return this;
     }
+    /**
+     * Removes the specified element from the cache.
+     * @param key - The key of the element to remove.
+     * @returns `true` if an element in the `MapLru` object existed and has been removed, or `false` if the element does not exist.
+     */
+    delete(key) {
+        if (!super.delete(key)) {
+            return false;
+        }
+        this.lru.delete(key);
+        return true;
+    }
+    /**
+     * Removes all key-value pairs from the cache.
+     */
+    clear() {
+        super.clear();
+        this.lru.clear();
+    }
 }
 exports.MapLru = MapLru;

package/dist.commonjs/client/cache/memory.d.ts

@@ -8,7 +8,6 @@ export declare class ClientCacheMemory extends ClientCache {
     private readonly maxCells;
     private readonly maxTxs;
     private readonly maxBlocks;
-    private readonly confirmedBlockTime;
     /**
      * OutPoint => [isLive, Cell | OutPoint]
      */
@@ -25,14 +24,15 @@ export declare class ClientCacheMemory extends ClientCache {
      * Block Hash => Block Header / Full Block
      */
     private readonly knownBlocks;
+    private readonly confirmedBlockTime;
     /**
      * @param maxCells - Maximum number of cells to store in the cache. Defaults to 512.
      * @param maxTxs - Maximum number of transactions to store in the cache. Defaults to 256.
      * @param maxBlocks - Maximum number of blocks to store in the cache. Defaults to 128.
-     * @param confirmedBlockTime - Time in milliseconds after which a block is considered confirmed.
-     *                              Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
+     * @param confirmedBlockTimeLike - Time in milliseconds after which a block is considered confirmed.
+     *                                 Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
      */
-    constructor(maxCells?: number, maxTxs?: number, maxBlocks?: number, confirmedBlockTime?: bigint);
+    constructor(maxCells?: number, maxTxs?: number, maxBlocks?: number, confirmedBlockTimeLike?: NumLike);
     markUsableNoCache(...cellLikes: (CellLike | CellLike[])[]): Promise<void>;
     markUnusable(...outPointLikes: (OutPointLike | OutPointLike[])[]): Promise<void>;
     clear(): Promise<void>;

package/dist.commonjs/client/cache/memory.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../../src/client/cache/memory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAY,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAC5E,OAAO,EAAW,OAAO,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAgB,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,EAAE,8BAA8B,EAAE,MAAM,4BAA4B,CAAC;AAC5E,OAAO,EACL,WAAW,EACX,iBAAiB,EACjB,qBAAqB,EACrB,eAAe,EACf,yBAAyB,EACzB,6BAA6B,EAC9B,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAQzC,qBAAa,iBAAkB,SAAQ,WAAW;IAgC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,kBAAkB;IAlCrC;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA6B;IAEnD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAA4C;IAE9E;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAsB;IAEvD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAG1B;IAEF;;;;;;OAMG;gBAEgB,QAAQ,SAAM,EACd,MAAM,SAAM,EACZ,SAAS,SAAM,EACf,kBAAkB,SAA+B;IAe9D,iBAAiB,CACrB,GAAG,SAAS,EAAE,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,GACtC,OAAO,CAAC,IAAI,CAAC;IASV,YAAY,CAChB,GAAG,aAAa,EAAE,CAAC,YAAY,GAAG,YAAY,EAAE,CAAC,EAAE,GAClD,OAAO,CAAC,IAAI,CAAC;IAcV,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAKrB,SAAS,CACd,OAAO,EAAE,8BAA8B,GACtC,cAAc,CAAC,IAAI,CAAC;IAcjB,UAAU,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC;IAMxD,WAAW,CAAC,GAAG,KAAK,EAAE,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAW/D,OAAO,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC;IAS9D,0BAA0B,CAC9B,GAAG,YAAY,EAAE,CACb,6BAA6B,GAC7B,6BAA6B,EAAE,CAClC,EAAE,GACF,OAAO,CAAC,IAAI,CAAC;IAMV,sBAAsB,CAC1B,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,yBAAyB,GAAG,SAAS,CAAC;IAK3C,aAAa,CACjB,GAAG,OAAO,EAAE,CAAC,qBAAqB,GAAG,qBAAqB,EAAE,CAAC,EAAE,GAC9D,OAAO,CAAC,IAAI,CAAC;IAaV,eAAe,CACnB,QAAQ,EAAE,OAAO,GAChB,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAQnC,iBAAiB,CACrB,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAUnC,YAAY,CAChB,GAAG,MAAM,EAAE,CAAC,eAAe,GAAG,eAAe,EAAE,CAAC,EAAE,GACjD,OAAO,CAAC,IAAI,CAAC;IAQV,cAAc,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC;IAWnE,gBAAgB,CACpB,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC;IAUnC,kBAAkB,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO;CAGvD"}
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../../src/client/cache/memory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAY,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAC5E,OAAO,EAAW,OAAO,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAgB,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,EAAE,8BAA8B,EAAE,MAAM,4BAA4B,CAAC;AAC5E,OAAO,EACL,WAAW,EACX,iBAAiB,EACjB,qBAAqB,EACrB,eAAe,EACf,yBAAyB,EACzB,6BAA6B,EAC9B,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAQzC,qBAAa,iBAAkB,SAAQ,WAAW;IAkC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAnC5B;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA6B;IAEnD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAA4C;IAE9E;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAsB;IAEvD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAG1B;IAEF,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAC;IAEpC;;;;;;OAMG;gBAEgB,QAAQ,SAAM,EACd,MAAM,SAAM,EACZ,SAAS,SAAM,EAChC,sBAAsB,GAAE,OAAsC;IAiB1D,iBAAiB,CACrB,GAAG,SAAS,EAAE,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,GACtC,OAAO,CAAC,IAAI,CAAC;IASV,YAAY,CAChB,GAAG,aAAa,EAAE,CAAC,YAAY,GAAG,YAAY,EAAE,CAAC,EAAE,GAClD,OAAO,CAAC,IAAI,CAAC;IAcV,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAKrB,SAAS,CACd,OAAO,EAAE,8BAA8B,GACtC,cAAc,CAAC,IAAI,CAAC;IAcjB,UAAU,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC;IAMxD,WAAW,CAAC,GAAG,KAAK,EAAE,CAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAW/D,OAAO,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC;IAS9D,0BAA0B,CAC9B,GAAG,YAAY,EAAE,CACb,6BAA6B,GAC7B,6BAA6B,EAAE,CAClC,EAAE,GACF,OAAO,CAAC,IAAI,CAAC;IAMV,sBAAsB,CAC1B,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,yBAAyB,GAAG,SAAS,CAAC;IAK3C,aAAa,CACjB,GAAG,OAAO,EAAE,CAAC,qBAAqB,GAAG,qBAAqB,EAAE,CAAC,EAAE,GAC9D,OAAO,CAAC,IAAI,CAAC;IAaV,eAAe,CACnB,QAAQ,EAAE,OAAO,GAChB,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAQnC,iBAAiB,CACrB,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,iBAAiB,GAAG,SAAS,CAAC;IAUnC,YAAY,CAChB,GAAG,MAAM,EAAE,CAAC,eAAe,GAAG,eAAe,EAAE,CAAC,EAAE,GACjD,OAAO,CAAC,IAAI,CAAC;IAQV,cAAc,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC;IAWnE,gBAAgB,CACpB,UAAU,EAAE,OAAO,GAClB,OAAO,CAAC,WAAW,GAAG,SAAS,CAAC;IAUnC,kBAAkB,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO;CAGvD"}

package/dist.commonjs/client/cache/memory.js

@@ -12,19 +12,19 @@ class ClientCacheMemory extends cache_js_1.ClientCache {
      * @param maxCells - Maximum number of cells to store in the cache. Defaults to 512.
      * @param maxTxs - Maximum number of transactions to store in the cache. Defaults to 256.
      * @param maxBlocks - Maximum number of blocks to store in the cache. Defaults to 128.
-     * @param confirmedBlockTime - Time in milliseconds after which a block is considered confirmed.
-     *                              Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
+     * @param confirmedBlockTimeLike - Time in milliseconds after which a block is considered confirmed.
+     *                                 Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
      */
-    constructor(maxCells = 512, maxTxs = 256, maxBlocks = 128, confirmedBlockTime = memory_advanced_js_1.DEFAULT_CONFIRMED_BLOCK_TIME) {
+    constructor(maxCells = 512, maxTxs = 256, maxBlocks = 128, confirmedBlockTimeLike = memory_advanced_js_1.DEFAULT_CONFIRMED_BLOCK_TIME) {
         super();
         this.maxCells = maxCells;
         this.maxTxs = maxTxs;
         this.maxBlocks = maxBlocks;
-        this.confirmedBlockTime = confirmedBlockTime;
         this.cells = new memory_advanced_js_1.MapLru(this.maxCells);
         this.knownTransactions = new memory_advanced_js_1.MapLru(this.maxTxs);
         this.knownBlockHashes = new memory_advanced_js_1.MapLru(this.maxBlocks);
         this.knownBlocks = new memory_advanced_js_1.MapLru(this.maxBlocks);
+        this.confirmedBlockTime = (0, index_js_3.numFrom)(confirmedBlockTimeLike);
     }
     async markUsableNoCache(...cellLikes) {
         cellLikes.flat().forEach((cellLike) => {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ckb-ccc/core",
-  "version": "1.11.3",
+  "version": "1.11.4",
   "description": "Core of CCC - CKBer's Codebase",
   "author": "Hanssen0 <hanssen0@hanssen0.com>",
   "license": "MIT",

package/src/client/cache/memory.advanced.ts

@@ -145,73 +145,80 @@ export function filterCell(
 }
 
 /**
- * A Least Recently Used (LRU) cache implemented using a Map.
- *
- * This class extends the built-in Map to provide an LRU cache with a fixed capacity.
- * When the cache is full, the least recently used entry is automatically evicted.
- *
- * @template K The type of the keys in the cache.
- * @template V The type of the values in the cache.
+ * A Map-like class that implements a "Least Recently Used" (LRU) cache policy.
+ * When the cache reaches its capacity, the least recently used item is removed.
+ * @public
  */
 export class MapLru<K, V> extends Map<K, V> {
+  private readonly lru: Set<K> = new Set<K>();
+
   /**
-   * Constructs a new MapLru instance.
-   *
-   * @param capacity The maximum number of entries the cache can hold. Must be a positive integer.
-   * @throws {Error} If the capacity is not a positive integer.
+   * @param capacity - The maximum number of items to store in the cache. Must be a positive integer.
    */
   constructor(private readonly capacity: number) {
     super();
+
     if (!Number.isInteger(capacity) || capacity < 1) {
       throw new Error("Capacity must be a positive integer");
     }
   }
 
   /**
-   * Retrieves a value from the cache.
-   *
-   * If the key is present in the cache, the value is moved to the most-recently-used position.
-   *
-   * @param key The key of the value to retrieve.
-   * @returns The value associated with the key, or undefined if the key is not present.
+   * Retrieves the value for a given key and marks it as recently used.
+   * @param key - The key of the element to retrieve.
+   * @returns The value associated with the key, or `undefined` if the key is not in the cache.
    */
-  override get(key: K): V | undefined {
-    // Check if the key exists. If not, return undefined.
+  override get(key: K) {
     if (!super.has(key)) {
-      return undefined;
+      return;
     }
 
-    const value = super.get(key) as V;
+    this.lru.delete(key);
+    this.lru.add(key);
 
-    // Move to most-recently-used position
-    super.delete(key);
-    super.set(key, value);
-
-    return value;
+    return super.get(key);
   }
 
   /**
-   * Inserts a new value into the cache, or updates an existing value.
-   *
-   * If the key is already present in the cache, it is first deleted so that the re-insertion
-   * moves it to the most-recently-used position.
-   * If the cache is over capacity after the insertion, the least recently used entry is evicted.
-   *
-   * @param key The key of the value to insert or update.
-   * @param value The value to associate with the key.
-   * @returns This MapLru instance.
+   * Adds or updates a key-value pair in the cache and marks the key as recently used.
+   * If setting a new key causes the cache to exceed its capacity, the least recently used item is evicted.
+   * @param key - The key of the element to add or update.
+   * @param value - The value of the element to add or update.
+   * @returns The `MapLru` instance.
    */
-  override set(key: K, value: V): this {
-    // Delete and re-insert to move key to the end (most-recently-used)
-    super.delete(key);
+  override set(key: K, value: V) {
     super.set(key, value);
 
-    // Evict oldest if over capacity
-    if (super.size > this.capacity) {
-      const oldestKey = super.keys().next().value!;
-      super.delete(oldestKey);
-    }
+    this.lru.delete(key);
+    this.lru.add(key);
 
+    // Evict the oldest entry if capacity is exceeded.
+    if (this.lru.size > this.capacity) {
+      const oldestKey = this.lru.keys().next().value!;
+      this.delete(oldestKey);
+    }
     return this;
   }
+
+  /**
+   * Removes the specified element from the cache.
+   * @param key - The key of the element to remove.
+   * @returns `true` if an element in the `MapLru` object existed and has been removed, or `false` if the element does not exist.
+   */
+  override delete(key: K): boolean {
+    if (!super.delete(key)) {
+      return false;
+    }
+
+    this.lru.delete(key);
+    return true;
+  }
+
+  /**
+   * Removes all key-value pairs from the cache.
+   */
+  override clear() {
+    super.clear();
+    this.lru.clear();
+  }
 }

package/src/client/cache/memory.ts

@@ -42,18 +42,20 @@ export class ClientCacheMemory extends ClientCache {
     Pick<ClientBlock, "header"> | ClientBlock
   >;
 
+  private readonly confirmedBlockTime;
+
   /**
    * @param maxCells - Maximum number of cells to store in the cache. Defaults to 512.
    * @param maxTxs - Maximum number of transactions to store in the cache. Defaults to 256.
    * @param maxBlocks - Maximum number of blocks to store in the cache. Defaults to 128.
-   * @param confirmedBlockTime - Time in milliseconds after which a block is considered confirmed.
-   *                              Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
+   * @param confirmedBlockTimeLike - Time in milliseconds after which a block is considered confirmed.
+   *                                 Defaults to DEFAULT_CONFIRMED_BLOCK_TIME (50 blocks * 10s).
    */
   constructor(
     private readonly maxCells = 512,
     private readonly maxTxs = 256,
     private readonly maxBlocks = 128,
-    private readonly confirmedBlockTime = DEFAULT_CONFIRMED_BLOCK_TIME,
+    confirmedBlockTimeLike: NumLike = DEFAULT_CONFIRMED_BLOCK_TIME,
   ) {
     super();
 
@@ -66,6 +68,8 @@ export class ClientCacheMemory extends ClientCache {
       string,
       Pick<ClientBlock, "header"> | ClientBlock
     >(this.maxBlocks);
+
+    this.confirmedBlockTime = numFrom(confirmedBlockTimeLike);
   }
 
   async markUsableNoCache(