dirsql 0.4.111 → 0.4.112

package/docs/reference/hooks.md

@@ -163,7 +163,7 @@ table's paths outgrow that cap, dirsql splits them into the fewest
 consecutive runs that fit, runs the command once per run, and concatenates
 the rows it prints. Runs execute concurrently, one per CPU at most, like
 `xargs -P`, so rows keep their order within a run but not across runs; SQL
-never promised row order, so `ORDER BY` what you need. The command cannot tell: each run is an
+never promised row order, so `ORDER BY` what you need. A table whose paths fit one run is also split, by file size, into up to one run per CPU once it holds at least 4 MiB of file data per run, so a few large files do not serialize behind one process. The command cannot tell: each run is an
 ordinary invocation with a subset of the paths. A command must therefore not
 assume one invocation sees every path — a count, a cross-file join, or a
 dedupe over `sys.argv[1:]` is per run, not per table. Do that work in SQL.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "dirsql",
-  "version": "0.4.111",
+  "version": "0.4.112",
   "description": "Ephemeral SQL index over a local directory",
   "license": "MIT",
   "repository": "https://github.com/thekevinscott/dirsql",
@@ -221,10 +221,10 @@
     ]
   },
   "optionalDependencies": {
-    "@dirsql/lib-linux-x64-gnu": "0.4.111",
-    "@dirsql/lib-linux-arm64-gnu": "0.4.111",
-    "@dirsql/lib-darwin-x64": "0.4.111",
-    "@dirsql/lib-darwin-arm64": "0.4.111",
-    "@dirsql/lib-win32-x64-msvc": "0.4.111"
+    "@dirsql/lib-linux-x64-gnu": "0.4.112",
+    "@dirsql/lib-linux-arm64-gnu": "0.4.112",
+    "@dirsql/lib-darwin-x64": "0.4.112",
+    "@dirsql/lib-darwin-arm64": "0.4.112",
+    "@dirsql/lib-win32-x64-msvc": "0.4.112"
   }
 }