@rljson/fs-agent 0.0.38 → 0.0.39

package/dist/fs-agent.d.ts

@@ -166,6 +166,16 @@ export declare const REFUSAL_ANSWER_COOLDOWN_MS = 5000;
  * which trades a latency problem for a queueing one.
  */
 export declare const TREE_FETCH_CONCURRENCY = 64;
+/**
+ * How many restored paths an agent remembers writing.
+ *
+ * The memory exists so a repeat restore recognises this agent's own work
+ * without re-reading the file. Nothing ever removed an entry, so a long-lived
+ * agent over a large catalogue held one per file it had ever written. Dropping
+ * the oldest costs a stat on a file that has not been touched in a long time,
+ * which is the cheap half of the trade.
+ */
+export declare const RESTORED_BLOB_MEMORY_MAX = 50000;
 export declare const MASS_DELETE_MIN_FILES = 100;
 /**
  * Above this share of the folder, a prune is treated as suspicious rather than
@@ -501,7 +511,7 @@ export declare class FsAgent {
      * @param route - Route to tree table
      * @param treeKey - Tree table key
      * @param rootHash - Hash of the root node to start fetching from
-     * @returns Array of all tree nodes in the tree
+     * @returns Every node in the tree, keyed by its content hash
      */
     private _fetchTreeRecursively;
     /**

package/dist/fs-agent.js

@@ -1029,6 +1029,7 @@ const ATOMIC_TMP_PREFIX = ".fsagent-tmp-";
 const AGENT_STATE_FILE = ".fsagent-state.json";
 const REFUSAL_ANSWER_COOLDOWN_MS = 5e3;
 const TREE_FETCH_CONCURRENCY = 64;
+const RESTORED_BLOB_MEMORY_MAX = 5e4;
 const MASS_DELETE_MIN_FILES = 100;
 const MASS_DELETE_MAX_RATIO = 0.3;
 class RestoreIncompleteError extends Error {
@@ -1534,6 +1535,10 @@ ${err.stack}` : String(err);
             await utimes(filePath, mtime, mtime);
           }
           if (meta.size !== void 0 && meta.mtime !== void 0) {
+            if (this._restoredBlobs.size >= RESTORED_BLOB_MEMORY_MAX) {
+              const oldest = this._restoredBlobs.keys().next().value;
+              this._restoredBlobs.delete(oldest);
+            }
             this._restoredBlobs.set(filePath, {
               blobId: meta.blobId,
               size: meta.size,
@@ -1687,7 +1692,7 @@ ${err.stack}` : String(err);
    * @param route - Route to tree table
    * @param treeKey - Tree table key
    * @param rootHash - Hash of the root node to start fetching from
-   * @returns Array of all tree nodes in the tree
+   * @returns Every node in the tree, keyed by its content hash
    */
   async _fetchTreeRecursively(db, route, treeKey, rootHash) {
     const fetchedNodes = /* @__PURE__ */ new Map();
@@ -1760,7 +1765,7 @@ ${err.stack}` : String(err);
       }
       frontier = next;
     }
-    return Array.from(fetchedNodes.values());
+    return fetchedNodes;
   }
   /**
    * Fetches tree from database without restoring to filesystem.
@@ -1780,17 +1785,12 @@ ${err.stack}` : String(err);
       this._timeouts.fetchTree,
       `fetchTree(${treeKey}@${rootRef.slice(0, 8)}…)`
     );
-    if (allNodes.length === 0) {
+    if (allNodes.size === 0) {
       throw new Error(
         `No tree nodes found for ${treeKey}@${rootRef}. The tree may have been deleted or the reference is invalid.`
       );
     }
-    const trees = /* @__PURE__ */ new Map();
-    for (const treeNode of allNodes) {
-      if (treeNode._hash) {
-        trees.set(treeNode._hash, treeNode);
-      }
-    }
+    const trees = allNodes;
     if (!trees.has(rootRef)) {
       throw new Error(
         `Root tree node "${rootRef}" not found in tree data. Available hashes: ${Array.from(trees.keys()).slice(0, 5).join(", ")}${trees.size > 5 ? "..." : ""}`

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rljson/fs-agent",
-  "version": "0.0.38",
+  "version": "0.0.39",
   "description": "Rljson fs-agent description",
   "homepage": "https://github.com/rljson/fs-agent",
   "bugs": "https://github.com/rljson/fs-agent/issues",