@crewhaus/tool-table 0.7.0 → 0.8.1

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,9 @@
+CrewHaus Factory
+Copyright 2026 Max Meier
+
+This product includes software developed by Max Meier
+(operating as StudioMax — https://studiomax.io) and contributors.
+
+The CrewHaus name and logo are trademarks of Max Meier. See
+https://github.com/crewhaus/factory/blob/main/TRADEMARK.md for the
+use-of-marks policy.

package/dist/index.js

@@ -15,15 +15,22 @@
  * repository would disagree about quoting and embedded newlines on the same
  * file, in different tools, which is the worst way to disagree.
  */
-import { readFileSync, statSync } from "node:fs";
 import { buildTool } from "@crewhaus/tool-builder";
 import { parseCsv } from "@crewhaus/tool-data";
+import { openForReadSync } from "@crewhaus/tool-safety/fs";
 import { z } from "zod";
 import { DriftError, compareDrift } from "./lib/drift";
 import { profileTable } from "./lib/profile";
 import { FIELD_NORMALIZERS, diffTables, linkRecords, normalizeContact, } from "./lib/reconcile";
 import { parseFixedWidth, shardRows, toLong, toWide } from "./lib/reshape";
-import { resolveSafe } from "./paths";
+import { resolveSafe, workspaceRoot } from "./paths";
+/**
+ * A file's text as 0.7.0's `readFileSync(path, "utf8")` gave it: a leading
+ * byte-order mark kept. tool-safety's `text` drops one, which moved
+ * FixedWidthParse's columns by one on a file that starts with one (bounds
+ * review). A CSV's header is unaffected: parseCsv drops the mark itself.
+ */
+const KEEP_BOM = new TextDecoder("utf-8", { ignoreBOM: true });
 const json = (value) => JSON.stringify(value);
 const LIMITS = {
     fileBytes: 512 * 1024 * 1024,
@@ -35,14 +42,36 @@ const LIMITS = {
     /** A stored profile is a summary; anything this big is the data by mistake. */
     profileBytes: 64 * 1024 * 1024,
 };
+/**
+ * A workspace file's text, at most `maxBytes` of it.
+ *
+ * Opened without blocking, and only as a regular file: a FIFO with no writer
+ * blocks an ordinary open for ever, and these reads were synchronous, so a
+ * named pipe in the workspace stopped the whole harness (C074). The limit is
+ * enforced while reading; `overLimit` says the file holds more.
+ */
+function readWorkspaceText(tool, file, maxBytes) {
+    const read = openForReadSync(workspaceRoot(), file, { maxBytes });
+    if (!read.ok)
+        throw new Error(`${tool}: ${read.reason}`);
+    return {
+        // Decoded only when asked for: a caller refuses a file over the limit unread.
+        get text() {
+            return KEEP_BOM.decode(read.bytes);
+        },
+        size: read.size,
+        overLimit: read.truncated,
+    };
+}
 /** Read a delimited file into a header and rows of strings. */
 function readTable(tool, file, options) {
     const at = resolveSafe(tool, file);
-    const bytes = statSync(at.real).size;
-    if (bytes > LIMITS.fileBytes) {
+    const read = readWorkspaceText(tool, file, LIMITS.fileBytes);
+    const bytes = read.size;
+    if (read.overLimit) {
         throw new Error(`${at.rel} is ${bytes} bytes, over the ${LIMITS.fileBytes}-byte limit`);
     }
-    const text = readFileSync(at.real, "utf-8");
+    const text = read.text;
     // `parseCsv` returns every row including the header; splitting it here
     // keeps one reader for the whole repository rather than two that disagree
     // about quoting on the same file.
@@ -164,13 +193,19 @@ export const tableProfile = buildTool({
  */
 function loadReferenceProfile(file) {
     const at = resolveSafe("DataDriftCheck", file);
-    const bytes = statSync(at.real).size;
-    if (bytes > LIMITS.profileBytes) {
-        return `${at.rel} is ${bytes} bytes, far larger than any profile — this is probably not a stored TableProfile`;
+    let read;
+    try {
+        read = readWorkspaceText("DataDriftCheck", file, LIMITS.profileBytes);
+    }
+    catch (err) {
+        return err.message;
+    }
+    if (read.overLimit) {
+        return `${at.rel} is ${read.size} bytes, far larger than any profile — this is probably not a stored TableProfile`;
     }
     let parsed;
     try {
-        parsed = JSON.parse(readFileSync(at.real, "utf-8"));
+        parsed = JSON.parse(read.text);
     }
     catch (err) {
         return `${at.rel} is not JSON: ${err.message}. referenceProfile takes a stored TableProfile result; for raw data use referenceFile`;
@@ -244,6 +279,13 @@ function columnProblem(value) {
         if (typeof counts !== "object" || counts === null || Array.isArray(counts)) {
             return `${label} has a categorical capture with no valueCounts map`;
         }
+        // A count the chi-square adds up. A hand-edited "50" would concatenate
+        // instead of adding, and the category would drop out of the test.
+        for (const [value, count] of Object.entries(counts)) {
+            if (typeof count !== "number" || !Number.isFinite(count) || count < 0) {
+                return `${label} has a non-numeric count for the value ${JSON.stringify(value)} in its valueCounts; it has been edited by hand and cannot be used as a baseline`;
+            }
+        }
         return null;
     }
     return `${label} has a drift capture of unknown kind ${JSON.stringify(capture["kind"])}`;
@@ -682,11 +724,11 @@ export const fixedWidthParse = buildTool({
     concurrencySafe: true,
     execute: async (input) => {
         const at = resolveSafe("FixedWidthParse", input.file);
-        const bytes = statSync(at.real).size;
-        if (bytes > LIMITS.fileBytes) {
-            throw new Error(`${at.rel} is ${bytes} bytes, over the ${LIMITS.fileBytes}-byte limit`);
+        const read = readWorkspaceText("FixedWidthParse", input.file, LIMITS.fileBytes);
+        if (read.overLimit) {
+            throw new Error(`${at.rel} is ${read.size} bytes, over the ${LIMITS.fileBytes}-byte limit`);
         }
-        const result = parseFixedWidth(readFileSync(at.real, "utf-8"), input.fields, {
+        const result = parseFixedWidth(read.text, input.fields, {
             skipLines: input.skipLines,
         });
         const limit = input.limit ?? 500;

package/dist/lib/drift.js

@@ -127,17 +127,24 @@ export function chiSquareUpperTail(x, df) {
  * move a verdict. A caller gating on `p` should gate on this first.
  */
 export function chiSquareHomogeneity(reference, current) {
+    // Own properties only. The keys are CELL VALUES, and a stored profile comes
+    // back from JSON.parse as a plain object: `reference["constructor"]` on a
+    // reference that never saw that value is Object's constructor, a function,
+    // and `function + 80` is a string that compares false against 0 — so a
+    // brand-new category named "constructor", "toString" or "__proto__"
+    // vanished from the table and the test answered p = 1 on real drift.
+    const countOf = (counts, key) => Object.hasOwn(counts, key) ? counts[key] : 0;
     // A key recorded as zero on BOTH sides is dropped rather than counted: it
     // would make its column total zero, so both its expected counts would be
     // 0/0, and it would inflate df with a cell that holds no observation.
     const categories = [...new Set([...Object.keys(reference), ...Object.keys(current)])]
-        .filter((key) => (reference[key] ?? 0) + (current[key] ?? 0) > 0)
+        .filter((key) => countOf(reference, key) + countOf(current, key) > 0)
         .sort();
     let referenceTotal = 0;
     let currentTotal = 0;
     for (const key of categories) {
-        referenceTotal += reference[key] ?? 0;
-        currentTotal += current[key] ?? 0;
+        referenceTotal += countOf(reference, key);
+        currentTotal += countOf(current, key);
     }
     const total = referenceTotal + currentTotal;
     const base = {
@@ -171,8 +178,8 @@ export function chiSquareHomogeneity(reference, current) {
     let cellsBelowFive = 0;
     let cellsBelowOne = 0;
     for (const key of categories) {
-        const observedReference = reference[key] ?? 0;
-        const observedCurrent = current[key] ?? 0;
+        const observedReference = countOf(reference, key);
+        const observedCurrent = countOf(current, key);
         const columnTotal = observedReference + observedCurrent;
         // A column total of zero cannot occur: the key is in the union because at
         // least one side counted it. So neither expectation below is 0/0.

package/dist/lib/profile.js

@@ -314,7 +314,9 @@ function captureColumn(numericValues, ordered, nonNull, settings) {
     // `otherCount` still says zero, so the capture claims a complete category
     // list that is missing a category — and a value arriving for the first time
     // today is never named as new. A null prototype makes it an ordinary key,
-    // and `JSON.stringify`/`JSON.parse` round-trip it intact.
+    // and `JSON.stringify`/`JSON.parse` round-trip the keys intact — though
+    // the parsed map is a plain object again, which is why the chi-square
+    // (drift.ts) reads own properties only.
     const valueCounts = Object.create(null);
     for (const { value, count } of kept)
         valueCounts[value] = count;

package/dist/paths.d.ts

@@ -1,10 +1,29 @@
 import { CrewhausError } from "@crewhaus/errors";
-/** Raised when a caller-supplied path resolves outside the workspace root. */
+/**
+ * The longest path this resolves, in UTF-16 code units; a longer one is
+ * refused before it is walked. Nothing that long can be opened or created:
+ * PATH_MAX is 1,024 bytes on macOS and 4,096 on Linux, Windows stops at
+ * 32,767 UTF-16 units, and a path's UTF-8 form is never shorter than its
+ * UTF-16 one. The limit is twice that because the part of a path that exists
+ * is itself under PATH_MAX, so the part that does not is over PATH_MAX on its
+ * own: no spelling of the place reaches it, not even one through a symlink
+ * that shortens the part that exists.
+ */
+export declare const MAX_PATH_CHARS: number;
+/**
+ * Raised when a caller-supplied path resolves outside the workspace root, or
+ * is longer than any path can be.
+ */
 export declare class ToolPermissionError extends CrewhausError {
     readonly name = "ToolPermissionError";
     readonly toolName: string;
     readonly path: string;
-    constructor(toolName: string, attemptedPath: string);
+    /**
+     * Why, when it is not that the location escapes the workspace root: a path
+     * longer than any path can be. A caller that rewords the refusal says this.
+     */
+    readonly reason: string | undefined;
+    constructor(toolName: string, attemptedPath: string, reason?: string);
 }
 /**
  * A validated path, in both forms the tools need.

package/dist/paths.js

@@ -11,15 +11,45 @@
 import { lstatSync, readlinkSync, realpathSync } from "node:fs";
 import * as path from "node:path";
 import { CrewhausError } from "@crewhaus/errors";
-/** Raised when a caller-supplied path resolves outside the workspace root. */
+/**
+ * The longest path this resolves, in UTF-16 code units; a longer one is
+ * refused before it is walked. Nothing that long can be opened or created:
+ * PATH_MAX is 1,024 bytes on macOS and 4,096 on Linux, Windows stops at
+ * 32,767 UTF-16 units, and a path's UTF-8 form is never shorter than its
+ * UTF-16 one. The limit is twice that because the part of a path that exists
+ * is itself under PATH_MAX, so the part that does not is over PATH_MAX on its
+ * own: no spelling of the place reaches it, not even one through a symlink
+ * that shortens the part that exists.
+ */
+export const MAX_PATH_CHARS = 2 * (process.platform === "darwin" ? 1_024 : process.platform === "win32" ? 32_767 : 4_096);
+/** A path as a refusal quotes it: whole, unless it is past {@link MAX_PATH_CHARS}. */
+function shownPath(given) {
+    return given.length > MAX_PATH_CHARS ? `${given.slice(0, 64)}…` : given;
+}
+/** Why a path past {@link MAX_PATH_CHARS} is refused: its length and the limit. */
+function tooLong(abs) {
+    return `it is ${abs.length} characters once resolved, over the ${MAX_PATH_CHARS}-character limit: no path that long can be opened or created`;
+}
+/**
+ * Raised when a caller-supplied path resolves outside the workspace root, or
+ * is longer than any path can be.
+ */
 export class ToolPermissionError extends CrewhausError {
     name = "ToolPermissionError";
     toolName;
     path;
-    constructor(toolName, attemptedPath) {
-        super("tool", `tool "${toolName}" rejected path "${attemptedPath}": resolved location escapes the workspace root`);
+    /**
+     * Why, when it is not that the location escapes the workspace root: a path
+     * longer than any path can be. A caller that rewords the refusal says this.
+     */
+    reason;
+    constructor(toolName, attemptedPath, reason) {
+        super("tool", reason === undefined
+            ? `tool "${toolName}" rejected path "${attemptedPath}": resolved location escapes the workspace root`
+            : `tool "${toolName}" rejected path "${shownPath(attemptedPath)}": ${reason}`);
         this.toolName = toolName;
         this.path = attemptedPath;
+        this.reason = reason;
     }
 }
 /** The workspace root, resolved. Every path is contained within it. */
@@ -67,15 +97,7 @@ function nameExists(p) {
 function resolveLocation(target, depth = 0) {
     if (depth > 40)
         throw new Error(`symlink chain at "${target}" is too long to resolve`);
-    let probe = target;
-    const tail = [];
-    while (!nameExists(probe)) {
-        tail.unshift(path.basename(probe));
-        const parent = path.dirname(probe);
-        if (parent === probe)
-            break; // reached the filesystem root
-        probe = parent;
-    }
+    const { probe, tail } = deepestName(target);
     let probeReal;
     try {
         probeReal = realpathSync(probe);
@@ -97,7 +119,41 @@ function resolveLocation(target, depth = 0) {
         const base = realpathSync(path.dirname(probe));
         probeReal = resolveLocation(path.resolve(base, link), depth + 1);
     }
-    return tail.length > 0 ? path.join(probeReal, ...tail) : probeReal;
+    // One string, not one argument per name: Bun's `path.join` keeps only
+    // (argument count mod 65,536) of its arguments.
+    return tail.length > 0 ? path.join(probeReal, tail) : probeReal;
+}
+/**
+ * `target`, an absolute path, split where its deepest prefix that exists as
+ * a NAME ends: that prefix, and the names below it, which do not exist, as
+ * one string ("" when `target` itself exists). This is `path.dirname` and
+ * `path.basename` worked by index on `target` itself: handing them each
+ * shorter prefix in turn copied the rest of the path once per missing name,
+ * the square of a count the caller picks.
+ */
+function deepestName(target) {
+    const top = path.parse(target).root.length;
+    const isSep = (i) => target[i] === "/" || target[i] === path.sep;
+    let probe = target;
+    let start = target.length;
+    let stop = -1;
+    while (!nameExists(probe)) {
+        // `path.basename(probe)` is `target.slice(start, end)`, and
+        // `path.dirname(probe)` is `target.slice(0, up)`.
+        let end = probe.length;
+        while (end > top && isSep(end - 1))
+            end--;
+        if (stop < 0)
+            stop = end;
+        start = end;
+        while (start > top && !isSep(start - 1))
+            start--;
+        const up = start > top ? start - 1 : top;
+        if (up === probe.length)
+            break; // reached the filesystem root
+        probe = target.slice(0, up);
+    }
+    return { probe, tail: stop < 0 ? "" : target.slice(start, stop) };
 }
 export function resolveSafe(toolName, rel, root = workspaceRoot()) {
     const rootResolved = path.resolve(root);
@@ -107,6 +163,9 @@ export function resolveSafe(toolName, rel, root = workspaceRoot()) {
     if (abs !== rootResolved && !abs.startsWith(`${rootResolved}${path.sep}`)) {
         throw new ToolPermissionError(toolName, rel);
     }
+    // Longer than any path can be: refused before the walk below reads it.
+    if (abs.length > MAX_PATH_CHARS)
+        throw new ToolPermissionError(toolName, rel, tooLong(abs));
     let real;
     try {
         const rootReal = realpathSync(rootResolved);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@crewhaus/tool-table",
-  "version": "0.7.0",
+  "version": "0.8.1",
   "type": "module",
   "description": "Deterministic tabular tools: profiling, drift detection, keyed reconciliation, record linkage, contact normalization, reshaping, sharding and fixed-width parsing",
   "main": "dist/index.js",
@@ -8,18 +8,20 @@
   "exports": {
     ".": {
       "types": "./dist/index.d.ts",
-      "import": "./dist/index.js"
+      "import": "./dist/index.js",
+      "default": "./dist/index.js"
     }
   },
   "scripts": {
     "test": "bun test src"
   },
   "dependencies": {
-    "@crewhaus/errors": "0.7.0",
-    "@crewhaus/tool-builder": "0.7.0",
-    "@crewhaus/tool-catalog": "0.7.0",
-    "@crewhaus/tool-data": "0.7.0",
-    "@crewhaus/tool-math": "0.7.0",
+    "@crewhaus/errors": "0.8.1",
+    "@crewhaus/tool-builder": "0.8.1",
+    "@crewhaus/tool-catalog": "0.8.1",
+    "@crewhaus/tool-data": "0.8.1",
+    "@crewhaus/tool-math": "0.8.1",
+    "@crewhaus/tool-safety": "0.8.1",
     "zod": "^3.23.8"
   },
   "devDependencies": {
@@ -43,5 +45,8 @@
   "publishConfig": {
     "access": "public"
   },
-  "files": ["dist", "README.md", "LICENSE", "NOTICE"]
+  "files": ["dist", "README.md", "LICENSE", "NOTICE"],
+  "engines": {
+    "bun": ">=1.3.14"
+  }
 }