@weborigami/async-tree 0.4.1 → 0.4.2

package/package.json

@@ -1,13 +1,13 @@
 {
   "name": "@weborigami/async-tree",
-  "version": "0.4.1",
+  "version": "0.4.2",
   "description": "Asynchronous tree drivers based on standard JavaScript classes",
   "type": "module",
   "main": "./main.js",
   "browser": "./browser.js",
   "types": "./index.ts",
   "dependencies": {
-    "@weborigami/types": "0.4.1"
+    "@weborigami/types": "0.4.2"
   },
   "devDependencies": {
     "@types/node": "22.13.13",

package/src/drivers/FileTree.js

@@ -16,7 +16,7 @@ import limitConcurrency from "./limitConcurrency.js";
 // As of July 2025, Node doesn't provide any way to limit the number of
 // concurrent calls to readFile, so we wrap readFile in a function that
 // arbitrarily limits the number of concurrent calls to it.
-const MAX_CONCURRENT_READS = 256;
+const MAX_CONCURRENT_READS = 4096;
 const limitReadFile = limitConcurrency(fs.readFile, MAX_CONCURRENT_READS);
 
 /**
@@ -89,6 +89,7 @@ export default class FileTree {
     } else {
       // Return file contents as a standard Uint8Array
       const buffer = await limitReadFile(filePath);
+      // const buffer = await fs.readFile(filePath);
       value = Uint8Array.from(buffer);
     }
 

package/src/operations/paginate.js

@@ -1,4 +1,5 @@
 import { Tree } from "../internal.js";
+import * as trailingSlash from "../trailingSlash.js";
 import { assertIsTreelike } from "../utilities.js";
 
 /**
@@ -20,21 +21,22 @@ export default async function paginate(treelike, size = 10) {
 
   const paginated = {
     async get(pageKey) {
+      const normalized = trailingSlash.remove(pageKey);
       // Note: page numbers are 1-based.
-      const pageNumber = Number(pageKey);
+      const pageNumber = Number(normalized);
       if (Number.isNaN(pageNumber)) {
         return undefined;
       }
       const nextPage = pageNumber + 1 <= pageCount ? pageNumber + 1 : null;
       const previousPage = pageNumber - 1 >= 1 ? pageNumber - 1 : null;
-      const items = {};
+      const items = new Map();
       for (
         let index = (pageNumber - 1) * size;
         index < Math.min(keys.length, pageNumber * size);
         index++
       ) {
         const key = keys[index];
-        items[key] = await tree.get(keys[index]);
+        items.set(key, await tree.get(keys[index]));
       }
 
       return {